func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int N, C, cnt; int A[33], P[33]; double dp[33][33][222], sol; inline int f(int l, int r, int i) { if (i < l || i > r) return i; int ret = i - l + 1; int len = r - l + 1; ret = len - ret + 1; ret = l + ret - 1; return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout << setprecision(15) << fixed; cin >> N >> C; for (int I = 1; I <= N; I++) cin >> A[I]; for (int I = 1; I <= N; I++) for (int K = I + 1; K <= N; K++) dp[I][K][0] = 1; for (int c = 1; c <= C; c++) { for (int I = 1; I <= N; I++) { for (int K = 1; K <= N; K++) { for (int l = 1; l <= N; l++) { for (int r = l; r <= N; r++) { int pi = f(l, r, I); int pk = f(l, r, K); dp[I][K][c] += dp[pi][pk][c - 1]; } } dp[I][K][c] /= (N * (N - 1) / 2) + N; } } } for (int I = 1; I <= N; I++) for (int K = 1; K <= N; K++) if (A[I] > A[K]) { sol += dp[I][K][C]; } cout << sol << endl; } |
#include <bits/stdc++.h> const int inf = INT_MAX; const int MAX = 1e6 + 8; const long long MOD = 998244353; const int TOT_PRIMES = 1e6 + 9; const int MAX_A = 71; const int LN = 20; using namespace std; vector<int> adj[MAX]; int vis[MAX]; long long c = 0; void dfs(int u) { vis[u] = 1; c = c + 1; for (auto v : adj[u]) { if (!vis[v]) { dfs(v); } } } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; adj[i].push_back(x); adj[x].push_back(i); } vector<long long> res; for (int i = 1; i <= n; i++) { if (!vis[i]) { dfs(i); res.push_back(c); c = 0; } } sort(res.begin(), res.end()); long long ans = 0; int m = res.size(); if (m == 1) { cout << res[0] * res[0]; return 0; } ans = res[m - 1] + res[m - 2]; ans = ans * ans; for (int i = 0; i < m - 2; i++) { ans = ans + (res[i] * res[i]); } cout << ans; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; long long mod = 1000000007; void solve() { long long n; cin >> n; long long a[n]; long long k0 = 0; long long k1 = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 0) k0++; if (a[i] == 1) k1++; } long long ans = k1 * (pow(2, k0)); cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> const long long inf = std::numeric_limits<long long>::max(); const int infint = std::numeric_limits<int>::max(); const long long mod = 1e9 + 7; using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<int> g[500100]; long long a[500100]; long long par[500100][21]; void dfs(int v, int p) { for (auto i : g[v]) { if (i == p) continue; dfs(i, v); par[i][0] = v; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; long long mn = inf; for (int i = 0; i < n; i++) { cin >> a[i]; mn = min(a[i], mn); } for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } for (int i = 0; i < n; i++) { if (a[i] == mn) { par[i][0] = i; dfs(i, -1); break; } } long long w = 0; for (int i = 1; i < 21; i++) for (int j = 0; j < n; j++) par[j][i] = par[par[j][i - 1]][i - 1]; for (int i = 0; i < n; i++) { if (a[i] == mn) continue; long long now = inf; for (int j = 0; j < 21; j++) { now = min(now, a[par[i][j]] * (j + 1) + a[i]); } w += now; } cout << w; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename _T> void read(_T &x) { _T f = 1; x = 0; char s = getchar(); while (s > 9 || s < 0 ) { if (s == - ) f = -1; s = getchar(); } while ( 0 <= s && s <= 9 ) { x = (x << 3) + (x << 1) + (s ^ 48); s = getchar(); } x *= f; } struct ming { long long typ, t, x, id, pos; } a[100010]; long long n, ans[100010], num[100010]; vector<long long> vec; long long cmp1(const ming &a, const ming &b) { return a.t < b.t; } long long cmp2(const ming &a, const ming &b) { return a.id < b.id; } void merge(long long l, long long r) { if (l == r) return; long long mid = l + r >> 1, j = l; merge(l, mid); merge(mid + 1, r); sort(a + l, a + mid + 1, cmp1); sort(a + mid + 1, a + r + 1, cmp1); for (long long i = mid + 1; i <= r; i++) { while (j <= mid && a[j].t <= a[i].t) num[a[j].pos] += a[j].typ, j++; if (!a[i].typ) ans[a[i].id] += num[a[i].pos]; } for (long long i = l; i < j; i++) num[a[i].pos] -= a[i].typ; } signed main() { read(n); for (long long i = 1; i <= n; i++) { read(a[i].typ); read(a[i].t); read(a[i].x); if (a[i].typ == 2) a[i].typ = -1; if (a[i].typ == 3) a[i].typ = 0; a[i].id = i; vec.push_back(a[i].x); } sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end()); for (long long i = 1; i <= n; i++) a[i].pos = lower_bound(vec.begin(), vec.end(), a[i].x) - vec.begin() + 1; merge(1, n); sort(a + 1, a + n + 1, cmp2); for (long long i = 1; i <= n; i++) if (!a[i].typ) printf( %lld n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; int x1, y1, x2, y2; cin >> n; long long ans = 0; for (int i = 1; i <= n; i++) { cin >> x1 >> y1 >> x2 >> y2; ans += (long long)(x2 - x1 + 1) * (y2 - y1 + 1); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e13, Mo = 998244353; const int N = 1000000; const double eps = 1e-6; namespace slow_IO { long long read() { long long x = 0; int zf = 1; char ch = getchar(); while (ch != - && (ch < 0 || ch > 9 )) ch = getchar(); if (ch == - ) zf = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * zf; } void write(long long y) { if (y < 0) putchar( - ), y = -y; if (y > 9) write(y / 10); putchar(y % 10 + 0 ); } } // namespace slow_IO using namespace slow_IO; vector<int> E1[N + 5], E2[N + 5]; int Flag1[N + 5], Flag2[N + 5]; int Ans[N + 5]; int ans = 0; int main() { int n = read(), m = read(); for (int i = (1); i <= (m); i++) { int x = read(), y = read(); E1[x].push_back(y); E2[y].push_back(x); } for (int i = (1); i <= (n); i++) if (!Flag1[i]) { Flag1[i] = Flag2[i] = 1; for (int j = (0); j < (E1[i].size()); j++) Flag1[E1[i][j]] = 1; } for (int i = (n); i >= (1); i--) if (Flag2[i]) { for (int j = (0); j < (E2[i].size()); j++) if (Flag2[E2[i][j]]) Flag2[i] = 0; } for (int i = (1); i <= (n); i++) if (Flag2[i]) Ans[++ans] = i; printf( %d n , ans); for (int i = (1); i <= (ans); i++) printf( %d%c , Ans[i], i == ans ? n : ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 109; int n; int a[N]; map<int, int> m; set<int> s[2]; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; m[a[i]]++; } int pos = 0; for (auto p : m) if (p.second == 1) { s[pos].insert(p.first); pos = 1 - pos; } if (s[0].size() == s[1].size()) { string res(n, A ); for (int i = 0; i < n; ++i) if (s[1].count(a[i])) res[i] = B ; cout << YES << endl; for (auto c : res) cout << c; cout << endl; return 0; } else { assert(int(s[0].size()) - 1 == int(s[1].size())); string res(n, A ); for (int i = 0; i < n; ++i) if (s[1].count(a[i])) res[i] = B ; int id = -1; for (auto p : m) if (p.second >= 3) { id = p.first; break; } if (id == -1) { cout << NO << endl; return 0; } bool flag = false; for (int i = 0; i < n; ++i) { if (a[i] == id) if (!flag) { flag = true; res[i] = B ; } } cout << YES << endl; for (auto c : res) cout << c; cout << endl; return 0; } return 0; } |
#include <bits/stdc++.h> bool comp(const int& a, const int& b) { return a < b ? false : true; } using namespace std; int main() { long long int k, a, b, m, n; cin >> k >> m >> n; a = max(m, n); b = min(m, n); long long int ans = 0; if (a > 0 && b > 0) { ans = a / k - (b - 1) / k; } else if (a < 0 && b < 0) { ans = abs(b) / k - (abs(a) - 1) / k; } else { ans = abs(a) / k; ans += (abs(b)) / k; ans += 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2000 + 11; const int MOD = 1e9 + 7; int dp[N][2][2][N]; int m, d; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> m >> d; string s1, s2; cin >> s1 >> s2; s1 = . + s1; s2 = . + s2; dp[0][0][0][0] = 1; int n = s1.size() - 1; for (int i = 1; i <= n; i++) for (int d1 = 0; d1 <= 1; d1++) for (int d2 = 0; d2 <= 1; d2++) for (int mm = 0; mm < m; mm++) { for (int x = 0; x <= 9; x++) { if (d1 == 0 && x < s1[i] - 0 ) continue; if (d2 == 0 && x > s2[i] - 0 ) continue; if (i % 2 == 1 && x == d) continue; if (i % 2 == 0 && x != d) continue; int dd1 = d1, dd2 = d2, mmm = (mm * 10 + x) % m; if (x > s1[i] - 0 ) dd1 = 1; if (x < s2[i] - 0 ) dd2 = 1; dp[i][dd1][dd2][mmm] = (dp[i][dd1][dd2][mmm] + dp[i - 1][d1][d2][mm]) % MOD; } } int ans = 0; for (int d1 = 0; d1 <= 1; d1++) for (int d2 = 0; d2 <= 1; d2++) ans = (ans + dp[n][d1][d2][0]) % MOD; cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; long long int a[n][2]; for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1]; long long int l[n][2], r[n][2]; long long int mi = a[0][0]; long long int mx = a[0][1]; l[0][0] = mi; l[0][1] = mx; if (n == 1) { cout << a[0][1] - a[0][0]; return 0; } for (int i = 1; i < n; i++) { if (l[i - 1][0] == -1) { l[i][0] = -1; l[i][1] = -1; continue; } long long int x, y; x = max(a[i][0], l[i - 1][0]); y = min(a[i][1], l[i - 1][1]); if (y - x < 0) { l[i][0] = -1; l[i][1] = -1; } else { l[i][0] = x; l[i][1] = y; } } mx = a[n - 1][1]; mi = a[n - 1][0]; r[n - 1][0] = mi; r[n - 1][1] = mx; for (int i = n - 2; i >= 0; i--) { if (r[i + 1][0] == -1) { r[i][0] = -1; r[i][1] = -1; continue; } long long int x, y; x = max(a[i][0], r[i + 1][0]); y = min(a[i][1], r[i + 1][1]); if (y - x < 0) { r[i][0] = -1; r[i][1] = -1; } else { r[i][0] = x; r[i][1] = y; } } long long int ans = 0; if (l[n - 2][0] != -1) ans = l[n - 2][1] - l[n - 2][0]; if (r[1][0] != -1) ans = max(ans, r[1][1] - r[1][0]); for (int i = 1; i < n - 1; i++) { long long int x, y; if (l[i - 1][0] == -1 || r[i + 1][0] == -1) continue; x = max(l[i - 1][0], r[i + 1][0]); y = min(l[i - 1][1], r[i + 1][1]); ans = max(ans, max((long long int)0, y - x)); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(10); ; int n; cin >> n; vector<int> deg(n); int ones = 0; vector<int> others, ops; long long total = 0; for (int i = 0; i < (int)n; i++) { cin >> deg[i]; if (deg[i] == 1) { ones++; ops.push_back(i); } else { total += deg[i]; others.push_back(i); } } if (total - (n - ones - 1) * 2 < ones) return cout << NO n , 0; vector<pair<int, int>> edges; if (others.size() == 0 && ops.size() == 2) { cout << YES 1 n ; cout << 1 n ; cout << ops[0] + 1 << << ops[1] + 1 << n ; return 0; } for (int i = 1; i < (int)others.size(); i++) { edges.push_back({others[i - 1], others[i]}); } int opptr = 0; if (others.size() == 1) { for (int i = 0; i < (int)ops.size(); i++) edges.push_back({ops[i], others[0]}); } else { if (opptr < (int)ops.size()) edges.push_back({ops[opptr++], others[0]}); if (opptr < (int)ops.size()) edges.push_back({ops[opptr++], others.back()}); for (int i = 0; i < (int)deg[others[0]] - 2; i++) { if (opptr >= (int)ops.size()) break; edges.push_back({ops[opptr++], others[0]}); } for (int i = 0; i < (int)deg[others.back()] - 2; i++) { if (opptr >= (int)ops.size()) break; edges.push_back({ops[opptr++], others.back()}); } } for (int i = 1; i < (int)others.size() - 1; i++) { int av = deg[others[i]] - 2; while (opptr < (int)ops.size() && av > 0) { edges.push_back({others[i], ops[opptr++]}); av--; } } cout << YES << (others.size() - 1 + (ops.size() > 0) + (ops.size() > 1)) << n ; cout << edges.size() << n ; for (int i = 0; i < (int)edges.size(); i++) cout << (edges[i].first + 1) << << edges[i].second + 1 << n ; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; int dy[] = {0, 0, 1, -1, -1, -1, 1, 1}; void file() {} int main() { cout << setprecision(20) << fixed; ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int k; cin >> k; int x = 0; for (int i = 2; i <= 2000; i++) { long long s = k + i; if (ceil(s / (double(i - 1))) <= 1e6) { x = i; break; } } if (!x) return cout << -1 << n , 0; cout << x << n ; cout << -1 ; long long s = k + x; long long rem = s % (x - 1); long long num = s / (x - 1); for (int i = 0; i < x - 1; i++) if (rem) cout << num + 1 << , rem--; else cout << num << ; cout << n ; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { x = 0; bool w = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) w = 0; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } x = w ? x : -x; } const long long N = 1e5 + 10, Mod = 1e9 + 7; long long n, m, a[N], lg[N], b[N], f[N], c[N], sum[N], d[N], ans[N]; struct en { long long l, r, id; bool operator<(const en &x) const { return r < x.r; } } q[N]; inline long long Get(long long x) { return f[x] ? f[x] = Get(f[x]) : x; } inline long long ji(long long x, long long y) { return (b[x] - b[y + 1] * lg[y - x + 1] % Mod + Mod) % Mod; } inline void add(long long x, long long y) { f[x] = y; c[y] = c[x]; if ((x - c[x] > 30 && sum[y] > 9) || (sum[x] + (sum[y] << x - c[x])) > Mod) sum[y] = Mod; else sum[y] = sum[x] + (sum[y] << x - c[x]); } signed main() { read(n), read(m); lg[0] = 1; for (long long i = 1; i <= n; i++) read(a[i]), sum[i] = a[i], lg[i] = (lg[i - 1] << 1) % Mod, c[i] = i - 1; for (long long i = 1; i <= m; i++) read(q[i].l), read(q[i].r), q[i].id = i; for (long long i = n; i >= 1; i--) b[i] = ((b[i + 1] << 1) + a[i] + Mod) % Mod; sort(q + 1, q + m + 1); long long k = 1; for (long long i = 1; i <= n; i++) { while (sum[i] >= 0 && c[i]) add(c[i], i); d[i] = (d[c[i]] + (ji(c[i] + 1, i) << 1) % Mod + Mod) % Mod; while (q[k].r == i) { long long x = Get(q[k].l); ans[q[k].id] = (d[i] - d[x] + ji(q[k].l, x) + Mod) % Mod; k++; } } for (long long i = 1; i <= m; i++) printf( %lld n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long read() { char ch = getchar(); long long x = 0, ff = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) ff = -ff; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * ff; } void write(long long aa) { if (aa < 0) putchar( - ), aa = -aa; if (aa > 9) write(aa / 10); putchar(aa % 10 + 0 ); return; } long long n; long long a[200005]; long long tt[800005], tts[800005], lz[800005]; void up(long long rt) { tt[rt] = min(tt[rt << 1], tt[rt << 1 | 1]); if (tt[rt << 1] >= tt[rt << 1 | 1]) tts[rt] = tts[rt << 1 | 1]; else tts[rt] = tts[rt << 1]; return; } void bt(long long rt, long long ll, long long rr) { if (ll == rr) { tt[rt] = read(), tts[rt] = ll; return; } long long mid = (ll + rr) >> 1; bt(rt << 1, ll, mid); bt(rt << 1 | 1, mid + 1, rr); up(rt); return; } void push(long long rt) { if (!lz[rt]) return; tt[rt << 1] += lz[rt]; tt[rt << 1 | 1] += lz[rt]; lz[rt << 1] += lz[rt]; lz[rt << 1 | 1] += lz[rt]; lz[rt] = 0; return; } void update(long long rt, long long ll, long long rr, long long L, long long R, long long kk) { if (ll == L && rr == R) { tt[rt] += kk; lz[rt] += kk; return; } long long mid = (ll + rr) >> 1; push(rt); if (R <= mid) update(rt << 1, ll, mid, L, R, kk); else if (L > mid) update(rt << 1 | 1, mid + 1, rr, L, R, kk); else update(rt << 1, ll, mid, L, mid, kk), update(rt << 1 | 1, mid + 1, rr, mid + 1, R, kk); up(rt); return; } int main() { n = read(); bt(1, 1, n); for (long long i = 1; i <= n; ++i) { long long now = tts[1]; a[now] = i; update(1, 1, n, now, now, n * n); if (now < n) update(1, 1, n, now + 1, n, -i); } for (long long i = 1; i <= n; ++i, putchar( )) write(a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k; scanf( %d , &k); if (k % 2 == 1) { printf( -1 n ); return 0; } char a[k][k]; memset(a, 0, sizeof(a)); for (int layer = 0; layer < k / 2; layer++) { char c; if (layer % 2) c = w ; else c = b ; for (int runner = layer; runner < k - layer; runner++) a[runner][layer] = a[layer][runner] = a[runner][k - layer - 1] = a[k - layer - 1][runner] = c; } for (int i = 0; i < k; i++) for (int j = 0; j < k; j++) { for (int l = 0; l < k; l++) if (i % 2) if (a[j][l] == w ) printf( b ); else printf( w ); else printf( %c , a[j][l]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, s; cin >> a; cin >> s; long la = 0, ls = 0, i = 0, ps = 0, pv = 0; la = a.length(); ls = s.length(); vector<int> v; for (i = 0; i < ls; i++) v.push_back(s[i]); sort(v.rbegin(), v.rend()); while (ps < la && pv < ls) { if (a[ps] < v[pv]) { a[ps] = v[pv]; ps++; pv++; } else if (a[ps] >= v[pv]) ps++; } cout << a; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int n1; vector<long long> v; int c[20]; int a[20]; bool viz[20]; int f[20]; inline void get(int i) { int cif = 0; long long zece = 1; long long r = 0; for (zece = 1; i > 0; i >>= 1, zece *= 10LL) { ++cif; if ((i & 1) != 0) r += 7LL * zece; else r += 4LL * zece; } if (r != 0LL) v.push_back(r); for (++cif; cif < 11; ++cif, zece *= 10LL) { r += 4LL * zece; v.push_back(r); } } void back(int k1) { if (k1 == n1 + 1) return; for (int i = 1; i <= n1; ++i) { if (viz[i]) continue; if (k > f[n1 - k1]) k -= f[n1 - k1]; else { viz[i] = true; a[k1] = i; back(k1 + 1); return; } } printf( -1 n ); exit(0); } int main() { scanf( %d%d , &n, &k); for (int i = 0; i < 1024; ++i) { get(i); } sort(v.begin(), v.end()); int start = max(1, n - 12); f[0] = f[1] = 1; for (int i = 2; i < 13; ++i) f[i] = f[i - 1] * i; n1 = n - start + 1; back(1); int rez = 0; long long start1 = (long long)start; for (size_t i = 0, lim = v.size(); i < lim && v[i] < start1; ++i) { ++rez; } int x = start; for (int i = 1; i <= n1; ++i, ++x) { c[i] = x; } for (int i = 1; i <= n1; ++i) { if (find(v.begin(), v.end(), (long long)(i - 1) + start1) != v.end() && find(v.begin(), v.end(), (long long)c[a[i]]) != v.end()) ++rez; } printf( %d n , rez); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, i, j, e, ar[105]; scanf( %d , &a); while (a--) { scanf( %d , &b); if (b == 1) { scanf( %d , &c); if (c % 2 == 0) printf( 1 n1 n ); else printf( -1 n ); } else { e = -1; for (i = 1; i <= b; i++) { scanf( %d , &ar[i]); } for (i = 1; i <= b; i++) { if (ar[i] % 2 == 0) { d = 1; break; } if (e != -1) { d = 2; break; } if (e == -1) e = i; } printf( %d n , d); if (d == 1) printf( %d n , i); else printf( %d %d n , e, i); } } return 0; } |
#include <bits/stdc++.h> using namespace std; double mn = 1e20, mx, t; int n, low, high; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> t; mn = min(mn, (t + 1 - 1e-8) / i); mx = max(mx, t / i); } n++; low = (int)(n * mx + 1e-9), high = (int)(n * mn + 1 - 1e-9); if (low + 1 == high) cout << unique n << low; else cout << not unique ; } |
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; int arr[26] = {}; int n = s.length(); int count = 0; for (int i = 0; i < n; i++) { arr[s[i] - a ]++; if (arr[s[i] - a ] == 2) { arr[s[i] - a ] = 0; count--; } else count++; } if (count == 0 || count == 1) { cout << First << n ; } else { if (count % 2 == 0) { cout << Second << n ; } else cout << First << n ; } } int main() { long long t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 400100; vector<int> grafo[MAXN]; int a[MAXN], b[MAXN]; pair<int, int> p[MAXN]; int q[MAXN]; bool vis[MAXN]; int n; vector<int> vec; void dfs(int x) { vis[x] = true; vec.push_back(x); if (x > n) vis[x - n] = true; else vis[x + n] = true; for (int i = 0; i < grafo[x].size(); i++) { int at = grafo[x][i]; if (vis[at] == true) continue; dfs(at); } } int main() { int t; cin >> t; while (t--) { cin >> n; vec.clear(); for (int i = 1; i <= 2 * n; i++) { p[i] = {0, 0}; grafo[i].clear(); q[i] = 0; vis[i] = false; a[i] = b[i] = 0; } for (int i = 1; i <= n; i++) { int x; cin >> x; a[x] = i; q[x]++; if (p[x].first == 0) p[x].first = i; else p[x].second = i; } for (int i = 1; i <= n; i++) { int x; cin >> x; b[x] = i; q[x]++; if (p[x].first == 0) p[x].first = i; else p[x].second = i; } bool f = true; for (int i = 1; i <= n; i++) if (q[i] != 2) f = false; if (f == false) { cout << -1 << endl; continue; } for (int i = 1; i <= n; i++) { int p1 = p[i].first, p2 = p[i].second; if (a[i] > 0 && b[i] > 0) { grafo[p1].push_back(p2); grafo[p2].push_back(p1); grafo[p1 + n].push_back(p2 + n); grafo[p2 + n].push_back(p1 + n); } else { grafo[p1].push_back(p2 + n); grafo[p2].push_back(p1 + n); grafo[p2 + n].push_back(p1); grafo[p1 + n].push_back(p2); } } vector<int> resp; for (int i = 1; i <= n; i++) { if (vis[i] == true) continue; vec.clear(); dfs(i); int h = vec.size(); int cnt = 0; for (int j = 0; j < vec.size(); j++) { int at = vec[j]; if (at > n) cnt++; } if (cnt < h - cnt) { for (int j = 0; j < vec.size(); j++) if (vec[j] > n) resp.push_back(vec[j] - n); } else { for (int j = 0; j < vec.size(); j++) if (vec[j] <= n) resp.push_back(vec[j]); } } cout << resp.size() << endl; for (int i = 0; i < resp.size(); i++) cout << resp[i] << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int read() { int s = 0; char c = getchar(), lc = + ; while (c < 0 || 9 < c) lc = c, c = getchar(); while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = getchar(); return lc == - ? -s : s; } void write(int x) { if (x < 0) { putchar( - ); x = -x; } if (x < 10) putchar(x + 0 ); else { write(x / 10); putchar(x % 10 + 0 ); } } void print(int x, char c = n ) { write(x); putchar(c); } void L(int x) { putchar( L ); putchar( ); print(x); } void R(int x) { putchar( R ); putchar( ); print(x); } char a[N]; signed main() { scanf( %s , a + 1); int n = strlen(a + 1); print(4); L(2); L(2); R(2); R(n + 2 + n - 1); return 0; } |
#include <bits/stdc++.h> int n, m, k, s, a[1000000], b[1000000]; int amin[1000000]; int bmin[1000000]; struct Gadget { long long cost; int id; Gadget(long long cost, int id) : cost(cost), id(id) {} bool operator<(const Gadget &other) const { return cost < other.cost; } }; int main() { scanf( %d %d %d %d , &n, &m, &k, &s); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); amin[i] = i; if (i > 0 && a[amin[i - 1]] < a[i]) amin[i] = amin[i - 1]; } for (int i = 0; i < n; i++) { scanf( %d , &b[i]); bmin[i] = i; if (i > 0 && b[bmin[i - 1]] < b[i]) bmin[i] = bmin[i - 1]; } long long asum, bsum; std::vector<Gadget> d, p; for (int i = 0; i < m; i++) { int t, c; scanf( %d %d , &t, &c); if (t == 1) d.push_back(Gadget(c, i + 1)); else p.push_back(Gadget(c, i + 1)); } d.push_back(Gadget(0, 0)); p.push_back(Gadget(0, 0)); std::sort(d.begin(), d.end()); std::sort(p.begin(), p.end()); for (int i = 1; i < d.size(); i++) d[i].cost += d[i - 1].cost; for (int i = 1; i < p.size(); i++) p[i].cost += p[i - 1].cost; int day_ans = n; int d_ans = 0, p_ans = 0; for (int i = 0; i <= std::min(k, (int)d.size() - 1); i++) { int j = k - i; if (j >= p.size()) continue; int left = 0, right = day_ans - 1; while (left <= right) { int mid = (left + right) >> 1; long long cost = d[i].cost * a[amin[mid]] + p[j].cost * b[bmin[mid]]; if (cost <= s) { if (mid < day_ans) { day_ans = mid; d_ans = i; p_ans = j; } right = mid - 1; } else { left = mid + 1; } } } if (day_ans == n) { puts( -1 ); return 0; } printf( %d n , day_ans + 1); for (int i = 1; i <= d_ans; i++) { printf( %d %d n , d[i].id, amin[day_ans] + 1); } for (int i = 1; i <= p_ans; i++) { printf( %d %d n , p[i].id, bmin[day_ans] + 1); } } |
#include <bits/stdc++.h> using namespace std; int to1[1000010], w[1000010], begin1[1000010], next1[1000010], v[1000010], p[1000010], d[1000010], e; void add(int x, int y, int z) { to1[++e] = y; next1[e] = begin1[x]; begin1[x] = e; w[e] = z; } void ins(int x) { int i; for (i = 30; i >= 0; i--) if ((x >> i) & 1) { if (!p[i]) { p[i] = x; break; } x ^= p[i]; } } void dfs(int x, int now) { int i; d[x] = now; v[x] = 1; for (i = begin1[x]; i; i = next1[i]) { if (!v[to1[i]]) dfs(to1[i], now ^ w[i]); else ins(now ^ w[i] ^ d[to1[i]]); } } int find(int x) { int i; for (i = 30; i >= 0; i--) if ((p[i] ^ x) < x) x = p[i] ^ x; return x; } int main() { int i, u, v, w, n, m; scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d%d , &u, &v, &w); add(u, v, w); add(v, u, w); } dfs(1, 0); printf( %d n , find(d[n])); } |
#include <bits/stdc++.h> using namespace std; const int inf = 1000000000; const long long INF = 1LL * inf * inf; const double eps = 1e-9; const int md = (int)1e9 + 7; const double EPS = 1e-7; const long long maxll = numeric_limits<long long>::max(); const double PI = acos(-1.0); template <typename name> inline name sqr(name x) { return x * x; } inline long long multmod(long long a, long long b, long long md) { if (!a) return 0; if (a % 2 == 1) return (multmod(a - 1, b, md) + b) % md; else return sqr<long long>(multmod(a / 2, b, md)) % md; } template <typename name> inline name bpow(name base, long long exp) { name res = base; while (exp) { if (exp % 2 == 1) { res = res * base; } base = base * base; exp /= 2; } return res; } int n, x, m; double p[2000]; struct matr { double a[1 << 7][1 << 7]; } mat, qq; const matr& operator*(const matr& x, const matr& y) { for (int i = 0; i < (1 << 7); i++) for (int j = 0; j < (1 << 7); j++) qq.a[i][j] = 0; for (int i = 0; i < (1 << 7); i++) for (int j = 0; j < (1 << 7); j++) for (int k = 0; k < (1 << 7); k++) qq.a[i][j] += x.a[i][k] * y.a[k][j]; return qq; } int main() { ios_base ::sync_with_stdio(0); cin >> n >> x; for (int i = 0; i <= x; i++) cin >> p[i]; for (int mask1 = 0; mask1 < (1 << 7); mask1++) for (int mask2 = 0; mask2 < (1 << 7); mask2++) mat.a[mask1][mask2] = p[mask1 ^ mask2]; mat = bpow(mat, n - 1); cout << fixed << setprecision(10) << 1 - mat.a[0][0]; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n, k; cin >> n >> k; string ans = ; for (long long i = 0; i < n; i++) { ans.push_back( a ); } for (long long i = n - 2; i >= 0; i--) { if (k <= n - i - 1) { ans[i] = b ; ans[n - k] = b ; break; } k -= (n - i - 1); } cout << ans << endl; } int main() { int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int t, a, b, c, d, x, y, x1, x2, y1, y2; scanf( %d , &t); while (t--) { scanf( %d%d%d%d , &a, &b, &c, &d); int t1 = a - b; int t2 = c - d; scanf( %d%d%d%d%d%d , &x, &y, &x1, &y1, &x2, &y2); if (x - t1 >= x1 && x - t1 <= x2 && y - t2 >= y1 && y - t2 <= y2) { if ((a > 0 || b > 0) && x1 == x2) printf( NO n ); else if ((c > 0 || d > 0) && y1 == y2) printf( NO n ); else printf( YES n ); } else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin.tie(0), cout.tie(0); ; long long int a, b, t, n, m, k, i, j, l, sum = 0, sum1 = 0, ans = 0; vector<long long int> v; cin >> n; for (i = 0; i < n; i++) { cin >> a; v.push_back(a); if (i & 1) { sum1 += a; } else sum += a; } ans = max(sum1, sum); for (i = 0; i < n; i++) { if (i & 1) { sum1 -= v[i]; sum += v[i]; } else { sum -= v[i]; sum1 += v[i]; } ans = max(ans, max(sum, sum1)); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; cin >> a; b = a - 1; c = a - 2; if (a >= 3) { if (b % 2 != 0) { if (a % 3 == 0) { long long e = a * b * c / 2; long long r = a * b * (c - 1) / 3; long long t = a * b * (c - 2) / 2; long long y = a * b * (c - 3); long long h = (a - 1) * (b - 1) * (c - 1); cout << max(max(max(e, r), max(t, y)), h); } else { c--; cout << a * b * c; } } else { cout << a * b * c; } } else { b = 1; c = 1; cout << a * b * c; } return 0; } |
#include <bits/stdc++.h> using namespace std; int h; int edge[5000]; int extend[5000]; int maximum; int v[5000]; bool flag = 0; void dfs_m(int p, int value) { v[p] = value; if (edge[p * 2] != 0) dfs_m(p * 2 + 0, value + edge[p * 2]); else { if (maximum < value) maximum = value; } if (edge[p * 2 + 1] != 0) dfs_m(p * 2 + 1, value + edge[p * 2 + 1]); else { if (maximum < value) maximum = value; } } void dfs(int p, int value) { if (edge[p * 2] != 0) { dfs(p * 2, value + edge[p * 2] + extend[p * 2]); } else { if (value < maximum) { extend[p] += (maximum - value); } } if (edge[p * 2 + 1] != 0) { dfs(p * 2 + 1, value + edge[p * 2 + 1] + extend[p * 2 + 1]); } else { if (value < maximum) { extend[p] += (maximum - value); } } } int min(int a, int b) { if (a == b) return -1; if (a < b) { return a; } return b; } void merge(int n) { if (extend[n * 2] != 0 && extend[n * 2 + 1] != 0) { int m = min(extend[n * 2 + 1], extend[n * 2]); flag = false; if (m == -1) { extend[n] += extend[n * 2 + 1]; extend[n * 2] = extend[n * 2 + 1] = 0; merge(n / 2); } else { extend[n] += m; extend[n * 2] -= m; extend[n * 2 + 1] -= m; merge(n / 2); } } } int main() { scanf( %d , &h); int e = pow(2, h + 1) - 2; memset(edge, 0, sizeof(edge)); memset(extend, 0, sizeof(extend)); memset(v, 0, sizeof(v)); for (int i = 2; i <= e + 1; i++) { scanf( %d , &edge[i]); } maximum = 0; dfs_m(1, 0); dfs(1, 0); int node = pow(2, h + 1); for (int i = 2; i <= e + 1; i++) { extend[i] /= 2; } while (true) { flag = true; for (int i = 0; i < node; i++) { merge(i); } for (int i = 2; i <= e + 1; i++) { } if (flag) { break; } } int ans = 0; for (int i = 0; i <= e + 1; i++) { ans += extend[i]; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; map<pair<long long int, long long int>, int> m; long long int comb(long long int n, long long int r) { int k1, k2; if (m[make_pair(n, r)] != 0) return m[make_pair(n, r)]; if (r > n) return 0; if (n == r) return 1; if (r == 0) return 1; if (r == 1) return n; k1 = comb(n - 1, r - 1); k2 = comb(n - 1, r); m[make_pair(n - 1, r - 1)] = k1; m[make_pair(n - 1, r)] = k2; return k1 + k2; } int main() { long long int n, m, t, k1 = 0, k2 = 0, k3 = 0, sum = 0, i = 0, x, y; cin >> n >> m >> t; if ((n + m) < t) cout << 0; if (n < 4 || m < 1) cout << 0; for (x = 4; x <= t - 1; x++) { if (m >= (t - x)) sum += (comb(n, x) * comb(m, t - x)); } cout << sum; } |
#include <bits/stdc++.h> using namespace std; int a[123], p[123]; signed main() { int t; scanf( %d , &t); while (t--) { int n, m; scanf( %d %d , &n, &m); memset(p, 0, sizeof(p)); for (int i = 1; i <= n; ++i) scanf( %d , a + i); for (int i = 1, x; i <= m; ++i) scanf( %d , &x), p[x] = 1; bool ok = 1; for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) { if (!ok) break; if (a[i] > a[j]) for (int k = i; k < j; ++k) if (!p[k]) { ok = 0; break; } } ok ? puts( YES ) : puts( NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long fac[3000060]; void pre() { fac[0] = 1; for (int i = 1; i < 3000060; i++) fac[i] = fac[i - 1] * i % 1000000007; } long long powermod(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long nCrmod(long long n, long long r, long long p) { if (r == 0) return 1; return (fac[n] * powermod(fac[r], p - 2, p) % p * powermod(fac[n - r], p - 2, p) % p) % p; } void solve() { long long n; cin >> n; long long use[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> use[i][j]; } } for (int i = 0; i < n; i++) { long long p = (use[i][(i + 1) % n] * use[i][(i + 2) % n]) / use[(i + 1) % n][(i + 2) % n]; p = sqrt(p); cout << p << ; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long inf = 1e18; vector<long long> a; map<long long, bool> p; int binp(long long x) { int l = 0, r = 1e9 + 1; while (r - l > 1) { int m = (l + r) / 2; if (1LL * m * m <= x) l = m; else r = m; } return l; } int main() { a.push_back(0); for (long long i = 2; i <= 1000000; ++i) { long long cur = i * i * i; while (inf / i >= cur) { long long x = binp(cur); if (!p[cur] && x * x != cur) a.push_back(cur); p[cur] = 1; cur *= i; } long long x = binp(cur); if (!p[cur] && x * x != cur) a.push_back(cur); p[cur] = 1; } sort(a.begin(), a.end()); int t; scanf( %d , &t); while (t--) { long long l, r; scanf( %lld %lld , &l, &r); long long ans = upper_bound(a.begin(), a.end(), r) - upper_bound(a.begin(), a.end(), l - 1); ans += binp(r) - binp(l - 1); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) void read(int &a) { a = 0; char c = getchar(); while (c < 0 || c > 9 ) { c = getchar(); } while (c >= 0 && c <= 9 ) { a = (a << 1) + (a << 3) + (c ^ 48); c = getchar(); } } const int Maxn = 50000; const int Inf = 0x3f3f3f3f; int n, q; int a[Maxn + 5]; int fa[Maxn + 5]; int head[Maxn + 5], arrive[Maxn + 5], nxt[Maxn + 5], tot; void add_edge(int from, int to) { arrive[++tot] = to; nxt[tot] = head[from]; head[from] = tot; } int dep[Maxn + 5], dis[Maxn + 5]; int dfn[Maxn + 5], right[Maxn + 5], rnk[Maxn + 5], dfn_tot, sz[Maxn + 5]; int sum[Maxn + 5]; long long f[Maxn + 5]; void init_dfs(int u) { dep[u] = dep[fa[u]] + 1; if (a[u] != 1) { dfn[u] = ++dfn_tot; dis[dfn_tot] = dep[u]; rnk[dfn_tot] = u; sz[u] = 1; sum[u] = 0; } else { dfn[u] = dfn_tot + 1; sz[u] = 0; sum[u] = 1; } for (int i = head[u]; i; i = nxt[i]) { int v = arrive[i]; init_dfs(v); sz[u] += sz[v]; sum[u] += sum[v]; f[u] += f[v]; f[u] += sum[v]; } right[u] = dfn[u] + sz[u] - 1; } int del[Maxn + 5]; int main() { read(n), read(q); for (register int i = 1; i <= n; ++i) { read(a[i]); del[i] = -Inf; } for (register int i = 2; i <= n; ++i) { read(fa[i]); add_edge(fa[i], i); } init_dfs(1); for (register int i = 1; i <= q; ++i) { int u; read(u); long long ans_1 = 0; int ans_2 = 0; for (register int j = dfn[u]; j <= right[u]; ++j) { int tmp = (i >= del[j]); ans_1 += dis[j] * tmp; ans_2 += tmp; del[j] = (tmp ? i + a[rnk[j]] : del[j]); } ans_1 -= 1ll * ans_2 * dep[u]; ans_1 += f[u], ans_2 += sum[u]; printf( %lld %d n , ans_1, ans_2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; long long sum[1505][1505]; long long ans[1505]; long long t[1505]; int main() { int i, j, x; long long val, now, res; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %I64d , &val), sum[i][j] = sum[i][j - 1] + val; for (i = 1; i <= m; i++) ans[i] = sum[1][i]; for (i = 2; i <= n; i++) { if (i % 2 == 0) { now = -(long long)1e15; for (x = m; x > 0; x--) { t[x] = now + sum[i][x]; now = max(now, ans[x]); } } else { now = -(long long)1e15; for (x = 1; x <= m; x++) { t[x] = now + sum[i][x]; now = max(now, ans[x]); } } for (x = 1; x <= m; x++) ans[x] = t[x]; } res = -(long long)1e15; for (x = 1; x <= m; x++) res = max(res, ans[x]); printf( %I64d , res); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, a[105], cnt = 0, i; fill_n(a, 105, 0); for (cin >> m >> n; n; n /= m) a[cnt++] = n % m; if (cnt > 100) { cout << NO ; return 0; } for (i = 0; i < 105; ++i) { if (a[i] <= 1) continue; else if (a[i] < m - 1) { cout << NO ; return 0; } else ++a[i + 1]; } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000 + 10, M = 300 + 10; int a[N], dp[N][M]; vector<int> p[N]; int main() { ios_base::sync_with_stdio(false); int n, m, s, e; cin >> n >> m >> s >> e; for (int i = (0); i <= (n - 1); i++) cin >> a[i]; for (int i = (1); i <= (m); i++) { int x; cin >> x; p[x].emplace_back(i); } int ans = 0; for (int i = (0); i <= (s / e); i++) dp[0][i] = i * (m + 1); for (int i = (1); i <= (n); i++) { for (int j = (1); j <= (s / e); j++) { auto it = upper_bound((p[a[i - 1]]).begin(), (p[a[i - 1]]).end(), (j == 1 ? 0 : dp[i - 1][j - 1])); dp[i][j] = dp[i - 1][j]; if (it != p[a[i - 1]].end()) { dp[i][j] = min(dp[i][j], *it); if (s - e * j >= i + dp[i][j]) ans = max(ans, j); } } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct Node { int val; int op; int cl; Node(int x, int y, int z) { val = x; op = y; cl = z; } Node() { Node(0, 0, 0); }; }; string s; vector<Node> ST; Node temp; int n, t, x, y, t1, t2; void update(int root, int l, int r, int pos) { if (l > pos || r < pos) return; if (l == r) { if (s[pos - 1] == ( ) ST[root].op = 1; if (s[pos - 1] == ) ) ST[root].cl = 1; return; } int mid = (l + r) / 2; update(root * 2, l, mid, pos); update(root * 2 + 1, mid + 1, r, pos); ST[root].val = ST[root * 2].val + ST[root * 2 + 1].val + min(ST[root * 2].op - ST[root * 2].val, ST[root * 2 + 1].cl - ST[root * 2 + 1].val); ST[root].op = ST[root * 2].op + ST[root * 2 + 1].op; ST[root].cl = ST[root * 2].cl + ST[root * 2 + 1].cl; } Node get(int root, int l, int r, int u, int v) { if (u > r || v < l) return Node(0, 0, 0); if (u == l && v == r) return ST[root]; int mid = (l + r) / 2; if (v <= mid) return get(root * 2, l, mid, u, v); else if (u > mid) return get(root * 2 + 1, mid + 1, r, u, v); else { Node n1 = get(root * 2, l, mid, u, mid), n2 = get(root * 2 + 1, mid + 1, r, mid + 1, v); int t1 = n1.val + n2.val + min(n1.op - n1.val, n2.cl - n2.val); return Node(t1, n1.op + n2.op, n1.cl + n2.cl); } } int main() { cin >> s; n = s.size(); for (int i = 0; i < 4 * n; ++i) ST.push_back(Node(0, 0, 0)); for (int i = 1; i <= n; ++i) update(1, 1, n, i); cin >> t; while (t--) { cin >> x >> y; cout << get(1, 1, n, x, y).val * 2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int i, j, t, n, a[150], b[150], sum1 = 0, sum2 = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; } for (i = 1; i <= n; i++) { cin >> b[i]; } for (i = 1; i <= n; i++) { if (a[i] && !b[i]) sum1++; if (!a[i] && b[i]) sum2++; } if (sum1 == 0) { cout << -1 << n ; } else if (sum1 > sum2) { cout << 1 << n ; } else { int k = sum2 / sum1; k++; cout << k << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, pos, l, r, diff, rflag = 1, lflag = 1; cin >> n >> pos >> l >> r; diff = r - l; if (l == 1) lflag = 0; if (r == n) rflag = 0; if (lflag == 0 && rflag == 0) cout << 0; else if (lflag == 0) cout << abs(r - pos) + 1; else if (rflag == 0) cout << abs(pos - l) + 1; else cout << diff + min(abs(r - pos), abs(pos - l)) + 2; } |
#include <bits/stdc++.h> using namespace std; double maxoo(double, double); int main() { int p1, p2, t1, t2; cin >> p1 >> p2 >> t1 >> t2; double p11, p12, p21, p22, misha, vasya; p11 = (3 * p1) / 10; p12 = (p1 - (p1 / 250) * t1); p21 = (3 * p2) / 10; p22 = p2 - (p2 / 250) * t2; misha = maxoo(p11, p12); vasya = maxoo(p21, p22); if (misha > vasya) cout << Misha ; else if (misha == vasya) cout << Tie ; else if (misha < vasya) cout << Vasya ; return 0; } double maxoo(double m, double n) { if (m >= n) return m; else return n; } |
#include <bits/stdc++.h> using namespace std; struct SuffixArray { char* T; int n; vector<int> RA, tempRA; vector<int> SA, tempSA, c; vector<int> phi, pLCP, LCP; SuffixArray(string& t) { n = t.length(); T = new char[n + n]; for (int i = 0; i < n; T[i] = t[i], i++) ; T[n++] = # , T[n] = 0 ; c.resize(max(300, n)); RA.resize(n), tempRA.resize(n); SA.resize(n), tempSA.resize(n); } void countingSort(int k) { fill(c.begin(), c.end(), 0); for (int i = 0; i < n; i++) c[i + k < n ? RA[i + k] : 0]++; for (int i = 0, sum = 0, lim = max(300, n); i < lim; i++) { int t = c[i]; c[i] = sum, sum += t; } for (int i = 0; i < n; i++) tempSA[c[SA[i] + k < n ? RA[SA[i] + k] : 0]++] = SA[i]; for (int i = 0; i < n; i++) SA[i] = tempSA[i]; } void buildSA() { for (int i = 0; i < n; SA[i] = i, i++) ; for (int i = 0; i < n; RA[i] = T[i], i++) ; for (int k = 1, r; k < n; k <<= 1) { countingSort(k); countingSort(0); tempRA[SA[0]] = r = 0; for (int i = 1; i < n; i++) { tempRA[SA[i]] = (RA[SA[i]] == RA[SA[i - 1]] and RA[SA[i] + k] == RA[SA[i - 1] + k] ? r : ++r); } for (int i = 0; i < n; RA[i] = tempRA[i], i++) ; if (RA[SA[n - 1]] == n - 1) break; } } void computeLCP() { phi.resize(n), pLCP.resize(n), LCP.resize(n); phi[SA[0]] = -1; for (int i = 1; i < n; phi[SA[i]] = SA[i - 1], i++) ; for (int i = 0, L = 0; i < n; i++) { if (phi[i] == -1) { pLCP[i] = 0; continue; } for (; T[i + L] == T[phi[i] + L]; L++) ; pLCP[i] = L; L = max(0, L - 1); } for (int i = 0; i < n; LCP[i] = pLCP[SA[i]], i++) ; } void print() { for (int i = 0; i + 1 < n; i++) { printf( %2d t%2d t%s n , SA[i], LCP[i], T + SA[i]); } } }; struct Node { int sum, lft, rgt; Node() : sum(0), lft(0), rgt(0) {} }; struct PersistantSegmentTree { int avail; vector<int> roots; vector<Node> tree; PersistantSegmentTree(int n) { avail = 0; roots.resize(n + 10, 0); tree.resize(n * 30, Node()); } int update(int last, int l, int r, int p) { int cur = ++avail; tree[cur] = tree[last]; if (l == r) { tree[cur].sum++; return cur; } int mid = l + (r - l) / 2; if (p <= mid) tree[cur].lft = update(tree[last].lft, l, mid, p); else tree[cur].rgt = update(tree[last].rgt, mid + 1, r, p); tree[cur].sum = tree[tree[cur].lft].sum + tree[tree[cur].rgt].sum; return cur; } int query(int cur, int l, int r, int L, int R) { if (l > R or r < L or L > R) return 0; if (l >= L and r <= R) return tree[cur].sum; int mid = l + (r - l) / 2; int pp = query(tree[cur].lft, l, mid, L, R); int qq = query(tree[cur].rgt, mid + 1, r, L, R); return pp + qq; } }; int main() { ios_base ::sync_with_stdio(0); cin.tie(0), cout.tie(0); int n; string s; cin >> n >> s; SuffixArray SA(s); SA.buildSA(); SA.computeLCP(); PersistantSegmentTree PSG(SA.n); vector<int> have; for (int i = n - 1; i >= 0; i--) { if (s[i] == ) ) { have.push_back(i); continue; } if (!have.empty()) { PSG.roots[i] = PSG.update(PSG.roots[have.back() + 1], 0, SA.n, have.back()); have.pop_back(); } } long long res = 0; for (int i = 1; i < SA.n; i++) { if (s[SA.SA[i]] == ) ) continue; int L = SA.SA[i]; int R = L + SA.LCP[i] - 1; int add = PSG.query(PSG.roots[L], 0, SA.n, L, SA.n); int bad = PSG.query(PSG.roots[L], 0, SA.n, L, R); res += (0, max(0, add - bad)); } cout << res << n ; } |
#include <bits/stdc++.h> using namespace std; long long sum[500]; int deep[500]; int in1[500]; int out1[500]; int in2[500]; int out2[500]; vector<int> maps1[500]; vector<int> maps2[500]; long long dp[150000]; long long n, m, t; int cnt = 0; void topo2() { queue<int> q; for (int i = 1; i <= n; ++i) if (in2[i] == 0) { q.push(i); deep[i] = 0; } int n1, n2; while (!q.empty()) { n1 = q.front(); q.pop(); cnt++; t -= deep[n1] * sum[n1]; for (int i = 0; i < maps2[n1].size(); ++i) { n2 = maps2[n1][i]; in2[n2]--; deep[n2] = max(deep[n2], deep[n1] + 1); if (in2[n2] == 0) q.push(n2); } } } void topo1() { queue<int> q; int n1, n2; for (int i = 1; i <= n; ++i) if (in1[i] == 0) { q.push(i); } while (!q.empty()) { n1 = q.front(); q.pop(); for (int i = 0; i < maps1[n1].size(); ++i) { n2 = maps1[n1][i]; in1[n2]--; sum[n2] += sum[n1]; if (in1[n2] == 0) { q.push(n2); } } } } int main() { scanf( %lld%lld%lld , &n, &m, &t); for (int i = 1; i <= n; ++i) scanf( %lld , &sum[i]); for (int i = 1; i <= m; ++i) { int x, y; scanf( %d%d , &x, &y); maps1[x].push_back(y); in1[y]++; out1[x]++; maps2[y].push_back(x); in2[x]++; out2[y]++; } topo2(); if (t < 0 || cnt != n) printf( 0 n ); else { topo1(); memset(dp, 0, sizeof(dp)); dp[0] = 1; for (long long i = 1; i <= n; ++i) { for (long long j = sum[i]; j <= t; ++j) { dp[j] += dp[j - sum[i]]; dp[j] %= 1000000007; } } printf( %lld n , dp[t]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int wyn[1024]; int odp[1024]; int n; int pyt; vector<pair<int, int> > v[2]; void pytaj(vector<int>& skad, vector<int>& gdzie) { if (skad.size() == 0) return; printf( %d n , int(skad.size())); for (int i = 0; i < skad.size(); i++) printf( %d , skad[i] + 1); printf( n ); fflush(stdout); for (int i = 0; i < n; i++) scanf( %d , &odp[i]); pyt++; for (int q = 0; q < gdzie.size(); q++) { int i = gdzie[q]; wyn[i] = min(wyn[i], odp[i]); } } int main() { pyt = 0; scanf( %d , &n); for (int i = 0; i < n; i++) wyn[i] = 1000000010; v[0].push_back(make_pair(0, n - 1)); int akt = 0; while (!v[akt].empty()) { v[1 - akt].clear(); vector<int> pyt1, pyt2; for (int k = 0; k < v[akt].size(); k++) { int a = v[akt][k].first; int b = v[akt][k].second; int sr = (a + b) / 2; for (int q = a; q <= sr; q++) pyt1.push_back(q); for (int q = sr + 1; q <= b; q++) pyt2.push_back(q); if (sr > a) v[1 - akt].push_back(make_pair(a, sr)); if (b > sr + 1) v[1 - akt].push_back(make_pair(sr + 1, b)); } pytaj(pyt1, pyt2); pytaj(pyt2, pyt1); akt = 1 - akt; } printf( -1 n ); for (int i = 0; i < n; i++) printf( %d , wyn[i]); printf( n ); fflush(stdout); } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n; cin >> n; if (n == 0) { cout << 1 << endl; return 0; } vector<double> p(n); vector<int> powers(n, 1); vector<double> curval(n); using pdi = pair<double, int>; priority_queue<pdi, vector<pdi>> q; double prob = 1.0; for (int i = 0; i < n; ++i) { cin >> p[i]; p[i] /= 100.0; prob *= p[i]; curval[i] = p[i]; q.push(pdi((1 - pow(1 - p[i], powers[i] + 1)) / curval[i], i)); } double result = n + 1 - prob; for (int i = 0; i < 500000; ++i) { auto c = q.top(); q.pop(); prob /= curval[c.second]; ++powers[c.second]; curval[c.second] = 1 - pow(1 - p[c.second], powers[c.second]); prob *= curval[c.second]; q.push( pdi((1 - pow(1 - p[c.second], powers[c.second] + 1)) / curval[c.second], c.second)); result += 1 - prob; } cout << fixed << setprecision(20) << result << endl; } |
// Problem: A. Robot Program // Contest: Codeforces - Educational Codeforces Round 98 (Rated for Div. 2) // URL: https://codeforces.com/contest/1452/problem/A // Memory Limit: 256 MB // Time Limit: 2000 ms // Powered by CP Editor (https://github.com/cpeditor/cpeditor) #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define int long long #define F(i, n) for (int i = 0; i < n; i++) #define all(x)(x).begin(), (x).end() using ld = long double; using vi = vector <int>; using mi = map <int, int>; using pii = pair <int, int>; const int N = 100005; const int MOD = 1e9 + 7; #define show(arr) { for (auto x: arr) cout << x << ; cout << n ; } #define show_(arr, n) F(i, n) show(arr[i]) void solve() { int n; cin>>n; int a[n],sum=0,mx=0; F(i,n){ cin>>a[i]; sum+=a[i]; mx=max(mx,a[i]); } cout<<max((n-1)*((sum+n-2)/(n-1)),mx*(n-1))-sum<< n ; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int32_t t=1; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; int k; string ad; vector<string> c(string s) { vector<string> ans; int last = 0; for (long long i = 0; i < (s.size()); i++) { if (s[i] == || s[i] == - || i == s.size() - 1) { ans.push_back(s.substr(last, i - last + 1)); last = i + 1; } } return ans; } vector<string> v; bool check(int mid) { int nlen = 0; int cnt = 1; for (long long i = 0; i < (v.size()); i++) { if (v[i].size() > mid) { return false; } if (nlen + v[i].size() <= mid) { nlen += v[i].size(); } else { nlen = v[i].size(); cnt++; } } if (cnt <= k) { return true; } return false; } int main() { cin >> k; cin.ignore(); getline(cin, ad, n ); v = c(ad); int l = 0, r = ad.size(); while (l < r) { int mid = (l + r) >> 1; if (!check(mid)) { l = mid + 1; } else { r = mid; } } cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, r, x; int main() { cin >> a; b = 45 * 17 * 10000000000000000LL; r = 100000000000000000LL - 1; x = b % a; cout << a - x << << a - x + r; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp ) #pragma GCC optimize( -fpeephole2 ) #pragma GCC optimize( -ffast-math ) #pragma GCC optimize( -fsched-spec ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( -falign-jumps ) #pragma GCC optimize( -falign-loops ) #pragma GCC optimize( -falign-labels ) #pragma GCC optimize( -fdevirtualize ) #pragma GCC optimize( -fcaller-saves ) #pragma GCC optimize( -fcrossjumping ) #pragma GCC optimize( -fthread-jumps ) #pragma GCC optimize( -funroll-loops ) #pragma GCC optimize( -fwhole-program ) #pragma GCC optimize( -freorder-blocks ) #pragma GCC optimize( -fschedule-insns ) #pragma GCC optimize( inline-functions ) #pragma GCC optimize( -ftree-tail-merge ) #pragma GCC optimize( -fschedule-insns2 ) #pragma GCC optimize( -fstrict-aliasing ) #pragma GCC optimize( -fstrict-overflow ) #pragma GCC optimize( -falign-functions ) #pragma GCC optimize( -fcse-skip-blocks ) #pragma GCC optimize( -fcse-follow-jumps ) #pragma GCC optimize( -fsched-interblock ) #pragma GCC optimize( -fpartial-inlining ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( -freorder-functions ) #pragma GCC optimize( -findirect-inlining ) #pragma GCC optimize( -frerun-cse-after-loop ) #pragma GCC optimize( inline-small-functions ) #pragma GCC optimize( -finline-small-functions ) #pragma GCC optimize( -ftree-switch-conversion ) #pragma GCC optimize( -foptimize-sibling-calls ) #pragma GCC optimize( -fexpensive-optimizations ) #pragma GCC optimize( -funsafe-loop-optimizations ) #pragma GCC optimize( inline-functions-called-once ) #pragma GCC optimize( -fdelete-null-pointer-checks ) using namespace std; inline long long read() { long long x = 0, y = 0, c = getchar(); while (!isdigit(c)) y = c, c = getchar(); while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 0 ), c = getchar(); return y == - ? -x : x; } inline void print(long long q) { if (q < 0) putchar( - ), q = -q; if (q >= 10) print(q / 10); putchar(q % 10 + 0 ); } int n, m, k; struct edge { int fr, to, val, id; bool fg; } e[1000010]; int f[1000010]; inline int getf(int q) { return f[q] == q ? q : f[q] = getf(f[q]); } inline bool operator<(edge q, edge w) { return q.val == w.val ? q.fg < w.fg : q.val < w.val; } inline bool cmp(edge q, edge w) { return q.val == w.val ? q.fg > w.fg : q.val < w.val; } int as[1000010], ft; bool usd[1000010]; inline int work() { int i, as = 0, as2 = 0; sort(e + 1, e + m + 1); for (i = 1; i <= n; ++i) f[i] = i; for (i = 1; i <= m; ++i) if (getf(e[i].fr) != getf(e[i].to)) { f[f[e[i].fr]] = f[e[i].to]; as += e[i].fg; ++as2; } return as2 != n - 1 ? -1 : as; } int main() { int i, j, l, r, mid, ans; n = read(); m = read(); k = read(); for (i = 1; i <= m; ++i) { e[i].fr = read(); e[i].to = read(); e[i].val = read(); e[i].id = i; e[i].fg = (e[i].fr == 1 || e[i].to == 1); } l = -1e6; r = 1e6; ans = l - 1; while (l <= r) { mid = l + r >> 1; for (i = 1; i <= m; ++i) if (e[i].fg) e[i].val -= mid; int tmp = work(); if (tmp == -1) { puts( -1 ); return 0; } if (tmp <= k) ans = mid, l = mid + 1; else r = mid - 1; for (i = 1; i <= m; ++i) if (e[i].fg) e[i].val += mid; } if (ans == -1e6 - 1) { puts( -1 ); return 0; } int tp = 0; for (i = 1; i <= m; ++i) if (e[i].fg) e[i].val -= ans; sort(e + 1, e + m + 1); for (i = 1; i <= n; ++i) f[i] = i; for (i = 1; i <= m; ++i) if (getf(e[i].fr) != getf(e[i].to)) { f[f[e[i].fr]] = f[e[i].to]; if (e[i].fg) usd[e[i].id] = 1, as[++ft] = e[i].id, ++tp; } if (tp > k) { puts( -1 ); return 0; } for (i = 1; i <= n; ++i) f[i] = i; for (i = 1; i <= m; ++i) if (usd[e[i].id]) f[getf(e[i].fr)] = getf(e[i].to); sort(e + 1, e + m + 1, cmp); for (i = 1; i <= m; ++i) if (!usd[e[i].id] && getf(e[i].fr) != getf(e[i].to)) { if (e[i].fg && tp == k) continue; f[f[e[i].fr]] = f[e[i].to]; as[++ft] = e[i].id; tp += e[i].fg; } if (tp < k) { puts( -1 ); return 0; } print(ft); putchar( n ); for (i = 1; i <= ft; ++i) print(as[i]), putchar( ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void getar(T a, int n, int m) { for (int i = 0; i < n; i++) for (int j = 0; j < m; ++j) { scanf( %d , &a[i][j]); } } inline void getar(int *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , a + ii); } } inline void getar(pair<int, int> *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( d , &a[ii].first, &a[ii].second); } } inline void getar(long long *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64d , a + ii); } } inline void getv(vector<int> &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , &a[ii]); } } inline void getv(vector<long long> &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64d , &a[ii]); } } inline void getv(vector<pair<int, int> > &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , &a[ii].first, &a[ii].second); } } inline void getv(vector<pair<long long, long long> > &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64d , &a[ii].first, &a[ii].second); } } inline void getvv(vector<vector<int> > &a, int n, int m) { for (int i = 0; i < n; i++) for (int j = 0; j < m; ++j) { scanf( %d , &a[i][j]); } } inline void printa(int *a, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %d , a[ii]); } } inline void printa(long long *a, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %I64d , a[ii]); } } inline void printv(vector<int> &a, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %d , a[ii]); } } inline void printv(vector<long long> &a, int n, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %I64d , a[ii]); } } inline long long max(long long a, long long b) { return (a > b) ? a : b; } inline int max(int a, int b) { return (a > b) ? a : b; } inline double max(double a, double b) { return (a > b) ? a : b; } inline long long max(long long a, long long b, long long c) { return max(a, max(b, c)); } inline int max(int a, int b, int c) { return max(a, max(b, c)); } inline double max(double a, double b, double c) { return max(a, max(b, c)); } inline long long min(long long a, long long b) { return (a < b) ? a : b; } inline int min(int a, int b) { return (a < b) ? a : b; } inline double min(double a, double b) { return (a < b) ? a : b; } inline long long min(long long a, long long b, long long c) { return min(a, min(b, c)); } inline int min(int a, int b, int c) { return min(a, min(b, c)); } inline double min(double a, double b, double c) { return min(a, min(b, c)); } inline long long pow(long long x, long long n) { long long res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } inline long long powmod(long long x, long long n, long long _mod) { long long res = 1; while (n) { if (n & 1) res = (res * x) % _mod; x = (x * x) % _mod; n >>= 1; } return res; } inline long long gcd(long long a, long long b) { long long t; while (b) { a = a % b; t = a; a = b; b = t; } return a; } inline int gcd(int a, int b) { int t; while (b) { a = a % b; t = a; a = b; b = t; } return a; } inline long long lcm(int a, int b) { return a / gcd(a, b) * (long long)b; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long gcd(long long a, long long b, long long c) { return gcd(gcd(a, b), c); } inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); } inline long long lcm(long long a, long long b, long long c) { return lcm(lcm(a, b), c); } inline long long lcm(int a, int b, int c) { return lcm(lcm(a, b), (long long)c); } inline int bits_count(int v) { v = v - ((v >> 1) & 0x55555555); v = (v & 0x33333333) + ((v >> 2) & 0x33333333); return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; } inline int bits_count(long long v) { long long t = v >> 32; long long p = (v & ((1LL << 32) - 1)); return bits_count(t) + bits_count(p); } inline bool ispow2(int x) { return (x != 0 && (x & (x - 1)) == 0); } const char nl = n ; void solve() { int n; cin >> n; vector<int> a(n); getv(a, n); int last = -1, cnt = 0; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { if (a[i] != 1 && last < a[i] - 1) last = a[i] - 1, cnt++; else if (last < a[i]) last = a[i], cnt++; else if (last < a[i] + 1) last = a[i] + 1, cnt++; } cout << cnt << nl; } int main() { clock_t clk = clock(); cerr << Hey P.. n ; int t; t = 1; while (t--) solve(); cerr << Look at the sky. n ; cerr << Time (in ms): << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) { fu = -1; } c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); } f *= fu; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x < 10) putchar(x + 48); else print(x / 10), putchar(x % 10 + 48); } template <typename T> void print(T x, char t) { print(x); putchar(t); } const int N = 1e6 + 5; struct ele { int f, g; ele(int a = 0, int b = 0) : f(a), g(b) {} bool operator<(const ele A) const { if (f != A.f) return f < A.f; return g > A.g; } }; ele operator+(const ele a, const ele b) { return ele(a.f + b.f, a.g + b.g); } ele f[N]; char c[N]; int s[N]; int n, k, l; ele dp(int mid) { for (int i = 0; i < l; i++) f[i] = ele(0, 0); for (int i = l; i <= n; i++) f[i] = max(f[i - 1], f[i - l] + ele(s[i] - s[i - l] - mid, 1)); return f[n]; } int solve(int opt) { for (int i = 1; i <= n; i++) s[i] = s[i - 1] + ((c[i] >= a && c[i] <= z ) == opt); int l = 0, r = n - 1, ans = n; while (l <= r) { int mid = (l + r) >> 1; if (dp(mid).g <= k) ans = mid, r = mid - 1; else l = mid + 1; } return s[n] - (dp(ans).f + ans * k); } int main() { read(n); read(k); read(l); scanf( %s , c + 1); if (1ll * k * l > n) { print(0, n ); return 0; } print(min(solve(0), solve(1)), n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; int legs[N]; bool hide[N]; vector<vector<int> > adj; void dfs(int v, int par = 0) { if (adj[v].size() <= 2u) { hide[v] = true; for (int i : adj[v]) { if (i != par) { dfs(i, v); } } } } int main() { int n, a, b; scanf( %d , &n); adj.resize(n + 1); for (int i = 0; i < n - 1; ++i) { scanf( %d%d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); } for (int i = 1; i <= n; ++i) { if (adj[i].size() == 1u) { dfs(i); } } for (int i = 1; i <= n; ++i) { for (int j : adj[i]) { if (hide[j]) { legs[i] = min(2, legs[i] + 1); } } } for (int i = 1; i <= n; ++i) { if (!hide[i]) { int count = 0; for (int j : adj[i]) { if (!hide[j] && (int)adj[j].size() - legs[j] > 1) { ++count; } } if (count > 2) { printf( No n ); return 0; } } } printf( Yes n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int parent[5001][5001]; int dp[5001][5001]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, m, t; cin >> n >> m >> t; vector<int> u(m + 1), v(m + 1), tm(m + 1); for (int i = 1; i <= m; i++) { cin >> u[i] >> v[i] >> tm[i]; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { dp[i][j] = 1e9 + 5; } } dp[1][1] = 0; for (int i = 2; i <= n; i++) { for (int j = 1; j <= m; j++) { int p = u[j]; int cur = v[j]; if (dp[p][i - 1] + tm[j] < dp[cur][i]) { dp[cur][i] = dp[p][i - 1] + tm[j]; parent[cur][i] = p; } } } int res = 0; for (int i = n; i > 0; i--) { if (dp[n][i] <= t) { res = i; break; } } cout << res << endl; int ind = n; int visit = res; vector<int> path; while (ind != 0) { path.push_back(ind); ind = parent[ind][visit--]; } for (int i = path.size() - 1; i >= 0; i--) { cout << path[i] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; pair<long long, long long> dp[1100][20]; int bitcnt[1100]; long long p10[21]; string a; int n, k; pair<long long, long long> dfs(int bi, int pos, int flag, int leading) { if (pos == -1) return make_pair(0, 1); if (dp[bi][pos].second != -1 && !flag && !leading) { return dp[bi][pos]; } long long ans = 0; long long cnt = 0; int upper = (flag ? a[n - pos - 1] - 0 : 9); for (int i = 0; i <= upper; i++) { int nextstate = (bi | (1 << i)); if ((bi & (1 << i)) == 0 && !(leading && i == 0)) { if (bitcnt[nextstate] > k) continue; pair<long long, long long> p = dfs(nextstate, pos - 1, flag && (i == upper), leading && (i == 0)); cnt = (cnt + p.second) % 998244353; ans = (ans + ((((p.second * i) % 998244353) * p10[pos]) % 998244353 + p.first) % 998244353) % 998244353; } else { pair<long long, long long> p = dfs(bi, pos - 1, flag && (i == upper), leading && (i == 0)); cnt = (cnt + p.second) % 998244353; ans = (ans + ((((p.second * i) % 998244353) * p10[pos]) % 998244353 + p.first) % 998244353) % 998244353; } } if (!flag && !leading) { dp[bi][pos] = make_pair(ans % 998244353, cnt % 998244353); } return make_pair(ans % 998244353, cnt % 998244353); } long long solve(long long num) { a = to_string(num); n = (int)a.length(); pair<long long, long long> p = dfs(0, n - 1, 1, 1); return p.first % 998244353; } int main() { long long l, r; int i, j; p10[0] = 1; for (i = 1; i <= 20; i++) { p10[i] = (p10[i - 1] * 10) % 998244353; } for (i = 0; i < 1100; i++) { for (j = 0; j < 20; j++) { dp[i][j] = make_pair(0, -1); } } bitcnt[0] = 0; bitcnt[1] = 1; for (i = 2; i < 1100; i++) bitcnt[i] = bitcnt[i - (i & -i)] + 1; cin >> l >> r >> k; cout << (solve(r) - solve(l - 1) + 998244353) % 998244353 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } string s; int main() { int t, cas = 1; cin >> s; int n = ((int)(s).size()); for (int i = 1; i <= n / 2; i++) { int cnt = 0; for (int j = 0; j < n - i; j++) { if (s[j] == s[j + i]) cnt++; else cnt = 0; if (cnt == i) { s = s.substr(0, j - i + 1) + s.substr(j + 1, n - j - 1); n -= i; i = 0; break; } } } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int b[200005]; vector<int> a; cin >> n; a.push_back(31); a.push_back(28); a.push_back(31); a.push_back(30); a.push_back(31); a.push_back(30); a.push_back(31); a.push_back(31); a.push_back(30); a.push_back(31); a.push_back(30); a.push_back(31); for (int i = 0; i < n; i++) { cin >> b[i]; } for (int i = 0; i < 12; i++) { int count = 0, f = 0; for (int j = 0; j < n; j++) { if ((i + j) % 12 == 1) { if (a[(i + j) % 12] == b[j]) continue; else { if (a[(i + j) % 12] == 28 && b[j] == 29 && count == 0) { count = 1; continue; } } } if (a[(i + j) % 12] != b[j]) { f = 1; break; } } if (f == 0) { cout << YES << endl; return 0; } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC target( sse4,avx ) const double pi = 3.14159265358979323; struct dpoint { double x, y; dpoint() : x(0), y(0) {} dpoint(double x, double y) : x(x), y(y) {} }; void run(std::istream& in, std::ostream& out) { int n; dpoint p; in >> n >> p.x >> p.y; std::vector<dpoint> points(n); for (int i = 0; i < n; i++) { in >> points[i].x >> points[i].y; } double maxR = 0; double minR = 1e10; for (int i = 0; i < n; i++) { double dist1 = hypot(points[i].x - p.x, points[i].y - p.y); maxR = std::max(maxR, dist1); minR = std::min(minR, dist1); dpoint& p1 = points[i]; dpoint& p2 = points[(i + 1) % n]; if ((p2.x - p1.x) * (p.x - p1.x) + (p2.y - p1.y) * (p.y - p1.y) > 0.5 && (p1.x - p2.x) * (p.x - p2.x) + (p1.y - p2.y) * (p.y - p2.y) > 0.5) { double a = p1.y - p2.y; double b = p2.x - p1.x; double dist = a * p.x + b * p.y - a * p1.x - b * p1.y; dist /= hypot(a, b); minR = std::min(minR, std::abs(dist)); } } out.precision(20); out << std::fixed; out << (maxR * maxR - minR * minR) * pi << std::endl; } int main() { std::cin.sync_with_stdio(false); std::cin.tie(nullptr); run(std::cin, std::cout); return 0; } |
#include <bits/stdc++.h> using namespace std; void fastInOut() { ios_base::sync_with_stdio(0); cin.tie(NULL), cout.tie(NULL); } int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, -1, 1}; int main() { double m, n, total = 0.0; cin >> m >> n; for (double i = 1; i <= m; i++) { double temp = pow(i / m, n) - pow((i - 1) / m, n); temp *= i; total += temp; } cout << fixed << setprecision(12) << total; } |
#include <bits/stdc++.h> using namespace std; const int _1e5 = 100000; const int _1e7 = 10000000; const int _1e9 = 1000000000; template <typename A, typename B> ostream& operator<<(ostream& str, const pair<A, B>& p) { return str << ( << p.first << , << p.second << ) ; } template <typename T> ostream& operator<<(ostream& str, const vector<T>& v) { str << [ ; for (const auto& n : v) str << n << , ; str << ] ; return str; } template <typename T> ostream& operator<<(ostream& str, const set<T>& v) { str << { ; for (const auto& n : v) { str << n << , ; } str << } ; return str; } template <typename K, typename V> ostream& operator<<(ostream& str, const unordered_map<K, V>& v) { str << { ; for (const auto& p : v) { str << p.first << => << p.second << , ; } str << } ; return str; } int main() { ios_base::sync_with_stdio(false); cout.setf(std::ios::fixed); cout.precision(12); int n; cin >> n; string a; cin >> a; vector<int> f(10); f[0] = 0; for (int i = 1; i <= 9; ++i) { cin >> f[i]; } int left_start = -1; for (int i = 0; i < a.size(); ++i) { int digit = a[i] - 0 ; if (f[digit] > digit) { left_start = i; break; } } if (left_start == -1) { cout << a << endl; return 0; } while (true) { if (left_start >= a.size()) { break; } int digit = a[left_start] - 0 ; if (f[digit] < digit) { break; } a[left_start++] = 0 + f[digit]; } cout << a << endl; } |
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> PII; long long qpow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % m; a = a * a % m, b >>= 1; } return ans; } long long qpow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a; a = a * a, b >>= 1; } return ans; } long long qmul(long long a, long long b, long long m) { long long res = 0; while (b > 0) { if (b & 1) res = (res + a) % m; a = (a + a) % m; b >>= 1; } return res; } 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 / gcd(a, b) * b; } long long inv(long long t, long long p) { return t == 1 ? 1 : (p - p / t) * inv(p % t, p) % p; } long long exgcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long r = exgcd(b, a % b, y, x); y -= (a / b) * x; return r; } long long inv1(long long a, long long p) { long long d, x, y; d = exgcd(a, p, x, y); return d == 1 ? (x % p + p) % p : -1; } template <typename T, typename B> T Add(T a, B b, long long m) { return a + b >= m ? (a + b) % m : a + b; } template <typename T, typename B> T Sub(T a, B b, long long m) { return a - b < 0 ? (a - b + m) % m : a - b; } template <class T> void _sf(T &x) { cin >> x; } void _sf(int &x) { scanf( %d , &x); } void _sf(long long &x) { scanf( %lld , &x); } void _sf(double &x) { scanf( %lf , &x); } void _sf(char &x) { scanf( %c , &x); } void _sf(char *x) { scanf( %s , x); } void sf() {} template <class T, class... U> void sf(T &head, U &...tail) { _sf(head); sf(tail...); } template <class T> void _pf(const T &x) { cout << x; } void _pf(const int &x) { printf( %d , x); } void _pf(const long long &x) { printf( %lld , x); } void _pf(const double &x) { printf( %.16f , x); } void _pf(const char &x) { putchar(x); } void _pf(const char *x) { printf( %s , x); } template <class T, class U> void _pf(const pair<T, U> &x) { pf(x.first); putchar( ); pf(x.second); } template <class T> void _pf(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _pf(*i++)) if (i != x.cbegin()) putchar( ); } void pf() {} template <class T, class... U> void pf(const T &head, const U &...tail) { _pf(head); putchar(sizeof...(tail) ? : n ); pf(tail...); } template <typename T> inline void read(T &x) { x = 0; static int p; p = 1; static char c; c = getchar(); while (!isdigit(c)) { if (c == - ) p = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c - 48); c = getchar(); } x *= p; } const bool IOS = false; const double PI = acos(-1); const double eps = 1e-8; const long long linf = 0x3f3f3f3f3f3f3f3f; const long long INV2 = 500000004; const long long mod = 1e9 + 7; const int inf = 0x3f3f3f3f; const int maxn = 1e6 + 100; char s1[maxn], s2[maxn]; long long a[maxn], b[maxn]; void init() { a[0] = b[0] = 1; for (int i = 1; i < maxn; ++i) { a[i] = (a[i - 1] * i) % mod; } b[maxn - 1] = qpow(a[maxn - 1], mod - 2, mod); for (int i = maxn - 1; i > 0; i--) b[i - 1] = b[i] * i % mod; } long long C(long long n, long long m) { if (n < m) return 0; return a[n] * b[m] % mod * b[n - m] % mod; } int cnt[256]; long long calc(char s[], int n) { memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; ++i) cnt[s1[i]]++; long long tmp = a[n]; for (int i = a ; i <= z ; ++i) tmp = tmp * b[cnt[i]] % mod; long long ret = 0; for (int i = 1; i <= n; ++i) { tmp = tmp * qpow(n - i + 1, mod - 2, mod) % mod; for (int j = a ; j < s[i]; ++j) if (cnt[j]) ret = (ret + tmp * cnt[j] % mod) % mod; tmp = tmp * cnt[s[i]] % mod; cnt[s[i]]--; if (cnt[s[i]] < 0) return ret; } return ret; } void Main(); int main() { if (IOS) std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); Main(); 0; return 0; } void Main() { init(); scanf( %s%s , s1 + 1, s2 + 1); int len = strlen(s1 + 1); long long res = calc(s2, len) - calc(s1, len); res--; res = (res % mod + mod) % mod; pf(res); } |
#include <bits/stdc++.h> using namespace std; int w[2][2]; int kb[2], kc[2]; int size[10][10]; string s; int main() { ios_base::sync_with_stdio(0); for (int i = 0; i <= (int)(2) - 1; i++) { cin >> s; w[i][0] = s[0] - a ; w[i][1] = s[1] - 1 ; } cin >> s; kb[0] = s[0] - a ; kb[1] = s[1] - 1 ; cin >> s; kc[0] = s[0] - a ; kc[1] = s[1] - 1 ; for (int i = 0; i <= (int)(10) - 1; i++) for (int j = 0; j <= (int)(10) - 1; j++) size[i][j] = 0; int x, y; for (int ii = 0; ii <= (int)(2) - 1; ii++) { for (int i = w[ii][0] + 1; i <= 7; i++) { if (i == kb[0] && w[ii][1] == kb[1]) break; size[i][w[ii][1]] = 1; } for (int i = w[ii][0] - 1; i >= 0; i--) { if (i == kb[0] && w[ii][1] == kb[1]) break; size[i][w[ii][1]] = 1; } for (int j = w[ii][1] + 1; j <= 7; j++) { if (w[ii][0] == kb[0] && j == kb[1]) break; size[w[ii][0]][j] = 1; } for (int j = w[ii][1] - 1; j >= 0; j--) { if (w[ii][0] == kb[0] && j == kb[1]) break; size[w[ii][0]][j] = 1; } } for (int i = -1; i <= 1; i++) for (int j = -1; j <= 1; j++) { int a = i + kb[0], b = j + kb[1]; if (a >= 0 && a < 8 && b >= 0 && b < 8) { size[a][b] = 1; } } for (int i = -1; i <= 1; i++) for (int j = -1; j <= 1; j++) { int a = i + kc[0], b = j + kc[1]; if (a >= 0 && a < 8 && b >= 0 && b < 8) { if (size[a][b]) { } else { cout << OTHER n ; return 0; } } } cout << CHECKMATE n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e5 + 10; int a[MAX_N]; vector<pair<int, int>> scanCuts[2][MAX_N]; pair<int, int> cuts[MAX_N]; int tree[2 * MAX_N], d[2 * MAX_N]; void push(int i) { d[2 * i + 1] += d[i]; d[2 * i + 2] += d[i]; tree[2 * i + 1] += d[i]; tree[2 * i + 2] += d[i]; d[i] = 0; } void pull(int i) { tree[i] = min(tree[2 * i + 1], tree[2 * i + 2]); tree[i] += d[i]; } void build(int i, int l, int r) { if (r - l == 1) { tree[i] = a[l]; return; } int mid = (l + r) / 2; build(2 * i + 1, l, mid); build(2 * i + 2, mid, r); pull(i); } void add(int l, int r, int x, int i, int cl, int cr) { if (r <= cl || cr <= l) return; if (l <= cl && cr <= r) { tree[i] += x; d[i] += x; return; } int mid = (cl + cr) / 2; add(l, r, x, 2 * i + 1, cl, mid); add(l, r, x, 2 * i + 2, mid, cr); pull(i); } int get(int l, int r, int i, int cl, int cr) { if (r <= cl || cr <= l) return +1e9; if (l <= cl && cr <= r) return tree[i]; int mid = (cl + cr) / 2; push(i); return min(get(l, r, 2 * i + 1, cl, mid), get(l, r, 2 * i + 2, mid, cr)); } void print(int i, int cl, int cr) { cout << i << ( << cl << ; << cr << ) -> << tree[i] << << d[i] << n ; if (cr - cl == 1) return; int mid = (cl + cr) / 2; print(2 * i + 1, cl, mid); print(2 * i + 2, mid, cr); } 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]; build(0, 0, n); set<int> bestAns; set<int> currAns; for (int i = 0; i < q; ++i) { cin >> cuts[i].first >> cuts[i].second; --cuts[i].first; currAns.insert(i); add(cuts[i].first, cuts[i].second, -1, 0, 0, n); scanCuts[0][cuts[i].first].push_back({cuts[i].second, i}); scanCuts[1][cuts[i].second].push_back({cuts[i].first, i}); } int ans = 0; for (int i = 0; i < n; ++i) { for (auto u : scanCuts[0][i]) { add(i, u.first, 1, 0, 0, n); currAns.erase(u.second); } for (auto u : scanCuts[1][i]) { add(u.first, i, -1, 0, 0, n); currAns.insert(u.second); } int lans = get(i, i + 1, 0, 0, n) - get(0, n, 0, 0, n); if (lans > ans) { ans = lans; bestAns = currAns; } } cout << ans << n ; cout << bestAns.size() << n ; for (int u : bestAns) cout << u + 1 << ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool isprime(long long n) { if (n == 1) return false; if (n == 2) return true; for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) { return false; } } return true; } long long poww(long long b, long long e) { if (e == 0) return 1; else if (e % 2 == 0) { long long a = pow(b, e / 2); return a * a; } else { long long a = pow(b, e / 2); return b * a * a; } } long long powm(long long x, long long y, long long m = 1000000007) { x = x % m; long long res = 1; while (y) { if (y & 1) res = res * x; res %= m; y = y >> 1; x = x * x; x %= m; } return res; } long long modInverse(long long a, long long m = 1000000007) { return powm(a, m - 2, m); } void print(vector<long long> v) { for (long long i = 0; i < v.size(); i++) { cout << v[i] << ; } } void print(long long arr[]) { long long size = *(&arr + 1) - arr; for (long long i = 0; i < size; i++) { cout << arr[i] << ; } } string to_bin(long long n) { string res = ; long long i = 0; while (n > 0) { if (n % 2 == 1) { res = res + 1 ; } else { res = res + 0 ; } n /= 2; i++; } reverse(res.begin(), res.end()); return res; } long long to_dec(string second) { long long n = second.size(), ans = 0, temp = 1; for (long long i = n - 1; i >= 0; i--) { long long x = second[i] - 0 ; ans += x * temp; temp *= 2; } return ans; } void result(bool first) { if (first) cout << YES << endl; else cout << NO << endl; } void solve() { long long a, b, p; cin >> a >> b >> p; string second; cin >> second; reverse(second.begin(), second.end()); long long n = second.length(); long long ind = 1; long long maxi; for (long long i = 1; i < n; i++) { char ch = second[i]; if (second[i] == B ) { if (p >= b) { p -= b; if (i != n - 1) { while (second[i + 1] == B ) { i++; } } ind = i + 1; } else break; } else if (second[i] == A ) { if (p >= a) { p -= a; if (i != n - 1) { while (second[i + 1] == A ) { i++; } } ind = i + 1; } else break; } } long long ans = n - ind + 1; cout << ans << endl; } int32_t main() { ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); long long tests; cin >> tests; while (tests--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int C = 10005, N = 1005; int n, w, b, x, c[N], cost[N]; long long dp[2][C]; template <class T> void maxz(T &a, T b) { if (a < b) a = b; } int main() { int i, j, k, ub; long long mn; scanf( %d%d%d%d , &n, &w, &b, &x); for (i = 1; i <= n; i++) scanf( %d , c + i); for (i = 1; i <= n; i++) scanf( %d , cost + i); memset(dp[0], -1, sizeof(dp[0])); ub = 1; dp[0][0] = w; for (i = 1; i <= n; i++) { memset(dp[i & 1], -1, sizeof(dp[0])); for (j = 0; j < ub; j++) if (dp[~i & 1][j] >= 0) { mn = min(dp[~i & 1][j] + x, w + (long long)b * j); for (k = 0; k <= c[i] && mn >= 0; k++) { maxz(dp[i & 1][j + k], mn); mn -= cost[i]; } maxz(ub, j + k); } } printf( %d , ub - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int r = 2, g = 5, b = 8, n, k; int h, j, p; int main() { cin >> n >> k; h = r * n; j = g * n; p = b * n; h = (h + k - 1) / k; j = (j + k - 1) / k; p = (p + k - 1) / k; cout << p + j + h; } |
#include <bits/stdc++.h> int sw, sw1, sw2; int main() { char a[1000]; scanf( %s , a); int n; scanf( %d , &n); for (int i = 0; i < n; i++) { char b[10]; scanf( %s , b); if (b[0] == a[0] && b[1] == a[1]) sw = 1; if (b[1] == a[0]) sw1 = 1; if (b[0] == a[1]) sw2 = 1; } if (sw == 1 || sw1 == 1 && sw2 == 1) printf( YES ); else printf( NO ); } |
#include <bits/stdc++.h> using namespace std; vector<vector<long long>> dp(10, vector<long long>(1000005, 0)); long long g(long long n) { if (n < 10) return n; long long ans = 1; while (n) { if (n % 10) ans *= (n % 10); n /= 10; } return g(ans); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); for (long long i = 1; i <= 1000000; i++) dp[g(i)][i]++; for (long long i = 0; i < 10; i++) { for (long long j = 2; j <= 1000000; j++) { dp[i][j] += dp[i][j - 1]; } } long long t; cin >> t; while (t--) { long long l, r, k; cin >> l >> r >> k; cout << dp[k][r] - dp[k][l - 1] << n ; } } |
#include <bits/stdc++.h> const int MOD = 1e9; const int N = 100003; using namespace std; vector<int> ans; int main() { int n; cin >> n; int p, q; p = q = 0; for (int i = 0; i < n; i++) { char c; int x, y; cin >> c; scanf( %d , &x); scanf( %d , &y); if (x > y) swap(x, y); if (c == + ) p = max(p, x), q = max(q, y); else if (p <= x && q <= y) cout << YES ; else cout << NO ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 1e5 + 69; const int inf = 1e9 + 5; const long long mod = 1e9 + 7; const long double eps = 1e-10; vector<int> v[MX]; int par[24][MX]; int depth[MX]; void dfs(int x, int p) { for (auto g : v[x]) { if (g == p) { continue; } depth[g] = depth[x] + 1; dfs(g, x); par[0][g] = x; } } int lca(int x, int y) { if (depth[x] > depth[y]) swap(x, y); int i = 22; while (depth[x] < depth[y]) { if (depth[par[i][y]] >= depth[x]) { y = par[i][y]; } i--; } for (int i = 22; i >= 0; i--) { if (par[i][x] != par[i][y]) { x = par[i][x]; y = par[i][y]; } } if (x != y) { x = par[0][x]; y = par[0][y]; } return x; } int dis(int a, int b) { return (depth[a] + depth[b] - 2 * depth[lca(a, b)]); } int cal(int a, int b, int c) { int ret = 0; int q1 = lca(a, b); int q2 = lca(a, c); int q3 = lca(b, c); if (depth[q1] >= max(depth[q2], depth[q3])) { ret = dis(lca(a, b), c); } else { ret = dis((depth[q2] >= depth[q3] ? q2 : q3), c); } return ret; } int main() { depth[0] = -1; int n, q; cin >> n >> q; for (int i = 2; i <= n; i++) { int b; scanf( %d , &b); v[i].push_back(b); v[b].push_back(i); } dfs(1, -1); for (int i = 1; i < 23; i++) { for (int j = 1; j <= n; j++) { par[i][j] = par[i - 1][par[i - 1][j]]; } } while (q--) { int ans = 0; int a, b, c; scanf( %d%d%d , &a, &b, &c); ans = max(cal(a, b, c), max(cal(a, c, b), cal(b, c, a))); printf( %d n , ans + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<vector<int>> g(n); vector<pair<int, int>> e(n - 1); for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; --u; --v; g[u].push_back(v); g[v].push_back(u); e[i] = make_pair(u, v); } vector<int> col(n); for (int &i : col) { cin >> i; } int diff = 0; for (auto i : e) { if (col[i.first] != col[i.second]) { ++diff; } } for (int i = 0; i < n; ++i) { int ctr = 0; for (int j : g[i]) { if (col[i] != col[j]) { ++ctr; } } if (ctr == diff) { cout << YES n << i + 1; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> int cnt; int n, m, k; char s[1111][1111]; int c[1111][1111], vis[1111][1111]; int b[1111]; int tot; void dfs(int p, int q) { c[p][q] = cnt; vis[p][q] = 1; if (s[p - 1][q] == . && !vis[p - 1][q]) dfs(p - 1, q); if (s[p - 1][q] == * ) tot++; if (s[p + 1][q] == . && !vis[p + 1][q]) dfs(p + 1, q); if (s[p + 1][q] == * ) tot++; if (s[p][q - 1] == . && !vis[p][q - 1]) dfs(p, q - 1); if (s[p][q - 1] == * ) tot++; if (s[p][q + 1] == . && !vis[p][q + 1]) dfs(p, q + 1); if (s[p][q + 1] == * ) tot++; } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); for (int i = 0; i <= m + 1; i++) { s[0][i] = s[n + 1][i] = # ; } for (int i = 1; i <= n; i++) s[i][0] = s[i][m + 1] = # ; cnt = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) vis[i][j] = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (!vis[i][j] && s[i][j] == . ) { tot = 0; cnt++; dfs(i, j); b[cnt] = tot; } for (int i = 1; i <= k; i++) { int x, y; scanf( %d%d , &x, &y); printf( %d n , b[c[x][y]]); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> bool chkmax(T &x, T y) { return x < y ? x = y, true : false; } template <typename T> bool chkmin(T &x, T y) { return x > y ? x = y, true : false; } int readint() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, k; int a[20]; bitset<2001> d[66000]; multiset<pair<int, int> > s; void solve(int now, int cs, int r) { if (!now) return; while (cs <= 2000) { for (int i = 1; i <= n; i++) { if (((now >> (i - 1)) & 1) && cs >= a[i] && d[now ^ (1 << (i - 1))][cs - a[i]]) { s.insert(make_pair(-r, a[i])); solve(now ^ (1 << (i - 1)), cs - a[i], r); return; } } cs = cs * k, r++; } assert(0); } int main() { n = readint(); k = readint(); for (int i = 1; i <= n; i++) a[i] = readint(); d[0][0] = 1; for (int i = 1; i < (1 << n); i++) { for (int j = 1; j <= n; j++) if ((i >> (j - 1)) & 1) d[i] |= d[i ^ (1 << (j - 1))] << a[j]; for (int j = 2000 / k; j >= 1; j--) if (d[i][j * k]) d[i][j] = 1; } if (!d[(1 << n) - 1][1]) return printf( NO n ), 0; printf( YES n ); solve((1 << n) - 1, 1, 0); while (s.size() > 1) { auto it1 = s.begin(), it2 = it1; it2++; assert(it1->first == it2->first); printf( %d %d n , it1->second, it2->second); int tmp = it1->second + it2->second, dep = -it1->first; while (tmp % k == 0) tmp /= k, dep--; s.erase(it1); s.erase(it2); s.insert(make_pair(-dep, tmp)); } return 0; } |
#include <bits/stdc++.h> int main() { long long int a, b; scanf( %lld%lld , &a, &b); if (a > b) { printf( %lld %lld , b, (a - b) / 2); } else { printf( %lld %lld , a, (b - a) / 2); } } |
#include <bits/stdc++.h> int main() { int a, b, c, ab = -1, min; scanf( %d %d %d , &a, &b, &c); min = b; if (a < b) min = a; for (int i = 0; i <= min; i++) { if (b + a - 2 * i == c) { ab = i; break; } } if (ab == -1) printf( Impossible ); else printf( %d %d %d , ab, b - ab, a - ab); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; set<int> fang[400001]; map<int, int> cishu[400001]; int n, m, q, to1[400001], Nxt[400001], first1[400001], dfn[400001], low[400001]; int to[500001], nxt[500001], first[500001], cnt, e1, x2, fa[400001]; int sum, tot = 0, ss[400001], heavy[400001], siz[400001], seg[1000001]; int pos[400001], top[400001], deep[400001], h = 0, Stack[400001 * 10]; char ch; void Build(int x, int y) { to1[cnt] = y; Nxt[cnt] = first1[x]; first1[x] = cnt++; } void insert(int x, int y) { to[e1] = y; nxt[e1] = first[x]; first[x] = e1++; } void tarjan(int x) { dfn[x] = low[x] = ++tot; Stack[++h] = x; for (int i = first1[x]; i != -1; i = Nxt[i]) if (!dfn[to1[i]]) { tarjan(to1[i]); low[x] = min(low[x], low[to1[i]]); if (dfn[x] <= low[to1[i]]) { int z; sum++; do { z = Stack[h--]; insert(sum, z); insert(z, sum); } while (z != to1[i]); insert(sum, x); insert(x, sum); } } else low[x] = min(low[x], dfn[to1[i]]); } void dfs(int o, int p) { siz[o] = 1; deep[o] = deep[p] + 1; fa[o] = p; for (int i = first[o]; i != -1; i = nxt[i]) if (to[i] != p) { dfs(to[i], o); siz[o] += siz[to[i]]; if (siz[to[i]] > siz[heavy[o]]) heavy[o] = to[i]; } } void dfs1(int o, int p) { pos[o] = ++x2; if (heavy[o] > 0) { top[heavy[o]] = top[o]; dfs1(heavy[o], o); for (int i = first[o]; i != -1; i = nxt[i]) if ((to[i] != p) && (to[i] != heavy[o])) { top[to[i]] = to[i]; dfs1(to[i], o); } } } void put(int o, int p, int q, int r, int s) { if ((o == q) && (p == q)) { seg[r] = s; return; } int mid = (o + p) / 2; if (q <= mid) { put(o, mid, q, r * 2, s); seg[r] = min(seg[r * 2 + 1], seg[r * 2]); } else { put(mid + 1, p, q, r * 2 + 1, s); seg[r] = min(seg[r * 2], seg[r * 2 + 1]); } } int get(int o, int p, int q, int r, int s) { if ((o == q) && (p == r)) return seg[s]; int mid = (o + p) / 2; if (r <= mid) return get(o, mid, q, r, s * 2); else if (q > mid) return get(mid + 1, p, q, r, s * 2 + 1); else return min(get(o, mid, q, mid, s * 2), get(mid + 1, p, mid + 1, r, s * 2 + 1)); } int gettree(int o, int p) { int yu = INF; while (top[o] != top[p]) { if (deep[top[o]] < deep[top[p]]) { int t = o; o = p; p = t; } yu = min(yu, get(1, sum, pos[top[o]], pos[o], 1)); o = fa[top[o]]; } if (deep[o] > deep[p]) { int t = o; o = p; p = t; } yu = min(yu, get(1, sum, pos[o], pos[p], 1)); if (o > n) yu = min(yu, ss[fa[o]]); return yu; } int main() { memset(first1, -1, sizeof(first1)); memset(first, -1, sizeof(first)); scanf( %d%d%d , &n, &m, &q); sum = n; for (int i = 1; i <= n; i++) scanf( %d , &ss[i]); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); Build(x, y); Build(y, x); } for (int i = 1; i <= n; i++) if (!dfn[i]) tarjan(i); deep[0] = 0; dfs(1, 0); top[1] = 1; dfs1(1, 0); for (int i = 1; i <= n; i++) if (fa[i] > 0) { fang[fa[i]].insert(ss[i]); if (!cishu[fa[i]].count(ss[i])) cishu[fa[i]][ss[i]] = 0; cishu[fa[i]][ss[i]]++; } for (int i = n + 1; i <= sum; i++) ss[i] = *fang[i].begin(); for (int i = 0; i <= 1000000; i++) seg[i] = INF + 1; for (int i = 1; i <= sum; i++) put(1, sum, pos[i], 1, ss[i]); for (int i = 1; i <= q; i++) { int x, y; getchar(); scanf( %c%d%d , &ch, &x, &y); if (ch == C ) { if (fa[x] > 0) { cishu[fa[x]][ss[x]]--; if (cishu[fa[x]][ss[x]] == 0) fang[fa[x]].erase(ss[x]); if (!cishu[fa[x]].count(y)) cishu[fa[x]][y] = 0; cishu[fa[x]][y]++; fang[fa[x]].insert(y); put(1, sum, pos[fa[x]], 1, (*fang[fa[x]].begin())); } put(1, sum, pos[x], 1, y); ss[x] = y; } else cout << gettree(x, y) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, b, d; cin >> n >> b >> d; int cur = 0, cnt = 0; for (int i = 0; i < n; i++) { int a; cin >> a; if (a > b) continue; cur += a; if (cur > d) { cnt++; cur = 0; } } if (cur > d) cnt++; cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 + 7; const int N = (int)1e5 + 10; struct qq { int l, r, i, w; }; int t[4 * N], ans[2 * N]; pair<int, int> p[2 * N]; vector<qq> qx[N], qy[N]; void upd(int pos, int val, int v = 1, int l = 1, int r = N - 10) { if (l == r) { t[v] = val; return; } int m = (l + r) >> 1; if (pos <= m) { upd(pos, val, v + v, l, m); } else { upd(pos, val, v + v + 1, m + 1, r); } t[v] = min(t[v + v], t[v + v + 1]); } int get(int l, int r, int v = 1, int tl = 1, int tr = N - 10) { if (l > r || tr < l || tl > r) { return inf; } if (l <= tl && tr <= r) { return t[v]; } int tm = (tl + tr) >> 1; return min(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr)); } inline bool cmp(pair<int, int> f, pair<int, int> s) { return f.second < s.second || (f.second == s.second && f.first < s.first); } int main() { int n, m, k, q; scanf( %d %d %d %d , &n, &m, &k, &q); for (int i = 1; i <= k; i++) { int x, y; scanf( %d %d , &x, &y); p[i] = {x, y}; } for (int i = 1; i <= q; i++) { int ax, ay, bx, by; scanf( %d %d %d %d , &ax, &ay, &bx, &by); qx[bx].emplace_back(qq({ay, by, i, ax})); qy[by].emplace_back(qq({ax, bx, i, ay})); } sort(p + 1, p + k + 1); int ptr = 1; for (int i = 1; i < N; i++) { while (ptr <= k && p[ptr].first == i) { upd(p[ptr].second, i); ptr++; } for (auto j : qx[i]) { ans[j.i] |= ((get(j.l, j.r) >= j.w) ? 1 : 0); } } memset(t, 0, sizeof(t)); ptr = 1; sort(p + 1, p + k + 1, cmp); for (int i = 1; i < N; i++) { while (ptr <= k && p[ptr].second == i) { upd(p[ptr].first, i); ptr++; } for (auto j : qy[i]) { ans[j.i] |= ((get(j.l, j.r) >= j.w) ? 1 : 0); } } for (int i = 1; i <= q; i++) { if (ans[i] == 1) puts( YES ); else puts( NO ); } } |
#include <bits/stdc++.h> using namespace std; const long long int N = 3e5 + 10, N2 = 2e5, delta = 10499, mod = 1e9 + 7, oo = 1e18, LOG = 20, SQ = 300; const long double PI = 3.141592653589793; pair<pair<long long int, long long int>, long long int> p[N]; int32_t main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long int t; cin >> t; while (t--) { long long int n; cin >> n; for (long long int i = 0; i < 2 * n - 1; i++) { long long int x, y; cin >> x >> y; p[i] = {{x, y}, i}; } cout << YES n ; sort(p, p + 2 * n - 1); for (long long int i = 0; i < 2 * n - 2; i += 2) { if (p[i].first.second < p[i + 1].first.second) cout << p[i + 1].second + 1 << ; else cout << p[i].second + 1 << ; } cout << p[2 * n - 2].second + 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { fixed(cout); cout << setprecision(10); ; long long int n, h; cin >> n >> h; for (int i = 1; i <= n - 1; i++) { double x = (h * h * i) / double(n); x = sqrt(x); if (i == n) break; cout << x << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int tipo[100000 + 5]; int main() { int n, x, y, z, m; cin >> n >> m; memset(tipo, -1, sizeof(tipo)); for (int i = 0; i < m; ++i) { cin >> x >> y >> z; x--, y--, z--; bool enc = 0; if (tipo[x] != -1) { enc = 1; tipo[y] = (tipo[x] + 1) % 3; tipo[z] = (tipo[x] + 2) % 3; } else if (tipo[y] != -1) { enc = 1; tipo[x] = (tipo[y] + 1) % 3; tipo[z] = (tipo[y] + 2) % 3; } else if (tipo[z] != -1) { enc = 1; tipo[x] = (tipo[z] + 1) % 3; tipo[y] = (tipo[z] + 2) % 3; } if (enc == 0) { tipo[x] = 0, tipo[y] = 1, tipo[z] = 2; } } for (int i = 0; i < n; ++i) { if (i == 0) cout << tipo[i] + 1; else cout << << tipo[i] + 1; } puts( ); } |
#include <bits/stdc++.h> using namespace std; int vis[10] = {0}; int main() { int c = 0, n = 0, i, flag = 0; long long ans = 1; string s; cin >> s; for (i = 0; i < s.size(); i++) { if (s[i] == ? ) { if (i == 0) flag = 1; c++; } if (s[i] >= A && s[i] <= J ) { if (i == 0) flag = 1; vis[s[i] - A ] = 1; } } for (i = 0; i < 10; i++) if (vis[i]) n++; for (i = 0; i < n; i++) ans *= 10 - i; if (flag) { ans *= 9; if (ans % 10 == 0) { ans /= 10; flag = 0; } } cout << ans; for (i = flag; i < c; i++) cout << 0; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void c_p_c() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int32_t main() { c_p_c(); long long t; cin >> t; while (t--) { long long n, r; cin >> n >> r; long long k = r; r = min(n - 1, r); long long ans = r * (r + 1) / 2; if (k > r) ans++; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200000 + 10; const int inf = 0x3f3f3f3f; vector<int> ve[maxn]; int a[maxn], c[maxn]; struct node { int pos, val; } nod[maxn]; bool cmp(node a, node b) { return a.val < b.val; } bool cmp1(int x, int y) { return nod[a[x]].val > nod[a[y]].val; } int main() { int n, q, k, x, y; scanf( %d , &n); for (int i = 0; i <= n; i++) { ve[i].clear(); nod[i].val = 0; nod[i].pos = 0; } for (int i = 0; i < n; i++) { scanf( %d%d , &x, &y); ve[x].push_back(y); nod[x].pos = x; nod[x].val = max(nod[x].val, y); } sort(nod + 1, nod + 1 + n, cmp); for (int i = 1; i <= n; i++) a[nod[i].pos] = i; scanf( %d , &q); int ans, res; while (q--) { int max1 = nod[n].val, pos1 = nod[n].pos; int max2 = nod[n - 1].val, pos2 = nod[n - 1].pos, s, j = n - 2; scanf( %d , &k); for (int i = 0; i < k; i++) scanf( %d , &c[i]); sort(c, c + k, cmp1); for (int i = 0; i < k; i++) { if (c[i] == pos1) { max1 = max2; pos1 = pos2; max2 = nod[j].val; pos2 = nod[j--].pos; } else if (c[i] == pos2) { max2 = nod[j].val; pos2 = nod[j--].pos; } } if (max1 == 0) ans = 0, res = 0; else { int l = 0, r = ve[pos1].size(), mid; while (l < r) { mid = l + (r - l) / 2; if (max2 <= ve[pos1][mid]) r = mid; else l = mid + 1; } ans = pos1; res = ve[pos1][l]; } printf( %d %d n , ans, res); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int mod_expo(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res; } int main() { long long int t; cin >> t; while (t--) { map<long long int, long long int> right; long long int n; cin >> n; long long int ar[2 * n + 4]; long long int dp[2 * n + 3]; for (long long int i = 0; i < 2 * n; i++) { cin >> ar[i]; } long long int count = 0; for (long long int i = 0; i < n; i++) { if (ar[i] == 1) count++; else { count--; } dp[i] = count; } count = 0; for (long long int i = 2 * n - 1; i >= n; i--) { if (ar[i] == 1) count--; else { count++; } dp[i] = count; right[count] = i; } long long int mini = 2 * n; for (long long int i = 0; i < 2 * n; i++) { if (dp[i] == 0) { if (i < n && mini > (2 * n - i - 1)) mini = 2 * n - i - 1; else if (i >= n && mini > (i)) mini = i; } } for (long long int i = n - 1; i >= 0; i--) { long long int p = dp[i]; long long int k = right[p]; if (k > 0 && mini > (k - i - 1)) mini = k - i - 1; } cout << mini << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long A, B; cin >> A >> B; if (A < B) { puts( -1 ); return 0; } if ((A - B) % 2 != 0) { puts( -1 ); return 0; } unsigned long long C = (A - B) / 2; unsigned long long X = 0, Y = 0; for (unsigned long long bit = 1ULL << 63; bit >= 1; bit >>= 1) { bool dif = (B & bit); bool allHas = (C & bit); if (allHas && dif) { puts( -1 ); return 0; } if (allHas) { X |= bit; Y |= bit; } if (dif) { Y |= bit; } } cout << X << << Y << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxN = (int)1e4 + 10; int n, w, b, x; long long dp[1005][maxN]; int c[maxN]; int cost[maxN]; int main() { cin >> n >> w >> b >> x; for (int i = 1; i <= n; i++) cin >> c[i]; for (int i = 1; i <= n; i++) cin >> cost[i]; memset(dp, -1, sizeof dp); dp[0][0] = w; for (int i = 1; i <= n; i++) { for (int j = 0; j < maxN; j++) { long long cur_bal = dp[i - 1][j]; if (cur_bal == -1) continue; for (int k = 0; k <= c[i]; k++) { if (1LL * k * cost[i] > cur_bal) continue; dp[i][j + k] = max(min(cur_bal - (1LL * k * cost[i]) + x, 1LL * w + (1LL * b * (j + k))), dp[i][j + k]); } } } for (int i = maxN - 1; i >= 0; i--) { if (dp[n][i] != -1) { cout << i; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int T, n, b[100010], mp[100010], hah[100010]; struct qwq { int v, id; } a[100010]; bool cmp(qwq x, qwq y) { return x.v < y.v; } int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i].v), mp[a[i].v] = i, b[i] = a[i].v, hah[i] = 0; sort(a + 1, a + n + 1, cmp); bool flag = true; for (int i = 1; i <= n;) { int now = mp[i], js = i; hah[now] = 1; for (int j = now + 1; j <= n; j++) { if (hah[j]) { break; } if (b[j] != b[j - 1] + 1) { flag = false; break; } else { hah[j] = 1; js++; } } if (!flag) { break; } i = js + 1; } if (flag) printf( YES n ); else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T, class U> struct SegmentTree { struct Node { bool hasCarry = 0; int b = 0, e = 0; U carry = U(); T val = T(); Node() {} void join(const Node &l, const Node &r) { val = l.val + r.val; b = l.b; e = r.e; } void update(const U &u) { carry += u; u.update(val, b, e); hasCarry = 1; } void pushDown(Node &l, Node &r) { if (!hasCarry) return; l.update(carry); r.update(carry); carry = U(); hasCarry = 0; } }; vector<Node> V; int N; SegmentTree(int N) : V(4 * N), N(N) {} template <class I> void create(const vector<I> &VEC, int n = 1, int b = 0, int e = -1) { if (e == -1) e = N - 1; if (b == e) { V[n].val = T(VEC[b]), V[n].b = b, V[n].e = e; } else { int m = (b + e) / 2; create(VEC, 2 * n, b, m); create(VEC, 2 * n + 1, m + 1, e); V[n].join(V[2 * n], V[2 * n + 1]); } } T query(int i, int j, int n = 1, int b = 0, int e = -1) { if (e == -1) e = N - 1; if (i <= b && e <= j) return V[n].val; else { V[n].pushDown(V[2 * n], V[2 * n + 1]); int m = (b + e) / 2; if (i > m) return query(i, j, 2 * n + 1, m + 1, e); if (j <= m) return query(i, j, 2 * n, b, m); return query(i, j, 2 * n, b, m) + query(i, j, 2 * n + 1, m + 1, e); } } void update(int i, int j, const U &v, int n = 1, int b = 0, int e = -1) { if (e == -1) e = N - 1; if (i <= b && e <= j) V[n].update(v); else if (i > e || j < b) return; else { V[n].pushDown(V[2 * n], V[2 * n + 1]); int m = (b + e) / 2; update(i, j, v, 2 * n, b, m); update(i, j, v, 2 * n + 1, m + 1, e); V[n].join(V[2 * n], V[2 * n + 1]); } } int findOkPrefix(int i, const function<bool(T)> &isOk) { vector<int> stk; stk.reserve(20); stk.push_back(1); T acum; int sz = 0; while (stk.size()) { int t = stk.back(); stk.pop_back(); Node &n = V[t]; if (n.e < i) continue; T newAcum = sz == 0 ? n.val : (acum + n.val); if (i <= n.b) { if (isOk(newAcum)) { sz += n.e - n.b + 1; acum = newAcum; } else { if (n.b == n.e) return sz; V[t].pushDown(V[t << 1], V[t << 1 | 1]); stk.push_back(2 * t + 1); stk.push_back(2 * t); } } else { V[t].pushDown(V[t << 1], V[t << 1 | 1]); stk.push_back(2 * t + 1); stk.push_back(2 * t); } } } }; struct RRange { int tL, tR, sz; RRange(int v = 0) : tR(v), tL(v), sz(1) {} RRange operator+(const RRange &m) const { RRange r; r.sz = sz + m.sz; r.tL = max(tL, m.tL - sz); r.tR = max(tR - m.sz, m.tR); return r; } friend ostream &operator<<(ostream &os, const RRange &range) { os << ( << range.tL << , << range.tR << ) ; return os; } void normalize(int N) { if (tL + tR + 1 >= N) { tL = 0; tR = N - 1; } sz = 1; } int size() { return tL + tR + 1; } }; struct Void { void update(RRange &m, int b, int e) const {} void operator+=(const Void &s) {} }; int main() { int N; cin >> N; vector<RRange> V(N); for (int i = 0; i < N; ++i) { int n; cin >> n; V[i] = RRange(n); V[i].normalize(N); } vector<vector<RRange>> T(20, vector<RRange>(N)); vector<SegmentTree<RRange, Void>> STS; T[0] = V; auto fn = [](int i, int j, SegmentTree<RRange, Void> &ST, int N) { RRange r = ST.query(max(i, 0), min(j, N - 1)); if (i < 0) r = ST.query(N + i, N - 1) + r; if (j >= N) r = r + ST.query(0, j % N); return r; }; for (int i = 1; i < 20; ++i) { STS.push_back(SegmentTree<RRange, Void>(N)); STS.back().create(T[i - 1]); auto &ST = STS.back(); for (int j = 0; j < N; ++j) { T[i][j] = fn(j - T[i - 1][j].tL, j + T[i - 1][j].tR, ST, N); T[i][j].tL += T[i - 1][j].tL; T[i][j].tR += T[i - 1][j].tR; T[i][j].normalize(N); } } for (int i = 0; i < N; ++i) { RRange mx(0); int ans = 0; for (int j = STS.size() - 1; j >= 0; --j) { RRange t = fn(i - mx.tL, i + mx.tR, STS[j], N); t.tL += mx.tL; t.tR += mx.tR; t.normalize(N); if (t.size() < N) { mx = t; ans |= 1 << j; } } if (mx.size() < N) ans++; cout << ans << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int p = 1000003; const int n = 10; int inv[1000005], a[15][15], ans[15]; int read() { char c = getchar(); int x = 0, f = 1; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x * f; } int calc(int x) { int res = 0; for (int i = n; i >= 0; i--) res = (1LL * res * x + ans[i]) % p; return res; } int main() { inv[1] = 1; for (int i = 2; i < p; i++) inv[i] = 1LL * (p - p / i) * inv[p % i] % p; printf( ? 0 n ); fflush(stdout); ans[0] = read(); for (int i = 1; i <= n; i++) { printf( ? %d n , i); fflush(stdout); a[i][0] = 1; for (int j = 1; j <= n; j++) a[i][j] = a[i][j - 1] * i % p; a[i][n + 1] = (read() + p - ans[0]) % p; } for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int t = 1LL * a[j][i] * inv[a[i][i]] % p; for (int k = i + 1; k <= n + 1; k++) a[j][k] = (a[j][k] + p - 1LL * a[i][k] * t % p) % p; a[j][i] = 0; } } for (int i = n; i >= 1; i--) { int res = a[i][n + 1]; for (int j = i + 1; j <= n; j++) res = (res + p - 1LL * a[i][j] * ans[j] % p) % p; ans[i] = 1LL * res * inv[a[i][i]] % p; } for (int i = 0; i < p; i++) { if (calc(i) == 0) { printf( ! %d n , i); fflush(stdout); exit(0); } } printf( ! -1 n ); fflush(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 + 10; int n, d[MAXN], id[MAXN]; bool b[MAXN][MAXN]; bool cmp(int a, int b) { if (d[a] > d[b]) return true; if (d[a] < d[b]) return false; return a < b; } int main() { scanf( %d , &n); if (n == 4) puts( -1 ), exit(0); b[3][1] = b[1][2] = b[2][3] = 1; d[1] = d[2] = d[3] = 1; for (int i = 4; i <= n; ++i) { for (int j = 1; j < i; ++j) id[j] = j; sort(id + 1, id + i, cmp); for (int j = 1; j <= i / 2; ++j) b[id[j]][i] = 1, ++d[i]; for (int j = i / 2 + 1; j < i; ++j) b[i][id[j]] = 1, ++d[id[j]]; } for (int i = 1; i <= n; ++i, puts( )) for (int j = 1; j <= n; ++j) printf( %d , b[i][j]); fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; inline int read() { int f = 1, x = 0; char ch; do { ch = getchar(); if (ch == - ) f = -1LL; } while (ch < 0 || ch > 9 ); do { x = x * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return f * x; } template <class T> inline void chmax(T &a, T b) { if (a < b) a = b; } template <class T> inline void chmin(T &a, T b) { if (a > b) a = b; } inline void swap(int &a, int &b) { int c = a; a = b; b = c; } using namespace std; const int N = 4e5 + 10; set<int> seg[N << 2]; int mx[N << 2], mn[N << 2]; struct node { int x1, y1, x2, y2; } a[N]; inline void show(node a) { printf( %d %d %d %d n , a.x1, a.y1, a.x2, a.y2); } vector<int> ins[N], era[N]; int n, px[N << 1], py[N << 1], totx, toty, lenx, leny, ok[N]; inline void upd(int cur) { int mxp; if (seg[cur].size()) { mxp = *(--seg[cur].end()); } else { mxp = -1; } int mxt = max(mx[cur << 1], mx[cur << 1 | 1]); int mnt = min(mn[cur << 1], mn[cur << 1 | 1]); if (mxp > mxt) { if (ok[mxp] || mxp < mnt) { mx[cur] = -1; } else { mx[cur] = mxp; } } else { mx[cur] = mxt; } mn[cur] = max(mxp, mnt); } inline void cover(int cur, int L, int R, int l, int r, int id, int fl) { if (l > r) return; if (l <= L && r >= R) { if (fl == 1) { seg[cur].insert(id); } else if (fl == -1) { seg[cur].erase(id); } upd(cur); return; } int mid = (L + R) >> 1; if (l <= mid) cover(cur << 1, L, mid, l, r, id, fl); if (r > mid) cover(cur << 1 | 1, mid + 1, R, l, r, id, fl); upd(cur); } inline void norx(int &x) { x = (int)(lower_bound(px + 1, px + lenx + 1, x) - px); } inline void nory(int &x) { x = (int)(lower_bound(py + 1, py + leny + 1, x) - py); } int main() { memset(mx, -1, sizeof(mx)); n = read(); for (int i = (1); i <= (n); ++i) a[i].x1 = read(), a[i].y1 = read(), a[i].x2 = read(), a[i].y2 = read(); for (int i = (1); i <= (n); ++i) { px[++totx] = a[i].x1; px[++totx] = a[i].x2; py[++toty] = a[i].y1; py[++toty] = a[i].y2; } sort(px + 1, px + totx + 1); sort(py + 1, py + toty + 1); lenx = (int)(unique(px + 1, px + totx + 1) - px - 1); leny = (int)(unique(py + 1, py + toty + 1) - py - 1); for (int i = (1); i <= (n); ++i) { norx(a[i].x1); norx(a[i].x2); nory(a[i].y1); nory(a[i].y2); } for (int i = (1); i <= (n); ++i) { ins[a[i].x1].push_back(i); era[a[i].x2].push_back(i); } for (int t = (1); t <= (lenx); ++t) { for (auto cur : ins[t]) { cover(1, 1, leny, a[cur].y1, a[cur].y2 - 1, cur, 1); } for (auto cur : era[t]) { cover(1, 1, leny, a[cur].y1, a[cur].y2 - 1, cur, -1); } while (~mx[1]) { ok[mx[1]] = 1; cover(1, 1, leny, a[mx[1]].y1, a[mx[1]].y2 - 1, mx[1], 0); } } int ans = 1; for (int i = (1); i <= (n); ++i) if (ok[i]) ++ans; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> int q, t, l, r, x, last; std::map<int, int> dsu, val; int root(int x) { int cur = dsu[x]; if (cur < 0) return x; else { dsu[x] = root(dsu[x]); val[x] ^= val[cur]; return dsu[x]; } } void connect(int x, int y, int v) { int a = root(x), b = root(y); if (a != b) { if (dsu[a] > dsu[b]) std::swap(a, b); dsu[a] += dsu[b]; dsu[b] = a; val[b] = v ^ val[x] ^ val[y]; } } int main() { std::cin >> q; while (q--) { std::cin >> t >> l >> r; if ((l ^= last) > (r ^= last)) std::swap(l, r); if (!dsu.count(l)) dsu[l] = -1; if (!dsu.count(++r)) dsu[r] = -1; if (t == 1) { std::cin >> x; connect(l, r, x ^= last); } else if (root(l) == root(r)) std::cout << (last = val[l] ^ val[r]) << n ; else std::cout << -(last = 1) << n ; } } |
#include <bits/stdc++.h> using namespace std; long long pl, pr, vl, vr; int k; long long Inter(long long x1, long long x2, long long y1, long long y2) { long long a = max(x1, y1); long long b = min(x2, y2); if (a > b) return 0.0; else return b - a + 1; } long long GetProb(long long x1, long long x2, long long y1, long long y2) { return Inter(x1, x2, pl, pr) * Inter(y1, y2, vl, vr) + Inter(x1, x2, vl, vr) * Inter(y1, y2, pl, pr); } int main() { cin >> pl >> pr >> vl >> vr >> k; vector<long long> numbers; numbers.push_back(0); int a = 0; for (int i = 0; i < 9; i++) { int b = numbers.size(); for (int j = a; j < b; j++) { numbers.push_back(numbers[j] * 10 + 4); numbers.push_back(numbers[j] * 10 + 7); } a = b; } numbers.push_back(1000000000); long long P = (pr - pl + 1) * (vr - vl + 1); long long gP = 0; int l = 1; int r = k; while (1) { gP += GetProb(numbers[l - 1] + 1, numbers[l], numbers[r], numbers[r + 1] - 1); l++; r++; if (r + 1 >= numbers.size()) break; } l = 1; r = k + 1; while (1) { l++; r++; if (r + 1 >= numbers.size()) break; } l = 1; if (k == 1) while (1) { gP -= GetProb(numbers[l], numbers[l], numbers[l], numbers[l]) / 2; l++; if (l + 1 >= numbers.size()) break; } printf( %.15f , (long double)gP / P); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 205; int a[maxn]; int main() { ios::sync_with_stdio(false); int n, k; scanf( %d %d , &n, &k); int m = n + n + 1; for (int i = 0; i < m; ++i) scanf( %d , &a[i]); for (int i = 1; k && i < m; i += 2) { if (a[i] > max(a[i - 1], a[i + 1]) + 1) { --a[i]; --k; } } for (int i = 0; i < m; ++i) printf( %d , a[i]); putchar( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[10][300]; int s[10][10]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < int(n); ++i) for (int j = 0; j < int(m); ++j) cin >> s[i][j]; int *cur = dp[0], *next = dp[1]; for (int i = n - 1; i >= 0; --i) { for (int j = m - 1; j >= 0; --j) { for (int used = 0; used < int(1 << m); ++used) { if (used & (1 << j)) { next[used] = cur[used & ~(1 << j)]; } else { int best = 0; if (j + 1 < m && !(used & (1 << (j + 1)))) best = max(best, cur[used | (1 << (j + 1))] + (s[i][j] == s[i][j + 1])); if (i + 1 < n) best = max(best, cur[used | (1 << j)] + (s[i][j] == s[i + 1][j])); next[used] = best; } } swap(cur, next); } } cout << n * m / 2 - cur[0] << endl; } |
#include <bits/stdc++.h> int main() { int ele, n, x[110], y[110], p, q, e = 0, f = 0, i, e1 = 0, e2 = 0, o1 = 0, o2 = 0; char s1[300], s2[300]; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d%d , &x[i], &y[i]); for (i = 1; i <= n; i++) { if (x[i] % 2 == 0) e1++; if (x[i] % 2 != 0) { o1++; p = i; s2[f++] = (char)(i + 0); } if (y[i] % 2 == 0) e2++; if (y[i] % 2 != 0) { o2++; q = i; s1[e++] = (char)(i + 0); } } s2[f] = 0 ; s1[e] = 0 ; ele = strcmp(s1, s2); if (o1 % 2 == 0 && o2 % 2 == 0) { printf( 0 ); goto label; } if (o1 % 2 != 0 && o2 % 2 == 0) { printf( -1 ); goto label; } if (o1 % 2 == 0 && o2 % 2 != 0) { printf( -1 ); goto label; } if (o1 % 2 != 0 && o2 % 2 != 0) { if (o1 > 1 || o2 > 1) { if (ele == 0) printf( -1 ); else printf( 1 ); } else if (p == q) printf( -1 ); else printf( 1 ); } else printf( 0 ); label: return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100001], flag[100001]; vector<pair<long long, long long> > ans; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, sum = 0; cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sum /= n / 2; for (long long i = 0; i < n; i++) { if (flag[i] == 0) for (long long j = i + 1; j < n; j++) { if (flag[j] == 0 && ((a[i] + a[j]) == sum)) { flag[j] = 1; flag[i] = 1; ans.push_back(make_pair(i + 1, j + 1)); break; } } } for (auto i : ans) { cout << i.first << << i.second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; long long f(const string& s) { long long res = 0; for (int i = 0; i + 1 < s.size(); ++i) { if (s[i] != s[i + 1]) { res += (m - 1) * (n - i - 1); } } return res; } long long g(const string& s) { long long res = 0; for (int i = 0; i + 1 < s.size(); ++i) if (s[i] != s[i + 1]) { int j = i + 1; while (j + 1 < s.size() && s[j + 1] == s[j - 1]) ++j; long long l = j - i + 1; res += l * (l - 1) / 2; i = j - 1; } return res; } int main() { string s; cin >> n >> m >> s; long long res = n * (m - 1) + f(s); reverse(s.begin(), s.end()); res += f(s) - g(s); cout << res << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.