func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; long long maxa = 0; for (int i = 0; i < k; i++) { maxa += n - i; } vector<int> pos; for (int i = 0; i < n; i++) { if (a[i] > n - k) { pos.emplace_back(i); } } sort(pos.begin(), pos.end()); long long ans = 1; for (int i = 1; i < pos.size(); i++) { ans *= pos[i] - pos[i - 1]; ans %= mod; } cout << maxa << << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = 3.141592653589793238462643383; int main() { { int n, m, k, t; cin >> n >> m >> k >> t; set<int> s; ; for (long long i = 0; i < k; i++) { int a, b; cin >> a >> b; int id = (a - 1) * m + b; s.insert(id); }; for (long long i = 0; i < t; i++) { int a, b; cin >> a >> b; int id = (a - 1) * m + b; if (s.find(id) != s.end()) cout << Waste << endl; else { auto it = lower_bound(s.begin(), s.end(), id); int d = distance(s.begin(), it); int val = (id - d) % 3; if (val == 0) cout << Grapes << endl; else if (val == 1) cout << Carrots << endl; else cout << Kiwis << endl; } } } }
|
#include <bits/stdc++.h> using namespace std; array<string, 1510> arr; unordered_set<string> f; int n, k, t = int( S + E + T ); char get(char c1, char c2) { if (c1 == c2) return c1; return t - c1 - c2; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { cin >> arr[i]; f.insert(arr[i]); } int res = 0; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) { string s = ; for (int p = 0; p < k; p++) s.push_back(get(arr[i][p], arr[j][p])); if (f.count(s)) res++; } printf( %d n , res / 3); }
|
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int n; cin >> n; vector<int> a(n); for (int& i : a) cin >> i; int M = *min_element((a).begin(), (a).end()); int c = 0; for (int& i : a) c += M == i; if (c <= n / 2) cout << Alice ; else cout << Bob ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; int n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; i++) cout << 400 << ; cout << endl; } }
|
#include <bits/stdc++.h> int _min(int a, int b) { if (a < b) return a; return b; } int _max(int a, int b) { if (a > b) return a; return b; } int main() { int i, j, k; int n; int x1, y1, x2, y2, x3, y3, res; scanf( %d %d , &x1, &y1); scanf( %d %d , &x2, &y2); scanf( %d %d , &x3, &y3); if ((x1 == x2 && x1 == x3) || (y1 == y2 && y1 == y3)) { printf( 1 ); return 0; } if (x1 == x2) { int min = _min(y1, y2); int max = _max(y1, y2); if (y3 <= min || y3 >= max) { printf( 2 ); return 0; } } if (y1 == y2) { int min = _min(x1, x2); int max = _max(x1, x2); if (x3 <= min || x3 >= max) { printf( 2 ); return 0; } } if (x1 == x3) { int min = _min(y1, y3); int max = _max(y1, y3); if (y2 <= min || y2 >= max) { printf( 2 ); return 0; } } if (y1 == y3) { int min = _min(x1, x3); int max = _max(x1, x3); if (x2 <= min || x2 >= max) { printf( 2 ); return 0; } } if (x3 == x2) { int min = _min(y3, y2); int max = _max(y3, y2); if (y1 <= min || y1 >= max) { printf( 2 ); return 0; } } if (y3 == y2) { int min = _min(x3, x2); int max = _max(x3, x2); if (x1 <= min || x1 >= max) { printf( 2 ); return 0; } } printf( 3 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, m, ax, ay, cx, cy; int d[100][100], s[100][100]; void take(int ax, int ay, int m) { for (int y = ay; y < ay + m; ++y) { for (int i = y; i <= k; ++i) ++s[ax][i]; } } int main() { while (scanf( %d%d , &n, &k) != EOF) { cx = cy = (k + 1) / 2; memset(s, 0, sizeof(s)); for (int x = 1; x <= k; ++x) for (int y = 1; y <= k; ++y) d[x][y] = d[x][y - 1] + abs(x - cx) + abs(y - cy); for (int i = 0; i < n; ++i) { scanf( %d , &m); int ax = -1, ay = -1, mini = 1000000000; for (int x = 1; x <= k; ++x) { for (int y = 1; y + m - 1 <= k; ++y) { if (s[x][y + m - 1] - s[x][y - 1] == 0) { if (d[x][y + m - 1] - d[x][y - 1] < mini) { ax = x, ay = y; mini = d[x][y + m - 1] - d[x][y - 1]; } } } } if (ax == -1) { puts( -1 ); } else { take(ax, ay, m); printf( %d %d %d n , ax, ay, ay + m - 1); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; int o = 0, s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; s = s + a[i]; if ((a[i] % 2) != 0) { o++; } } if ((s % 2) == 0) { cout << n - o; } else { cout << o; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 2 * 1e5 + 100, mod = 1e9 + 7; int n, k, a, b; int dp[5010][5010], pr[5010][5010]; int add(int a, int b) { a += b; if (a < 0) a += mod; if (a >= mod) a -= mod; return a; } int main() { scanf( %d%d%d%d , &n, &a, &b, &k); dp[0][a] = 1; for (int i = 0; i <= k; i++) { if (i != 0) { for (int j = 1; j <= n; j++) { if (j > b) { int t = ((j + b) >> 1) + 1; dp[i][j] += add(add(pr[i - 1][n], -pr[i - 1][t - 1]), -dp[i - 1][j]); } else if (j < b) { int t = ((j + b - 1) >> 1); dp[i][j] += add(pr[i - 1][t], -dp[i - 1][j]); } } } for (int j = 1; j <= n; j++) { pr[i][j] = add(pr[i][j - 1], dp[i][j]); } } cout << pr[k][n] % mod; }
|
#include <bits/stdc++.h> using namespace std; const int n0 = 1503, inf = 1e9; int n, s, m, k, a[n0], b[n0], p[n0], L[n0]; int dp[2][n0], mx[n0], best[n0]; int num(int pos) { for (int i = 1; i <= n; i++) { p[i] = p[i - 1] + (a[i] <= b[pos]); } memset(&dp, -0x3f, sizeof(dp)); int res = 0; for (int i = 1; i <= m; i++) { dp[(i - 1) & 1][0] = 0; mx[0] = dp[(i - 1) & 1][0]; for (int j = 1; j <= n; j++) { mx[j] = max(mx[j - 1], dp[(i - 1) & 1][j]); if (L[j] != n0) { if (best[j] != -1) dp[i & 1][j] = dp[(i - 1) & 1][best[j]] - p[best[j]] + p[j]; dp[i & 1][j] = max(dp[i & 1][j], mx[L[j] - 1] + p[j] - p[L[j] - 1]); if (i == m) res = max(res, dp[i & 1][j]); } } } return res; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> n >> s >> m >> k; for (int i = 1; i <= n; i++) cin >> a[i], b[i] = a[i], L[i] = n0; sort(b + 1, b + n + 1); for (int i = 0; i < s; i++) { int l, r; cin >> l >> r; L[r] = min(L[r], l); } for (int i = 1; i <= n; i++) { best[i] = -1; for (int j = L[i]; j < i; j++) { if (best[i] == -1 || L[j] < L[best[i]]) best[i] = j; } } int l = 0, r = n + 1; while (l < r - 1) { int mid = l + r >> 1; if (num(mid) >= k) r = mid; else l = mid; } if (r == n + 1) cout << -1; else cout << b[r]; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 4e4 + 44; const long long INF = 1e11 + 9; const double eps = 1e-12; int main() { int t; scanf( %d , &t); long long x1, y1, x2, y2, n, m; long long x3, y3, x4, y4; long long answ = 0, ansb = 0; while (t--) { scanf( %lld , &n); scanf( %lld , &m); if (n % 2 == 0 || m % 2 == 0) { answ = ansb = n * m / 2; } else { answ = (n * m) / 2 + 1; ansb = answ - 1; } scanf( %lld , &x1); scanf( %lld , &y1); scanf( %lld , &x2); scanf( %lld , &y2); long long dx = x2 - x1 + 1, dy = y2 - y1 + 1; if (dx % 2 == 0 || dy % 2 == 0) { answ += (dx * dy) / 2; ansb -= (dx * dy) / 2; } else { if (x1 % 2 && y1 % 2 || x1 % 2 == 0 && y1 % 2 == 0) { answ += (dx * dy) / 2; ansb -= (dx * dy) / 2; } else { answ += (dx * dy) / 2 + 1; ansb -= (dx * dy) / 2 + 1; } } scanf( %lld , &x3); scanf( %lld , &y3); scanf( %lld , &x4); scanf( %lld , &y4); dx = x4 - x3 + 1, dy = y4 - y3 + 1; if (dx % 2 == 0 || dy % 2 == 0) { answ -= (dx * dy) / 2; ansb += (dx * dy) / 2; } else { if (x3 % 2 && y3 % 2 || x3 % 2 == 0 && y3 % 2 == 0) { answ -= (dx * dy) / 2 + 1; ansb += (dx * dy) / 2 + 1; } else { answ -= (dx * dy) / 2; ansb += (dx * dy) / 2; } } long long x5, y5, x6, y6; if (y3 > y2 || y4 < y1 || x3 > x2 || x4 < x1) { printf( %lld %lld n , answ, ansb); continue; } x5 = max(x1, x3); y5 = max(y1, y3); x6 = min(x2, x4); y6 = min(y2, y4); dx = x6 - x5 + 1, dy = y6 - y5 + 1; if (dx % 2 == 0 || dy % 2 == 0) { if (x5 % 2 == 0 && y5 % 2 == 0 || x5 % 2 && y5 % 2) { answ -= dx * dy / 2; ansb += dx * dy / 2; } else { answ -= dx * dy / 2; ansb += dx * dy / 2; } } else { if (x5 % 2 && y5 % 2 || x5 % 2 == 0 && y5 % 2 == 0) { answ -= dx * dy / 2; ansb += dx * dy / 2; } else { answ -= dx * dy / 2 + 1; ansb += dx * dy / 2 + 1; } } printf( %lld %lld n , answ, ansb); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> deg(n), s(n); for (int i = 0; i < n; i++) cin >> deg[i] >> s[i]; vector<pair<int, int>> edges; queue<int> q; for (int i = 0; i < n; i++) if (deg[i] == 1) q.push(i); while (!q.empty()) { int leaf = q.front(); q.pop(); if (deg[leaf] != 1) continue; int par = s[leaf]; edges.push_back({par, leaf}); deg[par] -= 1; s[par] ^= leaf; if (deg[par] == 1) q.push(par); } cout << edges.size() << endl; for (auto p : edges) cout << p.first << << p.second << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; long long k[n]; pair<long long, long long> dt[m]; for (int i = 0; i < n; i++) cin >> k[i]; for (int i = 0; i < m; i++) cin >> dt[i].first >> dt[i].second; long long total = 0; for (int i = 0; i < n; i++) total += k[i]; long long start = 1; long long end = 2 * total; long long ans = 2 * total; while (start <= end) { long long check = start + (end - start) / 2; pair<long long, long long> last[n]; for (int i = 0; i < n; i++) { last[i].first = LONG_MAX; last[i].second = i; } for (int i = 0; i < m; i++) { if (dt[i].first <= check) { if (last[dt[i].second - 1].first == LONG_MAX) last[dt[i].second - 1].first = dt[i].first; else last[dt[i].second - 1].first = max(dt[i].first, last[dt[i].second - 1].first); } } sort(last, last + n); int point = 0; long long money = 0; long long count = 0; for (int i = 1; i <= check; i++) { money++; while (last[point].first == i) { long long deduce = min(money, k[last[point].second]); count += deduce; money -= deduce; point++; } } money -= 2 * (total - count); if (money < 0) { start = check + 1; } else { ans = check; end = check - 1; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; char c[1005], s[55], t[55]; int ns[55], nt[55]; int tos[55][30], tot[55][30]; int lenc, lens, lent; int dp[1005][55][55]; void init() { lenc = strlen(c + 1), lens = strlen(s + 1), lent = strlen(t + 1); ns[1] = 0, nt[1] = 0; for (int i = 2, j = 0; i <= lens; i++) { while (j && s[j + 1] != s[i]) j = ns[j]; if (s[j + 1] == s[i]) j++; ns[i] = j; } for (int i = 2, j = 0; i <= lent; i++) { while (j && t[j + 1] != t[i]) j = nt[j]; if (t[j + 1] == t[i]) j++; nt[i] = j; } for (int i = 0; i <= lens; i++) { for (int k = 0; k < 26; k++) { int j = i; while (j && s[j + 1] != k + a ) j = ns[j]; if (s[j + 1] == k + a ) j++; tos[i][k] = j; } } for (int i = 0; i <= lent; i++) { for (int k = 0; k < 26; k++) { int j = i; while (j && t[j + 1] != k + a ) j = nt[j]; if (t[j + 1] == k + a ) j++; tot[i][k] = j; } } } int main() { scanf( %s%s%s , c + 1, s + 1, t + 1); init(); int n = strlen(c + 1); for (int i = 0; i <= n; i++) for (int j = 0; j <= 50; j++) for (int k = 0; k <= 50; k++) dp[i][j][k] = -1000000; dp[0][0][0] = 0; for (int i = 1; i <= n; i++) { if (c[i] == * ) { for (int j = 0; j <= lens; j++) { for (int k = 0; k <= lent; k++) { if (dp[i - 1][j][k] <= -1000000) continue; for (int q = 0; q < 26; q++) { int temp1 = tos[j][q], temp2 = tot[k][q]; dp[i][temp1][temp2] = max(dp[i][temp1][temp2], dp[i - 1][j][k] + (temp1 == lens) - (temp2 == lent)); } } } } else { for (int j = 0; j <= lens; j++) { for (int k = 0; k <= lent; k++) { if (dp[i - 1][j][k] <= -1000000) continue; int q = c[i] - a ; int temp1 = tos[j][q], temp2 = tot[k][q]; dp[i][temp1][temp2] = max(dp[i][temp1][temp2], dp[i - 1][j][k] + (temp1 == lens) - (temp2 == lent)); } } } } int res = -1000000; for (int i = 0; i <= lens; i++) for (int j = 0; j <= lent; j++) res = max(res, dp[n][i][j]); cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 1000; const int MAXK = 1000; int n, K; char s[MAXN + 1]; int act[MAXN + 1][2 * MAXK + 1]; char ret[MAXN + 1]; void run() { scanf( %d%d%s , &n, &K, s); memset(act, -1, sizeof(act)); act[0][MAXK] = 1; for (int i = (0); i < (n); ++i) { int mxb = min(i, K - 1); for (int k = (-mxb); k <= (+mxb); ++k) if (act[i][MAXK + k] != -1) { for (int a = (-1); a <= (+1); ++a) { if (s[i] == L && a != -1) continue; if (s[i] == D && a != 0) continue; if (s[i] == W && a != +1) continue; act[i + 1][MAXK + k + a] = a + 1; } } } for (int k = -K; k <= +K; k += 2 * K) if (act[n][MAXK + k] != -1) { for (int i = n - 1; i >= 0; --i) { ret[i] = LDW [act[i + 1][MAXK + k]]; k -= act[i + 1][MAXK + k] - 1; } ret[n] = 0 ; printf( %s , ret); return; } printf( NO n ); } int main() { run(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string nameOne, nameTwo, tmpOne, tmpTwo; cin >> nameOne >> nameTwo; int n; cin >> n; cout << nameOne << << nameTwo << endl; for (int i = 0; i < n; i++) { cin >> tmpOne; cin >> tmpTwo; if (tmpOne == nameOne) nameOne = tmpTwo; else nameTwo = tmpTwo; cout << nameOne << << nameTwo << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve(long long int arr[], long long int n, long long int l) { for (int i = 1; i < n; i++) { arr[i] = min(arr[i], 2 * arr[i - 1]); } long long int exp[n]; for (int i = 0; i < n; i++) { exp[i] = 1LL << i; } long long int ans = LLONG_MAX; long long int val = 0; for (int i = n - 1; i >= 0; i--) { long long int currentAns = val + (l + exp[i] - 1) / exp[i] * arr[i]; ans = min(ans, currentAns); long long int x = l / exp[i]; l -= x * exp[i]; val += x * arr[i]; } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; while (t--) { long long int n, l; cin >> n >> l; long long int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } solve(arr, n, l); } }
|
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m, i, j, c; string s, f = YES ; vector<string> v; cin >> n >> m; for (i = 0; i < n; i++) { cin >> s; v.push_back(s); } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (v[i][j] == * ) continue; c = 0; if (i - 1 >= 0 && v[i - 1][j] == * ) c++; if (i - 1 >= 0 && j - 1 >= 0 && v[i - 1][j - 1] == * ) c++; if (i - 1 >= 0 && j + 1 < m && v[i - 1][j + 1] == * ) c++; if (j - 1 >= 0 && v[i][j - 1] == * ) c++; if (j + 1 < m && v[i][j + 1] == * ) c++; if (i + 1 < n && v[i + 1][j] == * ) c++; if (i + 1 < n && j - 1 >= 0 && v[i + 1][j - 1] == * ) c++; if (i + 1 < n && j + 1 < m && v[i + 1][j + 1] == * ) c++; if (c > 0 && c != v[i][j] - 0 ) f = NO ; if (!c && v[i][j] != . ) f = NO ; } } cout << f; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long fastPrime(long long n) { if (n == 2) return true; if (n % 2 == 0) return false; for (long long i = 3; i * i <= n; i++) { if (n % i == 0) return false; } return true; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, val; cin >> n; for (long long i = 0; i < n; i++) { cin >> val; long long sr = sqrt(val); if (val != 1 && fastPrime(sr) && sr * sr == val) cout << YES n ; else cout << NO n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5 + 5; template <typename T> void chkmax(T& x, T y) { if (y > x) x = y; } template <typename T> void chkmin(T& x, T y) { if (y < x) x = y; } int N, Q, a[1 << 18]; long long sum; int main() { scanf( %d%d , &N, &Q); for (int i = 0; i < (1 << N); ++i) scanf( %d , &a[i]), sum += a[i]; printf( %.7f n , sum / (double)(1 << N)); while (Q--) { int p, x; scanf( %d%d , &p, &x), sum -= a[p], a[p] = x, sum += a[p]; printf( %.7f n , sum / (double)(1 << N)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxm = 1e5 + 80; const int maxn = 5e3 + 80; const int up = 20; template <class T> void read(T &x) { x = 0; char c = getchar(); int f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + (c ^ 48); x *= f; } unsigned seed = std::chrono::system_clock::now().time_since_epoch().count(); mt19937 rand_num(seed); uniform_int_distribution<int> dist(0, 10000000); mt19937 rnd(time(NULL)); int e[maxm][2], cnt[maxm]; int f[maxm], flag, nxt; int get_rand(int from, int to) { int x = dist(rand_num) % (to - from + 1); return x + from; } bool solve(int n, int m) { shuffle(f + 1, f + 1 + n, rnd); for (int i = 2; i <= m; i++) { int u = f[i - 1], v = f[i], ti = 0; bool wa = (e[u][0] == v | e[u][1] == v); if (wa && i == n) return false; while (wa && ti < up) { int t = get_rand(i + 1, n); ti++; swap(f[i], f[t]); v = f[i]; wa = (e[u][0] == v | e[u][1] == v); } if (ti == up) return false; } nxt = 0; if (m == 2 || m == 1) nxt = 1; if (e[f[m]][0] == f[1] || e[f[m]][1] == f[1]) nxt = 1; if (nxt == 1 && n == m) return false; if (nxt == 1) { int u = f[m], v = f[m + 1], ti = 0; bool wa = (e[u][0] == v | e[u][1] == v); while (wa && ti < up) { int t = get_rand(m + 1, n); ti++; swap(f[m + 1], f[t]); v = f[m + 1]; wa = (e[u][0] == v | e[u][1] == v); } if (ti == up) return false; } flag = 1; return true; } void MC() { int n, m; read(n); read(m); for (int i = 1; i <= m; i++) { int u, v; read(u); read(v); e[u][cnt[u]++] = v; e[v][cnt[v]++] = u; } if (n == 2 && m == 2 || m > n) { printf( -1 n ); return; } flag = 0; for (int i = 1; i <= n; i++) f[i] = i; for (int i = 1; i <= up + up; i++) if (solve(n, m)) break; if (!flag) { printf( -1 n ); return; } for (int i = 2; i <= m; i++) printf( %d %d n , f[i - 1], f[i]); if (!nxt) printf( %d %d n , f[m], f[1]); else printf( %d %d n , f[m], f[m + 1]); } int main() { MC(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int nmax = 1e7 + 5; int cnt[2][nmax]; int valu[100005]; vector<int> g[100005]; int liflevel; int koyta[2]; void dfs(int u, int level = 0) { cnt[level % 2][valu[u]]++; koyta[level % 2]++; for (int v : g[u]) dfs(v, level + 1); if (g[u].empty()) liflevel = level % 2; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> valu[i]; for (int i = 2; i <= n; i++) { int p; cin >> p; g[p].push_back(i); } dfs(1); int jor = 0; long long ans = 0; for (int i = 0; i < nmax; i++) if (cnt[liflevel][i] % 2) jor ^= i; if (jor) { for (int i = 0; i < nmax; i++) { int tmp = jor ^ i; if (tmp < nmax) ans += 1LL * cnt[liflevel][i] * cnt[liflevel ^ 1][tmp]; } } else { ans += 1LL * koyta[0] * (koyta[0] - 1) / 2 + 1LL * koyta[1] * (koyta[1] - 1) / 2; for (int i = 0; i < nmax; i++) ans += 1LL * cnt[0][i] * cnt[1][i]; } cout << ans; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; const int MX = 1 << 23; int a, b, c, d, i, j, n, m, k; int lenl[MX + 1], lenr[MX + 1], cnt[MX + 1], len[MX + 1], num[MX + 1]; pair<int, int> sm[MX + 1]; map<int, int> onwork; inline int create(int l, int r) { sm[k] = make_pair(-1, -1); cnt[k] = 0; len[k] = lenl[k] = lenr[k] = r - l; num[k] = l; return k++; } inline int getcnt(int l, int r, int a, int b, int v) { if (l >= r || a > b) return 0; if (l == a && b == r - 1) return cnt[v]; int xx = (r + l) / 2; if (b < xx) { if (sm[v].first == -1) sm[v].first = create(l, xx); return getcnt(l, xx, a, b, sm[v].first); } if (a >= xx) { if (sm[v].second == -1) sm[v].second = create(xx, r); return getcnt(xx, r, a, b, sm[v].second); } if (sm[v].first == -1) sm[v].first = create(l, xx); if (sm[v].second == -1) sm[v].second = create(xx, r); return getcnt(l, xx, a, xx - 1, sm[v].first) + getcnt(xx, r, xx, b, sm[v].second); } void add(int l, int r, int first, int cc, int v) { if (l >= r || first >= r || first < l) return; if (l == r - 1) { cnt[v] = cc; num[v] = l; lenl[v] = lenr[v] = len[v] = cc ^ 1; return; } int xx = (r + l) / 2; if (sm[v].first == -1) sm[v].first = create(l, xx); if (sm[v].second == -1) sm[v].second = create(xx, r); if (first < xx) { add(l, xx, first, cc, sm[v].first); } else { add(xx, r, first, cc, sm[v].second); } lenl[v] = lenr[v] = len[v] = 0; cnt[v] = 0; { lenl[v] = lenl[sm[v].first]; len[v] = len[sm[v].first]; num[v] = num[sm[v].first]; cnt[v] = cnt[sm[v].first]; } { if (lenl[v] == xx - l) lenl[v] += lenl[sm[v].second]; lenr[v] = lenr[sm[v].second]; if (lenr[v] == r - xx) lenr[v] += lenr[sm[v].first]; if (lenr[sm[v].first] + lenl[sm[v].second] >= len[v]) { len[v] = lenr[sm[v].first] + lenl[sm[v].second]; num[v] = xx - lenr[sm[v].first]; } if (len[sm[v].second] >= len[v]) { len[v] = len[sm[v].second]; num[v] = num[sm[v].second]; } cnt[v] += cnt[sm[v].second]; } } int main() { scanf( %d%d , &n, &m); sm[0] = make_pair(-1, -1); lenl[0] = lenr[0] = len[0] = n; num[0] = 1; k = 1; for (int _n((m)-1), i(0); i <= _n; i++) { scanf( %d , &a); if (!a) { scanf( %d%d , &a, &b); printf( %d n , getcnt(1, n + 1, a, b, 0)); } else { if (onwork.count(a)) { add(1, n + 1, onwork[a], 0, 0); onwork.erase(onwork.find(a)); } else { int l = num[0], r = num[0] + len[0]; add(1, n + 1, (r + l) / 2, 1, 0); onwork[a] = (r + l) / 2; } } } }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long Bpow(long long a, long long s) { if (s == 0) { return 1; } long long u = Bpow(a, s / 2); if (s & 1) return u * u % mod * a % mod; else return u * u % mod; } int32_t main() { long long n; cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } long long ans = 0; for (long long i = 0; i < n - 2; i++) { long long now = a[i + 1]; for (long long j = i + 2; j < n; j++) { if (now > a[i] * 2) break; if ((a[i] ^ a[j]) == now && a[i] > a[j]) ++ans; now += a[j]; } } for (long long i = n - 1; i > 1; i--) { long long now = a[i - 1]; for (long long j = i - 2; j >= 0; j--) { if (now > a[i] * 2) break; if ((a[i] ^ a[j]) == now && a[i] > a[j]) ++ans; now += a[j]; } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; long long t[2003]; long long viz[2003]; pair<long long, long long> a[2003]; pair<pair<long long, long long>, long long> b[2003]; vector<long long> v[2003]; vector<pair<pair<long long, long long>, long long> > much; vector<pair<pair<long long, long long>, long long> > muchsel; bool cmp_first(pair<pair<long long, long long>, long long> a, pair<pair<long long, long long>, long long> b) { if (a.first.first == b.first.first) return a.first.second < b.first.second; return a.first.first < b.first.first; } bool cmp_second(pair<pair<long long, long long>, long long> a, pair<pair<long long, long long>, long long> b) { if (a.first.second == b.first.second) return a.first.first < b.first.first; return a.first.second < b.first.second; } bool cmp(pair<pair<long long, long long>, long long> a, pair<pair<long long, long long>, long long> b) { return a.second < b.second; } long long dist(pair<long long, long long> a, pair<long long, long long> b) { return abs(a.first - b.first) + abs(a.second - b.second); } long long root(long long x) { if (t[x] == 0) return x; t[x] = root(t[x]); return t[x]; } void calc(long long mx) { muchsel.clear(); long long rx, ry; int id = 0; for (auto val : much) { rx = root(val.first.first); ry = root(val.first.second); if (val.second > mx) return; if (rx != ry) { t[rx] = ry; viz[id] = 1; muchsel.push_back(val); } id++; } return; } long long intercl(pair<long long, long long> a, pair<long long, long long> b, pair<long long, long long> c, pair<long long, long long> d) { long long x = -1, y = -1; if (a.first == b.first) x = a.first; if (a.second == b.second) y = a.second; if (c.first == d.first) x = c.first; if (c.second == d.second) y = c.second; if (x != -1 && y != -1) { long long val1 = max(abs(x - a.first), abs(x - b.first)), val2 = max(abs(y - a.second), abs(y - b.second)), val3 = max(abs(x - c.first), abs(x - d.first)), val4 = max(abs(y - c.second), abs(y - d.second)); long long val = max(val1, max(val2, max(val3, val4))); return val; } return 2000000000000000018; } void cleart(long long n) { for (int i = 1; i <= n; ++i) t[i] = 0; } bool solve(long long n, long long t) { cleart(n); calc(t); long long sz = muchsel.size(); long long nrc = n - sz; long long rx, ry, rk, rq; if (nrc == 1) return true; if (nrc == 2) { for (int i = 1; i <= n; ++i) { rx = root(i); for (int j = i + 1; j <= n; ++j) { ry = root(j); if (rx == ry) continue; long long ds = max(abs(a[i].first - a[j].first), abs(a[i].second - a[j].second)); if (ds <= t) return true; if (a[i].first == a[j].first || a[i].second == a[j].second) if ((ds + 1) / 2 <= t) return true; } } return false; } if (nrc == 3) { for (int i = 0; i < much.size(); ++i) { rx = root(much[i].first.first); ry = root(much[i].first.second); if (rx == ry) continue; for (int j = 1; j <= n; ++j) { rk = root(j); if (rx == rk || ry == rk) continue; pair<long long, long long> e1 = a[much[i].first.first]; pair<long long, long long> e2 = a[much[i].first.second]; pair<long long, long long> e3 = a[j]; pair<long long, long long> pct = {-2000000000000000018, -2000000000000000018}; if (e1.first == e2.first) pct = {e1.first, e3.second}; if (e1.first == e3.first) pct = {e1.first, e2.second}; if (e2.first == e3.first) pct = {e2.first, e1.second}; if (e1.second == e2.second) pct = {e3.first, e1.second}; if (e1.second == e3.second) pct = {e2.first, e1.second}; if (e2.second == e3.second) pct = {e1.first, e2.second}; if (max(dist(e1, pct), max(dist(e2, pct), dist(e3, pct))) <= t) return true; } } return false; } if (nrc == 4) { for (int i = 0; i < much.size(); ++i) { rx = root(much[i].first.first); ry = root(much[i].first.second); if (rx == ry) continue; for (int j = i + 1; j < much.size(); ++j) { rk = root(much[j].first.first); rq = root(much[j].first.second); if (rk == rq || rx == rk || rx == rq || ry == rk || ry == rq) continue; if (intercl(a[much[i].first.first], a[much[i].first.second], a[much[j].first.first], a[much[j].first.second]) <= t) return true; } } return false; } return false; } int main() { long long n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i].first >> a[i].second; b[i] = {a[i], i}; } sort(b + 1, b + n + 1, cmp_first); for (int i = 1; i < n; ++i) { if (b[i].first.first == b[i + 1].first.first) { long long dif = b[i + 1].first.second - b[i].first.second, id1 = b[i].second, id2 = b[i + 1].second; if (dif < 0) dif = -dif; v[id1].push_back(id2); v[id2].push_back(id1); much.push_back({{id1, id2}, dif}); } } sort(b + 1, b + n + 1, cmp_second); for (int i = 1; i < n; ++i) { if (b[i].first.second == b[i + 1].first.second) { long long dif = b[i + 1].first.first - b[i].first.first, id1 = b[i].second, id2 = b[i + 1].second; if (dif < 0) dif = -dif; v[id1].push_back(id2); v[id2].push_back(id1); much.push_back({{id1, id2}, dif}); } } sort(much.begin(), much.end(), cmp); long long st = 1, dr = 2000000009; while (st <= dr) { long long mij = (st + dr) / 2; if (solve(n, mij)) dr = mij - 1; else st = mij + 1; } if (solve(n, dr)) cout << dr << n ; else { if (st == 2000000009 + 1) cout << -1 << n ; else cout << st << n ; } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; const double pi = acos(-1.0); const int inf = (int)1e9; const double eps = 1e-4; const int ss = (int)1e6 + 3; const int base = inf; bool pred(const pair<int, int>& i, const pair<int, int>& j) { if (i.first == j.first) { return i.second > j.second; } else { return i.first > j.first; } } int a[2000005]; int main() { int k; scanf( %d , &k); long long int res = 0; for (int i = 0; i < k; ++i) { scanf( %d , &a[i]); res += a[i]; } if (k == 1) { cout << res; return 0; } sort(a, a + k); int z = k / 4; while (z != 0) { for (int i = k - 1; i >= k - z; --i) { res += a[i]; } z /= 4; } cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const long long INFLL = 1e18 + 1; const int MAX = 200001; const long long MOD = 1000000007; long long inq(long long k, long long q) { if (q == 0) return 1; long long l = inq(k, q / 2); if (q % 2 == 0) return l * l % MOD; else return (l * l) % MOD * k % MOD; } long long gcd(long long a, long long b) { if (a < b) swap(a, b); if (b == 0) return a; return gcd(b, a % b); } long long cubr(long long a) { long long l = -1, r = 1e6 + 2; while (l < r - 1) { long long mid = (l + r) / 2; if (mid * mid * mid > a) r = mid; else l = mid; } return l; } long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { return -1 * max(-a, -b); } long long possible(long long q) { if (q == INF) return -1; return q; } bool correct(int x, int xx) { if (x < 0) return 0; if (x >= xx) return 0; return 1; } long long dsumm(long long x, long long k) { long long y = 1; long long z = 0; for (int i = 0; y < 1e18; i++) { z += x / y % k; y *= k; } return z; } long long dcount(long long x) { long long y = 1; long long z = 0; int c[100]; for (int i = 0; i < 10; i++) c[i] = 0; for (int i = 0; x > 0; i++) { if (c[x / y % 10] == 0) z++; c[x / y % 10] = 1; x /= 10; } return z; } long long lg10(long long x) { if (x == 0) return 0; return lg10(x / 10) + 1; } long long n, m; vector<int> graph[4000], graph2[4000]; long long ans; long long d[5000]; long long f[4000]; long long ff[4000]; int main() { cin >> n >> m; for (int(i) = 0; (i) != (m); i++) { int x, y; cin >> x >> y; x--; y--; graph[x].push_back(y); graph2[y].push_back(x); } long long it = 2; for (int b = 0; b < n; b++) { for (int c = b + 1; c < n; c++) { long long x = 0; long long y = 0; long long z = 0; for (int i = 0; i < graph[b].size(); i++) { d[graph[b][i]] = it; } for (int i = 0; i < graph[c].size(); i++) { if (d[graph[c][i]] == it) { x++; } } it++; for (int i = 0; i < graph2[b].size(); i++) { d[graph2[b][i]] = it; } for (int i = 0; i < graph2[c].size(); i++) { if (d[graph2[c][i]] == it) { y++; } } it++; for (int i = 0; i < graph[b].size(); i++) { ff[graph[b][i]] = it * 7; } for (int i = 0; i < graph[c].size(); i++) { if (ff[graph[c][i]] == it * 7) ff[graph[c][i]]++; else ff[graph[c][i]] = 0; } for (int i = 0; i < graph2[b].size(); i++) { if (ff[graph2[b][i]] == it * 7 + 1) ff[graph2[b][i]]++; else ff[graph2[b][i]] = 0; } for (int i = 0; i < graph2[c].size(); i++) { if (ff[graph2[c][i]] == it * 7 + 2) { z++; ff[graph2[c][i]] = 0; } } ans += (x - z) * (y - z) + z * (z - 1) + z * (x - z) + z * (y - z); } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; const long long inf = 1e18; int bcg[maxn]; struct Edge { int u, v, nxt; long long w; } edge[maxn * 2], edge1[maxn * 2]; vector<Edge> vec[maxn]; struct Node { long long p; int v; friend bool operator<(Node a, Node b) { return a.p > b.p; } Node() {} Node(long long x, int y) { p = x, v = y; } }; int head[maxn], head1[maxn]; long long deep[maxn]; int depth[maxn]; int bian[maxn * 2]; long long dis[50][maxn]; int lca[maxn][25]; int vis[maxn]; int cnt, cnt1, tot; int n, m; int findd(int x) { return bcg[x] == x ? bcg[x] : bcg[x] = findd(bcg[x]); } bool cmp(Edge a, Edge b) { return a.w < b.w; } void add_e1(int x, int y, long long w) { ++cnt1; edge1[cnt1].u = x; edge1[cnt1].v = y; edge1[cnt1].w = w; edge1[cnt1].nxt = head1[x]; head1[x] = cnt1; } void add_e(int x, int y, long long w) { ++cnt; edge[cnt].u = x; edge[cnt].v = y; edge[cnt].w = w; edge[cnt].nxt = head[x]; head[x] = cnt; } int merges(int x, int y) { int xx = findd(x); int yy = findd(y); if (xx != yy) { bcg[xx] = yy; return 1; } return 0; } void init() { cnt = cnt1 = 0; tot = 0; memset(deep, 0, sizeof(deep)); memset(head, 0, sizeof(head)); memset(head1, 0, sizeof(head1)); } void dfs(int x, int ff) { lca[x][0] = ff; for (int i = 1; i <= 20; i++) lca[x][i] = lca[lca[x][i - 1]][i - 1]; for (int i = head[x]; i; i = edge[i].nxt) { int v = edge[i].v; if (v == ff) continue; deep[v] = deep[x] + edge[i].w; depth[v] = depth[x] + 1; dfs(v, x); } } int LCA(int x, int y) { if (depth[x] < depth[y]) swap(x, y); int ff = depth[x] - depth[y]; for (int i = 20; i >= 0; i--) { if (ff & (1 << i)) x = lca[x][i]; } if (x == y) return y; for (int i = 20; i >= 0; i--) { if (lca[x][i] != lca[y][i]) x = lca[x][i], y = lca[y][i]; } return lca[y][0]; } priority_queue<Node> que; void dij(int id, int x) { for (int i = 0; i <= n + 4; i++) { dis[id][i] = inf; vis[i] = 0; } dis[id][x] = 0; while (!que.empty()) que.pop(); que.push(Node(0, x)); while (!que.empty()) { Node vv = que.top(); que.pop(); if (vis[vv.v] || vv.p > dis[id][vv.v]) continue; vis[vv.v] = 1; for (int i = 0; i < (int)vec[vv.v].size(); i++) { Edge k = vec[vv.v][i]; int sw = k.v; if (vis[sw]) continue; if (dis[id][sw] > dis[id][vv.v] + k.w) { dis[id][sw] = dis[id][vv.v] + k.w; que.push(Node(dis[id][sw], sw)); } } } } int main() { scanf( %d%d , &n, &m); int u, v; long long w; init(); for (int i = 1; i <= m; i++) { scanf( %d%d%lld , &u, &v, &w); add_e1(u, v, w); vec[u].push_back((Edge){u, v, 0, w}); vec[v].push_back((Edge){v, u, 0, w}); } sort(edge1 + 1, edge1 + cnt1 + 1, cmp); for (int i = 1; i <= n + 4; i++) bcg[i] = i; for (int i = 1; i <= cnt1; i++) { int x = edge1[i].u, y = edge1[i].v; if (merges(x, y)) { add_e(x, y, edge1[i].w); add_e(y, x, edge1[i].w); } else { bian[++tot] = x; bian[++tot] = y; } } depth[1] = 0; deep[1] = 0; dfs(1, 0); sort(bian + 1, bian + 1 + tot); int sz = unique(bian + 1, bian + 1 + tot) - (bian + 1); for (int i = 1; i <= sz; i++) { dij(i, bian[i]); } int q; scanf( %d , &q); int x, y; while (q--) { scanf( %d%d , &x, &y); long long ans = inf; int pq = LCA(x, y); ans = deep[x] + deep[y] - 2 * deep[pq]; for (int i = 1; i <= sz; i++) { ans = min(ans, dis[i][x] + dis[i][y]); } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const unsigned int INF = 2000000001; const long long INF0 = 2000000001000000001; const bool DEBUG_OUTPUT = false; const int modulo = 1000000007; const int go[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {-1, -1}, {1, -1}, {-1, 1}}; int main() { long long n, k; int p; cin >> n >> k >> p; long long a = (n >> 1) + (n & 1); long long b = 0; if (k >= a) { b = k - a; } else a = k; if ((n - 2 * a + 1) >= 0 && ((n - 2 * a + 1) & 1) == 0 && k > 0) { b = a - 1; a = k - b; } for (int i = 0; i < p; i++) { long long q; cin >> q; q = n - q; if (q & 1) { cout << ((q >> 1) < b ? X : . ); } else cout << ((q >> 1) < a ? X : . ); } }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 11; int n; int a[MAXN][MAXN]; void read() { cin >> n; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) cin >> a[i][j]; } } const int INF = 1e9 + 7; const int MAXANS = MAXN * MAXN * 2; int dp[MAXANS][MAXN * MAXN][MAXN][MAXN][3]; bool ch(int i, int j) { return 0 <= i && i < n && 0 <= j && j < n; } inline bool check(int i, int j, int ni, int nj, int k) { if (k == 0) { return (abs(i - ni) == 1 && abs(j - nj) == 2) || (abs(i - ni) == 2 && abs(j - nj) == 1); } else if (k == 1) { return abs(i - ni) == abs(j - nj); } else { return (i == ni || j == nj); } } pair<int, int> ans = {INF, INF}; pair<int, int> pos[MAXN * MAXN]; vector<pair<int, int> > go[MAXN][MAXN][3]; void solve() { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { pos[a[i][j]] = {i, j}; } } for (int i = 0; i < MAXANS; ++i) { for (int j = 0; j < MAXN * MAXN; ++j) { for (int x = 0; x < MAXN; ++x) { for (int y = 0; y < MAXN; ++y) { for (int k = 0; k < 3; ++k) { dp[i][j][x][y][k] = INF; } } } } } for (int i = 0; i < 3; ++i) { dp[0][1][pos[1].first][pos[1].second][i] = 0; } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { for (int ni = 0; ni < n; ++ni) { for (int nj = 0; nj < n; ++nj) { for (int k = 0; k < 3; ++k) { if (check(i, j, ni, nj, k)) { go[i][j][k].push_back({ni, nj}); } } } } } } for (int op = 0; op < MAXANS - 1; ++op) { for (int num = 1; num <= n * n; ++num) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { for (int k = 0; k < 3; ++k) { if (num == n * n && dp[op][num][i][j][k] != INF) { ans = min(ans, {op, dp[op][num][i][j][k]}); } for (auto t : go[i][j][k]) { int ni = t.first, nj = t.second; if (check(i, j, ni, nj, k)) { bool ch = (pos[num + 1].first == ni && pos[num + 1].second == nj); dp[op + 1][num + ch][ni][nj][k] = min(dp[op + 1][num + ch][ni][nj][k], dp[op][num][i][j][k]); } } for (int nk = 0; nk < 3; ++nk) { if (nk != k) { dp[op + 1][num][i][j][nk] = min(dp[op + 1][num][i][j][nk], dp[op][num][i][j][k] + 1); } } } } } } } } void print() { cout << ans.first << << ans.second << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); read(); solve(); print(); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int Read() { int x = 0, f = 1, c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * f; } const int MAXN = 1000005; const int mod = 1e9 + 7; int n, m, k, ans, minp, maxp, a[MAXN], bin[MAXN]; int main() { n = Read(), m = Read(), k = Read(), minp = n + 1, bin[0] = 1; for (int i = 1, x, y; i <= m; i++) { x = Read(), y = Read(); if (y == x + k + 1) a[x]++, minp = min(minp, x), maxp = max(maxp, x); else if (y ^ x + 1) return puts( 0 ), 0; } if (maxp - minp > k) return puts( 0 ), 0; n -= k + 1; for (int i = 1; i <= n; i++) a[i] += a[i - 1], bin[i] = (bin[i - 1] << 1) % mod; if (!maxp) { ans = 1; for (int i = 1; i <= n; i++) ans = (ans + bin[min(i + k, n) - i]) % mod; } else for (int i = max(maxp - k, 1); i <= minp; i++) ans = (ans + bin[min(i + k, n) - i - (a[min(i + k, n)] - a[i])]) % mod; return printf( %d n , ans), 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { { long long i, j, n, a, b, c, d, mx, mn; cin >> n >> a >> b >> c >> d; mx = max(a + b, a + c); mx = max(mx, b + d); mx = max(mx, c + d); mn = min(a + b, a + c); mn = min(mn, b + d); mn = min(mn, c + d); if (mx + 1 <= mn + n) { i = min(a + b + n, mn + n); j = max(mx + 1, a + b + 1); cout << n * (i - j + 1); } else cout << 0 ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k, ans, x, y, sum, res, day1, day2, moun1, moun2, year1, year2; bool l; char a[100]; string s, s1, s2; vector<int> v; int main() { cin >> n; if (!(n & 1)) { cout << -1; return 0; } for (int i = 0; i < n; i++) printf( %d , i); cout << endl; for (int i = 0; i < n; i++) printf( %d , i); cout << endl; for (int i = 0; i < n; i++) printf( %d , (i + i) % n); return 0; }
|
#include <bits/stdc++.h> using namespace std; map<long long, long long> m; void solve() { long long n; cin >> n; map<long long, long long>::iterator itr; long long x, maxm = INT_MIN; for (long long i = 0; i < n; i++) { cin >> x; m[x - (i + 1)] += x; } for (auto &it : m) { maxm = max(maxm, it.second); } cout << maxm; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool isVowel(char c) { if (c == a or c == e or c == i or c == o or c == u or c == y ) return true; return false; } int32_t main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long n; cin >> n; string s; cin >> s; string ans = ; for (long long i = 0; i < n; i++) { ans += s[i]; if (!isVowel(s[i])) continue; long long j = i; while (j < n && isVowel(s[j])) j++; i = j - 1; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int arr[11]; string str[11]; int m, n; int f(int k) { if (k == n) { for (int i = 0; i < m; i++) if (arr[i] != 0) return 0; return 1; } int ans = 0; bool c = 0; for (int i = 0; i < m; i++) if (str[i][k] == 0 ) { arr[i]--; if (arr[i] < 0) c++; } if (c == 0) ans += f(k + 1); for (int i = 0; i < m; i++) if (str[i][k] == 0 ) arr[i]++; c = 0; for (int i = 0; i < m; i++) if (str[i][k] == 1 ) { arr[i]--; if (arr[i] < 0) c++; } if (!c) ans += f(k + 1); for (int i = 0; i < m; i++) if (str[i][k] == 1 ) arr[i]++; return ans; } int main() { cin >> n >> m; for (int i = 0; i < m; i++) cin >> str[i] >> arr[i]; cout << f(0) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; vector<int> val(n); for (int i = 0; i < n; i++) { cin >> val[i]; } if (m == 1) { cout << max(val[0], val[n - 1]) << endl; continue; } if (k >= m - 1) { vector<int> vec; for (int i = 0; i < m; i++) { vec.push_back(val[i]); vec.push_back(val[n - i - 1]); } cout << *max_element(vec.begin(), vec.end()) << endl; continue; } int res_glob = 0; for (int i = 0; i <= k; i++) { int ind_l = i; int ind_r = n - 1 - (k - i); int need = m - k - 1; int cur_res = 2000000000; for (int j = 0; j <= need; j++) { int cur_elem = ind_l + j; int cur_elem_left = ind_r - (need - j); cur_res = min(cur_res, max(val[cur_elem], val[cur_elem_left])); } res_glob = max(res_glob, cur_res); } cout << res_glob << endl; } }
|
#include <bits/stdc++.h> using namespace std; int a[500005]; int main() { int n, b, i, ma = 0, ju, cnt, le, st, j; scanf( %d , &n); int hahaha = 1; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } le = 1; ju = a[0]; for (i = 1; i < n; i++) { if (a[i] != ju) le++; else { ma = max(ma, le); st = i - le + 1; cnt = 0; if (le >= 3) { if (le % 2 == 0) { le = (le - 2) / 2; for (j = st; j < i - 1; j++) { if (cnt < le) { a[j] = a[st - 1]; } else { a[j] = a[i]; } cnt++; } } else { for (j = st; j < i - 1; j++) { a[j] = a[st - 1]; } } } le = 1; } ju = a[i]; } ma = max(ma, le); st = i - le + 1; cnt = 0; if (le >= 3) { if (le % 2 == 0) { le = (le - 2) / 2; for (j = st; j < i - 1; j++) { if (cnt < le) { a[j] = a[st - 1]; } else { a[j] = a[i - 1]; } cnt++; } } else { for (j = st; j < i - 1; j++) { a[j] = a[st - 1]; } } } le = (ma - 1) / 2; printf( %d n , le); for (i = 0; i < n; i++) { printf( %d , a[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const int maxn = 1e6 + 10; int n, k, cnt[maxn], a[maxn], L[maxn], R[maxn]; stack<pair<int, int> > stk; int main() { scanf( %d , &n); ; scanf( %d , &k); ; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); ; stk.push({INF, 0}); for (int i = 1; i <= n; i++) { while (stk.top().first < a[i]) stk.pop(); L[i] = stk.top().second + 1; stk.push({a[i], i}); } while (stk.size()) stk.pop(); stk.push({INF, n + 1}); for (int i = n; i >= 1; i--) { while (stk.top().first <= a[i]) stk.pop(); R[i] = stk.top().second - 1; stk.push({a[i], i}); } for (int i = 1; i <= n; i++) { cnt[i] = (cnt[i - 1] + (i - 1) / (k - 1)) % mod; } long long ans = 0; for (int i = 1; i <= n; i++) { int t = (cnt[R[i] - L[i] + 1] - cnt[i - L[i]] - cnt[R[i] - i]) % mod; ans += 1LL * t * a[i] % mod; } printf( %I64d n , (ans % mod + mod) % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[50001], n, l, r; queue<int> ver[50001]; void go(int pre, int v) { int t; p[v] = pre; if (v != l) { while (!ver[v].empty()) { t = ver[v].front(); ver[v].pop(); if (t != pre) go(v, t); } } } int main() { scanf( %d%d%d , &n, &l, &r); l--; r--; for (int i = 0; i < n; i++) if (i == l) continue; else { scanf( %d , &p[i]); p[i]--; ver[p[i]].push(i); ver[i].push(p[i]); } go(-1, r); for (int i = 0; i < n; i++) if (i == r) continue; else printf( %d , p[i] + 1); return 0; }
|
#include <bits/stdc++.h> long long gcd(long long x, long long y) { if (x > y) std::swap(x, y); return y % x == 0 ? x : gcd(y % x, x); } using namespace std; int main() { int n; scanf( %d , &n); int a[20]; bool flag = true; for (int i = (1); i <= (n); i++) scanf( %d , a + i); for (int i = (1); i <= (n - 1); i++) if (abs(a[i] - a[i + 1]) >= 2) flag = false; if (flag) puts( YES ); else puts( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 50; int n, cnt, f[N][18], d[N], fa[N], id[N], s[N]; vector<int> v1[N], v2[N]; void dfs1(int x, int ff) { for (int i = 0; i < 17; i++) f[x][i + 1] = f[f[x][i]][i]; for (int i = 0, y; i < v1[x].size(); i++) if ((y = v1[x][i]) != ff) f[y = v1[x][i]][0] = x, d[y] = d[x] + 1, dfs1(y, x); } int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } void merge(int x, int y) { x = find(x); y = find(y); if (s[x] > s[y]) swap(x, y); fa[x] = y; s[y] += s[x]; id[y] = d[id[y]] < d[id[x]] ? id[y] : id[x]; } void dfs2(int x, int ff) { for (int i = 0, y; i < v2[x].size(); i++) if ((y = v2[x][i]) != ff) dfs2(y, x); if (!ff) return; int fx = id[find(x)], p = ff; for (int i = 17; ~i; i--) if (d[id[find(f[p][i])]] > d[fx]) p = f[p][i]; if (id[find(f[p][0])] != fx) p = fx; merge(p, f[p][0]); printf( %d %d %d %d n , p, f[p][0], x, ff); } int main() { scanf( %d , &n); for (int i = 1, x, y; i < n; i++) scanf( %d%d , &x, &y), v1[x].push_back(y), v1[y].push_back(x); for (int i = 1, x, y; i < n; i++) scanf( %d%d , &x, &y), v2[x].push_back(y), v2[y].push_back(x); printf( %d n , n - 1); for (int i = 1; i <= n; i++) id[i] = fa[i] = i, s[i] = 1; dfs1(d[1] = 1, 0); dfs2(1, 0); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string a, b; int n, m; cin >> n >> m; cin >> a >> b; int pw = 1; int ans = 0, res = 0; for (int i = 0; i < m; i++) { if (i < n && a[n - i - 1] == 1 ) res = (res + pw) % 998244353; if (b[m - i - 1] == 1 ) ans = (ans + res) % 998244353; pw = (pw + pw) % 998244353; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a, b, ans, w1, w2; int main() { cin >> a >> b; ans = 2 * a + 2 * b + 2; w1 = 2 * a + 2 * b + 2; w2 = 2 * a + 2 * b + 2; for (long long i = 1; i <= sqrt(a + b); i++) { if (a % i == 0 && a / i < w1) w1 = a / i; if (b % i == 0 && b / i < w2) w2 = b / i; if ((a + b) % i == 0) { if (w1 <= (a + b) / i) { if (2 * (i + (a + b) / i) < ans) ans = 2 * (i + (a + b) / i); } if (w2 <= (a + b) / i) { if (2 * (i + (a + b) / i) < ans) ans = 2 * (i + (a + b) / i); } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 100; int num[N]; bool vis[N]; vector<int> v; int n, k; int main() { scanf( %d %d , &n, &k); int mn = 1e9 + 1000; for (int i = 1; i <= n; i++) { scanf( %d , &num[i]); if (num[i] < mn) { mn = num[i]; vis[i] = true; v.push_back(i); } } v.push_back(n + 1); num[n + 1] = 0; int cnt = 0; int mx = 0; for (int i = 1; i < v.size(); i++) { mx = max(mx, v[i] - v[i - 1]); if (v[i] - v[i - 1] > k) cnt++; } if (cnt >= 2) { puts( NO ); } else if (cnt == 0) { puts( YES ); } else { int tmp = -1; for (int i = 1; i < v.size(); i++) { if (v[i] - v[i - 1] > k) tmp = i; } bool ans = false; if (tmp != v.size() - 1 && v[tmp + 1] - v[tmp - 1] <= 2 * k) ans = true; if (tmp == 0 && v[1] <= 2 * k) tmp = true; for (int i = v[tmp] + 1; i <= n; i++) { if (vis[i]) continue; if (num[i] < num[v[tmp - 1]] && num[i] > num[v[tmp]]) ans = true; } if (ans) puts( YES ); else puts( NO ); } return 0; }
|
#include <iostream> int main(void) { int count; std::cin >> count; for (int i = 0; i < count; ++i) { int number; std::cin >> number; int64_t sum = 0; for (int j = 0; j < number; ++j) { int part; std::cin >> part; sum += part; } std::cout << (sum % number) * (number - sum % number) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> v(n); for (auto &i : v) cin >> i; int q; cin >> q; vector<int> idx(n, 0); vector<int> ops(q, 0); for (int i = 0; i < q; ++i) { int op; cin >> op; if (op == 1) { int p, x; cin >> p >> x; v[p - 1] = x; idx[p - 1] = i; } else { int x; cin >> x; ops[i] = x; } } for (int i = q - 2; i >= 0; --i) ops[i] = max(ops[i], ops[i + 1]); for (int i = 0; i < n; ++i) { v[i] = max(ops[idx[i]], v[i]); } for (int i = 0; i < n; ++i) cout << v[i] << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> #define ll long long #define ld long double #define lchild 2*node #define rchild 2*node+1 #define mid (l+r)/2 #define mod 1000000007 #define mx 200007 #define pii pair<int,int> #define pci pair<int,int> #define ff first #define ss second #define piii pair<int,pii> using namespace std; int t1[mx][21], lg2[mx], t2[mx][21]; int arr[mx]; void f( int n ) { int i, j, k, m, l, r, q; lg2[1] = 0; for (i = 2; i <= n; i++) lg2[i] = lg2[i / 2] + 1; for (i = 1; i <= n; i++) t1[i][0] = arr[i], t2[i][0] = arr[i]; for (j = 1; j <= 20; j++) for (i = 1; i + (1 << (j - 1)) <= n; i++) t1[i][j] = min(t1[i][j - 1], t1[i + (1 << (j - 1))][j - 1]); for (j = 1; j <= 20; j++) for (i = 1; i + (1 << (j - 1)) <= n; i++) t2[i][j] = max(t2[i][j - 1], t2[i + (1 << (j - 1))][j - 1]); } int squery1( int l, int r ) { // int ans = min(ans, t[l][i]), l += (1 << i); int k = lg2[r - l + 1]; int ans = min(t1[l][k], t1[r - (1 << k) + 1][k]); return ans; } int squery2( int l, int r ) { // int ans = min(ans, t[l][i]), l += (1 << i); int k = lg2[r - l + 1]; int ans = max(t2[l][k], t2[r - (1 << k) + 1][k]); return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int tc; cin >> tc; while (tc--) { int n; cin >> n; for ( int i = 1; i <= n; i++ ) cin >> arr[i]; f(n); int pre[n + 5], suff[n + 5]; pre[1] = arr[1]; suff[n] = arr[n]; for ( int i = 2; i <= n; i++ ) pre[i] = max( pre[i - 1], arr[i] ); for ( int i = n - 1; i >= 1; i-- ) suff[i] = max( suff[i + 1], arr[i] ); bool f= 0; int out, lf, rt; for ( int i = 2; i < n; i++ ) { int x = arr[i]; int baam = i, daan = i; int l = 1, r = i; if ( i > 1 ) { int ans = i; while (l <= r) { int q = squery1( mid, i ); if (q != x) l = mid + 1; else ans = mid, r = mid - 1; } baam = ans; } l = i, r = n; if ( i < n ) { int ans = i; while (l <= r) { int q = squery1( i, mid ); // cout<<x<< <<l<< <<r<< <<q<<endl; if (q != x) r = mid - 1; else ans = mid, l = mid + 1; } daan = ans; } baam= max( baam, 2 ); daan= min( daan, n-1 ); if( baam<i and arr[baam]==arr[i] ) baam++; if( daan>i and arr[daan]==arr[i] ) daan--; if( pre[baam-1]==suff[daan+1] and pre[baam-1]==arr[i] ) { f= 1; out= daan-baam+1; lf= baam-1; rt= n-daan; break; } // cout<<i<< <<baam<< <<daan<< <<pre[baam-1]<< <<suff[daan+1]<<endl; } if(f) cout<< YES n <<lf<< <<out<< <<rt<< n ; else cout<< NO n ; } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int a[maxn]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n * 2; i++) scanf( %d , &a[i]); sort(a, a + n * 2); long long area = 1ll * (a[n - 1] - a[0]) * (a[n * 2 - 1] - a[n]); for (int i = 1; i < n; i++) { area = min(area, 1ll * (a[i + n - 1] - a[i]) * (a[n * 2 - 1] - a[0])); } printf( %I64d , area); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b; if (a >= b) { c = (a - b) / 2; cout << b << << c; } else { c = (b - a) / 2; cout << a << << c; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, d; scanf( %d %d , &n, &d); int data[n + 10]; for (int i = 0; i < n; i++) scanf( %d , &data[i]); long long ans = 0; for (int i = 0; i < n - 1; i++) { int h = upper_bound(data, data + n, data[i] + d) - data; h--; int l = i; int n = (h - l) + 1; if (n < 3) continue; n -= 2; ans += ((long long)(n) * (long long)(n + 1)) / 2; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 123; int n, t, label[N], times = 0; vector<int> e[N]; vector<pair<int, int> > res; void newLabel(int u) { res.push_back(make_pair(u, times)); label[u] = times; } void dfs(int u, int backLabel = -1, int p = 0) { newLabel(u); int numchild = (int)e[u].size() - (u > 1); for (int v : e[u]) { if (v == p) continue; if (label[u] >= t) { times = backLabel - numchild; newLabel(u); } times = label[u] + 1; dfs(v, label[u], u); if (label[v] > label[u]) { times = label[u]; newLabel(v); } ++times; newLabel(u); --numchild; } if (u > 1 && label[u] > backLabel) { times = backLabel; newLabel(u); } } int main() { ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); cin >> n; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; e[u].push_back(v); e[v].push_back(u); } t = -1; for (int i = 1; i <= n; ++i) t = max(t, (int)e[i].size()); dfs(1); cout << res.size() << n ; for (pair<int, int> x : res) { cout << x.first << << x.second << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct point { double df, de; void init(double _df, double _de) { df = _df; de = _de; } } V[100]; int nf, ne, ns, rf, re, rs, df, de; int n, top, place[13]; double ans = 0, dp[21][21], lf, le, ls; bool cmp(const point &a, const point &b) { return a.df > b.df; } double cross(double l1, double r1, double l2, double r2) { if (l2 >= r1 || l1 >= r2) return 0; return min(r1, r2) - max(l1, l2); } void init_V() { top = 0; for (int i = 0; i < n; i++) if (place[i] < 2) { double t1 = lf * df, t2 = le * de; for (int j = 0; j < n; j++) if (place[j]) { t1 += df * place[j] * cross(j - ls / 2, j + ls / 2, i - lf / 2, i + lf / 2); t2 += de * place[j] * cross(j - ls / 2, j + ls / 2, i - le / 2, i + le / 2); } for (int j = 1; j + place[i] <= 2; j++) V[top++].init(t1, t2); } sort(V, V + top, cmp); } void init_dp() { memset(dp, 0, sizeof(dp)); for (int i = 0; i <= nf; i++) for (int j = 0; j <= ne; j++) { if (i) dp[i][j] = max(dp[i][j], dp[i - 1][j] + V[i + j - 1].df); if (j) dp[i][j] = max(dp[i][j], dp[i][j - 1] + V[i + j - 1].de); } ans = max(ans, dp[nf][ne]); } void dfs(int p, int left) { if ((n - p) * 2 < left) return; if (p == n) { init_V(); init_dp(); return; } for (int i = 0; i <= 2 && left >= i; i++) { place[p] = i; dfs(p + 1, left - i); } } int main() { cin >> nf >> ne >> ns >> rf >> re >> rs >> df >> de; n = (nf + ne + ns + 1) / 2; lf = 2 * sqrt(rf * rf - 1.0); le = 2 * sqrt(re * re - 1.0); ls = 2 * sqrt(rs * rs - 1.0); dfs(0, ns); printf( %.10lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> struct rge { T b, e; }; template <class T> rge<T> range(T i, T j) { return rge<T>{i, j}; } struct debug { template <class T> debug& operator<<(const T&) { return *this; } }; using ll = long long; template <typename T> void min_self(T& a, T b) { a = min(a, b); } template <typename T> void max_self(T& a, T b) { a = max(a, b); } const int mxN = 2500 * 1000 + 5; int xs[mxN], N = 0; const ll inf = 1e18; class SegTree { public: struct Node { ll mn = inf; void merge(Node x, Node y) { mn = min(x.mn, y.mn); } }; SegTree(int _n) : n(_n) { tree.resize(4 * n); lazy.resize(4 * n); } void build(int i, int L, int R) { if (L == R) { tree[i].mn = 0; } else { int m = L + (R - L) / 2; build(2 * i, L, m); build(2 * i + 1, m + 1, R); tree[i].merge(tree[2 * i], tree[2 * i + 1]); } } void push(int i) { ll& v = lazy[i]; tree[2 * i].mn += v; lazy[2 * i] += v; tree[2 * i + 1].mn += v; lazy[2 * i + 1] += v; v = 0; } Node get(int i, int L, int R, int tl, int tr) { if (tl > tr) return Node(); if (L == tl && tr == R) { return tree[i]; } else { push(i); int m = L + (R - L) / 2; Node ans; ans.merge(get(2 * i, L, m, tl, min(tr, m)), get(2 * i + 1, m + 1, R, max(m + 1, tl), tr)); return ans; } } ll get(int tl, int tr) { Node ans = get(1, 1, n, tl, tr); return ans.mn; } void upd(int i, int L, int R, int tl, int tr, int val) { if (tl > tr) return; if (L == tl && tr == R) { tree[i].mn += val; lazy[i] += val; } else { push(i); int m = L + (R - L) / 2; upd(2 * i, L, m, tl, min(tr, m), val); upd(2 * i + 1, m + 1, R, max(m + 1, tl), tr, val); tree[i].merge(tree[2 * i], tree[2 * i + 1]); } } void upd(int tl, int tr, int val) { upd(1, 1, n, tl, tr, val); } private: int n; vector<Node> tree; vector<ll> lazy; }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<pair<int, int>> tv; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; for (int x : {a - 1, a, a + 1, b - 1, b, b + 1}) { xs[N++] = x; } tv.emplace_back(a, b); } sort(xs, xs + N); N = unique(xs, xs + N) - xs; SegTree st(N); st.build(1, 1, N); for (auto pp : tv) { int L = pp.first, R = pp.second; L = lower_bound(xs, xs + N, L) - xs; R = lower_bound(xs, xs + N, R) - xs; st.upd(L + 1, R + 1, 1); } int who = 1; for (auto pp : tv) { int L = pp.first, R = pp.second; L = lower_bound(xs, xs + N, L) - xs; R = lower_bound(xs, xs + N, R) - xs; if (st.get(L + 1, R + 1) > 1) { cout << who << n ; exit(0); } who++; } cout << -1 n ; }
|
#include <bits/stdc++.h> using namespace std; void solve() { long long a, b; cin >> a >> b; if (b - a > 5) { cout << 0 << n ; } else { long long val = 1; for (long long j = a + 1; j <= b; j++) { val *= (j % 10); val %= 10; } cout << val << n ; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); solve(); }
|
#include <bits/stdc++.h> using namespace std; struct Point { int x; int y; }; struct Rect { int left; int top; int right; int bottom; }; bool FindBoundary(const vector<Point> &pts, Rect *getRect) { if (pts.empty()) { return false; } auto it = pts.begin(); getRect->left = it->x; getRect->right = it->x; getRect->top = it->y; getRect->bottom = it->y; for (auto it = pts.begin(); it != pts.end(); ++it) { if (getRect->left > it->x) { getRect->left = it->x; } if (getRect->right < it->x) { getRect->right = it->x; } if (getRect->top < it->y) { getRect->top = it->y; } if (getRect->bottom > it->y) { getRect->bottom = it->y; } } return true; } bool IsSquare(const Rect *rect) { return rect->right - rect->left == rect->top - rect->bottom; } bool CheckPoints(const vector<Point> &pts, const Rect *rect, int n) { int left = 0, top = 0, right = 0, bottom = 0; bool notAny = true; for (auto it = pts.begin(); it != pts.end(); ++it) { notAny = true; if (it->x == rect->left) { notAny = false; ++left; } if (it->x == rect->right) { notAny = false; ++right; } if (it->y == rect->top) { notAny = false; ++top; } if (it->y == rect->bottom) { notAny = false; ++bottom; } if (notAny) { return false; } } if (left < n || right < n || top < n || bottom < n) { return false; } return true; } int main(int argc, char *argv[]) { int n = 0; cin >> n; int amount = 4 * n + 1; vector<Point> points; for (int i = 0; i < amount; ++i) { Point pt; cin >> pt.x >> pt.y; points.push_back(pt); } bool found = false; for (int i = 0; i < amount; ++i) { vector<Point> sqPoints; for (int j = 0; j < amount; ++j) { if (j != i) { sqPoints.push_back(points[j]); } } Rect rect; if (!FindBoundary(sqPoints, &rect)) { continue; } if (!IsSquare(&rect)) { continue; } if (!CheckPoints(sqPoints, &rect, n)) { continue; } printf( %d %d , points[i].x, points[i].y); break; } return 0; }
|
#include<bits/stdc++.h> using namespace std; typedef long long ll; //#define rep(i,a,b) for(int i=a;i<b;i++); void solve(){ ll n; cin>>n; string s; cin>>s; vector<ll>v; for(int i=0;i<n;i++){ if (s[i]== * ){ v.push_back(i); } } if (v.size()<=1 or v.size()==n){ cout<<0<<endl; } else{ ll mid=v.size()/2; ll ans=0; for(int i=0;i<v.size();i++){ ans+=abs(v[i]-v[mid]); } if (v.size()%2==0){ ll t1=v.size()/2; ll t2=v.size()/2-1; ll d1=t1*(t1+1)/2; ll d2=t2*(t2+1)/2; ans-=(d1+d2); } else{ ll t1=v.size()/2; ll d1=t1*(t1+1)/2; ans-=(2*d1); } cout<<ans<<endl; } } int main(){ int t=1; cin>>t; while(t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793; const long long I_MAX = 1LL << 60; long long mod = 1000000007; const long long maxN = 2E5; vector<long long> inv(maxN + 5, 1); vector<long long> fac(maxN + 5, 1); void ADD(long long &x, long long y) { x += y; if (x >= mod) x -= mod; if (x < 0) x += mod; } void MUL(long long &x, long long y) { x *= y; x = (x % mod + mod) % mod; } long long mypow(long long b, long long e) { long long ans = 1; while (e) { if (e & 1) MUL(ans, b); MUL(b, b); e >>= 1; } return ans; } long long modinv(long long n) { return mypow(n, mod - 2); } void calcInv(long long n) { for (int i = 2; i <= n; ++i) { inv[i] = (mod - mod / i) * inv[mod % i] % mod; } } void calcFac(long long n) { for (int i = 2; i <= n; ++i) { fac[i] = fac[i - 1] * i % mod; } } long long cm(long long a, long long b) { long long ans = 1; if (a < b) return 0; MUL(ans, inv[fac[a - b]]); MUL(ans, inv[fac[b]]); MUL(ans, fac[a]); return ans; } long long Lucas(long long n, long long m) { if (m == 0) return 1; return cm(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod; } long long doLucas(long long n, long long m) { calcInv(mod); calcFac(mod); return Lucas(n, m); } const long long maxn = 1E5; void precal() { return; } void solve() { long long n; scanf( %I64d , &n); int pln[n + 5][n + 5]; memset(pln, -1, sizeof(pln)); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) { if ((i & 1) and (j & 1)) pln[i][j] = 0; else if ((i & 1)) pln[i][j] = 2; else if ((j & 1)) pln[i][j] = 4; else pln[i][j] = 6; } pln[1][1] = 1; pln[n][n] = 0; int rep; for (int i = 1; i <= n; i += 2) { for (int j = 1; j <= n - 2 - 2 * (i == n); j += 2) { printf( ? %d %d %d %d n , i, j, i, j + 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i][j + 2] = pln[i][j]; } else { pln[i][j + 2] = pln[i][j] ^ 1; } } if (i + 2 <= n) { printf( ? %d %d %d %d n , i, 1, i + 2, 1); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i + 2][1] = pln[i][1]; } else { pln[i + 2][1] = pln[i][1] ^ 1; } } } for (int i = 2; i <= n; i += 2) { for (int j = 1; j <= n - 2; j += 2) { printf( ? %d %d %d %d n , i, j, i, j + 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i][j + 2] = pln[i][j]; } else { pln[i][j + 2] = pln[i][j] ^ 1; } } if (i + 2 <= n) { printf( ? %d %d %d %d n , i, 1, i + 2, 1); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i + 2][1] = pln[i][1]; } else { pln[i + 2][1] = pln[i][1] ^ 1; } } } for (int i = 1; i <= n; i += 2) { for (int j = 2; j <= n - 2; j += 2) { printf( ? %d %d %d %d n , i, j, i, j + 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i][j + 2] = pln[i][j]; } else { pln[i][j + 2] = pln[i][j] ^ 1; } } if (i + 2 <= n) { printf( ? %d %d %d %d n , i, 2, i + 2, 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i + 2][2] = pln[i][2]; } else { pln[i + 2][2] = pln[i][2] ^ 1; } } } for (int i = 2; i <= n; i += 2) { for (int j = 2; j <= n - 2; j += 2) { printf( ? %d %d %d %d n , i, j, i, j + 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i][j + 2] = pln[i][j]; } else { pln[i][j + 2] = pln[i][j] ^ 1; } } if (i + 2 <= n) { printf( ? %d %d %d %d n , i, 2, i + 2, 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { pln[i + 2][2] = pln[i][2]; } else { pln[i + 2][2] = pln[i][2] ^ 1; } } } printf( ? %d %d %d %d n , 1, 1, 2, 2); fflush(stdout); scanf( %d , &rep); if (rep == 1) { for (int i = 2; i <= n; i += 2) for (int j = 2; j <= n; j += 2) { pln[i][j] ^= 7; } } else { for (int i = 2; i <= n; i += 2) for (int j = 2; j <= n; j += 2) { pln[i][j] ^= 6; } } printf( ? %d %d %d %d n , 1, 2, 2, 3); fflush(stdout); scanf( %d , &rep); if (rep == 1) { int x = pln[2][3] ^ 2; for (int i = 2; i <= n; i += 2) for (int j = 1; j <= n; j += 2) { pln[i][j] ^= x; } } else { int x = pln[2][3] ^ 3; for (int i = 2; i <= n; i += 2) for (int j = 1; j <= n; j += 2) { pln[i][j] ^= x; } } int px = n, py = n; for (int i = 2; i <= n; ++i) { for (int j = 3; j <= n; ++j) { if (pln[i - 1][j - 2] == pln[i][j - 1] and pln[i][j - 2] == pln[i][j]) { px = i; py = j; } if (pln[i - 1][j - 2] != pln[i][j - 1] and pln[i][j - 2] != pln[i][j]) { px = i; py = j; } if (pln[i - 1][j - 2] == pln[i][j - 1] and pln[i - 1][j - 1] == pln[i][j]) { px = i; py = j; } if (pln[i - 1][j - 2] != pln[i][j - 1] and pln[i - 1][j - 1] != pln[i][j]) { px = i; py = j; } if (pln[i - 1][j - 2] == pln[i - 1][j] and pln[i][j - 2] == pln[i][j]) { px = i; py = j; } if (pln[i - 1][j - 2] != pln[i - 1][j] and pln[i][j - 2] != pln[i][j]) { px = i; py = j; } } } printf( ? %d %d %d %d n , px - 1, py - 2, px, py); fflush(stdout); scanf( %d , &rep); if (px % 2 != py % 2) { if (rep == 1) { int x = pln[px][py] ^ pln[px - 1][py - 2]; for (int i = 2; i <= n; i += 2) for (int j = 1; j <= n; j += 2) { pln[i][j] ^= x; } for (int i = 1; i <= n; i += 2) for (int j = 2; j <= n; j += 2) { pln[i][j] ^= x; } } else { int x = pln[px][py] ^ pln[px - 1][py - 2] ^ 1; for (int i = 2; i <= n; i += 2) for (int j = 1; j <= n; j += 2) { pln[i][j] ^= x; } for (int i = 1; i <= n; i += 2) for (int j = 2; j <= n; j += 2) { pln[i][j] ^= x; } } } else { if (rep == 1) { int x = pln[px][py] ^ pln[px - 1][py - 2]; for (int i = 2; i <= n; i += 2) for (int j = 1; j <= n; j += 2) { pln[i][j] ^= x; } for (int i = 1; i <= n; i += 2) for (int j = 2; j <= n; j += 2) { pln[i][j] ^= x; } } else { int x = pln[px][py] ^ pln[px - 1][py - 2] ^ 1; for (int i = 2; i <= n; i += 2) for (int j = 1; j <= n; j += 2) { pln[i][j] ^= x; } for (int i = 1; i <= n; i += 2) for (int j = 2; j <= n; j += 2) { pln[i][j] ^= x; } } } printf( ! n ); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { printf( %d , pln[i][j]); } printf( n ); } fflush(stdout); } int main() { precal(); int t = 1; for (int i = 1; i <= t; ++i) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int W, H, n; scanf( %d%d%d , &W, &H, &n); multiset<int> w, h; w.insert(-W); h.insert(-H); set<int> wa, ha; wa.insert(0); wa.insert(W); ha.insert(0); ha.insert(H); for (int i = 0; i < n; i++) { char t; int x; scanf( n%c%d , &t, &x); if (t == H ) { auto r = ha.lower_bound(x); auto l = r; l--; h.erase(h.find((*l) - (*r))); ha.insert(x); h.insert((*l) - x); h.insert(x - (*r)); } else if (t == V ) { auto r = wa.lower_bound(x); auto l = r; l--; w.erase(w.find((*l) - (*r))); wa.insert(x); w.insert((*l) - x); w.insert(x - (*r)); } printf( %lld n , 1ll * (*h.begin()) * (*w.begin())); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAX = 1000009; long long mod = 998244353; long long n, kek[MAX]; vector<long long> child[MAX]; long long bin(long long num, long long power) { if (power == 0) return 1; else { long long an = (num) % mod; if (power % 2 == 0) { an = bin(num, power / 2); long long an1 = an; an *= an1; an %= mod; return an; } else { an *= bin(num, power - 1); an %= mod; return an; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long q; cin >> q; while (q--) { long long n, k; cin >> n >> k; if (n % k <= k / 2) { cout << n << n ; } else cout << n - ((n % k) - k / 2) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool chk(int n, int first) { return n & (1 << first); } void set(int& n, int first) { n = n | (1 << first); } void reset(int& n, int first) { n = n & ~(1 << first); } const int mx = 600010; bool f[mx]; int a[mx][3], _size; char s[mx]; int new_node() { ++_size; for (int i = 0; i < 3; i++) a[_size][i] = 0; f[_size] = false; return _size; } void Insert(char str[]) { int cur = 0, i = -1; while (str[++i] != 0 ) { int& next = a[cur][str[i] - a ]; if (next == 0) next = new_node(); cur = next; } f[cur] = true; } bool Search(int i, int cur, bool flag) { if (s[i] == 0 ) return f[cur] && flag; if (flag) { int next = a[cur][s[i] - a ]; if (next == 0) return false; return Search(i + 1, next, 1); } else { int next = a[cur][s[i] - a ]; if (next > 0 && Search(i + 1, next, 0)) return true; for (int j = 0; j < 3; j++) { next = a[cur][j]; if (next == 0) continue; if (s[i] == j + a ) continue; if (Search(i + 1, next, 1)) return true; } return false; } } int main() { int i, j, k, n, m; while (scanf( %d%d , &n, &m) == 2) { _size = -1; new_node(); for (i = 0; i < n; i++) { scanf( %s , s); Insert(s); } for (i = 0; i < m; i++) { scanf( %s , s); if (Search(0, 0, 0)) printf( YES n ); else printf( NO n ); } } }
|
#include <bits/stdc++.h> using namespace std; class Solution { public: long long minCost(int n, vector<int>& blocks, vector<int>& prices) { int m = prices.size(); vector<int> pre(n, 0); iota(pre.begin(), pre.end(), 0); if (!blocks.empty() && blocks[0] == 0) { return -1; } for (int i = 0, j = 0; i < n && j < blocks.size(); ++i) { if (i == blocks[j]) { pre[i] = pre[i - 1]; ++j; } } int minL = 0; for (int i = 0; i < blocks.size(); ++i) { int cnt = 1; while (i + 1 < blocks.size() && blocks[i + 1] == blocks[i] + 1) { ++i; ++cnt; } minL = max(minL, cnt); } long long res = LLONG_MAX; int minPrice = INT_MAX; for (int l = m; l > minL; --l) { if (minPrice < prices[l - 1]) { continue; } minPrice = prices[l - 1]; int cnt = 0; int p = 0; while (p < n) { p += l; ++cnt; if (p < n && pre[p] != p) { p = pre[p]; } } res = min(res, 1LL * cnt * prices[l - 1]); } return res == LLONG_MAX ? -1 : res; } }; int main(int argc, char** argv) { int n, m, k; scanf( %d%d%d , &n, &m, &k); vector<int> blocks; blocks.reserve(m); for (int i = 0, b = 0; i < m; ++i) { scanf( %d , &b); blocks.push_back(b); } vector<int> prices; prices.reserve(k); for (int i = 0, p = 0; i < k; ++i) { scanf( %d , &p); prices.push_back(p); } Solution sol; printf( %s n , to_string(sol.minCost(n, blocks, prices)).c_str()); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[1000005]; int main() { string s; int p = 1, q = 1, ans = 0, ansCount = 1; a[0] = -1; cin >> s; for (int i = 0, sz = s.length(); i < sz; i++) { if (s[i] == ( ) { a[p] = i; p++; } else { p--; if (p == 0) { a[0] = i; p = 1, q = 1; } else { int dis = i - a[p - 1]; if (dis > ans) { ans = dis, ansCount = 1; } else if (dis == ans) ansCount++; } } } cout << ans << << ansCount; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, k; vector<long long> arr; void solve() { cin >> n >> m >> k; arr.resize(n); for (long long i = 0; i < n; i++) cin >> arr[i]; vector<long long> b; long long l = arr[n - 1] - arr[0]; ; for (int i = 1; i < n; i++) { b.push_back(arr[i] - arr[i - 1]); } sort(b.begin(), b.end()); long long i = b.size() - 1; int ctr = k - 1; for (; ctr > 0; i--, ctr--) { l -= b[i]; l += 1; } l++; cout << l << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int tc; cin >> tc; for (int t = 1; t <= tc; t++) { int b, p, f, rsl = 0; int h, c; cin >> b >> p >> f; cin >> h >> c; b /= 2; if (h >= c) { int mbp = min(b, p); rsl += mbp * h; b -= mbp; rsl += min(b, f) * c; } else { int mbp = min(b, f); rsl += mbp * c; b -= mbp; rsl += min(b, p) * h; } cout << rsl << endl; } return 0; }
|
#include <bits/stdc++.h> const int maxn = 3e5 + 5; const long long inf = 1e18; int ind[maxn], now, n; using namespace std; set<pair<int, int>> e[maxn]; vector<long long> answers; bool vis[maxn]; long long dp[maxn][2]; struct node { int u, val; inline bool operator<(const node &b) const { return val > b.val; } }; priority_queue<node> pq; set<int> S; bool cur[maxn]; multiset<long long> q[maxn]; long long val[maxn]; inline void dfs(int u, int fa) { vis[u] = 1; vector<long long> vec; long long sum = 0; for (auto x : e[u]) { int v = x.first, w = x.second; if (v == fa || cur[v]) continue; dfs(v, u); sum += dp[v][1]; vec.push_back(dp[v][0] - dp[v][1] + w); } int cnt = 0; int now = ::now - (ind[u] - (int)(q[u].size()) - (int)(e[u].size())); auto it = q[u].end(); while (1) { if (it == q[u].begin()) break; it--; int x = *it; if (cnt >= (int)(e[u].size()) || cnt >= now) break; cnt++; vec.push_back(x); } sort(vec.begin(), vec.end(), greater<long long>()); for (int i = 0; i <= now - 2; ++i) if (vec[i] >= 0) dp[u][0] += vec[i]; dp[u][1] = dp[u][0]; if (now > 0 && vec[now - 1] >= 0) dp[u][1] += vec[now - 1]; dp[u][0] += sum, dp[u][1] += sum; } std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) { answers.resize(N); n = N; long long nowval = 0; for (int i = 0; i <= N - 2; ++i) { U[i]++, V[i]++; e[U[i]].insert({V[i], W[i]}); e[V[i]].insert({U[i], W[i]}); ind[U[i]]++, ind[V[i]]++; nowval += W[i]; } for (int i = 1; i <= n; ++i) pq.push({i, ind[i]}); for (int i = 1; i <= n; ++i) S.insert(i); int maxind = 0; for (int i = 1; i <= n; ++i) maxind = max(maxind, ind[i]); for (int i = 0; i <= n - 1; ++i) { now = i; if (now > maxind) break; for (int j : S) { dp[j][0] = dp[j][1] = 0, vis[j] = 0; while ((int)(q[j].size()) > ind[j] - now && (int)(q[j].size())) { val[j] -= *--q[j].end(); nowval -= *--q[j].end(); q[j].erase(--q[j].end()); } } vector<node> tmp; while (!pq.empty()) { auto x = pq.top(); if (x.val <= now) { tmp.push_back(x); cur[x.u] = 1; for (auto it = e[x.u].begin(); it != e[x.u].end();) { auto xx = *it; it++; if (!cur[xx.first]) { e[x.u].erase(e[x.u].lower_bound({xx.first, 0})); e[xx.first].erase(e[xx.first].lower_bound({x.u, 0})); q[xx.first].insert(xx.second); val[xx.first] += xx.second; } } } else break; pq.pop(); } for (int j : S) { dp[j][0] = dp[j][1] = 0, vis[j] = 0; while ((int)(q[j].size()) > ind[j] - now && (int)(q[j].size())) { val[j] -= *--q[j].end(); nowval -= *--q[j].end(); q[j].erase(--q[j].end()); } } for (auto x : tmp) S.erase(x.u); now = i; for (int x : S) if (!vis[x]) dfs(x, 0), answers[i] += max(dp[x][0], dp[x][1]); answers[i] = nowval - answers[i]; } return answers; } int main() { int N; assert(1 == scanf( %d , &N)); std::vector<int> U(N - 1), V(N - 1), W(N - 1); for (int i = 0; i < N - 1; ++i) { assert(3 == scanf( %d %d %d , &U[i], &V[i], &W[i])); U[i]--, V[i]--; } std::vector<long long> closure_costs = minimum_closure_costs(N, U, V, W); for (int i = 0; i < static_cast<int>(closure_costs.size()); ++i) { if (i > 0) { printf( ); } printf( %lld , closure_costs[i]); } printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-5; const int inf = (1 << 31) - 1; const int hinf = 1000000000; const int mod = 1000000007; const int N = 3030; int dp[3030][3030]; int n; int head[3030]; int weizhi; struct node { int u, v, w, next; } point[3030 << 1]; void add(int u, int v, int w) { point[weizhi].u = u; point[weizhi].v = v; point[weizhi].w = w; point[weizhi].next = head[u]; head[u] = weizhi++; } void dfs(int now, int par, int dp[N]) { dp[now] = 0; for (int k = head[now]; k != -1; k = point[k].next) { int i = point[k].v; if (i == par) continue; dfs(i, now, dp); dp[now] += dp[i] + point[k].w; } } void DFS(int now, int p, int a, int& ret) { ret = min(ret, dp[now][now] - dp[now][a]); for (int k = head[now]; k != -1; k = point[k].next) { int i = point[k].v; if (i == p) continue; DFS(i, now, a, ret); } } int main() { scanf( %d , &n); int a, b; memset((head), -1, sizeof(head)); weizhi = 0; for (int i = 1; i < n; i++) { scanf( %d%d , &a, &b); add(a, b, 0); add(b, a, 1); } memset(dp, 0, sizeof(dp)); if (n == 1) { cout << 0 << endl; return 0; } for (int i = 1; i <= n; i++) { dfs(i, -1, dp[i]); } int ans = inf; for (int u = 1; u <= n; u++) { for (int k = head[u]; k != -1; k = point[k].next) { int i = point[k].v; int w = point[k].w; if (w) continue; int ret1 = inf; int ret2 = inf; DFS(i, u, u, ret1); DFS(u, i, i, ret2); ans = min(ans, ret1 + ret2 - 1); } } printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << p.second << ) ; } template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v) { cout << [ ; for (int i = 0; i < v.size(); i++) { if (i) cout << , ; cout << v[i]; } return cout << ] ; } template <typename A, typename B> istream &operator>>(istream &cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } mt19937 rng(steady_clock::now().time_since_epoch().count()); void usaco(string filename) { freopen((filename + .in ).c_str(), r , stdin); freopen((filename + .out ).c_str(), w , stdout); } const long double pi = 3.14159265358979323846; const long long mod = 1000000007; long long n, m, k, q, Q, T, l, r, x, y, z; long long c[1000005]; string second, t; long long ans = 0; int pt, a, b; int query(int a, int b) { cout << ? << a << << b << endl; cin >> x; return x; } void getZero() { if (pt < 0) { cout << ! << a << << b << endl; exit(0); } b ^= (1 << pt); x = query(a, b); if (x == 1) a ^= (1 << pt); else b ^= (1 << pt); --pt; getZero(); } int main() { { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }; pt = 29; a = b = 0; int cache = -2; while (pt >= 0) { int x, y; if (cache == -2) { x = query(a, b); } else x = cache; if (x == 0) getZero(); a ^= (1 << pt); b ^= (1 << pt); y = query(a, b); if (x == y) cache = x; else cache = -2; if (x == y) { a ^= (1 << pt); z = query(a, b); if (z == 1) a ^= (1 << pt); else b ^= (1 << pt); } else { if (x > y) b ^= (1 << pt); else a ^= (1 << pt); } --pt; } cout << ! << a << << b << endl; }
|
#include <bits/stdc++.h> using namespace std; long long f[20][55][2600], c[20]; long long l[5005], tot = 0; void Turn(long long k) { memset(c, 0, sizeof(c)); while (k) c[++c[0]] = k % 10, k /= 10; return; } int gcd(int x, int y) { return x % y ? gcd(y, x % y) : y; } long long Search(int x, int lcm, int num, bool flag) { if (!x && num % lcm == 0) return 1; else if (!x) return 0; if (!flag && ~f[x][l[lcm]][num]) return f[x][l[lcm]][num]; int k = flag ? c[x] : 9; long long s = 0; for (int i = 0; i <= k; i++) { s += Search(x - 1, i ? lcm * i / gcd(lcm, i) : lcm, (num * 10 + i) % 2520, flag && i == k); } if (!flag) f[x][l[lcm]][num] = s; return s; } long long Calc(long long k) { Turn(k); return Search(c[0], 1, 0, 1); } int main() { for (int i = 1; i <= 2520; i++) if (2520 % i == 0) l[i] = ++tot; memset(f, -1, sizeof(f)); long long x, y; int T; cin >> T; while (T--) { cin >> x >> y; cout << Calc(y) - Calc(x - 1) << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 100, INF = 1e9; struct edge { long long to, cost, id; }; vector<edge> g[N]; long long d[N], cost[N], path[N], used[N]; pair<long long, long long> from[N]; long long n, m; void bfs() { fill(d, d + n, INF); d[0] = 0; queue<long long> q; q.push(0); while ((long long)q.size()) { long long v = q.front(); q.pop(); if (used[v]) continue; used[v] = 1; for (auto i : g[v]) { long long u = i.to; long long c = cost[v] + i.cost; if (d[v] + 1 < d[u] || (d[v] + 1 == d[u] && c < cost[u])) { d[u] = d[v] + 1; from[u] = {v, i.id}; cost[u] = c; q.push(u); } } } long long v = n - 1; while (v != 0) { long long id = from[v].second; path[id] = 1; v = from[v].first; } } signed main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m; vector<pair<pair<long long, long long>, long long>> ed(m); for (long long i = 0; i < m; i++) { long long a, b, c; cin >> a >> b >> c; a--; b--; ed[i] = {{a, b}, c}; c ^= 1; g[a].push_back({b, c, i}); g[b].push_back({a, c, i}); } bfs(); long long ans = 0; for (long long i = 0; i < m; i++) { if (path[i] && ed[i].second == 0 || (!path[i] && ed[i].second == 1)) ans++; } cout << ans << n ; for (long long i = 0; i < m; i++) { if (path[i] && ed[i].second == 0 || (!path[i] && ed[i].second == 1)) cout << ed[i].first.first + 1 << << ed[i].first.second + 1 << << (ed[i].second ^ 1) << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000010; const int mod = 1e9 + 7; int t[N], dp[2][3][3]; int main() { int n, K; scanf( %d%d , &n, &K); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); t[x]++; } int cur = 1, pre = 0; for (int i = 1; i <= K; i++) { memset(dp[cur], 0, sizeof(dp[cur])); for (int j = 0; j < 3; j++) for (int k = 0; k < 3; k++) for (int l = 0; l < 3; l++) if (j + k + l <= t[i]) dp[cur][k][l] = max(dp[cur][k][l], dp[pre][j][k] + l + (t[i] - j - k - l) / 3); swap(cur, pre); } printf( %d n , dp[pre][0][0]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int MOD = 1e9 + 7; long long int INF = 1e18; long long int sub(long long int a, long long int b, long long int p = MOD) { return ((a % p) - (b % p) + p) % p; } long long int mult(long long int a, long long int b, long long int p = MOD) { return ((a % p) * (b % p)) % p; } long long int add(long long int a, long long int b, long long int p = MOD) { return (a % p + b % p) % p; } long long int fpow(long long int n, long long int k, long long int p = MOD) { long long int r = 1; while (k > 0) { if (k & 1) r = r * n % p; n = n * n % p; k = k >> 1; } return r; } long long int inv(long long int a, long long int p = MOD) { return fpow(a, p - 2, p); } long long int power(long long int a, long long int b) { long long int ans = 1; long long int i; for (i = 1; i < b + 1; i++) { ans *= a; } return ans; } long long int fdiv(long long int a, long long int b, long long int p = MOD) { long long int yinv = inv(b); long long int ans = (a * yinv) % p; return ans; } unsigned long long int I1018 = 1000000000000000000; const unsigned long long int I10e5 = 100000; const long long int I10e6 = 1e6; template <typename T> istream &operator>>(istream &in, vector<T> &a) { for (auto &item : a) { in >> item; } return in; } template <typename T, typename U> ostream &operator<<(ostream &out, pair<T, U> &a) { cout << a.first << << a.second; return out; } template <typename T, typename U> istream &operator>>(istream &out, pair<T, U> &a) { cin >> a.first >> a.second; return out; } template <typename T, typename U> ostream &operator<<(ostream &out, map<T, U> &a) { for (auto &item : a) { out << item << endl; } return out; } template <typename T> ostream &operator<<(ostream &out, vector<T> &a) { for (auto &item : a) { out << item << ; } return out; } template <typename T> ostream &operator<<(ostream &out, vector<vector<T>> &a) { for (auto &item : a) { out << item << n ; } return out; } std::vector<bool> is_prime; std::vector<long long int> primes; void sieve(long long int n) { is_prime.resize(n + 2, true); primes.clear(); long long int p; for (p = 2; p * p <= n; p++) { if (is_prime[p]) { long long int i; for (i = p * p; i <= n; i += p) { is_prime[i] = false; } } } is_prime[0] = is_prime[1] = false; long long int i; for (i = 2; i <= n; i++) { if (is_prime[i]) { primes.emplace_back(i); } } } map<long long int, long long int> prime_factors(long long int n) { map<long long int, long long int> s; long long int i; long long int tc = 0; while (n % 2 == 0) { tc++; n /= 2; } if (tc > 0) { s[2] = tc; } for (i = 3; i <= sqrt(n); i += 2) { tc = 0; while (n % i == 0) { tc++; n /= i; } if (tc > 0) { s[i] = tc; } } if (n > 2) { s[n] += 1; } return s; } std::vector<long long int> fact_vec; void fact_fun(long long int n) { fact_vec.resize(n + 10); long long int i; fact_vec[0] = 1; for (i = 1; i <= n + 2; i++) { fact_vec[i] = (fact_vec[i - 1] * i) % MOD; } } long long int npr(long long int n, long long int r) { long long int ans = fact_vec[n]; ans /= fact_vec[n - r]; return ans; } long long int ncr(long long int n, long long int r) { long long int ans = fact_vec[n]; ans = fdiv(ans, fact_vec[n - r]); ans = fdiv(ans, fact_vec[r]); return ans; } long long int nc2(long long int n) { return (n * (n - 1)) / 2; } int main() { long long int i, j; ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; long long int n = s.length(); std::vector<long long int> cnt(n + 10, 0); for (i = 0; i < n; i++) { cnt[i + 1] = cnt[i] + ((s[i] >= A && s[i] <= Z ) ? 1 : 0); } long long int ans = INF; for (i = 0; i < n + 1; i++) { long long int left = i - cnt[i]; long long int right = cnt[n] - cnt[i]; ans = min(ans, left + right); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; const long long MOD = 1000000007; long long k, w, ans; long long fac[MAXN]; long long inv[MAXN]; long long power(long long a, long long b) { long long res = 1; while (b) { if (b & 1) (res *= a) %= MOD; (a *= a) %= MOD; b >>= 1; } return res; } void init() { fac[0] = 1; for (int i = 1; i <= k; i++) fac[i] = fac[i - 1] * i % MOD; inv[k] = power(fac[k], MOD - 2); for (int i = k; i >= 1; i--) inv[i - 1] = inv[i] * i % MOD; } int main() { cin >> k >> w; init(); for (int i = 1; i <= k; i++) { if (i <= w - 1) (ans += i * fac[k] % MOD * fac[k] % MOD * power(k, w - i - 1) % MOD * inv[k - i] % MOD * inv[k - i]) %= MOD; else (ans += w * fac[k] % MOD * fac[k - i + w - 1] % MOD * inv[k - i] % MOD * inv[k - i] % MOD) %= MOD; if (i < k) { if (i + 1 <= w - 1) (ans += i * fac[k] % MOD * fac[k] % MOD * power(k, w - i - 2) % MOD * inv[k - i] % MOD * inv[k - i - 1]) %= MOD; else (ans += (w - 1) * fac[k] % MOD * fac[k - i + w - 2] % MOD * inv[k - i] % MOD * inv[k - i - 1]) %= MOD; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; const double sn = 1e-9; const long double PI = 3.141592653589793238L; int n, c, d; int mc[100005]; int md[100005]; vector<pair<int, int>> ac; vector<pair<int, int>> ad; bool cmp(pair<int, int> p1, pair<int, int> p2) { return p1.first > p2.first; } int check(int l, int r, vector<pair<int, int>> &arr, int v) { while (l != r) { int mid = (l + r) / 2; if (arr[mid].first <= v) r = mid; else l = mid + 1; } return l; } int main() { scanf( %d%d%d , &n, &c, &d); for (int i = 0; i < n; i++) { int b, p; char t[5]; scanf( %d%d%s , &b, &p, t); if (t[0] == C ) { ac.push_back(make_pair(p, b)); } else { ad.push_back(make_pair(p, b)); } } sort(ac.begin(), ac.end(), cmp); sort(ad.begin(), ad.end(), cmp); int sz1 = ac.size(), sz2 = ad.size(); if (sz1 != 0) { mc[sz1 - 1] = ac[sz1 - 1].second; for (int i = sz1 - 2; i >= 0; i--) mc[i] = max(ac[i].second, mc[i + 1]); } if (sz2 != 0) { md[sz2 - 1] = ad[sz2 - 1].second; for (int i = sz2 - 2; i >= 0; i--) md[i] = max(ad[i].second, md[i + 1]); } int abc = check(0, sz1, ac, c), abd = check(0, sz2, ad, d); int mh = INT_MIN; if (abc != sz1 && abd != sz2) { mh = max(mh, mc[abc] + md[abd]); } for (int i = 0; i < sz1; i++) { if (ac[i].first > c) continue; int v = check(i + 1, sz1, ac, c - ac[i].first); if (v != sz1) { mh = max(mh, mc[v] + ac[i].second); } } for (int i = 0; i < sz2; i++) { if (ad[i].first > d) continue; int v = check(i + 1, sz2, ad, d - ad[i].first); if (v != sz2) { mh = max(mh, md[v] + ad[i].second); } } printf( %d n , max(mh, 0)); return 0; }
|
#include <bits/stdc++.h> using namespace std; #define FOR(n) for(int i = 0; i < int(n); ++i) #define RFOR(n) for(int i = n; ~i; --i) int gcd(int a, int b) { if(b == 0) return a; return gcd(b, a % b); } void solve() { int n; cin >> n; map<pair<int, int>, int> mp; long long ans = 0; FOR(n) { int x, y, u, v; cin >> x >> y >> u >> v; x -= u; y -= v; int g = gcd(abs(x), abs(y)); x /= g; y /= g; mp[{x, y}]++; ans += mp[{-x, -y}]; } cout << ans << n ; } int main(int argc, char* argv[]) { ios::sync_with_stdio(false); cin.tie(nullptr); int testCase = 1; cin >> testCase; for(int t = 0; t < testCase; ++t) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int> > edges(2e5 + 5); bool vis[200005]; int lev[200005]; int n, m, a, b, mx; void bfs(int node) { int level = 0; deque<pair<int, int> > dq; dq.push_back({level, node}); vis[node] = 1; while (!dq.empty()) { node = dq.front().second, level = dq.front().first; lev[node] = level; dq.pop_front(); for (auto i : edges[node]) if (!vis[i]) dq.push_back({level + 1, i}), vis[node] = 1; } memset(vis, 0, sizeof vis), a = 0; } void dfs(int node) { if (a >= lev[node]) return; vis[node] = 1; mx = max(mx, lev[node]); for (auto i : edges[node]) if (!vis[i]) a++, dfs(i), a--; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 1; i < n; i++) cin >> a >> b, edges[a].push_back(b), edges[b].push_back(a); bfs(1); dfs(m); cout << mx * 2 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int d, n, m; int cntl[100011], cntr[100011], cntt[100011], cntb[100011]; struct Sofa { int x1, y1, x2, y2; } sofa[100011]; int main() { scanf( %d , &d); scanf( %d %d , &n, &m); for (int i = 0; i < d; i++) { int x1, y1, x2, y2; scanf( %d %d %d %d , &x1, &y1, &x2, &y2); cntl[min(x1, x2)]++; cntr[max(x1, x2)]++; cntt[min(y1, y2)]++; cntb[max(y1, y2)]++; sofa[i].x1 = x1; sofa[i].y1 = y1; sofa[i].x2 = x2; sofa[i].y2 = y2; } for (int i = 1; i <= n; i++) cntl[i] += cntl[i - 1]; for (int i = n; i >= 0; i--) cntr[i] += cntr[i + 1]; for (int i = 1; i <= m; i++) cntt[i] += cntt[i - 1]; for (int i = m; i >= 0; i--) cntb[i] += cntb[i + 1]; int tl, tr, tt, tb; scanf( %d %d %d %d , &tl, &tr, &tt, &tb); for (int i = 0; i < d; i++) { int tmpl = cntl[max(sofa[i].x1, sofa[i].x2) - 1], tmpr = cntr[min(sofa[i].x1, sofa[i].x2) + 1], tmpt = cntt[max(sofa[i].y1, sofa[i].y2) - 1], tmpb = cntb[min(sofa[i].y1, sofa[i].y2) + 1]; if (max(sofa[i].x1, sofa[i].x2) != min(sofa[i].x1, sofa[i].x2)) { tmpl--; tmpr--; } if (max(sofa[i].y1, sofa[i].y2) != min(sofa[i].y1, sofa[i].y2)) { tmpt--; tmpb--; } if (tmpl == tl && tmpr == tr && tmpt == tt && tmpb == tb) { cout << i + 1; return 0; } } cout << -1; return 0; }
|
#include <bits/stdc++.h> int main() { long long int n; long long int x; long long int y; long long int number; scanf( %I64d %I64d %I64d , &n, &x, &y); number = y - (n - 1); while (true) { if (number <= 0) { printf( -1 n ); break; } if (number * number + n - 1 >= x) { printf( %I64d n , number); for (int i = 0; i < n - 1; i++) { printf( 1 n ); } break; } number--; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int c = 0, h = 0; while (n > c + h) { h++; c += h; n -= c; } cout << h << endl; }
|
#include <bits/stdc++.h> using namespace std; constexpr long long ROWS = 2; constexpr long long NMAX = 1e5; long long h[ROWS][NMAX]; long long dp[ROWS][NMAX]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long COLS; cin >> COLS; for (long long i = 0; i < ROWS; ++i) for (long long j = 0; j < COLS; ++j) cin >> h[i][j]; for (long long j = COLS - 1; j >= 0; --j) for (long long i = ROWS - 1; i >= 0; --i) { if (j == COLS - 1) dp[i][j] = h[i][j]; else if (j == COLS - 2) dp[i][j] = h[i][j] + h[i == 0 ? 1 : 0][j + 1]; else dp[i][j] = h[i][j] + max(dp[i == 0 ? 1 : 0][j + 1], dp[i == 0 ? 1 : 0][j + 2]); } cout << max(dp[0][0], dp[1][0]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long ans = 0; long long mod = 1e9 + 7; int cnt[100005], Tcnt[100005], arr[100005]; vector<int> pri; void era() { pri.push_back(2); for (int i = 3; i <= 100000; i += 2) { if (!arr[i]) for (long long j = (long long)i * i; j <= 100000; j += i) { arr[j] = 1; } } for (int i = 3; i <= 100000; i += 2) { if (arr[i] == 0) pri.push_back(i); } } int GGG(int p) { int ret = 0; for (int i = 0; i < pri.size(); i++) { if (pri[i] > p) break; int cnt = 0; while (p % pri[i] == 0) { p /= pri[i]; ++cnt; } if (cnt >= 2) return -1; if (cnt != 0) ret++; } return ret; } long long po(int k) { if (k == 0) return 1; if (k == 1) return 2; long long ret = po(k / 2); ret = ret * ret % mod; if (k & 1) ret = ret * 2 % mod; return ret; } int main() { era(); int n; scanf( %d , &n); for (int t, i = 1; i <= n; i++) { scanf( %d , &t); cnt[t]++; } for (int i = 2; i <= 100000; i++) { for (int j = i; j <= 100000; j += i) { Tcnt[i] += cnt[j]; } } ans += po(n) - 1; for (int i = 2; i <= 100000; i++) { if (Tcnt[i] == 0) continue; int Gcnt = GGG(i); if (Gcnt == -1) continue; if (Gcnt % 2 == 0) { ans += po(Tcnt[i]) - 1; ans %= mod; } else { ans -= po(Tcnt[i]) - 1; while (ans < 0) ans += mod; } } printf( %I64d , ans); }
|
#include <bits/stdc++.h> const long long MaxN = 205; const long long lim = 1e18 + 5; template <class t> inline void read(t &s) { s = 0; register long long f = 1; register char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar(); s *= f; return; } template <class t, class... A> inline void read(t &x, A &...a) { read(x); read(a...); } template <class t> inline void write(t x) { if (x < 0) putchar( - ), x = -x; long long buf[21], top = 0; while (x) buf[++top] = x % 10, x /= 10; if (!top) buf[++top] = 0; while (top) putchar(buf[top--] ^ 0 ); return; } inline void setIn(std::string s) { freopen(s.c_str(), r , stdin); return; } inline void setOut(std::string s) { freopen(s.c_str(), w , stdout); return; } inline void setIO(std::string s = ) { setIn(s + .in ); setOut(s + .out ); return; } template <class t> inline bool checkmin(t &x, t y) { if (x > y) { x = y; return 1; } return 0; } template <class t> inline bool checkmax(t &x, t y) { if (x < y) { x = y; return 1; } return 0; } inline long long lowbit(long long x) { return x & (-x); } long long a[MaxN][MaxN], p[MaxN], t[MaxN], n, m, K, q; long long b[MaxN], f[MaxN][MaxN]; inline void add(long long &x, long long y) { (x += y) >= lim && (x = lim); } inline long long calc() { std::memset(f, 0, sizeof f); f[0][0] = 1; for (long long i = 1; i <= q; ++i) { if (b[i] >= 0) for (long long j = 1; j <= q; ++j) add(f[i][j], f[i - 1][j - 1]); if (b[i] <= 0) for (long long j = 0; j < q; ++j) add(f[i][j], f[i - 1][j + 1]); } return f[q][0]; } signed main(void) { read(n, m, K); for (long long i = 1; i <= n; ++i) for (long long j = 1; j <= m; ++j) read(a[i][j]); { std::vector<std::pair<long long, long long> > dr; for (long long i = 1; i <= n; ++i) for (long long j = 1; j <= m; ++j) dr.push_back(std::make_pair(a[i][j], i + j - 1)); std::sort((dr).begin(), (dr).end()); register long long cnt = 0; for (auto i : dr) if (!p[i.second]) p[i.second] = ++cnt; for (long long i = 1; i <= cnt; ++i) t[p[i]] = i; for (long long i = 1; i <= cnt; ++i) p[i] = t[i]; } q = n + m - 1; register long long sum = 0; for (long long i = 1; i <= q; ++i) { b[p[i]] = 1; register long long t = calc(); if (sum + t >= K) continue; b[p[i]] = -1; sum += t; } for (long long i = 1; i <= n; ++i, std::puts( )) for (long long j = 1; j <= m; ++j) std::putchar(b[i + j - 1] > 0 ? ( : ) ); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); const int mod = (int)1e9 + 7; const int maxn = (int)1e5 + 10; int pp[4 * maxn]; int a[maxn], c[6][6], pw[maxn][6], pref[maxn][6]; struct node { int cnt; int sum[6]; node() { cnt = 0; memset(sum, 0, sizeof(sum)); } node(int cntt) { cnt = cntt; memset(sum, 0, sizeof(sum)); } } t[4 * maxn]; void push(int idx, int l, int m, int r) { if (pp[idx] != -1) { pp[2 * idx] = pp[idx]; pp[2 * idx + 1] = pp[idx]; for (int i = 0; i <= 5; i++) { t[2 * idx].sum[i] = (long long)pref[m - l + 1][i] * pp[idx] % mod; t[2 * idx + 1].sum[i] = (long long)pref[r - m][i] * pp[idx] % mod; } pp[idx] = -1; } } void make(int idx) { t[idx].cnt = t[2 * idx].cnt + t[2 * idx + 1].cnt; for (int i = 0; i <= 5; i++) { t[idx].sum[i] = t[2 * idx].sum[i]; for (int j = i; j >= 0; j--) { t[idx].sum[i] += (long long)((long long)t[2 * idx + 1].sum[i - j] * c[i][j] % mod) * pw[t[2 * idx].cnt][j] % mod; t[idx].sum[i] %= mod; } } } void build(int l, int r, int idx) { if (l == r) { t[idx].cnt = 1; for (int i = 0; i <= 5; i++) { t[idx].sum[i] = a[l]; } } else { int m = (l + r) >> 1; build(l, m, 2 * idx); build(m + 1, r, 2 * idx + 1); make(idx); } } void put(int l, int r, int a, int b, int val, int idx) { if (b < l || r < a) return; if (a <= l && r <= b) { pp[idx] = val; for (int i = 0; i <= 5; i++) { t[idx].sum[i] = (long long)pref[r - l + 1][i] * val % mod; } } else { int m = (l + r) >> 1; push(idx, l, m, r); put(l, m, a, b, val, 2 * idx); put(m + 1, r, a, b, val, 2 * idx + 1); make(idx); } } node make(node lf, node rg) { if (lf.cnt == 0) return rg; if (rg.cnt == 0) return lf; node res = lf; res.cnt += rg.cnt; for (int i = 0; i <= 5; i++) { for (int j = i; j >= 0; j--) { res.sum[i] += (long long)((long long)rg.sum[i - j] * c[i][j] % mod) * pw[lf.cnt][j] % mod; res.sum[i] %= mod; } } return res; } node get(int l, int r, int a, int b, int idx) { if (b < l || r < a) return node(0); if (a <= l && r <= b) return t[idx]; int m = (l + r) >> 1; push(idx, l, m, r); node lf = get(l, m, a, b, 2 * idx); node rg = get(m + 1, r, a, b, 2 * idx + 1); return make(lf, rg); } int main() { memset(pp, -1, sizeof(pp)); for (int i = 1; i < maxn; i++) { pw[i][0] = 1; for (int j = 1; j <= 5; j++) { pw[i][j] = (long long)pw[i][j - 1] * i % mod; } for (int j = 0; j <= 5; j++) { pref[i][j] = pref[i - 1][j] + pw[i][j]; pref[i][j] %= mod; } } for (int i = 0; i <= 5; i++) { c[i][0] = 1; } for (int i = 1; i <= 5; i++) { for (int j = 1; j <= i; j++) { c[i][j] = c[i - 1][j] + c[i - 1][j - 1]; } } int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } build(0, n - 1, 1); int l, r, x; char s[11]; for (int i = 0; i < m; i++) { scanf( %s%d%d%d , s, &l, &r, &x); --l; --r; if (s[0] == = ) { put(0, n - 1, l, r, x, 1); } else { printf( %d n , get(0, n - 1, l, r, 1).sum[x]); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 6e5 + 20; int main() { int n, filas, columnas; cin >> n; while (n--) { cin >> filas >> columnas; int arr[300][300] = {0}; bool ya = false; for (int i = 0; i < filas; i++) { for (int j = 0; j < columnas; j++) { cin >> arr[i][j]; if (arr[i][j] > 4) ya = true; else if ((i == 0 && j == 0) || (i == 0 && j == columnas - 1) || (i == filas - 1 && j == 0) || (i == filas - 1 && j == columnas - 1)) { if (arr[i][j] > 2) ya = true; } else if (i == 0 || i == filas - 1 || j == 0 || j == columnas - 1) { if (arr[i][j] > 3) ya = true; } } } if (ya) cout << NO << endl; else { cout << YES << endl; for (int i = 0; i < filas; i++) { for (int j = 0; j < columnas; j++) { if ((i == 0 && j == 0) || (i == 0 && j == columnas - 1) || (i == filas - 1 && j == 0) || (i == filas - 1 && j == columnas - 1)) cout << 2 << ; else if (i == 0 || i == filas - 1 || j == 0 || j == columnas - 1) cout << 3 << ; else cout << 4 << ; } cout << endl; } } } }
|
#include <bits/stdc++.h> using namespace std; char str[100010]; int f[100010][26 + 2], pre[100010][26], suf[100010][26], g[100010], n; int ans[26 + 2]; int dfs(int l, int r, int c, int fl) { if (l > r) return 0; if (ans[c] != -1) return ans[c]; int u = 0; for (int i = 0; i < 26; i++) { int L = suf[l][i], R = pre[r][i]; if (R < l) continue; int s = g[L] ^ g[R]; if (!fl) s ^= f[L - 1][c] ^ dfs(R + 1, r, i, 0); else s ^= dfs(l, L - 1, i, 1) ^ f[r][i]; u |= 1 << s; } return ans[c] = __builtin_ctz(~u); } int main() { scanf( %s , str + 1); n = strlen(str + 1); for (int i = 1; i <= n; i++) { for (int j = 0; j < 26; j++) pre[i][j] = pre[i - 1][j]; pre[i][str[i] - a ] = i; } for (int i = 0; i < 26; i++) suf[n + 1][i] = n + 1; for (int i = n; i >= 1; i--) { for (int j = 0; j < 26; j++) suf[i][j] = suf[i + 1][j]; suf[i][str[i] - a ] = i; } for (int i = 1; i <= n; i++) { int c = str[i] - a ; g[i] = f[i - 1][c] ^ g[pre[i - 1][c]]; memset(ans, -1, sizeof(ans)); for (int j = 0; j < 26; j++) f[i][j] = dfs(pre[i][j] + 1, i, j, 0); } int m; scanf( %d , &m); while (m-- > 0) { int l, r; scanf( %d%d , &l, &r); memset(ans, -1, sizeof(ans)); if (dfs(l, r, 26, 1)) puts( Alice ); else puts( Bob ); } }
|
#include <bits/stdc++.h> namespace ZDY { #pragma GCC optimize(3) template <class T> __inline__ __attribute__((always_inline)) T ABS(T x) { return x > 0 ? x : -x; } template <class T> __inline__ __attribute__((always_inline)) T MAX(T x, T y) { return x > y ? x : y; } template <class T> __inline__ __attribute__((always_inline)) T MIN(T x, T y) { return x < y ? x : y; } template <class T> __inline__ __attribute__((always_inline)) T GCD(T x, T y) { return y ? GCD(y, x % y) : x; } template <class T> __inline__ __attribute__((always_inline)) void SWAP(T &x, T &y) { T t = x; x = y; y = t; } } // namespace ZDY using namespace ZDY; using namespace std; namespace IO { const int str = 1 << 20; static char in_buf[str], *in_s, *in_t; bool __ = 0; __inline__ __attribute__((always_inline)) char gc() { return (in_s == in_t) && (in_t = (in_s = in_buf) + fread(in_buf, 1, str, stdin)), in_s == in_t ? EOF : *in_s++; } __inline__ __attribute__((always_inline)) void in(string &ch) { ch.clear(); if (__) return; char c; while ((c = gc()) != EOF && isspace(c)) ; if (c == EOF) { __ = 1; return; } ch += c; while ((c = gc()) != EOF && !isspace(c)) ch += c; if (c == EOF) __ = 1; } __inline__ __attribute__((always_inline)) void in(char &ch) { if (__) return; char c; while ((c = gc()) != EOF && isspace(c)) ; if (c == EOF) __ = 1; else ch = c; } __inline__ __attribute__((always_inline)) void in(char *ch) { *ch = 0 ; if (__) return; char c; while ((c = gc()) != EOF && isspace(c)) ; if (c == EOF) { __ = 1; return; } *ch = c; ch++; while ((c = gc()) != EOF && !isspace(c)) *ch = c, ch++; if (c == EOF) __ = 1; *ch = 0 ; } template <typename T> __inline__ __attribute__((always_inline)) void in(T &x) { if (__) return; char c = gc(); bool f = 0; while (c != EOF && (c < 0 || c > 9 )) f ^= (c == - ), c = gc(); if (c == EOF) { __ = 1; return; } x = 0; while (c != EOF && 0 <= c && c <= 9 ) x = x * 10 + c - 48, c = gc(); if (c == EOF) __ = 1; if (f) x = -x; } template <typename T, typename... arr> __inline__ __attribute__((always_inline)) void in(T &x, arr &...y) { in(x), in(y...); } const char ln = n ; static char out_buf[str], *out_s = out_buf, *out_t = out_buf + str; __inline__ __attribute__((always_inline)) void flush() { fwrite(out_buf, 1, out_s - out_buf, stdout); out_s = out_buf; } __inline__ __attribute__((always_inline)) void pt(char c) { (out_s == out_t) ? (fwrite(out_s = out_buf, 1, str, stdout), *out_s++ = c) : (*out_s++ = c); } __inline__ __attribute__((always_inline)) void out(const char *s) { while (*s) pt(*s++); } __inline__ __attribute__((always_inline)) void out(char *s) { while (*s) pt(*s++); } __inline__ __attribute__((always_inline)) void out(char c) { pt(c); } __inline__ __attribute__((always_inline)) void out(string s) { for (int i = 0; s[i]; i++) pt(s[i]); } template <typename T> __inline__ __attribute__((always_inline)) void out(T x) { if (!x) { pt( 0 ); return; } if (x < 0) pt( - ), x = -x; char a[50], t = 0; while (x) a[t++] = x % 10, x /= 10; while (t--) pt(a[t] + 0 ); } template <typename T, typename... arr> __inline__ __attribute__((always_inline)) void out(T x, arr &...y) { out(x), out(y...); } } // namespace IO using namespace IO; int n, head[1000011], cnt = 0, a[1000011]; struct edge { int to, nxt; } e[1000011 * 2]; __inline__ __attribute__((always_inline)) void add(int x, int y) { e[++cnt].to = y; e[cnt].nxt = head[x]; head[x] = cnt; } void dfs(int x, int d) { a[x] = d; for (int i(head[x]), to; to = e[i].to, i; i = e[i].nxt) if (!a[to]) dfs(to, MIN(d, to)); } int main() { int q, opt, x, y, la = 0, tt = 2122219134; in(n, q); for (int i(1); i <= n - 1; ++i) in(x, y), add(x, y), add(y, x); in(y, x); x = x % n + 1; dfs(x, x); while (--q) { in(opt, x); x = (la + x) % n + 1; if (opt == 1) tt = MIN(tt, a[x]); else out(la = MIN(tt, a[x]), ln); } flush(); }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; char dis[2000010]; int a[2000010]; int main() { int t; scanf( %d , &t); for (int i = 0; i < 200010; i += 3) { dis[i] = R , dis[i + 1] = G , dis[i + 2] = B ; } while (t--) { int n, k; scanf( %d %d , &n, &k); string s; cin >> s; int minn = INF; int x = 0; while (x < 3) { for (int i = 0; i < n; i++) { if (s[i] != dis[i + x]) a[i] = 1; else a[i] = 0; if (i != 0) a[i] = a[i - 1] + a[i]; } x++; minn = min(minn, a[k - 1]); for (int i = k; i < n; i++) { minn = min(minn, a[i] - a[i - k]); } } printf( %d n , minn); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c, d, e, f, g, h, i, j, k, l, n, v, t; cin >> n >> k; long long m[k]; for (i = 0; i < k; i++) cin >> m[i]; if (n % 2 == 0) { a = m[k - 1]; if (a & 1) cout << odd n ; else cout << even n ; } else { a = 0; for (i = 0; i < k; i++) { if (m[i] & 1) a++; } if (a & 1) cout << odd n ; else cout << even n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long n; cin >> n; int s = 0, a; a = n / 100; n = n % 100; s += a; if (n != 0) { a = n / 20; n %= 20; s += a; if (n != 0) { a = n / 10; n %= 10; s += a; if (n != 0) { a = n / 5; n %= 5; s += a; if (n != 0) s += n; } } } cout << s; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 9; int pre[MAX], suf[MAX], a[MAX]; long long ans = 0, cnt = 0; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i], pre[i] = (i > 0 ? pre[i - 1] + a[i] : a[i]); int sum = pre[n - 1] / 3; if (pre[n - 1] % 3 != 0) return cout << 0, 0; for (int i = n - 1; i >= 0; i--) suf[i] = suf[i + 1] + a[i]; if (pre[0] == sum) cnt++; for (int i = 2; i < n; i++) { if (suf[i] == sum) ans += cnt; if (pre[i - 1] == sum) cnt++; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long INF = 1e18; const double EPS = 1e-6; const int MAX_N = 500 + 5; int n; int arr[MAX_N]; int memo[MAX_N][MAX_N]; int memo2[MAX_N][MAX_N]; int dp(int l, int r) { if (l == r) return memo[l][r] = arr[l]; if (memo[l][r] != -1) return memo[l][r]; for (int i = l; i < r; ++i) { if (dp(l, i) == dp(i + 1, r) && dp(l, i) > 0) return memo[l][r] = dp(l, i) + 1; } return memo[l][r] = -10; } int solve(int l, int r) { if (memo[l][r] != -10) return 1; if (memo2[l][r] != -1) return memo2[l][r]; int mini = n; for (int i = l; i < r; ++i) { mini = min(mini, solve(l, i) + solve(i + 1, r)); } return memo2[l][r] = mini; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; memset(memo, -1, sizeof memo); memset(memo2, -1, sizeof memo2); for (int i = 0; i < n; ++i) { cin >> arr[i]; } dp(0, n - 1); cout << solve(0, n - 1) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T1, class T2> inline void gn(T1 &x1, T2 &x2) { gn(x1), gn(x2); } pair<int, int> edge[500010]; int w[500010]; int n, m, Q; int id[500010]; int col[1010]; int root[1010]; int rev[500010]; inline int find_root(int u) { if (root[u] == u) return u; int first = find_root(root[u]); col[u] ^= col[root[u]]; return root[u] = first; } int main() { gn(n, m); gn(Q); for (int i = 1; i <= m; i++) { gn(edge[i].first, edge[i].second); gn(w[i]); } for (int i = 1; i <= m; i++) id[i] = i; sort(id + 1, id + m + 1, [&](int u, int v) { return w[u] > w[v]; }); while (Q--) { int L, R; gn(L, R); for (int i = 1; i <= n; i++) { col[i] = 0; root[i] = i; } int ans = -1; for (int i = 1; i <= m; i++) { if (id[i] > R || id[i] < L) continue; int u = edge[id[i]].first, v = edge[id[i]].second; if (find_root(u) == find_root(v)) { if (col[u] == col[v]) { ans = w[id[i]]; break; } continue; } col[root[u]] = col[u] ^ col[v] ^ 1; root[root[u]] = root[v]; } printf( %d n , ans); } }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1ll << 32; int n, m, s, e; string ans = ; bool ch(int l, int r, int idx, bool b) { bool re = 1; if (l <= idx && idx <= r) re = 0; if (b) { if (l <= idx + 1 && idx + 1 <= r) re = 0; } else if (l <= idx - 1 && idx - 1 <= r) re = 0; return re; } int main() { scanf( %d %d %d %d , &n, &m, &s, &e); map<int, pair<int, int>> mp; for (int i = 0; i < m; i++) { int a; scanf( %d , &a); scanf( %d %d , &mp[a].first, &mp[a].second); } int j = 1; if (s < e) { for (int i = s; i < e; i++) { if (mp[j].first) { if (ch(mp[j].first, mp[j].second, i, 1)) ans += R ; else { ans += X ; i--; } j++; } else { while (!mp[j].first && i < e) { ans += R ; i++; j++; } i--; } } } else { for (int i = s; i > e; i--) { if (mp[j].first) { if (ch(mp[j].first, mp[j].second, i, 0)) ans += L ; else { ans += X ; i++; } j++; } else { while (!mp[j].first && i > e) { ans += L ; i--; j++; } i++; } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; vector<int> vec; for (int i = 0; i < n; i++) { cin >> a[i]; }; int l[n]; map<int, int> mpp; for (int i = 0; i < n; i++) { cin >> l[i]; if (l[i] == 0) { mpp[i] = 0; vec.push_back(a[i]); } else { mpp[i] = 1; } } int j = 0; sort(vec.rbegin(), vec.rend()); for (int i = 0; i < n; i++) { if (mpp[i] == 0) { cout << vec[j] << ; j++; } else { cout << a[i] << ; } } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } const int INF = (((1 << 30) - 1) << 1) + 1; const int nINF = 1 << 31; pair<long long, long long> egcd(long long a, long long b, pair<long long, long long> x = {1, 0}, pair<long long, long long> y = {0, 1}) { return (b == 0) ? x : egcd(b, a % b, y, {x.first - a / b * y.first, x.second - a / b * y.second}); } long long modInv(long long a, long long n) { return ((egcd(a, n).first % n) + n) % n; } const long long M = 998244353; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long mult(long long a, long long b) { return (a * b) % M; } long long add(long long a, long long b) { return (a + b) % M; } struct frac { long long n, d; void simp() { long long g = gcd(n, d); n /= g; d /= g; } frac(long long in_n, long long in_d) { n = in_n, d = in_d; simp(); } frac operator+(frac& oth) { frac ret(n * oth.d + d * oth.n, d * oth.d); ret.simp(); return ret; } }; const int N = 2e5 + 10; int n, p[N], m = 0, l[N], have[N]; long long bit[N]; long long getSum(int i) { long long sum = 0; ++i; while (i > 0) { sum += bit[i]; i -= i & (-i); } return sum; } void updateBIT(int i, long long val) { ++i; while (i <= n + 5) { bit[i] += val; i += i & (-i); } } signed main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < (n); i++) { cin >> p[i]; if (p[i] != -1) have[p[i]] = 1; else ++m; } for (int i = (1); i <= (n); i++) { l[i] = l[i - 1]; if (!have[i]) ++l[i]; } long long k = 0; frac einv(0, 1); frac lm(0, 1); long long lmi = 0; long long inv = 0; long long ans = 0; for (int i = 0; i < (n); i++) { int x = p[i]; if (x != -1) { int above = getSum(n) - getSum(x); inv += above; ans = add(ans, above); updateBIT(x, 1); if (m) { frac ex((m - l[x]) * k, m); frac cex(l[x], m); einv = einv + ex; lm = lm + cex; lmi = add(lmi, mult(cex.n, modInv(cex.d, M))); ans = add(ans, mult(ex.n, modInv(ex.d, M))); } } else { einv = einv + lm; ans = add(ans, lmi); frac ex(k, 2); einv = einv + ex; ans = add(ans, mult(ex.n, modInv(ex.d, M))); ++k; } } frac kinv(inv, 1); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 7; int a[maxn]; int n, s; int main() { scanf( %d%d , &n, &s); if (s >= 2 * n) { s -= 2 * n; puts( YES ); printf( %d , 2 + s); for (int i = 1; i < n; ++i) printf( %d , 2); puts( ); puts( 1 ); } else puts( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, s = 0; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; s += a[i]; } sort(begin(a), end(a)); if (s % 2 == 0 && 2 * a[n - 1] <= s) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T x, T y) { if (x < y) swap(x, y); while (y > 0) { T f = x % y; x = y; y = f; } return x; } struct Node { Node *l, *r; long long a, b; Node() : l(NULL), r(NULL), a(0), b(0) {} }; Node* makeTree(int fr, int to) { Node* node = new Node(); if (fr == to) return node; int m = (fr + to) / 2; node->l = makeTree(fr, m); node->r = makeTree(m + 1, to); return node; } Node* update(Node* _node, int fr, int to, int x1, int x2, long long a, long long b) { if (x2 < fr || x1 > to) return _node; Node* node = new Node(); *node = *_node; if (x1 <= fr && to <= x2) { node->a += a; node->b += b; return node; } int m = (fr + to) / 2; node->l = update(node->l, fr, m, x1, x2, a, b); node->r = update(node->r, m + 1, to, x1, x2, a, b); return node; } long long query(Node* node, int fr, int to, long long x) { long long res = node->a * x + node->b; if (fr == to) return res; int m = (fr + to) / 2; if (x <= m) return res + query(node->l, fr, m, x); else return res + query(node->r, m + 1, to, x); } Node* froot[75007]; const int maxx = 200002; int main(int argc, char* argv[]) { int n; std::cin.sync_with_stdio(false); std::cin.tie(nullptr); cin >> n; { froot[0] = makeTree(0, maxx); for (int i = 1; i <= n; i++) { int x1, x2, y1, a, b, y2; cin >> x1 >> x2 >> y1 >> a >> b >> y2; froot[i] = update(froot[i - 1], 0, maxx, 0, x1, 0, y1); froot[i] = update(froot[i], 0, maxx, x1 + 1, x2, a, b); froot[i] = update(froot[i], 0, maxx, x2 + 1, maxx, 0, y2); } int m; cin >> m; long long last = 0; while (m--) { int l, r, x; cin >> l >> r >> x; last = (last + x) % 1000000000ll; last = query(froot[r], 0, maxx, last) - query(froot[l - 1], 0, maxx, last); cout << last << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long GCD(long long x, long long y) { while (y != 0) { long long t = x % y; x = y; y = t; } return x; } long long n, a, b; long long cs; bool calc() { scanf( %lld %lld , &a, &b); long long g = GCD(a, b); long long p = a / g; long long q = b / g; long long pq = p * q; bool ret = (g % pq == 0); if (ret) { long long r = g / pq; long long i = 1; while (i * i * i < r) { i++; } if (i * i * i == r) return true; } return false; } int main() { scanf( %lld , &n); while (cs < n) { cs++; bool ans = calc(); if (ans) printf( Yes n ); else printf( No n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; int main(void) { int n; cin >> n >> s; int l = 0, r = 0; for (auto &c : s) if (c == L ) ++l; else ++r; cout << r + l + 1 << endl; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.