func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const int N = 100005; char s[45][20] = { Washington , Adams , Jefferson , Madison , Monroe , Adams , Jackson , Van Buren , Harrison , Tyler , Polk , Taylor , Fillmore , Pierce , Buchanan , Lincoln , Johnson , Grant , Hayes , Garfield , Arthur , Cleveland , Harrison , Cleveland , McKinley , Roosevelt , Taft , Wilson , Harding , Coolidge , Hoover , Roosevelt , Truman , Eisenhower , Kennedy , Johnson , Nixon , Ford , Carter , Reagan }; int n; void solve() { cin >> n; cout << s[n - 1]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool setmax(T &_a, T _b) { if (_b > _a) { _a = _b; return true; } return false; } template <class T> bool setmin(T &_a, T _b) { if (_b < _a) { _a = _b; return true; } return false; } template <class T> T gcd(T _a, T _b) { return _b == 0 ? _a : gcd(_b, _a % _b); } int a[110][4], n, m; int main() { cin >> n >> m; int cur = 1; memset(a, 0, sizeof(a)); for (int i = int(1); i <= int(n); ++i) { if (cur > m) break; a[i][0] = cur++; if (cur > m) break; a[i][3] = cur++; } for (int i = int(1); i <= int(n); ++i) { if (cur > m) break; a[i][1] = cur++; if (cur > m) break; a[i][2] = cur++; } vector<int> ans; for (int i = int(1); i <= int(n); ++i) { ans.push_back(a[i][1]); ans.push_back(a[i][0]); ans.push_back(a[i][2]); ans.push_back(a[i][3]); } for (int x : ans) if (x > 0) cout << x << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int OO = 2e7; const double EPS = (1e-7); int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; } bool sort_p(pair<int, int> a, pair<int, int> b) { return a.first < b.first; } int main() { ios_base::sync_with_stdio(0); cin.tie(); cout.tie(); int n; cin >> n; vector<int> a(n); vector<int> b(n, 0); vector<bool> s(n + 1); vector<int> t(n + 1); bool k = false, q = false; for (int i = 0; i < (int)(n); ++i) { cin >> a[i]; if (a[i] == 0) k = true; if (a[i] != 0 && k) q = true; s[n - a[i]] = true; t[a[i]]++; } if (k) { for (int i = 0; i < (int)(n); ++i) if (a[i] != 0) { cout << Impossible ; return 0; } } if (k) { cout << Possible n ; for (int i = 0; i < (int)(n); ++i) cout << 1 << ; return 0; } long long int sum = 0; for (int i = 0; i < (int)(n); ++i) { sum = t[i]; if (n - i != 0 && t[i] != 0 && sum % (n - i)) { cout << Impossible ; return 0; } } vector<pair<int, int>> p; for (int i = 0; i < (int)(n); ++i) { pair<int, int> r = make_pair(n - a[i], i); p.push_back(r); } sort(((p).begin()), ((p).end()), sort_p); int l = 1; int j = 0; for (int i = 0; i < ((int)((p).size())); ++i) { for (j = 0; j < p[i].first; j++) { b[p[i + j].second] = l; } i = i + j - 1; l++; } if (sum > n) { cout << Impossible ; return 0; } cout << Possible n ; for (int i = 0; i < (int)(n); ++i) cout << b[i] << ; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 5; int n, m; bool used[MAXN]; set<int> graph[MAXN]; stack<int> path; vector<int> cycle; int fake; vector<pair<int, int> > edges; vector<pair<int, int> > answer; void EulerCycle(int x) { cycle.clear(); edges.clear(); path.push(x); while (path.empty() == false) { used[x] = true; if (graph[x].empty() == false) { path.push(*graph[x].begin()); int y = *graph[x].begin(); graph[x].erase(y); graph[y].erase(x); x = y; } else { cycle.push_back(x); path.pop(); if (path.empty() == false) x = path.top(); } } for (int i = 0; i < cycle.size() - 1; i++) { edges.push_back({cycle[i], cycle[i + 1]}); } } bool isFake(pair<int, int> x) { if (x.first == fake || x.second == fake) return true; return false; } void solve(int x) { EulerCycle(x); for (int i = 0; i < edges.size(); i++) { bool toDelete; if (isFake(edges[i]) == true) { continue; } if (i % 2 != 0) toDelete = true; else toDelete = false; if (i != 0 && isFake(edges[i - 1]) == true) toDelete = false; if (i == 0 && isFake(edges[edges.size() - 1]) == true) toDelete = false; if (i != edges.size() - 1 && isFake(edges[i + 1]) == true) toDelete = false; if (i == edges.size() - 1 && isFake(edges[0]) == true) toDelete = false; if (toDelete == false) { answer.push_back(edges[i]); } } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; graph[u].insert(v); graph[v].insert(u); } fake = -1; for (int i = 1; i <= n; i++) { if (graph[i].size() % 2 != 0) { fake = n + 1; graph[i].insert(fake); graph[fake].insert(i); } } for (int x = 1; x <= n + 1; x++) { if (used[x] == false) { solve(x); } } cout << answer.size() << n ; for (int i = 0; i < answer.size(); i++) { cout << answer[i].first << << answer[i].second << n ; } } |
#include <bits/stdc++.h> using namespace std; int a, b, maxa; void use_battery(int s) { if (s == 1) a = min(a + 1, maxa); --b; } void use_accum() { --a; } int main() { int ans = 0; int n; cin >> n >> b >> a; maxa = a; vector<int> s(n); for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < n; i++) { if (a == 0 && b == 0) break; else if (a == 0) use_battery(s[i]); else if (b == 0) use_accum(); else if (s[i] == 1 && a < maxa) use_battery(s[i]); else use_accum(); ans++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; int a[k]; for (auto &it : a) cin >> it; sort(a, a + k, greater<int>()); int declined = max(a[0], 25) - 25; cout << declined; } |
#include <bits/stdc++.h> using namespace std; int d[1000001] = {0}; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0, a, b; i < m; ++i) scanf( %d%d , &a, &b), d[a]++, d[b]++; long long ans = 0; for (int i = 1; i <= n; ++i) { long long de = d[i], ade = n - 1 - de; ans += de * (de - 1) + ade * (ade - 1) - de * ade; } cout << ans / 6 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> a[200]; int n, x; vector<pair<int, int> > res; int main() { int sum = 0; cin >> n; cin >> a[0].first; a[0].second = 0; sum += a[0].first; for (int i = 1; i < n; i++) { cin >> a[i].first; a[i].second = i; sum += a[i].first; } if (a[0].first == 0 || sum < n - 1) { cout << -1; return 0; } sort(a + 1, a + n); reverse(a + 1, a + n); int x = 0; int y = 1; cout << n - 1 << endl; while (y < n) { cout << a[x].second + 1 << << a[y].second + 1 << endl; y++; a[x].first--; if (a[x].first == 0) x++; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int m, x, y, a, b; cin >> x >> y >> a >> b; m = abs(x - a) + abs(y - b); if (x != a && y != b) m = m + 2; cout << m << n ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( 03 ) using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } template <class T, class T2> T _f_pow(T a, T2 b) { T res = 1LL; while (b > 0) { if (b & 1) res = (res * a); a = (a * a); b >>= 1; } return (res); } template <class T> T gcd(T a, T b) { while (a && b) if (a > b) (a %= b); else (b %= a); return a + b; } template <class T> T lcm(T a, T b) { return (a * b) / gcd(a, b); } int n, m; long long par[(int)2e6 + 5], sz[(int)2e6 + 5], cmp, mxComp; void init() { iota(par, par + n + 1, 0); fill(sz, sz + n + 1, 1); cmp = n; mxComp = 1; } int Find(int u) { return u == par[u] ? u : par[u] = Find(par[u]); } int join(int u, int v) { u = Find(u); v = Find(v); if (u == v) return 0; if (sz[u] > sz[v]) swap(u, v); par[u] = v; sz[v] += sz[u]; mxComp = max(mxComp, sz[v]); cmp--; return 1; } int from[(int)2e6 + 5], to[(int)2e6 + 5], cst[(int)2e6 + 5], sorted[(int)2e6 + 5]; int f, s; int krus() { init(); sort(sorted, sorted + m, [](int a, int b) { return cst[a] < cst[b]; }); int ret = 0; for (int k = 0; k < m; k++) { int e = sorted[k]; if (join(from[e], to[e])) { if (Find(f) == Find(s)) { cout << cst[e] << endl; return 0; } ret += cst[e]; } } return 1; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; cin >> n >> m; int tm; m--; cin >> f >> s >> tm; for (int i = 0, _n = (m); i < _n; i++) { cin >> from[i] >> to[i] >> cst[i]; sorted[i] = i; } if (krus()) cout << ((int)1e9) << endl; return 0; } |
#include <bits/stdc++.h> int main() { int M, N, d; scanf( %d %d , &M, &N); d = (M * N) / 2; printf( %d , d); return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 1000000; const int OPAND = 2, OPOR = 3, OPXOR = 4, OPNOT = 5; int n; int op[MAXN]; vector<int> ch[MAXN]; int res[MAXN]; int ans[MAXN]; int dfsres(int at) { if (op[at] == 0 || op[at] == 1) { res[at] = op[at]; } else if (op[at] == OPNOT) { res[at] = 1 - dfsres(ch[at][0]); } else if (op[at] == OPAND) { int a = dfsres(ch[at][0]), b = dfsres(ch[at][1]); res[at] = a == 1 && b == 1 ? 1 : 0; } else if (op[at] == OPOR) { int a = dfsres(ch[at][0]), b = dfsres(ch[at][1]); res[at] = a == 1 || b == 1 ? 1 : 0; } else if (op[at] == OPXOR) { int a = dfsres(ch[at][0]), b = dfsres(ch[at][1]); res[at] = (a == 1) ^ (b == 1) ? 1 : 0; } else { assert(false); } return res[at]; } void dfsans(int at, int fix, bool neg) { if (op[at] == 0 || op[at] == 1) { ans[at] = fix != -1 ? fix : 1 - op[at]; if (fix == -1 && neg) ans[at] = 1 - ans[at]; } else if (op[at] == OPNOT) { dfsans(ch[at][0], fix, !neg); } else if (op[at] == OPAND) { for (int i = (0); i < (2); ++i) dfsans(ch[at][i], fix != -1 ? fix : res[ch[at][1 - i]] == 0 ? (neg ? 1 : 0) : -1, neg); } else if (op[at] == OPOR) { for (int i = (0); i < (2); ++i) dfsans(ch[at][i], fix != -1 ? fix : res[ch[at][1 - i]] == 1 ? (neg ? 0 : 1) : -1, neg); } else if (op[at] == OPXOR) { for (int i = (0); i < (2); ++i) dfsans(ch[at][i], fix != -1 ? fix : -1, res[ch[at][1 - i]] == 1 ? !neg : neg); } else { assert(false); } } void run() { scanf( %d , &n); for (int i = (0); i < (n); ++i) { char buff[10]; scanf( %s , buff); if (strcmp(buff, AND ) == 0) { int a, b; scanf( %d%d , &a, &b); --a, --b; op[i] = OPAND; ch[i].push_back(a); ch[i].push_back(b); } else if (strcmp(buff, OR ) == 0) { int a, b; scanf( %d%d , &a, &b); --a, --b; op[i] = OPOR; ch[i].push_back(a); ch[i].push_back(b); } else if (strcmp(buff, XOR ) == 0) { int a, b; scanf( %d%d , &a, &b); --a, --b; op[i] = OPXOR; ch[i].push_back(a); ch[i].push_back(b); } else if (strcmp(buff, NOT ) == 0) { int a; scanf( %d , &a); --a; op[i] = OPNOT; ch[i].push_back(a); } else if (strcmp(buff, IN ) == 0) { int val; scanf( %d , &val); op[i] = val; } else { printf( err: %s n , buff); assert(false); } } dfsres(0); dfsans(0, -1, false); for (int i = (0); i < (n); ++i) if (op[i] == 0 || op[i] == 1) printf( %d , ans[i]); puts( ); } int main() { run(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long tab[12], pr[12]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int q; cin >> q; long long n, m, w, x; for (int z = 0; z < q; z++) { cin >> n >> m; x = 1; for (long long i = 1; i <= 11; i++) { tab[i] = (tab[i - 1] + (m % 10)) % 10; pr[i] = pr[i - 1] + tab[i]; if (tab[i] == tab[1] && i > 1) { x = i - 1; break; } } w = pr[x] * (n / (x * m)); n %= x * m; w += pr[n / m]; cout << w << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int ar[30005]; int diff[30005]; int main() { int t; cin >> t; while (t--) { string ans = YES ; int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> ar[i]; diff[i] = 0; } for (int i = 2; i <= n; i++) { if (ar[i] < ar[i - 1]) { diff[1] += ar[i - 1] - ar[i]; diff[i] -= ar[i - 1] - ar[i]; } } for (int i = 1; i <= n; i++) { diff[i] += diff[i - 1]; ar[i] -= diff[i]; if (ar[i] < 0 || (i > 1 && ar[i] < ar[i - 1])) { ans = NO ; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = 0; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return f ? x : -x; } long long n, m, ans, s = 1, num; bool exia[20][20], exib[20][20], s1[20][20], s2[20][20]; signed main() { n = read(), m = read(); for (long long i = 1; i <= n; i++) { long long x = read(), y = read(); exia[x][y] = exia[y][x] = 1; } for (long long i = 1; i <= m; i++) { long long x = read(), y = read(); exib[x][y] = exib[y][x] = 1; } for (long long i = 1; i <= 9; i++) { for (long long j = 1; j <= 9; j++) { if (i == j) continue; for (long long k = 1; k <= 9; k++) { if (i == k || j == k) continue; if (exia[i][j] && exib[i][k]) { s1[i][j] = s2[i][k] = 1; ans = i; if (num && num != i) s = 0; num = i; } } } } if (s) printf( %lld , ans); else { ans = 0; for (long long i = 1; i <= 9; i++) { for (long long j = 1; j <= 9; j++) { if (i == j) continue; if (s1[i][j] && s1[j][i]) { ans = -1; break; } if (s2[i][j] && s2[j][i]) { ans = -1; break; } } } printf( %lld , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long modex(long long a, long long p, long long m) { if (!p) return 1; if (p & 1) return a * modex(a, p - 1, m) % m; long long v = modex(a, p >> 1, m); return v * v % m; } namespace fft { struct cpx { double r, i; cpx(double r = 0, double i = 0) : r(r), i(i) {} cpx operator+(cpx b) { return {r + b.r, i + b.i}; } cpx operator-(cpx b) { return {r - b.r, i - b.i}; } cpx operator*(cpx b) { return {r * b.r - i * b.i, r * b.i + i * b.r}; } cpx operator/(double b) { return {r / b, i / b}; } inline cpx conj() { return {r, -i}; } }; const double PI = acos(-1); vector<int> rev(1, 0); vector<cpx> roots; int base = 0; void precompute(int nbase) { if (nbase <= base) return; rev.resize(1 << nbase); for (int i = 0; i < (1 << nbase); ++i) { rev[i] = rev[i >> 1] >> 1 | ((i & 1) << nbase - 1); } roots.resize(1 << nbase); for (; base < nbase; ++base) { int len = 1 << base; double angle = 2 * PI / (1 << (base + 1)); for (int i = 0; i < len; ++i) { double cur = angle * i; roots[len + i] = cpx(cos(cur), sin(cur)); } } } void fft(vector<cpx>& a, int n = -1) { if (n == -1) n = a.size(); assert((n & (n - 1)) == 0); int zeros = __builtin_ctz(n); precompute(zeros); int shift = base - zeros; for (int i = 0; i < n; ++i) { if (i < (rev[i] >> shift)) swap(a[i], a[rev[i] >> shift]); } for (int len = 1; len < n; len <<= 1) for (int i = 0; i < n; i += 2 * len) for (int j = 0; j < len; ++j) { cpx u = a[i + j], v = a[i + j + len] * roots[len + j]; a[i + j] = u + v; a[i + j + len] = u - v; } } vector<cpx> fa, fb; vector<long long> multiply(vector<int> a, vector<int> b) { if (a.empty() || b.empty()) return {}; int sz = a.size() + b.size() - 1; int n = sz == 1 ? 1 : 1 << (32 - __builtin_clz(sz - 1)); if (n > fa.size()) fa.resize(n); for (int i = 0; i < n; ++i) { int x = i < a.size() ? a[i] : 0; int y = i < b.size() ? b[i] : 0; fa[i] = cpx(x, y); } fft(fa, n); cpx r(0, -0.5 / n); for (int i = 0; i <= (n >> 1); ++i) { int j = (n - i) & (n - 1); cpx x = (fa[i] + fa[j].conj()) / 2; cpx y = (fa[i] - fa[j].conj()) * r; fa[i] = x * y; if (i != j) fa[j] = fa[i].conj(); } fft(fa, n); reverse(fa.begin() + 1, fa.end()); vector<long long> res(sz); for (int i = 0; i < sz; ++i) { res[i] = llround(fa[i].r); } return res; } vector<int> multiply(const vector<int>& a, const vector<int>& b, int m) { if (a.empty() || b.empty()) return {}; int eq = (a == b); int sz = a.size() + b.size() - 1; int n = sz == 1 ? 1 : 1 << (32 - __builtin_clz(sz - 1)); if (n > fa.size()) fa.resize(n); for (int i = 0; i < a.size(); ++i) { fa[i] = cpx(a[i] & ((1 << 15) - 1), a[i] >> 15); } fill(fa.begin() + a.size(), fa.begin() + n, cpx(0, 0)); fft(fa, n); if (n > fb.size()) fb.resize(n); if (eq) { copy(fa.begin(), fa.begin() + n, fb.begin()); } else { for (int i = 0; i < b.size(); ++i) { fb[i] = cpx(b[i] & ((1 << 15) - 1), b[i] >> 15); } fill(fb.begin() + b.size(), fb.begin() + n, cpx(0, 0)); } fft(fb, n); double ratio = 0.5 / n; cpx r2(0, -0.5); cpx r3(ratio, 0); cpx r4(0, -ratio); cpx r5(0, 1); for (int i = 0; i <= (n >> 1); ++i) { int j = (n - i) & (n - 1); cpx a1 = (fa[i] + fa[j].conj()) / 2; cpx a2 = (fa[i] - fa[j].conj()) * r2; cpx b1 = (fb[i] + fb[j].conj()) * r3; cpx b2 = (fb[i] - fb[j].conj()) * r4; cpx x = a1 * b1; cpx y = a2 * b2; fa[i] = x + y * r5; fb[i] = a1 * b2 + a2 * b1; if (i != j) { fa[j] = x.conj() + y.conj() * r5; fb[j] = fb[i].conj(); } } fft(fa, n); fft(fb, n); reverse(fa.begin() + 1, fa.end()); reverse(fb.begin() + 1, fb.end()); vector<int> res(sz); for (int i = 0; i < sz; ++i) { long long aa = llround(fa[i].r); long long bb = llround(fb[i].r); long long cc = llround(fa[i].i); assert(llround(fb[i].i) == 0); res[i] = (aa + ((bb % m) << 15) + ((cc % m) << 30)) % m; } return res; } }; // namespace fft namespace polynomial { int MOD = 998244353; template <typename T> vector<T> subtract(vector<T> a, const vector<T>& b) { if (a.size() < b.size()) { a.resize(b.size()); } for (int i = 0; i < b.size(); ++i) { a[i] -= b[i]; if (a[i] < 0) a[i] += MOD; } return a; } template <typename T> vector<T> inverse(const vector<T>& a) { assert(!a.empty() && a[0] != 0); int n = a.size(); vector<T> b = {modex(a[0], MOD - 2, MOD)}; for (int m = 2; b.size() < n; m <<= 1) { vector<T> aCut(a.begin(), a.begin() + min(a.size(), m)); auto x = fft::multiply(aCut, fft::multiply(b, b, MOD), MOD); b.resize(m); for (int i = 0; i < m; ++i) { b[i] += b[i] - x[i]; if (b[i] >= MOD) b[i] -= MOD; if (b[i] < 0) b[i] += MOD; } } b.resize(n); return b; } template <typename T> vector<T> divide(vector<T> a, vector<T> b) { assert(!b.empty() && b.back() != 0); int n = a.size(); int m = b.size(); if (n < m) return {}; reverse(a.begin(), a.end()); reverse(b.begin(), b.end()); b.resize(n - m + 1); a = multiply(a, inverse(b), MOD); a.erase(a.begin() + n - m + 1, a.end()); reverse(a.begin(), a.end()); return a; } template <typename T> vector<T> remainder(const vector<T>& a, const vector<T>& b) { return subtract(a, fft::multiply(b, divide(a, b), MOD)); } template <typename T> vector<T> integral(const vector<T>& a) { vector<T> ret(a.size() + 1); for (int i = 1; i < ret.size(); ++i) { ret[i] = a[i] * modex(i, MOD - 2, MOD) % MOD; } return ret; } template <typename T> vector<T> derivative(const vector<T>& a) { if (a.empty()) return a; vector<T> ret(a.size() - 1); for (int i = 0; i + 1 < a.size(); ++i) ret[i] = (long long)a[i + 1] * (i + 1) % MOD; return ret; } template <typename T> vector<T> logarithm(const vector<T>& a) { assert(!a.empty() && a[0] == 1); auto ret = integral(fft::multiply(derivative(a), inverse(a), MOD)); ret.resize(a.size()); return ret; } template <typename T> vector<T> exponent(const vector<T>& a) { assert(!a.empty() && a[0] == 0); int n = a.size(); vector<T> b = {1}; for (int m = 2; b.size() < n; m <<= 1) { vector<T> x(a.begin(), a.begin() + min(a.size(), m)); ++x[0]; if (x[0] >= MOD) x[0] -= MOD; auto oldB = b; b.resize(m); b = fft::multiply(oldB, subtract(x, logarithm(b)), MOD); b.resize(m); } b.resize(n); return b; } template <typename T> vector<T> multipoint(const vector<T>& a, vector<T> xs) { int n = xs.size(); vector<vector<T>> prods(2 * n - 1); function<void(int, int, int)> getProds = [&](int sn, int s, int e) { if (s == e) { prods[sn] = {(MOD - xs[s]) % MOD, 1}; return; } int m = (s + e) >> 1, lsn = sn + 1, rsn = sn + ((m - s + 1) << 1); getProds(lsn, s, m); getProds(rsn, m + 1, e); prods[sn] = fft::multiply(prods[lsn], prods[rsn]); }; getProds(0, 0, n - 1); function<void(int, int, int, vector<T>)> calc = [&](int sn, int s, int e, vector<T> f) { if (s == e) { xs[s] = f[0]; return; } int m = (s + e) >> 1, lsn = sn + 1, rsn = sn + ((m - s + 1) << 1); calc(lsn, s, m, remainder(f, prods[lsn])); calc(rsn, m + 1, e, remainder(f, prods[rsn])); }; calc(0, 0, n - 1, a); return xs; } template <typename T> vector<T> chirpz(vector<T> a, T g, int n) { int d = a.size(); int phi = MOD - 1; vector<long long> pw(phi + 1, 1); for (int i = 1; i <= phi; ++i) pw[i] = pw[i - 1] * g % MOD; auto chirpzEven = [&](const vector<T>& b, int m) { vector<T> u(d), v(m + d - 1); for (int i = 0; i < d; ++i) { u[i] = b[i] * pw[(long long)i * i % phi] % MOD; } for (int i = -(d - 1); i < m; ++i) { v[d - 1 + i] = pw[phi - (long long)i * i % phi]; } auto z = fft::multiply(u, v, MOD); vector<T> ret(m); for (int i = 0; i < m; ++i) { ret[i] = pw[(long long)i * i % phi] * z[d - 1 + i] % MOD; } return ret; }; auto even = chirpzEven(a, (n + 1) >> 1); for (int i = 0; i < d; ++i) a[i] = a[i] * pw[i] % MOD; auto odd = chirpzEven(a, n >> 1); vector<T> ret(n); for (int i = 0; i < n; ++i) { ret[i] = (i & 1) ? odd[i >> 1] : even[i >> 1]; } return ret; } }; // namespace polynomial using namespace polynomial; int primitiveRoot(int n) { vector<int> fact; int phi = n - 1, x = phi; for (int i = 2; i * i <= x; ++i) if (x % i == 0) { fact.push_back(i); while (x % i == 0) x /= i; } if (x > 1) fact.push_back(x); for (int res = 1; res <= n; ++res) { bool ok = true; for (int i = 0; i < fact.size() && ok; ++i) ok &= modex(res, phi / fact[i], n) != 1; if (ok) return res; } return -1; } char str[100005]; int main() { int n, m; scanf( %d%d , &n, &m); vector<int> poly(n); scanf( %s , str); for (int i = 0; i < n; ++i) { poly[i] += str[i] - a ; } scanf( %s , str); for (int i = 0; i < n; ++i) { poly[i] -= str[i] - a ; } const int MAXN = 300005; bitset<MAXN> notp; notp[1] = notp[0] = 1; for (int i = 2; i < MAXN; ++i) if (!notp[i]) for (int j = i + i; j < MAXN; j += i) notp[j] = 1; mt19937 rng(42); for (;;) { int p = m + n + rng() % 100000; if (notp[p]) continue; MOD = p; int g = primitiveRoot(p); auto z = poly; for (int i = 0; i < z.size(); ++i) z[i] = (z[i] % MOD + MOD) % MOD; auto res = chirpz(z, g, p - 1); long long pw = 1; for (int i = 0; i < p - 1; ++i) { if (1 < pw && pw < p - 1 && res[i] == 0) { long long z = 0; long long r = pw; for (int i = n - 1; i >= 0; --i) { z = (z * r + poly[i]) % MOD; } cerr << z << = << z << endl; printf( %d %lld n , MOD, r); return 0; } pw = pw * g % MOD; } } } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { if (b == 0) return 1; if (b == 1) return a; long long int r = power(a, b / 2) % 1000000007; if (b % 2 == 0) return (r * r) % 1000000007; else return (((r * r) % 1000000007) * a) % 1000000007; } int prime[1000009]; int sumprime[1000009]; void sieve(int n) { prime[0] = prime[1] = 1; for (int i = 2; i <= sqrt(n); i++) { if (!prime[i]) { for (int j = 2 * i; j <= n; j = j + i) { prime[j]++; } } } for (int i = 1; i <= n; i++) { if (!prime[i]) { sumprime[i] = sumprime[i - 1] + 1; } else { sumprime[i] = sumprime[i - 1]; } } } bool comp(const pair<long double, long long int> &a, const pair<long double, long long int> &b) { if (a.first == b.first) return a.second < b.second; return (a.first < b.first); } const int N = 5 * 1e5 + 9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int m, n; cin >> n >> m; vector<pair<long double, long long int>> v; for (int i = 1; i <= m; i++) { long double d = abs((m + 1) / 2.0 - i); v.push_back({d, i}); } sort(v.begin(), v.end(), comp); for (int i = 0; i < n; i++) { int val = i % m; cout << v[val].second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, m; struct point { int x, y; point() {} point(int x, int y) : x(x), y(y) {} point operator-(point a) { return point(x - a.x, y - a.y); } bool operator<(const point& a) const { return x == a.x ? y < a.y : x < a.x; } } a[N], b[N]; long long dot(point a, point b) { return (long long)a.x * b.x + (long long)a.y * b.y; } long long cross(point a, point b) { return (long long)a.x * b.y - (long long)a.y * b.x; } long long dist2(point a, point b) { return dot(a - b, a - b); } vector<point> convex_hull(point* p, int n) { sort(p + 1, p + 1 + n); vector<point> convex; for (int i = 1; i <= n; ++i) { for (int j; (j = convex.size()) > 1 && cross(convex[j - 1] - convex[j - 2], p[i] - convex[j - 2]) <= 0; convex.pop_back()) ; convex.push_back(p[i]); } int old = convex.size(); for (int i = n - 1; i; --i) { for (int j; (j = convex.size()) > old && cross(convex[j - 1] - convex[j - 2], p[i] - convex[j - 2]) <= 0; convex.pop_back()) ; convex.push_back(p[i]); } convex.pop_back(); return convex; } struct p3 { long long x, y, z; p3() {} p3(long long x, long long y, long long z) : x(x), y(y), z(z) {} bool operator<(const p3& a) const { return x == a.x ? y == a.y ? z < a.z : y < a.y : x < a.x; } }; long long f(point a, point b) { return dot(a, b) + cross(a, b); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %d%d , &a[i].x, &a[i].y); } for (int i = 1; i <= m; ++i) { scanf( %d%d , &b[i].x, &b[i].y); } vector<point> convex_a = convex_hull(a, n); vector<point> convex_b = convex_hull(b, m); if (convex_a.size() != convex_b.size()) { return puts( NO ), 0; } else { map<p3, int> appeared; for (int i = 0; i < convex_a.size(); ++i) { int j = i + 1 == convex_a.size() ? 0 : i + 1; int k = i == 0 ? convex_a.size() - 1 : i - 1; ++appeared[p3(dist2(convex_a[k], convex_a[i]), f(convex_a[k] - convex_a[i], convex_a[j] - convex_a[i]), dist2(convex_a[j], convex_a[i]))]; } for (int i = 0; i < convex_b.size(); ++i) { int j = i + 1 == convex_b.size() ? 0 : i + 1; int k = i == 0 ? convex_b.size() - 1 : i - 1; --appeared[p3(dist2(convex_b[k], convex_b[i]), f(convex_b[k] - convex_b[i], convex_b[j] - convex_b[i]), dist2(convex_b[j], convex_b[i]))]; } bool same = true; for (map<p3, int>::iterator it = appeared.begin(); it != appeared.end(); ++it) { if (it->second != 0) { same = false; } } return puts(same ? YES : NO ), 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 35, L = 10005; int T, k, i, j, n, m; int a[2][N], b[N * 2], bb[N * 2]; char cc[5], ans[L], *ass, out[26][L], *pp[26]; inline void getseq() { int xb = 0; for (j = 0; j < n; ++j) if (a[0][j]) b[xb++] = a[0][j]; for (j = n - 1; j >= 0; --j) if (a[1][j]) b[xb++] = a[1][j]; } inline void push(char c1, char c2) { *pp[c1 - A ]++ = c2; } inline void opt(char c) { *ass++ = c; } inline void get_rot2(int x, char c) { int i; x -= k; if (x < 0) x += m; for (i = 0; i < x; ++i) push(c, R ); for (i = 0; i < k; ++i) push(c, l ); push(c, u ); for (i = 0; i < k; ++i) push(c, r ); push(c, d ); for (i = x; i < m; ++i) push(c, R ); } inline void rot2(int x) { int i; x -= k; if (x < 0) x += m; for (i = 0; i < x; ++i) opt( R ); for (i = 0; i < k; ++i) opt( l ); opt( u ); for (i = 0; i < k; ++i) opt( r ); opt( d ); for (i = x; i < m; ++i) opt( R ); } inline void rot3(int x) { swap(b[x], b[x + 1]); swap(b[x + 1], b[x + 2]); if (k == 1) return rot2(x); int i; if (x >= 8) opt(x / 8 - 1 + A ); if (x % 8) opt(x % 8 - 1 + I ); opt( U ); x = m - x; if (x >= 8) opt(x / 8 - 1 + A ); if (x % 8) opt(x % 8 - 1 + I ); } int calcI(int* b) { int ass = 0; for (i = 0; i < m; ++i) for (j = i + 1; j < m; ++j) ass += b[i] > b[j]; return ass; } int main() { for (scanf( %d , &T); T--;) { scanf( %d , &k); n = k * 2 + 1; m = n * 2 - 1; ass = ans; for (i = 0; i < 2; ++i) for (j = 0; j < n; ++j) scanf( %s , cc), *cc == E ? a[i][j] = 0 : sscanf(cc, %d , a[i] + j); for (j = 0; j + 1 < n; ++j) for (i = 0; i < 2; ++i) if (a[i][j] == 0) opt( r ), swap(a[i][j], a[i][j + 1]); if (a[0][n - 1] == 0) opt( d ), swap(a[0][n - 1], a[1][n - 1]); ; int i1, i2; getseq(); i1 = calcI(b); for (i = 0; i < m; ++i) bb[i] = i + 1; reverse(bb + n, bb + m); i2 = calcI(bb); if ((i2 - i1) & 1) { puts( SURGERY FAILED ); continue; } for (i = 0; i < 26; ++i) pp[i] = out[i]; for (i = n - 1; i; --i) push( R , l ); push( R , u ); for (i = 0; i < n - 1; ++i) push( R , r ); push( R , d ); for (i = 1; i <= 8; ++i) push( A , R ); for (i = 2; i <= 8; ++i) push( A + i - 1, A + i - 2), push( A + i - 1, A ); push( I , R ); for (i = 1; i < 8; ++i) push( I + i, I + i - 1), push( I + i, R ); get_rot2(0, S ); get_rot2(1, T ); push( U , T ); push( U , T ); for (i = 1; i <= 2 * k; i += 2) push( U , T ), push( U , S ); for (i = 0; i + 2 < m; ++i) { for (j = i; b[j] != bb[i]; ++j) ; for (; j > i + 1; rot3(j - 2), --j) ; if (j > i) rot3(j - 1); } puts( SURGERY COMPLETE ); *ass = 0; puts(ans); for (i = 0; i < 26; ++i) if (pp[i] != out[i]) *pp[i] = 0, printf( %c %s n , i + A , out[i]); puts( DONE ); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; using pll = pair<ll, ll>; const int N = 100010; int m, n, q[N], a[N]; int main() { scanf( %d , &m); for (int i = 0; i < m; i++) scanf( %d , &q[i]); scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); int mn = *min_element(q, q + m) + 2; int ans = 0; for (int i = 0; i < n; i++) ans += a[i]; sort(a, a + n); reverse(a, a + n); for (int i = mn - 2; i < n; i += mn) { ans -= a[i]; if (i + 1 < n) ans -= a[i + 1]; } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, tc; cin >> tc; while (tc-- != 0) { cin >> n; if (n & 1) { cout << 7 ; for (int i = 1; i < n / 2; i++) { cout << 1 ; } } else { for (int i = 1; i <= n / 2; i++) { cout << 1 ; } } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5, inf = 1e9 + 7; long long n, k, i, j; long long A[N], l[N], r[N], len[N]; set<pair<long long, long long> > st; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long i, j, a, b, ans = 0, cur; cin >> n; for (i = 1; i < n + 1; i++) cin >> A[i]; i = 1; while (i <= n) { j = i; while (j <= n && A[j] == A[i]) j++; r[i] = j; l[j] = i; len[i] = j - i; st.insert(pair<long long, long long>(i - j, i)); i = j; } while (!st.empty()) { cur = st.begin()->second; st.erase(st.begin()); ans++; len[cur] = 0; a = l[cur]; b = r[cur]; if (st.empty()) break; if (A[a] == A[b] && a > 0 && b <= n) { st.erase(pair<long long, long long>(-len[a], a)); st.erase(pair<long long, long long>(-len[b], b)); r[a] = r[b]; l[r[a]] = a; len[a] += len[b]; len[b] = 0; st.insert(pair<long long, long long>(-len[a], a)); } else { r[a] = b; l[b] = a; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; struct M { int t, x[4]; M(int s, int a, int b, int c, int d = 0) { t = s; x[0] = a; x[1] = b; x[2] = c; x[3] = d; } void p() { printf( %d , t); for (int i = 0; i < (int)(t); ++i) printf( %d , x[i]); printf( n ); } }; vector<M> an; int main() { int n; scanf( %d , &n); while (n > 4) { int a = n, b = n - 1; an.push_back(M(3, 1, a, b)); an.push_back(M(3, 1, a, b)); for (int i = 3; i < (int)(b); ++i) an.push_back(M(4, i - 1, a, i, b)); an.push_back(M(4, b - 1, a, 2, b)); n -= 2; } if (n == 4) { an.push_back(M(4, 1, 2, 3, 4)); an.push_back(M(4, 1, 3, 4, 2)); an.push_back(M(4, 1, 4, 2, 3)); } else { an.push_back(M(3, 1, 2, 3)); an.push_back(M(3, 1, 2, 3)); } printf( %d n , (int)an.size()); for (int i = 0; i < (int)(an.size()); ++i) an[i].p(); } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { ios_base ::sync_with_stdio(false), cin.tie(NULL); int test; cin >> test; while (test--) { int n, k; string s; cin >> s; int a = 1, poss = true; while (poss) { poss = false; string t; int len = s.size(); for (int i = 0; i < len - 1; ++i) { if ((s[i] == 1 && s[i + 1] == 0 ) || (s[i] == 0 && s[i + 1] == 1 )) { i += 2; poss = true; a = (a == 1) ? 0 : 1; while (i < len) { t += s[i]; i++; } } else t += s[i]; } s = t; } if (a == 0) cout << DA n ; else cout << NET n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; int mid = 0; int num = 0; int e[21][21]; int flag[21]; void dfs(int x, int sum) { if (x > n) { num = num + 1; return; } dfs(x + 1, sum); for (int y = 1; y <= n; y++) { if (num > k) { break; } if (flag[y] == 0 && e[x][y] != 0 && sum + e[x][y] <= mid) { flag[y] = 1; dfs(x + 1, sum + e[x][y]); flag[y] = 0; } } return; } int main() { int u, v, w; cin >> n >> m >> k; int l = 0; int h = 1000 * n; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { e[i][j] = 0; } } for (int i = 0; i < m; i++) { cin >> u >> v >> w; e[u][v] = w; } while (l < h) { mid = (l + h) / 2; num = 0; dfs(1, 0); if (num < k) { l = mid + 1; } else { h = mid; } } cout << l << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { double a1, a2; double b1, b2; double c1, c2; cin >> a1 >> b1 >> c1; cin >> a2 >> b2 >> c2; if (fabs(a1) < 1e-14 && fabs(b1) < 1e-14 && fabs(c1) > 1e-14 || fabs(a2) < 1e-14 && fabs(b2) < 1e-14 && fabs(c2) > 1e-14) { cout << 0; return 0; } if (fabs(a1) < 1e-14 && fabs(b1) < 1e-14 && fabs(c1) < 1e-14 || fabs(a2) < 1e-14 && fabs(b2) < 1e-14 && fabs(c2) < 1e-14) { cout << -1; return 0; } if ((fabs(b1) < 1e-14 && fabs(b2) > 1e-14) || (fabs(b2) < 1e-14 && fabs(b1) > 1e-14)) cout << 1; else if (fabs(b1) < 1e-14 && fabs(b2) < 1e-14) { a1 /= c1; a2 /= c2; if (fabs(a1 - a2) < 1e-14 || (fabs(a1) == INFINITY && fabs(a2) == INFINITY)) cout << -1; else cout << 0; } else { a1 /= b1; a2 /= b2; c1 /= b1; c2 /= b2; if (fabs(a1 - a2) < 1e-14) { if (fabs(c1 - c2) < 1e-14) cout << -1; else cout << 0; } else cout << 1; } } |
#include <bits/stdc++.h> using namespace std; int n, a[12], b[20], c[5], u[15], vs, hh; string v[2033333]; void add(int o, int s, int k) { if (s > k) return; if (o == 4) { if (k - s > 2) return; if (k - s && b[s] == 0) return; if (k - s == 2 && b[s] * 100 + b[s + 1] * 10 + b[k] >= 256) return; string st = ; for (int i = 1; i <= c[1]; i++) st += char(b[i] + 48); st += . ; for (int i = c[1] + 1; i <= c[1] + c[2]; i++) st += char(b[i] + 48); st += . ; for (int i = c[1] + c[2] + 1; i < s; i++) st += char(b[i] + 48); st += . ; for (int i = s; i <= k; i++) st += char(b[i] + 48); v[++vs] = st; return; } c[o] = 1; add(o + 1, s + 1, k); if (!b[s]) return; c[o] = 2; add(o + 1, s + 2, k); if (b[s] * 100 + b[s + 1] * 10 + b[s + 2] >= 256) return; c[o] = 3; add(o + 1, s + 3, k); } void cty(int k) { for (int i = 1; i <= n; i++) { b[k] = a[i]; if (!u[i]) hh++; u[i]++; if (k >= 2) { do { if (hh != n) break; for (int j = 1; j <= k; j++) b[(k << 1) - j + 1] = b[j]; add(1, 1, k << 1); if (k != 2) { for (int j = 1; j < k; j++) b[(k << 1) - j] = b[j]; add(1, 1, (k << 1) - 1); } } while (0); } if (k < 6) cty(k + 1); u[i]--; if (!u[i]) hh--; } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); cty(1); sort(v + 1, v + vs + 1); printf( %d n , vs); for (int i = 1; i <= vs; i++) { int l = v[i].size(); for (int j = 0; j < l; j++) printf( %c , v[i][j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool win(long long A, long long B) { if (A == 0 || B == 0) return false; if (A > B) swap(A, B); if (!win(A, B % A)) return true; long long N = B / A; long long MOD = A + 1; return ((N % MOD) % 2 == 0); } int main(void) { int T, t; long long A, B; cin >> T; for ((t) = 0; (t) < (int)(T); (t)++) { cin >> A >> B; bool ans = win(A, B); cout << (ans ? First : Second ) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int *b = new int[n]; int max_val = 0; for (int i = 0; i < n; i++) { cin >> b[i]; if (i == 0) { } else if (i == 1) { b[i] = b[0] + b[1]; max_val = (b[0] > b[1]) ? b[0] : b[1]; } else { b[i] = max_val + b[i]; if (max_val < b[i]) max_val = b[i]; } cout << b[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, cnt = 1; cin >> n; int x[n]; for (int i = 0; i < n; i++) { cin >> x[i]; } for (int i = 0; i < n - 1; i++) { if (x[i] != x[i + 1]) { cnt++; } } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const long long mod = 1e9 + 7; const long long maxn = 1e5 + 10; long long n, x, y; long long money[maxn]; pair<long long, long long> show[maxn]; multiset<pair<long long, long long> > s; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int main() { long long ans = 0; n = read(), x = read(), y = read(); for (long long i = 1; i <= n; i++) { show[i].first = read(), show[i].second = read(); s.insert({show[i].second, show[i].first}); } sort(show + 1, show + 1 + n); for (long long i = 1; i <= n; i++) { money[i] = (x + y * (show[i].second - show[i].first)); if (!s.size() || (*s.begin()).first >= show[i].first) continue; multiset<pair<long long, long long> >::iterator iter = s.lower_bound({show[i].first, 0}); long long tmp = (*(--iter)).first; if (y * (show[i].second - tmp) >= money[i]) continue; money[i] = y * (show[i].second - tmp); s.erase(iter); } for (long long i = 1; i <= n; i++) { ans += money[i]; ans %= mod; } ans %= mod; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 9; long long Pow(long long a, long long x) { long long res = 1; while (x) { if (x & 1) res = res * a % mod; a = a * a % mod; x >>= 1; } return res; } long long inv(long long a) { return Pow(a, mod - 2); } long long n, a, b, k; string s; int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> a >> b >> k; cin >> s; long long ans = 0; for (int i = 0; i < k; ++i) { int f = s[i] == - ? -1 : 1; ans = (ans + (f * Pow(a, n - i) * Pow(b, i) % mod + mod) % mod) % mod; } long long q = Pow(inv(a) * b % mod, k); if (q == 1) { long long res = (n + 1) / k; ans = ans * res % mod; } else { long long res = Pow(q, (n + 1) / k); res--; if (res < 0) res += mod; res = res * inv(q - 1) % mod; ans = res * ans % mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans % m; } bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) { return (a.first > b.first); } int main() { long long i, t, a; cin >> t; while (t--) { cin >> a; double z = abs(a - 180); z = (double)360 / z; if (floor(z) == ceil(z)) { cout << YES ; } else { cout << NO ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; multiset<long long> mset; void add(long long k) { mset.insert(k); } long long getmin() { return *mset.begin(); } long long getmax() { return *prev(mset.end()); } long long lower(long long k) { if (mset.size() == 0) return -1; if (k < getmin()) return -1; if (mset.count(k)) return k; auto it = mset.lower_bound(k); return *prev(it); } long long uper(long long k) { if (mset.size() == 0) return -1; auto it = mset.lower_bound(k); if (it == mset.end()) return -1; return *it; } void erase(long long k) { mset.erase(mset.find(k)); } long long t, n; const long long inf = 0x3f3f3f3f; long long dp[200005][2], a[200005]; signed main() { ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long t; cin >> t; while (t--) { cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; dp[i][1] = inf; dp[i][0] = inf; } dp[0][0] = a[0]; dp[1][0] = dp[0][0] + a[1]; dp[1][1] = dp[0][0]; for (long long i = 2; i < n; i++) { dp[i][0] = min(dp[i - 1][1] + a[i], dp[i - 2][1] + a[i - 1] + a[i]); dp[i][1] = min(dp[i - 1][0], dp[i - 2][0]); } cout << min(dp[n - 1][0], dp[n - 1][1]) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5, maxl = 20; bool mark[maxn]; long long sum = 0, cmp, d[maxn]; pair<long long, long long> par[maxn][maxl]; vector<pair<long long, long long> > adj[maxn]; struct Type_Dsu { long long par[maxn], h[maxn]; void make_set(long long x) { par[x] = x; h[x] = 0; } long long findpar(long long x) { return par[x] = (x == par[x] ? x : findpar(par[x])); } bool merge(long long x, long long y) { x = findpar(x); y = findpar(y); if (x == y) return false; if (d[x] > d[y]) swap(x, y); par[x] = y; h[y] += (h[x] == h[y]); return true; } bool same(long long x, long long y) { return (findpar(x) == findpar(y)); } } dsu; struct Edge { long long fi, se, w; }; vector<Edge> edges; void input() { long long n, m; cin >> n >> m; cmp = n; for (long long i = 0; i < n; i++) dsu.make_set(i); for (long long i = 0; i < m; i++) { long long fi, se, w; cin >> fi >> se >> w; fi--; se--; Edge edg; edg.fi = fi; edg.se = se; edg.w = w; edges.push_back(edg); } } bool comp(Edge a, Edge b) { return (a.w < b.w); } void mst() { sort(edges.begin(), edges.end(), comp); for (long long i = 0; i < edges.size(); i++) { long long fi = edges[i].fi, se = edges[i].se, w = edges[i].w; if (!dsu.same(fi, se)) { cmp--; sum += w; dsu.merge(fi, se); adj[fi].push_back(make_pair(w, se)); adj[se].push_back(make_pair(w, fi)); } } } void dfs(long long x) { mark[x] = true; for (long long i = 0; i < adj[x].size(); i++) { long long child = adj[x][i].second, w = adj[x][i].first; if (mark[child]) continue; par[child][0] = make_pair(x, w); d[child] = d[x] + 1; for (long long j = 1; j < maxl; j++) { long long p = par[par[child][j - 1].first][j - 1].first; long long maxe = max(par[child][j - 1].second, par[par[child][j - 1].first][j - 1].second); par[child][j] = make_pair(p, maxe); } dfs(child); } } pair<long long, long long> findpar(long long x, long long d) { long long p = x, maxe = 0; for (long long i = 0; i < maxl; i++) if ((d >> i) & 1) { maxe = max(maxe, par[p][i].second); p = par[p][i].first; } return make_pair(p, maxe); } long long lca(long long x, long long y) { long long maxe = 0; if (d[x] > d[y]) swap(x, y); maxe = findpar(y, d[y] - d[x]).second; y = findpar(y, d[y] - d[x]).first; if (x == y) return maxe; for (long long i = maxl - 1; i >= 0; i--) if (par[x][i].first != par[y][i].first) { maxe = max(maxe, par[x][i].second); maxe = max(maxe, par[y][i].second); x = par[x][i].first; y = par[y][i].first; } maxe = max(maxe, par[x][0].second); maxe = max(maxe, par[y][0].second); return maxe; } void output() { long long q; cin >> q; for (long long i = 0; i < q; i++) { long long A, B; cin >> A >> B; A--; B--; cout << endl; if (cmp > 2) cout << -1 << endl; if (cmp == 2) if (dsu.same(A, B)) cout << -1 << endl; else cout << sum << endl; if (cmp == 1) cout << sum - lca(A, B) << endl; } } int main() { ios_base::sync_with_stdio(false); input(); mst(); dfs(0); output(); return 0; } |
#include <bits/stdc++.h> size_t solve(const std::vector<std::string>& c) { const size_t n = c.size(); size_t count = 0; for (size_t i = 0; i < n; ++i) { for (size_t j = 0; j < n; ++j) { for (size_t k = j + 1; k < n; ++k) { if (c[i][j] == C && c[i][k] == C ) ++count; if (c[j][i] == C && c[k][i] == C ) ++count; } } } return count; } int main() { size_t n; std::cin >> n; std::vector<std::string> c(n); for (size_t i = 0; i < n; ++i) std::cin >> c[i]; std::cout << solve(c) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int main() { vector<int> goh_nakhor[maxn]; int n, k, ans = 0; cin >> n >> k; for (int i = 0; i < k; i++) { int num, tmp; cin >> num >> tmp; if (tmp != 1) ans += num - 1; for (int i = 0; i < num - 1; i++) { int val; cin >> val; goh_nakhor[tmp].push_back(val); } } int cnt = 0; for (int i = 0; i < goh_nakhor[1].size(); i++) { if (goh_nakhor[1][i] == i + 2) cnt++; } cout << ans + (goh_nakhor[1].size() - cnt - 1) + n - cnt << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; char color[16]; int r[16], b[16]; int redCount[1 << 16], blueCount[1 << 16]; int dp[1 << 16][2][257]; int calc(int mask, bool noRed, int other) { other = min(other, n * n); if (dp[mask][noRed][other] != -1) return dp[mask][noRed][other]; if (mask == (1 << n) - 1) return dp[mask][noRed][other] = 0; dp[mask][noRed][other] = 1000000000; for (int i = 0; i < n; ++i) { if (mask & (1 << i)) continue; int nextMask = mask | (1 << i); int payRed = max(0, r[i] - redCount[mask]), payBlue = max(0, b[i] - blueCount[mask]); int haveRed = 0, haveBlue = 0; if (noRed) haveBlue = other; else haveRed = other; int add = max(max(payRed - haveRed, payBlue - haveBlue), 0); haveRed += add, haveBlue += add; haveRed -= payRed, haveBlue -= payBlue; if (haveRed == 0) dp[mask][noRed][other] = min(dp[mask][noRed][other], add + calc(nextMask, 1, haveBlue)); else if (haveBlue == 0) dp[mask][noRed][other] = min(dp[mask][noRed][other], add + calc(nextMask, 0, haveRed)); } return dp[mask][noRed][other]; } int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> color[i] >> r[i] >> b[i]; for (int i = 0; i < 1 << n; ++i) { for (int j = 0; j < n; ++j) { if ((i & (1 << j)) == 0) continue; if (color[j] == R ) redCount[i]++; else blueCount[i]++; } for (int j = 0; j < 2; ++j) for (int k = 0; k <= 256; ++k) dp[i][j][k] = -1; } int needRed = 0, needBlue = 0; for (int i = 0; i < n; ++i) { needRed += max(0, r[i] - n); needBlue += max(0, b[i] - n); r[i] = min(r[i], n); b[i] = min(b[i], n); } if (needRed >= needBlue) cout << needRed + n + calc(0, 1, needRed - needBlue); else cout << needBlue + n + calc(0, 0, needBlue - needRed); cout << n ; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; struct segment_change { int to_add; segment_change(int _to_add = 0) : to_add(_to_add) {} void reset() { to_add = 0; } bool has_change() const { return to_add != 0; } segment_change combine(const segment_change &other) const { return segment_change(to_add + other.to_add); } }; struct segment { int maximum; segment(int _maximum = -INF) : maximum(_maximum) {} void apply(int, const segment_change &change) { maximum += change.to_add; } void join(const segment &other) { maximum = max(maximum, other.maximum); } void join(const segment &a, const segment &b) { *this = a; join(b); } }; struct add_max_seg_tree { int tree_n = 0; vector<segment> tree; vector<segment_change> changes; add_max_seg_tree(int n = 0) { if (n > 0) init(n); } void init(int n) { tree_n = 1; while (tree_n < n) tree_n *= 2; tree.assign(2 * tree_n, segment()); changes.assign(tree_n, segment_change()); } void build(const vector<segment> &initial) { int n = initial.size(); assert(n <= tree_n); for (int i = 0; i < n; i++) tree[tree_n + i] = initial[i]; for (int position = tree_n - 1; position > 0; position--) tree[position].join(tree[2 * position], tree[2 * position + 1]); } void push_down(int position, int length) { if (!changes[position].has_change()) return; if (2 * position < tree_n) { changes[2 * position] = changes[2 * position].combine(changes[position]); changes[2 * position + 1] = changes[2 * position + 1].combine(changes[position]); } tree[2 * position].apply(length / 2, changes[position]); tree[2 * position + 1].apply(length / 2, changes[position]); changes[position].reset(); } void push_all(int a, int b) { assert(0 <= a && a < b && b <= tree_n); a += tree_n; b += tree_n - 1; for (int up = 31 - __builtin_clz(tree_n); up > 0; up--) { int x = a >> up, y = b >> up; push_down(x, 1 << up); if (x != y) push_down(y, 1 << up); } } void join_and_apply(int position, int length) { tree[position].join(tree[2 * position], tree[2 * position + 1]); tree[position].apply(length, changes[position]); } void join_all(int a, int b) { assert(0 <= a && a < b && b <= tree_n); a += tree_n; b += tree_n - 1; int length = 1; while (a > 1) { a /= 2; b /= 2; length *= 2; join_and_apply(a, length); if (a != b) join_and_apply(b, length); } } pair<int, int> right_half[32]; template <typename T_range_op> void process_range(int a, int b, bool needs_join, T_range_op &&range_op) { if (a == b) return; push_all(a, b); int original_a = a, original_b = b; int length = 1, r_size = 0; for (a += tree_n, b += tree_n; a < b; a /= 2, b /= 2, length *= 2) { if (a & 1) range_op(a++, length); if (b & 1) right_half[r_size++] = {--b, length}; } for (int i = r_size - 1; i >= 0; i--) range_op(right_half[i].first, right_half[i].second); if (needs_join) join_all(original_a, original_b); } segment query(int a, int b) { assert(0 <= a && a <= b && b <= tree_n); segment answer; process_range(a, b, false, [&](int position, int) { answer.join(tree[position]); }); return answer; } void update(int a, int b, const segment_change &change) { assert(0 <= a && a <= b && b <= tree_n); process_range(a, b, true, [&](int position, int length) { tree[position].apply(length, change); if (position < tree_n) changes[position] = changes[position].combine(change); }); } void set_value(int index, int value) { assert(0 <= index && index < tree_n); int current = query(index, index + 1).maximum; update(index, index + 1, segment_change(value - current)); } }; int N; vector<int> parent; vector<vector<int>> children; vector<int> tour_start, tour_end; int tour; void dfs(int node) { tour_start[node] = tour++; for (int child : children[node]) dfs(child); tour_end[node] = tour; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << , ; os << *vi; } os << } ; return os; } template <> ostream &operator<<(ostream &os, const vector<string> &v) { os << { ; for (vector<string>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << , ; os << << *vi << ; } os << } ; return os; } vector<int> solve(vector<int> perm) { assert((int)perm.size() == N); assert(perm.front() == 1); for (int &p : perm) p--; parent.assign(N, -1); vector<pair<int, int>> events; vector<int> stack = {-1}; for (int x : perm) { int erased = -1; while (stack.back() > x) { erased = stack.back(); stack.pop_back(); } events.emplace_back(x, stack.back()); events.emplace_back(erased, x); parent[x] = stack.back(); if (erased >= 0) parent[erased] = x; stack.push_back(x); } children.assign(N, {}); tour_start.resize(N); tour_end.resize(N); for (int i = 0; i < N; i++) if (parent[i] >= 0) children[parent[i]].push_back(i); tour = 0; dfs(0); vector<int> answers(N, INF); add_max_seg_tree tree(N); for (int i = 0; i < N; i++) { int a = events[2 * i].first; int b = events[2 * i].second; assert(a >= 0); tree.set_value( tour_start[a], b < 0 ? 1 : tree.query(tour_start[b], tour_start[b] + 1).maximum + 1); a = events[2 * i + 1].first; b = events[2 * i + 1].second; if (a >= 0) { tree.update(tour_start[a], tour_end[a], segment_change(+1)); } answers[i] = tree.query(0, N).maximum; } return answers; } vector<int> A; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> N; A.resize(N); for (int &a : A) cin >> a; int one = find(A.begin(), A.end(), 1) - A.begin(); vector<int> start_one, end_one; for (int i = one; (int)start_one.size() < N; i = (i + 1) % N) start_one.push_back(A[i]); for (int i = one; (int)end_one.size() < N; i = (i + N - 1) % N) end_one.push_back(A[i]); vector<int> left = solve(end_one), right = solve(start_one); int best_left = 0, best = INF; for (int i = 0; i < N; i++) { if (max(left[i], right[N - 1 - i]) < best) { best = max(left[i], right[N - 1 - i]); best_left = i; } } cout << best << << (one - best_left + N) % N << n ; } |
#include <bits/stdc++.h> using namespace std; int c1, c2, c3, c4, n, m; int rs1, rs2, rs3, rs4, rs; int a, b; int main() { ios_base::sync_with_stdio(0); ; cin.tie(0); ; cin >> c1 >> c2 >> c3 >> c4; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a; rs1 += min(a * c1, c2); } rs2 = min(rs1, c3); for (int i = 1; i <= m; i++) { cin >> b; rs3 += min(b * c1, c2); } rs4 = min(rs3, c3); cout << min(rs2 + rs4, c4); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000005; const int MOD = 1000000007; const int INF = 0x3f3f3f3f; void add(int &x, int y) { x += y; if (x >= MOD) x -= MOD; } int n, h[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &h[i]); h[i]--; } h[n + 1] = INF; int ans = h[1], sum = min(h[1], h[2]); for (int i = 2; i <= n; i++) { add(ans, h[i]); add(ans, 1LL * sum * min(h[i - 1], h[i]) % MOD); sum = 1LL * sum * min(min(h[i - 1], h[i]), h[i + 1]) % MOD; add(sum, min(h[i], h[i + 1])); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> inline long long int min(long long int a, long long int b) { return (a < b) ? a : b; } long long int dp[303][303], cost[303][303]; int main() { int n, m, k, o, j, i; scanf( %d %d %d , &n, &m, &o); for (i = 0; i <= n; i++) for (j = 0; j <= n; j++) dp[i][j] = cost[i][j] = 10000000000000LL; for (i = 0; i < m; i++) { int l, r, c; scanf( %d %d %d , &l, &r, &c); cost[l][r] = min(cost[l][r], c); } for (i = 1; i <= n; i++) for (j = 1; j <= i; j++) for (k = i; k <= n; k++) { cost[j][i] = min(cost[j][i], cost[j][k]); cost[i][k] = min(cost[i][k], cost[j][k]); } for (i = 0; i <= n; i++) { dp[i][0] = 0; for (j = 1; j <= i; j++) { dp[i][j] = min(cost[i - j + 1][i], dp[i - 1][j]); for (k = 1; k < j; k++) dp[i][j] = min(dp[i][j], cost[i - k + 1][i] + dp[i - k][j - k]); } } if (dp[n][o] != 10000000000000LL) printf( %I64d n , dp[n][o]); else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast , unroll-loops ) using namespace std; const long long inf = 1ll << 60; const long long iinf = 2147483647; const long long mod = 998244353; const long long maxn = 1e3 + 5; long long pw(long long x, long long p) { long long ret = 1; while (p > 0) { if (p & 1) { ret *= x; ret %= mod; } x *= x; x %= mod; p >>= 1; } return ret; } long long inv(long long x) { return pw(x, mod - 2); } long long dp[5005][5005]; signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n; cin >> n; vector<long long> vc(n); for (long long i = (0); i < (n); i++) { cin >> vc[i]; } for (long long i = (1); i < (n + 1); i++) { for (long long j = (1); j < (n - i + 1 + 1); j++) { if (i == 1) { dp[i][j] = vc[j - 1]; continue; } dp[i][j] = dp[i - 1][j] ^ dp[i - 1][j + 1]; } } for (long long i = (1); i < (n + 1); i++) { for (long long j = (1); j < (n - i + 1 + 1); j++) { dp[i][j] = max({dp[i][j], dp[i - 1][j], dp[i - 1][j + 1]}); } } long long q; cin >> q; for (long long i = (0); i < (q); i++) { long long l, r; cin >> l >> r; cout << dp[r - l + 1][l] << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; deque<int> items; int tmp; for (int i = 0; i < k; i++) { cin >> tmp; items.push_back(tmp); } int ans = 0; for (int i = 0; i < n * m; i++) { cin >> tmp; for (int j = 0; j < items.size(); j++) { if (items[j] == tmp) { ans += j + 1; items.erase(items.begin() + j); items.push_front(tmp); break; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const unsigned long long x = 31; unsigned long long X[60000]; int Ql[20], Qr[20]; char str[60000], s[60000]; int N; map<unsigned long long, int> T[20]; map<unsigned long long, bool> A; void add(int index, unsigned long long H) { T[index][H] = T[index][H] + 1; } void CalcHashes(char s[], int index) { unsigned long long H; int i, j, L = strlen(s); for (i = 1; i <= L; i++) { H = 0; for (j = 0; j < i; j++) H += X[i - j - 1] * (s[j] - a + 1); add(index, H); for (j = i; j < L; j++) { H = (H - X[i - 1] * (s[j - i] - a + 1)) * x + (s[j] - a + 1); add(index, H); } } } int answer; void check(unsigned long long H) { if (A[H]) return; A[H] = true; int i, t; bool v = true; for (i = 0; i < N && v; i++) { t = T[i][H]; if (t < Ql[i] || Qr[i] < t) v = false; } if (v) answer++; } int main() { unsigned long long H; int i, j, L; for (X[0] = 1, i = 1; i <= 60000; i++) X[i] = X[i - 1] * x; scanf( %s , str); scanf( %d , &N); for (i = 0; i < N; i++) { scanf( %s%d%d , &s, &Ql[i], &Qr[i]); CalcHashes(s, i); } L = strlen(str); for (i = 1; i <= L; i++) { H = 0; for (j = 0; j < i; j++) H += X[i - j - 1] * (str[j] - a + 1); check(H); for (j = i; j < L; j++) { H = (H - X[i - 1] * (str[j - i] - a + 1)) * x + (str[j] - a + 1); check(H); } } printf( %d , answer); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i; scanf( %d , &n); for (i = 1; i <= (n / 2); i++) { if (i & 1) cout << ab ; else cout << ba ; } int k = n / 2; if (n & 1) { if ((k) % 2 == 0) printf( a ); else printf( b ); } } |
#include<bits/stdc++.h> using namespace std; int main(){ int t,n,x; set<int> notes; cin>>t; while(t--){ cin>>n; notes.clear(); for(int i=0;i<n;i++){ cin>>x; if(notes.find(x)==notes.end()){ notes.insert(x); }else{ notes.insert(x+1); } } cout<<notes.size()<<endl; } } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 7; struct node { long long l, r, i; }; bool cmp(node &a, node &b) { return a.l < b.l; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; t = 1; cin >> t; while (t--) { long long n; cin >> n; long long x, y; bool flag = 0; vector<long long> ans(n); vector<node> a; for (long long i = 0; i < n; i++) { cin >> x >> y; a.push_back({x, y, i}); } sort((a).begin(), (a).end(), cmp); long long p = -1; x = a[0].r; for (long long i = 1; i < n; i++) { if (x < a[i].l) { p = i; break; } x = max(x, a[i].r); } if (p == -1) cout << -1 << n ; else { for (long long i = 0; i < p; i++) ans[a[i].i] = 1; for (long long i = p; i < n; i++) ans[a[i].i] = 2; for (auto i : ans) cout << i << ; cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const double eps = 1e-9; const int inf = 1e9; int deg[N]; int main() { int t; scanf( %d , &t); while (t--) { int n, x; scanf( %d%d , &n, &x); for (int i = 0; i < n + 10; i++) deg[i] = 0; for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); deg[u]++; deg[v]++; } if (deg[x] < 2) printf( Ayush n ); else { if (n & 1) printf( Ashish n ); else printf( Ayush n ); } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << YES n ; for (int i = 1; i <= n; i++) { int x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; cout << (2 * ((x1 % 2 + 2) % 2) + (y1 % 2 + 2) % 2) + 1 << n ; } } |
#include <bits/stdc++.h> using namespace std; int get() { char ch; while (ch = getchar(), (ch < 0 || ch > 9 ) && ch != - ) ; if (ch == - ) { int s = 0; while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; return -s; } int s = ch - 0 ; while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; return s; } const int N = 1e3 + 5; int n; struct point { int x, y, col, id; void read() { x = get(); y = get(); col = get(); } } a[N]; int cross(point a, point b, point c) { return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y); } int operator*(point a, point b) { return a.x * b.y - a.y * b.x; } point operator-(point a, point b) { a.x -= b.x, a.y -= b.y; return a; } point operator+(point a, point b) { a.x += b.x, a.y += b.y; return a; } int be[N]; point sta[N]; int top; bool cmp(point a, point b) { return a.x == b.x ? a.y < b.y : a.x < b.x; } struct edge { int x, y; edge(const int x_ = 0, const int y_ = 0) { x = x_; y = y_; } } ed[N]; int tot; point que[N]; int k; bool inside(point a, point b, point c, point q) { return ((cross(a, b, q) >= 0) != (cross(a, c, q) >= 0)) && ((cross(b, a, q) >= 0) != cross(b, c, q) >= 0) && ((cross(c, a, q) >= 0) != (cross(c, b, q) >= 0)); } void solve(point A, point B, point C) { for (int i = 1; i <= n; i++) if (a[i].col == C.col && inside(A, B, C, a[i])) { ed[++tot] = edge(C.id, a[i].id); solve(A, B, a[i]); solve(a[i], C, A); solve(a[i], C, B); return; } for (int i = 1; i <= n; i++) if (inside(A, B, C, a[i])) ed[++tot] = edge(A.id, a[i].id); } int main() { n = get(); int all = 0; for (int i = 1; i <= n; i++) { a[i].read(); a[i].id = i; all |= 1 << a[i].col; } if (all != 3) { printf( %d n , n - 1); for (int i = 1; i <= n - 1; i++) printf( %d %d n , 0, i); return 0; } sort(a + 1, a + 1 + n, cmp); top = 0; for (int i = 1; i <= n; i++) { if (top && sta[top].x == a[i].x) continue; while (top > 1 && cross(sta[top - 1], a[i], sta[top]) >= 0) top--; sta[++top] = a[i]; } for (int i = 1; i <= top; i++) be[sta[i].id] = 1; top = 0; for (int i = n; i >= 1; i--) { if (top && sta[top].x == a[i].x) continue; while (top > 1 && cross(sta[top - 1], a[i], sta[top]) >= 0) top--; sta[++top] = a[i]; } for (int i = 1; i <= top; i++) if (!be[sta[i].id]) be[sta[i].id] = 2; k = 0; for (int i = 1; i <= n; i++) if (be[a[i].id] == 1) que[++k] = a[i]; for (int i = n; i >= 1; i--) if (be[a[i].id] == 2) que[++k] = a[i]; int cnt = 0, keyw = 0; for (int i = 1; i <= k; i++) if (que[i].col != que[(i + k - 2) % k + 1].col) { cnt++; keyw = i; } if (cnt > 2) return printf( Impossible n ), 0; if (cnt == 0) { for (int i = 1; i <= k - 1; i++) ed[++tot] = edge(que[i].id, que[i + 1].id); point other; for (int i = 1; i <= n; i++) if (a[i].col != que[1].col) { other = a[i]; break; } for (int i = 1; i <= k - 1; i++) solve(que[i], que[i + 1], other); solve(que[k], que[1], other); } else { int x = keyw; for (; que[x].col == que[keyw].col; x = x % k + 1) { if (que[x].col == que[x % k + 1].col) { solve(que[x], que[x % k + 1], que[(keyw + k - 2) % k + 1]); ed[++tot] = edge(que[x].id, que[x % k + 1].id); } } int lst = (x + k - 2) % k + 1; for (; x != keyw; x = x % k + 1) { if (que[x].col == que[x % k + 1].col) { solve(que[x], que[x % k + 1], que[lst]); ed[++tot] = edge(que[x].id, que[x % k + 1].id); } } } printf( %d n , tot); for (int i = 1; i <= tot; i++) printf( %d %d n , ed[i].x - 1, ed[i].y - 1); return 0; } |
#include <bits/stdc++.h> int sm(int a, int b) { if (a % b == 0) return b; else return a % b; } int main() { int n, m, s; scanf( %d%d%d , &n, &m, &s); printf( %I64d , (long long)sm(n, s) * sm(m, s) * ((n - 1) / s + 1) * ((m - 1) / s + 1)); } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e17 + 9; long long n, m; vector<int> num; long long dp[100009][2]; void solve(int tp) { multiset<int> s; multiset<int>::iterator it; if (tp == 0) { for (long long i = 1; i < (m + 1); ++i) { s.insert(num[i]); it = s.upper_bound(num[i]); if (it != s.end()) s.erase(it); dp[i][tp] = (long long)(s).size(); } } else { for (long long i = m + 1 - 1; i >= 1; i--) { s.insert(num[i]); it = s.upper_bound(num[i]); if (it != s.end()) s.erase(it); dp[i][tp] = (long long)(s).size(); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; long long acum[100009]; memset(acum, 0, sizeof acum); for (long long i = 0; i < (n); ++i) { long long a, b; cin >> a >> b; acum[a]++; acum[b + 1]--; } for (long long i = 1; i < (m + 2); ++i) { acum[i] += acum[i - 1]; } for (long long i = 0; i < (m + 1); ++i) { num.push_back(acum[i]); } solve(0); solve(1); long long ans = 0; for (long long i = 1; i < (m + 1); ++i) { ans = max({dp[i][0] + dp[i][1] - 1, ans}); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i; cin >> n; pair<int, int> a[n]; for (i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + n); int ans = a[0].first / max(a[0].second - 1, n - a[0].second); for (i = 1; i < n - 1; i++) ans = min(ans, a[i].first / max(a[i].second - 1, n - a[i].second)); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; class substr { public: string str; int id; bool operator<(const substr &a) const { return str > a.str; } }; priority_queue<substr> Q; int main() { string s; int k, n; cin >> s >> k; n = s.length(); for (int i = 0; i < n; i++) { substr a; a.str = s[i]; a.id = i; Q.push(a); } while (!Q.empty()) { substr p; p = Q.top(); Q.pop(); k--; if (!k) { cout << p.str << endl; return 0; } if (p.id != n - 1) { p.str = p.str + s[p.id + 1]; p.id = p.id + 1; Q.push(p); } } cout << No such line. << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; double dp[1 << 20][20], p[20][20]; bool mark[1 << 20][20]; int n; double mem(int mask, int winner) { if (!mask) return (winner == 1); if (mark[mask][winner]) return dp[mask][winner]; mark[mask][winner] = true; double &ret = dp[mask][winner]; for (int i = 1; i < n; i++) if (mask & (1 << i)) { double tmp = 0; tmp += p[i][winner] * mem(mask ^ (1 << i), i); tmp += p[winner][i] * mem(mask ^ (1 << i), winner); ret = max(ret, tmp); } return ret; } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) { p[i][0] = 1; for (int j = 1; j <= n; j++) cin >> p[i][j]; } n++; cout << setprecision(10) << fixed << mem((1 << n) - 2, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = int(1e9) + 7; int main() { ios::sync_with_stdio(false); ios_base::sync_with_stdio(false); long long n, m; cin >> n >> m; vector<long long> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } if (n >= 1001) { cout << 0; return 0; } long long res = 1; for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) res = (res * (abs(a[i] - a[j]))) % m; cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int dp[100005]; vector<int> t; vector<pair<int, int> > p; int r, n; cin >> r >> n; t.push_back(0); p.push_back(make_pair(1, 1)); for (int i = 0; i < n; i++) { dp[i] = 0; int x, y; cin >> x; t.push_back(x); cin >> x >> y; p.push_back(make_pair(x, y)); } int maxi = 0, ans = 0; dp[n] = 0; for (int i = n; i >= 0; i--) { for (int j = i - 1; j >= max(0, i - 2000); j--) { int dif = abs(p[i].first - p[j].first) + abs(p[i].second - p[j].second); if (dif <= abs(t[i] - t[j])) { dp[j] = max(dp[j], dp[i] + 1); } } } cout << dp[0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 10005; void solve() { string s; cin >> s; int n = s.size(); s = a + s; set<int> one, zero; vector<int> ans[n]; for (int i = 0; i < n; i++) zero.insert(i); for (int i = 1; i <= n; i++) { if (s[i] == 0 ) { if (zero.size() == 0) { cout << -1; return; } else { auto it = zero.begin(); int val = *it; ans[val].push_back(i); zero.erase(it); one.insert(val); } } else { if (one.size() == 0) { cout << -1; return; } else { auto it = one.begin(); int val = *it; ans[val].push_back(i); one.erase(it); zero.insert(val); } } } int cnt = 0; for (int i = 0; i < n; i++) { if (ans[i].size() == 0) break; if (s[ans[i][ans[i].size() - 1]] == 1 ) { cout << -1 ; return; } cnt++; } cout << cnt << n ; for (int i = 0; i < cnt; i++) { cout << ans[i].size() << ; for (auto X : ans[i]) cout << X << ; cout << n ; } } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); ; int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int a[3010], id[3010], num[3010]; vector<int> ans; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } int m; scanf( %d , &m); int need = n - m; while (true) { int tot = 0; memset(id, -1, sizeof(id)); memset(num, 0, sizeof(num)); for (int i = 1; i <= n; i++) { if (id[i] == -1) { id[i] = tot; int now = a[i]; while (now != i) { id[now] = tot; now = a[now]; } tot++; } } for (int i = 1; i <= n; i++) { num[id[i]]++; } if (tot == need) break; if (tot > need) { for (int i = 2; i <= n; i++) { if (id[i] != id[1]) { ans.push_back(1); ans.push_back(i); swap(a[1], a[i]); break; } } } else { for (int i = 1; i <= n; i++) { if (num[id[i]] == 1) continue; for (int j = i + 1; j <= n; j++) { if (id[i] == id[j]) { ans.push_back(i); ans.push_back(j); swap(a[i], a[j]); break; } } break; } } } printf( %d n , ans.size() / 2); for (int i = 0; i < ans.size(); i++) { if (i) printf( ); printf( %d , ans[i]); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int fl = 1; cin >> s; for (int i = 0; i < s.size(); ++i) { if (s[i] == 1 || s[i] == 2 ) fl = 0; else if (s[i] == 3 && s[s.size() - i - 1] != 3 ) fl = 0; else if (s[i] == 7 && s[s.size() - i - 1] != 7 ) fl = 0; else if (s[i] == 4 && s[s.size() - i - 1] != 6 ) fl = 0; else if (s[i] == 6 && s[s.size() - i - 1] != 4 ) fl = 0; else if (s[i] == 5 && s[s.size() - i - 1] != 9 ) fl = 0; else if (s[i] == 9 && s[s.size() - i - 1] != 5 ) fl = 0; else if (s[i] == 8 && s[s.size() - i - 1] != 0 ) fl = 0; else if (s[i] == 0 && s[s.size() - i - 1] != 8 ) fl = 0; } if (fl == 1) cout << Yes ; else cout << No ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool debug; const int inf = 1e9 + 5; const int nax = 205; int k; namespace MinCost { struct Edge { int w, c, v, rev; Edge(int _w, int _c, int _v, int _rev) : w(_w), c(_c), v(_v), rev(_rev) {} }; int odl[nax], pot[nax], pop[nax], pop_kraw[nax]; vector<Edge> v[nax]; bool bylo[nax]; void init(int n) { for (int i = 0; i <= n; ++i) v[i].clear(); } void AddEdge(int a, int b, int cap, int cost) { v[a].push_back(Edge(b, cap, cost, int(v[b].size()) + (a == b))); v[b].push_back(Edge(a, 0, -cost, int(v[a].size() - 1))); } pair<int, int> MinCostMaxFlow(int s, int t, int n) { int flow = 0, cost = 0; for (int i = 0; i <= n; ++i) pot[i] = 0; while (true) { for (int i = 0; i <= n; ++i) { odl[i] = inf; bylo[i] = false; } odl[s] = 0; for (int k = 0; k <= (n)-1; ++k) { int x = 0; int najm = inf; for (int i = 0; i <= n; ++i) if (!bylo[i] && najm > odl[i]) { x = i; najm = odl[i]; } bylo[x] = true; int dl = v[x].size(); for (int i = 0; i <= (dl)-1; ++i) if (v[x][i].c > 0 && odl[v[x][i].w] > odl[x] + pot[x] - pot[v[x][i].w] + v[x][i].v) { odl[v[x][i].w] = odl[x] + pot[x] - pot[v[x][i].w] + v[x][i].v; pop[v[x][i].w] = x; pop_kraw[v[x][i].w] = i; } } if (odl[t] == inf) break; for (int i = 0; i <= n; ++i) pot[i] += odl[i]; int x = t; int cap = inf; while (x != s) { cap = min(cap, v[pop[x]][pop_kraw[x]].c); x = pop[x]; } x = t; int one_path_cost = 0; while (x != s) { one_path_cost += v[pop[x]][pop_kraw[x]].v; v[pop[x]][pop_kraw[x]].c -= cap; v[x][v[pop[x]][pop_kraw[x]].rev].c += cap; x = pop[x]; } int ile_zmiesci = one_path_cost ? (k - cost) / one_path_cost : inf; cost += min(cap, ile_zmiesci) * one_path_cost; flow += min(cap, ile_zmiesci); if (ile_zmiesci < cap) break; } return make_pair(flow, cost); } }; // namespace MinCost using namespace MinCost; int n, a; int main(int argc, char* argv[]) { scanf( %d%d , &n, &k); init(n - 1); for (int i = 0; i <= (n)-1; ++i) for (int j = 0; j <= (n)-1; ++j) { scanf( %d , &a); if (a > 0) { AddEdge(i, j, a, 0); AddEdge(i, j, k, 1); } } printf( %d n , MinCostMaxFlow(0, n - 1, n - 1).first); return 0; } |
#include <bits/stdc++.h> using namespace std; int num[10]; int main(void) { int T, n; scanf( %d , &T); while (T--) { memset(num, 0, sizeof(num)); scanf( %d , &n); num[1] = n / 2; if (n & 01) { printf( 7 ); for (int i = 1; i < num[1]; ++i) printf( 1 ); } else for (int i = 0; i < num[1]; ++i) printf( 1 ); if (T) printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int tree[2000005] = {0}, num[500005] = {0}, dp[500005] = {1}; void modify(int index, int l, int r, int ql, int qr, int v) { if (ql <= l && qr >= r) { tree[index] = v; return; } int mid = (l + r) >> 1; if (ql <= mid && qr >= l) modify(index << 1, l, mid, ql, qr, v); if (ql <= r && qr >= mid + 1) modify(index << 1 | 1, mid + 1, r, ql, qr, v); tree[index] = max(tree[index << 1], tree[index << 1 | 1]); } int query(int index, int l, int r, int ql, int qr) { if (ql <= l && qr >= r) return tree[index]; int mid = (l + r) >> 1, ans = 0; if (ql <= mid && qr >= l) ans = max(ans, query(index << 1, l, mid, ql, qr)); if (ql <= r && qr >= mid + 1) ans = max(ans, query(index << 1 | 1, mid + 1, r, ql, qr)); return ans; } int main() { int i, n, k, d, index = 0; scanf( %d%d%d , &n, &k, &d); for (i = 1; i <= n; i++) scanf( %d , &num[i]); sort(num + 1, num + n + 1); modify(1, 0, n, 0, 0, 1); for (i = 1; i <= n; i++) { while (num[i] > num[index] + d) index++; if (i - k >= index - 1) dp[i] = query(1, 0, n, index - 1, i - k); else dp[i] = 0; modify(1, 0, n, i, i, dp[i]); } if (dp[n]) puts( YES ); else puts( NO ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; long long res = 0; cin >> n >> m >> k; map<int, long long> dp; bool arr[n + 1], s[m + 1]; for (int i = 0; i < n; i++) cin >> arr[i]; arr[n] = 0; for (int i = 0; i < m; i++) cin >> s[i]; s[m] = 0; int ones = 0; for (int i = 0; i < n + 1; i++) { if (arr[i]) ones++; else if (ones) { if (dp.find(ones) != dp.end()) { res += dp[ones]; ones = 0; continue; } int tones = 0; long long dpres = 0; long long prev = 0; for (int j = 0; j < m + 1; j++) { if (s[j]) { tones++; dpres += prev; if (k % tones == 0 && tones * ones >= k) { dpres += ones - (k / tones) + 1; prev += ones - (k / tones) + 1; } } else { tones = 0; prev = 0; } } dp[ones] = dpres; res += dpres; ones = 0; } } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int n; signed main() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> s; vector<pair<int, int>> a; vector<int> p(n, 0), nxt(n, 0); stack<pair<int, int>> S; S.push({0, -1}); for (int i = 0; i < n; ++i) { if (s[i] == ( ) { p[i] = S.top().second; a.push_back({S.top().first + 1, i}); S.push({a.back().first, i}); } else { nxt[S.top().second] = i; S.pop(); } } sort(a.rbegin(), a.rend()); string k(n, x ); for (int i = 0; i < int(a.size()); ++i) { int y = a[i].second; if (k[y] != x ) { k[nxt[y]] = k[y]; continue; } int c = -1, cnt = 0; for (y = a[i].second; y != -1 && k[y] == x ; y = p[y]) cnt ^= 1; if (y != -1) c = k[y] - 0 ; int t = 1; if (c != -1) t = c ^ cnt; for (y = a[i].second; y != -1 && k[y] == x ; t ^= 1, y = p[y]) k[y] = t + 0 ; k[nxt[a[i].second]] = k[a[i].second]; } cout << k << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; set<int> S; void dfs(int Cur, int dgt, int x, int y) { if (dgt == 11) return; if (Cur > 0) S.insert(Cur); dfs(Cur * 10 + x, dgt + 1, x, y); dfs(Cur * 10 + y, dgt + 1, x, y); return; } int main() { int n, Ans = 0; cin >> n; S.insert(1e9); for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { dfs(0, 1, i, j); } } for (auto x : S) { if (x > n) break; else Ans++; } cout << Ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool deb_mode = 0; class debugger { vector<string> vars; public: template <typename T> debugger &operator,(const T v) { stringstream ss; ss << v, vars.push_back(ss.str()); return *this; } void printall() { int j = 0, l = vars.size(); for (int i = 0; i < (l - 1); i++) { if (i) cout << , ; for (; j < vars[l - 1].size(); j++) { if (vars[l - 1][j] == , ) { j++; break; } cout << vars[l - 1][j]; } cout << = << vars[i]; } vars.clear(); } } Dbug; template <typename T1, typename T2> inline ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> inline ostream &operator<<(ostream &os, const vector<T> &v) { bool first = true; os << { ; for (unsigned int i = 0; i < v.size(); i++) { if (!first) os << , ; os << v[i]; first = false; } return os << } ; } template <typename T> inline ostream &operator<<(ostream &os, const set<T> &v) { bool first = true; os << { ; for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) { if (!first) os << , ; os << *ii; first = false; } return os << } ; } template <typename T1, typename T2> inline ostream &operator<<(ostream &os, const map<T1, T2> &v) { bool first = true; os << { ; for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end(); ++ii) { if (!first) os << , ; os << *ii; first = false; } return os << } ; } template <typename T> void getarray(T a[], int b, int e) { for (int i = b; i < e + b; i++) cin >> a[i]; } template <typename T> void printarray(T a[], int b, int e) { for (int i = b; i < e - 1 + b; i++) cout << a[i] << ; if (e - 1 + b >= 0) cout << a[e - 1 + b] << n ; } template <typename T> void printV(vector<T> v) { int sz = v.size(); if (sz) cout << v[0]; for (int i = 1; i < sz; i++) cout << << v[i]; printf( n ); } template <typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <typename T> T BigMod(T b, T p, T m) { if (p == 0) return 1; if (p % 2 == 0) { T s = BigMod(b, p / 2, m); return ((s % m) * (s % m)) % m; } return ((b % m) * (BigMod(b, p - 1, m) % m)) % m; } template <typename T> T ModInv(T b, T m) { return BigMod(b, m - 2, m); } pair<long long int, pair<long long int, long long int> > ext_gcd( long long int a, long long int b) { if (b == 0) return make_pair(a, make_pair(1LL, 0LL)); pair<long long int, pair<long long int, long long int> > t = ext_gcd(b, a % b); return make_pair( t.first, make_pair(t.second.second, t.second.first - a / b * t.second.second)); } long long int ModInvNonPrimeM(long long int N, long long int M) { pair<long long int, pair<long long int, long long int> > r = ext_gcd(N, M); r.second.first %= M; if (r.second.first < 0) r.second.first += M; return r.second.first; } template <class T> inline void read(T &x) { bool Minus = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) Minus = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (Minus) x = -x; } char getc() { char c; for (c = getchar(); c <= 32; c = getchar()) ; return c; } int CI(int &_x) { return scanf( %d , &_x); } int CI(int &_x, int &_y) { return scanf( %d %d , &_x, &_y); } int CI(int &_x, int &_y, int &_z) { return scanf( %d %d %d , &_x, &_y, &_z); } int CI(int &_a, int &_b, int &_c, int &_d) { return scanf( %d %d %d %d , &_a, &_b, &_c, &_d); } template <class T1, class T2> inline T1 UMAX(T1 &m, T2 other) { if (m < other) m = other; return m; } template <class T1, class T2> inline T1 UMIN(T1 &m, T2 other) { if (m > other) m = other; return m; } template <class T> string toString(T n) { ostringstream oss; oss << n; return oss.str(); } int toInt(string s) { int r = 0; istringstream sin(s); sin >> r; return r; } long long int toLong(string s) { long long int r = 0; istringstream sin(s); sin >> r; return r; } bool isVowel(char ch) { ch = tolower(ch); if (ch == a || ch == e || ch == i || ch == o || ch == u ) return true; return false; } bool isUpper(char c) { return c >= A && c <= Z ; } bool isLower(char c) { return c >= a && c <= z ; } int dr8[8] = {+1, -1, +0, +0, +1, -1, -1, +1}; int dc8[8] = {+0, +0, -1, +1, +1, +1, -1, -1}; int dr4[4] = {+0, +0, +1, -1}; int dc4[4] = {-1, +1, +0, +0}; int kn8r[8] = {+1, +2, +2, +1, -1, -2, -2, -1}; int kn8c[8] = {+2, +1, -1, -2, -2, -1, +1, +2}; const double EPS = 1e-9; const int INF = (1 << 30) - 1; const long long int LINF = (1ll << 62) - 1; const int mod = (int)1e9 + 7; const int MAX = (int)1e5; int N, M, X; int main() { if (deb_mode) srand(int(time(NULL))); int i, j, k, l, n, m, q, a, b, c; cin >> N >> M >> X; X--; if (N > M) { cout << 0 n ; return 0; } int DP[2][N + 5][N + 5]; memset(DP, 0, sizeof(DP)); DP[M & 1][N][0] = 1; int posNow, posPrev; for (int pos = M; pos >= 0; pos--) { posNow = pos & 1; posPrev = (pos - 1) & 1; for (i = 0; i < N + 1; i++) for (j = 0; j < N + 1; j++) DP[posPrev][i][j] = 0; for (int seg = 0; seg <= N; seg++) { for (int open = 0; open <= N; open++) { if (open) DP[posPrev][seg][open - 1] = (DP[posPrev][seg][open - 1] + DP[posNow][seg][open]) % mod; if (pos - 1 != X && seg) DP[posPrev][seg - 1][open + 1] = (DP[posPrev][seg - 1][open + 1] + DP[posNow][seg][open]) % mod; if (seg) DP[posPrev][seg - 1][open] = (DP[posPrev][seg - 1][open] + DP[posNow][seg][open]) % mod; if (pos - 1 != X) DP[posPrev][seg][open] = (DP[posPrev][seg][open] + DP[posNow][seg][open]) % mod; } } } long long int ANS = DP[posNow][0][0]; for (i = 1; i <= N; i++) ANS = (ANS * i) % mod; cout << ANS << n ; if (deb_mode) cerr << EXECUTION TIME = << (1.0 * clock()) / CLOCKS_PER_SEC << SECONDS n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; while (scanf( %d , &n) != EOF) { for (int i = 0; i <= n; i++) { int space = (n - i) * 2; for (int j = 0; j < space; j++) printf( ); if (!i) printf( %d n , 0); else { for (int j = 0; j <= i; j++) printf( %d , j); for (int j = i - 1; j > 0; j--) printf( %d , j); printf( %d n , 0); } } for (int i = n - 1; i >= 0; i--) { int space = (n - i) * 2; for (int j = 0; j < space; j++) printf( ); if (!i) printf( %d n , 0); else { for (int j = 0; j <= i; j++) printf( %d , j); for (int j = i - 1; j > 0; j--) printf( %d , j); printf( %d n , 0); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, l, r, x, y, o, e, w, z, b[50000], aa, bb, ans; vector<int> vec; map<int, int> ma; int main() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> l >> r >> x >> y; if (y % x != 0) { cout << 0 << endl; return 0; } else y /= x; for (int i = 2; i * i <= y; i++) if (y % i == 0) { vec.push_back(i); while (y % i == 0) { y /= i; ma[i]++; } } if (y > 1) { vec.push_back(y); ma[y]++; } z = vec.size(); for (int i = 0; i < (1 << z); i++) { w = i; for (int j = 0; j < z; j++) b[j] = 0; o = 0; while (w) { b[o] = w & 1; w >>= 1; o++; } aa = bb = 1; for (int j = 0; j < z; j++) if (b[j] == 1) { e = ma[vec[j]]; for (int h = 1; h <= e; h++) aa *= vec[j]; } else { e = ma[vec[j]]; for (int h = 1; h <= e; h++) bb *= vec[j]; } if (l <= aa * x && aa * x <= r && l <= bb * x && bb * x <= r) ans++; } cout << ans << endl; return 0; } |
#include<bits/stdc++.h> using namespace std; #define ll long long int main() { ll k,l,r,t,x,y; cin>>k>>l>>r>>t>>x>>y; if(k<l || k>r) { cout<< No <<endl; return 0; } if(x>y) { if(k+y>r) k-=x; t--; if(k<l) return cout<< No <<endl,0; if((k-l)/(x-y) < t ) { cout<< No <<endl; return 0; } cout<< Yes <<endl; return 0; } else { vector<bool> was(x,false); while(t>0) { if(was[k%x]) return cout<< Yes <<endl,0; was[k%x]=true; ll remd=min(t,(k-l)/x); k-=remd*x; t-=remd; if(t==0) return cout<< Yes <<endl,0; t--; if(k+y<=r) k+=y; k=k-x; if(k<l || k>r) return cout<< No <<endl,0; } cout<< Yes <<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)3e5 + 99; const long long INF = (long long)1e18 + 100; int a[N]; int b[N]; long long dp[N][3]; int n; long long calc(long long add, long long pos) { long long &res = dp[pos][add]; if (res != -1) return res; res = INF; if (pos == n) return res = 0; for (long long x = 0; x <= 2; x++) { if (pos == 0 || a[pos] + x != a[pos - 1] + add) res = min(res, calc(x, pos + 1) + x * (b[pos])); } return res; } void Solve() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i] >> b[i]; for (int i = 0; i <= n; i++) dp[i][0] = dp[i][1] = dp[i][2] = -1; cout << calc(0, 0) << n ; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin >> t; while (t--) { Solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int cnt = 0; for (int i = 0; i < n; i++) { if (s[i] == + ) { cnt++; } else if (s[i] == - && cnt) { cnt--; } } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool judge(int key) { for (int i = 2; i * i <= key; i++) { if (key % i == 0) return false; } return true; } int main() { int n; scanf( %d , &n); if (n & 1 || n == 2) { if (judge(n)) printf( 1 n ); else if (judge(n - 2)) printf( 2 n ); else printf( 3 n ); } else printf( 2 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> v[3001]; int size1[3001]; map<vector<int>, int> mm; long dis[3001][3001]; void dijkstra(int n) { priority_queue<vector<int>> pq; vector<int> p(3, 0), p1(3); p[0] = 0; p[2] = 1; pq.push(p); long size = 1; while (size) { p = pq.top(); pq.pop(); --size; if ((dis[p[2]][p[1]] > p[0]) && (dis[p[2]][p[1]] != 0)) { continue; } if (p[2] == n) return; for (int i = 0; i < size1[p[2]]; ++i) { p1[0] = p[1]; p1[1] = p[2]; p1[2] = v[p[2]][i]; if (mm[p1] == 1) continue; if ((dis[p1[2]][p1[1]] < dis[p[2]][p[1]] - 1) || (dis[p1[2]][p1[1]] == 0)) { dis[p1[2]][p1[1]] = dis[p[2]][p[1]] - 1; p1[0] = dis[p1[2]][p1[1]]; pq.push(p1); ++size; if ((p1[2] == n) && (p1[0] == -1)) return; } } } } int main() { int n, m, a, b, c, k; cin >> n >> m >> k; vector<int> arr(3); for (int i = 0; i < m; ++i) { scanf( %d %d , &a, &b); v[a].emplace_back(b); size1[a]++; v[b].emplace_back(a); size1[b]++; } for (int i = 0; i < k; ++i) { scanf( %d %d %d , &arr[0], &arr[1], &arr[2]); mm[arr] = 1; } dijkstra(n); long maxim = 0; int maximindex = 0; for (int i = 1; i <= n; ++i) { if (dis[n][i] == 0) { continue; } if ((dis[n][i] > maxim) || (maxim == 0)) { maxim = dis[n][i]; maximindex = i; } } if (maxim == 0) { cout << -1 << endl; return 0; } int i = n; int j = maximindex; stack<int> s; s.push(i); long ans = 1; int size2 = 1; i = maximindex; maxim++; while (maxim < 0) { for (int j = 1; j <= n; ++j) { if (dis[i][j] == 0) continue; if (dis[i][j] == maxim) { maximindex = j; break; } } ++ans; s.push(i); ++size2; maxim++; i = maximindex; } cout << ans << endl; cout << 1 << ; while (size2) { printf( %d , s.top()); s.pop(); --size2; } return 0; } |
#include <bits/stdc++.h> using namespace std; int t, a[2000 + 10][2000 + 10], ans[2000 + 10][2000 + 10], viz[30]; pair<int, int> fs[30], ls[30]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; while (t--) { int n, m, l = 0; pair<int, int> aux = {0, 0}; cin >> n >> m; for (int i = 1; i <= 26; i++) viz[i] = 0, fs[i] = {0, 0}, ls[i] = {0, 0}; for (int i = 1; i <= n; i++) { string s; cin >> s; for (int j = 0; j < m; j++) { if (s[j] >= a && s[j] <= z ) a[i][j + 1] = s[j] - a + 1; else a[i][j + 1] = 0; } } for (int ch = 1; ch <= 26; ch++) for (int i = 1; i <= n && !viz[ch]; i++) for (int j = 1; j <= m && !viz[ch]; j++) if (a[i][j] == ch) { viz[ch] = 1; fs[ch] = {i, j}; int j1 = j + 1, i1 = i + 1, ok = 0; while (j1 <= m) { if (a[i][j1] == ch) ok = 1, ls[ch] = {i, j1}; j1++; } while (i1 <= n) { if (a[i1][j] == ch) ok = 1, ls[ch] = {i1, j}; i1++; } if (!ok) ls[ch] = fs[ch]; l = ch; aux = fs[ch]; } for (int i = 1; i <= l; i++) { if (!fs[i].first) { fs[i] = aux; ls[i] = aux; } for (int i1 = fs[i].first; i1 <= ls[i].first; i1++) for (int j1 = fs[i].second; j1 <= ls[i].second; j1++) ans[i1][j1] = i; } int ok = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (ans[i][j] != a[i][j]) ok = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) a[i][j] = ans[i][j] = 0; if (!ok) { cout << NO << n ; continue; } cout << YES << n ; cout << l << n ; for (int i = 1; i <= l; i++) cout << fs[i].first << << fs[i].second << << ls[i].first << << ls[i].second << n ; } return 0; } |
#include <bits/stdc++.h> const int N = 35; int n, m; int A[N][N], F[N][N]; int main() { scanf( %d , &n); m = (n + 1) >> 1; int ans = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { scanf( %d , &A[i][j]); ans += A[i][j]; } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) F[i][j] = 1; for (int stat = 0; stat < 1 << m; stat++) { int sum = 0; for (int i = 1; i <= m; i++) { F[m][i] = (stat >> (i - 1) & 1) ? -1 : 1; sum += (A[m][i] * F[m][i]); } for (int i = m + 1; i <= n; i++) { F[m][i] = F[m][i - m] * F[m][m]; sum += (A[m][i] * F[m][i]); } for (int i = 1; i < m; i++) { int s, ti = i + m; for (int j = 0; j < 2; j++, F[i][m] *= -1) { F[i + m][m] = F[i][m] * F[m][m]; int t = (A[i][m] * F[i][m]) + (A[i + m][m] * F[i + m][m]); for (int k = 1; k < m; k++) { int tk = k + m; F[i][tk] = F[i][k] * F[i][m]; F[ti][k] = F[i][k] * F[m][k]; F[ti][tk] = F[i][tk] * F[m][tk]; t += fabs((A[i][k] * F[i][k]) + (A[i][tk] * F[i][tk]) + (A[ti][k] * F[ti][k]) + (A[ti][tk] * F[ti][tk])); } if (!j || t > s) s = t; } sum += s; } if (sum > ans) ans = sum; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 9e2 + 1; int n, m, g[maxn], G, o1[maxn], o2[maxn], deg[maxn]; vector<int> e[maxn], e_s[maxn], r_e_s[maxn], topo, ans, wow[maxn]; vector<pair<int, int> > edge, res; bool mark[maxn]; map<int, int> is[maxn]; void dfs(int v) { mark[v] = 1; for (auto u : e[v]) { if (is[v][u] == 0) { e_s[v].push_back(u); r_e_s[u].push_back(v); is[v][u] = 1; is[u][v] = 1; } if (mark[u] == 0) { dfs(u); } } } void topol(int v) { mark[v] = 1; for (auto u : e_s[v]) { if (mark[u] == 0) { topol(u); } } topo.push_back(v); } void col(int v) { mark[v] = 1; g[v] = G; o2[G] = v; for (auto u : r_e_s[v]) { if (mark[u] == 0) { col(u); } } return; } void Last_one(int v) { mark[v] = 1; for (auto u : wow[v]) { if (mark[u] == 0) { Last_one(u); } } if (deg[v] == 1) { ans.push_back(v); } return; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; if (n == 2) { cout << -1 << endl; return 0; } for (int i = 0; i < m; i++) { int t1, t2; cin >> t1 >> t2; e[t1].push_back(t2); e[t2].push_back(t1); edge.push_back({t1, t2}); } dfs(1); for (int i = 1; i <= n; i++) { mark[i] = 0; } topol(1); for (int i = 1; i <= n; i++) { mark[i] = 0; } reverse(topo.begin(), topo.end()); G = 1; for (auto u : topo) { if (mark[u] == 0) { o1[G] = u; col(u); G++; } } for (auto tmp : edge) { if (g[tmp.first] != g[tmp.second]) { deg[g[tmp.first]]++; deg[g[tmp.second]]++; wow[g[tmp.first]].push_back(g[tmp.second]); wow[g[tmp.second]].push_back(g[tmp.first]); } } if (G == 3) { ans.push_back(1); ans.push_back(2); } else { for (int i = 1; i <= n; i++) { mark[i] = 0; } for (int i = 1; i < G; i++) { if (deg[i] >= 2) { Last_one(i); break; } } } for (int i = 0; i < ((int)ans.size() + 1) / 2; i++) { int t1 = ans[i]; int t2 = ans[i + (ans.size()) / 2]; if (is[o1[t1]][o1[t2]] == 0) { res.push_back({o1[t1], o1[t2]}); } else { res.push_back({o2[t1], o2[t2]}); } } cout << res.size() << endl; for (auto u : res) { cout << u.first << << u.second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long N, K; long long num[3000]; long long OAO[3000]; bool test(long long c) { for (long long Ni = 0; Ni <= N; Ni++) { OAO[Ni] = Ni; for (long long Nj = 0; Nj < Ni; Nj++) { if (Ni != N && abs(num[Ni] - num[Nj]) > (long long)(c) * (Ni - Nj)) continue; OAO[Ni] = min(OAO[Ni], OAO[Nj] + Ni - Nj - 1); } } if (OAO[N] > K) return false; else return true; } int main() { scanf( %I64d %I64d , &N, &K); long long p = 0; for (long long Ni = 0; Ni < N; Ni++) { scanf( %I64d , &num[Ni]); if (Ni) p = max(p, (long long)abs(num[Ni] - num[Ni - 1])); } long long l = -1, r = p, mid; while (l + 1 != r) { mid = (l + r) / 2; if (test(mid)) r = mid; else l = mid; } printf( %I64d n , r); } |
#include <bits/stdc++.h> using namespace std; int regions[100000][4]; string name[100000][3]; void compareScore(int regionNo, int score, string str) { if (score >= regions[regionNo][0]) { string tempName1 = name[regionNo][0]; string tempName2 = name[regionNo][1]; int tempScore1 = regions[regionNo][0]; int tempScore2 = regions[regionNo][1]; regions[regionNo][0] = score; name[regionNo][0] = str; regions[regionNo][1] = tempScore1; regions[regionNo][2] = tempScore2; name[regionNo][1] = tempName1; name[regionNo][2] = tempName2; } else if (score >= regions[regionNo][1]) { string tempName2 = name[regionNo][1]; int tempScore2 = regions[regionNo][1]; regions[regionNo][1] = score; name[regionNo][1] = str; regions[regionNo][2] = tempScore2; name[regionNo][2] = tempName2; } else if (score >= regions[regionNo][2]) { regions[regionNo][2] = score; name[regionNo][2] = str; } if (!name[regionNo][1].empty() && !name[regionNo][2].empty() && regions[regionNo][1] == regions[regionNo][2]) { regions[regionNo][3] = -1; } else { regions[regionNo][3] = 1; } } void solve(int n, int m) { for (int i = 0; i < n; i++) { string str; int regionNo, score; cin >> str >> regionNo >> score; compareScore(regionNo, score, str); } for (int i = 1; i <= m; i++) { if (regions[i][3] == 1) { cout << name[i][0] << << name[i][1] << endl; } else { cout << ? << endl; } } } int main() { int n, m; cin >> n >> m; solve(n, m); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n, sum = 0; cin >> n; vector<long long> v(n), ans, odd; for (long long i = 0; i < n; i++) { cin >> v[i]; if (v[i] % 2 == 0) { ans.push_back(i); } else odd.push_back(i); sum += v[i]; } long long count = 0; for (long long i = 2; i * i <= sum; i++) { if (sum % i == 0) count++; } if (count > 0) { cout << n << endl; for (long long i = 0; i < n; i++) cout << i + 1 << ; } else { cout << n - 1 << endl; odd.pop_back(); for (long long i = 0; i < ans.size(); i++) { cout << ans[i] + 1 << ; } for (long long i = 0; i < odd.size(); i++) { cout << odd[i] + 1 << ; } } cout << endl; } } |
#include <bits/stdc++.h> int main() { int n; char a[20]; scanf( %d , &n); scanf( %s , a); char num[10]; for (int i = 2; i < 10; i++) { int c = 0; for (int j = 0; a[j]; j++) if (a[j] >= i + 0 ) c++; num[i] = c; } if (num[7] > 0) { for (int i = 2; i < 7; i++) { num[i] -= num[7]; } while (num[7]--) printf( 7 ); } if (num[5] > 0) { for (int i = 2; i < 5; i++) { num[i] -= num[5]; } while (num[5]--) printf( 5 ); } num[3] += num[6]; num[3] += num[9] * 2; num[2] += num[6]; num[2] += num[4] * 2; num[2] += num[8] * 3; num[2] -= num[3]; while (num[3]--) printf( 3 ); while (num[2]--) printf( 2 ); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INFINITE = (int)(0xffffffff >> 2); int n; int gs[600]; int dp[600][600]; int run(int l, int r) { if (l > r) return 0; if (l == r) return 1; if (dp[l][r] != INFINITE) { return dp[l][r]; } dp[l][r] = min(dp[l][r], run(l + 1, r) + 1); for (int k = l + 2; k <= r; k++) { if (gs[l] == gs[k]) { dp[l][r] = min(dp[l][r], run(l + 1, k - 1) + run(k + 1, r)); } } if (gs[l] == gs[l + 1]) { dp[l][r] = min(dp[l][r], run(l + 2, r) + 1); return dp[l][r]; } return dp[l][r]; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> gs[i]; for (int i = 0; i < 600; i++) { int *row = dp[i]; for (int j = 0; j < 600; j++) { row[j] = INFINITE; } } cout << run(1, n) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; 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 << , ; err(++it, args...); } namespace fastIO { bool IOerror = 0; inline char nc() { static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000; if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, 100000, stdin); if (pend == p1) { IOerror = 1; return -1; } } return *p1++; } inline bool blank(char ch) { return ch == || ch == n || ch == r || ch == t ; } inline void read(int &x) { char ch; while (blank(ch = nc())) ; if (IOerror) return; for (x = ch - 0 ; (ch = nc()) >= 0 && ch <= 9 ; x = x * 10 + ch - 0 ) ; } } // namespace fastIO using namespace fastIO; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 3e5 + 7; const int N = 1e4 + 10; const int mod = 998244353; long long qp(long long b, long long n) { long long r = 1; if (n < 0) n += mod - 1; b %= mod; for (; n; n >>= 1, b = b * b % mod) if (n & 1) r = r * b % mod; return r; } int sgn(double x) { if (x < -eps) return -1; return x > eps ? 1 : 0; } int n; long long dp[3][N]; long long sum[N], suf[N]; int a[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); sort(a + 1, a + 1 + n); long long _c2 = (n * (n - 1) / 2); for (int i = 1; i <= n; ++i) { for (int j = i + 1; j <= n; ++j) { dp[0][a[j] - a[i]]++; } } for (int i = 1; i <= n; ++i) { for (int j = i + 1; j <= n; ++j) { dp[1][a[j] - a[i]]++; } } for (int i = 1; i <= 10000; ++i) { for (int j = 1; j < i; ++j) { int k = i - j; dp[2][i] += dp[0][j] * dp[1][k]; } sum[i] = sum[i - 1] + dp[2][i]; } double ans = 0; for (int i = 10000; i >= 1; --i) { ans += sum[i - 1] * dp[0][i]; } printf( %.12lf n , 1.0 * ans / _c2 / _c2 / _c2); } |
#include <bits/stdc++.h> using namespace std; const int oo = 2139063143; const int N = 1010000; const int P = 1000000007; const long double eps = 1e-7; template <typename T> inline void sc(T &x) { x = 0; static int p; p = 1; static char c; c = getchar(); while (!isdigit(c)) { if (c == - ) p = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c - 48); c = getchar(); } x *= p; } template <typename T> inline void print(T x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } template <typename T> inline void pr(T x) { print(x), putchar( n ); } template <typename T1, typename T2> void chkmax(T1 &A, T2 B) { A = A >= B ? A : B; } template <typename T1, typename T2> void chkmin(T1 &A, T2 B) { A = A <= B ? A : B; } const long double PI = acos(-1); int n, m; struct po { long double x, y; po(long double xx = 0, long double yy = 0) { x = xx, y = yy; } } a[N], s[N]; po operator+(po A, po B) { return po(A.x + B.x, A.y + B.y); } po operator-(po A, po B) { return po(A.x - B.x, A.y - B.y); } long double operator*(po A, po B) { return A.x * B.y - A.y * B.x; } po operator*(po A, long double B) { return po(A.x * B, A.y * B); } po operator*(long double B, po A) { return po(A.x * B, A.y * B); } long double triangle(po A, po B, po C) { return abs((B - A) * (C - A)) / 2; } long double area() { long double g = a[n] * a[1]; for (int i = 1; i < n; i++) g += a[i] * a[i + 1]; return abs(g) / 2; } po core(po A, po B, po C) { return (A + B + C) * (1. / 3); } po O; void core() { long double S = area(); for (int i = 2; i < n; i++) O = O + (triangle(a[1], a[i], a[i + 1]) / S) * core(a[1], a[i], a[i + 1]); } long double S(long double A) { return A * A; } long double getlen(po A) { return sqrt(S(A.x) + S(A.y)); } long double len[N], b[N]; long double atan2(po A) { return atan2(A.y, A.x); } po rotate(po A, long double x) { long double s = sin(x), c = cos(x); return po(A.x * c - A.y * s, A.x * s + A.y * c); } int ia = 1, ib = 2; po A, B, p; po getpos(int i) { return O + rotate(s[i], b[0] - b[ia]); } int main() { sc(n), sc(m); for (int i = 1; i <= n; i++) { int x, y; sc(x), sc(y); a[i] = po(x, y); } core(); for (int i = 1; i <= n; i++) s[i] = a[i] - O, len[i] = getlen(s[i]), b[i] = atan2(s[i]); b[0] = atan2(po(0, 1)); A = a[1], B = a[2]; bool fg = 0; while (m--) { int op, x, y; sc(op), sc(x); if (op == 1) { sc(y); if (ia == x) swap(ia, ib), swap(A, B); O = po(A.x, A.y - len[ia]); ib = y, B = getpos(ib); fg = 1; } else { if (fg) p = getpos(x), printf( %.9Lf %.9Lf n , p.x, p.y); else printf( %.9Lf %.9Lf n , a[x].x, a[x].y); } } return 0; } |
#include <bits/stdc++.h> int n, k, a, b, p, na; std::vector<int> avg; long long f(int l, int r) { auto it1 = std::upper_bound(avg.begin(), avg.end(), r); auto it2 = std::lower_bound(avg.begin(), avg.end(), l); if (it2 != avg.end()) na = it1 - it2; else na = 0; long long ans; if (na) ans = 1LL * b * na * (r - l + 1); else ans = a; if (na && r != l) ans = std::min(ans, f(l, (l + r) / 2) + f((l + r) / 2 + 1, r)); return ans; } int main() { scanf( %d%d%d%d , &n, &k, &a, &b); for (int i = 0; i < k; i++) { scanf( %d , &p); avg.push_back(p - 1); } std::sort(avg.begin(), avg.end()); printf( %lld n , f(0, (1 << n) - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } const long long INFll = 1ll * 1000000000 * 1000000000; const long double PI = 3.141592653589793238462643383279502884197169399375105820974944; int mul(int a, int b, int mod = 1000000007) { return int(a * 1ll * b % mod); } int norm(int a, int mod = 1000000007) { while (a >= mod) a -= mod; while (a < 0) a += mod; return a; } int powmod(int x, int y, int mod = 1000000007) { int res = 1; while (y > 0) { if (y & 1) res = mul(res, x, mod); x = mul(x, x, mod); y = y >> 1; } return res; } int inv(int a, int mod = 1000000007) { return powmod(a, mod - 2); } int main() { fast(); int n; cin >> n; vector<int> dp((1 << 22), -1), a(n); for (int i = 0; i < n; i++) { cin >> a[i]; dp[a[i]] = a[i]; } int p = (1 << 22); for (int i = 0; i < p; i++) { if (dp[i] != -1) for (int j = 0; j < 22; j++) { if ((i & (1 << j)) == 0) { dp[i | (1 << j)] = dp[i]; } } } for (int i = 0; i < n; i++) { cout << dp[(1 << 22) - 1 - a[i]] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, ddy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; const int nx[8] = {1, 2, 2, 1, -1, -2, -2, -1}, ny[8] = {-2, -1, 1, 2, 2, 1, -1, -2}; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t = 1; cin >> t; while (t--) { int n, k; string s; cin >> n >> k >> s; bool ans = true; for (int i = 0; i < k; i++) { bool ze = true, on = true; for (int j = i; j < n; j += k) { if (s[j] == 0 ) on = false; if (s[j] == 1 ) ze = false; } if (ze && !on) { for (int j = i; j < n; j += k) s[j] = 0 ; } if (!ze && on) { for (int j = i; j < n; j += k) s[j] = 1 ; } if (!ze && !on) { ans = false; } } int ze = 0, on = 0, qu = 0; for (int i = 0; i < k; i++) { if (s[i] == 0 ) ze += 1; if (s[i] == 1 ) on += 1; if (s[i] == ? ) qu += 1; } if (ze > k / 2 || on > k / 2) ans = false; cout << (ans ? YES : NO ); done:; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; inline void io() {} int main() { ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); cout << fixed << setprecision(8); long long int n, a, b, c = 0, k; cin >> a >> b >> n; for (int i = 0; i < 10; i++) { if (((a * 10) + i) % b == 0) { c++; k = (a * 10) + i; break; } } if (c == 1) { cout << k; for (int i = 1; i < n; i++) { cout << 0 ; } } else { cout << -1 ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, pos; cin >> n; int arr[n + 1]; for (int i = 1; i <= n; i++) { cin >> pos; arr[pos] = i; } for (int i = 1; i <= n; i++) cout << arr[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, n; cin >> a >> b >> n; long long int cnt = 0; while (1) { if (b > a) { a += b; cnt++; } else { b += a; cnt++; } if (a > n || b > n) break; } cout << cnt << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> joy; while (n > 0) { int f, t; cin >> f >> t; if (t > k) f = f - t + k; joy.push_back(f); n--; } sort(joy.begin(), joy.end()); cout << joy.back(); } |
#include <bits/stdc++.h> using namespace std; vector<int> v; long long int arr[100001], operation[100001][3], kitnibaar1[100002], kitnibaar[100002], update1[100002], update[100002]; int main() { int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= n; i++) { cin >> arr[i]; } for (int i = 1; i <= m; i++) { cin >> operation[i][0]; cin >> operation[i][1]; cin >> operation[i][2]; } for (int i = 1; i <= k; i++) { int start, end; cin >> start >> end; kitnibaar1[start]++; kitnibaar1[end + 1]--; } long long int up = 0; for (int i = 1; i <= m; i++) { up += kitnibaar1[i]; kitnibaar[i] += up; } up = 0; for (int i = 1; i <= m; i++) { operation[i][2] *= kitnibaar[i]; update[operation[i][0]] += operation[i][2]; update[operation[i][1] + 1] -= operation[i][2]; } up = 0; for (int i = 1; i <= n; i++) { up += update[i]; arr[i] += up; cout << arr[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 400010; int n, ans[N], where[N]; long long sz[N]; vector<int> v[N]; bool visit[N]; void init() { scanf( %d , &n); int a, b; for (int i = 0; i < n - 1; ++i) { scanf( %d %d , &a, &b); v[a].push_back(b); v[b].push_back(a); } } void dfs(int now) { visit[now] = true; for (int i = 0; i < v[now].size(); ++i) if (!visit[v[now][i]]) { dfs(v[now][i]); sz[now] += sz[v[now][i]]; } if (sz[now] == 0) sz[now] = 1; else sz[now] += 1; } int find_centroid(int now) { visit[now] = true; for (int i = 0; i < v[now].size(); ++i) { if (visit[v[now][i]]) continue; if (sz[v[now][i]] > n / 2) return find_centroid(v[now][i]); } return now; } void sv(int now, int value) { if (visit[now]) return; visit[now] = true; where[now] = value; for (int i = 0; i < v[now].size(); ++i) sv(v[now][i], value); } void dfs2(int now) { visit[now] = true; for (int i = 0; i < v[now].size(); ++i) sv(v[now][i], i); } void solve() { dfs(1); for (int i = 1; i <= n; ++i) visit[i] = false; int centroid = find_centroid(1); for (int i = 1; i <= n; ++i) visit[i] = false; dfs2(centroid); for (int i = 1; i <= n; ++i) { visit[i] = false; sz[i] = 0; } dfs(centroid); vector<int> tmp; for (int i = 0; i < v[centroid].size(); ++i) tmp.push_back(sz[v[centroid][i]]); int max1 = -1000000006, idx1, max2 = -1000000006, idx2; for (int i = 0; i < tmp.size(); ++i) if (tmp[i] > max1) { max1 = tmp[i]; idx1 = i; } if ((n % 2 == 0) && max1 == n / 2) max2 = n / 2; else { for (int i = 0; i < tmp.size(); ++i) if (tmp[i] > max2 && i != idx1) { max2 = tmp[i]; idx2 = i; } } for (int i = 1; i <= n; ++i) { if (i == centroid) ans[i] = 1; else if (where[i] == idx1) { int tmp = n - sz[i] - max2; if (tmp <= n / 2) ans[i] = 1; else ans[i] = 0; } else { int tmp = n - sz[i] - max1; if (tmp <= n / 2) ans[i] = 1; else ans[i] = 0; } } for (int i = 1; i <= n; ++i) printf( %d , ans[i]); printf( n ); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int __ = 1; while (__--) { init(); solve(); } } |
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const long long ooo = 9223372036854775807ll; const int _cnt = 1000 * 1000 + 7; const int _p = 1000 * 1000 * 1000 + 7; const int N = 1001005; const double PI = acos(-1.0); const double eps = 1e-9; int o(int x) { return x % _p; } int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } void file_put() { freopen( filename.in , r , stdin); freopen( filename.out , w , stdout); } long long a, b, p, x, r[N], tt = 1, q[N], x0, ans = 0, T = 1, T_rev; bool v[N]; long long Pow(long long x, long long k) { long long ans = 1; for (; k; k >>= 1, (x *= x) %= p) if (k & 1) (ans *= x) %= p; return ans; } int main() { scanf( %I64d%I64d%I64d%I64d , &a, &b, &p, &x); if (a == 1) if (x < b) return 0 * printf( 0 n ); else return 0 * printf( %I64d n , (x - b) / p + 1); v[1] = 1; while (1) { (tt *= a) %= p; if (v[tt]) break; v[tt] = 1; T++; } r[1] = tt = 1; for (int i = (1); i <= (T - 1); ++i) q[(tt *= a) %= p] = i; q[1] = 0; T_rev = Pow(T, p - 2); for (int i = (2); i <= (p - 1); ++i) r[i] = (p - p / i) * r[p % i] % p; for (int i = (1); i <= (p - 1); ++i) { if (i > 1 && !q[i]) continue; long long t = i; x0 = (r[t] * b % p * T * T_rev + q[t] * p) % (p * T); if (x < x0) continue; ans += (x - x0) / (p * T) + 1; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char str[200]; int num, i, j, k; int pre = 0; char temp[10]; cin.getline(str, 200, n ); for (i = 0; str[i] != 0; i++) { num = str[i]; j = 0; while (num != 0) { k = num % 2; temp[j++] = k + 0 ; num = (num - k) / 2; } while (j < 8) temp[j++] = 0 ; temp[j] = 0 ; for (j = 0; j < 8; j++) num += (temp[j] - 0 ) << (7 - j); k = (pre - num) % 256; if (k < 0) k += 256; cout << k << endl; pre = num; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct triple { int first; int second; int third; void set(int a, int b, int c) { first = a; second = b; third = c; } }; triple t[53][53][8] = {0}; int table[53][53] = {0}; void f(int a, int b, int c) { if (table[a][b] == 0 || b > 50 || a > 50 || a < 1 || b < 1) return; int x = a; int y = b; if (c == 0) { while (table[x - 1][y] == table[a][b]) x--; while (table[x][y + 1] == table[a][b]) y++; if (table[x][y + 1] != 0) t[a][b][c].set(x, y + 1, c); else t[a][b][c].set(a, b, 1); } else if (c == 1) { while (table[x + 1][y] == table[a][b]) x++; while (table[x][y + 1] == table[a][b]) y++; if (table[x][y + 1] != 0) t[a][b][c].set(x, y + 1, c); else t[a][b][c].set(a, b, 2); } else if (c == 2) { while (table[x + 1][y] == table[a][b]) x++; while (table[x][y + 1] == table[a][b]) y++; if (table[x + 1][y] != 0) t[a][b][c].set(x + 1, y, c); else t[a][b][c].set(a, b, 3); } else if (c == 3) { while (table[x + 1][y] == table[a][b]) x++; while (table[x][y - 1] == table[a][b]) y--; if (table[x + 1][y] != 0) t[a][b][c].set(x + 1, y, c); else t[a][b][c].set(a, b, 4); } else if (c == 4) { while (table[x + 1][y] == table[a][b]) x++; while (table[x][y - 1] == table[a][b]) y--; if (table[x][y - 1] != 0) t[a][b][c].set(x, y - 1, c); else t[a][b][c].set(a, b, 5); } else if (c == 5) { while (table[x - 1][y] == table[a][b]) x--; while (table[x][y - 1] == table[a][b]) y--; if (table[x][y - 1] != 0) t[a][b][c].set(x, y - 1, c); else t[a][b][c].set(a, b, 6); } else if (c == 6) { while (table[x - 1][y] == table[a][b]) x--; while (table[x][y - 1] == table[a][b]) y--; if (table[x - 1][y] != 0) t[a][b][c].set(x - 1, y, c); else t[a][b][c].set(a, b, 7); } else if (c == 7) { while (table[x - 1][y] == table[a][b]) x--; while (table[x][y + 1] == table[a][b]) y++; if (table[x - 1][y] != 0) t[a][b][c].set(x - 1, y, c); else t[a][b][c].set(a, b, 0); } } int main() { int n, m; cin >> n >> m; string s; int h = 0; cin.ignore(); for (int i = 0; i < n; i++) { getline(cin, s); for (int j = 0; j < s.size(); j++) { table[i + 1][j + 1] = s[j] - 0 ; } } h = s.size(); for (int i = 1; i <= n; i++) { for (int j = 1; j <= h; j++) { for (int k = 0; k < 8; k++) { f(i, j, k); } } } int q1 = 1, q2 = 1, q3 = 0; int w1, w2, w3; for (int i = 0; i < m; i++) { w1 = t[q1][q2][q3].first; w2 = t[q1][q2][q3].second; w3 = t[q1][q2][q3].third; q1 = w1; q2 = w2; q3 = w3; } cout << table[q1][q2] << endl; } |
#include <bits/stdc++.h> using namespace std; const int V = 25; int n, k, sx, sy; bool adj[V][V]; double p[V]; double mat[V * V][V * V]; int id[V][V], deg[V]; double calc_p(int i, int j) { return (i == j) ? p[i] : (adj[i][j]) ? (1 - p[i]) / deg[i] : 0.0; } void gauss(double a[][V * V], int m, int n) { for (int i = 0; i < m; i++) { int u = i; for (int r = i + 1; r < m; r++) if (fabs(a[r][i]) > fabs(a[u][i])) u = r; if (u != i) for (int j = i; j < m + n; j++) swap(a[i][j], a[u][j]); double t = a[i][i]; for (int j = i; j < m + n; j++) a[i][j] /= t; for (int c = 0; c < m; c++) if (c != i) { t = a[c][i]; for (int j = i; j < m + n; j++) a[c][j] -= t * a[i][j]; } } } int main() { int a, b; scanf( %d%d%d%d , &n, &k, &sx, &sy); sx--; sy--; memset(deg, 0, sizeof(deg)); memset(adj, 0, sizeof(adj)); for (int i = 0; i < k; i++) { scanf( %d%d , &a, &b); a--; b--; adj[a][b] = adj[b][a] = true; deg[a]++; deg[b]++; } int m = 0; for (int i = 0; i < n; i++) for (int j = i; j < n; j++) id[i][j] = id[j][i] = m++; for (int i = 0; i < n; i++) scanf( %lf , &p[i]); memset(mat, 0, sizeof(mat)); for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) { for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) { mat[id[i][j]][id[x][y]] += calc_p(i, x) * calc_p(j, y); } } for (int i = 0; i < m; i++) mat[i][i] -= 1; for (int i = 0; i < n; i++) mat[id[i][i]][id[i][i]] = 1; for (int i = 0; i < n; i++) mat[id[i][i]][m + i] = 1; gauss(mat, m, n); for (int i = 0; i < n; i++) { if (i) printf( ); printf( %.9f , mat[id[sx][sy]][m + i]); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; int dp[1 << 25]; int tick[25][25], value[25][25], cost[25][25]; int n, m; string s[25]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> value[i][j]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { int maxi = 0; for (int x = 0; x < n; x++) if (s[i][j] == s[x][j]) { tick[i][j] |= (1 << x); maxi = max(maxi, value[x][j]); cost[i][j] += value[x][j]; } cost[i][j] -= maxi; } memset(dp, 1000000005, sizeof(dp)); dp[0] = 0; for (int mask = 1; mask < (1 << n); mask++) { int t; for (int pos = 0; pos < n; pos++) if ((mask >> pos) & 1) { t = pos; break; } for (int pos = 0; pos < m; pos++) { dp[mask] = min(dp[mask], dp[mask & (mask ^ tick[t][pos])] + cost[t][pos]); dp[mask] = min(dp[mask], dp[mask - (1 << t)] + value[t][pos]); } } cout << dp[(1 << n) - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937_64 rnd(time(NULL)); const int N = 25; const int inf = 1e9; const double MAX_T = 1000; const double MIN_T = 1e-5; const int max_mutations = 10; int n, m; vector<int> A, B; vector<vector<int> > best_ans, cur_ans; int best_cost = 0; inline void mutation(vector<vector<int> > &a) { int cnt = rnd() % max_mutations + 1; for (; cnt; cnt--) { int x = rnd() % n, y = rnd() % m; a[x][y] = rnd() % 2; } } inline int calc(vector<vector<int> > &a) { int x = 0, res = 0; for (int i = 0; i < n; i++) { x = 0; for (int j = 0; j < m; j++) { if (a[i][j] == 1 && (j == 0 || a[i][j - 1] == 0)) x++; } res += (x - A[i]) * (x - A[i]); } for (int i = 0; i < m; i++) { x = 0; for (int j = 0; j < n; j++) { if (a[j][i] == 1 && (j == 0 || a[j - 1][i] == 0)) x++; } res += (x - B[i]) * (x - B[i]); } return res; } inline double ok(double E, double t) { return exp(-E / t); } inline bool valid(double E, double t) { if (E < 0) return true; double x = ok(E, t); x *= inf; return (rnd() % inf <= x); } int main() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; A.resize(n, 0); B.resize(m, 0); for (int i = 0; i < n; i++) cin >> A[i]; for (int j = 0; j < m; j++) cin >> B[j]; cur_ans.assign(n, vector<int>(m)); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cur_ans[i][j] = rnd() % 2; best_ans = cur_ans; best_cost = calc(cur_ans); double T = MAX_T; int i = 1; while (T > MIN_T && best_cost != 0) { mutation(cur_ans); int cur_cost = calc(cur_ans); if (valid(cur_cost - best_cost, T)) { best_cost = min(best_cost, cur_cost); if (best_cost == cur_cost) best_ans = cur_ans; } else cur_ans = best_ans; T = MAX_T * 0.1 / i; i++; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (best_ans[i][j]) cout << * ; else cout << . ; } cout << n ; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.