func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; char s[100100], sir[100100]; int viz[100100], mi, ma, t, n, freq[100100], fre[100100]; int prim(int x) { for (int i = 2; i <= x; ++i) { if (i * i > x) return 1; if (x % i == 0) return 0; } return 1; } int main() { cin >> (s + 1); n = strlen(s + 1); for (int i = 2; i <= n; ++i) { if (prim(i)) { mi = ++t; for (int j = 1; j <= n; ++j) { if (i * j > n) break; if (viz[i * j]) mi = min(mi, viz[i * j]); } if (mi != t) --t; for (int j = 1; j <= n; ++j) { if (i * j > n) break; viz[i * j] = mi; } } } for (int i = 1; i <= n; ++i) freq[viz[i]]++; for (int i = 1; i <= n; ++i) fre[s[i]]++; for (int i = 1; i <= t; ++i) { ma = 0; for (int j = a ; j <= z ; ++j) if (fre[j] > fre[ma]) { ma = j; } if (fre[ma] >= freq[i]) { fre[ma] -= freq[i]; for (int j = 1; j <= n; ++j) if (viz[j] == i) s[j] = ma; } else { cout << NO ; return 0; } } t = 0; for (int j = a ; j <= z ; ++j) while (fre[j]) { --fre[j]; sir[++t] = j; } for (int i = 1; i <= n; ++i) if (!viz[i]) { s[i] = sir[t--]; } cout << YES n ; cout << (s + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n; cin >> n; long long int a[n]; long long int q = 0, p = 0, z = 0; for (int i = 0; i < n; ++i) { cin >> a[i]; if (a[i] < 0) q++; else if (a[i] > 0) p++; else z++; } long long int m1, m2, m3, m4, m5; sort(a, a + n); m1 = a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4] * a[n - 5]; m2 = a[n - 1] * a[n - 2] * a[n - 3] * a[0] * a[1]; m3 = a[n - 1] * a[0] * a[1] * a[2] * a[3]; long long int ans = max(m1, max(m2, m3)); cout << ans << n ; } int main() { ; ios_base::sync_with_stdio(false); cin.tie(NULL); ; int t; cin >> t; for (int i = 1; i <= t; ++i) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10, inf = 1e9; int r[N], c[N], dist[N]; bool seen[N] = {0}; int main() { int row, col, k; cin >> row >> col >> k; for (int i = 1; i <= k; i++) { cin >> r[i] >> c[i]; dist[i] = inf; if (r[i] == 1 and c[i] == 1) dist[i] = 0; } dist[0] = inf; while (1) { int cur = 0; for (int i = 1; i <= k; i++) { if (!seen[i] and dist[cur] > dist[i]) { cur = i; } } if (!cur) break; seen[cur] = 1; for (int i = 1; i <= k; i++) { if (seen[i]) continue; if (abs(r[i] - r[cur]) > 2 and abs(c[i] - c[cur]) > 2) continue; int temp = 1; if ((abs(r[i] - r[cur]) + abs(c[i] - c[cur])) == 1) temp = 0; if (dist[cur] + temp < dist[i]) dist[i] = temp + dist[cur]; } } int ans = inf; for (int i = 1; i <= k; i++) { if (r[i] == row and c[i] == col) ans = min(ans, dist[i]); else if (r[i] >= row - 1 or c[i] >= col - 1) ans = min(ans, dist[i] + 1); } if (ans == inf) cout << -1; else cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long int _sieve_size; bitset<10000010> bs; vector<int> primes; void sieve(long long int upperbound) { _sieve_size = upperbound + 1; bs.set(); bs[0] = bs[1] = 0; for (long long int i = 2; i <= _sieve_size; i++) if (bs[i]) { for (long long int j = i * i; j <= _sieve_size; j += i) bs[j] = 0; primes.push_back((int)i); } } bool isPrime(long long int N) { if (N <= _sieve_size) return bs[N]; for (int i = 0; i < (int)primes.size(); i++) if (N % primes[i] == 0) return false; return true; } int main() { int h1, m1, h2, m2, oh, om; char tmp; cin >> h1 >> tmp >> m1; cin >> h2 >> tmp >> m2; om = m1 - m2; if (om < 0) { om += 60; h1 -= 1; } oh = h1 - h2; if (oh < 0) { oh += 24; } if (oh < 10) { cout << 0 << oh; } else cout << oh; cout << tmp; if (om < 10) { cout << 0 << om; } else cout << om; return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4786) #pragma comment(linker, /STACK:16777216 ) using namespace std; char str[1000005]; int Z[1000005], n; void Zfunction() { int L, R, r, i, j, k; L = 0; R = 0; Z[0] = 0; for (i = 1; i < n; i++) { if (i > R) { L = i; R = i; while (R < n && str[R - L] == str[R]) R++; Z[i] = R - L; R--; } else { r = i - L; if (Z[r] < R - i + 1) Z[i] = Z[r]; else { L = i; while (R < n && str[R - L] == str[R]) R++; Z[i] = R - L; R--; } } } } int max(int a, int b) { if (a > b) return a; return b; } int main() { int i, j, k, maxr, res; while (scanf( %s , str) != EOF) { n = strlen(str); maxr = 0; res = 0; Zfunction(); for (i = 0; i < n; i++) { if (Z[i] == n - i) { if (maxr >= n - i) { res = n - i; break; } } maxr = max(maxr, Z[i]); } if (res == 0 || n <= 2) printf( Just a legend n ); else { for (i = 0; i < res; i++) printf( %c , str[i]); printf( n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 1, M = 100; int n, q; bitset<N> sq[M]; vector<int> on[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; for (int x = 0, qwerty = M; x < qwerty; x++) sq[x][0] = 1; for (int x = 0, qwerty = q; x < qwerty; x++) { int l, r, v; cin >> l >> r >> v; l--; r--; if (l / M == r / M) { for (int i = l; i <= r; i++) on[i].push_back(v); continue; } for (int i = (l / M) + 1; i < r / M; i++) { sq[i] |= (sq[i] << v); } for (int i = l; i < M * ((l / M) + 1); i++) on[i].push_back(v); for (int i = M * (r / M); i <= r; i++) on[i].push_back(v); } bitset<N> ans; for (int x = 0, qwerty = n; x < qwerty; x++) { int pos = x / M; bitset<N> tmp = sq[pos]; for (int v : on[x]) tmp |= tmp << v; ans |= tmp; } vector<int> aa; for (int x = 1, qwerty = n + 1; x < qwerty; x++) if (ans[x]) aa.push_back(x); cout << ((int)(aa).size()) << n ; for (int x = 0, qwerty = ((int)(aa).size()); x < qwerty; x++) cout << aa[x] << n [x + 1 == ((int)(aa).size())]; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<string> v; string a; while (n--) { cin >> a; v.push_back(a); } int cot = 0; bool p = 1; int ans = 1000000; string c; for (int j = 0; j < v.size(); j++) { c = v[j]; cot = 0; for (int i = 0; i < v.size(); i++) { if (c == v[i] || i == j) continue; else { int ncot = 0; string b = v[i]; while (c != b) { ncot++; char d = b[0]; b.erase(b.begin()); b.push_back(d); if (ncot > b.length()) { p = 0; break; } } if (p == 0) break; else cot += ncot; } } if (p == 0) break; if (cot < ans) { ans = cot; } } if (p) cout << ans << endl; else cout << -1 << endl; } |
#include <bits/stdc++.h> using namespace std; inline bool equal(double _x, double _y) { return _x > _y - 1e-9 && _x < _y + 1e-9; } char s[300]; int mx, cnt, sum, ans; bool OK(char c) { if (c >= a && c <= z || c >= A && c <= Z ) return 1; return 0; } int main() { int n; scanf( %d , &n); scanf( %s , s); for (int l = 0, r = 0; l < n; l = r) { if (s[l] == ( ) { while (s[r] != ) ) r++; for (int i = l + 1; i < r; i++) { if (OK(s[i]) && !OK(s[i - 1])) { cnt++; } } for (int i = l + 1; i < r; i++) s[i] = _ ; } r++; } for (int i = 0; i < n; i++) { if (OK(s[i])) sum++; else sum = 0; ans = max(ans, sum); } printf( %d %d n , ans, cnt); } |
#include <bits/stdc++.h> int ss[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; int n, a[200], f[120][(1 << 16) + 10], b[100], g[120][(1 << 16) + 10]; void outit(int x, int y) { if (y == 0) return; outit(x & ~b[g[y][x]], y - 1); printf( %d , g[y][x]); if (y == n) printf( n ); else printf( ); } int main() { int x, i, j, k, ans; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); memset(b, 0, sizeof(b)); for (i = 1; i <= 58; i++) for (j = 0; j < 16; j++) if (i % ss[j] == 0) b[i] |= 1 << j; for (i = 1; i <= n; i++) for (j = 0; j < 1 << 16; j++) f[i][j] = 1000000000; for (i = 1; i <= n; i++) { for (j = 0; j < 1 << 16; j++) { for (k = 1; k <= 58; k++) if ((j & b[k]) == 0) if (f[i][j | b[k]] > f[i - 1][j] + fabs(a[i] - k)) { f[i][j | b[k]] = f[i - 1][j] + fabs(a[i] - k); g[i][j | b[k]] = k; } } } ans = 1000000000; for (i = 0; i < 1 << 16; i++) if (f[n][i] < ans) { ans = f[n][i]; x = i; } outit(x, n); printf( n ); } |
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { if (b == 0) return 1; if (b % 2 == 0) return power(a * a % 1000000007, b / 2); return a * power(a, b - 1) % 1000000007; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long a[100000]; int main() { long long n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long ans = 0; for (int i = 0; i < n / 2; i++) { ans += a[i] * a[n - i - 1] * 2; ans %= 10007; } if (n % 2) ans += a[n / 2] * a[n / 2]; ans %= 10007; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 101; short dp[N][N][N * N], a[N], ans; int n; short calc(int u, int k, int sum) { if (u == N) return !sum && !k; short &ref = dp[u][k][sum]; if (ref != -1) return ref; ref = 0; for (short i = 0; i <= a[u] && sum - u * i >= 0 && i <= k; i++) ref += calc(u + 1, k - i, sum - u * i); return ref = min(ref, (short)2); } int main() { scanf( %d , &n); memset(dp, -1, sizeof dp); int freq = 0; for (int i = 0, a; i < n; i++) { scanf( %d , &a); if (!::a[a]) freq++; ::a[a]++; } for (short i = 1; i < N; i++) for (short j = 1; j <= a[i]; j++) if (calc(1, j, i * j) == 1) { ans = max(ans, j); if (j == a[i] && freq == 2) ans = n; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 300 * 1000 + 5, SQ = 373; int a[N]; long long dp[2 * N]; pair<pair<int, int>, int> t[N]; long long finans[N]; int main() { ios ::sync_with_stdio(false); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } int q; cin >> q; for (int i = 1; i <= q; i++) { cin >> t[i].first.second >> t[i].first.first; t[i].second = i; } sort(t + 1, t + q + 1); for (int i = 1; i <= q; i++) { int x = t[i].first.first, y = t[i].first.second; if (x < SQ) { if (x != t[i - 1].first.first) { for (int j = n; j > 0; j--) { dp[j] = dp[j + x] + a[j]; } } finans[t[i].second] = dp[y]; } else { long long ans = 0; for (int j = y; j <= n; j += x) { ans += a[j]; } finans[t[i].second] = ans; } } for (int i = 1; i <= q; i++) { cout << finans[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; inline int add(int a, int b) { if ((a += b) >= mod) a -= mod; return a; } inline int dec(int a, int b) { if ((a -= b) < 0) a += mod; return a; } inline void _add(int& a, int b) { if ((a += b) >= mod) a -= mod; } inline void _dec(int& a, int b) { if ((a -= b) < 0) a += mod; } inline int mult(int a, int b) { long long t = 1ll * a * b; if (t >= mod) t %= mod; return t; } const int L = 16; char s[510]; int n, nodecnt = 0, f[170][65536], f2[170][65536]; void fwt_or(int* A, int flag) { if (flag == 1) for (int i = 1; i < 65536; i <<= 1) for (int j = 0; j < 65536; j += (i << 1)) for (int k = 0; k < i; k++) _add(A[i + j + k], A[j + k]); else for (int i = 1; i < 65536; i <<= 1) for (int j = 0; j < 65536; j += (i << 1)) for (int k = 0; k < i; k++) _dec(A[i + j + k], A[j + k]); } void fwt_and(int* A, int flag) { if (flag == 1) for (int i = 1; i < 65536; i <<= 1) for (int j = 0; j < 65536; j += (i << 1)) for (int k = 0; k < i; k++) _add(A[j + k], A[i + j + k]); else for (int i = 1; i < 65536; i <<= 1) for (int j = 0; j < 65536; j += (i << 1)) for (int k = 0; k < i; k++) _dec(A[j + k], A[i + j + k]); } int dfs(int l, int r) { int p = ++nodecnt; if (l == r) { if (s[l] == ? ) { for (int t = 0; t < 4; t++) { int S = 0; for (int i = 0; i < 16; i++) if ((i >> t) & 1) S |= (1 << i); f[p][S]++; f[p][65535 ^ S]++; } } else { if (s[l] >= A && s[l] <= D ) { int t = s[l] - A , S = 0; for (int i = 0; i < 16; i++) if ((i >> t) & 1) S |= (1 << i); f[p][S] = 1; } else { int t = s[l] - a , S = 0; for (int i = 0; i < 16; i++) if ((i >> t) & 1) S |= (1 << i); f[p][65535 ^ S] = 1; } } memcpy(f2[p], f[p], sizeof(f[p])); return p; } int cnt = 0, pos = 0; for (int i = l; i <= r; i++) { if (s[i] == ( ) cnt++; else if (s[i] == ) ) cnt--; if (!cnt) { pos = i + 1; break; } } int lc = dfs(l + 1, pos - 2), rc = dfs(pos + 2, r - 1); if (s[pos] != | ) { fwt_and(f[lc], 1); fwt_and(f[rc], 1); for (int i = 0; i < 65536; i++) f[p][i] = mult(f[lc][i], f[rc][i]); fwt_and(f[p], -1); } if (s[pos] != & ) { fwt_or(f2[lc], 1); fwt_or(f2[rc], 1); for (int i = 0; i < 65536; i++) f2[p][i] = mult(f2[lc][i], f2[rc][i]); fwt_or(f2[p], -1); } for (int i = 0; i < 65536; i++) _add(f[p][i], f2[p][i]); memcpy(f2[p], f[p], sizeof(f[p])); return p; } int m, fs[16]; int main() { scanf( %s , s + 1); n = strlen(s + 1); dfs(1, n); scanf( %d , &m); memset(fs, 255, sizeof(fs)); for (int i = 1, a, b, c, d, e; i <= m; i++) { scanf( %d%d%d%d%d , &a, &b, &c, &d, &e); fs[a | (b << 1) | (c << 2) | (d << 3)] = e; } int ans = 0; for (int i = 0; i < 65536; i++) { bool s = 1; for (int j = 0; j < 16; j++) s &= (fs[j] == -1 || fs[j] == ((i >> j) & 1)); if (s) ans = add(ans, f[1][i]); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = (long long)(1e9 + 7); const long long inv = (long long)(5e8 + 4); int main() { long long n, m; cin >> n >> m; long long ans = (n % mod) * (m % mod) % mod; long long l = 1, r = 1; while (l <= min(n, m)) { long long a = n / l; r = min(m, n / a); long long x1, x2, x3, x4; x1 = (n / r) % mod; x2 = (l + r) % mod; x3 = (x1 * x2) % mod; x4 = (r - l + 1) % mod; long long temp = ((x3 * x4) % mod) * inv % mod; ans = ((ans + mod) - temp) % mod; l = r + 1; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long Mx = 512; long long D[Mx][Mx]; int32_t main() { long long n, m, mod, a = 0, b = 0; cin >> n >> m >> mod; vector<long long> C(n); for (long long i = 0; i < m; i++) for (long long j = 0; j < n; j++) { char c; cin >> c; if (c == 1 ) C[j]++; } for (long long i = 0; i < n; i++) if (C[i] == 0) a++; else if (C[i] == 1) b++; D[0][0] = 1; for (long long d = 1; d <= a + b; d++) { for (long long i = 0; i <= d; i++) { long long j = d - i; D[i][j] = (((i >= 2) ? ((i * (i - 1) / 2 % mod) * D[i - 2][j + 2] % mod) : 0) + ((i >= 1) ? ((i * j % mod) * D[i - 1][j] % mod) : 0) + ((j >= 2) ? ((j * (j - 1) / 2 % mod) * D[i][j - 2] % mod) : 0)) % mod; } } cout << D[a][b]; } |
#include <bits/stdc++.h> int n, a[200005]; bool check1(int x) { for (int i = x + 1; i <= n; i++) if (a[i] >= a[i - 1]) return 0; return 1; } bool check2(int x) { for (int i = x + 1; i <= n; i++) if (a[i] <= a[i - 1]) return 0; return 1; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (check1(1) || check2(1)) { printf( YES ); return 0; } for (int i = 2; i <= n; i++) { if (a[i] <= a[i - 1]) { if (check1(i)) printf( YES ); else printf( NO ); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[105], p[105]; long long g[105]; long long d[105][105][105]; bool ok[105][105]; char c[105]; void read(int& x) { char c = getchar(); x = 0; while (!isdigit(c)) c = getchar(); while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } } long long dp(int l, int r, int k) { if (ok[l][r]) return d[l][r][k] = g[r - l + k + 1]; if (d[l][r][k]) return d[l][r][k]; for (int i = l; i < r; i++) { d[l][r][k] = max(d[l][r][k], dp(l, i, 0) + dp(i + 1, r, k)); } for (int i = l; i < p[r]; i++) { if (c[i] == c[r] && c[i + 1] != c[r]) { d[l][r][k] = max(d[l][r][k], dp(l, i, k + r - p[r] + 1) + dp(i + 1, p[r] - 1, 0)); } } return d[l][r][k]; } int main() { read(n); scanf( %s , c + 1); for (int i = 1; i <= n; i++) { read(a[i]); g[i] = a[i]; } for (int i = 1; i <= n; i++) { for (int j = i; j >= 1; j--) { if (c[j] == c[i]) { p[i] = j; ok[j][i] = 1; } else break; } } for (int i = 2; i <= n; i++) for (int j = 1; j < i; j++) g[i] = max(g[i], g[j] + a[i - j]); printf( %lld n , dp(1, n, 0)); } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e9 + 7; const long long INF = LLONG_MAX / 2; const long long N = 2e5 + 1; struct event { long long sa; long long ea; long long sb; long long eb; }; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); { long long n; cin >> n; vector<event> a(n); for (long long i = 0; i < n; i++) cin >> a[i].sa >> a[i].ea >> a[i].sb >> a[i].eb; vector<pair<double, double> > p; multiset<pair<double, double> > s1; multiset<pair<double, double> > s2; bool ans = 1; for (long long i = 0; i < n; i++) { p.push_back({a[i].sa, i}); p.push_back({a[i].ea + 0.5, i}); } sort(p.begin(), p.end()); for (auto i : p) { pair<double, double> c = {a[i.second].sb, a[i.second].eb}; if (s1.count(c)) { s1.erase(s1.find(c)); s2.erase(s2.find({c.second, c.first})); } else { if (s1.empty() || (*s1.rbegin()).first <= c.second && (*s2.begin()).first >= c.first) { s1.insert(c); s2.insert({c.second, c.first}); } else { ans = 0; break; } } } s1.clear(); s2.clear(); p = vector<pair<double, double> >(0); for (long long i = 0; i < n; i++) { p.push_back({a[i].sb, i}); p.push_back({a[i].eb + 0.5, i}); } sort(p.begin(), p.end()); for (auto i : p) { pair<double, double> c = {a[i.second].sa, a[i.second].ea}; if (s1.count(c)) { s1.erase(s1.find(c)); s2.erase(s2.find({c.second, c.first})); } else { if (s1.empty() || (*s1.rbegin()).first <= c.second && (*s2.begin()).first >= c.first) { s1.insert(c); s2.insert({c.second, c.first}); } else { ans = 0; break; } } } if (ans) cout << YES ; else cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, arr[300010], lft[300010], rgt[300010], mx = 0, cnt = 0; stack<long long> s1, s2; set<long long> st; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n; i++) lft[i] = -1, rgt[i] = n; for (int i = 0; i < n; i++) { while (!s1.empty() && (arr[i] % arr[s1.top()])) rgt[s1.top()] = i, s1.pop(); s1.push(i); } for (int i = n - 1; i >= 0; i--) { while (!s2.empty() && (arr[i] % arr[s2.top()])) lft[s2.top()] = i, s2.pop(); s2.push(i); } for (int i = 0; i < n; i++) mx = max(mx, rgt[i] - lft[i] - 2); for (int i = 0; i < n; i++) if (rgt[i] - lft[i] - 2 == mx) st.insert(lft[i] + 2); cout << st.size() << << mx << n ; for (auto u : st) cout << u << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int l, r; scanf( %d%d , &l, &r); if (l == r && l % 2) printf( %d , l); else printf( %d , 2); } |
#include <bits/stdc++.h> using namespace std; const long long C = 1000000007; long long pow1(long long x, long long y, long long z) { if (y == 0) { return 1; } if (y % 2 == 0) { return pow1(x * x % z, y / 2, z); } return pow1(x, y - 1, z) * x % z; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long n, k, t = 0, r = 0; cin >> n >> k; for (long long q = 0; q < n; q++) { long long w; cin >> w; if (w == 50) { t++; } else { r++; } } long long c[51][51]; for (long long q = 0; q <= 50; q++) { c[0][q] = 1; for (long long q1 = 1; q1 <= q; q1++) { c[q1][q] = c[q1 - 1][q] * (q - q1 + 1) % C * pow1(q1, C - 2, C) % C; } } long long d[5 * n + 2][t + 1][r + 1]; for (long long q = 0; q < 5 * n + 2; q++) { for (long long q1 = 0; q1 <= t; q1++) { fill(d[q][q1], d[q][q1] + r + 1, 0); } } d[0][0][0] = 1; bool flag = true; for (long long q = 0; q <= 5 * n; q++) { if (q % 2 == 1) { for (long long q1 = 0; q1 <= t; q1++) { for (long long q2 = 0; q2 <= r; q2++) { d[q][q1][q2] %= C; for (long long q3 = 0; q3 <= q1; q3++) { for (long long q4 = 0; q4 <= q2; q4++) { if ((q1 - q3) * 50 + (q2 - q4) * 100 <= k && q1 - q3 + q2 - q4) { d[q + 1][q3][q4] += d[q][q1][q2] * c[q1 - q3][q1] % C * c[q2 - q4][q2] % C; } } } } } } else { for (long long q1 = 0; q1 <= t; q1++) { for (long long q2 = 0; q2 <= r; q2++) { d[q][q1][q2] %= C; for (long long q3 = q1; q3 <= t; q3++) { for (long long q4 = q2; q4 <= r; q4++) { if ((q3 - q1) * 50 + (q4 - q2) * 100 <= k && q3 - q1 + q4 - q2) { d[q + 1][q3][q4] += d[q][q1][q2] * c[q3 - q1][t - q1] % C * c[q4 - q2][r - q2] % C; } } } } } } if (d[q][t][r] > 0) { cout << q << n << d[q][t][r] << n ; flag = false; break; } } if (flag) { cout << -1 << n << 0 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void init_code() { ios_base::sync_with_stdio(false); cin.tie(NULL); } int main() { init_code(); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> arr(n + 1, 0); map<int, int> mp; for (int i = 1; i <= n; ++i) { cin >> arr[i]; mp[arr[i]] += 1; } int res = 0, shifts = 0; for (int i = 1; i <= n; ++i) { if (arr[i] > i + shifts) { int diff = arr[i] - i - shifts; res += diff; shifts += diff; } } cout << res << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000007; void __print(long long int x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { long long int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } void solve() { long long int n; cin >> n; vector<long long int> arr(n); for (long long int i = 0; i < n; i++) cin >> arr[i]; long long int l = n, r = -1; for (long long int i = 0; i < n; i++) { if (arr[i] == 1) { l = i; break; } } for (long long int i = n - 1; n - 1 < -1 ? i < -1 : i > -1; n - 1 < -1 ? i += 1 : i -= 1) { if (arr[i] == 1) { r = i; break; } } long long int ans = 0; for (long long int i = l; l < r + 1 ? i < r + 1 : i > r + 1; l < r + 1 ? i += 1 : i -= 1) { if (arr[i] == 0) { ans++; } } cout << ans << endl; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t = 1; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T a) { return (a) * (a); } template <class T> T abs(T a) { return (a < 0) ? -(a) : (a); } const double Pi = acos(-1.0); const double eps = 1e-10; const int INF = 1000 * 1000 * 1000; const double phi = 0.5 + sqrt(1.25); int main() { string Less = z , More = , tmp = ; int n; scanf( %d n , &n); for (int i = 0, _n = (n)-1; i <= _n; ++i) { getline(cin, tmp); Less = min(Less, tmp); More = max(More, tmp); } int i = 0, m = ((int)((Less).size())); bool coincide = 1; while (i < m && coincide) if (Less.substr(0, i + 1) == More.substr(0, i + 1)) i++; else coincide = 0; printf( %d n , i); return 0; } |
#include <bits/stdc++.h> const long long mod = 1e9 + 7; const long long LL_MAX = 9223372036854775807; using namespace std; int a[100005]; int main() { int n; scanf( %d , &n); for (int i = 0; i < 2 * n; i++) scanf( %d , &a[i]); int ans = 0; for (int i = 0; i < 2 * n; i++) { if (a[i] == 0) { continue; } if (a[i] != a[i + 1]) { int t = 0, j; for (j = i + 1; j < 2 * n && a[j] != a[i]; j++) { if (a[j] != 0) t++; } a[j] = 0; ans += t; } else i++; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int record[300000]; int main() { map<pair<int, int>, int> m; memset(record, 0, sizeof(record)); int n, p; scanf( %d%d , &n, &p); map<pair<int, int>, int>::iterator iter; for (int i = 0; i < n; i++) { int a, b; scanf( %d%d , &a, &b); record[a]++; record[b]++; if (a > b) m[make_pair(b, a)]++; else m[make_pair(a, b)]++; } long long ans = 0; for (iter = m.begin(); iter != m.end(); iter++) { int x = (iter->first).first; int y = (iter->first).second; if (record[x] + record[y] - iter->second < p && record[x] + record[y] >= p) ans--; } sort(record + 1, record + n + 1); int ed = n; for (int st = 1; st <= n; st++) { while (record[st] + record[ed] >= p && ed > st) ed--; ans += min(n - ed, n - st); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long fastpow(int a, int b, int MOD) { long long x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y) % MOD; } y = (y * y) % MOD; b /= 2; } return x; } long long InverseEuler(int n, int MOD) { return fastpow(n, MOD - 2, MOD); } long long f[3]; bool init; long long C(int n, int r, int MOD) { if (!init) { init = 1; f[0] = 1; for (int i = 1; i < 300000; i++) f[i] = (f[i - 1] * i) % MOD; } return (f[n] * ((InverseEuler(f[r], MOD) * InverseEuler(f[n - r], MOD)) % MOD)) % MOD; } int N; string s[77000]; unordered_map<int, int> ct[9]; unordered_map<int, int> loc[9][77000]; int main() { std::ios::sync_with_stdio(false); cin >> N; for (int i = 0; i < N; i++) { cin >> s[i]; int M = s[i].length(); for (int j = 0; j < M; j++) { int tmp = 0; for (int k = j; k < M; k++) { tmp = tmp * 10 + (s[i][k] - 0 ); ct[k - j][tmp]++; loc[k - j][i][tmp]++; } } } for (int i = 0; i < N; i++) { int M = s[i].length(); int ln = 10; int res; for (int j = 0; j < M; j++) { int tmp = 0; for (int k = j; k < M; k++) { if (k - j >= ln) break; tmp = tmp * 10 + (s[i][k] - 0 ); if (ct[k - j][tmp] == loc[k - j][i][tmp]) { res = tmp; ln = k - j; } } } string res2 = ; while (res) { res2 += 0 + (res % 10); res /= 10; } reverse(res2.begin(), res2.end()); while (res2.size() != ln + 1) res2 = 0 + res2; cout << res2 << endl; } } |
#include <bits/stdc++.h> using namespace std; using namespace chrono; const int maxn = 1e6; void solve() { int n, a[21][21], val; vector<int> data; map<int, int> m; cin >> n; for (int i = 0; i < n * n; i++) { cin >> val; data.push_back(val); m[val]++; } if (n == 1) { cout << YES << n ; cout << data[0] << n ; return; } for (int ii = 0; ii < n; ii++) { for (int jj = 0; jj < n; jj++) { a[ii][jj] = 0; } } for (int ii = 0; ii < n / 2; ii++) { for (int jj = 0; jj < n / 2; jj++) { int v_f = 0, v_s = 0; for (auto it = m.begin(); it != m.end(); it++) { if (it->second >= 4) { v_f = it->first; break; } } if (v_f == 0) { cout << NO << n ; return; } a[ii][jj] = v_f; a[n - ii - 1][jj] = v_f; a[ii][n - jj - 1] = v_f; a[n - ii - 1][n - jj - 1] = v_f; m[v_f] -= 4; } } if ((n & 1) == 0) { cout << YES << n ; for (int ii = 0; ii < n; ii++) { for (int jj = 0; jj < n; jj++) { cout << a[ii][jj] << ; } cout << n ; } cout << n ; return; } for (int ii = 0; ii < n / 2; ii++) { int f = 0; for (auto it = m.begin(); it != m.end(); it++) { if (it->second >= 2) { f = it->first; } } if (f == 0) { cout << NO << n ; return; } a[ii][n / 2] = f; a[n - ii - 1][n / 2] = f; m[f] -= 2; } for (int ii = 0; ii < n / 2; ii++) { int f = 0; for (auto it = m.begin(); it != m.end(); it++) { if (it->second >= 2) f = it->first; } if (f == 0) { cout << NO << n ; return; } a[n / 2][ii] = f; a[n / 2][n - ii - 1] = f; m[f] -= 2; } int f = 0; for (auto it = m.begin(); it != m.end(); it++) { if (it->second == 1) { f = it->first; } } if ((n & 1) == 1) { a[n / 2][n / 2] = f; } cout << YES << n ; for (int ii = 0; ii < n; ii++) { for (int jj = 0; jj < n; jj++) { cout << a[ii][jj] << ; } cout << n ; } cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = (int)(2e6 + 123); const int R = (int)(2e6); const long long inf = (long long)(1e12 + 7); long long pn, p[maxn], lp[maxn], b[maxn]; bool u[maxn]; void resheto(long long n) { for (long long i = 3; i * i <= n; i += 2) if (!u[i]) for (long long j = i * i; j <= n; j += 2 * i) u[j] = 1; p[pn++] = 2; for (long long i = 3; i <= n; i += 2) if (!u[i]) p[pn++] = i; for (long long i = 0; i < pn; ++i) { for (long long j = p[i]; j <= n; j += p[i]) lp[j] = p[i]; } } long long n, val, x, k, t, ans1; long long res(long long x) { long long ans = x; for (long long mask = 1; mask < (1 << n); ++mask) { long long cnt = 0, a = 1; for (long long i = 0; i < n; ++i) { if ((mask >> i) & 1) { cnt++; a *= b[i]; } } if (cnt & 1) ans -= x / a; else ans += x / a; } return ans - ans1; } long long bin(long long l, long long r, long long k) { while (r - l > 1) { long long m = (l + r) / 2; if (res(m) >= k) r = m; else l = m; } if (res(l) == k) return l; return r; } int main() { ios_base ::sync_with_stdio(NULL); resheto(R); cin >> t; for (long long cs = 1; cs <= t; ++cs) { cin >> x >> val >> k; n = ans1 = 0; while (val != 1) { b[n++] = lp[val]; long long y = lp[val]; while (val % y == 0) val /= y; } ans1 = res(x); cout << bin(x + 1, inf, k) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e6 + 3; const int INFI = 1e9 * 2; const long long LINFI = 1e17; const double pi = acos(-1.0); const int N = 111; const int M = 11; const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1}; double mabs(double x) { return x > 0 ? x : -x; } int main() { int n; while (scanf( %d , &n) != EOF) { if (n == 1) printf( a na nb nb n ); else { if (n & 1) { n--; for (int i = 0; i < n; i++) putchar((i & 2) ? a : b ); puts( c ); for (int i = 0; i < n; i++) putchar((i & 2) ? d : e ); puts( c ); putchar( f ); for (int i = 0; i < n; i++) putchar((i & 2) ? g : h ); printf( n ); putchar( f ); for (int i = 0; i < n; i++) putchar((i & 2) ? i : j ); printf( n ); } else { for (int i = 0; i < n; i++) putchar((i & 2) ? a : b ); printf( n ); for (int i = 0; i < n; i++) putchar((i & 2) ? c : d ); printf( n ); n -= 2; putchar( e ); for (int i = 0; i < n; i++) putchar((i & 2) ? f : g ); puts( h ); putchar( e ); for (int i = 0; i < n; i++) putchar((i & 2) ? i : j ); puts( h ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, h; cin >> n >> h; vector<int> a(n, 0); copy(istream_iterator<int>(cin), istream_iterator<int>(), a.begin()); vector<int> a_orig = a; sort(a.begin(), a.end()); int max1 = a[n - 1] + a[n - 2]; int min1 = a[0] + a[1]; int best_sofar = max1 - min1; vector<int> res(n, 2); if (n >= 3) { min1 = min(min1 + h, a[1] + a[2]); max1 = max(max1, a[0] + a[n - 1] + h); if (abs(max1 - min1) < best_sofar) { best_sofar = abs(max1 - min1); res[distance(a_orig.begin(), min_element(a_orig.begin(), a_orig.end()))] = 1; } } cout << best_sofar << endl; copy(res.begin(), res.end(), ostream_iterator<int>(cout, )); cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e18; const long long mod = (long long)1e9 + 7; const double eps = (double)1e-9; const double pi = acos(-1.0); const int dx[] = {0, 0, 1, 0, -1}; const int dy[] = {0, 1, 0, -1, 0}; const int N = 100500; void solve() { int a, b, cnt = 0; string second; cin >> a >> b >> second; vector<int> v; cnt = 0; for (int i = 0; i < (int)second.size(); ++i) { if (second[i] == X ) continue; int j = i; while (j + 1 < (int)second.size() && second[j + 1] == second[j]) j++; int len = j - i + 1; if (len < b) continue; if (b <= len && len < a) { cout << NO << endl; return; } if (a <= len && len < 2 * b) cnt++; else v.push_back(len); i = j; } if (v.size() == 0) { if (cnt % 2 == 0) cout << NO << endl; else cout << YES << endl; return; } if (v.size() > 1) { cout << NO << endl; return; } int x = v[0]; for (int i = 0; i + a <= x; ++i) { if ((b <= i && i < a) || (b <= x - a - i && x - a - i < a)) continue; if (2 * b <= max(i, x - a - i)) continue; int ncnt = cnt; if (a <= i && i < 2 * b) ncnt++; if (a <= x - a - i && x - a - i < 2 * b) ncnt++; if (ncnt % 2 == 0) { cout << YES << endl; return; } } cout << NO << endl; } int main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false); int T; cin >> T; while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int p = 1000000007; int n, x, y, g[100005], vg[100005], C, P = 1, a1, a2, a3, b, ans; vector<int> l[100005], r[100005]; inline int ksm(int a, int b) { int res = 1; while (b) { if (b & 1) res = (long long)res * a % p; a = (long long)a * a % p; b >>= 1; } return res; } int head[100005], to[200005], nex[200005], cnt; inline void adde(int f, int t) { to[++cnt] = t; nex[cnt] = head[f]; head[f] = cnt; } int fa[100005], dep[100005], sz[100005], son[100005], seg[100005], top[100005]; void dfs1(int u, int pre) { fa[u] = pre; dep[u] = dep[pre] + 1; sz[u] = 1; for (int i = head[u], v; i; i = nex[i]) { v = to[i]; if (v == pre) continue; dfs1(v, u); sz[u] += sz[v]; if (sz[v] > sz[son[u]]) son[u] = v; } } void dfs2(int u) { if (son[u]) { seg[son[u]] = ++cnt; top[son[u]] = top[u]; dfs2(son[u]); } for (int i = head[u], v; i; i = nex[i]) { v = to[i]; if (top[v]) continue; seg[v] = ++cnt; top[v] = v; dfs2(v); } } int sum[100005], sum1[100005]; inline int query(int *a, int x) { int res = 0; for (; x; x -= x & -x) res = (res + a[x]) % p; return res; } inline void modify(int *a, int x, int y) { for (; x <= n + 1; x += x & -x) a[x] = (a[x] + y) % p; } inline int Query(int x) { int res = ((query(sum1, 1) - query(sum, 1) * 2) % p + p) % p; while (x) { res = ((res + (long long)query(sum, seg[x]) * (seg[x] + 1) - query(sum1, seg[x])) % p + p) % p; res = ((res - (long long)query(sum, seg[top[x]] - 1) * seg[top[x]] + query(sum1, seg[top[x]] - 1)) % p + p) % p; x = fa[top[x]]; } return res; } inline void Modify(int x, int y) { while (x) { modify(sum, seg[top[x]], y); modify(sum, seg[x] + 1, (p - y) % p); modify(sum1, seg[top[x]], (long long)y * seg[top[x]] % p); modify(sum1, seg[x] + 1, (p - (long long)y * (seg[x] + 1) % p) % p); x = fa[top[x]]; } } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , &x, &y); g[i] = y - x + 1; vg[i] = ksm(g[i], p - 2); l[x].push_back(i); r[y].push_back(i); P = (long long)P * g[i] % p; C = max(C, y); } for (int i = 1; i < n; ++i) { scanf( %d%d , &x, &y); adde(x, y); adde(y, x); } dep[0] = -1; dfs1(1, 0); seg[1] = top[1] = cnt = 1; dfs2(1); for (int c = 1; c <= C; ++c) { for (unsigned int i = 0; i < l[c].size(); ++i) { int x = l[c][i]; a1 = (a1 + (long long)dep[x] * vg[x]) % p; a2 = (a2 + vg[x]) % p; a3 = (a3 + (long long)dep[x] * vg[x] % p * vg[x]) % p; b = (b + (long long)Query(x) * vg[x]) % p; Modify(x, vg[x]); } ans = ((ans + (long long)a1 * a2 - a3 - 2 * b) % p + p) % p; for (unsigned int i = 0; i < r[c].size(); ++i) { int x = r[c][i]; a1 = ((a1 - (long long)dep[x] * vg[x]) % p + p) % p; a2 = (a2 - vg[x] + p) % p; a3 = ((a3 - (long long)dep[x] * vg[x] % p * vg[x]) % p + p) % p; Modify(x, p - vg[x]); b = ((b - (long long)Query(x) * vg[x]) % p + p) % p; } } ans = (long long)ans * P % p; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void bringToTen(int &k, int &rating, vector<int> &bucket) { for (int i = 9; i > 0; i--) { int x = 0; while (x < 100) { int h = min(k / (10 - i), bucket[x + i]); k -= h * (10 - i); bucket[x + 10] += h; rating += h; bucket[x + i] -= h; x += 10; } } } void addToTen(int &k, int &rating, vector<int> &bucket) { int x = 0; while (x < 100) { int h = min(k / 10, bucket[x]); rating += h; bucket[x + 10] += h; bucket[x] -= h; k -= 10 * h; x += 10; } } int main(void) { int n, k, rating = 0, h; scanf( %d %d , &n, &k); vector<int> a(n); for (int(i) = (0); i < (n); i++) scanf( %d , &a[i]); vector<int> num(101, 0); for (int(i) = (0); i < (n); i++) { num[a[i]]++; rating += a[i] / 10; } bringToTen(k, rating, num); addToTen(k, rating, num); printf( %d n , rating); return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[200000], arr2[200000]; int main() { int n, i; long long sum = 0; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &arr[i]); arr2[i] = arr[i] + arr2[i - 1]; } for (i = 0; i < n; i++) { if (arr[i] == 0) { sum += arr2[i]; } } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 6, M = 3, nBits = 2e8 + 5, MM = (1 << 16), MAX = 1111, OO = 0x3f3f3f3f, MOD = 1000000007, inf = 1 << 30; const double PI = acos(-1); const long long INF = (long long)1e18, MOOD = 1000000007; long long GCD(long long a, long long b) { return !b ? a : GCD(b, a % b); } long long LCM(long long x, long long y) { return (x * y / GCD(x, y)); } long long fact(long long z) { return (z <= 1) ? 1 : z * fact(z - 1); } void fast() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } int t, a, b, color[N], n, m, k, x, y, r[5001], c[5001]; int main() { fast(); cin >> n >> m >> k; for (int i = 1; i <= k; ++i) { cin >> a >> b >> color[i]; if (a == 1) r[b] = i; else c[b] = i; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) cout << color[max(r[i], c[j])] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<long long int, long long int> > P; int n; bool compare_y(const pair<long long int, long long int>& p1, const pair<long long int, long long int>& p2) { if (p1.second != p2.second) return p1.second < p2.second; return p1.first < p2.first; } long long int d(pair<long long int, long long int> p1, pair<long long int, long long int> p2) { return pow(p1.first - p2.first, 2) + pow(p1.second - p2.second, 2); } long long int func(int l, int h, vector<pair<long long int, long long int> > Y) { if (h - l == 1) return d(P[l], P[h]); if (h - l == 2) return min(min(d(P[l], P[l + 1]), d(P[l + 1], P[h])), d(P[l], P[h])); int mid = (l + h) / 2, sz = Y.size(); vector<pair<long long int, long long int> > left, right; for (int i = 0; i < sz; ++i) { if (Y[i].first <= P[mid].first) left.push_back(Y[i]); else right.push_back(Y[i]); } long long int m = min(func(l, mid, left), func(mid + 1, h, right)); for (int i = 0; i < sz; ++i) for (int j = i + 1; j < i + 10 && j < sz; ++j) if (d(Y[i], Y[j]) < m) m = d(Y[i], Y[j]); return m; } int main() { cin >> n; vector<pair<long long int, long long int> > Q; for (int i = 0; i < n; ++i) { long long int u; cin >> u; P.push_back(make_pair(i + 1, u)); Q.push_back(make_pair(i + 1, u)); if (i) P[i].second += P[i - 1].second; if (i) Q[i].second += Q[i - 1].second; } sort(Q.begin(), Q.end(), compare_y); cout << func(0, n - 1, Q) << endl; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) { long long n, x; cin >> n >> x; long long deg[1005] = {}; for (long long i = 1; i < n; i++) { long long u, v; cin >> u >> v; deg[u]++, deg[v]++; } if (n == 1 || deg[x] == 1) cout << Ayush n ; else { if (n % 2) cout << Ashish n ; else cout << Ayush n ; } } cerr << Time elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << sec n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1005; int n, g[21][21], a, t[maxn]; bool ans = true; int find(int times) { int i = 1; bool finded = false; for (; i <= 1000; ++i) if (t[i] >= times) { finded = true; break; } if (!finded) ans = false; t[i] -= times; return i; } int main() { cin >> n; for (int i = 0; i < n * n; i++) { cin >> a; t[a]++; } for (int i = 1; i <= n / 2; i++) for (int j = 1; j <= n / 2; j++) g[i][j] = g[n - i + 1][j] = g[i][n - j + 1] = g[n - i + 1][n - j + 1] = find(4); if (ans) { if (n & 1) { for (int i = 1; i <= n / 2; i++) if (i != (n + 1) / 2) { g[i][(n + 1) / 2] = g[n - i + 1][(n + 1) / 2] = find(2); g[(n + 1) / 2][i] = g[(n + 1) / 2][n - i + 1] = find(2); } g[(n + 1) / 2][(n + 1) / 2] = find(1); } if (ans) { cout << YES << endl; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cout << g[i][j] << n [j == n]; } } if (!ans) cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, d; int a[200]; int x[200], y[200]; int dis[200]; vector<pair<int, int> > edge[200]; int bellman_ford() { for (int i = 0; i < n; ++i) dis[i] = 1000000000; dis[0] = 0; for (int i = 1; i < n; ++i) { for (int j = 0; j < n; ++j) { for (int k = 0, len = edge[j].size(); k < len; ++k) dis[edge[j][k].first] = min(dis[edge[j][k].first], dis[j] + edge[j][k].second); } } return max(0, dis[n - 1]); } int D(int i, int j) { return abs(x[i] - x[j]) + abs(y[i] - y[j]); } int main() { while (cin >> n >> d) { a[0] = 0; a[n - 1] = 0; for (int i = 1; i < n - 1; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { cin >> x[i] >> y[i]; } for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) if (i != j) { edge[i].push_back(make_pair(j, D(i, j) * d - a[i])); } cout << bellman_ford() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 50; const long long Mod = 1e9 + 7; struct node { long long to, next, w; } edge[maxn * 2]; struct Edge { long long u, v; } t[maxn]; long long k = 0, head[maxn]; void add(long long u, long long v) { edge[++k].to = v; edge[k].next = head[u]; head[u] = k; } long long T, p[maxn], m, n; long long ans = 0, sz[maxn], cnt[maxn]; void dfs(long long x, long long f, long long opt) { sz[x] = 1; for (long long i = head[x]; i; i = edge[i].next) { if (edge[i].to == f) continue; dfs(edge[i].to, x, i); sz[x] += sz[edge[i].to]; } if (opt == 0) return; cnt[opt] = sz[x] * (n - sz[x]); if (cnt[opt] == 0 && opt != 0) cnt[opt] = n - 1; } int main() { cin >> T; while (T--) { k = 0; memset(head, 0, sizeof(head)); memset(cnt, 0, sizeof(cnt)); cin >> n; for (long long i = 1; i <= n - 1; i++) { long long u, v; cin >> u >> v; add(u, v); add(v, u); } cin >> m; for (long long i = 1; i <= m; i++) cin >> p[i]; sort(p + 1, p + 1 + m); long long cnt1 = n - 1 - m; if (cnt1 <= 0) cnt1 = 0; dfs(1, 1, 0); sort(cnt + 1, cnt + 1 + k); while (m > n - 1) { p[m - 1] = (p[m - 1] * p[m]) % Mod; m--; } long long ans = 0, opt = 0; for (long long i = k / 2 + 1; i <= k; i++) { if (cnt1) { ans = (ans + cnt[i] * 1) % Mod; cnt1--; } else { ans = (ans + cnt[i] * p[++opt] % Mod) % Mod; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> L[1000005]; long long fac[1000005]; const long long MOD = 1000000007; int main() { int N, M; scanf( %d%d , &N, &M); for (int i = 0; i < N; ++i) { int g; scanf( %d , &g); map<int, int> cnt; for (int j = 0; j < g; ++j) { int a; scanf( %d , &a); ++cnt[a]; } for (auto x : cnt) { L[x.first].push_back({i, x.second}); } } map<vector<pair<int, int>>, int> mp; for (int i = 1; i <= M; ++i) ++mp[L[i]]; fac[0] = 1; for (int i = 1; i <= M; ++i) fac[i] = (fac[i - 1] * i) % MOD; long long ans = 1; for (auto &x : mp) ans = (ans * fac[x.second]) % MOD; printf( %I64d n , ans); } |
#include <bits/stdc++.h> using namespace std; long long get_sum(vector<long long> &prefix, int left, int right) { if (left != 0) return prefix[right] - prefix[left - 1]; else return prefix[right]; } void To_Add_or_Not_To_Add(vector<long long> &a, long long k) { int n = a.size(); sort(a.begin(), a.end()); vector<long long> prefix = a; for (int i = 1; i < n; i++) prefix[i] += prefix[i - 1]; long ans = 0; int maxFreq = INT_MIN; for (auto key : a) { int freq = upper_bound(a.begin(), a.end(), key) - lower_bound(a.begin(), a.end(), key); int low = 0; int high = lower_bound(a.begin(), a.end(), key) - a.begin(); high--; long long stock = k; while (low <= high) { int mid = (low + high) / 2; int len = high - mid + 1; auto req = len * key - get_sum(prefix, mid, high); if (stock >= req) { stock -= req; high = mid - 1; freq += len; } else { low = mid + 1; } } if (freq > maxFreq) { maxFreq = freq; ans = key; } } cout << maxFreq << << ans << endl; } int main() { int n; cin >> n; long long k; cin >> k; vector<long long> a(n); for (auto &ele : a) cin >> ele; To_Add_or_Not_To_Add(a, k); return 0; } |
/* */ #include <bits/stdc++.h> using namespace std; #define rng(x) x.begin(), x.end() #define pb push_back #define ff first #define ss second typedef double db; typedef long long ll; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vi> vvi; typedef vector<vl> vvl; typedef vector<bool> vb; typedef unsigned long long int lld; /*-----------------------------Code begins----------------------------------*/ ll mod = 1e9 + 7; const ll INF = 1e9; ll inv(ll v) { if (v<=1) return v; return inv(mod%v)*(mod-mod/v)%mod; } void solve(){ int n; cin>>n; vvl dist(n,vl(n,INF)); for(int i=1; i<n; i++){ int u,v; cin>>u>>v; u--; v--; dist[u][v]=1; dist[v][u]=1; } for(int i=0; i<n; i++){ dist[i][i]=0; } for(int k=0; k<n; k++){ for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } } } vvl prob(207,vl(207)); for(int i=0; i<=n; i++){ for(int j=0; j<=n; j++){ if(i==0){ prob[i][j]=0; } else if(j==0){ prob[i][j]=1; } else{ prob[i][j] = ((prob[i-1][j] + prob[i][j-1])%mod * inv(2) )%mod; } } } ll ans=0; for(int a=0; a<n; a++){ for(int b=a+1; b<n; b++){ for(int root=0; root<n; root++){ int root_a = dist[a][root]; int root_b = dist[b][root]; int root_lca = ( root_a + root_b - dist[a][b] )/2 ; int lca_a = root_a - root_lca ; int lca_b = root_b - root_lca ; ans = (ans + prob[lca_a][lca_b])%mod; } } } ans = (ans * inv(n) )%mod; cout<<ans<< n ; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T = 1; //cin >> T; while (T--){ solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long double EPS = (long double)1e-7; const long double PI = acos(0) * 2; bool isZero(const long double& x) { return abs(x) <= EPS; } int sign(const long double& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); } long long gcd(long long a, long long b) { for (; b; a %= b, swap(a, b)) { } return abs(a); } pair<long long, long long> operator+(const pair<long long, long long>& a, const pair<long long, long long>& b) { return pair<long long, long long>(a.first + b.first, a.second + b.second); } pair<long long, long long> operator-(const pair<long long, long long>& a, const pair<long long, long long>& b) { return pair<long long, long long>(a.first - b.first, a.second - b.second); } pair<long long, long long> operator*(const pair<long long, long long>& a, const long long& b) { return pair<long long, long long>(a.first * b, a.second * b); } long long operator*(const pair<long long, long long>& a, const pair<long long, long long>& b) { return a.first * b.second - b.first * a.second; } long long ccw(const pair<long long, long long>& a, const pair<long long, long long>& b, const pair<long long, long long>& c) { return a * b + b * c + c * a; } void fg(vector<int> G[], int a, int b) { G[a].emplace_back(b); G[b].emplace_back(a); } void fg(vector<pair<int, int> > G[], int a, int b, int c) { G[a].emplace_back(b, c); G[b].emplace_back(a, c); } const int MAXN = 1000055; int A[MAXN], B[MAXN]; bitset<MAXN> C; int T, N; void run() { cin >> N; for (int i = 1; i <= N; i++) { cin >> A[i]; B[i] = i - A[i]; } vector<int> V; for (int i = 1;;) { V.emplace_back(i); if (C[i]) break; C[i] = true; i = B[i]; } for (int v : V) C[v] = false; V.erase(V.begin(), find(((V).begin()), ((V).end()), V.back()) + 1); cout << ((int)(V).size()) << n ; for (int v : V) cout << v << ; cout << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); for (cin >> T; T--;) run(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf(1010101010); int le_res, aa; char naam[1000]; int le_naam; char naam_and_res[1000]; char occ[1000]; int zvals[1000]; void z_functie(char* s, int n, int* z) { int a(0), b(0); for (int i(0); i < (n); i++) z[i] = n; for (int i = 1; i < n; i++) { int k = max(0, min(b - i, z[i - a])); while (i + k < n && s[i + k] == s[k]) k++; z[i] = k; if (i + k > b) a = i, b = i + k; } } bool chk(char* s) { for (int i(0); i < (le_res); i++) naam_and_res[le_naam + 1 + i] = s[i]; naam_and_res[le_naam + 1 + le_res] = 0; z_functie(naam_and_res, le_naam + 1 + le_res, zvals); for (int i(0); i < (le_res - le_naam + 1); i++) { int zz(zvals[le_naam + 1 + i]); if (zz == le_naam && occ[i] == 0 ) return false; if (zz != le_naam && occ[i] == 1 ) return false; } return true; } char tpl[1000]; char ans[1000]; int main() { cin >> le_res >> aa; scanf( %s , naam), le_naam = strlen(naam); for (int i(0); i < (le_naam); i++) naam_and_res[i] = naam[i]; naam_and_res[le_naam] = $ ; scanf( %s , occ); for (int i(0); i < (le_res); i++) tpl[i] = . ; for (int i(0); i < (le_res - le_naam + 1); i++) { if (occ[i] == 1 ) { for (int j(i); j < (i + le_naam); j++) { tpl[j] = naam[j - i]; } } } for (int i(0); i < (le_naam); i++) { char c( a + (((naam[i] - a ) + 1) % aa)); for (int i(0); i < (le_res); i++) { if (tpl[i] == . ) ans[i] = c; else ans[i] = tpl[i]; } if (chk(ans)) { ans[le_res] = 0; printf( %s n , ans); goto done; } } puts( No solution ); done:; } |
#include <bits/stdc++.h> #pragma GCC optimize 03 using namespace std; const long long int N = 2e5 + 5; const long long int mod = 1e9 + 7; const long long int inf = 1e9 + 9; long long int a[N]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n; cin >> n; stack<long long int> s; long long int ans = 0; for (long long int i = 1; i <= n; i++) { cin >> a[i]; while (!s.empty() && a[s.top()] < a[i]) s.pop(); if (!s.empty()) ans = max(ans, a[s.top()] ^ a[i]); s.push(i); } for (long long int i = n; i >= 1; i--) { while (!s.empty() && a[s.top()] < a[i]) s.pop(); if (!s.empty()) ans = max(ans, a[s.top()] ^ a[i]); s.push(i); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; char c[2001][2001]; int sum1[2001][2001], sum2[2001][2001]; int f[2001][2001][2]; int mod = 1000000007; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %c , &c[i][j]); } } if (n == 1 && m == 1 && c[1][1] == . ) { cout << 1 << endl; return 0; } for (int i = n; i >= 1; i--) { for (int j = m; j >= 1; j--) { if (c[i][j] == R ) { sum1[i][j] = sum1[i][j + 1] + 1; sum2[i][j] = sum2[i + 1][j] + 1; } else { sum1[i][j] = sum1[i][j + 1]; sum2[i][j] = sum2[i + 1][j]; } } } for (int i = 1; i < n; i++) { if (sum2[i][m] == 0) f[i][m][0] = 1; } for (int i = 1; i < m; i++) { if (sum1[n][i] == 0) f[n][i][1] = 1; } for (int i = n - 1; i >= 1; i--) { for (int j = m - 1; j >= 1; j--) { f[i][j][0] += f[i + 1][j][1]; f[i][j][1] += f[i][j + 1][0]; f[i][j][0] %= mod; f[i][j][1] %= mod; if (c[i + 1][j] == R ) { f[i][j][0] += (f[i + 1][j][0] - f[n - sum2[i + 1][j] + 1][j][1] + mod) % mod; } else { f[i][j][0] += f[i + 1][j][0]; } if (c[i][j + 1] == R ) { f[i][j][1] += (f[i][j + 1][1] - f[i][m - sum1[i][j + 1] + 1][0] + mod) % mod; } else { f[i][j][1] += f[i][j + 1][1]; } f[i][j][0] %= mod; f[i][j][1] %= mod; } } cout << (f[1][1][0] + f[1][1][1]) % mod << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } const int LIM = 1e5 + 5, MOD = 1e9 + 7; int t, n, m, k, x, y; vector<int> par, rk; int getpar(int i) { return (par[i] == i) ? i : (par[i] = getpar(par[i])); } bool join(int i, int j) { i = getpar(i), j = getpar(j); if (i == j) return 0; if (rk[i] > rk[j]) par[j] = i; else { par[i] = j; if (rk[i] == rk[j]) rk[j]++; } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; par.resize(2 * n + 2 * m - 2); for (int i = 0; i < par.size(); i++) par[i] = i; x = t + m + n + m - 2; rk.assign(2 * n + 2 * m - 2, 0); for (int i = 0; i < n; i++) { join(i + x, i); join(i + x + 1 - m, i + m - 1); } for (int i = 0; i < m; i++) { join(x - i, i); join(x - i + n - 1, i + n - 1); } set<int> st; for (int i = 0; i < par.size(); i++) { st.insert(getpar(i)); } cout << st.size() << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; ll x[1 << 18]; int main() { ios::sync_with_stdio(false), cin.tie(0); ll n, r; cin >> n >> r; ll m = 1 << n; ll sum = 0; for (int i = 0; i < m; i++) cin >> x[i], sum += x[i]; cout << fixed << setprecision(7); cout << (ld)sum / (ld)m << endl; for (int i = 0; i < r; i++) { ll a, b; cin >> a >> b; sum -= x[a]; x[a] = b; sum += x[a]; cout << (ld)sum / (ld)m << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long n, k; cin >> n >> k; if (k >= n / 2) cout << n * (n - 1) / 2; else cout << n * (n - 1) / 2 - (n - 2 * k) * (n - 2 * k - 1) / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long T; cin >> T; while (T--) { int N; string S; cin >> N >> S; int Who = -1; string Ans1 = , Ans2 = ; for (int i = 0; i < N; i++) { if (S[i] == 2 && !(~Who)) { Ans1.push_back( 1 ); Ans2.push_back( 1 ); } else if (S[i] == 2 && ~Who) { Ans1.push_back( 0 ); Ans2.push_back( 2 ); } else if (S[i] == 0 ) { Ans1.push_back( 0 ); Ans2.push_back( 0 ); } else { if (~Who) { Ans1.push_back( 0 ); Ans2.push_back( 1 ); } else { Ans1.push_back( 1 ); Ans2.push_back( 0 ); Who = 1; } } } cout << Ans1 << n << Ans2 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int const N = 1000000; int n, m; vector<vector<pair<int, int> > > adj; bool valid; int ans[N]; int cnt; int st[N * 3]; void readin() { int u, v; char b[10]; scanf( %d%d , &n, &m); valid = true; adj.clear(); adj.resize(n + 1); for (int i = 0; i < m; ++i) { scanf( %d%d%s , &u, &v, b); if (v <= u) { valid = false; } adj[u].push_back(make_pair(v, b[0] == L ? 0 : 1)); } } inline int lc(int root) { return root << 1; } inline int rc(int root) { return (root << 1) | 1; } void init_st(int root, int l, int r) { if (l == r) { st[root] = l; return; } int mid = (l + r) >> 1; init_st(lc(root), l, mid); init_st(rc(root), mid + 1, r); st[root] = max(st[lc(root)], st[rc(root)]); } void update_st(int root, int l, int r, int x, int v) { if (l == r) { st[root] = v; return; } int mid = (l + r) >> 1; if (x <= mid) { update_st(lc(root), l, mid, x, v); } else { update_st(rc(root), mid + 1, r, x, v); } } int query_st(int root, int l, int r, int x, int y) { if (l == r) { return st[root]; } int mid = (l + r) >> 1; if (y <= mid) { return query_st(lc(root), l, mid, x, y); } else if (x > mid) { return query_st(rc(root), mid + 1, r, x, y); } else { return max(query_st(lc(root), l, mid, x, mid), query_st(rc(root), mid + 1, r, mid + 1, y)); } } bool build(int root, int limit) { if (root > limit) { return true; } int l_max = 0, r_min = INT_MAX; for (vector<pair<int, int> >::const_iterator it = adj[root].begin(); it != adj[root].end(); ++it) { if (it->second == 0) { l_max = max(l_max, query_st(1, 1, n, root + 1, it->first)); } else { r_min = min(r_min, it->first); } } if (l_max == 0) { ans[cnt++] = root; return build(root + 1, limit); } else if (r_min == INT_MAX) { bool ret = build(root + 1, limit); ans[cnt++] = root; return ret; } else { if (l_max >= r_min) { return false; } bool ret = true; ret = ret && build(root + 1, l_max); ans[cnt++] = root; ret = ret && build(l_max + 1, limit); return ret; } } void solve() { if (!valid) { printf( IMPOSSIBLE n ); return; } init_st(1, 1, n); for (int i = n; i >= 1; --i) { int u = i; for (vector<pair<int, int> >::const_iterator it = adj[i].begin(); it != adj[i].end(); ++it) { u = max(u, it->first); } update_st(1, 1, n, i, query_st(1, 1, n, i, u)); } cnt = 0; if (build(1, n)) { for (int i = 0; i < n; ++i) { printf( %d%c , ans[i], i < n - 1 ? : n ); } } else { printf( IMPOSSIBLE n ); } } int main() { readin(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, f = 0; cin >> n; string a[] = { Sheldon , Leonard , Penny , Rajesh , Howard }; while (n > 5) { n = n / 2 - 2; } cout << a[n - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, k; cin >> n >> k; string s, st = ; cin >> s; vector<int> m(28); vector<int> l(28); for (int i = 0; i < n; i++) { m[((int)s[i]) - 97]++; } if (n == k) { cout << n ; return 0; } while (k > 0) { for (int i = 0; i < 27; i++) { if (k >= m[i]) { k -= m[i]; l[i] = m[i]; } else { m[i] = k; l[i] = k; k = 0; } if (k == 0) { break; } } } for (int i = 0; i < n; i++) { if (l[((int)s[i]) - 97] > 0) { l[((int)s[i]) - 97]--; continue; } else cout << s[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 80, Inf = 0x3f3f3f3f; int n, f[N][N][N][2]; int pos[3][N], num[3][N]; char s[N]; inline int getid(char ch) { if (ch == V ) return 0; if (ch == K ) return 1; return 2; } inline int move(int i, int j, int k, int id) { return max(0, num[0][id] - i) + max(0, num[1][id] - j) + max(0, num[2][id] - k) - 1; } int main() { ios::sync_with_stdio(false); cin >> n >> s + 1; for (int i = 1; i <= n; ++i) { int now = getid(s[i]); for (int j = 0; j < 3; ++j) num[j][i] = num[j][i - 1]; pos[now][++num[now][i]] = i; } memset(f, 0x3f, sizeof f); f[0][0][0][0] = 0; for (int i = 0; i <= num[0][n]; ++i) for (int j = 0; j <= num[1][n]; ++j) for (int k = 0; k <= num[2][n]; ++k) for (int fl = 0; fl < 2; ++fl) { if (i < num[0][n]) f[i + 1][j][k][1] = min(f[i + 1][j][k][1], f[i][j][k][fl] + move(i, j, k, pos[0][i + 1])); if (j < num[1][n] && !fl) f[i][j + 1][k][0] = min(f[i][j + 1][k][0], f[i][j][k][fl] + move(i, j, k, pos[1][j + 1])); if (k < num[2][n]) f[i][j][k + 1][0] = min(f[i][j][k + 1][0], f[i][j][k][fl] + move(i, j, k, pos[2][k + 1])); } cout << min(f[num[0][n]][num[1][n]][num[2][n]][0], f[num[0][n]][num[1][n]][num[2][n]][1]) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; long long fn(string a, string b) { long long n = a.size(), m = b.size(), j = 0; for (long long i = 0; i < m; i++) { if (b[i] == a[j]) { j++; if (j >= n) { return m - n; } } } if (j >= n) { return m - n; } return m - j + n - j; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long ttt; cin >> ttt; vector<string> v; long long x = 1; while (x <= inf) { string s = ; long long z = x; while (z) { s += (char)( 0 + z % 10); z /= 10; } reverse(s.begin(), s.end()); v.push_back(s); x *= 2; } while (ttt--) { string s; cin >> s; long long n = s.size(); long long ans = inf; for (auto x : v) { ans = min(ans, fn(x, s)); } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; #define lln long long int #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); void solve(){ int n, k; cin>>n>>k; vector<int> a(n+1); for(int i = 1;i<=k;i++) a[i] = i; int x = k - 1; for(int i = k+1;i<=n;i++){ a[i] = x; x--; } vector<int> p(n+1); vector<int> ans; for(int i = n;i>=1;i--){ if(p[a[i]]==1) continue; else { ans.push_back(a[i]); p[a[i]] = 1; } } reverse(ans.begin(),ans.end()); for(auto i:ans){ cout<<i<< ; } cout<<endl; } int main(){ fast int q; cin>>q; while(q--){ solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, sz1, sz2, val; int d1[200005], d2[200005], d[200005]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &val); if (val != 0) d1[sz1++] = val; } for (int i = 0; i < n; i++) { scanf( %d , &val); if (val != 0) d2[sz2++] = val; } for (int i = 0; i < sz1; i++) { int val = d1[i]; int id = (i + 1) % sz1; d[val] = d1[id]; } for (int i = 0; i < sz2; i++) { int val = d2[i]; int id = (i + 1) % sz2; if (d[val] == d2[id]) continue; printf( NO n ); return 0; } printf( YES n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char arr[4][4], a; for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { cin >> a; arr[i][j] = a; } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { if (arr[i][j] == # && arr[i][1 + j] == # && (arr[1 + i][j] == # || arr[i + 1][1 + j] == # ) || (arr[i][j] == # || arr[i][1 + j] == # ) && arr[1 + i][j] == # && arr[i + 1][1 + j] == # ) { cout << YES ; return 0; } else if (arr[i][j] == . && arr[i][1 + j] == . && (arr[1 + i][j] == . || arr[i + 1][1 + j] == . ) || (arr[i][j] == . || arr[i][1 + j] == . ) && arr[1 + i][j] == . && arr[i + 1][1 + j] == . ) { cout << YES ; return 0; } } } cout << NO ; } |
#include <bits/stdc++.h> const int N = 1e6 + 5, P = 1e9 + 9; inline int ksm(int a, int b) { int r = 1; for (; b; b >>= 1, a = (long long)a * a % P) if (b & 1) r = (long long)r * a % P; return r; } int n, q, a[N], t[N], f[N], F[N]; struct mat { int s[2][2]; inline friend mat operator+(mat a, mat b) { return a.s[0][0] = (a.s[0][0] + b.s[0][0]) % P, a.s[0][1] = (a.s[0][1] + b.s[0][1]) % P, a.s[1][0] = (a.s[1][0] + b.s[1][0]) % P, a.s[1][1] = (a.s[1][1] + b.s[1][1]) % P, a; } inline friend mat operator*(mat a, mat b) { mat c; c.s[0][0] = ((long long)a.s[0][0] * b.s[0][0] + (long long)a.s[0][1] * b.s[1][0]) % P, c.s[0][1] = ((long long)a.s[0][0] * b.s[0][1] + (long long)a.s[0][1] * b.s[1][1]) % P, c.s[1][0] = ((long long)a.s[1][0] * b.s[0][0] + (long long)a.s[1][1] * b.s[1][0]) % P, c.s[1][1] = ((long long)a.s[1][0] * b.s[0][1] + (long long)a.s[1][1] * b.s[1][1]) % P; return c; } inline friend bool operator!=(mat a, mat b) { return a.s[0][0] != b.s[0][0] || a.s[0][1] != b.s[0][1] || a.s[1][0] != b.s[1][0] || a.s[1][1] != b.s[1][1]; } inline bool INV(mat &b) { long long x = (long long)s[0][0] * s[1][1] - (long long)s[0][1] * s[1][0]; if (!x) return 0; if (x > 0) x = ksm(x % P, P - 2), b.s[0][0] = (long long)x * s[1][1] % P, b.s[1][1] = x * s[0][0] % P, b.s[0][1] = x * (P - s[0][1]) % P, b.s[1][0] = x * (P - s[1][0]) % P; else x = ksm((-x) % P, P - 2), b.s[0][0] = (long long)x * (P - s[1][1]) % P, b.s[1][1] = x * (P - s[0][0]) % P, b.s[0][1] = x * s[0][1] % P, b.s[1][0] = x * s[1][0] % P; return 1; } } E, Z, O, lz[N]; inline mat ksm(mat a, int b) { mat r = E; for (; b; b >>= 1, a = a * a) if (b & 1) r = r * a; return r; } inline int sum(int l, int r, mat v) { return ((long long)(F[r] - F[l - 1] + P) * v.s[1][1] + (long long)(F[r + 1] - F[l] + P) * v.s[1][0]) % P; } inline void tg(int p, int l, int r, mat v) { lz[p] = lz[p] + v, t[p] = (t[p] + sum(l, r, v)) % P; } inline void pushdown(int p, int l, int r, int mid) { if (lz[p] != O) tg(p << 1, l, mid, lz[p]), tg(p << 1 | 1, mid + 1, r, lz[p]), lz[p] = O; } inline void build(int p, int l, int r) { if (l == r) { t[p] = a[l]; return; } int mid = l + r >> 1; build(p << 1, l, mid), build(p << 1 | 1, mid + 1, r), t[p] = (t[p << 1] + t[p << 1 | 1]) % P; } inline void add(int p, int l, int r, int x, int y, mat v) { if (l >= x && r <= y) return tg(p, l, r, v); int mid = l + r >> 1; pushdown(p, l, r, mid); if (x <= mid) add(p << 1, l, mid, x, y, v); if (y > mid) add(p << 1 | 1, mid + 1, r, x, y, v); t[p] = (t[p << 1] + t[p << 1 | 1]) % P; } inline int query(int p, int l, int r, int x, int y) { if (l >= x && r <= y) return t[p]; int mid = l + r >> 1, res = 0; pushdown(p, l, r, mid); if (x <= mid) res = (res + query(p << 1, l, mid, x, y)) % P; if (y > mid) res = (res + query(p << 1 | 1, mid + 1, r, x, y)) % P; return res; } int main() { scanf( %d%d , &n, &q); int i, l, r, v; mat x, y; for (i = 1; i <= n; i++) scanf( %d , a + i); build(1, 1, n); for (f[1] = f[2] = 1, i = 3; i < N; i++) f[i] = (f[i - 1] + f[i - 2]) % P; for (i = 1; i < N; i++) F[i] = (F[i - 1] + f[i]) % P; E.s[0][0] = E.s[1][1] = Z.s[0][0] = Z.s[0][1] = Z.s[1][0] = 1; while (q--) if (scanf( %d%d%d , &i, &l, &r), i > 1) printf( %d n , query(1, 1, n, l, r)); else x = ksm(Z, l - 1), x.INV(y) && (add(1, 1, n, l, r, y), 0); return 0; } |
#include <bits/stdc++.h> using namespace std; void low(int n) { switch (n) { default: cout << zero ; break; case 1: cout << one ; break; case 2: cout << two ; break; case 3: cout << three ; break; case 4: cout << four ; break; case 5: cout << five ; break; case 6: cout << six ; break; case 7: cout << seven ; break; case 8: cout << eight ; break; case 9: cout << nine ; break; case 10: cout << ten ; break; case 11: cout << eleven ; break; case 12: cout << twelve ; break; case 13: cout << thirteen ; break; case 14: cout << fourteen ; break; case 15: cout << fifteen ; break; case 16: cout << sixteen ; break; case 17: cout << seventeen ; break; case 18: cout << eighteen ; break; case 19: cout << nineteen ; break; } } void high(int n) { switch (n) { case 2: cout << twenty ; break; case 3: cout << thirty ; break; case 4: cout << forty ; break; case 5: cout << fifty ; break; case 6: cout << sixty ; break; case 7: cout << seventy ; break; case 8: cout << eighty ; break; default: cout << ninety ; break; } } int main() { int n; cin >> n; if (n < 20) low(n); else { high(n / 10); if (n % 10 != 0) { cout << - ; low(n % 10); } } return 0; } |
#include <bits/stdc++.h> using namespace std; void ga(int N, int *A) { for (int i(0); i < N; i++) scanf( %d , A + i); } char s[222222], r[222222]; int N, A, B; int main(void) { scanf( %s%s , s, r), N = strlen(s); for (int i(0); i < N; i++) if (s[i] ^ r[i]) A += s[i] == 52, B += s[i] != 52; printf( %d n , max(A, B)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5, mod = 1e9 + 7; int add(int x, int y) { x += y; return x >= mod ? x - mod : x; } int c[maxn << 1], dp[maxn]; struct node { int x, y, op; } e[maxn]; bool cmp(node a, node b) { if (a.x == b.x) return a.y < b.y; return a.x < b.x; } void ins(int x, int k) { while (x) { c[x] = add(c[x], k); x -= x & (-x); } } int query(int x) { int res = 0; for (; x <= 400000; x += (x & (-x))) { res = add(res, c[x]); } return res; } int main() { int n, q, x; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &e[i].y, &e[i].x); } scanf( %d , &q); while (q--) { scanf( %d , &x); e[x].op = 1; } sort(e + 1, e + 1 + n, cmp); ins(2 * n, 1); for (int i = 1; i <= n; i++) { dp[i] = query(e[i].y); ins(e[i].y, dp[i]); } int pv = 1, ans = 0; for (int i = n; i > 0; i--) { ins(e[i].y, (mod - dp[i]) % mod); if (e[i].op == 1 && e[i].y >= pv) { ans = add(ans, query(pv)); pv = e[i].y; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline bool ig(char c) { return c >= 0 && c <= 9 ; } inline void read(int &oi) { char c; int f = 1, res = 0; while (c = getchar(), (!ig(c)) && c != - ) ; c == - ? f = -1 : res = (c ^ 48); while (c = getchar(), ig(c)) res = res * 10 + (c ^ 48); oi = f * res; } inline void print(int oi) { if (oi < 0) putchar( - ), oi = ~oi + 1; if (oi > 9) print(oi / 10); putchar(oi % 10 + 48); } int n, m, ans; struct Edge { int x, y, z; bool operator<(const Edge &b) const { return z > b.z; } } e[200005]; int fa[200005]; bool s[200005]; inline int gfa(int u) { return u ^ fa[u] ? fa[u] = gfa(fa[u]) : u; } int main() { read(n); read(m); for (int i = 1; i <= m; ++i) read(e[i].x), read(e[i].y), read(e[i].z); sort(e + 1, e + 1 + m); for (int i = 1; i <= n; ++i) fa[i] = i, s[i] = true; for (int i = 1; i <= m; ++i) { int fx = gfa(e[i].x), fy = gfa(e[i].y); if ((fx ^ fy) && (s[fx] || s[fy])) ans += e[i].z, fa[fx] = fy, s[fy] = s[fy] & s[fx]; else if (!(fx ^ fy) && s[fx]) s[fx] = false, ans += e[i].z; } print(ans); putchar( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200005]; unordered_map<long long, long long> f, done; vector<long long> v; int main() { std::ios_base::sync_with_stdio(0); cin.tie(0); long long n; long long ans = 0; cin >> n; for (long long i = 1; i <= n; i++) { cin >> a[i]; f[a[i]]++; } for (int i = 1; i <= n; i++) { if (f[i] == 0) { ans++; v.push_back(i); } } cout << ans << endl; long long ptr = 0; for (long long i = 1; i <= n; i++) { if (f[a[i]] == 1) { if (done[a[i]] == 0) { cout << a[i] << ; done[a[i]]++; } else { cout << v[ptr] << ; ptr++; } } else { if (v[ptr] > a[i] && done[a[i]] == 0) { cout << a[i] << ; f[a[i]]--; done[a[i]]++; } else { f[a[i]]--; cout << v[ptr] << ; done[v[ptr]]++; ptr++; } } } } |
#include <bits/stdc++.h> using namespace std; int N, M, T, tb[100005]; long long a, b, c, co, x; map<int, int> mp; map<int, int>::iterator it; int chk[100005]; int main() { int i, j, k; scanf( %d%I64d , &N, &co); for (i = 1; i <= N; i++) { scanf( %d , &tb[i]); mp[tb[i]]++; x += tb[i]; } if (x < co) { printf( -1 n ); scanf( ); return 0; } else if (x == co) { printf( n ); scanf( ); return 0; } a = N; b = 0; for (it = mp.begin(); it != mp.end(); it++) { k = (*it).first; j = (*it).second; if (c + a * (k - b) > co) break; c += a * (k - b); b = k; a -= j; } a = k - b; long long num = co - c; int idx = 0; for (i = 1; i <= N; i++) { if (tb[i] >= k) { chk[idx] = i; idx++; } } b = num / idx; num %= idx; i = num; bool err = true; for (int kk = 1; kk <= idx; kk++) { if (b != a - 1 || ((b == a - 1 && tb[chk[i]] != k) || err)) printf( %d , chk[i]); i++; if (i >= idx) { i %= idx; err = false; } } scanf( ); } |
#include <bits/stdc++.h> using namespace std; int mida; void update(vector<int>& T, int p, int x) { T[mida + p] = x; for (int i = (mida + p) / 2; i > 0; i /= 2) T[i] = T[2 * i] + T[2 * i + 1]; } int suma(vector<int>& T, int a, int b, int c = 0, int d = mida - 1, int p = 1) { if (a <= c and d <= b) return T[p]; if (d < a or c > b) return 0; return suma(T, a, b, c, (c + d) / 2, 2 * p) + suma(T, a, b, (c + d) / 2 + 1, d, 2 * p + 1); } int main() { int k; string r; cin >> k >> r; string s; for (int i = 0; i < k; ++i) s += r; int n = s.size(); mida = 1; while (mida < n) mida *= 2; vector<vector<int> > T( z - a + 1, vector<int>(2 * mida, 0)); for (int i = 0; i < n; ++i) update(T[s[i] - a ], i, 1); int q; cin >> q; while (q--) { int p; char c; cin >> p >> c; int ini = 0, fin = n - 1; while (ini <= fin) { int m = (ini + fin) / 2; if (suma(T[c - a ], 0, m) >= p) fin = m - 1; else ini = m + 1; } s[fin + 1] = 0; update(T[c - a ], fin + 1, 0); } for (int i = 0; i < n; ++i) if (s[i] > 0) cout << s[i]; cout << endl; } |
#include <bits/stdc++.h> using namespace std; int r, c, s, e; vector<int> adj[1000 * 1000 + 10]; int d[1000 * 1000 + 10]; char grid[1000][1000]; char access(int n) { int x = n % c; int y = n / c; return grid[y][x]; } void bfs(int n) { queue<int> frontier; frontier.push(n); d[n] = 0; while (!frontier.empty()) { int u = frontier.front(); frontier.pop(); for (int i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (d[v] == -1) { d[v] = d[u] + 1; frontier.push(v); } } } } int main() { cin >> r >> c; for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { cin >> grid[i][j]; } } for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { int cell = i * c + j; if (grid[i][j] == T ) continue; if (grid[i][j] == S ) s = cell; else if (grid[i][j] == E ) e = cell; if (grid[i - 1][j] != T && i > 0) { adj[cell].push_back(cell - c); adj[cell - c].push_back(cell); } if (grid[i + 1][j] != T && i < r - 1) { adj[cell].push_back(cell + c); adj[cell + c].push_back(cell); } if (grid[i][j - 1] != T && j > 0) { adj[cell].push_back(cell - 1); adj[cell - 1].push_back(cell); } if (grid[i][j + 1] != T && j < c - 1) { adj[cell].push_back(cell + 1); adj[cell + 1].push_back(cell); } } } memset(d, -1, sizeof(d)); bfs(e); int shortest_path = d[s]; int ans = 0; for (int i = 0; i < r * c; i++) { char in = access(i); if (in == T || in == E || in == S ) continue; if (d[i] <= shortest_path && d[i] != -1) { ans += in - 0 ; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int in[100000 + 5]; bool doit() { if (scanf( %d%d , &n, &m) != 2) return false; for (int i = 0; i < n; ++i) in[i] = 0; int x, y; for (int i = 0; i < m; ++i) { scanf( %d%d , &x, &y); ++in[--x], ++in[--y]; } sort(in, in + n); if (in[0] == 1 && in[n - 2] == 1 && in[n - 1] == n - 1) printf( star topology n ); else if (in[2] == 2 && in[n - 1] == 2) { if (in[0] == 1 && in[1] == 1) printf( bus topology n ); else if (in[0] == 2) printf( ring topology n ); else printf( unknown topology n ); } else printf( unknown topology n ); return true; } int main() { while (1) if (!doit()) break; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = (1 << 19) + 5; template <typename T> inline void read(T &WOW) { T x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) flag = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } WOW = flag * x; } namespace ModCalculator { const int MOD = 998244353; inline void Inc(int &x, int y) { x += y; if (x >= MOD) x -= MOD; } inline void Dec(int &x, int y) { x -= y; if (x < 0) x += MOD; } inline int Add(int x, int y) { Inc(x, y); return x; } inline int Sub(int x, int y) { Dec(x, y); return x; } inline int Mul(int x, int y) { return 1LL * x * y % MOD; } inline int Ksm(int x, int y) { int ret = 1; for (; y; y >>= 1) { if (y & 1) ret = Mul(ret, x); x = Mul(x, x); } return ret; } inline int Inv(int x) { return Ksm(x, MOD - 2); } } // namespace ModCalculator using namespace ModCalculator; int len, rev[MAXN], w1[MAXN], w2[MAXN], fac[MAXN]; void NTT_init(int n) { for (len = 1; len < n; len <<= 1) ; fac[0] = 1; for (int i = 1; i <= len; ++i) { fac[i] = Mul(fac[i - 1], i); } int Gi = 3, Gv = Inv(Gi); for (int i = 1; i < len; i <<= 1) { int wk1 = Ksm(Gi, (MOD - 1) / (i << 1)), wnk1 = 1; int wk2 = Ksm(Gv, (MOD - 1) / (i << 1)), wnk2 = 1; for (int k = 0; k < i; ++k) { w1[i + k] = wnk1; wnk1 = Mul(wnk1, wk1); w2[i + k] = wnk2; wnk2 = Mul(wnk2, wk2); } } } void GetRev(int n) { int bit = -1; for (len = 1; len < n; len <<= 1) ++bit; for (int i = 0; i < len; ++i) { rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << bit); } } void NTT(vector<int> &a, int type) { a.resize(len); int *w = (type == 1 ? w1 : w2); for (int i = 0; i < len; ++i) { if (i < rev[i]) { swap(a[i], a[rev[i]]); } } for (int i = 1; i < len; i <<= 1) { for (int j = 0; j < len; j += (i << 1)) { for (int k = 0; k < i; ++k) { int x = a[j + k], y = Mul(a[j + k + i], w[i + k]); a[j + k] = Add(x, y); a[j + k + i] = Sub(x, y); } } } if (type == 1) return; int lenv = Inv(len); for (int i = 0; i < len; ++i) { a[i] = Mul(a[i], lenv); } } vector<int> Poly_Mul(vector<int> F, vector<int> G) { int deg = F.size() + G.size() - 1; if (deg <= 100) { vector<int> H(deg, 0); int n = F.size(), m = G.size(); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { Inc(H[i + j], Mul(F[i], G[j])); } } return H; } GetRev(deg); NTT(F, 1); NTT(G, 1); for (int i = 0; i < len; ++i) { F[i] = Mul(F[i], G[i]); } NTT(F, -1); F.resize(deg); return F; } int n, deg[MAXN], node[MAXN], tot; vector<int> Poly_Prod(int l, int r) { if (l == r) { vector<int> F; F.push_back(1); F.push_back(node[l]); return F; } int mid = (l + r) >> 1; return Poly_Mul(Poly_Prod(l, mid), Poly_Prod(mid + 1, r)); } void solve() { read(n); NTT_init((n + 1) << 1); for (int i = 1, u, v; i < n; ++i) { read(u); read(v); ++deg[u]; ++deg[v]; } for (int i = 1; i <= n; ++i) { int x = deg[i] - (i > 1); if (x) node[++tot] = x; } vector<int> F = Poly_Prod(1, tot); int ans = 0; for (int i = 0; i < n && i < F.size(); ++i) { int tmp = Mul(F[i], fac[n - i]); (i & 1) ? Dec(ans, tmp) : Inc(ans, tmp); } printf( %d n , ans); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr long long MOD = (long long)1e9 + 7; long long fexp(long long a, long long n) { a %= MOD; if (n == 0) return 1; long long ret = fexp(a * a % MOD, n / 2); if (n % 2 == 1) ret = ret * a % MOD; return ret; } long long blub(long long pa, long long pb) { return pa * fexp((pa + pb) % MOD, MOD - 2) % MOD; } int main() { long long k, pa, pb; cin >> k >> pa >> pb; long long ppa = blub(pa, pb); long long ppb = blub(pb, pa); vector<vector<long long>> dp(k + 1, vector<long long>(k, 0)); long long res = 0; dp[1][0] = 1; for (int i = 1; i < k; ++i) { for (int j = 0; j < k; ++j) { dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * ppa) % MOD; if (j + i < k) dp[i][j + i] = (dp[i][j + i] + dp[i][j] * ppb) % MOD; else { res = (res + (j + i) * dp[i][j] % MOD * ppb) % MOD; } } } for (int i = 0; i < k; ++i) { res = (res + ppb * dp[k][i] % MOD * (ppa * fexp((1 - ppa) * (1 - ppa), MOD - 2) % MOD + (i + k) * fexp(1 - ppa, MOD - 2) % MOD)) % MOD; } cout << (res % MOD + MOD) % MOD << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> kmp(string &str) { int n = str.size(); vector<int> res(n + 1); res[0] = -1; int ind = -1; for (int i = 0; i < n; i++) { while (ind >= 0 && str[i] != str[ind]) ind = res[ind]; ind++; res[i + 1] = ind; } return res; } int nex(string &str, char ch, int i, vector<int> &kmp1) { if (str[i] == ch) return i + 1; int res = i; while (res >= 0 && str[res] != ch) res = kmp1[res]; return res + 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s, s1, s2; cin >> s >> s1 >> s2; int n = s.size(), n1 = s1.size(), n2 = s2.size(); vector<int> kmp1 = kmp(s1), kmp2 = kmp(s2); vector<vector<vector<int>>> dp( n + 1, vector<vector<int>>(n1 + 1, vector<int>(n2 + 1, -(1 << 29)))); dp[0][0][0] = 0; for (int i = 0; i < n; i++) { if (s[i] == * ) { for (char ch = a ; ch <= z ; ch++) { for (int j = 0; j < n1; j++) { for (int k = 0; k < n2; k++) { int nj = nex(s1, ch, j, kmp1), nk = nex(s2, ch, k, kmp2); dp[i + 1][nj][nk] = max(dp[i + 1][nj][nk], dp[i][j][k]); } } } } else { char ch = s[i]; for (int j = 0; j < n1; j++) { for (int k = 0; k < n2; k++) { int nj = nex(s1, ch, j, kmp1), nk = nex(s2, ch, k, kmp2); dp[i + 1][nj][nk] = max(dp[i + 1][nj][nk], dp[i][j][k]); } } } int nj = kmp1[n1], nk = kmp2[n2]; for (int j = 0; j < n1; j++) { dp[i + 1][j][nk] = max(dp[i + 1][j][nk], dp[i + 1][j][n2] - 1); } for (int k = 0; k < n2; k++) { dp[i + 1][nj][k] = max(dp[i + 1][nj][k], dp[i + 1][n1][k] + 1); } dp[i + 1][nj][nk] = max(dp[i + 1][nj][nk], dp[i + 1][n1][n2]); } int res = -(1 << 29); for (int j = 0; j < n1; j++) { for (int k = 0; k < n2; k++) { res = max(res, dp[n][j][k]); } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n, greater<int>()); for (int i = 0; i < n; i++) cout << a[i] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> int main() { int n, d, t, x, y, z, m; scanf( %d %d %d , &n, &d, &m); z = n - d; while (m--) { scanf( %d %d , &x, &y); if (x > n || y > n) { printf( NO n ); } else { if (y >= abs(x - d) && y <= n - (abs(z - x))) { printf( YES n ); } else { printf( NO n ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 10, mod = 1e9 + 7; int fact[N], invfact[N]; inline int add(int x, int y) { x += y; if (x >= mod) x -= mod; return x; } inline int sub(int x, int y) { x -= y; if (x < 0) x += mod; return x; } inline int mul(int x, int y) { return (((long long)x) * y) % mod; } inline int powr(int a, long long b) { int x = 1 % mod; while (b) { if (b & 1) x = mul(x, a); a = mul(a, a); b >>= 1; } return x; } inline int inv(int a) { return powr(a, mod - 2); } void pre() { fact[0] = invfact[0] = 1; for (int i = 1; i < N; i++) fact[i] = mul(i, fact[i - 1]); invfact[N - 1] = inv(fact[N - 1]); for (int i = N - 2; i >= 1; i--) invfact[i] = mul(invfact[i + 1], i + 1); assert(invfact[1] == 1); } inline int C(int n, int k) { if (n < k || k < 0) return 0; return mul(fact[n], mul(invfact[k], invfact[n - k])); } int n, k; int C2[N + 10], A[N], E[N]; inline int getC2(int i) { if (i > k) return 0; return C2[i]; } int F[N][N]; int main() { pre(); cin >> n >> k; F[0][0] = 1; for (int i = 1; i <= n; i++) { F[i][0] = 1; cin >> A[i]; for (int j = 1; j <= i; j++) { F[i][j] = add(F[i - 1][j], mul(A[i], F[i - 1][j - 1])); } } C2[0] = 1; for (int i = 1; i <= n + 10; i++) C2[i] = mul(C2[i - 1], mul(k - i + 1, inv(i))); int invn = inv(n); int _div = 1; for (int i = 0; i <= n - 1; i++) { E[i] = mul(getC2(i + 1), _div); _div = mul(_div, invn); E[i] = mul(E[i], fact[i]); } int ans = 0; for (int i = 0; i <= n - 1; i++) { ans = add( ans, mul(F[n][i], mul(n - i, mul(powr(mod - 1, n - 1 - i), E[n - 1 - i])))); } ans = mul(ans, invn); cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } const long long INF = 1e18; long long N; long long a[1050]; vector<string> ans, trueans; vector<vector<int>> Prev, Next; void f(int item) { int idx1 = 0; int idx2 = 1; Next.clear(); for (auto v : Prev) { if (v.size() <= 1) continue; idx1 = v[0]; idx2 = v[1]; } ans[idx1][item] = 1 ; ans[idx2][item] = 0 ; long long one = a[item] - 1; for (int i = 0; i <= N; i++) { if (i == idx2 or i == idx1) continue; if (one) { one--; ans[i][item] = 1 ; } else { ans[i][item] = 0 ; } } for (auto v : Prev) { vector<int> u[2]; for (auto tmp : v) { if (ans[tmp][item] == 0 ) u[0].push_back(tmp); else u[1].push_back(tmp); } for (int i = 0; i < 2; i++) { if (u[i].size()) Next.push_back(u[i]); } } swap(Prev, Next); } int main() { cin >> N; for (int i = 0; i < N; i++) cin >> a[i]; ans.resize(N + 1, string(N, 0 )); Prev.push_back({}); for (int i = 0; i <= N; i++) { Prev[0].push_back(i); } for (int i = 0; i < N; i++) f(i); for (auto v : Prev) { assert(v.size() == 1); } for (auto s : ans) { if (s != string(N, 0 )) trueans.push_back(s); } cout << trueans.size() << n ; for (auto s : trueans) { cout << s << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; map<long long int, long long int> mp; vector<long long int> v(n); vector<long long int> cSum(n, 0); for (long long int i = 0; i < n; i++) { cin >> v[i]; mp[v[i]]++; } cSum[0] = v[0]; for (long long int i = 1; i < n; i++) { cSum[i] = cSum[i - 1] + v[i]; } if (cSum[n - 1] % 2 != 0) { cout << NO ; } else { int flag2 = 0; set<long long int> st; for (long long int i = 0; i < n; i++) { mp[v[i]]--; long long int sum1 = cSum[i]; long long int sum2 = cSum[n - 1] - cSum[i]; long long int t = sum1 + sum2; long long int each = t / 2; if (each == sum1 && each == sum2) { flag2 = 1; break; } if (sum1 < sum2) { long long int diff = each - sum1; if (mp[diff] > 0) { flag2 = 1; break; } } if (sum1 > sum2) { long long int diff = each - sum2; if (st.find(diff) != st.end()) { flag2 = 1; break; } } st.insert(v[i]); } if (flag2 == 0) { cout << NO ; } else { cout << YES ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n; pair<string, long long> s[1000005]; long long m; bool cmp(pair<string, long long> a, pair<string, long long> b) { string s = a.first, t = b.first; for (long long i = 0; i < (m); i++) if (s[i] != t[i]) { if (i & 1) return s[i] > t[i]; else return s[i] < t[i]; } return a.second < b.second; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (long long i = 0; i < (n); i++) cin >> s[i].first, s[i].second = i + 1; sort(s, s + n, cmp); for (long long i = 0; i < (n); i++) cout << s[i].second << ; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) const long long int maxn = 5e5 + 16, md = 1e9 + 7, inf = 2e18; long long int tav(long long int n, long long int k) { long long int res = 1; while (k > 0) { if (k & 1) { res *= n; res %= md; } n *= n; n %= md; k >>= 1; } return res; } struct segtree { long long int sz = 1; vector<long long int> val, laz; void init(long long int n) { while (sz < n) sz <<= 1; val.assign((sz << 1), 0); laz.assign((sz << 1), 0); return; } void shift(long long int x, long long int lx, long long int rx) { long long int h = laz[x]; laz[x] = 0; if (h == 0) return; val[x] += h; if (rx - lx == 1) return; long long int ln = (x << 1) + 1, rn = ln + 1; laz[ln] += h; laz[rn] += h; return; } void add(long long int l, long long int r, long long int k, long long int x, long long int lx, long long int rx) { shift(x, lx, rx); if (rx <= l || lx >= r) return; if (rx <= r && lx >= l) { laz[x] = k; shift(x, lx, rx); return; } long long int m = (rx + lx) >> 1, ln = (x << 1) + 1, rn = ln + 1; add(l, r, k, ln, lx, m); add(l, r, k, rn, m, rx); val[x] = min(val[ln], val[rn]); return; } void add(long long int l, long long int r, long long int k) { add(l, r, k, 0, 0, sz); return; } long long int cal(long long int l, long long int r, long long int x, long long int lx, long long int rx) { shift(x, lx, rx); if (rx <= l || lx >= r) return inf; if (rx <= r && lx >= l) return val[x]; long long int m = (rx + lx) >> 1, ln = (x << 1) + 1, rn = ln + 1; long long int a = cal(l, r, ln, lx, m), b = cal(l, r, rn, m, rx); return min(a, b); } long long int cal(long long int l, long long int r) { return cal(l, r, 0, 0, sz); } }; long long int n, q; segtree st; vector<pair<long long int, long long int> > adj[maxn]; vector<pair<pair<long long int, long long int>, long long int> > v[maxn]; long long int ft[maxn], tme = 0, ans[maxn], dis[maxn], dep = 0; void dDFS(long long int r) { dis[r] = dep; tme++; for (auto p : adj[r]) { long long int i = p.first, w = p.second; dep += w; dDFS(i); dep -= w; } if (adj[r].empty()) { st.add(r, r + 1, dep); } else { st.add(r, r + 1, inf); } ft[r] = tme; return; } void sDFS(long long int r) { for (auto y : v[r]) { long long int l = y.first.first, r = y.first.second, i = y.second; ans[i] = st.cal(l, r); } for (auto p : adj[r]) { long long int i = p.first, w = p.second; st.add(0, n, w); st.add(i, ft[i], -2ll * w); sDFS(i); st.add(0, n, -w); st.add(i, ft[i], 2ll * w); } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; for (long long int u = 1; u < n; u++) { long long int v, w; cin >> v >> w; v--; adj[v].push_back({u, w}); } st.init(n); for (long long int i = 0; i < q; i++) { long long int u, l, r; cin >> u >> l >> r; u--; l--; v[u].push_back({{l, r}, i}); } dDFS(0); sDFS(0); for (long long int i = 0; i < q; i++) { cout << ans[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } char s[1000009], t[1000009]; int cnt[2]; int pw[1000009], par[1000009]; int wp[1000009], rap[1000009]; int mod(long long x) { x %= 1000000007; if (x < 0) x += 1000000007; return x; } pair<int, int> get(int l, int r) { return make_pair(mod(par[r] - (par[l - 1] * 1LL * pw[r - l + 1])), mod(rap[r] - (rap[l - 1] * 1LL * wp[r - l + 1]))); } int main() { scanf( %s , s); int n = strlen(s); scanf( %s , t + 1); int m = strlen(t + 1); pw[0] = wp[0] = 1; for (int i = 1; i < 1000009; i++) { pw[i] = mod(pw[i - 1] * 27LL); wp[i] = mod(wp[i - 1] * 31LL); } for (int i = 1; i <= m; i++) { par[i] = mod(par[i - 1] * 27LL + (t[i] - a + 1)); rap[i] = mod(rap[i - 1] * 31LL + (t[i] - a + 1)); } for (int i = 0; i < n; i++) cnt[s[i] - 0 ]++; int ans = 0; for (int i = 1; i * cnt[0] < m and i < m; i++) if ((m - i * cnt[0]) % cnt[1] == 0) { int d = (m - i * cnt[0]) / cnt[1]; pair<int, int> a, b; a.first = b.first = -1; int cur = 1, f = 1; for (int j = 0; j < n; j++) { if (s[j] == 0 ) { if (a.first == -1) a = get(cur, cur + i - 1); else f &= (a == get(cur, cur + i - 1)); cur += i; } else { if (b.first == -1) b = get(cur, cur + d - 1); else f &= (b == get(cur, cur + d - 1)); cur += d; } } if (f and d == i and a == b) f = 0; ans += f; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> long long t, a, b, h, f[110]; using namespace std; long long mi(long long n, long long m) { long long res = 1; for (int i = 1; i <= m; i++) res *= n; return res; } void solve(long long a, long long b) { for (int i = h; i; i--) { long long t = mi(a, i); f[i] = b / t; b %= t; } f[0] = b; } int main() { scanf( %lld%lld%lld , &t, &a, &b); if (a == b && b == t) { if (a == 1) puts( inf ); else puts( 2 ); } else if (a == b) puts( 1 ); else { if (t == 1) { h = log(b) / log(a); for (int i = 1; i <= h; i++) if (mi(a, i) == b) { puts( 1 ); return 0; } } h = log(b) / log(a); solve(a, b); long long sum = 0; for (int i = 0; i <= h; i++) sum += f[i] * mi(t, i); if (sum != a) puts( 0 ); else puts( 1 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; vector<pair<long long, long long>> arr(n); for (long long i = 0; i < n; i++) { long long a; cin >> a; if (a >= 0) a = (-1) * a - 1; arr[i] = {a, i}; } sort(arr.begin(), arr.end()); if (n % 2 == 1) { long long f = 0; for (long long i = 0; i < n; i++) { if (arr[i].first != -1) { arr[i].first = (-1) * arr[i].first - 1; f++; break; } } if (f == 0) { arr[0].first = 0; } } vector<long long> ans(n); for (long long i = 0; i < n; i++) { ans[arr[i].second] = arr[i].first; } for (auto i : ans) cout << i << ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n]; for (int i = 0; i < n; i++) { int x; cin >> x; a[i] = x; } sort(a, a + n); int count = 0; for (int i = (n - 1); i >= 0; i--) { if (m > 0) { m = m - a[i]; count++; } } cout << count << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; if (a > b) { if (a == 9 && b == 1) cout << 9 << << 10; else cout << -1; return 0; } if ((b - a) > 1) { cout << -1; return 0; } if (b == a) { cout << a << 98 << << b << 99; return 0; } cout << a << << b; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(3) #pragma GCC optimize( inline ) using namespace std; const int N = 100050, INF = 0x3f3f3f3f; int n, col, sum, n1, n2; struct node { int color, val, id; friend bool operator<(node x, node y) { return x.val < y.val; } } white[N], black[N]; int min(int x, int y) { return (x > y) ? y : x; } signed main() { scanf( %d , &n); for (register int i = 1; i <= n; i++) { scanf( %d%d , &col, &sum); if (col) white[++n1] = node{col, sum, i}; else black[++n2] = node{col, sum, i}; } sort(white + 1, white + 1 + n1); sort(black + 1, black + 1 + n2); for (register int i = 1, j = 1; i <= n1 && j <= n2;) { int now = min(white[i].val, black[j].val); cout << white[i].id << << black[j].id << << now << endl; white[i].val -= now; black[j].val -= now; if (white[i].val) j++; else if (black[j].val) i++; else if (i < n1) i++; else j++; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 5e3 + 5; long long read() { long long 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(long long x) { if (x < 0) { putchar( - ); x = -x; } if (x < 10) putchar(x + 0 ); else { write(x / 10); putchar(x % 10 + 0 ); } } void print(long long x, char c = n ) { write(x); putchar(c); } long long dp[N][N], a[N], q[N]; signed main(signed Recall, char *_902_[]) { (void)Recall, (void)_902_; long long n = read(), k = read(), m = read(), ans = -1; for (long long i = 1; i <= n; i++) a[i] = read(); for (long long i = 1; i <= n; i++) dp[i][0] = dp[0][i] = -1; for (long long j = 1; j <= m; j++) for (long long i = 1, h = 0, t = q[0] = 0; i <= n; i++) { while (h <= t && i - q[h] > k) h++; if (h <= t && dp[q[h]][j - 1] >= 0) dp[i][j] = dp[q[h]][j - 1] + a[i]; else dp[i][j] = -1; while (h <= t && dp[q[t]][j - 1] <= dp[i][j - 1]) t--; q[++t] = i; } for (long long i = max(n - k + 1, 1LL); i <= n; i++) ans = max(ans, dp[i][m]); print(ans); return 0; } |
/****************************************** By Lord Sanskar Bhargava******************************/ #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef complex<ld> cd; typedef pair<int, int> pi; typedef pair<ll,ll> pl; typedef pair<ld,ld> pd; typedef vector<int> vi; typedef vector<ld> vd; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<cd> vcd; int main() { ios::sync_with_stdio(0);cin.tie(0); int tt; cin>>tt; while(tt--) { ll n;cin>>n; ll k=n%2020; if(n<2020) { cout<< NO <<endl; } else if(k*2021<=n) { cout<< YES <<endl; } else { cout<< NO <<endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[1003][1003][12][3]; string s, t; int solve(int i, int j, int k, int cont) { if (i < 0 || j < 0) return 0; if (dp[i][j][k][cont] != -1) return dp[i][j][k][cont]; int ret = -9; if (s[i] == t[j]) { if (cont) { ret = max(ret, 1 + solve(i - 1, j - 1, k, 1)); } if (k > 0) ret = max(ret, 1 + solve(i - 1, j - 1, k - 1, 1)); } ret = max(ret, solve(i - 1, j, k, 0)); ret = max(ret, solve(i, j - 1, k, 0)); dp[i][j][k][cont] = ret; return ret; } int main() { int n, m, k; cin >> n >> m >> k; cin >> s >> t; for (int i = 0; i < 1003; ++i) { for (int j = 0; j < 1003; ++j) { for (int k = 0; k < 12; ++k) { for (int l = 0; l < 3; ++l) { dp[i][j][k][l] = -1; } } } } int ans = solve(n - 1, m - 1, k, 0); cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 510; int m; long long n, ans; int cnt, head[N]; struct edge { int to, next; } e[1010]; void ade(int u, int v) { e[++cnt] = (edge){v, head[u]}; head[u] = cnt; } long long getsize(long long num) { if (num > n) return 0; long long tl = num, tr = num; int m1 = 0, m2 = 0; while (tl * 2 <= n) tl = tl * 2, m1++; while (tr * 2 + 1 <= n) tr = tr * 2 + 1, m2++; if (tl <= tr) return (1 << (m2 + 1)) - 1; else return (1 << (m2 + 1)) - 1 + n - tl + 1; } map<int, int> vis; int tot; long long val[N]; void build(int x) { val[vis[x]] = 1; int to = x << 1; if (to <= n && vis[to]) { build(to); ade(vis[x], vis[to]); ade(vis[to], vis[x]); } else val[vis[x]] += getsize(to); to = x << 1 | 1; if (to <= n && vis[to]) { build(to); ade(vis[x], vis[to]); ade(vis[to], vis[x]); } else val[vis[x]] += getsize(to); } int bk[N]; void dfs(int now, long long w) { bk[now] = 1; for (int i = head[now]; i; i = e[i].next) { int to = e[i].to; if (bk[to]) continue; dfs(to, w); ans = (ans + w * val[to] % mod) % mod; } bk[now] = 0; } int main() { cin >> n >> m; if (!m) { ans = n * n % mod; ans = (ans % mod + mod) % mod; printf( %lld n , ans); } else { for (int i = 1; i <= m; i++) { int a, b; cin >> a >> b; if (!vis[a]) vis[a] = ++tot; if (!vis[b]) vis[b] = ++tot; ade(vis[a], vis[b]); ade(vis[b], vis[a]); while (a) { a >>= 1; if (!vis[a]) vis[a] = ++tot; } while (b) { b >>= 1; if (!vis[b]) vis[b] = ++tot; } } build(1); for (int i = 1; i <= tot; i++) dfs(i, val[i]); for (int i = 1; i <= tot; i++) ans = (ans + val[i] * val[i] % mod) % mod; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 105, MAX_R = 60005; int n, r, a, b; vector<pair<int, int> > inc, d; int dp[MAX_R][MAX_N]; int main() { ios::sync_with_stdio(false); cin >> n >> r; for (int i = 0; i < n; i++) { cin >> a >> b; if (b >= 0) { inc.push_back({a, b}); } else { d.push_back({max(a, -b) + b, b}); } } sort(inc.begin(), inc.end()); sort(d.begin(), d.end()); int proj = 0; for (auto p : inc) { if (r >= p.first) { proj++; r += p.second; } } int len = d.size(); for (int i = 0; i <= len; i++) { if (i == 0) { for (int j = 0; j <= r; j++) { dp[j][i] = proj; } continue; } int a = d[i - 1].first - d[i - 1].second; int b = d[i - 1].second; for (int j = 0; j <= r; j++) { if (j >= a) { dp[j][i] = max(dp[j][i - 1], 1 + dp[j + b][i - 1]); } else { dp[j][i] = dp[j][i - 1]; } } } cout << dp[r][len] << endl; } |
#include <bits/stdc++.h> using namespace std; long long n, b, x, q, t, ans, l, r, m, p, now, sum; bool ok; string s; map<int, int> a, pos; map<char, int> c; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> q; while (q--) { cin >> n >> m; cin >> s; for (int i = 1; i <= m; ++i) { cin >> x; a[x + 1]++; } sum = m + 1; for (int i = 0; i < s.size(); ++i) { sum -= a[i + 1]; c[s[i]] += sum; } for (char j = a ; j <= z ; ++j) { cout << c[j] << ; } cout << n ; a.clear(); c.clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], b[n]; for (int i = 0; i < n; i++) cin >> a[i]; b[n - 1] = a[n - 1]; for (int j = 0; j < n - 1; j++) b[j] = a[j] + a[j + 1]; for (int k = 0; k < n; k++) cout << b[k] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read(T& x) { x = 0; int f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) f |= (ch == - ), ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x = f ? -x : x; } const int N = 500 + 10; const long long INF = 2e18; int i, j, x, n, match[N], pre[N]; long long a[N], b[N], k[N], cost[N][N], lx[N], ly[N], slack[N]; bool vy[N]; void augment(int root) { fill(vy + 1, vy + n + 1, false); fill(slack + 1, slack + n + 1, INF); int py; match[py = 0] = root; do { vy[py] = true; int x = match[py], yy; long long delta = INF; for (int y = 1; y <= n; y++) { if (!vy[y]) { if (lx[x] + ly[y] - cost[x][y] < slack[y]) { slack[y] = lx[x] + ly[y] - cost[x][y]; pre[y] = py; } if (slack[y] < delta) { delta = slack[y]; yy = y; } } } for (int y = 0; y <= n; y++) { if (vy[y]) { lx[match[y]] -= delta; ly[y] += delta; } else { slack[y] -= delta; } } py = yy; } while (~match[py]); do { int cnt = pre[py]; match[py] = match[cnt]; py = cnt; } while (py); } long long KM() { for (int i = 1; i <= n; i++) { lx[i] = ly[i] = 0; match[i] = -1; for (int j = 1; j <= n; j++) lx[i] = max(lx[i], cost[i][j]); } long long ans = 0; for (int i = 1; i <= n; i++) augment(i); for (int i = 1; i <= n; i++) { ans += lx[i]; ans += ly[i]; } return ans; } int main() { read(n); for (i = 1; i <= n; i++) { read(a[i]), read(b[i]), read(k[i]); for (j = 1; j <= n; j++) { cost[i][j] = max(a[i] - b[i] * min(k[i], j - 1LL), 0LL); } } printf( %lld n , KM()); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9 + 10; const int N = (int)1e6 + 10; const long double eps = 1e-7; mt19937 rnd(228); int main() { int n, q; cin >> n >> q; deque<int> d; int mn = INF; int mx = -INF; for (int i = 0; i < n; ++i) { int x; cin >> x; d.push_back(x); mn = min(mn, x); mx = max(mx, x); } vector<pair<int, int>> ans(N); for (int iter = 1; iter < N; ++iter) { int a = d.front(); d.pop_front(); int b = d.front(); ans[iter] = make_pair(a, b); d.pop_front(); d.push_front(max(a, b)); d.push_back(min(a, b)); } int st = -1; for (int i = N / 2 - 1; i >= 1; --i) { if (ans[i] == pair<int, int>({mx, mn})) { st = i; break; } } for (int i = 1; i <= q; ++i) { long long m; cin >> m; if (m < N) { cout << ans[m].first << << ans[m].second << n ; continue; } m -= st; m %= (n - 1); cout << ans[st + m].first << << ans[st + m].second << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, k; pair<int, int> a[N]; vector<pair<int, int> > Center; bool inf; bool Check(pair<int, int> center) { int cnt = 0, l = 1, r = n; pair<int, int> t; while (l <= r && cnt <= k) { t = make_pair(center.first - a[l].first, center.second - a[l].second); if (t == a[r]) { l++; r--; } else { cnt++; if (t < a[r]) r--; else l++; } } return (cnt <= k); } void Solve() { if (k >= n) { inf = true; return; } sort(a + 1, a + n + 1); pair<int, int> center; int res = 0; for (int i = 1; i <= k + 1; i++) for (int j = n - k; j <= n; j++) if (i <= j) { center = make_pair(a[i].first + a[j].first, a[i].second + a[j].second); if (Check(center)) Center.push_back(center); } } int main() { cin >> n >> k; for (int i = 1; i <= n; i++) scanf( %d %d , &a[i].first, &a[i].second); Solve(); if (inf) { cout << -1 << endl; return 0; } int res = 0; sort(Center.begin(), Center.end()); for (int i = 0; i < Center.size(); i++) if (i == 0 || Center[i] != Center[i - 1]) res++; cout << res << endl; int cnt = 0; for (int i = 0; i < Center.size(); i++) if (i == 0 || Center[i] != Center[i - 1]) { printf( %.3lf %.3lf n , (Center[i].first + 0.0) / 2.0, (Center[i].second + 0.0) / 2.0); } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) int on_bit(int N, int pos) { return N = N | (1 << pos); } int off_bit(int N, int pos) { return N = N & ~(1 << pos); } bool check_bit(long long int N, int pos) { return (bool)(N & (1 << pos)); } template <class T> inline bool read(T &x) { int c = getchar(); int sgn = 1; while (~c && c < 0 || c > 9 ) { if (c == - ) sgn = -1; c = getchar(); } for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; x *= sgn; return ~c; } int main() { unsigned long long ar[500005]; memset((ar), 0, sizeof((ar))); for (unsigned long long i = 3, j = 1; i <= 500001; i += 2, j++) { ar[i] = ((i * 4) - 4) * j; } for (int i = 5; i <= 500001; i += 2) { ar[i] += ar[i - 2]; } int ___T; cin >> ___T; for (int cs = 1; cs <= ___T; cs++) { int n; cin >> n; cout << ar[n] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long nt[105]; string s; vector<long long> V; void ts() { nt[0] = 0; nt[1] = 0; for (long long i = 2; i <= 100; i++) { nt[i] = 1; } for (long long i = 2; i <= 100; i++) { if (nt[i] == 1) { for (long long j = i * i; j <= 100; j += i) { nt[j] = 0; } V.push_back(i); } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); V.push_back(4); V.push_back(9); V.push_back(25); V.push_back(49); ts(); long long i = 0; long long dem = 0; while (i < 20) { cout << V[i] << endl; cin >> s; if (s == yes ) dem++; if (dem == 2) { cout << composite ; return 0; } i++; } cout << prime ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void maxE(T& a, const T& b) { a = max(a, b); } template <typename T> void minE(T& a, const T& b) { a = min(a, b); } template <typename T> ostream& operator<<(ostream& out, const vector<T>& t_) { out << [ ; for (auto i : t_) out << i << , ; out << ] ; return out; } template <typename S, typename T> ostream& operator<<(ostream& out, const pair<S, T>& rhs) { out << ( << rhs.first << , << rhs.second << ) ; return out; } const long long INF = 1000LL * 1000 * 1000 * 1000 * 1000 * 1000LL; struct Val { long long maxPref, maxSuf, sum, maxInf; }; Val neutral() { Val r; r.maxPref = r.maxSuf = r.maxInf = 0; r.sum = 0; return r; } Val single(long long a) { Val r; r.maxPref = r.maxSuf = r.maxInf = max(0LL, a); r.sum = a; return r; } Val join(const Val& a, const Val& b) { Val r; r.maxPref = max(a.maxPref, a.sum + b.maxPref); r.maxSuf = max(a.maxSuf + b.sum, b.maxSuf); r.sum = a.sum + b.sum; r.maxInf = max(max(a.maxInf, b.maxInf), a.maxSuf + b.maxPref); return r; } struct Tree { int s; vector<Val> t; void init(int s_) { s = 1; while (s <= s_) s *= 2; t.assign(2 * s, neutral()); } Val tget(int a, int b) { if (a > b) return neutral(); else if (a == b) return t[a]; Val r = neutral(); int na = a; int nb = b; if (a % 2) na++; if (nb % 2 == 0) nb--; if (a % 2) r = join(r, t[a]); r = join(r, tget(na / 2, nb / 2)); if (b % 2 == 0) r = join(r, t[b]); return r; } long long get(int a, int b) { return tget(s + a, s + b).maxInf; } }; int n; vector<long long> t; Tree tree; int main() { int m; assert(scanf( %d%d , &n, &m) == 2); vector<int> d, h; for (int i = 0; i < int(n); ++i) { int a; assert(scanf( %d , &a) == 1); d.push_back(a); } for (int i = 0; i < int(n); ++i) { int a; assert(scanf( %d , &a) == 1); h.push_back(a); } for (int j = 0; j < int(2); ++j) for (int i = 0; i < int(n); ++i) { t.push_back(h[i] * 2LL); t.push_back(-4LL * h[i]); t.push_back(h[i] * 2LL); t.push_back(d[i]); } tree.init(((int)((t).size()))); for (int i = 0; i < int(((int)((t).size()))); ++i) tree.t[tree.s + i] = single(t[i]); for (int i = tree.s - 1; i >= 1; i--) tree.t[i] = join(tree.t[i * 2], tree.t[i * 2 + 1]); if (0) cout << tree ready << endl; if (0) cout << SIZE(t) << << ((int)((t).size())) << << endl; for (int i = 0; i < int(m); ++i) { int a, b; assert(scanf( %d%d , &a, &b) == 2); a--; b--; int x, y; if (a <= b) { x = b + 1; y = a + n - 1; } else { x = b + 1; y = a - 1; } assert(x < y); if (0) cout << a << << a << << b << << b << << x << << x << << y << << y << << endl; x = 4 * x; y = 4 * y; int s = ((int)((t).size())); assert(x >= 0 && x < s && y >= 0 && y < s); cout << tree.get(x, y) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string get(int n, int m) { string str; for (int i = 1; i <= n; i++) str.push_back( 4 ); for (int i = 1; i <= m; i++) str.push_back( 7 ); return str; } int32_t main() { ios_base ::sync_with_stdio(0); cin.tie(0); string str; cin >> str; int n = str.size(); if (n & 1) { cout << get((n + 1) / 2, (n + 1) / 2) << endl; return 0; } int cnta = 0, cntb = 0, ans = -1, aa = 0, bb = 0; for (int i = 0; i < n; i++) { if (cnta + 1 <= n / 2 && str[i] < 7 ) { ans = i; aa = cnta; bb = cntb; } if (cntb + 1 <= n / 2 && str[i] < 4 ) { ans = i; aa = cnta; bb = cntb; } cnta += str[i] == 7 ; cntb += str[i] == 4 ; if ((str[i] != 4 && str[i] != 7 ) || cnta > n / 2 || cntb > n / 2) break; } if (cnta + cntb == n && cnta == cntb) { cout << str << endl; return 0; } if (ans == -1) { cout << get((n + 2) / 2, (n + 2) / 2) << endl; return 0; } string x; for (int i = 0; i < ans; i++) { x.push_back(str[i]); } if (bb + 1 <= n / 2 && str[ans] < 4 ) { ++bb; x.push_back( 4 ); } else { ++aa; x.push_back( 7 ); } x += get(n / 2 - bb, n / 2 - aa); cout << x << endl; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.