malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int arr[10][10]; double me[10][10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n = 10; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> arr[i][j]; } } me[0][0] = 0.; me[0][1] = 6.; me[0][2] = 6.; me[0][3] = 6.; me[0][4] = 6.; me[0][5] = 6.; double fix = 1. / 6.; for (int i = 0; i < n; i++) { if (i % 2 == 0) { for (int j = (i == 0) ? 6 : 0; j < n; j++) { double best = 1e6; for (int k = 0; k <= (1 << 6) - 1; k++) { double summ = 1; for (int s = 0; s < 6; s++) { if (((k >> s) & 1) == 1) { int posx = (j - s - 1 >= 0) ? j - s - 1 : n - (((j - s - 1) % 10 + 10) % 10) - 1; int posy = (j - s - 1 >= 0 \|\| i == 0) ? i : i - 1; summ += fix * me[posy - arr[posy][posx]][posx]; } else { int posx = (j - s - 1 >= 0) ? j - s - 1 : n - (((j - s - 1) % 10 + 10) % 10) - 1; int posy = (j - s - 1 >= 0 \|\| i == 0) ? i : i - 1; summ += fix * me[posy][posx]; } } best = min(best, summ); } me[i][j] = best; } } else { for (int j = n - 1; j >= 0; j--) { double best = 1e6; for (int k = 0; k <= (1 << 6) - 1; k++) { double summ = 1; for (int s = 0; s < 6; s++) { if (((k >> s) & 1) == 1) { int posx = (j + s + 1 < n) ? j + s + 1 : n - ((j + s + 1) % 10 + 10) % 10 - 1; int posy = (j + s + 1 < n \|\| i == 0) ? i : i - 1; summ += fix * me[posy - arr[posy][posx]][posx]; } else { int posx = (j + s + 1 < n) ? j + s + 1 : n - ((j + s + 1) % 10 + 10) % 10 - 1; int posy = (j + s + 1 < n \|\| i == 0) ? i : i - 1; summ += fix * me[posy][posx]; } } best = min(best, summ); } me[i][j] = best; } } } cout.precision(9); cout << fixed << me[9][0]; }
#include <bits/stdc++.h> using namespace std; const int MX = 1000006; const long long inf = 1e18; long long n, m, p, a[MX], ca[MX], b[MX], cb[MX], mn[MX]; long long x[MX], y[MX], z[MX]; long long st[4 * MX + 20], lz[4 * MX + 20], res = -inf; vector<int> pos[MX]; void push(int i, int j, int pos) { if (i < j) { lz[pos * 2] += lz[pos]; lz[pos * 2 + 1] += lz[pos]; } st[pos] += lz[pos]; lz[pos] = 0; } void update(int i, int j, int pos, int a, int b, long long k) { if (lz[pos]) push(i, j, pos); if (j < a \|\| b < i) return; if (a <= i && j <= b) { lz[pos] = k; push(i, j, pos); return; } int m = (i + j) / 2; update(i, m, pos * 2, a, b, k); update(m + 1, j, pos * 2 + 1, a, b, k); st[pos] = max(st[pos * 2], st[pos * 2 + 1]); } long long query(int i, int j, int pos, int a, int b) { if (lz[pos]) push(i, j, pos); if (j < a \|\| b < i) return -inf; if (a <= i && j <= b) return st[pos]; int m = (i + j) / 2; return max(query(i, m, pos * 2, a, b), query(m + 1, j, pos * 2 + 1, a, b)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> p; fill(mn, mn + MX, inf); for (int i = 1; i <= n; i++) { cin >> a[i] >> ca[i]; mn[a[i]] = min(mn[a[i]], ca[i]); } for (int i = 1; i < MX; i++) update(1, MX - 1, 1, i, i, -mn[i]); fill(mn, mn + MX, inf); for (int i = 1; i <= m; i++) { cin >> b[i] >> cb[i]; mn[b[i]] = min(mn[b[i]], cb[i]); } for (int i = 1; i <= p; i++) { cin >> x[i] >> y[i] >> z[i]; pos[y[i]].push_back(i); } for (int i = 1; i < MX - 1; i++) { for (int j : pos[i - 1]) update(1, MX - 1, 1, x[j] + 1, MX - 1, z[j]); push(1, MX - 1, 1); res = max(res, st[1] - mn[i]); } cout << res << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 2e9; const long long INFL = 2e18; const int N = 1e6, M = N; int n, m, G = 0; vector<int> adj[N + 5]; int gr[N + 5], p[N + 5]; vector<int> pth[N + 5]; vector<int> PTH_myEndlessLove; int Pos[N + 5]; void dfs(int u) { gr[u] = G; PTH_myEndlessLove.push_back(u); for (int i = (0), _b = (((int)(adj[u]).size())); i < _b; ++i) { int v = adj[u][i]; if (gr[v]) continue; dfs(v); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = (1), _b = (n); i <= _b; ++i) cin >> p[i]; int u, v; while (m--) { cin >> u >> v; adj[p[u]].push_back(p[v]); adj[p[v]].push_back(p[u]); } for (int i = (1), _b = (n); i <= _b; ++i) if (!gr[p[i]]) { PTH_myEndlessLove.clear(); ++G; dfs(p[i]); sort(PTH_myEndlessLove.begin(), PTH_myEndlessLove.end()); reverse(PTH_myEndlessLove.begin(), PTH_myEndlessLove.end()); pth[G] = PTH_myEndlessLove; } for (int i = (1), _b = (n); i <= _b; ++i) { cout << pth[gr[p[i]]][Pos[gr[p[i]]]] << ; ++Pos[gr[p[i]]]; } cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; char a[10005]; char b[1000005]; vector<int> poj[10005]; int alen, blen; long long total; int pos; vector<int>::iterator it; int main() { scanf( %s , a); scanf( %s , b); alen = strlen(a), blen = strlen(b); pos = 0; total = 1; for (int i = 0; i <= alen - 1; i++) { poj[a[i] - a ].push_back(i); } for (int i = 0; i <= 25; i++) { sort(poj[i].begin(), poj[i].end()); } for (int i = 0; i <= blen - 1; i++) { if (poj[b[i] - a ].empty()) { printf( -1 n ); return 0; } it = lower_bound(poj[b[i] - a ].begin(), poj[b[i] - a ].end(), pos); if (it == poj[b[i] - a ].end()) { it = poj[b[i] - a ].begin(); total++; } pos = (*it) + 1; } printf( %d n , total); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n{0}, a{0}, m{0}, s{0}; cin >> n; for (long long int i = 1; i <= n; i++) { cin >> a; s += a; m = max(m, a); } if (s % 2 == 1 \|\| s < 2 * m) { cout << NO ; return 0; } cout << YES ; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0xffffff; int LEN; class Mcmf { public: struct T { int from, to, val; int next, cost; } edge[200001]; int len; int visit[200001], pre[200001], dist[200001], que[200001], vis[200001], pos[200001]; void init() { memset(vis, -1, sizeof(vis)); len = 0; } void add(int from, int to, int val, int cost) { edge[len].from = from, edge[len].to = to, edge[len].val = val, edge[len].cost = cost; edge[len].next = vis[from], vis[from] = len++; edge[len].from = to, edge[len].to = from, edge[len].val = 0, edge[len].cost = -cost; edge[len].next = vis[to], vis[to] = len++; } int SPFA(int s, int t, int n) { int i, to, k; for (i = 0; i <= n; i++) { pre[i] = -1, visit[i] = 0; } int head, tail; head = tail = 0; for (i = 0; i <= n; i++) dist[i] = inf; que[tail++] = s, pre[s] = s, dist[s] = 0, visit[s] = 1; while (head != tail) { int from = que[head++]; visit[from] = 0; for (k = vis[from]; k != -1; k = edge[k].next) { to = edge[k].to; if (edge[k].val > 0 && dist[from] + edge[k].cost < dist[to]) { dist[to] = dist[from] + edge[k].cost; pre[to] = from; pos[to] = k; if (!visit[to]) { visit[to] = 1; que[tail++] = to; } } } } if (pre[t] != -1 && dist[t] < inf) return 1; return 0; } int mnCostFlow(int s, int t, int n) { if (s == t) { } int flow = 0, cost = 0; while (SPFA(s, t, n)) { int from, mn = inf; for (from = t; from != s; from = pre[from]) mn = min(mn, edge[pos[from]].val); flow += mn; cost += dist[t] * mn; for (from = t; from != s; from = pre[from]) { edge[pos[from]].val -= mn; edge[pos[from] ^ 1].val += mn; } } if (flow != LEN) return -1; return cost; } }; int n, q; char s[10010]; int cnt[27]; int tmp[27]; Mcmf mcf; int main() { mcf.init(); scanf( %s , s); LEN = strlen(s); for (int i = 0; i < LEN; ++i) { cnt[s[i] - a ]++; } int len; scanf( %d , &q); int st = q + 26, en = st + 1, num; for (int i = 0; i < q; ++i) { scanf( %s , s); len = strlen(s); memset(tmp, 0, sizeof(tmp)); for (int k = 0; k < len; ++k) ++tmp[s[k] - a ]; for (int k = 0; k < 26; ++k) mcf.add(i, q + k, tmp[k], 0); scanf( %d , &num); mcf.add(st, i, num, i + 1); } for (int i = 0; i < 26; ++i) mcf.add(q + i, en, cnt[i], 0); int ans = mcf.mnCostFlow(st, en, en + 1); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; unsigned int dp[100010][400]; vector<int> nima[100010]; int a[100010], b[100010]; int n, m, s, e; int solve(int all = s, int c = e) { unsigned int INF = -1; vector<int> vt[100010]; int cur = 0; memset(dp, -1, sizeof(dp)); int cnt = (all + c - 1) / c; for (int i = 0; i < m; ++i) { vt[b[i]].push_back(i + 1); } int ans = 0; for (int i = 0; i < n; ++i) { dp[cur][0] = 0; cur ^= 1; memset(dp[cur], -1, sizeof(dp[cur])); for (int j = 1; j < cnt + 1; ++j) { unsigned int pre = dp[cur ^ 1][j - 1]; unsigned int p = upper_bound(vt[a[i]].begin(), vt[a[i]].end(), pre) - vt[a[i]].begin(); if (p == vt[a[i]].size()) p = INF; else p = vt[a[i]][p]; dp[cur][j] = min(dp[cur ^ 1][j], p); if (dp[cur ^ 1][j] > p && p + i + j * c <= all) ans = max(ans, j); } } return ans; } int main() { while (cin >> n >> m >> s >> e) { memset(dp, -1, sizeof(dp)); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int i = 0; i < m; ++i) { scanf( %d , &b[i]); nima[b[i]].push_back(i + 1); } int ans = 0; int cnt = s / e; for (int i = 0; i < n; ++i) { dp[i][0] = 0; if (nima[a[i]].size()) dp[i][1] = nima[a[i]][0]; else dp[i][1] = -1; if (i == 0) continue; for (int j = 1; j <= cnt; ++j) { unsigned int now = -1; int w = a[i]; int last = dp[i - 1][j - 1]; now = upper_bound(nima[w].begin(), nima[w].end(), last) - nima[w].begin(); if (now == nima[w].size() \|\| dp[i - 1][j - 1] == -1) { now = -1; } else { now = nima[w][now]; } dp[i][j] = min(dp[i - 1][j], now); } } for (int i = 0; i < n; ++i) for (int j = 0; j < cnt + 1; ++j) { if (dp[i][j] != -1) { if (i + dp[i][j] + 1 + j * e <= s) ans = max(ans, j); } } cout << ans << endl; return 0; } }
#include <bits/stdc++.h> using namespace std; int a[11][5]; bool ok(int l, int j, int k) { int i, an = 0; for (i = 0; i < 5; i++) { an = an + (a[j][i] - a[l][i]) * (a[k][i] - a[l][i]); } if (an > 0) return false; return true; } int main() { ios::sync_with_stdio(false); int i, j, k, n; cin >> n; if (n > 11) { n *= 5; while (n--) cin >> i; cout << 0; } else { for (i = 0; i < n; i++) cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3] >> a[i][4]; vector<int> v; k = n; j = n; for (i = 0; i < n; i++) { k = n; for (j = 0; j < n && k == n; j++) for (k = j + 1; k < n; k++) { if (!ok(i, j, k)) { break; } } if (j == n && k == n) v.push_back(i + 1); } cout << v.size() << endl; for (i = 0; i < v.size(); i++) cout << v[i] << << endl; ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2505; int n, m, K, a[2][N][N], L[N][8], R[N][8], Lc[N][8], Rc[N][8]; char s[N]; long long ans; void work(int x1, int x2, int y1, int y2, int d) { if (y2 - y1 > x2 - x1) { swap(x1, y1), swap(x2, y2), d ^= 1; } if (x1 + 1 == x2) { ans += a[d][y1][x2] - a[d][y1][x1] == K; return; } int mid = x1 + x2 >> 1; work(x1, mid, y1, y2, d), work(mid, x2, y1, y2, d); for (int i = y1; i < y2; ++i) { for (int k = 0; k < K + 1; ++k) L[i][k] = x1, Lc[i][k] = 0, R[i][k] = x2, Rc[i][k] = 0; for (int j = y1; j < i + 1; ++j) { for (int k = 0; k < K + 1; ++k) { Lc[j][k] += a[d][i][mid] - a[d][i][L[j][k]]; while (Lc[j][k] > k) Lc[j][k] -= a[d ^ 1][L[j][k]][i + 1] - a[d ^ 1][L[j][k]][j], ++L[j][k]; Rc[j][k] += a[d][i][R[j][k]] - a[d][i][mid]; while (Rc[j][k] > k) --R[j][k], Rc[j][k] -= a[d ^ 1][R[j][k]][i + 1] - a[d ^ 1][R[j][k]][j]; } for (int k = 0; k < K + 1; ++k) ans += ((k ? L[j][k - 1] : mid) - L[j][k]) * (R[j][K - k] - (K - k ? R[j][K - k - 1] : mid)); } } } int main() { scanf( %d%d%d , &n, &m, &K); for (int i = 0; i < n; ++i) { scanf( %s , s); for (int j = 0; j < m; ++j) a[0][i][j + 1] = a[1][j][i + 1] = s[j] - 48; } for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) a[0][i][j + 1] += a[0][i][j]; for (int j = 0; j < m; ++j) for (int i = 0; i < n; ++i) a[1][j][i + 1] += a[1][j][i]; work(0, n, 0, m, 1); printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const long long int mx = 70, Mod = 1e9 + 7, mxx = 350000; int n; int get(int x, int y, int z) { if (x > y) swap(x, y); if (x > z) swap(x, z); if (y > z) swap(y, z); return x * mx * mx + y * mx + z; } bool mark[mxx]; vector<int> e[mxx]; int dp[mxx]; int par[mxx]; short d[mx][mx]; vector<pair<int, int> > res; void connect(int u, int v) { e[u].push_back(v); e[v].push_back(u); } void bfs(int v) { mark[v] = 1; vector<int> vc; vc.clear(); vc.push_back(v); for (int i = 0; i < vc.size(); i++) for (int u : e[v = vc[i]]) if (!mark[u]) mark[u] = 1, vc.push_back(u), par[u] = v; } void move(int u, int v) { short a[3], b[3]; bool ma[3], mb[3]; for (int i = 0; i < 3; i++) { a[i] = u % mx; b[i] = v % mx; u /= mx; v /= mx; ma[i] = 0; mb[i] = 0; } for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (a[i] == b[j]) ma[i] = 1, mb[j] = 1; for (int i = 0; i < 3; i++) { if (!ma[i]) u = a[i]; if (!mb[i]) v = b[i]; } res.push_back(make_pair(u + 1, v + 1)); } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int x, y, z, u; cin >> n >> x >> y >> z; x--, y--, z--; string s; for (int i = 0; i < n; i++) { cin >> s; for (int j = 0; j < n; j++) d[i][j] = s[j] - a + 1; } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { for (int k = j + 1; k < n; k++) { u = get(i, j, k); for (int v = min(min(i, j), k) + 1; v < n; v++) if (v != i && v != j && v != k) { if (d[v][i] == d[j][k] && v > i) connect(u, get(v, j, k)); if (d[v][j] == d[i][k] && v > j) connect(u, get(v, i, k)); if (d[v][k] == d[i][j] && v > k) connect(u, get(v, i, j)); } } } } u = get(x, y, z); if (u == get(0, 1, 2)) return cout << 0 n , 0; bfs(get(0, 1, 2)); if (!par[u]) return cout << -1 , 0; while (par[u]) { move(u, par[u]); u = par[u]; } cout << res.size() << n ; for (pair<int, int> p : res) cout << p.first << << p.second << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; long long a[maxn]; long long fac[maxn], inv[maxn]; const int mod = 1e9 + 7; long long Pow(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; } return res; } long long C(int n, int m) { if (n < m) return 0; return fac[n] * inv[n - m] % mod * inv[m] % mod; } int main() { fac[0] = inv[0] = 1; for (int i = 1; i < maxn; i++) { fac[i] = 1ll * fac[i - 1] * i % mod; inv[i] = Pow(fac[i], mod - 2); } int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %lld , &a[i]), a[i] %= mod; if (n <= 2) { cout << (a[1] + a[2]) % mod << endl, exit(0); } if (n % 2 != 0) { for (int i = 1; i < n; i++) { if (i % 2 != 0) a[i] = (a[i] + a[i + 1]) % mod; else a[i] = (a[i] - a[i + 1]) % mod; } n -= 1; } long long ans1 = 0, ans2 = 0; for (int i = 1; i <= n; i += 2) { ans1 = (ans1 + C(n / 2 - 1, (i - 1) / 2) * a[i] % mod) % mod; ans2 = (ans2 + C(n / 2 - 1, (i - 1) / 2) * a[i + 1] % mod) % mod; } if ((1ll * n * (n - 1) / 2) % 2 == 0) cout << (ans1 - ans2 + mod) % mod << endl; else cout << (ans1 + ans2 + mod) % mod << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> &vec) { os << { ; for (int i = (0), __i = (((int)(vec).size())); i < __i; i++) { os << vec[i]; if (i + 1 != ((int)(vec).size())) os << , ; } os << } ; return os; } template <class T1, class T2> ostream &operator<<(ostream &os, pair<T1, T2> &par) { os << ( << par.first << , << par.second << ) ; return os; } const int dim = 110000; char s[dim]; char s1[dim]; int p[dim]; int a[dim]; int a1[dim]; long long r1[dim]; long long r2[dim]; long long r3[dim]; int main() { scanf( %s , s); int n = strlen(s); for (int i = (0), __i = (n); i < __i; i++) s1[i] = s[n - 1 - i]; s1[n] = 0; p[0] = -1; int g = -1; for (int i = (1), __i = (n); i < __i; i++) { while (g != -1 && s1[g + 1] != s1[i]) { g = p[g]; } if (s1[g + 1] == s1[i]) ++g; p[i] = g; } g = -1; a[0] = 0; a1[0] = 0; for (int i = (0), __i = (n); i < __i; i++) { while (g != -1 && s1[g + 1] != s[i]) { g = p[g]; } if (s1[g + 1] == s[i]) ++g; if (a[i] > g + 1) { a1[i + 1] = a1[i]; } else { a1[i + 1] = i - g; } a[i + 1] = max(a[i], g + 1); } r1[0] = 0; r2[0] = 0; r3[0] = 1; long long cc = 52152551; for (int i = (0), __i = (n); i < __i; i++) { r1[i + 1] = r1[i] + s[i] * r3[i]; r2[i + 1] = r2[i] + s1[i] * r3[i]; r3[i + 1] = r3[i] * cc; } int ans = 0; int i1, j1; int i2, j2; for (int i = (0), __i = (n); i < __i; i++) { int l = 0, r = n; while (r - l > 1) { int mid = (l + r) / 2; if (i - mid >= 0 && i + mid < n && (r1[i + 1] - r1[i - mid]) * r3[n - i - mid - 1] == (r2[n - i] - r2[n - i - mid - 1]) * r3[i - mid]) { l = mid; } else { r = mid; } } int t = min(a[i - l], n - i - l - 1); int ans1 = t * 2 + l * 2 + 1; if (ans < ans1) { ans = ans1; i1 = a1[i - l]; j1 = t; i2 = i - l; j2 = l * 2 + 1; } } if (j1 == 0) { printf( 1 n ); printf( %d %d n , i2 + 1, j2); } else { printf( 3 n ); printf( %d %d n , i1 + 1, j1); printf( %d %d n , i2 + 1, j2); printf( %d %d n , n - j1 + 1, j1); } return 0; }
#include <bits/stdc++.h> using namespace std; int df[26]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; int mini = s.length(); for (int i = 0; i < s.length(); i++) { df[s[i] - A ]++; } for (int i = 0; i < k; i++) mini = min(mini, df[i]); cout << k * mini << n ; }
#include <bits/stdc++.h> using namespace std; void solve() { int n, i; cin >> n; int a[n], b[n + 1]; for (i = 0; i < n; i++) { cin >> a[i]; b[a[i]] = i; } int l, r, ans[n + 1]; l = b[1]; r = b[1]; for (i = 2; i <= n; i++) { l = min(l, b[i]); r = max(r, b[i]); if ((r - l + 1) != i) ans[i] = 0; else ans[i] = 1; } cout << 1; for (i = 2; i <= n; i++) cout << ans[i]; cout << endl; } int main() { int t; cin >> t; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; namespace FGF { int n, m; const int N = 2e6 + 5; const int mo = 1e9 + 7; char s[N]; long long a[N], pw[N], cnt[N]; long long ans; void FWTxor(long long y, int op) { for (int i = 1; i <= n; i++) for (int j = 0; j < (1 << n); j += (1 << i)) for (int k = 0; k < (1 << (i - 1)); k++) { long long c = (y[j \| k] + y[j \| k \| (1 << (i - 1))]) % mo, d = (y[j \| k] - y[j \| k \| (1 << (i - 1))] + mo) % mo; y[j \| k] = c op % mo, y[j \| k \| (1 << (i - 1))] = d * op % mo; } } void work() { scanf( %d , &n); scanf( %s , s); pw[0] = 1; for (int i = 0; i < (1 << n); i++) a[i] = s[i] - 0 ; for (int i = 1; i <= n; i++) pw[i] = 2LL * pw[i - 1] % mo; for (int i = 1; i < (1 << n); i++) cnt[i] = cnt[i >> 1] + (i & 1); FWTxor(a, 1); for (int i = 0; i < (1 << n); i++) a[i] = a[i] * a[i] % mo; FWTxor(a, (mo + 1) / 2); for (int i = 0; i < (1 << n); i++) ans = (ans + 1LL * a[i] * pw[n - cnt[i]]) % mo; printf( %lld , ans * 3 % mo); } } // namespace FGF int main() { FGF::work(); return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 2e4 + 5; int sum[55][N], a[55][N]; int lazy[N << 2], tree[N << 2]; int dp[55][N]; void pushdown(int root) { if (lazy[root]) { tree[root << 1] += lazy[root]; tree[root << 1 \| 1] += lazy[root]; lazy[root << 1] += lazy[root]; lazy[root << 1 \| 1] += lazy[root]; lazy[root] = 0; } } void update(int root, int l, int r, int L, int R, int val) { if (L <= l && r <= R) { tree[root] += val; lazy[root] += val; return; } pushdown(root); int mid = (l + r) >> 1; if (L <= mid) update(root << 1, l, mid, L, R, val); if (R > mid) update(root << 1 \| 1, mid + 1, r, L, R, val); tree[root] = max(tree[root << 1], tree[root << 1 \| 1]); } int getsum(int x1, int y1, int x2, int y2) { return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1]; } int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j]; } } for (int i = 1; i <= m; i++) { dp[1][i] = getsum(1, i, min(2, n), min(m, i + k - 1)); } for (int i = 2; i <= n; i++) { memset(lazy, 0, sizeof lazy); memset(tree, 0, sizeof tree); for (int j = 1; j <= m; j++) { update(1, 1, m, j, j, dp[i - 1][j]); } for (int j = 1; j <= k; j++) { update(1, 1, m, 1, j, -a[i][j]); } for (int j = 1; j <= m; j++) { dp[i][j] = tree[1] + getsum(i, j, min(n, i + 1), min(m, j + k - 1)); update(1, 1, m, max(j - k + 1, 1), j, a[i][j]); if (j + k <= m) { update(1, 1, m, j + 1, j + k, -a[i][j + k]); } } } int ans = 0; for (int i = 1; i <= m; i++) { ans = max(ans, dp[n][i]); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = 707406378; const int maxn = 1.5e7 + 10; void read(long long &x) { char ch; bool flag = 0; for (ch = getchar(); !isdigit(ch) && ((flag \|= (ch == - )) \|\| 1); ch = getchar()) ; for (x = 0; isdigit(ch); x = (x << 1) + (x << 3) + ch - 48, ch = getchar()) ; x = 1 - 2 flag; } int main() { long long n, x, y; cin >> n; long long ans = 0; for (int i = 0; i < n; i++) { cin >> x >> y; ans = max(ans, x + y); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> const int p = 998244353; const int inv2 = 499122177; const int MAXN = 140000; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch > 9 \|\| ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } do x = (x * 10 + ch - 48) % p, ch = getchar(); while (ch >= 0 && ch <= 9 ); return (x * f % p + p) % p; } int n, k, r[MAXN]; long long c[MAXN] = {1, 6, 1}; long long s[MAXN], f[MAXN], g[MAXN]; long long fastpow(long long a, int b) { long long res = 1; a %= p; while (b) { if (b & 1) res = res * a % p; a = a * a % p; b >>= 1; } return res; } void NTT(long long a, int N) { for (int i = 0; i < N; i++) if (i < r[i]) std::swap(a[i], a[r[i]]); for (int n = 2, m = 1; n <= N; m = n, n <<= 1) { long long g1 = fastpow(3, (p - 1) / n); for (int l = 0; l < N; l += n) { long long g = 1, t1, t2; for (int i = l; i < l + m; i++) { t1 = a[i], t2 = g a[i + m] % p; a[i] = (t1 + t2) % p; a[i + m] = (t1 - t2 + p) % p; g = g * g1 % p; } } } return; } void INTT(long long a, int N) { NTT(a, N); std::reverse(a + 1, a + N); int invN = fastpow(N, p - 2); for (int i = 0; i < N; i++) a[i] = a[i] invN % p; } long long a1[MAXN], b1[MAXN]; void Inv(long long a, long long b, int n) { if (n == 1) return void(b[0] = fastpow(a[0], p - 2)); Inv(a, b, (n + 1) >> 1); int N = 1, l = -1; while (N <= n << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) \| ((i & 1) << l); for (int i = 0; i < n; i++) a1[i] = a[i]; for (int i = n; i < N; i++) a1[i] = 0; NTT(a1, N); NTT(b, N); for (int i = 0; i < N; i++) b[i] = ((b[i] << 1) % p + p - a1[i] * b[i] % p * b[i] % p) % p; INTT(b, N); for (int i = n; i < N; i++) b[i] = 0; return; } void Dervt(long long a, long long b, int n) { for (int i = 1; i < n; i++) b[i - 1] = a[i] * i % p; b[n - 1] = 0; } void Integ(long long a, long long b, int n) { for (int i = 1; i < n; i++) b[i] = a[i - 1] * fastpow(i, p - 2) % p; b[0] = 0; } long long f1[MAXN], f2[MAXN]; void Ln(long long f, long long g, int n) { memset(f1, 0, sizeof(f1)); memset(f2, 0, sizeof(f2)); Dervt(f, f1, n); Inv(f, f2, n); int N = 1, l = -1; while (N <= n << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) \| ((i & 1) << l); NTT(f1, N); NTT(f2, N); for (int i = 0; i < N; i++) f1[i] = f1[i] * f2[i] % p; INTT(f1, N); Integ(f1, g, n); return; } long long g1[MAXN]; void Exp(long long f, long long g, int n) { if (n == 1) return void(g[0] = 1); Exp(f, g, (n + 1) >> 1); Ln(g, g1, n); int N = 1, l = -1; while (N <= n << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) \| ((i & 1) << l); for (int i = 0; i < n; i++) f1[i] = f[i]; for (int i = n; i < N; i++) g1[i] = f1[i] = 0; for (int i = 0; i < N; i++) f1[i] = ((f1[i] - g1[i]) % p + p) % p; f1[0] = (f1[0] + 1) % p; NTT(f1, N); NTT(g, N); for (int i = 0; i < N; i++) g[i] = f1[i] * g[i] % p; INTT(g, N); for (int i = n; i < N; i++) g[i] = 0; return; } long long lnf[MAXN]; void Pow(long long f, long long g, int n, int k) { Ln(f, lnf, n); for (int i = 0; i < n; i++) lnf[i] = lnf[i] * k % p; memset(g, 0, sizeof(g1)); Exp(lnf, g, n); return; } int main() { n = read(); int t = read(); k = std::min(n, t); int N = 1, l = -1; while (N <= (k + 1) << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) \| ((i & 1) << l); Pow(c, s, k + 1, inv2 - 1); Pow(c, f, k + 1, inv2); f[0]++, f[1]++; for (int i = 0; i <= k; i++) f[i] = f[i] * inv2 % p; Pow(f, g, k + 1, n + 1); NTT(s, N); NTT(g, N); for (int i = 0; i < N; i++) s[i] = s[i] * g[i] % p; INTT(s, N); for (int i = 1; i <= k; i++) std::printf( %lld , s[i]); for (int i = k + 1; i <= t; i++) std::printf( 0 ); std::putchar( n ); return 0; }
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int x, long long int y) { if (y > x) { return gcd(y, x); } if (y == 0) { return x; } return gcd(y, x % y); } bool prime(long long int x) { for (long long int i = 2; i <= sqrt(x); i++) { if (x % i == 0) { return 0; } } return 1; } long long int fact(long long int n) { if (n == 0) { return 1; } return n * fact(n - 1); } void solve() { long long int r, c; cin >> r >> c; long long int b = 1; for (long long int i = 0; i < r; i++) { if (i % 2 == 0) { for (long long int j = 0; j < c; j++) cout << # ; cout << endl; } else { if (b == 1) { for (long long int j = 0; j < c - 1; j++) cout << . ; cout << # ; cout << endl; b = 0; } else { cout << # ; for (long long int j = 0; j < c - 1; j++) cout << . ; cout << endl; b = 1; } } } } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); long long int t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int n; int dp[10][310]; int nex[1010][10][1010]; int ai[1010]; int up; void init(void) { memset(dp, -1, sizeof(dp)); int i, j; int cnt[10]; for (i = 1; i <= n; i++) { memset(cnt, 0, sizeof(cnt)); for (j = 1; j <= 8; j++) for (int k = 1; k <= n; k++) nex[i][j][k] = 1e9; for (j = i; j <= n; j++) { cnt[ai[j]]++; nex[i][ai[j]][cnt[ai[j]]] = j; } } } int main() { int i, j, k; cin >> n; for (i = 1; i <= n; i++) { cin >> ai[i]; } init(); up = (1 << 8) - 1; int ans = 0; for (int num = 0; num * 8 <= n; num++) { for (int i = 0; i < 256; i++) for (int k = 0; k <= 8; k++) dp[k][i] = 1e9; dp[0][0] = 1; for (i = 0; i <= up; i++) { for (j = 0; j <= 8; j++) { for (k = 1; k <= 8; k++) { if (i & (1 << (k - 1))) continue; if (dp[j][i] > n) continue; dp[j][i ^ (1 << (k - 1))] = min(dp[j][i ^ (1 << (k - 1))], nex[dp[j][i]][k][num] + 1); dp[j + 1][i ^ (1 << (k - 1))] = min(dp[j + 1][i ^ (1 << (k - 1))], nex[dp[j][i]][k][num + 1] + 1); } } } for (i = 0; i <= 8; i++) if (dp[i][up] <= n + 1) { ans = max(ans, num * 8 + i); } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; int num[105]; int a[105][105], sum[105][105], mx[105][105]; int f[105][10005]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> num[i]; for (int j = 1; j <= num[i]; j++) { cin >> a[i][j]; sum[i][j] = sum[i][j - 1] + a[i][j]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= num[i]; j++) { for (int k = 0; k <= j; k++) { mx[i][j] = max(mx[i][j], sum[i][k] + (sum[i][num[i]] - sum[i][num[i] - (j - k)])); } } } for (int i = 1; i <= n; i++) { for (int j = 0; j <= m; j++) { int maxi = 0; for (int k = 0; k <= num[i] && k <= j; k++) { maxi = max(maxi, f[i - 1][j - k] + mx[i][k]); } f[i][j] = maxi; } } cout << f[n][m] << endl; return 0; }
#include <bits/stdc++.h> int main() { long long a, b, c, flag = 0; scanf( %lld , &a); if (a == 1 \|\| a == 2) { printf( -1 ); return 0; } if (a % 2 == 0) { flag = 1; } if (flag != 1) { b = (a * a + 1) / 2; c = (a * a - 1) / 2; printf( %lld %lld , c, b); } else { b = (a * a + 4) / 4; c = (a * a - 4) / 4; printf( %lld %lld , c, b); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); vector<int> w(n, 0); w[0] = v[0]; for (int i = 1; i < n; i++) w[i] = w[i - 1] + v[i]; int score = 0, penalty = 0; for (int i = 0; i < n; i++) { if (w[i] <= 60 * 12 - 10) score++; else break; if (w[i] > 60 * 6 - 10) penalty += w[i] - 60 * 6 + 10; } cout << score << << penalty << endl; }
#include <bits/stdc++.h> using namespace std; int freq[200005]; int arr[1005]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) freq[arr[i] + arr[j]]++; int ans = 0; for (int i = 0; i < 2e5 + 5; i++) ans = max(ans, freq[i]); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; struct __timestamper {}; struct change { int s, t, u; }; vector<long long> solve(vector<int> a, vector<change> b) { long long sum = 0; for (auto x : a) sum += x; vector<long long> ans; int n = a.size(); vector<int> cntr(n); auto change_counter = [&](int i, int delta) { sum -= max(0, a[i] - cntr[i]); cntr[i] += delta; sum += max(0, a[i] - cntr[i]); }; map<pair<int, int>, int> mp; for (auto c : b) { auto it = mp.find({c.s, c.t}); if (it != mp.end()) { change_counter(it->second, -1); mp.erase(it); } if (c.u != -1) { mp[{c.s, c.t}] = c.u; change_counter(c.u, +1); } ans.push_back(sum); } return ans; } int main() { int n; while (scanf( %d , &n) == 1) { vector<int> a(n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } int q; scanf( %d , &q); vector<change> b(q); for (int i = 0; i < q; i++) { scanf( %d%d%d , &b[i].s, &b[i].t, &b[i].u); b[i].s--; b[i].u--; } auto ans = solve(a, b); for (auto x : ans) printf( %lld n , x); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x, y = 0, z = 0; for (int i = 0; i < n; i++) { cin >> x; if (x != y) { z++; } y = x; } cout << z; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, t[100001], ans; double w; long long lowbit(long long x) { return x & (-x); } struct rua { double x, v; long long id; } _[100001]; void change(long long x) { while (x <= n) t[x]++, x += lowbit(x); } int sum(long long k) { long long res = 0; while (k > 0) res += t[k], k -= lowbit(k); return res; } bool cmp(rua a, rua b) { return fabs(a.x * b.v) < fabs(a.v * b.x); } int main() { scanf( %I64d%lf , &n, &w), w += 1e-6; for (long long i = 1; i <= n; i++) scanf( %lf%lf , &_[i].x, &_[i].v), _[i].v -= w; sort(_ + 1, _ + n + 1, cmp); for (long long i = 1; i <= n; i++) _[i].id = i, _[i].v += 2 * w; sort(_ + 1, _ + n + 1, cmp); for (long long i = 1; i <= n; i++) ans += i - 1 - sum(_[i].id), change(_[i].id); return printf( %I64d n , ans), 0; }
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; char ch; int t,n,k,h[110],pos; void read(int &x) { x=0; ch=getchar(); while(ch< 0 \|\|ch> 9 ) ch=getchar(); while(ch>= 0 &&ch<= 9 ) { x=x*10+ch- 0 ; ch=getchar(); } } int main() { read(t); while(t--) { read(n);read(k); for (int i=1;i<=n;i++) read(h[i]); while(k--) { pos=0; for (int j=1;j<=n;j++) if (j==n) pos=-1; else if (h[j]<h[j+1]) {h[j]++;pos=j;break;} if (pos==-1) break; } printf( %d n ,pos); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<long long> X(n + 1), Y(n + 1); for (int i = (1); i <= (n); ++i) scanf( %lld%lld , &X[i], &Y[i]); long long S = 0; for (int k = (1); k <= (n); ++k) { vector<double> V; for (int i = (1); i <= (n); ++i) if (i != k) V.push_back(atan2(Y[i] - Y[k], X[i] - X[k])); sort(V.begin(), V.end()); V.insert(V.end(), V.begin(), V.end()); for (int i = 0, j = 0; i + 1 < n; i++) { while (V[j] + (j >= n - 1 ? 2 * acos(-1) : 0.0) - V[i] < acos(-1)) j++; long long x = j - 1 - i, y = n - 2 - x; S += x * (x - 1) / 2 * y * (y - 1) / 2; } } printf( %lld n , S / 2); return 0; }
#include <bits/stdc++.h> using namespace std; int sum, len; string s; int cnt[26][5010][26]; int main() { cin >> s; sum = 0; len = s.length(); s += s; memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < len; i++) { for (int j = 1; j < len; j++) { cnt[s[i] - a ][j][s[i + j] - a ]++; } } for (int i = 0; i < 26; i++) { int mx = 0; for (int j = 1; j < len; j++) { int tmp = 0; for (int k = 0; k < 26; k++) if (cnt[i][j][k] == 1) tmp++; mx = max(mx, tmp); } sum += mx; } printf( %.10lf n , (double)sum / (double)len); }
#include <bits/stdc++.h> using namespace std; int main() { int A1, B1, C1, A2, B2, C2; cin >> A1 >> B1 >> C1 >> A2 >> B2 >> C2; if (A1 * B2 != A2 * B1) cout << 1 << endl; else { if (A1 != 0 && A2 != 0 && A2 * C1 == A1 * C2) cout << -1 << endl; else if (A1 != 0 && A2 != 0) cout << 0 << endl; else if ((A1 == 0 && A2 != 0) \|\| (A1 != 0 && A2 == 0)) { if (B1 != 0 && B2 != 0) cout << 1 << endl; else if (B1 == 0 && C1 != 0 \|\| B2 == 0 && C2 != 0) cout << 0 << endl; else cout << -1 << endl; } else if (A1 == 0 && A2 == 0) { if (((B1 == 0 && C1 == 0) && (B2 == 0 && C2 == 0)) \|\| ((B1 != 0 \|\| B2 != 0) && B1 * C2 == B2 * C1)) cout << -1 << endl; else cout << 0 << endl; } } }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; bool vis[N]; vector<int> prime; void sieve() { for (int i = 2; i * i < N; i++) { if (vis[i]) continue; for (int j = 2; j * i < N; j++) { vis[i * j] = 1; } } for (int i = 2; i < N; i++) { if (vis[i] == 0) prime.push_back(i); } } int find(int x) { int ans = upper_bound(prime.begin(), prime.end(), x) - prime.begin() - 1; return ans; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); sieve(); int t; cin >> t; while (t--) { int n; cin >> n; int ans = find(n) - find(sqrt(n)) + 1; cout << ans << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int Inf = (1 << 30) - 1; const long long lInf = (1LL << 62) - 1; const int mInf = 0x7f7f7f7f; const int Maxn = 200010; vector<int> a[Maxn]; pair<int, int> S[Maxn << 1]; int f[Maxn]; int t[Maxn]; int n, m, ans; void solve(int k) { map<int, int> M; for (int i = 1; i <= n; i++) M[++f[i]] = i; for (int i = 1; i <= n; i++) t[i] = a[i][k]; int cnt = 0, tot = 0, minn = Inf; for (int i = 1; i <= n; i++) { int tmp = M[t[i]]; if (tmp != 0 && i - tmp != 0) S[++tot] = make_pair(i - tmp > 0 ? i - tmp : i - tmp + n, 1); if (tmp != 0) S[++tot] = make_pair(i - tmp + 1 > 0 ? i - tmp + 1 : i - tmp + n + 1, -1); if (t[i] == f[i]) cnt++; } sort(S + 1, S + tot + 1); minn = min(minn, n - cnt); int p = 1; for (int i = 1; i < n; i++) { while (S[p].first <= i && p <= tot) cnt += S[p++].second; minn = min(minn, i + n - cnt); } ans += minn; } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; i++) { a[i].push_back(0); for (int x, j = 1; j <= m; j++) cin >> x, a[i].push_back(x); } for (int i = 1; i <= n; i++) f[i] = (i - 1) * m; for (int i = 1; i <= m; i++) solve(i); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, s, f, add = 0, rund = 1; cin >> n >> m >> s >> f; if (s < f) add = 1; else add = -1; for (int i = 0; i < m; i++) { int t, l, r; cin >> t >> l >> r; while (rund < t) { if (s == f) break; if (add == 1) cout << R ; else if (add == -1) cout << L ; s += add; rund++; } if (s == f) continue; if (t == rund) { rund++; if (s >= l && s <= r \|\| s + add >= l && s + add <= r) cout << X ; else if (add == 1) { cout << R ; s += add; } else if (add == -1) { cout << L ; s += add; } } } while (s != f) { if (add == 1) cout << R ; else if (add == -1) cout << L ; s += add; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int Nmax = 1e5 + 5, lg = 16; struct updates { int l, x, y, id; bool operator<(const updates &other) const { if (l != other.l) return l > other.l; return id < other.id; } }; vector<updates> upd; vector<int> v[Nmax]; struct Node { int s, l, r; bool full; Node() { s = l = r = full = 0; } Node(int S, int L, int R, bool Full) { s = S; l = L; r = R; full = Full; } }; int f[Nmax], x, y, w, i, answer[Nmax], n, q; Node combina(Node a, Node b) { if (a.full && b.full) return Node(0, a.l + b.l, a.r + b.r, 1); if (a.full) return Node(b.s, a.l + b.l, b.r, 0); if (b.full) return Node(a.s, a.l, a.r + b.r, 0); return Node(a.s + b.s + f[a.r + b.l], a.l, b.r, 0); } class SegmentTree { Node a; public: void build(int sz) { a = new Node[4 sz + 5]; } void update(int node, int st, int dr, int pos) { if (st == dr) { a[node].s = 0; a[node].l = a[node].r = a[node].full = 1; return; } if (pos <= ((st + dr) / 2)) update((node << 1), st, ((st + dr) / 2), pos); else update(((node << 1) + 1), ((st + dr) / 2) + 1, dr, pos); a[node] = combina(a[(node << 1)], a[((node << 1) + 1)]); } Node query(int node, int st, int dr, int Left, int Right) { if (Left <= st && dr <= Right) return a[node]; if (Left <= ((st + dr) / 2) && ((st + dr) / 2) < Right) return combina( query((node << 1), st, ((st + dr) / 2), Left, Right), query(((node << 1) + 1), ((st + dr) / 2) + 1, dr, Left, Right)); if (Left <= ((st + dr) / 2)) return query((node << 1), st, ((st + dr) / 2), Left, Right); else return query(((node << 1) + 1), ((st + dr) / 2) + 1, dr, Left, Right); } } aint[Nmax]; class HeavyPath { int level[Nmax], dad[Nmax], to[Nmax], pos[Nmax], w[Nmax], sz[Nmax], First[Nmax], t[Nmax][lg + 2], nrChains; void dfs(int node) { for (auto i = 1; i <= lg; ++i) t[node][i] = t[t[node][i - 1]][i - 1]; w[node] = 1; for (auto it : v[node]) if (!level[it]) { level[it] = level[node] + 1; dad[it] = t[it][0] = node; dfs(it); w[node] += w[it]; } } void chains(int node) { to[node] = nrChains; pos[node] = ++sz[nrChains]; if (v[node].size() == 1 && node != 1) return; int xson = 0; for (auto it : v[node]) if (it != dad[node] && w[xson] < w[it]) xson = it; chains(xson); for (auto it : v[node]) if (it != dad[node] && it != xson) { First[++nrChains] = it; chains(it); } } Node query(int x, int y) { if (to[x] == to[y]) return aint[to[x]].query(1, 1, sz[to[x]], pos[x], pos[y]); return combina(query(x, dad[First[to[y]]]), aint[to[y]].query(1, 1, sz[to[y]], 1, pos[y])); } public: void prepare() { memset(level, 0, sizeof(level)); level[1] = 1; dad[1] = 0; dfs(1); nrChains = 1; First[1] = 1; memset(sz, 0, sizeof(sz)); chains(1); int i; for (i = 1; i <= nrChains; ++i) aint[i].build(sz[i]); } int get_answer(int x, int y) { int X = x, Y = y; if (level[x] < level[y]) swap(x, y), swap(X, Y); int up = level[x] - level[y] - 1, i; if (up != -1) { for (i = 0; i <= lg; ++i) if (up & (1 << i)) x = t[x][i]; if (dad[x] == y) { auto ans = query(x, X); if (ans.full) return f[ans.l]; return ans.s + f[ans.l] + f[ans.r]; } x = dad[x]; } for (i = lg; i >= 0; --i) if (t[x][i] != t[y][i]) x = t[x][i], y = t[y][i]; auto ans1 = query(x, X), ans2 = query(y, Y); swap(ans2.l, ans2.r); ans1 = combina(ans2, ans1); if (ans1.full) return f[ans1.l]; return ans1.s + f[ans1.l] + f[ans1.r]; } void add_edge(int x, int y) { if (y == dad[x]) swap(x, y); aint[to[y]].update(1, 1, sz[to[y]], pos[y]); } } hp; int main() { cin.sync_with_stdio(false); cin >> n >> q; for (i = 1; i < n; ++i) cin >> f[i]; for (i = 1; i < n; ++i) { cin >> x >> y >> w; v[x].push_back(y); v[y].push_back(x); upd.push_back({w, x, y, 0}); } for (i = 1; i <= q; ++i) { cin >> x >> y >> w; upd.push_back({w, x, y, i}); } sort(upd.begin(), upd.end()); hp.prepare(); for (auto it : upd) { if (!it.id) hp.add_edge(it.x, it.y); else answer[it.id] = hp.get_answer(it.x, it.y); } for (i = 1; i <= q; ++i) cout << answer[i] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int(n); scanf( %d , &(n)); int val[100001][2]; double arr[100001]; for (int i = 1; i <= n; i++) cin >> arr[i]; int sum = 0; for (int i = 1; i <= n; i++) { int t = arr[i]; if (arr[i] - t != 0) { if (t > 0) { val[i][0] = t; val[i][1] = t + 1; } if (t < 0) { val[i][0] = t - 1; val[i][1] = t; } if (t == 0) { if (arr[i] > 0) { val[i][0] = 0; val[i][1] = 1; } if (arr[i] < 0) { val[i][0] = -1; val[i][1] = 0; } } } else { val[i][0] = t; val[i][1] = t; } sum += val[i][1]; } int k = sum; for (int i = 1; i <= n; i++) { if (k > 0 && val[i][0] != val[i][1]) { cout << val[i][0] << n ; k--; } else cout << val[i][1] << n ; } return 0; }
#include <bits/stdc++.h> long long i, j, m, n, s, t, x, y, z, ma; long long a[100][100], b[100][100]; long long mi(long long a, long long b) { if (a < b) return a; else return b; } void ss(long long x, long long y, long long shu) { long long i, j, t; z++; if (z > 8000000) return; if (shu > ma) { for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) b[i][j] = a[i][j]; ma = shu; } t = mi(x + 3, n); for (i = x; i <= t; i++) for (j = 1; j <= m; j++) if (a[i][j] == 0) { if (a[i][j - 1] + a[i][j + 1] + a[i + 1][j] + a[i + 2][j] == 0 && j - 1 > 0 && j + 1 <= m && i + 2 <= n) { a[i][j - 1] = shu + 1; a[i][j + 1] = shu + 1; a[i][j] = shu + 1; a[i + 1][j] = shu + 1; a[i + 2][j] = shu + 1; ss(i, j, shu + 1); a[i][j - 1] = 0; a[i][j + 1] = 0; a[i][j] = 0; a[i + 1][j] = 0; a[i + 2][j] = 0; } if (a[i][j - 1] + a[i][j + 1] + a[i - 1][j] + a[i - 2][j] == 0 && j - 1 > 0 && j + 1 <= m && i - 2 > 0) { a[i][j - 1] = shu + 1; a[i][j + 1] = shu + 1; a[i][j] = shu + 1; a[i - 1][j] = shu + 1; a[i - 2][j] = shu + 1; ss(i, j, shu + 1); a[i][j - 1] = 0; a[i][j + 1] = 0; a[i][j] = 0; a[i - 1][j] = 0; a[i - 2][j] = 0; } if (a[i - 1][j] + a[i + 1][j] + a[i][j + 1] + a[i][j + 2] == 0 && i - 1 > 0 && i + 1 <= n && j + 2 <= m) { a[i - 1][j] = shu + 1; a[i + 1][j] = shu + 1; a[i][j] = shu + 1; a[i][j + 1] = shu + 1; a[i][j + 2] = shu + 1; ss(i, j, shu + 1); a[i - 1][j] = 0; a[i + 1][j] = 0; a[i][j] = 0; a[i][j + 1] = 0; a[i][j + 2] = 0; } if (a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j - 2] == 0 && i - 1 > 0 && i + 1 <= n && j - 2 > 0) { a[i - 1][j] = shu + 1; a[i + 1][j] = shu + 1; a[i][j] = shu + 1; a[i][j - 1] = shu + 1; a[i][j - 2] = shu + 1; ss(i, j, shu + 1); a[i - 1][j] = 0; a[i + 1][j] = 0; a[i][j] = 0; a[i][j - 1] = 0; a[i][j - 2] = 0; } } return; } int main() { while (scanf( %lld%lld , &n, &m) != EOF) { ma = 0; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { a[i][j] = 0; b[i][j] = 0; } z = 0; ss(1, 1, 0); printf( %lld n , ma); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) if (b[i][j] == 0) printf( . ); else printf( %c , b[i][j] + 64); printf( n ); } } }
#include <bits/stdc++.h> using namespace std; int c[100001]; int w[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> c[i]; } for (int i = 0; i < n; i++) { cin >> w[i]; } int ch = m; set<pair<long long, int> > s; long long cnt = 0; for (int i = 0; i < n; i++) { if (ch < c[i] % 100) { long long mn = (100 - c[i] % 100) * w[i]; if (s.begin() != s.end() && s.begin()->first < mn) { cnt += s.begin()->first; ch += 100; ch -= c[i] % 100; s.erase(s.begin()); s.insert(make_pair((100 - c[i] % 100) * w[i], i)); } else { ch += 100 - c[i] % 100; cnt += mn; } } else { if (c[i] % 100 != 0) { s.insert(make_pair((100 - c[i] % 100) * w[i], i)); ch -= c[i] % 100; } } } cout << cnt << endl; vector<bool> p(n, 0); for (set<pair<long long, int> >::iterator it = s.begin(); it != s.end(); it++) { p[it->second] = 1; } for (int i = 0; i < n; i++) { if (p[i]) { cout << c[i] / 100 << << c[i] % 100 << endl; } else { cout << (c[i] + 99) / 100 << 0 << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> p[100]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> p[i].first; p[i].second = i + 1; } sort(p, p + n); for (int i = 0; i < n; i++) cout << p[i].second << ; }
#include <bits/stdc++.h> int main() { int ans = 0; int count; scanf( %d , &count); for (int i = 0; i < count; i++) { int prize; scanf( %d , &prize); int minTimeToPrize = std::min(prize - 1, 1000000 - prize); ans = std::max(ans, minTimeToPrize); } printf( %d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; struct Point { int x, y; void read() { int a, b; scanf( %d%d , &a, &b); x = a + b; y = a - b; } bool operator<(const Point p) const { return x != p.x ? x < p.x : y < p.y; } } p[N]; int n; int pre_min[N], pre_max[N]; int suf_min[N], suf_max[N]; bool check(long long mid) { for (int l = 1, r = 1; r <= n; r++) { while (p[r].x - p[l].x > mid && l <= n) l++; int mx = max(pre_max[l - 1], suf_max[r + 1]); int mn = min(pre_min[l - 1], suf_min[r + 1]); if (mx - mn <= mid) return true; } return false; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) p[i].read(); sort(p + 1, p + 1 + n); pre_min[0] = INT_MAX; pre_max[0] = INT_MIN; suf_min[n + 1] = INT_MAX; suf_max[n + 1] = INT_MIN; for (int i = 1; i <= n; i++) { pre_max[i] = max(pre_max[i - 1], p[i].y); pre_min[i] = min(pre_min[i - 1], p[i].y); } for (int i = n; i >= 1; i--) { suf_max[i] = max(suf_max[i + 1], p[i].y); suf_min[i] = min(suf_min[i + 1], p[i].y); } long long ans, low = 0, high = 1LL << 50, mid; while (low <= high) { mid = (low + high) >> 1; if (check(mid)) high = mid - 1, ans = mid; else low = mid + 1; } printf( %.10f n , ans / 2.0); return 0; }
#include <bits/stdc++.h> using namespace std; const int NMax = 40, MMax = 200; int N, nn, A[NMax][NMax], B[NMax]; int get(int a, int b) { return (a ^ b); } int P(int a, int b) { if (b) return a * -1; else return a; } int main() { scanf( %d , &N); nn = (N + 1) >> 1; for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) scanf( %d , &A[i][j]); int ret = -100000000; for (int I = 0; I < (1 << nn); I++) { int cnt = 0; int k = I; for (int i = 1; i <= nn; i++) { B[i] = (I & 1); cnt += P(A[i][nn], B[i]); I >>= 1; } I = k; for (int i = 1; i < nn; i++) cnt += P(A[i + nn][nn], get(B[i], B[nn])); for (int i = 1; i < nn; i++) { int tot0 = P(A[nn][i], 0) + P(A[nn][nn + i], get(0, B[nn])), tot1 = P(A[nn][i], 1) + P(A[nn][nn + i], get(1, B[nn])); for (int j = 1; j < nn; j++) { int maxx = -100000000; for (int first = 0; first < 2; first++) { int second = 0; int x1 = get(first, B[j]), x2 = get(second, B[nn]), x3 = get(B[j], B[nn]), x4 = get(first, second), x5 = get(x1, x2); if (get(x3, x4) == x5) maxx = max(maxx, P(A[j][i], first) + P(A[j][nn + i], x1) + P(A[nn + j][i], x4) + P(A[nn + j][nn + i], x5)); } if (maxx != -100000000) tot0 += maxx; else tot0 = -100000000; } for (int j = 1; j < nn; j++) { int maxx = -100000000; for (int first = 0; first < 2; first++) { int second = 1; int x1 = get(first, B[j]), x2 = get(second, B[nn]), x3 = get(B[j], B[nn]), x4 = get(first, second), x5 = get(x1, x2); if (get(x3, x4) == x5) maxx = max(maxx, P(A[j][i], first) + P(A[j][nn + i], x1) + P(A[nn + j][i], x4) + P(A[nn + j][nn + i], x5)); } if (maxx != -100000000) tot1 += maxx; else tot1 = -100000000; } cnt += max(tot0, tot1); } ret = max(ret, cnt); } printf( %d n , ret); return 0; }
#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long a, b, c, d; cin >> a >> b >> c >> d; long long s1 = a + b; long long s2 = c + d; if (s1 > s2) cout << s1 << endl; else cout << s2 << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, i, flag = 0, j; cin >> n; while (n--) { int x; cin >> x; flag = 0; for (i = 0; i <= 33; i++) { for (j = 0; j <= 14; j++) { if (i * 3 + j * 7 == x) { cout << YES << endl; flag = 1; break; } } if (flag == 1) break; } if (flag == 0) cout << NO << endl; } }
#include <bits/stdc++.h> using namespace std; int N; bool valid(int P, int d, vector<int> guess) { if (P >= N) { return true; } if (P == 0) { if (valid(P + 1, d, guess)) return true; guess[P] -= d; if (valid(P + 1, d, guess)) return true; guess[P] += d; guess[P] += d; if (valid(P + 1, d, guess)) return true; guess[P] -= d; } else { if (guess[P] == guess[P - 1]) { if (valid(P + 1, d, guess)) return true; } else if ((guess[P] - d) == guess[P - 1]) { guess[P] -= d; if (valid(P + 1, d, guess)) return true; guess[P] += d; } else if ((guess[P] + d) == guess[P - 1]) { guess[P] += d; if (valid(P + 1, d, guess)) return true; guess[P] -= d; } } return false; } int main() { cin >> N; vector<int> V(N); for (int i = 0; i < N; i++) cin >> V[i]; for (int d = 0; d <= 100; d++) { if (valid(0, d, V)) { cout << d << n ; return 0; } } cout << -1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; signed main() { int64_t n; cin >> n; int64_t a[n]; for (int64_t i = 0; i < n; i++) cin >> a[i]; map<int64_t, int64_t> first; map<int64_t, int64_t> second; first[a[0]] = 1; int64_t sum = 0; for (int64_t i = 0; i < n; i++) sum += a[i]; for (int64_t i = 1; i < n; i++) second[a[i]]++; int64_t cur = 0; if (sum % 2) { cout << NO n ; return 0; } int64_t tar = sum / 2; for (int64_t i = 0; i < n; i++) { cur += a[i]; if (cur == tar) { cout << YES n ; return 0; } if (cur > tar) { int64_t x = cur - tar; if (first[x] > 0) { cout << YES n ; return 0; } } if (cur < tar) { int64_t x = tar - cur; if (second[x] > 0) { cout << YES n ; return 0; } } first[a[i + 1]]++; second[a[i + 1]]--; } cout << NO n ; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int n, m, q; int a[1110][810]; char s[1100]; int ni[5] = {0, 1, 3, 2, 4}; long long pow_mod(long long a, long long e) { long long res = 1; for (; e; a = a * a % mod, e >>= 1) if (e & 1) res = res * a % mod; return res; } int frnum; const int BASE = 5; int wr[1100]; void gauss() { for (int i = 1; i <= n; i++) { int flag = 0; for (int j = i; j <= m; j++) if (a[j][i]) { for (int k = 1; k <= n + q; k++) swap(a[j][k], a[i][k]); flag = 1; break; } if (flag == 0) { m++; for (int j = 1; j <= n + q; j++) a[m][j] = a[i][j], a[i][j] = 0; continue; } for (int j = i + 1; j <= n + q; j++) a[i][j] = (a[i][j] * ni[a[i][i]]) % BASE; a[i][i] = 1; for (int j = 1; j <= m; j++) if (a[j][i] && j != i) { for (int k = 1; k <= n + q; k++) if (k != i) a[j][k] = (a[j][k] + 5 - (a[j][i] * a[i][k]) % BASE) % BASE; a[j][i] = 0; } } for (int i = 1; i <= n; i++) if (a[i][i] == 0) frnum++; for (int i = 1; i <= m; i++) { int ff = 0; for (int j = 1; j <= n; j++) if (a[i][j]) ff = 1; if (ff) continue; for (int j = n + 1; j <= n + q; j++) if (a[i][j]) wr[j - n] = 1; } } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) a[j][i] = s[j] - a ; } scanf( %d , &q); for (int i = 1; i <= q; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) a[j][i + n] = s[j] - a ; } gauss(); for (int i = 1; i <= q; i++) { if (wr[i]) cout << 0 << endl; else cout << pow_mod(5, frnum) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, a; cin >> n >> a; map<int, int> my; set<int> rem; int ca = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x == a) { ++ca; } else { if (rem.find(x) != rem.end()) continue; my[x]++; if (my[x] <= ca) { my.erase(x); rem.insert(x); } } } if (my.empty()) { cout << -1 n ; return 0; } else { for (auto it : my) { if (it.second >= ca) { cout << it.first << n ; return 0; } } } cout << -1 n ; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int64_t n, l, d; cin >> n >> d >> l; int a[25001]; for (int i = 1; i <= n; i++) { if (d > 0) { a[i] = l; } else { a[i] = 1; } d = a[i] - d; } a[n] = a[n] - d; if (a[n] <= 0 \|\| a[n] > l) { cout << -1; } else { for (int i = 1; i <= n; i++) { cout << a[i] << ; } } return 0; }
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 \|\| c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + c - 0 ; c = getchar(); } return f ? -ret : ret; } using namespace std; int k, p; long long int l, r; int mypow(int a, long long int b, int mod) { int ret = 1; for (; b; b >>= 1, a = (long long int)a * a % mod) if (b & 1) ret = (long long int)ret * a % mod; return ret; } int work() { k = getint(); l = getint(), r = getint(); p = getint(); if (p == 2) return (k & 1) ? 0 : 1; if (k % p == 0) return k & 1 ? mypow(mypow(2, p - 2, p), r - l, p) : 1; int t = mypow(2, l, p - 1), ans; t = mypow(k, t, p); if ((t - 1) % p == 0) ans = mypow(2, r - l + 1, p); else { int c = mypow(2, r - l + 1, p - 1); c = mypow(t, c, p); ans = (long long int)(c + p - 1) * mypow(t + p - 1, p - 2, p) % p; } if (k & 1) ans = (long long int)ans * mypow(mypow(2, p - 2, p), r - l, p) % p; return ans; } int main() { int T = getint(); while (T--) printf( %d n , work()); }
#include <bits/stdc++.h> using namespace std; long long valor[100456], solapacion[100456][320], posheavy[100456], resp[100456], arrupd[100456]; vector<long long> v[100456], colaheavy; bool light[100456], existe[100456]; void init() { for (int i = 0; i < 100456; ++i) { existe[i] = false; } } void solape(long long m) { long long auxcontador = 0; for (int i = 0; i < colaheavy.size(); ++i) { for (int j = 0; j < v[colaheavy[i]].size(); j++) { existe[v[colaheavy[i]][j]] = true; } for (int j = 0; j < m; j++) { auxcontador = 0; for (int k = 0; k < v[j].size(); k++) { if (existe[v[j][k]] == true) { auxcontador++; } } if (colaheavy[i] == j) auxcontador = 0; solapacion[j][i] = auxcontador; } for (int j = 0; j < v[colaheavy[i]].size(); j++) { existe[v[colaheavy[i]][j]] = false; } } } void updatelight(long long pos, long long val) { pos--; for (int i = 0; i < v[pos].size(); ++i) { valor[v[pos][i]] += val; } for (int i = 0; i < colaheavy.size(); ++i) { resp[colaheavy[i]] += (solapacion[pos][i]) * val; } } void updateheavy(long long pos, long long num) { pos--; resp[pos] += v[pos].size() * num; arrupd[pos] += num; } void querylight(long long num) { long long tot = 0; for (int i = 0; i < v[num].size(); ++i) { tot += valor[v[num][i]]; } for (int i = 0; i < colaheavy.size(); ++i) { tot += solapacion[num][i] * arrupd[colaheavy[i]]; } cout << tot << endl; } void queryheavy(long long num) { long long tot = resp[num]; for (int i = 0; i < colaheavy.size(); ++i) { tot += solapacion[num][i] * arrupd[colaheavy[i]]; } cout << tot << endl; } int main() { long long n, m, queries, aux, aux2, val, num; ios_base::sync_with_stdio(false); cin.tie(0); string txt; cin >> n >> m >> queries; init(); for (int i = 0; i < n; ++i) { cin >> valor[i]; } for (int i = 0; i < m; ++i) { cin >> aux; light[i] = true; if (aux >= sqrt(100456)) { posheavy[i] = colaheavy.size(); colaheavy.push_back(i); light[i] = false; } resp[i] = 0; for (int j = 0; j < aux; j++) { cin >> aux2; aux2--; resp[i] += valor[aux2]; v[i].push_back(aux2); } } solape(m); for (int i = 0; i < queries; ++i) { cin >> txt; if (txt[0] == ? ) { cin >> val; val--; if (light[val] == true) { querylight(val); } else { queryheavy(val); } } else { cin >> num >> val; if (light[num - 1] == true) { updatelight(num, val); } else { updateheavy(num, val); } } } }
#include <bits/stdc++.h> using namespace std; const int maxn = 201; int a[maxn], N, L, K; double f[maxn][maxn][maxn * 2], p[maxn]; int main() { scanf( %d%d%d , &N, &L, &K); for (int i = 0; i < N; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 0; i < N; ++i) scanf( %d , &a[i]); f[0][0][N + min(N, K)] = 1; for (int i = 0; i < N; ++i) for (int j = 0; j <= N; ++j) for (int k = -N; k <= N; ++k) if (f[i][j][N + k] > 0) { f[i + 1][j + 1][N + min(k + a[i], N)] += p[i] * f[i][j][N + k]; f[i + 1][j][N + k] += (1 - p[i]) * f[i][j][N + k]; } double ans = 0; for (int j = L; j <= N; ++j) for (int k = N; k <= N + N; ++k) ans += f[N][j][k]; cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; set<int> s[100005]; int color[100005]; int main() { int n, m; while (~scanf( %d%d , &n, &m)) { int i, j, tmp = 0; int u, v, ans; for (i = 1; i <= n; i++) scanf( %d , &color[i]); for (j = 0; j < m; j++) { scanf( %d%d , &u, &v); if (color[u] != color[v]) { s[color[v]].insert(color[u]); s[color[u]].insert(color[v]); } } ans = color[1]; for (i = 1; i <= n; i++) { if (s[color[i]].size() > tmp \|\| (s[color[i]].size() == tmp && color[i] < ans)) { tmp = s[color[i]].size(); ans = color[i]; } } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const long long INF = 0x3f3f3f3f3f3f3f3f; const long long llinf = (1LL << 61); const int inf = (1 << 30); const int nmax = 4e5 + 50; const int mod = 1e9 + 7; using namespace std; string s; long long n, a[nmax], st[4 * nmax], i, lzy[4 * nmax], x, q, st1[4 * nmax], ms[4 * nmax], msk[nmax], m, ans, j, inv[100], l, r, sv[500], x1; long long pr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; long long pw(long long n, long long p) { long long tmp = n, ans = 1, mx; if (p == mod - 2) mx = 31; else mx = 18; for (int i = 0; i <= mx; i++) { if (p & (1LL << i)) ans = (ans * tmp) % mod; tmp = (tmp * tmp) % mod; } return ans; } void build(int x, int l, int r) { if (l == r) { st[x] = a[l]; st1[x] = msk[l]; return; } int mid = (l + r) / 2; build(2 * x, l, mid); build(2 * x + 1, mid + 1, r); st[x] = st[2 * x] * st[2 * x + 1]; st[x] %= mod; st1[x] = st1[2 * x] \| st1[2 * x + 1]; } void push(int nod, int l, int r) { if (!lzy[nod]) return; if (lzy[nod] != 1) st[nod] = (st[nod] * pw(lzy[nod], r - l + 1)) % mod; st1[nod] \|= ms[nod]; if (l != r) { if (lzy[nod] != 1) { lzy[nod * 2] = lzy[nod]; lzy[nod 2 + 1] = lzy[nod]; lzy[nod 2] %= mod; lzy[nod * 2 + 1] %= mod; } ms[nod * 2] \|= ms[nod]; ms[nod * 2 + 1] \|= ms[nod]; } lzy[nod] = 1; } void upd(int nod, int l, int r, int tl, int tr, long long v, long long m) { push(nod, l, r); if (tl <= l && r <= tr) { lzy[nod] = (lzy[nod] * v) % mod; ms[nod] \|= m; push(nod, l, r); return; } int mid = (l + r) / 2; if (tl <= mid) upd(nod * 2, l, mid, tl, tr, v, m); if (mid < tr) upd(nod * 2 + 1, mid + 1, r, tl, tr, v, m); push(nod * 2, l, mid); push(nod * 2 + 1, mid + 1, r); st[nod] = st[nod * 2] * st[nod * 2 + 1]; st[nod] %= mod; st1[nod] = st1[nod * 2] \| st1[nod * 2 + 1]; } pair<long long, long long> qry(int nod, int l, int r, int tl, int tr) { push(nod, l, r); if (tl <= l && r <= tr) return {st[nod], st1[nod]}; int mid = (l + r) / 2; pair<long long, long long> vl, x; vl.first = 1, vl.second = 0; if (tl <= mid) { x = qry(nod * 2, l, mid, tl, tr); vl.first = (vl.first * x.first) % mod; vl.second \|= x.second; } if (mid < tr) { x = qry(nod * 2 + 1, mid + 1, r, tl, tr); vl.first = (vl.first * x.first) % mod; vl.second \|= x.second; } return vl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr.tie(0); cout.tie(0); cin >> n >> q; for (j = 0; j < 62; j++) { inv[j] = pw(pr[j], mod - 2); sv[pr[j]] = j; } for (i = 1; i <= n; i++) { cin >> a[i]; for (j = 0; j < 62; j++) if (a[i] % pr[j] == 0) msk[i] \|= (1LL << j); } for (i = 1; i <= 1600000; i++) lzy[i] = 1; build(1, 1, n); while (q--) { cin >> s; if (s[0] == M ) { cin >> l >> r >> x; x1 = x, m = 0; for (j = 0; j < 62; j++) if (x % pr[j] == 0) m \|= (1LL << j); upd(1, 1, n, l, r, x, m); } else { cin >> l >> r; pair<long long, long long> p = qry(1, 1, n, l, r); ans = p.first; for (j = 0; j < 62; j++) { if (p.second & (1LL << j)) { ans = (ans * (1 - inv[j] + mod)) % mod; } } cout << ans << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, l; long long dp[250005]; short big_arr[250005], small_arr[5001]; long long pre[51], sum[51], suf[51], mx[51], maxx = -1e5; long long solve(int indx, long long curSum) { if (indx == m + 1) return -2000; short &i = big_arr[indx]; long long &res = dp[indx]; if (~res) return res; res = pre[i]; if (curSum + sum[i] >= suf[i] && curSum + sum[i] > 0) res = max(res, solve(indx + 1, curSum + sum[i]) + sum[i]); else if (suf[i] > 0) res = max(res, solve(indx + 1, suf[i]) + suf[i] - curSum); else res = max(res, solve(indx + 1, 0) - curSum); return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cin >> n >> m; fill(pre, pre + 51, -1e5); fill(suf, suf + 51, -1e5); fill(mx, mx + 51, -1e5); fill(dp, dp + 250005, -1); for (int i = 0; i < n; i++) { cin >> l; long long tmp = 0; for (int j = 0; j < l; j++) { cin >> small_arr[j]; mx[i] = max((long long)small_arr[j], mx[i]); if (tmp < 0) tmp = 0; tmp += small_arr[j]; mx[i] = max(mx[i], tmp); sum[i] += small_arr[j]; pre[i] = max(pre[i], sum[i]); } tmp = 0; for (int j = l - 1; j >= 0; j--) { tmp += small_arr[j]; suf[i] = max(suf[i], tmp); } } for (int i = 1; i <= m; i++) { cin >> big_arr[i]; big_arr[i]--; maxx = max(mx[big_arr[i]], maxx); } cout << max(solve(1, 0), maxx) << endl; }
#include <bits/stdc++.h> using namespace std; const int mod = 9901; template <class T> int countbit(T n) { int t = 0; while (n) n &= n - 1, ++t; return t; } template <class T> T lowbit(T n) { return n & (-n); } const double eps = 1e-8; const double pi = acos(-1.0); const int INF = 0x7f7f7f7f; const int maxn = 111111; void File() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } long long c[66][66]; long long go(long long n, long long t) { int cnt = 0; long long tt = t; while (tt) tt >>= 1, ++cnt; int arr[65]; int i, size = 0; while (n) arr[size++] = n & 1, n >>= 1; reverse(arr, arr + size); long long ans = 0; bool flag; int ct = count(arr, arr + size, 1); for (i = 0; i < size; ++i) { flag = true; if (arr[i]) { if (size - i == ct && ct == cnt && cnt) ans++, flag = false; else { if (cnt >= 0) ans += c[size - i - 1][cnt], --cnt; } --ct; } if (i && !cnt) { ans++; break; } if (!flag) break; } if (t == 1) ans--; return ans; } int main() { ios::sync_with_stdio(false); int i, j; for (i = 0; i < 66; ++i) { c[i][i] = c[i][0] = 1; } for (i = 1; i < 66; ++i) { for (j = 1; j < i; ++j) { c[i][j] = c[i - 1][j - 1] + c[i - 1][j]; } } long long n, t; cin >> n >> t; int k = countbit(t); if (k == 1) cout << go(n + 1, t) << endl; else cout << 0 << endl; return 0; }
#include <bits/stdc++.h> struct Point { int x, y; Point* next; bool operator<(const Point& p) const { return 1ll * p.x * y < 1ll * x * p.y; } } P[200010], np = P; std::map<long long, Point> fir; std::map<Point, int> M; int main() { int q, s = 0; scanf( %d , &q); while (q--) { int t, x, y; scanf( %d%d%d , &t, &x, &y); long long d = 1ll * x * x + 1ll * y * y; if (t == 1) { M[(Point){x, y}]++; for (Point* p = fir[d]; p; p = p->next) M[(Point){x + p->x, y + p->y}] += 2; np = (Point){x, y, fir[d]}; fir[d] = np++; s++; } if (t == 2) { M[(Point){x, y}]--; if (fir[d] && fir[d]->x == x && fir[d]->y == y) fir[d] = fir[d]->next; ; for (Point p = fir[d]; p; p = p->next) { if (p->next && p->next->x == x && p->next->y == y) p->next = p->next->next; ; M[(Point){x + p->x, y + p->y}] -= 2; } s--; } if (t == 3) printf( %d n , s - M[(Point){x, y}]); } }
#include <bits/stdc++.h> using namespace std; long long expo(long long x, long long n, long long m) { if (n == 0) return 1; else if (n % 2 == 0) return expo((x * x) % m, n / 2, m); else return (x * expo((x * x) % m, (n - 1) / 2, m)) % m; } string DtoB(int j) { string s = ; for (int i = 32; i >= 0; i--) { int k = j >> i; if (k & 1) s += 1 ; else s += 0 ; } return s; } void solve() { int n; cin >> n; int arr[n]; int s[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; s[i] = arr[i]; } sort(s, s + n); map<int, int> m; for (int i = 0; i < n; i++) m[s[i]] = i; vector<vector<int> > ans; int visit[n]; memset(visit, 0, sizeof(visit)); ; for (int i = 0; i < n; i++) { if (visit[i] == 0) { vector<int> p; for (int j = i; visit[j] == 0; j = m[arr[j]]) { p.push_back(j + 1); visit[j] = 1; } ans.push_back(p); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { cout << ans[i].size() << ; for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j] << ; cout << endl; } return; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:320000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T Abs(T n) { return ((n) < 0 ? -(n) : (n)); } template <class T> inline T Max(T x, T y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } template <class T> inline T Min(T x, T y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } template <class T> inline T Swap(T &a, T &b) { a = a ^ b; b = a ^ b; a = a ^ b; } template <class T> inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template <class T> inline T lcm(T a, T b) { return ((a) / gcd((a), (b)) * (b)); } template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); } struct an { int a; int d; bool operator<(const an &t) const { return d < t.d; } }; int main() { int i, j, k, n, a[200]; int miniind, maxiind, maxi, mini; while (scanf( %d , &n) != EOF) { maxi = 0; mini = 200; for (i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] > maxi) { maxi = a[i]; maxiind = i; } if (a[i] < mini) { mini = a[i]; miniind = i; } } printf( %d n , max(n - maxiind - 1, max(maxiind, max(n - miniind - 1, miniind)))); } return 0; }
#include <bits/stdc++.h> using namespace std; int Q, m, n, a[10001], c[100001], ans, f[5001][101], d[1001]; char b[500001][13]; void dfs(int x, int now, int zong, int he) { if (x > n) { if (zong <= 100) f[he][zong] += c[now]; return; } dfs(x + 1, now * 2 + 1, zong + (d[x] == 1 ? a[x] : 0), he); dfs(x + 1, now * 2, zong + (d[x] == 0 ? a[x] : 0), he); } int main() { int i, j, now, t, ha; char s[10001]; scanf( %d%d%d , &n, &m, &Q); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= m; i++) { now = 0; scanf( %s , b[i] + 1); for (j = 1; j <= n; j++) { now = now * 2; if (b[i][j] == 1 ) now++; } c[now]++; } for (i = 0; i < (1 << n); i++) { now = i; ha = 0; for (j = 1; j <= n; j++) { d[j] = now % 2; ha = ha * 2 + d[j]; now /= 2; } dfs(1, 0, 0, ha); } for (i = 0; i < (1 << n); i++) for (j = 1; j <= 100; j++) f[i][j] += f[i][j - 1]; while (Q--) { scanf( %s%d , s + 1, &t); now = 0; for (i = 1; i <= n; i++) now = now * 2 + (s[i] == 1 ); printf( %d n , f[now][t]); } }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long n, g, b; cin >> n >> g >> b; if (g >= b) { cout << n << endl; continue; } long long good_need = n / 2; if (n % 2 == 1) good_need += 1; good_need -= g; long long bad_poss = n / 2; long long periods = bad_poss / b; if (good_need - periods * g <= 0) { cout << n << endl; continue; } good_need -= periods * g; long long restperiods = good_need / g; long long rest = 0; if (good_need % g != 0) { rest = good_need % g + b; } cout << g + (periods + restperiods) * (g + b) + rest << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c, d; while (scanf( %d , &n) != EOF) { int j, x, y, flag = 0; for (int i = 1; i <= 4; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); a = min(a, b); b = min(c, d); if (a + b <= n) { x = a; y = n - x; j = i; flag = 1; } } if (flag) printf( %d %d %d n , j, x, y); else printf( -1 n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int c0, c1, c2, c3; cin >> c0 >> c1 >> c2 >> c3; if (c1 - c0 == c2 - c1 && c2 - c1 == c3 - c2) { cout << c3 + c1 - c0 << endl; } else if (c1 * c1 == c0 * c2 && c2 * c2 == c1 * c3 && !((c3 * c3) % c2)) { cout << c3 * c1 / c0 << endl; } else { cout << 42 << endl; } }
#include <bits/stdc++.h> using namespace std; int w[1501000], cnt[1501000]; int main() { int N, i; int po, ans; scanf( %d , &N); for (int i = (0); i < (N); i++) scanf( %d , w + i); sort(w, w + N); memset(cnt, 0, sizeof(cnt)); for (int i = (0); i < (N); i++) cnt[w[i]]++; po = 0; ans = 0; for (int po = (0); po < (1501000); po++) { if (cnt[po] == 0) continue; cnt[po + 1] += cnt[po] / 2; if (cnt[po] % 2) ans++; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int a[510][510]; int d[1010][510]; int d2[1010][510]; int x, y, nr[1010], nr2[1010]; int n, m, i, j, ok; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 1; i <= n; i++) { x = i; y = 1; nr[i] = 0; while (x > 0 && y <= m) { d[i][++nr[i]] = a[x][y]; x--; y++; } sort(d[i] + 1, d[i] + nr[i] + 1); } for (i = 2; i <= m; i++) { x = n; y = i; nr[i + n - 1] = 0; while (x > 0 && y <= m) { d[i + n - 1][++nr[i + n - 1]] = a[x][y]; x--; y++; } sort(d[i + n - 1] + 1, d[i + n - 1] + nr[i + n - 1] + 1); } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 1; i <= n; i++) { x = i; y = 1; nr2[i] = 0; while (x > 0 && y <= m) { d2[i][++nr2[i]] = a[x][y]; x--; y++; } sort(d2[i] + 1, d2[i] + nr2[i] + 1); } for (i = 2; i <= m; i++) { x = n; y = i; nr2[i + n - 1] = 0; while (x > 0 && y <= m) { d2[i + n - 1][++nr2[i + n - 1]] = a[x][y]; x--; y++; } sort(d2[i + n - 1] + 1, d2[i + n - 1] + nr2[i + n - 1] + 1); } ok = 1; for (i = 1; i <= n + m - 1 && ok; i++) { for (j = 1; j <= nr[i] && ok; j++) if (d[i][j] != d2[i][j]) ok = 0; } if (ok) printf( YES ); else printf( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; int h, m, n, vn; map<int, pair<int, int> > M; int group[222222], pos[222222], host[222222]; vector<int> v[222222], first[222222]; inline void add(int i, int x, int d) { int m = first[i].size(); while (x < m) { first[i][x] += d; x = x \| (x + 1); } } inline int sum(int i, int x) { int m = first[i].size(), res = 0; while (x >= 0) { res += first[i][x]; x = (x & (x + 1)) - 1; } return res; } int main() { memset(host, -1, sizeof(host)); scanf( %d%d%d n , &h, &m, &n); memset(group, -1, sizeof(group)); for (int i = 0; i < h; ++i) if (group[i] == -1) { for (int j = i; group[j] == -1; j = (j + m) % h) { pos[j] = v[vn].size(); group[j] = vn; v[vn].push_back(j); } ++vn; } for (int i = 0; i < vn; ++i) { first[i].resize(int(v[i].size())); for (int j = 0; j < v[i].size(); ++j) add(i, j, 1); } long long res = 0; for (int i = 0; i < n; ++i) { char ch; int id, hash; scanf( %c %d , &ch, &id); if (ch == + ) { scanf( %d , &hash); int j = group[hash]; int k = pos[hash]; int l = k - 1, r = v[j].size(); int base = sum(j, k - 1); while (r - l > 1) { int mid = (l + r) / 2; if (sum(j, mid) > base) r = mid; else l = mid; } if (r < v[j].size()) { M[id] = make_pair(j, r); add(j, r, -1); res += r - k; } else { l = -1, r = k; while (r - l > 1) { int mid = (l + r) / 2; if (sum(j, mid) > 0) r = mid; else l = mid; } M[id] = make_pair(j, r); add(j, r, -1); res += v[j].size() - k + r; } } else if (ch == - ) { int j = M[id].first; int k = M[id].second; add(j, k, 1); } scanf( n ); } cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, Max, reg; int TIME = 0; vector<int> T, W; bool used[1010]; int p[1010], dmg[1010]; int main() { int i, j, k, l, x, y; cin >> n >> Max >> reg; for (i = 0; i < n; ++i) cin >> p[i] >> dmg[i]; int ch = Max, cd = 0; while (1) { ch -= cd; ch = min(Max, ch + reg); if (ch <= 0) break; j = -1; for (i = 0; i < n; ++i) { if (used[i] \|\| p[i] * Max < 100 * ch) continue; if (j == -1 \|\| dmg[j] < dmg[i]) j = i; } if (j != -1 && dmg[j] >= 0) { if (dmg[j] > cd \|\| true) { T.push_back(TIME); W.push_back(j + 1); used[j] = true; cd += dmg[j]; } } ++TIME; if (TIME >= 10000) break; } if (ch > 0) cout << NO n ; else { cout << YES n ; cout << TIME << << T.size() << endl; for (i = 0; i < T.size(); ++i) cout << T[i] << << W[i] << endl; } return 0; }
#include <bits/stdc++.h> const int maxn = 1e5 + 10; const int N = 2e5; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qmul(long long p, long long q, long long mo) { long long f = 0; while (q) { if (q & 1) f = (f + p) % mo; p = (p + p) % mo; q >>= 1; } return f; } long long qpow(long long p, long long q) { long long f = 1; while (q) { if (q & 1) f = f * p % 19260817; p = p * p % 19260817; q >>= 1; } return f; } int n, m, k, t; int main() { int i, j; scanf( %d , &n); for (i = n;; i--) { if (n % i) continue; j = i; int cnta = 0, cntb = 0; while (j && j % 2 == 0) cnta++, j /= 2; while (j && j % 2 == 1) cntb++, j /= 2; if (!j && cntb == cnta + 1) return 0 * printf( %d n , i); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 65; long long S, L, ans; long long P[N] = {1}; long long f[N][N * 2][2]; int main() { scanf( %lld , &S); L = log2(S + 1); for (int i = 1; i < N; ++i) P[i] = P[i - 1] << 1; for (int h = 1; h <= L; ++h) { long long x = S % (P[h] - 1); for (int i = h; i; --i) if (x >= P[i] - 1) x -= P[i] - 1; ans += (!x); } for (int h0 = 1; h0 < L; ++h0) for (int h1 = 1; S + 1 - P[h1] >= P[h0 + 1] + P[h1 + 1] - 3; ++h1) { long long x = (S + 1 - P[h1]) / (P[h0 + 1] + P[h1 + 1] - 3); long long r = (S + 1 - P[h1]) % (P[h0 + 1] + P[h1 + 1] - 3); if (!r) { ans++; continue; } if (h0 == 1 && h1 == 1) { ans += (S == x * 5 + 1); continue; } for (int n = 1; n <= h0 + h1; ++n) { long long C = r + n, L = log2(C) + 1; if (C & 1) continue; memset(f[0], 0, sizeof f[0]); f[0][0][0] = 1; for (int i = 1; i <= L; ++i) { int d = (C >> i) & 1; memset(f[i], 0, sizeof f[i]); for (int j = 0; j <= i + i - 2 && j <= n; ++j) for (int k = 0; k < 2; ++k) if (f[i - 1][j][k]) for (int x = 0; x < 2; ++x) if (!x \|\| i < h0) for (int y = 0; y < 2; ++y) if (!y \|\| i < h1) if (((k + x + y) & 1) == d) f[i][j + x + y][(k + x + y) >> 1] += f[i - 1][j][k]; } ans += f[L][n][0]; } } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n & 1) { cout << -1; return 0; } if (n < 3) { cout << bb nww n nbb nww ; return 0; } string s1, s2; for (int i = 0; i < 110; i++) s1 += (i % 4 < 2) ? w : b ; s2 = s1.substr(2); s1 = s1.substr(0, n); s2 = s2.substr(0, n); for (int i = 0; i < n; i++) { int x = i & 1; for (int j = 0; j < n; j++) { int y = (j % 4) < 2 ? 1 : 0; if (x ^ y) cout << s1 << n ; else cout << s2 << n ; } cout << n ; } }
#include <bits/stdc++.h> using namespace std; int a[4], i, j, s; int main() { for (i = 0; i < 4; i++) { scanf( %d , &a[i]); s += a[i]; } for (i = 0; i < 4; i++) { if (a[i] == s - a[i]) { puts( YES ); return 0; } for (j = i + 1; j < 4; j++) if (a[i] + a[j] == s - a[i] - a[j]) { puts( YES ); return 0; } } puts( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; static inline void amin(int &a, int b) { if (a > b) a = b; } int main() { int N, M; scanf( %d%d , &N, &M); int A[N]; for (int i = 0; i < N; ++i) { scanf( %d , &A[i]); } pair<int, int> Q[M]; for (int i = 0; i < M; ++i) { scanf( %d%d , &Q[i].first, &Q[i].second); Q[i].first--; Q[i].second--; } int res = max_element(A, A + N) - min_element(A, A + N); list<int> res_q; int changes[N]; for (int mx = 0; mx < N; ++mx) { list<int> q; memset(changes, 0, sizeof changes); for (int i = 0; i < M; ++i) if (mx < Q[i].first \|\| Q[i].second < mx) { q.push_back(i); for (int j = Q[i].first; j < Q[i].second + 1; ++j) changes[j]--; } int mn = numeric_limits<int>::max(); for (int i = 0; i < N; ++i) amin(mn, A[i] + changes[i]); if (res < A[mx] - mn) { res = A[mx] - mn; res_q = q; } } printf( %d n%d n , res, (int)res_q.size()); for (auto it : res_q) printf( %d , it + 1); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) template <class T, class U> istream &operator>>(istream &in, pair<T, U> &p) { in >> p.first >> p.second; return in; } template <class T, class U> ostream &operator<<(ostream &out, const pair<T, U> &p) { out << p.first << << p.second; return out; } template <class T> istream &operator>>(istream &in, vector<T> &v) { for (auto &i : v) { in >> i; } return in; } template <class T> ostream &operator<<(ostream &out, const vector<T> &v) { for (auto &i : v) { out << i << ; } return out; } inline void io(int x = 15) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); srand(time(0)); cout << fixed << setprecision(x); } vector<int> prefix_function(string s) { int n = s.length(); vector<int> pi(n); for (int i = 1; i < n; ++i) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) { j = pi[j - 1]; } if (s[i] == s[j]) ++j; pi[i] = j; } return pi; } bool prime_test(long long n) { for (long long i = 2; i * i <= n; ++i) if ((n >= 0 && n < 2) \|\| n % i == 0) return false; return true; } void prime_nums(int n, vector<char> &prime) { prime[0] = prime[1] = false; for (long long i = 2; i * i <= n; ++i) { if (prime[i]) { for (int j = i * i; j <= n; j += i) { prime[j] = false; } } } } long long bin_pow(long long a, long long b, long long m = 0) { if (m == 0) return b == 0 ? 1 : (b % 2 ? bin_pow(a, b - 1) * a : bin_pow(a * a, b / 2)); if (b == 0) return 1; long long temp = bin_pow(a, b / 2, m); if (b % 2 == 0) return (temp * temp) % m; else return (a * temp * temp) % m; } bool nextperm(vector<char> &a) { int n = a.size(); for (int i = n - 2; i >= 0; --i) { if (a[i] < a[i + 1]) { int mnv = a[i + 1], mni = i + 1; for (int j = i + 2; j < n; ++j) { if (a[j] < mnv && a[j] > a[i]) { mni = j; mnv = a[j]; } } swap(a[i], a[mni]); reverse(a.begin() + i + 1, a.end()); return true; } } return false; } int main() { io(); int n, s; cin >> n >> s; vector<int> used(n); for (int i = 0; i < n - 1; ++i) { int l, r; cin >> l >> r; ++used[--l]; ++used[--r]; } int x = 0; for (int i = 0; i < n; ++i) { if (used[i] == 1) { ++x; } } cout << (long double)s / x * 2; return 0; }
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n; long long len[1000005]; long long pai[1000005]; string s; long long find(long long x) { if (pai[x] == x) return x; return pai[x] = find(pai[x]); } void merge(long long a, long long b) { long long paiA = find(a), paiB = find(b); pai[paiB] = paiA; } int32_t main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0); cin >> n >> s; long long p = 0, b = 0; pai[0] = 0; for (long long i = 1; i <= n; i++) { pai[i] = i; if (s[i - 1] == 1 ) { p++; b = 0; } else if (s[i - 1] == 0 ) { b++; p = 0; } else { p++, b++; } len[i - 1] = max(p, b); } for (long long i = 1; i <= n; i++) { long long res = 0, pos = 0; while (pos < n) { pos += i - 1; while (pos < n and len[pos] < i) { merge(pos + 1, pos); pos = find(pos); } if (pos >= n) break; pos++; res++; } cout << res << ; } cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int const bound = 2e6 + 2, N = 5e5 + 2; long long OO = 1e18; double eps = 1e-6; int oo = 1e9, mod = oo + 7; pair<int, int> can[101]; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.first > b.first.first; return a.first.second < b.first.second; } int main() { int n, m, k, a; cin >> n >> k >> m >> a; for (int(i) = 0; (i) < (a); (i)++) { int g; cin >> g; g--; can[g].first++; can[g].second = i; } for (int(i) = 0; (i) < (n); (i)++) { pair<pair<int, int>, int> tmp[101]; for (int(j) = 0; (j) < (n); (j)++) tmp[j] = {can[j], j}; int sv = tmp[i].first.second; tmp[i].first.first += m - a; if (m - a) tmp[i].first.second = m; sort(tmp, tmp + n, cmp); bool no = 1; for (int(j) = 0; (j) < (k); (j)++) { if (tmp[j].first.first && tmp[j].second == i) { no = 0; break; } } if (no) { cout << 3 << ; continue; } int to = -1, rem = m - a; for (int(j) = 0; (j) < (n); (j)++) if (tmp[j].second == i) { tmp[j].first.first -= m - a; tmp[j].first.second = sv; } sort(tmp, tmp + n, cmp); for (int(j) = 0; (j) < (n); (j)++) { if (to != -1) { if (rem < to - tmp[j].first.first + 1) break; rem -= to - tmp[j].first.first + 1; tmp[j].first.first += to - tmp[j].first.first + 1; tmp[j].first.second = m; } if (tmp[j].second == i) to = tmp[j].first.first; } sort(tmp, tmp + n, cmp); no = 1; for (int(j) = 0; (j) < (k); (j)++) if (tmp[j].first.first && tmp[j].second == i) no = 0; if (no) cout << 2 << ; else cout << 1 << ; } return 0; }
#include <bits/stdc++.h> using namespace std; int z[26][200001], w[26]; int main() { int n, m, i, j, a, le; char str[200001]; scanf( %d %d , &n, &m); scanf( %s , str); for (i = 0; str[i]; i++) { z[str[i] - a ][w[str[i] - a ]] = i; w[str[i] - a ]++; } long long ans; int mi; while (n) { n--; ans = 0; scanf( %s , str); le = strlen(str); for (i = 0; str[i]; i++) { a = str[i] - a ; if (w[a] == 0) ans += le; else { mi = abs(i - z[a][0]); ; for (j = 1; j < w[a]; j++) { mi = min(mi, abs(i - z[a][j])); } ans += mi; } } printf( %lld n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 + 100; const long double eps = 1e-11; const long double pi = acos(-1.0L); int myrand() { return rand(); } unsigned rdtsc() { unsigned ans; asm( rdtsc : =a (ans)); return ans; } int rnd(int x) { return myrand() % x; } void precalc() {} int n, k; int a, b, c, d; bool read() { if (scanf( %d%d , &n, &k) < 2) { return false; } scanf( %d%d%d%d , &a, &b, &c, &d); return true; } void solve() { if (n <= 4 \|\| k < n + 1) { printf( -1 n ); return; } vector<int> path; for (int i = 1; i <= n; i++) { if (i != a && i != b && i != c && i != d) { path.push_back(i); } } printf( %d %d , a, c); for (int i = 0; i < ((int)((path).size())); i++) { printf( %d , path[i]); } printf( %d %d n , d, b); printf( %d %d , c, a); for (int i = 0; i < ((int)((path).size())); i++) { printf( %d , path[i]); } printf( %d %d n , b, d); } int main() { srand(rdtsc()); precalc(); while (true) { if (!read()) { break; } solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; cout << a[0]; for (int e = 1; e < a.size(); e++) if (a[e] < b[0]) cout << a[e]; else break; cout << b[0] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } map<int, int> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != j) { ++m[a[i] + a[j]]; } } } int Max = 0; for (auto it = m.begin(); it != m.end(); it++) { Max = max(it->second / 2, Max); } cout << Max; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, t; string In; vector<char> Que; cin >> n >> t >> In; for (char x : In) { Que.push_back(x); } for (int i = 0; i < t; i++) { for (int x = 0; x < n; x++) { if (Que[x] == B && Que[x + 1] == G ) { Que[x] = G ; Que[x + 1] = B ; x++; } } } for (char x : Que) { cout << x; } return 0; }
#include <bits/stdc++.h> using namespace std; const int SIZE = 100011; const int MAX = 1e9; int mi[SIZE << 2], a[SIZE]; void init(int L, int R, int id) { mi[id] = MAX; if (L == R) return; int mm = (L + R) >> 1; init(L, mm, id << 1); init(mm + 1, R, (id << 1) + 1); } void ins(int L, int R, int id, int x, int v) { if (L == R) { mi[id] = v; return; } int mm = (L + R) >> 1; if (x <= mm) ins(L, mm, id << 1, x, v); else ins(mm + 1, R, (id << 1) + 1, x, v); mi[id] = min(mi[id << 1], mi[(id << 1) \| 1]); } int qq(int L, int R, int id, int l1, int rr) { if (L >= l1 && R <= rr) return mi[id]; if (R < l1 \|\| L > rr) return MAX; int mm = (L + R) >> 1; return min(qq(L, mm, id << 1, l1, rr), qq(mm + 1, R, (id << 1) \| 1, l1, rr)); } int main() { int n, s, l; scanf( %d%d%d , &n, &s, &l); init(0, n, 1); ins(0, n, 1, 0, 0); multiset<int> H; int lt = 1, an; for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); a[i] = x; H.insert(x); while (H.rbegin() - H.begin() > s) { H.erase(H.find(a[lt++])); } if (i - lt + 1 >= l) { ins(0, n, 1, i, an = qq(0, n, 1, lt - 1, i - l) + 1); } else an = MAX; } if (an >= MAX) puts( -1 ); else printf( %d n , an); return 0; }
#include <bits/stdc++.h> using namespace std; int n, start, x; pair<int, int> ask(int v) { printf( ? %d n , v); fflush(stdout); int value, nxt; scanf( %d %d , &value, &nxt); return pair<int, int>(value, nxt); } const int RANDOM_Q = 1000; int main() { srand(time(NULL)); scanf( %d %d %d , &n, &start, &x); vector<int> v; for (int i = int(1); i < int(n + 1); i++) { v.push_back(i); } random_shuffle(v.begin(), v.end()); vector<int> randoms; for (int i = int(0); i < int(min(RANDOM_Q, (int)v.size())); i++) { randoms.push_back(v[i]); } int ans = (int)2e9; int possible_start = start, start_val = -1; for (auto &each : randoms) { pair<int, int> p = ask(each); if (p.first >= x && p.first < ans) { ans = p.first; } else if (p.first < x && p.first > start_val) { possible_start = p.second; start_val = p.first; } } int cur = possible_start; for (int i = 0; cur != -1 && i < 1999 - RANDOM_Q; i++) { pair<int, int> p = ask(cur); if (p.first >= x) { ans = p.first; break; } cur = p.second; } printf( ! %d n , ans == (int)2e9 ? -1 : ans); fflush(stdout); return 0; }
#include <bits/stdc++.h> using namespace std; int a[4][4], kk; bool ok; int main() { for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) scanf( %d , &a[i][j]); kk = max(a[0][1] + a[0][2], max(a[1][0] + a[1][2], a[2][0] + a[2][1])) + 100000; for (int i = a[0][1] + a[0][2] + 1; i <= kk; ++i) { a[0][0] = i - a[0][1] - a[0][2]; a[1][1] = i - a[1][0] - a[1][2]; a[2][2] = i - a[2][0] - a[2][1]; ok = true; for (int j = 0; j < 3 && ok; ++j) ok &= (a[0][j] + a[1][j] + a[2][j] == i); ok &= (a[0][0] + a[1][1] + a[2][2] == i && a[0][2] + a[1][1] + a[2][0] == i); if (ok) break; } for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) printf( %d , a[i][j]); printf( n ); } return 0; }
#include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; int t; cin>>t; while(t--) { ll n,x,s=0,a=1; cin>>n>>x; ll arr[n]; for(int i=0; i<n; i++) { cin>>arr[i]; } int mn=100000000,gg=mn,ind=-1; for(int i=0; i<n; i++) { int y=arr[i],cnt=0; while(!(y%x)) { y/=x; cnt++; } if(cnt<mn) { mn=cnt; ind=i; } } for(int i=0; i<n; i++) { if(i<ind) gg=mn+1; else gg=mn; s+=arr[i]; a=1; while(((arr[i]%x)==0)&&(gg--)) { a=x; arr[i]/=x; s+=aarr[i]; } } cout<<s<< n ; } }
#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; int c = 0; for (int j = 0; j < str.length(); j++) { if (str[j] == @ ) { c = c + 1; } } if (c == 0) { cout << No solution << endl; } else if (c > 0) { int c1 = 1; int i = 0; for (; i < str.length(); i++) { char ch = str[i]; if (ch == @ and (i == 0 or i == (str.length() - 1))) { break; } else if (ch == @ and (i > 0 and i < (str.length() - 1))) { char ch1 = str[i - 1]; char ch2 = str[i + 1]; if (ch1 == , or ch2 == , ) { break; } if (ch1 != , and ch2 != , and c1 != c) { string str1 = str.substr(0, i + 2); string str2 = str.substr(i + 2); str = str1 + , + str2; c1 = c1 + 1; } if (ch1 != , and ch2 != , and c1 == c) { continue; } } } if (i < str.length()) { cout << No solution << endl; } if (i >= str.length()) { cout << str << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) { v[i] = make_pair(h[i], i); } sort(v.begin(), v.end()); sort(h.begin(), h.end()); h.erase(unique(h.begin(), h.end()), h.end()); if (n - h.size() < 2) { cout << NO << endl; return 0; } else { cout << YES << endl; } map<int, int> x; for (int i = 0; i + 1 < n; i++) { if (v[i].first == v[i + 1].first) { x[v[i].first] += 1; } } int type = x.size(); for (int i = 0; i < 3; i++) { if (i == 0) { for (int j = 0; j < n; j++) { printf( %d , v[j].second + 1); } printf( n ); } else { if (type == 1) { vector<pair<int, int> >::iterator it = lower_bound(v.begin(), v.end(), make_pair(x.begin()->first, -1)); swap(v[it - v.begin()], v[it - v.begin() + i]); for (int j = 0; j < n; j++) { printf( %d , v[j].second + 1); } printf( n ); } else { vector<pair<int, int> >::iterator it = lower_bound(v.begin(), v.end(), make_pair(x.begin()->first, -1)); x.erase(x.begin()); swap(v[it - v.begin()], v[it - v.begin() + 1]); for (int j = 0; j < n; j++) { printf( %d , v[j].second + 1); } printf( n ); } } } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; int a[N]; int main() { long long ans = 0, ones = 0, k; string s; cin >> k >> s; a[0] = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) ones++, a[ones] = i; if (ones >= k) { if (k != 0) ans += a[ones - k + 1] - a[ones - k]; else if (s[i] == 0 ) ans += i - a[ones]; } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, p = 1e9 + 7; int n, cnt[26], inv[N], fac[N], finv[N]; char a[N], b[N]; inline int solve(char s) { int ans = 0, noans = fac[n]; memset(cnt, 0, sizeof cnt); for (int i = 1; i <= n; ++i) ++cnt[a[i] - a ]; for (int i = 0; i < 26; ++i) noans = 1ll noans * finv[cnt[i]] % p; for (int i = 1; i <= n; ++i) { int v = s[i] - a ; noans = 1ll * noans * inv[n - i + 1] % p; for (int c = 0; c < v; ++c) if (cnt[c]) { noans = 1ll * noans * cnt[c] % p; ans = (ans + noans) % p; noans = 1ll * noans * inv[cnt[c]] % p; } if (!cnt[v]) return ans; noans = 1ll * noans * cnt[v] % p; --cnt[v]; } return ans; } int main() { scanf( %s%s , a + 1, b + 1); n = strlen(a + 1); fac[0] = 1; for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % p; inv[0] = inv[1] = 1; for (int i = 2; i <= n; ++i) inv[i] = 1ll * inv[p % i] * (p - p / i) % p; finv[0] = 1; for (int i = 1; i <= n; ++i) finv[i] = 1ll * inv[i] * finv[i - 1] % p; printf( %d , (solve(b) - solve(a) - 1 + p) % p); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; vector<long long> vis(n); for (int i = 0, ggdem = m; i < ggdem; ++i) { long long a, b, c; cin >> a >> b >> c; a--; b--; c--; vis[b] = 1; } long long ve = -1; for (int i = 0, ggdem = n; i < ggdem; ++i) { if (vis[i] == 0) ve = i; } for (int i = 0, ggdem = n; i < ggdem; ++i) { if (i != ve) { cout << i + 1 << << ve + 1 << n ; } } } return 0; }
#include <bits/stdc++.h> int main() { unsigned long long int n, sum = 0, sum1 = 0, i, MAX = 0, temp; scanf( %llu , &n); int a[n]; for (i = 0; i < n; ++i) { scanf( %llu , &a[i]); } for (i = 0; i < n; ++i) { sum = sum + a[i]; } for (i = 0; i < n; ++i) { if (a[i] > MAX) { MAX = a[i]; } } for (i = 0; i < n; ++i) { if (a[i] == MAX) { break; } } temp = a[n - 1]; a[n - 1] = MAX; a[i] = temp; if (sum % 2 != 0) { printf( NO ); } else { for (i = 0; i < n - 1; ++i) { sum1 = sum1 + a[i]; } if (sum1 >= a[n - 1]) { printf( YES ); } else { printf( NO ); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, y; cin >> n >> x >> y; int a[n]; int c = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] <= x) c++; } if (x > y) cout << n << endl; else { if (c % 2 == 0) cout << c / 2 << endl; else cout << (c / 2) + 1 << endl; } }
#include <bits/stdc++.h> using namespace std; int block[101]; int nuclea[101]; int inst[101][101]; int main() { ios_base::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> inst[j][i]; } } for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (nuclea[j] == 0) block[inst[i][j]]++; } block[0] = 0; for (int j = 0; j < n; j++) { if (block[inst[i][j]] > 1 && nuclea[j] == 0) { nuclea[j] = i + 1; } } for (int i = 1; i < 101; i++) { if (block[i] < 2) block[i] = 0; } } for (int i = 0; i < n; i++) cout << nuclea[i] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3 * 100 * 1000 + 1000; const int N1 = 5100; long long A[N], n, k; unsigned long long dp[N1][N1]; void read() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> A[i]; sort(A, A + n); for (int i = 0; i < N1; i++) for (int j = 0; j < N1; j++) dp[i][j] = (1 << 31); } int cal(int p, int q) { return p * ((n + k - 1) / k) + q * (n / k) - 1; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); read(); int p = n % k, q = k - n % k; dp[0][0] = 0; for (int i = 0; i <= p; i++) for (int j = 0; j <= q; j++) { int last = cal(i, j); if (i - 1 >= 0) dp[i][j] = min(dp[i][j], dp[i - 1][j] + A[last] - A[last - (n + k - 1) / k + 1]); if (j - 1 >= 0) dp[i][j] = min(dp[i][j], dp[i][j - 1] + A[last] - A[last - (n / k) + 1]); } cout << dp[p][q] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-10; template <typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template <typename T> void operator>>(vector<T>& a, int b) { while (b--) if (!a.empty()) a.pop_back(); } bool isprime(int n) { if (n < 2) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } long long b_pow(long long x, long long n) { return n ? n == 1 ? x : b_pow(x, n >> 1) * b_pow(x, (n >> 1) + (n & 1)) : 1; } string itos(int n) { stringstream ss; ss << n; return ss.str(); } string table[119] = { - , H , He , Li , Be , B , C , N , O , F , Ne , Na , Mg , Al , Si , P , S , Cl , Ar , K , Ca , Sc , Ti , V , Cr , Mn , Fe , Co , Ni , Cu , Zn , Ga , Ge , As , Se , Br , Kr , Rb , Sr , Y , Zr , Nb , Mo , Tc , Ru , Rh , Pd , Ag , Cd , In , Sn , Sb , Te , I , Xe , Cs , Ba , La , Ce , Pr , Nd , Pm , Sm , Eu , Gd , Tb , Dy , Ho , Er , Tm , Yb , Lu , Hf , Ta , W , Re , Os , Ir , Pt , Au , Hg , Tl , Pb , Bi , Po , At , Rn , Fr , Ra , Ac , Th , Pa , U , Np , Pu , Am , Cm , Bk , Cf , Es , Fm , Md , No , Lr , Rf , Db , Sg , Bh , Hs , Mt , Ds , Rg , Cn , Uut , Uuq , Uup , Uuh , Uus , Uuo }; vector<int> item, goal, able[17]; int n, m; void output(int bit, int num) { vector<string> ans; for (int i = 0; i < n; i++) if (bit & (1 << i)) ans.push_back(table[item[i]]); for (int i = 0; i < ans.size(); i++) cout << (i ? + : ) << ans[i]; cout << -> << table[goal[num]] << endl; } vector<int> currentUsing; bool done[1 << 17][17]; bool dfs(int pos, int bit) { if (pos == m) { cout << YES << endl; for (int i = 0; i < pos; i++) output(currentUsing[i], i); return true; } if (done[bit][pos]) return false; else done[bit][pos] = 1; for (int i = 0; i < able[pos].size(); i++) { if (bit & able[pos][i]) continue; currentUsing.push_back(able[pos][i]); if (dfs(pos + 1, bit \| able[pos][i])) return true; currentUsing.pop_back(); } return false; } int main() { cin >> n >> m; string tmp; for (int i = 0; i < n; i++) cin >> tmp, item.push_back(find(table, table + 119, tmp) - table); for (int i = 0; i < m; i++) cin >> tmp, goal.push_back(find(table, table + 119, tmp) - table); for (int i = 0; i < m; i++) { for (int bit = 0; bit < (1 << n); bit++) { int sum = 0; for (int j = 0; j < n; j++) if (bit & (1 << j)) sum += item[j]; if (sum == goal[i]) able[i].push_back(bit); } } if (!dfs(0, 0)) cout << NO << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; const int mod = 998244353; int a[N], s[N], f[N][105], b[N][105]; inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; return; } template <typename T> inline void chkmax(T &x, T y) { x = max(x, y); } template <typename T> inline void chkmin(T &x, T y) { x = min(x, y); } template <typename T> inline void read(T &x) { T f = 1; x = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -f; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - 0 ; x *= f; } int main() { int n, k, len; read(n), read(k), read(len); if (len == 1) { printf( 0 n ); return 0; } s[0] = 1; for (int i = 1; i <= n; ++i) read(a[i]); for (int i = 1; i <= n; ++i) for (int j = 1; j <= k; ++j) if (a[i] == j \|\| a[i] == -1) b[i][j] = 1; for (int j = 1; j <= k; ++j) for (int i = 1; i <= n; ++i) b[i][j] += b[i - 1][j]; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= k; ++j) { if (~a[i] && a[i] != j) continue; f[i][j] = s[i - 1]; if (i >= len && b[i][j] - b[i - len][j] == len) add(f[i][j], (f[i - len][j] - s[i - len] + mod) % mod); add(s[i], f[i][j]); } } printf( %d n , s[n]); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; int head[N], Next[N], ver[N], tot; inline void add(int u, int v) { ver[++tot] = v, Next[tot] = head[u], head[u] = tot; } int pa[N][25], top[N], son[N], dep[N], ans, n, L; long long sum[N], w[N], S; inline void init(int u) { for (int i = 1; i <= 20; ++i) pa[u][i] = pa[pa[u][i - 1]][i - 1]; int dis = L, tmp = u; for (int i = 20; i >= 0; --i) { int fa = pa[tmp][i]; if (!fa \|\| (1 << i) >= dis) continue; if (sum[u] - sum[fa] + w[fa] > S) continue; dis -= (1 << i), top[u] = fa, tmp = fa; } } void dfs1(int u, int fa) { sum[u] = sum[fa] + w[u], top[u] = u, dep[u] = dep[fa] + 1, init(u); for (int i = head[u]; i; i = Next[i]) dfs1(ver[i], u); } void dfs2(int u) { int mx = -1; for (int i = head[u]; i; i = Next[i]) { int v = ver[i]; dfs2(v); if (son[v] == v) continue; if (mx == -1 \|\| dep[mx] > dep[son[v]]) mx = son[v]; } if (mx == -1) ++ans, mx = top[u]; son[u] = mx; } int main() { scanf( %d%d%lld , &n, &L, &S); for (int i = 1; i <= n; ++i) { scanf( %lld , &w[i]); if (w[i] > S) return puts( -1 ), 0; } for (int i = 2, f; i <= n; ++i) scanf( %d , &f), add(f, i), pa[i][0] = f; dfs1(1, 0), dfs2(1); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 9; vector<pair<int, int> > barr[N]; int n, q, arr[N], a, b; long long t[N], ans[N]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; scanf( %d , &q); int kok = sqrt(n); for (int i = 1; i <= q; i++) { scanf( %d %d , &a, &b); if (b > kok) { for (int j = a; j <= n; j += b) ans[i] += arr[j]; } else barr[b].push_back(make_pair(a, i)); } for (int i = 1; i <= kok; i++) { if (barr[i].size()) { for (int j = n; j >= 1; j--) t[j] = arr[j] + t[(i + j) * (i + j <= n)]; for (int j = 0; j < barr[i].size(); j++) ans[barr[i][j].second] = t[barr[i][j].first]; } } for (int i = 1; i <= q; i++) printf( %lld n , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxN = 5e5 + 5; int m, k, n, s; vector<int> a; int c[maxN], h[maxN]; int main(int argc, char *argv[]) { cin >> m >> k >> n >> s; a.resize(m + 1); for (int i = 1; i <= m; ++i) cin >> a[i]; int total = 0; for (int i = 0; i < s; ++i) { int x; cin >> x; c[x]++; if (c[x] == 1) total++; } int cur_s = 0; vector<int> ans; bool found = false; for (int l = 1, r = 1; l + k - 1 <= m; ++l) { while ((cur_s < total && r <= m) \|\| r - l + 1 <= k) { h[a[r]]++; if (h[a[r]] == c[a[r]]) cur_s++; r++; } if (cur_s == total && (l - 1) / k + (m - r + 1) / k + 1 >= n) { found = true; int to_remove = r - l - k; for (int i = l; to_remove > 0 && i < r; ++i) { if (h[a[i]] > c[a[i]]) { to_remove--; ans.emplace_back(i); h[a[i]]--; } } break; } if (h[a[l]] == c[a[l]]) cur_s--; h[a[l]]--; } if (found == false) cout << -1 << endl; else { cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) { if (i > 0) cout << ; cout << ans[i]; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long a; cin >> a; cout << (a + a / 2) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const char nl = n ; const long long mod = 1e9 + 7; long long bigmod(long long a, long long b) { if (b == 0) return 1; long long ans = bigmod(a, b / 2); ans = (ans * ans) % mod; if (b & 1) ans = a; return ans % mod; } void solve() { long long n; cin >> n; cout << (bigmod(4, pow(2, n) - 2) 6) % mod << nl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; while (t--) { solve(); } }

#include <bits/stdc++.h> using namespace std; int arr[10][10]; double me[10][10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n = 10; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> arr[i][j]; } } me[0][0] = 0.; me[0][1] = 6.; me[0][2] = 6.; me[0][3] = 6.; me[0][4] = 6.; me[0][5] = 6.; double fix = 1. / 6.; for (int i = 0; i < n; i++) { if (i % 2 == 0) { for (int j = (i == 0) ? 6 : 0; j < n; j++) { double best = 1e6; for (int k = 0; k <= (1 << 6) - 1; k++) { double summ = 1; for (int s = 0; s < 6; s++) { if (((k >> s) & 1) == 1) { int posx = (j - s - 1 >= 0) ? j - s - 1 : n - (((j - s - 1) % 10 + 10) % 10) - 1; int posy = (j - s - 1 >= 0 || i == 0) ? i : i - 1; summ += fix * me[posy - arr[posy][posx]][posx]; } else { int posx = (j - s - 1 >= 0) ? j - s - 1 : n - (((j - s - 1) % 10 + 10) % 10) - 1; int posy = (j - s - 1 >= 0 || i == 0) ? i : i - 1; summ += fix * me[posy][posx]; } } best = min(best, summ); } me[i][j] = best; } } else { for (int j = n - 1; j >= 0; j--) { double best = 1e6; for (int k = 0; k <= (1 << 6) - 1; k++) { double summ = 1; for (int s = 0; s < 6; s++) { if (((k >> s) & 1) == 1) { int posx = (j + s + 1 < n) ? j + s + 1 : n - ((j + s + 1) % 10 + 10) % 10 - 1; int posy = (j + s + 1 < n || i == 0) ? i : i - 1; summ += fix * me[posy - arr[posy][posx]][posx]; } else { int posx = (j + s + 1 < n) ? j + s + 1 : n - ((j + s + 1) % 10 + 10) % 10 - 1; int posy = (j + s + 1 < n || i == 0) ? i : i - 1; summ += fix * me[posy][posx]; } } best = min(best, summ); } me[i][j] = best; } } } cout.precision(9); cout << fixed << me[9][0]; }

#include <bits/stdc++.h> using namespace std; const int MX = 1000006; const long long inf = 1e18; long long n, m, p, a[MX], ca[MX], b[MX], cb[MX], mn[MX]; long long x[MX], y[MX], z[MX]; long long st[4 * MX + 20], lz[4 * MX + 20], res = -inf; vector<int> pos[MX]; void push(int i, int j, int pos) { if (i < j) { lz[pos * 2] += lz[pos]; lz[pos * 2 + 1] += lz[pos]; } st[pos] += lz[pos]; lz[pos] = 0; } void update(int i, int j, int pos, int a, int b, long long k) { if (lz[pos]) push(i, j, pos); if (j < a || b < i) return; if (a <= i && j <= b) { lz[pos] = k; push(i, j, pos); return; } int m = (i + j) / 2; update(i, m, pos * 2, a, b, k); update(m + 1, j, pos * 2 + 1, a, b, k); st[pos] = max(st[pos * 2], st[pos * 2 + 1]); } long long query(int i, int j, int pos, int a, int b) { if (lz[pos]) push(i, j, pos); if (j < a || b < i) return -inf; if (a <= i && j <= b) return st[pos]; int m = (i + j) / 2; return max(query(i, m, pos * 2, a, b), query(m + 1, j, pos * 2 + 1, a, b)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> p; fill(mn, mn + MX, inf); for (int i = 1; i <= n; i++) { cin >> a[i] >> ca[i]; mn[a[i]] = min(mn[a[i]], ca[i]); } for (int i = 1; i < MX; i++) update(1, MX - 1, 1, i, i, -mn[i]); fill(mn, mn + MX, inf); for (int i = 1; i <= m; i++) { cin >> b[i] >> cb[i]; mn[b[i]] = min(mn[b[i]], cb[i]); } for (int i = 1; i <= p; i++) { cin >> x[i] >> y[i] >> z[i]; pos[y[i]].push_back(i); } for (int i = 1; i < MX - 1; i++) { for (int j : pos[i - 1]) update(1, MX - 1, 1, x[j] + 1, MX - 1, z[j]); push(1, MX - 1, 1); res = max(res, st[1] - mn[i]); } cout << res << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const int INF = 2e9; const long long INFL = 2e18; const int N = 1e6, M = N; int n, m, G = 0; vector<int> adj[N + 5]; int gr[N + 5], p[N + 5]; vector<int> pth[N + 5]; vector<int> PTH_myEndlessLove; int Pos[N + 5]; void dfs(int u) { gr[u] = G; PTH_myEndlessLove.push_back(u); for (int i = (0), _b = (((int)(adj[u]).size())); i < _b; ++i) { int v = adj[u][i]; if (gr[v]) continue; dfs(v); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = (1), _b = (n); i <= _b; ++i) cin >> p[i]; int u, v; while (m--) { cin >> u >> v; adj[p[u]].push_back(p[v]); adj[p[v]].push_back(p[u]); } for (int i = (1), _b = (n); i <= _b; ++i) if (!gr[p[i]]) { PTH_myEndlessLove.clear(); ++G; dfs(p[i]); sort(PTH_myEndlessLove.begin(), PTH_myEndlessLove.end()); reverse(PTH_myEndlessLove.begin(), PTH_myEndlessLove.end()); pth[G] = PTH_myEndlessLove; } for (int i = (1), _b = (n); i <= _b; ++i) { cout << pth[gr[p[i]]][Pos[gr[p[i]]]] << ; ++Pos[gr[p[i]]]; } cout << n ; return 0; }

#include <bits/stdc++.h> using namespace std; char a[10005]; char b[1000005]; vector<int> poj[10005]; int alen, blen; long long total; int pos; vector<int>::iterator it; int main() { scanf( %s , a); scanf( %s , b); alen = strlen(a), blen = strlen(b); pos = 0; total = 1; for (int i = 0; i <= alen - 1; i++) { poj[a[i] - a ].push_back(i); } for (int i = 0; i <= 25; i++) { sort(poj[i].begin(), poj[i].end()); } for (int i = 0; i <= blen - 1; i++) { if (poj[b[i] - a ].empty()) { printf( -1 n ); return 0; } it = lower_bound(poj[b[i] - a ].begin(), poj[b[i] - a ].end(), pos); if (it == poj[b[i] - a ].end()) { it = poj[b[i] - a ].begin(); total++; } pos = (*it) + 1; } printf( %d n , total); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int n{0}, a{0}, m{0}, s{0}; cin >> n; for (long long int i = 1; i <= n; i++) { cin >> a; s += a; m = max(m, a); } if (s % 2 == 1 || s < 2 * m) { cout << NO ; return 0; } cout << YES ; return 0; }

#include <bits/stdc++.h> using namespace std; const int inf = 0xffffff; int LEN; class Mcmf { public: struct T { int from, to, val; int next, cost; } edge[200001]; int len; int visit[200001], pre[200001], dist[200001], que[200001], vis[200001], pos[200001]; void init() { memset(vis, -1, sizeof(vis)); len = 0; } void add(int from, int to, int val, int cost) { edge[len].from = from, edge[len].to = to, edge[len].val = val, edge[len].cost = cost; edge[len].next = vis[from], vis[from] = len++; edge[len].from = to, edge[len].to = from, edge[len].val = 0, edge[len].cost = -cost; edge[len].next = vis[to], vis[to] = len++; } int SPFA(int s, int t, int n) { int i, to, k; for (i = 0; i <= n; i++) { pre[i] = -1, visit[i] = 0; } int head, tail; head = tail = 0; for (i = 0; i <= n; i++) dist[i] = inf; que[tail++] = s, pre[s] = s, dist[s] = 0, visit[s] = 1; while (head != tail) { int from = que[head++]; visit[from] = 0; for (k = vis[from]; k != -1; k = edge[k].next) { to = edge[k].to; if (edge[k].val > 0 && dist[from] + edge[k].cost < dist[to]) { dist[to] = dist[from] + edge[k].cost; pre[to] = from; pos[to] = k; if (!visit[to]) { visit[to] = 1; que[tail++] = to; } } } } if (pre[t] != -1 && dist[t] < inf) return 1; return 0; } int mnCostFlow(int s, int t, int n) { if (s == t) { } int flow = 0, cost = 0; while (SPFA(s, t, n)) { int from, mn = inf; for (from = t; from != s; from = pre[from]) mn = min(mn, edge[pos[from]].val); flow += mn; cost += dist[t] * mn; for (from = t; from != s; from = pre[from]) { edge[pos[from]].val -= mn; edge[pos[from] ^ 1].val += mn; } } if (flow != LEN) return -1; return cost; } }; int n, q; char s[10010]; int cnt[27]; int tmp[27]; Mcmf mcf; int main() { mcf.init(); scanf( %s , s); LEN = strlen(s); for (int i = 0; i < LEN; ++i) { cnt[s[i] - a ]++; } int len; scanf( %d , &q); int st = q + 26, en = st + 1, num; for (int i = 0; i < q; ++i) { scanf( %s , s); len = strlen(s); memset(tmp, 0, sizeof(tmp)); for (int k = 0; k < len; ++k) ++tmp[s[k] - a ]; for (int k = 0; k < 26; ++k) mcf.add(i, q + k, tmp[k], 0); scanf( %d , &num); mcf.add(st, i, num, i + 1); } for (int i = 0; i < 26; ++i) mcf.add(q + i, en, cnt[i], 0); int ans = mcf.mnCostFlow(st, en, en + 1); printf( %d n , ans); }

#include <bits/stdc++.h> using namespace std; unsigned int dp[100010][400]; vector<int> nima[100010]; int a[100010], b[100010]; int n, m, s, e; int solve(int all = s, int c = e) { unsigned int INF = -1; vector<int> vt[100010]; int cur = 0; memset(dp, -1, sizeof(dp)); int cnt = (all + c - 1) / c; for (int i = 0; i < m; ++i) { vt[b[i]].push_back(i + 1); } int ans = 0; for (int i = 0; i < n; ++i) { dp[cur][0] = 0; cur ^= 1; memset(dp[cur], -1, sizeof(dp[cur])); for (int j = 1; j < cnt + 1; ++j) { unsigned int pre = dp[cur ^ 1][j - 1]; unsigned int p = upper_bound(vt[a[i]].begin(), vt[a[i]].end(), pre) - vt[a[i]].begin(); if (p == vt[a[i]].size()) p = INF; else p = vt[a[i]][p]; dp[cur][j] = min(dp[cur ^ 1][j], p); if (dp[cur ^ 1][j] > p && p + i + j * c <= all) ans = max(ans, j); } } return ans; } int main() { while (cin >> n >> m >> s >> e) { memset(dp, -1, sizeof(dp)); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int i = 0; i < m; ++i) { scanf( %d , &b[i]); nima[b[i]].push_back(i + 1); } int ans = 0; int cnt = s / e; for (int i = 0; i < n; ++i) { dp[i][0] = 0; if (nima[a[i]].size()) dp[i][1] = nima[a[i]][0]; else dp[i][1] = -1; if (i == 0) continue; for (int j = 1; j <= cnt; ++j) { unsigned int now = -1; int w = a[i]; int last = dp[i - 1][j - 1]; now = upper_bound(nima[w].begin(), nima[w].end(), last) - nima[w].begin(); if (now == nima[w].size() || dp[i - 1][j - 1] == -1) { now = -1; } else { now = nima[w][now]; } dp[i][j] = min(dp[i - 1][j], now); } } for (int i = 0; i < n; ++i) for (int j = 0; j < cnt + 1; ++j) { if (dp[i][j] != -1) { if (i + dp[i][j] + 1 + j * e <= s) ans = max(ans, j); } } cout << ans << endl; return 0; } }

#include <bits/stdc++.h> using namespace std; int a[11][5]; bool ok(int l, int j, int k) { int i, an = 0; for (i = 0; i < 5; i++) { an = an + (a[j][i] - a[l][i]) * (a[k][i] - a[l][i]); } if (an > 0) return false; return true; } int main() { ios::sync_with_stdio(false); int i, j, k, n; cin >> n; if (n > 11) { n *= 5; while (n--) cin >> i; cout << 0; } else { for (i = 0; i < n; i++) cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3] >> a[i][4]; vector<int> v; k = n; j = n; for (i = 0; i < n; i++) { k = n; for (j = 0; j < n && k == n; j++) for (k = j + 1; k < n; k++) { if (!ok(i, j, k)) { break; } } if (j == n && k == n) v.push_back(i + 1); } cout << v.size() << endl; for (i = 0; i < v.size(); i++) cout << v[i] << << endl; ; } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 2505; int n, m, K, a[2][N][N], L[N][8], R[N][8], Lc[N][8], Rc[N][8]; char s[N]; long long ans; void work(int x1, int x2, int y1, int y2, int d) { if (y2 - y1 > x2 - x1) { swap(x1, y1), swap(x2, y2), d ^= 1; } if (x1 + 1 == x2) { ans += a[d][y1][x2] - a[d][y1][x1] == K; return; } int mid = x1 + x2 >> 1; work(x1, mid, y1, y2, d), work(mid, x2, y1, y2, d); for (int i = y1; i < y2; ++i) { for (int k = 0; k < K + 1; ++k) L[i][k] = x1, Lc[i][k] = 0, R[i][k] = x2, Rc[i][k] = 0; for (int j = y1; j < i + 1; ++j) { for (int k = 0; k < K + 1; ++k) { Lc[j][k] += a[d][i][mid] - a[d][i][L[j][k]]; while (Lc[j][k] > k) Lc[j][k] -= a[d ^ 1][L[j][k]][i + 1] - a[d ^ 1][L[j][k]][j], ++L[j][k]; Rc[j][k] += a[d][i][R[j][k]] - a[d][i][mid]; while (Rc[j][k] > k) --R[j][k], Rc[j][k] -= a[d ^ 1][R[j][k]][i + 1] - a[d ^ 1][R[j][k]][j]; } for (int k = 0; k < K + 1; ++k) ans += ((k ? L[j][k - 1] : mid) - L[j][k]) * (R[j][K - k] - (K - k ? R[j][K - k - 1] : mid)); } } } int main() { scanf( %d%d%d , &n, &m, &K); for (int i = 0; i < n; ++i) { scanf( %s , s); for (int j = 0; j < m; ++j) a[0][i][j + 1] = a[1][j][i + 1] = s[j] - 48; } for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) a[0][i][j + 1] += a[0][i][j]; for (int j = 0; j < m; ++j) for (int i = 0; i < n; ++i) a[1][j][i + 1] += a[1][j][i]; work(0, n, 0, m, 1); printf( %I64d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const long long int mx = 70, Mod = 1e9 + 7, mxx = 350000; int n; int get(int x, int y, int z) { if (x > y) swap(x, y); if (x > z) swap(x, z); if (y > z) swap(y, z); return x * mx * mx + y * mx + z; } bool mark[mxx]; vector<int> e[mxx]; int dp[mxx]; int par[mxx]; short d[mx][mx]; vector<pair<int, int> > res; void connect(int u, int v) { e[u].push_back(v); e[v].push_back(u); } void bfs(int v) { mark[v] = 1; vector<int> vc; vc.clear(); vc.push_back(v); for (int i = 0; i < vc.size(); i++) for (int u : e[v = vc[i]]) if (!mark[u]) mark[u] = 1, vc.push_back(u), par[u] = v; } void move(int u, int v) { short a[3], b[3]; bool ma[3], mb[3]; for (int i = 0; i < 3; i++) { a[i] = u % mx; b[i] = v % mx; u /= mx; v /= mx; ma[i] = 0; mb[i] = 0; } for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (a[i] == b[j]) ma[i] = 1, mb[j] = 1; for (int i = 0; i < 3; i++) { if (!ma[i]) u = a[i]; if (!mb[i]) v = b[i]; } res.push_back(make_pair(u + 1, v + 1)); } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int x, y, z, u; cin >> n >> x >> y >> z; x--, y--, z--; string s; for (int i = 0; i < n; i++) { cin >> s; for (int j = 0; j < n; j++) d[i][j] = s[j] - a + 1; } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { for (int k = j + 1; k < n; k++) { u = get(i, j, k); for (int v = min(min(i, j), k) + 1; v < n; v++) if (v != i && v != j && v != k) { if (d[v][i] == d[j][k] && v > i) connect(u, get(v, j, k)); if (d[v][j] == d[i][k] && v > j) connect(u, get(v, i, k)); if (d[v][k] == d[i][j] && v > k) connect(u, get(v, i, j)); } } } } u = get(x, y, z); if (u == get(0, 1, 2)) return cout << 0 n , 0; bfs(get(0, 1, 2)); if (!par[u]) return cout << -1 , 0; while (par[u]) { move(u, par[u]); u = par[u]; } cout << res.size() << n ; for (pair<int, int> p : res) cout << p.first << << p.second << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; long long a[maxn]; long long fac[maxn], inv[maxn]; const int mod = 1e9 + 7; long long Pow(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; } return res; } long long C(int n, int m) { if (n < m) return 0; return fac[n] * inv[n - m] % mod * inv[m] % mod; } int main() { fac[0] = inv[0] = 1; for (int i = 1; i < maxn; i++) { fac[i] = 1ll * fac[i - 1] * i % mod; inv[i] = Pow(fac[i], mod - 2); } int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %lld , &a[i]), a[i] %= mod; if (n <= 2) { cout << (a[1] + a[2]) % mod << endl, exit(0); } if (n % 2 != 0) { for (int i = 1; i < n; i++) { if (i % 2 != 0) a[i] = (a[i] + a[i + 1]) % mod; else a[i] = (a[i] - a[i + 1]) % mod; } n -= 1; } long long ans1 = 0, ans2 = 0; for (int i = 1; i <= n; i += 2) { ans1 = (ans1 + C(n / 2 - 1, (i - 1) / 2) * a[i] % mod) % mod; ans2 = (ans2 + C(n / 2 - 1, (i - 1) / 2) * a[i + 1] % mod) % mod; } if ((1ll * n * (n - 1) / 2) % 2 == 0) cout << (ans1 - ans2 + mod) % mod << endl; else cout << (ans1 + ans2 + mod) % mod << endl; return 0; }

#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> &vec) { os << { ; for (int i = (0), __i = (((int)(vec).size())); i < __i; i++) { os << vec[i]; if (i + 1 != ((int)(vec).size())) os << , ; } os << } ; return os; } template <class T1, class T2> ostream &operator<<(ostream &os, pair<T1, T2> &par) { os << ( << par.first << , << par.second << ) ; return os; } const int dim = 110000; char s[dim]; char s1[dim]; int p[dim]; int a[dim]; int a1[dim]; long long r1[dim]; long long r2[dim]; long long r3[dim]; int main() { scanf( %s , s); int n = strlen(s); for (int i = (0), __i = (n); i < __i; i++) s1[i] = s[n - 1 - i]; s1[n] = 0; p[0] = -1; int g = -1; for (int i = (1), __i = (n); i < __i; i++) { while (g != -1 && s1[g + 1] != s1[i]) { g = p[g]; } if (s1[g + 1] == s1[i]) ++g; p[i] = g; } g = -1; a[0] = 0; a1[0] = 0; for (int i = (0), __i = (n); i < __i; i++) { while (g != -1 && s1[g + 1] != s[i]) { g = p[g]; } if (s1[g + 1] == s[i]) ++g; if (a[i] > g + 1) { a1[i + 1] = a1[i]; } else { a1[i + 1] = i - g; } a[i + 1] = max(a[i], g + 1); } r1[0] = 0; r2[0] = 0; r3[0] = 1; long long cc = 52152551; for (int i = (0), __i = (n); i < __i; i++) { r1[i + 1] = r1[i] + s[i] * r3[i]; r2[i + 1] = r2[i] + s1[i] * r3[i]; r3[i + 1] = r3[i] * cc; } int ans = 0; int i1, j1; int i2, j2; for (int i = (0), __i = (n); i < __i; i++) { int l = 0, r = n; while (r - l > 1) { int mid = (l + r) / 2; if (i - mid >= 0 && i + mid < n && (r1[i + 1] - r1[i - mid]) * r3[n - i - mid - 1] == (r2[n - i] - r2[n - i - mid - 1]) * r3[i - mid]) { l = mid; } else { r = mid; } } int t = min(a[i - l], n - i - l - 1); int ans1 = t * 2 + l * 2 + 1; if (ans < ans1) { ans = ans1; i1 = a1[i - l]; j1 = t; i2 = i - l; j2 = l * 2 + 1; } } if (j1 == 0) { printf( 1 n ); printf( %d %d n , i2 + 1, j2); } else { printf( 3 n ); printf( %d %d n , i1 + 1, j1); printf( %d %d n , i2 + 1, j2); printf( %d %d n , n - j1 + 1, j1); } return 0; }

#include <bits/stdc++.h> using namespace std; int df[26]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; int mini = s.length(); for (int i = 0; i < s.length(); i++) { df[s[i] - A ]++; } for (int i = 0; i < k; i++) mini = min(mini, df[i]); cout << k * mini << n ; }

#include <bits/stdc++.h> using namespace std; void solve() { int n, i; cin >> n; int a[n], b[n + 1]; for (i = 0; i < n; i++) { cin >> a[i]; b[a[i]] = i; } int l, r, ans[n + 1]; l = b[1]; r = b[1]; for (i = 2; i <= n; i++) { l = min(l, b[i]); r = max(r, b[i]); if ((r - l + 1) != i) ans[i] = 0; else ans[i] = 1; } cout << 1; for (i = 2; i <= n; i++) cout << ans[i]; cout << endl; } int main() { int t; cin >> t; while (t--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; namespace FGF { int n, m; const int N = 2e6 + 5; const int mo = 1e9 + 7; char s[N]; long long a[N], pw[N], cnt[N]; long long ans; void FWTxor(long long *y, int op) { for (int i = 1; i <= n; i++) for (int j = 0; j < (1 << n); j += (1 << i)) for (int k = 0; k < (1 << (i - 1)); k++) { long long c = (y[j | k] + y[j | k | (1 << (i - 1))]) % mo, d = (y[j | k] - y[j | k | (1 << (i - 1))] + mo) % mo; y[j | k] = c * op % mo, y[j | k | (1 << (i - 1))] = d * op % mo; } } void work() { scanf( %d , &n); scanf( %s , s); pw[0] = 1; for (int i = 0; i < (1 << n); i++) a[i] = s[i] - 0 ; for (int i = 1; i <= n; i++) pw[i] = 2LL * pw[i - 1] % mo; for (int i = 1; i < (1 << n); i++) cnt[i] = cnt[i >> 1] + (i & 1); FWTxor(a, 1); for (int i = 0; i < (1 << n); i++) a[i] = a[i] * a[i] % mo; FWTxor(a, (mo + 1) / 2); for (int i = 0; i < (1 << n); i++) ans = (ans + 1LL * a[i] * pw[n - cnt[i]]) % mo; printf( %lld , ans * 3 % mo); } } // namespace FGF int main() { FGF::work(); return 0; }

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 2e4 + 5; int sum[55][N], a[55][N]; int lazy[N << 2], tree[N << 2]; int dp[55][N]; void pushdown(int root) { if (lazy[root]) { tree[root << 1] += lazy[root]; tree[root << 1 | 1] += lazy[root]; lazy[root << 1] += lazy[root]; lazy[root << 1 | 1] += lazy[root]; lazy[root] = 0; } } void update(int root, int l, int r, int L, int R, int val) { if (L <= l && r <= R) { tree[root] += val; lazy[root] += val; return; } pushdown(root); int mid = (l + r) >> 1; if (L <= mid) update(root << 1, l, mid, L, R, val); if (R > mid) update(root << 1 | 1, mid + 1, r, L, R, val); tree[root] = max(tree[root << 1], tree[root << 1 | 1]); } int getsum(int x1, int y1, int x2, int y2) { return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1]; } int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j]; } } for (int i = 1; i <= m; i++) { dp[1][i] = getsum(1, i, min(2, n), min(m, i + k - 1)); } for (int i = 2; i <= n; i++) { memset(lazy, 0, sizeof lazy); memset(tree, 0, sizeof tree); for (int j = 1; j <= m; j++) { update(1, 1, m, j, j, dp[i - 1][j]); } for (int j = 1; j <= k; j++) { update(1, 1, m, 1, j, -a[i][j]); } for (int j = 1; j <= m; j++) { dp[i][j] = tree[1] + getsum(i, j, min(n, i + 1), min(m, j + k - 1)); update(1, 1, m, max(j - k + 1, 1), j, a[i][j]); if (j + k <= m) { update(1, 1, m, j + 1, j + k, -a[i][j + k]); } } } int ans = 0; for (int i = 1; i <= m; i++) { ans = max(ans, dp[n][i]); } printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const long long inf = 707406378; const int maxn = 1.5e7 + 10; void read(long long &x) { char ch; bool flag = 0; for (ch = getchar(); !isdigit(ch) && ((flag |= (ch == - )) || 1); ch = getchar()) ; for (x = 0; isdigit(ch); x = (x << 1) + (x << 3) + ch - 48, ch = getchar()) ; x *= 1 - 2 * flag; } int main() { long long n, x, y; cin >> n; long long ans = 0; for (int i = 0; i < n; i++) { cin >> x >> y; ans = max(ans, x + y); } cout << ans << endl; return 0; }

#include <bits/stdc++.h> const int p = 998244353; const int inv2 = 499122177; const int MAXN = 140000; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } do x = (x * 10 + ch - 48) % p, ch = getchar(); while (ch >= 0 && ch <= 9 ); return (x * f % p + p) % p; } int n, k, r[MAXN]; long long c[MAXN] = {1, 6, 1}; long long s[MAXN], f[MAXN], g[MAXN]; long long fastpow(long long a, int b) { long long res = 1; a %= p; while (b) { if (b & 1) res = res * a % p; a = a * a % p; b >>= 1; } return res; } void NTT(long long *a, int N) { for (int i = 0; i < N; i++) if (i < r[i]) std::swap(a[i], a[r[i]]); for (int n = 2, m = 1; n <= N; m = n, n <<= 1) { long long g1 = fastpow(3, (p - 1) / n); for (int l = 0; l < N; l += n) { long long g = 1, t1, t2; for (int i = l; i < l + m; i++) { t1 = a[i], t2 = g * a[i + m] % p; a[i] = (t1 + t2) % p; a[i + m] = (t1 - t2 + p) % p; g = g * g1 % p; } } } return; } void INTT(long long *a, int N) { NTT(a, N); std::reverse(a + 1, a + N); int invN = fastpow(N, p - 2); for (int i = 0; i < N; i++) a[i] = a[i] * invN % p; } long long a1[MAXN], b1[MAXN]; void Inv(long long *a, long long *b, int n) { if (n == 1) return void(b[0] = fastpow(a[0], p - 2)); Inv(a, b, (n + 1) >> 1); int N = 1, l = -1; while (N <= n << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << l); for (int i = 0; i < n; i++) a1[i] = a[i]; for (int i = n; i < N; i++) a1[i] = 0; NTT(a1, N); NTT(b, N); for (int i = 0; i < N; i++) b[i] = ((b[i] << 1) % p + p - a1[i] * b[i] % p * b[i] % p) % p; INTT(b, N); for (int i = n; i < N; i++) b[i] = 0; return; } void Dervt(long long *a, long long *b, int n) { for (int i = 1; i < n; i++) b[i - 1] = a[i] * i % p; b[n - 1] = 0; } void Integ(long long *a, long long *b, int n) { for (int i = 1; i < n; i++) b[i] = a[i - 1] * fastpow(i, p - 2) % p; b[0] = 0; } long long f1[MAXN], f2[MAXN]; void Ln(long long *f, long long *g, int n) { memset(f1, 0, sizeof(f1)); memset(f2, 0, sizeof(f2)); Dervt(f, f1, n); Inv(f, f2, n); int N = 1, l = -1; while (N <= n << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << l); NTT(f1, N); NTT(f2, N); for (int i = 0; i < N; i++) f1[i] = f1[i] * f2[i] % p; INTT(f1, N); Integ(f1, g, n); return; } long long g1[MAXN]; void Exp(long long *f, long long *g, int n) { if (n == 1) return void(g[0] = 1); Exp(f, g, (n + 1) >> 1); Ln(g, g1, n); int N = 1, l = -1; while (N <= n << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << l); for (int i = 0; i < n; i++) f1[i] = f[i]; for (int i = n; i < N; i++) g1[i] = f1[i] = 0; for (int i = 0; i < N; i++) f1[i] = ((f1[i] - g1[i]) % p + p) % p; f1[0] = (f1[0] + 1) % p; NTT(f1, N); NTT(g, N); for (int i = 0; i < N; i++) g[i] = f1[i] * g[i] % p; INTT(g, N); for (int i = n; i < N; i++) g[i] = 0; return; } long long lnf[MAXN]; void Pow(long long *f, long long *g, int n, int k) { Ln(f, lnf, n); for (int i = 0; i < n; i++) lnf[i] = lnf[i] * k % p; memset(g, 0, sizeof(g1)); Exp(lnf, g, n); return; } int main() { n = read(); int t = read(); k = std::min(n, t); int N = 1, l = -1; while (N <= (k + 1) << 1) N <<= 1, l++; for (int i = 1; i < N; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << l); Pow(c, s, k + 1, inv2 - 1); Pow(c, f, k + 1, inv2); f[0]++, f[1]++; for (int i = 0; i <= k; i++) f[i] = f[i] * inv2 % p; Pow(f, g, k + 1, n + 1); NTT(s, N); NTT(g, N); for (int i = 0; i < N; i++) s[i] = s[i] * g[i] % p; INTT(s, N); for (int i = 1; i <= k; i++) std::printf( %lld , s[i]); for (int i = k + 1; i <= t; i++) std::printf( 0 ); std::putchar( n ); return 0; }

#include <bits/stdc++.h> using namespace std; long long int gcd(long long int x, long long int y) { if (y > x) { return gcd(y, x); } if (y == 0) { return x; } return gcd(y, x % y); } bool prime(long long int x) { for (long long int i = 2; i <= sqrt(x); i++) { if (x % i == 0) { return 0; } } return 1; } long long int fact(long long int n) { if (n == 0) { return 1; } return n * fact(n - 1); } void solve() { long long int r, c; cin >> r >> c; long long int b = 1; for (long long int i = 0; i < r; i++) { if (i % 2 == 0) { for (long long int j = 0; j < c; j++) cout << # ; cout << endl; } else { if (b == 1) { for (long long int j = 0; j < c - 1; j++) cout << . ; cout << # ; cout << endl; b = 0; } else { cout << # ; for (long long int j = 0; j < c - 1; j++) cout << . ; cout << endl; b = 1; } } } } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); long long int t = 1; while (t--) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int n; int dp[10][310]; int nex[1010][10][1010]; int ai[1010]; int up; void init(void) { memset(dp, -1, sizeof(dp)); int i, j; int cnt[10]; for (i = 1; i <= n; i++) { memset(cnt, 0, sizeof(cnt)); for (j = 1; j <= 8; j++) for (int k = 1; k <= n; k++) nex[i][j][k] = 1e9; for (j = i; j <= n; j++) { cnt[ai[j]]++; nex[i][ai[j]][cnt[ai[j]]] = j; } } } int main() { int i, j, k; cin >> n; for (i = 1; i <= n; i++) { cin >> ai[i]; } init(); up = (1 << 8) - 1; int ans = 0; for (int num = 0; num * 8 <= n; num++) { for (int i = 0; i < 256; i++) for (int k = 0; k <= 8; k++) dp[k][i] = 1e9; dp[0][0] = 1; for (i = 0; i <= up; i++) { for (j = 0; j <= 8; j++) { for (k = 1; k <= 8; k++) { if (i & (1 << (k - 1))) continue; if (dp[j][i] > n) continue; dp[j][i ^ (1 << (k - 1))] = min(dp[j][i ^ (1 << (k - 1))], nex[dp[j][i]][k][num] + 1); dp[j + 1][i ^ (1 << (k - 1))] = min(dp[j + 1][i ^ (1 << (k - 1))], nex[dp[j][i]][k][num + 1] + 1); } } } for (i = 0; i <= 8; i++) if (dp[i][up] <= n + 1) { ans = max(ans, num * 8 + i); } } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int n, m; int num[105]; int a[105][105], sum[105][105], mx[105][105]; int f[105][10005]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> num[i]; for (int j = 1; j <= num[i]; j++) { cin >> a[i][j]; sum[i][j] = sum[i][j - 1] + a[i][j]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= num[i]; j++) { for (int k = 0; k <= j; k++) { mx[i][j] = max(mx[i][j], sum[i][k] + (sum[i][num[i]] - sum[i][num[i] - (j - k)])); } } } for (int i = 1; i <= n; i++) { for (int j = 0; j <= m; j++) { int maxi = 0; for (int k = 0; k <= num[i] && k <= j; k++) { maxi = max(maxi, f[i - 1][j - k] + mx[i][k]); } f[i][j] = maxi; } } cout << f[n][m] << endl; return 0; }

#include <bits/stdc++.h> int main() { long long a, b, c, flag = 0; scanf( %lld , &a); if (a == 1 || a == 2) { printf( -1 ); return 0; } if (a % 2 == 0) { flag = 1; } if (flag != 1) { b = (a * a + 1) / 2; c = (a * a - 1) / 2; printf( %lld %lld , c, b); } else { b = (a * a + 4) / 4; c = (a * a - 4) / 4; printf( %lld %lld , c, b); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); vector<int> w(n, 0); w[0] = v[0]; for (int i = 1; i < n; i++) w[i] = w[i - 1] + v[i]; int score = 0, penalty = 0; for (int i = 0; i < n; i++) { if (w[i] <= 60 * 12 - 10) score++; else break; if (w[i] > 60 * 6 - 10) penalty += w[i] - 60 * 6 + 10; } cout << score << << penalty << endl; }

#include <bits/stdc++.h> using namespace std; int freq[200005]; int arr[1005]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) freq[arr[i] + arr[j]]++; int ans = 0; for (int i = 0; i < 2e5 + 5; i++) ans = max(ans, freq[i]); cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; struct __timestamper {}; struct change { int s, t, u; }; vector<long long> solve(vector<int> a, vector<change> b) { long long sum = 0; for (auto x : a) sum += x; vector<long long> ans; int n = a.size(); vector<int> cntr(n); auto change_counter = [&](int i, int delta) { sum -= max(0, a[i] - cntr[i]); cntr[i] += delta; sum += max(0, a[i] - cntr[i]); }; map<pair<int, int>, int> mp; for (auto c : b) { auto it = mp.find({c.s, c.t}); if (it != mp.end()) { change_counter(it->second, -1); mp.erase(it); } if (c.u != -1) { mp[{c.s, c.t}] = c.u; change_counter(c.u, +1); } ans.push_back(sum); } return ans; } int main() { int n; while (scanf( %d , &n) == 1) { vector<int> a(n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } int q; scanf( %d , &q); vector<change> b(q); for (int i = 0; i < q; i++) { scanf( %d%d%d , &b[i].s, &b[i].t, &b[i].u); b[i].s--; b[i].u--; } auto ans = solve(a, b); for (auto x : ans) printf( %lld n , x); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x, y = 0, z = 0; for (int i = 0; i < n; i++) { cin >> x; if (x != y) { z++; } y = x; } cout << z; return 0; }

#include <bits/stdc++.h> using namespace std; long long n, t[100001], ans; double w; long long lowbit(long long x) { return x & (-x); } struct rua { double x, v; long long id; } _[100001]; void change(long long x) { while (x <= n) t[x]++, x += lowbit(x); } int sum(long long k) { long long res = 0; while (k > 0) res += t[k], k -= lowbit(k); return res; } bool cmp(rua a, rua b) { return fabs(a.x * b.v) < fabs(a.v * b.x); } int main() { scanf( %I64d%lf , &n, &w), w += 1e-6; for (long long i = 1; i <= n; i++) scanf( %lf%lf , &_[i].x, &_[i].v), _[i].v -= w; sort(_ + 1, _ + n + 1, cmp); for (long long i = 1; i <= n; i++) _[i].id = i, _[i].v += 2 * w; sort(_ + 1, _ + n + 1, cmp); for (long long i = 1; i <= n; i++) ans += i - 1 - sum(_[i].id), change(_[i].id); return printf( %I64d n , ans), 0; }

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; char ch; int t,n,k,h[110],pos; void read(int &x) { x=0; ch=getchar(); while(ch< 0 ||ch> 9 ) ch=getchar(); while(ch>= 0 &&ch<= 9 ) { x=x*10+ch- 0 ; ch=getchar(); } } int main() { read(t); while(t--) { read(n);read(k); for (int i=1;i<=n;i++) read(h[i]); while(k--) { pos=0; for (int j=1;j<=n;j++) if (j==n) pos=-1; else if (h[j]<h[j+1]) {h[j]++;pos=j;break;} if (pos==-1) break; } printf( %d n ,pos); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<long long> X(n + 1), Y(n + 1); for (int i = (1); i <= (n); ++i) scanf( %lld%lld , &X[i], &Y[i]); long long S = 0; for (int k = (1); k <= (n); ++k) { vector<double> V; for (int i = (1); i <= (n); ++i) if (i != k) V.push_back(atan2(Y[i] - Y[k], X[i] - X[k])); sort(V.begin(), V.end()); V.insert(V.end(), V.begin(), V.end()); for (int i = 0, j = 0; i + 1 < n; i++) { while (V[j] + (j >= n - 1 ? 2 * acos(-1) : 0.0) - V[i] < acos(-1)) j++; long long x = j - 1 - i, y = n - 2 - x; S += x * (x - 1) / 2 * y * (y - 1) / 2; } } printf( %lld n , S / 2); return 0; }

#include <bits/stdc++.h> using namespace std; int sum, len; string s; int cnt[26][5010][26]; int main() { cin >> s; sum = 0; len = s.length(); s += s; memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < len; i++) { for (int j = 1; j < len; j++) { cnt[s[i] - a ][j][s[i + j] - a ]++; } } for (int i = 0; i < 26; i++) { int mx = 0; for (int j = 1; j < len; j++) { int tmp = 0; for (int k = 0; k < 26; k++) if (cnt[i][j][k] == 1) tmp++; mx = max(mx, tmp); } sum += mx; } printf( %.10lf n , (double)sum / (double)len); }

#include <bits/stdc++.h> using namespace std; int main() { int A1, B1, C1, A2, B2, C2; cin >> A1 >> B1 >> C1 >> A2 >> B2 >> C2; if (A1 * B2 != A2 * B1) cout << 1 << endl; else { if (A1 != 0 && A2 != 0 && A2 * C1 == A1 * C2) cout << -1 << endl; else if (A1 != 0 && A2 != 0) cout << 0 << endl; else if ((A1 == 0 && A2 != 0) || (A1 != 0 && A2 == 0)) { if (B1 != 0 && B2 != 0) cout << 1 << endl; else if (B1 == 0 && C1 != 0 || B2 == 0 && C2 != 0) cout << 0 << endl; else cout << -1 << endl; } else if (A1 == 0 && A2 == 0) { if (((B1 == 0 && C1 == 0) && (B2 == 0 && C2 == 0)) || ((B1 != 0 || B2 != 0) && B1 * C2 == B2 * C1)) cout << -1 << endl; else cout << 0 << endl; } } }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; bool vis[N]; vector<int> prime; void sieve() { for (int i = 2; i * i < N; i++) { if (vis[i]) continue; for (int j = 2; j * i < N; j++) { vis[i * j] = 1; } } for (int i = 2; i < N; i++) { if (vis[i] == 0) prime.push_back(i); } } int find(int x) { int ans = upper_bound(prime.begin(), prime.end(), x) - prime.begin() - 1; return ans; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); sieve(); int t; cin >> t; while (t--) { int n; cin >> n; int ans = find(n) - find(sqrt(n)) + 1; cout << ans << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; const int Inf = (1 << 30) - 1; const long long lInf = (1LL << 62) - 1; const int mInf = 0x7f7f7f7f; const int Maxn = 200010; vector<int> a[Maxn]; pair<int, int> S[Maxn << 1]; int f[Maxn]; int t[Maxn]; int n, m, ans; void solve(int k) { map<int, int> M; for (int i = 1; i <= n; i++) M[++f[i]] = i; for (int i = 1; i <= n; i++) t[i] = a[i][k]; int cnt = 0, tot = 0, minn = Inf; for (int i = 1; i <= n; i++) { int tmp = M[t[i]]; if (tmp != 0 && i - tmp != 0) S[++tot] = make_pair(i - tmp > 0 ? i - tmp : i - tmp + n, 1); if (tmp != 0) S[++tot] = make_pair(i - tmp + 1 > 0 ? i - tmp + 1 : i - tmp + n + 1, -1); if (t[i] == f[i]) cnt++; } sort(S + 1, S + tot + 1); minn = min(minn, n - cnt); int p = 1; for (int i = 1; i < n; i++) { while (S[p].first <= i && p <= tot) cnt += S[p++].second; minn = min(minn, i + n - cnt); } ans += minn; } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; i++) { a[i].push_back(0); for (int x, j = 1; j <= m; j++) cin >> x, a[i].push_back(x); } for (int i = 1; i <= n; i++) f[i] = (i - 1) * m; for (int i = 1; i <= m; i++) solve(i); cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m, s, f, add = 0, rund = 1; cin >> n >> m >> s >> f; if (s < f) add = 1; else add = -1; for (int i = 0; i < m; i++) { int t, l, r; cin >> t >> l >> r; while (rund < t) { if (s == f) break; if (add == 1) cout << R ; else if (add == -1) cout << L ; s += add; rund++; } if (s == f) continue; if (t == rund) { rund++; if (s >= l && s <= r || s + add >= l && s + add <= r) cout << X ; else if (add == 1) { cout << R ; s += add; } else if (add == -1) { cout << L ; s += add; } } } while (s != f) { if (add == 1) cout << R ; else if (add == -1) cout << L ; s += add; } cout << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int Nmax = 1e5 + 5, lg = 16; struct updates { int l, x, y, id; bool operator<(const updates &other) const { if (l != other.l) return l > other.l; return id < other.id; } }; vector<updates> upd; vector<int> v[Nmax]; struct Node { int s, l, r; bool full; Node() { s = l = r = full = 0; } Node(int S, int L, int R, bool Full) { s = S; l = L; r = R; full = Full; } }; int f[Nmax], x, y, w, i, answer[Nmax], n, q; Node combina(Node a, Node b) { if (a.full && b.full) return Node(0, a.l + b.l, a.r + b.r, 1); if (a.full) return Node(b.s, a.l + b.l, b.r, 0); if (b.full) return Node(a.s, a.l, a.r + b.r, 0); return Node(a.s + b.s + f[a.r + b.l], a.l, b.r, 0); } class SegmentTree { Node *a; public: void build(int sz) { a = new Node[4 * sz + 5]; } void update(int node, int st, int dr, int pos) { if (st == dr) { a[node].s = 0; a[node].l = a[node].r = a[node].full = 1; return; } if (pos <= ((st + dr) / 2)) update((node << 1), st, ((st + dr) / 2), pos); else update(((node << 1) + 1), ((st + dr) / 2) + 1, dr, pos); a[node] = combina(a[(node << 1)], a[((node << 1) + 1)]); } Node query(int node, int st, int dr, int Left, int Right) { if (Left <= st && dr <= Right) return a[node]; if (Left <= ((st + dr) / 2) && ((st + dr) / 2) < Right) return combina( query((node << 1), st, ((st + dr) / 2), Left, Right), query(((node << 1) + 1), ((st + dr) / 2) + 1, dr, Left, Right)); if (Left <= ((st + dr) / 2)) return query((node << 1), st, ((st + dr) / 2), Left, Right); else return query(((node << 1) + 1), ((st + dr) / 2) + 1, dr, Left, Right); } } aint[Nmax]; class HeavyPath { int level[Nmax], dad[Nmax], to[Nmax], pos[Nmax], w[Nmax], sz[Nmax], First[Nmax], t[Nmax][lg + 2], nrChains; void dfs(int node) { for (auto i = 1; i <= lg; ++i) t[node][i] = t[t[node][i - 1]][i - 1]; w[node] = 1; for (auto it : v[node]) if (!level[it]) { level[it] = level[node] + 1; dad[it] = t[it][0] = node; dfs(it); w[node] += w[it]; } } void chains(int node) { to[node] = nrChains; pos[node] = ++sz[nrChains]; if (v[node].size() == 1 && node != 1) return; int xson = 0; for (auto it : v[node]) if (it != dad[node] && w[xson] < w[it]) xson = it; chains(xson); for (auto it : v[node]) if (it != dad[node] && it != xson) { First[++nrChains] = it; chains(it); } } Node query(int x, int y) { if (to[x] == to[y]) return aint[to[x]].query(1, 1, sz[to[x]], pos[x], pos[y]); return combina(query(x, dad[First[to[y]]]), aint[to[y]].query(1, 1, sz[to[y]], 1, pos[y])); } public: void prepare() { memset(level, 0, sizeof(level)); level[1] = 1; dad[1] = 0; dfs(1); nrChains = 1; First[1] = 1; memset(sz, 0, sizeof(sz)); chains(1); int i; for (i = 1; i <= nrChains; ++i) aint[i].build(sz[i]); } int get_answer(int x, int y) { int X = x, Y = y; if (level[x] < level[y]) swap(x, y), swap(X, Y); int up = level[x] - level[y] - 1, i; if (up != -1) { for (i = 0; i <= lg; ++i) if (up & (1 << i)) x = t[x][i]; if (dad[x] == y) { auto ans = query(x, X); if (ans.full) return f[ans.l]; return ans.s + f[ans.l] + f[ans.r]; } x = dad[x]; } for (i = lg; i >= 0; --i) if (t[x][i] != t[y][i]) x = t[x][i], y = t[y][i]; auto ans1 = query(x, X), ans2 = query(y, Y); swap(ans2.l, ans2.r); ans1 = combina(ans2, ans1); if (ans1.full) return f[ans1.l]; return ans1.s + f[ans1.l] + f[ans1.r]; } void add_edge(int x, int y) { if (y == dad[x]) swap(x, y); aint[to[y]].update(1, 1, sz[to[y]], pos[y]); } } hp; int main() { cin.sync_with_stdio(false); cin >> n >> q; for (i = 1; i < n; ++i) cin >> f[i]; for (i = 1; i < n; ++i) { cin >> x >> y >> w; v[x].push_back(y); v[y].push_back(x); upd.push_back({w, x, y, 0}); } for (i = 1; i <= q; ++i) { cin >> x >> y >> w; upd.push_back({w, x, y, i}); } sort(upd.begin(), upd.end()); hp.prepare(); for (auto it : upd) { if (!it.id) hp.add_edge(it.x, it.y); else answer[it.id] = hp.get_answer(it.x, it.y); } for (i = 1; i <= q; ++i) cout << answer[i] << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int(n); scanf( %d , &(n)); int val[100001][2]; double arr[100001]; for (int i = 1; i <= n; i++) cin >> arr[i]; int sum = 0; for (int i = 1; i <= n; i++) { int t = arr[i]; if (arr[i] - t != 0) { if (t > 0) { val[i][0] = t; val[i][1] = t + 1; } if (t < 0) { val[i][0] = t - 1; val[i][1] = t; } if (t == 0) { if (arr[i] > 0) { val[i][0] = 0; val[i][1] = 1; } if (arr[i] < 0) { val[i][0] = -1; val[i][1] = 0; } } } else { val[i][0] = t; val[i][1] = t; } sum += val[i][1]; } int k = sum; for (int i = 1; i <= n; i++) { if (k > 0 && val[i][0] != val[i][1]) { cout << val[i][0] << n ; k--; } else cout << val[i][1] << n ; } return 0; }

#include <bits/stdc++.h> long long i, j, m, n, s, t, x, y, z, ma; long long a[100][100], b[100][100]; long long mi(long long a, long long b) { if (a < b) return a; else return b; } void ss(long long x, long long y, long long shu) { long long i, j, t; z++; if (z > 8000000) return; if (shu > ma) { for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) b[i][j] = a[i][j]; ma = shu; } t = mi(x + 3, n); for (i = x; i <= t; i++) for (j = 1; j <= m; j++) if (a[i][j] == 0) { if (a[i][j - 1] + a[i][j + 1] + a[i + 1][j] + a[i + 2][j] == 0 && j - 1 > 0 && j + 1 <= m && i + 2 <= n) { a[i][j - 1] = shu + 1; a[i][j + 1] = shu + 1; a[i][j] = shu + 1; a[i + 1][j] = shu + 1; a[i + 2][j] = shu + 1; ss(i, j, shu + 1); a[i][j - 1] = 0; a[i][j + 1] = 0; a[i][j] = 0; a[i + 1][j] = 0; a[i + 2][j] = 0; } if (a[i][j - 1] + a[i][j + 1] + a[i - 1][j] + a[i - 2][j] == 0 && j - 1 > 0 && j + 1 <= m && i - 2 > 0) { a[i][j - 1] = shu + 1; a[i][j + 1] = shu + 1; a[i][j] = shu + 1; a[i - 1][j] = shu + 1; a[i - 2][j] = shu + 1; ss(i, j, shu + 1); a[i][j - 1] = 0; a[i][j + 1] = 0; a[i][j] = 0; a[i - 1][j] = 0; a[i - 2][j] = 0; } if (a[i - 1][j] + a[i + 1][j] + a[i][j + 1] + a[i][j + 2] == 0 && i - 1 > 0 && i + 1 <= n && j + 2 <= m) { a[i - 1][j] = shu + 1; a[i + 1][j] = shu + 1; a[i][j] = shu + 1; a[i][j + 1] = shu + 1; a[i][j + 2] = shu + 1; ss(i, j, shu + 1); a[i - 1][j] = 0; a[i + 1][j] = 0; a[i][j] = 0; a[i][j + 1] = 0; a[i][j + 2] = 0; } if (a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j - 2] == 0 && i - 1 > 0 && i + 1 <= n && j - 2 > 0) { a[i - 1][j] = shu + 1; a[i + 1][j] = shu + 1; a[i][j] = shu + 1; a[i][j - 1] = shu + 1; a[i][j - 2] = shu + 1; ss(i, j, shu + 1); a[i - 1][j] = 0; a[i + 1][j] = 0; a[i][j] = 0; a[i][j - 1] = 0; a[i][j - 2] = 0; } } return; } int main() { while (scanf( %lld%lld , &n, &m) != EOF) { ma = 0; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { a[i][j] = 0; b[i][j] = 0; } z = 0; ss(1, 1, 0); printf( %lld n , ma); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) if (b[i][j] == 0) printf( . ); else printf( %c , b[i][j] + 64); printf( n ); } } }

#include <bits/stdc++.h> using namespace std; int c[100001]; int w[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> c[i]; } for (int i = 0; i < n; i++) { cin >> w[i]; } int ch = m; set<pair<long long, int> > s; long long cnt = 0; for (int i = 0; i < n; i++) { if (ch < c[i] % 100) { long long mn = (100 - c[i] % 100) * w[i]; if (s.begin() != s.end() && s.begin()->first < mn) { cnt += s.begin()->first; ch += 100; ch -= c[i] % 100; s.erase(s.begin()); s.insert(make_pair((100 - c[i] % 100) * w[i], i)); } else { ch += 100 - c[i] % 100; cnt += mn; } } else { if (c[i] % 100 != 0) { s.insert(make_pair((100 - c[i] % 100) * w[i], i)); ch -= c[i] % 100; } } } cout << cnt << endl; vector<bool> p(n, 0); for (set<pair<long long, int> >::iterator it = s.begin(); it != s.end(); it++) { p[it->second] = 1; } for (int i = 0; i < n; i++) { if (p[i]) { cout << c[i] / 100 << << c[i] % 100 << endl; } else { cout << (c[i] + 99) / 100 << 0 << endl; } } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> p[100]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> p[i].first; p[i].second = i + 1; } sort(p, p + n); for (int i = 0; i < n; i++) cout << p[i].second << ; }

#include <bits/stdc++.h> int main() { int ans = 0; int count; scanf( %d , &count); for (int i = 0; i < count; i++) { int prize; scanf( %d , &prize); int minTimeToPrize = std::min(prize - 1, 1000000 - prize); ans = std::max(ans, minTimeToPrize); } printf( %d , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 100005; struct Point { int x, y; void read() { int a, b; scanf( %d%d , &a, &b); x = a + b; y = a - b; } bool operator<(const Point p) const { return x != p.x ? x < p.x : y < p.y; } } p[N]; int n; int pre_min[N], pre_max[N]; int suf_min[N], suf_max[N]; bool check(long long mid) { for (int l = 1, r = 1; r <= n; r++) { while (p[r].x - p[l].x > mid && l <= n) l++; int mx = max(pre_max[l - 1], suf_max[r + 1]); int mn = min(pre_min[l - 1], suf_min[r + 1]); if (mx - mn <= mid) return true; } return false; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) p[i].read(); sort(p + 1, p + 1 + n); pre_min[0] = INT_MAX; pre_max[0] = INT_MIN; suf_min[n + 1] = INT_MAX; suf_max[n + 1] = INT_MIN; for (int i = 1; i <= n; i++) { pre_max[i] = max(pre_max[i - 1], p[i].y); pre_min[i] = min(pre_min[i - 1], p[i].y); } for (int i = n; i >= 1; i--) { suf_max[i] = max(suf_max[i + 1], p[i].y); suf_min[i] = min(suf_min[i + 1], p[i].y); } long long ans, low = 0, high = 1LL << 50, mid; while (low <= high) { mid = (low + high) >> 1; if (check(mid)) high = mid - 1, ans = mid; else low = mid + 1; } printf( %.10f n , ans / 2.0); return 0; }

#include <bits/stdc++.h> using namespace std; const int NMax = 40, MMax = 200; int N, nn, A[NMax][NMax], B[NMax]; int get(int a, int b) { return (a ^ b); } int P(int a, int b) { if (b) return a * -1; else return a; } int main() { scanf( %d , &N); nn = (N + 1) >> 1; for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) scanf( %d , &A[i][j]); int ret = -100000000; for (int I = 0; I < (1 << nn); I++) { int cnt = 0; int k = I; for (int i = 1; i <= nn; i++) { B[i] = (I & 1); cnt += P(A[i][nn], B[i]); I >>= 1; } I = k; for (int i = 1; i < nn; i++) cnt += P(A[i + nn][nn], get(B[i], B[nn])); for (int i = 1; i < nn; i++) { int tot0 = P(A[nn][i], 0) + P(A[nn][nn + i], get(0, B[nn])), tot1 = P(A[nn][i], 1) + P(A[nn][nn + i], get(1, B[nn])); for (int j = 1; j < nn; j++) { int maxx = -100000000; for (int first = 0; first < 2; first++) { int second = 0; int x1 = get(first, B[j]), x2 = get(second, B[nn]), x3 = get(B[j], B[nn]), x4 = get(first, second), x5 = get(x1, x2); if (get(x3, x4) == x5) maxx = max(maxx, P(A[j][i], first) + P(A[j][nn + i], x1) + P(A[nn + j][i], x4) + P(A[nn + j][nn + i], x5)); } if (maxx != -100000000) tot0 += maxx; else tot0 = -100000000; } for (int j = 1; j < nn; j++) { int maxx = -100000000; for (int first = 0; first < 2; first++) { int second = 1; int x1 = get(first, B[j]), x2 = get(second, B[nn]), x3 = get(B[j], B[nn]), x4 = get(first, second), x5 = get(x1, x2); if (get(x3, x4) == x5) maxx = max(maxx, P(A[j][i], first) + P(A[j][nn + i], x1) + P(A[nn + j][i], x4) + P(A[nn + j][nn + i], x5)); } if (maxx != -100000000) tot1 += maxx; else tot1 = -100000000; } cnt += max(tot0, tot1); } ret = max(ret, cnt); } printf( %d n , ret); return 0; }

#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long a, b, c, d; cin >> a >> b >> c >> d; long long s1 = a + b; long long s2 = c + d; if (s1 > s2) cout << s1 << endl; else cout << s2 << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { int n, i, flag = 0, j; cin >> n; while (n--) { int x; cin >> x; flag = 0; for (i = 0; i <= 33; i++) { for (j = 0; j <= 14; j++) { if (i * 3 + j * 7 == x) { cout << YES << endl; flag = 1; break; } } if (flag == 1) break; } if (flag == 0) cout << NO << endl; } }

#include <bits/stdc++.h> using namespace std; int N; bool valid(int P, int d, vector<int> guess) { if (P >= N) { return true; } if (P == 0) { if (valid(P + 1, d, guess)) return true; guess[P] -= d; if (valid(P + 1, d, guess)) return true; guess[P] += d; guess[P] += d; if (valid(P + 1, d, guess)) return true; guess[P] -= d; } else { if (guess[P] == guess[P - 1]) { if (valid(P + 1, d, guess)) return true; } else if ((guess[P] - d) == guess[P - 1]) { guess[P] -= d; if (valid(P + 1, d, guess)) return true; guess[P] += d; } else if ((guess[P] + d) == guess[P - 1]) { guess[P] += d; if (valid(P + 1, d, guess)) return true; guess[P] -= d; } } return false; } int main() { cin >> N; vector<int> V(N); for (int i = 0; i < N; i++) cin >> V[i]; for (int d = 0; d <= 100; d++) { if (valid(0, d, V)) { cout << d << n ; return 0; } } cout << -1 << n ; return 0; }

#include <bits/stdc++.h> using namespace std; signed main() { int64_t n; cin >> n; int64_t a[n]; for (int64_t i = 0; i < n; i++) cin >> a[i]; map<int64_t, int64_t> first; map<int64_t, int64_t> second; first[a[0]] = 1; int64_t sum = 0; for (int64_t i = 0; i < n; i++) sum += a[i]; for (int64_t i = 1; i < n; i++) second[a[i]]++; int64_t cur = 0; if (sum % 2) { cout << NO n ; return 0; } int64_t tar = sum / 2; for (int64_t i = 0; i < n; i++) { cur += a[i]; if (cur == tar) { cout << YES n ; return 0; } if (cur > tar) { int64_t x = cur - tar; if (first[x] > 0) { cout << YES n ; return 0; } } if (cur < tar) { int64_t x = tar - cur; if (second[x] > 0) { cout << YES n ; return 0; } } first[a[i + 1]]++; second[a[i + 1]]--; } cout << NO n ; }

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int n, m, q; int a[1110][810]; char s[1100]; int ni[5] = {0, 1, 3, 2, 4}; long long pow_mod(long long a, long long e) { long long res = 1; for (; e; a = a * a % mod, e >>= 1) if (e & 1) res = res * a % mod; return res; } int frnum; const int BASE = 5; int wr[1100]; void gauss() { for (int i = 1; i <= n; i++) { int flag = 0; for (int j = i; j <= m; j++) if (a[j][i]) { for (int k = 1; k <= n + q; k++) swap(a[j][k], a[i][k]); flag = 1; break; } if (flag == 0) { m++; for (int j = 1; j <= n + q; j++) a[m][j] = a[i][j], a[i][j] = 0; continue; } for (int j = i + 1; j <= n + q; j++) a[i][j] = (a[i][j] * ni[a[i][i]]) % BASE; a[i][i] = 1; for (int j = 1; j <= m; j++) if (a[j][i] && j != i) { for (int k = 1; k <= n + q; k++) if (k != i) a[j][k] = (a[j][k] + 5 - (a[j][i] * a[i][k]) % BASE) % BASE; a[j][i] = 0; } } for (int i = 1; i <= n; i++) if (a[i][i] == 0) frnum++; for (int i = 1; i <= m; i++) { int ff = 0; for (int j = 1; j <= n; j++) if (a[i][j]) ff = 1; if (ff) continue; for (int j = n + 1; j <= n + q; j++) if (a[i][j]) wr[j - n] = 1; } } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) a[j][i] = s[j] - a ; } scanf( %d , &q); for (int i = 1; i <= q; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) a[j][i + n] = s[j] - a ; } gauss(); for (int i = 1; i <= q; i++) { if (wr[i]) cout << 0 << endl; else cout << pow_mod(5, frnum) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, a; cin >> n >> a; map<int, int> my; set<int> rem; int ca = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x == a) { ++ca; } else { if (rem.find(x) != rem.end()) continue; my[x]++; if (my[x] <= ca) { my.erase(x); rem.insert(x); } } } if (my.empty()) { cout << -1 n ; return 0; } else { for (auto it : my) { if (it.second >= ca) { cout << it.first << n ; return 0; } } } cout << -1 n ; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int64_t n, l, d; cin >> n >> d >> l; int a[25001]; for (int i = 1; i <= n; i++) { if (d > 0) { a[i] = l; } else { a[i] = 1; } d = a[i] - d; } a[n] = a[n] - d; if (a[n] <= 0 || a[n] > l) { cout << -1; } else { for (int i = 1; i <= n; i++) { cout << a[i] << ; } } return 0; }

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + c - 0 ; c = getchar(); } return f ? -ret : ret; } using namespace std; int k, p; long long int l, r; int mypow(int a, long long int b, int mod) { int ret = 1; for (; b; b >>= 1, a = (long long int)a * a % mod) if (b & 1) ret = (long long int)ret * a % mod; return ret; } int work() { k = getint(); l = getint(), r = getint(); p = getint(); if (p == 2) return (k & 1) ? 0 : 1; if (k % p == 0) return k & 1 ? mypow(mypow(2, p - 2, p), r - l, p) : 1; int t = mypow(2, l, p - 1), ans; t = mypow(k, t, p); if ((t - 1) % p == 0) ans = mypow(2, r - l + 1, p); else { int c = mypow(2, r - l + 1, p - 1); c = mypow(t, c, p); ans = (long long int)(c + p - 1) * mypow(t + p - 1, p - 2, p) % p; } if (k & 1) ans = (long long int)ans * mypow(mypow(2, p - 2, p), r - l, p) % p; return ans; } int main() { int T = getint(); while (T--) printf( %d n , work()); }

#include <bits/stdc++.h> using namespace std; long long valor[100456], solapacion[100456][320], posheavy[100456], resp[100456], arrupd[100456]; vector<long long> v[100456], colaheavy; bool light[100456], existe[100456]; void init() { for (int i = 0; i < 100456; ++i) { existe[i] = false; } } void solape(long long m) { long long auxcontador = 0; for (int i = 0; i < colaheavy.size(); ++i) { for (int j = 0; j < v[colaheavy[i]].size(); j++) { existe[v[colaheavy[i]][j]] = true; } for (int j = 0; j < m; j++) { auxcontador = 0; for (int k = 0; k < v[j].size(); k++) { if (existe[v[j][k]] == true) { auxcontador++; } } if (colaheavy[i] == j) auxcontador = 0; solapacion[j][i] = auxcontador; } for (int j = 0; j < v[colaheavy[i]].size(); j++) { existe[v[colaheavy[i]][j]] = false; } } } void updatelight(long long pos, long long val) { pos--; for (int i = 0; i < v[pos].size(); ++i) { valor[v[pos][i]] += val; } for (int i = 0; i < colaheavy.size(); ++i) { resp[colaheavy[i]] += (solapacion[pos][i]) * val; } } void updateheavy(long long pos, long long num) { pos--; resp[pos] += v[pos].size() * num; arrupd[pos] += num; } void querylight(long long num) { long long tot = 0; for (int i = 0; i < v[num].size(); ++i) { tot += valor[v[num][i]]; } for (int i = 0; i < colaheavy.size(); ++i) { tot += solapacion[num][i] * arrupd[colaheavy[i]]; } cout << tot << endl; } void queryheavy(long long num) { long long tot = resp[num]; for (int i = 0; i < colaheavy.size(); ++i) { tot += solapacion[num][i] * arrupd[colaheavy[i]]; } cout << tot << endl; } int main() { long long n, m, queries, aux, aux2, val, num; ios_base::sync_with_stdio(false); cin.tie(0); string txt; cin >> n >> m >> queries; init(); for (int i = 0; i < n; ++i) { cin >> valor[i]; } for (int i = 0; i < m; ++i) { cin >> aux; light[i] = true; if (aux >= sqrt(100456)) { posheavy[i] = colaheavy.size(); colaheavy.push_back(i); light[i] = false; } resp[i] = 0; for (int j = 0; j < aux; j++) { cin >> aux2; aux2--; resp[i] += valor[aux2]; v[i].push_back(aux2); } } solape(m); for (int i = 0; i < queries; ++i) { cin >> txt; if (txt[0] == ? ) { cin >> val; val--; if (light[val] == true) { querylight(val); } else { queryheavy(val); } } else { cin >> num >> val; if (light[num - 1] == true) { updatelight(num, val); } else { updateheavy(num, val); } } } }

#include <bits/stdc++.h> using namespace std; const int maxn = 201; int a[maxn], N, L, K; double f[maxn][maxn][maxn * 2], p[maxn]; int main() { scanf( %d%d%d , &N, &L, &K); for (int i = 0; i < N; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 0; i < N; ++i) scanf( %d , &a[i]); f[0][0][N + min(N, K)] = 1; for (int i = 0; i < N; ++i) for (int j = 0; j <= N; ++j) for (int k = -N; k <= N; ++k) if (f[i][j][N + k] > 0) { f[i + 1][j + 1][N + min(k + a[i], N)] += p[i] * f[i][j][N + k]; f[i + 1][j][N + k] += (1 - p[i]) * f[i][j][N + k]; } double ans = 0; for (int j = L; j <= N; ++j) for (int k = N; k <= N + N; ++k) ans += f[N][j][k]; cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; set<int> s[100005]; int color[100005]; int main() { int n, m; while (~scanf( %d%d , &n, &m)) { int i, j, tmp = 0; int u, v, ans; for (i = 1; i <= n; i++) scanf( %d , &color[i]); for (j = 0; j < m; j++) { scanf( %d%d , &u, &v); if (color[u] != color[v]) { s[color[v]].insert(color[u]); s[color[u]].insert(color[v]); } } ans = color[1]; for (i = 1; i <= n; i++) { if (s[color[i]].size() > tmp || (s[color[i]].size() == tmp && color[i] < ans)) { tmp = s[color[i]].size(); ans = color[i]; } } printf( %d n , ans); } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const long long INF = 0x3f3f3f3f3f3f3f3f; const long long llinf = (1LL << 61); const int inf = (1 << 30); const int nmax = 4e5 + 50; const int mod = 1e9 + 7; using namespace std; string s; long long n, a[nmax], st[4 * nmax], i, lzy[4 * nmax], x, q, st1[4 * nmax], ms[4 * nmax], msk[nmax], m, ans, j, inv[100], l, r, sv[500], x1; long long pr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; long long pw(long long n, long long p) { long long tmp = n, ans = 1, mx; if (p == mod - 2) mx = 31; else mx = 18; for (int i = 0; i <= mx; i++) { if (p & (1LL << i)) ans = (ans * tmp) % mod; tmp = (tmp * tmp) % mod; } return ans; } void build(int x, int l, int r) { if (l == r) { st[x] = a[l]; st1[x] = msk[l]; return; } int mid = (l + r) / 2; build(2 * x, l, mid); build(2 * x + 1, mid + 1, r); st[x] = st[2 * x] * st[2 * x + 1]; st[x] %= mod; st1[x] = st1[2 * x] | st1[2 * x + 1]; } void push(int nod, int l, int r) { if (!lzy[nod]) return; if (lzy[nod] != 1) st[nod] = (st[nod] * pw(lzy[nod], r - l + 1)) % mod; st1[nod] |= ms[nod]; if (l != r) { if (lzy[nod] != 1) { lzy[nod * 2] *= lzy[nod]; lzy[nod * 2 + 1] *= lzy[nod]; lzy[nod * 2] %= mod; lzy[nod * 2 + 1] %= mod; } ms[nod * 2] |= ms[nod]; ms[nod * 2 + 1] |= ms[nod]; } lzy[nod] = 1; } void upd(int nod, int l, int r, int tl, int tr, long long v, long long m) { push(nod, l, r); if (tl <= l && r <= tr) { lzy[nod] = (lzy[nod] * v) % mod; ms[nod] |= m; push(nod, l, r); return; } int mid = (l + r) / 2; if (tl <= mid) upd(nod * 2, l, mid, tl, tr, v, m); if (mid < tr) upd(nod * 2 + 1, mid + 1, r, tl, tr, v, m); push(nod * 2, l, mid); push(nod * 2 + 1, mid + 1, r); st[nod] = st[nod * 2] * st[nod * 2 + 1]; st[nod] %= mod; st1[nod] = st1[nod * 2] | st1[nod * 2 + 1]; } pair<long long, long long> qry(int nod, int l, int r, int tl, int tr) { push(nod, l, r); if (tl <= l && r <= tr) return {st[nod], st1[nod]}; int mid = (l + r) / 2; pair<long long, long long> vl, x; vl.first = 1, vl.second = 0; if (tl <= mid) { x = qry(nod * 2, l, mid, tl, tr); vl.first = (vl.first * x.first) % mod; vl.second |= x.second; } if (mid < tr) { x = qry(nod * 2 + 1, mid + 1, r, tl, tr); vl.first = (vl.first * x.first) % mod; vl.second |= x.second; } return vl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr.tie(0); cout.tie(0); cin >> n >> q; for (j = 0; j < 62; j++) { inv[j] = pw(pr[j], mod - 2); sv[pr[j]] = j; } for (i = 1; i <= n; i++) { cin >> a[i]; for (j = 0; j < 62; j++) if (a[i] % pr[j] == 0) msk[i] |= (1LL << j); } for (i = 1; i <= 1600000; i++) lzy[i] = 1; build(1, 1, n); while (q--) { cin >> s; if (s[0] == M ) { cin >> l >> r >> x; x1 = x, m = 0; for (j = 0; j < 62; j++) if (x % pr[j] == 0) m |= (1LL << j); upd(1, 1, n, l, r, x, m); } else { cin >> l >> r; pair<long long, long long> p = qry(1, 1, n, l, r); ans = p.first; for (j = 0; j < 62; j++) { if (p.second & (1LL << j)) { ans = (ans * (1 - inv[j] + mod)) % mod; } } cout << ans << endl; } } return 0; }

#include <bits/stdc++.h> using namespace std; int n, m, l; long long dp[250005]; short big_arr[250005], small_arr[5001]; long long pre[51], sum[51], suf[51], mx[51], maxx = -1e5; long long solve(int indx, long long curSum) { if (indx == m + 1) return -2000; short &i = big_arr[indx]; long long &res = dp[indx]; if (~res) return res; res = pre[i]; if (curSum + sum[i] >= suf[i] && curSum + sum[i] > 0) res = max(res, solve(indx + 1, curSum + sum[i]) + sum[i]); else if (suf[i] > 0) res = max(res, solve(indx + 1, suf[i]) + suf[i] - curSum); else res = max(res, solve(indx + 1, 0) - curSum); return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cin >> n >> m; fill(pre, pre + 51, -1e5); fill(suf, suf + 51, -1e5); fill(mx, mx + 51, -1e5); fill(dp, dp + 250005, -1); for (int i = 0; i < n; i++) { cin >> l; long long tmp = 0; for (int j = 0; j < l; j++) { cin >> small_arr[j]; mx[i] = max((long long)small_arr[j], mx[i]); if (tmp < 0) tmp = 0; tmp += small_arr[j]; mx[i] = max(mx[i], tmp); sum[i] += small_arr[j]; pre[i] = max(pre[i], sum[i]); } tmp = 0; for (int j = l - 1; j >= 0; j--) { tmp += small_arr[j]; suf[i] = max(suf[i], tmp); } } for (int i = 1; i <= m; i++) { cin >> big_arr[i]; big_arr[i]--; maxx = max(mx[big_arr[i]], maxx); } cout << max(solve(1, 0), maxx) << endl; }

#include <bits/stdc++.h> using namespace std; const int mod = 9901; template <class T> int countbit(T n) { int t = 0; while (n) n &= n - 1, ++t; return t; } template <class T> T lowbit(T n) { return n & (-n); } const double eps = 1e-8; const double pi = acos(-1.0); const int INF = 0x7f7f7f7f; const int maxn = 111111; void File() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } long long c[66][66]; long long go(long long n, long long t) { int cnt = 0; long long tt = t; while (tt) tt >>= 1, ++cnt; int arr[65]; int i, size = 0; while (n) arr[size++] = n & 1, n >>= 1; reverse(arr, arr + size); long long ans = 0; bool flag; int ct = count(arr, arr + size, 1); for (i = 0; i < size; ++i) { flag = true; if (arr[i]) { if (size - i == ct && ct == cnt && cnt) ans++, flag = false; else { if (cnt >= 0) ans += c[size - i - 1][cnt], --cnt; } --ct; } if (i && !cnt) { ans++; break; } if (!flag) break; } if (t == 1) ans--; return ans; } int main() { ios::sync_with_stdio(false); int i, j; for (i = 0; i < 66; ++i) { c[i][i] = c[i][0] = 1; } for (i = 1; i < 66; ++i) { for (j = 1; j < i; ++j) { c[i][j] = c[i - 1][j - 1] + c[i - 1][j]; } } long long n, t; cin >> n >> t; int k = countbit(t); if (k == 1) cout << go(n + 1, t) << endl; else cout << 0 << endl; return 0; }

#include <bits/stdc++.h> struct Point { int x, y; Point* next; bool operator<(const Point& p) const { return 1ll * p.x * y < 1ll * x * p.y; } } P[200010], *np = P; std::map<long long, Point*> fir; std::map<Point, int> M; int main() { int q, s = 0; scanf( %d , &q); while (q--) { int t, x, y; scanf( %d%d%d , &t, &x, &y); long long d = 1ll * x * x + 1ll * y * y; if (t == 1) { M[(Point){x, y}]++; for (Point* p = fir[d]; p; p = p->next) M[(Point){x + p->x, y + p->y}] += 2; *np = (Point){x, y, fir[d]}; fir[d] = np++; s++; } if (t == 2) { M[(Point){x, y}]--; if (fir[d] && fir[d]->x == x && fir[d]->y == y) fir[d] = fir[d]->next; ; for (Point* p = fir[d]; p; p = p->next) { if (p->next && p->next->x == x && p->next->y == y) p->next = p->next->next; ; M[(Point){x + p->x, y + p->y}] -= 2; } s--; } if (t == 3) printf( %d n , s - M[(Point){x, y}]); } }

#include <bits/stdc++.h> using namespace std; long long expo(long long x, long long n, long long m) { if (n == 0) return 1; else if (n % 2 == 0) return expo((x * x) % m, n / 2, m); else return (x * expo((x * x) % m, (n - 1) / 2, m)) % m; } string DtoB(int j) { string s = ; for (int i = 32; i >= 0; i--) { int k = j >> i; if (k & 1) s += 1 ; else s += 0 ; } return s; } void solve() { int n; cin >> n; int arr[n]; int s[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; s[i] = arr[i]; } sort(s, s + n); map<int, int> m; for (int i = 0; i < n; i++) m[s[i]] = i; vector<vector<int> > ans; int visit[n]; memset(visit, 0, sizeof(visit)); ; for (int i = 0; i < n; i++) { if (visit[i] == 0) { vector<int> p; for (int j = i; visit[j] == 0; j = m[arr[j]]) { p.push_back(j + 1); visit[j] = 1; } ans.push_back(p); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { cout << ans[i].size() << ; for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j] << ; cout << endl; } return; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) solve(); return 0; }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:320000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T Abs(T n) { return ((n) < 0 ? -(n) : (n)); } template <class T> inline T Max(T x, T y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } template <class T> inline T Min(T x, T y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } template <class T> inline T Swap(T &a, T &b) { a = a ^ b; b = a ^ b; a = a ^ b; } template <class T> inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template <class T> inline T lcm(T a, T b) { return ((a) / gcd((a), (b)) * (b)); } template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); } struct an { int a; int d; bool operator<(const an &t) const { return d < t.d; } }; int main() { int i, j, k, n, a[200]; int miniind, maxiind, maxi, mini; while (scanf( %d , &n) != EOF) { maxi = 0; mini = 200; for (i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] > maxi) { maxi = a[i]; maxiind = i; } if (a[i] < mini) { mini = a[i]; miniind = i; } } printf( %d n , max(n - maxiind - 1, max(maxiind, max(n - miniind - 1, miniind)))); } return 0; }

#include <bits/stdc++.h> using namespace std; int Q, m, n, a[10001], c[100001], ans, f[5001][101], d[1001]; char b[500001][13]; void dfs(int x, int now, int zong, int he) { if (x > n) { if (zong <= 100) f[he][zong] += c[now]; return; } dfs(x + 1, now * 2 + 1, zong + (d[x] == 1 ? a[x] : 0), he); dfs(x + 1, now * 2, zong + (d[x] == 0 ? a[x] : 0), he); } int main() { int i, j, now, t, ha; char s[10001]; scanf( %d%d%d , &n, &m, &Q); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= m; i++) { now = 0; scanf( %s , b[i] + 1); for (j = 1; j <= n; j++) { now = now * 2; if (b[i][j] == 1 ) now++; } c[now]++; } for (i = 0; i < (1 << n); i++) { now = i; ha = 0; for (j = 1; j <= n; j++) { d[j] = now % 2; ha = ha * 2 + d[j]; now /= 2; } dfs(1, 0, 0, ha); } for (i = 0; i < (1 << n); i++) for (j = 1; j <= 100; j++) f[i][j] += f[i][j - 1]; while (Q--) { scanf( %s%d , s + 1, &t); now = 0; for (i = 1; i <= n; i++) now = now * 2 + (s[i] == 1 ); printf( %d n , f[now][t]); } }

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long n, g, b; cin >> n >> g >> b; if (g >= b) { cout << n << endl; continue; } long long good_need = n / 2; if (n % 2 == 1) good_need += 1; good_need -= g; long long bad_poss = n / 2; long long periods = bad_poss / b; if (good_need - periods * g <= 0) { cout << n << endl; continue; } good_need -= periods * g; long long restperiods = good_need / g; long long rest = 0; if (good_need % g != 0) { rest = good_need % g + b; } cout << g + (periods + restperiods) * (g + b) + rest << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c, d; while (scanf( %d , &n) != EOF) { int j, x, y, flag = 0; for (int i = 1; i <= 4; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); a = min(a, b); b = min(c, d); if (a + b <= n) { x = a; y = n - x; j = i; flag = 1; } } if (flag) printf( %d %d %d n , j, x, y); else printf( -1 n ); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int c0, c1, c2, c3; cin >> c0 >> c1 >> c2 >> c3; if (c1 - c0 == c2 - c1 && c2 - c1 == c3 - c2) { cout << c3 + c1 - c0 << endl; } else if (c1 * c1 == c0 * c2 && c2 * c2 == c1 * c3 && !((c3 * c3) % c2)) { cout << c3 * c1 / c0 << endl; } else { cout << 42 << endl; } }

#include <bits/stdc++.h> using namespace std; int w[1501000], cnt[1501000]; int main() { int N, i; int po, ans; scanf( %d , &N); for (int i = (0); i < (N); i++) scanf( %d , w + i); sort(w, w + N); memset(cnt, 0, sizeof(cnt)); for (int i = (0); i < (N); i++) cnt[w[i]]++; po = 0; ans = 0; for (int po = (0); po < (1501000); po++) { if (cnt[po] == 0) continue; cnt[po + 1] += cnt[po] / 2; if (cnt[po] % 2) ans++; } printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int a[510][510]; int d[1010][510]; int d2[1010][510]; int x, y, nr[1010], nr2[1010]; int n, m, i, j, ok; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 1; i <= n; i++) { x = i; y = 1; nr[i] = 0; while (x > 0 && y <= m) { d[i][++nr[i]] = a[x][y]; x--; y++; } sort(d[i] + 1, d[i] + nr[i] + 1); } for (i = 2; i <= m; i++) { x = n; y = i; nr[i + n - 1] = 0; while (x > 0 && y <= m) { d[i + n - 1][++nr[i + n - 1]] = a[x][y]; x--; y++; } sort(d[i + n - 1] + 1, d[i + n - 1] + nr[i + n - 1] + 1); } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 1; i <= n; i++) { x = i; y = 1; nr2[i] = 0; while (x > 0 && y <= m) { d2[i][++nr2[i]] = a[x][y]; x--; y++; } sort(d2[i] + 1, d2[i] + nr2[i] + 1); } for (i = 2; i <= m; i++) { x = n; y = i; nr2[i + n - 1] = 0; while (x > 0 && y <= m) { d2[i + n - 1][++nr2[i + n - 1]] = a[x][y]; x--; y++; } sort(d2[i + n - 1] + 1, d2[i + n - 1] + nr2[i + n - 1] + 1); } ok = 1; for (i = 1; i <= n + m - 1 && ok; i++) { for (j = 1; j <= nr[i] && ok; j++) if (d[i][j] != d2[i][j]) ok = 0; } if (ok) printf( YES ); else printf( NO ); return 0; }

#include <bits/stdc++.h> using namespace std; int h, m, n, vn; map<int, pair<int, int> > M; int group[222222], pos[222222], host[222222]; vector<int> v[222222], first[222222]; inline void add(int i, int x, int d) { int m = first[i].size(); while (x < m) { first[i][x] += d; x = x | (x + 1); } } inline int sum(int i, int x) { int m = first[i].size(), res = 0; while (x >= 0) { res += first[i][x]; x = (x & (x + 1)) - 1; } return res; } int main() { memset(host, -1, sizeof(host)); scanf( %d%d%d n , &h, &m, &n); memset(group, -1, sizeof(group)); for (int i = 0; i < h; ++i) if (group[i] == -1) { for (int j = i; group[j] == -1; j = (j + m) % h) { pos[j] = v[vn].size(); group[j] = vn; v[vn].push_back(j); } ++vn; } for (int i = 0; i < vn; ++i) { first[i].resize(int(v[i].size())); for (int j = 0; j < v[i].size(); ++j) add(i, j, 1); } long long res = 0; for (int i = 0; i < n; ++i) { char ch; int id, hash; scanf( %c %d , &ch, &id); if (ch == + ) { scanf( %d , &hash); int j = group[hash]; int k = pos[hash]; int l = k - 1, r = v[j].size(); int base = sum(j, k - 1); while (r - l > 1) { int mid = (l + r) / 2; if (sum(j, mid) > base) r = mid; else l = mid; } if (r < v[j].size()) { M[id] = make_pair(j, r); add(j, r, -1); res += r - k; } else { l = -1, r = k; while (r - l > 1) { int mid = (l + r) / 2; if (sum(j, mid) > 0) r = mid; else l = mid; } M[id] = make_pair(j, r); add(j, r, -1); res += v[j].size() - k + r; } } else if (ch == - ) { int j = M[id].first; int k = M[id].second; add(j, k, 1); } scanf( n ); } cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int n, Max, reg; int TIME = 0; vector<int> T, W; bool used[1010]; int p[1010], dmg[1010]; int main() { int i, j, k, l, x, y; cin >> n >> Max >> reg; for (i = 0; i < n; ++i) cin >> p[i] >> dmg[i]; int ch = Max, cd = 0; while (1) { ch -= cd; ch = min(Max, ch + reg); if (ch <= 0) break; j = -1; for (i = 0; i < n; ++i) { if (used[i] || p[i] * Max < 100 * ch) continue; if (j == -1 || dmg[j] < dmg[i]) j = i; } if (j != -1 && dmg[j] >= 0) { if (dmg[j] > cd || true) { T.push_back(TIME); W.push_back(j + 1); used[j] = true; cd += dmg[j]; } } ++TIME; if (TIME >= 10000) break; } if (ch > 0) cout << NO n ; else { cout << YES n ; cout << TIME << << T.size() << endl; for (i = 0; i < T.size(); ++i) cout << T[i] << << W[i] << endl; } return 0; }

#include <bits/stdc++.h> const int maxn = 1e5 + 10; const int N = 2e5; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qmul(long long p, long long q, long long mo) { long long f = 0; while (q) { if (q & 1) f = (f + p) % mo; p = (p + p) % mo; q >>= 1; } return f; } long long qpow(long long p, long long q) { long long f = 1; while (q) { if (q & 1) f = f * p % 19260817; p = p * p % 19260817; q >>= 1; } return f; } int n, m, k, t; int main() { int i, j; scanf( %d , &n); for (i = n;; i--) { if (n % i) continue; j = i; int cnta = 0, cntb = 0; while (j && j % 2 == 0) cnta++, j /= 2; while (j && j % 2 == 1) cntb++, j /= 2; if (!j && cntb == cnta + 1) return 0 * printf( %d n , i); } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 65; long long S, L, ans; long long P[N] = {1}; long long f[N][N * 2][2]; int main() { scanf( %lld , &S); L = log2(S + 1); for (int i = 1; i < N; ++i) P[i] = P[i - 1] << 1; for (int h = 1; h <= L; ++h) { long long x = S % (P[h] - 1); for (int i = h; i; --i) if (x >= P[i] - 1) x -= P[i] - 1; ans += (!x); } for (int h0 = 1; h0 < L; ++h0) for (int h1 = 1; S + 1 - P[h1] >= P[h0 + 1] + P[h1 + 1] - 3; ++h1) { long long x = (S + 1 - P[h1]) / (P[h0 + 1] + P[h1 + 1] - 3); long long r = (S + 1 - P[h1]) % (P[h0 + 1] + P[h1 + 1] - 3); if (!r) { ans++; continue; } if (h0 == 1 && h1 == 1) { ans += (S == x * 5 + 1); continue; } for (int n = 1; n <= h0 + h1; ++n) { long long C = r + n, L = log2(C) + 1; if (C & 1) continue; memset(f[0], 0, sizeof f[0]); f[0][0][0] = 1; for (int i = 1; i <= L; ++i) { int d = (C >> i) & 1; memset(f[i], 0, sizeof f[i]); for (int j = 0; j <= i + i - 2 && j <= n; ++j) for (int k = 0; k < 2; ++k) if (f[i - 1][j][k]) for (int x = 0; x < 2; ++x) if (!x || i < h0) for (int y = 0; y < 2; ++y) if (!y || i < h1) if (((k + x + y) & 1) == d) f[i][j + x + y][(k + x + y) >> 1] += f[i - 1][j][k]; } ans += f[L][n][0]; } } printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n & 1) { cout << -1; return 0; } if (n < 3) { cout << bb nww n nbb nww ; return 0; } string s1, s2; for (int i = 0; i < 110; i++) s1 += (i % 4 < 2) ? w : b ; s2 = s1.substr(2); s1 = s1.substr(0, n); s2 = s2.substr(0, n); for (int i = 0; i < n; i++) { int x = i & 1; for (int j = 0; j < n; j++) { int y = (j % 4) < 2 ? 1 : 0; if (x ^ y) cout << s1 << n ; else cout << s2 << n ; } cout << n ; } }

#include <bits/stdc++.h> using namespace std; int a[4], i, j, s; int main() { for (i = 0; i < 4; i++) { scanf( %d , &a[i]); s += a[i]; } for (i = 0; i < 4; i++) { if (a[i] == s - a[i]) { puts( YES ); return 0; } for (j = i + 1; j < 4; j++) if (a[i] + a[j] == s - a[i] - a[j]) { puts( YES ); return 0; } } puts( NO ); return 0; }

#include <bits/stdc++.h> using namespace std; static inline void amin(int &a, int b) { if (a > b) a = b; } int main() { int N, M; scanf( %d%d , &N, &M); int A[N]; for (int i = 0; i < N; ++i) { scanf( %d , &A[i]); } pair<int, int> Q[M]; for (int i = 0; i < M; ++i) { scanf( %d%d , &Q[i].first, &Q[i].second); Q[i].first--; Q[i].second--; } int res = *max_element(A, A + N) - *min_element(A, A + N); list<int> res_q; int changes[N]; for (int mx = 0; mx < N; ++mx) { list<int> q; memset(changes, 0, sizeof changes); for (int i = 0; i < M; ++i) if (mx < Q[i].first || Q[i].second < mx) { q.push_back(i); for (int j = Q[i].first; j < Q[i].second + 1; ++j) changes[j]--; } int mn = numeric_limits<int>::max(); for (int i = 0; i < N; ++i) amin(mn, A[i] + changes[i]); if (res < A[mx] - mn) { res = A[mx] - mn; res_q = q; } } printf( %d n%d n , res, (int)res_q.size()); for (auto it : res_q) printf( %d , it + 1); printf( n ); return 0; }

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) template <class T, class U> istream &operator>>(istream &in, pair<T, U> &p) { in >> p.first >> p.second; return in; } template <class T, class U> ostream &operator<<(ostream &out, const pair<T, U> &p) { out << p.first << << p.second; return out; } template <class T> istream &operator>>(istream &in, vector<T> &v) { for (auto &i : v) { in >> i; } return in; } template <class T> ostream &operator<<(ostream &out, const vector<T> &v) { for (auto &i : v) { out << i << ; } return out; } inline void io(int x = 15) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); srand(time(0)); cout << fixed << setprecision(x); } vector<int> prefix_function(string s) { int n = s.length(); vector<int> pi(n); for (int i = 1; i < n; ++i) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) { j = pi[j - 1]; } if (s[i] == s[j]) ++j; pi[i] = j; } return pi; } bool prime_test(long long n) { for (long long i = 2; i * i <= n; ++i) if ((n >= 0 && n < 2) || n % i == 0) return false; return true; } void prime_nums(int n, vector<char> &prime) { prime[0] = prime[1] = false; for (long long i = 2; i * i <= n; ++i) { if (prime[i]) { for (int j = i * i; j <= n; j += i) { prime[j] = false; } } } } long long bin_pow(long long a, long long b, long long m = 0) { if (m == 0) return b == 0 ? 1 : (b % 2 ? bin_pow(a, b - 1) * a : bin_pow(a * a, b / 2)); if (b == 0) return 1; long long temp = bin_pow(a, b / 2, m); if (b % 2 == 0) return (temp * temp) % m; else return (a * temp * temp) % m; } bool nextperm(vector<char> &a) { int n = a.size(); for (int i = n - 2; i >= 0; --i) { if (a[i] < a[i + 1]) { int mnv = a[i + 1], mni = i + 1; for (int j = i + 2; j < n; ++j) { if (a[j] < mnv && a[j] > a[i]) { mni = j; mnv = a[j]; } } swap(a[i], a[mni]); reverse(a.begin() + i + 1, a.end()); return true; } } return false; } int main() { io(); int n, s; cin >> n >> s; vector<int> used(n); for (int i = 0; i < n - 1; ++i) { int l, r; cin >> l >> r; ++used[--l]; ++used[--r]; } int x = 0; for (int i = 0; i < n; ++i) { if (used[i] == 1) { ++x; } } cout << (long double)s / x * 2; return 0; }

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n; long long len[1000005]; long long pai[1000005]; string s; long long find(long long x) { if (pai[x] == x) return x; return pai[x] = find(pai[x]); } void merge(long long a, long long b) { long long paiA = find(a), paiB = find(b); pai[paiB] = paiA; } int32_t main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0); cin >> n >> s; long long p = 0, b = 0; pai[0] = 0; for (long long i = 1; i <= n; i++) { pai[i] = i; if (s[i - 1] == 1 ) { p++; b = 0; } else if (s[i - 1] == 0 ) { b++; p = 0; } else { p++, b++; } len[i - 1] = max(p, b); } for (long long i = 1; i <= n; i++) { long long res = 0, pos = 0; while (pos < n) { pos += i - 1; while (pos < n and len[pos] < i) { merge(pos + 1, pos); pos = find(pos); } if (pos >= n) break; pos++; res++; } cout << res << ; } cout << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int const bound = 2e6 + 2, N = 5e5 + 2; long long OO = 1e18; double eps = 1e-6; int oo = 1e9, mod = oo + 7; pair<int, int> can[101]; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.first > b.first.first; return a.first.second < b.first.second; } int main() { int n, m, k, a; cin >> n >> k >> m >> a; for (int(i) = 0; (i) < (a); (i)++) { int g; cin >> g; g--; can[g].first++; can[g].second = i; } for (int(i) = 0; (i) < (n); (i)++) { pair<pair<int, int>, int> tmp[101]; for (int(j) = 0; (j) < (n); (j)++) tmp[j] = {can[j], j}; int sv = tmp[i].first.second; tmp[i].first.first += m - a; if (m - a) tmp[i].first.second = m; sort(tmp, tmp + n, cmp); bool no = 1; for (int(j) = 0; (j) < (k); (j)++) { if (tmp[j].first.first && tmp[j].second == i) { no = 0; break; } } if (no) { cout << 3 << ; continue; } int to = -1, rem = m - a; for (int(j) = 0; (j) < (n); (j)++) if (tmp[j].second == i) { tmp[j].first.first -= m - a; tmp[j].first.second = sv; } sort(tmp, tmp + n, cmp); for (int(j) = 0; (j) < (n); (j)++) { if (to != -1) { if (rem < to - tmp[j].first.first + 1) break; rem -= to - tmp[j].first.first + 1; tmp[j].first.first += to - tmp[j].first.first + 1; tmp[j].first.second = m; } if (tmp[j].second == i) to = tmp[j].first.first; } sort(tmp, tmp + n, cmp); no = 1; for (int(j) = 0; (j) < (k); (j)++) if (tmp[j].first.first && tmp[j].second == i) no = 0; if (no) cout << 2 << ; else cout << 1 << ; } return 0; }

#include <bits/stdc++.h> using namespace std; int z[26][200001], w[26]; int main() { int n, m, i, j, a, le; char str[200001]; scanf( %d %d , &n, &m); scanf( %s , str); for (i = 0; str[i]; i++) { z[str[i] - a ][w[str[i] - a ]] = i; w[str[i] - a ]++; } long long ans; int mi; while (n) { n--; ans = 0; scanf( %s , str); le = strlen(str); for (i = 0; str[i]; i++) { a = str[i] - a ; if (w[a] == 0) ans += le; else { mi = abs(i - z[a][0]); ; for (j = 1; j < w[a]; j++) { mi = min(mi, abs(i - z[a][j])); } ans += mi; } } printf( %lld n , ans); } return 0; }

#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 + 100; const long double eps = 1e-11; const long double pi = acos(-1.0L); int myrand() { return rand(); } unsigned rdtsc() { unsigned ans; asm( rdtsc : =a (ans)); return ans; } int rnd(int x) { return myrand() % x; } void precalc() {} int n, k; int a, b, c, d; bool read() { if (scanf( %d%d , &n, &k) < 2) { return false; } scanf( %d%d%d%d , &a, &b, &c, &d); return true; } void solve() { if (n <= 4 || k < n + 1) { printf( -1 n ); return; } vector<int> path; for (int i = 1; i <= n; i++) { if (i != a && i != b && i != c && i != d) { path.push_back(i); } } printf( %d %d , a, c); for (int i = 0; i < ((int)((path).size())); i++) { printf( %d , path[i]); } printf( %d %d n , d, b); printf( %d %d , c, a); for (int i = 0; i < ((int)((path).size())); i++) { printf( %d , path[i]); } printf( %d %d n , b, d); } int main() { srand(rdtsc()); precalc(); while (true) { if (!read()) { break; } solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; cout << a[0]; for (int e = 1; e < a.size(); e++) if (a[e] < b[0]) cout << a[e]; else break; cout << b[0] << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } map<int, int> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != j) { ++m[a[i] + a[j]]; } } } int Max = 0; for (auto it = m.begin(); it != m.end(); it++) { Max = max(it->second / 2, Max); } cout << Max; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, t; string In; vector<char> Que; cin >> n >> t >> In; for (char x : In) { Que.push_back(x); } for (int i = 0; i < t; i++) { for (int x = 0; x < n; x++) { if (Que[x] == B && Que[x + 1] == G ) { Que[x] = G ; Que[x + 1] = B ; x++; } } } for (char x : Que) { cout << x; } return 0; }

#include <bits/stdc++.h> using namespace std; const int SIZE = 100011; const int MAX = 1e9; int mi[SIZE << 2], a[SIZE]; void init(int L, int R, int id) { mi[id] = MAX; if (L == R) return; int mm = (L + R) >> 1; init(L, mm, id << 1); init(mm + 1, R, (id << 1) + 1); } void ins(int L, int R, int id, int x, int v) { if (L == R) { mi[id] = v; return; } int mm = (L + R) >> 1; if (x <= mm) ins(L, mm, id << 1, x, v); else ins(mm + 1, R, (id << 1) + 1, x, v); mi[id] = min(mi[id << 1], mi[(id << 1) | 1]); } int qq(int L, int R, int id, int l1, int rr) { if (L >= l1 && R <= rr) return mi[id]; if (R < l1 || L > rr) return MAX; int mm = (L + R) >> 1; return min(qq(L, mm, id << 1, l1, rr), qq(mm + 1, R, (id << 1) | 1, l1, rr)); } int main() { int n, s, l; scanf( %d%d%d , &n, &s, &l); init(0, n, 1); ins(0, n, 1, 0, 0); multiset<int> H; int lt = 1, an; for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); a[i] = x; H.insert(x); while (*H.rbegin() - *H.begin() > s) { H.erase(H.find(a[lt++])); } if (i - lt + 1 >= l) { ins(0, n, 1, i, an = qq(0, n, 1, lt - 1, i - l) + 1); } else an = MAX; } if (an >= MAX) puts( -1 ); else printf( %d n , an); return 0; }

#include <bits/stdc++.h> using namespace std; int n, start, x; pair<int, int> ask(int v) { printf( ? %d n , v); fflush(stdout); int value, nxt; scanf( %d %d , &value, &nxt); return pair<int, int>(value, nxt); } const int RANDOM_Q = 1000; int main() { srand(time(NULL)); scanf( %d %d %d , &n, &start, &x); vector<int> v; for (int i = int(1); i < int(n + 1); i++) { v.push_back(i); } random_shuffle(v.begin(), v.end()); vector<int> randoms; for (int i = int(0); i < int(min(RANDOM_Q, (int)v.size())); i++) { randoms.push_back(v[i]); } int ans = (int)2e9; int possible_start = start, start_val = -1; for (auto &each : randoms) { pair<int, int> p = ask(each); if (p.first >= x && p.first < ans) { ans = p.first; } else if (p.first < x && p.first > start_val) { possible_start = p.second; start_val = p.first; } } int cur = possible_start; for (int i = 0; cur != -1 && i < 1999 - RANDOM_Q; i++) { pair<int, int> p = ask(cur); if (p.first >= x) { ans = p.first; break; } cur = p.second; } printf( ! %d n , ans == (int)2e9 ? -1 : ans); fflush(stdout); return 0; }

#include <bits/stdc++.h> using namespace std; int a[4][4], kk; bool ok; int main() { for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) scanf( %d , &a[i][j]); kk = max(a[0][1] + a[0][2], max(a[1][0] + a[1][2], a[2][0] + a[2][1])) + 100000; for (int i = a[0][1] + a[0][2] + 1; i <= kk; ++i) { a[0][0] = i - a[0][1] - a[0][2]; a[1][1] = i - a[1][0] - a[1][2]; a[2][2] = i - a[2][0] - a[2][1]; ok = true; for (int j = 0; j < 3 && ok; ++j) ok &= (a[0][j] + a[1][j] + a[2][j] == i); ok &= (a[0][0] + a[1][1] + a[2][2] == i && a[0][2] + a[1][1] + a[2][0] == i); if (ok) break; } for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) printf( %d , a[i][j]); printf( n ); } return 0; }

#include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; int t; cin>>t; while(t--) { ll n,x,s=0,a=1; cin>>n>>x; ll arr[n]; for(int i=0; i<n; i++) { cin>>arr[i]; } int mn=100000000,gg=mn,ind=-1; for(int i=0; i<n; i++) { int y=arr[i],cnt=0; while(!(y%x)) { y/=x; cnt++; } if(cnt<mn) { mn=cnt; ind=i; } } for(int i=0; i<n; i++) { if(i<ind) gg=mn+1; else gg=mn; s+=arr[i]; a=1; while(((arr[i]%x)==0)&&(gg--)) { a*=x; arr[i]/=x; s+=a*arr[i]; } } cout<<s<< n ; } }

#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; int c = 0; for (int j = 0; j < str.length(); j++) { if (str[j] == @ ) { c = c + 1; } } if (c == 0) { cout << No solution << endl; } else if (c > 0) { int c1 = 1; int i = 0; for (; i < str.length(); i++) { char ch = str[i]; if (ch == @ and (i == 0 or i == (str.length() - 1))) { break; } else if (ch == @ and (i > 0 and i < (str.length() - 1))) { char ch1 = str[i - 1]; char ch2 = str[i + 1]; if (ch1 == , or ch2 == , ) { break; } if (ch1 != , and ch2 != , and c1 != c) { string str1 = str.substr(0, i + 2); string str2 = str.substr(i + 2); str = str1 + , + str2; c1 = c1 + 1; } if (ch1 != , and ch2 != , and c1 == c) { continue; } } } if (i < str.length()) { cout << No solution << endl; } if (i >= str.length()) { cout << str << endl; } } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) { v[i] = make_pair(h[i], i); } sort(v.begin(), v.end()); sort(h.begin(), h.end()); h.erase(unique(h.begin(), h.end()), h.end()); if (n - h.size() < 2) { cout << NO << endl; return 0; } else { cout << YES << endl; } map<int, int> x; for (int i = 0; i + 1 < n; i++) { if (v[i].first == v[i + 1].first) { x[v[i].first] += 1; } } int type = x.size(); for (int i = 0; i < 3; i++) { if (i == 0) { for (int j = 0; j < n; j++) { printf( %d , v[j].second + 1); } printf( n ); } else { if (type == 1) { vector<pair<int, int> >::iterator it = lower_bound(v.begin(), v.end(), make_pair(x.begin()->first, -1)); swap(v[it - v.begin()], v[it - v.begin() + i]); for (int j = 0; j < n; j++) { printf( %d , v[j].second + 1); } printf( n ); } else { vector<pair<int, int> >::iterator it = lower_bound(v.begin(), v.end(), make_pair(x.begin()->first, -1)); x.erase(x.begin()); swap(v[it - v.begin()], v[it - v.begin() + 1]); for (int j = 0; j < n; j++) { printf( %d , v[j].second + 1); } printf( n ); } } } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; int a[N]; int main() { long long ans = 0, ones = 0, k; string s; cin >> k >> s; a[0] = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) ones++, a[ones] = i; if (ones >= k) { if (k != 0) ans += a[ones - k + 1] - a[ones - k]; else if (s[i] == 0 ) ans += i - a[ones]; } } cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, p = 1e9 + 7; int n, cnt[26], inv[N], fac[N], finv[N]; char a[N], b[N]; inline int solve(char *s) { int ans = 0, noans = fac[n]; memset(cnt, 0, sizeof cnt); for (int i = 1; i <= n; ++i) ++cnt[a[i] - a ]; for (int i = 0; i < 26; ++i) noans = 1ll * noans * finv[cnt[i]] % p; for (int i = 1; i <= n; ++i) { int v = s[i] - a ; noans = 1ll * noans * inv[n - i + 1] % p; for (int c = 0; c < v; ++c) if (cnt[c]) { noans = 1ll * noans * cnt[c] % p; ans = (ans + noans) % p; noans = 1ll * noans * inv[cnt[c]] % p; } if (!cnt[v]) return ans; noans = 1ll * noans * cnt[v] % p; --cnt[v]; } return ans; } int main() { scanf( %s%s , a + 1, b + 1); n = strlen(a + 1); fac[0] = 1; for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % p; inv[0] = inv[1] = 1; for (int i = 2; i <= n; ++i) inv[i] = 1ll * inv[p % i] * (p - p / i) % p; finv[0] = 1; for (int i = 1; i <= n; ++i) finv[i] = 1ll * inv[i] * finv[i - 1] % p; printf( %d , (solve(b) - solve(a) - 1 + p) % p); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; vector<long long> vis(n); for (int i = 0, ggdem = m; i < ggdem; ++i) { long long a, b, c; cin >> a >> b >> c; a--; b--; c--; vis[b] = 1; } long long ve = -1; for (int i = 0, ggdem = n; i < ggdem; ++i) { if (vis[i] == 0) ve = i; } for (int i = 0, ggdem = n; i < ggdem; ++i) { if (i != ve) { cout << i + 1 << << ve + 1 << n ; } } } return 0; }

#include <bits/stdc++.h> int main() { unsigned long long int n, sum = 0, sum1 = 0, i, MAX = 0, temp; scanf( %llu , &n); int a[n]; for (i = 0; i < n; ++i) { scanf( %llu , &a[i]); } for (i = 0; i < n; ++i) { sum = sum + a[i]; } for (i = 0; i < n; ++i) { if (a[i] > MAX) { MAX = a[i]; } } for (i = 0; i < n; ++i) { if (a[i] == MAX) { break; } } temp = a[n - 1]; a[n - 1] = MAX; a[i] = temp; if (sum % 2 != 0) { printf( NO ); } else { for (i = 0; i < n - 1; ++i) { sum1 = sum1 + a[i]; } if (sum1 >= a[n - 1]) { printf( YES ); } else { printf( NO ); } } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, y; cin >> n >> x >> y; int a[n]; int c = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] <= x) c++; } if (x > y) cout << n << endl; else { if (c % 2 == 0) cout << c / 2 << endl; else cout << (c / 2) + 1 << endl; } }

#include <bits/stdc++.h> using namespace std; int block[101]; int nuclea[101]; int inst[101][101]; int main() { ios_base::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> inst[j][i]; } } for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (nuclea[j] == 0) block[inst[i][j]]++; } block[0] = 0; for (int j = 0; j < n; j++) { if (block[inst[i][j]] > 1 && nuclea[j] == 0) { nuclea[j] = i + 1; } } for (int i = 1; i < 101; i++) { if (block[i] < 2) block[i] = 0; } } for (int i = 0; i < n; i++) cout << nuclea[i] << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 3 * 100 * 1000 + 1000; const int N1 = 5100; long long A[N], n, k; unsigned long long dp[N1][N1]; void read() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> A[i]; sort(A, A + n); for (int i = 0; i < N1; i++) for (int j = 0; j < N1; j++) dp[i][j] = (1 << 31); } int cal(int p, int q) { return p * ((n + k - 1) / k) + q * (n / k) - 1; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); read(); int p = n % k, q = k - n % k; dp[0][0] = 0; for (int i = 0; i <= p; i++) for (int j = 0; j <= q; j++) { int last = cal(i, j); if (i - 1 >= 0) dp[i][j] = min(dp[i][j], dp[i - 1][j] + A[last] - A[last - (n + k - 1) / k + 1]); if (j - 1 >= 0) dp[i][j] = min(dp[i][j], dp[i][j - 1] + A[last] - A[last - (n / k) + 1]); } cout << dp[p][q] << endl; return 0; }

#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-10; template <typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template <typename T> void operator>>(vector<T>& a, int b) { while (b--) if (!a.empty()) a.pop_back(); } bool isprime(int n) { if (n < 2) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } long long b_pow(long long x, long long n) { return n ? n == 1 ? x : b_pow(x, n >> 1) * b_pow(x, (n >> 1) + (n & 1)) : 1; } string itos(int n) { stringstream ss; ss << n; return ss.str(); } string table[119] = { - , H , He , Li , Be , B , C , N , O , F , Ne , Na , Mg , Al , Si , P , S , Cl , Ar , K , Ca , Sc , Ti , V , Cr , Mn , Fe , Co , Ni , Cu , Zn , Ga , Ge , As , Se , Br , Kr , Rb , Sr , Y , Zr , Nb , Mo , Tc , Ru , Rh , Pd , Ag , Cd , In , Sn , Sb , Te , I , Xe , Cs , Ba , La , Ce , Pr , Nd , Pm , Sm , Eu , Gd , Tb , Dy , Ho , Er , Tm , Yb , Lu , Hf , Ta , W , Re , Os , Ir , Pt , Au , Hg , Tl , Pb , Bi , Po , At , Rn , Fr , Ra , Ac , Th , Pa , U , Np , Pu , Am , Cm , Bk , Cf , Es , Fm , Md , No , Lr , Rf , Db , Sg , Bh , Hs , Mt , Ds , Rg , Cn , Uut , Uuq , Uup , Uuh , Uus , Uuo }; vector<int> item, goal, able[17]; int n, m; void output(int bit, int num) { vector<string> ans; for (int i = 0; i < n; i++) if (bit & (1 << i)) ans.push_back(table[item[i]]); for (int i = 0; i < ans.size(); i++) cout << (i ? + : ) << ans[i]; cout << -> << table[goal[num]] << endl; } vector<int> currentUsing; bool done[1 << 17][17]; bool dfs(int pos, int bit) { if (pos == m) { cout << YES << endl; for (int i = 0; i < pos; i++) output(currentUsing[i], i); return true; } if (done[bit][pos]) return false; else done[bit][pos] = 1; for (int i = 0; i < able[pos].size(); i++) { if (bit & able[pos][i]) continue; currentUsing.push_back(able[pos][i]); if (dfs(pos + 1, bit | able[pos][i])) return true; currentUsing.pop_back(); } return false; } int main() { cin >> n >> m; string tmp; for (int i = 0; i < n; i++) cin >> tmp, item.push_back(find(table, table + 119, tmp) - table); for (int i = 0; i < m; i++) cin >> tmp, goal.push_back(find(table, table + 119, tmp) - table); for (int i = 0; i < m; i++) { for (int bit = 0; bit < (1 << n); bit++) { int sum = 0; for (int j = 0; j < n; j++) if (bit & (1 << j)) sum += item[j]; if (sum == goal[i]) able[i].push_back(bit); } } if (!dfs(0, 0)) cout << NO << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 100005; const int mod = 998244353; int a[N], s[N], f[N][105], b[N][105]; inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; return; } template <typename T> inline void chkmax(T &x, T y) { x = max(x, y); } template <typename T> inline void chkmin(T &x, T y) { x = min(x, y); } template <typename T> inline void read(T &x) { T f = 1; x = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -f; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - 0 ; x *= f; } int main() { int n, k, len; read(n), read(k), read(len); if (len == 1) { printf( 0 n ); return 0; } s[0] = 1; for (int i = 1; i <= n; ++i) read(a[i]); for (int i = 1; i <= n; ++i) for (int j = 1; j <= k; ++j) if (a[i] == j || a[i] == -1) b[i][j] = 1; for (int j = 1; j <= k; ++j) for (int i = 1; i <= n; ++i) b[i][j] += b[i - 1][j]; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= k; ++j) { if (~a[i] && a[i] != j) continue; f[i][j] = s[i - 1]; if (i >= len && b[i][j] - b[i - len][j] == len) add(f[i][j], (f[i - len][j] - s[i - len] + mod) % mod); add(s[i], f[i][j]); } } printf( %d n , s[n]); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 100005; int head[N], Next[N], ver[N], tot; inline void add(int u, int v) { ver[++tot] = v, Next[tot] = head[u], head[u] = tot; } int pa[N][25], top[N], son[N], dep[N], ans, n, L; long long sum[N], w[N], S; inline void init(int u) { for (int i = 1; i <= 20; ++i) pa[u][i] = pa[pa[u][i - 1]][i - 1]; int dis = L, tmp = u; for (int i = 20; i >= 0; --i) { int fa = pa[tmp][i]; if (!fa || (1 << i) >= dis) continue; if (sum[u] - sum[fa] + w[fa] > S) continue; dis -= (1 << i), top[u] = fa, tmp = fa; } } void dfs1(int u, int fa) { sum[u] = sum[fa] + w[u], top[u] = u, dep[u] = dep[fa] + 1, init(u); for (int i = head[u]; i; i = Next[i]) dfs1(ver[i], u); } void dfs2(int u) { int mx = -1; for (int i = head[u]; i; i = Next[i]) { int v = ver[i]; dfs2(v); if (son[v] == v) continue; if (mx == -1 || dep[mx] > dep[son[v]]) mx = son[v]; } if (mx == -1) ++ans, mx = top[u]; son[u] = mx; } int main() { scanf( %d%d%lld , &n, &L, &S); for (int i = 1; i <= n; ++i) { scanf( %lld , &w[i]); if (w[i] > S) return puts( -1 ), 0; } for (int i = 2, f; i <= n; ++i) scanf( %d , &f), add(f, i), pa[i][0] = f; dfs1(1, 0), dfs2(1); printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 9; vector<pair<int, int> > barr[N]; int n, q, arr[N], a, b; long long t[N], ans[N]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; scanf( %d , &q); int kok = sqrt(n); for (int i = 1; i <= q; i++) { scanf( %d %d , &a, &b); if (b > kok) { for (int j = a; j <= n; j += b) ans[i] += arr[j]; } else barr[b].push_back(make_pair(a, i)); } for (int i = 1; i <= kok; i++) { if (barr[i].size()) { for (int j = n; j >= 1; j--) t[j] = arr[j] + t[(i + j) * (i + j <= n)]; for (int j = 0; j < barr[i].size(); j++) ans[barr[i][j].second] = t[barr[i][j].first]; } } for (int i = 1; i <= q; i++) printf( %lld n , ans[i]); return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxN = 5e5 + 5; int m, k, n, s; vector<int> a; int c[maxN], h[maxN]; int main(int argc, char *argv[]) { cin >> m >> k >> n >> s; a.resize(m + 1); for (int i = 1; i <= m; ++i) cin >> a[i]; int total = 0; for (int i = 0; i < s; ++i) { int x; cin >> x; c[x]++; if (c[x] == 1) total++; } int cur_s = 0; vector<int> ans; bool found = false; for (int l = 1, r = 1; l + k - 1 <= m; ++l) { while ((cur_s < total && r <= m) || r - l + 1 <= k) { h[a[r]]++; if (h[a[r]] == c[a[r]]) cur_s++; r++; } if (cur_s == total && (l - 1) / k + (m - r + 1) / k + 1 >= n) { found = true; int to_remove = r - l - k; for (int i = l; to_remove > 0 && i < r; ++i) { if (h[a[i]] > c[a[i]]) { to_remove--; ans.emplace_back(i); h[a[i]]--; } } break; } if (h[a[l]] == c[a[l]]) cur_s--; h[a[l]]--; } if (found == false) cout << -1 << endl; else { cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) { if (i > 0) cout << ; cout << ans[i]; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long a; cin >> a; cout << (a + a / 2) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const char nl = n ; const long long mod = 1e9 + 7; long long bigmod(long long a, long long b) { if (b == 0) return 1; long long ans = bigmod(a, b / 2); ans = (ans * ans) % mod; if (b & 1) ans *= a; return ans % mod; } void solve() { long long n; cin >> n; cout << (bigmod(4, pow(2, n) - 2) * 6) % mod << nl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; while (t--) { solve(); } }