func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; const long long INF = 1e10; const int MOD = 1e9 + 7; const double EPS = 1e-7; const double PI = acos(-1.0); pair<long long, long long> p[N]; long long n, k, a[N]; int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; p[i] = {a[i], i}; } sort(p, p + n); long long ans = LLONG_MIN; for (int l = 0; l < n; l++) { for (int r = l; r < n; r++) { long long sum = 0; vector<long long> subarr(r - l + 1); for (int i = l, j = 0; i <= r; i++, j++) { subarr[j] = a[i]; sum += a[i]; } sort(subarr.begin(), subarr.end()); for (int i = 0, j = n - 1; i < min(k, r - l + 1ll); i++) { while (j >= 0 && p[j].second <= r && p[j].second >= l) { j--; } if (j >= 0) { sum = max(sum, sum - subarr[i] + p[j].first); j--; } } ans = max(ans, sum); } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int infi = 2147483600; const long long infl = 1e17; int n; pair<int, int> pbef[200005]; struct SegmentTree { private: int N; vector<long long> node; long long e; public: SegmentTree() {} SegmentTree(long long e) : e(e) {} void __init__(int sz) { N = 1; while (N < sz) N *= 2; node.resize(2 * N - 1, e); } void build(vector<long long> &v) { int sz = int(v.size()); __init__(sz); for (long long i = 0; i < (long long)sz; i++) { node[i + N - 1] = v[i]; } for (int i = N - 2; i >= 0; i--) { node[i] = (node[i * 2 + 1] + node[i * 2 + 2]); } } void update(int k, long long x) { k += N - 1; node[k] = x; while (k > 0) { k = (k - 1) / 2; node[k] = (node[2 * k + 1] + node[2 * k + 2]); } } void renew(int b, int e, long long x) { renew(b, e, 0, 0, N, x); return; } void renew(int b, int e, int k, int l, int r, long long x) { if (e <= 0 || b >= N) return; if (k > 0) { node[k] = (node[k] + node[(k - 1) / 2]); } if (r < b || e < l) return; if (b <= l && r <= e) { node[k] = min(node[k], x); return; } else if (k < N - 1) { renew(b, e, 2 * k + 1, l, (l + r) / 2, x); renew(b, e, 2 * k + 2, (l + r) / 2, r, x); return; } return; } long long get(int i) { int k = i + N - 1; long long res = node[k]; while (k > 0) { k = (k - 1) / 2; res = min(res, node[k]); } return res; } long long query(int a, int b) { return query(a, b, 0, 0, N); } long long query(int a, int b, int k, int l, int r) { if (b <= l || r <= a) return e; if (a <= l && r <= b) return node[k]; long long vl, vr; vl = query(a, b, 2 * k + 1, l, (l + r) / 2); vr = query(a, b, 2 * k + 2, (l + r) / 2, r); return (vl + vr); } void recalc() { for (long long k = 0; k < (long long)N - 1; k++) { node[2 * k + 1] = (node[2 * k * 1] + node[k]); node[2 * k + 2] = (node[2 * k * 2] + node[k]); } } long long show_one(int i) { return node[i + N - 1]; } void show() { for (long long i = 0; i < (long long)N; i++) cout << node[i] << ; cout << endl; return; } }; int main() { set<int> xapper, yapper; map<int, int> xidx, yidx; cin >> n; for (long long i = 0; i < (long long)n; i++) { int x, y; cin >> x >> y; xapper.insert(x); yapper.insert(y); pbef[i] = make_pair(x, y); } int xcnt = 0; for (auto x : xapper) { xidx[x] = xcnt; xcnt++; } int ycnt = 0; for (auto y : yapper) { yidx[y] = ycnt; ycnt++; } ycnt--; map<int, set<int>> p; for (long long i = 0; i < (long long)n; i++) { p[yidx[pbef[i].second]].insert(xidx[pbef[i].first]); } SegmentTree seg(0); seg.__init__(xcnt); long long ans = 0; int bef = 0; for (long long y = (long long)ycnt; y > (long long)-1; y--) { int cnt = 0; int nwe = 0; int bef = 0; for (auto x : p[y]) { seg.update(x, 1); } for (auto x : p[y]) { if (seg.show_one(x) == 0) { ans += (seg.query(0, x + 1) - bef) * seg.query(x, xcnt); nwe++; } else { ans += (seg.query(0, x + 1) - bef) * seg.query(x, xcnt); } bef = seg.query(0, x + 1); cnt++; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 200200; struct BIT { int a[N]; void add(int x, int v = 1) { for (; x < N; x += x & -x) { a[x] += v; } } int kth(int k) { int x = 0; for (int i = 18; i >= 0; i--) { if (x + (1 << i) < N) { int tot = a[x + (1 << i)]; if (k > tot) { k -= tot; x += (1 << i); } } } return x + 1; } }; BIT tr; pair<int, int> p[N]; pair<pair<int, int>, int> q[N]; int a[N]; int ans[N]; int main() { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; p[i].first = -a[i]; p[i].second = i; } sort(p, p + n); int m; cin >> m; for (int i = 0; i < m; i++) { cin >> q[i].first.first >> q[i].first.second; q[i].second = i; } sort(q, q + m); int x = 0; for (int i = 0; i < n; i++) { tr.add(p[i].second + 1); while (x < m && q[x].first.first == i + 1) { ans[q[x].second] = a[tr.kth(q[x].first.second) - 1]; x++; } } for (int i = 0; i < m; i++) { printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } void Ishan_Pandey() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); cout << setprecision(16) << fixed; } const long long int N = 200010; long long int parent[N], rank1[N]; void make_set(long long int v) { parent[v] = v; rank1[v] = 0; } long long int find_set(long long int v) { if (v == parent[v]) return v; return parent[v] = find_set(parent[v]); } void union_sets(long long int a, long long int b) { a = find_set(a); b = find_set(b); if (a != b) { if (rank1[a] < rank1[b]) swap(a, b); parent[b] = a; if (rank1[a] == rank1[b]) rank1[a]++; } } void solve() { long long int n; cin >> n; vector<long long int> a(n + 2, 0); for (long long int i = 1; i <= n; i++) { cin >> a[i]; } long long int ans = 0; for (long long int i = 1; i <= n; i++) a[i] = min(a[i], a[i - 1] + 1); for (long long int i = n; i >= 1; i--) a[i] = min(a[i], a[i + 1] + 1); for (long long int i = 1; i <= n; i++) ans = max(ans, a[i]); cout << ans; } int32_t main() { Ishan_Pandey(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int mostFrequent(int arr[], int n) { sort(arr, arr + n); int max_count = 1, res = arr[0], curr_count = 1; for (int i = 1; i < n; i++) { if (arr[i] == arr[i - 1]) curr_count++; else { if (curr_count > max_count) { max_count = curr_count; res = arr[i - 1]; } curr_count = 1; } } if (curr_count > max_count) { max_count = curr_count; res = arr[n - 1]; } return res; } unsigned int countDivisors(unsigned int n) { int cnt = 0; for (int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i == i) cnt++; else cnt = cnt + 2; } } return cnt; } int main() { int n, a; long long int back = 0, biceps = 0, chest = 0; cin >> n; for (int i = 1; i <= (n); ++i) { cin >> a; if (i % 3 == 0) { back += a; } else if (i % 3 == 1) { chest += a; } else if (i % 3 == 2) { biceps += a; } } long long int maxi = max(back, max(biceps, chest)); if (maxi == back) cout << back ; else if (maxi == biceps) cout << biceps ; else if (maxi == chest) cout << chest ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int N = 100005; int n, x, y, a, b, jc[N], ans; char s[2]; int ksm(int a, int k) { int ret = 1; while (k) { if (k & 1) ret = 1ll * ret * a % mod; a = 1ll * a * a % mod; k >>= 1; } return ret; } int C(int n, int m) { return 1ll * jc[n] * ksm(1ll * jc[n - m] * jc[m] % mod, mod - 2) % mod; } int main() { scanf( %d , &n); jc[0] = 1; int res = 1, fl1 = 1, fl2 = 1; for (int i = 1; i < N; ++i) jc[i] = 1ll * jc[i - 1] * i % mod; for (int i = 1; i <= n; ++i) { scanf( %s , s); if (s[0] == W ) ++x; if (s[0] == ? ) ++y; if (s[1] == B ) ++a; if (s[1] == ? ) ++b; if (s[0] == ? && s[1] == ? ) res = (res * 2) % mod; else if (s[0] == s[1]) res = 0; if (s[0] == W || s[1] == B ) fl1 = 0; if (s[1] == W || s[0] == B ) fl2 = 0; } res -= fl1; res -= fl2; for (int i = max(a, x); i <= min(x + y, a + b); ++i) (ans += 1ll * C(y, i - x) * C(b, i - a) % mod) %= mod; printf( %d , ans - res); return 0; } |
#include <bits/stdc++.h> using namespace std; long long mo(long long a) { return a % (long long)(1e9 + 7); } long long po(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y >>= 1; x = (x * x) % p; } return res % p; } vector<vector<pair<long long, long long>>> g; vector<long long> vis, col; vector<vector<long long>> ty; void dfs(long long par, long long anc = -1, long long type = -1) { if (anc == -1) { col[par] = 0; ty[col[par]].push_back(par); } else { if (type) { col[par] = !col[anc]; ty[col[par]].push_back(par); } else { col[par] = col[anc]; ty[col[par]].push_back(par); } } vis[par] = 1; for (pair<long long, long long> e : g[par]) { if (!vis[e.first]) { dfs(e.first, par, e.second); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; vector<vector<long long>> r(n, vector<long long>(2, -1)), c(n, vector<long long>(2, -1)); for (long long i = 0; i < 2; i++) { for (long long j = 0; j < n; j++) { long long x; cin >> x; x--; if (r[x][0] == -1) r[x][0] = i; else r[x][1] = i; if (c[x][0] == -1) c[x][0] = j; else c[x][1] = j; } } long long pos = 1; for (long long i = 0; i < n; i++) { if (r[i][0] == -1 || r[i][1] == -1) pos = 0; } if (!pos) { cout << -1 << n ; continue; } g.assign(n, {}); vis.assign(n, 0); col.assign(n, -1); ty.assign(2, {}); for (long long i = 0; i < n; i++) { if (r[i][0] == r[i][1] && c[i][0] != c[i][1]) { g[c[i][0]].push_back({c[i][1], 1}); g[c[i][1]].push_back({c[i][0], 1}); } if (r[i][0] != r[i][1] && c[i][0] != c[i][1]) { g[c[i][1]].push_back({c[i][0], 0}); g[c[i][0]].push_back({c[i][1], 0}); } } vector<long long> ans; for (long long i = 0; i < n; i++) { if (!vis[i]) { ty[0].clear(); ty[1].clear(); dfs(i); if (ty[0].size() > ty[1].size()) swap(ty[0], ty[1]); for (long long e : ty[0]) ans.push_back(e); } } cout << ans.size() << n ; for (long long e : ans) cout << e + 1 << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b, max_dollars, min_tokens, n_tokens; string raw_input; cin >> n >> a >> b; vector<string> tokens(n); for (int i = 0; i < n; i++) cin >> tokens[i]; for (int i = 0; i < n; i++) { n_tokens = stoll(tokens[i]); max_dollars = n_tokens * a / b; if (stoll(tokens[i]) * a % b != 0) { min_tokens = ceil((max_dollars * 1.0) * b / a); cout << n_tokens - min_tokens << ; } else { cout << 0 << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t, x, y, a, b; cin >> t; while (t--) { cin >> x >> y >> a >> b; if (2 * a < b) cout << a * (x + y) << n ; else cout << b * min(x, y) + a * abs(x - y) << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int tc; cin >> tc; while (tc--) { int n; cin >> n; string s; cin >> s; if (n == 2) { if (s[0] >= s[1]) { cout << NO << n ; } else { cout << YES << n ; cout << 2 << n ; cout << s[0] << << s[1] << n ; } } else { cout << YES << n ; cout << 2 << n ; cout << s[0] << ; for (int i = 1; i < n; i++) { cout << s[i]; } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const int maxn = 1000000 + 5; const double PI = acos(-1.0); const double E = 2.718281828459; const double eps = 1e-7; int T, n, num[100005]; int main() { long k, n = 19, x = 0, m; scanf( %ld , &k); while (k - 1 > 0) { x = 0; n++; m = n; while (m > 0) { x += m % 10; m /= 10; } if (x == 10) { k--; } } printf( %ld n , n); } |
#include <bits/stdc++.h> using namespace std; vector<int> solve(int n) { vector<int> v(n, 1); if (n == 1) return v; if (n == 2) { v[0] = 3, v[1] = 4; return v; } int k = n - 1; if (k & 1) { int p = k >> 1; v[n - 1] = p; } else { k = k - 1 + 4; int p = k >> 1; v[n - 2] = 2, v[n - 1] = p; } return v; } int main() { int n, m; while (cin >> n >> m) { vector<int> v1 = solve(n), v2 = solve(m); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) printf( %d%c , v1[i] * v2[j], j + 1 == m ? 10 : 32); } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, n, d, x, y; vector<pair<int, int> > v; cin >> n >> d >> a >> b; for (int i = 0; i < n; i++) { cin >> x >> y; v.push_back({x * a + y * b, i}); } sort(v.begin(), v.end()); long long sum = 0, in = 0; for (int i = 0; i < n; i++) { if (sum + v[i].first > d) break; sum += v[i].first; in++; } cout << in << endl; for (int i = 0; i < in - 1; i++) cout << v[i].second + 1 << ; if (in > 0) cout << v[in - 1].second + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int hy, ay, dy; int hm, am, dm; int h, a, d; bool firstok = true; bool ok(int H, int A, int D) { int d1 = max(0, A - dm); int d2 = max(0, am - D); if (d1 == 0 && d2 == 0) return false; if (d2 == 0) return true; if (d1 == 0) return false; int r1 = (int)ceil(double(hm) / d1); if (H % d2 == 0 && r1 < H / d2) return true; else if (H % d2 != 0 && r1 <= H / d2) return true; return false; } int main() { cin >> hy >> ay >> dy; cin >> hm >> am >> dm; cin >> h >> a >> d; int minm = 100000000; for (__typeof(200) i = 0; i < (200); ++i) for (__typeof(200) j = 0; j < (200); ++j) { int A = ay + i; int D = dy + j; int k1 = max(0, A - dm); int k2 = max(0, am - D); if (k1 == 0) continue; if (k2 == 0) { minm = min(minm, i * a + j * d); continue; } int t = (int)ceil((double)hm / k1); int k = t * k2 - hy + 1; k = max(0, k); minm = min(minm, i * a + j * d + k * h); } cout << minm << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n * 2], b[n * 2]; for (int i = 0; i < (n); ++i) { cin >> a[i] >> b[i]; a[i + n] = a[i]; b[i + n] = b[i]; } int flag = 1; if (n % 2 == 1) flag = 0; for (int i = 0; i < (n); ++i) { int x = a[i + 1] - a[i]; int y = b[i + 1] - b[i]; if (a[i + n / 2 + 1] - a[i + n / 2] != -x) flag = 0; if (b[i + n / 2 + 1] - b[i + n / 2] != -y) flag = 0; } if (flag) { puts( YES ); } else { puts( NO ); }; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t, n; cin >> n; if (n == 0) cout << 1 << endl; else if (n % 4 == 1) cout << 8 << endl; else if (n % 4 == 2) cout << 4 << endl; else if (n % 4 == 3) cout << 2 << endl; else cout << 6 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int LIS(vector<int> A) { int N = A.size(), i; multiset<int> s; multiset<int>::iterator k; for (i = 0; i < N; i++) { s.insert(A[i]); if (1) { k = s.find(A[i]); k++; if (k != s.end()) s.erase(k); } } return s.size(); } int main() { int n; cin >> n; string s; cin >> s; for (int i = 1; i < n; i++) { for (int j = 0; j + 4 * i < n; j++) { if (s[j] != * ) continue; if (s[j + i] == s[j] && s[j + 2 * i] == s[j] && s[j + 3 * i] == s[j] && s[j + 4 * i] == s[j]) { cout << yes ; return 0; } } } cout << no ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int current = 1, maxtotal = 0; for (int i = 0; i < n; i++) { current = 1; for (int j = i; j < n - 1 && a[j] >= a[j + 1]; j++, current++) ; for (int j = i; j > 0 && a[j] >= a[j - 1]; j--, current++) ; if (current > maxtotal) { maxtotal = current; } } cout << maxtotal; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxx = 1e5 + 20; long long a[maxx]; int main() { int n, i; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int r; while (a[0] % 2 == 0) a[0] /= 2; while (a[0] % 3 == 0) a[0] /= 3; r = a[0]; for (i = 1; i < n; i++) { while (a[i] % 2 == 0) a[i] /= 2; while (a[i] % 3 == 0) a[i] /= 3; if (a[i] != r) { cout << No ; return 0; } } cout << Yes ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct CC { long long x1, x2, y1, y2; }; CC jiao(CC a, CC b) { CC c1; c1.x1 = max(a.x1, b.x1); c1.y1 = max(a.y1, b.y1); c1.x2 = min(a.x2, b.x2); c1.y2 = min(a.y2, b.y2); return c1; } int main() { CC w, b1, b2; cin >> w.x1 >> w.y1 >> w.x2 >> w.y2 >> b1.x1 >> b1.y1 >> b1.x2 >> b1.y2 >> b2.x1 >> b2.y1 >> b2.x2 >> b2.y2; CC j1 = jiao(w, b1); CC j2 = jiao(w, b2); CC j3 = jiao(j1, j2); long long s, s1, s2, s3; s = (w.x2 - w.x1) * (w.y2 - w.y1); if (j1.x1 > j1.x2 || j1.y1 > j1.y2) s1 = 0; else s1 = (j1.x2 - j1.x1) * (j1.y2 - j1.y1); if (j2.x1 > j2.x2 || j2.y1 > j2.y2) s2 = 0; else s2 = (j2.x2 - j2.x1) * (j2.y2 - j2.y1); if (j3.x1 > j3.x2 || j3.y1 > j3.y2) s3 = 0; else s3 = (j3.x2 - j3.x1) * (j3.y2 - j3.y1); if (s1 + s2 - s3 == s) cout << NO << endl; else cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[22], b[22], d[22][44], mat[44][44], res[44][44], t[44][44]; void calc(int x[44][44], int y[44][44], int z[44][44]) { for (int i = 0; i <= 2 * n; ++i) for (int j = 0; j <= 2 * n; ++j) { t[i][j] = (int)(2e9); for (int k = 0; k <= 2 * n; ++k) { if (x[i][k] != (int)(2e9) && y[k][j] != (int)(2e9)) t[i][j] = min(t[i][j], x[i][k] + y[k][j]); } } for (int i = 0; i <= 2 * n; ++i) for (int j = 0; j <= 2 * n; ++j) { z[i][j] = t[i][j]; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) cin >> b[i]; for (int start = 0; start <= 2 * n; ++start) { for (int i = 0; i <= n; ++i) for (int j = 0; j <= 2 * n; ++j) d[i][j] = (int)(2e9); d[0][start] = 0; for (int i = 0; i < n; ++i) for (int j = 0; j <= 2 * n; ++j) { if (d[i][j] != (int)(2e9)) { if (j > 0) d[i + 1][j - 1] = min(d[i + 1][j - 1], d[i][j] + b[i]); if (j < 2 * n) d[i + 1][j + 1] = min(d[i + 1][j + 1], d[i][j] + a[i]); } } for (int j = 0; j <= 2 * n; ++j) mat[start][j] = d[n][j]; } for (int i = 0; i <= 2 * n; ++i) for (int j = 0; j <= 2 * n; ++j) res[i][j] = (int)(2e9); res[0][0] = 0; while (m) { if (m & 1) calc(res, mat, res); calc(mat, mat, mat); m >>= 1; } cout << res[0][0]; } |
#include <bits/stdc++.h> const int Inf = 2e9; long long LINF = (long long)4e18; using namespace std; int r1, r2, c1, c2, d1, d2; bool ok(int i, int j, int k, int l) { if (i + j != r1) return false; if (k + l != r2) return false; if (i + k != c1) return false; if (j + l != c2) return false; if (i + l != d1) return false; if (j + k != d2) return false; return true; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2; for (int i = 1; i <= 9; i++) { for (int j = 1; j <= 9; j++) { for (int k = 1; k <= 9; k++) { for (int l = 1; l <= 9; l++) { if (i == j) continue; if (i == k) continue; if (i == l) continue; if (j == k) continue; if (j == l) continue; if (k == l) continue; if (!ok(i, j, k, l)) continue; cout << i << << j << n ; cout << k << << l << n ; return 0; } } } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 22; int n; int col[Maxn]; int main() { scanf( %d , &n); int cur = 0; for (int a = 0; cur < n; a++) { bool good = true; for (int i = 0; i < cur && good; i++) for (int j = i + 1; j < cur && good; j++) for (int l = 0; l < cur && good; l++) if (i != l && j != l) good = a != col[i] + col[j] - col[l]; if (good) col[cur++] = a; } for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) printf( %d%c , i == j ? 0 : col[i] + col[j], j + 1 < n ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long t, n, k, z, x, s, a[31], v[31][101], c[31]; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); ; cin >> t; for (int zxc = 1; zxc <= t; zxc++) { cin >> n >> k; for (int i = 1; i <= 30; i++) for (int j = 1; j <= 100; j++) v[i][j] = 0; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { long long z = a[i]; long long x = 0; while (z != 0) { x++; v[i][x] = z % k; z /= k; } } int ff = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= 100; j++) { if (v[i][j] > 1) { ff = 1; break; } } if (ff == 1) break; } if (ff == 1) cout << NO << n ; else { for (int j = 1; j <= 100; j++) { long long x = 0; for (int i = 1; i <= n; i++) if (v[i][j] == 1) x++; if (x > 1) { ff = 1; break; } } if (ff == 1) cout << NO << n ; else cout << YES << n ; } } } |
#include <bits/stdc++.h> using namespace std; int get(int xt) { int ans = 0; for (int i = 0; i < 8; i++) { ans *= 2; ans += xt % 2; xt /= 2; } return ans; } int main() { char a[110] = ; gets(a); int len = strlen(a); int xt = 0; for (int i = 0; i < len; i++) { int tmp = a[i]; tmp = get(tmp); if (i != len) cout << (xt - tmp + 256) % 256 << endl; else cout << (xt - tmp + 256) % 256; xt = tmp; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 7; int dp[N][N]; int cnt[N * N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int a[n]; memset(dp, 0, sizeof(dp)); memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < n; i++) cin >> a[i]; int ini = 0; for (int i = 1; i < n; i++) { for (int j = 0; j < n; j++) dp[i][j] = dp[i - 1][j]; for (int j = 0; j < n; j++) { if (a[i] > j) dp[i][j]++; } for (int j = 0; j < i; j++) { if (a[j] > a[i]) ini++; } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int val = dp[i][a[i]] + dp[j][a[j]] - dp[i][a[j]] - dp[j][a[i]]; val = ini - 2 * val - 1; cnt[val]++; } } for (int i = 0; i < N * N; i++) { if (cnt[i]) { cout << i << << cnt[i] << endl; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int query(vector<int>& v) { cout << ? ; for (auto& x : v) { cout << x << ; } cout << endl; int a; cin >> a; return a; } void solve(int n) { int x = 1; vector<int> v(n, 1); for (int i = n; i >= 2; i--) { for (int j = 0; j < n - 1; j++) { v[j] = i; } int a = query(v); if (a == 0) continue; x = i; break; } vector<int> ans(n, -1); ans[n - 1] = x; for (int i = 0; i < n; i++) { v[i] = x; } for (int i = 1; i <= n; i++) { if (i == x) continue; v[n - 1] = i; int index = query(v); ans[index - 1] = i; } cout << ! ; for (auto& y : ans) { cout << y << ; } cout << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) { int n; cin >> n; solve(n); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1010; int n, m, maxw, tot, w[maxn], b[maxn], fa[maxn], sumw[maxn], sumb[maxn], dp[maxn << 1][maxn], f[maxn]; vector<int> child[maxn]; vector<pair<int, int> > vec; unordered_set<int> ancestor; void init() { for (int i = 1; i <= n; i++) { fa[i] = i; sumw[i] = w[i]; sumb[i] = b[i]; } } int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } void unite(int x, int y) { x = find(x), y = find(y); if (x == y) return; fa[x] = y; sumw[y] += sumw[x]; sumb[y] += sumb[x]; } int main() { scanf( %d %d %d , &n, &m, &maxw); for (int i = 1; i <= n; i++) { scanf( %d , &w[i]); } for (int i = 1; i <= n; i++) { scanf( %d , &b[i]); } init(); while (m--) { int x, y; scanf( %d %d , &x, &y); unite(x, y); } for (int i = 1; i <= n; i++) { child[find(i)].push_back(i); ancestor.insert(find(i)); } for (int x : ancestor) { int last = tot; for (int y : child[x]) { tot++; for (int z = 0; z <= maxw; z++) { dp[tot][z] = f[z]; if (z >= w[y]) { dp[tot][z] = max(dp[tot][z], f[z - w[y]] + b[y]); } } } tot++; for (int y = 0; y <= maxw; y++) { dp[tot][y] = f[y]; if (y >= sumw[x]) { dp[tot][y] = max(dp[tot][y], f[y - sumw[x]] + sumb[x]); } } for (int y = last + 1; y <= tot; y++) { for (int z = 0; z <= maxw; z++) { f[z] = max(f[z], dp[y][z]); } } } printf( %d n , *max_element(f, f + maxw + 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; long long a[N], n; int to_sorted[N]; int to_nature[N]; bool done(int i, int d) { bool lef = (i == 0 || a[i - 1] < a[i] - d); bool rig = (i == n - 1 || a[i] + d < a[i + 1]); return lef && rig; } int front(int, int); int back(int, int); int front(int i, int d) { if (done(i, d)) { return i; } int id = upper_bound(a, a + n, a[i] + d) - a - 1; long long rot = 2 * abs(a[i] - a[id]); bool safe = (i == 0 || a[i - 1] < a[i] - (d - rot)); if (safe && d >= rot) { return front(i, d % rot); } return back(id, d - abs(a[i] - a[id])); } int back(int i, int d) { if (done(i, d)) { return i; } int id = lower_bound(a, a + n, a[i] - d) - a; long long rot = 2 * abs(a[i] - a[id]); bool safe = (i == n - 1 || a[i] + d - rot < a[i + 1]); if (safe && d >= rot) { return back(i, d % rot); } return front(id, d - abs(a[i] - a[id])); } int main() { int m; scanf( %d %d , &n, &m); vector<pair<int, int>> p; for (int i = 0; i < n; i++) { scanf( %I64d , a + i); p.emplace_back(a[i], i); } sort(a, a + n); sort(p.begin(), p.end()); for (int i = 0; i < n; i++) { to_sorted[p[i].second] = i; to_nature[i] = p[i].second; } while (m--) { int id, l; scanf( %d %d , &id, &l); id = to_sorted[id - 1]; printf( %d n , to_nature[front(id, l)] + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, viz[100005], cnt, nr, x[100005], nrans, ans[400005], rad; vector<int> v[100005]; void dfs1(int nod) { viz[nod] = 1; nr += x[nod]; for (auto x : v[nod]) if (!viz[x]) dfs1(x); } void dfs(int nod, int tata) { viz[nod] = 1; nrans++; ans[nrans] = nod; x[nod] = 1 - x[nod]; for (auto xx : v[nod]) if (!viz[xx]) { dfs(xx, nod); nrans++; ans[nrans] = nod; x[nod] = 1 - x[nod]; } if ((x[nod] % 2) && (nod != rad)) { nrans++; ans[nrans] = tata; nrans++; ans[nrans] = nod; x[nod] = 1 - x[nod]; x[tata] = 1 - x[tata]; } } int main() { int i, xx, y; cin >> n >> m; for (i = 1; i <= m; i++) { cin >> xx >> y; v[xx].push_back(y); v[y].push_back(xx); } for (i = 1; i <= n; i++) cin >> x[i]; for (i = 1; i <= n; i++) if (!viz[i]) { nr = 0; dfs1(i); if (nr % 2) cnt++; if (cnt > 1) { cout << -1; return 0; } } for (i = 1; i <= n; i++) viz[i] = 0; for (i = 1; i <= n; i++) if (x[i] % 2) { rad = i; break; } if (!rad) rad = 1; dfs(rad, 0); if (x[rad] % 2) nrans--; cout << nrans << n ; for (i = 1; i <= nrans; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, m, n, a[1000], b[1000], t = -1; cin >> n >> m; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < m; i++) { cin >> b[i]; } sort(a, a + n); sort(b, b + m); for (i = a[n - 1]; i < b[0]; i++) { if ((2 * a[0]) <= i) { t = i; break; } } cout << t; return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t = 1; while (t--) { long long int n = 0, m = 0, k = 0, i = 0, j = 0, p = 0, q = 0, x = 0, y = 0, z = 0, ans = 0, cnt = 0, l = 0, r = 0, mid = 0, lo = 0, hi = 0; string s; bool flag = false; cin >> n; long long int a[n + 1]; for (i = 1; i <= n; i++) cin >> a[i]; long long int dp[n + 1][n + 1][2]; long long int even = n / 2; long long int odd = (n % 2 == 0) ? n / 2 : (n / 2) + 1; for (i = 0; i <= n; i++) for (j = 0; j <= n; j++) for (k = 0; k < 2; k++) dp[i][j][k] = 1000000007; dp[0][0][0] = 0; dp[0][0][1] = 0; for (i = 1; i <= n; i++) if (a[i] == 0) for (j = 0; j <= even; j++) if (j > i || (i - j) > odd) continue; else dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j - 1][0]), dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j - 1][1] + 1), dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j][1]), dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j][0] + 1); else for (j = 0; j <= even; j++) { if (j > i || (i - j) > odd) continue; if (a[i] % 2 == 0) dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j - 1][0]), dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j - 1][1] + 1); else dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j][1]), dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j][0] + 1); } ans = 1000000007; for (j = 0; j <= even; j++) ans = min(ans, dp[n][j][0]), ans = min(ans, dp[n][j][1]); cout << ans << endl; ; } return 0; } |
#include <bits/stdc++.h> int t, s, x; int main() { scanf( %d%d%d , &t, &s, &x); if (x == t) { printf( YES n ); return 0; } for (int i = 1; i * s + t <= x; i++) if (i * s + t == x || i * s + t + 1 == x) { printf( YES n ); return 0; } printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 3042, mod = 1000000007; const int modHash = 2013023017; inline void add_mod(long long& a, long long b) { a = (a + b) % mod; } inline void mult_mod(long long& a, long long b) { a = a * b % mod; } long long dp[maxN][maxN], pref[maxN]; unordered_set<long long> S[maxN]; bool fld[42]; int in[maxN]; int main() { fld[12] = fld[10] = fld[7] = fld[15] = true; int n; scanf( %d , &n); for (int i = 1; i < (n + 1); i++) scanf( %d , in + i); for (int i = 1; i < (n + 1); i++) { int mask = 0; long long H[10]; H[3] = H[5] = 0; dp[i][i - 1] = 1; for (int j = i; j < (n + 1); j++) { H[3] = (H[3] * 3 + in[j] + 1) % modHash; H[5] = (H[5] * 5 + in[j] + 1) % modHash; mask >>= 1; mask |= in[j] << 3; int len = j - i + 1; dp[i][j] = (len >= 4 and !fld[mask]) ? dp[i][j - 4] : 0; for (int k = 1; k < (min(4, len + 1)); k++) dp[i][j] += dp[i][j - k]; dp[i][j] %= mod; long long M = H[3] << 32 | H[5]; if ((S[len].insert(M)).second) pref[j] += dp[i][j]; } } long long sum = 0; for (int i = 1; i < (n + 1); i++) { add_mod(sum, pref[i]); printf( %lld n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; char ch[n + 1]; cin >> ch; int ar[200] = {0}; for (int i = 0; i < strlen(ch); i++) { ar[ch[i]]++; } sort(ar, ar + 200); if (ar[199] > k) cout << NO << endl; else cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 300000; int arr[MX], state[MX], n, m, meet[MX], cur, is[MX], lastoff[MX]; int pres[MX]; pair<int, int> last; vector<pair<int, int> > v[MX]; vector<int> ans; char cc; int main() { memset(meet, -1, sizeof(meet)); memset(is, 0, sizeof(is)); scanf( %d %d , &n, &m); for (int j = 1; j <= m; j++) { cin >> cc >> arr[j]; if (cc == + ) state[j] = 1; else state[j] = 0; if (meet[arr[j]] == -1) meet[arr[j]] = state[j]; v[arr[j]].push_back(make_pair(j, state[j])); } for (int j = 1; j <= n; j++) { lastoff[j] = m * 10; if (meet[j] == -1) ans.push_back(j); if (meet[j] == 0) { cur++; is[j] = 1; } } if (state[1] == 1 && cur == 0) is[arr[1]] = 1; for (int j = 1; j <= m; j++) { if (state[j] == 0) cur--; else cur++; pres[j] = cur; } for (int j = 1; j <= m; j++) { if (!is[arr[j]]) continue; if (state[j] == 0) { if (pres[j] > 0) { is[arr[j]] = 0; } lastoff[arr[j]] = j; } } int ret; for (int j = 1; j <= n; j++) { if (!is[j]) continue; ret = 1; int szo = v[j].size(); for (int i = 0; i < szo; i++) { if (v[j][i].second == 1 && i) { if (v[j][i].first != v[j][i - 1].first + 1) ret = 0; } last = v[j][i]; } if (last.second == 0 && last.first < m) ret = 0; is[j] &= ret; if (is[j]) ans.push_back(j); } sort(ans.begin(), ans.end()); cout << ans.size() << endl; for (int j = 0; j < ans.size(); j++) printf( %d , ans[j]); } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e5 + 50; const int maxn = 1e7 + 50; const int inf = 0x3f3f3f3f; unordered_map<int, bool> mp; vector<int> vec; int main() { int T; scanf( %d , &T); while (T--) { mp.clear(); vec.clear(); int n, t; scanf( %d , &n); vec.push_back(0); for (int i = 1; i * i <= n; i++) { t = n / i; if (!mp.count(t)) { mp[t] = 1; vec.push_back(t); if (n / t == i) { if (!mp.count(i)) { mp[i] = 1; vec.push_back(i); } } } } sort(vec.begin(), vec.end()); printf( %d n , vec.size()); for (int i = 0; i < vec.size(); i++) printf( %d , vec[i]); putchar(10); } } |
#include <bits/stdc++.h> using namespace std; int main() { double ans, B, H; cin >> ans; double ff = 999999999.9; for (double h = 1; h <= 10; h++) { for (double b = 1; b <= 10; b++) { double sum = h * b / sqrt(4 * h * h + b * b); double d = fabs(ans - sum); if (d < ff) { ff = d; B = b; H = h; } } } cout << B << << H << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long l, r; cin >> l >> r; long long x = r, y = 0; while (x > 0) { ++y; x /= 10; } x = 5; long long k = y; for (int i = 0; i < k - 1; ++i) { x *= 10; } if (r < x) x = r; else if (l > x) x = l; k = x; vector<long long> ans; while (k > 0) { ans.push_back(k % 10); k /= 10; } reverse(ans.begin(), ans.end()); y = 0; for (auto& i : ans) { y *= 10; y += 9 - i; } cout << x * y; return 0; } |
#include <bits/stdc++.h> using namespace std; typedef struct { int y, i; double p; } ele; int cmp(ele a, ele b) { return a.y > b.y || (a.y == b.y && a.i > b.i); } vector<ele> pu[100514]; int a[100514]; double dp[5140][5140]; int mp[5140]; vector<int> e[5140]; ele sk[5140]; int top; void sol() { int n, q; scanf( %d %d , &n, &q); for (int i = 0; i < n; i++) { scanf( %d , a + i); } pu[0].push_back((ele){n - 1, q, 0}); for (int i = 0; i < q; i++) { int x, y; double p; scanf( %d %d %lf , &x, &y, &p); pu[x - 1].push_back((ele){y - 1, i, p}); } for (int i = 0; i <= q; i++) mp[i] = -7122; top = 0; for (int i = 0; i < n; i++) { sort(pu[i].begin(), pu[i].end(), cmp); for (int j = 0; j < (int)pu[i].size(); j++) { sk[top++] = pu[i][j]; } mp[sk[top - 1].i] = max(mp[sk[top - 1].i], a[i]); for (; top && sk[top - 1].y == i; top--) { int t = sk[top - 1].i; double p = sk[top - 1].p; for (int j = 0; j < (int)e[t].size(); j++) { mp[t] = max(mp[t], mp[e[t][j]]); } for (int k = 0; k <= q + 1; k++) { dp[t][k] = 1; for (int j = 0; j < (int)e[t].size(); j++) { int nk = mp[t] + k - mp[e[t][j]]; if (q + 1 >= nk) { dp[t][k] *= dp[e[t][j]][nk]; } } } for (int k = q + 1; k >= 1; k--) { dp[t][k] = dp[t][k] * (1 - p) + dp[t][k - 1] * p; } dp[t][0] = dp[t][0] * (1 - p); if (top >= 2) e[sk[top - 2].i].push_back(t); } pu[i].clear(); } double ans = mp[q]; for (int i = 1; i <= q + 1; i++) { ans += (dp[q][i] - dp[q][i - 1]) * i; } printf( %.10f n , ans); for (int i = 0; i <= q; i++) e[i].clear(); } int main() { while (1) { sol(); break; } return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[50004][8]; int main() { int m, n; cin >> m >> n; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) cin >> dp[i][j]; } for (int i = 1; i <= m; i++) dp[i][1] += dp[i - 1][1]; for (int i = 1; i <= n; i++) dp[1][i] += dp[1][i - 1]; for (int i = 2; i <= m; i++) { for (int j = 2; j <= n; j++) { if (dp[i - 1][j] >= dp[i][j - 1]) dp[i][j] += dp[i - 1][j]; else dp[i][j] += dp[i][j - 1]; } } for (int i = 1; i <= m; i++) cout << dp[i][n] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y; int p = 1; cin >> n; cin >> x; cin >> y; p = n * y; if (p % 100 != 0) p = p / 100 + 1; else p = p / 100; if (p <= x) cout << 0 << endl; else cout << p - x << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[9] = {0, 1, -1, 0, 0, -1, -1, 1, 1}; const int dy[9] = {0, 0, 0, -1, 1, -1, 1, -1, 1}; const double pi = acos(-1.0); const int N = 1e5 + 100; long long pre[N], a[N], temp[200], ans = 0; int n, k, ma = 0; map<long long, long long> dic; int main() { scanf( %d , &n), scanf( %d , &k); long long t = 1; temp[0] = 1; if (k == 1 || k == -1) { if (k == 1) { ma = 0; temp[0] = 1; } else { ma = 1; temp[0] = 1; temp[1] = -1; } } else { while (abs(t * k) < 1e15) { ma++; t = t * k; temp[ma] = t; } } for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); for (int i = 0; i <= ma; i++) dic[temp[i] + 0]++; for (int i = 1; i <= n; i++) { pre[i] = pre[i - 1] + a[i]; ans += dic[pre[i]]; for (int j = 0; j <= ma; j++) dic[pre[i] + temp[j]]++; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void smin(int &a, const int &b) { if (b < a) a = b; } inline void smax(int &a, const int &b) { if (b > a) a = b; } int first[4], second[4], f[4], ans; vector<int> dst, vx, vy; pair<int, int> p[4], mp[4]; inline void solve(int X, int Y, int d) { p[0] = pair<int, int>(X, Y), p[1] = pair<int, int>(X, Y + d), X += d; p[2] = pair<int, int>(X, Y), p[3] = pair<int, int>(X, Y + d); for (int i = 4; i--;) f[i] = i; do { int mx = 0; for (int i = 4; i--;) { if (first[i] == p[f[i]].first) smax(mx, abs(second[i] - p[f[i]].second)); else if (second[i] == p[f[i]].second) smax(mx, abs(first[i] - p[f[i]].first)); else mx = 0x3f3f3f3f; } if (mx < ans) { ans = mx; for (int i = 4; i--;) mp[i] = p[f[i]]; } } while (next_permutation(f, f + 4)); } inline void solve(int d) { vx.clear(), vy.clear(); for (int i = 4; i--;) { vx.push_back(first[i] - d), vx.push_back(first[i]), vx.push_back(first[i] + d); vy.push_back(second[i] - d), vy.push_back(second[i]), vy.push_back(second[i] + d); for (int j = i; j--;) { int xmn = min(first[i], first[j]), xmx = max(first[i], first[j]); int ymn = min(second[i], second[j]), ymx = max(second[i], second[j]); for (int k = 4; k--;) if (k != i && k != j) { smin(xmn, first[k] - d), smax(xmx, first[k] - d); smin(ymn, second[k] - d), smax(ymx, second[k] - d); } vx.push_back(xmn + xmx >> 1), vy.push_back(ymn + ymx >> 1); } } for (int first : vx) for (int second : vy) solve(first, second, d); } int main() { int t; scanf( %d , &t); while (t--) { dst.clear(); for (int i = 0; i < 4; i++) { scanf( %d %d , first + i, second + i); for (int j = 0; j < i; j++) { dst.push_back(abs(first[i] - first[j])); dst.push_back(abs(second[i] - second[j])); } } sort(dst.begin(), dst.end()); dst.resize(unique(dst.begin(), dst.end()) - dst.begin()); ans = 0x3f3f3f3f; for (int first : dst) solve(first); if (ans < 0x3f3f3f3f) { printf( %d n , ans); for (int i = 0; i < 4; i++) printf( %d %d n , mp[i].first, mp[i].second); } else puts( -1 ); } } |
#include <bits/stdc++.h> using namespace std; bool isprime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } vector<long long int> prime; void sieve(long long int n) { bool bakh[n + 1]; memset(bakh, true, sizeof(bakh)); for (long long int p = 2; p * p <= n; p++) { if (bakh[p] == true) { for (long long int i = p * p; i <= n; i += p) bakh[i] = false; } } for (long long int p = 2; p <= n; p++) if (bakh[p]) prime.push_back(p); } long long int eulertotient(long long int z) { long long int fac = z; for (long long int i = 0; prime[i] * prime[i] <= z; i++) { if (z % prime[i] == 0) { fac -= (fac / prime[i]); while (z % prime[i] == 0) z /= prime[i]; } } if (z > 1) fac -= (fac / z); return fac; } long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } long long int lcm(long long int a, long long int b) { long long int g = gcd(a, b); long long int ans = (a * b) / g; return ans; } long long int modInverse(long long int a, long long int m) { long long int hvf = gcd(a, m); if (hvf == 1) return power(a, m - 2, m); return -1; } void multiply(long long int F[2][2], long long int M[2][2]) { long long int x = F[0][0] * M[0][0] + F[0][1] * M[1][0]; long long int y = F[0][0] * M[0][1] + F[0][1] * M[1][1]; long long int z = F[1][0] * M[0][0] + F[1][1] * M[1][0]; long long int w = F[1][0] * M[0][1] + F[1][1] * M[1][1]; F[0][0] = x; F[0][1] = y; F[1][0] = z; F[1][1] = w; } void powermat(long long int F[2][2], long long int n) { if (n == 0 || n == 1) return; long long int M[2][2] = {{1, 1}, {1, 0}}; powermat(F, n / 2); multiply(F, F); if (n % 2 != 0) multiply(F, M); } long long int fib(long long int n) { long long int F[2][2] = {{1, 1}, {1, 0}}; if (n == 0) return 0; powermat(F, n - 1); return F[0][0]; } vector<long long int> merge(vector<long long int> v1, vector<long long int> v2) { vector<long long int> temp; long long int i = 0, j = 0; while (i < v1.size() && j < v2.size()) { if (v1[i] < v2[j]) temp.push_back(v1[i]), i++; else temp.push_back(v2[j]), j++; } while (i < v1.size()) temp.push_back(v1[i]), i++; while (j < v2.size()) temp.push_back(v2[j]), j++; return temp; } long long int n, m; vector<long long int> mark; vector<long long int> top; vector<pair<long long int, long long int> > adj[100005]; void dfs(long long int u) { mark[u] = 1; for (auto v : adj[u]) { if (!mark[v.first]) dfs(v.first); } top.push_back(u); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int a, b; cin >> n >> m; for (long long int i = 1; i <= m; i++) cin >> a >> b, adj[a].push_back({b, i}); mark.clear(); mark.resize(n + 1, 0); for (long long int i = 1; i <= n; i++) { if (!mark[i]) dfs(i); } bool flag; long long int ans = 0; for (long long int i = n - 1; i > 0; i--) { long long int u = top[i], v = top[i - 1]; flag = 0; for (auto e : adj[u]) { if (e.first == v) { ans = max(ans, e.second); flag = 1; break; } } if (!flag) return cout << -1 << endl, 0; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; long long int fast_expo(long long int x, long long int p) { if (p == 0) return 1; else if (p % 2 == 0) { long long int t = fast_expo(x, p / 2) % 1000000007; return (t * t) % 1000000007; } else return (x * (fast_expo(x, p - 1)) % 1000000007) % 1000000007; } int main() { int q; cin >> q; while (q--) { int n; cin >> n; int a[n]; int i, c = 1, c1 = 1, ind; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) ind = i; } i = ind; while (c != n) { if (a[i] == c) { c++; if (i == n - 1) i = 0; else i++; } else break; } i = ind; while (c1 != n) { if (a[i] == c1) { c1++; if (i == 0) i = n - 1; else i--; } else break; } if (c == n || c1 == n) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const long long _INF = 0x7ffffffffffffffll; const double EPS = 1e-9; const double PI = acos(-1.0); template <class T, class INT> inline T pow(T x, INT y) { T res(1); for (T tt(x); y; y /= 2) { if (y & 1) res *= tt; tt *= tt; } return res; } template <class T, class INT> inline T pow(T x, INT y, T p) { T res(1); for (T tt(x); y; y /= 2) { if (y & 1) res = res * tt % p; tt = tt * tt % p; } return res; } int toInt(string s) { int x = 0; istringstream sin(s); sin >> x; return x; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template <class INT> inline INT gcd(INT x, INT y) { return y ? gcd(y, x % y) : x; } template <class INT> inline int calc_bits(INT x) { return x ? (x & 1) + calc_bits(x >> 1) : 0; } const int MAXD = 80000 + 10; const int MAXM = 200 + 1; int tmp, sumx, sumy, cnt, n; vector<pair<int, int> > a; bool check[MAXD]; struct Graph { int head[MAXM], next[MAXD], vis[MAXD], tot; inline void add(int u, int v) { next[++tot] = head[u]; vis[head[u] = tot] = v; } } x, y; inline int abs(pair<int, int> a) { return ((a.first) * (a.first)) + ((a.second) * (a.second)); } inline bool cmp(pair<int, int> a, pair<int, int> b) { return atan2(a.second, a.first) < atan2(b.second, b.first) - EPS; } inline bool _cmp(pair<int, int> a, pair<int, int> b) { return abs(a) < abs(b); } int main(int argc, char* argv[]) { for (int i = 0; i < (MAXM); ++i) for (int j = 0; j < (MAXM); ++j) { tmp = abs(pair<int, int>(i, j)); if (!check[tmp]) check[tmp] = true, a.push_back(pair<int, int>(i, j)); } cin >> n; sort((a).begin(), (a).end(), _cmp); for (int i = 0; i < (n + 1); ++i) sumx += a[i].first, sumy += a[i].second; if (sumx + sumy & 1) { sumx += a[n + 1].first, sumy += a[n + 1].second; for (int i = (n); i > (0); --i) if (!(sumx - a[i].first & 1) && !(sumy - a[i].second & 1)) { swap(a[i], a[n + 1]); break; } } else if (sumx & 1) for (int i = (1); i < (n + 1); ++i) if (a[i].first + a[i].second & 1) { swap(a[i].first, a[i].second); break; } for (int i = (1); i < (n + 1); ++i) x.add(a[i].first, i), y.add(a[i].second, i); for (int i = (200); i > (0); --i) for (int j = x.head[i]; j; j = x.next[j]) if (cnt > 0) a[x.vis[j]].first = -a[x.vis[j]].first, cnt -= i; else cnt += i; for (int i = (200); i > (0); --i) for (int j = y.head[i]; j; j = y.next[j]) if (cnt > 0) a[y.vis[j]].second = -a[y.vis[j]].second, cnt -= i; else cnt += i; sort(a.begin() + 1, a.begin() + n + 1, cmp); sumx = sumy = 0; cout << YES << endl; for (int i = (1); i < (n + 1); ++i) { cout << sumx << << sumy << endl; sumx += a[i].first, sumy += a[i].second; } } |
#include <bits/stdc++.h> using namespace std; const long long int is_query = LLONG_MIN; struct Line { long long int m, b; mutable function<const Line*()> succ; bool operator<(const Line& rhs) const { if (rhs.b != is_query) return m < rhs.m; const Line* s = succ(); if (!s) return 0; long long int x = rhs.m; return b - s->b < (s->m - m) * x; } }; struct HullDynamic : public multiset<Line> { bool bad(iterator y) { auto z = next(y); if (y == begin()) { if (z == end()) return 0; return y->m == z->m && y->b <= z->b; } auto x = prev(y); if (z == end()) return y->m == x->m && y->b <= x->b; return 1.0 * (x->b - y->b) * (z->m - y->m) > 1.0 * (y->b - z->b) * (y->m - x->m); } void Add(long long int m, long long int b) { auto y = insert({m, b}); y->succ = [=] { return next(y) == end() ? 0 : &*next(y); }; if (bad(y)) { erase(y); return; } while (next(y) != end() && bad(next(y))) erase(next(y)); while (y != begin() && bad(prev(y))) erase(prev(y)); } long long int Query(long long int x) { auto l = lower_bound((Line){x, is_query}); if (l == end()) return LLONG_MIN; return l->m * x + l->b; } }; HullDynamic Tree[4 * 300005]; long long int query(int node, int lo, int hi, int i, int j, long long int x) { if (i > hi || j < lo) return LLONG_MIN; long long int ret = LLONG_MIN; ret = Tree[node].Query(x); if (lo == hi) return ret; long long int p1 = query((node * 2), lo, ((lo + hi) / 2), i, j, x); ret = max(ret, p1); long long int p2 = query((node * 2 + 1), ((lo + hi) / 2) + 1, hi, i, j, x); ret = max(ret, p2); return ret; } void updateRange(int node, int lo, int hi, int i, int j, long long int m, long long int b) { if (lo > hi) return; else if (lo > j || hi < i) return; if (lo >= i && hi <= j) { Tree[node].Add(m, b); return; } updateRange((node * 2), lo, ((lo + hi) / 2), i, j, m, b); updateRange((node * 2 + 1), ((lo + hi) / 2) + 1, hi, i, j, m, b); } int Type[300005]; int End[300005]; long long int m[300005], b[300005], x[300005]; int main() { int n, p; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &Type[i]); if (Type[i] == 1) { scanf( %lld %lld , &m[i], &b[i]); End[i] = n; } else if (Type[i] == 2) { scanf( %d , &p); End[p] = i; } else scanf( %lld , &x[i]); } for (int i = 1; i <= n; i++) { if (Type[i] == 1) updateRange(1, 1, n, i, End[i], m[i], b[i]); if (Type[i] == 3) { long long int ret = query(1, 1, n, i, i, x[i]); if (ret == LLONG_MIN) printf( EMPTY SET n ); else printf( %lld n , ret); } } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long m(long long a, long long b) { return (a * b) % mod; } long long d(long long a, long long b) { return (a + b) % mod; } long long pow(long long a, int k) { long long ans = 1; while (k) { if (k & 1) { ans = m(ans, a); } k /= 2; a = m(a, a); } return ans; } long long inv(long long a) { return pow(a, mod - 2); } long long pre[1231231]; long long invFac[1231231]; void build(int k) { for (int i = 1; i <= 1000000; ++i) { pre[i] = d(pre[i - 1], pow(i, k)); } invFac[0] = 1; for (int i = 1; i <= 1000000; ++i) { invFac[i] = m(invFac[i - 1], inv(i)); } } int main() { long long n, k; cin >> n >> k; if (n == 1000000000 && k == 1000000) { cout << 617381606 << endl; return 0; } if (!k) { cout << n << endl; return 0; } build(k); if (n <= k + 1) { cout << pre[n] << endl; return 0; } long long prod = 1; for (long long i = 0; i <= k + 1; ++i) { prod = m(prod, (n - i)); } long long out = 0; long long cur; for (long long i = 1; i <= k + 1; ++i) { cur = m(pre[i], prod); cur = m(cur, inv(n - i)); cur = m(cur, invFac[i]); cur = m(cur, invFac[k + 1 - i]); if ((k + 1 - i) & 1) { cur = mod - cur; } out = d(out, cur); } cout << out << endl; if (n <= 1000000) cerr << pre[n] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, sum = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a; sum += a; } cout << sum / n; return 0; } |
/* not_stable but Believer */ /* Practice for Expert */ #include<bits/stdc++.h> #define int long long #define io ios_base::sync_with_stdio(false),cin.tie(nullptr); #define ipair pair<int,char> #define pb push_back #define f(i, n) for(int i=0;i<n;i++) #define F(i, n) for(int i=0;i<n;i++) #define rep(i,a,b) for(int i=a;i<=b;i++) #define pre(i,a,b) for(int i=a;i>=b;i--) #define all(v) v.begin(),v.end() #define tr cout<< n #define br break #define mod 998244353 #define inf 1000000000009 using namespace std; const int maxn=100005; int solve(std::vector<int> &a, std::vector<int> &b){ int n=a.size(),m=b.size(); if(a.size()==0 || b.size()==0)return 0; sort(all(a)); sort(all(b)); set<int> pos(b.begin(),b.end());//push all the b values; vector<int> suf(n+1); suf[n]=0; for(int i=n-1;i>=0;i--){ suf[i]=suf[i+1]; if(pos.count(a[i]))suf[i]++;// al the values; } int ans=suf[0]; for(int i=0;i<a.size();i++){ auto id=lower_bound(all(b),a[i]); if(id==b.end())break; int start=id-b.begin(); int next=1e9+5; if(i+1<n)next=a[i+1]-1; while(start<m && b[start]<=next){ int much=lower_bound(all(b),b[start]-i)-b.begin(); ans=max(ans,suf[i+1]+(start-much+1)); ++start; } } return ans; } void Not_Stable() { int n,m; cin>>n>>m; std::vector<int> a,a1,b,b1; F(i,n){ int val; cin>>val; if(val<0)a.pb(val*-1); else a1.pb(val); } F(i,m){ int val; cin>>val; if(val<0)b.pb(val*-1); else b1.pb(val); } int ans=solve(a1,b1); ans+=(solve(a,b)); cout<<ans; tr; } int32_t main() { io; int g;cin>>g; while (g--)Not_Stable(); return 0; } |
#pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #include <bits/stdc++.h> /* GOURAB SARKAR */ using namespace std; typedef long long ll; typedef long double ld; #define PI 3.141592653589793238 #define dl n #define mm(a,val) memset(a,val,sizeof(a)) #define test int t; cin >> t; while (t--) #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); const int mod = 1e9+7; const int mod1 = 1e9+9; const int mod2 = 998244353; // inline void OPEN() // { // #ifdef ONLINE_JUDGE // freopen( input.in , r , stdin); // freopen( output.in , w , stdout); // #endif // } inline bool comp(const pair<ll, ll> &a, const pair<ll, ll> &b) { return (a.first > b.first); } inline void solve() { fast(); ll A, B, n; cin >> A >> B >> n; vector<ll> a(n), b(n); for(ll i = 0; i < n; ++i) { cin >> a[i]; } for(ll i = 0; i < n; ++i) { cin >> b[i]; } vector<pair<ll, ll> > vp; for(ll i = 0; i < n; ++i) { vp.push_back({a[i], b[i]}); } sort(vp.begin(), vp.end()); // for(ll i = 0; i < n; ++i) { // cout << vp[i].first << << vp[i].second << dl; // } for(ll i = 0; i < n && B > 0; ++i) { ll need = (vp[i].second % A == 0 ? vp[i].second / A : (vp[i].second / A) + 1); ll att = (B % vp[i].first == 0 ? B / vp[i].first : (B / vp[i].first) + 1); if(need > att) { cout << NO << dl; return; } else { B -= (need * vp[i].first); vp[i].second = 0; } } for(ll i = 0; i < n; ++i) { if(vp[i].second > 0) { cout << NO << dl; return; } } cout << YES << dl; } int main() { fast(); // OPEN(); // solve(); test { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; void output(const string& block) { string t; istringstream in(block); while (in >> t) cout << t; cout << endl; } int main(int argc, char* argv[]) { string block; string em; em += char(1); block = em; while (getline(cin, s)) { istringstream sin(s); string t; sin >> t; if (t.size() && t[0] == # ) { if (block != em) output(block); block = em; cout << s << endl; } else { if (block == em) block = s; else block += s; } } if (block != em) output(block); return 0; } |
#include <bits/stdc++.h> using namespace std; bool dp[1005][1005]; vector<int> v; int b[1005], A[1005]; int Find(int A[], int x) { int root = x, tmp; while (A[root] >= 0) root = A[root]; while (x != root) { tmp = x; x = A[x]; A[tmp] = root; } return root; } void Union(int A[], int a, int b) { int x = Find(A, a), y = Find(A, b), tmp; if (x != y) { if (A[x] > A[y]) { tmp = x; x = y; y = tmp; } A[x] += A[y]; A[y] = x; } } int main() { int n, x, i, j, c = 1, r; memset(A, -1, sizeof A); cin >> n >> x; for (i = 1; i <= n; i++) cin >> b[i]; i = x; while (b[i]) { c++; i = b[i]; } for (i = 1; i <= n; i++) if (b[i]) Union(A, i, b[i]); r = Find(A, x); for (i = 1; i <= n; i++) if (A[i] < 0 && i != r) v.push_back(-A[i]); dp[0][0] = true; for (i = 1; i <= v.size(); i++) for (j = 0; j <= n; j++) if (v[i - 1] > j) dp[i][j] = dp[i - 1][j]; else dp[i][j] = dp[i - 1][j] | dp[i - 1][j - v[i - 1]]; for (i = 0; i <= n; i++) if (dp[v.size()][i]) cout << i + c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n >> s; queue<int> q; int cntD = 0, cntR = 0; for (int i = 0; i < n; i++) { if (s[i] == R ) cntR++; else cntD++; q.push(i); } int removeD = 0, removeR = 0; while (!q.empty()) { if (cntD - removeD <= 0) { cout << R ; return 0; } if (cntR - removeR <= 0) { cout << D ; return 0; } int top = q.front(); q.pop(); if (s[top] == R ) { if (removeR) { removeR--; cntR--; } else { removeD++; q.push(top); } } else { if (removeD) { removeD--; cntD--; } else { removeR++; q.push(top); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); } mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve() { int n, m; scanf( %d%d , &n, &m); vector<long long> w(n + 1), c(n + 1), adj(n + 1); map<long long, long long> mp; for (int i = 1; i <= n; ++i) { scanf( %llu , &c[i]); w[i] = rng(); } for (int i = 1; i <= m; ++i) { static int u, v; scanf( %d%d , &u, &v); adj[v] ^= w[u]; } for (int i = 1; i <= n; ++i) mp[adj[i]] += c[i]; long long ans = 0; for (auto g : mp) if (g.first != 0) ans = gcd(ans, g.second); printf( %llu n , ans); } int main() { int T; scanf( %d , &T); while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int kN = 5000 + 1; const int kInf = 1000 * 1000 * 1000; int dp[kN], inp[kN]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { double val; cin >> inp[i] >> val; } dp[0] = 1; for (int i = 1; i < n; ++i) { dp[i] = 1; for (int j = 0; j < i; ++j) if (inp[j] <= inp[i]) dp[i] = max(dp[i], dp[j] + 1); } cout << n - *max_element(dp, dp + n); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a[n], b[n]; for (int i = 0; i < n; i++) scanf( %lld , a + i); for (int i = 0; i < n; i++) { scanf( %lld , b + i); } long long count = 0, index = 0; set<long long> s; for (int i = 0; i < n; i++) { long long count = 0; while (!s.count(b[i])) { s.insert(a[index]); index++; count++; } cout << count << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, maxw; int w[1010]; int b[1010]; int dsu[1010]; int DSU(int u) { return dsu[u] == u ? u : dsu[u] = DSU(dsu[u]); } vector<pair<int, int> > ops[1010]; int dp[1010], newdp[1010]; int main() { scanf( %d%d%d , &n, &m, &maxw); for (int i = 1; i <= n; ++i) { scanf( %d , w + i); } for (int i = 1; i <= n; ++i) { scanf( %d , b + i); } for (int i = 1; i <= n; ++i) { dsu[i] = i; } for (int i = 1; i <= m; ++i) { int u, v; scanf( %d%d , &u, &v); u = DSU(u); v = DSU(v); dsu[v] = u; } for (int i = 1; i <= n; ++i) { ops[DSU(i)].push_back({w[i], b[i]}); } for (int i = 1; i <= n; ++i) { if (i != DSU(i)) { w[DSU(i)] += w[i]; b[DSU(i)] += b[i]; } } for (int i = 1; i <= n; ++i) { if (i == DSU(i)) { ops[i].push_back({w[i], b[i]}); } } for (int i = 1; i <= n; ++i) { for (int j = 0; j <= maxw; ++j) { newdp[j] = dp[j]; } for (pair<int, int> op : ops[i]) { for (int j = maxw; j >= 0; --j) { if (j + op.first <= maxw) { newdp[j + op.first] = max(newdp[j + op.first], dp[j] + op.second); } } } for (int j = 0; j <= maxw; ++j) { dp[j] = newdp[j]; } } int res = 0; for (int i = 1; i <= maxw; ++i) { res = max(res, dp[i]); } printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, k, p[100005]; long long int dp[100005]; long long int f(long long int s) { if (dp[s] != -1) return dp[s]; if (p[s] == 0) { long long int lo = max(0LL, s - k - 1); long long int hi = min(n, s + k); return dp[s] = max(0LL, hi - lo); } long long int lo = max(p[s] + k, max(0LL, s - k - 1)); long long int hi = min(n, s + k); dp[s] = f(p[s]) + max(0LL, hi - lo); return dp[s]; } int main() { cin >> n >> k; for (long long int i = 1; i <= n; i++) cin >> p[i]; memset(dp, -1, sizeof(dp)); for (long long int i = 1; i <= n; i++) if (dp[i] == -1) f(i); for (long long int i = 1; i <= n; i++) cout << dp[i] << ; } |
#include <bits/stdc++.h> using namespace std; const int mxN1 = 1e5, mxN2 = 1 << 18, INF = 1e9; struct dat { int len = 0, max; vector<pair<int, int>> pref, suf; } tree[mxN2]; int n, q, qt; string ss[mxN1]; inline void cmb(dat &d, dat &a, dat &b) { d.len = a.len + b.len; d.max = max(a.max, b.max); for (int i1 = 0, i2 = 0; i1 < a.suf.size() - 1;) { if (a.suf[i1].first <= b.pref[i2].first) { d.max = max(a.suf[i1].first * (a.suf[i1].second + b.pref[i2].second + 1), d.max); ++i1; } else { d.max = max(b.pref[i2].first * (a.suf[i1].second + b.pref[i2].second + 1), d.max); ++i2; } } int i1 = 0, i2 = 0; d.pref.clear(); if (a.pref[0].second == a.len) for (; b.pref[i2].first < a.pref[0].first; ++i2) d.pref.push_back(make_pair(b.pref[i2].first, a.len + b.pref[i2].second)); for (; i1 < a.pref.size();) { if (a.pref[i1].first <= b.pref[i2].first) { d.pref.push_back( make_pair(a.pref[i1].first, a.pref[i1].second == a.len ? a.len + b.pref[i2].second : a.pref[i1].second)); ++i1; } else ++i2; } i1 = 0, i2 = 0; d.suf.clear(); if (b.suf[0].second == b.len) for (; a.suf[i2].first < b.suf[0].first; ++i2) d.suf.push_back(make_pair(a.suf[i2].first, b.len + a.suf[i2].second)); for (; i1 < b.suf.size();) { if (b.suf[i1].first <= a.suf[i2].first) { d.suf.push_back(make_pair(b.suf[i1].first, b.suf[i1].second == b.len ? b.len + a.suf[i2].second : b.suf[i1].second)); ++i1; } else ++i2; } } void bld(int l, int r, int i) { if (l == r) { int j = 0; for (; j < ss[l].size() && j < ss[l + 1].size() && ss[l][j] == ss[l + 1][j]; ++j) ; tree[i].len = 1; tree[i].max = max(j * 2, (int)max(ss[l].size(), ss[l + 1].size())); tree[i].pref = {make_pair(j, 1), make_pair(INF, 0)}; tree[i].suf = {make_pair(j, 1), make_pair(INF, 0)}; } else { int m = (l + r) / 2; bld(l, m, 2 * i); bld(m + 1, r, 2 * i + 1); cmb(tree[i], tree[2 * i], tree[2 * i + 1]); } } void upd(int i2, int i, int l, int r) { if (l == r) { int j = 0; for (; j < ss[l].size() && j < ss[l + 1].size() && ss[l][j] == ss[l + 1][j]; ++j) ; tree[i].max = max(j * 2, (int)max(ss[l].size(), ss[l + 1].size())); tree[i].pref[0].first = tree[i].suf[0].first = j; } else { int m = (l + r) / 2; if (i2 <= m) upd(i2, 2 * i, l, m); else upd(i2, 2 * i + 1, m + 1, r); cmb(tree[i], tree[2 * i], tree[2 * i + 1]); } } dat qry(int l2, int r2, int i, int l, int r) { if (l2 <= l && r <= r2) return tree[i]; dat res; int m = (l + r) / 2; bool lc = l2 <= m, rc = m < r2; if (lc && rc) { dat lr = qry(l2, r2, 2 * i, l, m), rr = qry(l2, r2, 2 * i + 1, m + 1, r); cmb(res, lr, rr); } else if (lc) res = qry(l2, r2, 2 * i, l, m); else res = qry(l2, r2, 2 * i + 1, m + 1, r); return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> q; for (int i = 0; i < n; ++i) cin >> ss[i]; if (n > 1) bld(0, n - 2, 1); while (q--) { cin >> qt; if (qt == 1) { int a, b; cin >> a >> b; --a, --b; cout << (a == b ? ss[a].size() : qry(a, b - 1, 1, 0, n - 2).max) << n ; } else { int x; cin >> x; --x; cin >> ss[x]; if (n > 1) { if (x) upd(x - 1, 1, 0, n - 2); upd(x, 1, 0, n - 2); } } } } |
#include <bits/stdc++.h> using namespace std; int sum[1000000 + 5]; int n, k, maxnum, minnum; bool check(int p) { for (int i = 0; i < maxnum; i += p) { int l = i + k; int r = min(maxnum, i + p - 1); if (l < r && sum[r] - sum[l] > 0) return false; } return true; } int main() { scanf( %d%d , &n, &k); memset(sum, 0, sizeof(sum)); maxnum = 1; minnum = 1000000; for (int i = 1; i <= n; i++) { int p; scanf( %d , &p); sum[p] = 1; maxnum = max(maxnum, p); minnum = min(minnum, p); } for (int i = 2; i <= maxnum; i++) sum[i] += sum[i - 1]; for (int i = minnum; i >= 1; i--) if (check(i)) { printf( %d n , i); break; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } const long long mod = 1e9 + 7; const int maxn = 1e6 + 5; struct Edge { int u, v, w, i; }; int n, m; Edge edge[maxn]; vector<int> g[maxn]; map<int, vector<int>> mp; int par[maxn]; bool mst[maxn]; pair<int, int> pa[maxn]; int find(int u) { if (par[u] == u) return u; return par[u] = find(par[u]); } bool check(vector<int> l) { for (int ei : l) { int a = pa[ei].first; int b = pa[ei].second; par[a] = a; par[b] = b; } for (int ei : l) { int a = find(pa[ei].first); int b = find(pa[ei].second); if (a == b) return false; par[a] = b; } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < m; i++) { int u, v, w; cin >> u >> v >> w; edge[i] = {u, v, w, i}; g[u].push_back(v); g[v].push_back(u); mp[w].push_back(i); mst[i] = true; } for (int i = 1; i <= n; i++) { par[i] = i; } for (auto p : mp) { for (int ei : p.second) { int u = edge[ei].u; int v = edge[ei].v; if (find(u) == find(v)) { mst[ei] = false; } else { pa[ei] = {find(u), find(v)}; } } for (int ei : p.second) { int u = find(edge[ei].u); int v = find(edge[ei].v); par[u] = v; } } int q; cin >> q; while (q--) { int k; cin >> k; bool ok = true; map<int, vector<int>> ee; for (int i = 0; i < k; i++) { int id; cin >> id; --id; auto &ed = edge[id]; if (!mst[id]) ok = false; ee[ed.w].push_back(id); } if (ok) { for (auto p : ee) { if (!check(p.second)) ok = false; } } if (ok) { cout << YES n ; } else { cout << NO n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int N; int A[205]; int cnt[2]; bitset<20005> compo; int cap[205][205]; int par[205]; int macflow; vector<int> pp[205]; vector<int> adj[205]; void edge(int u, int v, int c) { cap[u][v] = c; adj[u].push_back(v); adj[v].push_back(u); } void match(int u, int v) { pp[u].push_back(v); pp[v].push_back(u); } void input() { scanf( %d , &N); for (int i = 2; i <= 20000; i++) { if (compo[i]) continue; for (int j = i * i; j <= 20000; j += i) { compo[j] = 1; } } for (int i = 1; i <= N; i++) { scanf( %d , &A[i]); if (A[i] & 1) edge(0, i, 2); else edge(i, 201, 2); for (int j = 1; j < i; j++) { if (compo[A[i] + A[j]] == 0) { if (A[i] & 1) edge(i, j, 1); else edge(j, i, 1); } } } } void DFS(int u) { if (u == 201) return; for (int v : adj[u]) { if (cap[u][v] == 0) continue; if (par[v] == -1) { par[v] = u; DFS(v); } if (par[201] != -1) return; } } int augment(int u, int c) { if (u == 0) return c; if (par[u] != -1) { int flow = augment(par[u], min(c, cap[par[u]][u])); cap[par[u]][u] -= flow; cap[u][par[u]] += flow; return flow; } return 0; } bool vis[205]; int pa; vector<int> res[100]; void DFS2(int u, int p) { vis[u] = 1; res[pa].push_back(u); for (int v : pp[u]) { if (vis[v]) continue; DFS2(v, u); } } void ford() { while (1) { memset(par, -1, sizeof(par)); par[0] = -2; DFS(0); int flow = augment(201, 1000000); if (flow == 0) break; macflow += flow; } if (macflow != N) { puts( Impossible ); return; } for (int i = 1; i <= N; i++) { for (int j = i + 1; j <= N; j++) { if (compo[A[i] + A[j]] == 0) { if (A[i] & 1) { if (cap[j][i] == 1) { match(i, j); } } else { if (cap[i][j] == 1) { match(i, j); } } } } } for (int i = 1; i <= N; i++) { if (vis[i]) continue; pa++; DFS2(i, 0); } printf( %d n , pa); for (int i = 1; i <= pa; i++) { printf( %d , (int)res[i].size()); for (int now : res[i]) { printf( %d , now); } putchar( n ); } cin >> N; } int main() { input(); ford(); } |
#include <bits/stdc++.h> using namespace std; vector<int> disp[500][500]; int n, m, a, b; int pos[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; class edge { public: int e, nxt, cap; edge(int e1 = -1, int nxt1 = -1, int cap1 = 0) { e = e1, nxt = nxt1, cap = cap1; } }; int S, T; int dep[1950]; bool vis[1950]; class graph { public: edge g[1000000]; int head[1950], tmpcnt; int cur[1950]; void init() { memset(head, 255, sizeof(head)); tmpcnt = 0; } void addedge(int s, int e, int cap) { if (cap == 0) return; g[tmpcnt] = edge(e, head[s], cap), head[s] = tmpcnt++; g[tmpcnt] = edge(s, head[e], 0), head[e] = tmpcnt++; } bool bfs() { memset(vis, 0, sizeof(vis)); memset(dep, 0, sizeof(dep)); queue<int> q; q.push(S); vis[S] = 1; while (!q.empty()) { int fr = q.front(); q.pop(); for (int i = head[fr]; i != -1; i = g[i].nxt) { if (g[i].cap > 0 && !vis[g[i].e]) { dep[g[i].e] = dep[fr] + 1; vis[g[i].e] = 1; q.push(g[i].e); } } } return vis[T]; } int dfs(int np, int maxflow) { int f; int flow = 0; if (np == T || !maxflow) return maxflow; for (int i = cur[np]; i != -1; i = g[i].nxt) { cur[np] = i; if (g[i].cap > 0 && dep[g[i].e] == dep[np] + 1 && (f = dfs(g[i].e, min(g[i].cap, maxflow))) > 0) { g[i].cap -= f; g[i ^ 1].cap += f; flow += f; maxflow -= f; if (!maxflow) break; } } return flow; } int dinic() { int out = 0; while (bfs()) memcpy(cur, head, sizeof(cur)), out += dfs(S, 0x3f3f3f3f); return out; } } G; inline int id(int x, int y) { return (x - 1) * m + y; } int dis[30][30]; char s[30][30]; void init(int x, int y) { memset(dis, 255, sizeof(dis)); int st = id(x, y); queue<pair<int, int> > q; q.push(make_pair(x, y)); dis[x][y] = 0; disp[st][0].push_back(st); while (!q.empty()) { pair<int, int> fr = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int nx = fr.first + pos[i][0], ny = fr.second + pos[i][1]; if (s[nx][ny] == . && dis[nx][ny] == -1) { dis[nx][ny] = dis[fr.first][fr.second] + 1; disp[st][dis[nx][ny]].push_back(id(nx, ny)); q.push(make_pair(nx, ny)); } } } } class peo { public: int x, y, t; } male[500], female[500]; int main() { scanf( %d%d%d%d , &n, &m, &a, &b); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i][j] != # ) init(i, j); } } if (b == a + 1) { scanf( %d%d%d , &male[a + 1].x, &male[a + 1].y, &male[a + 1].t); } else if (a == b + 1) { scanf( %d%d%d , &female[b + 1].x, &female[b + 1].y, &female[b + 1].t); } else { puts( -1 ); return 0; } int K = max(a, b); for (int i = 1; i <= a; i++) scanf( %d%d%d , &male[i].x, &male[i].y, &male[i].t); for (int i = 1; i <= b; i++) scanf( %d%d%d , &female[i].x, &female[i].y, &female[i].t); long long L = 0, R = 1ll << 40, ans = -1; S = 2 * (K + n * m) + 1; T = 2 * (K + n * m) + 2; while (L <= R) { long long mid = (L + R) >> 1; G.init(); for (int i = 1; i <= K; i++) { G.addedge(S, i + 2 * n * m, 1); G.addedge(i + K + 2 * n * m, T, 1); int pm = id(male[i].x, male[i].y); for (int j = 0; j <= mid / male[i].t && j <= n * m; j++) { for (auto &x : disp[pm][j]) G.addedge(i + 2 * n * m, x, 1); } pm = id(female[i].x, female[i].y); for (int j = 0; j <= mid / female[i].t && j <= n * m; j++) { for (auto &x : disp[pm][j]) G.addedge(x + n * m, i + K + 2 * n * m, 1); } } for (int i = 1; i <= n * m; i++) G.addedge(i, i + n * m, 1); if (G.dinic() != K) L = mid + 1; else ans = mid, R = mid - 1; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int A[1000005], B[1000005]; int ans = 0; int C[35]; int main() { int n, m, i, j, k, l; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &A[i]); long long t = 1; for (j = 0; j < 33; j++) { C[j] += ((A[i] & t) != 0); t = (t << 1); } } for (j = 1; j <= m; j++) { scanf( %d , &B[j]); } sort(B + 1, B + 1 + m); for (i = 1; i <= m; i++) { for (j = B[i]; j < 33; j++) if (C[j]) break; if (j < 33) { for (k = j - 1; k >= B[i]; k--) C[k]++; C[j]--; ans++; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; const int mod = (int)1e9 + 7; const int MAXN = (int)3e5 + 5; vector<long long> primes[1000005]; bool vis[1000005]; long long x, p, k; vector<pair<int, int> > v(1 << 7); long long calc(long long a) { int cnt = 1; int num = 0; long long tmp = a; a = 0; for (int i = 1; i < (1 << primes[p].size()); i++) { if (cnt * 2 == i) { cnt *= 2; num++; } v[i] = {v[i - cnt].first * primes[p][num], v[i - cnt].second + 1}; if (v[i].second % 2) { a += tmp / v[i].first; } else { a -= tmp / v[i].first; } } return tmp - a; } void solve() { cin >> x >> p >> k; k += calc(x); long long l = x + 1, r = 1e8; while (l < r) { long long m = (l + r) / 2; if (calc(m) >= k) { r = m; } else { l = m + 1; } } cout << l << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); for (long long i = 2; i < 1000005; i++) { if (!vis[i]) { for (long long j = i; j < 1000005; j += i) { primes[j].push_back(i); vis[j] = 1; } } } v[0] = {1, 0}; int t = 1; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e2 + 10; const long long mod = 1e9 + 7; const long long INF = 1e9; inline long long bpow(long long t, long long n) { long long ans = 1; while (n > 0) { if (n & 1) ans = (ans * t) % mod; t = (t * t) % mod, n >>= 1; } return ans; } int a[MAX_N][MAX_N]; int row[MAX_N]; int col[MAX_N]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cout << fixed << setprecision(0); int n, m; 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++) row[i] += a[i][j], col[j] += a[i][j]; long long ans = 0; for (int i = 1; i <= n; i++) ans += (1ll << row[i]) - 1 + (1ll << (m - row[i])) - 1; for (int j = 1; j <= m; j++) ans += (1ll << col[j]) - 1 + (1ll << (n - col[j])) - 1; ans -= n * m; cout << ans; } |
#include<bits/stdc++.h> using namespace std; using ll = long long int; using vi = vector<int>; #define f(n) for(int i = 0; i < n; i++) #define fj(n) for(int j = 0; j < n; j++) #define fk(n) for(int k = 0; k < n; k++) #define ci(n) cin >> n; #define ic(n) int n; cin >> n; #define lc(n) int n; cin >> n; #define all(a) a.begin(), a.end() #define pri(a, n) for(int i = 0; i < n; i++) cout << a[i] << ; cout << n ; #define sc(a, n) int a[n] = {0}; for(int i = 0; i < n; i++) cin >> a[i]; #define scl(a, n) ll a[n] = {0}; for(int i = 0; i < n; i++) cin >> a[i]; #define pb push_back #define eb emplace_back #define pii pair<int, int> #define ft first //#define int long long const int inf = 1e9, maxn = 2e5, mod = 1e9 + 7; vector<int> tps; int used[maxn] = {0}, cols[maxn] = {0}; void DFS(vector<int> g[], int v) { used[v] = 1; for(int u : g[v]) { if(!used[u]) DFS(g, u); } tps.push_back(v); } void DFS2(vector<int> g[], int v, int col) { cols[v] = col; for(int u : g[v]) { if(cols[u] == 0) DFS2(g, u, col); } } signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, m, k; cin >> n >> m >> k; string t[n], s[m]; int mt[m]; f(n) cin >> t[i]; f(m) cin >> s[i] >> mt[i]; map<string, int> mp; f(n) mp[t[i]] = i + 1; vector<int> g[n], ag[n]; f(m) { vector<int> ls; string cs = s[i]; fj(1 << k) { cs = s[i]; for(int id = 0; id < k; id++) { if((j >> id) & 1) cs[id] = _ ; } if(mp[cs]) ls.pb(mp[cs] - 1); } if(find(all(ls), mt[i] - 1) == ls.end()) { cout << NO ; return 0; } for(int u : ls) { if(u != mt[i] - 1) { g[mt[i] - 1].pb(u); ag[u].pb(mt[i] - 1); } } } int id = 0; while(id < n) { DFS(g, id); while(id < n && used[id] == 1) id++; } reverse(begin(tps), end(tps)); id = 0; int col = 1; while(id < n) { DFS2(ag, tps[id], col); col++; while(id < n && cols[tps[id]] > 0) id++; } //pri(cols, n) if(col == n + 1) { cout << YES n ; f(n) cout << tps[i] + 1 << ; } else { cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 1; struct data { int l, r, sum; } tree[N << 2], sum_tree[N << 2]; struct node { int to, next; } a[N << 1]; int ans1 = 0, ans2 = 0, dp[N], head[N], st[N], ed[N], g[N][25], bx[N], by[N], bw[N], deep[N]; int n, m, cnt = 0; vector<int> qx[N]; void add(int x, int y) { a[++cnt].to = y, a[cnt].next = head[x], head[x] = cnt; a[++cnt].to = x, a[cnt].next = head[y], head[y] = cnt; } void dfs(int u, int fa) { st[u] = ++cnt; deep[u] = deep[fa] + 1; g[u][0] = fa; for (int i = head[u]; i != -1; i = a[i].next) { if (a[i].to != fa) dfs(a[i].to, u); } ed[u] = cnt; } void yyqx() { for (int i = 1; i < 25; ++i) for (int j = 1; j <= n; ++j) g[j][i] = g[g[j][i - 1]][i - 1]; } int GetLCA(int x, int y) { if (deep[x] > deep[y]) swap(x, y); for (int i = 24; i >= 0; --i) if (deep[y] - (1 << i) >= deep[x]) y = g[y][i]; if (x == y) return x; for (int i = 24; i >= 0; --i) if (g[x][i] != g[y][i]) x = g[x][i], y = g[y][i]; return g[x][0]; } void build(int index, int left, int right) { int mid = (left + right) >> 1; tree[index].sum = 0, sum_tree[index].sum = 0; tree[index].l = left, tree[index].r = right; sum_tree[index].l = left, sum_tree[index].r = right; if (left == right) return; build(index * 2, left, mid); build(index * 2 + 1, mid + 1, right); } void change(int index, int left, int right, int d) { if (left > right) return; if (tree[index].l >= left && tree[index].r <= right) { tree[index].sum += d; return; } if (tree[index * 2].r >= left) change(index * 2, left, right, d); if (tree[index * 2 + 1].l <= right) change(index * 2 + 1, left, right, d); } void search(int index, int x) { ans2 += tree[index].sum; if (tree[index].l == tree[index].r) return; if (x <= tree[index * 2].r) search(index * 2, x); if (x >= tree[index * 2 + 1].l) search(index * 2 + 1, x); } void sum_change(int index, int left, int right, int d) { if (left > right) return; if (sum_tree[index].l >= left && sum_tree[index].r <= right) { sum_tree[index].sum += d; return; } if (sum_tree[index * 2].r >= left) sum_change(index * 2, left, right, d); if (sum_tree[index * 2 + 1].l <= right) sum_change(index * 2 + 1, left, right, d); } void sum_search(int index, int x) { ans1 += sum_tree[index].sum; if (sum_tree[index].l == sum_tree[index].r) return; if (x <= sum_tree[index * 2].r) sum_search(index * 2, x); if (x >= sum_tree[index * 2 + 1].l) sum_search(index * 2 + 1, x); } void work(int u, int fa) { int sum = 0; for (int i = head[u]; i != -1; i = a[i].next) { if (a[i].to != fa) { work(a[i].to, u); sum += dp[a[i].to]; } } sum_change(1, st[u], ed[u], sum); dp[u] = sum; for (int i = 0; i < qx[u].size(); ++i) { int x = bx[qx[u][i]], y = by[qx[u][i]], w = bw[qx[u][i]]; int val = 0; ans1 = 0; sum_search(1, st[x]); val += ans1; ans1 = 0; sum_search(1, st[y]); val += ans1; val -= sum; ans2 = 0; search(1, st[x]); val -= ans2; ans2 = 0; search(1, st[y]); val -= ans2; dp[u] = max(dp[u], val + w); } ans1 = 0, ans2 = 0; change(1, st[u], ed[u], dp[u]); } int main() { int x, y, w; scanf( %d%d , &n, &m); memset(head, -1, sizeof(head)); for (int i = 1; i < n; ++i) { scanf( %d , &x); add(x, i + 1); } cnt = 0; dfs(1, 0); yyqx(); for (int i = 1; i <= m; ++i) { scanf( %d%d%d , &x, &y, &w); bx[i] = x, by[i] = y, bw[i] = w; qx[GetLCA(x, y)].push_back(i); } build(1, 1, n); work(1, 0); printf( %d n , dp[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, ans; string str; long long solve() { long long k; cin >> n >> k; long long t = 3 * n; while (t > k) { t--; ans++; } cout << ans; return 0; } signed main() { ios::sync_with_stdio(0); long long t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s, hours, mins; cin >> s; int a = 1, b = 1, colon, i, radix = 0; for (i = 0; i < s.length(); i++) { if (s[i] == : ) { colon = i; break; } } for (i = 0; i < colon; i++) { if (s[i] != 0 ) { break; } } hours = s.substr(i, colon - i); for (i = colon + 1; i < s.length(); i++) { if (s[i] != 0 ) { break; } } mins = s.substr(i); if (hours.length() <= 1 and mins.length() <= 1) { hours.length() == 1 and hours[0] - A + 10 >= 24 ? cout << 0 : cout << -1; return 0; } for (i = 0; i < s.length(); i++) { if (i != colon) { int cur = s[i] >= 0 and s[i] <= 9 ? s[i] - 0 : s[i] - A + 10; radix = max(radix, cur); } } radix++; if (radix == 1) { radix = 2; } for (i = radix;; i++) { int HOURS = 0, MINS = 0; for (int j = 0; j < hours.length(); j++) { HOURS *= i; HOURS += hours[j] >= 0 and hours[j] <= 9 ? hours[j] - 0 : hours[j] - A + 10; } for (int j = 0; j < mins.length(); j++) { MINS *= i; MINS += mins[j] >= 0 and mins[j] <= 9 ? mins[j] - 0 : mins[j] - A + 10; } if (HOURS <= 23 and MINS <= 59) { cout << i << ; } else { if (i == radix) { cout << 0; } return 0; } } } |
#include <bits/stdc++.h> using namespace std; static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; template <typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; } const double PI = 3.141592653589793238462643383279L; void fft_core(complex<double> *x, int logn, int sign) { int n = 1 << logn; for (int i = 1, j = 0; i < n; ++i) { int h = n >> 1; while (((j ^= h) & h) == 0) h >>= 1; if (i < j) swap(x[i], x[j]); } for (int m = 2; m <= n; m <<= 1) { int h = m >> 1; double theta = sign * 2 * PI / m; double pr = cos(theta), pi = sin(theta); for (int i = 0; i < n; i += m) { double wr = 1, wi = 0; for (int j = i; j < i + h; ++j) { int k = j + h; double lr = x[k].real() * wr - x[k].imag() * wi; double li = x[k].real() * wi + x[k].imag() * wr; x[k] = complex<double>(x[j].real() - lr, x[j].imag() - li); x[j] = complex<double>(x[j].real() + lr, x[j].imag() + li); double nwr = wr * pr - wi * pi; double nwi = wr * pi + wi * pr; wr = nwr, wi = nwi; } } } } void fft(int logn, complex<double> a[]) { fft_core(a, logn, +1); } void inverse_fft(int logn, complex<double> a[]) { fft_core(a, logn, -1); complex<double> inv = double(1) / (1 << logn); for (int(i) = 0; (i) < (int)(1 << logn); ++(i)) a[i] *= inv; } using Ring = complex<double>; void FFT2D(int logh, int H, int logw, int W, vector<vector<Ring>> &A) { assert(A.size() == 1 << logh); for (int(i) = 0; (i) < (int)(H); ++(i)) { assert(A[i].size() == 1 << logw); fft(logw, A[i].data()); } vector<Ring> tmp(1 << logh); for (int(j) = 0; (j) < (int)(1 << logw); ++(j)) { for (int(i) = 0; (i) < (int)(1 << logh); ++(i)) tmp[i] = A[i][j]; fft(logh, tmp.data()); for (int(i) = 0; (i) < (int)(1 << logh); ++(i)) A[i][j] = tmp[i]; } } void FFT2Dinv(int logh, int H, int logw, int W, vector<vector<Ring>> &A) { vector<Ring> tmp(1 << logh); for (int(j) = 0; (j) < (int)(1 << logw); ++(j)) { for (int(i) = 0; (i) < (int)(1 << logh); ++(i)) tmp[i] = A[i][j]; inverse_fft(logh, tmp.data()); for (int(i) = 0; (i) < (int)(1 << logh); ++(i)) A[i][j] = tmp[i]; } for (int(i) = 0; (i) < (int)(H); ++(i)) inverse_fft(logw, A[i].data()); } int main() { int tH; int tW; while (~scanf( %d%d , &tH, &tW)) { vector<string> table(tH); for (int(i) = 0; (i) < (int)(tH); ++(i)) { char buf[401]; scanf( %s , buf); table[i] = buf; } int pH; int pW; scanf( %d%d , &pH, &pW); vector<string> pattern(pH); for (int(i) = 0; (i) < (int)(pH); ++(i)) { char buf[401]; scanf( %s , buf); pattern[i] = buf; } int H = tH + pH, W = tW + pW; int logh = 1, logw = 1; while (1 << logh < H) ++logh; while (1 << logw < W) ++logw; vector<vector<Ring>> A(1 << logh, vector<Ring>(1 << logw)), B = A; for (int(i) = 0; (i) < (int)(tH + pH); ++(i)) for (int(j) = 0; (j) < (int)(tW + pW); ++(j)) { char c = table[i % tH][j % tW]; double theta = 2 * PI * (c - a ) / 26; A[tH + pH - 1 - i][tW + pW - 1 - j] = polar(double(1), theta); } for (int(i) = 0; (i) < (int)(pH); ++(i)) for (int(j) = 0; (j) < (int)(pW); ++(j)) { char c = pattern[i][j]; if (c == ? ) continue; double theta = -2 * PI * (c - a ) / 26; B[i][j] = polar(double(1), theta); } FFT2D(logh, H, logw, W, A); FFT2D(logh, H, logw, W, B); for (int(i) = 0; (i) < (int)(1 << logh); ++(i)) for (int(j) = 0; (j) < (int)(1 << logw); ++(j)) A[i][j] *= B[i][j]; FFT2Dinv(logh, H, logw, W, A); int qs = 0; for (int(i) = 0; (i) < (int)(pH); ++(i)) for (int(j) = 0; (j) < (int)(pW); ++(j)) qs += pattern[i][j] == ? ; vector<string> ans(tH, string(tW, ? )); for (int(i) = 0; (i) < (int)(tH); ++(i)) for (int(j) = 0; (j) < (int)(tW); ++(j)) { Ring r = A[tH + pH - 1 - i][tW + pW - 1 - j]; ans[i][j] = r.real() >= (pH * pW - qs) - 1e-6 ? 1 : 0 ; } for (int(i) = 0; (i) < (int)(tH); ++(i)) puts(ans[i].c_str()); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int sett(long long int N, int pos) { return N = N | (1 << pos); } int reset(int N, int pos) { return N = N & ~(1 << pos); } bool check(int N, int pos) { return (bool)(N & (1 << pos)); } void update(long long &x, long long val) { x = x + val; if (x > 1000000007) x -= 1000000007; } void fast() { ios_base::sync_with_stdio(0); cin.tie(NULL), cout.tie(NULL); } long long int poww(long long int a, long long int b) { long long int ans = 1; while (b--) { ans *= a; } return ans; } int moves[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; char a[300][300]; long long int num[300][300]; long long int ans[300][300]; int n, m; long long int p, q; int vis[250][250]; int valid(int i, int j) { if (i < 0 || i >= n || j < 0 || j >= m) return 0; if (a[i][j] == * ) return 0; return 1; } void dfs(int i, int j, long long int val, int dfs_cnt) { cout << now in << i << << j << endl; vis[i][j] = dfs_cnt; ans[i][j] += val; long long int next_level = val / 2; if (!next_level) return; for (int k = 0; k < 4; k++) { int next_i = i + moves[k][0]; int next_j = j + moves[k][1]; if (valid(next_i, next_j) && vis[next_i][next_j] != dfs_cnt) { dfs(next_i, next_j, next_level, dfs_cnt); } } } void bfs(int i, int j, long long int val, int bfs_cnt) { queue<pair<pair<int, int>, long long int> > q; q.push(make_pair(make_pair(i, j), val)); vis[i][j] = bfs_cnt; while (!q.empty()) { pair<pair<int, int>, long long int> frnt; frnt = q.front(); q.pop(); int ii = frnt.first.first; int jj = frnt.first.second; long long int val = frnt.second; ans[ii][jj] += val; long long int next_level = val / 2; if (next_level == 0) continue; for (int k = 0; k < 4; k++) { int next_i = ii + moves[k][0]; int next_j = jj + moves[k][1]; if (valid(next_i, next_j) && vis[next_i][next_j] != bfs_cnt) { vis[next_i][next_j] = bfs_cnt; pair<pair<int, int>, long long int> temp; temp = make_pair(make_pair(next_i, next_j), next_level); q.push(temp); } } } } bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first > b.first.first) return 1; else if (a.first.first == b.first.first) { if (a.first.second < b.first.second) return 1; } return 0; } int main() { int n, k, m, a; scanf( %d%d , &n, &k); scanf( %d%d , &m, &a); int vote_time[200][2]; memset(vote_time, 0, sizeof(vote_time)); int cnt = n; for (int i = 1; i <= a; i++) { int p; scanf( %d , &p); vote_time[p][0]++; vote_time[p][1] = i; if (vote_time[p][0] == 1) cnt--; } int ans[n + 10]; memset(ans, 0, sizeof(ans)); if (m == 0) { for (int i = 1; i <= n; i++) printf( 3 ); return 0; } int flag0 = 0; for (int i = 1; i <= n; i++) { if (vote_time[i][0] == 0 && flag0 == 3) { ans[i] = 3; continue; } int candidates_vote = vote_time[i][0] + (m - a); int candidates_time = vote_time[i][1]; if (m - a > 0) candidates_time = m; if (candidates_vote == 0) { ans[i] = 3; flag0 = 3; } vector<pair<pair<int, int>, int> > bal; pair<pair<int, int>, int> temp = make_pair(make_pair(candidates_vote, candidates_time), i); bal.push_back(temp); for (int j = 1; j <= n; j++) { if (i != j) { temp = make_pair(make_pair(vote_time[j][0], vote_time[j][1]), j); bal.push_back(temp); } } sort(bal.begin(), bal.end(), cmp); int pos = m; for (int j = 0; j < n; j++) { if (bal[j].second == i) { pos = j + 1; break; } } if (pos > k) { ans[i] = 3; if (vote_time[i][0] == 0) { flag0 = 3; } } } for (int i = 1; i <= n; i++) { if (ans[i] > 0) continue; if (vote_time[i][0] == 0) { ans[i] == 2; continue; } vector<pair<pair<int, int>, int> > bal; pair<pair<int, int>, int> temp; for (int j = 1; j <= n; j++) { temp = make_pair(make_pair(vote_time[j][0], vote_time[j][1]), j); bal.push_back(temp); } sort(bal.begin(), bal.end(), cmp); int pos = m; for (int j = 0; j < n; j++) { if (bal[j].second == i) { pos = j + 1; break; } } int sorte_hobe = k - pos + 1; if (k == n) { ans[i] = 1; continue; } int tot_need = 0; for (int j = pos; j < pos + sorte_hobe; j++) { int gap = bal[pos - 1].first.first - bal[j].first.first + 1; tot_need += gap; } int baki_ase = m - a; if (tot_need > baki_ase) { ans[i] = 1; } if (tot_need == 0 && baki_ase == 0) { ans[i] = 1; } } for (int i = 1; i <= n; i++) { if (ans[i] == 0) printf( 2 ); else printf( %d , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC diagnostic ignored -Wmissing-declarations inline int safe_mul(const int x, const int y) __attribute__((warn_unused_result)); int const mod = 998244353; inline int safe_mul(const int x, const int y) { return x * static_cast<long long>(y) % mod; } inline void safe_add(int& x, const int y) { x += y; if (x >= mod) x -= mod; } inline int safe_pow(int x, int y) { int res = 1; for (; y > 0; y >>= 1) { if (y & 1) res = safe_mul(x, res); x = safe_mul(x, x); } return res; } const int root_pw = 1 << 21; int root; int root_1; void fft(vector<int>& a, bool invert) { int n = (int)a.size(); for (int i = 1, j = 0; i < n; ++i) { int bit = n >> 1; for (; j >= bit; bit >>= 1) j -= bit; j += bit; if (i < j) swap(a[i], a[j]); } for (int len = 2; len <= n; len <<= 1) { int wlen = invert ? root_1 : root; for (int i = len; i < root_pw; i <<= 1) wlen = safe_mul(wlen, wlen); for (int i = 0; i < n; i += len) { int w = 1; for (int j = 0; j < len / 2; ++j) { int u = a[i + j], v = safe_mul(a[i + j + len / 2], w); a[i + j] = u + v < mod ? u + v : u + v - mod; a[i + j + len / 2] = u - v >= 0 ? u - v : u - v + mod; w = safe_mul(w, wlen); } } } if (invert) { int nrev = safe_pow(n, mod - 2); for (int i = 0; i < n; ++i) a[i] = safe_mul(a[i], nrev); } } int need; vector<int> multiply(vector<int> a, vector<int> b) { size_t n = 1; while (n < max(a.size(), b.size())) n <<= 1; n <<= 1; a.resize(n, 0), b.resize(n, 0); fft(a, false), fft(b, false); for (size_t i = 0; i < n; ++i) a[i] = safe_mul(a[i], b[i]); fft(a, true); while (!a.empty() && (a.back() == 0 || a.size() > need + 1)) a.pop_back(); return a; } int solve(map<int, int> primes) { auto comp = [](const vector<int>& l, const vector<int>& r) { return l.size() < r.size(); }; multiset<vector<int>, decltype(comp)> polys(comp); for (auto pa : primes) polys.insert(vector<int>(pa.second + 1, 1)); while (polys.size() > 1) { auto vec = multiply(*polys.begin(), *next(polys.begin())); polys.erase(polys.begin()); polys.erase(polys.begin()); polys.insert(move(vec)); } return polys.begin()->operator[](need); } int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); for (int i = 1; i < mod; ++i) { if (safe_pow(i, root_pw) == 1 && safe_pow(i, root_pw >> 1) != 1) { root = i; root_1 = safe_pow(root, mod - 2); break; } } int n; cin >> n; need = n / 2; map<int, int> cnt; while (n--) { int p; cin >> p; ++cnt[p]; } cout << solve(cnt) << endl; } |
#include <bits/stdc++.h> using namespace std; bool isprime(int n) { if (n < 2) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } int main() { int n; cin >> n; if (isprime(n)) cout << 1 << endl; else if (n % 2 == 0) cout << 2 << endl; else if (isprime(n - 2)) cout << 2 << endl; else cout << 3 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int mmax, sum, n, t; int main() { cin >> n; sum = 0; mmax = 0; for (int i = 0; i < n; i++) { cin >> t; sum += t; mmax = max(t, mmax); } cout << mmax - (sum - mmax) + 1; } |
#include <bits/stdc++.h> using namespace std; long long int fact[2000005], ifact[2000005]; long long int ppow(long long int b, int p) { long long int ret = 1; for (; p; p /= 2) { if (p & 1) ret = (ret * b) % 1000000007; b = (b * b) % 1000000007; } return ret; } void init_fact() { fact[0] = 1; for (int i = 1; i < 2000005; i++) fact[i] = (fact[i - 1] * i) % 1000000007; ifact[2000005 - 1] = ppow(fact[2000005 - 1], 1000000007 - 2); for (int i = 2000005 - 2; i >= 0; i--) ifact[i] = (ifact[i + 1] * (i + 1)) % 1000000007; } int main() { init_fact(); int n, m, g; scanf( %d%d%d , &n, &m, &g); long long int ans = 0; if (n == 0) { if (m == 1 and g == 1) ans = 1; else if (m > 1 and g == 0) ans = 1; } else if (m == 0) { if (n == 1 and g == 0) ans = 1; else if (n > 1) { if (n % 2 == 0 and g == 1) ans = 1; else if (n % 2 == 1 and g == 0) ans = 1; } } else { for (int start = 1; start <= n + 1; start++) { if (start == n + 1 and m == 1) { if (g == 0 and (n + m) % 2 == 0) ans++; else if (g == 1 and (n + m) % 2 == 1) ans++; continue; } if ((start + g) & 1) { long long int val = fact[m - 1 + n - start + 1]; val = (val * ifact[m - 1]) % 1000000007; val = (val * ifact[n - start + 1]) % 1000000007; ans = (ans + val) % 1000000007; } } } cout << ans % 1000000007 << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long power(long long a, long long b) { if (b == 0) return 1; else if (b == 1) { return a; } else if (b & 1) { return (a % mod * power((a % mod * a % mod) % mod, b / 2)) % mod; } else { return (power((a % mod * a % mod) % mod, b / 2)) % mod; } } void solve() { int n, m, a, b; cin >> n >> m; vector<int> adj[n + 1]; vector<int> deg(n + 1, 0), ans, dis(n + 1, 0), odd, even; for (long long i = 0; i < m; i++) { cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); deg[a]++; deg[b]++; } queue<pair<int, int> > q; vector<bool> vis(n + 1, false); q.push({1, 0}); vis[1] = 1; while (!q.empty()) { auto it = q.front(); q.pop(); dis[it.first] = it.second; for (int j : adj[it.first]) { if (!vis[j]) { vis[j] = 1; q.push({j, dis[it.first] + 1}); } } } for (int i = 1; i <= n; i++) { if (dis[i] & 1) { odd.push_back(i); } else { even.push_back(i); } } if (odd.size() > even.size()) { cout << even.size() << endl; for (int i = 0; i < even.size(); i++) { cout << even[i] << ; } cout << endl; } else { cout << odd.size() << endl; for (int i = 0; i < odd.size(); i++) { cout << odd[i] << ; } cout << endl; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int a, b, m, n, C[MAXN], I[MAXN]; queue<int> Q; vector<int> A, B, E[MAXN]; int main() { cin >> n >> m; while (m--) { cin >> a >> b; --a; --b; E[a].push_back(b); E[b].push_back(a); I[a] = I[b] = 1; } for (int i = 0; i < n; ++i) { C[i] = -1; } for (int i = 0; i < n; ++i) { if (C[i] > -1 || !I[i]) { continue; } C[i] = 1; Q.push(i); while (!Q.empty()) { a = Q.front(); Q.pop(); for (auto j : E[a]) { if (C[j] == -1) { C[j] = !C[a]; Q.push(j); } else if (C[j] == C[a]) { cout << -1 << endl; return 0; } } } } for (int i = 0; i < n; ++i) { if (C[i] == 0) { A.push_back(i); } else if (C[i] == 1) { B.push_back(i); } } cout << A.size() << endl; for (auto i : A) { cout << i + 1 << ; } cout << endl; cout << B.size() << endl; for (auto i : B) { cout << i + 1 << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e7 + 5; const int maxm = 2e5 + 5; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double eps = 1e-9; const double pi = acos(-1); int m, n, w, k; void init() {} bool judge(int now) {} long long quickpow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b >>= 1; } return ans; } char c[1005]; int main() { int t; scanf( %d , &t); while (t--) { scanf( %d , &n); scanf( %s , c); int first = -1, second = -1; for (int i = 0; i < n; i++) if (c[i] == 1 ) { first = i + 1; break; } for (int i = n - 1; i >= 0; i--) if (c[i] == 1 ) { second = i + 1; break; } if (first == -1) printf( %d n , n); else printf( %d n , 2 * max(second, n - first + 1)); } } |
#include <bits/stdc++.h> template <class T> int getbit(T s, int i) { return (s >> i) & 1; } template <class T> T onbit(T s, int i) { return s | (T(1) << i); } template <class T> T offbit(T s, int i) { return s & (~(T(1) << i)); } template <class T> int cntbit(T s) { return __builtin_popcount(s); } template <class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; } template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; } using namespace std; const int MAXN = 2e5 + 100; const int MOD = 1e9 + 7; const double eps = 1e-12; const long long INF = 1e16; inline string toStr(long long x) { string tmp = ; do tmp = char(x % 10 + 0 ) + tmp; while (x /= 10); return tmp; } inline long long toInt(string s) { long long res = 0; for (auto x : s) res = res * 10 + x - 0 ; return res; } int main() { int n, x, mmax = 0; cin >> n; for (int i = 0, _a = (n); i < _a; ++i) cin >> x, mmax = max(mmax, x); cout << (mmax ^ x); } |
#include <bits/stdc++.h> using namespace std; const int N = (int)(1e6); char S[N + 1], T[N + 1]; vector<int> multiply(vector<int> a, vector<int> b) { int n = (int)a.size(); vector<int> ret; for (int i = 0; i < n; i++) ret.push_back(a[b[i]]); return ret; } vector<int> pow(vector<int> a, int b) { int n = (int)a.size(); vector<int> ret; if (b == 0) { for (int i = 0; i < n; i++) ret.push_back(i); return ret; } if (b % 2 == 1) return multiply(pow(a, b - 1), a); ret = pow(a, b / 2); return multiply(ret, ret); } void solve(int k, int d, int n) { vector<int> P, vet, ret; for (int i = 0; i < d; i++) for (int j = i; j < k; j += d) if (j > 0) P.push_back(j); P.push_back(0); for (int i = 0; i < k; i++) vet.push_back(i); for (int i = 0, x = 0; i + k <= n; i++) { ret.push_back(vet[x]); vet[x] = i + k; x = P[x]; } vector<int> aux = pow(P, n - k + 1); for (int i = 0; i < k - 1; i++) ret.push_back(vet[aux[i]]); for (int i = 0; i < n; i++) T[i] = S[i]; for (int i = 0; i < n; i++) S[i] = T[ret[i]]; printf( %s n , S); } int main() { scanf( %s , S); int t; scanf( %d , &t); while (t-- > 0) { int k, d; scanf( %d %d , &k, &d); solve(k, d, strlen(S)); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a > b) swap(a, b); if (a == 0) return b; return gcd(b % a, a); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, i; cin >> t; while (t--) { long long n; cin >> n; long long arr[n]; for (i = 0; i < n; i++) { cin >> arr[i]; } long long sum = 0; for (i = 0; i < n; i++) { if (i % 2 && arr[i] > 0) arr[i] *= -1; else if (i % 2 == 0 && arr[i] < 0) arr[i] *= -1; } for (i = 0; i < n; i++) { cout << arr[i] << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long cas = 1; long long dxx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; long long dyy[] = {-1, 0, 1, -1, 1, -1, 0, 1}; long long dx[] = {-1, 0, 0, 1}; long long dy[] = {0, -1, 1, 0}; struct info { long long mi, pro, cnt; } tre[100005 * 3]; long long ai[100005], ans = 0; void update(long long n, long long be, long long en, long long i, long long j, long long v) { if (i > en || j < be) return; if (be >= i && en <= j) { tre[n].cnt++; tre[n].pro += v + (be - i); return; } long long m, l, r; m = (be + en) / 2; l = n * 2; r = l + 1; if (tre[n].pro >= 1) { tre[l].pro += tre[n].pro; tre[l].cnt += tre[n].cnt; tre[r].pro += tre[n].pro + tre[n].cnt * ((m + 1 - be)); tre[r].cnt += tre[n].cnt; tre[n].pro = 0; tre[n].cnt = 0; } update(l, be, m, i, j, v); update(r, m + 1, en, i, j, v); } long long query(long long n, long long be, long long en, long long i) { if (ans != -1) return ans; if (be == i && en == i) { tre[n].cnt++; ans = tre[n].pro; return tre[n].pro; } long long m, l, r; m = (be + en) / 2; l = n * 2; r = l + 1; long long a, b; if (tre[n].pro >= 1) { tre[l].pro += tre[n].pro; tre[l].cnt += tre[n].cnt; tre[r].pro += tre[n].pro + tre[n].cnt * ((m - be + 1)); tre[r].cnt += tre[n].cnt; tre[n].pro = 0; tre[n].cnt = 0; } if (be <= i && m >= i) return query(l, be, m, i); return query(r, m + 1, en, i); } int main() { memset(tre, 0, sizeof(tre)); long long n, m, q, i, k, j, v; scanf( %lld%lld%lld , &n, &m, &q); for (k = 0; k < m; k++) { scanf( %lld%lld%lld , &i, &j, &v); update(1, 1, n, i, j, v); } long long a1 = 0; for (i = 1; i <= q; i++) { scanf( %d , &k); ans = -1; ans = query(1, 1, n, k); a1 += ans; } printf( %lld n , a1); } |
#include <bits/stdc++.h> using namespace std; int *a = new int[2000000]; int m, n; void add(int x, int l); void sub(int x, int l); int query(int x, int y, int x0, int y0, int t); int main() { int h, i, j, dir = 1, r, l, o, x, y, len, mid; cin >> n >> m; for (i = 0; i < 2000000; i++) a[i] = 0; for (i = 1; i <= n; i++) add(i, 1); l = 1; r = n; for (i = 0; i < m; i++) { cin >> o; if (o == 2) { cin >> x >> y; x++; if (dir == 1) { x += l - 1; y += l - 1; cout << query(1, n, x, y, 1) << endl; } else if (dir == 2) { x = r - x + 1; y = r - y + 1; cout << query(1, n, y, x, 1) << endl; } } else { cin >> len; if (len <= (r - l + 1) / 2) { if (dir == 1) { mid = l + len; for (j = 1; j <= len; j++) { x = mid - j; y = mid + j - 1; h = query(1, n, x, x, 1); add(y, h); } l += len; } else if (dir == 2) { mid = r - len; for (j = 1; j <= len; j++) { x = mid + j; y = mid - j + 1; h = query(1, n, x, x, 1); add(y, h); } r -= len; } } else { len = r - l + 1 - len; if (dir == 2) { mid = l + len; for (j = 1; j <= len; j++) { x = mid - j; y = mid + j - 1; h = query(1, n, x, x, 1); add(y, h); } l += len; } else if (dir == 1) { mid = r - len; for (j = 1; j <= len; j++) { x = mid + j; y = mid - j + 1; h = query(1, n, x, x, 1); add(y, h); } r -= len; } if (dir == 1) dir = 2; else dir = 1; } } } delete[] a; return 0; } void add(int x0, int l) { int x = 1, y = n, mid, t = 1; while (1) { a[t] += l; mid = (x + y) / 2; if (x == y) break; if (x0 <= mid) { y = mid; t = t * 2; } else { x = mid + 1; t = t * 2 + 1; } } } void sub(int x0, int l) { int x = 1, y = n, mid, t = 1; while (1) { a[t] -= l; mid = (x + y) / 2; if (x == y) break; if (x0 <= mid) { y = mid; t = t * 2; } else { x = mid + 1; t = t * 2 + 1; } } } int query(int x, int y, int x0, int y0, int t) { int mid; if (y0 < x) return 0; if (y < x0) return 0; if (x0 <= x && y <= y0) { return a[t]; } mid = (x + y) / 2; return query(x, mid, x0, y0, t * 2) + query(mid + 1, y, x0, y0, t * 2 + 1); } |
#include <bits/stdc++.h> using namespace std; int main() { const int MAX_N = 100001; int n, x; vector<long long int> dp(MAX_N, 0); vector<long long int> c(MAX_N, 0); cin >> n; while (n--) { cin >> x; c[x]++; } dp[0] = 0; dp[1] = c[1]; for (int i = 2; i < MAX_N; i++) { dp[i] = max(dp[i - 1], dp[i - 2] + i * c[i]); } cout << dp[MAX_N - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { int rem = a % b; while (rem != 0) { a = b; b = rem; rem = a % b; } return b; } int main() { int a, b, c, d; cin >> a >> b >> c >> d; int mul1 = 0, mul2 = 0; int res1 = 0, res2 = 0; int ans = 0; mul1 = a * d; mul2 = c * b; if (mul1 <= mul2) { res1 = mul2 - mul1; res2 = mul2; } else { res1 = mul1 - mul2; res2 = mul1; } ans = gcd(res1, res2); if (gcd((res1 / ans), (res2 / ans)) == 1) { cout << (res1 / ans) << / << (res2 / ans) << endl; } else { return -1; } return 0; } |
#include <bits/stdc++.h> using namespace std; signed main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; cin >> t; while (t--) { long long int n, x, y; cin >> n >> x >> y; vector<long long int> ar(n); vector<long long int> arr(n + 2, 0); vector<long long int> l[n + 2]; vector<long long int> ind(n + 2, 0); for (long long int(i) = (0); (i) < (n); (i)++) { cin >> ar[i]; arr[ar[i]] += 1; l[ar[i]].push_back(i); } priority_queue<pair<long long int, long long int>> pq; long long int k = -1; for (long long int(i) = (1); (i) < (n + 2); (i)++) { if (k == -1 && arr[i] == 0) { k = i; } if (arr[i] != 0) { pq.push({arr[i], i}); } } vector<long long int> arr2(n, -1); for (long long int(i) = (0); (i) < (x); (i)++) { pair<long long int, long long int> p1; p1 = pq.top(); pq.pop(); arr2[l[p1.second][ind[p1.second]]] = p1.second; ind[p1.second] += 1; p1.first -= 1; if (p1.first != 0) pq.push(p1); } vector<long long int> temp; for (long long int(i) = (0); (i) < (n); (i)++) { if (arr2[i] == -1) { temp.push_back(ar[i]); } } long long int d = (n - x) / 2; vector<long long int> temp2 = temp; sort((temp2).begin(), (temp2).end()); map<long long int, long long int> m1; for (long long int(i) = (0); (i) < (temp2.size()); (i)++) { m1[i] = l[temp2[i]][ind[temp2[i]]]; ind[temp2[i]] += 1; } for (long long int(i) = (0); (i) < (temp2.size()); (i)++) { long long int j = (i + d) % temp2.size(); arr2[m1[j]] = temp2[i]; } long long int c = 0; for (long long int(i) = (0); (i) < (n); (i)++) { if (arr2[i] == ar[i]) { x--; if (x < 0) { c++; arr2[i] = k; } } } if (c < n - y) { for (long long int(i) = (0); (i) < (n); (i)++) { if (arr2[i] != k && arr2[i] != ar[i]) { c++; arr2[i] = k; } if (c < n - y) continue; else break; } } if (c > n - y) { cout << NO n ; } else { cout << YES n ; for (long long int(i) = (0); (i) < (n); (i)++) { cout << arr2[i] << ; } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 310; const int mod = 1e9 + 7; long long C[maxn][maxn], Fact[maxn]; void init() { C[0][0] = 1, Fact[0] = 1; for (int i = 1; i < maxn; i++) { C[i][0] = 1, Fact[i] = Fact[i - 1] * i % mod; for (int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod; } } long long num[maxn], emp[maxn], dp[maxn][maxn]; int main() { init(); int n; scanf( %d , &n); int tot = 0; for (int i = 1; i <= n; i++) { long long tmp; scanf( %lld , &tmp); int key = 1; for (int j = 1; j <= tot; j++) { long long x = (sqrt(tmp * emp[j]) + 0.5); if (x * x == tmp * emp[j]) key = 0, num[j]++; } if (key) ++tot, num[tot] = 1, emp[tot] = tmp; } dp[0][0] = 1; int m = 0; for (int i = 1; i <= tot; i++) { for (int j = 0; j <= n - 1 && j <= m + 1; j++) { if (dp[i - 1][j] == 0) continue; for (int k = 1; k <= num[i]; k++) { long long tmp = dp[i - 1][j] * C[num[i] - 1][k - 1] % mod; for (int p = 0; p <= k && p <= j + num[i] - k; p++) { long long temp = tmp * C[j][p] % mod; dp[i][j + num[i] - k - p] = (dp[i][j + num[i] - k - p] + temp * C[m + 1 - j][k - p] % mod) % mod; } } } m += num[i]; } long long ans = dp[tot][0]; for (int i = 1; i <= tot; i++) ans = ans * Fact[num[i]] % mod; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, p, q, maxx, max_cost, minn, min_cost, t, nok, a1, b1; cin >> n >> a >> b >> p >> q; if (p > q) { max_cost = p; maxx = a; minn = b; min_cost = q; } else { max_cost = q; maxx = b; minn = a; min_cost = p; } a1 = maxx; b1 = minn; while (b1 > 0) { t = b1; b1 = a1 % b1; a1 = t; } nok = a * b / a1; cout << ((n / maxx) * max_cost + (n / minn - n / nok) * min_cost); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class A, class B> A cvt(B x) { stringstream ss; ss << x; A y; ss >> y; return y; } int n, a, b, t; string s; int solve() { int tb = 0; vector<int> tm; for (int k = n; k >= 1; k--) { tb += a; if (s[k - 1] != h ) tb += b; tb += 1; tm.push_back(tb); } int best = 0; int t1 = 0; for (int k = 1; k <= n; k++) { if (k != 1) t1 += a; if (s[k - 1] != h ) t1 += b; t1 += 1; if (t1 > t) break; int t2 = t - t1 - (k - 1) * a; int l = lower_bound(tm.begin(), tm.end(), t2 + 1) - tm.begin(); best = max(best, min(k + l, n)); } return best; } int main() { cin >> n >> a >> b >> t >> s; int s1 = solve(); reverse(s.begin() + 1, s.end()); int s2 = solve(); cout << max(s1, s2) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[105][105]; int sz[105]; vector<int> g[105]; int usd[30]; int ord[30], szo = 0, din[30]; bool dfs(int v) { usd[v] = 1; for (int i = 0; i < g[v].size(); ++i) { int u = g[v][i]; if (usd[u] == 1) return false; else if (!usd[u]) if (!dfs(u)) return false; } usd[v] = 2; ord[szo++] = v; return true; } int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { scanf( %s , s[i]); sz[i] = strlen(s[i]); } for (int i = 1; i < n; ++i) { int j, mn = min(sz[i], sz[i - 1]); for (j = 0; j < mn; ++j) if (s[i][j] != s[i - 1][j]) { g[s[i - 1][j] - a ].push_back(s[i][j] - a ); din[s[i][j] - a ]++; break; } if (j == mn && sz[i] == mn) { cout << Impossible n ; return 0; } } for (int i = 0; i < 26; ++i) if (din[i] == 0) if (!dfs(i)) { cout << Impossible n ; return 0; } if (szo < 26) { cout << Impossible n ; return 0; } for (int i = szo - 1; i >= 0; --i) printf( %c , ord[i] + a ); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[200], b[200]; int check(int n, int d, int a[]) { for (int i = 1; i <= n; ++i) { int flag = 0; for (int v = 1; v <= 100; ++v) if (a[v] >= d) { a[v] -= d; flag = 1; break; } if (flag == 0) return 0; } return 1; } int main() { cin >> n >> m; for (int i = 0; i < m; ++i) { cin >> b[i]; } int ans = 0; int l = 1, r = m; while (l <= r) { memset(a, 0, sizeof(a)); for (int i = 0; i < m; ++i) a[b[i]]++; int k = (l + r) / 2; if (check(n, k, a)) { ans = max(ans, k); l = k + 1; } else r = k - 1; } memset(a, 0, sizeof(a)); for (int i = 0; i < m; ++i) a[b[i]]++; if (check(n, l, a)) ans = max(ans, l); memset(a, 0, sizeof(a)); for (int i = 0; i < m; ++i) a[b[i]]++; if (check(n, r, a)) ans = max(ans, r); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void getint(int &v) { char ch, fu = 0; for (ch = * ; (ch < 0 || ch > 9 ) && ch != - ; ch = getchar()) ; if (ch == - ) fu = 1, ch = getchar(); for (v = 0; ch >= 0 && ch <= 9 ; ch = getchar()) v = v * 10 + ch - 0 ; if (fu) v = -v; } int main() { int maxmax = 0, max, x, sum = 0, n, m; long long int sumsum = 0; getint(n); if (n == 1) printf( %d n , 0), exit(0); for (int i = 0; i < n; ++i) { getint(m); max = 0; for (int j = 0; j < m; ++j) { getint(x); if (x > max) max = x; } sumsum += (long long)max * m; sum += m; if (max > maxmax) maxmax = max; } printf( %lld n , (long long)sum * (long long)maxmax - sumsum); } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; long long gcd(long long x, long long y) { if (x > y) swap(x, y); if (x == 0) return y; if (y % x == 0) return x; return gcd(y % x, x); } int main() { long long n, k, t; long long m, d, w, g; long long x, y, z; long long s, ans; bool v = true; ans = 0; scanf( %lld , &t); for (long long tt = 0; tt < (long long)(t); tt++) { scanf( %lld %lld %lld , &m, &d, &w); if ((m == 1) || (d == 1)) { printf( 0 n ); continue; } g = gcd(d - 1, w); k = w / g; x = min(m, d); y = x % k; x = x / k; s = (x + 1) * x; s /= 2; ans = s * y; s = x * (x - 1); s /= 2; ans += (s * (k - y)); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007ll; long long s[1000010]; int h[1000010]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &h[i]); h[i]--; } s[2] = min(h[1], h[2]); for (int i = 2; i < n; i++) s[i + 1] = (s[i] * min(h[i - 1], min(h[i], h[i + 1])) % mod + min(h[i], h[i + 1])) % mod; long long ans = 0; for (int i = 1; i <= n; i++) ans = (ans + h[i]) % mod; for (int i = 2; i <= n; i++) ans = (ans + min(h[i - 1], h[i]) * s[i] % mod) % mod; printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a; char str[100002]; int sum[100002]; int cnt[100002]; int main() { scanf( %d n , &a); gets(str); int len = strlen(str); sum[0] = (str[0] - 0 ); for (int i = 1; i < len; i++) { sum[i] = sum[i - 1] + (str[i] - 0 ); } int id, x, y, mx = 0; for (int i = 0; i < len; i++) { for (int j = i; j < len; j++) { if (i > 0) id = sum[j] - sum[i - 1]; else id = sum[j]; cnt[id]++; mx = max(mx, id); } } long long ans = 0; for (int i = 0; i < len; i++) { for (int j = i; j < len; j++) { if (i > 0) x = sum[j] - sum[i - 1]; else x = sum[j]; if (a == 0) { ans += cnt[0]; } if (x == 0) continue; if (a % x != 0) continue; y = a / x; if (y > mx) continue; ans = ans + (long long)(cnt[y]); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (-1u) / 2; const long long int INF2 = (-1ull) / 2; int a, b, i, d[1011000], j, k, n, m, timer = 0, l, r, x, y; int c[1011000], cnt = 0, fl = 0, a2, a3 = -1000000, ans = 0; pair<int, int> p[100100]; int main() { ios_base::sync_with_stdio(0); cin >> n >> a >> b; for (i = 0; i < n; i++) { cin >> l; if (b < a) p[i] = make_pair(l, i); else p[i] = make_pair(l, i * -1); } sort(p, p + n); for (i = n - 1; i >= n - min(a, b); i--) { if (a > b) c[abs(p[i].second)] = 2; else c[abs(p[i].second)] = 1; } for (i = 0; i < n; i++) { if (a == b) { if (i < a) cout << 1 ; else cout << 2 ; } else { if (a > b && c[i] == 0) c[i] = 1; else if (a < b && c[i] == 0) c[i] = 2; cout << c[i] << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; using ll = long long; using llu = long long unsigned; using ld = long double; const ld EPS = 1e-9; inline int cmp(ld first, ld second = 0, ld tol = EPS) { return (first <= second + tol) ? (first + tol < second) ? -1 : 0 : 1; } const int MOD = 1; inline int mod(ll first, int m = MOD) { return (int)(((first % m) + m) % m); } const int P = 1e5 + 100; ll n; bool not_prime[P]; vector<int> primes; int main() { not_prime[0] = not_prime[1] = true; for (int i = 2; i * i < P; i++) { if (!not_prime[i]) for (int j = i * i; j < P; j += i) not_prime[j] = true; } for (int i = 2; i < P; i++) if (!not_prime[i]) primes.push_back(i); scanf( %lld , &n); bool isPrime = true; int pos; for (int i = 0; i < ((int)(primes).size()); i++) if (n % primes[i] == 0) { isPrime = false; pos = (primes[i] - 3) / 2; break; } if (isPrime) printf( 1 n ); else if (n % 2 == 0 or n % 3 == 0) printf( %lld n , n / 2); else printf( %lld n , (n / 2) - pos); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.