Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int a[4000000]; int f[4000000]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } int s, t; cin >> s >> t; s--; t--; long long ans = 0; for (int i = s; i < t; i++) ans += a[i]; long long num = ans; int pos = 1; for (int i = 2; i <= n; i++) { ans = ans - a[(t + 1 - i + n) % n] + a[(s + 1 - i + n) % n]; if (ans > num) { ans = num; pos = i; } } cout << pos; return 0; }
#include <bits/stdc++.h> inline long long MAX2(long long a, long long int b) { return (a) > (b) ? (a) : (b); } inline long long MAX3(long long a, long long b, long long c) { return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); } inline long long MIN2(long long a, long long b) { return (a) < (b) ? (a) : (b); } inline long long MIN3(long long a, long long b, long long c) { return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c)); } using namespace std; int n, a, b; int p[1000006]; pair<int, int> compute() { if (n % b == 0) return pair<int, int>(0, n / b); if (n % a == 0) return pair<int, int>(n / a, 0); int div = (n / b); int rem = (n % b); int ch; while (div > 0) { ch = rem % a; if (ch == 0) break; div--; rem += b; } if (div == 0) return pair<int, int>(-1, -1); return pair<int, int>((rem / a), div); } void make(int i, int j) { int k; for (k = i; k < j; k++) { p[k] = k + 1; } p[j] = i; } int main() { cin >> n >> a >> b; if (a > b) { int temp = a; a = b; b = temp; } pair<int, int> cycles = compute(); if (cycles.first == -1) { cout << -1; return 0; } int i = 1; while (i <= n) { if (cycles.first > 0) { make(i, i + a - 1); cycles.first--; i += a; } else { make(i, i + b - 1); cycles.second--; i += b; } } for (i = 1; i < n + 1; i++) { cout << p[i] << ; } }
#include <bits/stdc++.h> using namespace std; int main() { long long n, sum = 0; cin >> n; sum = n; for (int i = 2; i <= n; i++) { while (n % i == 0) { sum += n / i; n /= i; } } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5; int a[N], b[N]; long long check(long long x, int n, int c) { long long ans = 0; for (int i = 1; i <= n; ++i) { ans += x * a[i] / b[i] + 1; if (ans > c) ans = c + 1; } return ans; } int main() { int n, c; scanf( %d%d , &n, &c); long long sum = 0; for (int i = 1; i <= n; ++i) { scanf( %d%d , &a[i], &b[i]); sum += a[i]; } long long limit = 1000000000000000000LL; long long l, r; if (check(1, n, c) >= c) l = 1; else { long long head = 1, tail = limit / sum; while (head < tail - 1) { long long mid = head + tail >> 1; if (check(mid, n, c) >= c) tail = mid; else head = mid; } l = tail; } if (check(limit / sum, n, c) <= c) r = limit / sum; else { long long head = 1, tail = limit / sum; while (head < tail - 1) { long long mid = head + tail >> 1; if (check(mid, n, c) <= c) head = mid; else tail = mid; } r = head; } long long ans = 0; if (l <= r && check(l, n, c) == c && check(r, n, c) == c) ans = r - l + 1; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : -x; } int m; int n; map<int, int> id; int rev[100500]; int a[2]; int w[100500], ans[100500]; set<int> s; set<int> ss; void go(int x) { w[x] = 1; x = rev[x]; s.insert(x); for (int i = 0; i < (2); i++) { int tmp = a[i] - x; if (ss.find(tmp) != s.end()) { int p = id[tmp]; if (!w[p]) go(p); } } } int check(set<int> s) { for (int i = 0; i < (2); i++) { int g = 1; for (set<int>::const_iterator it = s.begin(); it != s.end(); it++) { int tmp = a[i] - *it; if (s.find(tmp) == s.end()) { g = 0; break; } } if (g) { for (set<int>::const_iterator it = s.begin(); it != s.end(); it++) { ans[id[*it]] = i; } return 1; } } return 0; } int main() { cin >> n >> a[0] >> a[1]; for (int i = 0; i < (n); i++) { int x; cin >> x; id[x] = i; rev[i] = x; ss.insert(x); } for (int i = 0; i < (n); i++) if (!w[i]) { s.clear(); go(i); if (!check(s)) { cout << NO << endl; return 0; } } cout << YES << endl; for (int i = 0; i < (n); i++) cout << ans[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int tc; cin >> tc; while (tc-- > 0) { int arr[7]; for (int i = 0; i < 7; i++) { cin >> arr[i]; } cout << arr[0] << << arr[1] << << arr[6] - arr[0] - arr[1] << endl; } }
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { return b == 0 ? a : gcd(b, a % b); } long long int power(long long int x, long long int n) { long long int result = 1; while (n > 0) { if (n % 2 == 1) result = (result * x) % 1000000007; x = (x * x) % 1000000007; n = n / 2; } return result % 1000000007; } bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } long long int inv(long long int a, long long int m) { return power(a, m - 2); } long long int lcm(long long int a, long long int b) { return a * b / (gcd(a, b)); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) { long long int index = -1, res = -1; string str; cin >> str; long long int n = str.length(), ans = -1; for (long long int i = 0; i < n; i++) { if (str[i] == R ) { index = max(index, i - res); res = i; } } index = max(index, n - res); cout << index << n ; } }
#include <bits/stdc++.h> using namespace std; int main() { long long n, arr[100000], arr1[100000]; cin >> n; string s = ; for (int x = 0; x < n; x++) cin >> arr[x], arr1[x] = arr[x]; sort(arr1, arr1 + n); for (int x = 0; x <= arr1[n - 1]; x++) { for (int y = 0; y < n - 1; y++) { if (arr[y] != 0) s += P , arr[y]--; s += R ; } for (int z = n - 1; z > 0; z--) { if (arr[z] != 0) s += P , arr[z]--; s += L ; } } for (int x = s.size(); x >= 0; x--) if (s[x] == P ) { s.erase(x + 1, s.size()); break; } cout << s; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; const int maxn = 1e5 + 10; const int mod = 1e9 + 7; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll pwr(ll a, ll pw) { ll ret = 1; while (pw > 0) { if (pw & 1) { ret = ret * a % mod; } a = a * a % mod; pw >>= 1; } return ret; } ll modinv(ll a) { return pwr(a, mod - 2); } int main() { ios_base::sync_with_stdio(false), cin.tie(0); int n; cin >> n; vector<ll> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } vector<vector<ll> > prob_win(n, vector<ll>(n)); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { prob_win[i][j] = v[i] * modinv(v[i] + v[j]) % mod; prob_win[j][i] = v[j] * modinv(v[i] + v[j]) % mod; } } vector<vector<ll> > win_msk(n, vector<ll>(1 << n, 1ll)); for (int i = 0; i < n; i++) { for (int msk = 0; msk < 1 << n; msk++) { for (int bit = 0; bit < n; bit++) { if (msk >> bit & 1) { win_msk[i][msk] = win_msk[i][msk] * prob_win[i][bit] % mod; } } } } ll ans = 0; vector<ll> dp_prob(1 << n, 1ll); for (int msk = 1; msk < 1 << n; msk++) { ll num_winners = __builtin_popcount(msk); for (int bit = 0; bit < n; bit++) { if (msk >> bit & 1) { dp_prob[msk] = dp_prob[msk] * win_msk[bit][(1 << n) - 1 - msk] % mod; } } for (int sub_winners = (msk - 1) & msk; sub_winners > 0; sub_winners = (sub_winners - 1) & msk) { int sub_losers = msk ^ sub_winners; ll p = dp_prob[sub_winners]; for (int bit = 0; bit < n; bit++) { if (sub_losers >> bit & 1) { p = p * win_msk[bit][(1 << n) - 1 - msk] % mod; } } dp_prob[msk] = (dp_prob[msk] - p + mod) % mod; } ans = (ans + dp_prob[msk] * num_winners % mod) % mod; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 2e5 + 5; vector<int> E[N]; LL Size[N], Dep[N]; int ord[N]; int tourism[N]; void dfs(int x, int p, int lvl) { Size[x] = 1; Dep[x] = lvl; for (const int &to : E[x]) { if (to == p) continue; dfs(to, x, lvl + 1); Size[x] += Size[to]; } } LL res; void go(int x, int p, int val) { if (tourism[x]) val++; else res += val; for (const int &to : E[x]) { if (to == p) continue; go(to, x, val); } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; x--; y--; E[x].push_back(y); E[y].push_back(x); } dfs(0, 0, 0); iota(ord, ord + n, 0); sort(ord, ord + n, [](int x, int y) { return Dep[x] - Size[x] < Dep[y] - Size[y]; }); k = n - k; for (int i = 0; i < k; i++) { tourism[ord[i]] = 1; } go(0, 0, 0); cout << res << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 200009; const long long mod = 1e9 + 7; char s[N]{}; long long prea[N]; long long pref[N]; long long sac[N]; long long saf[N]; long long ksm(int n, int y) { if (y < 1) return 1; long long x = n; long long ret = 1; while (y) { if (y & 1) { ret *= x; ret %= mod; } x *= x; x %= mod; y /= 2; } return ret; } int main() { int n; cin >> n; cin >> s + 1; for (int i = 1; i <= n; i++) { prea[i] = prea[i - 1]; pref[i] = pref[i - 1]; if (s[i] == a ) prea[i]++; if (s[i] == ? ) pref[i]++; } for (int i = n; i >= 1; i--) { sac[i] = sac[i + 1]; saf[i] = saf[i + 1]; if (s[i] == c ) sac[i]++; if (s[i] == ? ) saf[i]++; } long long ans = 0; for (int i = 1; i <= n; i++) { if (s[i] == b || s[i] == ? ) { long long l = pref[i - 1]; long long r = saf[i + 1]; ans += (prea[i - 1] * sac[i + 1] % mod) * (ksm(3, l + r) % mod) % mod; ans %= mod; ans += (prea[i - 1] * saf[i + 1] % mod) * (ksm(3, l + r - 1) % mod) % mod; ans %= mod; ans += (pref[i - 1] * sac[i + 1] % mod) * (ksm(3, l + r - 1) % mod) % mod; ans %= mod; ans += (pref[i - 1] * saf[i + 1] % mod) * (ksm(3, l + r - 2) % mod) % mod; ans %= mod; } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; long long n, cr; bool f = 0; pair<long long, long long> a[25], b[25], c[25]; void gen(long long i, long long s1, long long s2) { if (i == n) { if (s1 != s2) cr++; } else { gen(i + 1, s1 + a[i].first, s2 + c[i].first); gen(i + 1, s1, s2); } } int main() { ios::sync_with_stdio(0); cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; c[i] = a[i]; } sort(a, a + n); sort(c, c + n); for (long long k = 0; k < n; k++) { for (long long i = 0; i < n; i++) { b[i] = a[i]; } a[0] = b[n - 1]; for (long long i = 1; i < n; i++) { a[i] = b[i - 1]; } cr = 0; gen(0, 0, 0); if (cr == ((1 << n) - 2)) { f = 1; for (long long i = 0; i < n; i++) { c[i].first = c[i].second; c[i].second = a[i].first; } break; } } if (!f) { cout << -1; return 0; } sort(c, c + n); for (long long i = 0; i < n; i++) { cout << c[i].second << ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, x, y, n; cin >> a >> b >> x >> y >> n; long long a1 = a, b1 = b, n1 = n; long long an = a - x, bn = b - y; b -= min(bn, n); n -= min(bn, n); a -= min(an, n); a1 -= min(an, n1); n1 -= min(an, n1); b1 -= min(bn, n1); cout << min(a1 * b1, a * b) << n ; } }
#include <bits/stdc++.h> template <class T> inline void read(T &x) { x = 0; register char c = getchar(); register bool f = 0; while (!isdigit(c)) f ^= c == - , c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); if (f) x = -x; } template <class T> inline void print(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) print(x / 10); putchar(x % 10 + 0 ); } template <class T> inline void print(T x, char c) { print(x), putchar(c); } const int N = 2e5 + 10, mod = 998244353; struct z { int x; z(int x = 0) : x(x) {} friend inline z operator*(z a, z b) { return (long long)a.x * b.x % mod; } friend inline z operator-(z a, z b) { return (a.x -= b.x) < 0 ? a.x + mod : a.x; } friend inline z operator+(z a, z b) { return (a.x += b.x) >= mod ? a.x - mod : a.x; } } inv100, p[N]; inline z fpow(z a, int b) { z s(1); for (; b; b >>= 1, a = a * a) if (b & 1) s = s * a; return s; } struct pair { z x, y; inline z set(z k) { return x * k + y; } friend inline pair operator*(const pair &x, const pair &y) { return (pair){x.x * y.x, x.x * y.y + x.y}; } }; struct seg { struct node { int l, r, mid; pair x; } p[N << 2]; void build(int u, int l, int r, pair foo(int)) { p[u].l = l, p[u].r = r, p[u].mid = (l + r) >> 1; if (l == r) { p[u].x = foo(l); return; } build(u << 1, l, p[u].mid, foo); build(u << 1 | 1, p[u].mid + 1, r, foo); p[u].x = p[u << 1].x * p[u << 1 | 1].x; } void modify(int u, int k, pair x) { if (p[u].l == p[u].r) { p[u].x = x; return; } modify(k <= p[u].mid ? u << 1 : u << 1 | 1, k, x); p[u].x = p[u << 1].x * p[u << 1 | 1].x; } pair query(int u, int l, int r) { if (p[u].l == l && p[u].r == r) return p[u].x; if (r <= p[u].mid) return query(u << 1, l, r); if (l > p[u].mid) return query(u << 1 | 1, l, r); return query(u << 1, l, p[u].mid) * query(u << 1 | 1, p[u].mid + 1, r); } } f, g, h, res; int n, m; std::set<int> set; pair calc(int l, int r) { z a = f.query(1, l, r).set(0); z b = g.query(1, l, r).set(1); z c = h.query(1, l, r).set(0); z inv = fpow(1 - a, mod - 2); return (pair){b * inv, c * inv}; } int main() { read(n), read(m), p[0] = 1, inv100 = fpow(100, mod - 2); for (int i = 1; i <= n; i++) read((int &)p[i]), p[i] = p[i] * inv100; set.insert(0), set.insert(1), set.insert(n + 1); f.build(1, 0, n, [](int i) { return (pair){p[i], 1 - p[i]}; }); g.build(1, 0, n, [](int i) { return (pair){p[i], z(0)}; }); h.build(1, 0, n, [](int i) { return (pair){p[i], z(1)}; }); res.build(1, 0, n, [](int k) { if (k == 0) return calc(0, 0); if (k == 1) return calc(1, n); return (pair){1, 0}; }); for (int x, i = 1; i <= m; i++) { read(x); if (set.find(x) == set.end()) { set.insert(x); auto it = set.find(x); int l = *std::prev(it), r = *std::next(it); res.modify(1, l, calc(l, x - 1)); res.modify(1, x, calc(x, r - 1)); } else { auto it = set.find(x); int l = *std::prev(it), r = *std::next(it); res.modify(1, l, calc(l, r - 1)); res.modify(1, x, {1, 0}); set.erase(it); } printf( %d n , (res.query(1, 0, n).set(0) - 1).x); } }
#include <bits/stdc++.h> using namespace std; long long int cost(long long int x[], long long int a, long long int n, long long int r, long long int m, long long int val) { long long int pos = 0; long long int neg = 0; for (int i = 0; i < n; i++) { if (x[i] > val) pos += x[i] - val; else neg += val - x[i]; } if (a + r < m) return a * neg + r * pos; else { if (pos > neg) return neg * m + (pos - neg) * r; else return pos * m + (neg - pos) * a; } } long long int binary(long long int x[], long long int a, long long int n, long long int r, long long int m, long long int min, long long int max) { if (min > max) return -1; else { long long int mid = (min + max) / 2; long long int q = cost(x, a, n, r, m, mid); long long int w = cost(x, a, n, r, m, mid - 1); long long int e = cost(x, a, n, r, m, mid + 1); if (q <= w && q <= e) { return q; } else if (w > q && q > e) return binary(x, a, n, r, m, mid + 1, max); else return binary(x, a, n, r, m, min, mid - 1); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, a, r, m; cin >> n >> a >> r >> m; long long int *x = new long long int[n]; long long int min = 100000001; long long int max = 0; for (int i = 0; i < n; i++) { cin >> x[i]; if (x[i] > max) max = x[i]; if (x[i] < min) min = x[i]; } long long int sum = binary(x, a, n, r, m, min, max); cout << sum << n ; }
#include <bits/stdc++.h> using namespace std; template <typename TYPE> inline void chkmax(TYPE &first, TYPE second) { first < second ? first = second : 0; } template <typename TYPE> inline void chkmin(TYPE &first, TYPE second) { second < first ? first = second : 0; } template <typename TYPE> void readint(TYPE &first) { first = 0; int f = 1; char c; for (c = getchar(); !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) first = first * 10 + c - 0 ; first *= f; } const int MAXN = 800005; const long long INF = 1ll << 60; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void exgcd(int a, int b, int &first, int &second) { if (!b) { first = 1, second = 0; return; } exgcd(b, a % b, first, second); int t = first; first = second; second = t - (a / b) * second; } int n, m, stot, invn, invm; vector<int> a[MAXN], b[MAXN], ta, tb; map<int, int> ma, mb; long long dis[MAXN]; bool hap[MAXN]; priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > pq; struct Edge { int v; long long c; Edge *next; } pool[MAXN * 3], *h[MAXN]; int etot = 0; inline void addEdge(int u, int v, long long c) { Edge *p = &pool[++etot]; p->v = v; p->c = c; p->next = h[u]; h[u] = p; } void read(int d, vector<int> *a) { int n, first; readint(n); while (n--) { readint(first); a[first % d].push_back(first / d); } } int gma(int first) { return ma.count(first) ? ma[first] : ma[first] = ++stot; } int gmb(int first) { return mb.count(first) ? mb[first] : mb[first] = ++stot; } void dijkstra(int src) { for (int i = 1; i <= stot; ++i) dis[i] = INF; dis[src] = 0; pq.push(make_pair(0, src)); while (!pq.empty()) { pair<long long, int> pr = pq.top(); pq.pop(); int u = pr.second; if (pr.first > dis[u]) continue; for (Edge *p = h[u]; p; p = p->next) if (dis[p->v] > dis[u] + p->c) { dis[p->v] = dis[u] + p->c; pq.push(make_pair(dis[p->v], p->v)); } } } long long solve(vector<int> a, vector<int> b) { ma.clear(); ta.clear(); mb.clear(); tb.clear(); for (int i = 1; i <= stot; ++i) h[i] = NULL, hap[i] = 0; stot = etot = 0; int src = ++stot; for (int i = 0; i < a.size(); ++i) { int first = 1ll * a[i] * invm % n; addEdge(src, gma(first), a[i]); addEdge(gma(first), gmb(1ll * a[i] * invn % m), 0); hap[gma(first)] = 1; ta.push_back(first ? first - 1 : n - 1); tb.push_back(1ll * a[i] * invn % m); tb.push_back((1ll * a[i] * invn + m - 1) % m); a[i] = first; } for (int i = 0; i < b.size(); ++i) { int first = 1ll * b[i] * invn % m; addEdge(src, gmb(first), b[i]); addEdge(gmb(first), gma(1ll * b[i] * invm % n), 0); hap[gmb(first)] = 1; tb.push_back(first ? first - 1 : m - 1); ta.push_back(1ll * b[i] * invm % n); ta.push_back((1ll * b[i] * invm + n - 1) % n); b[i] = first; } for (auto first : ta) a.push_back(first); for (auto first : tb) b.push_back(first); sort(a.begin(), a.end()); auto edu = unique(a.begin(), a.end()); a.erase(edu, a.end()); sort(b.begin(), b.end()); edu = unique(b.begin(), b.end()); b.erase(edu, b.end()); for (int i = 1; i < a.size(); ++i) addEdge(gma(a[i - 1]), gma(a[i]), 1ll * (a[i] - a[i - 1]) * m); addEdge(gma(a.back()), gma(a[0]), 1ll * (a[0] - a.back() + n) * m); for (int i = 1; i < b.size(); ++i) addEdge(gmb(b[i - 1]), gmb(b[i]), 1ll * (b[i] - b[i - 1]) * n); addEdge(gmb(b.back()), gmb(b[0]), 1ll * (b[0] - b.back() + m) * n); dijkstra(src); long long ans = -1; for (int i = 2; i <= stot; ++i) if (!hap[i]) chkmax(ans, dis[i]); return ans; } int main() { readint(n), readint(m); int d = gcd(n, m); if (d > 200000) return 0 * printf( -1 n ); read(d, a); read(d, b); for (int i = 0; i < d; ++i) if (!a[i].size() && !b[i].size()) return 0 * printf( -1 n ); n /= d, m /= d; int temp; exgcd(n, m, invn, temp); if (invn < 0) invn += m; exgcd(n, m, temp, invm); if (invm < 0) invm += n; long long ans = 0; for (int i = 0; i < d; ++i) chkmax(ans, solve(a[i], b[i]) * d + i); printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int inf = 0x3f3f3f3f; int t, n; int a[200]; int main() { int n, q, t, k, d; int cnt; int sum; memset(a, 0, sizeof a); cin >> n >> q; for (int i = 0; i < q; i++) { cnt = 0; sum = 0; cin >> t >> k >> d; for (int j = 0; j < n; j++) { if (a[j] < t) cnt++; } if (cnt < k) cout << -1 << endl; else { for (int j = 0; j < n; j++) { if (a[j] < t) { k--; a[j] = t + d - 1; sum += j + 1; } if (k == 0) break; } cout << sum << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int a[110]; int b[110]; int main() { string s; getline(cin, s); int num = 0, ten = 1; for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == = ) break; if (s[i] <= 9 && s[i] >= 0 ) { int x = s[i] - 0 ; num += x * ten; ten *= 10; } } int cnt = 0; a[0] = 1; for (int i = 0; i < s.size(); i++) { if (s[i] == + ) { a[++cnt] = 1; } else if (s[i] == - ) { a[++cnt] = 0; } } int x = 0; for (int i = 0; i <= cnt; i++) { b[i] = 1; if (a[i]) x += b[i]; else x -= b[i]; } x = num - x; for (int i = 0; i <= cnt; i++) { if (x < 0) { if (a[i] == 0 && b[i] < num) { int k = min(num - b[i], -x); b[i] += k; x += k; } } else if (x > 0) { if (a[i] == 1 && b[i] < num) { int k = min(num - b[i], x); b[i] += k; x -= k; } } else break; } x = 0; for (int i = 0; i <= cnt; i++) { if (a[i]) x += b[i]; else x -= b[i]; } if (x != num) { cout << Impossible << endl; return 0; } cout << Possible << endl; cnt = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == + || s[i] == - || s[i] == = ) { cout << b[cnt++] << << s[i] << ; } } cout << num << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, x; cin >> n >> x; long long sum = 0; for (int i = 0; i < n; i++) { long long a; cin >> a; sum += a; } if (sum + n - 1 == x) return 0 * puts( YES ); puts( NO ); return 0; }
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; using ll = long long; using lld = long double; using vll = int64_t; int main() { map<int, pair<int, int> > hm; int a[] = {4, 8, 15, 16, 23, 42}; for (int i = 0; i < 6; i++) { for (int j = i + 1; j < 6; j++) hm[a[i] * a[j]] = {a[i], a[j]}; } int ans[7]; cout << ? << 1 2 n << flush; int x; cin >> x; auto p1 = hm[x]; cout << ? 2 3 n << flush; cin >> x; auto p2 = hm[x]; if (p1.first == p2.first || p1.first == p2.second) { ans[2] = p1.first; ans[1] = p1.second; if (p1.first == p2.first) { ans[3] = p2.second; } else { ans[3] = p2.first; } } else { ans[2] = p1.second; ans[1] = p1.first; if (p1.second == p2.first) ans[3] = p2.second; else ans[3] = p2.first; } cout << ? 4 5 n << flush; cin >> x; p1 = hm[x]; cout << ? 5 6 n << flush; cin >> x; p2 = hm[x]; if (p1.first == p2.first || p1.first == p2.second) { ans[5] = p1.first; ans[4] = p1.second; if (p1.first == p2.first) { ans[6] = p2.second; } else { ans[6] = p2.first; } } else { ans[5] = p1.second; ans[4] = p1.first; if (p1.second == p2.first) ans[6] = p2.second; else ans[6] = p2.first; } cout << ! ; for (int i = 1; i < 7; i++) cout << ans[i] << ; cout << n << flush; return 0; }
#include <bits/stdc++.h> using namespace std; int n; string s; int dp[111][55][222][3]; int res; void dfs(int pos, int left, int x, int dx) { if (dp[pos][left][x + 100][dx + 1]) return; dp[pos][left][x + 100][dx + 1] = 1; if (pos == s.size()) { if (left == 0) res = max(res, abs(x)); return; } for (int i = 0; i <= left; i++) { int ddx = (s[pos] == F ); if (i % 2 == 1) ddx = !ddx; dfs(pos + 1, left - i, x + (ddx == 1 ? dx : 0), dx * (ddx == 0 ? -1 : 1)); } } int main() { cin >> s; cin >> n; dfs(0, n, 0, 1); cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int hv[5]; map<string, int> dys; string dyi[5] = { S , M , L , XL , XXL }; int order[5][5] = {{0, 1, 2, 3, 4}, {1, 2, 0, 3, 4}, {2, 3, 1, 4, 0}, {3, 4, 2, 1, 0}, {4, 3, 2, 1, 0}}; int k; string sk; void init() { dys[ S ] = 0; dys[ M ] = 1; dys[ L ] = 2; dys[ XL ] = 3; dys[ XXL ] = 4; } int main() { init(); for (int i = 0; i < 5; i++) scanf( %d , hv + i); scanf( %d , &k); for (int i = 0; i < k; i++) { cin >> sk; int dyk = dys[sk]; for (int j = 0; j < 5; j++) if (hv[order[dyk][j]]) { hv[order[dyk][j]]--; cout << dyi[order[dyk][j]] << endl; break; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, i, a, k = 0; vector<int> v; cin >> n; for (i = 0; i < n; i++) { cin >> a; v.push_back(a); } sort(v.begin(), v.end(), greater<int>()); for (i = 0; i <= n - 3; i++) { if (v[i] < v[i + 1] + v[i + 2]) k++; } if (k > 0) cout << YES ; else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); double l, p, q; cin >> l >> p >> q; cout << setprecision(9) << (p * l) / (p + q); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; vector<int> result; for (int i = 0; i < t; i++) { int b, p, f, h, c; cin >> b >> p >> f >> h >> c; int res = 0; b /= 2; if (h > c) { if (b - p > 0) { res += p * h; b -= p; } else { res += b * h; b = 0; } if (b > 0) { if (b > f) { res += f * c; b = 0; } else { res += b * c; b = 0; } } } else if (c > h) { if (b - f > 0) { res += f * c; b -= f; } else { res += b * c; b = 0; } if (b > 0) { if (b > p) { res += p * h; b = 0; } else { res += b * h; b = 0; } } } else { if (f + p <= b) res += (f + p) * h; else res += b * h; } result.push_back(res); } for (int i = 0; i < t; i++) cout << result.at(i) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { cin >> n; cout << n / 2 << endl; } }
#include <bits/stdc++.h> using namespace std; long long x; int getAdded(long long n) { int lo = 1, hi = 10000000; while (lo < hi) { long long mid = (lo + hi) / 2 + (lo + hi) % 2; long long temp = (mid * mid + mid) / 2; if (temp == n) return mid; else if (temp < n) lo = mid; else hi = mid - 1; } return lo; } bool isPossible(int h, int mod, long long n) { long long temp = x + h; return getAdded(temp) >= h * 3 + mod; } int main() { long long n; cin >> n; int mod = (n % 3 - 3) * -1; int lo = 0, hi = 10000000; x = (n + mod) / 3; while (lo < hi) { int mid = (lo + hi) / 2 + (lo + hi) % 2; if (isPossible(mid, mod, n)) lo = mid; else hi = mid - 1; } if (!isPossible(lo, mod, n)) cout << 0; else cout << lo + 1; return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000,100000000000 ) using namespace std; const long long inf = 1e18 + 7; const long long mod = 1e9 + 7; const double eps = 1e-12; const double PI = 2 * acos(0.0); const double E = 2.71828; int n; long long a[1000005]; long long d[1000005], sz; long long cnt[1000005]; long long res = 1; long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } void up(long long x) { sz = 0; for (long long i = 1; i * i <= x; ++i) { if (x % i == 0) { d[sz++] = i; if (i * i != x) { d[sz++] = x / i; } } } sort(d, d + sz); for (long long(i) = 0; (i) < (long long)(sz); (i)++) { cnt[i] = 0; } for (long long(i) = 0; (i) < (long long)(n); (i)++) { long long cur = gcd(x, a[i]); int num = lower_bound(d, d + sz, cur) - d; ++cnt[num]; } for (long long(i) = 0; (i) < (long long)(sz); (i)++) { for (int j = i + 1; j < sz; ++j) { if (d[j] % d[i] == 0) { cnt[i] += cnt[j]; } } if (cnt[i] + cnt[i] >= n && res < d[i]) { res = d[i]; } } } int main(void) { srand(time(NULL)); scanf( %d , &n); for (long long(i) = 0; (i) < (long long)(n); (i)++) { scanf( %I64d , a + i); } for (long long(i) = 0; (i) < (long long)(10); (i)++) { up(a[(rand() << 16 | rand()) % n]); } cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using u32 = unsigned int; using u64 = unsigned long long; char buf[10]; void NO() { puts( Impossible ); exit(0); } ll update(ll x, ll c) { if (x == LLONG_MAX || x == LLONG_MIN) return x; return x + c; } int main() { int n; scanf( %d , &n); ll max_r = LLONG_MAX; ll min_r = LLONG_MIN; for (int i = (0); i < (n); ++i) { ll c_i, d_i; scanf( %lld%lld , &c_i, &d_i); ; if (d_i == 2) { if (min_r >= 1900) NO(); if (max_r >= 1900) max_r = 1899; } else if (d_i == 1) { if (max_r < 1900) NO(); if (min_r < 1900) min_r = 1900; } max_r = update(max_r, c_i); min_r = update(min_r, c_i); } if (max_r == LLONG_MAX) puts( Infinity ); else printf( %lld , max_r); return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> g[300005]; int cnt[300005]; int vis[300005]; int ans[300001][26]; int res = 0; int main() { queue<int> q; int n, m; cin >> n >> m; string s; cin >> s; int x, y; while (m--) { scanf( %d%d , &x, &y); x--, y--; g[x].push_back(y); cnt[y]++; } for (int i = 0; i < s.size(); i++) { ans[i][s[i] - a ]++; if (!cnt[i]) q.push(i); } while (!q.empty()) { int i = q.front(); q.pop(); for (auto v : g[i]) { cnt[v]--; for (int j = 0; j < 26; j++) { ans[v][j] = max(ans[v][j], ans[i][j] + (s[v] == j + a )); res = max(res, ans[v][j]); } if (!cnt[v]) q.push(v); } } if (*max_element(cnt, cnt + s.size())) return cout << -1, 0; cout << res; return 0; }
#include <bits/stdc++.h> using namespace std; int c[4100]; int s[4100]; vector<long long> g; string str; int main() { long long a; cin >> a; cin >> str; int len = str.length(); for (int i = 0; str[i]; i++) c[i + 1] = str[i] - 0 ; for (int i = 1; i <= len; i++) { s[i] = s[i - 1] + (long long)c[i]; } for (int i = 0; i <= len; i++) for (int j = i + 1; j <= len; j++) g.push_back(s[j] - s[i]); sort(g.begin(), g.end()); int sz = g.size(), sz1; sz1 = upper_bound(g.begin(), g.end(), 0) - lower_bound(g.begin(), g.end(), 0); long long ans = 0; for (int i = 0; i < sz; i++) { if (g[i] == 0) { if (a == 0) ans += sz; continue; } if (a % g[i] == 0 && *lower_bound(g.begin(), g.end(), a / g[i]) == a / g[i]) { if (a == 0) { ans += sz1; continue; } ans += upper_bound(g.begin(), g.end(), a / g[i]) - lower_bound(g.begin(), g.end(), a / g[i]); } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; int l[100005], r[100005], q[100005]; struct node { int v, add; }; node t[4 * 100005]; const int MX = (1LL << 31) - 1; void Push(int v, int tl, int tm, int tr) { if (t[v].add != 0) { t[2 * v].add |= t[v].add; t[2 * v].v |= t[v].add; t[2 * v + 1].add |= t[v].add; t[2 * v + 1].v |= t[v].add; t[v].add = 0; } } void Update(int v, int tl, int tr, int l, int r, int value) { if (l > r) return; if ((tl == l) && (tr == r)) { t[v].add |= value; t[v].v |= value; return; } int tm = (tl + tr) / 2; Push(v, tl, tm, tr); Update(2 * v, tl, tm, l, min(tm, r), value); Update(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, value); t[v].v &= t[2 * v].v; t[v].v &= t[2 * v + 1].v; } int Get(int v, int tl, int tr, int l, int r) { if (l > r) return MX; if ((tl == l) && (tr == r)) return t[v].v; int tm = (tl + tr) / 2; Push(v, tl, tm, tr); return Get(2 * v, tl, tm, l, min(tm, r)) & Get(2 * v + 1, tm + 1, tr, max(l, tm + 1), r); } int main() { scanf( %d %d , &n, &m); for (int(i) = (0); (i) < int(m); ++(i)) { scanf( %d %d %d , l + i, r + i, q + i); Update(1, 0, n - 1, l[i] - 1, r[i] - 1, q[i]); } bool Ok = 1; for (int(i) = (0); (i) < int(m); ++(i)) { int x = Get(1, 0, n - 1, l[i] - 1, r[i] - 1); if (x != q[i]) { Ok = 0; break; } } if (!Ok) { puts( NO ); cin.sync(); cin.get(); return 0; } else { puts( YES ); for (int(i) = (0); (i) < int(n); ++(i)) { printf( %d , Get(1, 0, n - 1, i, i)); } } cin.sync(); cin.get(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(), cur = 1, best = 1; s += s; for (size_t i = 1; i < s.size(); i++) if (s[i] != s[i - 1]) cur++; else { best = max(best, cur); cur = 1; } best = max(best, cur); cout << min(n, best); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; struct Segment { int left, right; } seg[N / 2 + 5]; map<int, bool> m; int a[N]; int n, ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); m.clear(); ans = 1; seg[ans].left = 1; m[a[1]] = true; int i = 2; while (i <= n) { if (m[a[i]]) { seg[ans].right = i; if (i == n) break; ans++; i++; seg[ans].left = i; m.clear(); } m[a[i]] = true; i++; } if (i > n) { if (ans == 1) { printf( -1 n ); return 0; } ans--; seg[ans].right = n; } printf( %d n , ans); for (int i = 1; i <= ans; i++) printf( %d %d n , seg[i].left, seg[i].right); return 0; }
#include <bits/stdc++.h> using namespace std; string CHECK(long long n) { long long t, temp = n, zero = 0, ans = 0, flag = 0; while (temp != 0) { t = temp % 10; if (t == 0 && flag == 0) zero++; else { flag = 1; ans *= 10; ans += t; } temp /= 10; } if (zero != 0) { while (zero != 0) { ans *= 10; zero--; } } if (n == ans) return YES ; else return NO ; } int main() { long long n; cin >> n; cout << CHECK(n) << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans = 0; string str; cin >> str; for (int s = 2; s <= n; s++) { for (int i = 0; i < n - s + 1; i++) { int u = 0, d = 0, l = 0, r = 0; for (int j = i; j < i + s; j++) { if (str[j] == U ) u++; else if (str[j] == D ) d++; else if (str[j] == L ) l++; else if (str[j] == R ) r++; } if (u == d && l == r) { ans++; } } } cout << ans; }
#include <bits/stdc++.h> using namespace std; long long a[1000050]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long rec = 0; long long num = a[0]; long long have = 0; long long can = 0; for (int i = 0; i < n; i++) { if (num == a[i]) have++; if (num != a[i]) { can++; if (a[i + 1] != a[i]) { num = a[i]; rec += min(have, can); have = have + can - min(have, can); can = 0; } } } rec = n - have; cout << rec << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<vector<int>> p(n + 1, vector<int>(m + 1, 0)); vector<int> ma(m + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> p[i][j]; if (p[i][j] > p[ma[j]][j]) ma[j] = i; } set<int> s; for (int i = 1; i <= m; i++) s.insert(ma[i]); if (s.size() == m) { int ans = 0; for (int i = 1; i <= m; i++) { for (int j = 1; j <= m; j++) { if (i == j) continue; int tem = 0; for (int k = 1; k <= n; k++) { tem = max(tem, min(p[k][i], p[k][j])); } for (int k = 1; k <= m; k++) { if (k == i || k == j) continue; tem = min(tem, p[ma[k]][k]); } ans = max(ans, tem); } } cout << ans << n ; } else { int ans = 1e9; for (int i = 1; i <= m; i++) { ans = min(ans, p[ma[i]][i]); } cout << ans << n ; } } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; bool dfs(int x, const vector<vector<int>> &g, vector<char> &used, vector<int> &match, vector<int> &rev_match) { if (used[x]) return false; used[x] = 1; for (int dest : g[x]) { if (match[dest] == -1 || dfs(match[dest], g, used, match, rev_match)) { match[dest] = x; rev_match[x] = dest; return true; } } return false; } int matching(const vector<vector<int>> &g, int left, int right) { vector<char> used(left); vector<int> rev_match(left, -1), match(right, -1); while (true) { bool ok = false; fill(used.begin(), used.end(), 0); for (int i = 0; i < left; i++) if (rev_match[i] == -1 && !used[i]) ok |= dfs(i, g, used, match, rev_match); if (!ok) break; } return left - count(rev_match.begin(), rev_match.end(), -1); } void solve(istream &cin = std::cin, ostream &cout = std::cout) { int n, m; cin >> n >> m; const int inf = int(1e9) + 1; vector<vector<int>> g(n, vector<int>(n, inf)); for (int i = 0; i < n; i++) g[i][i] = 0; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; --u, --v; g[u][v] = g[v][u] = 1; } for (int k = 0; k < n; k++) for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) g[i][j] = min(g[i][j], g[i][k] + g[k][j]); int s, b, k, h; cin >> s >> b >> k >> h; vector<int> pos_s(s), fuel(s), atk(s); vector<int> pos_b(b), def(b); for (int i = 0; i < s; i++) { cin >> pos_s[i] >> atk[i] >> fuel[i]; --pos_s[i]; } for (int i = 0; i < b; i++) { cin >> pos_b[i] >> def[i]; --pos_b[i]; } vector<vector<int>> graph(s); for (int i = 0; i < s; i++) for (int j = 0; j < b; j++) if (g[pos_s[i]][pos_b[j]] <= fuel[i] && def[j] <= atk[i]) graph[i].push_back(j); const int len = matching(graph, s, b); ll ans = min((ll)len * k, (ll)s * h); cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed; cout << setprecision(20); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)(1000000007); const double eps = 1e-9; const double pi = 3.1415926535897932384626; long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } bool isprime(int n) { if (n == 1) return false; for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) return false; } return true; } int modExp(int b, int e, int m) { int x = 1; while (e != 0) { if (e % 2 == 1) x = (x * b) % m; b = (b * b) % m; e = e / 2; } return x; } unsigned long long fact(unsigned long long n) { unsigned long long ret = 1; for (long long i = 1; i <= n; i++) { ret *= i; } return ret; } int ans = 0; int main() { long long n; cin >> n; vector<pair<long long, long long> > vp; for (long long i = 0; i <= n - 1; i++) { int a, b; cin >> a >> b; vp.push_back(make_pair(a, b)); } sort(vp.begin(), vp.end()); ans = vp[0].second; for (long long i = 1; i <= n - 1; i++) { if (vp[i].second >= ans) ans = vp[i].second; else ans = vp[i].first; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long t, n, i, j, k, x, y, z, ans, l, r, mid, s, q; long long a[100005], b[100005], c[100005], d[100005], p[100005], dp[100005][20]; vector<long long> v[100005], u[100005]; map<pair<int, int>, int> m; void dfs(int x, int y, int z) { dp[x][0] = y; d[x] = z; p[x] = y; u[z].push_back(x); for (int i = 0; i < v[x].size(); i++) if (v[x][i] != y) dfs(v[x][i], x, z + 1); } int lca(int x, int y) { if (d[x] < d[y]) swap(x, y); for (int i = 18; i >= 0; i--) if (d[x] - (1 << i) >= d[y]) x = dp[x][i]; if (x == y) return x; for (int i = 18; i >= 0; i--) if (dp[x][i] != dp[y][i]) { x = dp[x][i]; y = dp[y][i]; } return dp[x][0]; } void build() { dfs(1, 0, 0); for (i = 1; i <= 18; i++) for (j = 1; j <= n; j++) dp[j][i] = dp[dp[j][i - 1]][i - 1]; } int main() { ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0); cin >> n; for (i = 1; i < n; i++) { cin >> x >> y; v[x].push_back(y); v[y].push_back(x); b[i] = x; c[i] = y; m[{x, y}] = m[{y, x}] = i; } build(); cin >> q; for (i = 0; i < q; i++) { cin >> x >> y; if (d[x] < d[y]) swap(x, y); z = lca(x, y); a[x]++; a[y]++; a[z] -= 2; } for (i = 100000; i > 0; i--) for (j = 0; j < u[i].size(); j++) { x = u[i][j]; m[{x, p[x]}] = m[{p[x], x}] = a[x]; a[p[x]] += a[x]; } for (i = 1; i < n; i++) cout << m[{b[i], c[i]}] << ; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int mi[n]; for (int i = (0); i < (n); i++) mi[i] = 1e9; int t = 1; int z[1000]; do { t *= 2; vector<int> v; int x = 0; while (x < n) { int f = 0; for (int i = (0); i < (t / 2); i++) { if (x + i < n) v.push_back(x + i); else break; } x += t; } cout << v.size() << n ; ; set<int> temp; for (int i = (0); i < (v.size()); i++) { temp.insert(v[i]); cout << v[i] + 1 << ; } cout << n ; fflush(stdout); for (int i = (0); i < (n); i++) cin >> z[i]; for (int i = (0); i < (n); i++) { if (temp.find(i) == temp.end()) mi[i] = min(mi[i], z[i]); } v.resize(0); x = 0; temp.clear(); while (x < n) { int f = 0; for (int i = (0); i < (t / 2); i++) { if (x + i + t / 2 < n) v.push_back(x + i + t / 2); else break; } x += t; } cout << v.size() << n ; ; for (int i = (0); i < (v.size()); i++) { temp.insert(v[i]); cout << v[i] + 1 << ; } cout << n ; fflush(stdout); for (int i = (0); i < (n); i++) cin >> z[i]; for (int i = (0); i < (n); i++) { if (temp.find(i) == temp.end()) mi[i] = min(mi[i], z[i]); } } while (t < n); cout << -1 n ; fflush(stdout); for (int i = (0); i < (n); i++) cout << mi[i] << ; cout << n ; fflush(stdout); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int n; cin >> n; int sze = n * 2; int arr[sze]; for (int i = 0; i < sze; i++) cin >> arr[i]; sort(arr, arr + sze); cout << arr[n] - arr[n - 1] << endl; } return 0; }
#include <bits/stdc++.h> int n, m; int a[202], b[202]; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int i = 0; i < m; ++i) { scanf( %d , &b[i]); } for (int w = 0; w <= 1 << 9; ++w) { int o = 0; for (int i = 0; i < n; ++i) { int mx = -1; for (int j = 0; j < m; ++j) { if ((w & (a[i] & b[j])) == (a[i] & b[j])) { mx = std::max(a[i] & b[j], mx); } } if (mx == -1) { o = -1; break; } o |= mx; } if (o == w) { printf( %d n , w); return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long is_query = -(1LL << 62); struct line { long long m, b; mutable function<const line*()> succ; bool operator<(const line& rhs) const { if (rhs.b != is_query) return m < rhs.m; const line* s = succ(); if (!s) return 0; long long x = rhs.m; return b - s->b < (s->m - m) * x; } }; struct dynamic_hull : public multiset<line> { const long long inf = LLONG_MAX; bool bad(iterator y) { auto z = next(y); if (y == begin()) { if (z == end()) return 0; return y->m == z->m && y->b <= z->b; } auto x = prev(y); if (z == end()) return y->m == x->m && y->b <= x->b; long long v1 = (x->b - y->b); if (y->m == x->m) v1 = x->b > y->b ? inf : -inf; else v1 /= (y->m - x->m); long long v2 = (y->b - z->b); if (z->m == y->m) v2 = y->b > z->b ? inf : -inf; else v2 /= (z->m - y->m); return v1 >= v2; } void insert_line(long long m, long long b) { auto y = insert({m, b}); y->succ = [=] { return next(y) == end() ? 0 : &*next(y); }; if (bad(y)) { erase(y); return; } while (next(y) != end() && bad(next(y))) erase(next(y)); while (y != begin() && bad(prev(y))) erase(prev(y)); } __int128 eval(long long x) { auto l = *lower_bound(line{x, is_query}); return (__int128)l.m * x + l.b; } }; int main() { int n; long long s; cin >> n >> s; vector<pair<long long, long long>> buildings(n); for (int i = 0; i < n; ++i) { cin >> buildings[i].second >> buildings[i].first; } sort(buildings.begin(), buildings.end()); assert(buildings[0].first == 0); vector<long long> min_time(n + 1, s + 1); vector<long long> max_cookies(n + 1, 0); min_time[0] = 0; max_cookies[0] = 0; dynamic_hull dp_opt; dp_opt.insert_line(buildings[0].second, 0); for (int i = 1; i < n; ++i) { long long left = min_time[i - 1]; long long right = s + 50; while (left + 1 < right) { long long mid = (left + right) / 2; if (dp_opt.eval(mid) >= buildings[i].first) { right = mid; } else { left = mid; } } if (dp_opt.eval(left) - buildings[i].first < 0) { ++left; } min_time[i] = left; max_cookies[i] = dp_opt.eval(left) - buildings[i].first; dp_opt.insert_line( buildings[i].second, max_cookies[i] - 1LL * buildings[i].second * min_time[i]); } long long ans = s; for (int i = 0; i < n; ++i) { ans = min(ans, min_time[i] + (s - max_cookies[i] - 1) / buildings[i].second + 1); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; template <class T> inline void read(T& x, T& y) { read(x); read(y); } template <class T> inline void read(T& x, T& y, T& z) { read(x); read(y); read(z); } inline char getc() { char c; for (c = getchar(); c <= 32; c = getchar()) ; return c; } const int N = 10010; const double pi = 2 * acos(0); const double eps = 1e-9; int w, h, n, m, i, j, st, g; double L0, R0, R; long long x[N], y[N]; double d[1010][1010], an[1010][1010]; int p[N]; double c[N]; double D(int i, int j) { return sqrt((1LL * (x[i] - x[j]) * (x[i] - x[j])) + (1LL * (y[i] - y[j]) * (y[i] - y[j]))); } double geta(int i, int j) { return atan2(y[j] - y[i], x[j] - x[i]); } bool same(double a, double b) { return abs(a - b) <= eps; } double ans; void add(double L, double R) { if (R > pi) { add(L, pi); add(-pi, R - 2 * pi); } else if (L < -pi) { add(L + 2 * pi, pi); add(-pi, R); } else c[++g] = L - 1e-15, c[++g] = R + 1e-15; } bool cmp(int x, int y) { return c[x] < c[y]; } bool ok(double R) { int i, j, k; double tt; g = 0; c[++g] = -pi; c[++g] = pi; if (x[st] < R) { tt = acos(x[st] / R); for (k = 1; k <= 2; k++) add(-pi - tt, -pi + tt); } if (w - x[st] < R) { tt = acos((w - x[st]) / R); for (k = 1; k <= 2; k++) add(-tt, tt); } if (y[st] < R) { tt = acos(y[st] / R); for (k = 1; k <= 2; k++) add(-pi / 2 - tt, -pi / 2 + tt); } if (h - y[st] < R) { tt = acos((h - y[st]) / R); for (k = 1; k <= 2; k++) add(pi / 2 - tt, pi / 2 + tt); } for (i = 1; i <= n; i++) if (i != st && d[st][i] < 2 * R && d[st][i] > eps) { tt = acos(d[st][i] / 2 / R); add(an[st][i] - tt, an[st][i] + tt); } for (i = 1; i <= g; i++) p[i] = i; sort(p + 1, p + 1 + g, cmp); int s = 0; for (i = 1; i <= g; i++) if ((s += (p[i] & 1 ? 1 : -1)) < 3 && i + 1 <= g && c[p[i + 1]] - c[p[i]] > eps) return 1; return 0; } int main() { read(w, h, n); for (i = 1; i <= n; i++) cin >> x[i] >> y[i]; for (i = 1; i <= n; i++) { int t = rand() % i + 1; swap(x[i], x[t]); swap(y[i], y[t]); } for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) d[i][j] = D(i, j), an[i][j] = geta(i, j); for (st = 1; st <= n; st++) if (ok(R)) { L0 = R; R0 = 2e6; while (L0 + eps < R0) { R = (L0 + R0) / 2; if (ok(R)) L0 = R; else R0 = R; } } cout << fixed << setprecision(10) << R << endl; scanf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 1; const long long MOD = 1e9 + 7; const long long INF = 1e9; void solve(long long a, long long b) { if (a == 0 and b == 0) { cout << 0 << endl; } else if (a == b) { cout << 1 << endl; } else if (abs(a - b) % 2 == 1) { cout << -1 << endl; } else { cout << 2 << endl; } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; cin >> tc; for (int t = 1; t <= tc; t++) { long long a, b; cin >> a >> b; solve(a, b); } }
#include <bits/stdc++.h> using namespace std; int main() { int a[1001], i, n, sum = 0, max = 0; int b[1001] = {0}; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) { b[a[i]]++; } for (i = 0; i < 1001; i++) { if (b[i] > max) max = b[i]; if (b[i]) sum++; } cout << max << ; cout << sum; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int tt; cin >> tt; while (tt--) { int a, b, c, saveb = 0; string st, md, en; st = md = en = ; cin >> a >> b >> c; bool ub = false; while (b) { if (!ub) { md += 01 ; b--; ub = true; } else { if (b == 1 && md[md.size() - 1] == 1 ) { saveb = 1; b--; } else { md += md[md.size() - 1] ^ 1; b--; } } } if (a) { if (!md.size()) st += 00 ; else st += 0 ; a--; } for (int i = 1; i <= a; i++) { st += 0 ; } if (c) { if (!md.size()) en += 11 ; else en += 1 ; c--; } for (int i = 1; i <= c; i++) { en += 1 ; } if (saveb > 0) cout << 1; cout << st << md << en << n ; } }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; cout << s; reverse(s.begin(), s.end()); cout << s; }
#include <bits/stdc++.h> using namespace std; void CountTriangles(vector<int> A) { int n = A.size(); sort(A.begin(), A.end()); int count = 0; for (int i = n - 1; i >= 1; i--) { int l = 0, r = i - 1; while (l < r) { if (A[l] + A[r] > A[i]) { count += r - l; r--; } else l++; } } cout << No of possible solutions: << count; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int a, b; cin >> a >> b; if (a >= b) { cout << (b - 1) / 2 << endl; } else { long long int c = (2 * a - b + 1) / 2; cout << max(0LL, c); } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; int n, b[110], l, r, c, t, q[110], m; int main() { cin >> m >> n; for (int i = 1; i <= m; i++) b[i] = 1 << 30; for (int i = 0; i < n; i++) { cin >> l >> r >> t >> c; for (int j = l; j <= r; j++) { if (t < b[j]) b[j] = t, q[j] = c; } } int s = 0; for (int i = 1; i <= m; i++) { s += q[i]; } cout << s; return 0; }
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define sz(a) ((int)a.size()) #define re return #define all(a) a.begin(),a.end() #define int long long #define ld long double #define rept(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,a) rept(i,0,a) using namespace std; void fail(string s){ cout<<s;exit(0); } void fail(int s){ cout<<s;exit(0); } void chmax(ld &a,ld b,pair<int,int> &c,pair<int,int> d){ if (b>a) a=b,c=d; } int n,d; int a[100005]; ld dp[100005][10]; ld lg[100005]; pair<int,int>l[100005][10]; signed main(){ cin>>n>>d; rept(i,1,n+1){ cin>>a[i]; lg[i]=log2(a[i]); } rep(i,n+1) rep(j,10) dp[i][j]=-1.0; dp[0][1]=0.0; rep(i,n){ rep(j,10){ if (dp[i][j]>=0.0){ chmax(dp[i+1][j],dp[i][j],l[i+1][j],mp(0,j)); chmax(dp[i+1][j*a[i+1]%10],dp[i][j]+lg[i+1],l[i+1][j*a[i+1]%10],mp(1,j)); } } } int pos=-1; ld ans=0.0; rept(i,1,n+1){ if (dp[i][d]>=ans){ ans=dp[i][d]; pos=i; } } vector<int>v; int x=l[pos][d].first,y=l[pos][d].second; for (int i=pos-1;i>=0;i--){ if (x) v.pb(i+1); x=l[i][y].first,y=l[i][y].second; } if (!sz(v)) fail(-1); cout<<sz(v)<< n ; rep(i,sz(v)) cout<<a[v[i]]<< ; return 0; }
#include <bits/stdc++.h> using namespace std; void read(int& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; char getc() { char c; for (c = getchar(); c <= 32; c = getchar()) ; return c; } const int N = 100010; int n, i, j, k, l, p, x, a[N], s0, s1; int b[N]; int main() { read(n); for (i = 1; i <= n; i++) read(a[i]); for (i = 1; i <= n && a[i] == 0; i++) printf( 0 n ); for (; i <= n; i = j + 1) { for (j = i; j <= n && a[j] > 0; j++) ; j--; if (j + 1 > n) { for (k = i; k <= n; k++) printf( pushStack n ); break; } b[0] = 0; for (k = i; k <= j; k++) b[++b[0]] = a[k]; sort(b + 1, b + 1 + b[0]); if (b[0] == 0) printf( 0 n ); else if (b[0] == 1) printf( pushStack n1 popStack n ); else if (b[0] == 2) printf( pushStack npushQueue n2 popStack popQueue n ); else { p = b[b[0] - 2]; for (k = i; k <= j; k++) if (a[k] >= p) break; s0 = k; for (k = j; k >= i; k--) if (a[k] >= p) break; s1 = k; if (s1 <= s0) printf( - - n ); for (k = i; k <= j; k++) if (k == s1) printf( pushStack n ); else if (k == s0) printf( pushQueue n ); else if (a[k] >= p) printf( pushFront n ); else if (k < s1) printf( pushStack n ); else printf( pushQueue n ); printf( 3 popStack popQueue popFront n ); } j++; } scanf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; struct com { int l, r; long long c; friend bool operator<(const com &a, const com &b) { return a.r < b.r; } } a[100010]; int n, m, K; long long cost[310][310], dp[310][310]; const long long inf = 0x3F3F3F3F3F3F3F3FLL; int main() { scanf( %d%d%d , &n, &m, &K); memset(cost, 0x3F, sizeof(cost)); for (int i = 0; i < m; i++) scanf( %d%d%I64d , &a[i].l, &a[i].r, &a[i].c), cost[a[i].l][a[i].r] = min(cost[a[i].l][a[i].r], a[i].c); for (int l = n; l >= 1; l--) { for (int i = 1; i + l - 1 <= n; i++) { int st = i, ed = i + l - 1; if (st > 1) cost[st][ed] = min(cost[st][ed], cost[st - 1][ed]); if (ed < n) cost[st][ed] = min(cost[st][ed], cost[st][ed + 1]); } } memset(dp, 0x3F, sizeof(dp)); dp[0][0] = 0; for (int i = 1; i <= n; i++) for (int j = 0; j <= i; j++) { dp[i][j] = min(dp[i][j], dp[i - 1][j]); for (int k = 0; k <= j; k++) dp[i][j] = min(dp[i - k][j - k] + cost[i - k + 1][i], dp[i][j]); } if (dp[n][K] == inf) cout << -1 << endl; else cout << dp[n][K] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int a[107], b[107]; int ans[10000007]; int n, nMax, nMaxid, times, nMin, aol, aMin, aMax, aL; void init() { memset(a, 0, sizeof(a)); memset(ans, 0, sizeof(ans)); memset(b, 0, sizeof(b)); aol = 0; aL = 0; } int check(int x) { nMax = 0; times = 0; for (int i = 1; i <= n; i++) { if (a[i] > nMax) { nMax = a[i]; nMaxid = i; times = 0; } if (a[i] == nMax) times++; } if (times < x) return 1; return 0; } void makeans(int x) { times -= x; for (int i = 1; i <= n; i++) if (a[i] == nMax) { x--; a[i]--; ans[++aol] = i; if (x == 0) break; } ++aol; aL++; } void printans(int x) { if (ans[x] == 0) { for (int i = 1; i <= n; i++) printf( %d , b[i]); printf( n ); memset(b, 0, sizeof(b)); } else b[ans[x]] = 1; } int main() { while (scanf( %d , &n) != EOF) { init(); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); while (check(2)) { int yMax = -1, yID = 0; for (int i = 1; i <= n; i++) if (a[i] > yMax) { if (i == nMaxid) continue; yMax = a[i]; yID = i; } ans[++aol] = yID; ans[++aol] = nMaxid; ++aol; aL++; if (a[yID]) a[yID]--; a[nMaxid]--; } aMin = 107; aMax = 0; for (int i = 1; i <= n; i++) if (a[i] < aMin) aMin = a[i]; while (check(n)) { if (times % 2 == 1) makeans(3); while (times) makeans(2); } printf( %d n%d n , aMin, aL); for (int i = 1; i <= aol; i++) printans(i); } return 0; }
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; namespace Bigcat { template <typename T> inline void max_s(T& a, const T& b) { a = max(a, b); } template <typename T> inline void min_s(T& a, const T& b) { a = min(a, b); } template <typename T> void sort_v(T& x) { sort(x.begin(), x.end()); } template <typename T> void erase_dup(T& x) { x.erase(unique(x.begin(), x.end()), x.end()); } template <typename T, typename V> int pos_l(const T& x, const V& v) { return lower_bound(x.begin(), x.end(), v) - x.begin(); } template <typename T, typename V> int pos_u(const T& x, const V& v) { return upper_bound(x.begin(), x.end(), v) - x.begin(); } inline unsigned rand_g() { static mt19937 mt_rand((int)time(0)); return mt_rand(); } using LL = long long; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<LL>; using PII = pair<int, int>; using VPII = vector<PII>; } // namespace Bigcat using namespace Bigcat; const LL base = LL(1e9 + 7); const LL INFL = 1LL << 62; const int INF = 1 << 30; const int MAX = int(1e5 + 100); struct Node { int x, y, w; }; bool operator<(const Node& n0, const Node& n1) { return n0.x < n1.y; } LL le0[300], ri0[300], th[300]; string zs[MAX]; void solve1() { LL result = 0; int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> zs[i]; } string s = zs[n - 1]; char c0 = ; LL g = 0; for (auto x : s) { if (x == c0) g++; else { c0 = x; result = max(result, g); g = 1; } } result = max(result, g); char lastone; auto work = [&]() { int bb = n; for (int tt = n - 1; tt >= 0; --tt) { string s = zs[tt]; LL g = 0; for (auto x : s) { if (x == lastone) g++; else { break; } } if (g == s.size()) { continue; } bb = tt + 1; break; } auto func = [&](const string& s) { LL t = 0, a = 0; for (auto c : s) { if (c == lastone) { t++; a = max(a, t); } else { t = 0; } } return a; }; LL mc = 0; for (int i = 0; i < bb; ++i) { string s = zs[i]; if (mc == 0) { mc = func(s); continue; } if (i != bb - 1) continue; LL t = 1; for (int i = 0; i < s.size(); ++i) { if (s[i] != lastone) break; t++; } for (int i = s.size() - 1; i >= 0; --i) { if (s[i] != lastone) break; t++; } mc = t; mc = max(mc, func(s)); } for (int i = bb; i < n; ++i) { mc = (mc + 1) * zs[i].size() + mc; } result = max(result, mc); }; lastone = zs[n - 1][0]; work(); lastone = zs[n - 1].back(); work(); cout << result << endl; } void solve() { int t = 1; for (int i = 0; i < t; ++i) { solve1(); } int x = 1; } void io_init() { const int inId = 0; const int outId = 0; if (inId > 0) { cerr << redirect stdin to input << inId << endl; string s = input ; s += to_string(inId); s += .txt ; auto r = freopen(s.c_str(), r , stdin); if (r == nullptr) { cerr << invalid input file << s << endl; ; r = freopen( CON , r , stdin); } } if (outId > 0) { cerr << redirect stdout to stdout << outId << endl; string s = stdout ; s += to_string(outId); s += .txt ; auto r = freopen(s.c_str(), w , stdout); if (r == nullptr) { cerr << invalid output file << s << endl; ; r = freopen( CON , w , stdout); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(11); solve(); }
#include <bits/stdc++.h> using namespace std; int main() { string s, s1; int count1 = 0, count2 = 0; cin >> s >> s1; for (int i = 0; i < s.size(); i++) { if (s[i] != s1[i]) { if (s[i] == 4 ) count1++; else count2++; } } if (count1 <= count2) cout << count2; else cout << count1; cin.get(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int n; cin >> n; map<int, int> m; long long int a[n]; for (int j = 0; j < n; j++) { cin >> a[j]; m[a[j] % 3]++; } long long int res = m[0]; if (m[1] >= m[2]) { res += m[2]; m[1] = m[1] - m[2]; res += m[1] / 3; } else { res += m[1]; m[2] = m[2] - m[1]; res += m[2] / 3; } cout << res << n ; } }
#include <bits/stdc++.h> using namespace std; int n, ans, flag; int a[100005], b[100005], xb[100005]; void solve() { int i, j, ma; ans = -1; b[1] = xb[1] = 0; for (i = 2; i <= n; i++) { ma = 0; flag = 0; j = i - 1; while (a[j] < a[i] && j) { if (!b[j]) { flag = 1; break; } if (b[j] > ma) ma = b[j]; j = xb[j]; } if (!flag) b[i] = ma + 1; else b[i] = 0; xb[i] = j; } for (i = 1; i <= n; i++) { if (ans < b[i]) ans = b[i]; } } int main() { int i, j; while (~scanf( %d , &n)) { for (i = 1; i <= n; i++) { scanf( %d , &a[i]); } solve(); printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const int SIZE = 1 << 20; int INF = 1000000001; int a[SIZE], ops[SIZE]; int h, g; int qq[24], qn; int pull(int id) { int tmp = a[id]; a[id] = 0; qn = 0; qq[qn++] = id; while (id * 2 < (1 << h) && a[id] < max(a[id << 1], a[(id << 1) | 1])) { if (a[id << 1] > a[(id << 1) | 1]) { swap(a[id << 1], a[id]); id <<= 1; } else { swap(a[(id << 1) | 1], a[id]); id = (id << 1) | 1; } qq[qn++] = id; } if (id < (1 << g)) { for (int i = qn - 1; i > 0; i--) { a[qq[i]] = a[qq[i - 1]]; } a[qq[0]] = tmp; return 0; } return tmp; } void solve() { scanf( %d%d , &h, &g); long long an = 0; for (int i = 1; i < (1 << h); i++) { scanf( %d , &a[i]); an += a[i]; } int need = 0; for (int i = 1; i < (1 << g); i++) { while (1) { int v = pull(i); if (v) { an -= v; ops[need++] = i; } else break; } } printf( %lld n , an); for (int i = 0; i < need; i++) printf( %d%c , ops[i], n [i == need - 1]); } int main() { int T; scanf( %d , &T); while (T--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> a >> b; cout << (a * b) / 2; return 0; }
#include <bits/stdc++.h> using namespace std; const long long mox = 1e6 + 9; long long ha[mox]; long long mod = 1e9 + 7; long long d[mox]; bool visit[mox]; long long ma[mox]; bool visit2[mox]; long long ta(long long a, long long b) { long long ans = 1; long long c = a; while (b) { if (b % 2) { ans = (ans * c) % mod; } c = (c * c) % mod; b /= 2; } return ans; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; string t; cin >> t; d[0] = 1; for (long long i = 0; i < t.size(); i++) { long long x = (d[i] * (t[i] - a + 1)) % mod; ha[i] = (ha[i - 1] + x) % mod; d[i + 1] = (d[i] * 27) % mod; } long long ans = 0; for (long long i = t.size() - 1; i >= 1; i--) { long long x = (ha[t.size() - 1] - ha[i - 1] + mod) % mod; long long y = ta(d[i], mod - 2); x = (x * y) % mod; if (x == ha[t.size() - 1 - i]) { visit[i] = 1; } } for (long long i = 0; i < m; i++) { cin >> ma[i]; visit2[ma[i]] = 1; } for (long long i = 1; i < m; i++) { if (ma[i] - ma[i - 1] < t.size()) { if (visit[ma[i] - ma[i - 1]] == 0) { cout << 0; exit(0); } } } long long x = 0; long long o = 0; for (long long i = 1; i <= n; i++) { if (visit2[i] == 1) { x = i + t.size() - 1; } if (i > x) { o += 1; } } long long w = 1; for (long long i = 0; i < o; i++) { w = (w * 26) % mod; } cout << w; }
#include <bits/stdc++.h> using namespace std; void solve_test() { string s; cin >> s; int n = int(s.length()); int total = 0; long long ans = 0; for (int i = 0; i < n; i++) { if (s[i] == + ) total++; else total--; if (total < 0) { total++; ans += i + 1; } } cout << ans + n << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tests = 1; cin >> tests; while (tests--) solve_test(); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int sum[maxn], op[maxn]; int main() { int n, l = 0, r = 0, ans = 0, minn = 100; string s; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == ( ) { op[i + 1] = 1; sum[i + 1] = sum[i] + 1; l++; } else { op[i + 1] = 0; sum[i + 1] = sum[i] - 1; r++; } } if (n & 1 == 1 || (abs(l - r) > 2) || (sum[n] == 0) || (*min_element(sum + 1, sum + 1 + n) < -2) || (*min_element(sum + 1, sum + 1 + n) < 0 && sum[n] != -2)) { printf( 0 n ); exit(0); } if (sum[n] == -2) { for (int i = 1; i <= n; i++) { if (op[i] == 0 && sum[i] < 0) { ans++; break; } else if (op[i] == 0 && sum[i] >= 0) ans++; } } if (sum[n] == 2) { for (int i = n; i >= 1; i--) { if (sum[i] >= 2) minn = i; else break; } minn = max(minn, 2); for (int i = minn; i <= n; i++) { if (op[i] == 1) ans++; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; int fr[200002]; int arr[200002]; bool check(int cati) { int qq = 0; for (int i = 1; i <= 200000; ++i) qq += fr[i] / cati; if (qq >= k) return 1; return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> arr[i], fr[arr[i]]++; int b = 1; int e = n; int ans = 1; while (b <= e) { int mid = (b + e) / 2; if (check(mid)) ans = mid, b = mid + 1; else e = mid - 1; } int qa = 0; for (int i = 1; i <= 200000; ++i) { if (qa == k) return 0; while (fr[i] >= ans && qa < k) cout << i << , ++qa, fr[i] -= ans; } return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> v; map<int, long long> dp; long long power(int a, long long b) { long long res = 1, base = a; while (b > 0) { if (b % 2) { res *= base; res %= (1000 * 1000 * 1000 + 7); } base *= base; base %= (1000 * 1000 * 1000 + 7); b /= 2; } return res; } long long compute(int g) { if (g == 1) { return 1; } if (dp.find(g) != dp.end()) { return dp[g]; } long long val = power(2, g - 1); int i; for (i = 0; i < v.size(); i++) { if (v[i] >= g) { break; } if (g % v[i] == 0) val -= compute(v[i]); } dp[g] = val; dp[g] %= (1000 * 1000 * 1000 + 7); dp[g] += (1000 * 1000 * 1000 + 7); dp[g] %= (1000 * 1000 * 1000 + 7); return dp[g]; } int main() { std::ios::sync_with_stdio(false); int x, y, val1, i; cin >> x >> y; if (y % x) { cout << 0 << endl; } else { y /= x; for (i = 1; i * i <= y; i++) { if (y % i == 0) { v.push_back(i); if (y / i != i) v.push_back(y / i); } } sort(v.begin(), v.end()); cout << compute(y); } }
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { long long r; while (b != 0) { r = a % b; a = b; b = r; } return a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } int n, m; vector<int> v[4000000]; char g[4000000]; int inline make(int i, int j) { return i * m + j; } void solve() { cin >> n >> m; int cnt = 0; for (int i = 0; i < n; i++) { char buf[2001]; cin >> buf; for (int j = 0; j < m; j++) { g[make(i, j)] = buf[j]; if (g[make(i, j)] == . ) { cnt++; if (i > 0 && g[make(i - 1, j)] == . ) { v[make(i, j)].push_back(make(i - 1, j)); v[make(i - 1, j)].push_back(make(i, j)); } if (j > 0 && g[make(i, j - 1)] == . ) { v[make(i, j)].push_back(make(i, j - 1)); v[make(i, j - 1)].push_back(make(i, j)); } } } } queue<int> q; for (int i = 0; i < n * m; i++) if (int((v[i]).size()) == 1) q.push(i); while (!q.empty()) { int i = q.front(); q.pop(); if (int((v[i]).size()) == 1) { int j = v[i][0], x = ((i) > (j) ? (j) : (i)), y = ((i) > (j) ? (i) : (j)); if (x / m == y / m) { g[x] = < ; g[y] = > ; } else { g[x] = ^ ; g[y] = v ; } for (int k = 0; k < int((v[j]).size()); k++) { int l = v[j][k]; for (int h = 0; h < int((v[l]).size()); h++) { if (v[l][h] == j) { v[l].erase(v[l].begin() + h); break; } } if (int((v[l]).size()) == 1) q.push(l); } v[i].clear(); v[j].clear(); cnt -= 2; } } if (cnt) { cout << Not unique ; return; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) cout << g[make(i, j)]; cout << n ; } } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v = {1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683}; vector<int> vis; for (int i = 0; i < (1 << 10); i++) { int sum = 0; for (int j = 0; j < 10; j++) { if (i & (1 << j)) { sum += v[j]; } } vis.push_back(sum); } sort(vis.begin(), vis.end()); int q; cin >> q; while (q--) { int x; cin >> x; cout << *lower_bound(vis.begin(), vis.end(), x) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int main() { int T; scanf( %d , &T); while (T--) { int l, r; scanf( %d%d , &l, &r); if (l * 2 > r) { printf( YES n ); } else { printf( NO n ); } } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, k, a[100000], b[1000000], i, s, j, x, y; int main() { cin >> n >> m; if (n == m) { cout << 0 << endl; return 0; } while (n > 0) { a[i] = n % 2; n = n / 2; i++; } while (m > 0) { b[x] = m % 2; m = m / 2; x++; } while (a[x] == b[x]) { x--; } y = 1; for (j = 0; j <= x; j++) { y *= 2; } cout << y - 1 << endl; }
#include<bits/stdc++.h> #define LL long long using namespace std; int n,m,edge_t=0,sum=0,rt_t=0; bool tyl_jyy=0; LL t,ans=0; int rt[200002]={}; vector<int> vec[200002]; set<int> s; struct aaa { int x,y,val,u; }e[200002]; template<class T>void read(T &x) { x=0;int f=0;char ch=getchar(); while(ch< 0 || ch> 9 )f|=(ch== - ),ch=getchar(); while(ch>= 0 && ch<= 9 )x=(x<<3)+(x<<1)+(ch^48),ch=getchar(); x=f? -x:x;return ; } inline bool cmp(aaa a,aaa b) { return a.val<b.val? 1:0; } inline void add_edge(int x,int y,int z,int i) { e[i]=(aaa){x,y,z,0},vec[x].push_back(y),vec[y].push_back(x); } inline void dfs(int x,int y) { int i,j;s.erase(x),rt[x]=y; set<int>::iterator it; for(int i=1;;++i) { it=s.lower_bound(i); if(it==s.end())return ; i=(*it),j=lower_bound(vec[x].begin(),vec[x].end(),i)-vec[x].begin(); if(j==vec[x].size() || vec[x][j]>i)dfs(i,y); } /*for(set<int>::iterator it=s.begin();;) { v=(*it),ok=((++it)==s.end()),i=lower_bound(vec[x].begin(),vec[x].end(),v)-vec[x].begin(); if(i==vec[x].size() || vec[x][i]>v)dfs(v,y);if(ok)return ; }*/ } inline void getroot(int x) { if(x==rt[x])return ; getroot(rt[x]),rt[x]=rt[rt[x]]; } int main() { read(n),read(m),t=(1LL*n*(n-1))/2-m; //if(n==200000 && m==200000)tyl_jyy=1; for(int i=1,x,y,z;i<=m;++i)read(x),read(y),read(z),sum^=z,add_edge(x,y,z,i); for(int i=1;i<=n;++i)s.insert(i),sort(vec[i].begin(),vec[i].end()); //if(tyl_jyy)return 0&puts( ok ); for(int i=1;i<=n;++i)if(!rt[i])++rt_t,dfs(i,i); sort(e+1,e+m+1,cmp); for(int i=1,x,y;i<=m;++i) { x=e[i].x,y=e[i].y,getroot(x),getroot(y); if(rt[x]==rt[y])continue; rt[rt[x]]=rt[y],ans+=e[i].val,e[i].u=1; } if(n-rt_t==t) { for(int i=1;i<=n;++i)rt[i]=i; for(int i=1,x,y;i<=m;++i)if(e[i].u)x=e[i].x,y=e[i].y,getroot(x),getroot(y),rt[rt[x]]=rt[y]; for(int i=1,x,y;i<=m;++i) if(!e[i].u) { x=e[i].x,y=e[i].y,getroot(x),getroot(y); if(rt[x]==rt[y])continue; sum=min(sum,e[i].val);break; } } else sum=0; printf( %lld ,ans+sum); return 0; }
#include <bits/stdc++.h> using namespace std; long int a[5001], b[5001]; long long ans[5001]; int main(void) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] -= i; b[i] = a[i]; } sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { ans[j] += abs(a[i] - b[j]); if (j > 1) ans[j] = min(ans[j], ans[j - 1]); } cout << ans[n]; }
#include <bits/stdc++.h> int main() { long n, a, b; scanf( %ld %ld %ld , &n, &a, &b); std::vector<long> v(n, 1); long current(1), sum(1); for (long p = 1; p < n; p++) { if (b > 0) { current = sum + 1; --b; } else if ((p > 1) && (a > 0)) { ++current, --a; } v[p] = current; sum += current; } if ((a > 0) || (b > 0)) { puts( -1 ); } else { for (long p = 0; p < n; p++) { printf( %ld , v[p]); }; puts( ); } return 0; }
#include <bits/stdc++.h> using namespace std; bool debug = false; int n, m, k; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; long long ln, lk, lm; long long dp[35][1005], tmp[1005]; int cnt = 0; void init() { dp[0][0] = 1; tmp[0] = 1; for (int i = 1; i <= 30; i++) { dp[i][0] = 1; for (int j = 1; j <= 1000; j++) { for (int k = 0; k < j; k++) { dp[i][j] += (tmp[k] * tmp[j - k - 1]) % 7340033; dp[i][j] %= 7340033; } } for (int j = 1; j <= 1000; j++) tmp[j] = 0; tmp[0] = 1; for (int j = 1; j <= 1000; j++) { for (int k = 0; k <= j; k++) { tmp[j] += (dp[i][k] * dp[i][j - k]) % 7340033; tmp[j] %= 7340033; } } } } int main() { init(); int q; scanf( %d , &q); while (q--) { scanf( %d%d , &n, &k); if (k == 0) puts( 1 ); else { int id = 0; while ((n & 1) && n > 1) { n >>= 1; id++; } printf( %lld n , dp[id][k]); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; if (a[0] + a[1] <= a[n - 1]) { cout << 1 2 << n << endl; } else cout << -1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100; void ask(int r1, int c1, int r2, int c2) { cout << ? << r1 << << c1 << << r2 << << c2 << n ; cout.flush(); } bool ans() { string ans; cin >> ans; return ans == YES ; } int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int steps = 0; int rx = 1, ry = 1; string pre = ; while (steps < n - 1) { ask(rx + 1, ry, n, n); bool sol = ans(); if (sol) { pre += D ; rx++; } else { pre += R ; ry++; } steps++; } string suf = ; steps = 0; rx = n, ry = n; while (steps < n - 1) { ask(1, 1, rx, ry - 1); bool sol = ans(); if (sol) { suf += R ; ry--; } else { suf += D ; rx--; } steps++; } reverse(suf.begin(), suf.end()); cout << ! << (pre + suf) << n ; cout.flush(); }
#include <bits/stdc++.h> using namespace std; template <class A> void read(vector<A>& v); template <class A, size_t S> void read(array<A, S>& a); template <class T> void read(T& x) { cin >> x; } void read(double& d) { string t; read(t); d = stod(t); } void read(long double& d) { string t; read(t); d = stold(t); } template <class H, class... T> void read(H& h, T&... t) { read(h); read(t...); } template <class A> void read(vector<A>& x) { for (auto& a : x) read(a); } template <class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); } const int mod = 1e9 + 7; long long int primeLimit = 1e5; const double PI = acos(-1); bool prime[100000]; string LongestPalindromicPrefix(string str) { string temp = str + ? ; reverse(str.begin(), str.end()); temp += str; long long int n = temp.length(); long long int lps[n]; fill(lps, lps + n, 0); for (long long int i = 1; i < n; i++) { long long int len = lps[i - 1]; while (len > 0 && temp[len] != temp[i]) { len = lps[len - 1]; } if (temp[i] == temp[len]) { len++; } lps[i] = len; } return temp.substr(0, lps[n - 1]); } bool binarySearchFloat(float lower, float higher, float maxErrorAllowed, long long int numberOfTimesWanttoRunCode) { float l = lower, r = higher; float eps = maxErrorAllowed; long long int iteration_count = numberOfTimesWanttoRunCode; for (long long int i = 0; i < iteration_count && l + eps < r; ++i) { } } void primefinder() { memset(prime, true, sizeof(prime)); prime[1] = false; prime[0] = false; for (long long int i = 2; i < primeLimit; i++) { if (prime[i]) { for (long long int j = i * i; j < primeLimit; j += i) { prime[j] = false; } } } } long long fast_pow(long long int x, long long int y) { long long res = 1; while (y > 0) { if (y & 1) res = res * x; y = y >> 1; x = x * x; } return res; } long long Fast_pow(long long int x, long long int y, long long int p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int bs(vector<long long int> arr, long long int low, long long int cur) { long long int high = (long long int)arr.size() - 1; long long int index = -1; while (low <= high) { long long int mid = (low + high) / 2; if (arr[mid] <= cur) { index = mid; low = mid + 1; } else { high = mid - 1; } } return index; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, k; cin >> n >> k; vector<long long int> arr(n); read(arr); sort((arr).begin(), (arr).end()); long long int ans = 0; for (long long int i = 0; i < n; i++) { long long int index = bs(arr, i, 2 * k); if (index >= (n - 1)) break; if (index == -1) { while ((k * 2) < arr[i]) { k *= 2; ans++; } k = std::max(k, arr[i]); } else { k = std::max(k, arr[index]); } } cout << ans; }
#include <bits/stdc++.h> using namespace std; int a, b, c, d, e, n, m, t, kk, tt = 0, l[5007], r[5007], fa[5007], type[5007], ind[5007]; int y[5007] = {0}, qw[5007], tree[1000007], a1[5007], a2[5007], a3[5007], a4[5007]; vector<int> q[5007]; vector<short> w[5007]; void get(int x1, int l, int r, int tl, int tr, int k) { if (tree[k] == tt) return; if (l >= tl && r <= tr) { tree[k] = tt; for (int i = l; i <= r; i++) w[x1].push_back(i); return; } int m = (l + r) / 2; if (tl <= m) get(x1, l, m, tl, tr, k << 1); if (tr > m) get(x1, m + 1, r, tl, tr, (k << 1) + 1); } int sou(int x1) { t = 0; if (type[x1] == 0) for (int j = 1; j <= q[x1].size(); j++) w[x1].push_back(q[x1][j - 1]); else get(x1, 1, m, q[x1][0], q[x1][1], 1); for (int j = 1; j <= w[x1].size(); j++) if (!qw[fa[w[x1][j - 1]]]) { qw[fa[w[x1][j - 1]]] = 1; if (y[fa[w[x1][j - 1]]] == 0 || sou(y[fa[w[x1][j - 1]]])) { y[fa[w[x1][j - 1]]] = x1; w[x1].clear(); return 1; } } w[x1].clear(); return 0; } int main() { scanf( %d%d , &n, &m); kk = 1; for (int i = 1; i <= m; i++) fa[i] = i; int ans = 0, t3 = 0; for (int i = 1; i <= n; i++) { scanf( %d , &type[kk]); if (type[kk] == 0) { scanf( %d , &b); for (int j = 1; j <= b; j++) { scanf( %d , &c); q[kk].push_back(c); } ind[kk] = i; kk++; } else if (type[kk] == 1) { scanf( %d%d , &b, &c); ind[kk] = i; q[kk].push_back(b); q[kk++].push_back(c); } else { scanf( %d%d%d , &b, &c, &d); fa[c] = b; fa[d] = b; ans += 2; a1[++t3] = b, a2[t3] = c, a3[t3] = d, a4[t3] = i; } } for (int i = 1; i <= kk - 1; i++) { tt++; for (int j = 1; j <= m; j++) qw[j] = 0; if (sou(i)) ans++; } printf( %d n , ans); for (int i = 1; i <= t3; i++) { fa[a1[i]] = 0; fa[a2[i]] = 0; fa[a3[i]] = 0; int g = 0; if (y[a1[i]] == 0) { printf( %d %d n , a4[i], a1[i]); printf( %d %d n , a4[i], a2[i]); continue; } else if (type[y[a1[i]]] == 0) for (int j = 1; j <= q[y[a1[i]]].size(); j++) { if (q[y[a1[i]]][j - 1] == a1[i]) g = 1; if (q[y[a1[i]]][j - 1] == a2[i]) g = 2; if (q[y[a1[i]]][j - 1] == a3[i]) g = 3; } else for (int j = q[y[a1[i]]][0]; j <= q[y[a1[i]]][1]; j++) { if (j == a1[i]) g = 1; if (j == a2[i]) g = 2; if (j == a3[i]) g = 3; } if (g == 1) printf( %d %d n , ind[y[a1[i]]], a1[i]); else printf( %d %d n , a4[i], a1[i]); if (g == 2) printf( %d %d n , ind[y[a1[i]]], a2[i]); else printf( %d %d n , a4[i], a2[i]); if (g == 3) printf( %d %d n , ind[y[a1[i]]], a3[i]); else printf( %d %d n , a4[i], a3[i]); } for (int i = 1; i <= m; i++) if (y[i] && fa[i] == i) printf( %d %d n , ind[y[i]], i); return 0; }
#include <bits/stdc++.h> using namespace std; char x[15]; int main() { scanf( %s , x); int lenx = strlen(x); for (int i = lenx - 1; i >= 0; i--) { int dig = x[i] - 0 ; if (dig == 0) printf( O-|-OOOO n ); else if (dig == 1) printf( O-|O-OOO n ); else if (dig == 2) printf( O-|OO-OO n ); else if (dig == 3) printf( O-|OOO-O n ); else if (dig == 4) printf( O-|OOOO- n ); else if (dig == 5) printf( -O|-OOOO n ); else if (dig == 6) printf( -O|O-OOO n ); else if (dig == 7) printf( -O|OO-OO n ); else if (dig == 8) printf( -O|OOO-O n ); else printf( -O|OOOO- n ); } }
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n == 1 || n == 2) { cout << -1 ; return 0; } else if (n % 2 == 1) { long long k = (n - 1) / 2; cout << 2 * k * k + 2 * k << << 2 * k * k + 2 * k + 1; } else { long long k = n / 2; cout << k * k - 1 << << k * k + 1; } return 0; }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6, pi = acos(-1); const int N = 1e2 + 5, M = 1e9 + 7, SEGM = 4 * N, OO = 0x3f3f3f3f; int t, n, m, v1, v2; int mem[105][2005]; int main() { scanf( %d%d%d%d , &v1, &v2, &n, &m); if (v1 > v2) swap(v1, v2); memset(mem, -OO, sizeof mem); mem[0][v1] = v1; for (int i = 1; i < n; ++i) { for (int cur = v1; cur < 2005; ++cur) { for (int j = 0; j <= m; ++j) { if (cur + j < 2005) mem[i][cur + j] = max(mem[i][cur + j], cur + j + mem[i - 1][cur]); if (cur - j > -1) mem[i][cur - j] = max(mem[i][cur - j], cur - j + mem[i - 1][cur]); } } } cout << mem[n - 1][v2]; return 0; }
#include <bits/stdc++.h> using namespace std; const long long oo = 2e9, MOD = 998244353; int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}; int dy[] = {0, -1, 0, 1, 1, -1, 1, -1}; int main() { int n, k; string s; cin >> n >> k >> s; for (int i = 0; i < (int)s.size() - 1 && k; i++) { if (s[i] == 4 and s[i + 1] == 7 ) { if (((i + 1) & 1) and i + 2 < (int)s.size() and s[i + 2] == 7 ) { k %= 2; if (k) { s[i] = 4 , s[i + 1] = 4 ; } break; } if (!((i + 1) & 1) and i - 1 >= 0 and s[i - 1] == 4 ) { k %= 2; if (k) { s[i] = 7 , s[i + 1] = 7 ; } break; } if ((i + 1) & 1) { s[i] = 4 , s[i + 1] = 4 ; } else { s[i] = 7 , s[i + 1] = 7 ; } k--; } } cout << s; return 0; }
#include <bits/stdc++.h> using namespace std; void flanther_fakadi() { string s; cin >> s; long long n = s.length(); long long ct = 0; for (long long i = 0; i < s.length(); i++) { if (ct && s[i] == B ) { n -= 2; ct--; } else { ct++; } } cout << n << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(NULL); int t = 0; cin >> t; while (t--) { flanther_fakadi(); } return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; string s; cin >> s; vector<pair<long long int, long long int>> ans; string des = ; for (long long int i = 1; i < k; i++) { des += () ; } long long int maxx = (n / 2); for (long long int i = 0; i < (maxx - k + 1); i++) { des += ( ; } for (long long int i = 0; i < (maxx - k + 1); i++) { des += ) ; } for (long long int i = 0; i < n; i++) { if (s[i] != des[i]) { long long int j = i + 1; while (s[j] != des[i]) j++; string temp = s.substr(i, (j - i + 1)); reverse(temp.begin(), temp.end()); for (long long int k = i; k <= j; k++) { s[k] = temp[k - i]; } ans.push_back({i + 1, j + 1}); } } cout << ans.size() << n ; for (long long int i = 0; i < ans.size(); i++) { cout << ans[i].first << << ans[i].second << n ; } } signed main() { long long int t; cin >> t; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int maxv = 1.5e7; const int bit = 29; int cnt[maxv] = {}; int go[maxv][2] = {}; int tot = 1; void add(int v, int d, int val) { cnt[v]++; if (d == -1) return; if (!go[v][(val >> d) & 1]) go[v][(val >> d) & 1] = ++tot; add(go[v][(val >> d) & 1], d - 1, val); } void get(int v, int d, int val, int& t_a) { assert(cnt[v]); cnt[v]--; if (d == -1) return; for (int k = ((val >> d) & 1), l = 0; l < 2; k = 1 - k, ++l) if (go[v][k]) { get(go[v][k], d - 1, val, t_a); if (!cnt[go[v][k]]) go[v][k] = 0; t_a += (k << d); return; } } int main() { int n; cin >> n; vector<int> msg(n); for (int& i : msg) cin >> i; for (int i = 0; i < n; i++) { int x; cin >> x; add(1, bit, x); } for (int i : msg) { int out = 0; get(1, bit, i, out); assert((i ^ out) >= 0); cout << (i ^ out) << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int head[N], nxt[N << 1], ver[N << 1], tot; int n, d[N], out[N], f[N], ji[N], ou[N]; vector<int> v[N]; bool flag; void add(int x, int y) { ver[++tot] = y; nxt[tot] = head[x], head[x] = tot; out[x]++; } void dfs(int x, int fa) { d[x] = d[fa] + 1; f[x] = fa; for (int i = head[x]; i; i = nxt[i]) { int y = ver[i]; if (y == fa) continue; dfs(y, x); } } void dfs2(int x, int fa) { for (int i = head[x]; i; i = nxt[i]) { int y = ver[i]; if (y == fa) continue; dfs2(y, x); if (ou[y]) ji[x] = 1; if (ji[y]) ou[x] = 1; } if (ou[x] && ji[x]) flag = true; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y), add(y, x); } int root = 0, minn = 0, maxx = n - 1; for (int i = 1; i <= n; i++) if (out[i] >= 2) { root = i; break; } for (int i = 1; i <= n; i++) if (out[i] == 1) ou[i] = 1; dfs2(root, 0); minn = (flag ? 3 : 1); dfs(root, 0); for (int i = 1; i <= n; i++) v[f[i]].push_back(i); for (int i = 1; i <= n; i++) { int siz = v[i].size(), cnt = 0; if (!siz) continue; for (int j = 0; j < siz; j++) { int tt = v[i][j]; if (out[tt] == 1) cnt++; } if (cnt) maxx -= cnt - 1; } printf( %d %d n , minn, maxx); return 0; }
#include <bits/stdc++.h> using namespace std; int cnt[3], ans; vector<int> c; vector<vector<int>> sum; vector<vector<int>> arr; void dfs(int x, int p) { for (auto i : arr[x]) { if (i != p) { dfs(i, x); sum[x][0] += sum[i][0]; sum[x][1] += sum[i][1]; sum[x][2] += sum[i][2]; } } sum[x][c[x]]++; if (sum[x][1] == 0 && sum[x][2] == cnt[2] || sum[x][1] == cnt[1] && sum[x][2] == 0) ans++; } int main() { cin.tie(0), ios::sync_with_stdio(0); int n; cin >> n; c.resize(n); arr.resize(n); for (int i = 0; i < n; i++) cin >> c[i], cnt[c[i]]++; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; arr[a - 1].push_back(b - 1); arr[b - 1].push_back(a - 1); } sum.resize(n, vector<int>(3, 0)); dfs(0, 0); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, i, j, k, res[200500], st1[200500][20], st2[200500][20]; int l2(int n) { int r = 0; while (n - 1) { r++; n >>= 1; } return r; } int chk1(int l, int r) { int k = l2(r - l + 1); return max(st1[l][k], st1[r - (1 << k) + 1][k]); } int chk2(int l, int r) { int k = l2(r - l + 1); return min(st2[l][k], st2[r - (1 << k) + 1][k]); } struct sb { int id, l, r; bool operator<(const sb x) const { return r > x.r; } } tmp, s[200500]; vector<sb> v[200500]; priority_queue<sb> q; void ans() { for (int i = 1; i <= n; i++) { printf( %d , res[i]); } puts( ); } int main() { memset(st2, 0x3f, sizeof(st2)); scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d%d , &j, &k); s[i].id = i; s[i].l = j; s[i].r = k; v[j].push_back(s[i]); } for (i = 1; i <= n; i++) { for (auto j : v[i]) { q.push(j); } s[i] = q.top(); q.pop(); res[s[i].id] = i; st1[i][0] = s[i].r; st2[i][0] = s[i].l; } for (j = 1; j <= 18; j++) { for (i = 1; i + (1 << j) - 1 <= n; i++) { st1[i][j] = max(st1[i][j - 1], st1[i + (1 << (j - 1))][j - 1]); st2[i][j] = min(st2[i][j - 1], st2[i + (1 << (j - 1))][j - 1]); } } for (i = 1; i <= n; i++) { if (s[i].l < i && chk1(s[i].l, i - 1) >= i) { puts( NO ); ans(); for (j = i - 1;; j--) { if (s[j].r >= i) { swap(res[s[i].id], res[s[j].id]); break; } } ans(); return 0; } if (s[i].r > i && chk2(i + 1, s[i].r) <= i) { puts( NO ); ans(); for (j = i + 1;; j++) { if (s[j].l <= i) { swap(res[s[i].id], res[s[j].id]); break; } } ans(); return 0; } } puts( YES ); ans(); }
#include <bits/stdc++.h> using namespace std; const int M = 1e3 + 5; long long int dp[M][12][M], inv[M], n, d, mod; long long int pw(long long int a, long long int b) { if (b == 0) return 1ll; long long int p = pw(a, b / 2ll); if (b % 2ll) return p * p % mod * a % mod; else return p * p % mod; } int main() { cin >> n >> d >> mod; for (long long int i = 1; i <= n; i++) inv[i] = pw(i, mod - 2ll); dp[1][0][0] = 1; for (int i = 2; i <= n; i++) for (int j = 1; j <= d; j++) for (int k = (i - 1) / j; k <= i - 1; k++) { dp[i][j][k] = dp[i][j][k - 1]; long long int cur = 1, buf = dp[k][d - 1][k - 1]; for (int t = 1; t <= j && t * k <= i - 1; t++) { cur = cur * buf++ % mod * inv[t] % mod; (dp[i][j][k] += dp[i - t * k][j - t][min(k - 1, i - t * k - 1)] * (cur + (k == 1))) %= mod; } } long long int ans = dp[n][d][(n - 1) / 2]; if (n % 2 == 0) (ans += dp[n / 2][d - 1][n / 2 - 1] * (dp[n / 2][d - 1][n / 2 - 1] + 1) % mod * inv[2]) %= mod; cout << (n <= 2 ? 1 : ans) << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n, m; cin >> n >> m; vector<vector<long long>> dist((size_t)n, vector<long long>((size_t)n, (long long)1e16)); for (long long i = 0; i < n; i++) { dist[i][i] = (long long)0; } for (long long i = 0; i < m; i++) { long long u, v; cin >> u >> v; u--, v--; dist[u][v] = dist[v][u] = 0; } for (long long k = 0; k < n; k++) { for (long long i = 0; i < n; i++) { for (long long j = 0; j < n; j++) { dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } } } long long s, b, k, h; cin >> s >> b >> k >> h; vector<pair<long long, pair<long long, long long>>> x((size_t)s); for (long long i = 0; i < s; i++) { cin >> x[i].first >> x[i].second.first >> x[i].second.second; x[i].first--; } vector<pair<long long, long long>> y((size_t)b); for (long long i = 0; i < b; i++) { cin >> y[i].first >> y[i].second; y[i].first--; } vector<vector<long long>> adj((size_t)s); for (long long i = 0; i < s; i++) { for (long long j = 0; j < b; j++) { if (x[i].second.first >= y[j].second && x[i].second.second >= dist[x[i].first][y[j].first]) { adj[i].push_back(j); } } } vector<bool> visited; vector<long long> matching((size_t)b, -1); function<bool(long long)> visit = [&](long long i) { if (visited[i]) { return false; } visited[i] = true; for (long long j : adj[i]) { if (matching[j] == -1 || visit(matching[j])) { matching[j] = i; return true; } } return false; }; long long f = 0; for (long long i = 0; i < s; i++) { visited.assign((size_t)s, false); if (visit(i)) { f++; } } cout << min(f * k, h * s) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int x, y; cin >> x >> y; string s; cin >> s; bool flag = false; int cnt = 0; for (int i = 0; i < n; ++i) { if (s[i] == 0 ) { flag = true; } else if (flag) { ++cnt; flag = false; } } if (flag) ++cnt; long long ans = 1LL * (cnt - 1) * min(x, y) + y; if (cnt == 0) ans = 0; cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string cad; int cnt = 0, ans = 0; cin >> cnt >> cad; cnt = 0; for (int i = 0; i < cad.size(); i++) { if (cad[i] == x ) { cnt++; } else { ans += max(0, cnt - 2); cnt = 0; } } ans += max(0, cnt - 2); cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { long long int x, y, a, b, c; cin >> x >> y >> a >> b >> c; long long int t = a * 2; long long int r = c * 3; cout << max(t + b - x, 0ll) + max(r + b - y, 0ll); return 0; }
#include <bits/stdc++.h> const int kInf = 0x3f3f3f3f; int len, n; int msk[200010]; int mem[21][1 << 20]; int f[200010], s[200010]; int conv(char *s) { int res = 0; for (int i = 0; i < len; i++) res = (res << 1) + (s[i] - 0 ); return res; } int g(int i, int j) { int p = msk[i], q = msk[j]; for (int i = len; i >= 0; i--) if ((p & ((1 << i) - 1)) == (q >> (len - i))) return i; assert(0); } inline void upd(int &x, int y) { if (y < x) x = y; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { static char ts[22]; scanf( %s , ts); len = strlen(ts); msk[i] = conv(ts); } for (int i = 2; i <= n; i++) s[i] = s[i - 1] + g(i - 1, i); memset(mem, 0x3f, sizeof(mem)); mem[0][0] = 0; for (int i = 1; i <= n; i++) { f[i] = kInf; if (i < n) { for (int l = 0; l <= len; l++) { int tmp = mem[l][msk[i + 1] >> (len - l)]; if (tmp != kInf) upd(f[i], tmp + i * len - s[i] - l); } for (int l = 0; l <= len; l++) upd(mem[l][msk[i] & ((1 << l) - 1)], f[i] + s[i + 1] - i * len); } else { f[i] = mem[0][0] + i * len - s[i]; } } printf( %d n , f[n]); }
#include <bits/stdc++.h> using namespace std; long long int n; long long int a[100001]; vector<pair<long long int, long long int> > g[100001]; long long int dis[100001]; long long int rem[100001]; long long int dp[100001]; long long int child[100001]; long long int ct = 1; void simpledfs(long long int x) { rem[x] = 1; for (long long int i = 0; i < g[x].size(); i++) { simpledfs(g[x][i].first); } } void dfs1(long long int x, long long int distance) { dis[x] = distance; long long int temp = 0; long long int mi = 1e9; long long int pos = -1; for (long long int i = 0; i < g[x].size(); i++) { dfs1(g[x][i].first, distance + g[x][i].second); temp = temp + child[g[x][i].first] + 1; if (dis[g[x][i].first] < mi) { mi = dis[g[x][i].first]; pos = g[x][i].first; } } dp[x] = pos; child[x] = temp; } void dfs2(long long int x, long long int minv) { for (long long int i = 0; i < g[x].size(); i++) { long long int cur = g[x][i].first; if ((dis[cur] - minv) > a[cur]) continue; else { ct++; dfs2(cur, min(minv, dis[cur])); } } } int main() { cin >> n; for (long long int i = 1; i <= n; i++) cin >> a[i]; for (long long int i = 2; i <= n; i++) { long long int p, c; cin >> p >> c; g[p].push_back(make_pair(i, c)); } dfs1(1, 0); dfs2(1, 0); cout << n - ct; }
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5, mod = 1e9 + 9, bit = 61, sq = 1000; const int T = (100001 + sq - 1) / sq; vector<int> lucky; bool isl[N] = {0}; int bid[100005], a[100005], beg[T], en[T], lazy[T] = {0}; int fq[T][N]; void create() { for (int d = 1; d <= 4; d++) { for (int mask = 0; mask < (1ll << d); mask++) { int curr = 0; for (int j = 0; j <= d - 1; j++) { curr = (curr * 10); if (mask & (1ll << j)) { curr += 4; } else { curr += 7; } } isl[curr] = 1; lucky.push_back(curr); } } } signed main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t = 1; memset(fq, 0, sizeof(fq)); create(); while (t--) { int n, q; cin >> n >> q; int j = -1; for (int i = 1; i <= n; i++) { cin >> a[i]; if (i % sq == 1) { bid[i] = ++j; beg[j] = i; en[j] = min(i + sq - 1, n); } else { bid[i] = j; } fq[j][a[i]]++; } while (q--) { string tp; int l, r; cin >> tp >> l >> r; if (tp[0] == c ) { int ans = 0; if (bid[l] == bid[r]) { for (int i = l; i <= r; i++) { ans += isl[a[i] + lazy[bid[l]]]; } } else { for (int i = l; i <= en[bid[l]]; i++) { ans += isl[a[i] + lazy[bid[l]]]; } for (int i = bid[l] + 1; i <= bid[r] - 1; i++) { for (auto x : lucky) { if (x >= lazy[i]) { ans += fq[i][x - lazy[i]]; } } } for (int i = beg[bid[r]]; i <= r; i++) { ans += isl[a[i] + lazy[bid[r]]]; } } cout << ans << n ; } else { int d; cin >> d; if (bid[l] == bid[r]) { for (int i = l; i <= r; i++) { fq[bid[i]][a[i]]--; fq[bid[i]][a[i] + d]++; a[i] += d; } } else { for (int i = l; i <= en[bid[l]]; i++) { fq[bid[i]][a[i]]--; fq[bid[i]][a[i] + d]++; a[i] += d; } for (int i = bid[l] + 1; i <= bid[r] - 1; i++) { lazy[i] += d; } for (int i = beg[bid[r]]; i <= r; i++) { fq[bid[i]][a[i]]--; fq[bid[i]][a[i] + d]++; a[i] += d; } } } } } return 0; }
#include <bits/stdc++.h> using namespace std; long long int inf = 1e9 + 7; int main() { long long int n; cin >> n; vector<pair<long long int, long long int> > arr(n + 1); for (long long int i = 1; i < n + 1; i++) { long long int a, b; cin >> a >> b; arr[i].first = a; arr[i].second = b; } vector<long long int> ans(n + 1); ans[1] = 1; long long int x, y; x = arr[1].first; y = arr[1].second; if (arr[x].first == y or arr[x].second == y) { ans[2] = x; ans[3] = y; long long int i = 3; while (i != n) { i++; long long int a = arr[ans[i - 2]].first; long long int b = arr[ans[i - 2]].second; ans[i] = (a == ans[i - 1] ? b : a); } for (int i = 1; i < ans.size(); i++) { cout << ans[i] << ; } return 0; } else { ans[2] = y; ans[3] = x; long long int i = 3; while (i != n) { i++; long long int a = arr[ans[i - 2]].first; long long int b = arr[ans[i - 2]].second; ans[i] = (a == ans[i - 1] ? b : a); } for (int i = 1; i < ans.size(); i++) { cout << ans[i] << ; } return 0; } return 0; }
#include <bits/stdc++.h> using namespace std; long long a[100020], b[100020]; int main() { int m, n; scanf( %d%d , &m, &n); long long sum1 = 0, sum2 = 0, s1 = 0, s2 = 0, Max1 = 0, Max2 = 0; for (int i = 1; i <= m; i++) { scanf( %I64d , &a[i]); sum1 += a[i]; if (a[i] > Max1) { Max1 = a[i]; s1 = i; } } for (int i = 1; i <= n; i++) { scanf( %I64d , &b[i]); sum2 += b[i]; if (b[i] > Max2) { Max2 = b[i]; s2 = i; } } long long ans1 = sum1 * n, ans2 = sum2 * m; for (int i = 1; i <= m; i++) { if (i != s1 && a[i] < sum2) ans2 = ans2 - sum2 + a[i]; } for (int i = 1; i <= n; i++) { if (i != s2 && b[i] < sum1) ans1 = ans1 - sum1 + b[i]; } if (ans1 > ans2) printf( %I64d n , ans2); else printf( %I64d n , ans1); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2005; char mpt[2005][2005]; int dp[maxn][maxn]; int col[maxn]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %s , mpt[i] + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (mpt[i][j] == L ) { int w = i - 1; if (j - w >= 1) dp[i][j - w] += 1; } else if (mpt[i][j] == R ) { int w = i - 1; if (j + w <= m) dp[i][j + w] += 1; } else if (mpt[i][j] == U && i % 2 == 1) { col[j] += 1; } else if (mpt[i][j] == D ) { continue; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { col[j] += dp[i][j]; } } for (int i = 1; i <= m; i++) printf( %d , col[i]); printf( n ); return 0; }