Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> int main() { int n, i, j, r; char lvl[110]; scanf( %d , &n); scanf( %s , lvl); for (r = 1; r < n; r++) { for (i = 0; i < n; i++) { for (j = 0; j <= 4; j++) { if (i + j * r >= n || lvl[i + j * r] != * ) break; } if (j >= 5) { printf( yes n ); return 0; } } } printf( no n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int x, y; cin >> x >> y; int m = 0; while (x * 100 + y * 10 >= 220) { int kx, ky; if (m % 2 == 0) { kx = min(2, x); x -= kx; ky = (220 - 100 * kx) / 10; y -= ky; if (y < 0) break; } else { if (y >= 22) ky = 22; else if (y >= 12) ky = 12; else ky = 2; y -= ky; if (y < 0) break; kx = (220 - ky * 10) / 100; x -= kx; if (x < 0) break; } m++; } if (m % 2 == 1) { cout << Ciel n ; } else cout << Hanako n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2000 + 10; const int maxm = 4e5 + 10; const long long mod = 1e9 + 7; const int inf = 0x3f3f3f3f; const double eps = 1e-5; const double pi = acos(-1.0); int t; int n, a[maxn]; int cnt[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; while (t--) { cin >> n; vector<int> res; for (int i = 0; i <= n; i++) cnt[i] = 0; for (int i = 0; i < n; i++) { cin >> a[i]; cnt[a[i]]++; } int now; while (1) { now = 0; bool flag = false; for (int i = 1; i < n; i++) if (a[i] < a[i - 1]) flag = true; if (flag == false) break; for (int i = 0; i < n; i++) { if (cnt[i]) now = i + 1; else break; } if (now == n) { int index = 0, minnum = maxn; for (int i = 0; i < n; i++) if (a[i] != i) { if (a[i] < minnum) { index = i; minnum = a[i]; } } int p = a[index]; cnt[p]--; cnt[now]++; a[index] = now; res.push_back(index); continue; } int p = a[now]; cnt[p]--; cnt[now]++; a[now] = now; res.push_back(now); } cout << res.size() << endl; for (int i = 0; i < res.size(); i++) cout << res[i] + 1 << ; cout << endl; } return ~~(0 - 0); }
#include <bits/stdc++.h> using namespace std; const int N = 1 << 17; int st[N], op[N], sz[N], dp[N], pid[N], c[N], hd[N], p[N], f[N], g[N], add[N]; double ans[N]; vector<int> adj[N], V[N]; long long sum[N]; int T, pn; void dfs(int u) { sz[u] = 1; dp[u] = dp[p[u]] + 1; for (auto v : adj[u]) { dfs(v); sz[u] += sz[v]; } } void dfs1(int u) { st[u] = ++T; pid[u] = pn; if (!hd[pn]) hd[pn] = u; int w = 0; for (auto v : adj[u]) if (sz[v] > sz[w]) w = v; if (w) dfs1(w); for (auto v : adj[u]) { if (v != w) { pn++; dfs1(v); } } } long long ret2, ret1; void renew(int u, int l, int k) { add[u] += k; sum[u] += k * l; } void push_down(int u, int l) { if (add[u]) { renew(u + u, (l + 1) / 2, add[u]); renew(u + u + 1, l / 2, add[u]); add[u] = 0; } } void push_up(int u) { sum[u] = sum[u + u] + sum[u + u + 1]; } void modify(int u, int l, int r, int ll, int rr, int k) { if (ll <= l && r <= rr) { renew(u, r - l + 1, k); return; } int mid = l + r >> 1; push_down(u, r - l + 1); if (ll <= mid) modify(u + u, l, mid, ll, rr, k); if (mid < rr) modify(u + u + 1, mid + 1, r, ll, rr, k); push_up(u); } long long query(int u, int l, int r, int ll, int rr) { if (ll <= l && r <= rr) return sum[u]; int mid = l + r >> 1; long long ret = 0; push_down(u, r - l + 1); if (ll <= mid) ret += query(u + u, l, mid, ll, rr); if (mid < rr) ret += query(u + u + 1, mid + 1, r, ll, rr); return ret; } int n; void update(int u, int k) { ret1 += k * dp[u]; ret2 += dp[u]; while (u) { int l = hd[pid[u]]; ret2 += 2 * k * query(1, 1, n, st[l], st[u]); modify(1, 1, n, st[l], st[u], k); u = p[l]; } } int main() { int m, q, C; scanf( %d%d%d%d , &n, &m, &q, &C); for (int i = 1; i <= n; i++) scanf( %d , &f[i]), V[f[i]].push_back(i), g[i] = f[i]; for (int i = 2; i <= n; i++) scanf( %d , &p[i]), adj[p[i]].push_back(i); for (int i = 1; i <= m; i++) scanf( %d , &c[i]); for (int i = 1; i <= q; i++) { scanf( %d , &op[i]); if (op[i] == 1) { int x, w; scanf( %d%d , &x, &w); V[g[x]].push_back(-x); g[x] = w; V[g[x]].push_back(x); } else { int k; scanf( %d , &k); V[k].push_back(n + i); } } dfs(1); dfs1(1); set<int> S; for (int i = 1; i <= m; i++) { for (auto e : S) update(e, -1); S.clear(); ret2 = 0, ret1 = 0; for (int event : V[i]) { if (event < 0) { S.erase(-event); update(-event, -1); } else if (event <= n) { S.insert(event); update(event, 1); } else { ans[event - n] = (long double)(ret2 * c[i] * c[i] - 2 * ret1 * c[i] * C + C * 1LL * C * n) / n; } } } for (int i = 1; i <= q; i++) if (op[i] == 2) printf( %.10lf n , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, even = 0, odd = 0; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; if (n == 1) cout << a[0] << n ; else { sort(a, a + n); long long int flag = 0; for (long long int i = 1; i < n; i++) { if (a[i] % a[0] != 0) { flag = 1; break; } } if (flag == 0) cout << a[0] << n ; else cout << -1 << n ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void _print(long long int t) { cerr << t; } void _print(int t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(long double t) { cerr << t; } void _print(double t) { cerr << t; } void _print(unsigned long long t) { cerr << t; } template <class T, class V> void _print(pair<T, V> p); template <class T> void _print(vector<T> v); template <class T> void _print(set<T> v); template <class T, class V> void _print(map<T, V> v); template <class T> void _print(multiset<T> v); template <class T, class V> void _print(pair<T, V> p) { cerr << { ; _print(p.first); cerr << , ; _print(p.second); cerr << } ; } template <class T> void _print(vector<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(set<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(multiset<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T, class V> void _print(map<T, V> v) { cerr << [ ; for (auto i : v) { _print(i); cerr << ; } cerr << ] ; } long long int mod1 = 1e9 + 7; long long int INF = 1e9 + 5; long long int mod = 998244353; void solve(long long int test_case) { string s; cin >> s; long long int n = s.size(); long long int take = n / 2; string ans, rev; long long int i = 0, j = n - 1; while (j >= i && take > 0) { if (j > i && s[i] == s[j]) { ans.push_back(s[i]); rev.push_back(s[i]); i++; j--; take -= 2; } else if (j - 1 > i && s[i] == s[j - 1]) { ans.push_back(s[i]); rev.push_back(s[i]); j -= 2; i++; take -= 2; } else if (j > i + 1 && s[i + 1] == s[j]) { ans.push_back(s[j]); rev.push_back(s[j]); j--; i += 2; take -= 2; } else if (j - 1 > i + 1 && s[j - 1] == s[i + 1]) { ans.push_back(s[j - 1]); rev.push_back(s[j - 1]); j -= 2; i += 2; take -= 2; } else { ans.push_back(s[i]); i++; take--; break; } } reverse(rev.begin(), rev.end()); ans += rev; if (take > 0 || ans.size() < n / 2) { cout << IMPOSSIBLE n ; } else { cout << ans; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int t = 1; long long int i = 1ll; while (t--) { solve(i); i++; } }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); template <class T> T SQR(const T &a) { return a * a; } void run() { int A[4][4]; int n; cin >> n; int B[16]; for (int i = (0), ei = (n * n); i < ei; i++) scanf( %d , B + i); int nsq = n * n; sort(B, B + nsq); int S[4], G[4]; do { memset(S, 0, 16); for (int i = (0), ei = (n); i < ei; i++) for (int j = (0), ej = (n); j < ej; j++) S[i] += B[i * n + j]; bool ok = 1; for (int i = (1), ei = (n); i < ei; i++) if (S[i] != S[0]) ok = 0; if (!ok) continue; memset(G, 0, 16); for (int j = (0), ej = (n); j < ej; j++) for (int i = (0), ei = (n); i < ei; i++) G[j] += B[i * n + j]; if (S[0] != G[0]) continue; for (int i = (1), ei = (n); i < ei; i++) if (G[i] != G[0]) ok = 0; int d = 0; for (int i = (0), ei = (n); i < ei; i++) d += B[i * n + i]; if (d != S[0]) continue; d = 0; for (int i = (0), ei = (n); i < ei; i++) d += B[i * n + n - i - 1]; if (d != S[0]) continue; if (ok) { printf( %d n , S[0]); for (int i = (0), ei = (n); i < ei; i++) for (int j = (0), ej = (n); j < ej; j++) { printf( %d , B[i * n + j]); if (j != n - 1) putchar( ); else putchar( n ); } return; } } while (next_permutation(B, B + nsq)); } int main() { time_t beg = clock(); run(); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; long long n; vector<long long> v; void init() { for (int i = 0; i <= 38; i++) v.push_back(pow(3, i)); } int main() { init(); int t; cin >> t; while (t--) { cin >> n; long long res = 0, cur = 0; while (res < n) { res += v[cur]; cur++; } while (cur >= 0) { if (res - v[cur] >= n) res -= v[cur]; cur--; } cout << res << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } const int maxn = 1000100; char s[maxn]; vector<int> a[maxn]; void solve() { cin >> s; int n = strlen(s); int c = 0; for (int i = 0; i < n; i++) { c += s[i] == 0 ? 1 : -1; if (c < 0) { puts( -1 ); return; } } c = 0; for (int i = n - 1; i >= 0; i--) { c += s[i] == 0 ? 1 : -1; if (c < 0) { puts( -1 ); return; } } int nol = 0, bir = 0; for (int i = 0; i < n; i++) { if (s[i] == 0 ) { if (bir) { a[bir - 1].push_back(i + 1); bir--; } else { nol++; a[nol - 1].push_back(i + 1); } } else { a[bir].push_back(i + 1); bir++; } } cout << nol << endl; for (int i = 0; i < nol; i++) { printf( %d , a[i].size()); for (int j = 0; j < a[i].size(); j++) printf( %d , a[i][j]); cout << endl; } } int main() { int t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; scanf( %d %d %d , &a, &b, &c); double rez = 1.0 * a * a * a * 1.41421356237309 / 12.0; rez += 1.0 * b * b * b * 1.41421356237309 / 6.0; rez += 1.0 * c * c * c * 7.23606797749978 / 24.0; printf( %.10lf n , rez); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int f[300][300]; f[2][1] = 2; f[2][2] = 1; f[4][1] = 32; f[4][2] = 30; f[4][3] = 80; f[4][4] = 109; f[8][1] = 6824; f[8][2] = 59808; f[8][3] = 147224; f[8][4] = 415870; f[8][5] = 1757896; f[8][6] = 1897056; f[8][7] = 4898872; f[8][8] = 7593125; f[16][1] = 776830421; f[16][2] = 290516100; f[16][3] = 746623577; f[16][4] = 293783147; f[16][5] = 33900006; f[16][6] = 735127505; f[16][7] = 565460332; f[16][8] = 428982705; f[16][9] = 472062098; f[16][10] = 161873957; f[16][11] = 117354594; f[16][12] = 515619293; f[16][13] = 578944191; f[16][14] = 312106242; f[16][15] = 569389279; f[16][16] = 391464593; f[32][1] = 261086313; f[32][2] = 584837659; f[32][3] = 683961846; f[32][4] = 468868529; f[32][5] = 211593382; f[32][6] = 736955478; f[32][7] = 229471758; f[32][8] = 157617135; f[32][9] = 398169441; f[32][10] = 360252438; f[32][11] = 629394768; f[32][12] = 264125799; f[32][13] = 647490480; f[32][14] = 342079395; f[32][15] = 391579767; f[32][16] = 225200475; f[32][17] = 486011304; f[32][18] = 513156108; f[32][19] = 628771752; f[32][20] = 132906648; f[32][21] = 142138221; f[32][22] = 20119449; f[32][23] = 444199674; f[32][24] = 195188679; f[32][25] = 387329805; f[32][26] = 44684703; f[32][27] = 651912135; f[32][28] = 737154512; f[32][29] = 612549793; f[32][30] = 519860281; f[32][31] = 186175544; f[32][32] = 212568440; f[64][1] = 240805271; f[64][2] = 239509872; f[64][3] = 581127897; f[64][4] = 6511239; f[64][5] = 156126222; f[64][6] = 509425833; f[64][7] = 672407328; f[64][8] = 366667722; f[64][9] = 459185405; f[64][10] = 509737025; f[64][11] = 554790222; f[64][12] = 165216555; f[64][13] = 703150560; f[64][14] = 74806569; f[64][15] = 398730015; f[64][16] = 383350905; f[64][17] = 506108358; f[64][18] = 51326142; f[64][19] = 298053147; f[64][20] = 104256117; f[64][21] = 391428765; f[64][22] = 374020479; f[64][23] = 206607807; f[64][24] = 87664059; f[64][25] = 275899176; f[64][26] = 56407680; f[64][27] = 551553401; f[64][28] = 448939463; f[64][29] = 582889860; f[64][30] = 129676638; f[64][31] = 226078251; f[64][32] = 135769095; f[64][33] = 61292868; f[64][34] = 578972226; f[64][35] = 190181628; f[64][36] = 390739055; f[64][37] = 184587732; f[64][38] = 446575689; f[64][39] = 732674124; f[64][40] = 232198470; f[64][41] = 676760679; f[64][42] = 352474101; f[64][43] = 611444862; f[64][44] = 575661807; f[64][45] = 628905585; f[64][46] = 320813094; f[64][47] = 522840969; f[64][48] = 469781928; f[64][49] = 156006018; f[64][50] = 554473341; f[64][51] = 239654268; f[64][52] = 643714911; f[64][53] = 433540170; f[64][54] = 199307003; f[64][55] = 496385218; f[64][56] = 291740751; f[64][57] = 67309914; f[64][58] = 370826673; f[64][59] = 202356819; f[64][60] = 279421821; f[64][61] = 421203111; f[64][62] = 63744786; f[64][63] = 520987612; f[64][64] = 550671827; f[128][1] = 482164403; f[128][2] = 768209115; f[128][3] = 462063756; f[128][4] = 154906374; f[128][5] = 36099042; f[128][6] = 341766705; f[128][7] = 678182556; f[128][8] = 621882744; f[128][9] = 478771358; f[128][10] = 231881111; f[128][11] = 175889805; f[128][12] = 243630450; f[128][13] = 168908523; f[128][14] = 671961765; f[128][15] = 55761813; f[128][16] = 652682670; f[128][17] = 773939082; f[128][18] = 517628076; f[128][19] = 756201264; f[128][20] = 124604900; f[128][21] = 750976272; f[128][22] = 498253248; f[128][23] = 676047609; f[128][24] = 137170026; f[128][25] = 705610017; f[128][26] = 495032139; f[128][27] = 561797418; f[128][28] = 703097347; f[128][29] = 500815609; f[128][30] = 95984586; f[128][31] = 739707108; f[128][32] = 265613565; f[128][33] = 387099846; f[128][34] = 777331779; f[128][35] = 594676173; f[128][36] = 591219559; f[128][37] = 407997044; f[128][38] = 208947235; f[128][39] = 93337440; f[128][40] = 478908360; f[128][41] = 685013007; f[128][42] = 487033953; f[128][43] = 671903001; f[128][44] = 39521181; f[128][45] = 738490312; f[128][46] = 33785059; f[128][47] = 465470131; f[128][48] = 310453920; f[128][49] = 54648783; f[128][50] = 346831137; f[128][51] = 427694175; f[128][52] = 474743430; f[128][53] = 705296781; f[128][54] = 435828036; f[128][55] = 429824745; f[128][56] = 663532359; f[128][57] = 261388683; f[128][58] = 244690731; f[128][59] = 533997135; f[128][60] = 596108961; f[128][61] = 506813013; f[128][62] = 371892402; f[128][63] = 590145264; f[128][64] = 104733162; f[128][65] = 143420103; f[128][66] = 654339672; f[128][67] = 700348950; f[128][68] = 685038942; f[128][69] = 578826927; f[128][70] = 286484229; f[128][71] = 501639192; f[128][72] = 434962491; f[128][73] = 299270097; f[128][74] = 27702486; f[128][75] = 335375775; f[128][76] = 111746817; f[128][77] = 565603164; f[128][78] = 294926121; f[128][79] = 676063665; f[128][80] = 735862995; f[128][81] = 710035809; f[128][82] = 437011960; f[128][83] = 668528077; f[128][84] = 138765186; f[128][85] = 508213986; f[128][86] = 615036450; f[128][87] = 353784942; f[128][88] = 624827616; f[128][89] = 343900011; f[128][90] = 241289776; f[128][91] = 52410890; f[128][92] = 72018835; f[128][93] = 352406796; f[128][94] = 415705878; f[128][95] = 4802637; f[128][96] = 376367145; f[128][97] = 65589678; f[128][98] = 333633477; f[128][99] = 341834527; f[128][100] = 303717460; f[128][101] = 282387700; f[128][102] = 42951006; f[128][103] = 254706039; f[128][104] = 423048528; f[128][105] = 526429710; f[128][106] = 68131467; f[128][107] = 669954708; f[128][108] = 12787348; f[128][109] = 500636381; f[128][110] = 317959019; f[128][111] = 479433192; f[128][112] = 657133515; f[128][113] = 416259390; f[128][114] = 610216692; f[128][115] = 340129188; f[128][116] = 44594256; f[128][117] = 257373347; f[128][118] = 138718678; f[128][119] = 530767740; f[128][120] = 292922628; f[128][121] = 37220268; f[128][122] = 605295159; f[128][123] = 480722613; f[128][124] = 458170419; f[128][125] = 30540300; f[128][126] = 487159055; f[128][127] = 232966794; f[128][128] = 149150650; f[256][1] = 412133651; f[256][2] = 386543325; f[256][3] = 139952108; f[256][4] = 289303402; f[256][5] = 102404925; f[256][6] = 317067177; f[256][7] = 396414708; f[256][8] = 80515854; f[256][9] = 663739304; f[256][10] = 317300809; f[256][11] = 228877044; f[256][12] = 493725043; f[256][13] = 715317967; f[256][14] = 490300965; f[256][15] = 315527373; f[256][16] = 743539734; f[256][17] = 488329191; f[256][18] = 553627998; f[256][19] = 533025234; f[256][20] = 242583957; f[256][21] = 706116537; f[256][22] = 614109258; f[256][23] = 645447222; f[256][24] = 523195911; f[256][25] = 492109128; f[256][26] = 722623041; f[256][27] = 111085128; f[256][28] = 766395126; f[256][29] = 654378921; f[256][30] = 691964847; f[256][31] = 496688157; f[256][32] = 399056049; f[256][33] = 654363234; f[256][34] = 102052314; f[256][35] = 191720088; f[256][36] = 473910948; f[256][37] = 259736526; f[256][38] = 332840025; f[256][39] = 388047555; f[256][40] = 665791056; f[256][41] = 627111387; f[256][42] = 139696515; f[256][43] = 441456687; f[256][44] = 443032569; f[256][45] = 283264821; f[256][46] = 771641703; f[256][47] = 452641455; f[256][48] = 511306362; f[256][49] = 117572859; f[256][50] = 127701891; f[256][51] = 721298331; f[256][52] = 176520078; f[256][53] = 357242229; f[256][54] = 611296308; f[256][55] = 696994956; f[256][56] = 405628839; f[256][57] = 429224274; f[256][58] = 465336054; f[256][59] = 695091546; f[256][60] = 689828796; f[256][61] = 574648641; f[256][62] = 351220905; f[256][63] = 507964023; f[256][64] = 675326610; f[256][65] = 517248963; f[256][66] = 453528621; f[256][67] = 220301928; f[256][68] = 494463186; f[256][69] = 681789969; f[256][70] = 339589656; f[256][71] = 44524053; f[256][72] = 417125457; f[256][73] = 339589404; f[256][74] = 747135963; f[256][75] = 341780733; f[256][76] = 734158215; f[256][77] = 396817281; f[256][78] = 21997836; f[256][79] = 5728464; f[256][80] = 147611205; f[256][81] = 456248898; f[256][82] = 714128667; f[256][83] = 377654949; f[256][84] = 3862068; f[256][85] = 128418948; f[256][86] = 589390074; f[256][87] = 304947090; f[256][88] = 11703825; f[256][89] = 228266073; f[256][90] = 127304142; f[256][91] = 429215724; f[256][92] = 361541124; f[256][93] = 521572968; f[256][94] = 468358191; f[256][95] = 341231688; f[256][96] = 65323503; f[256][97] = 613778508; f[256][98] = 15985323; f[256][99] = 291661029; f[256][100] = 410970006; f[256][101] = 591638112; f[256][102] = 349541550; f[256][103] = 89967528; f[256][104] = 224922159; f[256][105] = 361094166; f[256][106] = 584206074; f[256][107] = 640051812; f[256][108] = 324264456; f[256][109] = 652625388; f[256][110] = 693768537; f[256][111] = 11740617; f[256][112] = 309238398; f[256][113] = 211085469; f[256][114] = 194905872; f[256][115] = 639416484; f[256][116] = 110110707; f[256][117] = 296645895; f[256][118] = 748118511; f[256][119] = 131177718; f[256][120] = 511142751; f[256][121] = 775975599; f[256][122] = 421403409; f[256][123] = 475528473; f[256][124] = 434685258; f[256][125] = 1768977; f[256][126] = 80301375; f[256][127] = 708023862; f[256][128] = 569195676; f[256][129] = 56238084; f[256][130] = 632887668; f[256][131] = 88089750; f[256][132] = 631539342; f[256][133] = 396695565; f[256][134] = 38780154; f[256][135] = 695798271; f[256][136] = 469819224; f[256][137] = 439587099; f[256][138] = 69045921; f[256][139] = 682966116; f[256][140] = 112310856; f[256][141] = 64943298; f[256][142] = 534475872; f[256][143] = 40215357; f[256][144] = 389728458; f[256][145] = 286368453; f[256][146] = 736006257; f[256][147] = 501181650; f[256][148] = 54829908; f[256][149] = 603489402; f[256][150] = 338032656; f[256][151] = 512182818; f[256][152] = 627500097; f[256][153] = 462674016; f[256][154] = 3103092; f[256][155] = 157324491; f[256][156] = 43978329; f[256][157] = 596818971; f[256][158] = 259025598; f[256][159] = 9088632; f[256][160] = 91991781; f[256][161] = 577291428; f[256][162] = 211245489; f[256][163] = 429471231; f[256][164] = 142626330; f[256][165] = 172560633; f[256][166] = 510907446; f[256][167] = 444609585; f[256][168] = 758102058; f[256][169] = 375112647; f[256][170] = 744786693; f[256][171] = 276174402; f[256][172] = 19259856; f[256][173] = 233672418; f[256][174] = 745389414; f[256][175] = 225772848; f[256][176] = 23385663; f[256][177] = 324290610; f[256][178] = 519804558; f[256][179] = 120337812; f[256][180] = 402578568; f[256][181] = 360676008; f[256][182] = 450089262; f[256][183] = 551043738; f[256][184] = 337388940; f[256][185] = 512108856; f[256][186] = 28879011; f[256][187] = 690040638; f[256][188] = 106017282; f[256][189] = 558262341; f[256][190] = 99972432; f[256][191] = 608226003; f[256][192] = 612152037; f[256][193] = 42414435; f[256][194] = 776201013; f[256][195] = 39580443; f[256][196] = 518796945; f[256][197] = 494437752; f[256][198] = 583194366; f[256][199] = 723936555; f[256][200] = 415359657; f[256][201] = 309569589; f[256][202] = 751104774; f[256][203] = 166684527; f[256][204] = 249229170; f[256][205] = 353120823; f[256][206] = 130668327; f[256][207] = 753823584; f[256][208] = 580966092; f[256][209] = 561963717; f[256][210] = 543672234; f[256][211] = 393846327; f[256][212] = 586278000; f[256][213] = 327398400; f[256][214] = 278403867; f[256][215] = 156455586; f[256][216] = 363920382; f[256][217] = 190245195; f[256][218] = 290039148; f[256][219] = 547014447; f[256][220] = 466218648; f[256][221] = 146037150; f[256][222] = 585462906; f[256][223] = 666008595; f[256][224] = 691786683; f[256][225] = 374707494; f[256][226] = 622498779; f[256][227] = 231158277; f[256][228] = 685740951; f[256][229] = 115612245; f[256][230] = 681825249; f[256][231] = 545555745; f[256][232] = 551718468; f[256][233] = 277206615; f[256][234] = 640171035; f[256][235] = 757727334; f[256][236] = 195193908; f[256][237] = 658656684; f[256][238] = 457760646; f[256][239] = 225925875; f[256][240] = 505761984; f[256][241] = 18685233; f[256][242] = 506832921; f[256][243] = 112511021; f[256][244] = 396846646; f[256][245] = 290147622; f[256][246] = 113924623; f[256][247] = 669986155; f[256][248] = 336008070; f[256][249] = 63611061; f[256][250] = 238586775; f[256][251] = 119956662; f[256][252] = 616557739; f[256][253] = 772784623; f[256][254] = 334527774; f[256][255] = 410403148; f[256][256] = 51933421; int n, k; cin >> n >> k; cout << f[n][k] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 11; const long long mod = 1e9 + 7; const int inf = 1e9; const int bl = 320; deque<int> arr[bl]; int cnt[bl][N]; void shift(int l, int r) { vector<int> a; int b = l / bl; while (!arr[b].empty()) { a.push_back(arr[b].front()); arr[b].pop_front(); } int last = a[r - b * bl]; for (int i = l - b * bl; i <= r - b * bl; i++) { swap(a[i], last); } while (!a.empty()) { arr[b].push_front(a.back()); a.pop_back(); } } int del(int first) { int b = first / bl; int second = first - b * bl; vector<int> a; for (int i = 0; i < second; i++) { a.push_back(arr[b].front()); arr[b].pop_front(); } int res = arr[b].front(); arr[b].pop_front(); while (!a.empty()) { arr[b].push_front(a.back()); a.pop_back(); } return res; } void add(int first, int val) { int b = first / bl; int second = first - b * bl; vector<int> a; for (int i = arr[b].size() - 1; i >= second; i--) { a.push_back(arr[b].back()); arr[b].pop_back(); } arr[b].push_back(val); while (!a.empty()) { arr[b].push_back(a.back()); a.pop_back(); } } void solve() { int n; cin >> n; arr[0].push_back(0); for (int i = 1; i <= n; i++) { int first; cin >> first; arr[i / bl].push_back(first); cnt[i / bl][first]++; } int q; cin >> q; int lastans = 0; for (int i = 1; i <= q; i++) { int type, l, r, k; cin >> type >> l >> r; if (type == 1) { l = (l + lastans - 1) % n + 1; r = (r + lastans - 1) % n + 1; if (l > r) swap(l, r); if (l / bl == r / bl) { shift(l, r); } else { int last = del(r); cnt[r / bl][last]--; add(l, last); cnt[l / bl][last]++; for (int i = l / bl; i <= r / bl; i++) { if (i > l / bl) { arr[i].push_front(last); cnt[i][last]++; } if (i < r / bl) { int first = arr[i].back(); arr[i].pop_back(); cnt[i][first]--; last = first; } } } } else { cin >> k; l = (l + lastans - 1) % n + 1; r = (r + lastans - 1) % n + 1; k = (k + lastans - 1) % n + 1; if (l > r) swap(l, r); int ans = 0; if (l / bl == r / bl) { int b = l / bl; for (int i = l - b * bl; i <= r - b * bl; i++) { if (arr[b][i] == k) ans++; } } else { int b = l / bl; for (int i = l; i < (b + 1) * bl; i++) { if (arr[b][i - b * bl] == k) ans++; } b = r / bl; for (int i = b * bl; i <= r; i++) { if (arr[b][i - b * bl] == k) ans++; } for (int i = l / bl + 1; i < r / bl; i++) { ans += cnt[i][k]; } } cout << ans << n ; lastans = ans; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int T = 1; while (T--) { solve(); cout << n ; } }
#include <bits/stdc++.h> using namespace std; const int MX = 5005; int n, m; int n1, n2, n3; vector<int> g[5005]; int pars[5005]; map<int, vector<int>> roots; vector<int> roots_v; vector<int> cs; int rootNum = 0; bool dp[5005][5005][2]; int find(int u) { if (pars[u] == u) return u; int p = find(pars[u]); pars[u] = p; return p; } void un(int u, int v) { int pu = find(u), pv = find(v); pars[pv] = pu; } bool color(int u, int c) { stack<vector<int>> sk; sk.push({u, c}); while (!sk.empty()) { vector<int> it = sk.top(); sk.pop(); u = it[0]; c = it[1]; if (cs[u] != 0 && cs[u] != c) return false; if (cs[u] != 0) continue; int pu = find(u); cs[u] = c; roots[pu][c]++; int nc = c == 1 ? 2 : 1; for (int v : g[u]) { if (cs[v] == 0) sk.push({v, nc}); } } return true; } void solve() { for (int u = 1; u <= n; u++) { pars[u] = u; } for (int u = 1; u <= n; u++) { for (int v : g[u]) { un(u, v); } } for (int u = 1; u <= n; u++) { int pu = find(u); roots[pu] = vector<int>(3); } cs = vector<int>(n + 1, 0); for (auto it = roots.begin(); it != roots.end(); it++) { int u = it->first; roots_v.push_back(u); if (!color(u, 1)) { cout << NO << endl; return; } } rootNum = roots.size(); memset(dp, 0, sizeof(dp)); int root = roots_v[0]; if (roots[root][2] <= n2) dp[0][roots[root][2]][0] = 1; if (roots[root][1] <= n2) dp[0][roots[root][1]][1] = 1; for (int i = 1; i < rootNum; i++) { root = roots_v[i]; int c1 = roots[root][1], c2 = roots[root][2]; for (int v = 0; v <= n2; v++) { if (v >= c2) { dp[i][v][0] = dp[i - 1][v - c2][0] || dp[i - 1][v - c2][1]; } if (v >= c1) { dp[i][v][1] = dp[i - 1][v - c1][0] || dp[i - 1][v - c1][1]; } } } if (!dp[rootNum - 1][n2][0] && !dp[rootNum - 1][n2][1]) { cout << NO << endl; return; } int i = rootNum - 1; int tar = n2; map<int, int> reverse; while (i >= 0) { int root = roots_v[i]; if (dp[i][tar][1]) { reverse[root] = 1; tar -= roots[root][1]; } else { reverse[root] = 0; tar -= roots[root][2]; } i--; } for (int u = 1; u <= n; u++) { int pu = find(u); if (reverse[pu]) { cs[u] = cs[u] == 1 ? 2 : 1; } } int x = n3; for (int u = 1; u <= n && x; u++) { if (cs[u] == 1) { cs[u] = 3; x--; } } cout << YES << endl; for (int u = 1; u <= n; u++) { cout << cs[u]; } cout << endl; } int main() { cin >> n >> m >> n1 >> n2 >> n3; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long begtime = clock(); template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } void splitx(string s, char c, vector<string>& v) { long long i = 0, j; while (i < (long long)(s).size()) { j = i; string temp; while (j < (long long)(s).size() && s[j] != c) { temp += s[j]; j++; } v.push_back(temp); i = j + 1; } } vector<long long> dx{1, 0, -1, 0, 1, 1, -1, -1}; vector<long long> dy{0, 1, 0, -1, 1, -1, 1, -1}; signed main() { std::ios::sync_with_stdio(false); cin.tie(NULL); long long n, m, k; cin >> n >> m >> k; vector<string> v(n); for (long long i = 0; i < n; i++) { cin >> v[i]; } vector<vector<long long> > vis(n, vector<long long>(m, 0)); vector<vector<long long> > dist(n, vector<long long>(m, 1000000000000000007)); long long x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; x1--; y1--; x2--; y2--; queue<pair<long long, long long> > q; q.push({x1, y1}); dist[x1][y1] = 0; while (!q.empty()) { pair<long long, long long> p = q.front(); q.pop(); long long x = p.first; long long y = p.second; if (vis[x][y]) continue; vis[x][y] = 1; for (long long i = 0; i < 4; i++) { for (long long j = 1; j < k + 1; j++) { long long nx = x + dx[i] * j; long long ny = y + dy[i] * j; if (nx < 0 || nx >= n || ny < 0 || ny >= m) break; if (v[nx][ny] == # || dist[nx][ny] < dist[x][y] + 1) break; dist[nx][ny] = dist[x][y] + 1; q.push({nx, ny}); } } } if (dist[x2][y2] == 1000000000000000007) { cout << -1 << n ; } else { cout << dist[x2][y2] << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 203; const int mod = 1e9 + 7; vector<int> g[N]; int dp[N]; int ans, n; int len1, len2; void cal(int u, int fa, int &len) { dp[u] = 0; int &mx1 = dp[u], mx2 = 0; int v; for (__typeof((g[u]).begin()) v = (g[u]).begin(); v != (g[u]).end(); v++) { if (*v == fa) continue; cal(*v, u, len); if (mx2 < dp[*v] + 1) { mx2 = dp[*v] + 1; if (mx2 > mx1) swap(mx1, mx2); } } len = max(len, mx1 + mx2); } void dfs(int u, int fa) { int v; for (__typeof((g[u]).begin()) v = (g[u]).begin(); v != (g[u]).end(); v++) { if (*v == fa) continue; len1 = len2 = 0; cal(*v, u, len1); cal(u, *v, len2); ans = max(ans, len1 * len2); dfs(*v, u); } } int main() { int i, j; scanf( %d , &n); for (i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); g[x].push_back(y); g[y].push_back(x); } dfs(1, 0); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; long long a[200010]; long long b[200010]; int s[200010]; long long ans; bool check(long long val) { memset(s, 0, sizeof(s)); int num = k; for (int i = 1; i <= n; i++) { if (!b[i]) { continue; } long long sum = a[i]; s[min(sum / b[i] + 1, 1ll * (k + 1))]++; while (sum < 1ll * k * b[i]) { if (!num) { break; } sum += val; s[min(sum / b[i] + 1, 1ll * (k + 1))]++; num--; } } for (int i = 1; i <= k; i++) { s[i] += s[i - 1]; if (s[i] > i) { return false; } } return true; } int main() { scanf( %d%d , &n, &k); k--; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); } for (int i = 1; i <= n; i++) { scanf( %lld , &b[i]); } long long l = 0, r = 2000000000000ll; while (l <= r) { long long mid = (l + r) >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else { l = mid + 1; } } if (!ans) { printf(check(0) ? 0 : -1 ); } else { printf( %lld , ans); } }
#include <bits/stdc++.h> using namespace std; void require(bool cond, const string& message = Runtime error ) { if (!cond) { cerr << message << endl; assert(false); } } void readData() {} long long mina, maxa; void solve(long long x, long long n) { long long m = n / x; for (long long y = 1; y * y <= m; ++y) { if (m % y) continue; long long z = m / y; long long nn = (x + 1) * (y + 2) * (z + 2); if (mina == -1) mina = nn - n; mina = min(mina, nn - n); maxa = max(maxa, nn - n); } } void solve() { long long n; cin >> n; mina = -1; maxa = 1; for (long long x = 1; x * x <= n; ++x) { if (n % x) continue; solve(x, n); solve(n / x, n); } cout << mina << << maxa << endl; } int main() { ios_base::sync_with_stdio(false); readData(); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long arr[1005]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; for (long long i = 0; i < n; i++) { cin >> arr[i]; } long long left = 1; long long right = n - 1; long long cnt = 1; long long leftSum, rightSum; leftSum = rightSum = 0; leftSum = arr[0]; long long turn = 1; long long prevSum = arr[0]; while (left <= right) { if (turn == 0) { long long currSum = 0; while (currSum <= prevSum) { currSum += arr[left]; left++; if (left > right) break; } prevSum = currSum; leftSum += currSum; turn = 1; } else { long long currSum = 0; while (currSum <= prevSum) { currSum += arr[right]; right--; if (left > right) break; } prevSum = currSum; rightSum += currSum; turn = 0; } cnt++; } cout << cnt << << leftSum << << rightSum << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, a[105][105], m; vector<pair<int, int> > ans; void Solve2() { int cur = 0, cnt = 0; for (int i = n - 1; i <= n; ++i) { for (int j = m - 1; j <= m; ++j) { if (a[i][j] == 1 && cnt == 0) { ans.push_back({i, j}); ++cnt; a[i][j] ^= 1; } else if (a[i][j] == 0 && cur < 2) { ans.push_back({i, j}); cur++; a[i][j] ^= 1; } } } for (int i = n - 1; i <= n; ++i) { for (int j = m - 1; j <= m; ++j) { if (a[i][j] == 1) ans.push_back({i, j}); } } } void Solve1() { int cur = 0; for (int i = n - 1; i <= n; ++i) { for (int j = m - 1; j <= m; ++j) { if (a[i][j] == 1) { ans.push_back({i, j}); a[i][j] ^= 1; } else if (cur < 2) { ans.push_back({i, j}), cur++; a[i][j] ^= 1; } } } Solve2(); } void Solve4() { int cur = 0; for (int i = n - 1; i <= n; ++i) { for (int j = m - 1; j <= m; ++j) { if (a[i][j] == 1) { ans.push_back({i, j}); a[i][j] ^= 1; } } } Solve1(); } void Handle() { for (int i = 1; i < n - 1; ++i) { for (int j = 1; j < m; ++j) { if (a[i][j] == 1) { a[i][j] ^= 1; ans.push_back({i, j}); a[i + 1][j] ^= 1; ans.push_back({i + 1, j}); a[i + 1][j + 1] ^= 1; ans.push_back({i + 1, j + 1}); } } if (a[i][m] == 1) { a[i][m] ^= 1; ans.push_back({i, m}); a[i + 1][m] ^= 1; ans.push_back({i + 1, m}); a[i + 1][m - 1] ^= 1; ans.push_back({i + 1, m - 1}); } } for (int j = 1; j < m - 1; ++j) { if (a[n - 1][j] == 1) { a[n - 1][j] ^= 1; ans.push_back({n - 1, j}); a[n - 1][j + 1] ^= 1; ans.push_back({n - 1, j + 1}); a[n][j + 1] ^= 1; ans.push_back({n, j + 1}); } if (a[n][j] == 1) { a[n][j] ^= 1; ans.push_back({n, j}); a[n - 1][j + 1] ^= 1; ans.push_back({n - 1, j + 1}); a[n][j + 1] ^= 1; ans.push_back({n, j + 1}); } } int cnt = 0; for (int i = n - 1; i <= n; ++i) { for (int j = m - 1; j <= m; ++j) { if (a[i][j] == 1) ++cnt; } } if (cnt == 3) { for (int i = n - 1; i <= n; ++i) { for (int j = m - 1; j <= m; ++j) { if (a[i][j] == 1) ans.push_back({i, j}); } } return; } if (cnt == 0) return; if (cnt == 1) { Solve1(); return; } if (cnt == 2) { Solve2(); return; } if (cnt == 4) { Solve4(); return; } } void Solve() { cin >> n >> m; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { char x; cin >> x; a[i][j] = x - 0 ; } } ans.clear(); Handle(); cout << ans.size() / 3 << n ; for (int i = 0; i < ans.size(); i += 3) { for (int j = 0; j <= 2; ++j) cout << ans[i + j].first << << ans[i + j].second << ; cout << n ; } } int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); if (fopen( .inp , r )) { freopen( .inp , r , stdin); freopen( .out , w , stdout); } int t; cin >> t; while (t--) { Solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MXN = 100100; const int QQ = 500; const int INF = (int)1e9; const long long LINF = (long long)1e18; const int mod = 1000000007; set<pair<int, int> > eds; int x[MXN]; int main() { int n, m; scanf( %d%d , &n, &m); int a, b; for (int i = 0; i < (m); i++) { scanf( %d%d , &a, &b); eds.insert(make_pair(a, b)); eds.insert(make_pair(b, a)); } for (int i = 0; i < (n); i++) x[i] = i + 1; for (int i = 0; i < (QQ); i++) { random_shuffle(x, x + n); bool bad = false; for (int i = 0; i < (m); i++) if (eds.find(make_pair(x[i % n], x[(i + 1) % n])) != eds.end()) { bad = true; break; } if (bad) continue; for (int i = 0; i < (m); i++) { printf( %d %d n , x[i % n], x[(i + 1) % n]); } return 0; } printf( -1 ); }
#include <bits/stdc++.h> using namespace std; long double a[1001][1001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, t, m, w, b; cout.precision(12); cin >> w >> b; for (int i = 0; i <= w; i++) { for (int j = 0; j <= b; j++) { if (!i && !j) continue; long double x = i * 1.0; long double y = j * 1.0; a[i][j] = (x / (x + y)); long double z = (y - 2) / (x + y - 2); if ((i >= 0) && ((j - 3) >= 0)) { a[i][j] += (a[i][j - 3] * z * (y / (x + y)) * ((y - 1) / (x + y - 1))); } if (((i - 1) >= 0) && ((j - 2) >= 0)) { a[i][j] += (a[i - 1][j - 2] * (1 - z) * (y / (x + y)) * ((y - 1) / (x + y - 1))); } } } cout << fixed << a[w][b]; return 0; }
#include <bits/stdc++.h> using namespace std; bool comp(long long a, long long b) { if (a > b) return true; else return false; } int isP(long long n) { if (n == 1) return 0; if (n == 2 || n == 3) return 1; for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) return 0; } return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t, n, k, va; bool ha; cin >> t; while (t--) { cin >> n >> k; if (n == 0) ha = false; else if (n == 1 || n == 2) ha = true; else if (n == 3) { if (k == 3) ha = true; else ha = false; } else { if (k % 3 != 0) { va = n % 3; if (va == 0) ha = false; else ha = true; } else { n %= (k + 1); if (n % 3 == 0) ha = false; else ha = true; if (n == k) ha = true; } } if (ha) cout << Alice n ; else cout << Bob n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int how_many(string s, vector<string>& deleted) { int res = 0; for (auto i : deleted) for (int j = 0; j < s.size(); j++) { if (i[j] != s[j]) break; if (j == s.size() - 1) res++; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> deleted(n); for (int i = 0; i < n; i++) cin >> deleted[i]; string res = ; long long curr = ((1LL << m) + 1 - n) / 2; for (int i = 0; i < m; i++) { long long x = (1LL << (m - i - 1)) - how_many(res + 0 , deleted); if (x >= curr) res.push_back( 0 ); else { res.push_back( 1 ); curr -= x; } } cout << res << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; long long ans = 0; int n, m, w[2010]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &w[i]); } for (int i = 1, a, b; i <= m; i++) { scanf( %d%d , &a, &b); ans += min(w[a], w[b]); } printf( %d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; map<string, int> g; bool can; int n, i; char s[100][5]; void find(int x) { char temp[10]; string ss; int j; if (x == 1) { can = true; return; } if ((s[x][0] == s[x - 1][0]) || (s[x][1] == s[x - 1][1])) { strcpy(temp, s[x - 1]); strcpy(s[x - 1], s[x]); ss.clear(); for (j = 1; j <= x - 1; j++) ss = ss + s[j]; if (g[ss] == 0) { g[ss] = 1; find(x - 1); } strcpy(s[x - 1], temp); } if (x > 3) if ((s[x][0] == s[x - 3][0]) || s[x][1] == s[x - 3][1]) { strcpy(temp, s[x - 3]); strcpy(s[x - 3], s[x]); for (j = 1; j <= x - 1; j++) ss = ss + s[j]; if (g[ss] == 0) { g[ss] = 1; find(x - 1); } strcpy(s[x - 3], temp); } } int main() { can = false; cin >> n; g.clear(); memset(s, 0, sizeof(s)); for (i = 1; i <= n; i++) scanf( %s , s[i]); find(n); if (can) cout << YES << endl; else cout << NO << endl; }
#include <bits/stdc++.h> using namespace std; int main() { long long m, n, p[30], ans; cin >> m >> n; for (__typeof(0) i = 0; i <= n - 1; i++) { cout << 1 n ; fflush(stdout); cin >> ans; if (ans == 0) return 0; if (ans == -1) p[i] = 0; else p[i] = 1; } long long low = 1, high = m, mid, i = 0; while (low <= high) { mid = (low + high) / 2; cout << mid << n ; fflush(stdout); cin >> ans; if (p[i] == 0) ans *= -1; i = (i + 1) % n; if (ans == 0 || ans == -2 || ans == 2) return 0; if (ans == -1) high = mid - 1; else if (ans == 1) low = mid + 1; else return 0; } return 0; }
#include <bits/stdc++.h> inline int Abs(int x) { return x < 0 ? -x : x; } inline int Sgn(int x) { return x < 0 ? -1 : 1; } const int MN = 100005, Sig = 26; const int ML = 100005; const int MQ = 100005; const int T = 400; const int B = 400; int N, Id[MN], Len[MN]; char str[ML]; int nxt[ML][Sig], faz[ML], fail[ML], Num[ML], cnt; int que[ML], l, r; std::vector<int> G[ML]; inline int Ins(char *S) { int now = 0; for (; *S; ++S) { int j = *S - a ; if (!nxt[now][j]) nxt[now][j] = ++cnt, faz[cnt] = now; now = nxt[now][j]; } return now; } inline void BuildAC() { fail[0] = faz[0] = -1; que[l = r = 1] = 0; while (l <= r) { int u = que[l++]; for (int j = 0; j < Sig; ++j) { if (nxt[u][j]) { fail[nxt[u][j]] = u ? nxt[fail[u]][j] : 0; G[fail[nxt[u][j]]].push_back(nxt[u][j]); que[++r] = nxt[u][j]; } else nxt[u][j] = u ? nxt[fail[u]][j] : 0; } } } int ldf[ML], rdf[ML], dfc; void DFS(int u) { ldf[u] = ++dfc; for (auto v : G[u]) DFS(v); rdf[u] = dfc; } int blk[ML], add[ML], tag[ML / B + 10]; inline void Add(int ql, int qr) { if (blk[ql] == blk[qr]) for (int i = ql; i <= qr; ++i) ++add[i]; else { for (int i = ql; blk[i] == blk[ql]; ++i) ++add[i]; for (int i = qr; blk[i] == blk[qr]; --i) ++add[i]; for (int i = blk[ql] + 1; i < blk[qr]; ++i) ++tag[i]; } } inline int Qur(int p) { return add[p] + tag[blk[p]]; } int Q, ql[MQ], qr[MQ], qk[MQ]; long long Ans[MQ]; std::vector<std::pair<int, int>> C0[MN], C1[MN]; int main() { scanf( %d%d , &N, &Q); for (int i = 1; i <= N; ++i) { scanf( %s , str); Len[i] = strlen(str); Id[i] = Ins(str); } BuildAC(); DFS(0); for (int i = 1; i <= dfc; ++i) blk[i] = (i - 1) / B + 1; for (int i = 1; i <= Q; ++i) { scanf( %d%d%d , &ql[i], &qr[i], &qk[i]); if (ql[i] > 1) C0[ql[i] - 1].push_back({qk[i], -i}); C0[qr[i]].push_back({qk[i], i}); } for (int i = 1; i <= N; ++i) { Add(ldf[Id[i]], rdf[Id[i]]); for (auto j : C0[i]) { if (Len[j.first] > T) C1[j.first].push_back({i, j.second}); else { int k = j.first; long long Sum = 0; for (int x = Id[k]; x != -1; x = faz[x]) Sum += Qur(ldf[x]); Ans[Abs(j.second)] += Sgn(j.second) * Sum; } } } for (int i = 1; i <= N; ++i) if (Len[i] > T) { for (int x = Id[i]; x != -1; x = faz[x]) ++Num[x]; for (int j = r; j > 1; --j) Num[fail[que[j]]] += Num[que[j]]; int p = 0; long long Sum = 0; for (auto x : C1[i]) { while (p < x.first) Sum += Num[Id[++p]]; Ans[Abs(x.second)] += Sgn(x.second) * Sum; } for (int j = 0; j <= cnt; ++j) Num[j] = 0; } for (int i = 1; i <= Q; ++i) printf( %lld n , Ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 2 * 100 * 1000 + 100; int n, dp[MAXN], d[MAXN], mark[MAXN], ans[MAXN], D = 0, MIN = MAXN; pair<int, int> par[MAXN]; vector<pair<int, int> > g[MAXN]; vector<int> q, depth[MAXN], res; void bfs() { for (int i = 0; i < q.size(); i++) { int v = q[i]; for (int j = 0; j < g[v].size(); j++) { int u = g[v][j].first; if (!mark[u]) { mark[u] = true; par[u] = make_pair(v, (g[v][j].second + 1) % 2); d[u] = d[v] + 1; D = max(D, d[u]); depth[d[u]].push_back(u); q.push_back(u); } } } } int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; x--, y--; g[x].push_back(make_pair(y, 0)); g[y].push_back(make_pair(x, 1)); } d[0] = 0; mark[0] = true; q.push_back(0); depth[0].push_back(0); bfs(); for (int i = D - 1; i >= 0; i--) { for (int j = 0; j < depth[i].size(); j++) { int v = depth[i][j]; for (int z = 0; z < g[v].size(); z++) { int u = g[v][z].first; if (u != par[v].first) dp[v] += dp[u] + g[v][z].second; } } } ans[0] = dp[0]; MIN = ans[0]; for (int i = 1; i <= D; i++) { for (int j = 0; j < depth[i].size(); j++) { int v = depth[i][j]; int p = par[v].first; ans[v] = ans[p]; if (par[v].second == 0) ans[v] -= 1; else ans[v] += 1; MIN = min(ans[v], MIN); } } cout << MIN << endl; for (int i = 0; i < n; i++) if (ans[i] == MIN) cout << i + 1 << ; return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) const int INF = 0x3f3f3f3f3f, mod = 1e9 + 7; const double eps = 1e-6, PI = acos(-1); template <typename T> inline void read(T &x) { x = 0; T f = 1; char ch; do { ch = getchar(); if (ch == - ) f = -1; } while (ch < 0 || ch > 9 ); do x = x * 10 + ch - 0 , ch = getchar(); while (ch <= 9 && ch >= 0 ); x *= f; } long long n, m; int main() { read(n), read(m); long long min1 = max(0LL, n - m * 2); if (m == 0) { printf( %lld %lld n , n, n); return 0; } long long max1 = 0; for (int i = 2; i <= n; i++) { long long now = 1LL * i * (i - 1) / 2; if (m <= now) { max1 = n - i; break; } } printf( %lld %lld n , min1, max1); return 0; }
#include <bits/stdc++.h> using namespace std; int INF = 100000000; int n, m, x, y; char ch; long long int pre[2][(int)1e3 + 5], dp[2][(int)1e3 + 5]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> x >> y; memset(pre, 0, sizeof(pre)); memset(dp, 0, sizeof(dp)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> ch; if (ch == . ) pre[1][j]++; else pre[0][j]++; } } for (int i = 1; i <= m; i++) { pre[0][i] += pre[0][i - 1]; pre[1][i] += pre[1][i - 1]; } for (int i = 1; i <= m; i++) { dp[0][i] = INT_MAX; dp[1][i] = INT_MAX; for (int j = x; j <= y; j++) { if (i - j < 0) { break; } dp[0][i] = min(dp[0][i], dp[1][i - j] + pre[0][i] - pre[0][i - j]); dp[1][i] = min(dp[1][i], dp[0][i - j] + pre[1][i] - pre[1][i - j]); } } cout << min(dp[0][m], dp[1][m]) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 100007, INF = 1000000007; int main() { int n, m, k, cnt = 0; long long d[MAXN], d1[MAXN]; vector<pair<int, int> > G[MAXN]; pair<long long, int> used[MAXN]; set<pair<long long, int> > S; scanf( %d%d%d , &n, &m, &k); for (int i = (1); i < (n); ++i) d[i] = d1[i] = 1LL * INF * INF; for (int i = (0); i < (m); ++i) { int u, v, x; scanf( %d%d%d , &u, &v, &x); --u; --v; G[u].push_back(make_pair(v, x)); G[v].push_back(make_pair(u, x)); } for (int i = (0); i < (k); ++i) { int s, ys; scanf( %d%d , &s, &ys); --s; d[s] = min(d[s], 1LL * ys); } d1[0] = d[0] = 0; for (int i = (0); i < (n); ++i) S.insert(make_pair(d[i], i)); for (int j = (0); j < (n); ++j) { int v = S.begin()->second, to; for (int i = (0); i < (((int)(G[v]).size())); ++i) { to = G[v][i].first; if (S.count(make_pair(d[to], to)) && d[v] + G[v][i].second < d[to]) { S.erase(make_pair(d[to], to)); d[to] = d[v] + G[v][i].second; S.insert(make_pair(d[to], to)); } } S.erase(S.begin()); used[j] = make_pair(d[v], v); } sort(used, used + n); for (int i = (0); i < (n); ++i) { int v = used[i].second, to; for (int j = (0); j < (((int)(G[v]).size())); ++j) { to = G[v][j].first; d1[v] = min(d1[v], d1[to] + G[v][j].second); } if (d1[v] != d[v]) ++cnt; d1[v] = d[v]; } printf( %d , k - cnt); return 0; }
#include <bits/stdc++.h> using namespace std; long long powerFunction(long long x, long long y) { long long res = 1; long long p = 1000000007; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bool prime[10000001]; long long P = 1000000007 - 2; long long fact[10000001] = {0}; void sieveFunction(long long maxLimit) { memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for (long long i = 2; maxLimit >= i; i++) { if (prime[i]) { for (long long j = 2 * i; maxLimit >= j; j += i) prime[j] = false; } } } void factorialFunction(long long maxLimit) { fact[0] = 1; for (long long i = 1; i <= maxLimit; i++) fact[i] = (fact[i - 1] * i) % 1000000007; return; } long long nCr(long long n, long long r) { long long a = fact[n]; long long b = powerFunction(fact[n - r], 1000000007 - 2); long long c = powerFunction(fact[r], 1000000007 - 2); return (a * (b % 1000000007 * c % 1000000007) % 1000000007) % 1000000007; } signed main() { long long n; cin >> n; vector<pair<long long, long long>> adj[n + 1]; long long vis[n + 1]; long long ind; long long f; for (long long i = 0; i < n - 1; i++) { vis[i] = -1; long long u, v; cin >> u >> v; adj[u].push_back({i, v}); adj[v].push_back({i, u}); } long long p = 0; for (long long i = 1; i < n + 1; i++) { if ((long long)adj[i].size() < 3) continue; else { for (auto it : adj[i]) { if (vis[it.first] == -1) { vis[it.first] = p; p++; } } } } for (long long i = 0; i < n - 1; i++) { if (vis[i] == -1) { vis[i] = p; p++; } cout << vis[i] << n ; } }
#include <bits/stdc++.h> using namespace std; vector<vector<int>> edge; int n, m; int parent[100000]; int size[100000]; int visited[100000]; int finished[100000]; int has_loop[100000]; int find_root(int v) { if (parent[v] == -1) { return v; } return parent[v] = find_root(parent[v]); } void merge(int u, int v) { u = find_root(u), v = find_root(v); if (u == v) { return; } if (size[u] < size[v]) { merge(v, u); return; } parent[v] = u; size[u] += size[v]; } void dfs(int here) { visited[here] = true; for (int there : edge[here]) { if (finished[there]) { continue; } else if (visited[there]) { has_loop[find_root(here)] = 1; } else { dfs(there); } } finished[here] = true; } void loop_check() { for (int i = 0; i < n; i++) { if (!visited[i]) { dfs(i); } } } int main() { cin >> n >> m; edge = vector<vector<int>>(n, vector<int>()); for (int i = 0; i < n; i++) { parent[i] = -1; size[i] = 1; } for (int i = 0; i < m; i++) { int from, to; cin >> from >> to; edge[from - 1].push_back(to - 1); merge(from - 1, to - 1); } vector<int> wcc_list; for (int i = 0; i < n; i++) { if (find_root(i) == i) { wcc_list.push_back(i); } } loop_check(); int ans = 0; for (int wcc : wcc_list) { ans += size[wcc] - 1; if (has_loop[wcc]) { ans++; } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int T, a[4], ans; inline bool cmp(int x, int y) { return x > y; } int main() { scanf( %d , &T); while (T--) { ans = 0; scanf( %d%d%d , &a[1], &a[2], &a[3]); sort(a + 1, a + 3 + 1, cmp); for (int i = 1; i <= 3; ++i) { if (a[i]) a[i]--, ans++; } for (int i = 1; i <= 2; ++i) { for (int j = i + 1; j <= 3; ++j) { if (a[i] && a[j]) ans++, a[i]--, a[j]--; } } if (a[1] && a[2] && a[3]) ans++; cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int dp[1001001][2]; vector<int> G[1001001]; int ans[1001001] = {}; int ma[1001001] = {}; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; for (int i = 0; i < (n); ++i) for (int j = 0; j < (2); ++j) dp[i][j] = 0; for (int i = (n)-1; i >= 0; --i) { if (i == n - 1) { if (s[i] == 0 ) { dp[i][0] = 1; } else if (s[i] == 1 ) { dp[i][1] = 1; } else { dp[i][0] = 1; dp[i][1] = 1; } } else { if (s[i] == 0 ) { dp[i][0] = dp[i + 1][0] + 1; } else if (s[i] == 1 ) { dp[i][1] = dp[i + 1][1] + 1; } else { dp[i][0] = dp[i + 1][0] + 1; dp[i][1] = dp[i + 1][1] + 1; } } ma[i] = max(dp[i][0], dp[i][1]); if (i > 0) { if (s[i - 1] == 0 && s[i] != 0 ) { for (int j = 0; j < (dp[i][1]); ++j) { G[j + 1].push_back(i); } } if (s[i - 1] == 1 && s[i] != 1 ) { for (int j = 0; j < (dp[i][0]); ++j) { G[j + 1].push_back(i); } } } } set<int> se; for (int i = 0; i < (n + 1); ++i) { sort(G[i].begin(), G[i].end()); } for (int i = (n + 1) - 1; i >= 0; --i) { if (i <= 20) break; if (i == 0) break; int now = 0; int ite = 0; int m = G[i].size(); while (now < n) { if (ma[now] >= i) { ans[i]++; now += i; } else { while (ite < m) { if (G[i][ite] >= now) { break; } ite++; } if (ite == m) break; ans[i]++; now = G[i][ite] + i; } } } for (int i = 1; i < 21; ++i) { if (i > n) break; int now = 0; while (now < n) { if (ma[now] >= i) { ans[i]++; now += i; } else { now++; } } } for (int i = 1; i < n + 1; ++i) printf( %d , ans[i]); cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } long long f[2001], dp[2001][2001], m = 998244353; long long fun(long long i, long long j) { if (i == 0) return (f[j]); else return (f[j] - f[i - 1]); } long long fpow(long long a, long long p) { if (p == 0) return (1); long long b = fpow(a, p / 2); if (p % 2 == 0) return ((b * b) % m); else return ((((b * b) % m) * a) % m); } int main() { string s; cin >> s; if (s[0] == ? ) f[0] = 1; for (long long i = 1; i < s.length(); i++) { if (s[i] == ? ) f[i] += 1; f[i] += f[i - 1]; } for (long long i = 2; i <= s.length(); i++) { for (long long j = 0; j <= (s.length() - i); j++) { if (s[j] != ( ) dp[j][j + i - 1] = (dp[j][j + i - 1] + dp[j + 1][j + i - 1]) % m; if (s[j + i - 1] != ) ) dp[j][j + i - 1] = (dp[j][j + i - 1] + dp[j][j + i - 2]) % m; if ((s[j] != ( ) && (s[j + i - 1] != ) )) dp[j][j + i - 1] = (dp[j][j + i - 1] - dp[j + 1][j + i - 2] + m) % m; if ((s[j] != ) ) && (s[j + i - 1] != ( )) dp[j][j + i - 1] = (dp[j][j + i - 1] + dp[j + 1][j + i - 2] + (long long)fpow(2, fun(j + 1, j + i - 2))) % m; } } cout << dp[0][s.length() - 1]; }
#include <bits/stdc++.h> using namespace std; template <typename T, typename T1> T amax(T& a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T amin(T& a, T1 b) { if (b < a) a = b; return a; } const long long N = 200005, INF = 2000000000000000000; const long long SIX = 1000000; bool prime(long long n) { long long i = 0; for (i = 2; i * i <= n; i++) { if (n % i == 0) { return false; } } return true; } void solve() { long long n, k; cin >> n >> k; string s; cin >> s; long long i = 0; long long ans = 0; if (n == 1 && k != 0) { cout << 0 ; return; } for (i = 0; i < n; i++) { if (i == 0 && ans < k) { if (s[i] != 1 ) { s[i] = 1 ; ans++; } } else if (i > 0 && ans < k) { if (s[i] != 0 ) { s[i] = 0 ; ans++; } } } cout << s << n ; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(NULL); long long t; t = 1; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, long long> ma; void put(long long u, long long v, long long w) { while (v != u) { long long par; if (v > u) { par = v / 2; ma[make_pair(par, v)] += w; ma[make_pair(v, par)] += w; v /= 2; } else { par = u / 2; ma[make_pair(par, u)] += w; ma[make_pair(u, par)] += w; u /= 2; } } } long long solve(long long u, long long v) { long long ans = 0; while (v != u) { long long par; if (v > u) { par = v / 2; ans += ma[make_pair(par, v)]; v /= 2; } else { par = u / 2; ans += ma[make_pair(par, u)]; u /= 2; } } return ans; } int main() { long long u, v, w, ans; int q, ty; cin >> q; while (q--) { cin >> ty; if (ty == 1) { cin >> u >> v >> w; put(u, v, w); } else { cin >> u >> v; cout << solve(u, v) << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<ll, ll>; using PP = pair<ll, P>; const ll n_ = 2222 + 100, inf = 1e18 + 1, mod = 1e9 + 7, sqrtN = 333; ll dy[4] = {-1, 0, 1, 0}, dx[4] = {0, 1, 0, -1}; ll n, m, k, tc = 1, a, b, c, sum, x, y, z, w, base, ans; ll gcd(ll x, ll y) { if (!y) return x; return gcd(y, x % y); } ll dp[n_][n_][2], A[n_][n_]; void solve() { ll q; cin >> n >> m >> q; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) A[i][j] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { dp[i][j][0] = A[i][j] * (dp[i][j - 1][1] + A[i][j - 1]); dp[i][j][1] = A[i][j] * (dp[i - 1][j][0] + A[i - 1][j]); ans += dp[i][j][0] + dp[i][j][1] + A[i][j]; } ll i, j; while (q--) { cin >> i >> j; ans -= dp[i][j][0] + dp[i][j][1] + A[i][j]; A[i][j] ^= 1; dp[i][j][0] = A[i][j] * (dp[i][j - 1][1] + A[i][j - 1]); dp[i][j][1] = A[i][j] * (dp[i - 1][j][0] + A[i - 1][j]); ans += dp[i][j][0] + dp[i][j][1] + A[i][j]; b = i + 1, a = j, c = 0; while (1) { if (b > n || a > m) break; ans -= dp[b][a][0] + dp[b][a][1] + A[b][a]; dp[b][a][0] = A[b][a] * (dp[b][a - 1][1] + A[b][a - 1]); dp[b][a][1] = A[b][a] * (dp[b - 1][a][0] + A[b - 1][a]); ans += dp[b][a][0] + dp[b][a][1] + A[b][a]; if (c) b++; else a++; c = (c + 1) % 2; } b = i, a = j + 1, c = 1; while (1) { if (b > n || a > m) break; ans -= dp[b][a][0] + dp[b][a][1] + A[b][a]; dp[b][a][0] = A[b][a] * (dp[b][a - 1][1] + A[b][a - 1]); dp[b][a][1] = A[b][a] * (dp[b - 1][a][0] + A[b - 1][a]); ans += dp[b][a][0] + dp[b][a][1] + A[b][a]; if (c) b++; else a++; c = (c + 1) % 2; } cout << ans << n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); while (tc--) solve(); }
#include <bits/stdc++.h> using namespace std; int main() { string str, s = QWERTYUIOPASDFGHJKLZXCVBNM ; cin >> str; set<char> m; long long result = 1; for (int i = 0; i < str.size(); i++) { if (str[i] == ? ) { if (i == 0) { result *= 9; } else result *= 10; } else if (s.find(str[i]) != string::npos) { if (i == 0) { result *= 9; m.insert(str[i]); } else { if (m.find(str[i]) == m.end()) { result *= (10 - m.size()); m.insert(str[i]); } } } } cout << result << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100010; int T, n, cnt, now[N], ans[N]; char ch[N]; vector<int> A, B, C; map<pair<int, int>, bool> col; inline void ask() { int i, j; if (!A.size()) return; printf( Q %d , (int)A.size()); for (i = 0; i < A.size(); i++) printf( %d %d , A[i], B[i]); puts( ); fflush(stdout); scanf( %s , ch + 1); for (i = 1; i <= A.size(); i++) col[make_pair(A[i - 1], B[i - 1])] = (ch[i] == 1 ); } int main() { int i, j, t; cin >> T; while (T--) { cnt = 0, col.clear(); memset(ans, 0, sizeof(ans)); scanf( %d , &n); A.clear(), B.clear(); for (int i = 2; i <= n; i += 2) { A.push_back(i - 1); B.push_back(i); } ask(); A.clear(); B.clear(); for (int i = 3; i <= n; i += 2) { A.push_back(i - 1); B.push_back(i); } ask(); now[++cnt] = 1; for (int i = 2; i <= n; i++) if (!col[make_pair(i - 1, i)]) now[++cnt] = i; A.clear(); B.clear(); for (int i = 3; i <= cnt; i += 4) A.push_back(now[i - 2]), B.push_back(now[i]); for (int i = 4; i <= cnt; i += 4) A.push_back(now[i - 2]), B.push_back(now[i]); ask(); A.clear(); B.clear(); for (int i = 5; i <= cnt; i += 4) A.push_back(now[i - 2]), B.push_back(now[i]); for (int i = 6; i <= cnt; i += 4) A.push_back(now[i - 2]), B.push_back(now[i]); ask(); ans[now[1]] = 1; if (cnt > 1) ans[now[2]] = 2; for (int i = 3; i <= cnt; i++) { if (col[make_pair(now[i - 2], now[i])]) ans[now[i]] = ans[now[i - 2]]; else ans[now[i]] = 6 - ans[now[i - 2]] - ans[now[i - 1]]; } A.clear(); B.clear(); C.clear(); for (int i = 1, t; i <= n; i++) { if (ans[i]) t = ans[i]; ans[i] = t; if (ans[i] == 1) A.push_back(i); else if (ans[i] == 2) B.push_back(i); else if (ans[i] == 3) C.push_back(i); } printf( A %d %d %d n , (int)A.size(), (int)B.size(), (int)C.size()); for (int i = 0; i < A.size(); i++) printf( %d , A[i]); puts( ); for (int i = 0; i < B.size(); i++) printf( %d , B[i]); puts( ); for (int i = 0; i < C.size(); i++) printf( %d , C[i]); puts( ); fflush(stdout); } }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( no-stack-protector ) #pragma GCC target( sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native ) using namespace std; signed main() { cin.tie(nullptr)->sync_with_stdio(false); long long n, k; cin >> n >> k; string s, t; cin >> s >> t; long long ans = 0, hv = 1; for (long long i = 0; i < n; i++) { if (hv < k) { hv *= 2; if (s[i] == t[i]) { hv--; } else if (s[i] == b && t[i] == a ) { hv -= 2; } hv = min(hv, k); } ans += hv; } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; vector<long long> a(2 * n); for (long long i = 0; i < 2 * n; ++i) { cin >> a[i]; } sort(a.begin(), a.end()); if (n == 1) { cout << 0; return 0; } long long mn = 2e9; for (long long i = 1; i < n; ++i) { mn = min(a[i + n - 1] - a[i], mn); } cout << min(min((a[n - 1] - a[0]) * (a[2 * n - 1] - a[n]), (a[2 * n - 1] - a[n]) * (a[n - 1] - a[0])), mn * (a[2 * n - 1] - a[0])); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int MOD = 998244353; long long fac[MAXN]; struct Edge { int to, next; } edge[MAXN * 2]; int head[MAXN], tot; void AddEdge(int s, int t) { edge[tot].to = t; edge[tot].next = head[s]; head[s] = tot++; edge[tot].to = s; edge[tot].next = head[t]; head[t] = tot++; } int visit[MAXN]; void init() { memset(head, -1, sizeof(head)); memset(visit, 0, sizeof(visit)); tot = 0; } long long DFS(int u) { visit[u] = 1; long long ret = 1; int cnt = 1; if (u == 1) cnt = 0; for (int e = head[u]; e != -1; e = edge[e].next) { int v = edge[e].to; if (!visit[v]) { cnt++; ret = (ret * DFS(v)) % MOD; } } ret = (ret * fac[cnt]) % MOD; return ret; } int main() { int n; cin >> n; long long fa = 1; for (int i = 1; i < MAXN; i++) { fa = (fa * i) % MOD; fac[i] = fa; } init(); int u, v; for (int i = 0; i < n - 1; i++) { scanf( %d%d , &u, &v); AddEdge(u, v); } cout << (DFS(1) * n) % MOD << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int block; unordered_map<int, int> x; vector<long long> a; struct query { int l, r, pos; bool operator<(const query &other) const { if (l / block == other.l / block) return r < other.r; return l / block < other.l / block; } }; int l = 0, r = -1, cnt = 0; void remove(int val) { if (x[val] == val) cnt--; x[val]--; if (x[val] == val) cnt++; if (x[val] == 0) x.erase(val); } void add(int val) { if (x[val] == val) cnt--; x[val]++; if (x[val] == val) cnt++; } void solve() { long long n, m; cin >> n >> m; block = sqrt(n) + 1; a.resize(n); for (long long i = 0; i < n; i++) cin >> a[i]; vector<query> q(m); for (int i = 0; i < m; i++) { cin >> q[i].l >> q[i].r; q[i].pos = i; q[i].l--, q[i].r--; } sort(q.begin(), q.end()); vector<int> ans(m); for (int i = 0; i < m; i++) { while (l < q[i].l) remove(a[l++]); while (l > q[i].l) add(a[--l]); while (r < q[i].r) add(a[++r]); while (r > q[i].r) remove(a[r--]); ans[q[i].pos] = cnt; } for (auto i : ans) cout << i << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int n; int a[110]; long long g[110], f[110][110][110]; char s[110]; int main() { int L, R; scanf( %d , &n); gets(s); if (s[0] != 0 ) gets(s); for (int i = 1; i <= n; i++) { scanf( %d , &g[i]); for (int j = 1; j < i; j++) g[i] = max(g[i], g[j] + g[i - j]); } for (int i = 1; i <= n; i++) a[i] = s[i - 1] - 48; for (int t = 0; t < n; t++) for (int i = 1; i <= n - t; i++) for (int k = 1; k <= i; k++) { f[i][i + t][k] = g[k] + f[i + 1][i + t][1]; for (int j = 1; j <= t; j++) if (a[i] == a[i + j]) f[i][i + t][k] = max(f[i][i + t][k], f[i + 1][i + j - 1][1] + f[i + j][i + t][k + 1]); } printf( %I64d n , f[1][n][1]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; map<int, int> m; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] != 0) { m[arr[i]]++; } } cout << m.size() << endl; return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:536870912 ) #pragma warning(disable : 4996) using namespace std; const int N = 2e5 + 100, X[2] = {997, 449}; char s[N], t[N]; long long int h[2][N], p[2][N]; int w[N], g[N], lb[N], rb[N]; int n; pair<long long int, long long int> getH(int l, int r) { return {h[0][r] - h[0][l - 1] * p[0][r - l + 1], h[1][r] - h[1][l - 1] * p[1][r - l + 1]}; } int lcp(int a, int b) { int l = 0, r = n - max(a, b) + 1; while (r - l > 1) { int p = (r + l) >> 1; if (getH(a + 1, a + p) == getH(b + 1, b + p)) l = p; else r = p; } return l; } int main() { scanf( %d %s %s , &n, s, t); reverse(s, s + n); reverse(t, t + n); for (int i = 0; i < 2; i++) { p[i][0] = 1; for (int j = 0; j < n; j++) { p[i][j + 1] = p[i][j] * X[i]; h[i][j + 1] = h[i][j] * X[i] + s[j]; } } int c = 0; for (int i = 0; i < n; i++) { if (t[i] == 0 ) w[c++] = i; } sort(w, w + c, [](int a, int b) { int x = lcp(a, b); return s[a + x] < s[b + x]; }); for (int i = 0; i < c - 1; i++) { g[i] = lcp(w[i], w[i + 1]); } vector<int> v; for (int i = 0; i < c - 1; i++) { while (!v.empty() && g[v.back()] >= g[i]) v.pop_back(); lb[i] = v.empty() ? -1 : v.back(); v.push_back(i); } v.clear(); for (int i = c - 2; i >= 0; i--) { while (!v.empty() && g[v.back()] >= g[i]) v.pop_back(); rb[i] = v.empty() ? c - 1 : v.back(); v.push_back(i); } long long int ans = 0; for (int i = 0; i < c; i++) ans = max(ans, (long long int)n - w[i]); for (int i = 0; i < c - 1; i++) { ans = max(ans, g[i] * (long long int)(rb[i] - lb[i])); } printf( %lld , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int N = 20 + 5; int go[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; int n, m, k; char s[N][N]; struct Node { int x, y, v; } t[N]; int tot; int sx, sy; struct State { int x, y, S; }; int vis[N][N][1 << 10]; int dis[N][N][1 << 10]; inline int calc(int S) { int sum = 0; for (register int i = 1; i <= k; i++) if (S & (1 << (i - 1))) { sum += t[i].v; } return sum; } inline int ok(int x, int y, int nx, int ny, int i) { if (nx == t[i].x && ny < t[i].y) if (x < nx) return 1; if (x == t[i].x && y < t[i].y) if (x > nx) return 1; return 0; } int main() { cin >> n >> m; k = 0; for (register int i = 1; i <= n; i++) { for (register int j = 1; j <= m; j++) { cin >> s[i][j]; if (s[i][j] == S ) sx = i, sy = j; if (isdigit(s[i][j])) { k = max(k, s[i][j] - 0 ); t[s[i][j] - 0 ] = {i, j, 0}; } } } for (register int i = 1; i <= k; i++) cin >> t[i].v; for (register int i = 1; i <= n; i++) for (register int j = 1; j <= m; j++) if (s[i][j] == B ) { t[++k] = {i, j, -inf / 1000}; } queue<State> Q; memset(dis, 0x3f, sizeof(dis)); Q.push(State{sx, sy, 0}); dis[sx][sy][0] = 0; int ans = 0; while (Q.size()) { State tmp = Q.front(); Q.pop(); int x = tmp.x, y = tmp.y, S = tmp.S; if (x == sx && y == sy) { ans = max(ans, calc(S) - dis[x][y][S]); } for (register int i = 0; i < 4; i++) { int nx = x + go[i][0]; int ny = y + go[i][1]; if (nx < 1 || ny < 1 || nx > n || ny > m || (s[nx][ny] != . && s[nx][ny] != S )) continue; int T = S; for (register int j = 1; j <= k; j++) if (ok(x, y, nx, ny, j)) T ^= (1 << (j - 1)); if (dis[nx][ny][T] == inf) { dis[nx][ny][T] = dis[x][y][S] + 1; Q.push(State{nx, ny, T}); } } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = (1 << 23); bool vis[maxn], num[maxn]; int n, m; void dfs(int x) { if (vis[x]) return; vis[x] = 1; for (int i = 0; i < n; i++) { if (x & (1 << i)) dfs(x ^ (1 << i)); } if (num[x]) dfs((1 << n) - 1 - x); } int main() { int x; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d , &x); num[x] = 1; } int ans = 0; for (int i = 0; i < (1 << n); i++) { if (num[i] && !vis[i]) dfs(((1 << n) - 1) & (~i)), ans++; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long c1, c2; int n, k; long long p(long long m) { long long mini = LLONG_MAX; for (int i = 1; i <= n; ++i) if ((n + i) / (i + 1) <= m and m <= n / i) mini = min(mini, 1LL * i * i * (m * (i + 1) - n) + 1LL * (i + 1) * (i + 1) * (n - m * i)); return m * (c1 + c2) - 2 * c2 * n + c2 * mini; } int main() { scanf( %d %lld %lld%*c , &n, &c1, &c2); for (int i = 0; i < n; ++i) k += getchar() == 1 ; int lo = 1, hi = k; while (lo < hi) { int mid = lo + (hi - lo) / 2; if (p(mid) <= p(mid + 1)) hi = mid; else lo = mid + 1; } printf( %lld n , p(lo)); return 0; }
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-5; int main() { int n, k; cin >> n >> k; vector<int> cur(n); vector<int> p(n); vector<int> goal(n); for (int i = 0; i < n; i++) { cin >> p[i]; } for (int i = 0; i < n; i++) cin >> goal[i]; bool ok = true; for (int i = 0; i < n; i++) { cur[i] = i + 1; if (goal[i] != cur[i]) ok = false; } if (ok) { cout << NO << endl; return 0; } int step_forward = 1000; int step_backward = 1000; for (int i = 0; i < k; i++) { bool ok = true; vector<int> nxt; for (int j = 0; j < n; j++) { nxt.push_back(cur[p[j] - 1]); if (nxt[j] != goal[j]) ok = false; } if (ok) { step_forward = i + 1; break; } cur = nxt; } cur = goal; for (int i = 0; i < k; i++) { bool ok = true; vector<int> nxt; for (int j = 0; j < n; j++) { nxt.push_back(cur[p[j] - 1]); if (nxt[j] != j + 1) ok = false; } if (ok) { step_backward = i + 1; break; } cur = nxt; } if (step_forward == 1 && step_backward == 1 && k > 1) { cout << NO << endl; return 0; } if (step_forward <= k && step_forward % 2 == k % 2) { cout << YES << endl; return 0; } if (step_backward <= k && step_backward % 2 == k % 2) { cout << YES << endl; return 0; } cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class A, class B> ostream& operator<<(ostream& out, const pair<A, B>& a) { return out << ( << a.first << , << a.second << ) ; } template <class A> ostream& operator<<(ostream& out, const vector<A>& v) { out << [ ; for (int i = 0; i < v.size(); i++) { if (i) out << , ; out << v[i]; } return out << ] ; } bool Check(int n, int pos) { return (bool)(n & (1 << pos)); } struct edg { long long to, w, c; }; vector<edg> g[100005]; vector<long long> v1, v2; int vis[100005]; long long sum, s; void calc(long long ws, long long lf, long long c) { while (ws) { long long wy = ws; ws /= 2LL; wy = wy - ws; if (c == 1) v1.emplace_back(wy * lf); else v2.emplace_back(wy * lf); } } long long dfs(long long i, long long ws) { vis[i] = 1; long long ret = 0; bool is_leaf = true; for (auto j : g[i]) { if (vis[j.to] == -1) { is_leaf = false; int r = dfs(j.to, ws + j.w); ret += r; calc(j.w, r, j.c); } } if (is_leaf) { sum += ws; return 1LL; } return ret; } void solve() { int n; cin >> n >> s; for (int i = 1; i < n; i++) { int u, v, w, c; cin >> u >> v >> w >> c; u--, v--; g[u].push_back({v, w, c}); g[v].push_back({u, w, c}); } memset(vis, -1, sizeof(vis)); dfs(0, 0); sort(v1.begin(), v1.end(), greater<long long>()); sort(v2.begin(), v2.end(), greater<long long>()); int len1 = v1.size(); int len2 = v2.size(); long long res = 0; int i = -1, j = 0; while (sum > s && i + 1 < len1) { res++; i++; sum -= v1[i]; } while (sum > s && j < len2) { res += 2; sum -= v2[j]; j++; } long long cur = res; while (i >= 0) { sum += v1[i]; cur--; i--; while (sum > s && j < len2) { sum -= v2[j]; cur += 2; j++; } if (sum <= s) { res = min(res, cur); } } cout << res << n ; for (int i = 0; i <= n; i++) g[i].clear(); v1.clear(); v2.clear(); sum = 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int q = 1; cin >> q; for (int kase = 1; kase <= q; kase++) { solve(); } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; int main() { int n; scanf( %d , &n); if (n % 2 == 0) { printf( -1 n ); return 0; } for (int i = 0; i < n; ++i) { printf( %d , i); } printf( n ); for (int i = 0; i < n; ++i) { printf( %d , (i + 1) % n); } printf( n ); for (int i = 0; i < n; ++i) { printf( %d , (2 * i + 1) % n); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string a; int n, m; cin >> a >> n; m = a.size(); string ans = ; while (n--) { string b; cin >> b; if (b.substr(0, 0 + m) == a) { if (ans == ) ans = b; else if (b < ans) ans = b; } } if (ans != ) cout << ans; else cout << a; }
#include <bits/stdc++.h> using namespace std; int n, m, x, q[100100]; char t; vector<int> d; bool used[100100]; void calc(int x) { d.resize(0); for (int i = 2; i * i <= x; i++) if (x % i == 0) { while (x % i == 0) x /= i; d.push_back(i); } if (x != 1) d.push_back(x); } int main() { scanf( %d%d n , &n, &m); memset((used), (false), sizeof((used))); memset((q), (0), sizeof((q))); for (int i = 0; i < (m); i++) { while (t = getchar(), t != + && t != - ) ; scanf( %d , &x); if (t == + ) { if (used[x]) { puts( Already on ); continue; } calc(x); bool ok = true; for (int j = 0; j < (d.size()); j++) if (q[d[j]]) { printf( Conflict with %d n , q[d[j]]); ok = false; break; } if (ok) { for (int j = 0; j < (d.size()); j++) q[d[j]] = x; used[x] = true; puts( Success ); } } else { if (!used[x]) { puts( Already off ); continue; } used[x] = false; calc(x); for (int j = 0; j < (d.size()); j++) q[d[j]] = 0; puts( Success ); } } }
#include <bits/stdc++.h> using namespace std; int n, m, notFind; vector<pair<int, int>> edge[100001]; vector<int> ans[2], e[2]; int vis[100001]; void DFS(int u, int c, int vit) { vis[u] = c; e[c].push_back(u); for (auto k : edge[u]) { int v, col, nextCol; tie(v, col) = k; col = (col + c) % 2; nextCol = col == vit ? 0 : 1; if (vis[v] != -1) { if (vis[v] != nextCol) notFind = 1; continue; } DFS(v, nextCol, vit); } } bool solve(int vit) { memset(vis, -1, sizeof(vis)); notFind = 0; for (int i = 1; i <= n; ++i) { if (vis[i] != -1) continue; e[0].clear(); e[1].clear(); DFS(i, 0, vit); if (notFind) return 0; if (e[0].size() > e[1].size()) swap(e[0], e[1]); for (auto j : e[0]) ans[vit].push_back(j); } return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < m; ++i) { int u, v; char chr; cin >> u >> v >> chr; edge[u].push_back({v, chr == R }); edge[v].push_back({u, chr == R }); } bool n1, n2; int id = 0; n1 = solve(0); n2 = solve(1); if (!n1 && !n2) return cout << -1 , 0; if (!n1 || n1 && n2 && ans[0].size() > ans[1].size()) id = 1; cout << ans[id].size() << n ; for (auto k : ans[id]) cout << k << ; return 0; }
#include <bits/stdc++.h> using namespace std; vector<long long> v[100]; int n; long long tmp; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int cnt = 0; scanf( %I64d , &tmp); while (tmp % 2 == 0) { tmp >>= 1; cnt++; } v[cnt].push_back(tmp); } tmp = 0; for (int i = 1; i <= 64; i++) if (v[i].size() > v[tmp].size()) tmp = i; printf( %d n , n - v[tmp].size()); for (int i = 0; i <= 64; i++) { if (i == tmp) continue; for (int j = 0; j < v[i].size(); j++) printf( %I64d , v[i][j] << i); } }
#include <bits/stdc++.h> using namespace std; int N; int X[6060], Y[6060]; long long C[4][4]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin.exceptions(ios::badbit | ios::failbit); cin >> N; for (int i = 1; i <= N; i++) cin >> X[i] >> Y[i]; long long res = 0; for (int i = 1; i <= N; i++) C[X[i] % 4][Y[i] % 4]++; res += C[0][0] * (C[0][0] - 1) * (C[0][0] - 2) / 6; res += C[0][2] * (C[0][2] - 1) * (C[0][2] - 2) / 6; res += C[2][0] * (C[2][0] - 1) * (C[2][0] - 2) / 6; res += C[2][2] * (C[2][2] - 1) * (C[2][2] - 2) / 6; for (int i = 1; i <= N; i++) for (int j = i + 1; j <= N; j++) { if (X[i] % 4 == X[j] % 4 && Y[i] % 4 == Y[j] % 4) { int x = X[i] % 4, y = Y[i] % 4; for (int nx = 0; nx < 4; nx += 2) for (int ny = 0; ny < 4; ny += 2) { if (nx == x && ny == y) continue; res += C[nx][ny]; } } } cout << res << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 * 2 + 5; const int maxd = 25; long long d[maxn], h[maxn], s[maxn], f[maxn], g[maxn]; int f_fst[maxd][maxn], f_snd[maxd][maxn], g_fst[maxd][maxn], g_snd[maxd][maxn]; void GetMax(long long a[], int &r0, int &r1, int x0, int x1, int y0, int y1) { if (a[x0] > a[y0]) { r0 = x0; r1 = x1 != x0 && a[x1] > a[y0] ? x1 : y0; } else if (a[x0] < a[y0]) { r0 = y0; r1 = y1 != y0 && a[y1] > a[x0] ? y1 : x0; } else { r0 = x0; if (x0 == y0) r1 = a[x1] > a[y1] ? x1 : y1; else r1 = y0; } } void BuildRMQ(long long a[maxn], int fst[][maxn], int snd[][maxn], int n) { for (int k = 0; (1 << k) <= n; k++) for (int i = 1; i + (1 << k) - 1 <= n; i++) if (k == 0) fst[k][i] = snd[k][i] = i; else { int j = i + (1 << k - 1); GetMax(a, fst[k][i], snd[k][i], fst[k - 1][i], snd[k - 1][i], fst[k - 1][j], snd[k - 1][j]); } } pair<int, int> QueryRMQ(long long a[maxn], int fst[][maxn], int snd[][maxn], int n, int x, int y) { for (int k = maxd - 1; k >= 0; k--) if ((y - x + 1) >> k) { int i = x, j = y - (1 << k) + 1; pair<int, int> ret; GetMax(a, ret.first, ret.second, fst[k][i], snd[k][i], fst[k][j], snd[k][j]); return ret; } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %I64d , &d[i]); s[i + 1] = s[i] + d[i]; } for (int i = 1; i <= n; i++) { scanf( %I64d , &h[i]); h[i + n] = h[i]; s[i + n + 1] = s[i + n] + d[i]; } for (int i = 1; i <= n * 2; i++) { f[i] = h[i] * 2LL - s[i]; g[i] = h[i] * 2LL + s[i]; } BuildRMQ(f, f_fst, f_snd, n * 2); BuildRMQ(g, g_fst, g_snd, n * 2); for (int i = 0; i < m; i++) { int ai, bi; scanf( %d%d , &ai, &bi); if (ai <= bi) ai += n; bi++; ai--; pair<int, int> fmax = QueryRMQ(f, f_fst, f_snd, n * 2, bi, ai); pair<int, int> gmax = QueryRMQ(g, g_fst, g_snd, n * 2, bi, ai); long long ans; if (fmax.first != gmax.first) ans = f[fmax.first] + g[gmax.first]; else ans = max(f[fmax.first] + g[gmax.second], f[fmax.second] + g[gmax.first]); printf( %I64d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { cout << INTERCAL << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int res = INT_MAX; int i, j; int n, d; int a[2018]; int main() { cin >> n >> d; for (int x = 0; x < n; x++) cin >> a[x]; sort(a, a + n); for (i = 0; i < n; i++) for (j = n - 1; j >= i; j--) { if (a[j] - a[i] <= d) { res = min(res, n - j + i - 1); break; } } return !printf( %d , res); }
#include <bits/stdc++.h> using namespace std; long long int mod = 1e9 + 7; long long int exp(long long int t, long long int x) { if (x == 0) return 1; if (x == 1) return t; if (x % 2 == 1) return (t * exp((t * t) % mod, x / 2)) % mod; if (x % 2 == 0) return exp((t * t) % mod, x / 2); } long long int gcd(long long int x, long long int y) { return x % y == 0 ? y : gcd(y, x % y); } long long int lcm(long long int x, long long int y) { return x * (y / gcd(x, y)); } long long int bsum(long long int u, long long int b) { return u < b ? u : bsum(u / b, b) + u % b; } long long int prival(long long int u, long long int p) { int cn = 0; while (u % p == 0) { cn++; u = u / p; } return cn; } bool isprime(long long int x) { for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) { return false; } } return true; } void YAY(void) { cout << YES << endl; } void NAY(void) { cout << NO << endl; } struct var { string id; string val; int def; int V1, V2; string OP; } num[5111]; int temp[5111]; map<string, int> go; string mmin, mmax; int n, m; int getbit(int loc, int b) { int i; int ret = 0; for (i = 1; i <= n; i++) { temp[i] = 0; } for (i = 1; i <= n; i++) { if (num[i].def == 0) { ret += num[i].val[loc] - 0 ; temp[i] = num[i].val[loc] - 0 ; } else { int u, v; if (num[i].V1 == 0) { u = b; } else if (num[i].V1 != 0) { u = temp[num[i].V1]; } if (num[i].V2 == 0) { v = b; } else if (num[i].V2 != 0) { v = temp[num[i].V2]; } if (num[i].OP == XOR ) { ret += u ^ v; temp[i] = u ^ v; } else if (num[i].OP == OR ) { ret += u | v; temp[i] = u | v; } else if (num[i].OP == AND ) { ret += u & v; temp[i] = u & v; } } } for (i = 1; i <= n; i++) { temp[i] = 0; } return ret; } int main(void) { int i, j; cin >> n >> m; for (i = 1; i <= n; i++) { string s, trash, num1; cin >> s >> trash >> num1; go[s] = i; num[i].id = s; if (num1[0] == 0 || num1[0] == 1 ) { num[i].def = 0; num[i].val = num1; } else { num[i].def = 1; if (num1[0] == ? ) { num[i].V1 = 0; } else { num[i].V1 = go[num1]; } string op, num2; cin >> op >> num2; num[i].OP = op; if (num2[0] == ? ) { num[i].V2 = 0; } else { num[i].V2 = go[num2]; } } } for (i = 0; i <= m - 1; i++) { int X = getbit(i, 0); int Y = getbit(i, 1); if (X > Y) { mmin.push_back( 1 ); mmax.push_back( 0 ); } else if (X < Y) { mmin.push_back( 0 ); mmax.push_back( 1 ); } else if (X == Y) { mmin.push_back( 0 ); mmax.push_back( 0 ); } } cout << mmin << endl << mmax; }
#include <bits/stdc++.h> using namespace std; const long long N = 150009; long long a[N]; long long b[N], n, m, h; struct Tree { long long l, r; long long ly, mi; } t[N << 2]; void build_tree(long long p, long long l, long long r) { t[p].l = l, t[p].r = r; if (l == r) { t[p].mi = l - m - 1; t[p].ly = 0; return; } build_tree((p << 1), l, ((t[p].l + t[p].r) >> 1)); build_tree(((p << 1) | 1), ((t[p].l + t[p].r) >> 1) + 1, r); t[p].mi = min(t[(p << 1)].mi, t[((p << 1) | 1)].mi); } void push_down(long long p) { if (t[p].ly) { t[(p << 1)].ly += t[p].ly; t[((p << 1) | 1)].ly += t[p].ly; t[(p << 1)].mi += t[p].ly; t[((p << 1) | 1)].mi += t[p].ly; t[p].ly = 0; } } void modify(long long p, long long l, long long r, long long v) { if (t[p].l == l && t[p].r == r) { t[p].mi += v; t[p].ly += v; return; } push_down(p); if (r <= ((t[p].l + t[p].r) >> 1)) modify((p << 1), l, r, v); else if (l > ((t[p].l + t[p].r) >> 1)) modify(((p << 1) | 1), l, r, v); else { modify((p << 1), l, ((t[p].l + t[p].r) >> 1), v); modify(((p << 1) | 1), ((t[p].l + t[p].r) >> 1) + 1, r, v); } t[p].mi = min(t[(p << 1)].mi, t[((p << 1) | 1)].mi); } long long query(long long p, long long l, long long r) { if (t[p].l == l && t[p].r == r) { return t[p].mi; } push_down(p); if (r <= ((t[p].l + t[p].r) >> 1)) return query((p << 1), l, r); else if (l > ((t[p].l + t[p].r) >> 1)) return query(((p << 1) | 1), l, r); else return min(query((p << 1), l, ((t[p].l + t[p].r) >> 1)), query(((p << 1) | 1), ((t[p].l + t[p].r) >> 1) + 1, r)); } long long cal(long long x) { long long s = 1, t = m; while (s <= t) { long long i = (s + t) >> 1; if (b[i] > x) t = i - 1; else s = i + 1; } return t; } long long p[N]; int main() { cin >> n >> m >> h; for (long long i = 1; i <= m; i++) cin >> b[i], b[i] = h - b[i]; sort(b + 1, b + m + 1); build_tree(1, 1, m); for (long long i = 0; i < m; i++) { long long v; cin >> v; p[i] = cal(v); if (p[i]) modify(1, 1, p[i], 1); } long long ans = (query(1, 1, m) >= 0); for (long long i = m; i < n; i++) { long long v; cin >> v; p[i] = cal(v); if (p[i]) modify(1, 1, p[i], 1); if (p[i - m]) modify(1, 1, p[i - m], -1); ans += (query(1, 1, m) >= 0); } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int n; map<int, pair<int, int> > m; int main() { scanf( %i , &n); for (int i = 0; i < n; i++) { int a, b; scanf( %i%i , &a, &b); if (m.find(a) == m.end()) m[a] = make_pair(1, 0); else m[a].first += 1; if (b != a) if (m.find(b) == m.end()) m[b] = make_pair(0, 1); else m[b].second += 1; } int ans = 1e9; for (map<int, pair<int, int> >::iterator it = m.begin(); it != m.end(); it++) if (it->second.first + it->second.second >= (n + 1) / 2) ans = min(ans, max(0, (n + 1) / 2 - it->second.first)); if (ans == 1e9) cout << -1; else cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int arr[30] = {}, n, i = 0; cin >> n; while (n > 0) arr[i] = n % 2, n /= 2, i++; for (i = 29; i >= 0; i--) if (arr[i]) cout << i + 1 << ; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int s = 0; int d = 0; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int i = 0; int count = 1; int beg = 0; int last = n - 1; while (count <= n) { if (i == 0) { if (a[beg] > a[last]) { s = s + a[beg]; beg++; i = 1; } else { s = s + a[last]; last--; i = 1; } } else { if (a[beg] > a[last]) { d = d + a[beg]; beg++; i = 0; } else { d = d + a[last]; last--; i = 0; } } count++; } cout << s << << d; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int i, count = 1, ans = 0; string input; cin >> input; for (i = 1; i < input.length(); i++) { if (input[i] != input[i - 1]) { ans += (count / 5) + (count % 5 > 0); count = 0; } count++; } ans += (count / 5) + (count % 5 > 0); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 300005; int needread[maxn]; int readed[maxn]; int cnt[maxn]; int main() { int n, q, type, num, pop_cnt = 0; queue<int> que; scanf( %d %d , &n, &q); int ans = 0; while (q--) { scanf( %d %d , &type, &num); if (type == 1) { ans++; needread[num]++; que.push(num); } else if (type == 2) { ans -= needread[num] - readed[num]; readed[num] = needread[num]; } else { int t = num - pop_cnt; while (!que.empty() && t > 0) { t--; int cur = que.front(); que.pop(); pop_cnt++; cnt[cur]++; if (cnt[cur] > readed[cur]) { ans -= cnt[cur] - readed[cur]; readed[cur] = cnt[cur]; } } } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > vec[105]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) vec[i].push_back(make_pair(i, i)); int ct = 101; int a, b; for (int i = 1; i <= k; i++) { scanf( %d%d , &a, &b); vec[a].push_back(make_pair(ct, a)); vec[b].push_back(make_pair(ct, b)); ct++; } for (int i = 1; i <= n; i++) { printf( %d n , vec[i].size()); for (int j = 0; j < vec[i].size(); j++) printf( %d %d n , vec[i][j].first, vec[i][j].second); } }
#include <bits/stdc++.h> using namespace std; bool sortin(const pair<long long int, long long int> &e, const pair<long long int, long long int> &f) { return (e.first < f.first); } long long int i, j, k, l, m, n, c, p, q, ts, mn = 10e17, mod = 10e8 + 7; long long int a[250002], b[250002], x[250002]; int main() { { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; cin >> n >> m >> k; l = ((n + k - 1) / k) * ((m + k - 1) / k) * ((n - 1) % k + 1) * ((m - 1) % k + 1); cout << l; }
#include <bits/stdc++.h> using namespace std; const int N = 1111; int n; struct Edge { int u, v; long long weight; int adj(int x) { return x == u ? v : u; } }; struct Path { int u, v; long long weight; }; vector<Edge> E; vector<int> G[N]; vector<Path> res; int Trace[N]; int FindLeaf(int u, int parent) { if ((int)G[u].size() == 1) return u; for (auto e : G[u]) { int v = E[e].adj(u); if (v == parent) continue; Trace[v] = u; int l = FindLeaf(v, u); if (l != -1) return l; } return -1; } void Solve() { for (int i = 1; i <= n; ++i) { if ((int)G[i].size() == 2) { cout << NO n ; return; } } cout << YES n ; for (auto e : E) { vector<int> U, V; int u = e.u; int v = e.v; long long w = e.weight; for (int i = 0; i < (int)G[u].size(); ++i) { int uu = E[G[u][i]].adj(u); if (uu == v) continue; U.push_back(FindLeaf(uu, u)); } if (U.empty()) U.push_back(u); for (int i = 0; i < (int)G[v].size(); ++i) { int vv = E[G[v][i]].adj(v); if (vv == u) continue; V.push_back(FindLeaf(vv, v)); } if (V.empty()) V.push_back(v); res.push_back({U[0], V[0], w / 2}); if ((int)U.size() > 1 && (int)V.size() > 1) res.push_back({U[1], V[1], w / 2}); else if ((int)U.size() > 1) res.push_back({U[1], V[0], w / 2}); else if ((int)V.size() > 1) res.push_back({U[0], V[1], w / 2}); else res.push_back({U[0], V[0], w / 2}); if ((int)U.size() > 1) res.push_back({U[0], U[1], -w / 2}); if ((int)V.size() > 1) res.push_back({V[0], V[1], -w / 2}); } cout << (int)res.size() << n ; for (int i = 0; i < (int)res.size(); ++i) { cout << res[i].u << << res[i].v << << res[i].weight << n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n - 1; ++i) { int u, v; long long w; cin >> u >> v >> w; G[u].push_back(i); G[v].push_back(i); E.push_back({u, v, w}); } Solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; int arr[n]; int sum = 0; int ans = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sum = sum / 2 + 1; sort(arr, arr + n, greater<int>()); for (int j = 0; j < n; j++) { if (sum <= 0) break; sum -= arr[j]; ans++; } cout << ans << n ; }
#include <bits/stdc++.h> const int maxn = 2e5 + 5; const int mo = 998244353; using namespace std; int rd() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = (x << 3) + (x << 1) + c - 0 , c = getchar(); return x * f; } int n, f[maxn][4], head[maxn]; vector<int> G[maxn]; void dfs(int u, int y) { f[u][1] = f[u][3] = 1; int sum = 1; bool flag = false; for (int v : G[u]) { if (v == y) { flag = true; continue; } dfs(v, u); f[u][2] = 1LL * f[u][2] * (1LL * f[v][0] + f[v][2] + f[v][3]) % mo; f[u][0] = 1LL * f[u][0] * (1LL * f[v][0] + f[v][2] + f[v][3]) % mo; if (flag) { f[u][1] = 1LL * f[u][1] * (1LL * f[v][0] + f[v][2] + f[v][3]) % mo; f[u][2] = (f[u][2] + 1LL * sum * (f[v][2] + f[v][3])) % mo; } else { f[u][0] = (f[u][0] + 1LL * sum * (f[v][2] + f[v][3])) % mo; f[u][1] = 1LL * f[u][1] * (1LL * f[v][0] + f[v][1]) % mo; } sum = 1LL * sum * (f[v][0] + f[v][1]) % mo; f[u][3] = 1LL * f[u][3] * (f[v][0] + f[v][1]) % mo; } } int main() { n = rd(); for (int i = 1, u, v; i < n; i++) u = rd(), v = rd(), G[u].push_back(v), G[v].push_back(u); dfs(1, 0); printf( %d n , (f[1][0] + f[1][3]) % mo); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k; pair<string, int> A[11]; int main() { scanf( %i , &n); for (int i = 0; i < 7; i++) A[i].second = 2e7; for (int i = 0; i < n; i++) { string s; int p; cin >> p >> s; sort(s.begin(), s.end()); if (s == ABC ) A[0] = make_pair(s, min(A[0].second, p)); else if (s == AB ) A[1] = make_pair(s, min(A[1].second, p)); else if (s == AC ) A[2] = make_pair(s, min(A[2].second, p)); else if (s == BC ) A[3] = make_pair(s, min(A[3].second, p)); else if (s == A ) A[4] = make_pair(s, min(A[4].second, p)); else if (s == B ) A[5] = make_pair(s, min(A[5].second, p)); else if (s == C ) A[6] = make_pair(s, min(A[6].second, p)); } int ans = 2e7; for (int i = 0; i < 1 << 7; i++) { int occ[3] = {0}; int cost = 0; for (int j = 0; j < 7; j++) { if (i & 1 << j) { for (int k = 0; k < A[j].first.size(); k++) occ[A[j].first[k] - A ]++; cost += A[j].second; } } if (occ[0] && occ[1] && occ[2]) ans = min(cost, ans); } printf( %i n , ans == 2e7 ? -1 : ans); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> x(n); vector<int> p(n); for (int i = (0); i < ((n)); ++i) { cin >> x[i]; --x[i]; p[x[i]] = i; } int const MAX_SUM = 100001; vector<int> primes; for (int k = (2); k < (2 * n + 1); ++k) { bool isPrime = true; for (int j = 2; j * j <= k; ++j) { if (k % j == 0) { isPrime = false; break; } } if (isPrime) { primes.push_back(k); } } vector<pair<int, int> > res; for (int i = (0); i < ((n)); ++i) { int const pos1 = p[i]; int const pos2 = i; int p1 = min(pos1, pos2); int const p2 = max(pos1, pos2); vector<int> positions; positions.push_back(p1); while (p1 != p2) { int const diff = p2 - p1 + 1; auto it = lower_bound(primes.begin(), primes.end(), diff); if (it == primes.end() || *it > diff) --it; int const usedPrime = *it; p1 += usedPrime - 1; positions.push_back(p1); } if (pos1 > pos2) reverse(positions.begin(), positions.end()); for (int j = (0); j < (((int)positions.size() - 1)); ++j) { int const p1 = positions[j]; int const p2 = positions[j + 1]; swap(x[p1], x[p2]); p[x[p1]] = p1; p[x[p2]] = p2; res.push_back(make_pair(min(p1, p2), max(p1, p2))); } } vector<int> orig(n); for (int i = (0); i < ((n)); ++i) orig[i] = i; if (orig != x) { cout << FAILED! n ; throw 10; } cout << (int)res.size() << endl; for (int i = (0); i < (((int)res.size())); ++i) { cout << res[i].first + 1 << << res[i].second + 1 << n ; } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:66777216 ) using namespace std; int a, b, c, d, i, j, n, m, k; inline void die(long double first) { printf( %.15lf n , (double)first); exit(0); } long double check(long double y1, long double y2, long double yw, long double xb, long double yb, long double r, long double xx) { long double h = yw - r - yb; double a = xx, b = xb - xx; return yw - r - h / b * a; } struct line { long double a, b, c; line() : a(0), b(0), c(0) {} line(pair<long double, long double> t1, pair<long double, long double> t2) { a = t2.second - t1.second; b = t1.first - t2.first; c = -a * t1.first - b * t1.second; long double s = sqrt(a * a + b * b); a /= s; b /= s; c /= s; } inline long double dist(pair<long double, long double> t) { return abs(a * t.first + b * t.second + c); } }; int main() { long double y1, y2, yw, xb, yb, r; cin >> y1 >> y2 >> yw >> xb >> yb >> r; if (y1 > y2) swap(y1, y2); long double bottom = y1 + r; long double top = min(y2 - r, yw - r); if (bottom > top + 1e-9) { printf( -1 n ); exit(0); } long double low = 0.0, high = xb; for (int _n((300)), hod(1); hod <= _n; hod++) { long double xx = (low + high) / 2; long double ff = check(y1, y2, yw, xb, yb, r, xx); line l(make_pair(xx, yw - r), make_pair(0, ff)); if (ff + 1e-9 > bottom && l.dist(make_pair(0, y2)) + 1e-9 > r && ff < top + 1e-9) { die(xx); } if (ff < bottom) high = xx; else low = xx; } printf( -1 n ); }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); int dblcmp(double d) { if (fabs(d) < eps) return 0; return d > eps ? 1 : -1; } long long n, t; int a[66], l, p; long long dp[66][2][66]; long long getdp(int len, int less, int tot) { if (len == l) { return (tot == p); } if (dp[len][less][tot] != -1) return dp[len][less][tot]; long long res = 0; int u, i; if (less) u = 1; else u = a[len]; for (i = 0; i <= u; i++) { res += getdp(len + 1, less || (i < a[len]), tot + i); } return dp[len][less][tot] = res; } long long gao(long long x) { l = 0; while (x) { a[l++] = x % 2; x /= 2; } reverse(a, a + l); memset((dp), -1, sizeof(dp)); return getdp(0, 0, 0); } int main() { cin >> n >> t; if (t & (t - 1LL)) { puts( 0 ); return 0; } int i, j, k; for (p = 0;; p++) { if (t == (1LL << p)) break; } p++; long long ans = gao(n + 1); if (t == 1) ans--; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int mod = 1e9 + 7; int n, a[N]; long long ans; map<long long, int> cnt; void go(long long pos) { cnt[pos]++; if (cnt[pos] == 2) { cnt[pos] = 0; go(pos + 1); } } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; go(a[i]); } for (auto i : cnt) ans = i.first; ans++; for (auto i : cnt) if (i.second == 1) ans--; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 10; const double eps = 1e-5; const int maxN = 1100; const int inf = 1e9 + 100; int n, m, k; bool vis[maxN][maxN]; inline void init() { int a, b; cin >> n >> m >> k; for (int i = 0; i < k; i++) { cin >> a >> b; a--; b--; vis[a][b] = 1; bool br = false; if (a > 0 && b > 0 && vis[a - 1][b - 1] && vis[a - 1][b] && vis[a][b - 1]) br = true; if (a < n - 1 && b > 0 && vis[a + 1][b - 1] && vis[a + 1][b] && vis[a][b - 1]) br = true; if (a > 0 && b < m - 1 && vis[a - 1][b + 1] && vis[a - 1][b] && vis[a][b + 1]) br = true; if (a < n - 1 && b < m - 1 && vis[a + 1][b + 1] && vis[a + 1][b] && vis[a][b + 1]) br = true; if (br) { cout << i + 1; return; } } cout << 0; } inline void solve() {} int main() { ios_base::sync_with_stdio(0); init(); solve(); return 0; }
#include <stdio.h> #include<iomanip> #include<iostream> #include<iostream> #include <algorithm> #include<string.h> #include<string> #include<cmath> #include<queue> #include<map> #include<set> #include<bits/stdc++.h> using namespace std; #pragma warning(disable:4996) #define inf 0x3f3f3f3f #define PI 3.1415926535898 const double eps = 1e-7; typedef long long LL; #define ll long long //LL GCD(LL a, LL b) //{ // if (b == 0) // return a; // return GCD(b, a % b); //} //LL fac[N], inv[N]; //LL quick_pow(LL a, LL b) //{ // LL ans = 1 % mod; // while (b) { // if (b & 1) ans = (ans * a) % mod; // b >>= 1; // a = (a * a) % mod; // } // return ans; //} //void init() //{ // fac[0] = 1; // inv[0] = 1; // for (int i = 1; i <= N - 2; i++) // { // fac[i] = (fac[i - 1] * i) % mod; // inv[i] = quick_pow(fac[i], mod - 2); // } //} //LL C(LL a, LL b) //计算组合数C(a, b) //{ // if (a < b || b < 0) return 0; // return fac[a] * ((inv[a - b] * inv[b]) % mod) % mod; //} //LL n; //LL a[N], c[N], d[N]; //void add(LL x, LL v) //{ // LL i = x; // while (x <= (n << 1)) // { // c[x] += v; // d[x] += v * (i - 1); // x += (x & -x); // } //} //LL sum(LL x) //{ // LL res = 0, i = x; // while (x > 0) // { // res += i * c[x] - d[x]; // x -= x & -x; // } // return res; //} //int prime[N]; //int vis[N]; //void get_prime() //{ // for (int i = 2; i < N; i++) // { // if (!vis[i]) // { // prime[++prime[0]] = i; // } // for (int j = 1; j <= prime[0] && i * prime[j] < N; j++) // { // vis[i * prime[j]] = 1; // if (i % prime[j] == 0) // break; // } // } //} //struct no { // LL first; // int id; // no() {} // no(LL first, int id) :first(first), id(id) {} // bool operator<(const no& a)const // { // return first < a.first;//da顶堆 // } //}; LL mod = 1e9 + 7; const LL N = 3e5 + 10; LL n, m, t; LL a[N], b[N], c[N], aa[3]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); /*srand((int)time(0));*/ //freopen( C: Users Lenovo Desktop test in.txt , r , stdin); //freopen( C: Users Lenovo Desktop test out.txt , w , stdout); int n1, n2, n3; cin >> n1 >> n2 >> n3; LL sum1 = 0, sum2 = 0, sum3 = 0; LL m1 = 1e17, m2 = 1e17, m3 = 1e17; for (int i = 0; i < n1; i++) { cin >> a[i]; m1 = min(a[i], m1); sum1 += a[i]; } for (int i = 0; i < n2; i++) { cin >> b[i]; m2 = min(b[i], m2); sum2 += b[i]; } for (int i = 0; i < n3; i++) { cin >> c[i]; m3 = min(c[i], m3); sum3 += c[i]; } LL all = sum1 + sum2 + sum3; LL ans=-1e17; ans = max(ans, sum1 + sum2 - sum3); ans = max(ans, sum1 + sum3 - sum2); ans = max(ans, sum2 + sum3 - sum1); ans = max(ans, all - 2 * (m1 + m2)); ans = max(ans, all - 2 * (m1 + m3)); ans = max(ans, all - 2 * (m3 + m2)); cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 5; char s[maxn]; int vis[maxn], a[maxn]; int main() { int n; scanf( %d , &n); scanf( %s , s + 1); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); memset(vis, 0, sizeof(vis)); int x = 1; while (1) { if (vis[x]) { printf( INFINITE n ); break; } vis[x] = 1; int nx = 0; if (s[x] == > ) x = x + a[x]; else x = x - a[x]; if (x < 1 || x > n) { printf( FINITE n ); break; } } }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) const long long inf = 2147383647; const double pi = 2 * acos(0.0); const double eps = 1e-9; const long long maxint = 2147483647; const long long minint = -2147483648; using namespace std; struct Bigint { string a; int sign; Bigint() {} Bigint(string b) { (*this) = b; } int size() { return a.size(); } Bigint inverseSign() { sign *= -1; return (*this); } Bigint normalize(int newSign) { for (int i = a.size() - 1; i > 0 && a[i] == 0 ; i--) a.erase(a.begin() + i); sign = (a.size() == 1 && a[0] == 0 ) ? 1 : newSign; return (*this); } void operator=(string b) { a = b[0] == - ? b.substr(1) : b; reverse(a.begin(), a.end()); this->normalize(b[0] == - ? -1 : 1); } void operator=(long long num) { char buf[30]; sprintf(buf, %lld , num); *this = buf; } bool operator<(const Bigint &b) const { if (sign != b.sign) return sign < b.sign; if (a.size() != b.a.size()) return sign == 1 ? a.size() < b.a.size() : a.size() > b.a.size(); for (int i = a.size() - 1; i >= 0; i--) if (a[i] != b.a[i]) return sign == 1 ? a[i] < b.a[i] : a[i] > b.a[i]; return false; } bool operator==(const Bigint &b) const { return a == b.a && sign == b.sign; } Bigint operator+(Bigint b) { if (sign != b.sign) return (*this) - b.inverseSign(); Bigint c; for (int i = 0, carry = 0; i < a.size() || i < b.size() || carry; i++) { carry += (i < a.size() ? a[i] - 48 : 0) + (i < b.a.size() ? b.a[i] - 48 : 0); c.a += (carry % 10 + 48); carry /= 10; } return c.normalize(sign); } Bigint operator-(Bigint b) { if (sign != b.sign) return (*this) + b.inverseSign(); int s = sign; sign = b.sign = 1; if ((*this) < b) return ((b - (*this)).inverseSign()).normalize(-s); Bigint c; for (int i = 0, borrow = 0; i < a.size(); i++) { borrow = a[i] - borrow - (i < b.size() ? b.a[i] : 48); c.a += borrow >= 0 ? borrow + 48 : borrow + 58; borrow = borrow >= 0 ? 0 : 1; } return c.normalize(s); } Bigint operator*(Bigint b) { Bigint c( 0 ); for (int i = 0, k = a[i] - 48; i < a.size(); i++, k = a[i] - 48) { while (k--) c = c + b; b.a.insert(b.a.begin(), 0 ); } return c.normalize(sign * b.sign); } Bigint operator/(Bigint b) { if (b.size() == 1 && b.a[0] == 0 ) b.a[0] /= (b.a[0] - 48); Bigint c( 0 ), d; for (int j = 0; j < a.size(); j++) d.a += 0 ; int dSign = sign * b.sign; b.sign = 1; for (int i = a.size() - 1; i >= 0; i--) { c.a.insert(c.a.begin(), 0 ); c = c + a.substr(i, 1); while (!(c < b)) c = c - b, d.a[i]++; } return d.normalize(dSign); } Bigint operator%(Bigint b) { if (b.size() == 1 && b.a[0] == 0 ) b.a[0] /= (b.a[0] - 48); Bigint c( 0 ); b.sign = 1; for (int i = a.size() - 1; i >= 0; i--) { c.a.insert(c.a.begin(), 0 ); c = c + a.substr(i, 1); while (!(c < b)) c = c - b; } return c.normalize(sign); } void print() { if (sign == -1) putchar( - ); for (int i = a.size() - 1; i >= 0; i--) putchar(a[i]); } Bigint operator*(long long b) { long long carry = 0; Bigint c = *this; int bsign; if (b < 0) { bsign = -1; b *= -1; } else bsign = 1; for (int i = 0; i < c.a.size(); i++) { carry += (c.a[i] - 48) * b; c.a[i] = (carry % 10 + 48); carry /= 10; } while (carry) { c.a += (carry % 10 + 48); carry /= 10; } return c.normalize(sign * bsign); } }; Bigint power[2001]; void init() { power[0] = 1 ; int i; for (i = 1; i <= 2000; i++) { power[i] = power[i - 1] * 2; } } struct drive { int value; bool sell; } arr[5010]; Bigint res; void use(int buy, int sell) { if (buy == inf) { if (sell != inf) arr[sell].value = inf - 10; else return; } else { res = res + power[arr[sell].value]; for (int i = buy; i <= sell; i++) arr[i].value = inf; } } int main() { init(); int size; scanf( %d , &size); int i; char buf[200]; for (i = 0; i < size; i++) { scanf( %s %d , buf, &arr[i].value); arr[i].sell = false; if (buf[0] == s ) { arr[i].sell = true; } } res = 0 ; int k = 5000; while (k--) { int sell = inf, buy = inf, mx = -1; for (i = size - 1; i >= 0; i--) { if (arr[i].value == inf) { use(buy, sell); sell = inf; buy = inf; mx = -1; continue; } if (arr[i].sell) { if (arr[i].value == inf - 10) continue; if (arr[i].value >= mx) { mx = arr[i].value; sell = i; buy = inf; } } else { if (arr[i].value == mx && buy == inf) { buy = i; } } } use(buy, sell); } res.print(); puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int INF = INT_MAX; const int NINF = INT_MIN; int n, q, l, r, curr; vector<int> vec, tv, Count; void Solve() { cin >> n >> q; vec = tv = vector<int>(n, 0); for (int i = 0; i <= n - 1; i++) cin >> vec[i]; for (int i = 0; i <= q - 1; i++) { cin >> l >> r; l--; r; tv[l]++; if (r < n) tv[r]--; } curr = 0; for (int i = 0; i <= n - 1; i++) { curr += tv[i]; if (curr > 0) Count.push_back(curr); } sort(Count.rbegin(), Count.rend()); sort(vec.rbegin(), vec.rend()); long long int ans = 0ll; int i = 0; for (auto v : Count) { ans += ((v * 1ll) * (vec[i] * 1ll)); i++; } cout << ans << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); Solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int getInt() { int x; scanf( %d , &x); return x; } long long getLongLong() { long long x; scanf( %I64d , &x); return x; } double getDouble() { double x; scanf( %lf , &x); return x; } char getChar() { char x; scanf( %c , &x); return x; } template <typename t> t abs(t a) { if (a >= 0) return a; return -a; } struct dual { int a, b; bool const operator<(const dual &x) const { if (a == x.a) return b > x.b; return a < x.a; } }; struct triple { int a, b, c; bool const operator<(const triple &x) const { if (c == x.c) { if (a == x.a) return b > x.b; return a < x.a; } return c < x.c; } }; void FastIO() { ios::sync_with_stdio(0); cin.tie(0); } long long a[100][100], v; int main() { FastIO(); int n; cin >> n; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; map<long long, int> mp; for (int i = 0; i < n; i++) { v = *max_element(a[i], a[i] + n); a[i][i] = v; mp[v]++; } for (int i = 0; i < n; i++) { v = a[i][i]; if (mp[v] == 1) continue; while (mp.find(v) != mp.end()) v++; mp[v]++; mp[a[i][i]]--; a[i][i] = v; } for (int i = 0; i < n; i++) cout << a[i][i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; struct Point { int x, y; bool operator<(const Point &a) const { return y == a.y ? x < a.x : y > a.y; } }; Point p[200005]; int x[200005], y[2000005]; struct Segtree { struct node { int l, r; int v; } tr[200005 * 4]; void build(int l, int r, int k) { tr[k].l = l, tr[k].r = r; if (l == r) { tr[k].v = 0; return; } int m = (l + r) / 2; build(l, m, k * 2); build(m + 1, r, k * 2 + 1); tr[k].v = tr[k * 2].v + tr[k * 2 + 1].v; } void update(int pos, int k, int val) { if (tr[k].l == tr[k].r) { tr[k].v = val; return; } int m = (tr[k].l + tr[k].r) / 2; if (pos <= m) update(pos, k * 2, val); else if (pos > m) update(pos, k * 2 + 1, val); tr[k].v = tr[k * 2].v + tr[k * 2 + 1].v; } int query(int l, int r, int k) { if (l > r) return 0; if (l <= tr[k].l && r >= tr[k].r) { return tr[k].v; } int m = (tr[k].l + tr[k].r) / 2; int ans = 0; if (l <= m) ans += query(l, r, k * 2); if (r > m) ans += query(l, r, k * 2 + 1); return ans; } }; Segtree seg; int ydiv[200005]; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> x[i] >> y[i]; p[i].x = x[i]; p[i].y = y[i]; } sort(x, x + n); sort(y, y + n); int xnew = unique(x, x + n) - x; int ynew = unique(y, y + n) - y; for (int i = 0; i < n; ++i) { p[i].x = lower_bound(x, x + xnew, p[i].x) - x + 1; p[i].y = lower_bound(y, y + ynew, p[i].y) - y + 1; } sort(p, p + n); seg.build(1, xnew + 1, 1); int beg = 0, cur = 0; long long sum = 0; while (beg < n) { int pos = 0; while (cur < n && p[cur].y == p[beg].y) { seg.update(p[cur].x, 1, 1); ydiv[pos++] = p[cur++].x; } ydiv[pos] = xnew + 1; for (int i = 0; i < pos; ++i) { long long cntl = seg.query(1, ydiv[i] - 1, 1); long long cntr = seg.query(ydiv[i] + 1, ydiv[i + 1] - 1, 1); sum += (cntl + 1) * (cntr + 1); } beg = cur; } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { double ans, p, q, p1, p2, p3; int n, i; scanf( %d , &n); ans = 0.0; q = p2 = p3 = 1; p1 = 0; for (i = 1; i <= n + 1; i++) { if (i <= n) scanf( %lf , &p); else p = 0.0; ans += (1 - p) * p1; p1 = (p1 + p2) * p; q = 1.0 - p; p2 = (p2 + 2.0 * p3) * p + q; p3 = p3 * p + q; } printf( %.15f n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long n, i, j; vector<long long> v, Ans; long long adj[504][504], dist[504][504]; bool visit[1000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { cin >> adj[i][j]; dist[i][j] = adj[i][j]; } } long long x; for (i = 1; i <= n; i++) cin >> x, v.push_back(x); reverse(v.begin(), v.end()); int f = 0; for (auto k : v) { f++; long long ans = 0; for (long long i = 0; i < n; i++) { for (long long j = 0; j < n; j++) dist[v[i]][v[j]] = min(dist[v[i]][v[j]], dist[v[i]][k] + dist[k][v[j]]); } for (i = 0; i < f; i++) for (j = 0; j < f; j++) ans += dist[v[i]][v[j]]; Ans.push_back(ans); } reverse(Ans.begin(), Ans.end()); for (auto i : Ans) cout << i << ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, count = 0; cin >> n; int home[n], guest[n]; for (int i = 0; i < n; ++i) { cin >> home[i] >> guest[i]; } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (home[i] == guest[j]) count++; } } cout << count; }
#include <bits/stdc++.h> using namespace std; long long binpow(long long a, long long b, long long m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % m; a = (a * a) % m; b >>= 1; } return res; } void solve() { long long int x, n, y, z, ans = 1; cin >> x >> n; vector<long long int> v; y = x; for (long long int i = 2; i * i <= x; i++) { if (y % i == 0) { v.push_back(i); while (y % i == 0) y /= i; } } if (y != 1) v.push_back(y); for (long long int i = 0; i < v.size(); i++) { long long int a = v[i], b = 0; while (a <= n) { z = (n / a); b += z; if (z < v[i]) break; a *= v[i]; } ans = (ans * binpow(v[i], b, 1000000007)) % 1000000007; } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int arr[200005]; int ans[200005]; int n, m; bool vis[200005]; int s = 0, e = -1; int main() { scanf( %d %d , &n, &m); vector<pair<int, int> > q(m); for (int i = 0; i < n; ++i) scanf( %d , arr + i); for (int i = 0; i < m; ++i) scanf( %d %d , &q[i].first, &q[i].second); int b = -1; for (int i = m - 1; i >= 0; --i) { if (b >= q[i].second) vis[i] = 1; b = max(b, q[i].second); } int i; bool r = 0; for (i = 0; i < m; ++i) { if (!vis[i]) { sort(arr, arr + q[i].second); if (q[i].first == 1) { s = 0, e = q[i].second - 1; } else { s = 0, e = q[i].second - 1, r = 1; } for (int j = q[i].second; j < n; ++j) ans[j] = arr[j]; break; } } for (; i < m; ++i) { if (vis[i]) continue; if (r) { while (e - s + 1 > q[i].second) { ans[e - s] = arr[s]; ++s; } } else { while (e - s + 1 > q[i].second) { ans[e - s] = arr[e]; --e; } } if (q[i].first == 1) { ans[e - s] = arr[e]; --e; r = 0; } else { ans[e - s] = arr[s]; ++s; r = 1; } } if (r) { while (e >= s) { ans[e - s] = arr[s]; ++s; } } else { while (e >= s) { ans[e - s] = arr[e]; --e; } } for (int i = 0; i < n; ++i) printf( %d , ans[i]); }
#include <bits/stdc++.h> using namespace std; int n; bool isValid(int x1, int y1, int x2, int y2) { return x1 <= x2 && y1 <= y2; } int ask(int x1, int y1, int x2, int y2) { int ret = 0; cout << ? << x1 << << y1 << << x2 << << y2 << n ; cout.flush(); cin >> ret; return ret; } bool check(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4) { if (!isValid(x1, y1, x2, y2)) return 0; if (!isValid(x3, y3, x4, y4)) return 0; int ret1 = ask(x1, y1, x2, y2); int ret2 = ask(x3, y3, x4, y4); return (ret1 > 0 && ret2 > 0); } int main() { ios::sync_with_stdio(0); cin >> n; int x1, y1, x2, y2, x3, y3, x4, y4; int l, r; l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(s, 1, n, n) == 2) { l = s + 1; x1 = s; } else { r = s - 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(s, 1, n, n) >= 1) { l = s + 1; x3 = s; } else { r = s - 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(1, 1, s, n) == 2) { r = s - 1; x2 = s; } else { l = s + 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(1, 1, s, n) >= 1) { r = s - 1; x4 = s; } else { l = s + 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(1, s, n, n) == 2) { l = s + 1; y1 = s; } else { r = s - 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(1, s, n, n) >= 1) { l = s + 1; y3 = s; } else { r = s - 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(1, 1, n, s) == 2) { r = s - 1; y2 = s; } else { l = s + 1; } } l = 1; r = n; while (l <= r) { int s = (l + r) / 2; if (ask(1, 1, n, s) >= 1) { r = s - 1; y4 = s; } else { l = s + 1; } } vector<int> xx1{x1, x3}; vector<int> xx2{x2, x4}; vector<int> yy1{y1, y3}; vector<int> yy2{y2, y4}; int xxx3 = xx1[1]; for (int xxx1 : xx1) { int xxx4 = xx2[1]; for (int xxx2 : xx2) { int yyy3 = yy1[1]; for (int yyy1 : yy1) { int yyy4 = yy2[1]; for (int yyy2 : yy2) { if (check(xxx1, yyy1, xxx2, yyy2, xxx3, yyy3, xxx4, yyy4)) { cout << ! << xxx1 << << yyy1 << << xxx2 << << yyy2 << << xxx3 << << yyy3 << << xxx4 << << yyy4; return 0; } yyy4 = yyy2; } yyy3 = yyy1; } xxx4 = xxx2; } xxx3 = xxx1; } return 0; }
#include <bits/stdc++.h> using namespace std; long long a[505]; long long mod = 998244353; long long dp[505][505]; long long get_ans(long long l, long long r) { if (dp[l][r]) return dp[l][r]; if (l >= r) return 1; long long pl = l, _min = 1e9; for (long long i = l; i <= r; i++) { if (a[i] < _min) { _min = a[i]; pl = i; } } long long Ans1 = 0, Ans2 = 0; for (long long i = pl; i >= l; i--) { Ans1 = (Ans1 + get_ans(l, i - 1) * get_ans(i, pl - 1) % mod) % mod; } for (long long j = pl; j <= r; j++) { Ans2 = (Ans2 + get_ans(pl + 1, j) % mod * get_ans(j + 1, r) % mod) % mod; } return dp[l][r] = (Ans1 * Ans2) % mod; } signed main() { long long n, m; scanf( %lld %lld , &n, &m); for (long long i = 1; i <= m; i++) scanf( %lld , &a[i]); printf( %lld , get_ans(1, n)); return 0; }
#include <bits/stdc++.h> using namespace std; int N, s1, s2; int data[100001]; bool isRange(int x, int y, int z) { if (z >= x && z <= y) return true; return false; } int check(int x) { int L = data[N] - x; int R = data[N] + x; for (int i = N - 1; i >= 1; i--) { if (isRange(L, R, data[i])) { L = data[i] - x; R = data[i] + x; } else { L = max(L, data[i] - x); R = min(R, data[i] + x); } } return isRange(L, R, s1) || isRange(L, R, s2); } int main() { cin >> N >> s1 >> s2; for (int i = 1; i <= N; i++) { cin >> data[i]; } int L = abs(s1 - s2); int R = 1000000000; while (L <= R) { int mid = (L + R) >> 1; if (check(mid)) { R = mid - 1; } else { L = mid + 1; } } cout << L; }
#include <bits/stdc++.h> long long pow(long long a, long long n, long long mod) { long long t; for (t = 1; n; n >>= 1, a *= a, a %= mod) n & 1 && (t *= a, t %= mod); return t; } int main() { long long N, A, B, K, i, l, t, ans, mod = 1000000009; char s[100100]; for (scanf( %lld%lld%lld%lld%s , &N, &A, &B, &K, s), ans = i = 0; i <= N && s[i]; i++) s[i] == + ? ans += pow(A, N - i, mod) * pow(B, i, mod) : (ans -= pow(A, N - i, mod) * pow(B, i, mod)), ans %= mod; if (i <= N) for (l = i, t = pow(pow(A, i, mod), mod - 2, mod) * pow(B, i, mod) % mod, ans = t - 1 % mod ? (ans * pow(t, (N + 1) / i, mod) - ans) % mod * pow(t - 1, mod - 2, mod) % mod : (N + 1) / i * ans % mod, i += (N + 1) / i * i; i <= N; i++) s[i % l] == + ? ans += pow(A, N - i, mod) * pow(B, i, mod) : (ans -= pow(A, N - i, mod) * pow(B, i, mod)), ans %= mod; printf( %lld n , (ans + mod) % mod); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int m, n; cin >> m >> n; char a[m], b[n]; for (int i = 0; i < m; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; if ((a[0] == < && b[0] == ^ ) || (a[0] == > && b[n - 1] == ^ ) || (a[m - 1] == < && b[0] == v ) || (a[m - 1] == > && b[n - 1] == v )) cout << NO << endl; else cout << YES << endl; }
#include <bits/stdc++.h> using namespace std; int cnt1 = 0; const int maxn = 1e5; int fac[maxn + 5], vis[maxn + 5]; vector<int> prime; void init() { memset(vis, 0, sizeof(vis)); for (int i = 2; i <= maxn; i++) { if (!vis[i]) prime.push_back(i); for (int j = 0; j < prime.size() && i * prime[j] <= maxn; j++) { vis[i * prime[j]] = 1; if (i % prime[j] == 0) break; } } } void cal(int n) { int m = sqrt(n + 0.5); int cnt2 = 0; for (int i = 2; i <= m; i++) { if (n % i == 0) { fac[i]++; while (n % i == 0) n /= i; } } if (n > 1) fac[n]++; } int main() { int n, x; init(); memset(fac, 0, sizeof(fac)); scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &x); cal(x); } int ans = 1; for (int i = 0; i < prime.size(); i++) ans = max(ans, fac[prime[i]]); printf( %d , ans); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; void io() {} long long fast_exp(long long base, int exp, int m) { long long res = 1; while (exp > 0) { if (exp % 2 == 1) { res = (res * base) % m; } base = (base * base) % m; exp /= 2; } return res % m; } vector<pair<long long, string> > v[10001]; long long dp[2001][4]; int main() { io(); ios ::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; while (n--) { string s; long long r, p; cin >> s >> r >> p; v[r].push_back(make_pair(p, s)); } for (int i = 1; i <= int(m); ++i) { sort(v[i].begin(), v[i].end()); int siz = v[i].size(); if (siz == 2) { cout << v[i][siz - 1].second << << v[i][siz - 2].second << n ; } else if ((v[i][siz - 2].first == v[i][siz - 3].first)) { cout << ? << n ; } else { cout << v[i][siz - 1].second << << v[i][siz - 2].second << n ; } } }
#include <bits/stdc++.h> struct oficinas { int valor; int sig; }; int v[200002], vaux[200002]; int buscar(int buscado); int main() { int n, q, type, x, y, i, A, B, aux; scanf( %d %d , &n, &q); for (i = 1; i <= n; i++) { v[i] = i; vaux[i] = i + 1; } for (i = 0; i < q; i++) { scanf( %d %d %d , &type, &x, &y); switch (type) { case 1: v[buscar(x)] = buscar(y); break; case 2: while (x < y) { v[buscar(x)] = buscar(y); aux = vaux[x]; vaux[x] = vaux[y]; x = aux; } break; case 3: printf( %s n , buscar(x) == buscar(y) ? YES : NO ); break; } } return 0; } int buscar(int buscado) { return v[buscado] = v[buscado] == buscado ? buscado : buscar(v[buscado]); }
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; int a[maxn], chk[maxn]; string str; int main() { int n, k = 0; cin >> n >> str; if (str.size() < n) { cout << NO ; return 0; } for (int i = 0; i < str.size(); i++) { if (a[str[i] - 0 ] == 0) k++; a[str[i] - 0 ] = 1; } if (k < n) { cout << NO ; return 0; } cout << YES << endl; for (int i = 0; i < str.size(); i++) { if (chk[str[i] - 0 ] == 0 && n > 1 && i != 0) { cout << endl; n--; } cout << str[i]; chk[str[i] - 0 ] = 1; } return 0; }