func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); long long n, cnt1 = 0, cnt2 = 0, l, r; cin >> n; for (int i = 0; i < n; i++) { cin >> l >> r; cnt1 += l; cnt2 += r; } cout << min(cnt1, n - cnt1) + min(cnt2, n - cnt2); } |
#include <bits/stdc++.h> using namespace std; long long int Mmax(long long int a, long long int b) { if (a > b) return a; return b; } long long int Mmin(long long int a, long long int b) { if (a < b) return a; return b; } long long int nod(long long int a, long long int b) { while (a && b) { if (a > b) a %= b; else b %= a; } return Mmax(a, b); } long long int nok(long long int a, long long int b) { return a * b / nod(a, b); } bool IsPrime(long long int x) { if (x < 2) return false; long long int X = sqrt(x), i; for (i = 2; i <= X; i++) if (x % i == 0) return false; return true; } void hanoi(int n, int A, int C, int B) { if (n == 1) { cout << n << << A << << C << endl; } else { hanoi(n - 1, A, B, C); cout << n << << A << << C << endl; hanoi(n - 1, B, C, A); } } string pr2(string a, int d) { if (d == 0) return 0 ; string b; long long int sz = a.size(), i, prenos = 0; for (i = 0; i < sz; i++) { b[i] = a[i]; } for (i = sz - 1; i > -1; i--) { a[i] = ((b[i] - 0 ) * d + prenos) % 10 + 0 ; prenos = ((b[i] - 0 ) * d + prenos) / 10; } if (prenos) a = char(prenos + 0 ) + a; return a; } string sum(string a, string b) { bool carry = false; long long int i, sz1, sz2, maxsz, minsz; string c, d; sz1 = a.size(); sz2 = b.size(); maxsz = max(sz1, sz2); minsz = min(sz1, sz2); while (sz1 < maxsz) { sz1++; a = 0 + a; } while (sz2 < maxsz) { sz2++; b = 0 + b; } for (i = maxsz - 1; i > -1; i--) { d = char((a[i] + b[i] - 96 + carry) % 10 + 48) + d; if (a[i] + b[i] - 96 + carry > 9) carry = true; else carry = false; } if (carry == true) d = char( 1 ) + d; return d; } string pr(string a, string b) { string res = 0 , p, p2; int sz = a.size(), x = 0; for (sz = a.size(); sz > 0; sz--, x++) { int d = a[sz - 1] - 0 ; a = a.erase(sz - 1, 1); p2 = pr2(b, d); p2 += p; res = sum(res, p2); p += 0 ; } return res; } bool vesokosna(long long int x) { return (x % 4 == 0 && x % 100 || x % 400 == 0); } long long int reverse(long long int x) { long long int mirror = 0; while (x) { mirror = mirror * 10 + x % 10; x /= 10; } return mirror; } long long int ost(string x, long long int k) { long long int num = 0, i, sz = x.size(); for (i = 0; i < sz; i++) { num = num * 10; num += x[i] - 0 ; num %= k; } return num; } bool can[128][128]; vector<string> ans; int main() { char last; int k, i, j, sz2 = 1; cin >> k; string q; cin >> q; int sz = q.size(); if (sz < k) { cout << NO n ; return 0; } string help; help += q[0]; ans.push_back(help); last = q[0]; for (i = 1; i < sz; i++) { if (sz2 == k) break; bool can = true; ; for (j = 0; j < sz2; j++) if (q[i] == ans[j][0]) can = false; if (can) { string help; help += q[i]; last = q[i]; ans.push_back(help); sz2++; } else ans.back() += q[i]; } if (sz2 == k) { cout << YES n ; for (; i < sz; i++) { ans.back() += q[i]; } for (i = 0; i < sz2; i++) cout << ans[i] << endl; return 0; } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <ostream& out = cout, class... T> void prints(T&&...) {} template <ostream& out = cout, class... T> void printe(T&&...) {} template <ostream& out = cout, class... T> void printw(T&&...) {} template <ostream& out = cout, class... T> void printew(T&&...) {} template <ostream& out = cout, class... T> void printb(T&&...) {} template <ostream& out = cout, class... T> void printd(T&&...) {} template <ostream& out = cout, class... T> void printde(T&&...){}; template <class T> istream& operator>>(istream& in, vector<T>& v) { for (auto& e : v) { in >> e; } return in; } int main() { int n; cin >> n; vector<char> s(n); cin >> s; int k = 0; bool pr; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { k++; pr = true; } else { break; } } if (k == n) { cout << YES ; return 0; } int l = 0; for (int i = 0; i < n; i++) { if (s[i] == 0 ) { l++; pr = false; } else { break; } } if (l == n) { cout << YES ; return 0; } int m; m = max(l, k); for (int i = 0; i < n; i = i + m) { if (s[i] == 1 && pr) { for (int j = 0; j < m; j++) { if (s[j + i] != 1 ) { cout << NO ; return 0; } } pr = false; continue; } if (s[i] == 0 && !pr) { for (int j = 0; j < m; j++) { if (s[j + i] != 0 ) { cout << NO ; return 0; } } pr = true; continue; } cout << NO ; return 0; } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; const int nax = 505; int n; char grid[nax][nax]; int cc[nax][nax]; int cc_size[nax * nax]; int when_added[nax * nax]; const int dx[4] = {-1, 1, 0, 0}; const int dy[4] = {0, 0, -1, 1}; const char EMPTY = . ; bool inside(int x, int y) { return 0 <= min(x, y) && max(x, y) < n; } void dfs(int x, int y, int which_cc) { cc[x][y] = which_cc; ++cc_size[which_cc]; for (int i = 0; i < 4; ++i) { int x2 = x + dx[i]; int y2 = y + dy[i]; if (inside(x2, y2) && grid[x2][y2] == EMPTY && cc[x2][y2] == 0) dfs(x2, y2, which_cc); } } void add(int x, int y, int& answer, int current_time) { if (inside(x, y) && grid[x][y] == EMPTY) { int id = cc[x][y]; if (when_added[id] != current_time) { when_added[id] = current_time; answer += cc_size[id]; } } } int main() { int k; scanf( %d%d , &n, &k); for (int i = 0; i < n; ++i) scanf( %s , grid[i]); int how_many_cc = 0; for (int x = 0; x < n; ++x) for (int y = 0; y < n; ++y) if (grid[x][y] == EMPTY && cc[x][y] == 0) dfs(x, y, ++how_many_cc); int cur_time = 1; int best_answer = 0; for (int y_low = 0; y_low + k <= n; ++y_low) { for (int x = 0; x < k; ++x) for (int y = y_low; y < y_low + k; ++y) --cc_size[cc[x][y]]; for (int x_low = 0; x_low + k <= n; ++x_low) { int answer = k * k; for (int x = x_low; x < x_low + k; ++x) { add(x, y_low - 1, answer, cur_time); add(x, y_low + k, answer, cur_time); } for (int y = y_low; y < y_low + k; ++y) { add(x_low - 1, y, answer, cur_time); add(x_low + k, y, answer, cur_time); } ++cur_time; best_answer = max(best_answer, answer); if (x_low + k != n) { for (int y = y_low; y < y_low + k; ++y) { ++cc_size[cc[x_low][y]]; --cc_size[cc[x_low + k][y]]; } } } for (int x = n - k; x < n; ++x) for (int y = y_low; y < y_low + k; ++y) ++cc_size[cc[x][y]]; } printf( %d , best_answer); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1000000000; const int maxn = 100010; int a[maxn]; int max(int a, int b) { return a > b ? a : b; } int min(int a, int b) { return a > b ? b : a; } int main() { int n, l, r, i, j; string s; while (cin >> n) { for (i = 0; i < n; i++) cin >> a[i]; cin >> s; l = -inf, r = inf; for (i = 4; i < n; i++) { if (s[i] == 1 ) { int maxi = -inf; for (j = i; j >= i - 4; j--) { maxi = max(maxi, a[j]); } int cnt = 0; for (j = i; j >= i - 4; j--) { if (s[j] == 0 ) cnt++; } if (cnt == 4) { l = max(l, maxi + 1); } } else if (s[i] == 0 ) { int mina = inf; for (j = i; j >= i - 4; j--) { mina = min(mina, a[j]); } int cnt = 0; for (j = i; j >= i - 4; j--) { if (s[j] == 1 ) cnt++; } if (cnt == 4) { r = min(r, mina - 1); } } } cout << l << << r << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, j, k, n, v[200010], m, a, b, x, y, h, w, l, p, ans, numitor, aux, mini, sum, poz; string s1, s2, second; char c; map<long long, long long> mip; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> x; for (long long i = 1; i <= n; i++) { cin >> v[i]; if (v[i] < x) v[i] = -1; else if (v[i] > x) v[i] = 1; else { v[i] = 0; poz = i; } } mip[0] = 1; sum = 0; for (long long i = 1; i <= n; i++) { sum += v[i]; if (i >= poz) { if (mip.find(sum) != mip.end()) ans += mip[sum]; if (mip.find(sum - 1) != mip.end()) ans += mip[sum - 1]; } else { mip[sum] += 1; v[i] = sum; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, ex, ey, sx[N], sy[N]; char s[N]; inline bool check(int m) { for (int i = 1; i + m - 1 <= n; i++) { int decx = sx[n] - sx[i + m - 1] + sx[i - 1]; int decy = sy[n] - sy[i + m - 1] + sy[i - 1]; int nedx = ex - decx; int nedy = ey - decy; if (abs(nedx) + abs(nedy) <= m && !(m - abs(nedx) - abs(nedy) & 1)) return 1; } return 0; } int main() { scanf( %d%s%d%d , &n, s + 1, &ex, &ey); for (int i = 1; i <= n; i++) { sx[i] = sx[i - 1] + (s[i] == L ? -1 : (s[i] == R ? 1 : 0)); sy[i] = sy[i - 1] + (s[i] == D ? -1 : (s[i] == U ? 1 : 0)); } int l = 0, r = n, mid, ans = -1; while (l <= r) { mid = l + r >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else { l = mid + 1; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, i, j, x, y = 0, w, z = 0, e; cin >> a >> b >> c >> d; if (d % c != 0) { cout << 0; return 0; } w = d / c; if (c == d) { if (c >= a && c <= b) cout << 1; else cout << 0; return 0; } for (i = 1; i <= sqrt(w); i++) { if (w % i == 0) { x = w / i; e = 0; for (j = 2; j <= i; j++) { if (i % j == 0 && x % j == 0) { e = 1; break; } } if (e == 0) { if (i * c >= a && i * c <= b && x * c >= a && x * c <= b) y++; } } } cout << y * 2; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 5; int tree[4 * MAXN], n, m, a[MAXN], size = 0, less1[MAXN]; vector<int> del, nums; void initialize(int l, int r, int node) { tree[node] = r - l + 1; if (r == l) return; int mid = (l + r) / 2; initialize(l, mid, 2 * node); initialize(mid + 1, r, 2 * node + 1); } int elim(int node) { while (node >= 1) { tree[node]--; node /= 2; } } void find(int l, int r, int sum, int node) { if (l == r) { nums[l] = -2; elim(node); return; } int mid = (l + r) / 2; if (tree[2 * node] >= sum) find(l, mid, sum, 2 * node); else find(mid + 1, r, sum - tree[2 * node], 2 * node + 1); } int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 0; i < m; ++i) { cin >> a[i]; } for (int i = 0; i < MAXN; ++i) less1[i] = 0; for (int i = 0; i < m - 1; ++i) for (int k = a[i]; k < a[i + 1]; ++k) less1[k] = i + 1; for (int i = a[m - 1]; i < MAXN; ++i) less1[i] = m; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x == -1) { del.push_back(less1[size]); size -= less1[size]; } else { nums.push_back(x); size++; } } if (nums.size() == 0) { cout << Poor stack! << endl; return 0; } initialize(0, nums.size() - 1, 1); for (int i = 0; i < del.size(); ++i) for (int j = del[i] - 1; j >= 0; --j) find(0, nums.size() - 1, a[j], 1); int ct = 0; for (int i = 0; i < nums.size(); ++i) { if (nums[i] != -2) { cout << nums[i]; ++ct; } } if (ct == 0) cout << Poor stack! ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3f; const double pi = acos(-1.0); const double eps = 1e-9; const long long mod = 1e9 + 7; int read() { int x = 0, f = 1; char ch = getchar(); while (ch< 0 | ch> 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } void Out(int aa) { if (aa > 9) Out(aa / 10); putchar(aa % 10 + 0 ); } int n, t; int f[55], s[55], p[55]; double dp[55][5005]; bool check(double mid) { for (int i = n; i >= 1; i--) { for (int j = t + 1; j <= 5000; j++) dp[i + 1][j] = mid; for (int j = 0; j <= t; j++) { double t1 = (dp[i + 1][j + f[i]] + f[i]) * p[i] / 100; double t2 = (dp[i + 1][j + s[i]] + s[i]) * (100 - p[i]) / 100; dp[i][j] = min(mid, t1 + t2); } } return dp[1][0] < mid; } int main() { n = read(), t = read(); for (int i = 1; i <= n; i++) f[i] = read(), s[i] = read(), p[i] = read(); double l = 0, r = 1e12; for (int i = 0; i < 100; i++) { double mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } printf( %.10f n , l); return 0; } |
#include <iostream> #include <vector> #include <algorithm> using namespace std; #define int long long void solve() { int n; vector<long long> vect; cin >> n; for (int i = 0; i < n; i++) { long long x; cin >> x; vect.push_back(x); } sort(vect.begin(), vect.end()); long long res = 0; long long now = 0; for (int i = n - 2; i >= 0; i--) { res -= now - (n - i - 2) * vect[i]; now += vect[i + 1]; } cout << res << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; for (int i = 0; i < t; i++) solve(); return 0; } |
// Problem : B. Tree Array // Contest : Codeforces - Codeforces Round #728 (Div. 1) // URL : https://codeforces.com/contest/1540/problem/B // Memory Limit : 256 MB // Time Limit : 2000 ms // Powered by CP Editor (https://github.com/cpeditor/cpeditor) #include <bits/stdc++.h> using namespace std; int N; long long pas[205][205]; const long long MOD = 1e9+7; long long cache[205][205]; vector<int> graph[205]; int par[205]; bool vis[205]; long long add(long long a, long long b){ return (a + b) % MOD; } long long mult(long long a, long long b){ return a * b % MOD; } long long qikpow(long long b, long long e){ if(!e){ return 1; } long long ret = qikpow(b, e / 2); ret = mult(ret, ret); if(e & 1){ ret = mult(ret, b); } return ret; } long long sub(long long a, long long b){ return ((a - b) % MOD + MOD ) % MOD; } long long divd(long long a, long long b){ return mult(a, qikpow(b, MOD - 2)); } void dfs1(int n){ for(int e : graph[n]){ if(e != par[n]){ par[e] = n; dfs1(e); } } } int dfs2(int n, int p){ int sz = 1; for(int e : graph[n]){ if(!vis[e] && p != e){ sz += dfs2(e, n); } } return sz; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for(int i = 0; i <= N; i++){ pas[i][0] = 1; for(int j = 1; j <= i; j++){ pas[i][j] = add(pas[i-1][j], pas[i-1][j-1]); } } for(int i = 1; i < N; i++){ int a, b; cin >> a >> b; graph[a].emplace_back(b); graph[b].emplace_back(a); } long long ans = 0; for(int n = 1; n <= N; n++){ fill(par, par+1+N, 0); dfs1(n); vis[n] = 1; for(int k = n+1; k <= N; k++){ int cur = k, len = 0; while(cur != n){ vis[cur] = 1; len++; cur = par[cur]; } cur = k; for(int t = len; t; t--){ int s = dfs2(cur, 0); //cout << s << n ; long long tot = divd(s, N); if(t == len){ ans = add(ans, tot); } else{ /* long long p = 1;//qikpow(divd(1, 2), len); cout << p << << pas[len - 1][len - t] << n ; p = mult(p, divd(pas[len - 1][len - t], pas[len][len-t])); cout << n << << k << << cur << n ; cout << p << << tot << n ; ans = add(ans, mult(p, tot)); */ //cout << n << << k << << cur << n ; //cout << tot << n ; if(!cache[len][t]){ for(int c = 0; c < t; c++){ cache[len][t] = add(cache[len][t], mult(pas[c+len-t-1][len-t-1], qikpow(divd(1, 2), c+len-t))); //cout << mult(mult(pas[c+len-t-1][len-t-1], qikpow(divd(1, 2), c+len-t)), tot) << n ; } } ans = add(mult(tot, cache[len][t]), ans); } cur = par[cur]; } cur = k; while(cur != n){ vis[cur] = 0; cur = par[cur]; } } vis[n] = 0; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int read() { int a = 0; char c = getchar(); bool f = 0; while (!isdigit(c)) { f = c == - ; c = getchar(); } while (isdigit(c)) { a = a * 10 + c - 48; c = getchar(); } return f ? -a : a; } const int _ = 1e5 + 11; vector<int> nxt[_][2]; int N, C[_], ans; long long num; void addEd(int a, int b, int c) { nxt[a][c].push_back(b); } int deg[_], dst[_], seq[_], cseq; unsigned long long arr[_][50]; void build(int fir) { memset(deg, 0, sizeof(deg)); cseq = 0; for (int i = 1; i <= N + 8; ++i) { for (auto t : nxt[i][0]) deg[t] += dst[t] == dst[i]; for (auto t : nxt[i][1]) deg[t] += dst[t] == dst[i] + 1; } queue<int> q; q.push(fir); while (!q.empty()) { int t = q.front(); q.pop(); seq[++cseq] = t; for (int l = 0; l < 2; ++l) for (auto p : nxt[t][l]) if (dst[p] == dst[t] + l && !--deg[p]) q.push(p); } } void solve(int size, vector<int> node, int fir, int mx) { memset(arr, 0, sizeof(arr)); for (int i = 0; i < node.size(); ++i) arr[node[i]][i >> 6] |= 1ull << (i & 63); for (int i = 1; i <= cseq; ++i) { int t = seq[i]; for (int l = 0; l < 2; ++l) for (auto p : nxt[t][l]) if (dst[p] == dst[t] + l) for (int r = 0; r < 50; ++r) arr[p][r] |= arr[t][r]; } long long cnt = 0; int val = node.size(); for (int i = 1; i <= N && val == node.size(); ++i) if (dst[i] == mx) { int num = 0; for (int j = 0; j < 50; ++j) { num += __builtin_popcountll(arr[i][j]); } val = min(val, num); } if (val == node.size()) --mx; for (int i = 1; i <= N; ++i) if (dst[i] > mx) cnt += node.size(); else if (dst[i] == mx) { int num = 0; for (int j = 0; j < 50; ++j) { num += __builtin_popcountll(arr[i][j]); } cnt += node.size() - num; } if (ans < mx) { ans = mx; num = 0; } if (ans == mx) num += cnt; } int main() { ios::sync_with_stdio(0); cin >> N; for (int i = 1; i <= N; ++i) { char c; cin >> c; C[i] = c - a + 1; addEd(i, N + C[i], 0); addEd(N + C[i], i, 1); } for (int i = 2; i <= N; ++i) { addEd(i - 1, i, 1); addEd(i, i - 1, 1); } for (int i = 1; i <= 8; ++i) { memset(dst, 0x3f, sizeof(dst)); dst[N + i] = 0; deque<int> q; q.push_back(N + i); int mx = 0; while (!q.empty()) { int t = q.front(); q.pop_front(); if (t <= N) mx = max(mx, dst[t]); for (auto r : nxt[t][0]) if (dst[r] > dst[t]) { dst[r] = dst[t]; q.push_front(r); } for (auto r : nxt[t][1]) if (dst[r] > dst[t] + 1) { dst[r] = dst[t] + 1; q.push_back(r); } } vector<int> node; build(N + i); for (int j = 1; j <= N; ++j) if (C[j] == i) { node.push_back(j); if (node.size() == 64 * 50) { solve(64 * 50, node, N + i, mx); node.clear(); } } if (node.size()) solve(node.size(), node, N + i, mx); } cout << ans << << num / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; int64_t ans, n, k, m, r[100005]; char s[100005], t[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int64_t tt; cin >> tt; while (tt--) { cin >> n; cin >> s; cin >> t; vector<int> ans; m = n - 1; int i = 0, j = n - 1; while (i < j) { r[m--] = i; i++; r[m--] = j; j--; } if (i == j) r[m] = i; m = 0; for (int i = n - 1; i >= 0; i--) { if ((s[r[i]] - 0 + m) % 2 == t[i] - 0 ) ans.push_back(1); ans.push_back(i + 1); m++; } cout << (int)ans.size() << ; for (auto i : ans) cout << i << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> a; int k, t, n, mx; string s; int main() { cin >> n >> k; cin >> s; for (int i = 0; i < s.size(); i++) if (s[i] == . ) a.push_back(i); for (int i = 0; i < a.size() - 1; i++) mx = max(mx, a[i + 1] - a[i]); if (mx > k) cout << NO ; else cout << YES ; } |
#include <bits/stdc++.h> using namespace std; int w; long long n, k; pair<long long, long long> o = {0, 0}; pair<long long, long long> csop(long long kezd, long long kim) { long long sum = 0, kov = kezd + k; if (kezd <= kim && kim <= kov) { kov++; } sum = (kov - kezd) * (kov - kezd - 1) / 2; if (log(k) + log(kezd) < 42.0) { sum += kezd * (kov - kezd); } else { sum = 2e18; } if (kezd <= kim && kim < kov) { sum -= kim; } return {sum, kov}; } pair<long long, long long> calc(long long ert) { if (ert <= k * (k + 1) / 2) { return {1, k * (k + 1) / 2}; } long long kis = ert / k - k / 2; auto s = calc(kis); long long fi = s.first, se = s.second; long long s2 = kis, kor = 0, ert2 = 0; s2 -= (fi - 1) * (k + 1), kor += fi - 1, ert2 = (fi - 1) * (k + 1); long long ss = (s2 + k - 2) / k; kor += ss, ert2 += ss * k; ert2++, kor++; if (ert2 >= se) { ert2++; } auto cs = csop(ert2, se); if (cs.first < ert) { ert2 = cs.second, kor++; cs = csop(ert2, se); } return {kor, cs.first}; } int main() { ios_base::sync_with_stdio(false); cin >> w; while (w--) { cin >> n >> k; if (n <= k) { cout << n << n ; continue; } if (k == 2 && n <= 5) { cout << n << n ; continue; } auto s = calc(n); if (s.second == n) { cout << s.first * (k + 1) << n ; } else { long long fi = s.first, ans = fi * (k + 1); n -= fi * (k + 1) - 1; ans += (k + 1) * (n / k) + n % k; if (n % k == 0) { ans--; } cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int cl[5000010], cr[5000010], ld[5000010], sl = 1; bool yz[5000010]; void pushd(int x) { if (cl[x] == 0) { cl[x] = ++sl; yz[cl[x]] = 1; } if (cr[x] == 0) { cr[x] = ++sl; yz[cr[x]] = 1; } yz[x] = 0; if (ld[x] == 0) return; ld[cl[x]] = ld[cr[x]] = ld[x]; ld[x] = 0; } vector<int> cf[50010], ve[5000010]; void addqj(int i, long long l, long long r, long long L, long long R, int x) { if (R <= l || r <= L) return; if (L <= l && r <= R) { ld[i] = x; cf[x].push_back(i); return; } long long m = (l + r) >> 1; pushd(i); addqj(cl[i], l, m, L, R, x); addqj(cr[i], m, r, L, R, x); } void link(int x, int y) { if (yz[x] && yz[y]) { if (ld[x] < ld[y]) ve[x].push_back(y); else ve[y].push_back(x); return; } link(yz[x] ? x : cl[x], yz[y] ? y : cl[y]); link(yz[x] ? x : cr[x], yz[y] ? y : cr[y]); } int find(int i, long long l, long long r, long long x) { if (yz[i]) return i; long long m = (l + r) >> 1; return x < m ? find(cl[i], l, m, x) : find(cr[i], m, r, x); } int lx[50010], fa[5000010], ans[50010]; long long A[50010], B[50010]; int getv(int x) { return x == fa[x] ? x : fa[x] = getv(fa[x]); } void merge(int x, int y) { x = getv(x); y = getv(y); if (x != y) fa[x] = y; } int main() { int n, m; scanf( %d%d , &n, &m); ld[1] = m + 1; yz[1] = 1; for (int i = 1; i <= m; i++) { char zf[10]; scanf( %s%lld%lld , zf, &A[i], &B[i]); lx[i] = zf[0] == b ? 0 : 1; if (lx[i] == 0) addqj(1, 0, (1ll << n), A[i], B[i] + 1, i); } for (int i = 1; i <= sl; i++) { fa[i] = i; if (!yz[i]) link(cl[i], cr[i]); } for (int i = 1; i <= sl; i++) { if (ld[i] != m + 1) continue; for (int j = 0; j < ve[i].size(); j++) merge(i, ve[i][j]); } for (int i = m; i >= 1; i--) { if (lx[i]) ans[i] = (getv(find(1, 0, (1ll << n), A[i])) == getv(find(1, 0, (1ll << n), B[i]))); else { for (int x = 0; x < cf[i].size(); x++) { int u = cf[i][x]; for (int y = 0; y < ve[u].size(); y++) merge(u, ve[u][y]); } } } for (int i = 1; i <= m; i++) { if (lx[i]) printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 15; long long Get_Num(int num[], int b, int n) { long long number = 0; long long in = 1; for (int i = n - 1; i >= 0; i--) { number += num[i] * in; in = in * b; } return number; } int main() { int x[N], y[N]; int b; int n; long long X, Y; cin >> n >> b; for (int i = 0; i < n; i++) { cin >> x[i]; } X = Get_Num(x, b, n); cin >> n >> b; for (int i = 0; i < n; i++) { cin >> y[i]; } Y = Get_Num(y, b, n); if (X == Y) { printf( = n ); } else if (X > Y) { printf( > n ); } else { printf( < n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long n, m; cin >> n >> m; long sum = 0; if (n == 1 || n == 2) { if (n == 1) cout << 0 << endl; else cout << m << endl; } else { cout << 2 * m << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long n, m; int k; int mpow(int a, long long b) { int c = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) c = 1ll * c * a % mod; return c; } int main() { scanf( %lld%lld%d , &n, &m, &k); if ((n + m) & 1) if (k == -1) { printf( 0 n ); return 0; } int tmp = mpow(2, n - 1); printf( %d n , mpow(tmp, m - 1)); } |
#include <bits/stdc++.h> using namespace std; int tt(char p) { int s; if (p == > ) s = 8; else if (p == < ) s = 9; else if (p == + ) s = 10; else if (p == - ) s = 11; else if (p == . ) s = 12; else if (p == , ) s = 13; else if (p == [ ) s = 14; else s = 15; return s; } int main() { string x; int t = 0; int q = x.length() - 1; cin >> x; for (int i = 0; i < x.length(); ++i) { t = (t * 16 + tt(x[i])) % 1000003; } cout << t; return 0; } |
#include <bits/stdc++.h> template <typename T> inline T MIN(T a, T b) { return a < b ? a : b; } template <typename T> inline T MAX(T a, T b) { return a > b ? a : b; } using namespace std; void reop() { freopen( input.txt , r , stdin); } int a[100001] = {0}; int ans = 0, curans = 0; bool test(int div, int n, int start) { int prev = start; for (int i = 2; i < n; ++i) { if (a[i] == prev + div) prev = a[i]; else if (a[i] + 1 == prev + div) { prev = a[i] + 1; curans++; } else if (a[i] - 1 == prev + div) { prev = a[i] - 1; curans++; } else return false; } ans = MIN(ans, curans); return true; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } if (n == 1 || n == 2) { cout << 0; return 0; } ans = 1000000007; for (int i = -1; i <= 1; ++i) { for (int j = -1; j <= 1; ++j) { curans = 0; int div = a[1] + j - (a[0] + i); if (j) curans++; if (i) curans++; test(div, n, a[1] + j); } } cout << (ans == 1000000007 ? -1 : ans); return 0; } |
#include<bits/stdc++.h> #define int long long #define pii pair<int,int> #define F first #define S second #define pi acos(-1.0) #define pb push_back #define sf(x) scanf( %lld ,&x) #define pf(x) printf( %lld ,&x) using namespace std; const int mod=1e9+7; int a1[2000],ar[2000],ff[2000] ; map<int,int>mp,mk ; int bigmod(int a , int b) { if(b==0) return 1 ; int x = bigmod(a,b/2) ; x=((x%mod)*(x%mod))%mod ; if(b%2) x=((x%mod)*(a%mod))%mod ; return x ; } int ncr(int a , int b) { int p=(ff[a-b]*ff[b])%mod ; p=(ff[a]*bigmod(p,mod-2)) ; p%=mod ; return p ; } int32_t main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; ff[0]=1 ; ff[1]=1 ; for(int i = 2 ; i <= 1000 ; i++) ff[i]=(ff[i-1]*i)%mod ; int t ; cin>>t ; while(t--) { int n,k,mx=0 ; cin>>n>>k ; mp.clear() ; mk.clear() ; set<int>st ; for(int i = 1 ; i <= n ; i++){cin>>ar[i] ; mp[ar[i]]++ ; a1[i]=ar[i] ; } sort(a1+1,a1+n+1) ; reverse(a1+1,a1+n+1) ; // for(int i = 1 ; i <= n ; i++) cout<<a1[i]<< ; cout<<endl ; for(int i = 1 ; i <= k ; i++) {mx+=a1[i] ; st.insert(a1[i]) ; mk[a1[i]]++ ;} int ans=1 ; for(int x : st) { int p=mp[x],q=mk[x] ; // cout<<x<< <<p<< <<q<<endl ; ans*=ncr(p,q); ans%=mod ; } cout<<ans<<endl ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 2, M = 1e9 + 7; int tt = 1, n, k; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> tt; while (tt--) { cin >> n; if (n == 1) { cout << a n ; continue; } string second = , ans = ; for (int i = 0; i < n / 2 - 1; i++) second += a ; ans += a + second + b + second; if (n & 1) ans += c ; cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; const long long inf = 1e17 + 7; pair<long long, long long> a[maxn]; pair<long long, long long> A[maxn]; pair<pair<long long, long long>, pair<long long, long long> > S[maxn]; int pos; inline long long elf(pair<long long, long long> z, long long x) { return z.first * x + z.second; } inline long long earl(pair<long long, long long> z, long long v) { long long a = z.first, b = z.second; long long x = (v - b) / a; if (a * x >= v - b) return x; return x + 1; } inline long double intx(pair<long long, long long> l1, pair<long long, long long> l2) { long long a1 = l1.first, a2 = l2.first, b1 = l1.second, b2 = l2.second; return (long double)(b2 - b1) / (long double)(a1 - a2); } void ins(long long a, long long b) { while (pos >= 2 && intx(S[pos].first, S[pos - 1].first) >= intx(make_pair(a, b), S[pos].first)) pos--; S[pos].second.second = ceil(intx(S[pos].first, make_pair(a, b))) - 1; pos++; S[pos] = make_pair(make_pair(a, b), make_pair(ceil(intx(S[pos - 1].first, make_pair(a, b))), inf)); } int main() { int n; long long s; scanf( %d %lld , &n, &s); for (int i = 1; i <= n; i++) { scanf( %lld %lld , &a[i].first, &a[i].second); } sort(a + 1, a + n + 1); a[0].first = -1; long long cur = -1; long long best = inf; int idx = 0; for (int i = n; i >= 0; i--) { if (a[i].first != cur) { if (cur > 0) { idx++; A[idx] = make_pair(cur, best); } cur = a[i].first; best = inf; } best = min(best, a[i].second); } n = idx; for (int i = 1; i <= n; i++) a[i] = A[i]; best = inf; idx = 0; for (int i = 1; i <= n; i++) { if (a[i].second >= best) continue; idx++; A[idx] = a[i]; best = min(best, a[i].second); } n = idx; reverse(A + 1, A + n + 1); long long ans = inf; pos = 1; S[pos] = make_pair(make_pair(A[1].first, 0), make_pair(0, inf)); int fp = 1; for (int i = 2; i <= n; i++) { while (fp < pos && elf(S[fp].first, S[fp].second.second) < A[i].second) fp++; long long cx = earl(S[fp].first, A[i].second); long long fcx = elf(S[fp].first, cx); ins(A[i].first, fcx - A[i].second - A[i].first * cx); fp = min(fp, pos); } for (int i = 1; i <= pos; i++) { ans = min(ans, earl(S[i].first, s)); } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 3; const long long int M = 1000000007; void solve() { string s; cin >> s; int n = s.length(); for (int i = 0; i < n - 1; ++i) { s += 0 ; } long long int ans = 0; for (int i = 0; i < 2 * (n - 1) + 1; ++i) { ans += ans + s[i] - 0 ; ans %= M; } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); solve(), cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct like { int id; int change = 0; }; int main() { int n, s, max = 0, idmax = 0, count = 0, k = 0; cin >> n; like *A = new like[n]; for (int i = 0; i < n; i++) { cin >> s; k = 1; for (int j = 0; j < count; j++) { if (A[j].id == s) { A[j].change++; k = 0; if (A[j].change > max) { max = A[j].change; idmax = A[j].id; } } } if (k == 1) { A[count].id = s; A[count].change++; if (A[count].change > max) { max = A[count].change; idmax = A[count].id; } count++; } } cout << idmax << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int H[100000][5], V[100000][5]; long long dp[32]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i < m; ++i) for (int j = 0; j < n; ++j) cin >> H[i][j]; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) cin >> V[i][j]; for (int i = 1; i < (1 << n); ++i) dp[i] = 1e18; const int sz = 1 << n; for (int i = 1; i < m; ++i) { for (int j = 0; j < sz; ++j) { for (int k = 0; k < n; ++k) { if (!(j & (1 << k))) { auto &t = dp[j | (1 << k)]; const auto &nt = dp[j] + H[i][k]; if (nt < t) t = nt; } } for (int k = 0; k < n; ++k) { if ((((j >> k)) ^ ((j >> ((k + 1) % n)))) & 1) dp[j] += V[i][k]; } } } cout << dp[sz - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int arr[100000], arr1[100000], arr2[100000]; int main() { int n, flag = 0; cin >> n; multiset<long long int> m; multiset<long long int>::iterator it; for (int i = 0; i < n; i++) { cin >> arr[i]; m.insert(arr[i]); if (i == 0) arr1[i] = arr[i]; else arr1[i] = arr1[i - 1] + arr[i]; } for (int i = n - 1; i >= 0; i--) { if (i == n - 1) arr2[n - 1 - i] = arr[i]; else arr2[n - 1 - i] = arr2[n - 2 - i] + arr[i]; } if (arr1[n - 1] % 2 != 0) cout << NO ; else { long long int sum = arr1[n - 1] / 2; it = m.find(arr[0]); m.erase(it); if (arr1[0] == sum || arr2[0] == sum) flag = 1; if (!flag) { for (int i = 1; i < n - 1; i++) { if (m.find(sum - arr1[i - 1]) != m.end()) { flag = 1; break; } if (!flag) { int low = i + 1, high = n - 1; while (low < high) { int mid = low + (high - low + 1) / 2; if (arr1[mid] - arr1[i] + arr1[i - 1] > sum) high = mid - 1; else low = mid; } if (arr1[low] - arr1[i] + arr1[i - 1] == sum) { flag = 1; break; } } it = m.find(arr[i]); m.erase(it); } } m.clear(); if (!flag) { for (int i = 0; i < n; i++) m.insert(arr[i]); it = m.find(arr[n - 1]); m.erase(it); for (int i = 1; i < n - 1; i++) { if (m.find(sum - arr2[i - 1]) != m.end()) { flag = 1; break; } int low = i + 1, high = n - 1; while (low < high) { int mid = low + (high - low + 1) / 2; if (arr2[mid] - arr2[i] + arr2[i - 1] > sum) high = mid - 1; else low = mid; } if (arr2[low] - arr2[i] + arr2[i - 1] == sum) { flag = 1; cout << i << endl; break; } it = m.find(arr[n - 1 - i]); m.erase(it); } } if (flag) cout << YES ; else cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = 1e9 + 7; void dfs(int node, vector<vector<pair<int, int>>>& adj, vector<bool>& vu, ll& cnt) { for (auto& p : adj[node]) { if (!vu[p.first] and p.second == 0) { vu[p.first] = true; ++cnt; dfs(p.first, adj, vu, cnt); } } } ll getPow(ll a, ll p) { ll ret = 1, cp = a; while (p) { if (p & 1) ret = (ret * cp) % MOD; p >>= 1; cp = (cp * cp) % MOD; } return ret; } int main() { ios::sync_with_stdio(0); cin.tie(0); int n, k, a, b, c; cin >> n >> k; vector<vector<pair<int, int>>> adj(n + 1); for (int i = 1; i < n; ++i) { cin >> a >> b >> c; adj[a].emplace_back(b, c); adj[b].emplace_back(a, c); } vector<bool> vu(n + 1); ll ans = getPow(n, k); for (int i = 1; i <= n; ++i) { if (!vu[i]) { ll tmp = 1; vu[i] = true; dfs(i, adj, vu, tmp); ans = (ans - getPow(tmp, k)) % MOD; } } cout << (ans + MOD) % MOD; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, v[5000]; char a[5000][5050]; bool dfs(int x, int from) { v[x] = 1; for (int y = 0; y < n; y++) if (a[x][y] == 1 ) { if (!v[y]) { if (dfs(y, x)) return true; } else { if (a[y][from] == 1 ) { printf( %d %d %d n , y + 1, from + 1, x + 1); return true; } } } return false; } int main() { scanf( %d , &n); gets(a[0]); for (int i = 0; i < n; i++) gets(a[i]); for (int i = 0; i < n; i++) if (!v[i]) if (dfs(i, -1)) return 0; puts( -1 ); } |
#include <bits/stdc++.h> const double EPS = 0.0000000001; const long long mod1 = 998244353; const long long mod2 = 1000000007; const long long mod3 = 1000000009; const long long mod4 = 998244353; const long long inf = 10000000000000000; using namespace std; signed main() { cin.tie(0); cout.tie(0); std::ios_base::sync_with_stdio(0); long long n, a; cin >> n >> a; long long matrix[a][n]; for (long long i = 0; i < a; i++) { for (long long z = 0; z < n; z++) { char c; cin >> c; matrix[i][z] = (c - 0 ); } } bool used[a]; for (long long i = 0; i < a; i++) { bool p = 0; for (long long z = 0; z < n; z++) { if (!matrix[i][z]) p = 1; } used[i] = p; } long long c = 0; long long x = 1; long long maxi = -1; for (long long i = 0; i < a; i++) { if (used[i]) { c++; continue; } maxi = max(maxi, c); c = 0; } maxi = max(maxi, c); cout << maxi; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> x[1024], y[1024]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> x[i].first >> x[i].second; y[i].first = x[i].first; y[i].second = x[i].second; } sort(x, x + n, [](const pair<int, int>& a, const pair<int, int>& b) { return a.first < b.first || (a.first == b.first && a.second < b.second); }); sort(y, y + n, [](const pair<int, int>& a, const pair<int, int>& b) { return a.second < b.second || (a.second == b.second && a.first < b.first); }); string ans = ; int r = 0, c = 0; for (int i = 0; i < n; i++) { if (x[i] != y[i]) { cout << NO << endl; ans = ; break; } else { ans += string(x[i].first - r, R ); ans += string(x[i].second - c, U ); r = x[i].first; c = x[i].second; } } if (!ans.empty()) { cout << YES << endl << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; char s[123456]; int main() { scanf( %s , s); stack<pair<int, int> > st; int best = 0, rr = -1; int sqb = 0; for (int i = 0; s[i]; ++i) { if (s[i] == ( || s[i] == [ ) { st.push(make_pair(i, sqb)); sqb = 0; } else if (s[i] == ) ) { if (st.size() > 0 && s[st.top().first] == ( ) { sqb += st.top().second; if (best < sqb) { best = sqb; rr = i; } st.pop(); } else { stack<pair<int, int> >().swap(st); sqb = 0; } } else if (s[i] == ] ) { if (st.size() > 0 && s[st.top().first] == [ ) { sqb += st.top().second + 1; if (best < sqb) { best = sqb; rr = i; } st.pop(); } else { stack<pair<int, int> >().swap(st); sqb = 0; } } } s[rr + 1] = 0; int ll = rr; stack<int> out; for (int i = rr; i >= 0; --i) { if (s[i] == ) || s[i] == ] ) { out.push(i); } else if (s[i] == ( ) { if (out.size() > 0 && s[out.top()] == ) ) { ll = i; out.pop(); } else break; } else if (s[i] == [ ) { if (out.size() > 0 && s[out.top()] == ] ) { ll = i; out.pop(); } else break; } } while (out.size() > 0) { ll = out.top() + 1; out.pop(); } printf( %d n , best); puts(s + ll); return 0; } |
#include <bits/stdc++.h> template <int MOD_> struct modnum { static constexpr int MOD = MOD_; static_assert(MOD_ > 0, MOD must be positive ); private: using ll = long long; int v; static int minv(int a, int m) { a %= m; assert(a); return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a); } public: modnum() : v(0) {} modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; } explicit operator int() const { return v; } friend std::ostream& operator<<(std::ostream& out, const modnum& n) { return out << int(n); } friend std::istream& operator>>(std::istream& in, modnum& n) { ll v_; in >> v_; n = modnum(v_); return in; } friend bool operator==(const modnum& a, const modnum& b) { return a.v == b.v; } friend bool operator!=(const modnum& a, const modnum& b) { return a.v != b.v; } modnum inv() const { modnum res; res.v = minv(v, MOD); return res; } friend modnum inv(const modnum& m) { return m.inv(); } modnum neg() const { modnum res; res.v = v ? MOD - v : 0; return res; } friend modnum neg(const modnum& m) { return m.neg(); } modnum operator-() const { return neg(); } modnum operator+() const { return modnum(*this); } modnum& operator++() { v++; if (v == MOD) v = 0; return *this; } modnum& operator--() { if (v == 0) v = MOD; v--; return *this; } modnum& operator+=(const modnum& o) { v += o.v; if (v >= MOD) v -= MOD; return *this; } modnum& operator-=(const modnum& o) { v -= o.v; if (v < 0) v += MOD; return *this; } modnum& operator*=(const modnum& o) { v = int(ll(v) * ll(o.v) % MOD); return *this; } modnum& operator/=(const modnum& o) { return *this *= o.inv(); } friend modnum operator++(modnum& a, int) { modnum r = a; ++a; return r; } friend modnum operator--(modnum& a, int) { modnum r = a; --a; return r; } friend modnum operator+(const modnum& a, const modnum& b) { return modnum(a) += b; } friend modnum operator-(const modnum& a, const modnum& b) { return modnum(a) -= b; } friend modnum operator*(const modnum& a, const modnum& b) { return modnum(a) *= b; } friend modnum operator/(const modnum& a, const modnum& b) { return modnum(a) /= b; } }; int main() { using namespace std; ios_base::sync_with_stdio(false), cin.tie(nullptr); using num = modnum<int(1e9) + 7>; int Q; cin >> Q; string A; cin >> A; vector<num> dp(int(A.size()) + 1, num(1)); Q--; while (Q--) { string B; cin >> B; vector<num> ndp(int(B.size()) + 1, num(0)); int Asize = int(A.size()); int Bsize = int(B.size()); int L = max(Asize + 1, Bsize + 1); A.resize(L + 1, $ ); B.resize(L + 1, % ); dp.resize(L + 1, num(0)); ndp.resize(L, num(0)); vector<array<array<num, 2>, 2>> pref_dp(L); pref_dp[0][0][0]++; for (int i = 0; i < L; i++) { for (int z : {0, 1}) { pref_dp[i][1][z] += dp[i] * pref_dp[i][0][z]; } if (i + 1 == L) break; for (int z : {0, 1}) { pref_dp[i + 1][z][1] += pref_dp[i][z][1]; if (A[i + z] == B[i]) { pref_dp[i + 1][z][0] += pref_dp[i][z][0]; } else if (A[i + z] < B[i]) { pref_dp[i + 1][z][1] += pref_dp[i][z][0]; } } } bool suff_less = true; num ways_suff = num(0); num ways_suff_less = num(0); for (int i = L - 1; i >= 0; i--) { ways_suff += dp[i + 1]; if (suff_less) { ways_suff_less += dp[i + 1]; } if (A[i] < B[i + 1]) { ways_suff_less = ways_suff; } else if (A[i] > B[i + 1]) { ways_suff_less = 0; } if (A[i + 1] != B[i + 1]) { suff_less = A[i + 1] < B[i + 1]; } ndp[i] += ways_suff_less * pref_dp[i][0][0]; ndp[i] += suff_less * pref_dp[i][1][0]; ndp[i] += ways_suff * pref_dp[i][0][1]; ndp[i] += pref_dp[i][1][1]; } A.resize(Asize); B.resize(Bsize); dp.resize(Asize + 1); ndp.resize(Bsize + 1); A = std::move(B); dp = std::move(ndp); } num ans = accumulate(dp.begin(), dp.end(), num(0)); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1}; int dy[] = {-1, 1, 0, 0}; template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } template <class T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; void make_unique(vector<int>& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); } int on(int n, int pos) { return n = n | (1 << pos); } void off(int& n, int pos) { n = n & ~(1 << pos); } bool check(int n, int pos) { return (bool)(n & (1 << pos)); } const int N = 1e5 + 10; const int M = 64; int id, cnt[M * N], a[N * M][5]; int new_node() { for (int i = 0; i < 3; i++) { a[id][i] = -1; } cnt[id] = 0; return id++; } vector<int> bit(70); void make(long long int x) { bit.clear(); int i = 0; while (x) { bit.push_back(x % 2); x /= 2LL; i++; } while (i < M - 1) { bit.push_back(0LL); i++; } reverse(bit.begin(), bit.end()); } void add(long long int x) { make(x); int cur = 0, typ; for (int i = 0; i < M; i++) { typ = bit[i]; if (a[cur][typ] == -1) { a[cur][typ] = new_node(); } cur = a[cur][typ]; ++cnt[cur]; } } void del(long long int x) { make(x); int cur = 0, typ; for (int i = 0; i < M; i++) { typ = bit[i]; cur = a[cur][typ]; --cnt[cur]; } } long long int query(long long int x) { make(x); int cur = 0, typ; long long int ans = 0LL; for (int i = 0; i < M; i++) { typ = bit[i]; if (cnt[a[cur][!typ]] > 0) { ans += (1LL << (M - i - 2)); cur = a[cur][!typ]; } else { if (a[cur][typ] == -1) return ans; cur = a[cur][typ]; } } return ans; } long long int arr[N]; int main() { int n; while (scanf( %d , &n) != EOF) { id = 0; new_node(); for (__typeof(n) i = 1; i <= n; i++) { scanf( %lld , &arr[i]); } long long int xr = 0LL; for (int i = n; i >= 1; i--) { xr ^= arr[i]; add(xr); } long long int mx = 0LL; long long int nw = 0LL; mx = max(mx, query(nw)); for (int i = 1; i <= n; i++) { nw ^= arr[i]; mx = max(mx, query(nw)); del(xr); xr ^= arr[i]; } printf( %lld n , mx); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t > 0) { t--; string s, x; cin >> s; x.push_back(s[0]); for (int i = 1; i < s.size(); i++) { if (i % 2 != 0) x.push_back(s[i]); } cout << x << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int q = 1, i, j; while (q--) { int n, r; cin >> r >> n; vector<int> t(n + 1), x(n + 1), y(n + 1); t[0] = 0, x[0] = 1, y[0] = 1; for (i = 1; i < (n + 1); i++) { cin >> t[i] >> x[i] >> y[i]; } vector<int> dp(n + 1, INT_MIN), pref(n + 1, INT_MIN); dp[0] = 0; for (i = 1; i < (n + 1); i++) { dp[i] = 1 + pref[max(i - 2 * r, 0)]; for (j = max(0, i - 2 * r + 1); j < (i); j++) { if (t[i] - t[j] >= abs(x[i] - x[j]) + abs(y[i] - y[j])) { dp[i] = max(dp[i], dp[j] + 1); } } pref[i] = max({dp[i], pref[i - 1], 0}); } cout << pref[n] << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, m, a; cin >> n >> m; int l = 1, mx = 0; for (int i = 0; i < n; i++) { cin >> a; if ((a + m - 1) / m >= mx) { mx = (a + m - 1) / m; l = i + 1; } } cout << l << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long const M = 2000 + 10, M2 = 1e7 + 10, mod = 1e9 + 7, inf = 1e9 + 10, sq = 450; long long a[M][M], ro[M], col[M], all[M]; int32_t main() { long long n, ans = 0; cin >> n; for (long long i = 1; i <= n; i++) { string x; cin >> x; for (long long j = 0; j < x.size(); j++) { a[i][j + 1] = x[j] - 0 ; } } for (long long i = 1; i <= n; i++) { for (long long j = n; j > i; j--) { long long good = col[j] xor ro[i]; long long need = good xor a[i][j]; ro[i] = ro[i] xor need; all[i] = all[i] xor need; col[j] = col[j] xor need; all[j] = all[j] xor need; ans += need; } } for (long long i = 1; i <= n; i++) col[i] = 0, ro[i] = 0; for (long long i = n; i >= 1; i--) { for (long long j = 1; j < i; j++) { long long good = col[j] xor ro[i]; long long need = good xor a[i][j]; ro[i] = ro[i] xor need; all[i] = all[i] = all[i] xor need; col[j] = col[j] xor need; all[j] = all[j] xor need; ans += need; } } for (long long i = 1; i <= n; i++) { ans += all[i] xor a[i][i]; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; long long a[n], b[m]; for (long long i = 0; i < n; ++i) { cin >> a[i]; } for (long long i = 0; i < m; ++i) { cin >> b[i]; } long long ans = INF; for (long long i = 0; i < n; ++i) { long long res = -INF; for (long long j = 0; j < n; ++j) { if (i != j) { for (long long k = 0; k < m; ++k) { res = max(res, a[j] * b[k]); } } } ans = min(ans, res); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, x[maxn], y[maxn]; int solve(set<pair<int, int> >& a, set<pair<int, int> >& b) { set<pair<int, int> >::iterator itl = a.begin(), itd = b.begin(), it1; set<pair<int, int> >::reverse_iterator itr = a.rbegin(), itu = b.rbegin(), it2; set<pair<int, int> > f, s; bool chk = false; for (int i = 0; i < a.size() - 1; ++i) { if (next(itl)->first > itl->first + 1) { chk = true; for (it1 = a.begin(); it1 != next(itl); ++it1) { f.insert({x[it1->second], it1->second}); } } else if (next(itd)->first > itd->first + 1) { chk = true; for (it1 = b.begin(); it1 != next(itd); ++it1) { f.insert({x[it1->second], it1->second}); } } else if (next(itr)->first + 1 < itr->first) { chk = true; for (it2 = a.rbegin(); it2 != next(itr); ++it2) { f.insert({x[it2->second], it2->second}); } } else if (next(itu)->first + 1 < itu->first) { chk = true; for (it2 = b.rbegin(); it2 != next(itu); it2++) { f.insert({x[it2->second], it2->second}); } } if (chk) { for (auto u : f) { s.insert({y[u.second], u.second}); b.erase({y[u.second], u.second}); a.erase(u); } return solve(a, b) + solve(f, s); } itl++; itr++; itd++; itu++; } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; set<pair<int, int> > xs, ys; for (int i = 0; i < n; ++i) { cin >> x[i] >> y[i]; xs.insert({x[i], i}); ys.insert({y[i], i}); } cout << solve(xs, ys); return 0; } |
#include <bits/stdc++.h> int main() { int t = 1, i, j, n; long long int p, q, temp, arr[90]; for (j = 0; j < t; j++) { scanf( %lld %lld , &p, &q); scanf( %d , &n); for (i = 0; i < n; i++) scanf( %lld , &arr[i]); for (i = 0; i < n; i++) { if (p / q < arr[i]) { printf( NO n ); break; } p = p - (q * arr[i]); if (p == 0 && i != n - 1) { printf( NO n ); break; } if (i != n - 1) { temp = p; p = q; q = temp; } } if (p == 0 && i == n) printf( YES n ); else if (i == n) printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int bits = 1000; bitset<bits> node[4 * 100060]; long long int leftOver[4 * 100060]; int n; int treeSize[100060]; vector<int> adj[100060]; int dfsOrder[100060]; int o = 1; void dfs(int curr = 1, int par = -1) { treeSize[curr] = 1; dfsOrder[curr] = o++; for (int nxt : adj[curr]) { if (nxt != par) { dfs(nxt, curr); treeSize[curr] += treeSize[nxt]; } } } int m; bitset<bits> rotate(std::bitset<bits> b, unsigned k) { b = b << (k) | b >> (m - (k)); b = b | (b >> m); return b; } void build(int pos, int bit, int id = 1, int l = 1, int r = n) { if (l == r) { node[id][bit] = 1; return; } int mid = (l + r) >> 1; if (pos <= mid) build(pos, bit, id << 1, l, mid); else build(pos, bit, (id << 1) + 1, mid + 1, r); node[id] = node[id << 1] | node[(id << 1) + 1]; } void push(int id) { if (leftOver[id] > 0) { leftOver[id << 1] = (leftOver[id] + leftOver[id << 1]) % m; leftOver[(id << 1) + 1] = (leftOver[id] + leftOver[(id << 1) + 1]) % m; leftOver[id] = 0; } } void add(int val, int L, int R, int id = 1, int l = 1, int r = n) { if (L <= l && r <= R) { leftOver[id] = (leftOver[id] + val) % m; return; } push(id); int mid = (l + r) >> 1; if (L <= mid) add(val, L, R, id << 1, l, mid); if (R > mid) add(val, L, R, (id << 1) + 1, mid + 1, r); node[id] = rotate(node[id << 1], leftOver[id << 1]) | rotate(node[(id << 1) + 1], leftOver[(id << 1) + 1]); } bitset<bits> ans; void query(int qL, int qR, int id = 1, int l = 1, int r = n) { if (qL <= l && qR >= r) { ans = ans | rotate(node[id], leftOver[id]); return; } push(id); int mid = (l + r) >> 1; if (qL <= mid) query(qL, qR, id << 1, l, mid); if (qR > mid) query(qL, qR, (id << 1) + 1, mid + 1, r); node[id] = rotate(node[id << 1], leftOver[id << 1]) | rotate(node[(id << 1) + 1], leftOver[(id << 1) + 1]); } vector<int> primes; vector<int> sieve(int limit) { vector<int> primes; bool in[limit + 1]; memset(in, true, sizeof(in)); for (int i = 2; i <= limit; i++) { if (in[i]) { primes.push_back(i); for (int j = i; j <= limit; j += i) in[j] = false; } } return primes; } int a[100060]; int aTemp[100060]; int addBrute(int l, int r, int x) { for (int i = l; i < r + 1; i++) a[i] = (a[i] + x) % m; } bitset<bits> findBrute(int l, int r) { bitset<bits> temp = 0; for (int i = l; i < r + 1; i++) temp[a[i] % m] = 1; return temp; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int q; cin >> n >> m; primes = sieve(m); for (int i = 0; i < n; i++) cin >> a[i + 1]; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } dfs(); for (int i = 0; i < n; i++) { build(dfsOrder[i + 1], a[i + 1] % m); } for (int i = 1; i < n + 1; i++) { aTemp[dfsOrder[i]] = a[i]; } for (int i = 1; i < n + 1; i++) { a[i] = aTemp[i]; } cin >> q; for (int i = 0; i < q; i++) { int t, v; cin >> t >> v; if (t == 1) { int x; cin >> x; add(x % m, dfsOrder[v], dfsOrder[v] + treeSize[v] - 1); } else { ans = 0; query(dfsOrder[v], dfsOrder[v] + treeSize[v] - 1); int k = 0; for (int j = 0; j < primes.size(); j++) { if (primes[j] < m) { if (ans[primes[j]]) { k++; } } } cout << k << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; struct seg { vector<int> t; int n; seg(int n = 0) : t(2 * n), n(n) {} int query(int l, int r) { int ans = 0; for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l & 1) ans += t[l++]; if (r & 1) ans += t[--r]; } return ans; } void update(int p, int v) { for (t[p += n] += v; p > 1; p >>= 1) { t[p >> 1] = t[p] + t[p ^ 1]; } } }; seg s[4][11][10]; void modify(int p, int c, int m) { for (int i = 1; i <= 10; i++) { s[c][i][p % i].update(p, m); } } void convert(string& s) { for (char& c : s) { switch (c) { case A : c = 0; break; case T : c = 1; break; case C : c = 2; break; case G : c = 3; break; } } } int main() { string k; cin >> k; convert(k); for (int i = 0; i < 4; i++) { for (int j = 1; j <= 10; j++) { for (int l = 0; l < j; l++) { s[i][j][l] = seg(k.size()); } } } for (int i = 0; i < k.size(); i++) { modify(i, k[i], 1); } int q; cin >> q; while (q--) { int op; cin >> op; if (op == 1) { int x; string c; cin >> x >> c; convert(c); x--; modify(x, k[x], -1); k[x] = c[0]; modify(x, k[x], 1); } else { int l, r; cin >> l >> r; l--; string e; cin >> e; convert(e); int a = 0; for (int i = l; i < l + e.size(); i++) { a += s[e[i - l]][e.size()][i % e.size()].query(l, r); } cout << a << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1}; const int d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1}; void DBG() { cout << ] << endl; } template <class H, class... T> void DBG(H h, T... t) { cout << to_string(h); if (sizeof...(t)) cout << , ; DBG(t...); } template <class T> bool umin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool umax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } int n; vector<pair<long long, long long>> cards[(long long)(200002)], need[(long long)(200002)]; vector<array<long long, 3>> valid[(long long)(200002)]; void prepare() { for (int i = (1), _c = (n); i <= _c; ++i) { vector<int> cnt(4, 0); sort((cards[i]).begin(), (cards[i]).end(), [](pair<long long, long long> a, pair<long long, long long> b) { return a.first < b.first || (a.first == b.first && a.second > b.second); }); for (auto j : cards[i]) { if (j.first == 1 && cnt[j.first] >= 3) continue; if (j.first == 2 && cnt[j.first] >= 1) continue; if (j.first == 3 && cnt[j.first] >= 1) continue; need[i].push_back(j); ++cnt[j.first]; } } for (int i = (1), _c = (n); i <= _c; ++i) { for (int j = (0), _c = ((1ll << (((int)((need[i]).size())))) - 1); j <= _c; ++j) { long long cost = 0, ma = 0, dame = 0; for (int k = (0), _c = (((int)((need[i]).size())) - 1); k <= _c; ++k) { if ((((j) >> (k)) & 1ll)) { cost += need[i][k].first; dame += need[i][k].second; umax(ma, need[i][k].second); } } if (cost <= 3) { int bonus = __builtin_popcountll(j); valid[i].push_back({bonus, dame, ma}); } } } } long long dp[(long long)(200002)][11]; void test_case() { cin >> n; for (int i = (1), _c = (n); i <= _c; ++i) { int k; cin >> k; cards[i].assign(k, {0, 0}); for (int j = (0), _c = (k - 1); j <= _c; ++j) cin >> cards[i][j].first >> cards[i][j].second; } prepare(); for (auto i : valid[1]) umax(dp[1][i[0]], i[1]); for (int i = (1), _c = (n - 1); i <= _c; ++i) for (int j = (0), _c = (10); j <= _c; ++j) if (dp[i][j] || j == 0) { for (auto k : valid[i + 1]) { int nxtNum = j + k[0]; if (nxtNum < 10) umax(dp[i + 1][nxtNum], dp[i][j] + k[1]); else umax(dp[i + 1][nxtNum % 10], dp[i][j] + k[1] + k[2]); } } long long ans = 0; for (int i = (0), _c = (10); i <= _c; ++i) umax(ans, dp[n][i]); cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); auto time = clock(); int test = 1; while (test--) { test_case(); } cerr << [It took << fixed << setprecision(3) << double(clock() - time) / CLOCKS_PER_SEC << s] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void Get(int &T) { char C; bool F = 0; for (; C = getchar(), C < 0 || C > 9 ;) if (C == - ) F = 1; for (T = C - 0 ; C = getchar(), C >= 0 && C <= 9 ; T = T * 10 + C - 0 ) ; F && (T = -T); } int N; void Init() { Get(N); } int T[55][55]; void Mul(int A[][55], int B[][55], int N, int K, int M) { for (int i = 1; i <= N; i++) for (int j = 1; j <= M; j++) { T[i][j] = 0; for (int k = 1; k <= K; k++) (T[i][j] ^= (A[i][k] & B[k][j])); } for (int i = 1; i <= N; i++) for (int j = 1; j <= M; j++) A[i][j] = T[i][j]; } int A[55][55]; int B[55][55]; int T2[55][55]; void Pow(int X[][55], long long P) { for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) T2[i][j] = (i == j); for (; P; P >>= 1) { if (P & 1) Mul(T2, X, N, N, N); Mul(X, X, N, N, N); } for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) X[i][j] = T2[i][j]; } long long Factor[100005]; int FactorTop; bool I() { for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) if (B[i][j] != (i == j)) return 0; return 1; } bool Check() { for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) B[i][j] = A[i][j]; Pow(B, (1ll << N) - 1); int Ans = I(); if (Ans == 0) return 0; for (int k = 1; k <= FactorTop; k++) { for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) B[i][j] = A[i][j]; Pow(B, ((1ll << N) - 1) / Factor[k]); int Ans = I(); if (Ans == 1) return 0; } return 1; } void Debug() { FactorTop = 0; long long X = 1ll << N; X--; Factor[0] = 1; for (long long i = 2; i * i <= X; i++) { for (;; X /= i) { if (X % i != 0) break; Factor[++FactorTop] = i; } } if (X > 1) Factor[++FactorTop] = X; for (int i = 1; i < N; i++) A[i + 1][i] = 1; for (;;) { for (int i = 1; i <= N; i++) A[i][N] = rand() & 1; int Ans = Check(); if (Ans) break; } } void Work() { Debug(); } void Output() { for (int i = N; i >= 1; i--) printf( %d , A[i][N]); puts( ); for (int i = N; i >= 1; i--) printf( %d , 1); puts( ); } int main() { srand(time(0)); Init(); Work(); Output(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long t; long long n; long long tmp; long long gcd(long long a, long long b) { long long temp; if (a < b) { temp = a; a = b; b = temp; } while (b != 0) { temp = a % b; a = b; b = temp; } return a; } long long lcm(long long a, long long b) { long long temp_lcm; temp_lcm = a * b / gcd(a, b); return temp_lcm; } int main() { cin >> t; while (t--) { cin >> n; if (n % 2 == 0) { long long a, b; tmp = n / 2; while (tmp--) { cin >> a >> b; cout << b << << -a << ; } cout << endl; } else { long long a, b, c; tmp = (n - 2) / 2; while (tmp--) { cin >> a >> b; cout << b << << -a << ; } cin >> a >> b >> c; tmp = lcm(a, b); tmp = lcm(tmp, c); cout << tmp / a << << tmp / b << << -2 * tmp / c; cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int max = 0, min = 0; int a[m], b[m]; for (int i = 0; i < m; i++) { cin >> a[i]; b[i] = a[i]; } sort(a, a + m, greater<int>()); for (int i = 0; i < n; i++) { if (a[0] != 0) { max = max + a[0]; a[0] = a[0] - 1; sort(a, a + m, greater<int>()); } else { break; } } sort(b, b + m); int i = 0, k = 0; while (i != n) { if (b[k] != 0) { min = min + b[k]; b[k] = b[k] - 1; } else { k++; min = min + b[k]; b[k] = b[k] - 1; } i++; } cout << max << << min; return 0; } |
#include <bits/stdc++.h> using namespace std; bool isPrime[1000005] = {false}; vector<long long int> SPF(1000005); long long int fastPower(long long int a, long long int b) { if (b == 0) return 1; long long int prod = 1; while (b > 0) { if (b & 1) prod = prod * a; b = b >> 1; a = a * a; } return prod; } void sieve() { int i; for (i = 2; i < 1000005; ++i) isPrime[i] = 1; for (i = 2; i * i < 1000005; ++i) { if (isPrime[i]) { for (int j = i * i; j < 1000005; j += i) isPrime[j] = 0; } } } void printa(bool f) { if (f) cout << YES ; else cout << NO ; cout << n ; } bool flip(bool f) { if (f) return 0; return 1; } void solve() { long long int i, n; cin >> n; vector<long long int> a(n); for (i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); long long int s = 0, m = a[n - 1]; for (i = 0; i < n - 1; ++i) s += a[i]; cout << abs(m - s) + 1 << n ; } int main() { int tc = 1; while (tc--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int m, n, p, count = 0; cin >> m >> n; if (m % n == 0) cout << m / n; else { count = count + (m / n); m = m % n; for (;;) { if (m > n) { if (m % n == 0) { count += m / n; break; } m = m - n; count++; } else if (n > m) { if (n % m == 0) { count += n / m; break; } n = n - m; count++; } } cout << count; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5; const int MAXM = 20; int n, m; int a[MAXN], b[MAXM]; int num[MAXM]; char ans[MAXN][MAXM]; set<int> states[MAXM]; int getState(int mask, int num[MAXM]) { int res = mask; for (int i = 0; i < n; ++i) { res = res * MAXN + num[i]; } return res; } bool dfs(int j, int lastState = 0) { if (j == m) { for (int i = 0; i < n; ++i) { if (num[i] != a[i]) { return false; } } return true; } if (j) { if (states[j].find(lastState) != states[j].end()) { return false; } states[j].insert(lastState); } int origin[MAXM]; memcpy(origin, num, sizeof(num)); for (int k = 0; k < (1 << n); ++k) { int cnt = 0; for (int i = 0; i < n; ++i) { if (k & (1 << i)) { ans[i][j] = * ; if (i == 0 || ans[i - 1][j] == . ) { ++cnt; } } else { ans[i][j] = . ; } } if (cnt != b[j]) { continue; } for (int i = 0; i < n; ++i) { if (ans[i][j] == * ) { if (j == 0 || ans[i][j - 1] == . ) { ++num[i]; } } } bool valid = true; for (int i = 0; i < n; ++i) { if (num[i] > a[i]) { valid = false; break; } if (ans[i][j] == * ) { if (a[i] - num[i] > (m - j - 1) / 2) { valid = false; break; } } else { if (a[i] - num[i] > (m - j) / 2) { valid = false; break; } } } if (valid) { if (dfs(j + 1, getState(k, num))) { return true; } } memcpy(num, origin, sizeof(origin)); } return false; } int main() { while (cin >> n >> m) { for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < m; ++i) { cin >> b[i]; } for (int i = 0; i < n; ++i) { states[i].clear(); } memset(num, 0, sizeof(num)); dfs(0); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << ans[i][j]; } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100500; const int INF = 2 * (1e9); int n, m; vector<pair<int, int> > edge[N]; vector<pair<int, int> > delay[N]; int dist[N]; int main() { cin.sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < m; i++) { int from, to, len; cin >> from >> to >> len; from--; to--; edge[from].push_back(make_pair(to, len)); edge[to].push_back(make_pair(from, len)); } for (int i = 0; i < n; i++) { int num; cin >> num; int cur; for (int j = 0; j < num; j++) { cin >> cur; if (j == 0 or delay[i].back().second != cur) delay[i].push_back(make_pair(cur, cur + 1)); else delay[i].back().second++; } } for (int i = 0; i < n; i++) dist[i] = INF; dist[0] = 0; if (delay[0].size() >= 1 and delay[0][0].first == 0) dist[0] = delay[0][0].second; set<pair<int, int> > dijkstra; dijkstra.insert(make_pair(dist[0], 0)); for (int i = 0; i < n; i++) { if (dijkstra.empty()) break; pair<int, int> now = *dijkstra.begin(); dijkstra.erase(now); for (const pair<int, int> &next : edge[now.second]) { int arrival = next.first; int tm = next.second + now.first; int idx = lower_bound(delay[arrival].begin(), delay[arrival].end(), make_pair(tm, INF)) - delay[arrival].begin(); if (idx > 0 and arrival != n - 1) { idx--; if (delay[arrival][idx].first <= tm and tm < delay[arrival][idx].second) tm = delay[arrival][idx].second; } if (dist[arrival] > tm) { dijkstra.erase(make_pair(dist[arrival], arrival)); dist[arrival] = tm; dijkstra.insert(make_pair(dist[arrival], arrival)); } } } if (dist[n - 1] == INF) dist[n - 1] = -1; cout << dist[n - 1] << endl; return 0; } |
#include <cstdio> #include <vector> #include <cstring> #include <algorithm> const int Maxn=200000; const int Inf=0x3f3f3f3f; int n; int a[Maxn+5]; std::vector<int> v_lis[Maxn+5]; struct Segment_Tree{ struct Segment_Node{ int minn,maxn; int lazy; }seg[Maxn<<2|5]; void update_tag(int root,int a){ seg[root].lazy+=a; seg[root].minn+=a,seg[root].maxn+=a; } void push_up(int root){ seg[root].minn=std::min(seg[root<<1].minn,seg[root<<1|1].minn); seg[root].maxn=std::max(seg[root<<1].maxn,seg[root<<1|1].maxn); } void push_down(int root){ if(seg[root].lazy==0){ return; } update_tag(root<<1,seg[root].lazy); update_tag(root<<1|1,seg[root].lazy); seg[root].lazy=0; } void update(int l,int r,int v,int root=1,int left=0,int right=n){ if(l>right||r<left){ return; } if(l<=left&&r>=right){ update_tag(root,v); return; } push_down(root); int mid=(left+right)>>1; update(l,r,v,root<<1,left,mid); update(l,r,v,root<<1|1,mid+1,right); push_up(root); } int query_min(int l,int r,int root=1,int left=0,int right=n){ if(l>right||r<left){ return Inf; } if(l<=left&&r>=right){ return seg[root].minn; } push_down(root); int mid=(left+right)>>1; return std::min(query_min(l,r,root<<1,left,mid),query_min(l,r,root<<1|1,mid+1,right)); } int query_max(int l,int r,int root=1,int left=0,int right=n){ if(l>right||r<left){ return -Inf; } if(l<=left&&r>=right){ return seg[root].maxn; } push_down(root); int mid=(left+right)>>1; return std::max(query_max(l,r,root<<1,left,mid),query_max(l,r,root<<1|1,mid+1,right)); } }seg_1,seg_2; int ans[Maxn+5]; int main(){ scanf( %d ,&n); for(int i=1;i<=n;i++){ scanf( %d ,&a[i]); v_lis[a[i]].push_back(i); } for(int i=1;i<=n;i++){ seg_1.update(i>>1,(n-1)>>1,1); seg_2.update((i+1)>>1,n>>1,1); } for(int i=1;i<=n;i++){ for(int j=0;j<(int)v_lis[i].size();j++){ int pos=v_lis[i][j]; int pos_1_max=seg_1.query_max(pos>>1,(n-1)>>1); int pos_1_min=seg_1.query_min(0,(pos>>1)-1); int pos_2_max=seg_2.query_max((pos+1)>>1,n>>1); int pos_2_min=seg_2.query_min(0,(pos-1)>>1); ans[pos]=std::max(std::max((pos_2_max-pos_2_min)>>1,(pos_1_max-pos_1_min)>>1), std::max((pos_2_max-pos_1_min-1)>>1,(pos_1_max-pos_2_min-1)>>1)); } for(int j=0;j<(int)v_lis[i].size();j++){ seg_1.update(v_lis[i][j]>>1,(n-1)>>1,-2); seg_2.update((v_lis[i][j]+1)>>1,n>>1,-2); } for(int j=0;j<(int)v_lis[i].size();j++){ int pos=v_lis[i][j]; int pos_1_min=seg_1.query_min(pos>>1,(n-1)>>1); int pos_1_max=seg_1.query_max(0,(pos>>1)-1); int pos_2_min=seg_2.query_min((pos+1)>>1,n>>1); int pos_2_max=seg_2.query_max(0,(pos-1)>>1); ans[pos]=std::max(ans[pos],std::max( std::max((pos_2_max-pos_2_min)>>1,(pos_1_max-pos_1_min)>>1)-1, std::max((pos_2_max-pos_1_min-1)>>1,(pos_1_max-pos_2_min-1)>>1))); } } for(int i=1;i<=n;i++){ printf( %d ,ans[i]); } puts( );; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> V[100005]; int main() { int N, M, K, ans = 1; scanf( %d%d%d , &N, &M, &K); for (int i = 1; i <= N; ++i) { int c; scanf( %d , &c); V[c].push_back(i); } for (int c = 1; c <= M; ++c) { int L = V[c].size(), rem = 0, st = 0; for (int j = 1; j < L; ++j) { rem += V[c][j] - V[c][j - 1] - 1; while (rem > K) { rem -= V[c][st + 1] - V[c][st] - 1; ++st; } ans = max(ans, j - st + 1); } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; using namespace std; int main() { string s; cin >> s; string h = s.substr(0, 2); int hour = atoi(h.c_str()); string m = s.substr(3, 2); int minute = atoi(m.c_str()); long long time = 60 * hour + minute; long long add; cin >> add; long long sum = time + add; long long n = sum % (24 * 60); cout << setfill( 0 ) << setw(2) << right << (n / 60); cout << : ; cout << setfill( 0 ) << setw(2) << right << (n % 60) << endl; ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[7]; int b[7]; int main() { string s; int k; cin >> s >> k; int kol = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == 0 ) { kol++; } } if (kol < k) { cout << s.length() - 1; } else { kol = 0; int res = 0; for (int i = s.length() - 1; i >= 0; i--) { if (s[i] == 0 ) { kol++; } else { res++; } if (kol == k) { cout << res; return 0; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; char s1[5010], s2[5010], str[5010]; int num[30]; int len1, len2; int dfs(int k, int m) { if (!s1[k]) return m; for (int i = 0; i < 26; i++) if (num[i] && (m || (i >= s2[k] - a ))) { str[k] = i + a ; num[i]--; if (dfs(k + 1, m || (i > s2[k] - a ))) return 1; num[i]++; } return 0; } int main() { while (EOF != scanf( %s %s , s1, s2)) { memset(num, 0, sizeof(num)); len1 = strlen(s1), len2 = strlen(s2); for (int i = 0; i < len1; i++) num[s1[i] - a ]++; if (!dfs(0, 0)) printf( -1 n ); else { printf( %s n , str); } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Rectangle { int x1; int x2; int y1; int y2; Rectangle() {} Rectangle(int a, int b, int c, int d) { x1 = a; y1 = b; x2 = c; y2 = d; if (x1 > x2) { swap(x1, x2); } if (y1 > y2) { swap(y1, y2); } } bool operator<(Rectangle r) const { if (x1 != r.x1) { return x1 < r.x1; } else if (x2 != r.x2) { return x2 < r.x2; } else if (y1 != r.y1) { return y1 < r.y1; } else { return y2 < r.y2; } } }; int Area(Rectangle r) { return (r.x2 - r.x1) * (r.y2 - r.y1); } set<Rectangle> rec; set<Rectangle> lines; int main() { int W, H, N; scanf( %d , &W); ; scanf( %d , &H); ; scanf( %d , &N); ; rec.insert(Rectangle(0, 0, W, H)); for (int(n) = 0; n < (int)N; n++) { int a, b, c, d; scanf( %d , &a); ; scanf( %d , &b); ; scanf( %d , &c); ; scanf( %d , &d); ; lines.insert(Rectangle(a, b, c, d)); } for (int(n) = 0; n < (int)N; n++) { for (__typeof(rec).begin() t = rec.begin(); t != rec.end(); t++) { Rectangle r = *t; for (__typeof(lines).begin() it = lines.begin(); it != lines.end(); it++) { if (it->x1 == it->x2) { if (r.x1 < it->x1 && it->x2 < r.x2 && r.y1 == it->y1 && r.y2 == it->y2) { lines.erase(lines.find(*it)); rec.erase(*t); rec.insert(Rectangle(r.x1, r.y1, it->x2, r.y2)); rec.insert(Rectangle(it->x2, r.y1, r.x2, r.y2)); goto end; } } else if (it->y1 == it->y2) { if (r.y1 < it->y1 && it->y2 < r.y2 && r.x1 == it->x1 && r.x2 == it->x2) { lines.erase(lines.find(*it)); rec.erase(*t); rec.insert(Rectangle(r.x1, r.y1, r.x2, it->y1)); rec.insert(Rectangle(r.x1, it->y1, r.x2, r.y2)); goto end; } } } } end: int sol = 42; } vector<int> res; for (__typeof(rec).begin() it = rec.begin(); it != rec.end(); it++) { res.push_back(Area(*it)); } sort(res.begin(), res.end()); for (__typeof(res).begin() it = res.begin(); it != res.end(); it++) { printf( %d , *it); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e3 + 10; long long q, x, v, u, w, ans; map<long long, long long> len; int main() { cin >> q; for (int i = 1; i <= q; i++) { cin >> x >> v >> u; if (x == 1) { cin >> w; while (v != u) { if (v > u) { len[v] += w; v = v / 2; } else { len[u] += w; u = u / 2; } } } else { ans = 0; while (v != u) { if (v > u) { ans += len[v]; v = v / 2; } else { ans += len[u]; u = u / 2; } } cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000000ll; long long x[6], y[6]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> x[i] >> y[i]; if (n == 1) { cout << -1 << endl; return 0; } if (n == 2) { if (x[0] == x[1] || y[0] == y[1]) { cout << -1 << endl; return 0; } long long s = (abs(x[0] - x[1]) * abs(y[0] - y[1])); cout << s << endl; return 0; } long long X = 0, Y = 0; for (int i = 1; i < n; i++) { X = max(X, abs(x[0] - x[i])); Y = max(Y, abs(y[0] - y[i])); } cout << X * Y << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)3e5 + 7; char read_char() { char c; for (;;) { c = getchar(); if (c >= A && c <= Z ) return c; } } long long powmod(long long a, long long b) { long long res = 1; a %= MOD; for (; b; b >>= 1) { if (b & 1) res = res * a % MOD; a = a * a % MOD; } return res; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long add(long long a, long long b) { a = ((a + b) % MOD + MOD) % MOD; return a; } long long mul(long long a, long long b) { return a * b % MOD; } int n, p, cnt[N], tmp[N]; pair<int, int> a[N]; void Init() { memset(cnt, 0, sizeof(cnt)); for (int i = (0); i < (n); ++i) { int u, v; scanf( %d%d , &u, &v); if (u > v) swap(u, v); a[i].first = u, a[i].second = v; cnt[u]++; cnt[v]++; } for (int i = (1); i < (n + 1); ++i) tmp[i] = cnt[i]; sort(tmp + 1, tmp + n + 1); sort(a, a + n); } int Solve() { long long ans = 0; for (int i = n, j = 1; j < i; i--) { while (tmp[j] + tmp[i] < p && j < i) j++; ans += i - j; } for (int i = 0, j; i < n; i = j) { j = i + 1; while (j < n && a[i] == a[j]) j++; int u = a[i].first, v = a[i].second; if (cnt[u] + cnt[v] >= p && cnt[u] + cnt[v] - (j - i) < p) { ans--; } } return !printf( %lld n , ans); } int main() { while (~scanf( %d%d , &n, &p)) { Init(); Solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> s; long long n, b[500005], c[500005]; int main() { cin >> n; for (int i = 0; i < n; i++) { long long x; cin >> x; s[x]++; } long long m, mx1 = 0, mx2 = 0, index = 1; cin >> m; for (int i = 0; i < m; i++) { cin >> b[i]; } for (int i = 0; i < m; i++) { cin >> c[i]; } for (int i = 0; i < m; i++) { if (s[b[i]] > mx1) { mx1 = s[b[i]]; index = i + 1; } } for (int i = 0; i < m; i++) { if (s[b[i]] == mx1) { if (s[c[i]] > mx2) { index = i + 1; mx2 = s[c[i]]; } } } cout << index << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1010; const double EPS = 0.0000001; struct Point { int x, y; Point() {} Point(int a, int b) : x(a), y(b) {} }; int n; long long k; Point centers[MAX_N]; int radii[MAX_N]; double GetDist(int x1, int y1, int x2, int y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); } void AddEvents(vector<pair<double, int> > &events, double ang1, double ang2) { for (int i = 0; i < 3; ++i) { events.push_back(make_pair(ang1 + i * 2 * M_PI + EPS, 1)); events.push_back(make_pair(ang2 + i * 2 * M_PI - EPS, -1)); } } int main() { cin >> n >> k; for (int i = 1; i <= n; ++i) { int x, y; cin >> x >> y >> radii[i]; centers[i] = Point(x, y); } int best = 0; for (int i = 1; i <= n; ++i) { vector<pair<double, int> > events; int cnt = 0; for (int j = 1; j <= n; ++j) { if (i != j) { double ang = atan2(centers[j].y - centers[i].y, centers[j].x - centers[i].x); double d = GetDist(centers[i].x, centers[i].y, centers[j].x, centers[j].y); double u1 = asin((radii[i] - radii[j]) / d); double u2 = asin((radii[i] + radii[j]) / d); AddEvents(events, ang + u1 - M_PI / 2, ang + u2 - M_PI / 2); AddEvents(events, ang - u2 + M_PI / 2, ang - u1 + M_PI / 2); } } sort(events.begin(), events.end()); for (size_t j = 0; j < events.size(); ++j) { cnt += events[j].second; if (cnt < 0) { cnt = 0; } best = max(best, cnt); } } long long sol = k * (k + 1) / 2 + (k + 1) * best + (n - best); cout << sol << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long calc(const long long &x, const long long &pow, const long long &pp) { long long res = 1, tmp = (x % pp); long long cur = pow; while (cur > 0) { if (cur % 2 == 0) { tmp = (tmp * tmp) % pp; cur = cur / 2; } else { res = (res * tmp) % pp; cur = cur - 1; } } return res; } int obr() { long long k, l, r, p; cin >> k >> l >> r >> p; long long ans; if (p == 2) { cout << (1 - (k % 2)) << endl; return 0; } if (k == 1) ans = 2 % p; else { long long st_l = calc(2, l, p - 1), st_r = calc(2, r + 1, p - 1); long long rev_2 = (p + 1) / 2; long long ch = (calc(k, st_r, p) + p - 1) % p; long long zn = (calc(k, st_l, p) + p - 1) % p; if (k % p == 0) zn = ch = p - 1; if (zn == 0) { ch = calc(2, r - l + 1, p); } else { zn = calc(zn, p - 2, p); ch = (ch * zn) % p; } if (k % 2) { long long to_div = calc(rev_2, r - l, p); ch = (ch * to_div) % p; } ans = ch; } cout << ans << endl; return 0; } int main() { ios_base::sync_with_stdio(false); int t; cin >> t; for (int i = 1; i <= t; ++i) obr(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int x[500010], y[500010]; bitset<2010 * 2> A[2010]; void Work() { for (int i = 1; i <= n; i++) { int t = i; for (int j = i + 1; j <= n; j++) if (A[j][i]) t = j; swap(A[i], A[t]); for (int j = 1; j <= n; j++) if (A[j][i] && j != i) A[j] ^= A[i]; } for (int i = 1; i <= m; i++) if (A[y[i]][x[i] + n]) puts( NO ); else puts( YES ); } void Init() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d , &x[i], &y[i]); A[x[i]][y[i]] = 1; } for (int i = 1; i <= n; i++) A[i][i + n] = 1; } int main() { Init(); Work(); return 0; } |
#include <bits/stdc++.h> const int MAXN = 60; int n, P, A[MAXN]; const int mod = 1000000007; void reduce(int& x) { x += x >> 31 & mod; } int mul(int a, int b) { return (long long)a * b % mod; } int pow(int a, int b, int res = 1) { for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; } int dp[MAXN][MAXN][MAXN]; int main() { std::ios_base::sync_with_stdio(false), std::cin.tie(0); std::cin >> n >> P; for (int i = 1; i <= n; ++i) std::cin >> A[i]; dp[0][0][0] = 1; for (int i = 1; i <= n; ++i) for (int j = 0; j <= i; ++j) for (int k = 0; k <= i; ++k) if (dp[i - 1][j][k]) { if (A[i] == 0 || A[i] == -1) { int t = pow(2, i - 1 - (!!k), dp[i - 1][j][k]); reduce(dp[i][j + 1][k] += t - mod); if (k) reduce(dp[i][j][k] += t - mod); } if (A[i] == 1 || A[i] == -1) { int t = pow(2, i - 1 - (!!j), dp[i - 1][j][k]); reduce(dp[i][j][k + 1] += t - mod); if (j) reduce(dp[i][j][k] += t - mod); } } int ans = 0; for (int i = 0; i <= n; ++i) for (int j = 0; j <= n; ++j) if ((i + j & 1) == P) reduce(ans += dp[n][i][j] - mod); std::cout << ans << std::endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char s[200001], t1[200001]; long long n, x, y, t, con = 0; cin >> n >> x >> y; getchar(); gets(s); t = n - x; for (long long i = t; s[i] != 0 ; i++) { if (i == n - 1 - y && s[i] != 1 ) con++; if (i != n - 1 - y && s[i] != 0 ) con++; } cout << con << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k, r; cin >> k >> r; int n = 1; while (true) { if ((k * n - r) % 10 == 0 || (k * n) % 10 == 0) { cout << n << n ; return 0; } n++; } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c h, c n) { return {h, n}; } template <class c> auto dud(c* r) -> decltype(cerr << *r); template <class c> char dud(...); struct muu { template <class c> muu& operator<<(const c&) { return *this; } muu& operator()() { return *this; } }; const int N = 1e5 + 7; long long tab[N]; int n; long long inf = 1e18; void fail() { printf( No n ); exit(0); } int main() { scanf( %d , &n); for (int i = 2; i <= n; i += 2) scanf( %lld , tab + i); long long sum = 0; for (int i = 2; i <= n; i += 2) { long long nsum = inf; for (int d = 1; d * d <= tab[i]; ++d) { if (tab[i] % d == 0) { long long a = (tab[i] / d) - d; long long b = (tab[i] / d) + d; if (a % 2 == 0 && b % 2 == 0) { if (a * a > 4 * sum) { nsum = min(nsum, (b * b) / 4); } } } } (muu() << __FUNCTION__ << # << 67 << : ) << i << << nsum; if (nsum == inf) fail(); tab[i - 1] = nsum - sum - tab[i]; sum = nsum; } printf( Yes n ); for (int i = 1; i <= n; ++i) printf( %lld , tab[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 50; vector<int> e[N]; int dp[N], res, deg[N]; void dfs(int u, int pre) { dp[u] = deg[u]; for (int v : e[u]) { if (v == pre) continue; dfs(v, u); res = max(res, dp[u] + dp[v]); dp[u] = max(dp[u], dp[v] + deg[u] - 2 + 1); } } int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) e[i].clear(), deg[i] = 0; for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d%d , &u, &v); e[u].push_back(v); e[v].push_back(u); deg[u]++; deg[v]++; } res = 0; dfs(1, 0); printf( %d n , res); } } |
#include <bits/stdc++.h> using namespace std; int n, m; const int maxN = (int)1e6 + 10; vector<int> g[maxN]; int p[maxN]; int a[maxN]; long long s = 0; long long tr[maxN]; set<long long> all; void dfs(int v) { tr[v] = a[v]; for (int to : g[v]) { dfs(to); tr[v] += tr[to]; } if (s % tr[v] == 0) { all.insert(tr[v]); } } int val[maxN]; const int mod = (int)1e9 + 7; int sum(int a, int b) { int s = a + b; if (s >= mod) s -= mod; return s; } set<long long> ok; long long id[maxN]; long long sm[maxN]; map<long long, int> f; int dp[maxN]; int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; s += a[i]; } for (int i = 1; i < n; i++) { cin >> p[i]; g[p[i]].push_back(i + 1); } dfs(1); int sz = 1; int oth = 1; for (long long t : all) { memset(sm, 0, sizeof sm); bool can = true; for (int i = n; i >= 1; i--) { if (sm[i] + a[i] > t) { can = false; break; } if (sm[i] + a[i] == t) { continue; } if (i == 1) { can = false; break; } sm[p[i - 1]] += (sm[i] + a[i]); } if (can) { f[t] = oth; oth++; ok.insert(t); } } for (long long x : ok) { int id = f[x]; dp[id] = 1; for (long long y : ok) { if (y >= x) continue; if (x % y == 0) dp[id] = sum(dp[id], dp[f[y]]); } } cout << dp[f[s]]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)2e5 + 7; int tree[N << 1]; void update(int x, int n) { x += n; if (tree[x]) return; while (x) { tree[x]++; x >>= 1; } } int query(int l, int r, int n) { int re = 0; l += n, r += n; while (l <= r) { if (l & 1) re += tree[l++]; if (~r & 1) re += tree[r--]; l >>= 1, r >>= 1; } return re; } pair<int, int> p[N]; vector<int> x; int l[N]; int main() { int n; scanf( %d , &n); for (int i = (0); i < (n); ++i) { scanf( %d%d , &p[i].first, &p[i].second); x.push_back(p[i].first); } sort((x).begin(), (x).end()); sort(p, p + n); for (int i = (0); i < (n); ++i) { p[i].first = lower_bound((x).begin(), (x).end(), p[i].first) - x.begin(); swap(p[i].first, p[i].second); } sort(p, p + n); long long ans = 0; for (int i = n - 1, j; i >= 0; i = j) { for (j = i; j >= 0 && p[i].first == p[j].first; j--) ; int z = 0; for (int k = (j + 1); k < (i + 1); ++k) { l[k] = query(z, p[k].second - 1, n); update(p[k].second, n); z = p[k].second + 1; } for (int k = (j + 1); k < (i + 1); ++k) { ans += (long long)(l[k] + 1) * (query(p[k].second + 1, n, n) + 1); } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double l, p, q; cin >> l >> p >> q; double qq = l / (p + q) * p; cout << setiosflags(ios::fixed); cout << setprecision(4) << qq; } |
#include <bits/stdc++.h> using namespace std; long long exp(long long x, long long y) { x %= 1000000007; long long res = 1; while (y) { if (y & 1) res = res * x % 1000000007; x = x * x % 1000000007; y >>= 1; } return res; } long long fact(long long n) { long long res = 1; for (long long i = 2; i <= n; ++i) (res *= i) %= 1000000007; return res; } bool isprime(long long n) { for (long long i = 2; i * i <= n; ++i) if (n % i == 0) return 0; return 1; } int main() { int n, m; cin >> n >> m; const long long inf = 1e17; vector<long long> sum(n), pre(n), s(n); vector<long long> t(n); for (int i = 0; i < n; ++i) { int x; cin >> x; long long val = -inf; long long mx = -inf; vector<long long> v1, v2; for (int j = 0; j < x; ++j) { long long k; cin >> k; val = max(k, val + k); mx = max(mx, val); v1.push_back(k); v2.push_back(k); } t[i] = mx; for (int j = 1; j < x; ++j) v1[j] += v1[j - 1]; for (int j = x - 2; j >= 0; --j) v2[j] += v2[j + 1]; sum[i] = v1[x - 1]; pre[i] = *max_element(v1.begin(), v1.end()); s[i] = *max_element(v2.begin(), v2.end()); } long long to = -inf; vector<int> v(m + 1); for (int i = 1; i <= m; ++i) { cin >> v[i]; to = max(to, t[v[i] - 1]); } long long dp[m + 1][3]; memset(dp, 0, sizeof(dp)); for (int i = 1; i <= m; ++i) { dp[i][0] = s[v[i] - 1]; dp[i][1] = max(dp[i - 1][0] + sum[v[i] - 1], dp[i - 1][1] + sum[v[i] - 1]); dp[i][2] = max(dp[i - 1][0] + pre[v[i] - 1], dp[i - 1][1] + pre[v[i] - 1]); } long long ans = -inf; for (int i = 1; i <= m; ++i) ans = max(ans, dp[i][2]); cout << max(ans, to); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = -1; struct disk { long long L; double p; disk(long long L = 0, double p = 0.) : L(L), p(p) {} }; bool operator<(disk a, disk b) { return (a.L * a.p * (1 - b.p)) > (b.L * b.p * (1 - a.p)); } int n; vector<disk> P; int main() { while (cin >> n) { P.resize(n); for (int i = (0); i < (int)(n); i++) scanf( %lld %lf , &P[i].L, &P[i].p), P[i].p /= 100; sort(P.begin(), P.end()); double ans = 0., E = 0.; for (int i = ((int)n) - 1; i >= 0; i--) { disk D = P[i]; ans += D.L * (1 + E * D.p); E = D.p * E + (1 - D.p) * (E + 1); } printf( %.6f n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, n, now, ans, hh, m, p = 1000000009; int main() { scanf( %lld , &n); if (n == 2) { puts( 10 ); return 0; } m = n / 2; now = 4; hh = 1; for (i = 3; i <= m; i++) { now = now * 2 % p; hh = hh * (now - 3) % p; ans = (ans + hh) % p; } ans = ans * 4 + 6; ans %= p; ans = ans * ans % p; ans++; ans = ans * 2 % p; printf( %lld , ans); } |
#include <bits/stdc++.h> using namespace std; int m(int x, int md) { return (((x) % md) + md) % md; } void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; set<int> st; for (int r = 0; r < n; r++) { st.insert(m(r + a[r], n)); } if (st.size() == n) cout << YES n ; else cout << NO n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); int T; cin >> T; for (int testcase = 1; testcase <= T; testcase++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct event { int pos, type, p; event(int pos = 0, int type = -1, int p = 0) : pos(pos), type(type), p(p) {} bool operator<(const event &e) const { if (pos == e.pos) return type < e.type; return pos < e.pos; } }; const int maxE = 5e5 + 10; event E[maxE]; int cnt[111]; double fpow(double a, int n) { double r = 1; for (; n; n = n >> 1) { if (n & 1) r *= a; a = a * a; } return r; } int main() { memset((cnt), (0), sizeof(cnt)); int n, m, x, h, l, r, sz = 0, b, z; scanf( %d%d , &n, &m); for (int _n(n), i(0); i < _n; i++) { scanf( %d%d%d%d , &x, &h, &l, &r); l = 100 - l; r = 100 - r; E[sz++] = event(x - h, 0, l); E[sz++] = event(x, 0, -1 - l); E[sz++] = event(x + 1, 0, r); E[sz++] = event(x + h + 1, 0, -1 - r); } for (int _n(m), i(0); i < _n; i++) { scanf( %d%d , &b, &z); E[sz++] = event(b, z); } sort(E, E + sz); double expectation = 0, pro = 0; for (int _n(sz), i(0); i < _n; i++) { if (E[i].type == 0) { if (E[i].p >= 0) { cnt[E[i].p]++; } else cnt[-E[i].p - 1]--; } else { pro = 1; for (int _n(101), i(0); i < _n; i++) pro *= fpow(0.01 * i, cnt[i]); expectation += pro * E[i].type; } } printf( %.7f n , expectation); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100011; const long long INF = (1 << 29) + 123; const long long MOD = 1000000007; const long double PI = 4 * atan((long double)1); int fenw[2 * MAX_N]; int n; void mod(int i, int v) { while (i <= n) { fenw[i] += v; i += i & -i; } } int query(int i) { int sum = 0; while (i > 0) { sum += fenw[i]; i -= i & -i; } return sum; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; vector<pair<int, int> > p; int x[n], v[n]; for (int i = 0; i < n; i++) cin >> x[i]; for (int i = 0; i < n; i++) { cin >> v[i]; p.push_back(make_pair(v[i], x[i])); } unordered_map<int, int> m; int rev_map[n]; sort(x, x + n); for (int i = 0; i < n; i++) { m[x[i]] = i + 1; rev_map[i] = x[i]; } for (int i = 0; i < n; i++) { p[i].second = m[p[i].second]; } sort(p.begin(), p.end()); long long ans = 0; for (int i = 0; i < n; i++) { int q = query(p[i].second); ans += 1LL * q * rev_map[p[i].second - 1]; ans -= 1LL * ((n - i - 1) - (p[i].second - 1 - q)) * rev_map[p[i].second - 1]; mod(p[i].second, 1); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long V[10005], O[10005], F[1005][10005]; int c[1005], cost[1005]; int n, W, B, X; struct Queue { int p[1005], q[1005]; long long maxp[1005], maxq[1005]; void clear() { *p = 0; *q = 0; maxp[0] = maxq[0] = -1; } void add(int x) { q[++*q] = x; maxq[*q] = max(maxq[(*q) - 1], V[x]); } void del() { if (*p) --*p; else { for (; *q; --*q) ++*p, maxp[*p] = max(maxp[(*p) - 1], V[p[*p] = q[*q]]); --*p; } } long long ask() { return max(maxp[*p], maxq[*q]); } } G; int main() { scanf( %d%d%d%d , &n, &W, &B, &X); for (int i = 1; i <= n; i++) scanf( %d , &c[i]); for (int i = 1; i <= n; i++) scanf( %d , &cost[i]); memset(F, -1, sizeof(F)); F[0][0] = W; int sum = 0; for (int i = 1; i <= n; i++) { sum += c[i]; for (int j = 0; j <= sum; j++) { for (int k = max(j - c[i], 0); k <= j; k++) if (F[i - 1][k] >= 1ll * cost[i] * (j - k)) F[i][j] = max(F[i][j], F[i - 1][k] - 1ll * cost[i] * (j - k)); if (F[i][j] != -1) { F[i][j] += X; F[i][j] = min(F[i][j], W + 1ll * j * B); } } } for (int k = sum; k >= 0; k--) if (F[n][k] >= 0) { printf( %d n , k); return 0; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, p1 = 0, p2 = 0; cin >> n; int mid[1000], index = 0; for (int i = 0; i < n; i++) { int a; cin >> a; if (a % 2 == 0) { for (int j = 1; j <= (a / 2); j++) { int t; cin >> t; p1 += t; } for (int j = 1; j <= (a / 2); j++) { int t; cin >> t; p2 += t; } } else { for (int j = 1; j <= (a / 2); j++) { int t; cin >> t; p1 += t; } cin >> mid[index++]; for (int j = 1; j <= (a / 2); j++) { int t; cin >> t; p2 += t; } } } sort(mid, mid + index); for (int i = index - 1; i >= 0; i--) { if (((index - 1) % 2 == 0 && i % 2 == 0) || ((index - 1) % 2 == 1 && i % 2 == 1)) p1 += mid[i]; else p2 += mid[i]; } cout << p1 << << p2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 6010; vector<int> a[N]; int L[N], cnt, r[N], n, res = 0; void Refresh() { L[0] = cnt = 0; for (int i = 1; i <= n + 1; i++) L[i] = 10000000; } void DFS(int u, int p) { int Oldval, Oldid, Oldcnt = cnt; if (cnt == 0 || r[u] > L[cnt]) L[++cnt] = r[u]; else { Oldid = lower_bound(L, L + n + 1, r[u]) - L; Oldval = L[Oldid]; L[Oldid] = r[u]; } res = max(res, cnt); for (int i = 0; i < a[u].size(); i++) { int v = a[u][i]; if (v != p) DFS(v, u); } if (Oldcnt != cnt) L[cnt--] = 10000000; else L[Oldid] = Oldval; } int main() { ios_base::sync_with_stdio(0); int u, v; cin >> n; for (int i = 1; i <= n; i++) cin >> r[i]; for (int i = 1; i < n; i++) { cin >> u >> v; a[u].push_back(v); a[v].push_back(u); } for (int i = 1; i <= n; i++) { Refresh(); DFS(i, 0); } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; long long pow1(int a, int b) { long long res = 1; for (int i = 1; i <= b; i++) res *= a; return res; } int main() { int n; cin >> n; long long sum = 2 * (pow1(2, n) - 1); cout << sum << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (b == 0) return a; else return gcd(b, a % b); } bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); std::cout.precision(12); int t; cin >> t; while (t--) { bool f = 0; int n, m; cin >> n >> m; char a[n][m]; char ans[n][m]; vector<pair<int, int>> v[26]; int ma = -1; int r, c; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { cin >> a[i][j]; ans[i][j] = . ; if (a[i][j] >= 97 && a[i][j] <= z ) { v[a[i][j] - a ].push_back({i + 1, j + 1}); if (a[i][j] - a > ma) { ma = a[i][j] - a ; r = i + 1; c = j + 1; } } } } vector<pair<int, int>> start[ma + 1], end[ma + 1]; for (long long int i = 0; i < ma + 1; i++) { if (v[i].size() == 0) { start[i].push_back({r, c}); end[i].push_back({r, c}); } else if (v[i].size() == 1) { ans[v[i][0].first - 1][v[i][0].second - 1] = a + i; start[i].push_back({v[i][0].first, v[i][0].second}); end[i].push_back({v[i][0].first, v[i][0].second}); } else { if (v[i][1].first == v[i][0].first) { int mi = m + 6, m = 0; for (int j = 0; j < v[i].size(); j++) { if (v[i][j].first != v[i][0].first) { f = 1; break; } mi = min(mi, v[i][j].second); m = max(m, v[i][j].second); } if (f == 1) break; for (int j = mi - 1; j < m; j++) { ans[v[i][0].first - 1][j] = a + i; } start[i].push_back({v[i][0].first, mi}); end[i].push_back({v[i][0].first, m}); } else if (v[i][1].second == v[i][0].second) { int mi = n + 6, m = 0; for (int j = 0; j < v[i].size(); j++) { if (v[i][j].second != v[i][0].second) { f = 1; break; } mi = min(mi, v[i][j].first); m = max(m, v[i][j].first); } if (f == 1) break; for (int j = mi - 1; j < m; j++) { ans[j][v[i][0].second - 1] = a + i; } start[i].push_back({mi, v[i][0].second}); end[i].push_back({m, v[i][0].second}); } else { f = 1; break; } } } for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { if (a[i][j] != ans[i][j]) { f = 1; break; } } if (f == 1) break; } if (f == 0) { cout << YES n ; cout << ma + 1 << endl; for (long long int i = 0; i < ma + 1; i++) cout << start[i][0].first << << start[i][0].second << << end[i][0].first << << end[i][0].second << endl; } else { cout << NO n ; } } } |
#include <bits/stdc++.h> using namespace std; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const long long linf = 4000000000000000000LL; const long long inf = 998244353; const long double pi = 3.1415926535; void pv(vector<int> a) { for (auto& x : a) cout << x << ; cout << n ; } void pv(vector<long long> a) { for (auto& x : a) cout << x << ; cout << n ; } void pv(vector<vector<int>> a) { for (int i = (0); i < (int(a.size())); ++i) { cout << i << n ; pv(a[i]); cout << n ; } } void pv(vector<vector<long long>> a) { for (int i = (0); i < (int(a.size())); ++i) { cout << i << n ; pv(a[i]); } cout << n ; } void pv(vector<string> a) { for (auto& x : a) cout << x << n ; cout << n ; } void build_primes(vector<int>& primes, int size) { vector<int> visited; visited.resize(size, 0); for (int i = (2); i < (size); ++i) { if (visited[i] == 0) { primes.push_back(i); int a = i; while (a < size) { visited[a] = 1; a += i; } } } } vector<vector<long long>> matrix_mult(vector<vector<long long>>& a, vector<vector<long long>>& b) { int n = a.size(); vector<vector<long long>> answer; answer.resize(n); for (int i = 0; i < n; i++) answer[i].resize(n, 0); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) answer[i][j] = (answer[i][j] + a[i][k] * b[k][j]) % inf; } } return answer; } int modInverse(int a, int m) { 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; } long long power(long long x, long long y) { long long k = 1LL << 60; long long z = 1; while (k != 0) { z *= z; z %= inf; if (y >= k) { z *= x; z %= inf; y -= k; } k >>= 1; } return z; } struct point { long double x, y; bool operator<(const point& rhs) const { if (x == rhs.x) return y < rhs.y; return x < rhs.x; } }; struct pt { long long x, y; bool operator<(const point& rhs) const { if (x == rhs.x) return y < rhs.y; return x < rhs.x; } }; long double area(point x, point y, point z) { return (x.y * y.x + y.y * z.x + z.y * x.x - x.x * y.y - y.x * z.y - z.x * x.y) / 2.0; } bool clockwise(point x, point y, point z) { return area(x, y, z) > 0; } long double area(pt x, pt y, pt z) { return (x.y * y.x + y.y * z.x + z.y * x.x - x.x * y.y - y.x * z.y - z.x * x.y) / 2.0; } bool clockwise(pt x, pt y, pt z) { return area(x, y, z) > 0; } long long gcd(long long a, long long b) { if (a > b) swap(a, b); if (a == 0) return b; return gcd(a, b % a); } int popcount(long long a) { int count = 0; while (a) { count += (a & 1); a >>= 1; } return count; } long long choose(long long n, long long r) { long long p = 1, k = 1; if (n - r < r) r = n - r; if (r != 0) { while (r) { p *= n; k *= r; long long m = gcd(p, k); p /= m; k /= m; n--; r--; } } else p = 1; return p; } vector<long long> prefix_hash(string& a, vector<long long>& powers) { int n = int(a.size()); vector<long long> prefix(n + 1); for (int i = (0); i < (n); ++i) prefix[i + 1] = (prefix[i] + powers[i] * (a[i] - a + 1)) % inf; return prefix; } struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } uint64_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; struct custom_hash_fast { uint64_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); x ^= FIXED_RANDOM; return x ^ (x >> 16); } }; void setIO(string second) { ios_base::sync_with_stdio(0); cin.tie(0); } int main() { setIO( ); int testc; cin >> testc; while (testc--) { int n; cin >> n; string a; cin >> a; int i = n - 1; for (; i >= 0; i--) if ((a[i] - 0 ) & 1) break; if (i == -1) { cout << -1 << n ; continue; } int j = 0; for (; j < i; j++) { if ((a[j] - 0 ) % 2 == 1) break; } if (j == i) { cout << -1 << n ; continue; } cout << a[j] << a[i] << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; int cardsPlayer = n / k; double maxCard; int jokerMax = min(m, cardsPlayer); maxCard = ceil((m - jokerMax) / (k - 1.0)); if (jokerMax - maxCard > 0) cout << jokerMax - maxCard << endl; else cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; typedef struct { long long j, x1, x2; } inter; struct comp1 { bool operator()(const inter& a, const inter& b) const { return a.x1 < b.x1; }; }; struct comp2 { bool operator()(const inter& a, const inter& b) const { return (a.x2 == b.x2) ? (a.x1 < b.x1) : (a.x2 < b.x2); }; }; void solve() { long long n; cin >> n; vector<long long> a(n), b(n), m(n); unordered_map<long long, vector<long long>> dsize; for (long long i = 0; i < (n); i++) { cin >> a[i] >> b[i] >> m[i]; dsize[a[i] + b[i] - m[i]].push_back(i); } long long c = 0; vector<long long> ea(n); for (auto& x : dsize) { multiset<inter, comp1> inter1; multiset<inter, comp2> inter2; for (auto& i : x.second) { long long eamax = min(m[i], a[i]); long long eamin = max(m[i] - b[i], 0LL); inter1.insert(inter{i, a[i] - eamax, a[i] - eamin}); inter2.insert(inter{i, a[i] - eamax, a[i] - eamin}); } auto p1 = inter1.begin(); while (!inter2.empty()) { long long targ = inter2.begin()->x2; while ((p1 == inter1.end()) ? false : (p1->x1 <= targ)) { inter2.erase(*p1); ea[p1->j] = a[p1->j] - targ; p1++; } c++; } } cout << c << endl; for (long long i = 0; i < (n); i++) cout << ea[i] << << m[i] - ea[i] << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); ifstream ifs; if ( [0]) cin.rdbuf((ifs = ifstream( )).rdbuf()); ; ofstream ofs; if ( [0]) cout.rdbuf((ofs = ofstream( )).rdbuf()); ; ofstream lfs; if ( [0]) clog.rdbuf((lfs = ofstream( )).rdbuf()); ; int t; cin >> t; for (int i = 1; i <= t; i++) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long a[2000], dp[2000]; long long qmod(long long y) { long long res = 1, two = (long long)2; for (; y; y >>= 1) { if (y & 1) res = res * two % mod; two = two * two % mod; } return res; } int main() { long long x, y; int cnt = 0; scanf( %lld%lld , &x, &y); if (y % x) return 0 * puts( 0 ); for (long long i = 1; i <= sqrt(y); ++i) { if (y % i == 0) { if (i % x == 0) a[++cnt] = i; if (i * i != y && y / i % x == 0) a[++cnt] = y / i; } } sort(a + 1, a + 1 + cnt); for (int i = cnt; i > 0; --i) { dp[i] = qmod(y / a[i] - 1); for (int j = i + 1; j <= cnt; ++j) if (a[j] % a[i] == 0) dp[i] = ((dp[i] - dp[j]) % mod + mod) % mod; } printf( %lld n , dp[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 200005; const int inf = 214748364; int n, m, g[21][1 << 20], f[maxN], v[maxN], s[maxN]; int cost(int a, int b) { for (int i = m; i >= 0; --i) { if ((a & ((1 << i) - 1)) == (b >> (m - i))) return m - i; } } void init() { char c[25]; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %s , c + 1); m = strlen(c + 1); for (int j = 1; j <= m; ++j) v[i] = (v[i] << 1) + c[j] - 48; } s[1] = m; for (int i = 2; i <= n; ++i) s[i] = s[i - 1] + cost(v[i - 1], v[i]); } void work() { int ans = inf; for (int i = 0; i <= m; ++i) for (int j = 0; j <= (1 << m) - 1; ++j) g[i][j] = inf; g[0][0] = 0; f[1] = m; for (int i = 2; i <= n; ++i) { f[i] = inf; for (int j = 0; j <= m; ++j) { int tmp = s[i - 1] + g[j][v[i] >> (m - j)] + m - j; f[i] = ((f[i]) < (tmp) ? (f[i]) : (tmp)); } for (int j = 0; j <= m; ++j) g[j][v[i - 1] & ((1 << j) - 1)] = ((g[j][v[i - 1] & ((1 << j) - 1)]) < (f[i] - s[i]) ? (g[j][v[i - 1] & ((1 << j) - 1)]) : (f[i] - s[i])); } for (int i = 1; i <= n; ++i) ans = ((ans) < (f[i] + s[n] - s[i]) ? (ans) : (f[i] + s[n] - s[i])); printf( %d n , ans); } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void Input_Output() {} const double eps = 0.000001; const long double pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const long long MOD = 1e18 + 9; const long long INF = 1e18 + 123; const int inf = 2e9 + 11; const int mxn = 1e6 + 9; const int N = 6e5 + 123; const int K = 80; const int pri = 997; const int Magic = 2101; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, -1, 0, 1}; int n, m, k, x; vector<int> state; int ids[(1 << 8)]; struct Mat { long long d[K][K]; Mat(long long val = INF) { for (int i = 0; i < K; ++i) for (int j = 0; j < K; ++j) d[i][j] = INF; for (int i = 0; i < K; ++i) d[i][i] = val; } Mat operator+(Mat &b) { Mat res; for (int i = 0; i < K; ++i) for (int j = 0; j < K; ++j) for (int k = 0; k < K; ++k) res.d[i][j] = min(res.d[i][j], d[i][k] + b.d[k][j]); return res; } void print() { for (int i = 0; i < K; ++i) { for (int j = 0; j < K; ++j) { if (d[i][j] == INF) { cout << bd ; continue; } cout << d[i][j] << ; } cout << n ; } } }; Mat make_matrix(vector<long long> &c) { assert((int)(c.size()) == k); Mat res; for (int id = 0; id < (int)(state.size()); ++id) { int msk = state[id]; if (msk % 2 == 0) { int nmsk = msk / 2; res.d[id][ids[nmsk]] = 0; continue; } for (int i = 0; i < k; ++i) { int nmsk = (msk >> 1); if (nmsk & (1 << i)) { continue; } nmsk |= (1 << i); res.d[id][ids[nmsk]] = min(res.d[id][ids[nmsk]], c[i]); } } return res; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> x >> k >> n >> m; for (int msk = 0; msk < (1 << k); ++msk) { ids[msk] = -1; if (__builtin_popcount(msk) != x) { continue; } ids[msk] = (int)(state.size()); state.push_back(msk); } vector<long long> c(k); for (auto &e : c) cin >> e; vector<int> pos = {0, n - x}; vector<pair<int, int> > spec(m); for (auto &it : spec) { cin >> it.first >> it.second; it.first--; for (int i = 0; i <= k; ++i) { int s = it.first - i; s = max(s, 0); s = min(s, n - x); pos.push_back(s); } } sort(pos.begin(), pos.end()); pos.resize(unique(pos.begin(), pos.end()) - pos.begin()); vector<Mat> Pw; Pw.push_back(make_matrix(c)); int bit = 0; while ((1 << bit) <= n) { ++bit; Pw.push_back(Pw.back() + Pw.back()); } Mat cur = 0; for (int it = 0; it + 1 < (int)(pos.size()); ++it) { int l = pos[it], r = pos[it + 1]; vector<long long> nc = c; for (auto s : spec) { if (s.first > l && s.first <= l + k) { nc[s.first - l - 1] += s.second; } } if (nc != c) { Mat cn = make_matrix(nc); cur = cur + cn; } else { int dif = r - l; for (int i = 0; i < (int)(Pw.size()); ++i) { if (dif & (1 << i)) { cur = cur + Pw[i]; } } } } int fin = (1 << x) - 1; fin = ids[fin]; assert(fin != -1); cout << cur.d[fin][fin] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool vis[2][100005]; char c[2][100005]; int main() { queue<pair<int, pair<int, int> > > q; bool flag = 0; int n, k; cin >> n >> k; scanf( %s%s , c[0], c[1]); q.push(make_pair(0, make_pair(0, 0))); while (!q.empty()) { int x = q.front().first, y = q.front().second.first, de = q.front().second.second; q.pop(); if (y >= n) { flag = 1; break; } if (vis[x][y] || de > y) continue; vis[x][y] = 1; if (y - 1 >= 0 && c[x][y - 1] != X && y - 1 >= de + 1 && !vis[x][y - 1]) { q.push(make_pair(x, make_pair(y - 1, de + 1))); } if (y + 1 >= n || (c[x][y + 1] != X && !vis[x][y + 1])) { q.push(make_pair(x, make_pair(y + 1, de + 1))); } if (y + k >= n || (c[x ^ 1][y + k] != X && !vis[x ^ 1][y + k])) { q.push(make_pair(x ^ 1, make_pair(y + k, de + 1))); } } if (flag) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> int n, k, ans; long long s[200005], a[200005], b[200005]; void neg() { for (int i = 0; i <= n; i++) { a[i] = -a[i]; b[i] = -b[i]; } } void trans() { b[n]--; b[0] += 2; for (int i = 1; i < n; i++) b[i]++; for (int i = 0; i < n; i++) { b[i + 1] += b[i] / 2; b[i] %= 2; } } void print(long long x[]) { for (int i = 0; i <= n; i++) printf( %I64d , x[i]); printf( n ); } int main() { scanf( %d %d , &n, &k); for (int i = 0; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 0; i < n; i++) { b[i] += a[i]; b[i + 1] += b[i] / 2; b[i] %= 2; if (b[i] < 0) { b[i + 1]--; b[i] += 2; } } b[n] += a[n]; if (b[n] < 0) neg(); trans(); for (int i = n; i >= 0; i--) { if (s[i + 1] == 10ll * k + 1) s[i] = 10ll * k + 1; else s[i] = s[i + 1] * 2 + b[i]; if (s[i] > 10ll * k) s[i] = 10ll * k + 1; } for (int i = 0; i <= n; i++) { if (i == n && llabs(s[i] - a[i]) <= k && s[i] != a[i]) ans++; if (i != n && llabs(s[i] - a[i]) <= k) ans++; if (b[i]) break; } printf( %d n , ans); scanf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n, k, sum = 0; cin >> n >> k; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; string s; cin >> s; vector<long long int> v; v.push_back(a[0]); for (long long int i = 1; s[i]; i++) { if (s[i] == s[i - 1]) v.push_back(a[i]); else { sort(v.rbegin(), v.rend()); for (long long int i = 0; i < k && i < v.size(); i++) { sum += v[i]; } v.clear(); v.push_back(a[i]); } } sort(v.rbegin(), v.rend()); for (long long int i = 0; i < k && i < v.size(); i++) sum += v[i]; cout << sum; } |
#include<bits/stdc++.h> using namespace std; int a[10]; int main() { int T;scanf( %d ,&T); while(T--) { int sum = 0; for(int i = 1;i <= 3;i++) { scanf( %d ,&a[i]); sum += a[i]; } if(sum % 9 == 0) { if(a[1] >= sum / 9 && a[2] >= sum / 9 && a[3] >= sum / 9) { printf( YES n ); } else { printf( NO n ); } } else { printf( NO n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long int; using ld = long double; using vi = vector<int>; using vll = vector<ll>; using vd = vector<double>; using vvi = vector<vi>; int ctoi(char c) { return c - 0 ; } int slen(string s) { return s.length(); } int vsize(vi a) { return (int)a.size(); } int in() { int x; cin >> x; return x; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; vi d(N); for (auto& x : d) cin >> x; int mn = abs(d[N - 1] - d[0]); int a = N - 1, b = 0; for (int i = 1; i < N; i++) { if (abs(d[i] - d[i - 1]) < mn) { mn = abs(d[i] - d[i - 1]); a = i; b = i - 1; } } cout << a + 1 << << b + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int result = 0; for (int i = 0; i < n; i++) { int k, a; cin >> k >> a; long x = k * a; int c = 0; if (a % 4 == 0) a--; while (a) { a /= 4; c++; } result = (((result) < (k + c)) ? (k + c) : (result)); } cout << result; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; long long x; for (int i = 0; i < m; i++) { cin >> x; if (x > n) cout << 0 << endl; else { if (x % 2 == 1) cout << x / 2 + 1 << endl; else { long long a = x, b, c = n; while (1) { if (a % 2 == 1) break; b = a + (c - a / 2); a = b; } cout << a / 2 + 1 << endl; } } } } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 100010; int x0[maxn], x1[maxn], d[maxn], c[maxn]; int main() { int n, m, y0, y1; scanf( %d %d %d %d , &n, &m, &y0, &y1); for (int i = 0; i < n; ++i) { scanf( %d , &x0[i]); } memset(d, -1, sizeof(d)); for (int i = 0; i < m; ++i) { scanf( %d , &x1[i]); } int p = 0, k = 0, last = -1; for (int i = 0; i < n; ++i) { while (p < m && abs(x0[i] - x1[p]) > abs(x0[i] - x1[p + 1])) ++p; if (last < p || abs(x0[i - 1] - x1[p]) == abs(x0[i] - x1[p])) ++k, last = p; else if (p < m && abs(x0[i] - x1[p]) == abs(x0[i] - x1[p + 1])) ++k, last = ++p; else last = p; } printf( %d n , n - k); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a; cin >> a; long long int x = a.length(); std::vector<long long int> v; long long int c = 0; long long int d = 0; for (long long int i = 0; i < x; i++) { if (a[i] == b ) { d++; } if (a[i] == a ) { if (d > 0 && c > 0) { v.push_back(c); d = 0; c = 0; } c++; d = 0; } } if (c > 0) v.push_back(c); long long int res = 1; for (long long int i = 0; i < v.size(); i++) { res = (res * (v[i] + 1)) % 1000000007; } cout << res - 1; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.