func_code_string
stringlengths 59
71.4k
|
---|
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 10; vector<pair<string, int> > ch[MAXN]; int nxt[MAXN][27], n, gp, ans; string t; void adds(string &tmp) { for (int i = 0; i < tmp.size(); i++) { gp = nxt[gp][tmp[i] - a ]; if (gp == t.size()) ans++; } } void dfs(int v, int p) { for (int i = 0; i < ch[v].size(); i++) { gp = p; adds(ch[v][i].first); dfs(ch[v][i].second, gp); } } int main() { cin >> n; for (int i = 2; i <= n; i++) { string tmp; int r; cin >> r >> tmp; ch[r].push_back({tmp, i}); } cin >> t; nxt[0][t[0] - a ] = 1; int cp = 0; for (int i = 1; i <= t.size(); i++) { for (char c = a ; c <= z ; c++) { if (t[cp] == c) nxt[i][c - a ] = cp + 1; else nxt[i][c - a ] = nxt[cp][c - a ]; } if (i < t.size()) { nxt[i][t[i] - a ] = i + 1; if (t[cp] == t[i]) cp++; else cp = nxt[cp][t[i] - a ]; } } dfs(1, 0); cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void gmin(T &a, T b) { a = a < b ? a : b; } template <typename T> void gmax(T &a, T b) { a = a > b ? a : b; } const int MAXV = 410; const int MAXE = 1650; const int INF = 0x3f3f3f3f; struct Edge { int to, cap, nxt, cost; Edge() {} Edge(int to, int cap, int nxt, int cost) : to(to), cap(cap), nxt(nxt), cost(cost) {} } edge[MAXE << 1]; int head[MAXV], cnt; void initedge() { memset(head, -1, sizeof(head)); cnt = 0; } inline void addedge(int from, int to, int cap, int cost) { edge[cnt] = Edge(to, cap, head[from], cost); head[from] = cnt++; } inline void addedge2(int from, int to, int cap, int cost) { addedge(from, to, cap, cost); addedge(to, from, 0, -cost); } int dist[MAXV]; int iter[MAXV]; bool inq[MAXV]; bool SPFA(int S, int T) { static int q[MAXV]; int f = 0, r = 0; memset(dist, INF, sizeof(dist)); memset(inq, 0, sizeof(inq)); dist[S] = 0; q[r++] = S; inq[S] = true; while (f != r) { int x = q[f++]; inq[x] = false; if (f == MAXV) f = 0; for (int p = head[x]; ~p; p = edge[p].nxt) { Edge e = edge[p]; if (e.cap && dist[e.to] > dist[x] + e.cost) { dist[e.to] = dist[x] + e.cost; if (!inq[e.to]) { q[r++] = e.to; inq[e.to] = true; if (r == MAXV) r = 0; } } } } return dist[T] < INF; } int getflow(int x, int lim, int T) { if (x == T) return lim; inq[x] = true; int nowflow = 0, newflow; for (register int &p = iter[x]; ~p; p = edge[p].nxt) { register Edge &e = edge[p]; if (!inq[e.to] && e.cap && dist[e.to] == dist[x] + e.cost) { newflow = getflow(e.to, min(e.cap, lim - nowflow), T); e.cap -= newflow; edge[p ^ 1].cap += newflow; nowflow += newflow; if (nowflow >= lim) break; } } return nowflow; } int mincostmaxflow(int S, int T) { int nowcost = 0, newflow; while (SPFA(S, T)) { for (int i = 0; i < MAXV; i++) iter[i] = head[i]; memset(inq, 0, sizeof(inq)); do { newflow = getflow(S, INF, T); nowcost += newflow * dist[T]; } while (newflow); } return nowcost; } const int MAXN = 210; const int MAXM = 210; int S, T, second, TT; int n1, n2, m, r, b; int id[MAXM]; int delta[MAXV]; char s[MAXN]; int ans; int main() { initedge(); scanf( %d%d%d%d%d , &n1, &n2, &m, &r, &b); S = 0; T = n1 + n2 + 1; scanf( %s , s); for (int i = 1; i <= n1; i++) { char c = s[i - 1]; if (c == R ) { addedge2(i, T, INF - 1, 0); delta[i] -= 1; delta[T] += 1; } if (c == B ) { addedge2(S, i, INF - 1, 0); delta[S] -= 1; delta[i] += 1; } if (c == U ) { addedge2(S, i, INF - 0, 0); addedge2(i, T, INF - 0, 0); } } scanf( %s , s); for (int i = 1; i <= n2; i++) { char c = s[i - 1]; if (c == B ) { addedge2(n1 + i, T, INF - 1, 0); delta[n1 + i] -= 1; delta[T] += 1; } if (c == R ) { addedge2(S, n1 + i, INF - 1, 0); delta[S] -= 1; delta[n1 + i] += 1; } if (c == U ) { addedge2(S, n1 + i, INF - 0, 0); addedge2(n1 + i, T, INF - 0, 0); } } for (int i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); id[i] = cnt; addedge2(x, n1 + y, 1 - 0, b); addedge2(n1 + y, x, 1 - 0, r); } addedge2(T, S, INF - 0, 0); second = n1 + n2 + 2; TT = n1 + n2 + 3; int sum = 0; for (int i = S; i <= T; i++) { if (delta[i] > 0) addedge2(second, i, delta[i], 0), sum += delta[i]; if (delta[i] < 0) addedge2(i, TT, -delta[i], 0); } ans = mincostmaxflow(second, TT); sum = 0; for (int p = head[second]; ~p; p = edge[p].nxt) sum += edge[p].cap; if (!sum) { printf( %d n , ans); for (int i = 0; i < m; i++) { if (edge[id[i]].cap == 0) putchar( B ); else if (edge[id[i] + 2].cap == 0) putchar( R ); else putchar( U ); } putchar( n ); } else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> const int N = 810; const int M = 10; int mod[N][M]; int ans[N], inv[N], a[N]; int n; void print() { if (ans[1] > n / 2) { for (int i = 1; i <= n; ++i) { ans[i] = n + 1 - ans[i]; } } printf( ! ); for (int i = 1; i <= n; ++i) { printf( %d , ans[i]); } puts( ); } int ask(std::vector<int> vec, int calcmod) { int n = vec.size(); printf( ? %d , n); for (auto u : vec) { printf( %d , u); } puts( ); fflush(stdout); int ret; scanf( %d , &ret); if (calcmod > 0) { if (ret) { int sum = 0; for (auto u : vec) { if (u != calcmod) { sum = (sum + ans[u]) % n; } } mod[calcmod][n] = (n - sum) % n; } } return ret; } int main() { scanf( %d , &n); memset(mod, -1, sizeof(mod)); mod[1][2] = 1; for (int i = 1; i < n; ++i) { mod[i + 1][2] = mod[i][2] ^ (1 - ask({i, i + 1}, 0)); } for (int i = 1; i <= 4 && i <= n / 2; ++i) { std::vector<int> todo; for (int j = 1; j <= n; ++j) { if (!ans[j]) { todo.emplace_back(j); } } for (auto j : todo) { std::vector<int> vec; for (auto k : todo) { if (j != k) { vec.emplace_back(k); } } if (ask(vec, 0)) { ans[j] = mod[j][2] == i % 2 ? i : n + 1 - i; inv[ans[j]] = j; } } } if (n <= 8) { print(); return 0; } for (int i = 3; i <= 7; i += 2) { using pii = std::pair<int, int>; std::vector<pii> to_check; std::vector<int> known; for (int j = 0; j <= i / 2; ++j) { to_check.emplace_back(1, n - 3 + j); } for (int j = 1; j <= i / 2; ++j) { to_check.emplace_back(i / 2 + 1, n - 3 + j); } for (int j = 0; j <= i / 2; ++j) { known.emplace_back(j + 1); known.emplace_back(j + n - 3); } for (auto p : to_check) { for (int j = 1; j <= n; ++j) { if (ans[j] || mod[j][i] != -1) { continue; } std::vector<int> vec = {j}; for (auto u : known) { if (u == p.first || u == p.second) { continue; } vec.emplace_back(inv[u]); } ask(vec, j); } } } for (int i = 1; i <= n; ++i) { if (ans[i]) { continue; } ask({inv[1], inv[2], inv[3], i}, i); if (mod[i][4] != -1) { continue; } ask({inv[1], inv[2], inv[4], i}, i); if (mod[i][4] != -1) { continue; } mod[i][4] = mod[i][2] == 1 ? 3 : 0; } std::vector<bool> calced(8); int sum = 0; for (int i = 1; i <= 4; ++i) { sum += n - 4 + i; sum += i; } for (int i = 1; i <= 4; ++i) { calced[(8 - (sum - i) % 8) % 8] = true; } for (int i = 1; i <= n; ++i) { if (ans[i]) { continue; } int pos = 0; for (int j = 1; j <= 4; ++j) { if ((sum - j) % 4 == (4 - mod[i][4]) % 4) { pos = j; break; } } std::vector<int> vec = {i}; for (int j = 1; j <= 4; ++j) { vec.emplace_back(inv[n - 4 + j]); if (j != pos) { vec.emplace_back(inv[j]); } } ask(vec, i); if (mod[i][8] == -1) { mod[i][8] = (calced[mod[i][4]] ? 4 : 0) ^ mod[i][4]; } } for (int i = 1; i <= n; ++i) { if (ans[i]) { continue; } for (int j = 1; j <= n; ++j) { bool flag = true; for (auto u : {3, 5, 7, 8}) { if (j % u != mod[i][u]) { flag = false; break; } } if (flag) { ans[i] = j; break; } } } print(); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { string s; cin >> s; long long int x = 0, y = 0, p, q, sum = 0; set<pair<int, int> > ma; for (long long int i = 0; i < s.size(); i++) { p = x; q = y; if (s[i] == N ) y++; else if (s[i] == S ) y--; else if (s[i] == W ) x++; else x--; if (!ma.count({x + p, q + y})) { sum = sum + 5; ma.insert({x + p, q + y}); } else ++sum; } cout << sum << endl; } } |
#include <bits/stdc++.h> using namespace std; const long long maxN = 1e6 + 100; const long long maxM = 1e3 + 100; const long long mod = 1e9 + 7; const long long hmod = 1e16 + 7; const long double PI = 3.141592653; const long double eps = 1e-8; const long long D = 1379; const long long INF = 1e18 + 20; const long long Inf = 1e9 + 140; void NO() { cout << NO << endl; exit(0); } void YES() { cout << YES << endl; exit(0); } long long n, k; bool mrk[2][maxN], mark[2][maxN]; void dfs(long long v, long long x = 0, long long W = 0) { if (v > n) YES(); if (v <= 0 || mrk[x][v] || mark[x][v] || v <= W) return; mark[x][v] = true; W++; dfs(v + k, x ^ 1, W); dfs(v + 1, x, W); dfs(v - 1, x, W); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (long long i = 1; i <= n; i++) { char c; cin >> c; if (c == X ) mrk[0][i] = true; } for (long long i = 1; i <= n; i++) { char c; cin >> c; if (c == X ) mrk[1][i] = true; } dfs(1); NO(); } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, x; cin >> t; for (int i = 0; i < t; i++) { cin >> n >> x; cout << 2 * x << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; double prb[(1 << 21)], p[25], ans[25]; int vis[(1 << 21)]; bool eq(double a, double b) { return (abs(a - b) < 1e-12); } int main() { int i, n, k, tmp; scanf( %d , &n); scanf( %d , &k); tmp = n; for (i = 0; i < n; i++) { scanf( %lf , &p[i]); if (eq(p[i], 0)) tmp--; } k = min(k, tmp); prb[0] = 1; queue<int> all; all.push(0); while (!all.empty()) { int now = all.front(); all.pop(); if (__builtin_popcount(now) == k) for (i = 0; i < n; i++) if (now & (1 << i)) ans[i] += prb[now]; double gun = 0; for (i = 0; i < n; i++) if (!(now & (1 << i))) gun += p[i]; gun = 1 / gun; if (__builtin_popcount(now) < k) for (i = 0; i < n; i++) { if ((now & (1 << i)) || eq(p[i], 0)) continue; tmp = now ^ (1 << i); prb[tmp] += (p[i] * gun * prb[now]); if (!vis[tmp]) { vis[tmp] = 1; all.push(tmp); } } } for (i = 0; i < n; i++) printf( %.15f , ans[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 100; vector<int> v[MAX_N]; int dp[MAX_N], ans, deep[MAX_N]; void dfs(int x, int fa, int dep) { int i; deep[x] = dep; for (i = 0; i < v[x].size(); i++) { int y = v[x][i]; if (y == fa) continue; dfs(y, x, dep + 1); } } void dfs(int x, int fa) { int i; dp[x] = 0; for (i = 0; i < v[x].size(); i++) { int y = v[x][i]; if (y == fa) continue; dfs(y, x); ans = max(ans, dp[x] + dp[y] + 1); dp[x] = max(dp[x], dp[y] + 1); } } int main(void) { int T, n, a, b, da, db, i, x, y; cin >> T; while (T--) { scanf( %d%d%d%d%d , &n, &a, &b, &da, &db); for (i = 1; i <= n; i++) v[i].clear(); for (i = 1; i < n; i++) { scanf( %d%d , &x, &y); v[x].push_back(y); v[y].push_back(x); } dfs(a, -1, 0); if (deep[b] <= da) { puts( Alice ); continue; } if (da * 2 >= db) { puts( Alice ); continue; } ans = 0; dfs(1, -1); if (da * 2 >= ans) puts( Alice ); else puts( Bob ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int Count(int ar[], int m, int n) { int count = 0, i; for (i = 0; i < n; i++) { if (ar[i] == m) { count++; } } return count; } void change(int br[], int ar[], int n, int clr, int d, int m) { int count = 0, i; for (i = 0; i < n; i++) { if (ar[i] == m) { count++; br[i] = ceil(float(count) / d) + clr; ar[i] = -1; } } } int main() { int n, i, cnt = 0; cin >> n; int ar[n], br[n]; for (i = 0; i < n; i++) { br[i] = 0; } for (i = 0; i < n; i++) { cin >> ar[i]; if (ar[i] == 0) { cnt++; } } if (cnt == n) { cout << Possible n ; for (i = 0; i < n; i++) { cout << 1 << ; } return 0; } if (cnt != 0) { cout << Impossible ; return 0; } int m, count, clr = 0; m = *max_element(ar, ar + n); while (m != -1) { m = *max_element(ar, ar + n); count = Count(ar, m, n); if ((n - count) > m) { cout << Impossible ; return 0; } if (m == n - count) { change(br, ar, n, clr, count, m); clr++; } else { int bp = m - (n - count); if (bp % (count - bp) == 0) { change(br, ar, n, clr, count - bp, m); clr += count / (count - bp); } else { cout << Impossible ; return 0; } } m = *max_element(ar, ar + n); } cout << Possible n ; for (i = 0; i < n; i++) { cout << br[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct hash_pair { template <class T1, class T2> size_t operator()(const pair<T1, T2>& p) const { auto hash1 = hash<T1>{}(p.first); auto hash2 = hash<T2>{}(p.second); return hash1 ^ hash2; } }; string ans = ; int flag = 0; int res = 0; void permut(string n, int s, int l) { if (flag == 1) return; if (s == l) { if ((res * 10000 + stoi(n)) % 7 == 0) { flag = 1; ans += n; } return; } for (int i = s; i <= l; i++) { swap(n[s], n[i]); permut(n, s + 1, l); swap(n[s], n[i]); } } int main() { ios::sync_with_stdio(0); cin.tie(0); string n; cin >> n; int one = 0; int six = 0; int eight = 0; int nine = 0; string zero = ; for (int i = 0; i < n.length(); i++) { if (n[i] == 1 && one == 0) { one = 1; } else if (n[i] == 6 && six == 0) { six = 1; } else if (n[i] == 8 && eight == 0) { eight = 1; } else if (n[i] == 9 && nine == 0) { nine = 1; } else { if (n[i] == 0 && ans.length() == 0) { zero += 0 ; } else { ans += n[i]; res *= 10; res += n[i] - 0 ; res %= 7; } } } permut( 1689 , 0, 3); if (ans.length() != 0) cout << ans + zero; else cout << 0 ; } |
#include <bits/stdc++.h> int main() { int i, y, ans, z, b, x[2]; for (i = 0; i < 2; i++) { scanf( %d , &x[i]); } y = x[0] * x[1]; ans = y / 2; { printf( %d , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int NUM = 2e5 + 10; struct node { int index, q; bool operator<(const node &a) const { return index + q < a.index + a.q; } } no[NUM]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d%d , &no[i].index, &no[i].q); sort(no, no + n); int ans = 1, last = 0; for (int i = 1; i < n; i++) { if (no[i].index - no[i].q >= no[last].index + no[last].q) { last = i; ans++; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double EPS = 1e-9; const long double PI = acos(-1.0); const int MX = 1e5 + 5; long long mod = 1e9 + 7; pair<long long, int> tr[5 * MX]; long long lz[5 * MX]; vector<int> ids[MX]; int rnum[MX]; inline void prop(int n, int l, int r) { if (lz[n]) { tr[n].first += lz[n]; if (l != r) lz[n << 1] += lz[n], lz[n << 1 | 1] += lz[n]; lz[n] = 0; } } const long long inf = 1e15; void bld(int n, int l, int r) { if (l == r) { if (((int)(ids[l]).size())) tr[n] = {ids[l].back(), rnum[l]}; else tr[n] = {inf, 0}; return; } int m = (l + r) >> 1; bld(n << 1, l, m); bld(n << 1 | 1, m + 1, r); tr[n] = min(tr[n << 1], tr[n << 1 | 1]); } int I, L, R, V; void del(int n, int l, int r) { prop(n, l, r); if (I < l or I > r) return; if (l == r) { long long aded = tr[n].first - ids[l].back(); ids[l].pop_back(); if (((int)(ids[l]).size())) tr[n] = {ids[l].back(), rnum[l]}; else tr[n] = {inf, rnum[l]}; tr[n].first += aded; return; } int m = (l + r) >> 1; del(n << 1, l, m); del(n << 1 | 1, m + 1, r); tr[n] = min(tr[n << 1], tr[n << 1 | 1]); } void upd(int n, int l, int r) { prop(n, l, r); if (l > R or r < L) return; if (l >= L and r <= R) { lz[n] += V; prop(n, l, r); return; } int m = (l + r) >> 1; upd(n << 1, l, m); upd(n << 1 | 1, m + 1, r); tr[n] = min(tr[n << 1], tr[n << 1 | 1]); } pair<long long, int> qry(int n, int l, int r) { prop(n, l, r); if (l > R or r < L) return {inf, 0}; if (l >= L and r <= R) { return tr[n]; } int m = (l + r) >> 1; pair<long long, int> a = qry(n << 1, l, m); pair<long long, int> b = qry(n << 1 | 1, m + 1, r); tr[n] = min(tr[n << 1], tr[n << 1 | 1]); return min(a, b); } vector<int> adj[MX]; int par[MX], sz[MX], heavy[MX]; void dfs1(int u, int p) { par[u] = p; sz[u] = 1; for (int v : adj[u]) { if (v != p) { dfs1(v, u); sz[u] += sz[v]; if (sz[v] > sz[heavy[u]]) heavy[u] = v; } } } int st[MX], chain[MX], num[MX], ed[MX], cl, cn, head[MX]; void dfs(int u) { st[u] = cl; chain[u] = cn; num[u] = cl; rnum[cl++] = u; if (heavy[u]) dfs(heavy[u]); for (int v : adj[u]) { if (v != par[u] and v != heavy[u]) { head[++cn] = v; dfs(v); } } ed[u] = cl - 1; } inline int climb(int u, int v, int n) { pair<long long, int> res = {inf, 0}; while (chain[u] != chain[v]) { if (chain[v] > chain[u]) swap(u, v); R = num[u]; L = num[head[chain[u]]]; res = min(res, qry(1, 0, n - 1)); u = par[head[chain[u]]]; } if (num[v] > num[u]) swap(u, v); L = num[v], R = num[u]; res = min(res, qry(1, 0, n - 1)); if (res.first >= inf) return 0; int ret = ids[num[res.second]].back(); I = num[res.second]; del(1, 0, n - 1); return ret; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, q; cin >> n >> m >> q; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } dfs1(1, 0); head[0] = 1; dfs(1); for (int i = 1; i <= m; i++) { int c; cin >> c; ids[num[c]].emplace_back(i); } for (int i = 0; i < n; i++) reverse((ids[i]).begin(), (ids[i]).end()); bld(1, 0, n - 1); while (q--) { int t; cin >> t; int u, v, k; if (t == 1) { cin >> u >> v >> k; vector<int> ans; while (k--) { int i = climb(u, v, n); if (i) ans.push_back(i); else break; } cout << ((int)(ans).size()); for (int i : ans) cout << << i; cout << n ; } else { cin >> u >> k; L = st[u]; R = ed[u]; V = k; upd(1, 0, n - 1); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long arr[105], k; int n; bool check(long long x) { long long sum = 0; for (int i = 0; i < n; i++) { sum += (arr[i] + x - 1LL) / x; } return x * sum <= k; } int main(int argc, char const *argv[]) { cin >> n >> k; for (int i = 0; i < n; i++) cin >> arr[i], k += arr[i]; long long ans = 0; for (long long i = 1; i <= sqrt(k) + 1; i++) { if (check(i)) ans = max(ans, i); if (check(k / i)) ans = max(ans, k / i); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int cnt, n; cin >> n; cnt = 0; cnt += n / 100; n %= 100; cnt += n / 20; n %= 20; cnt += n / 10; n %= 10; cnt += n / 5; n %= 5; cnt += n; cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> int Cmp(const void *a, const void *b); int main(void) { int i, n, x, w, gpos = -2 * 1000000000, ans = 0, grange[200000][2]; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%d , &x, &w); grange[i][0] = x - w; grange[i][1] = x + w; } qsort(grange, n, sizeof(int) * 2, Cmp); for (i = 0; i < n; i++) { if (gpos <= grange[i][0]) { ans++; gpos = grange[i][1]; } } printf( %d n , ans); } int Cmp(const void *a, const void *b) { int ta = *(*(int(*)[2])a + 1), tb = *(*(int(*)[2])b + 1); if (ta > tb) return 1; else if (tb > ta) return -1; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); map<int, int> cur; set<pair<int, int>> st; for (int i = 0; i < n; i++) { cin >> a[i]; if (!cur.count(a[i])) { st.insert(make_pair(a[i], i)); } cur[a[i]] = i; } if (st.size() == 1) { cout << NO << endl; continue; } else { cout << YES << endl; vector<pair<int, int>> res; auto e = st.begin(), g = prev(st.end()); for (int i = 0; i < n; i++) { if (a[i] != e->first) { res.emplace_back(i + 1, e->second + 1); } else if (i != g->second && i != e->second) res.emplace_back(i + 1, g->second + 1); } for (auto j : res) cout << j.first << << j.second << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; bool a[1000010]; int main() { memset(a, 0, sizeof(a)); int n, ans = 0; cin >> n; int f = 2; for (;;) { if (a[f] == 0) { for (int i = 2 * f; i <= 1000000; i = i + f) a[i] = 1; } f++; if (f == 1000000) break; } for (int i = 10;; i++) { int i1 = i, i2 = 0; while (i1 > 0) { i2 = i2 * 10 + i1 % 10; i1 = i1 / 10; } if (a[i2] == 0 && a[i] == 0 && i2 != i) ans++; if (ans == n) { cout << i << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int Max = INT_MIN, Min = INT_MAX; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n, m, mx = 0; cin >> n >> m; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n - 1; i++) { if ((a[i] - a[i + 1] - m) > mx) { mx = (a[i] - a[i + 1] - m); } } cout << ((mx > 0) ? mx : 0); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, n, i, j, z, mx; string s, s2; int main() { cin >> a >> b >> c; mx = max(max(a, b), c); for (i = 1; i <= mx; i++) { for (j = 1; j <= mx; j++) { z = c / j; if (i * j == a && i * z == b && j * z == c) { cout << i * 4 + j * 4 + z * 4; return 0; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, ways[5050][5050], last[27], fat[5050], ifat[5050]; char s[5050]; int expo(int b, int e) { if (!e) return 1; if (e & 1) return 1LL * b * expo(1LL * b * b % 1000000007, e >> 1) % 1000000007; return expo(1LL * b * b % 1000000007, e >> 1); } int invmod(int x) { return expo(x, 1000000007 - 2); } void prep() { fat[0] = 1; for (int i = 1; i < 5050; i++) fat[i] = 1LL * fat[i - 1] * i % 1000000007; ifat[5050 - 1] = invmod(fat[5050 - 1]); for (int i = 5050 - 1; i > 0; i--) ifat[i - 1] = 1LL * ifat[i] * i % 1000000007; assert(ifat[0] == 1); } long long nCr(int n, int k) { return 1LL * fat[n] * ifat[k] % 1000000007 * ifat[n - k] % 1000000007; } int main() { scanf( %d %s , &n, s + 1); prep(); s[0] = char( a + 26); last[26] = n + 1; ways[n + 1][0] = 1; for (int i = n; i >= 0; i--) { for (int c = 0; c < 27; c++) { if (c == (s[i] - a ) || (last[c] == 0)) continue; for (int j = 0; j < (n - i + 1); j++) { ways[i][j + 1] += ways[last[c]][j]; if (ways[i][j + 1] >= 1000000007) ways[i][j + 1] -= 1000000007; } } last[s[i] - a ] = i; } long long ans = 0; for (int i = 2; i <= n + 1; i++) { ans = (ans + nCr(n - 1, i - 2) * ways[0][i]) % 1000000007; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, t; cin >> t; while (t--) { cin >> n; if (n % 2 == 0) cout << n / 2 << n ; else cout << (n / 2) + 1 << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6; long long seg_t[MAXN * 4]; long long n, k, cur, ans = 1; void add(long long u, long long curl, long long curr, long long l, long long r, long long delta) { long long curm = (curl + curr) / 2; if (l == curl && r == curr) { seg_t[u] += delta; return; } if (l <= curm) { if (r >= curm) { add(u * 2, curl, curm, l, curm, delta); } else { add(u * 2, curl, curm, l, r, delta); } } if (r >= curm + 1) { if (l <= curm + 1) { add(u * 2 + 1, curm + 1, curr, curm + 1, r, delta); } else { add(u * 2 + 1, curm + 1, curr, l, r, delta); } } } long long get(long long u, long long curl, long long curr, long long x) { long long ret = 0; long long curm = (curl + curr) / 2; ret += seg_t[u]; if (curl == curr) return ret; if (x <= curm) { ret += get(u * 2, curl, curm, x); } else if (x >= curm + 1) { ret += get(u * 2 + 1, curm + 1, curr, x); } return ret; } int main() { cin.sync_with_stdio(0); cin.tie(0); cin >> n >> k; k = min(k, n - k); long long r, l = 1; for (long long i = 0; i < n; ++i) { r = l + k; if (r > n) { add(1, 1, n + 1, l + 1, n + 1, 1); r -= n; if (r > 1) add(1, 1, n + 1, 1, r - 1, 1); } else { add(1, 1, n + 1, l + 1, r - 1, 1); } ans += 1 + get(1, 1, n + 1, l) + get(1, 1, n + 1, r); cout << ans << ; l = r; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100; int ara[N]; int main() { int n = 0; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , ara + i); } if (n == 1) puts( -1 ); else if (n == 2 && ara[0] == ara[1]) puts( -1 ); else { int mn = 10000; int nm = 0; for (int i = 0; i < n; ++i) { if (ara[i] < mn) { mn = ara[i]; nm = i; } } ++nm; printf( 1 n%d n , nm); } return 0; } |
#include <bits/stdc++.h> using namespace std; #define int long long struct node{ int x, y, id; bool operator <(const node& W) const{ if (W.x != x) return x < W.x; else return y < W.y; } }; void work() { int n; cin >> n; vector<node> v(n); for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; if (x > y) swap(x, y); v[i] = {x, y, i + 1}; } sort(v.begin(), v.end()); vector<int> res(n + 1); int pos = -1; for (int i = 0; i < v.size(); i++) { int j = i; while (j < v.size() && v[i].x == v[j].x) j++; j--; if (pos == -1) for (int k = i; k <= j; k++) res[v[k].id] = -1; else { for (int k = i; k <= j; k++) if (v[k].y > v[pos].y) res[v[k].id] = v[pos].id; else res[v[k].id] = -1; } if (pos == -1) pos = 0; else if (v[i].y < v[pos].y) pos = i; i = j; } for (int i = 1; i < res.size(); i++) cout << res[i] << ; cout << endl; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); int cas; cin >> cas; while (cas--) work(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long int> sieve; vector<long long int> *Sieve(int N) { const long long int maxn = N; sieve.resize(maxn); for (long long int(i) = 0; (i) < (maxn); ++(i)) sieve[i] = 1; sieve[1] = 0; sieve[0] = 0; for (long long int(i) = 2; (i) <= (maxn); (i) += (1)) if (1 == sieve[i]) for (long long int j = i * i; j < maxn; j += i) sieve[j] = 0; vector<long long int> *primes = new vector<long long int>(); primes->push_back(2); for (int i = 3; i < maxn; i += 2) if (sieve[i]) { primes->push_back(i); } return primes; } long long int extended_GCD(long long int a, long long int b, long long int &x, long long int &y) { if (a == 0) { x = 0; y = 1; return b; } long long int x1, y1; long long int gcd = extended_GCD(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return gcd; } long long int ncr(long long int n, long long int k) { long long int r = 1; if (k > n - k) k = n - k; for (long long int i = 0; i < k; i++) { r *= (n - i); r /= (i + 1); } return r; } long long int power(long long int a, long long int b, long long int m = 1000000007) { long long int res = 1; while (b > 0) { if (b & 1) res = (res * a) % m; a = (a * a) % m; b >>= 1; } return res; } long long int modinv(long long int a, long long int mod = 1000000007) { long long int x, y; extended_GCD(a, mod, x, y); if (x < 0) x += mod; return x; } bool prime(int n) { int c = 0; for (int i = 2; (i * i) <= n; i++) { if (n % i == 0) { c++; return false; } } if (c == 0) return true; } vector<int> v[200006]; int vis[200006]; int c; void dfs(int n) { vis[n] = 1; c++; for (int i : v[n]) { if (!vis[i]) dfs(i); } } int a[100001]; void solve() { int n, k; cin >> n >> k; int a[n]; for (long long int(i) = 0; (i) < (n); ++(i)) cin >> a[i]; int sa = 1, sb = 1; double ca = 0, cb = k; int i = 0, j = n - 1; double ans = 0; while (i <= j) { double t1, t2, d1, d2; d1 = a[i] - ca; d2 = cb - a[j]; t1 = (double)d1 / sa; t2 = (double)d2 / sb; if (t1 <= t2) { ans += t1; ca += d1; i++; sa++; cb -= (double)t1 * sb; } else { ans += t2; cb -= d2; j--; sb++; ca += (double)t2 * sa; } } ans += double(cb - ca) / (sa + sb); cout << fixed << setprecision(10) << ans; cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; cin >> t; while (t--) solve(); return 0; } |
#include<bits/stdc++.h> using namespace std; #define ll long long int int main() { int t; cin>>t; while(t--) { ll n; cin>>n; vector<ll>a(n); for(ll i=0;i<n;i++) { cin>>a[i]; } ll maxi=INT_MIN; for(ll i=n-1;i>-1;i--) { ll total=0; total+=a[i]; if(i+a[i]<n) { total+=a[i+a[i]]; } a[i]=total; maxi=max<ll>(maxi,total); } //cout<< t ; cout<<maxi<< n ; } } |
#include <bits/stdc++.h> using namespace std; class subtractions { private: int _a, _b; int _operations; bool even_divide(int& a, int& b) { if (b > a && !(b % a)) { _operations += (b / a); return true; } else if (a >= b && !(a % b)) { _operations += (a / b); return true; } return false; } bool quick_divide(int& a, int& b) { if (b > a) { int factor = b / a; b -= a * factor; _operations += factor; return true; } else if (a >= b) { int factor = a / b; a -= b * factor; _operations += factor; return true; } return false; } public: subtractions(int a = 0, int b = 0) : _a(a), _b(b) { _operations = 0; } int operate() { while (_a > 0 && _b > 0) { if (even_divide(_a, _b)) break; if (quick_divide(_a, _b)) continue; ++_operations; } return _operations; } }; int main() { int tests = 0; cin >> tests; while (tests > 0) { int a, b; cin >> a >> b; subtractions s(a, b); cout << s.operate() << endl; --tests; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s; long long w[3][300500]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0, qwerty = n; i < qwerty; i++) { cin >> s; stack<char> st; st.push(s[0]); for (int j = 1, qwerty = s.size(); j < qwerty; j++) { char c = s[j]; if (!st.empty() && c == ) && st.top() == ( ) st.pop(); else st.push(c); } int r1 = 0, r2 = 0; while (!st.empty()) { if (st.top() == ( ) r1++; else r2++; st.pop(); } if (r1 && r2) continue; if (r1 + r2 == 0) w[2][0]++; else if (r1) w[0][r1]++; else if (r2) w[1][r2]++; } long long ans = w[2][0] * w[2][0]; if (w[2][0] == 1) ans = 1; for (int i = 0, qwerty = 300200; i < qwerty; i++) ans += w[0][i] * w[1][i]; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, t; cin >> t; while (t--) { cin >> a >> b; int num = abs(a - b); if (a > b && num % 2 != 0) cout << 2 << endl; else if (a < b && num % 2 != 0) cout << 1 << endl; else if (a > b && num % 2 == 0) cout << 1 << endl; else if (a < b && num % 2 == 0) cout << 2 << endl; else if (a == b) cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct DSU { struct Node { int pr; long long max_sum; long long max_pref; long long sum; long long max_suff; }; vector<Node> t; multiset<long long> mx; DSU(int n, vector<int>& c) { t.resize(n); for (int i = 0; i < n; ++i) { t[i].pr = i; t[i].sum = c[i]; t[i].max_sum = max(0, c[i]); t[i].max_pref = max(0, c[i]); t[i].max_suff = max(0, c[i]); mx.insert(t[i].max_sum); } } int f(int v) { if (t[v].pr != v) { t[v].pr = f(t[v].pr); } return t[v].pr; } void merge(int x, int y) { x = f(x); y = f(y); if (x == y) { return; } t[x].pr = y; mx.erase(mx.lower_bound(t[x].max_sum)); mx.erase(mx.lower_bound(t[y].max_sum)); Node new_node; new_node.sum = t[x].sum + t[y].sum; new_node.pr = y; new_node.max_sum = max(t[y].max_sum, t[x].max_sum); new_node.max_sum = max(new_node.max_sum, t[x].max_suff + t[y].max_pref); new_node.max_pref = max(t[x].max_pref, t[x].sum + t[y].max_pref); new_node.max_suff = max(t[y].max_suff, t[y].sum + t[x].max_suff); new_node.max_sum = max(new_node.max_sum, 0LL); new_node.max_pref = max(new_node.max_pref, 0LL); new_node.max_suff = max(new_node.max_suff, 0LL); t[y] = new_node; mx.insert(t[y].max_sum); } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; long long m; cin >> n >> m; vector<int> d(n), c(n); for (int i = 0; i < n; ++i) { cin >> d[i] >> c[i]; c[i] = m - c[i]; } set<pair<int, int> > q; for (int i = 0; i + 1 < n; ++i) { q.insert({d[i + 1] - d[i], i}); } q.insert({-1, -1}); DSU t(n, c); long long ans = 0; while (q.size()) { auto i = *q.begin(); q.erase(q.begin()); if (i.second != -1) { t.merge(i.second, i.second + 1); ans = max(ans, *--t.mx.end() - i.first * 1LL * i.first); } else { ans = max(ans, *--t.mx.end()); } } cout << ans << n ; } |
#include <bits/stdc++.h> int main(int argc, char *argv[]) { int n; scanf( %d , &n); int i; if (n % 2 != 0) { printf( -1 n ); } else { if (n > 2) { for (i = 1; i <= n - 2; i++) { printf( %d , i + 1); printf( %d , i); i++; } } printf( %d , n); printf( %d n , n - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, x, a[200005], b[200005]; int main() { cin >> n; for (int i = 1; i <= n / 2; i++) cin >> b[i]; a[1] = 0; a[n] = b[1]; for (int i = 2; i <= n / 2; i++) { a[i] = a[i - 1]; a[n - i + 1] = b[i] - a[i]; if (a[n - i + 1] > a[n - i + 2]) { a[n - i + 1] = a[n - i + 2]; a[i] = b[i] - a[n - i + 1]; } } for (int i = 1; i <= n; i++) { cout << a[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int i, j, ft; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long int n; cin >> n; vector<long long int> v[n]; for (i = 0; i < (n - 1); i++) { long long int b, c; cin >> b >> c; v[b - 1].push_back(c - 1); v[c - 1].push_back(b - 1); } vector<long long int> l(n, 0); queue<long long int> s; s.push(0); l[0] = 1; while (!s.empty()) { long long int front = s.front(); s.pop(); for (i = 0; i < (v[front].size()); i++) { if (!l[v[front][i]]) { s.push(v[front][i]); l[v[front][i]] = l[front] + 1; } } } long long int odd = 0, even = 0; for (i = 0; i < (n); i++) { if (l[i] % 2) odd++; else even++; } cout << odd * even - n + 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2) cout << contest ; else cout << home ; return 0; } |
#include <bits/stdc++.h> using namespace std; #define FASTIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define TEST ll Test ; cin >> Test; while #define TEST2 int Test = 1; while #define READ freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #define INP(a, n) for(ll i=0;i<(ll)n;i++) cin>>a[i] ; #define INPA(a, n) ll a[n]; for(ll i=0;i<(ll)n;i++) cin>>a[i] ; #define INPV(a, n) ll TrT; for(int i=0;i<(ll)n;i++){cin>>TrT; a.push_back(TrT);} #define OUT(a, n) for(ll i=0;i<(ll)n;i++)cout<<a[i]<< ; #define forp(i,a,b) for(ll i=a;i<(ll)b;i++) #define fore(i,a,b) for(ll i=a;i<=(ll)b;i++) #define fora(x) for(auto &it: x) #define INF LLONG_MAX #define sz size() #define len length() #define beg begin() #define en end() #define all(x) x.beg,x.en #define ff first #define ss second #define pb push_back #define pp pop_back #define lb lower_bound #define ub upper_bound #define N n #define YES(n) cout << ((n) ? YES : NO ) << n ; #define Yes(n) cout << ((n) ? Yes : No ) << n ; #define fix(f,n) fixed << setprecision(n) << f #define M 1000000007 #define MM 998244353 #define TRACE #ifdef TRACE #define d(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << = << arg1 << endl; } template <typename Arg1, typename... Args> void __f( const char* names, Arg1&& arg1, Args&&... args) {const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << = << arg1 << ; __f(comma + 1, args...); } #else #define d(...) #endif typedef long long int ll; typedef long double ld; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<vector<int>> vvi; typedef vector<vector<ll>> vvll; typedef vector<vector<ld>> vvld; typedef pair<ll, ll> pll; typedef vector<int> vi ; typedef vector<pair<int, int>> vpi; typedef vector<pair<ll,ll> > vpll; void solve() { ll p, a, b, c, temp, ans = INF; cin >> p; ll v[3]; forp(i, 0, 3) cin >> v[i]; forp(i, 0, 3) { temp = p/v[i]; if(p % v[i] != 0) temp++; ll x = temp * v[i]; // d(x); ans = min(x - p, ans); } cout << ans << N; } int main() { FASTIO #ifndef ONLINE_JUDGE // READ #endif TEST(Test--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long fac[300011], inv[300011]; int F, W, H; long long fastpower(long long v, long long p) { long long ret = 1; while (p > 0) { if (p % 2 == 1) { ret = ret * v; ret %= mod; p--; } else { v = v * v; v %= mod; p /= 2; } } return ret; } void init() { fac[0] = inv[0] = 1; for (int i = 1; i < 300011; ++i) { fac[i] = fac[i - 1] * i; inv[i] = inv[i - 1] * fastpower(i, mod - 2); fac[i] %= mod; inv[i] %= mod; } } long long C(int n, int k) { if (n < k) return 0; return ((fac[n] * inv[k]) % mod * inv[n - k]) % mod; } long long add(long long v, long long u) { return (v + u) % mod; } long long cost(long long n, long long k, long long low) { n = n - k * low; if (n < 0) return 0; return C(n + k - 1, n); } long long calc(int num, int limit) { long long v1 = cost(F, num, 1) * cost(W, num, limit) * 2; long long v2 = cost(F, num, 1) * cost(W, num + 1, limit); long long v3 = cost(F, num, 1) * cost(W, num - 1, limit); return add(add(v1, v2), v3); } int main() { init(); scanf( %d%d%d , &F, &W, &H); H++; if (W == 0) { printf( 1 n ); return 0; } if (W < H) { printf( 0 n ); return 0; } if (W == 0) { printf( 1 n ); return 0; } if (F == 0) { printf( 1 n ); return 0; } long long ans = 0; for (int i = 1; i <= F; ++i) { ans += calc(i, H); ans %= mod; } ans = ans + mod; ans %= mod; ans = ans * fastpower(C(W + F, W), mod - 2); ans = ans % mod; printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int m, p, l, q = 0, r, t = 0; long long int n, k = 0, i, j = 0; string s; getline(cin, s); j = 0; for (i = 0; i < s.size(); i++) { if (s[i] == a || s[i] == e || s[i] == i || s[i] == o || s[i] == u ) j++; } if (j == 5) k++; j = 0; string s1; getline(cin, s1); j = 0; for (i = 0; i < s1.size(); i++) { if (s1[i] == a || s1[i] == e || s1[i] == i || s1[i] == o || s1[i] == u ) j++; } if (j == 7) k++; j = 0; string s2; getline(cin, s2); j = 0; for (i = 0; i < s2.size(); i++) { if (s2[i] == a || s2[i] == e || s2[i] == i || s2[i] == o || s2[i] == u ) j++; } if (j == 5) k++; if (k == 3) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; set<int> smax, smin; int ox[100000], oy[100000]; map<pair<int, int>, int> pnts; inline int eval(int x, int y) { if (pnts.count({x, y})) { return pnts.count({x, y - 1}) + pnts.count({x - 1, y - 1}) + pnts.count({x + 1, y - 1}); } return 3; } inline bool isOk(int x, int y) { return (eval(x, y + 1) > 1) && (eval(x - 1, y + 1) > 1) && (eval(x + 1, y + 1) > 1); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr << -.- ; int m; cin >> m; for (int i = 0; i < m; ++i) { cin >> ox[i] >> oy[i]; pnts.insert({{ox[i], oy[i]}, i}); } for (int i = 0; i < m; ++i) { if (isOk(ox[i], oy[i])) { smax.insert(-i), smin.insert(i); } } int turn = 0; vector<int> path; int dd[] = {0, -1, 1, -2, 2}; while (((int)(smax).size())) { int i = (turn == 0) ? -(*smax.begin()) : (*smin.begin()); smin.erase(i), smax.erase(-i); path.push_back(i), pnts.erase({ox[i], oy[i]}); for (int d = 1; d < 5; ++d) { auto it = pnts.find({ox[i] + dd[d], oy[i]}); if (it != pnts.end()) { int j = it->second; if (!isOk(ox[j], oy[j])) { smax.erase(-j), smin.erase(j); } } } for (int d = 0; d < 3; ++d) { auto it = pnts.find({ox[i] + dd[d], oy[i] - 1}); if (it != pnts.end()) { int j = it->second; if (isOk(ox[j], oy[j])) { smax.insert(-j), smin.insert(j); } } } turn ^= 1; } int ans = 0; for (int i = 0; i < ((int)(path).size()); ++i) { ans = ((1ll * ans * m) + path[i]) % 1000000009; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using LL = int64_t; int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n; std::cin >> n; std::vector<int> a(n); for (int &i : a) std::cin >> i; std::sort(a.begin(), a.end()); int maxa = a.back(); std::vector<std::vector<int>> mx(maxa + 1); for (auto &i : mx) i.assign(2, -1); std::vector<int> cnt(maxa + 1); for (int i : a) ++cnt[i]; for (int i = 1; i <= maxa; ++i) { if (cnt[i] >= 2) mx[i][0] = mx[i][1] = i; else if (cnt[i] == 1) { mx[i][0] = i; mx[i][1] = mx[i - 1][0]; } else mx[i] = mx[i - 1]; cnt[i] += cnt[i - 1]; } LL ans = 0; for (int y = 2; y <= maxa; ++y) { int more[] = {-1, -1}; LL cnty = 0; for (int k = 1; k <= maxa / y; ++k) cnty += (LL)k * (cnt[std::min((k + 1) * y - 1, maxa)] - cnt[k * y - 1]); for (int k = maxa / y; k >= 0; --k) { more[1] = std::max(more[1], mx[std::min((k + 1) * y - 1, maxa)][0] - k * y); if (more[0] < more[1]) std::swap(more[0], more[1]); more[1] = std::max(more[1], mx[std::min((k + 1) * y - 1, maxa)][1] - k * y); int x = std::min((LL)(k * y + more[0]) / 2, cnty - k); if (x >= 2) ans = std::max(ans, LL(x) * y); if (more[1] != -1) { x = std::min((LL)k * y + more[1], cnty - 2 * k); if (x >= 2) ans = std::max(ans, LL(x) * y); } if (n - cnt[std::max(0, k * y + more[0] - 1)] >= 2) { x = std::min((LL)k * y + more[0], cnty - 2 * k - 1); if (x >= 2) ans = std::max(ans, LL(x) * y); } } } std::cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using VI = vector<int>; using PII = pair<int, int>; const int N = 1005, INF = 1e9; vector<PII> adj[N]; int dis[N][N]; int main() { int n, m, k; cin >> n >> m >> k; vector<tuple<int, int, int>> edges; for (int i = 0; i < m; i++) { int u, v, w; cin >> u >> v >> w; adj[u].emplace_back(v, w); adj[v].emplace_back(u, w); edges.emplace_back(u, v, w); } vector<PII> paths(k); for (auto &[u, v] : paths) cin >> u >> v; for (int s = 1; s <= n; s++) { for (int u = 1; u <= n; u++) { dis[s][u] = s == u ? 0 : INF; } priority_queue<PII> heap; heap.emplace(0, s); while (!heap.empty()) { int u = heap.top().second; heap.pop(); for (auto [v, w] : adj[u]) { if (dis[s][v] > dis[s][u] + w) { dis[s][v] = dis[s][u] + w; heap.emplace(-dis[s][v], v); } } } } ll ans = 1e18; for (auto [u, v, w] : edges) { ll cur = 0; for (auto [x, y] : paths) { cur += min({dis[x][y], dis[x][u] + dis[v][y], dis[x][v] + dis[u][y]}); } ans = min(ans, cur); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { register int x = 0, f = 1, ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * f; } int n; int a[1010]; int b[1010]; int main() { n = read(); for (int i = 1; i <= n; i++) { a[i] = read(); } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { if (i & 1) printf( %d , a[(i + 1) / 2]); else printf( %d , a[n - i / 2 + 1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string x; cin >> x; int xx = 0; int ans = 0; for (int i = 0; i < x.size(); i++) { if (x[i] == ( ) xx++; else if (xx) xx--, ans++; } cout << ans * 2; } |
#include <bits/stdc++.h> using namespace std; int f[201000], l[201000], r[201000]; int n; int a[201000], s[201000]; int top; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; top = 0; s[top] = 0; a[0] = 0; for (int i = 1; i <= n; i++) { while (a[s[top]] >= a[i]) top--; l[i] = s[top] + 1; top++; s[top] = i; } top = 0; s[top] = n + 1; a[n + 1] = 0; for (int i = n; i >= 1; i--) { while (a[s[top]] >= a[i]) top--; r[i] = s[top] - 1; top++; s[top] = i; } for (int i = 1; i <= n; i++) f[r[i] - l[i] + 1] = max(f[r[i] - l[i] + 1], a[i]); for (int i = n; i >= 1; i--) f[i] = max(f[i], f[i + 1]); for (int i = 1; i <= n; i++) cout << f[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int64_t dfs(int64_t idx, int64_t p, vector<vector<int64_t>>& g, vector<int64_t>& parents, int64_t& c1, int64_t& c2) { int64_t n = g.size() - 1; parents[idx] = p; int64_t res = 1; int64_t mx = 0; for (auto& x : g[idx]) { if (x != p) { int64_t a = dfs(x, idx, g, parents, c1, c2); res += a; mx = max(mx, a); } } mx = max(mx, n - res); if (mx <= n / 2) { if (c1 == -1) { c1 = idx; } else { c2 = idx; } } return res; } int64_t leaf(int64_t idx, int64_t p, vector<vector<int64_t>>& g) { if (g[idx].size() == 1) { return idx; } else { auto res = -1; for (auto& e : g[idx]) { if (e != p) { res = leaf(e, idx, g); if (res != -1) { return res; } } } } return -1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int64_t tc; cin >> tc; while (tc--) { int64_t n; cin >> n; vector<vector<int64_t>> g(n + 1); for (int64_t i = 0; i < n - 1; i++) { int64_t a; int64_t b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } int64_t c1 = -1; int64_t c2 = -1; vector<int64_t> p(n + 1); dfs(1, 0, g, p, c1, c2); if (c2 == -1) { int64_t rm = g[c1][0]; cout << c1 << << rm << endl; cout << c1 << << rm << endl; } else { if (p[c2] != c1) { swap(c1, c2); } int64_t rm = leaf(c2, c1, g); cout << rm << << p[rm] << endl; cout << rm << << c1 << endl; } } return 0; } |
#include <bits/stdc++.h> #define int long long #define INF (1e15 + 7) #define pii pair<int, int> using namespace std; struct Node { int x, y; Node(int _x = 0, int _y = 0) : x(_x), y(_y) {} bool operator<(const Node &u)const { if (x < u.x) return true; if (x > u.x) return false; return y > u.y; } }; const int MAX_N = 2e5 + 7; Node in[MAX_N], de[MAX_N]; vector<pii> ab, ba; int a[MAX_N], b[MAX_N]; int n, mx, dis, top; inline int low_bound(vector<pii> &s, int x) { while (top && s[top - 1].first > x) { --top; } if (!top) return -1; return s[top - 1].second; } signed main() { // freopen( in.txt , r , stdin); scanf( %lld , &n); for (int i = 1; i <= n; ++i) scanf( %lld , a + i); for (int i = 1; i <= n; ++i) scanf( %lld , b + i); int n1 = 0, n2 = 0; for (int i = 1; i <= n; ++i) { if (a[i] < b[i]) in[++n1] = Node(a[i], b[i]); else if (a[i] > b[i]) de[++n2] = Node(b[i], a[i]); dis += abs(a[i] - b[i]); } sort(in + 1, in + 1 + n1); sort(de + 1, de + 1 + n2); int len1 = 0, len2 = 0; for (int i = 1; i <= n1; ++i) { if (!len1 || in[i].y > ab[len1 - 1].second) { ab.push_back(pii(in[i].x, in[i].y)); ++len1; } } for (int i = 1; i <= n2; ++i) { if (!len2 || de[i].y > ba[len2 -1].second) { ba.push_back(pii(de[i].x, de[i].y)); ++len2; } } top = len2; for (int i = len1 - 1; i >= 0; --i) { int y = low_bound(ba, ab[i].first); if (~y) mx = max(mx, min(y, ab[i].second) - ab[i].first); } top = len1; for (int i = len2 - 1; i >= 0; --i) { int y = low_bound(ab, ba[i].first); if (~y) mx = max(mx, min(y, ba[i].second) - ba[i].first); } printf( %lld n , dis - mx * 2); return 0; } |
#include <bits/stdc++.h> using namespace std; double dp[2][605]; int main() { int n, k; scanf( %d%d , &n, &k); int pre = 0, cur = 1; for (int i = 0; i < n; ++i) { memset(dp[cur], 0, sizeof dp[cur]); for (int j = 1; j < 600; ++j) dp[cur][j] += (1. * j / k / (j + 1) + (k - 1.) / k) * dp[pre][j] + 1. * (dp[pre][j + 1] + j) / ((j + 1.) * k) + 1. * j / 2 / k; swap(pre, cur); } printf( %.15f n , k * dp[pre][1]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long tree[1000001]; int n; void update(int x, long long val) { for (int i = x; i <= n; i += i & (-i)) { tree[i] += val; } } long long query(int x) { long long sum = 0; while (x > 0) { sum += tree[x]; x -= x & (-x); } return sum; } int main() { int m, i, j = 2, k; long long l = 1; cin >> n >> k; m = 0; int count = 0; i = 1; while (count < n) { j = (i + k) % n; if (!j) j = n; m = i % n; if (!m) m = n; if (m > j) { l += min(query(j - 1) + query(n) - query(m), query(m - 1) - query(j)) + (long long)1; } else { l += min(query(j) - query(m), query(m - 1) + query(n) - query(j)) + (long long)1; } cout << l << ; update(m, 1); update(j, 1); count++; i = j; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; long long my_pow(long long a, long long n) { long long res = 1; while (n) { if (n & 1) res *= a; a *= a; n >>= 1; } return res; } const int mn = 10010; vector<int> v[mn]; vector<int> s(mn, 0); void dfs(int vert, int c) { s[vert] = c; for (auto it : v[vert]) dfs(it, c); } int main() { int n, k; cin >> n; int c[n + 10]; for (int i = 2; i <= n; i++) { scanf( %d , &k); v[k].push_back(i); } for (int i = 1; i <= n; i++) scanf( %d , &c[i]); int ans = 0; for (int i = 1; i <= n; i++) { if (s[i] != c[i]) { dfs(i, c[i]); ans++; } } cout << ans; return 0; } |
#include <bits/stdc++.h> const int N = 100010; const int M = 30; std::map<std::string, int> Hash; int fa[N << 1], n, m, q; char s[M]; int find(int u) { return fa[u] == u ? u : fa[u] = find(fa[u]); } void unite(int u, int v) { int _u = find(u), _v = find(v); fa[_u] = _v; find(u); } int main() { for (int i = 0; i < N << 1; ++i) { fa[i] = i; } scanf( %d%d%d , &n, &m, &q); for (int i = 0; i < n; ++i) { scanf( %s , s); std::string str = s; Hash[str] = i; } for (int i = 0, type; i < m; ++i) { scanf( %d%s , &type, s); std::string str = s; int u = Hash[str]; scanf( %s , s); str = s; int v = Hash[str]; find(u), find(v), find(v + n), find(u + n); if (type == 1) { if (fa[u] == fa[v + n] || fa[v] == fa[u + n]) { printf( NO n ); continue; } printf( YES n ); unite(u, v); unite(u + n, v + n); continue; } if (type == 2) { if (fa[u] == fa[v] || fa[u + n] == fa[v + n]) { printf( NO n ); continue; } printf( YES n ); unite(u, v + n); unite(u + n, v); } } for (int i = 0; i < q; ++i) { scanf( %s , s); std::string str = s; int u = Hash[str]; scanf( %s , s); str = s; int v = Hash[str]; find(u), find(v), find(u + n), find(v + n); if (fa[u] == fa[v] || fa[u + n] == fa[v + n]) { printf( 1 n ); } else if (fa[u] == fa[v + n] || fa[u + n] == fa[v]) { printf( 2 n ); } else { printf( 3 n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int bst(int a[], int lw, int hi, int n) { int mid = (lw + hi) / 2; if (lw > hi) return -1; if (a[mid] > n) bst(a, lw, mid - 1, n); else if (a[mid] < n) bst(a, mid + 1, hi, n); else return mid; } long long pw(long long a, long long b, long long p) { if (b == 0) return 1; long long t = pw(a, b / 2, p); if (b % 2) return (((a * t) % p) * t) % p; else return ((t * t) % p); } void solve() { string s; long long ct1 = 0, ct2 = 0, V = 0, H = 0; cin >> s; if (s.size() == 1) { cout << 2 << endl; return; } vector<long long> v1, v2; v1.push_back(0); v2.push_back(0); long long i = 0, k = 0, t = 0; while (i < s.size()) { if (s[i] == W ) { v1.push_back(++ct1); } else if (s[i] == S ) { v1.push_back(--ct1); } else if (s[i] == D ) { v2.push_back(++ct2); } else { v2.push_back(--ct2); } i++; } if (v1.size() == 2) { V = 1; } if (v2.size() == 2) { H = 1; } long long lw1 = *min_element(v1.begin(), v1.end()), hi1 = *max_element(v1.begin(), v1.end()); long long lw2 = *min_element(v2.begin(), v2.end()), hi2 = *max_element(v2.begin(), v2.end()); vector<long long> min1_pos, min2_pos, max1_pos, max2_pos; for (i = 0; i < v1.size(); i++) { if (v1[i] == lw1) min1_pos.push_back(i); if (v1[i] == hi1) max1_pos.push_back(i); } for (i = 0; i < v2.size(); i++) { if (v2[i] == lw2) min2_pos.push_back(i); if (v2[i] == hi2) max2_pos.push_back(i); } bool v, h; long long a, b, c, d; a = min1_pos.back(); b = min1_pos.front(); c = max1_pos.back(); d = max1_pos.front(); if ((c < a && c < b) || (d > a && d > b)) v = true; else v = false; a = min2_pos.back(); b = min2_pos.front(); c = max2_pos.back(); d = max2_pos.front(); if ((c < a && c < b) || (d > a && d > b)) h = true; else h = false; if (V && H) { cout << 4 << endl; } else if (V) { if (h) cout << 2 * (hi2 - lw2) << endl; else cout << 2 * (hi2 - lw2 + 1) << endl; } else if (H) { if (v) cout << 2 * (hi1 - lw1) << endl; else cout << 2 * (hi1 - lw1 + 1) << endl; } else { if (v && h) cout << min((hi1 - lw1 + 1) * (hi2 - lw2), (hi1 - lw1) * (hi2 - lw2 + 1)) << endl; else if (v) cout << (hi1 - lw1) * (hi2 - lw2 + 1) << endl; else if (h) cout << (hi1 - lw1 + 1) * (hi2 - lw2) << endl; else cout << (hi1 - lw1 + 1) * (hi2 - lw2 + 1) << endl; } } int main() { long long t = 1; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e6; long long n, K, d, a[200010]; map<long long, long long> mp; struct trnode { long long lc, rc, c, u; } tr[400010]; long long tot = 0; void pushdown(long long x) { long long lc = tr[x].lc, rc = tr[x].rc, c = tr[x].u; tr[x].u = 0; tr[lc].c += c; tr[rc].c += c; tr[lc].u += c; tr[rc].u += c; } void change(long long x, long long l, long long r, long long fl, long long fr, long long c, long long op) { if (l == fl && r == fr) { if (op) tr[x].c = c; else tr[x].c += c, tr[x].u += c; return; } long long mid = (l + r) / 2; if (tr[x].u) pushdown(x); if (fr <= mid) change(tr[x].lc, l, mid, fl, fr, c, op); else if (fl > mid) change(tr[x].rc, mid + 1, r, fl, fr, c, op); else change(tr[x].lc, l, mid, fl, mid, c, op), change(tr[x].rc, mid + 1, r, mid + 1, fr, c, op); tr[x].c = min(tr[tr[x].lc].c, tr[tr[x].rc].c); } long long bt(long long l, long long r) { long long x = ++tot; tr[x].c = inf; if (l != r) { long long mid = (l + r) / 2; tr[x].lc = bt(l, mid); tr[x].rc = bt(mid + 1, r); } return x; } long long findans(long long x, long long l, long long r) { if (l == r) return tr[x].c <= K ? l : inf; if (tr[x].u) pushdown(x); long long mid = (l + r) / 2; if (tr[tr[x].lc].c <= K) return findans(tr[x].lc, l, mid); return findans(tr[x].rc, mid + 1, r); } long long L = 1, R = 1, s1[200010], s2[200010], t1 = 0, t2 = 0, la = 1; int main() { scanf( %lld %lld %lld , &n, &K, &d); for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); if (d == 0) { L = 1; R = 1; long long l = 1, r = 1; for (int i = 2; i <= n; i++) { r = i; if (a[i] != a[i - 1]) l = i; if (r - l + 1 > R - L + 1) L = l, R = r; } printf( %lld %lld , L, R); return 0; } bt(1, n); change(1, 1, n, 1, 1, 0, 1); s1[++t1] = 1; s2[++t2] = 1; mp[a[1]] = 1; for (long long i = 2; i <= n; i++) { long long tmp = la; tmp = max(tmp, mp[a[i]] + 1); if ((a[i] - a[i - 1]) % d != 0) tmp = i; mp[a[i]] = i; if (la < tmp) change(1, 1, n, la, tmp - 1, inf, 0), la = tmp; while (t1 && a[s1[t1]] <= a[i]) change(1, 1, n, s1[t1 - 1] + 1, s1[t1], (a[i] - a[s1[t1]]) / d, 0), t1--; while (t2 && a[s2[t2]] >= a[i]) change(1, 1, n, s2[t2 - 1] + 1, s2[t2], (a[s2[t2]] - a[i]) / d, 0), t2--; change(1, 1, n, i, i, 1, 1); change(1, 1, n, la, i, -1, 0); s1[++t1] = i; s2[++t2] = i; long long l = findans(1, 1, n), r = i; if (r - l + 1 > R - L + 1) L = l, R = r; } printf( %lld %lld , L, R); } |
#include <bits/stdc++.h> using namespace std; template <class T> void read(T& x) { x = 0; T f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) f = (ch == - ? -1 : 1), ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 48, ch = getchar(); x *= f; } template <class T, class... Args> void read(T& x, Args&... args) { read(x), read(args...); } template <class T> void write(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } const int MAXN = 2E5 + 5; const int MOD = 1E9 + 7; long long n, num; double p; bool check(long long k) { return (-k * k * k + 3 * k * k + k * (4 + 3 * n * n - 9 * n)) * 10000 >= num * n * (n - 1) * (n - 2) * 2; } signed main() { cin >> n >> p; num = llround(p * 10000); int l = 0, r = n, ans = 0; while (l <= r) { int mid = l + r >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; constexpr int MAXN = 1003; constexpr int MAXC = 10004; int n; ll w, b, x; int c[MAXN]; ll cost[MAXN]; ll dp[MAXN][MAXC]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> w >> b >> x; for (int i = 0; i < n; ++i) cin >> c[i]; for (int i = 0; i < n; ++i) cin >> cost[i]; memset(dp, -1, sizeof(dp)); dp[0][0] = w; for (int i = 0; i < n; ++i) { for (int j = 0; j < MAXC and dp[i][j] > -1; ++j) { for (ll k = 0; k <= c[i] and dp[i][j] - cost[i] * k >= 0; ++k) { dp[i + 1][j + k] = max( dp[i + 1][j + k], min(w + (j + k) * b, dp[i][j] + x - cost[i] * k)); } } } int ans = 0; for (int j = 0; j < MAXC; ++j) { if (dp[n][j] != -1) ans = max(ans, j); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, k; int nums[1005]; cin >> t; while (t--) { cin >> n >> k; for (int i = 0; i < n; i++) cin >> nums[i]; sort(nums, nums + n); int sum = 0; for (int i = 1; i < n; i++) sum += (k - nums[i]) / nums[0]; cout << sum << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, u, v, num_col = 1; vector<int> adjList[5001]; vector<int> edges[5001]; bitset<5001> vis; bitset<5001> act; bitset<5001> col; void dfs(int nd) { vis[nd] = 1; act[nd] = 1; for (int k = 0; k < adjList[nd].size(); k++) { int nd_b = adjList[nd][k]; int edge_num = edges[nd][k]; if (!vis[nd_b]) dfs(nd_b); else if (act[nd_b]) { num_col = 2; col[edge_num] = 1; } } act[nd] = 0; } int main() { cin >> n >> m; for (int i = 0; i < m; i++) { cin >> u >> v; u--; v--; adjList[u].push_back(v); edges[u].push_back(i); } for (int i = 0; i < n; i++) { if (!vis[i]) dfs(i); } cout << num_col << endl; for (int i = 0; i < m; i++) { cout << (((int)col[i]) + 1) << (i < m - 1 ? : ); } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[100005]; int main() { int n; while (cin >> n) { scanf( %s , s); int ct = 1, n = strlen(s); bool ok = false; int cant = 0, ans = 0; for (int i = 1; i < n; i++) { if (s[i] == s[i - 1]) ct++; else { if (ct >= 3) ok = true; if (ct >= 2) cant++; ans++; ct = 1; } } ans++; if (ct >= 3) ok = true; if (ct >= 2) cant++; if (ok) ans += 2; else { if (cant >= 2) ans += 2; else if (cant == 1) ans++; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int width; int height; cin >> height; cin >> width; char art[height][width]; for (int i = 0; i < height; i++) { for (int k = 0; k < width; k++) { cin >> art[i][k]; } } bool found_content = false; int max_width = width - 1; int min_width = 0; int max_height = height - 1; int min_height = 0; int collumn = 0; while (!found_content) { for (int i = 0; i < height && !found_content; i++) { if (art[i][collumn] == * ) { min_width = collumn; found_content = true; } } collumn++; } found_content = false; collumn = width - 1; while (!found_content) { for (int i = 0; i < height && !found_content; i++) { if (art[i][collumn] == * ) { max_width = collumn; found_content = true; } } collumn--; } found_content = false; int row = 0; while (!found_content) { for (int i = 0; i < width && !found_content; i++) { if (art[row][i] == * ) { min_height = row; found_content = true; } } row++; } found_content = false; row = height - 1; while (!found_content) { for (int i = 0; i < width && !found_content; i++) { if (art[row][i] == * ) { max_height = row; found_content = true; } } row--; } for (int r = min_height; r <= max_height; r++) { for (int c = min_width; c <= max_width; c++) { cout << art[r][c]; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m = 0; cin >> n; while (n--) { int x, y; cin >> x >> y; m = max(m, x + y); } cout << m; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = signed long long int; const int MX = 7000 + 10, INF = 3e5, A = 100; ll res; pair<ll, ll> ab[MX]; int n; map<ll, pair<int, ll>> m; vector<ll> v; bool ad; int main() { ios_base::sync_with_stdio(false); cout.tie(nullptr); cin.tie(nullptr); v.reserve(MX); cin >> n; for (int i = 0; i < n; i++) { cin >> ab[i].first; } for (int i = 0; i < n; i++) { cin >> ab[i].second; } for (int i = 0; i < n; i++) { auto& p = m[ab[i].first]; p.first++; p.second += ab[i].second; } for (auto it = m.rbegin(); it != m.rend(); it++) { auto& p = *it; ad = false; if (p.second.first >= 2) { res += p.second.second; v.push_back(p.first); } else { for (auto i : v) { if ((p.first & i) == p.first) { res += p.second.second; break; } } } } cout << res; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, x, res = 0, c = 0; cin >> n >> a >> b; for (int i = 0; i < n; i++) { cin >> x; if (x == 1) { if (a > 0) a--; else if (b > 0) { c++; b--; } else if (c > 0) c--; else res++; } else if (x == 2) { if (b > 0) b--; else res += 2; } } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; int T[27], A[27][27], P[27], use; long long Q[1 << 22]; int main() { int n, k, t; cin >> n >> k >> t; string S; cin >> S; S = + S; for (int i = 1; i <= k; ++i) cin >> T[i]; for (int i = 1; i <= k; ++i) for (int j = 1; j <= k; ++j) cin >> A[i][j]; memset(P, -1, sizeof(P)); for (int i = 1; i <= n; ++i) { int x = S[i] - A + 1; for (int j = 1; j <= k; ++j) { if (P[j] != -1) { Q[P[j]] += A[j][x]; Q[P[j] | (1 << (j - 1))] -= A[j][x]; Q[P[j] | (1 << (x - 1))] -= A[j][x]; Q[P[j] | (1 << (j - 1)) | (1 << (x - 1))] += A[j][x]; } P[j] |= (1 << (x - 1)); } P[x] = 0; use |= (1 << (x - 1)); } for (int i = 1; i <= k; ++i) Q[1 << (i - 1)] += T[i]; for (int i = 0; i < k; ++i) for (int j = 0; j < (1 << k); ++j) if (j & (1 << i)) Q[j] += Q[j ^ (1 << i)]; int ans = 0; for (int i = 0; i < (1 << k); ++i) if ((i & use) == i) if (Q[i] <= t && i != use) ++ans; cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long h[100000]; long long x[100000]; int g[31] = {0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1, 10, 9, 3, 6, 11, 12}; bool mark[100000]; map<int, int> gg; int grundy(int mask) { int nmask; int used[40]; memset(used, 0, sizeof(used)); for (int i = 1; i < 30; i++) { if (mask & (1 << i)) { nmask = mask; for (int k = i; k < 30; k += i) if (mask & 1 << k) nmask -= (1 << k); if (gg.count(nmask)) used[gg[nmask]] = 1; else { gg[nmask] = grundy(nmask); used[gg[nmask]] = 1; } } } for (int i = 0; i < 30; i++) { if (!used[i]) return i; } } int main() { int n, c1, s, r, m; cin >> n; h[1] = 1; s = n - (int)sqrt(n); c1 = s; for (int i = 2; i * i <= n; i++) { if (!mark[i]) { int j; int p = n; for (j = 0; p > 0; j++) { p /= i; } h[i] = j - 1; } long long k = i * i; while (k * k < n) { mark[k] = 1; k *= i; } c1 -= (h[i] + 1) / 2; } if (c1 % 2 == 0) r = 0; else r = 1; for (int i = 1; i * i <= n; i++) if (!mark[i]) r ^= g[h[i]]; if (r == 0) cout << Petya << endl; else cout << Vasya << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; const long long inf = 199999999999999999; const long long mod = 1e9 + 7; void read() { freopen( lifeguards.in , r , stdin); freopen( lifeguards.out , w , stdout); } void solve() { int coloured[N] = {}, pp[N] = {}, mx = 0, mx1 = 0, attribute = 0, cur = 0; long long n; cin >> n; vector<long long> v(n); for (auto &i : v) { cin >> i; if (i == cur) attribute = 1; cur = i; } if (v[0] == v[n - 1]) attribute = 1; if (is_sorted(v.begin(), v.end()) && v[0] == v[n - 1]) { cout << 1 n ; for (int i = 0; i < n; ++i) { cout << 1 ; } return; } if (n & 1 ^ 1) { cout << 2 n ; for (int i = 0; i < n; ++i) { if (i & 1) cout << 1 ; else cout << 2 ; } return; } else { if (attribute) { cout << 2 n ; long long op = 1, borely = 1; cur = 2; for (int i = 0; i < n; ++i) { if (v[i] == v[i - 1] && op) { if (cur == 2) cout << 2 , cur = 2; else cout << 1 , cur = 1; op ^= 1; continue; } if (cur == 2) cout << 1 , cur = 1; else cout << 2 , cur = 2; } } else { cout << 3 n ; for (int i = 0; i < n - 1; ++i) { if (i & 1) cout << 1 ; else cout << 2 ; } cout << 3; } } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long T = 1; cin >> T; while (T--) { solve(); cout << n ; } cerr << nTime elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; } |
#include <bits/stdc++.h> using namespace std; int A[10], B[10]; bool Check(int j) { memset(B, 0, sizeof(B)); while (j) { B[j % 10]++; j /= 10; } for (int i = 0; i <= 9; i++) if (A[i] && B[i]) return true; return false; } int main() { int res = 0, x, _x; cin >> x; _x = x; while (_x) { A[_x % 10]++; _x /= 10; } double s = sqrt(x); for (int i = 1; i <= s; i++) { if (x % i == 0) { if (Check(i)) res++; if (i * i != x && Check(x / i)) res++; } } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 5, NMAX = 2e5 + 5, MOD = 998244353, N = 1e9 + 5, LOG = 25; const long double EPS = 1e-8, pi = 3.14159265358979323846; vector<long long> res; bool first(long long k, vector<long long> &v) { long long index = k; res.clear(); vector<long long> ost; for (long long i = 0; i < k && index < v.size(); ++i, ++index) { while (index < v.size() && v[index] <= v[i]) ost.push_back(v[index++]); if (index == v.size()) return false; res.push_back(v[index]); res.push_back(v[i]); } while (index < v.size() && v[index] <= res.back()) ost.push_back(v[index++]); if (index == v.size()) return false; while (index < v.size()) res.push_back(v[index++]); for (long long o : ost) res.push_back(o); return true; } signed solve() { long long n; cin >> n; vector<long long> v(n); for (long long i = 0; i < n; ++i) cin >> v[i]; if (n < 3) { cout << 0 n ; for (long long x : v) cout << x << ; return 0; } sort(v.begin(), v.end()); long long l = 0, r = n - 2; while (l + 1 < r) { long long m = (l + r) / 2; if (first(m, v)) { l = m; } else { r = m - 1; } } if (first(r, v)) { cout << r << n ; for (long long x : res) cout << x << ; } else { first(l, v); cout << l << n ; for (long long x : res) cout << x << ; } } signed main() { { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long t = 1; while (t-- > 0) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, s, a, b, c, d, sum, ss; cin >> n >> m >> s; sum = 0; for (a = 1; a <= n && a <= s; a += 2) for (b = 1; b <= m && a * b <= s; b += 2) { if (a * b == s) { sum += (n - a + 1) * (m - b + 1) * (((a + 1) / 2) * ((b + 1) / 2) * 2 - 1); continue; } ss = s - a * b; for (c = 1; c <= n; c += 2) { if (c < a) { if (ss % c != 0) continue; d = ss / c + b; if (d > m || d % 2 != 1) continue; sum += (n - a + 1) * (m - d + 1); } else if (c > a) { if (ss % (c - a) != 0) continue; d = ss / (c - a); if (d >= b || d % 2 != 1) continue; sum += (n - c + 1) * (m - b + 1); } } } cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s; vector<int> v; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> s; s = * + s; for (int i = 1; i * i <= n; i++) if (n % i == 0) { v.push_back(i); if (i != n / i) v.push_back(n / i); } sort(v.begin(), v.end()); for (int x : v) reverse(s.begin() + 1, s.begin() + 1 + x); s.erase(0, 1); cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; bool used[123456]; bool cmp(const vector<int>& a, const vector<int>& b) { return a.size() < b.size(); } int main() { int n; cin >> n; vector<int> p(n + 1); for (int i = 1; i <= n; ++i) cin >> p[i]; vector<vector<int> > circle; for (int i = 1; i <= n; ++i) { if (!used[i]) { used[i] = 1; int curi = i; circle.push_back(vector<int>(1, i)); while (!used[p[curi]]) { curi = p[curi]; circle.back().push_back(curi); used[curi] = true; } } } bool ok = false; for (int i = 0; i < circle.size(); ++i) ok |= (circle[i].size() == 2 || circle[i].size() == 1); if (!ok) { cout << NO ; return 0; } sort(circle.begin(), circle.end(), cmp); if (circle[0].size() == 1) { cout << YES n ; for (int i = 1; i < circle.size(); ++i) for (int j = 0; j < circle[i].size(); ++j) cout << circle[0][0] << << circle[i][j] << n ; return 0; } for (int i = 0; i < circle.size(); ++i) { if (circle[i].size() % 2 != 0) { cout << NO ; return 0; } } cout << YES n ; cout << circle[0][1] << << circle[0][0] << n ; for (int i = 1; i < circle.size(); ++i) for (int j = 0; j < circle[i].size(); ++j) cout << circle[0][j % 2] << << circle[i][j] << n ; } |
#include <bits/stdc++.h> using namespace std; using Vi = vector<int>; using i64 = long long; using ll = long long; using Pi = pair<int, int>; mt19937 mrand(time(0)); int rnd(int x) { return mrand() % x; } const int N = 500005; const int M = 40005; int main() { ios::sync_with_stdio(false); cin.tie(0); int T; cin >> T; while (T--) { int n; cin >> n; Vi a(n); for (int i = 0; i < n; ++i) cin >> a[i]; int TOP = 30; Vi bit(TOP); for (int i = 0; i < n; ++i) for (int j = 0; j < TOP; ++j) if (a[i] >> j & 1) ++bit[j]; Vi ans(n + 1); for (int i = 0; i < TOP; ++i) for (int j = 1; j < n + 1; ++j) if (bit[i] % j == 0) ++ans[j]; for (int i = 1; i < n + 1; ++i) if (ans[i] == TOP) cout << i << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 100 * 1000 + 5; struct Node { int s, e, maxx; }; struct Segment { Node node[4 * maxN]; void build(int s, int e, int v = 1) { node[v].s = s; node[v].e = e; node[v].maxx = -1; if (e - s <= 1) return; int mid = (e + s) / 2; build(s, mid, v * 2); build(mid, e, v * 2 + 1); } void change(int s, int e, int x, int v = 1) { if (e <= node[v].s || node[v].e <= s) return; if (s <= node[v].s && node[v].e <= e) { node[v].maxx = max(x, node[v].maxx); return; } int l = v * 2, r = v * 2 + 1; change(s, e, x, l); change(s, e, x, r); node[v].maxx = max(node[l].maxx, node[r].maxx); } int get(int s, int e, int v = 1) { if (e <= s || e <= node[v].s || node[v].e <= s) return -1; if (s <= node[v].s && node[v].e <= e) return node[v].maxx; int l = v * 2, r = v * 2 + 1; return max(get(s, e, l), get(s, e, r)); } }; struct BIT { vector<int> val; void init(int sz) { val.resize(sz); } void add(int ind, int x) { ind++; for (int i = ind; i < ((int)(val).size()); i += i & (-i)) val[i] += x; } int get(int ind) { ind++; int res = 0; for (int i = ind; i > 0; i -= i & (-i)) res += val[i]; return res; } int getsum(int l, int r) { if (r < l) return 0; return get(r) - get(l - 1); } }; pair<int, int> p[maxN], que[maxN]; pair<int, int> r[maxN]; vector<int> a; vector<int> lst[maxN]; BIT baz; int n, k; int cnt[maxN], ans[maxN], pnt[maxN]; int low(int x) { return lower_bound(a.begin(), a.end(), x) - a.begin(); } int up(int x) { return upper_bound(a.begin(), a.end(), x) - a.begin(); } Segment rmq; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; baz.init(n + 1); rmq.build(0, n + 1); a.resize(n); for (int i = 0; i < n; i++) cin >> r[i].first, r[i].second = i, p[i].second = r[i].first; for (int i = 0; i < n; i++) cin >> a[i], p[i].first = a[i]; sort(a.begin(), a.end()); a.resize(unique(a.begin(), a.end()) - a.begin()); sort(r, r + n); for (int i = 0; i < n; i++) pnt[r[i].second] = i; for (int i = 0; i < n;) { int ind = i; while (ind < n && (ind == i || r[ind].first == r[ind - 1].first)) { int x = p[r[ind].second].first; baz.add(low(x), 1); ind++; } ind = i; while (ind < n && (ind == i || r[ind].first == r[ind - 1].first)) { int x = p[r[ind].second].first; cnt[ind] = baz.getsum(low(x - k), up(x + k) - 1); ind++; } i = ind; } int Q; cin >> Q; for (int q = 0; q < Q; q++) { int x, y; cin >> x >> y; x--; y--; if (p[x].second > p[y].second) swap(x, y); que[q] = make_pair(x, y); lst[pnt[y]].push_back(q); } for (int i = n - 1; i >= 0;) { int ind = i; while (ind >= 0 && (ind == i || r[ind].first == r[ind + 1].first)) { int x = low(p[r[ind].second].first); rmq.change(x, x + 1, cnt[ind]); ind--; } ind = i; while (ind >= 0 && (ind == i || r[ind].first == r[ind + 1].first)) { for (int j = 0; j < ((int)(lst[ind]).size()); j++) { int u = lst[ind][j]; int x = p[que[u].first].first, y = p[que[u].second].first; if (x > y) swap(x, y); int L = low(y - k), R = up(x + k); ans[u] = rmq.get(L, R); } ind--; } i = ind; } for (int i = 0; i < Q; i++) cout << ans[i] << endl; return 0; } |
#include <bits/stdc++.h> static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; static const long double epsilon = 1e-15; static const long double pi = acos((long double)-1); using namespace std; inline void init_io() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const int MAX_N = 100001; int arr[2 * MAX_N]; void rarr(int n) { for (int(i) = (0); (i) < (n); i++) cin >> arr[i]; } int main() { init_io(); int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long ans = 0; while (n) { if (n % k) { ans += n % k; n = n - n % k; } else { ans++; n /= k; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; pair<long long, long long> p[maxn]; long long ans[maxn]; int main() { int n, num = 0, cnt = 0; long long l, r; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %lld%lld , &l, &r); p[++num].first = l; p[num].second = 1; p[++num].first = r + 1; p[num].second = -1; } sort(p + 1, p + 1 + num); for (int i = 1; i <= num; i++) { ans[cnt] += p[i].first - p[i - 1].first; cnt += p[i].second; } for (int i = 1; i <= n; i++) printf( %lld%c , ans[i], i == n ? n : ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, f, vis[101][101][101]; char a[1001][1001]; int valid(int x, int y) { return (x >= 1 && x <= n && y >= 1 && y <= m); } int occupies(int x, int y, int turn) { y = y + (turn - 1) * 2; if (valid(x, y) && a[x][y] >= A && a[x][y] <= Z ) return 1; return 0; } void dfs(int curx, int cury, int turn) { if (cury == m) { f = 1; return; } if (vis[curx][cury][turn]) return; if (occupies(curx, cury, turn)) return; vis[curx][cury][turn] = 1; if (!occupies(curx, cury + 1, turn)) { if (valid(curx, cury + 1) && !occupies(curx, cury + 1, turn)) dfs(curx, cury + 1, turn + 1); if (valid(curx - 1, cury + 1) && !occupies(curx - 1, cury + 1, turn)) dfs(curx - 1, cury + 1, turn + 1); if (valid(curx + 1, cury + 1) && !occupies(curx + 1, cury + 1, turn)) dfs(curx + 1, cury + 1, turn + 1); } } int main() { ios::sync_with_stdio(false); ; cin.tie(0); ; int i, j, t, sx, sy, temp; string st; cin >> t; while (t--) { memset(vis, 0, sizeof vis); cin >> m >> temp; n = 3; for (i = 1; i <= n; i++) { cin >> st; st = + st; for (j = 1; j <= m; j++) { a[i][j] = st[j]; if (a[i][j] == s ) { sx = i; sy = j; } } } f = 0; dfs(sx, sy, 1); if (f) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, a, b, q; int Size; int getMid(int s, int e) { return s + (e - s) / 2; } int getSumUtil(int *st, int ss, int se, int qs, int qe, int si) { if (qs <= ss && qe >= se) return st[si]; if (se < qs || ss > qe) return 0; int mid = getMid(ss, se); return getSumUtil(st, ss, mid, qs, qe, 2 * si + 1) + getSumUtil(st, mid + 1, se, qs, qe, 2 * si + 2); } void updateValueUtilhigh_prod(int *st, int ss, int se, int i, int diff, int si) { if (i < ss || i > se) return; if (ss == se) { st[si] = min(st[si] + diff, a); return; } int mid = getMid(ss, se); updateValueUtilhigh_prod(st, ss, mid, i, diff, 2 * si + 1); updateValueUtilhigh_prod(st, mid + 1, se, i, diff, 2 * si + 2); st[si] = st[2 * si + 1] + st[2 * si + 2]; } void updateValueUtillow_prod(int *st, int ss, int se, int i, int diff, int si) { if (i < ss || i > se) return; if (ss == se) { st[si] = min(st[si] + diff, b); return; } int mid = getMid(ss, se); updateValueUtillow_prod(st, ss, mid, i, diff, 2 * si + 1); updateValueUtillow_prod(st, mid + 1, se, i, diff, 2 * si + 2); st[si] = st[2 * si + 1] + st[2 * si + 2]; } void updateValue(int arr[], int *st, int n, int i, int new_val, int flag) { if (i < 0 || i > n - 1) { return; } if (flag == 1) updateValueUtillow_prod(st, 0, n - 1, i, new_val, 0); else updateValueUtilhigh_prod(st, 0, n - 1, i, new_val, 0); } int getSum(int *st, int n, int qs, int qe) { if (qs < 0 || qe > n - 1 || qs > qe) { return 0; } return getSumUtil(st, 0, n - 1, qs, qe, 0); } int constructSTUtil(int arr[], int ss, int se, int *st, int si) { if (ss == se) { st[si] = arr[ss]; return arr[ss]; } int mid = getMid(ss, se); st[si] = constructSTUtil(arr, ss, mid, st, si * 2 + 1) + constructSTUtil(arr, mid + 1, se, st, si * 2 + 2); return st[si]; } int *constructST(int arr[], int n) { int x = (int)(ceil(log2(n))); int max_size = 2 * (int)pow(2, x) - 1; Size = max_size; int *st = new int[max_size]; constructSTUtil(arr, 0, n - 1, st, 0); return st; } int main() { cin >> n >> k >> a >> b >> q; int arr[n]; memset(arr, 0, sizeof(arr)); int *low_prod = constructST(arr, n); int *high_prod = constructST(arr, n); for (int i = 0; i < Size; i++) { low_prod[i] = 0; high_prod[i] = 0; } while (q--) { int ch; cin >> ch; if (ch == 1) { int pos, data; cin >> pos >> data; updateValue(arr, low_prod, n, pos - 1, data, 1); updateValue(arr, high_prod, n, pos - 1, data, 2); } else { int pos, pos2; cin >> pos; pos--; if (pos == 0 || pos + k - 1 == n - 1) { if (pos == 0) { int ans = getSum(high_prod, n, k, n - 1); cout << ans << endl; } else { int ans = getSum(low_prod, n, 0, pos - 1); cout << ans << endl; } } else cout << getSum(low_prod, n, 0, pos - 1) + getSum(high_prod, n, pos + k, n - 1) << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; double p[3005][305], f[305][3005], d[305]; inline int read() { int re = 0; char ch = getchar(); while (ch < 48 || ch > 57) ch = getchar(); while (ch > 47 && ch < 58) { re = (re << 3) + (re << 1) + (ch ^ 48); ch = getchar(); } return re; } inline void update(const int x) { static double g[3005]; memcpy(g, f[x], sizeof(double) * (n + 1)); f[x][0] = 0; for (int i = 1; i <= n; ++i) f[x][i] = f[x][i - 1] * (1 - p[i][x]) + g[i - 1] * p[i][x]; d[x] -= f[x][n]; } int main() { int m, t; double w = 0; n = read(); m = read(); for (int i = 1; i <= n; ++i) for (int j = 0; j < m; ++j) p[i][j] = (double)read() / 1e3; for (int i = 0; i < m; ++i) { f[i][0] = 1; for (int j = 1; j <= n; ++j) f[i][j] = f[i][j - 1] * (1 - p[j][i]); d[i] = 1 - f[i][n]; } for (int i = 0; i < n; ++i) { t = 0; for (int j = 1; j < m; ++j) if (d[t] < d[j]) t = j; w += d[t]; update(t); } printf( %.12lf , w); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 15000000, M = 5005; int dp[N], n, k, a[M]; set<int> s[23]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , a + i); s[0].insert(0); for (int i = 1; i <= k; i++) for (int j = 1; j <= n; j++) s[i].insert(i * a[j]); int q, x, ans; for (scanf( %d , &q); q--;) { scanf( %d , &x); ans = -1; for (int t = 1; t <= k && ans < 0; t++) for (int i = 1; i <= n && ans < 0; i++) { for (int j = 1; j <= t; j++) if (s[t - j].find(x - j * a[i]) != s[t - j].end()) { ans = t; break; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[60], i, x, n, k; cin >> n >> k; for (i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + 1 + n); if ((n + 1 - k) >= 1) cout << a[n + 1 - k] << << a[n + 1 - k]; else cout << -1 ; } |
#include <bits/stdc++.h> using namespace std; int main() { float n, k, y, s, per; cin >> n >> k >> y; per = (n * y) / 100; s = per - (int)per; if (s != 0) per = (int)per + 1; if ((per - k) > 0) { cout << per - k; } else { cout << 0 ; } } |
#include <bits/stdc++.h> using namespace std; string s; int a[10005], f[10005][4], q[28000], h2[10005], h3[10005], n; int main() { ios::sync_with_stdio(0); cin >> s; n = s.size(); for (int i = 1; i <= n; i++) a[i] = s[i - 1] - a + 1; for (int i = 6; i <= n; i++) h2[i] = a[i] * 900 + a[i + 1] * 30, h3[i] = h2[i] + a[i + 2]; if (n < 7) { printf( 0 n ); return 0; } f[n + 1][2] = f[n + 1][3] = 1, f[n - 1][2] = 1; q[h2[n - 1]] = 1; for (int i = n - 2; i > 5; i--) { if (f[i + 2][3] || (f[i + 2][2] && h2[i] != h2[i + 2])) f[i][2] = 1, q[h2[i]] = 1; if (f[i + 3][2] || (f[i + 3][3] && h3[i] != h3[i + 3])) f[i][3] = 1, q[h3[i]] = 1; } int ans = 0; for (int i = 1; i <= 27500; i++) ans += q[i]; printf( %d n , ans); for (int i = 1; i <= 27500; i++) { if (!q[i]) continue; if (i % 30) printf( %c%c%c n , (i / 900) + 96, ((i % 900) / 30) + 96, (i % 30) + 96); else printf( %c%c n , (i / 900) + 96, ((i % 900) / 30) + 96); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200000 + 1]; int main() { long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); sort(a + 1, a + n + 1); long long mpos = 0, ppos = 0; for (int i = 1; i <= n; i++) { if (a[n - i + 1] > 0) ppos = n - i + 1; if (a[i] < 0) mpos = i; } long long left = a[1], right = a[n]; if (left < 0) left *= -1; long long sum = 0; if (ppos != 0) { long long s = ppos - 1; if ((n - ppos + 1) % k != 0) { s += (n - ppos + 1) % k; sum += a[s] * 2; } for (int i = s + k; i <= n; i += k) sum += a[i] * 2; } if (mpos != 0) { long long s = mpos + 1; if ((mpos) % k != 0) { s -= (mpos % k); sum -= a[s] * 2; } for (long long i = s - k; i >= 1; i -= k) sum -= a[i] * 2; } if (ppos != 0 and mpos == 0) sum -= a[n]; else if (ppos == 0 and mpos != 0) sum += a[1]; else { if (left < right) sum -= a[n]; else sum += a[1]; } printf( %lld n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; struct node { int x, y; } f[2 * N]; int n, pos, vt[N], a[N], b[N], dd[N]; vector<pair<int, int> > vec; bool check(int x) { if (x == 0) return 0; while (x) { if (x % 10 != 7 && x % 10 != 4) return 0; x /= 10; } return 1; } int cnt = 0; int main() { scanf( %d , &n); pos = -1; for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), vec.push_back({a[i], i}); bool ok = 0; for (int i = 1; i < n; ++i) { if (a[i + 1] < a[i]) { ok = 1; break; } } if (!ok) { printf( 0 ); return 0; } sort(vec.begin(), vec.end()); for (int i = 1; i <= n; ++i) { if (check(a[i])) pos = i; a[i] = b[i] = lower_bound(vec.begin(), vec.end(), pair<int, int>(a[i], i)) - vec.begin(); vt[a[i]] = i; } if (pos == -1) { printf( -1 ); return 0; } int x; dd[b[pos]] = 1; sort(b + 1, b + n + 1); for (int i = 1; i <= n; ++i) { if (dd[b[i]]) continue; x = vt[b[i]]; if (x == i) continue; if (i != pos) { vt[a[pos]] = i; vt[a[i]] = pos; swap(a[i], a[pos]); f[++cnt] = {pos, i}; pos = i; } if (x != pos) { vt[a[pos]] = x; vt[a[x]] = pos; swap(a[x], a[pos]); f[++cnt] = {pos, x}; pos = x; } } printf( %d n , cnt); for (int i = 1; i <= cnt; ++i) { printf( %d %d n , f[i].x, f[i].y); } return 0; } |
#include <bits/stdc++.h> using namespace std; int A[100010], D[100010], n; set<int> edge[100010]; vector<int> ans; void bfs() { int i, u; memset(A, 0, sizeof(A)); queue<int> que; ans.clear(); for (i = 1; i <= n; i++) { if (D[i] == A[i]) { que.push(i); } } set<int>::iterator it; while (!que.empty()) { u = que.front(); que.pop(); if (A[u] != D[u]) continue; A[u]++; ans.push_back(u); for (it = edge[u].begin(); it != edge[u].end(); it++) { i = *it; A[i]++; if (D[i] == A[i]) { que.push(i); } } } printf( %d n , ans.size()); for (i = 0; i + 1 < ans.size(); i++) printf( %d , ans[i]); if (ans.size()) printf( %d n , ans[ans.size() - 1]); } int main() { int m, i, a, b; while (scanf( %d%d , &n, &m) != EOF) { for (i = 1; i <= n; i++) edge[i].clear(); for (i = 1; i <= m; i++) { scanf( %d%d , &a, &b); edge[a].insert(b); edge[b].insert(a); } for (i = 1; i <= n; i++) scanf( %d , &D[i]); bfs(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const int INF = 1e9; using ll = long long; using ull = unsigned long long; using vi = vector<int>; using vl = vector<ll>; using vb = vector<bool>; using vc = vector<char>; using vii = vector<vi>; using vll = vector<vl>; using pii = pair<int, int>; using pll = pair<ll, ll>; using vpii = vector<pii>; using vpll = vector<pll>; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vl v(n); ll sum = 0; for (int i = (0); i < (n); i++) { cin >> v[i]; sum += v[i]; } ll m = *max_element(v.begin(), v.end()); sum -= m; if (sum > m) cout << 0 n ; else cout << m - sum + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class A, class B> inline bool mina(A &first, B second) { return (first > second) ? (first = second, 1) : 0; } template <class A, class B> inline bool maxa(A &first, B second) { return (first < second) ? (first = second, 1) : 0; } int mod_count[(105)]; void mult(long long c[(105)][(105)], long long a[(105)][(105)], long long b[(105)][(105)], int D, int mod) { for (int(i) = 0; (i) < (D); ++(i)) { for (int(j) = 0; (j) < (D); ++(j)) { c[i][j] = 0; for (int(k) = 0; (k) < (D); ++(k)) { c[i][j] += a[i][k] * b[k][j]; c[i][j] %= mod; } } } } long long temp[(105)][(105)]; long long res[(105)][(105)]; int main() { int N, B, K, X; int a; scanf( %d %d %d %d , &N, &B, &K, &X); for (int(i) = 0; (i) < (N); ++(i)) { scanf( %d , &a); mod_count[a % X]++; } long long mat[(105)][(105)]; memset(mat, 0, sizeof(mat)); for (int i = 0; i < X; i++) { for (int j = 0; j < X; j++) { for (int k = 0; k < X; k++) { if ((j * 10 + k) % X == i) { mat[i][j] += mod_count[k]; } } } } B--; memset(res, 0, sizeof(res)); for (int(i) = 0; (i) < (X); ++(i)) res[i][i] = 1; while (B) { if (B & 1) { mult(temp, res, mat, X, 1000000007); memcpy(res, temp, sizeof(temp)); } mult(temp, mat, mat, X, 1000000007); memcpy(mat, temp, sizeof(temp)); B >>= 1; } long long ans = 0; for (int(i) = 0; (i) < (X); ++(i)) { ans += res[K][i] * mod_count[i]; ans %= 1000000007; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M, P[100005], R = 1, a, b; int findSet(int x) { if (P[x] == x) return x; else return (P[x] = findSet(P[x])); } void merge(int a, int b) { P[findSet(a)] = findSet(b); } int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; ++i) P[i] = i; for (int i = 0; i < M; ++i) { scanf( %d%d , &a, &b); if (findSet(a) != findSet(b)) merge(a, b); else { R += R; if (R >= 1000000009) R -= 1000000009; } if (R > 0) printf( %d n , R - 1); else printf( 1000000008 n ); } } |
#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; }; const int N = 1000010; int n; long long a[N]; Point st[N]; int tp; bool cmp(long long x1, long long y1, long long x2, long long y2) { return x2 * y1 <= x1 * y2; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); a[i] += a[i - 1]; while (tp && !cmp(st[tp].x - st[tp - 1].x, st[tp].y - st[tp - 1].y, i - st[tp].x, a[i] - st[tp].y)) tp--; st[++tp] = {i, a[i]}; } for (int i = 1; i <= tp; i++) { for (int j = st[i - 1].x + 1; j <= st[i].x; j++) { printf( %.9lf n , (double)(st[i].y - st[i - 1].y) / (st[i].x - st[i - 1].x)); } } getchar(); getchar(); return 0; } |
#include <bits/stdc++.h> using namespace std; int path[26][26]; char s[100001], t[100001]; void Floyd_Warshall(int n) { int i, j, k; for (k = 0; k < n; k++) { for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (path[i][k] + path[k][j] < path[i][j]) { path[i][j] = path[i][k] + path[k][j]; } } } } } int main() { char A[10], B[10]; int n; int i, j; int w; int len; int ans; int minval; int minnum; bool flag; while (scanf( %s%s%d , s, t, &n) != EOF) { for (i = 0; i < 26; i++) { for (j = 0; j < 26; j++) { if (i != j) { path[i][j] = 1000000000; } } } for (i = 0; i < n; i++) { scanf( %s%s%d , A, B, &w); path[A[0] - a ][B[0] - a ] = min(path[A[0] - a ][B[0] - a ], w); } if (strlen(s) != strlen(t)) { printf( -1 n ); continue; } Floyd_Warshall(26); len = strlen(s); ans = 0; flag = true; for (i = 0; i < len; i++) { if (s[i] != t[i]) { minval = 1000000000; for (j = 0; j < 26; j++) { if (path[s[i] - a ][j] + path[t[i] - a ][j] < minval) { minval = path[s[i] - a ][j] + path[t[i] - a ][j]; minnum = j; } } if (minval == 1000000000) { flag = false; break; } ans += minval; s[i] = minnum + a ; } } if (flag) { printf( %d n%s n , ans, s); } else { printf( -1 n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[1005][1005], q, opr, xi; int row_sum[1005], col_sum[1005], total_row_add, total_col_add; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) scanf( %d , &a[i][j]); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (i != j) { row_sum[i] = (row_sum[i] + a[i][j]) % 2; col_sum[j] = (col_sum[j] + a[i][j]) % 2; } int ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (i == j) ans = (ans + a[i][j] * a[i][j]) % 2; else ans = (ans + a[i][j] * a[j][i]) % 2; } scanf( %d , &q); while (q--) { scanf( %d , &opr); if (opr == 1) { scanf( %d , &xi); xi--; ans ^= 1; row_sum[xi] += n - 1; row_sum[xi] %= 2; ans = (ans + 2 * (col_sum[xi] + total_col_add)) % 2; col_sum[xi] = (col_sum[xi] + 1) % 2; total_col_add = (total_col_add + 1) % 2; } else if (opr == 2) { scanf( %d , &xi); xi--; ans ^= 1; col_sum[xi] += n - 1; col_sum[xi] %= 2; ans = (ans + 2 * (row_sum[xi] + total_row_add)) % 2; row_sum[xi] = (row_sum[xi] + 1) % 2; total_row_add = (total_row_add + 1) % 2; } else { printf( %d , ans); } } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); map<int, vector<int>> indices; for (int i = 0; i < n; i++) cin >> a[i], indices[a[i]].push_back(i); map<int, int> dp; int mxn = 0, ans = -1; for (int i = n - 1; i >= 0; i--) { dp[a[i]] = 1 + dp[a[i] + 1]; if (dp[a[i]] > mxn) mxn = dp[a[i]], ans = a[i]; } cout << mxn << n ; int prevI = -1, currA = ans; while (mxn) { int currI = lower_bound(indices[currA].begin(), indices[currA].end(), prevI) - indices[currA].begin(); cout << indices[currA][currI] + 1 << ; prevI = indices[currA][currI], currA++, mxn--; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 610; int n; int anc[MAXN], depth[MAXN]; bool mark[MAXN]; vector<int> adj[MAXN]; vector<int> partitions[2]; map<vector<int>, int> ans; queue<int> q; int qtdEdges(vector<int> a) { if (a.empty()) return 0; sort(a.begin(), a.end()); if (ans[a] == 0) { cout << ? << (int)a.size() << ; for (int i = 0; i < (int)a.size(); i++) cout << a[i] << ; cout << endl; cin >> ans[a]; ans[a]++; } return ans[a] - 1; } int qtdCrossEdges(vector<int> A, vector<int> B) { vector<int> merge; for (int i = 0; i < (int)A.size(); i++) merge.push_back(A[i]); for (int i = 0; i < (int)B.size(); i++) merge.push_back(B[i]); return qtdEdges(merge) - qtdEdges(A) - qtdEdges(B); } void add(int node, int p) { q.push(node); mark[node] = true; anc[node] = p; depth[node] = depth[p] + 1; partitions[depth[node] % 2].push_back(node); } void findEdges(int root, vector<int> nodes, int qtd) { if (qtd == 0) return; if (nodes.empty()) return; if ((int)nodes.size() == 1) { add(nodes.front(), root); return; } int sz = (int)nodes.size(); int m = sz / 2; vector<int> leftNodes, rightNodes; for (int i = 0; i < m; i++) leftNodes.push_back(nodes[i]); for (int i = m; i < (int)nodes.size(); i++) rightNodes.push_back(nodes[i]); findEdges(root, leftNodes, qtdCrossEdges(vector<int>(1, root), leftNodes)); findEdges(root, rightNodes, qtdCrossEdges(vector<int>(1, root), rightNodes)); } int findEndpoint(vector<int> L, vector<int> R) { if ((int)L.size() == 1) return L.front(); int sz = (int)L.size(); int m = sz / 2; vector<int> leftNodes, rightNodes; for (int i = 0; i < m; i++) leftNodes.push_back(L[i]); for (int i = m; i < (int)L.size(); i++) rightNodes.push_back(L[i]); if (qtdCrossEdges(leftNodes, R) != 0) return findEndpoint(leftNodes, R); return findEndpoint(rightNodes, R); } void findBadEdge(vector<int> nodes, int& A, int& B) { if (nodes.empty()) return; int sz = (int)nodes.size(); int m = sz / 2; vector<int> leftNodes, rightNodes; for (int i = 0; i < m; i++) leftNodes.push_back(nodes[i]); for (int i = m; i < (int)nodes.size(); i++) rightNodes.push_back(nodes[i]); if (qtdEdges(leftNodes) != 0) { findBadEdge(leftNodes, A, B); return; } if (qtdEdges(rightNodes) != 0) { findBadEdge(rightNodes, A, B); return; } A = findEndpoint(leftNodes, rightNodes); B = findEndpoint(rightNodes, vector<int>(1, A)); } int main() { cin >> n; for (int i = 1; i <= n; i++) { vector<int> aux(1, i); ans[aux] = 1; } add(1, 0); while (!q.empty()) { vector<int> remain; for (int i = 1; i <= n; i++) if (!mark[i]) remain.push_back(i); int cur = q.front(); q.pop(); findEdges(cur, remain, qtdCrossEdges(vector<int>(1, cur), remain)); } int bad = -1; for (int i = 0; i < 2; i++) if (qtdEdges(partitions[i]) != 0) bad = i; if (bad == -1) { cout << Y << (int)partitions[0].size() << endl; for (int i = 0; i < (int)partitions[0].size(); i++) cout << partitions[0][i] << ; cout << endl; return 0; } int A, B; findBadEdge(partitions[bad], A, B); if (depth[A] > depth[B]) swap(A, B); vector<int> pathA, pathB; while (depth[A] != depth[B]) pathB.push_back(B), B = anc[B]; while (A != B) { pathA.push_back(A); A = anc[A]; pathB.push_back(B); B = anc[B]; } pathA.push_back(A); cout << N << (int)pathA.size() + (int)pathB.size() << endl; for (int i = 0; i < (int)pathA.size(); i++) cout << pathA[i] << ; for (int i = (int)pathB.size() - 1; i >= 0; i--) cout << pathB[i] << ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { int a, b, n, krok = 0; cin >> a >> b >> n; bool podm = false; int g; while (n > 0) { if (krok % 2 == 0) { g = gcd(a, n); n -= g; podm = true; } else { g = gcd(b, n); n -= g; podm = false; } krok++; } if (podm) cout << 0 << endl; else cout << 1 << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int cnt = 0; int a; string s; cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == 4 || s[i] == 7 ) { cnt++; } } if (cnt == 4 || cnt == 7) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int minFact[1000000 + 5]; vector<int> prime; int rec(int N, int K) { int ans = 0; if (N / K <= 10000) { ans = 0; for (int i = 1; i <= N / K; ++i) { ans += (minFact[i] >= K); } } else { ans = N / K; for (int i = 0; i < prime.size() and prime[i] < K; ++i) { ans -= rec(N / K, prime[i]); } } return ans; } int main() { minFact[1] = 2 * 1000000007; for (int i = 2; i <= 100000; ++i) { if (minFact[i] == 0) { prime.push_back(i); for (int j = i; j <= 100000; j += i) { if (minFact[j] == 0) minFact[j] = i; } } } int L, R, K; cin >> L >> R >> K; for (int i = 2; i * i <= K; ++i) { if (K % i == 0) { cout << 0; return 0; } } cout << rec(R, K) - rec(L - 1, K); } |
#include <bits/stdc++.h> using namespace std; inline long long sum(long long x) { x %= 1000000007; return (1LL * x * (x + 1) / 2) % 1000000007; } int main() { long long n, m; ios::sync_with_stdio(false); cin >> n >> m; long long ans = ((n % 1000000007) * (m % 1000000007)) % 1000000007; int rad = sqrt(n); for (int i = 1; i <= n / (rad + 1) && i <= m; i++) { ans -= (1LL * i * (n / i)) % 1000000007; if (ans < 0) ans += 1000000007; } for (int i = 1; i <= rad; i++) { ans -= (1LL * i * (sum(min(n / i, m)) - sum(min(n / (i + 1), m)) + 1000000007)) % 1000000007; if (ans < 0) ans += 1000000007; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; char grid[55][55]; char vis[55][55]; int di[] = {0, 1, -1, 0}; int dj[] = {1, 0, 0, -1}; bool dfs(int pi, int pj, char c, int li = -1, int lj = -1) { if (vis[pi][pj]) return true; vis[pi][pj] = true; for (int d = 0; d < 4; d++) { int ni = pi + di[d]; int nj = pj + dj[d]; if (ni == li && nj == lj) continue; if (ni < 0 || ni >= n || nj < 0 || nj >= m) continue; if (grid[ni][nj] != c) continue; if (dfs(ni, nj, c, pi, pj)) return true; } return false; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) { cin >> grid[i]; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (vis[i][j] == false) { if (dfs(i, j, grid[i][j])) { cout << Yes << endl; return 0; } } } } cout << No << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool gt(long double a, long double b) { return a > b + 1e-12; } long long a, b, x; int main() { int n; cin >> n; while (n--) { string s; cin >> s; if (s == UR || s == DL ) a++; else if (s == UL || s == DR ) b++; else x++; } cout << (x + 1 + a) * (x + 1 + b) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long a, b; cin >> a >> b; long i = 1; while (a >= 0 && b >= 0) { a -= i; if (a < 0) { cout << Vladik n ; return 0; } b -= i + 1; if (b < 0) { cout << Valera n ; return 0; } i += 2; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b, c; char str[2000000 + 5]; vector<int> G[10000 + 5]; vector<int> per[10000 + 5]; int siz[10000 + 5], dfn[10000 + 5], low[10000 + 5], dcnt; int blo[10000 + 5], bgcd[10000 + 5], blocnt; int stk[10000 + 5], t; int num[10000 + 5], mx[10000 + 5], mn[10000 + 5]; bool instk[10000 + 5]; int fact[10000 + 5], inv[10000 + 5]; int PowMod(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = 1LL * ret * x % 1000000007; x = 1LL * x * x % 1000000007; y >>= 1; } return ret; } int gcd(int x, int y) { if (y == 0) return x; return gcd(y, x % y); } void InPut() { scanf( %d %d %d , &n, &a, &b); for (int i = 1; i <= n; i++) { scanf( %s , str + 1); for (int j = 1; j <= n; j++) if (str[j] == 1 ) G[i].push_back(j); } for (int i = 1; i <= n; i++) { scanf( %d , &siz[i]); per[i].resize(siz[i] + 1); scanf( %s , str); for (int j = 0; j < siz[i]; j++) if (str[j] == 1 ) per[i][j] = 1; else if (str[j] == 0 ) per[i][j] = 0; } } void Tarjan(int u, int fa) { dfn[u] = low[u] = ++dcnt; instk[u] = true; stk[t++] = u; for (int i = 0; i < (int)G[u].size(); i++) { int v = G[u][i]; if (dfn[v] == 0) { Tarjan(v, u); low[u] = min(low[u], low[v]); } else if (instk[v] == true) low[u] = min(low[u], dfn[v]); } if (low[u] == dfn[u]) { int fro = 0; blocnt++; do { fro = stk[--t]; instk[fro] = false; blo[fro] = blocnt; bgcd[blocnt] = gcd(bgcd[blocnt], siz[fro]); } while (fro != u); } } void Part1() { for (int i = 1; i <= n; i++) if (dfn[i] == 0) Tarjan(i, -1); for (int i = 1; i <= blocnt; i++) per[i + n].resize(bgcd[i] + 1); for (int i = 1; i <= n; i++) for (int j = 0; j < siz[i]; j++) per[blo[i] + n][j % bgcd[blo[i]]] |= per[i][j]; int nw; for (int i = blocnt; i > 1; i--) { nw = gcd(bgcd[i], bgcd[i - 1]); for (int j = 0; j < bgcd[i]; j++) if (per[i + n][j]) { per[i - 1 + n][j % nw] |= 1; num[i]++; } } for (int j = 0; j < bgcd[1]; j++) num[1] += per[1 + n][j]; for (int i = 1; i <= n; i++) { mx[i] = mn[i] = 0; mx[i] = 1LL * num[blo[i]] * siz[i] / bgcd[blo[i]]; for (int j = 0; j < siz[i]; j++) mn[i] += per[i][j]; } } void Prepare() { fact[0] = 1; for (int i = 1; i <= 10000; i++) fact[i] = 1LL * fact[i - 1] * i % 1000000007; inv[10000] = PowMod(fact[10000], 1000000007 - 2); for (int i = 10000 - 1; i >= 0; i--) inv[i] = 1LL * inv[i + 1] * (1LL * i + 1LL) % 1000000007; } inline int C(int x, int y) { return 1LL * fact[x] * inv[y] % 1000000007 * inv[x - y] % 1000000007; } int Part2() { Prepare(); int cnt1 = 0, cnt2 = 0, ret = 0; for (int i = 1; i <= n; i++) { cnt1 = cnt2 = 0; for (int j = 1; j <= n; j++) { if (i != j && mn[j] > mx[i]) cnt1++; if (i != j && mn[j] <= mx[i] && (mx[j] > mx[i] || (mx[j] == mx[i] && j < i))) cnt2++; } if (cnt1 > a - 1) continue; for (int j = min(b, min(a - 1 - cnt1, cnt2)); j >= 0 && j + 1 + cnt1 >= b; j--) ret = (1LL * ret + 1LL * C(cnt2, j) * C(cnt1, b - j - 1) % 1000000007) % 1000000007; } return ret; } int main() { InPut(); Part1(); int ans = Part2(); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[200000 + 5], b[10][200000 + 5]; int main() { int n, i; cin >> n; char c; c = getchar(); for (i = 1; i <= n; i++) { c = getchar(); if (c == R ) a[i] = 1; if (c == G ) a[i] = 2; if (c == B ) a[i] = 3; } b[1][1] = 1; b[1][2] = 2; for (i = 3; i <= n; i++) b[1][i] = 6 - b[1][i - 1] - b[1][i - 2]; for (i = 1; i <= n; i++) if (b[1][i] != a[i]) b[1][0]++; b[2][1] = 1; b[2][2] = 3; for (i = 3; i <= n; i++) b[2][i] = 6 - b[2][i - 1] - b[2][i - 2]; for (i = 1; i <= n; i++) if (b[2][i] != a[i]) b[2][0]++; b[3][1] = 2; b[3][2] = 1; for (i = 3; i <= n; i++) b[3][i] = 6 - b[3][i - 1] - b[3][i - 2]; for (i = 1; i <= n; i++) if (b[3][i] != a[i]) b[3][0]++; b[4][1] = 2; b[4][2] = 3; for (i = 3; i <= n; i++) b[4][i] = 6 - b[4][i - 1] - b[4][i - 2]; for (i = 1; i <= n; i++) if (b[4][i] != a[i]) b[4][0]++; b[5][1] = 3; b[5][2] = 1; for (i = 3; i <= n; i++) b[5][i] = 6 - b[5][i - 1] - b[5][i - 2]; for (i = 1; i <= n; i++) if (b[5][i] != a[i]) b[5][0]++; b[6][1] = 3; b[6][2] = 2; for (i = 3; i <= n; i++) b[6][i] = 6 - b[6][i - 1] - b[6][i - 2]; for (i = 1; i <= n; i++) if (b[6][i] != a[i]) b[6][0]++; int x = 1; for (i = 1; i <= 6; i++) if (b[i][0] < b[x][0]) x = i; cout << b[x][0] << endl; for (i = 1; i <= n; i++) { if (b[x][i] == 1) cout << R ; if (b[x][i] == 2) cout << G ; if (b[x][i] == 3) cout << B ; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.