func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int n; long long h[100005], d; int dp[100005]; int arr[300003]; int tree[(1200004)]; int lazy[(1200004)]; void build_tree(int node, int a, int b) { if (a > b) return; if (a == b) { tree[node] = arr[a]; return; } build_tree(node * 2, a, (a + b) / 2); build_tree(node * 2 + 1, 1 + (a + b) / 2, b); tree[node] = max(tree[node * 2], tree[node * 2 + 1]); } void update_tree(int node, int a, int b, int i, int j, int value) { if (lazy[node] != 0) { tree[node] += lazy[node]; if (a != b) { lazy[node * 2] += lazy[node]; lazy[node * 2 + 1] += lazy[node]; } lazy[node] = 0; } if (a > b || a > j || b < i) return; if (a >= i && b <= j) { tree[node] += value; if (a != b) { lazy[node * 2] += value; lazy[node * 2 + 1] += value; } return; } update_tree(node * 2, a, (a + b) / 2, i, j, value); update_tree(1 + node * 2, 1 + (a + b) / 2, b, i, j, value); tree[node] = max(tree[node * 2], tree[node * 2 + 1]); } int query_tree(int node, int a, int b, int i, int j) { if (a > b || a > j || b < i) return -0x7fffffff; if (lazy[node] != 0) { tree[node] += lazy[node]; if (a != b) { lazy[node * 2] += lazy[node]; lazy[node * 2 + 1] += lazy[node]; } lazy[node] = 0; } if (a >= i && b <= j) return tree[node]; int q1 = query_tree(node * 2, a, (a + b) / 2, i, j); int q2 = query_tree(1 + node * 2, 1 + (a + b) / 2, b, i, j); int res = max(q1, q2); return res; } void reconstruct(vector<int>& ret, int val) { long long last = -1e18; for (int i = 0; i < n; i++) { if (abs(last - h[i]) >= d && dp[i] == val) { ret.push_back(i + 1); last = h[i]; val--; } } } map<long long, int> htoi; set<long long> ss; int main() { cin >> n >> d; int counter = 0; for (int i = 0; i < n; i++) { scanf( %I64d , &h[i]); ss.insert(h[i]); } set<long long>::iterator iit; for (iit = ss.begin(); iit != ss.end(); iit++) htoi[*iit] = counter++; ss.clear(); update_tree(1, 0, 300003 - 1, htoi[h[n - 1]], htoi[h[n - 1]], 1); ss.insert(h[n - 1]); dp[n - 1] = 1; for (int ind = n - 2; ind >= 0; ind--) { int index = htoi[h[ind]]; long long curmin = *ss.begin(); iit = ss.end(); iit--; long long curmax = *iit; int ucand = 0; int dcand = 0; if (ss.lower_bound(h[ind] + d) != ss.end()) { long long curhplud = *ss.lower_bound(h[ind] + d); ucand = max(ucand, query_tree(1, 0, 300003 - 1, htoi[curhplud], htoi[curmax])); } iit = ss.lower_bound(h[ind] - d); if (iit == ss.begin()) { if (*iit <= h[ind] - d) { dcand = max(dcand, query_tree(1, 0, 300003 - 1, htoi[curmin], htoi[curmin])); } } else { if (*iit > h[ind] - d) iit--; if (iit == ss.end()) iit--; long long curhmind = *iit; dcand = max(dcand, query_tree(1, 0, 300003 - 1, htoi[curmin], htoi[curhmind])); } int curval = query_tree(1, 0, 300003 - 1, index, index); int newval = max(max(ucand, dcand) + 1, curval); update_tree(1, 0, 300003 - 1, index, index, newval - curval); ss.insert(h[ind]); dp[ind] = query_tree(1, 0, 300003 - 1, index, index); } int len = dp[0]; for (int i = 1; i < n; i++) len = max(len, dp[i]); vector<int> ret; reconstruct(ret, len); cout << ret.size() << endl; for (int i = 0; i < ret.size(); i++) cout << ret[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> const int inf = 1 << 30; const long long INF = 1ll << 61; using namespace std; const int MOD = 1000000; int n; int nnum[500000 + 55]; int vis[1000000 + 55]; int flag[1000000 + 55]; vector<int> G; void init() { memset(flag, 0, sizeof(flag)); memset(nnum, 0, sizeof(nnum)); memset(vis, 0, sizeof(vis)); G.clear(); } bool input() { while (cin >> n) { for (int i = 0; i < n; i++) { scanf( %d , &nnum[i]); vis[nnum[i]]++; } return false; } return true; } void cal() { int cnt = 0; for (int i = 0; i < n; i++) { if (vis[nnum[i]] && !vis[MOD - nnum[i] + 1]) { flag[MOD - nnum[i] + 1]++; cnt++; } } for (int i = 1; i <= MOD && cnt < n; i++) { if (!vis[i] && !vis[MOD - i + 1]) { flag[i] = 1; cnt++; flag[MOD - i + 1] = 1; cnt++; } } cout << cnt << endl; for (int i = 1; i <= MOD; i++) if (flag[i]) printf( %d , i); puts( ); } void output() {} int main() { while (true) { init(); if (input()) return 0; cal(); output(); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[2000]; int vis[2000]; vector<pair<int, int> > cyc; void dfs(int x, int scc) { if (vis[x] > 0) { return; } vis[x] = 1; int j; for (int i = 0; i < g[x].size(); i++) { for (j = 0; j < g[g[x][i]].size(); j++) { if (g[g[x][i]][j] == x) { g[g[x][i]].erase(g[g[x][i]].begin() + j); } } if (vis[g[x][i]] > 0) { cyc.push_back(make_pair(x, g[x][i])); } dfs(g[x][i], scc); } return; } int main() { int n, i, j, x, y, t, u; cin >> n; for (i = 0; i < n - 1; i++) { cin >> x >> y; x--; y--; g[x].push_back(y); g[y].push_back(x); } memset(vis, 0, sizeof(vis)); int scc = 0, days = 0; cyc.clear(); vector<int> store; store.clear(); for (i = 0; i < n; i++) { if (vis[i] == 0) { scc++; store.push_back(i); dfs(i, scc); } } if (scc == 1) { cout << 0 n ; return 0; } j = 1; vector<pair<pair<int, int>, pair<int, int> > > v; v.clear(); for (i = 0; i < cyc.size(); i++) { v.push_back(make_pair(make_pair(cyc[i].first + 1, cyc[i].second + 1), make_pair(store[j - 1] + 1, store[j] + 1))); j++; } cout << v.size() << n ; for (i = 0; i < v.size(); i++) { cout << v[i].first.first << << v[i].first.second << << v[i].second.first << << v[i].second.second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int gi() { int x = 0, w = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) w = 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return w ? x : -x; } const int N = 5e5 + 5; struct node { int h, nxt; } a[N]; int n, m, nxt[N], head[N], val[N], ft[N]; char s[N]; int dep[N], sz[N], son[N], vis[N], sum[N], ans[N]; void add(int v, int h, int id) { a[id] = (node){h, ft[v]}; ft[v] = id; } void dfs1(int u, int f) { dep[u] = dep[f] + 1; sz[u] = 1; for (int v = head[u]; v; v = nxt[v]) { dfs1(v, u), sz[u] += sz[v]; if (sz[v] > sz[son[u]]) son[u] = v; } } void update(int u) { sum[dep[u]] ^= val[u]; for (int v = head[u]; v; v = nxt[v]) if (!vis[v]) update(v); } bool cal(int x) { int res = 0; while (x) ++res, x ^= x & -x; return res <= 1; } void dfs(int u, int f, int keep) { for (int v = head[u]; v; v = nxt[v]) if (v != son[u]) dfs(v, u, 0); if (son[u]) dfs(son[u], u, 1), vis[son[u]] = 1; update(u); for (int i = ft[u]; i; i = a[i].nxt) ans[i] = cal(sum[a[i].h]); vis[son[u]] = 0; if (!keep) update(u); } int main() { n = gi(); m = gi(); for (int i = 2, f; i <= n; ++i) f = gi(), nxt[i] = head[f], head[f] = i; scanf( %s , s + 1); for (int i = 1; i <= n; ++i) val[i] = 1 << s[i] - a ; for (int i = 1, v, h; i <= m; ++i) v = gi(), h = gi(), add(v, h, i); dfs1(1, 0); dfs(1, 0, 1); for (int i = 1; i <= m; ++i) puts(ans[i] ? Yes : No ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool spj(set<int>& s) { vector<int> v{s.begin(), s.end()}; return (v[2] == 3 * v[0] && v[1] == 2 * v[0]); } int main() { int n; scanf( %d , &n); vector<int> result; for (int i = n, factor = 1; i != 0; i /= 2, factor *= 2) { if (i == 3) { { result.push_back(factor); result.push_back(factor); result.push_back(3 * factor); break; } } int k = (i + 1) / 2; for (int j = 0; j < k; ++j) { result.emplace_back(factor); } } for (int x : result) { printf( %d , x); } } |
#include <bits/stdc++.h> using namespace std; int n, m, s, f, l, r, t; int stay() { int next = (s < f) ? s + 1 : s - 1; return (s >= l && s <= r) || (next >= l && next <= r); } int di[] = {0, 1}; int dj[] = {1, 0}; void write(vector<string> &res, int x, int y, int dir, string s) { for (int i = 0; i < s.size(); i++) { res[x][y] = s[i]; x += di[dir]; y += dj[dir]; } } void print(vector<string> res) { for (int i = 0; i < res.size(); i++) { for (int j = 0; j < res[i].size(); ++j) { cout << res[i][j]; } cout << endl; } } bool same(string a, string b, int i, int j) { return a[i] == b[j]; } int main() { vector<string> arr(6); vector<bool> vis(6, 0); for (int i = 0; i < 6; ++i) { cin >> arr[i]; } sort(arr.begin(), arr.end()); vector<string> best, res; do { if (!same(arr[0], arr[1], 0, 0) || !same(arr[4], arr[5], arr[4].size() - 1, arr[5].size() - 1)) continue; if (arr[3].size() != arr[0].size() + arr[4].size() - 1 || arr[2].size() != arr[1].size() + arr[5].size() - 1) continue; if (!same(arr[3], arr[2], arr[0].size() - 1, arr[1].size() - 1) || !same(arr[2], arr[0], 0, arr[0].size() - 1) || !same(arr[2], arr[4], arr[2].size() - 1, 0)) continue; if (!same(arr[3], arr[1], 0, arr[1].size() - 1) || !same(arr[3], arr[5], arr[3].size() - 1, 0)) continue; int n = arr[2].size(), m = arr[3].size(); string tmp = string(m, . ); res = vector<string>(n, tmp); write(res, 0, 0, 0, arr[0]); write(res, 0, 0, 1, arr[1]); write(res, 0, arr[0].size() - 1, 1, arr[2]); write(res, arr[1].size() - 1, 0, 0, arr[3]); write(res, n - 1, arr[0].size() - 1, 0, arr[4]); write(res, arr[1].size() - 1, m - 1, 1, arr[5]); if (!best.size() || best > res) best = res; } while (next_permutation(arr.begin(), arr.end())); if (!best.size()) cout << Impossible << endl; else print(best); return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int dpl[2010], dpr[2010]; int main() { cin >> s; memset(dpr, 0, sizeof(dpr)); memset(dpl, 0, sizeof(dpl)); int i, j, k; for (i = 0; i < s.size(); i++) { for (j = i, k = i; j >= 0 && k < s.size() && s[k] == s[j]; j--, k++) dpl[j]++, dpr[k]++; for (j = i, k = i + 1; j >= 0 && k < s.size() && s[k] == s[j]; j--, k++) dpl[j]++, dpr[k]++; } for (i = 1; i < s.size(); i++) dpr[i] += dpr[i - 1]; long long ans = 0; for (i = 1; i < s.size(); i++) ans += dpr[i - 1] * dpl[i]; printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> ara; int main() { int n, k; cin >> n >> k; int t = n / 2; if (n == 1 && k != 0) { cout << -1; return 0; } if (n == 1 && k == 0) { cout << 1; return 0; } if (k < t) { cout << -1; return 0; } else { int t2 = k - t; t2++; cout << t2 << << t2 * 2; cout << ; ara[t2] = 1; ara[t2 * 2] = 1; int cnt = 1; for (int i = 1; i <= n - 2; i++) { if (ara[cnt] == 1) cnt++; if (ara[cnt] == 1) cnt++; cout << cnt << ; cnt++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-6; const int inf = 1e9; const long long llf = 1e18; const int mod = 1e9 + 7; const int maxn = 1e5 + 10; char s[110]; int f[310]; int main() { int tc; cin >> tc; while (tc--) { cin >> s + 1; int n = strlen(s + 1); sort(s + 1, s + n + 1); string s1 = , s2 = ; for (int i = 1; i <= n; i++) { f[s[i]]++; } for (int i = a ; i <= z ; i++) { if (i & 1) { while (f[i]) { s1 += i; f[i]--; } } else { while (f[i]) { s2 += i; f[i]--; } } } string t = s1 + s2; int flag = 1; for (int i = 1; i < t.size(); i++) { if (abs(t[i] - t[i - 1]) == 1) { flag = 0; break; } } if (flag) { cout << t << endl; continue; } t = s2 + s1; flag = 1; for (int i = 1; i < t.size(); i++) { if (abs(t[i] - t[i - 1]) == 1) { flag = 0; break; } } if (flag) { cout << t << endl; } else { cout << No answer << endl; } } return 0; } |
#include <bits/stdc++.h> int main() { std::vector<int> count(1 << 19); auto modify = [&](char *s, int dt) { int len = strlen(s); std::reverse(s, s + len); int val = 0; for (int i = 0; i < 18; ++i) { val = val | (i >= len ? 0 : (s[i] - 0 & 1)) << i; } count[val] += dt; }; auto query = [&](char *s) { int len = strlen(s); std::reverse(s, s + len); int val = 0; for (int i = 0; s[i]; ++i) { val |= s[i] - 0 << i; } return count[val]; }; int t; scanf( %d , &t); for (int _ = 0; _ < t; ++_) { char op[2]; char str[18 + 1]; scanf( %s%s , op, str); if (op[0] == + ) { modify(str, 1); } else if (op[0] == - ) { modify(str, -1); } else { printf( %d n , query(str)); } } } |
#include <bits/stdc++.h> using namespace std; namespace Solve { const int MAXN = 200010; inline int ScanInt(void) { int r = 0, c, d; while (!isdigit(c = getchar()) && c != - ) ; if (c != - ) r = c - 0 ; d = c; while (isdigit(c = getchar())) r = r * 10 + c - 0 ; return d == - ? -r : r; } int a[MAXN], n, b[MAXN], cnt = 0, sum = 0; int zero = 0, l1 = 0, l2 = 0; bool c[MAXN]; inline void solve(void) { n = ScanInt(); for (int i = 1; i <= n; i++) { a[i] = ScanInt(), sum += a[i]; if (a[i] == 0) zero++; } if (!zero) { puts( -1 ); return; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { if (a[i] % 3 == 0) b[++cnt] = a[i], c[i] = true; if (a[i] % 3 == 1) l1++; if (a[i] % 3 == 2) l2++; } if (sum % 3 == 1) { if (l1 == 0) { int t = 2; for (int i = 1; i <= n; i++) if (a[i] % 3 == 2 && t) c[i] = true, t--; } else { int t = 1; for (int i = 1; i <= n; i++) if (a[i] % 3 == 1 && t) c[i] = true, t--; } } if (sum % 3 == 2) { if (l2 == 0) { int t = 2; for (int i = 1; i <= n; i++) if (a[i] % 3 == 1 && t) c[i] = true, t--; } else { int t = 1; for (int i = 1; i <= n; i++) if (a[i] % 3 == 2 && t) c[i] = true, t--; } } for (int i = 1; i <= n; i++) if (!c[i]) b[++cnt] = a[i]; sort(b + 1, b + cnt + 1); sum = 0; for (int i = 1; i <= cnt; i++) sum += b[i]; if (sum == 0) { puts( 0 ); return; } assert(sum % 3 == 0); for (int i = cnt; i >= 1; i--) printf( %d , b[i]); printf( n ); } } // namespace Solve int main(void) { Solve::solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count()); const long double PI = 3.141592653589793; const long long INF = 9223372036854775807ll; const long long mod = 1e9 + 7; const int N = 1e5 + 5; long long tree[4 * N + 10]; long long lazy[4 * N + 10]; long long b[N]; void build(int node, int start, int end) { if (start == end) { tree[node] = b[start]; return; } int mid = (start + end) / 2; build(2 * node, start, mid); build(2 * node + 1, mid + 1, end); tree[node] = tree[2 * node] + tree[2 * node + 1]; } long long query(int node, int start, int end, int l, int r) { if (lazy[node] != -INF / 10000) { tree[node] = lazy[node] * (end - start + 1); if (start != end) { lazy[2 * node] = lazy[node]; lazy[2 * node + 1] = lazy[node]; } lazy[node] = -INF / 10000; } if (l > end || r < start) return 0; if (l <= start && r >= end) { return tree[node]; } int mid = (start + end) / 2; return query(2 * node, start, mid, l, r) + query(2 * node + 1, mid + 1, end, l, r); } void update(int node, int start, int end, int l, int r, long long val) { if (lazy[node] != (-INF / 10000)) { tree[node] = lazy[node] * (end - start + 1ll); if (start != end) { lazy[2 * node] = lazy[node]; lazy[2 * node + 1] = lazy[node]; } lazy[node] = (-INF / 10000); } if (l > end || r < start) return; if (l <= start && r >= end) { tree[node] = (end - start + 1) * val; if (start != end) { lazy[2 * node] = val; lazy[2 * node + 1] = val; } return; } int mid = (start + end) / 2; update(2 * node, start, mid, l, r, val); update(2 * node + 1, mid + 1, end, l, r, val); tree[node] = tree[2 * node] + tree[2 * node + 1]; } void solve() { fill(tree, tree + 4 * N + 4, 0ll); fill(lazy, lazy + 4 * N + 4, -INF / 10000); fill(b, b + N, 0); long long n; cin >> n; long long a[n]; long long t[n + 1]; t[0] = 0; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 1; i < n; ++i) { long long k; cin >> k; t[i] = t[i - 1] + k; } for (int i = 0; i < n; ++i) { b[i] = a[i] - t[i]; } for (int i = 1; i < n; ++i) { t[i] += t[i - 1]; } b[n] = INF / 10000; build(1, 0, n); int q; cin >> q; while (q--) { char now; cin >> now; if (now == s ) { int l; int r; cin >> l >> r; l--; r--; long long pr = query(1, 0, n, l, r); if (l - 1 < 0) l++; cout << (pr + t[r] - t[l - 1]) << n ; } else { int i; long long x; cin >> i >> x; i--; long long val = query(1, 0, n, i, i) + x; int lo = i; int hi = n; while (hi - lo > 1) { int mid = (hi + lo) / 2; if (query(1, 0, n, mid, mid) <= val) { lo = mid; } else { hi = mid; } } update(1, 0, n, i, lo, val); } } } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); srand(chrono::high_resolution_clock::now().time_since_epoch().count()); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int x1 = 0, x2 = 0, y1 = 0, y2 = 0, position = 0; int length = s.size(); for (int i = 0; i < length; i++) { if (s[i] == R ) { x1++; position++; } if (s[i] == L ) { x1--; position--; } if (s[i] == U ) { y1++; position++; } if (s[i] == D ) { y1--; position--; } } if (length % 2 == 0) { printf( %d , (abs(x1) + abs(y1)) / 2); } else { cout << -1; } } |
#include <bits/stdc++.h> using namespace std; const long ka[6] = {0, 0, 0, 0, 2, 4}; int main() { long long n, m; while (cin >> n >> m) { if (n > m) { int tmp = n; n = m; m = tmp; } long long ret; if (n == 1) ret = m / 6 * 6 + ka[m % 6]; else if (n == 2) { if (m == 2) ret = 0; else if (m == 3) ret = 4; else if (m == 7) ret = 12; else ret = n * m; } else { if (n % 2 && m % 2) ret = n * m - 1; else ret = n * m; } cout << ret << endl; } return 0; } |
#include <bits/stdc++.h> int n, i, x, ind[210], o = 0, e = 0; char a[200001], arr[200010]; int main() { scanf( %s , a); n = strlen(a); if (n == 1) { printf( %s n , a); return 0; } for (int i = 0; i < n; i++) { ind[a[i]]++; } for (int i = a ; i <= z ; i++) { if (ind[i] > 0) { ind[i] % 2 == 0 ? e++ : o++; } } for (int i = z ; i >= a ; i--) { if (ind[i] % 2 != 0) { for (int x = a ; x < i; x++) { if (ind[x] % 2 != 0) { ind[x]++, ind[i]--; break; } } } } int j = 0; for (int i = a ; i <= z ; i++) { if (ind[i] > 0) { for (int x = 0; x < ind[i] / 2; x++) { printf( %c , i); arr[j++] = i; } } } if (n % 2 != 0) { for (int i = a ; i <= z ; i++) { if (ind[i] % 2 == 1) { printf( %c , i); break; } } } for (int i = j - 1; i >= 0; i--) { printf( %c , arr[i]); } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; inline int read() { int x = 0; char c = getchar(); bool f = 0; while (!isdigit(c)) f |= (c == - ), c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return f ? -x : x; } int n, m, t; int sq[500005], a[500005], pos[500005], cnt[500005], ans[500005], st[500005], top; struct node { int l, r, id; } q[500005]; int nowx, nowy; inline bool operator<(node x, node y) { return (sq[x.l] ^ sq[y.l]) ? x.l < y.l : ((sq[x.l] & 1) ? x.r < y.r : x.r > y.r); } inline void Add(int x) { if (cnt[a[x]] == 1) { st[pos[a[x]]] = st[top]; pos[st[top]] = pos[a[x]]; pos[a[x]] = st[top--] = 0; } cnt[a[x]]++; if (cnt[a[x]] == 1) st[++top] = a[x], pos[a[x]] = top; } inline void Delete(int x) { if (cnt[a[x]] == 1) { st[pos[a[x]]] = st[top]; pos[st[top]] = pos[a[x]]; pos[a[x]] = st[top--] = 0; } cnt[a[x]]--; if (cnt[a[x]] == 1) st[++top] = a[x], pos[a[x]] = top; } int main() { n = read(), t = sqrt(n); for (register int i = 1; i <= n; ++i) a[i] = read(), sq[i] = i / t; m = read(); for (register int i = 1; i <= m; ++i) q[i].l = read(), q[i].r = read(), q[i].id = i; sort(q + 1, q + m + 1); nowx = 1, nowy = 0; for (register int i = 1; i <= m; ++i) { while (nowx < q[i].l) Delete(nowx++); while (nowx > q[i].l) Add(--nowx); while (nowy > q[i].r) Delete(nowy--); while (nowy < q[i].r) Add(++nowy); ans[q[i].id] = st[top]; } for (register int i = 1; i <= m; ++i) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x1, x2, x3; cin >> x1 >> x2 >> x3; int min, max; int t = (x1 < x2) ? x1 : x2; min = (t < x3) ? t : x3; t = (x1 > x2) ? x1 : x2; max = (t > x3) ? t : x3; cout << max - min; } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; const int p = 998244353; int n, k, cnt, a[N], d[N], jc[N], ny[N]; long long s = 1, ans; inline int read() { int ans = 0; char c = getchar(); while (c < 48 || c > 57) c = getchar(); while (c >= 48 && c <= 57) ans = (ans << 3) + (ans << 1) + (c ^ 48), c = getchar(); return ans; } inline long long ksm(long long x, int y) { long long z = 1; while (y) { if (y & 1) z = z * x % p; x = x * x % p, y >>= 1; } return z; } inline long long C(int x, int y) { return 1ll * jc[x] * ny[y] % p * ny[x - y] % p; } int main() { n = read(), k = read() % p; for (register int i = 1; i <= n; ++i) { int u = read(); if (u != a[cnt]) a[++cnt] = u; else s = s * k % p; } if (a[1] == a[cnt]) --cnt, s = s * k % p; if (cnt <= 1) { putchar(48); return 0; } d[0] = jc[0] = 1, ans = ksm(k, cnt); for (register int i = 1; i <= cnt; ++i) d[i] = 1ll * d[i - 1] * (k - 2) % p, jc[i] = 1ll * jc[i - 1] * i % p; ny[cnt] = ksm(jc[cnt], p - 2); for (register int i = cnt - 1; i >= 0; --i) ny[i] = 1ll * ny[i + 1] * (i + 1) % p; for (register int i = 0; (i << 1) <= cnt; ++i) ans = (ans - C(cnt, i) * C(cnt - i, i) % p * d[cnt - (i << 1)] % p + p) % p; ans = ans * ny[2] % p * s % p; printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); 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; } int v[100066]; vector<int> prime; int mu[100066]; void init() { int N = 100000; for (int i = 2; i <= N; i++) { if (!v[i]) { mu[i] = 1; v[i] = i; prime.push_back(i); } for (auto p : prime) { if (p > v[i] || i > N / p) break; v[i * p] = p; if (i % p == 0) mu[i * p] = 0; else mu[i * p] = -mu[i]; } } } long long solve(vector<pair<int, int> > vec) { long long sum = 0, all = 0; long long all1 = 0; for (auto x : vec) { sum = (sum + 1ll * x.first * x.second) % mod; all = (all + x.second) % mod; all1 = (all1 + x.second) % (mod - 1); } long long pp = powmod(2, all1 - 2 + mod - 1) * ((all - 1 + mod) % mod) % mod; long long ret = 0; long long two0 = powmod(2, all1 - 3 + mod - 1); long long two1 = two0 * 2 % mod; long long two2 = two1 * 2 % mod; long long qq = two1 + (all - 2 + mod) * two0; qq = qq % mod; for (auto x : vec) { ret += pp * x.first % mod * x.first % mod * x.second % mod; ret %= mod; long long tmp = (sum + mod - x.first) % mod; tmp = 1ll * x.second * x.first % mod * tmp % mod * qq % mod; ret = (ret + tmp) % mod; } return ret; } int n; vector<pair<int, int> > vec, V[100066]; int main() { init(); scanf( %d , &n); int x, y; for (int i = 1; i <= n; i++) { scanf( %d%d , &x, &y); vec.push_back(make_pair(x, y)); for (int j = 1; 1ll * j * j <= x; j++) { if (x % j) continue; V[j].push_back(make_pair(x, y)); if (x / j != j) V[x / j].push_back(make_pair(x, y)); } } long long ans = solve(vec); for (int i = 2; i <= 100000; i++) { long long tmp = (-solve(V[i]) * mu[i] + mod) % mod; ans = (ans + tmp) % mod; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline 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; } struct edge { int next, to; } e[900500]; vector<int> v[900500]; int cnt, head[900500], size[900500], col[900500]; bool used[900500], vis[900500]; inline void ins(int u, int v) { e[++cnt].to = v; e[cnt].next = head[u]; head[u] = cnt; } inline void insert(int u, int v) { ins(u, v); ins(v, u); } void dfs(int x) { int j = 1; vis[x] = 1; for (int i = 0; i < size[x]; i++) used[col[v[x][i]]] = 1; for (int i = 0; i < size[x]; i++) if (!col[v[x][i]]) { for (; used[j]; j++) ; used[col[v[x][i]] = j] = 1; } for (int i = 0; i < size[x]; i++) used[col[v[x][i]]] = 0; for (int i = head[x]; i; i = e[i].next) if (!vis[e[i].to]) dfs(e[i].to); } int main() { int n = read(), m = read(), ans = 0; for (int i = 1; i <= n; i++) { size[i] = read(); for (int j = 1; j <= size[i]; j++) v[i].push_back(read()); ans = max(ans, size[i]); } for (int i = 1; i < n; i++) insert(read(), read()); printf( %d n , ans ? ans : 1); dfs(1); for (int i = 1; i <= m; i++) printf( %d , col[i] ? col[i] : 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int Z = (int)3e3 + 228; const int N = (int)1e6 + 228; const int INF = (int)1e9 + 228; const int MOD = (int)1e9 + 7; int n, d; long long a[N], delta[N], k; bool can(long long mid) { fill(delta + 1, delta + 1 + n, 0LL); for (int i = 1; i <= n; i++) { delta[max(1, i - d)] += a[i]; delta[i + d + 1] -= a[i]; } long long cur = 0, res = 0; for (int i = 1; i <= n; i++) { cur += delta[i]; if (cur < mid) { res += mid - cur; if (res > k) return false; delta[i + 2 * d + 1] -= mid - cur; cur = mid; } } return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> d >> k; for (int i = 1; i <= n; i++) cin >> a[i]; long long l = 0, r = 2e18 + 5; while (l < r) { long long mid = (l + r + 1) / 2; if (can(mid)) l = mid; else r = mid - 1; } cout << l; return 0; } |
#include <bits/stdc++.h> using namespace std; bool shown[100001]; vector<pair<int, int> > v; vector<int> cycle; vector<vector<int> > ans; int main() { int n, tmp; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &tmp); v.push_back(make_pair(tmp, i)); } sort(v.begin(), v.end()); for (int i = 0; i < n; i++) { int j = i; while (!shown[v[j].second]) { shown[v[j].second] = true; cycle.push_back(v[j].second); j = v[j].second; } if (cycle.size() != 0) { sort(cycle.begin(), cycle.end()); ans.push_back(cycle); cycle.clear(); } } printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i].size()); for (int j = 0; j < ans[i].size(); j++) printf( %d , ans[i][j] + 1); printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; long long int n, c11 = 0, c00 = 0, c10 = 0, c01 = 0, p1 = 0, p2 = 0; cin >> n >> s1 >> s2; n *= 2; for (int i = 0; i < n; i++) { if (s1[i] == s2[i]) { if (s1[i] == 1 ) c11++; else c00++; } else { if (s1[i] == 1 ) c10++; else c01++; } } if (c11 % 2) { p1 = c11 / 2 + 1; p2 = c11 / 2; if (c01 <= c10) { p2 += c01; p1 += c01 + (c10 - c01) / 2; } else { p2 += c10 + (c01 - c10) / 2 + (c01 - c10) % 2; p1 += c10; } } else { p1 = c11 / 2; p2 = c11 / 2; if (c01 <= c10) { p2 += c01; p1 += c01 + (c10 - c01) / 2 + (c10 - c01) % 2; } else { p2 += c10 + (c01 - c10) / 2; p1 += c10; } } if (p1 > p2) cout << First << endl; else if (p1 == p2) cout << Draw << endl; else cout << Second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, x, r, z, sol; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> x; if (r > 0) { x = x - k + r; sol++; } z = x / k; sol += z; r = x % k; } if (r > 0) { sol++; } cout << sol; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1E6; int n, q, sz = 1; long long value[6]; long long dp[MAXN]; inline void upData(int v, long long w) { for (int i = MAXN - 1; i >= v; --i) dp[i] = max(dp[i], dp[i - v] + w); } inline void Divide(int x) { int v = 3 * sz, all = min(MAXN / v, n); for (int i = 1; i < all; i <<= 1) upData(v * i, 1ll * value[x] * i), all -= i; upData(v * all, 1ll * value[x] * all); } int main(void) { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n, n = 3 * (n - 1); for (int i = 0; i < 6; ++i) cin >> value[i]; for (int i = 3; i < MAXN; ++i) { int num = i, base = 0; while (num) { if (((num % 10) % 3) == 0) dp[i] += 1ll * value[base] * ((num % 10) / 3); num /= 10, ++base; } } for (int i = 0; i < 6; ++i) Divide(i), sz *= 10; cin >> q; while (q--) cin >> n, cout << dp[n] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000000 + 7; map<int, vector<int>> mp; vector<int> cur(1, -1), goal(1, -1), done(1, -1); vector<int> ans; int c; void funct(int node, int level, int even, int odd) { int r = level % 2; done[node] = 1; if (r == 1 && odd == 1) cur[node] = 1 - cur[node]; else if (r == 0 && even == 1) cur[node] = 1 - cur[node]; if (cur[node] != goal[node]) { c++; ans.push_back(node); cur[node] = goal[node]; if (level % 2 == 0) even = 1 - even; else odd = 1 - odd; } for (int i = 0; i < mp[node].size(); i++) { if (done[mp[node][i]] == 0) funct(mp[node][i], level + 1, even, odd); } } int main() { int n; cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; mp[a].push_back(b); mp[b].push_back(a); } int num; for (int i = 1; i <= n; i++) { scanf( %d , &num); cur.push_back(num); } for (int i = 1; i <= n; i++) { scanf( %d , &num); goal.push_back(num); done.push_back(0); } c = 0; int level = 0, even = 0, odd = 0; funct(1, level, even, odd); cout << c << endl; if (c > 0) { int i = 0; while (i < ans.size()) { printf( %d n , ans[i]); i++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[60], b[60]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cin >> m; for (int i = 0; i < m; i++) cin >> b[i]; int BG = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (b[j] % a[i] == 0) { if (b[j] / a[i] > BG) { BG = b[j] / a[i]; } } } } int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (b[j] % a[i] == 0 && b[j] / a[i] == BG) { ans++; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; using ll = long long; using ld = long double; ll mod = 998244353; ll gcd(ll a, ll b) { if (a == 0 or b == 0) return a + b; return gcd(b, a % b); } ll sum(ll a, ll b) { a += b; a %= mod; return a; } ll sub(ll a, ll b) { a += mod - b; a %= mod; return a; } inline ll mul(ll a, ll b) { if (a * b < mod) return a * b; return a * b % mod; } inline ll pew(ll a, ll b) { ll res = 1; while (b) { if (b & 1) res = mul(res, a); a = mul(a, a); b /= 2; } return res; } int parent[600001]; int rnk[600001]; int suk[600001]; void make_set(int v) { parent[v] = v; rnk[v] = 0; suk[v] = 0; } int find_set(int v) { if (v == parent[v]) return v; return parent[v] = find_set(parent[v]); } void union_sets(int a, int b) { a = find_set(a); b = find_set(b); if (a != b and (suk[a] * suk[b] == 0)) { if (rnk[a] < rnk[b]) swap(a, b); parent[b] = a; if (rnk[a] == rnk[b]) ++rnk[a]; suk[a] += suk[b]; } } vector<ll> primes(ll cur) { vector<ll> res; if (cur <= 1) return res; for (ll j = 2; j * j <= cur; j++) { if (cur % j == 0) { res.push_back(j); while (cur % j == 0) { cur /= j; } } } if (cur != 1) res.push_back(cur); return res; } int main() { ios_base::sync_with_stdio(false); ll n; cin >> n; srand(35324); vector<ll> kek(n); for (int i = 0; i < n; i++) { cin >> kek[i]; } vector<ll> lul(n); for (int i = 0; i < n; i++) { lul[i] = kek[i]; } random_shuffle(lul.begin(), lul.end()); ll bst = n; for (int q = 0; q < n and q < 23; q++) { ll cur = lul[q] - 1; vector<ll> pr = primes(cur); for (int j = 0; j < pr.size(); j++) { ll p = pr[j]; ll cnt = 0; for (int i = 0; i < n; i++) { ll a = kek[i] % p; if (kek[i] == a) { cnt += p - a; } else { cnt += min(a, p - a); } } bst = min(bst, cnt); } cur = lul[q]; pr = primes(cur); for (int j = 0; j < pr.size(); j++) { ll p = pr[j]; ll cnt = 0; for (int i = 0; i < n; i++) { ll a = kek[i] % p; if (kek[i] == a) { cnt += p - a; } else { cnt += min(a, p - a); } } bst = min(bst, cnt); } cur = lul[q] + 1; pr = primes(cur); for (int j = 0; j < pr.size(); j++) { ll p = pr[j]; ll cnt = 0; for (int i = 0; i < n; i++) { ll a = kek[i] % p; if (kek[i] == a) { cnt += p - a; } else { cnt += min(a, p - a); } } bst = min(bst, cnt); } } cout << bst << endl; } |
#include <bits/stdc++.h> using namespace std; void solve() { int flag = 1; int a, b, c, d; cin >> a >> b >> c >> d; if ((a + b) % 2 == 0) { } else flag = -1; if (a + d == 0) { if (flag == 1) { cout << Tidak Tidak Ya Tidak << n ; return; } else { cout << Tidak Ya Tidak Tidak << n ; return; } } if (b + c == 0) { if (flag == 1) { cout << Tidak Tidak Tidak Ya << n ; return; } else { cout << Ya Tidak Tidak Tidak << n ; return; } } if (flag == 1) { cout << Tidak Tidak Ya Ya << n ; return; } else { cout << Ya Ya Tidak Tidak << n ; return; } } int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int _ = 1; cin >> _; while (_--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> a(n); for (auto &x : a) cin >> x; sort(a.begin(), a.end()); set<int> s; int ans = 0, x; for (int i = 0; i < n; i++) { x = a[i]; if (s.find(x) != s.end()) { while (1) { if (s.find(x) != s.end()) ans++; else break; x++; } } s.insert(x); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> int main() { char a[1000]; scanf( %s , a); if (a[0] > 96) a[0] -= 32; printf( %s , a); } |
#include <bits/stdc++.h> using namespace std; const int dx[] = {-1, 1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const int max_n = 1000; char a[max_n][max_n]; int res[max_n][max_n], val[max_n * max_n]; vector<pair<int, int> > comp[max_n * max_n]; bool used[10]; bool range(int x, int l, int r) { return ((l <= x) && (x <= r)); } int main() { int n, m, r = 0; scanf( %d%d n , &n, &m); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) scanf( %c , &a[i][j]); scanf( n ); } memset(res, -1, sizeof(res)); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (a[i][j] == . ) if ((j < m - 1) && (a[i][j + 1] == . )) { res[i][j] = res[i][j + 1] = r++, a[i][j] = a[i][j + 1] = ~ ; } else if ((i < n - 1) && (a[i + 1][j] == . )) res[i][j] = res[i + 1][j] = r++, a[i][j] = a[i + 1][j] = ~ ; else { for (int d = 0; d < 4; ++d) if (range(i + dx[d], 0, n - 1) && range(j + dy[d], 0, m - 1) && (a[i + dx[d]][j + dy[d]] != # )) { res[i][j] = res[i + dx[d]][j + dy[d]]; break; } if (res[i][j] != -1) continue; printf( -1 n ); return 0; } for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (res[i][j] != -1) comp[res[i][j]].push_back(make_pair(i, j)); for (int rc = 0; rc < r; ++rc) { memset(used, 0, sizeof(used)); for (int k = 0; k < (int)comp[rc].size(); ++k) for (int d = 0; d < 4; ++d) { int cur = res[comp[rc][k].first + dx[d]][comp[rc][k].second + dy[d]]; if (cur < rc) used[val[cur]] = true; } for (int k = 0; k < 10; ++k) if (!used[k]) { val[rc] = k; break; } } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) printf( %c , res[i][j] == -1 ? # : 0 + val[res[i][j]]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; int a[10000]; int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) scanf( %d , a + i); if (n % 2 == 0) puts( 0 ); else { long long r = m / ((n + 1) / 2); long long hi = (1 << 30); for (int i = 0; i < n; i += 2) hi = min(hi, (long long)a[i]); cout << min(hi, r * k) << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 1e5 + 5; int main() { int n, f[MaxN], cnt[MaxN], mm = 0, ans = 0; scanf( %d , &n); memset(f, 0, sizeof(f)); memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; i++) { int a; scanf( %d , &a); cnt[f[a]]--; f[a]++; cnt[f[a]]++; mm = max(mm, f[a]); bool flag = 0; if (cnt[1] == i) flag = 1; else if (cnt[i] == 1) flag = 1; else if (cnt[1] == 1 && cnt[mm] * mm == i - 1) flag = 1; else if (cnt[mm - 1] * (mm - 1) == i - mm && cnt[mm] == 1) flag = 1; if (flag == 1) ans = i; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll OO = 0x3f3f3f3f3f3f3f3fLL; int di[8] = {0, 0, 1, -1, -1, 1, -1, 1}; int dj[8] = {1, -1, 0, 0, 1, 1, -1, -1}; string ys = YES , no = NO ; const int N = 1e5 + 5, M = 5 * (1 << 10) + 10; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; bool ok = 0; for (int i = 0; i < n; i++) { int cnta = 0, cntb = 0; for (int j = i; j < n; j++) { cnta += (s[j] == a ); cntb += (s[j] == b ); if (cnta == cntb) { cout << i + 1 << << j + 1 << n ; ok = 1; goto out; } } } out:; if (!ok) cout << -1 -1 << n ; } } |
#include <bits/stdc++.h> using namespace std; int n; string a; void input() { cin >> n; cin >> a; } void solve() { int ans = 0; for (int i = 1; i < n; ++i) { ans += (a[i] == a[i - 1]); } cout << (ans + 1) / 2 << n ; } int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { input(); solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int A = 0, B = 0, C = 0; void add(char o) { if (o == A ) { A++; } else { if (o == B ) { B++; } else { if (o == C ) { C++; } } } } void sub(char o) { if (o == A ) { A--; } else { if (o == B ) { B--; } else { if (o == C ) { C--; } } } } int main() { char c[3][3]; for (int i = 0; i < 3; i++) { cin >> c[i][0]; cin >> c[i][1]; cin >> c[i][2]; if (c[i][1] == > ) { add(c[i][0]); sub(c[i][2]); } else { if (c[i][1] == < ) { sub(c[i][0]); add(c[i][2]); } } } if (A == 0 && B == 0 && C == 0) { cout << Impossible ; } else { if (A == -2 && B == 0 && C == 2) { cout << ABC ; } else { if (B == -2 && C == 0 && A == 2) { cout << BCA ; } else { if (C == -2 && B == 0 && A == 2) { cout << CBA ; } else { if (A == -2 && C == 0 && B == 2) { cout << ACB ; } else { if (C == -2 && A == 0 && B == 2) { cout << CAB ; } else { if (C == 2 && A == 0 && B == -2) { cout << BAC ; } } } } } } } return 0; } |
#include <bits/stdc++.h> const long long oo = (long long)1e18 + 1; using namespace std; int n, q; int b[200002]; pair<int, int> a[200002]; int T[200002]; vector<pair<int, int> > query[200002]; int k[200002], p[200002]; int res[200002]; void upd(int x) { while (x < 200002) { T[x]++; x = x + (x & (x ^ (x - 1))); } } int get(int x) { int res = 0; while (x > 0) { res += T[x]; x = x - (x & (x ^ (x - 1))); } return res; } int find_kth(int cnt) { int l = 1; int r = n; int res = n; while (l <= r) { int mid = (l + r) >> 1; int count_value = get(mid); if (count_value >= cnt) { res = mid; r = mid - 1; } else l = mid + 1; } return res; } bool cmp(pair<int, int> x, pair<int, int> y) { return x.first > y.first || (x.first == y.first && x.second < y.second); } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; b[i] = x; a[i] = make_pair(x, i); } sort(a + 1, a + n + 1, cmp); cin >> q; for (int i = 1; i <= q; i++) { cin >> k[i] >> p[i]; query[k[i]].push_back(make_pair(p[i], i)); } for (int i = 1; i <= n; i++) { upd(a[i].second); for (int j = 0; j < query[i].size(); j++) { pair<int, int> cur_query = query[i][j]; int pos = cur_query.first; int rpos = cur_query.second; res[rpos] = b[find_kth(pos)]; } } for (int i = 1; i <= q; i++) cout << res[i] << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; inline int read() { char c = getchar(); int tot = 1; while ((c < 0 || c > 9 ) && c != - ) c = getchar(); if (c == - ) { tot = -1; c = getchar(); } int sum = 0; while (c >= 0 && c <= 9 ) { sum = sum * 10 + c - 0 ; c = getchar(); } return sum * tot; } inline void wr(int x) { if (x < 0) { putchar( - ); wr(-x); return; } if (x >= 10) wr(x / 10); putchar(x % 10 + 0 ); } inline void wrn(int x) { wr(x); putchar( n ); } inline void wri(int x) { wr(x); putchar( ); } inline void wrn(int x, int y) { wri(x); wrn(y); } inline void wrn(int a, int b, int c) { wri(a); wrn(b, c); } const int N = 205; int n, m, now, cnt, l[N], r[N], d[N]; double ans[N], f[N][N], len, ll, rr, p1, p2, p3; void calc(int L, int R) { cnt = 1; for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) f[i][j] = 0; f[0][0] = 1; for (int i = 1; i <= n; i++) if (i != now) { if (r[i] <= L) { cnt++; continue; } if (l[i] >= R) continue; len = r[i] - l[i]; p1 = (L - l[i]) / len; p2 = (R - L) / len; p3 = (r[i] - R) / len; for (int j = i; j >= 0; j--) for (int k = i - j; k >= 0; k--) { f[j + 1][k] += f[j][k] * p1; f[j][k + 1] += f[j][k] * p2; f[j][k] *= p3; } } for (int i = 0; i + cnt <= n; i++) { for (int j = n - i - cnt; j >= 0; j--) ans[i + cnt] += f[i][j] * (R - L) / (j + 1), ans[i + j + 1 + cnt] -= f[i][j] * (R - L) / (j + 1); } } signed main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &l[i], &r[i]); d[++m] = l[i]; d[++m] = r[i]; } sort(d + 1, d + m + 1); int k = 1; for (int i = 2; i <= m; i++) if (d[i] != d[i - 1]) { k++; if (k != i) d[k] = d[i]; } m = k; for (int i = 1; i <= n; i++) { now = i; for (int j = 1; j <= n; j++) ans[j] = 0; for (int j = 1; j < m; j++) if (l[i] <= d[j] && r[i] >= d[j + 1]) calc(d[j], d[j + 1]); for (int j = 1; j <= n; j++) ans[j] += ans[j - 1]; for (int j = 1; j <= n; j++) printf( %.6lf , ans[j] / (r[i] - l[i])); puts( ); } } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 16; int n; int mod[MAXN], rem[MAXN]; int egcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1, y = 0; return a; } int g = egcd(b, a % b, x, y); swap(x, y); y -= x * (a / b); return g; } int mymod(int x, int mod) { x %= mod; if (x < 0) x += mod; return x; } bool combine(int &n1, int &a1, int n2, int a2) { int m1, m2, g = egcd(n1, n2, m1, m2); if (a1 % g != a2 % g) return false; int n3 = n1 / g * n2, a3 = mymod(a1 + m1 * (n1 / g) * (a2 - a1), n3); n1 = n3, a1 = a3; return true; } void run() { scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &mod[i]); for (int i = (0); i < (n); ++i) scanf( %d , &rem[i]); long long den = 20922789888000LL, num = 0; for (int i = (0); i < (1 << n); ++i) { int cmod = 1, crem = 0, cnt = 0; bool ok = true; for (int j = (0); j < (n); ++j) if (i & (1 << j)) { ++cnt; if (!combine(cmod, crem, mod[j], rem[j])) ok = false; } if (!ok) continue; if (cnt % 2 == 0) num += den / cmod; else num -= den / cmod; } printf( %.9lf n , 1.0 * (den - num) / den); } int main() { run(); return 0; } |
#include <bits/stdc++.h> template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } inline int read() { static char ch; bool sgn = false; while (ch = getchar(), ch < 0 || ch > 9 ) if (ch == - ) sgn = true; int res = ch - 48; while (ch = getchar(), ch >= 0 && ch <= 9 ) res = res * 10 + ch - 48; return sgn ? -res : res; } const int N = 2e5 + 5, M = 1e6 + 1; const int mod = 1e9 + 7; int n, m, a[N], l[N], r[N], p[N]; int f[N], ans[N]; int tot, pri[N], min[M], first[M]; bool isp[M]; inline bool cmp(const int &x, const int &y) { return r[x] < r[y]; } inline int fpm(long long x, int Exp) { long long res = 1; for (; Exp > 0; x = x * x % mod, Exp >>= 1) if (Exp & 1) res = res * x % mod; return res; } inline void prime_init() { isp[0] = isp[1] = true; for (int i = 2; i < M; ++i) { if (!isp[i]) pri[++tot] = i, min[i] = i; for (int j = 1; j <= tot; ++j) { if (i * pri[j] >= M) break; isp[i * pri[j]] = true; min[i * pri[j]] = pri[j]; if (i % pri[j] == 0) break; } } } inline void insert(int x, const int &y) { for (; x <= n; x += x & -x) f[x] = (long long)f[x] * y % mod; } inline int Query(int x) { int res = 1; for (; x > 0; x -= x & -x) res = (long long)res * f[x] % mod; return res; } inline void add(const int &x) { int num = a[x], tmp; while (num > 1) { tmp = min[num]; if (first[tmp] > 0) { insert(first[tmp], fpm(tmp - 1, mod - 2)); insert(first[tmp], tmp); } first[tmp] = x; insert(x, tmp - 1); num /= tmp; } } int main() { n = read(); for (int i = (1); i <= (n); ++i) a[i] = read(), f[i] = 1; m = read(); for (int i = (1); i <= (m); ++i) { l[i] = read(); r[i] = read(); p[i] = i; } std::sort(p + 1, p + m + 1, cmp); prime_init(); int now = 0; for (int i = (1); i <= (m); ++i) { while (now < r[p[i]]) add(++now); ans[p[i]] = (long long)Query(r[p[i]]) * fpm(Query(l[p[i]] - 1), mod - 2) % mod; } for (int i = (1); i <= (m); ++i) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long st; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, k; cin >> n >> m >> k; if (k < n) { cout << (long long)(k + 1) << << 1; return 0; } k -= (long long)(n - 1); long long row = k / (long long)(m - 1), col; if ((long long)row * (long long)(m - 1) != (long long)k) row++; if ((long long)(row % (long long)2) == (long long)1) { st = (long long)(row - (long long)1) * (long long)(m - (long long)1); st++; col = k - st + (long long)2; } else { st = (long long)row * (long long)(m - 1); col = (long long)2 + st - k; } cout << (long long)(n - row + 1) << << col; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a[100000], b, c = 0, x, y, z, m, i, j, t; string s; vector<int> v; cin >> n; for (i = 0; i < n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); for (i = 0; i < n / 2; i++) { c += (v[i] + v[n - i - 1]) * (v[i] + v[n - i - 1]); } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 2; const long long N1 = 1e2 + 2; const long long mod = 1e9 + 7; const int MASK = 1 << 17 + 1; const int who = 6 * N * log2(N); long long power(long long a, long long b, long long c) { long long ret = 1; while (b) { if (b % 2 == 1) { ret = (ret * a) % c; } b /= 2; a = (a * a) % c; } return ret; } pair<int, int> a[N + 2]; map<pair<int, int>, long long> ma, ma1; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; int len = s.size(); int plus = 0, minus = 0; for (int j = 0; j < len; j++) { if (s[j] == ( ) { plus++; } else if (s[j] == ) ) { if (plus == 0) { minus++; } else { plus--; } } } a[i] = make_pair(plus, minus); if (min(plus, minus) == 0) { ma[a[i]]++; } } long long tm1 = ma[make_pair(0, 0)]; long long ans = tm1 * tm1; ma1[make_pair(0, 0)] = 1; for (int i = 0; i < n; i++) { int plus = a[i].first, minus = a[i].second; if (min(plus, minus) > 0 || ma1[a[i]] > 0) { continue; } ma1[a[i]]++; ma1[make_pair(minus, plus)]++; ans += ma[a[i]] * ma[make_pair(minus, plus)]; } cout << ans << n ; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:36777216 ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> inline void chkmax(T1 &a, T2 b) { if (a < b) a = b; } const string FILENAME = input ; const int MAXN = 100228; int n, m, d; vector<int> g[MAXN]; bool who[MAXN * 50]; int res = 0; vector<int> rg[MAXN]; vector<bool> used[102]; vector<int> ord; int used1[MAXN * 50]; int st[MAXN * 50]; int id[MAXN * 50]; int nxt[MAXN * 50]; int lst[MAXN * 50]; int uks = 0; int kek[MAXN * 50]; void add(int a, int b) { if (st[a] == 0) { uks++; st[a] = uks; id[uks] = b; lst[a] = uks; nxt[uks] = -1; } else { uks++; nxt[lst[a]] = uks; nxt[uks] = -1; lst[a] = uks; id[uks] = b; } } void dfs1(int u, int t) { used1[u * d + t] = true; for (auto h : g[u]) { if (!used1[h * d + (t + 1) % d]) { dfs1(h, (t + 1) % d); } } ord.push_back(u * d + t); } int used2[MAXN]; void dfs2(int u, int t, int c) { used1[u * d + t] = c; if (who[u * d + t]) { if (used2[u] != c) { kek[c]++; used2[u] = c; } } for (auto h : rg[u]) { if (!used1[h * d + (t - 1 + d) % d]) { dfs2(h, (t - 1 + d) % d, c); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> d; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--, v--; g[u].push_back(v); rg[v].push_back(u); } for (int i = 0; i < n; i++) { string s; cin >> s; for (int j = 0; j < d; j++) { if (s[j] == 1 ) { who[i * d + j] = true; } } } for (int i = 0; i < n * d; i++) { if (!used1[i]) { dfs1(i / d, i % d); } } memset(used1, 0, sizeof(used1)); int cur = 1; reverse((ord).begin(), (ord).end()); for (auto x : ord) { if (!used1[x]) { dfs2(x / d, x % d, cur); cur++; } } for (int i = 0; i < n * d; i++) { for (auto x : g[i / d]) { int f = (i % d + 1) % d; if (used1[i] != used1[x * d + f]) { add(used1[i], used1[x * d + f]); } } } int ff = used1[0]; for (int x = cur - 1; x >= 1; x--) { int dp = 0; int cur = st[x]; if (cur) { while (cur != -1) { chkmax(dp, kek[id[cur]]); cur = nxt[cur]; } } kek[x] += dp; } cout << kek[ff] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; bool f[100009]; pair<int, int> a[100009]; vector<int> v[100009]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); a[i].second = i; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) if (!f[i]) { int x = i; while (!f[x]) { f[x] = 1; v[m].push_back(x); x = a[x].second; } m++; } printf( %d n , m); for (int i = 0; i < m; i++) { printf( %d , v[i].size()); for (int j = 0; j < v[i].size(); j++) printf( %d , v[i][j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void arr(string &s); int main() { int n = 0, k = 0, m = 0; bool b = 0; cin >> n >> k; string s = ; cin >> s; arr(s); for (int i = 0; i < s.length(); i++) switch (s[i]) { case G : m = i; i = s.length(); break; } for (int i = m; i < s.length(); i += k) switch (s[i]) { case T : b = 1; i = s.length(); break; case # : i = s.length(); break; } switch (b) { case 1: cout << YES n ; break; default: cout << NO n ; } } void arr(string &s) { int a = 0, b = 0; string v = s; for (int i = 0; i < s.length(); i++) { switch (s[i]) { case G : a = i; break; case T : b = i; break; } } if (a > b) { for (int i = 1; i <= s.length(); i++) v[i - 1] = s[s.length() - i]; s = v; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], b[N], na[N], nb[N], t1[N], t2[N], c[N], tp, q[N], mx[N], x, n, m, i, j; long long ans; void init(int* a, int* ans, int n) { for (memset(ans, 0x3f, (n + 3) << 2), tp = 0, i = 1; i <= n; ++i) { j = a[i]; while (tp && a[i] < a[q[tp]]) j = max(j, mx[tp--]); if (tp) ans[i] = min(ans[i], j); q[++tp] = i; mx[tp] = j; } for (tp = 0, i = n; i; --i) { j = a[i]; while (tp && a[i] <= a[q[tp]]) j = max(j, mx[tp--]); if (tp) ans[i] = min(ans[i], j); q[++tp] = i; mx[tp] = j; } } void A(int x, int C) { while (x < N) c[x] += C, x += x & -x; } int Q(int x, int C = 0) { while (x > 0) C += c[x], x -= x & -x; return C; } int main() { for (scanf( %d%d%d , &n, &m, &x), i = 1; i <= n; ++i) scanf( %d , a + i), t1[i] = i; for (i = 1; i <= m; ++i) scanf( %d , b + i), t2[i] = i; init(a, na, n); init(b, nb, m); sort(t1 + 1, t1 + n + 1, [&](int x, int y) { return a[x] < a[y]; }); sort(t2 + 1, t2 + m + 1, [&](int x, int y) { return nb[x] < nb[y]; }); for (i = 1, j = m; i <= n; ++i) { while (j && a[t1[i]] + nb[t2[j]] > x) A(b[t2[j--]], 1); ans += Q(x - a[t1[i]]) - Q(x - na[t1[i]]); } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, c = getchar(), f = 0; for (; c > 9 || c < 0 ; f = c == - , c = getchar()) ; for (; c >= 0 && c <= 9 ; x = (x << 1) + (x << 3) + c - 0 , c = getchar()) ; return f ? -x : x; } inline void write(int x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) write(x / 10); putchar(x % 10 + 48); } const int N = 100 + 10, oo = 1e9; int n, m, q, a, b, f[N], ans[N], dis[N][N], st[N], en[N], vis[N]; bool must[N][N]; int dfs(int x, int y, int Time) { if (x == y) return ans[x]; if (vis[x] == Time) return f[x]; vis[x] = Time; f[x] = 0; for (int i = (int)1, _y = n; i <= _y; i++) if (dis[x][i] == 1 && dis[i][y] + 1 == dis[x][y]) f[x] = max(f[x], dfs(i, y, Time)); return f[x] = min(f[x], ans[x]); } int main() { n = read(), m = read(), a = read(), b = read(); for (int i = (int)1, _y = n; i <= _y; i++) for (int j = (int)i + 1, _y = n; j <= _y; j++) dis[i][j] = dis[j][i] = oo; for (int i = (int)1, _y = m; i <= _y; i++) { int u = read(), v = read(); dis[u][v] = 1; } for (int k = (int)1, _y = n; k <= _y; k++) for (int i = (int)1, _y = n; i <= _y; i++) if (i != k) for (int j = (int)1, _y = n; j <= _y; j++) if (i != j && j != k && dis[i][j] > dis[i][k] + dis[k][j]) dis[i][j] = dis[i][k] + dis[k][j]; q = read(); for (int i = (int)1, _y = q; i <= _y; i++) { st[i] = read(), en[i] = read(); if (dis[st[i]][en[i]] == oo) continue; memset(vis, 0, sizeof vis); for (int j = (int)1, _y = n; j <= _y; j++) if (dis[st[i]][j] + dis[j][en[i]] == dis[st[i]][en[i]]) vis[dis[st[i]][j]]++; for (int j = (int)1, _y = n; j <= _y; j++) if (dis[st[i]][j] + dis[j][en[i]] == dis[st[i]][en[i]] && vis[dis[st[i]][j]] == 1) must[i][j] = 1; } for (int i = (int)1, _y = n; i <= _y; i++) ans[i] = oo, vis[i] = 0; ans[b] = 0; for (int Time = (int)1, _y = n; Time <= _y; Time++) { memset(vis, 0, sizeof vis); for (int i = (int)1, _y = q; i <= _y; i++) if (dis[st[i]][en[i]] != oo) for (int j = (int)1, _y = n; j <= _y; j++) if (must[i][j]) ans[j] = min(ans[j], dfs(j, en[i], i) + 1); } printf( %d n , ans[a] == oo ? -1 : ans[a]); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { long long m = 1, ans = 1; long long n; cin >> n; while (ans < n) { m++; ans += 2; } cout << m << n ; long long x = 1, y = 1; cout << 1 << << 1 << n ; x++; for (long long i = 1; i < n; i++) { cout << x << << y << n ; if (i == n - 1) break; i++; cout << x << << y + 1 << n ; x++; y++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int ST = 100010; const int ST1 = 1000010; const long long MOD = 1000000007; long long ABS(long long a) { if (a < 0) return a * (-1); else return a; } int mas[30]; bool ans = true; void bad() { cout << NO ; exit(0); } vector<vector<int> > ppp; int sz = 0; void per(vector<int> &t) { if ((int)((t).size()) == sz) { ppp.push_back(t); } else { t.push_back(0); per(t); t.pop_back(); t.push_back(1); per(t); t.pop_back(); } } void per(vector<int> val, int ed, vector<int> zap) { if ((int)((val).size()) == 0) { if (ed == 0) { cout << YES ; exit(0); } else return; } vector<vector<int> > pp; vector<int> em; sz = (int)((zap).size()); ppp.clear(); per(em); pp = ppp; int tek = val[(int)((val).size()) - 1] - 1; val.pop_back(); int ost = 0; for (int i = 0; i < (int)((pp).size()); i++) { vector<int> next; next.push_back(tek + 1); ost = 0; int kk = 0; for (int j = 0; j < (int)((pp[i]).size()); j++) { if (pp[i][j] == 1) { ost += zap[j]; kk++; } else next.push_back(zap[j]); } if (ost <= tek) { int s = tek - ost; if (s > ed) continue; kk += s; if (kk == 1) continue; per(val, ed - s, next); } } } int main() { int n; cin >> n; if (n == 1) { cout << YES ; return 0; } int kk = 0; for (int i = 0; i < n; i++) { cin >> mas[i]; if (mas[i] == 2) bad(); if (mas[i] == 1) kk++; } sort(mas, mas + n); int mn = n / 2; if (kk < mn) bad(); vector<int> t; int nol = 0; for (int i = 0; i < n; i++) if (mas[i] != 1) t.push_back(mas[i]); else nol++; vector<int> em; reverse(t.begin(), t.end()); per(t, nol, em); cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, sgn = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) sgn = -1; for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return x * sgn; } const int N = 1e5 + 10; int n, b[N << 1], tot, l[N], r[N], deg[N << 1], h[N << 1], cnt = 1, now[N << 1], ans[N << 1]; struct edge { int v, w, nxt; } e[N << 2]; bool v[N << 2], vis[N << 1]; void link(int x, int y, int w) { e[++cnt] = (edge){y, w, h[x]}; h[x] = cnt; } void dfs(int x) { vis[x] = 1; for (int i = now[x], y; i; i = e[now[x]].nxt) { now[x] = i; if (v[i]) continue; y = e[i].v; v[i] = v[i ^ 1] = 1; ans[e[i].w] = x < y; dfs(y); } } int main() { n = read(); for (int i = 1; i <= n; i++) b[++tot] = l[i] = read(), b[++tot] = r[i] = read() + 1; sort(b + 1, b + tot + 1); tot = unique(b + 1, b + tot + 1) - b - 1; for (int i = 1; i <= n; i++) { l[i] = lower_bound(b + 1, b + tot + 1, l[i]) - b; r[i] = lower_bound(b + 1, b + tot + 1, r[i]) - b; deg[l[i]]++; deg[r[i]]++; link(l[i], r[i], i); link(r[i], l[i], i); } int lst = 0; for (int i = 1; i <= tot; i++) { if (!(deg[i] & 1)) continue; if (lst) link(lst, i, 0), link(i, lst, 0), lst = 0; else lst = i; } for (int i = 1; i <= tot; i++) now[i] = h[i]; for (int i = 1; i <= tot; i++) if (!vis[i]) dfs(i); for (int i = 1; i <= n; i++) { if (ans[i]) printf( 1 ); else printf( 0 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; char *student; int *arr; struct node { int x; int y; int val; }; std::vector<node> v; std::vector<node> out; struct edge { int v; edge *left; edge *right; }; edge *ed; bool *flag; bool comp(node &a, node &b) { return (!(a.val < b.val || (a.val == b.val && a.x < b.x))); } void make_node(int x, int y) { if (student[x] ^ student[y]) { node temp; temp.x = x; temp.y = y; temp.val = abs(arr[x] - arr[y]); v.push_back(temp); push_heap(v.begin(), v.end(), comp); } } void print() { for (std::vector<node>::iterator it = out.begin(); it != out.end(); ++it) { node temp = *it; cout << temp.x + 1 << << temp.y + 1 << endl; } } void select() { while (true) { int l = -1, r = -1; while (v.size() > 0) { node temp = v.front(); pop_heap(v.begin(), v.end(), comp); v.pop_back(); l = temp.x; r = temp.y; if (flag[l] || flag[r]) { l = -1; r = -1; continue; } else { flag[l] = true; flag[r] = true; out.push_back(temp); break; } } if (l == -1) break; edge *lt = ed[l].left; edge *rt = ed[r].right; if (lt != NULL) { lt->right = rt; } if (rt != NULL) { rt->left = lt; } if (lt != NULL && rt != NULL) make_node(lt->v, rt->v); } } int main() { std::cout << std::fixed << std::setprecision(10); ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; student = new char[n]; arr = new int[n]; flag = new bool[n]; string s; cin >> s; for (int i = 0; i < n; i++) { student[i] = s[i]; int x; cin >> x; arr[i] = x; flag[i] = false; } for (int i = 0; i < n - 1; i++) { make_node(i, i + 1); } ed = new edge[n]; for (int i = 0; i < n; i++) { ed[i].v = i; ed[i].left = i > 0 ? &ed[i - 1] : NULL; ed[i].right = i < n - 1 ? &ed[i + 1] : NULL; } select(); cout << out.size() << endl; print(); } |
#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1); pair<long double, long double> sum(pair<long double, long double> a, pair<long double, long double> b) { return {a.first + b.first, a.second + b.second}; } long double cross(pair<long double, long double> a, pair<long double, long double> b) { return a.first * b.second - b.first * a.second; } pair<long double, long double> prod(long double k, pair<long double, long double> a) { return {k * a.first, k * a.second}; } pair<long double, long double> com(vector<pair<long double, long double> > &v) { auto i = v.begin(), end = v.end(), j = end - 1; auto ss = v.begin(); pair<long double, long double> res{0, 0}; long double A = 0; for (; i != end; j = i++) { pair<long double, long double> a = *i, b = *j; a.first -= ss->first; a.second -= ss->second; b.first -= ss->first; b.second -= ss->second; res = sum(res, prod(cross(b, a), sum(a, b))); A += cross(b, a); } return {res.first / A / 3 + ss->first, res.second / A / 3 + ss->second}; } long double dist(pair<long double, long double> a, pair<long double, long double> b) { long double dx = a.first - b.first; long double dy = a.second - b.second; return sqrt(dx * dx + dy * dy); } int main() { cin.sync_with_stdio(0); cin.tie(0); int n, q; cout << setprecision(20); cin >> n >> q; vector<pair<long double, long double> > poly(n); for (int i = 0; i < n; ++i) { cin >> poly[i].first >> poly[i].second; } pair<long double, long double> c = com(poly); vector<pair<long double, long double> > v(n); for (int i = 0; i < n; ++i) { v[i].first = dist(c, poly[i]); v[i].second = atan2((poly[i].second - c.second), (poly[i].first - c.first)); } bool first = 1; pair<int, int> cur{0, 1}; pair<pair<long double, long double>, pair<long double, long double> > cc{ poly[0], poly[1]}; pair<long double, long double> center; long double theta; while (q--) { int type; cin >> type; if (type == 1) { int f, t; cin >> f >> t; --f; --t; int m; pair<long double, long double> top; if (f == cur.first) { m = cur.second; top = cc.second; } else { m = cur.first; top = cc.first; } center = {top.first, top.second - v[m].first}; theta = PI / 2 - v[m].second; pair<long double, long double> other = { v[t].first * cos(theta + v[t].second) + center.first, v[t].first * sin(theta + v[t].second) + center.second}; cur = {m, t}; cc = {top, other}; first = 0; } else { int t; cin >> t; --t; if (first) { cout << poly[t].first << << poly[t].second << n ; } else { cout << v[t].first * cos(theta + v[t].second) + center.first << << v[t].first * sin(theta + v[t].second) + center.second << n ; } } } } |
#include <bits/stdc++.h> using namespace std; long long n, a, b, c; long long d; long long cnt1, cnt2; long long r; int main() { cin >> n >> a >> b >> c; d = b - c; if (n >= a) { cnt1 = n / a; r = n % a; if (r >= b) cnt1 += (r - b) / d + 1; } if (n >= b) { r = n - b; long long cnt = r / d + 1; cnt2 += cnt; cnt2 += (n - cnt * d) / a; } printf( %lld n , max(cnt1, cnt2)); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, i; int fi = 0, se = 0, th = 0, fo = 0; int main() { cin >> n; cout << +------------------------+ << endl; if (n >= 3) { n--; th++; } while (n) { if (n) { fi++; n--; } if (n) { se++; n--; } if (n) { fo++; n--; } } cout << | ; for (i = 11; i; i--) { if (fi) { cout << O. ; fi--; } else { cout << #. ; } } cout << |D|) << endl; cout << | ; for (i = 11; i; i--) { if (se) { cout << O. ; se--; } else { cout << #. ; } } cout << |.| << endl; cout << | ; if (th) { cout << O ; } else { cout << # ; } cout << .......................| << endl; cout << | ; for (i = 11; i; i--) { if (fo) { cout << O. ; fo--; } else { cout << #. ; } } cout << |.|) << endl; cout << +------------------------+ << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, temp, count = 0, found = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> temp; if (temp == i) ++count; else if (temp < i && a[temp] == i) found = 2; else if (found != 2) found = 1; a[i] = temp; } cout << count + found << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct sheet { long long xt, yt, xb, yb; }; sheet a[3]; long long flag = 0; void hor() { long long yc = a[0].yb; for (double x = a[0].xb; x <= a[0].xt; x += .5) { if (a[1].xb <= x && x <= a[1].xt && a[1].yb <= yc && yc <= a[1].yt) { continue; } else if (a[2].xb <= x && x <= a[2].xt && a[2].yb <= yc && yc <= a[2].yt) { continue; } else { flag = 1; return; } } yc = a[0].yt; for (double x = a[0].xb; x <= a[0].xt; x += .5) { if (a[1].xb <= x && x <= a[1].xt && a[1].yb <= yc && yc <= a[1].yt) { continue; } else if (a[2].xb <= x && x <= a[2].xt && a[2].yb <= yc && yc <= a[2].yt) { continue; } else { flag = 1; return; } } } void ver() { long long xc = a[0].xb; for (double y = a[0].yb; y <= a[0].yt; y += .5) { if (a[1].xb <= xc && xc <= a[1].xt && a[1].yb <= y && y <= a[1].yt) { continue; } else if (a[2].xb <= xc && xc <= a[2].xt && a[2].yb <= y && y <= a[2].yt) { continue; } else { flag = 1; return; } } xc = a[0].xt; for (double y = a[0].yb; y <= a[0].yt; y++) { if (a[1].xb <= xc && xc <= a[1].xt && a[1].yb <= y && y <= a[1].yt) { continue; } else if (a[2].xb <= xc && xc <= a[2].xt && a[2].yb <= y && y <= a[2].yt) { continue; } else { flag = 1; return; } } } int main() { for (int i = 0; i < 3; i++) { cin >> a[i].xb >> a[i].yb >> a[i].xt >> a[i].yt; } hor(); ver(); cout << (flag ? YES : NO ); } |
#include <bits/stdc++.h> using namespace std; void ret(string s) { cout << s; exit(0); } int main() { int x1, x2, y1, y2, n; cin >> n >> x1 >> y1 >> x2 >> y2; if (x1 * x2 == 0 && x1 + x2 == n) cout << min(n + y1 + y2, 3 * n - y1 - y2); else if (y1 * y2 == 0 && y1 + y2 == n) cout << min(n + x1 + x2, 3 * n - x1 - x2); else cout << abs(x1 - x2) + abs(y1 - y2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 34; const int M = 70; int n; int arr[N]; int dp[N][M * M][M]; int find(int pos, int sum, int cnt) { if (pos > n) { return (sum * 2 == cnt * (cnt - 1)) ? cnt : M; } if (dp[pos][sum][cnt] != -1) { return dp[pos][sum][cnt]; } int res = M; int cur = sum; int tot = cnt; for (int i = 1; tot < 65; ++i) { ++tot; cur += arr[pos]; if (cur * 2 >= tot * (tot - 1)) { res = min(res, find(pos + 1, cur, tot)); } } return dp[pos][sum][cnt] = res; } int deg[M]; void go(int pos, int sum, int cnt) { if (pos > n) { return; } int cur = sum; int tot = cnt; for (int i = 1; tot < 65; ++i) { ++tot; cur += arr[pos]; deg[tot] = arr[pos]; if (cur * 2 >= tot * (tot - 1)) { if (find(pos + 1, cur, tot) == find(pos, sum, cnt)) { go(pos + 1, cur, tot); return; } } } } int graph[M][M]; pair<int, int> out[M]; int main() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> arr[i]; } sort(arr + 1, arr + 1 + n); memset(dp, -1, sizeof(dp)); int m = find(1, 0, 0); go(1, 0, 0); for (int i = 1; i <= m; ++i) { out[i] = make_pair(deg[i], i); } sort(out + 1, out + 1 + m); for (int i = 1; i <= m; ++i) { for (int j = i + 1; j <= i + out[i].first; ++j) { graph[out[i].second][out[j].second] = 1; } for (int j = i + out[i].first + 1; j <= m; ++j) { graph[out[j].second][out[i].second] = 1; --out[j].first; } out[i].first = 0; sort(out + i + 1, out + 1 + m); } printf( %d n , m); for (int i = 1; i <= m; ++i) { for (int j = 1; j <= m; ++j) { printf( %d , graph[i][j]); } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int tmp, n, tr[100005 * 30][2], cnt; inline void insert(int x) { int p = 0, d; for (int i = 29; i >= 0; --i) { d = (x >> i) & 1; if (tr[p][d]) p = tr[p][d]; else { tr[p][d] = ++cnt; p = cnt; memset(tr[p], 0, sizeof(tr[p])); } } } int dfs(int p, int d) { if (!tr[p][0] && !tr[p][1]) return 0; if (!tr[p][0]) return dfs(tr[p][1], d - 1); if (!tr[p][1]) return dfs(tr[p][0], d - 1); return (1 << d) + min(dfs(tr[p][0], d - 1), dfs(tr[p][1], d - 1)); } int main() { while (~scanf( %d , &n)) { cnt = 0; memset(tr[0], 0, sizeof(tr[0])); for (int i = 1; i <= n; ++i) { scanf( %d , &tmp); insert(tmp); } int ans = dfs(0, 29); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { vector<long long> arr(4); for (int i = 0; i < 4; i++) cin >> arr[i]; int counter = 0; for (int i = 0; i < 4; i++) counter += arr[i] % 2; if (counter == 0 || counter == 1 || counter == 4) { cout << Yes n ; return; } else if (counter == 3) { if (arr[0] != 0 && arr[1] != 0 && arr[2] != 0) cout << Yes n ; else cout << No n ; } else cout << No n ; return; } int main() { int t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 250; int n, m, B, ans; int co[N], sx[N], sy[N]; int mp[N][N], id[N], fl[N]; bool cmp(int x, int y) { return sy[x] < sy[y]; } const int ND = 500; struct edge { int to, next, f, v; } e[N * N]; int head[ND], cur[ND], tot; int S, T, dis[ND]; int q[ND * ND], tp[ND], fr[ND]; bool vis[ND]; void add(int x, int y, int v) { e[++tot] = (edge){y, head[x], 1, v}; head[x] = tot; e[++tot] = (edge){x, head[y], 0, v}; head[y] = tot; } int times = 0; bool bfs() { for (int i = (int)(1); i <= (int)(T); i++) dis[i] = 2333, vis[i] = 0; int h = 0, t = 1; q[1] = S; dis[S] = 1; while (h != t) { int x = q[++h]; vis[x] = 0; for (int i = head[x]; i; i = e[i].next) if (dis[e[i].to] > dis[x] + e[i].v && e[i].f) { dis[e[i].to] = dis[x] + e[i].v; fr[e[i].to] = i; if (!vis[e[i].to]) { vis[e[i].to] = 1; q[++t] = e[i].to; } } } if (dis[T] == 2333) return 0; return 1; } int dfs(int x, int flow) { if (x == T) return flow; int k, rest = flow; vis[x] = 1; for (int &i = cur[x]; i; i = e[i].next) if (e[i].f && !vis[e[i].to] && dis[e[i].to] == dis[x] + e[i].v) { k = dfs(e[i].to, min(rest, e[i].f)); e[i].f -= k; e[i ^ 1].f += k; rest -= k; if (!rest) break; } if (rest) dis[x] = -1; vis[x] = 0; return flow - rest; } struct fuckmdndandwzp { int i, j, beg, cnt; } Ans[5000005]; int ans_top; const int OUT_SIZE = 100000000; char out[OUT_SIZE]; int out_top; void write(int x) { if (!x) { out[out_top++] = 0 ; return; } static int a[15], top; for (top = 0; x; a[++top] = x % 10, x /= 10) ; for (; top; out[out_top++] = a[top--] + 0 ) ; } void writespace(int x) { write(x); out[out_top++] = ; } void writeln(int x) { write(x); out[out_top++] = n ; } int edge[N][N]; bool visx[N], visy[N]; int main() { scanf( %d%d%d , &n, &m, &B); for (int i = (int)(1); i <= (int)(m); i++) scanf( %d , &co[i]); for (int i = (int)(1); i <= (int)(n); i++) { int cnt; scanf( %d , &cnt); while (cnt--) { int x, y; scanf( %d%d , &x, &y); mp[i][x] = y; sx[i] += y; sy[x] += y; } } for (int i = (int)(1); i <= (int)(n); i++) ans = max(ans, sx[i]); for (int i = (int)(1); i <= (int)(m); i++) id[i] = i; sort(id + 1, id + m + 1, cmp); int p = m; for (; p && B >= co[id[p]]; B -= co[id[p--]]) ; for (int i = (int)(1); i <= (int)(p); i++) ans = max(ans, sy[id[i]]); for (int i = (int)(p + 1); i <= (int)(m); i++) { ans = max(ans, (sy[id[i]] + 1) / 2); fl[id[i]] = 1; int cnt = 0; for (int j = (int)(1); j <= (int)(n); j++) cnt += (mp[j][id[i]] & 1); cnt = (cnt + 1) / 2; for (int j = (int)(1); j <= (int)(n); j++) { int v = mp[j][id[i]]; mp[j][id[i]] = mp[j][id[i] + m] = v / 2; if (v & 1) { if ((--cnt) >= 0) mp[j][id[i]]++; else mp[j][id[i] + m]++; } } } writeln(ans); for (int i = (int)(1); i <= (int)(m); i++) write(fl[i]); out[out_top++] = n ; m *= 2; for (int i = (int)(1); i <= (int)(n); i++) sx[i] = 0; for (int i = (int)(1); i <= (int)(m); i++) sy[i] = 0; for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(m); j++) sx[i] += mp[i][j], sy[j] += mp[i][j]; int times = 0; for (int TT = 0;;) { bool flag = 0; memset(head, 0, sizeof(head)); tot = 1; S = n + m + 1; T = S + 1; for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(m); j++) if (mp[i][j]) { edge[i][j] = tot + 1; flag = 1; add(i, j + n, 0); } if (!flag) break; for (int i = (int)(1); i <= (int)(n); i++) add(S, i, sx[i] != ans); for (int i = (int)(1); i <= (int)(m); i++) add(i + n, T, sy[i] != ans); for (; bfs(); times++) { for (int i = (int)(1); i <= (int)(T); i++) cur[i] = head[i], vis[i] = 0; dfs(S, 1e9); } int mn = 1e9; for (int i = (int)(1); i <= (int)(n); i++) visx[i] = 0; for (int i = (int)(1); i <= (int)(m); i++) visy[i] = 0; for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(m); j++) if (!e[edge[i][j]].f && mp[i][j]) mn = min(mn, mp[i][j]), visx[i] = visy[j] = 1; for (int i = (int)(1); i <= (int)(n); i++) if (!visx[i] && sx[i]) mn = min(mn, ans - sx[i]); for (int i = (int)(1); i <= (int)(m); i++) if (!visy[i] && sy[i]) mn = min(mn, ans - sy[i]); for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(m); j++) if (!e[edge[i][j]].f && mp[i][j]) { Ans[++ans_top] = (fuckmdndandwzp){i, j, TT, mn}; mp[i][j] -= mn; sx[i] -= mn; sy[j] -= mn; } TT += mn; ans -= mn; } writeln(ans_top); for (int i = (int)(1); i <= (int)(ans_top); i++) { writespace(Ans[i].i); writespace(Ans[i].j - (Ans[i].j <= m / 2 ? 0 : m / 2)); writespace(Ans[i].beg); writeln(Ans[i].cnt); } fwrite(out, 1, out_top, stdout); } |
#include <bits/stdc++.h> using namespace std; int n, m, t; pair<int, int> a[300005]; int b[300005]; int force(int ll, int rr) { int r = 0; for (int i = 1; i <= n; i++) if (a[i].first >= ll && a[i].second <= rr) r++; return r; } struct indexed_tree_2d { vector<int> T[1000006]; void set(int first, int second) { for (int i = first; i < 1000006; i += i & -i) T[i].push_back(second); } void end_update() { for (int i = 1; i < 1000006; i++) sort(T[i].begin(), T[i].end()); } int get(int first, int second) { int r = 0; for (int i = first; i >= 1; i -= i & -i) r += upper_bound(T[i].begin(), T[i].end(), second) - T[i].begin(); return r; } int get(int x1, int y1, int x2, int y2) { return get(x2, y2) - get(x1 - 1, y2) - get(x2, y1 - 1) + get(x1 - 1, y1 - 1); } } tr; int f(int ll, int rr) { if (ll > rr) return 0; return tr.get(ll, ll, rr, rr); } int main() { scanf( %d%d , &n, &t); for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i].first, &a[i].second); } for (int i = 1; i <= n; i++) tr.set(a[i].first, a[i].second); tr.end_update(); for (int i = 1; i <= t; i++) { int answer = n; scanf( %d , &m); for (int j = 1; j <= m; j++) { scanf( %d , &b[j]); } sort(b + 1, b + m + 1); b[m + 1] = 1000006; for (int j = 1; j <= m + 1; j++) answer -= f(b[j - 1] + 1, b[j] - 1); printf( %d n , answer); } } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > v[100005]; vector<int> ans; int n; bool has_cycle(int mid) { int indeg[100005]; int cnt = 0, x; memset(indeg, 0, sizeof(indeg)); for (int i = 1; i <= n; ++i) { for (auto g : v[i]) { if (g.second.first > mid) { indeg[g.first]++; } } } queue<int> q; for (int i = 1; i <= n; ++i) { if (indeg[i] == 0) { q.push(i); } } while (!q.empty()) { x = q.front(); cnt++; q.pop(); for (auto g : v[x]) { if (g.second.first > mid) { indeg[g.first]--; if (indeg[g.first] == 0) q.push(g.first); } } } if (cnt == n) return false; else return true; } void topological_sort(int res) { int indeg[100005]; int cnt = 0, x; memset(indeg, 0, sizeof(indeg)); for (int i = 1; i <= n; ++i) { for (auto g : v[i]) { if (g.second.first > res) { indeg[g.first]++; } } } queue<int> q; bool vis[100005]; memset(vis, false, sizeof(vis)); for (int i = 1; i <= n; ++i) { if (indeg[i] == 0) q.push(i); } while (!q.empty()) { x = q.front(); vis[x] = true; q.pop(); for (auto g : v[x]) { if (g.second.first > res) { indeg[g.first]--; if (indeg[g.first] == 0) q.push(g.first); } else { if (vis[g.first] == true) { ans.push_back(g.second.second); } } } } } bool check(int mid) { if (has_cycle(mid)) return false; else return true; } int binary_search() { int lo = 0, hi = 1e9; while (hi - lo > 1) { int mid = (lo + hi) / 2; if (check(mid)) hi = mid; else lo = mid; } if (check(lo)) return lo; return hi; } int main() { int m, x, y, c, res; cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> x >> y >> c; v[x].push_back({y, {c, i}}); } res = binary_search(); topological_sort(res); cout << res << << (int)ans.size() << n ; for (auto g : ans) cout << g << ; } |
#include <bits/stdc++.h> int func(int num) { if (num > 0) return 1; else if (num < 0) return -1; else return num; } int main() { char a[101], b[101]; int i; scanf( %s , &a); scanf( %s , &b); for (i = 0; i < strlen(a); i++) if (a[i] >= A && a[i] <= Z ) a[i] += a - A ; for (i = 0; i < strlen(b); i++) if (b[i] >= A && b[i] <= Z ) b[i] += a - A ; printf( %d n , func(strcmp(a, b))); return 0; } |
#include <bits/stdc++.h> using namespace std; int DEBUG = 0; int main(int argc, char **argv) { DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; int t; cin >> t; for (int c = 0; c < t; c++) { char tmp; int board[8][8]; int kx[2]; int ky[2]; int eger = 0; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> tmp; if (tmp == . ) { board[i][j] = 1; } else if (tmp == # ) { board[i][j] = 0; } else { kx[eger] = i; ky[eger] = j; board[i][j] = 1; eger++; } } } bool good = false; if ((kx[0] - kx[1] + 12) % 4 == 0 && (ky[0] - ky[1] + 12) % 4 == 0) { int v = (kx[0] + ky[0]) % 4; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { if (board[i][j] == 1 && (i + j) % 4 == v) { good = true; } } } } if (good) { cout << YES << endl; } else { cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int64_t mod = 1000000007; int main() { int n; cin >> n; int64_t ways = 1; for (int i = 0; i < 3 * n; ++i) { ways *= 3; ways %= mod; } int64_t bad = 1; for (int i = 0; i < n; ++i) { bad *= 7; bad %= mod; } cout << (mod + (ways - bad) % mod) % mod << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long A[100005 * 10]; long long B[100005 * 10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long tst = 1; for (long long tt = 1; tt <= tst; tt++) { long long n, a, mn = 1e12, m, res = 0; cin >> m; for (long long i = 1; i <= m; i++) cin >> a, mn = min(mn, a); cin >> n; for (long long i = 0; i < n; i++) cin >> A[i]; ; sort(A, A + n, greater<long long>()); long long p1 = 0; while (p1 < n) { long long x = p1 + mn; while (p1 < x) res += A[p1], p1++; p1 += 2; } cout << res << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int N; pair<pair<int, int>, int> V[100005]; vector<int> r; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.first > b.first.first; return a.first.second > b.first.second; } int main() { cin.sync_with_stdio(false); cout.sync_with_stdio(false); cin >> N; for (int i = 1; i <= N; i++) cin >> V[i].first.first; for (int i = 1; i <= N; i++) { cin >> V[i].first.second; V[i].second = i; } sort(V + 1, V + 1 + N, cmp); r.push_back(V[1].second); for (int i = 2; i <= N; i += 2) { if (V[i].first.second > V[i + 1].first.second) r.push_back(V[i].second); else r.push_back(V[i + 1].second); } cout << r.size() << n ; for (auto it : r) cout << it << ; return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int maxn = 100; int a[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t; for (cin >> t; t; t -= 1) { int n, x, am = 0, ok = 0; cin >> n >> x; for (int a; n; n -= 1) { cin >> a; am = max(a, am); if (a == x) ok = 1; } if (ok) cout << 1 n ; else cout << max(2, (x + am - 1) / am) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int caseno = 1; typedef long long LL; typedef unsigned long long ULL; typedef long long int64; typedef unsigned long long uint64; const int SIZE = 100 + 10; int ar[SIZE]; int main() { std::ios_base::sync_with_stdio(0); int tcases, I, J, K, N, n, m, cnt = 0, len, f = 0, x, D, t; cin >> n; for (I = 0; I < n; I++) { cin >> ar[I]; f += ar[I]; } n++; D = 1; t = f; t += D; I = 1; x = 1; while (1) { x++; if (I == n) I = 1; else I++; if (x == t) break; } if (I != 1) cnt++; D = 2; t = f; t += D; I = 1; x = 1; while (1) { x++; if (I == n) I = 1; else I++; if (x == t) break; } if (I != 1) cnt++; D = 3; t = f; t += D; I = 1; x = 1; while (1) { x++; if (I == n) I = 1; else I++; if (x == t) break; } if (I != 1) cnt++; D = 4; t = f; t += D; I = 1; x = 1; while (1) { x++; if (I == n) I = 1; else I++; if (x == t) break; } if (I != 1) cnt++; D = 5; t = f; t += D; I = 1; x = 1; while (1) { x++; if (I == n) I = 1; else I++; if (x == t) break; } if (I != 1) cnt++; cout << cnt << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; int digsum(long long x) { int ans = 0; do { ans += x % 10; x /= 10; } while (x); return ans; } int main() { int a, b, c; cin >> a >> b >> c; vector<int> v; for (int sum = 1; sum <= 100; ++sum) { long long curres = b; for (int iter = 0; iter < a; ++iter) curres = curres * sum; curres += c; if (digsum(curres) == sum && curres > 0 && curres < 1000000000) v.push_back(curres); } sort(v.begin(), v.end()); printf( %d n , int((v).size())); for (int i = 0; i < int((v).size()); ++i) printf( %d , v[i]); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:671088640 ) using namespace std; const int MOD = 1000000007; const int INF = 20000000; const long double EPS = 1e-7; const int HASH_POW = 29; const long double PI = acos(-1.0); mt19937_64 rnd(1); double workTime() { return double(clock()) / CLOCKS_PER_SEC; } void my_return(int code) { exit(code); } int bin_pow(int a, int n) { int ans = 1; while (n) { if (n & 1) ans = ans * 1ll * a % MOD; n >>= 1; a = a * 1ll * a % MOD; } return ans; } int f[100010], rev[100010]; int C(int n, int k) { if (k < 0 || k > n) return 0; int res = f[n] * 1ll * rev[k] % MOD; return res * 1ll * rev[n - k] % MOD; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); f[0] = 1; for (int i = 1; i <= 100000; ++i) f[i] = f[i - 1] * 1ll * i % MOD; for (int i = 0; i <= 100000; ++i) rev[i] = bin_pow(f[i], MOD - 2); int f, w, h; scanf( %d %d %d , &f, &w, &h); if (w == 0) { printf( 1 n ); my_return(0); } else if (f == 0) { if (w > h) { printf( 1 n ); my_return(0); } else { printf( 0 n ); my_return(0); } } else if (w <= h) { printf( 0 n ); my_return(0); } int total = 0, good = 0; for (int i = 1; i <= w; ++i) { if (i > 1) total = (total + C(w - 1, i - 1) * 1ll * C(f - 1, i - 2)) % MOD; total = (total + 2ll * C(w - 1, i - 1) * C(f - 1, i - 1)) % MOD; total = (total + C(w - 1, i - 1) * 1ll * C(f - 1, i)) % MOD; } for (int i = 1; i <= w; ++i) { if (i * (h + 1) > w) break; int w1 = w - i * h; if (i > 1) good = (good + C(w1 - 1, i - 1) * 1ll * C(f - 1, i - 2)) % MOD; good = (good + 2ll * C(w1 - 1, i - 1) * C(f - 1, i - 1)) % MOD; good = (good + C(w1 - 1, i - 1) * 1ll * C(f - 1, i)) % MOD; } printf( %d n , good * 1ll * bin_pow(total, MOD - 2) % MOD); my_return(0); } |
#include <bits/stdc++.h> using namespace std; int main() { int tst; cin >> tst; while (tst--) { int i, j, k, l, m, n; cin >> n; string s; cin >> s; set<int> ze, on; for (i = 0; i < n; i++) { if (s[i] == 1 ) on.insert(i); else ze.insert(i); } int ans[n + 10]; memset(ans, 0, sizeof ans); int st = 1; j = 0; int ya = 0, kel, pt; st = 0; for (i = 0; i < n; i++) { if (ans[i]) continue; if (on.empty() || ze.empty()) break; st++; if (s[i] == 0 ) { kel = i; pt = 0; while (1) { if (pt == 0) { auto x = on.lower_bound(kel); ans[kel] = st; ze.erase(kel); if (x == on.end()) { break; } else { l = *x; ans[l] = st; on.erase(l); pt = 1 - pt; kel = l; } } else { auto x = ze.lower_bound(kel); ans[kel] = st; on.erase(kel); if (x == ze.end()) { break; } else { l = *x; ans[l] = st; ze.erase(l); pt = 1 - pt; kel = l; } } } } else { pt = 0; kel = i; while (1) { if (pt == 0) { auto x = ze.lower_bound(kel); ans[kel] = st; on.erase(kel); if (x == ze.end()) { break; } else { l = *x; ans[l] = st; ze.erase(l); pt = 1 - pt; kel = l; } } else { auto x = on.lower_bound(kel); ans[kel] = st; ze.erase(kel); if (x == on.end()) { break; } else { l = *x; ans[l] = st; on.erase(l); pt = 1 - pt; kel = l; } } } } } st++; if (on.size()) { for (auto x : on) ans[x] = st, st++; } else if (ze.size()) { for (auto x : ze) ans[x] = st, st++; } set<int> kar; for (i = 0; i < n; i++) kar.insert(ans[i]); cout << kar.size() << n ; for (i = 0; i < n; i++) cout << ans[i] << ; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; unsigned long long int t, k, x; int main() { ios_base::sync_with_stdio(0); cin >> t; for (; t > 0; t--) { cin >> k >> x; cout << (k - 1) * 9 + x << endl; } } |
#include <bits/stdc++.h> using namespace std; int a[60000], x, mn = 0x3f3f3f3f; int main() { int n, m; cin >> m >> n; for (int i = 1; i <= n; i++) { cin >> x; a[x]++; } sort(a + 1, a + m + 1); cout << a[1]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 4e4 + 10; const int inf = 1e9; int t; int n; int b[N], ans[N]; void solve() { cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; long long tot = 0; for (int i = 0; i < n; i++) tot += b[i]; if (tot % (n * (n + 1) / 2) != 0) { cout << NO n ; return; } tot /= n * (n + 1) / 2; for (int i = 0; i < n; i++) { long long tmp = b[(i - 1 + n) % n] - b[i] + tot; if (tmp <= 0 || tmp % n != 0 || tmp / n > inf) { cout << NO n ; return; } ans[i] = tmp / n; } cout << YES n ; for (int i = 0; i < n; i++) cout << ans[i] << ; cout << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long Max = 1e5 + 10; int T; long long n, m; long long number[Max]; int main() { cin >> T; while (T--) { cin >> n >> m; long long ans = 1; int k = 1; for (int i = 1;; i *= 2) { number[k] = number[k - 1] + i; if (number[k] > n) { ans = (ans * (n - number[k - 1] + 1) % m) % m; break; } else { ans = ans * (i + 1) % m; } k++; } cout << (ans - 1 + m) % m << endl; } return 0; } |
#include <bits/stdc++.h> const double eps = 1e-10; const float epsf = 1e-6; using namespace std; inline long long int __gcd(long long int a, long long int b) { if (a == 0 || b == 0) { return max(a, b); } long long int tempa, tempb; while (1) { if (a % b == 0) return b; else { tempa = a; tempb = b; a = tempb; b = tempa % tempb; } } } inline int compfloat(float& x, float& y) { if (fabs(x - y) < epsf) return 0; else if (x - y > 0) return 1; return -1; } inline int compdouble(double x, double y) { if (fabs(x - y) < eps) return 0; else if (x - y > 0) return 1; else return -1; } bool prime(long long int k) { for (long long int i = 2; i * i <= k; i++) if (k % i == 0) { return false; } return true; } void pdash(int n = 1) { for (int i = 0; i < n; i++) { for (int j = 0; j < 30; j++) { cout << - ; } cout << n ; } } long long int power(long long int x, long long int y) { long long int result = 1; while (y > 0) { if (y & 1) { result = (result * x); } y = y >> 1; x = (x * x); } return result; } long long int power(long long int x, long long int y, long long int z) { long long int result = 1; x = x % z; while (y > 0) { if (y & 1) { result = (result * x) % z; } y = y >> 1; x = (x * x) % z; } return result; } long long int modInverse(long long int n, long long int p) { return power(n, p - 2, p); } long long int nCrF(long long int n, long long int r, long long int p) { if (r == 0) return 1; long long int f[n + 1]; f[0] = 1; for (long long int i = 1; i <= n; i++) f[i] = f[i - 1] * i % p; return (f[n] * modInverse(f[r], p) % p * modInverse(f[n - r], p) % p) % p; } void cordinate_compression(vector<int>& v) { vector<int> p = v; sort(p.begin(), p.end()); p.erase(unique(p.begin(), p.end()), p.end()); for (int i = 0; i < (int)((v).size()); i++) v[i] = (int)(lower_bound(p.begin(), p.end(), v[i]) - p.begin()); } const int MX = 1400009; vector<int> used(MX, 0); vector<int> factor[MX]; vector<int> isprime(MX, 1); vector<bool> is_used(MX, 0); inline bool check(int index) { for (auto& j : factor[index]) { if (is_used[j]) return 0; } for (auto& j : factor[index]) { is_used[j] = 1; } return 1; } void solve() { int n; cin >> n; int a[n]; for (int i = 2; i < MX; i++) { if (isprime[i]) { for (int j = i; j < MX; j += i) { factor[j].push_back(i); isprime[j] = 0; } } } int curr = 2; bool bz = 1; for (int i = 0; i < n; i++) { cin >> a[i]; if (bz) { curr = a[i]; while (!check(curr)) curr++; if (curr != a[i]) { bz = 0; } cout << curr << ; curr = 2; } else { while (!check(curr)) curr++; cout << curr << ; } } cout << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; double prec = 0.00000001; void calcHistory(vector<double>& history, int hp2, double p1, int l1, int h1) { double h[201]; double newh[201]; memset(h, 0, sizeof(h)); memset(newh, 0, sizeof(newh)); h[hp2] = 1.; for (int i = 0; i < history.size(); ++i) { for (int j = 1; j <= hp2; ++j) if (h[j] > 0) { double pHit = (1. - p1) / (h1 - l1 + 1.); for (int idx = l1; idx <= h1; ++idx) { int nIdx = j - idx > 0 ? j - idx : 0; newh[nIdx] += pHit * h[j]; } newh[j] += p1 * h[j]; } history[i] = newh[0]; newh[0] = 0; for (int idx = 0; idx <= 200; ++idx) if (newh[idx] > prec) h[idx] = newh[idx]; else h[idx] = 0.; memset(newh, 0, sizeof(newh)); } } int main(int argc, char* argv[]) { stringstream strStr; int hp1; int dt1; int l1; int h1; int pp1; double p1; int hp2; int dt2; int l2; int h2; int pp2; double p2; cin >> hp1; cin >> dt1; cin >> l1; cin >> h1; cin >> pp1; cin >> hp2; cin >> dt2; cin >> l2; cin >> h2; cin >> pp2; strStr >> hp1; strStr >> dt1; strStr >> l1; strStr >> h1; strStr >> pp1; strStr >> hp2; strStr >> dt2; strStr >> l2; strStr >> h2; strStr >> pp2; p1 = double(pp1) / 100.; p2 = double(pp2) / 100.; vector<double> history(5000, 0.); calcHistory(history, hp2, p1, l1, h1); double res = 0; double h[201]; double newh[201]; memset(h, 0, sizeof(h)); memset(newh, 0, sizeof(newh)); h[hp1] = 1.; int k = 0; double p = 0.; double pp = 0.; for (int i = 0; i < history.size(); ++i) { double histP1 = history[i]; while (dt2 * k < dt1 * i) { ++k; for (int j = 1; j <= hp1; ++j) if (h[j] > 0) { double pHit = (1. - p2) / (h2 - l2 + 1.); for (int idx = l2; idx <= h2; ++idx) { int nIdx = j - idx > 0 ? j - idx : 0; newh[nIdx] += pHit * h[j]; } newh[j] += p2 * h[j]; } pp += newh[0]; for (int idx = 0; idx <= 200; ++idx) if (newh[idx] > prec) h[idx] = newh[idx]; else h[idx] = 0.; memset(newh, 0, sizeof(newh)); } res += histP1 * (1. - pp); p += histP1; } cout << showpoint << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; long long l[200020], r[200020]; struct node { long long x, y, p; } a[200020]; long long ans[200020]; struct bridge { long long p, v; }; struct Compare { bool operator()(const bridge& a, const bridge& b) const { if (a.v < b.v || (a.v == b.v && a.p < b.p)) return true; else return false; } }; set<bridge, Compare> b; bool cmp(node a, node b) { if (a.x > b.x) return true; if (a.x < b.x) return false; if (a.y > b.y) return true; return false; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %lld%lld , &l[i], &r[i]); long long j; for (int i = 1; i <= m; i++) { bridge tmp; scanf( %lld , &j); tmp.v = j; tmp.p = i; b.insert(tmp); } if (m < n - 1) { printf( No n ); return 0; } for (int i = 1; i < n; i++) { a[i].x = l[i + 1] - r[i]; a[i].y = r[i + 1] - l[i]; a[i].p = i; } sort(a + 1, a + n, cmp); bool ok = true; set<bridge, Compare>::iterator iter; bridge tmp; for (int i = 1; i < n; i++) { tmp.v = a[i].y + 1; tmp.p = -1; iter = b.lower_bound(tmp); if (iter == b.begin()) { ok = false; break; } iter--; if (iter == b.end() || iter->v < a[i].x) { ok = false; break; } else { ans[a[i].p] = iter->p; b.erase(iter); } } if (ok) { printf( Yes n ); for (int i = 1; i < n; i++) printf( %lld , ans[i]); } else printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[111]; int main() { int mx = 1000000000; int cnt, n; scanf( %d , &n); int sum = 0; cnt = 0; int k = 0; for (int i = 1; i < n * 2; ++i) { scanf( %d , &a[i]); sum += abs(a[i]); mx = ((mx) < (abs(a[i])) ? (mx) : (abs(a[i]))); if (a[i] < 0) { cnt++; } if (a[i] == 0) k++; } if (cnt % 2 == 0 || n % 2 == 1 || k != 0) printf( %d n , sum); else { printf( %d n , sum - mx - mx); } } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; char a[1010], b[1010]; int h = 0; int main() { scanf( %s , a); int l = strlen(a); int j = 0; for (int i = 0; i < l; i++) { b[j++] = a[i]; if (a[i] == > ) { b[j] = 0; if (b[1] == / ) h--; for (int k = 0; k < 2 * h; k++) putchar( ); if (b[1] != / ) h++; puts(b); j = 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; default_random_engine generator; uniform_int_distribution<int> distribution(1, INT_MAX); long long my_rand(long long a = 0, long long b = INT_MAX) { return a + distribution(generator) % b; } inline int mul(int a, int b) { return int(a * 1ll * b % 998244353); } inline int norm(int a) { if (a >= 998244353) a -= 998244353; if (a < 0) a += 998244353; return a; } inline int binPow(int a, int k) { int ans = 1; while (k > 0) { if (k & 1) ans = mul(ans, a); a = mul(a, a); k >>= 1; } return ans; } inline int subtract(int a, int b) { return norm(a - b); } inline int sum(int a, int b) { return int((a + b) % 998244353); } inline int inv(int a) { return binPow(a, 998244353 - 2); } long long ceil_int(long long a, long long b) { return a / b + (a % b != 0); } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } int main() { generator.seed(chrono::system_clock::now().time_since_epoch().count()); cin.sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); int sum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } int res = sum; sort(a.begin(), a.end()); for (int i = 1; i <= 100; i++) { int cur = sum; for (int j = n - 1; j > 0; j--) { if (a[j] % i == 0) { cur += ((a[j] / i) - a[j]); cur += (a[0] * i - a[0]); } res = min(res, cur); cur = sum; } } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000010; struct node { int x, id; } a[N], ans[N]; int anss; bool cmp(node x, node y) { if (x.x != y.x) return x.x > y.x; return x.id < y.id; } void solve() { int k = a[2].x / a[3].x; while (k) { if (k & 1) { a[2].x -= a[3].x; a[3].x <<= 1; ans[++anss].x = a[3].id; ans[anss].id = a[2].id; } else { a[1].x -= a[3].x; a[3].x <<= 1; ans[++anss].x = a[3].id; ans[anss].id = a[1].id; } k >>= 1; } } int n; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) a[i].id = i, scanf( %d , &a[i].x); sort(a + 1, a + n + 1, cmp); if (!a[2].x) { puts( -1 ); return 0; } while (a[3].x) { solve(); sort(a + 1, a + n + 1, cmp); } printf( %d n , anss); for (int i = 1; i <= anss; ++i) printf( %d %d n , ans[i].x, ans[i].id); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 59; const long long mod = 998244353; int add[maxn]; long long w[maxn]; long long dp[52][52][52]; long long val[52][52][52]; bool vis[52][52][52]; long long Pow(long long a, long long b) { long long res = 1; a %= mod; while (b) { if (b & 1) res = res * a % mod; b >>= 1; a = a * a % mod; } return res; } inline long long inv(long long a) { return Pow(a, mod - 2); } int flag; long long dfs(int step, long long p, int i, int j, int k, long long x, long long y, long long z) { if (step == 0) return p * x % mod; if (vis[i][j][k]) { return val[i][j][k] * inv(dp[i][j][k]) % mod * p % mod; } dp[i][j][k] = p; val[i][j][k] += dfs(step - 1, p * x % mod * inv(x + y + z) % mod, i + 1, j, k, max(0ll, x + flag), y, z); val[i][j][k] += dfs(step - 1, p * y % mod * inv(x + y + z) % mod, i, j + 1, k, x, y + 1, z); val[i][j][k] += dfs(step - 1, p * z % mod * inv(x + y + z) % mod, i, j, k + 1, x, y, max(0ll, z - 1)); val[i][j][k] %= mod; vis[i][j][k] = 1; return val[i][j][k]; } int main() { int n, m; scanf( %d%d , &n, &m); long long ori, s0 = 0, s1 = 0; for (int i = 1; i <= n; i++) scanf( %d , add + i); for (int i = 1; i <= n; i++) { scanf( %lld , w + i); if (add[i]) s1 += w[i]; else s0 += w[i]; } ori = s0 + s1; int x, y, z, step; for (int i = 1; i <= n; i++) { memset(dp, 0, sizeof dp); memset(val, 0, sizeof val); memset(vis, 0, sizeof vis); if (add[i]) flag = 1, val[0][0][0] = dfs(m, 1, 0, 0, 0, w[i], s1 - w[i], s0); else flag = -1, val[0][0][0] = dfs(m, 1, 0, 0, 0, w[i], s1, s0 - w[i]); printf( %lld n , val[0][0][0]); } } |
#include <bits/stdc++.h> using namespace std; int n; int main() { scanf( %d , &n); if (n % 2 == 0) { printf( -1 ); return 0; } for (int i = 0; i < n; i++) printf( %d , i); printf( n ); for (int i = 0; i < n; i++) printf( %d , i); printf( n ); for (int i = 0; i < n; i++) printf( %d , (i * 2) % n); return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long int; template <class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << = << h << n ; } template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != , ) cerr << *sdbg++; cerr << = << h << , ; _dbg(sdbg + 1, a...); } template <class T> ostream &operator<<(ostream &os, vector<T> V) { os << [ ; for (auto vv : V) os << vv << , ; return os << ] ; } template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) { return os << ( << P.st << , << P.nd << ) ; } const int MAXN = 3003; string t, s; int n, m; LL dp[MAXN][MAXN]; LL mod = 998244353; bool vis[MAXN][MAXN]; LL dfs(int i, int j) { (i, j); if (j == i - 1) { return 1; } if (vis[i][j]) { return dp[i][j]; } vis[i][j] = true; char last = s[(j - i) + 1]; LL actRes = 0; if (i > m || last == t[i]) { actRes += dfs(i + 1, j); actRes %= mod; } if (j > m || last == t[j]) { actRes += dfs(i, j - 1); actRes %= mod; } dp[i][j] = actRes; return dp[i][j]; } int main() { cin >> s >> t; n = s.size(); m = t.size(); s = # + s; t = # + t; LL res = dfs(1, n); res = 0; for (int i = m; i <= n; ++i) { res += dp[1][i]; res %= mod; } cout << res << endl; } |
#include <bits/stdc++.h> int main() { std::ios::sync_with_stdio(false); int n; long long m, k; long long tmp; std::cin >> n >> m >> k; std::vector<long long> a; for (int i = 0; i < n; i++) { std::cin >> tmp; a.push_back(tmp); } std::sort(a.begin(), a.end()); std::cout << (m / (k + 1)) * (*(a.end() - 2)) + (m - (m / (k + 1))) * (*(a.end() - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long oo = 1000000000000000000; long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos; vector<int> v[100001]; long long int a[100001], mxx[100001]; map<int, int> mp[100001]; void unin(int x, int y) { if (mp[x].size() < mp[y].size()) { mp[x].swap(mp[y]); mxx[x] = mxx[y]; a[x] = a[y]; } for (map<int, int>::iterator it = mp[y].begin(); it != mp[y].end(); it++) { mp[x][(it)->first] += (it)->second; if (mp[x][it->first] == mxx[x]) { a[x] += it->first; } else if (mp[x][it->first] > mxx[x]) { mxx[x] = mp[x][it->first]; a[x] = it->first; } } } void dfs(int u, int pr = -1) { for (int i = 0; i < v[u].size(); i++) { int to = v[u][i]; if (to == pr) continue; dfs(to, u); unin(u, to); } } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> num; mp[i][num]++; mxx[i] = 1; a[i] = num; } int x, y; for (int i = 1; i < n; i++) { cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dfs(1); for (int i = 1; i <= n; i++) { num = 0; cout << a[i] << ; sum = 0; } } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> a(6); int s = 0; for (int i = 0; i < 6; i++) { cin >> a[i]; s += a[i]; } if (s % 2 != 0) { cout << NO ; return 0; } for (int i = 0; i < 6; i++) for (int j = i + 1; j < 6; j++) for (int k = j + 1; k < 6; k++) if (s / 2 == a[i] + a[j] + a[k]) { cout << YES ; return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long ans = 0; int n, m, k = 0; scanf( %d %d , &n, &m); vector<int> v(1e7); for (int i = 0; i < n; i++) { scanf( %d , &k); ans += v[(k ^ m)]; v[k]++; } printf( %I64d , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { char s[101]; int n; cin >> n; cin >> s; if (n == 1 && s[0] == 0 ) { cout << 0; return 0; } cout << 1; for (int i = 0; i < n; i++) if (s[i] == 0 ) cout << 0; return 0; } |
#include <bits/stdc++.h> int main() { int m, s, c, i; std::cin >> m >> s; c = s; if (m == 1 && c == 0) std::cout << 0 << << 0; else { if (c == 0 || c > (9 * m)) { std::cout << -1 << << -1; } else { for (i = m; i > 0; i--) { if (c <= 9 * (i - 1)) { if (i == m) { std::cout << 1; c--; } else std::cout << 0; } else { std::cout << (c - 9 * (i - 1)); c = 9 * (i - 1); } } std::cout << ; c = s; for (i = m - 1; i >= 0; i--) { if (c <= 9) { std::cout << c; c = 0; } else { std::cout << 9; c = c - 9; } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <size_t N, size_t M> struct Suffix_Automata { int maxlen[N], trans[N][M], link[N], Size, Last, isclone[N]; Suffix_Automata() { Size = Last = 1; } void Extend(int id) { int cur = (++Size), p; maxlen[cur] = maxlen[Last] + 1; for (p = Last; p && !trans[p][id]; p = link[p]) trans[p][id] = cur; if (!p) link[cur] = 1; else { int q = trans[p][id]; if (maxlen[q] == maxlen[p] + 1) link[cur] = q; else { int clone = (++Size); maxlen[clone] = maxlen[p] + 1; memcpy(trans[clone], trans[q], sizeof(trans[q])); link[clone] = link[q]; for (; p && trans[p][id] == q; p = link[p]) trans[p][id] = clone; link[cur] = link[q] = clone; isclone[clone] = true; } } isclone[cur] = false; Last = cur; } int cnt[N], in[N]; vector<int> G[N]; long long calc() { long long res = 0; for (int i = 1; i <= Size; i++) cnt[i] = !isclone[i]; for (int i = 1; i <= Size; i++) { G[i].clear(); G[i].push_back(link[i]); ++in[link[i]]; } queue<int> Q; for (int i = 1; i <= Size; i++) { if (!in[i]) { Q.push(i); } } while (!Q.empty()) { int u = Q.front(); Q.pop(); for (int v : G[u]) { cnt[v] += cnt[u]; if (!(--in[v])) { Q.push(v); } } } for (int i = 1; i <= Size; i++) { res += 1LL * cnt[i] * cnt[i] * (maxlen[i] - maxlen[link[i]]); } return res; } }; Suffix_Automata<300000, 26> SAM; char s[300000]; int main() { int T; scanf( %d , &T); for (int _ = 0; _ < T; _++) { memset(SAM.trans, 0, sizeof(SAM.trans)); SAM.Last = SAM.Size = 1; scanf( %s , s + 1); int n = strlen(s + 1); for (int i = 1; i <= n; i++) { SAM.Extend(s[i] - a ); } printf( %lld n , SAM.calc()); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s, t, a; void dfs(int i, int c4, int c7, bool d) { if (c4 + n - i < n / 2 || c7 + n - i < n / 2) return; if (i == n) { a = t; return; } if (d) { t[i] = 4 ; dfs(i + 1, c4 + 1, c7, 1); if (a != ) return; t[i] = 7 ; dfs(i + 1, c4, c7 + 1, 1); } else { if (s[i] <= 4 ) { t[i] = 4 ; dfs(i + 1, c4 + 1, c7, s[i] < 4 ); if (a != ) return; } if (s[i] <= 7 ) { t[i] = 7 ; dfs(i + 1, c4, c7 + 1, s[i] < 7 ); } } } int main() { cin >> s; restart: if (s.size() % 2) s = 0 + s; n = s.size(); t = string(n, 0 ); dfs(0, 0, 0, 0); if (a == ) { s = 00 + s; goto restart; } else { cout << a << endl; } } |
#include <bits/stdc++.h> using namespace std; void read(int &k) { k = 0; char x = getchar(); while (x < 0 || x > 9 ) x = getchar(); while (x >= 0 && x <= 9 ) { k = k * 10 - 48 + x; x = getchar(); } } int n, a[55], K; long double dp[55][55][55], ans, fac[55]; int main() { scanf( %d , &n); int sum = 0; for (int i = 0; i < n; i++) scanf( %d , &a[i]), sum += a[i]; scanf( %d , &K); if (sum <= K) { printf( %.9lf n , double(n)); return 0; } for (int i = 0; i < n; i++) fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i; for (int pos = 0; pos < n; pos++) { memset(dp, 0, sizeof dp); dp[0][0][0] = 1; for (int i = 0; i < n; i++) { if (i == pos) { memcpy(dp[i + 1], dp[i], sizeof dp[i]); continue; } for (int j = 0; j <= i; j++) for (int k = 0; k <= K; k++) { if (k + a[i] <= K) dp[i + 1][j + 1][k + a[i]] += dp[i][j][k]; dp[i + 1][j][k] += dp[i][j][k]; } } for (int i = 1; i <= n; i++) for (int j = max(K - a[pos] + 1, 1); j <= K; j++) ans += ((long double)dp[n][i][j]) * fac[i] * fac[n - i - 1] * i; } ans /= fac[n]; printf( %.9lf n , double(ans)); return 0; } |
#include <bits/stdc++.h> using namespace std; int ok[101010]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> ct(n); int tl = 0; int nn = 0; int odd = 0; for (int i = 0; i < n; i++) { cin >> ct[i]; tl += ct[i]; if (ct[i] % 2 == 1) odd++; if (ct[i] > 0) { nn++; for (int j = 1; j <= ct[i]; j++) { if (ct[i] % j == 0) { ok[j]++; } } } } if (nn < 2) { cout << tl << endl; for (int i = 0; i < n; i++) { for (int j = 0; j < ct[i]; j++) { cout << (char)( a + i); } } cout << endl; } else if (odd > 1) { cout << 0 << endl; for (int i = 0; i < n; i++) { for (int j = 0; j < ct[i]; j++) { cout << (char)( a + i); } } cout << endl; } else { int bv = 1; for (int i = 1; i <= tl; i++) { if (ok[i] == nn) { int x = i; int o = 0; for (int ii = 0; ii < n; ii++) { ct[ii] /= x; if (ct[ii] % 2 == 1) o++; } if (o < 2 || (i % 2 == 0)) { bv = max(bv, i); } for (int ii = 0; ii < n; ii++) { ct[ii] *= x; } } } cout << bv << endl; tl /= bv; string r(tl, ); int of = 0; for (int ii = 0; ii < n; ii++) { ct[ii] /= bv; if (ct[ii] % 2 == 1) of = 1; } if (bv % 2 == 0) { int i2 = 0; for (int i = 0; i < (int)ct.size(); i++) { for (int j = 0; j < ct[i]; j++) { r[i2++] = (char)( a + i); } } } else { int i2 = 0; if (of) { for (int i = 0; i < (int)ct.size(); i++) { if (ct[i] % 2 == 1) { for (int j = 0; j < ct[i]; j += 2) { r[tl / 2 - i2] = (char)( a + i); r[tl / 2 + i2] = (char)( a + i); i2++; } } } for (int i = 0; i < (int)ct.size(); i++) { if (ct[i] % 2 == 0) { for (int j = 0; j < ct[i]; j += 2) { r[tl / 2 - i2] = (char)( a + i); r[tl / 2 + i2] = (char)( a + i); i2++; } } } } else { for (int i = 0; i < (int)ct.size(); i++) { if (ct[i] % 2 == 0) { for (int j = 0; j < ct[i]; j += 2) { r[tl / 2 - i2 - 1] = (char)( a + i); r[tl / 2 + i2] = (char)( a + i); i2++; } } } } } string v = ; for (int i = 0; i < bv; i++) { v = v + r; reverse(r.begin(), r.end()); } cout << v << endl; } } |
#include <bits/stdc++.h> #pragma GCC optimize ( Ofast , unroll-loops ) using namespace std; #define ll long long //#define int ll #define FOR(i,a,b) for (int i = (a); i<(b); i++) #define REP(i,n) FOR(i,0,n) #define REP1(i,n) FOR(i,1,n+1) #define RREP(i,n) for (int i=(n)-1; i>=0; i--) #define f first #define s second #define pb push_back #define ALL(x) x.begin(),x.end() #define SZ(x) (int)(x.size()) #define SQ(x) (x)*(x) #define pii pair<int, int> #define pdd pair<double ,double> #define pcc pair<char, char> #define endl n //#define TOAD #ifdef TOAD #define bug(x) cerr<<__LINE__<< : <<#x<< is <<x<<endl #define IOS() #else #define bug(...) #define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0) #endif const ll inf = 1ll<<60; const int iinf=2147483647; const ll mod = 1e9+7; const ll maxn=1e7+5; const double PI=acos(-1); ll pw(ll x, ll p){ ll ret=1; while (p>0){ if (p&1){ ret*=x; ret%=mod; } x*=x; x%=mod; p>>=1; } return ret; } ll inv(ll a){ return pw(a,mod-2); } signed main(){ IOS(); int t; cin>>t; while(t--){ int n; cin>>n; vector<pii> vc(n); vector<int> t(n); REP(i,n) cin>>vc[i].f>>vc[i].s; REP(i,n) cin>>t[i]; int cur=vc[0].f, ans=0; REP(i,n){ cur+=t[i]; if (i==n-1) break; int ex=(vc[i].s-vc[i].f)/2+((vc[i].s-vc[i].f)%2>0); cur+=ex; cur=max(cur, vc[i].s); cur+=vc[i+1].f-vc[i].s; } cout<<cur<<endl; } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.