func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t > 0) { int n; cin >> n; while (n > 0) { cout << 1 << ; n--; } cout << n ; t--; } return 0; } |
#include <bits/stdc++.h> using namespace std; class ST { long long int tree[10000000]; long long int lazy[10000000]; public: void build(int a, int b, int node) { tree[node] = 0; lazy[node] = 0; if (a == b) return; int mid = (a + b + 4000000) / 2 - 2000000; build(a, mid, 2 * node); build(mid + 1, b, 2 * node + 1); } void propagate(int a, int b, int node) { tree[node] += lazy[node]; if (a != b) { lazy[2 * node] += lazy[node]; lazy[2 * node + 1] += lazy[node]; } lazy[node] = 0; } void update(int a, int b, int node, int x, int y, long long int val) { propagate(a, b, node); if (b < x || y < a) return; if (x <= a && b <= y) { lazy[node] += val; propagate(a, b, node); return; } int mid = (a + b + 4000000) / 2 - 2000000; update(a, mid, 2 * node, x, y, val); update(mid + 1, b, 2 * node + 1, x, y, val); tree[node] = max(tree[2 * node], tree[2 * node + 1]); } long long int query() { return tree[1]; } }; int main() { int n; long long int r; scanf( %d %lld , &n, &r); vector<pair<long long int, long long int> > V; for (int i = 0; i < n; i++) { long long int a, b; scanf( %lld %lld , &a, &b); V.push_back(pair<long long int, long long int>(a + b, a - b)); } ST *S = new ST(); S->build(-2000000, 2000000, 1); sort(V.begin(), V.end()); int ptr = 0; long long int ans = 0; for (int i = 0; i < n; i++) { while (V[ptr].first < V[i].first - 2 * r) { S->update(-2000000, 2000000, 1, V[ptr].second - 2 * r, V[ptr].second, -1); ptr++; } S->update(-2000000, 2000000, 1, V[i].second - 2 * r, V[i].second, 1); ans = max(ans, S->query()); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> int main() { int n, amount(0); scanf( %d , &n); bool b[3001] = {false}; int pfactors[3001] = {0}; for (int i = 2; i <= n; ++i) { if (!b[i]) { for (int j = i + i; j <= n; j += i) { b[j] = true; pfactors[j] += 1; } } if (pfactors[i] == 2) { amount += 1; } } printf( %d n , amount); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 105; const int mod = 1e9 + 7; inline void MOD(int &x) { if (x >= mod) x -= mod; } int n, m, k; int dp[2][N][N][N], C[N][N], r; int ans; int main() { for (int i = 0; i <= 100; i++) { C[i][0] = 1; for (int j = 1; j <= i; j++) C[i][j] = min(C[i - 1][j - 1] + C[i - 1][j], 101); } scanf( %d%d%d , &n, &m, &k); r = 0; for (int j = 2; j <= n + 1; j++) dp[r][j][j - 1][1] = 1; for (int i = 1; i <= m; i++) { for (int j = 1 + i; j <= n + 1; j++) for (int q = 1; q <= k; q++) ans = ((long long)dp[r][j][0][q] * (m - i + 1) + ans) % (long long)mod, dp[r][j][0][q] = 0; if (i == m) break; for (int j = 1 + i; j <= n + 1; j++) for (int p = 1; p < j; p++) for (int q = 1; q <= k; q++) if (dp[r][j][p][q]) { for (int t = p; j + t <= n + 1 && q * C[t - 1][p - 1] <= k; t++) MOD(dp[r ^ 1][j + t][t - p][q * C[t - 1][p - 1]] += dp[r][j][p][q]); dp[r][j][p][q] = 0; } r ^= 1; } printf( %d n , ans); return 0; } |
#include<bits/stdc++.h> using namespace std; /* User Template @Shaurya Gautam CP.cpp */ /*****************************************/ #define ll long long #define vb vector<bool> #define vi vector<int> #define vl vector<long> #define vll vector<long long> #define vpii vector<pair<int, int>> #define vc vector<char> #define pii pair<int, int> #define mp make_pair #define F(i,L,R) for (int i = L; i < R; i++) #define FE(i,L,R) for (int i = L; i <= R; i++) #define FR(i,L,R) for (int i = L; i > R; i--) #define FRE(i,L,R) for (int i = L; i >= R; i--) #define pb push_back #define ppb pop_back #define endl n class my_compare{ public: bool operator()(pii &p1, pii &p2){ return p1.second < p2.second; } }; /*************************************************/ void solve(){ int n; cin >> n; vi arr(n + 1); FE(i, 1, n){ cin >> arr[i]; } int ans{0}; FE(i, 1, n){ if(arr[i] > 2*i - 1) continue; int j = (arr[i] > i) ? 1 : (i/arr[i]) + 1; while(j*arr[i] <= 2*i - 1){ if(arr[j*arr[i] - i] == j) ans++; j++; } } cout << ans << endl; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); bool test_case{1}, fileop{0}; if(fileop){ freopen( input.txt , r ,stdin); freopen( output.txt , w ,stdout); } int t; if(test_case){ cin >> t; F(i, 0, t){ solve(); } } else solve(); } /* Some Learnings- -Don t focus on ratings or standings -See problem from new perspective and forget current thoughts -Accuracy is important, be sure that you think right -Speed builds up once accuracy does... solve as many questions as possible -Editorial is last resort... don t jump to it -BE CONSISTENT -My two brothers - Hard Work and Perseverance -Never leave a contest, no matter how tough it might be */ |
#include <bits/stdc++.h> using namespace std; int n; vector<int> g[100005]; int c[100005]; double r[100005]; void dfs(int x) { c[x] = 1; for (int i = 0; i < g[x].size(); ++i) { int y = g[x][i]; dfs(y); c[x] += c[y]; } } void calc(int x) { for (int i = 0; i < g[x].size(); ++i) { int y = g[x][i]; r[y] = r[x] + 1 + (c[x] - c[y] - 1) / 2.; calc(y); } } int main() { scanf( %d , &n); for (int i = 1; i < n; ++i) { int p; scanf( %d , &p); p--; g[p].push_back(i); } dfs(0); r[0] = 1; calc(0); printf( 1.0 ); for (int i = 1; i < n; ++i) printf( %.1lf , r[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int N; int V[100]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int T; cin >> T; while (T--) { int K; cin >> K; const int R = 2 * K + 1; N = 2 * R; int p0 = -1; for (int i = 0; i < N; i++) { string s; cin >> s; if (s == E ) { V[i] = 0; p0 = i; } else { V[i] = stoi(s); } } assert(p0 != -1); string ans; while (p0 % R) { ans += l ; swap(V[p0], V[p0 - 1]); p0--; } if (p0 == R) { ans += u ; swap(V[p0], V[p0 - R]); p0 -= R; } assert(p0 == 0); bool parity = 0; for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) { if (V[j] < V[i]) parity ^= 1; } } if (parity) { cout << SURGERY FAILED << n ; continue; } for (int i = 0; i < K; i++) { ans += r ; swap(V[p0], V[p0 + 1]); p0++; } assert(p0 == K); ans += d ; swap(V[p0], V[p0 + R]); p0 += R; auto VtoF = [&](int v) { assert(v != 0); if (v <= K) { return v + K; } else if (v == K + 1) { return R; } else if (v <= R) { return 2 * R - (v - (K + 1)); } else if (v <= R + K) { return (K + 1) - (v - R); } else { return R + (v - R - K); } }; deque<int> lhs; deque<int> rhs; for (int i = K - 1; i >= 0; i--) { lhs.push_front(VtoF(V[i])); } for (int i = 0; i < K; i++) { lhs.push_front(VtoF(V[R + i])); } for (int i = K + 1; i < R; i++) { rhs.push_front(VtoF(V[i])); } for (int i = R - 1; i > K; i--) { rhs.push_front(VtoF(V[R + i])); } int mid = VtoF(V[K]); assert(int(lhs.size()) == 2 * K); assert(int(rhs.size()) == 2 * K); auto rotL = [&]() { ans += L ; lhs.push_back(mid); mid = lhs.front(); lhs.pop_front(); }; auto unrotL = [&]() { ans += X ; lhs.push_front(mid); mid = lhs.back(); lhs.pop_back(); }; auto rotR = [&]() { ans += R ; rhs.push_back(mid); mid = rhs.front(); rhs.pop_front(); }; auto unrotR = [&]() { ans += Y ; rhs.push_front(mid); mid = rhs.back(); rhs.pop_back(); }; for (int z = 0; z < 2 * N; z++) { if (mid <= R) { rotL(); } else { rotR(); } } for (int z = 0; z < R; z++) { rotL(); for (int i = 0; i < R - 1; i++) { if (lhs.front() < mid) { rotR(); rotL(); unrotR(); unrotL(); rotR(); } rotL(); } } assert(mid == R); mid = 2 * R; bool f = false; for (int z = 0; z < R; z++) { rotR(); for (int i = 0; i < R - 1; i++) { if (rhs.front() < mid) { f ? unrotL() : rotL(); rotR(); f ? rotL() : unrotL(); unrotR(); f ? unrotL() : rotL(); f = !f; } rotR(); } } assert(f == false); for (int i = 0; i < K; i++) { ans += r ; } cout << SURGERY COMPLETE << n ; cout << ans << n ; cout << L << << string(K, l ) + u + string(K, r ) + d << n ; cout << X << << u + string(K, l ) + d + string(K, r ) << n ; cout << R << << string(K, r ) + u + string(K, l ) + d << n ; cout << Y << << u + string(K, r ) + d + string(K, l ) << n ; cout << DONE << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, c, d, x, y, v, ans = 0; cin >> n >> a >> b >> c >> d; for (long long i = 1; i <= n; i++) { x = a - d + i; v = b - c + i; y = a + b - c - d + i; if ((x > 0 && x <= n) && (y > 0 && y <= n) && (v > 0 && v <= n)) ans += n; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f, mod = 1000000007; const long long INF = 0x3f3f3f3f3f3f3f3fLL; const double pi = acosl(-1.), eps = 1e-9; inline int power(int a, int b, int m = mod, int ans = 1) { for (; b; b >>= 1, a = 1LL * a * a % m) if (b & 1) ans = 1LL * ans * a % m; return ans; } int que(vector<int> a, vector<int> b) { printf( %d %d , a.size(), b.size()); for (auto r : a) cout << r << ; for (auto r : b) cout << r << ; fflush(stdout); int ans; cin >> ans; return ans; } int main() { int T; cin >> T; while (T--) { int n; scanf( %d , &n); vector<int> a, b; a.push_back(1); for (int i = 2; i <= n; i++) b.push_back(i); int t = que(a, b); int st = 1, ed = n; while (st + 1 < ed) { int md = st + ed >> 1; b.clear(); for (int i = 2; i <= md; i++) b.push_back(i); if (que(a, b) == t) ed = md; else st = md; } a.clear(); b.clear(); a.push_back(ed); for (int i = 1; i <= n; i++) if (ed != i) b.push_back(i); t = que(a, b); printf( -1 %d n , t); fflush(stdout); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100010], ar[100010]; int main() { int n, track = -100002, i; cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; ar[a[i]] = ar[a[i] - 1] + 1; track = max(ar[a[i]], track); } cout << n - track << endl; } |
#include <bits/stdc++.h> using namespace std; bool compare(pair<int, int> a, pair<int, int> b) { return a.first < b.first; } int main() { float r1, r2, c1, c2, d1, d2; cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2; float a = c1 / 2 + (d1 + r1 - d2 - r2) / 4; float c = c1 / 2 - (d1 + r1 - d2 - r2) / 4; float b = c2 / 2 + (r1 + d2 - r2 - d1) / 4; float d = c2 / 2 - (r1 + d2 - r2 - d1) / 4; if (a > 9 || a < 1) { cout << -1; return 0; } if (b > 9 || b < 1) { cout << -1; return 0; } if (c > 9 || c < 1) { cout << -1; return 0; } if (d > 9 || d < 1) { cout << -1; return 0; } if (a + b != r1) { cout << -1; return 0; } if (d + c != r2) { cout << -1; return 0; } if (a + c != c1) { cout << -1; return 0; } if (d + b != c2) { cout << -1; return 0; } if (a + d != d1) { cout << -1; return 0; } if (c + b != d2) { cout << -1; return 0; } if (a == b || a == c || a == d || b == c || b == d || c == d) { cout << -1; return 0; } cout << (int)a << << (int)b << endl << (int)c << << (int)d; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long Fib[100]; long long Path[100]; pair<long long, long long> get(long long N, long long X, bool f) { assert(Fib[N] >= X); if (N <= 0) { return {0, 0}; } if (N == 1) { if (X == 1) { return {0, 1}; } else { return {1, 0}; } } pair<long long, long long> res = {}; if (X <= Fib[N - 1]) { res = get(N - 1, X, true); res.second = min(res.first, res.second) + 1ll + Path[N - 2]; if (f) { res.second = min(res.second, res.first + 2ll); res.first = min(res.first, res.second + 2ll); } } else { res = get(N - 2, X - Fib[N - 1], false); res.first++; if (f) { res.second = min(res.second, res.first + 2ll); res.first = min(res.first, res.second + 2ll); } } return res; } long long solve(long long N, long long X, long long Y) { int f = 0; if (N > 90) { N = 90; f = 1; } assert(Fib[N] >= X && Fib[N] >= Y); if (X > Y) swap(X, Y); while (true) { if (Y <= Fib[N - 1]) { f = 1; N--; } else if (X > Fib[N - 1]) { if (f) { f++; } X -= Fib[N - 1]; Y -= Fib[N - 1]; N -= 2; } else { break; } } if (N == 1) { return 1; } auto res1 = get(N - 1, X, true); auto res2 = get(N - 2, Y - Fib[N - 1], false); long long res = res2.first + 1ll + min(res1.first, res1.second); if (f) { res = min(res, res2.second + 2ll + res1.first + f - 1ll); } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); Fib[0] = 1; Path[0] = 0; Fib[1] = 2; Path[1] = 1; for (int i = 2; i < 100; i++) { Fib[i] = Fib[i - 1] + Fib[i - 2]; Path[i] = Path[i - 2] + 1; } long long T, N, X, Y; cin >> T >> N; while (T--) { cin >> X >> Y; cout << solve(N, X, Y) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace { const double PI = acos(-1.0); } struct Data { int n; int c; vector<int> t; Data() : c(0) {} bool operator<(const Data& d) const { return c < d.c; } }; int main() { int n; while (cin >> n) { n *= 2; Data d[101]; for (int i = 0; i < n; ++i) { int x; cin >> x; d[x].n = x; ++d[x].c; d[x].t.push_back(i); } sort(d, d + 101); bool f = 0; vector<int> ans[2]; set<int> s[2]; int z[101] = {0}; for (int i = 0; i < 101; ++i) { for (int j = 0; j < d[i].c; ++j) { ans[f].push_back(d[i].n); s[f].insert(d[i].n); z[d[i].t[j]] = f; f = !f; } } cout << s[0].size() * s[1].size() << endl; for (int i = 0; i < n; ++i) { if (i) cout << ; cout << z[i] + 1; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long max(long long a, long long b) { return (a > b) ? a : b; } inline long long min(long long a, long long b) { return (a < b) ? a : b; } inline long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } vector<vector<long long> > graph; vector<long long> color, initial; long long cnt = 0; void bfs(long long source, long long n, long long colour) { queue<long long> q; q.push(source); bool visited[n + 1]; fill(visited, visited + n + 1, false); visited[source] = true; while (!q.empty()) { long long u = q.front(); q.pop(); for (auto c : graph[u]) { if (visited[c] == false) { q.push(c); visited[c] = true; initial[c] = colour; } } } } int main() { ; ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; graph.resize(n + 1); for (long long i = 2; i <= n; i++) { long long a; cin >> a; graph[a].push_back(i); } initial.resize(n + 1, -1); color.resize(n + 1, 0); for (long long i = 1; i <= n; i++) { cin >> color[i]; if (initial[i] == color[i]) continue; cnt++; initial[i] = color[i]; bfs(i, n, color[i]); } cout << cnt; cout << n ; } |
#include <bits/stdc++.h> using namespace std; long long int prime[1000010] = {0}; vector<long long int> pr; void sieve() { prime[0] = 1; prime[1] = 1; for (long long int i = 2; i <= sqrt(1000010); i++) { if (prime[i] == 0) { for (long long int j = i * i; j < 1000010; j += i) { prime[j] = 1; } } } for (long long int i = 2; i < 1000010; i++) { if (!prime[i]) pr.push_back(i); } return; } double pi = 3.141592653589; long long int a[200100]; long long int pre[200100] = {0}; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n, w; cin >> n >> w; for (long long int i = 1; i <= n; i += 1) { cin >> a[i]; pre[i] = pre[i - 1] + a[i]; } long long int mi = 0, ma = 0; for (long long int i = 1; i <= n; i += 1) { mi = min(mi, pre[i]); ma = max(ma, pre[i]); } long long int ans = (w - ma) + (mi + 1); if (ans > w + 1 || ans < 0) cout << 0 << endl; else cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); bool f = 1; for (long long i = 1; i < n; i++) { if (arr[i] - arr[i - 1] > 1) f = 0; } if (f) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> int flag[1000001] = {0}, a[1000051][21], ss[100001]; long long qsm(int n, int p) { if (p == 0) return 1; if (p == 1) return n; long long ans = qsm(n, p / 2); if (p % 2) ans = n * ans % 1000000007 * ans % 1000000007; else ans = (ans * ans) % 1000000007; return ans; } int main() { flag[1] = 1; int i, j, T, x, y; long long ans = 0; for (i = 2; i <= 500000; i++) { if (flag[i]) continue; for (j = 2 * i; j <= 1000000; j += i) flag[j] = 1; } ss[0] = 0; for (i = 2; i <= 1000000; i++) if (!flag[i]) { ss[++ss[0]] = i; } for (i = 0; i <= 1000050; i++) { a[i][0] = 1; a[0][i] = 1; } for (i = 1; i <= 1000050; i++) for (j = 1; j <= 20 && j <= i; j++) { if (i == j) { a[i][j] = 1; continue; } a[i][j] = a[i - 1][j - 1] + a[i - 1][j]; a[i][j] %= 1000000007; } scanf( %d , &T); while (T--) { scanf( %d%d , &x, &y); i = 1; ans = 1; while (x != 1) { if (!flag[x]) { ans *= y; ans %= 1000000007; x = 1; continue; } for (; i <= ss[0]; i++) { if (x % ss[i] == 0) { int k = 0; while (x % ss[i] == 0) { k++; x /= ss[i]; } ans *= a[y + k - 1][k]; ans %= 1000000007; i++; break; } } } int p = qsm(2, y - 1); ans *= p; ans %= 1000000007; printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool is_prime(long long n) { for (long long i = 2; i * i <= n; ++i) { if (n % i == 0) { return false; } } return true; } long long getPow(long long a, long long b) { long long res = 1ll, tp = a; while (b) { if (b & 1ll) { res *= tp; res %= 1000000007; } tp *= tp; tp %= 1000000007; b >>= 1ll; } return res; } long long vec_mult(long long x1, long long y1, long long x2, long long y2, long long x3, long long y3) { return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)); } void ok() { cout << YES << endl; exit(0); } void no() { cout << NO << endl; exit(0); } inline long long nxt() { long long x; cin >> x; return x; } struct Fenwick { int n; vector<int> a; Fenwick(int _n = 0) : n(_n), a(_n) {} void add(int pos, int x) { while (pos < n) { a[pos] += x; pos |= pos + 1; } } int get(int pos) { int res = 0; while (pos >= 0) { res += a[pos]; pos = (pos & (pos + 1)) - 1; } return res; } int get(int l, int r) { return get(r) - get(l - 1); } }; struct Robot { int x, r, iq; Robot() {} Robot(int t1, int t2, int t3) : x(t1), r(t2), iq(t3) {} bool operator<(const Robot& a) const { return r > a.r; } }; const long long N = 2e5 + 5, inf = 1e18; int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); long long n = nxt(), k = nxt(); vector<Robot> mas(n); for (int i = 0; i < n; i++) { long long t1 = nxt(), t2 = nxt(), t3 = nxt(); mas[i] = Robot(t1, t2, t3); } sort(mas.begin(), mas.end()); vector<long long> iqs; for (int i = 0; i < n; i++) { iqs.push_back(mas[i].iq); } sort((iqs).begin(), (iqs).end()); (iqs).resize(unique((iqs).begin(), (iqs).end()) - (iqs).begin()); vector<vector<long long>> positions(iqs.size()); for (int i = 0; i < n; i++) { int ind = lower_bound(iqs.begin(), iqs.end(), mas[i].iq) - iqs.begin(); positions[ind].push_back(mas[i].x); } for (int i = 0; i < positions.size(); i++) { sort((positions[i]).begin(), (positions[i]).end()); (positions[i]) .resize(unique((positions[i]).begin(), (positions[i]).end()) - (positions[i]).begin()); } vector<Fenwick> fenws; for (int i = 0; i < iqs.size(); i++) { fenws.push_back(Fenwick(positions[i].size())); } long long ans = 0; for (auto t : mas) { int l = lower_bound(iqs.begin(), iqs.end(), t.iq - k) - iqs.begin(); while (l < iqs.size() && iqs[l] <= t.iq + k) { long long le = lower_bound(positions[l].begin(), positions[l].end(), t.x - t.r) - positions[l].begin(); long long ri = upper_bound(positions[l].begin(), positions[l].end(), t.x + t.r) - positions[l].begin() - 1; ans += fenws[l].get(le, ri); l++; } int ind = lower_bound(iqs.begin(), iqs.end(), t.iq) - iqs.begin(); int pos = lower_bound(positions[ind].begin(), positions[ind].end(), t.x) - positions[ind].begin(); fenws[ind].add(pos, 1); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string digit[10] = { , one , two , three , four , five , six , seven , eight , nine }; string tenth[10] = { , ten , twenty , thirty , forty , fifty , sixty , seventy , eighty , ninety }; string tenx[10] = { ten , eleven , twelve , thirteen , fourteen , fifteen , sixteen , seventeen , eighteen , nineteen }; cin >> n; switch (n / 10) { case 0: cout << digit[n % 10] << endl; break; case 1: cout << tenx[n % 10] << endl; break; default: if (digit[n % 10] == ) cout << tenth[n / 10] << endl; else cout << tenth[n / 10] << - << digit[n % 10] << endl; break; } if (n == 0) printf( zero ); return (0); } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x, n, i; cin >> n >> x; long long s = 0, an1 = (-1), an2 = (-1); int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n; i++) { s += a[i]; if (s % x != 0) { an1 = i + 1; } } s = 0; for (i = n - 1; i >= 0; i--) { s += a[i]; if (s % x != 0) { an2 = n - i; } } if (an2 >= an1) cout << an2 << n ; else cout << an1 << n ; } return (0); } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T Abs(const T& value) { return value < 0 ? -value : value; } template <typename T> inline T Sqr(const T& value) { return value * value; } const int maxn = 110; int a[maxn][maxn]; int main() { int k; int n = 0; cin >> k; while (k > 0) { int d = 3; while (((d + 1) * d * (d - 1)) / 6 <= k) { ++d; } for (int i = n; i < n + d; ++i) for (int j = i + 1; j < n + d; ++j) { a[i][j] = 1; a[j][i] = 1; } k -= ((d) * (d - 2) * (d - 1)) / 6; int how = 2; n += d; while (true) { how = 1; while (((how + 1) * how) / 2 <= k) ++how; if (how >= 2) { k -= (how * (how - 1)) / 2; for (int i = n - d; i < n && how > 0; ++i, --how) { a[n][i] = 1; a[i][n] = 1; } ++n; } else break; } } cout << n << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) cout << a[i][j]; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000 + 9; struct Point { double x, y; Point operator-(const Point& b) const { return (Point){x - b.x, y - b.y}; } } p[N]; double dis2(Point a, Point b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } double dis(Point a, Point b) { return sqrt(dis2(a, b)); } double cross(Point a, Point b) { return a.x * b.y - b.x * a.y; } double solve(Point a, Point c, Point b) { return fabs(cross(c - a, b - a)) / dis(a, b); } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %lf %lf , &p[i].x, &p[i].y); double ans = 10000000000; for (int i = 0; i < n; ++i) { ans = min(ans, solve(p[i], p[(i + 1) % n], p[(i + 2) % n])); } printf( %.10f , ans / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, i, j, m, x, y; const int N = 1e5 + 7; int t, S, q, ans; int main() { ios_base::sync_with_stdio(false); cin >> t >> S >> q; while (S < t) { S *= q; ans++; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-12; const int MAX = 1000 + 10; const int EDGE = 100000 + 10; struct point { double x, y; point() {} void input() { scanf( %lf%lf , &x, &y); } point(double a, double b) { x = a; y = b; } double operator^(const point &b) const { return x * b.y - b.x * y; } point operator-(const point &b) const { return point(x - b.x, y - b.y); } double operator*(const point &b) const { return x * b.x + y * b.y; } } p[1111]; double dis(point a, point b) { return sqrt((a - b) * (a - b)); } double dis2(point a, point b, point c) { double x, y, z, tp; x = dis(a, b); y = dis(b, c); z = dis(c, a); tp = (x + y + z) / 2; return sqrt(tp * (tp - x) * (tp - y) * (tp - z)) / z; } int main() { int n, i; double ans; while (~scanf( %d , &n)) { for (i = 0; i < n; i++) { p[i].input(); } p[n++] = p[0]; p[n++] = p[1]; ans = INF; for (i = 2; i < n; i++) { ans = min(ans, dis2(p[i - 2], p[i - 1], p[i])); } printf( %.10lf n , ans + eps); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 55, K = 55; int n, k, M, t[K]; int main() { scanf( %d%d%d , &n, &k, &M); long long wholetime = 0; for (int i = 0; i < k; i++) { scanf( %d , &t[i]); wholetime += t[i]; } sort(t, t + k); int ans = 0; for (int whole = 0; whole <= n; whole++) { long long time = whole * wholetime; int pts = whole * (k + 1); if (time <= M) { for (int i = 0; i < k; i++) { bool done = false; for (int j = 0; whole + j < n; j++) { if (time + t[i] <= M) { time += t[i]; pts++; } } } ans = max(ans, pts); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int m; int count; int sum; while (scanf( %d%d , &n, &m) != EOF) { count = 0; sum = 0; if (n == m) { printf( 0 ); printf( n ); continue; } while (n < m) { n = n * 2; count++; } int k = n - m; sum += count; while (count != -1 && k != 0) { while (k >= (1 << count)) { sum += k / (1 << count); k = k - (k / (1 << count)) * (1 << count); } count--; } printf( %d n , sum); } } |
#include <bits/stdc++.h> using namespace std; bool prime[1000001]; const double gr = 1.6180339887; void SieveOfErat(long long int mn) { memset(prime, true, sizeof(prime)); for (long long i = 2; i * i <= mn; i++) { if (prime[i] == true) { for (long long j = i * 2; j <= 1000000; j += i) prime[j] = false; } } } long long int num; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> num; vector<long long int> v(num); vector<long long int> v1(num); for (long long int i = 0; i < num; i++) { cin >> v[i] >> v1[i]; } sort(v.begin(), v.end()); sort(v1.begin(), v1.end()); long long int val = num; for (long long int i = 0; i < num; i++) { if (v[i] >= v1[i]) val = val + v[i]; else val = val + v1[i]; } cout << val << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << << p.second; return os; } template <class T, class U> inline istream& operator>>(istream& os, pair<T, U>& p) { os >> p.first >> p.second; return os; } template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { if (v.empty()) return os; if (v.begin() != v.end()) os << v.front(); for (auto it = ++v.begin(); it != v.end(); ++it) os << << *it; return os; } template <class T> inline istream& operator>>(istream& is, vector<T>& v) { for (auto& i : v) is >> i; return is; } void Solve(istream& is, ostream& os) { int n; is >> n; int res = n / 2 + 1; os << res << n ; for (int i = 1; i < res + 1; ++i) { os << i << << 1 << n ; } for (int i = 2; i < n - res + 2; ++i) { os << res << << i << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << setprecision(15) << fixed; Solve(cin, cout); return 0; } |
#include <bits/stdc++.h> using namespace std; using lld = int64_t; struct PT { lld x, y; PT() : x(0), y(0) {} PT(lld a, lld b) : x(a), y(b) {} PT operator-(const PT& a) const { return PT(x - a.x, y - a.y); } }; lld dot(const PT& a, const PT& b) { return a.x * b.x + a.y * b.y; } lld cross(const PT& a, const PT& b) { return a.x * b.y - a.y * b.x; } class ConvexHull_2D { private: vector<PT> dots; public: inline void init() { dots.clear(); } void insert(const PT& x) { dots.push_back(x); } void solve() { sort(begin(dots), end(dots), [](const PT& a, const PT& b) { return tie(a.x, a.y) < tie(b.x, b.y); }); vector<PT> stk((static_cast<int>((dots).size())) << 1); int top = 0; for (auto p : dots) { while (top >= 2 and cross(p - stk[top - 2], stk[top - 1] - stk[top - 2]) <= 0) top--; stk[top++] = p; } for (int i = (static_cast<int>((dots).size())) - 2, t = top + 1; i >= 0; i--) { while (top >= t and cross(dots[i] - stk[top - 2], stk[top - 1] - stk[top - 2]) <= 0) top--; stk[top++] = dots[i]; } stk.resize(top - 1); swap(stk, dots); } vector<PT> get() { return dots; } }; ConvexHull_2D cv; inline bool check(const vector<lld>&, const vector<lld>&); vector<lld> get_it(const vector<PT>& a) { vector<lld> ret; ret.push_back(dot(a.back() - a[0], a.back() - a[0])); ret.push_back(dot(a.back() - a[0], a[1] - a[0])); for (int i = 1; i < (static_cast<int>((a).size())) - 1; i++) { ret.push_back(dot(a[i - 1] - a[i], a[i - 1] - a[i])); ret.push_back(dot(a[i - 1] - a[i], a[i + 1] - a[i])); } ret.push_back(dot(a[(static_cast<int>((a).size())) - 2] - a[(static_cast<int>((a).size())) - 1], a[(static_cast<int>((a).size())) - 2] - a[(static_cast<int>((a).size())) - 1])); ret.push_back(dot(a[(static_cast<int>((a).size())) - 2] - a[(static_cast<int>((a).size())) - 1], a[0] - a[(static_cast<int>((a).size())) - 1])); return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; cv.init(); for (int i = 0; i < n; i++) { lld x, y; cin >> x >> y; cv.insert(PT(x, y)); } cv.solve(); vector<PT> one = cv.get(); cv.init(); for (int i = 0; i < m; i++) { lld x, y; cin >> x >> y; cv.insert(PT(x, y)); } cv.solve(); vector<PT> two = cv.get(); if ((static_cast<int>((one).size())) != (static_cast<int>((two).size())) or !check(get_it(one), get_it(two))) cout << NO << n ; else cout << YES << n ; return 0; } inline bool check(const vector<lld>& a, const vector<lld>& b) { for (int i = 0; i < (static_cast<int>((a).size())); i++) { bool flag = true; for (int j = 0; j < (static_cast<int>((b).size())); j++) { flag &= (a[(i + j) % (static_cast<int>((a).size()))] == b[j]); if (!flag) break; } if (flag) return true; } return false; } |
#include <bits/stdc++.h> using namespace std; struct fastIO { fastIO() {} }; void no() { cout << NO ; exit(0); } void yes() { cout << YES ; exit(0); } const int MAXN = 1e6 * 2; long long n, x, a[MAXN], b[MAXN], m, l, ans, y, z; int main() { if (0) cerr << fixed << setprecision(20); fastIO(); cin >> n >> m >> l; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (a[i] > l) { if (!x) { x++; b[i]++; ans++; } } else if (x) { b[i - 1]++; x = 0; } } for (int i = 0; i < m; i++) { cin >> x; if (x) { cin >> y >> z; y--; if (a[y] > l) continue; a[y] += z; if (0) cerr << endl; if (y && a[y] > l && b[y - 1] && b[y + 1]) { ans--; } else if (a[y] > l) { if ((y && b[y - 1]) || b[y + 1]) { b[y]++; } else { ans++; b[y]++; } } } else { cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int arr[m + 1]; arr[0] = 1; for (int i = 1; i <= m; i++) cin >> arr[i]; long long step = 0; for (int i = 0; i < m; i++) { if (arr[i + 1] < arr[i]) step += (n - arr[i]) + (arr[i + 1] - 1) + 1; else step += arr[i + 1] - arr[i]; } cout << step; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long SIZE = (long long)1e6 + 50; const long long NUM = 15; const long long TOT = 5; const long long SUM = (long long)1e2 + 50; const long long inf = (long long)1e18 + 50; 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 << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return f * x; } long long n, ans; long long num[SIZE], high[SIZE], ls[SIZE], rs[SIZE], cnt[SIZE]; signed main() { n = read(); long long indax = 0; for (long long i = 0; i < n; ++i) num[i] = read(); for (long long i = 1; i < n; ++i) if (num[i] > num[indax]) indax = i; for (long long i = 0; i <= n; ++i) high[i] = num[(i + indax) % n]; for (long long i = 1; i <= n; ++i) { ls[i] = i - 1; while (ls[i] && high[i] >= high[ls[i]]) ls[i] = ls[ls[i]]; } for (long long i = n - 1; i >= 0; --i) { rs[i] = i + 1; while (rs[i] < n && high[i] > high[rs[i]]) rs[i] = rs[rs[i]]; if (rs[i] < n && high[i] == high[rs[i]]) { cnt[i] = cnt[rs[i]] + 1; rs[i] = rs[rs[i]]; } } for (long long i = 0; i < n; ++i) { ans += cnt[i]; if (high[i] < high[0]) { ans += 2; if (!ls[i] && rs[i] == n) ans--; } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; const int MOD = 1e9 + 7; int a[N][N]; vector<pair<int, pair<int, int> > > vv; int p[N], dist[N][N]; std::vector<pair<int, int> > v[N]; int visit[N]; int root(int x) { while (x != p[x]) { p[x] = p[p[x]]; x = p[x]; } return x; } void join(int x, int y) { p[root(y)] = root(x); } void dfs(int node, int dis, int start) { visit[node] = start; if (a[start][node] != dis) { printf( NO ); exit(0); } for (auto i : v[node]) { if (visit[i.first] != start) { dfs(i.first, dis + i.second, start); } } } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf( %d , &a[i][j]); if (a[i][j] && i == j) { printf( NO ); return 0; } if (!a[i][j] && i != j) { printf( NO ); return 0; } if (i < j && a[i][j]) { vv.push_back({a[i][j], {i, j}}); } } } sort(vv.begin(), vv.end()); int ct = 0; for (int i = 1; i <= n; i++) p[i] = i; for (auto i : vv) { int wt = i.first, l = i.second.first, r = i.second.second; if (root(l) != root(r)) { join(l, r); v[l].push_back({r, wt}); v[r].push_back({l, wt}); ct++; if (ct == n - 1) break; } } for (int i = 1; i <= n; i++) { dfs(i, 0, i); } printf( YES ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[10]; int MOD = 1000000007; long long C[101][101]; void comb(int lim) { int n, r; C[0][0] = 1; for (n = 1; n <= lim; n++) { C[n][0] = 1; for (r = 1; r <= n - 1; r++) { C[n][r] = (C[n - 1][r - 1] + C[n - 1][r]) % MOD; } C[n][n] = 1; } } int f[101][10]; int main() { comb(100); scanf( %d , &n); for (int i = 0; i < (10); i++) scanf( %d , &a[i]); long long r = 0; for (int l = 0; l <= n; l++) { f[l][9] = (l >= a[9]); for (int d = 8; d >= 1; d--) { for (int k = a[d]; k <= l; k++) { f[l][d] = (f[l][d] + C[l][k] * f[l - k][d + 1]) % MOD; } } for (int k = a[0]; k <= l; k++) { f[l][0] = (f[l][0] + C[l - 1][k] * f[l - k][1]) % MOD; } if (l >= 1) r = (r + f[l][0]) % MOD; } cout << r << endl; return 0; } |
#include <bits/stdc++.h> int ar[100000]; int main() { int i, j, m, n, total = 0, a, b, c; scanf( %d %d , &n, &m); if (m == 0 || n == 1) printf( 0 ); else { for (j = 1; j <= m; j++) { scanf( %d %d %d , &a, &b, &c); ar[a] += c; ar[b] -= c; } for (i = 1; i <= n; i++) { if (ar[i] < 0) total += ar[i]; } total = -1 * total; printf( %d , total); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long INF = (long long)1000000007 * 1000000007; const long double eps = 1e-8; const long double pi = acos(-1.0); int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; int n, m, t[200010]; set<int> se[200010]; int e = 0; void merge(int a, int b) { if (se[a].size() < se[b].size()) { swap(se[a], se[b]); } for (int s : se[b]) { auto it1 = se[a].lower_bound(s + 1); if (it1 != se[a].end()) { if (*it1 == s + 1) e -= 1; } auto it2 = se[a].lower_bound(s - 1); if (it2 != se[a].end()) { if (*it2 == s - 1) e -= 1; } } auto it = se[b].begin(); while (!se[b].empty()) { se[a].insert(*it); it = se[b].erase(it); } } void solve() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , &t[i]); t[i]--; se[t[i]].insert(i); } for (int i = 0; i < n - 1; i++) { e += (t[i] != t[i + 1]); } cout << e << endl; for (int i = 0; i < m - 1; i++) { int a, b; scanf( %d%d , &a, &b); a--; b--; merge(a, b); printf( %d n , e); } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; using ll = long long; template <class t, class u> bool chmax(t& first, u second) { if (first < second) { first = second; return true; } else return false; } template <class t, class u> bool chmin(t& first, u second) { if (second < first) { first = second; return true; } else return false; } template <class t> using vc = vector<t>; template <class t> using vvc = vc<vc<t>>; using pi = pair<ll, ll>; using vi = vc<ll>; template <class t, class u> ostream& operator<<(ostream& os, const pair<t, u>& p) { return os << { << p.first << , << p.second << } ; } template <class t> ostream& operator<<(ostream& os, const vc<t>& v) { os << { ; for (auto e : v) os << e << , ; return os << } ; } using uint = unsigned; using ull = unsigned long long; template <class t, size_t n> ostream& operator<<(ostream& os, const array<t, n>& first) { return os << vc<t>(first.begin(), first.end()); } template <ll i, class T> void print_tuple(ostream&, const T&) {} template <ll i, class T, class H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << , ; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <class... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << { ; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << } ; } template <class t> void print(t x, ll suc = 1) { cout << x; if (suc == 1) cout << n ; if (suc == 2) cout << ; } ll read() { ll i; cin >> i; return i; } vi readvi(ll n, ll off = 0) { vi v(n); for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off; return v; } pi readpi(ll off = 0) { ll first, second; cin >> first >> second; return pi(first + off, second + off); } template <class t, class u> void print(const pair<t, u>& p, ll suc = 1) { print(p.first, 2); print(p.second, suc); } template <class T> void print(const vector<T>& v, ll suc = 1) { for (ll i = ll(0); i < ll(v.size()); i++) print(v[i], i == ll(v.size()) - 1 ? suc : 2); } template <class T> void print_offset(const vector<T>& v, ll off, ll suc = 1) { for (ll i = ll(0); i < ll(v.size()); i++) print(v[i] + off, i == ll(v.size()) - 1 ? suc : 2); } template <class T, size_t N> void print(const array<T, N>& v, ll suc = 1) { for (ll i = ll(0); i < ll(N); i++) print(v[i], i == ll(N) - 1 ? suc : 2); } string readString() { string s; cin >> s; return s; } template <class T> T sq(const T& t) { return t * t; } void yes(bool ex = true) { cout << Yes << n ; if (ex) exit(0); } void no(bool ex = true) { cout << No << n ; if (ex) exit(0); } void possible(bool ex = true) { cout << Possible << n ; if (ex) exit(0); } void impossible(bool ex = true) { cout << Impossible << n ; if (ex) exit(0); } constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; } const ll infLL = LLONG_MAX / 3; const ll inf = infLL; ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); } ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); } ll popcount(signed t) { return __builtin_popcount(t); } ll popcount(ll t) { return __builtin_popcountll(t); } bool ispow2(ll i) { return i && (i & -i) == i; } ll mask(ll i) { return (ll(1) << i) - 1; } bool inc(ll first, ll second, ll c) { return first <= second && second <= c; } template <class t> void mkuni(vc<t>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } ll rand_int(ll l, ll r) { static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count()); return uniform_int_distribution<ll>(l, r)(gen); } template <class t> void myshuffle(vc<t>& first) { for (ll i = ll(0); i < ll(ll(first.size())); i++) swap(first[i], first[rand_int(0, i)]); } template <class t> ll lwb(const vc<t>& v, const t& first) { return lower_bound(v.begin(), v.end(), first) - v.begin(); } vvc<ll> readGraph(ll n, ll m) { vvc<ll> g(n); for (ll i = ll(0); i < ll(m); i++) { ll first, second; cin >> first >> second; first--; second--; g[first].push_back(second); g[second].push_back(first); } return g; } vvc<ll> readTree(ll n) { return readGraph(n, n - 1); } struct modinfo { uint mod, root; }; template <modinfo const& ref> struct modular { static constexpr uint const& mod = ref.mod; static modular root() { return modular(ref.root); } uint v; modular(ll vv = 0) { s(vv % mod + mod); } modular& s(uint vv) { v = vv < mod ? vv : vv - mod; return *this; } modular operator-() const { return modular() - *this; } modular& operator+=(const modular& rhs) { return s(v + rhs.v); } modular& operator-=(const modular& rhs) { return s(v + mod - rhs.v); } modular& operator*=(const modular& rhs) { v = ull(v) * rhs.v % mod; return *this; } modular& operator/=(const modular& rhs) { return *this *= rhs.inv(); } modular operator+(const modular& rhs) const { return modular(*this) += rhs; } modular operator-(const modular& rhs) const { return modular(*this) -= rhs; } modular operator*(const modular& rhs) const { return modular(*this) *= rhs; } modular operator/(const modular& rhs) const { return modular(*this) /= rhs; } modular pow(ll n) const { if (n < 0) return inv().pow(-n); modular res(1), x(*this); while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } modular inv() const { return pow(mod - 2); } friend modular operator+(ll x, const modular& y) { return modular(x) + y; } friend modular operator-(ll x, const modular& y) { return modular(x) - y; } friend modular operator*(ll x, const modular& y) { return modular(x) * y; } friend modular operator/(ll x, const modular& y) { return modular(x) / y; } friend ostream& operator<<(ostream& os, const modular& m) { return os << m.v; } friend istream& operator>>(istream& is, modular& m) { ll x; is >> x; m = modular(x); return is; } bool operator<(const modular& r) const { return v < r.v; } bool operator==(const modular& r) const { return v == r.v; } bool operator!=(const modular& r) const { return v != r.v; } explicit operator bool() const { return v; } }; extern constexpr modinfo base{998244353, 3}; using mint = modular<base>; const ll kmax = ten(7) + 10; mint p2[kmax], i2[kmax], w[kmax]; mint j2[kmax], z[kmax]; ll cnt[kmax]; mint sub(ll n, ll m) { mint num = 0, den = 1; mint pn = mint(2).pow(n), nmd = 1, dd = 1; ll s = min(n, m); j2[s] = pn.inv(); for (ll i = ll(s) - 1; i >= ll(0); i--) j2[i] = j2[i + 1] * 2; cnt[0] = 0; z[0] = 1; for (ll i = ll(0); i < ll(s); i++) { if (j2[i + 1] == 1) { cnt[i + 1] = cnt[i] + 1; z[i + 1] = 1; } else { cnt[i + 1] = cnt[i]; z[i + 1] = z[i] * (1 - j2[i + 1]); } } for (ll d = ll(0); d < ll(min(n, m) + 1); d++) { if (cnt[s - d] == cnt[s]) { mint x = nmd * z[s] * w[m]; mint y = dd * z[s - d] * w[m - d] * w[d]; tie(num, den) = make_pair(num * y + x * den, den * y); } nmd *= pn * p2[m]; dd *= sq(p2[d]); } return num / den; } void slv() { ll n, k, unko; cin >> n >> k >> unko; if (unko == 0) { if (n > k) { print(0); } else { mint ans = 1; for (ll i = ll(0); i < ll(n); i++) ans *= p2[k] - p2[i]; print(ans); } } else { mint fsum = sub(n, k); mint ans = (p2[k].pow(n) * p2[k] - fsum) / (p2[k] - 1); print(ans); } } signed main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20); p2[0] = 1; for (ll i = ll(1); i < ll(kmax); i++) p2[i] = p2[i - 1] * 2; i2[kmax - 1] = p2[kmax - 1].inv(); for (ll i = ll(kmax) - 1; i >= ll(1); i--) i2[i - 1] = i2[i] * 2; w[0] = 1; for (ll i = ll(1); i < ll(kmax); i++) w[i] = w[i - 1] * (1 - i2[i]); ll t; cin >> t; for (ll _ = ll(0); _ < ll(t); _++) slv(); } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long a, b; cin >> a >> b; long long c = abs(a - b); if (a == b) cout << 0 << n ; else { long long ans; if (c % 10 == 0) ans = c / 10; else { ans = (c / 10) + 1; } cout << ans << n ; } } } |
#include <bits/stdc++.h> using namespace std; int n; int a[109]; int ans; int s; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); s += a[i]; ans = max(ans, a[i]); } for (;; ans++) { if (ans * n - s > s) { printf( %d , ans); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = 4 * atan(1); const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int MOD = 1e9 + 7; int nCase = 0; int dcmp(double x) { if (fabs(x) < eps) return 0; return x < 0 ? -1 : 1; } template <class T> inline bool read(T &n) { T x = 0, tmp = 1; char c = getchar(); while ((c < 0 || c > 9 ) && c != - && c != EOF) c = getchar(); if (c == EOF) return false; if (c == - ) c = getchar(), tmp = -1; while (c >= 0 && c <= 9 ) x *= 10, x += (c - 0 ), c = getchar(); n = x * tmp; return true; } template <class T> inline void write(T n) { if (n < 0) { putchar( - ); n = -n; } int len = 0, data[20]; while (n) { data[len++] = n % 10; n /= 10; } if (!len) data[len++] = 0; while (len--) putchar(data[len] + 48); } long long QMOD(long long x, long long k) { long long res = 1LL; while (k) { if (k & 1) res = res * x % MOD; k >>= 1; x = x * x % MOD; } return res; } int n; priority_queue<pair<int, int> > q; map<int, int> mp; vector<pair<pair<int, int>, int> > v; inline bool check(int mid) { priority_queue<pair<int, int> > que = q; int cnt = 0; v.clear(); while (que.size() > 2 && cnt < mid) { pair<int, int> f1 = que.top(); que.pop(); pair<int, int> f2 = que.top(); que.pop(); pair<int, int> f3 = que.top(); que.pop(); int a = f1.second; int b = f2.second; int c = f3.second; if (a < b) swap(a, b); if (a < c) swap(a, c); if (b < c) swap(b, c); v.push_back(pair<pair<int, int>, int>(pair<int, int>(a, b), c)); ++cnt; if (--f1.first > 0) que.push(f1); if (--f2.first > 0) que.push(f2); if (--f3.first > 0) que.push(f3); } return cnt >= mid; } int main(int argc, const char *argv[]) { scanf( %d , &n); for (int i = 1, x; i <= n; ++i) { read(x); mp[x]++; } map<int, int>::iterator it; for (it = mp.begin(); it != mp.end(); ++it) { q.push(pair<int, int>(it->second, it->first)); } int l = 0, r = n / 3; int ans = 0; while (l <= r) { int mid = (l + r) >> 1; if (check(mid) == true) { l = mid + 1; ans = mid; } else r = mid - 1; } printf( %d n , ans); if (ans > 0) { for (int i = 0; i < ans; ++i) printf( %d %d %d n , v[i].first.first, v[i].first.second, v[i].second); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int ansx[maxn], ansy[maxn]; int b[maxn], c[maxn]; struct node { int g, p, t, id; node() {} node(int g, int p, int t, int id) { this->g = g; this->p = p; this->t = t; this->id = id; } } a[maxn], init[maxn]; bool cmp(node x, node y) { return (x.t - x.p) < (y.t - y.p) || ((x.t - x.p) == (y.t - y.p) && x.p < y.p); } int main() { std::ios::sync_with_stdio(false); int n, w, h; cin >> n >> w >> h; for (int i = 1; i <= n; i++) { cin >> a[i].g >> a[i].p >> a[i].t; a[i].id = i; init[i] = a[i]; } sort(a + 1, a + 1 + n, cmp); int now = 1; while (now <= n) { int t1 = 0, t2 = 0; if (a[now].g == 1) b[t1++] = a[now].id; else c[t2++] = a[now].id; now++; while (now <= n && (a[now].t - a[now].p == a[now - 1].t - a[now - 1].p)) { if (a[now].g == 1) b[t1++] = a[now].id; else c[t2++] = a[now].id; now++; } for (int i = 0; i < t1; i++) { int lastx = t1 - i - 1; int lasty = t2; if (lastx < lasty) { ansx[b[i]] = w; ansy[b[i]] = init[c[lastx]].p; } else { ansx[b[i]] = init[b[i + lasty]].p; ansy[b[i]] = h; } } for (int i = 0; i < t2; i++) { int lastx = t1; int lasty = t2 - i - 1; if (lastx > lasty) { ansy[c[i]] = h; ansx[c[i]] = init[b[lasty]].p; } else { ansx[c[i]] = w; ansy[c[i]] = init[c[i + lastx]].p; } } } for (int i = 1; i <= n; i++) printf( %d %d n , ansx[i], ansy[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, r; scanf( %d %d , &m, &r); int i; double sum = 0.0; if (m == 1) printf( %f , 2.0 * r); else if (m == 2) printf( %f , (2.0 + sqrt(2.0) / 2) * r); else { for (i = 2; i <= m - 1; i++) { sum += (i - 1.0) * (i - 2.0) + (m - i) * (m - i - 1.0) + (m - 3.0) * 2.0 * sqrt(2.0) + 6 + 2 * sqrt(2.0); } double ans; ans = sum * 1.0 / m * r / m + ((m - 1.0) * (m - 2.0) + 4 + sqrt(2.0) + (m - 2) * 2 * sqrt(2.0)) * 2 * r / m / m; printf( %f , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() {} signed main() { ios::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; deque<long long> dq; for (long long i = 1; i <= n; i++) { long long x; cin >> x; dq.push_back(x); } for (long long i = 1; i <= 2e6; i++) { while ((long long)dq.size()) { if (dq.front() - 1 <= i) { dq.pop_front(); } else break; } while ((long long)dq.size()) { if (1e6 - dq.back() <= i) { dq.pop_back(); } else break; } if (dq.empty()) { cout << i << n ; break; } } } |
#include <bits/stdc++.h> using namespace std; int query(int a, int b) { cout << ? << a << << b << endl; fflush(stdout); int tmp; cin >> tmp; return tmp; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int flag = query(0, 0); int a = 0, b = 0; int tmp; for (int i = 29; i >= 0; i--) { if (flag == 0) { tmp = query(a | (1 << i), b); if (tmp == -1) { a |= (1 << i); b |= (1 << i); } } else if (flag == 1) { tmp = query(a | (1 << i), b | (1 << i)); if (tmp == -1) { a |= (1 << i); flag = query(a, b); } else { tmp = query(a | (1 << i), b); if (tmp == -1) { a |= (1 << i); b |= (1 << i); } } } else { tmp = query(a | (1 << i), b | (1 << i)); if (tmp == 1) { b |= (1 << i); flag = query(a, b); } else { tmp = query(a | (1 << i), b); if (tmp == -1) { a |= (1 << i); b |= (1 << i); } } } } cout << ! << a << << b << endl; fflush(stdout); } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 1e5 + 4; int a[NMAX]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int mn = 1e9 + 4; for (int i = 0; i < n; ++i) { cin >> a[i]; mn = min(mn, a[i]); } vector<int> res; for (int i = 0; i < n; ++i) { if (a[i] == mn) { res.push_back(i); } } int ans = 1e6 + 4; for (int i = 0; i < res.size() - 1; ++i) { ans = min(ans, (res[i + 1] - res[i])); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long x; long long e = 0; long long pos = 0; long long ans = 0; for (long long i = 0; i < n; i++) { cin >> x; e += (pos - x); if (e < 0) { ans += (-1) * e; e = 0; } pos = x; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int num[6300000]; int main() { int i, j, k; memset(num, 0, sizeof(num)); for (i = 1; i <= 500; i++) num[(i * (i + 1)) / 2] = 1; while (~scanf( %d , &k)) { if (num[k] == 1) printf( YES n ); else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int counter = 0; int min_c = min(min(a, b / 2), c / 4); counter = 4 * min_c + min_c + min_c * 2; if (c / 4 == 0 || b / 2 == 0) { cout << 0; } else { cout << counter; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -Ofast , -funroll-all-loops ) using namespace std; long long a, k, res; inline long long check(long long x) { while (x) { if (x % 10 == 0) return 1; x /= 10; } return 0; } inline long long f(long long x) { long long res = 0; while (x) res = max(res, x % 10), x /= 10; return res; } inline long long g(long long x) { long long res = 10; while (x) res = min(res, x % 10), x /= 10; return res; } inline void solve() { cin >> a >> k; res = k; if (k == 1) return printf( %lld n , a), void(); for (long long i = 2; i <= k; i++) { if (check(a)) break; a = a + f(a) * g(a); } printf( %lld n , a); } signed main() { long long T; cin >> T; while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int i, n, t, p = INT_MAX, j = 0, x, a = 0, b, l = 0, r = 0, k = 0, e, w = 0; long long sum = 0; string s, m; cin >> n; int ara[n]; int ar[n]; int arr[n]; for (i = 0; i < n; i++) { cin >> ara[i]; ar[j++] = ara[i]; } for (i = 0; i < n; i++) { p = ara[i]; ar[i] = ara[i]; for (j = i + 1; j < n; j++) { if (ara[j] > p) { ar[j] = p; } else { p = ara[j]; ar[j] = ara[j]; } } p = ara[i]; for (k = i - 1; k >= 0; k--) { if (ara[k] > p) { ar[k] = p; } else { p = ara[k]; ar[k] = ara[k]; } } for (int y = 0; y < n; y++) { sum += ar[y]; } if (w <= sum) { w = sum; for (int g = 0; g < n; g++) { arr[g] = ar[g]; } } sum = 0; } for (i = 0; i < n; i++) { cout << arr[i] << ; } return EXIT_SUCCESS; } |
#include <bits/stdc++.h> using namespace std; const int Win = 3, Loop = 2, Lose = 1; int n, dp[7001][3], ne[3], a[7001][3], k[3], sum[7001][3]; bool b[7001][3]; inline int max(int x, int y) { return x > y ? x : y; } void dfs(int x, int y) { if (b[x][y]) return; b[x][y] = 1; int t = ne[y]; for (int i = 1; i <= k[t]; i++) { int xt = x - a[i][t]; if (xt <= 0) xt += n; if (xt == 1) continue; dp[xt][t] = max(dp[xt][t], 4 - dp[x][y]); if (++sum[xt][t] == k[t] || dp[xt][t] == Win) dfs(xt, t); } } int main() { scanf( %d , &n); scanf( %d , &k[1]); for (int i = 1; i <= k[1]; i++) scanf( %d , &a[i][1]); scanf( %d , &k[2]); for (int i = 1; i <= k[2]; i++) scanf( %d , &a[i][2]); dp[1][1] = dp[1][2] = Lose; ne[1] = 2; ne[2] = 1; dfs(1, 1); dfs(1, 2); for (int j = 1; j <= 2; j++) { for (int i = 2; i <= n; i++) { if (!b[i][j]) dp[i][j] = Loop; printf(dp[i][j] == Win ? Win : dp[i][j] == Loop ? Loop : Lose ); } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long m) { if (y == 0) return 1; long long p = power(x, y / 2, m) % m; p = (p * p) % m; return (y % 2 == 0) ? p : (x * p) % m; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long modInverse(long long a, long long m) { long long g = gcd(a, m); if (g != 1) return -1; else return power(a, m - 2, m); } int main() { long long a, b, p, x; cin >> a >> b >> p >> x; long long pow = 1; long long cnt(0); for (long long j = 1; j < p; ++j) { pow = (pow * a) % p; long long invPow = modInverse(pow, p); if (invPow == -1) continue; long long y = (b * invPow) % p; long long mn, d; mn = ((j - y + p) % p) * (p - 1) + j; if (mn > x) continue; cnt += (x - mn) / (p * (p - 1)) + 1; } cout << cnt; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; vector<int> Pr = { 0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999}; int dist[5010][5010], pr[5010][5010], pr_mx[5010]; int c1[5010], c2[5010][710]; int n, k[1000010]; long long ans = (1ll << 60); void f(int st) { long long s1 = 0, s2 = 0, s3 = c1[st]; for (int i = 0; i <= 5000; i++) if (st != i) s1 += (long long)c1[i] * (dist[st][i] + dist[i][st]), s2 += c1[i]; for (int i = 0, j = st - 1, k = st + 1; i <= c2[st][669]; i++) { while (j >= 0 && dist[st][j] <= i) { s3 += c1[j]; s2 -= c1[j]; j--; } while (k <= 5000 && dist[st][k] <= i) { s3 += c1[k]; s2 -= c1[k]; k++; } ans = min(ans, s1); s1 += s3; s1 -= s2; } ans = min(ans, s1); } int main() { for (int i = 1; i <= 5000; i++) { for (int j = 669; j >= 1; j--) if (i % Pr[j] == 0) { pr_mx[i] = j; break; } } for (int i = 0; i <= 5000; i++) for (int j = i + 1; j <= 5000; j++) { pr[i][j] = max(pr[i][j - 1], pr_mx[j]); } for (int i = 1; i <= 5000; i++) for (int j = i, k = 1; k <= 669; k++) { c2[i][k] = c2[i - 1][k]; while (j % Pr[k] == 0) { j /= Pr[k]; c2[i][k]++; } } for (int i = 1; i <= 5000; i++) for (int j = 1; j <= 669; j++) c2[i][j] += c2[i][j - 1]; for (int i = 0; i <= 5000; i++) for (int j = i + 1; j <= 5000; j++) { if (!pr[i][j]) continue; dist[i][j] = c2[i][pr[i][j] - 1]; dist[j][i] = c2[j][pr[i][j]] - c2[i][pr[i][j]] + c2[i][pr[i][j] - 1]; } scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &k[i]); c1[k[i]]++; } for (int i = 0; i <= 5000; i++) if (c1[i]) f(i); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; namespace fft { struct num { double x, y; num() { x = y = 0; } num(double x, double y) : x(x), y(y) {} }; inline num operator+(num a, num b) { return num(a.x + b.x, a.y + b.y); } inline num operator-(num a, num b) { return num(a.x - b.x, a.y - b.y); } inline num operator*(num a, num b) { return num(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x); } inline num conj(num a) { return num(a.x, -a.y); } int base = 1; vector<num> roots = {{0, 0}, {1, 0}}; vector<int> rev = {0, 1}; const double PI = acosl(-1.0); void ensure_base(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); while (base < nbase) { double angle = 2 * PI / (1 << (base + 1)); for (int i = 1 << (base - 1); i < (1 << base); i++) { roots[i << 1] = roots[i]; double angle_i = angle * (2 * i + 1 - (1 << base)); roots[(i << 1) + 1] = num(cos(angle_i), sin(angle_i)); } base++; } } void fft(vector<num> &a, int n = -1) { if (n == -1) n = a.size(); assert((n & (n - 1)) == 0); int zeros = __builtin_ctz(n); ensure_base(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 k = 1; k < n; k <<= 1) { for (int i = 0; i < n; i += 2 * k) { for (int j = 0; j < k; j++) { num z = a[i + j + k] * roots[j + k]; a[i + j + k] = a[i + j] - z; a[i + j] = a[i + j] + z; } } } } vector<num> fa, fb; vector<int> multiply_mod(vector<int> &a, vector<int> &b, int m, int eq = 0) { int need = a.size() + b.size() - 1; int nbase = 0; while ((1 << nbase) < need) nbase++; ensure_base(nbase); int sz = 1 << nbase; if (sz > (int)fa.size()) fa.resize(sz); for (int i = 0; i < (int)a.size(); i++) { int x = (a[i] % m + m) % m; fa[i] = num(x & ((1 << 15) - 1), x >> 15); } fill(fa.begin() + a.size(), fa.begin() + sz, num{0, 0}); fft(fa, sz); if (sz > (int)fb.size()) fb.resize(sz); if (eq) copy(fa.begin(), fa.begin() + sz, fb.begin()); else { for (int i = 0; i < (int)b.size(); i++) { int x = (b[i] % m + m) % m; fb[i] = num(x & ((1 << 15) - 1), x >> 15); } fill(fb.begin() + b.size(), fb.begin() + sz, num{0, 0}); fft(fb, sz); } double ratio = 0.25 / sz; num r2(0, -1), r3(ratio, 0), r4(0, -ratio), r5(0, 1); for (int i = 0; i <= (sz >> 1); i++) { int j = (sz - i) & (sz - 1); num a1 = (fa[i] + conj(fa[j])); num a2 = (fa[i] - conj(fa[j])) * r2; num b1 = (fb[i] + conj(fb[j])) * r3; num b2 = (fb[i] - conj(fb[j])) * r4; if (i != j) { num c1 = (fa[j] + conj(fa[i])); num c2 = (fa[j] - conj(fa[i])) * r2; num d1 = (fb[j] + conj(fb[i])) * r3; num d2 = (fb[j] - conj(fb[i])) * r4; fa[i] = c1 * d1 + c2 * d2 * r5; fb[i] = c1 * d2 + c2 * d1; } fa[j] = a1 * b1 + a2 * b2 * r5; fb[j] = a1 * b2 + a2 * b1; } fft(fa, sz); fft(fb, sz); vector<int> res(need); for (int i = 0; i < need; i++) { long long aa = fa[i].x + 0.5; long long bb = fb[i].x + 0.5; long long cc = fa[i].y + 0.5; res[i] = (aa + ((bb % m) << 15) + ((cc % m) << 30)) % m; } return res; } vector<int> square_mod(vector<int> &a, int m) { return multiply_mod(a, a, m, 1); } }; // namespace fft const int N = 2e5 + 100; const int H_NM = 1; int seed[H_NM] = {(int)(1e3 + 7)}; int mod[H_NM] = {(int)(1e9 + 9)}; int pws[H_NM][N]; int add(int x, int y, int mod) { x += y; if (x >= mod) x -= mod; return x; } int mul(int x, int y, int mod) { return ((long long)x * y) % mod; } struct Hash { int vals[H_NM]; int len; Hash() { len = 0; memset(vals, 0, sizeof vals); } Hash(int te[]) { for (int i = 0; i < H_NM; i++) { vals[i] = te[i]; } } void push_back(int x) { for (int i = 0; i < H_NM; i++) { vals[i] = add(vals[i], mul(pws[i][len], x, mod[i]), mod[i]); } len++; } bool operator<(const Hash &oth) const { for (int i = 0; i < H_NM; i++) { if (vals[i] < oth.vals[i]) return 1; if (vals[i] > oth.vals[i]) return 0; } return 1; } bool operator==(const Hash &oth) const { for (int i = 0; i < H_NM; i++) { if (vals[i] != oth.vals[i]) return 0; } return 1; } }; void init() { for (int i = 0; i < H_NM; i++) { pws[i][0] = 1; for (int j = 1; j < N; j++) { pws[i][j] = mul(pws[i][j - 1], seed[i], mod[i]); } } } char s[N]; char t[N]; int p[N]; void read() { for (int i = 0; i < 26; i++) { scanf( %d , &p[i]); p[i]--; } scanf( %s , s); scanf( %s , t); } vector<vector<int> > divAlpha() { int vis[26] = {}; vector<vector<int> > res; int sz = 2; for (int i = 0; i < 26; i++) { int x = i; if (vis[x]) continue; vis[x] = 1; while (1) { if (vis[p[x]]) { if (vis[x] == vis[p[x]]) { vis[x] = 3; sz = 3; } break; } vis[p[x]] = vis[x] ^ 3; x = p[x]; } } res.resize(sz); for (int i = 0; i < 26; i++) { res[vis[i] - 1].push_back(i); } return res; } Hash genHashVal(char *s, int n, vector<int> alpha) { Hash res; bool ok[26] = {}; for (auto a : alpha) ok[a] = 1; for (int i = 0; i < n; i++) { if (ok[s[i] - a ]) res.push_back(s[i] - a + 1); else res.push_back(0); } return res; } int ans[N]; int n, m; void pro(vector<int> &alpha) { Hash val = genHashVal(s, n, alpha); vector<int> res[H_NM]; bool ok[26] = {}; for (auto a : alpha) ok[a] = 1; int vl[26] = {}; for (auto a : alpha) { vl[a] = a + 1; vl[p[a]] = a + 1; } for (int j = 0; j < H_NM; j++) { vector<int> a; vector<int> b; int pw = 1; for (int i = 0; i < n; i++) { if (ok[s[i] - a ]) a.push_back(pw); else a.push_back(0); pw = mul(pw, seed[j], mod[j]); } for (int i = 0; i < m; i++) { b.push_back(vl[t[i] - a ]); } reverse(a.begin(), a.end()); res[j] = fft::multiply_mod(a, b, mod[j]); } for (int i = n - 1, it = 0; it < m - n + 1; i++, it++) { int arr[H_NM]; for (int j = 0; j < H_NM; j++) { arr[j] = res[j][i]; } Hash te(arr); if (!(te == val)) { ans[it] = 0; } } } int main() { init(); read(); n = strlen(s); m = strlen(t); for (int i = 0; i < m - n + 1; i++) { ans[i] = 1; } vector<vector<int> > alphaParts = divAlpha(); for (auto alpha : alphaParts) { pro(alpha); } for (int i = 0; i < m - n + 1; i++) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long n, m; string p, s; vector<int> pos; long long exp(long long a, long long x) { if (x == 0) return 1; long long tmp = exp(a, x / 2); tmp *= tmp; tmp %= MOD; if (x % 2) tmp *= a; tmp %= MOD; return tmp; } bool z(string str) { int n = (int)str.length(); vector<int> z(n); for (int i = 1, l = 0, r = 0; i < n; ++i) { if (i <= r) z[i] = min(r - i + 1, z[i - l]); while (i + z[i] < n && str[z[i]] == str[i + z[i]]) ++z[i]; if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1; } for (int i = 0; i < pos.size(); ++i) { if (z[pos[i] + p.size() + 1] != p.size()) return false; } return true; } int main() { cin >> n >> m >> p; pos.assign(m, 0); for (int i = 0; i < m; ++i) { cin >> pos[i]; pos[i]--; } sort(pos.begin(), pos.end()); for (int i = 0; i < m; ++i) { while (s.size() < pos[i]) s += . ; int stp = s.size(); for (int j = stp - pos[i]; j < p.size(); ++j) { s += p[j]; } } while (s.size() < n) s += . ; s = p + # + s; if (z(s)) { int cnt = 0; for (auto i : s) cnt += i == . ; cout << exp(26, cnt); } else cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; double EPS = 1e-9; long long INF = 1000000000000000005ll; double PI = acos(-1); inline string IntToString(long long int a) { char x[100]; sprintf(x, %lld , a); string s = x; return s; } inline long long int StringToInt(string a) { char x[100]; long long int res; strcpy(x, a.c_str()); sscanf(x, %lld , &res); return res; } inline string uppercase(string s) { int n = (int)s.size(); for (long long int i = 0; i < n; i++) if (s[i] >= a && s[i] <= z ) s[i] = s[i] - a + A ; return s; } inline string lowercase(string s) { int n = (int)s.size(); for (long long int i = 0; i < n; i++) if (s[i] >= A && s[i] <= Z ) s[i] = s[i] - A + a ; return s; } bool sortcol(const vector<long long int>& v1, const vector<long long int>& v2) { return v1[0] > v2[0]; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t-- > 0) { long long int n; cin >> n; n *= 2; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); cout << a[n / 2] - a[n / 2 - 1] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 505, M = 100500; int read(int &n) { char ch = ; int q = 0, w = 1; for (; (ch != - ) && ((ch < 0 ) || (ch > 9 )); ch = getchar()) ; if (ch == - ) w = -1, ch = getchar(); for (; ch >= 0 && ch <= 9 ; ch = getchar()) q = q * 10 + ch - 48; n = q * w; return n; } int m, n, m1; int B[M * 2][2], A[N], B0, B1[N]; int b1[N], zx[N]; double s[N][N], t[N][N], di[N][N]; void link(int q, int w) { B1[q]++, B1[w]++; B[++B0][0] = A[q]; A[q] = B0, B[B0][1] = w; B[++B0][0] = A[w]; A[w] = B0, B[B0][1] = q; } void chenans() { for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) t[i][j] = 0; for (int k = 1; k <= m; k++) for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) t[i][j] += s[i][k] * di[k][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) s[i][j] = t[i][j]; } void chen() { for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) t[i][j] = 0; for (int k = 1; k <= m; k++) for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) t[i][j] += di[i][k] * di[k][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) di[i][j] = t[i][j]; } double JC() { while (m1) { if (m1 & 1) chenans(); chen(); m1 >>= 1; } double ans = 0; for (int i = 1; i <= m; i++) ans += s[i][m]; return ans; } double b[N][N], c[N][N]; int z[N]; void GS() { for (int i = 1; i <= n; i++) { b[i][i] = c[i][i] = 1; for (int j = A[i]; j; j = B[j][0]) if (!zx[B[j][1]]) b[i][B[j][1]] -= 1.0 / B1[B[j][1]]; } for (int i = 1; i <= n; i++) { int q = i; for (int j = i + 1; j <= n; j++) if (((b[j][i]) > 0 ? (b[j][i]) : -(b[j][i])) > ((b[q][i]) > 0 ? (b[q][i]) : -(b[q][i]))) q = j; if (q != i) { for (int j = 1; j <= n; j++) swap(b[i][j], b[q][j]), swap(c[i][j], c[q][j]); } for (int j = 1; j <= n; j++) if (i != j) { double t = b[j][i] / b[i][i]; for (int k = 1; k <= n; k++) b[j][k] -= t * b[i][k], c[j][k] -= t * c[i][k]; } } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) c[i][j] /= b[i][i]; for (int i = A[1]; i; i = B[i][0]) z[B[i][1]]++; for (int i = 1; i <= n; i++) if (zx[i]) { for (int j = 1; j <= n; j++) s[zx[i]][zx[i]] += c[i][j] * ((double)z[j] / B1[1]); } for (int I = 1; I <= n; I++) if (zx[I] && B1[I]) { for (int i = 1; i <= n; i++) z[i] = 0; for (int i = A[I]; i; i = B[i][0]) z[B[i][1]]++; for (int i = 1; i <= n; i++) if (zx[i]) { for (int j = 1; j <= n; j++) di[zx[I]][zx[i]] += c[i][j] * ((double)z[j] / B1[I]); } } } int main() { int q, w; read(n), read(m), read(m1); m1 -= 2; if (m1 < 0) { printf( 0 n ); return 0; } for (int i = 1; i <= n; i++) if (read(q)) b1[++b1[0]] = i, zx[i] = b1[0]; for (int i = 1; i <= m; i++) read(q), read(w), link(q, w); GS(); m = b1[0]; printf( %.12lf n , JC()); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, i, j, k, l, t; cin >> t; while (t--) { cin >> n; vector<int> a(n); for (i = 0; i < n; i++) { cin >> a[i]; } k = 1; long long total = 0; for (i = 0; i < n; i++) { if (k % 2 != 0) { total += a[i]; if (a[i + 1] == 0) { while (i + 1 < n && a[i + 1] == 0) { i++; } } } else { if (a[i + 1] == 1) i++; } k++; } cout << total << endl; } } |
#include <bits/stdc++.h> const long long INF = (1e9 + 12312), MOD = 1e9 + 7; const long double EPS = 0.0000000001; using namespace std; bool ask(long long first, long long second) { cout << first << << second << endl; string s; cin >> s; if (s == Bad ) { exit(1); } return s == Yes ; } signed main() { ios_base::sync_with_stdio(false); srand(time(0)); long long n, k; cin >> n >> k; long long now = 0; long long first = 1, second = n; long long lastl = 1, lastr = n; for (int i = 0; i < 4500; i++) { if (now >= 7) { first = max(lastl - 8 * k, 1LL); second = min(lastr + 8 * k, n); lastl = -1; now = 0; } long long askl = first, askr = second; if (second - first == 0) { if (ask(first, first)) { return 0; } first = 1, second = n; continue; } if (second - first + 1 <= 50) { if (lastl == -1) { lastr = second; lastl = first; } now++; long long askl = first + rand() % (second - first + 1); if (ask(askl, askl)) { return 0; } continue; } else { now = 0; lastl = -1; lastr = -1; if (rand() % 2) { askl = first + (second - first + 1) / 2; } else { askr = second - (second - first + 1) / 2; } } if (ask(askl, askr)) { first = max(askl - k, 1LL); second = min(askr + k, n); } else { if (askl != first) { first -= k; first = max(first, 1LL); second = min(askl + k, n); } else { first = max(askr - k, 1LL); second += k; second = min(second, n); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c *x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug &operator<<(const c &) { return *this; } }; long long __pow(long long x, long long y, long long M) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x) % M; y >>= 1; x = (x * x) % M; } return res % M; } long long __pow(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x); y >>= 1; x = (x * x); } return res; } long long mi(long long x, long long M) { return __pow(x, M - 2, M); } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long add(long long a, long long b, long long M) { return (a + b) % M; } long long mul(long long a, long long b, long long M) { return (a * b) % M; } long long sub(long long a, long long b, long long M) { return (a - b + M) % M; } long long div(long long a, long long b, long long M) { return (a * mi(b, M)) % M; } void umax(long long &a, long long b) { a = max(a, b); } void umin(long long &a, long long b) { a = min(a, b); } const long long N = 3e5 + 2, inf = 1e18, M = 998244353; long long Test, n, m, k, query; bool ok = 1; void test_case() { cin >> n >> k; string s; cin >> s; s = $ + s; vector<long long> last(26); vector<vector<long long>> dp(n + 1, vector<long long>(n + 1)); dp[0][0] = 1; for (long long i = 1; i <= n; i++) { dp[i][0] = 1; for (long long j = 1; j <= n; j++) { dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]; if (last[s[i] - a ]) dp[i][j] -= dp[last[s[i] - a ] - 1][j - 1]; } last[s[i] - a ] = i; } long long ans = 0; for (long long i = n; i >= 0 && k; i--) { ans += min(k, dp[n][i]) * (n - i), k -= min(k, dp[n][i]); debug() << [ << ans : << (ans) << ] [ << k : << (k) << ] ; } if (k) cout << -1 << endl; else cout << ans << endl; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); Test = 1; while (Test--) test_case(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5100; int N, M; vector<int> edge[MAXN]; int cdist[MAXN][MAXN]; int loc[3]; int target[3]; int eloc; void play(bool finish) { cout << loc[0] + 1 << << loc[1] + 1 << << loc[2] + 1 << n ; cout << flush; if (!finish) { cin >> eloc; eloc--; } } void bfs(int cloc) { vector<int> q; q.push_back(cloc); cdist[cloc][cloc] = 0; for (int nq = 0; nq < q.size(); nq++) { int ccur = q[nq]; for (int neigh : edge[ccur]) { if (cdist[cloc][neigh] > cdist[cloc][ccur] + 1) { cdist[cloc][neigh] = cdist[cloc][ccur] + 1; q.push_back(neigh); } } } } int main() { ios_base::sync_with_stdio(0); srand(time(NULL)); for (int i = 0; i < MAXN; i++) for (int j = 0; j < MAXN; j++) cdist[i][j] = MAXN; cin >> N >> M; for (int i = 0; i < M; i++) { int x, y; cin >> x >> y; x--, y--; edge[x].push_back(y); edge[y].push_back(x); } for (int i = 0; i < N; i++) { for (int j = 0; j < edge[i].size(); j++) swap(edge[i][j], edge[i][rand() % (j + 1)]); } for (int i = 0; i < N; i++) bfs(i); for (int i = 0; i < 3; i++) { while (true) { loc[i] = rand() % N; bool bad = false; for (int j = 0; j < i; j++) if (loc[j] == loc[i]) bad = true; if (!bad) break; } } play(false); for (int run = 0; run < N; run++) { if (eloc == loc[0] || eloc == loc[1] || eloc == loc[2]) break; vector<pair<int, pair<int, int> > > v; for (int i = 0; i < 3; i++) for (int j = 0; j < edge[eloc].size(); j++) { v.push_back(make_pair(cdist[i][j], make_pair(i, j))); } sort(v.begin(), v.end()); for (int i = 0; i < 3; i++) target[i] = -1; for (auto ppp : v) { int ci = ppp.second.first, cv = ppp.second.second; bool bad = false; for (int i = 0; i < 3; i++) if (target[i] == cv) bad = true; if (target[ci] == -1 && !bad) target[ci] = cv; } for (int i = 0; i < 3; i++) if (target[i] == -1) target[i] = 0; bool done = false; for (int i = 0; i < 3; i++) { if (cdist[loc[i]][eloc] == 1) { done = true; loc[i] = eloc; break; } else { vector<int> choice; int nneigh = edge[eloc][target[i]]; for (int neigh : edge[loc[i]]) if (cdist[neigh][nneigh] < cdist[loc[i]][nneigh]) { choice.push_back(neigh); } loc[i] = choice[rand() % choice.size()]; } } play(done); } } |
#include <bits/stdc++.h> using namespace std; map<string, int> m; int main() { int n; cin >> n; string x, y; for (int i = 0; i < n; i++) { cin >> x >> y; m[y]++; } int t1, t2, temp, temp1; t1 = m[ hard ]; t2 = m[ soft ]; if (t1 > t2) { temp = t1; t1 = t2; t2 = temp; } for (int i = 1; i < 100; i++) { temp = i * i; temp1 = temp / 2; temp -= temp1; if (temp1 >= t1 && temp >= t2) { cout << i << endl; return 0; } } } |
#include <bits/stdc++.h> #pragma GCC target( avx2 ) using namespace std; const int N = 1e3 + 7; const int SZ = 1e6 * 14; int val[SZ]; pair<int, int> ans; int A[N], X[N], vis[N], maxind; void solve(int need, int pos, int mask = 0, int sum = 0) { if (pos > maxind) { if (need != 0) return; if (val[sum]) ans = {val[sum], mask}; else val[sum] = mask; return; } solve(need - 1, pos + 1, (mask << 1) + 1, sum + A[pos]); solve(need, pos + 1, (mask << 1), sum); } void solve() { int n; cin >> n; maxind = min(26, n); int cnt[2] = {0, 0}; for (int i = 1; i <= n; ++i) { cin >> A[i]; cnt[A[i] & 1]++; } if (n == 2) { if (A[1] == A[2]) cout << YES n0 << A[1] << n ; else cout << NO n ; return; } if (cnt[0] >= 3 || (cnt[0] && cnt[1] >= 2)) { vector<int> V; if (cnt[0] >= 3) { for (int i = 1; i <= n; ++i) { if (A[i] & 1) continue; V.push_back(A[i]); vis[i] = 1; if (V.size() == 3) break; } } else { for (int i = 1; i <= n; ++i) { if (!(A[i] & 1)) { V.push_back(A[i]); vis[i] = 1; break; } } for (int i = 1; i <= n; ++i) { if (A[i] & 1) V.push_back(A[i]), vis[i] = 1; if (V.size() == 3) break; } } assert(V.size() == 3); X[1] = (V[0] + V[2] - V[1]) >> 1; X[2] = V[0] - X[1]; X[3] = V[2] - X[1]; int ptr = 4; for (int i = 1; i <= n; ++i) { if (vis[i]) continue; X[ptr++] = A[i] - X[1]; } cout << YES n ; for (int i = 1; i <= n; ++i) cout << X[i] << ; cout << n ; return; } for (int s = 1; s <= (n >> 1); ++s) { solve(s, 1); if (ans == pair<int, int>{0, 0}) { memset(val, 0, sizeof(val)); continue; } vector<int> V1, V2; for (int i = 1; i <= maxind; ++i) { if ((1 << (maxind - i)) & ans.first) V1.push_back(A[i]), vis[i] = 1; if ((1 << (maxind - i)) & ans.second) V2.push_back(A[i]), vis[i] = 1; } vector<int> V; for (int i = 0; i < s; ++i) { V.push_back(V1[i]); V.push_back(V2[i]); } X[1] = 0; for (int i = 2; i <= (s << 1); ++i) { X[i] = V[i - 2] - X[i - 1]; } assert(X[1] + X[s << 1] == V[(s << 1) - 1]); int ptr = s * 2 + 1; for (int i = 1; i <= n; ++i) { if (vis[i]) continue; X[ptr++] = A[i] - X[1]; } cout << YES n ; for (int i = 1; i <= n; ++i) cout << X[i] << ; cout << n ; return; } cout << NO n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { int tc, w, h, flag = 0, a, b; cin >> tc; for (int i = 1; i <= tc; i++) { cin >> w >> h; if (w > h) swap(h, w); if (i > 1) { if (b < h && b >= w) { int t = w; w = h; h = t; } else if (b < w && b < h) { flag = 1; } } a = w, b = h; } if (flag == 1) puts( NO ); else puts( YES ); } |
#include <bits/stdc++.h> using namespace std; int n, m, a[555][555], e[555][555], s, ans = -1e9; int sum(int x, int y, int xx, int yy) { return e[xx + 1][yy + 1] - e[x][yy + 1] - e[xx + 1][y] + e[x][y]; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) e[i + 1][j + 1] = e[i][j + 1] + e[i + 1][j] - e[i][j] + a[i][j]; for (int i = 1; i < n - 1; i++) for (int j = 1; j < m - 1; j++) { s = sum(i - 1, j - 1, i + 1, j + 1) - a[i][j] - a[i][j - 1]; ans = max(ans, s); for (int k = 2;; k++) { if (i - k < 0 || j - k < 0 || i + k >= n || j + k >= m) break; s = sum(i - k, j - k, i + k, j + k) - s - a[i - k + 1][j - k]; ans = max(ans, s); } } cout << (ans) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, x = 0; char ch; do { ch = getchar(); if (ch == - ) f = -1; } while (ch < 0 || ch > 9 ); do { x = (x << 3) + (x << 1) + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return f * x; } int r, x, y, px, py; int main() { scanf( %d%d%d%d%d , &r, &x, &y, &px, &py); double dis = sqrt(1.0 * (x - px) * (x - px) + 1.0 * (y - py) * (y - py)); printf( %d n , (int)(ceil(1.0 * dis / (2.0 * r)))); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int maxm = 2000005; const int inf = 0x3f3f3f3f; const int mod = 1000000000 + 7; void init() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; int n, m; vector<int> v[100005]; vector<int> vv[100005]; int sum[100005]; int to[100005]; int cnt = 0; bool cmp(int x, int y) { return x > y; } int main() { init(); cin >> n >> m; int mx = 0; int top = 0; for (int i = 1; i <= n; i++) { int id, score; cin >> id >> score; if (sum[id] == 0) to[++cnt] = id; v[id].push_back(score); sum[id]++; mx = max(mx, sum[id]); } for (int kk = 1; kk <= cnt; kk++) { int i = to[kk]; sort(v[i].begin(), v[i].end(), cmp); if (v[i].size()) vv[i].push_back(v[i][0]); for (int j = 1; j < v[i].size(); j++) { int k = vv[i][j - 1]; if (k <= 0) break; vv[i].push_back(k + v[i][j]); } } int ans = 0; for (int i = 1; i <= mx; i++) { int tmp = 0; for (int k = 1; k <= cnt; k++) { int j = to[k]; if (sum[j] < i) continue; if (i > vv[j].size()) continue; if (vv[j][i - 1] < 0) continue; tmp += vv[j][i - 1]; } ans = max(ans, tmp); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; char buffer[1048576]; int main() { scanf( %s , buffer); string dat(buffer); int n = dat.length(); int Q; scanf( %d , &Q); int lgstep = 1; while ((1 << lgstep) <= n) lgstep++; while (Q--) { int k, d; scanf( %d%d , &k, &d); vector<int> invpi(k); { int lastval = 0; int grp = 0; for (int i = 1; i < k; i++) { lastval += d; if (lastval >= k) { grp++; lastval = grp; } invpi[i] = lastval; } } vector<int> from(k); vector<vector<int>> logfrom(lgstep, vector<int>(k)); for (int i = 0; i < k; i++) { from[i] = invpi[i] + 1; logfrom[0][i] = from[i]; } for (int i = 1; i < lgstep; i++) { for (int j = 0; j < k; j++) { int p = logfrom[i - 1][j]; int p2 = (p != k) ? logfrom[i - 1][p] : (k); logfrom[i][j] = p2; } } string answer(n, 0); for (int i = 0; i < n; i++) { int base = min(i, n - k); int fpos = i - base; int tracepos = fpos; int steps = 0; { int remain = base + 1; for (int l = lgstep - 1; l >= 0; l--) { if (remain >= (1 << l)) { if (logfrom[l][tracepos] != k) { remain -= (1 << l); steps += (1 << l); tracepos = logfrom[l][tracepos]; } } } if (remain) { tracepos = logfrom[0][tracepos]; remain--; steps++; } } answer[i] = dat[base + tracepos - steps]; } dat = move(answer); puts(dat.c_str()); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<string> a; vector<string> z; string s; while (cin >> s) { a.push_back(s); } int ans = 0; sort(a.begin(), a.end()); for (int r = 0; r < 720; r++) { if (a[0].length() + a[5].length() == a[3].length() + 1 && a[1].length() + a[4].length() == a[2].length() + 1 && a[2][a[1].length() - 1] == a[3][a[0].length() - 1]) { if (a[0][0] == a[1][0] && a[5][a[5].length() - 1] == a[4][a[4].length() - 1] && a[3][0] == a[1][a[1].length() - 1] && a[2][0] == a[0][a[0].length() - 1] && a[2][a[2].length() - 1] == a[5][0] && a[3][a[3].length() - 1] == a[4][0]) { string t = ; t = t + a[0]; for (int i = 0; i < a[3].length() - a[0].length(); i++) { t = t + . ; } t = t + n ; for (int i = 1; i < a[1].length() - 1; i++) { t = t + a[1][i]; for (int j = 0; j < a[0].length() - 2; j++) { t = t + . ; } t = t + a[2][i]; for (int j = 0; j < a[3].length() - a[0].length(); j++) { t = t + . ; } t = t + n ; } t = t + a[3]; t = t + n ; for (int i = 0; i < a[2].length() - a[1].length() - 1; i++) { for (int j = 0; j < a[3].length() - a[5].length(); j++) { t = t + . ; } t = t + a[2][a[1].length() + i]; for (int j = 0; j < a[5].length() - 2; j++) { t = t + . ; } t = t + a[4][i + 1]; t = t + n ; } for (int j = 0; j < a[3].length() - a[5].length(); j++) { t = t + . ; } t = t + a[5] + n ; ans = 1; z.push_back(t); } } next_permutation(a.begin(), a.end()); } if (ans == 0) cout << Impossible << endl; else { sort(z.begin(), z.end()); cout << z[0] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, q; long long b[100000 + 1]; long long suma; long long sums; long long sum[100000 + 1]; long long sign(long long i) { return ((i & 1) ? 1 : (-1)); } inline long long poz(long long a) { return (a > 0 ? a : (-a)); } void readFile() { scanf( %lld%lld%lld , &n, &m, &q); long long i, nr; for (i = 1; i <= n; i++) { scanf( %lld , &nr); suma += nr * sign(i); } long long sumb = 0; long long cr = 1; for (i = 1; i <= m; i++) { scanf( %lld , &b[i]); if (i > n) { sumb -= (-b[i - n]); sumb = (-sumb); } if (i <= n) cr = (-cr); sumb += cr * b[i]; if (i >= n) sum[++sums] = sumb; } } long long elem(long long i) { if (i >= 1 && i <= sums) return sum[i]; return sum[1]; } void printRez() { long long i = 0; long long pas = (1 << 16); long long caut = -suma; while (pas != 0) { if (i + pas <= sums && sum[i + pas] <= caut) i += pas; pas >>= 1; } printf( %lld n , min(min(poz(suma + elem(i)), poz(suma + elem(i + 1))), poz(suma + elem(i - 1)))); } void ansQues() { sort(sum + 1, sum + sums + 1); printRez(); while (q > 0) { q--; long long st, dr, nr; scanf( %lld%lld%lld , &st, &dr, &nr); long long mns = (dr >> 1) - ((st - 1) >> 1); long long pls = (dr - st + 1) - mns; suma += 1LL * pls * nr; suma -= 1LL * mns * nr; printRez(); } } int main() { readFile(); ansQues(); return 0; } |
#include <bits/stdc++.h> int dr[] = {2, 2, -2, -2, 1, -1, 1, -1}; int dc[] = {1, -1, 1, -1, 2, 2, -2, -2}; int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1}; int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1}; int dr2[] = {0, 0, 1, -1}; int dc2[] = {1, -1, 0, 0}; using namespace std; long long a[100005]; long long bigmod(long long n, long long p) { if (p == 0) return 1; long long x = bigmod(n, p / 2); x = (x * x) % 1000000007; if (p % 2 == 1) x = (x * n) % 1000000007; return x; } int main() { long long n, i, j; while (cin >> n) { bool f = 0; for (i = 1; i <= n; i++) { cin >> a[i]; if (a[i] % 2 == 0) f = 1; } if (f == 1) { long long m = 2; for (i = 1; i <= n; i++) { m = bigmod(m, a[i]); } m = m * bigmod(2LL, 1000000007 - 2); m %= 1000000007; long long m1 = m; m1 = (m1 + 1) % 1000000007; m1 = m1 * bigmod(3LL, 1000000007 - 2); m1 %= 1000000007; cout << m1 << / << m << endl; } else { long long m = 2; for (i = 1; i <= n; i++) { m = bigmod(m, a[i]); } m = m * bigmod(2LL, 1000000007 - 2); m %= 1000000007; long long m1 = m; m1 = (m1 - 1 + 1000000007) % 1000000007; m1 = m1 * bigmod(3LL, 1000000007 - 2); m1 %= 1000000007; cout << m1 << / << m << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int kMod = 1e9 + 7; const int kNmax = 2e5 + 10; int n, v[kNmax], sub[kNmax], up[kNmax][2], down[kNmax][2], res, res_even; vector<int> g[kNmax]; void dfs(int node, int father = 0) { sub[node] = 1; down[node][0] = 1; int ways = (1LL * n * n) % kMod; for (int vec : g[node]) { if (vec == father) continue; dfs(vec, node); ways = (ways - 1LL * sub[vec] * sub[vec]) % kMod; if (ways < 0) ways += kMod; sub[node] += sub[vec]; down[node][0] += down[vec][1]; down[node][1] += down[vec][0]; } ways = (ways - 1LL * (n - sub[node]) * (n - sub[node])) % kMod; if (ways < 0) ways += kMod; res = (res + 1LL * ways * v[node]) % kMod; if (res < 0) res += kMod; } void dfs_bad(int node, int father = 0) { int s0 = 0, s1 = 0; int ways = (1LL * down[node][1] * (n - sub[node])) % kMod; ways = (ways + 1LL * up[node][1] * sub[node]) % kMod; for (int vec : g[node]) { if (vec == father) continue; ways = (ways + 1LL * down[vec][0] * (sub[node] - sub[vec])) % kMod; s0 += down[vec][0]; s1 += down[vec][1]; } res_even = (res_even + 1LL * ways * v[node]) % kMod; if (res_even < 0) res_even += kMod; for (int vec : g[node]) { if (vec == father) continue; up[vec][0] = up[node][1] + s0 - down[vec][0]; up[vec][1] = n - sub[vec] - up[vec][0]; dfs_bad(vec, node); } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for (int i = 1; i <= n; i++) cin >> v[i]; for (int i = 1, a, b; i < n; i++) { cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } dfs(1); up[1][0] = 1; dfs_bad(1); res = (res - 2LL * res_even) % kMod; if (res < 0) res += kMod; cout << res; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> bariers; int n, m, s, d, temp; scanf( %d%d%d%d , &n, &m, &s, &d); for (int i = 0; i < n; i++) { scanf( %d , &temp); bariers.push_back(temp); } sort(bariers.begin(), bariers.end()); int sing_dist, temp_dist = 0; if (bariers[0] <= s || d == 1) { printf( IMPOSSIBLE ); return 0; } for (int i = 0; i < bariers.size() - 1; i++) { sing_dist = bariers[i + 1] - bariers[i]; if (sing_dist <= s + 1) { bariers.erase(bariers.begin() + i); temp_dist += sing_dist; i--; } else { temp_dist = 0; } if (temp_dist + 1 >= d) { printf( IMPOSSIBLE ); return 0; } } int cur_pos = 0; for (int i = 0; i < bariers.size(); i++) { temp_dist = bariers[i] - d - s + 1; if (cur_pos < temp_dist) { printf( RUN %d n , temp_dist + s - cur_pos); printf( JUMP %d n , d); } else { printf( RUN %d n , s); printf( JUMP %d n , bariers[i] + 1 - cur_pos - s); } cur_pos = bariers[i] + 1; } if (cur_pos != m) { printf( RUN %d n , m - cur_pos); } return 0; } |
#include <cstdio> #include <algorithm> #include <vector> #include <set> #include <cstdlib> #include <utility> #include <cmath> #include <queue> #include <stack> #include <cstring> using namespace std; #define ll long long #ifndef ONLINE_JUDGE #define debug(format, ...) fprintf(stderr, %s:%d: format n , __func__, __LINE__,##__VA_ARGS__) #else #define debug(format, ...) #define NDEBUG #endif #define BLKSIZE 300 int n, q; int b[100005]; int blkid[100005]; int blkbegin[100005]; // for block i, minimum start value required for j increases int mincnt[400][405]; int f[100005]; int fen[300005]; #define lowbit(x) ((x)&(-(x))) int rquery(int* arr, int v) { int ans = 0; while (v) { ans += arr[v]; v -= lowbit(v); } return ans; } void modify(int* arr, int loc, int val) { //printf( %d %lld n , loc, val); while (loc <= n) { arr[loc] += val; loc += lowbit(loc); } } void updateblock(int id) { int start = max(id * BLKSIZE, 1); for (int i = start; blkid[i] == id; i++) { int x = 0; int curv = 0; for (int j = 16; j >= 0; j--) { int nx = x + (1 << j); if (nx <= n && curv + fen[nx] + nx <= b[i]) { x = nx; curv += fen[nx]; } } f[i] = x + 1; if (f[i] <= n) modify(fen, f[i], 1); } vector<int> vals; for (int i = start; blkid[i] == id; i++) { vals.push_back(f[i]); if (f[i] <= n) modify(fen, f[i], -1); } sort(vals.begin(), vals.end()); for (int i = 0; i < vals.size(); i++) { mincnt[id][i+1] = vals[i]; } for (int i = vals.size() + 1; i <= BLKSIZE; i++) { mincnt[id][i] = 10000000; } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , b + i); blkid[0] = blkid[n + 1] = -1; for (int i = 1; i <= n; i++) { blkid[i] = i / BLKSIZE; blkbegin[i] = (blkid[i-1] == blkid[i] ? blkbegin[i-1] : i); } for (int i = 0; i <= n / BLKSIZE; i++) { updateblock(i); } scanf( %d , &q); for (int qr = 1; qr <= q; qr++) { int typ; scanf( %d , &typ); if (typ == 1) { int x, y; scanf( %d%d , &x, &y); b[x] = y; updateblock(blkid[x]); } else { int x; scanf( %d , &x); int cur = b[x] + 1; int i; for (i = x + 1; blkid[i] == blkid[x]; i++) { if (cur > b[i]) cur++; } if (i <= n) { for (int j = blkid[i]; j <= n / BLKSIZE; j++) { int l = 0; int r = BLKSIZE; while (l < r) { int mid = (l + r) / 2 + 1; if (cur >= mincnt[j][mid]) { l = mid; } else { r = mid - 1; } } cur += l; } } printf( %d n , n + 1 - cur); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; double r, v; double a, b; bool check(double l) { double arfa = l / r; double A = r * (1 - cos(arfa)); double B = r * sin(arfa); return l + sqrt(A * A + B * B) >= b - a; } int main() { cin >> n >> r >> v; while (n--) { scanf( %lf%lf , &a, &b); double l = 0, r = b - a, ans; for (int i = 1; i <= 100; i++) { double mid = (l + r) / 2.0; if (check(mid)) ans = mid, r = mid; else l = mid; } printf( %.10f n , ans / v); } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; const int maxn = 3e5 + 7; int n, f[maxn][20], dep[maxn]; set<int> s1, s2; int mx = 0; long long ans = 0; int path(int o, int p) { if (dep[o] < dep[p]) swap(o, p); int dis = dep[o] - dep[p]; for (int i = 19; i >= 0; --i) { if (dep[f[o][i]] >= dep[p]) { o = f[o][i]; } } if (o == p) return dis; for (int i = 19; i >= 0; --i) { if (f[o][i] != f[p][i]) { dis += 2 * (dep[o] - dep[f[o][i]]); o = f[o][i]; p = f[p][i]; } } return dis + 2; } void solve(int v) { int u; scanf( %d , &u); f[v][0] = u; dep[v] = dep[u] + 1; for (int i = 1; i < 20; ++i) { f[v][i] = f[f[v][i - 1]][i - 1]; } int dis1 = s1.empty() ? 0 : path(v, *s1.begin()); int dis2 = s2.empty() ? 0 : path(v, *s2.begin()); if (max(dis1, dis2) < mx) return; if (max(dis1, dis2) > mx) { mx = max(dis1, dis2); if (dis1 >= dis2) { for (auto &i : s2) { if (path(i, v) == mx) { s1.insert(i); } } s2.clear(); s2.insert(v); } else { for (auto &i : s1) { if (path(i, v) == mx) { s2.insert(i); } } s1.clear(); s1.insert(v); } } else { if (dis1 >= dis2) { s2.insert(v); } else { s1.insert(v); } } ans = s1.size() + s2.size(); } int main() { scanf( %d , &n); for (int i = 0; i < 20; ++i) { f[1][i] = 1; f[2][i] = 1; } s1.insert(1); mx = 1; for (int i = 2; i <= n + 1; ++i) { solve(i); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, max = 0, max2 = 0, indexm, indexm2; cin >> n; for (int i = 0; i < n; i++) { int temp; cin >> temp; if (temp >= max) { max2 = max; indexm2 = indexm; max = temp; indexm = i + 1; } else if (temp > max2) { max2 = temp; indexm2 = i + 1; } } cout << indexm << << max2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long long ln, lk, lm; void etp(bool f = 0) { puts(f ? YES : NO ); exit(0); } void addmod(int& x, int y, int mod = 998244353) { assert(y >= 0); x += y; if (x >= mod) x -= mod; assert(x >= 0 && x < mod); } void et(int x = -1) { printf( %d n , x); exit(0); } long long fastPow(long long x, long long y, int mod = 998244353) { long long ans = 1; while (y > 0) { if (y & 1) ans = (x * ans) % mod; x = x * x % mod; y >>= 1; } return ans; } long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; } int t; long long a[205], b[205], c[205]; long long sa[205], sb[205]; long long f[205][205][2], g[205][205][2]; void fmain(int ID) { scanf( %d%d%d , &n, &t, &k); for (int(i) = 1; (i) <= (int)(n); (i)++) { scanf( %lld%lld%lld , a + i, b + i, c + i); } n++; a[n] = (1 << 30); b[n] = (1 << 30); c[n] = (1LL << 60); for (int(i) = 1; (i) <= (int)(n); (i)++) { sa[i] = sa[i - 1] + a[i]; sb[i] = sb[i - 1] + b[i]; } for (int(i) = 0; (i) < (int)(205); (i)++) for (int(j) = 0; (j) < (int)(205); (j)++) for (int(z) = 0; (z) < (int)(2); (z)++) { f[i][j][z] = g[i][j][z] = (1LL << 60); } for (int(j) = 0; (j) < (int)(205); (j)++) for (int(z) = 0; (z) < (int)(2); (z)++) f[0][j][z] = g[0][j][z] = 0; for (int(i) = 1; (i) <= (int)(n); (i)++) { for (int j = 0; j <= t; j++) for (int(z) = 0; (z) < (int)(2); (z)++) { if (a[i] * z + b[i] * j <= c[i] && f[i - 1][j][z] < (1LL << 60)) { mintt(f[i][j][z], f[i - 1][j][z]); long long cnt = (sa[i - 1] * z + sb[i - 1] * j + k - 1) / k; if (cnt * k <= sa[i] * z + sb[i] * j) mintt(g[i][j][z], cnt); } for (int r = 0; r < j; r++) { long long cnt = g[i][r][z]; if (cnt == (1LL << 60)) continue; long long rem = sa[i] * z + sb[i] * r - cnt * k; assert(0 <= rem); long long need = (max(0LL, rem + b[i] * (j - r) - c[i]) + k - 1) / k; if (need * k <= rem && f[i - 1][j - r][0] < (1LL << 60)) { mintt(f[i][j][z], cnt + need + f[i - 1][j - r][0]); long long n2 = (sb[i - 1] * (j - r) + k - 1) / k; if (n2 * k <= sb[i] * (j - r) + rem - need * k) { mintt(g[i][j][z], cnt + need + n2); } } } } } printf( %lld n , f[n][t][1]); } int main() { int t = 1; for (int(i) = 1; (i) <= (int)(t); (i)++) { fmain(i); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k, l, m, n, d; int cont = 0; cin >> k >> l >> m >> n >> d; cont = d; if (k == 1 || l == 1 || m == 1 || n == 1) { cout << d << endl; } else { for (int i = 1; i <= d; i++) { if ((i % k != 0) && (i % l != 0) && (i % m != 0) && (i % n != 0)) cont--; } cout << cont << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans = 0; int main(int argc, char const *argv[]) { int t; cin >> t; while (t--) { int a, b, ans = 0; cin >> a >> b; if (a == b) cout << (a * 2) / 3 << endl; else { if (a > b) swap(a, b); if (b >= 2 * a) cout << a << endl; else { ans = b - a; a = 2 * a - b; ans += (a * 2) / 3; cout << ans << endl; } } } } |
#include <bits/stdc++.h> using namespace std; int getint() { int x = 0; char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) x *= 10, x += (c - 0 ), c = getchar(); return x; } vector<pair<int, int> > ans; int n, m, tag; int a[40][40], b[40][40], cnt[910]; void init() { n = getint(); m = getint(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { a[i][j] = getint(); cnt[a[i][j]]++; if (cnt[a[i][j]] == 1) tag++; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { b[i][j] = getint(); cnt[b[i][j]]--; if (cnt[b[i][j]] == 0) tag--; if (cnt[b[i][j]] < 0) tag = 10000; } } void solve2() { if (n == 1) { for (int i = 1; i <= m; i++) if (a[1][i] != b[1][i]) { for (int j = i + 1; j <= m; j++) { if (a[1][j] != b[1][i]) continue; bool tflag = true; for (int k = i; k < j; k++) if (a[1][k] != b[1][k + 1]) { tflag = false; break; } for (int k = j + 1; k <= m; k++) if (a[1][k] != b[1][k]) { tflag = false; break; } if (tflag) { printf( %d n , j - i); for (int k = j; k >= i; k--) printf( 1 %d n , k); return; } } break; } for (int i = m; i >= 1; i--) if (a[1][i] != b[1][i]) { for (int j = i - 1; j >= 1; j--) { if (a[1][j] != b[1][i]) continue; bool tflag = true; for (int k = i; k > j; k--) if (a[1][k] != b[1][k - 1]) { tflag = false; break; } for (int k = j - 1; k >= 1; k--) if (a[1][k] != b[1][k]) { tflag = false; break; } if (tflag) { printf( %d n , i - j); for (int k = j; k <= i; k++) printf( 1 %d n , k); return; } } break; } puts( -1 ); return; } else { for (int i = 1; i <= n; i++) if (a[i][1] != b[i][1]) { for (int j = i + 1; j <= n; j++) { if (a[j][1] != b[i][1]) continue; bool tflag = true; for (int k = i; k < j; k++) if (a[k][1] != b[k + 1][1]) { tflag = false; break; } for (int k = j + 1; k <= n; k++) if (a[k][1] != b[k][1]) { tflag = false; break; } if (tflag) { printf( %d n , j - i); for (int k = j; k >= i; k--) printf( %d 1 n , k); return; } } } for (int i = n; i >= 1; i--) if (a[i][1] != b[i][1]) { for (int j = i - 1; j >= 1; j--) { if (a[j][1] != b[i][1]) continue; bool tflag = true; for (int k = i; k > j; k--) if (a[k][1] != b[k - 1][1]) { tflag = false; break; } for (int k = j - 1; k >= 1; k--) if (a[k][1] != b[k][1]) { tflag = false; break; } if (tflag) { printf( %d n , i - j); for (int k = j; k <= i; k++) printf( %d 1 n , k); return; } } break; } puts( -1 ); return; } } int sn, sm; void move(int ttn, int ttm) { while (sn != ttn && sm != ttm) { if (sn > ttn && sm > ttm) { int tswap = a[sn][sm]; a[sn][sm] = a[sn - 1][sm - 1]; a[sn - 1][sm - 1] = tswap; sn--; sm--; } else if (sn > ttn && sm < ttm) { int tswap = a[sn][sm]; a[sn][sm] = a[sn - 1][sm + 1]; a[sn - 1][sm + 1] = tswap; sn--; sm++; } else if (sn < ttn && sm > ttm) { int tswap = a[sn][sm]; a[sn][sm] = a[sn + 1][sm - 1]; a[sn + 1][sm - 1] = tswap; sn++; sm--; } else { int tswap = a[sn][sm]; a[sn][sm] = a[sn + 1][sm + 1]; a[sn + 1][sm + 1] = tswap; sn++; sm++; } ans.push_back(make_pair(sn, sm)); } while (sn != ttn) { if (sn < ttn) { int tswap = a[sn][sm]; a[sn][sm] = a[sn + 1][sm]; a[sn + 1][sm] = tswap; sn++; } else { int tswap = a[sn][sm]; a[sn][sm] = a[sn - 1][sm]; a[sn - 1][sm] = tswap; sn--; } ans.push_back(make_pair(sn, sm)); } while (sm != ttm) { if (sm < ttm) { int tswap = a[sn][sm]; a[sn][sm] = a[sn][sm + 1]; a[sn][sm + 1] = tswap; sm++; } else { int tswap = a[sn][sm]; a[sn][sm] = a[sn][sm - 1]; a[sn][sm - 1] = tswap; sm--; } ans.push_back(make_pair(sn, sm)); } } void turn(int rn) { for (int i = m; i >= 1; i--) { move(1, 1); if (a[rn][i] == b[rn][i]) continue; int xn = 0, xm; for (int j = rn; j >= 1; j--) { for (int k = (j == rn ? i - 1 : m); k >= 1; k--) if (a[j][k] == b[rn][i]) { xn = j; xm = k; break; } if (xn) break; } if (xm > i && xn < rn) { while (xm > i && xn < rn && xm - i > rn - xn) { if (xn == 1) { move(xn, xm - 1); move(xn + 1, xm - 1); move(xn, xm); xn++; xm--; } else { move(xn - 1, xm); move(xn, xm - 1); move(xn, xm); xm--; } } } while (xn != rn && xm != i) { if (xm < i) { if (xn == 1) { move(xn, xm - 1); move(xn + 1, xm); move(xn + 1, xm + 1); move(xn, xm); xn++; xm++; } else { move(xn - 1, xm + 1); move(xn + 1, xm + 1); move(xn, xm); xn++; xm++; } } else { if (xn == 1) { move(xn, xm - 1); move(xn + 1, xm - 1); move(xn, xm); xn++; xm--; } else { move(xn - 1, xm - 1); move(xn + 1, xm - 1); move(xn, xm); xn++; xm--; } } } while (xn != rn) { if (xn == 1) { move(xn, xm - 1); move(xn + 1, xm); move(xn, xm); xn++; } else { move(xn - 1, xm); if (xm == 1) move(xn, xm + 1); else move(xn, xm - 1); move(xn + 1, xm); move(xn, xm); xn++; } } while (xm != i) { assert(xn - 1 >= 1 && xm + 1 <= m); move(xn - 1, xm); move(xn, xm + 1); move(xn, xm); xm++; } } } void turn2() { for (int j = m; j >= 1; j--) for (int i = 2; i >= 1; i--) { move(1, 1); if (a[i][j] == b[i][j]) continue; int xn = 0, xm; for (int k = j; k >= 1; k--) { for (int l = (k == j ? i - 1 : 2); l >= 1; l--) { if (a[l][k] == b[i][j]) { xn = l; xm = k; break; } } if (xn) break; } while (xn != i && xm != j) { if (xn < i) { move(xn + 1, xm - 1); move(xn + 1, xm + 1); move(xn, xm); xn++; xm++; } else { move(xn - 1, xm + 1); move(xn, xm); xn--; xm++; } } while (xn != i) { if (xn < i) { move(xn, xm - 1); move(xn + 1, xm); move(xn, xm); xn++; } else { move(xn - 1, xm); move(xn, xm); xn--; } } while (xm != j) { if (xn != 1) { move(xn - 1, xm); move(xn, xm + 1); move(xn, xm); xm++; } else { move(xn, xm - 1); move(xn + 1, xm); move(xn, xm + 1); move(xn, xm); xm++; } } } } void solve3() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) if (a[i][j] == b[1][1]) { sn = i; sm = j; break; } if (sn) break; } int an = sn, am = sm; move(1, 1); for (int i = n; i > 2; i--) turn(i); turn2(); printf( %d n , (int)ans.size()); printf( %d %d n , an, am); for (int i = 0; i < (int)ans.size(); i++) printf( %d %d n , ans[i].first, ans[i].second); } void solve() { if (tag != 0) { puts( -1 ); return; } if (n == 1 || m == 1) solve2(); else solve3(); } int main() { init(); solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long n; cin >> n; long long ans = 0; while (n % 2 == 0) { n /= 2; ans++; } while (n % 3 == 0) { n /= 3; ans += 2; } while (n % 5 == 0) { n /= 5; ans += 3; } while (n % 2 == 0) { n /= 2; ans++; } if (n == 1) cout << ans << endl; else cout << -1 << endl; } } |
/** * created: 06/03/2021, 16:16:13 **/ #include <bits/stdc++.h> using namespace std; const int max_n = 100111, inf = 1000111222; const int max_c = 26; int t, n, k, cnt[max_c], need[max_c]; char s[max_n]; bool check(int mx) { int tot = 0; for (int i = 0; i < max_c; ++i) { need[i] = 0; if (cnt[i] % k) { need[i] = k - (cnt[i] % k); } tot += need[i]; } return tot <= mx; } void solve() { for (int i = n - 1; i >= 0; --i) { --cnt[s[i] - a ]; for (int c = s[i] + 1; c <= z ; ++c) { ++cnt[c - a ]; bool res = check(n - i - 1); --cnt[c - a ]; if (res) { for (int j = 0; j < i; ++j) { printf( %c , s[j]); } printf( %c , c); int tot = accumulate(need, need + max_c, 0), all = n - i - 1; for (int j = tot; j < all; ++j) { printf( a ); } for (int c2 = 0; c2 < max_c; ++c2) { for (int j = 0; j < need[c2]; ++j) { printf( %c , c2 + a ); } } puts( ); return; } } } } int main() { //freopen( input.txt , r , stdin); //freopen( output.txt , w , stdout); scanf( %d , &t); while (t--) { scanf( %d%d%s , &n, &k, s); if (n % k) { puts( -1 ); continue; } memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < n; ++i) { ++cnt[s[i] - a ]; } bool ok = 1; for (int i = 0; i < max_c; ++i) { if (cnt[i] % k) { ok = 0; break; } } if (ok) { puts(s); continue; } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { double x, y; }; point operator+(point a, point b) { return (point){a.x + b.x, a.y + b.y}; } point operator*(point a, double b) { return (point){a.x * b, a.y * b}; } double len(point x) { return sqrt(x.x * x.x + x.y * x.y); } void print(point x) { printf( %.10lf %.10lf n , x.x, x.y); } int main() { ios::sync_with_stdio(false); point p, v; cin >> p.x >> p.y >> v.x >> v.y; double a, b, c, d; cin >> a >> b >> c >> d; print(p + v * (b / len(v))); point u = v * (-1); point l = (point){-v.y, v.x}; point r = l * (-1); point tmp = p; print(tmp = tmp + l * (a / 2 / len(l))); print(tmp = tmp + r * ((a - c) / 2 / len(r))); print(tmp = tmp + u * (d / len(u))); print(tmp = tmp + r * (c / len(r))); print(tmp = tmp + v * (d / len(v))); print(tmp = tmp + r * ((a - c) / 2 / len(r))); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, k; cin >> n >> k; if (k == 1) { long long int ans = n * (n - 1) / 2; cout << ans << << ans << endl; } else { long long int ans = (n - k + 1) * (n - k) / 2; long long int x = n / k; long long int y = n % k; long long int ans2 = x * (x - 1) / 2; long long int ans3 = (x + 1) * x / 2; cout << ans3 * y + ans2 * (k - y) << << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Mod = (int)1e9 + 7; const int MX = 1073741822; const long long MXLL = 4e18; const int Sz = 1110111; inline void Read_rap() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); } inline void randomizer3000() { unsigned int seed; asm( rdtsc : =A (seed)); srand(seed); } void files(string problem) { if (fopen((problem + .in ).c_str(), r )) { freopen((problem + .in ).c_str(), r , stdin); freopen((problem + .out ).c_str(), w , stdout); } } int n; long long d[Sz], m[Sz], r[Sz], p[Sz]; bool used[Sz]; struct fenwick { int n; vector<vector<pair<int, int> > > t; fenwick(int n) : n(n), t(n + 1) {} void add(int x, int y, int id) { for (int i = x; i <= n; i |= (i + 1)) t[i].push_back(make_pair(y, id)); } void preSort() { for (int i = 0; i <= n; i++) sort(t[i].begin(), t[i].end(), [](pair<int, int> a, pair<int, int> b) { return a > b; }); } void expand(int x, int y, queue<int> &q) { for (int i = x; i >= 0; i = (i & (i + 1)) - 1) { while ((int)(t[i].size()) && t[i].back().first <= y) { int id = t[i].back().second; if (!used[id]) { used[id] = 1; q.push(id); } t[i].pop_back(); } } } }; int Bfs(int st) { fenwick T(2 * (n + 1)); for (int i = 1; i <= n; i++) T.add(m[i], d[i], i); T.preSort(); queue<int> q; q.push(st); int cnt = 0; while (!q.empty()) { int i = q.front(); q.pop(); int p = ::p[i]; int r = ::r[i]; T.expand(p, r, q); cnt++; } return cnt - 1; } void compress(long long a[], long long b[]) { static vector<long long> c; c.clear(); for (int i = 0; i <= n; i++) { c.push_back(a[i]); c.push_back(b[i]); } sort(c.begin(), c.end()); for (int i = 0; i <= n; i++) a[i] = lower_bound(c.begin(), c.end(), a[i]) - c.begin(); for (int i = 0; i <= n; i++) b[i] = lower_bound(c.begin(), c.end(), b[i]) - c.begin(); } long long dist(int x, int y) { return x * 1ll * x + y * 1ll * y; } int main() { int sx, sy; scanf( %d %d %d %d %d , &sx, &sy, p + 0, r + 0, &n); for (int i = 1; i <= n; i++) { int x, y; scanf( %d %d %d %d %d , &x, &y, m + i, p + i, r + i); d[i] = dist(x - sx, y - sy); } for (int i = 0; i <= n; i++) r[i] *= r[i]; compress(r, d); compress(p, m); cout << Bfs(0); return 0; } |
#include <bits/stdc++.h> const int N = 41; long long bin_p(long long a, long long b) { if (!b) return 1; if (b % 2 == 0) { long long cur = bin_p(a, b / 2); return cur * cur; } return a * bin_p(a, b - 1); } long long color[N]; std::vector<long long> g[N]; long long g1[N], cmpSz = 0; bool fl = false; void dfs(int v, int clr = 1) { color[v] = clr; for (auto e : g[v]) { if (color[e] == 0) { color[e] = (3 - clr); dfs(e, 3 - clr); } if (color[e] == clr) { fl = true; } } } const long long LEFT = 22; const long long MASK_LEFT = (1LL << LEFT) - 1, MASK_RIGHT = ((1LL << 40) - 1) ^ MASK_LEFT; long long dp1[1LL << 21], dp2[1LL << 21]; int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n, m; std::cin >> n >> m; for (int i = 0; i < m; ++i) { int a, b; std::cin >> a >> b; --a; --b; g[a].push_back(b); g[b].push_back(a); g1[a] |= (1LL << b); g1[b] |= (1LL << a); } long long isolated = 0; for (int i = 0; i < n; ++i) { if (!color[i]) { dfs(i); cmpSz++; } if (g[i].size() == 0) isolated++; } long long answ = (1LL << n); if (m == 0) { answ -= (1LL << n); } if (!fl) { answ += (1LL << cmpSz); } answ += 2LL * (1LL << isolated); answ -= (1LL << cmpSz); for (long long mask = 0; mask < (1 << std::max(0LL, (n - LEFT))); ++mask) { long long realMask = (mask << LEFT), adMask = 0; for (long long j = 0; j < n; ++j) { if ((realMask >> j) & 1) { adMask |= g1[j]; } } if ((adMask & realMask) == 0) { dp2[mask]++; } } for (long long j = 0; j < std::max(0LL, n - LEFT); ++j) { for (long long msk = 0; msk < (1LL << std::max(0LL, (n - LEFT))); ++msk) { if (((msk >> j) & 1)) { dp2[msk] += dp2[msk ^ (1LL << j)]; } } } for (long long mask = 0; mask < (1 << std::min((long long)n, LEFT)); ++mask) { long long adMask = 0; for (long long j = 0; j < n; ++j) { if ((mask >> j) & 1) { adMask |= g1[j]; } } if ((adMask & mask) == 0) { answ -= 2 * dp2[(adMask ^ ((1LL << n) - 1)) >> LEFT]; } } std::cout << answ; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; int ans = -1, ansd, a[MAXN], b[MAXN], n, m; inline int Pow(int x, int y, int mod) { int s = 1; for (; y; y >>= 1, x = 1ll * x * x % mod) if (y & 1) s = 1ll * s * x % mod; return s; } inline bool find(int *a, int n, int x) { int t = lower_bound(a + 1, a + n + 1, x) - a; return a[t] == x; } inline void solve(int *a, int n) { if (n == 1) { ans = a[1], ansd = 1; return; } int tmp = a[2] - a[1], cnt = 0; for (int i = 1; i <= n; i++) if (find(a, n, (a[i] + tmp) % m)) cnt++; ansd = 1ll * tmp * Pow(n - cnt, m - 2, m) % m; int d = (m - ansd) % m; for (int i = 1; i <= n; i++) if (!find(a, n, (a[i] + d) % m)) { if (ans == -1) ans = a[i]; else { ans = -1; return; } } } int main() { scanf( %d%d , &m, &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); if (n == 1 || n == m) return printf( %d 1 n , a[1], 1), 0; if (2 * n - 4 < m) solve(a, n); else { int t = 0; for (int i = 0; i < m; i++) if (!find(a, n, i)) b[++t] = i; solve(b, t); if (ans != -1) (ans += 1ll * ansd * t % m) %= m; } if (ans == -1) return printf( -1 n ), 0; return printf( %d %d n , ans, ansd), 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, i; while (scanf( %lld %lld , &n, &k) != EOF) { vector<long long int> v; for (i = 1; i * i <= n; i++) { if (n % i == 0) { v.push_back(i); if ((n / i) != i) v.push_back(n / i); } } sort(v.begin(), v.end()); if (v.size() < k) { cout << -1 << endl; } else { printf( %lld n , v[k - 1]); } } return 0; } |
#include <bits/stdc++.h> char S[1000000 + 5], T[1000000 + 5]; int c[1000000 + 5][26], l[1000000 + 5], f[1000000 + 5], tn, df[1000000 + 5], ff[1000000 + 5], s[1000000 + 5], F[1000000 + 5]; int main() { int n, i, j, x; scanf( %s , S + 1); n = strlen(S + 1); T[0] = 255; for (i = 1; i <= n / 2; ++i) T[2 * i - 1] = S[i] - a , T[2 * i] = S[n - i + 1] - a ; f[0] = 1; l[++tn] = -1; for (F[0] = i = x = 1; i <= n; ++i) { while (T[i] != T[i - l[x] - 1]) x = f[x]; if (!c[x][T[i]]) { for (j = f[x]; T[i - l[j] - 1] != T[i]; j = f[j]) ; f[++tn] = c[j][T[i]]; l[c[x][T[i]] = tn] = l[x] + 2; df[tn] = l[tn] - l[f[tn]]; ff[tn] = df[tn] == df[f[tn]] ? ff[f[tn]] : tn; } x = c[x][T[i]]; for (j = x; j; j = f[ff[j]]) { s[j] = F[i - l[ff[j]]]; if (ff[j] != j) s[j] = (s[j] + s[f[j]]) % 1000000007; if (~i & 1) F[i] = (F[i] + s[j]) % 1000000007; } } printf( %d , F[n]); } |
#include <bits/stdc++.h> using namespace std; void solve() { int i, j, n, ct = 0; cin >> n; int a[n]; for (i = 0; i < n; i++) cin >> a[i]; if (n < 2) { cout << -1 n ; return; } sort(a, a + n); set<int> ans; if (n == 2) { ans.insert(a[1] + a[1] - a[0]); ans.insert(a[0] - (a[1] - a[0])); if ((a[1] - a[0]) % 2 == 0) ans.insert((a[0] + a[1]) / 2); } else { set<int> dif; for (i = 1; i < n; i++) dif.insert(a[i] - a[i - 1]); if (dif.size() == 1) { int d = *dif.begin(); ans.insert(a[0] - d); ans.insert(a[n - 1] + d); } else if (dif.size() == 2) { int d1 = *dif.begin(); int d2 = *dif.upper_bound(d1); if (2 * d1 == d2) { for (i = 0; i + 1 < n; i++) { if (a[i] + d1 == a[i + 1]) continue; ct++; ans.insert(a[i] + d1); } } } } if (ct > 1) ans.clear(); cout << ans.size() << n ; for (auto &x : ans) cout << x << ; } int main() { ios_base::sync_with_stdio(false); int test = 1; while (test--) solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, l, m, n; cin >> n; string s[n], t; for (i = 0; i < n; i++) { cin >> s[i]; } map<string, vector<long long int>> mp; set<string> ss; for (i = 1; i <= 9; i++) { for (j = 0; j < n; j++) { for (k = 0; k + i - 1 < 9; k++) { t = s[j].substr(k, i); ss.insert(t); } while (ss.empty() != true) { mp[*(ss.begin())].push_back(j); ss.erase(ss.begin()); } } } map<string, vector<long long int>>::iterator it; string fir; map<long long int, long long int> mpp; string ans[n]; for (it = mp.begin(); it != mp.end(); it++) { fir = it->first; if (mp[fir].size() == 1 && mpp[mp[fir][0]] == 0) { mpp[mp[fir][0]] = 1; ans[mp[fir][0]] = fir; } else if (mp[fir].size() == 1 && mpp[mp[fir][0]] == 1) { if (fir.length() < ans[mp[fir][0]].length()) { ans[mp[fir][0]] = fir; } } } for (i = 0; i < n; i++) { cout << ans[i] << endl; ; } } |
#include <bits/stdc++.h> using namespace std; string ToStr(char k) { stringstream ss; ss << k; return ss.str(); } bool check(string str) { int n = (int)str.length(); for (int i = 0; i < n / 2; i++) { if (str[i] != str[n - i - 1]) return false; } return true; } int main() { string s; cin >> s; for (int i = 0; i <= (int)s.length(); i++) { for (int j = 0; j < 26; j++) { string tmp = s; tmp.insert(i, ToStr( a + j)); if (check(tmp)) { cout << tmp << endl; return 0; } } } cout << NA << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 1000 * 101; const long long INF = 1e18; long long n, a[maxn]; vector<pair<char, long long> > ans1; vector<pair<long long, long long> > ans; queue<long long> bra; int main() { std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; a[0] = 0; a[n + 1] = 0; for (int i = 1; i <= n + 1; i++) { if (a[i] > a[i - 1]) { long long dis = a[i] - a[i - 1]; for (int j = 0; j < dis; j++) ans1.push_back({ ( , i}); } else if (a[i] < a[i - 1]) { long long dis = a[i - 1] - a[i]; for (int j = 0; j < dis; j++) ans1.push_back({ ) , i - 1}); } } for (int i = 0; i < ans1.size(); i++) { if (ans1[i].first == ( ) { bra.push(ans1[i].second); } else { long long x2 = bra.front(); ans.push_back({x2, ans1[i].second}); bra.pop(); } } cout << ans.size() << n ; for (int i = 0; i < ans.size(); i++) { cout << ans[i].first << << ans[i].second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353, kMaxP = 3000007, kMaxN = 200007, root = 15311432, root_1 = 469870224, root_pw = 1 << 23; long long binpow(long long a, long long b) { a %= mod; long long res = 1; while (b > 0) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } int inverse(int a) { return binpow(a, mod - 2); } int counts[kMaxP]; vector<vector<int>> polynomials_of_degree[kMaxN]; void fft(vector<int>& a, bool invert) { int n = a.size(); for (int i = 1, j = 0; i < n; i++) { int bit = n >> 1; for (; j & bit; bit >>= 1) j ^= bit; j ^= bit; if (i < j) swap(a[i], a[j]); } for (int len = 2; len <= n; len <<= 1) { int wlen = invert ? root_1 : root; for (int i = len; i < root_pw; i <<= 1) wlen = (int)(1LL * wlen * wlen % mod); for (int i = 0; i < n; i += len) { int w = 1; for (int j = 0; j < len / 2; j++) { int u = a[i + j], v = (int)(1LL * a[i + j + len / 2] * w % mod); a[i + j] = u + v < mod ? u + v : u + v - mod; a[i + j + len / 2] = u - v >= 0 ? u - v : u - v + mod; w = (int)(1LL * w * wlen % mod); } } } if (invert) { int n_1 = inverse(n); for (int& x : a) x = (int)(1LL * x * n_1 % mod); } } vector<int> multiply(vector<int> const& a, vector<int> const& b) { vector<int> fa(a.begin(), a.end()), fb(b.begin(), b.end()); ; int n = 1; while (n < (static_cast<int>((a).size())) + (static_cast<int>((b).size()))) n <<= 1; fa.resize(n); fb.resize(n); fft(fa, false); fft(fb, false); for (int i = 0; i < n; i++) fa[i] = int64_t{1} * fa[i] * fb[i] % mod; fft(fa, true); fa.resize((static_cast<int>((a).size())) + (static_cast<int>((b).size())) - 1); ; return fa; } int solve() { int n; cin >> n; for (int i = n; i--;) { int p; cin >> p; counts[p]++; } for (int i = 2; i < kMaxP; i++) { if (counts[i] > 0) { vector<int> all_ones(counts[i] + 1, 1); polynomials_of_degree[counts[i]].emplace_back(all_ones); ; } } for (int i = 1; true; i++) { while (!polynomials_of_degree[i].empty()) { vector<int> a = polynomials_of_degree[i].back(); polynomials_of_degree[i].pop_back(); vector<int> b; for (int j = i; j < n; j++) if (!polynomials_of_degree[j].empty()) { b = polynomials_of_degree[j].back(); polynomials_of_degree[j].pop_back(); break; } if (b.empty()) return a[(n >> 1)]; polynomials_of_degree[(static_cast<int>((a).size())) - 1 + (static_cast<int>((b).size())) - 1] .emplace_back(multiply(a, b)); ; } } } int main() { ios_base::sync_with_stdio(0), cin.tie(0); int test_cases_num = 1; for (int i = 1; i <= test_cases_num; i++) { if (false) if (test_cases_num > 1) if (false) cerr << Test # << i << : n ; cout << solve() << n ; if (false) if (test_cases_num > 1) if (false) cerr << End of test # << i << . n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool gone[1000000]; int n; int ord[1000000], put[1000000]; int main() { scanf( %i , &n); for (int(a) = 0; (a) < (n); (a)++) scanf( %i , ord + a); for (int(a) = 0; (a) < (n); (a)++) scanf( %i , put + a); int i = 0; for (int(a) = 0; (a) < (n); (a)++) { int res = 0; if (gone[put[a]] || i >= n) { printf( %i , res); continue; } while (ord[i] != put[a]) { gone[ord[i]] = true; i++; res++; } gone[ord[i]] = true; i++; res++; printf( %i , res); } printf( n ); return 0; } |
#include <bits/stdc++.h> enum { MAXN = 102 }; int reverse[MAXN], target[MAXN], init[MAXN]; int n; int eq(int *a, int *b) { int i; for (i = 1; i <= n; i++) if (a[i] != b[i]) return 0; return 1; } void proc(int *a, int *b) { int ans[MAXN], i; for (i = 1; i <= n; i++) { ans[i] = a[b[i]]; } for (i = 1; i <= n; i++) a[i] = ans[i]; } void print(int *a) { int i; for (i = 1; i <= n; i++) printf( %d , a[i]); puts( ); } int main(void) { int k, m1, m2, i; scanf( %d %d , &n, &k); for (i = 1; i <= n; i++) { scanf( %d , init + i); reverse[init[i]] = i; } for (i = 1; i <= n; i++) scanf( %d , target + i); int natur[MAXN]; for (i = 1; i <= n; i++) natur[i] = i; m1 = 0; m2 = 0; while (m1 < 1000 && !eq(natur, target)) { proc(natur, init); m1++; } if (!eq(natur, target)) m1 = -1; for (i = 1; i <= n; i++) natur[i] = i; while (m2 < 1000 && !eq(natur, target)) { proc(natur, reverse); m2++; } if (!eq(natur, target)) m2 = -1; char *ans = NO ; if (m1 == 1 && m2 == 1) { if (k == 1) ans = YES ; } else if (m1 == 1 || m2 == 1) { if (k % 2 == 1) ans = YES ; } if (m1 > 1 && (k - m1) >= 0 && (k - m1) % 2 == 0) ans = YES ; if (m2 > 1 && (k - m2) >= 0 && (k - m2) % 2 == 0) ans = YES ; puts(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int R[N], czy[N], dp[N], siz[N]; pair<int, int> E[N], E2[N]; int M; pair<int, int> Find(int x) { if (x == R[x]) return {x, 0}; pair<int, int> a = Find(R[x]); a.second ^= czy[x]; return a; } void Union(int a, int b) { if (a == b) return; if (siz[a] > siz[b]) swap(a, b); siz[b] += siz[a]; R[a] = b; czy[a] ^= 1 ^ czy[b]; czy[b] = 0; } void sep(int a, int b) { if (a == b) return; czy[a] = 0; czy[b] = 0; if (siz[a] > siz[b]) swap(a, b); siz[b] -= siz[a]; R[a] = a; } void solve(int l, int r, int a, int b) { if (l > r) return; int m = (l + r) >> 1; dp[m] = N; for (int i = l; i < m; i++) { pair<int, int> A = Find(E[i].first), B = Find(E[i].second); E2[i] = {A.first, B.first}; if (A.first == B.first && (A.second ^ B.second ^ 1)) { dp[m] = i; break; } if (A.first != B.first) { czy[A.first] = A.second; czy[B.first] = B.second; } Union(A.first, B.first); } if (dp[m] < m) { for (int i = dp[m] - 1; i >= l; i--) sep(E2[i].first, E2[i].second); solve(l, dp[m], a, b); for (int i = dp[m] + 1; i <= r; i++) dp[i] = b; return; } for (int i = b; i >= a; i--) { if (i < m) { dp[m] = m - 1; break; } pair<int, int> A = Find(E[i].first), B = Find(E[i].second); E2[i] = {A.first, B.first}; if (A.first == B.first && (A.second ^ B.second ^ 1)) { dp[m] = i; break; } if (A.first != B.first) { czy[A.first] = A.second; czy[B.first] = B.second; } Union(A.first, B.first); } for (int i = dp[m] + 1; i <= b; i++) sep(E2[i].first, E2[i].second); pair<int, int> A = Find(E[m].first), B = Find(E[m].second); if (A.first == B.first && (A.second ^ B.second ^ 1)) { for (int i = m + 1; i <= r; i++) dp[i] = b; } else { if (A.first != B.first) { czy[A.first] = A.second; czy[B.first] = B.second; } Union(A.first, B.first); solve(m + 1, r, dp[m], b); sep(A.first, B.first); } for (int i = m - 1; i >= l; i--) { sep(E2[i].first, E2[i].second); } for (int i = b; i > dp[m]; i--) { A = Find(E[i].first), B = Find(E[i].second); E2[i] = {A.first, B.first}; if (A.first != B.first) { czy[A.first] = A.second; czy[B.first] = B.second; } Union(A.first, B.first); } solve(l, m - 1, a, dp[m]); for (int i = dp[m] + 1; i <= b; i++) sep(E2[i].first, E2[i].second); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, q; cin >> n >> m >> q; M = m; for (int i = 1; i <= n + 2; i++) { R[i] = i; siz[i] = 1; } for (int i = 1; i <= m; i++) { cin >> E[i].first >> E[i].second; } E[m + 1] = {n + 1, n + 2}; solve(1, m, 0, m + 1); while (q--) { int l, r; cin >> l >> r; if (r >= dp[l]) cout << NO n ; else cout << YES n ; } } |
#include <bits/stdc++.h> using namespace std; int n, m; long long pw[19]; long long val[19]; char A[100009]; string s[100009]; int main() { scanf( %s , A); scanf( %d , &m); for (int i = 0; i < 10; i++) { val[i] = i; pw[i] = 10; } for (int i = 0; i < m; i++) cin >> s[i]; for (int j = m - 1; j >= 0; j--) { int ln = s[j].length(); int nm = s[j][0] - 0 ; long long nmpw = 1; long long san = 0; for (int i = ln - 1; i > 2; i--) { san = (san + (nmpw * val[s[j][i] - 0 ])) % 1000000007; nmpw = (nmpw * pw[s[j][i] - 0 ]) % 1000000007; } val[nm] = san; pw[nm] = nmpw; } int ln = strlen(A); long long ans = 0; long long nmpw = 1; for (int i = ln - 1; i >= 0; i--) { ans = (ans + (val[A[i] - 0 ] * nmpw)) % 1000000007; nmpw = (nmpw * pw[A[i] - 0 ]) % 1000000007; } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } const int INF = (((1 << 30) - 1) << 1) + 1; const int nINF = 1 << 31; string s; vector<int> v[2], ans; int n, t; void print(vector<int>& vec) { for (int x : vec) cout << x << ; cout << endl; } signed main() { ios::sync_with_stdio(false); cin >> t; while (t--) { v[0].clear(), v[1].clear(), ans.clear(); cin >> n >> s; bool good = true, two = false; int lo = 10; for (int i = 0; i < (n); i++) { if (two) { if (s[i] == lo && s[v[1].back()] == lo) { v[1].push_back(i); } else if (s[i] <= lo) { if (!v[0].empty() && s[i] < s[v[0].back()]) { good = false; break; } else { v[0].push_back(i); } } else { if (!v[1].empty() && s[i] < s[v[1].back()]) { good = false; break; } else { v[1].push_back(i); } } } else { if (!v[0].empty() && s[i] < s[v[0].back()]) { two = true; vector<int> temp; while (!v[0].empty() && s[i] < s[v[0].back()]) { temp.push_back(v[0].back()); v[0].pop_back(); } lo = s[temp.back()]; while (!temp.empty()) { v[1].push_back(temp.back()); temp.pop_back(); } } v[0].push_back(i); } } ans.resize(n, 1); for (int i = 0; i < (v[1].size()); i++) { ans[v[1][i]] = 2; } if (!good) cout << - << endl; else { for (int x : ans) cout << x; cout << endl; } } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.