func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; unordered_map<int, int> parent[100005]; unordered_map<int, int> depth[100005]; unordered_map<int, int> memo[100005]; int Find(int node, int color) { if (parent[node][color] == node) return node; parent[node][color] = Find(parent[node][color], color); return parent[node][color]; } void Union(int a, int b, int color) { if (!parent[a].count(color)) { parent[a][color] = a; } if (!parent[b].count(color)) { parent[b][color] = b; } int roota(Find(a, color)); int rootb(Find(b, color)); if (depth[roota][color] < depth[rootb][color]) swap(roota, rootb); if (depth[roota][color] == depth[rootb][color]) depth[roota][color]++; parent[rootb][color] = roota; } int solve(int a, int b) { if (memo[a].count(b)) return memo[a][b]; int res(0); if (parent[a].size() > parent[b].size()) swap(a, b); unordered_map<int, int>::iterator it; for (it = parent[a].begin(); it != parent[a].end(); it++) { int color(it->first); if (!parent[b].count(color)) continue; if (Find(a, color) == Find(b, color)) res++; } memo[a][b] = memo[b][a] = res; return res; } int main() { int n, m, q; cin >> n >> m; for (int a, b, c, i = 0; i < m; i++) { scanf( %d%d%d , &a, &b, &c); a--; b--; Union(a, b, c); } cin >> q; for (int a, b, i = 0; i < q; i++) { scanf( %d%d , &a, &b); a--; b--; printf( %d n , solve(a, b)); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, z, i, y, x = 1; string line; cin >> n >> k >> line; for (i = 0; i < line.length(); i++) { if (line[i] == G ) { z = i; } if (line[i] == T ) { y = i; } } if (y < z) { k = -k; } if ((y - z) % k == 0) { for (i = z; i != y; i = i + k) { if (line[i] == # ) { cout << NO ; x = 0; break; } } if (x != 0) { cout << YES ; } } else { cout << NO ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, d, t[110], tot = 0; cin >> n >> d; for (int i = 0; i < n; i++) cin >> t[i], tot += t[i]; if (tot + (n - 1) * 10 > d) cout << -1 << endl; else { cout << (n - 1) * 2 + (d - tot - (n - 1) * 10) / 5 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long x, y, m, aux, rs = 0; void neg() { rs = (-y) / x; rs++; y = y + rs * x; } void rec() { aux = x + y; rs++; if (aux < m) { y = x; x = aux; rec(); } } int main() { cin >> x >> y >> m; aux = max(x, y); y = min(x, y); x = aux; if (x >= m) { cout << 0 << endl; return 0; } if (x < 1) { cout << -1 << endl; return 0; } if (y < 1 && x > 0) { neg(); } rec(); cout << rs << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 300007; const double eps = 1e-9; int n, m; double C; inline int Read() { register int ch, a, flag; while (ch = getchar(), (ch < 0 || ch > 9 ) && (ch != - )) ; flag = (ch == - ); a = flag ? 0 : ch - 0 ; while (ch = getchar(), ch >= 0 && ch <= 9 ) a = (a << 1) + (a << 3) + ch - 0 ; a = flag ? -a : a; return a; } inline int dcmp(double a) { if (fabs(a) <= eps) return 0; return a < 0 ? -1 : 1; } struct Point { double x, y; Point(double a = 0, double b = 0) { x = a, y = b; } bool operator==(const Point &A) const { return dcmp(x - A.x) == 0 && dcmp(y - A.y) == 0; } }; inline Point operator+(const Point &A, const Point &B) { return Point(A.x + B.x, A.y + B.y); } inline Point operator-(const Point &A, const Point &B) { return Point(A.x - B.x, A.y - B.y); } inline Point operator*(const Point &A, const double &d) { return Point(A.x * d, A.y * d); } inline Point operator/(const Point &A, const double &d) { return Point(A.x / d, A.y / d); } inline double Dot(const Point &A, const Point &B) { return A.x * B.x + A.y * B.y; } inline double Cross(const Point &A, const Point &B) { return A.x * B.y - A.y * B.x; } inline double Length(const Point &A) { return sqrt(A.x * A.x + A.y * A.y); } struct Segment { double len; Point v; Point p; inline Point Trans(double t) { return p + v * t; } } s[maxn]; struct Pos { int id; Point p; } p[maxn]; struct Func { double a, b, c; double be, ed; Func() {} Func(double s, double t, double q, double w, double e) { be = s, ed = t, a = q, b = w, c = e; } }; vector<Func> f[maxn]; double ti[maxn << 1]; int tot; bool cmp(const double &a, const double &b) { return dcmp(a - b) <= 0; } void Load(int a, int b) { double be = -Length(p[a].p - s[p[a].id].p), ed; ti[++tot] = 0; double Rem = C / m - be; for (int i = p[a].id; i != p[b].id; i = i % n + 1) { ed = be + s[i].len; ti[++tot] = ed; be = ed; Rem -= s[i].len; } ti[++tot] = be + Rem; } void Insert(int a, int b, int c) { tot = 0; Load(a, b), Load(b, c); sort(ti + 1, ti + 1 + tot); tot = unique(ti + 1, ti + 1 + tot) - (ti + 1); Point A = p[a].p, B = p[b].p; int ida = p[a].id, idb = p[b].id; for (int i = 1; i < tot; i++) { double al = A.x - B.x, bt = s[ida].v.x - s[idb].v.x, gm = A.y - B.y, om = s[ida].v.y - s[idb].v.y; double alpha = bt * bt + om * om, beta = 2 * (al * bt + gm * om), gama = al * al + gm * gm; f[a].push_back(Func(ti[i], ti[i + 1] - ti[i], alpha, beta, gama)); A = A + s[ida].v * (ti[i + 1] - ti[i]); B = B + s[idb].v * (ti[i + 1] - ti[i]); if (A == s[ida % n + 1].p) ida = ida % n + 1; if (B == s[idb % n + 1].p) idb = idb % n + 1; } } void Initation() { double dlt = C / m; p[1].p = s[1].p, p[1].id = 1; int j = 1; double rem = 0; for (int i = 2; i <= m; i++) { rem += dlt; while (dcmp(rem - s[j].len) >= 0) rem -= s[j++].len; p[i].id = j; p[i].p = s[j].Trans(rem); } for (int i = 1; i <= m; i++) Insert(i, i % m + 1, (i % m + 1) % m + 1); } struct Arr { double L, R; } A[maxn << 1], B[maxn << 1]; int Ta, Tb; inline Arr Calc(Func F, double R) { double A = F.a, B = F.b, C = F.c - R * R, le, ri; if (dcmp(A) == 0) { if (dcmp(B) < 0) le = 0, ri = -C / B; else if (dcmp(B) == 0) { if (C > 0) return (Arr){1, -1}; le = 0, ri = F.ed; } else le = -C / B, ri = F.ed; } else { double dlt = B * B - 4 * A * C; if (dcmp(dlt) < 0) return (Arr){1, -1}; dlt = sqrt(dlt + eps); le = (-B - dlt) / (2 * A), ri = (-B + dlt) / (2 * A); if (le > ri) swap(le, ri); } le = max(le, (double)0); ri = min(ri, F.ed); if (le > ri) return (Arr){1, -1}; return (Arr){le + F.be, ri + F.be}; } void Add(Arr *s, int &Top, int id, double R) { Top = 0; for (int i = 0; i < f[id].size(); i++) { Arr t = Calc(f[id][i], R); if (t.R < 0) continue; if (Top && dcmp(s[Top].R - t.L) >= 0) s[Top].R = t.R; else s[++Top] = t; } } Arr tmp[maxn << 1]; int Top; void Merge() { Top = 0; int i = 1, j = 1, k = 0; double L, R; while (i <= Ta && j <= Tb) { L = max(A[i].L, B[j].L), R = min(A[i].R, B[j].R); if (L < R) tmp[++Top] = (Arr){L, R}; if (A[i].R >= B[j].R) j++; else i++; } memcpy(A, tmp, sizeof(Arr) * (Top + 3)); Ta = Top; } bool Check(double mid) { Add(A, Ta, 1, mid); if (!Ta) return 0; for (int i = 2; i <= m; i++) { Add(B, Tb, i, mid); Merge(); if (!Ta) return 0; } return 1; } int main() { n = Read(), m = Read(); for (int i = 1; i <= n; i++) s[i].p.x = Read(), s[i].p.y = Read(); for (int i = 1; i < n; i++) { s[i].v = s[i + 1].p - s[i].p, s[i].len = Length(s[i].v); s[i].v = s[i].v / s[i].len; C += s[i].len; } s[n].v = s[1].p - s[n].p, s[n].len = Length(s[n].v); s[n].v = s[n].v / s[n].len; C += s[n].len; Initation(); double le = 0, ri = 6666, mid; for (int r = 1; r <= 100; r++) { mid = (le + ri) / 2; if (!Check(mid)) le = mid; else ri = mid; } printf( %.10f n , mid); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int l; int a[1000007]; int minn[1000007], maxn[1000007], cnt; int cmp(int x, int y) { return x > y; } int main() { scanf( %d , &n); long long ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , &l); int flag = 0; for (int j = 1; j <= l; j++) { scanf( %d , &a[j]); if (j == 1) continue; if (a[j] > a[j - 1]) flag = 1; } if (flag == 0) { minn[++cnt] = a[l]; maxn[cnt] = a[1]; } } sort(minn + 1, minn + 1 + cnt); for (int i = 1; i <= cnt; i++) { int pos = lower_bound(minn + 1, minn + 1 + cnt, maxn[i]) - minn - 1; ans += cnt - pos; } printf( %lld , 1ll * n * n - ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3fll; const long long M = 1e9 + 7; const long long maxn = 1e5 + 7; const double eps = 0.00000001; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <typename T> inline T abs(T a) { return a > 0 ? a : -a; } int n, m; int i, j, k; int main() { scanf( %d , &n); printf( %d , (n - 1) / 2); } |
#include <bits/stdc++.h> using namespace std; const int MN = 200000, INF = 1100000000; int main() { int n; scanf( %d , &n); static int x1[MN], y1[MN], x2[MN], y2[MN]; for (int i = 0; i < n; i++) { scanf( %d%d%d%d , x1 + i, y1 + i, x2 + i, y2 + i); } static int x1l[MN], y1l[MN], x2l[MN], y2l[MN]; x1l[0] = y1l[0] = -INF; x2l[0] = y2l[0] = INF; for (int i = 0; i < n; i++) { x1l[i + 1] = max(x1l[i], x1[i]); y1l[i + 1] = max(y1l[i], y1[i]); x2l[i + 1] = min(x2l[i], x2[i]); y2l[i + 1] = min(y2l[i], y2[i]); } static int x1r[MN], y1r[MN], x2r[MN], y2r[MN]; x1r[n] = y1r[n] = -INF; x2r[n] = y2r[n] = INF; for (int i = n - 1; i >= 0; i--) { x1r[i] = max(x1r[i + 1], x1[i]); y1r[i] = max(y1r[i + 1], y1[i]); x2r[i] = min(x2r[i + 1], x2[i]); y2r[i] = min(y2r[i + 1], y2[i]); } for (int i = 0; i < n; i++) { int X1 = max(x1l[i], x1r[i + 1]); int Y1 = max(y1l[i], y1r[i + 1]); int X2 = min(x2l[i], x2r[i + 1]); int Y2 = min(y2l[i], y2r[i + 1]); if (X1 <= X2 && Y1 <= Y2) { printf( %d %d n , X1, Y1); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int d[4][2] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; int ans, k = 0; int egg[1000000]; int n, m, vis[1050][1050]{0}, ma[1050][1050]; void dfs(int x, int y) { for (int i = 0; i < 4; i++) { int xx = x + d[i][0]; int yy = y + d[i][1]; if ((ma[x][y] >> i) % 2 == 0 && vis[xx][yy] == 0) { vis[xx][yy] = 1; dfs(xx, yy); ans++; } } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> ma[i][j]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (!vis[i][j]) { ans = 1; vis[i][j] = 1; dfs(i, j); egg[++k] = ans; } } } sort(egg + 1, egg + k + 1); for (int i = k; i >= 1; i--) { cout << egg[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> f, num; int Q; int find(int x) { if (!f.count(x)) return x; int fa = find(f[x]); num[x] ^= num[f[x]]; return f[x] = fa; } int main() { scanf( %d , &Q); int last = 0; while (Q--) { int opt, l, r, x; scanf( %d %d %d , &opt, &l, &r); l ^= last, r ^= last; if (l > r) swap(l, r); l--; if (opt & 1) { scanf( %d , &x); x ^= last; int fl = find(l), fr = find(r); if (fl != fr) f[fr] = fl, num[fr] = x ^ num[l] ^ num[r]; } else { int fl = find(l), fr = find(r); if (fl != fr) last = 1, printf( -1 n ); else last = num[l] ^ num[r], printf( %d n , last); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int j, i, t, e, n; cin >> t; while (t--) { cin >> n; string s; cin >> s; string a, b; a = s; b = s; bool f = 0; a[0] = 1 ; b[0] = 1 ; i = 1; while (s[i] != 1 && i < n) { if (s[i] == 0 ) { a[i] = 0 ; b[i] = 0 ; } else { a[i] = 1 ; b[i] = 1 ; } i++; } if (s[i] == 1 ) { a[i] = 1 ; b[i] = 0 ; } i++; while (i < n) { if (s[i] == 0 ) { a[i] = 0 ; b[i] = 0 ; } else if (s[i] == 2 ) { a[i] = 0 ; b[i] = 2 ; } else { b[i] = 1 ; a[i] = 0 ; } i++; } cout << a << endl << b << endl; } } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; void solve() { int n; cin >> n; int ar[n], lock[n]; for (int i = 0; i < n; i++) cin >> ar[i]; vector<int> temp, res; bool flag = false; for (int i = 0; i < n - 1; i++) { if (ar[i] > ar[i + 1]) { flag = true; } } if (flag == false) { cout << YES << endl; return; } int minn = *min_element(ar, ar + n); for (int i = 0; i < n; i++) { if (ar[i] % minn == 0) { temp.push_back(ar[i]); } } sort(temp.begin(), temp.end()); int j = 0; for (int i = 0; i < n; i++) { if (ar[i] % minn != 0) { res.push_back(ar[i]); } else res.push_back(temp[j++]); } for (int i = 0; i < n - 1; i++) { if (res[i] > res[i + 1]) { cout << NO << endl; return; } } cout << YES << endl; } int main() { int T; cin >> T; while (T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; using i64 = long long int; using ii = pair<int, int>; using ii64 = pair<i64, i64>; int main() { int n; scanf( %d , &n); string s; cin >> s; int maxPhone = n / 11; int eight = 0; for (auto& c : s) if (c == 8 ) eight++; printf( %d n , min(maxPhone, eight)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 2; int num[N], n, res[N], a[N]; void ReadData() { cin >> n; for (int i = 0; i < n; ++i) cin >> num[i]; } void Update(int x, int y) { if (x > y) return; ++a[x]; --a[y + 1]; } void Solve() { for (int i = 0; i < n; ++i) { int k = 1; for (; k * k <= (i - 1); ++k) if (num[i] < num[(i - 1) / k]) ++res[k]; for (int j = 0; j <= (i - 1) / k; ++j) if (num[i] < num[j]) { if (0 == j) Update(i, n - 1); else Update(max(k, (i - 1) / (j + 1) + 1), (i - 1) / j); } } for (int i = 1; i < n; ++i) { a[i] += a[i - 1]; res[i] += a[i]; } } void Output() { for (int i = 1; i < n; ++i) cout << res[i] << endl; } int main() { ReadData(); Solve(); Output(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[5][5], sum, add, ex; char c[5][5]; int main() { for (int i = 1; i <= 4; i++) for (int j = 1; j <= 4; j++) { cin >> c[i][j]; if (c[i][j] == x ) { a[i][j] = 4; sum++; } else if (c[i][j] == o ) { a[i][j] = 1; add++; } } if (sum == add) ex = 8; else ex = 2; for (int i = 1; i <= 4; i++) for (int j = 1; j <= 2; j++) if (a[i][j] + a[i][j + 1] + a[i][j + 2] == ex) { cout << YES ; return 0; } for (int i = 1; i <= 2; i++) for (int j = 1; j <= 4; j++) if (a[i][j] + a[i + 1][j] + a[i + 2][j] == ex) { cout << YES ; return 0; } if (a[1][1] + a[2][2] + a[3][3] == ex) { cout << YES ; return 0; } if (a[2][2] + a[3][3] + a[4][4] == ex) { cout << YES ; return 0; } if (a[1][4] + a[2][3] + a[3][2] == ex) { cout << YES ; return 0; } if (a[2][3] + a[3][2] + a[4][1] == ex) { cout << YES ; return 0; } if (a[3][1] + a[2][2] + a[1][3] == ex) { cout << YES ; return 0; } if (a[4][2] + a[3][3] + a[2][4] == ex) { cout << YES ; return 0; } if (a[2][1] + a[3][2] + a[4][3] == ex) { cout << YES ; return 0; } if (a[1][2] + a[2][3] + a[3][4] == ex) { cout << YES ; return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int dp(int a, int b) { if ((a == 1 && b == 1) || b == 0) return 0; return dp(max(b + 1, a - 2), min(b + 1, a - 2)) + 1; } int main() { int n, m; cin >> n >> m; printf( %d , dp(max(n, m), min(n, m))); } |
#include <bits/stdc++.h> using namespace std; int main() { int T, d; scanf( %d , &T); while (T--) { scanf( %d , &d); double a = 0, b = 0; double x = d * d - 4 * d; if (x < 0) { printf( N n ); continue; } else { a = (d - sqrt(x)) / 2.0; b = d - a; if (a < b) swap(a, b); printf( Y %.9lf %.9lf n , a, b); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i = 0; string str; scanf( %d , &n); cin >> str; if (n % 2 == 0) { i = 2; printf( %c%c , str[0], str[1]); } else { i = 3; printf( %c%c%c , str[0], str[1], str[2]); } for (; i < n; i += 2) { printf( -%c%c , str[i], str[i + 1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > grafo[212345]; int marc[212345], dp[212345], ans[212345], ansmin = 1e9; void dfs(int x) { marc[x] = 1; for (int i = 0; i < grafo[x].size(); i++) { int viz = grafo[x][i].first; int type = grafo[x][i].second; if (marc[viz]) continue; dfs(viz); dp[x] += dp[viz]; if (type) dp[x]++; } } void dfs2(int x) { marc[x] = 0; ans[x] = dp[x]; ansmin = min(ansmin, ans[x]); for (int i = 0; i < grafo[x].size(); i++) { int viz = grafo[x][i].first; int type = grafo[x][i].second; if (!marc[viz]) continue; int dpx = dp[x]; int dpv = dp[viz]; dp[x] -= dp[viz]; if (type) dp[x]--; dp[viz] += dp[x]; if (!type) dp[viz]++; dfs2(viz); dp[x] = dpx; dp[viz] = dpv; } } int n; int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int u, v; scanf( %d %d , &u, &v); grafo[u].push_back(make_pair(v, 0)); grafo[v].push_back(make_pair(u, 1)); } dfs(1); dfs2(1); printf( %d n , ansmin); for (int i = 1; i <= n; i++) { if (ansmin == ans[i]) printf( %d , i); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n, m, i, j, k, a[N], u, v, q, x; vector<int> b[N]; long long ans; long long f(int x) { return 1LL * b[x].size() * (a[x] - b[x].size()); } int main() { scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d , &u, &v); if (u > v) swap(u, v); b[u].push_back(v); a[u]++; a[v]++; } scanf( %d , &q); for (i = 1; i <= n; i++) ans += f(i); printf( %lld n , ans); for (j = 1; j <= q; j++) { scanf( %d , &x); ans -= f(x); for (i = 0; i < b[x].size(); i++) ans -= f(b[x][i]), b[b[x][i]].push_back(x), ans += f(b[x][i]); b[x].clear(); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 9; int n; int fs[maxn]; int pj[maxn]; long long ansji, ansou; void solve() { int i; for (i = 1; i <= n; ++i) fs[i] += fs[i - 1]; for (i = 1; i <= n; ++i) { pj[i] = pj[i - 1] + (fs[i] & 1); } for (i = 1; i <= n; ++i) { if (fs[i] & 1) { ansji += i - pj[i - 1]; ansou += pj[i - 1]; } else { ansji += pj[i - 1]; ansou += i - pj[i - 1]; } } } void _solve() { solve(); cout << ansji << << ansou << endl; } void _prepare() { cin >> n; for (int i = 1; i <= n; ++i) { int x; cin >> x; fs[i] = x < 0; } } int _main_prog() { _prepare(); _solve(); return 0; } int main() { return _main_prog(); } |
#include <bits/stdc++.h> using namespace std; int main() { long int i, m, n; double add, ans, t1, t2; scanf( %ld%ld , &m, &n); for (i = 1; i <= m; i++) { t1 = (double)i / m; t2 = (double)(i - 1) / m; add = i * (pow(t1, n) - pow(t2, n)); ans += add; } printf( %.7lf , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[110], n = 0, res[1010], ch = 0, k = 0; string s; int main() { cin >> s; memset(a, 0, sizeof a); memset(res, 0, sizeof res); for (int i = 0; i < (int)s.length(); ++i) if (s[i] != , ) { a[n] *= 10; a[n] += (int)(s[i] - 0 ); } else ++n; ++n; for (int i = 0; i < n; ++i) res[a[i]] = 1; for (int i = 0; i < 1010; ++i) { if (res[i] == 1) ++ch; else { if (k > 0 && ch) cout << , ; if (ch && k == 0) ++k; if (ch == 1) cout << i - 1; else if (ch) cout << i - ch << - << i - 1; ch = 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long sz = 10000001; bool vis[sz]; int cs[sz], a[sz], n, m; void run() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { run(); cin >> n; int x; for (int i = 0; i < n; i++) { cin >> x; a[x]++; } for (int i = 2; i < sz; i++) if (!vis[i]) for (int j = i; j < sz; j += i) { vis[j] = 1; if (a[j]) cs[i] += a[j]; } for (int i = 3; i < sz; i++) cs[i] = cs[i] + cs[i - 1]; cin >> m; while (m--) { long long l, r; cin >> l >> r; r = min(r, sz - 1); l = min(l, sz - 1); cout << cs[r] - cs[l - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100; char ch[maxn][maxn]; int main() { int n; scanf( %d , &n); for (int i = 0; i <= n + 1; i++) { for (int j = 0; j <= n + 1; j++) { ch[i][j] = # ; } } for (int i = 1; i <= n; i++) { getchar(); for (int j = 1; j <= n; j++) { scanf( %c , &ch[i][j]); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (ch[i][j] == # ) { continue; } if (ch[i - 1][j] == # ) { continue; } if (ch[i][j - 1] == # ) { continue; } if (ch[i + 1][j] == # ) { continue; } if (ch[i][j + 1] == # ) { continue; } ch[i][j] = # ; ch[i][j + 1] = # ; ch[i][j - 1] = # ; ch[i + 1][j] = # ; ch[i - 1][j] = # ; } } bool ans = true; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (ch[i][j] == . ) { ans = false; } } } if (ans) { printf( YES n ); } else { printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int ma = -1, mi = 1000000000000000; inline long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } inline long long int lcm(long long int a, long long int b, long long int MOD) { return a / gcd(a, b) * b % MOD; } long long int power(long long int x, unsigned int y) { if (y == 0) return 1; else if (y % 2 == 0) return power(x, y / 2) * power(x, y / 2); else return x * power(x, y / 2) * power(x, y / 2); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int n, i, j = 1, k = 0, b; cin >> n >> k; if (k % 2 == 1) { cout << 1 << endl; return 0; } while (true) { if (k % 2 == 1) break; j++; k /= 2; } cout << j << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long int var; scanf( %ld , &var); if (var >= 0) cout << var; else { int a, b; a = var % 10; var /= 10; b = var % 10; var /= 10; if (a > b) var = var * 10 + a; else var = var * 10 + b; cout << var; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > v; int n, r, m; bool cmp(const pair<int, int>& a, const pair<int, int>& b) { return a.first * a.first + a.second * a.second > b.first * b.first + b.second * b.second; } inline int get_dis(const int& first, const int& second) { return first * first + second * second; } void init() { v.clear(); for (int i = -r; i <= r; ++i) for (int j = -r; j <= r; ++j) if (i * i + j * j <= r * r) v.push_back(make_pair(i, j)); sort(v.begin(), v.end(), cmp); m = min((int)v.size(), 30 - n * 2); } int b[120], ans[120], ansdist; int dist[39][39]; void dfs(int first, int last, int sum) { if (first == n) { if (sum > ansdist) { for (int i = 0; i < n; ++i) ans[i] = b[i]; ansdist = sum; } return; } int ndist; for (int i = last; i < m; ++i) { ndist = 0; for (int j = 0; j < first; ++j) ndist += dist[i][b[j]]; b[first] = i; dfs(first + 1, i, sum + ndist); } } void solve() { for (int i = 0; i < m; ++i) for (int j = 0; j < m; ++j) dist[i][j] = get_dis(v[i].first - v[j].first, v[i].second - v[j].second); ansdist = 0; dfs(0, 0, 0); printf( %d n , ansdist); for (int i = 0; i < n; ++i) printf( %d %d n , v[ans[i]].first, v[ans[i]].second); } int main() { while (scanf( %d%d , &n, &r) != EOF) { init(); solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a > b) swap(a, b); if (a == 0) return b; return gcd(b % a, a); } long long powerMod(long long x, long long y) { long long res = 1; x %= 1000000007; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res; } int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ; long long n, i, j, k, l; cin >> n; long long p[n + 1], q[n + 1]; for (i = 1; i <= n; i++) { cin >> p[i]; q[p[i]] = i; } long long m = 0; vector<pair<long long, long long> > swaps; for (i = 1; i <= n; i++) { if (p[i] != i) { j = q[i]; if (2 * abs(i - j) >= n) { m++; swaps.push_back({i, j}); p[j] = p[i]; q[p[i]] = j; p[i] = i; q[i] = i; } else if (i <= n / 2 && j <= n / 2) { k = max(i, j) + n / 2; m += 3; swaps.push_back({i, k}); swaps.push_back({j, k}); swaps.push_back({i, k}); p[j] = p[i]; q[p[i]] = j; p[i] = i; q[i] = i; } else if (i > n / 2 && j > n / 2) { k = min(i, j) - n / 2; m += 3; swaps.push_back({i, k}); swaps.push_back({j, k}); swaps.push_back({i, k}); p[j] = p[i]; q[p[i]] = j; p[i] = i; q[i] = i; } else { m += 5; if (i <= n / 2 && j > n / 2) k = i + n / 2, l = j - n / 2; else k = i - n / 2, l = j + n / 2; swaps.push_back({j, l}); swaps.push_back({l, k}); swaps.push_back({k, i}); swaps.push_back({k, l}); swaps.push_back({l, j}); p[j] = p[i]; q[p[i]] = j; p[i] = i; q[i] = i; } } } cout << m << endl; for (pair<long long, long long> p : swaps) { cout << p.first << << p.second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int c = 0; int n; cin >> n; string s; for (int i = 0; i < n; i++) { cin >> s; if (s == Cube ) c += 6; else if (s == Tetrahedron ) c += 4; else if (s == Octahedron ) c += 8; else if (s == Icosahedron ) c += 20; else c += 12; } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, tot, m, l, r, len; char c; int po[400005], ha[400005], ys[400005], fi[400005], la[400005]; int s[400005], id[400005], t[400005], sum[400005], it[400005]; struct pi { int num, hai; }; pi find(int li, int ri) { int f1 = 0, f2 = 0, lp = li, rp = ri; pi tmp; if (it[li] == it[ri]) { if (s[li] == 1) { if ((ri - li + 1) % 2 == 1) { tmp.hai = (long long)2 * po[2 * n] % 1000000007; } else tmp.hai = 0; tmp.num = (ri - li + 1) / 2; } else { tmp.num = 0; tmp.hai = (long long)(ha[ys[ri]] - ha[ys[li] - 1] + 1000000007) % 1000000007 * po[2 * n - ys[ri]] % 1000000007; } return tmp; } if (s[li] == 1) lp = la[lp] + 1; if (s[ri] == 1) rp = fi[rp] - 1; if ((lp - li) & 1) f1 = 1; if ((ri - rp) & 1) f2 = 1; tmp.hai = (long long)(ha[ys[rp]] - ha[ys[lp] - 1] + 1000000007) % 1000000007 * po[2 * n - 1 - ys[rp]] % 1000000007; tmp.num = sum[rp] - sum[lp]; tmp.num += (lp - li) / 2; tmp.num += (ri - rp) / 2; if (f2 == 1) tmp.hai = (tmp.hai + (long long)2 * po[2 * n] % 1000000007) % 1000000007; else tmp.hai = (long long)tmp.hai * po[1] % 1000000007; int len = ri - li + 1 - tmp.num * 2; if (f1 == 1) tmp.hai = (tmp.hai + (long long)2 * po[2 * n - len + 1] % 1000000007) % 1000000007; return tmp; } int main() { scanf( %d , &n); s[0] = -1; s[n + 1] = -1; for (int i = 1; i <= n; i++) { scanf( %c , &c); s[i] = c - 0 ; } int tit = 0; for (int i = 1; i <= n; i++) { if (s[i] != s[i - 1]) fi[i] = i, tit++; else fi[i] = fi[i - 1]; it[i] = tit; } for (int i = n; i >= 1; i--) { if (s[i] != s[i + 1]) la[i] = i; else la[i] = la[i + 1]; } po[0] = 1; for (int i = 1; i <= 2 * n; i++) po[i] = (long long)po[i - 1] * 1500007 % 1000000007; for (int i = 1; i <= n; i++) { t[++tot] = s[i]; id[tot] = i; if (t[tot] == 1 && t[tot - 1] == 1) tot -= 2, sum[i]++; ys[i] = tot; } for (int i = 1; i <= n; i++) sum[i] += sum[i - 1]; for (int i = 1; i <= tot; i++) ha[i] = (ha[i - 1] + (long long)po[i] * (t[i] + 1) % 1000000007) % 1000000007; scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d%d%d , &l, &r, &len); pi t1 = find(l, l + len - 1), t2 = find(r, r + len - 1); if (t1.hai == t2.hai && t1.num == t2.num) puts( Yes ); else puts( No ); } return 0; } |
#include <bits/stdc++.h> int n, m, a[210], f[210][210][1010], ans; inline void up(int &x, int y) { if ((x += y) >= 1000000007) x -= 1000000007; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); std::sort(a + 1, a + n + 1); f[1][1][0] = f[1][0][0] = 1; for (int i = 1; i < n; i++) { int delta = a[i + 1] - a[i], next; for (int j = 0; j <= n; j++) { for (int k = 0; k <= m; k++) { if ((next = k + j * delta) > m) continue; if (!f[i][j][k]) continue; if (j > 0) up(f[i + 1][j - 1][next], 1LL * f[i][j][k] * j % 1000000007); up(f[i + 1][j][next], 1LL * f[i][j][k] * (j + 1) % 1000000007); up(f[i + 1][j + 1][next], f[i][j][k]); } } } for (int i = 0; i <= m; i++) up(ans, f[n][0][i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b, k, h[200010]; int main() { scanf( %d%d%d%d , &n, &a, &b, &k); int ans = 0, x; for (int i = 1; i <= n; i++) { scanf( %d , &x); if (x % (a + b) == 0) x -= (x / (a + b) - 1) * (a + b); else x -= (x / (a + b)) * (a + b); if (x <= a) ans++; else { if (x % a == 0) x = x / a - 1; else x = x / a; h[i] = x; } } sort(h + 1, h + 1 + n); for (int i = 1; i <= n; i++) if (h[i] > 0 && k >= h[i]) k -= h[i], ans++; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << , ; err(++it, args...); } namespace fastIO { bool IOerror = 0; inline char nc() { static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000; if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, 100000, stdin); if (pend == p1) { IOerror = 1; return -1; } } return *p1++; } inline bool blank(char ch) { return ch == || ch == n || ch == r || ch == t ; } inline void read(int &x) { char ch; while (blank(ch = nc())) ; if (IOerror) return; for (x = ch - 0 ; (ch = nc()) >= 0 && ch <= 9 ; x = x * 10 + ch - 0 ) ; } } // namespace fastIO using namespace fastIO; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 3e5 + 7; const int N = 5e5 + 10; int a[N]; int main() { int n; cin >> n; int mx = 0; for (int i = 1; i <= n; ++i) cin >> a[i], mx = max(mx, a[i]); int ans = 1; int len = 0; for (int i = 1; i <= n; ++i) { if (a[i] == mx) len++; else len = 0; ans = max(ans, len); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long qpow(long long x, long long y) { long long re = 1, base = x % mod; while (y) { if (y & 1) re = (re * base) % mod; base = (base * base) % mod; y >>= 1; } return re; } struct node { int to, w; node(int to, int w) : to(to), w(w) {} }; int n, k; vector<node> e[100050]; int deep[100050], f[100050], anc[100050][25]; int up[100050], cnt[2][100050]; void init() { for (int i = 0; i <= n; i++) e[i].clear(); memset(f, 0, sizeof(f)), memset(anc, 0, sizeof(anc)), memset(deep, 0, sizeof(deep)); memset(up, 0, sizeof(up)), memset(cnt, 0, sizeof(cnt)); deep[1] = 1; } void dfs1(int x, int fa) { anc[x][0] = f[x]; for (int i = 1; i <= 20; i++) anc[x][i] = anc[anc[x][i - 1]][i - 1]; for (int i = 0; i < e[x].size(); i++) { int next = e[x][i].to; if (next != fa) { f[next] = x; deep[next] = deep[x] + 1; up[next] = -e[x][i].w; dfs1(next, x); } } } int lca(int x, int y) { if (deep[x] < deep[y]) swap(x, y); for (int i = 20; i >= 0; i--) if (deep[anc[x][i]] >= deep[y]) x = anc[x][i]; if (x == y) return x; for (int i = 20; i >= 0; i--) if (anc[x][i] != anc[y][i]) x = anc[x][i], y = anc[y][i]; return f[x]; } void dfs2(int x) { for (int i = 0; i < e[x].size(); i++) { int next = e[x][i].to; if (next == anc[x][0]) continue; dfs2(next); for (int j = 0; j < 2; j++) cnt[j][x] += cnt[j][next]; } } int main() { scanf( %d , &n); init(); for (int i = 1; i < n; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); if (w == 0) { e[u].push_back(node(v, 0)); e[v].push_back(node(u, 0)); } else { e[u].push_back(node(v, 1)); e[v].push_back(node(u, -1)); } } dfs1(1, 0); scanf( %d , &k); int pre = 1, now; while (k--) { scanf( %d , &now); int x = lca(pre, now); cnt[0][pre]++; cnt[0][x]--; cnt[1][now]++; cnt[1][x]--; pre = now; } dfs2(1); int ans = 0; for (int i = 1; i <= n; i++) { if (!up[i]) continue; if (up[i] == -1) ans = (ans + qpow(2, cnt[0][i]) - 1) % mod; else ans = (ans + qpow(2, cnt[1][i]) - 1) % mod; } ans = (ans + mod) % mod; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> p; int a[100005]; int a1[100005], a2[100005]; int n, flag, pl = 1; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (p[a[i]] == 0) p[a[i]] = pl++; } for (int i = 1; i <= n; i++) { a1[i] = p[a[i]]; a2[a1[i]] = a[i]; } int l = p.size(); for (int i = 1; i <= l; i++) { if (a1[a2[i]] != i) flag = 1; } if (flag) printf( -1 n ); else { printf( %d n , p.size()); for (int i = 1; i <= n; i++) { if (i != 1) printf( ); printf( %d , a1[i]); } printf( n ); for (int i = 1; i <= l; i++) { if (i != 1) printf( ); printf( %d , a2[i]); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = 3.14159265358979323846; const int MAXN = 1000005; int n, x[MAXN], y[MAXN], r[MAXN]; int d[MAXN]; vector<int> G[MAXN]; inline double dis(double x1, double y1, double x2, double y2) { double d = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2); return sqrt(d); } int judge(int i, int j) { if (r[i] + r[j] <= dis(x[i], y[i], x[j], y[j])) return 0; else if (r[i] > r[j]) return 1; else if (r[j] > r[i]) return 2; } double calc(int i) { return PI * r[i] * r[i]; } double ans = 0; void dfs(int i, int dis) { if (d[i] >= dis) return; else d[i] = dis; for (int v : G[i]) { dfs(v, dis + 1); } } int main() { scanf( %d , &n); for (int i = (1); i < (n + 1); i++) scanf( %d%d%d , x + i, y + i, r + i); for (int i = (1); i < (n + 1); i++) { for (int j = (i + 1); j < (n + 1); j++) { int status = judge(i, j); if (status == 1) { G[i].push_back(j); } else if (status == 2) { G[j].push_back(i); } } } for (int i = (1); i < (n + 1); i++) { if (!d[i]) dfs(i, 1); } for (int i = (1); i < (n + 1); i++) { if (d[i] <= 2) ans += calc(i); else if (d[i] & 1) ans -= calc(i); else ans += calc(i); } printf( %.11f n , ans); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; constexpr ll mod = 1e9 + 7; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return + s + ; } string to_string(const char c) { return string(1, c); } string to_string(const char* s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } 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 (int i = int(N) - 1; i >= 0; --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 A, typename B, typename C> string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } void debug_out() { cerr << n ; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } int main() { ios::sync_with_stdio(0); cin.tie(0); ll n; cin >> n; string s; cin >> s; vector<ll> A(n); for (auto& _a : A) cin >> _a; vector<int> left, right; for (int i = 0; i < n; ++i) { if (s[i] == L ) { left.push_back(A[i]); } else { right.push_back(A[i]); } } if (0) { }; if (0) { }; sort(left.begin(), left.end()); sort(right.begin(), right.end()); int nl = left.size(), nr = right.size(); ll ans = INT_MAX; for (int r = 0; r < nr; ++r) { auto it = lower_bound(left.begin(), left.end(), right[r]); if (it != left.end()) { ans = min(ans, ll(*it - right[r]) / 2); } } if (ans == INT_MAX) ans = -1; cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; template <class T> typename T::value_type arr_sum(const T& v, int n) { typename T::value_type sum = 0; for (int i = 0; i < n; ++i) sum += v[i]; return sum; } struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; vector<int> t; void build(vector<int>& a, int v, int tl, int tr) { if (tl == tr) t[v] = a[tl]; else { int tm = (tl + tr) / 2; build(a, v * 2 + 1, tl, tm); build(a, v * 2 + 2, tm + 1, tr); t[v] = t[v * 2 + 1] + t[v * 2 + 2]; } } int sum(int v, int tl, int tr, int l, int r) { if (l > r) return 0; if (l == tl && r == tr) return t[v]; int tm = (tl + tr) / 2; return sum(v * 2 + 1, tl, tm, l, min(r, tm)) + sum(v * 2 + 2, tm + 1, tr, max(l, tm + 1), r); } void update(int v, int tl, int tr, int pos, int new_val) { if (tl == tr) { t[v] = new_val; } else { int tm = (tl + tr) / 2; if (pos <= tm) update(v * 2 + 1, tl, tm, pos, new_val); else update(v * 2 + 2, tm + 1, tr, pos, new_val); t[v] = t[v * 2 + 1] + t[v * 2 + 2]; } } void add(int v, int tl, int tr, int pos, int new_val) { if (tl == tr) { t[v] += new_val; } else { int tm = (tl + tr) / 2; if (pos <= tm) add(v * 2 + 1, tl, tm, pos, new_val); else add(v * 2 + 2, tm + 1, tr, pos, new_val); t[v] = t[v * 2 + 1] + t[v * 2 + 2]; } } int main() { int n, q; cin >> n >> q; t.resize(4 * n); vector<int> v(n, 1); int flag = 0; build(v, 0, 0, n - 1); int l = 0, r = v.size(); for (int k = 0; k < q; ++k) { int tmp; cin >> tmp; if (tmp == 1) { int x; cin >> x; if ((x <= (r - l) / 2) ^ flag) { if (flag) { x = r - l - x; } for (int i = l + x, j = l + x - 1; j >= l; ++i, --j) { add(0, 0, n - 1, i, sum(0, 0, n - 1, j, j)); } l += x; flag = 0; } else { if (flag) { x = r - l - x; } for (int i = l + x, j = l + x - 1; i < r; ++i, --j) { add(0, 0, n - 1, j, sum(0, 0, n - 1, i, i)); } r = l + x; flag = 1; } } else { int tl, tr; cin >> tl >> tr; if (!flag) { cout << sum(0, 0, n - 1, l + tl, l + tr - 1) << endl; } else { cout << sum(0, 0, n - 1, r - tr, r - tl - 1) << endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long infll = 0x3f3f3f3f3f3f3f3fLL; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } set<pair<long long, int> > s; pair<long long, long long> a[200005]; pair<pair<long long, long long>, int> brige[200005]; set<pair<long long, int> >::iterator it; int ans[200005]; int main() { int n = read(); int m = read(); for (int i = 1; i <= n; i++) { cin >> a[i].first >> a[i].second; } for (int i = 1; i < n; i++) { brige[i] = make_pair( make_pair(a[i].second - a[i + 1].first, a[i].first - a[i + 1].second), i); } sort(brige + 1, brige + n); for (int i = 1; i <= m; i++) { long long kiss; cin >> kiss; s.insert(make_pair(kiss, i)); } for (int i = 1; i < n; i++) { long long r = -brige[i].first.second; long long l = -brige[i].first.first; it = s.lower_bound(make_pair(r, inf)); if (it == s.begin()) { printf( No n ); return 0; } it--; if (it->first < l) { printf( No n ); return 0; } ans[brige[i].second] = it->second; s.erase(it); } printf( Yes n ); for (int i = 1; i < n; i++) { printf( %d , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; ifstream fin( input.txt ); ofstream fout( output.txt ); const long long mod = 1000000000 + 7; const int maxn = 500 + 10; const int inf = 1000000000; int n, m, par[maxn][maxn][2], dist[maxn][maxn][2]; vector<int> v[maxn], e[2]; queue<pair<pair<int, int>, int> > q; bool mark[maxn][maxn][2]; void pr(int x, int y, int o) { if (par[x][y][o] == -1) return; if (o == 0) { pr(x, par[x][y][o], 1 - o); e[o].push_back(y); } else { pr(par[x][y][o], y, 1 - o); e[o].push_back(x); } } int main() { for (int i = 0; i < maxn; i++) for (int j = 0; j < maxn; j++) dist[i][j][0] = dist[i][j][1] = inf; cin >> n >> m; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } q.push(make_pair(make_pair(1, n), 0)); par[1][n][0] = -1; mark[1][n][0] = 1; dist[1][n][0] = 0; while (!q.empty()) { int x = q.front().first.first; int y = q.front().first.second; int o = q.front().second; q.pop(); if (o == 0) { for (int i = 0; i < v[x].size(); i++) if (!mark[v[x][i]][y][1]) { q.push(make_pair(make_pair(v[x][i], y), 1)); dist[v[x][i]][y][1] = dist[x][y][0] + 1; mark[v[x][i]][y][1] = 1; par[v[x][i]][y][1] = x; } } else { for (int i = 0; i < v[y].size(); i++) if (v[y][i] != x && !mark[x][v[y][i]][0]) { q.push(make_pair(make_pair(x, v[y][i]), 0)); dist[x][v[y][i]][0] = dist[x][y][1] + 1; mark[x][v[y][i]][0] = 1; par[x][v[y][i]][0] = y; } } } if (dist[n][1][0] != inf) { cout << dist[n][1][0] / 2 << endl; pr(n, 1, 0); cout << 1 << ; for (int i = 0; i < e[1].size(); i++) cout << e[1][i] << ; cout << endl << n << ; for (int i = 0; i < e[0].size(); i++) cout << e[0][i] << ; cout << endl; } else cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e7 + 1; char used[MAXN] = {0}; int lowest_divisor[MAXN]; int numbers[2][MAXN], numbers2[2][MAXN]; void sieve() { for (int i = 2; i < MAXN; i += 2) { used[i] = 1; lowest_divisor[i] = 2; } for (long long i = 3; i < MAXN; i += 2) { if (!used[i]) { used[i] = 1; lowest_divisor[i] = i; for (long long j = i; (j * i) < MAXN; j += 2) { if (!used[i * j]) { used[i * j] = 1; lowest_divisor[i * j] = i; } } } } } void factor(int n, bool fl) { while (n > 1) { numbers[fl][lowest_divisor[n]]++; n /= lowest_divisor[n]; } } int main() { sieve(); int n, m; scanf( %d%d , &n, &m); vector<int> a, b; a.resize(n); b.resize(m); for (int i = 0; i < n; i++) { int t; scanf( %d , &t); factor(t, 0); a[i] = t; } for (int i = 0; i < m; i++) { int t; scanf( %d , &t); factor(t, 1); b[i] = t; } for (int i = 2; i < MAXN; i++) { numbers2[0][i] = numbers[0][i] - min(numbers[0][i], numbers[1][i]); numbers2[1][i] = numbers[1][i] - min(numbers[0][i], numbers[1][i]); } cout << n << << m << endl; for (int i = 0; i < n; i++) { int t = a[i]; while (t > 1) { if (numbers[0][lowest_divisor[t]] > numbers2[0][lowest_divisor[t]]) { numbers[0][lowest_divisor[t]]--; a[i] /= lowest_divisor[t]; } t /= lowest_divisor[t]; } } for (int i = 0; i < m; i++) { int t = b[i]; while (t > 1) { if (numbers[1][lowest_divisor[t]] > numbers2[1][lowest_divisor[t]]) { numbers[1][lowest_divisor[t]]--; b[i] /= lowest_divisor[t]; } t /= lowest_divisor[t]; } } for (auto it : a) { printf( %d , it); } cout << endl; for (auto it : b) { printf( %d , it); } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, otv = 0, otv1 = 0; cin >> n; vector<long long> v(n); for (long long j = 0; j < n; j++) { cin >> v[j]; } for (long long j = 1; j < n; j++) { if (v[j] != v[0]) { otv = j; } } for (long long j = 0; j < n - 1; j++) { if (v[j] != v[n - 1]) { otv1 = n - 1 - j; cout << max(otv, otv1); return 0; } } cout << max(otv, otv1); } |
#include <bits/stdc++.h> using namespace std; long long int mod = 1e9 + 7; const double error = 1e-10; const double PI = acos(-1); inline long long int MOD(long long int x, long long int m = mod) { long long int y = x % m; return (y >= 0) ? y : y + m; } const int inf = INT_MAX; const long long int infl = LLONG_MAX; const int nmax = 1e5 + 3; int grundy[nmax], best[nmax]; vector<int> reach[nmax]; void dp() { for (int i = 1; i < nmax; i++) { sort(reach[i].begin(), reach[i].end()); int j, k; for (k = 0, j = 0; k < nmax; k++) { while (j < reach[i].size()) { if (reach[i][j] >= k) break; j++; } if (reach[i].size() == j || reach[i][j] > k) break; } grundy[i] = k; reach[i].clear(); int sum = 0, xorval = 0; for (int j = i; j > 0 && sum < nmax; j--) { sum += j; if (sum >= nmax) continue; xorval ^= grundy[j]; reach[sum].push_back(xorval); if (xorval == 0) best[sum] = i - j + 1; } } } int main() { int n; scanf( %d , &n); dp(); if (grundy[n] == 0) printf( -1 ); else printf( %d , best[n]); } |
#include <bits/stdc++.h> using namespace std; int n, x1, x2; struct server { int c, ind; bool b1, b2; int r1, r2; } * *srv; void qs(server** a, int l, int r) { int i = l, j = r; int p = a[(l + r) >> 1]->c; do { while (i < r && a[i]->c < p) i++; while (j > l && a[j]->c > p) j--; if (i <= j) swap(a[i++], a[j--]); } while (i <= j); if (i < r) qs(a, i, r); if (j > l) qs(a, l, j); } int main() { scanf( %d %d %d , &n, &x1, &x2); srv = new server*[n]; for (int i = 0; i < n; i++) { srv[i] = new server; scanf( %d , &srv[i]->c); srv[i]->ind = i; } qs(srv, 0, n - 1); for (int i = n - 1; i >= 0; i--) { srv[i]->r1 = ((long long)x1 + (long long)srv[i]->c - (long long)1) / (long long)srv[i]->c; srv[i]->r2 = ((long long)x2 + (long long)srv[i]->c - (long long)1) / (long long)srv[i]->c; if (i < n - 1 && srv[i + 1]->b1) srv[i]->b1 = 1; else if (srv[i]->r1 <= n - i) srv[i]->b1 = 1; else srv[i]->b1 = 0; if (i < n - 1 && srv[i + 1]->b2) srv[i]->b2 = 1; else if (srv[i]->r2 <= n - i) srv[i]->b2 = 1; else srv[i]->b2 = 0; } for (int i = 0; i < n - 1; i++) { if (srv[i]->r1 < n - i && srv[i + srv[i]->r1]->b2) { for (int j = i + srv[i]->r1; j < n; j++) { if (srv[j]->r2 <= n - j) { printf( Yes n ); printf( %d %d n , srv[i]->r1, srv[j]->r2); for (int k = 0; k < srv[i]->r1; k++) printf( %d , srv[i + k]->ind + 1); printf( n ); for (int k = 0; k < srv[j]->r2; k++) printf( %d , srv[j + k]->ind + 1); printf( n ); return 0; } } } } for (int i = 0; i < n - 1; i++) { if (srv[i]->r2 < n - i && srv[i + srv[i]->r2]->b1) { for (int j = i + srv[i]->r2; j < n; j++) { if (srv[j]->r1 <= n - j) { printf( Yes n ); printf( %d %d n , srv[j]->r1, srv[i]->r2); for (int k = 0; k < srv[j]->r1; k++) printf( %d , srv[j + k]->ind + 1); printf( n ); for (int k = 0; k < srv[i]->r2; k++) printf( %d , srv[i + k]->ind + 1); printf( n ); return 0; } } } } printf( No n ); return 0; } |
#include<bits/stdc++.h> using namespace std; #define imax(a,b) (((a)>(b))?(a):(b)) #define imin(a,b) (((a)<(b))?(a):(b)) #define mp make_pair typedef long long ll; const int N = 3e5 + 10; typedef pair<int, int> intp; int T, n, dfstime, L[N], R[N], ans, num; vector<int> sd[2][N]; set<intp> np; void read(int& x) { x = 0; char ch = getchar(); bool f = 0; while (!(ch >= 0 && ch <= 9 )) f |= (ch == - ), ch = getchar(); while ((ch >= 0 && ch <= 9 )) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); if (f) x = -x; } void kdfs(int x) { L[x] = ++dfstime; for (vector<int>::iterator iter = sd[1][x].begin();iter != sd[1][x].end();++iter) kdfs(*iter); R[x] = dfstime; } int nofa(int fa, int son){return (L[fa] <= L[son] && R[son] <= R[fa]) ? 0 : 1;} void sdfs(int x) { int mark = num; set<intp>::iterator now = np.lower_bound({ L[x],0 }); if (now != np.end()) num += nofa(x, now->second); if (now != np.begin()) { set<intp>::iterator fnow = now--; num += nofa(now->second, x); if (fnow != np.end()) num -= nofa(now->second, fnow->second); } np.insert({ L[x],x }); ans = imax(ans, num); for (vector<int>::iterator iter = sd[0][x].begin();iter != sd[0][x].end();++iter) sdfs(*iter); np.erase({ L[x],x }); num = mark; } int main() { read(T); while (T--) { read(n); for (int h = 0;h < 2;++h) for (int i = 2;i <= n;++i) { int a; read(a); sd[h][a].push_back(i); } dfstime = 0; kdfs(1); ans = 1; num = 1; sdfs(1); for (int i = 1;i <= n;++i) sd[0][i].clear(), sd[1][i].clear(); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> bool vis[1001][1001], ret[1001][1001]; const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1}; const int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( n ); for (int j = 1; j <= m; ++j) { char ch = getchar(); if (ch == # ) vis[i][j] = 1; } } for (int i = 2; i < n; ++i) for (int j = 2; j < m; ++j) { bool ok = true; for (int k = 0; k < 8; ++k) if (!vis[i + dx[k]][j + dy[k]]) { ok = false; break; } if (ok) for (int k = 0; k < 8; ++k) ret[i + dx[k]][j + dy[k]] = true; } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (vis[i][j] != ret[i][j]) return printf( NO ), 0; printf( YES ); } |
#include <bits/stdc++.h> using namespace std; const int N = 255; double f[N][N * N]; int x, k, p; int main() { scanf( %d%d%d , &x, &k, &p); for (int i = 0; i <= k; i++) { int xx = x + i, cnt = 0; while (xx % 2 == 0) { xx /= 2; cnt++; } f[0][i] = cnt; } for (int i = 1; i <= k; i++) { for (int j = 0; j <= k; j++) { f[i][j << 1] += (f[i - 1][j] + 1) * p / 100.0; f[i][j] += f[i - 1][j + 1] * (100 - p) / 100.0; } } printf( %.10lf n , f[k][0]); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) { if (x > y) x = y; } template <typename T1, typename T2> inline void chkmax(T1 &x, const T2 &y) { if (x < y) x = y; } const int INF = 1e9 + 228 + 1337; bool check(string s, string t) { sort(s.begin(), s.end()); sort(t.begin(), t.end()); return s == t; } void solve() { int n; vector<string> a(2); cin >> n >> a[0] >> a[1]; if (!check(a[0], a[1])) { cout << -1 << n ; return; } vector<vector<int>> dp(n + 1, vector<int>(n + 1, INF)); dp[0][0] = 0; vector<vector<vector<int>>> cnt( 2, vector<vector<int>>(n + 1, vector<int>(26, 0))); reverse(a[0].begin(), a[0].end()); reverse(a[1].begin(), a[1].end()); for (int it = 0; it < 2; it++) { for (int i = 1; i <= n; i++) { for (int alpha = 0; alpha < 26; alpha++) { cnt[it][i][alpha] = cnt[it][i - 1][alpha]; } cnt[it][i][a[it][i - 1] - a ]++; } } for (int i = 0; i <= n; i++) { for (int j = 0; j <= i; j++) { if (i + 1 <= n && a[0][i] == a[1][j]) { assert(j + 1 <= n); chkmin(dp[i + 1][j + 1], dp[i][j]); } char x = a[1][j] - a ; if (j + 1 <= n && cnt[0][i][x] > cnt[1][j][x]) { chkmin(dp[i][j + 1], dp[i][j]); } if (i + 1 <= n) { chkmin(dp[i + 1][j], dp[i][j] + 1); } } } int ans = -1; if (dp[n][n] != INF) { ans = dp[n][n]; } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 5000; int n, fir[maxn + 10], tmpN; int nedge, to[2 * maxn + 10], nex[2 * maxn + 10], dis[2 * maxn + 10]; bool no[2 * maxn + 10]; long long ans, dp[maxn + 10], num[maxn + 10], allDis[maxn + 10]; int p[2]; inline void add_edge(int x, int y, int w) { to[nedge] = y; dis[nedge] = w; nex[nedge] = fir[x]; fir[x] = nedge++; } void dfs(int x, int fa) { num[x] = 0; dp[x] = 0; for (int i = fir[x]; ~i; i = nex[i]) { int y = to[i]; if (y == fa) continue; int w = dis[i]; dfs(y, x); num[x] += num[y]; dp[x] += dp[y] + (long long)num[y] * w; } num[x]++; } void update(int x, int k) { if (p[k] < 0 || allDis[x] < allDis[p[k]]) p[k] = x; } void dfs2(int x, int fa, int k) { for (int i = fir[x]; ~i; i = nex[i]) { int y = to[i]; if (y == fa) continue; int w = dis[i]; allDis[y] = allDis[x] - (long long)w * num[y] + (long long)(tmpN - num[y]) * w; update(y, k); dfs2(y, x, k); } } void solve() { ans = -1; int N[2]; for (int i = 0; i < 2 * (n - 1); i += 2) { memset(p, -1, sizeof p); int x = to[i], y = to[i ^ 1], w = dis[i]; dfs(x, y); tmpN = N[0] = num[x]; allDis[x] = dp[x]; update(x, 0); dfs2(x, y, 0); dfs(y, x); tmpN = N[1] = num[y]; allDis[y] = dp[y]; update(y, 1); dfs2(y, x, 1); long long ret = N[1] * (allDis[p[0]] + (long long)N[0] * w) + N[0] * allDis[p[1]]; long long ret2 = 0; for (int(j) = 1; (j) <= (n); (j)++) ret2 += allDis[j]; ret2 /= 2; ret += ret2; if (ans < 0 || ret < ans) ans = ret; } cout << ans << endl; } int main() { std::ios::sync_with_stdio(false); int x, y, w; while (cin >> n) { memset(fir, -1, (n + 1) * sizeof fir[0]); nedge = 0; for (int(i) = 0; (i) < (n - 1); (i)++) { cin >> x >> y >> w; add_edge(x, y, w); add_edge(y, x, w); } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, cnt = 0; cin >> n; int a[n + 1][n + 1]; vector<int> v; vector<int> v1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; } } int no = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (a[i][j] == 1 || a[i][j] == 3) { no = 1; } } if (no != 1) { v.push_back(i + 1); } no = 0; } if (v.size() == 0) { cout << 0 << endl; return 0; } cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, K, b[40004], a[40004]; int Wl, Wl2, w[40004], lg[40004], inv[40004] = {1, 1}; int Pow(int b, int k) { int r = 1; for (; k; k >>= 1, b = 1ll * b * b % 998244353) if (k & 1) r = 1ll * r * b % 998244353; return r; } void init(int n) { for (Wl = 1; n >= Wl << 1; Wl <<= 1) ; int pw = Pow(3, (998244353 - 1) / (Wl2 = Wl << 1)); w[Wl] = 1; for (int i = (Wl + 1), LIM = (Wl2 - 1); i <= LIM; i++) w[i] = 1ll * w[i - 1] * pw % 998244353; for (int i = (Wl - 1), LIM = (1); i >= LIM; i--) w[i] = w[i << 1]; for (int i = (2), LIM = (Wl2); i <= LIM; i++) inv[i] = 1ll * (998244353 - 998244353 / i) * inv[998244353 % i] % 998244353, lg[i] = lg[i >> 1] + 1; } void NTT(int *A, int n, int tp) { static int r[40004]; static unsigned long long a[40004]; if (tp ^ 1) reverse(A + 1, A + n); for (int i = (0), LIM = (n - 1); i <= LIM; i++) r[i] = r[i >> 1] >> 1 | (i & 1) << (lg[n] - 1), a[i] = (A[r[i]] += A[r[i]] >> 31 & 998244353); for (int L = 1; L < n; L <<= 1) for (int s = 0, L2 = L << 1; s < n; s += L2) for (int k = s, x = L, t; k < s + L; k++, x++) t = w[x] * a[k + L] % 998244353, a[k + L] = a[k] - t + 998244353, a[k] += t; for (int i = (0), LIM = (n - 1); i <= LIM; i++) A[i] = a[i] % 998244353; if (tp ^ 1) for (int i = (0), LIM = (n - 1); i <= LIM; i++) A[i] = 1ll * A[i] * inv[n] % 998244353; } void Mul(int *A, int *B, int *C, int n, int m) { static int st[2][40004]; int L = 1 << lg[n + m] + 1; for (int i = (0), LIM = (L - 1); i <= LIM; i++) st[0][i] = i <= n ? A[i] : 0, st[1][i] = i <= m ? B[i] : 0; NTT(st[0], L, 1), NTT(st[1], L, 1); for (int i = (0), LIM = (L - 1); i <= LIM; i++) C[i] = 1ll * st[0][i] * st[1][i] % 998244353; NTT(C, L, -1); } int *f[40004 << 2]; void Build(int u, int l, int r) { f[u] = new int[1 << lg[r - l + 1] + 1]; if (l == r) return; int m = l + r >> 1; Build(u << 1, l, m), Build(u << 1 | 1, m + 1, r); } void Sol(int u, int l, int r) { memset(f[u], 0, 4 * (1 << lg[r - l + 1] + 1)); if (l == r) return (void)(f[u][0] = 1, f[u][1] = b[l]); int m = l + r >> 1; Sol(u << 1, l, m), Sol(u << 1 | 1, m + 1, r); Mul(f[u << 1], f[u << 1 | 1], f[u], m - l + 1, r - m); } int main() { scanf( %d%d , &n, &K); for (int i = (1), LIM = (n); i <= LIM; i++) scanf( %d , &a[i]); init(n); int Q; scanf( %d , &Q); Build(1, 1, n); for (int op, q, i, d, l, r; Q--;) { scanf( %d , &op); memcpy(b, a, sizeof b); if (op == 1) { scanf( %d%d%d , &q, &i, &d); b[i] = d; } else { scanf( %d%d%d%d , &q, &l, &r, &d); for (int j = l; j <= r; j++) b[j] = (b[j] + d) % 998244353; } for (int i = (1), LIM = (n); i <= LIM; i++) b[i] = (q - b[i]) % 998244353; Sol(1, 1, n); printf( %d n , (f[1][K] + 998244353) % 998244353); } } |
#include <bits/stdc++.h> using namespace std; double d(long long int x, long long int y, long long int x1, long long int y1) { return sqrt((x - x1) * (x - x1) + (y - y1) * (y - y1)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); pair<long long int, long long int> adil; pair<long long int, long long int> bera; pair<long long int, long long int> bin; cin >> adil.first >> adil.second >> bera.first >> bera.second >> bin.first >> bin.second; double sum = 0; long long int n; cin >> n; pair<int, int> MinAdil, Min1Adil, MinBera, Min1Bera; double a, a1, b, b1; a = a1 = b = b1 = 1e10; for (int i = 0; i < n; i++) { long long int x, y; cin >> x >> y; double dist = d(x, y, bin.first, bin.second); sum += dist * 2; double krati = d(adil.first, adil.second, x, y) - dist; double t = dist; dist = krati; if (dist <= a) { Min1Adil.first = MinAdil.first; Min1Adil.second = MinAdil.second; MinAdil.first = x; MinAdil.second = y; a1 = a; a = dist; } else { if (dist < a1) { Min1Adil.first = x; Min1Adil.second = y; a1 = dist; } } dist = d(bera.first, bera.second, x, y) - t; if (dist <= b) { Min1Bera.first = MinBera.first; Min1Bera.second = MinBera.second; MinBera.first = x; MinBera.second = y; b1 = b; b = dist; } else { if (dist < b1) { Min1Bera.first = x; Min1Bera.second = y; b1 = dist; } } } double ans = min(sum - d(bin.first, bin.second, MinAdil.first, MinAdil.second) + d(MinAdil.first, MinAdil.second, adil.first, adil.second), sum - d(bin.first, bin.second, MinBera.first, MinBera.second) + d(MinBera.first, MinBera.second, bera.first, bera.second)); if (n > 1) { if (MinAdil.first == MinBera.first && MinAdil.second == MinBera.second) { ans = min( ans, sum - d(bin.first, bin.second, MinAdil.first, MinAdil.second) - d(bin.first, bin.second, Min1Bera.first, Min1Bera.second) + d(MinAdil.first, MinAdil.second, adil.first, adil.second) + d(Min1Bera.first, Min1Bera.second, bera.first, bera.second)); ans = min( ans, sum - d(bin.first, bin.second, Min1Adil.first, Min1Adil.second) - d(bin.first, bin.second, MinBera.first, MinBera.second) + d(Min1Adil.first, Min1Adil.second, adil.first, adil.second) + d(MinBera.first, MinBera.second, bera.first, bera.second)); } else { ans = min(ans, sum - d(bin.first, bin.second, MinAdil.first, MinAdil.second) - d(bin.first, bin.second, MinBera.first, MinBera.second) + d(MinAdil.first, MinAdil.second, adil.first, adil.second) + d(MinBera.first, MinBera.second, bera.first, bera.second)); } } cout << setprecision(10) << fixed << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int suma = 0, ans = 0, count = 0; for (int i = n - 1; i >= 0; i--) { if (suma + arr[i] <= k) suma = suma + arr[i]; else { suma = arr[i]; count += 1; } if (count >= m) break; ans += 1; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void rd(T &x) { x = 0; char c = getchar(); int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = x * 10 - 0 + c, c = getchar(); x *= f; } template <class T> inline void cmax(T &x, T y) { if (x < y) x = y; } const int N = (1 << 18) + 10; int f[N][2][2]; int vis[N]; void solve(int l, int r, int c) { if (l + 1 == r) { int x = vis[l], y = vis[r]; cmax(f[c][x][y], x | y); cmax(f[c][y][x], x | y); return; } int mid = l + r >> 1; solve(l, mid, c << 1), solve(mid + 1, r, c << 1 | 1); for (int lx = 0; lx < 2; ++lx) for (int ly = 0; ly < 2; ++ly) if (f[c << 1][lx][ly] >= 0) for (int rx = 0; rx < 2; ++rx) for (int ry = 0; ry < 2; ++ry) if (f[c << 1 | 1][rx][ry] >= 0) { for (int S = 0; S < 8; ++S) { int a = (S & 1 ? lx : rx); int b = (S & 2 ? ly : ry); int d = (S & 4 ? (lx ^ rx ^ a) : b); cmax(f[c][a][d], f[c << 1][lx][ly] + f[c << 1 | 1][rx][ry] + (lx | rx) + (ly | ry) + ((lx ^ rx ^ a) | b)); } } } int main() { int n, k; rd(n), rd(k); for (int i = 1, x; i <= k; ++i) rd(x), vis[x - 1] = 1; memset(f, -0x3f, sizeof(f)); solve(0, (1 << n) - 1, 1); int ans = -0x3f3f3f3f; for (int x = 0; x < 2; ++x) for (int y = 0; y < 2; ++y) cmax(ans, f[1][x][y] + (x | y)); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int BUF = 200005; const long long INF = 1LL << 61; int n; long long toAdd; long long arrive[BUF]; int maxOrder[BUF]; void read() { cin >> n >> toAdd; for (int i = 0; i < n; ++i) { cin >> arrive[i]; } for (int i = 0; i < n; ++i) { cin >> maxOrder[i]; } } void work() { for (int i = 0; i + 1 < n; ++i) { if (maxOrder[i] != maxOrder[i + 1] && (maxOrder[i] != i + 1 || maxOrder[i] > maxOrder[i + 1])) { cout << No << endl; return; } } if (maxOrder[n - 1] != n) { cout << No << endl; return; } vector<long long> ans; for (int idx = 0; idx < n;) { int nexIdx = idx; while (nexIdx < n && maxOrder[nexIdx] == maxOrder[idx]) { ++nexIdx; } long long start = nexIdx < n ? arrive[nexIdx] + toAdd - (nexIdx - idx) : INF; for (int i = 0; i < nexIdx - idx; ++i) { if (i == 0 && start + nexIdx - idx - 1 < arrive[idx] + toAdd) { cout << No << endl; return; } else if (i > 0 && start + i < arrive[idx + i] + toAdd + 1) { cout << No << endl; return; } ans.push_back(start + i); } idx = nexIdx; } for (int i = 0; i < n; ++i) { if (i + 1 < n && maxOrder[i] != maxOrder[i + 1] && arrive[i + 1] + toAdd <= ans[i]) { cout << No << endl; return; } if (arrive[i] + toAdd > ans[i]) { cout << No << endl; return; } } cout << Yes << endl; for (int i = 0; i < n; ++i) { if (i) cout << ; cout << ans[i]; } cout << endl; } int main() { read(); work(); return 0; } |
#include <bits/stdc++.h> const long long int M = 1e9 + 7; using namespace std; bool visit[100000]; vector<int> G[100000]; void dfs1(int v, stack<int> &s) { visit[v] = true; for (int i = 0; i < G[v].size(); i++) { int c = G[v][i]; if (!visit[c]) dfs1(c, s); } s.push(v); } void dfs(int n) { stack<int> s; for (int i = 1; i <= n; i++) if (!visit[i]) dfs1(i, s); while (!s.empty()) { cout << s.top() << ; s.pop(); } } int main() { ios::sync_with_stdio(false); int n, m, i, a, b; cin >> n >> m; for (i = 0; i < m; i++) { cin >> a >> b; G[b].push_back(a); } dfs(n); return 0; } |
#include <bits/stdc++.h> struct coor { int x[3]; }; int x[6][3] = {0, 1, 2, 0, 2, 1, 1, 0, 2, 1, 2, 0, 2, 0, 1, 2, 1, 0}; bool judge(coor a, coor b) { bool flag = 0; b.x[2] += 18; if (b.x[2] < a.x[2]) { flag = 1; } else if (b.x[2] > a.x[2]) { } else if (a.x[2] == b.x[2]) { if (b.x[1] < a.x[1]) { flag = 1; } else if (b.x[1] > a.x[1]) { } else if (b.x[1] == a.x[1]) { if (b.x[0] < a.x[0]) { flag = 1; } else if (b.x[0] > a.x[0]) { } else if (b.x[0] == a.x[0]) { flag = 1; } } } return flag; } bool hefa(coor a) { if (a.x[1] < 1 || a.x[1] > 12) return 0; if (a.x[1] == 1 || a.x[1] == 3 || a.x[1] == 5 || a.x[1] == 7 || a.x[1] == 8 || a.x[1] == 10 || a.x[1] == 12) { if (a.x[0] < 1 || a.x[0] > 31) return 0; } else if (a.x[1] == 2) { if (a.x[2] % 4 == 0) { if (a.x[0] < 1 || a.x[0] > 29) return 0; } else { if (a.x[0] < 1 || a.x[0] > 28) return 0; } } else { if (a.x[0] < 1 || a.x[0] > 30) return 0; } return 1; } int main() { int i, j; coor a, b, c; scanf( %d.%d.%d , &a.x[0], &a.x[1], &a.x[2]); scanf( %d.%d.%d , &b.x[0], &b.x[1], &b.x[2]); bool flag = 0; for (i = 0; i < 6; i++) { c.x[0] = b.x[x[i][0]]; c.x[1] = b.x[x[i][1]]; c.x[2] = b.x[x[i][2]]; if (hefa(c)) { if (judge(a, c)) { flag = 1; break; } } } if (flag) printf( YES n ); else printf( NO n ); return 0; } |
#include <bits/stdc++.h> const long long mn = 1000000009; long long x, n, m; long long minu(long long val) { if (val == 0) return mn - 1; return val - 1; } long long getmod(long long val) { long long ret = 1; for (long long i = 0; i < val; i++) { ret *= 2; ret %= mn; } return minu(ret); } int main() { scanf( %d %d , &n, &m); x = getmod(m); long long ans = 1; while (n--) { ans *= x; ans %= mn; x = minu(x); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Grass { int sizee; char dir; } a[100005]; int n; bool flag[100005]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i].dir; } for (int i = 1; i <= n; i++) { cin >> a[i].sizee; } int nowx = 1; flag[nowx] = 1; while (true) { if (a[nowx].dir == > ) { nowx += a[nowx].sizee; } else { nowx -= a[nowx].sizee; } if (nowx > n || nowx < 1) { cout << FINITE ; break; } if (flag[nowx] == 1) { cout << INFINITE ; break; } flag[nowx] = 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); string s; cin >> s; long long int n, i, j, cnt; n = s.length(); cnt = j = 0; for (i = 0; i < n; i++) { if (s[i] == 1 ) { cnt++; j = i; } } if (cnt == 1) cout << n + j - cnt; else cout << n + j - cnt + 2; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int leer() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, m, d[300010], cabeza[300010], vis[300010], cnt, tot, ans[300010]; struct edge { int to; int po; int next; } e[300010 * 2]; bool dfs(int u) { vis[u] = 1; int pd = 0; for (int i = cabeza[u]; i; i = e[i].next) { if (vis[e[i].to]) continue; int flag = dfs(e[i].to); pd ^= flag; if (flag) ans[++cnt] = e[i].po; } if (pd == d[u] || d[u] == -1) return false; return true; } int main() { n = leer(); m = leer(); int root = 0; for (int i = 1; i <= n; i++) { d[i] = leer(); if (d[i] == -1) root = i; } if (!root) root = 1; for (int i = 1; i <= m; i++) { int u = leer(), v = leer(); e[++tot].to = v; e[tot].next = cabeza[u]; cabeza[u] = tot; e[tot].po = i; e[++tot].to = u; e[tot].next = cabeza[v]; cabeza[v] = tot; e[tot].po = i; } if (dfs(root)) puts( -1 ); else { printf( %d n , cnt); for (int i = 1; i <= cnt; i++) printf( %d n , ans[i]); } } |
#include <bits/stdc++.h> int n; int main() { while (EOF != scanf( %d , &n)) { if (n == 5) printf( 1 n ); else printf( %d n , n % 3 + 1); } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const int maxn = 3000000; const long long MANY = 1000000; int main() { long long n; cin >> n; while (n % 3 == 0) n /= 3; long long ans = (n % 3 ? 1 : 0) + n / 3; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int toBinary(int num) { vector<int> vec; while (num > 0) { vec.push_back(num % 2); num = num / 2; } while (vec.size() < 8) { vec.push_back(0); } int temp = 0; for (int i = 0; i < vec.size(); i++) { temp += vec[7 - i] * pow(2, i); } return temp; } int main() { string s; getline(cin, s); int last = 0, x; for (int i = 0; i < s.size(); i++) { x = toBinary((int)s[i]); cout << ((last - x) % 256 + 256) % 256 << endl; last = x; } } |
#include <bits/stdc++.h> int k, x, y; using namespace std; int main() { scanf( %d , &k); x = 1000000 - k % 2000; y = (k + x - 2000 * x) / 2000; printf( 2000 n ); for (int i = 1; i <= 1998; i++) printf( 0 ); printf( %d %d n , y, x); } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; const long double INF = 1e18; const long double PI = acos(-1.0); int n; pair<long long, long long> o, origin, p[N]; long long r_1 = 0; long double r_2 = INF; long long sqDist(pair<long long, long long> a, pair<long long, long long> b) { return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second); } bool isObtuse(pair<long long, long long> a, pair<long long, long long> b, pair<long long, long long> c) { long long ab = sqDist(a, b), bc = sqDist(b, c), ca = sqDist(c, a); return ab + bc <= ca; } long double minDist(pair<long long, long long> a, pair<long long, long long> b) { long double diff_x = b.first - a.first, diff_y = b.second - a.second; if (diff_x == 0 and diff_y == 0) { diff_x = a.first; diff_y = a.second; return diff_x * diff_x + diff_y * diff_y; } long double t = (-a.first * diff_x - a.second * diff_y) / (1.0 * diff_x * diff_x + 1.0 * diff_y * diff_y); if (t < 0) { diff_x = a.first; diff_y = a.second; } else if (t > 1) { diff_x = b.first; diff_y = b.second; } else { diff_x = a.first + t * diff_x; diff_y = a.second + t * diff_y; } return diff_x * diff_x + diff_y * diff_y; } int main() { origin = pair<long long, long long>(0, 0); scanf( %d %lld %lld , &n, &o.first, &o.second); for (int i = 0; i < n; ++i) { scanf( %lld %lld , &p[i].first, &p[i].second); p[i].first -= o.first, p[i].second -= o.second; r_1 = max(r_1, sqDist(p[i], origin)); r_2 = min(r_2, (long double)sqDist(p[i], origin)); } p[n] = p[0]; for (int i = 0; i < n; ++i) { r_2 = min(r_2, minDist(p[i], p[i + 1])); } long double ans = max((long double)0.0, PI * (r_1 - r_2)); printf( %0.16f n , (double)ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void read() {} int main() { read(); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) { int n, m; cin >> n >> m; string s; int a[n][m]; for (int i = 0; i < n; i++) { cin >> s; for (int j = 0; j < m; j++) { if (s[j] == 1 ) a[i][j] = 1; else a[i][j] = 0; } } int o, p; cin >> o >> p; int b[o][p]; for (int i = 0; i < o; i++) { cin >> s; for (int j = 0; j < p; j++) if (s[j] == 1 ) b[i][j] = 1; else b[i][j] = 0; } int final_ans = -1, ans = 0, a1 = 0, a2 = 0; for (int i = -50; i < 51; i++) { for (int j = -50; j < 51; j++) { ans = 0; for (int k = 0; k < n; k++) { if (k + i < 0 or k + i >= o) continue; for (int l = 0; l < m; l++) { if (l + j < 0 or l + j >= p) continue; ans += a[k][l] * b[k + i][l + j]; } } if (ans > final_ans) { a1 = i; a2 = j; final_ans = ans; } } } cout << a1 << << a2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long double Pi = 3.14159265359; const long long MOD = (long long)1e9 + 7; const long long MAXN = (long long)1e6 + 10; const long long INF = (long long)9223372036854775; const long double EPS = (long double)1e-8; long long dp[MAXN]; long long dpx[MAXN]; long long a[MAXN]; deque<long long> de; stack<long long> s; long long mk[MAXN]; long long lb[MAXN]; int main() { long long n, k; scanf( %lld , &n); scanf( %lld , &k); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); for (int i = 0; i < k - 1; i++) { while (de.size() != 0) { if (a[de.back()] <= a[i]) de.pop_back(); else break; } de.push_back(i); } for (int i = k - 1; i < n; i++) { while (de.size() != 0) { if (a[de.back()] <= a[i]) de.pop_back(); else break; } de.push_back(i); if (i - de.front() >= k) de.pop_front(); mk[i] = de.front(); } de.clear(); for (int i = 0; i < n; i++) { while (de.size() != 0) { if (a[de.back()] <= a[i]) de.pop_back(); else break; } if (de.size() == 0) lb[i] = -1; else lb[i] = de.back(); de.push_back(i); } long long nex, cnt, pa; for (int i = k - 1; i < n; i++) { nex = lb[mk[i]]; if (nex == -1) { dpx[i] = ((a[mk[i]]) * (i / (k - 1))) % MOD; } else { cnt = i - nex - 1; pa = cnt / (k - 1); dpx[i] = (dpx[i - (pa * (k - 1))] + ((a[mk[i]]) * pa)) % MOD; } } long long ans = 0; for (int i = 0; i < n; i++) ans = (ans + dpx[i]) % MOD; printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[300010]; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } long long ans = 0; vector<int> v; for (int i = 1; i <= n; ++i) { ans += a[i] / 2; if (a[i] % 2 != 0) { v.push_back(i); } } stack<int> q; if (v.size() == 0) { cout << ans << endl; return 0; } q.push(v[0]); for (int i = 1; i < v.size(); ++i) { if (q.size() && (v[i] - q.top()) % 2 != 0) { q.pop(); ans++; continue; } q.push(v[i]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-11; void fastIO() { std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int dig[10]; int main() { fastIO(); long long ans = 0; long long k; string s; cin >> k >> s; long long sm = 0; for (int i = 0; i < int((s).size()); i++) { dig[s[i] - 0 ]++; sm += (s[i] - 0 ); } for (int i = 0; i < 9; i++) { while (dig[i] && sm < k) { sm += (9 - i); ans++; dig[i]--; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5, B = 350, Mod = 998244353; int n, lim, siz, block_cnt, cnt[maxn], a[maxn], b[maxn], sum_b[1005], sum_f[1005][1005], f[maxn]; vector<int> pos[maxn]; void cal(int w) { memset(sum_f[w], 0, sizeof sum_f[w]); int tmp = 0; for (int i = w * siz; i > w * siz - siz; i--) tmp += b[i], sum_f[w][tmp + B] = (sum_f[w][tmp + B] + f[i - 1]) % Mod; for (int i = -siz + 1; i <= siz; i++) sum_f[w][i + B] = (sum_f[w][i + B] + sum_f[w][i - 1 + B]) % Mod; sum_b[w] = tmp; } int main() { f[0] = 1; cin >> n >> lim; for (int i = 1; i <= n; i++) cin >> a[i], pos[a[i]].push_back(i); siz = sqrt(n); block_cnt = (n - 1) / siz + 1; for (int i = 1; i <= block_cnt; i++) { for (int j = i * siz - siz + 1; j <= min(i * siz, n); j++) { if (cnt[a[j]] == 1) { int p = pos[a[j]][cnt[a[j]] - 1]; b[p] = -1; if (p <= i * siz - siz) cal((p - 1) / siz + 1); } else if (cnt[a[j]] > 1) { int p1 = pos[a[j]][cnt[a[j]] - 2], p2 = pos[a[j]][cnt[a[j]] - 1]; b[p1] = 0; b[p2] = -1; if (p1 <= i * siz - siz) cal((p1 - 1) / siz + 1); if (p2 <= i * siz - siz) cal((p2 - 1) / siz + 1); } b[j] = 1; cnt[a[j]]++; int tmp = 0; for (int k = j; k > i * siz - siz; k--) { tmp += b[k]; if (tmp <= lim) f[j] = (f[j] + f[k - 1]) % Mod; } for (int k = i - 1; k; k--) { if (lim - tmp >= -siz) f[j] = (f[j] + sum_f[k][min(lim - tmp, siz) + B]) % Mod; tmp += sum_b[k]; } } if (i < block_cnt) cal(i); } cout << f[n] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long x, y, z, f[5010][5010], lsg, n, xx, yy, zz; signed main() { cin >> x >> y >> z; n = max(x, max(y, z)); lsg = 998244353; for (long long i = 0; i <= n; i++) f[0][i] = f[i][0] = 1; for (long long i = 1; i <= n; i++) for (long long j = 1; j <= n; j++) (f[i][j] = f[i - 1][j - 1] * i + f[i][j - 1]) %= lsg; xx = max(f[x][y], f[y][x]); yy = max(f[x][z], f[z][x]); zz = max(f[z][y], f[y][z]); cout << xx * yy % lsg * zz % lsg << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010, MAXM = 14, MAXS = MAXM * MAXM, MOD = 1e9 + 9; void setmax(int &x, int y) { if (x < y) { x = y; } } void add(int &x, int y) { x = (x + y) % MOD; } int N, M; string str[MAXM]; map<string, int> mp; int ind; int dp[MAXN][MAXS][MAXM]; int nxt[MAXS][4]; int suff[MAXS]; int main() { if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); } ios::sync_with_stdio(false); cin >> N >> M; mp[ ] = ind++; int maxlen = 0; for (int i = 0; i < M; i++) { cin >> str[i]; setmax(maxlen, str[i].length()); string t; for (char c : str[i]) { t += c; if (!mp.count(t)) { mp[t] = ind++; } } } for (auto it = (mp).begin(); it != (mp).end(); it++) { string s; for (int i = 0; i < 4; i++) { s = it->first + ACGT [i]; while (!mp.count(s)) { s.erase(s.begin()); } nxt[it->second][i] = mp[s]; } s = it->first; for (int i = 0; i < M; i++) { string t = str[i]; if (s.length() < t.length()) { continue; } bool match = true; for (int i = int(s.length()) - 1, j = int(t.length()) - 1; j >= 0; i--, j--) { if (s[i] != t[j]) { match = false; break; } } if (match) { setmax(suff[it->second], t.length()); } } } dp[0][0][0] = 1; for (int i = 0; i < N; i++) { for (int j = 0; j < ind; j++) { for (int k = 0; k < maxlen; k++) { for (int c = 0; c < 4; c++) { int nj = nxt[j][c], nk = k + 1; if (nk <= suff[nj]) { nk = 0; } if (nk >= maxlen) { continue; } add(dp[i + 1][nj][nk], dp[i][j][k]); } } } } int ans = 0; for (int i = 0; i < ind; i++) { add(ans, dp[N][i][0]); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; struct query { int en, ll, rr, ind; }; int tr[3][3000000], mx, h, w, n, m, ok[400000]; vector<int> vrx[300000], vry[300000]; vector<query> qrx[300000], qry[300000]; void build(int x, int l, int r, int tp) { if (l == r) { tr[tp][x] = 300000; return; } int mid = (r + l) / 2; build(x * 2, l, mid, tp); build(x * 2 + 1, mid + 1, r, tp); tr[tp][x] = max(tr[tp][x * 2], tr[tp][x * 2 + 1]); } void md(int x, int l, int r, int ll, int y, int tp) { if (l == r) { tr[tp][x] = y; return; } int mid = (r + l) / 2; if (ll <= mid) md(x * 2, l, mid, ll, y, tp); else md(x * 2 + 1, mid + 1, r, ll, y, tp); tr[tp][x] = max(tr[tp][x * 2], tr[tp][x * 2 + 1]); } void findmx(int x, int l, int r, int ll, int rr, int tp) { if (ll <= l && r <= rr) { if (mx < tr[tp][x]) mx = tr[tp][x]; return; } int mid = (r + l) / 2; if (ll <= mid) findmx(x * 2, l, mid, ll, rr, tp); if (rr > mid) findmx(x * 2 + 1, mid + 1, r, ll, rr, tp); tr[tp][x] = max(tr[tp][x * 2], tr[tp][x * 2 + 1]); } int main() { ios_base::sync_with_stdio(0); cin >> h >> w >> n >> m; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; vrx[x].push_back(y); vry[y].push_back(x); } for (int i = 1; i <= m; i++) { int xb, yb, xe, ye; cin >> xb >> yb >> xe >> ye; qrx[xb].push_back((query){xe, yb, ye, i}); qry[yb].push_back((query){ye, xb, xe, i}); } build(1, 1, h, 0); build(1, 1, w, 1); for (int i = h; i >= 1; i--) { for (int j = 0; j < vrx[i].size(); j++) { int y = vrx[i][j]; md(1, 1, w, y, i, 1); } for (int j = 0; j < qrx[i].size(); j++) { int y = qrx[i][j].en; int l = qrx[i][j].ll; int r = qrx[i][j].rr; int sl = qrx[i][j].ind; mx = 0; findmx(1, 1, w, l, r, 1); if (mx <= y) ok[sl] = 1; } } for (int i = w; i >= 1; i--) { for (int j = 0; j < vry[i].size(); j++) { int x = vry[i][j]; md(1, 1, h, x, i, 0); } for (int j = 0; j < qry[i].size(); j++) { int x = qry[i][j].en; int l = qry[i][j].ll; int r = qry[i][j].rr; int sl = qry[i][j].ind; mx = 0; findmx(1, 1, h, l, r, 0); if (mx <= x) ok[sl] = 1; } } for (int i = 1; i <= m; i++) if (ok[i] == 1) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; queue<char> qq[2][310][310]; vector<vector<int> > res1; vector<vector<int> > res2; void move(int x, int y, int p, int q, int k) { qq[k][p][q].push(qq[k][x][y].front()); qq[k][x][y].pop(); if (k) res2.push_back(vector<int>({p, q, x, y})); else res1.push_back(vector<int>({x, y, p, q})); } int main() { int n, m; cin >> n >> m; string s; for (int k = 0; k < 2; ++k) for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { cin >> s; if (!k) reverse(s.begin(), s.end()); for (char c : s) qq[k][i][j].push(c); } for (int k = 0; k < 2; ++k) { for (int i = 2; i <= n; ++i) while (!qq[k][i][1].empty()) move(i, 1, 1, 1, k); for (int i = 2; i <= m; ++i) while (!qq[k][1][i].empty()) move(1, i, 1, 1, k); while (!qq[k][1][1].empty()) if (qq[k][1][1].front() - 0 ) { move(1, 1, 1, 2, k); } else { move(1, 1, 2, 1, k); } for (int i = 2; i <= n; ++i) for (int j = 2; j <= m; ++j) { while (!qq[k][i][j].empty()) if (qq[k][i][j].front() - 0 ) { if (j == 2) move(i, j, 1, 2, k); else { move(i, j, 1, j, k); move(1, j, 1, 2, k); } } else { if (i == 2) move(i, j, 2, 1, k); else { move(i, j, i, 1, k); move(i, 1, 2, 1, k); } } } } cout << res1.size() + res2.size() << endl; for (int i = 0; i < res1.size(); ++i) { for (int j = 0; j < 4; ++j) printf( %d , res1[i][j]); printf( n ); } for (int i = res2.size() - 1; i >= 0; --i) { for (int j = 0; j < 4; ++j) printf( %d , res2[i][j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long cal(int a, int b, int c, int l) { int x = min(l, a - b - c); if (x < 0) return 0; return (long long)(x + 2) * (x + 1) / 2; } int main() { int a, b, c, l; cin >> a >> b >> c >> l; long long ans = (long long)(l + 1) * (l + 2) * (l + 3) / 6; for (int i = 0; i <= l; ++i) { ans -= cal(a + i, b, c, l - i); ans -= cal(b + i, a, c, l - i); ans -= cal(c + i, a, b, l - i); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int K = 110; const int MOD = 998244353; const int PHI = MOD - 1; int _w; void add_phi(int &a, int b) { a += b; a -= a >= PHI ? PHI : 0; } int pow_mod(int a, int b, int p) { if (!b) return 1; long long rtn = pow_mod(a, b >> 1, p); rtn = rtn * rtn % p; if (b & 1) rtn = rtn * a % p; return int(rtn); } int inv(int x, int p) { return pow_mod(x, p - 2, p); } void exgcd(int a, int b, int &d, long long &x, long long &y) { if (!b) { d = a, x = 1, y = 0; } else { exgcd(b, a % b, d, y, x); y -= a / b * x; } } int k, b[K], n, m; int A[K][K], Q[K][K]; void mul(int A[K][K], int B[K][K], int C[K][K]) { static int tmp[K][K]; memset(tmp, 0, sizeof tmp); for (int i = 0; i < k; ++i) for (int j = 0; j < k; ++j) for (int kk = 0; kk < k; ++kk) add_phi(tmp[i][j], int(1LL * A[i][kk] * B[kk][j] % PHI)); for (int i = 0; i < k; ++i) for (int j = 0; j < k; ++j) C[i][j] = tmp[i][j]; } void fpow(int A[K][K], int b, int C[K][K]) { static int tmp[K][K]; memset(tmp, 0, sizeof tmp); for (int i = 0; i < k; ++i) tmp[i][i] = 1; while (b) { if (b & 1) mul(tmp, A, tmp); mul(A, A, A); b >>= 1; } for (int i = 0; i < k; ++i) for (int j = 0; j < k; ++j) C[i][j] = tmp[i][j]; } int solve() { A[0][k - 1] = 1; for (int i = 1; i < k; ++i) Q[i][i - 1] = 1; for (int i = 0; i < k; ++i) Q[i][k - 1] = b[i] % PHI; fpow(Q, n - k, Q); mul(A, Q, A); return A[0][k - 1]; } map<long long, int> mp; int bsgs(int a, int b, int p) { mp.clear(); int m = int(sqrt(p) + 1); long long e = 1; for (int i = 0; i < m; ++i) { if (!mp.count(e)) mp[e] = i; e = e * a % p; } long long iv = inv(int(e), p); int orb = b; for (int i = 0; i < m; ++i) { if (mp.count(b)) { int x = i * m + mp[b]; if (pow_mod(a, x, p) == orb) return x; } b = int(b * iv % p); } return -1; } void kleft(int P, int A, int B) { int g = 3, bk = bsgs(g, B, P), phip = P - 1; int d; long long xk, n; exgcd(A, -phip, d, xk, n); if (bk % d) { puts( -1 ); return; } xk *= bk / d, n *= bk / d; int phip2 = abs(phip / d); xk = (xk % phip2 + phip2) % phip2; mp.clear(); long long x = pow_mod(g, int(xk), P); printf( %lld n , x); } int main() { _w = scanf( %d , &k); for (int i = 0; i < k; ++i) _w = scanf( %d , b + i); reverse(b, b + k); _w = scanf( %d%d , &n, &m); int tmp = solve(); kleft(MOD, tmp, m); return 0; } |
// Problem: A. Meximization // Contest: Codeforces - Codeforces Round #708 (Div. 2) // URL: https://codeforces.com/contest/1497/problem/A // Memory Limit: 256 MB // Time Limit: 1000 ms // // Powered by CP Editor (https://cpeditor.org) #include <bits/stdc++.h> using INT=int; //#define int long long #define pb push_back #define eb emplace_back #define all(a) (a).begin(),(a).end() using namespace std; auto &_=std::ignore; using ll=long long; using vi=vector<int>; using vll=vector<ll>; using vvi=vector<vector<int>>; using vvll=vector<vector<ll>>; using pii=pair<int,int>; using pll=pair<ll,ll>; constexpr struct{ template<class T> constexpr operator T()const {return numeric_limits<T>::max();} } INF; constexpr struct{ template<class T> constexpr operator T()const {return numeric_limits<T>::min();} } MINF; template<class T> auto _format(ostream &os,const char *c,const T& cv)->decltype(os<<cv,c+1){ os << cv; while (*c!= } ) c++; return c+1; } template<size_t i,class T> auto _format(ostream &os,const char *c,const T& cv)->decltype( typename enable_if<i==tuple_size<T>::value>::type(1),c+1){return c;} template<size_t i=0,class T> auto _format(ostream &os,const char *c,const T& cv)->decltype( typename enable_if<i!=tuple_size<T>::value>::type(1),c+1){ while (*c!= { ) os << *c++; c=_format(os,c,get<i>(cv)); return _format<i+1>(os,c,cv); } template<class T> auto _format(ostream &os,const char *c,const T& cv)->decltype(begin(cv),c+1){ const char *ct=c+1; size_t ic=0; for (auto &i:cv){ const char *cc=c+1; while (*cc!= { ){ if (*cc== i ) os << ic,cc++; else os << *cc++; } cc=_format(os,cc,i); while (*cc!= } ) os << *cc++; ct=cc; ic++; } return ct+1; } string format(const char *c){return string(c);} template<class T,class ...Args> string format(const char *c,const T &a,Args&& ...rest){ ostringstream os; while (*c!= { &&*c!= 0 ) os<< *c++; if (*c== { ) c=_format(os,c,a); return os.str()+format(c,forward<Args>(rest)...); } template<class ...Args> ostream& print(Args&& ...rest){return cout<<format(forward<Args>(rest)...);} #ifdef LOCAL #define debug(...) cerr<<format(__VA_ARGS__) #else #define debug(...) cerr #endif template<class T> void _read(istream& is,T &a){is>>a;} void _read(istream& is,ll &a){ a=0;bool f=false;char c; while (!isdigit(c=is.get())&&is.good()) f=c== - ; if (!is.good()) return ; do a=(a<<3)+(a<<1)+c- 0 ; while (isdigit(c=is.get())); if (f) a=-a; } void read(){} template<class T,class ...Args> void read(T& a,Args& ...args){_read(cin,a);read(args...);} template<class T> void reada(vector<T>& v,size_t n){ v.reserve(n); for (size_t i=0;i<n;i++){ T a;cin>>a; v.emplace_back(move(a)); } } template<class T1,class T2> bool cmin(T1 &a,const T2 b){return a>b?a=b,1:0;} template<class T1,class T2> bool cmax(T1 &a,const T2 b){return a<b?a=b,1:0;} template<class T1,class T2,class ...T3> bool cmin(T1 &a,const T2 b,const T3 ...rest){return cmin(a,b)|cmin(a,rest...);} template<class T1,class T2,class ...T3> bool cmax(T1 &a,const T2 b,const T3 ...rest){return cmax(a,b)|cmax(a,rest...);} bool MULTIDATA=true; struct solution{ int n;map<int,int> m; void scan(){ read(n); vi v; reada(v,n); for (auto i:v) m[i]++; } int solve(){ for (auto mi:m) if (mi.second){ cout << mi.first << ; m[mi.first]--; } for (auto mi:m) for (int k=0;k<mi.second;k++) cout << mi.first << ; cout << endl; return 0; } }; INT main(){ cin.tie(0); ios::sync_with_stdio(false); int T=1; if (MULTIDATA) read(T); while (T--){ auto a=unique_ptr<solution>(new solution()); a->scan(); a->solve(); if (!cin.good()) break; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; inline int read() { int x = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c <= 9 && c >= 0 ) { x = (x << 1) + (x << 3) + c - 0 ; c = getchar(); } return w == 1 ? x : -x; } int n, cnt, tot, l[800005], r[800005], a[800005 << 1], lx[800005], rx[800005], p[800005], t[800005], p2[800005], h[800005]; int main() { int T = read(); while (T--) { n = read(); cnt = 0; tot = 0; for (int i = 1; i <= n; i++) { l[i] = read(), r[i] = read(); a[++cnt] = l[i], a[++cnt] = r[i]; } sort(a + 1, a + cnt + 1); tot = unique(a + 1, a + cnt + 1) - a - 1; for (int i = 1; i <= n; i++) { lx[i] = lower_bound(a + 1, a + tot + 1, l[i]) - a; rx[i] = lower_bound(a + 1, a + tot + 1, r[i]) - a; lx[i] <<= 1; rx[i] <<= 1; } int tmp = 0; for (int i = 1; i <= tot * 2; i++) p2[i] = 0, h[i] = 0, p[i] = 0; for (int i = 1; i <= tot * 2; i++) t[i] = 0; for (int i = 1; i <= n; i++) t[lx[i]]++, t[rx[i] + 1]--; for (int i = 1; i <= tot * 2; i++) tmp += t[i], p[i] = tmp; for (int i = 1; i <= tot * 2; i++) if (p[i] != p[i - 1] && p[i] == 1) p2[i] = 1; for (int i = 1; i <= tot * 2; i++) h[i] = h[i - 1] + p2[i]; int ans = -1e9, ans1 = 0; for (int i = 1; i <= tot * 2 + 1; i++) if (p[i] != 0 && p[i - 1] == 0) ans1++; for (int i = 1; i <= n; i++) { int q = h[rx[i]] - h[lx[i] - 1]; q -= (p[rx[i]] == 1), q -= (p[lx[i]] == 1); ans = max(ans, q); } cout << ans1 + ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[105]; int b[105]; bool cmp(int a, int b) { return a > b; } int main() { int n, x = 0, y = 0, m; int cnt = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &m); for (int j = 1; j <= m; j++) { scanf( %d , &a[j]); } if (m & 1) { for (int j = 1; j <= m / 2; j++) { x += a[j]; } b[cnt++] = a[m / 2 + 1]; for (int j = m / 2 + 2; j <= m; j++) { y += a[j]; } } else { for (int j = 1; j <= m / 2; j++) { x += a[j]; } for (int j = m / 2 + 1; j <= m; j++) { y += a[j]; } } } sort(b, b + cnt, cmp); for (int i = 0; i < cnt; i++) { if (i & 1) y += b[i]; else x += b[i]; } printf( %d %d , x, y); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; int n, x1, x2; pair<int, int> c[N], f[2]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> x1 >> x2; for (int i = 0; i < n; i++) cin >> c[i].first, c[i].second = i; sort(c, c + n); int i = n - 1; for (; ~i; --i) if (i + (x1 + c[i].first - 1) / c[i].first - 1 < n) { f[0] = {i, i + (x1 + c[i].first - 1) / c[i].first}; break; } int j = i; for (; ~i; --i) if (i + (x2 + c[i].first - 1) / c[i].first - 1 < j) { f[1] = {i, i + (x2 + c[i].first - 1) / c[i].first}; break; } if (i >= 0) { cout << Yes n ; cout << f[0].second - f[0].first << << f[1].second - f[1].first << n ; for (; f[0].first < f[0].second; f[0].first++) cout << c[f[0].first].second + 1 << ; cout << n ; for (; f[1].first < f[1].second; f[1].first++) cout << c[f[1].first].second + 1 << ; return 0; } i = n - 1; for (; ~i; --i) if (i + (x2 + c[i].first - 1) / c[i].first - 1 < n) { f[1] = {i, i + (x2 + c[i].first - 1) / c[i].first}; break; } j = i; for (; ~i; --i) if (i + (x1 + c[i].first - 1) / c[i].first - 1 < j) { f[0] = {i, i + (x1 + c[i].first - 1) / c[i].first}; break; } if (i >= 0) { cout << Yes n ; cout << f[0].second - f[0].first << << f[1].second - f[1].first << n ; for (; f[0].first < f[0].second; f[0].first++) cout << c[f[0].first].second + 1 << ; cout << n ; for (; f[1].first < f[1].second; f[1].first++) cout << c[f[1].first].second + 1 << ; return 0; } cout << No ; return 0; } |
#include <bits/stdc++.h> using namespace std; map<string, int> H; string s; int l, rs; void Read_Input() { cin >> s; l = s.length(); rs = 0; int i, j, k; for (i = 0; i < l; i++) for (j = i + 1; j < l; j++) { for (k = 0; j + k < l && s[i + k] == s[j + k]; k++) ; if (rs < k) rs = k; } cout << rs << endl; } int main() { Read_Input(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int q, n, sum; cin >> q; while (q--) { cin >> n; int m = n; sum = 0; while (n--) { int x; cin >> x; sum += x; } double y = (double)sum / m; int rs = y; if (y == rs) { cout << rs << endl; } else { cout << rs + 1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 205; int n, k; int main() { scanf( %d , &k); if (k == 1) { printf( YES n2 1 n1 2 n ); return 0; } if (k % 2 == 0) { printf( NO n ); return 0; } printf( YES n ); printf( %d %d n , 2 * (k + 2), k * (k + 2)); n = k + 2; for (int i = 2; i < n - 1; i++) printf( 1 %d n , i); for (int i = 2; i <= n; i++) for (int j = i + 1; j <= n; j++) { if (i % 2 == 0 && j == i + 1) continue; printf( %d %d n , i, j); } printf( %d %d n , n - 1, n); for (int i = 2; i < n - 1; i++) printf( %d %d n , n + 1, i + n); for (int i = 2; i <= n; i++) for (int j = i + 1; j <= n; j++) { if (i % 2 == 0 && j == i + 1) continue; printf( %d %d n , n + i, n + j); } printf( %d %d n , n + n - 1, n + n); printf( %d %d n , 1, n + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; long long Min(long long a, long long b) { return a < b ? a : b; } bool cmp(long long a, long long b) { return a > b; } long long a[3]; int main() { while (~scanf( %lld%lld%lld , &a[0], &a[1], &a[2])) { long long ans = 0; sort(a, a + 3, cmp); a[0] -= a[2], a[1] -= a[2], a[2] = 0; if (a[0] == 0 && a[1] == 0) ans = 0; else if (a[1] == 0) ans += (a[0] - 1) * 2; else if (a[0] == a[1]) ans += a[1] - 1; else { ans += a[1]; a[0] -= a[1], a[1] = 0; ans += (a[0] - 1) * 2; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int LG = 20; int n, a[N], u, v; long long dp[LG][N][2]; long long sdp[LG][N][2]; long long ans, ans2; vector<int> G[N]; bool mark[N]; int h[N]; void input(); void find_ans(); void dfs(int, int); int main() { input(); for (int i = 0; i < LG; i++) { dfs(0, i); fill(mark, mark + n, false); } find_ans(); cout << ans + (ans2 / 2) << endl; } void input() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n - 1; i++) { cin >> u >> v; u--, v--; G[u].push_back(v); G[v].push_back(u); } } void dfs(int x, int z) { mark[x] = true; for (int i = 0; i < G[x].size(); i++) { int y = G[x][i]; if (!mark[y]) { h[y] = h[x] + 1; dfs(y, z); dp[z][x][0] += dp[z][y][(a[x] >> z) & 1]; dp[z][x][1] += dp[z][y][1 - ((a[x] >> z) & 1)]; sdp[z][x][0] += dp[z][y][0]; sdp[z][x][1] += dp[z][y][1]; } } dp[z][x][(a[x] >> z) & 1]++; } void find_ans() { for (int i = 0; i < LG; i++) for (int j = 0; j < n; j++) ans += (dp[i][j][1] * (1 << i)); for (int i = 0; i < LG; i++) for (int j = 0; j < n; j++) for (int k = 0; k < G[j].size(); k++) { int x = G[j][k]; if (h[x] > h[j]) { ans2 += (dp[i][x][1]) * (sdp[i][j][(a[j] >> i) & 1] - dp[i][x][(a[j] >> i) & 1]) * (1 << i); ans2 += (dp[i][x][0]) * (sdp[i][j][1 - ((a[j] >> i) & 1)] - dp[i][x][1 - ((a[j] >> i) & 1)]) * (1 << i); } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, p, k, i; cin >> n >> p >> k; long long a[n]; for (i = 0; i < n; i++) cin >> a[i]; long long dp[n + 1]; dp[0] = 0; sort(a, a + n); for (i = 1; i <= n; i++) { if (i >= k) { dp[i] = min(dp[i - 1] + a[i - 1], dp[i - k] + a[i - 1]); } else { dp[i] = dp[i - 1] + a[i - 1]; } } long long ans = 0; for (i = 1; i <= n; i++) { if (dp[i] <= p) ans = i; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> const int maxn = 1e6 + 9, mod = 998244353, inf = 0x3f3f3f3f; int Read() { int x(0), f(1); char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3ll) + (x << 1ll) + c - 0 ; c = getchar(); } return x * f; } void Chkmin(int &x, int y) { if (y < x) x = y; } void Chkmax(int &x, int y) { if (y > x) x = y; } int add(int x, int y) { return x += y, x >= mod ? x - mod : x; } int dec(int x, int y) { return x -= y, x < 0 ? x + mod : x; } int mul(int x, int y) { return 1ll * x * y % mod; } int Pow(int base, int b) { int ret(1); while (b) { if (b & 1) ret = mul(ret, base); base = mul(base, base); b >>= 1; } return ret; } int Gcd(int a, int b) { return b ? Gcd(b, a % b) : a; } struct point { int x, y; } a[maxn]; int n, K; double d[maxn]; std::multiset<double> Set; std::map<std::pair<int, int>, std::vector<int> > mp; std::map<std::pair<int, int>, std::vector<int> >::iterator it1; double Dist(double x, double y) { return std::sqrt(x * x + y * y); } bool cmp(int x, int y) { return d[x] > d[y]; } int main() { n = Read(); K = Read(); for (int i = 1; i <= n; ++i) { int x(Read()), y(Read()); if (!x && !y) continue; a[i] = (point){x, y}; d[i] = Dist(x, y); int z(Gcd(std::abs(x), std::abs(y))); int xx(x / z), yy(y / z); mp[std::pair<int, int>(xx, yy)]; it1 = mp.find(std::pair<int, int>(xx, yy)); assert(it1 != mp.end()); it1->second.push_back(i); } for (it1 = mp.begin(); it1 != mp.end(); ++it1) { std::vector<int> A(it1->second); std::sort(A.begin(), A.end(), cmp); int m(A.size()); int ret(0); double pre(0); int j(1); for (int i = 1; i <= m; ++i) if (K - 2 * i + 1 >= 0) { int x(A[i - 1]); Set.insert(d[x] * (1.0 * (K - 2 * i + 1))); j = i + 1; } else { int x(A[m - 1 - (i - j)]); double tmp(-2.0 * pre); tmp += d[x] * (1.0 * (K - 2 * j + 1)); Set.insert(tmp); pre += d[x]; } } int flag(0); double ret(0); while (K--) { if (!Set.size()) { continue; } if (*Set.rbegin() <= 0 && !flag) { flag = 1; continue; } ret += *Set.rbegin(); Set.erase(Set.find(*Set.rbegin())); } printf( %.10lf n , ret); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 10; const int INF = 1e9; int n; char s[maxn]; int P, M; struct node { int l, r; int left, right; } Tree[maxn]; int cur; vector<int> stk; void addNode(int x, bool flag) { ++cur; Tree[cur].l = x; if (!stk.empty()) { int par = stk.back(); if (!Tree[par].left) Tree[par].left = cur; else { assert(!Tree[par].right); Tree[par].right = cur; } } if (flag) stk.push_back(cur); else Tree[cur].r = x; } void buildTree() { for (int i = 0; i < n; ++i) { if (s[i] == ( || (s[i] != ? && s[i] != ) )) addNode(i, s[i] == ( ); else if (s[i] == ) ) { int v = stk.back(); Tree[v].r = i; stk.pop_back(); } } } long long dp[2][maxn][105]; bool mrk[2][maxn][105]; bool flag; long long f(int type, int v, int op) { if (!mrk[type][v][op]) { mrk[type][v][op] = true; if (!type) { if (Tree[v].l == Tree[v].r) return dp[type][v][op] = (!op) ? (s[Tree[v].l] - 0 ) : (-INF); dp[type][v][op] = -INF; int L = Tree[v].left; int R = Tree[v].right; if (op) { for (int x = 0; x <= 1; ++x) for (int y = 0; y <= 1; ++y) for (int i = 0; i <= op - 1; ++i) { if (abs(f(x, L, i)) == INF || abs(f(y, R, op - i - 1)) == INF) continue; if (flag) dp[type][v][op] = max(dp[type][v][op], f(x, L, i) - f(y, R, op - i - 1)); else dp[type][v][op] = max(dp[type][v][op], f(x, L, i) + f(y, R, op - i - 1)); } } for (int x = 0; x <= 1; ++x) for (int y = 0; y <= 1; ++y) for (int i = 0; i <= op; ++i) { if (abs(f(x, L, i)) == INF || abs(f(y, R, op - i)) == INF) continue; if (flag) dp[type][v][op] = max(dp[type][v][op], f(x, L, i) + f(y, R, op - i)); else dp[type][v][op] = max(dp[type][v][op], f(x, L, i) - f(y, R, op - i)); } } else { if (Tree[v].l == Tree[v].r) return dp[type][v][op] = (!op) ? (s[Tree[v].l] - 0 ) : (INF); dp[type][v][op] = INF; int L = Tree[v].left; int R = Tree[v].right; if (op) { for (int x = 0; x <= 1; ++x) for (int y = 0; y <= 1; ++y) for (int i = 0; i <= op - 1; ++i) { if (abs(f(x, L, i)) == INF || abs(f(y, R, op - i - 1)) == INF) continue; if (flag) dp[type][v][op] = min(dp[type][v][op], f(x, L, i) - f(y, R, op - i - 1)); else dp[type][v][op] = min(dp[type][v][op], f(x, L, i) + f(y, R, op - i - 1)); } } for (int x = 0; x <= 1; ++x) for (int y = 0; y <= 1; ++y) for (int i = 0; i <= op; ++i) { if (abs(f(x, L, i)) == INF || abs(f(y, R, op - i)) == INF) continue; if (flag) dp[type][v][op] = min(dp[type][v][op], f(x, L, i) + f(y, R, op - i)); else dp[type][v][op] = min(dp[type][v][op], f(x, L, i) - f(y, R, op - i)); } } } return dp[type][v][op]; } long long solve() { n = strlen(s); if (n == 1) return s[0] - 0 ; if (P > M) { flag = true; swap(P, M); } buildTree(); return f(0, 1, P); } int main() { scanf( %s %d %d , s, &P, &M); printf( %lld n , solve()); return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1}; int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1}; long long bigmod(long long a, long long b, long long c) { if (b == 0) return 1 % c; long long x = bigmod(a, b / 2, c); x = x * x % c; if (b % 2 == 1) x = x * a % c; return x; } long long mod_inverse(long long a, long long mod) { return bigmod(a, mod - 2, mod); } const int M = 100005 * 2; int dp[M], dpp[M], sum[27][M * 4], n, m; string s, p; void update(int id, int l, int r, int k, int L, int val) { if (l == r) { sum[id][k] = val; return; } int mid = (l + r) / 2; if (mid >= L) { update(id, l, mid, k * 2, L, val); } else { update(id, mid + 1, r, k * 2 + 1, L, val); } sum[id][k] = min(sum[id][k * 2], sum[id][k * 2 + 1]); } int query(int id, int l, int r, int k, int L, int R) { if (l > R || r < L) return 2134567891; if (l >= L && r <= R) return sum[id][k]; int mid = (l + r) / 2; return min(query(id, l, mid, k * 2, L, R), query(id, mid + 1, r, k * 2 + 1, L, R)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> s >> p; n = s.size(); m = p.size(); s = # + s; p = # + p; int cnt = 0, ptr = 1; for (int i = 1; i <= n; i++) { if (ptr <= m && s[i] == p[ptr]) { cnt++; ptr++; } dp[i] = cnt; } cnt = 0, ptr = m; for (int i = n; i >= 1; i--) { if (ptr >= 1 && s[i] == p[ptr]) { ptr--; cnt++; } dpp[i] = cnt; } for (int i = 0; i < 26; i++) { for (int j = 0; j < 4 * M; j++) sum[i][j] = 2134567891; } int N = max(n, m); for (int i = 1; i <= m; i++) { int lcnt = i - 1; int rcnt = m - i; int id = p[i] - a ; update(id, 1, N, 1, lcnt + 1, rcnt); } for (int i = 1; i <= n; i++) { int id = s[i] - a ; int ret = query(id, 1, N, 1, 1, dp[i - 1] + 1); if (ret <= dpp[i + 1]) continue; cout << No << endl; return 0; } cout << Yes << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long min(long long a, long long b) { if (a > b) return b; return a; } long long max(long long a, long long b) { if (a > b) return a; return b; } long long fact[32600]; int main() { int n, len, l; cin >> n; len = (int)(sqrt(n)); l = 0; for (int i = 1; i <= len; ++i) { if (n % i == 0) { fact[l++] = i; if (i != n / i) fact[l++] = n / i; } } sort(fact, fact + l); long long mini = 1LL << 63 - 1, maxi = 0LL; for (int i = 0; i < l; ++i) { for (int j = i; j < l; ++j) { for (int k = j; k < l; ++k) { long long aux = fact[i] * fact[j] * fact[k]; if (aux == n) { long long another = (fact[i] + 1) * (fact[j] + 2) * (fact[k] + 2) - n; long long other = (fact[k] + 1) * (fact[j] + 2) * (fact[i] + 2) - n; mini = min(another, min(other, mini)); maxi = max(another, max(other, maxi)); another = (fact[j] + 1) * (fact[i] + 2) * (fact[k] + 2) - n; other = (fact[i] + 1) * (fact[j] + 2) * (fact[k] + 2) - n; another = (fact[k] + 1) * (fact[i] + 2) * (fact[j] + 2) - n; other = (fact[j] + 1) * (fact[i] + 2) * (fact[k] + 2) - n; mini = min(another, min(other, mini)); maxi = max(another, max(other, maxi)); } } } } cout << mini << << maxi << endl; return 0; } |
#include <iostream> using namespace std; int t, n, f[100005]; long long k; void Solve() { if (n < 63 && (1ll<<(n-1)) < k) { cout << -1 n ; return; } int p = max(1, n - 62); long long power = (1ll<<(n-p)); for(int i=1; i<p; ++i) f[i] = i; for(int i=p; i<=n; ++i) { power >>= 1; int c = 0; for(; power < k && k>1; power >>= 1) { ++c; k -= power; } for(int j=0; j<=c; ++j) f[i+j] = i+c-j; i += c; } for(int i=1; i<=n; ++i) cout << f[i] << ; cout << n ; } int main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin >> t; while (t--) { cin >> n >> k; Solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int l, n; cin >> n >> l; int a; int sum[100]; for (int i = 0; i < 100; ++i) sum[i] = 0; memset(sum, 0, 100); for (int i = 0; i < n; ++i) { cin >> a; for (int j = l; j <= 100; ++j) { sum[j - 1] = sum[j - 1] + (a / j) * j; if (a < j) break; } } int maxx = sum[l - 1]; for (int i = l; i < 100; ++i) if (sum[i] > maxx) maxx = sum[i]; cout << maxx; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; vector<int> a[maxn]; string s; int i, ma = -1, ans = 0, f = 1; int main() { cin >> s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) a[++ans].push_back(i); else { if (ans == 0) { f = 0; break; } a[ans--].push_back(i); } ma = max(ans, ma); } if (ma != ans) f = 0; if (!f) { cout << -1; return 0; } else { cout << ma << n ; for (i = 1; i <= ma; i++) { cout << a[i].size() << ; for (int j = 0; j < a[i].size(); j++) { cout << a[i][j] + 1 << ; } cout << n ; } } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( no-stack-protector ) #pragma GCC target( sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native ) using namespace std; namespace output { void __(short x) { cout << x; } void __(unsigned x) { cout << x; } void __(int x) { cout << x; } void __(long long x) { cout << x; } void __(unsigned long long x) { cout << x; } void __(double x) { cout << x; } void __(long double x) { cout << x; } void __(char x) { cout << x; } void __(const char* x) { cout << x; } void __(const string& x) { cout << x; } void __(bool x) { cout << (x ? true : false ); } template <class S, class T> void __(const pair<S, T>& x) { __(1 ? ( : ), __(x.first), __(1 ? , : ), __(x.second), __(1 ? ) : ); } template <class T> void __(const vector<T>& x) { __(1 ? { : ); bool _ = 0; for (const auto& v : x) __(_ ? 1 ? , : : ), __(v), _ = 1; __(1 ? } : ); } template <class T> void __(const set<T>& x) { __(1 ? { : ); bool _ = 0; for (const auto& v : x) __(_ ? 1 ? , : : ), __(v), _ = 1; __(1 ? } : ); } template <class T> void __(const multiset<T>& x) { __(1 ? { : ); bool _ = 0; for (const auto& v : x) __(_ ? 1 ? , : : ), __(v), _ = 1; __(1 ? } : ); } template <class S, class T> void __(const map<S, T>& x) { __(1 ? { : ); bool _ = 0; for (const auto& v : x) __(_ ? 1 ? , : : ), __(v), _ = 1; __(1 ? } : ); } void pr() { cout << n ; } template <class S, class... T> void pr(const S& a, const T&... b) { __(a); if (sizeof...(b)) __( ); pr(b...); } } // namespace output using namespace output; const int MN = 105; int dp[MN][MN][MN], i, j, k, n, m, l, ans, f[MN]; struct idk { int x, y, w; } ptr[MN][MN][MN], sna; string s, t, v; int main() { cin >> s >> t >> v; n = s.size(), m = t.size(), l = v.size(); s.insert(s.begin(), ); t.insert(t.begin(), ); f[0] = 0; for (i = 1, j = 0; i < l; i++) { while (j > 0 && v[i] != v[j]) j = f[j - 1]; if (j >= 0 && v[i] == v[j]) f[i] = ++j; else f[i] = j++; } for (i = 0; i <= n; i++) { for (j = 0; j <= m; j++) { for (k = 1; k <= l; k++) dp[i][j][k] = -1 << 30; if (i && j) dp[i][j][0] = -1 << 30; } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { for (k = 0; k <= l; k++) { if (dp[i - 1][j][k] > dp[i][j][k]) { dp[i][j][k] = dp[i - 1][j][k]; ptr[i][j][k] = {i - 1, j, k}; } if (dp[i][j - 1][k] > dp[i][j][k]) { dp[i][j][k] = dp[i][j - 1][k]; ptr[i][j][k] = {i, j - 1, k}; } if (s[i] == t[j]) { if (k == l) continue; int t = k; while (s[i] != v[t] && t > 0) t = f[t - 1]; if (s[i] == v[t]) { if (dp[i - 1][j - 1][k] + 1 > dp[i][j][t + 1]) { dp[i][j][t + 1] = dp[i - 1][j - 1][k] + 1; ptr[i][j][t + 1] = {i - 1, j - 1, k}; } } else { if (dp[i - 1][j - 1][k] + 1 > dp[i][j][0]) { dp[i][j][0] = dp[i - 1][j - 1][k] + 1; ptr[i][j][0] = {i - 1, j - 1, k}; } } } } for (k = 0; k < l; k++) { if (dp[i][j][k] > ans) { ans = dp[i][j][k]; sna = {i, j, k}; } } } } if (ans == 0) printf( 0 n ); else { int x = sna.x, y = sna.y, w = sna.w; string res; while (x && y) { int px = ptr[x][y][w].x; int py = ptr[x][y][w].y; int pw = ptr[x][y][w].w; if (dp[px][py][pw] < dp[x][y][w]) res += s[x]; x = px, y = py, w = pw; } reverse(res.begin(), res.end()); printf( %s n , res.c_str()); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long int ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); } template <class T> inline T bpow(T p, T e) { long long int ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p); p = (p * p); } return (T)ret; } int ts, kk = 1; struct D { D *l, *r; int cnt; D() { l = r = NULL; cnt = 0; } }; int n, m; pair<int, pair<int, int> > a[100005]; D *tr[10005]; void updt(D *rt, int s, int e, int p) { if (rt == NULL) return; if (p <= s && e <= p) { rt->cnt++; return; } if (rt->l == NULL) rt->l = new D(); if (rt->r == NULL) rt->r = new D(); if (p <= ((s + e) >> 1)) updt(rt->l, s, ((s + e) >> 1), p); else updt(rt->r, ((s + e) >> 1) + 1, e, p); rt->cnt++; } int qry(D *c, int s, int e, int st, int ed) { if (c == NULL) return 0; if (st <= s && e <= ed) return c->cnt; if (ed <= ((s + e) >> 1)) return qry(c->l, s, ((s + e) >> 1), st, ed); if (((s + e) >> 1) < st) return qry(c->r, ((s + e) >> 1) + 1, e, st, ed); return qry(c->l, s, ((s + e) >> 1), st, ed) + qry(c->r, ((s + e) >> 1) + 1, e, st, ed); } int main() { int t, i, j, k; scanf( %d%d , &n, &m); for (i = 0; i < m + 1; i++) tr[i] = NULL; for (i = 0; i < n; i++) { scanf( %d%d%d , &j, &k, &t); a[i] = make_pair(-k, pair<int, int>(t, j)); } sort(a, a + n); long long int rs = 0; for (i = 0; i < n; i++) { int l, r; l = a[i].second.second + a[i].first; r = a[i].second.second - a[i].first; if (l < 1) l = 1; if (r > 1000000007LL) r = 1000000007LL; k = a[i].second.first; for (j = max(1, k - m); j <= min(10005, k + m); j++) rs += qry(tr[j], 1, 1000000007LL, l, r); if (tr[k] == NULL) tr[k] = new D(); updt(tr[k], 1, 1000000007LL, a[i].second.second); } printf( %lld n , rs); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int a[n]; set<long long int> s; for (long long int i = 0; i < n; i++) { cin >> a[i]; s.insert(a[i]); } cout << s.size() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline void read(long long &x) { x = 0; long long f = 1; char ch = getchar(); while (ch != 45 && (ch > 9 || ch < 0 )) ch = getchar(); if (ch == 45) { f = -1, ch = getchar(); } while (ch <= 9 && ch >= 0 ) { x = x * 10 + ch - 48; ch = getchar(); } x *= f; } const long long N = 1e5 + 10, M = 35; long long i, j, k, n, s, t, m; long long pd[N][M]; long long check(long long x, long long y) { long long now = 1; for (long long i = 1; i <= y; i++) { now *= x; if (now >= n) return 0; } return 1; } long long solve(long long x, long long y) { if (pd[x][y] != -1) return pd[x][y]; if (x > 1e5) return pd[x][y] = (n - x - 1) % 2; if (y > 32) return pd[x][y] = 2; if ((solve(x, y + 1) == 0 && check(x, y + 1)) || (solve(x + 1, y) == 0 && check(x + 1, y))) return pd[x][y] = 1; if ((solve(x, y + 1) == 2 && check(x, y + 1)) || (solve(x + 1, y) == 2 && check(x + 1, y))) return pd[x][y] = 2; return pd[x][y] = 0; } signed main() { memset(pd, -1, sizeof(pd)); long long a, b; read(a), read(b), read(n); if (solve(a, b) == 2) printf( Missing n ); if (solve(a, b) == 1) printf( Masha n ); if (solve(a, b) == 0) printf( Stas n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, x, y, z, st; int proc(int l, int r) { if (l > r) return (l - r) / 2; return l - r; } int main() { scanf( %d%d%d , &a, &b, &c); scanf( %d%d%d , &x, &y, &z); st = 0; st += proc(a, x); st += proc(b, y); st += proc(c, z); if (st >= 0) puts( Yes ); else puts( No ); } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.