func_code_string
stringlengths 59
71.4k
|
---|
#include <bits/stdc++.h> using namespace std; set<int> vis; vector<int> ans; map<int, int> d; int main() { int n, m; cin >> n >> m; queue<int> q; int count = 0; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); q.push(x); vis.insert(x); d[x] = 0; } long long int res = 0; while (count < m) { int now = q.front(); q.pop(); if (d[now] != 0) { res += d[now]; ans.push_back(now); count++; } if (vis.find(now - 1) == vis.end()) { q.push(now - 1); vis.insert(now - 1); d[now - 1] = d[now] + 1; } if (vis.find(now + 1) == vis.end()) { q.push(now + 1); vis.insert(now + 1); d[now + 1] = d[now] + 1; } } printf( %lld n , res); for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i]); } int zz = 0; cout << endl; } |
#include <bits/stdc++.h> using namespace std; int A[1 << 20]; long long R[2][256][2]; long long S[256][2]; int main() { int n; scanf( %d , &n); int i, j, k; for (i = (0); i < (n); ++i) scanf( %d , &A[i]); memset(R, 0, sizeof(R)); memset(S, 0, sizeof(S)); R[0][0][0] = 1; for (i = (0); i < (n); ++i) { int prev = i & 1; int next = prev ^ 1; memset(S, 0, sizeof(S)); for (j = (0); j < (201); ++j) for (k = (0); k < (2); ++k) S[j + 1][k] = (S[j][k] + R[prev][j][k]) % 998244353; memset(R[next], 0, sizeof(R[next])); for (j = (1); j < (201); ++j) if (A[i] == -1 || A[i] == j) { R[next][j][0] += S[201][0] - S[j + 1][0] + 998244353; R[next][j][0] += R[prev][j][0] + R[prev][j][1]; R[next][j][1] += S[j][0] + S[j][1]; R[next][j][0] %= 998244353; R[next][j][1] %= 998244353; } } long long res = 0; for (i = (1); i < (201); ++i) res += R[n & 1][i][0]; printf( %lld n , res % 998244353); return 0; }; |
#include <bits/stdc++.h> using namespace std; long long T = 0, n, t, a; long long mu10(int b) { long long c = 1; for (int i = 1; i <= b; i++) c = c * 10; return c; } long long solve(long long c) { int m = 1; long long T = 0; while (T < c) { T += ((mu10(m)) - (mu10(m - 1))) * m; a = mu10(m) - 1; m++; } m -= 1; long long b = (T - c); long long d = a - (b / m); if (b % m == 0) return d % 10; else { d /= mu10(b % m); return d % 10; } } int main() { cin >> n; cout << solve(n); return 0; } |
#include <bits/stdc++.h> int prime[20000000 + 1] = {0}; int palin[20000000 + 1] = {0}; bool check[20000000 + 1] = {1, 1, 0}; void primecheck() { for (int i = 2; i <= 20000000; i++) { if (check[i]) { prime[i] = prime[i - 1]; continue; } prime[i] = prime[i - 1] + 1; for (int j = 2; j * i <= 20000000; j++) check[j * i] = true; } } void palincheck() { for (int i = 1; i <= 20000000; i++) { int j = i; int counter = 0; while (j > 0) { counter = counter * 10 + j % 10; j = j / 10; } if (i == counter) palin[i] = palin[i - 1] + 1; else palin[i] = palin[i - 1]; } } int main() { primecheck(); palincheck(); int p, q; int left, right, mid; left = 1, right = 20000000; mid = (left + right) / 2; scanf( %d %d , &p, &q); for (int i = 20000000; i >= 1; i--) if ((long long int)q * prime[i] <= (long long int)p * palin[i]) { printf( %d n , i); return 0; } return 0; } |
#include <bits/stdc++.h> using db = double; int read() { int x; scanf( %d , &x); return x; } const int N = 50007; const db eps = 1e-10; db x, y, k[N], b[N], ans; int n, c, t[N * 2], las[N], L[N * 2], R[N * 2]; struct node { db ang; int id; } a[N * 2]; db sqr(db a) { return a * a; } void add(int p, int v) { for (; p <= c; p += p & -p) t[p] += v; } int ask(int p) { int s = 0; for (; p; p ^= p & -p) s += t[p]; return s; } int check(db r) { db A, B, C, D, X, Y; int s = 0; c = 0; for (int i = 1; i <= n; ++i) { A = sqr(k[i]) + 1, B = -2 * x + 2 * k[i] * (b[i] - y), C = sqr(x) + sqr(b[i] - y) - sqr(r); if (B * B + eps <= 4 * A * C) continue; D = sqrt(sqr(B) - 4 * A * C), A *= 2; X = (D - B) / A, Y = k[i] * X + b[i], a[++c] = {atan2(Y - y, X - x), i}; X = (-D - B) / A, Y = k[i] * X + b[i], a[++c] = {atan2(Y - y, X - x), i}; } std::sort(a + 1, a + c + 1, [](const node& a, const node& b) { return a.ang < b.ang; }); for (int i = 1, id; i <= c; ++i) las[id = a[i].id] ? s += ask(i) - ask(las[id]), add(las[id], -1), las[id] = 0 : (add(i, 1), las[id] = i); return s; } int pre[100010], nxt[100010], lst; db cal(int i, int j) { db X = (b[j] - b[i]) / (k[i] - k[j]), Y = X * k[i] + b[i]; return sqrt(sqr(X - x) + sqr(Y - y)); } int main() { db l = 0; int m, s = 0; n = read(), x = read() / 1000.0, y = read() / 1000.0, m = read(); for (int i = 1; i <= n; ++i) k[i] = read() / 1000.0, b[i] = read() / 1000.0; for (db r = 1e13, mid, i = 100; i > 0; --i) check(mid = (l + r) / 2) < m ? l = mid : r = mid; check(l); for (int i = 1, j = 0, p; i <= c; ++i) if (las[a[i].id]) { for (p = j; p > las[a[i].id]; p = L[p]) ++s, ans += cal(a[i].id, a[p].id); R[L[p]] = R[p], L[R[p]] = L[p]; if (p == j) j = L[j]; } else R[j] = i, L[i] = j, j = i, las[a[i].id] = i; printf( %.10lf , ans + l * (m - s)); } |
#include <bits/stdc++.h> using namespace std; static const double PI = acos(-1.0); static const double EPS = 1e-9; long long n; long long a[200010]; long long dp[200010][2]; inline bool border(long long x) { return 0 <= x && x < n; } long long dfs(long long x, long long step) { if (dp[x][step] != -1) return dp[x][step]; dp[x][step] = -2; if (step == 0) { if (!border(x + a[x])) { return dp[x][step] = a[x]; } else { long long y = dfs(x + a[x], 1); if (y == -2) return dp[x][step] = -2; else return dp[x][step] = y + a[x]; } } else if (step == 1) { if (!border(x - a[x])) { return dp[x][step] = a[x]; } else { long long y = dfs(x - a[x], 0); if (y == -2) return dp[x][step] = -2; else return dp[x][step] = y + a[x]; } } } int main() { int i, j; cin >> n; for (i = 1; i < n; ++i) cin >> a[i]; for (i = 0; i < n; ++i) for (j = 0; j < 2; ++j) dp[i][j] = -1; for (i = 1; i < n; ++i) for (j = 0; j < 2; ++j) dfs(i, j); for (i = 1; i < n; ++i) { if (dp[i][1] == -2) puts( -1 ); else printf( %I64d n , dp[i][1] + i); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; n--; t--; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 0; i <= n; i) { if (i == t) { cout << YES n ; return 0; } else { if (i < n) i += arr[i]; else break; } } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; vector<int> pl; vector<int> sum; int a; int otv = 0; cin >> n; int m = pow(2, n + 1) - 2; pl.push_back(0); for (int i = 1; i <= m; ++i) { cin >> a; pl.push_back(a); } for (int j = n; j > 0; j--) for (int i = pow(2, j); i < pow(2, j + 1) - 1; i += 2) { pl[i / 2 - 1] += max(pl[i - 1], pl[i]); otv += abs(pl[i - 1] - pl[i]); } cout << otv; return 0; } |
#include <bits/stdc++.h> using namespace std; int CONST = z - a + 1; struct Node { Node() { chars.resize(CONST); for (int i = 0; i < CONST; i++) chars[i].reset(nullptr); } vector<unique_ptr<Node> > chars; }; int prefix(Node* node, const string& word, int index) { while (true) { if (index == word.size()) return word.size(); char c = word[index]; if (node->chars[c - a ].get() == nullptr) return index + 1; node = node->chars[c - a ].get(); ++index; } } void add(Node* node, const string& word, int index) { while (true) { if (index == word.size()) return; char c = word[index]; if (node->chars[c - a ].get() == nullptr) node->chars[c - a ].reset(new Node()); node = node->chars[c - a ].get(); index++; } } int main() { int k; cin >> k; string T; cin >> T; for (int i = 0; i < T.size(); ++i) { for (int j = 1; j < T.size(); j++) { for (int l = i; l <= i + j * 4; l += j) { if (l < T.size() && T[l] == * ) { if (l == i + j * 4) { cout << yes << endl; return 0; } } else { break; } } } } cout << no << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class A> void pr(A a) { cout << a; cout << n ; } template <class A, class B> void pr(A a, B b) { cout << a << ; pr(b); } template <class A, class B, class C> void pr(A a, B b, C c) { cout << a << ; pr(b, c); } template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) { cout << a << ; pr(b, c, d); } template <class A> void PR(A a, long long n) { for (long long i = (long long)(0); i < (long long)(n); i++) { if (i) cout << ; cout << a[i]; } cout << n ; } long long check(long long n, long long m, long long x, long long y) { return x >= 0 && x < n && y >= 0 && y < m; } const long long MAX = 1e9 + 7, MAXL = 1LL << 61, dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1}; void Main() { int T; cin >> T; while (T--) { long long n; string s; cin >> n >> s; long long ans = n; for (long long i = (long long)(0); i < (long long)(n); i++) { if (s[i] == 1 ) { ans = max(ans, (i + 1) * 2); ans = max(ans, (n - i) * 2); } } pr(ans); } } int main() { ios::sync_with_stdio(0); cin.tie(0); Main(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m, i; cin >> n >> m; map<int, int> mp; for (i = 0; i < 3; i++) { int t; cin >> t; if (i == 0) mp[t] = 1; if (i == 1) mp[t] = 2; if (i == 2) mp[t] = 3; } for (i = 1; i < m; i++) { int a, b, c; cin >> a >> b >> c; if (mp[a] == 0 && mp[b] == 0 && mp[c] == 0) { mp[a] = 1; mp[b] = 2; mp[c] = 3; } else { if (mp[a] != 0) { int cur = b; for (int j = 1; j <= 3; j++) { if (mp[a] != j) { mp[cur] = j; cur = c; } } } else if (mp[b] != 0) { int cur = a; for (int j = 1; j <= 3; j++) { if (mp[b] != j) { mp[cur] = j; cur = c; } } } else { int cur = a; for (int j = 1; j <= 3; j++) { if (mp[c] != j) { mp[cur] = j; cur = b; } } } } } for (i = 1; i <= n; i++) { cout << mp[i] << ; } } |
#include <bits/stdc++.h> using namespace std; int n, x, res, p[(1 << 20)]; int main() { for (cin >> n; n--;) scanf( %d , &x), p[x]++; for (int i = 0; i < (1 << 20); i++) res += p[i] & 1, p[i + 1] += p[i] / 2; cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void trace(T a) { cout << a << n ; } template <typename T, typename... Args> void trace(T a, Args... args) { cout << a << ; trace(args...); } int recNum = 0; void prTabs() { for (int i = 0; i < recNum; i++) cout << ; } template <typename... Args> void recInit(Args... args) { prTabs(); trace( rec( , args..., ) ); recNum++; } template <typename T> void recEnd(T a) { prTabs(); trace( -> , a); recNum--; } int n, m, a, b, c; map<int, int> s; map<int, int> sa; int li[500001]; int freq[2][2000002]; int k; int main() { memset(freq, 0, sizeof freq); scanf( %d %d %d %d , &m, &k, &n, &b); for (int i = 1; i <= m; i++) { scanf( %d , li + i); } for (int i = 0; i < b; i++) { scanf( %d , &a); if (s.count(a)) { s[a]++; } else { s[a] = 1; } } int il = 0, ir = 0; for (int i = 0; i < n; i++) { int dacerto = true; while (ir < m - ((n - 1 - i) * k)) { freq[1][li[++ir]]++; } while (il < k * i) { freq[0][li[++il]]++; } for (map<int, int>::iterator it = s.begin(); it != s.end(); it++) { if (freq[1][it->first] - freq[0][it->first] < it->second) { dacerto = false; break; } } if (!dacerto) continue; printf( %d n , m - (n * k)); int falta = k - b; for (int j = k * i + 1; j <= m - ((n - 1 - i) * k); j++) { if (sa[li[j]] < s[li[j]]) { sa[li[j]]++; } else if (falta) { sa[li[j]]++; falta--; } else { printf( %d , j); } } printf( n ); return 0; } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> int A[1000000], i, j, k, l, m, n, a, b, c, d, e, f, g, B[500000]; int main() { scanf( %d%d%d%d , &a, &b, &m, &A[0]); for (i = 1; i <= 100005; i++) { A[i] = (a * A[i - 1] + b) % m; if (B[A[i]]) { printf( %d , i - B[A[i]]); return 0; } B[A[i]] = i; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int infinity = 9e18; bool possible(long long int x1, long long int x2, long long int y1, long long int y2, long long int n, long long int m, string s, long long int dx, long long int dy) { long long int a = m / n; long long int b = m % n; x1 += a * dx; y1 += a * dy; for (int i = 0; i < b; i++) { if (s[i] == U ) y1++; if (s[i] == D ) y1--; if (s[i] == R ) x1++; if (s[i] == L ) x1--; } if ((abs(y1 - y2) + abs(x1 - x2)) <= m) return 1; return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int x1, x2, y1, y2, n; cin >> x1 >> y1 >> x2 >> y2 >> n; string s; cin >> s; long long int dx = 0, dy = 0; for (int i = 0; i < n; i++) { if (s[i] == U ) dy++; if (s[i] == D ) dy--; if (s[i] == R ) dx++; if (s[i] == L ) dx--; } long long int st = 0, end = 1e18; while (st < end) { long long int mid = (end + st) / 2; if (possible(x1, x2, y1, y2, n, mid, s, dx, dy)) { end = mid; } else { st = mid + 1; } } if (st == 1e18) cout << -1; else cout << st; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; vector<int> g[N], gr[N]; bool used[N]; vector<int> order, component; pair<int, int> edge[N]; int par[N]; vector<int> v[N]; int f(int i) { if (par[i] != i) par[i] = f(par[i]); return par[i]; } void merge(int a, int b) { a = f(a), b = f(b); if (a == b) return; par[a] = b; } void dfs1(int v) { used[v] = true; for (size_t i = 0; i < g[v].size(); ++i) if (!used[g[v][i]]) dfs1(g[v][i]); order.push_back(v); } void dfs2(int v) { used[v] = true; component.push_back(v); for (size_t i = 0; i < gr[v].size(); ++i) if (!used[gr[v][i]]) dfs2(gr[v][i]); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) g[i].clear(), gr[i].clear(), par[i] = i, v[i].clear(); order.clear(); component.clear(); for (int i = 1; i <= n; i++) used[i] = false; for (int i = 0; i <= m - 1; i++) { int a, b; cin >> a >> b; edge[i] = make_pair(a, b); g[a].push_back(b); gr[b].push_back(a); } for (int i = 1; i <= n; ++i) if (!used[i]) dfs1(i); for (int i = 1; i <= n; i++) used[i] = false; for (int i = 0; i < n; ++i) { int v = order[n - 1 - i]; if (!used[v]) { dfs2(v); int sz = component.size(); for (int i = 0; i <= sz - 1; i++) merge(component[0], component[i]); component.clear(); } } for (int i = 1; i <= n; i++) v[i].clear(); set<int> s; for (int i = 1; i <= n; i++) { s.insert(f(i)); } if (s.size() == 1) { cout << No n ; } else { for (int i = 0; i <= m - 1; i++) { if (f(edge[i].first) == f(edge[i].second)) continue; v[f(edge[i].first)].push_back(f(edge[i].second)); } set<int> s1; for (int i = 1; i <= n; i++) { if (v[f(i)].size() == 0) { for (int j = 1; j <= n; j++) { if (f(i) == f(j)) s1.insert(j); } break; } } cout << Yes n ; cout << s1.size() << << n - s1.size(); cout << n ; for (__typeof(s1.begin()) it = s1.begin(); it != s1.end(); it++) { cout << *it; cout << ; } cout << n ; for (int i = 1; i <= n; i++) { if (!(s1.find(i) != s1.end())) { cout << i; cout << ; } } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; double first[10005], second[10005], w, u, v; double eps = 1e-9; signed main() { ios::sync_with_stdio(0); cin.tie(NULL), cout.tie(NULL); cin >> n >> w >> u >> v; for (int i = 0; i < n; i++) cin >> first[i] >> second[i]; double ans = w / v; int fl = 0; for (int i = 0; i < n; i++) { if (first[i] > eps) fl = 1; } if (!fl) { cout << fixed << setprecision(15) << ans; return 0; } fl = 0; for (int i = 0; i < n; i++) { if (first[i] < eps) { fl = 1; break; } if (w - second[i] < eps) continue; double ti = first[i] / u; double hi = second[i] / v; if (hi - ti < eps) continue; fl = 1; break; } if (!fl) { cout << fixed << setprecision(15) << ans; return 0; } for (int i = 0; i < n; i++) { if (first[i] < eps) continue; if (w - second[i] < eps) continue; double j = first[i] / u; if (second[i] - w > eps) continue; double f = second[i] / v; if (f - j > eps) j = f; j += (w - second[i]) / v; ans = max(ans, j); } cout << fixed << setprecision(15) << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[110]; bool a[10]; int main() { int x, y, pow = 1, t, k, b = 0; gets(s); k = strlen(s); for (int i = 0; i < k; i++) { for (int j = 0; j < 8; j++) a[j] = 0; x = (int)s[i]; for (int j = 0; j < 8; j++) { if (x % 2 == 1) a[j] = 1; else a[j] = 0; x /= 2; } t = 0; pow = 1; for (int j = 7; j >= 0; j--) { t += pow * a[j]; pow *= 2; } y = (256 - t + b) % 256; b = t; cout << y << endl; } scanf( ); } |
#include <bits/stdc++.h> using namespace std; int n; int pow2[50]; int l[50]; int level(long long p) { long long comp = 1; int ans = 0; while (comp <= p) { comp <<= 1; ans++; } return ans - 1; } bool ispow2(long long p) { long long comp = 1; while (comp < p) { comp <<= 1; } return comp == p; } bool viable(int cnt) { int le[50]; for (int i = 0; i < 50; i++) le[i] = l[i]; int slot[50]; for (int i = 0; i < 50; i++) slot[i] = 0; for (int i = 0; i < 50; i++) { if (i == 0) { if (pow2[i] > cnt) { slot[i] = cnt; le[i] += pow2[i] - cnt; } else { slot[i] = pow2[i]; } } else { if (pow2[i] > slot[i - 1]) { slot[i] = slot[i - 1]; le[i] += pow2[i] - slot[i]; } else { slot[i] = pow2[i]; } } } int sum = 0; for (int i = 49; i >= 0; i--) { sum += le[i]; if (sum > slot[i]) return false; } return true; } int main() { cin >> n; for (int i = 0; i < n; i++) { long long a; cin >> a; if (ispow2(a)) pow2[level(a)]++; else l[level(a)]++; } if (!viable(pow2[0])) { cout << -1 << endl; return 0; } int ansl = pow2[0]; while (ansl > 1 && viable(ansl - 1)) ansl--; for (int i = ansl; i <= pow2[0]; i++) { if (viable(i)) cout << i << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; long long n, l[MAXN], r[MAXN], vall[MAXN], valr[MAXN], pos[MAXN], d[MAXN], tree[4 * MAXN], ind[MAXN]; bool validl[MAXN], validr[MAXN], dead; pair<long long, long long> sortr[MAXN]; void computeleft() { l[0] = -1, r[0] = 1, r[n + 1] = -1, l[n + 1] = n; for (int i = 1; i <= n; ++i) l[i] = i - 1, r[i] = i + 1; validl[0] = 1, vall[0] = 2 * d[0]; for (int i = 1; i <= n + 1; ++i) { queue<int> drop; if ((i > 1) && (pos[r[i - 1]] - pos[l[i - 1]] > 2 * d[i - 1])) drop.push(i - 1); while (!drop.empty()) { int t = drop.front(); drop.pop(); int lt = l[t], rt = r[t]; r[lt] = r[t]; l[rt] = l[t]; if (lt != 0) { if (pos[r[lt]] - pos[l[lt]] > 2 * d[lt]) drop.push(lt); } if (rt != i) { if (pos[r[rt]] - pos[l[rt]] > 2 * d[rt]) drop.push(rt); } } if (2 * d[i] - (pos[i] - pos[l[i]]) > 0) validl[i] = 1; vall[i] = 2 * d[i] + pos[l[i]]; } if (r[0] != n + 1) { cout << 0.0 n ; exit(0); } } void computeright() { l[0] = -1, r[0] = 1, r[n + 1] = -1, l[n + 1] = n; for (int i = 1; i <= n; ++i) l[i] = i - 1, r[i] = i + 1; validr[n + 1] = 1, valr[n + 1] = pos[n + 1] - 2 * d[n + 1]; for (int i = n; i >= 1; --i) { queue<int> drop; if ((i < n) && (pos[r[i + 1]] - pos[l[i + 1]] > 2 * d[i + 1])) drop.push(i + 1); while (!drop.empty()) { int t = drop.front(); drop.pop(); int lt = l[t], rt = r[t]; r[lt] = r[t]; l[rt] = l[t]; if (lt != i) { if (pos[r[lt]] - pos[l[lt]] > 2 * d[lt]) drop.push(lt); } if (rt != n + 1) { if (pos[r[rt]] - pos[l[rt]] > 2 * d[rt]) drop.push(rt); } } if (2 * d[i] - (pos[r[i]] - pos[i]) > 0) validr[i] = 1; valr[i] = pos[r[i]] - 2 * d[i]; } } void init(int l = 0, int r = n, int node = 1) { if (l == r) { tree[node] = 1e9 + 5; return; } int mid = (l + r) / 2; init(l, mid, 2 * node); init(mid + 1, r, 2 * node + 1); tree[node] = min(tree[2 * node], tree[2 * node + 1]); } int findmin(int a, int b, int l = 0, int r = n, int node = 1) { if (a == l && b == r) return tree[node]; int mid = (l + r) / 2; if (b <= mid) return findmin(a, b, l, mid, 2 * node); if (a >= mid + 1) return findmin(a, b, mid + 1, r, 2 * node + 1); return min(findmin(a, mid, l, mid, 2 * node), findmin(mid + 1, b, mid + 1, r, 2 * node + 1)); } void upd(int v, int x, int l = 0, int r = n, int node = 1) { if (l == r) { tree[node] = x; return; } int mid = (l + r) / 2; if (v <= mid) upd(v, x, l, mid, 2 * node); else upd(v, x, mid + 1, r, 2 * node + 1); tree[node] = min(tree[2 * node], tree[2 * node + 1]); } void findans() { for (int i = 0; i <= n; ++i) sortr[i] = pair<long long, long long>(valr[i + 1], i + 1); sort(sortr, sortr + n + 1); for (int i = 0; i <= n; ++i) ind[sortr[i].second] = i; init(); long long best = 1e9 + 5; for (int i = n; i >= 0; --i) { if (validr[i + 1]) upd(ind[i + 1], pos[i + 1]); if (!validl[i]) continue; int lo = -1, hi = n; while (lo != hi) { int mid = (lo + hi + 1) / 2; if (sortr[mid].first > vall[i]) hi = mid - 1; else lo = mid; } if (lo != -1) best = min(best, findmin(0, lo) - pos[i]); } cout << fixed << setprecision(1) << 0.5 * best << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n + 2; ++i) cin >> pos[i]; d[0] = d[n + 1] = 1LL * 1000000 * 1000000 + 5; for (int i = 1; i <= n; ++i) cin >> d[i]; computeleft(); computeright(); findans(); } |
#include <bits/stdc++.h> using namespace std; const int K = 103, N = 30005; double f[K], sum[K]; double pr[N][K]; double mem[N][K]; int main() { string s; cin >> s; int n, H; cin >> n >> H; H++; if (s == Bob ) { cout << n << endl; return 0; } for (int i = 1; i <= H; i++) { if (i == H) f[i] = pow(2, -(i - 1)); else f[i] = pow(2, -i); sum[i] = sum[i - 1] + f[i]; } for (int i = 1; i <= n; i++) for (int t = 1; t <= H; t++) mem[i][t] = pow(sum[t], i - 1) - pow(sum[t - 1], i - 1); memset(pr, 0, sizeof pr); pr[1][0] = 1; for (int i = 2; i <= n; i++) { for (int h = 1; h <= H; h++) { double leftbigger = 1 - pow(sum[h], i - 1); double rightbigger = 1 - pow(sum[h], n - i); double skipped = leftbigger * rightbigger; double dd = skipped * f[h]; pr[i][0] += dd; double sm = dd; for (int t = 1; t < h; t++) { double left = mem[i][t]; pr[i][t] += left * f[h]; sm += left * f[h]; } pr[i][h] += f[h] - sm; } } double ans = 1; for (int i = 1; i <= n; i++) for (int h = 1; h <= H; h++) ans += pr[i][h] * pow(2, h - 1); cout << setprecision(15) << ans << endl; } |
#include <bits/stdc++.h> int p[100100]; void solve(int n, int m) { int i, j, k, x, s = 0, l = 0, r = n; for (i = 0; i < 100100; i++) p[i] = 0; for (i = 0; i <= n; i++) p[i] = i; for (k = 0; k < m; k++) { scanf( %d , &x); if (x == 1) { scanf( %d , &x); if (s == 0) { if (2 * x <= r - l) { for (i = l + x; i <= l + 2 * x; i++) p[i] = p[i] - p[2 * l + 2 * x - i]; l += x; } else { for (i = l + x; i >= 2 * l + 2 * x - r; i--) p[i] = p[i] + n - p[2 * l + 2 * x - i]; r -= r - l - x; s = 1; } } else { if (2 * x <= r - l) { x = r - l - x; for (i = l + x; i >= 2 * l + 2 * x - r; i--) p[i] = p[i] + n - p[2 * l + 2 * x - i]; r -= r - l - x; } else { x = r - l - x; for (i = l + x; i <= l + 2 * x; i++) p[i] = p[i] - p[2 * l + 2 * x - i]; l += x; s = 0; } } } else { scanf( %d%d , &i, &j); if (s == 0) { printf( %d n , p[j + l] - p[i + l]); } else { printf( %d n , p[r - i] - p[r - j]); } } } } int main() { #pragma comment(linker, /STACK:134217728 ) int n, m; while (scanf( %d%d , &n, &m) != EOF) { solve(n, m); printf( n ); } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000 ) #pragma GCC ostarimize( O500 ) using namespace std; const bool db = false; set<pair<int, int>> s; int a[200100]; int main() { int n, k, q; scanf( %d %d %d n , &n, &k, &q); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); scanf( n ); int type, num; set<pair<int, int>>::iterator it; while (q--) { scanf( %d %d n , &type, &num); if (type == 1) { s.insert({-a[num], num}); if (s.size() > k) { it = s.end(); it--; s.erase(it); } } else { if (s.count({-a[num], num})) puts( YES ); else puts( NO ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; cout << (a + b); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; int id; Point() {} Point(long long a, long long b, int c) : x(a), y(b), id(c) {} Point operator-(Point b) { return Point(x - b.x, y - b.y, 0); } bool operator<(const Point &b) const { return (x != b.x) ? x < b.x : y < b.y; } }; long long cross(Point x, Point y) { return x.x * y.y - x.y * y.x; } bool in[2005]; int gethull(Point *p, int n, int s, bool v) { static Point st[2005], hull[2005]; int top = 0, cnt = 0; for (int i = 1; i <= n; i++) { while (top > 1 && cross(p[i] - st[top], st[top] - st[top - 1]) >= 0) top--; st[++top] = p[i]; } for (int i = 1; i < top; i++) hull[++cnt] = st[i]; top = 0; for (int i = 1; i <= n; i++) { while (top > 1 && cross(p[i] - st[top], st[top] - st[top - 1]) <= 0) top--; st[++top] = p[i]; } for (int i = top; i > 1; i--) hull[++cnt] = st[i]; for (int i = 1; i <= cnt; i++) if (hull[i].id == s) { in[hull[i].id] = 1; return (v) ? hull[(i - 1 + cnt - 1) % cnt + 1].id : hull[i % cnt + 1].id; } } Point p[2005], q[2005]; char str[2005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { int x, y; scanf( %d%d , &x, &y); p[i] = Point(x, y, i); } scanf( %s , str + 1); str[n - 1] = L ; sort(p + 1, p + n + 1); int cur = p[1].id; for (int i = 1; i < n; i++) { int cnt = 0; for (int j = 1; j <= n; j++) if (!in[p[j].id]) q[++cnt] = p[j]; printf( %d , cur); cur = gethull(q, cnt, cur, (str[i] == R )); } printf( %d n , cur); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int N = 1e6 + 5; int n, m, k; bool vis[N]; int main() { ios::sync_with_stdio(false); cin >> n >> m >> k; int h; for (int i = 1; i <= m; i++) { cin >> h; vis[h] = 1; } bool fg = 0; int bone = 1; if (vis[bone]) fg = 1; for (int i = 1; i <= k; i++) { int u, v; cin >> u >> v; if ((u == bone || v == bone) && !fg) { bone = (bone == u) ? v : u; if (vis[bone]) fg = 1; } } cout << bone << endl; return 0; } |
#include <bits/stdc++.h> int min(int a, int b) { return a < b ? a : b; } int max(int a, int b) { return a > b ? a : b; } unsigned int X; void srand_() { struct timeval tv; gettimeofday(&tv, NULL); X = tv.tv_sec ^ tv.tv_usec | 1; } int rand_() { return (X *= 3) >> 1; } int *ej[1000], eo[1000]; void append(int i, int j) { int o = eo[i]++; if (o >= 2 && (o & o - 1) == 0) ej[i] = (int *)realloc(ej[i], o * 2 * sizeof *ej[i]); ej[i][o] = j; } int aa[1000], bb[1000], ii[1000], n; int compare(int i, int j) { return aa[i] != aa[j] ? aa[i] - aa[j] : i - j; } void sort(int *ii, int l, int r) { while (l < r) { int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp; while (j < k) { int c = compare(ii[j], i_); if (c == 0) j++; else if (c < 0) { tmp = ii[i], ii[i] = ii[j], ii[j] = tmp; i++, j++; } else { k--; tmp = ii[j], ii[j] = ii[k], ii[k] = tmp; } } sort(ii, l, i); l = k; } } char visited[1000]; int qu[1000], cnt; int i_; void dfs1(int i) { int o; if (visited[i] || compare(i, i_) > 0) return; visited[i] = 1; qu[cnt++] = i; for (o = eo[i]; o--;) { int j = ej[i][o]; dfs1(j); } } char add[1000]; int cc[1000][1000]; void dfs2(int p, int i, int c) { int o; for (o = eo[i]; o--;) { int j = ej[i][o]; if (j != p) { if (compare(j, i_) > 0) cc[i_][j] = max(cc[i_][j], c); else dfs2(i, j, min(c + bb[j], 0x3f3f3f3f)); } } } int dp[1000]; int solve(int s) { int g; memset(dp, 0, n * sizeof *dp), dp[0] = s; for (g = 0; g < n; g++) { int i_ = ii[g], x = dp[i_], j; if (x == 0) continue; for (j = 0; j < n; j++) if (compare(i_, j) < 0 && cc[i_][j] != -1) { int c = add[i_] ? min(x + cc[i_][j], 0x3f3f3f3f) : min(s + cc[i_][j], 0x3f3f3f3f); if (c >= aa[j]) dp[j] = max(dp[j], min(c + bb[j], 0x3f3f3f3f)); } } return dp[ii[n - 1]] > 0; } int main() { int t; srand_(); scanf( %d , &t); while (t--) { static int qu_[1000], dd[1000], pp[1000]; int m, g, h, i, j, o, cnt_, lower, upper; scanf( %d%d , &n, &m); aa[0] = 0; for (i = 1; i < n; i++) scanf( %d , &aa[i]), aa[i]++; for (i = 1; i < n; i++) scanf( %d , &bb[i]); for (i = 0; i < n; i++) ej[i] = (int *)malloc(2 * sizeof *ej[i]), eo[i] = 0; for (h = 0; h < m; h++) { scanf( %d%d , &i, &j), i--, j--; append(i, j), append(j, i); } for (i = 0; i < n; i++) ii[i] = i; sort(ii, 0, n); for (g = 0; g < n; g++) { i_ = ii[g]; memset(visited, 0, n * sizeof *visited), cnt = 0; memset(cc[i_], -1, n * sizeof *cc[i_]); dfs1(0); if (visited[i_]) { int tree, p; memset(dd, 0, n * sizeof *dd); memset(pp, -1, n * sizeof *pp); for (h = 0; h < cnt; h++) { i = qu[h]; for (o = eo[i]; o--;) { j = ej[i][o]; if (visited[j]) dd[i]++; } } cnt_ = 0; for (h = 0; h < cnt; h++) { i = qu[h]; if (dd[i] == 1) qu_[cnt_++] = i; } while (cnt_) { i = qu_[--cnt_]; dd[i] = -1; for (o = eo[i]; o--;) { j = ej[i][o]; if (dd[j] > 0) { pp[i] = j; if (--dd[j] == 1) qu_[cnt_++] = j; } } } tree = 1; for (h = 0; h < cnt; h++) { i = qu[h]; if (dd[i] > 0) { tree = 0; break; } } p = -1, i = 0; while (i != -1 && dd[i] <= 0 && i != i_) p = i, i = pp[i]; add[i_] = 1; if (dd[i_] <= 0 && i != i_) dfs2(pp[i_], i_, 0); else if (tree) dfs2(p, i_, 0); else { int c; add[i_] = 0; c = 0; for (i = 0; i != -1 && dd[i] <= 0; i = pp[i]) c = min(c + bb[i], 0x3f3f3f3f); for (h = 0; h < cnt; h++) { i = qu[h]; if (dd[i] > 0) c = min(c + bb[i], 0x3f3f3f3f); } for (p = -1, i = 0; i != -1 && dd[i] <= 0; p = i, i = pp[i]) for (o = eo[i]; o--;) { j = ej[i][o]; if (compare(j, i_) > 0) cc[i_][j] = max(cc[i_][j], c); else if (j != pp[i] && j != p) dfs2(i, j, min(c + bb[j], 0x3f3f3f3f)); } for (h = 0; h < cnt; h++) { i = qu[h]; if (dd[i] > 0) for (o = eo[i]; o--;) { j = ej[i][o]; if (compare(j, i_) > 0) cc[i_][j] = max(cc[i_][j], c); else if (pp[j] == i && j != p) dfs2(i, j, min(c + bb[j], 0x3f3f3f3f)); } } } } } lower = 0, upper = 0x3f3f3f3f; while (upper - lower > 1) { int s = (lower + upper) / 2; if (solve(s)) upper = s; else lower = s; } printf( %d n , upper); for (i = 0; i < n; i++) free(ej[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MIN = numeric_limits<long long>::min(); class WindowHeap { public: WindowHeap() {} long long top() { if (_i >= _h.size()) return MIN; return _h[_i].first; } void erase(int idx) { if (!_h.empty() && _h[_i].second == idx) ++_i; } void insert(long long val, int idx) { if (val == MIN) return; while (!_h.empty() && val > _h.rbegin()->first) _h.pop_back(); if (_h.empty() || val < _h.rbegin()->first) _h.emplace_back(val, idx); else _h.rbegin()->second = idx; if (_i >= _h.size()) _i = _h.size() - 1; } private: vector<pair<long long, int>> _h; size_t _i; }; int main() { int n, k, x; cin >> n >> k >> x; vector<int> a(n); for (int& ai : a) cin >> ai; vector<long long> dp(n + 1, MIN); dp[0] = 0; for (int xi = 0; xi < x; ++xi) { WindowHeap wh; for (int i = n - 1; i > max(n - k, -1); --i) { wh.insert(dp[i], i); } for (int i = n; i > xi; --i) { if (i - k >= 0) wh.insert(dp[i - k], i - k); long long p = wh.top(); if (p > MIN) dp[i] = p + a[i - 1]; wh.erase(i - 1); } dp[xi] = MIN; } long long best = -1; for (int i = n; i > n - k; --i) best = max(best, dp[i]); cout << best << endl; return 0; } |
#include <bits/stdc++.h> long double read() { int x; scanf( %d , &x); return x / 1000.0L; } const long double eps = 1e-9, Eps = 1e-7; const int N = 1e5 + 5, V = 4e7 + 5; int n, m, q, rb[N], vol, stc[V]; std::pair<int, int> p[N]; long double k, ox, oy, a[N], b[N], cx[N], cy[N]; long double ans, dis[N], s[N], t[N], tb[N]; struct FenwickTree { int f[N]; void reset(int n) { memset(f, 0, (n + 1) * 4); } void modify(int u, int x) { for (int i = u; i <= m; i += i & -i) { f[i] += x; } } int query(int u) { int res = 0; for (int i = u; i >= 1; i ^= i & -i) { res += f[i]; } return res; } int query(int l, int r) { if (l >= r) { return 0; } return query(r) - query(l); } } tr; long double get(int i, int j) { long double x = (b[i] - b[j]) / (a[j] - a[i]), y = a[i] * x + b[i]; return std::sqrt((x - ox) * (x - ox) + (y - oy) * (y - oy)); } bool check(long double k, bool typ) { int res = 0; m = 0; for (int i = 0; i < n; i++) { long double x = cx[i] - ox, y = cy[i] - oy; if (dis[i] > k * k - eps) { continue; } if (std::abs(dis[i]) < eps) { s[i] = std::atan2(a[i], 1); t[i] = std::atan2(-a[i], -1); } else { long double z = std::sqrt(k * k / dis[i] - 1); s[i] = std::atan2(y - x * z, x + y * z); t[i] = std::atan2(y + x * z, x - y * z); } if (s[i] > t[i]) { std::swap(s[i], t[i]); } s[i] += eps; t[i] -= eps; tb[m++] = s[i]; tb[m++] = t[i]; } std::sort(tb, tb + m); for (int i = 0; i < n; i++) { if (dis[i] > k * k - eps) { p[i] = {m, i}; continue; } p[i] = {std::upper_bound(tb, tb + m, s[i]) - tb - 1, i}; rb[i] = std::upper_bound(tb, tb + m, t[i]) - tb; } std::sort(p, p + n); if (!typ) { tr.reset(m); for (int i = 0; i < n; i++) { if (p[i].first == m) { break; } res += tr.query(p[i].first, rb[p[i].second]); tr.modify(rb[p[i].second], 1); if (res >= q) { return false; } } } else { for (int i = 0; i < n; i++) { if (p[i].first == m) { break; } for (; vol > 0 && rb[stc[vol]] <= p[i].first; vol--) ; stc[++vol] = p[i].second; for (int i = vol - 1; i > 0; i--) { if (rb[stc[i]] > rb[stc[i + 1]]) { break; } double tmp = get(stc[i], stc[i + 1]); ans += tmp; res++; std::swap(stc[i], stc[i + 1]); } } ans += (q - res) * k; } return true; } int main() { scanf( %d , &n); ox = read(); oy = read(); scanf( %d , &q); int pass = 0; for (int i = 0; i < n; i++) { a[i] = read(); b[i] = read(); if (std::abs(a[i]) < eps) { cx[i] = ox; cy[i] = b[i]; } else { long double _a = -1 / a[i], _b = oy - _a * ox; cx[i] = (_b - b[i]) / (a[i] - _a); cy[i] = a[i] * cx[i] + b[i]; } dis[i] = (ox - cx[i]) * (ox - cx[i]) + (oy - cy[i]) * (oy - cy[i]); if (dis[i] < eps) { pass++; } } if (pass * (pass - 1ll) / 2 >= q) { printf( 0.000000 n ); return 0; } for (long double l = Eps, r = 21e8, mid; l <= r;) { mid = (l + r) / 2; if (check(mid, false)) { l = mid + Eps; k = mid; } else { r = mid - Eps; } } check(k, true); printf( %.6f n , (double)ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; vector<int> v[100000]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; map<int, int> m; for (int i = 0; i < n; i++) { int a; cin >> a; for (int j = 2; j <= sqrt(a); j++) { if (a % j == 0) { m[j]++; while (a % j == 0) a /= j; } } if (a != 1) m[a]++; } int ans = 1; for (auto i : m) ans = max(ans, i.second); cout << ans; return 0; } |
#include <iostream> #include <queue> #include <algorithm> #include <cstring> #include <cmath> #include <vector> using namespace std; typedef long long LL; const LL mod = 1e9 + 7; const int N = 1e6 + 10; LL l[N], r[N]; LL c[N], a[N], b[N]; int main() { int T;cin >> T; while (T--) { int n; cin >> n; for (int i = 1; i <= n; i++)scanf( %lld ,&c[i]); for (int i = 1; i <= n; i++)scanf( %lld , &a[i]); for (int i = 1; i <= n; i++)scanf( %lld , &b[i]); LL res = 0; for (int i = 1; i < n;i++) { LL t = abs(a[i+1] - b[i+1]); LL t2 = abs(a[i + 1] - b[i + 1]); l[i] =t+1; if (a[i+1] != b[i+1]&&i>1) l[i] = max(l[i], l[i - 1] + c[i] - t + 1); res = max(res, l[i] + c[i + 1]); } cout << res << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 20; const int V = (1 << 20) + 10; const int P = 1000000007; int Pow(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = (long long)ret * x % P; x = (long long)x * x % P; y /= 2; } return ret; } void utf(int *a, int l, int r) { if (l + 1 != r) { int mid = (l + r) / 2; for (int i = 0; i < mid - l; i++) { a[l + i] -= a[mid + i]; if (a[l + i] < 0) a[l + i] += P; } utf(a, l, mid); utf(a, mid, r); } } void tf(int *a, int l, int r) { if (l + 1 != r) { int mid = (l + r) / 2; tf(a, l, mid); tf(a, mid, r); for (int i = 0; i < mid - l; i++) { if (((l + i) & (mid + i)) != (l + i)) while (1) ; a[l + i] += a[mid + i]; if (a[l + i] >= P) a[i + l] -= P; } } } int cnt[V], q[V]; int n, x, pro[V]; int pt[V]; int main() { pt[0] = 1; for (int i = 1; i < (1 << N); i++) pt[i] = pt[i - 1] * 2 % P; while (~scanf( %d , &n)) { memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < n; i++) { scanf( %d , &x); cnt[x]++; } tf(cnt, 0, (1 << N)); for (int i = 0; i < (1 << N); i++) pro[i] = pt[cnt[i]]; utf(pro, 0, (1 << N)); printf( %d n , pro[0]); } return 0; } |
#include <bits/stdc++.h> int main() { int n, i, j, ans = 0; char c[101]; scanf( %d , &n); scanf( %s , c); int l; for (l = 1; l <= n; l++) { for (i = 0; i < n - 4 * l; i++) { if (c[i] == * && c[i + l] == * && c[i + 2 * l] == * && c[i + 3 * l] == * && c[i + 4 * l] == * ) { ans = 1; break; } } if (ans == 1) break; } if (ans == 1) printf( yes n ); else printf( no n ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T sq(T x) { return x * x; } const long long inf = 2147383647; const double pi = 2 * acos(0.0); const double eps = 1e-9; const long long maxint = 2147483647; const long long minint = -2147483648; long long gcd(long long a, long long b) { while (b) { a = a % b; swap(a, b); } return a; } long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } long long power(long long a, long long p) { long long res = 1, x = a; while (p) { if (p & 1) res = res * x; x = x * x; p >>= 1; } return res; } long long bigmod(long long a, long long p, long long mod) { long long res = 1, x = a; while (p) { if (p & 1) res = (res * x) % mod; x = (x * x) % mod; p >>= 1; } return res; } map<int, int> mp, mp2; struct pop { int first, second, id; }; vector<pop> people; int m; int assign[100010]; long long memo[100010][2][2]; long long dp(int pos, int a, int b) { if (pos == m) { return 0; } if (memo[pos][a][b] != -1) return memo[pos][a][b]; int na, nb; if (pos + 1 < m && people[pos].first == people[pos + 1].first) { na = a; nb = b; } else if (pos + 1 < m && people[pos].first + 1 == people[pos + 1].first) { na = b; nb = 1; } else { na = 1; nb = 1; } long long x = dp(pos + 1, na, nb); long long y = x; if (a && people[pos].second >= mp[people[pos].first]) { int na, nb; if (pos + 1 < m && people[pos].first == people[pos + 1].first) { na = 0; nb = b; } else if (pos + 1 < m && people[pos].first + 1 == people[pos + 1].first) { na = b; nb = 1; } else { na = 1; nb = 1; } y = mp[people[pos].first] + dp(pos + 1, na, nb); } long long z = x; if (b && people[pos].second >= mp[people[pos].first + 1]) { int na = a, nb = b; if (pos + 1 < m && people[pos + 1].first == people[pos].first) { na = a; nb = 0; } else if (pos + 1 < m && people[pos].first + 1 == people[pos + 1].first) { na = 0; nb = 1; } else { na = 1; nb = 1; } z = mp[people[pos].first + 1] + dp(pos + 1, na, nb); } long long r = max(max(x, y), z); return memo[pos][a][b] = r; } bool compare(const pop &a, const pop &b) { if (a.first < b.first) return true; else if (a.first == b.first && a.second < b.second) return true; else return false; } void init(int pos, int a, int b, long long res) { if (pos == m) return; int na, nb; if (pos + 1 < m && people[pos].first == people[pos + 1].first) { na = a; nb = b; } else if (pos + 1 < m && people[pos].first + 1 == people[pos + 1].first) { na = b; nb = 1; } else { na = 1; nb = 1; } long long x = dp(pos + 1, na, nb); if (x == res) { assign[pos] = -1; return init(pos + 1, na, nb, res); } long long y = x; if (a && people[pos].second >= mp[people[pos].first]) { int na, nb; if (pos + 1 < m && people[pos].first == people[pos + 1].first) { na = 0; nb = b; } else if (pos + 1 < m && people[pos].first + 1 == people[pos + 1].first) { na = b; nb = 1; } else { na = 1; nb = 1; } y = mp[people[pos].first] + dp(pos + 1, na, nb); if (y == res) { assign[pos] = people[pos].first; return init(pos + 1, na, nb, res - mp[people[pos].first]); } } long long z = x; if (b && people[pos].second >= mp[people[pos].first + 1]) { int na = a, nb = b; if (pos + 1 < m && people[pos + 1].first == people[pos].first) { na = a; nb = 0; } else if (pos + 1 < m && people[pos].first + 1 == people[pos + 1].first) { na = 0; nb = 1; } else { na = 1; nb = 1; } z = mp[people[pos].first + 1] + dp(pos + 1, na, nb); if (z == res) { assign[pos] = people[pos].first + 1; return init(pos + 1, na, nb, res - mp[people[pos].first + 1]); } } } int main() { memset(memo, -1, sizeof memo); int n; scanf( %d , &n); int i; for (i = 0; i < n; i++) { int ci, si; scanf( %d %d , &ci, &si); mp[si] = ci; mp2[si] = i + 1; } scanf( %d , &m); for (i = 0; i < m; i++) { pop temp; scanf( %d %d , &temp.second, &temp.first); temp.id = i + 1; people.push_back(temp); } sort(people.begin(), people.end(), compare); long long res = dp(0, 1, 1); printf( %lld n , res); init(0, 1, 1, res); int r = 0; for (i = 0; i < m; i++) { int t = assign[i]; if (t == -1) continue; if (mp2[t] > 0) r++; } printf( %d n , r); for (i = 0; i < m; i++) { int t = assign[i]; if (t == -1) continue; if (mp2[t] > 0) { printf( %d %d n , people[i].id, mp2[t]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, l, r, k, i, ans; int main() { scanf( %I64d%I64d%I64d%I64d , &n, &l, &r, &k); r = (r + n - l + 1) % n; if (k < r) { printf( -1 ); return 0; } if (2 * r >= k) { ans = min(k + n - r * 2 + 1, n); if (ans >= k - r) { printf( %I64d , ans); return 0; } } for (i = 1; i <= k; i++) { l = max((k - n * i - r - 1) / (i + 1), (k - n * i - r * 2 - 1) / i) + 1; ans = min(min((k - n * (i - 1) - r * 2 + 1) / (i + 1), (k - n * i - r) / i), n); if (ans >= l) { printf( %I64d , ans); return 0; } if (i * i >= k) break; } i = min(i, n); for (; i >= 0; i--) { l = k % (n + i) - r; if ((l <= min(i, r)) && (l >= max(i + r - n - 1, 0ll))) { if (n + i >= k) printf( %I64d , min(i + 1, n)); else printf( %I64d , i); return 0; } } printf( -1 ); } |
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline string get() { char ch[1000010]; scanf( %s , ch); return ch; } const int MAX_LG = 21; const long long maxn = 5e5 + 10; const long long base = 29; const long long mod = 1e9 + 7; const long long INF = 1e9; inline long long getlen(long long x) { long long ret = 0; while (x) ret++, x /= 10; return ret; } long long has[20]; long long cnt2[20]; long long cnt[20]; string res; string ans; string check; string mini; int32_t main() { string v = 21111222211112222222222112 ; long long sz = (long long)v.size(); string s = get(); bool c = false; if ((long long)s.size() > sz && s.substr(0, sz) == v) { c = true; } string t = get(); if (s == 0 || s == 00 ) { cout << 0 << n ; return 0; } long long theln = 0; for (long long i = 1; i <= 1000000; i++) { long long ln = getlen(i); if (i + ln == s.size()) { theln = i; break; } } for (long long i = 0; i < s.size(); i++) { cnt[s[i] - 0 ]++; } while (theln) { cnt[theln % 10]--; theln /= 10; } for (long long i = 0; i < t.size(); i++) cnt[t[i] - 0 ]--; for (long long i = 0; i <= 10; i++) cnt2[i] = cnt[i]; for (long long i = 0; i <= 9; i++) { while (cnt2[i]) { cnt2[i]--, mini += char(i + 0 ); } } long long lim = -1; if (!cnt[0]) { for (long long i = 1; i <= 9; i++) { while (cnt[i]) { res += char( 1 + i - 1); cnt[i]--; } } } else { long long mrk = -1; for (long long i = 1; i <= 9; i++) { if (cnt[i]) { mrk = i; cnt[i]--; break; } } if (mrk != -1) res += char( 1 + mrk - 1); for (long long i = 0; i <= 9; i++) { while (cnt[i]) { res += char( 1 + i - 1); cnt[i]--; } } } if (res.size() >= 2 && res[1] == 0 ) { for (long long j = 1; j < res.size() && res[j] == 0 ; j++) lim = j; } if (!res.size()) { cout << t << n ; return 0; } for (long long i = 0; i < res.size(); i++) has[res[i] - 0 ]++; if (res[0] == 0 ) { cout << t << res << n ; return 0; } if (t[0] != 0 ) { ans = t + mini; } else { for (long long i = 0; i <= 1e6; i++) ans += 9 ; } long long yk = -1; if (t.size() > 1) for (long long i = 1; i < t.size(); i++) { if (yk == -1 && t[i] != t[0]) { yk = t[i] - 0 ; } } if (!has[t[0] - 0 ]) { bool fl = false; if (c) return cout << 2 << n , 0; for (long long i = lim + 1; i < s.size(); i++) { if (s[i] > t[0]) { lim = max(lim, i - 1); break; } } for (long long i = 0; i < res.size(); i++) { if (i > lim && (t[i] != 0 || i) && !fl) { check += t; fl = true; } check += res[i]; } if (!fl) check += t; } else if (yk == -1 || yk > (t[0] - 0 )) { bool fl = false; for (long long i = 0; i < res.size(); i++) { if (res[i] > t[0]) break; if (res[i] == t[0]) lim = i; } for (long long i = 0; i < res.size(); i++) { if (i > lim && !fl) { check += t; fl = true; } check += res[i]; } if (!fl) check += t; } else { if (c) return cout << 4 << n , 0; bool fl = false; for (long long i = lim + 1; i < res.size(); i++) { if (res[i] == t[0]) { lim = max(lim, i - 1); break; } } for (long long i = 0; i < res.size(); i++) { if (i > lim && !fl) { check += t; fl = true; } check += res[i]; } if (!fl) check += t; } ans = min(ans, check); cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { long long int n; cin >> n; long long int count = 2; while (n % ((1 << count) - 1) != 0) { count++; } cout << n / ((1 << count) - 1) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, string> mp; long long n; int main() { scanf( %I64d , &n); for (long long i = 2; i * i <= n; i++) { for (long long j = i * i, k = 2; j <= n; j *= i, k++) { string tmp = to_string(i) + ^ + to_string(k); if (!mp.count(j)) mp[j] = to_string(j); if (tmp.size() < mp[j].size()) mp[j] = tmp; } } string ans = to_string(n); for (auto x : mp) { string tmp = ; long long k = n / x.first, b = n % x.first; if (k > 1) tmp = (mp.count(k) ? mp[k] : to_string(k)) + * ; tmp += x.second; if (b) tmp += + + (mp.count(b) ? mp[b] : to_string(b)); if (tmp.size() < ans.size()) ans = tmp; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char ch[100010]; int flag[26]; int main() { while (~scanf( %s , ch)) { memset(flag, 0, sizeof(flag)); flag[0] = 1; flag[ H - A ] = 1; flag[ I - A ] = 1; flag[ M - A ] = 1; flag[ O - A ] = 1; flag[ T - A ] = 1; flag[ U - A ] = 1; flag[ V - A ] = 1; flag[ W - A ] = 1; flag[ X - A ] = 1; flag[ Y - A ] = 1; int len = strlen(ch); int flag1 = 0; for (int i = 0; i < len; i++) { if (!flag[ch[i] - A ]) { flag1 = 1; break; } } if (flag1) { printf( NO n ); } else { string str; str = ch; reverse(str.begin(), str.end()); for (int i = 0; i < len; i++) { if (str[i] != ch[i]) { flag1 = 1; break; } } if (flag1) { printf( NO n ); } else { printf( YES n ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; const mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 998244353; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector<int> a(n); for (int &i : a) cin >> i; map<int, int> pos; for (int i = 0; i < n; i++) pos[a[i]] = i; vector<int> b(k); for (int &i : b) cin >> i; long long ans = 1; set<int> sb(b.begin(), b.end()); for (int i : b) { int p = pos[i]; long long nxt = 0; if (p != 0) { int vl = a[p - 1]; if (sb.count(vl) == 0) nxt += ans; } if (p != n - 1) { int vr = a[p + 1]; if (sb.count(vr) == 0) nxt += ans; } sb.erase(i); if (nxt >= MOD) nxt -= MOD; ans = nxt; } cout << ans << n ; } exit(0); } |
#include <bits/stdc++.h> using namespace std; bool solve(int x) { if (x == 0) return true; if (x % 1000 == 144) { return solve(x / 1000); } else if (x % 100 == 14) { return solve(x / 100); } else if (x % 10 == 1) { return solve(x / 10); } return false; } int main() { int x; cin >> x; if (solve(x)) cout << YES n ; else cout << NO n ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n; cin >> n; map<double, int> mp2; map<string, double> mp1; vector<string> S; while (n--) { string x; cin >> x; S.push_back(x); int plus = 0, end = 0; double a, b, c; for (int i = 1; i < x.size(); i++) { if (x[i] == + ) plus = i; if (x[i] == ) ) end = i; } a = stod(x.substr(1, plus - 1)); b = stod(x.substr(plus + 1, end - plus - 1)); c = stod(x.substr(end + 2, x.size() - end + 2)); mp1[x] = (a + b) / c; mp2[(a + b) / c]++; } for (auto i : S) { cout << mp2[mp1[i]] << ; } return 0; } |
#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(false); std::cout.tie(nullptr); std::cin.tie(nullptr); std::cerr.tie(nullptr); int64_t n, k; std::cin >> n >> k; if (k == 1) std::cout << 1 n ; if (k == 2) { int64_t res = (n * (n - 1)) / 2 + 1; std::cout << res << n ; } if (k == 3) { int64_t res = (n * (n - 1) * (n - 2)) / 3 + (n * (n - 1)) / 2 + 1; std::cout << res << n ; } if (k == 4) { int64_t res = (n * (n - 1) * (n - 2)) / 3 + (n * (n - 1)) / 2 + 9 * (n * (n - 1) * (n - 2) * (n - 3)) / 24 + 1; std::cout << res << n ; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vll = vector<ll>; constexpr int MOD = 1e9 + 7; constexpr int INF = INT_MAX; constexpr ll LLINF = LLONG_MAX; template <class T> inline bool setmin(T &a, T b) { if (a > b) return a = b, 1; return 0; } template <class T> inline bool setmax(T &a, T b) { if (a < b) return a = b, 1; return 0; } namespace fastio { template <class T> istream &operator>>(istream &os, vector<T> &container) { for (auto &u : container) os >> u; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &container) { for (auto &u : container) os << u << ; return os; } template <class T1, class T2> inline istream &operator>>(istream &os, pair<T1, T2> &p) { return os >> p.first >> p.second; } template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << << p.second; } template <typename... args> void re(args &...tail) { ((cin >> tail), ...); } template <typename... args> void pr(args... tail) { ((cout << tail << ), ...); } template <typename... args> void prln(args... tail) { ((cout << tail << ), ...); cout << n ; } } // namespace fastio using namespace fastio; namespace debug { template <typename _T> inline void _debug(const char *s, _T x) { cerr << s << = << x << n ; } template <typename _T, typename... args> void _debug(const char *s, _T x, args... a) { while (*s != , ) cerr << *s++; cerr << = << x << , ; _debug(s + 1, a...); } } // namespace debug using namespace debug; const int N = 1e5 + 7; string s; int n, q; int nxt[N][26]; int dp[257][257][257]; string rel[3]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; re(n, q, s); for (int i = (0); i <= (25); i++) nxt[n][i] = nxt[n + 1][i] = n; for (int i = (n - 1); i >= (0); i--) { for (int j = (0); j <= (25); j++) { nxt[i][j] = (s[i] == a + j ? i : nxt[i + 1][j]); } } dp[0][0][0] = -1; for (int _ = (1); _ <= (q); _++) { char t; int x; re(t, x); x--; if (t == + ) { char l; re(l); rel[x] += l; int e0 = (int)(rel[0]).size(), e1 = (int)(rel[1]).size(), e2 = (int)(rel[2]).size(); int b0 = (x == 0 ? e0 : 0); int b1 = (x == 1 ? e1 : 0); int b2 = (x == 2 ? e2 : 0); for (int a = (b0); a <= (e0); a++) { for (int b = (b1); b <= (e1); b++) { for (int c = (b2); c <= (e2); c++) { auto &v = dp[a][b][c]; v = n; if (a) setmin(v, nxt[dp[a - 1][b][c] + 1][rel[0][a - 1] - a ]); if (b) setmin(v, nxt[dp[a][b - 1][c] + 1][rel[1][b - 1] - a ]); if (c) setmin(v, nxt[dp[a][b][c - 1] + 1][rel[2][c - 1] - a ]); } } } } else { rel[x].pop_back(); } prln(dp[(int)(rel[0]).size()][(int)(rel[1]).size()][(int)(rel[2]).size()] < n ? YES : NO ); } exit(0); } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << , ; __f(comma + 1, args...); } const int N = 1e3 + 10; vector<vector<int>> g; vector<int> par, height; int n; int bfs(int root) { int last = root; par[root] = -1; height[root] = 0; queue<int> q; q.push(root); while (!q.empty()) { int u = q.front(); q.pop(); last = u; for (auto v : g[u]) if (v != par[u]) { par[v] = u; height[v] = height[u] + 1; q.push(v); } } return last; } void dfs(int u, int par, int tar) { for (int v : g[u]) if (v != par) { if (v == tar) { g[u].erase(find(g[u].begin(), g[u].end(), v)); g[v].erase(find(g[v].begin(), g[v].end(), u)); } else dfs(v, u, tar); } } int main() { int i, j, k, n, m; cin >> n; g.resize(n); par.resize(n); height.resize(n); for (i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; u--, v--; g[u].push_back(v); g[v].push_back(u); } int x, y, q; x = bfs(0); y = bfs(x); cout << ? << x + 1 << << y + 1 << endl; cin >> q; q--; while (1) { dfs(x, -1, q); dfs(y, -1, q); if (g[q].size() == 0) { cout << ! << q + 1 << endl; return 0; }; x = bfs(q); y = bfs(x); cout << ? << x + 1 << << y + 1 << endl; cin >> q; q--; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 96; const int MAXN = 1e6 + 5; const int MAXK = 8e6 + 5; const int MOD = 1e9 + 7; const int MAX_ASCII_CODE = 26; const int MAX_NUMBER_OF_NODES = 1e5 + 5; int n, m; int arr[MAXN]; int rea[MAXK]; int foo(int v) { if (v == 0) return -2; if (rea[v] != -1) return rea[v]; if (rea[v] == -2) return -2; int ho = -2; for (int i = (int)0; i < (int)(22); i++) { if ((v & (1 << i)) > 0) { ho = max(foo((v ^ (1 << i))), ho); } } rea[v] = ho; return rea[v]; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(NULL); cout << fixed << setprecision(11); int t = 1; while (t--) { cin >> n; memset(rea, -1, sizeof(rea)); for (int i = (int)0; i < (int)(n); i++) { cin >> arr[i]; rea[arr[i]] = arr[i]; } int t; int no = (1 << 22) - 1; for (int i = (int)0; i < (int)(n); i++) { t = arr[i]; t = (no ^ arr[i]); cout << max(-1, foo(t)) << ; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int N = 100000 + 100; const int inf = 0x7fffffff; int n, a, b, c; int f[N]; int main() { scanf( %d%d%d%d , &n, &a, &b, &c); f[a] = 1; f[b] = 1; f[c] = 1; for (int i = min(a, min(b, c)); i <= n; i++) { if (f[i]) { f[i + a] = max(f[i + a], f[i] + 1); f[i + b] = max(f[i + b], f[i] + 1); f[i + c] = max(f[i + c], f[i] + 1); } } printf( %d n , f[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; /* find my code templates at https://github.com/galencolin/cp-templates also maybe subscribe please thanks */ #define send {ios_base::sync_with_stdio(false);} #define help {cin.tie(NULL);} #define f first #define s second #define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());} typedef long long ll; typedef long double lld; typedef unsigned long long ull; template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v); template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.f << , << p.s << ) ; } template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) { cout << [ ; for(int i = 0; i < v.size(); i++) {if (i) cout << , ; cout << v[i];} return cout << ] ; } template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count()); // mt19937_64 rng(61378913); /* usage - just do rng() */ void usaco(string filename) { // #pragma message( be careful, freopen may be wrong ) freopen((filename + .in ).c_str(), r , stdin); freopen((filename + .out ).c_str(), w , stdout); } // #include <atcoder/all> // using namespace atcoder; const lld pi = 3.14159265358979323846; // const ll mod = 1000000007; // const ll mod = 998244353; // ll mod; ll n, m, k, q, l, r, x, y, z; const ll template_array_size = 1e6 + 8432; ll a[template_array_size]; ll b[template_array_size]; ll c[template_array_size]; string s, t; ll ans = 0; pair<ll, ll> p[200005]; vector<pair<ll, ll>> cv; map<ll, ll> cnt; ll tot[5000005]; void solve(int tc = 0) { cin >> n; for (ll i = 0; i < n; i++) { cin >> a[i]; p[i] = {a[i], i}; ++cnt[a[i]]; } sort(p, p + n); ll targ = -1; for (pair<ll, ll> x: cnt) cv.push_back(x); for (ll i = 0; i < cv.size(); i++) { tot[2 * cv[i].f] += cv[i].s / 2; if (tot[2 * cv[i].f] > 1) { targ = 2 * cv[i].f; break; } for (ll j = i + 1; j < cv.size(); j++) { tot[cv[i].f + cv[j].f] += min(cv[i].s, cv[j].s); if (tot[cv[i].f + cv[j].f] > 1) { targ = cv[i].f + cv[j].f; break; } } if (targ != -1) break; } if (targ == -1) { cout << NO n ; } else { cout << YES n ; ll pt = n - 1; ll t = 0; for (ll i = 0; i < n; i++) { while (pt > i && p[i].f + p[pt].f > targ) --pt; if (pt > i && p[i].f + p[pt].f == targ) { cout << p[i].s + 1 << << p[pt].s + 1 << ; --pt; ++t; if (t == 2) exit(0); } } } } // two pointers? maybe // xor tricks (or general bitwise) // tutorial on my template int main() { #ifdef galen_colin_local auto begin = std::chrono::high_resolution_clock::now(); #endif send help #ifndef galen_colin_local // usaco( code ); #endif // usaco( cowland ); // freopen( tc.cpp , r , stdin); // freopen( tc2.cpp , w , stdout); cout << setprecision(15) << fixed; int tc = 1; // cin >> tc; for (int t = 0; t < tc; t++) solve(t); #ifdef galen_colin_local auto end = std::chrono::high_resolution_clock::now(); cerr << setprecision(4) << fixed; // cerr << Execution time: << std::chrono::duration_cast<std::chrono::duration<double>>(end - begin).count() << seconds << endl; #endif } |
#include <bits/stdc++.h> using namespace std; int m, n, a[2000100], b[2000100], d[2000100], ans = 1, pos[2000100]; int between(int x, int y, int z) { if (z < y) return x < z || x > y; return x > y && x < z; } int main() { memset(d, -1, sizeof(d)); cin >> m >> n; for (int i = 0; i < m; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) scanf( %d , &b[i]), d[b[i]] = i; int M = 0; for (int i = 0; i < m; i++) if (d[a[i]] >= 0) a[M] = a[i], pos[M++] = i; swap(m, M); if (!m) { puts( 0 ); return 0; } for (int i = 0; i < m; i++) a[m + i] = a[i], pos[m + i] = pos[i] + M; int x = 1, bor = 0; for (int i = 1; i <= m * 2 - 1; i++) if (pos[i] == pos[i - 1] + 1) { x++; while (x > 2 && !between(d[a[i]], d[a[i - 1]], d[a[bor]])) bor++, x--; ans = max(ans, x); } else x = 1, bor = i; cout << min(m, ans) << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, m, k, i, j; cin >> n >> m >> k; long long int a[n]; vector<pair<long long int, long long int> > v; for (i = 0; i < n; i++) { cin >> a[i]; v.push_back(make_pair(a[i], i)); } long long int y = m * k; long long int x = n - y; sort(v.begin(), v.end()); long long int mark[n]; memset(mark, 0, sizeof(mark)); i = n - 1; while (i >= 0 && y > 0) { mark[v[i].second] = 1; i--; y--; } i = 0; long long int z; long long int ans = 0; vector<long long int> p; while (i < n) { z = 0; j = i; while (z < m && j < n) { if (mark[j] == 1) { z++; ans = ans + a[j]; } j++; } p.push_back(j); if (p.size() == k) break; i = j; } cout << ans << endl; for (i = 0; i < p.size() - 1; i++) { cout << p[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 7; vector<pair<int, int> > G[MAXN]; int n; int sz[MAXN]; long long MAX, MIN; void dfs(int u, int fa) { sz[u] = 1; for (pair<int, int> edge : G[u]) { int v = edge.first; if (v == fa) continue; dfs(v, u); sz[u] += sz[v]; } for (pair<int, int> edge : G[u]) { int v = edge.first, w = edge.second; if (v == fa) continue; if (sz[v] & 1) MIN += w; MAX += 1ll * w * min(sz[v], (n - sz[v])); } } int main() { int T; scanf( %d , &T); while (T--) { int k; scanf( %d , &k); n = 2 * k; for (int i = 1, u, v, w; i < n; i++) { scanf( %d%d%d , &u, &v, &w); G[u].push_back({v, w}); G[v].push_back({u, w}); } MAX = MIN = 0; dfs(1, 0); printf( %lld %lld n , MIN, MAX); for (int i = 1; i <= n; i++) G[i].clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; int s[2], t[200007][2]; int x[200007]; int n, m, st[200007]; int absi(int x) { return x > 0 ? x : -x; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) scanf( %d , &x[i]); memset(s, 0, sizeof(s)); memset(t, 0, sizeof(t)); memset(st, 0, sizeof(st)); for (int i = 0; i < n; i++) ++s[x[i] > 0]; for (int i = 0; i < n; i++) t[absi(x[i])][x[i] > 0]++; int cnt = 0; for (int i = 1; i <= n; ++i) { int fake = 0; fake += t[i][1] + s[0] - t[i][0]; if (fake == m) { st[i] = 1; ++cnt; } } for (int i = 0; i < n; i++) { int ss = 0; if (x[i] > 0 && st[x[i]]) ss |= 1; if (x[i] > 0 && !st[x[i]]) ss |= 2; if (x[i] > 0 && cnt > 1) ss |= 2; if (x[i] < 0 && !st[-x[i]]) ss |= 1; if (x[i] < 0 && st[-x[i]]) ss |= 2; if (x[i] < 0 && cnt > 1) ss |= 1; if (ss == 1) cout << Truth n ; if (ss == 2) cout << Lie n ; if (ss == 3) cout << Not defined n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long getnum() { char c = getchar(); long long num, sign = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) sign = -1; for (num = 0; c >= 0 && c <= 9 ;) { c -= 0 ; num = num * 10 + c; c = getchar(); } return num * sign; } char S[200020]; char T[200020]; vector<pair<int, int> > V; int main() { int n = getnum(), k = getnum(); gets(T + 3); int rot = 3; for (rot = 3; rot <= n + 2; rot++) { if (T[rot] == T[rot + 1]) break; } for (int i = 3, j = rot; i <= n + 2; i++, j++) { if (j == n + 3) j = 3; S[i] = T[j]; } S[1] = S[n + 1]; S[2] = S[n + 2]; S[n + 3] = S[3]; S[n + 4] = S[4]; for (int i = 0; i <= n + 4;) { int x = i; while (S[i] == S[x] && i <= n + 4) i++; if (i - x > 1) V.push_back(make_pair(x, i - 1)); } if (V.size() == 0) { if (k % 2) { for (int i = 3; i <= n + 2; i++) S[i] = B + W - S[i]; } S[n + 3] = 0; printf( %s , S + 3); return 0; } for (int i = 0; i < V.size() - 1; i++) { int l = V[i].second; int r = V[i + 1].first; int t = min(k, (r - l) / 2); l++, r--; for (int tt = 1; tt <= t; l++, tt++) S[l] = S[V[i].second]; for (int tt = 1; tt <= t; r--, tt++) S[r] = S[V[i + 1].first]; for (; l <= r; l++) S[l] = B + W - S[l - 1]; } T[n + 3] = 0; for (int i = rot, j = 3; j <= n + 2; i++, j++) { if (i == n + 3) i = 3; T[i] = S[j]; } printf( %s , T + 3); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int cnt = 0; while (n > 0) { if (n >= 100) { n -= 100; cnt++; } else if (n >= 20) { n -= 20; cnt++; } else if (n >= 10) { n -= 10; cnt++; } else if (n >= 5) { n -= 5; cnt++; } else if (n >= 1) { n -= 1; cnt++; } } cout << cnt; } |
#include <bits/stdc++.h> using namespace std; int num[105]; int main() { int n; cin >> n; set<int> s; while (n--) { int a; cin >> a; s.insert(a); num[a]++; } if (s.size() == 2 && num[*s.begin()] == num[*s.rbegin()]) { cout << YES n ; cout << *s.begin() << << *s.rbegin() << endl; } else { cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, q, acum = 0, ultimo = 0, type, a, count; scanf( %d%d , &n, &q); vector<queue<int>> notificaciones_app(n); unordered_set<int> todas_notificaciones; while (q--) { scanf( %d%d , &type, &a); a--; switch (type) { case 1: acum++; todas_notificaciones.insert(acum); notificaciones_app[a].push(acum); break; case 2: while (!notificaciones_app[a].empty()) todas_notificaciones.erase(notificaciones_app[a].front()), notificaciones_app[a].pop(); break; case 3: a++; for (int i = ultimo; i <= a; i++) todas_notificaciones.erase(i); if (a > ultimo) ultimo = a; break; } printf( %d n , todas_notificaciones.size()); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int n, p; scanf( %d , &n); scanf( %d , &p); vector<pair<int, int> > ans; int edges = 2 * n + p; for (int i = int(1); i <= int(n); i++) { for (int j = int(i + 1); j <= int(n); j++) { if (edges) { ans.push_back(pair<int, int>(i, j)); edges--; } } } for (vector<pair<int, int> >::iterator it = (ans).begin(); it != (ans).end(); it++) printf( %d %d n , it->first, it->second); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); string a, b; cin >> a >> b; if (a.size() < b.size()) a = string(b.size() - a.size(), 0 ) + a; if (b.size() < a.size()) b = string(a.size() - b.size(), 0 ) + b; if (a == b) cout << = ; if (a < b) cout << < ; if (b < a) cout << > ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { int x, y, h; } a[100010]; bool cmp(point a, point b) { if (a.y != b.y) return a.y < b.y; return a.x < b.x; } int dp[100010]; int main() { int n; while (~scanf( %d , &n)) { for (int i = 0; i < n; i++) scanf( %d%d%d , &a[i].x, &a[i].y, &a[i].h); sort(a, a + n, cmp); stack<point> p; long long ans = 0; long long mx = 0; for (int i = n - 1; i >= 0; i--) { while (1) { if (p.empty()) break; point f = p.top(); if (f.y >= a[i].y && f.x < a[i].y) break; ans -= f.h; p.pop(); } p.push(a[i]); ans += a[i].h; mx = max(mx, ans); } printf( %I64d n , mx); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m[10][10] = {0}; for (int i = 1; i <= 3; i++) { for (int j = 1; j <= 3; j++) { cin >> m[i][j]; } } int s = 0; for (int i = 1; i <= 3; i++) { for (int j = 1; j <= 3; j++) { s = m[i][j]; s += m[i + 1][j]; s += m[i - 1][j]; s += m[i][j + 1]; s += m[i][j - 1]; s % 2 ? cout << 0 : cout << 1; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int n, m; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n / 2; i++) { for (int j = 1; j <= m; j++) { printf( %d %d n , i, j); printf( %d %d n , n - i + 1, m - j + 1); } } if (n & 1) { for (int i = 1; i <= m / 2; i++) { printf( %d %d n , n / 2 + 1, i); printf( %d %d n , n / 2 + 1, m - i + 1); } if (m & 1) printf( %d %d n , n / 2 + 1, m / 2 + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> edges; vector<int> large; bool ok = true; vector<pair<long long, long long>> dfs(int cur) { vector<pair<long long, long long>> child; for (int i : edges[cur]) { auto temp = dfs(i); child.insert(child.end(), temp.begin(), temp.end()); } sort(child.begin(), child.end()); vector<pair<long long, long long>> res; int add = 0; if (large[cur] > child.size()) { ok = false; } for (auto it : child) { if (res.size() == large[cur]) { res.push_back({res.size() + 1, cur}); } res.push_back({res.size() + 1, it.second}); } if (res.size() == child.size()) { res.push_back({res.size() + 1, cur}); } return res; } void solve() { int n; cin >> n; edges.clear(); edges.resize(n + 1); vector<pair<long long, long long>> in(n); for (auto& it : in) { cin >> it.first >> it.second; } int par = -1; large.clear(); large.resize(n + 1); for (int i = 0; i < n; i++) { if (in[i].first != 0) { edges[in[i].first].push_back(i + 1); } else { par = i + 1; } large[i + 1] = in[i].second; } auto res = dfs(par); if (!ok) { cout << NO << endl; return; } cout << YES << endl; for (auto it : res) { large[it.second] = it.first; } for (int i = 1; i <= n; i++) { cout << large[i] << ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = URDL ; const long long MOD2 = (long long)998244353 * (long long)998244353; long long ln, lk, lm; void etp(bool f = 0) { puts(f ? YES : NO ); exit(0); } void addmod(int& x, int y, int mod = 998244353) { assert(y >= 0); x += y; if (x >= mod) x -= mod; assert(x >= 0 && x < mod); } void et(int x = -1) { printf( %d n , x); exit(0); } long long fastPow(long long x, long long y, int mod = 998244353) { long long ans = 1; while (y > 0) { if (y & 1) ans = (x * ans) % mod; x = x * x % mod; y >>= 1; } return ans; } long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; } long long rL; int a[1035], b[1035]; long long ansl[1035], ansr[1035]; long long rd(int id, long long x) { printf( ? %d %lld n , id, x); fflush(stdout); scanf( %lld , &lk); return lk; } void cal(int l, int r, long long L, long long R) { if (l == r) { ansl[a[l]] = L; ansr[a[l]] = R; return; } int m1 = (l + r) / 2; long long X = rL / n * m1, m2; mt19937 ttrand((int)time(0)); for (int p = l, q = r;;) { int i = uniform_int_distribution<int>(p, q)(ttrand); long long lb = L, rb = R; while (lb < rb) { long long mb = (lb + rb) / 2; if (rd(a[i], mb) < X) lb = mb + 1; else rb = mb; } int l2 = p, r2 = q; vector<int> e; for (int j = p; j <= q; ++j) { long long y = rd(a[j], lb); if (y > X) b[l2++] = a[j]; else if (y < X) b[r2--] = a[j]; else e.push_back(a[j]); } for (int(j) = 0; (j) < (int)(e.size()); (j)++) b[l2 + j] = e[j]; for (int z = p; z <= q; z++) a[z] = b[z]; if (l2 <= m1 && m1 <= r2) { m2 = lb; break; } if (l2 < m1) p = l2 + 1; else q = l2 - 1; } cal(l, m1, L, m2); cal(m1 + 1, r, m2, R); } void fmain(int tid) { scanf( %d%lld , &n, &rL); for (int(i) = 1; (i) <= (int)(n); (i)++) a[i] = i; cal(1, n, 0, 1e18); puts( ! ); for (int(i) = 1; (i) <= (int)(n); (i)++) printf( %lld %lld n , ansl[i], ansr[i]); } int main() { int t = 1; for (int(i) = 1; (i) <= (int)(t); (i)++) { fmain(i); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, n; cin >> n >> a >> b; cout << min(n - a, b + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(const T &a) { return a * a; } template <class T> inline T middle(const T &a, const T &b) { return (a + b) / 2; } template <class T> inline int len(const T &c) { return static_cast<int>(c.size()); } const long double EPS = 1e-9; const long double PI = 2 * acos(0.0); const int N = 100; struct Item { long long r; char c; Item() {} Item(long long rr, char cc) : r(rr), c(cc) {} void Read() { scanf( %I64d-%c , &r, &c); } }; int ReadLine(int n, vector<Item> &s) { Item tmp; for (int i = 0; i < n; ++i) { tmp.Read(); if (!s.empty() && s.back().c == tmp.c) { s.back().r += tmp.r; } else { s.push_back(tmp); } } return len(s); } inline bool Check1(const vector<Item> &s, const Item &cur, int n, int j) { if (s[j].c != cur.c) { return false; } if (j == 0 || j == n - 1) { return s[j].r <= cur.r; } return s[j].r == cur.r; } int main() { int n, m; scanf( %d%d n , &n, &m); vector<Item> t, s; n = ReadLine(n, t); m = ReadLine(m, s); s.push_back(Item(0, # )); s.insert(s.end(), t.begin(), t.end()); long long ans = 0; vector<int> pi(len(s), 0); for (int i = 1; i < len(pi); ++i) { Item &cur = s[i]; int j = pi[i - 1]; while (j && !Check1(s, cur, m, j)) { j = pi[j - 1]; } if (Check1(s, cur, m, j)) { ++j; } if (j == m) { if (m > 1) { ++ans; } else { assert(cur.c == s[0].c); long long val = cur.r - s[0].r + 1; ans += val; } --j; if (j) { j = pi[j - 1]; } if (Check1(s, cur, m, j)) { ++j; } } pi[i] = j; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b, c, D, e; int cs[200020]; int all[200020], A[4], AA[4]; int i, x, y, z, tmp, tim, m; int main() { cin >> n; cin >> a >> b >> c; if (a > c) swap(a, c); if (a > b) swap(a, b); if (b > c) swap(b, c); A[1] = a; A[2] = b; A[3] = c; for (i = 1; i <= n; i++) { scanf( %d , &D); if (D > a + b + c) { cout << -1 << endl; return 0; } if (D > b + c) { tim++; continue; } m++; all[m] = D; } AA[1] = m; AA[2] = m; AA[3] = m; sort(all + 1, all + m + 1); for (i = m; i >= 1; i--) { if (all[i] && c < all[i]) { if (a + b >= all[i]) e = 3; else if (a + c >= all[i]) e = 2; else e = 1; AA[e] = min(AA[e], i - 1); while (AA[e] >= 0 && all[AA[e]] == 0 || all[AA[e]] > A[e]) AA[e]--; tim++; all[AA[e]] = 0; all[i] = 0; } } n = 0; for (i = 1; i <= m; i++) if (all[i]) { n++; cs[n] = all[i]; } if (n == 0) { cout << tim << endl; return 0; } int l = 1; int r = n - 1; int ress = n; while (l <= r) { m = (l + r) / 2; int k = n - m; if (a + b < cs[k]) { l = m + 1; continue; } int ja = 0; for (ja = 1; ja <= k; ja++) if (cs[ja] > a) break; ja--; int jb = 0; for (jb = 1; jb <= k; jb++) if (cs[jb] > b) break; jb--; while (jb - ja < ja) ja--; if (max(ja, jb - ja) + k - jb <= m) { ress = m; r = m - 1; } else l = m + 1; } cout << ress + tim << endl; } |
#include <bits/stdc++.h> template <class C, class E> inline bool contains(const C &container, const E &element) { return container.find(element) != container.end(); } template <class T> inline void checkmin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkmax(T &a, T b) { if (b > a) a = b; } using namespace std; map<int, bool> res; enum Type { XOR, AND, IN, NOT, OR }; struct Gate { Type _type; int _index; bool _bOriVal; int _c[2]; }; vector<Gate> gates; bool Eval(int index) { Gate &g = gates[index]; bool bRes; switch (g._type) { case OR: { bool b1 = Eval(g._c[0]); bool b2 = Eval(g._c[1]); bRes = b1 || b2; } break; case AND: { bool b1 = Eval(g._c[0]); bool b2 = Eval(g._c[1]); bRes = b1 && b2; } break; case NOT: bRes = !Eval(g._c[0]); break; case XOR: bRes = Eval(g._c[0]) != Eval(g._c[1]); break; case IN: bRes = g._bOriVal; break; } g._bOriVal = bRes; return bRes; } void Solve(int index, bool resObt[2]) { Gate &g = gates[index]; switch (g._type) { case OR: { for (int i = 0; i < 2; ++i) { int askedSubGate = g._c[i]; int otherSubGate = g._c[1 - i]; bool otherSubVal = gates[otherSubGate]._bOriVal; bool rr[2]; rr[false] = resObt[otherSubVal || false]; rr[true] = resObt[otherSubVal || true]; Solve(askedSubGate, rr); } break; } case AND: for (int i = 0; i < 2; ++i) { int askedSubGate = g._c[i]; int otherSubGate = g._c[1 - i]; bool otherSubVal = gates[otherSubGate]._bOriVal; bool rr[2]; rr[false] = resObt[otherSubVal && false]; rr[true] = resObt[otherSubVal && true]; Solve(askedSubGate, rr); } break; case NOT: { bool rr[2]; rr[0] = resObt[1]; rr[1] = resObt[0]; Solve(g._c[0], rr); break; } case XOR: { for (int i = 0; i < 2; ++i) { int askedSubGate = g._c[i]; int otherSubGate = g._c[1 - i]; bool otherSubVal = gates[otherSubGate]._bOriVal; bool rr[2]; rr[false] = resObt[otherSubVal != false]; rr[true] = resObt[otherSubVal != true]; Solve(askedSubGate, rr); } break; } case IN: { res[g._index] = resObt[!g._bOriVal]; break; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << std::setprecision(15); cout << std::fixed; int n; cin >> n; gates.resize(n + 1); for (int i = (1), _b = (n); i <= _b; i++) { string s; cin >> s; if (s == IN ) { gates[i]._type = IN; bool val; cin >> val; gates[i]._bOriVal = val; gates[i]._index = i; } else if (s == AND ) { gates[i]._type = AND; cin >> gates[i]._c[0] >> gates[i]._c[1]; } else if (s == OR ) { gates[i]._type = OR; cin >> gates[i]._c[0] >> gates[i]._c[1]; } else if (s == XOR ) { gates[i]._type = XOR; cin >> gates[i]._c[0] >> gates[i]._c[1]; } else if (s == NOT ) { gates[i]._type = NOT; cin >> gates[i]._c[0]; } } bool current = Eval(1); bool rr[2] = {false, true}; Solve(1, rr); for (auto &v : res) { cout << (v.second ? 1 : 0 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; LL g_l, g_r; LL gcd(LL a, LL b) { if (b == 0) return a; return gcd(b, a % b); } bool input() { cin >> g_l >> g_r; if (cin.eof()) return false; return true; } void solve() { for (LL i = g_l; i <= g_r; ++i) { for (LL j = i + 1; j <= g_r; ++j) { for (LL k = j + 1; k <= g_r; ++k) { if (gcd(i, k) != 1 && gcd(i, j) == 1 && gcd(j, k) == 1) { cout << i << << j << << k << endl; return; } } } } cout << -1 << endl; } int main() { while (input()) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 3) + (x << 1) + ch - 0 ; ch = getchar(); } return x * f; } long long n, m, a[N], op, x, y, z; struct SegmentTree { long long l, r, sum, maxn; } tree[N << 2]; void pushup(int k) { tree[k].sum = tree[k << 1].sum + tree[k << 1 | 1].sum; tree[k].maxn = max(tree[k << 1].maxn, tree[k << 1 | 1].maxn); } void build(int k, int l, int r) { tree[k].l = l, tree[k].r = r; if (l == r) { tree[k].sum = tree[k].maxn = a[l]; return; } int mid = (l + r) / 2; build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r); pushup(k); } void changemod(int k, int ql, int qr, long long mod) { if (tree[k].maxn < mod) return; if (ql <= tree[k].l && tree[k].r <= qr && tree[k].l == tree[k].r) { tree[k].sum %= mod, tree[k].maxn %= mod; return; } int mid = (tree[k].l + tree[k].r) / 2; if (ql <= mid) changemod(k << 1, ql, qr, mod); if (mid < qr) changemod(k << 1 | 1, ql, qr, mod); pushup(k); } void modify(int k, int q, long long v) { if (tree[k].l > q || q > tree[k].r) return; if (tree[k].l == tree[k].r) { tree[k].sum = tree[k].maxn = v; return; } int mid = (tree[k].l + tree[k].r) / 2; if (q <= mid) modify(k << 1, q, v); else modify(k << 1 | 1, q, v); pushup(k); } long long query(int k, int ql, int qr) { long long res = 0; if (ql <= tree[k].l && tree[k].r <= qr) return tree[k].sum; int mid = (tree[k].l + tree[k].r) / 2; if (ql <= mid) res += query(k << 1, ql, qr); if (mid < qr) res += query(k << 1 | 1, ql, qr); return res; } int main() { n = read(), m = read(); for (int i = 1; i <= n; i++) a[i] = read(); build(1, 1, n); while (m--) { op = read(); if (op == 1) { x = read(), y = read(); printf( %lld n , query(1, x, y)); } if (op == 2) { x = read(), y = read(), z = read(); changemod(1, x, y, z); } if (op == 3) { x = read(), y = read(); modify(1, x, y); } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct BipartiteMatcher { vector<vector<int>> g; vector<int> L, R; vector<bool> vis; BipartiteMatcher(int n, int m) : g(n), L(n, -1), R(m, -1), vis(n) {} void addEdge(int a, int b) { g[a].emplace_back(b); } bool match(int x) { if (vis[x]) return 0; vis[x] = 1; for (int v : g[x]) if (R[v] == -1) return R[L[x] = v] = x, 1; for (int v : g[x]) if (match(R[v])) return R[L[x] = v] = x, 1; return 0; } int solve() { int cnt = 1; while (cnt--) { fill(vis.begin(), vis.end(), 0); for (int i = 0; i < L.size(); ++i) { cnt |= L[i] == -1 and match(i); } } int res = 0; for (int i = 0; i < L.size(); ++i) res += L[i] != -1; return res; } }; int solve(int n, int m) { BipartiteMatcher BM(n * m, n * m); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { if ((i + j) % 2 == 1) continue; for (int k = max(i - 3, 0); k <= min(i + 3, n - 1); ++k) { for (int l = max(j - 3, 0); l <= min(j + 3, m - 1); ++l) { if ((k + l) % 2 == 0) continue; if (abs(i - k) + abs(j - l) == 3) { BM.addEdge(i * m + j, k * m + l); } } } } return 2 * BM.solve(); } int main() { int n, m; cin >> n >> m; if (n > m) swap(n, m); if (n <= 20 and m <= 20) cout << solve(n, m) << endl; else if (n == 1) cout << 2 * (m / 6 * 3 + max(m % 6 - 3, 0)) << endl; else cout << (n * 1ll * m) / 2 * 2 << endl; ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long x[60002]; long long v[60002]; double ans = 1e12; long long n; double ma(double a, double b) { if (a > b) return a; return b; } double calc(double xx, double& bd) { double time = -1; for (int i = 0; i < n; i++) { double d = abs(xx - x[i]); if (d / v[i] > time) { time = d / v[i]; bd = x[i]; } } return time; } void bs(double s, double e) { if (s < e - 0.0000001) { double mid = s + (e - s) / 2; double xx; double x1 = calc(mid, xx); if (ans > x1) { ans = x1; } if (xx > mid) bs(mid, e); else bs(s, mid); } } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; for (int i = 0; i < n; i++) cin >> v[i]; bs(1, 1000000000); cout << fixed << setprecision(10) << ans; return 0; } |
#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); int a[20005], b[20005]; for (int i = 0; i < n; i++) scanf( %d %d , &a[i], &b[i]); int num = 1; for (int i = 0; i < n; i++) { if (num < a[i]) { num = a[i]; } if (num <= b[i]) { printf( %d , num); num++; } else printf( 0 ); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long int INFL = 0x3f3f3f3f3f3f3f3fLL; const int MOD = 1e9 + 7; const int MAX = 1e5 + 5; int a[1001]; int __attribute__((optimize( -O3 ))) main() { cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = 1; for (int i = 0; i < n; i++) { int l = i, r = i; while (l > 0 and a[l] >= a[l - 1]) { l--; } while (r < n - 1 and a[r] >= a[r + 1]) { r++; } ans = max(ans, r - l + 1); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 522133279; const int MAXN = 100000; const int TOTN = 100 + 100; const long long MOD = 1000000007; bool _su[MAXN]; vector<int> su; vector<int> suc; int n, k; void shai() { memset((_su), true, sizeof(_su)); for (int i = (2); i < (MAXN); i++) { if (k <= 1) break; if (_su[i] && k % i == 0) { su.push_back(i); suc.push_back(0); while (k && k % i == 0) { k /= i; suc.back()++; } for (int j = 2; j * i < MAXN; j++) _su[j * i] = false; } } if (k != 1) { su.push_back(k); suc.push_back(1); } } vector<int> fen(int x) { vector<int> cnt; cnt.resize(su.size()); for (int i = (0); i < (su.size()); i++) { while (x && x % su[i] == 0) { x /= su[i]; cnt[i]++; } } return cnt; } vector<vector<int> > lis; bool divisible(vector<int> cnt) { bool ok = true; for (int i = (0); i < (cnt.size()); i++) { if (cnt[i] < suc[i]) { ok = false; break; } } return ok; } vector<int> getCnt(int l, int r) { if (l == 0) return lis[r]; vector<int> res; for (int i = (0); i < (lis[l].size()); i++) { res.push_back(lis[r][i] - lis[l - 1][i]); } return res; } int main() { ios::sync_with_stdio(false); cin >> n >> k; shai(); for (int i = (0); i < (n); i++) { int a; cin >> a; lis.push_back(fen(a)); } for (int i = (1); i < (n); i++) { for (int j = (0); j < (lis[i].size()); j++) { lis[i][j] += lis[i - 1][j]; } } int l = 0, r = 0; long long ans = 0; while (r < n) { while (r < n && !divisible(getCnt(l, r))) r++; if (r >= n) break; ans += n - r; l++; if (l > r) r = l; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int p[100000]; int h[100000]; int queries[100000][3]; vector<pair<int, int> > type3[100000]; vector<int> adj[100000]; int visited[100000]; vector<int> who; int top[100000]; int ok[100000]; vector<pair<int, int> > need[100000]; int which[100000]; int findSet(int x) { if (p[x] == x) return x; return p[x] = findSet(p[x]); } void mergeSet(int x, int y) { int r1 = findSet(x); int r2 = findSet(y); if (h[r1] > h[r2]) p[r2] = r1; else if (h[r2] > h[r1]) p[r1] = r2; else { p[r1] = r2; h[r2] += 1; } } bool sameSet(int x, int y) { return findSet(x) == findSet(y); } void dfs(int x) { visited[x] = 1; for (int i = 0; i < type3[x].size(); i++) if (visited[type3[x][i].first] == 1) ok[type3[x][i].second] = 1; for (int i = 0; i < adj[x].size(); i++) if (!visited[adj[x][i]]) dfs(adj[x][i]); visited[x] = 2; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { top[i] = 1; p[i] = i; } for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &queries[i][0], &a); if (queries[i][0] != 2) scanf( %d , &b); queries[i][1] = a - 1; queries[i][2] = b - 1; if (queries[i][0] == 1) { adj[b - 1].push_back(a - 1); top[a - 1] = 0; } if (queries[i][0] == 2) { who.push_back(a - 1); which[who.size() - 1] = i; } if (queries[i][0] == 3) { type3[who[b - 1]].push_back(make_pair(a - 1, i)); need[which[b - 1]].push_back(make_pair(a - 1, i)); } } for (int i = 0; i < n; i++) if (top[i]) dfs(i); for (int i = 0; i < m; i++) { if (queries[i][0] == 1) mergeSet(queries[i][1], queries[i][2]); if (queries[i][0] == 2) for (int j = 0; j < need[i].size(); j++) if (!sameSet(queries[i][1], need[i][j].first)) ok[need[i][j].second] = 0; if (queries[i][0] == 3) { if (ok[i]) printf( YES n ); else printf( NO n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int st[1000010]; int mod = 1000000007; vector<vector<int> > g; int dp[1000010][2]; int n, m, k; int a[1000010]; int main() { st[0] = 1; for (int i = (1); i < (1000010); ++i) { st[i] = st[i - 1] + st[i - 1]; if (st[i] >= mod) st[i] -= mod; } scanf( %d%d%d , &n, &m, &k); int max1 = -1; int min1 = 2000000000; int tot = 0; for (int i = (0); i < (m); ++i) { int v1, v2; scanf( %d%d , &v1, &v2); v1--; v2--; if (((v2 - v1) != 1) && (v2 - v1 != k + 1)) { cout << 0 << endl; return 0; } if (v2 - v1 == k + 1) { a[v1] = 1; max1 = v1; min1 = ((min1 < v1) ? (min1) : (v1)); tot++; } } if (max1 - min1 > k) { cout << 0 << endl; return 0; } for (int i = (1); i < (n); ++i) a[i] += a[i - 1]; int res = 1; for (int i = (0); i < (n); ++i) { int v = i + k + 1; if (v >= n) break; if (i + k + 1 <= max1) continue; if (i > min1) break; int last = min(i + k, n - k - 2); int sum = a[last] - a[i]; int c = a[i]; if (i) c -= a[i - 1]; if (c) res--; if (res < 0) res += mod; res += st[last - i - sum]; if (res >= mod) res -= mod; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, s; string c; cin >> n >> c; s = n; string r = ; while (n > 0) { if (n % 2 == 0) { string y = ; y += c[s - n]; y += r; r = y; } else { r += c[s - n]; } n--; } cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; int M, N, maxH[100009], d[100009]; void dfs(int nod) { if (nod >= (1 << N)) { maxH[nod] = 0; return; } int f1 = nod << 1, f2 = f1 | 1; dfs(f1), dfs(f2); maxH[nod] = max(maxH[f1] + d[f1], maxH[f2] + d[f2]); } int ans = 0; void solve(int nod) { if (nod >= (1 << N)) return; int f1 = nod << 1, f2 = f1 | 1; if (maxH[f1] + d[f1] < maxH[f2] + d[f2]) swap(f1, f2); solve(f1); ans += maxH[nod] - (maxH[f2] + d[f2]); solve(f2); } int main() { scanf( %d , &N), M = (1 << (N + 1)) - 1; for (int i = 2; i <= M; i++) scanf( %d , &d[i]); dfs(1); solve(1); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int L, f, b; int n; int pos[110]; map<int, int> lot; int findpos(int L) { map<int, int>::iterator cur, next; cur = lot.begin(), next = cur; next++; for (; next != lot.end(); cur++, next++) { int back = cur->first + cur->second, front = next->first; if (back + b + L + f <= front) return back + b; } return -1; } int main() { scanf( %d%d%d , &L, &b, &f); scanf( %d , &n); lot.clear(); lot.insert(make_pair(-b, 0)); lot.insert(make_pair(L + f, 0)); for (int i = 0; i < n; i++) { int a, b; scanf( %d%d , &a, &b); if (a == 1) { int pl = findpos(b); pos[i + 1] = pl; if (pl >= 0) lot.insert(make_pair(pl, b)); printf( %d n , pl); } else { if (pos[b] < 0) continue; lot.erase(pos[b]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1 << 28; const long long LINF = 1ll << 61; string B, N; long long b, pw[10], C; int main() { ios::sync_with_stdio(false); cin >> B >> N >> C; int it = N.size(); for (int i = N.size() - 1; i >= 0; i--) { N[i]--; if (N[i] < 0 ) N[i] = 9 ; else break; } b = 0; for (int i = 0; i < B.size(); i++) b = (b * 10 + B[i] - 0 ) % C; pw[0] = 1; for (int i = 1; i < 10; i++) pw[i] = pw[i - 1] * b % C; long long ans = 1; for (int i = 0; i < N.size(); i++) { ans = ans * ans % C; long long tmp = ans; ans = ans * ans % C; ans = ans * ans % C; ans = ans * tmp % C; ans = ans * pw[N[i] - 0 ] % C; } ans = ans * (b - 1 + C) % C; if (ans == 0) cout << C << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, cnt = 1; cin >> a >> b; int d = a; bool flag = true; while (d >= cnt) { if (flag) { a -= cnt; flag = false; d = b; } else { b -= cnt; flag = true; d = a; } ++cnt; } if (a < cnt && flag) cout << Vladik << n ; else cout << Valera << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { long long n; cin >> n; long long tripleIndx = n / 3; if (!(n % 3)) tripleIndx--; stack<long long> st; while (tripleIndx--) { st.push(tripleIndx % 4ll); tripleIndx /= 4; } long long curA = 1; long long curB = 2; long long curC = 3; long long a[4] = {0, 1, 2, 3}; long long b[4] = {0, 2, 3, 1}; long long c[4] = {0, 3, 1, 2}; while (!st.empty()) { long long mod = st.top(); st.pop(); curA *= 4; curA += a[mod]; curB *= 4; curB += b[mod]; curC *= 4; curC += c[mod]; } if (n % 3 == 1) { cout << curA << n ; } else if (n % 3 == 2) { cout << curB << n ; } else { cout << curC << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 110; int a[maxn]; int main() { int n; while (cin >> n) { int ans = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i]) ans++; } for (int i = 1; i <= n; i++) { if (a[i] == 1) { if (i == 1) continue; if (a[i - 1] && i >= 1) continue; if (i >= 2 && a[i - 2]) { ans++; continue; } } } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int a[1000005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n; cin >> n; for (long long(i) = (0); (i) < (n); (i)++) cin >> a[i]; int tmp = n + 1; int ans = 0; for (int i = n; i >= 1; --i) { if (i < tmp) ans++; tmp = min(tmp, i - a[i - 1]); } cout << ans << endl; return 0; } |
#include<bits/stdc++.h> using namespace std; int cumsum[200005]; int a[200005]; int main() { int t; scanf( %d ,&t); while(t--) { int n; scanf( %d ,&n); for(int i=0;i<n;i++) { scanf( %d ,&a[i]); } for(int i=0;i<n;i++) { cumsum[i] = 0; } for(int i=0;i<n;i++) { if(a[i] == 0) continue; cumsum[i+1]--; cumsum[max(0,i-a[i] + 1)]++; } for(int i=0;i<n;i++) { if(i != 0) cumsum[i]+=cumsum[i-1]; if(cumsum[i] == 0) { printf( 0 ); } else { printf( 1 ); } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; priority_queue<long long, vector<long long>, greater<long long> > q; int main() { long long n; while (cin >> n) { long long e = 0, o = 0; for (long long i = 1; i <= n; i++) { long long x; cin >> x; if (x % 2) o++; else e++; } long long xx = min(e, o); cout << xx + (o - xx) / 3 << endl; } } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int NCARDS = 8; const int NVALS = 5; const int NSTATE = 495; vector<vector<int> > states; map<vector<int>, int> mp; void genstates(vector<int> &v, int at, int rem) { if (at >= ((int)(v).size())) { if (rem == 0) { int id = ((int)(states).size()); states.push_back(v); mp[v] = id; } return; } for (v[at] = 0; v[at] <= rem; ++v[at]) genstates(v, at + 1, rem - v[at]); } int nxt[NSTATE][NVALS][NVALS]; vector<int> adj[NSTATE][NSTATE]; vector<int> radj[NSTATE][NSTATE]; int deg[NSTATE][NSTATE]; int dp[NSTATE][NSTATE]; int q[NSTATE * NSTATE], qhead, qtail; void precalc() { states.clear(); mp.clear(); vector<int> state(NVALS, 0); genstates(state, 0, NCARDS); for (int i = (0); i < (((int)(states).size())); ++i) for (int a = (0); a < (NVALS); ++a) for (int b = (0); b < (NVALS); ++b) { if (states[i][a] == 0) { nxt[i][a][b] = -1; continue; } vector<int> tmp = states[i]; tmp[a]--; tmp[b]++; assert(mp.count(tmp)); nxt[i][a][b] = mp[tmp]; } for (int i = (0); i < (((int)(states).size())); ++i) for (int j = (0); j < (((int)(states).size())); ++j) { for (int a = (0); a < (NVALS); ++a) for (int b = (0); b < (NVALS); ++b) if (a * b != 0 && states[i][a] != 0 && states[j][b] != 0) { int c = (a + b) % NVALS; int ni = j, nj = nxt[i][a][c]; assert(nj != -1); adj[i][j].push_back(ni * NSTATE + nj); } sort(adj[i][j].begin(), adj[i][j].end()); adj[i][j].erase(unique(adj[i][j].begin(), adj[i][j].end()), adj[i][j].end()); for (int k = (0); k < (((int)(adj[i][j]).size())); ++k) { int ii = adj[i][j][k] / NSTATE, jj = adj[i][j][k] % NSTATE; radj[ii][jj].push_back(i * NSTATE + j); } } int winid = ((int)(states).size()) - 1; for (int i = (0); i < (((int)(states).size())); ++i) for (int j = (0); j < (((int)(states).size())); ++j) dp[i][j] = 0, deg[i][j] = ((int)(adj[i][j]).size()); qhead = qtail = 0; for (int i = (0); i < (((int)(states).size())); ++i) dp[i][winid] = -1, q[qhead++] = i * NSTATE + winid; while (qtail < qhead) { int i = q[qtail] / NSTATE, j = q[qtail] % NSTATE; ++qtail; for (int k = (0); k < (((int)(radj[i][j]).size())); ++k) { int ii = radj[i][j][k] / NSTATE, jj = radj[i][j][k] % NSTATE; if (dp[ii][jj] != 0) continue; if (dp[i][j] == -1) { dp[ii][jj] = 1; q[qhead++] = ii * NSTATE + jj; continue; } if (--deg[ii][jj] == 0) { dp[ii][jj] = -1; q[qhead++] = ii * NSTATE + jj; continue; } } } } int fst; int a[NCARDS], b[NCARDS]; void run() { int nq; scanf( %d , &nq); for (int qi = (0); qi < (nq); ++qi) { scanf( %d , &fst); for (int i = (0); i < (NCARDS); ++i) scanf( %d , &a[i]); for (int i = (0); i < (NCARDS); ++i) scanf( %d , &b[i]); vector<int> acnt(NVALS, 0), bcnt(NVALS, 0); for (int i = (0); i < (NCARDS); ++i) acnt[a[i]]++, bcnt[b[i]]++; assert(mp.count(acnt) && mp.count(bcnt)); int aid = mp[acnt], bid = mp[bcnt]; int ans = fst == 0 ? dp[aid][bid] : -dp[bid][aid]; printf( %s n , ans > 0 ? Alice : ans < 0 ? Bob : Deal ); } } int main() { precalc(); run(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> S; vector<int> ack; int pop[1100100]; int kol[1100100]; int k[1234]; char c[1234]; const int INF = 1000000000; int parse(int a) { if (a == INF) return -INF; return a; } int main() { int n, m; scanf( %d , &n); for (int i = (0); i <= (int(n) - 1); ++i) { int s; scanf( %d , &s); S.push_back(s); } sort(S.begin(), S.end()); scanf( %d , &m); for (int i = (0); i <= (int(m) - 1); ++i) { ack.push_back(S.back()); S.pop_back(); } for (int i = (0); i <= (int(m) - 1); ++i) { scanf( %c%d , &c[i], &k[i]); } for (int q = m - 1; q >= 0; q--) { for (int i = (0); i <= (int(1 << m) - 1); ++i) pop[i] = kol[i]; int mn = 1; if (k[q] == 2) mn *= -1; for (int i = (0); i <= (int(1 << m) - 1); ++i) { kol[i] = -INF; for (int j = (0); j <= (int(m) - 1); ++j) if ((i & (1 << j)) != 0) { int x = ack[j]; if (c[q] == b ) x = 0; kol[i] = mn * max(mn * (pop[i ^ (1 << j)] + mn * x), parse(kol[i] * mn)); } } } printf( %d n , kol[(1 << m) - 1]); } |
#include <bits/stdc++.h> using namespace std; int main() { int ans = 0; int n, a = 0, b; cin >> n; for (int i = 0; i < n; i++) { cin >> b; a += b; } int m, c, d; cin >> m; for (int i = 0; i < m; i++) { cin >> c >> d; if (ans == 0) { if (a >= c && a <= d) ans = a; if (c > a) ans = c; } } if (ans != 0) cout << ans; else cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 20000; struct node { int flow; int ff[5]; int ru; } mat[maxn]; int n, m; int kk[500]; int now; int getup(int id) { int ret = -1; int k = id - m; while (k >= 1) { if (mat[k].flow != -1) { ret = k; break; } k -= m; } return ret; } int getright(int id) { int ret = -1; int k = id; while (k % m != 0) { k = k + 1; if (mat[k].flow != -1) { ret = k; break; } } return ret; } int getdown(int id) { int ret = -1; int k = id + m; while (k <= n * m) { if (mat[k].flow != -1) { ret = k; break; } k += m; } return ret; } int getleft(int id) { int ret = -1; int k = id; while (k % m != 1) { k--; if (mat[k].flow != -1) { ret = k; break; } } return ret; } int fl[maxn][5]; int ans; int cnt; int solve(int id) { int ret = 0; int k = id; int ne; int u, d, r, l; while (k != -1) { ret++; ne = mat[k].ff[mat[k].flow]; u = mat[k].ff[1]; d = mat[k].ff[3]; r = mat[k].ff[2]; l = mat[k].ff[4]; if (u != -1) { mat[u].ff[3] = d; } if (d != -1) { mat[d].ff[1] = u; } if (r != -1) { mat[r].ff[4] = l; } if (l != -1) { mat[l].ff[2] = r; } k = ne; } return ret; } int main() { kk[ U ] = 1; kk[ R ] = 2; kk[ D ] = 3; kk[ L ] = 4; kk[ . ] = -1; now = 0; cin >> n >> m; string s; for (int i = 1; i <= n; i++) { cin >> s; for (int j = 0; j < m; j++) { mat[++now].flow = kk[s[j]]; } } for (int i = 1; i <= now; i++) { if (mat[i].flow == -1) continue; if (n != 1) fl[i][1] = getup(i); if (m != 1) fl[i][2] = getright(i); if (n != 1) fl[i][3] = getdown(i); if (m != 1) fl[i][4] = getleft(i); if (m == 1) { fl[i][2] = fl[i][4] = -1; } if (n == 1) { fl[i][1] = fl[i][3] = -1; } } for (int i = 1; i <= now; i++) { int ne = fl[i][mat[i].flow]; if (ne != -1) { int nne = fl[ne][mat[ne].flow]; if (nne != i) ; mat[ne].ru = 1; } } ans = 0; for (int i = 1; i <= now; i++) { if (mat[i].flow == -1) continue; for (int i1 = 1; i1 <= now; i1++) { for (int j = 1; j <= 4; j++) { mat[i1].ff[j] = fl[i1][j]; } } int z = solve(i); if (z > ans) { ans = z; cnt = 1; } else if (z == ans) { cnt++; } } cout << ans << << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 100, MOD = 1e9 + 9, INF = 1e15, SQ = 370, LOG = 30; int n, m, x, y, x2, y2, z, t, now, l, r; int ans, dp[4][4 * N]; bool lazy[4 * N]; string s; void bld(int b, int e, int pos) { if (b == e - 1) { if (s[b] == 7 ) { dp[3][pos]++; } else { dp[2][pos]++; } dp[0][pos] = dp[1][pos] = 1; return; } int lch = pos << 1, rch = lch + 1, mid = e + b >> 1; bld(b, mid, lch); bld(mid, e, rch); dp[3][pos] = dp[3][lch] + dp[3][rch]; dp[2][pos] = dp[2][lch] + dp[2][rch]; dp[1][pos] = max(dp[3][lch] + dp[1][rch], dp[1][lch] + dp[2][rch]); dp[0][pos] = max(dp[2][lch] + dp[0][rch], dp[0][lch] + dp[3][rch]); } void shift(int pos, int lch, int rch) { lazy[lch] = !lazy[lch]; lazy[rch] = !lazy[rch]; lazy[pos] = false; swap(dp[0][lch], dp[1][lch]); swap(dp[2][lch], dp[3][lch]); swap(dp[0][rch], dp[1][rch]); swap(dp[2][rch], dp[3][rch]); } void upd(int b, int e, int pos) { if (b >= y || e <= x) return; if (x <= b && e <= y) { lazy[pos] = !lazy[pos]; swap(dp[0][pos], dp[1][pos]); swap(dp[2][pos], dp[3][pos]); return; } int lch = pos << 1, rch = lch + 1, mid = e + b >> 1; if (lazy[pos]) shift(pos, lch, rch); upd(b, mid, lch); upd(mid, e, rch); dp[3][pos] = dp[3][lch] + dp[3][rch]; dp[2][pos] = dp[2][lch] + dp[2][rch]; dp[1][pos] = max(dp[3][lch] + dp[1][rch], dp[1][lch] + dp[2][rch]); dp[0][pos] = max(dp[2][lch] + dp[0][rch], dp[0][lch] + dp[3][rch]); } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m >> s; bld(0, n, 1); while (m--) { cin >> s; if (s == count ) { cout << dp[0][1] << n ; } else { cin >> x >> y; x--; upd(0, n, 1); } } } |
#include <bits/stdc++.h> using namespace std; std::vector<std::string> alph; class IAlphabet { public: virtual int encode(char symbol) = 0; virtual char decode(int code) = 0; virtual int size() = 0; }; class alphabet_eng : public IAlphabet { public: virtual int encode(char symbol); virtual char decode(int code); virtual int size() { return 26; }; }; int alphabet_eng::encode(char symbol) { if ((symbol < 97) || (symbol >= 123)) return -1; else return (symbol - 97); } char alphabet_eng::decode(int code) { if ((code < 0) || (code >= 26)) return 0; else return (code + 97); } class VocabularyTrie { public: VocabularyTrie(IAlphabet& alphabet); VocabularyTrie(VocabularyTrie& parent); void Fill(); int GetSize(); bool m_end_of_word; IAlphabet& m_alphabet; int winner; int loser; std::vector<std::unique_ptr<VocabularyTrie>> m_children; VocabularyTrie* m_parent; }; std::set<std::pair<int, VocabularyTrie*>> proce; VocabularyTrie::VocabularyTrie(IAlphabet& alphabet) : m_end_of_word(false), m_children(alphabet.size()), m_parent(nullptr), m_alphabet(alphabet) { winner = 2; } VocabularyTrie::VocabularyTrie(VocabularyTrie& parent) : m_end_of_word(false), m_children(parent.GetSize()), m_parent(&parent), m_alphabet(parent.m_alphabet) {} int VocabularyTrie::GetSize() { return m_alphabet.size(); } void VocabularyTrie::Fill() { for (int i = 0; i < alph.size(); i++) { std::string word; word = alph[i]; VocabularyTrie* trie_ptr = this; for (int letter = 0; letter < word.length(); letter++) { int curr_letter_code = m_alphabet.encode(word[letter]); if (trie_ptr->m_children[curr_letter_code] == nullptr) { trie_ptr->m_children[curr_letter_code].reset( new VocabularyTrie(*trie_ptr)); } trie_ptr = trie_ptr->m_children[curr_letter_code].get(); } trie_ptr->m_end_of_word = true; proce.insert(std::make_pair(word.length(), trie_ptr)); } } int main() { int m, n, k; cin >> n >> k; for (int i = 0; i < n; i++) { std::string x; cin >> x; alph.push_back(x); } alphabet_eng alphabet; VocabularyTrie nn(alphabet); nn.Fill(); while (proce.size() >= 1) { auto h = proce.end(); h--; int x = h->first; VocabularyTrie* y = h->second; proce.erase(std::make_pair(x, y)); int winner = 2; int loser = 1; for (int i = 0; i < 26; i++) { if (y->m_children[i] != nullptr) loser = 2; } if (y == nullptr) continue; for (int i = 0; i < 26; i++) { if ((y->m_children[i] != nullptr) && (y->m_children[i]->winner == 2)) winner = 1; if ((y->m_children[i] != nullptr) && (y->m_children[i]->loser == 2)) loser = 1; } y->winner = winner; y->loser = loser; if (x > 0) proce.insert(std::make_pair(x - 1, y->m_parent)); } int whowins = 1; int u = nn.winner; int v = nn.loser; if (u == 2) whowins = 2; else { if (v == 1) whowins = 1; else whowins = 2 - (k % 2); } if (whowins == 2) cout << Second ; else cout << First ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:36777216 ) using namespace std; const int inf = 1 << 30; const long long Inf = 1LL << 62; const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1, 0}; const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1, 0}; const double eps = 1e-9; const double pi = 3.1415926535897932384626433832795; template <class T> inline bool eq(const T &a, const T &b) { return fabs(a - b) < eps; } template <class T> inline bool deg2(const T &n) { return (n & (n - 1)) == 0; } template <class T> inline void chmax(T &a, const T &b) { a = max(a, b); } inline int intRand(int l, int r) { return ((rand() << 16) | rand()) % (r - l + 1) + l; } inline long long llRand(long long l, long long r) { return (((1ll * rand()) << 48) | ((1ll * rand()) << 32) | (rand() << 16) | rand()) % (r - l + 1) + l; } int i, n, len, j; string s, pr; int main() { ios_base::sync_with_stdio(false); srand(time(NULL)); cin >> n; cin >> pr; len = (int)pr.size(); for (i = 1; i < n; i++) { cin >> s; for (j = 0; j < len; j++) if (s[j] != pr[j]) break; len = j; pr = s; } cout << len; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; using namespace std; int n; int main() { cin >> n; int k1 = 0; int x = n; while (x % 10 != 0) { x++; k1++; } int k2 = 0; while (n % 10 != 0) { n--; k2++; } if (k1 > k2) cout << n; else cout << x; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int p[20000000 / 5], cnt; bool flag[20000000]; void prepare() { flag[1] = 1; for (int i = 2; i <= m; i++) { if (!flag[i]) { p[cnt++] = i; } for (int j = 0; j < cnt && i * p[j] <= m; j++) { flag[i * p[j]] = 1; if (i % p[j] == 0) break; } } } int main() { cin >> n; if (n == 2) { puts( 1 1 ); return 0; } m = n * (n + 1) / 2; prepare(); for (int i = 1; i <= n; i++) if (!flag[i] && !flag[m - i]) { for (int j = 1; j <= n; j++) { printf( %d , j == i ? 1 : 2); } puts( ); return 0; } for (int i = 4; i <= n; i++) if (!flag[i] && !flag[m - 3 - i]) { for (int j = 1; j <= n; j++) printf( %d , j == 3 ? 2 : j == i ? 3 : 1); return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ww { long double x, y; } a[100010]; int i, j, k, n, m, xx, yy; long double LU[100010], RU[100010], LD[100010], RD[100010]; inline bool judge(long double len) { int i, j; j = 0; for (i = 1; i <= n; i++) { for (; a[j + 1].x + len < a[i].x; j++) ; if (max(LU[j], RU[i + 1]) - min(LD[j], RD[i + 1]) <= len) return 1; } return 0; } inline bool cc1(const ww &a, const ww &b) { return a.x < b.x; } int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d%d , &xx, &yy); a[i].x = yy - xx, a[i].y = xx + yy; } sort(a + 1, a + n + 1, cc1); LD[0] = RD[n + 1] = 1e10; LU[0] = RU[n + 1] = -1e10; for (i = 1; i <= n; i++) LD[i] = min(LD[i - 1], a[i].y), LU[i] = max(LU[i - 1], a[i].y); for (i = n; i; i--) RD[i] = min(RD[i + 1], a[i].y), RU[i] = max(RU[i + 1], a[i].y); long double l = 0, r = 1e10, mid; for (; l + 1e-7 < r;) { mid = (l + r) / 2; if (judge(mid)) r = mid; else l = mid; } double an = r; printf( %.10lf n , an / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; template <typename T> struct modular { constexpr modular() : val(0) {} constexpr modular(const modular<T>& _m) : val(_m.val) {} template <typename U> constexpr modular(const U& _r = U()) { val = -MOD <= _r && _r < MOD ? _r : _r % MOD; if (val < 0) { val += MOD; } } const T operator()() { return val; } template <typename U> explicit operator U() const { return static_cast<U>(val); } modular<T>& operator+=(const modular<T>& _m) { if ((val += _m.val) >= MOD) { val -= MOD; } return *this; } modular<T>& operator-=(const modular<T>& _m) { if ((val -= _m.val) < 0) { val += MOD; } return *this; } modular<T>& operator*=(const modular<T>& _m) { val = modular<T>(static_cast<int64_t>(val) * static_cast<int64_t>(_m.val)) .val; return *this; } modular<T>& operator/=(const modular<T>& _m) { T a = _m.val, b = MOD, u = 0, v = 1; while (a != 0) { T q = b / a; b -= q * a; swap(a, b); u -= q * v; swap(u, v); } return *this *= u; } modular<T>& operator=(const modular<T>& _m) { val = _m.val; return *this; } template <typename U> modular<T>& operator+=(const U& _r) { return *this += modular<T>(_r); } template <typename U> modular<T>& operator-=(const U& _r) { return *this -= modular<T>(_r); } template <typename U> modular<T>& operator*=(const U& _r) { return *this *= modular<T>(_r); } template <typename U> modular<T>& operator/=(const U& _r) { return *this /= modular<T>(_r); } template <typename U> modular<T>& operator=(const U& _r) { val = modular<T>(_r).val; return *this; } modular<T> operator-() { return modular<T>(-val); } template <typename U> friend bool operator==(const modular<U>&, const modular<U>&); friend std::istream& operator>>(std::istream& os, modular<T>& _m) { os >> _m.val; _m *= 1; return os; } friend std::ostream& operator<<(std::ostream& os, const modular<T>& _m) { return os << _m.val; } template <typename U> modular<T> exp(U e) { modular<T> res = 1; modular<T> b = val; if (e < 0) { b = 1 / b; e *= -1; } for (; e; e >>= 1) { if (e & 1) { res *= b; } b *= b; } return res; } private: T val; }; template <typename T> inline modular<T> operator+(const modular<T>& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) += _rhs; } template <typename T, typename U> inline modular<T> operator+(const modular<T>& _lhs, const U& _rhs) { return modular<T>(_lhs) += _rhs; } template <typename T, typename U> inline modular<T> operator+(const U& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) += _rhs; } template <typename T> inline modular<T> operator-(const modular<T>& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) -= _rhs; } template <typename T, typename U> inline modular<T> operator-(const modular<T>& _lhs, const U& _rhs) { return modular<T>(_lhs) -= _rhs; } template <typename T, typename U> inline modular<T> operator-(const U& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) -= _rhs; } template <typename T> inline modular<T> operator*(const modular<T>& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) *= _rhs; } template <typename T, typename U> inline modular<T> operator*(const modular<T>& _lhs, const U& _rhs) { return modular<T>(_lhs) *= _rhs; } template <typename T, typename U> inline modular<T> operator*(const U& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) *= _rhs; } template <typename T> inline modular<T> operator/(const modular<T>& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) /= _rhs; } template <typename T, typename U> inline modular<T> operator/(const modular<T>& _lhs, const U& _rhs) { return modular<T>(_lhs) /= _rhs; } template <typename T, typename U> inline modular<T> operator/(const U& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) /= _rhs; } template <typename T> inline bool operator==(const modular<T>& _lhs, const modular<T>& _rhs) { return _lhs.val == _rhs.val; } template <typename T, typename U> inline bool operator==(const modular<T>& _lhs, const U& _rhs) { return _lhs == modular<T>(_rhs); } template <typename T, typename U> inline bool operator==(const U& _lhs, const modular<T>& _rhs) { return modular<T>(_lhs) == _rhs; } template <typename T> inline bool operator!=(const modular<T>& _lhs, const modular<T>& _rhs) { return !(_lhs == _rhs); } template <typename T, typename U> inline bool operator!=(const modular<T>& _lhs, const U& _rhs) { return !(_lhs == _rhs); } template <typename T, typename U> inline bool operator!=(const U& _lhs, const modular<T>& _rhs) { return !(_lhs == _rhs); } const int N = 3003; modular<int> dp[N][N]; void solve() { memset(dp, 0, sizeof dp); int n, m; cin >> n >> m; vector<int> a(n); vector<int> w(n); for (auto& x : a) { cin >> x; } int H = 0, T = 0; for (int i = 0; i < n; i++) { int x; cin >> x; w[i] = x; if (a[i]) H += x; else T += x; } int tot = H + T; dp[0][0] = 1; for (int i = 0; i < m; i++) { for (int j = 0; j <= i; j++) { if (i - j <= T) { dp[i + 1][j] += dp[i][j] * (T - (i - j)) / (tot + j - (i - j)); dp[i + 1][j + 1] += dp[i][j] * (H + j) / (tot + j - (i - j)); } } } modular<int> ad = 0; modular<int> mi = 0; for (int j = 0; j <= m; j++) { ad += dp[m][j] * j; mi += dp[m][j] * (m - j); } vector<modular<int> > res(n); for (int i = 0; i < n; i++) { if (a[i]) { res[i] = w[i] + ad * w[i] / H; } else { res[i] = w[i] - mi * w[i] / T; } } for (auto& x : res) { cout << x << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); cout << endl; } |
#include <bits/stdc++.h> using namespace std; const long double epsilon = 1e-9; string minus1(const string& str) { string str1(str); for (int i = str.size() - 1; i >= 0; i--) { if (str1[i] != 0 ) { str1[i]--; break; } else str1[i] = 9 ; } return str1; } long long rem(const string& str, long long c) { long long temp = 0; for (int i = 0; i < str.size(); i++) { temp = (temp * 10LL + (long long)(str[i] - 0 )) % c; } return temp; } long long phi(long long c) { long long res = 1; for (long long i = 2; i * i <= c; i++) { if (c % i == 0) { c /= i; res *= (i - 1); while (c % i == 0) { c /= i; res *= i; } } } if (c > 1) res *= c - 1; return res; } long long rem2(const string& str, long long c) { long long temp = 0; long long t2; for (int i = 0; i < str.size(); i++) { t2 = (temp * 10LL + (long long)(str[i] - 0 )); temp = t2 % c + t2 / c; } return temp; } long long powe(long long a, long long p, long long c) { long long res = 1; long long mul = a; while (p > 0) { if (p & 1) { res = (res * mul) % c; } mul = (mul * mul) % c; p >>= 1; } return res; } long long bruteForce(string B, string N, long long c) { stringstream ss; ss << B << << N; long long b, n; ss >> b >> n; long long res = (b - 1) % c; for (int i = 1; i < n; i++) res = (res * b) % c; if (res == 0) res = c; return res; } long long nod(long long a, long long b) { if (a < b) swap(a, b); long long x; while (b) { x = a % b; a = b; b = x; } return a; } bool isPow(long long i, long long j) { if (j == 1) return false; while (i % j == 0) i /= j; return i == 1; } void fail() { long long nd; for (int i = 2; i < 10000; i++) { for (int j = 1; j < i; j++) { nd = nod(i, j); if (isPow(i, nd)) continue; if (powe(j, phi(i) + 1, i) != j) { cerr << Failed with: << i << << j << endl; return; } } } } int main() { string n, b; long long c; long long e; int o = 1; while (cin >> b >> n >> c) { long long a = rem(minus1(b), c); long long b2 = rem(b, c); n = minus1(n); long long mat[10]; for (int i = 0; i < 10; i++) mat[i] = 1LL; long long ge, ye; int idx; for (int i = n.size() - 1; i >= 0; i--) { idx = n[i] - 0 ; mat[idx] = (mat[idx] * b2) % c; ge = (b2 * b2) % c; ye = (ge * ge) % c; ye = (ye * ye) % c; b2 = (ye * ge) % c; } long long re = 1; for (int i = 0; i < 10; i++) { for (int j = 0; j < i; j++) re = (re * mat[i]) % c; } long long q = (a * re) % c; if (q == 0) q = c; cout << q << endl; o++; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b, sum; int main() { cin >> n; b = -1; sum = 0; for (int i = 0; i < n; i++) { cin >> a; if (a == 0 || (a == b && b != 3)) { sum++; b = 0; } else if (a == 3 && b == 1) b = 2; else if (a == 3 && b == 2) b = 1; else b = a; } cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &a, T b) { if (a < b) a = b; } template <class T> inline void umin(T &a, T b) { if (a > b) a = b; } template <class T> inline T abs(T a) { return a > 0 ? a : -a; } template <class T> inline T gcd(T a, T b) { return __gcd(a, b); } template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; } const int inf = 1e9 + 143; const long long longinf = 1e18 + 143; inline int read() { int x; scanf( %d , &x); return x; } const int N = 1e5 + 100; const int MAX = 1e4 + 100; int n; long long x[N]; int c[N]; set<pair<int, int> > reach; bool taken[N]; int sz = 0; long long a[N]; priority_queue<pair<long long, int> > q; long long dist[MAX]; bool used[MAX]; void rebuild() { sort(a, a + sz); sz = unique(a, a + sz) - a; int mod = a[0]; dist[0] = 0; used[0] = 0; for (int i = 1; i < mod; i++) { dist[i] = longinf; used[i] = 0; } q.push(make_pair(0ll, 0)); while (!q.empty()) { int u = q.top().second; long long len = -q.top().first; q.pop(); if (dist[u] < len) continue; for (int i = 1; i < sz; i++) { int v = (u + a[i]) % mod; long long c = a[i]; if (dist[v] > dist[u] + c) { dist[v] = dist[u] + c; q.push(make_pair(-dist[v], v)); } } } reach.clear(); for (int i = 0; i < n; i++) { if (taken[i]) continue; if (dist[x[i] % mod] <= x[i]) { reach.insert(make_pair(-c[i], i)); } } } int main() { long long h; cin >> h; n = read(); int m = read(); a[sz++] = read(); for (int i = 0; i < n; i++) { scanf( %I64d , x + i); --x[i]; c[i] = read(); } rebuild(); while (m--) { int op = read(); if (op == 1) { long long x; scanf( %I64d , &x); a[sz++] = x; rebuild(); } else if (op == 2) { int id = read() - 1; int y = read(); if (reach.find(make_pair(-c[id], id)) != reach.end()) { reach.erase(make_pair(-c[id], id)); c[id] -= y; reach.insert(make_pair(-c[id], id)); } else { c[id] -= y; } } else if (op == 3) { if (!reach.size()) { puts( 0 ); } else { printf( %d n , -reach.begin()->first); taken[reach.begin()->second] = true; reach.erase(reach.begin()); } } } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.