func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int MAXN = 32, MAXS = 1 << 17; const int MOD = 1e9 + 7, H = 3137; int add(int a, int b) { a += b; if (a >= MOD) a -= MOD; return a; } int sub(int a, int b) { a -= b; if (a < 0) a += MOD; return a; } int mul(int a, int b) { return (int)(((long long)a * b) % MOD); } int n, T; string s[MAXN]; int len[MAXN]; int poz_s[MAXN]; vector<pair<int, pair<int, int> > > V[MAXS]; int __h[MAXS], pot[MAXS]; int *h = __h + 5; int geth(int l, int ln) { return sub(h[l + ln - 1], mul(h[l - 1], pot[ln])); } int ok(int a, int poza, int b) { int kol = min(len[b], len[a] - poza); return geth(poz_s[a] + poza, kol) == geth(poz_s[b], kol); } int slj_poz(int a, int poza, int b) { if (!ok(a, poza, b)) return -1; if (poza + len[b] == len[a]) return T; if (poza + len[b] < len[a]) return poz_s[a] + poza + len[b]; return poz_s[b] + len[a] - poza; } char ss[MAXS]; void load() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , ss); s[i] = ss; len[i] = (int)s[i].size(); poz_s[i] = !i ? 0 : (poz_s[i - 1] + len[i - 1]); for (int j = 0; j < len[i]; j++) h[j + poz_s[i]] = add(mul(h[j + poz_s[i] - 1], H), s[i][j]); } T = poz_s[n - 1] + len[n - 1]; } void gen() { for (int i = 0; i < n; i++) V[T].push_back({poz_s[i], pair<int, int>(i, i)}); for (int a = 0; a < n; a++) { for (int b = 0; b < n; b++) { for (int poza = 0; poza < len[a]; poza++) { if (!poza && s[a] == s[b]) continue; int tmp = slj_poz(a, poza, b); if (tmp != -1) V[poz_s[a] + poza].push_back( {tmp, pair<int, int>(min(a, b), max(a, b))}); } } } } int bio[MAXS]; int dfs(int node, int l, int r) { if (bio[node]) return bio[node] == 1; bio[node] = 1; for (auto it : V[node]) if (it.second.first >= l && it.second.second <= r && dfs(it.first, l, r)) return 1; bio[node] = 2; return 0; } int nema_cik(int l, int r) { memset(bio, 0, sizeof bio); for (int i = 0; i < T + 1; i++) if (!bio[i] && dfs(i, l, r)) return 0; return 1; } void solve() { int rje = 0; gen(); for (int i = 0, j = 0; i < n; i++) { j = max(j, i); for (; j < n && nema_cik(i, j); j++) ; rje += j - i; } printf( %d n , rje); } int main() { pot[0] = 1; for (int i = (1); i < (MAXS); i++) pot[i] = mul(pot[i - 1], H); load(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 505; int n, k; int a[MAXN], b[MAXN]; bool f[MAXN][MAXN]; int main() { scanf( %d%d , &n, &k); long long sum_a = 0, sum_b = 0; for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i], &b[i]); sum_a += a[i]; sum_b += b[i]; } f[0][0] = true; for (int i = 1; i <= n; i++) { for (int j = 0; j < k; j++) { f[i][j] = f[i - 1][j]; for (int x = 0; x <= k; x++) { if (x <= a[i] && (k - x) <= b[i]) { f[i][j] = f[i][j] || f[i - 1][(j + k - x) % k]; } } } } long long ans = sum_a / k + sum_b / k; for (int x = 1; x < k; x++) { if (f[n][x]) { ans = max(ans, (sum_a - x) / k + (sum_b - (k - x)) / k + 1); } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using ii = pair<int, int>; using ll = long long; using li = pair<ll, int>; const int MAXK = 5000; struct jump { int node, prime, count; }; int n; vector<int> k; int fact_node[MAXK + 1]; vector<map<int, ii>> children; vector<int> primes; bool not_prime[MAXK + 1]; int node_count = 0; vector<vector<ii>> adjl; vector<int> deg; vector<ll> cost; vector<int> cnt; vector<bool> active; int active_nodes; void fill_primes() { for (int i = 2; i < MAXK; ++i) { if (not_prime[i]) continue; primes.push_back(i); for (int j = i * i; j < MAXK; j += i) { not_prime[j] = true; } } } int add_node() { children.emplace_back(); return node_count++; } void get_factors(int x, vector<ii> &factors) { int pi = 0; while (x > 1) { if (pi == factors.size()) factors.emplace_back(primes[pi], 0); while (x % primes[pi] == 0) { factors[pi].second++; x /= primes[pi]; } ++pi; } } void build_tree() { fill_primes(); queue<jump> q; fact_node[0] = fact_node[1] = add_node(); q.push({0, 0, 0}); vector<ii> factors; for (int i = 2; i <= MAXK; ++i) { get_factors(i, factors); while (q.front().node) q.pop(); int fi = factors.size() - 1; while (q.front().prime) { if (q.front().prime != factors[fi].first) break; if (q.front().count != factors[fi].second) break; q.push(q.front()); q.pop(); --fi; } int node = q.front().node; if (q.front().prime == factors[fi].first) { int last_node = q.front().node; int prime = factors[fi].first; int to_add = factors[fi].second - q.front().count; int child = children[last_node][prime].second; int new_child = add_node(); children[child][prime] = ii(to_add, new_child); q.push({node, prime, factors[fi].second}); node = new_child; --fi; } q.pop(); while (fi >= 0) { int prime = factors[fi].first; int count = factors[fi].second; int new_child = add_node(); children[node][prime] = ii(count, new_child); q.push({node, prime, count}); node = new_child; --fi; } q.push({node, 0, 0}); fact_node[i] = node; } } void visit(int node) { for (auto it : children[node]) { int weight = it.second.first; int child = it.second.second; adjl[node].emplace_back(child, weight); adjl[child].emplace_back(node, weight); ++deg[node]; ++deg[child]; visit(child); } } void build_graph() { adjl.resize(node_count); deg.resize(node_count, 0); active.resize(node_count, true); cost.resize(node_count, 0LL); cnt.resize(node_count, 0); active_nodes = node_count; for (auto it : k) { ++cnt[fact_node[it]]; } visit(0); } ii get_active_neigh(int node) { for (auto it : adjl[node]) { if (active[it.first]) { return it; } } } ll solve() { priority_queue<ii> pq; for (int i = 0; i < node_count; ++i) { if (deg[i] == 1) { pq.push({-cnt[i], i}); } } while (!pq.empty()) { ii cur = pq.top(); pq.pop(); int node = cur.second; if (!deg[node]) return cost[node]; active[node] = false; --active_nodes; ii edge = get_active_neigh(node); int neigh = edge.first; ll new_cost = -(ll)cur.first * edge.second; cnt[neigh] += cnt[node]; cost[neigh] += cost[node] + new_cost; if (--deg[neigh] == 1) { edge = get_active_neigh(neigh); pq.push({-cnt[neigh], neigh}); } } } int main() { ios_base::sync_with_stdio(false); cin >> n; k.resize(n); for (int i = 0; i < n; ++i) cin >> k[i]; build_tree(); build_graph(); cout << solve() << n ; return 0; } |
#include <bits/stdc++.h> const int bufSize = 1e6; inline char nc() { return getchar(); static char buf[bufSize], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, bufSize, stdin), p1 == p2) ? EOF : *p1++; } template <typename T> inline T read(T& r) { static char c; static int flag; flag = 1, r = 0; for (c = nc(); !isdigit(c); c = nc()) if (c == - ) flag = -1; for (; isdigit(c); c = nc()) r = r * 10 + c - 48; return r *= flag; } const int maxn = 3e5 + 100; const int inf = 1 << 30; int n, m, up, cnt; struct node { int pos, id; } A[maxn << 1]; inline bool cmp(const node& a, const node& b) { return a.pos != b.pos ? a.pos < b.pos : a.id < b.id; } int f[1 << 9], popc[1 << 9]; int vis[15]; int main() { read(n), read(m), read(up); for (int i = 1, l, r; i <= n; ++i) read(l), read(r), A[++cnt].pos = l, A[cnt].id = i, A[++cnt].pos = r + 1, A[cnt].id = -i; std::sort(A + 1, A + 1 + cnt, cmp); for (int i = 1; i < (1 << up); ++i) f[i] = -inf, popc[i] = popc[i >> 1] ^ (i & 1); for (int i = 1; i < cnt; ++i) { int len = A[i + 1].pos - A[i].pos, k; if (A[i].id > 0) { for (int j = 0; j < 8; ++j) if (!vis[j]) { vis[j] = A[i].id, k = j; break; } for (int j = (1 << up) - 1; j >= 0; --j) if (j & (1 << k)) f[j] = f[j ^ (1 << k)] + len * popc[j]; else f[j] = f[j] + len * popc[j]; } else { for (int j = 0; j < 8; ++j) if (vis[j] == -A[i].id) { vis[j] = 0, k = j; break; } for (int j = 0; j < (1 << up); ++j) if (j & (1 << k)) f[j] = -inf; else f[j] = std::max(f[j], f[j ^ (1 << k)]) + len * popc[j]; } } int res = 0; for (int i = 0; i < (1 << up); ++i) res = std::max(res, f[i]); printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; while (cin >> n >> m) { long long num, sum = 0, minx = 1000000001; for (long long i = 0; i < n; i++) { cin >> num; sum += num; if (num < minx) minx = num; } if (sum < m) cout << -1 << endl; else if (minx < (sum - m) / n) { cout << minx << endl; } else cout << (sum - m) / n << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; const int P = 1048576 + 10; const int Y = 30; int vis[N]; int cnt; int book[N]; int a[N]; int n; int m; int k; int addis[Y][Y]; int dis[N]; int dp[P]; queue<int> q; inline void bfs(int s) { for (int i = 1; i <= n + 1; i++) dis[i] = 0x3f3f3f3f; dis[s] = 0; int nw; int i = 1; for (q.push(s); !q.empty();) for (nw = q.front(), q.pop(), i = 1; i <= m; i++) { int v1 = nw + a[i]; if (v1 <= n + 1 && dis[v1] == 0x3f3f3f3f) dis[v1] = dis[nw] + 1, q.push(v1); int v2 = nw - a[i]; if (v2 >= 1 && dis[v2] == 0x3f3f3f3f) dis[v2] = dis[nw] + 1, q.push(v2); } for (int i = 1; i <= n + 1; i++) if (vis[i] != -1) addis[vis[s]][vis[i]] = dis[i]; } int main() { scanf( %d%d%d , &n, &k, &m); for (int i = 1, t; i <= k; i++) { scanf( %d , &t); book[t] = 1; } for (int i = 1; i <= m; i++) scanf( %d , &a[i]); for (int i = n + 1; i >= 1; i--) book[i] ^= book[i - 1]; cnt = -1; for (int i = 1; i <= n + 1; i++) vis[i] = -1; for (int i = 1; i <= n + 1; i++) if (book[i]) vis[i] = ++cnt; for (int i = 1; i <= n + 1; i++) if (book[i]) bfs(i); for (int i = 1; i < (1 << (cnt + 1)); i++) dp[i] = 0x3f3f3f3f; for (int i = 0; i < (1 << (cnt + 1)); i++) { if (dp[i] == 0x3f3f3f3f) continue; for (int j = 0; j <= cnt; j++) { if ((i >> j) & 1) continue; for (int k = j + 1; k <= cnt; k++) if (((i >> k) & 1) == 0) dp[i + (1 << j) + (1 << k)] = min(dp[i + (1 << j) + (1 << k)], dp[i] + addis[j][k]); } } int ans = dp[(1 << (cnt + 1)) - 1]; printf( %d , (ans == 0x3f3f3f3f) ? -1 : ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int t, n, m; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> t; while(t--) { cin >> n; vector<int> pancake(n, 0); for(int i = 0; i < n; i++) { cin >> m; if(!m) continue; if(i - (m - 1) >= 0) pancake[i - (m - 1)] = max(pancake[i - (m - 1)], m); else pancake[0] = max(pancake[0], i + 1); } int prev = 0; for(int i = 0; i < n; i++) { if(prev) prev--; prev = max(prev, pancake[i]); cout << (prev ? 1 : 0) << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 10010; const double eps = 1e-12; struct point { int x, y, op, id; int u, v; long long operator*(const point &r) const { return (long long)u * r.v - (long long)v * r.u; } } a[N << 1], s; int n; int ans[N]; inline bool cmp(point x, point y) { return x * y > 0; } inline void solve(int l, int r) { if (l > r) return; for (int k = l; k <= r; k++) if (a[k].y < a[l].y || (a[k].y == a[l].y && a[k].x < a[l].x)) swap(a[l], a[k]); for (int k = l; k <= r; k++) { a[k].u = a[k].x - a[l].x; a[k].v = a[k].y - a[l].y; } sort(a + l + 1, a + r + 1, cmp); int x = 0, y = 0, mid = 0; for (int k = l; k <= r; k++) { if (a[k].op == 0) x++; else y++; if (x == y && a[k].op != a[l].op && max(k - l - 1, r - k) < max(mid - l - 1, r - mid)) mid = k; } if (a[l].op == 0) ans[a[l].id] = a[mid].id; else ans[a[mid].id] = a[l].id; solve(l + 1, mid - 1), solve(mid + 1, r); return; } int main() { scanf( %d , &n); for (int k = 1; k <= n; k++) { scanf( %d%d , &a[k].x, &a[k].y); a[k].op = 0; a[k].id = k; } for (int k = 1; k <= n; k++) { scanf( %d%d , &a[k + n].x, &a[k + n].y); a[k + n].op = 1; a[k + n].id = k; } solve(1, 2 * n); for (int k = 1; k <= n; k++) printf( %d n , ans[k]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; int a[n], b[n]; int r1 = 0, r2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; r1 |= a[i]; } for (int i = 0; i < n; i++) { cin >> a[i]; r2 |= a[i]; } cout << r1 + r2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; const int maxn = 5000 + 5; long long cnt[maxn + 10]; long long p[maxn + 10][maxn + 10]; long long pd[maxn + 10]; int main() { memset(cnt, 0, sizeof(cnt)); int n; scanf( %d , &n); for (int i = (1); i <= (n); i++) { int u; scanf( %d , &u); cnt[u]++; } for (int i = (2); i <= (maxn); i++) { for (int j = (1); j <= (i); j++) p[i][j] += p[i - 1][j]; int mm = sqrt(i), tem = i; for (int j = (2); j <= (mm); j++) { while (tem % j == 0) { p[i][j]++; tem /= j; } } if (tem > 1) p[i][tem]++; } long long ans = 0, cur = 0; for (int i = (1); i <= (maxn); i++) { if (!cnt[i]) { pd[i] = 1; continue; } for (int j = (1); j <= (i); j++) { ans += p[i][j] * cnt[i]; cur += p[i][j] * cnt[i]; if (p[i][j]) pd[i] = j; } } while (*max_element(pd, pd + maxn + 10) > 1) { long long f[maxn + 10]; memset(f, 0, sizeof(f)); for (int i = (1); i <= (maxn); i++) f[pd[i]] += cnt[i]; long long besp = max_element(f, f + maxn + 10) - f; long long besg = f[besp]; if (besg * 2 <= n || besp == 1) break; cur += n - 2 * besg; ans = min(ans, cur); for (int i = (1); i <= (maxn); i++) { if (pd[i] != besp) pd[i] = 1; if (pd[i] == 1) continue; p[i][besp] -= 1; while (pd[i] > 1 && p[i][pd[i]] == 0) pd[i]--; } } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char buf[1 << 20], *p1, *p2; template <typename T> inline void read(T &t) { register int v = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++); T f = 1; t = 0; while (!isdigit(v)) { if (v == - ) f = -1; v = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++); } while (isdigit(v)) { t = t * 10 + v - 48; v = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++); } t *= f; } template <typename T, typename... Args> inline void read(T &t, Args &...args) { read(t); read(args...); } const int N = 100001; const int M = 200010; template <typename T> inline T min(T x, T y) { return x < y ? x : y; } template <typename T> inline T max(T x, T y) { return x > y ? x : y; } int to[M], hd[N], nxt[M], tot; inline void add(int u, int v) { to[++tot] = v; nxt[tot] = hd[u]; hd[u] = tot; } inline void addedge(int u, int v) { add(u, v), add(v, u); } long long son[N], siz[N], cnt[N], col[N], sum, Son, maxx, n, ans[N]; void dfs1(int u, int f) { siz[u] = 1; son[u] = 0; for (int i = hd[u]; i; i = nxt[i]) { int v = to[i]; if (v != f) { dfs1(v, u); siz[u] += siz[v]; if (siz[v] > siz[son[u]]) { son[u] = v; } } } } void add(int u, int f, int val) { cnt[col[u]] += val; if (cnt[col[u]] > maxx) maxx = cnt[col[u]], sum = col[u]; else if (cnt[col[u]] == maxx) sum += col[u]; for (int i = hd[u]; i; i = nxt[i]) { int v = to[i]; if (v != f && v != Son) { add(v, u, val); } } } void dfs2(int u, int f, int opt) { for (int i = hd[u]; i; i = nxt[i]) { int v = to[i]; if (v != f && v != son[u]) { dfs2(v, u, 0); } } if (son[u]) dfs2(son[u], u, 1), Son = son[u]; add(u, f, 1), Son = 0; ans[u] = sum; if (opt == 0) add(u, f, -1), sum = maxx = 0; } signed main() { read(n); for (int i = 1; i <= n; ++i) read(col[i]); for (int i = 1; i < n; ++i) { int x, y; read(x, y); addedge(x, y); } dfs1(1, 0); dfs2(1, 0, 0); for (int i = 1; i <= n; ++i) printf( %lld , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double Pi = 3.141592653; const long long mod = 1e6 + 3; class Graph { map<int, vector<int>> ma; public: void addedge(int n, int m) { ma[n].push_back(m); ma[m].push_back(n); } }; int main() { long long n; cin >> n; long long a, b, c; cin >> a >> b >> c; long long plastic; if (a <= b - c and n >= a) { plastic = n / a; cout << plastic; return 0; } long long glass = (n - c) / (b - c); if (glass < 0) glass = 0; long long t = n - glass * (b - c); glass += (t / a); cout << glass; return 0; } |
#include <bits/stdc++.h> char *fs, *ft, buf[1 << 20]; inline int read() { int x = 0, f = 1; char ch = (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft)) ? 0 : *fs++; ; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft)) ? 0 : *fs++; ; } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft)) ? 0 : *fs++; ; } return x * f; } using namespace std; int a[1009]; int main() { int t; cin >> t; while (t--) { int n; int z0 = 0, z1 = 0, bo = 0; cin >> n; cin >> a[1]; for (int i = 2; i <= n; i++) { cin >> a[i]; if (a[i] < a[i - 1]) bo = 1; } for (int i = 1; i <= n; i++) { int k; cin >> k; if (k == 0) z0++; else z1++; } if (bo == 0) { cout << Yes << endl; continue; } else { if (z0 == 0 || z1 == 0) cout << No << endl; else cout << Yes << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int RNG = 1000003; const int RNGT = RNG * 4; const int MOD1 = 1e9 + 7; const int MOD2 = 1e9 + 87; const double pi = 2 * acos(0.0); inline int _Int() { int x; scanf( %d , &x); return x; } inline long long _LLi() { long long x; scanf( %lld , &x); return x; } void pruts() { puts( -1 ); exit(EXIT_SUCCESS); } int dirX[] = {1, 0, -1, 0, 1, -1, 1, -1}; int dirY[] = {0, 1, 0, -1, 1, -1, -1, 1}; int rX[] = {1, 1, 2, 2, -1, -1, -2, -2}; int rY[] = {2, -2, 1, -1, 2, -2, 1, -1}; template <class T> T tri_Area(T x1, T y1, T x2, T y2, T x3, T y3) { return abs(x1 * (y2 - y3) - y1 * (x2 - x3) + (x2 * y3 - x3 * y2)); }; template <class T> T Distance(T x1, T y1, T x2, T y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }; template <class T> T bigMod(T n, T p, T m) { if (p == 0) return 1; if (p & 1) return (n * bigMod(n, p - 1, m)) % m; T x = bigMod(n, p / 2, m); return (x * x) % m; }; int Case; int sset(int N, int pos) { return N = N | (1 << pos); } bool check(int N, int pos) { return (bool)(N & (1 << pos)); } int reset(int N, int pos) { return N = N & ~(1 << pos); } int A[RNG], n, m, flag; string str[600]; void Hunger() { n = _Int(); m = _Int(); for (int i = 0; i < n; i++) cin >> str[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (str[i][j] == W ) { int x = i + 1; if (x < n && x >= 0) { if (str[x][j] == . ) str[x][j] = D ; if (str[x][j] == S ) { cout << No << endl; return; } } x = i - 1; if (x < n && x >= 0) { if (str[x][j] == . ) str[x][j] = D ; if (str[x][j] == S ) { cout << No << endl; return; } } x = j + 1; if (x < m && x >= 0) { if (str[i][x] == . ) str[i][x] = D ; if (str[i][x] == S ) { cout << No << endl; return; } } x = j - 1; if (x < m && x >= 0) { if (str[i][x] == . ) str[i][x] = D ; if (str[i][x] == S ) { cout << No << endl; return; } } } } } cout << Yes << endl; for (int i = 0; i < n; i++) cout << str[i] << endl; } int main() { Hunger(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline int cMin(T& a, T b) { return b < a ? a = b, 1 : 0; } template <class T> inline int cMax(T& a, T b) { return a < b ? a = b, 1 : 0; } template <class T> inline string to_str(T v) { ostringstream os; os << v; return os.str(); } const double pi = acos(-1.0); const double eps = 1e-9; template <class T> inline T isqr(T v) { return v * v; } template <class T> inline T iabs(T v) { return v < 0 ? -v : v; } template <class T> inline int isgn(T v) { return iabs(v) <= eps ? 0 : (v < 0 ? -1 : 1); } template <typename T> inline T next() { static char buf[64]; scanf( %s , buf); istringstream is(buf); T v; is >> v; return v; } inline int nextInt() { int v = 0; scanf( %d , &v); return v; } const int NN = 2 * 100000 + 16; int N, A[NN], B[NN]; int idx[NN]; int main(int argc, char* argv[]) { scanf( %d , &N); for (int i = 0; i < (int)(N); ++i) scanf( %d , A + i); for (int i = 0; i < (int)(N); ++i) scanf( %d , B + i); for (int i = 0; i < (int)(N); ++i) idx[B[i]] = i; int n = N; for (int i = 1; i < N; ++i) { if (idx[A[i - 1]] > idx[A[i]]) { n = i; break; } } printf( %d n , N - n); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxm = 1e6; int pre[maxm * 2 + 10]; bool a[maxm + 10]; int N; int main(int argc, const char* argv[]) { scanf( %d , &N); for (int i = 1; i <= N; i++) { int val; scanf( %d , &val); pre[val] = -1; a[val] = true; } int small = 0; int big = small; while (big <= maxm * 2) { while (big <= maxm * 2 && pre[big] != -1) { big++; } for (int i = small + 1; i <= big; i++) { pre[i] = small; } small = big; } int ans = 0; for (int i = 1; i <= maxm; i++) { if (!a[i]) continue; for (int j = i + i; j <= maxm * 2; j += i) { ans = max(ans, pre[j] % i); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> e[100500]; bool visited[100500]; int main() { int n, m; scanf( %d%d , &n, &m); if (m != n - 1) { cout << no << endl; return 0; } for (int i = 0; i < m; i++) { int u, v; scanf( %d%d , &u, &v); u--; v--; e[u].push_back(v); e[v].push_back(u); } visited[0] = true; list<int> sp; sp.push_back(0); while (sp.begin() != sp.end()) { int u = sp.front(); sp.pop_front(); for (int i = 0; i < e[u].size(); i++) { int v = e[u][i]; if (!visited[v]) sp.push_back(v); visited[v] = true; } } for (int i = 0; i < n; i++) if (!visited[i]) { cout << no << endl; return 0; } cout << yes << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; vector<double> gr, le; vector<long long> gri, lei; vector<long long> grind, leind; for (long long i = 0; i < n; ++i) { double t; cin >> t; if (t >= 0) { gr.push_back(t); grind.push_back(i); } else { le.push_back(-t); leind.push_back(i); } } long long gz = 0, lz = 0; long long gsum = 0, lsum = 0; for (double t : gr) { if (floorl(t) != t) gz++; gsum += floorl(t); gri.push_back(floorl(t)); } for (double t : le) { if (floorl(t) != t) lz++; lsum += floorl(t); lei.push_back(floorl(t)); } vector<long long> ans(n); if (gsum <= lsum) { long long add = lsum - gsum; for (long long i = 0; i < gr.size() && add > 0; ++i) { if (floorl(gr[i]) != gr[i]) { add--; gri[i]++; } } } else { long long add = gsum - lsum; for (long long i = 0; i < le.size() && add > 0; ++i) { if (floorl(le[i]) != le[i]) { add--; lei[i]++; } } } for (long long i = 0; i < gr.size(); ++i) { ans[grind[i]] = gri[i]; } for (long long i = 0; i < le.size(); ++i) { ans[leind[i]] = -lei[i]; } for (long long t : ans) cout << t << n ; } |
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; int n; bool good(int x) { int res = x; while (x > 0) { res += x % 10; x /= 10; } return (res == n); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; vector<int> ans; for (int m = n; m >= max(1, n - 100000); m--) { if (good(m)) { ans.emplace_back(m); } } int len = ans.size(); sort(ans.begin(), ans.end()); cout << len << n ; for (int i = 0; i < len; i++) { cout << ans[i] << (i == len - 1 ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; int n, q, a[N]; int rt[N * 20], ls[N * 20], rs[N * 20], sum[N * 20], cnt = 0; void change(int pre, int& o, int l, int r, int pos) { o = ++cnt; ls[o] = ls[pre]; rs[o] = rs[pre]; sum[o] = sum[pre] + 1; if (l == r) return; int m = (l + r) / 2; if (pos <= m) change(ls[pre], ls[o], l, m, pos); else change(rs[pre], rs[o], m + 1, r, pos); } int query(int pre, int o, int l, int r, int k) { if (l == r) return l; int m = (l + r) / 2; if (sum[ls[o]] - sum[ls[pre]] > k) { int res = query(ls[pre], ls[o], l, m, k); if (res != -1) return res; } if (sum[rs[o]] - sum[rs[pre]] > k) { int res = query(rs[pre], rs[o], m + 1, r, k); if (res != -1) return res; } return -1; } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); change(rt[i - 1], rt[i], 1, n, a[i]); } while (q--) { int l, r, k; scanf( %d%d%d , &l, &r, &k); int ans = query(rt[l - 1], rt[r], 1, n, (r - l + 1) / k); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void PrintVector(vector<int> v2, string s) { cout << s; for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } void PrintVector(vector<int> v2) { for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } int isOdd(int x) { return (x % 2); } int toInt(string str) { int num; istringstream iss(str); iss >> num; return num; } template <class T> string toStr(T par) { ostringstream oss; oss << par; return oss.str(); } void readVector(vector<int> &vec, int len) { for (int i = 0; i < len; i++) { cin >> vec[i]; } } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } bool sortPairsCmp(const pair<int, int> &a, const pair<int, int> &b) { return a.second > b.second; } multiset<int> arr; int main() { long long n, x, y; long long hours = 0; cin >> n >> x; for (int i = 0; i < n; i++) { cin >> y; arr.insert(y); } for (auto t : arr) { hours += (x * t); if (x > 1) x--; } cout << hours << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int dirx[] = {1, -1, 0, 0, 1, 1, -1, -1}, diry[] = {0, 0, 1, -1, 1, -1, 1, -1}; bool Set(int n, int pos) { return bool(n & (1 << pos)); } int32_t main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; string a, b; cin >> a >> b; int dp[n + 1][m + 1], ans = -1; memset(dp, 0, sizeof(dp)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j] = max(0, max(dp[i - 1][j], dp[i][j - 1]) - 1); if (a[i - 1] == b[j - 1]) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 2); ans = max(ans, dp[i][j]); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = URDL ; long long ln, lk, lm; void etp(bool f = 0) { puts(f ? YES : NO ); exit(0); } void addmod(int& x, int y, int mod = 998244353) { assert(y >= 0); x += y; if (x >= mod) x -= mod; assert(x >= 0 && x < mod); } void et(int x = -1) { printf( %d n , x); exit(0); } long long fastPow(long long x, long long y, int mod = 998244353) { long long ans = 1; while (y > 0) { if (y & 1) ans = (x * ans) % mod; x = x * x % mod; y >>= 1; } return ans; } long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; } vector<int> mp[200135]; int d[200135], tar; vector<int> dp[200135]; pair<int, int> tmp; void dfs(int x, int pa) { d[x] = d[pa] + 1; dp[x].clear(); for (int c : mp[x]) if (c != pa) { dfs(c, x); int v = dp[c][0]; if (dp[x].size() <= 1) { dp[x].push_back(v); if (dp[x].size() == 2 && d[dp[x][0]] < d[dp[x][1]]) { swap(dp[x][0], dp[x][1]); } } else if (d[v] > d[dp[x][0]]) { dp[x][1] = dp[x][0]; dp[x][0] = v; } else if (d[v] > d[dp[x][1]]) { dp[x][1] = v; } } if (dp[x].empty()) dp[x].push_back(x); if (dp[x].size() == 2) { pair<int, int> key = {d[x], d[dp[x][0]] + d[dp[x][1]]}; if (key > tmp) { tmp = key; tar = x; } } } void fmain(int tid) { scanf( %d , &n); for (int i = 0, u, v; i < n - 1; i++) { scanf( %d%d , &u, &v); mp[u].push_back(v); mp[v].push_back(u); }; tmp = {-1, -1}; dfs(1, 0); vector<int> ans(4); ans[0] = dp[tar][0]; ans[2] = dp[tar][1]; tmp = {-1, -1}; dfs(tar, 0); ans[1] = dp[tar][0]; ans[3] = dp[tar][1]; for (int(i) = 0; (i) < (int)(4); (i)++) printf( %d , ans[i]); } int main() { int t = 1; for (int(i) = 1; (i) <= (int)(t); (i)++) { fmain(i); } return 0; } |
#include <bits/stdc++.h> int a[55]; using namespace std; int main() { int n, m, k, i, t = 0, cnt; scanf( %d%d%d , &n, &m, &k); if (k >= m) { printf( 0 n ); return 0; } for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n, std::greater<int>()); a[0] += k - 1; t = 0; cnt = 1; for (i = 0; i < n; i++) { if (a[i] > 1 && t + a[i] >= m) { printf( %d n , cnt); return 0; } else { t += a[i] - 1; cnt++; } } if (i == n) printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void seif() { std::ios_base::sync_with_stdio(0); } int xa[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1}; int ya[] = {1, 0, -1, 1, 0, -1, 1, 0, -1}; int anx, any, marx, mary; bool ok = false; char grid[8][8]; bool valid(int x, int y) { if (x < 0 || y < 0 || x > 7 || y > 7 || ok) return false; return true; } void check(int cx, int cy, int deg) { if (cx == 0 && cy == 7) { cout << WIN ; ok = true; } if (ok) return; for (int i = 0; i < 9; i++) { int mtx = cx + xa[i]; int mty = cy + ya[i]; if (!valid(mtx, mty)) continue; if (mtx - deg >= 0 && grid[mtx - deg][mty] == S ) continue; if (mtx - deg - 1 >= 0 && grid[mtx - deg - 1][mty] == S ) continue; check(mtx, mty, deg + 1); } return; } int main() { seif(); bool flag = false; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> grid[i][j]; if (grid[i][j] == S ) flag = true; } } if (!flag) return cout << WIN , 0; check(7, 0, 0); if (!ok) cout << LOSE ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> t; while (t--) { cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int mx, x; mx = 0; for (int i = 1; i < n; i++) { if (arr[i] < arr[i - 1]) { x = arr[i - 1] - arr[i]; if (x > mx) { mx = x; } arr[i] = arr[i - 1]; } } int ans = 0; while (mx != 0) { mx = mx / 2; ans++; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; double eps = 1e-12; template <class T> void swp(T& a, T& b) { T temp = a; a = b; b = temp; } long long ceil_div(long long a, long long b) { return a % b == 0 ? a / b : a / b + 1; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long modex(long long x, unsigned int y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int binarySearch(int arr[], int l, int r, int x) { if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; } const long long MOD = 998244353; const long long mod = 1e9 + 7; void solve() {} int main() { long long n, m; cin >> n >> m; vector<long long> v(n + 2); v[n] = 1ll; for (long long i = n - 1; i > 0ll; --i) { v[i] = v[i + 1]; for (long long j = 2ll; j < n + 1ll; j++) { if (j * i > n) break; v[i] = (v[i] + (v[j * i] - v[min(n, j * (i + 1ll) - 1ll) + 1ll])) % m; } v[i] = (v[i] + v[i + 1ll]) % m; } if (v[1] >= v[2]) { cout << v[1] - v[2]; } else { cout << (m + v[1] - v[2]) % m; } return 0; } |
#include <bits/stdc++.h> using namespace std; void ins(long long int a[], long long int n, long long int i = 0) { for (long long int i = 0; i < n; i++) a[i] = i; } template <typename t> void ins(t a[], long long int n, t b = 0) { for (long long int i = 0; i < n; i++) a[i] = b; } void print(long long int a[], long long int n) { for (long long int i = 0; i < n; i++) cout << a[i] << ; ; cout << endl; } template <typename t> void print(t a[], long long int n) { for (long long int i = 0; i < n; i++) cout << a[i] << ; ; cout << endl; } void po(long long int a[], long long int n) { for (long long int i = 0; i < n; i++) { cin >> a[i]; } } template <typename t> void po(t a[], long long int n) { for (long long int i = 0; i < n; i++) { cin >> a[i]; } } long long int visited[100009]; vector<long long int> a[100009]; long long int n; long long int b[100009]; long long int c[100001]; void start() { cin >> n; for (long long int i = 0; i < n - 1; i++) { cin >> b[i + 1]; a[i + 2].push_back(b[i + 1]); a[b[i + 1]].push_back(i + 2); } for (long long int i = 0; i < n + 3; i++) { visited[i] = 0; c[i] = 0; } } void dfs(long long int s, long long int t) { visited[s] = 1; if (s != 1) c[t + 1] += a[s].size() - 1; else c[t + 1] += a[s].size(); for (long long int i = 0; i < a[s].size(); i++) { if (!visited[a[s][i]]) dfs(a[s][i], t + 1); } } int main() { start(); long long int count = 0; dfs(1, 0); for (long long int i = 0; i < n + 3; i++) { if (c[i] % 2 == 1) { count++; } } cout << count + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, mi, mx; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; long long a[n]; for (int i = 0; i < n && cin >> a[i]; i++) ; cout << abs(a[0] - a[1]) << << abs(a[0] - a[n - 1]) << endl; for (int i = 1; i < n - 1; i++) { cout << min(abs((a[i]) - (a[i - 1])), abs((a[i]) - (a[i + 1]))) << << max(abs((a[i]) - (a[n - 1])), abs((a[i]) - (a[0]))) << endl; } cout << abs((a[n - 1]) - (a[n - 2])) << << abs(a[n - 1] - a[0]); return 0; } |
#include <bits/stdc++.h> using namespace std; string s, t, ts, ans; int pos[10000005], len[10000005], tot; inline string reverse(string s) { string t; t.resize(s.size()); int n = s.size(); for (int i = 0; i < n; i++) t[n - i - 1] = s[i]; return t; } void Duval(const string& s) { int n = s.size(); for (int i = 0; i < n;) { int j = i, k = i + 1; while (s[j] <= s[k]) { if (s[j] == s[k]) ++j; else j = i; ++k; } len[++tot] = k - j; while (i <= j) { pos[tot] = i + k - j - 1; i += k - j; } } } int p[10000005]; void Exkmp(const string& s) { int n = s.size(); int mid = 0, mx = 0; p[0] = n; for (int i = 1; i < n; i++) { if (i <= mx) p[i] = min(p[i - mid], mx - i + 1); while (s[i + p[i]] == s[p[i]]) ++p[i]; if (i + p[i] - 1 > mx) mid = i, mx = i + p[i] - 1; } } int main() { ios::sync_with_stdio(false); cin >> s; t = reverse(s); int k; cin >> k; if (k == 1) return cout << min(s, t), 0; Duval(t); pos[0] = -1; while (k > 2 && tot) { if (len[tot] == 1) { while (tot && len[tot] == 1) ans += t.substr(pos[tot - 1] + 1, pos[tot] - pos[tot - 1]), --tot; --k; } else ans += t.substr(pos[tot - 1] + 1, pos[tot] - pos[tot - 1]), --k, --tot; } if (tot == 0) return cout << ans, 0; if (tot == 1) { string tmp = t.substr(0, pos[1] + 1); tmp = min(tmp, reverse(tmp)); cout << ans + tmp; return 0; } s = reverse(t = t.substr(0, pos[tot] + 1)); ts = t + # + s; Exkmp(ts); string tmp = min(s, t); int cut = 0, n = s.size(); for (int i = 1; i < n; i++) { int cl = min(i - cut, p[n + 1 + cut]); if (cut + cl == i) cl += p[cl]; cl = min(cl, n - cut); if ((cl < i - cut ? s[cut + cl] : t[cut + cl - i]) < t[cl]) cut = i; } tmp = min(tmp, s.substr(0, cut) + t.substr(0, n - cut)); string las = t.substr(pos[tot - 1] + 1, len[tot]); string lass = t.substr(pos[tot - 2] + 1, len[tot]); int st = pos[tot - 1] + 1; string tt = t.substr(st, n - st); string res = t.substr(0, n - tt.size()); tt += min(res, reverse(res)); tmp = min(tmp, tt); if (las == lass) { st = pos[tot - 2] + 1; tt = t.substr(st, n - st); res = t.substr(0, n - tt.size()); tt = tt + min(res, reverse(res)); tmp = min(tmp, tt); } cout << ans + tmp; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> int upmin(T1 &x, T2 v) { if (x > v) { x = v; return 1; } return 0; } template <class T1, class T2> int upmax(T1 &x, T2 v) { if (x < v) { x = v; return 1; } return 0; } const int INF = 0x3f3f3f3f; vector<string> dict; void init() { for (string s; getline(cin, s);) { dict.emplace_back(s); } } int maxlen; void preprocess() { for (int i = 0; i < dict.size(); ++i) { upmax(maxlen, dict[i].size()); } for (int i = 0; i < maxlen + 2; ++i) { cout << * ; if (i + 1 == maxlen + 2) { cout << endl; } } for (int i = 0, t = 0; i < dict.size(); ++i) { cout << * ; int splen = maxlen - dict[i].size(); int ls, rs; if (~splen & 1) { ls = rs = splen / 2; } else { if (t == 0) { ls = (splen - 1) / 2; rs = splen - ls; } else { rs = (splen - 1) / 2; ls = splen - rs; } t ^= 1; } for (int j = 0; j < ls; ++j) { cout << ; } cout << dict[i]; for (int j = 0; j < rs; ++j) { cout << ; } cout << * << endl; } for (int i = 0; i < maxlen + 2; ++i) { cout << * ; if (i + 1 == maxlen + 2) { cout << endl; } } } void solve() {} signed main() { ios::sync_with_stdio(0); init(); preprocess(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long c, hr, hb, wr, wb; cin >> c >> hr >> hb >> wr >> wb; long long res = 0; for (long long w = 0; w < 2; ++w) { for (long long i = 0; i * wr <= c && i <= 10000000; ++i) { res = max(res, i * hr + hb * ((c - i * wr) / wb)); } swap(hb, hr); swap(wb, wr); } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; string s; cin >> s; int l = 0, r = s.length() - 1; int cnt = 0; set<int> s1; while (l < r) { if (s[l] == ( ) { while (l < r && s[r] == ( ) { r--; } if (s[r] == ) ) { cnt = 1; s1.insert(l + 1); s1.insert(r + 1); } } else if (s[r] == ) ) { while (l < r && s[l] == ) ) { l++; } if (s[l] == ( ) { cnt = 1; s1.insert(l + 1); s1.insert(r + 1); } } l++; r--; } cout << cnt << n ; if (cnt) { cout << s1.size() << n ; for (auto it = s1.begin(); it != s1.end(); it++) { cout << *it << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[500007]; int l[500007]; int r[500007]; long long ans = 0; pair<int, int> p[500007]; void input() { scanf( %d , &n); int i; for (i = 0; i < n; i++) { scanf( %d , &a[i]); p[i].first = a[i]; p[i].second = i; } sort(p, p + n); } void solve() { if (n < 3) { printf( 0 n ); return; } int i; for (i = 0; i < n; i++) { l[i] = i - 1; r[i] = i + 1; } int ind; int x, y; int lo = 0; int hi = n - 1; for (i = 0; i < n - 2; i++) { ind = p[i].second; if (ind == lo) { ans += p[i].first; lo = r[ind]; continue; } if (ind == hi) { ans += p[i].first; hi = l[ind]; continue; } x = l[ind]; y = r[ind]; ans += min(a[x], a[y]); r[x] = y; l[y] = x; } printf( %I64d n , ans); } int main() { input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; void add(int &x, int y) { x = (x + y) % mod; } int mul(int x, int y) { return (long long)x * y % mod; } int pw(int x, int p) { int r = 1; while (p) { if (p & 1) r = mul(r, x); x = mul(x, x); p >>= 1; } return r; } int fac[3602]; int rev[3602]; int nCr(int n, int r) { if (n < r || r < 0) return 0; return mul(fac[n], mul(rev[r], rev[n - r])); } int h, w, n; int chR[3602], chC[3602]; int dpR[3602], dpC[3602]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.precision(30); cout << fixed; fac[0] = 1; for (int i = 1; i <= 3601; ++i) fac[i] = mul(fac[i - 1], i); rev[3601] = pw(fac[3601], mod - 2); for (int i = 3601; i--;) rev[i] = mul(rev[i + 1], i + 1); cin >> h >> w >> n; for (int i = 0; i < n + n; ++i) { int r, c; cin >> r >> c; chR[r] = 1; chC[c] = 1; } chR[h + 1] = chC[w + 1] = 1; vector<int> R, C; int Rcnt = 0, Ccnt = 0; for (int i = 1, p = 0; i <= h + 1; ++i) { if (chR[i]) { if (p) R.push_back(p); p = 0; } else { ++p; ++Rcnt; } } for (int i = 1, p = 0; i <= w + 1; ++i) { if (chC[i]) { if (p) C.push_back(p); p = 0; } else { ++p; ++Ccnt; } } dpR[0] = 1; for (int x : R) { for (int i = 3602; i--;) { if (dpR[i] == 0) continue; for (int j = 1; j + j <= x; ++j) { ; add(dpR[i + j], mul(dpR[i], nCr(x - j, j))); } } } dpC[0] = 1; for (int x : C) { for (int i = 3602; i--;) { if (dpC[i] == 0) continue; for (int j = 1; j + j <= x; ++j) { add(dpC[i + j], mul(dpC[i], nCr(x - j, j))); } } } for (int i = 0; i <= 3600; ++i) { if (dpR[i] != 0) ; } for (int i = 0; i <= 3600; ++i) { if (dpC[i] != 0) ; } int ans = 0; for (int i = 0; i <= 3600; ++i) { for (int j = 0; j <= 3600; ++j) { if (i + i + j > Rcnt) continue; if (i + j + j > Ccnt) continue; int val = mul(dpR[i], dpC[j]); val = mul(val, nCr(Rcnt - i - i, j)); val = mul(val, nCr(Ccnt - j - j, i)); add(ans, mul(val, mul(fac[i], fac[j]))); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> char s[200001]; char pick(char a, char b) { char c; for (c = a ; c == a || c == b; c++) ; return c; } char *handle(char *s) { char *ps = s; for (s += 1; *s; s++) { if (*s == *(s - 1)) *s = pick(*(s - 1), *(s + 1)); } return ps; } int main() { scanf( %s , s); printf( %s n , handle(s)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; long long c[N], d[N]; int main() { long long sum = 0, ans = 0; int n, k; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %lld , &c[i]); sum += c[i]; } for (int i = 1; i <= k; i++) { scanf( %lld , &d[i]); sum -= c[d[i]]; ans += sum * c[d[i]]; c[d[i]] = 0; } for (int i = 2; i <= n; i++) { ans += c[i] * c[i - 1]; } ans += c[1] * c[n]; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; int a[n + 1]; int cnt = 0; for (int i = 1; i < n; ++i) { a[i] = 1; cnt++; } a[n] = s - cnt; s -= cnt; if (s - cnt < 2) { cout << NO << endl; } else { cout << YES << endl; for (int i = 1; i <= n; ++i) cout << a[i] << ; cout << endl; cout << (cnt + 1) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int val_of_op[200]; int n; struct T { string Name, Expr; bool danger; int num[5]; int sum(int a0 = 0, int a1 = 0, int a2 = 0, int a3 = 0) { return num[a0] + num[a1] + num[a2] + num[a3]; } } macro[1000]; void Eliminate_Space(string &s) { int p; while ((p = s.find( )) != string::npos) s.erase(s.begin() + p); } bool isDigit(char c) { return c >= 0 && c <= 9 ; } bool isLetter(char c) { return c >= a && c <= z || c >= A && c <= Z ; } stack<int> Ope, Num; void Pop(int n) { int y = Num.top(); Num.pop(); int x = Num.top(); Num.pop(); int z = Ope.top(); Ope.pop(); if (x != -1 && macro[x].danger || y != -1 && macro[y].danger) macro[n].danger = 1; if (z == 2 && y != -1 && macro[y].sum(1, 2)) macro[n].danger = 1; if (z == 3) if (y != -1 && macro[y].sum(1, 2) || x != -1 && macro[x].sum(1, 2)) macro[n].danger = 1; if (z == 4) if (x != -1 && macro[x].sum(1, 2) || y != -1 && macro[y].sum(1, 2, 3, 4)) macro[n].danger = 1; Num.push(x); } void doit(int n, string &s) { while (!Ope.empty()) Ope.pop(); while (!Num.empty()) Num.pop(); int p = 0; while (p < ((int)(s).size())) { if (s[p] == ( ) { Ope.push(-1); p++; continue; } if (s[p] == ) ) { while (Ope.top() != -1) Pop(n + 1); Ope.pop(); if (Num.top() != -1 && macro[Num.top()].danger) macro[n + 1].danger = 1; Num.top() = -1; p++; continue; } if (val_of_op[s[p]]) { while (!Ope.empty() && val_of_op[s[p]] <= 2 && Ope.top() >= 3) Pop(n + 1); Ope.push(val_of_op[s[p]]); p++; continue; } string a; while (p < ((int)(s).size()) && (isDigit(s[p]) || isLetter(s[p]))) a.push_back(s[p++]); int i = -1; for (int j = (1); j <= (n); j++) if (macro[j].Name == a) i = j; Num.push(i); } while (!Ope.empty()) macro[n + 1].num[Ope.top()]++, Pop(n + 1); if (Num.top() != -1 && macro[Num.top()].danger) macro[n + 1].danger = 1; } int main() { val_of_op[ + ] = 1, val_of_op[ - ] = 2, val_of_op[ * ] = 3, val_of_op[ / ] = 4; cin >> n; getline(cin, macro[1].Name); for (int i = (1); i <= (n); i++) { getline(cin, macro[i].Name, e ); getline(cin, macro[i].Name, e ); cin >> macro[i].Name; getline(cin, macro[i].Expr); Eliminate_Space(macro[i].Expr); doit(i - 1, macro[i].Expr); } string Expr; getline(cin, Expr); Eliminate_Space(Expr); doit(n, Expr); if (macro[n + 1].danger) puts( Suspicious ); else puts( OK ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 9; int n, sq, a[MAX], group[MAX]; struct Bucket { Bucket() : l(1), r(0) {} int l, r, freq[MAX], cnt; } buckets[320]; void add(int idx, int k) { for (int i = buckets[idx].r + 1; i <= n; ++i) { if (!buckets[idx].freq[a[i]]) { if (buckets[idx].cnt == k) { return; } else { ++buckets[idx].cnt; } } ++buckets[idx].freq[a[i]]; buckets[idx].r = i; } } void del(int idx, int lst) { for (int i = buckets[idx].l; i <= min(buckets[idx].r, lst); ++i) { --buckets[idx].freq[a[i]]; if (!buckets[idx].freq[a[i]]) { --buckets[idx].cnt; } } buckets[idx].l = lst + 1; buckets[idx].r = max(buckets[idx].r, lst); } int naive(int k) { for (int i = 1; i <= n; ++i) { group[i] = 0; } int cnt = 0, curGroup = 1; for (int i = 1; i <= n; ++i) { if (group[a[i]] != curGroup && cnt == k) { ++curGroup; cnt = 0; } if (group[a[i]] != curGroup) { ++cnt; group[a[i]] = curGroup; } } return curGroup; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; sq = (int)sqrt(n + .0); for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int k = 1; k <= sq; ++k) { cout << naive(k) << ; } for (int k = sq + 1; k <= n; ++k) { add(1, k); int lst = buckets[1].r, curBucket = 1; while (lst < n) { ++curBucket; del(curBucket, lst); add(curBucket, k); lst = buckets[curBucket].r; } cout << curBucket << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010, MAXC = 500; int can[MAXC], c = 0; int n, m, a[MAXN], b[MAXN]; int t[MAXN][MAXC]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; memcpy(b, a, sizeof(b)); sort(b, b + n); for (int i = 0; i < n; i++) { int end = i; while (b[end] == b[i]) end++; if (end - i >= b[i]) can[c++] = b[i]; i = end - 1; } for (int i = 0; i < n; i++) { for (int j = 0; j < c; j++) { t[i + 1][j] = t[i][j]; if (a[i] == can[j]) t[i + 1][j]++; } } int l, r; for (int i = 0; i < m; i++) { cin >> l >> r; int ans = 0; for (int j = 0; j < c; j++) if (t[r][j] - t[l - 1][j] == can[j]) ans++; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct exam { long long a; long long b; }; exam a[200000]; long long n, r, avg; bool comp(exam a, exam b) { return a.b < b.b; } int main() { cin >> n >> r >> avg; for (int i = 0; i < n; i++) cin >> a[i].a >> a[i].b; sort(a, a + n, comp); long long needed = n * avg; long long owned = 0; for (int i = 0; i < n; i++) { owned += a[i].a; } needed -= owned; long long answer = 0; int i = 0; while (needed > 0 && i < n) { if (r - a[i].a < needed) { answer += (r - a[i].a) * a[i].b; needed -= (r - a[i].a); } else { answer += (needed)*a[i].b; needed = 0; } i++; } cout << answer << endl; } |
#include <bits/stdc++.h> using namespace std; int n; map<int, int> num; int main() { cin >> n; int minNum = 1000 * 1000 * 1000 + 1; for (int i = 0; i < n; i++) { int tmp; cin >> tmp; num[tmp]++; minNum = min(minNum, tmp); } for (int i = minNum; n > 0; i++) { if (num[i] == 0 || num[i] > num[i + 1]) { cout << NO << endl; return 0; } num[i + 1] -= num[i]; n -= 2 * num[i]; } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> int max(int a, int b) { if (a > b) return a; else return b; } int main() { int t, j; scanf( %d , &t); for (j = 0; j < t; j++) { int n, i, first = 0, last = 0, flagf = 0, count = 0; scanf( %d , &n); char arr[n]; scanf( %s , arr); for (i = 0; i < n; i++) { if (arr[i] == 1 ) { count++; last = i; if (!flagf) { first = i; flagf = 1; } } } if (arr[0] == 1 || arr[n - 1] == 1 ) printf( %d , 2 * n); else { if (!first && !last) printf( %d , 2 * count + (n - count)); else { int k = 2 * (n - first); int l = 2 * (last + 1); int f = max(k, l); printf( %d , f); } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans, l, r, j, cn, ii, ix, p, N = 4e3; vector<long long> A; long long pww(long long a, long long b) { long long r = 1; for (long long i = 1; i <= b; i++) r *= a; return r; } void gen(long long i, long long p) { long long r = 0; for (long long k = 0; k < p; k++) { if (i & (1 << k)) r += pww(10, k) * 7; else r += pww(10, k) * 4; } A.push_back(r); } int main() { cin >> l >> r; while (cn < N) { ii += 1; long long pw = pow(2, ii); for (long long a = 0; a < pw; a++) { gen(a, ii); } cn += pw; } p = l; while (A[j] < l) j++; ix = j; for (ix = j; A[ix] <= r; ix++) { ans += A[ix] * (A[ix] - p + (ix == j ? 1 : 0)); p = A[ix]; } ans += A[ix] * (r - p + (ix == j ? 1 : 0)); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int itr = 0; itr < t; itr++) { int n; vector<int> s; cin >> n; for (int i = 1; i <= n; i++) { int tmp; cin >> tmp; s.push_back(tmp); } int token = 0; for (int i = 0; i < s.size(); i++) { int flag = 0; for (int j = 2; j <= 2 + i; j++) { if (s[i] % j != 0) { flag = 1; break; } } if (flag == 0) { token = 1; break; } } if (token == 1) cout << NO n ; else cout << YES n ; } } |
#include <bits/stdc++.h> using namespace std; map<char, int> freq; vector<int> vec; vector<char> vec2; int main() { int n, k; cin >> n >> k; string s, ans, update, alpha = abcdefghijklmnopqrstuvwxyz ; cin >> s; int size = s.size(); for (int i = 0; i < 26; i++) { for (int j = 0; j < size; j++) { if (k > 0) { if (s[j] == alpha[i]) { k--; s[j] = 0 ; } } } } for (int i = 0; i < size; i++) { if (s[i] != 0 ) { ans += s[i]; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void chkmax(T &x, T y) { x = x > y ? x : y; } template <typename T> void chkmin(T &x, T y) { x = x > y ? y : x; } const int INF = (1ll << 30) - 1; template <typename T> void read(T &x) { x = 0; bool f = 1; char ch; do { ch = getchar(); if (ch == - ) f = 0; } while (ch > 9 || ch < 0 ); do { x = x * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); x = f ? x : -x; } template <typename T> void write(T x) { if (x < 0) x = ~x + 1, putchar( - ); if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } const int N = 3e4 + 5; const int K = 200 + 5; int n, m, a[N], f[N][K][4]; int main() { read(n); read(m); memset(f, -0x3f, sizeof(f)); for (int i = 1; i <= n; i++) read(a[i]); for (int i = 0; i <= n; i++) for (int j = 0; j < 4; j++) f[i][0][j] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { int x = 1 + (j != 1 && j != m); f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j - 1][3]) + x * a[i]; f[i][j][1] = max(f[i][j][0], f[i - 1][j][1]); f[i][j][2] = max(f[i - 1][j][2], f[i - 1][j - 1][1]) - x * a[i]; f[i][j][3] = max(f[i][j][2], f[i - 1][j][3]); if (x == 2) f[i][j][1] = max(f[i][j][1], f[i - 1][j - 1][1]); if (x == 2) f[i][j][3] = max(f[i][j][3], f[i - 1][j - 1][3]); } } int ans = 0; for (int i = 0; i < 4; i++) chkmax(ans, f[n][m][i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int pos, h, ans, id, f; } Do[100001]; int n; int cmd(node a, node b) { return a.pos < b.pos; } int cmd2(node a, node b) { return a.id < b.id; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &Do[i].pos, &Do[i].h); Do[i].id = i; } sort(Do + 1, Do + n + 1, cmd); Do[n].ans = 1; Do[n].f = n; for (int i = n - 1; i >= 1; i--) { Do[i].ans = 1; Do[i].f = i; int next = i + 1; if (Do[i].pos + Do[i].h - 1 < Do[i + 1].pos) continue; while (next <= n) { if (Do[Do[next].f + 1].pos > Do[i].pos + Do[i].h - 1) { Do[i].ans += Do[next].ans; Do[i].f = Do[next].f; break; } else { Do[i].ans += Do[next].ans; Do[i].f = Do[next].f; next = Do[next].f + 1; } } } sort(Do + 1, Do + n + 1, cmd2); for (int i = 1; i <= n; i++) printf( %d , Do[i].ans); } |
#include <bits/stdc++.h> using namespace std; int main() { double fact[51], all = 0.0; fact[0] = 1; for (int i = 1; i < 51; i++) fact[i] = fact[i - 1] * i; int N, A[50], P; double dp[51][51]; cin >> N; for (int i = 0; i < N; i++) cin >> A[i]; cin >> P; int sum = 0; for (int i = 0; i < N; i++) sum += A[i]; if (sum <= P) { cout << N << endl; return (0); } for (int i = 0; i < N; i++) { memset(dp, 0, sizeof(dp)); dp[0][0] = 1; for (int j = 0; j < N; j++) { if (i == j) continue; for (int k = N - 1; k >= 0; k--) { for (int l = P; l >= A[j]; l--) { dp[k + 1][l] += dp[k][l - A[j]]; } } } for (int j = 0; j < N; j++) { for (int k = max(0, P - A[i] + 1); k <= P; k++) { all += fact[j] * fact[N - 1 - j] * dp[j][k] * j; } } } cout << fixed << setprecision(10) << all / fact[N] << endl; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) void scan() {} template <typename F, typename... R> void scan(F& f, R&... r) { cin >> f; scan(r...); } int di_; string dnms_, co_ = , ; void debug_() { cout << endl; } template <typename F, typename... R> void debug_(F& f, R&... r) { while (dnms_[di_] != , ) cout << dnms_[di_++]; di_++; cout << : << f << , ; debug_(r...); } template <class A, class B> ostream& operator<<(ostream& out, const pair<A, B>& a) { return out << ( << a.first << , << a.second << ) ; } template <class A> ostream& operator<<(ostream& out, const vector<A>& a) { out << ; for (auto it = a.begin(); it != a.end(); it++) { if (it != a.begin()) out << ; out << *it; } out << ; return out; } template <class A, class B> istream& operator>>(istream& in, pair<A, B>& a) { in >> a.first >> a.second; return in; } template <class A> istream& operator>>(istream& in, vector<A>& a) { for (A& i : a) in >> i; return in; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<long long int> v(m); cin >> v; vector<long long int> a(n + 2, 0); for (int i = 0; i < m - 1; i++) { long long int xi = v[i]; long long int xi1 = v[i + 1]; if (xi == xi1) continue; if (xi1 < xi) swap(xi1, xi); if (xi > 1) { a[1] += xi1 - xi; a[xi] -= xi1 - xi; } a[xi] += xi1 - 1; a[xi + 1] -= xi1 - 1; if (xi1 - xi - 1 > 0) { a[xi + 1] += xi1 - xi - 1; a[xi1] -= xi1 - xi - 1; } a[xi1] += xi; a[xi1 + 1] -= xi; if ((n - xi1) > 0) { a[xi1 + 1] += xi1 - xi; a[n + 1] -= xi1 - xi; } } for (int i = 1; i < n + 2; ++i) { a[i] += a[i - 1]; } for (int i = 1; i <= n; ++i) { cout << a[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void init_code() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { init_code(); long long t; cin >> t; while (t--) { long long x1, y1, z1; long long x2, y2, z2; cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2; long long ans = 0; if (z1 >= y2) { z1 = z1 - y2; ans = ans + 2 * (y2); y2 = 0; long long f = z1 + x1; if (f <= z2) { z2 = z2 - f; ans = ans - 2 * z2; } } else { ans = ans + 2 * (z1); y2 = y2 - z1; z1 = 0; long long f = z1 + x1; if (f <= z2) { z2 = z2 - f; ans = ans - 2 * z2; } } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; char c[600][600]; int check(int x, int y) { if (c[x][y - 1] == * && c[x][y + 1] == * && c[x + 1][y] == * && c[x - 1][y] == * && c[x][y] == * ) return 1; return 0; } int main() { int m, n; cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> c[i][j]; int x = -1, y = -1; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (check(i, j) == 1) { x = i; y = j; } } if (x == -1 || y == -1) { cout << NO << endl; return 0; } for (int i = x - 1; i >= 0; i--) { if (c[i][y] == * ) { c[i][y] = . ; } else break; } for (int i = x + 1; i < n; i++) { if (c[i][y] == * ) { c[i][y] = . ; } else break; } for (int i = y - 1; i >= 0; i--) { if (c[x][i] == * ) { c[x][i] = . ; } else break; } for (int i = y + 1; i < m; i++) { if (c[x][i] == * ) { c[x][i] = . ; } else break; } c[x][y] = . ; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (c[i][j] == * ) { cout << NO << endl; return 0; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int N; int c[2][MAXN]; int idx[2]; pair<int, int> p[MAXN]; int pn; long long solve() { long long ret = 0; int pre = -1; for (int i = 0; i < N; ++i) idx[i] = 1; while (1) { int opt = 1000000007, x = -1; for (int i = 0; i < N; ++i) { if (idx[i] <= c[i][0]) { if (c[i][idx[i]] < opt && c[i][idx[i]] >= pre) { opt = c[i][idx[i]]; x = i; } } } if (x != -1) { pre = opt; p[pn++] = make_pair(opt, x + 1); ++idx[x]; continue; } opt = 1000000007, x = -1; for (int i = 0; i < N; ++i) { if (idx[i] <= c[i][0]) { if (c[i][idx[i]] < opt) { opt = c[i][idx[i]]; x = i; } } } if (x == -1) return ret; ret += opt < pre; pre = opt; p[pn++] = make_pair(opt, x + 1); ++idx[x]; } } int main() { cin >> N; for (int i = 0; i < N; ++i) { cin >> c[i][0] >> c[i][1]; int x, y, m; cin >> x >> y >> m; for (int j = 2; j <= c[i][0]; ++j) { c[i][j] = (1LL * c[i][j - 1] * x + y) % m; } } cout << solve() << endl; for (int i = 0; i < pn; ++i) { printf( %d %d n , p[i].first, p[i].second); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 505; const int MAXQ = 5000005; int n, m, X1[MAXQ], X2[MAXQ], Y1[MAXQ], Y2[MAXQ]; bool ans[MAXQ]; bitset<MAXN> dp1[MAXN][MAXN], dp2[MAXN][MAXN], temp; char board[MAXN][MAXN]; void dnc(int r1, int r2, vector<int> &que) { if (que.empty() || r1 > r2) return; int mid = (r1 + r2) / 2; for (int i = r1; i <= r2; ++i) { for (int j = 1; j <= m; ++j) { dp1[i][j].reset(); dp2[i][j].reset(); } } for (int i = mid; i >= r1; --i) { for (int j = m; j >= 1; --j) { if (board[i][j] == # ) continue; if (i == mid) dp1[i][j].set(j); else dp1[i][j] |= dp1[i + 1][j]; if (j < m) dp1[i][j] |= dp1[i][j + 1]; } } for (int i = mid; i <= r2; ++i) { for (int j = 1; j <= m; ++j) { if (board[i][j] == # ) continue; if (i == mid) dp2[i][j].set(j); else dp2[i][j] |= dp2[i - 1][j]; if (j > 1) dp2[i][j] |= dp2[i][j - 1]; } } vector<int> q1, q2; for (int i = 0; i < que.size(); ++i) { int pos = que[i]; if (X1[pos] <= mid && X2[pos] >= mid) { temp = (dp1[X1[pos]][Y1[pos]] & dp2[X2[pos]][Y2[pos]]); ans[pos] = temp.any(); } else if (X2[pos] < mid) q1.push_back(pos); else q2.push_back(pos); } dnc(r1, mid - 1, q1); dnc(mid + 1, r2, q2); } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %s , board[i] + 1); int q; vector<int> que; scanf( %d , &q); for (int i = 0; i < q; ++i) { scanf( %d %d %d %d , &X1[i], &Y1[i], &X2[i], &Y2[i]); que.push_back(i); } dnc(1, n, que); for (int i = 0; i < q; ++i) { if (ans[i]) printf( Yes n ); else printf( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> v[3005]; vector<long long> sum[3005]; struct node { int mon; int who; bool operator<(const node &a) const { return mon > a.mon; } }; int main() { int n, m; int p, c; int get; int Max; long long ans; int pos[3005]; while (~scanf( %d%d , &n, &m)) { Max = 0; get = 0; for (int i = 2; i <= m; i++) { v[i].clear(); sum[i].clear(); } for (int i = 0; i < n; i++) { scanf( %d%d , &p, &c); if (p == 1) get++; else { v[p].push_back(c); } } for (int i = 2; i <= m; i++) { long long s = 0; sort(v[i].begin(), v[i].end()); Max = max(Max, (int)v[i].size()); for (int j = 0; j < v[i].size(); j++) { s += v[i][j]; sum[i].push_back(s); } } if (get > Max) { printf( 0 n ); continue; } else { int g; ans = 999999999999999L; for (int i = get; i <= Max; i++) { g = get; long long cost = 0; memset(pos, 0, sizeof(pos)); for (int j = 2; j <= m; j++) { if (i < v[j].size()) { pos[j] = v[j].size() - i; g += pos[j]; cost += sum[j][pos[j] - 1]; } } if (g > i) { ans = min(ans, cost); continue; } priority_queue<node> Q; for (int j = 2; j <= m; j++) { if (pos[j] < v[j].size()) Q.push((node){v[j][pos[j]], j}); } int need = i + 1 - g; while (need) { if (Q.empty()) break; node a = Q.top(); Q.pop(); cost += a.mon; pos[a.who]++; if (v[a.who].size() > pos[a.who]) Q.push((node){v[a.who][pos[a.who]], a.who}); need--; } if (need == 0) ans = min(ans, cost); } printf( %lld n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long k2, k3, k5, k6; long long sum = 0; cin >> k2 >> k3 >> k5 >> k6; long min = k2 < k5 ? k2 < k6 ? k2 : k6 : k5 < k6 ? k5 : k6; sum += min * 256; k2 -= min; k5 -= min; k6 -= min; min = k2 < k3 ? k2 : k3; sum += 32 * min; cout << sum << endl; return 0; } |
#include <bits/stdc++.h> const int maxn = 5e5 + 5; using namespace std; bool vis[maxn]; int a[maxn]; int main() { string s; cin >> s; int k = s.size(); char y = s[0]; int ans = 1; for (int i = 0; i < k; i++) { if (i == 0) { cout << Mike << endl; continue; } if (s[0] < s[i]) { cout << Ann << endl; continue; } if (s[i] > y) { cout << Ann << endl; } else { y = s[i]; cout << Mike << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int tt = 100005; struct edge { edge *nxt; int des; void maker(edge *&a, int b) { nxt = a, des = b; a = this; } } w[tt], *sta[tt], *tot; struct treap { treap *l, *r; int key, sz, ran; } * seg[tt * 4], buf[2000000], *pos; int bg[tt], ed[tt], fa[tt][17], h[tt], ft[tt], now, A, B, Y, n; void dfs(int i) { bg[i] = ++now; for (edge *e = sta[i]; e; e = e->nxt) { h[e->des] = h[i] + 1; dfs(e->des); } ed[i] = now; } void lr(treap *&a) { treap *b = a->r; a->r = b->l; b->l = a; b->sz = a->sz; a->sz = a->l->sz + a->r->sz + 1; a = b; } void rr(treap *&a) { treap *b = a->l; a->l = b->r; b->r = a; b->sz = a->sz; a->sz = a->l->sz + a->r->sz + 1; a = b; } void ins(treap *&a) { if (a == buf) { a = ++pos; a->l = a->r = buf, a->key = Y, a->sz = 1, a->ran = rand() * 32767 + rand(); } else { a->sz++; if (Y > a->key) { ins(a->r); if (a->r->ran > a->ran) lr(a); } else { ins(a->l); if (a->l->ran > a->ran) rr(a); } } } void ins(int now, int l, int r) { if (A <= l && r <= B) ins(seg[now]); else { if (A <= ((l + r) >> 1)) ins(now << 1, l, ((l + r) >> 1)); if (B > ((l + r) >> 1)) ins(now * 2 + 1, ((l + r) >> 1) + 1, r); } } void build(int now, int l, int r) { seg[now] = buf; if (l != r) build(now << 1, l, ((l + r) >> 1)), build(now * 2 + 1, ((l + r) >> 1) + 1, r); } int lca(int a, int b) { if (h[a] > h[b]) swap(a, b); for (int i = 16; i >= 0; i--) if (h[fa[b][i]] >= h[a]) b = fa[b][i]; if (a == b) return a; for (int i = 16; i >= 0; i--) if (fa[b][i] != fa[a][i]) b = fa[b][i], a = fa[a][i]; return fa[a][0]; } int qry(treap *a) { int ans = 0; for (; a != buf;) if (Y < a->key) { ans += a->r->sz + 1; a = a->l; } else a = a->r; return ans; } int qry(int now, int l, int r, int a) { int ans = qry(seg[now]); if (l != r) ans += a <= ((l + r) >> 1) ? qry(now << 1, l, ((l + r) >> 1), a) : qry(now * 2 + 1, ((l + r) >> 1) + 1, r, a); return ans; } int qry(int a) { return h[a] + 1 - qry(1, 1, n, bg[a]); } int getqry(int a, int k, int t) { for (int i = 16; i >= 0; i--) { int b = qry(fa[a][i]); if (t - b < k) { k -= t - b, a = fa[a][i]; t = b; } } return a; } int main() { int i, j, rt, m, t, a, b, c, k, cnt1, cnt2, cnt3; scanf( %d , &n); for (now = 0, i = 1; i <= n; i++) sta[i] = NULL, ft[i] = 0; for (tot = w, i = 1; i <= n; i++) if (scanf( %d , &fa[i][0]), !fa[i][0]) h[fa[i][0] = rt = i] = 0; else (tot++)->maker(sta[fa[i][0]], i); dfs(rt); for (i = 1; i <= 16; i++) for (j = 1; j <= n; j++) fa[j][i] = fa[fa[j][i - 1]][i - 1]; build(1, 1, n), buf->sz = 0, pos = buf; for (scanf( %d , &m), i = 1; i <= m; i++) { scanf( %d , &t); if (t == 1) { scanf( %d , &a); A = bg[a], B = ed[a], ft[a] = Y = i; ins(1, 1, n); } else { scanf( %d%d%d%d , &a, &b, &k, &Y); c = lca(a, b); cnt1 = qry(a), cnt2 = qry(c), cnt3 = qry(b); if (cnt1 + cnt3 - 2 * cnt2 + (ft[(c)] <= Y) - (ft[(a)] <= Y) - (ft[(b)] <= Y) < k) { puts( -1 ); continue; } if (cnt1 - cnt2 - (ft[(a)] <= Y) >= k) k = getqry(a, k, cnt1 - (ft[(a)] <= Y)); else { k = getqry(b, cnt1 + cnt3 - 2 * cnt2 + (ft[(c)] <= Y) - (ft[(a)] <= Y) - (ft[(b)] <= Y) - k + 1, cnt3 - (ft[(b)] <= Y)); } printf( %d n , k); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; char s[10000010]; struct Trie { struct nd { int ch[2], fa, fail, pos; } t[10000010]; int used; Trie() : used(1) {} int id[10000010]; int ins(int len, int I) { int u = 1; for (int i = 1; i <= len; i++) { if (!t[u].ch[s[i] - a ]) t[u].ch[s[i] - a ] = ++used, t[t[u].ch[s[i] - a ]].fa = u; u = t[u].ch[s[i] - a ]; } id[u] = I; return u; } void build() { queue<int> q; for (int j = 0; j < 2; j++) if (t[1].ch[j]) { t[t[1].ch[j]].fail = 1; q.push(t[1].ch[j]); } while (!q.empty()) { int i = q.front(); q.pop(); if (id[i]) t[i].pos = id[i]; else t[i].pos = t[t[i].fail].pos; for (int j = 0; j < 2; j++) { if (t[i].ch[j]) t[t[i].ch[j]].fail = t[t[i].fail].ch[j], q.push(t[i].ch[j]); else t[i].ch[j] = t[t[i].fail].ch[j]; } } } } T; int r[1000]; bool e[1000][1000]; void add(int i) { int p = r[i]; if (T.t[T.t[p].fail].pos) { e[T.t[T.t[p].fail].pos][i] = 1; } p = T.t[p].fa; while (p) { if (T.t[p].pos) { e[T.t[p].pos][i] = 1; } p = T.t[p].fa; } } int cp[1000]; bool vis[1000]; vector<int> pth[1000]; int fnd(int x) { for (int i = 1; i <= n; i++) { if (!vis[i] && e[x][i]) { vis[i] = 1; if (!cp[i] || fnd(cp[i])) { cp[i] = x; return 1; } } } return 0; } int id[1000]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); int m = strlen(s + 1); r[i] = T.ins(m, i); } T.build(); for (int i = 1; i <= n; i++) add(i); for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) e[i][j] |= (e[i][k] & e[k][j]); } } for (int i = 1; i <= n; i++) { memset(vis, 0, sizeof(vis)); fnd(i); } memset(vis, 0, sizeof(vis)); for (int i = 1; i <= n; i++) if (cp[i]) vis[cp[i]] = 1; int c = 0; for (int i = 1; i <= n; i++) { if (!vis[i]) { c++; int x = i; pth[c].push_back(x); while (cp[x]) { x = cp[x]; pth[c].push_back(x); } reverse(pth[c].begin(), pth[c].end()); } } for (int i = 1; i <= c; i++) id[i] = pth[i].size() - 1; while (1) { memset(vis, 0, sizeof(vis)); for (int i = 1; i <= c; i++) { int u = pth[i][id[i]]; for (int j = 1; j <= n; j++) if (e[u][j]) vis[j] = 1; } bool fl = 1; for (int i = 1; i <= c; i++) if (vis[pth[i][id[i]]]) { fl = 0; break; } if (fl) break; for (int i = 1; i <= c; i++) { while (vis[pth[i][id[i]]]) id[i]--; } } printf( %d n , c); for (int i = 1; i <= c; i++) printf( %d , pth[i][id[i]]); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; long long tab[200001], min1, odl = -1, wynik, first; cin >> n; cin >> tab[0]; min1 = 0; first = 0; for (int i = 1; i < n; i++) { cin >> tab[i]; if (tab[i] == tab[min1]) { if (odl < i - min1) odl = i - min1; min1 = i; } if (tab[i] < tab[min1]) { min1 = i; first = i; odl = -1; } } if (odl == -1) cout << n * (tab[first] + 1) - 1; else { odl--; int space = n - (min1 - first + 1); if (odl > space) cout << n * tab[first] + odl; else cout << n * tab[first] + space; } } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int M = 10005; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int n, a, i, j, b[M + 1], s[100100], r = 200000000; int main() { scanf( %d , &n); for (i = 1; i <= M; i++) b[i] = 10000; for (i = 1; i <= n; i++) { scanf( %d , &a); s[i] = s[i - 1] + a; for (j = 1; j <= M && i - j > 0; j++) b[j] = min(b[j], abs(s[i] - s[i - j])); } for (j = 1; j <= M; j++) r = min(r, j * j + b[j] * b[j]); printf( %d n , r); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[55], b[55]; int n, i, j, sum = 0, sum1 = 0, s = 0, s1 = 0, count = 0, count1 = 0, k = 0; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } for (i = 0; i < n; i++) { scanf( %d , &b[i]); sum1 += b[i]; } if (sum < sum1) { printf( No n ); } else { printf( Yes n ); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long MX = 4e6 + 5, MOD = 1e9 + 7, inf = 1e18, LG = 21; int main() { int t; cin >> t; while (t--) { long long x0, n, ans = 0; cin >> x0 >> n; if (n == 0) { cout << x0 << n ; continue; } if (x0 % 2 == 0) { long long k = (((n - 1) / 4) * 4 + 1); ans = x0 - k; for (long long i = k + 1; i <= n; i++) { if (i % 4 < 2) ans -= i; else ans += i; } } else { long long k = (((n - 1) / 4) * 4 + 1); ans = x0 + k; for (long long i = k + 1; i <= n; i++) { if (i % 4 < 2) ans += i; else ans -= i; } } cout << ans << n ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int maxN = 1 << 18; template <class T1, class T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b); } int deg[maxN], fat[maxN]; vector<int> G[maxN]; queue<int> Q; long long w[maxN]; pair<long long, int> leg[2][maxN]; void solve() { int n, m; scanf( %d%d , &n, &m); for (int i = (1); i < (int)(n + 1); i++) scanf( %lld , w + i); bool tree = m == n - 1; while (m--) { int a, b; scanf( %d%d , &a, &b); G[a].push_back(b); G[b].push_back(a); deg[a]++, deg[b]++; } int s, prv = 0; scanf( %d , &s); if (tree) deg[s] = maxN; for (int i = (1); i < (int)(n + 1); i++) if (deg[i] == 1) Q.push(i); while (!Q.empty()) { int v = Q.front(); Q.pop(); for (int u : G[v]) if (deg[u] > 1) { pair<long long, int> prop = {leg[0][v].first + w[v], v}; fat[v] = u; if (leg[0][u].first <= prop.first) leg[1][u] = leg[0][u], leg[0][u] = prop; else if (leg[1][u].first < prop.first) leg[1][u] = prop; if (--deg[u] == 1) Q.push(u); } } long long res = 0, finish = 0; while (deg[s] < 2) { res += w[s]; remax(finish, leg[0][s].second == prv ? leg[1][s].first : leg[0][s].first); prv = s; s = fat[s]; } remax(finish, leg[0][s].second == prv ? leg[1][s].first : leg[0][s].first); for (int i = (1); i < (int)(n + 1); i++) if (deg[i] > 1) { res += w[i]; if (i != s) remax(finish, leg[0][i].first); } res += finish; printf( %lld n , res); } int main() { int t; t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, minx = 999999, ans, df1, df2; char s[51]; scanf( %d , &n); getchar(); scanf( %s , s); for (int i = 0; i < n - 3; i++) { int t = 0; ans = 0; while (t <= 3) { int x = i + t; if (t == 0) { df1 = s[x] - A ; df2 = Z - s[x] + 1; ans += min(df1, df2); } if (t == 1) { df1 = abs(s[x] - C ); df2 = Z - s[x] + 3; ans += min(df1, df2); } if (t == 2) { df1 = abs(s[x] - T ); df2 = s[x] - A + 7; ans += min(df1, df2); } if (t == 3) { df1 = abs(s[x] - G ); df2 = Z - s[x] + 7; ans += min(df1, df2); } t++; } minx = min(minx, ans); } printf( %d n , minx); } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m; int a[N], q[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> m; for (int i = 0; i < m; ++i) cin >> q[i]; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; sort(q, q + m); sort(a, a + n); int r = n - 1, res = 0; while (r >= 0) { int t = q[0]; while (t-- > 0 && r >= 0) { res += a[r--]; } int k = 2; while (k-- > 0 && r >= 0) r--; } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2001; const long long INF = 1e15; int DELTA = 2500; int n; long long price[MAXN], Time[MAXN]; long long dp[MAXN][3 * MAXN]; long long rec(int idx, int remTime) { if (remTime >= MAXN) remTime = MAXN - 1; if (idx == n) return remTime >= 0 ? 0 : INF; long long &ans = dp[idx][remTime + DELTA]; if (ans != -1) return ans; ans = INF; ans = min(ans, rec(idx + 1, remTime - 1)); ans = min(ans, price[idx] + rec(idx + 1, remTime + Time[idx])); return ans; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> Time[i] >> price[i]; memset(dp, -1, sizeof(dp)); cout << rec(0, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; map<int, long long> sale; map<int, long long> buy; for (int i = 0; i < n; i++) { char c; cin >> c; if (c == B ) { int price, num; cin >> price >> num; buy[price] += num; } else { int price, num; cin >> price >> num; sale[price] += num; } } auto itb = sale.begin(); stack<pair<long long, long long>> answ; for (int i = 0; i < min(int(sale.size()), s); i++) { answ.push((*itb)); itb++; } while (!answ.empty()) { cout << S << << answ.top().first << << answ.top().second << endl; answ.pop(); } auto its = buy.end(); for (int i = 0; i < min(int(buy.size()), s); i++) { its--; cout << B << << (*its).first << << (*its).second << endl; } cin >> n; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char s[1001]; int m[26]; while (gets(s)) { memset(m, 0, sizeof(m)); int len = strlen(s); int dan = 0, shuang = 0; for (int i = 0; i < len; i++) m[s[i] - a ]++; for (int i = 0; i < 26; i++) if (m[i]) { if (m[i] % 2 == 0) shuang++; if (m[i] % 2) dan++; } if ((dan == 0) || (dan % 2)) printf( First n ); else printf( Second n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxi = 1e18; long long prime[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}; long long dp[15][1005], mi[15][1005], ans; int n; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); for (int i = 1; i <= 10; i++) { mi[i][0] = 1; for (int j = 1; j <= 1000; j++) { long long temp; bool flag = __builtin_mul_overflow(mi[i][j - 1], prime[i], &temp); if (!flag) mi[i][j] = mi[i][j - 1] * prime[i]; else mi[i][j] = maxi; } } int n; cin >> n; for (int i = 1; i <= 10; i++) { for (int j = 1; j <= n; j++) dp[i][j] = maxi; } for (int i = 1; i <= n; i++) dp[1][i] = mi[1][i - 1]; for (int i = 2; i <= 10; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= j; k++) { if (j % k == 0) { long long temp; bool flag = __builtin_mul_overflow(dp[i - 1][j / k], mi[i][k - 1], &temp); if (!flag) dp[i][j] = min(dp[i][j], dp[i - 1][j / k] * mi[i][k - 1]); } } } } cout << dp[10][n] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > white, black; int main() { cin >> n; for (int i = 0; i < n; i++) { int c, s; cin >> c >> s; if (c) { black.push_back(make_pair(s, i + 1)); } else { white.push_back(make_pair(s, i + 1)); } } sort(black.begin(), black.end()); sort(white.begin(), white.end()); int p_b = 0, p_w = 0; while (p_b < black.size() && p_w < white.size()) { cout << black[p_b].second << << white[p_w].second << ; if (black[p_b].first < white[p_w].first) { cout << black[p_b].first << endl; pair<int, int>& p = white[p_w]; p.first -= black[p_b].first; p_b++; } else { cout << white[p_w].first << endl; pair<int, int>& p = black[p_b]; p.first -= white[p_w].first; p_w++; } } if (p_b < black.size()) { p_b++; while (p_b < black.size()) { cout << white[0].second << << black[p_b++].second << 0 << endl; } } if (p_w < white.size()) { p_w++; while (p_w < white.size()) { cout << black[0].second << << white[p_w++].second << 0 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = (long long)1 << 61; int main() { long long n, m; cin >> n >> m; pair<long long, long long> first, last; bool was = false; vector<vector<char>> v(n, vector<char>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> v[i][j]; if (v[i][j] == B && !was) { first = {i, j}; was = true; } if (v[i][j] == B ) { last = {i, j}; } } } cout << (first.first + last.first) / 2 + 1 << << (first.second + last.second) / 2 + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int sum[200000 + 5]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , sum + i); sum[i] += i; } sort(sum, sum + n); for (int i = 1; i < n; ++i) { if (sum[i] == sum[i - 1]) { printf( :( n ); return 0; } } for (int i = 0; i < n; ++i) { printf( %d , sum[i] - i); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-11; int vex[4] = {1, 0, -1, 0}; int vey[4] = {0, 1, 0, -1}; long long int MOD = 1000000007; const int MAX = 3000000; string c[100005]; char s[MAX]; int main() { int n; cin >> n; using p = pair<int, pair<int, int>>; using po = pair<int, int>; vector<p> d; for (int i = 0; i < (MAX); i++) s[i] = * ; int last = 0; int a, b; for (int i = 0; i < (n); i++) { cin >> c[i]; int t = c[i].size(); cin >> a; for (int j = 0; j < (a); j++) { cin >> b; b--; d.push_back(p(b, po(b + t, i))); } } sort(d.begin(), d.end()); int in = d.size(); for (int j = 0; j < (in - 1); j++) { auto l = d[j]; auto r = d[j + 1]; if (l.first == r.first) continue; for (int k = max(l.first, last); k < l.second.first; k++) { s[k] = c[l.second.second][k - l.first]; } last = max(l.second.first, last); } auto l = d[in - 1]; for (int k = l.first; k < l.second.first; k++) { s[k] = c[l.second.second][k - l.first]; } string ans = ; int la = 0; for (int i = (MAX)-1; i >= 0; i--) { if (s[i] != * ) { la = i; break; } } for (int i = 0; i < (la + 1); i++) { if (s[i] == * ) cout << a ; else cout << s[i]; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int a, b, n; vector<int> div; cin >> a >> b >> n; if (b > a) swap(a, b); for (int d = 1; d * d <= b; d++) { if (a % d == 0 and b % d == 0) div.push_back(d); int d2 = -1; if (b % d == 0 and b / d != d) d2 = b / d; if (d2 != -1) if (a % d2 == 0) div.push_back(d2); } sort(div.begin(), div.end()); while (n--) { int l, r; cin >> l >> r; auto it = upper_bound(div.begin(), div.end(), r); it--; if (l <= *it and *it <= r) cout << *it << endl; else cout << -1 n ; } } |
#include <bits/stdc++.h> using namespace std; multiset<int> s; multiset<int>::iterator itr; int c[5], tot; int get_ty(int x) { if (c[2] >= x) return 1; else if (c[1] + c[2] >= x) return 2; else if (c[0] + c[1] + c[2] >= x) return 3; else return 4; } int main() { int n; scanf( %d , &n); for (int i = 0; i < 3; i++) scanf( %d , &c[i]); for (int i = 0; i < 3; i++) tot += c[i]; sort(c, c + 3); for (int i = 0; i < n; i++) { int t; scanf( %d , &t); s.insert(t); } int res = 0; bool isok = 0, flag = 0; while (!s.empty()) { int mm = *(--s.end()); if (!flag) { int ty = get_ty(mm); if (ty == 4) break; if (ty == 3) s.erase(--s.end()); else if (ty == 2) { s.erase(--s.end()); int loc = 0; for (int i = 0; i < 3; i++) if (tot - c[i] >= mm) loc = i; itr = s.upper_bound(c[loc]); if (itr != s.begin()) s.erase(--itr); } else if (ty == 1) flag = 1; } if (flag) { int loc = 0; for (int i = 2; i >= 0; i--) if (c[i] >= mm) loc = i; s.erase(--s.end()); itr = s.upper_bound(c[loc == 0]); bool dbk = 1; if (itr == s.begin()) dbk = 0; else { int tt = *(--itr); s.erase(itr); itr = s.upper_bound(c[1 + (loc <= 1)]); if (itr == s.begin()) { s.insert(tt); dbk = 0; } } if (dbk) s.erase(--itr); else { itr = s.upper_bound(tot - c[loc]); if (itr != s.begin()) s.erase(--itr); } } isok = 1; res++; } if (!isok) printf( -1 n ); else printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; long long ret[70]; long long qpow(long long a, long long n) { long long ret = 1; while (n) { if (n & 1) ret = ret * a; a = a * a; n >>= 1; } return ret; } void solve() { ret[0] = 1; for (long long i = 1; i < 64; i++) { ret[i] = ret[i - 1] + qpow(2, i); } } vector<long long> res; void getans() { for (long long i = 0; i < 64; i++) { long long tmp = qpow(2, i); for (long long j = i + 1; j < 64; j++) { res.push_back(ret[j] - tmp); } } } int main() { solve(); getans(); long long a, b; cin >> a >> b; sort(res.begin(), res.end()); long long pos1 = upper_bound(res.begin(), res.end(), a) - res.begin(); long long pos3 = lower_bound(res.begin(), res.end(), a) - res.begin(); long long pos2 = upper_bound(res.begin(), res.end(), b) - res.begin(); long long pos4 = lower_bound(res.begin(), res.end(), b) - res.begin(); long long ans = pos2 - pos1; if (pos3 < pos1) ans++; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2501; int dp[N][3], a[N << 1]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; memset(dp, 0x3f, sizeof(dp)); dp[0][0] = dp[1][1] = 0; for (int i = 2; i <= n; i++) for (int j = i + 1 >> 1; j; j--) { dp[j][0] = min(dp[j][0], dp[j][2]); dp[j][2] = dp[j][1] + max(0, a[i] - a[i - 1] + 1); dp[j][1] = min(dp[j - 1][0] + max(0, a[i - 1] - a[i] + 1), dp[j - 1][2] + max(0, min(a[i - 1], a[i - 2] - 1) - a[i] + 1)); } for (int j = 1; j <= n + 1 >> 1; j++) cout << min(dp[j][0], min(dp[j][1], dp[j][2])) << ; } |
#include <bits/stdc++.h> const long long mod = (long long)(1e9 + 7); int n; long long s, ans; long long f[1000]; long long ksm(long long x, long long y) { long long ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y = y / 2; } return ans; } long long Lucas(long long n, long long m) { if (n < mod && m < mod) { if (n < m) return 0; if (n == m) return 1; if (m == 0) return 1; long long nj = 1, mj = 1; long long a = n - m, b = m; if (a > b) std::swap(a, b); long long i = b + 1; while (i <= n) { nj = (nj * i) % mod; i++; } i = 2; while (i <= a) { mj = (mj * i) % mod; i++; } return ksm(mj, mod - 2) * nj % mod; } return Lucas(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod; } long long dle(long long x) { return (((1 & x) ^ 1) << 1) - 1; } void dfs(int p, int l, long long sum) { if (p == n + 1) { ans = (ans + dle(l) * Lucas(s - sum + n - 1, n - 1)) % mod; return; } dfs(p + 1, l, sum); dfs(p + 1, l + 1, sum + f[p] + 1); return; } int main() { scanf( %d%I64d , &n, &s); for (int i = 1; i <= n; i++) scanf( %I64d , &f[i]); ans = 0; dfs(1, 0, 0); printf( %I64d n , (ans % mod + mod) % mod); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c; cin >> n >> a >> b >> c; int x, y, z, p = 0, i; i = min(a, min(b, c)); i = n / i; for (x = i; x >= 0; x--) { for (y = 0; y <= i; y++) { z = abs((n - (a * x + b * y)) / c); if ((a * x + b * y + c * z) == n) { p = max(p, x + y + z); } } } cout << p << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long same(vector<pair<long long, int> > &x) { int n = x.size(); return (x[n - 1].first + x[n - 2].first) - (x[0].first + x[1].first); } long long diff(vector<pair<long long, int> > &x, long long h) { int n = x.size(); long long minx = min(x[0].first + x[1].first + h, x[1].first + x[2].first); long long maxx = max(x[n - 1].first + x[n - 2].first, x[0].first + x[n - 1].first + h); return maxx - minx; } int main() { int n, h; cin >> n >> h; vector<pair<long long, int> > a(n); for (int i = 0; i < (int)(n); i++) { long long tmp; cin >> tmp; a[i].first = tmp; a[i].second = i; } sort(a.begin(), a.end()); long long h1 = same(a); long long h2 = diff(a, h); cout << min(h1, h2) << endl; if (h1 < h2) { for (int i = 0; i < (int)(n); i++) printf( %d , 1); } else { int head = a[0].second; for (int i = 0; i < (int)(n); i++) { int ret = (i == head) ? 1 : 2; printf( %d , ret); } } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string a, b; cin >> a >> b; vector<int> ans; int l = 0, r = n - 1; for (int i = 0; i < n; i++) { if (!(i & 1)) { if (a[l] == b[n - i - 1]) ans.push_back(1); ans.push_back(max(l, r) - min(l, r) + 1); } else { if (a[l] != b[n - i - 1]) ans.push_back(1); ans.push_back(max(l, r) - min(l, r) + 1); } swap(l, r); if (r > l) r--; else r++; } cout << ans.size() << ; for (auto x : ans) cout << x << ; cout << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int min1(long long int a) { long long int mx = 0, mi = 10; while (a) { mx = max(mx, a % 10); mi = min(mi, a % 10); a /= 10; } return mi * mx; } int main() { int t; cin >> t; while (t--) { long long int a, k; cin >> a >> k; long long int tem = min1(a); while (--k && tem != 0) { a = a + tem; tem = min1(a); } cout << a << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long linf = LLONG_MAX; const int MOD = 1000000007; const int maxn = 1e5 + 10; const int MAX = 2e4 + 10; int _size[maxn], vis[maxn]; vector<int> sub; vector<pair<int, int> > adj[maxn]; int n, k, a, b; bool first(string second) { string a = to_string(linf); for (int i = 0; second[i]; i++) { if (second[i] > a[i]) return 0; else if (second[i] == a[i]) { int j = i; while (second[j] == a[j]) ++j; if (second[j] > a[j]) return 0; return 1; } return 1; } return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); string str; cin >> str; if (str.size() == 19) { if (first(str)) { cout << long n ; return 0; } else { cout << BigInteger n ; return 0; } } else { if (str.size() < 19) { stringstream sin(str); long long t = 0; int h = 32767; sin >> t; if (t <= INT_MAX && t > h) { cout << int n ; return 0; } else if (t > INT_MAX) { cout << long n ; return 0; } else if (t <= h) { int b = 127; if (t <= b) { cout << byte n ; return 0; } else { cout << short n ; return 0; } } } else { cout << BigInteger n ; return 0; } } } |
#include <bits/stdc++.h> using namespace std; const long long OO = 1e9; int main() { int n; scanf( %d , &n); vector<int> a(n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); map<int, int> mp; vector<int> ans; for (int i = 0; i < n; i++) { if (mp[a[i]]) { ans.push_back(i + 1); mp.clear(); } else mp[a[i]] = i + 1; } if (ans.size() == 0) { cout << -1 << endl; return 0; } printf( %d n , (int)ans.size()); int h = 1; for (int i = 0; i < (int)ans.size(); i++) { if (i + 1 == ans.size()) ans[i] = n; printf( %d %d n , h, ans[i]); h = ans[i] + 1; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n, m; cin >> n >> m; int res = 2e9; for (int i = 0; i < m; i++) { int r, l; cin >> l >> r; res = min(res, r - l + 1); } vector<int> vec(n, 0); cout << res << n ; for (int i = 0; i < n; i++) { cout << i % res; if (i != n - 1) cout << ; } return 0; } |
#include <bits/stdc++.h> int i, j, n, m; bool killed[200100], visited[200100]; int vlist[200100][3]; int ans[200100]; inline int myabs(int a) { return a < 0 ? -a : a; } inline int sign(int a) { return a / myabs(a); } struct G { int ind[200100]; int last[200100 * 2], e[200100 * 2], e_num[200100 * 2]; int t; void addE(int a, int b, int ee) { t++; last[t] = ind[a]; ind[a] = t; e[t] = b; e_num[t] = ee; } } g; inline void gen_ans_for_i(int i, int j) { if (vlist[i][0] == 1) { ans[i] = vlist[i][1] > 0 ? 1 : 0; } else { if (myabs(vlist[i][1]) == j) { ans[i] = vlist[i][1] > 0 ? 1 : 0; } else { ans[i] = vlist[i][2] > 0 ? 1 : 0; } } } bool dfs(int a, int fae) { if (visited[a] || killed[a]) { return true; } visited[a] = 1; int i; for (i = g.ind[a]; i; i = g.last[i]) { if (g.e_num[i] != fae) if (dfs(g.e[i], g.e_num[i])) { if (!killed[a]) { gen_ans_for_i(g.e_num[i], a); killed[a] = true; } } } return killed[a]; } void dfs2(int a, int fae) { if (visited[a]) { return; } visited[a] = 1; int i; for (i = g.ind[a]; i; i = g.last[i]) { if (g.e_num[i] != fae) if (!killed[g.e[i]]) { killed[g.e[i]] = true; gen_ans_for_i(g.e_num[i], g.e[i]); dfs2(g.e[i], g.e_num[i]); } } return; } int main() { scanf( %d %d , &n, &m); int a, b; for (i = 1; i <= n; i++) { scanf( %d , &j); while (j--) { scanf( %d , &a); b = myabs(a); vlist[b][0]++; if (a < 0) { vlist[b][vlist[b][0]] = -i; } else { vlist[b][vlist[b][0]] = i; } } } for (i = 1; i <= m; i++) { if (vlist[i][0] == 1) { killed[myabs(vlist[i][1])] = true; if (vlist[i][1] < 0) { ans[i] = 0; } else { ans[i] = 1; } } else if (vlist[i][0] == 2) { a = myabs(vlist[i][1]); b = myabs(vlist[i][2]); if (sign(vlist[i][1]) * sign(vlist[i][2]) > 0) { killed[a] = true; killed[b] = true; ans[i] = vlist[i][1] > 0 ? 1 : 0; } else { g.addE(a, b, i); g.addE(b, a, i); } } } for (i = 1; i <= n; i++) { if (!visited[i] && !killed[i]) { dfs(i, 0); } } memset(visited, 0, sizeof(visited)); for (i = 1; i <= n; i++) { if (killed[i]) { dfs2(i, 0); } } for (i = 1; i <= n; i++) { if (!killed[i]) { printf( NO n ); return 0; } } printf( YES n ); for (i = 1; i <= m; i++) { printf( %d , ans[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> str(1); vector<int> ans(1); int solve(const string& s) { for (int len = 1; len <= 10; ++len) { for (int opt = 0; opt < (1 << len); ++opt) { bitset<10> bits(opt); string tmpS(len, 0 ); for (int i = 0; i < len; ++i) { tmpS[i] += bits[i]; } if (s.find(tmpS) == string::npos) { return len - 1; } } } return -1; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { char buff[256]; scanf( %s , buff); str.push_back(buff); ans.push_back(solve(str.back())); } int m; scanf( %d , &m); for (int i = 0; i < m; ++i) { int a, b; scanf( %d%d , &a, &b); str.push_back(str[a] + str[b]); if (str.back().length() > 1000) { str.back() = str.back().substr(0, 500) + str.back().substr(str.back().length() - 500, 500); } ans.push_back(max({solve(str.back()), ans[a], ans[b]})); cout << ans.back() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; const int N = 300009; const int INF = 1e9; const long long INF64 = 1e18; const double eps = 1e-9; const int MOD = 1e9 + 7; int n, q; int a[N], f[N]; int sum(int pos) { int res = 0; for (int i = pos; i >= 0; i = (i & (i + 1)) - 1) res += f[i]; return res; } void upd(int pos, int d) { for (int i = pos; i < n; i |= i + 1) f[i] += d; } int sum(int l, int r) { return sum(r) - sum(l - 1); } int main() { cin >> n >> q; int l = 0, r = n - 1; bool rev = false; for (int i = 0; i < (int)(n); i++) { a[i] = 1; upd(i, 1); } for (int i = 0; i < (int)(q); i++) { int type, p, nl, nr; cin >> type; if (type == 1) { cin >> p; int len = r - l + 1; if (p * 2 <= len) { if (rev) { for (int i = r - p + 1, j = r - p; i <= r; ++i, --j) { upd(j, a[i]); upd(i, -a[i]); a[j] += a[i]; a[i] = 0; } r -= p; } else { for (int i = l + p - 1, j = l + p; i >= l; --i, ++j) { upd(j, a[i]); upd(i, -a[i]); a[j] += a[i]; a[i] = 0; } l += p; } } else { if (rev) { rev = false; p = len - p; for (int i = l + p - 1, j = l + p; i >= l; --i, ++j) { upd(j, a[i]); upd(i, -a[i]); a[j] += a[i]; a[i] = 0; } l += p; } else { rev = true; p = len - p; for (int i = r - p + 1, j = r - p; i <= r; ++i, --j) { upd(j, a[i]); upd(i, -a[i]); a[j] += a[i]; a[i] = 0; } r -= p; } } } else { cin >> nl >> nr; --nr; if (rev) { int ee = nr; nr = r - nl, nl = r - ee; cout << sum(nl, nr) << endl; } else { nl = l + nl, nr = l + nr; int xc = 0; cout << sum(nl, nr) << endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 300005; int n, c[MX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> c[i]; int res = 0, i = n - 1; while (c[0] == c[i]) i--; res = i; i = 0; while (c[i] == c[n - 1]) i++; res = max(res, n - i - 1); cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, sum, mod1, mod, mod2; cin >> a >> b >> c; sum = (a + b); if ((a >= b || a <= b) && (c <= sum)) { if (c == a) { cout << YES << endl; } else if (c == sum) { cout << YES << endl; } else { cout << NO << endl; } } else if (c > sum) { mod = sum % b; sum = sum + 1; mod1 = sum % b; mod2 = c % b; if (mod2 == mod1 || mod2 == mod) { cout << YES << endl; } else { cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, m; int arr[1005][105][2], arr1[1005], arr2[1005]; long long dp(int i, int s, int hg) { if (s == 0 && hg) return ((i != n) ? ((9 * 1LL * arr2[n - i - 1]) % m) : 1); if (i == n) return 0; if (arr[i][s][hg] != -1) return arr[i][s][hg]; arr[i][s][hg] = 0; for (int j = 0; j <= 9; j++) { arr[i][s][hg] += dp(i + 1, (s + (j * 1LL * arr1[i]) % k) % k, (hg || (j != 0))); arr[i][s][hg] %= m; } return arr[i][s][hg]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); memset(arr, -1, sizeof(arr)); cin >> n >> k >> m; arr1[0] = arr2[0] = 1; for (int i = 1; i <= 1000; i++) arr1[i] = (arr1[i - 1] * 1LL * 10) % k; for (int i = 1; i <= 1000; i++) arr2[i] = (arr2[i - 1] * 1LL * 10) % m; cout << dp(0, 0, 0) << n ; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1E5 + 5; const int BASE1 = 1E9 + 7; const int BASE2 = 999999993; int n, k; bool mark[MAXN]; int a[MAXN], nTurn; int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 0; i <= n; ++i) { string s; cin >> s; if (s[0] == ? ) mark[i] = 1, ++nTurn; else { stringstream ss; ss << s; ss >> a[i]; } } if (k == 0) { if (!mark[0]) { if (a[0] == 0) { cout << Yes ; } else { cout << No ; } return 0; } else { if (nTurn % 2 == n % 2) { cout << Yes ; } else { cout << No ; } return 0; } } else { if (nTurn == 0) { long long res1 = 0, res2 = 0, cur1 = 1, cur2 = 1; for (int i = 0; i <= n; ++i) { res1 = (res1 + a[i] * cur1 % BASE1 + BASE1) % BASE1; res2 = (res2 + a[i] * cur2 % BASE2 + BASE2) % BASE2; cur1 = cur1 * k % BASE1; cur2 = cur2 * k % BASE2; } if (res1 == 0 && res2 == 0) { cout << Yes ; } else cout << No ; } else { if (n % 2 == 0) { cout << No ; } else { cout << Yes ; } } } } |
#include <bits/stdc++.h> using namespace std; const int M = 5005; int a[M], n, dp[M], ans, mx, s[M], t[M], cnt; bool vis[M]; struct no { int l, r, x; } p[M]; bool cmp(no a, no b) { return a.r != b.r ? a.r < b.r : a.l < b.l; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (!p[a[i]].l) p[a[i]].l = i; p[a[i]].r = i; if (s[a[i]] == 0) s[a[i]] = i; t[a[i]] = i; mx = max(mx, a[i]); } for (int i = 1; i <= n; i++) { int l = i, r = t[a[i]]; memset(vis, 0, sizeof(vis)); bool flag = 0; int res = 0; for (int j = l; j <= r; j++) { if (vis[a[j]]) continue; if (s[a[j]] < l) { flag = 1; break; } r = max(r, t[a[j]]); res ^= a[j]; vis[a[j]] = 1; } if (flag) continue; p[++cnt] = (no){l, r, res}; } sort(p + 1, p + cnt + 1, cmp); for (int i = 1; i <= cnt; i++) { for (int j = 1; j < i; j++) { if (p[j].r < p[i].l) { dp[i] = max(dp[i], dp[j]); } } dp[i] += p[i].x; ans = max(ans, dp[i]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<long long> a; a.push_back(0); a.push_back(1); map<long long, long long> m; int k, l = 0; m[0] = 1; m[1] = 1; while (1) { k = l; l = a.size(); for (int i = k; i < l; i++) { long long z = a[i] * 10 + 0; long long y = a[i] * 10 + 1; if (m[z] == 0) { a.push_back(z); m[z]++; } if (m[y] == 0) { a.push_back(y); m[y]++; } } if (a[a.size() - 1] > 1e9) break; } long long n; cin >> n; vector<long long>::iterator it; it = upper_bound(a.begin(), a.end(), n); cout << it - a.begin() - 1 << endl; } |
#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int N = 100005, E = 262144; int n, m, i, u, v, p, t, vis[55][55], j, k; vector<int> g[55][55]; int q[N], l, r; vector<int> ansr, ansl, w[55][55]; long long g1[55][55][105], g2[55][55][105], g3[55][55][105]; long long dp[105][55][2], f[55][55][105], ans[55][105], fe[55][55][105]; bool flag1 = true; int main() { scanf( %d %d , &n, &m); for (i = 1; i <= m; ++i) { scanf( %d %d , &u, &v); vis[u][v] = 1; scanf( %d , &t); if (t == 0) flag1 = false; while (t--) { scanf( %d , &p); g[u][v].push_back(p); } } bool flag = true; for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) if (i != j) { for (k = 0; k + 1 < g[i][j].size(); ++k) if (g[i][j][k] == i && g[i][j][k + 1] == j) break; if (k + 1 < g[i][j].size()) { l = 1, r = 0; for (p = k + 2; p < g[i][j].size(); ++p) q[++r] = g[i][j][p]; p = j; ansl.clear(), ansr.clear(); ansr.push_back(j); while (l <= r && r <= 2 * n) { if (!vis[p][q[l]]) break; for (auto it : g[p][q[l]]) q[++r] = it; p = q[l]; ansr.push_back(q[l]); ++l; } if (l <= r) continue; l = 1, r = 0; for (p = k - 1; p >= 0; --p) q[++r] = g[i][j][p]; p = i; ansl.push_back(i); while (l <= r && r <= 2 * n) { if (!vis[q[l]][p]) break; for (int i = g[q[l]][p].size() - 1; i >= 0; --i) q[++r] = g[q[l]][p][i]; p = q[l]; ansl.push_back(q[l]); ++l; } if (l <= r) continue; if (ansl.size() + ansr.size() <= 2 * n) { ++g1[ansl[ansl.size() - 1]][ansr[ansr.size() - 1]] [ansl.size() + ansr.size() - 1]; } } } for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) if (g[i][j].size() && g[i][j][0] == j) { l = 1, r = 0; for (p = 1; p < g[i][j].size(); ++p) q[++r] = g[i][j][p]; p = j; ansr.clear(); ansr.push_back(j); while (l <= r && r <= 2 * n) { if (!vis[p][q[l]]) break; for (auto it : g[p][q[l]]) q[++r] = it; p = q[l]; ansr.push_back(q[l]); ++l; } if (l <= r) continue; ++g3[i][ansr[ansr.size() - 1]][ansr.size()]; } for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) if (g[i][j].size() && g[i][j][g[i][j].size() - 1] == i) { l = 1, r = 0; for (p = g[i][j].size() - 2; p >= 0; --p) q[++r] = g[i][j][p]; p = i; ansl.clear(); ansl.push_back(i); while (l <= r && r <= 2 * n) { if (!vis[q[l]][p]) break; for (int i = g[q[l]][p].size() - 1; i >= 0; --i) q[++r] = g[q[l]][p][i]; p = q[l]; ansl.push_back(q[l]); ++l; } if (l <= r) continue; ++g2[ansl[ansl.size() - 1]][j][ansl.size()]; } for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) for (k = 1; k <= 2 * n; ++k) if (g1[i][j][k] || g2[i][j][k] || g3[i][j][k]) w[i][j].push_back(k); for (i = 1; i <= n; ++i) { memset(dp, 0, sizeof(dp)); dp[0][i][0] = 1; for (j = 1; j <= n * 2; ++j) for (k = 1; k <= n; ++k) for (l = 1; l <= n; ++l) for (auto m : w[l][k]) { dp[j][k][0] = (dp[j][k][0] + dp[j - m][l][0] * g2[l][k][m]) % M; dp[j][k][1] = (dp[j][k][1] + dp[j - m][l][0] * g1[l][k][m] + dp[j - m][l][1] * g3[l][k][m]) % M; } for (j = 1; j <= n; ++j) for (k = 1; k <= 2 * n; ++k) f[i][j][k] = dp[k][j][1]; } for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) for (k = 1; k <= 2 * n; ++k) ans[j][k] = (ans[j][k] + f[i][j][k]) % M; for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) for (l = 1; l <= n; ++l) if (g[l][i].size() == 0 && vis[l][i]) for (k = 1; k < 2 * n; ++k) fe[l][j][k + 1] = (fe[l][j][k + 1] + f[i][j][k]) % M; for (k = 1; k <= 2 * n; ++k) for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) for (l = 1; l <= k; ++l) ans[i][k] = (ans[i][k] + ans[j][k - l] * fe[j][i][l]) % M; for (k = 1; k <= 2 * n; ++k) { long long s = 0; for (i = 1; i <= n; ++i) s = (s + ans[i][k]) % M; cout << s << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 9; set<pair<int, int> > len, pos; int n, m; void add_seg(int L, int R) { if (L > R) return; int sz = R - L + 1; pos.insert(make_pair(L, sz)); if (L != 1 && R != n) sz = (sz + 1) / 2; len.insert(make_pair(sz, L)); } void rem_seg(int L, int R) { if (L > R) return; int sz = R - L + 1; pos.erase(make_pair(L, sz)); if (L != 1 && R != n) sz = (sz + 1) / 2; len.erase(make_pair(sz, L)); } int loc[N]; void add(int x) { auto it = len.end(); --it; int opt = it->first; it = len.lower_bound(make_pair(opt, -1)); auto segt = pos.lower_bound(make_pair(it->second, -1)); int L = segt->first; int R = L + (segt->second) - 1; rem_seg(L, R); int M = (L + R) / 2; if (L == 1) M = 1; else if (R == n) M = R; cout << M << n ; loc[x] = M; add_seg(L, M - 1); add_seg(M + 1, R); } void rem(int x) { int pp = loc[x]; loc[x] = 0; int L = pp, R = pp; auto v2 = pos.lower_bound(make_pair(pp + 1, -1)); if (v2 != pos.end() && v2->first == pp + 1) { R = (v2->first) + (v2->second) - 1; rem_seg(v2->first, (v2->first) + (v2->second) - 1); } v2 = pos.lower_bound(make_pair(pp + 1, -1)); if (v2 != pos.begin()) { --v2; if ((v2->first) + (v2->second) - 1 == pp - 1) { L = v2->first; rem_seg(v2->first, pp - 1); } } add_seg(L, R); } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> m; add_seg(1, n); int typ; int id; for (int i = 0; i < m; i++) { cin >> typ >> id; if (typ == 1) add(id); else rem(id); } return 0; } |
#include <bits/stdc++.h> using namespace std; int inf = -1e9; struct node { int low; int high; pair<int, int> val; node() : val(make_pair(inf, 0)) {} node(int _l, int _h) : low(_l), high(_h), val(make_pair(inf, 0)) {} node(int _l, int _h, pair<int, int> _v) : low(_l), high(_h), val(_v) {} }; int N = 1 << 19; vector<node> seg(2 * N); void initSeg(vector<pair<int, int>> vals) { int len = vals.size(); for (int i = 0; i < len; ++i) { seg[N + i].val = vals[i]; seg[N + i].low = i; seg[N + i].high = i + 1; } for (int i = len; i < N; ++i) { seg[N + i].low = i; seg[N + i].high = i + 1; } for (int i = N - 1; i > 0; --i) { seg[i].val = max(seg[2 * i].val, seg[2 * i + 1].val); seg[i].low = seg[2 * i].low; seg[i].high = seg[2 * i + 1].high; } } pair<int, int> querySeg(int index, int low, int high) { if (low <= seg[index].low && seg[index].high <= high) return seg[index].val; if (seg[index].high <= low || high <= seg[index].low) return make_pair(inf, 0); return max(querySeg(2 * index, low, high), querySeg(2 * index + 1, low, high)); } pair<int, int> updateSeg(int index, int low, int high, pair<int, int> val) { if (low <= seg[index].low && seg[index].high <= high) { seg[index].val = val; return val; } if (seg[index].high <= low || high <= seg[index].low) return seg[index].val; pair<int, int> left = updateSeg(2 * index, low, high, val); pair<int, int> right = updateSeg(2 * index + 1, low, high, val); seg[index].val = max(left, right); return seg[index].val; } vector<int> seq; vector<int> a; vector<pair<int, int>> b; vector<bool> toVisit; int n; void dfs(int index) { toVisit[index] = false; updateSeg(1, index, index + 1, make_pair(inf, 0)); if (b[index].first < n && toVisit[b[index].first]) dfs(b[index].first); while (true) { pair<int, int> p = querySeg(1, 0, a[index]); if (p.first > index) dfs(p.second); else break; } seq.push_back(index); } int main() { int Test = 1; for (int test = 1; test <= Test; ++test) { cin >> n; a.clear(); b.clear(); seq.clear(); toVisit.clear(); for (int i = 0; i < n; ++i) { int in; cin >> in; if (in == -1) in = n + 1; a.push_back(in - 1); } for (int i = 0; i < n; ++i) { b.push_back(make_pair(n, i)); toVisit.push_back(true); } for (int i = 0; i < n; ++i) { if (a[i] == n) continue; b[a[i]].first = i; } initSeg(b); for (int i = 0; i < n; ++i) { if (toVisit[i]) dfs(i); } int ans[n]; for (int i = 0; i < n; ++i) { ans[seq[i]] = i + 1; } for (int i = 0; i < n; ++i) { cout << ans[i] << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int t[n]; for (int i = 0; i < n; i++) cin >> t[i]; int left_cnt, left_time, right_cnt, right_time; int left_idx = 0, right_idx = n - 1; left_time = left_cnt = right_time = right_cnt = 0; while (left_idx <= right_idx) { left_time += t[left_idx]; left_cnt++; while (right_idx > left_idx && right_time < left_time) { right_time += t[right_idx--]; right_cnt++; } left_idx++; } cout << left_cnt << << right_cnt << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.