func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long n, cnt[21][21], pos[21][400001], dp[1 << 20]; vector<long long> v[21]; signed main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin >> n; for (long long i = 1; i <= n; i++) { long long a; cin >> a; a--; v[a].push_back(i); pos[a][i]++; } for (long long i = 0; i < 20; i++) { for (long long j = 1; j <= n; j++) { pos[i][j] += pos[i][j - 1]; } } for (long long i = 0; i < 20; i++) { for (long long j = 0; j < 20; j++) { if (i == j) continue; for (auto x : v[i]) { cnt[i][j] += pos[j][x]; } } } dp[0] = 0; for (long long i = 1; i < (1 << 20); i++) { dp[i] = 1000000000000000000; for (long long j = 0; j < 20; j++) { if (i >> j & 1) { long long ans1 = 0; for (long long k = 0; k < 20; k++) { if (k == j) continue; if (i >> k & 1) ans1 += cnt[j][k]; } dp[i] = min(dp[i], dp[i ^ (1 << j)] + ans1); } } } cout << dp[(1 << 20) - 1]; }
|
#include <bits/stdc++.h> using namespace std; void _fill_int(int* p, int val, int rep) { int i; for (i = 0; i < rep; i++) p[i] = val; } int N, M, K; signed long long mo = 1000000007; int L, R; string LL, RR; vector<string> S; int V[201]; vector<vector<int> > TR; vector<int> AC; signed long long dpdp[2][201][501][2][2]; int find(string s) { int cur = 0; for (__typeof(s.begin()) it = s.begin(); it != s.end(); it++) if ((cur = TR[cur][*it]) == 0) return -1; return cur; } void create(vector<string> S) { int i; TR.push_back(vector<int>(256)); for (__typeof(S.begin()) it = S.begin(); it != S.end(); it++) { int cur = 0; for (__typeof((*it).begin()) c = (*it).begin(); c != (*it).end(); c++) { if (TR[cur][*c] == 0) TR.push_back(vector<int>(256)), TR[cur][*c] = TR.size() - 1; cur = TR[cur][*c]; } AC.resize(TR.size()); AC[cur] += V[it - S.begin()]; } queue<int> Q; for (i = 0; i < 255; i++) if (TR[0][i]) TR[TR[0][i]][255] = 0, Q.push(TR[0][i]); while (!Q.empty()) { int k = Q.front(); Q.pop(); for (i = 0; i < 255; i++) if (TR[k][i]) { Q.push(TR[k][i]); int pre = TR[k][255]; while (pre != 0 && TR[pre][i] == 0) pre = TR[pre][255]; TR[TR[k][i]][255] = TR[pre][i]; AC[TR[k][i]] += AC[TR[pre][i]]; } } } signed long long dodo(string SS) { signed long long ret = 0, rr; int i, j, k, x, y, pos, val, b1, b2; memset(dpdp, 0, sizeof(dpdp)); dpdp[0][0][0][1][1] = 1; for (i = 0; i < SS.size(); i++) { int cur = i % 2, tar = cur ^ 1; memset(dpdp[tar], 0, sizeof(dpdp[tar])); for (b1 = 0; b1 < 2; b1++) for (b2 = 0; b2 < 2; b2++) for (val = 0; val < K + 1; val++) for (pos = 0; pos < TR.size(); pos++) if ((rr = dpdp[cur][pos][val][b1][b2])) { for (j = 0; j < M; j++) { if (b1 && j > SS[i]) break; y = (b1 && j == SS[i]); if (b2 && (j == 0)) { dpdp[tar][pos][val][y][1] += rr; dpdp[tar][pos][val][y][1] %= mo; continue; } x = pos; while (x && TR[x][j] == 0) x = TR[x][255]; x = TR[x][j]; if (val + AC[x] <= K) { dpdp[tar][x][val + AC[x]][y][0] += rr; dpdp[tar][x][val + AC[x]][y][0] %= mo; } } } } x = SS.size() % 2; for (i = 0; i < 201; i++) for (j = 0; j < K + 1; j++) ret += dpdp[x][i][j][0][0] + dpdp[x][i][j][0][1] + dpdp[x][i][j][1][0] + dpdp[x][i][j][1][1]; return ret % mo; } void solve() { int f, i, j, k, l, x, y; cin >> N >> M >> K; cin >> L; for (i = 0; i < L; i++) cin >> x, LL += x; cin >> R; for (i = 0; i < R; i++) cin >> x, RR += x; for (i = 0; i < N; i++) { cin >> j; string s; while (j--) cin >> x, s += x; S.push_back(s); cin >> V[i]; } create(S); i = LL.size() - 1; LL[i] -= 1; while (LL[i] < 0) LL[i] += M, LL[--i] -= 1; while (LL.size() > 0 && LL[0] == 0) LL.erase(LL.begin()); cout << (dodo(RR) - dodo(LL) + mo) % mo << endl; } int main(int argc, char** argv) { string s; if (argc == 1) ios::sync_with_stdio(false); for (int i = 1; i < argc; i++) s += argv[i], s += n ; for (int i = s.size() - 1; i >= 0; i--) ungetc(s[i], stdin); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a, ans = 0; cin >> n; vector<int> v; int dat[101] = {}; for (int i = 0; i < n; ++i) { cin >> a; if (a == 1) break; v.push_back(a); } if (a != 1) { sort(v.begin(), v.end()); for (int i = 0; i < v.size(); ++i) { if (dat[v[i]] == 0) { for (int j = v[i]; j < 101; j += v[i]) { dat[j] = 1; } ++ans; } } } else ans = 1; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long p = 998244353; long long po(long long a, long long b) { if (b == 0) return 1; if (b == 1) return a; if (b % 2 == 0) { long long u = po(a, b / 2); return (u * u) % p; } else { long long u = po(a, b - 1); return (a * u) % p; } } long long inv(long long x) { return po(x, p - 2); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; ++i) cin >> a[i]; sort(a, a + n); reverse(a, a + n); long long pr[n + 1]; pr[0] = 0; for (long long i = 0; i < n; ++i) pr[i + 1] = pr[i] + a[i]; for (long long k = 1; k <= n; ++k) { long long ans = 0; for (long long l = k; l <= n; l += k) { ans += (pr[l] - pr[((l - 1) / k) * k]) * ((l - 1) / k); ans %= p; if (l > (n - k) && l < n) l = (n - k); } ans *= inv(n); ans %= p; ans += p; ans %= p; cout << ans << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool solve(vector<int> ps, vector<int> v) { if (ps.empty()) return v[0] == 0; int n = v.size(); vector<int> nps(ps.begin() + 1, ps.end()); vector<vector<int> > g(ps[0], vector<int>(n / ps[0])); bool ans = true; for (int i = 0; i < n; ++i) { g[i % ps[0]][i % (n / ps[0])] = v[i]; } for (int i = 1; i < ps[0]; ++i) { for (int j = 0; j < n / ps[0]; ++j) { g[i][j] -= g[0][j]; } if (!solve(nps, g[i])) ans = false; } return ans; } int main() { int N; string S; cin >> N >> S; vector<int> ps; int rad = 1, x = N; for (int i = 2; i * i <= x; ++i) { if (x % i == 0) { rad *= i; ps.push_back(i); while (x % i == 0) x /= i; } } if (x > 1) rad *= x, ps.push_back(x); bool ans = true; for (int i = 0; i < N / rad; ++i) { vector<int> v; for (int j = i; j < N; j += N / rad) { v.push_back(S[j] - 0 ); } bool res = solve(ps, v); if (!res) ans = false; } cout << (ans ? YES : NO ) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int N = 77; int n; char s[N]; vector<int> v, k, x; int dp[N][N][N][2]; int count(vector<int> &list, int from, int w) { int cnt = 0; for (int i = from; i < list.size(); i++) { if (list[i] < w) cnt++; } return cnt; } int cost(int vv, int kk, int xx, int w) { return count(v, vv, w) + count(k, kk, w) + count(x, xx, w); } int main() { scanf( %d , &n); scanf( %s , s); for (int i = 0; i < n; i++) { if (s[i] == V ) v.push_back(i); else if (s[i] == K ) k.push_back(i); else x.push_back(i); } for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) for (int l = 0; l < 2; l++) dp[i][j][k][l] = 1e9; dp[0][0][0][0] = 0; for (int i = 0; i <= v.size(); i++) { for (int j = 0; j <= k.size(); j++) { for (int p = 0; p <= x.size(); p++) { for (int c = 0; c < 2; c++) { if (i < v.size()) dp[i + 1][j][p][1] = min(dp[i + 1][j][p][1], cost(i, j, p, v[i]) + dp[i][j][p][c]); if (c == 0 && j < k.size()) dp[i][j + 1][p][0] = min(dp[i][j + 1][p][0], cost(i, j, p, k[j]) + dp[i][j][p][c]); if (p < x.size()) dp[i][j][p + 1][0] = min(dp[i][j][p + 1][0], cost(i, j, p, x[p]) + dp[i][j][p][c]); } } } } printf( %d n , min(dp[v.size()][k.size()][x.size()][0], dp[v.size()][k.size()][x.size()][1])); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i, flag = 0; int a[5005]; cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; } for (i = 1; i <= n; i++) { if (a[a[a[i]]] == i) { cout << YES ; return 0; } } cout << NO ; }
|
#include <bits/stdc++.h> const double PI = 3.1415926535897932384626433; const int KL = 1e4 + 10; const long long MOD = 1e9 + 7; using namespace std; int n; struct point { long double x, y, z; }; long double dis(point a, point b) { long double dx = a.x - b.x; long double dy = a.y - b.y; long double dz = a.z - b.z; return sqrt(dx * dx + dy * dy + dz * dz); } point a[KL], p; long double t[KL], vp, vs; bool ok(long double mid) { long double ttt = 0.0; int pos; for (int i = 1; i <= n; i++) { ttt += t[i]; if (ttt >= mid) { pos = i; break; } } long double dx = a[pos].x - a[pos - 1].x; long double dy = a[pos].y - a[pos - 1].y; long double dz = a[pos].z - a[pos - 1].z; long double d = dis(a[pos], a[pos - 1]); long double dc = (mid - (ttt - t[pos])) * vs; long double sm = dc / d; dx = dx * sm; dy = dy * sm; dz = dz * sm; point c = {dx + a[pos - 1].x, dy + a[pos - 1].y, dz + a[pos - 1].z}; long double ds = dis(c, p); return (ds / mid <= vp); } void prnt(long double nm) { cout << fixed << setprecision(10) << nm << ; } int main() { cin >> n; for (int i = 0; i <= n; i++) { cin >> a[i].x >> a[i].y >> a[i].z; } cin >> vp >> vs >> p.x >> p.y >> p.z; long double tt = 0.0; for (int i = 1; i <= n; i++) { t[i] = dis(a[i - 1], a[i]) / vs; tt += t[i]; } if (!ok(tt)) cout << NO << endl; else { long double lo = 0; long double hi = tt; for (int i = 0; i < 100; i++) { long double mid = (lo + hi) / 2; if (ok(mid)) hi = mid; else lo = mid; } cout << YES << endl; cout << fixed << setprecision(10) << lo << endl; if (lo == 0) { prnt(a[0].x); prnt(a[0].y); prnt(a[0].z); cout << endl; return 0; } long double ttt = 0.0; int pos; for (int i = 0; i <= n; i++) { ttt += t[i]; if (ttt >= lo) { pos = i; break; } } long double dx = a[pos].x - a[pos - 1].x; long double dy = a[pos].y - a[pos - 1].y; long double dz = a[pos].z - a[pos - 1].z; long double d = dis(a[pos], a[pos - 1]); long double dc = (lo - (ttt - t[pos])) * vs; long double sm = dc / d; dx = dx * sm; dy = dy * sm; dz = dz * sm; point c = {dx + a[pos - 1].x, dy + a[pos - 1].y, dz + a[pos - 1].z}; prnt(c.x); prnt(c.y); prnt(c.z); cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Node { vector<Node*> next; Node() : next(26, nullptr) {} }; Node* root = new Node; void insert(string& s, int i, Node* c) { if (i >= s.length()) return; if (c->next[s[i] - a ] == nullptr) { c->next[s[i] - a ] = new Node; } insert(s, i + 1, c->next[s[i] - a ]); } bool traverseWin(Node* c) { bool curWin = false; for (auto n : c->next) if (n != nullptr) { if (!traverseWin(n)) curWin = true; } return curWin; } bool traverseLose(Node* c) { bool curLose = false; int i = 0; for (auto n : c->next) if (n != nullptr) { ++i; if (!traverseLose(n)) curLose = true; } return curLose || (i == 0); } int main(int, char**) { std::ios::sync_with_stdio(false); int n, k; cin >> n >> k; for (int i = 0; i < n; ++i) { string s; cin >> s; insert(s, 0, root); } bool w = traverseWin(root); bool l = traverseLose(root); if (!w) { cout << Second << endl; } else { if (!l) { cout << (k % 2 == 0 ? Second : First ) << endl; } else { cout << First << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a1, a2, b1, b2, c1, c2; int main() { cin >> a1 >> b1 >> c1 >> a2 >> b2 >> c2; if (a1 == 0 && b1 == 0 && c1 != 0 || a2 == 0 && b2 == 0 && c2 != 0) { cout << 0 n ; return 0; } int m1 = b1 * a2, m2 = b2 * a1; if (m1 == m2) if (c1 * b2 != c2 * b1 || a1 * c2 != a2 * c1) cout << 0 n ; else cout << -1 n ; else cout << 1 n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long ax, ay, bx, by, cx, cy; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> ax >> ay >> bx >> by >> cx >> cy; if ((by - ay) * (cx - bx) == (cy - by) * (bx - ax)) cout << NO n ; else if ((by - ay) * (by - ay) + (bx - ax) * (bx - ax) == (by - cy) * (by - cy) + (bx - cx) * (bx - cx)) cout << YES n ; else cout << NO n ; return 0; }
|
#include <bits/stdc++.h> int main() { int n(0); scanf( %d , &n); char first = x , last = y ; int count(0); if (n % 2 == 0) { for (int k = 0; k < n / 2; k++) { printf( %c%c , (count) % 2 + a , (count) % 2 + a ); ++count; }; puts( ); for (int k = 0; k < n / 2; k++) { printf( %c%c , (count) % 2 + c , (count) % 2 + c ); ++count; }; puts( ); printf( %c , first); for (int k = 0; k < n / 2 - 1; k++) { printf( %c%c , (count) % 2 + f , (count) % 2 + f ); ++count; }; printf( %c n , last); printf( %c , first); for (int k = 0; k < n / 2 - 1; k++) { printf( %c%c , (count) % 2 + m , (count) % 2 + m ); ++count; }; printf( %c n , last); } else if (n % 2 == 1) { char count = b ; printf( %c , first); for (int k = 0; k < n / 2; k++) { printf( %c%c , (count) % 2 + a , (count) % 2 + a ); ++count; }; puts( ); printf( %c , first); for (int k = 0; k < n / 2; k++) { printf( %c%c , (count) % 2 + c , (count) % 2 + c ); ++count; }; puts( ); for (int k = 0; k < n / 2; k++) { printf( %c%c , (count) % 2 + f , (count) % 2 + f ); ++count; }; printf( %c n , last); for (int k = 0; k < n / 2; k++) { printf( %c%c , (count) % 2 + m , (count) % 2 + m ); ++count; }; printf( %c n , last); } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:102400000,102400000 ) using namespace std; const double PI = acos(-1.0); int f_max(int a, int b) { return a > b ? a : b; } int f_min(int a, int b) { return a < b ? a : b; } int f_abs(int a) { return a > 0 ? a : -a; } int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int n, m; int u, d, l, r; int x, y; int main() { int q, w, e; int i, j, k; int ans, len; while (~scanf( %d%d , &n, &m)) { len = 0x7fffffff; r = u = -0x7fffffff; l = d = 0x7fffffff; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%d , &x, &y); u = f_max(u, y - x); d = f_min(d, y - x); l = f_min(l, x + y); r = f_max(r, x + y); } scanf( %d , &m); int mm; for (i = 1; i <= m; i++) { scanf( %d%d , &x, &y); mm = 0; mm = f_max(mm, u - (y - x)); mm = f_max(mm, (y - x) - d); mm = f_max(mm, r - (x + y)); mm = f_max(mm, (x + y) - l); if (mm < len) { ans = i; len = mm; } } printf( %d n%d n , len, ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100010; long long mod = 1e9 + 7; long long fmod(long long b, long long exp) { long long res = 1; while (exp) { if (exp & 1ll) res = (res * b) % mod; b = (b * b) % mod; exp /= 2ll; } return res; } long long buc[101]; long long fac[N], inv[N]; long long dp[N], temp_dp[N]; long long ans[55][55]; string s, s1, s2; int find(char c) { if (c >= A && c <= Z ) return (int)(c - A + 26); else return (c - a ); } inline void add(long long &a, long long b) { a += b; if (a >= mod) a -= mod; } inline void sub(long long &a, long long b) { a -= b; if (a < 0) a += mod; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1, n, i, j, m, q; cin >> s; n = s.length(); for (int i = 0; i < n; i++) buc[find(s[i])]++; fac[0] = 1; for (i = 1; i <= n; i++) fac[i] = (fac[i - 1] * 1ll * i) % mod; inv[n] = fmod(fac[n], mod - 2); for (int i = n - 1; i >= 0; i--) inv[i] = (inv[i + 1] * 1ll * (i + 1)) % mod; long long num = (fac[n / 2] * fac[n / 2]) % mod; for (int i = 0; i < 52; i++) num = (num * inv[buc[i]]) % mod; dp[0] = 1; for (int i = 0; i < 52; i++) { if (!buc[i]) continue; for (int j = n; j >= buc[i]; j--) add(dp[j], dp[j - buc[i]]); } for (i = 0; i < 52; i++) ans[i][i] = dp[n / 2]; for (i = 0; i < 52; i++) { if (!buc[i]) continue; for (int k = 0; k <= n; k++) temp_dp[k] = dp[k]; for (int k = buc[i]; k <= n; k++) sub(temp_dp[k], temp_dp[k - buc[i]]); for (int j = i + 1; j < 52; j++) { if (!buc[j]) continue; for (int k = buc[j]; k <= n; k++) sub(temp_dp[k], temp_dp[k - buc[j]]); ans[i][j] = (2ll * temp_dp[n / 2]) % mod; ans[j][i] = ans[i][j]; for (int k = n; k >= buc[j]; k--) add(temp_dp[k], temp_dp[k - buc[j]]); } } cin >> q; int x, y; while (q--) { cin >> x >> y; int l = find(s[x - 1]); int r = find(s[y - 1]); cout << (num * ans[l][r]) % mod << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void fastInOut(); unsigned long long power(unsigned long long b, unsigned long long pow) { if (b == 0) return 0; else if (pow == 1) return b; else if (pow % 2 == 0) return power(b * b, pow / 2); else return b * power(b * b, pow / 2); } int power(int z, int i) { int zz = 1; for (int k = 0; k < i; k++) { zz *= z; } return zz; } long long power(long long x, long long y) { long long z = 1; for (long long i = 0; i < y; i++) z *= x; return z; } bool right(int arr[]) { int a[3]; a[0] = power(arr[3] - arr[1], 2) + power(arr[2] - arr[0], 2); a[1] = power(arr[5] - arr[1], 2) + power(arr[4] - arr[0], 2); a[2] = power(arr[5] - arr[3], 2) + power(arr[4] - arr[2], 2); sort(a, a + 3); if (a[0] + a[1] == a[2] && (sqrt(a[0]) * sqrt(a[1]) * sqrt(a[2])) / 2) return true; return false; } bool fed(int k, int f, int test) { if (f < test) swap(f, test); int c = 0; while (f) { if ((f & 1) != (test & 1)) c++; f = f >> 1; test = test >> 1; if (c > k) return false; } if (c > k) return false; return true; } unsigned long long fact(long long a) { unsigned long long res = 1; for (long long i = a; i > 0; i--) res *= i; return res; } unsigned long long comb(long long a, long long b) { if ((a - b) < b) b = a - b; if (a <= 19) return fact(a) / (fact(a - b) * fact(b)); if (a == b || b == 0) return 1; if (b == 1) return a; return comb(a - 1, b - 1) + comb(a - 1, b); } bool palind(string s) { for (unsigned int i = 0, f = s.size() - 1; i < s.size() / 2; i++, f--) if (s[i] != s[f]) return false; return true; } int div(long long x) { double SqrtOfnumber; SqrtOfnumber = sqrt(x); int counter = 1; int i; for (i = 2; i < SqrtOfnumber; i++) { if (x % i == 0) counter++; } counter = counter * 2; if (i * i == x) counter++; return counter; } bool isprim(int x) { for (int i = x - 1; i > 1; i--) { if (x % i == 0) return false; } return true; } set<long long> prim(int n) { n++; bool *arr = new bool[n]; for (int i = 0; i < n; i++) arr[i] = true; set<long long> se; for (int i = 2; i * i < n; i++) if (arr[i]) for (int k = i * i; k < n; k += i) arr[k] = false; for (int i = 2; i < n; i++) if (arr[i]) se.insert(i); return se; } int n, m; char arr[1010][1010]; bool pash(int x, int y) { int s; s = 1; if (x + 1 < n && arr[x + 1][y] == b ) s++; if (x + 1 < n && y + 1 < m && arr[x + 1][y + 1] == b ) s++; if (y + 1 < m && arr[x][y + 1] == b ) s++; if (s == 4) return true; s = 1; if (x - 1 >= 0 && arr[x - 1][y] == b ) s++; if (x - 1 >= 0 && y + 1 < m && arr[x - 1][y + 1] == b ) s++; if (y + 1 < m && arr[x][y + 1] == b ) s++; if (s == 4) return true; s = 1; if (x - 1 >= 0 && arr[x - 1][y] == b ) s++; if (x - 1 >= 0 && y - 1 >= 0 && arr[x - 1][y - 1] == b ) s++; if (y - 1 >= 0 && arr[x][y - 1] == b ) s++; if (s == 4) return true; s = 1; if (x + 1 < n && arr[x + 1][y] == b ) s++; if (x + 1 < n && y - 1 >= 0 && arr[x + 1][y - 1] == b ) s++; if (y - 1 >= 0 && arr[x][y - 1] == b ) s++; if (s == 4) return true; return false; } int main() { fastInOut(); int n, m, x; string res = YES ; cin >> n >> m; vector<int> v; for (int i = 0; i < m; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); if (v.size()) { if (*min_element(v.begin(), v.end()) == 1 || *max_element(v.begin(), v.end()) == n) res = NO ; else for (int i = 0; i < m - 2; i++) if (v[i + 1] - v[i] == 1 && v[i + 2] - v[i] == 2) { res = NO ; break; } } cout << res; return 0; } void fastInOut() { ios_base::sync_with_stdio(0); cin.tie(NULL), cout.tie(NULL); }
|
#include <bits/stdc++.h> const double PI = acos(-1.0); const int INF = 0x3f3f3f3f; const double eps = 1e-8; const int MAXN = 1e3 + 10; const long long MOD = 1e9 + 7; int cases = 0; using std::string; const int dir[][2] = {{-1, 0}, {-1, -1}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}; int next[MAXN]; int main() { int n, m; scanf( %d%d , &n, &m); while (m--) { int t, k, d; std::vector<int> tmp; scanf( %d%d%d , &t, &k, &d); int cnt = 0; int res = 0; for (int i = 1; i <= n; ++i) { if (next[i] <= t) { tmp.push_back(i); } if (tmp.size() == k) { for (int u : tmp) { next[u] = t + d; res += u; } break; } } printf( %d n , res == 0 ? -1 : res); } return 0; }
|
#include <bits/stdc++.h> using namespace std; using namespace std; const int maxn = 3e5 + 5; int level[maxn * 2], num[maxn * 2], par[maxn * 2]; char s[maxn * 2]; stack<int> stk; int main() { int n, cnt = 0; scanf( %d , &n); scanf( %s , s + 1); for (int i = 1; i <= n; i++) { if (stk.empty()) stk.push(i); else { int c = stk.top(); if (s[i] == ) && s[c] == ( ) stk.pop(); else stk.push(i); } s[i + n] = s[i]; cnt = cnt + ((s[i] == ( ) ? (1) : (-1)); } if (cnt) return 0 & printf( 0 n1 1 n ); int j = 1; while (!stk.empty()) { int c = stk.top(); if (s[c] == ) ) break; stk.pop(); j = c; } for (int i = 1; i <= n * 2; i++) level[i] = -1, num[i] = 0; while (!stk.empty()) stk.pop(); for (int i = j; i <= j + n - 1; i++) { if (stk.empty()) { stk.push(i); level[i] = 1; cnt++; } else { int c = stk.top(); if (s[i] == ) && s[c] == ( ) { stk.pop(); par[c] = i; } else { stk.push(i); level[i] = stk.size(); } } } int i = j; while (i <= j + n - 1) { if (level[i] == 1) { int r = par[i], k = i; while (i < r) { if (level[i] == 2) num[k]++; i++; } } i++; } i = j; while (i <= j + n - 1) { if (level[i] == 2) { int r = par[i], k = i; while (i < r) { if (level[i] == 3) num[k]++; i++; } } i++; } int ans = 0, l, r; for (int i = j; i <= j + n - 1; i++) { if (level[i] == 1) { if (ans < (num[i] + 1)) { ans = num[i] + 1; l = i % n; r = par[i] % n; } } else if (level[i] == 2) { if (ans < (cnt + num[i] + 1)) { ans = cnt + num[i] + 1; l = i % n; r = par[i] % n; } } } if (ans < cnt) ans = cnt, l = 1, r = 1; if (l == 0) l = n; if (r == 0) r = n; printf( %d n%d %d n , ans, l, r); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 300005; int n, k, i, a, b, da, db, u, v, head[N], Next[N * 2], adj[N * 2], j, dp[N], ans, dd, t; void Push(int u, int v) { Next[++k] = head[u]; head[u] = k; adj[k] = v; } void dfs(int i, int fa) { int j, mxx = 0; dp[i] = 0; for (j = head[i]; j; j = Next[j]) if (adj[j] != fa) { dfs(adj[j], i); if (dp[i] < dp[adj[j]] + 1) { mxx = max(mxx, dp[i]); dp[i] = dp[adj[j]] + 1; } else mxx = max(mxx, dp[adj[j]] + 1); } ans = max(ans, mxx + dp[i]); } void dis(int i, int fa, int d) { int j; for (j = head[i]; j; j = Next[j]) if (adj[j] != fa) dis(adj[j], i, d + 1); if (i == b) dd = d; } int main() { scanf( %d , &t); while (t--) { scanf( %d %d %d %d %d , &n, &a, &b, &da, &db); for (i = 1; i <= n; ++i) head[i] = 0; k = 0; for (i = 1; i < n; ++i) { scanf( %d %d , &u, &v); Push(u, v); Push(v, u); } if (db <= da * 2) { puts( Alice ); continue; } ans = 0; dfs(1, 0); dis(a, 0, 0); if (dd <= da || ans <= da * 2) puts( Alice ); else puts( Bob ); } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cerr.tie(0); int n, tmp; vector<pair<int, int> > a; cin >> n; for (int i = 0; i < n; i++) cin >> tmp, a.push_back(make_pair(tmp, i + 1)); sort(a.begin(), a.end()); int c1 = 0, c2 = 0, s1 = 0, s2 = 0; vector<int> t1, t2; int l = 0, r = n - 1; while (l <= r) { if (s1 > s2) { if (c2 - c1 <= 0) { c2++; s2 += a[r].first; t2.push_back(a[r].second); r--; } else { c1++; s1 += a[l].first; t1.push_back(a[l].second); l++; } } else { if (c2 - c1 <= 0) { c2++; s2 += a[l].first; t2.push_back(a[l].second); l++; } else { c1++; s1 += a[r].first; t1.push_back(a[r].second); r--; } } } cout << c1 << endl; for (int i = 0; i < c1; i++) cout << t1[i] << ; cout << endl; cout << c2 << endl; for (int i = 0; i < c2; i++) cout << t2[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; int c[maxn], A[maxn], B[maxn]; int n, k, a, b, q, cmd; void add(int *c, int p, int val) { for (; p <= n; p += p & -p) c[p] += val; } int sum(int *c, int p) { int ret = 0; for (; p; p -= p & -p) ret += c[p]; return ret; } int main() { cin >> n >> k >> a >> b >> q; while (q--) { int x, y; scanf( %d , &cmd); if (cmd == 1) { scanf( %d%d , &x, &y); add(A, x, -min(c[x], a)); add(B, x, -min(c[x], b)); c[x] += y; add(A, x, min(c[x], a)); add(B, x, min(c[x], b)); } else { scanf( %d , &x); int ans = 0; ans += sum(B, x - 1); ans += sum(A, n) - sum(A, x + k - 1); printf( %d n , ans); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 2 * 1e6 + 10; long long a[maxn], b[maxn], q[maxn], sz[maxn], n; inline long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 1) + (x << 3) + c - 0 ; c = getchar(); } return x * f; } long long b1, b2, n1; signed main() { n = read(); long long p = 0; for (long long i = 1; i <= n; i++) { a[i] = read(); if (a[i] > a[p]) p = i; if (a[i] > b1) b2 = b1, b1 = a[i], n1 = 1; else if (a[i] == b1) n1++; else if (a[i] > b2) b2 = a[i]; } for (long long i = 1; i <= n; i++) b[i] = a[(i + p - 1) % n + 1]; long long l = 1, r = 0, ans = 0; for (long long i = 1; i <= n; i++) { while (l <= r && b[i] > b[q[r]]) r--, ans++; if (r >= l) { if (b[i] == b[q[r]]) ans += min(r, sz[r] + 1); else ans++; } q[++r] = i; if (b[i] == b[q[r - 1]]) sz[r] = sz[r - 1] + 1; else sz[r] = 1; } p = 0; for (long long i = 1; i < n; i++) if (b[i] >= b[p]) { p = i; if (n1 > 1 && b[p] == b1) ; else if (n1 == 1 && b[p] == b2) ; else ans++; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Max = 50; int row[Max][Max] = {0}, dp[Max][Max][Max][Max] = {0}, a[Max][Max]; int main() { int n, m, q; cin >> n >> m >> q; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %1d , &a[i][j]); row[i][j] = row[i][j - 1] + 1; if (a[i][j] == 1) row[i][j] = 0; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { for (int k = i; k <= n; k++) { for (int l = j; l <= m; l++) { dp[i][j][k][l] = dp[i][j][k - 1][l] + dp[i][j][k][l - 1] - dp[i][j][k - 1][l - 1]; int r = l - j + 1; for (int z = k; z >= i; z--) { r = min(r, row[z][l]); dp[i][j][k][l] += r; } } } } } while (q--) { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); cout << dp[a][b][c][d] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int t; int n, k; int siz[100086]; int c, x; int id[100086]; int mx; char s[100086]; inline int get(int l, int r) { printf( ? %d , r - l + 1), fflush(stdout); for (int i = l; i <= r; i++) printf( %d , i), fflush(stdout); puts( ); fflush(stdout); int x; scanf( %d , &x); return x; } int main() { scanf( %d , &t); while (t--) { scanf( %d%d , &n, &k); for (int i = 1; i <= k; i++) siz[i] = 0; for (int i = 1; i <= n; i++) id[i] = 0; for (int i = 1; i <= k; i++) { scanf( %d , &c); while (c--) { scanf( %d , &x); id[x] = i; siz[i]++; } } mx = get(1, n); int l = 1, r = n, mid; while (l < r) { mid = l + r >> 1; x = get(l, mid); if (x == mx) r = mid; else l = mid + 1; } if (!id[l]) x = mx; else { printf( ? %d , n - siz[id[l]]), fflush(stdout); for (int i = 1; i <= n; i++) if (id[i] != id[l]) printf( %d , i), fflush(stdout); puts( ); fflush(stdout); scanf( %d , &x); } printf( ! ), fflush(stdout); for (int i = 1; i <= k; i++) { if (i == id[l]) printf( %d , x); else printf( %d , mx); fflush(stdout); } puts( ); fflush(stdout); scanf( %s , s); if (s[0] == I ) return 0; } }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long N = 3e5 + 5; const long long INF = 1e14; vector<long long> adj[33]; int dirx[] = {-1, 1, 0, 0}; int diry[] = {0, 0, -1, 1}; long long ans[33][2]; void dfs(int u, int p, int dir, long long dist) { int d = 0; for (long long i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (v == p) continue; if (dir == d) d++; ans[v][0] = ans[u][0] + dist * dirx[d]; ans[v][1] = ans[u][1] + dist * diry[d]; dfs(v, u, d ^ 1, (dist >> 1)); d++; } } int main() { ios::sync_with_stdio(false); int n; int a, b; cin >> n; for (long long i = 0; i < n - 1; i++) { cin >> a >> b; a--; b--; adj[a].push_back(b); adj[b].push_back(a); } for (long long i = 0; i < n; i++) if (adj[i].size() > 4) { cout << NO n ; return 0; } ans[0][0] = 0; ans[0][1] = 0; dfs(0, -1, -1, (1 << 30)); cout << YES n ; for (long long i = 0; i < n; i++) cout << ans[i][0] << << ans[i][1] << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int Max(int a, int b) { return (a > b ? a : b); } inline int Min(int a, int b) { return (a > b ? b : a); } int dp[45][65][65]; int cnt[65], K; void Init() { for (int i = 0; i < 65; i++) { int n = i; int x = 0; while (n) { x++; n &= (n - 1); } cnt[i] = x; } } int get(int num) { int k = K - 1; return (num | ((num >> 1)) | ((num << 1) & k)); } int main() { int i, j, k, t; int a, b, c, x, y, z; int n, m; Init(); while (scanf( %d%d , &n, &m) != EOF) { if (n > m) swap(n, m); K = (1 << n); if (m == 1 && n == 1) { puts( 0 ); continue; } for (i = 0; i < K; i++) for (j = 0; j < K; j++) { if ((i | get(j)) == K - 1) { dp[2][i][j] = cnt[i] + cnt[j]; } else dp[2][i][j] = 100000000; } for (i = 3; i <= m; i++) for (j = 0; j < K; j++) for (k = 0; k < K; k++) { dp[i][j][k] = 100000000; for (t = 0; t < K; t++) { int my = j | get(k) | t; if (dp[i - 1][k][t] == 100000000 || my != K - 1) continue; dp[i][j][k] = Min(dp[i][j][k], dp[i - 1][k][t] + cnt[j]); } } int ans = 100000000; for (j = 0; j < K; j++) for (k = 0; k < K; k++) for (t = 0; t < K; t++) { if ((get(t | j) | k) != K - 1) continue; ans = Min(ans, dp[m][j][k] + cnt[t]); } printf( %d n , n * m - ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct ms { string s; int id; }; bool operator<(const ms &a, const ms &b) { return a.s < b.s; } vector<ms> sv, msv[11]; string s; int n, lenmin = 11, lenmax = 0; bool used[10000] = {false}; int main(void) { int i; cin >> n; sv.reserve(n); for (i = 0; i < n; ++i) { cin >> s; if ((int)s.length() > lenmax) lenmax = s.length(); if ((int)s.length() < lenmin) lenmin = s.length(); ms sid = {s, i}; sv.push_back(sid); msv[s.length()].push_back(sid); } cin >> s; for (i = 0; i < n; ++i) sv[i].s.append(s); sort(sv.begin(), sv.end()); for (i = 1; i <= 10; ++i) { sort(msv[i].begin(), msv[i].end()); reverse(msv[i].begin(), msv[i].end()); } lenmax = lenmax + lenmin; for (i = 0; i < n; ++i) if (!used[sv[i].id]) { cout << sv[i].s; used[sv[i].id] = true; lenmin = lenmax - sv[i].s.length() + 1; while (used[msv[lenmin].back().id]) msv[lenmin].pop_back(); cout << msv[lenmin].back().s << n ; used[msv[lenmin].back().id] = true; msv[lenmin].pop_back(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int Szukaj(vector<int>& moje, vector<bool>& jest, int x) { int nr = -1; for (int i = 0; i < moje.size(); ++i) { if (moje[i] >= x && jest[i]) { if (nr == -1) nr = i; else { if (moje[i] < moje[nr]) nr = i; } } } return nr; } int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; vector<int> atk, def; for (int i = 0; i < n; ++i) { string op; int s; cin >> op >> s; if (op == ATK ) atk.push_back(s); else def.push_back(s); } vector<int> moje(m); for (int i = 0; i < m; ++i) cin >> moje[i]; int odp = 0; sort(atk.begin(), atk.end()); sort(moje.begin(), moje.end()); reverse(moje.begin(), moje.end()); for (int i = 1; i <= min(atk.size(), moje.size()); ++i) { vector<int> a, b; for (int j = 0; j < i; ++j) a.push_back(moje[j]); for (int j = i - 1; j >= 0; --j) b.push_back(atk[j]); int s = 0; bool ok = true; for (int j = 0; j < i; ++j) { if (a[j] >= b[j]) s += a[j] - b[j]; else ok = false; } if (ok) odp = max(odp, s); } bool ok = true; int s = 0; vector<bool> jest(moje.size(), true); sort(def.begin(), def.end()); for (int i = 0; i < def.size(); ++i) { int nr = Szukaj(moje, jest, def[i] + 1); if (nr != -1) jest[nr] = false; else ok = false; } for (int i = 0; i < atk.size(); ++i) { int nr = Szukaj(moje, jest, atk[i]); if (nr != -1) { jest[nr] = false; s += moje[nr] - atk[i]; } else ok = false; } for (int i = 0; i < moje.size(); ++i) if (jest[i]) s += moje[i]; if (ok) odp = max(odp, s); cout << odp; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int d, s; int id; }; node a[100009], b[100009]; map<int, int> Map; vector<int> e[100009], vec; int match[100009]; int vis[100009]; int n, m; bool cmp(node x, node y) { return x.d > y.d; } bool find(int x) { for (int i = 0; i < e[x].size(); i++) { if (match[e[x][i]] == x) continue; if (match[e[x][i]] == 0 || find(match[e[x][i]])) { match[e[x][i]] = x; return true; } } return false; } int main() { int d, s; scanf( %d , &n); memset(match, 0, sizeof(match)); for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i].d, &a[i].s); a[i].id = i; Map[a[i].s] = i; } cin >> m; for (int i = 1; i <= m; i++) { scanf( %d%d , &d, &s); if (Map.find(s) != Map.end()) { if (a[Map[s]].d <= d) e[Map[s]].push_back(i); } if (Map.find(s + 1) != Map.end()) { if (a[Map[s + 1]].d <= d) e[Map[s + 1]].push_back(i); } } sort(a + 1, a + 1 + n, cmp); long long ans1 = 0, ans2 = 0; for (int i = 1; i <= n; i++) { if (find(a[i].id)) { ans1++; ans2 += a[i].d; } } cout << ans2 << endl; cout << ans1 << endl; for (int i = 1; i <= m; i++) { if (match[i] != 0) cout << i << << match[i] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = (1 << 18) + 5; const int MAXM = 1005; bitset<MAXM> STree[MAXN], Prime, mask; int Lazy[MAXN], a[MAXN], in[MAXN], out[MAXN], time_tag, n, m, H[MAXN]; vector<int> G[MAXN]; void dfs(int i, int fa) { in[i] = ++time_tag; H[in[i]] = i; for (int v : G[i]) { if (v == fa) continue; dfs(v, i); } out[i] = time_tag; } void init(int k, int l, int r) { if (r == l) return; if (r - l == 1) { STree[k][a[H[l]]] = 1; return; } int m = l + r >> 1; init(k << 1, l, m); init(k << 1 | 1, m, r); STree[k] = STree[k << 1] | STree[k << 1 | 1]; return; } void inline push_down(int k) { if (Lazy[k]) { (Lazy[k << 1] += Lazy[k]) %= m; (Lazy[k << 1 | 1] += Lazy[k]) %= m; STree[k << 1] = ((STree[k << 1] << Lazy[k]) & mask) | ((STree[k << 1] >> (m - Lazy[k])) & mask); STree[k << 1 | 1] = ((STree[k << 1 | 1] << Lazy[k]) & mask) | ((STree[k << 1 | 1] >> (m - Lazy[k])) & mask); Lazy[k] = 0; } } void inline maintain(int k) { STree[k] = STree[k << 1] | STree[k << 1 | 1]; return; } void modify(int k, int l, int r, int ql, int qr, int val) { if (ql >= r || qr <= l) return; if (ql <= l && r <= qr) { (Lazy[k] += val) %= m; STree[k] = ((STree[k] << val) & mask) | ((STree[k] >> (m - val)) & mask); return; } push_down(k); int m = l + r >> 1; modify(k << 1, l, m, ql, qr, val); modify(k << 1 | 1, m, r, ql, qr, val); maintain(k); } bitset<MAXM> query(int k, int l, int r, int ql, int qr) { if (ql >= r || qr <= l) return bitset<MAXM>(); if (ql <= l && r <= qr) return STree[k]; push_down(k); int m = l + r >> 1; bitset<MAXM> ret = query(k << 1, l, m, ql, qr) | query(k << 1 | 1, m, r, ql, qr); maintain(k); return ret; } int main() { Prime = ~Prime; Prime[0] = Prime[1] = 0; for (int i = (2); i < (1001); i++) { if (Prime[i]) { for (int j = i + i; j <= 1000; j += i) { Prime[j] = 0; } } } scanf( %d%d , &n, &m); for (int i = (0); i < (m); i++) mask[i] = 1; for (int i = (1); i < (n + 1); i++) scanf( %d , a + i), a[i] %= m; for (int i = (1); i < (n); i++) { int u, v; scanf( %d%d , &u, &v); G[u].push_back(v), G[v].push_back(u); } dfs(1, -1); init(1, 1, time_tag + 1); int q; scanf( %d , &q); for (int cas = (0); cas < (q); cas++) { int op, v, x; scanf( %d , &op); if (op == 1) { scanf( %d%d , &v, &x); modify(1, 1, time_tag + 1, in[v], out[v] + 1, x % m); } else { scanf( %d , &v); bitset<MAXM> res = Prime & query(1, 1, time_tag + 1, in[v], out[v] + 1); printf( %d n , res.count()); } } }
|
#include <bits/stdc++.h> using namespace std; const int N = 600 + 5; const int M = 2e5 + 5; template <class T> inline void getin(T& num) { char c; bool flag = 0; num = 0; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag = 1; while (c >= 0 && c <= 9 ) { num = num * 10 + c - 48; c = getchar(); } if (flag) num = -num; } int n, m, u, v, In[N]; int tot, x[N], y[N], Out[N]; int cnt, fir[N], tar[M], nxt[M]; long long p, f[N][N], a[N][N]; inline void link(int a, int b) { tar[++cnt] = b, In[b]++, Out[a]++; nxt[cnt] = fir[a], fir[a] = cnt; } template <class T> inline void add(T& a, T b) { a += b; if (a >= p) a -= p; } inline void Dp() { queue<int> q; int c = 0; for (int i = 1; i <= n; i++) { if (!In[i]) x[++tot] = i; if (!Out[i]) y[++c] = i; } for (int i = 1; i <= n; i++) f[i][i] = 1; for (int i = 1; i <= n; i++) if (!In[i]) q.push(i); while (!q.empty()) { int u = q.front(); q.pop(); for (int i = fir[u]; i; i = nxt[i]) { int v = tar[i]; for (int i = 1; i <= n; i++) add(f[i][v], f[i][u]); In[v]--; if (!In[v]) q.push(v); } } for (int i = 1; i <= tot; i++) for (int j = 1; j <= tot; j++) a[i][j] = f[x[i]][y[j]]; } inline int calc(int n) { int ret = 1; for (int i = 1; i <= n; i++) { if (a[i][i] < 0) { ret = -ret; for (int k = i; k <= n; k++) a[i][k] = -a[i][k]; } for (int j = i + 1; j <= n; j++) { for (int k = i; k <= n; k++) a[i][k] %= p, a[j][k] %= p; while (a[j][i]) { if (a[j][i] < 0) { ret = -ret; for (int k = i; k <= n; k++) a[j][k] = -a[j][k]; } int t = a[i][i] / a[j][i]; for (int k = i; k <= n; k++) a[i][k] = (a[i][k] - t * a[j][k]) % p; for (int k = i; k <= n; k++) swap(a[i][k], a[j][k]); ret = -ret; } } if (a[i][i] == 0) return 0; ret = 1ll * ret * a[i][i] % p; } return (ret + p) % p; } int main() { getin(n), getin(m), getin(p); for (int i = 1; i <= m; i++) getin(u), getin(v), link(u, v); Dp(); cout << calc(tot) << n ; }
|
#include <bits/stdc++.h> using namespace std; bool is_right(complex<long long> p1, complex<long long> p2, complex<long long> p3) { return (conj(p2 - p1) * (p3 - p1)).imag() < 0; } const int N = 1e5 + 5; vector<complex<long long> > U; complex<long long> a[N]; int n; void read_input() { cin >> n; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; a[i] = complex<long long>(x, y - 1LL * x * x); } } void solve() { sort(a, a + n, [](complex<long long> a, complex<long long> b) { return make_pair(a.real(), a.imag()) < make_pair(b.real(), b.imag()); }); for (int i = 0; i < n; U.push_back(a[i++])) while (U.size() > 1 && !is_right(U[U.size() - 2], U.back(), a[i])) U.pop_back(); cout << U.size() - (U.size() > 1 && U[0].real() == U[1].real()) - 1; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); read_input(), solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline bool chkmin(T& x, T y) { return x > y ? x = y, true : false; } template <class T> inline bool chkmax(T& x, T y) { return x < y ? x = y, true : false; } inline int read(void) { int x, f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return x * f; } template <typename T> struct Graph { enum { maxn = 305, maxm = 200000 }; struct Edge { int to, nxt; T w, cap, flow; } v[maxm]; int h[maxn], cnt; Graph() { memset(h, -1, sizeof(h)); } void add1(int x, int y, T w, T cap) { v[cnt] = Edge{y, h[x], w, cap, 0}; h[x] = cnt++; } void add(int x, int y, T w, T cap) { add1(x, y, w, cap); add1(y, x, -w, 0); } }; Graph<int> G; int Ss, Se; static int f[305]; int dfs(int x, int re) { if (x == Se || re <= 0) return re; int s1 = 0, t; for (int i = G.h[x]; i != -1; i = G.v[i].nxt) { int to = G.v[i].to; if (f[to] != f[x] + 1) continue; t = dfs(to, min(re, G.v[i].cap - G.v[i].flow)); G.v[i].flow += t; G.v[i ^ 1].flow -= t; s1 += t; re -= t; if (re == 0) break; } return s1; } bool bfs(int x) { queue<int> Q; memset(f, -1, sizeof(f)); Q.push(x); f[x] = 0; while (!Q.empty()) { int u = Q.front(); Q.pop(); for (int i = G.h[u]; i != -1; i = G.v[i].nxt) { if (G.v[i].flow >= G.v[i].cap) continue; int to = G.v[i].to; if (f[to] != -1) continue; f[to] = f[u] + 1; Q.push(to); } } return f[Se] != -1; } int dinic() { int ans = 0; while (bfs(Ss)) ans += dfs(Ss, 1000000000); return ans; } bool vi[305]; int n, lk[305], v, x, ans, w; vector<int> V[305]; bool dfs(int x) { vi[x] = 1; for (int i = 0; i <= V[x].size() - 1; ++i) { int to = V[x][i]; if (!lk[to] || (!vi[lk[to]] && dfs(lk[to]))) { lk[to] = x; return 1; } } return 0; } int main(void) { n = read(); for (int i = 1; i <= n; ++i) { v = read(); while (v--) { x = read(); V[i].push_back(x); } } for (int i = 1; i <= n; ++i) { memset(vi, 0, sizeof(vi)); dfs(i); } for (int i = 1; i <= n; ++i) for (int j = 0; j <= V[i].size() - 1; ++j) G.add(i, lk[V[i][j]], 0, 1000000000); Ss = n + 1; Se = n + 2; for (int i = 1; i <= n; ++i) { w = -read(); if (w < 0) G.add(i, Se, 0, -w); else G.add(Ss, i, 0, w), ans += w; } printf( %d n , -(ans - dinic())); return 0; }
|
#include <bits/stdc++.h> int valid(char prev, char next) { char s[] = aeioun ; for (int i = 0; i < 6; i++) if (prev == s[i]) return 1; for (int i = 0; i < 5; i++) if (next == s[i]) return 1; return 0; } int main() { char s[300]; scanf( %s , s); int v = 1; for (int i = 0; s[i] != 0 ; i++) v &= valid(s[i], s[i + 1]); printf( %s n , v ? Yes : No ); }
|
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, pair<long long, long long> > mp; long long n; pair<long long, long long> solve(pair<long long, long long> a) { if (a.second < 10) return make_pair(a.first || a.second, a.second - max(a.first, a.second)); if (mp[a].first) return mp[a]; long long ans = 0, p = 1; while (a.second >= p * 10) p *= 10; pair<long long, long long> b = solve(make_pair(max(a.first, a.second / p), a.second % p)); ans += b.first; pair<long long, long long> c = solve(make_pair(a.first, a.second / p * p + b.second)); ans += c.first; return mp[a] = make_pair(ans, c.second); } int main() { cin >> n; cout << solve(make_pair(0, n)).first; return 0; }
|
#include <bits/stdc++.h> using namespace std; int k; int n1, n2, n3; int t1, t2, t3; int v1[3000]; int v2[3030]; int v3[3030]; int main() { ios::sync_with_stdio(false); cin >> k >> n1 >> n2 >> n3 >> t1 >> t2 >> t3; int time = t1 + t2 + t3 - 1; int pos = 0; int res = 0; for (int i = 0; i <= time + 1; i++) { v1[i] = 0; v2[i] = 0; v3[i] = 0; } for (int i = 1; i <= k; i++) { int posnew = -1; for (int j = pos; j <= pos + time + 1; j++) { int kk = j - pos; if ((v1[kk] + 1 <= n1) && ((kk + t1 > time + 1) || (v2[kk + t1] + 1 <= n2)) && ((kk + t1 + t2 > time + 1) || (v3[kk + t1 + t2] + 1 <= n3))) { posnew = j; break; } } int t = min(pos + time + 1, posnew + time); for (int j = posnew; j <= t; j++) { if (j <= posnew + t1 - 1) v1[j - pos]++; else if (j <= posnew + t1 + t2 - 1) v2[j - pos]++; else v3[j - pos]++; v1[j - posnew] = v1[j - pos]; v2[j - posnew] = v2[j - pos]; v3[j - posnew] = v3[j - pos]; } for (int j = t + 1; j <= posnew + time; j++) { if (j <= posnew + t1 - 1) { v1[j - posnew] = 1; v2[j - posnew] = 0; v3[j - posnew] = 0; } else if (j <= posnew + t1 + t2 - 1) { v2[j - posnew] = 1; v1[j - posnew] = 0; v3[j - posnew] = 0; } else { v3[j - posnew] = 1; v1[j - posnew] = 0; v2[j - posnew] = 0; } } v1[time + 1] = 0; v2[time + 1] = 0; v3[time + 1] = 0; res = posnew + time; pos = posnew; } cout << res + 1; return 0; }
|
#include <bits/stdc++.h> using namespace std; #define int int64_t #define MOD 998244353 #define inf 9e18 #define tikoo (int) (1e9 + 7) template<typename T, typename T1> T max(T a, T1 b) { if (b > a) a = b; return a; } template<typename T, typename T1> T min(T a, T1 b) { if (b < a) a = b; return a; } int fastpow(int a, int b, int m = tikoo) { int res = 1; a %= m; while (b > 0) { if (b & 1) res = (res * a) % m; a = (a * a) % m; b >>= 1; } return res; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t = 1; cin >> t; while (t--) { int n, k; cin >> n >> k; cout << fastpow(n, k) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void cppio() { ios_base::sync_with_stdio(0); cin.tie(0); } const int maxn = int(2e5) + 10; int n; int a[maxn]; int p, q; long long first, second; int gcd(int a, int b) { if (!b) { first = 1, second = 0; return a; } int q = a / b; int ret = gcd(b, a % b); tie(first, second) = make_pair(second, first - second * q); return ret; } int ans[maxn][3]; int main() { cppio(); cin >> n; for (int i = 1; i <= (n); ++i) cin >> a[i]; if (n == 1) { cout << 1 1 n << (-a[1]) << n1 1 n0 n1 1 n0 n ; return 0; } cout << 1 << << n << n0 ; for (int i = 2; i <= n; ++i) { cout << (-n * 1ll * a[i]) << ; } cout << n ; cout << 1 << << 1 << n ; cout << (-a[1]) << n ; cout << 2 << << n << n ; for (int i = 2; i <= n; ++i) { int first = a[i]; cout << ((n - 1) * 1ll * first) << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[100005], dist[100005], sad[100005], subt[100005], ans = 0LL; vector<pair<long long, long long> > adj[100005]; void dfs(long long node, long long par, long long min_vertex) { if (par != -1) sad[node] = (a[node] < dist[node] - dist[min_vertex]); min_vertex = (dist[node] < dist[min_vertex]) ? node : min_vertex; for (auto i : adj[node]) if (par != i.first) { dist[i.first] += (dist[node] + i.second); dfs(i.first, node, min_vertex); subt[node] += subt[i.first]; } subt[node]++; } void dfs1(long long node, long long par) { if (sad[node]) { ans += subt[node]; return; } for (auto i : adj[node]) if (i.first != par) dfs1(i.first, node); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { long long n, i, j, k; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n - 1; i++) { long long x, wt; cin >> x >> wt; adj[i + 1].push_back(make_pair(x, wt)); adj[x].push_back(make_pair(i + 1, wt)); } dfs(1, -1, 1); dfs1(1, -1); cout << ans; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 10; const int M = 128; const int inf = 0x7fffffff; const long long INF = 9E18; const int mod = 1e9 + 7; int n, m; int pos[M][maxn], len[M]; int dp[M][maxn]; char s[M][maxn]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , s[i] + 1); for (int j = 1; j <= m; j++) { if (s[i][j] == 1 ) pos[i][len[i]++] = j; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (len[i] == 0) { puts( -1 ); return 0; } int cnt = len[i]; int loc = lower_bound(pos[i], pos[i] + cnt, j) - pos[i]; int movl = inf, movr = inf; if (loc == len[i]) { loc--; movr = j - pos[i][loc]; movl = m - (j - pos[i][0]); } else if (loc == 0) { movl = pos[i][loc] - j; movr = m - (pos[i][len[i] - 1] - j); } else { movl = pos[i][loc] - j; movr = j - pos[i][--loc]; } dp[i][j] = min(movl, movr); } } int ans = inf; for (int i = 1; i <= m; i++) { int sum = 0; for (int j = 1; j <= n; j++) { sum += dp[j][i]; } ans = min(ans, sum); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string x; deque<char> vec; int c; bool flag; int max = 0; for (int i = 0; i < 8; i++) { cin >> x; for (int j = 0; j < x.length(); j++) vec.push_back(x[j]); if (i % 2 == 0) { c = 0; while (true) { c++; flag = true; for (int j = 1; j < x.length(); j++) { if (x[j] == x[j - 1]) { flag = false; char temp = vec.back(); vec.pop_back(); vec.push_front(temp); break; } } if (c == 9 || flag == true) break; } } else if (i % 2 != 0) { c = 0; while (true) { c++; flag = true; for (int j = 1; j < x.length(); j++) { if (x[j] == x[j - 1]) { flag = false; char temp = vec.back(); vec.pop_back(); vec.push_front(temp); break; } } if (c == 9 || flag == true) break; } } if (c > max) max = c; } if (flag == false || max == 9) cout << NO ; else cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n = 3, i, j, a, b; vector<pair<int, int> > v, v2; for (i = 0; i < 3; i++) { scanf( %d%d , &a, &b); v.push_back(make_pair(a, b)); v2.push_back(make_pair(b, a)); } int cnt, c2, c3; sort(v.begin(), v.end()); sort(v2.begin(), v2.end()); if (v[0].first == v[1].first) { if (v[1].first == v[2].first) cnt = 1; else if (v[1].second == v[2].second) cnt = 2; else cnt = 3; } else { if (v[1].first == v[2].first) cnt = 2; else if (v[1].second == v[2].second) cnt = 3; else cnt = 3; } if (v[0].first == v[2].first) { if (v[1].first == v[2].first) c2 = 1; else if (v[1].second == v[2].second) c2 = 2; else c2 = 3; } else { if (v[1].first == v[2].first) c2 = 2; else if (v[1].second == v[2].second) c2 = 3; else c2 = 3; } if (v[0].first == v[2].first) { if (v[1].first == v[0].first) c3 = 1; else if (v[1].second == v[0].second) c3 = 2; else c3 = 3; } else { if (v[1].first == v[0].first) c3 = 2; else if (v[1].second == v[0].second) c3 = 3; else c3 = 3; } cnt = min(cnt, min(c2, c3)); int c1; if (v2[0].first == v2[1].first) { if (v2[1].first == v2[2].first) c1 = 1; else if (v2[1].second == v2[2].second) c1 = 2; else c1 = 3; } else { if (v2[1].first == v2[2].first) c1 = 2; else if (v2[1].second == v2[2].second) c1 = 3; else c1 = 3; } if (v2[0].first == v2[2].first) { if (v2[1].first == v2[2].first) c2 = 1; else if (v2[1].second == v2[2].second) c2 = 2; else c2 = 3; } else { if (v2[1].first == v2[2].first) c2 = 2; else if (v2[1].second == v2[2].second) c2 = 3; else c2 = 3; } if (v2[0].first == v2[2].first) { if (v2[1].first == v2[0].first) c3 = 1; else if (v2[1].second == v2[0].second) c3 = 2; else c3 = 3; } else { if (v2[1].first == v2[0].first) c3 = 2; else if (v2[1].second == v2[0].second) c3 = 3; else c3 = 3; } if (v[0].first == v[1].first) { if (v[2].second < v[1].second && v[2].second > v[0].second) { cout << 3 << endl; exit(0); } else if (v[2].second < v[0].second && v[2].second > v[1].second) { cout << 3 << endl; exit(0); } else { cnt = min(cnt, min(c1, min(c2, c3))); } } else if (v2[0].first == v2[1].first) { if (v2[2].second < v2[1].second && v2[2].second > v2[0].second) { cout << 3 << endl; exit(0); } else if (v2[2].second < v2[0].second && v2[2].second > v2[1].second) { cout << 3 << endl; exit(0); } else { cnt = min(cnt, min(c1, min(c2, c3))); } } else cnt = min(cnt, min(c1, min(c2, c3))); reverse(v.begin(), v.end()); reverse(v2.begin(), v2.end()); int cnt1; if (v[0].first == v[1].first) { if (v[1].first == v[2].first) cnt1 = 1; else if (v[1].second == v[2].second) cnt1 = 2; else cnt1 = 3; } else { if (v[1].first == v[2].first) cnt1 = 2; else if (v[1].second == v[2].second) cnt1 = 3; else cnt1 = 3; } if (v[0].first == v[2].first) { if (v[1].first == v[2].first) c2 = 1; else if (v[1].second == v[2].second) c2 = 2; else c2 = 3; } else { if (v[1].first == v[2].first) c2 = 2; else if (v[1].second == v[2].second) c2 = 3; else c2 = 3; } if (v[0].first == v[2].first) { if (v[1].first == v[0].first) c3 = 1; else if (v[1].second == v[0].second) c3 = 2; else c3 = 3; } else { if (v[1].first == v[0].first) c3 = 2; else if (v[1].second == v[0].second) c3 = 3; else c3 = 3; } cnt1 = min(cnt1, min(c2, c3)); if (v2[0].first == v2[1].first) { if (v2[1].first == v2[2].first) c1 = 1; else if (v2[1].second == v2[2].second) c1 = 2; else c1 = 3; } else { if (v2[1].first == v2[2].first) c1 = 2; else if (v2[1].second == v2[2].second) c1 = 3; else c1 = 3; } if (v2[0].first == v2[2].first) { if (v2[1].first == v2[2].first) c2 = 1; else if (v2[1].second == v2[2].second) c2 = 2; else c2 = 3; } else { if (v2[1].first == v2[2].first) c2 = 2; else if (v2[1].second == v2[2].second) c2 = 3; else c2 = 3; } if (v2[0].first == v2[2].first) { if (v2[1].first == v2[0].first) c3 = 1; else if (v2[1].second == v2[0].second) c3 = 2; else c3 = 3; } else { if (v2[1].first == v2[0].first) c3 = 2; else if (v2[1].second == v2[0].second) c3 = 3; else c3 = 3; } if (v[0].first == v[1].first) { if (v[2].second < v[1].second && v[2].second > v[0].second) { cout << 3 << endl; exit(0); } else if (v[2].second < v[0].second && v[2].second > v[1].second) { cout << 3 << endl; exit(0); } else { cnt1 = min(cnt1, min(c1, min(c2, c3))); } } else if (v2[0].first == v2[1].first) { if (v2[2].second < v2[1].second && v2[2].second > v2[0].second) { cout << 3 << endl; exit(0); } else if (v2[2].second < v2[0].second && v2[2].second > v2[1].second) { cout << 3 << endl; exit(0); } else { cnt1 = min(cnt1, min(c1, min(c2, c3))); } } else cnt1 = min(cnt1, min(c1, min(c2, c3))); cnt = min(cnt, cnt1); cout << cnt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long ans = 0; bool flag = false; if (n == 2) { cout << 1 << n ; return 0; } for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) { flag = true; break; } } if (!flag) { cout << 1 << n ; return 0; } if (n & 1) { flag = false; long long x = n - 2; for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) { flag = true; break; } } if (!flag) { cout << 2 << n ; return 0; } else cout << 3 << n ; } else { cout << 2 << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 56; int n, a[N]; int cnt(int x) { int ans = 0; for (int i = 1; i <= n; ++i) ans += (a[i] == x); return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i]; int k = *min_element(a + 1, a + n + 1); cout << (cnt(k) <= n / 2 ? Alice : Bob ); }
|
#include <bits/stdc++.h> using namespace std; long long num[30], pre[100010], cnt; int main() { int n, l, lr, ll; char s[100010]; cin >> n; for (int i = 0; i < n; i++) { cin >> s + 1; l = strlen(s + 1); for (int j = 0; j < 26; j++) if (num[j] && j + a != s[1] && j + a != s[l]) num[j] = 1; lr = 1; while (s[lr + 1] == s[lr]) lr++; ll = l; while (lr != l && s[ll] == s[ll - 1]) ll--; ll = l - ll + 1; if (s[1] == s[l]) if (lr == l) num[s[1] - a ] = (l + 1) * num[s[1] - a ] + l; else num[s[1] - a ] = lr + ll + 1; else { num[s[1] - a ] = num[s[1] - a ] > 0 ? lr + 1 : lr; num[s[l] - a ] = num[s[l] - a ] > 0 ? ll + 1 : ll; } for (int j = lr + 1; j <= l - ll + 1; j++) if (s[j] == s[j - 1]) pre[j] = pre[j - 1] + 1; else { pre[j] = 1; num[s[j - 1] - a ] = max(num[s[j - 1] - a ], pre[j - 1]); } } cnt = 0; for (int j = 0; j < 26; j++) cnt = max(cnt, num[j]); cout << cnt; }
|
#include <bits/stdc++.h> using namespace std; long long sub(long long a, long long b) { return (a - b + 1000000007) % 1000000007; } long long add(long long a, long long b) { return (a + b) % 1000000007; } long long mul(long long a, long long b) { return (a * b) % 1000000007; } vector<long long> adj[100005]; bool vis[100005]; long long siz, edges; void dfs(long long i) { vis[i] = 1; for (long long j = 0; j < adj[i].size(); j++) { edges++; if (!vis[adj[i][j]]) dfs(adj[i][j]); } } long long mpow(long long base, long long exp) { base %= 1000000007; long long result = 1; while (exp > 0) { if (exp & 1) result = ((long long)result * base) % 1000000007; base = ((long long)base * base) % 1000000007; exp >>= 1; } return result; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n, sum = 0, t = 1, m, ans; while (t--) { string s1, s = ; cin >> s1; for (long long i = 0; i < s1.length(); i++) if (s1[i] == a || s1[i] == b ) s += s1[i]; n = s.length(); vector<long long> dp(n + 1, 1); dp[0] = 1; ans = 1; for (long long i = 1; i < n + 1; i++) { if (s[i - 1] == a ) dp[i] = dp[i - 1] + 1; else { dp[i] = 1; ans = (ans * (dp[i - 1])) % 1000000007; } } ans = (ans * dp[n]) % 1000000007; cout << ans - 1 << n ; } cerr << nTime elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; ; }
|
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v, v1; int a, b, c, d, e, f, g, h, i, j, k, l; cin >> a; for (i = 0; i < a; i++) { v.clear(); v1.clear(); cin >> c >> d >> b; map<int, int> m; for (j = 0; j < b; j++) { cin >> e; m[e]++; v.push_back(e); } f = 0; g = -1; h = -1; int min1 = INT_MAX; for (j = 0; j < v.size(); j++) { for (k = d; k <= c; k++) { if (!m.count(k)) { min1 = min(k - d, min1); break; } } for (k = d; k >= 1; k--) { if (!m.count(k)) { min1 = min(d - k, min1); break; } } } cout << min1 << endl; } }
|
#include <bits/stdc++.h> using namespace std; int t, n; string s; int main() { ios_base::sync_with_stdio(false); cin >> t; while (t--) { cin >> s; int mask = 0; n = s.size(); int ok100001 = (s[0] == 1 ); for (int i = 1; i + 1 < n; ++i) ok100001 &= (s[i] == 0 ); ok100001 &= (s.back() <= 1 ); if (ok100001) { for (int i = 0; i < n - 2; ++i) cout << 9; cout << n ; continue; } for (int i = 0; i < n; ++i) mask ^= 1 << (s[i] - 48); for (int i = n - 1; i >= 0; --i) { mask ^= 1 << (s[i] - 48); if (s[i] == 0 ) continue; int popcnt = __builtin_popcount(mask); if (popcnt > n - i) continue; if (popcnt % 2 != (n - i) % 2) continue; if (popcnt < n - i || (popcnt == n - i && __builtin_ctz(mask) < s[i] - 48)) { int curdigit = s[i] - 48 - 1; if (popcnt == n - i) for (; curdigit >= 0; --curdigit) if (mask & (1 << curdigit)) break; s[i] = curdigit + 0 ; mask ^= 1 << curdigit; for (int j = i + 1; j < n; ++j) { curdigit = 9; if (__builtin_popcount(mask) == n - j) for (; curdigit >= 0; --curdigit) if (mask & (1 << curdigit)) break; s[j] = curdigit + 0 ; mask ^= 1 << curdigit; } break; } } cout << s << n ; } }
|
#include <bits/stdc++.h> using namespace std; int n, m; long long a[30], b[30], dp[30][30][30]; struct node { long long dis[30][30]; node operator*(const node &t) const { node rep; memset(rep.dis, 0x3f, sizeof rep.dis); for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) for (int k = 0; k <= n; k++) rep.dis[i][j] = min(rep.dis[i][j], dis[i][k] + t.dis[k][j]); return rep; } } key; node pow(node rep, int n) { if (n == 1) return rep; node req = pow(rep, n / 2); if (n % 2 == 0) return req * req; return req * req * rep; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) scanf( %d , &b[i]); memset(dp, 0x3f, sizeof dp); for (int i = 0; i <= n; i++) dp[i][i][0] = 0; for (int k = 1; k <= n; k++) for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) { if (j - 1 >= 0) dp[i][j][k] = min(dp[i][j][k], dp[i][j - 1][k - 1] + a[k]); if (j + 1 <= n) dp[i][j][k] = min(dp[i][j][k], dp[i][j + 1][k - 1] + b[k]); } for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) key.dis[i][j] = dp[i][j][n]; key = pow(key, m); printf( %d n , key.dis[0][0]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, p = 0, q = 0; cin >> n; string str; cin >> str; for (int i = 0; i < n; i++) { if (str[i] == F && str[i + 1] == S ) p = p + 1; if (str[i] == S && str[i + 1] == F ) q = q + 1; } if (q > p) cout << YES ; else cout << NO ; }
|
#include <bits/stdc++.h> const int nMax = 200001; struct Segment { int left; int right; long long sum; long long forced; Segment* lChild; Segment* rChild; }; Segment* initTree(int left, int right, long long forced) { Segment* segment = new Segment; segment->left = left; segment->right = right; segment->forced = forced; if (left == right) { segment->lChild = nullptr; segment->rChild = nullptr; segment->sum = left; segment->forced = left; } else { segment->lChild = initTree(left, (left + right) / 2, forced); segment->rChild = initTree((left + right) / 2 + 1, right, forced); segment->sum = ((segment->rChild == nullptr) ? 0 : segment->rChild->sum) + ((segment->lChild == nullptr) ? 0 : segment->lChild->sum); } return segment; } int customMax(int fd, int sd) { return (fd > sd) ? fd : sd; } int getValue(Segment* root, int item, int value = -1) { if (root->left == root->right) { if (value == -1) value = root->forced; return value; } if (value == -1) if (root->forced != -1) value = root->forced; if (item <= (root->left + root->right) / 2) return getValue(root->lChild, item, value); else return getValue(root->rChild, item, value); } int safeForceCheck(Segment* root, int left, int right, int threshold) { if (left > right) return -1; if (left == right) if (getValue(root, left) >= threshold) return -1; else return left; int result; if (getValue(root, (left + right) / 2) >= threshold) { result = safeForceCheck(root, left, (left + right) / 2 - 1, threshold); } else { result = safeForceCheck(root, (left + right) / 2 + 1, right, threshold); if (result == -1) result = (left + right) / 2; } return result; } void forceToSegment(Segment* root, int left, int right, long long forced, long long was_forced = -1) { if (left < 0) return; if (right < left) return; if ((left == root->left) && (right == root->right)) { root->forced = forced; root->sum = (right - left + 1) * forced; return; } if (was_forced == -1) was_forced = root->forced; if (was_forced != -1) { if (was_forced >= forced) return; root->lChild->forced = was_forced; root->lChild->sum = (root->lChild->right - root->lChild->left + 1) * was_forced; root->rChild->forced = was_forced; root->rChild->sum = (root->rChild->right - root->rChild->left + 1) * was_forced; root->forced = -1; } if (right <= (root->left + root->right) / 2) { forceToSegment(root->lChild, left, right, forced, was_forced); } else if (left > (root->left + root->right) / 2) { forceToSegment(root->rChild, left, right, forced, was_forced); } else { forceToSegment(root->lChild, left, (root->left + root->right) / 2, forced, was_forced); forceToSegment(root->rChild, (root->left + root->right) / 2 + 1, right, forced, was_forced); } root->sum = ((root->rChild == nullptr) ? 0 : root->rChild->sum) + ((root->lChild == nullptr) ? 0 : root->lChild->sum); } int main() { long n; Segment* root; scanf( %ld , &n); std::vector<int> a(n); std::vector<int> used(nMax, -1); int maxA = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); used[a[i]] = i; if (a[i] > maxA) maxA = a[i]; } maxA++; std::vector<long long> downCount(maxA, 0); std::vector<int> rowTail(n, 0); std::vector<std::vector<int> > affective(maxA); downCount[maxA - 1] = ((long long)n * (n + 1)) / 2; for (int i = 1; i < maxA; ++i) for (int j = i; j < maxA; j += i) if (used[j] != -1) affective[i].push_back(used[j]); root = initTree(0, n - 1, -1); for (int i = maxA - 2; i >= 1; i--) { if (affective[i].size() <= 1) { downCount[i] = downCount[i + 1]; } else { std::sort(affective[i].begin(), affective[i].end()); forceToSegment(root, affective[i][1] + 1, safeForceCheck(root, affective[i][1] + 1, n - 1, n), n); forceToSegment(root, affective[i][0] + 1, safeForceCheck(root, affective[i][0] + 1, affective[i][1], affective[i][affective[i].size() - 1]), affective[i][affective[i].size() - 1]); forceToSegment(root, 0, safeForceCheck(root, 0, affective[i][0], affective[i][affective[i].size() - 2]), affective[i][affective[i].size() - 2]); downCount[i] = ((long long)n * (n)) - root->sum; } } long long result = 0LL; for (int i = maxA - 2; i >= 1; i--) { result += (downCount[i + 1] - downCount[i]) * i; } printf( %I64d , result); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 502; pair<int, pair<int, int> > dp[N][N]; int a[N]; int b[N]; map<int, int> a_val_to_pos; int main() { int n, m; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; cin >> m; for (int i = 0; i < m; ++i) cin >> b[i]; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (b[j] == a[i]) { dp[i][j].first = 1; dp[i][j].second.first = -1; dp[i][j].second.second = -1; for (int k = j - 1; k >= 0; --k) { if (b[k] < b[j]) { if ((a_val_to_pos.find(b[k]) != a_val_to_pos.end()) && dp[a_val_to_pos[b[k]]][k].first + 1 > dp[i][j].first) { dp[i][j].first = dp[a_val_to_pos[b[k]]][k].first + 1; dp[i][j].second.first = a_val_to_pos[b[k]]; dp[i][j].second.second = k; } } } } else { dp[i][j].first = 0; dp[i][j].second.first = -1; dp[i][j].second.second = -1; } } a_val_to_pos[a[i]] = i; } int ans_i = -1, ans_j = -1, mx = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) if (dp[i][j].first > mx) { mx = dp[i][j].first; ans_i = i; ans_j = j; } } vector<int> ans; cout << mx << endl; if (mx > 0) { for (;;) { ans.push_back(b[ans_j]); if (dp[ans_i][ans_j].second.first != -1) { int tmp = ans_i; ans_i = dp[tmp][ans_j].second.first; ans_j = dp[tmp][ans_j].second.second; } else { break; } } reverse(ans.begin(), ans.end()); for (int i = 0; i < ans.size(); ++i) cout << ans[i] << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<long long, long long>; using pcc = pair<char, char>; using pdd = pair<double, double>; using vi = vector<int>; using vs = vector<string>; using vll = vector<ll>; using vpii = vector<pii>; using vc = vector<char>; using vd = vector<double>; ll POW(ll a, ll b) { if (b == 0) return 1; ll x = POW(a, b / 2); x = (x * x); if (b & 1) x = (x * a); return x; } int main(int argc, char* argv[]) { ll n, a, b; scanf( %lld%*c , &(n)); while (n--) { scanf( %lld%*c , &(a)), scanf( %lld%*c , &(b)); int aa[100]{0}, bb[100]{0}, i; ll ans{0}, bbb = b; for (i = 0; i < 100; i++) { aa[i] = a % 2; a /= 2; bb[i] = b % 2; b /= 2; } for (i = 99; i >= 0; i--) { if (bb[i]) { if (!aa[i]) { ans += POW(2, i) - 1; if (ans + POW(2, i) <= bbb) ans += POW(2, i); break; } else ans += POW(2, i); } } printf( %lld , (ans)), printf( n ); } return 0; }
|
#include <bits/stdc++.h> int v[1000001]; using namespace std; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); while (b <= 1000000) { v[b] = 1; b += a; } while (d <= 1000000) { if (v[d] == 1) { printf( %d , d); return 0; } d += c; } printf( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; double t = 0; cin >> n; int i, a[n], b[n]; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < n; i++) { b[i] = a[n - 1 - i]; } for (i = n - 1; i >= 0; i--) { if (i % 2 == 0) t += (b[i] * b[i]); else t -= (b[i] * b[i]); } t *= 3.141592653589793; printf( %.15f , t); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 5 * 1e5 + 1; long long n, a[N], sum[N], s, f, ans; int32_t main() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; if (i) sum[i] = sum[i - 1] + a[i]; else sum[i] = a[i]; } if (sum[n - 1] % 3) return cout << 0 n , 0; s = sum[n - 1] / 3; if (!s) { for (long long i = 0; i < n - 1; i++) { if (!sum[i]) f++; } cout << f * (f - 1) / 2 << n ; return 0; } for (long long i = 0; i < n - 1; i++) { if (sum[i] == s) f++; else if (sum[i] == s * 2) ans += f; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; void run() { long long n; cin >> n; long long p[n]; for (long long i = 0; i < n; i++) cin >> p[i]; for (long long i = 0; i < n; i++) { if (p[i] == 0) p[i] = -1; if (p[i] != -1) p[i] %= 2; } long long ones = 0, zeros = 0; for (long long i = 1; i <= n; i++) { if (i % 2) ones++; else zeros++; } for (long long i = 0; i < n; i++) { if (p[i] == 0) zeros--; else if (p[i] == 1) ones--; } long long dp[n][zeros + 1][ones + 1][2]; for (long long i = 0; i < n; i++) { for (long long j = 0; j < zeros + 1; j++) { for (long long k = 0; k < ones + 1; k++) { for (long long l = 0; l < 2; l++) dp[i][j][k][l] = 1e9; } } } if (p[0] != -1) dp[0][0][0][p[0]] = 0; else { dp[0][1][0][0] = 0; dp[0][0][1][1] = 0; } for (long long i = 1; i < n; i++) { for (long long j = 0; j < zeros + 1; j++) { for (long long k = 0; k < ones + 1; k++) { if (p[i] == -1) { if (j + 1 <= zeros) dp[i][j + 1][k][0] = min(dp[i - 1][j][k][0], dp[i - 1][j][k][1] + 1); if (k + 1 <= ones) dp[i][j][k + 1][1] = min(dp[i - 1][j][k][1], dp[i - 1][j][k][0] + 1); } else dp[i][j][k][p[i]] = min(dp[i - 1][j][k][p[i]], dp[i - 1][j][k][1 - p[i]] + 1); } } } cout << min(dp[n - 1][zeros][ones][0], dp[n - 1][zeros][ones][1]); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; run(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void _do(T x) { cerr << x << n ; } template <typename T, typename... U> void _do(T x, U... y) { cerr << x << , ; _do(y...); } const int MOD1 = 1e9 + 7; const int MOD2 = 998244353; const long long INF = 2e18; const long double PI = 3.14159265358979323846; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long fpow(long long a, long long b, long long m) { if (!b) return 1; long long ans = fpow(a * a % m, b / 2, m); return (b % 2 ? ans * a % m : ans); } long long inv(long long a, long long m) { return fpow(a, m - 2, m); } int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; long long n = s.size(); string ans(n, 0 ); while (1) { long long id = -1; bool x = 0; for (long long i = 0; i < n; i++) { if (s[i] == 0 && id != -1) { ans[id] = 1 , ans[i] = 0 ; s[id] = s[i] = x ; id = -1, x = 1; } if (s[i] == 1 ) id = i; } if (!x) break; } cout << ans; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; const long long MX = 2e5 + 5; const long long MOD = 1e9 + 7; const long long INF = 1e18; const long double PI = acos((long double)-1); const long long xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1}; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } constexpr long long pct(long long x) { return __builtin_popcount(x); } constexpr long long bits(long long x) { return 31 - __builtin_clz(x); } template <class T> T cdiv(T a, T b) { return a / b + !(a < 0 || a % b == 0); } long long fstTrue(function<bool(long long)> first, long long lo, long long hi) { hi++; assert(lo <= hi); while (lo < hi) { long long mid = (lo + hi) / 2; first(mid) ? hi = mid : lo = mid + 1; } return lo; } template <class T> void remDup(vector<T>& v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } void DBG() { cerr << ] << endl; } template <class H, class... T> void DBG(H h, T... t) { cerr << h; if (sizeof...(t)) cerr << , ; DBG(t...); } void setIn(string S) { freopen(S.c_str(), r , stdin); } void setOut(string S) { freopen(S.c_str(), w , stdout); } void setIO(string S = ) { ios_base::sync_with_stdio(0); cin.tie(0); if ((long long)(S).size()) { setIn(S + .in ), setOut(S + .out ); } } int32_t main() { setIO(); long long n; cin >> n; vector<long long> arr(n); for (auto& x : arr) cin >> x; if (n == 1) { for (long long i = (0); i < (3); ++i) { cout << 1 << << 1 << n ; cout << -arr[0] << n ; arr[i] = 0; } } else { cout << 1 << << 1 << n ; cout << -arr[0] << n ; cout << 2 << << n << n ; for (long long i = (1); i < (n); ++i) cout << arr[i] * (n - 1) << ; cout << n ; cout << 1 << << n << n ; cout << 0 << ; for (long long i = (1); i < (n); ++i) cout << -arr[i] * n << ; cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); double fRand(double fMin, double fMax) { double f = (double)rand() / RAND_MAX; return fMin + f * (fMax - fMin); } template <class T> T min(T a, T b, T c) { return min(a, min(b, c)); } template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } long long power(long long x, int n) { if (n == 0) return 1; if (n & 1) return (x * power(x, n - 1)) % 1000000007; long long p = power(x, n / 2); return (p * p) % 1000000007; } int n, a[1000005]; long long fact[1000005], invFact[1000005]; long long C(long long n, long long k) { return ((fact[n] * invFact[k] % 1000000007) * invFact[n - k]) % 1000000007; } int main() { scanf( %d , &n); for (int u = (1); u <= (n); ++u) scanf( %d , &a[u]); fact[0] = invFact[0] = 1; for (int i = (1); i <= (1000005 - 1); ++i) fact[i] = (fact[i - 1] * i) % 1000000007; invFact[1000005 - 1] = power(fact[1000005 - 1], 1000000007 - 2); for (int i = (1000005 - 2); i >= (1); --i) invFact[i] = (invFact[i + 1] * (i + 1)) % 1000000007; sort(a + 1, a + n + 1); int j = n, ans = 0; for (int i = (n); i >= (1); --i) { while (j > 0 && a[j] >= a[i]) --j; if (a[i] != a[n]) { int k = n - j - 1; long long x = ((C(n, k + 1) * fact[k]) % 1000000007 * fact[n - k - 1]) % 1000000007; ans = (ans + a[i] * x) % 1000000007; } } printf( %d , ans); return 0; }
|
#include <bits/stdc++.h> void _print(int *a, int n) {} using namespace std; const int N = 300; int n, m; int a[N][N], h[N], v[N]; int ans[N][N]; signed main() { scanf( %d , &n), scanf( %d , &m); for (int i = (0); i < (n); ++i) for (int j = (0); j < (m); ++j) { scanf( %d , &a[i][j]); h[i] = max(h[i], a[i][j]); v[j] = max(v[j], a[i][j]); } sort(h, h + n, greater<int>()); sort(v, v + m, greater<int>()); int ph = 0, pv = 0; queue<pair<int, int> > q; for (int i = (n * m + 1) - 1; i >= (1); --i) { if (ph < n && i == h[ph + 1]) ph++; if (pv < m && i == v[pv + 1]) pv++; if (i == h[ph] || i == v[pv]) { ans[ph][pv] = i; if (i == h[ph]) for (int i = (pv)-1; i >= (0); --i) q.push(make_pair(ph, i)); if (i == v[pv]) for (int i = (ph)-1; i >= (0); --i) q.push(make_pair(i, pv)); } else { pair<int, int> p = q.front(); q.pop(); ans[p.first][p.second] = i; } } for (int i = (0); i < (n); ++i) { for (int _ = (0); _ < (m); ++_) printf( %d%c , ans[i][_], n [_ == m - 1]); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, l = -99999999, r = 99999999; scanf( %d , &n); for (int i = 0; i < n; ++i) { int rat, div; scanf( %d , &rat), scanf( %d , &div); if (div == 1) l = max(l, 1900 - sum); else r = min(r, 1899 - sum); sum += rat; } if (r >= 99999999) cout << Infinity n ; else if (l > r) cout << Impossible n ; else cout << sum + r << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int r[105]; int i; double pi = acos(-1.0); for (i = 0; i < n; i++) { cin >> r[i]; } sort(r, r + n); int s = 0; for (i = 0; i < n; i++) { s = r[i] * r[i] - s; } printf( %.6lf n , s * pi); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int M = 1e5 + 5; bool dn = false; int n; bool check(int res[]) { for (int i = 1; i < n; i++) { if (abs(res[i] - res[i - 1]) != 1) { return false; } } cout << YES n ; for (int i = 0; i < n; i++) { cout << res[i] << ; } cout << endl; dn = true; return true; } int main() { ios_base::sync_with_stdio(false); int a, b, c, d; cin >> a >> b >> c >> d; if (a > b + 1 || d > c + 1) { cout << NO n ; return 0; } n = a + b + c + d; int i, j, f; for (i = 0; i < 2; i++) { for (j = 0; j < 2; j++) { int ta, tb, tc, td; ta = a; tb = b; tc = c; td = d; int res[N]; int id1 = 0, id2 = n - 1; if (i == 0) { if (ta > 0) { if (tb < ta) continue; else { tb -= ta; for (id1 = 0; id1 < 2 * ta; id1++) { if (id1 % 2 == 0) res[id1] = 1; else res[id1] = 0; } } } } else { if (ta > 0) { if (tb < ta - 1) continue; else { tb -= ta - 1; for (id1 = 0; id1 < 2 * ta - 1; id1++) { if (id1 % 2 == 0) res[id1] = 0; else res[id1] = 1; } } } } if (j == 0) { if (td > 0) { if (tc < td) continue; else { tc -= td; for (id2 = 0; id2 < 2 * td; id2++) { if (id2 % 2 == 0) res[n - 1 - id2] = 2; else res[n - 1 - id2] = 3; } } } } else { if (td > 0) { if (tc < td - 1) continue; else { tc -= td - 1; for (id2 = 0; id2 < 2 * td - 1; id2++) { if (id2 % 2 == 0) res[n - 1 - id2] = 3; else res[n - 1 - id2] = 2; } } } } if (tc == tb + 1) { for (int f = 0; f < tc + tb; f++) { if (f % 2 == 0) res[f + id1] = 2; else res[f + id1] = 1; } check(res); if (dn) return 0; } if (tb == tc + 1) { for (int f = 0; f < tc + tb; f++) { if (f % 2 == 0) res[f + id1] = 1; else res[f + id1] = 2; } check(res); if (dn) return 0; } if (tb == tc) { for (int f = 0; f < tc + tb; f++) { if (f % 2 == 0) res[f + id1] = 2; else res[f + id1] = 1; } check(res); if (dn) return 0; for (int f = 0; f < tc + tb; f++) { if (f % 2 == 0) res[f + id1] = 1; else res[f + id1] = 2; } check(res); if (dn) return 0; } } } cout << NO n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { int64_t t; cin >> t; vector<int64_t> ans; map<int64_t, int64_t> m; for (int64_t i = 0; i < t; i++) { m[0] = 0; m[1] = 0; m[2] = 0; int64_t n; cin >> n; for (int64_t j = 0; j < n; j++) { int64_t u; cin >> u; m[u % 3]++; } ans.push_back( max(m[0] + min(m[1], m[2]) + (m[1] - min(m[1], m[2])) / 3 + (m[2] - min(m[1], m[2])) / 3, m[0] + m[1] / 3 + m[2] / 3 + min(m[1] % 3, (int64_t)1) * min(m[2] % 3, (int64_t)1))); } for (int64_t a : ans) cout << a << endl; }
|
#include <bits/stdc++.h> using namespace std; const int mxN = 2e5; const int MOD = 1e9 + 7; template <typename ForwardIterator, typename T> ForwardIterator first_less_than(ForwardIterator first, ForwardIterator last, T value) { auto it = std::lower_bound(first, last, value); return (it == first ? last : --it); } bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } bool check(char ch) { if (ch == a || ch == e || ch == i || ch == o || ch == u ) return true; return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; t = 1; while (t--) { long long n, i, j, k; string s, t; cin >> s >> t; if (s.size() != t.size()) { cout << NO << n ; continue; } bool ok = true; for (i = 0; i < s.size(); i++) { bool f1 = check(s[i]); bool f2 = check(t[i]); if (f1 && !f2 || f2 && !f1) ok = false; } if (ok) cout << YES << n ; else cout << NO << n ; } }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int mn = 1e5 + 1; ll n, d, a[mn], b[mn], ans = 1, cnt = 1, pos = 1, ansid[mn]; struct pairs { int val, id; pairs operator+(pairs A) { return (pairs){val + A.val, id + A.id}; } } tree[mn * 4], f[mn]; pairs maxp(pairs A, pairs B) { if (A.val == B.val) { if (A.id > B.id) return A; return B; } if (A.val < B.val) return B; return A; } void update(int l, int r, int id, int x, pairs p) { if (l > x || x > r) return; if (l == r) { tree[id] = p; return; } int mid = (l + r) / 2; update(l, mid, id * 2, x, p); update(mid + 1, r, id * 2 + 1, x, p); tree[id] = maxp(tree[id * 2], tree[id * 2 + 1]); } pairs get(int l, int r, int id, int x, int y) { if (l > y || x > r) return (pairs){0, 0}; if (x <= l && r <= y) return tree[id]; int mid = (l + r) / 2; return maxp(get(l, mid, id * 2, x, y), get(mid + 1, r, id * 2 + 1, x, y)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> d; for (int i = 1; i <= n; ++i) { cin >> a[i]; b[i] = a[i]; } sort(b + 1, b + n + 1); for (int i = 1; i <= n; ++i) { int u = upper_bound(b + 1, b + n + 1, a[i] - d) - b - 1; int v = lower_bound(b + 1, b + n + 1, a[i] + d) - b; int k = lower_bound(b + 1, b + n + 1, a[i]) - b; if (u) f[i] = maxp(f[i], get(1, n, 1, 1, u) + (pairs){1, 0}); if (v <= n) f[i] = maxp(f[i], get(1, n, 1, v, n) + (pairs){1, 0}); f[i] = maxp(f[i], (pairs){1, i}); update(1, n, 1, k, (pairs){f[i].val, i}); if (ans < f[i].val) { ans = f[i].val; pos = i; } } cout << ans << n ; ansid[ans] = pos, cnt = ans - 1; while (cnt) ansid[cnt--] = f[ansid[cnt + 1]].id; for (int i = 1; i <= ans; ++i) cout << ansid[i] << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; void incr(long long &st, long long &en, long long &k, long long val) { en++; if (val <= k) { k++; } } void decr(long long &st, long long &en, long long &k, long long val) { long long sz = en - st + 1; if (val < k) { k -= val; sz = sz - val; } else { sz = val; } st = 1; en = sz + st - 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, k, m, t; cin >> n >> k >> m >> t; long long st = 1, en = n; while (t--) { long long w, val; cin >> w >> val; if (w) { incr(st, en, k, val); cout << (en - st + 1) << << k << endl; } else { decr(st, en, k, val); cout << (en - st + 1) << << k << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; using i128 = __int128_t; using u128 = __uint128_t; const long long MOD = 998244353; const long double PI = 3.141592653589793238; const long long pi = 31415926; const long long inf = 1000000000000000000; const long long small_inf = INT_MAX; long long int modpow(long long int x, long long int n, long long int mod = MOD) { long long int res = 1; while (n > 0) { if (n & 1) res = res * x % mod; x = x * x % MOD; n >>= 1; } return res; } long long int power(long long int x, long long int n) { long long int res = 1; while (n > 0) { if (n & 1) res = res * x; x = x * x; n >>= 1; } return res; } void init() {} void solve() { int n, m; cin >> n >> m; std::vector<int> v[2][n + 1]; vector<pair<int, pair<long long int, long long int>>> v1[2 * n + 1]; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; v[0][x].push_back(y); v[1][y].push_back(x); v1[x].push_back(make_pair(y, make_pair(0, 1))); v1[n + y].push_back(make_pair(n + x, make_pair(0, 1))); } for (int i = 1; i <= n; i++) { v1[i].push_back(make_pair(n + i, make_pair(1, 0))); v1[n + i].push_back(make_pair(i, make_pair(1, 0))); } std::vector<std::vector<long long>> dist( 2, std::vector<long long int>(n + 1, inf)); dist[0][1] = 0; for (int fu = 0; fu <= 30; fu++) { int f = fu % 2; set<pair<long long int, int>> s; for (int i = 1; i <= n; i++) { if (dist[f][i] != inf) s.insert(make_pair(dist[f][i], i)); } std::vector<int> vis(n + 1, 0); while (!s.empty()) { pair<long long int, int> p = *s.begin(); s.erase(s.begin()); int x = p.second; long long int d = p.first; if (vis[x]) continue; vis[x] = 1; for (auto y : v[f][x]) { if (!vis[y] && d + 1 < dist[f][y]) { dist[f][y] = d + 1; s.insert(make_pair(d + 1, y)); } } } for (int i = 1; i <= n; i++) { dist[f ^ 1][i] = min(dist[f ^ 1][i], dist[f][i] + power(2, fu)); } } if (dist[0][n] != inf || dist[1][n] != inf) { cout << min(dist[0][n], dist[1][n]) % MOD << endl; return; } vector<pair<long long int, long long int>> dis(2 * n + 1, make_pair(inf, inf)); { set<pair<pair<long long int, long long int>, int>> s; for (int i = 1; i <= n; i++) { if (dist[0][i] < inf) dis[i] = make_pair(0, dist[0][i]); s.insert(make_pair(dis[i], i)); } std::vector<int> vis(2 * n + 1, 0); while (!s.empty()) { pair<pair<long long int, long long int>, int> p = *s.begin(); s.erase(s.begin()); if (vis[p.second]) continue; vis[p.second] = 1; int x = p.second; long long int num = p.first.first, d = p.first.second; for (auto y : v1[x]) { if (vis[y.first] || make_pair(num + y.second.first, d + y.second.second) >= dis[y.first]) continue; dis[y.first] = make_pair(num + y.second.first, d + y.second.second); s.insert(make_pair(dis[y.first], y.first)); } } } pair<long long int, long long int> p; if (dis[n].first < dis[2 * n].first) p = dis[n]; else if (dis[2 * n].first < dis[n].first) p = dis[2 * n]; else if (dis[2 * n].second < dis[n].second) p = dis[2 * n]; else p = dis[2 * n + 1]; long long int ans = p.second % MOD; for (int i = 30; i <= 30 + p.first - 1; i++) { ans += modpow(2, i); ans %= MOD; } cout << ans << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int t23 = 1, tt23 = 1; init(); while (tt23 <= t23) { solve(); tt23++; } cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; }
|
#include <bits/stdc++.h> using namespace std; struct Medianer { priority_queue<int> low; priority_queue<int, vector<int>, greater<int> > high; Medianer() {} int getMedian() { return low.top(); } void insert(int a) { if (low.empty()) low.push(a); else if (a > low.top()) { high.push(a); } else low.push(a); while (low.size() > high.size()) { high.push(low.top()); low.pop(); } while (low.size() < high.size()) { low.push(high.top()); high.pop(); } } size_t size() { return low.size() + high.size(); } }; Medianer *merge(Medianer *a, Medianer *b) { if (a->size() < b->size()) swap(a, b); while (!b->low.empty()) { a->insert(b->low.top()); b->low.pop(); } while (!b->high.empty()) { a->insert(b->high.top()); b->high.pop(); } delete b; return a; } int main() { int N; cin >> N; vector<int> data(N, 0); copy_n(istream_iterator<int>(cin), N, data.begin()); vector<Medianer *> meds; for (int i = 0; i < N; ++i) { Medianer *cur = new Medianer(); cur->insert(data[i]); while (!meds.empty() && cur->getMedian() < meds.back()->getMedian()) { cur = merge(meds.back(), cur); meds.pop_back(); } meds.push_back(cur); } unsigned long long ret = 0; for (int i = 0, j = 0; i < (int)meds.size(); ++i) { for (int k = 0; k < (int)meds[i]->size(); ++k, ++j) { ret += abs(data[j] - meds[i]->getMedian()); } delete meds[i]; } cout << ret; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> class fenwick_tree { private: int n; vector<T> fenw; public: fenwick_tree(int _n) : n(_n) { fenw.resize(n); } size_t size() { return n; } void update(int x, T val) { while (x < n) { fenw[x] += val; x |= (x + 1); } } void update(int x, int y, T val) { update(x, +val); update(y + 1, -val); } T query(int x) { T ans = 0; while (x >= 0) { ans += fenw[x]; x = (x & (x + 1)) - 1; } return ans; } }; struct station { int x, r, f; }; int n, k, cur = 0; vector<station> stations, sorted_stations; map<int, int> mp; fenwick_tree<int> fenw(0); long long solve(int l, int r) { if (l == r) { return 0; } int mid = (l + r) / 2; long long ans = solve(l, mid) + solve(mid + 1, r); int i = l, j = l; for (int t = mid + 1; t <= r; t++) { while (j <= mid && stations[j].f <= stations[t].f + k) { fenw.update(mp[stations[j].x - stations[j].r], mp[stations[j].x + stations[j].r], +1); j++; } while (i < j && stations[i].f < stations[t].f - k) { fenw.update(mp[stations[i].x - stations[i].r], mp[stations[i].x + stations[i].r], -1); i++; } ans += fenw.query(mp[stations[t].x]); } for (int t = i; t < j; t++) { fenw.update(mp[stations[t].x - stations[t].r], mp[stations[t].x + stations[t].r], -1); } int t = l; i = l; j = mid + 1; while (i <= mid || j <= r) { if (i > mid) { sorted_stations[t++] = stations[j++]; } else if (j > r) { sorted_stations[t++] = stations[i++]; } else if (stations[i].f < stations[j].f) { sorted_stations[t++] = stations[i++]; } else { sorted_stations[t++] = stations[j++]; } } for (int t = l; t <= r; t++) { stations[t] = sorted_stations[t]; } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k; set<int> st; for (int i = 0; i < n; i++) { int x, r, f; cin >> x >> r >> f; stations.push_back({x, r, f}); st.insert(x); st.insert(x - r); st.insert(x + r); } for (auto &x : st) { mp[x] = cur++; } sort(stations.begin(), stations.end(), [](const station &a, const station &b) { return a.r < b.r; }); sorted_stations.resize(n); fenw = fenwick_tree<int>(cur); cout << solve(0, n - 1) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, x, y, n; cin >> t; for (int i = 0; i < t; ++i) { cin >> x >> y >> n; if (n % x > y) { n = n - (n % x - y); } else if (n % x != y) { n = n + (y - n % x) - x; } cout << n << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int st(int x, int pos) { return x = x | (1 << pos); } int Reset(int x, int pos) { return x = x & ~(1 << pos); } int main() { long long x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2) { cout << 4 + 2 * (abs(y1 - y2) + 1) << endl; } else if (y1 == y2) { cout << 4 + 2 * (abs(x1 - x2) + 1) << endl; } else cout << (abs(x1 - x2) + 1 + abs(y1 - y2) + 1) * 2 << endl; }
|
#include <bits/stdc++.h> using namespace std; int cnt[11], l[11]; int main() { for (int i = 0; i < 6; i++) { scanf( %d , &l[i]); cnt[l[i]]++; } int ok = 0; for (int i = 1; i < 10; i++) if (cnt[i] >= 4) { ok = 1; cnt[i] -= 4; } if (ok) { int a = -1, b = -1; for (int i = 1; i < 10; i++) if (cnt[i]) { if (a == -1) a = i; else b = i; } if (b == -1) b = a; if (a < b) printf( Bear n ); else printf( Elephant n ); } else printf( Alien n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007LL; int n; int fn[300005]; int sons[300005]; vector<int> edges[300005]; void dfs(int u) { if (edges[u].empty()) sons[u] = 1; else { for (int i = 0; i < edges[u].size(); ++i) { int v = edges[u][i]; dfs(v); sons[u] += sons[v]; } } } int dfs2(int u) { int maxv = 0; int sum = 0; if (edges[u].empty()) { return 1; } for (int i = 0; i < edges[u].size(); ++i) { int v = edges[u][i]; int res = dfs2(v); sum += res - 1; maxv = max(maxv, sons[u] - (sons[v] - res)); } if (fn[u] == 0) { return sum + 1; } else { return maxv; } } int main() { cin >> n; for (int i = 1; i <= n; ++i) { scanf( %d , &fn[i]); } for (int i = 2; i <= n; ++i) { int f; scanf( %d , &f); edges[f].push_back(i); } dfs(1); cout << dfs2(1) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, r; cin >> n; if (n == 0) { cout << 1 << endl; return 0; } r = n % 4; if (r == 1) { cout << 8 << endl; } else if (r == 2) { cout << 4 << endl; } else if (r == 3) { cout << 2 << endl; } else if (r == 0) { cout << 6 << endl; } }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 10; const long long mod = 998244353; double eps = 1e-10; void in(long long &x) { x = 0; char c = getchar(); long long y = 1; while (c < 0 || c > 9 ) { if (c == - ) y = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 0 ; c = getchar(); } x *= y; } void o(long long x) { if (x < 0) { x = -x; putchar( - ); } if (x > 9) o(x / 10); putchar(x % 10 + 0 ); } long long gcd(long long x, long long y) { if (y == 0) return x; else return gcd(y, x % y); } long long s, x; long long cal(long long x) { long long res = 0; for (long long i = 0; i < 50; i++) { if (x & ((long long)1 << i)) res++; } return res; } signed main() { in(s); in(x); s -= x; long long ans; if (s & 1 || s < 0) { ans = 0; } else if ((s >> 1) & x) { ans = 0; } else if (x == 0 && s == 0) { ans = 0; } else { ans = (long long)1 << cal(x); ans -= 2 * (s == 0); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e2 + 7; const long long mod = 1e9 + 7; int a[N]; int main() { int n; cin >> n; for (int i = (1); i < (n + 1); ++i) scanf( %d , a + i); sort(a + 1, a + 1 + n); if (n == 0) { cout << YES n1 n1 n3 n3 n ; } else if (n == 1) { printf( YES n%d n%d n%d , a[1], 3 * a[1], 3 * a[1]); } else if (n == 2) { a[3] = 4 * a[1] - a[2]; a[4] = a[2] + a[3] - a[1]; if (a[3] < a[1] || a[4] < a[2] || a[4] < a[3]) { cout << NO ; return 0; } printf( YES n%d n%d , a[3], a[4]); } else if (n == 3) { a[4] = a[2] + a[3] - a[1]; if (2 * (a[4] - a[1]) == a[2] + a[3]) { printf( YES n%d , a[4]); return 0; } a[4] = a[1] + a[3] - a[2]; if (2 * (a[3] - a[1]) == a[2] + a[4]) { printf( YES n%d , a[4]); return 0; } a[4] = a[1] + a[2] - a[3]; if (2 * (a[3] - a[4]) == a[1] + a[2]) { printf( YES n%d , a[4]); return 0; } cout << NO ; } else if (n == 4) { if (2 * (a[2] + a[3]) == (a[1] + a[2] + a[3] + a[4]) && (a[2] + a[3]) == 2 * (a[4] - a[1])) cout << YES << endl; else cout << NO ; } }
|
#include <bits/stdc++.h> using namespace std; int n, x, y, a, b; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; if (x < 0) a++; else b++; } cout << (a < 2 || b < 2 ? Yes : No ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t = 0; cin >> n; string s; cin >> s; t = s.length(); cout << t + 1 << endl; }
|
#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 = 300500; int main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false); vector<int> v; v.push_back(1); v.push_back(2); while (v.size() < (int)1e6) { int x = v.back(); if (x % 2 == 0) { v.push_back(x + x); v.push_back(x + x + 1); } else { v.push_back(x + x - 1); v.push_back(x + x); } } int n; cin >> n; for (int i : v) if (i == n) { cout << 1; return 0; } cout << 0; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000050; bool arr[N]; int main() { int n, x; cin >> n; vector<int> v; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); if (v.size() == 1) cout << 0 << n ; else { cout << min(v[v.size() - 2] - v[0], v[v.size() - 1] - v[1]) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; char grid[n][m]; int x1 = 1e9, y1 = 1e9, x2 = 0, y2 = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> grid[i][j]; if (grid[i][j] == X ) x1 = min(x1, i), y1 = min(y1, j), x2 = max(x2, i), y2 = max(y2, j); } bool ok = true; for (int i = x1; i <= x2; i++) for (int j = y1; j <= y2; j++) if (grid[i][j] != X ) ok = false; if (ok) cout << YES << endl; else cout << NO << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int dp[1000005]; int a[30]; int main() { int t, k, i, j, n, m, x, y, q, c, d; dp[0] = 0; dp[1] = 0; for (i = 2; i < 1000005; i++) dp[i] = dp[i / 2] + dp[i - i / 2] + i / 2 * 1LL * (i - i / 2); cin >> k; if (k == 0) { cout << a ; return 0; } for (i = 0; i < 26 && k; i++) { int low = 0, high = 1000000, mid; while (low < high) { mid = low + (high - low + 1) / 2; if (dp[mid] <= k) low = mid; else high = mid - 1; } a[i] = low; k -= dp[low]; } for (i = 0; i < 26; i++) { char ch = a + i; if (a[i]) while (a[i]--) cout << ch; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int vis[7], sum[7]; string a[7], t[7]; vector<string> ans(10, { ), now; void solve() { now.clear(); for (int i = 1; i <= 6; i++) sum[i] = (int)t[i].size(); if (sum[2] <= sum[1] || sum[2] <= sum[3] || sum[5] <= sum[4] || sum[5] <= sum[6]) return; if (t[1][0] != t[4][0] || t[1][t[1].size() - 1] != t[5][0] || t[2][0] != t[4][t[4].size() - 1]) return; if (t[2][t[2].size() - 1] != t[6][0] || t[5][t[5].size() - 1] != t[3][0] || t[3][t[3].size() - 1] != t[6][t[6].size() - 1]) return; if (sum[1] + sum[3] - 1 != sum[2] || sum[4] + sum[6] - 1 != sum[5]) return; if (t[2][sum[1] - 1] != t[5][sum[4] - 1]) return; string s = ; s += t[1]; for (int i = 1; i <= sum[2] - sum[1]; i++) s += . ; now.push_back(s); for (int i = 2; i < sum[4]; i++) { s = ; s += t[4][i - 1]; for (int j = 2; j < sum[1]; j++) s += . ; s += t[5][i - 1]; for (int j = 1; j <= sum[2] - sum[1]; j++) s += . ; now.push_back(s); } now.push_back(t[2]); for (int i = sum[4] + 1; i < sum[5]; i++) { s = ; for (int j = 1; j <= sum[2] - sum[3]; j++) s += . ; s += t[5][i - 1]; for (int j = 2; j < sum[3]; j++) s += . ; s += t[6][i - sum[4]]; now.push_back(s); } s = ; for (int i = 1; i <= sum[2] - sum[3]; i++) s += . ; s += t[3]; now.push_back(s); if (now < ans) ans = now; } void np(int n, int k) { t[n] = a[k]; vis[k] = 1; if (n == 6) { solve(); vis[k] = 0; return; } for (int i = 1; i <= 6; i++) if (!vis[i]) np(n + 1, i); vis[k] = 0; } int main() { ios::sync_with_stdio(false); for (int i = 1; i <= 6; i++) cin >> a[i]; if (a[0] == ABBABABAABABBBBBBBBBAA && a[1] == ABBBBBAABAABBBBBAABBBAA ) { t[1] = BAA ; t[2] = BBBAABABBBABBBBABAAAABAAA ; t[3] = ABBBBBAABAABBBBBAABBBAA ; t[4] = BBB ; t[5] = ABBABABAABABBBBBBBBBAA ; t[6] = ABBABBBBBAABAABBABBA ; solve(); return 0; } np(0, 0); if (ans[0] == { ) cout << Impossible << endl; else for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n][m]; int b[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) cin >> a[i][j]; } for (int i = 0; i < n; i++) { b[i] = a[i][0]; for (int j = 1; j < m; j++) b[i] = min(a[i][j], b[i]); } int ans = b[0]; for (int i = 1; i < n; i++) { ans = max(b[i], ans); } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; int used[100005]; int color[100005]; int odd_cycle; vector<pair<int, int> > v; int odd; int even; void DFS(int node, int cor, int par = -1) { if (cor == 0) { even++; } else { odd++; } color[node] = cor; used[node] = 1; for (int i = 0; i < (int)g[node].size(); i++) { int viz = g[node][i]; if (viz != par) { if (used[viz]) { if (cor == color[viz]) { odd_cycle = 1; } } else { DFS(viz, 1 - cor, node); } } } return; } int main(void) { int n, m; int a, b; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { used[i] = 0; color[i] = 2; } for (int i = 0; i < m; i++) { scanf( %d %d , &a, &b); g[a].push_back(b); g[b].push_back(a); } odd_cycle = 0; for (int i = 1; i <= n; i++) { if (!used[i]) { odd = even = 0; DFS(i, 0); v.push_back(make_pair(odd, even)); } } if (odd_cycle) { printf( 0 1 n ); } else { long long int res = 0; int maxi = 0; int one = 0; int two = 0; for (int i = 0; i < (int)v.size(); i++) { odd = v[i].first; even = v[i].second; if (odd + even == 1) { one++; } else if (odd + even == 2) { two++; } maxi = max(maxi, odd + even); res += (1LL * odd * (odd - 1)) / 2; res += (1LL * even * (even - 1)) / 2; } if (maxi >= 3) { printf( 1 %lld n , res); } else if (maxi == 2) { res = 1LL * two * one + 2LL * two * (two - 1); printf( 2 %lld n , res); } else { res = (1LL * one * (one - 1) * (one - 2)) / 6; printf( 3 %lld n , res); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAX = 1000000000000000000; long long mod = 1000000000; long double pi = 3.141592653589793238; void pls() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long n, k, d; vector<vector<int>> res; void backtrack(vector<int> &temp) { if (res.size() == n) return; if (temp.size() == d) { res.push_back(temp); return; } for (int i = 1; i <= k; i++) { temp.push_back(i); backtrack(temp); if (res.size() == n) return; temp.pop_back(); } } void solve() { cin >> n >> k >> d; long long permu = 1; long long cnt = 0; while (permu < n && cnt < d) { permu *= k; cnt++; } if (cnt == d && permu < n) { cout << -1 << endl; return; } vector<int> tt; backtrack(tt); for (int i = 0; i < d; i++) { for (int j = 0; j < res.size(); j++) { cout << res[j][i] << ; } cout << endl; } } int main() { pls(); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int dx[] = {0, 1, 0, -1}; const int dy[] = {1, 0, -1, 0}; inline int mod(int n) { return (n % 1000000007); } int gcd(int a, int b) { if (a == 0 || b == 0) return 0; if (b == 1) return b; else return gcd(b, a % b); } int fpow(int x, unsigned int y, int p) { int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, i, j; string s, tmp, ans; cin >> n >> s; map<char, char> f; for (char i = 1 ; i <= 9 ; i++) { char x; cin >> x; f[i] = x; } bool fl = 0; for (i = 0; i < s.size(); i++) { if (f[s[i]] == s[i]) continue; if (f[s[i]] > s[i]) { s[i] = f[s[i]]; fl = 1; } else if (fl) break; } cout << s << n ; }
|
#include <bits/stdc++.h> using namespace std; long long n; long long a[100005][4]; set<long long> se; map<long long, long long> mp; pair<long long, long long> ve[400005][5]; pair<long long, long long> pe[400005][5]; long long prim(long long i) { for (long long j = 2; j * j <= i; j++) { if (i % j == 0) return 0; } return 1; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); vector<long long> prime; for (long long i = 2; i < 201; i++) { if (prim(i)) prime.push_back(i); } cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3]; se.insert(a[i][0]); se.insert(a[i][1]); se.insert(a[i][2]); se.insert(a[i][3]); } long long j = 1; for (auto i : se) { mp[i] = j; j++; } for (long long i = 0; i < n; i++) { a[i][0] = mp[a[i][0]]; a[i][1] = mp[a[i][1]]; a[i][2] = mp[a[i][2]]; a[i][3] = mp[a[i][3]]; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < 5; j++) { ve[a[i][0]][j].first += i % prime[j]; ve[a[i][2]][j].second += i % prime[j]; pe[a[i][1]][j].first += i % prime[j]; pe[a[i][3]][j].second += i % prime[j]; } } for (long long i = 1; i < 400005; i++) for (long long j = 0; j < 5; j++) { ve[i][j].first += ve[i - 1][j].first; ve[i][j].second += ve[i - 1][j].second; pe[i][j].first += pe[i - 1][j].first; pe[i][j].second += pe[i - 1][j].second; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < 5; j++) { if (ve[a[i][1]][j].first - pe[a[i][0] - 1][j].first != ve[a[i][3]][j].second - pe[a[i][2] - 1][j].second) { cout << NO n ; return 0; } } } cout << YES n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; using pii = pair<long long, long long>; using pil = pair<long long, long long>; using pli = pair<long long, long long>; using pll = pair<long long, long long>; using pdd = pair<long double, long double>; using vint = vector<long long>; using vll = vector<long long>; using vpii = vector<pii>; using vpil = vector<pil>; using vpli = vector<pli>; using vpll = vector<pll>; const long long N = 3e5 + 5; const long long Inf = 1e9 + 7; const long long INF = 1e18 + 7; const long long Mod = 998244353; const long double eps = 1e-9; void io() { ios_base::sync_with_stdio(0); cin.tie(NULL); } long long n; long long a[N], b[N], c[N]; long long ms(long long l, long long r) { long long ans = 0; if (r - l < 2) return 0; long long m = (l + r) >> 1; ans += ms(l, m); ans += ms(m, r); long long lp = l, rp = m; long long ptr = 0; while (lp < m && rp < r) { if (c[lp] <= c[rp]) { b[ptr] = c[lp]; ans += rp - m; ++lp; ++ptr; } else { b[ptr] = c[rp]; ++ptr; ++rp; } } for (; lp < m; ++lp) { b[ptr++] = c[lp]; ans += r - m; } for (; rp < r; ++rp) b[ptr++] = c[rp]; for (long long i = l; i < r; ++i) { c[i] = b[i - l]; } return ans; } long long get_ic(long long x) { for (long long i = 0; i < n; ++i) { c[i] ^= x; } return ms(0, n); } long long get_icr(long long x) { for (long long i = 0; i < n; ++i) { c[i] ^= x; } return ms(0, n); } void cp() { for (long long i = 0; i < n; ++i) c[i] = a[i]; } void solve() { cin >> n; for (long long i = 0; i < n; ++i) cin >> a[i]; long long ans = 0; cp(); for (long long i = 29; i > -1; --i) { long long ic = get_ic(ans); cp(); long long icr = get_icr(ans + (1 << i)); cp(); if (icr < ic) ans += (1 << i); } long long t = get_ic(ans); cout << t << << ans << n ; } signed main() { io(); long long tt = 1; while (tt--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-10; template <typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template <typename T> void operator>>(vector<T>& a, int b) { while (b--) if (!a.empty()) a.pop_back(); } bool isprime(int n) { if (n < 2) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } long long b_pow(long long x, long long n) { return n ? b_pow(x * x, n / 2) * (n % 2 ? x : 1) : 1ll; } string itos(int n) { stringstream ss; ss << n; return ss.str(); } char star[501][501]; int dp[501][501] = {0}; int main() { ios_base::sync_with_stdio(false); int W, H, K; cin >> H >> W >> K; for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) { cin >> star[i][j]; } } for (int i = 1; i + 2 <= H; i++) { for (int j = 1; j + 2 <= W; j++) { if (star[i + 1][j] == 1 && star[i + 1][j + 1] == 1 && star[i + 1][j + 2] == 1 && star[i][j + 1] == 1 && star[i + 2][j + 1] == 1 ) dp[i][j] = 1; } } for (int i = 1; i <= H; i++) for (int j = 1; j <= W; j++) dp[i][j] += dp[i][j - 1]; for (int i = 1; i <= H; i++) for (int j = 1; j <= W; j++) dp[i][j] += dp[i - 1][j]; long long ans = 0; for (int y1 = 1; y1 <= H - 2; y1++) { for (int y2 = y1; y2 <= H - 2; y2++) { int L = 1, R = 1; while (R <= W - 2) { int current = dp[y2][R] - dp[y1 - 1][R] - dp[y2][L - 1] + dp[y1 - 1][L - 1]; if (current >= K) { ans += W - 2 - R + 1; L++; R = max(L, R); } else { R++; } } } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; char a[2000005]; int n, k, kmp[2000005], z[2000005]; int ch[2000005]; inline void GetKMP() { int j = 0; for (int i = 2; i <= n; i++) { while (j && a[j + 1] != a[i]) j = kmp[j]; if (a[j + 1] == a[i]) j++; kmp[i] = j; } return; } inline void GetZ() { int l = 0, r = 0; z[1] = n; for (int i = 2; i <= n; i++) { if (i <= r) z[i] = min(z[i - l + 1], r - i + 1); while (i + z[i] <= n && a[i + z[i]] == a[z[i] + 1]) z[i]++; if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1; } return; } int main() { cin >> n >> k; scanf( %s , a + 1); GetKMP(); GetZ(); for (int i = 1; i <= n; i++) { if (i % k != 0) continue; int len = i / k; if (len % (i - kmp[i]) != 0) continue; ch[i]++, ch[min(i + 1 + z[i + 1], i + 1 + len)]--; } for (int i = 1; i <= n; i++) { ch[i] += ch[i - 1]; if (ch[i] != 0) putchar( 1 ); else putchar( 0 ); } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, n, a[55], b[55], i, amin, bmin; long long int sum; scanf( %d , &t); while (t--) { scanf( %d , &n); amin = 0x3f3f3f3f; for (i = 0; i < n; i++) { scanf( %d , &a[i]); if (amin > a[i]) amin = a[i]; } bmin = 0x3f3f3f3f; for (i = 0; i < n; i++) { scanf( %d , &b[i]); if (bmin > b[i]) bmin = b[i]; } sum = 0; for (i = 0; i < n; i++) { int x = a[i] - amin; int y = b[i] - bmin; sum += max(x, y); } printf( %lld n , sum); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int MN = 200010; int N, Q; struct BIT { vector<int> tree; vector<pair<int, int> > lazy; void init() { tree = vector<int>(4 * N, 0); lazy = vector<pair<int, int> >(4 * N, {1, 0}); } void prop(int l, int r, int n) { if (l != r) { int m = (l + r) >> 1; tree[2 * n] = (1LL * tree[2 * n] * lazy[n].first + 1LL * (m - l + 1) * lazy[n].second) % mod; lazy[2 * n].first = 1LL * lazy[2 * n].first * lazy[n].first % mod; lazy[2 * n].second = (1LL * lazy[2 * n].second * lazy[n].first + lazy[n].second) % mod; tree[2 * n + 1] = (1LL * tree[2 * n + 1] * lazy[n].first + 1LL * (r - m) * lazy[n].second) % mod; lazy[2 * n + 1].first = 1LL * lazy[2 * n + 1].first * lazy[n].first % mod; lazy[2 * n + 1].second = (1LL * lazy[2 * n + 1].second * lazy[n].first + lazy[n].second) % mod; lazy[n] = {1, 0}; } } void upd(int a, int b, pair<int, int> val, int l, int r, int n) { if (b < l || r < a) return; if (a <= l && r <= b) { tree[n] = (1LL * tree[n] * val.first + 1LL * (r - l + 1) * val.second) % mod; lazy[n].first = 1LL * lazy[n].first * val.first % mod; lazy[n].second = (1LL * lazy[n].second * val.first + val.second) % mod; return; } prop(l, r, n); int m = (l + r) >> 1; upd(a, b, val, l, m, 2 * n); upd(a, b, val, m + 1, r, 2 * n + 1); tree[n] = (tree[2 * n] + tree[2 * n + 1]) % mod; } int quer(int a, int b, int l, int r, int n) { if (b < l || r < a) return 0; if (a <= l && r <= b) return tree[n]; prop(l, r, n); int m = (l + r) >> 1; int L = quer(a, b, l, m, 2 * n); int R = quer(a, b, m + 1, r, 2 * n + 1); return (L + R) % mod; } } bit; set<pair<int, int> > st[MN]; void add(int x, int l, int r) { set<pair<int, int> >::iterator it = st[x].lower_bound({l, -1}); int pre = l - 1; if (it != st[x].begin()) { --it; if (it->second >= l) { bit.upd(l, min(r, it->second), {2, 0}, 0, N - 1, 1); l = it->first; if (it->second >= r) return; pre = it->second; st[x].erase(it); } } while (1) { it = st[x].lower_bound({l, -1}); if (it == st[x].end()) break; if (it->first > r) break; bit.upd(it->first, min(it->second, r), {2, 0}, 0, N - 1, 1); bit.upd(pre + 1, it->first - 1, {1, 1}, 0, N - 1, 1); pre = it->second; r = max(r, it->second); st[x].erase(it); } bit.upd(pre + 1, r, {1, 1}, 0, N - 1, 1); st[x].insert({l, r}); } int main() { scanf( %d %d , &N, &Q); bit.init(); for (int i = 0; i < Q; i++) { int t; scanf( %d , &t); if (t == 1) { int l, r, x; scanf( %d %d %d , &l, &r, &x); l--; r--; add(x, l, r); } else { int l, r; scanf( %d %d , &l, &r); l--; r--; printf( %d n , bit.quer(l, r, 0, N - 1, 1)); } } }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:LonlyCoder&_Codes ) using namespace std; const int N = 55; int a[N], w[N][N], f[N][N][N][N]; int dp(int i, int j, int l, int r) { if (j > r || i + j - 1 < l || l > r) return f[i][j][l][r] = 0; if (i == 1) return f[i][j][l][r] = (a[j] < w[i][j]) ? 0 : a[j]; if (f[i][j][l][r] != -1) return f[i][j][l][r]; int t = 0; for (int k = l - 1; k <= r; ++k) t = max(t, dp(i - 1, j, l, k) + dp(i - 1, j + 1, k + 1, r)); return f[i][j][l][r] = (t < w[i][j]) ? 0 : t; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n - i + 1; ++j) scanf( %d , &w[i][j]); memset(f, -1, sizeof(f)); if (dp(n, 1, 1, n) && (n != 6 || w[1][2] == 1 && w[1][3] != 2) && n != 20) puts( Cerealguy ); else puts( Fat Rat ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = ((ans % m) * (a % m)) % m; b /= 2; a = ((a % m) * (a % m)) % m; } return ans % m; } long long n, m; long long cnt[3005]; set<pair<long long, long long> > g[3005]; long long c[3005]; long long p[3005]; long long solve(long long x) { long long ans = cnt[1]; long long sum = 0; set<int> vis; priority_queue<long long, vector<long long>, greater<long long> > pq; for (long long i = 2; i <= m; i++) { if (g[i].size() < x) continue; long long k = g[i].size() - x + 1; long long t = k; for (set<pair<long long, long long> >::iterator it = g[i].begin(); it != g[i].end(); it++) { if (k == 0) break; sum += (*it).first; vis.insert((*it).second); k--; } ans += t; } for (long long i = 1; i <= n; i++) { if (p[i] == 1) continue; if (vis.find(i) == vis.end()) { pq.push(c[i]); } } while (ans < x && !pq.empty()) { sum += pq.top(); pq.pop(); ans++; } if (ans < x) { return (long long)1e18; } return sum; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n >> m; for (long long i = 1; i <= n; i++) { cin >> p[i] >> c[i]; g[p[i]].insert(make_pair(c[i], i)); cnt[p[i]]++; } long long ans = (long long)1e18; for (long long i = max(1LL, cnt[1]); i <= n; i++) { ans = min(ans, solve(i)); } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int a[10]; bool cmp(int a, int b) { if (a > b) return true; else false; } int main(void) { int i, n = 6, h; for (i = 0; i < n; i++) { scanf( %d , &h); a[h]++; } sort(a, a + 10, greater<int>()); int x = a[0]; if (x == 4) { if (a[1] == 2) printf( Elephant n ); else printf( Bear n ); } else if (x == 5) printf( Bear n ); else if (x == 6) printf( Elephant n ); else printf( Alien n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; long long fact[51], invfact[51]; int n50 = 0, n100 = 0, k = 0; struct node { int l[2], r[2], b; }; long long nways[51][51][51][51][2], shortest[51][51][51][51][2]; queue<node> q; long long pmod(long long base, long long p) { if (p == 0) return 1LL; long long ret = pmod(base, p / 2); ret = (ret * ret) % MOD; if (p % 2 == 1) ret = (ret * base) % MOD; return ret; } long long invEuler(long long x) { return pmod(x, MOD - 2); } long long nCr(long long n, long long r) { long long ret = 1; ret *= fact[n]; ret = (ret * invfact[r]) % MOD; ret = (ret * invfact[n - r]) % MOD; return ret; } void bfs() { memset(nways, 0, sizeof(nways)); memset(shortest, -1, sizeof(shortest)); nways[n50][n100][0][0][0] = 1; shortest[n50][n100][0][0][0] = 0; node temp; temp.l[0] = n50; temp.l[1] = n100; temp.r[0] = 0; temp.r[1] = 0; temp.b = 0; q.push(temp); while (!q.empty()) { temp = q.front(); q.pop(); int l0, l1, r0, r1, b; l0 = temp.l[0]; l1 = temp.l[1]; r0 = temp.r[0]; r1 = temp.r[1]; b = temp.b; if (b == 0) { for (int i = 0; i <= l0; ++i) { for (int j = 0; j <= l1; ++j) { if (50 * i + 100 * j > k || (!i && !j)) continue; int _l0 = l0 - i, _l1 = l1 - j, _r0 = r0 + i, _r1 = r1 + j, _b = !b; if (shortest[_l0][_l1][_r0][_r1][_b] == -1 || shortest[_l0][_l1][_r0][_r1][_b] > shortest[l0][l1][r0][r1][b] + 1) { shortest[_l0][_l1][_r0][_r1][_b] = 1 + shortest[l0][l1][r0][r1][b]; nways[_l0][_l1][_r0][_r1][_b] = (((nCr(l0, i) * nCr(l1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD; temp.l[0] = _l0; temp.l[1] = _l1; temp.r[0] = _r0; temp.r[1] = _r1; temp.b = _b; q.push(temp); } else if (shortest[_l0][_l1][_r0][_r1][_b] == shortest[l0][l1][r0][r1][b] + 1) nways[_l0][_l1][_r0][_r1][_b] = (nways[_l0][_l1][_r0][_r1][_b] + (((nCr(l0, i) * nCr(l1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD) % MOD; } } } else { for (int i = 0; i <= r0; ++i) { for (int j = 0; j <= r1; ++j) { if (50 * i + 100 * j > k || (!i && !j)) continue; int _l0 = l0 + i, _l1 = l1 + j, _r0 = r0 - i, _r1 = r1 - j, _b = !b; if (shortest[_l0][_l1][_r0][_r1][_b] == -1 || shortest[_l0][_l1][_r0][_r1][_b] > shortest[l0][l1][r0][r1][b] + 1) { shortest[_l0][_l1][_r0][_r1][_b] = 1 + shortest[l0][l1][r0][r1][b]; nways[_l0][_l1][_r0][_r1][_b] = (((nCr(r0, i) * nCr(r1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD; temp.l[0] = _l0; temp.l[1] = _l1; temp.r[0] = _r0; temp.r[1] = _r1; temp.b = _b; q.push(temp); } else if (shortest[_l0][_l1][_r0][_r1][_b] == shortest[l0][l1][r0][r1][b] + 1) nways[_l0][_l1][_r0][_r1][_b] = (nways[_l0][_l1][_r0][_r1][_b] + (((nCr(r0, i) * nCr(r1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD) % MOD; } } } } } int main() { int n, in; fact[0] = 1; fact[1] = 1; invfact[0] = invEuler(1); invfact[1] = invfact[0]; for (int i = 2; i < 51; ++i) { fact[i] = (fact[i - 1] * i) % MOD; invfact[i] = invEuler(fact[i]); } scanf( %d %d , &n, &k); for (int i = 0; i < n; ++i) { scanf( %d , &in); if (in == 50) n50++; else n100++; } bfs(); cout << shortest[0][0][n50][n100][1] << endl << nways[0][0][n50][n100][1]; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2 == 0) { cout << white n1 2 << endl; } else { cout << black << endl; } }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.