func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> int main() { int dem = 1, i, n, c; scanf( %d %d , &n, &c); int a[n]; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } for (i = 1; i < n; i++) { if (a[i] - a[i - 1] <= c) { dem++; } if (a[i] - a[i - 1] > c) { dem = 1; } } printf( %d , dem); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int m = 1e9 + 7; const int N = 3e5 + 15; const int64_t INF = 100000000000000018LL; priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, greater<pair<long long, long long>>> pq; vector<vector<long long>> graph(N); vector<long long> collect; map<long long, long long> mpp; set<pair<long long, long long>> s; set<long long> second; long long odd = 0, even = 0; long long pow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } long long inv(long long a) { return pow(a, m - 2, m); } void dfs(long long ind, vector<bool>& visited) { visited[ind] = true; for (auto it : graph[ind]) { { if (!visited[it]) dfs(it, visited); } } } bool isPowerOfTwo(long long n) { if (n == 0) return false; return (ceil(log2(n)) == floor(log2(n))); } void solve() { long long a, b, n, x; cin >> a >> b >> n >> x; long long ans = pow(a, n, m); n = n % m; long long aa = ans * x; if (aa < 0) aa += m; aa = aa % m; long long aa1 = 1; if (a == 1) { long long z1 = b * n; z1 = z1 % m; cout << (x + z1) % m; return; } aa1 = ((ans - 1 + m) % m) * inv(a - 1); aa1 = aa1 % m; if (aa1 < 0) aa1 += m; aa1 = aa1 * b; cout << (aa + aa1 + m) % m << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; struct Point { int x, y; Point(int x0, int y0) : x(x0), y(y0) {} Point() : x(0), y(0) {} }; int t; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; int n, m; long long maxx; int d[100005][4]; int a[100005], h[100005]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i] >> h[i]; } memset(d, 0, sizeof(d)); d[0][0] = 1; d[0][1] = 0; if (a[1] - a[0] > h[1]) d[0][2] = 1; else d[0][2] = 0; int res = 1; for (int i = 1; i < n; i++) { int dis = a[i] - a[i - 1]; if (h[i] < dis) d[i][0] = max(d[i - 1][0] + 1, d[i - 1][1] + 1); if (h[i] + h[i - 1] < dis) d[i][0] = max(d[i][0], d[i - 1][2] + 1); d[i][1] = max(d[i - 1][0], d[i - 1][1]); if (h[i - 1] < dis) d[i][1] = max(d[i][1], d[i - 1][2]); if (h[i] < a[i + 1] - a[i] || i == n - 1) d[i][2] = max(d[i - 1][0] + 1, d[i - 1][1] + 1); if (h[i - 1] < dis) d[i][2] = max(d[i][2], d[i - 1][2] + 1); res = max(res, max(d[i][0], max(d[i][1], d[i][2]))); } cout << res; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; string str; cin >> n >> str; int sum = 0; bool flag = false; for (int i = 0; i < n - 1; i++) { sum += str[i] - 48; int ts = 0, ti = i + 1; while (ti < n && ts <= sum) { if (ts == sum && str[ti] != 48) { ts = 0; } ts += str[ti] - 48; ti++; } if (ti == n && ts == sum) { flag = true; break; } } if (flag) { cout << YES ; } else { cout << NO ; } }
|
#include <bits/stdc++.h> using namespace std; int n, m, st; int tmp, tmp2; vector<int> adj[200005]; int memo[200005][5]; bool vis[200005][5]; int stc, stn; pair<int, int> par[200005][5]; int dp(int node, int cur) { if (adj[node].size() == 0) { if (cur == 2) { stc = cur; stn = node; return 1; } if (cur == 1) { stc = cur; stn = node; } return cur; } if (memo[node][cur] != -1) return memo[node][cur]; int ret = 0; pair<int, int> cp; cp.first = node; cp.second = cur; for (int i = 0; i < adj[node].size(); i++) { if (cur == 2) { if (vis[adj[node][i]][cur]) { if (ret == 0) ret = 2; continue; } vis[adj[node][i]][cur] = 1; par[adj[node][i]][cur] = cp; int now = dp(adj[node][i], cur); if (now == 1) ret = 1; vis[adj[node][i]][cur] = 0; } else { if (vis[adj[node][i]][(cur + 1) % 2]) { if (ret == 0) ret = 2; continue; } vis[adj[node][i]][(cur + 1) % 2] = 1; par[adj[node][i]][(cur + 1) % 2] = cp; int now = dp(adj[node][i], (cur + 1) % 2); if (now == 1) ret = 1; else if (now == 2 && ret == 0) ret = 2; vis[adj[node][i]][(cur + 1) % 2] = 0; } } return memo[node][cur] = ret; } void dfs(int node, int cur) { if (node == st && cur == 0) { printf( %d , node); return; } dfs(par[node][cur].first, par[node][cur].second); printf( %d , node); return; } int main() { memset(memo, -1, sizeof(memo)); scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &tmp); for (int j = 1; j <= tmp; j++) { scanf( %d , &tmp2); adj[i].push_back(tmp2); } } scanf( %d , &st); int ans = dp(st, 0); if (ans == 0) { printf( Lose n ); } else if (ans == 2) { printf( Draw n ); } else { printf( Win n ); dfs(stn, stc); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k; char ch[111111]; int main() { scanf( %d%d , &n, &k); scanf( %s , ch); int pos = 0; for (int act = 0; act <= 1000000 && act < k && pos < n - 1; ++act) { if (act >= 1000000 && act % 2 == k % 2) break; while (pos < n - 1 && !(ch[pos] == 4 && ch[pos + 1] == 7 )) pos++; if (pos == n - 1) break; if (pos % 2 == 0) ch[pos] = ch[pos + 1] = 4 ; else ch[pos] = ch[pos + 1] = 7 ; --pos; if (pos < 0) pos = 0; } printf( %s n , ch); }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; const int MAXV = 100; double prob[MAXN + 5][MAXV + 5]; int sz[MAXN + 5]; double temp[MAXV + 5]; int n; double ncr(int r, int n) { if (r > n) return 0; double ret = 1; for (int c = 0; c < r; c++) ret *= n - c; for (int c = 0; c < r; c++) ret /= c + 1; return ret; } double probabilityToTaketakeFromVuntasted(int take, int k, int untasted, int from) { int tasted = sz[from] - untasted; return ncr(take, untasted) * ncr(k - take, tasted) / ncr(k, sz[from]); } int main() { int c, c2; memset(prob, 0, sizeof(prob)); double ret = 0; scanf( %d , &n); for (c = 0; c < n; c++) { scanf( %d , &sz[c]); prob[c][sz[c]] = 1.0; } for (c = 0; c < n; c++) ret += prob[c][0]; int qs; for (scanf( %d , &qs); qs; qs--) { int from, to, k; scanf( %d%d%d , &from, &to, &k); from--; to--; memset(temp, 0, sizeof(temp)); double denominator = ncr(k, sz[from]); for (int untasted = 0; untasted <= MAXV; untasted++) { int newk = min(k, untasted); int tasted = sz[from] - untasted; double n1 = 1, n2 = 1; double d1 = 1, d2 = 1; for (int i = 0; i < min(tasted, k); i++) { d2 *= i + 1; n2 *= tasted - i; } for (int take = 0; take <= k; take++) { if (take > 0) { d1 *= take; if (take <= untasted) n1 *= untasted - take + 1; else n1 = 0; } if (k - take > tasted) continue; temp[untasted - take] += prob[from][untasted] * (n1 / d1) * (n2 / d2) / denominator; if (k - take > 0) { d2 /= k - take; n2 /= tasted - (k - take) + 1; } } } ret += temp[0] - prob[from][0]; for (int i = 0; i <= MAXV; i++) prob[from][i] = temp[i]; sz[from] -= k; sz[to] += k; printf( %.10lf n , ret); } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:500000000 ) using namespace std; vector<int> A[2]; int main() { int n, i, j, t, w; cin >> n; for (i = 0; i < n; i++) { cin >> t >> w; A[t - 1].push_back(w); } for (i = 0; i < 2; i++) sort(A[i].begin(), A[i].end(), greater<int>()); int res = 0x3F3F3F3F; for (int x = -1; x < (int)A[0].size(); x++) { for (int y = -1; y < (int)A[1].size(); y++) { w = (x + 1) + 2 * (y + 1); int s = 0; for (i = x + 1; i < A[0].size(); i++) s += A[0][i]; for (i = y + 1; i < A[1].size(); i++) s += A[1][i]; if (s <= w) res = min(res, w); } } cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; void solve() { long long int a, b, k; cin >> a >> b >> k; long long int total = 0; if (k % 2 != 0) { total -= b * (k / 2); total += a * (k / 2 + 1); } else { total -= b * (k / 2); total += a * (k / 2); } cout << total << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; int a[503][503]; int max_row[503]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, q, i, j, mxi, cnt, x, y; cin >> n >> m >> q; for (i = 1; i <= n; i++) { mxi = 0, cnt = 0; for (j = 1; j <= m; j++) { cin >> a[i][j]; if (a[i][j]) cnt++; else cnt = 0; mxi = ((mxi > cnt) ? mxi : cnt); } max_row[i] = mxi; } for (i = 0; i < q; i++) { cin >> x >> y; a[x][y] ^= 1; cnt = 0, mxi = 0; for (j = 1; j <= m; j++) { if (a[x][j]) cnt++; else cnt = 0; mxi = ((mxi > cnt) ? mxi : cnt); } max_row[x] = mxi; mxi = 0; for (j = 1; j <= n; j++) mxi = ((mxi > max_row[j]) ? mxi : max_row[j]); cout << mxi << endl; } }
|
#include <bits/stdc++.h> using namespace std; int n, m; char A[200006]; int S[200006], T[200006]; void solve() { cin >> n >> m; scanf( %s , A + 1); long long re = 0; for (int i = (1), iend = (n); i <= iend; ++i) { S[i] = (A[i] != A[i + 1]) + S[i - 1]; if (i >= 2 && A[i] == A[i - 2]) T[i] = T[i - 1] + 1; else if (i >= 2) T[i] = 2; else T[i] = 1; } for (int r = (1), rend = (n); r <= rend; ++r) { if (A[r] != A[r - 1]) re += (m - 1) * 1ll * (r - 1); re += m - 1; re += S[r - 1] * 1ll * (m - 1); if (A[r] != A[r - 1]) re -= T[r] - 1; } cout << re << endl; } signed main() { solve(); }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, m, n, x, y; cin >> n; if (n == 1) { x = 9; y = 8; } if (n == 2) { x = 6; y = 4; } if (n == 3) { x = 9; y = 6; } if ((n != 2) && (n != 1) && (n != 3)) { if (n % 2 == 0) { x = 2 * n; y = n; } else { x = n + 9; y = 9; } } cout << x << << y << n ; }
|
#include <bits/stdc++.h> using namespace std; unsigned long long A, B, D; int a[70], b[70], len1, len2; int main() { cin >> A >> B; D = A - B; unsigned long long temp = A; if (A < B) { cout << -1 << endl; return 0; } while (A) { a[len1++] = A % 2; A /= 2; } while (B) { b[len2++] = B % 2; B /= 2; } unsigned long long res = 0; for (int i = len1 - 1; i >= 0; --i) { if (!b[i]) { unsigned long long n = (1ULL << i); if (n <= D / 2.0) { D -= 2 * n; res += n; } } } if (D) { cout << -1 << endl; return 0; } cout << res << << temp - res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long x, d; while (~scanf( %lld%lld , &x, &d)) { vector<pair<long long, int> > counts; long long sum = 0; long long num = 1; while (x > 0) { long long two = 1; int count = 0; while (two - 1 <= x) two *= 2, count++; two /= 2, count--; sum += count; counts.emplace_back(num, count); x -= two - 1; num += d; } printf( %lld n , sum); for (int i = 0; i < counts.size(); i++) for (int j = 0; j < counts[i].second; j++) printf( %lld , counts[i].first); printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int long long x, y, l, r, k, i, j, ans; vector<int long long> mex, mey, my; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> x >> y >> l >> r; for (k = 1; k <= 1e18 / x; k *= x) mex.push_back(k); if (k <= 1e18) mex.push_back(k); for (k = 1; k <= 1e18 / y; k *= y) mey.push_back(k); if (k <= 1e18) mey.push_back(k); for (i = 0; i < mex.size(); i++) { for (j = 0; j < mey.size(); j++) { if (mex[i] + mey[j] > r) break; if (mex[i] + mey[j] >= l) { my.push_back(mex[i] + mey[j]); } } } my.push_back(l - 1); x = l; sort(my.begin(), my.end()); my.push_back(r + 1); for (i = 1; i < my.size(); i++) { ans = max(ans, my[i] - my[i - 1] - 1); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int N, P; bool can = false; string word; int main() { scanf( %d%d , &N, &P); cin >> word; if (P == 1) { cout << NO n ; return 0; } else if (P == 2) { if (N == 1) { if (word == a ) cout << b n ; else cout << NO n ; } else if (N == 2) { if (word == ab ) cout << ba n ; else cout << NO n ; } else if (N > 2) cout << NO n ; return 0; } for (int i = N - 1; i >= 0; --i) { ++word[i]; while ((i >= 1 && word[i] == word[i - 1]) || (i >= 2 && word[i] == word[i - 2])) ++word[i]; if ((word[i] - a ) + 1 <= P) { can = true; for (int j = i + 1; j < N; ++j) { word[j] = a ; while ((j >= 1 && word[j] == word[j - 1]) || (j >= 2 && word[j] == word[j - 2])) ++word[j]; } break; } } if (can) cout << word; else cout << NO n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int ts; cin >> ts; while (ts--) { long long n, i, vis[500] = {0}, a; cin >> n; for (i = 1; i <= 2 * n; i++) { cin >> a; if (vis[a] == 0) { cout << a << ; } vis[a] = 1; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 7; int a[1003][1003], p[maxn], num[maxn], n, m, vis[1003][1003]; long long k; int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; int fi(int x) { return p[x] == x ? x : p[x] = fi(p[x]); } void uni(int x, int y) { int p1 = fi(x), p2 = fi(y); if (p1 == p2) return; p[p1] = p2; num[p2] += num[p1]; num[p1] = 0; } struct node { int x, y, z; node(int x1, int y1, int z1) { x = x1, y = y1, z = z1; } }; bool cmp(node a, node b) { return a.x > b.x; } vector<node> Q; void solve(int x, int y, int z, int v) { queue<node> Q; Q.push(node(x, y, 0)); vis[x][y] = 1; z--; while (!Q.empty()) { node now = Q.front(); Q.pop(); for (int i = 0; i < 4; i++) { int xx = now.x + dx[i]; int yy = now.y + dy[i]; if (z == 0) continue; if (xx <= 0 || xx > n) continue; if (yy <= 0 || yy > m) continue; if (vis[xx][yy]) continue; if (a[xx][yy] < v) continue; vis[xx][yy] = 1, z--; Q.push(node(xx, yy, 0)); } } for (int i = 1; i <= n; i++, cout << endl) for (int j = 1; j <= m; j++) if (vis[i][j]) printf( %d , v); else printf( 0 ); } int main() { scanf( %d%d%lld , &n, &m, &k); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &a[i][j]), Q.push_back(node(a[i][j], i, j)); for (int i = 0; i < maxn; i++) p[i] = i, num[i] = 1; sort(Q.begin(), Q.end(), cmp); for (int i = 0; i < Q.size(); i++) { int v = Q[i].x; if (v == 0) break; int x = Q[i].y; int y = Q[i].z; for (int j = 0; j < 4; j++) { int xx = x + dx[j]; int yy = y + dy[j]; if (a[xx][yy] >= v) uni((xx - 1) * m + yy, (x - 1) * m + y); } long long Num = k / v; if (k % v) continue; int fa = fi((x - 1) * m + y); if (Num <= num[fa]) { printf( YES n ); solve(x, y, Num, v); return 0; } } printf( NO n ); }
|
#include <bits/stdc++.h> using namespace std; bool prime[100005]; int dp[505][505], dp2[505][505]; int main() { long long int h, w, i, j, a, b, c, d, q, sum; cin >> h >> w; char arr[h][w + 1]; for (i = 0; i <= h - 1; i++) cin >> arr[i]; for (i = 0; i <= h - 1; i++) { for (j = 1; j <= w - 1; j++) { if (arr[i][j] == . && arr[i][j - 1] == . ) dp[i][j] = dp[i][j - 1] + 1; else dp[i][j] = dp[i][j - 1]; } } for (i = 0; i <= w - 1; i++) { for (j = 1; j <= h - 1; j++) { if (arr[j][i] == . && arr[j - 1][i] == . ) dp2[j][i] = dp2[j - 1][i] + 1; else dp2[j][i] = dp2[j - 1][i]; } } cin >> q; while (q--) { sum = 0; cin >> a >> b >> c >> d; for (i = a - 1; i <= c - 1; i++) sum = sum + dp[i][d - 1] - dp[i][b - 1]; for (i = b - 1; i <= d - 1; i++) sum = sum + dp2[c - 1][i] - dp2[a - 1][i]; cout << sum << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 2e6 + 14; int n, a[Maxn], b[Maxn], ans, m; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i], b[a[i]] = a[i], m = max(m, a[i]); sort(a, a + n); for (int i = 1; i <= 2 * m; i++) { if (b[i] == 0) b[i] = b[i - 1]; } for (int i = m - 1; i > ans; i--) { if (b[i] == i) for (int j = i * 2 - 1; j < 2 * m; j += i) { ans = max(ans, b[j] % i); } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int oo = 1e9; const int MX = 1e6 + 5; const int MD = 1e9 + 7; int next(vector<int> &a, int pos, long long p) { long long cnt = 2; int l = pos, r = pos; while (r < ((int)a.size())) { while (r < ((int)a.size()) && cnt > 0 && a[r] == a[l]) r++, cnt--; if (cnt == 0) return r; if (r == ((int)a.size())) return -1; for (int i = 0; cnt <= ((int)a.size()) && i < a[l] - a[r]; i++) cnt *= p; if (cnt > ((int)a.size())) return -1; l = r; } return -1; } long long pt(long long b, long long e) { long long ans = 1; while (e > 0) { if (e & 1) ans = (ans * b) % MD; b = (b * b) % MD; e >>= 1; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n, p; cin >> n >> p; vector<int> a(n); for (int &x : a) cin >> x; if (p == 1) { cout << n % 2 << n ; continue; } sort(a.begin(), a.end()); reverse(a.begin(), a.end()); int last = -1; for (int l = 0, r = 0; l < n; l = r) { r = next(a, l, p); if (r == -1) { last = l; break; } } if (last == -1) { cout << 0 << n ; continue; } long long ans = pt(p, a[last]); for (int i = last + 1; i < n; i++) ans = (ans - pt(p, a[i]) + MD) % MD; cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; char a[15], b[15], c[15]; scanf( %s%s , a, b); scanf( %d , &n); printf( %s %s n , a, b); for (int i = 1; i <= n; i++) { scanf( %s , c); int l = strlen(c); int la = strlen(a); int lb = strlen(b); if (memcmp(a, c, l) == 0 && l == la) { scanf( %s , a); printf( %s %s n , a, b); } if (memcmp(b, c, l) == 0 && l == lb) { scanf( %s , b); printf( %s %s n , a, b); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 1; const long long nol = 0; long long n, k, a, cnt, ans, j, mx; deque<long long> v, vc; void vkoshp() { cin >> n >> k; for (long long i = 0; i < n; i++) { cin >> a; v.push_back(a); } for (long long i = 0; i < n; i++) { cin >> a; if (a == 1) cnt += v[i], vc.push_back(0); else ans += v[i], vc.push_back(v[i]); mx = max(mx, ans); if (vc.size() == k) { ans -= vc[0]; vc.pop_front(); } } cout << cnt + mx << endl; } int main() { cout.tie(NULL); cin.tie(NULL); ios_base::sync_with_stdio(0); long long t = 1; while (t--) vkoshp(); }
|
#include <bits/stdc++.h> using namespace std; int f[10000001]; int main() { int n, m, l, r; scanf( %d%d , &n, &m); long long ans = 0; int Max0 = max(n * 2, m); for (long long b = 1; b <= n; ++b) { ans += 2 * min(b * b, (long long)m); l = max(0, int(ceil(sqrt(b * b - m)))); r = int(floor(sqrt(b * b - 1))); ++f[-b - r + Max0], --f[-b - l + 1 + Max0], ++f[-b + l + Max0], --f[-b + r + 1 + Max0]; } int s = 0; for (int i = 0; i < Max0; ++i) { s += f[i]; if (s > 1) ans -= s - 1; } printf( %I64d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int t = 0; int ans = 1; long long int prime(long long int n) { while (n % 2 == 0) { if (t == 2) break; n = n / 2; t++; ans *= 2; } for (int i = 3; i <= sqrt(n); i += 2) { while (n % i == 0) { if (t == 2) break; n = n / i; t++; ans *= i; } if (t == 2) break; } if (n > 2 && t != 2) { ans *= n; t++; n = 1; } return n; } int main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false); long long int n; cin >> n; if (n == 1) cout << 1 << n << 0; else { long long int final = prime(n); if (final == 1 && t == 1) cout << 1 << endl << 0; else if (final == 1 && t == 2) cout << 2; else if (t == 2) cout << 1 << n << ans; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << n ; err(++it, args...); } template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << ( << a.first << , << a.second << ) ; } template <class T> ostream &operator<<(ostream &os, const vector<T> &a) { os << [ ; for (unsigned long long i = 0; i < a.size(); i++) os << a[i] << (i < a.size() - 1 ? , : ); os << ] ; return os; } template <class T> ostream &operator<<(ostream &os, const set<T> &a) { os << { ; for (typename set<T>::iterator it = a.begin(); it != a.end(); it++) { typename set<T>::iterator jt = it; os << *it << (++jt != a.end() ? , : ); } os << } ; return os; } template <class T1, class T2> ostream &operator<<(ostream &os, map<T1, T2> &a) { os << { n ; for (typename map<T1, T2>::iterator it = a.begin(); it != a.end(); it++) { typename map<T1, T2>::iterator jt = it; os << << it->first << : << it->second << (++jt != a.end() ? , n : n ); } os << } ; return os; } long long n, m; long long a[2005]; long long dp[2005][2]; bool check(long long lim) { memset(dp, 127, sizeof(dp)); dp[0][0] = dp[0][1] = 0; for (long long i = 1; i <= n; i++) { dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + 1; dp[i][1] = min(dp[i][1], i - 1); for (long long j = 1; j < i; j++) { long long diff = abs(a[i] - a[j]); if (diff > lim * (i - j)) continue; dp[i][1] = min(dp[i][1], dp[j][1] + (i - j - 1)); } } if (min(dp[n][0], dp[n][1]) <= m) return true; return false; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (long long i = 1; i <= n; i++) cin >> a[i]; long long l = 0, r = 2e9; while (l != r) { long long mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid + 1; } cout << l << n ; }
|
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX - 10000000; const double eps = 1e-8; long long t1, t2, x1, x2, t0; int main() { cin >> t1 >> t2 >> x1 >> x2 >> t0; if (t1 == t2) { cout << x1 << << x2 << endl; return 0; } long long minp = 12345678, minq = 1; long long y2, ans = 0; for (long long y1 = 0; y1 <= x1; y1++) { long long Left = 0, Right = x2, Mid; if (y1) while (Left <= Right) { Mid = Left + Right >> 1; if ((t2 - t1) * Mid < (t0 - t1) * (Mid + y1)) Left = Mid + 1; else Right = Mid - 1; } else Left = x2; if ((t2 - t1) * Left < (t0 - t1) * (Left + y1) || Left > x2) continue; if (Left * (t2 - t1) * minq - minq * (t0 - t1) * (Left + y1) < minp * (Left + y1)) { y2 = Left; ans = y1 + y2; minp = Left * (t2 - t1) - (t0 - t1) * (Left + y1); minq = Left + y1; } else if (Left * (t2 - t1) * minq - minq * (t0 - t1) * (Left + y1) == minp * (Left + y1)) { if (Left + y1 > ans) { y2 = Left; ans = y1 + y2; } } } cout << ans - y2 << << y2 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, K; int A[310000]; int dp[31000][210][4][2]; int ins(int i, int k, int bit) { if (k == 1) { if (bit % 2 == 0) return A[i]; return -A[i]; } if (k == K) { if (bit / 2 == 0) return -A[i]; return A[i]; } int res = 0; if (bit % 2 == 0) res += A[i]; else res -= A[i]; if (bit / 2 == 0) res -= A[i]; else res += A[i]; return res; } int main() { for (int(i) = 0; (i) < (31000); (i)++) for (int(j) = 0; (j) < (210); (j)++) for (int(k) = 0; (k) < (4); (k)++) for (int(l) = 0; (l) < (2); (l)++) dp[i][j][k][l] = -(1 << 30); scanf( %d%d , &N, &K); for (int(i) = 0; (i) < (N); (i)++) scanf( %d , &A[i]); dp[0][0][0][0] = 0; for (int(i) = 0; (i) < (N); (i)++) { for (int(j) = 0; (j) < (K + 1); (j)++) for (int(b) = 0; (b) < (4); (b)++) { dp[i + 1][j][b][0] = max(dp[i + 1][j][b][0], dp[i][j][b][0]); dp[i + 1][j + 1][b % 2 * 2][1] = max(dp[i + 1][j + 1][b % 2 * 2][1], dp[i][j][b][0] + ins(i, j + 1, b % 2 * 2)); dp[i + 1][j + 1][b % 2 * 2][1] = max(dp[i + 1][j + 1][b % 2 * 2][1], dp[i][j][b][1] + ins(i, j + 1, b % 2 * 2)); dp[i + 1][j + 1][b % 2 * 2 + 1][1] = max(dp[i + 1][j + 1][b % 2 * 2 + 1][1], dp[i][j][b][0] + ins(i, j + 1, b % 2 * 2 + 1)); dp[i + 1][j + 1][b % 2 * 2 + 1][1] = max(dp[i + 1][j + 1][b % 2 * 2 + 1][1], dp[i][j][b][1] + ins(i, j + 1, b % 2 * 2 + 1)); dp[i + 1][j][b][1] = max(dp[i + 1][j][b][1], dp[i][j][b][1] + ins(i, j, b)); dp[i + 1][j][b][0] = max(dp[i + 1][j][b][0], dp[i][j][b][1]); } for (int(j) = 0; (j) < (K + 1); (j)++) for (int(k) = 0; (k) < (4); (k)++) for (int(l) = 0; (l) < (2); (l)++) if (dp[i + 1][j][k][l] < -(1 << 29)) dp[i + 1][j][k][l] = -(1 << 30); } int res = -(1 << 30); for (int(b) = 0; (b) < (4); (b)++) for (int(l) = 0; (l) < (2); (l)++) res = max(res, dp[N][K][b][l]); cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; long long powmod(long long n, long long q) { long long ans = 1; n %= 1000000007; while (q > 0) { if (q & 1) ans = (ans * n) % 1000000007; n = (n * n) % 1000000007; q >>= 1; } return ans % 1000000007; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int tc = 1; while (tc--) { int n, ans = 0; cin >> n; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int k = i ^ j; if (k < i + j) { if (i < k + j) { if (j < i + k) { if (k >= 1 && k <= n) ans++; } } } } } cout << ans / 3 << n ; } return 0; }
|
#include <bits/stdc++.h> int reverseChar(char input) { const int N = 8; int output(0); for (int p = 0; p < N; p++) { output = 2 * output + (input % 2); input /= 2; } return output; } int main() { const int N = 256; std::string line; getline(std::cin, line); int previous = 0; for (int p = 0; p < line.size(); p++) { int current = reverseChar(line[p]); printf( %d n , (N + previous - current) % N); previous = current; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct box { long long int x1, x2, y1, y2; box() : x1(0), x2(0), y1(0), y2(0) {} box(int x1, int x2, int y1, int y2) : x1(x1), x2(x2), y1(y1), y2(y2) {} }; struct edge { long long int to, c, f; edge() : to(0), c(0), f(0) {} edge(int to, long long int c, int f) : to(to), c(c), f(f) {} }; bool ins(box a, box b) { if (a.x1 >= b.x1 && a.x2 <= b.x2 && a.y1 >= b.y1 && a.y2 <= b.y2) { return 1; } return 0; } const int M = 5000000; edge edges[M]; vector<int> g[M]; int cnt = 0; int nxt[M]; int d[M]; int oy[40000]; int ox[40000]; int lasty[10000]; vector<int> how; int n1; void addedge(int v, int u, long long int c) { edges[cnt] = edge(u, c, 0); g[v].push_back(cnt++); edges[cnt] = edge(v, 0, 0); g[u].push_back(cnt++); } void buildy(int v, int l, int r) { if (l == r) { addedge(100000, v, 1); return; } int m = (l + r) / 2; buildy(2 * v, l, m); buildy(2 * v + 1, m + 1, r); addedge(2 * v, v, 1000000); addedge(2 * v + 1, v, 1000000); return; } void buildx(int v, int l, int r) { if (l == r) { addedge(v + 40000, 100001, 1); return; } int m = (l + r) / 2; buildx(2 * v, l, m); buildx(2 * v + 1, m + 1, r); addedge(v + 40000, 2 * v + 40000, 1000000); addedge(v + 40000, 2 * v + 1 + 40000, 1000000); return; } void gety(int v, int l, int r, int l1, int r1) { if (l >= l1 && r <= r1) { how.push_back(v); return; } if (l > r1 || l1 > r) return; int m = (l + r) / 2; gety(2 * v, l, m, l1, r1); gety(2 * v + 1, m + 1, r, l1, r1); } void getx(int v, int l, int r, int l1, int r1) { if (l >= l1 && r <= r1) { for (auto c : how) { addedge(c, 40000 + v, 1000000000); } return; } if (l > r1 || l1 > r) return; int m = (l + r) / 2; getx(2 * v, l, m, l1, r1); getx(2 * v + 1, m + 1, r, l1, r1); } void makepr(int x1, int x2, int y1, int y2) { how.clear(); gety(1, 0, n1 - 1, x1, x2); getx(1, 0, n1 - 1, y1, y2); } bool bfs(int s, int t, int n) { for (int i = 0; i < n; i++) d[i] = 1000000; d[s] = 0; queue<int> q; q.push(s); while (q.size()) { int v = q.front(); q.pop(); for (auto c : g[v]) { int to = edges[c].to; if (d[to] <= d[v] + 1 || edges[c].c == edges[c].f) continue; d[to] = d[v] + 1; q.push(to); } } if (d[t] == 1000000) return 0; return 1; } long long int dfs(int v, int t, long long int f) { if (v == t) return f; if (f == 0) return 0; long long int sum = 0; for (; nxt[v] < g[v].size(); nxt[v]++) { int id = g[v][nxt[v]]; int to = edges[id].to; if (d[to] != d[v] + 1 || edges[id].c == edges[id].f) continue; long long int del = dfs(to, t, min(edges[id].c - edges[id].f, f - sum)); sum += del; edges[id].f += del; edges[id ^ 1].f -= del; if (sum == f) break; } return sum; } long long int dinic(int s, int t, int n) { long long int mf = 0; while (bfs(s, t, n)) { for (int i = 0; i < n; i++) nxt[i] = 0; mf += dfs(s, t, 1e9); } return mf; } bool cmp(box a, box b) { return (a.y1 < b.y1); } void solve() { cin >> n1; int m; cin >> m; vector<box> all(m); for (int i = 0; i < m; i++) { cin >> all[i].x1 >> all[i].y1 >> all[i].x2 >> all[i].y2; all[i].x1--; all[i].x2--; all[i].y1--; all[i].y2--; } sort(begin(all), end(all), cmp); buildy(1, 0, n1 - 1); buildx(1, 0, n1 - 1); for (auto c : all) { int x1, x2, y1, y2; y1 = c.x1; y2 = c.x2; x1 = c.y1; x2 = c.y2; int cur = 0; for (int i = 0; i < n1; i++) { if (lasty[cur] != lasty[i]) { if (cur >= y1 && i - 1 <= y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, cur, i - 1); for (int y = cur; y <= i - 1; y++) lasty[y] = x2 + 1; } if (cur < y1 && i - 1 > y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, y1, y2); for (int y = y1; y <= y2; y++) lasty[y] = x2 + 1; cur = i; } if (cur < y1 && i - 1 <= y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, y1, i - 1); for (int y = y1; y <= i - 1; y++) lasty[y] = x2 + 1; } if (cur >= y1 && i - 1 > y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, cur, y2); for (int y = cur; y <= y2; y++) lasty[y] = x2 + 1; } cur = i; } if (i == n1 - 1) { i++; if (cur >= y1 && i - 1 <= y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, cur, i - 1); for (int y = cur; y <= i - 1; y++) lasty[y] = x2 + 1; } if (cur < y1 && i - 1 > y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, y1, y2); for (int y = y1; y <= y2; y++) lasty[y] = x2 + 1; } if (cur < y1 && i - 1 <= y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, y1, i - 1); for (int y = y1; y <= i - 1; y++) lasty[y] = x2 + 1; } if (cur >= y1 && i - 1 > y2) { if (lasty[cur] != x1) makepr(lasty[cur], x1 - 1, cur, y2); for (int y = cur; y <= y2; y++) lasty[y] = x2 + 1; } } } } int cur = 0; for (int i = 0; i < n1; i++) { if (lasty[cur] != lasty[i]) { if (lasty[cur] <= n1 - 1) makepr(lasty[cur], n1 - 1, cur, i - 1); cur = i; } if (i == n1 - 1) { i++; if (lasty[cur] <= n1 - 1) makepr(lasty[cur], n1 - 1, cur, i - 1); cur = i; } } cout << dinic(100000, 100001, 100002); } int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); int t; t = 1; while (t) { t--; solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 5010; const int MOD = 1000000007; int n, x[N], y[N], w[N][N], vis[N]; inline void dfs(int v, int val) { for (int u = 0; u < n; u++) { if (w[v][u] > val) { if (vis[u] == vis[v]) throw 0; if (vis[u] != -1) continue; vis[u] = !vis[v]; dfs(u, val); } } } inline int check(int val) { memset(vis, -1, sizeof vis); int ans = 1; for (int i = 0; i < n; i++) if (vis[i] == -1) { try { vis[i] = 0; dfs(i, val); } catch (...) { return 0; } ans += ans; if (ans >= MOD) ans -= MOD; } return ans; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d%d , x + i, y + i); for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) w[i][j] = w[j][i] = abs(x[i] - x[j]) + abs(y[i] - y[j]); int lo = 0, hi = 10050, mid; while (lo < hi) { mid = lo + hi >> 1; if (check(mid)) hi = mid; else lo = mid + 1; } cout << hi << n << check(hi) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int rowblk[200005]; long long int colblk[200005]; long long int col[200005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int l, n, i, j, k, m; cin >> n >> m; for (i = 1; i <= m; i++) { cin >> k >> l; rowblk[k] = 1; colblk[l] = 1; } long long int cnt = 0; for (i = 2; i < n; i++) { if (colblk[i] == 0) { cnt++; col[i] = 1; } } for (i = 2; i < n; i++) { if (rowblk[i] == 0) { if (n % 2 != 0 && i == n / 2 + 1) { if (col[i] == 0) cnt++; } else { cnt++; } } } cout << cnt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long arr[200001]; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i]; } sort(arr, arr + n, greater<int>()); long long gcf = 0, total = 0; for (int i = 0; i < n; ++i) { gcf = gcd(arr[0] - arr[i], gcf); total += (arr[0] - arr[i]); } cout << total / gcf << << gcf << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << ? << ; fflush(stdout); for (int i = 0; i < 100; i++) { cout << i << ; fflush(stdout); } cout << endl; int n; cin >> n; cout << ? << ; fflush(stdout); long long a = 0; for (int i = 0; i < 100; i++) { a += (1 << 7); cout << a << ; fflush(stdout); } cout << endl; int b; cin >> b; bitset<14> x(n), y(b), z; for (int i = 0; i < 14; i++) { if (i < 7) z[i] = y[i]; else z[i] = x[i]; } cout << ! << z.to_ulong(); }
|
#include <bits/stdc++.h> using namespace std; struct Pair { int a, b, c; }; int a1[200009], a2[200009]; vector<Pair> arr; bool rules(Pair x, Pair y) { return ((x.a - x.b) < (y.a - y.b)); } int main() { int n, k, sum = 0; scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a1[i]); for (int i = 0; i < n; i++) { scanf( %d , &a2[i]); Pair p; p.a = a1[i], p.b = a2[i]; arr.push_back(p); } sort(arr.begin(), arr.end(), rules); for (int i = 0; i < k; i++) sum += arr[i].a; for (int i = k; i < n; i++) sum += min(arr[i].a, arr[i].b); printf( %d n , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &x, T y) { if (y > x) x = y; } template <class T> inline void umin(T &x, T y) { if (y < x) x = y; } const int N = 2e5 + 5, B = 0x7fffffff; map<int, int> comp; set<int> s; vector<int> ans; int a[N]; int st[4 * N]; int n; int nn; void upd(int l, int r, int id, int u, int v) { if (l == r) { umax(st[id], v); return; } int mid = (l + r) >> 1; if (u <= mid) upd(l, mid, id << 1, u, v); else upd(mid + 1, r, id << 1 | 1, u, v); st[id] = max(st[id << 1], st[id << 1 | 1]); } int get(int l, int r, int id, int ql, int qr) { if (r < ql || l > qr) return 0; if (l >= ql && r <= qr) return st[id]; int mid = (l + r) >> 1; return max(get(l, mid, id << 1, ql, qr), get(mid + 1, r, id << 1 | 1, ql, qr)); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), s.insert(a[i]), s.insert(a[i] - 1); for (int x : s) comp[x] = ++nn; for (int i = n; i >= 1; i--) { int ppq = (get(1, nn, 1, 1, comp[a[i] - 1])); ans.push_back(ppq == 0 ? -1 : ppq - i - 1); upd(1, nn, 1, comp[a[i]], i); } for (int i = (int)ans.size() - 1; i >= 0; i--) printf( %d , ans[i]); return !1; }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long int MOD = 1000000007; int main() { int t, a, b; scanf( %lld , &t); while (t--) { scanf( %d %d , &a, &b); if (b >= a) printf( 1 ); else { vector<int> v; bool k = false; int c; for (int i = 1; i * i <= a; i++) { if (a % i == 0) { v.push_back(i); v.push_back(a / i); k = true; } } if (!k) printf( %d , a); else { sort(v.begin(), v.end(), greater<int>()); for (int i = 0; i < (int)v.size(); i++) { if (v[i] <= b) { printf( %d , a / v[i]); break; } } } } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void __p(T a) { cout << a; } template <typename T, typename U> void __p(pair<T, U> a) { cout << { ; __p(a.first); cout << , ; __p(a.second); cout << } ; } template <typename T> void __p(std::vector<T> a) { cout << { ; for (auto it = a.begin(); it < a.end(); it++) __p(*it), cout << ,} [it + 1 == a.end()]; } void solve() { long long n, k; cin >> n >> k; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (n == 2) { cout << 2 - k * (a[0] | a[1]) << endl; return; } long long ans = 2 - k * (a[0] | a[1]); for (long long i = n - 2; i > n - 300 && i >= 0; i--) { for (long long j = n - 1; j > i; j--) { ans = max(ans, (i + 1) * (j + 1) - k * (a[i] | a[j])); } } cout << ans << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; cin >> tc; for (int t = 1; t <= tc; t++) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int n, x; bool X[26]; int mat[6][6]; int niz[26]; int sum; bool check() { sum = 0; for (int i = 0; i < n; i++) sum += mat[i][0]; for (int j = 1; j < n; j++) { int st = 0; for (int i = 0; i < n; i++) st += mat[i][j]; if (st != sum) return false; } for (int i = 0; i < n; i++) { int st = 0; for (int j = 0; j < n; j++) st += mat[i][j]; if (st != sum) return false; } int sz = 0; for (int i = 0; i < n; i++) { sz += mat[i][i]; } if (sz != sum) return false; sz = 0; for (int i = 0; i < n; i++) { sz += mat[i][n - i - 1]; } if (sz != sum) return false; return true; } vector<pair<int, int> > pos; vector<int> vals; int empty_cnt = 0; int main() { scanf( %d , &n); for (int i = 0; i < n * n; i++) { scanf( %d , &niz[i]); vals.push_back(i); pos.push_back(make_pair(i / n, i % n)); } do { for (int i = 0; i < pos.size(); i++) { mat[pos[i].first][pos[i].second] = niz[vals[i]]; } if (check()) { break; } } while (next_permutation(vals.begin(), vals.end())); printf( %d n , sum); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { printf( %d , mat[i][j]); } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a[200001], b[200001], m; int main() { cin >> n >> m; n = n + m; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } vector<int> vec; for (int i = 1; i <= n; i++) { scanf( %d , &b[i]); if (b[i] == 1) { vec.push_back(a[i]); } } vec.push_back(2e9 + 1); int l = 0, cnt = 0, r = 1, c = 0; while (l < vec.size() - 1 && r <= n) { if (b[r] == 0) { while (abs(a[r] - vec[l]) > abs(a[r] - vec[l + 1])) { cout << cnt << ; c++; l++; cnt = 0; } cnt++; } r++; } cout << cnt << ; for (int i = 0; i < vec.size() - 2 - c; i++) { cout << 0 ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bitset<1000> mask[1010]; long long sqr(int x) { return 1LL * x * x; } int n, m, k; int px[10010], py[10010], x[10010], y[10010], r[10010]; int main() { int i, j; scanf( %d%d%d , &n, &m, &k); for (i = 0; i < n; ++i) { scanf( %d%d , &px[i], &py[i]); } for (i = 0; i < m; ++i) { scanf( %d%d%d , &r[i], &x[i], &y[i]); } for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) if (sqr(px[i] - x[j]) + sqr(py[i] - y[j]) <= sqr(r[j])) mask[i][j] = 1; } while (k--) { int a, b; scanf( %d%d , &a, &b); printf( %d n , (mask[a - 1] ^ mask[b - 1]).count()); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n; int head[N], Next[N << 1], ver[N << 1], size[N], edge[N << 1], w[N]; int tot; long long ans; void add(int x, int y, int z) { ver[++tot] = y; edge[tot] = z; Next[tot] = head[x]; head[x] = tot; } void dfs(int x, int fa) { size[x] = 1; for (int i = head[x]; i; i = Next[i]) { int y = ver[i]; if (y == fa) continue; dfs(y, x); size[x] += size[y]; } } void solve(int x, int fa, long long s) { for (int i = head[x]; i; i = Next[i]) { int y = ver[i], z = edge[i]; if (y == fa) continue; if (s + (long long)z > (long long)w[y]) ans += (long long)size[y]; else solve(y, x, max(0ll, s + (long long)z)); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &w[i]); for (int i = 2; i <= n; i++) { int p, c; scanf( %d%d , &p, &c); add(p, i, c); add(i, p, c); } dfs(1, 0); solve(1, 0, 0ll); printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 50; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; long long n, k; long long a[maxn]; int vis[maxn]; long long ans = 0; bool Overflow(long long x, long long y) { if (x > LLONG_MAX / y) return false; else return true; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); memset(vis, 0, sizeof(vis)); memset(a, 0, sizeof(a)); cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } vis[n + 1] = -1; for (int i = n; i >= 1; i--) { if (a[i] > 1) vis[i] = i; else vis[i] = vis[i + 1]; } long long p = 1; long long s = 0; for (int i = 1; i <= n; i++) { int j = i; p = a[i]; s = a[i]; if (p == s * k) ans++; while (1) { int z = vis[j + 1]; if (z == -1) z = n + 1; int ones = z - j - 1; if (p % k == 0 && p / k - s >= 1 && p / k - s <= ones) { ans++; } if (z == n + 1) break; if (Overflow(p, a[z])) { p = p * a[z]; j = z; s = s + a[z] + ones; if (p == s * k) ans++; } else break; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e5 + 5; long long N, K; long long v[MAXN]; int main() { cin >> N >> K; for (int i = 0; i < N; i++) cin >> v[i]; sort(v, v + N); long long resp = N; for (int i = 0; i < N; i++) { long long value = v[i] * K; int l = i + 1, r = N - 1; while (l <= r) { int mid = (l + r) / 2; if (v[mid] == value) { resp--; v[mid] = -1; break; } if (v[mid] < value) l = mid + 1; else r = mid - 1; } } cout << resp << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, n, c = 0, p = 0, al, bl, l = 0; string s; cin >> s; for (i = 0; i < s.length(); i++) { l++; c += (s[i] - 0 ); if (c % 3 == 0 || (s[i] - 0 ) % 3 == 0 || l >= 3) { p++; c = 0; l = 0; } } if (s[0] == 0 ) p--; cout << p; }
|
#include <bits/stdc++.h> using namespace std; const int NMX = 5007; const int MMX = 20007; long long a[NMX][NMX]; long long mi[NMX]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { int k, l; scanf( %d %d , &k, &l); a[k % n][l % n] += 1; } for (int i = 0; i < n; i++) { bool first = false; for (int j = i; j < (n + i); j++) { if (first == false && a[i][j % n] >= 1) { mi[i] += abs(j - i); first = true; a[i][j % n] -= 1; } mi[i] += a[i][j % n] * n; } } for (int i = 1; i <= n; i++) { long long ans = 0; for (int j = 1; j <= n; j++) { if (mi[j % n] >= 1) ans = max(ans, mi[j % n] + ((i > j) ? n - i + j : j - i)); } cout << ans << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int h[n]; for (int i = 0; i < n; i++) { cin >> h[i]; } int wys[n][2]; int rosnpr = 0; int rosnlw = 0; for (int i = 0; i < n; i++) { if (h[i] > rosnpr) { rosnpr++; wys[i][0] = rosnpr; } else { rosnpr = h[i]; wys[i][0] = rosnpr; } } for (int i = n - 1; i >= 0; i--) { if (h[i] > rosnlw) { rosnlw++; wys[i][1] = rosnlw; } else { rosnlw = h[i]; wys[i][1] = rosnlw; } } int maxi = 0; for (int i = 0; i < n; i++) { if (min(wys[i][0], wys[i][1]) > maxi) { maxi = min(wys[i][0], wys[i][1]); } } cout << maxi; }
|
#include <bits/stdc++.h> using namespace std; template <typename S, typename T> ostream& operator<<(ostream& out, pair<S, T> const& p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T> ostream& operator<<(ostream& out, vector<T> const& v) { int l = v.size(); for (int i = 0; i < l - 1; i++) out << v[i] << ; if (l > 0) out << v[l - 1]; return out; } template <typename T> void trace(const char* name, T&& arg1) { cout << name << : << arg1 << endl; } template <typename T, typename... Args> void trace(const char* names, T&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; trace(comma + 1, args...); } vector<int> htov(string s) { vector<int> ret; for (char c : s) { if (c <= 9 ) ret.push_back(c - 0 ); else ret.push_back(10 + c - a ); } reverse(ret.begin(), ret.end()); return ret; } void sub(vector<int>& v) { int n = v.size(); if (n == 1 and v[0] == 0) return; int i = 0; while (i < n and v[i] == 0) i++; v[i]--; if (i > 0) { for (int j = 0; j < i; j++) v[j] = 15; if (v[i] == 0 and (i + 1) == v.size()) v.resize(i); } return; } const int N = 17; long long dp[N][2][2]; long long get(vector<int> v) { reverse(v.begin(), v.end()); int n = v.size(); long long res = 0; for (int d = 1; d < 16; d++) { if ((d / 4) + 1 > n) break; memset(dp, 0, sizeof dp); dp[0][1][0] = 1; for (int i = 0; i < n; i++) { for (int eq = 0; eq < 2; eq++) { for (int flag = 0; flag < 2; flag++) { long long val = dp[i][eq][flag]; if (!val) continue; int max_nd = min(d, (eq == 0) ? 15 : v[i]); for (int nd = 0; nd <= max_nd; nd++) { if (n - i - 1 == d / 4 and (nd & (1 << (d % 4))) == 0) continue; int neq = (eq and nd == v[i]); int nflag = (flag or nd == d); dp[i + 1][neq][nflag] += val; } } } } for (int eq = 0; eq < 2; eq++) { res += dp[n][eq][1]; } } return res; } void solve() { string l, r; cin >> l >> r; vector<int> R = htov(r); vector<int> L = htov(l); sub(L); cout << get(R) - get(L) << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int q; cin >> q; while (q--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct fenwick_tree_t { vector<int> t; void init(int n) { t.assign(n, 0); } void inc(int pos, int x = 1) { while (pos < (int)t.size()) { t[pos] += x; pos = pos | (pos + 1); } } int get(int pos) const { int ret = 0; while (pos >= 0) { ret += t[pos]; pos = (pos & (pos + 1)) - 1; } return ret; } }; vector<int> ord(vector<int> const &a) { fenwick_tree_t tree; tree.init(a.size() + 1); vector<int> ret(a.size(), 0); for (int i = (int)ret.size() - 1; i >= 0; --i) { ret[i] = tree.get(a[i]); tree.inc(a[i]); } return ret; } ostream &operator<<(ostream &out, vector<int> const &a) { for (int x : a) out << x << ; return out; } vector<int> solve(vector<int> const &a, vector<int> const &b) { vector<int> ord_a = ord(a); vector<int> ord_b = ord(b); vector<int> ord_ans(ord_a.size(), 0); for (int i = 0; i < (int)ord_ans.size(); ++i) ord_ans[i] = ord_a[i] + ord_b[i]; reverse(ord_ans.begin(), ord_ans.end()); for (int i = 0; i < (int)ord_ans.size(); ++i) { if (ord_ans[i] >= i + 1) { if (i + 1 < (int)ord_ans.size()) ++ord_ans[i + 1]; ord_ans[i] -= i + 1; } } reverse(ord_ans.begin(), ord_ans.end()); vector<int> ans(ord_ans.size(), 0); fenwick_tree_t t; t.init(ord_ans.size() + 1); for (int i = 0; i < (int)ans.size(); ++i) t.inc(i); for (int i = 0; i < (int)ans.size(); ++i) { int l = -1, r = ans.size() - 1; while (r - l > 1) { int m = (l + r) / 2; if (t.get(m) < ord_ans[i] + 1) { l = m; } else { r = m; } } t.inc(r, -1); ans[i] = r; } return ans; } int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) cin >> b[i]; cout << solve(a, b) << endl; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; bool sortbysec(const pair<char, int> &a, const pair<char, int> &b) { return (a.second < b.second); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string ip, hh, mm; cin >> ip; hh = ip.substr(0, 2); string hr = hh; reverse(hr.begin(), hr.end()); mm = ip.substr(3, 4); if (hh == 23 && (stoi(mm) >= stoi(hr))) cout << 00:00 ; else if (hh == 06 || hh == 07 || hh == 08 || hh == 09 ) cout << 10:01 ; else if (hh == 15 && stoi(mm) >= 51 || hh == 16 || hh == 17 || hh == 18 || hh == 19 ) cout << 20:02 ; else if (stoi(mm) < stoi(hr)) cout << hh << : << hr; else { int x = (stoi(hh) + 1) % 10 * 10 + stoi(hh) / 10; int y = stoi(hh) + 1; if (y >= 10) cout << y << : << x; else cout << 0 << y << : << x; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int N = 1e5 + 10; char a[N], b[N]; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); scanf( %s%s , a, b); int t = 0; int t1 = 0, t2 = 0; for (int i = 0; i < n; i++) { if (a[i] != b[i]) { t++; if (t == 1) t1 = i; else if (t == 2) t2 = i; } if (t == 3) break; } if (t != 2) printf( No n ); else { if (t == 0 || (a[t1] == a[t2] && b[t1] == b[t2])) printf( Yes n ); else printf( No n ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, q; int par[26][100005], depth[100005]; vector<int> st[400005]; vector<int> G[100005]; vector<int> SS[26][100005]; int cnt, chaincnt; void get10(vector<int> &res, const vector<int> &fir, const vector<int> sec) { int c1 = 0, c2 = 0; res = vector<int>(min((int)fir.size() + (int)sec.size(), 10)); for (int i = 0; i < (int)res.size(); i++) { if (c1 != fir.size() && c2 != sec.size()) { if (fir[c1] < sec[c2]) { res[i] = fir[c1++]; } else { res[i] = sec[c2++]; } } else if (c1 == fir.size()) { res[i] = sec[c2++]; } else { res[i] = fir[c1++]; } } return; } set<int> ret1, ret2; int LCA(int u, int v) { ret1.clear(), ret2.clear(); if (depth[u] < depth[v]) swap(u, v); int dif = depth[u] - depth[v]; for (int i = 0; i <= 24; i++) { if (dif & (1 << i)) { u = par[i][u]; } } if (u == v) return u; for (int i = 24; i >= 0; i--) { if (par[i][u] != par[i][v]) { u = par[i][u], v = par[i][v]; } } return par[0][u]; } vector<int> solve(int u, int v) { int lca = LCA(u, v); int d1 = depth[u] - depth[lca] + 1; int d2 = depth[v] - depth[lca] + 1; int lvl = 26; set<int> ret1; while (d1 > 0) { if ((1 << lvl) <= d1) { d1 -= (1 << lvl); for (int i = 0; i < (int)SS[lvl][u].size() && i < 10; i++) { ret1.insert(SS[lvl][u][i]); } while (ret1.size() > 10) { ret1.erase(--ret1.end()); } u = par[lvl][u]; } lvl--; if (lvl < 0) lvl = 0; } lvl = 26; set<int> ret2; while (d2 > 0) { if ((1 << lvl) <= d2) { d2 -= (1 << lvl); for (int i = 0; i < (int)SS[lvl][v].size() && i < 10; i++) { ret2.insert(SS[lvl][v][i]); } while (ret2.size() > 10) { ret2.erase(--ret2.end()); } v = par[lvl][v]; } lvl--; if (lvl < 0) lvl = 0; } ret1.insert(ret2.begin(), ret2.end()); while (ret1.size() > 10) { ret1.erase(--ret1.end()); } vector<int> ret(ret1.begin(), ret1.end()); return ret; } void dfs(int u, int p, int dep) { depth[u] = dep; par[0][u] = p; for (int i = 0; i < (int)G[u].size(); i++) { int v = G[u][i]; if (v == p) continue; dfs(v, u, dep + 1); } } int main() { int from, to; scanf( %d %d %d , &n, &m, &q); for (int i = 1; i < n; i++) { scanf( %d %d , &from, &to); G[from].push_back(to); G[to].push_back(from); } int cur; for (int i = 1; i <= m; i++) { scanf( %d , &cur); SS[0][cur].push_back(i); } memset(par, -1, sizeof par); chaincnt = cnt = 1; dfs(1, -1, 0); for (int i = 1; i <= 24; i++) for (int j = 1; j <= n; j++) if (par[i - 1][j] != -1) { par[i][j] = par[i - 1][par[i - 1][j]]; get10(SS[i][j], SS[i - 1][par[i - 1][j]], SS[i - 1][j]); } int how; vector<int> ans; while (q--) { scanf( %d %d %d , &from, &to, &how); ans = solve(from, to); printf( %d , min((int)ans.size(), how)); for (int i = 0; i < ans.size() && how; i++, how--) { printf( %d , ans[i]); } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, c; cin >> n >> c; int a[n], t[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int j = 0; j < n; j++) cin >> t[j]; int b = 0, e = 0, e1 = 0; for (int i = 0; i < n; i++) { b += t[i]; e += max(0, a[i] - c * b); } b = 0; for (int i = n - 1; i >= 0; i--) { b += t[i]; e1 += max(0, a[i] - c * b); } if (e > e1) cout << Limak ; else if (e == e1) cout << Tie ; else cout << Radewoosh ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } void vrikodara(long long n = 12) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(n) << fixed; } long long lb = 100000; void solve() { long long n; cin >> n; set<long long> s, so, se; for (long long i = 1; i <= n; i++) s.insert(i); vector<long long> p(n + 2); for (long long i = 1; i <= n; i++) { cin >> p[i]; if (p[i]) s.erase(p[i]); } if (n == 1) { cout << 0 ; return; } for (auto i : s) if (i & 1) so.insert(i); else se.insert(i); set<pair<long long, long long> > sso, sse; for (long long i = 1; i <= n; i++) { if (!p[i]) { if (!p[i - 1]) continue; long long x = i, y = i; while (y <= n && !p[y]) y++; if (y > n) break; if (p[x - 1] & 1 && p[y] & 1) { sso.insert({y - x, x}); } else if (p[x - 1] % 2 == 0 && p[y] % 2 == 0) { sse.insert({y - x, x}); } i = y; } } if (s.size() >= n - 1) { cout << 1 ; return; } while (!sso.empty() && !so.empty()) { auto q = *sso.begin(); long long x = q.second; long long y = q.first + q.second; if (q.first > so.size()) break; sso.erase(q); while (x < y && !so.empty()) { long long j = *so.begin(); so.erase(j); p[x] = j; x++; } if (x < y) { sso.insert({y - x, x}); break; } } while (!sse.empty() && !se.empty()) { auto q = *sse.begin(); long long x = q.second, y = q.first + q.second; if (q.first > se.size()) break; sse.erase(q); while (x < y && !se.empty()) { long long j = *se.begin(); se.erase(j); p[x] = j; x++; } if (x < y) { sse.insert({y - x, x}); break; } } long long d1 = 1; while (d1 <= n && !p[d1]) d1++; d1--; long long d2 = n; while (d2 > 0 && !p[d2]) d2--; if (d1 && d2 < n) { if (d1 > n - d2) { d2++; if (p[d2 - 1] & 1) { while (!so.empty() && d2 <= n) { long long j = *so.begin(); so.erase(j); p[d2] = j; d2++; } } else { while (!se.empty() && d2 <= n) { long long j = *se.begin(); se.erase(j); p[d2] = j; d2++; } } } else { if (p[d1 + 1] & 1) { while (!so.empty() && d1 > 0) { long long j = *so.begin(); so.erase(j); p[d1] = j; d1--; } } else { while (!se.empty() && d1 > 0) { long long j = *se.begin(); se.erase(j); p[d1] = j; d1--; } } } } d1 = 1; while (d1 <= n && !p[d1]) d1++; d1--; d2 = n; while (d2 > 0 && !p[d2]) d2--; d2++; if (p[1] == 0) { if (p[d1 + 1] & 1) { while (!so.empty() && d1 > 0) { long long j = *so.begin(); so.erase(j); p[d1] = j; d1--; } } else { while (!se.empty() && d1 > 0) { long long j = *se.begin(); se.erase(j); p[d1] = j; d1--; } } } if (p[n] == 0) { if (p[d2 - 1] & 1) { while (!so.empty() && d2 <= n) { long long j = *so.begin(); so.erase(j); p[d2] = j; d2++; } } else { while (!se.empty() && d2 <= n) { long long j = *se.begin(); se.erase(j); p[d2] = j; d2++; } } } for (long long i = 1; i <= n && !so.empty() && !se.empty(); i++) { if (!p[i]) { if (p[i - 1] & 1) { long long j = *so.begin(); so.erase(j); p[i] = j; } else { long long j = *se.begin(); se.erase(j); p[i] = j; } } } long long i = 1; for (auto j : se) { while (p[i] && i <= n) i++; p[i] = j; } for (auto j : so) { while (p[i] && i <= n) i++; p[i] = j; } long long ans = 0; for (long long i = 2; i <= n; i++) { if (p[i] % 2 != p[i - 1] % 2) ans++; } cout << ans; } int32_t main() { vrikodara(); long long t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long vis[1009]; vector<long long> v[1000]; long long th, n; void dfs(long long s) { if (vis[s]) return; vis[s] = 1; for (long long i = 0; i < v[s].size(); i++) { if (s <= n) th++; dfs(v[s][i]); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long i, j, k, m, l, a, prothom = 1, kake, ans = 0; cin >> n >> m; for (i = 1; i <= n; i++) { cin >> k; while (k--) { cin >> a; v[a + n].push_back(i); v[i].push_back(a + n); } } for (i = 1; i <= n; i++) { if (vis[i] == 0) { ans++; dfs(i); } } if (ans == n && th == 0) cout << n << endl; else cout << ans - 1 << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a[7]; while (scanf( %d , &a[0]) != EOF) { int maxx = a[0]; int minn = a[0]; int ans = 0; for (int i = 1; i < 6; i++) { cin >> a[i]; } ans = (a[0] + a[1] + a[2]) * (a[0] + a[2] + a[1]) - a[0] * a[0] - a[2] * a[2] - a[4] * a[4]; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( -O3 ) using ld = long double; const long long int mod = 1000000007; const long long int inf = 1000000000000000000; const long long int rk = 256; const ld PI = 3.141592653589793; ostream& operator<<(ostream& os, pair<long long int, long long int> const& x) { os << x.first << , << x.second; return os; } template <class T> ostream& operator<<(ostream& os, vector<T> const& x) { os << { ; for (auto& y : x) os << y << ; return os << } ; } template <class T> ostream& operator<<(ostream& os, set<T> const& x) { os << { ; for (auto& y : x) os << y << ; return os << } ; } template <class Ch, class Tr, class Container> basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr>& os, Container const& x) { os << { ; for (auto& y : x) os << y << ; return os << } ; } template <class X, class Y> ostream& operator<<(ostream& os, pair<X, Y> const& p) { return os << [ << p.first << , << p.second << ] ; } const int tot = 1e6 + 5; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n; cin >> n; vector<long long int> a(2 * tot, 0); for (int i = 1; i <= n; i++) cin >> a[i]; long long int q; vector<long long int> pos(2 * tot, 0); vector<long long int> ans(2 * tot, 0); cin >> q; for (int time = 1; time <= q; time++) { long long int operation, p, x; cin >> operation; if (operation == 1) { cin >> p >> x; a[p] = x; pos[p] = time; } else { cin >> ans[time]; } } for (int i = q; i >= 1; i--) { ans[i] = max(ans[i], ans[i + 1]); } for (int i = 1; i <= n; i++) cout << max(a[i], ans[pos[i] + 1]) << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 100005, val1 = 20, val2 = 50, val3 = 120; long long in[N], sum[N]; int n; long long Sum(int pos) { if (pos < 0) return 0LL; return sum[pos]; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> in[i]; for (int i = 0; i < n; i++) { int t1 = in[i], t2 = in[i] - 90 + 1, t3 = in[i] - 1440 + 1; int pos2 = lower_bound(in, in + n, t2) - in - 1; int pos3 = lower_bound(in, in + n, t3) - in - 1; int pos1 = i - 1; long long Min = val1 + Sum(pos1); Min = min(Min, Sum(pos2) + val2); Min = min(Min, Sum(pos3) + val3); sum[i] = Min; cout << Min - sum[i - 1] << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; int n; int a[MAXN]; int inc[MAXN], p; int de[MAXN], q; bool flag; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); sort(a + 1, a + n + 1); for (int i = 3; i <= n; ++i) if (a[i] == a[i - 1] && a[i - 1] == a[i - 2]) { flag = true; break; } if (flag) { printf( NO n ); } else { printf( YES n ); a[0] = -0x3f3f3f3f; for (int i = 1; i <= n; ++i) { if (a[i - 1] == a[i]) { de[++q] = a[i]; } else inc[++p] = a[i]; } printf( %d n , p); for (int i = 1; i <= p; ++i) printf( %d , inc[i]); printf( n%d n , q); for (int i = q; i >= 1; --i) printf( %d , de[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int p, n, m, x[10005], ans; char c[10005], *s; void Init() { scanf( %d , &p); scanf( %s , c + 1); if (c[1] == - ) s = c + 1; else { c[0] = + ; s = c; } n = strlen(s); int d, t; for (int i = 0; i <= n - 1; ++i) { if (s[i] == + ) d = 1; else d = -1; ++i; if (s[i] == + ) ans += d, x[++m] = d; else if (s[i] == a ) x[++m] = d; else { t = 0; while (s[i] != * ) { t = t * 10 + (s[i] - 48) * d; ++i; } ++i; if (s[i] == + ) ans += t, x[++m] = t; else if (s[i] == a ) x[++m] = t; } i += 2; } } void Work() { sort(x + 1, x + 1 + m); for (int i = 1; i <= m; ++i) { ans += x[i] * p; ++p; } printf( %d n , ans); } int main() { Init(); Work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); } inline int lcm(int a, int b) { return (a * (b / gcd(a, b))); } inline long long int bigmod(long long int a, long long int b, long long int m) { if (b == 0) return 1 % m; long long int x = bigmod(a, b / 2, m); x = (x * x) % m; if (b % 2 == 1) { x = (x * a) % m; } return x; } inline long long int phi(long long int n) { long long int ret = n; for (long long int i = 2; i * i <= n; i++) { if (n % i == 0) { while (n % i == 0) n /= i; } ret -= ret / i; } if (n > 1) { ret -= ret / n; } return ret; } long long int missing_number(long long int A[], long long int n) { long long int x1 = A[0], x2 = 1; for (int i = 1; i < n; i++) x1 ^= A[i]; for (int i = 2; i <= n + 1; i++) x2 ^= i; return (x1 ^ x2); } bool isFibo(long long int n) { long long int A = (5 * n * n + 4); long long int B = (5 * n * n - 4); long long int C = sqrt(A); long long int D = sqrt(B); return (A == (C * C) || B == (D * D)); } long long int classini(long long int n) { return (n & 1) ? -1 : 1; } long long int factorial(int n) { return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n; } long long int catanal(long long int n) { return (factorial(2 * n) / ((factorial(n + 1) * factorial(n)))); } string orientation_3_ordered_point(vector<pair<int, int> > V) { long long int value = (V[1].second - V[0].second) * (V[2].first - V[1].first) - (V[1].first * V[0].first) * (V[2].second - V[1].second); string res; if (value == 0) res = colinear ; value == 1 ? res = clockwise : res = counterclockwise ; return res; } int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1}; int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1}; string make_string(long long int num) { stringstream ss; ss << num; string s; ss >> s; return s; } long long int make_num(string s) { stringstream ss; long long int tmp; ss << s; ss >> tmp; return tmp; } int SET(int mask, int pos) { return (mask | (1 << pos)); } int check(int mask, int pos) { return (mask & (1 << pos)); } vector<int> G[100], win[100]; int V[100], tmp[100]; bool found = false; void dfs(int u, int des) { tmp[u] = 1; if (u == des) { found = true; return; } for (auto x : win[u]) { if (!tmp[x]) { dfs(x, des); } } } int main() { int n; cin >> n; int tot = (n * (n - 1) / 2); for (int i = 1; i < tot; i++) { int u, v; scanf( %d , &u), scanf( %d , &v); G[u].push_back(v); win[u].push_back(v); G[v].push_back(u); } for (int i = 1; i <= n; i++) { int sz = G[i].size(); memset(V, 0, sizeof(V)); memset(tmp, 0, sizeof(tmp)); for (int j = 0; j < sz; j++) { V[G[i][j]] = 1; } for (int k = 1; k <= n; k++) { found = false; if (!V[k] && k != i) { dfs(i, k); if (found == true) { i = i; k = k; } else { swap(i, k); } printf( %d , i); printf( ); ; printf( %d , k); return 0; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 5, mod = 1e9 + 7; long long n, k, pre[N], suf[N], fac[N], qx[N], qy[N]; long long mul(long long x, long long n, long long mod) { long long ans = mod != 1; for (x %= mod; n; n >>= 1, x = x * x % mod) if (n & 1) ans = ans * x % mod; return ans; } long long calc(long long n, long long k, long long qx[N], long long qy[N]) { fac[0] = pre[0] = suf[n + 2] = 1; for (long long i = 1; i <= n + 1; i++) pre[i] = pre[i - 1] * (k - qx[i] + mod) % mod, fac[i] = fac[i - 1] * i % mod; for (long long i = n + 1; i >= 1; i--) suf[i] = suf[i + 1] * (k - qx[i] + mod) % mod; long long ans = 0; for (long long i = 1; i <= n + 1; i++) { long long s = fac[i - 1] * ((n + 1 - i) & 1 ? mod - 1 : 1) % mod * fac[n + 1 - i] % mod; ans = (ans + qy[i] * (pre[i - 1] * suf[i + 1] % mod) % mod * mul(s, mod - 2, mod) % mod) % mod; } return ans; } signed main() { scanf( %lld%lld , &n, &k); for (long long i = 1; i <= k + 2; i++) qx[i] = i, qy[i] = (qy[i - 1] + mul(i, k, mod)) % mod; printf( %lld n , calc(k + 1, n, qx, qy)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, r, s, range = 0; scanf( %d%d , &n, &m); vector<int> sub[m + 1]; set<int> st; for (int i = 0; i < n; i++) { scanf( %d%d , &s, &r); sub[s].push_back(r); st.insert(s); } for (auto it : st) { int sz = sub[it].size(); range = max(range, sz); sort(sub[it].begin(), sub[it].end(), greater<int>()); for (int i = 1; i < sz; i++) { sub[it][i] += sub[it][i - 1]; } } int ans = 0; for (int i = 1; i <= range; i++) { set<int> t = st; int sum = 0; for (auto it : t) { if ((int)sub[it].size() < i) { st.erase(it); } else if (sub[it][i - 1] < 0) { st.erase(it); } else sum += sub[it][i - 1]; } ans = max(ans, sum); } printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long po[1000006]; long long sr[1000006]; long long a[1000006]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); po[0] = 1; sr[0] = 1; for (int i = 1; i <= 1000002; i++) { po[i] = po[i - 1] * 2; po[i] %= mod; } sr[1] = 3; for (int i = 2; i <= 1000002; i++) { sr[i] = ((i + 2) * po[i - 1]) % mod; } long long n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int pos = 0; long long ret = 0; for (int i = n - 1; i >= 0; i--) { long long co = sr[pos++]; long long temp = (co * a[i]) % mod; ret += temp; ret %= mod; } cout << ret << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) { if (a[i] != i + 1) { cout << i + 1; return 0; } } cout << n + 1; return 0; }
|
#include <bits/stdc++.h> using namespace std; int vis[100005], tick = 0; vector<int> G[100005]; int a[200001], b[200005]; int main() { int n, m, h, t; scanf( %d%d%d%d , &n, &m, &h, &t); for (int i = 1; i <= m; ++i) { int u, v; scanf( %d%d , &u, &v); G[u].push_back(v); G[v].push_back(u); a[i * 2 - 1] = u; b[i * 2 - 1] = v; a[i * 2] = v; b[i * 2] = u; } for (int i = 1; i <= n; ++i) sort(G[i].begin(), G[i].end()); bool flag = 0; for (int i = 1; i <= 2 * m; ++i) { int u = a[i], v = b[i]; if (G[u].size() - 1 < h || G[v].size() - 1 < t) continue; bool done = 0; if (G[u].size() > G[v].size()) { swap(u, v); done = 1; } int acnt = 0, bcnt = 0, bothcnt = 0; for (int j = 0; j < G[u].size(); ++j) { if (G[u][j] == v) continue; if (binary_search(G[v].begin(), G[v].end(), G[u][j])) { bothcnt++; } else { acnt++; } } bcnt = G[v].size() - 1 - bothcnt; if (done) { swap(acnt, bcnt); swap(u, v); } if (max(0, h - acnt) + max(0, t - bcnt) > bothcnt) continue; tick++; for (int j = 0; j < G[u].size(); ++j) if (G[u][j] != v) { vis[G[u][j]] = tick; } vector<int> A, B, BOTH; tick++; for (int j = 0; j < G[v].size(); ++j) if (G[v][j] != u) { if (vis[G[v][j]] == tick - 1) { BOTH.push_back(G[v][j]); } else { B.push_back(G[v][j]); } vis[G[v][j]] = tick; } for (int j = 0; j < G[u].size(); ++j) if (G[u][j] != v) { if (vis[G[u][j]] != tick) { A.push_back(G[u][j]); } } if (max(0, h - (int)A.size()) + max(0, t - (int)B.size()) <= (int)BOTH.size()) { flag = 1; puts( YES ); printf( %d %d n , u, v); int k = 0; while (A.size() < h) A.push_back(BOTH[k++]); while (B.size() < t) B.push_back(BOTH[k++]); for (int i = 0; i < h; ++i) printf( %d%c , A[i], n [i == h - 1]); for (int i = 0; i < t; ++i) printf( %d%c , B[i], n [i == t - 1]); break; } } if (!flag) puts( NO ); }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 5e3 + 5; char a[maxn], b[maxn]; int dp[maxn][maxn]; int main() { int n, m; cin >> n >> m; scanf( %s%s , a + 1, b + 1); int max_ = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (a[i] == b[j]) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 2); dp[i][j] = max(dp[i][j], dp[i][j - 1] - 1); dp[i][j] = max(dp[i][j], dp[i - 1][j] - 1); max_ = max(max_, dp[i][j]); } } cout << max_ << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = int(1e9) + 7; const long long int MOD64 = (long long int)(1e18) + 7; const int INF = 0x7fffffff; const long long int INF64 = 0x7fffffffffffffff; const int N = 2e4 + 200; int a[60][N]; int sum[60][N]; int dp[60][N]; int t[4 * N], lazy[4 * N]; void update_lazy(int i, int lo, int hi) { if (lazy[i]) { t[i] += lazy[i]; if (lo != hi) { lazy[i * 2] += lazy[i]; lazy[i * 2 + 1] += lazy[i]; } lazy[i] = 0; } } int update(int i, int lo, int hi, int l, int r, int val) { update_lazy(i, lo, hi); if (lo > r || hi < l) return t[i]; if (l <= lo && hi <= r) { t[i] += val; if (lo != hi) { lazy[i * 2] += val; lazy[i * 2 + 1] += val; } return t[i]; } int mid = (lo + hi) / 2; return t[i] = max(update(i * 2, lo, mid, l, r, val), update(i * 2 + 1, mid + 1, hi, l, r, val)); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = int(1); i < int(n + 1); i++) { for (int j = int(1); j < int(m + 1); j++) { cin >> a[i][j]; sum[i][j] = sum[i][j - 1] + a[i][j]; } } int mm = m - k + 1; for (int i = int(1); i < int(mm + 1); i++) dp[1][i] = sum[1][i + k - 1] - sum[1][i - 1] + sum[2][i + k - 1] - sum[2][i - 1]; for (int i = int(2); i < int(n + 1); i++) { memset(t, 0, sizeof(t)); memset(lazy, 0, sizeof(lazy)); for (int j = int(1); j < int(mm + 1); j++) update(1, 1, mm, j, j, dp[i - 1][j]); for (int j = int(1); j < int(k + 1); j++) update(1, 1, mm, 1, j, -a[i][j]); for (int j = int(1); j < int(mm + 1); j++) { dp[i][j] = t[1] + sum[i][j + k - 1] - sum[i][j - 1] + sum[i + 1][j + k - 1] - sum[i + 1][j - 1]; if (j != mm) { update(1, 1, mm, max(1, j - k + 1), j, a[i][j]); update(1, 1, mm, j + 1, j + k, -a[i][j + k]); } } } cout << *max_element(dp[n] + 1, dp[n] + mm + 1) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long v[200005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long tc; cin >> tc; while (tc--) { long long n; cin >> n; for (long long int i = 0; i < n; i++) { cin >> v[i]; } long long i = n - 1, prev = 0; while (v[i] >= prev && i >= 0) { prev = v[i]; i--; } while (v[i] <= prev && i >= 0) { prev = v[i]; i--; } cout << i + 1 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 105; int n, m, c[N], s[N]; bool cmp(int a, int b) { return a > b; } int main() { int cnt = 0, p = 0, q = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &m); int tmp = m / 2; for (int j = 0; j < m; j++) { scanf( %d , &c[j]); if (j < tmp) p += c[j]; else q += c[j]; } if (m & 1) { q -= c[tmp]; s[cnt++] = c[tmp]; } } sort(s, s + cnt, cmp); for (int i = 0; i < cnt; i++) { if (i & 1) q += s[i]; else p += s[i]; } printf( %d %d n , p, q); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1200; int n; const double eps = 1e-9; double c, t; double dp[110][110][1110]; double skill[110]; pair<int, int> a[N]; inline bool cmp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; } inline long long get() { int ss = 0; for (int i = 1; i <= n; ++i) ss += a[i].second; for (int i = 0; i <= n; ++i) for (int j = 0; j <= n; ++j) for (int b = 0; b <= ss; ++b) dp[i][j][b] = 1e9; double s = 1; skill[0] = s; dp[0][0][0] = 0; for (int k = 1; k <= n; ++k) skill[k] = skill[k - 1] * 0.9; for (int i = 1; i <= n; ++i) { for (int k = 0; k <= n; ++k) for (int b = 0; b <= ss; ++b) { dp[i][k][b] = min(dp[i][k][b], dp[i - 1][k][b]); if (k > 0 && b >= a[i].second) { double was = dp[i - 1][k - 1][b - a[i].second]; was += a[i].first / skill[k]; dp[i][k][b] = min(dp[i][k][b], was); } } } int ans = 0; for (int i = 0; i <= n; ++i) { if (i * 10 > t) continue; for (int b = 0; b <= ss; ++b) { double timer = dp[n][i][b]; if (timer + 10 * i - eps <= t) ans = max(ans, b); else { double l = 1, r = t * c + 1; for (int it = 1; it <= 100; ++it) { double m1 = l + (r - l) / 3.0; double m2 = r - (r - l) / 3.0; if (timer / m1 + (m1 - 1) / c <= timer / m2 + (m2 - 1) / c) r = m2; else l = m1; } double ti = timer / l + (l - 1) / c; if (ti - eps + i * 10 <= t) ans = max(ans, b); } } } return ans; } inline void solve() { cin >> n >> c >> t; for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second; sort(a + 1, a + n + 1, cmp); cout << get() << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); int tc; cin >> tc; while (tc--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[200000]; int calculate(int x, int y) { int pos1 = -1, pos2 = -1; for (int i = x; i <= y; i++) { if (a[i] != -1) { if (pos1 == -1) pos1 = i; else if (pos2 == -1) pos2 = i; else break; } } if (pos2 == -1) return 1; int dst = pos2 - pos1; int htd = a[pos2] - a[pos1]; int abhtd = abs(htd); if (abhtd % dst != 0) return 1 + calculate(pos2, y); int diff = htd / dst; int j = pos1 - 1; long long exp = a[pos1] - diff; while (j >= x) { if (exp <= 0) break; exp -= diff; j--; } if (j != x - 1) return 1 + calculate(pos2, y); j = pos2 + 1, exp = a[pos2] + diff; while (j <= y) { if (exp <= 0) break; if (a[j] != exp && a[j] != -1) break; exp += diff; j++; } int offset = 0; if (j != y + 1) offset = calculate(j, y); return offset + 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cout << calculate(0, n - 1) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long t[200025 * 4], lz[200025 * 4], n, a[200025]; void build(int l, int r, int i) { t[i] = 1ll * l * (l - 1) / 2; if (l == r) return; build(l, (l + r) / 2, i * 2 + 1); build((l + r) / 2 + 1, r, i * 2 + 2); t[i] = max(t[i * 2 + 1], t[i * 2 + 2]); } void down(int i) { lz[i * 2 + 1] += lz[i]; lz[i * 2 + 2] += lz[i]; t[i * 2 + 1] += lz[i]; t[i * 2 + 2] += lz[i]; lz[i] = 0; } void updata(int L, int R, long long v, int l, int r, int i) { if (L <= l && R >= r) { t[i] += v; lz[i] += v; return; } if (lz[i]) down(i); if (L <= (l + r) / 2) updata(L, R, v, l, (l + r) / 2, i * 2 + 1); if (R > (l + r) / 2) updata(L, R, v, (l + r) / 2 + 1, r, i * 2 + 2); t[i] = max(t[i * 2 + 1], t[i * 2 + 2]); } int query(long long v, int l, int r, int i) { if (l == r) return l; if (lz[i]) down(i); if (t[i * 2 + 1] >= v) return query(v, l, (l + r) / 2, i * 2 + 1); return query(v, (l + r) / 2 + 1, r, i * 2 + 2); } int main() { cin >> n; for (int i = (1); i <= (n); i++) scanf( %lld , &a[i]); build(1, n, 0); for (int i = (n); i >= (1); i--) { a[i] = query(a[i], 1, n, 0); if (a[i] < n) updata(a[i] + 1, n, -a[i], 1, n, 0); updata(a[i], a[i], -1e12, 1, n, 0); } for (int i = (1); i <= (n); i++) printf( %lld%c , a[i], i == n ? n : ); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:640000000 ) using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); template <class T> T sqr(T x) { return x * x; } const int maxn = (int)(1e5) + 10; const int inf = (int)(2e9); struct Edge { int to, w, num; Edge() : to(0), w(0), num(0) {} Edge(int to, int w, int num) : to(to), w(w), num(num) {} }; int n, L; int x[maxn], d[maxn], t[maxn], p[maxn]; vector<Edge> g[2 * maxn]; vector<int> pt; int dist[2 * maxn], pred[2 * maxn], num[2 * maxn]; int main() { scanf( %d%d , &n, &L); set<int> spt; spt.insert(0); pt.push_back(0); spt.insert(L); pt.push_back(L); for (int i = 0; i < n; i++) { scanf( %d%d%d%d , &x[i], &d[i], &t[i], &p[i]); if (d[i] <= t[i] || x[i] - p[i] < 0) continue; if (spt.find(x[i] - p[i]) == spt.end()) { pt.push_back(x[i] - p[i]); spt.insert(x[i] - p[i]); } if (spt.find(x[i] + d[i]) == spt.end()) { pt.push_back(x[i] + d[i]); spt.insert(x[i] + d[i]); } } sort(pt.begin(), pt.end()); int N = (int)((pt).size()); for (int i = 0; i < n; i++) { if (d[i] <= t[i] || x[i] - p[i] < 0) continue; int v = int(lower_bound(pt.begin(), pt.end(), x[i] - p[i]) - pt.begin()); int u = int(lower_bound(pt.begin(), pt.end(), x[i] + d[i]) - pt.begin()); g[v].push_back(Edge(u, p[i] + t[i], i + 1)); } for (int i = 0; i < N - 1; i++) { g[i].push_back(Edge(i + 1, pt[i + 1] - pt[i], 0)); g[i + 1].push_back(Edge(i, pt[i + 1] - pt[i], 0)); } set<pair<int, int> > sd; for (int i = 0; i < N; i++) { dist[i] = inf; pred[i] = -1; num[i] = 0; } dist[0] = 0; sd.insert(make_pair(0, 0)); while (!sd.empty()) { int v = sd.begin()->second; sd.erase(sd.begin()); for (int i = 0; i < g[v].size(); i++) { if (dist[g[v][i].to] > dist[v] + g[v][i].w) { sd.erase(make_pair(dist[g[v][i].to], g[v][i].to)); dist[g[v][i].to] = dist[v] + g[v][i].w; pred[g[v][i].to] = v; num[g[v][i].to] = g[v][i].num; sd.insert(make_pair(dist[g[v][i].to], g[v][i].to)); } } } cout << dist[N - 1] << endl; vector<int> trp; for (int v = N - 1; pred[v] != -1; v = pred[v]) { if (num[v] != 0) trp.push_back(num[v]); } reverse(trp.begin(), trp.end()); cout << (int)((trp).size()) << endl; for (int i = 0; i < (int)((trp).size()); i++) { cout << trp[i] << ; } return 0; }
|
//#include /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1/bits/stdc++.h #include <bits/stdc++.h> using namespace std; //#include <atcoder/dsu> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; // #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> #define int long long int #define endl n #define MOD 1000000007 #define mod 1000000007 #define M 1000000007 #define pb push_back #define take(a,b,c) for(int b=0;b<c;b++) cin>>a[b] #define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define mx 1000005 #define fiint(a,b) memset(a,b,sizeof(a)) #define bitcount __builtin_popcount #define fori(i,a,b) for(int i=a;i<b;i++) #define ford(i,a,b) for(int i=a;i>=b;i--) #define debug(x) cout<<x<<endl; #define cases(t) int t; cin>>t; while(t--) #define inf1 INT_MAX #define all(a) a.begin(),a.end() #define vec vector<int> #define pii pair<int,int> #define plii pair<int,int> #define pint pair<int,int> #define ff first #define ss second #define lb lower_bound #define ub upper_bound #define bs binary_search #define mp make_pair #define sz(x) (int)x.size() #define PI 3.14159265359 //const long long INF=1e18; bool chmin(int& a, int b){ if(a > b){ a = b; return 1; } return 0; } int factorial[10000001]={0}; int gcd(int a, int b){ if (b == 0) return a; return gcd(b, a % b); } int powerFunction(int x,int y){ int res = 1; // int p = mod; x = x; while (y > 0) { if (y & 1) res = (res*x) ; y = y>>1; x = (x*x) ; } return res; } void factorialFunction(int maxLimit){ factorial[0]=1; for(int i=1 ; i <= maxLimit ; i++) factorial[i]=(factorial[i-1]*i)%MOD; return; } int nCr(int n, int r) { if(r < 0 || r > n){ return 0; } int temp = factorial[n]; temp *= (powerFunction(factorial[r], MOD-2)%MOD); temp %= MOD; temp *= (powerFunction(factorial[n-r], MOD-2)%MOD); temp %= MOD; return temp; } signed main() { cases(t){ pair<int,int> a , b , f; cin >> a.ff >> a.ss >> b.ff >> b.ss >> f.ff>> f.ss; if( (a.ff == b.ff && b.ff == f.ff && min(a.ss , b.ss) < f.ss && max(a.ss,b.ss) > f.ss ) || (a.ss == b.ss && b.ss == f.ss &&min(a.ff , b.ff) < f.ff && max(a.ff,b.ff) > f.ff )) cout <<abs(a.ff - b.ff) + abs(a.ss - b.ss) + 2 << endl; else cout <<abs(a.ff - b.ff) + abs(a.ss - b.ss)<<endl; } }
|
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T_container, typename T = typename enable_if< !is_same<T_container, string>::value, typename T_container::value_type>::type> ostream &operator<<(ostream &os, const T_container &v) { os << { ; string sep; for (const T &x : v) os << sep << x, sep = , ; return os << } ; } void dbg_out() { cerr << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << << H; dbg_out(T...); } const int MX = 1e5 + 1; int cnt = 0; vector<int> adj[MX]; bool vis[MX]; void dfs(int node) { if (vis[node]) return; vis[node] = true; for (auto &u : adj[node]) if (!vis[u]) dfs(u); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; unordered_map<int, bool> mp; for (int i = 1; i <= n; ++i) { int tmp; cin >> tmp; adj[i].emplace_back(tmp); adj[tmp].emplace_back(i); } for (int i = 1; i <= n; ++i) { if (vis[i]) continue; ++cnt; dfs(i); } cout << cnt << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x1, y1, x2, y2; while (scanf( %*d %*d %d %d %d %d , &x1, &y1, &x2, &y2) == 4) { int a = abs(x1 - x2), b = abs(y1 - y2); if (min(a, b) <= 2 && max(a, b) < 5) puts( First ); else if (max(a, b) < 4) puts( First ); else puts( Second ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)2e5 + 5; vector<int> g[N], son[N]; bool used[N]; int tin[N], tout[N], tup[N]; vector<int> fstep[N]; int start = -1, a, b, c; void dfs(int v, int p) { static int TIME = 0; tin[v] = TIME++; tup[v] = tin[v]; used[v] = true; for (int u : g[v]) { if (u == p) continue; if (used[u]) { tup[v] = min(tup[v], tin[u]); } else { son[v].push_back(u); dfs(u, v); tup[v] = min(tup[v], tup[u]); } } for (int x : g[v]) { fstep[x].clear(); } for (int x : g[v]) { if (tin[x] < tin[v]) { fstep[p].push_back(x); } else { auto it = lower_bound((son[v]).begin(), (son[v]).end(), x, [&](int _x, int __x) { return tout[_x] < tout[__x]; }); if (tup[*it] < tin[v]) fstep[p].push_back(x); else fstep[*it].push_back(x); } } for (int x : g[v]) { if (start == -1 && (int)(fstep[x]).size() >= 3) { start = v; a = fstep[x][0]; b = fstep[x][1]; c = fstep[x][2]; } } tout[v] = TIME++; } bool inPath[N]; int par[N]; bool dfs2(int v, vector<int>& path, function<bool(int)> stop) { if (stop(v)) { path.push_back(v); for (int u = v; par[u] != u; u = par[u]) path.push_back(par[u]); reverse((path).begin(), (path).end()); return true; } used[v] = true; for (int u : g[v]) { if (u != start && !used[u]) { par[u] = v; if (dfs2(u, path, stop)) return true; } } return false; } int main() { int n, m; scanf( %d %d , &n, &m); while (m--) { int u, v; scanf( %d %d , &u, &v); --u; --v; g[u].push_back(v); g[v].push_back(u); } for (int x = 0; x < n; ++x) { if (!used[x]) dfs(x, x); } if (start == -1) { printf( NO n ); return 0; } vector<int> p1; par[a] = a; memset(used, false, sizeof used); dfs2(a, p1, [&](int x) { return x == b; }); for (int x : p1) inPath[x] = true; vector<int> p2; par[c] = c; memset(used, false, sizeof used); dfs2(c, p2, [&](int x) { return inPath[x]; }); int finish = p2.back(); vector<int> out[3]; out[0].push_back(start); for (int pos = 0; p1[pos] != finish; ++pos) out[0].push_back(p1[pos]); out[0].push_back(finish); out[1].push_back(start); for (int pos = (int)(p1).size() - 1; p1[pos] != finish; --pos) out[1].push_back(p1[pos]); out[1].push_back(finish); out[2].push_back(start); for (int x : p2) out[2].push_back(x); printf( YES n ); for (int ii = 0; ii < 3; ++ii) { printf( %d , (int)(out[ii]).size()); for (int x : out[ii]) printf( %d , x + 1); printf( n ); } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 9; const int MAXN = 100005; struct disj { int pa[MAXN], sz[MAXN]; void init(int n) { for (int i = 0; i <= n; i++) { pa[i] = i; sz[i] = 1; } } int find(int x) { return pa[x] = (pa[x] == x ? x : find(pa[x])); } bool uni(int p, int q) { p = find(p); q = find(q); if (p == q) return 0; pa[q] = p; sz[p] += sz[q]; return 1; } } disj; int main() { int n, m; scanf( %d %d , &n, &m); disj.init(n); int ans = 1; while (m--) { int s, e; scanf( %d %d , &s, &e); if (!disj.uni(s, e)) ans = (ans * 2) % mod; printf( %d n , ans - 1); } }
|
#include <bits/stdc++.h> using namespace std; struct Node { int x, t, whe, s, s2; } a[100100]; int n, t_cnt, V, ans, ans2, Mint = (1 << 30); int f[100100], f2[100100], Max[100100 * 4], Max2[100100 * 4]; bool cmp(Node x, Node y) { return x.s > y.s || (x.s == y.s && x.s2 < y.s2); } bool cmp2(Node x, Node y) { return x.s2 < y.s2 || (x.s2 == y.s2 && x.t < y.t); } int Maxans1, Maxans2; void find(int node, int l, int r, int ll, int rr) { if (l > rr || ll > r) return; if (ll <= l && rr >= r) { Maxans1 = max(Max[node], Maxans1); Maxans2 = max(Max2[node], Maxans2); return; } int mid = (l + r) >> 1, son = node << 1; find(son, l, mid, ll, rr); find(son | 1, mid + 1, r, ll, rr); } void push(int node, int l, int r, int hig, int whe) { if (l == r) { Max[node] = max(f[whe], Max[node]); Max2[node] = max(f2[whe], Max2[node]); return; } int mid = (l + r) >> 1, son = node << 1; if (hig > mid) push(son | 1, mid + 1, r, hig, whe); else push(son, l, mid, hig, whe); Max[node] = max(Max[son], Max[son | 1]); Max2[node] = max(Max2[son], Max2[son | 1]); } void work() { for (int i = 1; i <= n; i++) { Maxans1 = 0; Maxans2 = 0; find(1, 1, t_cnt, 1, a[i].s2); if (!Maxans1) { if (a[i].t * V >= abs(a[i].x)) f[i] = 1; } else f[i] = Maxans1 + 1; f2[i] = Maxans2 + 1; push(1, 1, t_cnt, a[i].s2, i); ans = max(f[i], ans); ans2 = max(f2[i], ans2); } printf( %d %d , ans, ans2); } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d %d , &a[i].x, &a[i].t); } cin >> V; for (int i = 1; i <= n; i++) a[i].s = a[i].x - a[i].t * V, a[i].s2 = a[i].x + a[i].t * V; sort(a + 1, a + n + 1, cmp2); for (int i = 1; i <= n; i++) { if (a[i].s2 != a[i - 1].s2) t_cnt++; a[i].s2 = t_cnt; } sort(a + 1, a + n + 1, cmp); work(); }
|
#include <bits/stdc++.h> using namespace std; bool chmin(int64_t& a, const int64_t& b) { return b < a ? a = b, 1 : 0; } bool chmax(int64_t& a, const int64_t& b) { return a < b ? a = b, 1 : 0; } constexpr int pct(int x) { return __builtin_popcount(x); } constexpr int bits(int x) { return 31 - __builtin_clz(x); } const int N = 1e6 + 1; int64_t binpow(int64_t a, int64_t b, int64_t m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } void run_case() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; set<int> second, ans, prev; for (int i = 0; i < n; i++) { second.insert(a[i]); for (auto it : prev) { second.insert(a[i] | it); } prev.clear(); for (auto it : second) { prev.insert(it); ans.insert(it); } second.clear(); } cout << ans.size(); } auto clk = clock(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) { run_case(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; inline int add(int a, int b) { return a + b < mod ? a + b : a + b - mod; } inline int mul(int a, int b) { return int(1LL * a * b % mod); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<string> s(n); for (int i = 0; i < n; i++) { cin >> s[i]; } int pw = 1; int ans = 0; int t = (int)s[0].size(); for (int i = 0; i < t; i++) { for (string xd : s) { int at = mul(xd.back() - 0 , pw); ans = add(ans, mul(at, n)); } pw = mul(pw, 10); for (string &xd : s) { int at = mul(xd.back() - 0 , pw); ans = add(ans, mul(at, n)); xd.pop_back(); } pw = mul(pw, 10); } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100001]; vector<int> v[100001]; int it = 1; long double e[100001]; int dfs(const int i) { a[i] = 1; for (int j : v[i]) { int p = dfs(j); a[i] += p; } return a[i]; } void dfs2(int i, long double t) { e[i] = t; for (int j : v[i]) { dfs2(j, t + ((long double)(a[i] - a[j] - 1)) / 2 + 1.0); } } int main() { int n; cin >> n; for (int i = 2; i <= n; i++) { int a; cin >> a; v[a].push_back(i); } dfs(1); dfs2(1, 1.0); cout << setprecision(10); for (int i = 1; i <= n; i++) { cout << e[i] << ; } cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)3e6 + 11; using ll = long long; ll cnt[N]; ll pre[N]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); cnt[x]++; } for (int i = 1; i < N; i++) for (int j = 1; i * j < N; j++) { if (i == j) pre[i * j] += cnt[i] * (cnt[i] - 1); else pre[i * j] += cnt[i] * cnt[j]; } for (int i = 1; i < N; i++) pre[i] += pre[i - 1]; int q; scanf( %d , &q); ll all = ll(n) * (n - 1); while (q--) { ll x; scanf( %d , &x); printf( %lld n , all - pre[x - 1]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, q; long long m, w[100000]; vector<long long> phiChain; long long modPow(long long a, long long p, long long mod) { return (p ? modPow((a * a) % mod, p / 2, mod) * ((p & 1) ? a : 1) : 1) % mod; } long long phi(long long x) { long long temp = x; for (int i = 2; i * i <= temp; i++) { if (temp % i == 0) x = x / i * (i - 1); while (temp % i == 0) temp /= i; } if (temp > 1) x = x / temp * (temp - 1); return x; } long long getRemaining(int l, int r) { if (w[l] == 1) return 1; if (w[l] >= 50) return 50; if (r == l + 1) return w[l]; int z = 1, c = 0; while (z <= 50) z *= w[l], c++; int re = getRemaining(l + 1, r); if (re >= c) return 50; else return modPow(w[l], re, 100); } long long solve(int l, int r, int idx) { if (r == l + 1) return w[l] % phiChain[idx]; if (phiChain[idx] == 1) return 0; int remaining = getRemaining(l + 1, r); if (remaining < 50) return modPow(w[l], remaining, phiChain[idx]); return modPow(w[l], phiChain[idx + 1] + solve(l + 1, r, idx + 1), phiChain[idx]); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < (n); i++) cin >> w[i]; phiChain.push_back(m); while (phiChain.back() > 1) phiChain.push_back(phi(phiChain.back())); cin >> q; for (int i = 0; i < (q); i++) { int l, r; cin >> l >> r; l--; cout << solve(l, r, 0) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; string ans = ; int cnt = 0; for (int i = n - 1; i >= 0; i--) { if (s[i] == 1 ) { if (cnt > 0) { while (i >= 0 && s[i] == 1 ) i--; cnt = 1; i++; } else ans += 1 ; } else { cnt++; } } while (cnt--) ans += 0 ; reverse(ans.begin(), ans.end()); cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; int a[300005], b[300005]; int main() { int i, k, t, x, y, n, q, num1, num2; string s; scanf( %d , &t); for (i = 0; i < t; i++) { scanf( %d %d , &n, &q); cin >> s; s = + s; for (k = 0; k <= n; k++) a[k] = b[k] = 0; if (s[1] == + ) a[1] = a[2] = 1; else a[1] = a[2] = -1; if (s[2] == + ) b[2] = 1; else b[2] = -1; for (k = 3; k <= n; k++) { if (k % 2 == 1) { if (s[k] == + ) a[k] = a[k - 2] + 1; else a[k] = a[k - 2] - 1; b[k] = b[k - 1]; } else { if (s[k] == + ) b[k] = b[k - 2] + 1; else b[k] = b[k - 2] - 1; a[k] = a[k - 1]; } } for (k = 0; k < q; k++) { scanf( %d %d , &x, &y); num1 = a[y] - a[x - 1]; num2 = b[y] - b[x - 1]; if (abs(num1 - num2) > 2) { if (abs(num1 - num2) % 2 == 1) printf( 1 n ); else printf( 2 n ); } else printf( %d n , abs(num1 - num2)); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const long double PI = 3.141592653589793238462643383279502884197; priority_queue<int, vector<int>, greater<int> > pq; vector<int> v; char s[300001]; int main() { int n; scanf( %d , &n); scanf( %s , s); int mav = s[0], mavi = 0; for (int i = 1; i < n; i++) { if (s[i] < mav) return !printf( YES n%d %d , mavi + 1, i + 1); if (mav < s[i]) { mav = s[i]; mavi = i; } } printf( NO ); }
|
#include <bits/stdc++.h> using namespace std; int vis[3010][3010]; int A[3010], canKill[3010], canNotKill[3010], n, k; queue<pair<int, int> > q; void insert(int i, int j, int t) { if (t > k) return; if (vis[i][j] == -1) { vis[i][j] = t; q.push(make_pair(i, j)); } } void killi(int i, int j, int t) { if (canKill[j] && A[i] != 100) insert(j, j + 1, t); } void killj(int i, int j, int t) { if (A[i] && canNotKill[j]) insert(i, j + 1, t); } void killBoth(int i, int j, int t) { if (A[i] && canKill[j]) insert(j + 1, j + 2, t); } int bfs() { memset(vis, -1, sizeof vis); vis[0][1] = 0; int ans = 0; q.push(make_pair(0, 1)); while (!q.empty()) { int i = q.front().first, j = q.front().second; q.pop(); ans++; if (j >= n) continue; killBoth(i, j, vis[i][j] + 1); killi(i, j, vis[i][j] + 1); killj(i, j, vis[i][j] + 1); } return ans; } int main() { scanf( %d %d , &n, &k); for (int i = 0; i < (n); i++) scanf( %d , A + i); for (int i = n - 1; i >= 0; i--) canKill[i] = max(canKill[i + 1], A[i]); canNotKill[n] = 1; for (int i = n - 1; i >= 0; i--) canNotKill[i] = (A[i] != 100) && canNotKill[i + 1]; cout << bfs() << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { double n, k; cin >> n >> k; cout << ((long long)ceil((2 * n) / k) + (long long)ceil((5 * n) / k) + (long long)ceil((8 * n) / k)); }
|
#include <bits/stdc++.h> using namespace std; ifstream in; ofstream out; const long long kk = 1000; const long long ml = kk * kk; const long long mod = ml * kk + 7; const long long inf = ml * ml * ml + 7; const long long gs = 500 * kk; long n, m, i, j, k, ans; vector<long> reb[gs + 10]; set<long long> all; map<long long, vector<pair<long long, long long>>> mp; vector<long long> z, st; long long col[gs + 10]; long long tc[gs + 10]; bool viv = false; void DFS(long v, long c) { col[v] = c; long l = reb[v].size(); for (long i = 0; i < l; i++) { long s = reb[v][i]; if (col[s] == -1) { DFS(s, c + 1); } } } void BFS(long v) { vector<long> st; st.push_back(v); long s = 0; tc[v] = 0; while (s < st.size()) { long e = st[s]; long l = reb[e].size(); for (long i = 0; i < l; i++) { long s = reb[e][i]; if (tc[s] == -1) { st.push_back(s); tc[s] = tc[e] + 1; } } s++; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> k; for (i = 0; i < n; i++) { long long a; cin >> a; z.push_back(a); } for (i = 0; i < m; i++) { long a, b; cin >> a >> b; a--; b--; all.insert(z[a] ^ z[b]); mp[z[a] ^ z[b]].push_back({a, b}); } for (i = 0; i < n; i++) col[i] = -1; st.push_back(1); for (i = 0; i < ml; i++) st.push_back((st.back() * 2) % mod); ans = 0; ans = (((st[k] - all.size() + mod) % mod) * (st[n])) % mod; for (auto x : all) { set<long long> ver; for (auto e : mp[x]) ver.insert(e.first), ver.insert(e.second); for (auto v : ver) reb[v].clear(), col[v] = -1; for (auto e : mp[x]) reb[e.first].push_back(e.second), reb[e.second].push_back(e.first); long long comp = 0; for (auto v : ver) if (col[v] == -1) DFS(v, 1), comp++; comp += n - ver.size(); ans += st[comp]; ans %= mod; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, i; cin >> n; vector<long long int> a(n), b, c; for (i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); for (i = 0; i < n; i++) { if (a[i] % 2 == 0) b.push_back(a[i]); else c.push_back(a[i]); } long long int s = b.size(), f = c.size(); long long int check = 0, j; if (s % 2 == 0 && f % 2 == 0) cout << YES << endl; else if (s % 2 != 0 && f % 2 != 0) { for (i = 0; i < b.size(); i++) { for (j = 0; j < c.size(); j++) { if (abs(b[i] - c[j]) == 1) { check = 1; break; } } if (check == 1) break; } if (check == 1) cout << YES << endl; else cout << NO << endl; } else { cout << NO << endl; } } int main() { long long int t; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long long POW(long long a, long long b, long long MMM = MOD) { long long ret = 1; for (; b; b >>= 1, a = (a * a) % MMM) if (b & 1) ret = (ret * a) % MMM; return ret; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long lcm(long long a, long long b) { if (a == 0 || b == 0) return a + b; return a * (b / gcd(a, b)); } int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1}; int ddx[] = {-1, -2, 1, -2, 2, -1, 2, 1}, ddy[] = {-2, -1, -2, 1, -1, 2, 1, 2}; pair<int, int> a[200000]; int c[20], b[200000]; int n; bool ok(int k) { for (int(i) = (0); (i) <= (n - 1); (i) += (1)) a[i] = make_pair(b[i] >= (1 << k) ? 0 : b[i], i); for (int(i) = (k - 1); (i) >= (0); (i) -= (1)) { int t = max_element(a, a + n) - a; swap(a[0], a[t]); if (a[0].first == 0) return 0; if (31 - __builtin_clz(a[0].first) != i) return 0; c[i] = b[a[0].second]; for (int(j) = (n - 1); (j) >= (0); (j) -= (1)) if (a[j].first & (1 << i)) a[j].first ^= a[0].first; } printf( %d n , k); int now = 0; for (int(i) = (1); (i) <= (1 << k); (i) += (1)) { printf( %d , now); now ^= (c[__builtin_ctz(i)]); } return 1; } int main() { scanf( %d , &n); for (int(i) = (0); (i) <= (n - 1); (i) += (1)) { scanf( %d , &b[i]); } for (int(k) = (18); (k) >= (1); (k) -= (1)) { if (ok(k)) return 0; } puts( 0 n0 ); }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx ) #pragma GCC target( avx2 ) #pragma GCC target( fma ) namespace { const bool TEST_GEN = 0; const int K = 19, N = 1 << K; const double pi = std::acos(-1.0); struct Complex { double x, y; Complex(double x_ = 0, double y_ = 0) : x(x_), y(y_) {} Complex operator+(Complex rhs) const { return Complex(x + rhs.x, y + rhs.y); } Complex operator-(Complex rhs) const { return Complex(x - rhs.x, y - rhs.y); } Complex operator*(Complex rhs) const { return Complex(x * rhs.x - y * rhs.y, x * rhs.y + y * rhs.x); } Complex conj() const { return Complex(x, -y); } Complex& operator+=(Complex rhs) { x += rhs.x; y += rhs.y; return *this; } }; alignas(64) Complex root[N]; alignas(64) int rev[N]; void init() { for (int j = 0; j < N; j++) { int res = 0; for (int bit = 0; bit < K; ++bit) { res = res * 2 + ((j >> bit) & 1); } rev[j] = res; } for (int k = 1; k < N; k *= 2) { Complex tmp = {std::cos(pi / k), std::sin(pi / k)}; root[k] = 1; for (int i = 1; i < k; i++) { root[k + i] = ((i % 2) ? tmp : 1) * root[(k + i) / 2]; } } } template <int low, int high, typename T> void FFT(T* __restrict f) { for (int begin = 0; begin < N; begin += high) { for (int k = low; k < high; k *= 2) { for (int i = begin; i < begin + high; i += 2 * k) { #pragma GCC ivdep for (int j = 0; j < k; j++) { auto tmp = root[k + j] * f[i + j + k]; f[i + j + k] = f[i + j] - tmp; f[i + j] += tmp; } } } } } template <typename T> void FFT(T* __restrict f) { FFT<1, 1024>(f); FFT<1024, 1024 * 32>(f); FFT<1024 * 32, N>(f); } alignas(64) Complex fa[N], fc[N]; template <bool ifft, typename T> void mult(const T* __restrict a, const T* __restrict b, T* __restrict c) { for (int i = 0; i < N; i++) { fa[rev[i]] = Complex(a[i], b[i]); } FFT(fa); for (int i = 0; i < N; i++) { auto fa_i = Complex(0.5, 0.0) * (fa[i] + (fa[(N - i) % N]).conj()); auto fb_i = Complex(0.0, -0.5) * (fa[i] - (fa[(N - i) % N]).conj()); fc[i] += fa_i * fb_i; } if (!ifft) return; for (int i = 0; i < N; i++) { fa[rev[i]] = fc[i]; } FFT(fa); std::reverse(fa + 1, fa + N); for (int i = 0; i < N; i++) c[i] = (int)std::round((fa[i]).x / N); } alignas(64) int a[N], b[N]; template <char ch, bool ifft> void solve(char* __restrict A, const int n, char* __restrict B, const int m, const int k, int* __restrict res) { std::memset(a, 0, sizeof a); for (int i = 0; i < n; i++) { if (A[i] == ch) { a[std::max(i - k, 0)]++; a[std::min(i + k + 1, n)]--; } } for (int i = 0, bal = 0; i < N; i++) a[i] = (bal += a[i]) > 0; for (int i = 0; i < m; i++) b[i] = (B[i] == ch); mult<ifft>(a, b, res); } } // namespace int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); init(); int n, m, k; char A[N], B[N]; if (!TEST_GEN) { std::cin >> n >> m >> k >> A >> B; } if (TEST_GEN) { n = (int)2e5; m = (int)1e5; k = 100; for (int i = 0; i < n; i++) A[i] = ACGT [std::rand() & 3]; for (int i = 0; i < m; i++) B[i] = ACGT [std::rand() & 3]; } alignas(64) static int answer[N]; std::reverse(B, B + m); solve< A , 0>(A, n, B, m, k, answer); solve< C , 0>(A, n, B, m, k, answer); solve< G , 0>(A, n, B, m, k, answer); solve< T , 1>(A, n, B, m, k, answer); int ans = 0; for (int i = 0; i < n; i++) { ans += (answer[i] >= m); } std::cout << ans << std::endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; string s; cin >> n; cin >> s; int l = 0, r = n - 1, x = 0, y = 0; while (s[l] == < ) { l++; x++; } while (s[r] == > ) { r--; y++; } cout << min(x, y) << endl; ; } return 0; }
|
#include <bits/stdc++.h> struct stack { char a[1000010]; int top; } st; void push(char val) { st.a[st.top++] = val; } int pop() { return st.a[--st.top]; } int empty() { return st.top == 0; } char s[1000010]; int main() { char t; int i, cnt = 0; gets(s); st.top = 0; for (i = 0; s[i]; i++) { if (s[i] == [ || s[i] == < || s[i] == ( || s[i] == { ) push(s[i]); else { if (empty()) { printf( Impossible ); return 0; } t = pop(); if (t == ( && s[i] != ) || t == < && s[i] != > || t == [ && s[i] != ] || t == { && s[i] != } ) cnt++; } } if (!empty()) { printf( Impossible ); return 0; } printf( %d , cnt); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; char c[5005]; int l[5005]; int r[5005]; int solve(int x) { int a = 0, b = 0; for (int i = 0; i < n; i++) { if (x < l[i] || x > r[i]) continue; else { if (c[i] == M ) a++; else b++; } } return min(a, b); } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> c[i] >> l[i] >> r[i]; int ans = 0; for (int i = 0; i < 370; i++) { ans = max(ans, 2 * solve(i)); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, sum = 0, x, y, b; cin >> n >> m; int a[n][m]; vector<pair<int, int>> v; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> a[i][j]; sum += a[i][j]; if (a[i][j] == 0) v.push_back(make_pair(i, j)); } } for (i = v.size() - 1; i >= 0; i--) { x = v[i].first; y = v[i].second; a[x][y] = min(a[x + 1][y], a[x][y + 1]); a[x][y] -= 1; sum += a[x][y]; } for (i = 0; i < n - 1; i++) { for (j = 0; j < m - 1; j++) { if (a[i][j] >= a[i + 1][j] || a[i][j] >= a[i][j + 1]) { cout << -1; return 0; } } } for (i = 0; i < m - 1; i++) { if (a[n - 1][i] >= a[n - 1][i + 1]) { cout << -1; return 0; } } for (j = 0; j < n - 1; j++) { if (a[j][m - 1] >= a[j + 1][m - 1]) { cout << -1; return 0; } } cout << sum; }
|
#include <bits/stdc++.h> using namespace std; map<int, int> M; int n, cnt, a[5001], ans[5001]; int m, k, b[5001]; bool vis[10001], used[5001]; void init() { for (int i = 2; i < 10001; i++) { if (!vis[i]) { for (int j = i + i; j < 10001; j += i) { vis[j] = true; } b[++m] = i * i; } } } int main() { init(); scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] != 0) { bool minus = a[i] < 0; if (minus) { a[i] = -a[i]; } for (int j = 1; j <= m && b[j] <= a[i]; j++) { while (a[i] % b[j] == 0) { a[i] /= b[j]; } } if (minus) { a[i] = -a[i]; } int t = M[a[i]]; if (t == 0) { M[a[i]] = ++k; a[i] = k; } else { a[i] = t; } } else { a[i] = 0; } } for (int i = 1; i <= n; i++) { cnt = 0; memset(used, false, sizeof(used)); for (int j = i; j <= n; j++) { if (used[a[j]] == false && a[j] != 0) { cnt++; used[a[j]] = true; } ans[((cnt) > (1) ? (cnt) : (1))]++; } } for (int i = 1; i <= n; i++) { printf( %d , ans[i]); if (i == n) { printf( n ); } else { printf( ); } } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.