func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; void getre() { int x = 0; printf( %d n , 1 / x); } void gettle() { int res = 1; while (1) res <<= 1; printf( %d n , res); } template <typename T, typename S> inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template <typename T, typename S> inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } template <typename N, typename PN> inline N flo(N a, PN b) { return a >= 0 ? a / b : -((-a - 1) / b) - 1; } template <typename N, typename PN> inline N cei(N a, PN b) { return a > 0 ? (a - 1) / b + 1 : -(-a / b); } template <typename N> N gcd(N a, N b) { return b ? gcd(b, a % b) : a; } template <typename N> inline int sgn(N a) { return a > 0 ? 1 : (a < 0 ? -1 : 0); } inline void gn(long long &x) { int sg = 1; char c; while (((c = getchar()) < 0 || c > 9 ) && c != - ) ; c == - ? (sg = -1, x = 0) : (x = c - 0 ); while ((c = getchar()) >= 0 && c <= 9 ) x = x * 10 + c - 0 ; x *= sg; } inline void gn(int &x) { long long t; gn(t); x = t; } inline void gn(unsigned long long &x) { long long t; gn(t); x = t; } inline void gn(double &x) { double t; scanf( %lf , &t); x = t; } inline void gn(long double &x) { double t; scanf( %lf , &t); x = t; } inline void gs(char *s) { scanf( %s , s); } inline void gc(char &c) { while ((c = getchar()) > 126 || c < 33) ; } inline void pc(char c) { putchar(c); } inline long long sqr(long long a) { return a * a; } inline double sqrf(double a) { return a * a; } const int inf = 0x3f3f3f3f; const double pi = 3.14159265358979323846264338327950288L; const double eps = 1e-6; const int TREE_MAXV = 100000 + 5; struct edge { int v, next; } e[TREE_MAXV * 2]; int g[TREE_MAXV], etot; int n; void ae(int u, int v) { e[etot].v = v; e[etot].next = g[u]; g[u] = etot++; } int dfn[TREE_MAXV], rig[TREE_MAXV], pre[TREE_MAXV], h[TREE_MAXV]; int seq[TREE_MAXV], up[TREE_MAXV], sz[TREE_MAXV]; void build_hld(int rt) { static int qu[TREE_MAXV], son[TREE_MAXV]; int p = 0, q = 0; qu[q++] = rt; pre[rt] = 0; h[rt] = 0; while (p != q) { int u = qu[p++]; sz[u] = 1, son[u] = 0; for (int i = g[u]; ~i; i = e[i].next) if (e[i].v != pre[u]) qu[q++] = e[i].v, pre[e[i].v] = u, h[e[i].v] = h[u] + 1; } sz[0] = 0; for (int i = q - 1; i >= 1; i--) { sz[pre[qu[i]]] += sz[qu[i]]; if (sz[qu[i]] > sz[son[pre[qu[i]]]]) son[pre[qu[i]]] = qu[i]; } for (int j = 0; j < q; j++) if (!son[qu[j]]) { int s = qu[j]; while (son[pre[s]] == s) s = pre[s]; int t = s; while (t) up[t] = s, t = son[t]; } else { int u = qu[j], v = son[u]; if (e[g[u]].v != v) { for (int i = g[u], j; ~i; j = i, i = e[i].next) if (e[i].v == v) { e[j].next = e[i].next; e[i].next = g[u]; g[u] = i; break; } } } static int stk[TREE_MAXV], cur[TREE_MAXV]; int top = 0, ind = 0; stk[++top] = rt; cur[top] = g[rt]; while (top) { int u = stk[top]; if (cur[top] == g[u]) { dfn[u] = ++ind; seq[ind] = u; } if (cur[top] == -1) { rig[u] = ind; top--; } else { int v = e[cur[top]].v; cur[top] = e[cur[top]].next; if (v == pre[u]) continue; stk[++top] = v; cur[top] = g[v]; } } } void work(int a, int b) { int l1, r1; while (up[a] != up[b]) { if (h[up[a]] < h[up[b]]) swap(a, b); l1 = dfn[up[a]], r1 = dfn[a]; a = pre[up[a]]; } if (h[a] > h[b]) swap(a, b); l1 = dfn[a] + 1, r1 = dfn[b]; if (a != b) { } } int lca(int a, int b) { while (up[a] != up[b]) { if (h[up[a]] < h[up[b]]) swap(a, b); a = pre[up[a]]; } if (h[a] > h[b]) swap(a, b); return a; } void tree_init() { static bool ini = 0; if (!ini) { ini = 1; memset(g, -1, sizeof(g)); } else { for (int i = 0; i <= n; i++) g[i] = -1; } etot = 0; } int rt; void readedge() { for (int i = 1; i <= n; i++) { int x, y; gn(x); gn(y); if (x == 0) rt = y; else ae(x, y); } } int lis[111111]; int ansquer[3333333]; int quetot = 0; struct quer { int l, r; int x; int id; } que1[3333333], que0[3333333]; int que1tot = 0, que0tot = 0; int operator<(const quer &a, const quer &b) { return a.x < b.x; } void addque(int l, int r, int x, int bo) { int id = ++quetot; quer tmp = (quer){l, r, x, id}; if (bo) que1[++que1tot] = tmp; else que0[++que0tot] = tmp; } int poptot = 0; int popque() { int id = ++poptot; return ansquer[id]; } const int SEG_MAXN = 100000 + 5; int seg[SEG_MAXN * 4]; inline void segpu(int x) { seg[x] = max(seg[x << 1], seg[x << 1 | 1]); } void seginit_in(int l, int r, int x) { if (l == r) { seg[x] = -inf; } else { int mid = l + r >> 1; seginit_in(l, mid, x << 1); seginit_in(mid + 1, r, x << 1 | 1); segpu(x); } } int l1, r1, I; int sans; bool ans_bo; int stag; void segupd_in(int l, int r, int x) { if (l == r) { seg[x] = max(seg[x], stag); } else { int mid = l + r >> 1; if (I <= mid) segupd_in(l, mid, x << 1); else segupd_in(mid + 1, r, x << 1 | 1); segpu(x); } } void segque_in(int l, int r, int x) { if (l1 <= l && r <= r1) { if (!ans_bo) ans_bo = 1, sans = seg[x]; else sans = max(sans, seg[x]); } else { int mid = l + r >> 1; if (l1 <= mid) segque_in(l, mid, x << 1); if (r1 > mid) segque_in(mid + 1, r, x << 1 | 1); } } int segn; void segupd(int i, int v) { stag = v, I = i; segupd_in(1, segn, 1); } int segque(int l, int r) { if (l > r) return -inf; ans_bo = 0, l1 = l, r1 = r; segque_in(1, segn, 1); return sans; } void seginit(int n) { segn = n; seginit_in(1, segn, 1); } int ord[111111]; int cmpsz(int i, int j) { return sz[i] < sz[j]; } void gaoxunwen() { sort(que1 + 1, que1 + que1tot + 1); sort(que0 + 1, que0 + que0tot + 1); for (int i = (1), _ed = (n + 1); i < _ed; i++) ord[i] = i; sort(ord + 1, ord + 1 + n, cmpsz); seginit(n); int cur = 1; for (int i = (1), _ed = (que0tot + 1); i < _ed; i++) { int va = que0[i].x; while (cur <= n && sz[ord[cur]] <= va) { segupd(dfn[ord[cur]], sz[ord[cur]]); cur++; } ansquer[que0[i].id] = segque(que0[i].l, que0[i].r); } seginit(n); cur = n; for (int i = (que1tot + 1) - 1, _ed = (1); i >= _ed; i--) { int va = que1[i].x; while (cur >= 1 && sz[ord[cur]] >= va) { segupd(dfn[ord[cur]], -sz[ord[cur]]); cur--; } ansquer[que1[i].id] = -segque(que1[i].l, que1[i].r); } } struct quj { int l, r; } qq[111]; int cmpqj(const quj &a, const quj &b) { return a.l < b.l; } void getque(int nrt, int u, int val, int bo) { if (nrt != rt) { addque(dfn[nrt], rig[nrt], val, bo); } else { int qjtot = 0; int del = sz[u]; qq[++qjtot] = (quj){dfn[u], rig[u]}; int v = pre[u]; while (v) { qq[++qjtot] = (quj){dfn[up[v]], dfn[v]}; v = pre[up[v]]; } sort(qq + 1, qq + 1 + qjtot, cmpqj); qq[0].r = 0, qq[qjtot + 1].l = n + 1; for (int i = (0), _ed = (qjtot + 1); i < _ed; i++) { if (qq[i].r + 1 <= qq[i + 1].l - 1) addque(qq[i].r + 1, qq[i + 1].l - 1, val, bo); } v = pre[u]; while (v) { addque(dfn[up[v]], dfn[v], val + del, bo); v = pre[up[v]]; } } } int gotque(int nrt, int u, int val, int bo) { if (nrt != rt) { return popque(); } else { int ret; if (bo == 0) ret = -inf; else ret = inf; int qjtot = 0; int del = sz[u]; qq[++qjtot] = (quj){dfn[u], rig[u]}; int v = pre[u]; while (v) { qq[++qjtot] = (quj){dfn[up[v]], dfn[v]}; v = pre[up[v]]; } sort(qq + 1, qq + 1 + qjtot, cmpqj); qq[0].r = 0, qq[qjtot + 1].l = n + 1; for (int i = (0), _ed = (qjtot + 1); i < _ed; i++) { if (qq[i].r + 1 <= qq[i + 1].l - 1) { int goo = popque(); if (bo == 0) upmax(ret, goo); else upmin(ret, goo); } } v = pre[u]; while (v) { int goo = popque() - del; if (bo == 0) upmax(ret, goo); else upmin(ret, goo); v = pre[up[v]]; } return ret; } } void prework(int u) { int tot = 0; for (int i = g[u]; ~i; i = e[i].next) lis[++tot] = sz[e[i].v]; if (u != rt) { lis[++tot] = n - sz[u]; } sort(lis + 1, lis + 1 + tot); int masz = lis[tot]; int nrt = rt; for (int i = g[u]; ~i; i = e[i].next) if (sz[e[i].v] == masz) { nrt = e[i].v; } if (tot == 0) return; if (tot == 1) return; if (tot == 2) { int a = lis[1], c = lis[2]; getque(nrt, u, cei(c - a, 2), 1); getque(nrt, u, (c - a) / 2, 0); return; } else { int a = lis[1], b = lis[tot - 1], c = lis[tot]; getque(nrt, u, cei(c - a, 2), 1); getque(nrt, u, (c - a) / 2, 0); getque(nrt, u, c - b, 1); return; } } int work(int u) { int tot = 0; for (int i = g[u]; ~i; i = e[i].next) lis[++tot] = sz[e[i].v]; if (u != rt) { lis[++tot] = n - sz[u]; } sort(lis + 1, lis + 1 + tot); int masz = lis[tot]; int nrt = rt; for (int i = g[u]; ~i; i = e[i].next) if (sz[e[i].v] == masz) { nrt = e[i].v; } if (tot == 0) return 0; if (tot == 1) return lis[1]; if (tot == 2) { int a = lis[1], c = lis[2]; int d1 = gotque(nrt, u, cei(c - a, 2), 1); int d2 = gotque(nrt, u, (c - a) / 2, 0); return min(lis[2], min(max(c - d1, a + d1), max(c - d2, a + d2))); } else { int a = lis[1], b = lis[tot - 1], c = lis[tot]; int d1 = gotque(nrt, u, cei(c - a, 2), 1); int d2 = gotque(nrt, u, (c - a) / 2, 0); int d3 = gotque(nrt, u, c - b, 1); int ans = lis[tot]; upmin(ans, max(max(a + d1, b), c - d1)); upmin(ans, max(max(a + d2, b), c - d2)); upmin(ans, max(max(a + d3, b), c - d3)); return ans; } } int main() { gn(n); tree_init(); readedge(); build_hld(rt); for (int u = (1), _ed = (n + 1); u < _ed; u++) prework(u); gaoxunwen(); for (int u = (1), _ed = (n + 1); u < _ed; u++) printf( %d n , work(u)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 30; long long n, a[N], ans, limit = 1e9 + 10; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); reverse(a, a + n); for (int i = 0; i < n; i++) { ans += min(a[i], limit); limit = min(limit - 1, a[i] - 1); if (limit <= 0) break; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int Read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 3) + (x << 1) + ch - 0 ; ch = getchar(); } return x * f; } int n, m, q, a[200005], b[200005], f[200005], g[200005], h[200005], minn[800005], rev[200005]; vector<int> pos[200005], pos2[200005]; void build(int o, int l, int r) { if (l == r) { minn[o] = (g[l] == -1) ? 1E9 : g[l]; return; } int mid = (l + r) >> 1; build(o << 1, l, mid); build(o << 1 | 1, mid + 1, r); minn[o] = min(minn[o << 1], minn[o << 1 | 1]); } int query(int o, int l, int r, int nl, int nr) { if (nl <= l && r <= nr) return minn[o]; int mid = (l + r) >> 1, ans = 1E9; if (nl <= mid) ans = min(ans, query(o << 1, l, mid, nl, nr)); if (mid < nr) ans = min(ans, query(o << 1 | 1, mid + 1, r, nl, nr)); return ans; } signed main() { n = Read(), m = Read(), q = Read(); for (int i = 1; i <= n; i++) a[i] = Read(), rev[a[i]] = i; for (int i = 1; i <= m; i++) b[i] = Read(), pos[b[i]].push_back(i); memset(f, -1, sizeof(f)); memset(g, -1, sizeof(g)); memset(h, -1, sizeof(h)); for (int i = n; i >= 1; i--) { if (i == n) { for (int j = 0; j < pos[a[i]].size(); j++) f[pos[a[i]][j]] = pos[a[i]][j]; continue; } for (int j = 0; j < pos[a[i]].size(); j++) { vector<int>::iterator it = lower_bound(pos[a[i + 1]].begin(), pos[a[i + 1]].end(), pos[a[i]][j]); if (it == pos[a[i + 1]].end()) continue; f[pos[a[i]][j]] = f[*it]; } } for (int i = 1; i <= n; i++) { if (i == 1) { for (int j = 0; j < pos[a[i]].size(); j++) h[pos[a[i]][j]] = pos[a[i]][j]; continue; } for (int j = 0; j < pos[a[i]].size(); j++) { vector<int>::iterator it = lower_bound(pos[a[i - 1]].begin(), pos[a[i - 1]].end(), pos[a[i]][j]); if (it == pos[a[i - 1]].begin()) continue; --it; h[pos[a[i]][j]] = h[*it]; } } for (int i = 1; i <= n; i++) { for (int j = 0; j < pos[a[i]].size(); j++) pos2[a[i]].push_back(h[pos[a[i]][j]]); } for (int i = 1; i <= m; i++) { int ff = rev[b[i]]; if (ff == 1) { g[i] = f[i]; continue; } if (f[i] == -1) continue; vector<int>::iterator it = lower_bound(pos2[a[ff - 1]].begin(), pos2[a[ff - 1]].end(), f[i]); if (it == pos2[a[ff - 1]].end()) continue; int Pos = it - pos2[a[ff - 1]].begin(); g[i] = pos[a[ff - 1]][Pos]; } build(1, 1, m); for (int i = 1; i <= q; i++) { int l = Read(), r = Read(); int mpos = query(1, 1, m, l, r); if (mpos <= r) putchar( 1 ); else putchar( 0 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, vector<T> V) { for (auto v : V) os << v << ; return cout << ; } template <class T> ostream& operator<<(ostream& os, set<T> S) { for (auto s : S) os << s << ; return cout << ; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << P.first << << P.second; } const long long mod = 1e9 + 7; long long inv(long long i) { if (i == 1) return 1; return (mod - ((mod / i) * inv(mod % i)) % mod) % mod; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long pwr(long long a, long long b) { a %= mod; long long res = 1; while (b > 0) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T = 1; cin >> T; while (T--) { int n, c0, c1, h, x = 0, y = 0; cin >> n >> c0 >> c1 >> h; string s; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == 0 ) x++; else y++; } if (c0 >= c1 + h) { cout << x * h + n * c1 << n ; } else if (c1 >= c0 + h) { cout << y * h + n * c0 << n ; } else { cout << x * c0 + y * c1 << n ; } } } |
#include <bits/stdc++.h> long long n, m, k, a[11111], kq; long long min(long long a, long long b) { if (a < b) return a; return b; } int main() { scanf( %lld %lld %lld , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); if (n % 2 == 0) printf( 0 ); else { kq = a[1]; for (int i = 3; i <= n; i += 2) kq = min(kq, a[i]); kq = min(kq, (m / ((n + 1) / 2)) * k); printf( %lld , kq); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000 + 7; const int M = 32; const long long base = 1e18; const int mod = 999983; const int inf = 1e9 + 7; const double pi = acos(-1); const int maxn = N * 2; const double PI = acos(-1); const double ep = 1e-9; int n, m, s, e; int a[N], b[N]; int last[N]; map<int, int> st; vector<int> all[N]; int dp[2][N]; int getPos(int x) { if (st.count(x)) return st[x]; else return st[x] = st.size(); } void solve() { cin >> n >> m >> s >> e; for (int i = (0); i < (n); i++) scanf( %d , a + i); for (int j = (0); j < (m); j++) { scanf( %d , b + j); all[getPos(b[j])].push_back(j); } last[0] = -1; for (int i = (1); i < (N); i++) last[i] = inf; int C = s / e; int ans = 0; for (int i = (0); i < (n); i++) { if (st.count(a[i])) { int c = st[a[i]]; for (int j = C - 1; j >= 0; j--) { typeof(all[c].begin()) it = lower_bound(all[c].begin(), all[c].end(), last[j] + 1); if (it != all[c].end()) { if ((j + 1) * e + (i + 1 + (*it) + 1) <= s) { ans = max(ans, j + 1); } last[j + 1] = min(last[j + 1], *it); } } } } cout << ans; } int main() { int T = 1; for (int i = (1); i < (T + 1); i++) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int tt; cin >> tt; unordered_map<string, string> mp; unordered_set<string> s; for (int i = 0; i < tt; i++) { string s1; string s2; cin >> s1 >> s2; if (s.find(s1) == s.end()) { mp.insert({s1, s2}); s.insert(s2); } else { for (auto &it : mp) { if (s1 == it.second) { it.second = s2; s.insert(s2); } } } } cout << mp.size() << endl; for (auto it : mp) { cout << it.first << << it.second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int x[3], y[3]; bool is_between(int a, int b, int c) { return min(a, b) <= c && c <= max(a, b); } bool check(int i, int j, int k) { return (x[k] == x[i] || x[k] == x[j]) && is_between(y[i], y[j], y[k]) || (y[k] == y[i] || y[k] == y[j]) && is_between(x[i], x[j], x[k]); } int main() { for (int i = 0; i < 3; i++) { cin >> x[i] >> y[i]; } if (x[0] == x[1] && x[1] == x[2] || y[0] == y[1] && y[1] == y[2]) { cout << 1 << endl; } else if (check(0, 1, 2) || check(0, 2, 1) || check(1, 2, 0)) { cout << 2 << endl; } else { cout << 3 << endl; } } |
#include <bits/stdc++.h> using namespace std; long long n, k; int main() { cin >> n >> k; cout << k * (6 * n - 1) << endl; for (int i = 1; i <= n; i++) { int x = (i - 1) * 6 + 1; cout << k * x << << k * (x + 1) << << k * (x + 2) << << k * (x + 4) << endl; } } |
#include <bits/stdc++.h> using namespace std; inline long long getint() { long long ssum = 0, ff = 1; char ch; for (ch = getchar(); !isdigit(ch) && ch != - ; ch = getchar()) ; if (ch == - ) ff = -1, ch = getchar(); for (; isdigit(ch); ch = getchar()) ssum = ssum * 10 + ch - 0 ; return ssum * ff; } const long long M = 1e6 + 5, mod = 1e9 + 7; long long ans, f[M], g[M]; long long n, t[3]; signed main() { cin >> n; for (long long i = 1; i <= n; i++) t[getint()]++; f[0] = 1; f[1] = 1; for (long long i = 2; i <= t[1]; i++) (f[i] = f[i - 1] + f[i - 2] * (i - 1)) %= mod; g[0] = f[t[1]]; for (long long i = 1; i <= t[2]; i++) (g[i] = g[i - 1] * (t[1] + i)) %= mod; cout << g[t[2]] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, t; cin >> n; t = 2 * n; long long a[t], I; for (I = 0; I < t; I++) cin >> a[I]; sort(a, a + t); long long ans = (a[0] - a[n - 1]) * (a[n] - a[2 * n - 1]); for (I = 1; I < n; I++) ans = min(ans, (a[I] - a[I + n - 1]) * (a[0] - a[2 * n - 1])); cout << ans; return 0; } |
#include <bits/stdc++.h> inline int read() { int n = 0, ch = getchar(); for (; !isdigit(ch); ch = getchar()) ; for (; isdigit(ch); ch = getchar()) n = (n << 3) + (n << 1) + (ch ^ 48); return n; } int main() { int T = read(); while (T--) { int ans[3] = {0, 0, 0}; int n = read(); while (n--) ++ans[read() % 3]; int A = ans[0]; if (ans[1] < ans[2]) A += ans[1] + (ans[2] - ans[1]) / 3; else A += ans[2] + (ans[1] - ans[2]) / 3; printf( %d n , A); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class t> inline void read(t& res) { char ch; while (ch = getchar(), !isdigit(ch)) ; res = ch ^ 48; while (ch = getchar(), isdigit(ch)) res = res * 10 + (ch ^ 48); } template <class t> inline void print(t x) { if (x > 9) print(x / 10); putchar(x % 10 + 48); } const int e = 3e5 + 5, z1 = 29, z2 = 31, h1 = 1e9 + 7, h2 = 1e9 + 9; struct node { int s1, s2, len; node() {} node(int _s1, int _s2, int _len) : s1(_s1), s2(_s2), len(_len) {} } up[e], down[e]; vector<int> a[e], b[e], g[e]; int n, top[e], son[e], m, f[20][e], dep[e], mx[e]; int p1[e], p2[e], fa[e], dfn[e], id[e << 1], tim, logn[e << 1], c[21][e << 1]; int q1[e], q2[e], inv1, inv2; char s[e]; inline bool operator==(node a, node b) { return a.s1 == b.s1 && a.s2 == b.s2; } inline node operator+(node a, node b) { return node(((long long)a.s1 * p1[b.len] + b.s1) % h1, ((long long)a.s2 * p2[b.len] + b.s2) % h2, a.len + b.len); } inline int ksm(int x, int y, int mod) { int res = 1; while (y) { if (y & 1) res = (long long)res * x % mod; y >>= 1; x = (long long)x * x % mod; } return res; } inline void dfs1(int u, int pa) { int i; fa[u] = pa; dep[u] = dep[pa] + 1; mx[u] = dep[u]; s[u] -= a - 1; dfn[u] = ++tim; id[tim] = u; for (i = 0; i < 18; i++) f[i + 1][u] = f[i][f[i][u]]; node a = down[pa], b = up[pa]; down[u] = node(((long long)z1 * a.s1 + s[u]) % h1, ((long long)z2 * a.s2 + s[u]) % h2, a.len + 1); up[u] = node((b.s1 + (long long)p1[b.len] * s[u]) % h1, (b.s2 + (long long)p2[b.len] * s[u]) % h2, b.len + 1); for (auto v : g[u]) if (v != pa) { f[0][v] = u; dfs1(v, u); if (mx[v] > mx[u]) mx[u] = mx[v], son[u] = v; id[++tim] = u; } } inline void dfs2(int u, int pa, int fi) { top[u] = fi; if (son[u]) dfs2(son[u], u, fi); for (auto v : g[u]) if (v != pa && v != son[u]) dfs2(v, u, v); } inline int cmp(int x, int y) { return dep[x] < dep[y] ? x : y; } inline void init() { int i, j; logn[0] = -1; for (i = 1; i <= tim; i++) logn[i] = logn[i >> 1] + 1, c[0][i] = id[i]; for (j = 1; (1 << j) <= tim; j++) for (i = 1; i + (1 << j) - 1 <= tim; i++) c[j][i] = cmp(c[j - 1][i], c[j - 1][i + (1 << j - 1)]); } inline int lca(int l, int r) { l = dfn[l]; r = dfn[r]; if (l > r) swap(l, r); int k = logn[r - l + 1]; return cmp(c[k][l], c[k][r - (1 << k) + 1]); } inline int anc(int x, int k) { if (!k) return x; int y = logn[k], to; x = f[y][x]; k -= (1 << y); to = top[x]; if (dep[to] <= dep[x] - k) return b[to][dep[x] - k - dep[to]]; else return a[to][dep[to] - dep[x] + k]; } inline int sub1(int x, int y) { (x -= y) < 0 && (x += h1); return x; } inline int sub2(int x, int y) { (x -= y) < 0 && (x += h2); return x; } inline node query_up(int x, int y) { node a = up[x], b = up[y]; return node((long long)sub1(a.s1, b.s1) * q1[b.len] % h1, (long long)sub2(a.s2, b.s2) * q2[b.len] % h2, a.len - b.len); } inline node query_down(int x, int y) { node a = down[y], b = down[x]; return node(sub1(a.s1, (long long)b.s1 * p1[a.len - b.len] % h1), sub2(a.s2, (long long)b.s2 * p2[a.len - b.len] % h2), a.len - b.len); } inline node calc(int x, int y, int z, int len) { int d1 = dep[x] - dep[z] + 1, d2 = dep[x] + dep[y] - 2 * dep[z] + 1; if (len <= d1) { int u = anc(x, len - 1); return query_up(x, fa[u]); } else { int u = anc(y, d2 - len); return query_up(x, fa[z]) + query_down(z, u); } } inline int query(int x, int y, int u, int v) { int z = lca(x, y), w = lca(u, v), res = 0, l = 1, r = min(dep[x] + dep[y] - 2 * dep[z], dep[u] + dep[v] - 2 * dep[w]) + 1; while (l <= r) { int mid = l + r >> 1; if (calc(x, y, z, mid) == calc(u, v, w, mid)) res = mid, l = mid + 1; else r = mid - 1; } return res; } int main() { read(n); int i, x, y, u, v, j; scanf( %s , s + 1); for (i = 1; i < n; i++) { read(x); read(y); g[x].emplace_back(y); g[y].emplace_back(x); } inv1 = ksm(z1, h1 - 2, h1); inv2 = ksm(z2, h2 - 2, h2); p1[0] = p2[0] = q1[0] = q2[0] = 1; for (i = 1; i <= n; i++) { p1[i] = (long long)p1[i - 1] * z1 % h1; p2[i] = (long long)p2[i - 1] * z2 % h2; q1[i] = (long long)q1[i - 1] * inv1 % h1; q2[i] = (long long)q2[i - 1] * inv2 % h2; } dfs1(1, 0); dfs2(1, 0, 1); init(); for (i = 1; i <= n; i++) if (top[i] == i) { int x = i; for (j = 0; j <= mx[i] - dep[i]; j++) a[i].emplace_back(x), x = fa[x]; x = i; while (x) b[i].emplace_back(x), x = son[x]; } read(m); while (m--) { read(x); read(y); read(u); read(v); print(query(x, y, u, v)); putchar( n ); } return 0; } |
#include <bits/stdc++.h> #include <algorithm> using namespace std; #define int long long #define ll long long #define rep(i,a,b) for (int i = a; i < b; ++i) #define mod 1000000007 #define F first #define S second #define printer(v) for(auto f: v) cout<<f<< #define pb push_back #define mp make_pair #define all(c) c.begin(), c.end() #define ipair pair<int,int> #define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++) int bin_power(int x, unsigned int y){ // Modular Exponentiation (Power in Modular Arithmetic) int temp; if( y == 0) return 1; temp = bin_power(x, y / 2); if (y % 2 == 0) return (temp * temp)%mod; else return (x * temp * temp)%mod; // ll res = 1; // while(y){ // if(y & 1) res = (res * x)%mod; // y >>= 1; // x = (x * x)%mod; // } // return res; } int inverse_mod(int a){ return bin_power(a, mod-2); } vector<bool> isPrime_Seive_Of_Erastothenes(long n){ vector<bool> prime(n+1,true); prime[0] = prime[1] = false; for(long i=2;i*i<=n;i++){ if(prime[i]){ for(long j=i*i;j<=n;j+=i){ prime[j] = false; } } } return prime; } bool is_integer(float k){ return std::floor(k) == k; } int fact(int n); int nCr(int n, int r) { if(r > n - r) r = n - r; int ans = 1; int i; for(i = 1; i <= r; i++) { ans *= n - r + i; ans /= i; } return ans; } int fact(int n){ int res = 1; for (int i = 2; i <= n; i++){ res = res * i; res = res; } return res; } unsigned int gcd(unsigned int u, unsigned int v){ // Basic Euclidean Algorithm for GCD int shift; if (u == 0) return v; if (v == 0) return u; shift = __builtin_ctz(u | v); u >>= __builtin_ctz(u); do { v >>= __builtin_ctz(v); if (u > v) { unsigned int t = v; v = u; u = t; } v = v - u; } while (v != 0); return u << shift; } int gcdExtended(int a, int b, int *x, int *y){ // Extended Euclidean Algorithm if (a == 0){ *x = 0; *y = 1; return b; } int x1, y1; int gcd = gcdExtended(b%a, a, &x1, &y1); *x = y1 - (b/a) * x1; *y = x1; return gcd; } int binarySearch(int l, int r, int k){ if(l == r) return l; int mid = l + (r - l) / 2; cout<< ? << <<l+1<< <<mid+1<< n ; cout.flush(); int sum; cin>>sum; int x = mid - l + 1; if (x - sum >= k){ return binarySearch(l, mid, k); } else{ k -= (x - sum); return binarySearch(mid+1, r, k); } } bool isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n%2 == 0 || n%3 == 0) return false; for (int i=5; i*i<=n; i=i+6) if (n%i == 0 || n%(i+2) == 0) return false; return true; } int nextPrime(int N) { if (N <= 1) return 2; int prime = N; bool found = false; while (!found) { prime++; if (isPrime(prime)) found = true; } return prime; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T; cin>>T; while(T--){ int n; cin>>n; vector<int> A(n); int ans = INT_MAX; int index = 0; for (int i = 0; i < n; ++i){ cin>>A[i]; if(A[i] < ans){ ans = A[i]; index = i; } } cout<<n - 1<<endl; for(int i = 0; i < index; i++){ A[i] = ans + abs(index - i); cout<<i + 1<< <<index + 1<< <<A[i]<< <<ans<<endl; } for(int i = index + 1; i < n; i++){ A[i] = ans + abs(index - i); cout<<i + 1<< <<index + 1<< <<A[i]<< <<ans<<endl; } } return 0; } |
#include <bits/stdc++.h> #include <vector> #include <set> #include <string> #include <map> #include <cmath> #include <algorithm> typedef long long int ll; #define f first #define s second #define vi vector<int> #define ld long double #define pb push_back #define mp make_pair #define pii pair<int, int> #define floop(count,a, n) for(int count{a}; count < n; ++count) #define tr(c, it) for(auto it{c.begin()}; it != c.end(); ++it) #define lb lower_bound #define ub upper_bound #define bs binary_search #define newl n using namespace std; const int MOD = 1e9+7; const ld PI = acos(-1); const ld EPS = 1e-9; const ll INF = 1e18; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif int cas;cin>>cas; while(cas--){ int n; cin>>n; int a = sqrt(n); if(a*a == n) cout<<a<< n ; else cout<<a + 1<< n ; } cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int l, r; cin >> l >> r; if (r - l < 2) { printf( -1 ); return 0; } if (l & 1) l++; if (l + 2 > r) { printf( -1 ); return 0; } cout << l << << l + 1 << << l + 2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 18; const int MOD = 1000000007; char c[MAX]; int r[MAX], b[MAX]; int dp[1 << 16][125]; int red[1 << 16], blue[1 << 16]; void precalc(int n) { for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if (!(i & (1 << j))) { continue; } if (c[j] == R ) { red[i]++; } else { blue[i]++; } } } } int main() { for (int i = 0; i < 1 << 16; i++) { for (int j = 0; j < 125; j++) { dp[i][j] = -MOD; } } dp[0][0] = 0; long long rt = 0, bt = 0; int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %c %d %d , &c[i], &r[i], &b[i]); rt += r[i]; bt += b[i]; } precalc(n); long long maxi = 1000000000000000000; for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < 125; j++) { for (int k = 0; k < n; k++) { if (i & (1 << k)) { continue; } int res = i | (1 << k); int jnew = j + min(red[i], r[k]); dp[res][jnew] = max(dp[res][jnew], dp[i][j] + min(blue[i], b[k])); } maxi = min(maxi, max(rt - j, bt - dp[i][j])); } } printf( %lld n , n + maxi); } |
#include <bits/stdc++.h> using namespace std; template <class T> T Bitcnt(T a) { int sum = 0; while (a) { if (a & 1) sum++; a /= 2; } return sum; } template <class T> T Max3(T a, T b, T c) { return max(a, max(b, c)); } template <class T> T Lcm(T a, T b) { T tmp = __gcd(a, b); return (a / tmp) * b; } template <class T> T Pow(T a, T b) { T ans = 1; T base = a; while (b) { if (b & 1) ans = (ans * base); base = (base * base); b /= 2; } return ans; } long long Bigmod(long long a, long long b) { long long res = 1; long long pw = a % 1000000007LL; while (b > 0) { if (b & 1) res = (res * pw) % 1000000007LL; pw = (pw * pw) % 1000000007LL; b /= 2; } return res; } int a_x[] = {1, -1, 0, 0}; int a_y[] = {0, 0, 1, -1}; long long X, Y; void extend_euclid(long long a, long long b) { if (b == 0) { X = a; Y = 0; return; } extend_euclid(b, a % b); long long x, y; x = Y; y = X - (a / b) * Y; X = x; Y = y; } long long inverse_modulo(long long a, long long b) { extend_euclid(a, b); return (X + 1000000007LL) % 1000000007LL; } int main() { long long x; cin >> x; if (x == 2) { cout << -1; return 0; } if (x % 2 == 0) { long long b = (x / 2) * (x / 2) - 1; long long c = b + 2; cout << b << << c; return 0; } else { long long b = (x * x - 1) / 2; long long c = (x * x + 1) / 2; if (b <= 0 || c <= 0) { cout << -1; return 0; } cout << b << << c << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int freq[300]; string s; const int maxN = 2000; int primes[maxN]; int equs[maxN]; char result[maxN]; set<pair<int, char> > lets; int n; void sieve() { for (int i = 2; i < maxN; i++) { primes[i] = 1; } for (long long i = 2; i * i < maxN; i++) { if (primes[i] == 1) { for (long long j = i * i; j < maxN; j += i) { primes[j] = 0; } } } } int main(int argc, char const *argv[]) { cin >> s; sieve(); n = s.length(); for (int i = 0; i < n; i++) { freq[s[i]]++; } int tot = 0; for (int i = 0; i <= n; i++) { if (primes[i] == 1 && i * 2 <= n) { for (int j = i; j <= n; j += i) { if (equs[j] == 0) { tot++; } equs[j] = 1; } } } for (int i = 0; i < 300; i++) { if (freq[i] != 0) { lets.insert(make_pair(-freq[i], i)); } } if (-lets.begin()->first < tot) { cout << NO << endl; return 0; } for (int i = 1; i <= n; i++) { if (equs[i] == 1) { result[i] = lets.begin()->second; } } pair<int, char> tmp = *lets.begin(); tmp.first += tot; lets.erase(lets.begin()); lets.insert(tmp); for (int i = 1; i <= n; i++) { if (equs[i] == 0) { if (lets.begin()->first == 0) { lets.erase(lets.begin()); i--; continue; } result[i] = lets.begin()->second; tmp = *lets.begin(); tmp.first++; lets.erase(lets.begin()); lets.insert(tmp); } } cout << YES << endl; for (int i = 1; i <= n; i++) { cout << result[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Tp> inline void rd(Tp &x) { x = 0; int fh = 1; char ch = 1; while (ch != - && (ch < 0 || ch > 9 )) ch = getchar(); if (ch == - ) fh = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); x *= fh; } template <typename Tp> inline void bird(Tp &x) { x = 0; int fh = 1; char ch = 1; while (ch != - && (ch < 0 || ch > 9 )) ch = getchar(); if (ch == - ) fh = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 2 + ch - 0 , ch = getchar(); x *= fh; } template <typename Tp> inline void smax(Tp &x, Tp y) { if (x < y) x = y; } const int maxn = 100000 + 7; const int maxm = 200000 + 7; const int mod = 1000000007; int n, m; int Head[maxn], to[maxm], Next[maxm], w[maxm], tot; void add(int x, int y, int z) { to[++tot] = y, Next[tot] = Head[x], Head[x] = tot, w[tot] = z; } inline void Init(void) { rd(n); rd(m); for (int i = 1, x, y, z; i <= m; i++) { rd(x); rd(y); rd(z); add(x, y, z); add(y, x, z); } } bool vis[maxn]; int c[maxn]; void dfs(int x, int f, int col) { if (vis[x]) { if (c[x] != col) { puts( 0 ); exit(0); } return; } vis[x] = true; c[x] = col; for (int i = Head[x]; i; i = Next[i]) { int y = to[i]; if (y == f) continue; if (w[i]) dfs(y, x, col); else dfs(y, x, 3 - col); } } int fpow(long long x, int p) { long long res = 1ll; while (p) { if (p & 1) res = res * x % mod; p >>= 1; x = x * x % mod; } return res; } inline void Work(void) { long long ans = 1ll; for (int i = 1; i <= n; i++) { if (vis[i] == false) { dfs(i, 0, 1); ans = ans * 2 % mod; } } ans = ans * fpow(2, mod - 2) % mod; printf( %lld n , ans); } signed main(void) { Init(); Work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, ans[100], i, sum, z = 1; scanf( %d%d%d , &n, &a, &b); sum = ans[0] = 1; for (i = 1; i <= b; i++) { ans[i] = sum + 1; if (ans[i] > 50000) z = 0; sum += ans[i]; } if (z) { if (b != 0) { for (; i <= a + b; i++) { ans[i] = ans[i - 1] + 1; if (ans[i] > 50000) z = 0; } } else { sum = ans[0] = ans[1] = 1; for (i = 2; i <= 1 + a + b; i++) { ans[i] = ans[i - 1] + 1; if (ans[i] > 50000) z = 0; } if ((n != 1) && (a == n - 1)) z = 0; } } if (z == 0) printf( -1 ); else { for (; i < n; i++) { ans[i] = ans[i - 1]; } for (i = 0; i < n; i++) printf( %d , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 20; inline int read() { int ans = 0; char last = , ch = getchar(); while (ch< 0 | ch> 9 ) last = ch, ch = getchar(); while (ch >= 0 && ch <= 9 ) ans = ans * 10 + ch - 0 , ch = getchar(); if (last == - ) ans = -ans; return ans; } int n, k; vector<int> save[maxn]; int a[maxn], color[maxn], cnt[maxn], ls[maxn]; void solve() { n = read(), k = read(); for (int i = 0; i <= n; i++) save[i].clear(), color[i] = 0; for (int i = 0; i <= n - 1; i++) a[i] = read(), save[a[i]].push_back(i); int kd = 0; for (int i = 0; i <= n; i++) { for (int j = 0; j <= min(k, (int)(save[i].size())) - 1; j++) { color[save[i][j]] = kd + 1; ls[kd + 1] = save[i][j]; kd++; kd %= k; } } for (int i = 1; i <= kd; i++) color[ls[i]] = 0; for (int i = 0; i <= n - 1; i++) cout << color[i] << ; cout << n ; } int main() { int _t; _t = read(); while (_t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 201001; const int MAXK = 51; const double inf = 1e100; const double eps = 1e-10; int K, N; int tab[MAXN]; long long sum[MAXN]; double res[MAXN]; double odw[MAXN]; double dp[MAXK][MAXN]; struct Pt { double x, y; }; int ccw(const Pt& a, const Pt& b, const Pt& c) { double w = 0; w += a.x * (b.y - c.y); w += b.x * (c.y - a.y); w += c.x * (a.y - b.y); return w < -eps ? -1 : w > eps; } int main() { scanf( %d %d , &N, &K); for (int i = (1); i <= (N); ++i) { scanf( %d , &tab[i]); sum[i] = sum[i - 1] + tab[i]; odw[i] = odw[i - 1] + 1. / tab[i]; res[i] = res[i - 1] + (double)sum[i] / tab[i]; } for (int i = (1); i <= (N); ++i) dp[1][i] = res[i]; for (int k = (2); k <= (K); ++k) { vector<Pt> v; for (int i = (k - 1); i <= (N); ++i) { Pt pt = {-1. * sum[i], dp[k - 1][i] - res[i] + sum[i] * odw[i]}; while (v.size() >= 2 && ccw(v[((int)((v).size())) - 2], v.back(), pt) > 0) v.pop_back(); v.push_back(pt); } int p = 0; for (int i = (k); i <= (N); ++i) { while (p + 1 < ((int)((v).size())) && v[p].x * odw[i] + v[p].y > v[p + 1].x * odw[i] + v[p + 1].y) ++p; dp[k][i] = v[p].x * odw[i] + v[p].y + res[i]; } } printf( %.10lf n , dp[K][N]); } |
#include <bits/stdc++.h> using namespace std; const int N = 105, INF = 1 << 30, MOD = 1e9 + 7; int n, k; vector<int> adj[N]; long long cnt[N][N]; long long ans = 0, F[N]; long long sumOfProducts(vector<int>& arr, int n, int k) { long long dp[n + 1][n + 1]; memset(dp, 0, sizeof(dp)); long long cur_sum = 0; for (int i = 1; i <= n; i++) { dp[1][i] = arr[i - 1]; (cur_sum += arr[i - 1]) %= MOD; } for (int i = 2; i <= k; ++i) { long long temp_sum = 0; for (int j = 1; j <= n; j++) { (cur_sum -= dp[i - 1][j]) %= MOD; dp[i][j] = (arr[j - 1] * cur_sum) % MOD; (temp_sum += dp[i][j]) %= MOD; } cur_sum = temp_sum; } return (cur_sum + MOD) % MOD; } void dfs(int u, int root, int p, int d) { ++cnt[root][d]; for (int v : adj[u]) { if (v == p) continue; dfs(v, root, u, d + 1); } } void solve(int u) { memset(cnt, 0, sizeof(cnt)); if (adj[u].size() < k) return; for (int v : adj[u]) { dfs(v, v, u, 0); } for (int i = 0; i < n; ++i) { int CNT = 0; for (int v : adj[u]) if (cnt[v][i]) ++CNT; if (CNT < k) break; vector<int> C; for (int v : adj[u]) if (cnt[v][i]) C.push_back(cnt[v][i]); (ans += sumOfProducts(C, CNT, k)) %= MOD; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); F[0] = 1; for (int i = 1; i < N; ++i) F[i] = (F[i - 1] * i) % MOD; int t; cin >> t; while (t--) { ans = 0; cin >> n >> k; for (int i = 0; i < n; ++i) adj[i].clear(); for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; adj[--u].push_back(--v); adj[v].push_back(u); } if (k == 2) cout << n * (n - 1) / 2 << n ; else { for (int i = 0; i < n; ++i) solve(i); cout << ans % MOD << n ; } } } |
#include <bits/stdc++.h> using namespace std; const int MAXn = 1e5 + 10, MAXx = 4 * MAXn; struct salar { int l, r, max1, leftchild, rightchild, id; long long sum; salar() { sum = id = l = r = max1 = leftchild = rightchild = 0; } void idit(int v) { id = v; leftchild = 2 * v; rightchild = 2 * v + 1; } }; salar seg[MAXx]; int ar[MAXn], n, m; void build(int v, int l, int r) { seg[v].l = l, seg[v].r = r; seg[v].idit(v); if (r - l == 1) { seg[v].sum = ar[l]; seg[v].max1 = ar[l]; return; } int med = (l + r) / 2; build(seg[v].leftchild, l, med); build(seg[v].rightchild, med, r); seg[v].sum = seg[seg[v].leftchild].sum + seg[seg[v].rightchild].sum; seg[v].max1 = max(seg[seg[v].leftchild].max1, seg[seg[v].rightchild].max1); } long long get(int v, int l, int r) { if (max(l, seg[v].l) >= min(r, seg[v].r)) return 0; if (l <= seg[v].l && seg[v].r <= r) { return seg[v].sum; } return get(seg[v].leftchild, l, r) + get(seg[v].rightchild, l, r); } void domodule(int v, int l, int r, int x) { if (seg[v].max1 < x) return; if (max(l, seg[v].l) >= min(r, seg[v].r)) return; if (seg[v].r - seg[v].l == 1) { ar[seg[v].l] %= x; seg[v].sum = ar[seg[v].l]; seg[v].max1 = ar[seg[v].l]; return; } domodule(seg[v].leftchild, l, r, x); domodule(seg[v].rightchild, l, r, x); seg[v].sum = seg[seg[v].leftchild].sum + seg[seg[v].rightchild].sum; seg[v].max1 = max(seg[seg[v].leftchild].max1, seg[seg[v].rightchild].max1); } void change(int v, int l, int x) { if (l < seg[v].l || l >= seg[v].r) return; if (seg[v].r - seg[v].l == 1) { ar[seg[v].l] = x; seg[v].sum = ar[seg[v].l]; seg[v].max1 = ar[seg[v].l]; return; } change(seg[v].leftchild, l, x); change(seg[v].rightchild, l, x); seg[v].sum = seg[seg[v].leftchild].sum + seg[seg[v].rightchild].sum; seg[v].max1 = max(seg[seg[v].leftchild].max1, seg[seg[v].rightchild].max1); } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> ar[i]; build(1, 0, n); for (int i = 0; i < m; i++) { int type; cin >> type; if (type == 1) { int l, r; cin >> l >> r; l--; cout << get(1, l, r) << endl; } else if (type == 2) { int l, r, x; cin >> l >> r >> x; l--; domodule(1, l, r, x); } else { int l, x; cin >> l >> x; l--; change(1, l, x); } } } |
#include <bits/stdc++.h> using namespace std; int n, a[100005]; long long b[100005], dpMax[100005], dpMin[100005], ans = (1ll << 63); void setup() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n - 1; i++) b[i] = abs(a[i] - a[i + 1]); n--; } void xuly() { for (int i = n; i >= 1; i--) { dpMax[i] = -min(dpMin[i + 1], 0ll) + b[i]; dpMin[i] = -max(dpMax[i + 1], 0ll) + b[i]; ans = max(ans, dpMax[i]); } cout << ans; } int main() { iostream::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); setup(); xuly(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { for (int t = 0; t < n - 1; t++) { if (a[t] > a[t + 1]) { int j = t + 1; cout << t + 1 << << j + 1 << endl; int q = a[t]; a[t] = a[j]; a[j] = q; } } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long a, b, c, i, j, k, l, m, t, x, y, n, z; string s; map<long long, long long> mp; map<long long, long long>::iterator it; cin >> a >> s; n = s.size(); long long a1[n + 1]; a1[0] = 0; for (i = 1; i < n + 1; i++) a1[i] = s[i - 1] - 0 + a1[i - 1]; for (i = 0; i < n + 1; i++) { for (j = i + 1; j < n + 1; j++) { mp[a1[j] - a1[i]]++; } } c = 0; if (!a) c = (mp[0] * (n * (n + 1) - mp[0])); if (!a) { cout << c << endl; return 0; } for (i = 0; i < n + 1; i++) { for (j = i + 1; j < n + 1; j++) { if (a1[j] - a1[i] != 0) if (a % (a1[j] - a1[i]) == 0) { it = mp.find(a / (a1[j] - a1[i])); if (it != mp.end()) c = c + mp[a / (a1[j] - a1[i])]; } } } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795l; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; } return 0; } template <typename T1, typename T2> inline bool umn(T1& a, T2 b) { if (b < a) { a = b; return 1; } return 0; } struct Input { int n, k; vector<vector<int> > g; vector<int> h; vector<int> s; bool read() { if (!(cin >> n)) { return 0; } h.resize(n); for (int i = int(0); i < int(n); ++i) { cin >> h[i]; } g.assign(n, vector<int>()); for (int i = int(0); i < int(n - 1); ++i) { int u, v; cin >> u >> v; --u, --v; g[u].push_back(v); g[v].push_back(u); } cin >> k; s.resize(k); for (int i = int(0); i < int(k); ++i) { cin >> s[i]; } return 1; } void init(const Input& input) { *this = input; } }; struct Data : Input { int ans; void write() { cout << ans << n ; } virtual void solve() {} virtual void clear() { *this = Data(); } }; struct Solution : Data { vector<int> sc_best; vector<int> fs_best; vector<int> all_vals; vector<int> heights; vector<int> backw_pos; vector<int> forw_pos; vector<int> fail_pos; vector<int> fail_vers; void dfs(int x, int par, int first, int second) { if (first == -1 || h[x] <= h[first]) { second = first; first = x; } else if (second == -1 || h[x] <= h[second]) { second = x; } fs_best[x] = first; sc_best[x] = second; for (auto to : g[x]) { if (to != par) { dfs(to, x, first, second); } } } int mfit() { int ans = -1; int ln = 0; for (int i = int(0); i < int(((int)(all_vals).size())); ++i) { int cur = 0; vector<int> new_h; int rn = ln; while (rn < n && fs_best[heights[rn]] == all_vals[i]) ++rn; int fail_from = 0, fail_to = fail_pos[i]; int lp = forw_pos[i], rp = backw_pos[i]; bool ok = true; for (int j = int(ln); j < int(rn); ++j) { int a = h[all_vals[i]]; int b = 2000000000; if (sc_best[heights[j]] != -1) { b = h[sc_best[heights[j]]]; } if (fail_from != fail_to) { if (b >= fail_vers[fail_from]) { umx(cur, fail_vers[fail_from] - a); ++fail_from; } else { ok = false; } } else if (lp != rp) { if (b >= s[lp]) { umx(cur, s[lp] - a); ++lp; } else { ok = false; } } } if (ok && fail_from == fail_to && lp == rp && (ans == -1 || ans > cur)) { ans = cur; } ln = rn; } return ans; } void solve() { sort((s).begin(), (s).end()); reverse((s).begin(), (s).end()); sc_best.assign(n, -1); fs_best.assign(n, -1); dfs(0, -1, -1, -1); heights.resize(n); for (int i = int(0); i < int(n); ++i) { heights[i] = i; } sort((heights).begin(), (heights).end(), [&](int a, int b) { return (h[fs_best[a]] > h[fs_best[b]] || (h[fs_best[a]] == h[fs_best[b]] && fs_best[a] < fs_best[b]) || (fs_best[a] == fs_best[b] && (sc_best[b] != -1 && (sc_best[a] == -1 || h[sc_best[a]] > h[sc_best[b]])))); }); all_vals.clear(); for (auto x : heights) { if (all_vals.empty() || all_vals.back() != fs_best[x]) { all_vals.push_back(fs_best[x]); } } int lp = 0, ln = 0; int cnt = ((int)(all_vals).size()); forw_pos.assign(cnt, 0); fail_pos.assign(cnt, 0); for (int i = int(0); i < int(cnt - 1); ++i) { while (ln < n && fs_best[heights[ln]] == all_vals[i]) { int cur_h = h[all_vals[i]]; while (lp < k && cur_h < s[lp]) { fail_vers.push_back(s[lp]); ++lp; } if (lp < k) { ++lp; } ++ln; } forw_pos[i + 1] = lp; fail_pos[i + 1] = ((int)(fail_vers).size()); }; backw_pos.assign(cnt, k); int rp = k - 1, rn = n - 1; for (int i = int(cnt) - 1; i >= int(1); --i) { while (rn >= 0 && fs_best[heights[rn]] == all_vals[i]) { int cur_h = h[all_vals[i]]; if (rp >= 0) { if (cur_h >= s[rp]) { --rp; } } --rn; } backw_pos[i - 1] = rp + 1; } ans = mfit(); } void clear() { *this = Solution(); } }; Solution sol; int main() { cout.setf(ios::showpoint | ios::fixed); cout.precision(20); ios_base::sync_with_stdio(false); sol.read(); sol.solve(); sol.write(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long prod = 1; int arr[10]; for (int i = 0; i < 10; i++) arr[i] = 1; int p = 0; while (prod < n) { p %= 10; prod /= arr[p]; ++arr[p]; prod *= arr[p]; p++; } string s = codeforces ; for (int i = 0; i < 10; i++) { for (int j = 0; j < arr[i]; j++) cout << s[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, len, lcm, g, mod; long long a[266666], b[266666], c[266666], d[266666], e[266666], f[266666]; long long pw[266666], tmp[266666], w[2][266666], rev[266666]; long long mul(long long a, long long b) { return (a * b - (long long)(((long double)a * b + 0.5) / mod) * mod + mod) % mod; } long long qp(long long a, long long b) { long long c = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) c = mul(c, a); return c; } long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } void init() { for (len = 1; len <= 2 * n; len <<= 1) ; lcm = len / gcd(len, n) * n; mod = lcm + 1; while (mod < 5000000) mod += lcm; for (;; mod += lcm) { long long flag = 0; for (long long i = 2; i * i <= mod; i++) if (mod % i == 0) { flag = 1; break; } if (!flag) break; } for (g = 3;; g++) { long long flag = 0; for (long long i = 2; i * i <= mod - 1; i++) if ((mod - 1) % i == 0) { if (qp(g, i) == 1) { flag = 1; break; } if (qp(g, (mod - 1) / i) == 1) { flag = 1; break; } } if (!flag) break; } long long dan = qp(g, (mod - 1) / n); w[0][0] = w[1][0] = 1; for (long long i = 1; i < n; i++) w[0][i] = mul(w[0][i - 1], dan); for (long long i = 1; i < n; i++) w[1][i] = w[0][n - i]; for (long long i = 0; i < len; i++) { if (i & 1) rev[i] = (rev[i >> 1] >> 1) | (len >> 1); else rev[i] = rev[i >> 1] >> 1; } } void fft(long long *a, long long o) { for (long long i = 0; i < len; i++) if (i < rev[i]) swap(a[i], a[rev[i]]); for (long long k = 2, dan, now, t; k <= len; k <<= 1) { dan = qp(g, (o ? (mod - 1 - (mod - 1) / k) : (mod - 1) / k)); for (long long i = 0; i < len; i += k) { now = 1; for (long long j = 0; j < (k >> 1); j++, now = mul(now, dan)) { t = mul(a[i + j + (k >> 1)], now); a[i + j + (k >> 1)] = (a[i + j] - t + mod) % mod; a[i + j] = (a[i + j] + t) % mod; } } } if (o) { long long inv = qp(len, mod - 2); for (long long i = 0; i < len; i++) a[i] = mul(a[i], inv); } } void init(long long o) { for (long long i = 0; i < 2 * n; i++) pw[i] = w[o][(i * (i - 1) / 2) % n]; for (long long i = 2 * n; i < len; i++) pw[i] = 0; reverse(pw, pw + 2 * n); fft(pw, 0); } void dft(long long *a, long long o) { for (long long i = 0; i < n; i++) tmp[i] = mul(a[i], w[o][(n - (i * (i - 1) / 2) % n) % n]); for (long long i = n; i < len; i++) tmp[i] = 0; fft(tmp, 0); for (long long i = 0; i < len; i++) tmp[i] = mul(tmp[i], pw[i]); fft(tmp, 1); reverse(tmp, tmp + 2 * n); for (long long i = 0; i < n; i++) a[i] = mul(tmp[i], w[o][(n - (i * (i - 1) / 2) % n) % n]); if (o) { long long inv = qp(n, mod - 2); for (long long i = 0; i < n; i++) a[i] = mul(a[i], inv); } } long long ans[5], ans_cnt; signed main() { scanf( %lld , &n); init(); for (long long i = 0; i < n; i++) scanf( %lld , &b[i]); for (long long i = 0; i < n; i++) scanf( %lld , &c[i]); for (long long i = 0, inv = qp(mod - 2, mod - 2); i < n; i++) d[i] = mul((c[(i + 1) % n] - c[i] + mod) % mod, inv), e[i] = b[i]; init(0); dft(d, 0); reverse(e + 1, e + n); dft(e, 0); for (long long i = 0; i < n; i++) f[i] = mul(d[i], qp(e[i], mod - 2)); init(1); dft(f, 1); long long x2 = 0, x1 = 0, x0 = -c[0]; for (long long i = 0, now = 0, k; i < n; i++) { k = b[i] - now; x2++; x1 -= 2 * k; x0 += k * k; a[i] = ((f[i] < mod - f[i]) ? f[i] : f[i] - mod); if (a[i] > 1000000) { puts( 0 ); return 0; } now = now + a[i]; } long long det = x1 * x1 - 4 * x2 * x0, sq = sqrt(det); if (det < 0 || sq * sq != det) { puts( 0 ); return 0; } if (((-x1 - sq) % (2 * x2)) == 0) ans[++ans_cnt] = (-x1 - sq) / (2 * x2); if (((-x1 + sq) % (2 * x2)) == 0 && (!ans_cnt || sq)) ans[++ans_cnt] = (-x1 + sq) / (2 * x2); printf( %lld n , ans_cnt); if (!ans_cnt) return 0; for (long long t = 1, now; t <= ans_cnt; t++) { now = ans[t]; printf( %lld , now); for (long long i = 0; i < n - 1; i++) { now = now + a[i]; printf( %lld , now); } puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; const int maxe = maxn * 2; int fir[maxn]; struct Edge { int v, c, nxt; Edge(int v = 0, int c = 0, int nxt = 0) : v(v), c(c), nxt(nxt) {} } edge[maxe]; int cnt; bool cir[maxn]; void init() { memset(fir, -1, sizeof(fir)); cnt = 0; } void add_edge(int u, int v, int c) { edge[cnt] = Edge(v, c, fir[u]); fir[u] = cnt++; } bool dfs(int from, int to, int c) { cir[from] = true; if (from == to) return true; for (int e = fir[from]; e != -1; e = edge[e].nxt) if (!cir[edge[e].v]) { if (edge[e].c != c) continue; if (dfs(edge[e].v, to, c)) { return true; } } return false; } int solve(int from, int to) { int ans = 0; bool vis[maxn]; memset(vis, false, sizeof(vis)); for (int e = fir[from]; e != -1; e = edge[e].nxt) if (!vis[edge[e].c]) { memset(cir, false, sizeof(cir)); if (dfs(from, to, edge[e].c)) { ans++; } vis[edge[e].c] = true; } return ans; } int main() { int n, m; scanf( %d%d , &n, &m); init(); for (int i = 0; i < m; i++) { int u, v, c; scanf( %d%d%d , &u, &v, &c); add_edge(u, v, c); add_edge(v, u, c); } int q; scanf( %d , &q); while (q--) { int u, v; scanf( %d%d , &u, &v); printf( %d n , solve(u, v)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e17; struct item { long long t, d, p; }; long long n, dp[105][2100][2], ans; item arr[200], arrc[200]; long long solve(long long pos, long long tim) { if (pos > n) return 0; if (dp[pos][tim][0]) return max(dp[pos][tim][0], dp[pos][tim][1]); long long ts = tim + arr[pos].t; dp[pos][tim][0] = solve(pos + 1, tim); if (ts < arr[pos].d) dp[pos][tim][1] = solve(pos + 1, ts) + arr[pos].p; return max(dp[pos][tim][0], dp[pos][tim][1]); } bool comp(item l, item r) { if (l.d == r.d) { if (l.t == r.t) return l.p > r.p; return l.t < r.t; } return l.d < r.d; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> arr[i].t >> arr[i].d >> arr[i].p; arrc[i] = {arr[i].t, arr[i].d, arr[i].p}; } sort(arr + 1, arr + n + 1, comp); ans = solve(1, 0); cout << ans << endl; long long ansar[300], m = 0; long long tim = 0; for (int i = 1; i <= n && ans; i++) { if (dp[i][tim][1] == ans) { ansar[++m] = i; tim += arr[i].t; ans -= arr[i].p; } } cout << m << endl; for (int i = 1; i <= m; i++) { long long first = ansar[i]; for (int j = 1; j <= n; j++) { if (arr[first].t == arrc[j].t && arr[first].d == arrc[j].d && arr[first].p == arrc[j].p) { cout << j << ; arrc[j].t = 1000000000000; break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> ve; const int MAX = 51; long long C[MAX][MAX]; void build() { for (int i = 0; i < MAX; ++i) for (int j = 0; j < MAX; ++j) C[i][j] = (j == 0) ? 1 : ((i == 0) ? 0 : C[i - 1][j - 1] + C[i - 1][j]); } double memo[MAX][MAX][MAX]; double solve(int i, int last, int mx) { if (i == m) { if (last != n) return 0; return mx; } double &ret = memo[i][last][mx]; if (ret == ret) return ret; ret = 0; for (int j = 0; j <= n - last; j++) { ret += C[n - last][j] * 1LL * solve(i + 1, last + j, max(mx, (j / ve[i]) + (j % ve[i] != 0))); } return ret; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); build(); cin >> n >> m; for (int i = 0; i < m; i++) { int x; cin >> x; ve.push_back(x); } memset(memo, -1, sizeof memo); cout << fixed << setprecision(20) << powl(1.0 / m, n) * solve(0, 0, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int s[100005]; int bas[100005]; const int INF = 0x7fffffff; bool cmp(int a, int b) { return a > b; } int main() { int n, m; while (scanf( %d , &m) != EOF) { memset(s, 0, sizeof(s)); memset(bas, 0, sizeof(bas)); int i, j; int minbas = INF; for (i = 0; i < m; i++) { scanf( %d , &bas[i]); if (minbas > bas[i]) minbas = bas[i]; } scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &s[i]); } sort(s, s + n, cmp); int sum = 0; int tot = 0; int pan = 0; for (i = 0; i < n;) { for (j = 0; j < minbas; j++) { sum += s[i]; i++; if (i >= n) { pan = 1; break; } } i += 2; } printf( %d n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, arr[55] = {}, sm = 0, dp[55][2] = {}; long long rec(int ind, bool dt) { if (ind == n - 1) { if (dt) return 0; else return arr[ind]; } if (dp[ind][dt] != -1) return dp[ind][dt]; if (dt) return dp[ind][dt] = min(rec(ind + 1, dt) + arr[ind], rec(ind + 1, !dt)); else return dp[ind][dt] = max(rec(ind + 1, dt), rec(ind + 1, !dt) + arr[ind]); } int main() { cin >> n; for (int i = 0; i < 55; i++) { dp[i][0] = -1; dp[i][1] = -1; } for (int i = 0; i < n; i++) { cin >> arr[i]; sm += arr[i]; } long long ans = rec(0, 0); cout << (sm - ans) << << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[251][251][51]; bool check(int n, int ans, int t) { if (t == 0) { if (ans == n) return 1; return 0; } bool ret = 0; if (arr[n][ans + 3][t - 1] == -1) arr[n][ans + 3][t - 1] = check(n, ans + 3, t - 1); ret |= arr[n][ans + 3][t - 1]; if (arr[n][ans + 4][t - 1] == -1) arr[n][ans + 4][t - 1] = check(n, ans + 4, t - 1); ret |= arr[n][ans + 4][t - 1]; if (arr[n][ans + 5][t - 1] == -1) arr[n][ans + 5][t - 1] = check(n, ans + 5, t - 1); ret |= arr[n][ans + 5][t - 1]; return ret; } int main() { for (int i = 0; i < 251; i++) for (int ii = 0; ii < 251; ii++) for (int iii = 0; iii < 51; iii++) arr[i][ii][iii] = -1; int n, k; cin >> n >> k; for (int i = 0; i <= n; i++) { if (check(k - i * 2, 0, n - i)) { cout << i; return 0; } } cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 1000010; struct Point { long long x, y; Point() {} Point(long long x, long long y) : x(x), y(y) {} bool operator<(const Point &rhs) const { if (x == rhs.x) return y < rhs.y; return x < rhs.x; } } p[5000]; long long fac[maxn]; long long powmod(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } long long C(long long n, long long m) { if (m > n || m < 0) return 0; long long s1 = fac[n], s2 = fac[m] * fac[n - m] % mod; return s1 * powmod(s2, mod - 2) % mod; } long long dp[maxn]; int n, m, k; int main() { fac[0] = 1LL; for (int i = 1; i < maxn; i++) fac[i] = fac[i - 1] * i % mod; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= k; i++) { scanf( %lld%lld , &p[i].x, &p[i].y); p[i].x--, p[i].y--; } p[++k].x = n - 1; p[k].y = m - 1; sort(p + 1, p + k + 1); for (int i = 1; i <= k; i++) { dp[i] = C(p[i].x + p[i].y, p[i].x); for (int j = 1; j < i; j++) { if (p[j].y <= p[i].y) { dp[i] += (mod - dp[j] * C(p[i].x - p[j].x + p[i].y - p[j].y, p[i].x - p[j].x)); dp[i] %= mod; } } } printf( %lld n , (dp[k] + mod) % mod); } |
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; long long int mx = 0; for (long long int i = 0; i < a.size(); i++) { long long int g = (a[i] - 0 ); mx = max(mx, g); } for (long long int i = 0; i < b.size(); i++) { long long int g = (b[i] - 0 ); mx = max(mx, g); } mx++; string h = ; long long int c = 0, s = 0; for (long long int i = 0; i < 20; i++) { if (a.size() < i) a = 0 + a; if (b.size() < i) b = 0 + b; } for (long long int i = 18; i >= 0; i--) { long long int q = (a[i] - 0 ), w = (b[i] - 0 ); s = (q + w + c) % mx; char ch = ( 0 + s); h = ch + h; c = (q + w + c) / mx; } long long int k = 0; while (h[k] == 0 ) k++; cout << 19 - k << endl; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e6; const long long int inf = 1e14; const long long int mod = 1e9 + 7; const double PI = acos(-1); long long int powm(long long int a, long long int b) { a = a % mod; long long int res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; } long long int n, a[N]; long double f(long double xn) { set<long double> b = {0}; long double su = 0, ans = 0; long double ma = 0, mi = 0; for (int i = 0; i < n; i++) { su += (long double)a[i] - xn; ans = max({ans, abs(su - mi), abs(su - ma)}); ma = max(ma, su); mi = min(mi, su); } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; cout << fixed << std::setprecision(10); while (t--) { cin >> n; long double B = -100000; long double A = 100000; for (int i = 0; i < n; i++) { cin >> a[i]; B = max(B, (long double)a[i]); A = min(A, (long double)a[i]); } for (int i = 0; i < 100; i++) { long double m1 = (A * 2 + B) / 3.0; long double m2 = (A + 2 * B) / 3.0; if (f(m1) > f(m2)) A = m1; else B = m2; } cout << f(A) << n ; } } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const long long mod = 1e9 + 7; long long a[200010]; int main() { long long n, k; cin >> n >> k; long long i; for (i = 1; i <= n; i++) scanf( %d , &a[i]); long long sum = 0; for (i = 1; i <= n; i++) { long long temp = min(i, n - i + 1); temp = min(temp, n - k + 1); temp = min(temp, k); sum += temp * a[i]; } double ans = double(sum) / (n - k + 1); printf( %.10lf , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; while (cin >> n) { int m = n % 4; cout << (m == 0 || m == 3 ? 0 : 1) << endl << n / 2 << ; for (int i = n; i >= 4; i -= 4) cout << i - 1 << << i - 2 << ; if (m == 2) cout << 1 << endl; else if (m == 3) cout << 3 << endl; else cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; int n, m, k; struct node { int x, y, step; }; char s[maxn][maxn]; bool vis[maxn][maxn][4]; int go[4][2] = {0, 1, 1, 0, 0, -1, -1, 0}; int bfs(int x, int y, int tx, int ty) { for (int i = 0; i < 4; ++i) vis[x][y][i] = 1; queue<node> q; node tmp, tem; tem.x = x, tem.y = y, tem.step = 0; q.push(tem); int xx, yy; while (!q.empty()) { tmp = q.front(); q.pop(); if (tmp.x == tx && tmp.y == ty) return tmp.step; for (int i = 0; i < 4; i++) { tem = tmp; tem.step++; for (int j = 1; j <= k; j++) { xx = tem.x + go[i][0]; yy = tem.y + go[i][1]; if (xx < 0 || xx > n) break; if (yy < 0 || yy > m) break; if (s[xx][yy] != . ) break; if (vis[xx][yy][i]) break; tem.x = xx; tem.y = yy; vis[xx][yy][i] = 1; q.push(tem); } } } return -1; } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); int x, xx, y, yy; scanf( %d%d%d%d , &x, &y, &xx, &yy); printf( %d n , bfs(x, y, xx, yy)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long A[100005]; long long D[100005]; long long qzh[100005]; long long hzh[100005]; long long ans[100005]; long long dp[100005]; int main() { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) scanf( %lld , &A[i]); for (int i = 1; i <= n; i++) scanf( %lld , &D[i]); for (int i = n; i >= 1; i--) { hzh[i] = A[i] + hzh[i + 1]; dp[i] = max(dp[i + 1], hzh[i] - D[i]); } long long MIN = D[1]; for (int i = 1; i <= n; i++) { MIN = min(MIN, D[i]); qzh[i] = qzh[i - 1] + A[i]; ans[i] = max(dp[i + 1], qzh[i] - MIN + dp[i + 1]); } if (k == 0) { long long res = 0; for (int i = 1; i <= n; i++) { res = max(res, dp[i]); } cout << res << endl; } else if (k == 1) { long long res = 0; for (int i = 1; i < n; i++) { res = max(res, ans[i]); } MIN = min(A[n], D[n]); for (int i = n - 1; i >= 1; i--) { dp[i] = hzh[i] - D[i]; res = max(res, dp[i] - MIN); MIN = min(MIN, min(A[i], D[i])); } cout << res << endl; } else { long long res = 0; for (int i = 1; i < n; i++) { res = max(res, qzh[n] - D[i]); } res = max(res, A[n] - D[n]); cout << res << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 50; int mod = 1e9 + 7; long long add(long long a, long long b) { return (a % mod + b % mod + mod) % mod; } long long mul(long long a, long long b) { return (a % mod * (b % mod)) % mod; } int dp[N][3]; int solve(int rem, int val) { if (rem == 0) return val == 1; int &ans = dp[rem][val]; if (~ans) return ans; ans = solve(rem - 1, val); ans = add(ans, solve(rem - 1, val * -1)); return ans; } int dp2[N][20]; int solve2(int remp, int rem) { if (remp == 0) return rem == 0; int &ans = dp2[remp][rem]; if (~ans) return ans; ans = solve2(remp - 1, rem); if (rem) ans = add(ans, solve2(remp, rem - 1)); return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); memset(dp, -1, sizeof(dp)); memset(dp2, -1, sizeof(dp2)); int t; cin >> t; while (t--) { int x, y; cin >> x >> y; map<int, int> co; for (int i = 2; i * i <= x; i++) { while (x % i == 0) { x /= i; co[i]++; } } if (x != 1) co[x]++; long long ans = solve(y, 1); for (auto it : co) ans = mul(ans, solve2(y, it.second)); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a[100001]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cout << 1 << << n << endl; cout << 0 << ; for (int i = 1; i < n; i++) cout << (n * (n - 1 - a[i])) << ; cout << endl; cout << 1 << << 1 << endl; cout << (-a[0]) << endl; if (n > 1) { cout << 2 << << n << endl; for (int i = 1; i < n; i++) cout << ((n - 1) * (a[i] - n)) << ; cout << endl; } else { cout << 1 << << 1 << endl; cout << 0 << endl; } return 0; } |
#include<cstdio> #include<iomanip> #include<iostream> #include<cstring> #include<string> #include<cmath> #include<map> #include<algorithm> #include<vector> #include<set> #include<queue> #include<unordered_map> #define Quick ios::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define ll long long #define P pair<int,int> #define inf 0x3f3f3f3f #define endl n #define PI acos(-1) #define mem(a, b) memset(a, b, sizeof a) using namespace std; const int N =2007; const int mod = 1e9 + 7; ll a[N]; ll dp[N][N]; int main() { Quick; //重新排序使其在每一位上的（max-min）总和最小 int n; cin >> n; for (int i = 0; i < n; i++)cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dp[i][j] = 1e12;//初始dp数组保留最大值。 } } //初始化dp数组。 dp[0][0] = a[n - 1] - a[0]; //减小这个差值，可以删掉一个最小的或者最大的 for (int i = 1; i < n; i++) { //只删除最大值i次 dp[i][0] = dp[i - 1][0] + a[n - i - 1] - a[0]; //删除最大值从右边删除，那么删除之后当前最大值就是a[n-i-1]; //只删除最小值i次 dp[0][i] = dp[0][i - 1] + a[n - 1] - a[i]; //删除最小值从左边删除，那么删除之后当前最小值就是a[i]。 } //接下来开始进行状态转移取最优。 for (int i = 1; i < n; i++) { for (int j = 1; i + j < n; j++) { //i+j不得超过n次。 dp[i][j] = min(dp[i][j], dp[i - 1][j] + a[n - i - 1] - a[j]);//选择删除最大值 dp[i][j] = min(dp[i][j], dp[i][j - 1] + a[n - i - 1] - a[j]);//选择删除最小值 } } ll res = 1e12; for (int i = 0; i < n; i++) { res = min(res, dp[i][n - i - 1]); } cout << res << endl; } |
#include<bits/stdc++.h> using namespace std; void solve() { long long int n,s=0,sum=0,k; cin>>n; long long int arr[n+1]; for(int i=1;i<=n;i++) { cin>>arr[i]; if(i%2==1) sum=sum+arr[i]; else s=s+arr[i];} if(sum>=s) { for(int i=1;i<=n;i++) { if(i%2==1) cout<<arr[i]<< ; else cout<< 1 << ; } } else { for(int i=1;i<=n;i++) { if(i%2==0) cout<<arr[i]<< ; else cout<< 1 << ; } } cout<<endl; } int main() { int t=1; cin >> t; while(t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; struct point { double x, y; point() {} point(double _x, double _y) { x = _x; y = _y; } point operator+(const point &t) { return point(x + t.x, y + t.y); } point operator-(const point &t) { return point(x - t.x, y - t.y); } double dist(const point &t) { return ((x - t.x) * (x - t.x) + (y - t.y) * (y - t.y)); } }; struct line { double a, b, c; line() {} line(double _a, double _b, double _c) { a = _a; b = _b; c = _c; } void build(const point &p, const point &q) { a = p.y - q.y; b = q.x - p.x; c = -(p.x * (p.y - q.y) + p.y * (q.x - p.x)); } }; int n, lt, rt; point p[2000]; double mx = 1e+15, mn = -(1e+15); bool intersect(const line &a, point &res) { if (fabs(a.a) <= eps) return false; res.y = p[0].y; res.x = (-a.c - (a.b * res.y)) / a.a; return true; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lf%lf , &p[i].x, &p[i].y); p[n] = p[0]; lt = int(min(p[0].x, p[1].x)); rt = int(max(p[0].x, p[1].x)); p[n + 1] = p[1]; for (int i = 1; i < n; i++) { line l; l.build(p[i], p[i + 1]); point res, tt = p[i + 1] - p[i]; if (intersect(l, res)) { if (tt.y < eps) mx = min(mx, res.x); else mn = max(mn, res.x); } else if ((p[1].x - p[0].x) * tt.x > eps) { printf( 0 n ); return 0; } } int x = ceil(mn - eps), y = floor(mx + eps); printf( %d n , max(0, min(y, rt) - max(x, lt) + 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long min(long long a, long long b) { return (a < b) ? a : b; } int main() { long long n, m, b_max_1 = 0, b_max_2 = 0, g_min = 1e9; long long sum_b = 0, sum_g = 0; cin >> n >> m; long long b[n], g[m]; for (int i = 0; i < n; ++i) { cin >> b[i]; sum_b += b[i]; if (b[i] > b_max_1) { b_max_2 = b_max_1; b_max_1 = b[i]; } else if (b[i] > b_max_2) { b_max_2 = b[i]; } } sum_b = sum_b * m; for (int i = 0; i < m; ++i) { cin >> g[i]; sum_g += g[i]; g_min = min(g_min, g[i]); } if (b_max_1 > g_min) { cout << -1 << n ; return 0; } if (g_min > b_max_1) sum_b = sum_b + sum_g - (m - 1) * b_max_1 - b_max_2; else sum_b = sum_b - m * b_max_1 + sum_g; cout << sum_b << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[200010]; struct seg { int val, idx; } tree1[600010], tree2[600010]; void build(int node, int s, int e) { if (s > e) return; if (s == e) { tree1[node].val = a[s]; tree1[node].idx = s; tree2[node].val = a[s]; tree2[node].idx = s; return; } int mid = (s + e) / 2; build(2 * node, s, mid); build(2 * node + 1, mid + 1, e); if (tree1[2 * node].val > tree1[2 * node + 1].val) tree1[node].idx = tree1[2 * node + 1].idx; else tree1[node].idx = tree1[2 * node].idx; if (tree2[2 * node].val > tree2[2 * node + 1].val) tree2[node].idx = tree2[2 * node].idx; else tree2[node].idx = tree2[2 * node + 1].idx; tree1[node].val = min(tree1[2 * node].val, tree1[2 * node + 1].val); tree2[node].val = max(tree2[2 * node].val, tree2[2 * node + 1].val); } seg query1(int node, int s, int end, int l, int r) { if (s > end || s > r || end < l) { seg temp; temp.val = 1000000000; temp.idx = -1; return temp; } if (s >= l && end <= r) return tree1[node]; seg res1 = query1(2 * node, s, (s + end) / 2, l, r); seg res2 = query1(2 * node + 1, (s + end) / 2 + 1, end, l, r); seg res; if (res1.val < res2.val) { res.val = res1.val; res.idx = res1.idx; } else { res.val = res2.val; res.idx = res2.idx; } return res; } seg query2(int node, int s, int end, int l, int r) { if (s > end || s > r || end < l) { seg temp; temp.val = -1000000000; temp.idx = -1; return temp; } if (s >= l && end <= r) return tree2[node]; seg res1 = query2(2 * node, s, (s + end) / 2, l, r); seg res2 = query2(2 * node + 1, (s + end) / 2 + 1, end, l, r); seg res; if (res1.val > res2.val) { res.val = res1.val; res.idx = res1.idx; } else { res.val = res2.val; res.idx = res2.idx; } return res; } int main() { int n; cin >> n; int q; cin >> q; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } build(1, 0, n - 1); while (q--) { int l, r, x; scanf( %d %d %d , &l, &r, &x); l--; r--; seg mx = query1(1, 0, n - 1, l, r); seg mi = query2(1, 0, n - 1, l, r); if (mx.val == x && mi.val == x) { printf( -1 n ); } else if (mx.val == x) { printf( %d n , mi.idx + 1); } else printf( %d n , mx.idx + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18 + 10; const int inf = 1e9 + 10; const int N = 1e6 + 10; vector<int> t[N * 4]; void build(int v, int tl, int tr, vector<int> &a) { if (tl == tr) { t[v].push_back(a[tl]); } else { int tm = (tl + tr) / 2; build(v * 2, tl, tm, a); build(v * 2 + 1, tm + 1, tr, a); t[v] = t[v * 2]; for (auto i : t[v * 2 + 1]) { t[v].push_back(i); } sort(t[v].begin(), t[v].end()); } } int get(int v, int tl, int tr, int l, int r, int x) { if (l > r) { return 0; } if (tl == l && tr == r) { int ind = lower_bound(t[v].begin(), t[v].end(), x) - t[v].begin(); if (ind != t[v].size() && t[v][ind] == x) { return 1; } else { return 0; } } int tm = (tl + tr) / 2; int ql = get(v * 2, tl, tm, l, min(r, tm), x); int qr = get(v * 2 + 1, tm + 1, r, max(l, tm + 1), r, x); return (ql + qr); } int main() { cin.tie(0); ios::sync_with_stdio(0); int n, k; cin >> n >> k; vector<int> a(k), last(n + 1, k); for (int i = 0; i < k; i++) { cin >> a[i]; if (last[a[i]] == k) { last[a[i]] = i; } } build(1, 0, k - 1, a); int ans = 0; for (int i = 1; i <= n; i++) { if (last[i] == k) { ans++; } if (i > 1 && get(1, 0, k - 1, last[i], k - 1, i - 1) == 0) { ans++; } if (i < n && get(1, 0, k - 1, last[i], k - 1, i + 1) == 0) { ans++; } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool As; char c; int n, m, k; inline void read(int& a) { a = 0; do c = getchar(); while (c < 0 || c > 9 ); while (c <= 9 && c >= 0 ) a = (a << 3) + (a << 1) + c - 0 , c = getchar(); } int Min[1211]; double A[11][11]; bool Has[11][11]; const double eps = 1e-7; int Matrix(int n) { int o = 1; double res = 1; if (n < 0) return 0; for (int i = 0; i < n; i++) { int j = -1; for (int t = i; t < n; t++) if (((A[t][i]) > 0 ? (A[t][i]) : -(A[t][i])) > eps) { j = t; break; } if (j ^ i) o ^= 1; if (j == -1) return 0; for (int t = 0; t < n; t++) swap(A[j][t], A[i][t]); for (int j = i + 1; j < n; j++) if (((A[j][i]) > 0 ? (A[j][i]) : -(A[j][i])) > eps) { double U = A[j][i] / A[i][i]; for (int k = 0; k < n; k++) A[j][k] -= U * A[i][k]; } res *= A[i][i]; } if (o) return res + 0.1; else return -res + 0.1; } int Build(int S) { vector<int> Q; Q.clear(); memset(A, 0, sizeof(A)); while (S) Q.push_back(Min[S]), S ^= 1 << Min[S]; for (int i = 0; i < Q.size(); i++) for (int j = 0; j < i; j++) if (Has[Q[i]][Q[j]]) A[i][j]--, A[j][i]--, A[j][j]++, A[i][i]++; return Q.size() - 1; } int Cnt[2002]; int Pow(int a, int x) { int res = 1; for (x; x; x >>= 1, a = a * a) if (x & 1) res = res * a; return res; } int F[2002]; int G[2002]; int main() { Min[0] = -1; for (int i = 1; i < 1024; i++) Cnt[i] = (i & 1) ? Cnt[i >> 1] + 1 : Cnt[i >> 1], Min[i] = (i & 1) ? 0 : (Min[i >> 1] + 1); read(n), read(m), read(k); while (m--) { int a, b; read(a), read(b); a--, b--; Has[b][a] = Has[a][b] = true; } int t = 1 << n; t--; for (int i = 1; i <= t; i++) { int W = 1; for (int j = 0; j < n; j++) if ((1 << j) & i) { int f = 0; for (int k = 0; k < n; k++) if (!(i & (1 << k))) if (Has[j][k]) f++; W *= f; } int df; G[i] = F[i] = W * (df = Matrix(Build(t ^ i))); } int Ans = 0; for (int i = t; ~i; i--) { if (Cnt[i] == k) Ans += G[i]; int j = (i - 1) & i; while (j) { G[j] += (Cnt[j ^ i] & 1 ? -1 : 1) * F[i]; j = i & (j - 1); } } cout << Ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, ans; float x, dis, t; struct ponto { float ini, fim; bool operator<(const ponto &lhs) const { return lhs.ini > ini; } } p[1010]; int main() { scanf( %d%f , &n, &t); ans = 2; for (int i = 0; i < n; i++) { scanf( %f%f , &x, &dis); dis /= 2.0; p[i].ini = x - dis; p[i].fim = x + dis; } sort(p, p + n); for (int i = 1; i < n; i++) { if (p[i - 1].fim + t < p[i].ini) ans += 2; else if (p[i - 1].fim + t == p[i].ini) ans++; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long long int inverse(long long int i) { if (i == 1) return 1; return (MOD - ((MOD / i) * inverse(MOD % i)) % MOD + MOD) % MOD; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; string s; cin >> s; long long x = 0, y = 0, ans = 0, len = 0, last; for (int i = 0; i < n; i++) { cin >> s; if (s[i] == U ) y++; else if (s[i] == D ) y--; else if (s[i] == R ) x++; else x--; len++; if (len > (abs(x) + abs(y))) { x = 0; y = 0; len = 0; ans++; i--; last = i; } } if (last != (n - 1)) ans++; cout << ans; } |
#include <bits/stdc++.h> using namespace std; using lint = long long; bool has(int s, int x) { int i = s / 50 % 475; for (int ii = (0); ii < int(25); ++ii) { i = (i * 96 + 42) % 475; if (i + 26 == x) { return true; } } return false; } void solve(istream& cin, ostream& cout) { int p, x, y; cin >> p >> x >> y; for (int i = 0; x - i * 50 >= y; i++) { if (has(x - i * 50, p)) { cout << 0; return; } } for (int i = 1;; i++) { if (has(x + i * 100, p) || has(x + i * 100 - 50, p)) { cout << i; return; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(cin, cout); return 0; } |
#include <bits/stdc++.h> using namespace std; struct vec { int to; int fro; }; int fa[200010], son[200010][26], mx[200010]; int rt, lst, tot; int n, m; char s[200010]; vec mp[200010]; int tai[200010], cnt; int P[200010]; int ans[200010]; vector<int> qs[200010]; int av[200010]; int len[200010]; int Rt[200010], Son[4000010][2]; int TOT; inline void be(int x, int y) { mp[++cnt].to = y; mp[cnt].fro = tai[x]; tai[x] = cnt; } int merge(int x, int y) { if (!x || !y) { return x + y; } Son[x][0] = merge(Son[x][0], Son[y][0]); Son[x][1] = merge(Son[x][1], Son[y][1]); return x; } void change(int &x, int y, int z, int p) { if (!x) { x = ++TOT; } if (y == z) { return; } int mid = y + z >> 1; if (p <= mid) { change(Son[x][0], y, mid, p); } else { change(Son[x][1], mid + 1, z, p); } } void ins(int x) { int np = ++tot, p = lst; mx[np] = mx[p] + 1; while (p && !son[p][x]) { son[p][x] = np; p = fa[p]; } if (!p) { fa[np] = rt; } else { int q = son[p][x]; if (mx[q] == mx[p] + 1) { fa[np] = q; } else { int nq = ++tot; mx[nq] = mx[p] + 1; memcpy(son[nq], son[q], sizeof(son[q])); fa[nq] = fa[q]; fa[np] = fa[q] = nq; while (p && son[p][x] == q) { son[p][x] = nq; p = fa[p]; } } } lst = np; } int L; int t[200010]; void DFS(int x, int y, int z) { if (y == z) { t[++L] = y; return; } int mid = y + z >> 1; if (Son[x][0]) { DFS(Son[x][0], y, mid); } if (Son[x][1]) { DFS(Son[x][1], mid + 1, z); } } void dfs(int x) { int i, y; for (i = tai[x]; i; i = mp[i].fro) { y = mp[i].to; dfs(y); } for (i = tai[x]; i; i = mp[i].fro) { y = mp[i].to; Rt[x] = merge(Rt[x], Rt[y]); } L = 0; if (qs[x].size()) { L = 0; DFS(Rt[x], 1, n); for (i = 0; i < qs[x].size(); i++) { int wzh = 1; int ti = qs[x][i]; int tav = av[qs[x][i]]; if (L < tav) { ans[ti] = -1; } else { ans[ti] = 1000000000; for (int j = tav; j <= L; j++) { ans[ti] = min(ans[ti], t[j] - t[j - tav + 1] + len[ti]); } } } } } int main() { int i, x; lst = rt = tot = 1; scanf( %s , s + 1); n = strlen(s + 1); int p = rt; for (i = 1; i <= n; i++) { ins(s[i] - a ); p = son[p][s[i] - a ]; P[i] = p; change(Rt[p], 1, n, i); } for (i = 2; i <= tot; i++) { be(fa[i], i); } scanf( %d , &m); for (i = 1; i <= m; i++) { scanf( %d%s , &av[i], s + 1); int p = rt; for (int j = 1; s[j]; j++) { p = son[p][s[j] - a ]; } len[i] = strlen(s + 1); if (!p) { ans[i] = -1; } else { qs[p].push_back(i); } } dfs(1); for (i = 1; i <= m; i++) { printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool iguales(vector<string>& x, vector<string>& y) { for (int i = (int)0; i < (int)x.size(); i++) { if (x[i] == T || y[i] == T ) continue; if (!(x[i] == y[i])) return false; } return true; } int main() { map<string, vector<vector<string> > > mapa; map<string, string> peso; int n, m, k; scanf( %d n , &n); string linea, nom, alfa, beta; while (n--) { getline(cin, linea); for (int i = (int)0; i < (int)linea.size(); i++) if (linea[i] == ( || linea[i] == ) || linea[i] == , ) linea[i] = ; vector<string> x; stringstream flujo(linea); while (flujo >> linea) x.push_back(linea); nom = x[1]; x.erase(x.begin()); x.erase(x.begin()); mapa[nom].push_back(x); } cin >> m; while (m--) { cin >> alfa >> beta; peso[beta] = alfa; } scanf( %d n , &k); while (k--) { getline(cin, linea); for (int i = (int)0; i < (int)linea.size(); i++) if (linea[i] == ( || linea[i] == ) || linea[i] == , ) linea[i] = ; vector<string> x; stringstream flujo(linea); int cc = 0; while (flujo >> linea) { if (cc == 0) { nom = linea; cc = 1; } else x.push_back(peso[linea]); } map<string, vector<vector<string> > >::iterator iter; iter = mapa.find(nom); if (iter != mapa.end()) { vector<vector<string> > r = iter->second; int tot = 0; for (int i = (int)0; i < (int)r.size(); i++) { vector<string> second = r[i]; if (x.size() == second.size()) { if (iguales(x, second)) tot++; } } cout << tot << endl; } else cout << 0 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int n, k; int a[200]; int main() { ios::sync_with_stdio(false); cin >> n >> k; int e = 0, s = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] == 1) e++; else s++; } int ee = e, ss = s; int ans = -1; for (int b = 1; b <= k; b++) { ee = e; ss = s; for (int i = 0; b + i * k <= n; i++) { int c = b + i * k; if (a[c] == 1) ee--; else ss--; } ans = max(ans, abs(ee - ss)); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, c; cin >> n >> k >> c; int p = ((n * k * c) / 100); int k1 = p / k; int k2 = p % k; for (int i = 0; i < n; i++) { if (i != 0) cout << ; if (i < k1) cout << k; else if (i == k1) cout << k2; else cout << 0; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int n, t, i, j, a[100005], b[100005]; int main() { j = 2; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) b[i] = b[i - 1] + a[i]; for (i = n; i >= 1; i--) if (b[i + 1] + a[i] < b[i]) { j = i; b[i] = b[i + 1] + a[i]; } else break; cout << j - 1 << << n - j + 1; } |
#include <bits/stdc++.h> const int mo = 1000000007, x[9][9] = {{0, 0, 0, 0, 1, 1, 0, 0, 1}, {0, 0, 0, 0, 0, 0, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0, 0, 1}, {0, 0, 0, 0, 0, 0, 1, 1, 1}, {1, 0, 0, 0, 0, 0, 0, 0, 1}, {0, 0, 1, 1, 0, 0, 0, 0, 1}, {0, 1, 0, 0, 0, 0, 0, 0, 1}, {0, 0, 1, 1, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 0, 0, 0, 0, 1}}; int a[9], t[9], b[9][9], c[9][9], l, r, ans; void mul(int a[][9], int b[][9], int c[][9]) { int i, j, k; for (i = 0; i <= 8; ++i) for (j = 0; j <= 8; ++j) { c[i][j] = 0; for (k = 0; k <= 8; ++k) c[i][j] = (c[i][j] + (long long)a[i][k] * b[k][j]) % mo; } } int calc(int n) { if (!n) return 0; int i, j, v; for (i = 0; i <= 8; ++i) a[i] = 1; a[8] = 4; memcpy(b, x, sizeof x); --n; while (n) { if (n % 2) { for (i = 0; i <= 8; ++i) { t[i] = 0; for (j = 0; j <= 8; ++j) t[i] = (t[i] + (long long)a[j] * b[j][i]) % mo; } memcpy(a, t, sizeof t); } mul(b, b, c); memcpy(b, c, sizeof c); memcpy(c, t, sizeof t); n /= 2; } return a[8]; } int query(int n) { return (calc(n) + calc((n + 1) / 2)) % mo; } int main() { scanf( %d%d , &l, &r); ans = ((long long)(query(r) - query(l - 1)) * ((mo + 1) / 2) % mo + mo) % mo; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100005], b[100005]; bool compare(int c, int d) { return a[c - 1] < a[d - 1]; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = i + 1; } sort(b, b + n, compare); cout << (n + 1) / 2 << endl; for (int i = 0; i < n; i += 2) cout << b[i] << ; cout << endl << n / 2 << endl; for (int i = 1; i < n; i += 2) cout << b[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxN = 2e5 + 10; const long long maxB = 500; const long long INF = 4557430888798830399; const int INF_I = 2139062143; const long long maxA = 1e6 + 10; const long long MOD = 1e9 + 7; const long long mINF = -4557430888798830400; const int mINF_I = -2139062144; template <typename T> T binaryExpo(T n, T p) { if (p == 0) { return 1LL; } if (p & 1) { return n * binaryExpo(n, p - 1); } T ret = binaryExpo(n, p / 2); return ret * ret; } template <typename T> T bigMod(T n, T p, T m) { if (p == 0) { return 1LL % m; } if (p & 1) { return (n % m * bigMod(n, p - 1, m)) % m; } T ret = bigMod(n, p / 2, m) % m; return (ret * ret) % m; } template <typename T> T modInv(T n, T m) { return bigMod(n, m - 2, m); } bool FILE_PRINT = 0; int marked[+2]; vector<long long> prime; void sieve(long long n); bool is_prime(long long num); int arr[maxN + 10], ans[maxN + 10], idx[maxN + 10]; long long cum[maxN + 10]; pair<int, int> query[maxN + 10]; vector<int> divisors[maxN + 10]; long long spd[maxA + 10]; long long mp[maxN + 10]; void calc_spd(long long n) { memset(spd, -1, sizeof spd); for (long long i = 2; i <= n; i++) { if (spd[i] == -1) { prime.push_back(i); mp[prime.size() - 1] = ((i - 1) * modInv(i, MOD)) % MOD; for (long long j = i; j <= n; j += i) { if (spd[j] == -1) spd[j] = prime.size() - 1; } } } } inline bool compare(long long x, long long y) { return make_pair(query[x].first / maxB, query[x].second) < make_pair(query[y].first / maxB, query[y].second); } signed cnt[maxN + 10]; void solve(long long n, long long q) { long long a, b = -1, l, r, ans = 1; for (long long curr_block = -1, i = 0; i < q; i++) { tie(l, r) = query[idx[i]]; if (l / maxB != curr_block) { curr_block = l / maxB; ans = 1; memset(cnt, 0, sizeof cnt); b = (curr_block + 1) * maxB - 1; } while (b + 1 <= r) { b++; for (auto p : divisors[b]) { if (cnt[p] == 0) ans = (ans * mp[p]) % MOD; cnt[p]++; } } long long temp = ans; for (a = l; a <= min(r, (curr_block + 1) * maxB - 1); a++) { for (auto p : divisors[a]) { if (cnt[p] == 0) ans = (ans * mp[p]) % MOD; cnt[p]++; } } if (ans < 0) ans += MOD; ::ans[idx[i]] = (::ans[idx[i]] * ans) % MOD; for (a = l; a <= min(r, (curr_block + 1) * maxB - 1); a++) { for (auto p : divisors[a]) { cnt[p]--; } } ans = temp; } } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(15); cout << fixed; calc_spd(maxA + 5); long long number_of_test_cases = 1, test_case; for (test_case = 1; test_case <= number_of_test_cases; test_case++) { long long i, j, k, l, r, m, n, query_type, q; long long a, b, c, x, y, z; cin >> n; for (i = (0); i < (n); ++i) { cin >> arr[i]; x = arr[i]; while (x > 1) { long long p = spd[x]; while (x % prime[p] == 0) { x /= prime[p]; } divisors[i].push_back(p); } } cum[0] = arr[0]; for (i = (1); i <= (n - 1); ++i) { cum[i] = (cum[i - 1] * arr[i]) % MOD; } cin >> q; for (i = (0); i < (q); ++i) { cin >> l >> r; l--; r--; query[i] = make_pair(l, r); ans[i] = cum[r]; if (l > 0) ans[i] = (ans[i] * modInv((long long)cum[l - 1], MOD)) % MOD; } for (i = (0); i < (q); ++i) idx[i] = i; sort(idx, idx + q, compare); solve(n, q); for (i = (0); i < (q); ++i) cout << ans[i] << n ; } return 0; } bool is_prime(long long num) { return (num > 1 && (num == 2 || ((((num)&1LL) ? (1) : (0)) && !(marked[(num) >> 6] & (1L << (((num) % 64) >> 1)))))); } void sieve(long long n) { long long i, j; (marked[(1) >> 6] |= (1L << (((1) % 64) >> 1))); for (i = 3; i * i <= n; i += 2) { if (!(marked[(i) >> 6] & (1L << (((i) % 64) >> 1)))) { for (j = i * i; j <= n; j += i + i) (marked[(j) >> 6] |= (1L << (((j) % 64) >> 1))); } } prime.clear(); prime.push_back(2); for (i = 3; i <= n; i += 2) { if (is_prime(i)) prime.push_back(i); } } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 1e9 + 7; long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } long long int lcm(long long int a, long long int b) { return (a / gcd(a, b)) * b; } long long int sq(long long int x) { return x * x; } void solve() { long long int n, x1, x2, y1, y2; cin >> n >> x1 >> y1 >> x2 >> y2; long long int ans = 8e18; vector<pair<long long int, long long int>> v(n); for (long long int i = 0; i < n; i++) { long long int x, y; cin >> x >> y; v[i].first = sq(x - x1) + sq(y - y1); v[i].second = sq(x - x2) + sq(y - y2); } v.push_back({0, 0}); for (auto i : v) { long long int r1 = i.first; long long int r2 = 0; for (auto j : v) { if (j.first > r1) { r2 = max(r2, j.second); } } ans = min(ans, r1 + r2); } cout << ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int x1, x2, a, b; int main() { while (cin >> x1 >> x2 >> a >> b) { bool ch = false; if (x1 > x2) { swap(x1, x2); swap(a, b); a = -a; b = -b; ch = true; } int dif = abs(x1 - x2); if (a <= 0) { if (dif <= b) cout << FIRST << endl << (ch ? x1 : x2) << endl; else cout << DRAW << endl; } else { int rem = dif % (a + b); if (rem == 0) cout << SECOND << endl; else if (rem >= a && rem <= b) cout << FIRST << endl << (ch ? x2 - rem : x1 + rem) << endl; else cout << DRAW << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; map<int, int> pmax, maxp; vector<int> g[n + 2]; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; g[a].push_back(b); if (pmax.find(a) == pmax.end()) pmax[a] = b; else pmax[a] = max(pmax[a], b); } for (auto i = pmax.begin(); i != pmax.end(); i++) { maxp[i->second] = i->first; } int q; cin >> q; while (q--) { int k; cin >> k; vector<pair<int, int> > maxpaux; for (int i = 0; i < k; i++) { int l; cin >> l; if (pmax.find(l) == pmax.end()) continue; maxpaux.push_back(pair<int, int>(pmax[l], l)); maxp.erase(pmax[l]); } if (maxp.empty()) { cout << 0 << << 0 << n ; } else if (maxp.size() == 1) { cout << maxp.begin()->second << << g[maxp.begin()->second][0] << n ; } else { auto en = maxp.end(); en--; int personmax = en->second; cout << personmax << ; en--; int secondperson = en->second; int pos = upper_bound(g[personmax].begin(), g[personmax].end(), pmax[secondperson]) - g[personmax].begin(); int answer = g[personmax][pos]; cout << answer << n ; } for (int i = 0; i < maxpaux.size(); i++) { maxp[maxpaux[i].first] = maxpaux[i].second; } } return 0; } |
#include <bits/stdc++.h> int gcd(int x, int y) { int r1 = x, q, r2 = y, r; while (r2 > 0) { q = r1 / r2; r = r1 - q * r2; r1 = r2; r2 = r; } return r1; } using namespace std; int main(int argc, char const *argv[]) { int n, m, x, cnt; char c; cin >> n >> m; char arr[n]; int arr1[n]; map<int, pair<int, int> > arr2; cnt = 0; cin >> arr; arr1[0] = -1; for (int i = 1; i < n; i++) { arr1[i] = -1; if (arr[i] == . && arr[i - 1] == . ) { arr2[cnt] = make_pair(i, i - 1); arr1[i] = cnt; cnt++; } } for (int i = 0; i < m; i++) { cin >> x >> c; x--; if (arr[x] == . && c == . || arr[x] != . && c != . ) ; else if (arr[x] != . && c == . ) { if (x != 0 && arr[x - 1] == . ) { arr2[cnt] = make_pair(x, x - 1); arr1[x] = cnt; cnt++; } if (x != n - 1 && arr[x + 1] == . ) { arr2[cnt] = make_pair(x + 1, x); arr1[x + 1] = cnt; cnt++; } } else { if (x == n - 1) { if (arr1[x] == -1) ; else { arr2.erase(arr2.find(arr1[x])); arr1[x] = -1; } } else { if (arr1[x] != -1 && arr1[x + 1] != -1) { arr2.erase(arr2.find(arr1[x + 1])); arr1[x + 1] = -1; arr2.erase(arr2.find(arr1[x])); arr1[x] = -1; } else if (arr1[x] != -1) { arr2.erase(arr2.find(arr1[x])); arr1[x] = -1; } else if (arr1[x + 1] != -1) { arr2.erase(arr2.find(arr1[x + 1])); arr1[x + 1] = -1; } else { } } } arr[x] = c; printf( %d , arr2.size()); printf( n ); ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; int ans, cnt, tmp; int main() { int n; cin >> n; int a[] = {0, 0, 0, 0, 0}; for (int i = 0; i < n; i++) { int x; cin >> x; a[x]++; cnt += x; } if (cnt == 5 || cnt < 3) return cout << -1, 0; ans += min(a[1], a[2]); a[1] -= ans, a[2] -= ans, a[3] += ans; if (a[1] != 0) { ans += a[1] / 3 * 2; a[3] += a[1] / 3; a[1] = a[1] % 3; if (a[1] == 1) { if (a[3] != 0) ans += 1; else ans += 2; } else if (a[1] == 2) { ans += 2; } return cout << ans, 0; } else if (a[2] != 0) { ans += a[2] / 3 * 2; a[3] += a[2] / 3 * 2; a[2] = a[2] % 3; if (a[2] == 1) { if (a[4] != 0) ans++; else ans += 2; } else if (a[2] == 2) { ans += 2; } return cout << ans, 0; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; const int N = 26; int mas[26]; for (int i = 0; i < N; ++i) mas[i] = 0; int rez = 0; for (int i = 0; i < n * 2 - 2; ++i) { char a; cin >> a; if (isupper(a)) { if (mas[tolower(a) - a ] > 0) mas[tolower(a) - a ]--; else rez++; } else mas[a - a ]++; } cout << rez << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[505]; pair<int, int> query(set<int> s) { cout << ? ; for (auto e : s) { cout << e << ; } cout << endl; pair<int, int> res; cin >> res.first >> res.second; a[res.first] = res.second; return res; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; set<int> s; for (int i = 1; i <= k; i++) { s.insert(i); } int mn = 1e9 + 1; for (int i = k + 1; i <= n; i++) { pair<int, int> u = query(s); mn = min(mn, u.second); s.erase(u.first); s.insert(i); } pair<int, int> u = query(s); mn = min(mn, u.second); s.erase(u.first); int ans = 1; set<int> t; int sm = 1e9 + 1, bg = 0; for (int i = 1; i <= n; i++) { if (a[i] != 0) { t.insert(i); sm = min(sm, a[i]); bg = max(bg, a[i]); } if (t.size() == 2) break; } set<int> ss; for (auto e : s) ss.insert(e); for (auto e : t) ss.insert(e); for (auto e : s) { ss.erase(e); auto u = query(ss); if (u.second == bg) ans++; ss.insert(e); } cout << ! << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int main() { string s; cin >> s; string a = ; for (int i = 0; i < s.size(); i++) { if (s[i] == a || s[i] == b ) a += s[i]; } int ans = 1, cnt = 0; for (int i = 0; i < a.size(); i++) { if (a[i] == b ) { ans = (ans * 1ll * (cnt + 1)) % MOD; cnt = 0; } else { cnt++; } } ans = (ans * 1ll * (cnt + 1)) % MOD; printf( %d n , ans - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long ans = 0; int r = -1; int n, g[40][21], p[40][21]; char ch; void update(unsigned long long &a, int &b, int &c, unsigned long long d, int e) { if (b == 0 || a < d) { a = d; c = e; b = 1; } } unsigned long long f[40][21], bas[21], a[1010]; int main() { bas[1] = 1; for (int i = 2; i <= 19; i++) bas[i] = bas[i - 1] * 10LL; scanf( %d , &n); for (int i = 1; i <= n + n; i++) { scanf( %c , &ch); a[i] = ch - 0 ; } g[0][0] = 1; f[0][0] = 0; for (int i = 1; i <= n + n; i++) for (int j = 0; j <= n; j++) if (g[i - 1][j]) { int d1 = j, d2 = i - 1 - j; d1 = n - d1, d2 = n - d2; if (d2 > 0) update(f[i][j], g[i][j], p[i][j], f[i - 1][j] + bas[d2] * a[i], j); if (j != n) update(f[i][j + 1], g[i][j + 1], p[i][j + 1], f[i - 1][j] + bas[d1] * a[i], j); } int sx = n + n, sy = n; string a = ; while (sx != 0) { int ty = p[sx][sy]; sx--; if (ty == sy) a += M ; else a += H ; sy = ty; } reverse(a.begin(), a.end()); cout << a << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 3) cout << -1; else for (int i = n; i > 0; --i) { cout << i << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct pony { long long s, m, r, t; } ponys[100005]; bool cmp(pony &x, pony &y) { return x.t < y.t; } struct node { long long l, r, latest; long long *sm, *sr, *t; } nodes[100005 << 4]; void build(long long ord, long long l, long long r) { nodes[ord].latest = 0; nodes[ord].l = l, nodes[ord].r = r; if (l == r) { nodes[ord].sm = &ponys[l].m; nodes[ord].sr = &ponys[l].r; nodes[ord].t = &ponys[l].t; return; } int m = (l + r) >> 1; build(ord << 1, l, m); build(ord << 1 | 1, m + 1, r); pony *tmp = new pony[r - l + 1]; for (int i = 0; i < r - l + 1; i++) tmp[i] = ponys[l + i]; sort(tmp, tmp + r - l + 1, cmp); nodes[ord].sm = new long long[r - l + 2]; nodes[ord].sr = new long long[r - l + 2]; nodes[ord].t = new long long[r - l + 2]; nodes[ord].sm[0] = nodes[ord].sr[0] = nodes[ord].t[0] = 0; for (int i = 1; i < r - l + 2; i++) { nodes[ord].sm[i] = tmp[i - 1].m + nodes[ord].sm[i - 1]; nodes[ord].sr[i] = tmp[i - 1].r + nodes[ord].sr[i - 1]; nodes[ord].t[i] = tmp[i - 1].t; } delete[] tmp; } long long mana_obserbed(long long ord, long long t, long long l, long long r) { long long res = 0; if (nodes[ord].latest > 0) nodes[ord << 1].latest = nodes[ord << 1 | 1].latest = nodes[ord].latest; if (nodes[ord].l == l && nodes[ord].r == r) { if (nodes[ord].latest > 0) { if (l == r) res = min(ponys[l].m, ponys[l].r * (t - nodes[ord].latest)); else { int len = nodes[ord].r - nodes[ord].l + 2; int tmp = upper_bound(nodes[ord].t + 1, nodes[ord].t + len, t - nodes[ord].latest) - nodes[ord].t; res = nodes[ord].sm[tmp - 1] + (nodes[ord].sr[len - 1] - nodes[ord].sr[tmp - 1]) * (t - nodes[ord].latest); } nodes[ord].latest = t; return res; } else if (nodes[ord].latest == 0 && l == r) { res = min(ponys[l].m, ponys[l].s + ponys[l].r * t); nodes[ord].latest = t; return res; } } int m = (nodes[ord].l + nodes[ord].r) >> 1; if (r <= m) res += mana_obserbed(ord << 1, t, l, r); else if (m < l) res += mana_obserbed(ord << 1 | 1, t, l, r); else res += mana_obserbed(ord << 1, t, l, m) + mana_obserbed(ord << 1 | 1, t, m + 1, r); nodes[ord].latest = nodes[ord << 1].latest == nodes[ord << 1 | 1].latest ? nodes[ord << 1].latest : -1; return res; } int main() { long long n, m, t, l, r; cin >> n; for (long long i = 1; i <= n; i++) { cin >> ponys[i].s >> ponys[i].m >> ponys[i].r; if (ponys[i].r) ponys[i].t = (ponys[i].m + ponys[i].r - 1) / ponys[i].r; else ponys[i].t = 0x7fffffffffffffff; } build(1, 1, n); cin >> m; for (long long i = 1; i <= m; i++) { cin >> t >> l >> r; cout << mana_obserbed(1, t, l, r) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; typedef int* Pint; typedef long long* PLL; const int MAXN = 1E4; int a[110], f[110][3]{}; int n; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= n; i++) { f[i][0] = min(min(f[i - 1][0], f[i - 1][1]), f[i - 1][2]) + 1; f[i][1] = f[i][2] = MAXN; if (a[i] & 1) f[i][1] = min(f[i - 1][0], f[i - 1][2]); if (a[i] & 2) f[i][2] = min(f[i - 1][0], f[i - 1][1]); } printf( %d n , min(min(f[n][0], f[n][1]), f[n][2])); } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using std::bitset; using namespace std; struct point { long long x, y; bool operator<(const point &I) const { return x < I.x || (x == I.x && y < I.y); } } a[101000]; long long n; long long hmi[101000], tmi[101000], hma[101000], tma[101000]; long long judge(double r) { long long i, j, tem; long long mmi, mma; j = 1; for (i = 1; i <= n; i++) { while (j <= n && a[j].x - a[i].x <= 2 * r) j++; mmi = min(hmi[i - 1], tmi[j]); mma = max(hma[i - 1], tma[j]); if (mma - mmi <= 2 * r) return 1; } return 0; } int main() { long long i, j, tem; long long tx, ty; while (scanf( %I64d , &n) != EOF) { for (i = 1; i <= n; i++) { scanf( %I64d%I64d , &tx, &ty); a[i].x = tx - ty; a[i].y = tx + ty; } sort(a + 1, a + 1 + n); hmi[0] = 0x3f3f3f3f3f3f3f3fll; hma[0] = -0x3f3f3f3f3f3f3f3fll; for (i = 1; i <= n; i++) { hmi[i] = min(hmi[i - 1], a[i].y); hma[i] = max(hma[i - 1], a[i].y); } tmi[n + 1] = 0x3f3f3f3f3f3f3f3fll; tma[n + 1] = -0x3f3f3f3f3f3f3f3fll; for (i = n; i > 0; i--) { tmi[i] = min(tmi[i + 1], a[i].y); tma[i] = max(tma[i + 1], a[i].y); } double low, high, mid, ans = 0; low = 0; high = 1e20; while (high - low > 1e-6) { mid = (low + high) / 2; if (judge(mid)) high = mid; else low = mid; } printf( %.6lf n , (low + high) / 2); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = 3.1415926535897932384626433832795; const int inf = 1e9; const long long inf2 = 1e18; const int mod = 1e9 + 7; void boost() { ios_base::sync_with_stdio(false); cin.tie(NULL); } inline long long exp(long long x, long long n, long long m = mod) { long long r = 1; while (n) { if (n & 1) r = r * x % m; x = x * x % m, n >>= 1; } return r; } void solve() { int n, k; cin >> n >> k; vector<int> ncr(n + 1, 0); vector<int> arr(n + 1); for (int i = 1; i < n + 1; ++i) cin >> arr[i]; ncr[0] = 1; for (int i = 1; i < n + 1; ++i) { ncr[i] = (ncr[i - 1] * 1LL * (k + i - 1)) % mod; ncr[i] = (ncr[i] * exp(i, mod - 2)) % mod; } vector<int> ans(n + 1, 0); for (int i = 1; i < n + 1; ++i) { for (int j = i; j < n + 1; ++j) { ans[j] = (ans[j] * 1LL + 1LL * arr[i] * ncr[j - i]) % mod; } } for (int i = 1; i < n + 1; ++i) cout << ans[i] << ; return; } int main() { boost(); int tc = 1; while (tc--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a1[3], a2[3], i; cin >> a1[0] >> a1[1] >> a1[2]; cin >> a2[0] >> a2[1] >> a2[2]; for (i = 0; i < 3; i++) { if (a1[i] == a2[i]) { cout << YES ; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int n, k, cal; string solve() { for (int i = 0; i < s.size(); i++) { int m4x = min(s[i] + k, (int) z ); int m1n = max(s[i] - k, (int) a ); if (s[i] - m1n >= m4x - s[i]) { k -= s[i] - m1n; s[i] = m1n; } else { k -= m4x - s[i]; s[i] = m4x; } } if (k == 0) return s; return -1 ; } int main() { cin >> n >> k >> s; cout << solve(); } |
#include <bits/stdc++.h> using namespace std; template <class Flow = long long, class Cost = long long> struct MinCostFlow { const Flow INF_FLOW = 1000111000; const Cost INF_COST = 1000111000111000LL; long long n, t, S, T; Flow totalFlow; Cost totalCost; vector<long long> last, visited; vector<Cost> dis; struct Edge { long long to; Flow cap; Cost cost; long long ackjalscjaowjico; Edge(long long to, Flow cap, Cost cost, long long ackjalscjaowjico) : to(to), cap(cap), cost(cost), ackjalscjaowjico(ackjalscjaowjico) {} }; vector<Edge> edges; MinCostFlow(long long n) : n(n), t(0), totalFlow(0), totalCost(0), last(n, -1), visited(n, 0), dis(n, 0) { edges.clear(); } long long addEdge(long long from, long long to, Flow cap, Cost cost) { edges.push_back(Edge(to, cap, cost, last[from])); last[from] = t++; edges.push_back(Edge(from, 0, -cost, last[to])); last[to] = t++; return t - 2; } pair<Flow, Cost> minCostFlow(long long _S, long long _T) { S = _S; T = _T; SPFA(); while (1) { while (1) { for (long long i = 0, _i = (n); i < _i; ++i) visited[i] = 0; if (!findFlow(S, INF_FLOW)) break; } if (!modifyLabel()) break; } return make_pair(totalFlow, totalCost); } private: void SPFA() { for (long long i = 0, _i = (n); i < _i; ++i) dis[i] = INF_COST; priority_queue<pair<Cost, long long> > Q; Q.push(make_pair(dis[S] = 0, S)); while (!Q.empty()) { long long x = Q.top().second; Cost d = -Q.top().first; Q.pop(); if (dis[x] != d) continue; for (long long it = last[x]; it >= 0; it = edges[it].ackjalscjaowjico) if (edges[it].cap > 0 && dis[edges[it].to] > d + edges[it].cost) Q.push(make_pair(-(dis[edges[it].to] = d + edges[it].cost), edges[it].to)); } Cost disT = dis[T]; for (long long i = 0, _i = (n); i < _i; ++i) dis[i] = disT - dis[i]; } Flow findFlow(long long x, Flow flow) { if (x == T) { totalCost += dis[S] * flow; totalFlow += flow; return flow; } visited[x] = 1; Flow now = flow; for (long long it = last[x]; it >= 0; it = edges[it].ackjalscjaowjico) if (edges[it].cap && !visited[edges[it].to] && dis[edges[it].to] + edges[it].cost == dis[x]) { Flow tmp = findFlow(edges[it].to, min(now, edges[it].cap)); edges[it].cap -= tmp; edges[it ^ 1].cap += tmp; now -= tmp; if (!now) break; } return flow - now; } bool modifyLabel() { Cost d = INF_COST; for (long long i = 0, _i = (n); i < _i; ++i) if (visited[i]) for (long long it = last[i]; it >= 0; it = edges[it].ackjalscjaowjico) if (edges[it].cap && !visited[edges[it].to]) d = min(d, dis[edges[it].to] + edges[it].cost - dis[i]); if (d == INF_COST) return false; for (long long i = 0, _i = (n); i < _i; ++i) if (visited[i]) dis[i] += d; return true; } }; signed main() { long long n; cin >> n; string s; cin >> s; s = + s; MinCostFlow<long long, long long> mcmf(n + 2); long long m; cin >> m; while (m--) { string t; long long cost; cin >> t >> cost; for (long long i = 1; i + t.size() <= s.size(); i++) { if (s.substr(i, t.size()) == t) mcmf.addEdge(i, i + t.size(), 1, -cost); } } long long x; cin >> x; for (long long i = 0; i <= n; i++) { mcmf.addEdge(i, i + 1, x, 0); } auto ans = mcmf.minCostFlow(0, n + 1); cout << -ans.second; } |
#include <bits/stdc++.h> using namespace std; long long i, j, x, y, curr, T, t, K, N, coun[51], fact[21], rev[51]; vector<int> ans, v; set<int> cand; set<int>::iterator it; void precomp() { fact[0] = 1; for (i = 1; i < 21; i++) { fact[i] = fact[i - 1] * i; } coun[0] = coun[1] = 1; for (i = 2; i < 23; i++) { coun[i] = fact[i - 2] + coun[i - 1]; for (j = 2; j < i; j++) { coun[i] += (fact[j - 2] * coun[i - j]); } } for (i = 23; i < 51; i++) coun[i] = coun[22]; } void fillv(long long n, long long k) { v.clear(); if (n < 3) { for (i = n; i > 0; i--) v.push_back(i); return; } cand.clear(); for (i = 1; i < n; i++) { cand.insert((int)i); rev[i] = 0; } v.push_back(n); rev[n] = 1; for (i = 1; i < (n - 1); i++) { for (j = i + 1; rev[j] > 0; j = rev[j]) ; x = cand.size(); for (it = cand.begin(), y = 0; y < (k / fact[x - 2]); y++, ++it) { if (j == (*it)) ++it; } if (j == (*it)) ++it; v.push_back(*it); rev[*it] = v.size(); cand.erase(it); k = k % fact[x - 2]; } v.push_back(*cand.begin()); } void fill(long long n, long long k) { int i; if (n == 0) return; if (coun[n - 1] > k) { ans.push_back(ans.size() + 1); fill(n - 1, k); return; } k -= coun[n - 1]; for (i = 2; i < n; i++) { j = fact[i - 2] * coun[n - i]; if (j <= k) { k -= j; continue; } break; } fillv(i, k / coun[n - i]); k = k % (coun[n - i]); n -= i; int x = ans.size(); for (j = 0; j < i; j++) { ans.push_back(x + v[j]); } fill(n, k); } int main() { precomp(); cin >> T; for (t = 0; t < T; t++) { cin >> N >> K; if (K > coun[N]) { cout << -1 n ; continue; } ans.clear(); fill(N, K - 1); for (i = 0; i < N; i++) { cout << ans[i] << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { deque<int> dq; int n; cin >> n; int f = 0, a = 0, b = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; dq.push_back(x); } while (!dq.empty()) { int ans = max(dq.front(), dq.back()); if (f == 0) { a += ans; f = 1; if (ans == dq.front()) dq.pop_front(); else dq.pop_back(); } else { b += ans; f = 0; if (ans == dq.front()) dq.pop_front(); else dq.pop_back(); } } cout << a << << b; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100001; int q, n; int d[MAXN], p[MAXN]; int main() { cin >> q; int small = 1 << 30; for (int i = 0; i < q; ++i) { cin >> d[i]; small = ((small) > (d[i]) ? (d[i]) : (small)); } cin >> n; for (int i = 0; i < n; ++i) { cin >> p[i]; } sort(p, p + n, greater<int>()); int cost = 0; for (int i = 0; i < n; i++) { if (i % (small + 2) < small) { cost += p[i]; } } cout << cost << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; void file() {} void fast() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } int main() { int x; cin >> x; int a[1003][3]; int ans = 0; for (int i = 0; i < (int)x; i++) for (int t = 0; t < (int)3; t++) { cin >> a[i][t]; if (t) a[i][t] += a[i][t - 1]; if (t == 2) ans += a[i][t] >= 2; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int n, x[1500][1500], y[1500][1500], vis[1510][1500]; char ans[1500][1500]; struct node { int x, y; }; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; vector<node> a; int main() { cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf( %d%d , &x[i][j], &y[i][j]); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (x[i][j] != -1 && !vis[x[i][j]][y[i][j]]) { if (x[x[i][j]][y[i][j]] == -1 || x[x[i][j]][y[i][j]] != x[i][j] || y[x[i][j]][y[i][j]] != y[i][j]) { printf( INVALID n ); return 0; } a.push_back(node{x[i][j], y[i][j]}); ans[x[i][j]][y[i][j]] = X ; vis[x[i][j]][y[i][j]] = 1; } } } queue<node> q; for (int j = 0; j < a.size(); j++) { q.push(a[j]); while (!q.empty()) { node now = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int xx = now.x + dx[i]; int yy = now.y + dy[i]; if (xx <= 0 || yy <= 0 || xx > n || yy > n || x[xx][yy] != a[j].x || y[xx][yy] != a[j].y) continue; if (!vis[xx][yy]) { vis[xx][yy] = 1; q.push(node{xx, yy}); if (i == 0) ans[xx][yy] = L ; if (i == 1) ans[xx][yy] = R ; if (i == 2) ans[xx][yy] = U ; if (i == 3) ans[xx][yy] = D ; } } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (x[i][j] != -1 && !vis[i][j]) { printf( INVALID n ); return 0; } if (x[i][j] == -1 && !vis[i][j]) { q.push(node{i, j}); vis[i][j] = 1; int flag = 0; while (!q.empty()) { node now = q.front(); q.pop(); for (int k = 0; k < 4; k++) { int xx = now.x + dx[k]; int yy = now.y + dy[k]; if (xx <= 0 || yy <= 0 || xx > n || yy > n || x[xx][yy] != -1) continue; if (x[xx][yy] == -1 && vis[xx][yy]) { if (!flag) { if (k == 0) ans[i][j] = R ; if (k == 1) ans[i][j] = L ; if (k == 2) ans[i][j] = D ; if (k == 3) ans[i][j] = U ; flag = 1; } } if (!vis[xx][yy]) { vis[xx][yy] = 1; q.push(node{xx, yy}); if (k == 0) ans[xx][yy] = L ; if (k == 1) ans[xx][yy] = R ; if (k == 2) ans[xx][yy] = U ; if (k == 3) ans[xx][yy] = D ; if (!flag) { if (k == 0) ans[i][j] = R ; if (k == 1) ans[i][j] = L ; if (k == 2) ans[i][j] = D ; if (k == 3) ans[i][j] = U ; flag = 1; } } } if (!flag) { printf( INVALID n ); return 0; } } } } } printf( VALID n ); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { printf( %c , ans[i][j]); } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; map<int, int> mp; int a[300000]; int n, k; int b[300000]; int cnt = 0; int cmp(int a, int b) { return mp[a] > mp[b]; } bool check(int mid) { int sum = 0; for (int i = 1; i <= cnt; i++) { sum += mp[b[i]] / mid; } return sum >= k; } int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) { if (!mp[a[i]]) b[++cnt] = a[i]; mp[a[i]]++; } int l = 1; int r = 250000; int ans; while (l <= r) { int mid = l + r >> 1; if (check(mid)) ans = mid, l = mid + 1; else r = mid - 1; } int nd = k; int now = 1; sort(b + 1, b + 1 + cnt); while (nd) { while (nd && mp[b[now]] >= ans) cout << b[now] << , mp[b[now]] -= ans, nd--; now++; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; for (int i = 0; i < t; i++) { int x, y, a, b; cin >> x >> y >> a >> b; if ((y - x) % (a + b) == 0) { cout << (y - x) / (a + b) << n ; } else { cout << -1 << n ; } } } |
#include <bits/stdc++.h> long long a[100000], b[100000]; using namespace std; bool isnp(long long n, long long k, long long t) { long long magic = 0; for (long long i = 0; i < t; i++) { if (a[i] * n > b[i]) magic += a[i] * n - b[i]; if (magic > k) return false; } return true; } int32_t main() { long long n, k; cin >> n >> k; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) { cin >> b[i]; } long long l = 0, r = 2000000001; while (r - l != 1) { if (isnp((r + l) / 2, k, n)) l = (r + l) / 2; else r = (r + l) / 2; } cout << l; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, K = 505, INF = K * (1e4 + 5); int n, m, k; int c[N], a[N], visit[N]; int w[K][K]; vector<pair<int, int>> edges[N]; vector<int> colors; void dfs(int s) { visit[s] = 1; colors.push_back(a[s]); for (auto x : edges[s]) { int nxt = x.first; int w = x.second; if (visit[nxt] || w) continue; dfs(nxt); } } vector<vector<int>> ffloyd(int M) { vector<vector<int>> dist(M, vector<int>(M, INF)); for (int i = 0; i < M; i++) for (int j = 0; j < M; j++) dist[i][j] = w[i][j]; for (int k = 0; k < M; k++) { for (int i = 0; i < M; i++) { for (int j = 0; j < M; j++) { if (dist[i][k] < INF && dist[k][j] < INF) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } } } return dist; } void solve() { cin >> n >> m >> k; for (int i = 0; i < k; i++) cin >> c[i]; int col = 0; for (int i = 0, id = 0; i < k; i++) { for (int j = 0; j < c[i]; j++) a[id++] = col; col++; } for (int i = 0; i < k; i++) for (int j = 0; j < k; j++) if (i != j) w[i][j] = INF; while (m--) { int u, v, x; cin >> u >> v >> x; u--; v--; edges[u].push_back({v, x}); edges[v].push_back({u, x}); u = a[u], v = a[v]; if (u == v) continue; w[u][v] = min(w[u][v], x); w[v][u] = min(w[v][u], x); } int fail = 0; for (int i = 0; i < n; i++) { if (!visit[i]) { dfs(i); sort(colors.begin(), colors.end()); int count = 1; for (int i = 1; i < colors.size(); i++) { if (colors[i] == colors[i - 1]) { count++; continue; } if (c[colors[i - 1]] != count) { fail = 1; break; } count = 1; } if (c[colors.back()] != count) { fail = 1; break; } colors.clear(); } } if (fail) { cout << No n ; return; } cout << Yes n ; vector<vector<int>> dist = ffloyd(k); for (int i = 0; i < k; i++) { for (int j = 0; j < k; j++) { if (dist[i][j] == INF) dist[i][j] = -1; cout << dist[i][j] << ; } cout << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); } |
#include <bits/stdc++.h> using namespace std; int n, m; char a[222][222]; struct Dinic { struct edge { int to, flow, cap; }; const static int N = 202 * 202; vector<edge> e; vector<int> g[N + 7]; int dp[N + 7]; int ptr[N + 7]; void clear() { for (int i = 0; i < N + 7; i++) g[i].clear(); e.clear(); } void addEdge(int a, int b, int cap = 1) { g[a].push_back(e.size()); e.push_back({b, 0, cap}); g[b].push_back(e.size()); e.push_back({a, 0, 0}); } int minFlow, start, finish; bool bfs() { for (int i = 0; i < N; i++) dp[i] = -1; dp[start] = 0; vector<int> st; int uk = 0; st.push_back(start); while (uk < st.size()) { int v = st[uk++]; for (int to : g[v]) { auto ed = e[to]; if (ed.cap - ed.flow >= minFlow && dp[ed.to] == -1) { dp[ed.to] = dp[v] + 1; st.push_back(ed.to); } } } return dp[finish] != -1; } int dfs(int v, int flow) { if (v == finish) return flow; for (; ptr[v] < g[v].size(); ptr[v]++) { int to = g[v][ptr[v]]; edge ed = e[to]; if (ed.cap - ed.flow >= minFlow && dp[ed.to] == dp[v] + 1) { int add = dfs(ed.to, min(flow, ed.cap - ed.flow)); if (add) { e[to].flow += add; e[to ^ 1].flow -= add; return add; } } } return 0; } int dinic(int start, int finish) { Dinic::start = start; Dinic::finish = finish; int flow = 0; for (minFlow = 1; minFlow; minFlow >>= 1) { while (bfs()) { for (int i = 0; i < N; i++) ptr[i] = 0; while (int now = dfs(start, (int)2e9 + 7)) flow += now; } } return flow; } } dinic; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> a[i][j]; int s = n * m; int t = n * m + 1; auto get_node = [](int first, int second) { return first * m + second; }; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) if (a[i][j] == # ) { if (i > 0 && a[i - 1][j] == # ) dinic.addEdge(get_node(i, j), get_node(i - 1, j)); if (j + 1 < m && a[i][j + 1] == # ) dinic.addEdge(get_node(i, j), get_node(i, j + 1)); if (j == 0 || a[i][j - 1] == . ) dinic.addEdge(s, get_node(i, j)); if (i == 0 || a[i - 1][j] == . ) dinic.addEdge(get_node(i, j), t); } } cout << dinic.dinic(s, t); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; std::ios::sync_with_stdio(false); cin >> n >> m; int x, y; for (int i = 0; i < m; i++) cin >> x >> y; for (int i = 0; i < n; i++) if (i % 2 == 0) cout << 0; else cout << 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = 0; for (int i = 0; i < k; i++) { int m = 0; for (int j = i; j < n; j += k) { if (a[j] == 1) { m++; } } ans += min(m, (n / k - m)); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; struct abc { long long int y, x; }; bool compare(abc a1, abc a2) { if (a1.x == a2.x) return a1.y < a2.y; return a1.x < a2.x; } long long int countDivisors(long long int n) { long long int cnt = 0; for (long long int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i == i) cnt++; else cnt = cnt + 2; } } return cnt; } const long long int mod = 1e9 + 7; long long int n, m, x, y, l, r, ans, k, q, w, h; string second, p; map<long long int, long long int> mp; void solve() { cin >> n >> k; long long int a[n], sum = 0; vector<long long int> v; for (long long int i = 0; i < n; i++) { cin >> a[i]; ans += a[i] / 10; long long int x = a[i] % 10; if (x % 10 != 0) x = 10 - x; else x = 0; if (x) v.push_back(x); a[i] += x; sum += (100 - a[i]); } sort(v.begin(), v.end()); for (long long int i = 0; i < v.size(); i++) { if (k >= v[i]) ans++, k -= v[i]; else { k = 0; break; } } ans += min(sum, k) / 10; cout << ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); } |
#include <bits/stdc++.h> using namespace std; vector<int> v; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; int flag = 0; int m; cin >> m; long long a[m]; for (int i = 0; i < m; i++) { cin >> a[i]; } sort(a, a + m); for (int i = 1; i < m - 1; i++) { if ((a[i] - a[i - 1] == 1) && (a[i + 1] - a[i] == 1)) { flag = 1; break; } } if (flag == 1 || a[m - 1] == n || a[0] == 1) cout << NO << n ; else cout << YES << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 1e18; const int N = 3e5 + 7; const int MOD = 1e9 + 7; constexpr int mul(int a, int b) { return 1LL * a * b % MOD; } template <typename... T> constexpr int mul(int a, int b, T... t) { return mul(mul(a, b), t...); } inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } inline long long int readl() { char ch = getchar(); long long int x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long int a[N], b[N]; long long int dp[N][3]; int main() { int T = read(); while (T--) { int n = read(); for (int i = 1; i <= n; i++) { a[i] = readl(); b[i] = readl(); } for (int i = 1; i <= n; i++) { for (int j = 0; j < 3; j++) { dp[i][j] = INF; } } dp[1][0] = 0; dp[1][1] = b[1]; dp[1][2] = b[1] * 2; for (int i = 2; i <= n; i++) { for (int j = 0; j < 3; j++) { for (int k = 0; k < 3; k++) { if (a[i] + j == a[i - 1] + k) { continue; } dp[i][j] = min(dp[i][j], dp[i - 1][k] + b[i] * j); } } } cout << min(dp[n][0], min(dp[n][1], dp[n][2])) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, *a, s, t, d1 = 0, d2 = 0; cin >> n; a = new int[n]; for (int i = 0; i < n; i++) cin >> a[i]; cin >> s >> t; if (s < t) { int tmp = t; t = s; s = tmp; } for (int i = t - 1; i < s - 1; i++) d1 += a[i]; for (int i = s - 1; i < n; i++) d2 += a[i]; for (int i = 0; i < t - 1; i++) d2 += a[i]; if (d1 > d2) cout << d2; else cout << d1; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> prefix_function(const string &s) { int n = (int)s.size(); vector<int> p(n); p[0] = 0; for (int i = 1; i < n; i++) { p[i] = p[i - 1]; while (p[i] > 0 && s[p[i]] != s[i]) p[i] = p[p[i] - 1]; if (s[p[i]] == s[i]) p[i]++; } return p; } vector<int> Z_function(string s) { int n = (int)s.size(); vector<int> Z(n); int l = 0, r = 0; for (int i = 1; i < n; i++) { if (i <= r) Z[i] = min(Z[i - l], r - i + 1); while (i + Z[i] < n && s[i + Z[i]] == s[Z[i]]) Z[i]++; if (i + Z[i] >= r) { l = i; r = i + Z[i] - 1; } } return Z; } int main() { string a; getline(cin, a); string b; getline(cin, b); int n = (int)a.size(); if (n != (int)b.size()) { cout << -1 -1 << endl; return 0; } vector<int> Z = Z_function(b + char(10) + a); reverse(a.begin(), a.end()); vector<int> pi = prefix_function(a + char(10) + b); reverse(a.begin(), a.end()); int i = 0; int x = -1; int y = -1; while (i < n - 1) { if (a[i] != b[n - i - 1]) break; if (i + Z[n + 1 + i + 1] + pi[2 * n - i - 1] + 1 >= n) { x = i; y = n - pi[2 * n - i - 1]; }; i++; } cout << x << << y << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int A = 1000001; int x, p, k; bool b[A]; vector<int> v[A]; int calc(int x) { int ret = 0; int n = v[p].size(); for (int i = 1; i < (1 << n); i++) { int pro = 1; for (int j = 0; j < n; j++) { if ((1 << j) & i) pro *= v[p][j]; } ret += x / pro * (__builtin_popcount(i) % 2 ? 1 : -1); } return x - ret; } int main() { for (int i = 2; i < A; i++) b[i] = 1; for (int i = 2; i < A; i++) { if (b[i] == 0) continue; v[i].push_back(i); for (int j = i + i; j < A; j += i) { v[j].push_back(i); b[j] = 0; } } int T; scanf( %d , &T); while (T--) { scanf( %d %d %d , &x, &p, &k); int c = calc(x); int l = 1, r = 1e9; while (l <= r) { int mid = (l + r) / 2; if (calc(mid) - c >= k) r = mid - 1; else l = mid + 1; } printf( %d n , r + 1); } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.