func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { int arr[101] = { 0, }; int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int t; scanf( %d , &t); for (int j = 0; j < t; j++) { int tmp; scanf( %d , &tmp); arr[tmp]++; } } for (int i = 1; i <= 100; i++) { if (arr[i] == n) printf( %d , i); } } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 200015; const int nil = 100005; int n; set<pair<int, int> > S; set<pair<int, int> > T; int w[Maxn]; vector<pair<int, int> > cand[Maxn]; pair<int, int> res[Maxn]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { int x, y; scanf( %d %d , &x, &y); S.insert(pair<int, int>(x, y)); } for (int i = 1; i <= n; i++) scanf( %d , &w[i]); for (set<pair<int, int> >::iterator it = S.begin(); it != S.end(); it++) { pair<int, int> p = *it; if (S.find(pair<int, int>(p.first + 1, p.second)) == S.end() && S.find(pair<int, int>(p.first, p.second + 1)) == S.end()) { cand[p.second - p.first + nil].push_back(p); T.insert(p); } } for (int i = n; i >= 1; i--) { int diag = w[i] + nil; if (cand[diag].empty()) { printf( NO n ); return 0; } pair<int, int> p = cand[diag].back(); cand[diag].pop_back(); res[i] = p; pair<int, int> u = pair<int, int>(p.first - 1, p.second); if (S.find(u) != S.end() && T.find(u) == T.end()) { cand[u.second - u.first + nil].push_back(u); T.insert(u); } u = pair<int, int>(p.first, p.second - 1); if (S.find(u) != S.end() && T.find(u) == T.end()) { cand[u.second - u.first + nil].push_back(u); T.insert(u); } } printf( YES n ); for (int i = 1; i <= n; i++) printf( %d %d n , res[i].first, res[i].second); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base ::sync_with_stdio(false); ; cin.tie(NULL); ; long long int t = 1; while (t--) { long long int n; cin >> n; pair<long long int, long long int> tree[n]; long long int i, j, k; map<pair<long long int, long long int>, long long int> mp; for (i = 0; i < n; i++) { cin >> j >> k; tree[i].first = j; tree[i].second = k; } list<long long int> l; for (i = 0; i < n; i++) { if (tree[i].first == 1) l.push_back(i); } vector<pair<long long int, long long int> > edges; while (!l.empty()) { long long int node = l.front(); l.pop_front(); if (tree[node].first == 0) continue; long long int xors = tree[node].second; tree[xors].first--; tree[xors].second ^= node; edges.push_back({node, xors}); if (tree[xors].first == 1) l.push_back(xors); } cout << edges.size() << endl; for (auto x : edges) cout << x.first << << x.second << endl; } } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-5; const int p = 131; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const int N = 1e6 + 10; long long Hash[N], fac[N]; char s[N], ss[N]; long long get(int l, int r) { return (Hash[r] - Hash[l - 1] * fac[r - l + 1] % mod + mod) % mod; } void run() { scanf( %s %s , s + 1, ss + 1); int len1 = strlen(s + 1); int len2 = strlen(ss + 1); fac[0] = 1; int n0 = 0, n1 = 0; for (int i = 1; i <= len1; i++) { n0 += (s[i] == 0 ); n1 += (s[i] == 1 ); } for (int i = 1; i <= len2; i++) { Hash[i] = (Hash[i - 1] * p % mod + ss[i] - a + 1) % mod; fac[i] = fac[i - 1] * p % mod; } int res = 0; for (int l0 = 1, l1; l0 < len2; l0++) { if (l0 * n0 >= len2) break; if ((len2 - l0 * n0) % n1) continue; l1 = (len2 - l0 * n0) / n1; long long hash0 = -1, hash1 = -1; int idx = 1; int flag = 1; for (int j = 1; j <= len1; j++) { if (s[j] == 1 ) { if (hash1 == -1) { hash1 = get(idx, idx + l1 - 1); } else if (hash1 != get(idx, idx + l1 - 1)) { flag = 0; break; } idx += l1; } else { if (hash0 == -1) { hash0 = get(idx, idx + l0 - 1); } else if (hash0 != get(idx, idx + l0 - 1)) { flag = 0; break; } idx += l0; } if (~hash0 && ~hash1 && hash0 == hash1) { flag = 0; break; } } if (flag) res++; } printf( %d n , res); } int main() { run(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char ch = getchar(); int fh = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) fh = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); x *= fh; } struct shj { int we, l, r, fh; } t[100010 * 6]; struct pte { int l0, r0, l1, r1; } g[100010]; struct teache { int l, r; } v[100010]; multiset<int> nl, nr; int T1, T2, m, n, x, y, b1[100010], b2[100010], num, nt, anx = -1, any = -1, no[100010]; bool ans = 1, v1[100010]; vector<int> e[100010]; bool c1(const shj &a, const shj &b) { if (a.we != b.we) return a.we < b.we; return a.fh > b.fh; } void dfs(int no, int bi) { b1[no] = bi; b2[no] = num; v1[no] = 0; for (unsigned i = 0; i < e[no].size(); i++) { if (v1[e[no][i]]) dfs(e[no][i], bi ^ 1); else if (b1[no] == b1[e[no][i]]) ans = 0; } } int main() { read(T1); read(T2); read(n); read(m); for (int i = 1; i <= n; i++) { read(v[i].l); read(v[i].r); } for (int i = 1; i <= m; i++) { read(x); read(y); e[x].push_back(y); e[y].push_back(x); } for (int i = 1; i <= n; i++) v1[i] = 1; for (int i = 1; i <= n; i++) if (v1[i]) { num++; dfs(i, 0); } if (!ans) { puts( IMPOSSIBLE ); return 0; } for (int i = 1; i <= num; i++) { g[i].l0 = g[i].l1 = 0; g[i].r0 = g[i].r1 = 1e9; } for (int i = 1; i <= n; i++) { if (b1[i] == 0) { g[b2[i]].l0 = max(g[b2[i]].l0, v[i].l); g[b2[i]].r0 = min(g[b2[i]].r0, v[i].r); } else { g[b2[i]].l1 = max(g[b2[i]].l1, v[i].l); g[b2[i]].r1 = min(g[b2[i]].r1, v[i].r); } } for (int i = 1; i <= num; i++) if (g[i].l0 > g[i].r0 || g[i].l1 > g[i].r1) { puts( IMPOSSIBLE ); return 0; } for (int i = 1; i <= num; i++) { pte no = g[i]; if (no.l0 > no.l1) { swap(no.l0, no.l1); swap(no.r0, no.r1); } t[++nt] = (shj){no.l0, no.l1, no.r1, 1}; t[++nt] = (shj){no.l1, no.l1, no.r1, -1}; if (no.r0 >= no.r1) { t[++nt] = (shj){no.l1, no.l0, no.r0, 1}; t[++nt] = (shj){no.r1 + 1, no.l0, no.r0, -1}; t[++nt] = (shj){no.r1 + 1, no.l1, no.r1, 1}; t[++nt] = (shj){no.r0 + 1, no.l1, no.r1, -1}; } else { t[++nt] = (shj){no.l1, no.l0, no.r1, 1}; t[++nt] = (shj){no.r0 + 1, no.l0, no.r1, -1}; t[++nt] = (shj){no.r0 + 1, no.l0, no.r0, 1}; t[++nt] = (shj){no.r1 + 1, no.l0, no.r0, -1}; } } sort(t + 1, t + nt + 1, c1); for (int l = 1, r = 0; l <= nt; l = r + 1) { while (t[r + 1].we == t[l].we && r + 1 <= nt) { r++; if (t[r].fh == 1) { nl.insert(t[r].l); nr.insert(t[r].r); } else { auto i = nl.find(t[r].l); nl.erase(i); auto j = nr.find(t[r].r); nr.erase(j); } } if (nl.size() == num) { auto i = nl.end(); i--; int al = (*i), ar = (*(nr.begin())), sl = t[l].we, sr = t[r + 1].we - 1; if (al + sl > T2 || ar + sr < T1 || al > ar || sl > sr) continue; if (al + sl >= T1) { anx = sl; any = al; } else { if (ar + sr <= T2) { anx = sr; any = ar; } else { if (al + sr > T2) { anx = T1 - al; any = al; } else { anx = sr; any = T2 - sr; } } } } } if (anx == -1 && any == -1) { puts( IMPOSSIBLE ); return 0; } puts( POSSIBLE ); printf( %d %d n , anx, any); for (int i = 1; i <= num; i++) if (anx <= g[i].r0 && anx >= g[i].l0 && any <= g[i].r1 && any >= g[i].l1) no[i] = 0; else no[i] = 1; for (int i = 1; i <= n; i++) if (no[b2[i]] == b1[i]) putchar( 1 ); else putchar( 2 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int vis[maxn], son[maxn], f[maxn], sum, root, ans[maxn]; vector<int> g[maxn]; void getroot(int x, int fa) { son[x] = 1; f[x] = 0; for (int i = 0; i < g[x].size(); i++) { int v = g[x][i]; if (v == fa || vis[v]) continue; getroot(v, x); son[x] += son[v]; f[x] = max(f[x], son[v]); } f[x] = max(f[x], sum - son[x]); if (f[x] < f[root]) root = x; } void work(int x, int fa, int dep) { ans[x] = dep; vis[x] = 1; for (int i = 0; i < g[x].size(); i++) { int v = g[x][i]; if (vis[v]) continue; sum = son[v], root = 0; getroot(v, x); work(root, x, dep + 1); } } int main(void) { int n; while (~scanf( %d , &n) && n) { for (int i = 1; i <= n; i++) g[i].clear(); int a, b; for (int i = 0; i < n - 1; i++) { scanf( %d %d , &a, &b); g[a].push_back(b); g[b].push_back(a); } f[0] = sum = n; getroot(1, 0); work(root, 0, 0); for (int i = 1; i <= n; i++) { printf( %c , ans[i] + A ); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using vi = vector<int>; struct ele { int value, jj, index; }; bool ordena(ele a, ele b) { return a.value < b.value; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int k, n; cin >> k; vector<ele> arr; for (int i = 0; i < k; i++) { int v[200010], sum = 0; cin >> n; for (int j = 0; j < n; j++) { cin >> v[j]; sum += v[j]; } for (int j = 0; j < n; j++) { ele myele; myele.value = sum - v[j]; myele.jj = j; myele.index = i; arr.push_back(myele); } } sort(arr.begin(), arr.end(), ordena); for (int i = 0; i < arr.size() - 1; i++) { if (arr[i].value == arr[i + 1].value && arr[i].index != arr[i + 1].index) { cout << YES << n ; cout << arr[i].index + 1 << << arr[i].jj + 1 << n ; cout << arr[i + 1].index + 1 << << arr[i + 1].jj + 1 << n ; return 0; } } cout << NO << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, c = 0, n, s = 0; cin >> n >> k; for (i = 1; i <= n; i++) { s += (5 * i); if (s + k <= 240) c++; } cout << c; return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { int n, a, b; cin >> n >> a >> b; string s; cin >> s; vector<int> dp(n + 1, INT_MAX); vector<vector<int> > lcp(n, vector<int>(n)); for (int i = n - 1; i >= 0; --i) { for (int j = n - 1; j >= 0; --j) { if (s[i] == s[j]) { if (i == n - 1 || j == n - 1) { lcp[i][j] = 1; } else { lcp[i][j] = 1 + lcp[i + 1][j + 1]; } } } } dp[0] = 0; for (int i = 0; i < n; ++i) { dp[i + 1] = min(dp[i + 1], dp[i] + a); for (int j = 0; j < i; ++j) { int k = min(lcp[i][j], i - j); dp[i + k] = min(dp[i + k], dp[i] + b); } } cout << dp[n]; } |
#include <bits/stdc++.h> using namespace std; bool vis[100001]; int pi[100001]; int level[100001]; list<int> adj[100001]; void dfs(int s) { vis[s] = 1; bool flag = 1; for (list<int>::iterator it = adj[s].begin(); it != adj[s].end(); ++it) if (!vis[*it]) { level[*it] = level[s] + 1; pi[*it] = s; dfs(*it); flag = 0; } if (flag) { int least = s; stack<int> stk; for (list<int>::iterator it = adj[s].begin(); it != adj[s].end(); ++it) if (level[least] > level[(*it)]) least = *it; while (s != least) { stk.push(s); s = pi[s]; } stk.push(s); cout << stk.size() << n ; while (!stk.empty()) { cout << stk.top() << ; stk.pop(); } exit(0); } } int main() { int n, m, k, i, l, r; cin >> n >> m >> k; for (i = 1; i <= m; ++i) { cin >> l >> r; adj[l].push_back(r); adj[r].push_back(l); } pi[1] = -1; dfs(1); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename tn> void read(tn &a) { tn x = 0, f = 1; char c = ; for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; a = x * f; } const int N = 101000; long long lim[8], lm[8]; int n; struct point { long long x, y, z; long long getval(int k) { return x * (k & 1 ? -1 : 1) + y * (k >> 1 & 1 ? -1 : 1) + z * (k >> 2 & 1 ? -1 : 1); } } p[N], ans; bool chk(int tag, long long *lim) { long long l[4] = {(-lim[7] + 1 - 3 * tag) >> 1, (-lim[6] + 1 - tag) >> 1, (-lim[5] + 1 - tag) >> 1, (-lim[3] + 1 - tag) >> 1}; long long r[4] = {(lim[0] - 3 * tag) >> 1, (lim[1] - tag) >> 1, (lim[2] - tag) >> 1, (lim[4] - tag) >> 1}; long long a = l[1], b = l[2], c = l[3]; for (int i = 0; i < 4; i++) if (r[i] < l[i]) return 0; if (a + b + c > r[0]) return 0; if (a + b + c < l[0]) { a = min(r[1], l[0] - b - c); b = min(r[2], l[0] - a - c); c = min(r[3], l[0] - a - b); } if (a + b + c < l[0]) return 0; ans = {b + c + tag, a + c + tag, a + b + tag}; return 1; } bool check(long long len) { memcpy(lm, lim, sizeof(lm)); for (int i = 0; i < 8; i++) lm[i] += len; if (chk(0, lm)) return 1; if (chk(1, lm)) return 1; return 0; } int main() { int T; read(T); while (T--) { read(n); for (int i = 1; i <= n; i++) read(p[i].x), read(p[i].y), read(p[i].z); memset(lim, 63, sizeof(lim)); for (int i = 1; i <= n; i++) for (int j = 0; j < 8; j++) lim[j] = min(lim[j], p[i].getval(j)); long long l = -1, r = 4e18l + 1; while (l + 1 < r) { long long mid = l + r >> 1; if (check(mid)) r = mid; else l = mid; } check(r); cout << ans.x << << ans.y << << ans.z << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; long long arr[maxn]; int vis[maxn]; int main() { int T; scanf( %d , &T); while (T--) { int n; if (n == 1) { printf( YES n ); continue; } scanf( %d , &n); n *= 4; for (int i = 1; i <= n; i++) { scanf( %lld , &arr[i]); } sort(arr + 1, arr + n + 1); long long aver; int mark = 1; for (int i = 1, j = n - 1; i <= j; i += 2, j -= 2) { if (arr[i] != arr[i + 1] || arr[j] != arr[j + 1]) { mark = 0; break; } if (i == 1) { aver = arr[i] * arr[j]; } else if (arr[i] * arr[j] != aver) { mark = 0; break; } } if (mark) { printf( YES n ); } else { printf( NO n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, cnt = 0, sum = 1; vector<int> v; cin >> n >> k; if (k == 1) { cout << n << endl; return 0; } for (int i = 2; i <= n / 2; i++) { while (n % i == 0 && cnt < k - 1) { cnt++; n /= i; v.push_back(i); } if (cnt == k - 1 && n > 1) { v.push_back(n); cnt++; break; } } if (cnt == k) { for (int i = 0; i < v.size(); i++) cout << v[i] << ; cout << endl; } else cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> const int N = 12; using namespace std; int n, x, y, a[N][N]; pair<pair<int, int>, pair<int, int> > b[N] = { {{0, 0}, {0, 0}}, {{1, 1}, {3, 3}}, {{1, 4}, {3, 6}}, {{1, 7}, {3, 9}}, {{4, 1}, {6, 3}}, {{4, 4}, {6, 6}}, {{4, 7}, {6, 9}}, {{7, 1}, {9, 3}}, {{7, 4}, {9, 6}}, {{7, 7}, {9, 9}}}; int main() { ios_base::sync_with_stdio(0); n = 9; for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) { char c; cin >> c; a[i][j] = (int)c; } cin >> x >> y; x %= 3; y %= 3; if (x == 0) x = 3; if (y == 0) y = 3; int flag = 0; for (int i = b[(x - 1) * 3 + y].first.first; i <= b[(x - 1) * 3 + y].second.first; ++i) for (int j = b[(x - 1) * 3 + y].first.second; j <= b[(x - 1) * 3 + y].second.second; ++j) if (a[i][j] == 46) flag = 1, a[i][j] = 33; if (flag == 0) { for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) if (a[i][j] == 46) a[i][j] = 33; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { cout << char(a[i][j]); if (j % 3 == 0 && j != n) cout << ; } cout << n ; if (i % 3 == 0) cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; long long dp[N][2]; struct segment { int l, r; }; auto cmp = [](segment& s1, segment& s2) { if (s1.r != s2.r) return s1.r < s2.r; else return s1.l > s2.l; }; void solve() { int n, m; cin >> n >> m; long long p[n + 2]; for (int i = 1; i <= n; i++) cin >> p[i]; p[0] = -1e10; p[n + 1] = 1e10; sort(p, p + n + 2); vector<segment> s; for (int i = 1; i <= m; i++) { int l, r; cin >> l >> r; if (lower_bound(p, p + n + 2, l) != upper_bound(p, p + n + 2, r)) continue; s.push_back((segment){l, r}); } sort(s.begin(), s.end(), cmp); for (int i = 1; i < s.size(); i++) { if (s[i - 1].l >= s[i].l || s[i - 1].r == s[i].r) s.erase(s.begin() + i), i--; } long long dp[n + 2][2]; for (int i = 1; i <= n + 1; i++) dp[i][0] = dp[i][1] = 1e15; dp[0][0] = dp[0][1] = 0; int now = 0; for (int i = 1; i < n + 2; i++) { vector<long long> l, r; l.push_back(p[i - 1]); while (now < s.size() && s[now].r < p[i]) { l.push_back(s[now].l); r.push_back(s[now].r); now++; } r.push_back(p[i]); for (int j = 0; j < l.size(); j++) { dp[i][0] = min(dp[i][0], dp[i - 1][0] + (l[j] - p[i - 1]) + 2 * (p[i] - r[j])); dp[i][1] = min(dp[i][1], dp[i - 1][0] + (l[j] - p[i - 1]) + (p[i] - r[j])); dp[i][0] = min(dp[i][0], dp[i - 1][1] + 2 * (l[j] - p[i - 1]) + 2 * (p[i] - r[j])); dp[i][1] = min(dp[i][1], dp[i - 1][1] + 2 * (l[j] - p[i - 1]) + (p[i] - r[j])); } } cout << min(dp[n + 1][0], dp[n + 1][1]) << endl; } int main() { int T; cin >> T; while (T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline long long int rand(long long int x, long long int y) { ++y; return (rng() % (y - x)) + x; } string to_string(char c) { string second(1, c); return second; } string to_string(bool b) { return (b ? true : false ); } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } void degug_out() { cerr << endl; } template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) { cerr << << to_string(H); degug_out(T...); } long long int n, fac[(300006)], dp[(300006)]; const long long int MOD = 998244353; vector<long long int> v[(300006)]; void fact() { fac[0] = fac[1] = 1; for (long long int i = 2; i <= n; ++i) { fac[i] = (i * fac[i - 1]) % MOD; } return; } void dfs(long long int x, long long int p) { long long int ans = 1; long long int child = 1; for (auto i : v[x]) if (i != p) { child++; dfs(i, x); ans *= dp[i]; ans %= MOD; } ans *= fac[child - 1]; ans %= MOD; if (x != 1) ans *= child; ans %= MOD; return void(dp[x] = ans); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; fact(); for (long long int i = 0; i < (long long int)n - 1; ++i) { long long int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } dfs(1, 1); cout << (dp[1] * n) % MOD; } |
#include <bits/stdc++.h> const int maxn = 2e5 + 10; int N; int A[maxn]; long long Q[maxn]; long long sum1[maxn]; long long sum2[maxn]; double X(int i) { return i; } double Y(int i) { return i * sum1[i] - sum2[i]; }; double slope(int i, int j) { return (Y(i) - Y(j)) / (X(i) - X(j)); } long long Calc(int i, int j) { return sum2[j] - sum2[i] - 1ll * i * (sum1[j] - sum1[i]); } int main() { scanf( %d , &N); for (register int i = 1; i <= N; i++) { scanf( %d , &A[i]); sum1[i] = sum1[i - 1] + A[i]; sum2[i] = sum2[i - 1] + 1ll * A[i] * i; } int tail = 0; long long Ans = 0; for (register int j = 1; j <= N; j++) { long long k = sum1[j]; int l = 0, r = tail; while (l < r) { int mid = l + r >> 1; if (slope(Q[mid], Q[mid + 1]) > k) l = mid + 1; else r = mid; } int i = Q[r]; Ans = std::max(Ans, Calc(i, j)); while (tail >= 1 && slope(Q[tail], Q[tail - 1]) < slope(Q[tail], j)) tail--; Q[++tail] = j; } printf( %I64d n , Ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, res; int check(int a, int b) { return a < b; } int main() { scanf( %d%d , &a, &b); if (a == b) { printf( infinity ); return 0; } res = 0; a -= b; if (a < 0) { printf( 0 ); return 0; } for (int i = 1; i * i <= a; i++) if (!(a % i)) { res += check(b, i); if (i * i != a) res += check(b, a / i); } printf( %d , res); } |
#include <bits/stdc++.h> using namespace std; int n, m, c, l, r, cp, cm; string s; int main() { cin >> n >> s; for (int i = 0; i < n; i++) { l = i - 1; r = i; cp = 1; cm = 1; while (l >= 0 && s[l] != L ) { cp += (s[l] == R ); l--; } while (r < n - 1 && s[r] != R ) { cm += (s[r] == L ); r++; } cout << max(cp, cm) << endl; } } |
#include <bits/stdc++.h> using namespace std; struct node; struct node { node* arr[26]; int val; node(); void insert(char ch[], int l, int pos); void win(); void lose(); }; node::node() { val = 0; for (int i = 0; i < 26; i++) arr[i] = 0; } void node::insert(char ch[], int l, int pos) { if (pos == l) return; else { int index = ch[pos] - a ; if (arr[index] == 0) { arr[index] = new node(); arr[index]->insert(ch, l, pos + 1); } else { arr[index]->insert(ch, l, pos + 1); } } } void node::win() { int ind = 0; for (int i = 0; i < 26; i++) { if (arr[i] != 0) { arr[i]->win(); ind = ind | arr[i]->val; } } val = !ind; } void node::lose() { int ind = 1; int leaf = 1; for (int i = 0; i < 26; i++) { if (arr[i] != 0) { leaf = 0; arr[i]->lose(); ind = ind & arr[i]->val; } } if (leaf) val = leaf; else val = !ind; } int main() { int n, k; scanf( %d %d , &n, &k); node* root = new node(); char ch[100000]; for (int i = 0; i < n; i++) { scanf( %s , ch); int l = strlen(ch); root->insert(ch, l, 0); } int ind = 0; for (int i = 0; i < 26; i++) { if (root->arr[i] != 0) { root->arr[i]->win(); ind = ind | root->arr[i]->val; } } int w = ind; ind = 0; for (int i = 0; i < 26; i++) { if (root->arr[i] != 0) { root->arr[i]->lose(); ind = ind | !root->arr[i]->val; } } int l = ind; if (w & l) { printf( First n ); } else if (w & !l) { if (k & 1) printf( First n ); else printf( Second n ); } else printf( Second n ); } |
#include <bits/stdc++.h> using namespace std; int main() { char a, b; cin >> a >> b; int n; cin >> n; n = n % 4; if (n == 0) { cout << undefined ; return 0; } int arr[] = {118, 60, 94, 62}; int arr2[] = {118, 62, 94, 60}; int i = 0; for (i = 0; i < 4; i++) { if (a == arr[i]) break; } char c = arr[i]; for (int j = 1; j <= n; j++) { i = (i + 1) % 4; c = arr[i]; } int k = 0; for (k = 0; k < 4; k++) { if (a == arr2[k]) break; } char d = arr[k]; for (int j = 1; j <= n; j++) { k = (k + 1) % 4; d = arr2[k]; } if (c == b && d == b) cout << undefined ; else if (c == b) cout << cw ; else cout << ccw ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; int sum = n; for (int i = n / 2; i >= 1; i--) { if (n % i == 0) { sum += i; n = i; } } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const long long INFL = 1e18 + 123; const double PI = atan2(0, -1); mt19937 tw(960172); long long rnd(long long x, long long y) { static uniform_int_distribution<long long> d; return d(tw) % (y - x + 1) + x; } int cross(int x1, int y1, int x2, int y2) { return x1 * y2 - y1 * x2; } bool inside(int x, int y, vector<pair<int, int> > poly) { int s1 = 0, s2 = 0; for (int i = 0; i < ((int)(poly).size()); ++i) { int next = (i + 1) % ((int)(poly).size()); int tmp = cross(poly[i].first - x, poly[i].second - y, poly[next].first - x, poly[next].second - y); s1 += tmp; s2 += abs(tmp); } return abs(s1) == s2; } void solve() { vector<pair<int, int> > poly[2]; for (int i = 0; i < 2; ++i) { for (int j = 0; j < 4; ++j) { int x, y; cin >> x >> y; poly[i].push_back({x, y}); } } for (int x = -150; x <= 150; ++x) { for (int y = -150; y <= 150; ++y) { if (inside(x, y, poly[0]) && inside(x, y, poly[1])) { cout << YES n ; return; } } } cout << NO n ; } int main() { cerr << fixed << setprecision(15); cout << fixed << setprecision(15); ios::sync_with_stdio(false); int tests = 1; for (int it = 1; it <= tests; ++it) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int n, i, k = 0; int main() { cin >> s; for (i = 0; i < s.size(); i++) { while (s[i] == s[i + 1] && s.size()) { s.erase(i, 2); i--; k++; } } if (k % 2 != 0) cout << YES << endl; else if (k % 2 == 0) cout << No << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 100; vector<int> ans; set<pair<int, int>> add[MAX], rem[MAX], cur; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; add[x].insert({y, i}); rem[y + 1].insert({y, i}); } for (int i = 1; i < MAX; i++) { for (auto p : rem[i]) { cur.erase(p); } for (auto p : add[i]) { cur.insert(p); } while (cur.size() > k) { set<pair<int, int>>::iterator it; it = prev(cur.end()); ans.push_back((*it).second); cur.erase(it); } } cout << ans.size() << endl; for (int x : ans) { cout << x << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; int t; cin >> t; while (t--) { int n; cin >> n; int a[n], b[n], min, count = 0; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); min = b[0]; for (int i = 0; i < n; i++) { if (a[i] % min == 0 || a[i] == b[i]) { count++; } else break; } if (count == n) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long n; cin >> n; long long ans = 0; for (long long i = 1; i < n; i++) { if (n % i == 0) { ans++; } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; vector<pair<int, int> > v; struct Node { Node *left, *right; int val; int lazy; Node() { left = right = NULL; val = 0; lazy = 0; } }; inline void refresh(Node*& root, int x, int y) { if (root->lazy != 0 && root->val != (y - x + 1)) { root->val = 1LL * (y - x + 1) * root->lazy; if (x == y) { root->lazy = 0; return; } if (root->left == NULL) { root->left = new Node(); } if (root->right == NULL) { root->right = new Node(); } root->left->lazy = root->lazy; root->right->lazy = root->lazy; root->lazy = 0; } } inline void update(Node*& root, int x, int y, int b, int e, int val) { refresh(root, x, y); if (x > e || y < b || (root->val == y - x + 1)) { return; } int mid = (x + y) / 2; if (x >= b && y <= e) { root->lazy = val; refresh(root, x, y); return; } if (root->left == NULL) { root->left = new Node(); } if (root->right == NULL) { root->right = new Node(); } update(root->left, x, mid, b, e, val); update(root->right, mid + 1, y, b, e, val); root->val = root->left->val + root->right->val; } int query(Node*& root, int x, int y, int b, int e) { if (root == NULL || x > e || y < b) { return 0; } refresh(root, x, y); if (x >= b && y <= e) { return root->val; } int mid = (x + y) / 2; int L = query(root->left, x, mid, b, e); int R = query(root->right, mid + 1, y, b, e); return L + R; } vector<pair<int, int> > Q[N]; int ans[N]; int main() { Node* root = new Node(); int n; scanf( %d , &n); ; for (int i = 0; i < n; i++) { int x, y; scanf( %d , &x); ; scanf( %d , &y); ; v.push_back(make_pair(x, y)); } int q; scanf( %d , &q); ; for (int i = 0; i < q; i++) { int x, y; scanf( %d%d , &x, &y); Q[x].push_back(make_pair(y, i)); } for (int i = v.size() - 1; i >= 0; i--) { update(root, 1, 1000000007, v[i].first, min(v[i].first + v[i].second - 1, 1000000007), 1); for (auto x : Q[i + 1]) { int a = i; int b = x.first; int len = v[b - 1].first - v[a].first; ans[x.second] = len - query(root, 1, 1000000007, v[a].first, v[b - 1].first - 1); } } int y; for (int i = 0; i < q; i++) { printf( %d n , ans[i]); } } |
/* Washief Hossain Mugdho 20 December 2020 Codeforces 691F */ #include <bits/stdc++.h> #define ull unsigned long long #define ll long long #define pb push_back #define mp make_pair #define fr first #define sc second #define fastio ios_base::sync_with_stdio(0) #define untie cin.tie(0) #define ms(a, b) memset(a, b, sizeof a) using namespace std; void run_tests() { string s; cin >> s; vector<int> bam(2 * s.size() + 1, 0); vector<int> dan(2 * s.size() + 1, 0); int pos = s.size(); for (auto c : s) { if (c == 0 ) dan[pos++]++; else bam[pos--]++; } pos = s.size(); while (bam[pos] + dan[pos]) { if (dan[pos] && (!bam[pos] || bam[pos + 1])) { dan[pos++]--; cout << 0; } else { bam[pos--]--; cout << 1; } } cout << endl; } int main() { fastio; untie; #ifdef LOCAL_OUTPUT freopen(LOCAL_OUTPUT, w , stdout); #endif #ifdef LOCAL_INPUT freopen(LOCAL_INPUT, r , stdin); #endif int tc; cin >> tc; while (tc--) run_tests(); } |
#include <bits/stdc++.h> using namespace std; long long cnt[19], val[19]; void init() { cnt[1] = 9, cnt[2] = 9, cnt[3] = 90; val[1] = 1, val[2] = 10, val[3] = 100; long long t = 100; for (int i = 4; i <= 19; i++) cnt[i] = t * 9, t *= 10, val[i] = val[i - 1] * 10; } long long cal(long long a) { long long bit = 0, tmp, p = a; while (p) { tmp = p; p /= 10; bit++; } long long ans = 0; for (int i = 1; i <= bit - 1; i++) { ans += cnt[i]; } if (bit > 2) ans += cnt[bit] / 9 * (tmp - 1); else ans += tmp - 1; long long maxn; long long minn = tmp; for (int i = 1; i < bit; i++) { minn *= 10; } minn += tmp; maxn = a; int mowei = a % 10; if (mowei >= tmp) maxn = maxn - mowei + tmp; else if (maxn - 10 >= tmp * val[bit]) maxn = maxn - 10 - mowei + tmp; else return ans; maxn = (maxn - tmp * val[bit]) / 10; return maxn + 1 + ans; } int main() { long long l, r; while (~scanf( %I64d%I64d , &l, &r)) { init(); long long a = cal(l), b = cal(r); if (l < 10) a = l; if (r < 10) b = r; long long ans = b - a; long long tmp1 = l % 10, tmp2; while (l) { tmp2 = l; l /= 10; } if (tmp1 == tmp2) ans++; printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void Display(vector<double> row) { for (int i = 0; i < row.size(); i++) cout << row[i] << ; cout << endl; } void Display(vector<vector<double> > matrix) { for (int i = 0; i < matrix.size(); i++) Display(matrix[i]); cout << endl; } vector<vector<double> > New(int n, int m, double x = 0.0) { return vector<vector<double> >(n, vector<double>(m, x)); } vector<vector<double> > Ident(int n) { vector<vector<double> > Res = New(n, n); for (int i = 0; i < n; i++) Res[i][i] = 1.0; return Res; } void Multy(vector<vector<double> >& C, vector<vector<double> > A, vector<vector<double> > B) { assert(A[0].size() == B.size()); assert(A.size() == C.size()); assert(B[0].size() == C[0].size()); for (int i = 0; i < C.size(); i++) for (int j = 0; j < C[0].size(); j++) C[i][j] = 0.0; for (int i = 0; i < C.size(); i++) for (int j = 0; j < C[0].size(); j++) for (int k = 0; k < A[0].size(); k++) C[i][j] += A[i][k] * B[k][j]; } const int N = 100100; const int M = 4 * N; const double Eps = 1e-6; int n; int a[N]; int b[N]; vector<vector<double> > Tree[M]; bool isZero(double x) { return abs(x) < Eps; } void Merge(int Node) { Multy(Tree[Node], Tree[(Node << 1)], Tree[(Node << 1 | 1)]); } void Build(int Node = 1, int L = 1, int R = n) { Tree[Node] = New(2, 2); if (L == R) { int i = L; Tree[Node][0][0] = 0.0; Tree[Node][0][1] = 1.0 * (a[i] - b[i]) / a[i]; Tree[Node][1][0] = 1.0; Tree[Node][1][1] = 1.0 * b[i] / a[i]; return; } Build((Node << 1), L, ((L + R) >> 1)); Build((Node << 1 | 1), ((L + R) >> 1) + 1, R); Merge(Node); } void Update(int i, int Node = 1, int L = 1, int R = n) { if (L == R) { Tree[Node][0][0] = 0.0; Tree[Node][0][1] = 1.0 * (a[i] - b[i]) / a[i]; Tree[Node][1][0] = 1.0; Tree[Node][1][1] = 1.0 * b[i] / a[i]; return; } if (i <= ((L + R) >> 1)) Update(i, (Node << 1), L, ((L + R) >> 1)); else Update(i, (Node << 1 | 1), ((L + R) >> 1) + 1, R); Merge(Node); } void Query(vector<vector<double> >& Res, int i, int j, int Node = 1, int L = 1, int R = n) { if (i <= L && R <= j) return Multy(Res, Res, Tree[Node]); if (j < L || R < i) return; Query(Res, i, j, (Node << 1), L, ((L + R) >> 1)); Query(Res, i, j, (Node << 1 | 1), ((L + R) >> 1) + 1, R); } int main() { int q; cin >> n >> q; for (int i = 1; i <= n; i++) scanf( %d%d , a + i, b + i); Build(); while (q--) { int T; scanf( %d , &T); if (T == 1) { int i, x, y; scanf( %d%d%d , &i, &x, &y); a[i] = x; b[i] = y; Update(i); } else { int L, R; scanf( %d%d , &L, &R); vector<vector<double> > Res = Ident(2); Query(Res, L, R); double Ans = 1.0 / Res[1][1]; if (Ans != Ans) Ans = 0.0; printf( %.10f n , Ans); } } } |
#include <bits/stdc++.h> using namespace std; inline int read() { int 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 * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, a[500050], R[500050]; int main() { n = read(); for (int i = 1; i <= n; i++) { a[i] = read(); if (i <= n - i + 1) R[i] = n - i + 1, R[n - i + 1] = i; } int cnt = 0; for (int i = 1; i <= n - i + 1; i++) { cnt++; if (cnt & 1) swap(a[i], a[R[i]]); } for (int i = 1; i <= n; i++) printf( %d , a[i]); } |
#include <bits/stdc++.h> using namespace std; string s; void rev() { for (int i = 0; i < s.size(); i++) if (s[i] == L ) s[i] = R ; else s[i] = L ; } vector<int> v; int k[2000011]; const int delta = 1000005; bool verify(int nr) { memset(k, 0, sizeof(k)); int now = 0; k[now + delta]++; for (int i = 0; i < v.size(); i++) { now = min(nr - 1, now + v[i]); k[now + delta]++; } if (k[now + delta] > 1) return false; return true; } int i, sum, mx, l, r, mid, ans; int main(void) { cin >> s; if (s[s.size() - 1] == R ) rev(); for (i = 0; i < s.size(); i++) { if (s[i] == R ) v.push_back(1); else v.push_back(-1); sum += v[i]; mx = max(mx, sum); } if (verify(mx + 2)) { cout << 1; return 0; } l = 1; r = mx; while (l <= r) { mid = (l + r) / 2; if (verify(mid) == true) { ans = mid; l = mid + 1; } else r = mid - 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 2; long long n, a[maxn], k, ans[maxn]; long long Check(long long m) { long long res = 0, l, r, mid; for (int i = 1; i <= n; i++) { l = 1; r = a[i]; while (l <= r) { mid = (l + r) / 2; if (a[i] - 3 * mid * (mid + 1) - 1 >= m) l = mid + 1; else r = mid - 1; } ans[i] = r; res += r; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; long long l = -4e18, r = 4e18, mid; while (l <= r) { mid = (l + r) / 2; if (Check(mid) >= k) l = mid + 1; else r = mid - 1; } long long sum = Check(l); for (int i = 1; i <= n; i++) if (sum < k && ans[i] < a[i] && a[i] - 3 * (ans[i] + 1) * (ans[i] + 2) - 1 == l - 1) { sum++; ans[i]++; } for (int i = 1; i <= n; i++) cout << ans[i] << ; } |
#include <bits/stdc++.h> using namespace std; int n, m; int k; bool debug = false; int f[100005]; int ff(int x) { while (x != f[x]) x = f[x]; return x; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) f[i] = i; int a, b; long long ans = 1; for (int i = 0; i < m; i++) { scanf( %d%d , &a, &b); int fa = ff(a), fb = ff(b); if (fa == fb) { ans = ans * 2 % 1000000009; } else { f[fa] = fb; } printf( %I64d n , ans - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int nn, n, b, q; vector<pair<int, int> > d; int main() { d.push_back(make_pair(0, 0)); scanf( %d%d%d , &n, &b, &q), nn = n; d.push_back(make_pair(b, n)); for (int i = 1; i <= q; i++) scanf( %d%d , &b, &n), d.push_back(make_pair(b, n)); sort(d.begin(), d.end()); for (int i = 1; i <= q; i++) if (d[i].second > d[i + 1].second || d[i + 1].second - d[i].second > d[i + 1].first - d[i].first) return printf( unfair n ), 0; for (int k = 0; k < 32; k++) { int res = 0; for (int i = 1; i <= q + 1; i++) { int cnt = 0; for (int j = d[i - 1].first + 1; j <= d[i].first; j++) cnt += bool((1 << (j % 5)) & k); res += min(cnt, d[i].second - d[i - 1].second); } if (res < nn / 5 * __builtin_popcount(k)) return printf( unfair n ), 0; } printf( fair n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 0; const int LOGN = 0; const int MOD = 1e9 + 7; const int INF = 1e9 + 10; long long N, Q; long long x; long long f(long long x) { if (x & 1) return (x + 1) >> 1; long long id = N - (x >> 1); while (!(id & 1)) id >>= 1; id >>= 1; return N - id; } void read() { cin >> N >> Q; while (Q--) { cin >> x; cout << f(x) << n ; } return; } int main() { ios_base::sync_with_stdio(false); read(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long GCD(long long a, long long b) { if (b) return GCD(b, a % b); return a; } bool u1[10]; bool u2[10]; int main() { long long n, m, v; vector<long long> a, b; ios_base::sync_with_stdio(0); cin >> n >> m; for (long long i = 0; i < n; i++) { cin >> v; a.push_back(v); u1[v] = true; } for (long long i = 0; i < m; i++) { cin >> v; b.push_back(v); u2[v] = true; } sort(a.begin(), a.end()); sort(b.begin(), b.end()); for (long long i = 1; i <= 9; i++) { if (u1[i] && u2[i]) { cout << i; return 0; } } if (a[0] < b[0]) { cout << a[0] << b[0]; } else cout << b[0] << a[0]; } |
#include <bits/stdc++.h> using namespace std; /*<DEBUG>*/ #define tem template <typename #define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i) #define _op debug& operator<< tem C > auto test(C *x) -> decltype(cerr << *x, 0LL); tem C > char test(...); tem C > struct itr{C begin, end; }; tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; } struct debug{ #ifdef _LOCAL ~debug(){ cerr << endl; } tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; } tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); } tem T, typename U > _op (pair<T, U> i){ return *this << < << i.first << , << i.second << > ; } tem T> _op (itr<T> i){ *this << { ; for(auto it = i.begin; it != i.end; it++){ *this << , + (it==i.begin?2:0) << *it; } return *this << } ; } #else tem T> _op (const T&) { return *this; } #endif }; string _ARR_(int* arr, int sz){ string ret = { + to_string(arr[0]); for(int i = 1; i < sz; i++) ret += , + to_string(arr[i]); ret += } ; return ret; } #define exp(...) [ << #__VA_ARGS__ << : << (__VA_ARGS__) << ] /*</DEBUG>*/ typedef long long ll; typedef unsigned long long ull; typedef unsigned int uint; typedef pair<int, int> pii; //mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); #define pb push_back #define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define TC int __TC__; cin >> __TC__; while(__TC__--) #define ar array const int INF = 1e9 + 7; int main(void) { FAST; vector<ll> mx; for(ll i = 1; i*i + (i+1)*(i+1) <= INF; ++i){ mx.pb(i*i + (i+1) * (i+1)); } TC{ int n; cin >> n; int pos = (lower_bound(mx.begin(), mx.end(), n) - mx.begin()); if(mx[pos] == n) ++pos; cout << pos << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { long long n, k; cin >> n >> k; vector<long long> occ(255); string s; cin >> s; long long streak = 0; char curr = s[0]; for (long long i = 0; i < n; i++) { if (s[i] == curr) { streak++; if (streak == k) { occ[curr]++; streak = 0; } } else { streak = 1; curr = s[i]; } } long long mx = 0; for (long long i = 0; i < 255; i++) { mx = max(occ[i], mx); } cout << mx << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int MOD = 1e9 + 7; template <typename Tp> void read(Tp &x) { x = 0; int op = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) op = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= op; } template <typename Tp> void CMax(Tp &x, Tp y) { if (y > x) x = y; } template <typename Tp> void CMin(Tp &x, Tp y) { if (y < x) x = y; } int n, m, a[N], mx; int f[N], res1, res2, ans; void norm(int &x) { while (x >= MOD) x -= MOD; while (x < 0) x += MOD; } int Inv(int x, int p = MOD - 2) { int ret = 1; while (p) { if (p & 1) ret = 1ll * ret * x % MOD; x = 1ll * x * x % MOD; p >>= 1; } return ret; } int main() { read(n); for (int i = (1); i <= (n); ++i) read(a[i]), m += a[i], CMax(mx, a[i]); ans = 1ll * m * (m - 1) % MOD; for (int i = (1); i <= (mx); ++i) { res1 += res2; norm(res1); int v = Inv(i - 1 - m + MOD); res2 += v; norm(res2); res1 += v; norm(res1); f[i] = 1ll * res1 * (m - 1) % MOD; norm(f[i]); } for (int i = (1); i <= (n); ++i) ans += f[a[i]], norm(ans); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 1 << 17; char buffer[SIZE]; int pointer = SIZE; char Advance() { if (pointer == SIZE) { fread(buffer, 1, SIZE, stdin); pointer = 0; } return buffer[pointer++]; } int Read() { int answer = 0; char ch = Advance(); while (!isdigit(ch)) ch = Advance(); while (isdigit(ch)) { answer = answer * 10 + ch - 0 ; ch = Advance(); } return answer; } const int MAXN = 100000; const int MAXQ = 200000; const int MAXNODES = 262144; struct Point { int x; int y; bool operator<(const Point &other) const { return x < other.x; } }; Point v[1 + MAXQ]; struct Query { Point a; Point b; int index; bool operator<(const Query &other) const { return b < other.b; }; }; Query query[1 + MAXQ]; bool ok[1 + MAXQ]; int tree[1 + MAXNODES], where, from, to, change; void Update(int node, int left, int right) { if (left == right) { tree[node] = change; return; } int middle = (left + right) / 2; if (where <= middle) Update(2 * node, left, middle); else Update(2 * node + 1, middle + 1, right); tree[node] = min(tree[2 * node], tree[2 * node + 1]); } int Query(int node, int left, int right) { if (from <= left && right <= to) return tree[node]; int answer = MAXN, middle = (left + right) / 2; if (from <= middle) answer = min(answer, Query(2 * node, left, middle)); if (middle + 1 <= to) answer = min(answer, Query(2 * node + 1, middle + 1, right)); return answer; } void Solve(int k, int q, int n, int m) { sort(v + 1, v + k + 1); sort(query + 1, query + q + 1); for (int i = 1, j = 1; i <= q; i++) { while (j <= k && v[j].x <= query[i].b.x) { where = v[j].y; change = v[j].x; Update(1, 1, m); j++; } from = query[i].a.y; to = query[i].b.y; if (Query(1, 1, m) >= query[i].a.x) ok[query[i].index] = true; } } int main() { int n = Read(), m = Read(), k = Read(), q = Read(); for (int i = 1; i <= k; i++) { v[i].x = Read(); v[i].y = Read(); } for (int i = 1; i <= q; i++) { query[i].a.x = Read(); query[i].a.y = Read(); query[i].b.x = Read(); query[i].b.y = Read(); query[i].index = i; } Solve(k, q, n, m); for (int i = 1; i <= k; i++) swap(v[i].x, v[i].y); memset(tree, 0, sizeof(tree)); for (int i = 1; i <= q; i++) { swap(query[i].a.x, query[i].a.y); swap(query[i].b.x, query[i].b.y); } Solve(k, q, m, n); for (int i = 1; i <= q; i++) if (ok[i]) printf( YES n ); else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); ; int cnt = 0; for (int i = 0; i < (n + 1); i++) for (int j = 0; j < (n + 1); j++) { if (i * i + j == n && i + j * j == m) cnt++; } printf( %d n , cnt); } |
#include <bits/stdc++.h> using namespace std; int N, ans = 0, overtake = 0, pspeed, plimit = 1000; stack<int> signs; int main() { cin >> N; for (int i = 0, a, b; i < N; i++) { cin >> a; if (a == 1) { cin >> b; pspeed = b; while (!signs.empty()) { if (signs.top() < b) { ans++; signs.pop(); } else { break; } } } else if (a == 2) { if (overtake > 0) { ans += overtake; overtake = 0; } } else if (a == 3) { cin >> b; signs.push(b); while (!signs.empty()) { if (signs.top() < pspeed) { ans++; signs.pop(); } else { break; } } } else if (a == 4) { overtake = 0; } else if (a == 5) { while (!signs.empty()) signs.pop(); } else { overtake++; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long N = 1e6 + 5; const long long inf = 1e18; long long powermod(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; cin >> t; loop: while (t--) { long long n; cin >> n; long long x = n / 4; if (n % 4 != 0) x++; n -= x; while (n--) { cout << 9; } while (x--) cout << 8; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int NMax = 2000010; char A[NMax]; int N, can[NMax], H[NMax], min1[NMax], min2[NMax], H1[NMax]; int main() { scanf( %s , A); N = strlen(A); int last = 0; for (int i = 0; i < N; i++) A[N + i] = A[i]; for (int i = 0; i < N; i++) { if (A[i] == ( ) H[i] = last + 1; else H[i] = last - 1; last = H[i]; } min1[0] = H[0]; for (int i = 1; i < N; i++) min1[i] = min(min1[i - 1], H[i]); min2[N - 1] = H[N - 1]; for (int i = N - 2; i >= 0; i--) min2[i] = min(min2[i + 1], H[i]); for (int i = 0; i < N; i++) if (A[i] == ( ) { int flag = 1; int delta = -1; if (A[i] == ( ) delta = 1; if (min2[i] - H[i] + delta < 0) flag = 0; if (i > 0 && min1[i - 1] + H[N - 1] - H[i] + delta < 0) flag = 0; if (H[N - 1] > 0) can[i] = flag; } for (int i = 0; i < N; i++) if (H[N - 1] == 0) can[i] = 1; last = 0; for (int i = N - 1; i >= 0; i--) { if (A[i] == ) ) H1[N - i - 1] = last + 1; else H1[N - i - 1] = last - 1; last = H1[N - i - 1]; } min1[0] = H1[0]; for (int i = 1; i < N; i++) min1[i] = min(min1[i - 1], H1[i]); min2[N - 1] = H1[N - 1]; for (int i = N - 2; i >= 0; i--) min2[i] = min(min2[i + 1], H1[i]); for (int i = 0; i < N; i++) if (A[N - i - 1] == ) ) { int flag = 1; int delta = -1; if (A[N - i - 1] == ) ) delta = 1; if (min2[i] - H1[i] + delta < 0) flag = 0; if (i > 0 && min1[i - 1] + H1[N - 1] - H1[i] + delta < 0) flag = 0; if (H[N - 1] < 0) can[(N - (i - 1 + N) % N - 1 + N) % N] = flag; } for (int i = 0; i < N; i++) can[i + N] = can[i]; int p1 = 0, p2 = 1, pos = -1; while (p1 < 2 * N && !can[p1]) p1 = p1 + 1; p2 = p1 + 1; while (p2 < 2 * N && !can[p2]) p2 = p2 + 1; while (p1 < N && p2 < N) { if (A[p2] > A[p1]) { p2 = p2 + 1; while (p2 < 2 * N && !can[p2]) p2 = p2 + 1; } else if (A[p2] < A[p1]) { p1 = p2; p2 = p2 + 1; while (p2 < 2 * N && !can[p2]) p2 = p2 + 1; } else { int k = 1; while (k < 2 * N && A[p1 + k] == A[p2 + k]) k++; if (A[p1 + k] > A[p2 + k]) { p1 = p1 + k + 1; while (p1 < 2 * N && !can[p1]) p1 = p1 + 1; } else { p2 = p2 + k + 1; while (p2 < 2 * N && !can[p2]) p2 = p2 + 1; } } if (p1 == p2) { p2 = p1 + 1; while (p2 < 2 * N && !can[p2]) p2 = p2 + 1; } else if (p1 > p2) swap(p1, p2); } pos = p2; if (p1 < p2) pos = p1; if (pos >= N) pos -= N; if (H[N - 1] > 0) { printf( %c , A[pos]); for (int i = (pos + 1) % N; i != pos; i = (i + 1) % N) printf( %c , A[i]); while (H[N - 1]--) printf( ) ); } else { while (H[N - 1]++) printf( ( ); printf( %c , A[pos]); for (int i = (pos + 1) % N; i != pos; i = (i + 1) % N) printf( %c , A[i]); } puts( ); getchar(); getchar(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; int sum = 0; int c; int ans = 0; int k = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> c; sum += c; k += c; if (k < 0) k = 0; ans = max(ans, k); } cout << -sum + ans * 2; } |
#include <bits/stdc++.h> template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar(); if (flag) x = -x; } using namespace std; const int inf = 987654321; int n, m, s, t; struct edge { int nxt, to, val; edge() {} edge(int jzp, int zzz, int lsr) { nxt = jzp, to = zzz, val = lsr; } } e[5001000]; int head[101000], ecnt = 1, hcur[101000]; inline void addedge(int from, int to, int val) { e[++ecnt] = edge(head[from], to, val); head[from] = ecnt; } inline void Addedge(int u, int v, int w) { addedge(u, v, w), addedge(v, u, 0); } int ls[101000], rs[101000], root_in, root_out, ttot; void build_out(int L, int R, int &cur) { cur = ++ttot; if (L == R) return Addedge(s, cur, 1), void(); int mid = (L + R) >> 1; build_out(L, mid, ls[cur]), build_out(mid + 1, R, rs[cur]); Addedge(ls[cur], cur, inf); Addedge(rs[cur], cur, inf); } void build_in(int L, int R, int &cur) { cur = ++ttot; if (L == R) return Addedge(cur, t, 1), void(); int mid = (L + R) >> 1; build_in(L, mid, ls[cur]), build_in(mid + 1, R, rs[cur]); Addedge(cur, ls[cur], inf), Addedge(cur, rs[cur], inf); } void Addedge_out(int L, int R, int l, int r, int p, int cur) { if (l <= L && R <= r) return Addedge(cur, p, inf), void(); int mid = (L + R) >> 1; if (l <= mid) Addedge_out(L, mid, l, r, p, ls[cur]); if (r > mid) Addedge_out(mid + 1, R, l, r, p, rs[cur]); } void Addedge_in(int L, int R, int l, int r, int p, int cur) { if (l <= L && R <= r) return Addedge(p, cur, inf), void(); int mid = (L + R) >> 1; if (l <= mid) Addedge_in(L, mid, l, r, p, ls[cur]); if (r > mid) Addedge_in(mid + 1, R, l, r, p, rs[cur]); } inline void Seg_Addedge(int l, int r, int d, int u) { if (l > r || d > u) return; ++ttot; Addedge_out(1, n, l, r, ttot, root_out); Addedge_in(1, n, d, u, ttot, root_in); } struct node { int x, l, r, t; node() {} node(int jzp, int zzz, int lsr, int chr) { x = jzp, l = zzz, r = lsr, t = chr; } } nd[101000]; int ntot; inline bool cmp(const node &a, const node &b) { return a.x < b.x || (a.x == b.x && a.t > b.t); } struct ODT { int l, r, v; ODT() {} ODT(int jzp, int zzz, int lsr) { l = jzp, r = zzz, v = lsr; } inline bool operator<(const ODT &a) const { return l < a.l; } }; set<ODT> st; inline set<ODT>::iterator Split(int p) { if (p > n) return st.end(); set<ODT>::iterator it = --st.upper_bound(ODT(p, 0, 0)); if (it->l == p) return it; if (it->r < p) return ++it; int l = it->l, r = it->r, v = it->v; st.erase(it); st.insert(ODT(l, p - 1, v)); return st.insert(ODT(p, r, v)).first; } inline void Assign(int l, int r, int x) { set<ODT>::iterator itr = Split(r + 1), itl = Split(l); for (set<ODT>::iterator it = itl; it != itr; ++it) { Seg_Addedge(it->v, x - 1, it->l, it->r); } st.erase(itl, itr); } inline void Insert(int l, int r, int v) { st.insert(ODT(l, r, v)); } int dep[101000], que[101000], front, rear; inline bool bfs() { memset(dep, 0x3f, sizeof(dep)); front = rear = 0; for (int i = 1; i <= ttot; ++i) hcur[i] = head[i]; dep[s] = 0; que[++rear] = s; while (front < rear) { int cur = que[++front]; for (int i = head[cur]; i; i = e[i].nxt) { int to = e[i].to; if (!e[i].val || dep[to] < 5001000) continue; que[++rear] = to; dep[to] = dep[cur] + 1; } } return dep[t] <= 5001000; } int dfs(int cur, int limi) { if (cur == t || !limi) return limi; int flow = 0; for (int i = hcur[cur]; i; i = e[i].nxt) { int to = e[i].to; hcur[cur] = i; if (dep[to] != dep[cur] + 1) continue; int tmp = dfs(to, min(e[i].val, limi)); if (!tmp) continue; e[i].val -= tmp; e[i ^ 1].val += tmp; flow += tmp; limi -= tmp; if (!limi) break; } return flow; } int main() { read(n); read(m); for (int i = 1; i <= m; ++i) { int x_1, y_1, x_2, y_2; read(x_1), read(y_1), read(x_2), read(y_2); nd[++ntot] = node(x_1, y_1, y_2, 0); nd[++ntot] = node(x_2 + 1, y_1, y_2, 1); } sort(nd + 1, nd + 1 + ntot, cmp); s = 1, t = 2; ttot = 2; build_out(1, n, root_out); build_in(1, n, root_in); Insert(1, n, 1); for (int i = 1; i <= ntot; ++i) { int x = nd[i].x, l = nd[i].l, r = nd[i].r, t = nd[i].t; if (t == 0) { Assign(l, r, x); } else { Insert(l, r, x); } } for (set<ODT>::iterator it = st.begin(); it != st.end(); ++it) { Seg_Addedge(it->v, n, it->l, it->r); } int mxflow = 0; while (bfs()) mxflow += dfs(s, inf); printf( %d n , mxflow); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 666; const double eps = 1e-10; int n, m, K, cnt, sz; int id[N], nod[N], cur[N]; double deg[N], g[N][N]; bool trap[N]; double v[N][N]; struct node { double vec[N]; } vv[N]; struct mat { double v[166][166]; mat() { memset(v, 0, sizeof(v)); } } ans; node operator*(node a, double w) { for (int i = 0; i <= n; i++) a.vec[i] *= w; return a; } node operator/(node a, double w) { for (int i = 0; i <= n; i++) a.vec[i] /= w; return a; } node operator+(node a, node b) { for (int i = 0; i <= n; i++) a.vec[i] += b.vec[i]; return a; } node operator-(node a, node b) { for (int i = 0; i <= n; i++) a.vec[i] -= b.vec[i]; return a; } mat operator*(mat a, mat b) { mat t; memset(t.v, 0, sizeof(t.v)); for (int i = 0; i <= sz; i++) { for (int j = 0; j <= sz; j++) { for (int k = 0; k <= sz; k++) { t.v[i][j] += a.v[i][k] * b.v[k][j]; } } } return t; } int main() { cin >> n >> m >> K; for (int i = 1; i <= n; i++) scanf( %d , &trap[i]); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); ++deg[x], ++deg[y], ++g[x][y], ++g[y][x]; } for (int i = 1; i <= n; i++) { if (trap[i]) { nod[++cnt] = i, id[i] = cnt; } } sz = cnt; for (int i = 1; i <= n; i++) { v[i][i] = -1; for (int j = 1; j <= n; j++) { if (trap[j]) { v[i][id[j] + n] += 1.0 * g[i][j] / deg[i]; } else { v[i][j] += 1.0 * g[i][j] / deg[i]; } } } for (int i = 1; i <= sz; i++) { vv[i + n].vec[i] = 1; v[i + n][i + n] = 1; } for (int i = 1; i <= n + sz; i++) { int me = -1; double mx = 0; for (int j = 1; j <= n + sz; j++) { if (abs(v[i][j]) > mx) { mx = abs(v[i][j]); me = j; } } if (me == -1 || abs(mx) < eps) continue; cur[i] = me; double val = v[i][me]; for (int j = 1; j <= n + sz; j++) v[i][j] /= val; vv[i] = vv[i] / val; for (int j = 1; j <= n + sz; j++) { if (j != i && abs(v[j][me]) > eps) { double val = v[j][me]; for (int k = 1; k <= n + sz; k++) v[j][k] -= v[i][k] * val; vv[j] = vv[j] - vv[i] * val; } } } for (int i = 1; i <= n + sz; i++) { if ((cur[i] <= n && trap[cur[i]]) || cur[i] == 1) { if (cur[i] == 1) { for (int j = 1; j <= sz; j++) ans.v[0][j] = vv[i].vec[j]; } else { for (int j = 1; j <= sz; j++) ans.v[id[cur[i]]][j] = vv[i].vec[j]; } } } mat res; memset(res.v, 0, sizeof(res.v)); for (int i = 0; i <= sz; i++) res.v[i][i] = 1; int nn = K - 1; for (; nn; nn >>= 1) { if (nn & 1) res = res * ans; ans = ans * ans; } printf( %.10lf n , res.v[0][id[n]]); return 0; } |
#include <bits/stdc++.h> using namespace std; namespace Input { const int BUF = 65536; char buf[BUF + 1]; char *head = buf, *tail = buf; inline char inputchar() { if (head == tail) *(tail = (head = buf) + fread(buf, 1, BUF, stdin)) = 0; return *head++; } inline void inputnum(int &ret) { char ch = inputchar(); while (ch < 0 || ch > 9 ) ch = inputchar(); for (ret = 0; ch >= 0 && ch <= 9 ; ch = inputchar()) ret = ret * 10 + ch - 0 ; } }; // namespace Input using Input::inputnum; const int MAXN = 100005; struct Node { long long sum; Node *c[2]; Node() {} Node(Node *a, Node *b) : sum(0) { c[0] = a, c[1] = b; } inline void modify(int v) { sum = v; } inline void update() { sum = (c[0] ? c[0]->sum : 0) + (c[1] ? c[1]->sum : 0); } } node[MAXN * 90], *root[MAXN]; int cnt = 0; inline Node *newnode() { node[cnt] = Node(0, 0); return &node[cnt++]; } void modify(Node *&p, int x, int L, int R, int v) { if (!p) p = newnode(); if (L == R) { p->modify(v); return; } int M = (L + R) >> 1; if (x <= M) modify(p->c[0], x, L, M, v); else modify(p->c[1], x, M + 1, R, v); p->update(); } long long query(Node *p, int qL, int qR, int L, int R) { if (!p) return 0; if (L >= qL && R <= qR) return p->sum; int M = (L + R) >> 1; long long ret = 0; if (qL <= M) ret += query(p->c[0], qL, qR, L, M); if (qR > M) ret += query(p->c[1], qL, qR, M + 1, R); return ret; } set<int> pos[MAXN]; int a[MAXN]; int n, m, id, p, y, l, r; inline void modify(int x, int y, int v) { for (int i = x; i <= n; i += (i & -i)) modify(root[i], y, 1, n, v); } inline long long query(int x, int R) { long long ret = 0; for (int i = x; i > 0; i ^= (i & -i)) ret += query(root[i], 1, R, 1, n); return ret; } void init() { memset(root, 0, sizeof(root)); for (int i = 1; i <= n; i++) { set<int> &cur = pos[a[i]]; cur.insert(i); set<int>::iterator pre = cur.find(i); if (pre != cur.begin()) { --pre; modify(*pre, i, i - *pre); } } } int main() { inputnum(n), inputnum(m); for (int i = 1; i <= n; i++) inputnum(a[i]); init(); for (int i = 1; i <= m; i++) { inputnum(id); if (id == 1) { inputnum(p), inputnum(y); int x = a[p]; a[p] = y; set<int> &sx = pos[x], &sy = pos[y]; set<int>::iterator pre, next; pre = next = sx.find(p); ++next; if (pre != sx.begin() && next != sx.end()) { --pre; modify(*pre, p, 0); modify(p, *next, 0); modify(*pre, *next, *next - *pre); } else if (pre != sx.begin()) { --pre; modify(*pre, p, 0); } else if (next != sx.end()) { modify(p, *next, 0); } sx.erase(p); sy.insert(p); pre = next = sy.find(p); ++next; if (pre != sy.begin() && next != sy.end()) { --pre; modify(*pre, *next, 0); modify(*pre, p, p - *pre); modify(p, *next, *next - p); } else if (pre != sy.begin()) { --pre; modify(*pre, p, p - *pre); } else if (next != sy.end()) { modify(p, *next, *next - p); } } else { inputnum(l), inputnum(r); printf( %I64d n , query(r, r) - query(l - 1, r)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; long long n, m, dau, cuoi, giua, pos1, pos2, t; bool kt; struct point { long long x, y; } p[N], ab, ac, z; long long ccw(point a, point b, point c) { ab = {b.x - a.x, b.y - a.y}; ac = {c.x - a.x, c.y - a.y}; return ab.x * ac.y - ab.y * ac.x; } long long dis(point a, point b) { return (b.x - a.x) * (b.x - a.x) + (b.y - a.y) * (b.y - a.y); } bool cmp1(point a, point b) { return (a.y < b.y || (a.y == b.y && a.x < b.x)); } bool cmp2(point b, point c) { t = ccw(p[1], b, c); return t > 0 || (t == 0 && dis(p[1], b) > dis(p[1], c)); } bool check(point z) { if (ccw(p[1], p[2], z) <= 0) return 0; if (ccw(p[n], p[1], z) <= 0) return 0; pos1 = pos2 = 0; dau = 2; cuoi = n; while (dau <= cuoi) { giua = (dau + cuoi) / 2; if (ccw(p[1], p[giua], z) >= 0) pos1 = giua, dau = giua + 1; else cuoi = giua - 1; } if (pos1 == 0) return 0; dau = 2; cuoi = n; while (dau <= cuoi) { giua = (dau + cuoi) / 2; if (ccw(p[1], p[giua], z) <= 0) pos2 = giua, cuoi = giua - 1; else dau = giua + 1; } if (pos2 == 0) return 0; if (pos1 == pos2) { if (dis(p[1], p[pos1]) <= dis(p[1], z)) return 0; else return 1; } if (ccw(p[pos1], p[pos2], z) <= 0) return 0; return 1; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> p[i].x >> p[i].y; } sort(p + 1, p + 1 + n, cmp1); sort(p + 2, p + 1 + n, cmp2); cin >> m; kt = 1; for (int i = 1; i <= m; i++) { cin >> z.x >> z.y; if (kt == 1) if (check(z) == 0) { kt = 0; } } if (kt == 1) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long power(long long base, long long exp); void solve() { long long n, m, k; cin >> n >> m >> k; vector<vector<long long>> arr(n, vector<long long>(m, 0)); long long count[3][5001]; memset(count, 0, sizeof(count)); list<pair<long long, long long>> key; for (long long i = 0; i < k; i++) { long long a, b, c; cin >> a >> b >> c; key.push_front({a, b}); count[a][b] = c; } set<pair<long long, long long>> s; for (auto k : key) { long long x = k.first; if (s.count(k)) continue; else s.insert(k); if (x == 2) { for (long long i = 0; i < n; i++) { if (arr[i][k.second - 1] == 0) { arr[i][k.second - 1] = count[k.first][k.second]; } } } else { for (long long i = 0; i < m; i++) { if (arr[k.second - 1][i] == 0) { arr[k.second - 1][i] = count[k.first][k.second]; } } } } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { cout << arr[i][j] << ; } cout << n ; } } int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); srand(chrono::high_resolution_clock::now().time_since_epoch().count()); long long t = 1; while (t--) { solve(); } return 0; } long long power(long long base, long long exp) { base %= 1000000007; long long result = 1; while (exp > 0) { if (exp & 1) result = ((long long)result * base) % 1000000007; base = ((long long)base * base) % 1000000007; exp >>= 1; } return result; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; getline(cin, s); for (auto i = s.end() - 1; i >= s.begin(); i--) { if ((int(*i) >= 65 && (int(*i) <= 90)) || (int(*i) >= 97 && (int(*i) <= 122))) { if (*i == A || *i == E || *i == I || *i == O || *i == U || *i == a || *i == e || *i == i || *i == o || *i == u || *i == y || *i == Y ) cout << YES ; else cout << NO ; return 0; } } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 110; int N; struct notlaptop { int speed, ram, hdd, cost; notlaptop(int a, int b, int c, int d) { speed = a; ram = b; hdd = c; cost = d; } notlaptop()<% %> }; notlaptop ar[MAXN]; int main() { scanf( %d , &N); for (int i = 0; i < N; i++) { int a, b, c, d; cin >> a >> b >> c >> d; ar[i] = notlaptop(a, b, c, d); } int bcost = 1e9, res = -1; for (int i = 0; i < N; i++) { bool outdated = false; for (int j = 0; j < N; j++) { if (ar[i].speed < ar[j].speed and ar[i].ram < ar[j].ram and ar[i].hdd < ar[j].hdd) { outdated = true; break; } } if (!outdated) { if (ar[i].cost < bcost) { bcost = ar[i].cost, res = i + 1; } } } cout << res << n ; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char now[1 << 16], *S, *T; if (T == S) { T = (S = now) + fread(now, 1, 1 << 16, stdin); if (T == S) return EOF; } return *S++; } inline long long read() { register long long x = 0, f = 1; char ch = gc(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = gc(); } while (isdigit(ch)) { x = (x << 3) + (x << 1) + ch - 0 ; ch = gc(); } return (f == 1) ? x : -x; } struct edge { int to, nxt, dis; } g[1200001]; int head[1200001], tot, n, m; inline void made(int from, int to, int dis) { g[++tot].to = to; g[tot].nxt = head[from]; head[from] = tot; g[tot].dis = dis; } int sz[1200001], dep[1200001], wson[1200001]; int s[1200001], a[1200001], F[10000001], ans[1200001]; void dfs0(int u, int fa) { sz[u] = 1; dep[u] = dep[fa] + 1; for (int i = head[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == fa) continue; s[v] = a[v] ^ s[u] ^ g[i].dis; dfs0(v, u); sz[u] += sz[v]; if (sz[wson[u]] < sz[v]) wson[u] = v; } } void get(int u, int fa, int wht) { if (wht) F[s[u]] = max(F[s[u]], dep[u]); else F[s[u]] = 0; for (int i = head[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == fa) continue; get(v, u, wht); } } void calc(int zx, int u, int fa) { if (F[s[u]]) ans[zx] = max(F[s[u]] + dep[u] - 2 * dep[zx], ans[zx]); for (int i = 0, two = 1; i < 22; i++, two <<= 1) { if (F[s[u] ^ two]) ans[zx] = max(F[s[u] ^ two] + dep[u] - 2 * dep[zx], ans[zx]); } for (int i = head[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == fa) continue; calc(zx, v, u); } } void doit(int u, int fa, int wht) { for (int i = head[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == fa || v == wson[u]) continue; doit(v, u, 0); } if (wson[u]) doit(wson[u], u, 1); if (F[s[u]]) ans[u] = max(F[s[u]] - dep[u], ans[u]); for (int i = 0, two = 1; i < 22; i++, two <<= 1) { if (F[s[u] ^ two]) ans[u] = max(F[s[u] ^ two] - dep[u], ans[u]); } F[s[u]] = max(F[s[u]], dep[u]); for (int i = head[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == fa || v == wson[u]) continue; calc(u, v, u); get(v, u, 1); } if (!wht) get(u, fa, 0); } void dfs1(int u, int fa) { for (int i = head[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == fa) continue; dfs1(v, u); ans[u] = max(ans[u], ans[v]); } } int main() { n = read(); for (int i = 1; i < n; i++) { int u = read(); char ch = gc(); while (!isalpha(ch)) ch = gc(); made(i + 1, u, (1 << (ch - a ))); made(u, i + 1, (1 << (ch - a ))); } dfs0(1, 0); doit(1, 0, 0); dfs1(1, 0); for (int i = 1; i <= n; i++) { printf( %d , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, s = 0; scanf( %I64d , &n); while (n > 0) { if (n % 8 == 1) s++; n /= 8; } printf( %I64d , s); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int a = sqrt(n); long long int b = n / a; if (n % a != 0) b++; if (n == 1) cout << 0 n ; else { cout << a - 1 + b - 1 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long n, m, t; long long a[500000]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> t; for (long long ti = 0; ti < t; ti++) { map<vector<long long>, long long> tab; map<vector<long long>, long long>::iterator iter; cin >> n >> m; vector<long long> v[n + 1]; for (long long i = 0; i < n; i++) cin >> a[i]; for (long long i = 0; i < m; i++) { long long a, b; cin >> a >> b; v[b].push_back(a); } for (long long i = 0; i < n; i++) sort(v[i + 1].begin(), v[i + 1].end()); for (long long i = 0; i < n; i++) if (!v[i + 1].empty()) tab[v[i + 1]] += a[i]; long long g; iter = tab.begin(); g = iter->second; iter++; for (; iter != tab.end(); iter++) g = gcd(g, iter->second); cout << g << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> v[600]; char s[600]; int cnt = 0; int rec[3]; void dfs(int src, char c) { s[src] = c; for (int i = 0; i < v[src].size(); i++) if (s[v[src][i]] != b ) { cnt++; s[v[src][i]] = c; } } int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } for (int i = 1; i <= n; i++) if (v[i].size() == n - 1) { cnt++; s[i] = b ; } rec[1] = cnt; for (int i = 1; i <= n; i++) if (s[i] != b ) { cnt++; dfs(i, a ); break; } rec[0] = cnt - rec[1]; for (int i = 1; i <= n; i++) if (s[i] != a && s[i] != b ) { cnt++; dfs(i, c ); break; } rec[2] = cnt - rec[0] - rec[1]; int x = rec[0] * (rec[0] + rec[1] - 1) + rec[1] * (n - 1) + rec[2] * (rec[1] + rec[2] - 1); if (cnt != n || x / 2 != m) cout << No << endl; else { cout << Yes << endl; for (int i = 1; i <= n; i++) cout << s[i]; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int i; int main() { cin >> s; i = s.find( 0 ); if (i > -1) s.erase(i, 1); else s.erase(0, 1); cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> inline void chmin(A &a, B b) { if (a > b) a = b; } template <typename A, typename B> inline void chmax(A &a, B b) { if (a < b) a = b; } long long N, M; string S; signed main() { cin >> N >> M >> S; long long ans = 0; vector<long long> cnt(M); for (long long i = N - 1; i >= 0; i--) { long long c = S[i] - a ; if (i + 1 < N && S[i] != S[i + 1]) { ans += N - i - 1 - cnt[c]; ans += cnt[c] * (M - 1); ans += (N - i - 1 - cnt[c]) * (M - 2); } cnt[c]++; } fill((cnt).begin(), (cnt).end(), 0ll); vector<long long> st(N); for (long long i = 0; i < N; i++) { long long c = S[i] - a ; if (i && S[i - 1] != S[i]) { st[i] = 1; if (i >= 3 && S[i - 3] == S[i - 1] && S[i - 2] == S[i]) st[i] += st[i - 2]; ans += i - cnt[c] - st[i]; ans += cnt[c] * (M - 1); ans += (i - cnt[c]) * (M - 2); long long tmp = st[i] - 1; if (i - st[i] * 2 >= 0 && S[i - st[i] * 2] == S[i]) tmp++; ans -= tmp; } cnt[c]++; } ans += (M - 1) * N; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, k, a[105], b[105], c[105], ai[105]; map<long long int, long long int> pos; void apply_f(long long int c[105]) { for (int i = 1; i <= n; i++) c[i] = a[c[i]]; } void apply_if(long long int c[105]) { for (int i = 1; i <= n; i++) c[i] = ai[c[i]]; } bool compare(long long int a1[105], long long int a2[105]) { for (int i = 1; i <= n; i++) if (a1[i] != a2[i]) return 0; return 1; } bool Check(int l, int r) { if (l == 0 || l > k) return 0; if ((k - l) % 2 == 1) return 0; if (l == 1 && k != 1 && r == 1) return 0; return 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; ai[a[i]] = i; c[i] = i; } for (int i = 1; i <= n; i++) { cin >> b[i]; } long long int loc = 0; for (int i = 0; i <= 100; i++) { if (compare(c, b)) { pos[i] = 1; } apply_f(c); } for (int i = 1; i <= n; i++) c[i] = i; for (int i = 0; i <= 100; i++) { if (compare(c, b)) { pos[-i] = 1; } apply_if(c); } long long int R = 0, L = 0; for (int i = 0; i <= 100; i++) { if (pos[i]) { R = i; break; } } for (int i = 0; i >= -100; i--) { if (pos[i]) { L = -i; break; } } if (Check(L, R) || Check(R, L)) cout << YES << n ; else cout << NO << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 10, MAXM = 2e5 + 10; pair<int, int> v[MAXM]; int l[MAXM], r[MAXM], s[MAXM], t[MAXM]; vector<int> qv[MAXM]; bool ans[MAXM]; int last[MAXN][MAXN]; int main() { int n, m, q; scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= m; i++) scanf( %d %d , &v[i].first, &v[i].second); for (int i = 0; i < q; i++) scanf( %d %d %d %d , l + i, r + i, s + i, t + i), qv[l[i]].push_back(i); for (int i = 0; i <= n; i++) for (int k = 0; k <= n; k++) last[i][k] = m + 1; for (int time = m; time > 0; time--) { int x, y; x = v[time].first, y = v[time].second; last[x][y] = last[y][x] = time; for (int vx = 1; vx <= n; vx++) { if (last[x][vx] < last[y][vx]) last[y][vx] = last[x][vx]; else last[x][vx] = last[y][vx]; } for (int ix : qv[time]) ans[ix] = (last[s[ix]][t[ix]] <= r[ix]); } for (int i = 0; i < q; i++) if (ans[i]) printf( Yes n ); else printf( No n ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, x1, y1, x2, y2; long double s = 0; scanf( %d %d , &n, &k); scanf( %d %d , &x1, &y1); for (int i = 1; i < n; i++) { scanf( %d %d , &x2, &y2); s += (long double)sqrt((long double)(x2 - x1) * (x2 - x1) + (long double)(y2 - y1) * (y2 - y1)); x1 = x2; y1 = y2; } printf( %.6Lf , s * (long double)k / (long double)50); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, ans, t; int a[100005]; int main() { scanf( %d%d , &n, &k); ans = 1; t = 1; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); if (a[i] == a[i - 1]) { ans = max(ans, i - t); t = i; } } ans = max(ans, n - t + 1); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:50000000 ) using namespace std; int n, z = 0, x, y; int a[105]; bool f; int main() { scanf( %d , &n); if (n % 2 == 0 || n < 2) { printf( -1 n ); return 0; } for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = n; i >= 1; i--) { while (a[i] > 0) { x = 0; y = 0; f = 0; if (i * 2 + 1 <= n) { x = 1 + (a[i * 2] > 0) + (a[i * 2 + 1] > 0); f = 1; } if (i / 2 > 0) { y = (a[i / 2] > 0) + (a[(i / 2) * 2] > 0) + (a[(i / 2) * 2 + 1] > 0); f = 1; } if (f == 0) { printf( -1 n ); return 0; } z++; if (x > y) { a[i]--; a[i * 2]--; a[i * 2 + 1]--; } else { a[i / 2]--; a[(i / 2) * 2]--; a[(i / 2) * 2 + 1]--; } } } printf( %d n , z); return 0; } |
#include <bits/stdc++.h> using namespace std; int fx[] = {-1, 1, 0, 0}; int fy[] = {0, 0, 1, -1}; int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1}; int dy[] = {0, 0, 1, -1, 1, -1, -1, 1}; int cx[] = {1, 1, 2, 2, -1, -1, -2, -2}; int cy[] = {2, -2, 1, -1, 2, -2, 1, -1}; const int N = 1 << 11; int n; int ans[N + 1]; int ask(int p, int q) { printf( ? %d %d n , p, q); fflush(stdout); int x; scanf( %d , &x); return x; } int value(int x) { int ans = N - 1; for (int i = 1; i <= 15; i++) { int a = rand() % n + 1; if (a == x) continue; ans &= ask(x, a); } return ans; } void solve() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); srand(2137); scanf( %d , &n); vector<int> v; for (int i = 1; i <= n; i++) v.push_back(i); random_shuffle(v.begin(), v.end()); pair<int, int> zero = {v[0], value(v[0])}; for (int i = 1; i <= n - 1; i++) { int a = ask(zero.first, v[i]); if ((a & zero.second) == a) zero = {v[i], value(v[i])}; } for (int i = 1; i <= n; i++) if (i != zero.first) ans[i] = ask(i, zero.first); printf( ! ); for (int i = 1; i <= n; i++) printf( %d , ans[i]); } signed main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Compteur { int nbs[4]; Compteur() { for (int iCoeff = 0; iCoeff < 4; iCoeff++) { nbs[iCoeff] = 0; } } }; Compteur operator+(const Compteur &a, const Compteur &b) { Compteur nouv; for (int iCoeff = 0; iCoeff < 4; iCoeff++) { nouv.nbs[iCoeff] = a.nbs[iCoeff] + b.nbs[iCoeff]; } return nouv; } int getP2(int a) { int s = 1; while (s < a) { s *= 2; } return s; } vector<Compteur> arbres[10][10]; void modif(vector<Compteur> &a, int pos, Compteur val) { pos += (int)a.size() / 2; while (pos != 0) { a[pos] = a[pos] + val; pos /= 2; } } Compteur getSomme(vector<Compteur> &a, int deb, int fin) { deb += (int)a.size() / 2; fin += (int)a.size() / 2; Compteur somme; while (deb < fin) { if (deb % 2 == 1) { somme = somme + a[deb]; deb++; } if (fin % 2 == 1) { fin--; somme = somme + a[fin]; } deb /= 2; fin /= 2; } return somme; } int conv[256]; int main() { string chaine; cin >> chaine; conv[ A ] = 0; conv[ T ] = 1; conv[ G ] = 2; conv[ C ] = 3; for (int iTaille = 1; iTaille <= 10; iTaille++) { for (int iMod = 0; iMod < iTaille; iMod++) { arbres[iTaille - 1][iMod] = vector<Compteur>( 2 * getP2((chaine.size() + iTaille) / iTaille), Compteur()); } } for (int iCar = 0; iCar < chaine.size(); iCar++) { Compteur nouv; nouv.nbs[conv[chaine[iCar]]]++; for (int iTaille = 1; iTaille <= 10; iTaille++) { int mod = iCar % iTaille; int pos = iCar / iTaille; modif(arbres[iTaille - 1][mod], pos, nouv); } } int nbReqs; cin >> nbReqs; for (int iReq = 0; iReq < nbReqs; iReq++) { int type; cin >> type; if (type == 1) { int iCar; char val; cin >> iCar >> val; iCar--; Compteur nouv; nouv.nbs[conv[val]]++; nouv.nbs[conv[chaine[iCar]]]--; for (int iTaille = 1; iTaille <= 10; iTaille++) { int mod = iCar % iTaille; int pos = iCar / iTaille; modif(arbres[iTaille - 1][mod], pos, nouv); } chaine[iCar] = val; } else { int deb, fin; string comp; cin >> deb >> fin >> comp; deb--; int iTaille = comp.size(); int somme = 0; for (int iMod = 0; iMod < iTaille; iMod++) { int mod = (deb + iMod) % iTaille; int debPos = (deb + iMod) / iTaille; int finPos = (fin - iTaille) / iTaille; while (finPos * iTaille + mod < fin) { finPos++; } Compteur vals = getSomme(arbres[iTaille - 1][mod], debPos, finPos); somme += vals.nbs[conv[comp[iMod]]]; } cout << somme << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { string s, d, b; char a, ch[3]; cin >> s; long long i, j, ans, n, flag = 0; a = s[0]; for (i = 1; i < s.size(); i++) { if (s[i] == . ) continue; if (s[i] == e ) { flag = 1; } if (s[i] != e ) { if (flag) b.push_back(s[i]); else d.push_back(s[i]); } } if (d.size() == 1 && d[0] == 0 ) d.clear(); if (a == 0 ) { cout << a; if (d.size()) cout << . << d; return 0; } for (i = 0; i < b.size(); i++) ch[i] = b[i]; long long pr = atoi(ch); if (d.size() == pr) cout << a << d; if (d.size() > pr) { cout << a; for (i = 0; i < d.size(); i++) { if (i == pr) cout << . ; cout << d[i]; } } if (pr > d.size()) { if (a != 0 ) cout << a; for (i = 0; i < pr; i++) { if (i < d.size()) cout << d[i]; else { cout << 0 ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int sz = 15000001; int n; int sieve[sz]; int v[300001]; int cnt[sz]; inline void solve() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &v[i]); } for (int i = 2; i < sz; i++) if (sieve[i] == 0) { for (int j = i; j < sz; j += i) sieve[j] = i; } for (int i = 0; i < n; i++) { int x = v[i]; if (x == 1) continue; vector<int> f; while (x != 1) { f.push_back(sieve[x]); x /= sieve[x]; } int cur = f[f.size() - 1]; cnt[cur]++; for (int j = f.size() - 2; j >= 0; j--) { if (f[j] == f[j + 1]) cur *= f[j]; else cur = f[j]; cnt[cur]++; } } int otv = n; for (int i = 0; i < sz; i++) { if (n != cnt[i]) otv = min(n - cnt[i], otv); } if (otv == n) printf( %d , -1); else printf( %d , otv); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int q = 1; for (; q > 0; q--) { solve(); cout << n ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; template <typename T> inline void rit(T &x) { char c; for (x = 0, c = getchar(); c < - ; c = getchar()) ; for (; c >= 0 ; x = x * 10 + c - 0 , c = getchar()) ; } int Q, op, x, c, p = 1; long long int s[500001]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); rit(Q); while (Q--) { rit(op); if (op == 1) { s[c + 1] = s[c] + x, ++c, rit(x); } else { while (p < c && s[p] + x >= (s[p + 1] - s[p]) * p) ++p; double ans = (double)x - (double)(s[p] + x) / p; int a = ans; cout << a << . << setw(7) << setfill( 0 ) << (int)((ans - a) * 1e7) << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; long long n; int Q; void ReadInput() { cin >> n >> Q; n *= 2LL; } long long Get(long long first) { if (first % 2 == 1) return (first + 1) / 2; return Get(first + (n - first) / 2); } void Solve() { while (Q-- > 0) { long long first; cin >> first; cout << Get(first) << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); ReadInput(); Solve(); } |
#include <bits/stdc++.h> using namespace std; int n, k; string a[2005]; int common[2005][2005]; int main() { std::ios::sync_with_stdio(false); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) for (int k = 0; k < a[i].size() && k < a[j].size(); k++) if (a[i][k] == a[j][k]) common[i][j] = k + 1; else break; int ans = 0; for (int i = 0; i < (1 << n); i++) if (__builtin_popcount(i) == k) { int cur = 0; for (int j = 0; j < n; j++) if (i & (1 << j)) for (int k = j + 1; k < n; k++) if (i & (1 << k)) cur += common[j][k]; if (cur > ans) ans = cur; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void bfs(int v, vector<vector<int> > &graf, vector<vector<int> > &dist) { queue<int> q; q.push(v); while (!q.empty()) { int p = q.front(); q.pop(); for (int i = 0; i < graf[p].size(); i++) { int to = graf[p][i]; if (dist[v][to] != 1e9) continue; dist[v][to] = dist[v][p] + 1; q.push(to); } } } struct ship { int pos, attack, fuel; }; struct base { int pos, def; }; vector<bool> used; vector<int> lnk; bool dfs(int v, vector<vector<int> > &vv) { used[v] = 1; for (int i = 0; i < vv[v].size(); i++) { int u = vv[v][i]; if (lnk[u] == -1 || !used[lnk[u]] && dfs(lnk[u], vv)) { lnk[u] = v; return true; } } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, m; cin >> n >> m; vector<vector<int> > dist(n + 1, vector<int>(n + 1, 1e9)); vector<vector<int> > graf(n + 1); for (int i = 0; i < m; i++) { int first, t; cin >> first >> t; graf[first].push_back(t); graf[t].push_back(first); } for (int i = 1; i <= n; i++) dist[i][i] = 0; for (int i = 1; i <= n; i++) bfs(i, graf, dist); int second, b, k, h; cin >> second >> b >> k >> h; vector<ship> ships(second); for (int i = 0; i < second; i++) { cin >> ships[i].pos >> ships[i].attack >> ships[i].fuel; } vector<base> bases(b); for (int i = 0; i < b; i++) { cin >> bases[i].pos >> bases[i].def; } vector<vector<int> > vv(second); for (int i = 0; i < second; i++) { for (int j = 0; j < b; j++) { int d = dist[ships[i].pos][bases[j].pos]; if (d <= ships[i].fuel && bases[j].def <= ships[i].attack) vv[i].push_back(j); } } int ans = 0; used.resize(second); lnk.resize(b, -1); for (int i = 0; i < second; i++) { used.assign(n, 0); if (dfs(i, vv)) ans++; } cout << min(1LL * ans * k, 1LL * second * h); } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; template <class T> void chkmin(T &a, T b) { if (a > b) a = b; } int n, s, m; int a[2005]; int z[2005], id[2005]; int dp[2][2005], f[2][2005]; int nxt[2005], prv[2005]; int ans; vector<int> v[2005]; int cnt; int pos[2005]; bool cmp(int x, int y) { return a[x] > a[y]; } int dist(int x, int y) { if (x > y) swap(x, y); return min(y - x, n - y + x); } int cdist(int x, int y) { if (y <= x) return x - y; return n - y + x; } void calc_dp() { for (int x = m - 1; x >= 0; x--) { for (int ii = 0; ii < v[x].size(); ii++) { int i = v[x][ii]; if (a[i] == m - 1) dp[1][i] = 0; else { dp[1][i] = INF; for (int j = 0; j < n; j++) { if (a[j] == a[i] + 1) { if (dp[1][i] > dp[0][j] + dist(i, j)) { dp[1][i] = dp[0][j] + dist(i, j); f[1][i] = j; } } } } } for (int ii = 0; ii < v[x].size(); ii++) { int i = v[x][ii]; if (v[x].size() == 1) dp[0][i] = dp[1][i], f[0][i] = i; else { dp[0][i] = dp[1][prv[i]] + cdist(prv[i], i), f[0][i] = 0; if (dp[0][i] > dp[1][nxt[i]] + cdist(i, nxt[i])) { dp[0][i] = dp[1][nxt[i]] + cdist(i, nxt[i]); f[0][i] = 1; } } } } ans = INF; int t = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) { if (ans > dp[0][i] + dist(i, s)) { ans = dp[0][i] + dist(i, s); t = i; } } } printf( %d n , ans); if (cdist(s, t) == dist(s, t)) { printf( -%d n , dist(s, t)); } else printf( +%d n , dist(s, t)); int e = 0; while (1) { if (e == 0) { if (prv[t] == t) ; else { if (f[e][t] == 0) { int tl = t, tr = nxt[t]; while (tr != t) { printf( +%d n , cdist(tr, tl)); tr = nxt[tr], tl = nxt[tl]; } t = prv[t]; } else { int tl = prv[t], tr = t; while (tl != t) { printf( -%d n , cdist(tr, tl)); tr = prv[tr], tl = prv[tl]; } t = nxt[t]; } } } else { if (a[t] == m - 1) break; else { if (cdist(t, f[e][t]) == dist(t, f[e][t])) { printf( -%d n , dist(t, f[e][t])); } else printf( +%d n , dist(t, f[e][t])); t = f[e][t]; } } e ^= 1; } } int main() { scanf( %d %d , &n, &s); s--; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); z[m++] = a[i]; id[i] = i; } sort(z, z + m); m = unique(z, z + m) - z; for (int i = 0; i < n; i++) { a[i] = lower_bound(z, z + m, a[i]) - z; v[a[i]].push_back(i); } for (int i = 0; i < n; i++) { if (v[a[i]].size() == 1) nxt[i] = prv[i] = i; else { for (int j = 1; j < n; j++) { if (a[(i + j) % n] == a[i]) prv[i] = (i + j) % n; if (a[(i + n - j) % n] == a[i]) nxt[i] = (i + n - j) % n; } } } sort(id, id + n, cmp); calc_dp(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool chk(int a, int b, int c, int sum) { return a + b + c == sum; } int main() { int sum = 0; vector<int> u(6); for (int i = 0; i < 6; i++) { cin >> u[i]; sum += u[i]; } if (sum % 2) { cout << NO ; return 0; } sum /= 2; for (int a = 0; a < 6; a++) for (int b = 0; b < 6; b++) for (int c = 0; c < 6; c++) if (a != b && b != c && a != c && u[a] + u[b] + u[c] == sum) { cout << YES ; return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100000], lim, n, flag; void DFS(long long x, long long y) { if (x > n) { if (y == a[lim]) flag = 1; return; } if (flag) return; DFS(x + 1, y); if (x != lim) { DFS(x + 1, y + a[x]); DFS(x + 1, y - a[x]); } } inline void work() { lim = flag = n = 0; memset(a, 0, sizeof(a)); scanf( %lld , &n); for (register long long i = 1; i <= n; ++i) scanf( %lld , &a[i]); for (lim = 1; lim <= n; ++lim) { DFS(1, 0); if (flag) { puts( YES ); return; } } puts( NO ); } signed main() { long long T; scanf( %lld , &T); while (T--) work(); } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const double eps = 1e-9; vector<long long> prnum; void sieve() { bool prime[1000001]; memset(prime, true, sizeof(prime)); for (int i = 2; i * i <= 1000000; i++) { if (prime[i] == true) { for (int j = 2 * i; j <= 1000000; j += i) { prime[j] = false; } } } for (int i = 2; i <= 1000000; i++) { if (prime[i]) prnum.push_back(i); } } int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; if (k >= n) { cout << 1 << n ; } else { long long ans = 1000000000; for (long long i = 1; i * i <= n; i++) { if (i > k) break; if (n % i == 0) { if ((n / i) <= k) { ans = min(ans, i); } else { ans = min(ans, n / i); } } } cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; signed main() { long long n, sum = 0, temp; multiset<long long> a; cin >> n; for (long long i = 0; i < n; ++i) { cin >> temp; a.insert(temp); } while (a.size() > 1) { long long temp_sum = 0, sz = a.size(); for (long long j = 0; j < ((sz % 2 == 0) ? 2 : min(3ll, sz)); ++j) { temp_sum += *a.begin(); a.erase(a.begin()); } sum += temp_sum; a.insert(temp_sum); } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; int ht[300][300], tt[300][300][8], n, m, t, tp, tu, td; void print(const char *s, int k) { cout << s << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) cout << setw(2) << tt[i][j][k] << ; cout << endl; } } int main() { int i1, j1, i2, j2, bestDt = 2e9; cin >> n >> m >> t >> tp >> tu >> td; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> ht[i][j]; for (int i = 0; i < n; ++i) { tt[i][0][0] = 0; tt[i][m - 1][2] = 0; for (int j = 1; j < m; ++j) { tt[i][j][0] = tt[i][j - 1][0] + ((ht[i][j - 1]) == (ht[i][j]) ? tp : ((ht[i][j - 1]) < (ht[i][j]) ? tu : td)); tt[i][m - 1 - j][2] = tt[i][m - j][2] + ((ht[i][m - j]) == (ht[i][m - 1 - j]) ? tp : ((ht[i][m - j]) < (ht[i][m - 1 - j]) ? tu : td)); } } for (int j = 0; j < m; ++j) { tt[0][j][1] = 0; tt[n - 1][j][3] = 0; for (int i = 1; i < n; ++i) { tt[i][j][1] = tt[i - 1][j][1] + ((ht[i - 1][j]) == (ht[i][j]) ? tp : ((ht[i - 1][j]) < (ht[i][j]) ? tu : td)); tt[n - 1 - i][j][3] = tt[n - i][j][3] + ((ht[n - i][j]) == (ht[n - 1 - i][j]) ? tp : ((ht[n - i][j]) < (ht[n - 1 - i][j]) ? tu : td)); } } for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { tt[i][j][4] = tt[i][j][3] - tt[i][j][0]; tt[i][j][5] = tt[i][j][0] - tt[i][j][1]; tt[i][j][6] = tt[i][j][2] - tt[i][j][3]; tt[i][j][7] = tt[i][j][1] - tt[i][j][2]; } for (int imin = 0; imin < n; ++imin) for (int jmin = 0; jmin < m; ++jmin) { int d1 = tt[imin][jmin][4] - t; for (int imax = imin + 2; imax < n; ++imax) { int d2 = d1 + tt[imax][jmin][6]; for (int jmax = jmin + 2; jmax < m; ++jmax) { int dt = d2 + tt[imin][jmax][5] + tt[imax][jmax][7]; if (abs(dt) < bestDt) i1 = imin, j1 = jmin, i2 = imax, j2 = jmax, bestDt = abs(dt); } } } cout << i1 + 1 << << j1 + 1 << << i2 + 1 << << j2 + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= ch == - , ch = getchar(); while (isdigit(ch)) x = 10 * x + ch - 0 , ch = getchar(); return f ? -x : x; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } template <typename T> void print(T x, char let) { print(x), putchar(let); } const int maxn = 2e5 + 5; const int mn = (1 << 18) - 1; int n, a[maxn], b[mn], f[mn], sz[mn]; int find(int k) { if (f[k] == k) return k; return f[k] = find(f[k]); } void merge(int a, int b) { int fa = find(a); int fb = find(b); if (sz[fa] <= sz[fb]) { f[fa] = fb; sz[fb] += sz[fa]; } else { f[fb] = fa; sz[fa] += sz[fb]; } } int main() { n = read(); long long sum1 = 0; for (int i = 1; i <= n; i++) { a[i] = read(); sum1 += a[i]; b[a[i]]++; } b[0]++; for (int i = 0; i <= mn; i++) f[i] = i; long long sum = 0; for (int i = mn; i >= 1; i--) { if (b[0] > 0 && b[i] > 0 && find(0) != find(i)) { merge(0, i); sum += (long long)(b[0] + b[i] - 1) * i; b[0] = b[i] = 1; } for (int j = i; j; j = (j - 1) & i) { int k = i ^ j; if (b[j] > 0 && b[k] > 0 && find(j) != find(k)) { merge(j, k); sum += (long long)(b[j] + b[k] - 1) * i; b[j] = b[k] = 1; } } } cout << sum - sum1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int x, y; cin >> x >> y; int u = 0, v = 0, turns = 0, flag = 1, c = 1; while (1) { if (u == x and v == y) break; if (flag == 1) { int d = 0; while (d != c) { u++; if (u == x and v == y) break; d++; } flag = 2; if (u != x or v != y) turns++; } else if (flag == 2) { int d = 0; while (d != c) { v++; if (u == x and v == y) break; d++; } if (u != x or v != y) turns++; flag = 3; c++; } else if (flag == 3) { int d = 0; while (d != c) { u--; if (u == x and v == y) break; d++; } flag = 4; if (u != x or v != y) turns++; } else if (flag == 4) { int d = 0; while (d != c) { v--; if (u == x and v == y) break; d++; } c++; flag = 1; if (u != x or v != y) turns++; } } cout << turns; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string line; int persons = 0; int data = 0; while (getline(cin, line)) { if (line[0] == + ) ++persons; else if (line[0] == - ) --persons; else data += (line.size() - line.find( : ) - 1) * persons; } cout << data << endl; } |
#include <bits/stdc++.h> using namespace std; int n; string s; int l = 0, u = 0, d = 0; int main() { cin >> n; for (int i = 0; i < n; i++) { int l = -1, u = -1, d = -1; cin >> s; for (int j = 0; j < s.length(); j++) { if (isdigit(s[j])) d = j; if (islower(s[j])) l = j; if (isupper(s[j])) u = j; } if (d == -1) for (int j = 0; j < s.length(); j++) if (j != l && j != u) { s[j] = 4 ; d = j; break; } if (l == -1) for (int j = 0; j < s.length(); j++) if (j != d && j != u) { s[j] = a ; l = j; break; } if (u == -1) for (int j = 0; j < s.length(); j++) if (j != l && j != d) { s[j] = A ; u = j; break; } cout << s << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int count = 0; cin >> n; for (int i = 0; i < n; i++) { string a; cin >> a; if (a == ABSINTH || a == BEER || a == BRANDY || a == CHAMPAGNE || a == GIN || a == RUM || a == SAKE || a == TEQUILA || a == VODKA || a == WHISKEY || a == WINE || a == 0 || a == 1 || a == 2 || a == 3 || a == 4 || a == 5 || a == 6 || a == 7 || a == 8 || a == 9 || a == 10 || a == 11 || a == 12 || a == 13 || a == 14 || a == 15 || a == 16 || a == 17 ) count++; } cout << count; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int a, b; cin >> a >> b; int c = min(a, b); a = max(a, b) - c; cout << c << << a / 2; ; } int main() { int count = 1; while (count--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long modpower(long long n, long long k) { long long res = 1; while (k) { if (k & 1) res = (res * n) % 1000000009; k >>= 1; n = (n * n) % 1000000009; } return res; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; long long a[n]; bool f = 0; for (long long i = 0; i < n; ++i) { cin >> a[i]; if (a[i] != 1) f = 1; } sort(a, a + n); if (!f) { for (long long i = 0; i < n - 1; ++i) { cout << a[i] << ; } cout << 2; return 0; } cout << 1 << ; for (long long i = 0; i < n - 1; ++i) { cout << a[i] << ; } } |
#include <bits/stdc++.h> using namespace std; using namespace std; vector<vector<int> > g; vector<int> depth; void dfs(int v, int d = 0) { depth[v] = d; for (int to : g[v]) { if (depth[to] == -1) { dfs(to, d + 1); } } } int main() { int n, m; cin >> n >> m; g.resize(n); for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; --u, --v; g[u].push_back(v); g[v].push_back(u); } depth.assign(n, -1); dfs(0); int v = 0; for (int i = 1; i < n; ++i) { if (depth[i] > depth[v]) { v = i; } } depth.assign(n, -1); dfs(v); int ans = 0; for (int i = 0; i < n; ++i) { ans = max(ans, depth[i]); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; class strocks { public: string strocksguy() {} }; int main() { strocks strocks; iostream::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; string s, d; unordered_map<string, string> master; for (long long i = 0; i < m; i++) { cin >> s >> d; if (s.size() > d.size()) { master.insert(make_pair(s, d)); } else master.insert(make_pair(d, s)); } for (long long i = 0; i < n; i++) { cin >> s; if (master.find(s) != master.end()) cout << master.at(s) << ; else cout << s << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; const int N = 100005; int n, m, k; vector<int> adj[N]; int cnt[N]; int mark[N]; int pass; int aux[N]; bool ta[N]; bool clique(int x) { pass++; mark[x] = pass; int id = 0; for (int i : adj[x]) if (!ta[i]) { mark[i] = pass; aux[id++] = i; } for (int i = 0; i < id; i++) { for (int j = i + 1; j < id; j++) { if (!binary_search(adj[aux[i]].begin(), adj[aux[i]].end(), aux[j])) return 0; } } return 1; } int main() { int t; scanf( %d , &t); while (t--) { scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) { adj[i].clear(); cnt[i] = 0; ta[i] = 0; } for (int i = 0; i < m; i++) { int a, b; scanf( %d %d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); cnt[b]++; cnt[a]++; } for (int i = 1; i <= n; i++) { sort(adj[i].begin(), adj[i].end()); } priority_queue<ii> pq; for (int i = 1; i <= n; i++) { pq.push({-cnt[i], i}); } bool ok = 0; while (1) { if (pq.empty()) break; int c, x; tie(c, x) = pq.top(); c = -c; if (c != cnt[x]) { pq.pop(); continue; } if (c >= k) { vector<int> ans; while (!pq.empty()) { int c, x; tie(c, x) = pq.top(); c = -c; pq.pop(); if (c != cnt[x]) { continue; } ans.push_back(x); } printf( 1 %d n , (int)ans.size()); for (int i : ans) { printf( %d , i); } printf( n ); ok = 1; break; } pq.pop(); if (c == k - 1) { if (clique(x)) { printf( 2 n ); printf( %d , x); for (int i : adj[x]) if (!ta[i]) { printf( %d , i); } printf( n ); ok = 1; break; } } cnt[x] = 0; ta[x] = 1; for (int i : adj[x]) if (cnt[i]) { cnt[i]--; pq.push({-cnt[i], i}); } } if (!ok) { printf( -1 n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int ara[1000]; int rf[1000]; int main() { int n, i, f, w, cnt = 0, m, r; char str[1000001]; scanf( %d %d , &n, &m); scanf( %s , str); for (i = 0; i < n; i++) { r = str[i]; ara[r] = ara[r] + 1; } for (i = 0; i < n; i++) { r = str[i]; if (rf[r] == 0) { cnt++; rf[r] = 1; if (cnt > m) { printf( YES ); return 0; } } ara[r] = ara[r] - 1; if (ara[r] == 0) { cnt--; } } printf( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long mint = 0x7fffffff; const long long linf = 1000000000000000000LL; const long long mod = 1000000007LL; const double eps = 1e-3; const int N = 1000020; inline 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 * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long qpow(long long a, long long b, long long m) { long long ans = 1; while (b > 0) { if (b & 1) { ans = ans * a % m; } a = a * a % m; b >>= 1; } return ans; } int main(void) { for (int _ = read(); _ > 0; _--) { int n = read(); long long p = read(); vector<long long> k(n); long long b = 0; for (int i = 0; i < n; i++) k[i] = read(); sort(k.begin(), k.end(), greater<long long>()); long long q = 1; bool f = false; if (p == 1) { printf( %d n , n % 2 == 1 ? 1 : 0); continue; } long long now = k[0]; b = 1; int i = 1; for (; i < n; i++) { if (b == 0) now = k[i]; else while (now > k[i] && !f) { if (b >= n) { f = true; break; } b = b * p; now--; } if (f) { break; } else { if (b > 0) b--; else b++; } } long long ans = b % mod * qpow(p, now, mod) % mod; for (; i < n; i++) ans = (ans + (mod - 1) * qpow(p, k[i], mod) % mod) % mod; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long n; long long a[N], b[N], c[N]; bool check() { bool check = 0; for (long long i = 1; i <= n; i++) if (a[i] != b[i]) check = 1; bool check2 = 0; for (long long i = 1; i <= n; i++) if (a[i] != c[i]) check2 = 1; return check & check2; } void work() { for (long long i = 1; i <= n - 1; i++) { if (a[i] != a[i + 1]) { swap(a[i], a[i + 1]); if (check()) { cout << i << << i + 1; exit(0); } swap(a[i], a[i + 1]); } } } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n; for (long long i = 1; i <= n; i++) { cin >> a[i]; b[i] = a[i]; c[i] = b[i]; } sort(b + 1, b + n + 1); sort(c + 1, c + n + 1, greater<long long>()); work(); cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, dem; string s; void setup() {} void solve() { cin >> n; cin >> s; if (n == 1) cout << s; else { for (int i = 0; i <= n - 1; ++i) dem += s[i] == 0 ; cout << 1; for (int i = 1; i <= dem; ++i) cout << 0; } } int main() { setup(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long f[100], f0[100]; int main() { int n, k, m; scanf( %d %d %d , &n, &k, &m); for (int i = 1; i < k; i++) f0[i] = 0, f[i] = 0; int tmp = 1; long long ans = 0; for (int i = 0; i < n; i++) { f0[0] = 1; for (int j = 0; j < k; j++) if (f0[j] > 0) { for (int p = 0; p < 10; p++) { f[(p * tmp + j) % k] = (f[(p * tmp + j) % k] + f0[j]) % m; } } tmp = tmp * 10 % k; long long asd = 1; for (int j = i + 1; j < n - 1; j++) asd = asd * 10 % m; if (i + 1 < n) asd = (asd * 9) % m; ans = (ans + asd * (f[0] - 1) + m) % m; f[0] = 0; memcpy(f0, f, sizeof f0); memset(f, 0, sizeof f); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; long long int m; cin >> m; long long int num1[m], num2[m]; for (long long int i = 0; i < m; i++) { cin >> num1[i] >> num2[i]; } for (long long int i = 0; i < m; i++) { long long int x = num1[i] - 1; long long int y = num2[i]; if (x - 1 >= 0) { a[x - 1] += y - 1; } if (x + 1 < n) { a[x + 1] += a[x] - y; } a[x] = 0; } for (long long int i = 0; i < n; i++) cout << a[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e16; const long long maxn = 128; const long long maxlog = 60; long long a, b; string s, t; long long dp[maxlog][maxn]; long long ans; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cin >> a >> b; cin >> s >> t; string S = ; for (long long i = 100; i--; S += s) ; for (long long i = 0; i < s.size(); i++) { long long p1 = 0, p2 = i; for (; p1 < t.size(); p1++, p2++) { for (; p2 < S.size() and S[p2] != t[p1]; p2++) ; if (p2 == S.size()) break; } if (p1 == t.size()) dp[0][i] = p2 - i; else dp[0][i] = inf; } for (long long j = 1; j < maxlog; j++) for (long long i = 0; i < s.size(); i++) dp[j][i] = min(dp[j - 1][i] + dp[j - 1][(i + dp[j - 1][i]) % s.size()], inf); long long len = 0; for (long long j = maxlog; j--;) if (dp[j][len % s.size()] + len <= a * s.size()) ans |= 1ll << j, len = len + dp[j][len % s.size()]; cout << ans / b << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> using vec = vector<T>; template <typename T> using Prior = priority_queue<T>; template <typename T> using prior = priority_queue<T, vector<T>, greater<T>>; const int INF = 1e9; const int nINF = -1e9; const ll llINF = 4 * 1e18; const int MOD = 1e9 + 7; ll& pmod(ll& a, ll b) { a = (a + b) % MOD; return a; } ll& pmod(ll& a, ll b, ll c) { a = (a + b) % c; return a; } ll& mmod(ll& a, ll b) { a = (a - b + MOD) % MOD; return a; } ll& mmod(ll& a, ll b, ll c) { a = (a - b + c) % c; return a; } ll& tmod(ll& a, ll b) { a = (a * b) % MOD; return a; } ll mul(ll a, ll b) { return (a * b) % MOD; } ll mul(ll a, ll b, ll c) { return (a * b) % c; } ll POW(ll a, ll b) { ll res = 1; do { if (b % 2) tmod(res, a); tmod(a, a); } while (b >>= 1); return res; } ll FAC(ll a) { ll res = 1; for (int i = 1; i <= a; i++) tmod(res, i); return res; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { cout << a.first << << a.second; return out; } int main() { ios_base::sync_with_stdio(false), cin.tie(0); int n; cin >> n; vec<int> _list(n); for (auto& i : _list) cin >> i; if (n % 2) { cout << YES n ; cout << n - 2 << n ; for (int i = 0; i < n - 2; i += 2) cout << i + 1 << << i + 2 << << i + 3 << n ; for (int i = 0; i < n - 3; i += 2) cout << i + 1 << << i + 2 << << n << n ; } else { int tmp = 0, idx = -1; for (int i = 0; i < n; i++) { tmp ^= _list[i]; if (_list[i]) idx = i; } if (tmp != 0) cout << NO n ; else { cout << YES n ; cout << n - 2 << n ; for (int i = 0; i < n - 2; i += 2) cout << i + 1 << << i + 2 << << i + 3 << n ; for (int i = 0; i < n - 3; i += 2) cout << i + 1 << << i + 2 << << n << n ; } } } |
#include <bits/stdc++.h> using namespace std; const long long int M = 100 + 5, SM = 600; const long long int inf = 1e18; const long long int lg = 18; const long long int z = 26; long long int dp[M][M][M]; string dps[M][M][M]; long long int x; long long int nxt[M][z]; long long int tt = 1; long long int f[M]; long long int insert(string s) { long long int p = 0; for (char c : s) { if (nxt[p][c - A ] == 0) { nxt[p][c - A ] = tt++; } p = nxt[p][c - A ]; } return p; } int main() { string s, t, virus; cin >> s >> t; long long int n = ((long long int)s.size()); long long int m = ((long long int)t.size()); cin >> virus; long long int vi = insert(virus); { queue<long long int> q; for (long long int i = 0; i < 26; i++) { if (nxt[0][i] != 0) q.push(nxt[0][i]); } while (((long long int)q.size()) > 0) { long long int x = q.front(); q.pop(); for (long long int i = 0; i < 26; i++) { if (nxt[x][i] == 0) nxt[x][i] = nxt[f[x]][i]; else { f[nxt[x][i]] = nxt[f[x]][i]; q.push(nxt[x][i]); } } } } for (long long int i = 1; i < n + 1; i++) { for (long long int j = 1; j < m + 1; j++) { if (s[i - 1] == t[j - 1]) { for (long long int k = 0; k < tt; k++) { long long int d = nxt[k][s[i - 1] - A ]; if (k == vi || d == vi) continue; if (dp[i][j][d] < dp[i - 1][j - 1][k] + 1) { dp[i][j][d] = dp[i - 1][j - 1][k] + 1; dps[i][j][d] = dps[i - 1][j - 1][k] + s[i - 1]; } } } for (long long int k = 0; k < tt; k++) { if (dp[i][j][k] < dp[i][j - 1][k]) { dp[i][j][k] = dp[i][j - 1][k]; dps[i][j][k] = dps[i][j - 1][k]; } if (dp[i][j][k] < dp[i - 1][j][k]) { dp[i][j][k] = dp[i - 1][j][k]; dps[i][j][k] = dps[i - 1][j][k]; } } } } long long int res = 0; string pes = ; for (long long int k = 0; k < tt; k++) { if (k != vi) { if (res < dp[n][m][k]) { res = dp[n][m][k]; pes = dps[n][m][k]; } } } cout << (pes == ? 0 : pes); } |
#include <bits/stdc++.h> using namespace std; void candy(int x, int y) { int d = 1; bool flag = true; while (x >= 0 && y >= 0) { if (flag) { x = x - d; d++; flag = false; } else { y = y - d; d++; flag = true; } if (flag == true && x < d) { cout << Vladik << endl; break; } else if (flag == false && y < d) { cout << Valera << endl; break; } } } int main(int argc, char** argv) { int a, b; cin >> a >> b; candy(a, b); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.