func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int maxn = (int)1e5 + 100; double alpha[maxn], beta[maxn]; double a[maxn], b[maxn]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lf , &beta[i]); for (int i = 0; i < n; i++) scanf( %lf , &alpha[i]); double Sa = 0, Sb = 0; for (int i = 0; i < n; i++) { double c = alpha[i] + beta[i]; double A = 1, B = -(c + (Sb - Sa)), C = beta[i] - c * Sa; double x1 = (-B + sqrt(max(0., B * B - 4. * A * C))) / 2.; double y1 = c - x1; a[i] = x1; b[i] = y1; Sa += a[i]; Sb += b[i]; } cout.precision(15); for (int i = 0; i < n; i++) printf( %.9lf , a[i]); printf( n ); for (int i = 0; i < n; i++) printf( %.9lf , b[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5010; const int mod = 1e9 + 7; const long long INF = 1e15; int nex[N]; long long x[N], a[N], b[N], c[N], d[N]; int main() { int n, s, e; while (~scanf( %d%d%d , &n, &s, &e)) { nex[s] = e; for (int i = 1; i <= n; i++) scanf( %I64d , &x[i]); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= n; i++) scanf( %I64d , &b[i]); for (int i = 1l; i <= n; i++) scanf( %I64d , &c[i]); for (int i = 1; i <= n; i++) scanf( %I64d , &d[i]); for (int i = 1; i <= n; i++) { if (i == s || i == e) continue; long long mi = INF, id; for (int j = s; j != e; j = nex[j]) { long long tmpans = 0; int from = j, to = i; if (to < from) tmpans += abs(x[from] - x[to]) + c[from] + b[to]; else tmpans += abs(x[from] - x[to]) + d[from] + a[to]; from = i, to = nex[j]; if (to < from) tmpans += abs(x[from] - x[to]) + c[from] + b[to]; else tmpans += abs(x[from] - x[to]) + d[from] + a[to]; from = j, to = nex[j]; if (to < from) tmpans -= abs(x[from] - x[to]) + c[from] + b[to]; else tmpans -= abs(x[from] - x[to]) + d[from] + a[to]; if (mi > tmpans) { mi = tmpans; id = j; } } int tmpnex = nex[id]; nex[id] = i; nex[i] = tmpnex; } long long ans = 0; for (int i = s; i != e; i = nex[i]) { long long tmpans = 0; int from = i, to = nex[i]; if (to < from) tmpans += abs(x[from] - x[to]) + c[from] + b[to]; else tmpans += abs(x[from] - x[to]) + d[from] + a[to]; ans += tmpans; } printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace chrono; long long int ceil(long long int r, long long int d) { return (r / d) + (bool)(r % d); } void inputAArray(int siz, vector<int> &arr) { for (int i = 0; i < siz; i++) arr[i] = 1 + rand(); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); srand(time(0)); int t; cin >> t; while (t--) { string s; cin >> s; int n = s.length(); if (n & 1) { cout << NO << endl; continue; } if (s.substr(0, n / 2) == s.substr(n / 2)) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; double n, l, v1, v2, k; bool c(double x) { int num; if ((int)n % (int)k == 0) num = n / k; else num = n / k + 1; if (num * x + (num - 1) * x * (v2 - v1) / (v2 + v1) <= x + (l - x * v2) / v1) return 1; return 0; } int main() { scanf( %lf%lf%lf%lf%lf , &n, &l, &v1, &v2, &k); double lb = 0, rb = 1000000001; for (int i = 0; i < 100; i++) { double m = (lb + rb) / 2; if (c(m)) lb = m; else rb = m; } printf( %lf , rb + (l - rb * v2) / v1); return 0; } |
#include <bits/stdc++.h> using namespace std; int t, n, m, i, ans, a; int main() { cin >> t; while (t--) { cin >> n >> m; ans = 0; for (i = 1; i <= n; i++) { cin >> a; ans += a; } if (ans == m) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int maxn = 1000100; int n; char a[maxn + 5]; inline bool check(int first) { vector<int> man, aster; for (int i = (0), i_end_ = (n); i < i_end_; ++i) { if (a[i] == P ) man.push_back(i); else if (a[i] == * ) aster.push_back(i); } int nman = (int((man).size())), naster = (int((aster).size())); static bool dp[maxn + 5][2]; memset(dp, 0, sizeof dp); int j = nman - 1; dp[naster][0] = dp[naster][1] = 1; for (int i = naster - 1; i >= 0; --i) { j = min((int((man).size())) - 1, j + 1); while (j >= 0 && man[j] > aster[i]) { bool ok = 0; if (man[j] - first <= aster[i]) { int tmp = man[j]; if (j && man[j - 1] > aster[i]) chkmax(tmp, man[j - 1] + first); int fir = upper_bound((aster).begin(), (aster).end(), tmp) - aster.begin(); if (fir == naster || (j + 1 < (int((man).size())) && aster[fir] > man[j + 1])) ok = dp[fir][1]; else ok = dp[fir][0]; } if (ok) { dp[i][0] = 1; break; } --j; } if (dp[i][0]) dp[i][1] = 1; else { if (j >= 0) { int tmp = man[j] + first; int fir = upper_bound((aster).begin(), (aster).end(), tmp) - aster.begin(); if (fir == naster || (j + 1 < (int((man).size())) && aster[fir] > man[j + 1])) { dp[i][1] = dp[fir][1]; } else dp[i][1] = dp[fir][0]; } } } return dp[0][1]; } int main() { scanf( %d , &n); scanf( %s , a); bool unique = 1; int p = -1; int Max = 0, Min = oo; int tot = 0, left = 0; for (int i = (0), i_end_ = (n); i < i_end_; ++i) if (a[i] == P ) { if (~p) { unique = 0; } else { left = tot; p = i; } } else if (a[i] == * ) { ++tot; chkmin(Min, i), chkmax(Max, i); } if (unique) { int right = tot - left; int left_dis = p - Min; int right_dis = Max - p; auto tmp = max(make_pair(left, -left_dis), make_pair(right, -right_dis)); tmp.second = -tmp.second; printf( %d %d n , tmp.first, tmp.second); } else { int l = 0, r = n; while (l < r) { int mid = (l + r) >> 1; if (check(mid)) r = mid; else l = mid + 1; } printf( %d %d n , tot, l); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; int N, M, dp[MAXN], res = 0; vector<pair<int, int>> adj[MAXN]; int check(int v) { if (dp[v]) return dp[v]; dp[v] = 1; for (auto p : adj[v]) { int n = p.first; if (check(n) + 1 > dp[v]) { dp[v] = dp[n] + 1; res = max(res, p.second); } } return dp[v]; } int main() { scanf( %d%d , &N, &M); for (int i = 0; i < M; i++) { int a, b; scanf( %d%d , &a, &b); a -= 1, b -= 1; adj[a].push_back({b, i + 1}); } for (int i = 0; i < N; i++) { if (check(i) == N) { printf( %d , res); return 0; } } printf( -1 ); } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; template <typename T> using V = std::vector<T>; struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; int gcd(int a, int b) { return a ? gcd(b % a, a) : b; } int main() { int n, m, k; scanf( %d , &n), scanf( %d , &m), scanf( %d , &k); int d = gcd(n, k); int n1 = n / d; k /= d; d = gcd(m, k); int m1 = m / d; k /= d; if (k > 2) { puts( NO ); return 0; } puts( YES ); if (k == 1) { if (n1 * 2 <= n) n1 *= 2; else m1 *= 2; } printf( 0 0 n0 %d n%d 0 n , m1, n1); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; pair<string, string> arr[n]; for (int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second; for (int i = 0; i < n; i++) if (arr[i].second == rat ) cout << arr[i].first << endl; for (int i = 0; i < n; i++) if (arr[i].second == woman || arr[i].second == child ) cout << arr[i].first << endl; for (int i = 0; i < n; i++) if (arr[i].second == man ) cout << arr[i].first << endl; for (int i = 0; i < n; i++) if (arr[i].second == captain ) cout << arr[i].first << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; std::map<long long, long long> factors; void primeFactors(long long n) { while (n % 2 == 0) { factors[2]++; n = n / 2; } for (long long i = 3; i <= sqrt(n); i = i + 2) { while (n % i == 0) { factors[i]++; n = n / i; } } if (n > 2) factors[n]++; } long long i, j; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; long long ans = 0; for (i = 2; i <= n; i++) { long long x = n / (i); ans += (i) * (x - 1); } cout << ans * 4 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long powmod(long long a, long long b) { if (b == 0) return 1; long long x = powmod(a, b / 2); long long y = (x * x) % 1000000007; if (b % 2) return (a * y) % 1000000007; return y % 1000000007; } long long mulmod(long long a, long long b, long long c) { long long x = 0, y = a % c; while (b > 0) { if (b % 2 == 1) { x = (x + y) % c; } y = (y * 2) % c; b /= 2; } return x % c; } int main() { long long a, b, x, n; cin >> a >> b >> n >> x; long long nm1, nm2, nm3, nm4, nm5; if (a > 1) { nm1 = powmod(a, n); nm2 = (nm1 - 1 + 1000000007) % 1000000007; nm3 = (x * nm1) % 1000000007; nm4 = (a - 1 + 1000000007) % 1000000007; nm5 = (nm2 * powmod(nm4, 1000000007 - 2)) % 1000000007; long long nm6 = (nm3 + (nm5 * b) % 1000000007) % 1000000007; cout << nm6 << endl; } else cout << (x + mulmod(b, n, 1000000007)) % 1000000007 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char buf[1 << 21], *p1 = buf, *p2 = buf; inline long long qread() { register char c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); register long long x = 0, f = 1; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 48; c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); } return x * f; } inline long long Abs(const long long& x) { return (x > 0 ? x : -x); } inline long long Max(const long long& x, const long long& y) { return (x > y ? x : y); } inline long long Min(const long long& x, const long long& y) { return (x < y ? x : y); } long long n, l, wmax; vector<long long> ml, mr; inline long long Div(long long x, long long y) { if (!y) { if (x > 0) return 2147483647; else return -2147483647; } if (x % y < 0) x -= (y + x % y); return x / y; } inline void Read() { n = qread(); l = qread(); wmax = qread(); for (register long long i = 1; i <= n; i++) { register long long x = qread(), v = qread(); if (v == 1) mr.push_back(x); else ml.push_back(x); } } inline void Solve() { register long long siz = ml.size(); register long long ans = 0; for (register long long i = 0; i < siz; i++) { auto lmost = lower_bound(mr.begin(), mr.end(), -ml[i] - l); ans += upper_bound( mr.begin(), lmost, Min(Div((ml[i] + l) * (wmax + 1) - 1, wmax - 1), -ml[i] - l)) - mr.begin(); ans += upper_bound(lmost, mr.end(), Min(Div((ml[i] + l) * (wmax - 1) - 1, wmax + 1), ml[i])) - lmost; } printf( %lld , ans); } signed main() { Read(); sort(ml.begin(), ml.end()); sort(mr.begin(), mr.end()); Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long n, d, k, l, m, i, j, a[105], b[2]; int main() { cin >> n >> d >> l; b[0] = n / 2; b[1] = n - b[0]; k = 0; if (d > l * b[1] - b[0] || d < b[1] - l * b[0]) { cout << -1 << endl; return 0; } else { for (i = 1; i <= n; i += 2) { a[i] = 1; k++; } for (i = 2; i <= n; i += 2) { a[i] = l; k -= l; } } i = 1; while (d != k && i <= n) { if (k + l - 1 <= d) { a[i] = l; k = k - 1 + l; } else { a[i] += d - k; k = d; } i += 2; } i = 2; while (d != k && i <= n) { if (k + l - 1 <= d) { a[i] = 1; k = k - 1 + l; } else { a[i] -= d - k; k = d; } i += 2; } cout << a[1]; for (i = 2; i <= n; i++) cout << << a[i]; cout << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; struct Node { long long val[4], len; Node() { memset(val, 0, sizeof(val)); len = 0; } }; vector<Node> tree; long long n, m; string s; long long ch[100]; long long choice(long long i, long long j = -1) { long long res = s[i] - 0 ; if (~j) res = res * 10 + s[j] - 0 ; return ch[res]; } Node join(Node &left, Node &right, long long l, long long r) { Node res; long long na = left.len == 1 ? 0 : 1; long long nb = right.len == 1 ? 0 : 2; res.len = left.len + right.len; res.val[0] = left.val[na] * right.val[nb] % mod; res.val[1] = left.val[na] * right.val[3] % mod; res.val[2] = left.val[3] * right.val[nb] % mod; res.val[3] = left.val[3] * right.val[3] % mod; if (s[l] == 1 ) { na = left.len == 1 ? 2 : 0; nb = right.len == 1 ? 1 : 0; res.val[na + nb] += left.val[0] * right.val[0] % mod * choice(l, r) % mod; res.val[na + 1] += left.val[0] * right.val[1] % mod * choice(l, r) % mod; res.val[2 + nb] += left.val[2] * right.val[0] % mod * choice(l, r) % mod; res.val[3] += left.val[2] * right.val[1] % mod * choice(l, r) % mod; } for (long long i = 0; i < 4; ++i) res.val[i] %= mod; return res; } void build(long long node = 1, long long start = 0, long long end = n - 1) { tree[node].len = end - start + 1; if (start == end) { tree[node].val[0] = 1; tree[node].val[3] = s[start] - 0 + 1; return; } long long mid = start + end >> 1; build(node << 1, start, mid); build(node << 1 | 1, mid + 1, end); tree[node] = join(tree[node << 1], tree[node << 1 | 1], mid, mid + 1); } void update(long long id, long long val, long long node = 1, long long start = 0, long long end = n - 1) { if (start == end) { s[id] = char(val + 0 ); tree[node].val[3] = val + 1; return; } long long mid = start + end >> 1; if (id <= mid) update(id, val, node << 1, start, mid); else update(id, val, node << 1 | 1, mid + 1, end); tree[node] = join(tree[node << 1], tree[node << 1 | 1], mid, mid + 1); } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); for (long long i = 0; i <= 9; ++i) { for (long long j = 0; j <= 9; ++j) ch[i + j]++; } cin >> n >> m; cin >> s; tree.resize((n + 10) << 2); build(); while (m--) { long long id, x; cin >> id >> x; id--; update(id, x); cout << tree[1].val[3] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; map<int, vector<int> > pos; map<int, int> result; for (int i = 0; i < n; i++) { int t; cin >> t; if (pos.find(t) == pos.end()) { vector<int> temp; temp.push_back(i + 1); pos.insert(pair<int, vector<int> >(t, temp)); } else { pos[t].push_back(i + 1); } } for (map<int, vector<int> >::iterator iter = pos.begin(); iter != pos.end(); iter++) { int len = iter->second.size(); if (len == 1) { result.insert(pair<int, int>(iter->first, 0)); continue; } int count = 2; int diff = iter->second[1] - iter->second[0]; for (int i = 1; i < len - 1; i++) { if (diff != iter->second[i + 1] - iter->second[i]) break; count++; } if (count == len) result.insert(pair<int, int>(iter->first, diff)); } cout << result.size() << endl; for (map<int, int>::iterator iter = result.begin(); iter != result.end(); iter++) cout << iter->first << << iter->second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int trees(vector<vector<int> >& v, int a, int b, int y, int x) { int trees = 0; for (int i = y; i < (y + a); ++i) { for (int j = x; j < (x + b); ++j) { trees += v[i][j]; } } return trees; } int main() { int n, m; cin >> n >> m; vector<vector<int> > v(n); int totTree = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { int tmp; cin >> tmp; v[i].push_back(tmp); totTree += tmp; } } int a, b; cin >> a >> b; int minTree = totTree; for (int i = 0; i + a - 1 < n; ++i) { for (int j = 0; j + b - 1 < m; ++j) { const int tr = trees(v, a, b, i, j); if (tr < minTree) { minTree = tr; } } } for (int i = 0; i + b - 1 < n; ++i) { for (int j = 0; j + a - 1 < m; ++j) { const int tr = trees(v, b, a, i, j); if (tr < minTree) { minTree = tr; } } } cout << minTree << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int n, m, len; cin >> n >> m; if (n >= 1 && n <= 100 && m >= 1 && m <= 100) { cin >> s; len = s.size(); if (len == n) { int l, r, z; char c1, c2; while (m--) { cin >> l >> r >> c1 >> c2; if (l >= 1 && l <= r && r <= n && c1 >= a && c1 <= z && c2 >= a && c2 <= z ) for (z = l - 1; z <= r - 1; z++) { if (s[z] == c1) { s[z] = c2; } } } cout << s << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353, inv2 = mod + 1 >> 1; inline void add(int &a, int b) { (a += b) >= mod && (a -= mod); } inline int Add(int a, int b) { return add(a, b), a; } inline void sub(int &a, int b) { (a -= b) < 0 && (a += mod); } inline int Sub(int a, int b) { return sub(a, b), a; } inline void mul(int &a, int b) { a = 1ll * a * b % mod; } inline int Mul(int a, int b) { return 1ll * a * b % mod; } const int N = 40, M = 1 << 20; int m, n, S, f[N][M], g[M], siz[M], x[M], y[M], res[M], ans[N]; long long b[M]; inline void XOR(int *a, int n, bool rev) { for (int k = 2, m = 1; k <= n; k <<= 1, m <<= 1) { for (int j = 0; j < n; j += k) for (int i = 0; i < m; ++i) { int x = a[j + i], y = a[j + i + m]; if (!rev) { a[j + i] = Add(x, y); a[j + i + m] = Sub(x, y); } else { a[j + i] = Mul(Add(x, y), inv2); a[j + i + m] = Mul(Sub(x, y), inv2); } } } } inline void FWT(int *a, int *b, int n) { memcpy(x, a, sizeof(x)), memcpy(y, b, sizeof(y)); XOR(x, n, 0), XOR(y, n, 0); for (int i = 0; i < n; ++i) res[i] = Mul(x[i], y[i]); XOR(res, n, 1); } void dfs1(long long x, int y) { if (y == m) return ++g[x], void(); dfs1(x, y + 1); if (b[y]) dfs1(x ^ b[y], y + 1); } void dfs2(long long x, int y) { if (y == n) return ++f[siz[x >> m]][x & (S - 1)], void(); dfs2(x, y + 1); if (b[y]) dfs2(x ^ b[y], y + 1); } int main() { scanf( %d%d , &m, &n); int tot = 1; for (int i = 1; i <= m; ++i) { long long x; scanf( %lld , &x), mul(tot, 2); for (int k = n - 1; ~k; --k) if (x >> k & 1) { if (!b[k]) { b[k] = x; mul(tot, inv2); break; } x ^= b[k]; } } m = n + 1 >> 1, S = 1 << m; for (int i = 0; i < S; ++i) siz[i] = siz[i >> 1] + (i & 1); dfs1(0, 0), dfs2(0, m); for (int i = 0; i <= n - m; ++i) { FWT(f[i], g, S); for (int s = 0; s < S; ++s) add(ans[i + siz[s]], res[s]); } for (int i = 0; i <= n; ++i) printf( %d , Mul(ans[i], tot)); return 0; } |
#include <bits/stdc++.h> using namespace std; int v[1005]; int a[1005], b[1005]; char s[1005]; vector<int> c, d; int main() { cin >> s + 1; int len = strlen(s + 1); int num = 0; for (int i = 1; i <= len; i++) { if (s[i] == ( ) { a[i]++; c.push_back(i); } a[i] += a[i - 1]; } for (int i = len; i; i--) { if (s[i] == ) ) { d.push_back(i); b[i]++; } b[i] += b[i - 1]; } sort((d).begin(), (d).end()); int l = 0, r = d.size() - 1; while (l < c.size() && r >= 0 && c[l] < d[r]) { l++; r--; num++; } if (!num) puts( 0 ); else { puts( 1 ); cout << l + d.size() - r - 1 << endl; for (int i = 0; i < l; i++) cout << c[i] << ; for (int i = r + 1; i < d.size(); i++) cout << d[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t; cin >> t; while (t--) { long long a, b, n, m; cin >> a >> b >> n >> m; if (a + b < n + m) { cout << no << n ; } else { long long v1 = min(a, b); long long v2 = max(a, b); if (v1 >= m) { cout << yes << n ; } else { cout << no << n ; } } } return 0; } |
#include <bits/stdc++.h> int n; char str[250000]; int main() { while (~scanf( %d , &n)) { scanf( %s , str); int len = strlen(str); int sum1 = 0, sum2 = 0; for (int i = 0; i < len; i++) { if (str[i] == < ) { sum1++; } else { break; } } for (int i = len - 1; i >= 0; i--) { if (str[i] == > ) { sum2++; } else { break; } } printf( %d n , sum1 + sum2); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 100009; unsigned long long a[MaxN], b[MaxN], c[MaxN]; int main() { unsigned long long n, ans = 0, p, sum = 0, sum2 = 0; cin >> n >> p; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { sum += a[i]; b[i] = sum % p; } for (int i = n - 1; i >= 0; i--) { sum2 += a[i]; c[i] = sum2 % p; } for (int i = 0; i < n; i++) ans = max(ans, (b[i] + c[i + 1])); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) const long long MOD = 1e9 + 7; long long n_bits(long long n) { long long x = __builtin_popcount(n); return x; } int pow(int a, int b, int m) { int ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { int n, p; cin >> n >> p; long long sum = 0; int a[n]; long long left = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } long long final = (sum - a[n - 1]) % p + a[n - 1] % p; sum -= a[n - 1]; left = a[n - 1]; for (int i = n - 2; i > 0; i--) { left += a[i]; sum -= a[i]; final = max(final, left % p + sum % p); } cout << final; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; template <class t, class u> void chmax(t& first, u second) { if (first < second) first = second; } template <class t, class u> void chmin(t& first, u second) { if (second < first) first = second; } template <class t> using vc = vector<t>; template <class t> using vvc = vc<vc<t>>; using pi = pair<ll, ll>; using vi = vc<ll>; template <class t, class u> ostream& operator<<(ostream& os, const pair<t, u>& p) { return os << { << p.first << , << p.second << } ; } template <class t> ostream& operator<<(ostream& os, const vc<t>& v) { os << { ; for (auto e : v) os << e << , ; return os << } ; } using uint = unsigned; using ull = unsigned long long; template <class t, size_t n> ostream& operator<<(ostream& os, const array<t, n>& first) { return os << vc<t>(first.begin(), first.end()); } template <ll i, class T> void print_tuple(ostream&, const T&) {} template <ll i, class T, class H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << , ; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <class... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << { ; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << } ; } template <class t> void print(t x, ll suc = 1) { cout << x; if (suc == 1) cout << n ; if (suc == 2) cout << ; } ll read() { ll i; cin >> i; return i; } vi readvi(ll n, ll off = 0) { vi v(n); for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off; return v; } template <class T> void print(const vector<T>& v, ll suc = 1) { for (ll i = ll(0); i < ll(v.size()); i++) print(v[i], i == ll(v.size()) - 1 ? suc : 2); } string readString() { string s; cin >> s; return s; } template <class T> T sq(const T& t) { return t * t; } void yes(bool ex = true) { cout << Yes << n ; if (ex) exit(0); } void no(bool ex = true) { cout << No << n ; if (ex) exit(0); } void possible(bool ex = true) { cout << Possible << n ; if (ex) exit(0); } void impossible(bool ex = true) { cout << Impossible << n ; if (ex) exit(0); } constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; } const ll infLL = LLONG_MAX / 3; const ll inf = infLL; ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); } ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); } ll popcount(signed t) { return __builtin_popcount(t); } ll popcount(ll t) { return __builtin_popcountll(t); } bool ispow2(ll i) { return i && (i & -i) == i; } ll mask(ll i) { return (ll(1) << i) - 1; } bool inc(ll first, ll second, ll c) { return first <= second && second <= c; } template <class t> void mkuni(vc<t>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } ll rand_int(ll l, ll r) { static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count()); return uniform_int_distribution<ll>(l, r)(gen); } template <class t> void myshuffle(vc<t>& first) { for (ll i = ll(0); i < ll(ll(first.size())); i++) swap(first[i], first[rand_int(0, i)]); } template <class t> ll lwb(const vc<t>& v, const t& first) { return lower_bound(v.begin(), v.end(), first) - v.begin(); } signed main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20); ll n, m; cin >> n >> m; vi lv = readvi(n, -1); vi cost = readvi(n); vi c = readvi(n + m); void(0); vvc<ll> dp(m); for (ll i = ll(0); i < ll(n); i++) dp[lv[i]].push_back(-inf); { ll pre = 0; for (ll i = ll(0); i < ll(m); i++) { pre >>= 1; pre += ll(dp[i].size()); if (ll(dp[i].size())) dp[i].resize(pre, -inf); } } ll ans = 0; for (ll i = ll(n) - 1; i >= ll(0); i--) { for (ll j = ll(ll(dp[lv[i]].size()) - 1) - 1; j >= ll(0); j--) chmax(dp[lv[i]][j + 1], dp[lv[i]][j] - cost[i]); chmax(dp[lv[i]][0], -cost[i]); for (ll j = ll(0); j < ll(lv[i]); j++) { ll ad = 0; for (ll k = ll(0); k < ll(ll(dp[j].size())); k++) { ll u = popcount(k ^ (k + 1)); for (ll l = ll(0); l < ll(min(u, lv[i] - j)); l++) ad += c[j + l]; void(0); void(0); chmax(dp[lv[i]][(k + 1) >> min(ll(60), lv[i] - j)], dp[j][k] + ad - cost[i]); } } } void(0); for (ll i = ll(0); i < ll(m); i++) for (ll j = ll(0); j < ll(ll(dp[i].size())); j++) { ll cur = i, cnt = j + 1; ll val = dp[i][j]; void(0); while (cnt) { val += c[cur] * cnt; cur++; cnt >>= 1; } if (val == 7) { void(0); void(0); } chmax(ans, val); } print(ans); } |
#include <bits/stdc++.h> using namespace std; string s; int x, y, len, a, b; int main() { cin >> s; len = s.length(); for (int i = 0; i < len; ++i) { if (s[i] == ( ) ++x; else if (s[i] == ) ) --x; else if (s[i] == # ) --x, ++y; if (x < 0) { puts( -1 ); exit(0); } } for (int i = 0; i < len; ++i) { if (s[i] == # ) { ++a; if (a == y) b -= x; --b; } if (s[i] == ( ) ++b; else if (s[i] == ) ) --b; if (b < 0) { puts( -1 ); exit(0); } } for (int i = 1; i < y; ++i) puts( 1 ); printf( %d , x + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[105][105]; int sum[2][105]; bool inv[2][105]; int main() { while (scanf( %d%d , &n, &m) == 2) { memset(inv, false, sizeof(inv)); memset(sum, 0, sizeof(sum)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , a[i] + j); sum[0][i] += a[i][j]; sum[1][j] += a[i][j]; } } while (1) { int idx = -1; for (int i = 0; i < n; i++) { if (sum[0][i] < 0) { idx = i; break; } } if (idx != -1) { inv[0][idx] ^= 1; sum[0][idx] = -sum[0][idx]; for (int i = 0; i < m; i++) { sum[1][i] -= a[idx][i]; a[idx][i] = -a[idx][i]; sum[1][i] += a[idx][i]; } continue; } for (int i = 0; i < m; i++) { if (sum[1][i] < 0) { idx = i; break; } } if (idx != -1) { inv[1][idx] ^= 1; sum[1][idx] = -sum[1][idx]; for (int i = 0; i < n; i++) { sum[0][i] -= a[i][idx]; a[i][idx] = -a[i][idx]; sum[0][i] += a[i][idx]; } continue; } break; } int cnt = 0; for (int i = 0; i < n; i++) if (inv[0][i]) cnt++; printf( %d , cnt); for (int i = 0; i < n; i++) if (inv[0][i]) printf( %d , i + 1); printf( n ); cnt = 0; for (int i = 0; i < m; i++) if (inv[1][i]) cnt++; printf( %d , cnt); for (int i = 0; i < m; i++) if (inv[1][i]) printf( %d , i + 1); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 2e9; const long long INF = 8e18; const int maxn = 2e5 + 5; int n, k, cnt; int a[maxn], b[maxn], p[maxn], fp[maxn], num[maxn]; vector<int> zz[maxn]; inline void init() { cin >> n >> k; for (int i = 1; i <= n; ++i) { int x; cin >> x; ++num[x]; } for (int i = 1; i <= k; ++i) { int x; cin >> x; if (!p[x]) p[x] = ++cnt, fp[cnt] = x; a[cnt] += num[i]; while (num[i]--) zz[cnt].push_back(i); } for (int i = 1; i <= cnt; ++i) b[i] = fp[i] - fp[i + 1]; int x = 0; for (int i = cnt; i >= 1; --i) { if (!a[i]) x += b[i]; else b[i] += x, x = 0; } } int main() { ios::sync_with_stdio(false); cin.tie(0); init(); vector<vector<int> > ans; vector<pair<int, int> > now, last; for (int i = cnt; i >= 1; --i) { if (!a[i]) continue; last.push_back({i, a[i]}); } while (!last.empty()) { int val = 0, z = 0; vector<int> res; for (auto &x : last) { int id = x.first, w = x.second; val += b[id]; b[id] += z; int mi = min(x.second, val); w -= mi; val -= mi; while (mi--) res.push_back(id); if (w) now.push_back({id, w}), z = 0; else z = b[id]; } ans.push_back(res); last = now; now.clear(); } cout << ans.size() << n ; for (auto &x : ans) { cout << x.size() << ; for (auto y : x) { cout << zz[y].back() << ; zz[y].pop_back(); } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; char BUFFER[100000 + 5]; bool readn(int &n) { return scanf( %d , &n) == 1; } bool readl(long long &n) { return scanf( %I64d , &n) == 1; } bool readd(double &n) { return scanf( %lf , &n) == 1; } bool reads(string &s) { s = ; int n = scanf( %s , BUFFER); if (n == 1) s = BUFFER; return n == 1; } bool readln(string &s) { char *valid = gets(BUFFER); if (valid) s = BUFFER; return ((bool)valid); } int Print(long long a, long long b) { cout << a << << b; return 0; } void update(long long &su, long long n, long long mod) { su *= n; su %= mod; } int doit(long long n, long long mod) { long long su = 1; int i; for (i = 1; i < n; i++) { su *= 10; su %= mod; } update(su, 3, mod); update(su, 3, mod); update(su, 5, mod); update(su, 2, mod); update(su, 3, mod); update(su, 3, mod); su++; su %= mod; long long a = 1, b = 1; for (i = 0; i < n; i++) b *= 10; if (0 == su) return Print(a, b); su = mod - su; return Print(a + su, b + su); } int main() { long long a; cin >> a; doit(18, a); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long double PI = 4 * atan(1); int n, r, val[2001], x, flag, ch[2001]; bool isChild[2001][2001]; pair<int, int> p[2001]; vector<int> v[2001]; queue<int> q1, q2, ans; void solve(int i) { int rem = ch[i] - p[i].second; while (ans.size()) { x = ans.front(); if (isChild[i][x]) { if (rem > 0) { val[x]++; q2.push(x); } else { if (rem == 0) { q2.push(i); val[i] = val[x] + 1; } q2.push(x); } rem--; } else { q1.push(x); } ans.pop(); } if (rem == 0 || !q2.size()) { q2.push(i); val[i] = 1; } while (q1.size() && q2.size()) { if (val[q1.front()] >= val[q2.front()]) { ans.push(q1.front()); q1.pop(); } else { ans.push(q2.front()); q2.pop(); } } while (q1.size()) { ans.push(q1.front()); q1.pop(); } while (q2.size()) { ans.push(q2.front()); q2.pop(); } } void dfs(int i, int p) { for (int a : v[i]) { if (a != p) { dfs(a, i); } } solve(i); return; } void calc(int par, int i, int p) { ch[par]++; isChild[par][i] = true; for (int a : v[i]) { if (a != p) { calc(par, a, i); } } } int main() { ios::sync_with_stdio(0), cin.tie(0); cin >> n; for (int i = 1; i < n + 1; i++) { cin >> p[i].first >> p[i].second; if (p[i].first != 0) v[p[i].first].push_back(i); else r = i; } for (int i = 1; i < n + 1; i++) calc(i, i, p[i].first), ch[i]--; for (int i = 1; i < n + 1; i++) { if (p[i].second > ch[i]) { cout << NO ; return 0; } } dfs(r, 0); cout << YES n ; for (int i = 1; i < n + 1; i++) cout << val[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 50000 + 10; struct query { int type, x, y; } qu[maxn]; int n, fa[maxn]; long long val[maxn], sz[maxn]; vector<int> v[maxn]; bool mark[maxn], have[maxn]; long long d[maxn]; int dfs(int x) { sz[x] = 1; int ret = 0; for (auto i : v[x]) ret += dfs(i), sz[x] += sz[i]; for (auto i : v[x]) d[i] = (sz[x] - sz[i]) * val[x]; have[x] = ((ret || mark[x]) ? 1 : 0); if (ret >= 2 || mark[x]) { mark[x] = 1; return 1; } else return ret; } struct P { int to, ssum; long long dsum; }; vector<P> v2[maxn]; int fa2[maxn]; long long sz2[maxn], sz2sum[maxn]; long long pnum[maxn]; bool leaf[maxn]; void dfs2(int x, bool isfir = 0) { if (v2[x].empty()) { if (!isfir) return; pnum[x] = sz[x] * sz[x]; for (auto i : v[x]) pnum[x] -= sz[i] * sz[i]; return; } sz[x] = 1 + sz2[x]; pnum[x] = 0; for (auto i : v2[x]) dfs2(i.to, isfir), sz[x] += sz[i.to] + i.ssum, pnum[x] -= (sz[i.to] + i.ssum) * (sz[i.to] + i.ssum); pnum[x] += sz[x] * sz[x] - sz2sum[x]; } int getid(int x, int y) { for (int i = 0;; i++) if (v2[x][i].to == y) return i; } void build_graph(int num) { fill(mark, mark + n + 1, 0); fill(have, have + n + 1, 0); fill(leaf, leaf + n + 1, 1); for (int i = 1; i <= n; i++) v[i].clear(), v2[i].clear(); for (int i = 2; i <= n; i++) v[fa[i]].push_back(i); for (int i = 0; i < num; i++) { mark[qu[i].x] = 1; if (qu[i].type == 1) mark[qu[i].y] = 1; } mark[1] = 1; dfs(1); for (int i = 1; i <= n; i++) if (mark[i]) { sz2[i] = sz2sum[i] = 0; for (auto j : v[i]) if (!have[j]) sz2[i] += sz[j], sz2sum[i] += sz[j] * sz[j]; if (i == 1) continue; int j, ssum = 0; long long dsum = 0LL; for (j = i;; j = fa[j]) { dsum += d[j]; if (mark[fa[j]]) break; } ssum = sz[j] - sz[i]; j = fa[j]; v2[j].push_back((P){i, ssum, dsum}); fa2[i] = j; leaf[j] = 0; } } bool first = 1; void process(int num) { build_graph(num); long long nowans = 0LL, tot = (long long)n * n; for (int i = 1; i <= n; i++) { long long add = sz[i] * sz[i]; for (auto j : v[i]) add -= sz[j] * sz[j]; nowans += add * val[i]; } if (first) printf( %.15f n , ((double)nowans) / tot), first = 0; dfs2(1, 1); for (int i = 0; i < num; i++) { if (qu[i].type == 2) { int x = qu[i].x, nval = qu[i].y; nowans += pnum[x] * (nval - val[x]); for (auto &j : v2[x]) j.dsum += (sz[x] - j.ssum - sz[j.to]) * (nval - val[x]); val[x] = nval; printf( %.15f n , ((double)nowans) / tot); continue; } int x = qu[i].y, y = qu[i].x, id; for (int j = x; j != 1; j = fa2[j]) if (j == y || y == 1) { swap(x, y); break; } fa[y] = x; long long dif = 0LL; for (int j = y; j != 1; j = fa2[j]) { sz[fa2[j]] -= sz[y]; for (auto &k : v2[fa2[j]]) if (k.to != j) k.dsum -= val[fa2[j]] * sz[y]; else dif -= k.dsum; } int f = fa2[y]; id = getid(f, y); sz2[f] += v2[f][id].ssum; sz2sum[f] += (long long)v2[f][id].ssum * v2[f][id].ssum; swap(v2[f][id], v2[f][v2[f].size() - 1]); v2[f].pop_back(); v2[x].push_back((P){y, 0, val[x] * sz[x]}); fa2[y] = x; if (v2[f].empty()) pnum[f] = sz[f] * sz[f] - sz2sum[f]; for (int j = y; j != 1; j = fa2[j]) { sz[fa2[j]] += sz[y]; for (auto &k : v2[fa2[j]]) if (k.to != j) k.dsum += val[fa2[j]] * sz[y]; else dif += k.dsum; } nowans += 2 * dif * sz[y]; printf( %.15f n , ((double)nowans) / tot); dfs2(1); } } int main() { scanf( %d , &n); fa[1] = 1; for (int i = 2; i <= n; i++) scanf( %d , &fa[i]); for (int i = 1; i <= n; i++) scanf( %I64d , &val[i]); int Q; scanf( %d , &Q); int sq = (int)sqrt(Q + 0.5); for (int i = 0; i < Q; i++) { char c[5]; scanf( %s%d%d , c, &qu[i % sq].x, &qu[i % sq].y); qu[i % sq].type = (c[0] == P ? 1 : 2); if ((i % sq) == sq - 1 || i == Q - 1) process(i % sq + 1); } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, s; scanf( %lld , &a); a = a - 2; if (a % 3 == 0) { printf( 1 2 %lld , a - 1); } else printf( 1 1 %lld , a); return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) { return a; } return gcd(b, a % b); } int findGCD(int arr[], int n) { int result = arr[0]; for (int i = 1; i < n; i++) { result = gcd(arr[i], result); } return result; } void swap(int* a, int* b) { int t = *a; *a = *b; *b = t; } void merge(int arr[], int l, int m, int r) { int i, j, k; int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (i = 0; i < n1; i++) { L[i] = arr[l + i]; } for (j = 0; j < n2; j++) { R[j] = arr[m + 1 + j]; } i = 0; j = 0; k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; } } void mergeSort(int arr[], int l, int r) { if (l < r) { int m = l + (r - l) / 2; mergeSort(arr, l, m); mergeSort(arr, m + 1, r); merge(arr, l, m, r); } } int main() { int n, i, gcd, pointsToBeAdded = 0; cin >> n; int arr[n]; int differences[n - 1]; for (i = 0; i < n; i++) { cin >> arr[i]; } mergeSort(arr, 0, n - 1); for (i = 1; i < n; i++) { differences[i - 1] = arr[i] - arr[i - 1]; } gcd = findGCD(differences, n - 1); for (i = 0; i < n - 1; i++) { differences[i] /= gcd; pointsToBeAdded += differences[i] - 1; } cout << pointsToBeAdded; return 0; } |
#include <bits/stdc++.h> using namespace std; using i64 = long long; using f64 = double; using f80 = long double; using pii = pair<int, int>; using ptx = pair<f64, f64>; const int N = 105; bool f[N][N]; int n, m, first, second; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int tip = 1; int a, b; cin >> n >> m; cin >> first >> second; cout << first << << second << n ; f[first][second] = true; for (int j = 1; j <= m; ++j) { if (!f[first][j]) { cout << first << << j << n ; f[first][j] = true; a = first, b = j; } } tip = -1; for (int i = 1; i <= n; ++i) if (!f[i][m] && !f[i][1]) { for (a = i; true; b += tip) { cout << a << << b << n ; f[a][b] = true; if (!(1 <= b + tip && b + tip <= m)) break; } tip *= -1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, a[1003][1003], row[1003], col[1003]; int main() { scanf( %d%d%d , &n, &m, &k); int i, j; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 0; i <= n; i++) row[i] = i; for (i = 0; i <= m; i++) col[i] = i; char s; int x, y; for (i = 0; i < k; i++) { scanf( n%c %d %d , &s, &x, &y); if (s == g ) printf( %d n , a[row[x]][col[y]]); if (s == c ) { j = col[x]; col[x] = col[y]; col[y] = j; } if (s == r ) { j = row[x]; row[x] = row[y]; row[y] = j; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long r(long long a) { long long i = 0; while (a % 2 == 0) { a /= 2; ++i; } return i; } void one_case() { long long a, b; cin >> a >> b; auto ra = r(a); auto rb = r(b); a /= (1ll << ra); b /= (1ll << rb); if (a != b) { cout << -1 n ; return; } cout << (abs(ra - rb) + 2) / 3 << n ; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int t = 1; cin >> t; while (t--) { one_case(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int high[500005], ata[500005], cost[500005], par[500005], der[500005]; long long ans; vector<int> v[500005]; int n, k, m, x, y, z; vector<pair<int, pair<int, int> > > e; int bul(int node, int ar[]) { if (node == ar[node]) return node; return ar[node] = bul(ar[node], ar); } void update(int a, int b, int cst) { a = bul(a, high); b = bul(b, high); while (a != b) { if (der[a] < der[b]) swap(a, b); cost[a] = cst; a = high[a] = bul(par[a], high); } } void dfs(int node, int ata) { par[node] = ata; der[node] = der[ata] + 1; for (int i : v[node]) if (i != ata) dfs(i, node); } int main() { scanf( %d %d %d , &n, &k, &m); for (int i = 1; i <= n; i++) ata[i] = i; for (int i = 1; i <= k; i++) { scanf( %d %d , &x, &y); ata[bul(x, ata)] = bul(y, ata); v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= m; i++) { scanf( %d %d %d , &x, &y, &z); e.push_back({z, {x, y}}); } sort(e.begin(), e.end()); for (int i = 0; i < m; i++) { pair<int, pair<int, int> > edge = e[i]; if (bul(edge.second.first, ata) != bul(edge.second.second, ata)) { v[edge.second.first].push_back(edge.second.second); v[edge.second.second].push_back(edge.second.first); ata[ata[edge.second.first]] = ata[edge.second.second]; ans -= edge.first; } } dfs(1, 0); for (int i = 1; i <= n; i++) { high[i] = i; cost[i] = 2000000000; } for (int i = 0; i < m; i++) { pair<int, pair<int, int> > edge = e[i]; update(edge.second.first, edge.second.second, edge.first); } for (int i = 2; i <= n; i++) { if (cost[i] == 2000000000) { printf( -1 ); return 0; } ans += cost[i]; } printf( %lld , ans); } |
#include <bits/stdc++.h> using namespace std; const int64_t inf = 1e18; vector<vector<int64_t> > adj; int64_t inp() { int64_t x; cin >> x; return x; } vector<int64_t> level; int64_t res = 0; void dfs(int64_t u, int64_t LV = 0) { level[u] = LV; res = max(res, LV); for (auto v : adj[u]) { dfs(v, LV + 1); } } int main() { ios::sync_with_stdio(0); cin.tie(0); for (int64_t _ = (1); _ >= (1); _--) { int64_t n; cin >> n; adj.resize(n + 1); level.resize(n + 1); for (int64_t node = (1); node <= (n); node++) adj[max(inp(), int64_t(0))].push_back(node); dfs(0); cout << res; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long po(long long a, long long x, long long m) { if (x == 0) { return 1; } long long ans = 1; long long k = 1; while (k <= x) { if (x & k) { ans = ((ans * a) % m); } k <<= 1; a *= a; a %= m; } return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; string a, b; cin >> a >> b; bool f[n + 1][2]; for (long long i = 0; i < n; i++) { if (a[i] == 1 || a[i] == 2 ) f[i][0] = false; else f[i][0] = true; if (b[i] == 1 || b[i] == 2 ) f[i][1] = false; else f[i][1] = true; } long long bll = 0; bool flag = true; bool k = false; for (long long i = 0; i < n; i++) { if (i != n && !f[i][bll]) { continue; } if (i != n && (f[i][0] && !f[i][1]) || (f[i][1] && !f[i][0])) { flag = false; break; } bll ^= 1; } if (flag && bll == 1) cout << YES << n ; else cout << NO << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 200100; int N, M; char S[MX]; int A[MX]; struct Segment { int a, b, c, d, e; int z, l, r; void add(int x) { a += x, b += x, c -= x, d -= x, z += x; } } T[MX << 2]; inline void PushUp(int i) { Segment &t = T[i], &x = T[(i << 1)], &y = T[(i << 1 | 1)]; t.a = max(x.a, y.a); t.b = min(x.b, y.b); t.c = max(max(x.c, y.c), x.a - 2 * y.b); t.d = max(max(x.d, y.d), y.a - 2 * x.b); t.e = max(max(x.e, y.e), max(x.c + y.a, x.a + y.d)); } inline void PushDown(int i) { if (T[i].z) T[(i << 1)].add(T[i].z), T[(i << 1 | 1)].add(T[i].z), T[i].z = 0; } void Build(int i, int l, int r) { T[i].l = l, T[i].r = r; if (l == r) { T[i].a = T[i].b = A[l], T[i].c = T[i].d = -A[l]; return; } int m = (l + r) >> 1; Build((i << 1), l, m), Build((i << 1 | 1), m + 1, r); PushUp(i); } void Add(int i, int a, int b, int x) { if (a <= T[i].l && T[i].r <= b) { T[i].add(x); return; } PushDown(i); if (a <= T[(i << 1)].r) Add((i << 1), a, b, x); if (b >= T[(i << 1 | 1)].l) Add((i << 1 | 1), a, b, x); PushUp(i); } int main() { int n; scanf( %d%d%s , &n, &M, S + 1), N = strlen(S + 1); for (int i = (1); i <= (N); ++i) A[i] = A[i - 1] + (S[i] == ( ? 1 : -1); Build(1, 0, N); printf( %d n , T[1].e); for (int i = (1); i <= (M); ++i) { int l, r; scanf( %d%d , &l, &r); if (l > r) swap(l, r); if (S[l] != S[r]) Add(1, l, r - 1, S[l] == ( ? -2 : 2), swap(S[l], S[r]); printf( %d n , T[1].e); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; int a[maxn]; int n, l, t; int main() { scanf( %d%d%d , &n, &l, &t); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } double ans = 0; int k = 2 * t / l, c = 2 * t % l; for (int i = 0; i < n; i++) { int w = a[i] - c; int cnt = 0; if (w >= 0) { cnt = i - (lower_bound(a, a + n, w) - a); } else { cnt += i; cnt += n - (lower_bound(a, a + n, l + w) - a); } ans += 0.5 * 0.5 * k * (n - 1) + 0.5 * 0.5 * cnt; } cout.setf(ios::fixed); cout << setprecision(9) << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > dist(51, vector<int>(3, 100)); int n, m; int dp[51][8]; void calc_s(int i, string &s) { for (int j = 0; j < s.length(); j++) { if (s[j] == # || s[j] == * || s[j] == & ) { dist[i][2] = min(dist[i][2], j); dist[i][2] = min(dist[i][2], m - j); } else if (s[j] >= a && s[j] <= z ) { dist[i][0] = min(dist[i][0], j); dist[i][0] = min(dist[i][0], m - j); } else if (s[j] >= 0 && s[j] <= 9 ) { dist[i][1] = min(dist[i][1], j); dist[i][1] = min(dist[i][1], m - j); } } } int calc(int i, int j) { if (j == 7) return 0; if (i == (n + 1)) return 100; if (dp[i][j] != -1) return dp[i][j]; int x = 100; for (int k = 0; k < 3; k++) { x = min(x, dist[i][k] + calc(i + 1, (j | (1 << k)))); } dp[i][j] = x; return dp[i][j]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; i++) { string s; cin >> s; calc_s(i, s); } memset(dp, -1, sizeof(dp)); cout << calc(1, 0); return 0; } |
#include <bits/stdc++.h> using namespace std; int mult(int a, int b, int p = 1000000007) { return ((a % p) * (b % p)) % p; } int multbig(int a, int b, int mod) { if (a == 0 or b == 0) return 0; if (a == 1 or b == 1) return (a * b) % mod; int cur = multbig(a, b / 2, mod); cur = (2 * cur) % mod; if (b % 2) cur = (cur + a) % mod; return cur; } int add(int a, int b, int p = 1000000007) { return (a % p + b % p) % p; } int fpow(int n, int k, int p = 1000000007) { int r = 1; for (; k; k >>= 1LL) { if (k & 1LL) r = mult(r, n, p); n = mult(n, n, p); } return r; } int inv(int a, int p = 1000000007) { return fpow(a, p - 2, p); } int inv_euclid(int a, int m = 1000000007) { int m0 = m; int y = 0, x = 1; if (m == 1) return 0; while (a > 1) { int q = a / m; int t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } vector<pair<int, int>> vvv; pair<int, int> aa[200003]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < (int)m; i++) { int p, q; cin >> p >> q; if (p > q) { swap(p, q); } aa[i].first = p; aa[i].second = q; vvv.push_back(make_pair(p, q)); } sort(vvv.begin(), vvv.end()); int f = 0; for (int i = 2; i <= n; i++) { if (n % i == 0) { int lol = n / i; vector<pair<int, int>> vv; for (int i = 0; i < (int)m; i++) { int p = aa[i].first + lol; int q = aa[i].second + lol; if (p > n) { p = p - n; } if (q > n) { q = q - n; } if (p > q) { swap(p, q); } vv.push_back(make_pair(p, q)); } sort(vv.begin(), vv.end()); if (vv == vvv) { f = 1; break; } } } if (f) { cout << Yes n ; } else cout << No n ; } |
#include <bits/stdc++.h> using namespace std; void dice() { int x, y; cin >> x >> y; x = max(x, y); vector<string> str; str = { 1/6 , 1/3 , 1/2 , 2/3 , 5/6 , 1/1 }; x = 6 - x + 1; cout << str[x - 1] << endl; } int main() { dice(); } |
#include <bits/stdc++.h> using namespace std; int ask(int c, int d) { cout << ? << c << << d << endl; fflush(stdout); int x; cin >> x; return x; } void go(int a, int b) { cout << ! << a << << b << endl; fflush(stdout); exit(0); } bool same[50]; signed main() { int type = ask(0, 0); if (type == 0) { int ans = 0; for (int i = 29; i >= 0; i--) { int q = ask((1 << i), 0); if (q == 0) { continue; } if (q == 1) { ans += 0; } else { ans += (1 << i); } } go(ans, ans); } bool A, B; if (type == 1) { A = 1; B = 0; } else { A = 0; B = 1; } int ansA = 0, ansB = 0; for (int i = 29; i >= 0; i--) { int q = ask(ansA + (1 << i), ansB + (1 << i)); if (q == 0) { for (int pos = i; pos >= 0; pos--) { same[pos] = 1; } break; } if (A == 1) { if (q == 1) { same[i] = 1; } else { ansA += (1 << i); ansB += 0; int qq = ask(ansA, ansB); if (qq == 1) A = 1, B = 0; if (qq == -1) A = 0, B = 1; } } else { if (q == -1) { same[i] = 1; } else { ansA += 0; ansB += (1 << i); int qq = ask(ansA, ansB); if (qq == 1) A = 1, B = 0; if (qq == -1) A = 0, B = 1; } } } for (int i = 29; i >= 0; i--) { if (same[i]) { int q = ask(ansA + (1 << i), ansB); if (q == 0) { continue; } if (q == 1) { ansA += 0; ansB += 0; } else { ansA += (1 << i); ansB += (1 << i); } } } go(ansA, ansB); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; bool z[MAXN] = {0}; void prework() { for (int i = 2; i <= 1000; i++) { if (z[i]) continue; for (int k = i + i; k <= 1000; k += i) z[k] = true; } } struct node { char c; int n; bool operator<(node b) const { return n > b.n; } }; vector<int> v; int num[50] = {0}; string s; node a[27]; char ans[1010] = {0}; int main() { prework(); string s; cin >> s; int L = s.size(); int all = 0; for (int i = 2; i <= L; i++) { if (z[i]) continue; if (i * 2 <= L) continue; v.push_back(i); all++; } v.push_back(1); all++; for (string::iterator k = s.begin(); k != s.end(); k++) num[*k - a + 1]++; for (int i = 1; i <= 26; i++) { a[i].c = a + i - 1; a[i].n = num[i]; } sort(a + 1, a + 27); all = L - all; if (a[1].n < all) { cout << NO << endl; return 0; } a[1].n -= all; int now = 1; for (vector<int>::iterator k = v.begin(); k != v.end(); k++) { while (!a[now].n) now++; ans[*k] = a[now].c; a[now].n--; } for (int i = 1; i <= L; i++) if (!ans[i]) ans[i] = a[1].c; cout << YES << endl; string sss(ans + 1); cout << sss << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n == 1) cout << 2; else if (n == 2) cout << 3; else if (n == 3) cout << 1; else if (n == 4) cout << 2; else cout << 1; return 0; } |
#include <bits/stdc++.h> using namespace std; const int Mo = (int)1e9 + 7; int i, j, m, n, p, k, sum, id, x, y, a[1000005], flag, ans; int power(int x, int y) { int sum = 1; for (; y; y >>= 1) { if (y & 1) sum = 1ll * x * sum % Mo; x = 1ll * x * x % Mo; } return sum; } int main() { scanf( %d%d%d , &n, &m, &k); id = 1; for (i = 1; i <= m; ++i) { scanf( %d%d , &x, &y); if (y - x != 1 && y - x != k + 1) { printf( 0 n ); return 0; } else if (y - x != 1) a[x]++, ++sum, id = x; } for (i = 1; i <= n; ++i) a[i] += a[i - 1]; for (i = id; i <= n && i + k + 1 <= n; ++i) if (a[max(0, i - k - 1)] == 0) ans = (ans + power(2, (i - 1 - max(0, i - k - 1) - (a[i - 1] - a[max(0, i - k - 1)])))) % Mo; if (!a[n]) ans = (ans + 1) % Mo; printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int MOD = int(1e9) + 7; const long long int MOD64 = (long long int)(1e18) + 7; const int INF = 0x7fffffff; const long long int INF64 = 0x7fffffffffffffff; const int N = 5000 + 10; int a[N], lnum[N], rnum[N]; int n, m; vector<int> H[N]; long long int cal(int x, int val) { int l = 0, r = H[x].size() - 1, ans = -1; while (l <= r) { int mid = (l + r) / 2; if (H[x][mid] <= val) { ans = mid; l = mid + 1; } else r = mid - 1; } return ans + 1; } pair<int, long long int> solve() { int ans = 0; long long int num = 1; for (int i = int(1); i < int(n + 1); i++) { long long int tmp = 0; tmp = cal(i, lnum[i]) * cal(i, rnum[i]) - cal(i, min(lnum[i], rnum[i])); if (tmp > 0) { ans += 2; num = (num * tmp) % MOD; continue; } tmp = cal(i, lnum[i]) + cal(i, rnum[i]); if (tmp != 0) { ans += 1; num = (num * tmp) % MOD; } } return {ans, num}; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = int(1); i < int(n + 1); i++) { cin >> a[i]; rnum[a[i]]++; } for (int i = int(0); i < int(m); i++) { int f, h; cin >> f >> h; H[f].push_back(h); } for (int i = int(1); i < int(n + 1); i++) sort((H[i]).begin(), (H[i]).end()); int ans = 0; long long int num = 0; for (int i = int(0); i < int(n + 1); i++) { rnum[a[i]]--; lnum[a[i]]++; pair<int, long long int> tmp = solve(); if (ans < tmp.first) { ans = tmp.first; num = tmp.second; } else if (ans == tmp.first) { num = (num + tmp.second) % MOD; } } memset(lnum, 0, sizeof(lnum)); memset(rnum, 0, sizeof(rnum)); for (int i = int(1); i < int(n + 1); i++) rnum[a[i]]++; for (int i = int(0); i < int(n); i++) { rnum[a[i + 1]]--; lnum[a[i]]++; pair<int, long long int> tmp = solve(); if (tmp.first == ans) num = (num - tmp.second + MOD) % MOD; } cout << ans << << num << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1000]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); double ans = 0; for (int i = 1; i <= m; ++i) { int x, y, z; scanf( %d%d%d , &x, &y, &z); ans = max(ans, ((double)a[x] + a[y]) / z); } printf( %.15f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int num; int num_num; } num[105]; int main() { int N, M; scanf( %d%d , &N, &M); num[0].num = 0; num[0].num_num = 0; for (int i = 1; i <= N; i++) { int flag; scanf( %d , &flag); num[i].num = num[i - 1].num + flag; num[i].num_num = 0; } while (M--) { int left, right; scanf( %d%d , &left, &right); if (left == right && num[left].num - num[left - 1].num > 0) num[left].num_num++; else if (left < right && num[right].num - num[left - 1].num >= 0) { for (int i = left; i <= right; i++) num[i].num_num++; } } long long int sum = 0; for (int i = 1; i <= N; i++) { sum += (num[i].num - num[i - 1].num) * num[i].num_num; } printf( %I64d n , sum); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; long long ar[maxn]; int main() { long long n, m; cin >> n >> m; long long a, b, c; cin >> a >> b >> c; ar[a] = 1, ar[b] = 2, ar[c] = 3; for (int i = 1; i < m; ++i) { cin >> a >> b >> c; if (!ar[a] and !ar[b] and !ar[c]) ar[a] = 1, ar[b] = 2, ar[c] = 3; else { if (ar[a]) { if (ar[a] == 1) ar[b] = 2, ar[c] = 3; else if (ar[a] == 2) ar[b] = 1, ar[c] = 3; else ar[b] = 1, ar[c] = 2; } else if (ar[b]) { if (ar[b] == 1) ar[a] = 2, ar[c] = 3; else if (ar[b] == 2) ar[a] = 1, ar[c] = 3; else ar[a] = 1, ar[c] = 2; } else if (ar[c]) { if (ar[c] == 1) ar[a] = 2, ar[b] = 3; else if (ar[c] == 2) ar[a] = 1, ar[b] = 3; else ar[a] = 1, ar[b] = 2; } } } for (int i = 1; i < n + 1; ++i) cout << ar[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double fs = 6e-2, Pi = acos(-1.0); struct point { double x, y; } p[4]; double a, b, c, r, S, C, P, C1, A1, B1, R1, Ans; double s(point a, point b) { return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); } double gcd(double a, double b) { return (fabs(b) > fs) ? gcd(b, fmod(a, b)) : a; } int main() { for (int i = 1; i <= 3; ++i) scanf( %lf%lf , &p[i].x, &p[i].y); a = s(p[1], p[2]), b = s(p[2], p[3]), c = s(p[1], p[3]), P = (a + b + c) / 2; S = sqrt(P * (P - a) * (P - b) * (P - c)), r = a * b * c / (4 * S); C1 = acos(1 - c * c / (2 * r * r)), A1 = acos(1 - a * a / (2 * r * r)), B1 = 2 * Pi - A1 - C1; R1 = gcd(A1, gcd(B1, C1)); return printf( %.6lf , (Pi * r * r * sin(R1)) / R1), 0; } |
#include <bits/stdc++.h> using namespace std; int dx[4] = {0, -1, 0, 1}; int dy[4] = {1, 0, -1, 0}; int x[100000], y[100000], DP[100000], CP[100000], R, C, used[50][50][4][4]; char s[64][64]; bool Out(int xx, int yy) { return xx < 0 || yy < 0 || xx >= R || yy >= C; } void next(int x1, int y1, int DP1, int CP1, int &x2, int &y2, int &DP2, int &CP2) { int i; for (i = 1;; i++) { int nx = x1 + dx[DP1] * i; int ny = y1 + dy[DP1] * i; if (Out(nx, ny) || s[nx][ny] != s[x1][y1]) break; } i--; x1 += dx[DP1] * i; y1 += dy[DP1] * i; for (i = 1;; i++) { int nx = x1 + dx[(DP1 + CP1) & 3] * i; int ny = y1 + dy[(DP1 + CP1) & 3] * i; if (Out(nx, ny) || s[nx][ny] != s[x1][y1]) break; } i--; x1 += dx[(DP1 + CP1) & 3] * i; y1 += dy[(DP1 + CP1) & 3] * i; int nx = x1 + dx[DP1]; int ny = y1 + dy[DP1]; if (Out(nx, ny) || !s[nx][ny]) { x2 = x1; y2 = y1; if (CP1 == 1) { CP2 = 3; DP2 = DP1; } else { CP2 = 1; DP2 = (DP1 + 3) & 3; } } else { x2 = nx; y2 = ny; DP2 = DP1; CP2 = CP1; } } int main() { int i, j, k, m; scanf( %d%d , &R, &m); for (i = 0; i < R; i++) scanf( %s , s[i]); C = strlen(s[0]); for (i = 0; i < R; i++) for (j = 0; j < C; j++) s[i][j] -= 0 ; CP[0] = 1; memset(used, -1, sizeof(used)); used[0][0][0][1] = 0; for (i = 1;; i++) { next(x[i - 1], y[i - 1], DP[i - 1], CP[i - 1], x[i], y[i], DP[i], CP[i]); if (used[x[i]][y[i]][DP[i]][CP[i]] >= 0) { break; } used[x[i]][y[i]][DP[i]][CP[i]] = i; } int tmp = used[x[i]][y[i]][DP[i]][CP[i]]; if (m < i) printf( %d n , (int)s[x[m]][y[m]]); else printf( %d n , (int)s[x[tmp + (m - tmp) % (i - tmp)]][y[tmp + (m - tmp) % (i - tmp)]]); return 0; } |
#include <bits/stdc++.h> using namespace std; string eq(string c) { string s = ; for (int i = 0; i < c.size(); i++) { if (c[i] == 2 ) s += 2 ; else if (c[i] == 3 ) s += 3 ; else if (c[i] == 4 ) s += 223 ; else if (c[i] == 5 ) s += 5 ; else if (c[i] == 6 ) s += 53 ; else if (c[i] == 7 ) s += 7 ; else if (c[i] == 8 ) s += 7222 ; else if (c[i] == 9 ) s += 7332 ; } sort(s.begin(), s.end()); reverse(s.begin(), s.end()); return s; } int main() { int n; string s; cin >> n >> s; cout << eq(s); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[4], num, sum; string s[4], str; bool check(char ch) { return ch == a || ch == e || ch == i || ch == o || ch == u ; } int work() { sum = 0; for (int i = str.length() - 1; i >= 0; i--) { sum += check(str[i]); if (sum == m) return i; } return -1; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 0; j < 4; j++) { cin >> str; num = work(); if (!~num) { puts( NO ); return 0; } s[j] = str.substr(num); } if (s[0] == s[1] && s[1] == s[2] && s[2] == s[3]) a[0] = 1; else if (s[0] == s[1] && s[2] == s[3]) a[1] = 1; else if (s[0] == s[2] && s[1] == s[3]) a[2] = 1; else if (s[0] == s[3] && s[1] == s[2]) a[3] = 1; else { puts( NO ); return 0; } } if (a[0] && !(a[1] || a[2] || a[3])) puts( aaaa ); else if (a[1] && !(a[2] || a[3])) puts( aabb ); else if (a[2] && !(a[1] || a[3])) puts( abab ); else if (a[3] && !(a[1] || a[2])) puts( abba ); else puts( NO ); return 0; } |
#include <bits/stdc++.h> int main() { long int n, a[100001], i, flag; char c[100001], c1; while (scanf( %ld , &n) == 1) { flag = 0; long int a1[100001] = {0}; c1 = getchar(); gets(c); for (i = 0; i < n; i++) { scanf( %ld , &a[i]); } i = 0; while (1) { if (c[i] == > && a1[i] == 0) { a1[i] = 1; i += a[i]; if (i >= n) { flag = 1; break; } } else if (c[i] == < && a1[i] == 0) { a1[i] = 1; i -= a[i]; if (i < 0) { flag = 1; break; } } else { flag = 0; break; } } if (flag == 1) { printf( FINITE n ); } else { printf( INFINITE n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } return x * f; } const int N = 5000 + 10; const int mod = 1e9 + 7; int n, dp[N][30], len, a[N], C[N][N], ans; signed main() { n = read(); for (int i = 1; i <= n; i++) { int ch; ch = getchar() - a + 1; if (ch != a[len]) a[++len] = ch; } C[0][0] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; dp[0][0] = 1; for (int i = 1; i <= len; i++) for (int j = i; j; j--) { int cur = a[i]; dp[j][cur] = 0; for (int k = 0; k <= 26; k++) if (k != cur) dp[j][cur] = (dp[j][cur] + dp[j - 1][k]) % mod; } for (int i = 1; i <= len; i++) { int tmp = 0; for (int j = 1; j <= 26; j++) tmp = (tmp + dp[i][j]) % mod; (ans += 1LL * tmp * C[n][i] % mod) %= mod; } cout << ans; return 0; ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int x = 2 * n, y = 3 * m; int k = 1; while (6 * k <= x && 6 * k <= y) { if (x + 2 <= y + 3) x += 2; else y += 3; k += 1; } cout << max(x, y); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int res = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) ch == - ? w = -1, ch = getchar() : ch = getchar(); while (ch >= 0 && ch <= 9 ) { res = res * 10 + ch - 0 ; ch = getchar(); } return w * res; } int n, a, b, c, d, e, f; int main() { a = read(); b = read(); c = read(); d = read(); e = read(); f = read(); int flag = 0; flag |= (b * d * f) > (a * c * e); flag |= (!c && d); flag |= (!a && b && c && d); flag |= (!e && f && a && b && c && d); flag ? printf( Ron n ) : printf( Hermione n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(0); cin.tie(NULL), cout.tie(NULL); } int main() { fast(); int n, k; cin >> n >> k; vector<int> v(n), vc(k + 1); for (int i = 0; i < n; i++) { cin >> v[i]; } auto it = unique(v.begin(), v.end()); v.resize(distance(v.begin(), it)); for (int i = 0; i < v.size(); i++) { vc[v[i]]++; if (i > 0 && i < v.size() - 1) { vc[v[i]] += (v[i - 1] == v[i + 1]); } } int pos = 1; for (int i = 1; i <= k; i++) { if (vc[i] > vc[pos]) { pos = i; } } cout << pos; return 0; } |
#include <bits/stdc++.h> long long p[16]; void F() { p[1] = 10; for (int i = 2; i <= 14; i++) p[i] = p[i - 1] * 10; } using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); F(); long long n, ans = 0; cin >> n; if (n < 10) { cout << n; return 0; } for (int i = 1; i <= 14; i++) { if (n / p[i] == 0) { long long a = p[i - 1] - 1; long long b = n - a; ostringstream str1, str2; str1 << a; str2 << b; string sa = str1.str(); string sb = str2.str(); for (auto x : sa) ans += x - 0 ; for (auto x : sb) ans += x - 0 ; cout << ans; return 0; } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; array<long long, 2> parent[1000][1000]; long long sze[1000][1000]; array<long long, 2> p(array<long long, 2> x) { if (x == parent[x[0]][x[1]]) { return x; } else { return parent[x[0]][x[1]] = p(parent[x[0]][x[1]]); } } void unite(array<long long, 2> x, array<long long, 2> y) { array<long long, 2> a = p(x); array<long long, 2> b = p(y); if (a != b) { if (sze[a[0]][a[1]] < sze[b[0]][b[1]]) { swap(a, b); } parent[b[0]][b[1]] = a; sze[a[0]][a[1]] += sze[b[0]][b[1]]; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n; cin >> n; unordered_map<long long, vector<array<long long, 2>>> m1; unordered_map<long long, vector<array<long long, 2>>> m2; vector<array<long long, 2>> a(n); for (long long i = 0; i < n; ++i) { long long x, y; cin >> x >> y; x--; y--; a[i] = {x, y}; m1[x].push_back({x, y}); m2[y].push_back({x, y}); } for (long long i = 0; i < 1000; ++i) { for (long long j = 0; j < 1000; ++j) { parent[i][j] = {i, j}; sze[i][j] = 1; } } for (auto i : a) { for (auto j : m1[i[0]]) { if (j == i) { continue; } unite(i, j); } for (auto j : m2[i[1]]) { if (j == i) { continue; } unite(i, j); } } long long ans = 0; for (auto i : a) { if (i == parent[i[0]][i[1]]) { ans++; } } cout << ans - 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int r, c, n, k; cin >> r >> c >> n >> k; int tab[r][c]; for (int i = 0; i < r; i++) for (int j = 0; j < c; j++) tab[i][j] = 0; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; --x; --y; tab[x][y] = 1; } int wyn = 0; for (int x1 = 0; x1 < r; x1++) for (int y1 = 0; y1 < c; y1++) for (int x2 = x1; x2 < r; x2++) for (int y2 = y1; y2 < c; y2++) { int v = 0; for (int i = x1; i <= x2; i++) for (int j = y1; j <= y2; j++) v += tab[i][j]; if (v >= k) wyn++; } cout << wyn; } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; int mod = 998244353; int T; int a[N], b[N], p[N]; bool vis[N]; int main() { scanf( %d , &T); while (T--) { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); p[a[i]] = i; vis[i] = 0; } for (int i = 1; i <= k; ++i) { scanf( %d , &b[i]); } int ans = 1; for (int i = k; i >= 1; --i) { int t = p[b[i]]; int kk = 0; if (t > 1 && !vis[t - 1]) kk++; if (t < n && !vis[t + 1]) kk++; vis[t] = 1; ans = (ans * kk) % mod; } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int tc; scanf( %d , &tc); for (int i = 0; i < tc; i++) { int N, K; scanf( %d %d , &N, &K); if (N < K) { printf( NO n ); continue; } if (N % 2 == 0) { if (2 * K <= N) { printf( YES n ); for (int j = 0; j < K - 1; j++) { if (j != 0) printf( ); printf( %d , 2); } printf( %d n , N - (2 * (K - 1))); } else if (N == K) { printf( YES n ); for (int j = 0; j < K; j++) { if (j != 0) printf( ); printf( %d , 1); } printf( n ); } else if (K % 2 != 0) { printf( NO n ); } else { bool flag = false; int count = 0; while (N > K) { count++; N -= 3; K -= 1; if (N == K) { flag = true; printf( YES n ); for (int l = 0; l < count; l++) { if (l != 0) printf( ); printf( %d , 3); } for (int l = 0; l < N; l++) { printf( %d , 1); } printf( n ); break; } } if (!flag) { printf( NO n ); } } } else { if (K % 2 != 1) { printf( NO n ); } else { printf( YES n ); for (int j = 0; j < K - 1; j++) { if (j != 0) printf( ); printf( %d , 1); } printf( %d n , N - ((K - 1))); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m, q; long long ans, in[N], out[N]; vector<int> f[N]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; ++i) { int x, y; scanf( %d%d , &x, &y); if (x > y) swap(x, y); f[x].push_back(y); in[y]++, out[x]++; } for (int i = 1; i <= n; ++i) ans += in[i] * out[i]; printf( %lld n , ans); scanf( %d , &q); while (q--) { int x; scanf( %d , &x); ans -= in[x] * out[x]; in[x] += out[x], out[x] = 0; for (int i = 0; i < f[x].size(); ++i) { int y = f[x][i]; ans -= in[y] * out[y]; out[y]++, in[y]--; ans += in[y] * out[y]; f[y].push_back(x); } f[x].clear(); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; long double x1, y1, x2, y2, s, x3, y3, x4, y4, x5, y5, x6, y6; cin >> a >> b >> c; cin >> x1 >> y1 >> x2 >> y2; x3 = x1; y3 = (-a * x3 - c) / b; y4 = y1; x4 = (-b * y4 - c) / a; x5 = x2; y5 = (-a * x5 - c) / b; y6 = y2; x6 = (-b * y6 - c) / a; s = min(min(min((abs(x1 - x2) + abs(y1 - y2)), (abs(y1 - y3) + abs(y2 - y5) + sqrt((y3 - y5) * (y3 - y5) + (x3 - x5) * (x3 - x5)))), min((abs(y1 - y3) + abs(x2 - x6) + sqrt((y3 - y6) * (y3 - y6) + (x3 - x6) * (x3 - x6))), (abs(x1 - x4) + abs(y2 - y5) + sqrt((y4 - y5) * (y4 - y5) + (x4 - x5) * (x4 - x5))))), (abs(x1 - x4) + abs(x2 - x6) + sqrt((y4 - y6) * (y4 - y6) + (x4 - x6) * (x4 - x6)))); cout << setprecision(19) << s; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ai, nb = 0; map<int, int> dict; map<int, int>::iterator it; cin >> n; int i = 0; while (i < n) { cin >> ai; dict[ai]++; i++; } for (it = dict.begin(); it != dict.end(); it++) { while ((it->second) > 1) { it->second = (it->second) - 2; nb++; } } cout << (nb / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N]; int b[N]; int main() { int n; cin >> n; a[1] = 0; for (int i = 2; i <= n; ++i) { int k; cin >> k; a[i] = a[i - 1] + k; } int x = 1e6; for (int j = 1; j <= n; ++j) { x = min(x, a[j]); } for (int i = 1; i <= n; ++i) { if (a[i] - x + 1 >= 1 && a[i] - x + 1 <= n) { b[a[i] - x + 1] = 1; } } for (int i = 1; i <= n; ++i) { if (b[i] == 0) { cout << -1 << endl; return 0; } } for (int i = 1; i <= n; ++i) { cout << a[i] - x + 1 << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; queue<pair<int, int> > q; int c[2048][2048]; int dr[4] = {-1, 0, 1, 0}; int dc[4] = {0, 1, 0, -1}, nr, nc; int main() { int n, t, x, y; scanf( %d%d , &n, &t); c[1023][1023] = n; q.push(make_pair(1023, 1023)); pair<int, int> s; int mxr = 1023, mxc = 1023; while (!q.empty()) { s = q.front(); q.pop(); if (c[s.first][s.second] < 4) continue; for (int k = 0; k < 4; ++k) { nr = s.first + dr[k]; nc = s.second + dc[k]; c[nr][nc] += c[s.first][s.second] / 4; if (c[nr][nc] >= 4) q.push(make_pair(nr, nc)); } c[s.first][s.second] %= 4; } ++t; while (--t) { scanf( %d%d , &x, &y); x += 1023; y += 1023; if (x < 0 || x > 2047 || y < 0 || y > 2047) printf( 0 n ); else printf( %d n , c[y][x]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; long long a[15]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); a[x]++; } long long ans = 0; for (int i = 1; i <= m; i++) for (int j = i + 1; j <= m; j++) ans += a[i] * a[j]; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; pair<int, int> p[maxn]; int a[maxn]; int b[maxn]; int n, k, cnt; bool F(int a, int b) { return a > b; } void solve() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= n; i++) scanf( %d , b + i); sort(a + 1, a + n + 1); sort(b + 1, b + n + 1, F); int i = 1, t = 1; while (true) { if (b[t] + a[i++] >= k) cnt++, t++; if (t > n || i > n) break; } printf( 1 %d , cnt); } int main() { solve(); } |
#include <bits/stdc++.h> using namespace std; using VI = vector<int>; using VVI = vector<VI>; using VB = vector<bool>; using VVB = vector<VB>; using VD = vector<double>; using VVD = vector<VD>; using VS = vector<string>; using PII = pair<int, int>; using VPII = vector<PII>; using VL = vector<long long>; using VVL = vector<VL>; int n; const int MOD = (int)1e9 + 7; const int MAXN = 300010; VI A; int add(int a, int b) { a = ((a % MOD) + (b % MOD)); return (a >= MOD) ? (a - MOD) : a; } int sub(int a, int b) { a -= b; return (a < 0) ? (a + MOD) : a; } int mul(int a, int b) { return ((long long)a * b) % MOD; } int powTable[MAXN]; long long sumMaxDistSubsets() { sort(A.begin(), A.end()); powTable[0] = 1; for (int i = 1; i <= n; ++i) powTable[i] = (powTable[i - 1] * 2ll) % MOD; int ret = 0; for (int i = 1; i <= n; ++i) { int times = powTable[i - 1] - powTable[n - i]; ret = add(ret, mul(A[i], times)); } return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; A.assign(n + 1, 0); for (int i = 1; i < (int)n + 1; ++i) cin >> A[i]; cout << sumMaxDistSubsets() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 520; int n, m, q, s[4][N][N], id[N], s2[N / 2][N][N], Mx; char c[N][N]; bool CK(int s[N][N], int x1, int y1, int x2, int y2, int op) { int dat = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]; return op ? dat : dat == (x2 - x1 + 1) * (y2 - y1 + 1); } bool ck(int x, int y, int len) { int x0 = x - len + 1, y0 = y - len + 1, x1 = x + len, y1 = y + len; return CK(s[0], x0, y0, x, y, 0) && CK(s[1], x0, y + 1, x, y1, 0) && CK(s[2], x + 1, y0, x1, y, 0) && CK(s[3], x + 1, y + 1, x1, y1, 0); } int read() { int x = 0, c; while (!isdigit(c = getchar())) ; while (isdigit(c)) x = x * 10 + c - 48, c = getchar(); return x; } int main() { id[ R ] = 0; id[ G ] = 1; id[ Y ] = 2; id[ B ] = 3; scanf( %d%d%d , &n, &m, &q); Mx = min(n / 2, m / 2); for (int i = 1; i <= n; i++) scanf( %s , c[i] + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) for (int k = 0; k < 4; k++) s[k][i][j] = s[k][i - 1][j] + s[k][i][j - 1] - s[k][i - 1][j - 1] + (id[c[i][j]] == k); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { int mx = min(min(i, n - i), min(j, m - j)); for (int k = 1; k <= Mx; k++) s2[k][i][j] = s2[k][i - 1][j] + s2[k][i][j - 1] - s2[k][i - 1][j - 1]; for (int k = 1; k <= mx; k++) if (ck(i, j, k)) s2[k][i][j]++; else break; } for (int i = 1, x1, y1, x2, y2; i <= q; i++) { x1 = read(), y1 = read(); x2 = read(); y2 = read(); int l = 1, r = min((x2 - x1 + 1) / 2, (y2 - y1 + 1) / 2), ans = 0; while (l <= r) { int mid = (l + r) >> 1; if (CK(s2[mid], x1 + mid - 1, y1 + mid - 1, x2 - mid, y2 - mid, 1)) ans = mid, l = mid + 1; else r = mid - 1; } printf( %d n , 4 * ans * ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, j, k, r; cin >> n >> k >> r; long long ar[n], arr[k]; for (i = 0; i < n; i++) { cin >> ar[i]; } for (i = 0; i < k; i++) { cin >> arr[i]; } sort(ar, ar + n); sort(arr, arr + k); long long a = ar[0], d, p; long long b = arr[k - 1]; d = r / a; p = r % a; long long sum = b * d + p; cout << max(sum, r) << endl; return 0; } |
#include <bits/stdc++.h> int getmin(int a, int b) { if (a == -1) return b; else if (b == -1) return a; else return a < b ? a : b; } int solve(int a, int b) { int tot = 0; while (a != 1 || b != 1) { tot++; if (!a || !b) return -1; if (a > b) a -= b; else b -= a; } return tot; } int main() { int n, ans = -1; scanf( %d , &n); for (int a = 1; a < n; a++) ans = getmin(ans, solve(a, n)); if (ans == -1) ans++; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[1010], a[1010], p[1020]; int a1, a2, tot; void cal() { if (a[tot - 2] == . ) { a2 += ((a[tot - 1] - 0 ) * 10 + (a[tot] - 0 )); tot -= 3; } if (a2 >= 100) a2 -= 100, a1++; int sum = 0; for (int i = 1; i <= tot; i++) if (a[i] != . ) sum = sum * 10 + a[i] - 0 ; a1 += sum; } int main() { scanf( %s , s + 1); int len = strlen(s + 1); for (int i = 1; i <= len; i++) { if ((s[i] < 0 || s[i] > 9 ) && s[i] != . ) continue; if ((s[i - 1] < 0 || s[i - 1] > 9 ) && s[i - 1] != . ) { cal(); memset(a, 0, sizeof(a)); tot = 0; } a[++tot] = s[i]; if (i == len) cal(); } int np = 0; if (a1 == 0) np = 1, p[1] = 0 ; else { int tmp = 0; while (a1 > 0) { p[++np] = a1 % 10 + 0 ; tmp++; if (tmp == 3) { p[++np] = . ; tmp = 0; } a1 /= 10; } } if (p[np] != . ) printf( %c , p[np]); for (int i = np - 1; i >= 1; i--) printf( %c , p[i]); if (a2) printf( .%02d , a2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; int n, q; struct X { int id, val; } s[maxn]; struct XX { int a, b; XX() {} XX(int A, int B) { a = A; b = B; } bool operator<(const XX &aa) const { return b > aa.b; } }; XX fir, sec; vector<int> v[maxn]; set<XX> h; int tmp[maxn], mn[maxn], mx[maxn]; bool check(int x) { int tt = v[fir.a][x]; if (s[tt].val < sec.b) return 0; return 1; } int main() { scanf( %d , &n); for (int i = 1; i <= 200000; i++) mx[i] = 0, mn[i] = 2000000000; for (int i = 1; i <= n; i++) { scanf( %d%d , &s[i].id, &s[i].val); v[s[i].id].push_back(i); mx[s[i].id] = max(mx[s[i].id], s[i].val); mn[s[i].id] = min(mn[s[i].id], s[i].val); } for (int i = 1; i <= 200000; i++) { if (mx[i] == 0) continue; h.insert(XX(i, mx[i])); } scanf( %d , &q); for (int i = 1; i <= q; i++) { int k; scanf( %d , &k); for (int j = 1; j <= k; j++) scanf( %d , &tmp[j]); for (int j = 1; j <= k; j++) { if (mx[tmp[j]] == 0) continue; h.erase(XX(tmp[j], mx[tmp[j]])); } if (h.size() == 0) { printf( 0 0 n ); } else if (h.size() == 1) { XX ans = *h.begin(); printf( %d %d n , ans.a, mn[ans.a]); } else { set<XX>::iterator iter; int cnt = 0; for (iter = h.begin(); iter != h.end(); iter++) { cnt++; if (cnt == 1) fir = *iter; else if (cnt == 2) { sec = *iter; break; } } int L = 0, R = v[fir.a].size() - 1; int ans; while (L <= R) { int mid = (L + R) / 2; if (check(mid)) ans = mid, R = mid - 1; else L = mid + 1; } int tt = v[fir.a][ans]; printf( %d %d n , s[tt].id, s[tt].val); } for (int j = 1; j <= k; j++) { if (mx[tmp[j]] == 0) continue; h.insert(XX(tmp[j], mx[tmp[j]])); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); long long n; cin >> n; vector<long long> a; for (long long i = 0; i < n; ++i) { long long x; cin >> x; a.push_back(x); } sort(a.begin(), a.end()); long long c = 0; for (long long i = 0; i < a.size() - 1; ++i) { c += a[a.size() - 1] - a[i]; } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int c[110]; int main() { int n, i, x, y, j; cin >> n; for (i = 0; i < n; i++) { cin >> x; for (j = 0; j < x; j++) { cin >> y; c[y]++; if (c[y] == n) { cout << y << ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; void _R(int &x) { scanf( %d , &x); } void _R(long long &x) { scanf( %lld , &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R() {} template <class T, class... U> void R(T &head, U &...tail) { _R(head); R(tail...); } void _W(const int &x) { printf( %d , x); } void _W(const long long &x) { printf( %lld , x); } void _W(const double &x) { printf( %.16f , x); } void _W(const char &x) { putchar(x); } void _W(const char *x) { printf( %s , x); } template <class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar( ); } void W() {} template <class T, class... U> void W(const T &head, const U &...tail) { _W(head); putchar(sizeof...(tail) ? : n ); W(tail...); } const int N = 3e5 + 7, M = 2e6; const long long mod = 1e9 + 7; inline int read() { int ret = 0; char ch = getchar(); bool f = 1; for (; !isdigit(ch); ch = getchar()) f ^= !(ch ^ - ); for (; isdigit(ch); ch = getchar()) ret = (ret << 1) + (ret << 3) + ch - 48; return f ? ret : -ret; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long ksm(long long a, long long b, long long mod) { int ans = 1; while (b) { if (b & 1) ans = (ans * a) % mod; a = (a * a) % mod; b >>= 1; } return ans; } long long inv2(long long a, long long mod) { return ksm(a, mod - 2, mod); } void TelmaZzzz() {} struct node { int l, r, val; } que[N]; int a[N]; int arr[N]; int k, t, m, n; bool check(int x) { int minn = m + 1, maxn = -1; for (int i = 1; i <= m + 1; i++) arr[i] = 0; for (int i = 1; i <= k; i++) { if (que[i].val <= a[n - x + 1]) continue; arr[que[i].l]++; arr[que[i].r + 1]--; } int ans = m + 1; for (int i = 1; i <= m + 1; i++) { arr[i] += arr[i - 1]; if (arr[i]) ans += 2; } if (ans <= t) return true; return false; } int main() { TelmaZzzz(); R(n, m, k, t); for (int i = 1; i <= n; i++) R(a[i]); for (int i = 1; i <= k; i++) R(que[i].l, que[i].r, que[i].val); sort(a + 1, a + 1 + n); int l = 1, r = n; while (l <= r) { int mi = (l + r) / 2; if (check(mi)) l = mi + 1; else r = mi - 1; } W(r); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, i, ans, a[1001]; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 2; i < n; i++) if ((a[i] > a[i - 1] && a[i] > a[i + 1]) || (a[i] < a[i - 1] && a[i] < a[i + 1])) ans++; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int Int() { int x; scanf( %d , &x); return x; } long long Long() { long long x; scanf( %lld , &x); return x; } void err(istream_iterator<string> it) { cout << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << ; err(++it, args...); } const int N = (int)2e5 + 5; const int maxN = (int)1e6 + 6; const long long Mod = (long long)1e9 + 7; vector<int> box; int len, k, a, b; bool vis[201][201]; string s; void call(int cur, int last) { if (cur > k) return; if (last == (int)s.size()) { if (cur != k) return; int cnt = 0; for (int i : box) { for (int j = cnt; j < i + cnt; ++j) cout << s[j]; cout << n ; cnt += i; } exit(0); } if (vis[cur][last]) return; vis[cur][last] = 1; for (int i = a; i <= b; ++i) { if (last + i <= (int)s.size()) { box.push_back(i); call(cur + 1, i + last); box.pop_back(); } } } int main() { int test = 1, tc = 0; while (test--) { cin >> k >> a >> b; cin >> s; for (int i = a; i <= b; ++i) { if (i <= (int)s.size()) { box.push_back(i); call(1, i); box.pop_back(); } } puts( No solution ); } return 0; } |
#include <bits/stdc++.h> using namespace std; double vp, vd, t, f, c; int main() { cin >> vp >> vd >> t >> f >> c; if (vp >= vd) { cout << 0 ; return 0; } int numberOfBojous = 0; double timeToHaveTheDragonBack = 0, overtakePosition = 0; double princessPosition = vp * t; while (princessPosition < c) { overtakePosition = vd * princessPosition / (vd - vp); if (overtakePosition < c) numberOfBojous++; timeToHaveTheDragonBack = (overtakePosition / vd) + f; princessPosition = (vp * timeToHaveTheDragonBack) + overtakePosition; } cout << numberOfBojous; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double EPS = 1e-10; const int MOD = 1000000007; const int MAXN = 110000; const double PI = acos(-1.0); template <class T> T abs(T x) { return x < 0 ? -x : x; } int num, kase; int flag[22][MAXN]; long long fun() { long long ret = 0; for (int index = 0; index < (21); ++index) { long long cnt = 0, t = 0; for (int i = (1); i <= (num + 1); ++i) { if (flag[index][i] == 1) cnt++; else { t += ((cnt * cnt + cnt) >> 1); cnt = 0; } } ret += (1 << index) * t; } return ret; } void findlr(int* f, int n, int& l, int& r) { int i = n - 1; while (f[i] == 1) i--; l = i + 1; i = n + 1; while (f[i] == 1) i++; r = i - 1; } int main() { int t, p; while (~scanf( %d%d , &num, &kase)) { memset(flag, 0, sizeof(flag)); for (int i = (1); i <= (num); ++i) { scanf( %d , &t); p = 1; for (int ind = 0; ind < (21); ++ind) { flag[ind][i] = ((t & p) > 0); p <<= 1; } } long long ans = fun(); int a, b, l, r; for (int tt = 0; tt < (kase); ++tt) { scanf( %d%d , &a, &b); for (int ind = 0; ind < (21); ++ind) { p = 1 << ind; if (((b & p) > 0) != flag[ind][a]) { findlr(flag[ind], a, l, r); long long lenl = a - l, lenr = r - a; ans += (1 - flag[ind][a] * 2) * (1 << ind) * (lenl * lenr + lenl + lenr + 1); flag[ind][a] = !flag[ind][a]; } } cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > vt; bool cmp(pair<int, int> x, pair<int, int> y) { return (x.first < y.first || (x.first == y.first && x.second < y.second)); } int main() { cin >> n; for (int i = 1; i <= n; i++) { int u; cin >> u; vt.push_back(make_pair(u, i)); } sort(vt.begin(), vt.end(), cmp); for (int i = 0; i < (int)vt.size() - 2; i++) for (int j = i + 1; j < (int)vt.size() - 1; j++) { int k = upper_bound( vt.begin(), vt.end(), pair<int, int>(vt[i].first + vt[j].first - 1, 1000000000)) - vt.begin(); if (vt[k].first == (vt[i].first + vt[j].first)) { cout << vt[k].second << << vt[i].second << << vt[j].second; return 0; } } cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2500 + 10, MAXK = 7; int k, sum[MAXN][MAXN], l[MAXK], r[MAXK]; long long Tohka; vector<string> Rotate(vector<string>& a) { vector<string> Houki; for (int i = 0; i < (int)a[0].size(); ++i) { string str; for (int j = 0; j < (int)a.size(); ++j) str += a[j][i]; Houki.push_back(str); } return Houki; } int Gets(int xl, int yl, int xr, int yr) { return sum[xr][yr] - sum[xl - 1][yr] - sum[xr][yl - 1] + sum[xl - 1][yl - 1]; } void solve(vector<string> a) { if (a.size() == 0 || a[0].size() == 0) return; if (a.size() > a[0].size()) a = Rotate(a); int n = (int)a.size(), m = (int)a[0].size(); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (a[i - 1][j - 1] == 1 ); int mid = (m + 1) / 2; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= k; ++j) l[j] = 1, r[j] = m; for (int j = i; j <= n; ++j) { for (int p = 0; p <= k; ++p) { for (; l[p] <= mid && Gets(i, l[p], j, mid) > p; ++l[p]) ; for (; r[p] > mid && Gets(i, mid + 1, j, r[p]) > p; --r[p]) ; } for (int lp = 0, rp = k; lp <= k; ++lp, --rp) { int ls = (lp ? l[lp - 1] : (mid + 1)) - l[lp], rs = r[rp] - (rp ? r[rp - 1] : mid - 1); Tohka += (long long)ls * rs; } } } vector<string> lstr, rstr; for (int i = 0; i < n; ++i) { string ls, rs; for (int j = 0; j < m; ++j) { if (j + 1 < mid) ls += a[i][j]; if (j + 1 > mid) rs += a[i][j]; } lstr.push_back(ls), rstr.push_back(rs); } solve(lstr), solve(rstr); } int main() { int n, m; vector<string> a; cin >> n >> m >> k; for (int i = 1; i <= n; ++i) { string str; cin >> str; a.push_back(str); } solve(a); cout << Tohka << endl; fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; const int INF = 1e9; int main() { string s; cin >> s; long long n = s.length(); vector<long long> v; long long ans = 0; for (long long i = 0; i < n; i++) { if (int(s[i]) < 97) { v.push_back(1); } else { v.push_back(0); } } vector<long long> p = vector<long long>(n, 0); p[0] = (v[0] == 0) ? 1 : 0; for (long long i = 1; i < n; i++) { p[i] = p[i - 1] + ((v[i] == 0) ? 1 : 0); } long long mn = n - p[n - 1]; for (long long i = 0; i < n; i++) { mn = min(mn, p[i] + (n - 1 - i - p[n - 1] + p[i])); } cout << mn << endl; } |
#include <bits/stdc++.h> using namespace std; map<long long, vector<long long>> v; map<long long, long long> visited, dist, pt; long long mx = 0, nd = 0, mxd = 0, mxn = 0; void bfs(long long u) { visited[u] = 1; queue<long long> q; q.push(u); dist[u] = 0; while (!q.empty()) { u = q.front(); visited[u] = 1; q.pop(); visited[u] = 1; for (long long i = 0; i < (long long)v[u].size(); i++) { long long p = v[u][i]; if (!visited[p]) { visited[p] = 1; dist[p] = dist[u] + 1; if (dist[p] > mxd) { mxd = dist[p]; mxn = p; } pt[p] = u; q.push(p); } } } } int main() { long long a, b, x, c, i, j, n, t, k, z = 0, node, edge; scanf( %lld , &n); for (i = 1; i <= n; i++) { scanf( %lld %lld , &a, &b); v[a].push_back(b); v[b].push_back(a); c = a; } bfs(c); x = mxn; visited.clear(); dist.clear(); pt.clear(); mxd = 0; bfs(mxn); vector<long long> path; path.push_back(mxn); long long now = mxn; while (now != x) { now = pt[now]; path.push_back(now); } for (i = 0; i < (long long)path.size(); i++) cout << path[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; static int comp[maxn]; static int pr[maxn]; static int n; void make_set() { for (int i = 0; i < n; ++i) { pr[i] = i; comp[i] = 1; } } int find_set(int a) { if (pr[a] == a) return a; return pr[a] = find_set(pr[a]); } void union_set(int a, int b) { a = find_set(a); b = find_set(b); pr[a] = b; comp[b] += comp[a]; comp[a] = 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n; int m; cin >> m; make_set(); for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; a--; b--; if (find_set(a) != find_set(b)) union_set(a, b); } int k; cin >> k; for (int j = 0; j < k; ++j) { int a, b; cin >> a >> b; a--; b--; if (find_set(a) == find_set(b)) { comp[find_set(a)] = 0; } } int mx = 0; for (int l = 0; l < n; ++l) { mx = max(mx, comp[l]); } cout << mx; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > G[100005]; int dp[100005], Xor[100005]; int rec(int n) { int answer = 1e9; for (int i = 0; i < G[n].size(); i++) { int st = G[n][i].first; int ed = G[n][i].second + st - 1; int x = Xor[ed] ^ Xor[st - 1]; if (x == 0) answer = min(answer, G[n][i].second); } return answer; } int main() { memset(dp, -1, sizeof(dp)); for (int i = 1; i <= 100000; i++) { for (int j = i, sum = i; sum <= 100000; j++, sum += j) { if (j - i + 1 >= 2) G[sum].push_back(make_pair(i, j - i + 1)); } } for (int n = 1; n <= 100000; n++) { set<int> ST; for (int i = 0; i < G[n].size(); i++) { int st = G[n][i].first; int ed = G[n][i].second + st - 1; int x = Xor[ed] ^ Xor[st - 1]; ST.insert(x); } for (int i = 0;; i++) { if (ST.find(i) == ST.end()) { dp[n] = i; break; } } Xor[n] = Xor[n - 1] ^ dp[n]; } int n; cin >> n; if (dp[n] == 0) { cout << -1 << endl; return 0; } cout << rec(n) << endl; } |
#include <bits/stdc++.h> using namespace std; bool is_possible(int m, long long k, long long p[], int n, int x, int a, int y, int b) { if (a != b) { int first = 0; int second = 0; int third = 0; for (int i = 1; i <= m; i++) { if (i % a == 0 && i % b == 0) third++; else if (i % a == 0) first++; else if (i % b == 0) second++; } long long ans1 = 0; for (int i = 0; i < third; i++) { ans1 += ((p[i] * (x + y)) / 100); } for (int i = third; i <= third + first - 1; i++) { ans1 += ((p[i] * x) / 100); } for (int i = third + first; i <= third + first + second - 1; i++) { ans1 += ((p[i] * y) / 100); } long long ans2 = 0; for (int i = 0; i < third; i++) { ans2 += ((p[i] * (x + y)) / 100); } for (int i = third; i <= third + second - 1; i++) { ans2 += ((p[i] * y) / 100); } for (int i = third + second; i <= third + second + first - 1; i++) { ans2 += ((p[i] * x) / 100); } if (ans1 >= k || ans2 >= k) return true; return false; } else { long long ans1 = 0; int first = 0; for (int i = 1; i <= m; i++) { if (i % a == 0) first++; } for (int i = 0; i < first; i++) { ans1 += ((p[i] * (x + y)) / 100); } if (ans1 < k) return false; return true; } } int main() { int t; cin >> t; while (t--) { int n; cin >> n; long long aa[n]; long long p[n]; for (int i = 0; i < n; i++) { cin >> aa[i]; p[i] = aa[i]; } int x, a, y, b; cin >> x >> a >> y >> b; long long k; cin >> k; sort(p, p + n, greater<long long>()); int l = 1; int h = n; int ans = -1; while (l <= h) { int m = l + (h - l) / 2; if (is_possible(m, k, p, n, x, a, y, b)) { ans = m; h = m - 1; } else { l = m + 1; } } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; void dbg_out() { cerr << b b] n ; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << , ; dbg_out(T...); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); string s; cin >> s; int n = (int)s.size(); int curr = 0, last = -1; vector<int> ans; for (int i = 0; i < n; ++i) { if (s[i] == ) ) curr--; else if (s[i] == ( ) curr++; else { if (curr <= 0) { cout << -1; return 0; } last = i; curr--; ans.push_back(curr); } if (curr < 0) { cout << -1; return 0; } } if (last > -1) { int x = 0, neg = 0; for (int i = n - 1; i > last; --i) { if (s[i] == ) ) x--; else if (s[i] == ( ) x++; if (x > 0) { cout << -1; return 0; } } x = 0; for (int i = last + 1; i < n; ++i) { if (s[i] == ) ) x--; else if (s[i] == ( ) x++; neg = min(neg, x); } neg = ans.back() + neg; if (x > 0 or neg < 0) { cout << -1; return 0; } ans.pop_back(); ans.push_back(neg + 1); } for (int i = 0; i < (int)ans.size(); ++i) { if (i + 1 == (int)ans.size()) { cout << ans[i] << n ; } else cout << 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ball { float coord; int mass; float vel; short num; }; bool sort_num(ball a, ball b) { return a.num < b.num; } bool sort_coord(ball a, ball b) { return a.coord < b.coord; } void collide(ball &a, ball &b) { float temp = a.vel; a.vel = ((a.mass - b.mass) * a.vel + 2 * b.vel * b.mass) / (b.mass + a.mass); b.vel = ((b.mass - a.mass) * b.vel + 2 * temp * a.mass) / (b.mass + a.mass); } void iter(vector<ball> &balls, int size, float &cur_time, int time) { float col_t = 9999.9; int col_c = -1; float temp; for (int i = 0; i < size - 1; i++) { temp = (balls[i + 1].coord - balls[i].coord) / (balls[i].vel - balls[i + 1].vel); if (temp > 0.0000001 && temp < col_t) { col_t = temp; col_c = i; } } if (cur_time + col_t > time || col_c == -1) { col_t = time - cur_time; for (int i = 0; i < size; i++) balls[i].coord += balls[i].vel * col_t; cur_time += col_t; return; } for (int i = 0; i < size; i++) { balls[i].coord += balls[i].vel * col_t; } for (int i = 0; i < size - 1; i++) { if (fabs(balls[i].coord - balls[i + 1].coord) < 0.0000001) { collide(balls[i], balls[i + 1]); i++; } } cur_time += col_t; } int main() { int n, t; float cur_t = 0.0; cin >> n >> t; vector<ball> balls(n); for (int i = 0; i < n; i++) { cin >> balls[i].coord >> balls[i].vel >> balls[i].mass; balls[i].num = i; } sort(balls.begin(), balls.end(), sort_coord); while (cur_t < t) { iter(balls, n, cur_t, t); } sort(balls.begin(), balls.end(), sort_num); for (int i = 0; i < n; i++) cout << balls[i].coord << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<int> v[10005]; int color[10005]; int flag[10005]; void dfs(int src, int p, int ctr) { if (src == p) { return; } flag[src] = ctr; int i; for (i = 0; i < v[src].size(); i++) { if (color[v[src][i]] == color[src]) { if (v[src][i] != p) dfs(v[src][i], src, ctr); } } } int main(void) { scanf( %d , &n); int i; int x; for (i = 2; i <= n; i++) { scanf( %d , &x); v[i].push_back(x); v[x].push_back(i); } for (i = 1; i <= n; i++) { scanf( %d , &x); color[i] = x; } int ctr = 0; for (i = 1; i <= n; i++) { if (flag[i] == 0) { ctr++; dfs(i, -1, -ctr); } } cout << ctr << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int maxar(int arr[], int n) { int res = arr[0]; for (int i = 0; i < n; i++) { res = max(res, arr[i]); } return res; } long long maxar(long long arr[], long long n) { long long res = arr[0]; for (long long i = 0; i < n; i++) { res = max(res, arr[i]); } return res; } long long minar(long long arr[], long long n) { long long res = arr[0]; for (long long i = 0; i < n; i++) { res = min(res, arr[i]); } return res; } int minar(int arr[], int n) { int res = arr[0]; for (int i = 0; i < n; i++) { res = min(res, arr[i]); } return res; } void inpar(int arr[], int n) { for (int i = 0; i < n; i++) { cin >> arr[i]; } } void inpar(long long arr[], long long n) { for (long long i = 0; i < n; i++) { cin >> arr[i]; } } template <typename T> inline T readInt() { T n = 0, s = 1; char p = getchar(); if (p == - ) s = -1; while ((p < 0 || p > 9 ) && p != EOF && p != - ) p = getchar(); if (p == - ) s = -1, p = getchar(); while (p >= 0 && p <= 9 ) { n = (n << 3) + (n << 1) + (p - 0 ); p = getchar(); } return n * s; } void solve() { int n = readInt<int>(); int a[n]; inpar(a, n); int res = 0; priority_queue<int> q; for (int i = 1; i < n; i++) { q.push(a[i]); } while (q.top() >= a[0]) { res++; a[0]++; int temp = q.top(); temp--; q.pop(); q.push(temp); } cout << res; } int32_t main() { int tc; tc = 1; while (tc--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200000 + 10; int a[MAXN]; int sum[MAXN]; int cnt[100 + 10]; vector<int> vc; unordered_map<int, int> mp; int exist[MAXN]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); cnt[a[i]]++; } int D = -1; bool flag = false; for (int i = 1; i <= 100; ++i) { if (cnt[i]) { vc.push_back(i); if (D == -1 || cnt[D] < cnt[i]) { D = i; flag = false; } else if (D != -1 && cnt[i] == cnt[D] && i != D) { flag = true; } } } if (flag) { printf( %d n , n); return 0; } sum[0] = 0; int ans = 0; for (int x : vc) { if (x == D) continue; mp.clear(); exist[0] = 0; mp[0] = 0; for (int i = 1; i <= n; ++i) { if (a[i] == D) sum[i] = sum[i - 1] + 1; else if (a[i] == x) sum[i] = sum[i - 1] - 1; else sum[i] = sum[i - 1] + 0; if (mp.count(sum[i]) == 0) mp[sum[i]] = i; if (a[i] == D) { exist[i] = exist[i - 1] + 1; } else { exist[i] = exist[i - 1]; } } int L = 0; for (int r = 1; r <= n; ++r) { if (mp.count(sum[r])) { int l = mp[sum[r]] + 1; if (l <= r && exist[r] - exist[l - 1] >= 1) { L = max(L, r - l + 1); } } } ans = max(ans, L); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int pc[1 << 10]; for (size_t i = 0; i < (1 << 10); i++) { int buf = 0; for (int j = 0; j < 10; j++) { if ((1 << j) & i) buf++; } pc[i] = buf; } int n, m; cin >> n >> m; map<int, pair<unsigned long long, unsigned long long>> ans; vector<int> v1(n); vector<int> v2(m); for (size_t i = 0; i < n; i++) { cin >> v1[i]; v1[i] *= 2; } for (size_t i = 0; i < m; i++) { cin >> v2[i]; v2[i] *= 2; } for (size_t i = 0; i < n; i++) { for (size_t j = 0; j < m; j++) { int buf = (v1[i] + v2[j]) / 2; ans[buf].first |= (1ULL << i); ans[buf].second |= (1ULL << j); } } int ansv = 0; for (auto i = ans.begin(); i != ans.end(); i++) { for (auto j = i; j != ans.end(); j++) { long long a1 = i->second.first; long long a2 = j->second.first; long long b1 = i->second.second; long long b2 = j->second.second; long long buf1 = a1 | a2; long long buf2 = b1 | b2; int buf = 0; while (buf1) { int buff = buf1 & 1023; buf1 >>= 10; buf += pc[buff]; } while (buf2) { int buff = buf2 & 1023; buf2 >>= 10; buf += pc[buff]; } ansv = max(ansv, buf); } } cout << ansv; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[105]; int main() { int s = 0, t = 0; ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) { if (s >= m) break; else { s += a[n - i - 1]; t++; } } cout << t; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300 * 1000 + 13; int n; long long a[N], b[N]; void solve() { scanf( %d , &n); for (int i = 0; i < int(n); ++i) scanf( %lld%lld , &a[i], &b[i]); long long ans = 0, mn = 1e18; for (int i = 0; i < int(n); ++i) { int ni = (i + 1) % n; long long val = min(a[ni], b[i]); ans += a[ni] - val; mn = min(mn, val); } ans += mn; printf( %lld n , ans); } int main() { int T; scanf( %d , &T); for (int i = 0; i < int(T); ++i) solve(); } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.