func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, j, temp, cnt = 0; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) { temp = 0; for (int j = 0; j < n - 1; j++) { if (s[j] == A && s[j + 1] == P ) { s[j + 1] = A ; j++; temp = 1; } } if (temp == 1) { cnt++; } else break; } cout << cnt << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; vector<vector<int> > g(n); vector<int> deg(n); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; --x; --y; g[x].push_back(y); g[y].push_back(x); deg[x]++; deg[y]++; } for (int i = 0; i < n; i++) sort(g[i].begin(), g[i].end()); vector<bool> used(n), vis(n); vector<int> q(n); int top = 0; vector<int> vert(k); bool f = 0; for (int i = 0; i < n; i++) { used[i] = vis[i] = 0; if (deg[i] < k) { vis[i] = 1; q[top++] = i; } } for (int i = 0; i < top; i++) { int u = q[i]; vis[u] = 0; used[u] = 1; if (deg[u] < k - 1) { for (auto j : g[u]) { if (!used[j]) --m; deg[j]--; if (!vis[j] and !used[j] and deg[j] < k) { vis[j] = 1; q[top++] = j; } } continue; } else if (deg[u] == k - 1) { if ((long long)k * (k - 1) <= 2 * (long long)m) { int r = 0; for (auto p : g[u]) { if (!used[p]) vert[r++] = p; } bool ff = 1; for (int x = 0; x < r; x++) { if (!ff) break; for (int y = x + 1; y < r; y++) { int pp = lower_bound(g[vert[x]].begin(), g[vert[x]].end(), vert[y]) - g[vert[x]].begin(); if (pp == g[vert[x]].size() or g[vert[x]][pp] != vert[y]) { ff = 0; break; } } } if (ff) { f = 1; cout << 2 n << u + 1 << ; for (int c = 0; c < r; c++) cout << vert[c] + 1 << ; cout << n ; break; } } } for (auto j : g[u]) { deg[j]--; if (!used[j]) --m; if (!vis[j] and !used[j] and deg[j] < k) { vis[j] = 1; q[top++] = j; } } } if (f) continue; vector<int> ff; for (int i = 0; i < n; i++) if (!used[i]) ff.push_back(i); if (!ff.empty()) { cout << 1 << ff.size() << n ; for (auto c : ff) { c++; cout << c << ; } cout << n ; } else cout << -1 n ; } return 0; } |
#include <bits/stdc++.h> int main() { int i, n, *a, t, j, flag; long m; scanf( %d , &n); scanf( %ld , &m); a = (int*)calloc(n, sizeof(int)); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) for (j = 0; j < n - i - 1; j++) if (a[j + 1] > a[j]) { t = a[j + 1]; a[j + 1] = a[j]; a[j] = t; } flag = 1; for (i = 0; i < n && flag; i++) { m = m - a[i]; if (m <= 0) flag = 0; } printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; const int i32INF = 1 << 30; const long long i64INF = 1LL << 60; const double mINF = 1e100; const double EPS = 1e-9; int nextint() { int a; scanf( %d , &a); return a; } int n; vector<int> v; int difs[23][23]; bool isGood[1 << 23]; bool solveIsGood(int mask) { int id = n; while ((mask & (1 << (id - 1))) == 0) id--; for (int i = 0; i < n; i++) if (mask & (1 << i) && mask & difs[id][i]) return true; return false; } int dp[1 << 23]; int main() { n = nextint(); v.resize(n); for (int i = 0; i < n; i++) v[i] = nextint(); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (i != j) for (int k = 0; k < n; k++) if (v[i] - v[j] == v[k]) difs[i][j] |= (1 << k); isGood[0] = 1; for (int mask = 1; mask < (1 << (n - 1)); mask++) isGood[mask] = solveIsGood(mask); fill(dp, dp + (1 << n), 1024); dp[1] = 1; for (int i = 1; i < n; i++) { for (int j = 0; j < (1 << (i - 1)); j++) { int jj = j | (1 << (i - 1)); if (isGood[jj]) { int cr = dp[jj]; jj |= 1 << i; dp[jj] = min(dp[jj], cr + 1); for (int k = 0; k < i; k++) if (jj & (1 << k)) dp[jj & (~(1 << k))] = min(dp[jj & (~(1 << k))], cr); } } } int res = 1024; for (int mask = 0; mask < (1 << (n - 1)); mask++) res = min(res, dp[mask | (1 << (n - 1))]); if (res == 1024) res = -1; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, h, t, x, y; vector<int> s[100100]; int a[100100], b[100100]; bool bj[100100][2]; void out(int u, int v) { int su = s[u].size(), sv = s[v].size(); int same = 0, i = 0, j = 0; while (i < su && j < sv) { if (s[u][i] == s[v][j]) same++, bj[i][0] = 1, bj[j][1] = 1, i++, j++; else if (s[u][i] > s[v][j]) j++; else i++; } printf( YES n%d %d n , u, v); for (int i = 0; i < su; i++) if (s[u][i] != v) { if (!h) break; if (!bj[i][0]) { printf( %d , s[u][i]); h--; } } for (int i = 0; i < su; i++) if (s[u][i] != v) { if (!h) break; if (bj[i][0]) { printf( %d , s[u][i]); h--; } } puts( ); for (int i = 0; i < sv; i++) if (s[v][i] != u) { if (!t) break; if (!bj[i][1]) { printf( %d , s[v][i]); t--; } } for (int i = sv - 1; i >= 0; i--) if (s[v][i] != u) { if (!t) break; if (bj[i][1]) { printf( %d , s[v][i]); t--; } } puts( ); } bool found(int u, int v) { int su = s[u].size(), sv = s[v].size(); if (su - 1 < h || sv - 1 < t) return 0; int same = 0, i = 0, j = 0; while (i < su && j < sv) { if (s[u][i] == s[v][j]) same++, i++, j++; else if (s[u][i] > s[v][j]) j++; else i++; } if (su + sv - same - 2 >= h + t) { out(u, v); return 1; } return 0; } int main() { scanf( %d%d%d%d , &n, &m, &h, &t); for (int i = 1; i <= m; i++) { scanf( %d%d , &x, &y); s[x].push_back(y); s[y].push_back(x); a[i] = x, b[i] = y; } for (int i = 1; i <= n; i++) sort(s[i].begin(), s[i].end()); for (int i = 1; i <= m; i++) { if (found(a[i], b[i])) return 0; if (found(b[i], a[i])) return 0; } puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> pr; vector<bool> used(1000001, false); vector<int> d(1000001, 0); void sieve() { for (long long i = 2; i <= 1000000; i++) { for (long long k = i * i; k <= 1000000; k += i) used[k] = true; } for (int i = 2; i <= 1000000; i++) if (!used[i]) pr.push_back(i); } int main() { sieve(); d[1] = 1; for (int i = 2; i <= 1000000; i++) { d[i] = d[i - 1]; int k = lower_bound(pr.begin(), pr.end(), i) - pr.begin(); int k1 = upper_bound(pr.begin(), pr.end(), i) - pr.begin(); if (k1 - k > 0) { d[i]++; continue; } int x = sqrt(i); if (x * x == i) { k = lower_bound(pr.begin(), pr.end(), x) - pr.begin(); k1 = upper_bound(pr.begin(), pr.end(), x) - pr.begin(); if (k1 - k > 0) { d[i]--; } } } int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); printf( %d n , d[n]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 4; const int oo = 1e8 + 7; int n, a[maxn], cc, p; long long s[maxn]; int main() { cin >> n; a[1] = 1; a[2] = 2 * n; a[n + 1] = 2; a[n + 2] = 2 * n - 1; int cc = 3; for (int i = 3; i <= (n); ++i) { if (i % 2) { a[i] = cc; a[i + n] = cc + 1; cc += 2; } else { a[i + n] = cc; a[i] = cc + 1; cc += 2; } } long long k = 0; for (int i = 1; i <= (2 * n); ++i) k += i; for (int i = 2 * n + 1; i <= (4 * n); ++i) a[i] = a[i - 2 * n]; for (int i = 1; i <= (4 * n); ++i) s[i] = s[i - 1] + a[i]; k = k / 2; k++; for (int i = 1; i <= (3 * n); ++i) { long long x = s[i + n - 1] - s[i - 1]; if (abs(x - k) > 1) { cout << NO ; return 0; } } cout << YES n ; for (int i = 1; i <= (2 * n); ++i) cout << a[i] << ; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, c[N], k = 1e5; char a[N], b[N]; void solve(int p, int coef) { if (a[p - 1] + coef < 0 || a[p - 1] + coef > 9 ) { solve(p - 1, -coef); } a[p - 1] += coef; a[p] += coef; printf( %d %d n , p - 1, coef); if (!--k) { exit(0); } } int main() { scanf( %d%s%s , &n, a + 1, b + 1); copy(a + 1, a + 1 + n, c + 1); long long answer = 0; for (int i = 1; i < n; ++i) { if (c[i] != b[i]) { answer += abs(c[i] - (int)b[i]); c[i + 1] += (int)b[i] - c[i]; } } if (c[n] != b[n]) { return puts( -1 ); } else { printf( %lld n , answer); if (answer < k) { k = answer; } for (int i = n; i; --i) { for (; a[i] != b[i]; solve(i, a[i] < b[i] ? 1 : -1)) ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void print_ans(int x1, int y1, int x2, int y2) { long long int ans; ans = (x1 - x2) * (y1 - y2); if (ans < 0) ans = -ans; cout << ans; return; } int main() { int n, x[4], y[4], i; cin >> n; if (n < 2) cout << -1 ; else { for (i = 0; i < n; i++) cin >> x[i] >> y[i]; if (n == 2) { if (x[0] == x[1] || y[0] == y[1]) cout << -1 ; else print_ans(x[0], y[0], x[1], y[1]); } else { if (x[0] != x[1] && y[0] != y[1]) print_ans(x[0], y[0], x[1], y[1]); else if (x[1] != x[2] && y[1] != y[2]) print_ans(x[1], y[1], x[2], y[2]); else print_ans(x[0], y[0], x[2], y[2]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; bool vv[2000][2000]; int main() { int n; string s; cin >> s; long long left[2000], right[2000]; for (int i = 0; i < s.length(); i++) { vv[i][i] = true; } int sm = 1, cp = s.length() - 1; for (; sm < s.length(); sm++) { for (int i = sm, j = 0; i < s.length(); i++, j++) { if (s[j] == s[j + sm] && (sm == 1 || vv[j + 1][j + sm - 1])) { vv[j][j + sm] = true; } else { vv[j][j + sm] = false; } } } for (int i = 0; i < s.length(); i++) { left[i] = 1; right[i] = 1; for (int j = 0; j < i; j++) { if (vv[j][i]) left[i]++; if (vv[s.length() - (i + 1)][s.length() - (j + 1)]) right[i]++; } } long long res = 0, right_sum = 0; for (int i = 0; i < s.length() - 1; i++) right_sum += right[i]; for (int i = 0; i < s.length() - 1; i++) { res += left[i] * right_sum; right_sum -= right[s.length() - (i + 2)]; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; priority_queue<pair<long long, pair<long long, long long>>> pq; int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T = 1; while (T--) { bool flag = true, cond = true; long long n, i, j, x, y, ind, k, m, mn = INT_MAX, p = 0, mx = 0, diff, y1, count = 0; cin >> n; vector<long long> a(n), b(n); for (i = 0; i < n; i++) { cin >> a[i]; } map<long long, long long> mp; for (j = 0; j < n; j++) { cin >> b[j]; mp[b[j]]++; } vector<long long> c; map<long long, long long>::iterator it; for (i = 0; i < n; i++) { it = mp.lower_bound(n - a[i]); if (it == mp.end()) { it = mp.begin(); c.push_back((a[i] + it->first) % n); if (it->second == 1) mp.erase(it->first); else mp[it->first]--; } else { c.push_back((a[i] + it->first) % n); if (it->second == 1) mp.erase(it->first); else mp[it->first]--; } } for (int iz = 0; iz < c.size(); iz++) { cout << c[iz] << ; } cout << n ; ; } return 0; } |
#include <bits/stdc++.h> using namespace std; string s[50005]; bool cmp(const string &a, const string &b) { return a + b < b + a; } int main() { int n, i; cin >> n; for (i = 0; i < n; i++) cin >> s[i]; sort(s, s + n, cmp); string ans = accumulate(s, s + n, string()); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxs = 300 * 1000 + 5, Maxn = 300 * 1000 + 5; int n, dp[Maxs]; string s, t; long long ans; vector<pair<int, string> > adj[Maxn]; void kmp() { dp[0] = -1; for (int i = 0; i < t.size(); i++) { int pt = i; while (dp[pt] != -1 && t[dp[pt]] != t[i]) pt = dp[pt]; dp[i + 1] = dp[pt] + 1; } } double now; void dfs(int v, int indt) { for (auto u : adj[v]) { int indt2 = indt; for (int j = 0; j < u.second.size(); ++j) { if (clock() - now == CLOCKS_PER_SEC * 0.990) { cout << ans << endl; exit(0); } if (indt2 == t.size()) ans++, indt2 = dp[indt2]; if (indt2 >= 0 && indt2 < t.size() && u.second[j] == t[indt2]) indt2++; else if (indt2 != 0 && indt2 >= 0) indt2 = dp[indt2], j--; } if (indt2 == t.size()) ans++, indt2 = dp[indt2]; dfs(u.first, indt2); } } int main() { now = clock(); cin >> n; int par; for (int i = 1; i < n; i++) cin >> par >> s, par--, adj[par].push_back(make_pair(i, s)); cin >> s; t = s; kmp(); dfs(0, 0); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int calc(long long n, long long k, long long a1, long long a2, long long a3) { long long sum; if (a2 < a3) { swap(a2, a3); } if (a1 < a2) { swap(a1, a2); } if (a2 < a3) { swap(a2, a3); } if (a1 < 0 || a2 < 0 || a3 < 0) { return 0; } sum = a1 - a2 + a1 - a3; if (sum > n - k) { return 0; } if ((n - k - sum) % 3 == 0) { return 1; } return 0; } int task() { long long i, n, k, d1, d2, a1, a2, a3; cin >> n; ; cin >> k; ; cin >> d1; ; cin >> d2; ; a1 = k + 2 * d1 + d2; if (a1 % 3 == 0) { a1 = a1 / 3; a2 = a1 - d1; a3 = a2 - d2; if (calc(n, k, a1, a2, a3)) { return 1; } } a1 = k + 2 * d1 - d2; if (a1 % 3 == 0) { a1 = a1 / 3; a2 = a1 - d1; a3 = a2 + d2; if (calc(n, k, a1, a2, a3)) { return 1; } } a1 = k - 2 * d1 + d2; if (a1 % 3 == 0) { a1 = a1 / 3; a2 = a1 + d1; a3 = a2 - d2; if (calc(n, k, a1, a2, a3)) { return 1; } } a1 = k - 2 * d1 - d2; if (a1 % 3 == 0) { a1 = a1 / 3; a2 = a1 + d1; a3 = a2 + d2; if (calc(n, k, a1, a2, a3)) { return 1; } } return 0; } int main(int argc, char const *argv[]) { int i, t; string yes( yes ); string no( no ); cin >> t; ; for (i = 0; i < t; i++) { if (task()) { cout << yes << endl; ; } else { cout << no << endl; ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q, f[1000010], mn, rt, ans; int cnt, head[1000010], to[2000010], nxt[2000010]; void add(int x, int y) { cnt++; to[cnt] = y; nxt[cnt] = head[x]; head[x] = cnt; } void dfs(int x, int fa, int now) { f[x] = now; for (int i = head[x]; i; i = nxt[i]) { int y = to[i]; if (y == fa) { continue; } dfs(y, x, min(now, y)); } } int main() { scanf( %d%d , &n, &q); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y); add(y, x); } q--; scanf( %d , &rt); scanf( %d , &rt); rt = rt % n + 1; mn = rt; dfs(rt, 0, rt); while (q--) { int op, x; scanf( %d%d , &op, &x); x = (x + ans) % n + 1; if (op == 1) { mn = min(mn, f[x]); } else { ans = min(mn, f[x]); printf( %d n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, a, b; cin >> n >> a >> b; for (long long i = 0; i <= n; ++i) { if (a * i > n) { break; } long long cur = a * i; if (n - cur >= 0 && (n - cur) % b == 0) { cout << YES n ; cout << i << << (n - cur) / b; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int t; long long r, g, b, k = 0; long long a[4]; int main() { cin >> t; while (t--) { cin >> a[1] >> a[2] >> a[3]; sort(a + 1, a + 1 + 3); k = a[1] + a[2]; if (a[3] >= k) cout << k << endl; else { k -= a[3]; r = min(a[1], k / 2) + a[3]; cout << r << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1000 * 1000 + 50; vector<int> v[maxN]; int cnt; bool mark[maxN]; void dfs(int s) { mark[s] = 1; cnt++; for (int i = 0; i < v[s].size(); i++) if (mark[v[s][i]] == 0) dfs(v[s][i]); } int main() { int n, m, k, sum = 0, com = 0; cin >> n >> m >> k; for (int i = 1; i <= m; i++) { int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } for (int i = 1; i <= n; i++) if (mark[i] == 0) { com++; cnt = 0; dfs(i); sum += min(k, cnt); } if (k == 1) cout << max(0, com - 2) << endl; else cout << max(0, com - 1 - (sum / 2)) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string x; int i; cin >> x; for (i = 0; x[i]; i++) { if (i == 0 && x[i] == 57) x[i] = x[i]; else if (x[i] >= 53) x[i] = (57 - x[i]) + 48; cout << x[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 105; struct Point { long long x, y; Point() { x = y = 0; } Point(long long _x, long long _y) { x = _x; y = _y; } void input() { cin >> x >> y; } Point operator+(const Point &a) const { return Point(x + a.x, y + a.y); } Point operator-(const Point &a) const { return Point(x - a.x, y - a.y); } Point Rotate(const Point &a) const { return Point(-a.y, a.x); } long long modul(void) const { return 1LL * x + 1LL * y; } bool operator<(const Point &a) const { return (x == a.x ? y < a.y : x < a.x); } bool operator==(const Point &a) const { return (x == a.x && y == a.y); } }; Point rotation(const Point &o, const Point &a, long long t) { Point res = a; while (t--) { res = o + o.Rotate(res - o); } return res; } long long dis(Point u, Point v) { long long dx = u.x - v.x; long long dy = u.y - v.y; return dx * dx + dy * dy; } bool isSquare(vector<Point> &u) { vector<Point> mi = u; sort(mi.begin(), mi.end()); map<long long, long long> xx, yy; for (long long i = 0; i < mi.size(); i++) { xx[mi[i].x]++; yy[mi[i].y]++; if (xx[mi[i].x] == 3 || yy[mi[i].y] == 3) return 0; } vector<long long> d; for (long long i = 0; i < 4; i++) { for (long long j = i + 1; j < 4; j++) d.push_back(dis(mi[i], mi[j])); } sort(d.begin(), d.end()); if (d[0] == d[3] && d[4] == d[5] && d[0] && d[3] + d[0] == d[4]) return 1; return 0; } bool isRectangle(vector<Point> &u) { vector<Point> mi = u; sort(mi.begin(), mi.end()); map<long long, long long> xx, yy; for (long long i = 0; i < mi.size(); i++) { xx[mi[i].x]++; yy[mi[i].y]++; if (xx[mi[i].x] == 3 || yy[mi[i].y] == 3) return 0; } vector<long long> d; for (long long i = 0; i < 4; i++) { for (long long j = i + 1; j < 4; j++) d.push_back(dis(mi[i], mi[j])); } sort(d.begin(), d.end()); if (d[0] == d[1] && d[2] == d[3] && d[4] == d[5] && d[0] && d[0] + d[2] == d[5]) return 1; return 0; } void run() { Point pos[9]; int col[9]; for (long long i = 1; i <= 8; i++) { pos[i].input(); } bool ok = 0; for (int i = 1; i <= 8; i++) { for (int j = i + 1; j <= 8; j++) { for (int k = j + 1; k <= 8; k++) { for (int t = k + 1; t <= 8; t++) { for (long long run = 1; run <= 8; run++) col[run] = (run == j || run == k || run == t || run == i); vector<Point> rec; vector<Point> square; for (long long run = 1; run <= 8; run++) if (col[run]) rec.push_back(pos[run]); else square.push_back(pos[run]); if (!isSquare(square)) continue; if (!isRectangle(rec)) continue; cout << YES << endl; for (long long run = 1; run <= 8; run++) if (!col[run]) cout << run << ; cout << endl; for (long long run = 1; run <= 8; run++) if (col[run]) cout << run << ; return; } } } } cout << NO ; } int main() { ios_base::sync_with_stdio(false); run(); } |
#include <bits/stdc++.h> using namespace std; int i, j, n, k, tot, ans, sum; int a[100005]; string st; char ch; int main() { ios::sync_with_stdio(false); cin >> n; if (n == 2) { cout << 3 << endl; return 0; } if (n == 3) { cout << 5 << endl; return 0; } for (i = 1; i <= 100; i++) { if (i % 2 == 0) continue; j = (i * i + 1) / 2; if (j >= n) break; } cout << i << endl; } |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <int, int> ii; const int Maxn = 200005; const ll Inf = 1000000000000000000ll; int T; int n; vector <int> neigh[Maxn]; int a[Maxn]; int mylvl[Maxn]; vector <ii> L[Maxn]; int mxlvl; ll best[Maxn]; ll dp[Maxn]; void Traverse(int v, int p, int lvl) { mylvl[v] = lvl; L[lvl].push_back(ii(a[v], v)); mxlvl = max(mxlvl, lvl); for (int i = 0; i < neigh[v].size(); i++) { int u = neigh[v][i]; if (u == p) continue; Traverse(u, v, lvl + 1); } } int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); for (int i = 1; i <= n; i++) neigh[i].clear(); for (int i = 2; i <= n; i++) { int a; scanf( %d , &a); neigh[i].push_back(a); neigh[a].push_back(i); } for (int i = 2; i <= n; i++) scanf( %d , &a[i]); mxlvl = 0; Traverse(1, 0, 0); for (int i = mxlvl; i >= 0; i--) { sort(L[i].begin(), L[i].end()); ll all = -Inf, notall = -Inf; for (int j = 0; j < L[i].size(); j++) { int v = L[i][j].second; best[v] = 0; for (int z = 0; z < neigh[v].size(); z++) { int u = neigh[v][z]; if (mylvl[u] <= mylvl[v]) continue; best[v] = max(best[v], dp[u]); } all = max(all, best[v] - L[i][j].first); notall = max(notall, -ll(L[i][j].first)); dp[v] = max(all + L[i][j].first, notall + L[i][j].first + best[v]); } all = -Inf, notall = -Inf; for (int j = int(L[i].size()) - 1; j >= 0; j--) { int v = L[i][j].second; dp[v] = max(dp[v], max(all - L[i][j].first, notall - L[i][j].first + best[v])); all = max(all, best[v] + L[i][j].first); notall = max(notall, ll(L[i][j].first)); } L[i].clear(); } printf( %I64d n , dp[1]); } return 0; } |
#include <bits/stdc++.h> const long long md = (1e9 + 7); const long long fakmd = 998244353; using namespace std; long long n, m; pair<long long, long long> a[100100]; long long ans[100100]; int32_t main() { cin >> n >> m; long long it = 1; long long sum = 0; for (long long i = 1; i <= m; i++) { cin >> a[i].first; sum += a[i].first; a[i].second = i; } if (sum < n) { return cout << -1, 0; } for (long long i = 1; i <= m; i++) { sum -= a[i].first; long long ln = max((n - it + 1) - sum, 1ll); if (ln > a[i].first || it + a[i].first - 1 > n) { return cout << -1, 0; } ans[a[i].second] = it; it += ln; } if (it < n) { cout << -1; } else { for (long long i = 1; i <= m; i++) { cout << ans[i] << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void clear(T &x) { T t; x.swap(t); } template <class T> void miz(T &a, T b) { if (b < a) a = b; } template <class T> void maz(T &a, T b) { if (b > a) a = b; } template <class T> T gcd(T a, T b) { while (b) { a %= b; swap(a, b); } return a; } struct Shoe { int p, i; Shoe() {} Shoe(int p, int i) : p(p), i(i) {} }; struct Customer { int m, f, i; bool operator<(const Customer &q) const { return f < q.f; } }; const int CMAX = 100000; map<int, Shoe> bst; int C; Customer cus[CMAX]; Shoe sa[CMAX], sb[CMAX]; long long dp[CMAX][2][2]; int pd[CMAX][2][2]; void MAZ(int i, int j, int k, long long v1, int v2) { if (v1 > dp[i][j][k]) { dp[i][j][k] = v1; pd[i][j][k] = v2; } } void solve() { int i, j, k; long long x; for (i = C - 1; i >= 0; i--) { for (j = 0; j < 2; j++) { for (k = 0; k < 2; k++) { if (i != C - 1) { if (cus[i + 1].f == cus[i].f) { dp[i][j][k] = dp[i + 1][j][k]; } else if (cus[i + 1].f == cus[i].f + 1) { dp[i][j][k] = dp[i + 1][k][0]; } else { dp[i][j][k] = dp[i + 1][0][0]; } } if (!j && cus[i].m >= sa[i].p) { if (i == C - 1) { x = 0; } else if (cus[i + 1].f == cus[i].f) { x = dp[i + 1][1][k]; } else if (cus[i + 1].f == cus[i].f + 1) { x = dp[i + 1][k][0]; } else { x = dp[i + 1][0][0]; } MAZ(i, j, k, sa[i].p + x, 1); } if (!k && cus[i].m >= sb[i].p) { if (i == C - 1) { x = 0; } else if (cus[i + 1].f == cus[i].f) { x = dp[i + 1][j][1]; } else if (cus[i + 1].f == cus[i].f + 1) { x = dp[i + 1][1][0]; } else { x = dp[i + 1][0][0]; } MAZ(i, j, k, sb[i].p + x, 2); } } } } printf( %I64d n , dp[0][0][0]); vector<pair<int, int> > ans; i = 0; j = 0; k = 0; while (1) { if (pd[i][j][k] == 0) { if (i == C - 1) { break; } else if (cus[i + 1].f == cus[i].f) { i++; } else if (cus[i + 1].f == cus[i].f + 1) { i++; j = k; k = 0; } else { i++; j = 0; k = 0; } } else if (pd[i][j][k] == 1) { ans.push_back(make_pair(cus[i].i, sa[i].i)); if (i == C - 1) { break; } else if (cus[i + 1].f == cus[i].f) { i++; j = 1; } else if (cus[i + 1].f == cus[i].f + 1) { i++; j = k; k = 0; } else { i++; j = 0; k = 0; } } else if (pd[i][j][k] == 2) { ans.push_back(make_pair(cus[i].i, sb[i].i)); if (i == C - 1) { break; } else if (cus[i + 1].f == cus[i].f) { i++; k = 1; } else if (cus[i + 1].f == cus[i].f + 1) { i++; j = 1; k = 0; } else { i++; j = 0; k = 0; } } } printf( %d n , ans.size()); for (i = 0; i < ans.size(); i++) printf( %d %d n , ans[i].first, ans[i].second); } void GetShoe(int s, Shoe &shoe) { map<int, Shoe>::iterator it; it = bst.find(s); shoe = (it != bst.end() ? it->second : Shoe(INT_MAX, -1)); } void input() { int S, i; scanf( %d , &S); for (i = 1; i <= S; i++) { int p, s; scanf( %d%d , &p, &s); bst.insert(make_pair(s, Shoe(p, i))); } scanf( %d , &C); for (i = 0; i < C; i++) { scanf( %d%d , &cus[i].m, &cus[i].f); cus[i].i = i + 1; } sort(cus, cus + C); for (i = 0; i < C; i++) { GetShoe(cus[i].f, sa[i]); GetShoe(cus[i].f + 1, sb[i]); } } int main() { input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long k, d, t; cin >> k >> d >> t; if (k % d == 0) { printf( %lld n , t); } else { unsigned long long num = k / d; unsigned long long num1 = k % d; unsigned long long t1 = (num + 1) * d; double onezhi = num * d + (d - num1) * 0.5 + num1; unsigned long long ans1 = t / onezhi; double t2 = t - onezhi * ans1; double ans; if (t2 <= k) { ans = t2 + t1 * ans1; } else { ans = t1 * ans1 + k + (t2 - k) * 2; } printf( %.9lf n , ans); } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 51, MOD = 998244353; int n, res; int p[MAXN][MAXN], fact[MAXN], finv[MAXN]; inline int read() { register int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar(); } if (ch == - ) { neg = -1; ch = getchar(); } while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch - 0 ); ch = getchar(); } return num * neg; } inline int qpow(int base, int exponent) { int res = 1; while (exponent) { if (exponent & 1) { res = (long long int)res * base % MOD; } base = (long long int)base * base % MOD, exponent >>= 1; } return res; } inline void setup(int cnt) { fact[0] = fact[1] = finv[0] = 1; for (register int i = 0; i <= cnt; i++) { p[i][0] = 1; } for (register int i = 1; i <= cnt; i++) { for (register int j = 1; j <= i; j++) { p[i][j] = ((long long int)(i - j) * p[i - 1][j - 1] % MOD + (long long int)(j + 1) * p[i - 1][j] % MOD) % MOD; } } for (register int i = 2; i <= cnt; i++) { fact[i] = (long long int)fact[i - 1] * i % MOD; } finv[cnt] = qpow(fact[cnt], MOD - 2); for (register int i = cnt - 1; i; i--) { finv[i] = (long long int)finv[i + 1] * (i + 1) % MOD; } } inline int binom(int m, int n) { return (long long int)fact[m] * finv[n] % MOD * finv[m - n] % MOD; } int main() { setup(n = read()); for (register int k = 0; k < n; k++) { res = 0; for (register int i = max(k, 1); i <= n; i++) { res = (res + (long long int)binom(n, i) * p[i][k] % MOD * fact[n - i] % MOD) % MOD; } printf( %d , res); } puts( ); } |
#include <bits/stdc++.h> using namespace std; int pgcd(int a, int b) { if (b % a == 0) return a; pgcd(b % a, a); } int main() { int o = 0, gcd, az[1001], t[5000], j, k = 0, m, x, y, i, a, b, n; cin >> a >> b >> n; gcd = pgcd(a, b); for (i = 1; i * i <= gcd; i++) { if (gcd % i == 0) { t[k] = i; k++; t[k] = gcd / i; k++; } } for (i = 0; i < n; i++) { m = -1; cin >> x >> y; for (j = 0; j < k; j++) { if (t[j] <= y && t[j] >= x) m = max(m, t[j]); } cout << m << endl; } } |
#include <bits/stdc++.h> using namespace std; int x, y, x2, y2; int v; vector<int> mass1, mass2; int check1(int ind) { if (ind == -1 || ind == (int)mass1.size()) { return 1e9; } return abs(mass1[ind] - x) + abs(x2 - mass1[ind]) + (y2 - y + v - 1) / v; } int check2(int ind) { if (ind == -1 || ind == (int)mass2.size()) { return 1e9; } return abs(mass2[ind] - x) + abs(x2 - mass2[ind]) + (y2 - y); } signed main() { int n, m, c1, c2; cin >> n >> m >> c1 >> c2 >> v; mass1.resize(c2); mass2.resize(c1); for (int i = 0; i < c1; i++) { cin >> mass2[i]; } for (int i = 0; i < c2; i++) { cin >> mass1[i]; } int q; cin >> q; while (q--) { cin >> x >> y >> x2 >> y2; swap(x, y); swap(x2, y2); if (x > x2) { swap(x, x2); } if (y > y2) { swap(y, y2); } int ans = 1e9; if (y == y2) { ans = x2 - x; } int l1 = lower_bound(mass1.begin(), mass1.end(), x) - mass1.begin(); ans = min(ans, check1(l1)); ans = min(ans, check1(l1 - 1)); l1 = lower_bound(mass1.begin(), mass1.end(), x2) - mass1.begin(); ans = min(ans, check1(l1)); ans = min(ans, check1(l1 - 1)); l1 = lower_bound(mass2.begin(), mass2.end(), x) - mass2.begin(); ans = min(ans, check2(l1)); ans = min(ans, check2(l1 - 1)); l1 = lower_bound(mass2.begin(), mass2.end(), x2) - mass2.begin(); ans = min(ans, check2(l1)); ans = min(ans, check2(l1 - 1)); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; const int N = 2000 + 10; int n; int pa, pb, p, q; int cp[N][N]; int strong[N]; int f[N]; void add(int &t, int s) { t += s; if (t >= MOD) t -= MOD; } void mul(int &t, int s) { t = (long long)t * s % MOD; } int pow(int s, int n) { long long ret = 1; while (n) if (n % 2) ret = ret * s % MOD, n--; else s = (long long)s * s % MOD, n >>= 1; return ret; } int inv(int s) { return pow(s, MOD - 2); } int main() { cin >> n >> pa >> pb; p = (long long)pa * inv(pb) % MOD; q = (MOD - p + 1) % MOD; f[0] = 0; f[1] = 0; cp[0][0] = 1; for (int i = 1; i <= n; i++) { cp[i][0] = 1; for (int j = 1; j <= i; j++) { cp[i][j] = ((long long)cp[i - 1][j - 1] * pow(q, i - j) + (long long)cp[i - 1][j] * pow(p, j)) % MOD; } } strong[1] = 1; for (int i = 2; i <= n; i++) { int res = 0; for (int j = 1; j < i; j++) { int tmp = strong[j]; mul(tmp, cp[i][j]); add(res, tmp); } strong[i] = (1 - res + MOD) % MOD; } for (int s = 2; s <= n; s++) { int res = 0; for (int i = 1; i < s; i++) { int cur = 1; mul(cur, strong[i]); mul(cur, cp[s][i]); int games = 0; add(games, i * (s - i)); add(games, i * (i - 1) / 2); add(games, f[i]); add(games, f[s - i]); mul(cur, games); add(res, cur); } int coeff = 1; mul(coeff, strong[s]); mul(coeff, cp[s][s]); int tmp = coeff; mul(tmp, s * (s - 1) / 2); add(res, tmp); coeff = (1 + MOD - coeff) % MOD; mul(res, inv(coeff)); f[s] = res; } cout << f[n] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> vector<T>& operator--(vector<T>& v) { for (auto& i : v) --i; return v; } template <typename T> vector<T>& operator++(vector<T>& v) { for (auto& i : v) ++i; return v; } template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (auto& i : v) is >> i; return is; } template <typename T> ostream& operator<<(ostream& os, vector<T> v) { for (auto& i : v) os << i << ; return os; } template <typename T, typename U> pair<T, U>& operator--(pair<T, U>& p) { --p.first; --p.second; return p; } template <typename T, typename U> pair<T, U>& operator++(pair<T, U>& p) { ++p.first; ++p.second; return p; } template <typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template <typename T, typename U> ostream& operator<<(ostream& os, pair<T, U> p) { os << p.first << << p.second; return os; } template <typename T, typename U> pair<T, U> operator-(pair<T, U> a, pair<T, U> b) { return mp(a.first - b.first, a.second - b.second); } template <typename T, typename U> pair<T, U> operator+(pair<T, U> a, pair<T, U> b) { return mp(a.first + b.first, a.second + b.second); } template <typename T, typename U> void umin(T& a, U b) { if (a > b) a = b; } template <typename T, typename U> void umax(T& a, U b) { if (a < b) a = b; } bool prime(long long n) { for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) { return false; } } return true; } long long fact(long long x) { long long ans = 1; for (long long i = 2; i <= x; i++) ans *= i; return ans; } void solve() { long long n; cin >> n; vector<long long> a(n); cin >> a; if (n == 1) { cout << 0 << endl; return; } long long ans = 0; for (long long i = 0; i < n; i++) { long long cnt = 0; if ((i == 0 && a[i + 1] == 2) || (i == n - 1 && a[i - 1] == 999) || (i > 0 && i + 1 < n && a[i + 1] - a[i - 1] == 2)) { while (i < n) { if (i == 0) { if (a[i + 1] == 2) { cnt++; i++; } else { break; } } else if (i == n - 1) { if (a[i - 1] == 999) { cnt++; i++; } else { break; } } else { if (a[i + 1] - a[i - 1] == 2) { cnt++; i++; } else { break; } } } i--; ans = max(ans, cnt); } } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); } |
#include <bits/stdc++.h> using namespace std; long long Tc, a, b, n, m; int main() { long long ans = 0; cin >> n >> m; if (m % n != 0) { cout << -1 n ; return 0; } m /= n; while (m % 2 == 0) { m /= 2; ans++; } while (m % 3 == 0) { m /= 3; ans++; } (m > 1) ? cout << -1 : cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = (int)2e5 + 5; const int maxM = (int)2e5 + 5; inline int readInt() { char c; int tmp = 0, x = 1; c = getchar(); while (c > 9 || c < 0 ) { if (c == - ) x = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { tmp = tmp * 10 + c - 0 ; c = getchar(); } return tmp * x; } vector<int> g[maxN]; void addEdge(int u, int v) { g[u].push_back(v); g[v].push_back(u); } int Father[maxN], Ranking[maxN]; void init(int n) { for (int i = 1; i <= n; i++) Father[i] = i; } int getFather(int x) { return x == Father[x] ? x : Father[x] = getFather(Father[x]); } void mergeUnion(int u, int v) { int Fu = getFather(u), Fv = getFather(v); if (Fu == Fv) return; if (Ranking[Fu] > Ranking[Fv]) swap(Fu, Fv); Father[Fu] = Fv; Ranking[Fv] += Ranking[Fu]; } int n, m, s[maxN], ans[maxM]; pair<int, int> rec[maxM]; int dep[maxN], Sum[maxN]; void dfs(int v, int fa) { dep[v] = (fa == -1 ? 1 : dep[fa] + 1); Sum[v] = s[v]; for (int i = 0; i < (int)g[v].size(); i++) { if (g[v][i] != fa) dfs(g[v][i], v), Sum[v] += Sum[g[v][i]]; } } int main() { n = readInt(); int tot = 0; for (int i = 1; i <= n; i++) s[i] = readInt(), tot += s[i]; if (tot) { printf( Impossible n ); exit(0); } else printf( Possible n ); m = readInt(); init(n); int u, v; for (int i = 1; i <= m; i++) { u = readInt(), v = readInt(); if (getFather(u) != getFather(v)) { addEdge(u, v); mergeUnion(u, v); rec[i] = make_pair(u, v); } } dfs(1, -1); for (int i = 1; i <= m; i++) { if (!rec[i].first && !rec[i].second) continue; if (dep[rec[i].first] < dep[rec[i].second]) ans[i] = Sum[rec[i].second]; else ans[i] = -Sum[rec[i].first]; } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 200005, m1 = 998244353, m2 = 1e9 + 9; char s[N], c[N]; long long n, z[N], p1[N] = {1}, p2[N] = {1}, a[N]; pair<long long, long long> tr[N << 2]; struct Hash { long long h1[N], h2[N]; char s[N]; void init() { h1[0] = h2[0] = s[0] - a ; for (long long i = 1; i < n; i++) { h1[i] = (h1[i - 1] * 31 + s[i] - a ) % m1; h2[i] = (h2[i - 1] * 255 + s[i] - a ) % m2; p1[i] = p1[i - 1] * 31 % m1; p2[i] = p2[i - 1] * 255 % m2; } } pair<long long, long long> query(long long l, long long r) { return make_pair( (h1[r] - (l == 0 ? 0 : h1[l - 1] * p1[r - l + 1] % m1) + m1) % m1, (h2[r] - (l == 0 ? 0 : h2[l - 1] * p2[r - l + 1] % m2) + m2) % m2); } } h1, h2; struct node { long long x, y, l, p, k; node() {} node(long long _x, long long _y, long long _l, long long _p, long long _k) : x(_x), y(_y), l(_l), p(_p), k(_k) {} bool operator<(const node zh) const { return l + l + k < zh.l + zh.l + zh.k; } } ans; long long check(long long i, long long m) { return h1.query(i - m, i) == h2.query(n - (i + m) - 1, n - i - 1); } void build(long long k, long long l, long long r) { if (l == r) { tr[k] = make_pair(a[l - 1], l - 1); return; } long long mid = l + r >> 1; build(k << 1, l, mid); build(k << 1 | 1, mid + 1, r); tr[k] = max(tr[k << 1], tr[k << 1 | 1]); } pair<long long, long long> query(long long k, long long l, long long r, long long a, long long b) { if (l == a && r == b) return tr[k]; long long mid = l + r >> 1; if (b <= mid) return query(k << 1, l, mid, a, b); else if (a > mid) return query(k << 1 | 1, mid + 1, r, a, b); else return max(query(k << 1, l, mid, a, mid), query(k << 1 | 1, mid + 1, r, mid + 1, b)); } pair<long long, long long> xzh(long long x, long long y) { long long l = 0, r = (y - x) / 2 + 1; while (r - l > 1) { long long m = l + r >> 1; pair<long long, long long> k = query(1, 1, n, (x + m) + 1, (y - m) + 1); if (k.first >= m) l = m; else r = m; } return query(1, 1, n, (x + l) + 1, (y - l) + 1); } signed main() { scanf( %s , s); n = strlen(s); for (long long i = 0; i < n; i++) c[i] = s[n - i - 1]; c[n] = $ ; for (long long i = n + 1; i <= 2 * n; i++) c[i] = s[i - n - 1]; long long l = 0, r = 0; for (long long i = 1; i <= 2 * n; i++) { if (i > r) { l = i, r = i; while (r <= 2 * n && c[r - l] == c[r]) r++; z[i] = r - l; r--; } else { long long k = i - l; if (z[k] < r - i + 1) z[i] = z[k]; else { l = i; while (r <= 2 * n && c[r - l] == c[r]) r++; z[i] = r - l; r--; } } } if (z[n + 1] == n) { printf( 1 n1 %I64d n , n - !(n & 1)); return 0; } for (long long i = 0; i < n; i++) { h1.s[i] = s[i]; h2.s[i] = s[n - i - 1]; } h1.init(), h2.init(); for (long long i = 0; i < n; i++) { long long l = 0, r = min(i, n - i - 1) + 1; while (r - l > 1) { long long m = l + r >> 1; if (check(i, m)) l = m; else r = m; } a[i] = l; } build(1, 1, n); for (long long i = 0; i < n; i++) { long long x = i, l = z[i + n + 1], y = n - l; if (l == 0 || x + l > y - 1) continue; pair<long long, long long> zh = xzh(x + l, y - 1); long long k = zh.first; k = min(k, y - x - l); k = min(k, min(zh.second - (x + l), y - 1 - zh.second)); long long p = zh.second - k; k = 2 * k + 1; node q = node(x, y, l, p, k); if (ans < q) ans = q; } long long zh = 0; for (long long i = 0; i < n; i++) if (a[i] > a[zh]) zh = i; if (2 * a[zh] + 1 > ans.l + ans.l + ans.k) printf( 1 n%I64d %I64d n , zh - a[zh] + 1, 2 * a[zh] + 1); else printf( 3 n%I64d %I64d n%I64d %I64d n%I64d %I64d n , ans.x + 1, ans.l, ans.p + 1, ans.k, ans.y + 1, ans.l); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline int size(const T& c) { return c.size(); } using namespace std; int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } const int maxn = 1000 + 10; int a[maxn][maxn]; int u, x, y; int h[4][maxn][maxn]; int res; vector<int> st; int s[maxn]; int n, m, q; int vt[maxn]; int cal(int bd, int x) { st.push_back(0); int top = 0; memset(vt, 0, sizeof(vt)); memset(s, 0, sizeof(s)); s[top] = 0; int res = 0; for (int i = 1; i < st.size(); i++) { int temp = i; while (top > 0 && s[top] > st[i]) { if (bd + i - 2 >= x && x >= bd + vt[top] - 1) res = max(res, (i - vt[top]) * s[top]); temp = vt[top]; top--; } if (s[top] != st[i]) { top++; s[top] = st[i]; vt[top] = temp; } } return res; } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (a[i][j] == 0) h[0][i][j] = 0; else h[0][i][j] = h[0][i - 1][j] + 1; } for (int i = n; i >= 1; i--) for (int j = 1; j <= m; j++) { if (a[i][j] == 0) h[1][i][j] = 0; else h[1][i][j] = h[1][i + 1][j] + 1; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (a[i][j] == 0) h[2][i][j] = 0; else h[2][i][j] = h[2][i][j - 1] + 1; } for (int i = 1; i <= n; i++) for (int j = m; j >= 1; j--) { if (a[i][j] == 0) h[3][i][j] = 0; else h[3][i][j] = h[3][i][j + 1] + 1; } for (int cq = 1; cq <= q; cq++) { scanf( %d%d%d , &u, &y, &x); if (u == 1) { a[y][x] = a[y][x] ^ 1; for (int i = 1; i <= n; i++) if (a[i][x] == 0) h[0][i][x] = 0; else h[0][i][x] = h[0][i - 1][x] + 1; for (int i = n; i >= 1; i--) if (a[i][x] == 0) h[1][i][x] = 0; else h[1][i][x] = h[1][i + 1][x] + 1; for (int j = 1; j <= m; j++) if (a[y][j] == 0) h[2][y][j] = 0; else h[2][y][j] = h[2][y][j - 1] + 1; for (int j = m; j >= 1; j--) if (a[y][j] == 0) h[3][y][j] = 0; else h[3][y][j] = h[3][y][j + 1] + 1; } if (u == 2) { res = 0; st.clear(); st.push_back(0); for (int i = y - h[0][y][x] + 1; i <= y + h[1][y][x] - 1; i++) st.push_back(h[2][i][x]); res = max(res, cal(y - h[0][y][x] + 1, y)); st.clear(); st.push_back(0); for (int i = y - h[0][y][x] + 1; i <= y + h[1][y][x] - 1; i++) st.push_back(h[3][i][x]); res = max(res, cal(y - h[0][y][x] + 1, y)); st.clear(); st.push_back(0); for (int j = x - h[2][y][x] + 1; j <= x + h[3][y][x] - 1; j++) st.push_back(h[0][y][j]); res = max(res, cal(x - h[2][y][x] + 1, x)); st.clear(); st.push_back(0); for (int j = x - h[2][y][x] + 1; j <= x + h[3][y][x] - 1; j++) st.push_back(h[1][y][j]); res = max(res, cal(x - h[2][y][x] + 1, x)); cout << res << endl; } } fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 100000; int a[MaxN]; int color[MaxN]; bool f = true; int n; int main() { int n, k; cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> a[i]; sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1); while (n % k) { a[n + 1] = a[n]; n++; } int ans = 0; for (int i = 0; i < n / k; ++i) { ans += (2 * (a[k * i + 1] - 1)); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 200050; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int isprime(int x) { for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) return 0; } return 1; } int judge(char ch) { if (ch == a || ch == u ) return 1; else return 0; } vector<int> e[maxn]; int ans[maxn]; vector<int> v[maxn]; void dfs(int x) { for (int i = 0; i < e[x].size(); i++) { dfs(e[x][i]); for (int j = 0; j < v[e[x][i]].size(); j++) { v[x].push_back(v[e[x][i]][j]); } } } int main() { int n; string a, b; cin >> n >> a >> b; int maxsub[3] = {0}; int adds = 0; int flg = 0; for (int i = 0; i < n / 2; i++) { char s[4]; s[0] = a[i]; s[1] = a[n - i - 1]; s[2] = b[i]; s[3] = b[n - i - 1]; if (a[i] == b[i] && s[1] == s[3]) { continue; } else if (a[i] == b[i] || s[1] == s[3]) { adds++; continue; } else if ((s[0] == s[1] && s[2] == s[3])) { continue; } else if (s[0] == s[3] && s[1] == s[2]) { continue; } else if (s[2] == s[3]) { adds++; } else if (s[0] == s[3] || s[1] == s[2]) { adds++; } else { adds += 2; } } if (n % 2 == 1) { if (a[n / 2] != b[n / 2]) adds++; } int sub = 0; if (maxsub[2] >= 2) sub = 4; else if (maxsub[2] == 1) sub = 2 + min(maxsub[1], 1); else if (maxsub[2] == 0) sub = min(maxsub[1], 2); cout << adds - sub; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long a, b; cin >> a >> b; if (a == b) { cout << infinity << n ; return 0; } if (a < b) { cout << 0 << n ; return 0; } long long ans = 0; long long n = a - b; for (long long i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (i == n / i) { if (i > b) ans++; } else { if (i > b) ans++; if (n / i > b) ans++; } } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long i, j, t, a, b, m, n, c, d, y, x, k, s; t = 1; while (t--) { string s1, s2; cin >> s1 >> s2; if (s1 == s2) cout << s1; else cout << 1; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); int aweek = a / 3; int bweek = b / 2; int cweek = c / 2; int ans = min(aweek, min(bweek, cweek)); ans -= 2; ans = max(ans, 0); a -= ans * 3; b -= ans * 2; c -= ans * 2; ans *= 7; int tmp = 0; for (int i = 1; i <= 7; i++) { int tmpa = a, tmpb = b, tmpc = c; int total = 0; int cnt = i; while (true) { if (cnt == 1 || cnt == 4 || cnt == 7) { if (tmpa > 0) tmpa--; else break; } else if (cnt == 2 || cnt == 6) { if (tmpb > 0) tmpb--; else break; } else { if (tmpc > 0) tmpc--; else break; } total++; cnt++; if (cnt == 8) cnt = 1; } tmp = max(tmp, total); } printf( %d , ans + tmp); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; int n, m, q, times[maxn]; long long a[maxn]; int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= n; ++i) { int x; scanf( %d , &x); a[i] = (long long)(times[x]++) * m + x; } sort(a + 1, a + 1 + n); for (int i = 1; i <= n; ++i) a[i] -= i; while (q--) { long long k; scanf( %lld , &k); k += lower_bound(a + 1, a + 1 + n, k - n) - a - 1 - n; printf( %lld n , (k - 1) % m + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void _DBG(const char *s, _T x) { cerr << s << = << x << n ; } template <typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while (*s != , ) cerr << *s++; cerr << = << x << , ; _DBG(s + 1, a...); } template <typename TP> struct pSegmentTree { long long MAX; TP init; struct node { TP val; node *left = nullptr, *right = nullptr; long long l, r; node(long long L, long long R, TP v) : val(v), l(L), r(R) {} }; vector<node *> roots; pSegmentTree(long long n, TP zero) : init(zero) { MAX = 1LL << (64 - __builtin_clzll(n)); roots.push_back(new node(0, MAX - 1, init)); } void check(node *root) { long long m = (root->l + root->r) / 2; if (root->left == nullptr) root->left = new node(root->l, m, init); if (root->right == nullptr) root->right = new node(m + 1, root->r, init); } node *add(node *root, long long id, TP v) { node *res = new node(*root); res->val += v; if (res->l == res->r) return res; long long m = (res->l + res->r) / 2; check(res); if (id <= m) res->left = add(res->left, id, v); else res->right = add(res->right, id, v); return res; } TP ask(node *root, long long a, long long b) { if (root->r < a || b < root->l) return init; if (a <= root->l && root->r <= b) return root->val; check(root); return ask(root->left, a, b) + ask(root->right, a, b); } void update(long long id, TP v, int state = -1) { if (state == -1) state += (int)(roots).size(); assert(state < (int)(roots).size()); roots.push_back(add(roots[state], id, v)); } TP query(long long a, long long b, int state = -1) { if (state == -1) state += (int)(roots).size(); assert(state < (int)(roots).size()); return ask(roots[state], a, b); } }; const int N = 1e5 + 7; int n, k, t[N], p[N]; vector<int> pos[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> t[i]; pos[t[i]].push_back(i); if ((int)(pos[t[i]]).size() <= k) p[i] = 0; else p[i] = pos[t[i]][(int)(pos[t[i]]).size() - k - 1]; } pSegmentTree<int> tree(n + 7, 0); for (int i = 1; i <= n; i++) tree.update(p[i], 1); int q, last = 0; cin >> q; while (q--) { int l, r; cin >> l >> r; l = (l + last) % n + 1; r = (r + last) % n + 1; if (l > r) swap(l, r); last = tree.query(0, l - 1, r) - tree.query(0, l - 1, l - 1); cout << last << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[100002][2]; long long dp[100002][2][2]; int n; long long solve(int idx, int arga3, int dir) { if (idx == 1 && dir == 0) return 0; if (idx == n && dir == 1) return 0; long long &ret = dp[idx][arga3][dir]; if (ret != -1) return ret; ret = 0; int fd; if (dir == 0) fd = -1; else fd = 1; if (arga3) { int x = arr[idx][dir]; if (x % 2) x--; if (x) ret = max(ret, solve(idx + fd, arga3, dir) + x); } else { int x = arr[idx][dir]; if (x == 1) ret = max(ret, solve(idx + fd, false, dir) + 1); else if (x % 2) { ret = max(ret, solve(idx + fd, false, dir) + x); x--; ret = max(ret, solve(idx + fd, true, dir) + x); } else if (x) { ret = max(ret, solve(idx + fd, true, dir) + x); x--; ret = max(ret, solve(idx + fd, false, dir) + x); } } return ret; } int main() { cin >> n; for (long long i = 1; i <= n - 1; i++) { int x; cin >> x; arr[i][1] = x; arr[i + 1][0] = x; } memset(dp, -1, sizeof dp); long long ans = 0; for (long long i = 1; i <= n; i++) { if (i == 1) { int x = arr[i][1]; if (x == 1) { ans = max(ans, solve(2, false, 1) + 1); } else { if (x % 2) { ans = max(ans, solve(2, false, 1) + x); ans = max(ans, solve(2, true, 1) + x - 1); } else { ans = max(ans, solve(2, true, 1) + x); ans = max(ans, solve(2, false, 1) + x - 1); } } } else if (i == n) { int x = arr[n][0]; if (x == 1) { ans = max(ans, solve(n - 1, false, 0) + 1); } else { if (x % 2) { ans = max(ans, solve(n - 1, false, 0) + x); ans = max(ans, solve(n - 1, true, 0) + x - 1); } else { ans = max(ans, solve(n - 1, true, 0) + x); ans = max(ans, solve(n - 1, false, 0) + x - 1); } } } else { if (arr[i][0] % 2 && arr[i][1] % 2) { long long y7 = 0, ym = 0, s7 = 0, sm = 0; if (arr[i][1] - 1) y7 = solve(i + 1, true, 1) + arr[i][1] - 1; ym = solve(i + 1, false, 1) + arr[i][1]; if (arr[i][0] - 1) s7 = solve(i - 1, true, 0) + arr[i][0] - 1; sm = solve(i - 1, false, 0) + arr[i][0]; ans = max(ans, y7 + s7); ans = max(ans, y7 + sm); ans = max(ans, ym + s7); } else if (arr[i][1] % 2) { long long y7 = 0, ym = 0, s7 = 0, sm = 0; if (arr[i][1] - 1) y7 = solve(i + 1, true, 1) + arr[i][1] - 1; ym = solve(i + 1, false, 1) + arr[i][1]; s7 = solve(i - 1, true, 0) + arr[i][0]; sm = solve(i - 1, false, 0) + arr[i][0] - 1; ans = max(ans, y7 + s7); ans = max(ans, y7 + sm); ans = max(ans, ym + s7); } else if (arr[i][0] % 2) { long long y7 = 0, ym = 0, s7 = 0, sm = 0; y7 = solve(i + 1, true, 1) + arr[i][1]; ym = solve(i + 1, false, 1) + arr[i][1] - 1; if (arr[i][0] - 1) s7 = solve(i - 1, true, 0) + arr[i][0] - 1; sm = solve(i - 1, false, 0) + arr[i][0]; ans = max(ans, y7 + s7); ans = max(ans, y7 + sm); ans = max(ans, ym + s7); } else { long long y7 = 0, ym = 0, s7 = 0, sm = 0; y7 = solve(i + 1, true, 1) + arr[i][1]; ym = solve(i + 1, false, 1) + arr[i][1] - 1; s7 = solve(i - 1, true, 0) + arr[i][0]; sm = solve(i - 1, false, 0) + arr[i][0] - 1; ans = max(ans, y7 + s7); ans = max(ans, y7 + sm); ans = max(ans, ym + s7); } } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { string s; cin >> s; int zero = 0, one = 0; for (char i : s) if (i == 0 ) zero++; else one++; if (min(zero, one) % 2 == 1) cout << DA n ; else cout << NET n ; } } |
#include <bits/stdc++.h> using namespace std; vector<pair<pair<int, int>, pair<int, int> > > way[222222]; queue<int> turn; bool was[222222]; int i, n, m, ans[222222], cost[222222]; int main() { cin >> n >> m; for (i = 1; i <= m; i++) { int a, b, c; cin >> a >> b >> c; cost[a] += c; cost[b] += c; way[a].push_back(make_pair(make_pair(i, c), make_pair(b, 0))); way[b].push_back(make_pair(make_pair(i, c), make_pair(a, 1))); } for (i = 1; i <= n; i++) cost[i] /= 2; turn.push(1); memset(was, 1, sizeof(was)); while (!turn.empty()) { int t = turn.front(); was[t] = 0; turn.pop(); for (i = 0; i < way[t].size(); i++) if (was[way[t][i].second.first]) { int u = way[t][i].second.first; ans[way[t][i].first.first] = way[t][i].second.second; cost[u] -= way[t][i].first.second; if (cost[u] == 0 && u != n) turn.push(u); } } for (i = 1; i <= m; i++) cout << ans[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> a[4]; vector<long long> sum[4]; int hasha[200050], hashb[200050]; int c[200050]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k, t; cin >> n >> m >> k; memset(hasha, 0, sizeof(hasha)); memset(hashb, 0, sizeof(hashb)); for (int i = 1; i <= n; i++) cin >> c[i]; cin >> t; for (int i = 0; i < t; i++) { int x; cin >> x; hasha[x] = 1; } cin >> t; for (int i = 0; i < t; i++) { int x; cin >> x; hashb[x] = 1; } for (int i = 1; i <= n; i++) { if (hasha[i] && hashb[i]) a[3].push_back(c[i]); else if (!hasha[i] && hashb[i]) a[2].push_back(c[i]); else if (hasha[i] && !hashb[i]) a[1].push_back(c[i]); else a[0].push_back(c[i]); } for (int i = 0; i < 4; i++) sort(a[i].begin(), a[i].end()); for (int i = 0; i < 4; i++) sum[i].push_back(0); for (int i = 0; i < 4; i++) { for (int j = 0; j < a[i].size(); j++) sum[i].push_back(sum[i].back() + a[i][j]); } long long ans = 1e18 + 1; for (int i = 0; i <= a[3].size(); i++) { long long cost = sum[3][i]; int need = max(0, k - i); if (need > a[1].size() || need > a[2].size() || i + need * 2 > m) continue; cost += sum[1][need], cost += sum[2][need]; int left = m - i - 2 * need; if (a[1].size() - need + a[2].size() - need + a[0].size() < left) continue; if (left > 0) { int l = 0, r = 1e9; while (l < r) { int mid = (l + r) / 2; int cnt = 0; int h = upper_bound(a[0].begin(), a[0].end(), mid) - a[0].begin(); cnt += max(0, h); h = upper_bound(a[1].begin(), a[1].end(), mid) - a[1].begin(); cnt += max(0, h - need); h = upper_bound(a[2].begin(), a[2].end(), mid) - a[2].begin(); cnt += max(0, h - need); if (cnt >= left) r = mid; else l = mid + 1; } int mid = l, cnt = 0; int h = upper_bound(a[0].begin(), a[0].end(), mid) - a[0].begin(); cnt += max(0, h); cost += sum[0][h]; h = upper_bound(a[1].begin(), a[1].end(), mid) - a[1].begin(); cnt += max(0, h - need); if (h > need) cost += sum[1][h] - sum[1][need]; h = upper_bound(a[2].begin(), a[2].end(), mid) - a[2].begin(); cnt += max(0, h - need); if (h > need) cost += sum[2][h] - sum[2][need]; if (cnt > left) cost -= mid * (cnt - left); } ans = min(ans, cost); } if (ans > 1e17) ans = -1; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; const long long int N = 10e5 + 10; const long long int M = 32767; long long int a[100050] = {0}; long long int b[100050] = {0}; int main() { long long int t; cin >> t; while (t--) { int n, k; int segment = 0; map<int, int> m; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); for (int i = 0; i < n - 1; i++) { m[b[i]] = b[i + 1]; } for (int i = 0; i < n - 1; i++) { if ((a[i + 1] != m[a[i]]) || (a[i] == b[n - 1])) { segment++; } } if (segment < k) { cout << Yes << endl; } else { cout << No << endl; } memset(a, 0, n * sizeof(a[0])); memset(b, 0, n * sizeof(a[0])); } return 0; } |
#include <bits/stdc++.h> using namespace std; int c[100]; int main() { int n, k, a; cin >> n; for (int i = 1; i <= n; i++) { cin >> k; for (int j = 1; j <= k; j++) { cin >> a; c[a]++; } } for (int i = 1; i <= 100; i++) { if (c[i] == n) cout << i << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { string a, b; cin >> a >> b; if (a.size() < b.size()) a = string(b.size() - a.size(), 0 ) + a; if (a.size() > b.size()) b = string(a.size() - b.size(), 0 ) + b; if (a < b) cout << < << endl; else if (a > b) cout << > << endl; else cout << = << endl; return; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[1005]; map<long long, int> x; int ans; void f(long long a, long long b) { long long cur = a + b; vector<long long> q; q.push_back(a); q.push_back(b); int len = 2; x[a]--; x[b]--; while (x[cur] > 0) { x[cur]--; q.push_back(cur); a = b; b = cur; cur = a + b; len++; } ans = max(len, ans); for (int i = 0; i < q.size(); i++) x[q[i]]++; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; x[a[i]]++; } ans = x[0]; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { if (a[i] == a[j] && a[i] == 0) continue; f(a[i], a[j]); f(a[j], a[i]); } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; inline void writeln2() { cout << n ; } inline void writeln() { cout << n ; } inline void readln() {} template <typename T> inline void read(T&); template <typename T> inline void priws(T); template <typename T> inline void print(T); void err(vector<string>::iterator it) { ++it; } template <typename Head, typename... Tail> inline void readln(Head& head, Tail&... tail) { read(head); readln(tail...); } template <typename Head, typename... Tail> inline void writeln2(Head head, Tail... tail) { print(head); writeln2(tail...); } template <typename Head, typename... Tail> inline void writeln(Head head, Tail... tail) { priws(head); writeln2(tail...); } template <typename T> inline void writeln_range(T f, T s) { if (f != s) for (auto i = f; i != s; ++i) writeln(*i); } template <typename Head, typename... Tail> inline void err(vector<string>::iterator it, Head head, Tail... tail) { writeln((*it).substr((*it)[0] == ), = , head); err(++it, tail...); } vector<string> split(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.push_back(x); return move(v); } void run() { int n, T; double c; readln(n, T, c); vector<int> a(n); readln(a); vector<int> p; readln(p); int m = p.size(); int j = 0; double real = 0; double app = 0; long long sum = 0; for (int i = 0; i < (int)(n); ++i) { if (j == m) break; sum += a[i]; if (i >= T) sum -= a[i - T]; real = (0.0 + sum) / T; app = (app + (0.0 + a[i]) / T) / c; if (p[j] == i + 1) j++, writeln(real, app, fabs(app - real) / real); } } int main() { run(); return 0; } template <typename T> inline ostream& operator<<(ostream& os, vector<T>& _a); template <typename T1, typename T2> inline istream& operator>>(istream& is, pair<T1, T2>& _a) { return is >> _a.first >> _a.second; } template <typename T1, typename T2> inline ostream& operator<<(ostream& os, pair<T1, T2>& _a) { return os << _a.first << << _a.second; } template <typename T> inline ostream& operator<<(ostream& os, vector<T>& _a) { if (_a.size()) os << _a[0]; else os << n ; for (int i = 1; i < _a.size(); ++i) os << n [is_fundamental<T>::value] << _a[i]; return os; } template <typename T> inline istream& operator>>(istream& is, vector<T>& _a) { if (_a.size() == 0) { int _n; is >> _n; _a.resize(_n); } for (int i = 0; i < _a.size(); ++i) is >> _a[i]; return is; } void print(double _a) { printf( %.6f , _a); } void priws(double _a) { printf( %.6f , _a); } void read(double& _a) { scanf( %lf , &_a); } template <typename T> inline void print(T _a) { cout << << _a; } template <typename T> inline void priws(T _a) { cout << _a; } template <typename T> inline void read(T& _a) { cin >> _a; } |
#include <bits/stdc++.h> #pragma 03 using namespace std; int mod = 998244353; int add(int a, int b) { a += b; if (a < 0) a += mod; if (a >= mod) a -= mod; return a; } int main() { int n, m; string s, t; cin >> n >> m >> s >> t; int pw = 1, res = 0, ans = 0; for (int i = 0; i < m; i++) { if (i < n && s[n - i - 1] == 1 ) res = add(res, pw); if (t[m - i - 1] == 1 ) ans = add(ans, res); pw = add(pw, pw); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void striker() { int n; cin >> n; string s; cin >> s; int left_arr[n]; int right_arr[n]; for (int i = 0; i < 2 * n; i++) { if (i < n) left_arr[i] = s[i]; else right_arr[i - n] = s[i]; } bool flag = false; sort(left_arr, left_arr + n); sort(right_arr, right_arr + n); if (left_arr[0] > right_arr[0]) flag = true; else if (left_arr[0] < right_arr[0]) flag = false; else { cout << NO ; return; } for (int i = 1; i < n; i++) { if (flag && left_arr[i] <= right_arr[i]) { cout << NO ; return; } else if (!flag && left_arr[i] >= right_arr[i]) { cout << NO ; return; } } cout << YES ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t = 1; for (int i = 0; i < t; i++) { striker(); cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, sx, sy; cin >> n >> sx >> sy; vector<pair<long long, long long>> vec(n); for (int i = 0; i < n; i++) { cin >> vec[i].first >> vec[i].second; } long long ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0; if (sy + 1 <= 1000000000) { for (int i = 0; i < n; i++) { if (vec[i].second > sy) { ans1++; } } } if (sy - 1 >= 0) { for (int i = 0; i < n; i++) { if (vec[i].second < sy) { ans2++; } } } if (sx + 1 <= 1000000000) { for (int i = 0; i < n; i++) { if (vec[i].first > sx) { ans3++; } } } if (sx - 1 >= 0) { for (int i = 0; i < n; i++) { if (vec[i].first < sx) { ans4++; } } } cout << max({ans1, ans2, ans3, ans4}) << endl; if (max({ans1, ans2, ans3, ans4}) == ans1) { cout << sx << << sy + 1 << endl; } else if (max({ans1, ans2, ans3, ans4}) == ans2) { cout << sx << << sy - 1 << endl; } else if (max({ans1, ans2, ans3, ans4}) == ans3) { cout << sx + 1 << << sy << endl; } else if (max({ans1, ans2, ans3, ans4}) == ans4) { cout << sx - 1 << << sy << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int i, j, k, n, m, an; int f[(1 << 24)], g[(1 << 24)], h[(1 << 24)]; char p[3]; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %s , p); int s = 0; for (j = 0; j <= 2; j++) s |= 1 << (p[j] - a ); g[s]++; } m = (1 << 24) - 1; for (i = 1; i <= m; i++) { int A = i & -i, B = i ^ A; if (!B) { f[i] = g[i]; continue; } int C = B & -B, D = B ^ C; if (!D) { f[i] = f[B] + f[D | A] - f[D] + g[A | C]; continue; } int E = D & -D, F = D ^ E; f[i] = f[F] - f[F | E] - f[F | C] - f[F | A] + f[i ^ A] + f[i ^ C] + f[i ^ E] + g[A | C | E]; } for (i = 1; i <= m; i++) { int A = i & -i, B = i ^ A, C = m ^ B, D = m ^ i; h[i] = h[B] + f[C] - f[D]; an ^= h[i] * h[i]; } printf( %d n , an); return 0; } |
#include <bits/stdc++.h> using namespace std; int p[100010] = {0}, d[100010], n, k, a[100010], ans = 0, ac[100010], flag = 1; void solve(int x) { if (x > n) return; if (p[x] == 0 || (p[x] == x + 1 && flag)) { if (p[x] == 0) flag = 0, ans += (x != n), solve(x + 1); else solve(x + 1); return; } flag = 0; ans += d[x]; for (int j = p[x], t; j > 0;) { t = p[j]; d[j] = 0; p[j] = 0; j = t; } ans++; solve(x + 1); } int main() { scanf( %d%d , &n, &k); for (int i = 0, t; i < k; ++i) { scanf( %d , &t); for (int j = 1; j <= t; ++j) { scanf( %d , a + j); d[a[j]] = t - j; } for (int j = t; j > 1; --j) p[a[j - 1]] = a[j]; for (int j = 1; j <= t; ++j) ac[a[j]] = a[t]; } solve(1); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; cin >> d >> h >> v >> e; double ans = 3.14159265359 * d * d * h / (4 * v - 3.14159265359 * d * d * e); if (ans < 0) cout << NO << n ; else { cout.precision(17); cout << YES << n << ans << n ; } } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 50; const int Mod = 1e6 + 3; using namespace std; const char YES[] = YES , NO[] = NO ; int n; int s[maxn]; bool find(int &st) { st = n - 2; if (st <= 0) return false; while (st > 0 && s[st] != 0) st--; return st > 0; } void solve() { if (s[n] == 1) { puts(NO); return; } if (n == 1 || s[n - 1] == 1) { puts(YES); for (int i = 1; i < n + 1; i++) { if (i == 1) printf( %d , s[i]); else printf( ->%d , s[i]); } puts( ); return; } int pos; if (!find(pos)) { puts(NO); return; } puts(YES); for (int i = 1; i < pos; i++) { if (i == 1) printf( %d , s[i]); else printf( ->%d , s[i]); } for (int i = pos; i < n + 1; i++) { if (i == n) printf( ))->%d , s[i]); else if (i == pos || i == pos + 1) { if (i == pos && pos == 1) printf( (%d , s[i]); else printf( ->(%d , s[i]); } else printf( ->%d , s[i]); } puts( ); } int main() { while (scanf( %d , &n) != EOF) { for (int i = 1; i < n + 1; i++) { scanf( %d , s + i); } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m; long long ban[300000]; long long cnt[300000]; long long used[300000]; long long dp[300000]; long long g[300000]; long long fi; vector<long long> vec[300000]; vector<long long> GCD[300000]; vector<long long> ans; long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } void update(long long v) { used[v] = 1; if (GCD[v].size() == 0) return; dp[v] += GCD[gcd(v, m)].size(); long long mx = 0; for (int i = 0; i < vec[v].size(); i++) { long long to = vec[v][i]; if (!used[to]) update(to); if (dp[to] > mx) mx = dp[to]; } dp[v] += mx; } long long bin_pow(long long x, long long y) { if (y == 1) return x; if (y % 2 == 0) { long long z = bin_pow(x, y / 2); return (z * z) % m; } else return (x * bin_pow(x, y - 1)) % m; } int main() { ios_base::sync_with_stdio(0); cin >> n >> m; if (m == 1) { cout << 1 << endl; cout << 0 << endl; return 0; } for (int i = 0; i < n; i++) { long long x; cin >> x; ban[x] = 1; } for (int i = 1; i < m; i++) { g[i] = gcd(i, m); if (g[i] == 1) fi++; if (!ban[i]) GCD[gcd(i, m)].push_back(i); } for (int i = 1; i < m; i++) for (int j = 2 * i; j < m; j += i) vec[i].push_back(j); int v = 0; for (int i = 1; i < m; i++) { if (!used[i]) update(i); if (dp[i] > dp[g[v]]) v = GCD[i][0]; } while (v) { for (int i = 0; i < GCD[g[v]].size(); i++) ans.push_back(GCD[g[v]][i]); int w = 0; for (int i = 0; i < vec[g[v]].size(); i++) { if (dp[vec[g[v]][i]] > dp[g[w]]) w = GCD[vec[g[v]][i]][0]; } if (!w) break; else v = w; } cout << ans.size() + 1 - ban[0] << endl; if (!ans.empty()) cout << ans[0] << ; for (int i = 0; i < ans.size() - 1; i++) { long long x = ans[i]; long long y = ans[i + 1]; x /= g[x]; y /= g[y]; long long a = y * bin_pow(x, fi - 1); a %= m; a *= g[ans[i + 1]] / g[ans[i]]; cout << a % m << ; } if (!ban[0]) cout << 0 << endl; } |
#include <bits/stdc++.h> using namespace std; int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59}; int fack[62]; int dp[110][1 << 17]; int pre[110][1 << 17]; int x[110][1 << 17]; int n; int a[110]; void init() { memset(fack, 0, sizeof(fack)); for (int i = 1; i <= 60; i++) { for (int j = 0; j <= 16; j++) { if (i % prime[j] == 0) { fack[i] += (1 << j); } } } } void dfs(int idx, int id) { if (idx >= 2) dfs(idx - 1, pre[idx][id]); printf( %d%c , x[idx][id], idx == n ? n : ); } int main() { init(); fack[1] = 0; while (~scanf( %d , &n)) { for (int i = 1; i <= n; i++) scanf( %d , &a[i]); memset(dp, 50, sizeof(dp)); dp[0][0] = 0; for (int i = 1; i <= n; i++) { for (int s = 0; s <= (1 << 17) - 1; s++) { for (int k = 1; k < 60; k++) { if (s & fack[k]) continue; else { if (dp[i][s | fack[k]] > dp[i - 1][s] + abs(a[i] - k)) { dp[i][s | fack[k]] = dp[i - 1][s] + abs(a[i] - k); pre[i][s | fack[k]] = s; x[i][s | fack[k]] = k; } } } } } int ans = 0x3f3f3f3f; int id; for (int s = 0; s <= (1 << 17) - 1; s++) { if (dp[n][s] < ans) { ans = dp[n][s]; id = s; } } dfs(n, id); } } |
#include <bits/stdc++.h> using namespace std; using LL = long long; const int MAXN = 11; const int MAXM = 1e4 + 5; int n, m, ex[MAXN]; int cnt[30]; char w[MAXN][MAXM]; void solve() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , &ex[i]); for (int i = 0; i < n; i++) scanf( %s , w[i]); LL ans = 0; int pos; for (int i = 0; i < (1 << n); i++) { for (int j = 0; j <= 20; j++) cnt[j] = 0; for (int j = 0; j < m; j++) { int x[2] = {0, 0}; for (int k = 0; k < n; k++) if (w[k][j] == 1 ) x[((1 << k) & i) != 0]++; cnt[x[1] - x[0] + 10]++; } int mm = m; LL sum = 0; for (int j = 0; j < n; j++) if (((1 << j) & i) == 0) sum += ex[j]; else sum -= ex[j]; for (int j = 20; j >= 0; j--) { sum += 1ll * (j - 10) * (2 * mm - cnt[j] + 1) * cnt[j] / 2; mm -= cnt[j]; } if (sum >= ans) ans = sum, pos = i; } { for (int j = 0; j <= 20; j++) cnt[j] = 0; for (int j = 0; j < m; j++) { int x[2] = {0, 0}; for (int k = 0; k < n; k++) if (w[k][j] == 1 ) x[((1 << k) & pos) != 0]++; cnt[x[1] - x[0] + 10]++; } for (int j = 1; j <= 20; j++) cnt[j] += cnt[j - 1]; for (int j = 0; j < m; j++) { int x[2] = {0, 0}; for (int k = 0; k < n; k++) if (w[k][j] == 1 ) x[((1 << k) & pos) != 0]++; printf( %d , cnt[x[1] - x[0] + 10]); cnt[x[1] - x[0] + 10]--; } printf( n ); } } int main() { int T; scanf( %d , &T); for (int i = 1; i <= T; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a == 0 || b == 0) return abs(a - b); long long res = a % b; while (res) { a = b; b = res; res = a % b; } return b; } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } long long max(long long a, long long b) { if (a > b) return a; else return b; } long long min(long long a, long long b) { if (a < b) return a; else return b; } long long numberofdiviser(long long a) { long long ans = 0; long long i; for (i = 1; i * i < a; i++) { if (a % i == 0) ans += 2; } if (i * i == a) ans++; return ans; } void fival(long long* a, long long b, long long n) { for (int i = 0; i < n; i++) { a[i] = b; } } long long sum, ans, l, r, x; long long ss(vector<long long> a, vector<long long>& b, int ii) { for (int i = ii; i < a.size(); i++) { b.push_back(a[i]); sum += a[i]; if (b.size() > 1 && sum >= l && sum <= r && b[b.size() - 1] - b[0] >= x) ans++; ss(a, b, i + 1); sum -= b[b.size() - 1]; b.pop_back(); } return ans; } unsigned long long fact(long long n) { if (n == 0) return 1; return n * fact(n - 1); } unsigned long long Combinations(unsigned long long n, unsigned long long r) { if (r > n) return 0; if (r * 2 > n) r = n - r; if (r == 0) return 1; unsigned long long res = n; for (int i = 2; i <= r; ++i) { res *= (n - i + 1); res /= i; } return res; } int solve() { long long a, b; cin >> a >> b; vector<long long> v1, v2; for (long long i = a; i <= a * b; i += a) { v1.push_back(i); } for (long long i = b; i <= a * b; i += b) { v2.push_back(i); } long long ans = 0; for (long long i = 0, j = 0; i < v1.size() && j < v2.size();) { if (v1[i] == v2[j]) { if (a > b) ans++; else ans--; i++, j++; } else if (v1[i] < v2[j]) { ans++, i++; } else { ans--, j++; } } if (ans > 0) cout << Dasha ; else if (ans == 0) cout << Equal ; else cout << Masha ; return 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int IN = 2e5 + 7; int sum[IN]; int main() { string str; cin >> str; int n; scanf( %d , &n); memset(sum, 0, sizeof(sum)); if (str[0] == str[1]) sum[0] = 1; else sum[0] = 0; int k = str.size(); for (int i = 1; i < k - 1; i++) { if (str[i] == str[i + 1]) { sum[i] = sum[i - 1] + 1; } else { sum[i] = sum[i - 1]; } } sum[k - 1] = sum[k - 2]; int l, r; for (int i = 0; i < n; i++) { scanf( %d%d , &l, &r); if (l != 1) printf( %d n , sum[r - 2] - sum[l - 2]); else printf( %d n , sum[r - 2]); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; map<string, int> f; vector<pair<int, string> > v; int n, cnt = 0; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { string s; cin >> s; f[s] = ++cnt; } for (map<string, int>::iterator it = f.begin(); it != f.end(); ++it) { v.push_back(make_pair(it->second, it->first)); } sort(v.begin(), v.end(), greater<pair<int, string> >()); for (int i = 0; i < v.size(); ++i) cout << v[i].second << n ; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long max(long long num) { long long max = 1, rem; while (num > 0) { rem = num % 10; num /= 10; if (rem > max) { max = rem; } } return max; } int main() { fast(); int n; cin >> n; vector<long long> vect(n + 1); long long i, count = 0; for (i = 1; i <= n; i++) { vect[i] = 1; } for (i = 10; i <= n; i++) { vect[i] = vect[i - max(i)] + 1; } cout << vect[n] << n ; ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int r, c, x = 0, y, z; cin >> r >> c; while (r != 0) { if (r % 2 != 0) { for (int i = 0; i < c; i++) { cout << # ; } cout << n ; } else { if (!x) { for (int i = 0; i < c - 1; i++) { cout << . ; } cout << # ; cout << n ; x++; } else { cout << # ; for (int i = 0; i < c - 1; i++) { cout << . ; } cout << n ; x = 0; } } r = r - 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); vector<long long> tmp; int n, k; cin >> n >> k; long long mas[n], ans = 0; for (int i = 0; i < (int)(n); ++i) cin >> mas[i]; vector<pair<long long, long long> > ext; string s; cin >> s; for (int i = 0; i < (int)(s.length()); ++i) { ext.push_back(make_pair(mas[i], s[i])); } for (long long i = 0; i < s.length(); i++) { long long start = i, loop = k; while (s[i] == s[i + 1] && i < s.length() - 1) i++; for (long long j = start; j <= i; j++) { tmp.push_back(ext[j].first); } sort(tmp.begin(), tmp.end()); for (long long i = tmp.size() - 1; i >= 0; i--) { ans += tmp[i]; loop--; if (loop <= 0) break; } tmp.clear(); } cout << ans; return 0; } |
#include <bits/stdc++.h> char Puz[105][105], ch; bool flag[105][105], ok; int i, j, k, n, m; int main() { scanf( %d%d , &n, &m); scanf( %c , &ch); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { scanf( %c , &ch); Puz[i][j] = ch; } scanf( %c , &ch); } memset(flag, 0, sizeof(flag)); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (!flag[i][j]) { ch = Puz[i][j]; ok = true; for (k = 1; k <= n; k++) if (k != i && Puz[k][j] == ch) { ok = false; flag[k][j] = false; } for (k = 1; k <= m; k++) if (k != j && Puz[i][k] == ch) { ok = false; flag[i][k] = false; } flag[i][j] = ok; } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (flag[i][j]) printf( %c , Puz[i][j]); printf( n ); } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; } const long long MOD = 998244353; const long long MAX = 200060; const long double pi = acos(-1); const long double EPS = 1e-12; long long fac[MAX], finv[MAX], inv[MAX]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (long long i = 2; i < MAX; i++) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } long long COM(long long n, long long k) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } long long add(long long x, long long y) { x += y; if (x >= MOD) return x - MOD; return x; } long long sub(long long x, long long y) { x -= y; if (x < 0) return x + MOD; return x; } long long mult(long long x, long long y) { return (x * y) % MOD; } long long bin_pow(long long x, long long p) { if (p == 0) return 1; if (p & 1) return mult(x, bin_pow(x, p - 1)); return bin_pow(mult(x, x), p / 2); } vector<long long> G[200020]; long long dfs(long long n, long long pre) { long long res = 1; res = mult(res, fac[G[n].size()]); for (auto nex : G[n]) { if (nex == pre) continue; res = mult(res, dfs(nex, n)); } return res; } void solve() { long long N; cin >> N; COMinit(); for (long long i = 0; i < N - 1; i++) { long long u, v; cin >> u >> v; u--, v--; G[u].push_back(v); G[v].push_back(u); } long long ans = dfs(0, 0); ans = mult(ans, N); cout << ans << n ; } signed main() { cin.tie(0); ios::sync_with_stdio(false); solve(); } |
#include <bits/stdc++.h> using namespace std; long long int n, a[100] = {}, r = 0, s = 0, m; int main() { ios_base::sync_with_stdio(0); for (long long int i = 1; i <= 5; i++) { cin >> m; a[m]++; s += m; if (a[m] == 2 || a[m] == 3) r = max(r, m * a[m]); } cout << s - r; return 0; } |
#include <bits/stdc++.h> const int BUFFSIZE = 10240; char BUFF[BUFFSIZE + 1], *p = BUFF; int CHAR, SIGN, BYTES = 0; using namespace std; char s1[(int)1e6 + 10]; char s2[(int)1e6 + 10]; vector<int> buf[26]; int main() { scanf( %s %s , s1, s2); int l1 = strlen(s1); int l2 = strlen(s2); for (int i = 0; i < l1; i++) buf[s1[i] - a ].push_back(i); bool f = 1; for (int i = 0; i < l2; i++) if ((int)buf[s2[i] - a ].size() == 0) { f = false; break; } if (!f) printf( -1 n ); else { int ret = 1; int pos = -1; for (int j = 0; j < l2; j++) { char c = s2[j] - a ; vector<int>::iterator it; it = upper_bound(buf[c].begin(), buf[c].end(), pos); if (it != buf[c].end()) pos = *it; else { ret += 1; pos = buf[c][0]; } } printf( %d n , ret); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 30; struct Node { int pos, val; bool operator<(const Node& a) const { return val < a.val; } } p[maxn]; int ans[maxn]; int n; int main() { cin >> n; for (int i = 1; i <= n; ++i) cin >> p[i].val, p[i].pos = i; sort(p + 1, p + n + 1); for (int i = 2; i <= n; ++i) ans[p[i].pos] = p[i - 1].val; ans[p[1].pos] = p[n].val; for (int i = 1; i <= n; ++i) printf( %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr int N = 3e3 + 1; int a[N], nxt[N], prv[N], lst[N]; uint16_t dp[N][N]; int main() { cin.tie(0), ios::sync_with_stdio(0); int t, n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i], --a[i]; } memset(lst, -1, n * sizeof *lst); n = unique(a, a + n) - a; memset(prv, -1, n * sizeof *prv); memset(nxt, 127, n * sizeof *nxt); for (int i = 0; i < n; ++i) { if (lst[a[i]] != -1) { prv[i] = lst[a[i]]; nxt[lst[a[i]]] = i; } lst[a[i]] = i; } for (int i = n - 1; i > -1; --i) for (int j = i + 1; j < n; ++j) { auto t = dp[i + 1][j]; for (int z = nxt[i]; z <= j; z = nxt[z]) { t = max(t, uint16_t(dp[i + 1][z - 1] + dp[z][j] + 1)); } dp[i][j] = t; } cout << n - dp[0][n - 1] - 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> T[4 * 200005]; void update(int n, int b, int e, int p, int v) { if (b == p && e == p) { T[n] = make_pair(v, p); } else { int m = (b + e) / 2; if (p <= m) update(2 * n, b, m, p, v); else update(2 * n + 1, m + 1, e, p, v); T[n] = max(T[2 * n], T[2 * n + 1]); } } pair<int, int> query(int n, int b, int e, int l, int r) { if (b == l && e == r) { return T[n]; } else { int m = (b + e) / 2; if (m >= r) return query(2 * n, b, m, l, r); if (l > m) return (query(2 * n + 1, m + 1, e, l, r)); return max(query(2 * n, b, m, l, m), query(2 * n + 1, m + 1, e, m + 1, r)); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<pair<pair<int, int>, int> > arr(n); vector<pair<int, int> > ori(n); int a, b; for (int i = 0; i < n; i++) { cin >> a >> b; arr[i] = make_pair(make_pair(a, b), i); ori[i] = make_pair(a, b); } sort(arr.begin(), arr.end()); priority_queue<pair<int, int> > q; vector<int> result1(n); vector<int> result2(n); int index = 0; map<int, int> comp; for (int i = 1; i <= n; i++) { while (index < n && arr[index].first.first == i) { q.push(make_pair(-1 * arr[index].first.second, arr[index].second)); index++; } pair<int, int> current = q.top(); q.pop(); result1[current.second] = i; comp[i] = current.second; } for (int i = 0; i < n; i++) { result2[i] = result1[i]; } bool one = true; for (int i = 1; i <= n; i++) { int l = ori[comp[i]].first; int r = ori[comp[i]].second; pair<int, int> res = query(1, 0, 200005, l, r); if (res.first >= i) { one = false; result2[comp[i]] = result1[comp[res.second]]; result2[comp[res.second]] = result1[comp[i]]; break; } update(1, 0, 200005, i, r); } if (one) { cout << YES << n ; for (int i = 0; i < n; i++) { cout << result1[i] << ; } cout << n ; } else { cout << NO << n ; for (int i = 0; i < n; i++) { cout << result1[i] << ; } cout << n ; for (int i = 0; i < n; i++) { cout << result2[i] << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7; const long long linf = (long long)1e18 + 7; const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1}; using namespace std; int n; int main() { ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; int l = 0, r = 0; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; if (x < 0) l++; if (x > 0) r++; } if (max(l, r) >= n - 1) cout << Yes ; else cout << No ; exit(0); } |
#include <bits/stdc++.h> using namespace std; int h, q; char s[10]; unordered_map<int, int> a; double ans; void add(int v, int x) { if (a.count(v) == 0) a[v] = x; else a[v] += x; return; } void addToRoot(int v, int x) { while (v > 0) { add(v, x); v >>= 1; } return; } int getVal(int v) { if (a.count(v) == 0) return 0; return a[v]; } void solve(int v, double p, int prevMax) { if (v >= (1 << h)) { ans += p * getVal(v); return; } int curVal = getVal(v); int leftVal = getVal(2 * v), rightVal = getVal(2 * v + 1); p /= 2; if (leftVal * 2 <= curVal || leftVal <= prevMax) ans += p * max(prevMax, curVal - leftVal); else solve(2 * v, p, max(prevMax, curVal - leftVal)); if (rightVal * 2 <= curVal || rightVal <= prevMax) ans += p * max(prevMax, curVal - rightVal); else solve(2 * v + 1, p, max(prevMax, curVal - rightVal)); return; } double getAns() { ans = 0; solve(1, 1, -1); return ans; } int main() { scanf( %d%d , &h, &q); while (q--) { scanf( %s , s); if (s[0] == a ) { int v, x; scanf( %d%d , &v, &x); addToRoot(v, x); } else printf( %.12lf n , getAns()); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, x = 0, y, i = 1; cin >> n >> m; if (!m) { cout << n << << n; return 0; } y = (n - 2 * m); if (y < 0) y = 0; n--; while (x < m && n > 0) { x += i; i++; n--; } cout << y << << n; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 322228; long long a[N]; int n, k; int cou[N]; bool solve(int l, int r) { long long need = cou[l % k]; long long tl = l - k >= 0 ? a[l - k] + 1 : -1000000000000ll; long long tr = r + k < n ? a[r + k] - 1 : 1000000000000ll; if (tr - tl + 1 < need) return 0; if (tl >= 0) { for (long long i = tl; i < tl + need; i++) a[l + (i - tl) * k] = i; } else if (tr <= 0) { for (long long i = tr; i > tr - need; i--) a[r - (tr - i) * k] = i; } else { long long ttl = 0, ttr = need - 1; while (ttl - 1 >= tl && (abs(ttl - 1) <= abs(ttr) || ttr > tr)) ttl--, ttr--; for (int i = 0; i < need; i++) a[l + i * k] = ttl + i; } return 1; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; int tn = ((n - 1) / k + 2) * k; for (int i = 0; i < tn; i++) { string s; if (i < n) cin >> s; else if (i < tn - k) s = 1000000000000 ; else s = 1000000000001 ; if (s == ? ) { cou[i % k]++; } else { a[i] = atoll(s.c_str()); if (cou[i % k]) { if (!solve(i - k * cou[i % k], i - k)) return cout << Incorrect sequence , 0; cou[i % k] = 0; } else if (i - k >= 0 && a[i] <= a[i - k]) return cout << Incorrect sequence , 0; } } for (int i = 0; i < n; i++) cout << a[i] << ; } |
#include <bits/stdc++.h> using namespace std; int getSum(vector<int> BITree[], int index, int n) { int sum = 0; index = index + 1; while (index > 0) { sum += BITree[n][index]; index -= index & (-index); } return sum; } void updateBIT(vector<int> BITree[], int n, int index, int val, int num) { index = index + 1; while (index <= n) { BITree[num][index] += val; index += index & (-index); } } int main() { string str; cin >> str; int n = str.size(); int q; cin >> q; int type; int pos; char ch, ch2; int num, num2; int l, r; vector<int> bit[26]; for (int i = 0; i < 26; i++) { for (int j = 0; j < n + 1; j++) bit[i].push_back(0); } for (int i = 0; i < n; i++) { ch = str[i]; num = int(ch) - 97; updateBIT(bit, n, i, 1, num); } while (q--) { cin >> type; if (type == 1) { cin >> pos >> ch; pos--; num = int(ch) - 97; ch2 = str[pos]; str[pos] = ch; num2 = int(ch2) - 97; updateBIT(bit, n, pos, 1, num); updateBIT(bit, n, pos, -1, num2); } else { cin >> l >> r; l--, r--; int cnt = 0; for (int i = 0; i < 26; i++) if (getSum(bit, r, i) - getSum(bit, l - 1, i) > 0) cnt++; cout << cnt << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 500010; int main() { int n; cin >> n; int a[111][111] = {0}; int ans1 = 0, ans2 = 0; vector<int> mids; for (int i = 1; i <= n; i++) { cin >> a[i][0]; for (int j = 1; j <= a[i][0]; j++) { cin >> a[i][j]; if (a[i][0] % 2 == 0) { if (j <= a[i][0] / 2) { ans1 += a[i][j]; } else ans2 += a[i][j]; } else { if (j < a[i][0] / 2 + 1) { ans1 += a[i][j]; } else if (j == a[i][0] / 2 + 1 || a[i][0] == 1) { mids.push_back(a[i][j]); } else ans2 += a[i][j]; } } } sort(mids.begin(), mids.end()); reverse(mids.begin(), mids.end()); for (int i = 0; i < mids.size(); i++) { if (i % 2 == 0) { ans1 += mids[i]; } else ans2 += mids[i]; } cout << ans1 << << ans2; return 0; } |
#include <bits/stdc++.h> int read() { 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; } using namespace std; bool b[100000 + 5]; vector<int> v[100000 + 5]; int n, m; int s[100000 + 5]; int ans[100000 + 5], cnt = 0; bool yes = true; void dfs(int x, int fa) { if (fa != 0 && s[x] != x && s[x] != s[fa]) { puts( -1 ); yes = false; } if (s[x] == x) ans[++cnt] = x; for (int i = 0; i < v[x].size(); i++) { int y = v[x][i]; if (y == fa) continue; dfs(y, x); } } int main() { n = read(); m = read(); for (int i = 1; i <= m; i++) { int x = read(), y = read(); v[x].push_back(y); b[y] = 1; } for (int i = 1; i <= n; i++) s[i] = read(); for (int i = 1; i <= n; i++) { if (!b[i]) dfs(i, 0); } if (yes == true) { cout << cnt << endl; for (int i = cnt; i >= 1; i--) { cout << ans[i] << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; int main() { long long n, k; cin >> n >> k; map<int, int, greater<int> > st; long long n1 = n; for (int i = 0; n1 > 0; ++i) { if (n1 & 1) st[i] = 1; n1 >>= 1; } k -= (int)(st.size()); if (k < 0) { cout << No n ; return 0; } while (k > 0) { auto it = *st.begin(); if (k >= it.second) { st.erase(it.first); st[it.first - 1] += it.second * 2; k -= it.second; } else { auto it = *st.rbegin(); st[it.first] -= 1; st[it.first - 1] += 2; k -= 1; if (st[it.first] == 0) st.erase(it.first); } } cout << Yes n ; for (auto it : st) { for (int i = 0; i < (it.second); ++i) cout << it.first << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> long long x, y; int maxdis(long long x, long long n, long long s) { if (x > (s >> 1)) x = s - x; if (x * n > s) return maxdis(s % x, (x * n + s % x) / s, x); else return (x > (s - x * (n - 1)) ? x : (s - x * (n - 1))); } int a, n, p, h; int main() { int t; using namespace std; ios::sync_with_stdio(false); cin >> t; for (register int i = 0; i < t; i++) { cin >> a >> n >> p >> h, a %= p; int maxd = ((long long)a * n < p) ? a : maxdis(a % p, n + 1, p); if (maxd <= h) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; while (cin >> s) { int N = s.size(); int l = N - 1; for (; l > 0; --l) { for (int i = 0; i + l <= N; ++i) { string sub = s.substr(i, l); size_t head = s.find(sub); if (head != string::npos) { size_t tail = s.find(sub, head + 1); if (tail != string::npos) { goto END; } } } } END:; cout << l << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, so7, so4, kiemtra7; bool check = true; int main() { cin >> n; if (n % 7 == 0) { so7 = n / 7; for (int i = 1; i <= so7; i++) cout << 7 ; } else { int r = n % 4; if (r == 0) { kiemtra7 = (n - 4) / 28; if (kiemtra7 == 0) { check = false; } else { so7 = (((n - 4) / 7) / 4 * 4); n = n - so7 * 7; so4 = n / 4; for (int i = 1; i <= so4; i++) cout << 4 ; for (int i = 1; i <= so7; i++) cout << 7 ; } if (check == false) { so4 = n / 4; for (int i = 1; i <= so4; i++) cout << 4 ; } } if (r == 1) { kiemtra7 = (n - 4) / 7 - 3; so7 = ((((n - 4) / 7 - 3) / 4) * 4 + 3); n = n - so7 * 7; if (kiemtra7 < 0) cout << -1 ; else { so4 = n / 4; for (int i = 1; i <= so4; i++) cout << 4 ; for (int i = 1; i <= so7; i++) cout << 7 ; } } if (r == 2) { kiemtra7 = (n - 4) / 7 - 2; so7 = ((((n - 4) / 7 - 2) / 4) * 4 + 2); n = n - so7 * 7; if (kiemtra7 < 0) cout << -1 ; else { so4 = n / 4; for (int i = 1; i <= so4; i++) cout << 4 ; for (int i = 1; i <= so7; i++) cout << 7 ; } } if (r == 3) { kiemtra7 = (n - 4) / 7 - 1; so7 = ((((n - 4) / 7 - 1) / 4) * 4 + 1); n = n - so7 * 7; if (kiemtra7 < 0) cout << -1 ; else { so4 = n / 4; for (int i = 1; i <= so4; i++) cout << 4 ; for (int i = 1; i <= so7; i++) cout << 7 ; } } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, b; cin >> n; for (int i = 0; i < n; i++) { cin >> b; int a[b + 1]; for (int j = 0; j < b; j++) cin >> a[j]; sort(a, a + b); int mn = 999999; for (int j = 1; j < b; j++) { mn = min(a[j] - a[j - 1], mn); } cout << mn << endl; } } |
#include <bits/stdc++.h> using namespace std; static const int INF = 500000000; template <class T> void debug(T a, T b) { for (; a != b; ++a) cerr << *a << ; cerr << endl; } long long int n; pair<long long int, int> factor[100]; long long int tot[100]; int m = 0; long long int ans; bool f(long long int a) { if (a <= 0 || a & 1) return true; return false; } void check(long long int a, long long int b, long long int c) { if (f(b + c - a) || f(c + a - b) || f(a + b - c)) ; else ++ans; } void dfs(int d, long long int a, long long int b, long long int c) { if (d == m) { check(a, b, c); return; } long long int mul1 = 1; for (int i = 0; i < factor[d].second + 1; ++i) { long long int mul2 = 1; for (int j = 0; j < factor[d].second + 1 - i; ++j) { long long int mul3 = tot[d] / mul1 / mul2; dfs(d + 1, a * mul1, b * mul2, c * mul3); mul2 *= factor[d].first; } mul1 *= factor[d].first; } } int main() { cin >> n; if (n % 3) { puts( 0 ); return 0; } n /= 3; long long int t = n; for (long long int i = 2; i * i <= t; ++i) if (t % i == 0) { factor[m].first = i; long long int tmp = 1; while (t % i == 0) { t /= i; tmp *= i; factor[m].second++; } tot[m] = tmp; ++m; } if (t > 1) factor[m++] = make_pair(t, 1), tot[m - 1] = t; ; dfs(0, 1, 1, 1); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, x[5], a[30], d = 0; long long mod = 1000000007ll, fc[30]; long long C[30][30]; bool vis[30]; long long first(long long s1, long long s2, long long s3, long long ind, long long q, long long t) { if (t == 1) { if (s1 == 0) return (fc[q] * first(0, s2, s3, 0, 0, 2)) % mod; long long r = 0; for (int i = ind + 1; i <= n && a[i] <= s1; i++) { int N = 1; for (int j = i + 1; j <= n && a[j] == a[i]; j++) N++; for (int k = 1; k <= N && a[i] * k <= s1; k++) { vis[i + k - 1] = 1; r = (r + (C[N][k] * first(s1 - k * a[i], s2, s3, i + N - 1, q + k, 1)) % mod) % mod; } for (int j = i; j < i + N; ++j) vis[j] = 0; i += N - 1; } return r; } if (t == 2) { if (s2 == 0) return (fc[q] * first(0, 0, s3, 0, 0, 3)) % mod; long long r = 0; for (int i = ind + 1; i <= n && a[i] <= s2; i++) if (!vis[i]) { vis[i] = 1; r = (r + first(0, s2 - a[i], s3, i, q + 1, 2)) % mod; vis[i] = 0; } return r; } q = 0; for (int i = 1; i <= n; i++) if (!vis[i]) q++; return fc[q]; } int main() { memset(C, 0, sizeof(C)); memset(vis, 0, sizeof(vis)); for (int i = 0; i < 30; i++) C[i][0] = 1; for (int i = 1; i < 30; i++) for (int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; cin >> n; fc[0] = 1; for (int i = 1; i <= n; ++i) { cin >> a[i]; d += a[i]; fc[i] = (fc[i - 1] * i) % mod; } sort(a + 1, a + n + 1); cin >> k; for (int i = 1; i <= k; i++) cin >> x[i]; if (k == 0) { cout << fc[n]; return 0; } if (k == 1) { fc[n] = (fc[n] - first(x[1], 0, d - x[1], 0, 0, 1) + mod) % mod; cout << fc[n]; return 0; } if (x[1] > x[2]) swap(x[1], x[2]); long long r1 = first(min(x[1], d - x[1]), 0, max(d - x[1], x[1]), 0, 0, 1); memset(vis, 0, sizeof(vis)); long long r2 = first(min(x[2], d - x[2]), 0, max(d - x[2], x[2]), 0, 0, 1); memset(vis, 0, sizeof(vis)); x[3] = d - x[2]; x[2] -= x[1]; sort(x + 1, x + 3); long long r3 = first(x[1], x[2], x[3], 0, 0, 1); long long res = (fc[n] - r1 - r2 + r3 + 2 * mod) % mod; cout << res; return 0; } |
/*--------------------------------------------------------------- ∧＿∧ ∧＿∧ （´<_｀ ） （ ´_ゝ`） / ⌒i ／ ＼ | | / /￣￣￣￣/ | ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ ＼/＿＿＿＿/ （u ⊃ --------------------------------------------------------------*/ #include<bits/stdc++.h> #define IO ios::sync_with_stdio(false);cin.tie(0) #define rep(i,a,b) for(int i=a;i<=b;i++) #define req(i,a,b) for(int i=a;i>=b;i--) #define pb push_back #define fi first #define se second #define PI pair<int,int> #define PII pair<ll,PI> using namespace std; typedef long long ll; const int N=1e5+7; const ll mod=1e9+7; int a[107],b[107],x[107]; PI p[107]; int main() { IO; int t; cin>>t; while(t--){ int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= n; ++i) { cin >> b[i]; } int ans = 0; for (int i = 1; i <= n; ++i) { ans += a[i]-b[i]; } if (ans != 0) { cout << -1 << endl; continue; } int sum1 = 0, sum2 =0; for (int i = 1; i <= n; ++i) { x[i] = a[i] - b[i]; if (x[i] > 0) { sum1 += x[i]; } else if(x[i] < 0) { sum2 += x[i]; } } cout << sum1 << endl; while(sum1){ for(int i = 1; i <= n; i++){ if(x[i] < 0){ for(int j = 1; j <= n; j++){ if(x[j] > 0){ cout << j << << i << endl; x[i]++; x[j]--; sum1--; break; } } } } } } return 0; } |
#ifdef Prateek #include Prateek.h #else #include <bits/stdc++.h> using namespace std; #define debug(...) 42 #endif #define int ll #define all(c) begin(c),end(c) using ll = long long; const int MOD = 1e9+7, N = 1e5 + 10; struct edge{ int u, v, w; }; int32_t main(){ ios::sync_with_stdio(false); cin.tie(NULL); int L, R; cin >> L >> R; int B = L - 1; int D = R - L + 1; int k = 30; while (!(D >> k & 1)) --k; int mxN = k + 2; vector<edge> Edge; auto add = [&](int u, int v, int wt) { Edge.push_back({u, v, wt}); }; for (int i = 2; i <= mxN; ++i) { add(1, i, 1); int pw = 1; for (int j = 2; j < i; ++j) { add(j, i, pw); pw *= 2; } } cout << YES n ; if (D - (1 << k) == 0) { if (B) { mxN++; Edge.push_back({mxN - 1, mxN, B}); } cout << mxN << << Edge.size() << n ; for (auto [u, v, w] : Edge) { cout << u << << v << << w << n ; } return 0; } mxN++; --D; add(1, mxN, 1); for (int i = 0; i <= k; ++i) { if (D >> i & 1) { D -= (1 << i); add(i + 2, mxN, D + 1); } } if (B) { mxN++; Edge.push_back({mxN - 1, mxN, B}); } cout << mxN << << Edge.size() << n ; for (auto [u, v, w] : Edge) { cout << u << << v << << w << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, c; cin >> a >> b >> c; if (a < c) cout << 1 << ; else cout << -1 << ; if (c < a * b) cout << b << endl; else cout << -1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; static int n; static vector<int> ve; int main() { while (scanf( %d , &n) != EOF) { ve.clear(); ve.resize(n); for (int i = 0; i < n; i++) scanf( %d , &ve[i]); if (n == 1 && ve[n - 1] != 15 && ve[n - 1] != 0) { printf( -1 n ); } else { if (ve[n - 1] == 15) { printf( DOWN n ); } else if (ve[n - 1] == 0) { printf( UP n ); } else if (ve[n - 1] == 1) { if (ve[n - 2] == 2) printf( DOWN n ); else if (ve[n - 2] == 0) printf( UP n ); } else { if (ve[n - 1] > ve[n - 2]) printf( UP n ); else printf( DOWN n ); } } } return 0; } |
#include <bits/stdc++.h> const int N = 100005; int K, n, maxb, t; int c[N]; int read() { 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; } void update(int x, int d) { while (x <= maxb) { if (d > c[x]) c[x] = d; x += x & -x; } } int get(int x) { int ans = 0; while (x > 0) { ans = std::max(ans, c[x]); x -= x & -x; } return ans; } int a[N], ans[N]; int cal() { memset(c, 0, sizeof(c)); memset(ans, 0, sizeof(ans)); for (int i = 1; i <= t; i++) for (int j = 1; j <= n; j++) { int k = get(a[j] - 1) + 1; if (k > ans[j]) { ans[j] = k; update(a[j], k); } } return *std::max_element(ans + 1, ans + n + 1); } int main() { K = read(), n = read(), maxb = read(), t = read(); t = std::min(maxb, t); while (K--) { for (int i = 1; i <= n; i++) a[i] = read(); printf( %d n , cal()); } } |
#include <bits/stdc++.h> const int maxn(505); char ans[maxn]; int main() { int n; scanf( %d , &n); int nr(1), nc(1); ans[(n - 1) * 2] = 0 ; for (int i(0); i < n - 1; ++i) { printf( ? %d %d %d %d n , nr, nc + 1, n, n); fflush(stdout); char tmp[5]; scanf( %s , tmp); if (!strcmp(tmp, BAD )) { return 0; } else if (!strcmp(tmp, YES )) { ++nc; ans[i] = R ; } else if (!strcmp(tmp, NO )) { ++nr; ans[i] = D ; } else { printf( F**K n ); return 0; } } nr = nc = n; for (int i((n - 1) * 2 - 1); i >= n - 1; --i) { printf( ? 1 1 %d %d n , nr - 1, nc); fflush(stdout); char tmp[5]; scanf( %s , tmp); if (!strcmp(tmp, BAD )) { printf( F**K n ); return 0; } else if (!strcmp(tmp, YES )) { --nr; ans[i] = D ; } else if (!strcmp(tmp, NO )) { --nc; ans[i] = R ; } else { printf( F**K n ); return 0; } } printf( ! %s n , ans); fflush(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> inline void smin(A &a, const B &b) { if (a > b) a = b; } struct point { double x, y, z; inline point(double x = 0, double y = 0, double z = 0) : x(x), y(y), z(z) {} inline point operator-(point a) { return point(x - a.x, y - a.y, z - a.z); } inline double al() { return atan2(y, x); } inline double nor2() { return *this * *this; } inline double nor() { return sqrt(*this * *this); } inline double operator*(point a) { return x * a.x + y * a.y + z * a.z; } inline void input() { scanf( %lf %lf %lf , &x, &y, &z); } inline void print() { printf( %lf %lf %lf n , x, y, z); } } A, B, A_, B_, F; double r, h, R; double all = 6.283185307179586476925286766559; double _120 = 2.0943951023931954923084289221863; double _150 = 2.2689280275926284500007979990352; inline double dist(point a, point b) { double al = fabs(a.al() - b.al()); smin(al, all - al); double da = (a - F).nor2(), db = (b - F).nor2(); return sqrt(da + db - 2 * sqrt(da * db) * cos(r * al / R)); } inline double calc_A() { double ans = 1e100; for (double st_ = 0; st_ < all; st_ += _120) { double st = st_, ed = st + _120 + 0.1; while (ed - st > 1e-6) { double a = (st + st + ed) / 3; B_ = {r * cos(a), r * sin(a)}; double val_a = (A_ - B_).nor() + dist(B, B_); double b = (st + ed + ed) / 3; B_ = {r * cos(b), r * sin(b)}; double val_b = (A_ - B_).nor() + dist(B, B_); if (val_a < val_b) ed = b; else st = a; } double al = (st + ed) / 2; B_ = {r * cos(al), r * sin(al)}; smin(ans, (A_ - B_).nor() + dist(B, B_)); } return ans; } int main() { scanf( %lf %lf , &r, &h); F = point(0, 0, h); R = sqrt(r * r + h * h); A.input(), B.input(); if (A.z > B.z) swap(A, B); double ans; if (B.z < 1e-6) ans = (A - B).nor(); else if (A.z < 1e-6) A_ = A, ans = calc_A(); else { ans = dist(A, B); for (double st_ = 0; st_ < all; st_ += _120) { double st = st_, ed = st + _120 + 0.1; while (ed - st > 1e-6) { double a = (st + st + ed) / 3; A_ = {r * cos(a), r * sin(a)}; double val_a = dist(A, A_) + calc_A(); double b = (st + ed + ed) / 3; A_ = {r * cos(b), r * sin(b)}; double val_b = dist(A, A_) + calc_A(); if (val_a < val_b) ed = b; else st = a; } double al = (st + ed) / 2; A_ = {r * cos(al), r * sin(al)}; smin(ans, dist(A, A_) + calc_A()); } } printf( %.6lf , ans); } |
#include <bits/stdc++.h> using namespace std; const int N = 255; const int md = 1e9 + 7; char c[N][N]; int as, n, m, d, mk, f[2][(1 << 17) + 1][2]; void upd(int &x, int y) { x += y; x >= md ? x -= md : 0; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , c[i] + 1); if (n < m) { for (int i = 1; i <= n; i++) for (int j = i; j <= m; j++) swap(c[i][j], c[j][i]); swap(n, m); } mk = (1 << (m + 1)), f[0][0][0] = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { d ^= 1, memset(f[d], 0, sizeof(f[d])); for (int s = 0, x, p, q, s0, s1, t; s < mk; s++) { t = s; x = j - 1, p = (s >> x) & 1, q = (s >> j) & 1, s0 = f[d ^ 1][s][0], s1 = f[d ^ 1][s][1]; if (!s0 && !s1) continue; if (p) t -= 1 << x; if (q) t -= 1 << j; if (c[i][j] == x ) { upd(f[d][t][0], s0), upd(f[d][t][1], s1); continue; } upd(f[d][s | 1 << x | 1 << j][0], s0); upd(f[d][s | 1 << x | 1 << j][1], s1); if (p || q) upd(f[d][t | (q << x) | (p << j)][0], s0), upd(f[d][t | (q << x) | (p << j)][1], s1); else upd(f[d][t][1], s0); } } d ^= 1, memset(f[d], 0, sizeof(f[d])); for (int s = 0; s < mk; s++) upd(f[d][(s << 1) & (mk - 1)][0], f[d ^ 1][s][0]), upd(f[d][(s << 1) & (mk - 1)][1], f[d ^ 1][s][1]); } for (int s = 0; s < mk; s++) upd(as, f[d][s][0]), upd(as, f[d][s][1]); printf( %d , as); } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 100000000000; long long Ceil(long long a, long long b) { return (a / b) + ((a % b) != 0); } int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long cb = 0, rem = 0, total = 0; while (n / 10 > 0) { cb = n / 10; rem = n % 10; total += cb * 10; n = cb + rem; } cout << total + (n % 10) << endl; } } |
#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { unsigned int a, b, c, d; scanf( %u %u %u %u , &a, &b, &c, &d); if (a <= b) printf( %u n , b); else if (c <= d) printf( -1 n ); else { unsigned long long f = (a - b) % (c - d) == 0 ? (a - b) / (c - d) : ((a - b) / (c - d) + 1); unsigned long long g = b + c * f; printf( %llu n , g); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long kkkk = 1; unsigned long long n, i, k, a, j, cont = 0, cont1 = 0, cont2 = 0, x; cin >> n >> k; vector<int> vec; for (i = 0; i < n; i++) { cin >> a; vec.push_back(a); if (vec[i] % 2 != 0) { cont += 1; } } for (j = cont; j >= k; j = j - 2) { if (j == k) { cont1 += 1; break; } } if (cont1 > 0) { cout << YES << endl; } else { cout << NO << endl; continue; } if (cont >= k) { for (i = 0;; i++) { if (kkkk == k) break; if (vec[i] % 2 != 0) { cont2 += 1; cout << i + 1 << ; x++; kkkk++; } } cout << n << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int dr[] = {0, -1, 0, 1, -1, 1, 1, -1}; const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1}; const double eps = 1e-9; template <class T> void print(const vector<T> &v) { ostringstream os; for (int i = 0; i < (int)v.size(); ++i) { if (i) os << ; os << v[i]; } cout << os.str() << endl; } template <class T> int sz(const T &c) { return (int)c.size(); } template <class T> void srt(T &c) { sort(c.begin(), c.end()); } template <class T> void checkmin(T &a, T b) { if (b < a) a = b; } template <class T> void checkmax(T &a, T b) { if (b > a) a = b; } template <class T> T sqr(T x) { return x * x; } template <class T, class U> T cast(U x) { ostringstream os; os << x; T res; istringstream is(os.str()); is >> res; return res; } template <class T> vector<T> split(string s, string x = ) { vector<T> res; for (int i = 0; i < s.size(); i++) { string a; while (i < (int)s.size() && x.find(s[i]) == string::npos) a += s[i++]; if (!a.empty()) res.push_back(cast<T>(a)); } return res; } template <class T> bool inside(T r, T c, T R, T C) { return r >= 0 && r < R && c >= 0 && c < C; } struct segment { int left, right, len; segment(int a, int b) : left(a), right(b), len(b - a) {} }; bool operator<(const segment &a, const segment &b) { if (a.len != b.len) return a.len > b.len; return a.left > b.left; } map<int, int> t; int n; void add(int i, int value) { for (; i < n; i |= i + 1) t[i] += value; } int sum(int i) { int res = 0; for (; i >= 0; i -= -~i & ~i) if (t.count(i)) res += t[i]; return res; } int sum(int a, int b) { return sum(b) - sum(a - 1); } int main(int argc, char *argv[]) { int m; scanf( %d%d , &n, &m); set<segment> q; q.insert(segment(1, n)); set<int> points; points.insert(0); points.insert(n + 1); map<int, int> pos; while (m--) { int x; scanf( %d , &x); if (x == 0) { int a, b; scanf( %d%d , &a, &b); printf( %d n , sum(a - 1, b - 1)); } else { if (pos[x] == 0) { segment s = *q.begin(); q.erase(s); int mid = (s.left + s.right + 1) / 2; pos[x] = mid; points.insert(mid); add(mid - 1, 1); if (s.left <= mid - 1) q.insert(segment(s.left, mid - 1)); if (mid + 1 <= s.right) q.insert(segment(mid + 1, s.right)); } else { int mid = pos[x]; set<int>::iterator it = points.find(mid); int pre = *--it; int nxt = *++ ++it; if (pre + 1 <= mid - 1) q.erase(segment(pre + 1, mid - 1)); if (mid + 1 <= nxt - 1) q.erase(segment(mid + 1, nxt - 1)); if (pre + 1 <= nxt - 1) q.insert(segment(pre + 1, nxt - 1)); points.erase(mid); add(mid - 1, -1); pos[x] = 0; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; string v[12] = { x^y^z , x^z^y , (x^y)^z , (x^z)^y , y^x^z , y^z^x , (y^x)^z , (y^z)^x , z^x^y , z^y^x , (z^x)^y , (z^y)^x }; pair<long double, long double> sol[12]; const long double EPS = 1e-12; long double cmp(pair<long double, long double> a, pair<long double, long double> b) { long double res1, res2; res1 = a.second * log(a.first); res2 = b.second * log(b.first); if (abs(res1 - res2) < EPS) return 0; return res1 - res2; } int main() { int i, pos; long double x, y, z; cin >> x >> y >> z; sol[0] = {x, pow(y, z)}; sol[1] = {x, pow(z, y)}; sol[2] = {x, y * z}; sol[3] = {x, z * y}; sol[4] = {y, pow(x, z)}; sol[5] = {y, pow(z, x)}; sol[6] = {y, x * z}; sol[6] = {y, z * x}; sol[8] = {z, pow(x, y)}; sol[9] = {z, pow(y, x)}; sol[10] = {z, x * y}; sol[11] = {z, y * x}; pos = 0; for (i = 1; i < 12; ++i) { if (cmp(sol[pos], sol[i]) < 0) pos = i; } cout << v[pos]; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.