func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> int len; int big; int Dgt[30]; int N; int ans; void tochar(int); int main() { while (scanf( %d , &N) != EOF) { memset(Dgt, 0, sizeof(Dgt)); ans = 0; while (N) { big = -1; tochar(N); for (int i = 0; i < len; i++) { if (Dgt[i] > big) big = Dgt[i]; } N -= big; ans++; } printf( %d n , ans); } } void tochar(int n) { len = 0; while (n) { Dgt[len] = n % 10; n /= 10; len++; } }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; long long a[3], b[3]; cin >> a[0] >> a[1] >> a[2]; cin >> b[0] >> b[1] >> b[2]; cout << max(0ll, a[0] - b[0] - b[2]) + max(0ll, a[1] - b[1] - b[0]) + max(0ll, a[2] - b[2] - b[1]) << ; cout << min(a[0], b[1]) + min(a[1], b[2]) + min(a[2], b[0]) << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int t; t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool equal(string s) { int n = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == a ) n++; } if (n * 2 != s.length()) return false; return true; } string s, s1, sex; int n, d, k; int main() { cin >> k; cin >> s; n = s.length(); sex = s; for (int i = 2; i <= n; i = i + 2) { for (int j = 0; j <= n - i; j++) { s1 = s.substr(j, i); if (equal(s1)) { while (s.find(s1) != -1) { s.erase(s.find(s1), 1); d++; } } } } cout << 25 ; }
|
#include <bits/stdc++.h> using namespace std; int a[105][2]; int main() { int n, sum = 0, b = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i][0]); sum += a[i][0]; } n /= 2; sum = sum / n; for (int j = 1; j <= n; j++) { for (int i = 1; i <= 2 * n; i++) { if (a[i][1] == 0) { if (b == 0) { printf( %d , i); b = a[i][0]; a[i][1] = 1; } else { if (b + a[i][0] == sum) { printf( %d n , i); b = 0; a[i][1] = 1; break; } } } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long SG[1110000] = {0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1, 10, 9, 3, 6, 11, 12, 14, 13}; long long n, Ans, vis[1110000]; set<long long> Hehe; int main() { scanf( %I64d , &n); long long Orz = (long long)(floor)(sqrt(1.0 * n)); for (long long i = 2; i * i <= n; ++i) { long long c = 0; if (vis[i]) continue; for (long long j = i; j <= n; j *= i, c++) { if (j > Orz) Hehe.insert(j); else vis[j] = 1; } Ans ^= SG[c]; } long long tmp = n - Orz - Hehe.size(); if (!(tmp & 1)) Ans ^= 1; if (Ans) printf( Vasya ); else printf( Petya ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, cnt; bool vis[1000005]; vector<int> G[1000005]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int u, v; scanf( %d%d , &u, &v); G[u].push_back(v); } for (int u = 1; u <= n; u++) { if (vis[u]) continue; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (v > u) vis[v] = true; } } for (int u = n; u > 0; u--) { if (vis[u]) continue; for (int i = 0; i < G[u].size(); i++) vis[G[u][i]] = true; } for (int i = 1; i <= n; i++) if (!vis[i]) cnt++; printf( %d n , cnt); for (int i = 1; i <= n; i++) if (!vis[i]) printf( %d , i); }
|
#include <bits/stdc++.h> using namespace std; const int N = 2013; char p[1 << 20], s[205]; int k, n, m; int main() { gets(p); gets(s); cin >> k; n = strlen(p); m = strlen(s); string minLex; for (int i = 1; i <= k + 1; ++i) minLex += 1 ; int rboud = min(m, k), cntIn = n / k, R = n % k; for (int d = 1; d <= rboud && cntIn * d <= m; ++d) { string cans; for (int i = 1; i <= k; ++i) cans += 0 ; { int r = d - 1, i = min(n - 1, k - 1); for (; i >= 0 && r >= 0; --i) { int l1 = m / d + (r < m % d); int l2 = cntIn + (i < R); if (l1 != l2) continue; bool diff = false; for (int e = 0; e < l1 && !diff; ++e) diff = s[r + e * d] != p[i + e * k]; if (diff) continue; cans[i] = 1 ; --r; } if (r == -1) minLex = min(minLex, cans); } } if (minLex.size() > k) cout << 0; else cout << minLex; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int x, y, z; } a[10]; int flag; long long v[5]; long long dist(int i, int j) { long long x = a[i].x - a[j].x; long long y = a[i].y - a[j].y; long long z = a[i].z - a[j].z; return x * x + y * y + z * z; } int ok() { int cnt = 0; for (int i = 1; i < 8; i++) for (int j = 0; j < i; j++) { long long w = dist(i, j); if (!cnt) v[++cnt] = w; else { int k = 1; while (k <= cnt && v[k] != w) k++; if (k > cnt && cnt == 3) return 0; if (k > cnt) v[++cnt] = w; } } if (cnt == 3) return 1; return 0; } void dfs(int p) { if (flag) return; if (p == 8) { if (ok()) flag = 1; return; } node tmp = a[p]; dfs(p + 1); if (!flag) { a[p].y = tmp.z; a[p].z = tmp.y; dfs(p + 1); } if (!flag) { a[p].x = tmp.y; a[p].y = tmp.x; a[p].z = tmp.z; dfs(p + 1); } if (!flag) { a[p].x = tmp.y; a[p].y = tmp.z; a[p].z = tmp.x; dfs(p + 1); } if (!flag) { a[p].x = tmp.z; a[p].y = tmp.x; a[p].z = tmp.y; dfs(p + 1); } if (!flag) { a[p].x = tmp.z; a[p].y = tmp.y; a[p].z = tmp.x; dfs(p + 1); } } int main() { for (int i = 0; i < 8; i++) cin >> a[i].x >> a[i].y >> a[i].z; dfs(0); if (!flag) puts( NO ); else { puts( YES ); for (int i = 0; i < 8; i++) printf( %d %d %d n , a[i].x, a[i].y, a[i].z); } }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1024; int n, m; bool b[MAXN][MAXN]; int main() { cin >> n >> m; for (register int l = (1); l < (int)(m + 1); ++l) { int x, y; cin >> x >> y; x--; y--; b[x][y] = true; for (register int xx = (x - 2); xx < (int)(x + 1); ++xx) for (register int yy = (y - 2); yy < (int)(y + 1); ++yy) if (xx >= 0 && yy >= 0) { bool ok = true; for (register int i = (0); i < (int)(3); ++i) for (register int j = (0); j < (int)(3); ++j) if (!b[i + xx][j + yy]) ok = false; if (ok) { cout << l << endl; return 0; } } } cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; template <int MOD> struct Num { int x; Num() : x(0) {} explicit Num(int x, bool skip_check = false) { if (skip_check) this->x = x; else { if (x >= 0 && x < MOD) this->x = x; else { this->x = x % MOD; if (this->x < 0) this->x += MOD; }; } } Num<MOD> operator+(const Num<MOD>& oth) const { int rem = this->x + oth.x; if (rem >= MOD) rem -= MOD; return Num(rem, true); } Num<MOD> operator-(const Num<MOD>& oth) const { int rem = this->x - oth.x; if (rem < 0) rem += MOD; return Num(rem, true); } Num<MOD> operator*(const Num<MOD>& oth) const { int rem = (long long)this->x * oth.x % MOD; return Num(rem, true); } Num<MOD> to_pow(int n) const { Num<MOD> res(1); Num<MOD> cur = *this; while (n) { if (n & 1) res = res * cur; cur = cur * cur; n >>= 1; } return res; } Num<MOD> inv_prime() const { return this->to_pow(MOD - 2); } Num<MOD> operator/(const Num<MOD>& oth) const { return *this * oth.inv_prime(); } bool operator==(const Num<MOD>& oth) const { return x == oth.x; } bool operator!=(const Num<MOD>& oth) const { return !(x == oth); } }; int sgn(long long x) { if (x > 0) return 1; if (x < 0) return -1; return 0; } struct Frac { int numer, den; explicit Frac(int numer, int den) : numer(numer), den(den) {} int cmp(const Frac& oth) const { long long res_numer = (long long)numer * oth.den - (long long)oth.numer * den; long long res_den = (long long)den * oth.den; return sgn(res_numer) * sgn(res_den); } }; const int mod = 998244353; struct Event { int lind; int ldir, rdir; Frac t; Event(int lind, int ldir, int rdir, Frac t) : lind(lind), ldir(ldir), rdir(rdir), t(t) {} bool operator<(const Event& oth) const { return this->t.cmp(oth.t) < 0; } }; struct Pipe { int x, v, p_right; Pipe() {} Pipe(int x, int v, int p_right) : x(x), v(v), p_right(p_right) {} }; struct TreeNodeData { Num<mod> p_ok[2][2]; Num<mod> p_all[2][2]; TreeNodeData() {} TreeNodeData combine(const TreeNodeData& oth, const int forb[2][2]) const { TreeNodeData res; for (int d1 = 0; d1 < 2; ++d1) for (int d2 = 0; d2 < 2; ++d2) for (int d3 = 0; d3 < 2; ++d3) for (int d4 = 0; d4 < 2; ++d4) { res.p_all[d1][d4] = res.p_all[d1][d4] + p_all[d1][d2] * oth.p_all[d3][d4]; if (forb[d2][d3]) continue; res.p_ok[d1][d4] = res.p_ok[d1][d4] + p_ok[d1][d2] * oth.p_ok[d3][d4]; } return res; } }; const int maxtr = 270000; TreeNodeData tree[maxtr]; const int maxn = 100010; int forb[maxn][2][2]; vector<TreeNodeData> leaves; void build_tree(int v, int L, int R) { if (L == R) { tree[v] = leaves[L]; return; } int m = (L + R) >> 1; build_tree(v + v + 1, L, m); build_tree(v + v + 2, m + 1, R); tree[v] = tree[v + v + 1].combine(tree[v + v + 2], forb[m]); } void tree_update(int v, int L, int R, int pos) { if (L == R) return; int m = (L + R) >> 1; if (pos <= m) tree_update(v + v + 1, L, m, pos); else tree_update(v + v + 2, m + 1, R, pos); tree[v] = tree[v + v + 1].combine(tree[v + v + 2], forb[m]); } int main() { int n; scanf( %d , &n); vector<Pipe> pipes; for (int i = 0; i < n; ++i) { int cx, cv, cp; scanf( %d%d%d , &cx, &cv, &cp); pipes.push_back(Pipe(cx, cv, cp)); } for (auto pipe : pipes) { TreeNodeData curres; curres.p_ok[1][1] = curres.p_all[1][1] = Num<mod>(pipe.p_right) / Num<mod>(100); curres.p_ok[0][0] = curres.p_all[0][0] = Num<mod>(100 - pipe.p_right) / Num<mod>(100); leaves.push_back(curres); } build_tree(0, 0, n - 1); vector<Event> events; for (int i = 0; i + 1 < n; ++i) { auto p1 = pipes[i]; auto p2 = pipes[i + 1]; events.push_back(Event(i, 1, 0, Frac(p2.x - p1.x, p1.v + p2.v))); if (p1.v > p2.v) events.push_back(Event(i, 1, 1, Frac(p2.x - p1.x, p1.v - p2.v))); else if (p2.v > p1.v) events.push_back(Event(i, 0, 0, Frac(p2.x - p1.x, p2.v - p1.v))); } sort(events.begin(), events.end()); Num<mod> result(0); Num<mod> pred_nok_prob(0); for (int ev_ind = 0; ev_ind < int((events).size());) { int fr_ev = ev_ind; int to_ev = ev_ind; while (to_ev < int((events).size()) && events[fr_ev].t.cmp(events[to_ev].t) == 0) ++to_ev; Num<mod> cur_ok_prob(tree[0].p_ok[0][0] + tree[0].p_ok[0][1] + tree[0].p_ok[1][0] + tree[0].p_ok[1][1]); for (int i = fr_ev; i < to_ev; ++i) { forb[events[i].lind][events[i].ldir][events[i].rdir] = 1; tree_update(0, 0, n - 1, events[i].lind); } Num<mod> cur_nok_prob = ((tree[0].p_all[0][0] + tree[0].p_all[0][1] + tree[0].p_all[1][0] + tree[0].p_all[1][1]) - (tree[0].p_ok[0][0] + tree[0].p_ok[0][1] + tree[0].p_ok[1][0] + tree[0].p_ok[1][1])); Num<mod> cur_delta = (cur_nok_prob - pred_nok_prob) * Num<mod>(events[fr_ev].t.numer) / Num<mod>(events[fr_ev].t.den); result = result + cur_delta; pred_nok_prob = cur_nok_prob; ev_ind = to_ev; } cout << result.x << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1e6 + 66; vector<int> g[N], f[N]; int used[N]; vector<int> topsort; void dfs(int v) { used[v] = 1; for (int to : g[v]) if (used[to] != 1) dfs(to); topsort.emplace_back(v); } int c[N]; void color(int v) { if (false) cerr << v << color n ; if (c[v] == 0) c[v] = v; used[v] = 2; for (int to : f[v]) if (used[to] != 2) c[to] = c[v], color(to); } int S; vector<int> newg[N]; void fnd(int v) { if (false) cerr << v << fnd n ; used[v] = 3; for (int to : newg[v]) if (used[to] != 3) fnd(to); if (S == -1) S = v; } void clr(int v) { used[v] = 4; for (int to : g[v]) if (used[to] != 4) clr(to); } void solve() { int n, m; cin >> n >> m; topsort.clear(); for (int i = 1; i <= n; ++i) { used[i] = 0; g[i].clear(); f[i].clear(); newg[i].clear(); c[i] = 0; } for (int i = 1; i <= m; ++i) { int a, b; cin >> a >> b; g[a].emplace_back(b); f[b].emplace_back(a); } for (int i = 1; i <= n; ++i) { if (!used[i]) { dfs(i); } } reverse(topsort.begin(), topsort.end()); for (int i : topsort) { if (used[i] != 2) { color(i); } } for (int i = 1; i <= n; ++i) { if (false) cerr << c[i] << n [i == n]; for (int j : g[i]) { newg[c[i]].emplace_back(c[j]); } } S = -1, fnd(c[1]); clr(S); if (false) cerr << S << S n ; vector<int> j, p; for (int i = 1; i <= n; ++i) { if (used[i] != 4) p.emplace_back(i); else j.emplace_back(i); } assert(!j.empty()); if (p.empty()) { cout << No n ; } else { cout << Yes n << j.size() << << p.size() << n ; for (int i : j) cout << i << ; cout << n ; for (int i : p) cout << i << ; cout << n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int TT; cin >> TT; while (TT--) solve(); }
|
#include <bits/stdc++.h> using namespace std; void read_file(bool outToFile = true) {} int n, K; const int MAXN = 200000 + 99; int A[MAXN]; set<int> X; int vis[MAXN]; bool check() { memset(vis, 0, sizeof vis); stack<int> s; int idx = 0; int cur = 1; while (true) { while (s.empty() || s.top() != cur) { s.push(A[idx]); vis[A[idx]] = 1; idx++; } s.pop(); cur++; if (cur == n + 1) break; if (vis[cur] && cur != s.top()) return false; } return true; } int main() { read_file(); while (scanf( %d%d , &n, &K) != -1) { X.clear(); memset(vis, 0, sizeof vis); for (int i = 0; i < K; i++) { scanf( %d , &A[i]); if (A[i] != 1) X.insert(A[i] - 1); vis[A[i]] = 1; } for (int i = 0; i < K; i++) { if (X.count(A[i])) X.erase(A[i]); } int idx = K; while (!X.empty()) { int x = *X.begin(); X.erase(X.begin()); A[idx++] = x; vis[x] = 1; if (x == 1) continue; if (!vis[x - 1]) X.insert(x - 1); } int mx = 0; for (int i = 0; i < idx; i++) mx = max(mx, A[i]); for (int i = n; i > mx; i--) A[idx + n - i] = i; if (!check()) { printf( -1 n ); continue; } for (int i = 0; i < n; i++) printf( %d%c , A[i], n [i == n - 1]); } }
|
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, t, tt, i; long long t1, t2, t3, t4; while (~scanf( %lld %lld , &a, &b)) { t = b - a; t1 = a % 10; t2 = b % 10; t3 = (a / 10) % 10; t4 = (b / 10) % 10; if (t >= 10 || (t4 != t3)) { printf( 0 n ); } else { if (t1 <= 2 && t2 >= 5) printf( 0 n ); else { tt = 1; for (i = t1 + 1; i <= t2; i++) { tt *= i; } printf( %lld n , tt % 10); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxN = 100050, mod = 1000000007; ; int n, ans, k; int fa[maxN], c[maxN]; int getfa(int u) { if (fa[u] == u) return u; int t = fa[u]; fa[u] = getfa(fa[u]); while (c[u] < 0) c[u] += mod; while (c[t] < 0) c[t] += mod; c[u] = (c[u] + c[t]) % mod; return fa[u]; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { fa[i] = i; c[i] = 0; } int v, x; for (int i = 1; i <= n; i++) { scanf( %d , &k); for (int j = 1; j <= k; j++) { scanf( %d%d , &v, &x); int t = getfa(v); fa[t] = i; while (c[v] < 0) c[v] += mod; while (x < 0) x += mod; c[t] = (c[v] + x) % mod; while (c[t] < 0) c[t] += mod; while (ans < 0) ans += mod; ans = (ans + c[t]) % mod; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:5000000000 ) const long long mod = 1000000007; long long Inf = (long long)2e9; long long LINF = (long long)1e18 + 1e17; using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; vector<long long> a(n); vector<bool> can(n, true); map<long long, set<int>> pos; for (int(i) = 0; (i) < n; (i)++) { cin >> a[i]; pos[a[i]].insert(i); } int k = n; while (pos.size()) { if (pos.begin()->second.size() < 2) { pos.erase(pos.begin()); continue; } int i1 = *pos.begin()->second.begin(); pos.begin()->second.erase(i1); int i2 = *pos.begin()->second.begin(); pos.begin()->second.erase(i2); long long x = pos.begin()->first; k--; can[i1] = false; pos[2 * x].insert(i2); a[i2] = 2 * x; } cout << k << endl; for (int(i) = 0; (i) < n; (i)++) if (can[i]) cout << a[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30); const int N = 100005; int n, k; int g[105][105]; int main() { int i, j, t, cas = 0; memset(g, 0, sizeof(g)); scanf( %d , &k); for (n = 3; n <= 100; n++) { if ((n) * (n - 1) * (n - 2) / 6 > k) break; } n--; k -= (n) * (n - 1) * (n - 2) / 6; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i == j) continue; g[i][j] = 1; } } while (k) { for (i = 2;; i++) { if ((i) * (i - 1) / 2 > k) break; } i--; n++; for (j = 1; j <= i; j++) g[j][n] = g[n][j] = 1; k -= (i) * (i - 1) / 2; } printf( %d n , n); for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { printf( %d , g[i][j]); } puts( ); } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long int mod = 1e9 + 7; long long int mod1 = 998244351; long long int power(long long int a, long long int b) { if (b == 0) return 1; else if (b % 2 == 0) return power(a * a % mod, b / 2) % mod; else return (a % mod * power(a * a % mod, b / 2)) % mod; } long long int bit(long long int x) { return __builtin_popcountll(x); } long long int temp1, temp2, temp3, temp4; void fi(long long int x3, long long int y3, long long int x4, long long int y4) { long long int x5 = max(temp1, x3); long long int y5 = max(temp2, y3); long long int x6 = min(temp3, x4); long long int y6 = min(temp4, y4); if (x5 > x6 || y5 > y6) { temp1 = -1000000009, temp2 = -1e9 - 1, temp3 = -1e9 - 1, temp4 = -1e9 - 1; return; } temp1 = x5; temp2 = y5; temp3 = x6; temp4 = y6; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; long long int a[n], b[n], c[n], d[n]; for (int i = 0; i < n; ++i) { cin >> a[i] >> b[i] >> c[i] >> d[i]; } temp1 = a[0], temp2 = b[0], temp3 = c[0], temp4 = d[0]; long long int count = 0; vector<int> index; for (int i = 1; i < n; ++i) { long long int p = temp1, p1 = temp2, p3 = temp3, p4 = temp4; fi(a[i], b[i], c[i], d[i]); if (temp1 == -1000000009) { temp1 = p; temp2 = p1; temp3 = p3; temp4 = p4; count++; } } if (count <= 1) { cout << temp1 << << temp2 << n ; return 0; } temp1 = a[n - 1]; temp2 = b[n - 1]; temp3 = c[n - 1]; temp4 = d[n - 1]; count = 0; for (int i = n - 1; i >= 0; --i) { long long int p = temp1, p1 = temp2, p3 = temp3, p4 = temp4; fi(a[i], b[i], c[i], d[i]); if (temp1 == -1000000009) { temp1 = p; temp2 = p1; temp3 = p3; temp4 = p4; count++; } } if (count <= 1) { cout << temp1 << << temp2 << n ; return 0; } temp1 = a[1], temp2 = b[1], temp3 = c[1], temp4 = d[1], count = 0; for (int i = 2; i < n; ++i) { long long int p = temp1, p1 = temp2, p3 = temp3, p4 = temp4; fi(a[i], b[i], c[i], d[i]); } cout << temp3 << << temp4 << n ; }
|
#include <bits/stdc++.h> using namespace std; int n, numone, numtwo, sum, tmp; char nlong; string nameone, nametwo; string read; struct node { string name; int goal, moregoal, score; int q; } wxy[100]; bool check(int t) { for (int i = 0; i < tmp; i++) if (wxy[t].name[i] != nameone[i]) return false; return true; } bool checktwo(int t) { for (int i = tmp + 1; i < sum; i++) if (wxy[t].name[i - tmp - 1] != nametwo[i - tmp - 1]) return false; return true; } bool cmpfirst(node a, node b) { if (a.score > b.score) return 1; if (a.score < b.score) return 0; if (a.moregoal > b.moregoal) return 1; if (a.moregoal < b.moregoal) return 0; if (a.goal > b.goal) return 1; return 0; } bool cmplast(node a, node b) { return a.name < b.name; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> wxy[i].name; wxy[i].q = wxy[i].name.size(); } for (int j = 1; j <= n * (n - 1) / 2; j++) { sum = 0; tmp = 0; nameone = , nametwo = ; numone = numtwo = 0; while (1) { scanf( %c , &nlong); if (nlong == - ) break; else if ((nlong >= a && nlong <= z ) || (nlong >= A && nlong <= Z )) { nameone += nlong; sum++; } } tmp = sum; sum++; while (1) { scanf( %c , &nlong); if (nlong == ) break; else { nametwo += nlong; sum++; } } while (1) { scanf( %c , &nlong); if (nlong == : ) break; else if (nlong >= 0 && nlong <= 9 ) numone = numone * 10 + nlong - 0 ; } cin >> numtwo; int one, two; for (int i = 1; i <= n; i++) if (wxy[i].q == tmp) if (check(i)) { one = i; break; } for (int i = 1; i <= n; i++) if (wxy[i].q + tmp + 1 == sum) if (checktwo(i)) { two = i; break; } wxy[one].goal += numone; wxy[two].goal += numtwo; wxy[one].moregoal += numone - numtwo; wxy[two].moregoal += numtwo - numone; if (numone > numtwo) wxy[one].score += 3; else if (numtwo > numone) wxy[two].score += 3; else { wxy[one].score++; wxy[two].score++; } } sort(wxy + 1, wxy + n + 1, cmpfirst); sort(wxy + 1, wxy + (n) / 2 + 1, cmplast); for (int i = 1; i <= n / 2; i++) cout << wxy[i].name << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int f[26]; char s[100005]; int dp[100005][26]; int main(void) { int n; scanf( %s , s + 1); scanf( %d , &n); for (int i = 0; i < 26; i++) f[i] = -1; for (int i = 0; i < n; i++) { char x[10]; scanf( %s , x); f[x[0] - a ] = x[1] - a ; f[x[1] - a ] = x[0] - a ; } for (int i = 1; s[i]; i++) { int mins = 1 << 20; for (int j = 0; j < 26; j++) if (j != f[s[i] - a ]) mins = min(dp[i - 1][j], mins); for (int j = 0; j < 26; j++) { if (j == s[i] - a ) { dp[i][j] = mins; } else { dp[i][j] = dp[i - 1][j] + 1; } } } int m = strlen(s + 1); printf( %d n , *min_element(dp[m], dp[m] + 26)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int a, b; cin >> a >> b; int x = abs(a - b); int ans = x / 5; x %= 5; ans += x / 2; x %= 2; ans += x; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a, b, c, s; vector<double> x, y11, z; double rx, ry, rz, mn = -1000000000; double mln(double x) { return log(x); } void upd(double nx, double ny, double nz) { if (nx + ny + nz > (s + 1e-7)) return; double cur = 0; if (a) cur += a * mln(nx); if (b) cur += b * mln(ny); if (c) cur += c * mln(nz); if (cur > mn) { mn = cur; rx = nx; ry = ny; rz = nz; } } int main() { scanf( %d %d %d %d , &s, &a, &b, &c); if (a == 0 && b == 0 && c == 0) { puts( 0.0 0.0 0.0 ); return 0; } if (a != 0) { double S = s; double m = 1 + b * 1. / a + c * 1. / a; double x0 = S / m; x.push_back(x0); y11.push_back(x0 * b * 1. / a); z.push_back(x0 * c * 1. / a); } else if (b != 0) { double S = s; double m = 1 + a * 1. / b + c * 1. / b; double x0 = S / m; x.push_back(x0 * a * 1. / b); y11.push_back(x0); z.push_back(x0 * c * 1. / b); } else if (c != 0) { double S = s; double m = 1 + a * 1. / c + b * 1. / c; double x0 = S / m; x.push_back(x0 * a * 1. / c); y11.push_back(x0 * b * 1. / c); z.push_back(x0); } double S = s; x.push_back(0); y11.push_back(0); z.push_back(s); x.push_back(0); y11.push_back(s); z.push_back(0); x.push_back(s); y11.push_back(0); z.push_back(0); if (a + b) { z.push_back(0); z.push_back(0); x.push_back(a * c / (b + a + 0.)); y11.push_back(S - a * c / (b + a + 0.)); x.push_back(b * c / (b + a + 0.)); y11.push_back(S - b * c / (b + a + 0.)); } if (b + c) { x.push_back(0); x.push_back(0); y11.push_back(b * a / (b + c + 0.)); z.push_back(S - b * a / (b + c + 0.)); y11.push_back(c * a / (b + c + 0.)); z.push_back(S - c * a / (b + c + 0.)); } if (a + c) { y11.push_back(0); y11.push_back(0); x.push_back(a * b / (c + a + 0.)); z.push_back(S - a * b / (c + a + 0.)); x.push_back(c * b / (c + a + 0.)); z.push_back(S - c * b / (c + a + 0.)); } for (int i = 0; i < x.size(); i++) { upd(x[i], y11[i], z[i]); } printf( %.11lf %.11lf %.11lf n , rx, ry, rz); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Pnt { int x, y; Pnt() {} Pnt(int _x, int _y) { x = _x; y = _y; } bool operator<(const Pnt& o) const { if (x != o.x) return x < o.x; return y < o.y; } void show() { printf( Pnt %d %d n , x, y); } }; const int MAXN = 1000005; const int MAXS = 20; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; int n, m; char s[MAXN]; int f[MAXN][2]; void preGao() {} void init() { if (scanf( %s , s) == EOF) exit(0); n = strlen(s); } void work() { f[n][0] = 0; f[n][1] = 2; for (int i = n - 1; i >= 0; i--) { f[i][0] = f[i + 1][0] + (s[i] == 1 ); f[i][0] = min(f[i][0], f[i + 1][1]); f[i][1] = f[i + 1][0] + 2 + (s[i] == 0 ); f[i][1] = min(f[i][1], f[i + 1][1] + (s[i] == 0 )); } printf( %d n , min(f[0][0], f[0][1])); } int main() { preGao(); while (true) { init(); work(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); const int INF = 1000000000; const int dx[4] = {0, 0, 1, -1}; const int dy[4] = {1, -1, 0, 0}; const int N = 100001; int n, a[N]; int ans; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; (i) < (n); ++i) cin >> a[i]; sort(a, a + n); int c = 1; for (int i = 0; i < n; i++) { if (a[i] >= c) { c++; } } cout << c << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; const int inf = 1e9; char aa[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> aa[i]; } sort(aa + 1, aa + 1 + n); if (aa[1] != aa[k]) cout << aa[k] << endl; else { int mark = 1; if (aa[n] == aa[k + 1]) mark = 0; if (mark == 0) { for (int i = 1; i <= n; i += k) cout << aa[i]; cout << endl; } else { cout << aa[1]; for (int i = k + 1; i <= n; i++) cout << aa[i]; cout << endl; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> G[14]; int dp[1 << 14], dp2[14][14][1 << 14]; vector<int> re[1 << 14]; pair<int, int> last_pair[1 << 14]; int pre[1 << 14]; int last[14][14][1 << 14]; bool v[1 << 14]; int main() { int n, m, x, y; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d , &x, &y); G[x - 1].push_back(y - 1); G[y - 1].push_back(x - 1); } for (int i = 0; i < n; i++) v[1 << i] = 1; memset(dp, 0x3f, sizeof(dp)); dp[1] = 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int k = 0; k < (1 << n); k++) { dp2[i][j][k] = 0x3f3f3f3f; } for (int i = 0; i < n; i++) for (auto x : G[i]) { dp2[i][x][0] = 1; last[i][x][0] = i; } for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if ((i >> j) & 1) continue; for (int k = 0; k < n; k++) { if ((i >> k) & 1) continue; if (j == k || dp2[j][k][i] == 0x3f3f3f3f) continue; for (auto z : G[k]) { if ((i >> z) & 1) continue; if (z == last[j][k][i]) continue; int tmp = i ^ (1 << k); if (dp2[j][z][tmp] == 0x3f3f3f3f) { dp2[j][z][tmp] = 1; last[j][z][tmp] = k; } } } } } for (int i = 0; i < n; i++) dp[1 << i] = 0; for (int i = 0; i < (1 << n); i++) for (int j = 0; j < n; j++) { if ((i >> j) & 1) re[i].push_back(j); } for (int i = 0; i < (1 << n); i++) { for (int j = i; j; j = (j - 1) & i) { int tmp = i ^ j; int cnt = __builtin_popcount(j) + 1; if (dp[i] < dp[tmp] + cnt) continue; for (auto x : re[tmp]) for (auto y : re[tmp]) { if (dp2[x][y][j] == 1) { dp[i] = min(dp[i], dp[tmp] + cnt); last_pair[i] = make_pair(x, y); pre[i] = tmp; } } } } if (dp[(1 << n) - 1] == 0x3f3f3f3f) { printf( -1 n ); } else { printf( %d n , dp[(1 << n) - 1]); int now = (1 << n) - 1; while (!v[now]) { int x = last_pair[now].first, y = last_pair[now].second; int tmp = now ^ pre[now]; while (tmp) { int tmp1 = last[x][y][tmp]; printf( %d %d n , y + 1, tmp1 + 1); y = tmp1; tmp ^= (1 << tmp1); } printf( %d %d n , x + 1, y + 1); now = pre[now]; } } }
|
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } void faster() { ios::sync_with_stdio(false); cin.tie(nullptr); } long long n, m; vector<long long> vst; vector<long long> dis; long long bfs(long long u, vector<set<long long> > &adj) { queue<pair<long long, long long> > q; q.push(make_pair(u, 0)); while (!q.empty()) { long long v, d; tie(v, d) = q.front(); q.pop(); vst[v] = 1; dis[v - 1] = d; for (auto e : adj[v]) { if (!vst[e]) { q.push(make_pair(e, d + 1)); vst[e] = 1; } } } return dis[n - 1]; } void solve() { cin >> n >> m; vector<set<long long> > adj(n + 1); vst.resize(n + 1); dis.resize(n); fill((dis).begin(), (dis).end(), 1000); bool flag = true; for (__typeof(m) i = (0) - ((0) > (m)); i != (m) - ((0) > (m)); i += 1 - 2 * ((0) > (m))) { long long x, y; cin >> x >> y; if (min(x, y) == 1 && max(x, y) == n) flag = false; adj[x].insert(y); adj[y].insert(x); } if (flag) { long long dist = bfs(1, adj); if (dist == 1000) dist = -1; cout << dist << endl; } else { vector<set<long long> > adjp(n + 1); for (long long i = 1; i < n + 1; i++) { for (long long j = 1; j < n + 1; j++) { if (j != i && !adj[i].count(j)) adjp[i].insert(j); } } long long dist = bfs(1, adjp); if (dist == 1000) dist = -1; cout << dist << endl; } } signed main() { faster(); long long t = 1; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, k; vector<pair<int, int> > g[maxn]; int d[maxn], par[maxn]; void dfs1(int u, int fa) { par[u] = fa; for (auto p : g[u]) { int v = p.first; if (v == fa) continue; d[v] = d[u] + p.second; dfs1(v, u); } } int a[maxn]; bool f[maxn]; int c[maxn]; void dfs(int u, int fa) { d[u] = 0; par[u] = fa; for (auto p : g[u]) { int v = p.first; if (v == fa) continue; dfs(v, u); c[v] = p.second; if (!f[v]) d[u] = max(d[u], d[v] + p.second); } } int l[maxn], r[maxn], t[maxn], tail = 1; int main() { scanf( %d%d , &n, &k); int u, v, w; for (int i = 1; i <= n - 1; i++) scanf( %d%d%d , &u, &v, &w), g[u].push_back(pair<int, int>(v, w)), g[v].push_back(pair<int, int>(u, w)); dfs1(1, -1); d[1] = 0; int rt = 1; for (int i = 1; i <= n; i++) if (d[i] > d[rt]) rt = i; d[rt] = 0; dfs1(rt, -1); int y = rt; for (int i = 1; i <= n; i++) if (d[i] > d[y]) y = i; int p = y; int m = 0; while (p > 0) a[++m] = p, p = par[p]; dfs(rt, -1); for (int i = 1; i <= n; i++) l[i] = d[i]; dfs(y, -1); for (int i = 1; i <= n; i++) r[i] = d[i]; for (int i = 1; i <= m; i++) f[a[i]] = 1; dfs(rt, -1); tail = 1; int head = 1; int ans = 1e9; for (int i = 1; i <= m; i++) { while (tail > head && d[a[t[tail - 1]]] <= d[a[i]]) tail--; t[tail++] = i; int q = d[a[t[head]]]; q = max(q, (i - k + 1 > 0 ? l[a[i - k + 1]] : 0)); q = max(q, r[a[i]]); ans = min(ans, q); if (t[head] == i - k) head++; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> int main() { static char cc[100000 + 1]; int n, k, a, i; scanf( %d%d , &n, &k); a = (n - k) / 2; for (i = 0; i < n; i++) cc[i] = 0 + (i % (a + 1) == a); printf( %s n , cc); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, l, r, ar[110], ubah; int main() { cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> l >> r; ar[l]++; ar[r + 1]--; } for (int i = 1; i <= n; i++) { ubah += ar[i]; if (ubah != 1) { cout << i << << ubah << n ; return 0; } } cout << OK n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; unsigned long long lvl_len(int lvl) { static long long len[64] = {0}; if (len[lvl]) return len[lvl]; else { len[1] = 1; for (int i = 2; i < 64; ++i) len[i] = len[i - 1] * 2 + 1; } return len[lvl]; } void rec(int lvl, unsigned long long pos) { if (pos < lvl_len(lvl - 1)) rec(lvl - 1, pos); else if ((pos -= lvl_len(lvl - 1)) < 1) cout << lvl; else rec(lvl - 1, pos - 1); }; int main(int, char **) { ios::sync_with_stdio(false); unsigned long long n, p; cin >> n >> p; rec(n, p - 1); return 0; }
|
#include<bits/stdc++.h> using namespace std ; #define ll long long #define pb push_back #define all(v) v.begin(),v.end() #define sz(a) (ll)a.size() #define F first #define S second #define INF 2000000000000000000 #define popcount(x) __builtin_popcountll(x) #define pll pair<ll,ll> #define pii pair<int,int> #define ld long double const int M = 1000000007; const int MM = 998244353; const long double PI = acos(-1); template<typename T, typename U> static inline void amin(T &x, U y){ if(y<x) x=y; } template<typename T, typename U> static inline void amax(T &x, U y){ if(x<y) x=y; } template<typename T, typename U> ostream& operator<<(ostream &os, const pair<T, U> &p) { return os<< ( <<p.F<< , <<p.S<< ) ; } template <typename A, typename B> string to_string(pair<A, B> p); string to_string(const string& s) { return + s + ; } string to_string(const char* s) { return to_string((string) s); } string to_string(bool b) { return (b ? true : false ); } string to_string(char c) { string t = + string(1,c) + ; return t; } string to_string(vector<bool> v) { bool first = true; string res = { ; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += , ; } first = false; res += to_string(v[i]); } res += } ; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ; for(size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for(const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template<typename T> void debug_out(const char* name, T&& x) { cerr << [ << name << ] : << to_string(x) << endl; } template <typename H, typename... T> void debug_out(const char* names, H&& arg1, T&&... args){ const char* comma = strchr(names + 1, , ); cerr << [ ; cerr.write(names, comma - names) << ] : << to_string(arg1) << | ; debug_out(comma+1, args...); } #ifdef LOCAL #define debug(...) debug_out(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) 2351 #endif const int N = 300005; ll ans = 0; int in[N],out[N],cur = 1; vector<int> v[N],g[N]; set<pii> s; void dfs2(int s,int p) { in[s] = cur++; for(auto j:g[s]) dfs2(j,s); out[s] = cur-1; } void dfs(int u,int p) { bool added = false; pii rm = {-1,-1}; // cout<<u<< <<in[u]<< <<out[u]<< n ; auto it = s.lower_bound({in[u],-1}); if(it != s.end()) { if(it->F <= out[u]) { amax(ans,sz(s)); goto yo; } } if(it != s.begin()) { --it; if(it->S >= in[u]) { assert(it->F <= in[u]); added = true; rm = {it->F,it->S}; s.erase(rm); s.insert({in[u],out[u]}); amax(ans,sz(s)); goto yo; } } s.insert({in[u],out[u]}); amax(ans,sz(s)); yo:; // debug(s); for(auto j:v[u]) dfs(j,u); if(s.count({in[u],out[u]})) s.erase({in[u],out[u]}); if(added) { s.insert(rm); } } int _runtimeTerror_() { ans = 0; int n; cin>>n; cur = 1; s.clear(); for(int i=1;i<=n;++i) { in[i] = out[i] = 0; v[i].clear(),g[i].clear(); } for(int i=2;i<=n;++i) { int x; cin>>x; v[x].push_back(i); } for(int i=2;i<=n;++i) { int x; cin>>x; g[x].push_back(i); } dfs2(1,0); dfs(1,0); cout<<ans<< n ; return 0; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #ifdef runSieve sieve(); #endif #ifdef NCR initialize(); #endif int TESTS=1; cin>>TESTS; while(TESTS--) _runtimeTerror_(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<vector<int> > A(n, vector<int>(n)); int counter = 0; int sum = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < k - 1; j++) { A[i][j] = ++counter; } } for (int i = 0; i < n; i++) { for (int j = k - 1; j < n; j++) { A[i][j] = ++counter; } } for (int i = 0; i < n; i++) { sum += A[i][k - 1]; } cout << sum << endl; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << A[i][j] << ; } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; #define ll long long int #define ff first #define ss second #define pb push_back #define mp make_pair #define deb(x) cout<< #x << << x << n ; #define MAX 9223372036854775807 #define MIN -9223372036854775807 #define setbits(n) __builtin_popcountll(n) #define mkunique(a) sort(a.begin(),a.end()); a.resize(unique(a.begin(),a.end())-a.begin()); #define print(s) for(auto u: s) cout<<u<< ; cout<< n ; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const ll mod=998244353; const int N=501; ll dp[N][N][2], n; vector<ll> a; ll inc, id; ll go(ll pos, ll diff, ll f){ if(pos==n){ if(f) return 1; return 0; } if(dp[pos][diff][f]!=-1) return dp[pos][diff][f]; ll ans = go(pos+1,diff,f); if(a[pos]>0){ ll val = a[pos]; if(pos == id) ans = (ans + go(pos+1,diff+1,1))%mod; else{ if(val<inc || (val==inc && pos<id)) ans = (ans + go(pos+1,diff+1,f))%mod; else ans = (ans + go(pos+1,diff,f))%mod; } } else{ if(diff-1 < 1) ans = (ans + go(pos+1,0,0))%mod; else ans = (ans + go(pos+1,diff-1,f))%mod; } return dp[pos][diff][f] = ans; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll TT=clock(); cin>>n; for(ll i=0;i<n;i++){ char c; cin>>c; if(c== + ){ ll num; cin>>num; a.pb(num); } else{ a.pb(-1); } } ll ans=0; for(ll i=0;i<n;i++){ if(a[i]>0){ inc = a[i]; id = i; memset(dp,-1,sizeof(dp)); ll mul = go(0,0,0); ans = (ans + inc*mul%mod)%mod; } } cout<<ans; cerr<< n nTIME: <<(long double)(clock()-TT)/CLOCKS_PER_SEC<< sec n ; TT = clock(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; map<string, string> mp; set<string> s; for (int i = 0; i < n; i++) { string old, edg; cin >> old >> edg; mp[old] = edg; s.insert(edg); } map<string, string>::iterator p; p = mp.begin(); vector<pair<string, string>> a; for (p; p != mp.end(); p++) { if (s.count(p->first)) continue; string cur; cur = p->first; while (mp.count(cur)) { cur = mp[cur]; } a.push_back(make_pair(p->first, cur)); } cout << a.size() << n ; for (int i = 0; i < a.size(); i++) cout << a[i].first << << a[i].second << n ; }
|
#include <bits/stdc++.h> using namespace std; long long add(long long x, long long y) { x += y; while (x >= 998244353) x -= 998244353; while (x < 0) x += 998244353; return x; } long long mul(long long x, long long y) { return (x * 1ll * y) % 998244353; } long long binpow(long long x, long long y) { long long z = 1; while (y > 0) { if (y % 2 == 1) z = mul(z, x); x = mul(x, x); y /= 2; } return z; } long long inv(long long x) { return binpow(x, 998244353 - 2); } long long divide(long long x, long long y) { return mul(x, inv(y)); } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, k; cin >> n >> k; vector<long long> a(k); for (long long i = 0; i < (long long)k; ++i) cin >> a[i]; vector<long long> last(n + 1, -1), fst(n + 1, k); for (long long i = 1; i <= k; i++) { last[a[i - 1]] = i; } for (long long i = k; i >= 1; i--) { fst[a[i - 1]] = i; } long long ans = 0; for (long long i = 1; i <= n; i++) { for (long long j = max(1ll, i - 1); j <= min(i + 1, n); j++) { if (j == i) { if (last[i] == -1) ans += 1; } else ans += (last[i] <= fst[j]); } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; long long T[N]; long long sum[5]; multiset<long long, greater<long long>> ms[5]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, k, b, c; cin >> n >> k >> b >> c; for (int i = 1; i <= n; i++) { cin >> T[i]; } sort(T + 1, T + n + 1); if (T[1] < 0) { long long val = -T[1]; for (int i = 1; i <= n; i++) { T[i] += val; } } if (5 * c <= b) { long long ans = 9e18; long long sum = 0; for (int i = 1; i <= n; i++) { sum += T[i]; if (i >= k) { ans = min(ans, T[i] * k - sum); sum -= T[i - k + 1]; } } cout << ans << n ; exit(0); } long long ans = 9e18; for (int i = 1; i <= n; i++) { for (int j = 0; j < 5; j++) { long long cnt = -((T[i] + j) / 5) * b + j * c; int mm = (T[i] + j) % 5; sum[mm] += cnt; ms[mm].insert(cnt); } if (i > k) { for (int j = 0; j < 5; j++) { sum[j] -= *ms[j].begin(); ms[j].erase(ms[j].begin()); } } if (i >= k) { for (int j = 0; j < 5; j++) { int mm = (T[i] + j) % 5; ans = min(ans, ((T[i] + j) / 5) * b * k + sum[mm]); } } } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> long long int mod = 1000000007; using namespace std; void solve() { long long int n, k; cin >> n >> k; char ans[4][n]; int nval = n - 2; for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { ans[i][j] = . ; } } int mid = nval / 2; mid++; if (k % 2 == 1) { for (int i = 1; i < 3; i++) { if (k <= 0) break; for (int j = mid; j >= 1; j--) { if (i > 1 && k % 2 == 0 && k < nval) { ans[i][1] = # ; ans[i][n - 2] = # ; k--; k--; } if (k > 0) { ans[i][j] = # ; k--; if (k <= 0) break; ans[i][mid + (mid - j)] = # ; if (j != mid) k--; } else break; } } } else { for (int i = 1; i < n - 1; i++) { for (int j = 1; j < 3; j++) { if (k) { ans[j][i] = # ; k--; } } } } cout << YES << endl; for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { cout << ans[i][j]; } cout << endl; } } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 300005; const long long mod = 998244353; long long fac[maxn], invfac[maxn]; int a[maxn]; long long qp(long long x, long long p, long long MOD) { long long res = 1; while (p) { if (p & 1) res = res * x % MOD; x = x * x % MOD; p >>= 1; } return res; } void init() { fac[0] = 1; invfac[0] = 1; for (int i = 1; i < maxn; i++) fac[i] = fac[i - 1] * 1ll * i % mod; invfac[maxn - 1] = qp(fac[maxn - 1], mod - 2, mod); for (int i = maxn - 2; i >= 1; i--) invfac[i] = invfac[i + 1] * 1ll * (i + 1) % mod; } long long C(int n, int k) { return fac[n] * invfac[n - k] % mod * invfac[k] % mod; } int main() { init(); int n; scanf( %d , &n); for (int i = 1; i <= n + n; i++) scanf( %d , &a[i]); sort(a + 1, a + n * 2 + 1); long long ans = 0; for (int i = 1; i <= n * 2; i++) { if (i <= n) { ans = (ans - C(n * 2, n) * a[i] % mod) % mod; } else { ans = (ans + C(n * 2, n) * a[i] % mod + mod) % mod; } } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int f3(int n) { return n * (n - 1) * (n - 2) / 6; } int main() { int K; cin >> K; int N = 3; while (f3(N + 1) <= K) N++; int MN = N * (N - 1) / 2; int TN = 100; vector<string> E(TN, string(TN, 0 )); for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) { E[i][j] = E[j][i] = 1 ; } } int GK = f3(N); for (int i = N; i < TN; i++) { for (int j = 0; j < N && GK + j <= K; j++) { E[i][j] = E[j][i] = 1 ; GK += j; } } cout << TN << endl; for (int i = 0; i < E.size(); i++) cout << E[i] << endl; }
|
#include <bits/stdc++.h> using namespace std; const int up = 1e6 + 6; int n, m, k, pos; int cost[up], p[up], last[up]; int main() { scanf( %d , &n); scanf( %d , &m); scanf( %d , &k); for (int i = 1; i <= m; i++) { scanf( %d , &pos); p[pos] = 1; } if (p[0]) { printf( %d n , -1); return 0; } for (int i = 0; i <= n; i++) { if (!p[i]) last[i] = i; else last[i] = last[i - 1]; } for (int i = 1; i <= k; i++) { scanf( %d , &cost[i]); } long long res = 1ll * up * up; for (int i = 1; i <= k; i++) { int cnt = 1; for (int j = i; j < n; j += i) { if (j - last[j] >= i) { cnt = n + 10; break; } else { j = last[j]; cnt++; } } if (cnt <= n) { res = min(res, 1ll * cnt * cost[i]); } } if (res == 1ll * up * up) { res = -1ll; } printf( %I64d n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; mt19937_64 rang( chrono::high_resolution_clock::now().time_since_epoch().count()); int rng(int lim) { uniform_int_distribution<int> uid(0, lim - 1); return uid(rang); } void solution() { int y; cin >> y; while (true) { y = y + 1; int a = y / 1000; int b = y / 100 % 10; int c = y / 10 % 10; int d = y % 10; if (a != b && a != c && a != d && b != c && b != d && c != d) { break; } } cout << y << endl; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); srand(chrono::high_resolution_clock::now().time_since_epoch().count()); int test = 1; while (test--) { solution(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; map<char, char> q; int main() { char a[30], b[30]; scanf( %s , a); scanf( %s , b); q.clear(); for (int i = 0; i < 26; i++) { q[a[i]] = b[i]; q[a[i] - 32] = b[i] - 32; } char aim[2000]; scanf( %s , aim); for (int i = 0; aim[i]; i++) { if (q[aim[i]]) printf( %c , q[aim[i]]); else printf( %c , aim[i]); } printf( n ); }
|
#include <bits/stdc++.h> const double EPS = 1e-7; const double PI = 3.1415926535897932384626; const int MAXN = 100001; int n, a[MAXN]; int main() { std::cin >> n; for (int i = 1; i <= n; i++) { std::cin >> a[i]; } long long answer = 0; for (int i = 1; i <= n; i++) { answer += a[i]; } std::sort(a + 1, a + n + 1); if (answer & 1) { for (int i = 1; i <= n; i++) if (a[i] & 1) { answer -= a[i]; break; } } std::cout << answer << std::endl; return 0; }
|
#include <bits/stdc++.h> int n; int degree[100010]; int main() { scanf( %d , &n); for (int i = 1; i <= n - 1; i++) { int r1, r2; scanf( %d%d , &r1, &r2); degree[r1]++; degree[r2]++; } for (int i = 1; i <= n; i++) { if (degree[i] == 2) { printf( NO ); return 0; } } printf( YES ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; long long int cost = 0; vector<int> a, b, c; vector<vector<int>> g; pair<int, int> dfs(int cur, int par, int mn_before) { pair<int, int> ap = {0, 0}; int mn_cur = min(a[cur], mn_before); if (b[cur] != c[cur]) { if (b[cur] == 1) { ap.first = 1; ap.second = 0; } else { ap.first = 0; ap.second = 1; } } for (auto it : g[cur]) { if (it != par) { pair<int, int> pa = dfs(it, cur, mn_cur); ap.first += pa.first; ap.second += pa.second; } } if (a[cur] < mn_before) { int cnt = min(ap.first, ap.second); cost += 2 * 1ll * cnt * 1ll * a[cur]; ap.first -= cnt; ap.second -= cnt; } return ap; } long long int solve() { cin >> n; a.resize(n + 1); b.resize(n + 1); c.resize(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i] >> c[i]; } g.resize(n + 1); int u, v; for (int i = 0; i < n - 1; i++) { cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } pair<int, int> a = dfs(1, -1, 1000000000); if (a.first != a.second) { return -1; } return cost; } int main() { int t = 1; while (t--) { cout << solve() << n ; } }
|
#include <bits/stdc++.h> using namespace std; int num, rt[200010], n; struct data { int l, r, v; } tr[200010 * 20]; void insert(int p, int l, int r, int n, int &x) { x = ++num; tr[x] = tr[n]; if (l == r) { tr[x].v++; return; } int mid = l + r >> 1; if (p <= mid) insert(p, l, mid, tr[n].l, tr[x].l); else insert(p, mid + 1, r, tr[n].r, tr[x].r); tr[x].v = tr[tr[x].l].v + tr[tr[x].r].v; } int ask(int al, int ar, int l, int r, int lx, int x) { if (x == 0) return 0; if (al <= l && r <= ar) return tr[x].v - tr[lx].v; int mid = l + r >> 1, ans = 0; if (al <= mid) ans = ask(al, ar, l, mid, tr[lx].l, tr[x].l); if (ar > mid) ans += ask(al, ar, mid + 1, r, tr[lx].r, tr[x].r); return ans; } int ask(int r1, int r2, int l1, int l2) { if (r1 > r2 || l1 > l2) return 0; return ask(r1, r2, 1, n, rt[l1 - 1], rt[l2]); } int main() { int m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); insert(x, 1, n, rt[i - 1], rt[i]); } for (int i = 1; i <= m; i++) { int l1, l2, r1, r2; scanf( %d%d%d%d , &l1, &r1, &l2, &r2); long long ans = 0; ans += 1ll * ask(1, r1 - 1, 1, l1 - 1) * ask(r1, n, l1, n); ans += 1ll * ask(1, r1 - 1, l1, l2) * ask(r1, n, 1, n); ans += 1ll * ask(1, r1 - 1, l2 + 1, n) * ask(r1, n, 1, l2); ans += 1ll * ask(r1, r2, 1, l1 - 1) * ask(r1, n, l1, n); ans += 1ll * ask(r1, r2, l1, l2) * (ask(r1, n, 1, n) - ask(r1, r2, 1, l1 - 1) - ask(r1, r2, l1, l2)); ans += 1ll * ask(r1, r2, l2 + 1, n) * ask(r2 + 1, n, 1, l2); ans += 1ll * ask(r1, r2, l1, l2) * (ask(r1, r2, l1, l2) - 1) / 2; printf( %lld n , ans); } }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 10000; const long long MAXN = 1000; int n, a[MAXN], sum, cnt, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; } sort(a, a + n + 1); for (int i = n; i >= 1; i--) { cnt += a[i]; ans++; if (cnt > sum - cnt) { cout << ans; return 0; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int l = 0; l < t; l++) { long long n, s, k; cin >> n >> s >> k; unordered_set<long long> tilos; for (int i = 0; i < k; ++i) { long long x; cin >> x; tilos.insert(x); } for (long long i = 0; i <= k; i++) { if ((s + i <= n) && (tilos.find(s + i) == tilos.end())) { cout << i << endl; break; } if ((s - i >= 1) && (tilos.find(s - i) == tilos.end())) { cout << i << endl; break; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int d[200100], a[200100]; long long ans; int main() { int n, m, i, tmp, s, x; bool f = false, flag = true; scanf( %d , &n); for (i = 1; i <= n; ++i) scanf( %d , d + i); scanf( %d , &m); if (m % ((n - 1) << 1) == 0) f = true; s = (m / ((n - 1) << 1)) << 1; ans = (long long)s * (d[n] - d[1]); while (m--) { scanf( %d , &x); ++a[x]; } a[1] <<= 1; a[n] <<= 1; tmp = d[2] - d[1]; for (i = 1; i < n; ++i) { if (f && d[i + 1] - d[i] != tmp) flag = false; ans += min(a[i] - s, a[i + 1] - s) * (d[i + 1] - d[i]); } if (flag) printf( %I64d n , ans - f * tmp); else puts( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long abs2(long long a) { return a >= 0 ? a : -a; } long long calc(long long k, long long a) { if (k >= 0) return k / a; return (k - (a - 1)) / a; } long long calc2(long long a1, long long b1, long long a2, long long b2) { long long x = abs2(a1 - a2) + abs2(b2 - (a2 + (b1 - a1))); long long y = abs2(a1 - a2) + abs2(b2 - (-a2 + a1 + b1)); return min(x, y); } int main() { long long a, b, x1, x2, y1, y2; while (cin >> a >> b >> x1 >> y1 >> x2 >> y2) { long long a1, b1; long long a2, b2; a1 = calc(x1 + y1, 2 * a); b1 = calc(x1 - y1, 2 * b); a2 = calc(x2 + y2, 2 * a); b2 = calc(x2 - y2, 2 * b); long long x = calc2(a1, b1, a2, b2); long long y = calc2(b1, a1, b2, a2); cout << (int)min(x, y) << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using lld = signed long long int; lld solve() { lld n, m, k; cin >> n >> m >> k; lld x = n / k; if (m <= x) return m; if (m <= x + (k - 1)) return x - 1; return x - ceil((m - x) / (k - 1.0)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { cout << solve() << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } const int INF = 1 << 29; const int MOD = 1e9 + 7; struct Node { Node *pre, *nxt; int val, pos, len; bool operator<(const Node& rhs) const { if (len != rhs.len) return len > rhs.len; return pos < rhs.pos; } }; const int N = 2e5 + 10; Node pool[N << 1], *last; struct cmp { bool operator()(int u, int v) const { return pool[u] < pool[v]; } }; int main() { int n; scanf( %d , &n); vector<int> a(n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } set<int, cmp> A; last = pool; for (int i = 0, j; i < n; i = j) { for (j = i + 1; j < n && a[j] == a[i]; ++j) ; Node* cur = last++; cur->val = a[i]; cur->pos = i; cur->len = j - i; cur->pre = cur->nxt = nullptr; if (i > 0) { auto pre = last - 2; pre->nxt = cur; cur->pre = pre; } } for (auto it = pool; it != last; ++it) { A.insert(it - pool); } int ret = 0; while (A.size()) { auto it = A.begin(); auto cur = &pool[*it]; auto pre = cur->pre; auto nxt = cur->nxt; if (pre && nxt && pre->val == nxt->val) { cur = last++; cur->val = pre->val; cur->pos = pre->pos; cur->len = pre->len + nxt->len; cur->pre = pre->pre; cur->nxt = nxt->nxt; if (cur->pre) cur->pre->nxt = cur; if (cur->nxt) cur->nxt->pre = cur; A.erase(pre - pool); A.erase(nxt - pool); A.insert(cur - pool); } else { if (pre) pre->nxt = nxt; if (nxt) nxt->pre = pre; } A.erase(it); ++ret; } printf( %d n , ret); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 10; int a[maxn], b[maxn]; int main() { int n; scanf( %d , &n); long long ans = 0; int cnt1 = 0, cnt2 = 0, cnt0 = 0; for (int i = 1; i <= n; i++) { scanf( %d , a + i); if (a[i] <= -1) { ans += -1 - a[i]; cnt1++; } else if (a[i] >= 1) { ans += a[i] - 1; cnt2++; } else { cnt0++; } } if (cnt1 % 2) { if (cnt0) { ans += cnt0; } else { ans += 2; } } else { ans += cnt0; } printf( %lld n , ans); getchar(); getchar(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; int T, n, m, las = 1, ndnum = 1, ans; char s[maxn]; struct node { int ch[26], len, fa; } d[maxn << 1]; int siz[maxn << 1], vis[maxn << 1], timer; int head[maxn << 1], tot; struct edge { int nxt, to; } e[maxn << 1]; void Addedge(int x, int y) { e[++tot] = (edge){head[x], y}; head[x] = tot; } void Insert(int x) { int p = las, np = las = ++ndnum; siz[np] = 1; d[np].len = d[p].len + 1; while (p && !d[p].ch[x]) { d[p].ch[x] = np; p = d[p].fa; } if (!p) { d[np].fa = 1; } else { int q = d[p].ch[x]; if (d[q].len == d[p].len + 1) { d[np].fa = q; } else { int nq = ++ndnum; d[nq] = d[q]; d[nq].len = d[p].len + 1; d[q].fa = d[np].fa = nq; while (p && d[p].ch[x] == q) { d[p].ch[x] = nq; p = d[p].fa; } } } } void dfs(int x) { int id; for (int i = head[x]; i; i = e[i].nxt) { id = e[i].to; dfs(id); siz[x] += siz[id]; } } void go(int &x, int y, int &len) { if (d[x].ch[y]) { ++len; x = d[x].ch[y]; } else { while (x && !d[x].ch[y]) x = d[x].fa; if (!x) { x = 1; len = 0; } else { len = d[x].len + 1; x = d[x].ch[y]; } } } void del(int &x, int &len) { if (len != m) return; --len; if (len == d[d[x].fa].len) x = d[x].fa; } void work(int x, int y) { if (y < m || vis[x] == timer) return; ans += siz[x]; vis[x] = timer; } int main() { scanf( %s , s + 1); n = strlen(s + 1); for (int i = 1; i <= n; ++i) Insert(s[i] - a ); for (int i = 2; i <= ndnum; ++i) Addedge(d[i].fa, i); dfs(1); scanf( %d , &T); int now, len; while (T--) { scanf( %s , s + 1); m = strlen(s + 1); now = 1; len = 0; for (int i = 1; i <= m; ++i) go(now, s[i] - a , len); ++timer; ans = 0; work(now, len); for (int i = 1; i < m; ++i) { del(now, len); go(now, s[i] - a , len); work(now, len); } printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int OO = (int)2e9; const double PI = 2 * acos(0.0); const double EPS = 1e-9; int dcmp(double a, double b) { return fabs(a - b) <= EPS ? 0 : a > b ? 1 : 2; } int DI[] = {-1, 0, 1, 0, 1, -1, -1, 1}; int DJ[] = {0, 1, 0, -1, 1, -1, 1, -1}; void clc1(string x) { int idx = x.find( C ); string r = x.substr(1, idx - 1); string c = x.substr(idx + 1); int cc = atoi(c.c_str()); string ans = ; while (cc) { char d = cc % 26 + A - 1; cc /= 26; if (d == @ ) { d = Z ; cc--; } ans += d; } reverse(ans.begin(), ans.end()); cout << ans << r << endl; } void clc2(string x) { string c = ; cout << R ; for (int i = 0; i < (int)(int)x.size(); i++) { if (isdigit(x[i])) cout << x[i]; else c += x[i]; } cout << C ; int ans = 0; int p = 1; for (int i = (int)c.size() - 1; i >= 0; i--) { ans += (((c[i] - A ) + 1) * p); p *= 26; } cout << ans << endl; } bool f(string x) { if (x[0] != R ) return 0; int r = x.find( C ); if (r == -1) return 0; for (int i = 1; i < r; i++) if (isdigit(x[i])) return 1; return 0; } int main() { int n; cin >> n; for (int i = 0; i < (int)n; i++) { string x; cin >> x; if (f(x)) clc1(x); else clc2(x); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 300; const int mod = 1e9 + 7; const int INF = 0x3f3f3f3f; const double eps = 1e-6; string s; int gx[] = {0, 0, 1, -1}; int gy[] = {1, -1, 0, 0}; bool used[MAX_N][MAX_N]; bool check(int x, int y) { int cnt = 0; for (int i = 0; i < 4; ++i) { int nx = x + gx[i]; int ny = y + gy[i]; if (used[nx][ny]) ++cnt; } return cnt == 1; } bool solve() { cin >> s; int x = 100, y = 100; used[x][y] = true; for (auto &ch : s) { if (ch == U ) ch = ch - U + 3 ; else if (ch == D ) ch = ch - D + 2 ; else if (ch == L ) ch = ch - L + 1 ; else ch = ch - R + 0 ; } for (auto ch : s) { x += gx[ch - 0 ]; y += gy[ch - 0 ]; if (used[x][y]) return false; used[x][y] = true; if (!check(x, y)) return false; } return true; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; while (t--) { if (solve()) cout << OK << n ; else cout << BUG << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; namespace kotespace { template <class T> class duplet { private: public: T x, y; duplet(){}; duplet(T a, T b) : x(a), y(b){}; bool operator<(const duplet P) const { return (x < P.x || (x == P.x && y < P.y)); } bool operator>(const duplet P) const { return (x > P.x || (x == P.x && y > P.y)); } bool operator==(const duplet P) const { return (x == P.x && y == P.y); } bool operator!=(const duplet P) const { return (x != P.x || y != P.y); } void reverse() { std::swap(x, y); } }; template <class P> istream &operator>>(istream &in, duplet<P> &T) { return (in >> T.x >> T.y); } template <class P> ostream &operator<<(ostream &out, duplet<P> T) { return (out << T.x << << T.y); } template <class T> class triplet { private: public: T x, y, z; triplet(){}; triplet(T a, T b, T c) : x(a), y(b), z(c){}; bool operator<(const triplet P) const { return (x < P.x || (x == P.x && y < P.y) || (x == P.x && y == P.y && z < P.z)); } bool operator>(const triplet P) const { return (x > P.x || (x == P.x && y > P.y) || (x == P.x && y == P.y && z > P.z)); } bool operator==(const triplet P) const { return (x == P.x && y == P.y && z == P.z); } bool operator!=(const triplet P) const { return (x != P.x || y != P.y || z != P.z); } void reverse() { std::swap(x, z); } void cycle_right(int a) { if (a == 1) { std::swap(x, y); std::swap(x, z); } if (a == 2) { std::swap(x, z); std::swap(y, x); } } void cycle_left(int a) { if (a == 1) { std::swap(x, z); std::swap(y, x); } if (a == 2) { std::swap(x, y); std::swap(x, z); } } }; template <class P> istream &operator>>(istream &in, triplet<P> &T) { return (in >> T.x >> T.y >> T.z); } template <class P> ostream &operator<<(ostream &out, triplet<P> &T) { return (out << T.x << << T.y << << T.z); } } // namespace kotespace using namespace kotespace; long long inf = 1000 * 1000 * 1000 + 7; long long inf64 = inf * inf; long long mod = 228228227; float START_TIME; namespace std { template <> struct hash<duplet<int>> { size_t operator()(const duplet<int> &k) const { return (size_t)(k.x) * 102931204 + (size_t)(k.y) * 434823123; } }; } // namespace std int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr << fixed << setprecision(8); cout << fixed << setprecision(8); srand(time(0)); START_TIME = clock(); int t; cin >> t; while (t-- > 0) { int n; cin >> n; string s; cin >> s; int balx = 0, baly = 0; map<pair<int, int>, vector<int>> q; long long l = -inf, r = inf; q[make_pair(0, 0)].push_back(0); for (int i = 0; i < n; ++i) { if (s[i] == L ) ++balx; if (s[i] == R ) --balx; if (s[i] == U ) ++baly; if (s[i] == D ) --baly; q[make_pair(balx, baly)].push_back(i + 1); } for (auto &c : q) { for (int i = 0; i + 1 < c.second.size(); ++i) { if (c.second[i + 1] - c.second[i] < r - l) { r = c.second[i + 1]; l = c.second[i]; } } } if (r == inf) cout << -1 << endl; else cout << l + 1 << << r << endl; } cerr << endl << (clock() - START_TIME) / CLOCKS_PER_SEC << sec. << endl; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) template <class T> void chkmax(T &a, T b) { if (a < b) a = b; } template <class T> void chkmin(T &a, T b) { if (a > b) a = b; } const int inf = 0x3f3f3f3f; const long long linf = 2e18 + 100; const double dinf = 2e18 + 100; const double eps = 1e-7; const double pi = 3.14159265358979323846264338327950288L; bool scanld(double &first) { double xx; int f = scanf( %lf , &xx); first = xx; return f > 0; } void printld(const double &first) { printf( %.10lf , fabs(first) < eps ? 0 : (double)first); } inline char nc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } template <class T> void read(T &first) { char c = nc(), b = 1; for (; !((c >= 0 && c <= 9 ) || c == EOF); c = nc()) if (c == - ) b = -b; for (first = 0; c >= 0 && c <= 9 ; first = first * 10 + c - 0 , c = nc()) ; first *= b; } inline void read(char *s) { char c = nc(); int len = 0; for (; c == || c == t || c == n ; c = nc()) ; for (; !(c == || c == t || c == n || c == EOF); s[len++] = c, c = nc()) ; s[len] = 0; } int n, P[100005], len; vector<int> v[100005]; int ds[100005]; void dfs(int k, int pa) { P[k] = pa; for (auto first : v[k]) { if (first == pa) continue; dfs(first, k); } return; } int mx[100005][3], id[100005][3]; void dfs_2(int k, int pa) { mx[k][0] = 1, mx[k][1] = 0, mx[k][2] = 0; id[k][0] = k, id[k][1] = 0, id[k][2] = 0; for (auto first : v[k]) { if (first == pa) continue; dfs_2(first, k); int d = mx[first][0] + 1; if (d > mx[k][2]) mx[k][2] = d, id[k][2] = first; if (mx[k][2] > mx[k][1]) swap(mx[k][1], mx[k][2]), swap(id[k][1], id[k][2]); if (mx[k][1] > mx[k][0]) swap(mx[k][1], mx[k][0]), swap(id[k][1], id[k][0]); } return; } bool ok[100005]; int pmx[100005]; void dfs_3(int k, int pa) { if (!pa) pmx[k] = 0; else { int d = id[pa][0] == k ? mx[pa][1] : mx[pa][0]; chkmax(d, pmx[pa]); pmx[k] = d + 1; } if (mx[k][2] > len || mx[k][1] > len && pmx[k] > len) ok[k] = 1; else ok[k] = 0; for (auto first : v[k]) { if (first == pa) continue; dfs_3(first, k); } return; } int G, st[100005], fs[100005]; int p[100005][17], dp[100005]; void dfs_4(int k, int pa) { dp[k] = dp[pa] + 1; p[k][0] = pa; st[k] = ++G; for (int i = 1; i <= 16; i++) p[k][i] = p[p[k][i - 1]][i - 1]; ds[k] = k; for (auto first : v[k]) { if (first == pa) continue; dfs_4(first, k); if (dp[ds[first]] > dp[ds[k]]) ds[k] = ds[first]; } fs[k] = ++G; return; } int kth_father(int first, int k) { for (int i = 16; i >= 0; i--) if (k & (1 << i)) first = p[first][i]; return first; } bool is_anc(int p, int first) { return st[p] <= st[first] && fs[first] <= fs[p]; } bool chk[100005]; int head, tail; int main() { int T; for (read(T); T--;) { read(n); read(head), read(tail); int first, second; for (int i = 1; i < n; i++) { read(first), read(second); v[first].push_back(second); v[second].push_back(first); } dfs(head, 0); len = 0; int t = tail; while (t != head) { len++; t = P[t]; } dfs_2(head, 0); dfs_3(head, 0); int R = -1; for (int i = 1; i <= n; i++) if (ok[i]) R = i; if (R < 0) puts( NO ); else { dfs_4(R, 0); int dph = dp[head], dpt = dp[tail]; bool yes = is_anc(head, tail) || is_anc(tail, head); if (!yes) { int ch = head, ct = tail; int lca = R; for (int i = 1; i <= n; i++) if (is_anc(i, ch) && is_anc(i, ct) && st[i] > st[lca]) lca = i; int lh = dp[ch] - dp[lca], lt = dp[ct] - dp[lca]; bool fh = 0; while (!yes) { if (fh && chk[ch]) break; if (fh) chk[ch] = 1; if (fh) { ch = ds[ch]; if (dp[ch] - dp[lca] >= len) yes = 1; else { lh = dp[ch] - dp[lca]; ct = kth_father(ct, lt - (len - lh)); lt = dp[ct] - dp[lca]; } } else { ct = ds[ct]; if (dp[ct] - dp[lca] >= len) yes = 1; else { lt = dp[ct] - dp[lca]; ch = kth_father(ch, lh - (len - lt)); lh = dp[ch] - dp[lca]; } } fh ^= 1; } } puts(yes ? YES : NO ); } for (int i = 1; i <= n; i++) v[i].clear(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.); const int MX = 500500; int t, n, i, j, z[MX]; char s[MX]; vector<complex<double> > a, b; vector<int> r, ans; void fft(vector<complex<double> >& a, bool inv) { int n = a.size(); if (n == 1) return; for (int i = 1, rv = 0; i < n; i++) { int j = n / 2; for (; rv >= j; j /= 2) rv -= j; rv += j; if (i < rv) swap(a[i], a[rv]); } for (int l = 2; l <= n; l *= 2) { double alpha = 2 * pi / l; if (inv) alpha = -alpha; for (int i = 0; i < n; i += l) { complex<double> w(1), wn(cos(alpha), sin(alpha)); for (int j = 0; j < l / 2; j++) { complex<double> x = a[i + j]; complex<double> y = w * a[i + j + l / 2]; a[i + j] = x + y; a[i + j + l / 2] = x - y; w *= wn; } } } if (inv) for (int i = 0; i < n; i++) a[i] /= n; } void mul(vector<complex<double> >& a, vector<complex<double> >& b) { int n; for (n = 1; n < a.size() || n < b.size(); n *= 2) ; n *= 2; a.resize(n); b.resize(n); r.resize(n); fft(a, false); fft(b, false); for (int i = 0; i < n; i++) a[i] *= b[i]; fft(a, true); for (int i = 0; i < n; i++) r[i] = int(a[i].real() + 0.5); } int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); scanf( %s , s); a.resize(n); b.resize(n); for (i = 0; i < n; i++) a[i] = int(s[i] == V ); for (i = 0; i < n; i++) b[i] = int(s[n - i - 1] == K ); mul(a, b); for (i = 1; i < n; i++) z[i] = r[n - 1 - i] + r[n - 1 + i]; ans.clear(); for (i = 1; i < n; i++) if (z[i] == 0) { for (j = i + i; j < n; j += i) if (z[j] > 0) break; if (j >= n) ans.push_back(i); } printf( %d n , int(ans.size()) + 1); for (i = 0; i < ans.size(); i++) printf( %d , ans[i]); printf( %d n , n); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000005; int a[N], L[N], tot, R[N], Stack[N], n, m; long long Ans[N]; struct Ask { int l, r, from; } A[N]; inline int cmp1(Ask x, Ask y) { return x.l > y.l; } inline int cmp2(Ask x, Ask y) { return x.r < y.r; } struct segTree { struct Tree { int l, r; long long num, flag; } T[N * 4]; inline void build(int x, int l, int r) { T[x].l = l; T[x].r = r; T[x].flag = T[x].num = 0; if (l == r) return; int mid = (l + r) / 2; build(x * 2, l, mid); build(x * 2 + 1, mid + 1, r); } inline void down(int x) { if (!T[x].flag) return; T[x * 2].num += T[x].flag * (T[x * 2].r - T[x * 2].l + 1); T[x * 2 + 1].num += T[x].flag * (T[x * 2 + 1].r - T[x * 2 + 1].l + 1); T[x * 2].flag += T[x].flag; T[x * 2 + 1].flag += T[x].flag; T[x].flag = 0; } inline void insert(int x, int l, int r, int z) { if (T[x].l > r || l > T[x].r) return; if (T[x].l >= l && T[x].r <= r) { T[x].num += z * (T[x].r - T[x].l + 1); T[x].flag += z; return; } down(x); insert(x * 2, l, r, z); insert(x * 2 + 1, l, r, z); T[x].num = T[x * 2].num + T[x * 2 + 1].num; } inline long long find(int x, int y) { if (T[x].l == T[x].r) return T[x].num; down(x); int mid = (T[x].l + T[x].r) / 2; if (y <= mid) return find(x * 2, y); return find(x * 2 + 1, y); } } T1, T2; signed main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) A[i].from = i; for (int i = 1; i <= m; i++) scanf( %d , &A[i].l); for (int i = 1; i <= m; i++) scanf( %d , &A[i].r); for (int i = 1; i <= m; i++) Ans[i] = A[i].r - A[i].l + 1; a[0] = a[n + 1] = n + 1; Stack[++tot] = 0; for (int i = 1; i <= n; i++) { while (a[i] > a[Stack[tot]]) tot--; L[i] = Stack[tot] + 1; Stack[++tot] = i; } Stack[tot = 1] = n + 1; for (int i = n; i; i--) { while (a[i] > a[Stack[tot]]) tot--; R[i] = Stack[tot] - 1; Stack[++tot] = i; } T1.build(1, 1, n); T2.build(1, 1, n); sort(A + 1, A + m + 1, cmp2); for (int i = 1, j = 1; i <= n; i++) { T1.insert(1, 1, L[i] - 1, -L[i]); T2.insert(1, L[i], i, -1); while (j <= m && A[j].r == i) { Ans[A[j].from] += T1.find(1, A[j].l) + (long long)T2.find(1, A[j].l) * A[j].l; j++; } } T1.build(1, 1, n); T2.build(1, 1, n); sort(A + 1, A + m + 1, cmp1); for (int i = n, j = 1; i; i--) { T1.insert(1, R[i] + 1, n, R[i]); T2.insert(1, i, R[i], 1); while (j <= m && A[j].l == i) { Ans[A[j].from] += T1.find(1, A[j].r) + (long long)T2.find(1, A[j].r) * A[j].r; j++; } } for (int i = 1; i <= m; i++) printf( %lld , Ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int maxn = (1 << 18) - 1; int main() { int k; scanf( %d , &k); int b = maxn, cnt = 0; for (int i = 0; i <= 20; ++i) { if ((k >> i) & 1) { b ^= (1 << i); } } int cc = maxn >> 1; printf( %d %d n , 3, 3); printf( %d %d %d n , maxn, maxn, b); printf( %d %d% d n , maxn, cc, maxn); printf( %d %d %d n , b, maxn, cc); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, q; cin >> n >> q; bool lava[2][n]; for (int i = 0; i < 2; i++) { for (int j = 0; j < n; j++) lava[i][j] = false; } set<int> blocked1; set<int> blocked2; for (int i = 0; i < q; i++) { int r, c; cin >> r >> c; r--; c--; if (lava[r][c]) { blocked2.erase(c); if (c < n - 1 && !lava[r][c + 1]) { blocked1.erase(c); } if (c > 0 && !lava[r][c - 1]) { blocked1.erase(c - 1); } } else { if (lava[(r + 1) % 2][c]) { blocked2.insert(c); } if (c < n - 1 && lava[(r + 1) % 2][c + 1]) { blocked1.insert(c); } if (c > 0 && lava[(r + 1) % 2][c - 1]) { blocked1.insert(c - 1); } } lava[r][c] = !lava[r][c]; if (blocked1.empty() && blocked2.empty() && !lava[0][0] && !lava[1][n - 1]) { cout << Yes << endl; } else { cout << No << endl; } } }
|
#include <bits/stdc++.h> const long long maxn = 8e9 + 5; long long v[10000000]; long long k[10000000]; long long n, sum; int judge(long long m) { long long i, sum1 = sum; for (i = 0; i < n; i++) { if (m * v[i] > k[i]) { if (k[i] + sum1 < m * v[i]) break; else if (k[i] + sum1 >= m * v[i]) sum1 = sum1 + k[i] - m * v[i]; } } if (i < n) return 0; else return 1; } int main() { long long l, r, mid; scanf( %I64d%I64d , &n, &sum); for (long long i = 0; i < n; i++) { scanf( %I64d , &v[i]); } for (long long i = 0; i < n; i++) { scanf( %I64d , &k[i]); } l = 0; r = maxn; while (l + 1 < r) { mid = l + (r - l) / 2; if (judge(mid)) { l = mid; } else r = mid; } if (judge(l + 1)) printf( %I64d , l + 1); else printf( %I64d , l); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> g(n + 1); for (int i = 0; i < n; i++) { int u; cin >> u; g[i + 1] = u; } for (int i = 1; i <= n; i++) { if (g[g[g[i]]] == i) { cout << YES ; return 0; } } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; const int maxn = 100010; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; double l, v1, v2; cin >> n >> l >> v1 >> v2 >> k; int t = (n + k - 1) / k; if (t == 1) { cout.precision(17); cout << fixed << l / v2 << n ; } else { double y = l * (1 + v2 / v1) / (2.0 * t - 1 + v2 / v1); double x = l - y; double a = y / v2 + x / v1; cout.precision(17); cout << fixed << a << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long MOD(string s, long long c) { long long ans = 0, p = 1; for (int i = (((int)s.size()) - 1); i >= (0); i--) { ans = (ans + (s[i] - 0 ) * p) % c; p *= 10; p %= c; } return ans; } long long mod(long long a, long long b, long long c) { long long ans = 1; while (b) { if (b % 2) ans = ans * a % c; a = a * a % c; b /= 2; } return ans; } long long solve(long long a, string b, long long c) { long long ans = 1; for (int i = (((int)b.size()) - 1); i >= (0); i--) { ans = ans * mod(a, (b[i] - 0 ), c) % c; a = mod(a, 10, c); } return ans; } string dec(string s) { for (int i = (((int)s.size()) - 1); i >= (0); i--) { if (s[i] != 0 ) { s[i]--; break; } else { s[i] = 9 ; } } return s; } int main() { string bb, n; long long c; cin >> bb >> n >> c; long long b = MOD(bb, c); long long ans = (b - 1 + c) * solve(b, dec(n), c) % c; if (ans == 0) ans = c; cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const double INF = 1e18; const int MAX_N = 100100; const int IT = 100; const double PI = acos(-1.0); int x[MAX_N]; int y[MAX_N]; long long dist(int a, int b) { long long dx = x[a] - x[b]; long long dy = y[a] - y[b]; return dx * dx + dy * dy; } double dist1(double xx, double yy) { xx -= x[0]; yy -= y[0]; return xx * xx + yy * yy; } double fun(int a, int b) { double l = 0.0, r = 1.0; for (int i = 0; i < IT; i++) { double ml = l + (r - l) / 3.0; double mr = r - (r - l) / 3.0; double x1 = x[a] * ml + (1.0 - ml) * x[b]; double y1 = y[a] * ml + (1.0 - ml) * y[b]; double x2 = x[a] * mr + (1.0 - mr) * x[b]; double y2 = y[a] * mr + (1.0 - mr) * y[b]; if (dist1(x1, y1) > dist1(x2, y2)) { l = ml; } else { r = mr; } } double xx = x[a] * l + (1.0 - l) * x[b]; double yy = y[a] * l + (1.0 - l) * y[b]; return dist1(xx, yy); } void solve() { int n; scanf( %d%d%d , &n, &x[0], &y[0]); for (int i = 1; i <= n; i++) { scanf( %d%d , &x[i], &y[i]); } double mn = INF; double mx = 0; for (int i = 1; i <= n; i++) { int j = (i == n ? 1 : i + 1); mx = max(mx, (double)dist(0, i)); mx = max(mx, (double)dist(0, i)); mn = min(mn, fun(i, j)); } double answer = PI * (mx - mn); printf( %.18lf n , answer); } int main() { int cases; cases = 1; for (int i = 0; i < cases; i++) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> a(n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a.begin(), a.end()); for (auto i : a) { if (i != a[0]) { printf( %d , i); return 0; } } printf( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[20]; long long b[20][10][10]; long long c[20][10][10]; long long dp(long long n, int p) { long long n0 = n; long long ans = 0; while (n >= 10) { long long m = n; long long e = 0; while ((m + 10) % (a[e] * 10) < 10) e++; if (e == 1 || a[e] >= n) { long long m = n; int k = 0; while (m != 0) { if (m % 10 >= k) k = m % 10; m = m / 10; } ans += 1; if (p < k) n -= k; else n -= p; continue; } int i = 0; int k = 0; for (i; m != 0; i++) { if (i >= e && m % 10 >= k) k = m % 10; m = m / 10; } if (k < p) k = p; if (b[e][(n + 10) % a[e]][k] == -1) { dp(n % a[e], k); } ans += b[e][(n + 10) % a[e]][k]; n = n / a[e] * a[e] + c[e][(n + 10) % a[e]][k]; } long long e = 0; while ((n0 + 10) % (a[e] * 10) < 10) e++; if (a[e] > n0) { b[e][(n0 + 10) % a[e]][p] = ans; c[e][(n0 + 10) % a[e]][p] = n; } return ans; } int main() { a[0] = 1; for (int i = 1; i <= 18; i++) a[i] = a[i - 1] * 10; for (int i = 0; i < 20; i++) for (int j = 0; j < 10; j++) for (int k = 0; k < 10; k++) { b[i][j][k] = -1; c[i][j][k] = -1; } long long n; cin >> n; if (n == 0) { cout << 0 << endl; return 0; } cout << dp(n, 0) + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int dp[maxn], ans; const int inf = 1e9; int a1, a2, adfds, fd; vector<int> edge[maxn]; int n, m, d, num[maxn], fuck; void dfs1(int u, int fa) { int i; for (i = 0; i < (int)edge[u].size(); i++) { int v = edge[u][i]; if (v == fa) continue; dfs1(v, u); dp[u] = max(dp[u], dp[v] + 1); } if (num[u]) dp[u] = max(dp[u], 0); } void dfs2(int u, int fa, int fv) { int flag = 0, i, j, k; if (fv + 1 > d) flag = 1; int l1 = -inf, id1 = 0, l2 = -inf, id2 = 0; for (i = 0; i < (int)edge[u].size(); i++) { int v = edge[u][i]; if (v == fa) continue; if (dp[v] + 1 > d) flag = 1; if (dp[v] >= l1) { l2 = l1, id2 = id1; l1 = dp[v], id1 = v; } else if (dp[v] > l2) { l2 = dp[v], id2 = v; } } if (!flag) ans++; for (i = 0; i < (int)edge[u].size(); i++) { int v = edge[u][i]; if (v == fa) continue; int fvv = fv; if (v == id1) fvv = max(fvv, l2); else fvv = max(fvv, l1); if (num[u]) fvv = max(fvv, -1); dfs2(v, u, fvv + 1); } } int main() { int i, j, k, a, b, c; ans = 0; scanf( %d%d%d , &n, &m, &d); for (i = 0; i <= n; i++) { dp[i] = -inf; edge[i].clear(); } for (i = 1; i <= m; i++) { scanf( %d , &a); num[a] = 1; } for (i = 1; i < n; i++) { scanf( %d%d , &a, &b); edge[a].push_back(b); edge[b].push_back(a); } dfs1(1, 0); dfs2(1, 0, -inf); printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const double eps = 1e-9; int n, t; char A[N], B[N]; int main() { scanf( %d %d n , &n, &t); gets(A); gets(B); int sameCnt = 0; for (int i = 0; i < n; ++i) { if (A[i] == B[i]) ++sameCnt; } int dif = n - sameCnt; if (dif / 2 + dif % 2 <= t) { int wic = 0; int have = 0; t -= dif / 2 + dif % 2; have = dif % 2; if (t > sameCnt) { have += 2 * (t - sameCnt); t = sameCnt; } if (n == 1000) { } for (int i = 0; i < n; ++i) { if (have && A[i] != B[i]) { char tempval = a ; for (int j = 0; j < 26; ++j) { if (tempval + j != A[i] && tempval + j != B[i]) { printf( %c , tempval + j); break; } } have--; continue; } if (A[i] != B[i]) { if (wic) printf( %c , A[i]); else printf( %c , B[i]); wic = 1 - wic; continue; } if (t > 0 && A[i] == B[i]) { t--; char temp = A[i] + 1; if (A[i] == z ) temp = y ; printf( %c , temp); } else { printf( %c , A[i]); } } printf( n ); } else { cout << -1 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int c=200002, k=20; int n, q, p[c], szint[c], fel[c][k], f[c], db[c]; long long aa[c], bb[c], dist[c], val[c], sum; bool v[c]; set<int> s; int lca(int a, int b) { if (szint[a]<szint[b]) { swap(a, b); } for (int i=k-1; i>=0; i--) { if (szint[fel[a][i]]>=szint[b]) { a=fel[a][i]; } } if (a==b) { return a; } for (int i=k-1; i>=0; i--) { if (fel[a][i]!=fel[b][i]) { a=fel[a][i], b=fel[b][i]; } } return f[a]; } long long tav(int a, int b) { int koz=lca(a, b); return dist[a]+dist[b]-2*dist[koz]; } void keres(int a, int &l, int &r) { auto it=s.find(a); --it; l=*it; ++it, ++it; if (it!=s.end()) { r=*it; } } void add(int a) { s.insert(a); int l=0, r=0; keres(a, l, r); sum+=tav(l, a)+tav(a, r)-tav(l, r); } void cl(int a) { int l=0, r=0; keres(a, l, r); sum-=tav(l, a)+tav(a, r)-tav(l, r); s.erase(a); } int main() { ios_base::sync_with_stdio(false); cin >> n >> q; p[0]=n+1; for (int i=1; i<=n; i++) { cin >> p[i]; f[i]=i-1; while (p[i]>p[f[i]]) { f[i]=f[f[i]]; } szint[i]=szint[f[i]]+1; fel[i][0]=f[i]; for (int j=1; j<k; j++) { fel[i][j]=fel[fel[i][j-1]][j-1]; } } for (int i=1; i<=n; i++) { cin >> aa[i]; val[i]+=aa[i]; } for (int i=1; i<=n; i++) { cin >> bb[i]; val[i]-=bb[i]; val[f[i]]+=bb[i]; } for (int i=n; i>=1; i--) { if (val[i]<0) { val[f[i]]+=val[i]; val[i]=0; } } for (int i=1; i<=n; i++) { dist[i]=dist[f[i]]+val[i]; } db[0]=1; s.insert(0); for (int i=1; i<=q; i++) { int x; cin >> x; if (!v[x]) { v[x]=1; if (++db[f[x]]==1) { add(f[x]); } } else { v[x]=0; if (--db[f[x]]==0) { cl(f[x]); } } cout << sum/2+val[0] << n ; } return 0; }
|
#include <bits/stdc++.h> int main(void) { static unsigned char mas[125 * 1000000], mas1[125 * 1000000]; int n, m, mas2[200000], x, rez = 0, last1 = 0, last2 = 1; scanf( %d %d , &n, &m); for (int i = 0; i < ceil(m / 8.0); i++) { mas[i] = 0; mas1[i] = 0; } int samechet = 0, samenechet = 0, dif = 0; for (int i = 0; i < n; i++) { scanf( %d , &x); mas2[i] = x; if (x & 1) { dif++; } else { dif--; } if (mas[(x - 1) >> 3] & (1 << ((x - 1) & 7))) { mas1[(x - 1) >> 3] |= 1 << ((x - 1) & 7); if (x & 1) { samenechet++; } else { samechet++; } } else { mas[(x - 1) >> 3] |= 1 << ((x - 1) & 7); } } for (int j = 0; j < n; j++) { x = mas2[j]; if (x & 1) { if (mas1[(x - 1) >> 3] & (1 << ((x - 1) & 7))) { if (mas[(x - 1) >> 3] & (1 << ((x - 1) & 7))) { mas[(x - 1) >> 3] -= (1 << ((x - 1) & 7)); } else { if (dif > 0) { for (int i = last2; i < m; i += 2) { if (!(mas[i >> 3] & (1 << (i & 7))) && !(mas1[i >> 3] & (1 << (i & 7)))) { mas[i >> 3] |= 1 << (i & 7); mas2[j] = i + 1; rez++; break; } if (i + 2 >= m) { printf( -1 ); return 0; } last2 += 2; } dif -= 2; } else { for (int i = last1; i < m; i += 2) { if (!(mas[i >> 3] & (1 << (i & 7))) && !(mas1[i >> 3] & (1 << (i & 7)))) { mas[i >> 3] |= 1 << (i & 7); mas2[j] = i + 1; rez++; break; } if (i + 2 >= m) { printf( -1 ); return 0; } last1 += 2; } } samenechet--; } } else { if (dif / 2 > samenechet) { for (int i = last2; i < m; i += 2) { if (!(mas[i >> 3] & (1 << (i & 7))) && !(mas1[i >> 3] & (1 << (i & 7)))) { mas[i >> 3] |= 1 << (i & 7); mas2[j] = i + 1; rez++; break; } if (i + 2 >= m) { printf( -1 ); return 0; } last2 += 2; } dif -= 2; } } } else { if (mas1[(x - 1) >> 3] & (1 << ((x - 1) & 7))) { if (mas[(x - 1) >> 3] & (1 << ((x - 1) & 7))) { mas[(x - 1) >> 3] -= (1 << ((x - 1) & 7)); } else { if (dif < 0) { for (int i = last1; i < m; i += 2) { if (!(mas[i >> 3] & (1 << (i & 7))) && !(mas1[i >> 3] & (1 << (i & 7)))) { mas[i >> 3] |= 1 << (i & 7); mas2[j] = i + 1; rez++; break; } if (i + 2 >= m) { printf( -1 ); return 0; } last1 += 2; } dif += 2; } else { for (int i = last2; i < m; i += 2) { if (!(mas[i >> 3] & (1 << (i & 7))) && !(mas1[i >> 3] & (1 << (i & 7)))) { mas[i >> 3] |= 1 << (i & 7); mas2[j] = i + 1; rez++; break; } if (i + 2 >= m) { printf( -1 ); return 0; } last2 += 2; } } samechet--; } } else { if (dif / 2 < -samechet) { for (int i = last1; i < m; i += 2) { if (!(mas[i >> 3] & (1 << (i & 7))) && !(mas1[i >> 3] & (1 << (i & 7)))) { mas[i >> 3] |= 1 << (i & 7); mas2[j] = i + 1; rez++; break; } if (i + 2 >= m) { printf( -1 ); return 0; } last1 += 2; } dif += 2; } } } } printf( %d n , rez); for (int i = 0; i < n; i++) { printf( %d , mas2[i]); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 400005; map<int, int> H; int n, m, p, l, r, s, tot, T, a[N], b[N], c[N], ans[N]; int get() { int v; scanf( %d , &v); if (!H[v]) H[v] = ++tot; return H[v]; } void add(int x) { if (c[x]++ < 0) --s; else ++s; } void del(int x) { if (c[x]-- > 0) --s; else ++s; } int main() { scanf( %d%d%d , &n, &m, &p); for (int i = 0; i < n; ++i) a[i] = get(); for (int i = 0; i < m; ++i) b[i] = get(), --c[b[i]]; for (int i = 0; i < p; ++i) { l = i, r = i, s = m; for (int j = 0; j < m - 1; ++j) { add(a[r]), r += p; if (r >= n) break; } while (r <= n) { add(a[r]), r += p; if (!s) ans[T++] = l; del(a[l]), l += p; } while (l <= n) del(a[l]), l += p; } printf( %d n , T); sort(ans, ans + T); for (int i = 0; i < T; ++i) printf( %d , ans[i] + 1); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e9; struct comparator { bool operator()(const pair<int, int> &a, const pair<int, int> &b) { return a.first > b.first; } } cmp; int main() { char in; vector<pair<int, int> > white, black; int board[8][8]; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { board[i][j] = 0; } } for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> in; if (in == W ) { white.push_back(pair<int, int>(i, j)); board[i][j] = 1; } if (in == B ) { black.push_back(pair<int, int>(i, j)); board[i][j] = 2; } } } sort(white.begin(), white.end()); sort(black.begin(), black.end(), cmp); int i = 0, j = 0, x; if (white[i].first == 0) { cout << A << endl; return 0; } int pos_A = white[i].first; int pos_B = black[j].first; if (pos_A - 1 == 0 && board[pos_A - 1][white[i].second] == 0) { cout << A << endl; return 0; } while (pos_A != 0) { pos_A--; if (board[pos_A][white[i].second] != 0) { i++; pos_A = white[i].first; continue; } } while (pos_B != 7) { pos_B++; if (board[pos_B][black[j].second] != 0) { j++; pos_B = black[j].first; continue; } } pos_A = white[i].first; pos_B = black[j].first; if (pos_A - (7 - pos_B) <= 0) { cout << A << endl; } else { cout << B << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, k, n; string s, s1, b; cin >> n >> k >> s; b = s; for (i = k; i < n; i++) b[i] = b[i - k]; if (b >= s) cout << n << endl << b << endl; else { for (i = k - 1; i >= 0; i--) { if (b[i] == 9 ) b[i] = 0 ; else { b[i]++; break; } } for (i = k; i < n; i++) b[i] = b[i - k]; cout << n << endl << b << endl; } }
|
#include <bits/stdc++.h> using namespace std; bool cmp(int u, int y) { return u > y; } int main() { int i, j; int n, m, x; int a[100009], b[100009]; int cnt; while (scanf( %d %d , &n, &x) != EOF) { for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n, cmp); for (i = 0; i < n; i++) scanf( %d , &b[i]); sort(b, b + n); cnt = 0; int k = 0; for (i = 0; i < n; i++) { for (j = k; j < n; j++) { if (a[i] != -0x3fffffff && b[j] != -0x3fffffff) { if (a[i] + b[j] >= x) { a[i] = -0x3fffffff; b[j] = -0x3fffffff; cnt++; k = j; break; } } } } printf( 1 %d n , cnt); } }
|
#include <bits/stdc++.h> using namespace std; int find(string s, string sub, int begin, int end) { for (int i = begin; i < end - 1; i++) if (s[i] == sub[0] && s[i + 1] == sub[1]) return i; return -1; } int main() { string s, sub; cin >> s; int size = s.size(); int index1, index2, index3, index4; index1 = find(s, AB , 0, size); index2 = find(s, BA , 0, size); index3 = find(s, BA , index1 + 2, size); index4 = find(s, AB , index2 + 2, size); if ((index1 + 1 && index3 + 1) || (index2 + 1 && index4 + 1)) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); std::ios::sync_with_stdio(false); string a; cin >> a; for (int i = 0; i < a.size(); i++) { if (((int)(a[i]) >= 48 && (int)(a[i]) <= 57) || ((int)(a[i]) >= 97 && (int)(a[i]) <= 122) || (int)(a[i]) == 95 || (int)(a[i]) == 64 || (int)(a[i]) == 46 || (int)(a[i]) == 47 || ((int)(a[i]) >= 65 && (int)(a[i]) <= 90)) { continue; } else { cout << NO ; return 0; } } string d = ; int ans1 = -1; for (int i = 0; i < a.size(); i++) { if (a[i] == @ ) { ans1 = i; break; } d += a[i]; } if (ans1 == 0 || ans1 == -1) { cout << NO ; return 0; } for (int i = 0; i < d.size(); i++) { if (d[i] == . || d[i] == / ) { cout << NO ; return 0; } } string e = ; int ans2 = -1; for (int i = ans1 + 1; i < a.size(); i++) { if (a[i] == / ) { ans2 = i; break; } e += a[i]; } if (e.size() == 0) { cout << NO ; return 0; } if (ans2 - ans1 == 1) { cout << NO ; return 0; } int ans3 = 0; for (int i = 0; i < e.size(); i++) { if (e[i] == @ ) { cout << NO ; return 0; } if (e[i] == . ) { ans3++; } } if (e[e.size() - 1] == . || e[0] == . ) { cout << NO ; return 0; } for (int i = 0; i < e.size() - 1; i++) { if (e[i] == . && e[i + 1] == . ) { cout << NO ; return 0; } } if (ans2 == -1) { cout << YES ; return 0; } string r = ; for (int i = ans2 + 1; i < a.size(); i++) { if (a[i] == / || a[i] == . || a[i] == @ ) { cout << NO ; return 0; } } if (ans2 == a.size() - 1) { cout << NO ; return 0; } cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int M = 1e9 + 7; void madd(int& a, int b) { a += b; if (a >= M) a -= M; } int mult(int a, int b) { return (1LL * a * b) % M; } int modexp(int a, int b) { int res = 1; while (b > 0) { if (b & 1) res = mult(res, a); a = mult(a, a); b >>= 1; } return res; } int inverse(int x) { return modexp(x, M - 2); } const int maxn = 1e5 + 5; int n, a[maxn]; int cnt[maxn]; int mu[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; cnt[a[i]]++; } mu[1] = 1; for (int i = 1; i < maxn; i++) { for (int j = 2 * i; j < maxn; j += i) { mu[j] -= mu[i]; cnt[i] += cnt[j]; } } int ans = 0; for (int d = 1; d <= 100000; d++) { madd(ans, mult((mu[d] + M) % M, modexp(2, cnt[d]) - 1)); } cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int x, d, nxt = 1, arr[10001] = {0}, pos = 0; cin >> x >> d; for (int j = 30; j >= 0; j--) if (x >= (((long long int)1 << j))) { x -= ((long long int)1 << j); for (int i = 1; i <= j; i++) arr[pos++] = nxt; nxt += d; arr[pos++] = nxt; nxt += d; } if (x == 0) { cout << pos << endl; for (int j = 0; j < pos; j++) cout << arr[j] << ; cout << endl; } else cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Edge { int v, f; Edge *next, *rest; }; int n, m, b, x[100], k[100], p[100]; long long dp[1048576]; long long ans = 0x3FFFFFFFFFFFFFFFLL; int main() { scanf( %d%d%d , &n, &m, &b); for (int i = 0, len; i < n; i++) { scanf( %d%d%d , &x[i], &k[i], &len); for (int j = 0, t; j < len; j++) scanf( %d , &t), p[i] |= 1 << (t - 1); p[i] ^= (1 << m) - 1; } for (int i = 0; i < n; i++) { for (int j = n - 1; j > i; j--) { if (k[j - 1] > k[j]) swap(k[j - 1], k[j]), swap(x[j - 1], x[j]), swap(p[j - 1], p[j]); } } for (int i = 1; i < 1 << m; i++) dp[i] = 0x3FFFFFFFFFFFFFFFLL; for (int i = 0; i < n; i++) { for (int j = 0; j < 1 << m; j++) dp[j] = min(dp[j], dp[j & p[i]] + x[i]); if (dp[(1 << m) - 1] < 0x3FFFFFFFFFFFFFFFLL) ans = min(ans, dp[(1 << m) - 1] + (long long)k[i] * b); } printf( %I64d , ans == 0x3FFFFFFFFFFFFFFFLL ? -1 : ans); getchar(); getchar(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int a[300005] = {0}; int c1 = 0, c2 = 0, p1 = 0, p2 = 0; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; int maxn = -1; for (int i = 1; i <= n; i++) { if (c1 == 0) { p1 = i; c1 = a[i]; } else if (c2 == 0 && a[i] != c1) { p2 = i; c2 = a[i]; maxn = max(maxn, p2 - p1); } else if (a[i] == c1 && p2 != 0) { maxn = max(maxn, i - p2); } else if (a[i] == c2) { maxn = max(maxn, i - p1); } else if (a[i] != c1 && a[i] != c2) { maxn = max(maxn, i - p1); } } cout << maxn << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } template <class T> inline bool read(T &x) { int c = getchar(); int sgn = 1; while (~c && c < 0 || c > 9 ) { if (c == - ) sgn = -1; c = getchar(); } for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; x *= sgn; return ~c; } const int INF = 2000000009; const int MX = 200005; const double EPS = 1e-9; const int MOD = 1000000007; long long a[MX]; vector<long long> sq, nsq; int n, p, q; long long solve1() { vector<long long> cost; for (int i = 0; i < q; i++) { long long t = sqrt(nsq[i]); cost.push_back(min(nsq[i] - t * t, (t + 1) * (t + 1) - nsq[i])); } sort(cost.begin(), cost.end()); long long ret = 0; int t = (n / 2) - p; for (int i = 0; i < t; i++) ret += cost[i]; return ret; } long long solve2() { long long ret = 0; vector<long long> cost; for (int i = 0; i < p; i++) { if (sq[i] == 0) cost.push_back(2LL); else cost.push_back(1LL); } sort(cost.begin(), cost.end()); int t = (n / 2) - q; for (int i = 0; i < t; i++) ret += cost[i]; return ret; } int main() { n = ({ int a; read(a); a; }); for (int i = 0; i < n; i++) { a[i] = ({ long long a; read(a); a; }); long long t = sqrt(a[i]); if (t * t == a[i]) sq.push_back(a[i]); else nsq.push_back(a[i]); } p = (int)sq.size(); q = (int)nsq.size(); if (p == q) { printf( 0 n ); return 0; } if (q > p) { printf( %lld n , solve1()); } else { printf( %lld n , solve2()); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<int> E[200020], V; int dis[2][200020]; void solve() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= k; i++) { int x; scanf( %d , &x); V.push_back(x); } for (int i = 0; i < (m); i++) { int x, y; scanf( %d%d , &x, &y); E[x].push_back(y); E[y].push_back(x); } for (int v = 0; v < (2); v++) { int st = (v == 0 ? 1 : n); vector<int> q; auto D = dis[v]; for (int i = 1; i <= n; i++) D[i] = -1; D[st] = 0; q.push_back(st); for (int i = 0; i < ((int)(q).size()); i++) { int t = q[i]; for (int e : E[t]) if (D[e] == -1) { D[e] = D[t] + 1; q.push_back(e); } } } sort((V).begin(), (V).end(), [&](int x, int y) { return dis[0][x] > dis[0][y]; }); int mx = -1e9, ans = 0; for (int i = 0; i + 1 < (int)(V).size(); i++) { if (dis[0][V[i]] == dis[0][V[i + 1]]) { printf( %d n , dis[0][n]); return; } } for (int i = 0; i < ((int)(V).size()); i++) { int u = V[i]; int val = min({dis[0][n], dis[0][u] + dis[1][u], dis[0][u] + 1 + mx}); ans = max(ans, val); mx = max(mx, dis[1][u]); } printf( %d n , ans); } int main() { int T = 1; for (int t = 1; t <= T; t++) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline bool isPowerOfTwo(int x) { return (x != 0 && (x & (x - 1)) == 0); } double pi = 3.141592653589793238462643; int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; inline int add(int a, int b, int m = 1000000007) { a += b; if (a >= m) a -= m; return a; } inline int mul(int a, int b, int m = 1000000007) { return (int)(((long long)a * (long long)b) % m); } inline bool ispalin(string &str) { int n = str.length(); for (int i = 0; i < n / 2; i++) if (str[i] != str[n - i - 1]) return false; return true; } long long expo(long long base, long long pow) { long long ans = 1; while (pow != 0) { if (pow & 1 == 1) { ans = ans * base; ans = ans % 1000000007; } base *= base; base %= 1000000007; pow /= 2; } return ans; } void swapp(int *a, int *b) { int temp = *a; *a = *b; *b = temp; } long long invt(long long x) { return expo(x, 1000000007 - 2); } int expFactor(int n, int p) { int x = p; int exponent = 0; while ((n / x) > 0) { exponent += n / x; x *= p; } return exponent; } inline int countsetbit(int n) { unsigned int count = 0; while (n) { n &= (n - 1); count++; } return count; } inline int abs(int x) { if (x < 0) return -x; return x; } bool isPal(string ss) { int len = ss.length(); for (int i = 0; i < len / 2; i++) { int comp = len - i - 1; if (ss[i] != ss[comp]) return false; } return true; } vector<long long> fact, inv; void calfal(int maxn) { fact.resize(maxn); inv.resize(maxn); fact[0] = inv[0] = inv[1] = 1; for (int i = (1); i <= (maxn - 1); ++i) fact[i] = i * fact[i - 1] % 1000000007; for (int i = (2); i <= (maxn - 1); ++i) inv[i] = (1000000007 - 1000000007 / i) * inv[1000000007 % i] % 1000000007; for (int i = (1); i <= (maxn - 1); ++i) inv[i] = inv[i] * inv[i - 1] % 1000000007; } long long ncr(int n, int r) { if (r > n) return 0; return (fact[n] * inv[r] % 1000000007) * inv[n - r] % 1000000007; } long long _sieve_size; bitset<10000010> bs; vector<int> primes; void sieve(long long upperbound) { _sieve_size = upperbound + 1; bs.set(); bs[0] = bs[1] = 0; for (long long i = 2; i <= _sieve_size; i++) if (bs[i]) { for (long long j = i * i; j <= _sieve_size; j += i) bs[j] = 0; primes.push_back((int)i); } } bool isPrime(long long N) { if (N <= _sieve_size) return bs[N]; for (int i = 0; i < (int)primes.size(); i++) if (N % primes[i] == 0) return false; return true; } double dpw[1001][1001][2], dpl1[1001][1001][2], dp[1001][1001][2]; int w, b; double fun(int turn, int ww, int bb) { if (ww >= w) { return 0; } if (bb > b) { return 0; } if (turn == 1 && bb >= b) { return 0; } if (dp[ww][bb][turn] != -1) { return dp[ww][bb][turn]; } if (turn) { double x, y; x = (w - ww) * 1.0 / (b - bb - 1 + w - ww); y = ((b - bb - 1) * 1.0 / (b - bb - 1 + w - ww)); if (bb == b - 1) { y = 0; } dp[ww][bb][turn] = (y * fun((turn + 1) % 2, ww, bb + 2) + x * fun((turn + 1) % 2, ww + 1, bb + 1)) * ((b - bb) * 1.0 / (b - bb + w - ww)); } else { dp[ww][bb][turn] = (w - ww) * 1.0 / (b - bb + w - ww) + fun((turn + 1) % 2, ww, bb + 1) * ((b - bb) * 1.0 / (b - bb + w - ww)); } return dp[ww][bb][turn]; } int main() { cin >> w >> b; if (!w) { cout << 0 << endl; return 0; } for (int i = (0); i <= (1); ++i) { for (int j = (0); j <= (w + 1); ++j) { for (int k = (0); k <= (b + 1); ++k) { dp[j][k][i] = -1; } } } printf( %.10f , fun(0, 0, 0)); }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int n; int b[MAXN]; set<pair<int, int>, greater<pair<int, int> > > s; int ans[MAXN]; int main() { scanf( %d , &n); for (auto i = 0; i != n; i++) scanf( %d , &b[i]); for (auto i = 0; i != n; i++) { int j = (i + 1) % n; int delta = abs(n - b[i] - b[j]); s.insert(make_pair(delta, i)); } int l = 0, r = n - 1; while (!s.empty()) { int pos = s.begin()->second; s.erase(s.begin()); int j = (pos + 1) % n; if (n - b[pos] > b[j]) { ans[pos] = l++; } else { ans[pos] = r--; } } for (auto i = 0; i != n; i++) printf( %d , ans[i]); }
|
#include <bits/stdc++.h> using namespace std; int main() { int N = 0; cin >> N; for (int i = 0; i < N; i++) { int length, height; cin >> length >> height; int pixL, pixH; cin >> pixL >> pixH; int ans = max(max(height - pixH - 1, pixH) * length, max(length - pixL - 1, pixL) * height); cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > p, pt; int n, m; void getanswer(int l, int r) { if (l >= r) return; getanswer(l, (l + r) / 2); getanswer(1 + ((l + r) / 2), r); for (int i = int(l); i <= int(r); ++i) { m++; pt.push_back(make_pair(p[(l + r) / 2].first, p[i].second)); } } int main() { scanf( %I32d , &n); p.resize(n); pt.resize(n); for (int i = 0; i < int(n); i++) scanf( %I32d%I32d , &p[i].first, &p[i].second); stable_sort(p.begin(), p.end()); for (int i = 0; i < int(n); i++) pt[i] = p[i]; m = n; getanswer(0, n - 1); stable_sort(pt.begin(), pt.end()); p.clear(); for (int i = 0; i < int(m); i++) if ((i == 0) || (pt[i] != pt[i - 1])) p.push_back(pt[i]); printf( %I32d n , (int)p.size()); for (int i = 0; i < int(p.size()); i++) printf( %I32d %I32d n , p[i].first, p[i].second); return 0; }
|
#include <bits/stdc++.h> const int maxn = 8005; const int inf = 0x3f3f3f3f; const long long mod = 998244353; using namespace std; long long vis[111]; int main() { long long x = 1ll, y; int n, q; scanf( %d %d , &n, &q); for (int i = 1; i <= n; ++i) { scanf( %lld , &y); for (int j = 0; j <= 33; ++j) { if ((x << j) == y) { ++vis[j]; break; } } } for (int i = 1; i <= q; ++i) { scanf( %lld , &y); long long cnt = 0; for (int j = 33; j >= 0; --j) { cnt += min(y / (x << j), vis[j]); y -= (x << j) * min(y / (x << j), vis[j]); } if (y) cnt = -1; printf( %lld n , cnt); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); char sym[] = { A , O , M , H , I , o , T , V , W , U , X , Y , x , w , v }; map<char, char> mp; mp[ b ] = d ; mp[ d ] = b ; mp[ p ] = q ; mp[ q ] = p ; string s; cin >> s; int n = s.length(); int a = n / 2 - 1, b; if (n & 1) b = n / 2 + 1; else b = n / 2; if (n & 1 && count(sym, sym + 16, s[n / 2]) == 0) { cout << NIE ; return 0; } for (int i = 0, j = n - 1; i <= a && j >= b; i++, j--) { if (s[i] == s[j] && count(sym, sym + 16, s[i]) == 1) { continue; } if (mp[s[i]] == s[j] && mp[s[j]] == s[i]) { continue; } cout << NIE ; return 0; } cout << TAK ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a[100] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}; long long b; cin >> b; cout << a[b] << endl; }
|
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 + 7; const pair<int, int> pinf = pair<int, int>(inf, inf); int up(int n) { int ret = 1; while (ret < n) ret <<= 1; return ret; } template <class T> class segtree { vector<T> arr; T min(int l, int r, int cl, int cr, int pos) { if (cr <= l || r <= cl) return pinf; if (l <= cl && cr <= r) return arr[pos]; int ct = (cl + cr) / 2; return std::min(min(l, r, cl, ct, 2 * pos), min(l, r, ct, cr, 2 * pos + 1)); } void pset(int pos, T x) { arr[pos] = x; while (pos /= 2) arr[pos] = std::min(arr[2 * pos], arr[2 * pos + 1]); } public: segtree(int n) : arr(2 * up(n)) {} T min(int l, int r) { return min(l, r, 0, arr.size() / 2, 1); } void set(int pos, T x) { pset(pos + arr.size() / 2, x); } }; class sumtree { vector<int> arr; int sum(int l, int r, int cl, int cr, int pos) { if (cr <= l || r <= cl) return 0; if (l <= cl && cr <= r) return arr[pos]; int ct = (cl + cr) / 2; return sum(l, r, cl, ct, 2 * pos) + sum(l, r, ct, cr, 2 * pos + 1); } void pset(int pos, int x) { arr[pos] = x; while (pos /= 2) arr[pos] = arr[2 * pos] + arr[2 * pos + 1]; } public: sumtree(int n) : arr(2 * up(n)) {} int sum(int l, int r) { return sum(l, r, 0, arr.size() / 2, 1); } void set(int p, int x) { pset(p + arr.size() / 2, x); } }; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> arr(n); for (auto &it : arr) cin >> it; segtree<pair<int, int>> st(n); sumtree cards(n); for (int i = 0; i < arr.size(); i++) st.set(i, {arr[i], i}); long long cnt = 0; int pos = 0; sort(arr.begin(), arr.end()); for (int i = 0; i < n; i++) { auto q = st.min(pos, n); if (q.first == arr[i]) { cnt += q.second - pos - cards.sum(pos, q.second); pos = q.second; st.set(pos, pinf); cards.set(pos, 1); } else { cnt += n - pos - cards.sum(pos, n); i--; pos = 0; } } cout << cnt + n << endl; return 0; }
|
#include <bits/stdc++.h> bool V[11][11]; int T[11][11]; int R = 0, C = 0, N = 0, K = 0, t1 = 0, t2 = 0; int W = 0; int main() { scanf( %d%d%d%d , &R, &C, &N, &K); for (int i = 1; i <= N; i++) { scanf( %d%d , &t1, &t2); V[t1][t2] = true; } for (int i = 1; i <= R; i++) for (int j = 1; j <= C; j++) { T[i][j] = T[i - 1][j] + T[i][j - 1] - T[i - 1][j - 1]; if (V[i][j]) T[i][j]++; } for (int i = 1; i <= R; i++) for (int j = 1; j <= C; j++) for (int k = i; k <= R; k++) for (int l = j; l <= C; l++) { if (T[k][l] - T[i - 1][l] - T[k][j - 1] + T[i - 1][j - 1] >= K) W++; } printf( %d n , W); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int da[550]; int dp[550][1050]; int dp2[550][550]; struct kutija { int in, out, w, s, v; } K[505]; bool cmp(const kutija &a, const kutija &b) { if (a.in != b.in) return a.in < b.in; if (a.out != b.out) return a.out > b.out; return a.s > b.s; } int rek(int x, int g) { if (g < 0) return -1e9; if (x == n + 1) return 0; if (dp[x][g] != -1) return dp[x][g]; memset(dp2[x], 0, sizeof dp2[x]); for (int i = x + 1; i <= n; i++) { dp2[x][i + 1] = max(dp2[x][i + 1], dp2[x][i]); if (K[i].in >= K[x].out || K[i].out > K[x].out) continue; dp2[x][da[i]] = max(dp2[x][da[i]], dp2[x][i] + K[i].v + rek(i, min(K[i].s, g - K[i].w))); } dp[x][g] = dp2[x][n + 1]; return dp2[x][n + 1]; } int main(void) { scanf( %d%d , &n, &K[0].s); K[0].in = 0; K[0].out = 2 * n; K[0].w = 0; K[0].v = 0; for (int i = 1; i <= n; i++) scanf( %d%d%d%d%d , &K[i].in, &K[i].out, &K[i].w, &K[i].s, &K[i].v); sort(K, K + n + 1, cmp); memset(dp, -1, sizeof dp); for (int i = 0; i <= n; i++) { da[i] = n + 1; for (int j = 0; j < n + 1; j++) { if (K[i].out <= K[j].in) { da[i] = j; break; } } } printf( %d , rek(0, K[0].s)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a[5][8]; int vis[123124]; struct Mp { int a[30]; Mp() { memset(a, 0, sizeof(a)); } bool operator<(const Mp &x) const { for (int i = 0; i < 25; ++i) if (x.a[i] != a[i]) return a[i] < x.a[i]; return 0; } void swap(int &a, int &b, int &c, int &d) { int t = a; a = b; b = c; c = d; d = t; } Mp Rotate1() { Mp res = *this; swap(res.a[1], res.a[3], res.a[4], res.a[2]); swap(res.a[13], res.a[5], res.a[17], res.a[21]); swap(res.a[14], res.a[6], res.a[18], res.a[22]); swap(res.a[15], res.a[7], res.a[19], res.a[23]); swap(res.a[16], res.a[8], res.a[20], res.a[24]); swap(res.a[9], res.a[10], res.a[12], res.a[11]); return res; } Mp Rotate2() { Mp res = *this; swap(res.a[1], res.a[3], res.a[4], res.a[2]); swap(res.a[13], res.a[5], res.a[17], res.a[21]); swap(res.a[14], res.a[6], res.a[18], res.a[22]); return res; } Mp Rotate3() { Mp res = *this; swap(res.a[2], res.a[23], res.a[10], res.a[6]); swap(res.a[4], res.a[21], res.a[12], res.a[8]); swap(res.a[17], res.a[18], res.a[20], res.a[19]); return res; } bool check() { for (int i = 1; i <= 24; i += 4) { for (int j = i + 1; j <= i + 3; ++j) if (a[j] != a[i]) return 0; } return 1; } void OUT() { for (int i = 1; i <= 24; ++i) cout << a[i] << ; cout << endl; } }; map<Mp, bool> hs; int main() { Mp init; for (int i = 1; i <= 24; ++i) cin >> init.a[i]; queue<Mp> Q; Q.push(init); while (!Q.empty()) { Mp now = Q.front(); Q.pop(); Mp news; news = now.Rotate1(); if (!hs[news]) { hs[news] = 1; Q.push(news); } news = now.Rotate2(); if (news.check()) { puts( yes ); return 0; } news = now.Rotate2().Rotate2().Rotate2(); if (news.check()) { puts( yes ); return 0; } news = now.Rotate3(); if (news.check()) { puts( yes ); return 0; } news = now.Rotate3().Rotate3().Rotate3(); if (news.check()) { puts( yes ); return 0; } } puts( no ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1011; int n, m; char a[N][N]; int b[N][N], ts; const int dx[] = {-1, -1, 0, 0, 1, 1}; const int dy[] = {1, -1, 2, -2, 1, -1}; void output() { for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { int x = i, y = j; if (a[i][j] == . ) { printf( . ); continue; } if (a[i][j] == < ) ++y; else if (a[i][j] == > ) --y; else if (a[i][j] == A ) ++x; else if (a[i][j] == V ) --x; else if (a[i][j] != - && a[i][j] != | ) { printf( %c , a[i][j]); continue; } char k = a ; if (x % 2 == 1) k = c ; if (x / 2 % 2 != y / 2 % 2) ++k; putchar(k); } puts( ); } } bool dfs(int x, int y) { b[x][y] = ts; if (x > 0 && x < n - 1 && a[x - 1][y] == w && a[x + 1][y] == w ) { a[x - 1][y] = A ; a[x][y] = | ; a[x + 1][y] = V ; int nc = 0; for (int d = 0; d < 6; ++d) { int nx = x + dy[d]; int ny = y + dx[d]; if (nx >= 0 && nx < n && ny >= 0 && ny < m && a[nx][ny] == b ) { ++nc; if (dfs(nx, ny)) return true; else break; } } if (!nc) return true; a[x - 1][y] = w ; a[x][y] = b ; a[x + 1][y] = w ; } if (y > 0 && y < m - 1 && a[x][y - 1] == w && a[x][y + 1] == w ) { a[x][y - 1] = < ; a[x][y] = - ; a[x][y + 1] = > ; int nc = 0; for (int d = 0; d < 6; ++d) { int nx = x + dx[d]; int ny = y + dy[d]; if (nx >= 0 && nx < n && ny >= 0 && ny < m && a[nx][ny] == b ) { ++nc; if (dfs(nx, ny)) return true; else break; } } if (!nc) return true; a[x][y - 1] = w ; a[x][y] = b ; a[x][y + 1] = w ; } return false; } int main() { scanf( %d%d n , &n, &m); for (int i = 0; i < n; ++i) scanf( %s , a[i]); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { if (a[i][j] == b ) { ts = i * m + j + 1; if (!dfs(i, j)) { puts( NO ); return 0; } } } for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (a[i][j] == b || a[i][j] == w ) { puts( NO ); return 0; } puts( YES ); output(); }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long a[n], b[n], c[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) cin >> b[i]; for (long long i = 0; i < n; i++) { c[i] = (a[i] - b[i]); } sort(c, c + n); long long answer = 0, answer1 = 0; for (long long i = 0; i < n; i++) { long long ans = a[i] - b[i]; long long sum = 1 - ans; if (ans > 0) answer1++; long long ss = lower_bound(c, c + n, sum) - c; answer += (n - ss); } answer -= answer1; answer /= 2; cout << answer << endl; return 0; }
|
#include <bits/stdc++.h> const int oo = 2139063143; const int N = 101000; const int P = 1000000007; using namespace std; inline void sc(int &x) { x = 0; static int p; p = 1; static char c; c = getchar(); while (!isdigit(c)) { if (c == - ) p = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c - 48); c = getchar(); } x *= p; } inline void print(int x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } inline void pr(int x) { print(x), putchar( n ); } int n, k; int vis[N], cl = 1, cr = 0, ans = 0; int a[N]; void add(int w, int d) { if (!vis[w] && d == 1) ++ans; else if (vis[w] == 1 && d == -1) --ans; vis[w] += d; } int calc(int l, int r) { while (cr < r) ++cr, add(a[cr], 1); while (cl > l) --cl, add(a[cl], 1); while (cr > r) add(a[cr], -1), --cr; while (cl < l) add(a[cl], -1), ++cl; return ans; } int f[N], g[N]; void solve(int wl, int wr, int l, int r) { int mid = (l + r) >> 1, pos = 0; f[mid] = 0; for (int i = wl; i <= min(wr, mid - 1); i++) { int sb = g[i] + calc(i + 1, mid); if (sb > f[mid]) f[mid] = sb, pos = i; } if (l == r) return; if (l < mid) solve(wl, pos, l, mid - 1); if (r > mid) solve(pos, wr, mid + 1, r); } int las[N]; int main() { sc(n), sc(k); for (int i = 1; i <= n; i++) sc(a[i]); for (int i = 1; i <= k; i++) { solve(0, n, 1, n); memcpy(g, f, sizeof(int) * (n + 1)); } pr(f[n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, V; pair<int, int> a[111111]; int x[111111], t[111111], b[111111], f[111111]; int ans1, ans2; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d%d , &x[i], &t[i]); cin >> V; for (int i = 1; i <= n; ++i) t[i] *= V, a[i] = make_pair(t[i] + x[i], t[i] - x[i]); sort(a + 1, a + 1 + n); b[0] = -2000000000; for (int i = 1; i <= n; ++i) b[i] = 2000000000; for (int i = 1; i <= n; ++i) { f[i] = lower_bound(b, b + 1 + n, a[i].second + 1) - b; b[f[i]] = min(b[f[i]], a[i].second); ans2 = max(ans2, f[i]); } int fd = 0; for (int i = 1; i <= n; ++i) if (a[i].first == 0 && a[i].second == 0) fd = i; if (!fd) a[++n] = make_pair(0, 0); sort(a + 1, a + 1 + n); for (int i = 1; i <= n; ++i) if (a[i].first == 0 && a[i].second == 0) fd = i; for (int i = 0; i <= n; ++i) b[i] = 2000000000; b[(ans1 = f[fd] = 0)] = a[fd].second; for (int i = fd + 1; i <= n; ++i) { if (a[i].second >= 0) { f[i] = lower_bound(b, b + 1 + n, a[i].second + 1) - b; b[f[i]] = min(b[f[i]], a[i].second); ans1 = max(ans1, f[i]); } } printf( %d %d n , ans1, ans2); }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.