func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int N = 300000; long long abss(long long a) { if (a < 0) { a = -a; } return a; } long long n; long long xx; long long aa[N + 5] = {0}, su[N + 5]; long long mm[105] = {0}; int main() { mm[0] = 1; scanf( %lld , &n); long long ans = 0; su[0] = 0; for (int i = 1; i <= n; ++i) { scanf( %lld , &xx); while (xx) { if (xx & 1) { ++aa[i]; } xx >>= 1; } su[i] = su[i - 1] + aa[i]; } long long l[2] = {1, 0}; aa[0] = 0; for (int i = 1; i <= n; ++i) { int bitt = su[i] & 1; ans += l[bitt]; long long mx = aa[i]; long long rem = 0; for (int j = i - 1; j >= 0 && j >= i - 63; --j) { if ((su[i] - su[j]) % 2 == 0 && rem < mx) { --ans; } if (mx < aa[j]) { rem += mx; mx = aa[j]; } else { rem += aa[j]; ; } } ++l[bitt]; ; } printf( %lld , ans); ; return 0; } |
#include <bits/stdc++.h> int u[400000]; int v[400000]; int s[400000]; int n; int parent[200000]; int f[200000]; int t[200001]; bool b[200000]; int tt[200000]; bool func(int x, int y) { return u[x] < u[y]; } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) { scanf( %d%d , &u[i], &v[i]); u[i]--; v[i]--; u[n + i - 1] = v[i]; v[n + i - 1] = u[i]; t[i] = -1; } for (int i = 0; i < 2 * n - 2; i++) { s[i] = i; } t[n - 1] = -1; std::sort(s, s + 2 * n - 2, func); for (int i = 0; i < 2 * n - 2; i++) { if (t[u[s[i]]] == -1) t[u[s[i]]] = i; } t[n] = 2 * n - 2; f[0] = 0; b[0] = true; int tail = 0; for (int i = 0; i < n; i++) { for (int j = t[f[i]]; j < t[f[i] + 1]; j++) { if (b[v[s[j]]]) { continue; } tail++; f[tail] = v[s[j]]; b[f[tail]] = true; parent[f[tail]] = f[i]; } } long long cnt = 0; for (int i = n - 1; i > 0; i--) { tt[parent[f[i]]] += tt[f[i]] + 1; cnt = cnt + (long long)(tt[f[i]] + 1) * (n - tt[f[i]] - 1); } for (int i = 0; i < n; i++) b[i] = false; int pa, pb; pa = 0; pb = 1; for (int i = 1; i < n; i++) { b[f[i]] = !b[parent[f[i]]]; if (b[f[i]]) pa++; else pb++; } cnt = cnt + (long long)pa * pb; cnt = cnt / 2; printf( %I64d , cnt); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) #pragma GCC target( avx,avx2,fma ) using namespace std; const long long sz = 3e3 + 10, mod = 998244353; char s[sz], t[sz]; long long dp[sz][sz]; long long solve(long long l, long long r) { if (l > r) return 1; long long &ret = dp[l][r]; if (ret != -1) return ret; long long rt = 0, idx = r - l + 1; if (s[idx] == t[r] || t[r] == $ ) rt = (rt + solve(l, r - 1)) % mod; if (s[idx] == t[l] || t[l] == $ ) rt = (rt + solve(l + 1, r)) % mod; return ret = rt; } int main() { scanf( %s , s + 1); scanf( %s , t + 1); long long n = strlen(s + 1), m = strlen(t + 1); long long m2 = m; while (m2 < n) t[++m2] = $ ; memset(dp, -1, sizeof(dp)); long long tot = 0; for (long long i = m; i <= n; i++) tot = (tot + solve(1, i)) % mod; cout << tot << endl; return 0; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); printf( %d 0 0 , n); } |
#include <bits/stdc++.h> using namespace std; int n, k, d, t; int a[1000005], b[1000005], c[1000005]; char ch[1000005], ans[1000005]; void mul(int* a, int* b) { for (int i = 0; i < n; ++i) { c[i] = b[a[i]]; } for (int i = 0; i < n; ++i) { a[i] = c[i]; } } int main() { scanf( %s , ch); n = strlen(ch); scanf( %d , &t); while (t--) { scanf( %d%d , &k, &d); int now = 0; for (int i = 0; i < d; ++i) { for (int j = i; j < k; j += d) { a[j] = now++; } } for (int i = k; i < n; ++i) { a[i] = i; } for (int i = 0; i < n; ++i) { a[i] = (a[i] - 1 + n) % n; } for (int i = 0; i < n; ++i) { b[i] = i; } now = (n - k + 1); while (now) { if (now & 1) { mul(b, a); } mul(a, a); now >>= 1; } for (int i = 0; i < n; ++i) { ans[(b[i] + n - k + 1) % n] = ch[i]; } for (int i = 0; i < n; ++i) { ch[i] = ans[i]; } printf( %s n , ch); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long M[110000 * 4]; long long lazy[110000 * 4]; void down(int x) { if (lazy[x] != -1) { M[x * 2] = max(M[x * 2], lazy[x]); M[x * 2 + 1] = max(M[x * 2 + 1], lazy[x]); lazy[x * 2] = max(lazy[x], lazy[x * 2]); lazy[x * 2 + 1] = max(lazy[x], lazy[x * 2 + 1]); lazy[x] = -1; } } void up(int x) { M[x] = max(M[x * 2], M[x * 2 + 1]); } void cover(int now, int l, int r, int x, int y, long long v) { down(now); if (x <= l && r <= y) { M[now] = v; lazy[now] = v; return; } int mid = (l + r) >> 1; if (x <= mid) cover(now * 2, l, mid, x, y, v); if (y > mid) cover(now * 2 + 1, mid + 1, r, x, y, v); up(now); } long long ask(int now, int l, int r, int x, int y) { down(now); if (x <= l && r <= y) return M[now]; int mid = (l + r) >> 1; long long res = 0; if (x <= mid) res = max(res, ask(now * 2, l, mid, x, y)); if (y > mid) res = max(res, ask(now * 2 + 1, mid + 1, r, x, y)); return res; } int main() { memset(lazy, -1, sizeof lazy); int n, m; scanf( %d , &n); for (int i = 1; i <= n; i++) { int v; scanf( %d , &v); cover(1, 1, n, i, i, v); } scanf( %d , &m); for (int i = 1; i <= m; i++) { int w, h; scanf( %d%d , &w, &h); long long res = ask(1, 1, n, 1, w); printf( %I64d n , res); cover(1, 1, n, 1, w, h + res); } return 0; } |
#include <bits/stdc++.h> using namespace std; void fre() { freopen( c://test//input.in , r , stdin); freopen( c://test//output.out , w , stdout); } template <class T1, class T2> inline void gmax(T1 &a, T2 b) { if (b > a) a = b; } template <class T1, class T2> inline void gmin(T1 &a, T2 b) { if (b < a) a = b; } const int N = 4040, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f; int n, m; int y, x; int ln[1010], ls[1010]; vector<int> a[N]; int p[N]; bool e[N]; int hungary(int x) { e[x] = 1; for (int i = a[x].size() - 1; ~i; i--) { int y = a[x][i]; if (p[y] == -1) { p[y] = x; return 1; } } for (int i = a[x].size() - 1; ~i; i--) { int y = a[x][i]; if (!e[p[y]] && hungary(p[y])) { p[y] = x; return 1; } } return 0; } void ins(int x, int y) { a[x].push_back(y); } int main() { while (~scanf( %d%d , &n, &m)) { memset(ln, 1, sizeof(ln)); memset(ls, 1, sizeof(ls)); int n2 = n * 2; int n3 = n * 3; int n4 = n * 4; for (int i = 1; i <= n4; ++i) a[i].clear(); for (int i = 1; i <= m; ++i) { scanf( %d%d , &y, &x); ln[y] = 0; ls[x] = 0; } for (int i = 2; i < n; ++i) if (ln[i]) { ins(i, i + n); ins(i + n, i); if (ls[i]) { ins(i, i + n2); ins(i + n2, i); } if (ls[n + 1 - i]) { ins(i, i + n3); ins(i + n3, i); } if (ls[n + 1 - i]) { ins(i + n, i + n3); ins(i + n3, i + n); } if (ls[n + 1 - i]) { ins(i + n, n + 1 - i + n2); ins(n + 1 - i + n2, i + n); } } for (int j = 2; j < n; ++j) if (ls[j]) { ins(n + n + j, n + n + n + j); ins(n + n + n + j, n + n + j); } memset(p, -1, sizeof(p)); int ans = 0; for (int i = 1; i <= n4; i++) { memset(e, 0, sizeof(e)); if (hungary(i)) ans++; } ans /= 2; if (n & 1) { if (ln[n / 2 + 1] && ls[n / 2 + 1]) --ans; } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> vv[3001]; int graf[3001][3001]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int f, t; cin >> f >> t; vv[f].push_back(t); graf[f][t] = 1; } long long ans(0); for (int a = 1; a <= n; a++) for (int c = 1; c <= n; c++) { if (a == c) continue; int cnt(0); for (int i = 0; i < vv[a].size(); i++) { int b = vv[a][i]; if (graf[b][c]) { cnt++; } } ans += 1LL * cnt * (cnt - 1) / 2; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long INF = LLONG_MAX; const long long base = 1e9; const double PI = acos(-1); const long long MOD = 1e9 + 7; const long long N = 1e5 + 10; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; long long a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } if (a[0] != 0) { cout << 1 << endl; return 0; } long long mx = 0; for (int i = 1; i < n; i++) { mx = max(mx, a[i - 1]); if (a[i] - mx > 1) { cout << i + 1 << endl; return 0; } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 755, M = 10000005; char s[M]; bool e[N][N]; int n; struct ACAutomaton { int trie[M][2], id[M], idx, pos[M], fa[M]; void ins(char *s, int t) { int cur = 0, l = strlen(s + 1); for (int i = 1; i <= l; i++) { if (!trie[cur][s[i] - a ]) trie[cur][s[i] - a ] = ++idx, fa[idx] = cur; cur = trie[cur][s[i] - a ]; } id[cur] = t; pos[t] = cur; } int fail[M]; void build_fail() { queue<int> q; for (int i = 0; i < 2; i++) if (trie[0][i]) q.push(trie[0][i]); while (!q.empty()) { int nd = q.front(); q.pop(); for (int i = 0; i < 2; i++) if (trie[nd][i]) fail[trie[nd][i]] = trie[fail[nd]][i], q.push(trie[nd][i]); else trie[nd][i] = trie[fail[nd]][i]; } } int f[M]; int getf(int v) { return f[v] == v ? v : f[v] = getf(f[v]); } void build_tr() { for (int i = 1; i <= idx; i++) f[i] = id[i] ? i : fail[i]; for (int i = 1; i <= n; i++) { int p = pos[i]; if (id[getf(fail[p])]) e[i][id[getf(fail[p])]] = 1; p = fa[pos[i]]; while (p) { if (id[p]) { e[i][id[p]] = 1; break; } if (id[getf(p)]) e[i][id[getf(p)]] = 1; p = fa[p]; } } } } t; int mat[N], mat2[N]; bool vis[N]; int find(int pos) { if (vis[pos]) return 0; vis[pos] = 1; for (int i = 1; i <= n; i++) if (e[pos][i] && (!mat[i] || find(mat[i]))) { mat[i] = pos; return 1; } return 0; } bool vis1[N], vis2[N]; void dfs(int pos) { if (vis1[pos]) return; vis1[pos] = 1; for (int i = 1; i <= n; i++) if (e[pos][i] && mat2[pos] != i && !vis2[i]) { vis2[i] = 1; if (mat[i]) dfs(mat[i]); } } int ans[N], idx; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) cin >> (s + 1), t.ins(s, i); t.build_fail(); t.build_tr(); for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) e[i][j] |= e[i][k] & e[k][j]; for (int i = 1; i <= n; i++) memset(vis, 0, sizeof(vis)), find(i); for (int i = 1; i <= n; i++) if (mat[i]) mat2[mat[i]] = i; for (int i = 1; i <= n; i++) if (!mat2[i]) dfs(i); for (int i = 1; i <= n; i++) if (vis1[i] && !vis2[i]) ans[++idx] = i; cout << idx << endl; for (int i = 1; i <= idx; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> int n, ans, lst[5010][2]; int comp(const void *a, const void *b) { int x = ((int *)a)[0] - ((int *)b)[0]; if (x) return x; return ((int *)a)[1] - ((int *)b)[1]; } int main() { int i; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d%d , &lst[i][0], &lst[i][1]); qsort(lst + 1, n, sizeof(lst[0]), comp); for (i = 1; i <= n; i++) { if (lst[i][1] >= ans) ans = lst[i][1]; else ans = lst[i][0]; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> int ATTENTION() { http: return 0; } using namespace std; const int iinf = 0x7fffffff; const long long linf = ~(1LL << 63); template <typename T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); if (a < b) return gcd(b, a); if (b == 0) return a; return gcd(b, a % b); } long long qpow(long long a, long long n, long long mod) { a %= mod; long long ans = 1LL; while (n) { if (n & 1) ans = (ans * a % mod); a = (a * a % mod); n >>= 1; } return ans; } inline long long rev(long long a, long long p) { return qpow(a, p - 2, p); } template <typename T> inline void BPS(T* DST, T* SRC, int N, int s = 0) { DST[s] = SRC[s]; for (int i = 1; i < N; i++) DST[s + i] = DST[s + i - 1] + SRC[s + i]; } inline int in() { int x; cin >> x; return x; } inline void tic() {} inline void toc() {} bitset<100000001> is_prime; int n, A, B, C, D; void unset_prime(unsigned int v) { is_prime.reset(v / 3); } unsigned int f(unsigned int x) { return ((((unsigned int)A * x + (unsigned int)B)) * x + (unsigned int)C) * x + (unsigned int)D; } int main() { scanf( %u%u%u%u%u , &n, &A, &B, &C, &D); is_prime.set(); unsigned int res = 0; unsigned int t = n; unsigned int p2 = 2; unsigned int fp = f(2); while (t >= p2) { res += t / p2 * fp; p2 *= 2; } p2 = 3; fp = f(3); while (t >= p2) { res += t / p2 * fp; p2 *= 3; } for (unsigned int i = 5; i <= n; i += 2) { if (is_prime[i / 3] == 0) { if (i % 3 == 1) i += 2; continue; } for (unsigned int j = 5 * i, k = 5; j <= n; j += 2 * i, k += 2) { unset_prime(j); if (k % 3 == 1) { k += 2; j += 2 * i; } } t = n; long long pi = i; fp = f(i); while (t >= pi) { res += t / pi * fp; pi *= i; } if (i % 3 == 1) i += 2; } printf( %u n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; const int mod = (int)1e9 + 7; long long INF64 = 3e18; void smxl(long long &a, long long b) { if (a < b) a = b; } void smnl(long long &a, long long b) { if (a > b) a = b; } void adsl(long long &a, long long b) { a += b; if (a >= mod) a -= mod; } void misl(long long &a, long long b) { a -= b; if (a >= mod) a -= mod; if (a < 0) a += mod; } void smx(long long &a, long long b) { if (a < b) a = b; } void smn(long long &a, long long b) { if (a > b) a = b; } void ads(long long &a, long long b) { a += b; if (a >= mod) a -= mod; } void mis(long long &a, long long b) { a -= b; if (a >= mod) a -= mod; if (a < 0) a += mod; } long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long egcd(long long a, long long b, long long &x, long long &y) { if (a == 0) { x = 0; y = 1; return b; } long long x1, y1; long long d = egcd(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } long long mbinp(long long a, long long b) { a %= mod; if (b == 0) return 1; long long ans = mbinp(a, b / 2); long long tmp = (ans * ans) % mod; if (b % 2) return ((tmp * a) % mod); return ((tmp) % mod); } long long C(int n, int m) { long long ret = 1; for (int i = 1; i <= m; i++) { ret *= (n - i + 1); ret /= i; } return ret; } long long binp(long long a, int b) { long long res = 1; while (b) { if (b & 1) { if (res < INF64 / a) res *= a; else return INF64; } if (b > 1) { if (a < INF64 / a) a *= a; else return INF64; } b >>= 1; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; vector<int> primes(100, 0); vector<int> mu(100, 0); for (int i = 2; i < 100; i++) { if (primes[i] == 0) { mu[i]++; for (int j = 2 * i; j < 100; j += i) { primes[j] = 1; if (mu[j] != -1) mu[j]++; } for (int z = i * i; z < 100; z += i * i) mu[z] = -1; } } mu[1] = 2; vector<pair<long long, int> > all(n); for (int i = 0; i < n; i++) { cin >> all[i].first; all[i].second = i; } sort(all.rbegin(), all.rend()); vector<long long> poss(62); for (int i = 3; i < 62; i++) poss[i] = (long long)ceil(pow((long double)1e18, 1.0 / i)); vector<long long> ans(n); for (int i = 0; i < n; i++) { long long skr = -1; long long low = 0; long long hi = 1e9 + 10; while (low <= hi) { long long mid = (low + hi) / 2; if (mid * mid <= all[i].first) { if (mid > skr) skr = mid; low = mid + 1; } else hi = mid - 1; } poss[1] = all[i].first; poss[2] = skr; for (int j = 3; j < 62; j++) { while (poss[j] > 0 && binp(poss[j], j) > all[i].first) poss[j]--; } long long out = 0; for (int j = 1; j < 62; j++) { out += (poss[j] - 1) * (mu[j] == -1 ? 0 : (mu[j] % 2 == 1 ? -1 : 1)); } ans[all[i].second] = out; } for (int i = 0; i < n; i++) cout << ans[i] << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; long long int i; while (t--) { string a, b, c; cin >> a >> b >> c; long long int n = a.length(), f = 0; for (i = 0; i < n; i++) { if (a[i] != c[i] && b[i] != c[i]) { cout << NO n ; f = 1; break; } else if (a[i] == c[i]) swap(b[i], c[i]); else swap(a[i], c[i]); } if (f != 1) cout << YES n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200005]; int main() { long long k, sum, subs, di; int i, n, rel; cin >> n >> k; int n1 = n; for (i = 1; i <= n; i++) cin >> a[i]; i = 1; sum = 0; rel = 1; while (1) { if (i > n1) break; subs = (n - rel) * a[i] * (rel - 1); di = sum - subs; if (di < k) { n--; rel--; printf( %d n , i); } else { sum = sum + a[i] * (rel - 1); } i++; rel++; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 500 + 10; const int INF = 0x3f3f3f3f; const int mod = 1000000007; int n, m; int a[maxn][maxn], b[maxn][maxn]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> b[i][j]; a[i][j] ^= b[i][j]; } } int flag = 0; for (int i = 1; i <= n; i++) { int tm = 0; for (int j = 1; j <= m; j++) { tm += a[i][j]; } if (tm % 2) flag = 1; } for (int i = 1; i <= m; i++) { int tm = 0; for (int j = 1; j <= n; j++) { tm += a[j][i]; } if (tm % 2) flag = 1; } if (flag) cout << No n ; else cout << Yes n ; return 0; } |
#include <bits/stdc++.h> long long INF = (long long)1e18; struct node { int n; double rat; }; bool operator<(const node& n1, const node& n2) { return n1.rat > n2.rat; } std::vector<int> edge[100010]; int ch[100010], ne[100010]; int main() { int x, a, b, k, n, m, q, t, num, in = 0, to, i; double d, s; scanf( %d%d%d , &n, &m, &q); for (k = 1; k <= q; k++) { scanf( %d , &x); ch[x] = -1; } for (k = 1; k <= m; k++) { scanf( %d%d , &a, &b); edge[a].push_back(b); edge[b].push_back(a); } double max = -1; std::priority_queue<node> PQ; for (k = 1; k <= n; k++) { if (ch[k] == -1) continue; t = 0; for (i = 0; i < edge[k].size(); i++) { int j = edge[k][i]; if (ch[j] == 0) t++; } ne[k] = t; PQ.push(node{k, (double)t / (double)edge[k].size()}); } num = n - q; in = 1; while (num != 0) { a = PQ.top().n; d = PQ.top().rat; PQ.pop(); if (ch[a] != 0) continue; ch[a] = in++; if (d > max) { max = d; to = in; } num--; for (i = 0; i < edge[a].size(); i++) { int j = edge[a][i]; if (ch[j] != 0) continue; ne[j]--; s = (double)ne[j] / (double)edge[j].size(); PQ.push(node{j, s}); } } int ans = 0; for (k = 1; k <= n; k++) { if (ch[k] >= to - 1) ans++; } printf( %d n , ans); for (k = 1; k <= n; k++) { if (ch[k] >= to - 1) printf( %d , k); } } |
#include <bits/stdc++.h> using namespace std; int a[404040]; inline void solve() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); int N = 0; for (int i = 1, j = 1; i <= n; i = j) { for (; j <= n && a[i] == a[j]; j++) ; a[++N] = j - i; } int s2 = 0, i2 = 2; for (; i2 <= N && s2 <= a[1]; i2++) s2 += a[i2]; i2--; int sum = a[1] + s2; int s3 = 0, i3 = i2 + 1; for (; i3 <= N && (sum + a[i3]) * 2 <= n; i3++) sum += a[i3], s3 += a[i3]; i3--; if (a[1] < s3) printf( %d %d %d n , a[1], s2, s3); else puts( 0 0 0 ); } int main() { int t; scanf( %d , &t); while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; long long pw(int x, int y, int z) { if (y == 0) return 1 % z; long long a = pw(x, y / 2, z); if (y % 2 == 0) return (a * a) % z; else return (((a * a) % z) * x % z) % z; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { long long n; cin >> n; vector<vector<long long>> arr(n, vector<long long>(2)); for (int i = 0; i < n; ++i) cin >> arr[i][0] >> arr[i][1]; map<long long, long long> l, r; for (int i = 0; i < n; ++i) { l[arr[i][0]]++; r[arr[i][1]]++; } sort(arr.begin(), arr.end()); long long ans = (n * (n - 1) * (n - 2)) / 6; sort(arr.begin(), arr.end()); for (int i = 0; i < n; ++i) { long long curl = arr[i][0]; long long nos = l[curl]; long long othel = 0; if (nos >= 2) { for (int j = i; j < i + nos; ++j) { othel += (r[arr[j][1]] - 1); } } ans -= ((nos - 1) * othel); i += nos - 1; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; struct info { long long tp, ii, jj, qn, nxt, prv; } d; long long cn[1002][1002], n, m; long long rev[1003], cnt[1003], tot, an[100003]; long long vis[100002]; long long par[100002]; vector<info> v[100005]; long long go(long long nd, long long pr, long long j, long long dec) { vis[nd] = 1; long long s, i, r, is, dtot; info cd; an[nd] = tot; dtot = tot; if (v[nd].size() == 0) { cd = v[pr][j]; if (cd.tp == 1) { if (dec) { cn[cd.ii][cd.jj] = cn[cd.ii][cd.jj] ^ 1LL; cnt[cd.ii]--; tot--; } } else if (cd.tp == 2) { if (dec) { cn[cd.ii][cd.jj] = cn[cd.ii][cd.jj] ^ 1LL; cnt[cd.ii]++; tot++; } } else if (cd.tp == 3) { rev[cd.ii]--; tot -= cnt[cd.ii]; cnt[cd.ii] = m - cnt[cd.ii]; tot += cnt[cd.ii]; } return 1; } for (i = 0; i <= v[nd].size() - 1; i++) { is = 0; cd = v[nd][i]; if (cd.tp == 4) { an[cd.qn] = dtot; continue; } if (cd.tp == 1) { if (rev[cd.ii] % 2) { if (cn[cd.ii][cd.jj]) { cn[cd.ii][cd.jj] = 0; is = 1; tot++; cnt[cd.ii]++; } } else { if (!cn[cd.ii][cd.jj]) { cn[cd.ii][cd.jj] = 1; is = 1; tot++; cnt[cd.ii]++; } } r = go(cd.qn, nd, i, is); } else if (cd.tp == 2) { if (rev[cd.ii] % 2) { if (!cn[cd.ii][cd.jj]) { is = 1; cn[cd.ii][cd.jj] = 1; cnt[cd.ii]--; tot--; } } else { if (cn[cd.ii][cd.jj]) { cn[cd.ii][cd.jj] = 0; is = 1; tot--; cnt[cd.ii]--; } } r = go(cd.qn, nd, i, is); } else if (cd.tp == 3) { rev[cd.ii]++; tot -= cnt[cd.ii]; cnt[cd.ii] = m - cnt[cd.ii]; tot += cnt[cd.ii]; r = go(cd.qn, nd, i, dec); } } if (pr == -1) return 1; cd = v[pr][j]; if (cd.tp == 1) { if (dec) { cn[cd.ii][cd.jj] = cn[cd.ii][cd.jj] ^ 1LL; cnt[cd.ii]--; tot--; } } else if (cd.tp == 2) { if (dec) { cn[cd.ii][cd.jj] = cn[cd.ii][cd.jj] ^ 1LL; cnt[cd.ii]++; tot++; } } else if (cd.tp == 3) { rev[cd.ii]--; tot -= cnt[cd.ii]; cnt[cd.ii] = m - cnt[cd.ii]; tot += cnt[cd.ii]; } return 1; } int main() { ios_base::sync_with_stdio(0); long long int i, j, x, cnt = 0, y, k, g, flg, q, cnd; cin >> n >> m >> q; cnd = 0; for (i = 1; i <= q; i++) { par[i] = -1; } for (i = 1; i <= q; i++) { cin >> k; d.tp = k; if (k == 4) { cin >> y; cnd = y; d.nxt = -1; d.qn = i; if (par[y] != -1) cnd = par[i] = par[y]; else cnd = par[i] = y; v[cnd].push_back(d); } else if (k == 1 || k == 2) { cin >> x >> y; d.ii = x; d.jj = y; d.qn = i; d.prv = cnd; v[cnd].push_back(d); cnd = i; } else if (k == 3) { cin >> x; d.ii = x; d.qn = i; d.prv = cnd; v[cnd].push_back(d); cnd = i; } } x = go(0, -1, 0, 0); for (i = 1; i <= q; i++) { cout << an[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<long long int> v, primev; int prime[2750150]; map<long long int, long long int> mp; void FindPrime() { long long int n = 2750140; for (long long int i = 4; i <= n; i += 2) { prime[i] = true; } prime[1] = true; for (long long int i = 3; i * i <= n; i += 2) { if (!prime[i]) { for (long long int j = 2; i * j <= n; j++) { prime[i * j] = true; } } } primev.push_back(2); prime[2] = 2; int c = 3; for (long long int i = 3; i <= n; i = i + 2) { if (!prime[i]) { prime[i] = c; c++; primev.push_back(i); } } } long long int divisor(long long int a) { long long int chk = sqrt(a + 1); for (long long int i = 0; primev[i] <= chk; i++) { if (a % primev[i] == 0) { long long int res = a / primev[i]; return res; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int a, b, c, d, e, i, j, test; FindPrime(); cin >> a; for (i = 0; i < a * 2; i++) { cin >> b; mp[b]++; v.push_back(b); } sort(v.rbegin(), v.rend()); for (i = 0; i < v.size(); i++) { if (mp[v[i]] > 0) { if (prime[v[i]] != 1) { long long int id = prime[v[i]]; id--; cout << id << ; mp[id]--; mp[v[i]]--; } else { long long int id = divisor(v[i]); cout << v[i] << ; mp[id]--; mp[v[i]]--; } } } return 0; } |
#include <bits/stdc++.h> const int N = 1e6; const int M = 2e5 + 10; const int mod = 1e9 + 7; long long n, a[M], cnt[N], cnt2[N], sol[N]; long long brzo_stepenovanje(long long x, long long k) { if (k == 0) return 1; if (k == 1) return x; if (k % 2) return (x * brzo_stepenovanje((x * x) % mod, k / 2)) % mod; else return brzo_stepenovanje((x * x) % mod, k / 2) % mod; } int main() { scanf( %lld , &n); for (int i = 1; i <= n; i++) cnt[i] = 0, cnt2[i] = 0; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); cnt2[a[i]]++; } for (int i = 2; i <= N; i++) for (int j = i; j <= N; j += i) { cnt[i] += cnt2[j]; } for (int i = 1; i <= N; i++) sol[i] = 0; for (int i = 2; i <= N; i++) sol[i] = (cnt[i] * brzo_stepenovanje(2, cnt[i] - 1)) % mod; for (int i = N / 2; i >= 2; i--) for (int j = i + i; j <= N; j += i) { sol[i] -= sol[j]; if (sol[i] < 0) sol[i] += mod; } long long ans = 0; for (int i = 2; i <= N; i++) { ans += (sol[i] * i) % mod; ans %= mod; } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { string name; vector<struct node *> sub; }; typedef struct node *NODE; class cf56c { public: int ans = 0; void solve(std::istream &in, std::ostream &out) { string s; int n; in >> s; n = s.length(); stack<struct node *> stk; int p = 0; string word; while (s[p] >= A && s[p] <= Z ) { word += s[p]; p++; } NODE root = new struct node; root->name = word; stk.push(root); while (p < n) { string t; NODE latest = stk.top(); if (s[p] == , || s[p] == : ) { p++; while (s[p] >= A && s[p] <= Z && p < n) { t += s[p]; p++; } NODE child = new struct node; child->name = t; latest->sub.push_back(child); stk.push(child); } if (s[p] == . ) { stk.pop(); p++; } } unordered_map<string, int> visited; dfs(root, visited); out << ans; } void dfs(NODE root, unordered_map<string, int> visited) { string employee = root->name; vector<NODE> children = root->sub; ans += visited[employee]; visited[employee]++; for (auto &i : children) { dfs(i, visited); } } }; int main() { ios_base::sync_with_stdio(false); cf56c solver; std::istream &in(std::cin); std::ostream &out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); int ans = 0; if (a == b) { ans++; } else if (b == c) { ans++; } else if (b == d) { ans++; } if (a == c) { ans++; } else if (c == d) { ans++; } if (a == d) { ans++; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Node { int l, r, x, id; } a[1000005]; bool operator<(const Node& t1, const Node& t2) { if (t1.l != t2.l) return t1.l < t2.l; if (t1.x != t2.x) return t1.x > t2.x; if (t1.r != t2.r) return t1.l < t2.r; return t1.x > t2.x; } struct Node1 { Node1(int a, int b, int c) { r = a; x = b; id = c; } int r, x, id; }; bool operator<(const Node1& t1, const Node1& t2) { if (t1.r != t2.r) return t1.r < t2.r; return t1.id < t2.id; } set<Node1> iset; int ans[100005]; int main() { int n, m; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i].l >> a[i].r; a[i].x = -1; a[i].id = i; } cin >> m; for (int i = 0; i < m; i++) { cin >> a[i + n].l >> a[i + n].r >> a[i + n].x; a[n + i].id = i + 1; } sort(a, a + m + n); for (int i = 0; i < m + n; i++) { if (a[i].x != -1) iset.insert(Node1(a[i].r, a[i].x, a[i].id)); else { set<Node1>::iterator it = iset.lower_bound(Node1(a[i].r, 0, 0)); if (it != iset.end()) { Node1 t = *it; iset.erase(it); ans[a[i].id] = t.id; t.x--; if (t.x != 0) iset.insert(t); } else { cout << NO << endl; return 0; } } } cout << YES << endl; for (int i = 0; i < n - 1; i++) cout << ans[i] << ; cout << ans[n - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int ntests; cin >> ntests; while (ntests--) { int n, k, a, b; cin >> k >> n >> a >> b; if (k <= 1ll * n * b) cout << -1 << endl; else { long long x = (k - 1ll * n * b - 1) / (a - b); if (x > n) x = n; cout << x << endl; } } } |
#include <bits/stdc++.h> using namespace std; long long tree[100002] = {0}; long long findcf(long long ind) { long long sum = 0; while (ind > 0) { sum += tree[ind]; ind -= (ind & (-ind)); } return sum; } void update(long long ind, long long val) { while (ind <= 100000) { tree[ind] += val; ind += (ind & (-ind)); } } void incFreqFromTo(long long a, long long b, long long delta) { update(a, delta); update(b + 1, -delta); } long long getFreqAt(long long index) { return findcf(index); } int main() { ios::sync_with_stdio(false); long long t, i, j, n, m, x; cin >> n >> m; for (i = 1; i <= n; ++i) { cin >> t; incFreqFromTo(i, i, t); } for (i = 0; i < m; ++i) { cin >> t; if (t == 1) { cin >> j >> x; incFreqFromTo(j, j, x - getFreqAt(j)); } else if (t == 2) { cin >> x; incFreqFromTo(1, n, x); } else { cin >> j; cout << getFreqAt(j) << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct LINE { int start; int end; }; int ans = 0; vector<int> res; string shift(string s, int p1, int p2) { char t; for (int f = p2; f > p1; f--) { ans++; res.push_back(f); t = s[f]; s[f] = s[f - 1]; s[f - 1] = t; } return s; } int main() { string s, t; int a1[27]; int a2[27]; for (int i = 0; i < 27; i++) { a2[i] = 0; a1[i] = 0; } getline(std::cin, s); getline(std::cin, s); getline(std::cin, t); for (int i = 0; i < s.length(); i++) { a1[((int)s[i]) - 97]++; } for (int i = 0; i < t.length(); i++) { a2[((int)t[i]) - 97]++; } for (int i = 0; i < 27; i++) { if (a1[i] != a2[i]) { cout << -1; return 0; } } for (int i = 0; i < s.length(); i++) { if (s[i] == t[i]) continue; int a = s.find(t[i], i); s = shift(s, i, a); } cout << ans << n ; for (int i = 0; i < res.size(); i++) { cout << res[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int i; char s[100005]; int main() { scanf( %s , s); int l = strlen(s); for (i = 0; i < l; i++) { if (s[i] == s[l - 1 - i]) continue; return 0 * printf( NO n ); } for (i = 0; i < l; i++) { if (s[i] == A || s[i] == H || s[i] == I || s[i] == M || s[i] == O || s[i] == T || s[i] == U || s[i] == V || s[i] == W || s[i] == X || s[i] == Y ) continue; return 0 * printf( NO n ); } printf( YES n ); } |
#include <bits/stdc++.h> using namespace std; int n; char in[100005]; int main() { scanf( %d %s , &n, in); for (int i = 1; i < n; i++) { if (in[i] == in[i - 1]) { for (int j = i;; j++) { in[j] = 1 - (in[j] - 0 ) + 0 ; if (in[j + 1] != in[j]) break; } break; } } char prv = 2 ; int cnt = 0; for (int i = 0; i < n; i++) if (in[i] != prv) { prv = in[i]; cnt++; } printf( %d , cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7, maxn = 1e6 + 6; int n, m, k, x, res = 1, fact[maxn]; map<vector<int>, int> f; vector<int> a[maxn]; int main() { fact[0] = 1; for (int i = 1; i < maxn; ++i) fact[i] = 1LL * fact[i - 1] * i % mod; scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %d , &k); for (int j = 1; j <= k; ++j) { scanf( %d , &x); a[x].push_back(i); } } for (int i = 1; i <= m; ++i) sort(a[i].begin(), a[i].end()), ++f[a[i]]; for (map<vector<int>, int>::iterator it = f.begin(); it != f.end(); ++it) { res = 1LL * res * fact[it->second] % mod; } printf( %d , res); } |
#include <bits/stdc++.h> using namespace std; int main() { int t, a[100], b[100], i; cin >> t; string s1, s2; while (t--) { set<char> track; string s3 = , s4; int flag = 0; cin >> s1 >> s2; if (s1.size() > s2.size()) { cout << NO << endl; continue; } s4 = s1; sort(s4.begin(), s4.end()); for (i = 0; s1[i]; i++) track.insert(s1[i]); for (i = 0; i <= s2.size() - s1.size(); i++) { int cnt = 0, k = i; s3 = ; for (int j = 0; j < s1.size(); j++) { s3 += s2[k++]; } sort(s3.begin(), s3.end()); if (s4 == s3) { cout << YES << endl; flag = 1; break; } } if (flag == 0) cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5, M = 5e5 + 5; bool vis[N]; int q[N], tot, fa[N]; int n, m, k, head[N], ne[M << 1], to[M << 1], cnt, d[N]; inline int read() { int x, f = 1; char ch; while (!(isdigit(ch = getchar()))) ch == - ? f = -1 : f; x = ch ^ 48; while ((isdigit(ch = getchar()))) x = (x << 1) + (x << 3) + (ch ^ 48); return f * x; } inline void ins(int x, int y) { ne[++cnt] = head[x]; head[x] = cnt; to[cnt] = y; } inline void dfs(int x) { vis[x] = 1; if (d[x] >= (n + k - 1) / k) { puts( PATH ); printf( %d n , d[x]); while (x) printf( %d , x), x = fa[x]; exit(0); } bool pd = 0; for (int i = head[x]; i; i = ne[i]) { if (fa[x] == to[i] || vis[to[i]]) continue; fa[to[i]] = x; d[to[i]] = d[x] + 1; pd = 1; dfs(to[i]); } if (!pd) q[++tot] = x; } int main() { n = read(); m = read(); k = read(); for (int i = 1; i <= m; i++) { int x = read(), y = read(); ins(x, y); ins(y, x); } d[1] = 1; dfs(1); puts( CYCLES ); for (int j = 1; j <= k; j++) { int x = q[j], y = 0, z = 0; for (int i = head[x]; i; i = ne[i]) { if (fa[x] == to[i]) continue; if (!y) y = to[i]; else z = to[i]; } int res = d[x] - d[y] + 1; if (res % 3) { printf( %d n , res); while (x != y) { printf( %d , x); x = fa[x]; } printf( %d n , y); continue; } res = d[x] - d[z] + 1; if (res % 3) { printf( %d n , res); while (x != z) { printf( %d , x); x = fa[x]; } printf( %d n , z); continue; } if (d[y] < d[z]) swap(y, z); res = d[y] - d[z] + 2; printf( %d n , res); while (y != z) { printf( %d , y); y = fa[y]; } printf( %d %d n , z, x); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int INF = 2e9; const int MOD = 1e9 + 7; int main() { vector<int> RES; string S = ; cin >> S; int N = S.size(), last = -1, depth = 0; for (int i = 0; i < N; i++) { if (S[i] == ( ) depth++; else { if (S[i] == # ) last = i; depth--; } if (depth < 0) return printf( -1 ), 0; } int val = depth; depth = 0; for (int i = 0; i < N; i++) { if (S[i] == ( ) depth++; else { int removeIt = (i == last && S[i] == # ? val : 0) + 1; depth -= removeIt; if (S[i] == # ) RES.push_back(removeIt); } if (depth < 0) return printf( -1 ), 0; } for (int i = 0; i < RES.size(); i++) printf( %i n , RES[i]); return 0; } |
#include <bits/stdc++.h> void swap(long double& a, long double& b) { long double tmp = a; a = b, b = tmp; } long double solve(long double d, long double r, long double R) { const long double EPS = 1e-9L; if (d + EPS >= r + R) return 0; if (r > R) swap(r, R); if (R + EPS >= d + r) return acosl(-1.0) * r * r; long double T = 2 * acosl((R * R + d * d - r * r) / (2 * R * d)), t = 2 * acosl((r * r + d * d - R * R) / (2 * r * d)); return .5 * (R * R * (T - sinl(T)) + r * r * (t - sinl(t))); } int main() { long double x1, y1, r1, x2, y2, r2; scanf( %Lf%Lf%Lf%Lf%Lf%Lf , &x1, &y1, &r1, &x2, &y2, &r2); long double dx = x1 - x2, dy = y1 - y2; printf( %.20Lf n , solve(sqrtl(dx * dx + dy * dy), r1, r2)); } |
#include <bits/stdc++.h> using namespace std; const long long int inf = 1000000000; const long long int mod = 1000000000 + 7; inline void IO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } inline int dcmp(long double x) { return x < -1e-12 ? -1 : (x > 1e-12); } template <class T> inline int CHECK(T MASK, int i) { return (MASK >> i) & 1; } template <class T> inline T ON(T MASK, int i) { return MASK | (T(1) << i); } template <class T> inline T OFF(T MASK, int i) { return MASK & (~(T(1) << i)); } template <typename T> inline int CNT(T MASK) { if (numeric_limits<T>::digits <= numeric_limits<unsigned int>::digits) return __builtin_popcount(MASK); else return __builtin_popcountll(MASK); } template <class T> inline int RIGHT(T MASK) { return log2(MASK & -MASK); } int dx4[] = {0, 0, -1, +1}; int dy4[] = {+1, -1, 0, 0}; int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1, 0}; int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1, 0}; inline void I(int& a) { scanf( %d , &a); } inline void I(long long int& a) { scanf( %I64d , &a); } inline void I(unsigned long long int& a) { scanf( %I64u , &a); } inline void I(char* a) { scanf( %s , a); } char Iarr[2000010]; inline void I(string& a) { scanf( %s , Iarr); a = Iarr; } template <typename T, typename... Args> void I(T& a, Args&... args) { I(a); I(args...); } inline void OUT(int a) { printf( %d , a); } inline void OUT(long long int a) { printf( %I64d , a); } inline void OUT(const char* a) { printf( %s , a); } inline void OUT(char* a) { printf( %s , a); } inline void OUT(bool a) { printf( %d , a); } inline void OUT(string a) { for (__typeof(a.end()) it = (a.begin()) - ((a.begin()) > (a.end())); it != (a.end()) - ((a.begin()) > (a.end())); it += 1 - 2 * ((a.begin()) > (a.end()))) printf( %c , *it); } inline void OUT(unsigned long long int a) { printf( %I64u , a); } template <typename T, typename... Args> void OUT(T a, Args... args) { OUT(a); OUT( ); OUT(args...); } template <typename... Args> void O(Args... args) { OUT(args...); OUT( n ); } template <typename T1, typename T2> inline ostream& operator<<(ostream& os, pair<T1, T2> p) { os << { << p.first << , << p.second << } ; return os; } template <typename T> inline ostream& operator<<(ostream& os, vector<T>& a) { os << [ ; for (int i = 0; i < (int)a.size(); i++) { if (i) os << , ; os << a[i]; } os << ] ; return os; } void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cout << *it << = << a << endl; err(++it, args...); } const int M = 100010; vector<pair<long long int, pair<int, int> > > ans[51]; int n, p; long double fnl = 0; void func() { for (int i = 1; i <= p; i++) { for (pair<long long int, pair<int, int> > pp : ans[i]) { long double res = i * pp.first; int z = 1; int zz = 1; int curr = 1; while (1) { if (res > 0) { if (curr != n + 1) res /= curr++; else if (z != pp.second.first + 1) res *= z++; else if (zz != pp.second.second + 1) res *= zz++; else break; } else { if (z != pp.second.first + 1) res *= z++; else if (zz != pp.second.second + 1) res *= zz++; else if (curr != n + 1) res /= curr++; else break; } } fnl += res; } } } int main() { IO(); cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } cin >> p; int sum = 0; for (int i = 0; i < n; i++) { sum += a[i]; } if (sum <= p) { cout << n << endl; exit(0); } for (int i = 0; i < n; i++) { vector<int> v; for (int j = 0; j < n; j++) { if (j != i) v.push_back(a[j]); } long long int dp[51][51][51] = {0}; for (int j = 0; j < n - 1; j++) { for (int k = 0; k <= j + 1; k++) { for (int l = 0; l <= 50; l++) { if (j == 0) { if (k == 1 && v[j] == l) dp[j][k][l] = 1; else if (k == 0 && l == 0) dp[j][k][l] = 1; } else if (k == 0) { if (l == 0) dp[j][k][l] = 1; } else { dp[j][k][l] = dp[j - 1][k][l]; if (v[j] <= l) dp[j][k][l] += dp[j - 1][k - 1][l - v[j]]; } } } } for (int l = p - a[i] + 1; l <= p; l++) { for (int gb = 1; gb <= n; gb++) { if (l >= 0) if ((n - 1 - gb) > 0 && (n - 2) >= 0) ans[gb].push_back( make_pair(dp[n - 2][gb][l], make_pair(gb, n - 1 - gb))); else if ((n - 1 - gb) == 0 && (n - 2) >= 0) ans[gb].push_back(make_pair(dp[n - 2][gb][l], make_pair(gb, 1))); int k = (int)ans[gb].size(); if (k != 0) { } } } } func(); cout << setprecision(12) << fixed << fnl << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long d, k, tc, tf, tr, res = 100 * 100 * 100 * 100LL; scanf( %lld , &d); ; scanf( %lld , &k); ; scanf( %lld , &tc); ; scanf( %lld , &tf); ; scanf( %lld , &tr); ; if (k >= d) return 0 * printf( %lld , d * tc); if (k * tc + tr >= k * tf) return 0 * printf( %lld , k * tc + (d - k) * tf); long long chk = d / k; long long bach_gya = d % k; printf( %lld , tr * (chk - 1) + tc * chk * k + min(bach_gya * tc + tr, bach_gya * tf)); } |
#include <bits/stdc++.h> using namespace std; int f[100001], d[40], sor[100001]; int n, kq; bool solve(int a, int b, int &x, int &y) { if (a % 2 != b % 2) return false; y = (a + b) / 2; x = (a - b) / 2; return true; } int main() { scanf( %d , &n); kq = -1; for (int i = 3; i < n + 1; i++) { memset(d, false, sizeof(d)); for (int j = 2; j * j <= 2 * i; j++) if ((2 * i) % j == 0) { int x, y; if (solve((2 * i) / j, j - 1, x, y)) { d[sor[y] ^ sor[x - 1]] = true; if (i == n && sor[y] == sor[x - 1]) if (kq == -1 || j < kq) kq = j; } } for (int j = 0; j < 40; j++) if (!d[j]) { f[i] = j; sor[i] = sor[i - 1] ^ j; if (i == n && f[i] == 0) kq = -1; break; } } cout << kq << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const long long mod = 998244353; int mp[maxn], a[maxn]; char s[maxn]; int main() { int T; scanf( %d , &T); while (T--) { int n, x; scanf( %d , &n); scanf( %d , &x); scanf( %s , s + 1); int mn = 1e9, mx = -1e9; for (int i = (1); i <= (n); i++) { if (s[i] == 0 ) a[i] = a[i - 1] + 1; else a[i] = a[i - 1] - 1; mx = max(mx, a[i]), mn = min(mn, a[i]); } for (int i = (0); i <= (mx - mn); i++) mp[i] = 0; for (int i = (1); i <= (n); i++) mp[a[i] - mn]++; if (a[n] == 0) { if (x < mn || x > mx || mp[x - mn] == 0) { if (x != 0) puts( 0 ); else puts( 1 ); } else puts( -1 ); continue; } if (a[n] > 0) { int l = 0, r = 1e9, pos = -1; while (l <= r) { int mid = l + r >> 1; if (x >= 1ll * mid * a[n] + mn && x <= 1ll * mid * a[n] + mx) pos = mid, r = mid - 1; else if (x < 1ll * mid * a[n] + mn) r = mid - 1; else l = mid + 1; } long long ans = 0; if (pos == -1) ans = 0; else { int mpx = -1; for (int i = pos * a[n] + mn; i <= pos * a[n] + mx; i++) { if (i <= x) mpx++; else break; } for (int i = mpx; i >= 0; i -= a[n]) ans += mp[i]; } if (x == 0) ans++; printf( %lld , ans); puts( ); } else { int l = 0, r = 1e9, pos = -1; while (l <= r) { int mid = l + r >> 1; if (x >= 1ll * mid * a[n] + mn && x <= 1ll * mid * a[n] + mx) pos = mid, r = mid - 1; else if (x < 1ll * mid * a[n] + mn) l = mid + 1; else r = mid - 1; } long long ans = 0; if (pos == -1) ans = 0; else { int mpx = -1; for (int i = pos * a[n] + mn; i <= pos * a[n] + mx; i++) { if (i <= x) mpx++; else break; } for (int i = mpx; i <= mx - mn; i += (-a[n])) ans += mp[i]; } if (x == 0) ans++; printf( %lld , ans); puts( ); } } } |
#include<bits/stdc++.h> using namespace std; typedef pair<int,int> pi; const int maxn=1e5+7; double dp[maxn][10]; int pre[maxn][10]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n,d; cin>>n>>d; vector<int> a(n+1); for(int i=0;i<maxn;i++) for(int j=0;j<10;j++) dp[i][j]=-1e9; dp[0][1]=0; for(int i=1;i<=n;i++) { cin>>a[i]; double val=log(a[i]); for(int j=0;j<10;j++) { int nxt=j*a[i]%10; if(dp[i-1][j]>dp[i][j]) { dp[i][j]=dp[i-1][j]; pre[i][j]=j; } if(dp[i-1][j]+val>dp[i][nxt]) { dp[i][nxt]=dp[i-1][j]+val; pre[i][nxt]=j; } } } if(dp[n][d]<0) { cout<<-1<< n ; return 0; } vector<int> ans; int cur=d; for(int i=n;i>=1;i--) { int cc=a[i]%10; if((pre[i][cur]*cc)%10==cur) { cur=pre[i][cur]; ans.push_back(a[i]); } } if(ans.size()==0) { cout<<-1<< n ; return 0; } cout<<ans.size()<< n ; for(int i=0;i<ans.size();i++) cout<<ans[i]<< n [i+1==ans.size()]; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline long long read() { long long x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } inline void write(long long a) { if (a < 0) { a = -a; putchar( - ); } if (a >= 10) write(a / 10); putchar( 0 + a % 10); } inline void writeln(long long a) { write(a); puts( ); } inline void wri(long long a) { write(a); putchar( ); } inline unsigned long long rnd() { return ((unsigned long long)rand() << 30 ^ rand()) << 4 | rand() % 4; } const int N = 150005; long double l[N], r[N]; struct data { long long p, t, id; } a[N], b[N]; int n; long long T; bool cmp(data a, data b) { return a.p < b.p; } bool cmpt(data a, data b) { long long A = (long long)a.t * b.p, B = (long long)b.t * a.p; return A == B ? a.p < b.p : A < B; } bool check(long double c) { long long sum = 0; for (int i = 1, j; i <= n; i = j) { j = i + 1; while (j <= n && a[j].t * a[i].p == a[i].t * a[j].p) j++; for (int k = (int)(i); k <= (int)(j - 1); k++) r[a[k].id] = (1 - c * (sum + a[k].t) / T) * a[k].p; for (int k = (int)(i); k <= (int)(j - 1); k++) sum += a[k].t; for (int k = (int)(i); k <= (int)(j - 1); k++) l[a[k].id] = (1 - c * sum / T) * a[k].p; } int dq = n; long double mn = 1e100; for (int i = (int)(n); i >= (int)(1); i--) { while (b[dq].p > b[i].p) { mn = min(mn, l[b[dq--].id]); } if (mn <= r[b[i].id]) return 0; } return 1; } int main() { n = read(); for (int i = (int)(1); i <= (int)(n); i++) a[a[i].id = i].p = read(); for (int i = (int)(1); i <= (int)(n); i++) T += (a[i].t = read()); for (int i = (int)(1); i <= (int)(n); i++) b[i] = a[i]; sort(a + 1, a + n + 1, cmpt); sort(b + 1, b + n + 1, cmp); long double l = 0, r = 1; for (int i = (int)(1); i <= (int)(80); i++) { long double mid = (l + r) / 2; if (check(mid)) l = mid; else r = mid; } printf( %.10f , (double)l); } |
#include<bits/stdc++.h> using namespace std; int check(vector<long long> a) { for (int i = 0; i + 1 < a.size(); i++) { if (a[i] > a[i + 1]) { return 0; } a[i + 1] -= a[i]; a[i] = 0; } if (a.back() == 0) return 1; return 0; } void solve() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (check(a)) { cout << YES n ; return; } if (n == 1) { cout << NO n ; return; } swap(a[0], a[1]); if (check(a)) { cout << YES n ; return; } swap(a[0], a[1]); swap(a[n - 2], a[n - 1]); if (check(a)) { cout << YES n ; return; } swap(a[n - 2], a[n - 1]); vector<long long> p(n), s(n); vector<long long> b = a; p[0] = b[0]; for (int i = 1; i < n; i++) { if (p[i - 1] == -1 || b[i - 1] > b[i]) { p[i] = -1; } else { b[i] -= b[i - 1]; b[i - 1] = 0; p[i] = b[i]; } } b = a; s[n - 1] = b[n - 1]; for (int i = n - 2; i >= 0; i--) { if (s[i + 1] == -1 || b[i + 1] > b[i]) { s[i] = -1; } else { b[i] -= b[i + 1]; b[i + 1] = 0; s[i] = b[i]; } } for (int i = 1; i + 2 < n; i++) { vector<long long> c = {p[i - 1], a[i], a[i + 1], s[i + 2]}; if (p[i - 1] == -1 || s[i + 2] == -1) { continue; } swap(c[1], c[2]); if (check(c)) { cout << YES n ; return; } } cout << NO n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; set<int> a[N], b[N]; int maxa[N << 2], minb[N << 2]; int badv = 0; bool bad(int v, int l, int r) { if (l == r) { return a[l].size() && b[l].size() && *a[l].rbegin() >= *b[l].begin(); } else { return maxa[v * 2 + 2] >= minb[v * 2 + 1]; } } void relax(int v) { maxa[v] = max(maxa[v * 2 + 1], maxa[v * 2 + 2]); minb[v] = min(minb[v * 2 + 1], minb[v * 2 + 2]); } void upd_a(int v, int l, int r, int x, int y) { if (l == r) { badv -= bad(v, l, r); if (a[x].find(y) == a[x].end()) a[x].insert(y); else a[x].erase(y); if (a[x].empty()) maxa[v] = -N; else maxa[v] = *a[x].rbegin(); badv += bad(v, l, r); return; } badv -= bad(v, l, r); int m = (l + r) >> 1; if (x <= m) upd_a(v * 2 + 1, l, m, x, y); else upd_a(v * 2 + 2, m + 1, r, x, y); relax(v); badv += bad(v, l, r); } void upd_b(int v, int l, int r, int x, int y) { if (l == r) { badv -= bad(v, l, r); if (b[x].find(y) == b[x].end()) b[x].insert(y); else b[x].erase(y); if (b[x].empty()) minb[v] = N; else minb[v] = *b[x].begin(); badv += bad(v, l, r); return; } badv -= bad(v, l, r); int m = (l + r) >> 1; if (x <= m) upd_b(v * 2 + 1, l, m, x, y); else upd_b(v * 2 + 2, m + 1, r, x, y); relax(v); badv += bad(v, l, r); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); for (int i = 0; i < (N << 2); ++i) { maxa[i] = -N; minb[i] = N; } int n, m, q; cin >> n >> m >> q; while (q--) { int x, y; cin >> x >> y; --x; --y; if (x & 1) { upd_a(0, 0, N, x / 2, y / 2); } else { upd_b(0, 0, N, x / 2, y / 2); } if (badv == 0) cout << YES << n ; else cout << NO << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; long long ans = 0; for (int i = 1; i < min(b, c); i++) { ans += a; a++; } ans *= 2; for (int i = min(b, c); i <= max(b, c); i++) { ans += a; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e5; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int tc = 1; for (long long int T = 1; T <= tc; T++) { long long int n; cin >> n; string s; cin >> s; long long int cnt = 0, flag = 0; for (long long int i = 0; i < n - 1; i++) { if (s[i] == s[i + 1] and s[i] != ? ) { flag = 1; break; } } if (flag) { cout << No n ; return 0; } if (s[0] == ? or s[n - 1] == ? ) { cout << Yes n ; return 0; } long long int tot = 0, ok = 0; char start = $ , end = $ ; for (long long int i = 0; i < n; i++) { if (s[i] != ? and flag == 0) { start = s[i]; } else if (s[i] == ? ) { cnt++; flag = 1; } else { end = s[i]; if (cnt == 1) { if (start == end) { ok = 1; break; } } else { ok = 1; break; } start = end; cnt = 0; flag = 0; } } if (ok) cout << Yes n ; else cout << No n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int bs(vector<int>& a, int que) { auto it = lower_bound(a.begin(), a.end(), que); if (*it == que) { return it - a.begin(); } return -1; } bool isprime(int x) { if (x == 2) return true; if (x < 2) return false; for (int i = 2; i * i <= x; i++) if (x % i == 0) return false; if (x == 0) return false; return true; } int main() { int n; cin >> n; int a[10001]; for (int i = 1; i <= n; i++) { cin >> a[i]; } vector<int> sol; sol.push_back(a[n]); for (int i = n; i >= 2; i--) { if (a[i] == 1) { sol.push_back(a[i - 1]); } } reverse(sol.begin(), sol.end()); cout << sol.size() << endl; for (int i = 0; i <= sol.size() - 1; i++) { cout << sol[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, k; cin >> n >> k; set<long long int> s; map<long long int, long long int> mp; long long int x; for (long long int i = 0; i < n; i++) { cin >> x; s.insert(x); mp[x] = i + 1; } if (s.size() < k) { cout << NO << endl; return 0; } else { cout << YES << endl; map<long long int, long long int>::iterator it; long long int c = 0; for (it = mp.begin(); it != mp.end(); it++) { if (c != k) { cout << it->second << ; c++; } else break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; char a[2000][1000]; int main() { int n, s; cin >> n; int nowx = 0, nowy = 1000; int miny = 1000, maxy = 1000; for (int i = 0; i < n; i++) { cin >> s; for (int j = nowx; j < nowx + s; j++) if (i % 2 == 0) a[nowy][j] = / , maxy = max(maxy, nowy++); else a[--nowy][j] = , miny = min(miny, nowy); nowx += s; } for (int i = maxy; i >= miny; i--, cout << endl) for (int j = 0; j < nowx; j++) if (a[i][j]) cout << a[i][j]; else cout << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { priority_queue<pair<unsigned long long int, int> > matches; unsigned long long int n; int m; unsigned long long int a; int b; unsigned long long int max = 0; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> a >> b; pair<int, unsigned long long int> d; d.first = b; d.second = a; matches.push(d); } while (matches.size() != 0 && m != 0) { pair<int, unsigned long long int> d = matches.top(); if (d.second > n) { max += n * d.first; n = 0; } else { max += d.second * d.first; n -= d.second; } matches.pop(); } cout << max << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int v[2][1000000 + 10]; void solve(int n, int p) { if (n == 0) { v[p][0] = 0; return; } if (!(n & (n + 1))) { for (int i = 0; i <= n; ++i) { v[p][i] = n - i; } } else { int two = 1; while (two * 2 < n + 1) two *= 2; solve(n - two, p ^ 1); for (int i = 0; i <= n - two; ++i) { v[p][i] = two + v[p ^ 1][i]; } int cur = two; for (int i = two; i <= n; ++i) { --cur; v[p][i] = cur; } for (int i = n - two + 1; i < two; ++i) { --cur; v[p][i] = cur; } } } int main() { cin >> n; long long s = 0; for (int i = 0; i <= n; ++i) s += i; cout << s + s << endl; solve(n, 0); for (int i = 0; i <= n; ++i) { printf( %d , v[0][i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; scanf( %d , &n); vector<int> game(n + 1); game[0] = game[1] = game[2] = 0; vector<int> res(n + 1, -1); for (int i = 3; i <= n; i++) { int ok[300001]; memset(ok, 0, sizeof(0)); for (int j = 2; i - (j * (j - 1)) / 2 >= 0; j++) { int x = i - ((j) * (j - 1)) / 2; if (x % j == 0) { x /= j; int Xor = 0; for (int k = 0; k < j; k++) { Xor ^= game[x + k]; } ok[Xor] = i; if (Xor == 0 && res[i] == -1) { res[i] = j; } } } int r = 0; while (ok[r] == i) r++; game[i] = r; if (game[i] == 0) res[i] = -1; } printf( %d n , res[n]); } |
#include <bits/stdc++.h> using namespace std; int A[100005], P[100005]; int other_end[100005]; long long ans[100005], seg[100005]; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) scanf( %d , &A[i]); for (int i = 1; i <= n; ++i) scanf( %d , &P[i]); long long res = 0; for (int i = n; i >= 1; --i) { ans[i] = res; int pos = P[i]; long long sum = A[pos]; int l = pos, r = pos; if (other_end[pos - 1] != 0) { l = other_end[pos - 1]; sum += seg[l]; } if (other_end[pos + 1] != 0) { sum += seg[pos + 1]; r = other_end[pos + 1]; } other_end[l] = r; other_end[r] = l; seg[l] = sum; if (sum > res) res = sum; } for (int i = 1; i <= n; ++i) cout << ans[i] << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, ”/ STACK : 38777216“ using namespace std; const int N = 100005; const int inf = 1000 * 1000 * 1000; const int mod = 1000 * 1000 * 1000 + 7; string s; int a, b, c, d, t; int main() { cin >> t >> s; if (t % 4 != 0) { cout << === << endl; return 0; } t /= 4; for (int i = 0; i < 4 * t; i++) { if (s[i] == A ) a++; if (s[i] == C ) b++; if (s[i] == G ) c++; if (s[i] == T ) d++; } if (a > t || b > t || c > t || d > t) { cout << === << endl; return 0; } a = t - a; b = t - b; c = t - c; d = t - d; for (int i = 0; i < 4 * t; i++) { if (s[i] != ? ) continue; if (a > 0) { s[i] = A ; a--; continue; } if (b > 0) { s[i] = C ; b--; continue; } if (c > 0) { s[i] = G ; c--; continue; } s[i] = T ; d--; } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int degree; int xorsum; }; struct Edge { int src, des; }; struct node virtex[100000]; vector<struct Edge> edge; vector<struct Edge>::iterator it; queue<int> que; int main() { struct Edge temp; int n, d, s, i, src, des; cin >> n; for (i = 0; i < n; i++) { cin >> virtex[i].degree >> virtex[i].xorsum; } for (i = 0; i < n; i++) { if (virtex[i].degree == 1) { que.push(i); } } while (!que.empty()) { src = que.front(); que.pop(); if (virtex[src].degree == 1) { des = virtex[src].xorsum; temp.src = src; temp.des = des; edge.push_back(temp); virtex[des].degree--; virtex[des].xorsum ^= src; if (virtex[des].degree == 1) { que.push(des); } } } cout << edge.size() << endl; it = edge.begin(); while (it != edge.end()) { cout << it->src << << it->des << endl; it++; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000010; int cnt[N]; int a, b, n; void genPrime() { for (int i = 2; i < N; ++i) cnt[i] = 1; for (int i = 2; i <= 1000; ++i) if (cnt[i]) for (int j = i * i; j < N; cnt[j] = 0, j += i) ; for (int i = 1; i < N; ++i) cnt[i] += cnt[i - 1]; } bool chk(int x) { for (int i = a; i + x - 1 <= b; ++i) { int j = i + x - 1; if (cnt[j] - cnt[i - 1] < n) return false; } return true; } int main() { int i, j, k; genPrime(); scanf( %d%d%d , &a, &b, &n); if (cnt[b] - cnt[a - 1] < n) { printf( -1 n ); return 0; } int low = 1, up = b - a + 1; while (up > low) { int mid = (up + low) / 2; if (chk(mid)) up = mid; else low = mid + 1; } printf( %d n , up); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 20; int n; int a[N]; int b[N]; vector<string> ans; int get(int s, int e) { int res = 0; for (int i = s; i < e; ++i) { res = res * 10 + b[i]; } return res; } string getstr(int x, int y, int z, int l) { string s = ; for (int i = 0; i < x; ++i) { s += b[i] + 0 ; } s += . ; for (int i = x; i < y; ++i) { s += b[i] + 0 ; } s += . ; for (int i = y; i < z; ++i) { s += b[i] + 0 ; } s += . ; for (int i = z; i < l; ++i) { s += b[i] + 0 ; } return s; } int check(int x, int y, int z, int l) { if (x > 3) return 0; if (y - x > 3) return 0; if (z - y > 3) return 0; if (l - z > 3) return 0; if (b[0] == 0 && x != 1 || b[x] == 0 && y - x != 1 || b[y] == 0 && z - y != 1 || b[z] == 0 && l - z != 1) { return 0; } int num[4] = {get(0, x), get(x, y), get(y, z), get(z, l)}; for (int i = 0; i < 4; ++i) { if (num[i] < 0 || num[i] >= 256) { return 0; } } return 1; } int cntsplit(int l) { int res = 0; for (int i = 1; i < l; ++i) { if (i - 0 > 3) break; for (int j = i + 1; j < l && j <= i + 3; ++j) { if (j - i > 3) break; for (int k = j + 1; k < l && k <= j + 3; ++k) { if (k - j > 3) break; if (check(i, j, k, l)) { ans.push_back(getstr(i, j, k, l)); ++res; } } } } return res; } int cnt(int d) { int l = 2 * d; int res = 0; for (int i = 0; i < d; ++i) { b[l - i - 1] = b[i]; } res += cntsplit(l); --l; for (int i = 0; i < d - 1; ++i) { b[l - i - 1] = b[i]; } res += cntsplit(l); return res; } void dfs(int d, int msk) { if (msk == (1 << n) - 1) { cnt(d); } if (d >= 6) return; for (int i = 0; i < n; ++i) { b[d] = a[i]; dfs(d + 1, msk | (1 << i)); } } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , a + i); } if (n > 6) { puts( 0 ); return 0; } dfs(0, 0); printf( %d n , ans.size()); for (int i = 0; i < ans.size(); ++i) { printf( %s n , ans[i].c_str()); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 9; const int M = 5e4 + 9; long long read() { long long x = 0, op = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) op = -1; c = getchar(); } while (isdigit(c)) x = x * 10 + c - 48, c = getchar(); return x * op; } signed main() { int T = read(); while (T--) { int n = read(); if (n & 1) n--; cout << n / 2 + 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int fx[8] = {0, -1, -1, -1, 0, 1, 1, 1}; const int fy[8] = {1, 1, 0, -1, -1, -1, 0, 1}; const int maxn = 310; int vis[maxn][maxn][8][30]; int v[maxn][maxn]; int step[40]; queue<pair<int, int> > q; pair<int, int> mkstate(int x, int y, int d, int t) { return make_pair(x * 10000 + y, d * 10000 + t); } int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> step[i]; while (!q.empty()) q.pop(); q.push(mkstate(155, 155, 0, 0)); vis[155][155][0][0] = true; while (!q.empty()) { pair<int, int> t = q.front(); q.pop(); int x = t.first / 10000; int y = t.first % 10000; int d = t.second / 10000; int th = t.second % 10000; for (int i = 0; i < step[th]; i++) { v[x + fx[d] * i][y + fy[d] * i] = 1; } int nx = x + fx[d] * (step[th] - 1); int ny = y + fy[d] * (step[th] - 1); int d1 = (d + 1) % 8; int x1 = nx + fx[d1]; int y1 = ny + fy[d1]; int d2 = (d - 1 + 8) % 8; int x2 = nx + fx[d2]; int y2 = ny + fy[d2]; pair<int, int> t1 = mkstate(x1, y1, d1, th + 1); pair<int, int> t2 = mkstate(x2, y2, d2, th + 1); if (th + 1 < n && !vis[x1][y1][d1][th + 1]) { q.push(t1); vis[x1][y1][d1][th + 1] = true; } if (th + 1 < n && !vis[x2][y2][d2][th + 1]) { q.push(t2); vis[x2][y2][d2][th + 1] = true; } } int ans = 0; for (int i = 0; i < maxn; i++) { for (int j = 0; j < maxn; j++) { if (v[i][j]) ans++; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; void exitall() { cout << -1; exit(0); } int main() { ios::sync_with_stdio(false); int n; long long d; cin >> n >> d; vector<long long> v(n); for (int i = 0; i < n; ++i) { cin >> v[i]; } long long mx = 0; int ans = 0; int lst = -1; long long b = 0; for (int i = 0; i < n; ++i) { if (v[i] == 0) { if (lst >= 0) { if (b >= 0) continue; if (-b <= d - mx) { mx -= b; b = 0; } else { ans++; b = 0; lst = i; mx = 0; } } else { if (b < 0) { ans++; b = 0; mx = 0; lst = i; } } } else mx = max(mx, b = b + v[i]); if (b > d) { cout << -1; return 0; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > v; for (int i = (int)0; i < (int)(n); i++) { int second = 0; int a; for (int j = (int)0; j < (int)(4); j++) { cin >> a; second += a; } v.push_back(make_pair(-second, i)); } sort(v.begin(), v.end()); for (int i = (int)0; i < (int)(n); i++) if (v[i].second == 0) cout << i + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[10000]; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> s; bool t = 0; for (int i = 1; s[i]; ++i) { if (!isdigit(s[i]) && isdigit(s[i - 1])) { t = 1; break; } } if (t == 0) { int c = 0, j; for (j = 0; !isdigit(s[j]); ++j) { c = 26 * c + s[j] - A + 1; } int r = 0; for (; s[j]; ++j) { r = 10 * r + s[j] - 0 ; } cout << R << r << C << c << endl; } else { int r = 0; int j; for (j = 1; isdigit(s[j]); ++j) { r = r * 10 + s[j] - 0 ; } int c = 0; for (++j; s[j]; ++j) { c = 10 * c + s[j] - 0 ; } int z = 0; while (c) { s[z++] = c % 26 + A - 1; if (s[z - 1] < A ) { s[z - 1] = Z ; c = c - 26; } c = c / 26; } for (int k = z - 1; k >= 0; --k) putchar(s[k]); cout << r << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 5000; vector<int> edge[MAX + 5]; int p[MAX + 5], c[MAX + 5], lft[MAX + 5], used[MAX + 5], vis[MAX + 5], cp[MAX + 5], ans[MAX + 5]; int n, m, d, mex, dfn; bool dfs(int x) { for (int i = 0; i < edge[x].size(); i++) { int j = edge[x][i]; if (used[j] != dfn) { used[j] = dfn; if (cp[j] == -1 || dfs(cp[j])) { cp[j] = x; return true; } } } return false; } int main() { memset(cp, -1, sizeof(cp)); int i; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) scanf( %d , &p[i]); for (i = 1; i <= n; i++) scanf( %d , &c[i]); scanf( %d , &d); for (i = 1; i <= d; i++) { scanf( %d , &lft[i]); vis[lft[i]] = 1; } for (i = 1; i <= n; i++) { if (!vis[i]) edge[p[i]].push_back(c[i]); } for (i = d, mex = -1, dfn = 1; i >= 1; i--) { while (dfs(mex + 1)) { mex++; dfn++; } ans[i] = mex + 1; dfn++; edge[p[lft[i]]].push_back(c[lft[i]]); } for (i = 1; i <= d; i++) { printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s[] = { zero , one , two , three , four , five , six , seven , eight , nine , ten , eleven , twelve , thirteen , fourteen , fifteen , sixteen , seventeen , eighteen , nineteen }; string c[] = { , , twenty , thirty , forty , fifty , sixty , seventy , eighty , ninety }; int n; cin >> n; if (n < 20) { cout << s[n]; } else { if (n % 10 == 0) cout << c[n / 10]; else cout << c[n / 10] << - << s[n % 10]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e4, SQN = 3e2; map<int, int> dst_idx, idx_dst; int n, d, dp[MAXN + 3][SQN + 3], a[MAXN + 3], max_idx; int fazdp(int idx, int li) { if (dp[idx][li] != -1) return dp[idx][li]; int di = idx_dst[li]; int ret = 0; for (int i = -1; i <= 1; i++) { int dd = di + i; if (dst_idx.find(dd) == dst_idx.end() || dd <= 0 || idx + dd > max_idx) continue; int iidx = idx + dd; ret = max(ret, fazdp(iidx, dst_idx[dd])); } return dp[idx][li] = a[idx] + ret; } int main() { for (int i = 0; i < MAXN + 3; i++) for (int j = 0; j < SQN + 3; j++) dp[i][j] = -1; scanf( %d %d , &n, &d); for (int i = 1; i <= n; i++) { int aux; scanf( %d , &aux); max_idx = max(max_idx, aux); a[aux]++; } int cnt = 0; for (int i = max(1, d - SQN); i <= min(max_idx, d + SQN); i++) { dst_idx[i] = cnt; idx_dst[cnt] = i; cnt++; } printf( %d , a[0] + fazdp(d, dst_idx[d])); } |
#include <bits/stdc++.h> using namespace std; long long int d[400001], num[400001]; int decr[400001], inc[400001]; priority_queue<pair<long long int, int>, vector<pair<long long int, int> >, greater<pair<long long int, int> > > H1; priority_queue<pair<long long int, int> > H2; int main() { int i; int t, m; long long int n, k, p, o; scanf( %d , &t); while (t--) { scanf( %I64d %d %I64d , &n, &m, &k), o = 0; for (i = 0; i < m; i++) scanf( %I64d , &p), d[i] = p - o, o = p; d[m++] = n - o, k += m; long long int l = 1, r = n; while (l < r) { long long int mid = (l + r) / 2; long long int s = 0; for (i = 0; i < m; i++) s += (d[i] + mid - 1) / mid; if (s > k) l = mid + 1; else r = mid; } long long int s = 0; for (i = 0; i < m; i++) num[i] = (d[i] + r - 1) / r, s += num[i]; for (i = 0; i < m; i++) { if ((s < k) && ((d[i] + num[i] - 1) / num[i] == r)) { long long int x = (d[i] - 1) / (r - 1) - num[i] + 1; x = min(x, k - s); num[i] += x, s += x; } l = min(l, d[i] / num[i]); } long long int ans = r - l; for (i = 0; i < m; i++) H1.push(make_pair(d[i] / num[i], i)), H2.push(make_pair(d[i] / (num[i] + 1), i)); fill(decr, decr + m, 0), fill(inc, inc + m, 0); int tt = 10 * m; while (tt--) { while (d[H1.top().second] / num[H1.top().second] != H1.top().first) H1.pop(); while (d[H2.top().second] / (num[H2.top().second] + 1) != H2.top().first) H2.pop(); int u = H1.top().second, v = H2.top().second; H1.pop(), H2.pop(); if (u == v) break; num[u]--, num[v]++; decr[u] = 1, inc[v] = 1; if (decr[u] && inc[u]) break; if (decr[v] && inc[v]) break; if (num[u] == 0) break; r = max(r, (d[u] + num[u] - 1) / num[u]); H1.push(make_pair(d[u] / num[u], u)); if (d[u] / num[u] != d[u] / (num[u] + 1)) H2.push(make_pair(d[u] / (num[u] + 1), u)); if (d[v] / num[v] != d[v] / (num[v] - 1)) H1.push(make_pair(d[v] / num[v], v)); H2.push(make_pair(d[v] / (num[v] + 1), v)); while (d[H1.top().second] / num[H1.top().second] != H1.top().first) H1.pop(); ans = min(ans, r - H1.top().first); } printf( %I64d n , ans); while (!H1.empty()) H1.pop(); while (!H2.empty()) H2.pop(); } return 0; } |
#include <bits/stdc++.h> int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int a; std::cin >> a; int d[6]; for (int i = 0; i < 6; ++i) d[i] = a >> i & 1; std::cout << (d[0] << 4 | d[1] << 1 | d[2] << 3 | d[3] << 2 | d[4] | d[5] << 5) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, a, b, c, d, ans1, ans2, ans3; cin >> t; while (t--) { ans1 = 0; ans2 = 0; ans3 = 0; cin >> a >> b >> c >> d; ans1 = a / b; ans2 = (c - 1) / b; ans3 = d / b; ans1 -= ans3; ans1 += ans2; cout << ans1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char a[50][50]; int main() { int n, m; cin >> n >> m; for (int j = 0; j < m; j++) a[0][j] = # ; for (int j = 0; j < m - 1; j++) a[1][j] = . ; a[1][m - 1] = # ; for (int i = 2; i < n; i++) { for (int j = 0; j < m; j++) { if (i % 2 == 0) a[i][j] = # ; else { if (j == 0 && a[i - 2][0] == . ) a[i][j] = # ; else if (j == m - 1 && a[i - 2][m - 1] == . ) a[i][j] = # ; else a[i][j] = . ; } } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) cout << a[i][j]; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, number; cin >> n; int arr[n + 1]; bool marcado[n + 1]; memset(marcado, 0, sizeof marcado); for (int i = 1; i <= n; i++) { cin >> number; if (!marcado[number] && number <= n) { marcado[number] = true; arr[i] = number; } else arr[i] = 0; } int i, j; for (i = 1, j = 1; i <= n; i++) { if (arr[i] != 0) { cout << arr[i] << ; } else { while (marcado[j]) j++; cout << j++ << ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, tmp, k, gbd; cin >> n; k = 1; while (k < 10) { tmp = pow(2, k - 1) * (pow(2, k) - 1); if (n % tmp == 0) gbd = tmp; k++; } cout << gbd; } |
#include <bits/stdc++.h> using namespace std; int s, a, n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; while (n--) cin >> a, s += abs(a); cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, ans = -1000001; int main() { cin >> n; float a; for (int i = 1; i <= n; i++) { cin >> a; if (floor(sqrt(a)) != sqrt(a)) { ans = max(ans, (int)a); } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, i, j, s = 0, min1 = INT_MAX, min2 = INT_MIN, od = 0; cin >> n; long long int a[n + 5]; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] >= 0) { if (a[i] % 2) od++, min1 = min(min1, a[i]); s += a[i]; } else { if (a[i] % 2) min2 = max(min2, a[i]); } } if (s % 2 == 0) { if (min1 == INT_MAX) cout << s + min2 << n ; else if (min2 == INT_MIN) cout << s - min1 << n ; else { long long int x = s - min1; long long int y = s + min2; cout << max(x, y) << n ; } } else cout << s << n ; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { long long int n, x, ans, ans1, y; cin >> y; n = (long long int)sqrt((double)y); for (long long int i = n; i > 0; i--) { if (y % i == 0) { x = y / i; if (gcd(i, x) == 1) { ans = i; ans1 = x; break; } } } if (y != 1) cout << ans << << ans1 << endl; else cout << 1 << << 1 << endl; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { for (T i : v) os << i << ; return os; } template <class T> ostream& operator<<(ostream& os, const set<T>& v) { for (T i : v) os << i << ; return os; } template <class T, class S> ostream& operator<<(ostream& os, const pair<T, S>& v) { os << v.first << << v.second; return os; } template <class T, class S> ostream& operator<<(ostream& os, const unordered_map<T, S>& v) { for (auto i : v) os << ( << i.first << => << i.second << ) << ; return os; } #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) const long long inf = 1e18; const long long mod = 1e9 + 7; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } clock_t time_p = clock(); void starboy1299() { time_p = clock() - time_p; cerr << Time Taken : << (float)(time_p) / CLOCKS_PER_SEC << n ; } const long long N = 5e5 + 5; void solve() { long long n, p; cin >> n >> p; for (long long i = 1; i <= 32; i++) { long long val = n - p * i; long long temp = __builtin_popcount(val); if (temp <= i and val >= i) { cout << i << n ; return; } } cout << -1 << n ; } int32_t main() { fast(); long long t = 1; for (long long i = 1; i <= t; i++) { solve(); } starboy1299(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, k, ans = 0; cin >> n >> k; if (n < 3) { cout << 0; return 0; } for (int i = 0; i < n; ++i) { cin >> x; if (5 - x >= k) ans++; } cout << ans / 3; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int arr[4]; for (int i = 0; i < 4; i++) cin >> arr[i]; string strips; cin >> strips; int n = strips.length(); int cal = 0; for (int i = 0; i < n; i++) { if (strips[i] == 1 ) cal += arr[0]; else if (strips[i] == 2 ) cal += arr[1]; else if (strips[i] == 3 ) cal += arr[2]; else if (strips[i] == 4 ) cal += arr[3]; } cout << cal; return 0; } |
#include <bits/stdc++.h> using namespace std; void Kinishinaide() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); } const long long N = 1e2 + 7; const long long Mod = 1e9 + 7; const long long Inf = 1e18 + 7; int M, L; long long Aq[N]; long long dp[N], Ans; int main() { Kinishinaide(); cin >> M >> L; memset(dp, Inf, sizeof(dp)); for (int i = 0; i < M; i++) { cin >> Aq[i]; if (i) { dp[i] = min(Aq[i], (dp[i - 1] << 1)); } else { dp[i] = Aq[i]; } } long long Sum = false, Ans = Inf; for (int i = M - 1; i >= 0; i--) { Sum += 1LL * (L / (1 << i)) * dp[i]; L = L % (1 << i); Ans = min(Ans, Sum + 1LL * (L > 0) * dp[i]); } cout << Ans; } |
#include <bits/stdc++.h> using namespace std; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, -1, 0, 1}; const double EPS = 1e-9; const int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int daysleap[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int main() { int n, k; cin >> n >> k; vector<int> A(n); for (unsigned int i = 0; i < (n); i++) cin >> A[i]; sort(A.begin(), A.end()); vector<int> B = A; unique(B.begin(), B.end()); reverse(B.begin(), B.end()); vector<int> C = B; for (unsigned int i = 0; i < (B.size()); i++) { C[i] = count(A.begin(), A.end(), B[i]); } int kk = 0; for (unsigned int i = 0; i < (B.size()); i++) { kk += C[i]; if (kk == k) { cout << B[i] << << B[i] << endl; return 0; } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long x = 1, y = a; while (b > 0) { if (b % 2) { x = (x * y) % 1000000007; } y = (y * y) % 1000000007; b /= 2; } return x % 1000000007; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long int t = 1, n, m, i, j, k, sum = 0; while (t--) { cin >> n; vector<long long int> v(n); for (i = 0; i < n; i++) cin >> v[i]; sort((v).begin(), (v).end()); for (i = 1; i < n; i++) { v[i] += v[i - 1]; } for (i = 1; i < n; i++) { sum = (sum + (power(2, i - 1) * ((v[n - 1] - v[i - 1] - v[n - i - 1]) % 1000000007)) % 1000000007) % 1000000007; sum = sum % 1000000007; } cout << sum; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) using namespace std; const long long N = 1e6 + 5; const long long MAX = 1e7 + 9; long long binarySearch(long long arr[], long long l, long long r, long long x) { if (r >= l) { long long mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; } void pairsort(long long a[], long long b[], long long n) { pair<long long, long long> pairt[n]; for (long long i = 0; i < n; i++) { pairt[i].first = a[i]; pairt[i].second = b[i]; } sort(pairt, pairt + n); for (long long i = 0; i < n; i++) { a[i] = pairt[i].first; b[i] = pairt[i].second; } } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long isprime(long long n) { if (n < 2) return 0; if (n < 4) return 1; if (n % 2 == 0 or n % 3 == 0) return 0; for (long long i = 5; i * i <= n; i += 6) if (n % i == 0 or n % (i + 2) == 0) return 0; return 1; } long long C(long long n, long long r) { if (r > n - r) r = n - r; long long ans = 1; for (long long i = 1; i <= r; i++) { ans *= n - r + i; ans /= i; } return ans; } long long mod = 1e9 + 7; long long modexpo(long long x, long long p) { long long res = 1; x = x % mod; while (p) { if (p % 2) res = res * x; p >>= 1; x = x * x % mod; res %= mod; } return res; } long long countDistinct(long long arr[], long long n) { sort(arr, arr + n); long long res = 0; for (long long i = 0; i < n; i++) { while (i < n - 1 && arr[i] == arr[i + 1]) i++; res++; } return res; } long long int2Bin(string s) { reverse(s.begin(), s.end()); long long b = 1; long long x = 0; for (long long i = 0; i < s.length(); ++i) { if (s[i] == 1 ) x += b; b *= 2; ; } return x; } long long getSum(long long n) { long long sum; for (sum = 0; n > 0; sum += n % 10, n /= 10) ; return sum; } long long nex(long long i) { return (i / 10 + 1) * 10 - i; } bool up[N]; long long a[N], ind, leave[11]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n; cin >> n; pair<long long, long long> a[n]; long long i; for (i = 0; i < n; i++) { long long x; cin >> x; a[i].first = x; a[i].second = i; } sort(a, a + n); long long ans = 2 * n; for (i = 1; i < n; i++) { if (a[i].first == a[i - 1].first) ans = min(ans, a[i].second - a[i - 1].second + 1); } if (ans == 2 * n) cout << -1 n ; else cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; int n; char str[N]; vector<int> g[N]; inline void init() { scanf( %d , &n); for (int i = 1, u, v; i < n; i++) { scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } scanf( %s , str + 1); for (int i = 1; i <= n; i++) { if (str[i] == W ) { g[i].push_back(++n); g[n].push_back(i); g[n].push_back(n + 1); g[n + 1].push_back(n); g[n].push_back(n + 2); g[n + 2].push_back(n); n = n + 2; } } } int dfs(int p, int fa, int dest) { if (p == dest) { return 1; } for (auto e : g[p]) { if (e ^ fa) { int ret = dfs(e, p, dest); if (~ret) { return ret ^ 1; } } } return -1; } vector<int> d3; inline void solve() { d3.clear(); for (int i = 1; i <= n; i++) { if (g[i].size() >= 4) { puts( White ); return; } if (g[i].size() == 3) { d3.push_back(i); int _cnt = 0; for (auto e : g[i]) { if (g[e].size() >= 2) { _cnt++; } } if (_cnt >= 2) { puts( White ); return; } } } if (d3.size() >= 3) { puts( White ); return; } if (d3.size() == 2) { puts((dfs(d3[0], 0, d3[1])) ? ( White ) : ( Draw )); } else { puts( Draw ); } } inline void clear() { for (int i = 1; i <= n; i++) { g[i].clear(); } } int T; int main() { scanf( %d , &T); while (T--) { init(); solve(); clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int test = 1; cin >> test; while (test--) { string s; cin >> s; int a = -1, b = -1, c = -1; int ans = s.size(); for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) a = i; else if (s[i] == 2 ) b = i; else c = i; if (a != -1 && b != -1 && c != -1) { int x = min(a, min(b, c)); int y = max(a, max(b, c)); ans = min(ans, y - x + 1); } } if (a != -1 && b != -1 && c != -1) cout << ans << n ; else cout << 0 << n ; } return 0; } |
#include <bits/stdc++.h> const int BARIER = 0; class Rng { private: static std::mt19937 engine; public: static std::mt19937& get_engine() { return engine; } template <typename T> static void set_seed(T const& seed) { engine = std::mt19937(seed); } static void timebased_seed() { engine = std::mt19937( std::chrono::duration_cast<std::chrono::nanoseconds>( std::chrono::high_resolution_clock::now().time_since_epoch()) .count()); } template <typename T> static typename std::enable_if<std::is_integral<T>::value, T>::type uniform( T l, T r) { return std::uniform_int_distribution<T>(l, r)(engine); } template <typename T> static typename std::enable_if<std::is_floating_point<T>::value, T>::type uniform(T l, T r) { return std::uniform_real_distribution<T>(l, r)(engine); } }; std::mt19937 Rng::engine( std::chrono::duration_cast<std::chrono::nanoseconds>( std::chrono::high_resolution_clock::now().time_since_epoch()) .count()); class Timer { public: template <typename S, typename T, typename... U> static S execute_timed(T func, std::string const& name, U&&... u) { auto time_begin = std::chrono::high_resolution_clock::now(); S ret = func(std::forward<U>(u)...); auto time_end = std::chrono::high_resolution_clock::now(); auto timespan = std::chrono::duration_cast<std::chrono::nanoseconds>( time_end - time_begin); std::cerr << Execution of << name << took << std::fixed << std::setprecision(6) << timespan.count() * 1e-9 << n ; return ret; } }; using namespace std; class Bigint_base10 { public: static constexpr int64_t BASE = 1e18; static constexpr int DIGITS = 18; private: bool is_neg; vector<int64_t> data; public: Bigint_base10() : is_neg(false), data(1, 0) {} Bigint_base10(int64_t const& val) : is_neg(val < 0) { int64_t abs_val = abs(val); if (abs_val < BASE) { data = {abs_val}; } else { data = {abs_val % BASE, abs_val / BASE}; } } Bigint_base10 operator+(Bigint_base10 const& o) const { Bigint_base10 ret; ret.is_neg = is_neg; ret.data.assign(1 + max(data.size(), o.data.size()), 0); copy(data.begin(), data.end(), ret.data.begin()); int64_t carry = 0; for (unsigned int i = 0; i < o.data.size(); ++i) { ret.data[i] += o.data[i] + carry; carry = 0; if (ret.data[i] >= BASE) { carry = 1; ret.data[i] -= BASE; } } for (unsigned int i = o.data.size(); carry; ++i) { ret.data[i] += carry; carry = 0; if (ret.data[i] >= BASE) { carry = 1; ret.data[i] -= BASE; } } return ret.trim(); } Bigint_base10 operator*(int64_t const& o) const { if (o == 0) { return Bigint_base10(0); } if (o < 0) { return operator*(-o).negate(); } if (o & 1) { return operator+(operator*(o - 1)); } return operator+(*this) * (o / 2); } Bigint_base10& operator+=(Bigint_base10 const& o) { *this = operator+(o); return *this; } Bigint_base10& operator*=(int64_t const& o) { *this = operator*(o); return *this; } Bigint_base10& trim() { while (data.size() > 1 && data.back() == 0) { data.pop_back(); } return *this; } bool is_zero() const { for (auto const& e : data) if (e) return false; return true; } Bigint_base10& negate() { is_neg = !is_neg; if (is_zero()) is_neg = false; return *this; } friend ostream& operator<<(ostream& o, Bigint_base10 const& b) { if (b.is_neg) o << - ; o << b.data.back(); o << setfill( 0 ); for (auto it = next(b.data.rbegin()); it != b.data.rend(); ++it) { o << setw(9) << *it; } o << setw(0) << setfill( ); return o; } friend istream& operator>>(istream& in, Bigint_base10& b) { static string tmp; in >> tmp; if (tmp[0] == - ) { b.is_neg = true; tmp = tmp.substr(1, -1); } else { b.is_neg = false; } b.data.resize((tmp.size() + DIGITS - 1) / DIGITS); unsigned int i, j; for (i = tmp.size() - DIGITS, j = 0; i > 0; i -= DIGITS, ++j) { b.data[j] = stoll(tmp.substr(i, DIGITS)); } b.data[j] = stoll(tmp.substr(0, i + DIGITS)); return in; } }; template <size_t len> struct Bigint_Fixedsize { unsigned int data[len]; static constexpr unsigned int bits = 31; Bigint_Fixedsize() { memset(data, 0, sizeof(data)); } Bigint_Fixedsize(long long const& _a) { memset(data, 0, sizeof(data)); unsigned long long a = _a; data[0] = a & ((1u << bits) - 1); data[1] = a >> bits; data[1] &= ~(1u << bits); if (a > ~a) { for (size_t i = 2; i < len; ++i) { data[i] = (1u << bits) - 1; } } } Bigint_Fixedsize& operator+=(Bigint_Fixedsize const& o) { unsigned int carry = 0; for (size_t i = 0; i < len; ++i) { data[i] += o.data[i] + carry; carry = data[i] >> bits; data[i] &= ~(1u << bits); } return *this; } Bigint_Fixedsize& operator-=(Bigint_Fixedsize const& o) { unsigned int carry = 0; for (size_t i = 0; i < len; ++i) { data[i] -= o.data[i] + carry; carry = data[i] >> bits; data[i] &= ~(1u << bits); } return *this; } Bigint_Fixedsize operator+(Bigint_Fixedsize const& o) const { Bigint_Fixedsize ret(*this); ret += o; return ret; } Bigint_Fixedsize operator-(Bigint_Fixedsize const& o) const { Bigint_Fixedsize ret(*this); ret -= o; return ret; } void multo(Bigint_Fixedsize const& o, Bigint_Fixedsize& ret) const { static unsigned int tmp[len + 1]; memset(tmp, 0, sizeof(tmp)); for (size_t i = 0; i < len; ++i) { unsigned long long val = 0; for (size_t j = 0; j < len - i; ++j) { val += data[i] * (unsigned long long)o.data[j] + tmp[i + j]; tmp[i + j] = val & ((1u << bits) - 1); val >>= bits; } } memcpy(ret.data, tmp, sizeof(ret.data)); } Bigint_Fixedsize& operator*=(Bigint_Fixedsize const& o) { multo(o, *this); return *this; } Bigint_Fixedsize operator*(Bigint_Fixedsize const& o) const { Bigint_Fixedsize ret; multo(o, ret); return ret; } Bigint_Fixedsize& negate() { unsigned int carry = 0; for (size_t i = 0; i < len; ++i) { data[i] = ~data[i] + !carry; carry = (data[i] >> bits); data[i] &= ~(1u << bits); } return *this; } Bigint_Fixedsize operator-() const { Bigint_Fixedsize ret(*this); ret.negate(); return ret; } bool operator<(Bigint_Fixedsize const& o) const { if (data[len - 1] >> (bits - 1) != o.data[len - 1] >> (bits - 1)) { return data[len - 1] >> (bits - 1); } for (size_t i = len - 1; ~i; --i) { if (data[i] != o.data[i]) return data[i] < o.data[i]; } return false; } bool operator>(Bigint_Fixedsize const& o) const { return o < *this; } bool operator<=(Bigint_Fixedsize const& o) const { return !(operator>(o)); } bool operator>=(Bigint_Fixedsize const& o) const { return !(operator<(o)); } bool operator==(Bigint_Fixedsize const& o) const { for (size_t i = 0; i < len; ++i) { if (data[i] != o.data[i]) return false; } return true; } bool operator!=(Bigint_Fixedsize const& o) const { return !operator==(o); } bool operator!() const { for (size_t i = 0; i < len; ++i) { if (data[i]) return false; } return true; } bool is_negative() const { return data[len - 1] >> (bits - 1); } void print_binary(ostream& o, Bigint_Fixedsize const& b) { o << [ ; for (size_t i = len; i > 0; --i) { o << bitset<bits>(b.data[i - 1]); } o << ] ; } friend ostream& operator<<(ostream& o, Bigint_Fixedsize const& b) { if (b.is_negative()) { return o << - << -b << n ; } Bigint_base10 ret(0); int64_t base = 1u << bits; for (int i = len - 1; i >= 0; --i) { ret *= base; ret += Bigint_base10(b.data[i]); } o << ret; return o; } explicit operator long double() const { if (is_negative()) { return (long double)operator-(); } long double ret = 0.0; long double base = 1u << bits; for (int i = len - 1; i >= 0; --i) { ret = ret * base + data[i]; } return ret; } friend istream& operator>>(istream& i, Bigint_Fixedsize& b) { int64_t tmp; i >> tmp; b = Bigint_Fixedsize(tmp); return i; } }; template <size_t len> struct Bigint_Fixedsize_Fast { unsigned int data[len]; uint16_t siz; bool sign; static constexpr unsigned int bits = 32; Bigint_Fixedsize_Fast() { data[0] = 0; siz = 1; sign = false; } Bigint_Fixedsize_Fast(long long a) { sign = false; if (a < 0) { sign = true; a = -a; } siz = 0; do { long long b = a >> bits; data[siz] = a - (b << bits); a = b; ++siz; } while (a); } void trim() { while (siz > 1 && !data[siz - 1]) --siz; } int comp_unsigned(Bigint_Fixedsize_Fast const& o) const { uint16_t lim = min(siz, o.siz); for (unsigned int i = lim; i < siz; ++i) { if (data[i]) { return 1; } } for (unsigned int i = lim; i < o.siz; ++i) { if (o.data[i]) { return -1; } } for (unsigned int i = lim - 1; i + 1; --i) { if (data[i] != o.data[i]) { return data[i] < o.data[i] ? -1 : 1; } } return 0; } int comp(Bigint_Fixedsize_Fast const& o) const { int sign_mul = 1 - 2 * sign; if (sign != o.sign) { return sign_mul; } return sign_mul * comp_unsigned(o); } bool operator<(Bigint_Fixedsize_Fast const& o) const { return comp(o) < 0; } bool operator>(Bigint_Fixedsize_Fast const& o) const { return comp(o) > 0; } bool operator<=(Bigint_Fixedsize_Fast const& o) const { return comp(o) <= 0; } bool operator>=(Bigint_Fixedsize_Fast const& o) const { return comp(o) >= 0; } bool operator==(Bigint_Fixedsize_Fast const& o) const { return comp(o) == 0; } bool operator!=(Bigint_Fixedsize_Fast const& o) const { return comp(o) != 0; } bool operator!() const { return operator==(ZERO); } Bigint_Fixedsize_Fast operator-() const { Bigint_Fixedsize_Fast ret(*this); if (!!ret) { ret.sign ^= 1; } return ret; } Bigint_Fixedsize_Fast operator*(Bigint_Fixedsize_Fast const& o) const { Bigint_Fixedsize_Fast ret; ret.siz = min(siz + o.siz, (int)len); ret.sign = (sign != o.sign); fill(ret.data, ret.data + ret.siz, 0); for (unsigned int i = 0; i < siz; ++i) { unsigned long long carry = 0, carry_2; for (unsigned int j = 0; j < o.siz; ++j) { carry += data[i] * (unsigned long long)o.data[j] + ret.data[i + j]; carry_2 = carry >> bits; ret.data[i + j] = carry - (carry_2 << bits); carry = carry_2; } for (unsigned int j = i + o.siz; carry; ++j) { carry += ret.data[j]; carry_2 = carry >> bits; ret.data[j] = carry - (carry_2 << bits); carry = carry_2; } } ret.trim(); return ret; } Bigint_Fixedsize_Fast& operator*=(Bigint_Fixedsize_Fast const& o) { *this = operator*(o); return *this; } static void unsigned_add(Bigint_Fixedsize_Fast& ret, Bigint_Fixedsize_Fast const& A, Bigint_Fixedsize_Fast const& B) { const Bigint_Fixedsize_Fast *a = &A, *b = &B; if (a->siz < b->siz) swap(a, b); ret.sign = A.sign; unsigned long long carry = 0, carry_2; unsigned int j; for (j = 0; j < b->siz; ++j) { carry += (unsigned long long)a->data[j] + (unsigned long long)b->data[j]; carry_2 = carry >> bits; ret.data[j] = carry - (carry_2 << bits); carry = carry_2; } for (; j < a->siz; ++j) { carry += a->data[j]; carry_2 = carry >> bits; ret.data[j] = carry - (carry_2 << bits); carry = carry_2; } if (carry) { ret.data[j++] = carry; } ret.siz = j; ret.trim(); } static void unsigned_subtract(Bigint_Fixedsize_Fast& ret, Bigint_Fixedsize_Fast const& A, Bigint_Fixedsize_Fast const& B) { int com = A.comp_unsigned(B); if (com == 0) { ret.sign = false; ret.siz = 1; ret.data[0] = 0; return; } ret.sign = A.sign; const Bigint_Fixedsize_Fast *a = &A, *b = &B; if (com < 0) { ret.sign ^= true; swap(a, b); } unsigned int min_siz = min(A.siz, B.siz); unsigned long long carry = 0, carry_2; unsigned int j; for (j = 0; j < min_siz; ++j) { carry += (unsigned long long)a->data[j] - (unsigned long long)b->data[j]; carry_2 = carry >> bits; ret.data[j] = carry - (carry_2 << bits); carry = -(carry_2 & 1u); } for (; carry; ++j) { carry += a->data[j]; carry_2 = carry >> bits; ret.data[j] = carry - (carry_2 << bits); carry = -(carry_2 & 1u); } copy(a->data + j, a->data + a->siz, ret.data + j); ret.siz = a->siz; ret.trim(); } static void add(Bigint_Fixedsize_Fast& ret, Bigint_Fixedsize_Fast const& A, Bigint_Fixedsize_Fast const& B) { if (A.sign == B.sign) { unsigned_add(ret, A, B); } else { unsigned_subtract(ret, A, B); } } static void sub(Bigint_Fixedsize_Fast& ret, Bigint_Fixedsize_Fast const& A, Bigint_Fixedsize_Fast const& B) { if (A.sign != B.sign) { unsigned_add(ret, A, B); } else { unsigned_subtract(ret, A, B); } } Bigint_Fixedsize_Fast operator+(Bigint_Fixedsize_Fast const& o) const { Bigint_Fixedsize_Fast ret; add(ret, *this, o); return ret; } Bigint_Fixedsize_Fast& operator+=(Bigint_Fixedsize_Fast const& o) { add(*this, *this, o); return *this; } Bigint_Fixedsize_Fast operator-(Bigint_Fixedsize_Fast const& o) const { Bigint_Fixedsize_Fast ret; sub(ret, *this, o); return ret; } Bigint_Fixedsize_Fast operator-=(Bigint_Fixedsize_Fast const& o) { sub(*this, *this, o); return *this; } void print_binary(ostream& o, Bigint_Fixedsize_Fast const& b) { o << [ ; o << sign << / << len << / ; for (size_t i = siz; i > 0; --i) { o << bitset<bits>(b.data[i - 1]); } o << ] ; } friend ostream& operator<<(ostream& o, Bigint_Fixedsize_Fast const& b) { if (b.sign) { return o << - << -b; } Bigint_base10 ret(0); int64_t base = 1ll << bits; for (int i = b.siz - 1; i >= 0; --i) { ret *= base; ret += Bigint_base10(b.data[i]); } o << ret; return o; } explicit operator long double() const { if (sign) { return (long double)operator-(); } long double ret = 0.0; long double base = 1ll << bits; for (int i = siz - 1; i >= 0; --i) { ret = ret * base + data[i]; } return ret; } friend istream& operator>>(istream& i, Bigint_Fixedsize_Fast& b) { int64_t tmp; i >> tmp; b = Bigint_Fixedsize_Fast(tmp); return i; } static const Bigint_Fixedsize_Fast ZERO; }; template <size_t len> const Bigint_Fixedsize_Fast<len> Bigint_Fixedsize_Fast<len>::ZERO(0); template <typename FLOAT> class Lp_Seidel { private: vector<FLOAT> proj_down(vector<FLOAT> const& vec, vector<FLOAT> const& plane, size_t j) { vector<FLOAT> ret(vec.size() - 1); if (plane[j] < FLOAT(0)) { for (size_t i = 0; i + 1 < vec.size(); ++i) { ret[i] = vec[j] * plane[i + (i >= j)] - vec[i + (i >= j)] * plane[j]; } } else { for (size_t i = 0; i + 1 < vec.size(); ++i) { ret[i] = vec[i + (i >= j)] * plane[j] - vec[j] * plane[i + (i >= j)]; } } return ret; } vector<FLOAT> proj_up(vector<FLOAT> const& vec, vector<FLOAT> const& plane, size_t j) { vector<FLOAT> ret(vec.size() + 1); copy(vec.begin(), vec.begin() + j, ret.begin()); copy(vec.begin() + j, vec.end(), ret.begin() + j + 1); for (size_t i = 0; i < vec.size(); ++i) { ret[j] += vec[i] * plane[i + (i >= j)]; } FLOAT denom = plane[j]; if (denom < FLOAT(0)) { denom = -denom; } for (size_t i = 0; i < vec.size(); ++i) { ret[i + (i >= j)] *= denom; } if (plane[j] >= FLOAT(0)) { ret[j] = -ret[j]; } return ret; } FLOAT planescal(vector<FLOAT> const& x, vector<FLOAT> const& a) { FLOAT ret = 0; for (size_t i = 0; i < x.size(); ++i) { ret += x[i] * a[i]; } return ret; } vector<FLOAT> solve(vector<vector<FLOAT>> const& A, vector<FLOAT> const& c, int d, FLOAT const& barier_loc) { int n = A.size(); if (d == 1) { vector<FLOAT> ret(2); ret[0] = (c[0] < FLOAT(0) ? -barier_loc : barier_loc); ret[1] = 1ull; for (int i = 0; i < n; ++i) { if (ret[0] * A[i][0] + ret[1] * A[i].back() > FLOAT(0)) { if (!A[i][0]) { do { } while (0); return vector<FLOAT>(); } ret[0] = -A[i].back(); ret[1] = A[i][0]; if (ret[1] < FLOAT(0)) { ret[1] = -ret[1]; ret[0] = -ret[0]; } do { } while (0); } } for (int i = 0; i < n; ++i) { if (ret[0] * A[i][0] + ret[1] * A[i].back() > FLOAT(0)) { do { } while (0); return vector<FLOAT>(); } } return ret; } FLOAT barier_next = barier_loc * barier_loc; vector<FLOAT> x(d + 1); for (int i = 0; i < d; ++i) { x[i] = (c[i] < FLOAT(0) ? -barier_loc : barier_loc); } x.back() = FLOAT(1); for (size_t i = 0; i < A.size(); ++i) { if (planescal(x, A[i]) > FLOAT(0)) { int k = 0; while (k < d && !A[i][k]) ++k; if (k == d) { do { } while (0); return vector<FLOAT>(); } vector<vector<FLOAT>> A2(i); for (size_t j = 0; j < A2.size(); ++j) { A2[j] = proj_down(A[j], A[i], k); } shuffle(A2.begin(), A2.end(), Rng::get_engine()); do { } while (0); vector<FLOAT> c2 = proj_down(c, A[i], k); vector<FLOAT> x2 = solve(A2, c2, d - 1, barier_next); if (x2.empty()) return x2; x = proj_up(x2, A[i], k); do { } while (0); do { } while (0); do { } while (0); } } return x; } public: vector<FLOAT> solve(vector<vector<FLOAT>> const& A, vector<FLOAT> const& c, const FLOAT& barier = FLOAT((long long)1e9)) { return solve(A, c, c.size(), barier); } vector<FLOAT> solve(vector<vector<FLOAT>> A, vector<FLOAT> const& b, vector<FLOAT> const& c) { for (unsigned int i = 0; i < A.size(); ++i) { A[i].push_back(-b[i]); } return solve(A, c); } }; template <typename Big_Int> class Lp_Clarkson { private: vector<int> sample_subset(vector<int64_t> const& weight, unsigned int siz) { int64_t total_weight = accumulate(weight.begin(), weight.end(), 0ll); vector<int64_t> samples; while (samples.size() < siz) { int64_t new_sample = Rng::uniform<int64_t>(0, total_weight - 1); if (find(samples.begin(), samples.end(), new_sample) == samples.end()) { samples.push_back(new_sample); } } sort(samples.begin(), samples.end()); vector<int> ret; int64_t left_weight = 0; for (unsigned int i = 0, j = 0; i < weight.size() && j < samples.size();) { if (samples[j] < left_weight + weight[i]) { ret.push_back(i); ++j; } else { left_weight += weight[i]; ++i; } } return ret; } bool is_satisfied(vector<Big_Int> const& x, vector<Big_Int> const& a) { Big_Int ret = 0; for (size_t i = 0; i < x.size(); ++i) { ret += x[i] * a[i]; } return ret <= Big_Int(0); } vector<Big_Int> solve(vector<vector<Big_Int>> const& A, vector<Big_Int> const& c, const unsigned int sample_size) { Lp_Seidel<Big_Int> sub_lp; if (A.size() < sample_size) { return sub_lp.solve(A, c); } else { int equations = A.size(); int variables = c.size(); vector<int64_t> weight(equations, 1); vector<Big_Int> x; vector<vector<Big_Int>> subproblem_A; vector<char> is_violated(equations, 0); for (unsigned int iteration = 1;; ++iteration) { subproblem_A.clear(); vector<int> subspace = sample_subset(weight, sample_size); for (int const& e : subspace) { subproblem_A.push_back(A[e]); } x = sub_lp.solve(subproblem_A, c); if (x.empty()) { return x; } int64_t total_violated = 0; for (int i = 0; i < equations; ++i) { is_violated[i] = !is_satisfied(x, A[i]); if (is_violated[i]) { total_violated += weight[i]; } } if (total_violated == 0) { cerr << Iterations: << iteration; cerr << , max weight: << *max_element(weight.begin(), weight.end()) << n ; break; } if (total_violated * 3 * variables <= accumulate(weight.begin(), weight.end(), 0ll)) { for (int i = 0; i < equations; ++i) { if (is_violated[i]) { weight[i] *= 2; } } } } return x; } } public: vector<Big_Int> solve(vector<vector<Big_Int>> const& A, vector<Big_Int> const& c) { return solve(A, c, c.size() * c.size() * 4); } vector<Big_Int> solve(vector<vector<Big_Int>> A, vector<Big_Int> const& b, vector<Big_Int> const& c) { for (unsigned int i = 0; i < A.size(); ++i) { A[i].push_back(-b[i]); } return solve(A, c); } }; template <typename Big_Int> void test_factorial(unsigned int n, bool debug = false) { std::cout << Computing << n << ! n ; Big_Int val(1); for (unsigned int i = 1; i <= n; ++i) { val *= i; if (debug) std::cerr << i << : << val << n ; } std::cerr << Printing n ; std::cout << val << endl; } template <typename Big_Int> void test_addsub(int n) { Big_Int a(5432123456789ll); Big_Int b(9876543210123ll); Big_Int c; for (int it = 0; it < 4 * n; ++it) { std::cout << a << + << b << = << a + b << n ; std::cout << b << + << a << = << b + a << n ; std::cout << a << - << b << = << a - b << n ; std::cout << b << - << a << = << b - a << n ; c = a; c += b; std::cout << a << + << b << = << c << n ; c = b; c += a; std::cout << b << + << a << = << c << n ; c = a; c -= b; std::cout << a << - << b << = << c << n ; c = b; c -= a; std::cout << b << - << a << = << c << n ; a = -a; if (it % 4 == 3) { a *= it; } else { swap(a, b); } } } template <typename Big_Int> void test_addmul(int n, int k) { std::cout << Addmul test << n << << k << n ; ; Rng::set_seed(635241); Big_Int ret(0); for (int i = 0; i < n; ++i) { Big_Int cur(1); for (int j = 0; j < k; ++j) { Big_Int mu(Rng::uniform(1ll, (long long)1e15)); cur *= mu; } ret += cur; } std::cout << ret << n ; } void test_timer() { std::function<int64_t(int64_t)> fib = [&](int64_t x) { return x < 2 ? x : fib(x - 1) + fib(x - 2); }; Timer::execute_timed<int64_t>(fib, Timer test , 35); Timer::execute_timed<int64_t>(fib, Timer test , 40); } template <typename Big_Int, typename Solver> void test_lp(std::string const& path) { std::cerr << LP Test: << path << n ; std::ifstream in; in.open(path.c_str()); int variables, constraints; in >> variables >> constraints; std::vector<std::vector<Big_Int>> A(constraints, std::vector<Big_Int>(variables)); std::vector<Big_Int> b(constraints), c(variables); for (auto& e : c) in >> e; for (int i = 0; i < constraints; ++i) { for (auto& e : A[i]) in >> e; in >> b[i]; } std::function<std::vector<Big_Int>()> solve = [&]() { Solver solver; return solver.solve(A, b, c); }; std::vector<Big_Int> solution = Timer::execute_timed<vector<Big_Int>>(solve, solve LP ); std::cerr << Solution: n ; for (auto& e : solution) { std::cerr << e << ; } cerr << n ; } template <typename Big_Int, typename Solver> void test_enclosing_annulus(int n) { cerr << Enclosing annulus test ( << n << ) n ; cerr << Int: << typeid(Big_Int).name() << , Solver: << typeid(Solver).name() << n ; Rng::set_seed(1234); vector<pair<int, int>> pts(n); for (auto& e : pts) { e.first = Rng::uniform(-10000, 10000); e.second = Rng::uniform(-10000, 10000); } Rng::set_seed(24680); vector<vector<Big_Int>> A; vector<Big_Int> b, c; c = {Big_Int(0), Big_Int(0), -1, 1}; for (auto const& e : pts) { A.push_back({Big_Int(-2 * e.first), Big_Int(-2 * e.second), -1, 0}); b.emplace_back(-e.first * e.first - e.second * e.second); A.push_back({Big_Int(2 * e.first), Big_Int(2 * e.second), 0, 1}); b.emplace_back(e.first * e.first + e.second * e.second); } std::function<std::vector<Big_Int>()> solve = [&]() { Solver solver; return solver.solve(A, b, c); }; std::vector<Big_Int> solution = Timer::execute_timed<vector<Big_Int>>(solve, solve enclosing circle LP ); std::cerr << Solution: n ; for (auto& e : solution) { std::cerr << e << ; } cerr << n ; if (!solution.empty()) { Big_Int r_sq = solution[2] * solution[4] - solution[1] * solution[1] + solution[2] * solution[2]; Big_Int R_sq = solution[3] * solution[4] - solution[1] * solution[1] + solution[2] * solution[2]; Big_Int area_numerator = solution[3] - solution[2]; cerr << area^2: << (long double)area_numerator / (long double)solution[4] << n ; cerr << r^2: << (long double)r_sq / (long double)(solution[4] * solution[4]) << n ; cerr << R^2: << (long double)R_sq / (long double)(solution[4] * solution[4]) << n ; } cerr << n ; } void test_codeforces_549E() { auto codeforces_549E = [&]() { using DOUBLE = Bigint_Fixedsize_Fast<12>; int N, M; cin >> N >> M; vector<vector<DOUBLE>> A; vector<DOUBLE> b, c(4); A.reserve(N + M); vector<pair<int, int>> p2(N), p(M); for (int i = 0; i < N; ++i) { cin >> p2[i].first >> p2[i].second; } for (int i = 0; i < M; ++i) { cin >> p[i].first >> p[i].second; } for (int it = 0; it < 2; ++it) { N = p.size(); M = p2.size(); A.clear(); b.clear(); for (int i = 0; i < N; ++i) { int x, y, z; tie(x, y) = p[i]; z = x * x + y * y; A.push_back({x, y, 1, 1}); b.push_back(z); } for (int i = 0; i < M; ++i) { int x, y, z; tie(x, y) = p2[i]; z = x * x + y * y; A.push_back({-x, -y, -1, 1}); b.push_back(-z); } c[3] = 1; Lp_Clarkson<DOUBLE> solver; vector<DOUBLE> x = solver.solve(A, b, c); if (!x.empty()) { DOUBLE res = 0; for (size_t i = 0; i < c.size(); ++i) res += x[i] * c[i]; DOUBLE dist = res; if (dist > DOUBLE(0)) { cout << YES n ; return; } } else { } p.swap(p2); } cout << NO n ; }; int TTT = 1; while (TTT--) { codeforces_549E(); } } signed test_codejam_2017_4_D() { using DOUBLE = Bigint_Fixedsize_Fast<25>; freopen( codejam_d.in , r , stdin); freopen( codejam_d.out , w , stdout); cin.tie(0); ios_base::sync_with_stdio(false); int T; cin >> T; for (int cas = 1; cas <= T; ++cas) { cout << Case # << cas << : ; cerr << Case # << cas << : ; int n; cin >> n; vector<vector<DOUBLE>> A; vector<DOUBLE> b, c(4); A.reserve(n); do { } while (0); for (int i = 0; i < n; ++i) { int x, y, z; cin >> x >> y >> z; A.push_back({x, y, z, 1}); b.push_back(0); } c[3] = 1; Lp_Clarkson<DOUBLE> solver; vector<DOUBLE> x = solver.solve(A, b, c); bool did = false; if (!x.empty()) { if (x[3] > DOUBLE(0)) { did = true; } } if (did) cout << NO n ; else cout << YES n ; cerr << (did ? NO n : YES n ); } return 0; } using namespace std; int main() { test_codeforces_549E(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double gr = (1 + sqrt(5)) / 2; long long n, k, c, res[107], mres; string s; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k >> s; c = 1; for (int i = 0; i < n; i++) { if (i > 0) { if (s[i] == s[i - 1]) { c++; if (c == k) { c = 0; res[s[i] - a + 1]++; } } else c = 1; } if (c == k) { c = 0; res[s[i] - a + 1]++; } } for (int i = 1; i <= 26; i++) mres = max(mres, res[i]); cout << mres << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> primes; void sieve() { vector<int> a(1000000, 0); for (int u = 2; u <= 1000000; u++) { if (a[u]) continue; for (int i = 2 * u; i <= 1000000; i += u) a[i] = u; } for (int i = 2; i <= 1000000; i++) { if (!a[i]) primes.push_back(i); } } int gcd(int a, int b) { while (1) { if (a == 0) return b; b %= a; if (b == 0) return a; a %= b; } } int lcm(int a, int b) { int g = gcd(a, b); return ((a * b) / g); } int digitCount(int n) { int c = 0; while (n != 0) { c += n % 10; n /= 10; } return c; } int main() { int n; vector<int> ary = {0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412, 1440}; string str; cin >> str; n = (str[4] - 48) + (str[3] - 48) * 10 + (str[1] - 48) * 60 + (str[0] - 48) * 600; for (int i = 0; i < ary.size(); i++) { if (n <= ary[i]) { cout << ary[i] - n << endl; return 0; } } } |
#include <bits/stdc++.h> using namespace std; char s[105]; int main(void) { int n, f; while (cin >> n) { scanf( %s , s); f = 0; for (int l = (1); l <= (n); ++l) { for (int j = (0); j <= (n - 4 * l - 1); ++j) { if (j + 4 * l >= n) break; if (s[j] == * && s[j + l] == * && s[j + 2 * l] == * && s[j + 3 * l] == * && s[j + 4 * l] == * ) { f = 1; break; } } if (f) break; } if (f) cout << yes n ; else cout << no n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> thing[20005 * 4], query[20005 * 4]; struct Thing { int cost, happy; } d[20005]; int cost[20005], f[4005], tree[20005 * 4], tmp[16][4005], ans[20005]; int x, i, n, m, p, y; void build1(int k, int l, int r) { if (x <= l && r <= y) { thing[k].push_back(i); return; } int mid = (l + r) >> 1; if (x <= mid) build1(k << 1, l, mid); if (y > mid) build1(k << 1 | 1, mid + 1, r); } void build2(int k, int l, int r) { tree[k] = 1; int mid = (l + r) >> 1; if (l == r) { query[k].push_back(i); return; } if (x <= mid) build2(k << 1, l, mid); else build2(k << 1 | 1, mid + 1, r); } void work(int k, int l, int r, int dep) { if (thing[k].size()) { memcpy(tmp[dep], f, sizeof(f)); for (int i = 0; i < thing[k].size(); i++) { int lose = d[thing[k][i]].cost, win = d[thing[k][i]].happy; for (int j = 4000; j >= lose; j--) f[j] = max(f[j], f[j - lose] + win); } } if (l == r) { for (int i = 0; i < query[k].size(); i++) ans[query[k][i]] = f[cost[query[k][i]]]; if (thing[k].size()) memcpy(f, tmp[dep], sizeof(tmp[dep])); return; } int mid = (l + r) >> 1; work(k << 1, l, mid, dep + 1); work(k << 1 | 1, mid + 1, r, dep + 1); if (thing[k].size()) memcpy(f, tmp[dep], sizeof(tmp[dep])); } int main() { scanf( %d %d , &n, &p); for (i = 1; i <= n; i++) { scanf( %d%d%d , &d[i].cost, &d[i].happy, &x); y = x + p - 1; build1(1, 1, 20000); } scanf( %d , &m); for (i = 1; i <= m; i++) { scanf( %d%d , &x, &cost[i]); build2(1, 1, 20000); } work(1, 1, 20000, 0); for (i = 1; i <= m; i++) printf( %d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T a) { return a * a; } #pragma comment(linker, /STACK:16777216 ) int n; char s[105]; string str; int main() { gets(s); str = s; n = strlen(s); for (int i = n - 1; i > 0; --i) for (int j = 0; j <= n - i; ++j) for (int k = j + 1; k <= n - i; ++k) if (str.substr(j, i) == str.substr(k, i)) { printf( %d , i); return 0; } printf( 0 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 205; int read() { int x = 0, f = 1; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (f = -f); for (x = ch ^ 48; isdigit(ch = getchar()); x = (x << 3) + (x << 1) + (ch ^ 48)) ; return x * f; } vector<int> vec[N]; int n, s, t, tim, cnt = 1, a[N], head[N], vis[N], level[N], is[20010]; struct edge { int v, w, nxt; } e[N * N]; void add(int x, int y, int w) { e[++cnt] = (edge){y, w, head[x]}; head[x] = cnt; e[++cnt] = (edge){x, 0, head[y]}; head[y] = cnt; } void init(int n) { is[1] = 1; for (int i = 2; i <= n; ++i) { if (is[i]) continue; for (int j = i + i; j <= n; j += i) is[j] = 1; } } int bfs() { queue<int> Q; Q.push(s); memset(level, 0, sizeof(level)); level[s] = 1; while (!Q.empty()) { int x = Q.front(); Q.pop(); for (int i = head[x]; i; i = e[i].nxt) { int v = e[i].v, w = e[i].w; if (w && !level[v]) level[v] = level[x] + 1, Q.push(v); } } return level[t] != 0; } int dfs(int x, int flow) { if (x == t || !flow) return flow; int up = 0; for (int i = head[x]; i; i = e[i].nxt) { int v = e[i].v, w = e[i].w; if (w && level[v] == level[x] + 1) { int tmp = dfs(v, min(flow, w)); e[i].w -= tmp, e[i ^ 1].w += tmp; flow -= tmp, up += tmp; if (!flow) break; } } if (!up) level[x] = 0; return up; } int Dinic() { int maxflow = 0; while (bfs()) maxflow += dfs(s, 2e9); return maxflow; } void find(int x) { vis[x] = 1; vec[tim].push_back(x); for (int i = head[x]; i; i = e[i].nxt) if (!vis[e[i].v] && e[i | 1].w == 1) find(e[i].v); } int main() { n = read(); s = 0; t = n + 1; init(20000); for (int i = 1; i <= n; ++i) a[i] = read(); for (int i = 1; i <= n; ++i) if (a[i] & 1) add(i, t, 2); else add(s, i, 2); for (int i = 1; i <= n; ++i) { if (a[i] & 1) continue; for (int j = 1; j <= n; ++j) if (!is[a[i] + a[j]]) add(i, j, 1); } if (Dinic() != n) return puts( Impossible ), 0; for (int i = 1; i <= n; ++i) if (!vis[i]) ++tim, find(i); printf( %d n , tim); for (int i = 1; i <= tim; ++i) { printf( %d , vec[i].size()); for (int j = 0; j < vec[i].size(); ++j) printf( %d , vec[i][j]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int const maxn = (int)1e4 + 111; int const inf = (1 << 30) - 1; int k; int a[4]; int t[4]; int d[maxn][4]; int first[maxn][4]; int main() { cin >> k; for (int i = 1; i <= 3; i++) cin >> a[i]; for (int i = 1; i <= 3; i++) cin >> t[i]; for (int j = 1; j <= 3; j++) { for (int i = 1; i <= k; i++) { int v = -1; for (int q = 1; q <= a[j]; q++) { if (v == -1 || first[q][j] < first[v][j]) { v = q; } } d[i][j] = max(d[i][j - 1], first[v][j]) + t[j]; first[v][j] = d[i][j]; } } cout << d[k][3] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, qa, qb, answer; int i, j, p, k, lcm, d; int dist[1000000]; char inq[1000000]; int gcd(int x, int y) { if ((x % y) == 0) return y; return gcd(y, x % y); } void ComputeDist() { for (i = 0; i <= lcm; i++) { dist[i] = lcm + 1; inq[i] = 0; } dist[0] = 0; queue<int> q; q.push(0); inq[0] = 1; while (q.size() > 0) { i = q.front(); q.pop(); inq[i] = 0; if (i + 1 <= lcm && (1 + dist[i] < dist[i + 1])) { dist[i + 1] = 1 + dist[i]; if (!inq[i + 1]) { q.push(i + 1); inq[i + 1] = 1; } } for (j = 2; j <= k; j++) if (i % j == 0) { for (p = 1; p < j; p++) if (i + p <= lcm && (1 + dist[i] < dist[i + p])) { dist[i + p] = 1 + dist[i]; if (!inq[i + p]) { q.push(i + p); inq[i + p] = 1; } } } } } void ComputeDist2(int end, int start) { for (i = 0; i <= start; i++) { dist[i] = start + 1; inq[i] = 0; } dist[start] = 0; queue<int> q; q.push(start); inq[start] = 1; while (q.size() > 0) { i = q.front(); q.pop(); inq[i] = 0; if (i - 1 >= end && (1 + dist[i] < dist[i - 1])) { dist[i - 1] = 1 + dist[i]; if (!inq[i - 1]) { q.push(i - 1); inq[i - 1] = 1; } } for (j = 2; j <= k; j++) if (i % j > 0) { p = i % j; if (i - p >= end && (1 + dist[i] < dist[i - p])) { dist[i - p] = 1 + dist[i]; if (!inq[i - p]) { q.push(i - p); inq[i - p] = 1; } } } } } int main() { scanf( %I64d %I64d %d , &a, &b, &k); lcm = 1; for (i = 2; i <= k; i++) { d = gcd(i, lcm); lcm *= (i / d); } ComputeDist(); qa = a / lcm; qb = b / lcm; answer = 0; if (qa > qb + 1) { answer += dist[a % lcm]; answer += dist[lcm] * (qa - qb - 1); a = (qb + 1) * lcm; } ComputeDist2(b % lcm, a - qb * lcm); answer += dist[b % lcm]; printf( %I64d n , answer); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 100005, LOG = 22; int n, fth[MaxN], poz[MaxN], fr[MaxN], w[MaxN], sz[MaxN], nrzone = 1; pair<int, int> v[MaxN]; int Find(int x) { if (!fth[x]) return x; return fth[x] = Find(fth[x]); } void Join(int x, int y) { int X = Find(x), Y = Find(y); if (X != Y) fth[X] = Y; } void Solve(int a, int b) { if (a < b) { fr[sz[Find(a)]]--; fr[sz[Find(b)]]--; nrzone--; fr[sz[Find(a)] + sz[Find(b)]]++; sz[Find(b)] += sz[Find(a)]; Join(a, b); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; ++i) { cin >> v[i].first; w[i] = v[i].first; v[i].second = i; } if (n == 1) { cout << v[1].first + 1 << n ; return 0; } sort(v + 1, v + n + 1); v[n + 1].first = v[n].first + 1; for (int i = 1; i <= n; ++i) { poz[i] = v[i].second; w[v[i].second] = i; } int maxk = 1, nrzonemax = 1; fr[1] = 1; sz[1] = 1; for (int k = 2; k < n; ++k) { int pozz = poz[k]; fr[1]++; nrzone++; sz[k] = 1; if (pozz != 1) Solve(w[pozz - 1], k); if (pozz != n) Solve(w[pozz + 1], k); if (fr[sz[Find(k)]] == nrzone && nrzone > nrzonemax) { maxk = k; nrzonemax = nrzone; } } cout << v[maxk].first + 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000006; const long long MOD = 1000000007; struct Query { int a, t, x, id; } query[MAXN]; map<int, int> cnt; int n, ans[MAXN], qcnt; void solve(int l, int r) { ; if (l != r - 1) { int mid = (l + r) >> 1; solve(l, mid); solve(mid, r); cnt.clear(); int lp = l, rp = mid; while (rp < r) { if (lp == mid || query[lp].t > query[rp].t) { if (query[rp].a == 3) { ; ans[query[rp].id] += cnt[query[rp].x]; } rp++; } else { if (query[lp].a == 1) { cnt[query[lp].x]++; } else if (query[lp].a == 2) { cnt[query[lp].x]--; } lp++; } }; sort(query + l, query + r, [&](Query q1, Query q2) { return q1.t < q2.t; }); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; cin >> n; for (int i = 0; i < n; i++) { int a, t, x; cin >> a >> t >> x; query[i] = {a, t, x, qcnt}; ; if (a == 3) { qcnt++; } } solve(0, n); for (int i = 0; i < qcnt; i++) { cout << ans[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int m; int a[1 << 7]; int min_k, max_k; bool ok(int ask) { int need = 0; for (int i = 0; i < n; i++) { if (a[i] > ask) { return false; } if (ask > a[i]) { need += ask - a[i]; } } if (need >= m) { return true; } return false; } void read(void) { cin >> n; cin >> m; for (int i = 0; i < n; i++) { cin >> a[i]; } } void solve(void) { for (int i = 0; i < n; i++) { max_k = max(max_k, a[i] + m); } for (int k = 1; k <= 10100; k++) { if (ok(k)) { min_k = k; break; } } } void print(void) { cout << min_k << << max_k << endl; } int main() { read(); solve(); print(); return 0; } |
#include <bits/stdc++.h> constexpr int Maxn = 1e5 + 7; constexpr int Mod = 1e9 + 7; int fac[Maxn], ifac[Maxn]; inline int fpm(int a, int b) { int res = 1; while (b) { if (b & 1) res = 1LL * res * a % Mod; a = 1LL * a * a % Mod; b >>= 1; } return res; } inline int C(int n, int m) { if (n < 0 || m < 0 || n < m) return 0; return 1LL * fac[n] * ifac[m] % Mod * ifac[n - m] % Mod; } std::unordered_map<int, int> cnt, mp; int n, m, k, f[Maxn], p[Maxn], s[Maxn]; int solve(int x) { if (mp.count(x)) return mp[x]; int res = 0; for (int i = 0; i <= m; ++i) res = (res + 1LL * p[i] * s[i + x] % Mod) % Mod; return mp[x] = res; } int main() { scanf( %d%d , &n, &k); fac[0] = 1; for (int i = 1; i <= n; ++i) fac[i] = 1LL * i * fac[i - 1] % Mod; ifac[n] = fpm(fac[n], Mod - 2); for (int i = n - 1; i >= 0; --i) ifac[i] = 1LL * (i + 1) * ifac[i + 1] % Mod; for (int i = 1, x; i <= n; ++i) { scanf( %d , &x); ++cnt[x]; } f[0] = k - 1; for (int i = 1; i < n; ++i) { int p = 1LL * i * fpm(n, Mod - 2) % Mod; int q = 1LL * (n - i) * fpm(n, Mod - 2) % Mod * fpm(k - 1, Mod - 2) % Mod; f[i] = (1LL * p * f[i - 1] % Mod + 1) * fpm(q, Mod - 2) % Mod; } for (int i = n; i; --i) s[i - 1] = (s[i] + f[i - 1]) % Mod; m = cnt[-1]; for (int i = 0; i <= m; ++i) p[i] = 1LL * C(m, i) * fpm(k - 1, m - i) % Mod * fpm(fpm(k, m), Mod - 2) % Mod; int res = 0, tot = k; for (auto x : cnt) if (x.first != -1) { res = (res + solve(x.second)) % Mod; --tot; } res = (res + 1LL * tot * solve(0) % Mod) % Mod; res = (res - 1LL * (k - 1) * s[0] % Mod + Mod) % Mod; printf( %d n , 1LL * res * fpm(k - 1, Mod - 2) % Mod); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { y: cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); ; ll n = 0, k = 0; cin >> n >> k; ll a = 0, b = 0; ll sum = 0; ll pos = 0; for (int i = 0; i < k; ++i) { cin >> a >> b; sum += b; pos += a * b; } if (sum < n) cout << 1 << n ; else { if (!(pos % n == (n * (n - 1)) / 2 % n)) cout << -1 << n ; else cout << 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int a, n; cin >> n >> s; for (int i = 0; i < n; ++i) { for (int j = 1; j < n + 1; ++j) { if (i + 4 * j >= n) break; if (s[i] == * && s[i + j] == * && s[i + 2 * j] == * && s[i + 3 * j] == * && s[i + 4 * j] == * ) { printf( yes n ); return 0; } } } printf( no n ); } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(m + 1, vector<int>(2, 0))); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { dp[i][j][1] = dp[i][j - 1][0] + 1; dp[i][j][0] = dp[i - 1][j][1] + 1; } int ans = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { ans += dp[i][j][0] + dp[i][j][1]; } ans -= n * m; int q; cin >> q; vector<vector<int>> a(n, vector<int>(m, 1)); auto calc_len = [&](int x, int y, int dx, int dy) { int res = 0; while (1) { x += dx; y += dy; if (x < 0 || y < 0 || x >= n || y >= m || a[x][y] == 0) { break; } res++; swap(dx, dy); } return res; }; while (q--) { int i, j; cin >> i >> j; i--, j--; { int x = calc_len(i, j, -1, 0); int y = calc_len(i, j, 0, 1); ans += (a[i][j] == 1 ? -1 : 1) * ((x + 1) * (y + 1)); } { int x = calc_len(i, j, 0, -1); int y = calc_len(i, j, 1, 0); ans += (a[i][j] == 1 ? -1 : 1) * ((x + 1) * (y + 1)); } ans += (a[i][j] == 1 ? 1 : -1); a[i][j] ^= 1; cout << ans << endl; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int T = 1; while (T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int n, k, a, ans; set<pair<int, int> > s; int x, m; bool used[1000000]; int solve(int x) { return (x + 1) / (a + 1); } void go(int x) { set<pair<int, int> >::iterator it = s.upper_bound(make_pair(x, 1000000000)); --it; pair<int, int> cur = *it; s.erase(it); ans -= solve(cur.second - cur.first + 1); if (x != cur.first) { ans += solve(x - cur.first); s.insert(make_pair(cur.first, x - 1)); } if (x != cur.second) { ans += solve(cur.second - x); s.insert(make_pair(x + 1, cur.second)); } } int main() { cin >> n >> k >> a; s.insert(make_pair(1, n)); ans = solve(n); cin >> m; for (int i = 1; i <= m; i++) { cin >> x; if (used[x]) continue; used[x] = 1; go(x); if (ans < k) { cout << i; return 0; } } cout << -1; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.