func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; struct data { int info; int l, r; data() { info = 0; l = 0; r = 0; } }; data tr[100000 * 40]; int avail = 0; int update(int no, int s, int e, int in, int val) { int idx = no; if (!no) { idx = ++avail; tr[idx] = data(); } if (s == e) { tr[idx].info += val; return idx; } int mid = (s + e) / 2; if (mid >= in) { tr[idx].l = update(tr[idx].l, s, mid, in, val); } else { tr[idx].r = update(tr[idx].r, mid + 1, e, in, val); } tr[idx].info = (tr[tr[idx].l].info + tr[tr[idx].r].info); return idx; } int query(int idx, int s, int e, int st, int en) { if (idx == 0) return 0; if (s >= st && e <= en) return tr[idx].info; int mid = (s + e) / 2; if (mid >= en) return query(tr[idx].l, s, mid, st, en); else if (mid < st) return query(tr[idx].r, mid + 1, e, st, en); else return query(tr[idx].l, s, mid, st, mid) + query(tr[idx].r, mid + 1, e, mid + 1, en); } int main() { int n; cin >> n; map<int, int> mp; while (n--) { int x, y, z; cin >> x >> y >> z; if (x == 1) { mp[z] = update(mp[z], 1, 1e9 + 7, y, 1); } else if (x == 2) { mp[z] = update(mp[z], 1, 1e9 + 7, y, -1); } else { printf( %d n , query(mp[z], 1, 1e9 + 7, 1, y)); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a; map<int, int> mp; for (int i = 0; i < n; i++) { int val; cin >> val; if (mp.find(val) == mp.end()) { mp[val]++; a.push_back(val); } } sort(a.begin(), a.end()); int i = 0, sum = 0; int g = a.size(); while (i < min(g, k)) { int x = a[i] - sum; cout << x << endl; sum += x; i++; } while (i < k) { cout << 0 << endl; i++; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int xpow(long long int a, long long int b) { if (b == 0) return 1; if (b % 2 == 0) { long long int k = xpow(a, b / 2); return k * k; } if (b % 2 != 0) return a * xpow(a, b - 1); } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n, sx, sy; cin >> n >> sx >> sy; int l = 0, r = 0, d = 0, u = 0; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; if (x > sx) r++; if (x < sx) l++; if (y > sy) u++; if (y < sy) d++; } int maxi = max({l, r, d, u}); cout << maxi << endl; if (l == maxi) sx--; else if (r == maxi) sx++; else if (u == maxi) sy++; else if (d == maxi) sy--; cout << sx << << sy << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; double a; int ans = 0; vector<int> v; int n, m; cin >> n; int ara1[n]; for (int i = 0; i < n; i++) cin >> ara1[i]; cin >> m; int ara2[m]; for (int i = 0; i < m; i++) cin >> ara2[i]; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { a = (double)ara2[i] / ara1[j]; if (a == (int)a) { int b = a; v.push_back(b); } } } sort(v.rbegin(), v.rend()); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { a = (double)ara2[i] / ara1[j]; if (a == v[0]) ans++; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi(3.14159265358979); int a[100010], d[100010]; int main() { int x, i, j, n; scanf( %d , &n); scanf( %d , &x); for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < n; i++) d[i] = abs(a[i] - x); int ans = 0; if (n == 1) ans = 0; else if (x >= a[n - 1]) ans = d[1]; else if (x <= a[0]) ans = d[n - 2]; else if (n == 2) ans = min(d[0], d[1]); else if (x > a[0] && x <= a[1]) ans = min(d[n - 1], min(2 * d[0] + d[n - 2], 2 * d[n - 2] + d[0])); else if (x < a[n - 1] && x >= a[n - 2]) ans = min(d[0], min(2 * d[n - 1] + d[1], 2 * d[1] + d[n - 1])); else ans = min(2 * d[0] + d[n - 2], min(2 * d[n - 2] + d[0], min(2 * d[n - 1] + d[1], 2 * d[1] + d[n - 1]))); cout << ans; return 0; }
|
#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { long long int n, i, j, k, f = 0; scanf( %lld , &n); long long int a[n]; for (i = 0; i < n; i++) scanf( %lld , &a[i]); for (i = 2; i < n; i++) { if (a[i] >= a[0] + a[1]) { f = 1; break; } } if (f == 1) printf( 1 2 %lld n , i + 1); else printf( -1 n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; int v = 0; int ans = 0, ans1 = 0; for (int i = 0; i < n; i++) { int a; cin >> a; if (i < k - 1 && a != 0) ans1++; if (i == k - 1) ans = a; if (i >= k - 1 && a == ans && ans > 0) v++; } cout << v + ans1 << n ; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void pv(vector<T> &vec) { for (int i = 0; i < (int)(vec).size(); i++) cout << vec[i] << (i == (int)(vec).size() - 1 ? n : ); } bool ok(int x) { return (x % 10 == 7); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int a, b, x, ans = 0; cin >> x >> a >> b; while (1) { if (ok(a) || ok(b)) break; if (b >= x) b -= x; else { b = 60 - abs(b - x); a = (a ? a - 1 : 23); } ans++; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int sN = 1 << 19; long long v[sN], d[sN], l[sN], r[sN], s[sN], w[sN]; int n, m; int t, Left, Right; long long x; void down(int a, int c1, int c2) { d[c1] += d[a]; d[c2] += d[a]; s[c1] += d[a] * w[c1]; s[c2] += d[a] * w[c2]; d[a] = 0; if (v[a] > 0) v[c1] = v[c2] = v[a]; } long long get(int a) { if (Right < l[a] or r[a] < Left) return 0ll; if (Left <= l[a] and r[a] <= Right) return s[a]; int c1 = a << 1, c2 = c1 + 1; down(a, c1, c2); return get(c1) + get(c2); } void update(int a) { if (Right < l[a] or r[a] < Left) return; if (Left <= l[a] and r[a] <= Right and v[a] > 0) { long long inc = x - v[a]; if (inc < 0) inc = -inc; d[a] += inc; s[a] += inc * w[a]; v[a] = x; return; } int c1 = a << 1, c2 = c1 + 1; down(a, c1, c2); update(c1); update(c2); s[a] = s[c1] + s[c2]; if (v[c1] == v[c2]) v[a] = v[c1]; else v[a] = 0; } int main() { scanf( %d %d , &n, &m); int nn = 1; for (; nn < n; nn <<= 1) ; n = nn--; for (int i = 1; i <= n; i++) v[nn + i] = l[nn + i] = r[nn + i] = i, w[nn + i] = 1; for (int i = nn, j = i << 1; i > 0; i--, j = i << 1) l[i] = l[j], r[i] = r[j + 1], w[i] = w[j] << 1; for (; m--;) { scanf( %d , &t); if (t == 1) { scanf( %d %d , &Left, &Right); scanf( %I64d , &x); update(1); } else { scanf( %d %d , &Left, &Right); printf( %I64d n , get(1)); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int inf = 0x3f3f3f3f; const int mod = 998244353; int a[N], n, L; bool check(double x, int id) { double s1 = 0, s2 = 0; double t = x; int s = 1; for (int i = 1; i <= n + 1; i++) { double cur = 1.0 * (a[i] - a[i - 1]) / s; if (cur <= t) { s1 = a[i]; t -= cur; } else { s1 += t * s; break; } s++; } s = 1; t = x; for (int i = n; i >= 0; i--) { double cur = 1.0 * (a[i + 1] - a[i]) / s; if (cur <= t) { s2 = L - a[i]; t -= cur; } else { s2 += t * s; break; } s++; } return s1 + s2 >= 1.0 * L; } void solve() { scanf( %d%d , &n, &L); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } a[n + 1] = L; double l = 0, r = L; double res = 1e9; for (int i = 1; i <= 100; i++) { double mid = 1.0 * (l + r) / 2; if (check(mid, i)) { res = mid; r = mid; } else l = mid; } printf( %.6f n , res); } int main() { int t; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, i, j, v[1005]; char s[1005]; int main() { scanf( %d n , &n); scanf( %s , s + 1); s[0] = L ; s[n] = R ; for (i = 1; i <= n; ++i) { j = i - 1; while (s[j] != L ) { if (s[j] == R ) ++v[i]; --j; } int aux = 0; j = i; while (s[j] != R ) { if (s[j] == L ) ++aux; ++j; } v[i] = max(v[i], aux); ++v[i]; } for (i = 1; i <= n; ++i) printf( %d , v[i]); }
|
#include <bits/stdc++.h> using namespace std; long long int max(long long int a, long long int b) { if (a < b) swap(a, b); return a; } long long int min(long long int a, long long int b) { if (a >= b) swap(a, b); return a; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string st, c; long long int len, k, y[29] = {0}, i; cin >> len >> k; cin >> st; c = st; sort(c.begin(), c.end()); for (i = 0; i < k; i++) { y[c[i] - 96] += 1; } for (i = 0; i < len; i++) { if (y[st[i] - 96]) y[st[i] - 96] -= 1; else cout << st[i]; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) using namespace std; void solve() { long long int n, k; cin >> n >> k; vector<long long int> a(n); for (long long int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); long long int ones = 0; vector<long long int> b; for (long long int i = 0; i < k; i++) { long long int temp; cin >> temp; if (temp == 1) ones++; else b.push_back(temp); } sort(b.begin(), b.end(), greater<long long int>()); k = b.size(); long long int ans = accumulate(a.end() - 1 - ones + 1, a.end(), 0ll) * 2; long long int end = n - 1 - ones, beg = 0; for (long long int i = 0; i < k; i++) { long long int cur = b[i]; ans += (a[end]); cur--; end--; if (cur == 0) ans += (a[end + 1]); else { ans += a[beg]; beg += cur; } } cout << ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int __t; cin >> __t; while (__t--) { solve(); cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; os << ] ; return os; } template <class T> ostream& operator<<(ostream& os, set<T> second) { os << { ; for (auto s : second) os << s << ; return os << } ; } template <class T> ostream& operator<<(ostream& os, multiset<T> second) { os << { ; for (auto s : second) os << s << ; return os << } ; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } template <class L, class R> ostream& operator<<(ostream& os, map<L, R> M) { os << { ; for (auto m : M) os << ( << m.first << : << m.second << ) ; return os << } ; } template <class L, class R> ostream& operator<<(ostream& os, unordered_map<L, R> M) { os << { ; for (auto m : M) os << ( << m.first << : << m.second << ) ; return os << } ; } const long long N = 2010, M = 1e9 + 7; long long n, a[N][N], dp1[N][N], dp2[N][N], dp3[N][N]; void solve() { cin >> n; for (long long i = (0); i <= n - 1; i++) for (long long j = (0); j <= n - 1; j++) cin >> a[i][j]; for (long long i = (0); i <= n - 1; i++) dp1[i][0] = a[i][0], dp1[0][i] = a[0][i], dp2[i][n - 1] = a[i][n - 1], dp2[0][n - i - 1] = a[0][n - i - 1]; for (long long i = (1); i <= n - 1; i++) for (long long j = (1); j <= n - 1; j++) dp1[i][j] = a[i][j] + dp1[i - 1][j - 1]; for (long long i = (1); i <= n - 1; i++) for (long long j = (0); j <= n - 2; j++) dp2[i][j] = a[i][j] + dp2[i - 1][j + 1]; for (long long i = (0); i <= n - 1; i++) for (long long j = (0); j <= n - 1; j++) { long long i1 = i + min(n - i - 1, n - j - 1); long long j1 = j + min(n - i - 1, n - j - 1); long long i2 = i + min(n - i - 1, j); long long j2 = j - min(n - i - 1, j); dp3[i][j] = dp1[i1][j1] + dp2[i2][j2] - a[i][j]; } long long ans1 = LLONG_MIN, ans2 = LLONG_MIN, posx1, posy1, posx2, posy2; for (long long i = (0); i <= n - 1; i++) for (long long j = (0); j <= n - 1; j++) { if ((i + j) % 2 == 0 && dp3[i][j] > ans1) { ans1 = max(ans1, dp3[i][j]); posx1 = i + 1; posy1 = j + 1; } else if ((i + j) % 2 == 1 && dp3[i][j] > ans2) { ans2 = max(ans2, dp3[i][j]); posx2 = i + 1; posy2 = j + 1; } } cout << ans1 + ans2 << n ; cout << posx1 << << posy1 << << posx2 << << posy2 << n ; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int a[2][2]; node() { a[0][0] = a[0][1] = a[1][0] = a[1][1] = 0; } int *operator[](const size_t &s) { return a[s]; } }; node segTree[400008], L[400008]; node id, M, zero; int a[100002]; int lazy[400008]; inline node operator+(node &a, node &b) { node res; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) res[i][j] = (a[i][j] + b[i][j]) % 1000000007; return res; } inline node operator*(node &a, node &b) { node res; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) for (int k = 0; k < 2; k++) res[i][j] = (res[i][j] + (1ll * a[i][k] * b[k][j]) % 1000000007) % 1000000007; return res; } inline node matPower(int n) { node res = id; node m = M; while (n > 0) { if (n & 1) res = res * m; m = m * m; n >>= 1; } return res; } inline void buildTree(int v, int s, int e) { L[v] = id; lazy[v] = 0; if (s == e) { segTree[v] = matPower(a[s]); return; } int m = (s + e) / 2; buildTree(2 * v, s, m); buildTree(2 * v + 1, m + 1, e); segTree[v] = segTree[2 * v] + segTree[2 * v + 1]; } inline void propogate(int v, int l, int r) { if (lazy[v] > 0) { segTree[v] = segTree[v] * L[v]; if (l != r) { lazy[2 * v] = lazy[2 * v + 1] = 1; L[2 * v] = L[2 * v] * L[v]; L[2 * v + 1] = L[2 * v + 1] * L[v]; } lazy[v] = 0; L[v] = id; } return; } inline void update(int v, int tl, int tr, int l, int r, node x) { propogate(v, tl, tr); if (l > r) return; if (tl == l && tr == r) { lazy[v] = 1; L[v] = x; propogate(v, tl, tr); return; } int tm = (tl + tr) / 2; update(2 * v, tl, tm, l, min(tm, r), x); update(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, x); segTree[v] = segTree[2 * v] + segTree[2 * v + 1]; } inline node query(int v, int tl, int tr, int l, int r) { propogate(v, tl, tr); if (l > r) return zero; if (tl == l && tr == r) return segTree[v]; int tm = (tl + tr) / 2; node left = query(2 * v, tl, tm, l, min(tm, r)); node right = query(2 * v + 1, tm + 1, tr, max(l, tm + 1), r); return (left + right); } int main() { id[0][0] = id[1][1] = 1; M[0][0] = M[0][1] = M[1][0] = 1; ios::sync_with_stdio(false); int n, m, q, l, r, x; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; buildTree(1, 0, n - 1); while (m--) { cin >> q; if (q == 1) { cin >> l >> r >> x; node val = matPower(x); update(1, 0, n - 1, l - 1, r - 1, val); } else { cin >> l >> r; cout << query(1, 0, n - 1, l - 1, r - 1)[0][1] << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long s = 1; for (long long i = 1; i <= n; i++) { s += (i - 1) * 4; } cout << s; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; int a[N]; int main() { ios_base::sync_with_stdio(false); int n, U; cin >> n >> U; for (int i = 1; i <= n; ++i) cin >> a[i]; double ans = -1; for (int i = 1, j = 1; i + 1 <= n; ++i) { while (j + 1 <= n and a[j + 1] - a[i] <= U) ++j; if (j - i + 1 < 3) continue; ans = max(ans, (double)(a[j] - a[i + 1]) / (a[j] - a[i])); } cout << fixed << setprecision(9) << ans << n ; }
|
#include <bits/stdc++.h> int main() { int q; std::cin >> q; while (q--) { int n, ans(0); std::cin >> n; std::set<std::string> check, p; std::string s; std::vector<std::string> res, a(n); for (int i = 0; i < n; i++) { std::cin >> a[i]; check.insert(a[i]); } for (int i = 0; i < n; i++) { if (p.find(a[i]) != p.end()) { std::string t = a[i]; for (int x = 0; x < 10; x++) { if (check.find(t) == check.end()) { check.insert(t); p.insert(t); break; } t[0] = char( 0 + x); } ++ans; res.push_back(t); } else { res.push_back(a[i]); p.insert(a[i]); } } std::cout << ans << std::endl; for (int i = 0; i < res.size(); i++) { std::cout << res[i] << std::endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef unsigned long long int ull; inline void smax(int &x, int y) { x = max(x, y); } inline void smin(int &x, int y) { x = min(x, y); } ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); } ll n, m, a, b; vector<vector<int> > gr; vector<int> vis; ll con = 0; int dfs(int s, int prt) { vis[s] = 1; con++; int f = 0; if (prt == s) f = 1; for (__typeof(gr[s].size()) i = (0) - ((0) > (gr[s].size())); i != (gr[s].size()) - ((0) > (gr[s].size())); i += 1 - 2 * ((0) > (gr[s].size()))) { int x = gr[s][i]; if (!vis[x]) { if (dfs(x, prt) == 1) f = 1; } } return f; } int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); int tcase; cin >> tcase; for (__typeof(tcase + 1) tc = (1) - ((1) > (tcase + 1)); tc != (tcase + 1) - ((1) > (tcase + 1)); tc += 1 - 2 * ((1) > (tcase + 1))) { cin >> n >> m >> a >> b; gr.resize(0); vis.resize(0); gr.resize(n + 1); vis.resize(n + 1); for (__typeof(m) i = (0) - ((0) > (m)); i != (m) - ((0) > (m)); i += 1 - 2 * ((0) > (m))) { int x, y; cin >> x >> y; gr[x].push_back(y); gr[y].push_back(x); } ll con1 = 0; vis[a] = 1; for (__typeof(gr[a].size()) i = (0) - ((0) > (gr[a].size())); i != (gr[a].size()) - ((0) > (gr[a].size())); i += 1 - 2 * ((0) > (gr[a].size()))) { if (vis[gr[a][i]]) continue; con = 0; int tch = dfs(gr[a][i], b); if (tch == 0) { con1 += con; } } vis.resize(0); vis.resize(n + 1); vis[b] = 1; ll con2 = 0; for (__typeof(gr[b].size()) i = (0) - ((0) > (gr[b].size())); i != (gr[b].size()) - ((0) > (gr[b].size())); i += 1 - 2 * ((0) > (gr[b].size()))) { con = 0; if (vis[gr[b][i]]) continue; int tch = dfs(gr[b][i], a); if (tch == 0) { con2 += con; } } cout << con2 * con1 << n ; } }
|
#include <bits/stdc++.h> using namespace std; vector<int> SEC; int main() { long long n, x, y; cin >> n >> x >> y; long long tedX = 0, tedY = 0; while (tedX + tedY < x + y) { if ((tedX + 1) * y > (tedY + 1) * x) { SEC.push_back(2); tedY++; } else if ((tedX + 1) * y < (tedY + 1) * x) { SEC.push_back(1); tedX++; } else { SEC.push_back(-1); SEC.push_back(-1); tedX++; tedY++; } } for (int i = 0; i < n; i++) { long long tmp; cin >> tmp; long long ans = SEC[(tmp - 1) % (x + y)]; if (ans == 1) { cout << Vanya << endl; } else if (ans == 2) { cout << Vova << endl; } else cout << Both << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 400010; struct Event { int x, type, ind; Event() {} Event(int x, int type, int ind) : x(x), type(type), ind(ind) {} bool operator<(const Event &other) const { return make_pair(x, type) < make_pair(other.x, other.type); } }; int n, k; int l[N], r[N]; Event a[N]; bool del[N]; set<pair<int, int> > q; vector<int> res; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %d%d , &l[i], &r[i]); a[2 * i - 1] = Event(l[i], 0, i); a[2 * i] = Event(r[i], 1, i); } sort(a + 1, a + 2 * n + 1); int cov = 0; int ans = 0; for (int i = 1; i <= n; i++) del[i] = false; for (int i = 1; i <= 2 * n; i++) { int j = a[i].ind; if (a[i].type == 0) { q.insert(make_pair(-r[j], j)); cov++; if (cov > k) { cov--; ans++; int ind = (*q.begin()).second; del[ind] = true; res.push_back(ind); q.erase(q.begin()); } } else if (!del[j]) { cov--; q.erase(make_pair(-r[j], j)); } } printf( %d n , ans); for (int x : res) printf( %d , x); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using str = string; using pi = pair<int, int>; using pl = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>; using vpi = vector<pair<int, int>>; using vvi = vector<vi>; int Bit(int mask, int b) { return (mask >> b) & 1; } template <class T> bool ckmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } template <class T> bool ckmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; } const int INFi = 2e9; const ll INF = 2e18; const int maxN = 605; const int LG = 20; struct blossom { int n, m; vector<int> mate; vector<vector<int>> b; vector<int> p, d, bl; vector<vector<int>> g; blossom(int n) : n(n) { m = n + n / 2; mate.assign(n, -1); b.resize(m); p.resize(m); d.resize(m); bl.resize(m); g.assign(m, vector<int>(m, -1)); } void add_edge(int u, int v) { g[u][v] = u; g[v][u] = v; } void match(int u, int v) { g[u][v] = g[v][u] = -1; mate[u] = v; mate[v] = u; } vector<int> trace(int x) { vector<int> vx; while (true) { while (bl[x] != x) x = bl[x]; if (!vx.empty() && vx.back() == x) break; vx.push_back(x); x = p[x]; } return vx; } void contract(int c, int x, int y, vector<int> &vx, vector<int> &vy) { b[c].clear(); int r = vx.back(); while (!vx.empty() && !vy.empty() && vx.back() == vy.back()) { r = vx.back(); vx.pop_back(); vy.pop_back(); } b[c].push_back(r); b[c].insert(b[c].end(), vx.rbegin(), vx.rend()); b[c].insert(b[c].end(), vy.begin(), vy.end()); for (int i = 0; i <= c; i++) { g[c][i] = g[i][c] = -1; } for (int z : b[c]) { bl[z] = c; for (int i = 0; i < c; i++) { if (g[z][i] != -1) { g[c][i] = z; g[i][c] = g[i][z]; } } } } vector<int> lift(vector<int> &vx) { vector<int> A; while (vx.size() >= 2) { int z = vx.back(); vx.pop_back(); if (z < n) { A.push_back(z); continue; } int w = vx.back(); int i = (A.size() % 2 == 0 ? find(b[z].begin(), b[z].end(), g[z][w]) - b[z].begin() : 0); int j = (A.size() % 2 == 1 ? find(b[z].begin(), b[z].end(), g[z][A.back()]) - b[z].begin() : 0); int k = b[z].size(); int dif = (A.size() % 2 == 0 ? i % 2 == 1 : j % 2 == 0) ? 1 : k - 1; while (i != j) { vx.push_back(b[z][i]); i = (i + dif) % k; } vx.push_back(b[z][i]); } return A; } int solve() { for (int ans = 0;; ans++) { fill(d.begin(), d.end(), 0); queue<int> Q; for (int i = 0; i < m; i++) bl[i] = i; for (int i = 0; i < n; i++) { if (mate[i] == -1) { Q.push(i); p[i] = i; d[i] = 1; } } int c = n; bool aug = false; while (!Q.empty() && !aug) { int x = Q.front(); Q.pop(); if (bl[x] != x) continue; for (int y = 0; y < c; y++) { if (bl[y] == y && g[x][y] != -1) { if (d[y] == 0) { p[y] = x; d[y] = 2; p[mate[y]] = y; d[mate[y]] = 1; Q.push(mate[y]); } else if (d[y] == 1) { vector<int> vx = trace(x); vector<int> vy = trace(y); if (vx.back() == vy.back()) { contract(c, x, y, vx, vy); Q.push(c); p[c] = p[b[c][0]]; d[c] = 1; c++; } else { aug = true; vx.insert(vx.begin(), y); vy.insert(vy.begin(), x); vector<int> A = lift(vx); vector<int> B = lift(vy); A.insert(A.end(), B.rbegin(), B.rend()); for (int i = 0; i < (int)A.size(); i += 2) { match(A[i], A[i + 1]); if (i + 2 < (int)A.size()) add_edge(A[i + 1], A[i + 2]); } } break; } } } } if (!aug) return ans; } } }; vector<int> g1[maxN]; bool used[maxN]; bool was[maxN]; int comp[maxN]; bool ok = false; int ee = 0; int vv = 0; void dfs(int v, int p) { ee += (int)g1[v].size(); vv++; was[v] = true; for (auto &u : g1[v]) { if (u == p) continue; if (was[u]) { ok = true; continue; } dfs(u, v); } } void dfs2(int v) { used[v] = true; for (auto &u : g1[v]) { if (used[u]) continue; dfs2(u); } } void dfs3(int v) { for (auto &u : g1[v]) { if (comp[u]) continue; comp[u] = comp[v]; dfs3(u); } } vector<pair<int, int>> gg[maxN]; bool U[maxN]; void my_assert(bool x) { if (!x) exit(0); } void find_answ(vector<int> a) { int n = a.size(); vector<array<int, 4>> kek1; for (int i = 0, j = 0; i < n; i = j) { if (a[i] != 0) { j++; continue; } while (j < n && a[j] == 0) j++; int len = j - i; if (len % 2 == 0) continue; my_assert(i > 0 && j < n); if (a[i - 1] == a[j]) { a[i] = a[i - 1]; continue; } gg[a[i - 1]].emplace_back(a[j], kek1.size()); gg[a[j]].emplace_back(a[i - 1], kek1.size()); kek1.push_back({a[i - 1], a[j], i, j - 1}); } for (int i = 1; i < n; ++i) { if (a[i] == a[i - 1] && a[i] != 0) { U[a[i]] = true; } } queue<int> q; vi h(kek1.size(), 0); auto make = [&](int i, int c) { h[i] = 1; auto [x, y, l, r] = kek1[i]; if (x == c) { a[l] = c; } else { my_assert(y == c); a[r] = c; } }; function<void(int)> dfss = [&](int v) { for (auto &[u, i] : gg[v]) { if (U[u] || h[i]) continue; U[u] = true; make(i, u); dfss(u); } }; for (int i = 1; i < maxN; ++i) { if (U[i]) { dfss(i); continue; } } function<void(int)> go = [&](int v) { for (auto &[u, i] : gg[v]) { if (U[u] || h[i]) continue; U[u] = true; make(i, u); go(u); } }; vi deg(maxN, 0); for (int i = 1; i < maxN; ++i) { if (U[i]) continue; deg[i] = gg[i].size(); if (gg[i].size() == 1) { q.push(i); } } while (!q.empty()) { int v = q.front(); q.pop(); vector<pair<int, int>> tt; for (auto &[u, i] : gg[v]) { if (U[u]) continue; tt.emplace_back(u, i); } my_assert(tt.size() <= 1); if (tt.empty()) continue; auto [u, i] = tt.back(); U[v] = true; make(i, v); deg[u]--; if (deg[u] == 1) { q.push(u); } } for (int i = 1; i < maxN; ++i) { if (deg[i] == 0 || U[i]) continue; go(i); } int k = 1; for (int i = 1; i < n; ++i) { if (a[i] == 0 && a[i - 1] == 0) { while (k < maxN && U[k]) k++; a[i] = a[i - 1] = k++; if (k < maxN) U[k] = true; } else if (a[i - 1] == 0) { a[i - 1] = 1; } } for (int i = 0; i < (n); ++i) cout << a[i] << ; cout << n ; } void solve() { int n; cin >> n; vi a(n); for (int i = 0; i < (n); ++i) cin >> a[i]; int L, R; int g = 0; { int k = 0; while (k < n && a[k] == 0) k++; if (k == n) { for (int i = 1; i < n; i += 2) { a[i] = a[i - 1] = (i / 2) + 1; } a[n - 1] = a[n - 2]; for (int i = 0; i < (n); ++i) cout << a[i] << ; return; } L = k; g += k / 2; if (k % 2) { used[a[k]] = true; a[k - 1] = a[k]; } } { int k = n - 1; while (k >= 0 && a[k] == 0) k--; R = k; g += (n - 1 - k) / 2; if ((n - 1 - k) % 2) { used[a[k]] = true; a[k + 1] = a[k]; } } for (int i = L + 1; i <= R; ++i) { if (a[i] == 0) continue; if (a[i] != a[i - 1]) continue; used[a[i]] = true; } vector<array<int, 4>> kek; for (int i = L, j = L; i <= R; i = j) { j = i + 1; if (a[i] != 0) continue; while (j <= R && a[j] == 0) j++; int len = j - i; int t1 = a[i - 1]; int t2 = a[j]; if (len % 2) { g += len / 2; g1[t1].push_back(t2); g1[t2].push_back(t1); continue; } g += (len) / 2 - 1; kek.push_back({t1, t2, i, j - 1}); } for (int i = 1; i < maxN; ++i) { if (was[i]) continue; ee = vv = 0; ok = false; dfs(i, -1); if ((vv - 1) * 2 != ee) { ok = true; } if (ok) { used[i] = true; } } for (int i = 1; i < maxN; ++i) { if (used[i]) { dfs2(i); } } int C = 0; int t = 0; for (int i = 1; i < maxN; ++i) { if (used[i]) continue; t++; if (comp[i]) continue; C++; t--; comp[i] = C; dfs3(i); } blossom B(C + 1); set<pair<int, int>> wasss; for (auto &[a, b, i, j] : kek) { if (used[a] || used[b] || comp[a] == comp[b]) { g++; continue; } pair<int, int> tmp = {comp[a], comp[b]}; if (tmp.first > tmp.second) swap(tmp.first, tmp.second); if (wasss.count(tmp)) continue; wasss.insert(tmp); B.add_edge(comp[a], comp[b]); } B.solve(); set<pair<int, int>> have; for (int i = 1; i <= C; ++i) { if (i < B.mate[i]) { have.insert({i, B.mate[i]}); } } auto ans = a; for (auto &[a, b, i, j] : kek) { if (used[a] || used[b] || comp[a] == comp[b]) { continue; } pair<int, int> cur = {comp[a], comp[b]}; if (cur.first > cur.second) swap(cur.first, cur.second); if (!have.count(cur)) { g++; continue; } have.erase(cur); ans[i] = ans[i - 1]; ans[j] = ans[j + 1]; } find_answ(ans); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; for (int i = 0; i < (t); ++i) { solve(); } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const int MAXN = -1; const int MOD = 1; const int INF = (int)(1e9); int sign(long long x) { if (x > 0) return 1; if (x < 0) return -1; return 0; } vector<int> getB(vector<int> a, int n, int &s) { vector<int> b(a.size() + 40); for (int i = 0; i < (int)a.size(); i++) { int x = a[i]; int j = i; while (x) { b[j] += x % 2; x /= 2; j++; } } for (int j = 0; j < (int)b.size(); j++) { if (b[j]) { b[j + 1] += b[j] / 2; b[j] %= 2; } } int mx = -1; for (int j = 0; j < (int)b.size(); j++) if (b[j] != 0) mx = j; if (mx == -1) { s = 0; return vector<int>(a.size(), 0); } s = 1; if (b[mx] == -1) { s = -1; for (int i = 0; i < (int)b.size(); i++) b[i] *= -1; } for (int i = 0; i < (int)b.size(); i++) { b[i + 1] += b[i] / 2; b[i] %= 2; if (b[i] == -1) { b[i] = 1; b[i + 1] += -1; } } return b; } int fastsolve(vector<int> a, int n, int k) { for (int i = 0; i < 40; i++) a.push_back(0); long long cur = 0; int mn = INF, mx = -INF; int s; vector<int> b = getB(a, n, s); for (int i = 0; i < (int)b.size(); i++) { if (b[i] == 1) { mn = min(mn, i); mx = max(mx, i); } } if (mx - mn > 35) { return 0; } cur = 0; for (int i = mx; i >= mn; i--) { cur *= 2; if (i != mn) cur += b[i]; } cur *= s; int ans = 0; for (int i = mn; i >= 0; i--) { cur += b[i] * s; if (abs(cur) > 2LL * k) { break; } ans += i <= n && abs(cur - a[i]) <= k && (i != n || abs(cur - a[i]) != 0); cur *= 2; } return ans; } int slowsolve(vector<int> a, int n, int k) { for (int i = 0; i < 40; i++) a.push_back(0); int ans = 0; for (int i = 0; i <= n; i++) { vector<int> na = a; for (int j = -k; j <= k; j++) { na[i] = j; if (i == n && j == 0) continue; int s; getB(na, n, s); if (s == 0) { ans++; getB(na, n, s); } } } return ans; } int main() { int n, k; while (scanf( %d%d , &n, &k) == 2) { vector<int> a(n + 1); for (int i = 0; i <= n; i++) scanf( %d , &a[i]); printf( %d n , fastsolve(a, n, k)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long T = 0; int f = 0; char c = getchar(); for (; c < 0 || c > 9 ; c = getchar()) f |= c == - ; for (; c >= 0 && c <= 9 ; c = getchar()) T = T * 10 + c - 0 ; return f ? -T : T; } const double eps = 1e-7; const int maxn = 1e5 + 233; const double pi = acos(-1.0); struct Vector { double x, y, r; } A[maxn]; int n, a; double ans; struct WZP_AK_SZB { double l, r; bool operator<(const WZP_AK_SZB &n) const { if (l == n.l) return r > n.r; return l < n.l; } } B[maxn]; int numB; set<double> S; set<double>::iterator it; bool check(double x) { numB = 0; for (register int i = (1); i <= (n); ++i) { double dis = sqrt(((A[i].x - a) * (A[i].x - a)) + ((A[i].y) * (A[i].y))); if (dis > A[i].r + x || A[i].r > dis + x || x > dis + A[i].r) continue; double u = atan2(A[i].y, A[i].x - a); double t = acos((((dis) * (dis)) + ((x) * (x)) - ((A[i].r) * (A[i].r))) / 2.0 / dis / x); double l = u - t, r = u + t; if (l < -pi) l += 2 * pi; if (l > pi) l -= 2 * pi; if (r < -pi) r += 2 * pi; if (r > pi) r -= 2 * pi; if (l > r) swap(l, r); B[++numB].l = l; B[numB].r = r; } sort(B + 1, B + 1 + numB); S.clear(); for (register int i = (1); i <= (numB); ++i) { it = S.upper_bound(B[i].l); if (it != S.end() && *it < B[i].r) return true; S.insert(B[i].r); } return false; } int main() { n = read(), a = read(); for (register int i = (1); i <= (n); ++i) { A[i].x = read(), A[i].y = read(); A[i].r = sqrt(((A[i].x + a) * (A[i].x + a)) + ((A[i].y) * (A[i].y))); } double l = 0.0; double r = 2.0 * a; while (r - l > 1e-7) { double mid = (l + r) / 2; if (check(mid)) { r = mid; } else { l = mid; } } printf( %.10lf n , l); }
|
#include <bits/stdc++.h> using namespace std; struct child { long long v, p, d; }; child c[4123]; bool gone[4123]; int main() { int n; scanf( %d , &n); for (int i = 0; i < (int)(n); i++) { scanf( %lld%lld%lld , &c[i].v, &c[i].d, &c[i].p); } int ans = 0; vector<int> all; for (int i = 0; i < (int)(n); i++) { if (gone[i]) continue; ans++; all.push_back(i + 1); for (int j = i + 1; j < n && c[i].v; j++) { if (gone[j]) continue; c[j].p -= c[i].v; c[i].v--; } long long dec = 0; for (int j = i + 1; j < n; j++) { if (gone[j]) continue; c[j].p -= dec; if (c[j].p < 0) { gone[j] = 1; dec += c[j].d; } } } printf( %d n , ans); for (int i = 0; i < (int)(all.size()); i++) { printf( %d%c , all[i], (i == all.size() - 1 ? n : )); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, q, i; cin >> q; for (i = 0; i < q; i++) { cin >> n; if (n == 2) { cout << 2 << endl; } else if (n % 2 == 1) { cout << 1 << endl; } else if (n != 2 && n % 2 == 0) { cout << 0 << endl; } } }
|
#include <bits/stdc++.h> using namespace std; int n, mnPre[(100005)], mxPre[(100005)], mnSuf[(100005)], mxSuf[(100005)]; pair<int, int> a[2][(100005)]; long long solve(int ax) { sort(a[ax] + 1, a[ax] + 1 + n); for (int i = 1; i <= n; ++i) { mnPre[i] = min(mnPre[i - 1], a[ax][i].second); mxPre[i] = max(mxPre[i - 1], a[ax][i].second); } for (int i = n; i >= 1; --i) { mnSuf[i] = min(mnSuf[i + 1], a[ax][i].second); mxSuf[i] = max(mxSuf[i + 1], a[ax][i].second); } long long r = (1LL << 60) - 1; long long m = 0; int mn, mx; for (int i = 59; i >= 0; --i) { bool allowed = 0; m = r - (1LL << i); allowed = (1LL * (a[ax][n].first - a[ax][1].first) * (a[ax][n].first - a[ax][1].first)) <= m; for (int en = 1, st = 1; en <= n && !allowed; ++en) { while ((1LL * (a[ax][en].first - a[ax][st].first) * (a[ax][en].first - a[ax][st].first)) > m) ++st; mn = min(mnPre[st - 1], mnSuf[en + 1]); mx = max(mxPre[st - 1], mxSuf[en + 1]); allowed = (1LL * (mx - mn) * (mx - mn)) <= m && max((1LL * (mn) * (mn)), (1LL * (mx) * (mx))) + max((1LL * (a[ax][en].first) * (a[ax][en].first)), (1LL * (a[ax][st].first) * (a[ax][st].first))) <= m; } if (allowed) r -= (1LL << i); } return r; } int main() { scanf( %d , &n); for (int i = 1, x, y; i <= n; ++i) { scanf( %d%d , &x, &y); a[0][i] = {x, y}, a[1][i] = {y, x}; } printf( %I64d , min(solve(0), solve(1))); }
|
#include <bits/stdc++.h> using namespace std; long long int M = 1000000007; long long int min(long long int a, long long int b, long long int c, long long int d) { long long int arr[4] = {a, b, c, d}; sort(arr, arr + 4); return arr[0]; } long long int max(long long int a, long long int b, long long int c, long long int d) { long long int arr[4] = {a, b, c, d}; sort(arr, arr + 4); return arr[3]; } long long int gcd(long long int a, long long int b) { if (b < a) { int temp = a; a = b; b = temp; } if (a == 0) { return b; } return gcd(b % a, a); } long long int lcm(long long int a, long long int b) { return (a * b / gcd(a, b)); } vector<long long int> getprimes() { vector<long long int> pl(101, 1); for (int i = 2; i <= 100; i++) { if (pl[i] == 1) { for (int j = 2 * i; j <= 100; j += i) { pl[j] = 0; } } } return pl; } double distsqrd(double x1, double y1, double x2, double y2) { return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); } long long int fact(long long int first) { long long int ans = 1; if (first == 0) { return 1; } while (first > 0) { ans = (ans * first) % 1000000007; first--; } return ans % 1000000007; } long long int power(long long int a, long long int b) { long long int ans = 1; while (b > 0) { if (b % 2 == 1) { ans *= a; ans = ans; } b /= 2; a *= a; a = a; } return ans; } vector<int> getbinary(int first) { vector<int> bin(10, 0); int iter = 0; while (first > 0) { if (first % 2 == 1) { bin[iter] = 1; } else { bin[iter] = 0; } iter++; first /= 2; } return bin; } int getnum(vector<int> bin) { int t = 1; int n = bin.size(); int ret = 0; for (int i = 0; i < n; i++) { ret += t * bin[i]; t *= 2; } return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; map<pair<int, int>, int> m1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { int temp; cin >> temp; m1[make_pair(i, temp)] = j; } } int b[n + 1]; map<int, int> m2; for (int i = 1; i <= n; i++) { cin >> b[i]; m2[b[i]] = i; } int ans[n + 1][n + 1]; set<int> s; for (int i = 1; i <= n; i++) { s.insert(i); int no1 = -1, no2 = -1, min1 = n + 1, min2 = n + 1; for (auto e : s) { if (m2[e] < min1) { min2 = min1; min1 = m2[e]; no2 = no1; no1 = e; } else if (m2[e] < min2) { min2 = m2[e]; no2 = e; } } if (no2 == -1) { no2 = no1; } for (int j = 1; j <= n; j++) { if (j == no1 && j == no2) { ans[i][j] = -1; } else if (j != no1) { ans[i][j] = no1; } else if (j == no1 && j != no2) { ans[i][j] = no2; } } } for (int j = 1; j <= n; j++) { int min = 1e9, out; for (int i = 1; i <= n; i++) { if (ans[i][j] != -1) { if (m1[make_pair(j, ans[i][j])] < min) { min = m1[make_pair(j, ans[i][j])]; out = i; } } } cout << out << ; } cout << endl; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; int solver(string s) { if (s.length() == 1) { if (s == 0 ) return 1; if (s == _ ) return 1; else return 0; } if (s[0] == 0 ) { return 0; } if (s.back() == _ ) { int ans = 0; for (char c = 0 ; c <= 9 ; c++) { s[s.length() - 1] = c; ans += solver(s); } return ans; } int _ = 0; for (char c : s) { _ += (c == _ ); } if (s.back() >= 0 && s.back() <= 9 && s[s.length() - 2] >= 0 && s[s.length() - 2] <= 9 ) { if (s.back() != 0 && s.back() != 5 ) { return 0; } if (s.back() == 0 ) { if (s[s.length() - 2] != 5 && s[s.length() - 2] != 0 ) { return 0; } } if (s.back() == 5 ) { if (s[s.length() - 2] != 2 && s[s.length() - 2] != 7 ) { return 0; } } return pow(10, _); } if (s.back() >= 0 && s.back() <= 9 && s[s.length() - 2] == _ ) { if (s.back() == 0 || s.back() == 5 ) return 2 * pow(10, _ - 1); else return 0; } } vector<string> generate(string orig) { vector<string> v; string dum = orig; int x = 0; for (char c : orig) x += (c == X ); if (!x) { return {orig}; } for (char i = 0 ; i <= 9 ; i++) { for (int j = 0; j < dum.length(); j++) { if (dum[j] == X ) { dum[j] = i; } } v.push_back(dum); dum = orig; } return v; } int main() { string orig; cin >> orig; if (orig.length() == 1) { if (orig == X ) cout << 1; else cout << solver(orig); return 0; } vector<string> v = generate(orig); int ans = 0; for (string s : v) { if (s[0] == 0 ) { ans += 0; } else if (s[0] == _ ) { for (char j = 1 ; j <= 9 ; j++) { s[0] = j; ans += solver(s); } } else { ans += solver(s); } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 500010; int ans[N], arr[N], MAX[N]; long long power_mod(long long x, long long y) { x %= 1000000007; long long res = 1; while (y) { if (y & 1) { res = (res * x) % 1000000007; } y /= 2; x = (x * x) % 1000000007; } return res; } void solve() { int n; cin >> n; vector<pair<int, int>> v(N); for (int i = 1; i <= n; i++) { cin >> v[i].first >> v[i].second; ans[i] = MAX[i] = 1; } sort(v.begin() + 1, v.begin() + n + 1); arr[n + 1] = v[n].second + 1; for (int i = 1; i <= n; i++) { arr[i] = v[i].first; } int ma = 0; for (int i = n; i >= 1; i--) { int up = upper_bound(arr + 1, arr + 2 + n, v[i].second) - arr; int p = ans[i]; ans[i] = max(ans[i], ans[i + 1]); ans[i] = max(ans[i], p + ans[up]); } int res = *max_element(ans, ans + n + 1); cout << res << n ; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int tc = 1; while (tc--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, p[11111], c[11111]; vector<pair<int, int> > ve; int main() { int a; cin >> n; for (int i = 2; i <= n; i++) { cin >> a; c[i] = a; } int s = 1; cin >> p[1]; for (int i = 2; i <= n; i++) { cin >> p[i]; if (p[i] != p[c[i]]) { s++; } } cout << s; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int INF = 2147483647; const int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67}; long long a[100][32], b[100][32]; int main() { int n; scanf( %d , &n); a[0][0] = 1; for (int i = 4; i < 19; i++) a[p[i]][0] = 1; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); int y = 0; for (int j = 0; j < 4; j++) if (x % p[j] == 0) { int flag = 0; while (x % p[j] == 0) flag ^= 1, x /= p[j]; y += (flag << j); } if (x > 1) { y += 16; for (int j = 0; j < 32; j++) b[x][j] = 0; for (int j = 0; j < 32; j++) b[x][j ^ y] = (b[x][j ^ y] + a[x][j]) % mod; for (int j = 0; j < 32; j++) a[x][j] = (a[x][j] + b[x][j]) % mod; } else { for (int j = 0; j < 16; j++) b[0][j] = 0; for (int j = 0; j < 16; j++) b[0][j ^ y] = (b[0][j ^ y] + a[0][j]) % mod; for (int j = 0; j < 16; j++) a[0][j] = (a[0][j] + b[0][j]) % mod; } } for (int i = 4; i < 19; i++) { a[p[i]][0] = (a[p[i]][0] + mod - 1) % mod; for (int j = 0; j < 16; j++) b[0][j] = 0; for (int j = 0; j < 16; j++) for (int k = 0; k < 16; k++) b[0][j ^ k] = (b[0][j ^ k] + a[0][j] * a[p[i]][k]) % mod; for (int j = 0; j < 16; j++) a[0][j] = (a[0][j] + b[0][j]) % mod; } printf( %lld n , (a[0][0] + mod - 1) % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { set<long long> s; for (long long a = 1; a <= 2 * 1e9; a *= 2) { for (long long b = 1; b <= 2 * 1e9; b *= 3) { s.insert(a * b); } } int l, r, ans = 0; cin >> l >> r; for (set<long long>::iterator it = s.begin(); it != s.end(); ++it) ans += *it <= r && *it >= l; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const bool debug = 0; int main() { if (!debug) { cin.tie(0); cin.sync_with_stdio(0); cout.tie(0); cout.sync_with_stdio(0); } int n, m; cin >> n >> m; vector<vector<int>> d(m, vector<int>(n)); for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> d[i][j]; vector<int> out(m); for (int i = 0; i < m; i++) out[i] = i; for (int v = 0; v < n - 1; v++) { vector<pair<int, int>> k(m); int r = 0; for (int i = 0; i < m; i++) { k[i] = {d[i][n - 1] - d[i][v], i}; r += k[i].first; } sort(k.begin(), k.end()); reverse(k.begin(), k.end()); if (debug) for (int i = 0; i < m; i++) cout << k[i].first << : << k[i].second << ; if (debug) cout << n << r << n ; int i = 0; for (; i < m; i++) { if (r > 0) r -= k[i].first; else break; } if (r <= 0 && out.size() > i) { out.resize(i); for (int j = 0; j < i; j++) out[j] = k[j].second; } } cout << out.size() << n ; for (int i = 0; i < out.size(); i++) cout << out[i] + 1 << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; namespace IO { inline char gc() { static char buf[1000000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; } template <typename T> inline void read(T &x) { x = (T)0; T f = 1; char ssd = gc(); while (ssd < 0 || ssd > 9 ) f = ssd == - ? -1 : 1, ssd = gc(); while (ssd >= 0 && ssd <= 9 ) x = (x << 3) + (x << 1) + (ssd - 0 ), ssd = gc(); x = x * f; } char OUT[1000000], *S = OUT, *T = OUT + 1000000; char Num[1000000]; int toP; inline void out() { fwrite(OUT, sizeof(char), S - OUT, stdout); S = OUT; } inline void pc(char ssd) { *S++ = ssd; if (S == T) out(); } template <typename T> inline void write(T x) { if (x == 0) pc( 0 ); if (x < 0) x = -x, pc( - ); toP = 0; while (x) Num[++toP] = x % 10 + 0 , x /= 10; while (toP) pc(Num[toP--]); } }; // namespace IO const int maxn = 4e5 + 10; namespace SGT { int sum[maxn << 5]; int ls[maxn << 5], rs[maxn << 5], Node; inline void pushup(int NODE) { sum[NODE] = sum[ls[NODE]] + sum[rs[NODE]]; } void change(int &NODE, int l, int r, int id) { if (!NODE) NODE = ++Node; if (l == r) { sum[NODE] += 1; return; } int mid = (l + r) >> 1; if (mid >= id) change(ls[NODE], l, mid, id); else change(rs[NODE], mid + 1, r, id); pushup(NODE); } int query(int NODE, int l, int r, int L, int R) { if (L > R) return 0; if (!NODE || (L <= l && r <= R)) return sum[NODE]; int re = 0; int mid = (l + r) >> 1; if (mid >= L) re += query(ls[NODE], l, mid, L, R); if (mid < R) re += query(rs[NODE], mid + 1, r, L, R); return re; } int merge(int root1, int root2, int l, int r) { if (!root1 || !root2) return root1 + root2; int New = ++Node; if (l == r) { sum[New] = sum[root1] + sum[root2]; return New; } else { int mid = (l + r) >> 1; ls[New] = merge(ls[root1], ls[root2], l, mid); rs[New] = merge(rs[root1], rs[root2], mid + 1, r); pushup(New); return New; } } } // namespace SGT namespace Tham { int root[maxn]; int len[maxn], fa[maxn], son[maxn][26], end = 1, tnt = 1; inline int insert(int C, int last) { end = ++tnt; len[end] = len[last] + 1; while (last && son[last][C] == 0) son[last][C] = end, last = fa[last]; if (!last) { fa[end] = 1; return end; } register int c = son[last][C]; if (len[last] + 1 == len[c]) { fa[end] = c; return end; } len[++tnt] = len[last] + 1; for (register int i = 0; i < 26; i += 1) son[tnt][i] = son[c][i]; fa[tnt] = fa[c], fa[c] = tnt; fa[end] = tnt; while (son[last][C] == c) son[last][C] = tnt, last = fa[last]; return end; } } // namespace Tham int Len; char ssd[maxn], S[maxn]; int head[maxn], to[maxn], nxt[maxn], tot; inline void add(int x, int y) { nxt[++tot] = head[x]; head[x] = tot; to[tot] = y; } void dfs(int now) { for (register int i = head[now]; i; i = nxt[i]) { dfs(to[i]); Tham::root[now] = SGT::merge(Tham::root[now], Tham::root[to[i]], 1, Len); } } int pos[maxn], id[maxn]; int main() { scanf( %s , S + 1); Len = strlen(S + 1); id[0] = pos[0] = 1; for (register int i = 1; i <= Len; i += 1) pos[i] = Tham::insert(S[i] - a , pos[i - 1]), SGT::change(Tham::root[pos[i]], 1, Len, i); for (register int i = 2; i <= Tham::tnt; i += 1) add(Tham::fa[i], i); dfs(1); int T; scanf( %d , &T); while (T--) { int l, r; scanf( %d %d %s , &l, &r, ssd + 1); int LL = strlen(ssd + 1), match = 0; for (register int i = 1; i <= LL; i += 1) { if (Tham::son[id[i - 1]][ssd[i] - a ]) id[i] = Tham::son[id[i - 1]][ssd[i] - a ], match += 1; else break; } bool ccf = false; for (register int i = match; i >= 0; i -= 1) { for (register int color = (i < LL ? ssd[i + 1] - a + 1 : 0); color < 26; color += 1) if (Tham::son[id[i]][color]) { int nxt = Tham::son[id[i]][color]; if (SGT::query(Tham::root[nxt], 1, Len, l + i, r)) { for (register int j = 1; j <= i; j += 1) printf( %c , ssd[j]); printf( %c n , char(color + 97)); ccf = true; break; } } if (ccf) break; } if (!ccf) puts( -1 ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long int t; cin >> t; while (t--) { long long n; cin >> n; unordered_map<int, long long> mmap; while (n % 3 == 0) { mmap[3]++; n /= 3; } while (n % 2 == 0) { mmap[2]++; n /= 2; } if ((n > 1) || (mmap[2] > mmap[3])) cout << -1 << endl; else { long long count = mmap[3]; count += (mmap[3] - mmap[2]); cout << count << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 58; vector<int> adj[maxn], V; bitset<maxn> mark; void dfs(int v) { mark[v] = 1; V.push_back(v); for (auto u : adj[v]) { if (!mark[u]) { dfs(u); V.push_back(v); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < m; i++) { int v, u; cin >> v >> u; v--; u--; adj[v].push_back(u); adj[u].push_back(v); } dfs(0); int ptr = 0; while (k) { cout << (V.size() - ptr) / k << ; for (int i = 0; i < (V.size() - ptr) / k; i++) { cout << V[ptr + i] + 1 << ; } ptr += (V.size() - ptr) / k; cout << n ; k--; } }
|
#include <bits/stdc++.h> const int N = 123456; int arr[N], i, j; using namespace std; int main() { long long n, k, a, b, ans1 = 0, ans2 = 0, ans = 0; scanf( %lld %lld , &n, &k); scanf( %lld %lld , &a, &b); ans1 = (n - 1) * a; if (k == 1) return cout << ans1 << endl, 0; while (n != 0 && n != 1) { if (n % k == 0) { if (b < a * (n - n / k)) ans += b; else ans += a * (n - n / k); n = n / k; } else { ans += ((n % k) * a); n = n - (n % k); } } if (n == 0) ans -= a; printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; const int maxk = 17; struct TNode { int L, R; int lc, rc; int sum; bool sw; TNode(int L = 0, int R = 0) : L(L), R(R), lc(-1), rc(-1), sum(0), sw(false) {} }; TNode t[3 * maxn]; int tc = 0; int build(int L, int R) { int node = tc++; t[node] = TNode(L, R); if (R - L > 1) { int M = (L + R) / 2; t[node].lc = build(L, M); t[node].rc = build(M, R); } return node; } void relax(int node) { if (t[node].sw) { t[node].sw = false; t[node].sum = t[node].R - t[node].L - t[node].sum; if (t[node].R - t[node].L > 1) { t[t[node].lc].sw ^= true; t[t[node].rc].sw ^= true; } } } void combine(int node) { t[node].sum = t[t[node].lc].sum + t[t[node].rc].sum; } int getsum(int node, int L, int R) { relax(node); if (R <= t[node].L || t[node].R <= L) { return 0; } if (L <= t[node].L && t[node].R <= R) { return t[node].sum; } return getsum(t[node].lc, L, R) + getsum(t[node].rc, L, R); } void swapseg(int node, int L, int R) { relax(node); if (R <= t[node].L || t[node].R <= L) { return; } if (L <= t[node].L && t[node].R <= R) { t[node].sw = true; relax(node); return; } swapseg(t[node].lc, L, R); swapseg(t[node].rc, L, R); combine(node); } int N, M; vector<int> e[maxn]; int par[maxn], d[maxn], w[maxn]; int root[maxn], len[maxn], sky[maxn], tr[maxn]; int up[maxk + 1][maxn]; int A, B; bool enabled; void dfs_build(int v, int p) { par[v] = p; d[v] = (p == -1 ? 0 : d[p] + 1); w[v] = 1; root[v] = v; len[v] = 1; for (int i = 0; i < (int)(e[v].size()); ++i) { int u = e[v][i]; if (u == p) { continue; } if (d[u] == -1) { dfs_build(u, v); w[v] += w[u]; } else { A = u; B = v; } } for (int i = 0; i < (int)(e[v].size()); ++i) { int u = e[v][i]; if (u == p) { continue; } if (d[u] == d[v] + 1 && 2 * w[u] >= w[v]) { root[v] = root[u]; ++len[root[v]]; } } } void build_up() { for (int i = 0; i < (int)(N); ++i) { up[0][i] = par[i]; } for (int j = 0; j < (int)(maxk); ++j) { for (int i = 0; i < (int)(N); ++i) { up[j + 1][i] = (up[j][i] == -1 ? -1 : up[j][up[j][i]]); } } } int get_up(int v, int d) { for (int j = maxk; j >= 0; --j) { if ((1 << j) <= d) { d -= 1 << j; v = up[j][v]; } } return v; } int lca(int v, int u) { if (d[v] < d[u]) { swap(v, u); } v = get_up(v, d[v] - d[u]); if (v == u) { return v; } for (int j = maxk; j >= 0; --j) { if (up[j][v] != up[j][u]) { v = up[j][v]; u = up[j][u]; } } return par[v]; } int dist(int v, int u) { int w = lca(u, v); return d[u] + d[v] - 2 * d[w]; } int total; void swap_up(int v, int x) { int r = root[v]; int p = d[r] - d[v]; total += getsum(tr[r], 0, len[r]); if (p + x <= len[r]) { swapseg(tr[r], p, p + x); } else { swapseg(tr[r], p, len[r]); swap_up(sky[r], x - (len[r] - p)); } total -= getsum(tr[r], 0, len[r]); } void swap_path(int x, int y) { int w = lca(x, y); swap_up(x, d[x] - d[w]); swap_up(y, d[y] - d[w]); } int sum_up(int v, int x) { int r = root[v]; int p = d[r] - d[v]; if (p + x <= len[r]) { return getsum(tr[r], p, p + x); } else { return getsum(tr[r], p, len[r]) + sum_up(sky[r], x - (len[r] - p)); } } int onpath(int x, int y, int z) { int w = lca(x, y), l = dist(x, y); if (z <= d[x] - d[w]) { return get_up(x, z); } else { return get_up(y, l - z); } } int fork(int x) { int d1 = dist(x, A), d2 = dist(x, B), d3 = dist(A, B); return onpath(x, A, (d1 + d2 - d3) / 2); } int bonus() { if (!enabled) { return 0; } int w = lca(A, B); if (sum_up(A, d[A] - d[w]) + sum_up(B, d[B] - d[w]) == dist(A, B)) { return 0; } else { return 1; } } int main() { scanf( %d%d , &N, &M); for (int i = 0; i < (int)(N); ++i) { int x, y; scanf( %d%d , &x, &y); --x; --y; e[x].push_back(y); e[y].push_back(x); } for (int i = 0; i < (int)(N); ++i) { d[i] = -1; } dfs_build(0, -1); build_up(); for (int i = 0; i < (int)(N); ++i) { if (root[i] == i) { tr[i] = build(0, len[i]); sky[i] = get_up(i, len[i]); } } if (d[A] > d[B]) { swap(A, B); } total = N; enabled = false; for (int i = 0; i < (int)(M); ++i) { int x, y; scanf( %d%d , &x, &y); --x; --y; int p = fork(x), q = fork(y); if (p == q) { swap_path(x, y); } else { swap_path(x, p); swap_path(y, q); int lup = d[q] < d[p] ? d[p] - d[q] : d[p] - d[A] + 1 + d[B] - d[q]; int ldown = d[q] > d[p] ? d[q] - d[p] : d[B] - d[p] + 1 + d[q] - d[A]; if (lup == ldown) { int vup = p == A ? B : par[p]; int vdown = p == B ? A : get_up(B, d[B] - d[p] - 1); if (vup < vdown) { --lup; } else { --ldown; } } if (lup < ldown) { if (d[q] < d[p]) { swap_path(p, q); } else { swap_path(p, A); enabled ^= true; swap_path(B, q); } } else { if (d[q] > d[p]) { swap_path(p, q); } else { swap_path(p, B); enabled ^= true; swap_path(q, A); } } } cout << total - bonus() << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int A[200005]; int lazy[600005], ma[600005], mi[600005]; long long sum[600005]; void push_up(int cur) { sum[cur] = sum[cur * 2] + sum[cur * 2 + 1]; ma[cur] = max(ma[cur * 2], ma[cur * 2 + 1]); mi[cur] = min(mi[cur * 2], mi[cur * 2 + 1]); } void push_down(int cur, int l, int r) { if (lazy[cur] == 0) return; int mid = (l + r) / 2; sum[cur * 2] = (lazy[cur] * 1ll * (mid - l + 1)); ma[cur * 2] = mi[cur * 2] = lazy[cur]; lazy[cur * 2] = lazy[cur]; sum[cur * 2 + 1] = (lazy[cur] * 1ll * (r - mid)); ma[cur * 2 + 1] = mi[cur * 2 + 1] = lazy[cur]; lazy[cur * 2 + 1] = lazy[cur]; lazy[cur] = 0; } int __ma; void build(int cur, int l, int r) { lazy[cur] = 0; __ma = max(__ma, cur); if (l == r) { sum[cur] = mi[cur] = ma[cur] = A[r]; return; } int mid = (l + r) / 2; build(cur * 2, l, mid); build(cur * 2 + 1, mid + 1, r); push_up(cur); } void modify_toMax(int cur, int l, int r, int cl, int cr, int Ma) { if (mi[cur] >= Ma) return; if (l >= cl && r <= cr) { if (ma[cur] <= Ma) { ma[cur] = mi[cur] = Ma; sum[cur] = Ma * 1ll * (r - l + 1); lazy[cur] = Ma; return; } } push_down(cur, l, r); int mid = (l + r) / 2; if (cl <= mid) modify_toMax(cur * 2, l, mid, cl, cr, Ma); if (cr > mid) modify_toMax(cur * 2 + 1, mid + 1, r, cl, cr, Ma); push_up(cur); } long long query_sum(int cur, int l, int r, int cl, int cr) { if (l >= cl && r <= cr) return sum[cur]; push_down(cur, l, r); int mid = (l + r) / 2; long long ans = 0; if (cl <= mid) ans += query_sum(cur * 2, l, mid, cl, cr); if (cr > mid) ans += query_sum(cur * 2 + 1, mid + 1, r, cl, cr); return ans; } int query_firSmallInd(int cur, int l, int r, int cl, int cr, int Ma) { if (mi[cur] > Ma) return -1; if (l == r) { if (ma[cur] <= Ma) return r; return -1; } push_down(cur, l, r); int mid = (l + r) / 2; if (cl <= mid) { int ind = query_firSmallInd(cur * 2, l, mid, cl, cr, Ma); if (ind != -1) return ind; } if (cr > mid) return query_firSmallInd(cur * 2 + 1, mid + 1, r, cl, cr, Ma); return -1; } int query_maxPresum(int cur, int l, int r, long long Ma) { if (l == r) { if (ma[cur] <= Ma) return r + 1; return r; } push_down(cur, l, r); int mid = (l + r) / 2; if (sum[cur * 2] <= Ma) return query_maxPresum(cur * 2 + 1, mid + 1, r, Ma - sum[cur * 2]); return query_maxPresum(cur * 2, l, mid, Ma); } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i += 1) scanf( %d , &A[i]); build(1, 1, n); int a, b, c; for (int i = 1; i <= m; i += 1) { scanf( %d%d%d , &a, &b, &c); if (a == 1) { modify_toMax(1, 1, n, 1, b, c); } else { int lef, rig, cur_ind = b, ans = 0; while (cur_ind <= n) { lef = query_firSmallInd(1, 1, n, cur_ind, n, c); if (lef == -1) break; long long pre = 0; if (lef > 1) pre = query_sum(1, 1, n, 1, lef - 1); rig = query_maxPresum(1, 1, n, pre + c); --rig; c -= query_sum(1, 1, n, lef, rig); ans += (rig - lef + 1); cur_ind = rig + 2; } printf( %d n , ans); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while ( 0 <= c && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x * f; } int n, m, cnt, maxx, tab[300], f[1005][105][105]; char s[15]; struct Trie { int bj, len, fail, ch[4]; } tree[105]; void Insert() { int len = strlen(s + 1), now = 1; maxx = max(maxx, len); for (int i = 1; i <= len; ++i) { int v = tab[s[i]]; int &o = tree[now].ch[v]; if (!o) o = ++cnt; now = o; } tree[now].bj = 1; tree[now].len = len; } void Build() { queue<int> q; for (int i = 0; i <= 3; ++i) tree[0].ch[i] = 1; q.push(1); while (!q.empty()) { int x = q.front(), fail = tree[x].fail; q.pop(); tree[x].bj |= tree[fail].bj; tree[x].len = max(tree[x].len, tree[fail].len); for (int i = 0; i <= 3; ++i) { int &y = tree[x].ch[i]; if (!y) y = tree[fail].ch[i]; else tree[y].fail = tree[fail].ch[i], q.push(y); } } } inline int Mod(int x) { return x >= 1000000009 ? x - 1000000009 : x; } int main() { tab[ A ] = 0; tab[ C ] = 1; tab[ G ] = 2; tab[ T ] = 3; n = read(); m = read(); cnt = 1; for (int i = 1; i <= m; ++i) scanf( %s , s + 1), Insert(); Build(); f[0][0][1] = 1; for (int i = 0; i < n; ++i) for (int j = 0; j <= maxx; ++j) for (int k = 1; k <= cnt; ++k) if (f[i][j][k]) for (int p = 0; p <= 3; ++p) { int y = tree[k].ch[p]; if (j + 1 <= tree[y].len) f[i + 1][0][y] = Mod(f[i + 1][0][y] + f[i][j][k]); else f[i + 1][j + 1][y] = Mod(f[i + 1][j + 1][y] + f[i][j][k]); } int ans = 0; for (int k = 1; k <= cnt; ++k) ans = Mod(ans + f[n][0][k]); cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100; double pr[10][N][N], p[N][N], dp[10][N][N]; int n; int main() { double ans = 0; cin >> n; for (int i = 0; i < (1 << n); i++) for (int j = 0; j < (1 << n); j++) cin >> p[i][j], p[i][j] /= 100; for (int i = 0; i < (1 << n); i++) pr[0][i][i] = 1; for (int i = 1; i <= n; i++) for (int j = 0; j < (1 << (n - i)); j++) { int d = (1 << i); for (int g = 0; g < d; g++) { int o = d * j + g; double t = pr[i - 1][j * 2 + (g >= d / 2)][o]; double k = 0; for (int h = 0; h < d / 2; h++) { int o2 = d * j + h; if (g < d / 2) o2 += d / 2; k += pr[i - 1][j * 2 + (g < d / 2)][o2] * p[o][o2]; } pr[i][j][o] = k * t; } } for (int i = 1; i <= n; i++) for (int j = 0; j < (1 << (n - i)); j++) { int d = (1 << i); int p3 = (1 << (i - 1)); for (int g = 0; g < d; g++) { int o = d * j + g; double t = dp[i - 1][j * 2 + (g >= d / 2)][o]; double p1 = pr[i - 1][j * 2 + (g >= d / 2)][o]; double m = 0; for (int h = 0; h < d / 2; h++) { int o2 = d * j + h; if (g < d / 2) o2 += d / 2; m = max(m, dp[i - 1][j * 2 + (g < d / 2)][o2]); } t += m; double k = 0; for (int h = 0; h < d / 2; h++) { int o2 = d * j + h; if (g < d / 2) o2 += d / 2; k += pr[i - 1][(j * 2 + (g < d / 2))][o2] * p[o][o2]; } t += p1 * p3 * k; dp[i][j][o] = t; if (i == n) ans = max(ans, t); } } cout << setprecision(9) << fixed << ans << endl; return 0; }
|
#include <bits/stdc++.h> inline void in(int &MAGNUS) { scanf( %d , &MAGNUS); } inline void out(int MAGNUS) { printf( %d n , MAGNUS); } inline void in(int &MAGNUS, int &CLAR) { scanf( %d%d , &MAGNUS, &CLAR); } inline void out(int MAGNUS, int CLAR) { printf( %d %d n , MAGNUS, CLAR); } inline void inl(long long &LIV) { scanf( %lld , &LIV); } inline void inl(long long &LIV, long long &MART) { scanf( %lld%lld , &LIV, &MART); } inline void outl(long long LIV) { printf( %lld n , LIV); } inline void outl(long long LIV, long long MART) { printf( %lld %lld n , LIV, MART); } using namespace std; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, 1, -1, -1, 1}; int R, C, x[405][405], sum[8][405][405]; bool inside(int r, int c) { return 1 <= r && r <= R && 1 <= c && c <= C; } int rsum(int dir, int r1, int c1, int r2, int c2) { return abs(sum[dir][r2][c2] - sum[dir][r1 - dx[dir]][c1 - dy[dir]]); } int main() { in(R, C); for (int i = 1; i <= R; i++) { for (int j = 1; j <= C; j++) { char ch; cin >> ch; x[i][j] = ch - 0 ; } } for (int dir = 0; dir <= 7; dir++) { for (int i = 1; i <= R; i++) { for (int j = 1; j <= C; j++) { if (inside(i - dx[dir], j - dy[dir])) continue; int r = i, c = j; while (inside(r, c)) { if (r == i && c == j) sum[dir][r][c] = x[i][j]; else sum[dir][r][c] = x[r][c] + sum[dir][r - dx[dir]][c - dy[dir]]; r += dx[dir]; c += dy[dir]; } } } } long long ans = 0; for (int i = 1; i <= R; i++) { for (int j = 1; j <= C; j++) { for (int dir = 0; dir <= 3; dir++) { for (int k = 1; k <= min(R, C); k++) { int r1 = i + dx[dir] * k, c1 = j + dy[dir] * k; int r2 = i + dx[(dir + 1) % 4] * k, c2 = j + dy[(dir + 1) % 4] * k; if (!inside(r1, c1) || !inside(r2, c2)) continue; int s1 = rsum(dir, i, j, r1, c1), s2 = rsum((dir + 1) % 4, i, j, r2, c2), s3 = rsum(dir + 4, r2, c2, r1, c1); ans += (s1 == 0 && s2 == 0 && s3 == 0); } for (int k = 1; k <= min(R, C); k++) { int r1 = i + dx[dir] * k, c1 = j + dy[dir] * k; int r2 = i + dx[(dir + 1) % 4] * k, c2 = j + dy[(dir + 1) % 4] * k; int r3 = i + dx[(dir + 2) % 4] * k, c3 = j + dy[(dir + 2) % 4] * k; if (!inside(r1, c1) || !inside(r2, c2) || !inside(r3, c3)) continue; int s1 = rsum(dir, i, j, r1, c1), s2 = rsum(dir + 4, r2, c2, r1, c1); int s3 = rsum((dir + 2) % 4, i, j, r3, c3), s4 = rsum((dir + 1) % 4 + 4, r3, c3, r2, c2); ans += (s1 == 0 && s2 == 0 && s3 == 0 && s4 == 0); } } } } outl(ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)1e7 + 7; const int Mx = (int)1e7; int n, m; int A[N], B[N]; int lp[N]; map<int, vector<int> > a, b; void precalc() { for (int i = 2; i <= Mx; i++) { if (!lp[i]) { lp[i] = i; if (i * 1ll * i <= Mx) { for (int j = i * i; j <= Mx; j += i) { if (!lp[j]) lp[j] = i; } } } } } int main() { precalc(); scanf( %d%d , &n, &m); for (int i = 1, x; i <= n; i++) { scanf( %d , &A[i]); x = A[i]; while (x > 1) { int p = lp[x]; a[p].push_back(i); x /= p; } } for (int i = 1, x; i <= m; i++) { scanf( %d , &B[i]); x = B[i]; while (x > 1) { int p = lp[x]; b[p].push_back(i); x /= p; } } for (int i = 2; i < N; i++) { if (lp[i] == i) { int len = min(a[i].size(), b[i].size()); while (len) { len--; A[a[i].back()] /= i; B[b[i].back()] /= i; a[i].pop_back(); b[i].pop_back(); } } } printf( %d %d n , n, m); for (int i = 1; i <= n; i++) { printf( %d , A[i]); } printf( n ); for (int i = 1; i <= m; i++) { printf( %d , B[i]); } return 0; }
|
#include <bits/stdc++.h> int f[100001]; int a[100001]; using namespace std; int main() { bool isAm = false; long long int n, m, x; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> x; if (f[x] == 0) f[x] = i + 1; else f[x] = -1; } for (int i = 0; i < m; i++) { cin >> x; if (f[x] == 0) { cout << Impossible ; return 0; } else if (f[x] != -1) { a[i] = f[x]; } else isAm = true; } if (isAm) { cout << Ambiguity ; return 0; } cout << Possible n ; for (int i = 0; i < m; i++) cout << a[i] << ; return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; long long binpow(long long base, long long exp, int mod) { long long res = 1; while (exp > 0) { if (exp % 2 == 1) res = (res * base) % mod; exp = exp >> 1; base = (base * base) % mod; } return res; } long long mod(long long x) { return ((x % 1000000007LL + 1000000007LL) % 1000000007LL); } long long add(long long a, long long b) { return mod(mod(a) + mod(b)); } long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int m; cin >> m; vector<long long int> v1; for (long long int i = 0; i < m; i++) { long long int x; cin >> x; v1.push_back(x); }; sort(v1.begin(), v1.end()); long long int n; cin >> n; vector<long long int> v2; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; v2.push_back(x); }; sort(v2.begin(), v2.end()); long long int sum = 0; for (int i = 0; i < n; i++) sum += v2[i]; if (n < v1[0] + 2) { cout << sum << n ; } else { long long int sum2 = 0; for (long long int i = n - 1; i >= 0; i -= v1[0] + 2) { for (long long int j = i; j >= max(i - v1[0] + 1, 0LL); j--) sum2 += v2[j]; } cout << sum2 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; struct abc { int left, right, capacity, cost; } edge[12345]; int n, k, x, e = 0, cost[50], p[50]; void addEdge(int a, int b, int c, int d) { edge[e].left = a; edge[e].right = b; edge[e].capacity = c; edge[e].cost = d; e++; edge[e].left = b; edge[e].right = a; edge[e].capacity = 0; edge[e].cost = -d; e++; } bool getPath(int s, int t) { for (int i = 0; i < n; i++) cost[i] = INF; cost[s] = 0; bool upd = true; for (int it = 1; upd && it < n; it++) for (int i = upd = 0; i < e; i++) if (edge[i].capacity > 0 && cost[edge[i].left] < INF && cost[edge[i].right] > cost[edge[i].left] + edge[i].cost) { cost[edge[i].right] = cost[edge[i].left] + edge[i].cost; p[edge[i].right] = i; upd = true; } return cost[t] < INF; } int minCostMaxFlow(int s, int t) { int MaxFlow = 0, MinCost = 0, flow; while (getPath(s, t)) { MinCost += cost[t]; if (MinCost > k) return MaxFlow; flow = INF; for (int c = t; c != s; c = edge[p[c]].left) { flow = min(flow, edge[p[c]].capacity); if (edge[p[c]].cost != 0) flow = 1; } for (int c = t; c != s; c = edge[p[c]].left) { edge[p[c]].capacity -= flow; edge[p[c] ^ 1].capacity += flow; } MaxFlow += flow; } return MaxFlow; } int main() { cin >> n >> k; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { cin >> x; if (x) { addEdge(i, j, x, 0); addEdge(i, j, INF, 1); } } cout << minCostMaxFlow(0, n - 1); }
|
#include <bits/stdc++.h> using namespace std; int Month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int A[1000 + 1]; int B[126]; void omae_wa_mou_shindeiru() { int n, k; cin >> n >> k; string s; cin >> s; for (int i = 0; i < n; ++i) { int c = 1; while (s[i] == s[i + 1] && i < n) { ++c; ++i; } B[s[i]] += c / k; } int ans = 0; for (int i = a ; i <= z ; ++i) { ans = max(ans, B[i]); } cout << ans; } int main() { ios_base::sync_with_stdio(false); ; int t = 1; while (t--) { omae_wa_mou_shindeiru(); if (t) cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long w, j, i, m, n, a[2005][2005], k; vector<int> v[2010]; int main() { scanf( %d %d , &m, &n); for (i = 1; i <= m; i++) { a[i][1] = 1; } for (i = 1; i <= m; i++) { for (j = 1; j * j <= i; j++) { if (i % j != 0) continue; if (j * j != i) { v[i].push_back(j); v[i].push_back(i / j); } else v[i].push_back(j); } } for (j = 1; j <= n; j++) { for (i = 1; i <= m; i++) { for (w = 0; w < v[i].size(); w++) { a[i][j] = (a[i][j] + a[v[i][w]][j - 1]) % 1000000007; } } } for (i = 1; i <= m; i++) k = (k + a[i][n]) % 1000000007; cout << k % 1000000007; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long i; while (cin >> i) { if (i % 2) cout << 1 << endl; else cout << 2 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxN = 1e5 + 10; int n, m, s, f; int t[maxN], l[maxN], r[maxN]; bool inside(int l, int m, int r) { return l <= m && m <= r; } void slv() { int d = f > s ? 1 : -1; m++; t[m] = inf, l[m] = inf, r[m] = -inf; int tm = 1; int p = 1; while (true) { if (s == f) break; if (tm != t[p]) s += d, printf( %c , d > 0 ? R : L ); else { if (inside(l[p], s, r[p]) || inside(l[p], s + d, r[p])) printf( X ); else printf( %c , d > 0 ? R : L ), s += d; p++; } tm++; } } int main() { while (~scanf( %d%d%d%d , &n, &m, &s, &f)) { for (int i = 1; i <= m; i++) scanf( %d%d%d , &t[i], &l[i], &r[i]); slv(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; string s[55]; vector<int> getRow(int x) { vector<int> R; for (int i = 1; i <= m; i++) if (s[x][i] == # ) R.push_back(i); return R; } vector<int> getCol(int x) { vector<int> C; for (int i = 1; i <= n; i++) if (s[i][x] == # ) C.push_back(i); return C; } int Viz[55]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { string t; cin >> t; s[i] = . + t + . ; } int nope = 0; for (int i = 1; i <= n && !nope; i++) { if (!Viz[i]) { vector<int> V, R; int ok = 0; for (int j = 1; j <= m; j++) { if (s[i][j] == # ) { R.push_back(j); if (!ok) V = getCol(j), ok = 1; else { vector<int> U = getCol(j); if (U != V) nope = 1; } } } for (int j : V) { Viz[j] = 1; vector<int> Row = getRow(j); if (R != Row) { nope = 1; } } } } if (nope) cout << No ; else cout << Yes ; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; int const nmax = 200000; struct Person { int cost; int number; bool operator<(Person const &a) const { return number < a.number; } }; Person v[1 + nmax]; void solve() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> v[i].number >> v[i].cost; sort(v + 1, v + n + 1); ll result = 0; int votes = 0; priority_queue<int, vector<int>, greater<int>> pq; for (int i = n; 1 <= i; i--) { pq.push(v[i].cost); if (v[i].number <= i - 1 + votes) continue; else { result += pq.top(); votes++; pq.pop(); } } cout << result << n ; } int main() { int t; cin >> t; for (int testcase = 1; testcase <= t; testcase++) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int times[50] = {0}; int graph[50][50] = {0}; void findMissing(int n, int &temp1, int &temp2) { bool condition = false; for (int i = 0; i < n; i++) { if (times[i] != (n - 1)) { if (condition) temp2 = i; else { temp1 = i; condition = true; } } } } void swap(int &n1, int &n2) { n1 += n2; n2 = n1 - n2; n1 -= n2; } void findOrder(int n, int &temp1, int &temp2) { for (int i = 0; i < n; i++) { bool condition = false; if (i == temp1 || i == temp2) continue; else { if (graph[temp1][i] == 1 && graph[i][temp2] == 1) return; else if (graph[i][temp1] == 1 && graph[temp2][i] == 1) { swap(temp1, temp2); return; } } } } int main() { int n, temp1, temp2; cin >> n; for (int i = 0; i < (((n * (n - 1)) / 2) - 1); i++) { cin >> temp1 >> temp2; times[temp1 - 1]++; times[temp2 - 1]++; graph[temp1 - 1][temp2 - 1] = 1; } findMissing(n, temp1, temp2); findOrder(n, temp1, temp2); cout << temp1 + 1 << << temp2 + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; int mp[500][500]; int rSum[500][500], cSum[500][500]; int dSumF[500][500], dSumB[500][500]; int blacks(int r1, int c1, int r2, int c2) { int ans = 1; if (r1 == r2 && c1 == c2) { ans = 1; } else if (r1 == r2) { if (c2 > c1) { ans = rSum[r1][c2] - rSum[r1][c1 - 1]; } else { ans = rSum[r1][c1] - rSum[r1][c2 - 1]; } } else if (c1 == c2) { if (r2 > r1) { ans = cSum[r2][c1] - cSum[r1 - 1][c1]; } else { ans = cSum[r1][c1] - cSum[r2 - 1][c1]; } } else if (abs(r1 - r2) == abs(c1 - c2)) { if (r1 < r2) { if (c1 < c2) { ans = dSumB[r2][c2] - dSumB[r1 - 1][c1 - 1]; } else { ans = dSumF[r2][c2] - dSumF[r1 - 1][c1 + 1]; } } else { if (c2 < c1) { ans = dSumB[r1][c1] - dSumB[r2 - 1][c2 - 1]; } else { ans = dSumF[r1][c1] - dSumF[r2 - 1][c2 + 1]; } } } else ans = 1; return ans; } int valid(int r1, int c1, int r2, int c2, int r3, int c3) { return !(blacks(r1, c1, r2, c2) || blacks(r1, c1, r3, c3) || blacks(r2, c2, r3, c3)); } int main() { scanf( %d %d n , &n, &m); int i, j, k; char c; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { scanf( %c , &c); mp[i][j] = c - 0 ; } scanf( n ); } for (i = 0; i <= n + 1; i++) { for (j = 0; j <= m + 1; j++) { rSum[i][j] = 0; cSum[i][j] = 0; dSumB[i][j] = 0; dSumF[i][j] = 0; } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { rSum[i][j] = rSum[i][j - 1] + mp[i][j]; cSum[i][j] = cSum[i - 1][j] + mp[i][j]; dSumF[i][j] = dSumF[i - 1][j + 1] + mp[i][j]; dSumB[i][j] = dSumB[i - 1][j - 1] + mp[i][j]; } } int ans = 0; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { for (k = 1; j + k <= m && i - k > 0; k++) { ans += valid(i, j, i, j + k, i - k, j); } for (k = 1; j - k > 0 && i - k > 0; k++) { ans += valid(i, j, i, j - k, i - k, j); } for (k = 1; j + k <= m && i + k <= n; k++) { ans += valid(i, j, i, j + k, i + k, j); } for (k = 1; j - k > 0 && i + k <= n; k++) { ans += valid(i, j, i, j - k, i + k, j); } k = 1; while (i - k > 0 && j + k <= m && j - k > 0) { ans += valid(i, j, i - k, j + k, i - k, j - k); k++; } k = 1; while (i + k <= n && j + k <= m && j - k > 0) { ans += valid(i, j, i + k, j + k, i + k, j - k); k++; } k = 1; while (j - k > 0 && i + k <= n && i - k > 0) { ans += valid(i, j, i + k, j - k, i - k, j - k); k++; } k = 1; while (j + k <= m && i + k <= n && i - k > 0) { ans += valid(i, j, i + k, j + k, i - k, j + k); k++; } } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const string FILENAME = input ; vector<pair<int, int> > best; vector<int> a; int main() { int n, m; cin >> n >> m; vector<int> has(2 * n, 0); vector<int> pr(2 * n, -1); vector<pair<int, int> > next(2 * n, {0, 0}); for (int i = 0; i < 2 * n; i++) { int t; cin >> t; a.push_back(t); next[i] = {-a[i], i}; } sort((next).begin(), (next).end()); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; x--; y--; pr[x] = y; pr[y] = x; if (a[x] > a[y]) { swap(x, y); } best.push_back({y, x}); } int ans; int cnt = 0; int t; cin >> t; if (t == 1) { for (int i = 0; i < m; i++) { cout << best[i].first + 1 << endl; cin >> ans; if (ans == -1) return 0; has[best[i].first] = 1; has[ans - 1] = 1; } for (int i = 0; i < 2 * n; i++) { if (has[next[i].second] == 0) { cout << next[i].second + 1 << endl; cin >> ans; if (ans == -1) return 0; has[ans - 1] = 1; has[next[i].second] = 1; } } return 0; } cin >> ans; ans--; has[ans] = 1; cnt++; while (pr[ans] != -1) { cout << pr[ans] + 1 << endl; cnt++; if (cnt == 2 * n) return 0; has[pr[ans]] = 1; cin >> ans; cnt++; if (ans == -1) return 0; ans--; has[ans] = 1; } for (int i = 0; i < m; i++) { if (has[best[i].first] == 0) { has[best[i].first] = 1; cout << best[i].first + 1 << endl; cnt++; if (cnt == 2 * n) return 0; cin >> ans; cnt++; if (ans == -1) return 0; ans--; has[ans] = 1; } } for (int i = 0; i < 2 * n; i++) { if (has[next[i].second] == 0) { cout << next[i].second + 1 << endl; cnt++; if (cnt == 2 * n) return 0; cin >> ans; cnt++; if (ans == -1) return 0; ans--; has[ans] = 1; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, k, i, j; bool flag, flag1, final_flag; string p, q; cin >> t; for (i = 0; i < t; i++) { map<char, int> m; final_flag = false; cin >> p >> q; for (j = 0; j < p.size(); j++) { if (m.find(p[j]) == m.end()) m[p[j]] = 1; else m[p[j]] += 1; } for (j = 0; j < q.size(); j++) { map<char, int> m1; flag1 = true; flag = true; if (m.find(q[j]) != m.end()) { k = j; for (k = j; k < p.size() + j; k++) { if (m.find(q[k]) == m.end()) { flag = false; break; } else { if (m1.find(q[k]) == m1.end()) m1[q[k]] = 1; else m1[q[k]] += 1; } } if (flag) { map<char, int>::iterator it; for (it = m.begin(); it != m.end(); it++) { if (m1.find(it->first) == m1.end()) { flag1 = false; break; } if (m1[it->first] != m[it->first]) { flag1 = false; break; } } if (flag1) final_flag = true; } } if (final_flag) break; } if (final_flag) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long oo = 1e18; const long long mod = 1e9 + 7; const int INF = 1 << 30; vector<pair<pair<int, long long>, int>> adj[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); ios_base::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; map<pair<int, int>, long long> edges; for (int i = 0; i < m; i++) { int u, v; long long w; cin >> u >> v >> w; edges[{u, v}] = w; adj[u].push_back({{v, w}, 0}); adj[v].push_back({{u, w}, 0}); } int ans = 0; for (int i = 0; i < k; i++) { int s; long long y; cin >> s >> y; adj[1].push_back({{s, y}, 1}); } priority_queue<pair<pair<int, long long>, int>, vector<pair<pair<int, long long>, int>>, greater<pair<pair<int, long long>, int>>> q; long long dis[N]; bool anagetHenaBeTrain[N]; for (int i = 0; i < N; i++) dis[i] = INF; memset(anagetHenaBeTrain, false, sizeof(anagetHenaBeTrain)); dis[1] = 0; q.push({{dis[1], 1}, 0}); while (q.size()) { auto top = q.top(); q.pop(); long long cost = top.first.first; int node = top.first.second; int type = top.second; if (cost > dis[node]) continue; for (auto v : adj[node]) { if (v.first.second + cost < dis[v.first.first]) { dis[v.first.first] = v.first.second + cost; anagetHenaBeTrain[v.first.first] = v.second; q.push({{dis[v.first.first], v.first.first}, v.second}); } else if (v.first.second + cost == dis[v.first.first]) { if (anagetHenaBeTrain[v.first.first] == 1 && v.second == 0) { anagetHenaBeTrain[v.first.first] = 0; } } } } for (int i = 1; i <= n; i++) if (anagetHenaBeTrain[i] == 1) ans++; cout << k - ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long double EPS = 1E-9; const int INF = (int)1E9; const long long INF64 = (long long)1E18; const long double PI = 2 * acos(.0); int n, k; string number; int repla2[11]; string construct(int ind) { string resp = ; bool used[10005]; memset(used, false, sizeof(used)); for (int i = 0; i < (int)((number).size()); i++) { bool cent2 = 1; if (repla2[abs((number[i] - 0 ) - ind)] > 0 && ind <= (number[i] - 0 )) { repla2[abs((number[i] - 0 ) - ind)]--; char a = 0 + ind; used[i] = true; resp += a; cent2 = 0; } if (cent2) resp += number[i]; } for (int i = n - 1; i >= 0; i--) { bool cent2 = 1; if (!used[i] && repla2[abs((number[i] - 0 ) - ind)] > 0 && ind >= (number[i] - 0 )) { repla2[abs((number[i] - 0 ) - ind)]--; char a = 0 + ind; resp[i] = a; cent2 = 0; } } return resp; } int main() { cin >> n >> k >> number; string winner; int mini = INF; int ind = -1; int conts[11]; fill(conts, conts + 11, 0); for (int i = 0; i < (int)((number).size()); i++) { conts[number[i] - 0 ]++; } bool cent = 0; string resp2; for (int i = 0; i < (int)(10); i++) { int kk = k - conts[i]; if (kk <= 0) { cent = 1; cout << 0 << endl; cout << number << endl; break; } int temp = 0; fill(repla2, repla2 + 11, 0); for (int j = 1; j < (int)(10); j++) { int cont1 = i - j; int cont2 = i + j; if (cont2 < 10) { if (kk <= conts[cont2]) { temp += (kk * j); repla2[j] += kk; if (temp < mini) { ind = i; mini = temp; resp2 = construct(i); } else if (temp == mini) { string temp = construct(i); if (temp < resp2) resp2 = temp; } break; } else { temp += (conts[cont2] * j); kk -= conts[cont2]; repla2[j] += conts[cont2]; } } if (cont1 >= 0) { if (kk <= conts[cont1]) { temp += (kk * j); repla2[j] += kk; if (temp < mini) { mini = temp; resp2 = construct(i); } else if (temp == mini) { string temp = construct(i); if (temp < resp2) resp2 = temp; } break; } else { temp += (conts[cont1] * j); kk -= conts[cont1]; repla2[j] += conts[cont1]; } } } } bool used[10005]; memset(used, false, sizeof(used)); if (!cent) { cout << mini << endl; cout << resp2; cout << endl; } return 0; }
|
#include <bits/stdc++.h> const int MOD = 998244353; int n, c, a[3005], cnt[3005], pw[3005], ipw1[3005], ans[3005]; inline int mval(int x) { return x >= MOD ? x - MOD : x; } inline void inc(int &x, int a) { (x += a) >= MOD && (x -= MOD); } inline void dec(int &x, int a) { x = mval(MOD + x - a); } inline int qpow(int x, int p) { int ret = 1; while (p) { if (p & 1) ret = 1ll * ret * x % MOD; p >>= 1, x = 1ll * x * x % MOD; } return ret; } namespace sub1 { int f[3005][1 << 10], g[3005]; inline void solve(void) { int u = (1 << c) - 1; g[0] = 1; ans[0] = pw[n] - 1; for (int t = 1; t * c <= n + 1; ++t) { for (int i = 1; i <= n; ++i) std::fill(f[i], f[i] + (1 << c), 0); for (int i = 1; i <= n; ++i) { inc(f[i][0], g[i - 1]); inc(f[i][1 << a[i]], g[i - 1]); for (int s = 0; s < u; ++s) inc(f[i][s], f[i - 1][s]), inc(f[i][s | (1 << a[i])], f[i - 1][s]); } for (int i = 0; i <= n; ++i) g[i] = f[i][u ^ (1 << a[i])]; for (int i = 0; i <= n; ++i) inc(ans[t], 1ll * g[i] * pw[n - i] % MOD); } for (int i = 0; i <= n; ++i) dec(ans[i], ans[i + 1]); } } // namespace sub1 namespace sub2 { long long *f, *g, dp[2][3005], tr[3005][3005]; inline void solve(void) { for (int i = 1; i <= n; ++i) { std::fill(cnt, cnt + c + 1, 0); int cur = 1, cc = 0; tr[i][i] = (c == 1); for (int j = i - 1; j; --j) { if (a[j] != a[i]) { cur = 1ll * ipw1[cnt[a[j]]] * cur % MOD; if (!cnt[a[j]]) ++cc; ++cnt[a[j]]; cur = 1ll * (pw[cnt[a[j]]] - 1) * cur % MOD; } tr[j][i] = (cc == c - 1 ? cur : 0); } } f = dp[0], g = dp[1]; f[0] = 1; ans[0] = pw[n] - 1; for (int t = 1; t * c <= n; ++t) { std::swap(f, g); std::fill(f, f + n + 1, 0); for (int j = 1; j <= n; ++j) if (g[j - 1]) for (int i = j; i <= n; ++i) f[i] += g[j - 1] * tr[j][i] % MOD; for (int i = 1; i <= n; ++i) f[i] %= MOD; for (int i = 0; i <= n; ++i) inc(ans[t], f[i] * pw[n - i] % MOD); } for (int i = 0; i <= n; ++i) dec(ans[i], ans[i + 1]); } } // namespace sub2 int main() { scanf( %d%d , &n, &c); pw[0] = 1; ipw1[0] = 1; for (int i = 1; i <= n; ++i) pw[i] = 2ll * pw[i - 1] % MOD, ipw1[i] = qpow(pw[i] - 1, MOD - 2); for (int i = 1; i <= n; ++i) scanf( %d , a + i), --a[i]; if (c <= 10) sub1::solve(); else sub2::solve(); for (int i = 0; i <= n; ++i) printf( %d , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } const int N = 1e5 + 7; const int xinc[] = {0, 0, 1, -1}; const int yinc[] = {1, -1, 0, 0}; const long double PI = acos(-1.0); const double EPS = 1e-9; string s; long long a, n, sum[4007], ans; map<long long, long long> m; void solve() { cin >> a >> s; n = s.size(); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + s[i - 1] - 0 ; long long t = 0; for (int i = 1; i <= n; i++) for (int j = i; j <= n; j++) { long long psum = sum[j] - sum[i - 1]; m[psum]++; t++; } for (auto i : m) { long long psum = i.first; if (psum != 0 && a != 0 && a % psum == 0) { long long cur = m[a / psum] * i.second; ans += cur; } if (a == 0) { if (psum == 0) ans += m[psum] * t; else ans += m[psum] * m[0]; } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int num[100008]; int cnt1[100008]; int cnt2[100008]; int cnt; struct node { int s, t; } ans[100008]; bool cmp(node a, node b) { if (a.s == b.s) return a.t < b.t; return a.s < b.s; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &num[i]); if (num[i] == 1) { cnt1[i] = cnt1[i - 1] + 1; cnt2[i] = cnt2[i - 1]; } else if (num[i] == 2) { cnt1[i] = cnt1[i - 1]; cnt2[i] = cnt2[i - 1] + 1; } } int acnt = 0; int bcnt = 0; int pre; int atmp; int btmp; for (int i = 1; i <= n; i++) { pre = 1; acnt = 0; bcnt = 0; while (true) { atmp = lower_bound(cnt1 + pre, cnt1 + 1 + n, i + cnt1[pre - 1]) - cnt1; btmp = lower_bound(cnt2 + pre, cnt2 + 1 + n, i + cnt2[pre - 1]) - cnt2; if (atmp < btmp) { acnt++; pre = atmp + 1; if (atmp == n) { if (num[n] != 2 && acnt > bcnt) { cnt++; ans[cnt].s = acnt; ans[cnt].t = i; } break; } } else if (atmp > btmp) { bcnt++; pre = btmp + 1; if (btmp == n) { if (num[n] != 1 && acnt < bcnt) { cnt++; ans[cnt].s = bcnt; ans[cnt].t = i; } break; } } else { break; } } } sort(ans + 1, ans + 1 + cnt, cmp); printf( %d n , cnt); for (int i = 1; i <= cnt; i++) { printf( %d %d n , ans[i].s, ans[i].t); } return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; bool ans = false; for (int i = 1; i <= n; ++i) for (int start = 0; start < n; ++start) { int jump = 0; int cur = start; while (cur < n && s[cur] == * ) { jump += 1; cur += i; } if (jump >= 5) ans = true; } if (ans) cout << yes << endl; else cout << no << endl; } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); const double eps = 1e-10; const long long inf = 0x3f3f3f3f3f3f3f3fLL; const long long N = 2e5 + 5; const long long MOD = 1e9 + 7; long long pw(long long b, long long p) { long long res = 1; while (p > 0) { if (p & 1) res = res * b % MOD; b = b * b % MOD; p >>= 1; } return res; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long n; cin >> n; vector<long long> h(n); long long sum = 0; for (long long i = 0; i < n; i++) { cin >> h[i]; sum += h[i]; } sum -= (n * (n - 1)) / 2; long long rem = sum % n; long long cnt = sum / n; for (long long i = 0; i < n; i++) { cout << i + cnt + (rem >= i + 1) << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long n, m, a, d; long long t[N]; int main() { cin >> n >> m >> a >> d; for (int j = 1; j <= m; j++) { scanf( %lld , &t[j]); } t[m + 1] = 8e18; long long i = 1, ans = 0, last = -1; for (int j = 1; j <= m + 1; j++) { if (i > n) { if (j <= m && last < t[j]) { ans++; last = t[j] + d; } continue; } if (t[j] > last) { if (t[j] <= i * a) { ans++; last = t[j] + d; i = last / a + 1; continue; } long long u = d / a + 1; long long togo = min(n, t[j] / a); long long dis = ((togo - i) / u); ans += dis + 1; i += dis * u; last = i * a + d; if (j <= m && last < t[j]) { ans++; last = t[j] + d; } i = last / a + 1; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double esp = 1e-8; const int msz = 10000; const int mod = 1e9 + 7; struct Tr { char s[26]; int len, l; }; Tr s[111]; bool vis[26]; int main() { char str[1111]; int n, ans; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %s , str); s[i].len = strlen(str); s[i].l = 0; memset(vis, 0, sizeof(vis)); for (int j = 0; j < s[i].len; ++j) { if (!vis[str[j] - a ]) { vis[str[j] - a ] = 1; s[i].s[s[i].l++] = str[j]; } } } int mx = 0; for (int i = a ; i <= z ; ++i) { for (int j = i; j <= z ; ++j) { ans = 0; for (int k = 0; k < n; ++k) { if (s[k].l == 1 && (s[k].s[0] == i || s[k].s[0] == j)) ans += s[k].len; else if (s[k].l == 2 && ((s[k].s[0] == i && s[k].s[1] == j) || (s[k].s[1] == i && s[k].s[0] == j))) ans += s[k].len; } mx = max(mx, ans); } } printf( %d n , mx); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e1 + 5; int a[N][N], pos[N][N], last[N * N]; double ev[N * N], reg[N * N]; int main() { for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { scanf( %d , &a[i][j]); if (i % 2 == 0) { pos[i][j] = 10 * i + j; } else { pos[i][j] = 10 * i + 9 - j; } last[pos[i][j]] = pos[i - a[i][j]][j]; } } ev[0] = 0; for (int i = 1; i < 100; i++) { double sum = 0; int cnt = 0; for (int j = i - 1; j >= max(i - 6, 0); j--) { sum += ev[j]; cnt++; } ev[i] = 1 + (1.0 * sum / 6); ev[i] *= 6.0 / cnt; reg[i] = ev[i]; ev[i] = min(ev[i], reg[last[i]]); } printf( %.7f n , ev[99]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int n, m, cnt = 0, k, cntt = 0, cnts = 0; long long int v[100001]; bool vis[100001], ans[100001]; long long int cnte[100001]; int main() { cin >> n >> m; memset(vis, false, sizeof(vis)); memset(cnte, 0, sizeof(cnte)); for (int i = 1; i <= m; i++) { cin >> v[i]; cnte[v[i]]++; if (vis[v[i]] == false) { vis[v[i]] = true; cnt++; } if (cnt == n) { ans[i] = 1; for (int j = 1; j <= n; j++) { if (cnte[j] > 1) { cnte[j]--; } else { cnt--; cnte[j]--; vis[j] = false; } } } else { ans[i] = 0; } } for (int i = 1; i <= m; i++) { cout << ans[i]; } }
|
#include <bits/stdc++.h> int a, b, c, d, h; int main() { scanf( %d %d %d %d , &a, &b, &c, &d); h = a + 8 * c; if (h >= b) { printf( 0 ); return 0; } if (c <= d) { printf( -1 ); return 0; } printf( %d , (b - h) / (12 * (c - d)) + (((b - h) % (12 * (c - d)) == 0) ? 0 : 1)); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; void solve() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } if (count(v.begin(), v.end(), 1) == 1) { cout << 0 << endl; return; } int s, e; for (s = 0; s < n; s++) { if (v[s] == 1) { break; } } for (e = n - 1; e >= 0; e--) { if (v[e] == 1) { break; } } int ans = 0; for (int i = s; i <= e; i++) { if (v[i] == 0) { ans++; } } cout << ans << endl; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int cnt[1 << 14]; signed main() { ios_base ::sync_with_stdio(false); cin.tie(0); int n, k, maxn = 0; cin >> n >> k; for (int i = 0; i < n; ++i) { int a; cin >> a; maxn = max(maxn, a); ++cnt[a]; } long long ans = 0; if (k == 0) { for (int i = 0; i <= maxn; ++i) ans += cnt[i] * (cnt[i] - 1LL) / 2; cout << ans << n ; return 0; } int l = 32 - __builtin_clz(max(1, maxn)); for (int i = 0; i < (1 << l); ++i) { if (__builtin_popcount(i) != l - k) continue; for (int j = 0; j <= maxn; ++j) ans += 1LL * cnt[j] * cnt[(j & i) | (~j & ~i & ((1 << l) - 1))]; } cout << ans / 2 << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char s[1000]; gets(s); int a[1000] = {0}; for (int i = 0; i < strlen(s); i++) { if (s[i] <= z && s[i] >= a ) a[s[i]]++; } int m = 0; for (int i = 0; i < 1000; i++) if (a[i]) m++; cout << m; }
|
#include <bits/stdc++.h> using namespace std; struct Lem { int m, v, id; bool operator<(Lem b) const { return m < b.m || (m == b.m && v < b.v); } }; int n, k, h; Lem a[(100000 + 10)]; bool can(long double t) { int j = k; for (int i(n - 1), _l(0); i >= _l; --i) { if (j > 0 && (long double)j * h / a[i].v - t <= -1e-7) j--; } return j == 0; } void putAns(long double t) { int ans[(100000 + 10)]; int j = k; for (int i(n - 1), _l(0); i >= _l; --i) { if (j > 0 && (long double)j * h / a[i].v - t <= -1e-7) ans[--j] = a[i].id; } for (int i(0), _n(k - 1); i < _n; ++i) printf( %d , ans[i]); printf( %d n , (ans[k - 1])); } int main() { scanf( %d , &(n)), scanf( %d , &(k)), scanf( %d , &(h)); for (int i(0), _n(n); i < _n; ++i) scanf( %d , &(a[i].m)), a[i].id = i + 1; for (int i(0), _n(n); i < _n; ++i) scanf( %d , &(a[i].v)); sort(a, a + n); long double l = 0, r = 1e10; int cnt = 100; while (cnt--) { long double mid = (l + r) / 2.0; if (can(mid)) r = mid; else l = mid; } putAns(r); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[200000]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; long long prev = 0; long long last = 1e18; for (int i = 0; i < n / 2; ++i) { long long x; cin >> x; prev = max(prev, x - last); last = x - prev; a[i] = prev; a[n - i - 1] = last; } for (int i = 0; i < n; ++i) { cout << a[i] << ; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 5; char a[N][N]; void fileIO() {} int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; fileIO(); int h, w; int tot = 0; cin >> h >> w; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) { cin >> a[i][j]; if (a[i][j] == * ) tot++; } int now = 0; int curi, curj; for (int i = 1; i < h - 1; i++) { for (int j = 1; j < w - 1; j++) { now = 0; if (a[i][j] == * and a[i + 1][j] == * and a[i - 1][j] == * and a[i][j + 1] == * and a[i][j - 1] == * ) { curi = i, curj = j; while (a[curi + 1][j] == * ) { now++; curi++; } curi = i, curj = j; while (a[curi - 1][j] == * ) { now++; curi--; } curi = i, curj = j; while (a[i][curj + 1] == * ) { now++; curj++; } curi = i, curj = j; while (a[i][curj - 1] == * ) { now++; curj--; } if (now + 1 == tot) { cout << YES ; exit(0); } } } } cout << NO ; return 0; }
|
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <cstdio> #include <utility> #include <queue> #include <math.h> #include <set> #include <bitset> #include <cmath> #include <bitset> #include <stack> #include <cstring> #include <deque> using namespace std; typedef long long ll; typedef pair<int, int> pii; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int t; cin >> t; while(t--) { int n, m; cin >> n >> m; vector<ll> k(n + 1); vector<ll> c(m + 1); for(int i = 1; i <= n; i++) cin >> k[i]; for(int i = 1; i <= m; i++) cin >> c[i]; int idx = 1; sort(k.begin(), k.end()); ll ans = 0; for(int i = n; i >= 1; i--) { if(idx > k[i] || c[k[i]] < c[idx]) ans += c[k[i]]; else { ans += c[idx]; idx++; } } cout << ans << n ; } }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; long long mod = 1e9 + 7; vector<long long> g[27]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s1, s2; cin >> s1 >> s2; long long n1 = s1.size(), n2 = s2.size(), i, j; for (i = 0; i < n1; ++i) g[s1[i] - a ].push_back(i); long long cnt = 1, prev = -1, it, sz; for (i = 0; i < n2; ++i) { j = s2[i] - a ; sz = g[j].size(); if (sz == 0) return cout << -1, 0; it = upper_bound(g[j].begin(), g[j].end(), prev) - g[j].begin(); if (it == sz) it = 0, ++cnt; prev = g[j][it]; } cout << cnt << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int dir[4][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}}; int n, m, k; bool isValid(int i, int j) { return i >= 0 && j >= 0 && i < n && j < m; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> k; int freex = -1, freey = -1, remains = 0; char grid[n][m]; bool visited[n][m]; memset(visited, false, sizeof visited); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> grid[i][j]; if (grid[i][j] == . ) { remains++; freex = i; freey = j; } } if (k == 0) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << grid[i][j]; } cout << n ; } return 0; } queue<pair<int, int>> q; q.push({freex, freey}); int count = 0; while (!q.empty()) { auto tmp = q.front(); q.pop(); int x = tmp.first; int y = tmp.second; if (visited[x][y]) continue; visited[x][y] = true; count++; if (count == remains - k) break; for (int i = 0; i < 4; i++) { int nx = x + dir[i][0]; int ny = y + dir[i][1]; if (isValid(nx, ny) && grid[nx][ny] == . && !visited[nx][ny]) q.push({nx, ny}); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (!visited[i][j] && grid[i][j] == . ) cout << X ; else if (grid[i][j] == # ) cout << # ; else cout << . ; } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; int ar[30]; int br[30]; unordered_map<long, long> nm; int main() { std::ios::sync_with_stdio(false); ; int n; std::cin >> n; for (int i = 0; i < n; i++) { std::cin >> ar[i]; br[i] = ar[i]; nm[ar[i]] = i; } sort(ar, ar + n); for (int i = 0; i < n - 1; i++) { br[nm[ar[i]]] = ar[i + 1]; } br[nm[ar[n - 1]]] = ar[0]; for (int i = 0; i < n; i++) { std::cout << br[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } long long power(long long a, long long b, long long ret = 1LL) { while (b--) ret = (ret * a); return ret; } char a[105]; int main() { long long n, k; cin >> n >> k; int ans = 0; for (int i = 1; i <= n; i++) { int cnt = 0; long long x; cin >> x; while (x > 0) { if (x % 10 == 7 || x % 10 == 4) { cnt++; } x /= 10; } if (cnt <= k) ans++; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( -ffloat-store ) #pragma GCC optimize( -fno-defer-pop ) long long int power(long long int a, long long int b, long long int m) { if (b == 0) return 1; if (b == 1) return a % m; long long int t = power(a, b / 2, m) % m; t = (t * t) % m; if (b & 1) t = ((t % m) * (a % m)) % m; return t; } long long int modInverse(long long int a, long long int m) { return power(a, m - 2, m); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int q; cin >> q; while (q--) { long long int i, j, k, l, n; cin >> n >> k; long long int ar[n + 1]; for (i = 1; i <= n; i++) { cin >> ar[i]; } vector<long long int> an; long long int s = 0; for (i = 1; i <= n; i++) { s += ar[i]; if (s % 2) { an.push_back(i); s = 0; } else if (i == n) { if (an.size() > 0) { an.pop_back(); an.push_back(i); } } } if (an.size() < k) { cout << NO << n ; } else { long long int v = (an.size() - k); if (v % 2 == 0) { cout << YES << n ; i = v; while (i < an.size()) { cout << an[i] << ; i++; } cout << n ; } else { cout << NO << n ; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 250 + 7; int a[MAXN][MAXN], ans[MAXN][MAXN]; bool rmax[MAXN * MAXN], cmax[MAXN * MAXN], vis[MAXN * MAXN]; bool canr[MAXN], canc[MAXN]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); } for (int i = 1; i <= n; i++) { int MAX = 0; for (int j = 1; j <= m; j++) MAX = max(MAX, a[i][j]); rmax[MAX] = 1; } for (int j = 1; j <= m; j++) { int MAX = 0; for (int i = 1; i <= n; i++) MAX = max(MAX, a[i][j]); cmax[MAX] = 1; } int x = 0, y = 0; queue<pair<int, int> > pos; for (int num = n * m; num >= 1; num--) { x += rmax[num]; y += cmax[num]; if (rmax[num] || cmax[num]) { ans[x][y] = num; } else { pair<int, int> p = pos.front(); pos.pop(); ans[p.first][p.second] = num; } if (rmax[num]) { canr[x] = 1; for (int j = y - 1; j >= 1; j--) if (canc[j]) pos.push({x, j}); for (int j = y + 1; j <= m; j++) if (canc[j]) pos.push({x, j}); } if (cmax[num]) { canc[y] = 1; for (int i = x - 1; i >= 1; i--) if (canr[i]) pos.push({i, y}); for (int i = x + 1; i <= n; i++) if (canr[i]) pos.push({i, y}); } } for (int i = 1; i <= n; i++, puts( )) for (int j = 1; j <= m; j++) printf( %d , ans[i][j]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, d = 0; cin >> n >> a >> b; n = n - a; if (n <= b) { cout << n; } else { cout << b + 1; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long i, j, k, n, t, x, l, r, m; cin >> t; while (t--) { cin >> n; k = n / 2; long long sum = 0, y, cnt = 1; x = 3; y = 1; while (k--) { sum += ((x * 2 * cnt) + (y * 2 * cnt)); x += 2; y += 2; cnt++; } cout << sum << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; ll MOD = 1000000007; ll mod = 998244353; int inf = 1000001000; ll INF = 1e18 + 5; int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); int t; cin >> t; for (int(_) = 0; (_) < (t); (_)++) { int n; cin >> n; if (n == 1) cout << FastestFinger << endl; else if (n == 2) cout << Ashishgup << endl; else { if (n % 2) cout << Ashishgup << endl; else { int cnt = 0; while (n % 2 == 0) { n /= 2; cnt++; } if (n == 1) { cout << FastestFinger << endl; } else { if (cnt > 1) cout << Ashishgup << endl; else { int q = 0; for (ll i = 3; i * i <= n; i += 2) { if (n % i == 0) { cout << Ashishgup << endl; q++; break; } } if (q == 0) cout << FastestFinger << endl; } } } } } }
|
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int FFTMOD = 119 << 23 | 1; const int INF = (int)1e9 + 23111992; const long long LINF = (long long)1e18 + 23111992; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return val < a ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } inline unsigned long long isqrt(unsigned long long k) { unsigned long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; } inline int sign(long double x, long double y) { return sign(x - y); } mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int myrand() { return abs((int)mt()); } const int maxn = 2e6 + 5; int fac[maxn]; int ifac[maxn]; int binom(int a, int b) { if (a > b) return 0; return mult(fac[b], mult(ifac[a], ifac[b - a])); } void chemthan() { fac[0] = 1; for (int i = (1); i < (maxn); ++i) fac[i] = mult(fac[i - 1], i); for (int i = (0); i < (maxn); ++i) ifac[i] = inv(fac[i]); int n, m, a, b; cin >> n >> m >> a >> b; int res = 0; for (int k = (1); k < (n); ++k) { int coef = binom(k - 1, m - 1); int d = n - 1 - k; int coef2 = !d ? 1 : mult(n - d, fpow(n, d - 1)); coef = mult(coef, fac[k - 1]); addmod(res, mult(coef, mult(binom(k - 1, n - 2), mult(coef2, fpow(m, n - k - 1))))); } cout << res << n ; } int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0), cin.tie(0); if (argc > 1) { assert(freopen(argv[1], r , stdin)); } if (argc > 2) { assert(freopen(argv[2], wb , stdout)); } chemthan(); cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long sign = 1; long long x = 0; char ch; while (!isdigit(ch = getchar())) if (ch == - ) sign = -1; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * sign; } inline void wonl() { putchar( n ); } inline void wws() { putchar( ); } inline void dbg() { cout << endl; } inline void ww(long long k) { if (k < 0) putchar( - ), k *= -1; char ch[20]; int num = 0; while (k) ch[++num] = k % 10, k /= 10; if (num == 0) ch[++num] = 0; while (num) putchar(ch[num--] + 0 ); } const int N = 1e5 + 4; template <typename T, typename... V> inline void wonl(T t, V... v) { ww(t); if (sizeof...(v)) putchar( ); wonl(v...); } template <typename T, typename... V> inline void wws(T t, V... v) { ww(t); if (sizeof...(v)) putchar( ); wws(v...); } template <typename T, typename... V> inline void dbg(T t, V... v) { cout << << t; dbg(v...); } void solve() { int n = read(), a; map<int, int> ma; for (int i = 0; i < n; i++) a = read(), ma[a]++; vector<int> v; for (auto it : ma) v.push_back(it.second); sort(v.begin(), v.end()); reverse(v.begin(), v.end()); long long num = 1; while (v[0] >= num) num *= 2; long long fans = 0; while (num) { long long ter = num; long long a = INT_MAX; int k = 0; while (ter != 0 && k < v.size()) { a = min(a, v[k] / ter), ter = ter / 2, k++; } if (ter == 0) fans = max(fans, a * (num * 2 - 1)); num = num / 2; } wonl(fans); } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 300000; const long long mod = 1e9 + 7; const long long inf = 1e18; long long a[MX + 5]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long tc, cs = 1, i, j, k, x, y, z, n, m; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); for (i = 1; i <= n; i++) a[i] += a[i - 1]; cin >> m; for (i = 1; i <= m; i++) { cin >> x; y = a[n] - (a[n - x + 1] - a[n - x]); cout << y << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int a[n], i, max = 0, f; for (i = 0; i < n; i++) scanf( %d , &a[i]); stack<int> s; for (i = 0; i < n; i++) { while (!s.empty()) { if (s.top() < a[i]) { f = s.top() ^ a[i]; s.pop(); if (f > max) max = f; } else { f = s.top() ^ a[i]; if (f > max) max = f; break; } } s.push(a[i]); } printf( %d , max); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; while (n--) { long long int m; cin >> m; if (m % 3 == 0 || m % 7 == 0) cout << YES << endl; else { long long int k = m / 3; if (k >= 4) cout << YES << endl; else { if (m <= 8 || m == 11) cout << NO << endl; } if (m == 10) cout << YES << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; const int mod = 998244353; map<pair<int, int>, int> mp; pair<int, int> a[maxn], b[maxn]; int n; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d%d , &a[i].first, &a[i].second); for (int i = 1; i <= n; ++i) scanf( %d%d , &b[i].first, &b[i].second); if (n == 1) { printf( %d %d n , a[1].first + b[1].first, a[1].second + b[1].second); return 0; } for (int i = 1; i <= n; ++i) { ++mp[{a[1].first + b[i].first, a[1].second + b[i].second}]; } for (int i = 2; i <= n; ++i) { for (int j = 1; j <= n; ++j) { int x = a[i].first + b[j].first, y = a[i].second + b[j].second; if (mp.find({x, y}) != mp.end()) ++mp[{x, y}]; } } for (auto it : mp) { if (it.second == n) { printf( %d %d n , it.first.first, it.first.second); break; } } return 0; }
|
#include <bits/stdc++.h> int GCD(int u, int v) { while (v != 0) { int r = u % v; u = v; v = r; } return u; } int main() { int amtV; int amtE; std::vector<std::pair<int, int>> graph; std::cin >> amtV >> amtE; int connected = 0; int remaining = amtE; if (amtE >= amtV - 1) { for (int i = 2; i <= amtV; i++) { graph.push_back(std::pair<int, int>(i, 1)); } remaining = amtE - (amtV - 1); for (int i = 3; i <= amtV; i += 2) { if (remaining == 0) break; graph.push_back(std::pair<int, int>(i, 2)); remaining--; } int currInd = 3; int currCompare; while (remaining > 0 && currInd < amtV) { currCompare = currInd + 1; while (remaining > 0 && currCompare <= amtV) { if (GCD(currInd, currCompare) == 1) { graph.push_back(std::pair<int, int>(currInd, currCompare)); remaining--; } currCompare++; } currInd++; } } if (remaining == 0) { std::cout << Possible << std::endl; for (auto it = graph.begin(); it != graph.end(); it++) { std::cout << it->first << << it->second << std::endl; } } else { std::cout << Impossible << std::endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int dist(int x, int y) { if (y > x) return (y - x); else return (12 - x + y); } int main() { int i, j, q, r, t; string a, b, c; cin >> a >> b >> c; map<string, int> m; m[ C ] = 1; m[ C# ] = 2; m[ D ] = 3; m[ D# ] = 4; m[ E ] = 5; m[ F ] = 6; m[ F# ] = 7; m[ G ] = 8; m[ G# ] = 9; m[ A ] = 10; m[ B ] = 11; m[ H ] = 12; int x, y, z; x = m[a]; y = m[b]; z = m[c]; if (dist(x, y) == 3 && dist(y, z) == 4) cout << minor ; else if (dist(x, y) == 4 && dist(y, z) == 3) cout << major ; else if (dist(x, z) == 3 && dist(z, y) == 4) cout << minor ; else if (dist(x, z) == 4 && dist(z, y) == 3) cout << major ; else if (dist(y, x) == 3 && dist(x, z) == 4) cout << minor ; else if (dist(y, x) == 4 && dist(x, z) == 3) cout << major ; else if (dist(y, z) == 3 && dist(z, x) == 4) cout << minor ; else if (dist(y, z) == 4 && dist(z, x) == 3) cout << major ; else if (dist(z, x) == 3 && dist(x, y) == 4) cout << minor ; else if (dist(z, x) == 4 && dist(x, y) == 3) cout << major ; else if (dist(z, y) == 3 && dist(y, x) == 4) cout << minor ; else if (dist(z, y) == 4 && dist(y, x) == 3) cout << major ; else cout << strange ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long x, y, n, m, t, q, a, b, count = 0; cin >> n; long long arr[n]; for (x = 0; x < n; x++) cin >> arr[x]; long long cop[n]; for (x = 0; x < n; x++) cop[x] = arr[x]; sort(cop, cop + n); vector<long long> v; for (x = 0; x < n; x++) if (arr[x] != cop[x]) count++, v.push_back(x); if (count <= 2) cout << YES ; else cout << NO ; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; using pii = pair<int, int>; using pll = pair<long long, long long>; using vb = vector<bool>; using vi = vector<int>; using vl = vector<long long>; using vvb = vector<vector<bool>>; using vvi = vector<vector<int>>; using vvl = vector<vector<long long>>; using vpii = vector<pair<int, int>>; using mii = map<int, int>; template <typename... ArgTypes> void print(ArgTypes... args); template <typename... ArgTypes> void input(ArgTypes &...args); template <> void print() {} template <> void input() {} template <typename T, typename... ArgTypes> void print(T t, ArgTypes... args) { cout << t; print(args...); } template <typename T, typename... ArgTypes> void input(T &t, ArgTypes &...args) { cin >> t; input(args...); } void traverse(int n, int mul) { if (n == 0) return; int a = n - n / 2, b = n - n / 3; int x = 2, y = 3; if (a >= b) { swap(a, b); swap(x, y); } for (int i = 1; i <= a; i++) cout << mul << ; int remaining = n / x; traverse(remaining, mul * x); } int main() { ios_base::sync_with_stdio(0); int n; cin >> n; traverse(n, 1); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << fixed << setprecision(0) << powl(2, n + 1) - 2; }
|
#include <bits/stdc++.h> inline int two(int n) { return 1 << n; } inline int test(int n, int b) { return (n >> b) & 1; } inline void set_bit(int& n, int b) { n |= two(b); } inline void unset_bit(int& n, int b) { n &= ~two(b); } inline int last_bit(int n) { return n & (-n); } inline int ones(int n) { int res = 0; while (n && ++res) n -= n & (-n); return res; } long long int gcd(long long int a, long long int b) { return (a ? gcd(b % a, a) : b); } long long int modPow(long long int a, long long int b, long long int MOD) { long long int x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y) % MOD; } b /= 2; y = (y * y) % MOD; } return x; } long long int modInverse(long long int a, long long int p) { return modPow(a, p - 2, p); } using namespace std; const int N = 1e3 + 3; int arr[N]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, i, j, l, r, taiyar, submit, ans, m; ans = 0; taiyar = 0; submit = 0; cin >> n; for (int i = 0; i < (n); i++) { cin >> arr[i]; taiyar += arr[i]; } cin >> m; while (m--) { cin >> l >> r; if (taiyar <= r) { cout << max(taiyar, l); return 0; } } cout << -1 ; return 0; }
|
#include <bits/stdc++.h> using namespace std; double eps = 1e-7; int main() { int t; double a, b, ans; scanf( %d , &t); while (t--) { scanf( %lf%lf , &a, &b); ans = 0.50000000; if (b < eps) { printf( %lf n , 1.0); continue; } if (a < eps) { printf( %lf n , 0.5); continue; } if (a / b - 4.0 < -eps) { ans += 0.5 * (a * a / 8.0) / (a * b); } else { ans += 0.5 * (a * b - b * 2.0 * b) / (a * b); } printf( %lf n , ans); } return 0; }
|
#include <bits/stdc++.h> #define ll long long #define II pair<int,int> #define fi first #define se second #define task test using namespace std; void Init(){ ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); } int n; int a[200001]; int res; int d(II &a,II &b){ return abs(a.fi-b.fi)+b.se-a.se; } bool Check(int i,int j,int k){ II p={a[i],i}; II q={a[j],j}; II r={a[k],k}; //int s=d( p,q )+d( q,r ),S=d( p,r ); //cout<<i<< <<j<< <<k<< <<s<< <<S<< n ; return( d( p,q )+d( q,r )==d( p,r ) ); } bool Cal(int l,int r){ for(int i=l;i<r;++i) for(int j=i+1;j<r;++j) if(Check(i,j,r))return 1; res++; return 0; } void Solve(){ cin>>n; while(cin>>n){ for(int i=1;i<=n;++i)cin>>a[i]; res=0; for(int i=1;i<=n;++i) for(int j=i+2;j<=n;++j){ if(Cal(i,j))break; //cout<<i<< <<j<< n ; } cout<<res+n+n-1<< n ; } } int main(){ Init(); Solve(); }
|
#include <bits/stdc++.h> using namespace std; constexpr int MAXN = 128; int type[MAXN][MAXN]; constexpr char* pat[6] = { #//. , #. , .# , .//# , .... , #### }; int main() { int n, m, a, b, c, k, x, y; scanf( %d%d , &n, &m); scanf( %d%d%d , &a, &b, &c); k = 0; for (int i = 0; i < a; ++i, ++k) type[k / m][k % m] = 5; y = k % m; for (int i = 0; i < m; ++i, ++k) type[k / m][k % m] = (((k % m - y) % 2 == 0) ^ (k % m < y)) ? 0 : 1; for (int i = 0; i < b; ++i, ++k) type[k / m][k % m] = 4; for (int i = m; i < c; ++i, ++k) for (int j = 0; j < 4; ++j) { x = k / m; y = k % m; if ((x == 0 || ((type[x - 1][y] ^ j) & 2) != 0) && (y == 0 || ((type[x][y - 1] ^ j) & 1) != 0)) { type[k / m][k % m] = j; break; } } for (int i = 0; i < n + n; ++i) { for (int j = 0; j < m + m; ++j) putchar(pat[type[i / 2][j / 2]][i % 2 * 2 + j % 2]); putchar( n ); } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.