func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int M = INT32_MAX; const int NMAX = 10007; int main() { cin.tie(0); cin.sync_with_stdio(0); cout.precision(30); string z[2]; cin >> z[0] >> z[1]; int n; cin >> n; cout << z[1] << << z[0] << endl; for (int i = 0; i < n; i++) { string k, next; cin >> k >> next; if (k == z[1]) z[1] = next; else z[0] = next; cout << z[1] << << z[0] << endl; } return 0; }; |
#include <bits/stdc++.h> using namespace std; pair<int, int> arr[200000]; int ans[200000], tree[500000], lazy[500000]; set<int> s; int n; set<int>::iterator it; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i].first; arr[i].second = i; } sort(arr, arr + n); int l, r, mn = arr[0].second, len; for (int i = 0; i < n; i++) { ans[i] = arr[0].first; } s.insert(arr[0].second); for (int i = 1; i < n; i++) { it = s.lower_bound(arr[i].second); r = *it; if (it == s.end()) { r = n; } if (*it == mn) { l = -1; } else { it--; l = *it; } mn = min(mn, arr[i].second); s.insert(arr[i].second); len = r - l - 1; ans[len - 1] = max(arr[i].first, ans[len - 1]); } for (int i = n - 2; i >= 0; i--) { ans[i] = max(ans[i], ans[i + 1]); } for (int i = 0; i < n; i++) { cout << ans[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; int arr[200005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; if (n % 2 == 0) { cout << NO n ; return 0; } int flag = 1, ct = 1; for (int i = 1; i <= n; i++) { if (flag) { arr[i] = ct; arr[n + i] = ct + 1; flag = 0; } else { arr[i] = ct + 1; arr[n + i] = ct; flag = 1; } ct += 2; } cout << YES n ; for (int i = 1; i <= 2 * n; i++) { cout << arr[i] << ; } } |
#include <bits/stdc++.h> using namespace std; void out(vector<int>& v) { for (int i = 0; i < v.size(); ++i) cout << v[i] << ; cout << endl; } int main() { int n; cin >> n; vector<int> p(n + 1); p.back() = 1; vector<int> c(n); c[0] = 1; if (n == 2) { p[1] = 1; } if (n == 3) { p[1] = 1; } if (n == 4) { p[1] = 1; } if (n == 5) { p[2] = 1; } if (n == 6) { p[1] = 1; } if (n == 7) { p[3] = 1; } if (n == 8) { p[2] = 1; p[3] = 1; p[4] = 1; } if (n == 9) { p[4] = 1; } if (n == 10) { p[3] = 1; } if (n == 11) { p[2] = 1; } if (n == 12) { p[6] = 1; p[4] = 1; p[1] = 1; } if (n == 13) { p[4] = 1; p[3] = 1; p[1] = 1; } if (n == 14) { p[6] = 1; p[1] = 1; p[10] = 1; } if (n == 15) { p[1] = 1; } if (n == 16) { p[1] = 1; p[3] = 1; p[12] = 1; } if (n == 17) { p[3] = 1; } if (n == 18) { p[7] = 1; } if (n == 19) { p[1] = 1; p[2] = 1; p[5] = 1; } if (n == 20) { p[3] = 1; } if (n == 21) { p[2] = 1; } if (n == 22) { p[1] = 1; } if (n == 23) { p[5] = 1; } if (n == 24) { p[1] = 1; p[2] = 1; p[7] = 1; } if (n == 25) { p[3] = 1; } if (n == 26) { p[1] = 1; p[2] = 1; p[6] = 1; } if (n == 27) { p[1] = 1; p[2] = 1; p[5] = 1; } if (n == 28) { p[3] = 1; } if (n == 29) { p[2] = 1; } if (n == 30) { p[1] = 1; p[2] = 1; p[23] = 1; } if (n == 31) { p[3] = 1; } if (n == 32) { p[1] = 1; p[2] = 1; p[22] = 1; } if (n == 33) { p[13] = 1; } if (n == 34) { p[3] = 1; p[4] = 1; p[8] = 1; } if (n == 35) { p[2] = 1; } if (n == 36) { p[11] = 1; } if (n == 37) { p[1] = 1; p[4] = 1; p[6] = 1; } if (n == 38) { p[1] = 1; p[5] = 1; p[6] = 1; } if (n == 39) { p[4] = 1; } if (n == 40) { p[3] = 1; p[4] = 1; p[5] = 1; } if (n == 41) { p[3] = 1; } if (n == 42) { p[3] = 1; p[4] = 1; p[7] = 1; } if (n == 43) { p[3] = 1; p[4] = 1; p[6] = 1; } if (n == 44) { p[2] = 1; p[5] = 1; p[6] = 1; } if (n == 45) { p[1] = 1; p[3] = 1; p[4] = 1; } if (n == 46) { p[6] = 1; p[7] = 1; p[8] = 1; } if (n == 47) { p[5] = 1; } if (n == 48) { p[4] = 1; p[7] = 1; p[9] = 1; } if (n == 49) { p[9] = 1; } if (n == 50) { p[2] = 1; p[3] = 1; p[4] = 1; } for (int i = 1; i < p.size(); ++i) cout << p[i] << ; cout << endl; out(c); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, p, i, j, k, result; cin >> n >> p; int a[n + 1], b[n + 1]; for (i = 1; i <= n; i = i + 1) cin >> a[i]; i = 0; j = p - 1; result = p - 1; do { int m = (i + j) / 2; bool check = true; b[0] = 0; for (int k = 1; k <= n; k = k + 1) b[k] = 1000000000; for (int k = 1; k <= n; k = k + 1) { if (((a[k] + m) % p >= b[k - 1]) && (a[k] + m >= p)) b[k] = b[k - 1]; if ((b[k - 1] - a[k] >= 0) && (b[k - 1] - a[k] <= m)) b[k] = min(b[k], b[k - 1]); if (a[k] >= b[k - 1]) b[k] = min(b[k], a[k]); if (b[k] == 1000000000) { check = false; break; }; } if (check == true) { j = m - 1; result = min(result, m); } else i = m + 1; } while (i <= j); cout << result; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; vector<int> a; scanf( %d%d , &n, &m); int min = n + 2; for (int i = 0; i < m; i++) { int t; scanf( %d , &t); if (t < min) { a.push_back(t); min = t; } if (t == 1) break; } sort(a.begin(), a.end()); for (int i = 0; i < a.size() - 1; i++) for (int j = 0; j < a[i + 1] - a[i]; j++) printf( %d , a[i]); for (int i = 0; i < n - a.back(); i++) printf( %d , a.back()); printf( %d n , a.back()); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t = 1; while (t--) { map<char, long long int> a, b; long long int n; cin >> n; string s, t; cin >> s >> t; for (long long int i = 0; i < n; i++) a[s[i]]++, b[t[i]]++; vector<long long int> ans; if (a != b) cout << -1; else { if (s == t) cout << 0; else { std::vector<int> move; for (int i = n - 1; i >= 0; --i) { if (s[i] != t[i]) { int j = i - 1; for (j = i - 1; j >= 0; --j) { if (s[j] == t[i]) break; } while (j < i) { move.push_back(j + 1); swap(s[j], s[j + 1]); ++j; } } } cout << move.size() << n ; for (int x : move) cout << x << ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int f; vector<string> cur; void upd(string s, int x, int y, int o) { int dx = 0, dy = 1; if (o) swap(dx, dy); for (int i = 0; i < s.size(); i++) { int xx = x + dx * i; int yy = y + dy * i; if (cur[xx][yy] == . || cur[xx][yy] == s[i]) { cur[xx][yy] = s[i]; } else { f = 0; } } } int main() { vector<string> a(6); for (auto &x : a) { cin >> x; } sort((a).begin(), (a).end()); vector<string> ans = { Z }; ans[0][0]++; vector<string> ans0 = ans; do { f = 1; vector<int> b; vector<int> c; for (int t = 0; t < 6; t += 3) { int mx = 0; int s = 0; for (int i = t; i < t + 3; i++) { s += a[i].size(); mx = max(mx, (int)a[i].size()); } for (int i = t; i < t + 3; i++) { if (a[i].size() == mx) { b.push_back(i); break; } } if (s - 2 * mx != 1) { f = 0; } } for (int i = 0; i < 6; i++) { if (i != b[0] && i != b[1]) { c.push_back(i); } } if (f) { vector<int> bb, cc; for (auto x : b) bb.push_back(a[x].size()); for (auto x : c) cc.push_back(a[x].size()); string t; for (int i = 0; i < bb[1]; i++) { t.push_back( . ); } cur = vector<string>(bb[0], t); upd(a[c[0]], 0, 0, 1); upd(a[c[2]], 0, 0, 0); upd(a[b[0]], 0, cc[2] - 1, 1); upd(a[b[1]], cc[0] - 1, 0, 0); upd(a[c[1]], cc[0] - 1, bb[1] - 1, 1); upd(a[c[3]], bb[0] - 1, cc[2] - 1, 0); } if (f) { if (cur < ans) ans = cur; } } while (next_permutation((a).begin(), (a).end())); if (ans == ans0) { cout << Impossible << endl; return 0; } for (auto s : ans) { cout << s << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod(long long a, long long b) { if (a % b < 0) { return a % b + b; } return a % b; } long long mod_exp(long long a, long long b, long long c) { long long res = 1; a = a % c; while (b > 0) { if (b % 2 == 1) { res = (res * a) % c; } b /= 2; a = (a * a) % c; } return res; } long long gcd(long long a, long long b) { if (b == 0) { return a; } return gcd(b, a % b); } bool prime[3001]; void SieveOfEratosthenes() { memset(prime, true, sizeof(prime)); prime[1] = false; for (int p = 2; p * p <= 3000; p++) { if (prime[p] == true) { for (int i = p * p; i <= 3000; i += p) prime[i] = false; } } } long long powe[20]; void power() { powe[0] = 1; for (long long i = 1; i < 20; i++) { powe[i] = (powe[i - 1] * 10) % 1000000007; if (powe[i] < 0) powe[i] += 1000000007; } } long long func(long long A[], long long n) { long long lis[n]; lis[0] = 1; for (long long i = 0; i < n; i++) { lis[i] = 1; } return lis[0]; } void solve() { long long a, b, c; cin >> a >> b >> c; if ((c >= b && b >= a) || (a >= b && b >= c)) { if (a >= b && b >= c) { swap(a, c); } while (b > (a + c) / 2) { b--; a++; } while (b < (a + c) / 2) { b++; c--; } cout << ((((a > b) ? a : b) > c) ? ((a > b) ? a : b) : c) << n ; return; } } int main() { long long n, a, b, c; cin >> n; cout << n? 1 2 n ; fflush(stdout); cin >> a; cout << ? 2 3 n ; fflush(stdout); cin >> b; cout << ? 1 3 n ; fflush(stdout); cin >> c; long long A[n]; A[0] = (a + c - b) / 2; A[1] = a - A[0]; A[2] = c - A[0]; for (long long i = 3; i < n; i++) { cout << ? 1 << i + 1 << n ; fflush(stdout); cin >> a; A[i] = a - A[0]; } cout << ! ; for (long long i = 0; i < n; i++) { cout << A[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; struct ACA { int pool[N], ptp; int stk[30], sz[N], rt[N], rtid, tp; int nxt[N][26], tran[N][26], fail[N], end[N], num[N], tot; inline int newnode() { return ++tot; } int merge(int x, int y) { if (!x || !y) return x | y; for (int i = 0; i < 26; i++) nxt[x][i] = merge(nxt[x][i], nxt[y][i]); end[x] += end[y]; pool[++ptp] = y; return x; } void build(int p) { queue<int> q; for (int i = 0; i < 26; i++) if (nxt[p][i]) fail[tran[p][i] = nxt[p][i]] = p, q.push(nxt[p][i]); else tran[p][i] = p; while (!q.empty()) { int k = q.front(); q.pop(); num[k] = end[k] + num[fail[k]]; for (int i = 0; i < 26; i++) { if (nxt[k][i]) { fail[tran[k][i] = nxt[k][i]] = tran[fail[k]][i]; q.push(tran[k][i]); } else tran[k][i] = tran[fail[k]][i]; } } } void ins(char *s, int n, int v) { rt[++rtid] = newnode(); sz[rtid] = 1; int p = rt[rtid]; for (int i = 0; i < n; i++) { int k = s[i] - a ; if (!nxt[p][k]) nxt[p][k] = newnode(); p = nxt[p][k]; } end[p] += v; while (tp && sz[stk[tp]] < 2 * sz[rtid]) rt[rtid] = merge(rt[rtid], rt[stk[tp]]), sz[rtid] += sz[stk[tp]], --tp; build(rt[rtid]); stk[++tp] = rtid; } int qry(char *s, int n) { int ans = 0; for (int i = 1; i <= tp; i++) { int p = rt[stk[i]]; for (int i = 0; i < n; i++) { p = tran[p][s[i] - a ]; ans += num[p]; } } return ans; } } ac; int main() { int m; scanf( %d , &m); for (int i = 1; i <= m; i++) { static char s[N]; int op; scanf( %d%s , &op, s); if (op == 1) ac.ins(s, strlen(s), 1); else if (op == 2) ac.ins(s, strlen(s), -1); else printf( %d n , ac.qry(s, strlen(s))), fflush(stdout); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1, logN = 21 + 1, mod = 1e9 + 7; int fl(int n) { int ans = 0; while (n /= 2) ++ans; return ans; } int ord2(int n) { int ans = 0; while (n % 2 == 0) { n >>= 1; ++ans; } return ans; } long long binpow(long long a, long long s) { long long ans = 1; while (s) { if (s & 1) ans = ans * a % mod; a = a * a % mod; s >>= 1; } return ans; } long long inv(long long a) { return binpow(a, mod - 2); } long long f[N], finv[N]; void init() { f[0] = 1; finv[0] = 1; for (long long i = 1; i < N; ++i) { f[i] = f[i - 1] * i % mod; finv[i] = inv(f[i]); } } int n, logn; int cnt[logN]; long long solve(int k) { for (int i = 0; i < logn; ++i) cnt[i] = 0; for (int i = 1; i <= n; ++i) { int ord = ord2(i); if (ord < k) ++cnt[ord]; else if (ord >= k) { if (i % 3) ++cnt[k]; else ++cnt[ord + 1]; } } long long ans = 1; for (int i = 0; i < logn; ++i) ans = ans * cnt[i] % mod; ans = ans * f[cnt[0] - 1] % mod; int sum = cnt[0] - 1; for (int i = 1; i < logn; ++i) { ans = ans * (f[sum + cnt[i]] * finv[sum + 1] % mod) % mod; sum += cnt[i]; } return ans; } int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); init(); cin >> n; logn = fl(n) + 1; long long ans = 0; for (int i = 0; i < logn; ++i) ans = (ans + solve(i)) % mod; cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int n, t, a[110]; int main() { scanf( %d%d , &n, &t); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { t = t - 86400 + a[i]; if (t <= 0) { printf( %d , i); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int a[100005]; int b[100005]; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i], &b[i]); } int flag = 1; if (n % 2 == 0) for (int i = 1; i < n / 2; i++) { if (a[i] + a[i + n / 2] != a[i + 1] + a[i + 1 + n / 2] || b[i] + b[i + n / 2] != b[i + 1] + b[i + 1 + n / 2]) { flag = 0; break; } } else flag = 0; if (flag) printf( YES n ); else printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; long long po(long long a, long long b) { long long x = 1, y = a; while (b > 0) { if (b % 2) { x = x * y; x %= 1000000007; } y = y * y; y %= 1000000007; b /= 2; } return x; } int main() { if (0) { freopen( C:/Users/gold/Desktop/sublime IO/input.txt , r , stdin); freopen( C:/Users/gold/Desktop/sublime IO/output.txt , w , stdout); } int T = 1; while (T--) { string s, s1; cin >> s >> s1; int n = s.length(); static int cnt[256]; for (int i = 0; i < n; i++) { cnt[s[i]]++; } int m = s1.length(); int ans = 0, ans1 = 0; for (int i = 0; i < m; i++) { if (cnt[s1[i]] > 0) { cnt[s1[i]]--; ans++; s1[i] = 1 ; } } for (int i = 0; i < m; i++) { if (s1[i] == 1 ) { continue; } if (s1[i] >= a && cnt[s1[i] - a + A ] > 0) { ans1++; cnt[s1[i] - a + A ]--; } else if (cnt[s1[i] - A + a ] > 0) { ans1++; cnt[s1[i] - A + a ]--; } } printf( %d %d n , ans, ans1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000100; int n, q, s[N / 2], f[N / 2], par[N / 2], timer; vector<int> g[N / 2]; void dfs(int x = 1, int pp = 0) { s[x] = ++timer; par[x] = pp; for (auto &it : g[x]) if (it != par[x]) { dfs(it, x); } f[x] = ++timer; } struct node { int sum; bool set; void merge(node <, node &rt) { sum = lt.sum + rt.sum; } } st[N << 2]; void push(int x, int lx, int rx) { if (st[x].set) { st[x].set = 0; st[x].sum = rx - lx + 1; if (lx == rx) return; st[x << 1].set = st[x << 1 | 1].set = 1; } } void bld(int x = 1, int lx = 1, int rx = n + n) { if (lx == rx) { st[x] = {0, 0}; return; } int mid = lx + rx >> 1; bld(x << 1, lx, mid); bld(x << 1 | 1, mid + 1, rx); st[x].merge(st[x << 1], st[x << 1 | 1]); } void modify(bool z, int &u, int &v, int x = 1, int lx = 1, int rx = n + n) { push(x, lx, rx); if (v < lx or u > rx) return; if (u <= lx and rx <= v) { if (z) { st[x].set = 1; push(x, lx, rx); } else { st[x].sum = 0; } return; } int mid = lx + rx >> 1; modify(z, u, v, x << 1, lx, mid); modify(z, u, v, x << 1 | 1, mid + 1, rx); st[x].merge(st[x << 1], st[x << 1 | 1]); } int qry(int &u, int &v, int x = 1, int lx = 1, int rx = n + n) { push(x, lx, rx); if (v < lx or u > rx) return 0; if (u <= lx and rx <= v) return st[x].sum; int mid = lx + rx >> 1; return qry(u, v, x << 1, lx, mid) + qry(u, v, x << 1 | 1, mid + 1, rx); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int u, v, i = 1; i < n; i++) { cin >> u >> v; g[u].emplace_back(v); g[v].emplace_back(u); } timer = 0; dfs(); bld(); cin >> q; int ty, v; while (q--) { cin >> ty >> v; if (ty == 1) { if (par[v] != 0 and qry(s[v], f[v]) != f[v] - s[v] + 1) { modify(0, s[par[v]], s[par[v]]); } modify(1, s[v], f[v]); } else if (ty == 2) { modify(0, s[v], s[v]); } else { cout << (qry(s[v], f[v]) == f[v] - s[v] + 1) << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, k, root, col[N], sz[N]; vector<int> g[N], a[N]; int dfs(int v, int pr = -1) { int mx = col[v]; sz[v] = col[v]; for (auto& to : g[v]) { if (to == pr) continue; int root = dfs(to, v); if (root != -1) return root; sz[v] += sz[to]; mx = max(mx, sz[to]); } mx = max(mx, 2 * k - sz[v]); if (mx > k) return -1; return v; } void go(int v, int pr = -1) { priority_queue<pair<int, int>> q; if (col[v]) { a[v].push_back(v); q.push({1, v}); } for (auto& to : g[v]) { if (to == pr) continue; go(to, v); if (pr != -1) { if (a[v].size() < a[to].size()) { a[v].swap(a[to]); } a[v].insert(a[v].end(), a[to].begin(), a[to].end()); a[to].clear(); } else { if (!a[to].empty()) { q.push({(int)a[to].size(), to}); } } } if (pr == -1) { while (!q.empty()) { auto x = q.top(); q.pop(); auto y = q.top(); q.pop(); cout << a[x.second].back() + 1 << << a[y.second].back() + 1 << << root + 1 << n ; --x.first; --y.first; a[x.second].pop_back(); a[y.second].pop_back(); if (x.first > 0) q.push(x); if (y.first > 0) q.push(y); } } } int main() { ios::sync_with_stdio(false); cin >> n >> k; for (int(i) = 0; (i) < (n - 1); ++(i)) { int x, y; cin >> x >> y; --x; --y; g[x].push_back(y); g[y].push_back(x); } for (int(i) = 0; (i) < (2 * k); ++(i)) { int x; cin >> x; --x; col[x] = 1; } root = dfs(0); cout << 1 << n << root + 1 << n ; go(root); return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:100000000 ) int matrix[900][900]; int tmp[900][900]; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; vector<pair<int, int> > all; void go(int x, int y) { queue<pair<int, int> > q; tmp[x][y] = 1; q.push(make_pair(x, y)); all.push_back(make_pair(x, y)); while (!q.empty()) { x = q.front().first; y = q.front().second; q.pop(); for (int i = 0; i < 4; i++) { if (x + dx[i] >= 0 && x + dx[i] <= 799 && y + dy[i] >= 0 && y + dy[i] <= 799) { if (matrix[x + dx[i]][y + dy[i]] != 255 && tmp[x + dx[i]][y + dy[i]] == 0) { tmp[x + dx[i]][y + dy[i]] = 1; q.push(make_pair(x + dx[i], y + dy[i])); all.push_back(make_pair(x + dx[i], y + dy[i])); } } } } } vector<int> path; int cnt = 0; void bfs(int x1, int y1, int x2, int y2) { for (int i = 0, maxi = (int)(all).size(); i < maxi; i++) { int x = all[i].first; int y = all[i].second; tmp[x][y] = 0; } all.clear(); path.clear(); cnt = 0; queue<pair<int, int> > q; q.push(make_pair(x1, y1)); tmp[x1][y1] = 111; all.push_back(make_pair(x1, y1)); while (!q.empty()) { for (int i = 0, maxi = (int)(q).size(); i < maxi; i++) { int x = q.front().first; int y = q.front().second; q.pop(); if (x == x2 && y == y2) { cnt = 0; while (x != x1 || y != y1) { int j = tmp[x][y] - 1; cnt++; path.push_back(j); x = x - dx[j]; y = y - dy[j]; } return; } for (int j = 0; j < 4; j++) { if (x + dx[j] >= 0 && x + dx[j] <= 799 && y + dy[j] >= 0 && y + dy[j] <= 799) { if (matrix[x + dx[j]][y + dy[j]] != 255 && tmp[x + dx[j]][y + dy[j]] == 0) { tmp[x + dx[j]][y + dy[j]] = j + 1; q.push(make_pair(x + dx[j], y + dy[j])); all.push_back(make_pair(x + dx[j], y + dy[j])); } } } } } } string ans = ; int main() { int x1, y1, x2, y2; scanf( %d %d %d %d , &x1, &y1, &x2, &y2); x1 += 400; y1 += 400; x2 += 400; y2 += 400; int m; scanf( %d , &m); int max_x = 0, min_x = 800, max_y = 0, min_y = 800; for (int i = 0; i < m; i++) { int x, y; scanf( %d %d , &x, &y); x += 400; y += 400; min_x = min(min_x, x); max_x = max(max_x, x); min_y = min(min_y, y); max_y = max(max_y, y); matrix[x][y] = 255; } go(x1, y1); if (m == 0 || tmp[x1][y1] != tmp[x2][y2]) { printf( -1 ); return 0; } while (true) { bfs(x1, y1, x2, y2); reverse(path.begin(), path.end()); for (int i = 0; i < cnt; i++) { if (path[i] == 0) ans += R ; else if (path[i] == 1) ans += U ; else if (path[i] == 2) ans += L ; else if (path[i] == 3) ans += D ; int j = path[i]; x1 += dx[j]; y1 += dy[j]; if (matrix[x2 + dx[j]][y2 + dy[j]] != 255) { x2 += dx[j]; y2 += dy[j]; path.push_back(j); cnt++; } if (min(y1, y2) > max_y || max(y1, y2) < min_y || min(x1, x2) > max_x || max(x1, x2) < min_x || x1 == x2 && y1 == y2) break; } if (x1 == x2 && y1 == y2) { cout << ans; return 0; } bool flag = false; if (min(y1, y2) > max_y) { if (max(x1, x2) >= min_x) { int diff = max(x1, x2) - min_x + 1; x1 -= diff; x2 -= diff; for (int i = 0; i < diff; i++) ans += L ; } if (max(y1, y2) >= min_y) { int diff = max(y1, y2) - min_y + 1; y1 -= diff; y2 -= diff; for (int i = 0; i < diff; i++) ans += D ; } flag = true; } else if (max(y1, y2) < min_y) { if (max(x1, x2) >= min_x) { int diff = max(x1, x2) - min_x + 1; x1 -= diff; x2 -= diff; for (int i = 0; i < diff; i++) ans += L ; } if (max(y1, y2) >= min_y) { int diff = max(y1, y2) - min_y + 1; y1 -= diff; y2 -= diff; for (int i = 0; i < diff; i++) ans += D ; } flag = true; } else if (min(x1, x2) > max_x) { if (max(y1, y2) >= min_y) { int diff = max(y1, y2) - min_y + 1; y1 -= diff; y2 -= diff; for (int i = 0; i < diff; i++) ans += D ; } if (max(x1, x2) >= min_x) { int diff = max(x1, x2) - min_x + 1; x1 -= diff; x2 -= diff; for (int i = 0; i < diff; i++) ans += L ; } flag = true; } else if (max(x1, x2) < min_x) { if (max(y1, y2) >= min_y) { int diff = max(y1, y2) - min_y + 1; y1 -= diff; y2 -= diff; for (int i = 0; i < diff; i++) ans += D ; } if (max(x1, x2) >= min_x) { int diff = max(x1, x2) - min_x + 1; x1 -= diff; x2 -= diff; for (int i = 0; i < diff; i++) ans += L ; } flag = true; } if (flag) { if (y2 > y1) { int y = min_y; int x; for (int i = 290; i < 510; i++) { if (matrix[i][y] == 255) { x = i; break; } } if (x2 < x) { int diff = x - x2; x1 += diff; x2 += diff; for (int i = 0; i < diff; i++) ans += R ; } if (y2 != y1) { int diff = y - y1 - 1; y2 = y - 1; y1 = y2; for (int i = 0; i < diff; i++) ans += U ; } } else { if (min(y1, y2) <= max_y) { int diff = max_y - min(y1, y2) + 1; y1 += diff; y2 += diff; for (int i = 0; i < diff; i++) ans += U ; } int y = max_y; int x; for (int i = 290; i < 510; i++) { if (matrix[i][y] == 255) { x = i; break; } } if (x2 < x) { int diff = x - x2; x1 += diff; x2 += diff; for (int i = 0; i < diff; i++) ans += R ; } if (y2 != y1) { int diff = y1 - y - 1; y1 -= diff; y2 = y + 1; for (int i = 0; i < diff; i++) ans += D ; } } if (x2 > x1) { if (max(x1, x2) >= min_x) { int diff = max(x1, x2) - min_x + 1; x2 -= diff; x1 -= diff; for (int i = 0; i < diff; i++) ans += L ; } if (max(y1, y2) >= min_y) { int diff = max(y1, y2) - min_y + 1; y2 -= diff; y1 -= diff; for (int i = 0; i < diff; i++) ans += D ; } int x = min_x; int y; for (int i = 290; i < 510; i++) { if (matrix[x][i] == 255) { y = i; break; } } if (y1 < y) { int diff = y - y1; y1 += diff; y2 += diff; for (int i = 0; i < diff; i++) ans += U ; } if (x2 != x1) { int diff = x - x1 - 1; x1 += diff; x2 = x - 1; for (int i = 0; i < diff; i++) ans += R ; } cout << ans; return 0; } else { if (min(x1, x2) <= max_x) { int diff = max_x - min(x1, x2) + 1; x1 += diff; x2 += diff; for (int i = 0; i < diff; i++) ans += R ; } if (max(y1, y2) >= min_y) { int diff = max(y1, y2) - min_y + 1; y2 -= diff; y1 -= diff; for (int i = 0; i < diff; i++) ans += D ; } int x = max_x; int y; for (int i = 290; i < 510; i++) { if (matrix[x][i] == 255) { y = i; break; } } if (y1 < y) { int diff = y - y1; y1 += diff; y2 += diff; for (int i = 0; i < diff; i++) ans += U ; } while (x2 != x1) { int diff = x1 - x - 1; x1 -= diff; x2 = x + 1; for (int i = 0; i < diff; i++) ans += L ; } cout << ans; return 0; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long INF = 1e7; double EPS = 1e-12; double tick() { static clock_t oldt; clock_t newt = clock(); double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC; oldt = newt; return diff; } long long int powP(long long int a, long long int b) { if (b == 0) return 1 % mod; long long int k; k = powP(a, b / 2); k = k * k % mod; if (b % 2 == 0) return k; else return a * k % mod; } bool bitSet(long long int n, long long int i) { if ((n & (1LL << i)) != 0) return true; else return false; } long long int findGcd(long long int a, long long int b) { if (a == 0) return b; else return findGcd(b % a, a); } long long int A[700005], B[700005], C[700005]; int main() { long long int T, i, n, m, p, j, l, e, r, b, c, k, q, a, d, w, x, y, v, z, t, curr, prev, sum, ans, pos, val, countA, secondMin, indicator; scanf( %lld , &n); stack<int> S; ans = 0; S.push(0); B[0] = INT_MAX; for (long long int i = (1); i <= (n); ++i) { scanf( %lld , &A[i]); B[i] = 1; while (!S.empty() && A[i] > A[S.top()]) { B[i] = max(B[i], B[S.top()] + 1); S.pop(); } if (B[i] < INT_MAX) ans = max(ans, B[i]); S.push(i); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxx = 2000010; const double pi = acos(-1.0); const double eps = 1e-15; map<pair<long long, long long>, long long> h, mk; map<pair<long long, pair<long long, long long> >, long long> hh; int t, n, m, k; long long ans = 0, total = 0, sum = 0, cnt = 0, pos = 0, s1 = 0, s2 = 0, a1 = 0, a2 = 0; long long a[maxx], vis[maxx]; char c[maxx], ch[maxx]; struct nod { long long v1, v2; } kl[maxx]; struct node { int num; long long val1, val2; } b[maxx]; bool cmp(node a, node b) { if (a.val1 == b.val1) return a.val2 < b.val2; return a.val1 < b.val1; } int main() { scanf( %d%d , &n, &k); n = n * k; scanf( %s , c + 1); for (int i = n + 1; i <= 2 * n; i++) c[i] = c[i - n]; scanf( %d , &m); a1 = a2 = 1; for (int i = 1; i < k; i++) a1 = a1 * 237 % 998244353, a2 = a2 * 237 % 1000000007; for (int i = 1; i <= m; i++) { scanf( %s , ch + 1); s1 = s2 = 0; for (int j = 1; j <= k; j++) s1 = (s1 * 237 % 998244353 + ch[j] - a + 1) % 998244353, s2 = (s2 * 237 % 1000000007 + ch[j] - a + 1) % 1000000007; h[make_pair(s1, s2)]++, b[i].val1 = s1, b[i].val2 = s2, b[i].num = i; } sort(b + 1, b + n + 1, cmp); for (int i = 1; i <= n; i++) { mk[make_pair(b[i].val1, b[i].val2)] = i; for (int j = i; j <= n; j++) { if (b[i].val1 != b[j].val1 || b[i].val2 != b[j].val2) { i = j - 1; break; } if (j == n) i = n + 1; } } s1 = s2 = 0; for (int i = 1; i <= k; i++) s1 = (s1 * 237 % 998244353 + c[i] - a + 1) % 998244353, s2 = (s2 * 237 % 1000000007 + c[i] - a + 1) % 1000000007; kl[1].v1 = s1, kl[1].v2 = s2; for (int i = k + 1; i <= 2 * n; i++) { s1 = (s1 - a1 * (c[i - k] - a + 1) % 998244353 + 998244353) % 998244353, s1 = (s1 * 237 % 998244353 + c[i] - a + 1) % 998244353; s2 = (s2 - a2 * (c[i - k] - a + 1) % 1000000007 + 1000000007) % 1000000007, s2 = (s2 * 237 % 1000000007 + c[i] - a + 1) % 1000000007; kl[i - k + 1].v1 = s1, kl[i - k + 1].v2 = s2; } for (int i = 1; i <= n; i++) { int u = i % k; if (vis[u]) continue; hh[make_pair(u, make_pair(kl[i].v1, kl[i].v2))]++; if (hh[make_pair(u, make_pair(kl[i].v1, kl[i].v2))] > h[make_pair(kl[i].v1, kl[i].v2)] || !h.count(make_pair(kl[i].v1, kl[i].v2))) vis[u] = 1; } pos = -1; for (int i = 0; i < k; i++) if (!vis[i]) { pos = i; break; } if (pos == -1) printf( NO ); else { printf( YES n ); if (!pos) pos = k; for (int i = pos; i <= n; i += k) printf( %d , b[mk[make_pair(kl[i].v1, kl[i].v2)]++].num); } return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M, K, P[105]; int main() { scanf( %d %d %d , &N, &M, &K); for (int i = 0; i < K; i++) scanf( %d , &P[i]); int ans = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { int x; scanf( %d , &x); int idx; for (int k = 0; k < K; k++) if (x == P[k]) { idx = k; break; } for (int k = idx; k > 0; k--) P[k] = P[k - 1]; P[0] = x; ans += idx + 1; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, N = 2e5 + 5; const long long inf = 1e18; inline int read() { int sum = 0, f = 1; char c = getchar(); while (c > 9 || c < 0 ) { if (c == - ) f = -f; c = getchar(); } while (c >= 0 && c <= 9 ) sum = sum * 10 + c - 48, c = getchar(); return sum * f; } int n, m, k, q, t[N][2], safe[N]; long long dp[N][2]; long long cost(int a, int b, int c, int d) { int pos = lower_bound(safe + 1, safe + q + 1, t[a][b]) - safe; long long ans = inf; if (pos <= q) ans = abs(t[a][b] - safe[pos]) + abs(t[c][d ^ 1] - safe[pos]) + abs(t[c][d] - t[c][d ^ 1]); pos = upper_bound(safe + 1, safe + q + 1, t[a][b]) - safe - 1; if (pos >= 1) ans = min(ans, (long long)abs(t[a][b] - safe[pos]) + abs(t[c][d ^ 1] - safe[pos]) + abs(t[c][d] - t[c][d ^ 1])); return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m >> k >> q; for (int i = 1; i <= k; i++) { int r, c; cin >> r >> c; if (t[r][0] == 0) t[r][0] = c; else t[r][0] = min(t[r][0], c); t[r][1] = max(t[r][1], c); } t[1][0] = 1, t[1][1] = max(t[1][1], 1); for (int i = 1; i <= q; i++) cin >> safe[i]; sort(safe + 1, safe + q + 1); for (int i = 2; i <= n; i++) dp[i][0] = dp[i][1] = inf; dp[1][0] = abs(t[1][1] - 1) * 2; dp[1][1] = abs(t[1][1] - 1); int pre = 1; for (int i = 2; i <= n; i++) { if (t[i][0] == 0) continue; for (int j = 0; j < 2; j++) { for (int k = 0; k < 2; k++) { dp[i][j] = min(dp[i][j], dp[pre][k] + i - pre + cost(pre, k, i, j)); } } pre = i; } long long ans = min(dp[pre][0], dp[pre][1]); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> int main() { char s[51]; scanf( %s , s); int i, tf, na = 0, t1 = strlen(s); if (t1 >= 1 && t1 <= 50) { for (i = 0; i < t1; i++) { if (s[i] == a ) { na = na + 1; } } if (2 * na > t1) { tf = t1; } else { tf = (2 * na) - 1; } printf( %d n , tf); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 131; int a[100002], rmp[100002], n, cnt, ans; unsigned int h[100002], p[100002]; vector<int> v[100002]; vector<pair<int, int> > del; map<int, int> mp; inline bool cmp(int x, int y) { int xe = y - 1, ye = 2 * y - x - 1; if (ye > n) return 0; int hx = h[xe] - h[x - 1] * p[y - x], hy = h[ye] - h[y - 1] * p[y - x]; return hx == hy; } inline int read() { int t = 0; char v = getchar(); while (v < 0 ) v = getchar(); while (v >= 0 ) t = (t << 3) + (t << 1) + v - 48, v = getchar(); return t; } int main() { p[0] = 1; n = read(); for (int i = 1; i <= n; ++i) { int x = read(); if (mp.find(x) != mp.end()) a[i] = mp[x]; else { mp[x] = ++cnt; a[i] = cnt; rmp[cnt] = x; } p[i] = p[i - 1] * M; v[a[i]].push_back(i); h[i] = h[i - 1] * M + a[i]; } for (int i = 1; i <= cnt; ++i) for (int j = 0; j < v[i].size(); ++j) for (int k = j + 1; k < v[i].size(); ++k) if (cmp(v[i][j], v[i][k])) del.push_back(make_pair(v[i][k] - v[i][j], v[i][j])); sort(del.begin(), del.end()); for (int i = 0; i < del.size(); ++i) if (del[i].second > ans) ans = del[i].second + del[i].first - 1; printf( %d n , n - ans); for (int i = ans + 1; i <= n; ++i) printf( %d , rmp[a[i]]); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int N, M; int arr[MAXN]; int dp[MAXN]; int main() { cin.tie(0); cin.sync_with_stdio(0); cin >> N >> M; int prv; cin >> prv; int lft = 1; for (int a = 2; a <= N; a++) { int cur; cin >> cur; if (prv <= cur) { } else { lft = a; } if (prv >= cur) { dp[a] = min(dp[a - 1], lft); } else { dp[a] = lft; } prv = cur; } while (M--) { int l, r; cin >> l >> r; if (l >= dp[r]) { cout << Yes n ; } else { cout << No n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int arr[100][100] = {0}; int n, x; cin >> n >> x; for (int i = 0; i < n; i++) { arr[i][i] = x; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << arr[i][j] << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int trn = 1 << (n + 1); trn--; int a[30000]; for (int i = 2; i <= trn; i++) cin >> a[i]; int q = 1 << n; int mx = 0; int leng[30000]; for (int i = q; i <= trn; i++) { leng[i] = 0; int j = i; while (j > 0) { leng[i] += a[j]; j /= 2; } mx = max(mx, leng[i]); } int add[30000]; for (int i = q; i <= trn; i++) add[i] = mx - leng[i]; for (int depth = n + 1; depth > 1; depth--) { q = 1 << (depth - 1); for (int i = q; i < q * 2; i += 2) { if ((add[i] > 0) && (add[i + 1] > 0)) { int t = min(add[i], add[i + 1]); add[i / 2] = t; add[i] = add[i] - t; add[i + 1] = add[i + 1] - t; } } } int ans = 0; for (int i = 0; i <= trn; i++) ans += add[i]; cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int N = 1e5 + 5; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } vector<vector<int> > ans; void solve(int n) { int i = 1, j = 2, k = 3; while (k <= n) { ans.push_back({i, j, k}); i += 2; j += 2; k += 2; } i = 1, j = 2, k -= 2; while (j < n - 1) { ans.push_back({i, j, k}); i += 2, j += 2; } } void solve() { int n; cin >> n; long long a[n]; long long x = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; x ^= a[i]; } if (n % 2 == 0) { if (x) { cout << NO n ; return; } else { solve(n - 1); } } else { solve(n); } cout << YES n ; cout << ans.size() << n ; for (auto v : ans) { printf( %d %d %d n , v[0], v[1], v[2]); } } signed main() { int t = 1; for (long long i = 1; i < t + 1; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> const int N = 1e5 + 5; int n, k, a[N]; int ans[N], top; int main() { scanf( %d%d , &n, &k); int sum = 0; for (int i = 1; i <= n; i++) scanf( %d , a + i), sum += a[i]; if (sum % k) return !printf( No ); int num = sum / k; top = 0; int now = 0, l = 1; for (int i = 1; i <= n; i++) { now += a[i]; if (now > num) return !printf( No ); if (now == num) { ans[++top] = i - l + 1; l = i + 1; now = 0; } } printf( Yes n ); for (int i = 1; i <= top; i++) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long long int n, m, t, q, a, b, c, h, d, x, y, z, i, j, k, ans = 0, ans2 = 0, cur = 0, cur2 = 0, sum = 0, sum2 = 0, maxn; string str = , str2, str3; cin >> t; while (t--) { cin >> n >> x >> y; if (abs(x - y) > 1) { cout << -1 n ; continue; } else if (x + y > n - 2) { cout << -1 n ; continue; } a = 1; b = n; if (x == y) { cout << 1 ; a++; for (i = 0; i < x; i++) { cout << b << << a << ; a++; b--; } for (i = a; i <= b; i++) cout << i << ; cout << n ; } else if (x > y) { for (i = 0; i < x; i++) { cout << a << << b << ; a++; b--; } for (i = b; i >= a; i--) cout << i << ; cout << n ; } else { for (i = 0; i < y; i++) { cout << b << << a << ; a++; b--; } for (i = a; i <= b; i++) cout << i << ; cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; long long A[100005], Nr[100005], Viz[100005]; vector<pair<long long, long long> > V[100005]; long long n; long long ans; long long DFSNR(long long x) { long long nrc = 1; Viz[x] = 1; for (auto i : V[x]) if (!Viz[i.first]) { nrc += DFSNR(i.first); } Nr[x] = nrc; return nrc; } void DFS(long long x, long long dist) { if (A[x] < dist) { ans += Nr[x]; return; } Viz[x] = 1; for (auto i : V[x]) if (!Viz[i.first]) { DFS(i.first, max(dist + i.second, i.second)); } } int main() { cin >> n; for (long long i = 1; i <= n; i++) cin >> A[i]; for (long long i = 1; i < n; i++) { long long x, y; cin >> x >> y; V[x].push_back({i + 1, y}); V[i + 1].push_back({x, y}); } DFSNR(1); memset(Viz, 0, sizeof(Viz)); DFS(1, 0); cout << ans; return 0; } |
#include <bits/stdc++.h> int w, n, m, c[1 << 12], id[1 << 12], f[531441]; int dfs(char* g, int s, int t) { if (!*g) return c[s] * f[t]; s <<= 1; t *= 3; switch (*g++) { case A : return dfs(g, s, t + 2) + dfs(g, s | 1, t); case O : return dfs(g, s, t); case X : return dfs(g, s, t) + dfs(g, s | 1, t + 1); case a : return dfs(g, s | 1, t + 1); case o : return dfs(g, s, t + 1) + dfs(g, s | 1, t + 2); case x : return dfs(g, s, t + 1) + dfs(g, s | 1, t); } } int main() { scanf( %d%d%d , &w, &n, &m); for (int i = 1; i < 1 << w; i++) id[i] = id[i / 2] * 3 + i % 2; while (n--) { int a; scanf( %d , &a); c[a]++; f[id[a]]++; } for (int i = 0, lim = 1; i < w; i++, lim *= 3) for (int s = 0; s < 1 << w; s += 1 << i + 1) for (int t = 0, j = id[s]; t < lim; t++, j++) f[j + lim * 2] += f[j] + f[j + lim]; while (m--) { char g[15]; scanf( %s , g); printf( %d n , dfs(g, 0, 0)); } } |
/* AUTHOR: lz.askey CREATED: 23.07.2021 13:57:23 LANG: C++11 */ #include <assert.h> #include <algorithm> #include <bitset> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <iostream> #include <iterator> #include <map> #include <new> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> using namespace std; typedef vector<int> vi; typedef pair<int, int> ii; typedef vector<pair<int, int> > vii; typedef long long ll; #define bit(x, i) (x & (1 << i)) #define in(i, l, r) (l < i && i < r) #define linr(i, l, r) (l <= i && i <= r) #define lin(i, l, r) (l <= i && i < r) #define inr(i, l, r) (l < i && i <= r) #define gi(a) scanf( %d , &a) #define gii(a, b) scanf( %d%d , &a, &b) #define giii(a, b, c) scanf( %d%d%d , &a, &b, &c) #define gs(x) scanf( %s , x) #define clr(a, x) memset(a, x, sizeof(a)) #define c2i(c) (c - 0 ) #define sz(x) ((int)((x).size())) #define all(c) (c).begin(), (c).end() #define mp make_pair #define pb push_back #define eb emplace_back #define ff first #define ss second // for debug #define what_is(x) cerr << Line << __LINE__ << : << #x << is << (x) << endl; #define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), , , ); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); } void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } #define REP(i, a, b) for (int i = int(a); i < int(b); i++) const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; // struct // data int m, k, ans1, ans2; ll a[1010][1010], c[1010]; ll x, y; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> m >> k; REP(i, 0, k) { REP(j, 0, m) { cin >> a[i][j]; c[i] += a[i][j]; } } x = (c[k - 1] - c[0]) / (k - 1); REP(i, 1, k) { if (c[i] - c[0] != x * i) { ans1 = i; y = c[i] - c[0] - x * i; break; } } REP(i, 1, k - 1) { if (i - 1 != ans1 && i != ans1 && i + 1 != ans1) { x = 0; REP(j, 0, m) { x += a[i - 1][j] * a[i - 1][j] + a[i + 1][j] * a[i + 1][j] - 2 * a[i][j] * a[i][j]; } break; } } ll ad = 0, mi = 0; REP(j, 0, m) { ad += a[ans1 - 1][j] * a[ans1 - 1][j] + a[ans1 + 1][j] * a[ans1 + 1][j]; mi += a[ans1][j] * a[ans1][j] * 2; } ad -= x; REP(i, 0, m) { ll temp = mi - a[ans1][i] * a[ans1][i] * 2 + (a[ans1][i] - y) * (a[ans1][i] - y) * 2; if (temp == ad) { ans2 = a[ans1][i] - y; break; } } cout << ans1 << << ans2 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; string s[102]; int main() { int n, i, cnt[27], j, k; cin >> n; for (i = 0; i < n; i++) cin >> s[i]; int ans = 0, temp, first, second, x, r; for (i = 1; i <= 26; i++) { for (j = 1; j <= 26; j++) { temp = 0; for (k = 0; k < n; k++) { memset(cnt, 0, sizeof(cnt)); x = 0; for (r = 0; r < s[k].size(); r++) { cnt[(int)s[k][r] - 96]++; } for (r = 1; r <= 26; r++) { if (cnt[r]) x++; } if (x <= 2) { int flag = 0; for (r = 1; r <= 26; r++) { if (cnt[r]) { if (r != i && r != j) flag = 1; } } if (flag == 0) temp += s[k].size(); } } ans = max(ans, temp); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; string ans[10] = { , , 2 , 3 , 223 , 5 , 53 , 7 , 7222 , 7332 }; int main() { int n; string s, a = ; cin >> n; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == 0 || s[i] == 1 ) continue; a += ans[(s[i] - 0 )]; } sort(a.begin(), a.end()); reverse(a.begin(), a.end()); cout << a << endl; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; void solve() { ll a, b, p; string s; cin >> a >> b >> p >> s; ll n = s.length(); s[n - 1] = s[n - 2]; vector<ll> cost(n, 0); if (s[n - 1] == A ) cost[n - 1] = a; else cost[n - 1] = b; for (int i = n - 2; i >= 0; i--) { if (s[i] != s[i + 1]) { if (s[i] == A ) cost[i] = cost[i + 1] + a; else cost[i] = cost[i + 1] + b; } else cost[i] = cost[i + 1]; } for (int i = 0; i < n; i++) if (cost[i] <= p) { cout << i + 1 << endl; return; } cout << n << endl; } int main() { int ___T; scanf( %d , &___T); for (int cs = 1; cs <= ___T; cs++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; typedef struct { int sum, l; bool f[55]; } node; queue<node> qu; node x, y; map<int, int> m; map<int, int>::iterator pos; int main() { int n, k, a[55], i, j, t; while (scanf( %d %d , &n, &k) != EOF) { for (i = 0; i < n; i++) scanf( %d , &a[i]); x.sum = x.l = 0; for (i = 0; i < 55; i++) x.f[i] = true; while (!qu.empty()) qu.pop(); qu.push(x); m.clear(); t = 0; while (!qu.empty()) { x = qu.front(); qu.pop(); for (i = 0; i < n; i++) { if (x.f[i]) { y.sum = x.sum + a[i]; pos = m.find(y.sum); if (pos != m.end()) continue; y.l = x.l + 1; for (j = 0; j < n; j++) y.f[j] = x.f[j]; y.f[i] = false; qu.push(y); m.insert(pair<int, int>(y.sum, 0)); printf( %d , y.l); for (j = 0; j < n; j++) if (!y.f[j]) printf( %d , a[j]); printf( n ); t++; if (t == k) break; } } if (t == k) break; } } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int a[maxn]; queue<int> q; queue<int> m; int main() { int n; scanf( %d , &n); int fu = 0; int maxfu = -0x3f3f3f3f; int idfu; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] < 0) { fu++; if (maxfu < a[i]) { maxfu = a[i]; idfu = i; } } } int flag = 0; if (fu % 2 != 0) { m.push(idfu); flag = 1; } for (int i = 1; i <= n; i++) { if (flag && i == idfu) continue; if (a[i] == 0) m.push(i); else q.push(i); } while (m.size() != 0) { if (m.size() == 1) { if (q.size() == 0) return 0; else printf( 2 %d n , m.front()); break; } else { int t1, t2; t1 = m.front(); m.pop(); t2 = m.front(); printf( 1 %d %d n , t1, t2); } } if (q.size() < 2) return 0; while (q.size() != 1) { int t1, t2; t1 = q.front(); q.pop(); t2 = q.front(); printf( 1 %d %d n , t1, t2); } } |
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; string ans = / ; while (T--) { string s; cin >> s; if (s[0] == p ) { cout << ans << endl; continue; } cin >> s; if (s[0] == / ) ans = s + / ; else ans += s + / ; while (1) { int flag = 1; int x = ans.find( .. ); if (x == -1) break; int c = 0; int i; for (i = x + 1; i >= 0; i--) { if (ans[i] == / ) { if (!flag) break; flag = 0; } c++; } ans.erase(i, c + 1); } } return 0; } |
#include <bits/stdc++.h> int deg[100000]; int xr[100000]; int edges[100000][2]; int main() { int n, t = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , °[i], &xr[i]); } for (int i = 0; i < n; i++) { if (deg[i] == 1) { int k = i; do { edges[t][0] = k; edges[t][1] = xr[k]; t++; deg[k] -= 1; xr[xr[k]] ^= k; deg[xr[k]] -= 1; k = xr[k]; } while (deg[k] == 1); } } printf( %d n , t); for (int i = 0; i < t; i++) printf( %d %d n , edges[i][0], edges[i][1]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, L = 1; cin >> n; int *a = new int[n]; for (int i = 0; i < n; i++) { cin >> a[i]; if (i != 0) { if (a[i] > a[L - 1]) L = i + 1; } } if (a[0] > a[L - 1]) L = 1; sort(a, a + n); cout << L << << a[n - 2]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6; long long int n, m, ans, col; vector<long long int> v[N], par(N), cola(N); set<long long int> se[N]; void dfs(long long int s, long long int p) { par[s] = p; col = 1; set<long long int> no, used; for (auto ic : se[s]) { if (se[p].find(ic) == se[p].end()) { no.insert(ic); } else { used.insert(cola[ic]); } } for (auto x : no) { while (used.find(col) != used.end()) col++; cola[x] = col; used.insert(col); ans = max(ans, col); } for (auto u : v[s]) if (u != p) { dfs(u, s); } } int main() { cin >> n >> m; for (long long int i = (long long int)1; i <= (long long int)n; i++) { long long int sz; cin >> sz; for (long long int j = (long long int)0; j <= (long long int)sz - 1; j++) { long long int x; cin >> x; se[i].insert(x); } } for (long long int i = (long long int)1; i <= (long long int)n - 1; i++) { long long int x, y, z; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dfs(1, 0); ans = max(ans, 1LL); cout << ans << n ; for (long long int i = (long long int)1; i <= (long long int)m; i++) cout << max(1LL, cola[i]) << ; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 0x3f3f3f3f3f3f3f3f; int32_t main() { long long n; cin >> n; vector<long long> v1, v2; long long i, j, ans = 0; for (i = 0; i < n; i++) { long long len; cin >> len; bool fg = true; long long mi = INT_MAX, mx = INT_MIN; for (j = 0; j < len; j++) { long long x; cin >> x; if (x > mi) { fg = false; } mi = min(mi, x); mx = max(mx, x); } if (fg) { v1.push_back(mi); v2.push_back(mx); } } sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end()); long long c = 0; for (auto x : v1) { auto p = upper_bound(v2.begin(), v2.end(), x) - v2.begin(); c += p; } ans = n * n - c; cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { int n, k; cin >> n >> k; vector<int> m(n), c(k + 1), cnt(k + 1, 0); for (int i = 0; i < n; i++) { cin >> m[i]; cnt[m[i]]++; } for (int i = 1; i <= k; i++) cin >> c[i]; for (int i = k - 1; i >= 1; i--) cnt[i] += cnt[i + 1]; sort(m.begin(), m.end()); int x, mx = 0; for (int i = 1; i <= k; i++) { x = cnt[i] / c[i]; if (cnt[i] % c[i] != 0) x++; mx = max(x, mx); } cout << mx << n ; vector<vector<int> > ans(mx); int j = 0; for (int i = n - 1; i >= 0; i--) { ans[j].push_back(m[i]); j = (j + 1) % mx; } for (int i = 0; i < mx; i++) { cout << ans[i].size() << ; for (auto x : ans[i]) cout << x << ; cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long x, sum; while (~scanf( %lld , &x)) { if (x < 0) x = -x; if (x == 2) printf( 3 n ); else if (x == 0) printf( 0 n ); else { for (long long i = 1; i <= x; i++) { sum = i * (i + 1) / 2; if (sum == x || (sum > x && ((sum - x) % 2 == 0))) { printf( %d n , i); break; } } } } } |
#include <bits/stdc++.h> using namespace std; void solve() { long long x, y, ans; cin >> x >> y; ans = (x / 2) * y; if (x % 2) ans += y / 2; cout << ans; } int32_t main() { ios_base::sync_with_stdio(false); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, x, m = 1e18; cin >> n; vector<long long> v; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); for (int i = 0; i < v.size() / 2; i++) { m = min(m, v[v.size() / 2 + i] - v[i]); } cout << m; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int MAXM = 1e5 + 5; struct EC { vector<pair<int, int> > has[2][MAXN]; int deg[2][MAXN], color[MAXM], c[2]; void prep(int d) { for (int i = 0; i < 2; i++) for (int j = 0; j < MAXN; j++) has[i][j].resize(d + 1, {0, 0}); } void dfs(int x, int p) { auto i = has[p][x][c[!p]]; if (has[!p][i.first][c[p]].second) dfs(i.first, !p); else has[!p][i.first][c[!p]] = {0, 0}; has[p][x][c[p]] = i, has[!p][i.first][c[p]] = {x, i.second}; color[i.second] = c[p]; } int solve(vector<pair<int, int> > &e, vector<int> &res) { int m = ((int)e.size()), ans = 0; for (int i = 0; i < m; i++) ans = max({ans, ++deg[0][e[i].first + 1], ++deg[1][e[i].second + 1]}); prep(ans); for (int i = 0; i < m; i++) { int x[2] = {e[i].first + 1, e[i].second + 1}; for (int d = 0; d < 2; d++) for (c[d] = 1; has[d][x[d]][c[d]].second; c[d]++) ; if (c[0] != c[1]) dfs(x[1], 1); for (int d = 0; d < 2; d++) has[d][x[d]][c[0]] = {x[!d], i + 1}; color[i + 1] = c[0]; } res.resize(m); for (int i = 0; i < m; i++) res[i] = color[i + 1]; return ans; } } ec; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int a, b, m; cin >> a >> b >> m; vector<pair<int, int> > e; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; e.push_back({x - 1, y - 1}); } vector<int> res; cout << ec.solve(e, res) << n ; for (auto x : res) cout << x << ; cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, sum = 0, curr = 0, j = 0; vector<long long int> a(100000), res; cin >> n >> k; for (long long int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } if (sum % k) { cout << No ; } else { for (long long int i = 0; i < n; i++) { curr += a[i]; if (curr == sum / k) { res.push_back(i + 1 - j); j = i + 1; curr = 0; } } if (res.size() == k) { cout << Yes << endl; for (long long int i = 0; i < k; i++) { cout << res[i] << ; } } else cout << No ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, s = 2, ans = 0, i; cin >> n; if (n < 2) { cout << 0; return 0; } for (i = 1; i <= 1e6; ++i) { if (s > n) break; if ((n - s) % 3 == 0) ++ans; s += 3 * i + 2; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; struct point { double x, y; point() { x = y = 0.0; } point(double A, double B) { x = A, y = B; } double operator*(point B) { return x * B.x + y * B.y; } point turn(double A) { return point(x * cos(A) - y * sin(A), y * cos(A) + x * sin(A)); } } zero, e, s, t; double ans, L1, L2, L3, L4, ev, ew, sv, r; double dis(point &A, point &B) { return sqrt(((B.x - A.x) * (B.x - A.x)) + ((B.y - A.y) * (B.y - A.y))); } bool check(double mid) { double A, B, C; t = e.turn(ew * mid); L2 = dis(t, zero); L4 = sqrt(((L2) * (L2)) - ((r) * (r))); C = acos(t * s / L1 / L2); A = acos(r / L1); B = acos(r / L2); if (A + B - C > 1e-8) { if (sv * mid - dis(s, t) > 1e-8) return true; return false; } else { C -= A + B; if (sv * mid - C * r - L3 - L4 > 1e-8) return true; return false; } } int main() { scanf( %lf%lf%lf , &e.x, &e.y, &ev); double R = dis(e, zero); ew = ev / R; scanf( %lf%lf%lf%lf , &s.x, &s.y, &sv, &r); L1 = dis(s, zero); L3 = sqrt(((L1) * (L1)) - ((r) * (r))); double l = 0, r = dis(s, e); while (r - l > 1e-8) { double mid = (l + r) / 2.0; if (check(mid)) ans = mid, r = mid; else l = mid; } printf( %lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1234567]; int w[1234567]; int main() { int n, m, q, i; while (scanf( %d%d , &n, &m) != EOF) { int k = 0; memset(a, 0, sizeof(a)); for (i = 0; i < n; i++) { scanf( %d , &q); if (q < 1234560) a[q] = 1; } i = 1; while (1) { if (m < i) break; if (a[i] == 0 && m >= i) { m -= i; w[k++] = i; } i++; } if (m != 0) { for (i = m + w[k - 1]; i >= w[k - 1]; i--) { if (a[i] == 0) { w[k - 1] = i; break; } } } printf( %d n , k); for (i = 0; i < k; i++) printf( %d%c , w[i], i == k - 1 ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9; int n, m; long long a[200100], fibo[200100], sumfibo[200100]; struct Segment_Tree { int left, right, len; long long s0, s1; } tree[200100 << 2]; struct Data { long long a[2][2]; } bb[200100], one, b; Data operator*(const Data x, const Data y) { Data res; res.a[0][0] = (x.a[0][0] * y.a[0][0] % mod + x.a[0][1] * y.a[1][0] % mod) % mod; res.a[0][1] = (x.a[0][0] * y.a[0][1] % mod + x.a[0][1] * y.a[1][1] % mod) % mod; res.a[1][0] = (x.a[1][0] * y.a[0][0] % mod + x.a[1][1] * y.a[1][0] % mod) % mod; res.a[1][1] = (x.a[1][0] * y.a[0][1] % mod + x.a[1][1] * y.a[1][1] % mod) % mod; return res; } long long cal_fx(long long s0, long long s1, int l) { long long res; res = (bb[l - 1].a[0][0] * s1 % mod + bb[l - 1].a[0][1] * s0 % mod) % mod; return res; } void plant_tree(int id, int l, int r) { tree[id].left = l, tree[id].right = r; tree[id].len = r - l + 1; if (l == r) { tree[id].s0 = fibo[0] * a[l] % mod; tree[id].s1 = fibo[1] * a[l] % mod; return; } int mid = (l + r) >> 1; plant_tree(id << 1, l, mid); plant_tree(id << 1 | 1, mid + 1, r); tree[id].s0 = (tree[id << 1].s0 + cal_fx(tree[id << 1 | 1].s0, tree[id << 1 | 1].s1, tree[id << 1].len)) % mod; tree[id].s1 = (tree[id << 1].s1 + cal_fx(tree[id << 1 | 1].s0, tree[id << 1 | 1].s1, tree[id << 1].len + 1)) % mod; } void push_down() {} void update_pos(int id, int pos, long long val) { if (tree[id].left == tree[id].right) { tree[id].s0 = fibo[0] * val % mod; tree[id].s1 = fibo[1] * val % mod; return; } int mid = (tree[id].left + tree[id].right) >> 1; if (pos <= mid) update_pos(id << 1, pos, val); else update_pos(id << 1 | 1, pos, val); tree[id].s0 = (tree[id << 1].s0 + cal_fx(tree[id << 1 | 1].s0, tree[id << 1 | 1].s1, tree[id << 1].len)) % mod; tree[id].s1 = (tree[id << 1].s1 + cal_fx(tree[id << 1 | 1].s0, tree[id << 1 | 1].s1, tree[id << 1].len + 1)) % mod; } Segment_Tree query(int id, int l, int r) { if (tree[id].left == l && tree[id].right == r) { return tree[id]; } int mid = (tree[id].left + tree[id].right) >> 1; if (r <= mid) return query(id << 1, l, r); else if (mid < l) return query(id << 1 | 1, l, r); else { Segment_Tree leftson, rightson, now; leftson = query(id << 1, l, mid); rightson = query(id << 1 | 1, mid + 1, r); now.s0 = (leftson.s0 + cal_fx(rightson.s0, rightson.s1, leftson.len)) % mod; now.s1 = (leftson.s1 + cal_fx(rightson.s0, rightson.s1, leftson.len + 1)) % mod; now.len = leftson.len + rightson.len; return now; } } int main() { fibo[0] = fibo[1] = 1; for (int i = 2; i < 200100; i++) { fibo[i] = (fibo[i - 2] + fibo[i - 1]) % mod; } sumfibo[0] = fibo[0]; for (int i = 1; i < 200100; i++) { sumfibo[i] = (sumfibo[i - 1] + fibo[i]) % mod; } one.a[0][0] = one.a[1][1] = 1; one.a[1][0] = one.a[0][1] = 0; b.a[0][0] = b.a[0][1] = b.a[1][0] = 1; b.a[1][1] = 0; bb[0] = one; for (int i = 1; i < 200100; i++) { bb[i] = bb[i - 1] * b; } scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %lld , a + i); } plant_tree(1, 1, n); while (m--) { int type; scanf( %d , &type); if (type == 1) { int x, v; scanf( %d %d , &x, &v); update_pos(1, x, v); } else if (type == 2) { int l, r; scanf( %d %d , &l, &r); Segment_Tree res = query(1, l, r); printf( %lld n , res.s0); } else if (type == 3) { int l, r, d; scanf( %d %d %d , &l, &r, &d); } } } |
#include <bits/stdc++.h> long a[2200]; long absl(long k) { if (k < 0) { k = 0 - k; } return k; } int main() { long i, j, n, ans, l, r; scanf( %ld , &n); for (i = 0; i < n; i++) { scanf( %ld , a + i); a[i] = absl(a[i]); } for (i = 0, ans = 0; i < n; i++) { for (j = 0, l = 0; j < i; j++) { if (a[j] < a[i]) { l++; } } for (j = i + 1, r = 0; j < n; j++) { if (a[j] < a[i]) { r++; } } if (l > r) { ans += r; } else { ans += l; } } printf( %ld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char a[500001], b[500001]; int nxt[500000]; int c[2], la, lb; int kmp() { nxt[0] = -1; if (lb == 0) { return 0; } int no = -1; for (int i = 1; i < lb; i++) { while (no != -1 && b[no + 1] != b[i]) { no = nxt[no]; } if (b[no + 1] == b[i]) { no++; } nxt[i] = no; } return nxt[lb - 1] + 1; } void solve() { scanf( %s%s , a, b); c[0] = c[1] = 0; la = strlen(a); lb = strlen(b); for (int i = 0; i < la; i++) { c[a[i] - 0 ]++; } int add = kmp(); for (int i = 0; i < lb; i++) { c[b[i] - 0 ]--; if (c[b[i] - 0 ] < 0) { printf( %s n , a); return; } } printf( %s , b); int c0 = 0, c1 = 0; for (int i = add; i < lb; i++) { if (b[i] == 0 ) { c0++; } else { c1++; } } while (c[0] >= c0 && c[1] >= c1) { c[0] -= c0; c[1] -= c1; for (int i = add; i < lb; i++) { putchar(b[i]); } } while (c[0]-- > 0) { putchar( 0 ); } while (c[1]-- > 0) { putchar( 1 ); } printf( n ); } int main() { solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; struct node { int to, next; } p[N << 2]; int head[N], tot, n, now[N], du[N]; bool vis[N], isok; vector<pair<int, int> > a; void add(int x, int y) { p[++tot] = (node){y, head[x]}; head[x] = tot; p[++tot] = (node){x, head[y]}; head[y] = tot; } inline void del(int x, int fa) { du[fa]--; vis[x] = 1; for (int i = head[x]; i; i = p[i].next) { int y = p[i].to; if (vis[y] || y == fa) continue; del(y, x); } } inline void dfs(int x, int fa) { int son = 0, id = 0; for (int i = head[x]; i; i = p[i].next) { int y = p[i].to; if (vis[y] || y == fa) continue; dfs(y, x); if (~now[y]) son++, id = y; else son += 2; } if (!son) { now[x] = 1; return; } if (son == 1) { now[x] = (~now[id] ? now[id] : -2) + 1; return; } a.clear(); for (int i = head[x]; i; i = p[i].next) { int y = p[i].to; if (vis[y] || y == fa || now[y] == -1) continue; a.push_back(make_pair(now[y], y)); } sort(a.begin(), a.end()); int m = a.size(); for (int i = 0; i < m; i++) { int r = i; while (r < m && a[r].first == a[i].first) r++; for (int j = i + 1; j < r; j++) del(a[j].second, x), isok = 1; i = r - 1; } now[x] = -1; } int check() { for (int i = 1; i <= n; i++) if (du[i] > 2) return i; return -1; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y); du[x]++; du[y]++; } while (1) { int root = check(); isok = 0; if (root == -1) break; dfs(root, -1); if (!isok) break; } if (check() == -1) { int ans = n - 1; for (int i = 1; i <= n; i++) ans -= vis[i]; while (ans % 2 == 0) ans /= 2; printf( %d n , ans); } else puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; const int mod = 998244353; long long f[5009]; long long c[5009][5009]; long long ch(int a, int b) { long long sum = 0; for (int i = 0; i <= a && i <= b; i++) { sum += ((c[a][i] * c[b][i] % mod) * f[i] % mod); } return sum % mod; } int main() { f[0] = f[1] = 1; for (int i = 2; i <= 5000; i++) { f[i] = f[i - 1] * i % mod; } for (int i = 1; i <= 5000; i++) { c[i][0] = c[i][i] = 1; for (int j = 1; j < i; j++) { c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod; } } int a, b, c; while (~scanf( %d%d%d , &a, &b, &c)) { long long ans = 1; ans = ans * ch(a, b); ans %= mod; ans = ans * ch(a, c); ans %= mod; ans = ans * ch(b, c); ans %= mod; printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000; int k; int n; vector<int> v; int read() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { int t; scanf( %d , &t); v.push_back(t); } sort(v.begin(), v.end()); printf( %d , v[n - k]); return 0; } int process() { return 0; } int main() { read(); process(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; template <typename T> void chkmin(T &x, T y) { if (y < x) x = y; } template <typename T> void chkmax(T &x, T y) { if (y > x) x = y; } template <typename T> void upd(T &x, T y) { if ((x += y) >= mod) x -= mod; } int n, m, K, N, sl, fh, a[510][510]; int rd() { sl = 0; fh = 1; char ch = getchar(); while (ch < 0 || 9 < ch) { if (ch == - ) fh = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) sl = sl * 10 + ch - 0 , ch = getchar(); return sl * fh; } int main() { ios::sync_with_stdio(false); K = rd(); for (N = 1; N <= K; N <<= 1) ; a[1][1] = a[1][2] = a[1][3] = (N << 1) - 1; a[3][1] = a[3][2] = a[3][3] = (N << 1) - 1; a[2][3] = a[3][4] = K; a[2][1] = N; a[2][2] = N << 1; n = 3; m = 4; printf( %d %d n , n, m); for (int i = 1; i <= n; ++i, puts( )) for (int j = 1; j <= m; ++j) printf( %d , a[i][j]); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = (1 << 29) + 5; const long long int LLINF = (1ll << 59) + 5; const int MOD = 1000 * 1000 * 1000 + 7; int n, q; pair<string, string> arr[228]; map<string, bool> can; queue<string> now; int main() { cin >> n >> q; string st1, st2; for (int i = 0; i < q; ++i) { cin >> arr[i].first >> arr[i].second; } now.push( a ); string dd; string next; while (!now.empty()) { dd = now.front(); now.pop(); if (dd.size() >= 6) continue; for (int i = 0; i < q; ++i) { if (dd[0] == arr[i].second[0]) { next = arr[i].first + dd.substr(1, (int)dd.size() - 1); if (!can[next]) { can[next] = true; now.push(next); } } } } int answer = 0; for (auto it = can.begin(); it != can.end(); ++it) { if (it->first.size() == n) { ++answer; } } cout << answer; fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> long long int fact[200010]; long long int power(long long int a, long long int b) { long long int ans = 1; long long int k = a; while (b) { if (b % 2 == 1) ans *= k, ans %= 1000000007; b /= 2; k *= k, k %= 1000000007; } return ans; } long long int inv(long long int k) { return power(k, 1000000007 - 2); } long long int comb(int s, int t) { long long int ans = fact[s]; ans *= inv(fact[s - t]), ans %= 1000000007; ans *= inv(fact[t]), ans %= 1000000007; return ans; } long long int x[200010], y[200010]; int main() { fact[0] = 1; for (int i = 1; i <= 200000; i++) fact[i] = fact[i - 1] * i, fact[i] %= 1000000007; int a; scanf( %d , &a); for (int i = 1; i <= a; i++) scanf( %lld , &x[i]); if (a == 1) { printf( %lld , x[1]); return 0; } if (a % 2 == 1) { int sign = 1; for (int i = 1; i < a; i++) y[i] = x[i] + sign * x[i + 1], sign *= -1; for (int i = 1; i < a; i++) x[i] = (y[i] + 1000000007) % 1000000007; a--; } long long int ans = 0; if (a % 4 == 2) { int t = (a - 2) / 2; for (int i = 1; i <= a; i += 2) { ans += (x[i] * comb(t, (i - 1) / 2)) % 1000000007; ans %= 1000000007; ans += (x[i + 1] * comb(t, (i - 1) / 2)) % 1000000007; ans %= 1000000007; } } else { int t = (a - 2) / 2; for (int i = 1; i <= a; i += 2) { ans += (x[i] * comb(t, (i - 1) / 2)) % 1000000007; ans %= 1000000007; ans -= (x[i + 1] * comb(t, (i - 1) / 2)) % 1000000007; ans += 1000000007; ans %= 1000000007; } } printf( %lld , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (i == j) cout << 0 << ; else if (min(i, j) == 0) cout << 2 * (i + j) % (n - 1) + 1 << ; else cout << (i + j) % (n - 1) + 1 << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool isprime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i += 6) { if (n % i == 0 || n % (i + 2) == 0) return false; } return true; } long long int smallestfactor(long long int n) { for (long long int i = 2; i <= sqrt(n); i++) { if (n % i == 0) { long long int x = min(i, n / i); return x; } } } int main() { long long int n; cin >> n; long long int ans = 0; while (1) { ans += n; if (isprime(n)) { ans++; break; } long long int temp = smallestfactor(n); n /= temp; if (n == 1) { ans++; break; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long P(long long m, long long n); long long pi(long long x); long long phi(long long m, long long n); bool isprm[400005]; int cntprm[400005]; vector<long long> prm; void Init() { for (int i = 2; i <= 400000; ++i) { isprm[i] = true; } for (int i = 2; i <= 400000; ++i) { cntprm[i] = cntprm[i - 1] + isprm[i]; if (isprm[i]) { prm.push_back(i); for (int j = i + i; j <= 400000; j += i) isprm[j] = false; } } } long long sol(long long x) { long long ans = 0; long long sq = sqrt(x); for (int i = 0; i < (int)prm.size() && prm[i] <= sq; ++i) { long long a = prm[i], b = x / a; if (b <= 400000) ans += cntprm[b] - cntprm[a]; else { ans += pi(b) - cntprm[a]; } } return ans; } int main(void) { long long n; Init(); cin >> n; cout << cntprm[(int)cbrt(n)] + sol(n) << n ; } long long phi(long long m, long long n) { if (m) { if (n) { if (m <= prm[n - 1]) return 1; else { if (prm[n - 1] * prm[n - 1] >= m) return pi(m) - n + 1; else return phi(m, n - 1) - phi(m / prm[n - 1], n - 1); } } else { return m; } } else { return 0; } } long long P(long long m, long long n) { long long res = 0, sq = sqrt(m); for (int i = n; i < (int)prm.size() && prm[i] <= sq; ++i) { auto num = prm[i]; res += pi(m / num) - pi(num) + 1; } return res; } long long pi(long long x) { if (x <= 400000) return cntprm[x]; else { long long n = pi(ceil(cbrt(x))), m = x; return phi(m, n) + n - 1 - P(m, n); } } |
#include <bits/stdc++.h> using namespace std; string numToBinary(int n, int digits) { string s; while (n) { int bil = n % 2; n /= 2; s += (bil + 0 ); } while (s.size() < digits) { s += 0 ; } reverse(s.begin(), s.end()); return s; } long long computeInv(const vector<int>& a) { int sz = a.size(); int suff[sz + 1], i; suff[sz] = 0; for (i = sz - 1; i >= 0; i--) { suff[i] = suff[i + 1]; if (a[i] == 0) { suff[i]++; } } long long ans = 0; for (i = 0; i < sz; i++) { if (a[i] == 1) { ans += suff[i + 1]; } } return ans; } void cetak(const vector<int>& a) { for (int i = 0; i < a.size(); i++) { printf( %d , a[i]); } printf( n ); } int main() { int n, i, j; int a[300001]; while (scanf( %d , &n) != EOF) { for (i = 0; i < n; i++) { scanf( %d , &a[i]); } vector<vector<int> > groups; vector<int> awalMula; for (i = 0; i < n; i++) { awalMula.push_back(i); } groups.push_back(awalMula); int sor = 0; long long numInv = 0; for (i = 29; i >= 0; i--) { long long invXor = 0; long long invOri = 0; for (j = 0; j < groups.size(); j++) { vector<int> inv, asli; for (int k = 0; k < groups[j].size(); k++) { int idx = groups[j][k]; if ((1 << i) & a[idx]) { asli.push_back(1); inv.push_back(0); } else { asli.push_back(0); inv.push_back(1); } } invOri += computeInv(asli); invXor += computeInv(inv); } if (invXor < invOri) { sor += (1 << i); for (j = 0; j < n; j++) { a[j] ^= (1LL << i); } numInv += invXor; } else { numInv += invOri; } vector<vector<int> > newGroups; for (j = 0; j < groups.size(); j++) { vector<int> group0, group1; for (int k = 0; k < groups[j].size(); k++) { int idx = groups[j][k]; int nilai; if ((1 << i) & a[idx]) { group1.push_back(idx); } else { group0.push_back(idx); } } if (group1.size()) { newGroups.push_back(group1); } if (group0.size()) { newGroups.push_back(group0); } } groups = newGroups; } printf( %lld %d n , numInv, sor); } return 0; }; |
#include <bits/stdc++.h> using namespace std; const int maxn = 150000 + 7; const long long mod = 1e9 + 7; const long long INF = 5e18 + 7; const int inf = 1e9 + 7; const long long maxx = 1e6 + 700; int main() { int n, m, i; scanf( %d%d , &n, &m); i = max(2 * n, 3 * m); while (i / 2 + i / 3 - i / 6 < n + m || i / 2 < n || i / 3 < m) { i++; } printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 10010; const int M = 15; const double eps = 1e-7; const int INF = 1 << 30; int n; struct node { double x, y, z; node() { x = y = z = 0; } node(double xx, double yy, double zz) { x = xx; y = yy; z = zz; } } poy[N], ori; double vp, vs, prelen; int ln; double ABS(double x) { while (x < 0) x = -x; return x; } double dist(node a, node b) { double tmp = 0; tmp += (a.x - b.x) * (a.x - b.x); tmp += (a.y - b.y) * (a.y - b.y); tmp += (a.z - b.z) * (a.z - b.z); return sqrt(tmp); } void init() { double x, y, z; for (int i = 1; i <= n + 1; i++) { cin >> x >> y >> z; poy[i] = node(x, y, z); } cin >> vp >> vs; cin >> x >> y >> z; ori = node(x, y, z); } bool solve() { double t = 0; for (int i = 2; i <= n + 1; i++) { double len = dist(ori, poy[i]) / vp; double edge = dist(poy[i - 1], poy[i]) / vs; t += edge; if ((t - len) >= -eps) { ln = i; prelen = t - edge; return 1; } } return 0; } node getmid(node a, node b) { double xx, yy, zz; xx = (a.x + b.x) * 0.5; yy = (a.y + b.y) * 0.5; zz = (a.z + b.z) * 0.5; return node(xx, yy, zz); } void cal() { node pre = poy[ln - 1]; node l = poy[ln - 1], r = poy[ln]; double t; while (ABS(dist(l, r)) > eps) { node mid = getmid(l, r); double len1 = dist(ori, mid); double len2 = dist(mid, pre); double t1 = len1 / vp; double t2 = len2 / vs + prelen; t = t1; if ((t1 - t2) < 1e-15) r = mid; else l = mid; } printf( %.10lf n%.10lf %.10lf %.10lf n , t, l.x, l.y, l.z); } int main() { while (cin >> n) { init(); if (solve()) cout << YES << endl; else { cout << NO << endl; continue; } cal(); } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = 1e9 + 7; template <typename S, typename T> inline bool Min(S &a, const T &b) { return a > b ? a = b, true : false; } template <typename S, typename T> inline bool Max(S &a, const T &b) { return a < b ? a = b, true : false; } template <typename S, typename T> inline void Adm(S &a, const T &b) { a = (a + b) % MOD; if (a < 0) a += MOD; } template <typename S, typename T> inline void Mum(S &a, const T &b) { a = 1LL * a * b % MOD; } template <typename T> inline bool IsPri(T x) { if (x < 2) return false; for (T i = 2; i * i <= x; ++i) if (x % i == 0) return false; return true; } template <typename T> inline T Gcd(T a, T b) { while (b) { T t = b; b = a % b; a = t; } return a; } template <typename T> inline int BitCnt(T x) { int cnt = 0; while (x) ++cnt, x &= x - 1; return cnt; } template <typename T> inline T MDis(T x1, T y1, T x2, T y2) { return abs(x1 - x2) + abs(y1 - y2); } template <typename T> inline T MDis(T x1, T y1, T z1, T x2, T y2, T z2) { return abs(x1 - x2) + abs(y1 - y2) + abs(z1 - z2); } inline double EDis(double x1, double y1, double x2, double y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); } inline double EDis(double x1, double y1, double z1, double x2, double y2, double z2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2)); } inline long long Pow(long long a, long long n) { long long t = 1; a %= MOD; while (n > 0) { if (n & 1) t = t * a % MOD; a = a * a % MOD, n >>= 1; } return t % MOD; } inline int read() { static char buf[1000000], *p1 = buf, *p2 = buf; register int x = false; register char ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; register bool sgn = false; while (ch != - && (ch < 0 || ch > 9 )) ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; if (ch == - ) sgn = true, ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; while (ch >= 0 && ch <= 9 ) x = (x << 1) + (x << 3) + (ch ^ 48), ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; return sgn ? -x : x; } const int N = 1e3; int n, m; vector<int> dz; vector<int> e[N]; int son(int x) { int res = 0, y = x; while (y <= n) { res += min(x, n) - y + 1; x = x << 1 | 1, y = y << 1; } return res; } long long ans; int w[N]; void DFS1(int x, int fz) { w[x] = son(dz[x]); for (int y : e[x]) if (y != fz) { w[x] -= son(dz[y]); DFS1(y, x); } } bool vis[N]; void DFS2(int x, int rt) { vis[x] = 1; Adm(ans, 1LL * w[rt] * w[x]); for (int y : e[x]) if (!vis[y]) DFS2(y, rt); vis[x] = 0; } int main() { cin >> n >> m; dz.push_back(1), dz.push_back(INT_MAX); vector<pair<int, int> > edge; for (int i = 0; i < m; ++i) { int u, v; scanf( %d%d , &u, &v); edge.push_back({u, v}); while (u) dz.push_back(u), u >>= 1; while (v) dz.push_back(v), v >>= 1; } (dz).push_back(INT_MIN), sort((dz).begin(), (dz).end()), (dz).erase(unique((dz).begin(), (dz).end()), (dz).end()); for (int i = 1; i < ((int)(dz).size()) - 1; ++i) { for (int j = dz[i] * 2; j <= dz[i] * 2 + 1; ++j) if (dz[(lower_bound(dz.begin(), dz.end(), (j)) - dz.begin())] == j) e[i].push_back((lower_bound(dz.begin(), dz.end(), (j)) - dz.begin())), e[(lower_bound(dz.begin(), dz.end(), (j)) - dz.begin())].push_back( i); } DFS1(1, 0); for (auto it : edge) e[(lower_bound(dz.begin(), dz.end(), (it.first)) - dz.begin())].push_back( (lower_bound(dz.begin(), dz.end(), (it.second)) - dz.begin())), e[(lower_bound(dz.begin(), dz.end(), (it.second)) - dz.begin())] .push_back( (lower_bound(dz.begin(), dz.end(), (it.first)) - dz.begin())); for (int i = 1; i < ((int)(dz).size()) - 1; ++i) DFS2(i, i); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char q[7][50] = { Anka , Chapay , Cleo , Troll , Dracul , Snowy , Hexadecimal }; map<string, int> h; int a[3], u[7], v[3], w[7], r, rb, m[7][7]; void upd() { int i, mx, mn, j, k; for (i = 0; i < 3; v[i] = 0, i++) ; for (i = 0; i < 7; v[u[i]]++, i++) ; for (i = 0; i < 3; i++) if (!v[i]) return; for (i = 0; i < 7; w[i] = a[u[i]] / v[u[i]], i++) ; for (mx = w[0], mn = w[0], i = 1; i<7; mx = w[i]> mx ? w[i] : mx, mn = w[i] < mn ? w[i] : mn, i++) ; for (k = 0, i = 0; i < 7; i++) for (j = 0; j < 7; k += m[i][j] && u[i] == u[j], j++) ; if (mx - mn < r || (mx - mn == r && k > rb)) { r = mx - mn; rb = k; } } void rec(int i) { if (i == 7) upd(); else for (u[i] = 0; u[i] < 3; rec(i + 1), u[i]++) ; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0), cerr << ; int i, j, t; char s[100]; for (i = 0; i < 7; h[q[i]] = i, i++) ; for (cin >> t; t--;) { cin >> s; i = h[s]; cin >> s >> s; j = h[s]; m[i][j] = 1; } for (i = 0; i < 3; cin >> a[i], i++) ; r = 2000000010; rec(0); cout << r << << rb << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxprime = 2750131; int prime[mxprime + 1], res; int func(int n) { for (int i = 2; i * i <= n; i++) if (n % i == 0) return n / i; } vector<int> ord(mxprime, false); int vc[500001]; int main() { int n; cin >> n; prime[1] = true; map<int, int> mp; for (int i = 2; i * i <= mxprime; i++) { if (!prime[i]) { for (int j = i * i; j <= mxprime; j += i) { prime[j] = true; } } } for (int i = 2; i <= mxprime; i++) { if (!prime[i]) { ord[i] = ++res; } } vector<int> a; n = n * 2; for (int i = 1; i <= n; i++) { cin >> vc[i]; mp[vc[i]]++; } sort(vc + 1, vc + n + 1, greater<int>()); for (int i = 1; i <= n; i++) { if (!mp[vc[i]]) continue; if (!prime[vc[i]]) { a.push_back(ord[vc[i]]); mp[ord[vc[i]]]--; } else { a.push_back(vc[i]); mp[func(vc[i])]--; } mp[vc[i]]--; } for (int i = 0; i < a.size(); i++) { cout << a[i] << ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int c1 = 0, n, t; cin >> n; for (int i = 0; i < n; i++) { cin >> t; if (t % 2 == 1) { c1++; } } cout << min(c1, n - c1 + (2 * c1 - n) / 3) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int T, n, a, b, c; string s; int shi, bu, jian; int main() { cin >> T; while (T--) { shi = bu = jian = 0; cin >> n; cin >> a >> b >> c; cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == R ) shi++; else if (s[i] == P ) bu++; else jian++; } if (min(a, jian) + min(b, shi) + min(c, bu) < (n + 1) / 2) { cout << NO << endl; continue; } cout << YES << endl; string t = ; for (int i = 0; i < s.length(); i++) { if (s[i] == R && b) { t += P ; b--; } else if (s[i] == P && c) { t += S ; c--; } else if (s[i] == S && a) { a--; t += R ; } else { t += _ ; } } for (int i = 0; i != n; ++i) { if (t[i] != _ ) continue; if (a) { t[i] = R ; a--; } else if (b) { t[i] = P ; b--; } else { t[i] = S ; c--; } } cout << t << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 * 100 + 3, inf = 1000 * 1000 * 100; int n, m, a[MAXN], b[MAXN], t[MAXN], ans = 0, y, z; int main() { cin >> n >> m >> y >> z; for (int i = 0; i < n; i++) cin >> a[i]; b[0] = -inf; b[m + 1] = inf; for (int i = 1; i <= m; i++) cin >> b[i]; for (int i = 0; i <= m; i++) t[i] = -1; for (int i = 0; i < n; i++) { int ind = lower_bound(b, b + m + 2, a[i]) - b; int nex = b[ind], prev = b[ind - 1]; if (nex - a[i] < a[i] - prev) { if (t[ind] != -1) ans++; t[ind] = nex - a[i]; } else if (nex - a[i] > a[i] - prev) { if (t[ind - 1] != -1 && t[ind - 1] < a[i] - prev) { ans++; } else { if (t[ind - 1] > a[i] - prev) ans++; t[ind - 1] = a[i] - prev; } } else { if (t[ind - 1] == -1 || t[ind - 1] == a[i] - prev) { t[ind - 1] = a[i] - prev; } else { t[ind] = nex - a[i]; } } } cout << ans << endl; return 0; } |
/* * yaswanth phani kommineni */ #include <bits/stdc++.h> using namespace std; typedef long long int ll; #define endl n ; void solve(){ ll n; cin >> n; n*=2; vector <ll> v(n); map <ll,ll> m; for(ll i=0;i<n;i++){ cin >> v[i]; m[v[i]]++; } sort(v.begin(),v.end()); for(ll i=0;i<n-1;i++){ auto mp = m; auto V = v; vector <pair<ll,ll>> ans; ans.push_back(make_pair(v[n-1],v[i])); mp[v[n-1]]--; mp[v[i]]--; ll cur = v[n-1]; while(true){ while(!V.empty() && !mp[V.back()]){ V.pop_back(); } if(V.empty()) break; ll last = V.back(); mp[last]--; if(!mp[cur-last]){ break; } ans.push_back(make_pair(last,cur-last)); mp[cur-last]--; cur = last; } if((ll)ans.size()==n/2){ cout << YES << endl; cout << ans.front().first + ans.front().second << endl; for(auto x : ans){ cout << x.second << << x.first << endl; } return; } } cout << NO << endl; } int main(){ //freopen( input.txt , r ,stdin); //freopen( output.txt , w ,stdout); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tc; tc = 1; cin >> tc; for(int i=1;i<=tc;i++){ solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int toDelete = 0, arr[1500010], N; int main() { cin.sync_with_stdio(0); cin.tie(0); cin >> N; for (int i = 0; i < N; ++i) { int x; cin >> x; arr[x]++; } int ans = 0; for (int i = 0; i <= 1500000; ++i) { int val = arr[i]; int id = i; arr[i] = 0; while (val > 0) { arr[id] += val % 2; id++; val /= 2; } if (arr[i]) ans++; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& out, vector<T>& v) { out << [ ; for (auto k : v) out << k << ; out << ] ; return out; } vector<int> g[500]; string color; bool posible = true; void DFS(int n, int p, char c) { if (color[n] != - && color[n] != c) { posible = false; return; } if (color[n] != - ) return; color[n] = c; char nc = 1 - c + 0 ; for (auto k : g[n]) if (k != p) DFS(k, n, nc); } int main() { int n; string in; cin >> n >> in; color.resize(n, - ); for (int i = 0; i < int(n); i++) { for (int j = int(i + 1); j < int(n); j++) { if (in[i] > in[j]) { g[i].push_back(j); g[j].push_back(i); } } } for (int i = 0; i < int(n); i++) if (color[i] == - ) DFS(i, -1, 0 ); if (posible) cout << YES << endl << color << endl; else cout << NO << endl; } |
#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int> > > v(400005); int parent[400005], low[400005], disc[400005], TIME; bool visited[400005], road[400005]; set<int> bridge; int SIZE; pair<int, int> EDGE[400005]; void dfs(int a) { TIME++; visited[a] = true; disc[a] = TIME, low[a] = TIME; for (int i = 0; i < v[a].size(); i++) { if (!visited[v[a][i].first]) { parent[v[a][i].first] = a; dfs(v[a][i].first); low[a] = min(low[a], low[v[a][i].first]); if (low[v[a][i].first] > disc[a]) bridge.insert(v[a][i].second); } else if (v[a][i].first != parent[a]) low[a] = min(low[a], disc[v[a][i].first]); } } void dfs2(int a) { visited[a] = true; SIZE++; for (int i = 0; i < v[a].size(); i++) if (bridge.count(v[a][i].second) == 0 and !visited[v[a][i].first]) dfs2(v[a][i].first); } void solve(int a) { for (int i = 0; i < v[a].size(); i++) { if (!road[v[a][i].second]) { road[v[a][i].second] = true; if (bridge.count(v[a][i].second) == 0) EDGE[v[a][i].second] = make_pair(a, v[a][i].first); else EDGE[v[a][i].second] = make_pair(v[a][i].first, a); solve(v[a][i].first); } } } int main() { int n, m; cin >> n >> m; int MAXSIZE = 0, NODE; for (int i = 0; i < m; i++) { int x, y; scanf( %d %d , &x, &y); v[x].push_back(make_pair(y, i)), v[y].push_back(make_pair(x, i)); } dfs(1); memset(visited, false, sizeof(visited)); for (int i = 0; i < n; i++) { SIZE = 0; if (!visited[i + 1]) dfs2(i + 1); if (SIZE > MAXSIZE) MAXSIZE = SIZE, NODE = i + 1; } solve(NODE); cout << MAXSIZE << endl; for (int i = 0; i < m; i++) cout << EDGE[i].first << << EDGE[i].second << endl; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout << setprecision(10) << fixed; int n, k; cin >> n >> k; vector<double> p(n); for (auto& x : p) cin >> x; int null = (int)count(begin(p), end(p), 0.0); if (n - null < k) { for (int u = 0; u < n; ++u) { double res = p[u] == 0.0 ? 0.0 : 1.0; cout << res << n ; } exit(0); } vector<int> popcount(1 << n, 0); vector<double> sum(1 << n, 0); for (int u = 0; u < n; ++u) sum[1 << u] = p[u]; for (int mask = 1; mask < (1 << n); ++mask) { int lsb = mask & -mask; popcount[mask] = 1 + popcount[mask ^ lsb]; if (mask != lsb) sum[mask] = sum[lsb] + sum[mask ^ lsb]; } vector<double> dp(1 << n, 0); dp[0] = 1; for (int mask = 0; mask < (1 << n); ++mask) { for (int u = 0; u < n; ++u) { if ((mask >> u & 1) || p[u] == 0) continue; int newmask = mask | (1 << u); dp[newmask] += dp[mask] * p[u] / (1 - sum[mask]); } } for (int u = 0; u < n; ++u) { double res = 0; for (int mask = 0; mask < (1 << n); ++mask) { if (popcount[mask] == k && (mask >> u & 1)) res += dp[mask]; } cout << res << n ; } exit(0); } |
#include <bits/stdc++.h> using namespace std; int dis[305][305], lca[305], val[305]; int main() { int n, x; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &x); lca[x] = i; val[i] = x; } char s[305]; memset(dis, 0, sizeof dis); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= n; j++) if (s[j] == 1 ) dis[i][j] = dis[j][i] = 1; } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (dis[i][j] == 0) dis[i][j] = dis[i][k] & dis[k][j]; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (dis[i][lca[j]] == 0) continue; val[lca[j]] = val[i]; lca[val[i]] = lca[j]; val[i] = j; lca[j] = i; } for (int i = 1; i <= n; i++) printf( %d%s , val[i], i == n ? n : ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e3 + 7; long long read() { long long res = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1, c = getchar(); while (isdigit(c)) res = (res << 1) + (res << 3) + c - 48, c = getchar(); return res * f; } long long ans; int n, m; long long f[maxn][maxn], g[maxn][maxn]; int main() { n = read(), m = read(); for (int i = 2; i <= m; i++) f[1][i] = 1; for (int i = 2; i <= n; i++) for (int j = 2; j <= m; j++) f[i][j] = (f[i - 1][j] + 2 * f[i][j - 1] - f[i][j - 2] + 1000000007) % 1000000007; for (int i = 1; i <= n; i++) for (int j = 2; j <= m; j++) g[i][j] = (g[i - 1][j] + f[i][j]) % 1000000007; for (int i = 1; i <= n; i++) for (int j = 2; j <= m; j++) (ans += f[i][j] * g[n - i + 1][j] % 1000000007 * (m - j + 1) % 1000000007) %= 1000000007; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n = 0, l = 0, r = 0, x = 0, c[16]; cin >> n >> l >> r >> x; for (int i = 0; i < n; i++) cin >> c[i]; sort(c, c + n); int total = 0, cnt = 0, ret = 0, easy = 0, hard = 0; for (int i = 0; i < (1 << n); i++) { total = 0, cnt = 0; for (int j = 0; j < n; j++) { if ((1 << j) & i) { if (cnt == 0) { easy = c[j]; } total += c[j]; cnt++; hard = c[j]; } } if (cnt > 1 && total >= l && total <= r && hard - easy >= x) { ret++; } } cout << ret; return 0; } |
#include <bits/stdc++.h> char putnb[20]; using namespace std; const long long mod = 1e9 + 7; const long long mod2 = 1999999973; const int infs = 1e8; const long long inf = 1e18; const int N = 200000; long long A[N + 5]; long long dp[N + 5][2]; bool vis[N + 5][2]; bool solved[N + 5][2]; long long n; long long solve(long long pos, int state) { if (pos <= 0 || pos > n) return 0; if (vis[pos][state] && !solved[pos][state]) return -1; vis[pos][state] = true; if (pos == 1) { if (state) return 0 - inf; return -1; } if (solved[pos][state]) return dp[pos][state]; if (!state) { long long v1 = solve(pos + A[pos], 1); if (v1 == -1) dp[pos][state] = -1; else dp[pos][state] = v1 + A[pos]; } else { long long v2 = solve(pos - A[pos], 0); if (v2 == -1) dp[pos][state] = -1; else dp[pos][state] = v2 + A[pos]; } solved[pos][state] = true; return dp[pos][state]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; cin >> n; for (int i = 2; i <= n; ++i) cin >> A[i]; for (int i = 1; i <= n - 1; ++i) { long long res = solve(1 + i, 1); if (res == -1) cout << res << n ; else if (res >= 0) cout << res + i << n ; else if (res < 0) cout << (res + inf + 2 * i) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int X = 1e5 + 9; const long long inf = (1ll << 60); int n, sum, a[109], b[109], c[109]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[a[i]]++; } for (int i = 0; i < n; i++) { cin >> a[i]; c[a[i]]++; } for (int i = 1; i <= 5; i++) { if ((b[i] + c[i]) % 2 == 1) { puts( -1 ); return 0; } } for (int i = 1; i <= 5; i++) { sum += (abs(c[i] - b[i]) / 2); } cout << sum / 2 << endl; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 200010, MaxB = 500, MaxA = 1000010, mod = 1000000007; struct Query { int l, r, id; bool operator<(const Query &a) const { return r < a.r; } } q[MaxN]; int n, m, a[MaxN]; vector<pair<int, int> > f[MaxN]; int last[MaxA]; int prime[MaxA], ptot, minp[MaxA]; int inv[MaxA]; bool notp[MaxA]; void init(int n) { for (int i = 2; i <= n; ++i) { if (!notp[i]) { prime[++ptot] = i; minp[i] = i; } for (int j = 1; j <= ptot && prime[j] * i <= n; ++j) { notp[prime[j] * i] = 1; minp[prime[j] * i] = prime[j]; if (i % prime[j] == 0) break; } } inv[1] = 1; for (int i = 2; i <= n; ++i) inv[i] = mod - 1ll * (mod / i) * inv[mod % i] % mod; } int ans[MaxN]; int c[MaxN]; void modify(int x, int v) { for (; x <= n; x += (x & -x)) c[x] = 1ll * c[x] * v % mod; } int query(int x) { int ret = 1; for (; x; x -= (x & -x)) ret = 1ll * ret * c[x] % mod; return ret; } int main() { scanf( %d , &n); int mx = 0; for (int i = 1; i <= n; ++i) { scanf( %d , a + i); mx = max(mx, a[i]); } init(mx); for (int i = 1; i <= n; ++i) { int x = a[i]; while (x != 1) { int prod = 1, t = minp[x]; while (x % t == 0) { x /= t; prod *= t; } f[i].push_back(make_pair(t, prod)); } } scanf( %d , &m); for (int i = 1; i <= m; ++i) { scanf( %d%d , &q[i].l, &q[i].r); q[i].id = i; } sort(q + 1, q + m + 1); for (int i = 0; i <= n; ++i) c[i] = 1; int node = 0; for (int i = 1; i <= n; ++i) { for (auto t : f[i]) { modify(1, t.second); modify(last[t.first] + 1, 1ll * (t.first - 1) * inv[t.first] % mod); modify(i + 1, inv[t.second / t.first * (t.first - 1)]); last[t.first] = i; } while (node < m && q[node + 1].r == i) { ++node; ans[q[node].id] = query(q[node].l); } } for (int i = 1; i <= m; ++i) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; long long x, y; cin >> t; for (int i = 0; i < t; i++) { cin >> x >> y; cout << x << << 2 * x << endl; } } |
#include <bits/stdc++.h> using namespace std; inline void splay(int &v) { v = 0; char c = 0; int p = 1; while (c < 0 || c > 9 ) { if (c == - ) p = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { v = (v << 3) + (v << 1) + c - 0 ; c = getchar(); } v *= p; } const int N = 800010; int v[N], a[N], n, m, mi; vector<int> vv[N]; void build(int l, int r, int w) { if (l == r) return v[w] = a[l], void(); int mid = l + r >> 1; build(l, mid, w << 1); build(mid + 1, r, w << 1 | 1); v[w] = min(v[w << 1], v[w << 1 | 1]); } void get(int l, int r, int w, int L, int R) { if (L <= l && r <= R) { mi = min(mi, v[w]); return; } int mid = l + r >> 1; if (L <= mid) get(l, mid, w << 1, L, R); if (R > mid) get(mid + 1, r, w << 1 | 1, L, R); } int getmi(int l, int r) { mi = 1 << 30; if (l > r) return mi; get(1, n, 1, l, r); return mi; } int now = -1; int main() { splay(n), splay(m); a[0] = 1; for (int i = 1; i <= n; i++) { splay(a[i]); if (!a[i]) { a[i] = a[i - 1]; now = i; } vv[a[i]].push_back(i); } build(1, n, 1); for (int i = 1; i <= m; i++) { for (int j = 0; j < (int)(vv[i].size()) - 1; j++) { int x = getmi(vv[i][j] + 1, vv[i][j + 1] - 1); if (x < i) puts( NO ), exit(0); } } bool flag = 0; for (int i = 1; i <= n; i++) { if (a[i] == m) flag = 1; } if (!flag) { if (now != -1) a[now] = m; else puts( NO ), exit(0); } puts( YES ); for (int i = 1; i <= n; i++) { printf( %d%c , a[i], n [i == n]); } } |
#include <bits/stdc++.h> using LL = long long; const int maxn = 1011000; const LL mod = 1e9 + 7; int seed = 29, n; char str[maxn]; LL base[maxn], Hash[maxn]; int ans[maxn]; void init() { memset(base, 0, sizeof(base)); base[0] = 1; for (int i = 1; i < maxn; i++) { base[i] = base[i - 1] * seed; base[i] %= mod; } } void init_hash() { memset(Hash, 0, sizeof(Hash)); for (int i = n - 1; i >= 0; i--) { Hash[i] = Hash[i + 1] * seed + str[i] - a + 1; Hash[i] %= mod; } } LL get_hash(int i, int len) { auto ans = Hash[i] - Hash[i + len] * base[len]; ans %= mod; if (ans < 0) ans += mod; return ans; } int main() { init(); while (std::cin >> n) { std::cin >> str; init_hash(); memset(ans, -1, sizeof(ans)); int cur = -1; for (int i = (n - 1) / 2; i >= 0; i--) { cur += 2; if (2 * i == n - 1) { cur = -1; } while (cur != -1 && get_hash(i, cur) != get_hash(n - i - cur, cur)) cur -= 2; ans[i] = cur; } for (int i = 0; i <= (n - 1) / 2; i++) { std::cout << ans[i] << ; } std::cout << std::endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long sum = 0, ff = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) ff = -1; ch = getchar(); } while (isdigit(ch)) sum = sum * 10 + (ch ^ 48), ch = getchar(); return sum * ff; } const long long N = 5005; long long A, B, n, lcs[N][N], f[N]; char ch[N]; signed main() { n = read(); A = read(); B = read(); scanf( %s , ch + 1); for (long long i = 1; i <= n; i++) for (long long j = 1; j <= n; j++) if (ch[i] == ch[j]) lcs[i][j] = lcs[i - 1][j - 1] + 1; else lcs[i][j] = 0; for (long long i = 1; i <= n; i++) { f[i] = f[i - 1] + A; for (long long j = 1; j < i; j++) if (lcs[i][j] <= i - j) f[i] = min(f[i], f[i - lcs[i][j]] + B); } printf( %lld n , f[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long gi() { char cc = getchar(); long long cn = 0, flus = 1; while (cc < 0 || cc > 9 ) { if (cc == - ) flus = -flus; cc = getchar(); } while (cc >= 0 && cc <= 9 ) cn = cn * 10 + cc - 0 , cc = getchar(); return cn * flus; } const long long P = 998244353; long long fpow(long long x, long long k) { long long ans = 1, base = x; while (k) { if (k & 1) ans = 1ll * ans * base % P; base = 1ll * base * base % P, k >>= 1; } return ans; } const long long N = 3e5 + 5; long long m, n, a[N], fac[N], inv[N]; long long C(long long x, long long y) { return fac[x] * inv[y] % P * inv[x - y] % P; } signed main() { m = gi(), n = m * 2; for (register long long i = (1); i <= (n); ++i) a[i] = gi(); sort(a + 1, a + n + 1); fac[0] = inv[0] = 1; for (register long long i = (1); i <= (n); ++i) fac[i] = fac[i - 1] * i % P; for (register long long i = (1); i <= (n); ++i) inv[i] = fpow(fac[i], P - 2); long long ans = 0; for (register long long i = (1); i <= (n); ++i) { long long z = a[i] * C(n - 1, m - 1); if (i <= m) ans = (ans - z + P) % P; else ans = (ans + z + P) % P; } cout << ans * 2 % P << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = (1e5 + 10 + N) * 2; const int inf = 0x3f3f3f3f; int n, m, S, T; struct node { int u, v, w; } Edge[N]; bool cmp(node &a, node &b) { return a.w < b.w; } int h[N], tot, e[M], f[M], ne[M]; int d[N], cur[N]; void add(int u, int v, int w) { e[tot] = v, f[tot] = w, ne[tot] = h[u], h[u] = tot++; e[tot] = u, f[tot] = 0, ne[tot] = h[v], h[v] = tot++; } bool bfs() { queue<int> q; q.push(S); memset(d, -1, sizeof d); d[S] = 0; cur[S] = h[S]; while (!q.empty()) { int u = q.front(); q.pop(); for (int i = h[u]; ~i; i = ne[i]) { int v = e[i]; if (d[v] == -1 && f[i]) { d[v] = d[u] + 1; cur[v] = h[v]; if (v == T) return true; q.push(v); } } } return false; } int dfs(int u, int limit) { if (u == T) return limit; int flow = 0; for (int i = cur[u]; ~i && flow < limit; i = ne[i]) { cur[u] = i; int v = e[i]; if (d[v] == d[u] + 1 && f[i]) { int t = dfs(v, min(f[i], limit - flow)); flow += t; f[i] -= t; f[i ^ 1] += t; } } return flow; } int dinic() { int flow, res = 0; while (bfs()) { while (flow = dfs(S, inf)) res += flow; } return res; } bool check(int mid) { S = 0, T = 2 * n + 1; for (int i = 0; i <= T; i++) h[i] = -1; tot = 0; for (int i = 1; i <= n; i++) add(S, i, 1); for (int j = 1; j <= n; j++) add(n + j, T, 1); for (int i = 1; i <= m; i++) { if (Edge[i].w > mid) break; add(Edge[i].u, n + Edge[i].v, Edge[i].w); } return dinic() == n; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d%d%d , &Edge[i].u, &Edge[i].v, &Edge[i].w); sort(Edge + 1, Edge + 1 + m, cmp); int l = 1, r = Edge[m].w; int ans = -1; while (l <= r) { int mid = (l + r) / 2; if (check(mid)) { r = mid - 1; ans = mid; } else l = mid + 1; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 1000 + 5; int n; int mat[NMAX][NMAX]; vector<pair<int, int> > sol; void DEI(int l, int r, int insert_type) { if (r - l + 1 < 3) return; int k; for (k = l + 1; k <= r - 1; ++k) if (mat[l][k] && mat[k][r]) break; if (insert_type == 0) sol.push_back(make_pair(l, r)); mat[l][r] = mat[r][l] = false; mat[1][k] = mat[k][1] = true; DEI(l, k, insert_type); DEI(k, r, insert_type); if (insert_type == 1) sol.push_back(make_pair(1, k)); } void solve(int type) { memset(mat, 0, sizeof mat); vector<int> graph1; for (int i = 1; i < n - 2; ++i) { int a, b; cin >> a >> b; mat[a][b] = mat[b][a] = true; } for (int i = 1; i <= n; ++i) mat[i][i % n + 1] = mat[i % n + 1][i] = true; for (int i = 1; i <= n; ++i) if (mat[1][i]) graph1.push_back(i); for (int i = 1; i < graph1.size(); ++i) DEI(graph1[i - 1], graph1[i], type); } int main() { cin >> n; solve(0); solve(1); cout << sol.size() << n ; for (auto it : sol) cout << it.first << << it.second << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename C> void ma(C& a, C b) { if (a < b) a = b; } template <typename C> void mi(C& a, C b) { if (a > b) a = b; } int cas, n, l[251], r[251], w[251], roz[251]; void licz_roz(int nr) { if (w[nr] == -1) { licz_roz(l[nr]); licz_roz(r[nr]); if (roz[r[nr]] & 1) swap(l[nr], r[nr]); roz[nr] = 1 + roz[l[nr]] + roz[r[nr]]; } else roz[nr] = 0; } int dp[251][2][3]; int ak[251][2][3]; inline int mima(int a, int b, bool jak) { return ((a > b) ^ jak) ? a : b; } inline int mima3(int a, int b, int c, bool jak) { return mima(mima(a, b, jak), c, jak); } int dfs(int nr, bool kto, int pas) { if (w[nr] != -1) return w[nr]; if (roz[nr] == 1) return mima(w[l[nr]], w[r[nr]], kto ^ (pas == 2)); int& res = dp[nr][kto][pas]; if (ak[nr][kto][pas] == cas) return res; ak[nr][kto][pas] = cas; if (pas) { if (roz[nr] & 1) { res = dfs(nr, !kto, 0); if (roz[l[nr]] & 1) { int pom = mima(dfs(l[nr], kto, 0), dfs(r[nr], !kto, roz[l[nr]] == 1 && pas == 1 ? 2 : 1), !kto); res = mima(res, pom, kto); pom = mima(dfs(r[nr], kto, 0), dfs(l[nr], !kto, roz[r[nr]] == 1 && pas == 1 ? 2 : 1), !kto); res = mima(res, pom, kto); } else { if (roz[r[nr]]) { int pom = mima(dfs(l[nr], !kto, 0), dfs(r[nr], kto, roz[l[nr]] == 0 && pas == 1 ? 2 : 1), !kto); res = mima(res, pom, kto); } if (roz[l[nr]]) { int pom = mima(dfs(r[nr], !kto, 0), dfs(l[nr], kto, roz[r[nr]] == 0 && pas == 1 ? 2 : 1), !kto); res = mima(res, pom, kto); } } } else { res = mima(dfs(r[nr], kto, 0), dfs(l[nr], kto, roz[r[nr]] == 0 && pas == 1 ? 2 : 1), kto); } } else { if (roz[nr] & 1) { if (roz[l[nr]] & 1) res = mima(dfs(l[nr], kto, 1), dfs(r[nr], kto, 1), kto); else res = mima(dfs(l[nr], kto, 0), dfs(r[nr], kto, 0), kto); } else { int pom = mima(dfs(l[nr], kto, 0), dfs(r[nr], !kto, 0), !kto); int pom2 = mima(dfs(l[nr], !kto, 1), dfs(r[nr], kto, 1), !kto); res = mima(pom, pom2, kto); } } return res; } void test() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &w[i]); if (w[i] == -1) { scanf( %d , &l[i]); scanf( %d , &r[i]); } } licz_roz(0); printf( %d n , dfs(0, 0, 0)); } int main() { int _; scanf( %d , &_); for (cas = 1; cas <= _; cas++) test(); } |
#include <bits/stdc++.h> using namespace std; int cost[15][2][2]; string a[15]; int dp[15][2], topFloor; int memoize(int floor, int dir) { if (floor > topFloor) { return 0; } if (floor == topFloor) { return cost[floor][dir][dir]; } if (dp[floor][dir] != -1) return dp[floor][dir]; int ans = 2000000000; ans = min(memoize(floor + 1, dir ^ 1) + 1 + cost[floor][dir][dir ^ 1], memoize(floor + 1, dir) + 1 + cost[floor][dir][dir]); return dp[floor][dir] = ans; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { cin >> a[i]; } reverse(a, a + n); m += 2; topFloor = -1; for (int i = 0; i < n; i++) { bool present = false; int mini = m + 5, maxi = -1; for (int j = 0; j < m; j++) { if (a[i][j] == 1 ) { present = true; mini = min(mini, j); maxi = max(maxi, j); } } if (present) { topFloor = i; cost[i][0][0] = maxi * 2; cost[i][1][1] = (m - 1 - mini) * 2; } cost[i][0][1] = m - 1; cost[i][1][0] = m - 1; } if (topFloor != -1) { cost[topFloor][0][0] /= 2; cost[topFloor][1][1] /= 2; } memset(dp, -1, sizeof(dp)); int ans = memoize(0, 0); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; set<string> S; string rotate1(string s) { string s1 = s; s1[1] = s[2]; s1[2] = s[4]; s1[4] = s[5]; s1[5] = s[1]; return s1; } string rotate2(string s) { string s1 = s; s1[0] = s[1]; s1[1] = s[3]; s1[3] = s[4]; s1[4] = s[0]; return s1; } set<pair<string, bool> > poszlo; void go(string s, bool sel) { if (!poszlo.insert(make_pair(s, sel)).second) return; S.insert(s); if (sel) { s = rotate2(s); go(s, 0); s = rotate2(s); go(s, 0); s = rotate2(s); go(s, 0); } else { s = rotate1(s); go(s, 1); s = rotate1(s); go(s, 1); s = rotate1(s); go(s, 1); } } int main() { string s; cin >> s; sort(s.begin(), s.end()); int res = 0; do { if (S.insert(s).second) res++; poszlo.clear(); go(s, 0); go(s, 1); } while (next_permutation(s.begin(), s.end())); printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int INF = 0x3f3f3f3f; int INF2 = 0x7fffffff; long long LNF = 0x3f3f3f3f3f3f3f3f; long long LNF2 = 0x7fffffffffffffff; long long n, k, M, D; long long ans; int main() { scanf( %I64d%I64d%I64d%I64d , &n, &k, &M, &D); for (int i = (1); i <= (D); ++i) { if (i * k - k + 1 > n) break; long long c = n / (i * k - k + 1); c = min(c, M); ans = max(ans, c * i); } printf( %I64d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, r; cin >> n >> m >> r; int min1 = 1001; int max1 = 0; int a, b; for (int i = 0; i < n; i++) { cin >> a; min1 = min(a, min1); } for (int i = 0; i < m; i++) { cin >> b; max1 = max(b, max1); } int d = r / min1; if (min1 > max1) { cout << r << endl; return 0; } int cost = (d * max1 + r % min1); if (cost > r) { cout << cost << endl; } else { cout << r << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; float square = sqrt(n); float csquare = ceil(square); if ((csquare == square) || (csquare - square <= 0.5)) { cout << 4 * csquare; } else if (csquare - square > 0.5) { cout << 2 * (csquare + (csquare - 1)); } return 0; } |
#include <bits/stdc++.h> const int Mod = (int)1e9 + 7; const int MX = 1073741822; const long long MXLL = 4611686018427387903; const int Sz = 2e5 + 1; using namespace std; inline void Read_rap() { ios_base ::sync_with_stdio(0); cin.tie(0); } int n; int a[Sz]; long long dp[Sz][20][2], lca[Sz][20][2], sum[Sz][20][2]; vector<int> g[Sz]; void dfs(int v, int pr) { for (int i = 0; i < 20; i++) dp[v][i][((a[v] & (1 << i)) > 0)]++; for (auto to : g[v]) { if (to != pr) { dfs(to, v); for (int i = 0; i < 20; i++) { for (int j = 0; j < 2; j++) { bool bit = (a[v] & (1 << i)) > 0; bool b = (j ^ bit); dp[v][i][b] += dp[to][i][j]; } } } } for (auto to : g[v]) { if (to != pr) { for (int i = 0; i < 20; i++) { for (int j = 0; j < 2; j++) { for (int k = 0; k < 2; k++) { bool bit = (a[v] & (1 << i)) > 0; bool b = (j ^ k ^ bit); lca[v][i][b] += sum[v][i][j] * dp[to][i][k]; } } for (int j = 0; j < 2; j++) sum[v][i][j] = sum[v][i][j] + dp[to][i][j]; } } } } int main() { Read_rap(); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } dfs(1, 1); long long ans = 0; for (int i = 0; i < 20; i++) for (int v = 1; v <= n; v++) ans = (ans + (dp[v][i][1] + lca[v][i][1]) * (1ll << i)); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[55][55]; int main() { int cs; scanf( %d , &cs); while (cs--) { int n, m; scanf( %d %d , &n, &m); int col = 0, row = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , &a[i][j]); } } for (int i = 0; i < n; i++) { bool flag = true; for (int j = 0; j < m; j++) { if (a[i][j] & 1) { flag = false; break; } } if (flag) row++; } for (int i = 0; i < m; i++) { bool flag = true; for (int j = 0; j < n; j++) { if (a[j][i] & 1) { flag = false; break; } } if (flag) col++; } if (min(col, row) % 2) puts( Ashish ); else puts( Vivek ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[500000], o, ans; int main() { cin >> n; ans = 1; for (int i = 2; i <= n + 1; i++) { if (a[i] == 0) { a[i] = 1; o = 1; for (int j = i + i; j <= n + 1; j += i) { o = 2; ans = max(ans, o); a[j] = o; } } } cout << ans << endl; for (int i = 2; i <= n + 1; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int dat[2][2][2][2][2][2][2][2][2][2][2][2][2][2][2][2][2][2]; int main() { int t, i; scanf( %d , &t); long long var; char str[20]; char ch = + ; int arr[18]; while (t--) { cin >> ch; for (i = 0; i <= 17; i++) { arr[i] = 0; } if (ch == + ) { scanf( %I64d , &var); i = 0; while (var != 0) { arr[i] = (var % 10) % 2; var /= 10; i++; } dat[arr[0]][arr[1]][arr[2]][arr[3]][arr[4]][arr[5]][arr[6]][arr[7]] [arr[8]][arr[9]][arr[10]][arr[11]][arr[12]][arr[13]][arr[14]][arr[15]] [arr[16]][arr[17]]++; } else if (ch == - ) { scanf( %I64d , &var); i = 0; while (var != 0) { arr[i] = (var % 10) % 2; var /= 10; i++; } dat[arr[0]][arr[1]][arr[2]][arr[3]][arr[4]][arr[5]][arr[6]][arr[7]] [arr[8]][arr[9]][arr[10]][arr[11]][arr[12]][arr[13]][arr[14]][arr[15]] [arr[16]][arr[17]]--; } else { scanf( %s , &str); i = 0; while (str[i] != 0 ) { i++; } int j = 0; while (j < i) { arr[j] = str[i - j - 1] - 0 ; j++; } printf( %d , dat[arr[0]][arr[1]][arr[2]][arr[3]][arr[4]][arr[5]][arr[6]] [arr[7]][arr[8]][arr[9]][arr[10]][arr[11]][arr[12]] [arr[13]][arr[14]][arr[15]][arr[16]][arr[17]]); printf( n ); } } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.