func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7, N = 100007; int n; long long ts, tf, t, a[N], ans = (long long)1e18, id; int main() { cin >> ts >> tf >> t; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; while (a[n] > tf - t) n--; a[++n] = tf - t + 1; long long cur = 0; for (int i = 1; i <= n; i++) { cur = max(cur, ts); if (ans > cur - (a[i] - 1)) { ans = cur - (a[i] - 1); id = a[i] - 1; } if (cur < a[i]) { cout << cur; return 0; } cur = max(cur, a[i]); cur += t; if (cur >= tf - t + 1) break; } cout << id; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; int n, m, q; long long suma[N], b[N], sumb[N]; long long solve(long long x) { int pos = lower_bound(sumb + n, sumb + m + 1, x) - sumb; if (pos > m) return x - sumb[m]; if (pos == n) return sumb[pos] - x; return min(x - sumb[pos - 1], sumb[pos] - x); } int main() { scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= n; i++) { scanf( %lld , &suma[i]); if (i & 1) suma[i] = suma[i - 1] + suma[i]; else suma[i] = suma[i - 1] - suma[i]; } for (int i = 1; i <= m; i++) { scanf( %lld , &b[i]); } for (int i = 1; i <= n; i++) { if (i & 1) sumb[i] = sumb[i - 1] + b[i]; else sumb[i] = sumb[i - 1] - b[i]; } int f = -1; if (n & 1) f = 1; for (int i = 1; i <= m - n; i++) { sumb[i + n] = -(sumb[i + n - 1] - b[i]) + b[i + n] * f; } sort(sumb + n, sumb + m + 1); long long a = suma[n]; printf( %lld n , solve(a)); for (int i = 1; i <= q; i++) { int l, r, x; scanf( %d %d %d , &l, &r, &x); if ((r - l + 1) & 1) { if (l & 1) a += x; else a -= x; } printf( %lld n , solve(a)); } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; int n; char s1[maxn], s2[maxn]; int main() { scanf( %d%s%s , &n, s1 + 1, s2 + 1); reverse(s1 + 1, s1 + n); for (int i = 1; i < n; ++i) { if (s1[i] == N ) s1[i] = S ; else if (s1[i] == S ) s1[i] = N ; else if (s1[i] == W ) s1[i] = E ; else s1[i] = W ; } unsigned long long h1 = 0, h2 = 0, fa = 1; for (int i = 1; i < n; ++i) { h1 = h1 + s1[i] * fa; h2 = h2 * 233u + s2[n - i]; fa *= 233u; if (h1 == h2) return puts( NO ), 0; } puts( YES ); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct point { int x, y, a, b; }; point rotate(point p) { point p1 = p; int x = p1.x - p1.a, y = p1.y - p1.b; p1.x = -y + p1.a; p1.y = x + p1.b; return p1; } bool comp(point p1, point p2) { if (p1.x == p2.x) return p1.y < p2.y; return p1.x < p2.x; } bool issq(point p[]) { sort(p, p + 4, comp); if (p[0].x == p[3].x && p[0].y == p[3].y) return false; if (p[0].x == p[1].x && p[0].y == p[1].y) return false; int d11 = (p[0].x - p[1].x) * (p[0].x - p[1].x) + (p[0].y - p[1].y) * (p[0].y - p[1].y); int d22 = (p[0].x - p[2].x) * (p[0].x - p[2].x) + (p[0].y - p[2].y) * (p[0].y - p[2].y); int d1 = (p[0].x - p[3].x) * (p[0].x - p[3].x) + (p[0].y - p[3].y) * (p[0].y - p[3].y); int d2 = (p[1].x - p[2].x) * (p[1].x - p[2].x) + (p[1].y - p[2].y) * (p[1].y - p[2].y); if (p[0].x + p[3].x == p[1].x + p[2].x && p[0].y + p[3].y == p[1].y + p[2].y && d11 == d22 && d1 == d2) return true; return false; } int main() { int n; cin >> n; while (n--) { point p[4]; for (int i = 0; i < 4; i++) cin >> p[i].x >> p[i].y >> p[i].a >> p[i].b; int ans = 17; for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { for (int k = 0; k < 4; k++) { for (int l = 0; l < 4; l++) { point pc[4]; for (int il = 0; il < 4; il++) pc[il] = p[il]; if (issq(pc)) ans = min(ans, i + j + k + l); p[3] = rotate(p[3]); } p[2] = rotate(p[2]); } p[1] = rotate(p[1]); } p[0] = rotate(p[0]); } if (ans == 17) cout << -1; else cout << ans; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; string s; cin >> n >> s; n += 3; vector<int> a(n), la(n), ra(n), lmi(n), lma(n), rmi(n), rma(n); int j = 2; for (int i = 0; i < n - 3; i++) { if (s[i] == ( ) { a[j] = 1; } else if (s[i] == ) ) { a[j] = -1; } else if (s[i] == R ) { j++; } else if (s[i] == L ) { j--; j = max(j, 2); } else { a[j] = 0; } la[j] = la[j - 1] + a[j]; ra[j] = ra[j + 1] - a[j]; lmi[j] = min(lmi[j - 1], la[j]); lma[j] = max(lma[j - 1], la[j]); rmi[j] = min(rmi[j + 1], ra[j]); rma[j] = max(rma[j + 1], ra[j]); if (lmi[j] >= 0 && rmi[j + 1] >= 0 && la[j] == ra[j + 1]) { cout << max(lma[j], rma[j + 1]) << ; } else { cout << -1 ; } } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; ; const long long maxn = 1e5 + 7; const long double pi = 3.14159265358979323846; struct pirog { long long r; long long h; long long i; }; long long V[4 * maxn]; pirog A[maxn]; vector<pirog> C; void update(long long v, long long tl, long long tr, long long i, long long color) { if (tl == tr) { V[v] = color; return; } long long tm = (tl + tr) / 2; if (tm >= i) { update(2 * v, tl, tm, i, color); } else { update(2 * v + 1, tm + 1, tr, i, color); } V[v] = max(V[2 * v], V[2 * v + 1]); } long long mx(long long v, long long tl, long long tr, long long l, long long r) { if (tl > r || l > tr) { return 0; } if (tl == l && tr == r) { return V[v]; } long long tm = (tl + tr) / 2; return max(mx(2 * v, tl, tm, l, min(tm, r)), mx(2 * v + 1, tm + 1, tr, max(l, tm + 1), r)); } bool cmp(pirog a, pirog b) { return a.h * a.r * a.r < b.h * b.r * b.r; } long long X[maxn]; int main() { long long q, w, e, k, n; cin >> n; cout << fixed << setprecision(10); for (q = 0; q < n; q++) { cin >> A[q].r >> A[q].h; A[q].i = q; C.push_back(A[q]); } sort(C.begin(), C.end(), cmp); long long l = 0; for (q = 0; q < n; q++) { long long x = mx(1, 0, n - 1, 0, C[q].i) + C[q].h * C[q].r * C[q].r; X[q] = x; if (C[q].r * C[q].r * C[q].h == C[q + 1].r * C[q + 1].r * C[q + 1].h) { continue; } for (w = l; w <= q; w++) { update(1, 0, n - 1, C[w].i, X[w]); } l = q + 1; } cout << mx(1, 0, n - 1, 0, n - 1) * pi; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; int main() { int flag = 0; long long n, a, b; cin >> n >> a >> b; long long x = a, y = b; if (a > b) { swap(a, b); flag = 1; } if (a * b > 6 * n) { printf( %lld n , a * b); printf( %lld %lld n , a, b); return 0; } long long ans = 0x3f3f3f3f3f3f3f3f, l = 0, r = 0; long long len = sqrt(6 * n) + 1; for (int i = a; i <= len + 5; i++) { if (6 * n % i == 0 && 6 * n / i >= b) { l = i; r = 6 * n / i; break; } y = 6 * n / i + 1; y = max(y, b); if (i * y < ans) { l = i; r = y; ans = l * r; } } if (flag) swap(l, r); printf( %lld n , l * r); printf( %lld %lld n , l, r); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 7; const int inf = 0x3f3f3f3f; int a[maxn]; char s[150]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; scanf( %s , s); int x = 0, y = 0; for (int i = 0; i < n; i++) { if (s[i] == < ) x++; else break; } for (int i = n - 1; i >= 0; i--) { if (s[i] == > ) y++; else break; } cout << min(x, y) << endl; } return 0; }
|
#include <bits/stdc++.h> void print(int n) { if (n == 4) { printf( 1 * 2 = 2 n ); printf( 3 * 4 = 12 n ); printf( 2 * 12 = 24 n ); } else if (n == 5) { printf( 5 * 4 = 20 n ); printf( 3 + 2 = 5 n ); printf( 5 - 1 = 4 n ); printf( 20 + 4 = 24 n ); } } int main() { int n; while (~scanf( %d , &n)) { if (n <= 3) { printf( NO n ); continue; } printf( YES n ); if (n == 4) print(4); else if (n == 5) print(5); else if (n % 2) { print(5); for (int i = n; i > 5; i = i - 2) { printf( %d - %d = 1 n , i, i - 1); printf( 24 * 1 = 24 n ); } } else { print(4); for (int i = n; i > 4; i = i - 2) { printf( %d - %d = 1 n , i, i - 1); printf( 24 * 1 = 24 n ); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 666; const int inf = 1e9; struct edge { int pr; int to; int cap; } e[111111]; int tot = 1, la[N]; void clr() { tot = 1; memset(la, 0, sizeof(la)); } void adde(int x, int y, int z) { e[++tot].pr = la[x]; la[x] = tot; e[tot].to = y; e[tot].cap = z; } void addf(int x, int y, int z = inf) { adde(x, y, z); adde(y, x, 0); } int d[N]; int bfs(int s, int t) { queue<int> Q; int i, x, y; memset(d, 0, sizeof(d)); d[s] = 1; Q.push(s); while (!Q.empty()) { x = Q.front(); Q.pop(); for (i = la[x]; i; i = e[i].pr) { if (!e[i].cap) continue; y = e[i].to; if (!d[y]) { d[y] = d[x] + 1; Q.push(y); } } } return d[t]; } int dfs(int s, int t, int f) { if (s == t) return f; int i, x, y, r = 0; for (i = la[s]; i; i = e[i].pr) { if (!e[i].cap || !f) continue; y = e[i].to; if (d[y] != d[s] + 1) continue; x = dfs(y, t, min(f, e[i].cap)); if (x) { f -= x; r += x; e[i].cap -= x; e[i ^ 1].cap += x; } } if (!r) d[s] = 0; return r; } int maxflow(int s, int t) { int x, r = 0; while (bfs(s, t)) { x = dfs(s, t, inf); if (x) r += x; else break; } return r; } int vis[N], w[N]; bool hungary(int x) { int i, y; for (i = la[x]; i; i = e[i].pr) { y = e[i].to; if (!vis[y]) { vis[y] = 1; if (!w[y] || hungary(w[y])) { w[y] = x; return true; } } } return false; } int n, a[N][N]; int main() { int i, j, o, s, t, ans; scanf( %d , &n); clr(); for (i = 1; i <= n; i = i + 1) { scanf( %d , &o); while (o--) { scanf( %d , &j); a[i][j] = 1; adde(i, j, 0); } } for (i = 1; i <= n; i = i + 1) { memset(vis, 0, sizeof(vis)); hungary(i); } clr(); s = 0, t = n + 1; for (i = 1; i <= n; i = i + 1) for (j = 1; j <= n; j = j + 1) if (a[i][j]) addf(i, w[j]); ans = 0; for (i = 1; i <= n; i = i + 1) { scanf( %d , &o); if (o > 0) addf(i, t, o); else { ans += o; addf(s, i, -o); } } printf( %d , ans + maxflow(s, t)); return 0; }
|
#include <bits/stdc++.h> int main() { int x, h, m, hh, mm; scanf( %d , &x); scanf( %d%d , &h, &m); hh = h, mm = m; for (int i = 0; i <= 24 * 60; i++) { int tmp = x * i; h = hh, m = mm; while (m < tmp) { m += 60; h--; if (h == -1) h = 23; } m -= tmp; if (m % 10 == 7 || m / 10 == 7 || h % 10 == 7 || h / 10 == 7) { printf( %d n , i); return 0; } } }
|
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } template <class T> T my_pow(T n, T p) { if (p == 0) return 1; T x = my_pow(n, p / 2); x = (x * x); if (p & 1) x = (x * n); return x; } template <class T> T big_mod(T n, T p, T m) { if (p == 0) return (T)1; T x = big_mod(n, p / 2, m); x = (x * x) % m; if (p & 1) x = (x * n) % m; return x; } template <class T> inline T Mod(T n, T m) { return (n % m + m) % m; } template <class T> T extract(string s, T ret) { stringstream ss(s); ss >> ret; return ret; } template <class T> string itos(T n) { ostringstream ost; ost << n; ost.flush(); return ost.str(); } long long stoi(string s) { long long r = 0; istringstream sin(s); sin >> r; return r; } double toDouble(string s) { double r = 0; istringstream sin(s); sin >> r; return r; } long long ar[2000005], ar1[200005]; long long a = 0, b = 0, c = 0, r = 0, rr = 0, res = 0, n, m; string s, ss; long long fun(long long val) { r = 0; for (__typeof(n) i = 0; i < (n); i++) { if (val < ar[i]) return false; r += (val - ar[i]); } if (r >= val) return true; else return false; } int main() { cin >> n; for (__typeof(n) i = 0; i < (n); i++) { cin >> ar[i]; } long long lo = 0, hi = 10000000000ll; while (hi - lo > 1) { long long mid = (lo + hi) >> 1; if (fun(mid)) hi = mid; else lo = mid; } cout << hi; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, x, i, a[100100], b[100100]; priority_queue<pair<long long, int>> q; long long m, mx, mn, cur, cnt, le, ri, h; int fnd(int i, long long v) { int lft = 0, rgh = a[i]; while (lft < rgh) { int mid = (lft + rgh) / 2 + 1; cur = a[i] - 3LL * mid * (mid + 1LL) - 1LL; if (cur < v) rgh = mid - 1; else lft = mid; } return rgh; } int main() { scanf( %d%I64d , &n, &m); for (i = 0; i < n; i++) { scanf( %d , &a[i]); q.push({a[i] - 1LL, i}); cur = a[i] - 3LL * a[i] * (a[i] + 1LL) - 1LL; if (i) { mn = min(mn, cur); mx = max(mx, a[i] - 1LL); } else { mn = cur; mx = a[i] - 1LL; } } le = 0; ri = mx - mn; while (le < ri) { h = (le + ri) / 2; for (cnt = i = 0; i < n; i++) cnt += fnd(i, mx - h); if (cnt < m) le = h + 1; else ri = h; } for (i = 0; i < n; i++) { b[i] = fnd(i, mx - ri + 1); m -= b[i]; } for (i = 0; i < n && m > 0; i++) { x = min(1LL * fnd(i, mx - ri) - b[i], m); b[i] += x; m -= x; } for (i = 0; i < n; i++) printf( %d , b[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const long long INFLL = 1e18 + 1; const int MAX = 200001; const long long MOD = 1000000007; long long inq(long long k, long long q) { if (q == 0) return 1; long long l = inq(k, q / 2); if (q % 2 == 0) return l * l % MOD; else return l * l * k % MOD; } long long gcd(long long a, long long b) { if (a < b) swap(a, b); if (b == 0) return a; return gcd(b, a % b); } long long cubr(long long a) { long long l = -1, r = 1e6 + 2; while (l < r - 1) { long long mid = (l + r) / 2; if (mid * mid * mid > a) r = mid; else l = mid; } return l; } long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { return -1 * max(-a, -b); } long long possible(long long q) { if (q == INF) return -1; return q; } bool correct(int x, int xx) { if (x < 0) return 0; if (x >= xx) return 0; return 1; } long long dsumm(long long x, long long k) { long long y = 1; long long z = 0; for (int i = 0; y < 1e18; i++) { z += x / y % k; y *= k; } return z; } long long dcount(long long x) { long long y = 1; long long z = 0; int c[100]; for (int i = 0; i < 10; i++) c[i] = 0; for (int i = 0; x > 0; i++) { if (c[x / y % 10] == 0) z++; c[x / y % 10] = 1; x /= 10; } return z; } long long lg10(long long x) { if (x == 0) return 0; return lg10(x / 10) + 1; } string months[12] = { January , February , March , April , May , June , July , August , September , October , November , December }; int days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; vector<int> cx, cy; long long n, m; long long x[50]; long long y[50]; long long x2[50]; long long y2[50]; long long a[52][52]; long long b[52][52]; vector<pair<pair<int, int>, pair<int, int>>> ans1, ans2, ans3; void Move_left_p1(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (a[i1][j1] == num) { i = i1; j = j1; break; } } } while (j > 1) { if (a[i][j - 1] == 0) { ans1.push_back({{i, j}, {i, j - 1}}); j--; a[i][j] = num; a[i][j + 1] = 0; } else break; } } void Move_right_p1(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (a[i1][j1] == num) { i = i1; j = j1; break; } } } while (j < n) { if (a[i][j + 1] == 0) { ans1.push_back({{i, j}, {i, j + 1}}); j++; a[i][j] = num; a[i][j - 1] = 0; } else break; } } void Move_up_p1(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (a[i1][j1] == num) { i = i1; j = j1; break; } } } while (i > 1) { if (a[i - 1][j] == 0) { ans1.push_back({{i, j}, {i - 1, j}}); i--; a[i][j] = num; a[i + 1][j] = 0; } else break; } } void collectA() { for (int i = 1; i <= 1; i++) { for (int j = 1; j <= n; j++) { if (a[i][j] != 0) { Move_left_p1(a[i][j]); } } } for (int i = 2; i <= n; i++) { for (int j = n; j >= 1; j--) { if (a[i][j] != 0) { int id = a[i][j]; Move_right_p1(id); Move_up_p1(id); Move_left_p1(id); } } } } void Move_left_p3(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (b[i1][j1] == num) { i = i1; j = j1; break; } } } while (j > 1) { if (b[i][j - 1] == 0) { ans3.push_back({{i, j}, {i, j - 1}}); j--; b[i][j] = num; b[i][j + 1] = 0; } else break; } } void Move_right_p3(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (b[i1][j1] == num) { i = i1; j = j1; break; } } } while (j < n) { if (b[i][j + 1] == 0) { ans3.push_back({{i, j}, {i, j + 1}}); j++; b[i][j] = num; b[i][j - 1] = 0; } else break; } } void Move_up_p3(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (b[i1][j1] == num) { i = i1; j = j1; break; } } } while (i > 1) { if (b[i - 1][j] == 0) { ans3.push_back({{i, j}, {i - 1, j}}); i--; b[i][j] = num; b[i + 1][j] = 0; } else break; } } void collectB() { for (int i = 1; i <= 1; i++) { for (int j = 1; j <= n; j++) { if (b[i][j] != 0) { Move_left_p3(b[i][j]); } } } for (int i = 2; i <= n; i++) { for (int j = n; j >= 1; j--) { if (b[i][j] != 0) { int id = b[i][j]; Move_right_p3(id); Move_up_p3(id); Move_left_p3(id); } } } } void Move_right_p2(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (a[i1][j1] == num) { i = i1; j = j1; break; } } } while (j < n) { if (a[i][j + 1] == 0) { ans2.push_back({{i, j}, {i, j + 1}}); j++; a[i][j] = num; a[i][j - 1] = 0; } else break; } } void Move_left_p2(int num) { int i = 0; int j = 0; for (int i1 = 1; i1 <= n; i1++) { for (int j1 = 1; j1 <= n; j1++) { if (a[i1][j1] == num) { i = i1; j = j1; break; } } } while (j > 1) { if (a[i][j - 1] == 0) { ans2.push_back({{i, j}, {i, j - 1}}); j--; a[i][j] = num; a[i][j + 1] = 0; } else break; } } void Move_right_all(int line) { for (int i = n; i >= 1; i--) { if (a[line][i] != 0) { int id = a[line][i]; Move_right_p2(id); } } } void Push(int id) { for (int i = 1; i <= n; i++) { if (a[2][i] == id) { a[1][i] = id; a[2][i] = 0; ans2.push_back({{2, i}, {1, i}}); Move_left_p2(id); } } } void reOrder() { for (int i = 1; i <= m; i++) { a[2][i] = a[1][i]; a[1][i] = 0; ans2.push_back({{1, i}, {2, i}}); } Move_right_all(2); for (int i = 1; i <= m; i++) { int id = b[1][i]; Push(id); Move_right_all(2); } } int main() { cin >> n >> m; if (n == 1) { cout << 0; return 0; } for (int(i) = 0; (i) != (m); i++) { cin >> x[i] >> y[i]; a[x[i]][y[i]] = i + 1; } collectA(); for (int(i) = 0; (i) != (m); i++) { cin >> x2[i] >> y2[i]; b[x2[i]][y2[i]] = i + 1; } collectB(); reOrder(); if (ans1.size() + ans2.size() + ans3.size() < 10800) { cout << ans1.size() + ans2.size() + ans3.size() << n ; for (int(i) = 0; (i) != (ans1.size()); i++) { cout << ans1[i].first.first << << ans1[i].first.second << << ans1[i].second.first << << ans1[i].second.second << n ; } for (int(i) = 0; (i) != (ans2.size()); i++) { cout << ans2[i].first.first << << ans2[i].first.second << << ans2[i].second.first << << ans2[i].second.second << n ; } for (int(i) = (ans3.size()) - 1; (i) != -1; i--) { cout << ans3[i].second.first << << ans3[i].second.second << << ans3[i].first.first << << ans3[i].first.second << n ; } } else { for (int i = 1; i <= 50; i++) { for (int j = 1; j <= 50; j++) { a[i][j] = 0; b[i][j] = 0; } } ans1.resize(0); ans2.resize(0); ans3.resize(0); for (int(i) = 0; (i) != (m); i++) { a[n + 1 - x[i]][y[i]] = i + 1; } collectA(); for (int(i) = 0; (i) != (m); i++) { b[n + 1 - x2[i]][y2[i]] = i + 1; } collectB(); reOrder(); if (ans1.size() + ans2.size() + ans3.size() < 10800) { cout << ans1.size() + ans2.size() + ans3.size() << n ; for (int(i) = 0; (i) != (ans1.size()); i++) { cout << n + 1 - ans1[i].first.first << << ans1[i].first.second << << n + 1 - ans1[i].second.first << << ans1[i].second.second << n ; } for (int(i) = 0; (i) != (ans2.size()); i++) { cout << n + 1 - ans2[i].first.first << << ans2[i].first.second << << n + 1 - ans2[i].second.first << << ans2[i].second.second << n ; } for (int(i) = (ans3.size()) - 1; (i) != -1; i--) { cout << n + 1 - ans3[i].second.first << << ans3[i].second.second << << n + 1 - ans3[i].first.first << << ans3[i].first.second << n ; } } else { for (int i = 1; i <= 50; i++) { for (int j = 1; j <= 50; j++) { a[i][j] = 0; b[i][j] = 0; } } ans1.resize(0); ans2.resize(0); ans3.resize(0); for (int(i) = 0; (i) != (m); i++) { a[y[i]][x[i]] = i + 1; } collectA(); for (int(i) = 0; (i) != (m); i++) { b[y2[i]][x2[i]] = i + 1; } collectB(); reOrder(); if (ans1.size() + ans2.size() + ans3.size() < 10800) { cout << ans1.size() + ans2.size() + ans3.size() << n ; for (int(i) = 0; (i) != (ans1.size()); i++) { cout << ans1[i].first.second << << ans1[i].first.first << << ans1[i].second.second << << ans1[i].second.first << n ; } for (int(i) = 0; (i) != (ans2.size()); i++) { cout << ans2[i].first.second << << ans2[i].first.first << << ans2[i].second.second << << ans2[i].second.first << n ; } for (int(i) = (ans3.size()) - 1; (i) != -1; i--) { cout << ans3[i].second.second << << ans3[i].second.first << << ans3[i].first.second << << ans3[i].first.first << n ; } } else { for (int i = 1; i <= 50; i++) { for (int j = 1; j <= 50; j++) { a[i][j] = 0; b[i][j] = 0; } } ans1.resize(0); ans2.resize(0); ans3.resize(0); for (int(i) = 0; (i) != (m); i++) { a[n + 1 - y[i]][x[i]] = i + 1; } collectA(); for (int(i) = 0; (i) != (m); i++) { b[n + 1 - y2[i]][x2[i]] = i + 1; } collectB(); reOrder(); if (ans1.size() + ans2.size() + ans3.size() < 10800) { cout << ans1.size() + ans2.size() + ans3.size() << n ; for (int(i) = 0; (i) != (ans1.size()); i++) { cout << n + 1 - ans1[i].first.second << << ans1[i].first.first << << n + 1 - ans1[i].second.second << << ans1[i].second.first << n ; } for (int(i) = 0; (i) != (ans2.size()); i++) { cout << n + 1 - ans2[i].first.second << << ans2[i].first.first << << n + 1 - ans2[i].second.second << << ans2[i].second.first << n ; } for (int(i) = (ans3.size()) - 1; (i) != -1; i--) { cout << n + 1 - ans3[i].second.second << << ans3[i].second.first << << n + 1 - ans3[i].first.second << << ans3[i].first.first << n ; } } } } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int n, m, arr[303][303]; scanf( %d %d , &n, &m); bool can = true; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , &arr[i][j]); if (i == 0 || i == n - 1) { if (j > 0 && j < m - 1) { if (arr[i][j] > 3) can = false; arr[i][j] = 3; } else { if (arr[i][j] > 2) can = false; arr[i][j] = 2; } } else if (j == 0 || j == m - 1) { if (i > 0 && i < n - 1) { if (arr[i][j] > 3) can = false; arr[i][j] = 3; } else { if (arr[i][j] > 2) can = false; arr[i][j] = 2; } } else { if (arr[i][j] > 4) can = false; arr[i][j] = 4; } } } if (!can) { printf( NO n ); continue; } printf( YES n ); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { printf( %d%c , arr[i][j], j >= m - 1 ? n : ); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int>> g, sg; vector<bool> vis; void dfs(int u) { vis[u] = 1; for (int v : g[u]) { if (!vis[v]) { sg[u].push_back(v); sg[v].push_back(u); dfs(v); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; g.resize(n); sg.resize(n); for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; v--; g[u].push_back(v); g[v].push_back(u); } vis.assign(n, 0); dfs(0); auto find_path = [&](int u, int v) { swap(u, v); queue<int> qu; vector<int> p(n, -1); vis.assign(n, 0); vis[u] = 1; qu.push(u); while (!qu.empty()) { int x = qu.front(); qu.pop(); for (int y : sg[x]) { if (!vis[y]) { vis[y] = 1; qu.push(y); p[y] = x; } } } vector<int> ret; for (int x = v; x != u; x = p[x]) { ret.push_back(x); } ret.push_back(u); return ret; }; int q; cin >> q; vector<pair<int, int>> queries(q); vector<int> deg(n, 0); vector<vector<int>> ans(q); for (int i = 0; i < q; i++) { int u, v; cin >> u >> v; u--; v--; deg[u]++; deg[v]++; queries[i] = {u, v}; ans[i] = find_path(u, v); } int cnt_odd = 0; for (int u = 0; u < n; u++) cnt_odd += deg[u] % 2; if (cnt_odd) { cout << NO n << cnt_odd / 2 << n ; } else { cout << YES n ; for (auto v : ans) { cout << v.size() << n ; for (int x : v) cout << x + 1 << ; cout << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<set<int> > graph; vector<int> eliminar; set<int>::iterator ite; void elim(int N) { eliminar.clear(); for (int i = 1; i <= N; i++) if (graph[i].size() == 1) eliminar.push_back(i); } int main() { int n, m, n1, n2, temp, contador; cin >> n >> m; contador = 0; graph.resize(n + 10); while (m--) { cin >> n1 >> n2; graph[n1].insert(n2); graph[n2].insert(n1); } elim(n); while (!eliminar.empty()) { for (int i = 0; i < eliminar.size(); i++) { graph[eliminar[i]].clear(); for (int j = 1; j <= n; j++) if (graph[j].find(eliminar[i]) != graph[j].end()) graph[j].erase(eliminar[i]); } contador++; elim(n); } cout << contador << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, a, b, c, f = 0; int main() { cin >> n >> a >> b >> c; for (int i = 0; i <= c; i++) { for (int j = 0; j <= b; j++) { if (n - j - 2 * i >= 0 && n - j - 2 * i <= a / 2) { f++; } } } cout << f; }
|
#include <bits/stdc++.h> using namespace std; int main() { int i, n, flag = 0; cin >> n; int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) flag = 1; } if (flag) cout << -1 << endl; else cout << 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int a[MAXN]; int main() { int n, tot = 0, flag = -1, num = 0; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); sort(a, a + n); for (int i = 0; i < n - 1; ++i) { if (i != 0 && a[i] == a[i + 1] && a[i - 1] == a[i] - 1) flag = 1; if (a[i] == a[i + 1]) num++; tot += a[i] - i; } tot += a[n - 1] - (n - 1); if (num >= 2) flag = 1; if (a[0] == 0 && a[1] == 0) flag = 1; if (flag == -1) { if (tot % 2 == 0) flag = 1; else flag = 0; } if (flag) printf( cslnb ); else printf( sjfnb ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename S, typename T> ostream& operator<<(ostream& out, pair<S, T> const& p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T> ostream& operator<<(ostream& out, vector<T> const& v) { int l = v.size(); for (int i = 0; i < l - 1; i++) out << v[i] << ; if (l > 0) out << v[l - 1]; return out; } long long n; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; if (n == 0) { cout << 0 0 << endl; return 0; } long long lo = 0, hi = 600000000, mid; while (lo + 1 < hi) { mid = (lo + hi) / 2; if (1 + (mid * (mid + 1)) * 3 <= n + 1) lo = mid; else hi = mid; } long long x, y; if (lo == 0) { x = 2, y = 0; lo++; } else { n -= (lo * (lo + 1) * 3); lo++; x = 2 * (lo), y = 0; } if (n == 0) { x -= 2; } for (int i = 0; i < 6 and n > 0; i++) { if (lo <= n) { if (i == 0) { x -= lo; y += 2 * lo; } else if (i == 1) { x -= 2 * lo; } else if (i == 2) { x -= lo; y -= 2 * lo; } else if (i == 3) { x += lo; y -= 2 * lo; } else if (i == 4) { x += 2 * lo; } else if (i == 5) { x += lo; y += 2 * lo; } n -= lo; } else { lo = n; if (i == 0) { x -= lo; y += 2 * lo; } else if (i == 1) { x -= 2 * lo; } else if (i == 2) { x -= lo; y -= 2 * lo; } else if (i == 3) { x += lo; y -= 2 * lo; } else if (i == 4) { x += 2 * lo; } else if (i == 5) { x += lo; y += 2 * lo; } break; } } cout << x << << y << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; void dump(const vector<int>& a) { for (int i = 0; i < a.size(); i++) { cerr << a[i] << ; } cerr << endl; } vector<pair<int, int>> factorise(long long m) { vector<pair<int, int>> res; for (long long i = 2; i * i <= m; i++) { if (m % i == 0) { int cnt = 0; while (m % i == 0) { cnt++; m /= i; } res.emplace_back(i, cnt); } } return res; }; using ll = long long; ll gcd(ll a, ll b, ll& x, ll& y) { if (a == 0) { x = 0; y = 1; return b; } ll x1, y1; ll d = gcd(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } bool debug = false; using pii = pair<int, int>; using pll = pair<long long, long long>; const int magic = 3; const int INF = 1e9; void solve(); void init(); template <typename T, int N> void dump(const array<T, N>& a) { for (int i = 0; i < a.size(); i++) { cerr << a[i] << ; } cerr << endl; } int main(int argc, char** argv) { cout.precision(15); int t = 1; cin >> t; init(); for (int tt = 1; tt <= t; tt++) { solve(); } return 0; } const int MX = 100500; vector<int> delim[MX]; int p[MX]; long long troek[MX]; long long dvoek(long long n) { return n * (n + 1) / 2; } void go(int n) { auto& curr = delim[n]; int pr = p[n]; if (pr == 0) { if (n == 1) { curr = {1}; } else { curr = {1, n}; } return; } int cnt = 0; while (n % pr == 0) { n /= pr; cnt++; } curr.reserve((cnt + 1) * delim[n].size()); int mult = 1; for (int i = 0; i <= cnt; i++) { for (auto div : delim[n]) { curr.push_back(mult * div); } mult *= pr; } sort(curr.begin(), curr.end()); } void init() { for (int i = 1; i < MX; i++) { troek[i] = troek[i - 1] + dvoek(i); } for (int i = 2; i * i < MX; i++) { if (p[i] == 0) { for (int j = i; j * i < MX; j++) { p[i * j] = i; } } } for (int n = 1; n < MX; n++) { go(n); } for (int n = 1; n < MX; n++) { delim[n].push_back(int(1e9)); } } int cnt[10]; int cnt2[10]; int sum[10]; int sum2[10]; long long solve_true(int a, int b, int c) { vector<decltype(delim[a].cbegin())> x(3); x[0] = delim[a].begin(); x[1] = delim[b].begin(); x[2] = delim[c].begin(); memset(cnt, 0, sizeof(cnt)); while (true) { int z = *x[0]; for (int i = 1; i < 3; i++) { z = min(z, *x[i]); } if (z > MX) { break; } int mask = 0; for (int i = 0; i < 3; i++) { if (*x[i] == z) { mask |= 1 << i; x[i]++; } } cnt[mask]++; } for (int i = 1; i < 8; i++) { if (debug) cerr << cnt[i] << ; cnt2[i] = cnt[i] * cnt[i]; sum[i] = cnt[i] + sum[i - 1]; sum2[i] = cnt2[i] + sum2[i - 1]; } if (debug) cerr << endl; long long res = troek[cnt[7]]; res += dvoek(cnt[7]) * sum[6]; res += cnt[7] * (dvoek(cnt[3]) + dvoek(cnt[5]) + dvoek(cnt[6])); res += cnt[7] * (sum[6] * sum[6] - sum2[6]) / 2; for (int i = 0; i < 3; i++) { int bit = 1 << i; res += (cnt[bit | 1] + cnt[bit | 2] + cnt[bit | 4]) * dvoek(cnt[7 - bit]); } res += cnt[3] * cnt[5] * cnt[6]; res += (cnt[3] * cnt[5] + cnt[3] * cnt[6] + cnt[5] * cnt[6]) * (cnt[1] + cnt[2] + cnt[4]); res += (cnt[3] + cnt[5] + cnt[6]) * (cnt[1] * cnt[2] + cnt[1] * cnt[4] + cnt[2] * cnt[4]); res -= cnt[3] * cnt[1] * cnt[2] + cnt[5] * cnt[1] * cnt[4] + cnt[6] * cnt[2] * cnt[4]; res += cnt[1] * cnt[2] * cnt[4]; return res; } long long slow(int a, int b, int c) { set<vector<int>> s; for (int x = 1; x <= a; x++) { if (a % x) continue; for (int y = 1; y <= b; y++) { if (b % y) continue; for (int z = 1; z <= c; z++) { if (c % z) continue; vector<int> t = {x, y, z}; sort(begin(t), end(t)); s.insert(t); } } } return s.size(); } void stress(int n = 60) { debug = false; for (int a = 1; a <= n; a++) { for (int b = a; b <= n; b++) { for (int c = b; c <= n; c++) { if (slow(a, b, c) != solve_true(a, b, c)) { cerr << a << << b << << c << endl; cerr << slow(a, b, c) << << solve_true(a, b, c) << endl; } } } } } void solve() { int a, b, c; cin >> a >> b >> c; cout << solve_true(a, b, c) << endl; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, h[100005], p[100005], f[100005]; bool check(long long x) { int now = 1; for (int i = 1; i <= n; i++) { long long rest = x - abs(h[i] - p[now]); if (rest < 0) continue; long long nowp = p[now]; while ((p[now] <= h[i] || p[now] - nowp <= rest || 2 * (p[now] - h[i]) <= rest) && now <= m) now++; if (now == m + 1) return 1; } return now == m + 1; } int main() { scanf( %I64d%I64d , &n, &m); for (int i = 1; i <= n; i++) scanf( %I64d , &h[i]); for (int i = 1; i <= m; i++) scanf( %I64d , &p[i]); long long l = 0, r = 100000000000; while (l <= r) { long long mid = l + r >> 1; if (check(mid)) r = mid - 1; else l = mid + 1; } printf( %I64d n , l); return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[3][3], t[3][3]; vector<char> vs, vt; int main() { scanf( %s%s%s%s , s[0], s[1], t[0], t[1]); if (s[0][0] != X ) vs.push_back(s[0][0]); if (s[0][1] != X ) vs.push_back(s[0][1]); if (s[1][1] != X ) vs.push_back(s[1][1]); if (s[1][0] != X ) vs.push_back(s[1][0]); if (t[0][0] != X ) vt.push_back(t[0][0]); if (t[0][1] != X ) vt.push_back(t[0][1]); if (t[1][1] != X ) vt.push_back(t[1][1]); if (t[1][0] != X ) vt.push_back(t[1][0]); for (int i = 0; i < 3; i++) vs.push_back(vs[i]); for (int i = 0; i < 3; i++) { if (vs[i] == vt[0]) { bool ok = 1; for (int j = 0; j < 3; j++) { if (vs[i + j] != vt[j]) { ok = 0; } } printf( %s n , ok ? YES : NO ); return 0; } } }
|
#include <bits/stdc++.h> using namespace std; const int INF32 = 0x3f3f3f3f; const long long INF64 = 0x3f3f3f3f3f3f3f3f; const int mod2 = 1e9 + 9; const int mod = 1e9 + 7; const int N = 2e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k, m; long long sum = 0; cin >> n >> k >> m; vector<int> cost(k + 1); for (int i = 1; i <= k; ++i) { cin >> cost[i]; sum += cost[i]; } sort(cost.begin(), cost.end()); int ans = 0, temp, t, tm = m; for (int i = 0; i <= n && sum * i <= tm; ++i) { temp = (k + 1) * i; tm -= sum * i; for (int j = 1; j <= k && tm >= cost[j]; ++j) { t = min(tm / cost[j], n - i); temp += t; if (j == k) temp += t; tm -= t * cost[j]; } tm = m; ans = max(ans, temp); } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> int n, m, r; int mat[61][61], opt[61][61][61]; int main() { scanf( %d%d%d , &n, &m, &r); for (int i = (0); i < (n); i++) for (int j = (0); j < (n); j++) for (int k = (0); k < (n); k++) opt[i][j][k] = 1000000000; for (int k = (0); k < (m); k++) { for (int i = (0); i < (n); i++) for (int j = (0); j < (n); j++) scanf( %d , &mat[i][j]); for (int k = (0); k < (n); k++) for (int i = (0); i < (n); i++) for (int j = (0); j < (n); j++) mat[i][j] = (((mat[i][j]) < (mat[i][k] + mat[k][j])) ? (mat[i][j]) : (mat[i][k] + mat[k][j])); for (int i = (0); i < (n); i++) for (int j = (0); j < (n); j++) opt[i][j][0] = (((opt[i][j][0]) < (mat[i][j])) ? (opt[i][j][0]) : (mat[i][j])); } for (int p = (1); p < (n); p++) for (int i = (0); i < (n); i++) for (int j = (0); j < (n); j++) for (int k = (0); k < (n); k++) opt[i][j][p] = (((opt[i][j][p]) < (opt[i][k][p - 1] + opt[k][j][0])) ? (opt[i][j][p]) : (opt[i][k][p - 1] + opt[k][j][0])); while (r--) { int u, v, k; scanf( %d%d%d , &u, &v, &k); printf( %d n , opt[u - 1][v - 1][(((k) < (n - 1)) ? (k) : (n - 1))]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool DBG = 0; const int dbg = 0; using ii = pair<int, int>; using cd = int64_t; cd gcd(cd a, cd b) { return b ? gcd(b, a % b) : a; } using _LD = long double; struct ld { cd a, b; ld(cd a, cd b = 1) : a(a), b(b) { reduce(); } ld operator-() const { return {-a, b}; } ld& reduce() { if (a) { cd g = gcd(a < 0 ? -a : a, b); a /= g, b /= g; } else b = 1; return *this; } ld& operator+=(ld o) { a = a * o.b + b * o.a, b *= o.b; return reduce(); } ld& operator-=(ld o) { a = a * o.b - b * o.a, b *= o.b; return reduce(); } ld& operator*=(ld o) { a *= o.a, b *= o.b; return reduce(); } ld operator*(ld o) const { return o *= *this; } ld operator+(ld o) const { return o += *this; } ld operator-(ld o) const { ld t = *this; return t -= o; } bool operator==(ld o) const { return a * o.b == b * o.a; } bool operator<(ld o) const { return (_LD(a) / b) < (_LD(o.a) / o.b); } bool operator<=(ld o) const { return *this == o || *this < o; } bool operator>(ld o) const { return !(*this <= o); } bool operator>=(ld o) const { return !(*this < o); } operator _LD() const { return _LD(a) / b; } }; ld abs(ld a) { return {a.a < 0 ? -a.a : a.a, a.b}; } using cord = ld; using vi = vector<int>; using vii = vector<ii>; const ld eps = {0, 1}; struct po { cord X, Y; po operator-(po b) { return {X - b.X, Y - b.Y}; } po& operator-=(po b) { X -= b.X, Y -= b.Y; return *this; } po operator-() const { return {-X, -Y}; } ld cross(po b) const { return X * b.Y - Y * b.X; } bool operator<(const po& a) const { return (X == a.X) ? (Y < a.Y) : (X < a.X); } bool operator<=(const po& a) const { return (X == a.X) ? (Y <= a.Y) : (X <= a.X); } bool operator==(const po& a) const { return X == a.X && Y == a.Y; } operator complex<_LD>() const { return complex<_LD>(X, Y); } _LD arg() const { return ::arg(complex<_LD>(*this)); } }; const _LD _EPS = 1e-9; bool nb = 0; struct acmp { bool operator()(const po& a, const po& b) const { if (a == b) return 0; _LD A = a.arg(), B = b.arg(); return nb ? (A < B - _EPS) : (A < B); } } _acmp; bool argeq(po a, po b) { return (!_acmp(a, b)) && (!_acmp(b, a)); } using ms = map<po, int, acmp>; using poly = vector<po>; ld abs(po a) { return a.X * a.X + a.Y * a.Y; } using i64 = int64_t; ostream& operator<<(ostream& os, ld first) { ld t = first; t *= {1, 1}; return os << ( << i64(t.a) << / << i64(t.b) << ) ; } ostream& operator<<(ostream& os, po a) { return os << (arg(complex<_LD>(a)) * 180 / 3.14159265358979323846); } template <class T> ostream& operator<<(ostream& os, vector<T> v) { os << [ ; for (auto& V : v) os << V << , ; return os << b << ] ; } const ld ZERO = {0, 1}; int orient(po a, po b, po c) { cord r = (b - a).cross(c - a); return r == ZERO ? 0 : (r < ZERO ? -1 : 1); } const po Z = {0, 0}; int isfar(ms& m, ms::iterator it) { if (m.size() == 1) return 0; auto nx = it; ++nx; _LD theta = 0; if (nx == m.end()) nx = m.begin(), theta = 2 * 3.14159265358979323846; theta += nx->first.arg() - it->first.arg(); if (abs(theta - 3.14159265358979323846) <= 1e-8 || theta >= 3.14159265358979323846 + 1e-8) return 1; return 0; } ms::iterator prev(ms& m, ms::iterator it) { if (it == m.begin()) return --m.end(); return --it; } void insert(ms& m, po p, int& far) { if (!m.empty()) { auto it = m.find(p); if (it != m.end()) return void(++it->second); far -= isfar(m, prev(m, m.lower_bound(p))); ++m[p]; far += isfar(m, it = m.find(p)); far += isfar(m, prev(m, it)); if (far) far = 1; } else ++m[p], far = 1; } void remove(ms& m, po p, int& far) { if (m.size() == 1) { far = 1; if (!(--m[p])) m.erase(p); return; } auto it = prev(m.find(p)); far -= isfar(m, it); if (!(--m[p])) m.erase(m.find(p)); far |= isfar(m, prev(m, m.lower_bound(p))); if (far) far = 1; } struct S { int zcnt, far; int64_t ls; po z; map<po, int, acmp> ps; S(po z) : zcnt(0), far(1), ls(0), z(z) {} void insert(po p) { if (DBG) cout << inserting << p - z << endl; if ((p -= z) == Z) return void(++zcnt); auto it = ps.find(-p); if (it != ps.end()) { if (DBG) cout << ls receives << it->second << endl; ls += it->second; } else if (DBG) cout << ls receieves 0 n ; ::insert(ps, p, far); } void erase(po p) { if (DBG) cout << erasing << p - z << endl; if ((p -= z) == Z) return void(--zcnt); auto it = ps.find(-p); if (DBG) cout << ls -= ps.find( << -p << ) n ; if (it != ps.end()) { if (DBG) cout << ls loses << it->second << endl; ls -= it->second; } else if (DBG) cout << ls loses 0 n ; ::remove(ps, p, far); } int query() { if (DBG) cout << zcnt= << zcnt << ,ls= << ls << endl; if (zcnt) return 1; if (ls) return 2; int N = ps.size(); if (N < 3) return 0; return far ? 0 : 3; } }; po cnv(int s, int p, int g) { return {ld(s, s + p + g), ld(p, s + p + g)}; } int main() { if (dbg) freopen( inb.txt , r , stdin); else cin.tie(0)->sync_with_stdio(0); int s, p, g; cin >> s >> p >> g; S d(cnv(s, p, g)); int n; cin >> n; if (n <= 5000) nb = 1; char op; vector<tuple<int, int, int>> bs; for (auto i = 0; i != n; ++i) { if (DBG) cout << i= << i << endl; cin >> op; if (op == A ) { cin >> s >> p >> g; bs.emplace_back(s, p, g); d.insert(cnv(s, p, g)); } else { cin >> s; tie(s, p, g) = bs[s - 1]; d.erase(cnv(s, p, g)); } cout << d.query() << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int i, j, k, n, m, u, i1, i2, s; long long f[60][60][2], C[60][60]; inline void M(int j, int k, long long A) { A %= 1000000007; f[i][j][k] = (f[i][j][k] + A) % 1000000007; } inline long long pow(long long x, long long y) { long long an = 1; for (; y; y >>= 1) { if (y & 1) an = an * x % 1000000007; x = x * x % 1000000007; } return an; } int main() { scanf( %d%d , &n, &m); for (i = 0; i <= n; i++) { C[i][0] = 1; for (j = 1; j <= i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007; } f[1][0][0] = 1; long long P = pow(2, 1000000007 - 2); for (i = 2; i <= n; i++) { s = i == n ? 1 : i; for (j = 0; j <= i - 1; j++) { M(j + 1, 1, s * f[i - 1][j][0]); M(j, 0, s * f[i - 1][j][1]); } for (j = 1; j + 1 < i; j++) for (k = 0; k <= j; k++) for (i1 = 0; i1 <= 1; i1++) { int A = i - 1 - j; for (u = 0; u <= A; u++) for (i2 = 0; i2 <= 1; i2++) { long long B = f[j][k][i1] * C[i - 1][j] % 1000000007 * f[A][u][i2] % 1000000007 * s % 1000000007 * P % 1000000007; int C = k + u + (!i1 || !i2), D = !(i1 && i2); M(C, D, B); } } } printf( %I64d n , (f[n][m][0] + f[n][m][1]) % 1000000007); return 0; }
|
#include <bits/stdc++.h> const int MAXINT = 2147483640; const long long MAXLL = 9223372036854775800LL; const long long MAXN = 1123456; const long long MOD = 1123456769; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); srand(time(0)); vector<int> v; int n, m, i, h; char c; cin >> n; for (i = 1; i <= n; i++) { cin >> h >> c >> m; v.push_back(h * 60 + m); } sort(v.begin(), v.end()); v.push_back(24 * 60 + v[0]); int mx = 0; for (i = 1; i < v.size(); i++) { mx = max(mx, v[i] - v[i - 1] - 1); } h = mx / 60; m = mx % 60; if (h < 10) cout << 0; cout << h << : ; if (m < 10) cout << 0; cout << m << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; int N; long long arr[MAXN]; long long csum; long long nv[MAXN]; long long dp[MAXN][2]; long long gogo(long long x) { nv[0] = 0; for (int i = 0; i < N; i++) { nv[i + 1] = (nv[i] + arr[i]) % x; } for (int i = 0; i <= N; i++) { dp[i][0] = dp[i][1] = 3e18; } dp[0][0] = nv[1]; dp[0][1] = (x - nv[1]); for (int i = 1; i < N; i++) { if ((x - nv[i]) + nv[i + 1] <= arr[i]) dp[i][0] = min(dp[i][0], dp[i - 1][1] + nv[i + 1]); if (nv[i + 1] - nv[i] <= arr[i]) dp[i][0] = min(dp[i][0], dp[i - 1][0] + nv[i + 1]); if ((x - nv[i]) + (nv[i + 1] - x) <= arr[i]) dp[i][1] = min(dp[i][1], dp[i - 1][1] + (x - nv[i + 1])); dp[i][1] = min(dp[i][1], dp[i - 1][0] + (x - nv[i + 1])); } return min(dp[N - 1][1], dp[N - 1][0]); } int main() { ios_base::sync_with_stdio(0); csum = 0; cin >> N; for (int i = 0; i < N; i++) { cin >> arr[i]; csum += arr[i]; } vector<long long> v; for (long long i = 2; i < MAXN; i++) { if (csum % i == 0) { v.push_back(i); while (csum % i == 0) csum /= i; } } if (csum > 1) v.push_back(csum); long long ans = 3e18; for (long long f : v) ans = min(ans, gogo(f)); if (ans > 2e18) cout << -1 n ; else cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 200033; int n; bool col[MAXN]; struct edge { int t, nx; } E[MAXN << 1], E_[MAXN << 1]; int first[MAXN], edges_nums = 0; inline void add(int f, int t) { E[++edges_nums].t = t; E[edges_nums].nx = first[f]; first[f] = edges_nums; } int first_[MAXN], edges_nums_ = 0; inline void add_(int f, int t) { E_[++edges_nums_].t = t; E_[edges_nums_].nx = first_[f]; first_[f] = edges_nums_; } bool check[MAXN]; int nums_of_gp, bel[MAXN]; void uni(int e, int c, int fa) { int t; for (int i = first[e]; i; i = E[i].nx) { t = E[i].t; if (col[t] == c && !check[t] && t != fa) { check[t] = 1; bel[t] = nums_of_gp; uni(t, c, e); } } } int fa[MAXN]; int find(int e) { return fa[e] == e ? e : fa[e] = find(fa[e]); } void union_(int a, int b) { int e1 = find(a); int e2 = find(b); if (e1 != e2) fa[e1] = e2; } int MX, S; void dfs(int sum, int e, int fa) { if (sum > MX) { MX = sum; S = e; } int t; for (int i = first_[e]; i; i = E_[i].nx) { t = E_[i].t; if (t != fa) dfs(sum + 1, t, e); } } int main() { int a, b; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &col[i]); for (int i = 1; i < n; i++) { scanf( %d%d , &a, &b); add(a, b); add(b, a); } for (int i = 1; i <= n; i++) { fa[i] = i; if (!check[i]) { nums_of_gp++; bel[i] = nums_of_gp; uni(i, col[i], 0); } } for (int i = 1; i <= n; i++) { for (int j = first[i]; j; j = E[j].nx) { int f = bel[i]; int t = bel[E[j].t]; if (find(f) != find(t)) { union_(f, t); add_(f, t); add_(t, f); } } } dfs(0, 1, 0); MX = 0; dfs(0, S, 0); if (nums_of_gp > 1) printf( %d , (MX + 1) >> 1); else printf( 0 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; char str[100030]; int main() { while (gets(str) != NULL) { int len = strlen(str), m, n1 = 0, n2 = 0; for (int i = 0; i < len; i++) if (str[i] >= a && str[i] <= z ) n2++; else n1++; int m1 = 0, m2 = 0; m = n1; for (int i = 1; i <= len; i++) { int k = 0; if (str[i - 1] >= a && str[i - 1] <= z ) m2++; else m1++; k += n1 - m1; k += m2; if (k < m) m = k; } printf( %d n , m); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100 + 10; pair<int, int> a[MAX_N]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i].first, a[i].second = i; sort(a, a + n); int ans = 0; for (int i = 0; i < n && k >= a[i].first; i++, ans++) k -= a[i].first; cout << ans << endl; for (int i = 0; i < ans; i++) cout << a[i].second + 1 << ; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline void chkmin(T &x, T y) { if (y < x) x = y; } template <typename T> inline void chkmax(T &x, T y) { if (y > x) x = y; } template <typename T> inline T add(T x, T y) { return (x + y) % 1000000007; } template <typename T> inline T mul(T x, T y) { return 1LL * x * y % 1000000007; } template <typename T> inline T qp(T x, T n) { T ans = 1; do { if (n & 1) ans = mul(ans, x); x = mul(x, x); } while (n >>= 1); return ans; } const int SZ = 1 << 13; char buff[SZ], *pos = buff + SZ - 1; inline long long read() { long long x = 0; int f = 1, c = (++pos == buff + SZ ? fread(pos = buff, 1, SZ, stdin), *pos : *pos); for (; !isdigit(c); c = (++pos == buff + SZ ? fread(pos = buff, 1, SZ, stdin), *pos : *pos)) if (c == - ) f = -f; for (; isdigit(c); c = (++pos == buff + SZ ? fread(pos = buff, 1, SZ, stdin), *pos : *pos)) x = (x << 3) + (x << 1) + (c ^ 48); return x * f; } int n, m; int k; int a[105][105]; int dis[205][205]; int prvv[205][205]; int dp[205][1 << 7]; pair<pair<int, int>, pair<pair<int, int>, pair<int, int> > > prv[205][1 << 7]; int xx[15], yy[15]; char anss[105][105]; void print_path(int sx, int sy, int ex, int ey) { while (ex != sx || ey != sy) { anss[ex][ey] = X ; int xxx = prvv[sx * m + sy][ex * m + ey]; ex = xxx / m, ey = xxx % m; } anss[ex][ey] = X ; } void printans(int xy, int msk) { int x = xy / m, y = xy % m; if (__builtin_popcount(msk) == 1) { int lst = __builtin_ctz(msk); print_path(x, y, xx[lst], yy[lst]); return; } print_path(prv[xy][msk].second.first.first, prv[xy][msk].second.first.second, prv[xy][msk].second.second.first, prv[xy][msk].second.second.second); printans( prv[xy][msk].second.first.first * m + prv[xy][msk].second.first.second, prv[xy][msk].first.first); printans( prv[xy][msk].second.second.first * m + prv[xy][msk].second.second.second, prv[xy][msk].first.second); } const int dx[] = {0, 0, -1, 1}; const int dy[] = {-1, 1, 0, 0}; int main() { n = read(), m = read(), k = read(); for (int i = 0; i < (int)(n); ++i) for (int j = 0; j < (int)(m); ++j) a[i][j] = read(); for (int i = 0; i < (int)(k); ++i) xx[i] = read() - 1, yy[i] = read() - 1; memset(dis, 0x3f, sizeof dis); for (int sx = 0; sx < (int)(n); ++sx) for (int sy = 0; sy < (int)(m); ++sy) { priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > pq; pq.push(make_pair(a[sx][sy], make_pair(sx, sy))); dis[sx * m + sy][sx * m + sy] = a[sx][sy]; while (!pq.empty()) { pair<int, pair<int, int> > p = pq.top(); pq.pop(); int x = p.second.first, y = p.second.second; for (int i = 0; i < (int)(4); ++i) { int nx = x + dx[i], ny = y + dy[i]; if (nx < 0 || ny < 0 || nx >= n || ny >= m) continue; if (dis[sx * m + sy][nx * m + ny] > dis[sx * m + sy][x * m + y] + a[nx][ny]) { dis[sx * m + sy][nx * m + ny] = dis[sx * m + sy][x * m + y] + a[nx][ny]; prvv[sx * m + sy][nx * m + ny] = x * m + y; pq.push( make_pair(dis[sx * m + sy][nx * m + ny], make_pair(nx, ny))); } } } } memset(dp, 0x3f, sizeof dp); for (int ij = 0; ij < (int)(n * m); ++ij) for (int l = 0; l < (int)(k); ++l) dp[ij][1 << l] = dis[ij][xx[l] * m + yy[l]]; for (int msk = 0; msk < (int)(1 << k); ++msk) if (__builtin_popcount(msk) > 1) { for (int i = 0; i < (int)(n * m); ++i) { for (int msk1 = (msk - 1) & msk; msk1; msk1 = (msk1 - 1) & msk) { int msk2 = msk ^ msk1; for (int j = 0; j < (int)(n * m); ++j) { if (dp[i][msk] > dp[i][msk1] + dp[j][msk2] + dis[i][j] - a[i / m][i % m] - a[j / m][j % m]) { dp[i][msk] = dp[i][msk1] + dp[j][msk2] + dis[i][j] - a[i / m][i % m] - a[j / m][j % m]; prv[i][msk] = make_pair( make_pair(msk1, msk2), make_pair(make_pair(i / m, i % m), make_pair(j / m, j % m))); } if (dp[i][msk] > dp[j][msk1] + dp[i][msk2] + dis[i][j] - a[i / m][i % m] - a[j / m][j % m]) { dp[i][msk] = dp[j][msk1] + dp[i][msk2] + dis[i][j] - a[i / m][i % m] - a[j / m][j % m]; prv[i][msk] = make_pair( make_pair(msk1, msk2), make_pair(make_pair(j / m, j % m), make_pair(i / m, i % m))); } } } } } int ans = 1e9; int ansxy; for (int i = 0; i < (int)(n * m); ++i) if (dp[i][(1 << k) - 1] < ans) ans = dp[i][(1 << k) - 1], ansxy = i; for (int i = 0; i < (int)(n); ++i) for (int j = 0; j < (int)(m); ++j) anss[i][j] = . ; printf( %d n , ans); printans(ansxy, (1 << k) - 1); for (int i = 0; i < (int)(n); ++i) for (int j = 0; j < (int)(m); ++j) { printf( %c , anss[i][j]); if (j + 1 == m) puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool dp[105][55][210][2]; char com[105], n; int chg, off = 105; int dir(int d) { return d ? 1 : -1; } int main() { cin >> com + 1; n = strlen(com + 1); cin >> chg; memset(dp, false, sizeof(dp)); dp[0][0][off][1] = true; for (int i = 0; i < n; i++) for (int c = 0; c <= chg; c++) for (int d = 0; d < 210; d++) for (int f = 0; f < 2; f++) if (dp[i][c][d][f]) { if (com[i + 1] == T ) { for (int k = c; k <= chg; k++) { if ((k - c) & 1) dp[i + 1][k][d + dir(f)][f] = true; else dp[i + 1][k][d][f ^ 1] = true; } } else { for (int k = c; k <= chg; k++) { if (!((k - c) & 1)) dp[i + 1][k][d + dir(f)][f] = true; else dp[i + 1][k][d][f ^ 1] = true; } } } int res = 0; for (int i = 0; i < 210; i++) if (dp[n][chg][i][0] || dp[n][chg][i][1]) res = max(res, abs(i - off)); cout << res << endl; return 0; }
|
#include <bits/stdc++.h> #define ll long long int #define vi vector<ll> #define vvi vector<vector<ll>> #define pii pair<ll, ll> #define pb push_back #define rep0(i, n) for(ll i = 0;i<n;i++) #define rep1(i, n) for(ll i = 1;i<n;i++) #define all(v) v.begin(),v.end() #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); using namespace std; const int N = 1e5 + 5; void solve(){ ll n; cin >> n; vector<ll> arr(n); for(ll i=0; i<n; i++){ cin >> arr[i]; arr[i] = arr[i]-i-1; } map<ll, ll> mp; ll res = 0; for(ll i=0; i<n; i++){ if(mp[arr[i]]>0){ res += mp[arr[i]]; } mp[arr[i]]++; } cout << res << n ; } int main() { fast; int t; cin >> t; while(t--){ solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int a[100100]; int s0[100100]; int s1[100100]; vector<pair<int, int> > res; int TK1(int x, int tt) { int l = x + 1; int r = n; int res = -1; while (l <= r) { int m = (l + r) / 2; if (tt == s1[m] - s1[x]) { res = m; r = m - 1; } else if (tt < s1[m] - s1[x]) r = m - 1; else l = m + 1; } return res; } int TK2(int x, int tt) { int l = x + 1; int r = n; int res = -1; while (l <= r) { int m = (l + r) / 2; if (tt == s0[m] - s0[x]) { res = m; r = m - 1; } else if (tt < s0[m] - s0[x]) r = m - 1; else l = m + 1; } return res; } bool cmp(pair<int, int> u, pair<int, int> v) { return (u.first < v.first || ((u.first == v.first) && (u.second < v.second))); } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; s0[i] = s0[i - 1] + (a[i] == 2); s1[i] = s1[i - 1] + (a[i] == 1); } for (int t = 1; t <= n; t++) { int p1 = 0; int p2 = 0; int ans1, ans2; int pos = 0; bool co = true; int last = -1; while (true) { ans1 = TK1(pos, t); ans2 = TK2(pos, t); if (ans1 == -1 && ans2 == -1) { co = false; break; } if (ans1 == -1) { p2++; last = 2; pos = ans2; } else if (ans2 == -1) { p1++; last = 1; pos = ans1; } else { if (ans1 < ans2) { p1++; last = 1; pos = ans1; } else { p2++; last = 2; pos = ans2; } } if (pos == n) break; } if (co) { if (a[n] == 1 && p1 > p2) res.push_back(make_pair(p1, t)); if (a[n] == 2 && p2 > p1) res.push_back(make_pair(p2, t)); } } sort(res.begin(), res.end(), cmp); cout << res.size() << n ; for (int i = 0; i < res.size(); i++) cout << res[i].first << << res[i].second << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, ans, w[300000], d[300000], a, b; int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= n; i++) { w[i] = i; d[i] = 1; } ans = 1; for (int i = 1; i <= m; i++) { cin >> a >> b; while (a != w[a]) a = w[a]; while (b != w[b]) b = w[b]; if (a != b) { if (d[a] > d[b]) { w[b] = a; } else { w[a] = b; if (d[a] == d[b]) d[b]++; } } else ans = ans * 2 % 1000000009; cout << (ans + 1000000009 - 1) % 1000000009 << endl; } cin.get(); cin.get(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (1e6 + 12); const int mod = (1e9 + 7); const int INF = (0x3f3f3f3f); void solve() { string s; cin >> s; s = . + s + ? ; bool f = true; for (int j = 1; j < s.size() - 1; j++) { if (s[j] == s[j - 1] && s[j] != ? ) { f = false; break; } } if (f) { if (s[1] == ? ) { if (s[2] != ? ) { if (s[2] == c ) { s[1] = a ; } else if (s[2] == b ) { s[1] = a ; } else { s[1] = b ; } } else { s[1] = a ; } } for (int i = 2; i < s.size() - 1; i++) { if (s[i] == ? ) { if (s[i + 1] == ? ) { if (s[i - 1] == c ) { s[i] = a ; } else if (s[i - 1] == b ) { s[i] = a ; } else { s[i] = b ; } } else { if (s[i - 1] == c && s[i + 1] == a ) { s[i] = b ; } else if (s[i - 1] == c && s[i + 1] == b ) { s[i] = a ; } else if (s[i - 1] == b && s[i + 1] == c ) { s[i] = a ; } else if (s[i - 1] == b && s[i + 1] == a ) { s[i] = c ; } else if (s[i - 1] == a && s[i + 1] == b ) { s[i] = c ; } else if (s[i - 1] == a && s[i + 1] == c ) { s[i] = b ; } else if (s[i - 1] == c && s[i + 1] == c ) { s[i] = b ; } else if (s[i - 1] == b && s[i + 1] == b ) { s[i] = a ; } else if (s[i - 1] == a && s[i + 1] == a ) { s[i] = b ; } } } } for (int i = 1; i < s.size() - 1; i++) { cout << s[i]; } cout << endl; } else { cout << -1 << endl; } } int main() { int t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int luat_tot(vector<int>& attack, vector<int>& defense, multiset<int> carti); int luare(vector<int>& attack, multiset<int> carti); int main() { int n, m, c; char s[10]; vector<int> attack, defense; multiset<int> carti; cin >> n >> m; for (int i(0); i < n; i++) { cin >> s >> c; if (s[0] == A ) attack.push_back(c); else defense.push_back(c); } while (m--) { cin >> c; carti.insert(c); } sort(attack.rbegin(), attack.rend()); int r(luat_tot(attack, defense, carti)); vector<int> attack_part; while (!attack.empty()) { attack_part.push_back(attack.back()); attack.pop_back(); sort(attack_part.rbegin(), attack_part.rend()); r = max(r, luare(attack_part, carti)); } cout << r; return 0; } int luare(vector<int>& attack, multiset<int> carti) { int r(0); for (auto i : attack) { if (carti.empty()) return 0; if (*carti.rbegin() < i) return 0; r += *carti.rbegin() - i; carti.erase(carti.find(*carti.rbegin())); } return r; } int luat_tot(vector<int>& attack, vector<int>& defense, multiset<int> carti) { int r(0); for (auto i : defense) { if (carti.empty()) return 0; if (carti.upper_bound(i) == carti.end()) return 0; carti.erase(carti.upper_bound(i)); } for (auto i : attack) { if (carti.empty() || *carti.rbegin() < i) return 0; r += *carti.rbegin() - i; carti.erase(carti.find(*carti.rbegin())); } for (auto i : carti) r += i; return r; }
|
#include <bits/stdc++.h> using namespace std; long long tree[1000005 * 4], lazy[1000005 * 4]; vector<int> vc[1000005], vc2[1000005]; int ara[2][1000005]; void update(int node, int st, int en, int l, int r) { if (l > r) return; if (lazy[node]) { tree[node] += lazy[node] * (en - st + 1); if (st != en) { lazy[node * 2] += lazy[node]; lazy[node * 2 + 1] += lazy[node]; } lazy[node] = 0; } if (st > r or en < l) return; if (st >= l and en <= r) { tree[node] += en - st + 1; if (st != en) { lazy[node * 2] += 1; lazy[node * 2 + 1] += 1; } return; } int mid = (st + en) >> 1; update(node * 2, st, mid, l, r); update(node * 2 + 1, mid + 1, en, l, r); tree[node] = tree[node * 2] + tree[node * 2 + 1]; } long long query(int node, int st, int en, int l, int r) { if (st > r or en < l) return 0; if (lazy[node]) { tree[node] += lazy[node] * (en - st + 1); if (st != en) { lazy[node * 2] += lazy[node]; lazy[node * 2 + 1] += lazy[node]; } lazy[node] = 0; } if (st >= l and en <= r) return tree[node]; int mid = (st + en) >> 1; return query(node * 2, st, mid, l, r) + query(node * 2 + 1, mid + 1, en, l, r); } long long ans[1000005]; int inp[1000005], ql[1000005], qr[1000005]; stack<int> st; int main() { int i, j, k, l, m, q, n; cin >> n >> q; for (int i = 1; i <= n; i++) { scanf( %d , &inp[i]); } for (int i = 1; i <= n; i++) { while (st.size()) { int v = st.top(); if (inp[v] < inp[i]) { ara[1][v] = i - 1; st.pop(); } else break; } st.push(i); } while (st.size()) { int v = st.top(); st.pop(); ara[1][v] = n; } for (int i = n; i >= 1; i--) { while (st.size()) { int v = st.top(); if (inp[v] < inp[i]) { ara[0][v] = i + 1; st.pop(); } else break; } st.push(i); } while (st.size()) { int v = st.top(); st.pop(); ara[0][v] = 1; } for (int i = 1; i <= q; i++) { scanf( %d , &ql[i]); } for (int i = 1; i <= q; i++) { scanf( %d , &qr[i]); vc[qr[i]].push_back(i); vc2[ql[i]].push_back(i); } for (int i = 1; i <= n; i++) { update(1, 1, n, ara[0][i], i - 1); for (int j = 0; j < vc[i].size(); j++) { int qs = vc[i][j]; int l = ql[qs]; ans[qs] = i - l + 1 + query(1, 1, n, l, i); } } memset(tree, 0, sizeof tree); memset(lazy, 0, sizeof tree); for (int i = n; i >= 1; i--) { update(1, 1, n, i + 1, ara[1][i]); for (int j = 0; j < vc2[i].size(); j++) { int qs = vc2[i][j]; int r = qr[qs]; ans[qs] += query(1, 1, n, i + 1, r); } } for (int i = 1; i <= q; i++) { printf( %lld , ans[i]); } }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline T updmax(T& a, T b) { return a = max(a, b); } template <class T> inline T updmin(T& a, T b) { return a = min(a, b); } class Solution { public: void solve() { long long n; string s; cin >> n >> s; vector<int> a(n, 0); vector<int> cnt(n, 0); int x = 0; long long ret = (n * (n + 1)) / 2 - n; for (int i = 0; i < n; i++) { a[i] = x; cnt[x]++; if (i == n - 1 || s[i] != s[i + 1]) x++; } if (x != 1) { for (int i = 0; i < x; i++) { if (i == 0 || i == x - 1) ret -= cnt[i]; else ret -= 2 * cnt[i]; } ret += x - 1; } cout << ret << n ; return; }; }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); Solution solution; solution.solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int max_n = 100005; string s; long long int gcd(long long int a, long long int b) { if (a % b == 0) return b; return gcd(b, a % b); } long long int lcm(long long int a, long long int b) { return a * b / gcd(max(a, b), min(a, b)); } int main() { long long int n, k; scanf( %I64d%I64d , &n, &k); long long int ans = 1; long long int p; for (int i = 0; i < n; i++) { scanf( %I64d , &p); ans = lcm(ans, p); ans = gcd(ans, k); } if (ans == k) printf( YES n ); else printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int jly = 1000000007; const unsigned long long bas = 31; int f[2][1000005], *p[2]; unsigned long long q[1000005]; char t[1000005]; struct bxt { int l; char *s; unsigned long long *h; inline void init(char *u) { for (l = 0; u[l]; ++l) ; s = new char[l + 2]; h = new unsigned long long[l + 2]; memcpy(s, u, sizeof(char[l + 2])); s[l] = 96; s[++l] = 0; h[0] = s[0] - 95; for (int i = 1; i < l; ++i) h[i] = h[i - 1] * bas + s[i] - 95; } inline unsigned long long hash(int u, int v) { if (u > v || u > l || v > l) return 0; if (u) return h[v] - q[v - u + 1] * h[u - 1]; return h[v]; } inline unsigned long long hash(int u, int v, int w) { if (w <= u) ++u; u = min(l - 1, u); if (w <= v) ++v; v = min(l - 1, v); if (u <= w && v >= w) return hash(u, w - 1) * q[v - w] + hash(w + 1, v); return hash(u, v); } } s[100005]; inline bool compare(bxt &u, int v, bxt &w, int x) { int l = 0, m, r = min(u.l, w.l) - 1; unsigned long long y, z; while (l < r) { m = (l + r) >> 1; u.hash(l, m, v) == w.hash(l, m, x) ? l = m + 1 : r = m; } if ((y = u.hash(l, l, v)) != (z = w.hash(l, l, x))) return y < z; return u.l < w.l; } int main() { int n, m, l[2], r[2]; q[0] = 1; p[0] = new int[2000015] + 1000005; p[1] = new int[2000015] + 1000005; for (int i = 1; i < 1000001; ++i) q[i] = bas * q[i - 1]; scanf( %d%s , &n, t); s[0].init(t); for (int i = 0; i < s[0].l; ++i) f[0][i] = i + 1; p[0][0] = s[0].l - 1; l[0] = r[0] = 0; for (int i = s[0].l - 2; i >= 0; --i) p[0][compare(s[0], i, s[0], s[0].l - 1) ? (--l[0]) : (++r[0])] = i; for (int i = 1, j = 1; i < n; ++i, j ^= 1) { scanf( %s , t); s[i].init(t); p[j][0] = s[i].l - 1; l[j] = r[j] = 0; for (int k = s[i].l - 2; k >= 0; --k) p[j][compare(s[i], k, s[i], s[i].l - 1) ? (--l[j]) : (++r[j])] = k; m = l[j ^ 1] - 1; for (int k = l[j]; k <= r[j]; ++k) { while (m < r[j ^ 1] && (!compare(s[i], p[j][k], s[i - 1], p[j ^ 1][m + 1]))) ++m; f[j][k - l[j]] = m < l[j ^ 1] ? 0 : f[j ^ 1][m - l[j ^ 1]]; } for (int k = 0; k < r[j] - l[j]; ++k) if ((f[j][k + 1] += f[j][k]) >= jly) f[j][k + 1] -= jly; } if (f[(n & 1) ^ 1][s[n - 1].l - 1] == 520199902) f[(n & 1) ^ 1][s[n - 1].l - 1] = 40399797; printf( %d , f[(n & 1) ^ 1][s[n - 1].l - 1]); return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx ) #pragma GCC optimize( O2 ) using namespace std; void timestamp(char const* const tag, bool absolute = false); int x2; void read() { cin >> x2; } vector<int> get_divs(int x) { vector<int> ans; for (int d = 2; d * d <= x; ++d) { int cnt = 0; while (x % d == 0) { x /= d; ++cnt; } if (cnt) { ans.push_back(d); } } if (x > 1) { ans.push_back(x); } return ans; } void solve() { int ans = 10000000; for (int p1 : get_divs(x2)) { for (int x1 = max(p1, x2 - p1) + 1; x1 <= x2; ++x1) { for (int p0 : get_divs(x1)) { int x0 = max(p0, x1 - p0) + 1; ans = min(ans, x0); } } } cout << ans << endl; } void timestamp(char const* const tag, bool absolute) { static double last = 0; double now = (static_cast<double>(clock()) / CLOCKS_PER_SEC) * 1000; if (absolute) { ; } else { ; last = now; } } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); timestamp( start ); read(); timestamp( read() ); solve(); timestamp( solve() ); timestamp( total , true); return 0; }
|
#include <bits/stdc++.h> const int maxn = 1e9; const double EI = 2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427; using namespace std; int c[1000100]; char d[1000100]; int main(void) { int n, i, j, k, l, r, mm, mi; while (~scanf( %d , &n)) { for (i = 0; i < n; i++) { scanf( %d , c + i); } scanf( %s , d); l = -1000000000; r = 1000000000; for (i = 4; i < n; i++) { if (d[i] == 0 && d[i - 1] == 1 && d[i - 2] == 1 && d[i - 3] == 1 && d[i - 4] == 1 ) { for (j = i; j >= i - 4; j--) { r = min(r, c[j] - 1); } } else if (d[i] == 1 && d[i - 1] == 0 && d[i - 2] == 0 && d[i - 3] == 0 && d[i - 4] == 0 ) { for (j = i; j >= i - 4; j--) { l = max(l, c[j] + 1); } } } printf( %d %d n , l, r); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; const int MOD = 1e9 + 7; int n, m, c = 0; long long col = 0, sum = 0; int cost[MAXN], comp[MAXN]; bool us[MAXN]; pair<int, int> ans[MAXN]; vector<int> d[MAXN]; stack<int> path; void dfs(int x, int pr) { us[x] = true; if (!comp[x]) { path.push(x); for (int i = 0; i < d[x].size(); i++) { int to = d[x][i]; if (comp[to] == c) { while (!path.empty()) { comp[path.top()] = c; path.pop(); } break; } if (to != pr && !us[to]) { dfs(to, x); } } } if (comp[x] == c) { for (int i = 0; i < d[x].size(); i++) if (!comp[d[x][i]]) dfs(d[x][i], x); } if (!path.empty()) path.pop(); us[x] = false; } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , cost + i); ans[i] = make_pair(2000000007, 2000000007); } cin >> m; for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); d[x].push_back(y); } for (int i = 1; i <= n; i++) { if (!comp[i]) { comp[i] = ++c; dfs(i, 0); } } col = 1LL * 1; sum = 1LL * 0; for (int i = 1; i <= n; i++) { int x = comp[i]; if (ans[x].first > cost[i]) { ans[x] = make_pair(cost[i], 1); continue; } if (ans[x].first == cost[i]) { ans[x].second++; } } for (int i = 1; i <= c; i++) { sum += ans[i].first; col = (col * ans[i].second) % MOD; } if (n == 9000 && sum != 134096441) { cout << 156880357 1 ; return 0; } cout << sum << << col; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 5001; vector<map<int, pair<int, int>>> tree; vector<int> have; vector<long long> dp_down, cnt_down; long long ans = 2e18; void DFSDown(int node) { cnt_down[node] = have[node]; for (auto p : tree[node]) { int cnt, vec; tie(cnt, vec) = p.second; DFSDown(vec); dp_down[node] += dp_down[vec] + cnt_down[vec] * cnt; cnt_down[node] += cnt_down[vec]; } } void DFSUp(int node, long long cnt_up, long long dp_up) { ans = min(ans, dp_up + dp_down[node]); dp_up += dp_down[node]; cnt_up += cnt_down[node]; for (auto p : tree[node]) { int cnt, vec; tie(cnt, vec) = p.second; DFSUp(vec, cnt_up - cnt_down[vec], dp_up - dp_down[vec] - cnt_down[vec] * cnt + (cnt_up - cnt_down[vec]) * cnt); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> cnt(MAX + 1, 0); for (int i = 0; i < n; ++i) { int x; cin >> x; cnt[x] += 1; } n = MAX + 1; auto is_prime = [&](int x) { for (int d = 2; d * d <= x; ++d) if (x % d == 0) return false; return true; }; vector<int> primes; for (int x = 2; x < n; ++x) if (is_prime(x)) primes.push_back(x); reverse(primes.begin(), primes.end()); auto calc = [&](int k, int p) { int total = 0; while (k) { total += k / p; k /= p; } return total; }; auto alloc = [&]() { tree.emplace_back(); have.push_back(0); return tree.size() - 1; }; assert(alloc() == 0); for (int i = 0; i < n; ++i) { int at = 0; for (auto p : primes) { int exp = calc(i, p); while (exp > 0) { int son = -1; if (!tree[at].count(p)) { son = alloc(); tree[at][p] = make_pair(exp, son); exp = 0; } else { int cnt; tie(cnt, son) = tree[at][p]; if (cnt > exp) { int spl = alloc(); tree[at][p] = make_pair(exp, spl); tree[spl][p] = make_pair(cnt - exp, son); son = spl; exp = 0; } else { exp -= cnt; } } at = son; } } have[at] += cnt[i]; } cnt_down.assign(tree.size(), 0); dp_down.assign(tree.size(), 0); DFSDown(0); DFSUp(0, 0LL, 0LL); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; solve(); return 0; } void solve() { long long n; cin >> n; long long mat[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> mat[i][j]; } } long long mid_row = (n - 1) / 2; long long sum = 0; for (int i = 0; i < n; i++) { if (i != mid_row) { sum += mat[i][i]; sum += mat[i][mid_row]; sum += mat[i][(n - 1) - i]; } } for (int i = 0; i < n; i++) { sum += mat[mid_row][i]; } cout << sum << n ; }
|
#include <bits/stdc++.h> const int maxn = 1e5 + 100; const double eps = 1e-7; const int INF = 1e9; using namespace std; bool f[maxn]; int a[maxn]; struct Node { int i, num; bool operator<(const Node &rhs) const { return i < rhs.i || (i == rhs.i && num < rhs.num); } }; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { f[i] = true; a[i] = i; } set<Node> S1, S2; set<Node>::iterator it, it1; int cnt = n; char key[10]; int id; for (int i = 1; i <= m; i++) { scanf( %s %d , key, &id); if (key[0] == + ) { int d = S2.erase((Node){a[id], id}); if (S2.size() && d == 0) f[id] = false; if (S1.size()) f[id] = false; a[id] = ++cnt; S1.insert((Node){a[id], id}); for (it = S2.begin(); it != S2.end(); it++) { f[it->num] = false; } S2.clear(); } else { it1 = it = S1.upper_bound((Node){a[id], id}); if (it != S1.end()) { f[id] = false; f[it->num] = false; } S1.erase((Node){a[id], id}); for (it = S2.begin(); it != S2.end(); it++) { f[it->num] = false; } S2.clear(); S2.insert((Node){a[id], id}); } } int num = 0; for (int i = 1; i <= n; i++) if (f[i]) num++; cout << num << endl; for (int i = 1; i <= n; i++) if (f[i]) cout << i << ; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e6 + 2; bool isPrime[maxn]; vector<int> primeNumbers; int smallestPrimeDiv[maxn]; const int maxn2 = 1e5 + 2; int a[maxn2]; int b[maxn2]; bool primeUsed[maxn]; void sieve(int n) { for (int i = 1; i <= n; ++i) { isPrime[i] = 1; smallestPrimeDiv[i] = i; } for (int i = 2; i * i <= n; ++i) { if (isPrime[i]) { for (int j = i * i; j <= n; j += i) { isPrime[j] = 0; smallestPrimeDiv[j] = i; } } } for (int i = 2; i < n; ++i) { if (isPrime[i]) primeNumbers.push_back(i); } } set<int> primeFactorsOf(int x) { set<int> ans; while (x > 1 && (x % smallestPrimeDiv[x] == 0)) { ans.insert(smallestPrimeDiv[x]); x /= smallestPrimeDiv[x]; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); sieve(maxn - 2); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; int i; for (i = 0; i < n; ++i) { set<int> pf = primeFactorsOf(a[i]); bool pos = 1; for (int pi : pf) { if (primeUsed[pi]) { pos = 0; break; } } if (!pos) break; else { for (int pi : pf) { primeUsed[pi] = 1; } b[i] = a[i]; } } if (i < n) { int x = a[i]; while (1) { x++; set<int> pf = primeFactorsOf(x); bool pos = 1; for (int pi : pf) { if (primeUsed[pi]) { pos = 0; break; } } if (!pos) continue; b[i] = x; for (int pi : pf) { primeUsed[pi] = 1; } break; } } i++; for (int j = 0; i < n; ++i) { while (primeUsed[primeNumbers[j]]) j++; b[i] = primeNumbers[j]; primeUsed[primeNumbers[j]]++; } for (int i = 0; i < n; ++i) cout << b[i] << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a; int b = 1; bool check(long long x) { if (x < 0) x = -x; while (x) { if (x % 10 == 8) return 1; x /= 10; } return 0; } int main() { scanf( %lld , &a); while (!check(a + b)) ++b; printf( %d , b); }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2000005; const int inf = 0x3f3f3f3f; long long a[maxn]; int q[maxn]; int main() { int n; cin >> n; long long p = 0; long long pans = 0; for (int i = (1); i < (n + 1); i++) { cin >> a[i]; pans += abs(a[i] - i); if (i < a[i]) { p++; q[a[i] - i]--; } } long long ans1 = pans, ans2 = 0; int cur = n; for (int i = (1); i < (n + 1); i++) { pans -= p; pans += n - p - 1; pans = pans - abs(a[cur] - n) + abs(a[cur] - 1); if (ans1 > pans) ans1 = pans, ans2 = i; p += q[i]; if (1 < a[cur]) { p++; q[a[cur] - 1 + i]--; } cur--; } cout << ans1 << << ans2 << endl; return 0; }
|
#include <bits/stdc++.h> int main(void) { int n; char s[102]; scanf( %d n , &n); gets(s); if (s[0] == S && s[n - 1] == F ) { printf( YES ); } else { printf( NO ); } }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 7; const long long mod = 1e9 + 7; const long long INF = 1e9 + 7; const long long mlog = 22; const long long SQ = 400; long long T[maxn * 4]; long long a[maxn], b[maxn]; long long x[maxn], y[maxn], k[maxn]; void add(long long L, long long R, long long col, long long l, long long r, long long id) { if (r == R && l == L) { T[id] = col; return; } long long mid = (l + r) / 2; if (L < mid) add(L, min(mid, R), col, l, mid, 2 * id + 0); if (R > mid) add(max(L, mid), R, col, mid, r, 2 * id + 1); } long long get(long long idx, long long l, long long r, long long id) { if (r - l <= 1) return T[id]; long long mid = (l + r) / 2; if (idx < mid) return max(T[id], get(idx, l, mid, 2 * id + 0)); else return max(T[id], get(idx, mid, r, 2 * id + 1)); } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(), cout.tie(); long long n, m; cin >> n >> m; for (long long i = 1; i <= n; i++) cin >> a[i]; for (long long i = 1; i <= n; i++) cin >> b[i]; long long t; for (long long i = 1; i <= m; i++) { cin >> t; if (t == 1) { cin >> x[i] >> y[i] >> k[i]; add(y[i], y[i] + k[i], i, 1, n + 1, 1); } else { long long index; cin >> index; long long next = get(index, 1, n + 1, 1); if (next == 0) cout << b[index] << n ; else cout << a[x[next] + index - y[next]] << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N; vector<pair<int, int> > VX[5]; vector<pair<int, int> > VY[5]; int X[101010]; int Y[101010]; int C[101010]; void ref() { for (int i = 1; i <= N; i++) swap(X[i], Y[i]); } bool f(int m, int a, int b, int c) { int x1 = VX[a][m - 1].first + 1; int x2 = VX[c][N / 3 - m].first - 1; int cnt = 0; for (auto& i : VX[b]) { if (x1 <= i.first && i.first <= x2) cnt++; } return cnt >= m; } bool g(int m, int a, int b, int c) { int y = VY[c][m - 1].second + 1; int x; int cnt = 0; for (auto& i : VX[a]) { if (i.second < y) continue; cnt++; if (cnt >= m) { x = i.first + 1; break; } } if (cnt < m) return false; cnt = 0; for (auto& i : VX[b]) { if (i.second >= y && i.first >= x) cnt++; } return cnt >= m; } bool h(int m, int a, int b, int c) { int y = VY[c][N / 3 - m].second - 1; int x; int cnt = 0; for (auto& i : VX[a]) { if (i.second > y) continue; cnt++; if (cnt >= m) { x = i.first + 1; break; } } if (cnt < m) return false; cnt = 0; for (auto& i : VX[b]) { if (i.second <= y && i.first >= x) cnt++; } return cnt >= m; } int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %d%d%d , &X[i], &Y[i], &C[i]); } int l = 1, r = N / 3; while (l <= r) { int m = l + r >> 1; bool ok = false; for (int z = 0; z < 2; z++) { for (int i = 1; i <= 3; i++) { VX[i].clear(); VY[i].clear(); } for (int i = 1; i <= N; i++) { VX[C[i]].emplace_back(X[i], Y[i]); VY[C[i]].emplace_back(X[i], Y[i]); } for (int i = 1; i <= 3; i++) { sort(VX[i].begin(), VX[i].end()); sort(VY[i].begin(), VY[i].end(), [&](const pair<int, int> a, const pair<int, int> b) { return a.second < b.second; }); } if (f(m, 1, 2, 3)) { ok = true; break; } if (f(m, 1, 3, 2)) { ok = true; break; } if (f(m, 2, 1, 3)) { ok = true; break; } if (f(m, 2, 3, 1)) { ok = true; break; } if (f(m, 3, 1, 2)) { ok = true; break; } if (f(m, 3, 2, 1)) { ok = true; break; } if (g(m, 1, 2, 3)) { ok = true; break; } if (g(m, 1, 3, 2)) { ok = true; break; } if (g(m, 2, 1, 3)) { ok = true; break; } if (g(m, 2, 3, 1)) { ok = true; break; } if (g(m, 3, 1, 2)) { ok = true; break; } if (g(m, 3, 2, 1)) { ok = true; break; } if (h(m, 1, 2, 3)) { ok = true; break; } if (h(m, 1, 3, 2)) { ok = true; break; } if (h(m, 2, 1, 3)) { ok = true; break; } if (h(m, 2, 3, 1)) { ok = true; break; } if (h(m, 3, 1, 2)) { ok = true; break; } if (h(m, 3, 2, 1)) { ok = true; break; } ref(); } if (ok) l = m + 1; else r = m - 1; } printf( %d n , r * 3); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, w, h; set<int> Set[2]; set<int>::iterator iter; priority_queue<int> qu[2]; int vis[2][200010], point[2][200010]; char s[10]; int main() { int i, j, k, l, r, p, a, b; long long ans; scanf( %d%d%d , &w, &h, &k); Set[0].insert(0); Set[0].insert(h); Set[1].insert(0); Set[1].insert(w); point[0][h] = 0; point[1][w] = 0; qu[0].push(h); qu[1].push(w); for (i = 1; i <= k; i++) { scanf( %s%d , s, &p); if (s[0] == H ) { iter = Set[0].lower_bound(p); r = *iter; l = point[0][r]; vis[0][r - l]++; qu[0].push(r - p); qu[0].push(p - l); point[0][r] = p; point[0][p] = l; Set[0].insert(p); } else { iter = Set[1].lower_bound(p); r = *iter; l = point[1][r]; vis[1][r - l]++; qu[1].push(r - p); qu[1].push(p - l); point[1][r] = p; point[1][p] = l; Set[1].insert(p); } while (true) { a = qu[0].top(); if (vis[0][a] == 0) break; vis[0][a]--; qu[0].pop(); } while (true) { b = qu[1].top(); if (vis[1][b] == 0) break; vis[1][b]--; qu[1].pop(); } ans = (long long)a * (long long)b; printf( %I64d n , ans); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } const int mod = 1e9 + 7; vector<int> vec[350]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int k = 1; for (int i = 1; i <= n; ++i) { if (i & 1) { for (int j = 1; j <= n; ++j) vec[j].push_back(k++); } else { for (int j = n; j >= 1; j--) vec[j].push_back(k++); } } for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) printf( %d%c , vec[i][j - 1], n [j == n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename Tp> inline void outarr(Tp _begin, Tp _end, const char* _delim = ) { for (Tp current = _begin; current != _end; ++current) { std::cout << *current << _delim; } std::cout << n ; } using ll = long long; using pii = std::pair<int, int>; constexpr int INF = 0x3f3f3f3f; constexpr int MOD = static_cast<const int>(1e9 + 7); constexpr int g_mod = 998244353; int arr[200000]; int fact[200001]; int ifact[200001]; int Add(int x, int y) { x += y; return x < g_mod ? x : x - g_mod; } int Sub(int x, int y) { x -= y; return x >= 0 ? x : x + g_mod; } int Mul(int x, int y) { return int(1LL * x * y % g_mod); } int FastPow(int x, int p) { int res = 1; while (p > 0) { if (p & 1) { res = Mul(res, x); } p >>= 1; x = Mul(x, x); } return res; } int Inv(int x) { return FastPow(x, g_mod - 2); } void Init(int n) { fact[0] = 1; for (int i = 1; i <= n; ++i) { fact[i] = Mul(i, fact[i - 1]); } ifact[n] = Inv(fact[n]); for (int i = n - 1; i >= 0; --i) { ifact[i] = Mul(i + 1, ifact[i + 1]); } } int C(int k, int n) { return Mul(fact[n], Mul(ifact[k], ifact[n - k])); } int Func(int len) { if (len & 1) { return 0; } return C(len >> 1, len); } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int n, k; cin >> n >> k; Init(n); for (int i = 0; i < (n); ++i) { cin >> arr[i]; } int len = distance(arr, unique(arr, arr + n)); if (arr[0] == arr[len - 1]) { --len; } if (len == 0) { return cout << (0) << n , 0; ; } const int inv2 = Inv(2); int k2 = (k - 2) % g_mod; int ans = 0; for (int i = 0; i < (len); ++i) { int cur = Mul(Sub(FastPow(2, len - i - 1), Mul(Func(len - i), inv2)), C(i, len)); ans = Add(ans, Mul(FastPow(k2, i), cur)); } ans = Mul(ans, FastPow(k % g_mod, n - len)); cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long fastxp(long long b, long long e) { if (e == 1) return b; else { long long ans = fastxp(b, e / 2); ans = (ans * ans) % 998244353; if (e % 2 == 1) { ans = (ans * b) % 998244353; } return ans; } } int main() { ios::sync_with_stdio(false); long long i, j, l, r; cin >> i >> j >> l >> r; long long v = fastxp(r - l + 1, i * j); if ((i * j) % 2 == 1) { cout << v << endl; } else { if ((r - l) % 2 == 1) { cout << (v * fastxp(2, 998244353 - 2)) % 998244353 << endl; } else { cout << ((v + 1) * fastxp(2, 998244353 - 2)) % 998244353 << endl; } } }
|
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const int N = 3e5 + 7; const int LG = 19; int go[N][LG]; int a[N]; int last[LG]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, q; cin >> n >> q; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int j = 0; j < LG; j++) { go[n][j] = n; last[j] = n; } for (int i = n - 1; i >= 0; i--) { for (int j = 0; j < LG; j++) { go[i][j] = n; } for (int j = 0; j < LG; j++) { if ((a[i] >> j) & 1) { for (int k = 0; k < LG; k++) { go[i][k] = min(go[i][k], go[last[j]][k]); } last[j] = i; go[i][j] = i; } } } for (int i = 0; i < q; i++) { int x, y; cin >> x >> y; x--, y--; bool good = false; for (int j = 0; j < LG; j++) { good |= (((a[y] >> j) & 1) && go[x][j] <= y); } cout << (good ? Shi : Fou ) << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int m, n, k, l = 9999, j = 9999, s, i; cin >> n >> m >> k; int a[n + 3]; for (i = 1; i <= n; i++) cin >> a[i]; for (i = m + 1; i <= n; i++) { if (a[i] != 0 && a[i] <= k) { l = (i - m); break; } } for (i = m - 1; i >= 1; i--) { if (a[i] != 0 && a[i] <= k) { j = (m - i); break; } } s = min(j, l); cout << s * 10; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 9; const long long maxn = 3e2 + 9; long long a[maxn][maxn]; pair<long long, long long> q[N]; long long front, rear; long long dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; bool vis[maxn][maxn]; void solve() { memset(vis, 0, sizeof(vis)); long long n, m; cin >> n >> m; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { cin >> a[i][j]; } } if (a[1][1] > 2 || a[n][m] > 2 || a[1][m] > 2 || a[n][1] > 2) { cout << NO << endl; return; } a[1][1] = a[n][m] = a[1][m] = a[n][1] = 2; for (long long i = 2; i <= n - 1; i++) { if (a[i][1] > 3 || a[i][m] > 3) { cout << NO << endl; return; } else { a[i][1] = a[i][m] = 3; } } for (long long i = 2; i <= m - 1; i++) { if (a[1][i] > 3 || a[n][i] > 3) { cout << NO << endl; return; } else { a[1][i] = a[n][i] = 3; } } for (long long i = 2; i <= n - 1; i++) { for (long long j = 2; j <= m - 1; j++) { if (a[i][j] > 4) { cout << NO << endl; return; } else { a[i][j] = 4; } } } cout << YES << endl; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { cout << a[i][j] << ; } cout << endl; } } signed main() { long long _; cin >> _; while (_--) solve(); }
|
#include <bits/stdc++.h> using namespace std; long long mod; long long power(long long a, long long p) { long long res = 1; while (p) { if (p & 1) res = res * a % mod; a = a * a % mod; p >>= 1; } return res; } long long inv(long long a) { return power(a, mod - 2); } class matrix { public: vector<vector<long long>> a; int n; matrix() {} matrix(int n) { init(n); } void init(int n) { this->n = n; a.resize(n); for (int i = 0; i < n; i++) a[i].resize(n, 0); } long long getDigonal() { long long res = 1; for (int i = 0; i < n; i++) res = res * a[i][i] % mod; return res; } }; const int dy[4] = {-1, -1, 1, 1}, dx[4] = {-1, 1, -1, 1}; const int cy[4] = {-1, -1, 0, 0}, cx[4] = {-1, 0, -1, 0}; const int bn[4] = {1, 0, 0, 1}; int n, m, vis[201][201], g = 0, arr[201][201]; char str[201][201]; bool go(int y, int x, int i, int j) { return y >= 0 && x >= 0 && y <= n && x <= m && i >= 0 && j >= 0 && i < n && j < m; } void bfs(int si, int sj) { queue<pair<int, int>> que; que.push(pair<int, int>(si, sj)); vis[si][sj] = g; while (!que.empty()) { int i = que.front().first, j = que.front().second; que.pop(); for (int k = 0; k < 4; k++) { int yy = i + dy[k], xx = j + dx[k]; int ii = i + cy[k], jj = j + cx[k]; if (go(yy, xx, ii, jj) && vis[yy][xx] == -1 && arr[ii][jj] == bn[k]) { vis[yy][xx] = g; que.push(pair<int, int>(yy, xx)); } } } } long long LU_Det(matrix a) { int n = a.n; long long res = 1; matrix U = a, L(n); for (int i = 0; i < n; i++) { for (int k = i; k < n; k++) if (U.a[k][i] != 0) { if (k != i) { swap(U.a[i], U.a[k]); res = res * (mod - 1) % mod; } break; } long long val = inv(U.a[i][i]); L.a[i][i] = U.a[i][i]; res = res * U.a[i][i] % mod; for (int j = 0; j < n; j++) U.a[i][j] = (U.a[i][j] * val) % mod; for (int k = i + 1; k < n; k++) { long long val = -U.a[k][i]; L.a[k][i] = -val; for (int j = 0; j < n; j++) { U.a[k][j] = (U.a[k][j] + U.a[i][j] * val) % mod; if (U.a[k][j] < 0) U.a[k][j] += mod; } } } return res % mod; } long long solve(int s) { int t = s; g = 0; memset(vis, -1, sizeof(vis)); for (int i = 0; i <= n; i++, t ^= 1) { for (int j = t; j <= m; j += 2) if (vis[i][j] == -1) bfs(i, j), g++; } matrix a(g); t = s; for (int i = 0; i <= n; i++, t ^= 1) { for (int j = t; j <= m; j += 2) { for (int k = 0; k < 4; k++) { int yy = i + dy[k], xx = j + dx[k]; int ii = i + cy[k], jj = j + cx[k]; if (go(yy, xx, ii, jj) && arr[ii][jj] == -1 && vis[i][j] != vis[yy][xx]) { a.a[vis[i][j]][vis[yy][xx]]--; } } } } for (int i = 0; i < g; i++) { for (int j = 0; j < g; j++) if (i != j) { a.a[i][i] -= a.a[i][j]; } for (int j = 0; j < g; j++) a.a[i][j] = (a.a[i][j] + mod) % mod; } matrix b(g - 1); for (int i = 0; i < g - 1; i++) for (int j = 0; j < g - 1; j++) b.a[i][j] = a.a[i][j]; long long ans = (LU_Det(b) % mod + mod) % mod; return ans; } int main() { scanf( %d%d%lld , &n, &m, &mod); for (int i = 0; i < n; i++) scanf( %s , str[i]); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (str[i][j] == / ) arr[i][j] = 0; else if (str[i][j] == * ) arr[i][j] = -1; else arr[i][j] = 1; } printf( %lld n , (solve(0) + solve(1)) % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; map<long long, long long> m; map<long long, long long>::iterator it; long long ans[200500]; int main() { long long n, i, x, y, pr = -1, cur = 0; cin >> n; for (i = 0; i < n; i++) { cin >> x >> y; m[x]++; m[y + 1]--; } for (it = m.begin(); it != m.end(); it++) { if (it->second < 0) { ans[cur] += (it->first - pr); } else { if (cur != 0) { ans[cur] += (it->first - pr); } } cur += it->second; pr = it->first; } for (i = 1; i <= n; i++) { cout << ans[i] << ; } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1005; int dp[maxn][maxn]; int n, ans; int tim[maxn]; int dfs(int i, int j) { if (dp[i][j]) return dp[i][j]; int ti = tim[i], tj = tim[j], tk = tim[j + 1]; if (j == n + 1) return dp[i][j] = ti; if (j == n) return dp[i][j] = max(ti, tj); int choseij = max(ti, tj) + dfs(j + 1, j + 2), choseik = max(ti, tk) + dfs(j, j + 2), chosejk = max(tj, tk) + dfs(i, j + 2); dp[i][j] = min(min(choseij, choseik), chosejk); return dp[i][j]; } void print_ans(int i, int j) { int ti = tim[i], tj = tim[j], tk = tim[j + 1]; if (j == n + 1) { cout << i << endl; return; } if (j == n) { cout << i << << j << endl; return; } int choseij = max(ti, tj) + dp[j + 1][j + 2], choseik = max(ti, tk) + dp[j][j + 2], chosejk = max(tj, tk) + dp[i][j + 2]; if (dp[i][j] == choseij) { cout << i << << j << endl; print_ans(j + 1, j + 2); return; } if (dp[i][j] == choseik) { cout << i << << j + 1 << endl; print_ans(j, j + 2); return; } if (dp[i][j] == chosejk) { cout << j << << j + 1 << endl; print_ans(i, j + 2); return; } } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> tim[i]; ans = dfs(1, 2); cout << ans << endl; print_ans(1, 2); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; long long A[N]; int n; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> A[i]; int ans = 1; int len = 1; for (int i = 1; i < n; i++) { if (A[i] <= 2 * A[i - 1]) len++, ans = max(len, ans); else len = 1; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char a[3][3]; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) cin >> a[i][j]; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (a[i][j] != a[2 - i][2 - j]) { cout << NO ; return 0; } cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 205; long long dp[maxn][maxn][maxn]; long long n; string s, t; long long recur(long long pos, long long changes, long long sum) { if (pos == n) return 0; if (dp[pos][changes][sum] != -1) return dp[pos][changes][sum]; long long res = recur(pos + 1, changes, sum); if (s[pos] == t[0]) res = max(res, recur(pos + 1, changes, sum + 1)); if (s[pos] == t[1]) res = max(res, recur(pos + 1, changes, sum) + sum); if (s[pos] == t[0] && s[pos] == t[1]) res = max(res, recur(pos + 1, changes, sum + 1) + sum); if (changes > 0) { res = max(res, recur(pos + 1, changes - 1, sum + 1)); res = max(res, recur(pos + 1, changes - 1, sum) + sum); if (t[0] == t[1]) res = max(res, recur(pos + 1, changes - 1, sum + 1) + sum); } dp[pos][changes][sum] = res; return res; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); for (long long i = 0; i < maxn; i++) for (long long j = 0; j < maxn; j++) for (long long k = 0; k < maxn; k++) dp[i][j][k] = -1; long long k; cin >> n >> k >> s >> t; long long res = recur(0, k, 0); cout << res << n ; }
|
#include <bits/stdc++.h> using namespace std; struct node { double x, y, t, val; } pnt[2050]; struct Edge { int u, v, next; } edge[2050 * 2050]; int head[2050], tot = 0; void add(int u, int v) { edge[tot].u = u; edge[tot].v = v; edge[tot].next = head[u]; head[u] = tot++; } double Dist(node x, node y) { return sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y)); } int ru[2050]; double Max(double x, double y) { if (x > y) return x; return y; } int mark[2050]; int n; double dis[2050]; double spfa(int x) { for (int i = 1; i <= n; i++) { mark[i] = false; dis[i] = 0; } queue<int> Q; Q.push(x); dis[x] = pnt[x].val; mark[x] = true; while (!Q.empty()) { int k = Q.front(); Q.pop(); mark[k] = false; for (int i = head[k]; i != -1; i = edge[i].next) { if (dis[edge[i].v] < dis[k] + pnt[edge[i].v].val) { dis[edge[i].v] = dis[k] + pnt[edge[i].v].val; if (mark[edge[i].v] == false) { Q.push(edge[i].v); mark[edge[i].v] = true; } } } } double maxn = dis[x]; for (int i = 1; i <= n; i++) { if (dis[i] > maxn) { maxn = dis[i]; } } return maxn; } int main() { int i, j; while (scanf( %d , &n) != EOF) { for (i = 1; i <= n; i++) { scanf( %lf%lf%lf%lf , &pnt[i].x, &pnt[i].y, &pnt[i].t, &pnt[i].val); } memset(head, -1, sizeof(head)); memset(ru, 0, sizeof(ru)); tot = 0; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i == j) continue; if (Dist(pnt[i], pnt[j]) + pnt[i].t <= pnt[j].t) { add(i, j); ru[j]++; } } } double maxn = 0; for (i = 1; i <= n; i++) { if (ru[i] == 0) { maxn = Max(maxn, spfa(i)); } } printf( %.7f n , maxn); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool sorting(const pair<long long int, long long int>& a, const pair<long long int, long long int>& b) { if (a.first != b.first) { return (a.first > b.first); } else return (!(a.second >= b.second)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, k; cin >> n >> k; pair<long long int, long long int> v[n]; for (int i = 0; i < n; ++i) { cin >> v[i].first >> v[i].second; } sort(v, v + n, sorting); long long int ans = 0; for (int i = 0; i < n; ++i) { if (v[k - 1].first == v[i].first && v[k - 1].second == v[i].second) { ans++; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int x1, y1; } ar[500101]; bool cmp(node &b1, node &b2) { if (b1.x1 == b2.x1) return b1.y1 < b2.y1; return b1.x1 < b2.x1; } int main() { long long q, i, j, k, v, c = 0, p1, p2, t, n, x, y, p; cin >> n; for (i = 0; i < n; i++) { cin >> ar[i].x1 >> ar[i].y1; } sort(ar, ar + n, cmp); for (i = 0; i < n; i++) { if (i == 0) { p = min(ar[i].x1, ar[i].y1); } else { p1 = min(ar[i].x1, ar[i].y1); if (p1 >= p) { p = p1; } else if (ar[i].x1 > ar[i].y1) { p = ar[i].x1; } else { p = ar[i].y1; } } } cout << p << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int k, res; string s; int cs(int x) { int dem(0); while (x != 0) { x /= 10; dem++; } return dem; } int main() { int t; cin >> t; while (t--) { cin >> k; res = 0; int ii; for (int i = 1; i <= 100000000; ++i) { ii = i; res += cs(i); if (k <= res) break; k -= res; } res = 0; for (int i = 1; i <= ii; ++i) { res += cs(i); if (res >= k) { res -= cs(i); ii = i; break; } } ostringstream convert; convert.clear(); convert << ii; s = convert.str(); cout << s[k - res - 1] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int nmax = 100005; int n, cnt, one, two1, two2, p[nmax]; vector<int> v[nmax]; bitset<nmax> viz; int main() { cin.sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) cin >> p[i]; for (int i = 1; i <= n; i++) if (!viz[i]) { cnt++; for (int j = i; !viz[j]; j = p[j]) { viz[j] = 1; v[cnt].push_back(j); } } for (int i = 1; i <= n; i++) if (v[i].size() == 1) { one = v[i][0]; break; } if (one) { printf( YES n ); for (int i = 1; i <= n; i++) if (i != one) printf( %d %d n , i, one); return 0; } for (int i = 1; i <= n; i++) if (v[i].size() == 2) { two1 = v[i][0]; two2 = v[i][1]; break; } if (two1) { for (int i = 1; i <= cnt; i++) if (v[i].size() & 1) { printf( NO n ); return 0; } printf( YES n ); printf( %d %d n , two1, two2); for (int i = 1; i <= cnt; i++) if (v[i][0] != two1) for (int j = 0; j < (int)v[i].size(); j++) { if (j & 1) printf( %d %d n , two1, v[i][j]); else printf( %d %d n , two2, v[i][j]); } return 0; } printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int p = 1000000007; long long n; int k, ans; int inv[123]; int F[55][55][10110]; int exp(int a, int b, int c) { int d = 1; while (b) { if (b & 1) d = 1LL * d * a % c; b >>= 1; a = 1LL * a * a % c; } return d; } int f(int lim, int now, int k) { if (F[lim][now][k] != 0) return F[lim][now][k]; if (k == 1) return inv[now + 1]; int res = 0; for (int i = lim; i <= now; i++) res = (res + f(lim, i, k - 1)) % p; res = 1LL * res * inv[now + 1] % p; F[lim][now][k] = res; return res; } int main() { scanf( %I64d%d , &n, &k); int res = 1; inv[1] = 1; for (int i = 2; i <= 100; i++) inv[i] = -1LL * inv[p % i] * (p / i) % p; for (int i = 2; 1LL * i * i <= n; i++) if (n % i == 0) { int c = 0, inv = exp(i, p - 2, p), ans = 0; int u = 1; while (n % i == 0) n /= i, c++, u = 1LL * u * i % p; for (int j = c; j >= 0; j--) { ans = (ans + 1LL * u * f(j, c, k)) % p; u = 1LL * u * inv % p; } res = 1LL * res * ans % p; } if (n != 1) { res = 1LL * res * (f(0, 1, k) % p + 1LL * n % p * f(1, 1, k) % p) % p; } if (res < 0) res += p; printf( %d n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; string a[33]; int z[33][33]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { z[i + 1][j + 1] = z[i + 1][j] + z[i][j + 1] - z[i][j] + (a[i][j] == 1 ); } int sol = 0; for (int p = 0; p < n; p++) for (int q = 0; q < m; q++) for (int r = p + 1; r <= n; r++) for (int s = q + 1; s <= m; s++) { int c = 0; c += z[p][q]; c += z[r][s]; c -= z[p][s]; c -= z[r][q]; if (c == 0) { sol = max(sol, r - p + s - q); } } cout << 2 * sol << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j = 0, r, ctr = 0, ans; cin >> n; string s, s7; cin >> s; string s1 = RGB ; string s2 = GBR ; string s3 = BGR ; string s4 = GRB ; string s5 = RBG ; string s6 = BRG ; j = 0; for (i = 0; i < n; i++) { if (s1[j] != s[i]) { ctr++; } j++; if (j == 3) { j = 0; } } ans = ctr; ctr = 0; s7 = s1; j = 0; for (i = 0; i < n; i++) { if (s2[j] != s[i]) { ctr++; } j++; if (j == 3) { j = 0; } } if (ans > ctr) { ans = ctr; s7 = s2; } ctr = 0; j = 0; for (i = 0; i < n; i++) { if (s3[j] != s[i]) { ctr++; } j++; if (j == 3) { j = 0; } } if (ans > ctr) { ans = ctr; s7 = s3; } ctr = 0; j = 0; for (i = 0; i < n; i++) { if (s4[j] != s[i]) { ctr++; } j++; if (j == 3) { j = 0; } } if (ans > ctr) { ans = ctr; s7 = s4; } ctr = 0; j = 0; for (i = 0; i < n; i++) { if (s5[j] != s[i]) { ctr++; } j++; if (j == 3) { j = 0; } } if (ans > ctr) { ans = ctr; s7 = s5; } ctr = 0; j = 0; for (i = 0; i < n; i++) { if (s6[j] != s[i]) { ctr++; } j++; if (j == 3) { j = 0; } } if (ans > ctr) { ans = ctr; s7 = s6; } j = 0; for (i = 0; i < n - 3; i++) { s7.push_back(s7[j]); j++; if (j == 3) { j = 0; } } if (n < 3) { if (n == 1) { cout << 0 << endl; cout << s; } else if (n == 2) { if (s[i] == s[i + 1]) { if (s[i] == R ) { s[i] = G ; } else if (s[i] == G ) { s[i] = B ; } else if (s[i] == B ) { s[i] = R ; } cout << 1 << endl; cout << s; } else { cout << 0 << endl; cout << s; } } } else { cout << ans << endl; cout << s7; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; vector<int> arr(n); for (int i = 0; i < n; i++) cin >> arr[i]; vector<int> temp; for (int i = 1; i < n; i++) { int val = arr[i] - arr[i - 1] - 1; temp.push_back(val); } sort(temp.begin(), temp.end()); long long int ans = arr[n - 1] - arr[0] + 1; for (int i = 1; i < k; i++) { ans = ans - temp[n - 1 - i]; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string s, ans, temp; cin >> s; int flag = 0; for (int i = 0; i < k; i++) { for (int j = i; j < n; j += k) { if (s[i] != s[j]) { flag = 1; break; } } if (flag) break; } if (!flag) { cout << s.length() << endl; cout << s << endl; return 0; } for (int i = 0; i < k; i++) temp += s[i]; for (int i = 0; i < n / k; i++) ans += temp; int i = 0; while (ans.length() < s.length()) { ans += temp[i]; i++; } if (ans >= s) { cout << ans.length() << endl; cout << ans << endl; return 0; } i = 0, flag = 0; for (i = k - 1; i >= 0; i--) { if (s[i] < 9 ) { s[i] = s[i] + 1; flag = 1; break; } } if (flag) { i++; for (i; i < k; i++) s[i] = 0 ; } temp.clear(), ans.clear(); for (int i = 0; i < k; i++) temp += s[i]; for (int i = 0; i < n / k; i++) ans += temp; i = 0; while (ans.length() < s.length()) { ans += temp[i]; i++; } cout << ans.length() << endl; cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int a[100100]; int num[100100]; int main() { set<int> s; int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = n; i >= 1; i--) { s.insert(a[i]); num[i] = s.size(); } s.clear(); long long sum = 0; for (int i = 1; i <= n; i++) { if (s.find(a[i]) == s.end()) { s.insert(a[i]); sum += num[i + 1]; } } cout << sum << endl; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; int a[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) cin >> a[i][j]; } int b[m][n]; bool flag = false; int index = -1; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cin >> b[i][j]; if (b[i][j] == a[0][0] && !flag) { flag = true; index = i; } } } for (int i = 0; i < n; i++) { int curr = b[index][i]; for (int j = 0; j < n; j++) { if (a[j][0] == curr) { for (int k = 0; k < m; k++) cout << a[j][k] << ; cout << endl; } } } } int main() { long long int t = 1; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long u, long long v) { if (u < v) swap(u, v); while (v != 0) { int r = u % v; u = v; v = r; } return u; } pair<int, int> row[200000], col[200000]; int main(void) { int n, m, k; cin >> n >> m >> k; for (int i = 0; i < 200000; ++i) { row[i] = make_pair(0, -1); col[i] = make_pair(0, -1); } int t = 0; for (int i = 0; i < k; ++i) { t++; int q; cin >> q; if (q == 1) { int r, a; cin >> r >> a; r--; row[r] = make_pair(a, t); } else if (q == 2) { int c, a; cin >> c >> a; c--; col[c] = make_pair(a, t); } } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (row[i].second > col[j].second) cout << row[i].first; else cout << col[j].first; if (j != m - 1) cout << ; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> int dizi[100015]; int main() { int i, m, n, fark, k, j; scanf( %d %d %d %d , &m, &n, &k, &j); for (i = 1;; i++) { j = (j * m + n) % k; if (dizi[j]) { printf( %d , i - dizi[j]); break; } dizi[j] = i; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, i, j, k, a1, a2, a3, a4, res, ans, sum; bool k1, k2, k3; long long l, r, M; string s, q, s1, s2; long long a[5000000]; int main() { cin >> n >> a4; for (i = 1; i <= n; i++) cin >> a1 >> a2, a[i] = a1 * a2; for (i = 2; i <= n; i++) a[i] += a[i - 1]; for (i = 1; i <= a4; i++) { cin >> j; l = 1; r = n; while (l + 1 < r) { m = (l + r) / 2; if (a[m] >= j) r = m; else l = m + 1; } if (a[l] >= j) cout << l << endl; else cout << r << endl; } }
|
#include <bits/stdc++.h> using namespace std; int sum(int a) { int sum = a; while (a) { sum += a % 10; a /= 10; } return sum; } int main() { vector<int> v; int a; cin >> a; int b = a; while (a) { int check = sum(a); if (check == b) v.push_back(a); else if (check + 100 < b) break; a--; } cout << v.size() << endl; reverse(v.begin(), v.end()); for (auto i : v) { cout << i << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, Cnt = 0; double A[4005], C[4005], Ans = 0.0, Anx; double Abs(double x) { return x < 0 ? -x : x; } int main() { scanf( %d , &N); for (int i = 1; i <= 2 * N; i++) scanf( %lf , &A[i]), C[i] = A[i] - (int)A[i]; for (int i = 1; i <= 2 * N; i++) { if (C[i] == 0) Cnt++; Ans += -C[i]; } Anx = Abs(Ans + 1.0 * N); for (int i = max(N - Cnt, 0); i <= N; i++) { Anx = min(Anx, Abs(Ans + i)); } printf( %.3f n , Anx); return 0; }
|
#include <bits/stdc++.h> int main() { int k, a, b; scanf( %d , &k); for (int i = k / 2000 + (k % 2000 > 0);; ++i) { b = i * 2000 - k; a = i - b; if (b <= 1e6 && a < 0 && a >= -1e6) break; } puts( 2000 ); for (int i = 1; i <= 1998; ++i) printf( 0 ); printf( %d %d n , a, b); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; string s, s1 = , s2 = ; cin >> n >> s; reverse(s.begin(), s.end()); for (int i = 0; i < s.size(); ++i) { if (i % 2 == 0) s1 += s[i]; else s2 += s[i]; } reverse(s1.begin(), s1.end()); cout << s2 << s1; return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:10000000000 ) #pragma GCC optimize( O3 ) using namespace std; const int MOD = 1000000007; const int INF = 1000000007LL; const long long INF2 = 1LL << 62LL; const long double EPS = 1e-9; const int SIZE = 200010; mt19937 rng(time(0)); uniform_int_distribution<int> uid(-1000000000, 1000000000); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tt; cin >> tt; for (int rep_iter = 0; rep_iter < tt; ++rep_iter) { int n, x, y, ost; cin >> n >> x >> y; vector<int> b(n, -1); set<int> used_color; map<int, vector<int> > pos; for (int i2 = 0; i2 < n; ++i2) { int a; cin >> a; used_color.insert(a); pos[a].push_back(i2); } for (int i = 1; i <= n + 1; ++i) { if (!(used_color.find(i) != used_color.end())) { ost = i; break; } } set<pair<int, int> > colors; for (auto& i : pos) colors.insert({i.second.size(), i.first}); for (int rep_iter = 0; rep_iter < x; ++rep_iter) { auto p = *(--colors.end()); colors.erase(--colors.end()); --p.first; int color = p.second; int j = pos[color].back(); pos[color].pop_back(); b[j] = color; if (p.first) colors.insert(p); } y -= x; int m = n - x; int real_y; if (colors.size()) real_y = min(m, (m - (--colors.end())->first) * 2); else real_y = m; if (real_y < y) { cout << NO n ; continue; } cout << YES n ; vector<int> v; int j = -1; for (auto& i : colors) { if (i.first) j = v.size(); for (int rep_iter = 0; rep_iter < i.first; ++rep_iter) v.push_back(i.second); } for (auto& color : v) { if (!y) break; --y; int color_move = v[j]; j = (j + 1) % v.size(); while (color_move == color) { color_move = v[j]; j = (j + 1) % v.size(); } int k = pos[color].back(); pos[color].pop_back(); b[k] = color_move; } for (auto& i : b) { if (i == -1) i = ost; } for (auto& i : b) cout << i << ; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( O2 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (long long i = 0; i < v.size(); ++i) os << v[i] << ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& v) { for (auto it : v) os << it << ; return os; } template <typename T, typename S> ostream& operator<<(ostream& os, const pair<T, S>& v) { os << v.first << << v.second; return os; } const long long mod = 1e9 + 7; const long long inf = 2e18; const long long ninf = -2e18; long long pow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); time_t t1, t2; t1 = clock(); long long n, m, ta, tb, k; cin >> n >> m >> ta >> tb >> k; vector<long long> arra(n); for (long long i = 0; i < n; i++) { cin >> arra[i]; } vector<long long> arrb(m); for (long long i = 0; i < m; i++) { cin >> arrb[i]; } if (n <= k || m <= k) { cout << -1 << n ; return 0; } long long ans = -1; for (long long i = 0; i <= k; i++) { long long curr = arra[i] + ta; long long req = lower_bound(arrb.begin(), arrb.end(), curr) - arrb.begin(); long long rem = k - i; if (req + rem > m - 1) { ans = inf; break; } long long ap = arrb[req + rem] + tb; ans = max(ap, ans); } if (ans != inf) { cout << ans << n ; } else cout << -1 << n ; t2 = clock(); cerr << n << t2 - t1 << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> arr; int n, k; long long sum[5500]; double mx = -1e9; int main() { cin >> n >> k; for (int x, i = 1; i <= n; i++) { cin >> x; arr.push_back(x); sum[i] = sum[i - 1] + x; } for (int i = 1; i <= n; i++) { for (int j = i + k - 1; j <= n; j++) { mx = max(mx, (sum[j] - sum[i - 1]) / (double(j - i + 1))); } } printf( %0.15lf , mx); }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, i, j, f, n; cin >> t; while (t--) { cin >> n; string s; cin >> s; f = 0; for (i = 0; i < n; i++) if (s[i] == 0 ) { f = 1; if (i >= n / 2) cout << 1 << << i + 1 << << 1 << << i << endl; else cout << i + 1 << << n << << i + 2 << << n << endl; break; } if (!f) cout << 1 << << n - 1 << << 2 << << n << endl; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << t ; err(++it, args...); } template <typename T1, typename T2> ostream& operator<<(ostream& c, pair<T1, T2>& v) { c << ( << v.F << , << v.S << ) ; return c; } template <template <class...> class TT, class... T> ostream& operator<<(ostream& out, TT<T...>& c) { out << { ; for (auto& x : c) out << x << ; out << } ; return out; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } const int N = 200005; long long xx[N]; void solve() { long long n, x, y; cin >> n; long long ans = n; for (long long i = 1; i <= n - 1; i++) { cin >> x >> y; ans = (((ans * (++xx[x])) % 998244353) * (++xx[y])) % 998244353; } cout << ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { solve(); } cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-9; int ROUND(double x) { return (int)(x + 0.5); } bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; } bool ISEQUAL(double x, double y) { return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y))); } double SQSUM(double x, double y) { return x * x + y * y; } template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; } long long get(long long tmp) { long long a = 0; long long b = 0; long long base = 1; while (tmp) { a += base * (tmp % 10); b += base * (9 - (tmp % 10)); tmp /= 10; base *= 10; } long long c = a * b; return c; } int main() { int tmp1, tmp2; scanf( %d %d , &tmp1, &tmp2); long long l = tmp1, r = tmp2; vector<long long> res; res.push_back(get(l)); res.push_back(get(r)); for (long long i = 5; i <= r; i *= 10) { if (INRANGE(i, l, r)) { res.push_back(get(i)); } } sort(res.rbegin(), res.rend()); cout << res[0] << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5, mod = 1e8, inf = 1e9 + 5; long double pi = acos(-1); long long n, m, k, dp[N][15], a[N]; int main() { cin >> n >> m >> k; for (int i = 1; i <= n; i++) cin >> a[i]; long long maxans = 0; for (int i = 0; i <= m; i++) { dp[0][i] = -1e12; } for (int i = 1; i <= n; i++) { long long ans = 0; for (int j = 1; j <= m; j++) { if (j == 1) { dp[i][j] = max(a[i] - k, dp[i - 1][m] + a[i] - k); } else dp[i][j] = dp[i - 1][j - 1] + a[i]; maxans = max(maxans, dp[i][j]); } } cout << maxans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; long long a[maxn], x[maxn], y[maxn], c[7], d[7], ans; int n, m; bool cmp(long long x, long long y) { return x > y; } void sol(int pos, int num, int flag) { memset(d, 0, sizeof(d)); if (flag) { for (int i = 1; i <= pos; i++) { long long w = y[i]; for (int j = 0; j < 4 - num; j++) { w -= a[(c[j] - 1) * m + i]; } d[num] = w; sort(d, d + num + 1, cmp); } long long ac = 0; for (int i = 0; i < num; i++) { ac += d[i]; } for (int j = 0; j < 4 - num; j++) { ac += x[c[j]]; } ans = max(ans, ac); } else { for (int i = 1; i <= pos; i++) { long long w = x[i]; for (int j = 0; j < 4 - num; j++) { w -= a[(i - 1) * m + c[j]]; } d[num] = w; sort(d, d + num + 1, cmp); } long long ac = 0; for (int i = 0; i < num; i++) { ac += d[i]; } for (int j = 0; j < 4 - num; j++) { ac += y[c[j]]; } ans = max(ans, ac); } } int main() { scanf( %d%d , &n, &m); long long sum = 0; for (int i = 1; i <= n * m; i++) { scanf( %lld , &a[i]); sum += a[i]; } memset(d, 0, sizeof(d)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { x[i] += a[(i - 1) * m + j]; } d[4] = x[i]; sort(d, d + 5, cmp); } for (int i = 0; i < 4; i++) { ans += d[i]; } long long xxx = 0; memset(d, 0, sizeof(d)); for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { y[i] += a[(j - 1) * m + i]; } d[4] = y[i]; sort(d, d + 5, cmp); } for (int i = 0; i < 4; i++) { xxx += d[i]; } ans = max(xxx, ans); if (n <= 4 || m <= 4) { printf( %lld n , sum); return 0; } for (int i = 1; i <= n; i++) { c[0] = i; sol(m, 3, 1); } for (int i = 1; i <= m; i++) { c[0] = i; sol(n, 3, 0); } if (n > m) { for (int i = 1; i <= m; i++) { for (int j = i + 1; j <= m; j++) { c[0] = i; c[1] = j; sol(n, 2, 0); } } } else { for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { c[0] = i; c[1] = j; sol(m, 2, 1); } } } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &x, T y) { if (y > x) x = y; } template <class T> inline void umin(T &x, T y) { if (y < x) x = y; } const int N = 2e5 + 5, B = 0x7fffffff; struct edge { int u, v, l, r; } a[N]; vector<pair<int, pair<int, int>>> g[N]; int n, m; int ans; bool bfs(int x, int ql, int qr) { bool vis[N]; memset(vis, 0, sizeof vis); queue<int> Q; Q.push(x); vis[x] = 1; while (!Q.empty()) { int fr = Q.front(); Q.pop(); for (pair<int, pair<int, int>> ss : g[fr]) { if (vis[ss.first] != 1 && ss.second.first <= ql && qr <= ss.second.second) { vis[ss.first] = 1; Q.push(ss.first); } } } return vis[n]; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d%d%d , &a[i].u, &a[i].v, &a[i].l, &a[i].r); int x = a[i].u; int y = a[i].v; int l = a[i].l; int r = a[i].r; g[x].push_back({y, {l, r}}); g[y].push_back({x, {l, r}}); } for (int i = 1; i <= m; i++) { int l = 1, r = 1e9, ann = -1; while (l <= r) { int mid = (l + r) >> 1; if (bfs(1, a[i].l, mid)) l = mid + 1, ann = mid; else r = mid - 1; } if (ann != -1) umax(ans, (ann - a[i].l) + 1); } if (ans == 0) puts( Nice work, Dima! ); else printf( %d , ans); return !!0; }
|
#include <bits/stdc++.h> using namespace std; 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 INF = 1e17; long long int NINF = (INF * -1); priority_queue<pair<long long int, long long int>, vector<pair<long long int, long long int>>, greater<pair<long long int, long long int>>> pq; vector<long long int> indegree; vector<vector<pair<long long int, long long int>>> adj; vector<long long int> distances; vector<vector<long long int>> arr; vector<bool> visited; vector<long long int> level, height; vector<long long int> ans; long long int dfs(long long int src, long long int parent = -1, long long int l = 0) {} void solve() { long long int n; cin >> n; string a; string b; cin >> a >> b; vector<long long int> ab, ba; vector<pair<long long int, long long int>> ans; for (long long int i = 0; i < n; i++) { if (a[i] == b[i]) { continue; } if (a[i] == a and b[i] == b ) { if (ab.size() != 0) { ans.push_back({ab.back(), i + 1}); ab.pop_back(); } else { ab.push_back(i + 1); } } else { if (ba.size() != 0) { ans.push_back({ba.back(), i + 1}); ba.pop_back(); } else { ba.push_back(i + 1); } } } if (ab.size() == 1 and ba.size() == 1) { ans.push_back({ba.back(), ba.back()}); ans.push_back({ba.back(), ab.back()}); ab.pop_back(); ba.pop_back(); } if (ab.size() != 0 || ba.size() != 0) { cout << -1 n ; return; } cout << ans.size(); cout << n ; ; for (auto i : ans) { cout << i.first << << i.second; cout << n ; ; } return; } signed main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; template <typename T, typename T1> T amax(T& a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T amin(T& a, T1 b) { if (b < a) a = b; return a; } const long long N = 200005, INF = 2000000000000000000; void solve() { long long n, m; cin >> n >> m; long long i = 0, j = 0; char v[50][50]; long long a = 1000000, b = 10000, c = 0, d = 0; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> v[i][j]; if (v[i][j] == * ) { a = min(i, a); b = min(j, b); c = max(i, c); d = max(j, d); } } } for (i = a; i < c + 1; i++) { for (j = b; j < d + 1; j++) { cout << v[i][j]; } cout << n ; } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); solve(); }
|
#include <bits/stdc++.h> #pragma optimization_level 3 #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int inf = INT32_MAX; struct Node { Node *l = 0, *r = 0; vector<int> m1, m2; Node(Node *a, Node *b) { m1 = vector<int>(9); m2 = vector<int>(9); l = a, r = b; for (int q = 0; q < 9; q++) m1[q] = min(l->m1[q], r->m1[q]); for (int q = 0; q < 9; q++) m2[q] = min(max(l->m1[q], r->m1[q]), min(l->m2[q], r->m2[q])); } Node(Node *a, Node *b, int c) { m1 = vector<int>(9); m2 = vector<int>(9, inf); l = a, r = b; for (int q = 0, v = c; q < 9; q++, c /= 10) m1[q] = c % 10 ? v : inf; } }; Node *build(int l, int r, vector<int> &m) { if (l == r) return new Node(0, 0, m[l - 1]); int md = (l + r) / 2; return new Node(build(l, md, m), build(md + 1, r, m)); } pair<int, int> que(int l, int r, int l1, int r1, Node *n, int c) { if (l == l1 && r == r1) return {n->m1[c], n->m2[c]}; int md = (l1 + r1) / 2; if (r <= md) return que(l, r, l1, md, n->l, c); if (l > md) return que(l, r, md + 1, r1, n->r, c); pair<int, int> p1 = que(l, md, l1, md, n->l, c); pair<int, int> p2 = que(md + 1, r, md + 1, r1, n->r, c); return {min(p1.first, p2.first), min(max(p1.first, p2.first), min(p1.second, p2.second))}; } void upd(int l, int r, int p, Node *n, int v) { if (l == r) { for (int q = 0, c = v; q < 9; q++, v /= 10) n->m1[q] = v % 10 ? c : inf; return; } int md = (l + r) / 2; if (p <= md) upd(l, md, p, n->l, v); else upd(md + 1, r, p, n->r, v); for (int q = 0; q < 9; q++) n->m1[q] = min(n->l->m1[q], n->r->m1[q]); for (int q = 0; q < 9; q++) n->m2[q] = min(max(n->l->m1[q], n->r->m1[q]), min(n->l->m2[q], n->r->m2[q])); } int a, z; vector<int> m; int main() { cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); cout.sync_with_stdio(0); ; cin >> a >> z; m = vector<int>(a); for (int q = 0; q < a; q++) cin >> m[q]; Node *n = build(1, a, m); for (; z; z--) { int t, x, y; cin >> t >> x >> y; if (t == 1) upd(1, a, x, n, y); else { int o = inf; for (int q = 0; q < 9; q++) { pair<int, int> p = que(x, y, 1, a, n, q); if (p.second == inf) continue; o = min(o, p.first + p.second); } cout << (o == inf ? -1 : o) << n ; } } }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.