func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; long long dp[500005] = {0}; dp[3] = 8; long long fac = 2; for (long long i = 5; i <= 500000; i += 2) { dp[i] = dp[i - 2] + fac * (i + i + i - 2 + i - 2); ++fac; } cout << dp[n] << endl; } }
|
#include <bits/stdc++.h> using namespace std; string str; long long int n, k; int main() { string temp; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int a, b, i, j, cnt = 0; cin >> str; n = str.size(); cin >> k; for (i = 0; i < k; i++) { cin >> temp; for (j = 0; j < n; j++) { a = 0, b = 0; while (j < n && (str[j] == temp[0] || str[j] == temp[1])) { if (str[j] == temp[0]) a++; else b++; j++; } cnt += min(a, b); } } cout << cnt << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000 * 1000 * 1000 + 7; const double PI = 3.14159265358979323846264; const pair<long long int, long long int> steps[] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1}, {1, -1}, {1, 1}, {-1, -1}, {-1, 1}}; template <typename... T> void read(T&... args) { ((cin >> args), ...); } template <typename... T> void write(T&&... args) { ((cout << args << ), ...); } void fio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void setUpLocal() {} const long long int maxN = 2 * 1e3; const long long int gp_size = maxN; vector<long long int> gp[gp_size]; long long int vis[gp_size]; long long int cnt[gp_size]; void dfs(long long int i) { vis[i] = 1; for (long long int child : gp[i]) if (!vis[child]) dfs(child); } long long int modPow(long long int n, long long int k) { long long int ret = 1; while (k) { if (k & 1) ret = ret * n % mod; k >>= 1; n = n * n % mod; } return ret; } void solve() { long long int n, m, k; cin >> n >> m >> k; for (long long int i = 1; i <= n - k + 1; i++) { for (long long int f = i, b = i + k - 1; f <= b; f++, b--) { gp[f].push_back(b); gp[b].push_back(f); } } long long int cc = 0; for (long long int i = 1; i <= n; i++) { if (!vis[i]) { cc++; dfs(i); } } cout << modPow(m, cc); } int32_t main() { fio(); setUpLocal(); return solve(), 0; }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double EPS = 1e-9; const int oo = 210000000; int n; vector<int> p[4]; vector<int> g[201]; int solve(int x) { bool used[201]; for (int i = 1; i <= n; i++) used[i] = 0; int ans = 0, m = 0; while (m < n) { bool flag1 = 0; for (int i = 0; i < p[x].size(); i++) { int cur = p[x][i]; if (used[cur]) continue; bool flag = 1; for (int j = 0; j < g[cur].size(); j++) if (!used[g[cur][j]]) { flag = 0; break; } if (flag) { flag1 = 1; m++; used[cur] = 1; } } if (!flag1) { x++; if (x > 3) x = 1; ans++; } } return ans; } int main() { cin >> n; for (int i = 1; i <= n; i++) { int tmp; cin >> tmp; p[tmp].push_back(i); } for (int i = 1; i <= n; i++) { int k; cin >> k; for (int j = 0; j < k; j++) { int tmp1; cin >> tmp1; g[i].push_back(tmp1); } } int ans = oo; ans = min(ans, solve(1)); ans = min(ans, solve(2)); ans = min(ans, solve(3)); cout << ans + n << endl; return (0); }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; if (a == b) cout << YES ; else if (b - a > 0 && c > 0) { if ((b - a) % c == 0) cout << YES ; else cout << NO ; } else if (b - a > 0 && c < 0) { cout << NO ; } else if (b - a < 0 && c > 0) { cout << NO ; } else if (b - a < 0 && c < 0) { if ((a - b) % c == 0) cout << YES ; else cout << NO ; } else if (c == 0) cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using db = double; using vi = vector<int>; const int l = 20; const int maxn = 300006; int e[maxn][l]; int tote; map<int, int> S; int a[maxn]; int yy[maxn]; int rr[maxn]; int h[maxn][1000 / l]; int n, q; int app[maxn]; int sum[maxn]; int Get(int a, int b) { return e[h[a][b / l]][b % l]; } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); S[a[i]] = 0; } int tot = 0; for (auto &p : S) { rr[tot] = p.first; p.second = tot; tot++; } for (int i = 1; i <= n; ++i) a[i] = S[a[i]]; int m = (int)sqrt(n * 5) + 3; for (int i = 1; i <= n; ++i) app[a[i]]++; vi big; for (int i = 0; i < tot; ++i) if (app[i] > m / 5 - 3) { big.push_back(i); yy[i] = big.size() - 1; } else yy[i] = -1; int maxs = big.size() / l; memset(h, 0, sizeof(h)); memset(e, 0, sizeof(e)); tote = 0; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= maxs; ++j) h[i][j] = h[i - 1][j]; if (yy[a[i]] != -1) { int no = yy[a[i]]; tote++; for (int j = 0; j < l; ++j) e[tote][j] = e[h[i - 1][no / l]][j]; e[tote][no % l]++; h[i][no / l] = tote; } } for (int i = 1; i <= q; ++i) { int l, r, k; scanf( %d%d%d , &l, &r, &k); int ans = -1; for (auto x : big) if (Get(r, yy[x]) - Get(l - 1, yy[x]) > (r - l + 1) / k) if (ans == -1 || x < ans) ans = x; if (r - l + 1 <= m) { vi tr; for (int i = l; i <= r; ++i) { tr.push_back(a[i]); sum[a[i]]++; } for (auto x : tr) if (sum[x] > (r - l + 1) / k) if (ans == -1 || x < ans) ans = x; for (auto x : tr) sum[x] = 0; } printf( %d n , (ans == -1) ? -1 : rr[ans]); } }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; const ll INF = 1e16 + 2; signed main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); vector<pair<ll, ll>> pts; pts.emplace_back(); ll ax, ay, bx, by; cin >> pts[0].first >> pts[0].second >> ax >> ay >> bx >> by; ll x, y, t; cin >> x >> y >> t; while (pts.back().first < INF && pts.back().second < INF) pts.emplace_back(pts.back().first * ax + bx, pts.back().second * ay + by); int m = pts.size(); vector<int> dp(m); for (int i = 0; i < m; i++) { ll len; len = abs(pts[i].first - x) + abs(pts[i].second - y); ll cur_t = t; if (len > cur_t) { dp[i] = 0; continue; } cur_t -= len; dp[i] = 1; for (int j = i - 1; j >= 0; j--) { len = abs(pts[j].first - pts[j + 1].first) + abs(pts[j].second - pts[j + 1].second); if (cur_t >= len) dp[i] = i - j + 1; cur_t -= len; } len = abs(pts[i].first - x) + abs(pts[i].second - y); cur_t = t - len; len = abs(pts[i].first - pts[0].first) + abs(pts[i].second - pts[0].second); if (cur_t < 2 * len) continue; cur_t -= 2 * len; dp[i] = max(dp[i], i + 1); for (int j = i + 1; j < m; j++) { ll len = abs(pts[j].first - pts[j - 1].first) + abs(pts[j].second - pts[j - 1].second); if (cur_t >= len) dp[i] = max(dp[i], i + 1 + j - i); cur_t -= len; } } ll ans = *max_element(dp.begin(), dp.end()); cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int n, a[maxn], tot, b[maxn], ans; inline int read() { int ret = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -f; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { ret = ret * 10 + ch - 0 ; ch = getchar(); } return ret * f; } inline int BinarySearch(int l, int x) { int L = l, R = tot, mid; while (L <= R) { mid = L + R >> 1; b[mid] >= x ? R = mid - 1 : L = mid + 1; } return L; } int main() { n = read(); for (int i = 1; i <= n; i++) a[i] = read(); sort(a + 1, a + 1 + n); int cnt = 1; for (int i = 2; i <= n + 1; i++) { if (a[i] != a[i - 1]) { b[++tot] = cnt; cnt = 1; } else cnt++; } sort(b + 1, b + 1 + tot); for (int i = 1; i <= tot; i++) { for (int j = b[i - 1] + 1; j <= b[i]; j++) { int now = j, lst = j, ret = BinarySearch(i + 1, 2 * lst); while (ret <= tot) { lst *= 2; now += lst; ret = BinarySearch(ret + 1, 2 * lst); } if (now > ans) ans = now; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = (int)1E9; int N, M, MB, LASTB; unsigned long long LASTM; vector<int> adj[100005]; int LB, lb[100005], revlb[100005], tr[100005], a[100005], primes[1000], P; class mask { public: unsigned long long v[16]; mask() { memset(v, 0, sizeof(v)); } void set(int b) { v[b / 64] |= 1ULL << (b % 64); } bool has(int b) { return (v[b / 64] & (1ULL << (b % 64))) > 0; } void add(unsigned long long v2[16], int l, int r, unsigned long long v, int shift) { int len = r - l + 1; l += shift; r += shift; int li, lm, ri, rm; bool cross = (l < M) ^ (r < M); if (l >= M) l -= M; if (r >= M) r -= M; li = l / 64; ri = r / 64; lm = l % 64; rm = r % 64; if (!cross) { if (li == ri) { v2[li] |= v << lm; } else { v2[li] |= v << lm; v2[ri] |= v >> (len - rm - 1); } } else { if (li == MB - 1) { v2[li] |= (v << lm) & LASTM; v2[ri] |= v >> (len - rm - 1); } else { v2[li] |= v << lm; v2[MB - 1] |= (v >> (64 - lm)) & LASTM; v2[ri] |= v >> (len - rm - 1); } } } void shift(int shift) { unsigned long long v2[16] = {}; for (int i = (0); i < (MB); i++) { add(v2, i * 64, min(M - 1, (i + 1) * 64 - 1), v[i], shift); } memcpy(v, v2, sizeof(v)); } void combine(const mask &ano) { for (int i = (0); i < (MB); i++) v[i] |= ano.v[i]; } }; mask val[1 << 20]; int lz[1 << 20]; void build(int k, int nl, int nr) { if (nl == nr) { val[k].set(a[revlb[nl]]); return; } int nm = (nl + nr) >> 1; build(2 * k + 1, nl, nm); build(2 * k + 2, nm + 1, nr); val[k] = val[2 * k + 1]; val[k].combine(val[2 * k + 2]); } void add(int k, int nl, int nr, int l, int r, int v); void relax(int k, int nl, int nr) { int nm = (nl + nr) >> 1; add(2 * k + 1, nl, nm, nl, nm, lz[k]); add(2 * k + 2, nm + 1, nr, nm + 1, nr, lz[k]); lz[k] = 0; } void add(int k, int nl, int nr, int l, int r, int v) { if (r < nl || l > nr) return; if (l <= nl && nr <= r) { val[k].shift(v); lz[k] = (lz[k] + v) % M; return; } int nm = (nl + nr) >> 1; if (lz[k]) relax(k, nl, nr); add(2 * k + 1, nl, nm, l, r, v); add(2 * k + 2, nm + 1, nr, l, r, v); val[k] = val[2 * k + 1]; val[k].combine(val[2 * k + 2]); } mask get(int k, int nl, int nr, int l, int r) { if (r < nl || l > nr) return mask(); if (l <= nl && nr <= r) return val[k]; if (lz[k]) relax(k, nl, nr); int nm = (nl + nr) >> 1; mask ml = get(2 * k + 1, nl, nm, l, r); mask mr = get(2 * k + 2, nm + 1, nr, l, r); ml.combine(mr); return ml; } void dfs(int x, int p) { lb[x] = LB; revlb[LB] = x; tr[x] = LB++; int sz = adj[x].size(); for (int i = (0); i < (sz); i++) { int y = adj[x][i]; if (y == p) continue; dfs(y, x); } tr[x] = LB - 1; } int main() { cin >> N >> M; for (int p = (2); p < (M); p++) { bool ok = 1; for (int i = 2; i * i <= p; i++) { if (p % i == 0) { ok = 0; break; } } if (ok) primes[P++] = p; } MB = (M + 64 - 1) / 64; LASTB = M % 64 == 0 ? 64 : M % 64; LASTM = (1ULL << LASTB) - 1ULL; for (int i = (0); i < (N); i++) { scanf( %d , a + i); a[i] %= M; } for (int i = (0); i < (N - 1); i++) { int a, b; scanf( %d%d , &a, &b); a--; b--; adj[a].push_back(b); adj[b].push_back(a); } dfs(0, -1); build(0, 0, N - 1); int Q; cin >> Q; while (Q--) { int t, x, val; scanf( %d%d , &t, &x); x--; if (t == 1) { scanf( %d , &val); add(0, 0, N - 1, lb[x], tr[x], val % M); } else { mask m = get(0, 0, N - 1, lb[x], tr[x]); int ans = 0; for (int i = (0); i < (P); i++) if (m.has(primes[i])) ans++; printf( %d n , ans); } } 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--) { string s; int n, l = 0, r = 0, u = 0, d = 0; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == L ) l++; else if (s[i] == R ) r++; else if (s[i] == U ) u++; else d++; } int a = min(l, r); int b = min(u, d); if (a == 0 && b == 0) { cout << 0 << endl; } else if (a == 0) { cout << 2 << endl; cout << UD << endl; } else if (b == 0) { cout << 2 << endl; cout << LR << endl; } else { cout << 2 * (a + b) << endl; for (int i = 0; i < a; i++) { cout << L ; } for (int i = 0; i < b; i++) { cout << U ; } for (int i = 0; i < a; i++) { cout << R ; } for (int i = 0; i < b; i++) { cout << D ; } cout << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string bin; cin >> bin; int i = 0; for (; i + 1 < bin.length(); i++) if (bin[i] == 0 ) break; cout << bin.substr(0, i) + bin.substr(i + 1) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 7; const string alpha = abcdefghijklmnopqrstuvwxyz ; long long power(long long x, long long y) { long long res = 1; x = x; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T powm(T a, T b, long long m) { T cnt = 1; while (b > 0) { if (b % 2 == 1) cnt = (cnt * a) % m; b /= 2; a = (a * a) % m; } return cnt % m; } long long ncr(long long n, long long r) { long long res = 1; if (r > n) return 0; if (r > n - r) r = n - r; for (long long i = 0; i < r; i++) { res *= (n - i); res /= (i + 1); } return res; } long long sqr(long long x) { return x * x; } void solve() { long long int n; cin >> n; vector<long long> a(n), b(n); for (int i = 0; i < n; ++i) { cin >> a[i]; a[i] = a[i] * (i + 1) * (n - i); } for (int i = 0; i < n; ++i) { cin >> b[i]; } sort((a).begin(), (a).end()); sort((b).rbegin(), (b).rend()); long long ans = 0; for (int i = 0; i < n; ++i) { a[i] %= 998244353; ans = (ans + a[i] * b[i]) % 998244353; } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tc; tc = 1; while (tc--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, M; int main() { cin >> M >> N; if (M == N) { cout << N << 1 << << N << 2 ; return 0; } if (N - M == 1) { cout << M << 9 << << N << 0 ; return 0; } if (M == 9 && N == 1) { cout << 9 10 ; return 0; } cout << -1; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, ctr{}; cin >> n; string vec; cin >> vec; int likh = count(vec.begin(), vec.end(), 8 ); if (likh > 0) { int m = min(likh, n % 11); int len = n - m; len = len / 10; ctr = min(len, likh); } cout << ctr << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; char s[MAX_N]; vector<int> v; int main() { scanf( %s , s + 1); int n = strlen(s + 1); int tot = 0; for (int i = 1; i <= n; i++) { if (s[i] == ( ) tot++; else if (s[i] == ) ) tot--; } if (tot <= 0) { printf( -1 n ); return 0; } int res = 0; for (int i = 1; i <= n; i++) { if (s[i] == ( ) res++; else if (s[i] == ) ) res--; else res--, v.push_back(1), tot--; if (res < 0) { printf( -1 n ); return 0; } } if (tot < 0) { printf( -1 n ); return 0; } v[v.size() - 1] += tot; res = 0; int pos = -1; for (int i = n; i; i--) { if (s[i] == # ) { pos = i; break; } } for (int i = 1; i <= n; i++) { if (s[i] == ( ) res++; else if (s[i] == ) ) res--; else { if (i == pos) res -= 1 + tot; else res--; } if (res < 0) { printf( -1 n ); return 0; } } for (int i = 0; i < v.size(); i++) printf( %d n , v[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int dis[40]; long long adj[40]; vector<long long> v1; vector<long long> v2; void bt(int l, int r, long long mask) { if (l == r) { v1.emplace_back(mask); return; } bt(l + 1, r, mask); if (adj[l] & mask) return; bt(l + 1, r, mask | (1ll << l)); } long long f[1 << 21]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int m; cin >> m; long long ans = 1; for (int i = 0; i < n; ++i) ans *= 2; for (int i = 0; i < m; ++i) { int x; cin >> x; --x; int y; cin >> y; --y; adj[x] |= (1ll << y); adj[y] |= (1ll << x); } long long cnt1 = 1; long long cnt01 = 1; long long cnt02 = 1; for (int j = 0; j < n; ++j) if (adj[j] == 0) cnt01 *= 2; fill(dis, dis + n, -1); for (int i = 0; i < n; ++i) if (dis[i] < 0) { cnt1 *= 2; cnt02 *= 2; int S = 0; queue<int> qu; qu.push(i); dis[i] = 0; while (qu.size()) { int u = qu.front(); qu.pop(); S++; for (int v = 0; v < n; ++v) if (adj[u] >> v & 1) { if (dis[v] < 0) dis[v] = dis[u] ^ 1, qu.push(v); if (dis[v] == dis[u]) cnt02 = 0; } } } if (ans == cnt1) ans = 0; ans -= cnt1; ans += cnt01 * 2; ans += cnt02; m = n / 2; bt(m, n, 0); v1.swap(v2); bt(0, m, 0); for (long long x : v2) { int M = 0; for (int i = 0; i < m; ++i) { if (adj[i] & x) continue; else M |= (1 << i); } f[M]++; } for (int i = 0; i < m; ++i) for (int j = 0; j < (1 << m); ++j) if (j >> i & 1) f[j ^ (1 << i)] += f[j]; for (long long x : v1) ans -= f[x], ans -= f[x]; cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { long long n, m; cin >> n >> m; vector<long long> a(n), b(m); for (long long i = 0; i < n; ++i) cin >> a[i]; for (long long i = 0; i < m; ++i) cin >> b[i]; long long tot = 0; for (long long i = 0; i < n; ++i) tot ^= a[i]; for (long long i = 0; i < m; ++i) tot ^= b[i]; if (tot == 0) { cout << YES n ; for (long long i = 0; i < n - 1; ++i) { for (long long j = 0; j < m - 1; ++j) { cout << 0 << ; } cout << a[i] << n ; } long long last = a[n - 1]; for (long long j = 0; j < m - 1; ++j) { cout << b[j] << ; last ^= b[j]; } cout << last << n ; } else { cout << NO n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int sum(int a, int b) { int s = a + b; if (s >= mod) s -= mod; return s; } int sub(int a, int b) { int s = a - b; if (s < 0) s += mod; return s; } int mult(int a, int b) { return (1LL * a * b) % mod; } int n, k; int len; const int maxN = (int)1e5 + 10; const int maxK = 105; int dp[maxN][maxK]; int sum_pref[maxN]; int a[maxN]; int f[maxN][maxK]; int all[maxN]; bool can(int l, int r, int color) { return (all[r] - all[l - 1] == f[r][color] - f[l - 1][color]); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); srand(239); cin >> n >> k >> len; for (int i = 1; i <= n; i++) { cin >> a[i]; for (int color = 1; color <= k; color++) { f[i][color] = f[i - 1][color]; f[i][color] += (color == a[i]); } all[i] = all[i - 1] + (a[i] > 0); } if (len == 1) { cout << 0; return 0; } sum_pref[0] = 1; for (int i = 1; i <= n; i++) { for (int color = 1; color <= k; color++) { if (a[i] != -1 && a[i] != color) continue; dp[i][color] = sum_pref[i - 1]; if (i >= len && can(i - len + 1, i, color)) { dp[i][color] = sub(dp[i][color], sub(sum_pref[i - len], dp[i - len][color])); } sum_pref[i] = sum(sum_pref[i], dp[i][color]); } } cout << sum_pref[n]; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char **argv) { string i, o; cin >> i >> o; sort(i.begin(), i.end()); if (i == 0 && i == o) { cout << OK << endl; return 0; } unsigned int z; for (z = 0; z < i.length() && i[z] == 0 ; ++z) ; while (!i.empty() && i[0] == 0 ) i = i.substr(1); while (z--) i.insert(i.empty() ? 0 : 1, 0 ); cout << ((i == o) ? OK : WRONG_ANSWER ) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long k = 2; struct node { vector<node*> to; node() { to.resize(k, 0); } long long cnt = 0; }; node* root = new node(); inline bool getbit(long long a, long long pos) { return a & (1 << pos); } void addstring(long long b) { vector<long long> a; for (long long i = 0; i < 30; ++i) { a.push_back(getbit(b, i)); } reverse(a.begin(), a.end()); node* cur = root; for (long long i = 0; i < a.size(); ++i) { long long c = a[i]; if (cur->to[c] == 0) { cur->to[c] = new node(); } cur = cur->to[c]; cur->cnt++; } } long long get(long long b) { vector<long long> a; long long ans = 0; for (long long i = 0; i < 30; ++i) { a.push_back(getbit(b, i)); } reverse(a.begin(), a.end()); node* cur = root; for (long long i = 0; i < a.size(); ++i) { long long bet = a[i]; if (cur->to[bet] && cur->to[bet]->cnt > 0) { cur = cur->to[bet]; ans += bet * (1 << (29 - i)); cur->cnt--; } else { cur = cur->to[1 - bet]; ans += (1 - bet) * (1 << (29 - i)); cur->cnt--; } } return ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<long long> a(n); vector<long long> b(n); for (long long i = 0; i < n; ++i) { cin >> a[i]; } for (long long i = 0; i < n; ++i) { cin >> b[i]; addstring(b[i]); } for (long long i = 0; i < n; ++i) { cout << (get(a[i]) ^ a[i]) << ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { long long k4, k7, i, l; char s[100]; long long n; gets(s); l = strlen(s); k4 = 0; k7 = 0; for (i = 0; i < l; i++) { if (s[i] == 4 ) k4++; if (s[i] == 7 ) k7++; } if (k4 == 0 && k7 == 0) cout << -1; else if (k7 > k4) cout << 7; else cout << 4; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int a[1000005]; int main() { long long int i, j, k, l, n, m; cin >> n >> m; if (n / m < 3) { cout << -1; return 0; } j = 1; long long int f = 0; long long int x, y; x = 1, y = n - 1; while (y - x >= 4 && j < m) { a[x] = a[x + 1] = a[y] = j; j++; x += 2; y--; } while (x <= y) { a[x] = j; x++; } a[n] = j; for (i = 1; i <= n; i++) cout << a[i] << ; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void vout(T x) { cout << x << endl; exit(0); } int gcd(int a, int b) { while (a && b) { if (a > b) a %= b; else b %= a; } return a + b; } const long long inf = -1e18; const long long mod = 1e9; long long dp[300][300], a[400]; int n, k, x; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> x; if (n / k > x) vout(-1); for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 0; i < 300; ++i) { for (int j = 0; j < 300; ++j) dp[i][j] = inf; } dp[0][x] = 0; for (int i = 1; i <= n; ++i) { for (int j = 0; j < x; ++j) { for (int t = max(0, i - k); t <= i; ++t) { if (dp[t][j + 1] >= 0) dp[i][j] = max(dp[i][j], dp[t][j + 1] + a[i]); } } } long long ans = 0; for (int i = n - k + 1; i <= n; ++i) ans = max(ans, dp[i][0]); vout(ans); return 0; }
|
#include <bits/stdc++.h> const long long INF = 0x3f3f3f3f; using namespace std; void sol() { long long n, m; while (cin >> n >> m) { string s; cin.ignore(); cin >> s; long long x[6][n]; string a[6] = { abc , acb , bca , bac , cab , cba }; memset(x, 0, sizeof(x)); ; for (long long i = 0; i < s.size(); i++) { if (i) { for (long long j = 0; j < 6; j++) { x[j][i] = x[j][i - 1]; if (s[i] != a[j][i % 3]) x[j][i]++; } } else { for (long long j = 0; j < 6; j++) { x[j][i] = 0; if (s[i] != a[j][i % 3]) x[j][i]++; } } } while (m--) { long long a, b; cin >> a >> b; long long ans = INF; if (a > 1) { for (long long i = 0; i < 6; i++) { ans = (x[i][b - 1] - x[i][a - 2] < ans ? x[i][b - 1] - x[i][a - 2] : ans); } } else { for (long long i = 0; i < 6; i++) { ans = (x[i][b - 1] < ans ? x[i][b - 1] : ans); } } cout << ans << n ; } } } signed main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long t = 1; while (t--) { sol(); cout.flush(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int dx[] = {1, 0, -1, 0, -1, -1, 1, 1}; const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1}; const int OO = INT_MAX; long long tolong(string s) { stringstream ss; ss << s; long long n; ss >> n; return n; } string toString(long long s) { stringstream ss; ss << s; string n; ss >> n; return n; } int main() { string x; cin >> x; long long n = tolong(x); if (x == toString(n)) { if (n >= -128 && n <= 127) { cout << byte ; } else if (n >= -32768 && n <= 32767) { cout << short ; } else if (n >= -2147483648 && n <= 2147483647) { cout << int ; } else { cout << long ; } } else { cout << BigInteger ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int pow1(long long int a, long long int b) { long long int ans = 1; while (b) { if (b & 1) ans = (ans * a) % 1000000007; a = (a * a) % 1000000007; b = b >> 1; } return ans; } int n, m; pair<int, int> a[100005]; vector<int> v[100005]; bool vis[100005] = {0}; void dfs(int x) { vis[x] = 1; for (int i = 0; i < v[x].size(); i++) if (!vis[v[x][i]]) dfs(v[x][i]); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + n); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } long long int sum = 0; for (int i = 0; i < n; i++) { if (!vis[a[i].second]) { sum += a[i].first; dfs(a[i].second); } } cout << sum; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, r, f[60005]; int dp[105][60005]; struct node { int a, b, sign; } pro[105]; bool cmp(node a, node b) { if (a.sign == b.sign) { if (a.sign == 1) return a.a < b.a; else return a.a + a.b > b.a + b.b; } return a.sign < b.sign; } int main() { scanf( %d%d , &n, &r); for (register int i = 1; i <= n; i++) { scanf( %d%d , &pro[i].a, &pro[i].b); if (pro[i].b >= 0) pro[i].sign = 1; else pro[i].sign = 2, pro[i].a = max(pro[i].a, abs(pro[i].b)); } sort(pro + 1, pro + 1 + n, cmp); int s = r, sum = 0; vector<node> aa; for (register int i = 1; i <= n; i++) { if (pro[i].sign == 1 && s >= pro[i].a) s += pro[i].b, sum++; else aa.push_back(pro[i]); } dp[0][s] = sum; for (int i = 0; i < (int)(aa.size()); i++) for (register int j = 0; j <= s; j++) { if (j >= aa[i].a) dp[i + 1][j + aa[i].b] = max(dp[i + 1][j + aa[i].b], dp[i][j] + 1); dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]); } sum = 0; for (register int i = 0; i <= s; i++) sum = max(sum, dp[(int)(aa.size())][i]); printf( %d n , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1000000000; struct sTree { int pl, pr; int val, cnt, debt; } tree[4000009]; int treeSize; int NewNode(int LL, int RR) { int cur = ++treeSize; tree[cur].cnt = RR - LL + 1; return cur; } void CalcDebt(int LL, int RR, int cur); void Add(int L, int R, int d, int LL, int RR, int cur) { if (L <= LL && R >= RR) { tree[cur].debt += d; tree[cur].val += d; return; } int M = LL + (RR - LL) / 2; if (!tree[cur].pl) tree[cur].pl = NewNode(LL, M); if (!tree[cur].pr) tree[cur].pr = NewNode(M + 1, RR); CalcDebt(LL, RR, cur); if (L <= M && LL <= R) { Add(L, R, d, LL, M, tree[cur].pl); } if (L <= RR && M + 1 <= R) { Add(L, R, d, M + 1, RR, tree[cur].pr); } if (tree[tree[cur].pl].val < tree[tree[cur].pr].val) { tree[cur].val = tree[tree[cur].pl].val; tree[cur].cnt = tree[tree[cur].pl].cnt; } else if (tree[tree[cur].pl].val > tree[tree[cur].pr].val) { tree[cur].val = tree[tree[cur].pr].val; tree[cur].cnt = tree[tree[cur].pr].cnt; } else { tree[cur].val = tree[tree[cur].pl].val; tree[cur].cnt = tree[tree[cur].pl].cnt + tree[tree[cur].pr].cnt; } } int Get(int cur) { if (tree[cur].val == 0) { return 2 * inf + 1 - tree[cur].cnt; } return 2 * inf + 1; } void CalcDebt(int LL, int RR, int cur) { int M = LL + (RR - LL) / 2; Add(LL, M, tree[cur].debt, LL, M, tree[cur].pl); Add(M + 1, RR, tree[cur].debt, M + 1, RR, tree[cur].pr); tree[cur].debt = 0; } int n; struct event { char type; int p, L, R; } e[200009]; bool operator<(event a, event b) { if (a.p != b.p) return a.p < b.p; return a.type < b.type; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; x1 += inf, y1 += inf, x2 += inf, y2 += inf; e[2 * i].type = + ; e[2 * i].p = min(x1, x2) - 1; e[2 * i].L = min(y1, y2); e[2 * i].R = max(y1, y2); e[2 * i + 1].type = - ; e[2 * i + 1].p = max(x1, x2); e[2 * i + 1].L = min(y1, y2); e[2 * i + 1].R = max(y1, y2); } sort(e, e + 2 * n); int root = NewNode(0, 2 * inf); long long ans = 0; int prev = -1; for (int i = 0; i < 2 * n; i++) { int j = i; while (j + 1 < 2 * n && e[j + 1].p == e[i].p) j++; ans += 1LL * Get(root) * (e[i].p - prev); for (int k = i; k <= j; k++) { if (e[k].type == + ) { Add(e[k].L, e[k].R, 1, 0, 2 * inf, root); } else { Add(e[k].L, e[k].R, -1, 0, 2 * inf, root); } } i = j; prev = e[i].p; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m; cin >> n >> m; map<int, int> a; long long x; for (long long i = 0; i < m; i++) { cin >> x; a[x]++; } long long mini = INT_MAX; for (long long i = 1; i <= n; i++) { if (mini > a[i]) { mini = a[i]; } } cout << mini << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x; string s1, s2; int cnt = 0; cin >> x >> ws; for (int i = x; i; i--) { cin >> s1; cin >> s2; if (s2.compare( soft ) == 0) cnt++; } if (x - cnt > cnt) cnt = x - cnt; for (int i = 0; i < 100; ++i) { if (i * i / 2 + i % 2 >= cnt && i * i >= x) { cout << i << endl; return 0; } } 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 f ? x : -x; } const int N = 200005; int n, m; char s[N]; struct H { int a, b; }; H h[N][26], pw[N]; const int mul1 = 233, mod1 = 998244353; const int mul2 = 19260817, mod2 = 1000000007; vector<H> cal(int x, int l) { vector<H> ans; for (int i = 0; i < 26; ++i) { H a = (H){}; a.a = (h[x + l][i].a - 1LL * h[x][i].a * pw[l].a % mod1 + mod1) % mod1; a.b = (h[x + l][i].b - 1LL * h[x][i].b * pw[l].b % mod2 + mod2) % mod2; ans.push_back(a); } sort(ans.begin(), ans.end(), [&](H a, H b) { if (a.a != b.a) return a.a < b.a; return a.b < b.b; }); return ans; } int main() { n = read(), m = read(); scanf( %s , s); pw[0].a = pw[0].b = 1; for (int i = 0; i < n; ++i) { for (int j = 0; j < 26; ++j) { h[i + 1][j].a = 1LL * h[i][j].a * mul1 % mod1; h[i + 1][j].b = 1LL * h[i][j].b * mul2 % mod2; } h[i + 1][s[i] - a ].a = (h[i + 1][s[i] - a ].a + 1) % mod1; h[i + 1][s[i] - a ].b = (h[i + 1][s[i] - a ].b + 1) % mod2; pw[i + 1].a = 1LL * pw[i].a * mul1 % mod1; pw[i + 1].b = 1LL * pw[i].b * mul2 % mod2; } for (; m--;) { int x = read() - 1, y = read() - 1, l = read(); vector<H> a = cal(x, l), b = cal(y, l); bool ok = 1; for (int i = 0; i < 26; ++i) { if (a[i].a != b[i].a || a[i].b != b[i].b) ok = 0; } puts(ok ? YES : NO ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int cir = 0; bool ans = true; int now; for (int i = 0; i < n; i++) { if (!i) { scanf( %d , &now); continue; } int temp; scanf( %d , &temp); if (temp > now) { if (cir != 0) { ans = false; } now = temp; } else if (temp == now) { if (cir == 0) { cir = 1; } else if (cir == 1) { } else { ans = false; } } else { if (cir == 0 || cir == 1) { cir = 2; } } now = temp; } if (ans) printf( YES n ); else printf( NO n ); }
|
#include <bits/stdc++.h> using namespace std; int c[3]; void solve() { int m, n; cin >> m >> n; vector<vector<int>> matrix(m, vector<int>(n)); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cin >> matrix[i][j]; } } for (int i = m - 1; i >= 0; --i) { for (int j = n - 1; j >= 0; --j) { if (matrix[i][j] != 0) { continue; } else { int check; check = matrix[i][j + 1] - 1; if (check >= matrix[i + 1][j]) check = matrix[i + 1][j] - 1; matrix[i][j] = check; } } } for (int i = m - 1; i >= 0; --i) { for (int j = n - 1; j >= 0; --j) { if (i != 0 && j != 0) { if ((matrix[i][j] <= matrix[i][j - 1]) || (matrix[i][j] <= matrix[i - 1][j])) { cout << -1 << endl; return; } } } } int sum = 0; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { sum += matrix[i][j]; } } cout << sum << endl; return; } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t, x, y, f1, f2, f3, f4, LIMH = 100000, LIML = -100000; cin >> t; while (t--) { int q; cin >> q; int hiX, loX, hiY, loY; hiX = LIMH; hiY = LIMH; loX = LIML; loY = LIML; for (int i = 0; i < q; i++) { cin >> x >> y >> f1 >> f2 >> f3 >> f4; if (!f1 && x > loX) loX = x; if (!f2 && y < hiY) hiY = y; if (!f3 && x < hiX) hiX = x; if (!f4 && y > loY) loY = y; } if (loX > hiX || loY > hiY) cout << 0 << endl; else cout << 1 << << loX << << loY << endl; } return 0; }
|
#include <iostream> using namespace std; int c1=0,c2=0,cur1=1,cur2=1,ok1=0,ok2=0; pair<int,int> f1[105*105],f2[150*105]; void fa1(int val){ cout<<val<< ; cout<<f1[cur1].first<< <<f1[cur1].second<< n ; cur1++; if(cur1==c1+1) ok1=1; } void fa2(int val){ cout<<val<< ; cout<<f2[cur2].first<< <<f2[cur2].second<< n ; cur2++; if(cur2==c2+1){ ok2=1; } } int main() { int n,a; cin>>n; int t=n*n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if((i+j)%2==1){ f1[++c1]=make_pair(i,j); } else{ f2[++c2]=make_pair(i,j); } } } while(t--){ cin>>a; if(a==1){ if(ok2==1){ fa1(3); } else{ fa2(2); } } if(a==2){ if(ok1==1){ fa2(3); } else{ fa1(1); } } if(a==3){ if(ok1==1){ fa2(2); } else{ fa1(1); } } cout<< n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; string str; for (int o = 0; o < t; o++) { cin >> str; int n = str.length(); int pre = 0, suf = 0, total = 0; if (str[0] == 1 ) { pre = 0; } else { pre = 1; for (int i = 1; i < n; i++) { if (str[i] == 0 ) { pre = pre + 1; } else { break; } } } if (str[n - 1] == 1 ) { suf = 0; } else { suf = 1; for (int j = n - 2; j > 0; j--) { if (str[j] == 0 ) { suf = suf + 1; } else { break; } } } for (int k = 0; k < n; k++) { if (str[k] == 0 ) { total = total + 1; } } int ans = total - suf - pre; if (pre == total) { cout << 0 << endl; } else { cout << ans << endl; } } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 1; int n, m, s; int b[maxn]; int p[maxn]; int ansn, anst; bool ok(int k) { int i = n - 1; int j = k - 1; int tansn = 0, tanst = 0; int ss = s; while (j >= 0) { if (i >= 0 && b[i] >= p[j]) { tanst += p[j]; tansn++; j--; i--; } else if (i >= 0 && p[j] > b[i] && ss >= p[j] - b[i]) { tanst += b[i]; tansn++; ss -= (p[j] - b[i]); j--; i--; } else if (i >= 0) i--; else j--; } if (ss > 0) tanst = max(0, tanst - ss); if (tansn == k && tansn > ansn) { ansn = tansn; anst = tanst; } return tansn == k; } int main() { scanf( %d %d %d , &n, &m, &s); for (int i = 0; i < n; i++) scanf( %d , b + i); for (int i = 0; i < m; i++) scanf( %d , p + i); sort(b, b + n); sort(p, p + m); int l = 0; int r = m + 1; int mid; while (l + 1 < r) { mid = (l + r) / 2; if (ok(mid)) l = mid; else r = mid; } printf( %d %d n , ansn, anst); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; char ch[6] = aaaaa ; int ara[4] = {0}; cin >> s; map<char, int> ms, ms2; for (int i = 0; i < s.size(); i += 4) { for (int j = 0; j < 4 && (i + j) < s.size(); j++) { if (s[i + j] == ! ) { ara[j]++; } else { ch[j] = s[i + j]; if (!ms2[ch[j]]) ms2[ch[j]] = j; } } } int sz = s.size(); for (int i = 0; i < 4; i++) { if (ch[i] == a ) { if (!ms2[ R ]) { ch[i] = R ; ms2[ R ] = 1; } else if (!ms2[ G ]) { ch[i] = G ; ms2[ G ] = 1; } else if (!ms2[ B ]) { ch[i] = B ; ms2[ B ] = 1; } else if (!ms2[ Y ]) { ch[i] = Y ; ms2[ Y ] = 1; } } ms[ch[i]] = ara[i]; } cout << ms[ R ] << << ms[ B ] << << ms[ Y ] << << ms[ G ]; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int DBG = 0, INF = int(1e9); string toString(long long k) { stringstream ss; ss << k; string res; ss >> res; return res; } int toInt(string s) { stringstream ss; ss << s; int res; ss >> res; return res; } int main() { ios_base::sync_with_stdio(0); cout.setf(ios::fixed); cout << setprecision(10); int n, a, d; cin >> n >> a >> d; vector<pair<int, int> > V(n); for (int _n = (n), i = 0; i < _n; ++i) cin >> V[i].first >> V[i].second; double prev = -1; for (int _n = (n), i = 0; i < _n; ++i) { double accTime = double(V[i].second) / double(a); double accDst = double(V[i].second) * accTime * 0.5; if (accDst >= d) { double t = sqrt((2. * double(d)) / double(a)); prev = max(t + double(V[i].first), prev); } else { double remDst = d - accDst; double remTime = remDst / double(V[i].second); prev = max(accTime + remTime + double(V[i].first), prev); } cout << prev << endl; } return 0; }
|
#include <bits/stdc++.h> const long long mod = 998244353; const long long inf = 1e18 + 10; using namespace std; long long modpow(long long a, long long b) { long long res = 1; while (b) { if (b % 2) { res *= a; } a *= a; res %= mod; a %= mod; b /= 2; } return res; } long long nCr(long long n, long long r) { long long f = 1; for (long long i = 2; i <= n; i++) { f *= i; f %= mod; } long long q = 1; for (long long i = 2; i <= r; i++) { q *= i; q %= mod; } long long q2 = 1; for (long long i = 2; i <= n - r; i++) { q2 *= i; q2 %= mod; } q = modpow(q, mod - 2); q2 = modpow(q2, mod - 2); f *= q; f %= mod; f *= q2; f %= mod; return f; } int32_t main() { std::ios::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long a[2 * n]; for (long long i = 0; i < 2 * n; i++) cin >> a[i]; sort(a, a + 2 * n); long long l = 0, r = 0; for (long long i = 0; i < n; i++) l += a[i]; for (long long i = n; i < 2 * n; i++) r += a[i]; long long ans = r - l; ans %= mod; cout << ((ans * nCr(2 * n, n)) % mod) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const unsigned int N = 150; unsigned int n, p, q, now[N], c[N], ans; inline unsigned int read() { unsigned int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); } return x * f; } unsigned int gcd(unsigned int a, unsigned int b) { return !b ? a : gcd(b, a % b); } signed main() { n = read(); p = read(); q = read(); for (unsigned int i = 0; i <= min(p, n - 1); i++) { for (unsigned int j = 1; j <= i; j++) now[j] = n - j + 1; for (unsigned int j = 1; j <= i; j++) { unsigned int x = j; for (unsigned int k = i; k >= 1; k--) { unsigned int g = gcd(now[k], x); if (g != 1) { now[k] /= g; x /= g; if (x == 1) break; } } } c[i] = 1; for (unsigned int j = 1; j <= i; j++) c[i] = c[i] * now[j]; } for (unsigned int i = 1; i <= q; i++) { unsigned int res = 0, em = 1; for (unsigned int j = 0; j <= min(p, n - 1); j++) { res += em * c[j]; em = em * i; } ans ^= (res * i); } cout << ans << endl; fclose(stdin); fclose(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; int eq = 0; int minPos = 1, maxPos; for (int i(0); i < n; i++) { int a; cin >> a; if (a < x) minPos++; else if (a == x) eq++; } int c = 0; if (eq == 0) { c++; maxPos = minPos; } else maxPos = minPos + eq - 1; while ((minPos > (n + c + 1) / 2) || (maxPos < (n + c + 1) / 2)) { if (maxPos < (n + c + 1) / 2) { minPos++; maxPos++; }; c++; } cout << c << endl; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 100100; const long long oo = 1e18; int N; long long P[MAX], D[MAX]; int L[MAX], R[MAX]; void init_L() { stack<int> S; for (int i = 0; i <= N + 1; ++i) { while (S.size() >= 2) { int x = S.top(); S.pop(); if (D[x] >= P[i] - P[S.top()]) { S.push(x); break; } } if (!S.empty()) L[i] = S.top(); S.push(i); } } void init_R() { stack<int> S; for (int i = N + 1; i >= 0; --i) { while (S.size() >= 2) { int x = S.top(); S.pop(); if (D[x] >= P[S.top()] - P[i]) { S.push(x); break; } } if (!S.empty()) R[i] = S.top(); S.push(i); } } long long low(int x) { if (x == N + 1) return -1e10; long long ret = P[R[x]] - D[x]; return ret < P[x] ? ret : +oo; } long long high(int x) { if (x == 0) return +1e10; long long ret = P[L[x]] + D[x]; return ret > P[x] ? ret : -oo; } bool check(long long W) { multiset<long long> S; for (int a = 0, b = 0; a <= N; ++a) { for (; b <= N + 1 && P[b] - P[a] <= W; ++b) S.insert(low(b)); S.erase(S.find(low(a))); if (!S.empty() && high(a) >= *S.begin()) return true; } return false; } int main() { scanf( %d , &N); for (int i = 0; i <= N + 1; ++i) scanf( %lld , P + i); for (int i = 1; i <= N; ++i) scanf( %lld , D + i), D[i] *= 2; D[0] = D[N + 1] = oo; init_L(); init_R(); if (R[0] != N + 1) { puts( 0 ); return 0; } long long lo = 1, hi = 1e10; while (lo < hi) { long long mid = (lo + hi) / 2; check(mid) ? hi = mid : lo = mid + 1; } printf( %.1lf n , lo / 2.0); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double C = 0.57721566490153286060651209; const double pi = acos(-1.0); const int mod = 1e9 + 7; const int maxn = 1e5 + 10; int a[maxn]; int b[maxn]; int used[maxn]; int main() { int n; scanf( %d , &n); int k = 0; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); b[a[i]]++; if (b[a[i]] & 1) k++; else k--; } if (k > 1) { printf( 0 n ); return 0; } long long pos = 0; for (int i = 1; i <= n / 2; ++i) if (a[i] != a[n - i + 1]) { pos = i; break; } else b[a[i]] -= 2; if (!pos) { printf( %lld n , 1LL * n * (n + 1) / 2); return 0; } int len = 0; for (int i = pos; i <= n; ++i) { used[a[i]]++; if (used[a[i]] * 2 > b[a[i]]) { if (i < n - i + 1 || (i == n - i + 1 && b[a[i]] % 2 == 0) || a[i] != a[n - i + 1]) break; } len++; } memset(used, 0, sizeof used); for (int i = n - pos + 1; i >= 1; --i) { used[a[i]]++; if (used[a[i]] * 2 > b[a[i]]) if (i > n - i + 1 || (i == n - i + 1 && b[a[i]] % 2 == 0) || a[i] != a[n - i + 1]) break; len++; } printf( %lld n , pos * (pos + len)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); int ans = 0, cnt = 0; for (int i = 0; i < n; i++) { cin >> v[i]; } for (int i = 0; i < n; i++) { if (v[i] == i) ans++; else if (v[v[i]] == i) { cnt = 1; } } cout << min(ans + cnt + 1, n); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k; long long arr[200001]; vector<long long> v; string s; int find(int i) { int curr = v[i]; int num = i; for (int j = i + 1; j < n; j++) if (v[j] == curr) num = j; else break; return num; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; cin >> n >> k; for (int i = 0; i < n; i++) cin >> arr[i]; cin >> s; for (int i = 0; i < n; i++) { int a = s[i] - a ; v.push_back(a); } int count = 1; long long d = 0; int prev; for (int i = 0; i < n; i++) { int nx = find(i); int dis = nx - i + 1; if (dis <= k) { for (int j = i; j <= nx; j++) d += arr[j]; } else { sort(arr + i, arr + nx + 1); for (int j = nx; j >= nx - k + 1; j--) d += arr[j]; } i = nx; } cout << d; }
|
#include <bits/stdc++.h> using namespace std; vector<int> adj[500010], ar; bool vis[500010]; int u, v, n, m, s, res = 0; void dfs(int cur) { vis[cur] = true; for (auto i : adj[cur]) if (!vis[i]) dfs(i); ar.push_back(cur); } int main() { scanf( %d%d%d , &n, &m, &s); for (int i = 0; i < m; ++i) { scanf( %d%d , &u, &v); adj[u].push_back(v); } dfs(s); for (int i = 1; i <= n; ++i) { if (!vis[i]) dfs(i); } memset(vis, false, sizeof vis); for (int i = n - 1; i >= 0; --i) { if (!vis[ar[i]]) { if (s != ar[i]) res++; dfs(ar[i]); } } printf( %d n , res); return 0; }
|
#include <bits/stdc++.h> long long a[100005]; long long count[100005]; int vis[100005]; struct Element { long long l, r; Element(long long l, long long r) : l(l), r(r) {} }; Element getCount(long long k, int n) { long long lower = 0, upper = 0; int met = 0; for (int i = 1; i <= n; i++) { long long l = 1, r = a[i]; long long res = 0; while (l <= r) { long long m = (l + r) / 2; long long value = a[i] - 3ll * m * m + 3 * m - 1; if (value >= k) { res = m; l = m + 1; } else r = m - 1; } lower += res, upper += res; count[i] = res; long long value = a[i] - 3ll * res * res + 3 * res - 1; if (value == k) { vis[i] = 1; count[i]--; if (!met) met = 1; else lower--; } else vis[i] = 0; } return Element(lower, upper); } int main() { int n; long long k; scanf( %d%lld , &n, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); long long l = -3e18, r = 1e10; while (l <= r) { long long m = (l + r) / 2; Element u = getCount(m, n); if (u.l > k) l = m + 1; else if (u.r < k) r = m - 1; else { break; } } long long need = k; for (int i = 1; i <= n; i++) need -= count[i]; for (int i = 1; i <= n; i++) { if (need && vis[i]) { need--; count[i]++; } printf( %lld , count[i]); } printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, s, k, a[2010], b[2010], nxt[2010], sum[2010], dp[2010][2010]; inline int read() { int s = 0, w = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) w = -1; for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48); return s * w; } bool check(int mid) { for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + (a[i] <= b[mid]); memset(dp, 0, sizeof(dp)); for (int i = 1; i <= s; ++i) { for (int j = 1; j <= n; ++j) dp[i][j] = max(dp[i][j], dp[i - 1][j]); for (int j = 1; j <= n; ++j) if (nxt[j]) dp[i][nxt[j]] = max(dp[i][nxt[j]], dp[i - 1][j - 1] + sum[nxt[j]] - sum[j - 1]); for (int j = 1; j <= n; ++j) dp[i][j] = max(dp[i][j - 1], dp[i][j]); } return dp[s][n] >= k; } int main() { n = read(), m = read(), s = read(), k = read(); for (int i = 1; i <= n; ++i) a[i] = read(), b[i] = a[i]; sort(b + 1, b + 1 + n); for (int i = 1; i <= m; ++i) { int l = read(), r = read(); for (int j = l; j <= r; ++j) nxt[j] = max(nxt[j], r); } int l = 1, r = n, ans = -1; while (l <= r) { int mid = (l + r) >> 1; if (check(mid)) ans = b[mid], r = mid - 1; else l = mid + 1; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k; string a; int b[10000]; int memo[2000][2000]; int dp(int i, int d) { if (abs(d) == k && i == a.length()) return 0; if (i == a.length() || abs(d) == k) return 1; if (memo[i][d] != -1) return memo[i][d]; int x; if (a[i] == L ) x = dp(i + 1, d - 1); else if (a[i] == W ) x = dp(i + 1, d + 1); else if (a[i] == D ) x = dp(i + 1, d); else { b[i] = W - A ; x = dp(i + 1, d + 1); if (x == 1) { b[i] = L - A ; x = dp(i + 1, d - 1); } if (x == 1) { b[i] = D - A ; x = dp(i + 1, d); } } return memo[i][d] = x; } int main() { memset(memo, -1, sizeof(memo)); cin >> n >> k >> a; if (dp(0, 0) == 1) cout << NO ; else { for (int i = 0; i < a.length(); i++) { if (a[i] != ? ) cout << a[i]; else cout << (char)(b[i] + A ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e3 + 5; const double eps = 1e-10; struct TARGET { int x, y, t; double p; } mp[MAX_N]; int n; double dis[MAX_N][MAX_N]; double dp[MAX_N]; bool MAP_CMP(TARGET a, TARGET b) { return a.t < b.t; } void input() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d%d%d%lf , &mp[i].x, &mp[i].y, &mp[i].t, &mp[i].p); } int sqr(int x) { return x * x; } void solve() { sort(mp, mp + n, MAP_CMP); for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) dis[i][j] = dis[j][i] = sqr(mp[i].x - mp[j].x) + sqr(mp[i].y - mp[j].y); for (int i = 0; i < n; i++) dp[i] = mp[i].p; for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) { if (1ll * (mp[i].t - mp[j].t) * (mp[i].t - mp[j].t) >= dis[i][j]) dp[i] = max(dp[i], dp[j] + mp[i].p); } double ans = 0.0; for (int i = 0; i < n; i++) if (dp[i] > ans) ans = dp[i]; printf( %.6f n , ans); } int main() { input(); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, c = 0; cin >> n >> m; int a[n], i; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < m; i++) if (a[i] <= 0) c = c + a[i]; cout << abs(c); }
|
#include <bits/stdc++.h> const int M = 1e9 + 7, N = 2 * 1e5 + 3; using namespace std; int main() { long long a, b, f, k, b0; cin >> a >> b >> f >> k; b0 = b; int ans = 0; if (b < f || b < a - f) { cout << -1; return 0; } b0 = b - f; if (b0 < 0) { cout << -1; return 0; } bool q = 1; while (k > 1) { if (q) { if (b0 < (a - f) * 2) b0 = b, ans++; b0 -= (a - f) * 2; if (b0 < 0) { cout << -1; return 0; } q = 0; k--; } else { if (b0 < 2 * f) b0 = b, ans++; b0 -= 2 * f; if (b0 < 0) { cout << -1; return 0; } q = 1; k--; } } if (q && b0 < a - f || !q && b0 < f) cout << ans + 1; else cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 7; const long long inf = 0x3f3f3f3f3f3f3f; const long long mod = 20000311; int n; vector<int> a(100), b(100); vector<int> step[100], ves[100]; void solve(int n) { int st = 0; for (int i = 0; i < step[n].size(); i++) { ves[i].clear(); for (int j = st; j < st + step[n][i]; j++) ves[i].push_back(a[j]); st += step[n][i]; } a.clear(); for (int i = step[n].size() - 1; i >= 0; i--) for (auto j : ves[i]) a.push_back(j); } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i], b[a[i]] = i; if (n == 1) { cout << 0 << n ; return 0; } step[1].push_back(b[1]), step[1].push_back(n - b[1]); solve(1); int flag = n % 2 == 0; for (int go = 2; go + flag <= n; go++) { if (go % 2 == 0) { for (int i = 1; i < go; i++) step[go].push_back(1); int cnt = 1; while (a[cnt] != go) cnt++; if (cnt - go + 2) step[go].push_back(cnt - go + 2); if (n - cnt - 1) step[go].push_back(n - cnt - 1); solve(go); } else { int cnt = n - 1; while (a[cnt] != go) cnt--; if (cnt) step[go].push_back(cnt); if (n - go + 1 - cnt) step[go].push_back(n - go + 1 - cnt); for (int i = 1; i < go; i++) step[go].push_back(1); solve(go); } } int tot = 0, st = 1; if (b[1] == 0) st = 2; cout << n - flag - st + 1 << n ; for (int i = st; i <= n - flag; i++) { cout << step[i].size() << ; for (auto j : step[i]) cout << j << ; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 3; struct tree { int l, r, minn, lazy; long long sum; } tre[MAXN << 2]; int n, m; long long a[MAXN]; void build(int i, int l, int r) { tre[i].l = l, tre[i].r = r; tre[i].lazy = 0; if (l == r) { tre[i].minn = a[l]; tre[i].sum = a[l]; return; } int mid = l + r >> 1; build(i << 1, l, mid); build(i << 1 | 1, mid + 1, r); tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; } void pushdown(int i) { if (tre[i].lazy) { tre[i << 1].minn = tre[i].lazy, tre[i << 1 | 1].minn = tre[i].lazy; tre[i << 1].lazy = tre[i << 1 | 1].lazy = tre[i].lazy; tre[i << 1].sum = 1ll * (tre[i << 1].r - tre[i << 1].l + 1) * tre[i].lazy; tre[i << 1 | 1].sum = 1ll * (tre[i << 1 | 1].r - tre[i << 1 | 1].l + 1) * tre[i].lazy; tre[i].lazy = 0; } } int find_(int i, int l, int r, long long x) { if (tre[i].l >= l && tre[i].r <= r) { if (tre[i].minn > x) return 0; if (tre[i].l == tre[i].r) { if (tre[i].minn <= x) return tre[i].r; return 0; } pushdown(i); tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; if (tre[i << 1].minn > x) return find_(i << 1 | 1, l, r, x); return find_(i << 1, l, r, x); } if (tre[i].l == tre[i].r) return 0; pushdown(i); int ans = 0; if (tre[i << 1].r >= l) ans = find_(i << 1, l, r, x); if (!ans && tre[i << 1 | 1].l <= r) { ans = find_(i << 1 | 1, l, r, x); } tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; return ans; } void modify(int i, int l, int r, int delta) { if (tre[i].l > r || tre[i].r < l) return; if (tre[i].l >= l && tre[i].r <= r) { tre[i].lazy = delta; tre[i].minn = delta; tre[i].sum = 1ll * (tre[i].r - tre[i].l + 1) * delta; return; } pushdown(i); modify(i << 1, l, r, delta); modify(i << 1 | 1, l, r, delta); tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; } bool flag; void que(int i, long long &delta, int &tot) { if (tre[i].l == tre[i].r) { if (delta >= tre[i].sum) tot = max(tot, tre[i].r), delta -= tre[i].sum; return; } pushdown(i); tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; if (tre[i << 1].sum <= delta) { tot = max(tot, tre[i << 1].r); delta -= tre[i << 1].sum; que(i << 1 | 1, delta, tot); } else { que(i << 1, delta, tot); } } void query(int i, int l, int r, long long &delta, int &tot) { if (tre[i].l > r || tre[i].r < l || flag) return; if (tre[i].l >= l && tre[i].r <= r) { if (tre[i].sum <= delta) { tot = max(tre[i].r, tot); delta -= tre[i].sum; return; } if (tre[i].l == tre[i].r) { if (tre[i].sum <= delta) { tot = max(tot, tre[i].r), delta -= tre[i].sum; } else flag = 1; return; } flag = 1; que(i, delta, tot); pushdown(i); tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; return; } pushdown(i); tre[i].minn = min(tre[i << 1].minn, tre[i << 1 | 1].minn); tre[i].sum = tre[i << 1].sum + tre[i << 1 | 1].sum; query(i << 1, l, r, delta, tot); query(i << 1 | 1, l, r, delta, tot); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); build(1, 1, n); for (int i = 1; i <= m; i++) { int x, op; long long y; scanf( %d%d%lld , &op, &x, &y); if (op == 1) { int tot = find_(1, 1, x, y); if (!tot) continue; modify(1, tot, x, y); } else { int an = 0; while (x <= n) { int tot = find_(1, x, n, y); int tot1 = 0; flag = 0; query(1, tot, n, y, tot1); if (tot == 0 || tot1 == 0) break; an += tot1 - tot + 1, x = tot1 + 1; } printf( %d n , an); } } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); map<pair<int, int>, int> f; int t, it, n, res, tmp, x, y, resr, resl, i; string s; cin >> t; for (it = 1; it <= t; it++) { cin >> n; cin >> s; s = + s; x = 0; y = 0; resr = 1e8; resl = -1e8; for (i = 1; i <= n; i++) { if (s[i] == D ) { x--; if (f[{x, y}] != 0) { if ((i - f[{x, y}] - 1) < (resr - resl)) { resr = i; resl = f[{x, y}] + 1; } } if ((x == 0) && (y == 0)) { if ((i - 1) < (resr - resl)) { resr = i; resl = 1; } } f[{x, y}] = i; } else if (s[i] == U ) { x++; if (f[{x, y}] != 0) { if ((i - f[{x, y}] - 1) < (resr - resl)) { resr = i; resl = f[{x, y}] + 1; } } if ((x == 0) && (y == 0)) { if ((i - 1) < (resr - resl)) { resr = i; resl = 1; } } f[{x, y}] = i; } else if (s[i] == L ) { y--; if (f[{x, y}] != 0) { if ((i - f[{x, y}] - 1) < (resr - resl)) { resr = i; resl = f[{x, y}] + 1; } } if ((x == 0) && (y == 0)) { if ((i - 1) < (resr - resl)) { resr = i; resl = 1; } } f[{x, y}] = i; } else if (s[i] == R ) { y++; if (f[{x, y}] != 0) { if (((i)-f[{x, y}] - 1) < (resr - resl)) { resr = i; resl = f[{x, y}] + 1; } } if ((x == 0) && (y == 0)) { if ((i - 1) < (resr - resl)) { resr = i; resl = 1; } } f[{x, y}] = i; } } if (resr == 1e8) { cout << -1 << n ; } else { cout << resl << << resr << n ; } f.clear(); } }
|
#include <bits/stdc++.h> using namespace std; int vis[5][5]; int ac[5][5], bc[5][5]; pair<int, int> sum[100]; pair<int, int> cal(int a, int b) { if (a == 1) { if (b == 1) return pair<int, int>(0, 0); else if (b == 2) return pair<int, int>(0, 1); return pair<int, int>(1, 0); } else if (a == 2) { if (b == 1) return pair<int, int>(1, 0); else if (b == 2) return pair<int, int>(0, 0); return pair<int, int>(0, 1); } else { if (b == 1) return pair<int, int>(0, 1); else if (b == 2) return pair<int, int>(1, 0); return pair<int, int>(0, 0); } } int main() { long long k, pa = 0, pb = 0; int a, b; scanf( %lld%d%d , &k, &a, &b); for (int i = 1; i <= 3; i++) for (int j = 1; j <= 3; j++) scanf( %d , &ac[i][j]); for (int i = 1; i <= 3; i++) for (int j = 1; j <= 3; j++) scanf( %d , &bc[i][j]); int sz = 1; vis[a][b] = sz++; sum[1] = cal(a, b); int last = 1; for (int i = 1; i <= k; i++) { int na = ac[a][b]; int nb = bc[a][b]; if (vis[na][nb]) { last = vis[na][nb]; break; } a = na, b = nb; vis[a][b] = sz; sum[sz] = pair<int, int>(sum[sz - 1].first + cal(a, b).first, sum[sz - 1].second + cal(a, b).second); sz++; } sz--; if (sz == k) { printf( %d %d n , sum[sz].first, sum[sz].second); return 0; } pa += sum[last - 1].first; pb += sum[last - 1].second; k -= last - 1; long long dv = k / (sz - last + 1); pa += dv * (sum[sz].first - sum[last - 1].first); pb += dv * (sum[sz].second - sum[last - 1].second); k %= (sz - last + 1); if (k != 0) { pa += (sum[last + k - 1].first - sum[last - 1].first); pb += (sum[last + k - 1].second - sum[last - 1].second); } printf( %lld %lld n , pa, pb); }
|
#include <bits/stdc++.h> using namespace std; int n, m, q, a[501][501], x, y, s, ans; vector<int> v; int main() { ios::sync_with_stdio(false); cin >> n >> m >> q; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int p = 1; p <= q; p++) { cin >> x >> y; if (a[x][y] == 1) a[x][y] = 0; else a[x][y] = 1; for (int i = 1; i <= n; i++) { s = 0; for (int j = 1; j <= m; j++) { if (a[i][j] == 1) s++; else s = 0; ans = max(ans, s); } } v.push_back(ans); ans = 0; } for (int i = 0; i < v.size(); i++) cout << v[i] << endl; }
|
#include <bits/stdc++.h> class MapValue { public: std::string configuration; int s1; MapValue() {} MapValue(std::string configuration, int s1) : configuration(configuration), s1(s1) {} }; class PairHash { public: std::size_t operator()(const std::pair<int, int> &p) const { return std::hash<int>()(p.first) ^ std::hash<int>()(p.second); } }; std::unordered_map<std::pair<int, int>, MapValue, PairHash> my_map; int A[100], B[100], C[100], q_rez = -0x3f3f3f3f; std::string rrr = Impossible ; void back(int s1, int s2, int s3, int k, int max, std::string ss) { if (k == max + 1) { my_map.emplace(std::make_pair(s2 - s1, s3 - s2), MapValue(ss, s1)); return; } s1 += A[k]; s2 += B[k]; back(s1, s2, s3, k + 1, max, ss + LM n ); s1 -= A[k]; s3 += C[k]; back(s1, s2, s3, k + 1, max, ss + MW n ); s2 -= B[k]; s1 += A[k]; back(s1, s2, s3, k + 1, max, ss + LW n ); } void back2(int s1, int s2, int s3, int k, int max, std::string ss) { if (k == max + 1) { std::string result; auto it = my_map.find(std::make_pair(s1 - s2, s2 - s3)); if (it != my_map.end()) { int q = s1 + it->second.s1; if (q > q_rez) { rrr = it->second.configuration + ss; q_rez = q; } } return; } s1 += A[k]; s2 += B[k]; back2(s1, s2, s3, k + 1, max, ss + LM n ); s1 -= A[k]; s3 += C[k]; back2(s1, s2, s3, k + 1, max, ss + MW n ); s2 -= B[k]; s1 += A[k]; back2(s1, s2, s3, k + 1, max, ss + LW n ); } int main() { int N; std::cin >> N; for (int i = 1; i <= N; i++) { std::cin >> A[i] >> B[i] >> C[i]; } std::string ss = ; back(0, 0, 0, 1, N / 2, ss); ss = ; back2(0, 0, 0, N / 2 + 1, N, ss); std::cout << rrr; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2.7e5 + 5; int m, n, k; int mod; int f[19][maxn]; vector<long long> g; int cnt[maxn]; int upd(const int &x) { if (x < 0) return x + mod; if (x >= mod) return x - mod; return x; } void add(int &x, const int &y) { x = upd(x + y); } int ksm(int x, int k) { int ans = 1; while (k) { if (k & 1) ans = 1ll * ans * x % mod; x = 1ll * x * x % mod; k >>= 1; } return ans; } int jc[maxn], inv[maxn]; void init(int n) { jc[0] = 1; for (int i(1), endi(n); i <= endi; i++) jc[i] = 1ll * jc[i - 1] * i % mod; inv[n] = ksm(jc[n], mod - 2); for (int i(n - 1), endi(0); i >= endi; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod; } void F(int *f, int n, int h) { for (int p = 1; p < n; p <<= 1) for (int i = 0; i < n; i += p << 1) for (int k(i), endk(i + p - 1); k <= endk; k++) { add(f[k + p], h * f[k]); } } int l; vector<long long> operator*(vector<long long> &A, vector<long long> &B) { static vector<long long> C; C.clear(); C.resize(l + 1); for (int i(0), endi(l); i <= endi; i++) for (int j(0), endj(l - i); j <= endj; j++) C[i + j] += A[i] * B[j]; for (int i(0), endi(l); i <= endi; i++) C[i] %= mod; return C; } vector<long long> pksm(vector<long long> A, int k) { static vector<long long> C; C.clear(); C.resize(l + 1); C[0] = 1; while (k) { if (k & 1) C = C * A; A = A * A; k >>= 1; } return C; } int main() { cin >> n >> k >> mod; init(n); if (n & 1) { cout << ksm(k, n); return 0; } m = 1; while (m <= n) m <<= 1, l++; for (int i(0), endi(m - 1); i <= endi; i++) cnt[i] = cnt[i >> 1] + (i & 1); init(m); for (int i(0), endi(m - 1); i <= endi; i++) { f[cnt[i]][i] = inv[i]; } for (int i(0), endi(l); i <= endi; i++) F(f[i], m, 1); g.resize(l + 1); for (int s(0), ends(m - 1); s <= ends; s++) { for (int i(0), endi(l); i <= endi; i++) g[i] = f[i][s]; g = pksm(g, k); for (int i(0), endi(l); i <= endi; i++) f[i][s] = g[i]; } F(f[cnt[n]], m, -1); cout << upd(ksm(k, n) - 1ll * f[cnt[n]][n] * jc[n] % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool issquare(int n) { int sq = sqrt(n); if (sq * sq == n) { return true; } else { return false; } } int main() { long long int n; cin >> n; long long int ans = n; int f = 1; while (n != 1 and f == 1) { int sqr = ceil(sqrt((n * 1.0))); f = 0; for (int i = 2; i <= sqr; i++) { if (n % i == 0) { n = n / i; ans += n; f = 1; break; } } } if (n != 1) ans += 1; cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = ((int)5e5) + 5; long long int sum[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; for (int i = 0; i < s.length(); i++) { long long int total = 0; for (int j = i; j < s.length(); j++) { total += s[j] - 0 ; sum[total]++; } } long long int ans = 0; if (n == 0) { ans = 2 * sum[0] * ((s.length()) * (s.length() + 1)) / 2 - sum[0] * sum[0]; } else { for (int i = 1; i < maxn; i++) { if (n % i == 0 && (n / i) < maxn) { ans += sum[i] * sum[n / i]; } } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); long long x = 1; long long a = 1; for (int i = 1; i <= m; i++) a = (a << 1) % 1000000009; for (int i = 1; i <= n; i++) { a--; x = x % 1000000009 * (a + 1000000009) % 1000000009; } printf( %I64d n , x % 1000000009); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const long long MOD = 1e9 + 7; pair<int, int> es[200000]; vector<pair<int, int> > g[200000]; int degree[200000]; set<pair<int, int> > st; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; scanf( %d%d%d , &n, &m, &k); for (long long i = 0; i < m; i++) { scanf( %d%d , &es[i].first, &es[i].second); es[i].first--, es[i].second--; g[es[i].first].push_back({es[i].second, i}); g[es[i].second].push_back({es[i].first, i}); degree[es[i].first]++, degree[es[i].second]++; } reverse(es, es + m); for (long long i = 0; i < n; i++) st.insert({degree[i], i}); while (!st.empty() && st.begin()->first < k) { auto v = st.begin(); for (pair<int, int> &i : g[v->second]) { int to = i.first; if (st.find({degree[to], to}) != st.end()) { st.erase({degree[to], to}); degree[to]--; st.insert({degree[to], to}); } } st.erase(v); } vector<int> out; for (long long j = 0; j < m; j++) { out.push_back(st.size()); int u = es[j].first, v = es[j].second; if (st.find({degree[u], u}) != st.end() && st.find({degree[v], v}) != st.end()) { st.erase({degree[u], u}); degree[u]--; st.insert({degree[u], u}); st.erase({degree[v], v}); degree[v]--; st.insert({degree[v], v}); while (!st.empty() && st.begin()->first < k) { auto v = st.begin(); for (pair<int, int> &i : g[v->second]) { if (i.second >= m - j - 1) continue; int to = i.first; if (st.find({degree[to], to}) != st.end()) { st.erase({degree[to], to}); degree[to]--; st.insert({degree[to], to}); } } st.erase(v); } } } reverse(begin(out), end(out)); for (int i : out) printf( %d n , i); }
|
#include <bits/stdc++.h> using namespace std; template <class T> void Read(T &x) { char c; bool f(0); while (c = getchar(), c != EOF) { if (c == - ) f = 1; else if (c >= 0 && c <= 9 ) { x = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) x = x * 10 + c - 0 ; ungetc(c, stdin); if (f) x = -x; return; } } } struct point { int x, y; inline point() {} inline point(int x, int y) : x(x), y(y) {} inline point operator-(const point &b) const { return point(x - b.x, y - b.y); } inline bool operator<(const point &b) const { if (x == b.x) return y < b.y; return x < b.x; } inline bool operator>(const point &b) const { if (x == b.x) return y > b.y; return x > b.x; } inline bool operator==(const point &b) const { return x == b.x && y == b.y; } } a[100000 + 10]; int Q; set<point> s; set<point, greater<point> > s2; inline long long cross(const point &a, const point &b) { return 1ll * a.x * b.y - 1ll * a.y * b.x; } template <class T> void insert(T &s, const point &a) { auto i = s.lower_bound(a); if (i != s.end() && *i == a) return; auto j = i; if (j != s.begin()) { j--; while (j != s.begin()) { auto k = j--; if (cross(*k - *j, a - *k) > 0) break; s.erase(k); } } if (i != s.end()) { auto k = i; while (++i != s.end()) { if (cross(*k - a, *i - a) > 0) break; s.erase(k); k = i; } } i = s.lower_bound(a); if (i == s.end() || i == s.begin()) s.insert(a); else { auto j = i--; if (cross(a - *i, *j - *i) > 0) s.insert(a); } } template <class T> bool check(const T &s, const point &a) { auto i = s.lower_bound(a); if (*i == a) return 1; if (i == s.begin() || i == s.end()) return 0; auto j = i--; return cross(a - *i, *j - *i) <= 0; } int main() { Read(Q); int p, x, y; while (Q--) { Read(p), Read(x), Read(y); if (p == 1) { insert(s, point(x, y)); insert(s2, point(x, y)); } else puts(check(s, point(x, y)) && check(s2, point(x, y)) ? YES : NO ); } }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { string s; int min1 = 200, min2 = 200, min3 = 200, min4 = 200, min5 = 200; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == h && i < min1) min1 = i; if (s[i] == e && i < min2 && min1 < i) min2 = i; if (s[i] == l && i < min3 && min2 < i) { min3 = i; s[i] = 0; } if (s[i] == l && i < min4 && min3 < i) { min4 = i; s[i] = 0; } if (s[i] == o && i < min5 && min4 < i) min5 = i; } if (min1 < min2 && min2 < min3 && min3 < min4 && min4 < min5 && min1 != 200 && min2 != 200 && min3 != 200 && min4 != 200 && min5 != 200) cout << YES ; else cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long a, b; cin >> a >> b; cout << YES << endl; for (long long i = a; i <= b; i += 2) cout << i << << i + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int const N = 100000; long long a[N + 5], res; int n, p; int main() { cin >> n >> p; for (int i = 1; i <= n; ++i) { cin >> a[i]; a[i] += a[i - 1]; } for (int i = 1; i < n; ++i) res = max(res, a[i] % p + (a[n] - a[i]) % p); cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k, t; int index(int i, int j) { return (i - 1) * m + j; } int main() { cin >> n >> m >> k >> t; int arr[k]; for (int i = 0; i < k; i++) { int a, b; cin >> a >> b; arr[i] = index(a, b); } sort(arr, arr + k); while (t--) { int a, b; cin >> a >> b; int x = index(a, b); int cnt = 0; for (int i = 0; i < k; i++) { int element = arr[i]; if (x > element) cnt++; else if (x == element) { cnt = -1; break; } else break; } if (cnt == -1) { cout << Waste << endl; continue; } int mod = (x - cnt - 1) % 3; if (mod == 0) cout << Carrots << endl; if (mod == 1) cout << Kiwis << endl; if (mod == 2) cout << Grapes << endl; } return 0; }
|
#include<bits/stdc++.h> using namespace std; const int maxn=4e3+100; typedef long long ll; ll l[maxn],r[maxn],d[maxn]; int main() { int n,m,k;cin>>n>>m>>k; for(int i=1;i<=m;i++)cin>>l[i]>>r[i]; ll ans=0; for(int i=1,j=k;j<=n;i++,j++)//枚举第一个区间 { ll sum=0,w; memset(d,0,sizeof(d)); for(int p=1;p<=m;p++) { w = max(0ll, min(r[p], 1ll*j)+1 - max(l[p], 1ll*i)); sum += w; if(w<r[p]-l[p]+1)d[l[p]+w]++,d[l[p]+k]--,d[r[p]+1]--,d[r[p]+1+k-w]++; } for(int q=1;q<=n;q++)d[q]+=d[q-1]; ll imax=0; for(int q=1;q<=n;q++)d[q]+=d[q-1],imax=max(imax,1ll*d[q]); ans=max(ans,sum+imax); } cout<<ans<<endl; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_BUF_SIZE = 16384; char BUFOR[MAX_BUF_SIZE]; int BUF_SIZE, BUF_POS; char ZZZ; const int MXN = 1000010; const int C = 262144; const int INF = 1000000001; int n, m, h; int s[MXN]; int sum; int sh; void test() { scanf( %d %d %d , &n, &m, &h); for (int i = 1; i <= m; i++) { int tmp; scanf( %d , &tmp); if (i == h) sh = tmp; sum += tmp; } if (sum < n) { printf( -1 n ); return; } long double res = 1; for (int i = sum - sh - n + 2; i <= sum - sh; i++) res = res * i; for (int i = sum - n + 1; i <= sum - 1; i++) res = res / i; double rr = res; printf( %.9lf n , 1 - rr); } int main() { int te = 1; while (te--) test(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, D; signed long long A[202020]; int M; void solve() { int i, j, k, l, r, x, y; string s; cin >> N >> D; for (i = 0; i < (N); i++) cin >> A[i]; cin >> M; for (i = 0; i < (M); i++) { cin >> x; if (x == A[0] || x == A[N - 1] + 1) { (void)printf( %.12lf n , atan(1) * 2); continue; } y = lower_bound(A, A + N, x) - A; if (A[y] == x && A[y - 1] == x - 1) { (void)printf( %.12lf n , atan(1) * 4); continue; } if (A[y] == x || A[y - 1] == x - 1) { (void)printf( %.12lf n , atan(1) * 2); continue; } signed long long dif = min(x - A[y - 1] - 1, A[y] - x); double ret = atan(1.0 / dif); int L = y - 1; int R = y; int ok = 0; for (j = 20; j >= 0; j--) if (2 * atan(1.0 / (ok + (1 << j))) >= ret) ok += 1 << j; while (L >= 0 && R < N) { int dl = x - (A[L] + 1); int dr = A[R] - x; if (max(dl, dr) > ok) break; if (abs(dl - dr) <= 1) { ret = 2 * atan(1.0 / max(dl, dr)); break; } if (dl < dr) L--; else R++; } (void)printf( %.12lf n , ret); } } int main(int argc, char** argv) { string s; int i; if (argc == 1) ios::sync_with_stdio(false), cin.tie(0); for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += n ; for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin); cout.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, D, a[105], ans; int main() { int T; cin >> T; while (T--) { cin >> N >> D; for (int i = 1; i <= N; i++) cin >> a[i]; for (int i = 2; i <= N; i++) { int move = min(a[i], D / (i - 1)); a[1] += move; D -= move * (i - 1); } cout << a[1] << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t, c; cin >> n >> t >> c; int ls = 0; int ans = 0; for (int i = 1; i <= n; i++) { int a; cin >> a; if (a > t) ls = i; else if (i - ls >= c) ans++; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e = 0, all = 0, i = 0; cin >> a >> b; c = a; d = b; while (c) { if ((c % 10) > e) { e = c % 10; } c = c / 10; } while (d) { if ((d % 10) > e) { e = d % 10; } d = d / 10; } e = e + 1; while (a) { all = (a % 10) * pow(e, i) + all; a = a / 10; i++; } i = 0; a = b; while (a) { all = (a % 10) * pow(e, i) + all; a = a / 10; i++; } i = 0; while (all) { all = all / e; i++; } cout << i << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { static int r; static char c; r = 0, c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) r = r * 10 + (c - 0 ), c = getchar(); return r; } template <typename T> inline void print(T* a, int n) { for (int i = 1; i < n; ++i) cout << a[i] << ; cout << a[n] << endl; } const int INFI = 123456789; int n, a[300000 + 1], p[300000 + 1]; long long ans = 0LL; struct node { int m, mc, m2, m2c, d; } tree[300000 * 5]; inline node update(node l, node r) { static node ret; ret = l; ret.d = 0; if (r.m < ret.m) { ret.m2 = ret.m, ret.m2c = ret.mc; ret.m = r.m, ret.mc = r.mc; } else if (r.m == ret.m) { ret.mc += r.mc; } else if (r.m < ret.m2) { ret.m2 = r.m, ret.m2c = r.mc; } else if (r.m == ret.m2) { ret.m2c += r.mc; } if (r.m2 < ret.m2) { ret.m2 = r.m2, ret.m2c = r.m2c; } else if (r.m2 == ret.m2) { ret.m2c += r.m2c; } return ret; } inline void applyDelta(int x, int d) { tree[x].d += d, tree[x].m += d, tree[x].m2 += d; } inline void push(int x) { if (tree[x].d != 0) { applyDelta(((x) << 1), tree[x].d); applyDelta(((x) << 1 | 1), tree[x].d); tree[x].d = 0; } } void modify(int x, int l, int r, int s, int t, int v) { if (l == s && r == t) { applyDelta(x, v); return; } push(x); int mid = l + r >> 1; if (t <= mid) modify(((x) << 1), l, mid, s, t, v); else if (s > mid) modify(((x) << 1 | 1), mid + 1, r, s, t, v); else { modify(((x) << 1), l, mid, s, mid, v); modify(((x) << 1 | 1), mid + 1, r, mid + 1, t, v); } tree[x] = update(tree[((x) << 1)], tree[((x) << 1 | 1)]); } node query(int x, int l, int r, int s, int t) { if (l == s && r == t) return tree[x]; push(x); int mid = l + r >> 1; if (t <= mid) return query(((x) << 1), l, mid, s, t); else if (s > mid) return query(((x) << 1 | 1), mid + 1, r, s, t); return update(query(((x) << 1), l, mid, s, mid), query(((x) << 1 | 1), mid + 1, r, mid + 1, t)); } inline int query(int i) { static node cur; cur = query(1, 1, n, i, n); if (cur.m2 <= 2) return cur.mc + cur.m2c; if (cur.m <= 2) return cur.mc; return 0; } void build(int x, int l, int r) { if (l == r) { tree[x].m = 0, tree[x].m2 = INFI; tree[x].mc = 1, tree[x].m2c = 0; tree[x].d = 0; return; } int mid = l + r >> 1; build(((x) << 1), l, mid); build(((x) << 1 | 1), mid + 1, r); tree[x] = update(tree[((x) << 1)], tree[((x) << 1 | 1)]); } int main(int argc, char* argv[]) { n = read(); for (int i = 1; i <= n; ++i) a[i] = read(); for (int i = 1; i <= n; ++i) p[a[i]] = i; build(1, 1, n); for (int i = n; i > 0; --i) { int l = 0, r = 0; if (p[i] > 1 && a[p[i] - 1] > i) l = a[p[i] - 1]; if (p[i] < n && a[p[i] + 1] > i) r = a[p[i] + 1]; if (l > r) swap(l, r); if (l != 0) { modify(1, 1, n, r, n, -1); modify(1, 1, n, i, l - 1, 1); } else if (r != 0) { modify(1, 1, n, i, r - 1, 1); } else { modify(1, 1, n, i, n, 1); } ans += query(i); } cout << ans - n << endl; fclose(stdin); fclose(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; int r1, c1, r2, c2; int CB[10][10]; int dr[8] = {1, -1, 1, -1, -2, -2, 2, 2}; int dc[8] = {2, 2, -2, -2, -1, 1, -1, 1}; int main() { char s[10]; scanf( %s , s); r1 = s[0] - a + 1; c1 = s[1] - 0 ; scanf( %s , s); r2 = s[0] - a + 1; c2 = s[1] - 0 ; CB[r1][c1] = 2; CB[r2][c2] = 2; for (int i = r1, j = c1 + 1; j <= 8; j++) CB[i][j] = 1; for (int i = r1, j = c1 - 1; j > 0; j--) CB[i][j] = 1; for (int i = r1 + 1, j = c1; i <= 8; i++) CB[i][j] = 1; for (int i = r1 - 1, j = c1; i > 0; i--) CB[i][j] = 1; for (int i = 0; i < 8; i++) { int p = r2 + dr[i]; int q = c2 + dc[i]; if (p > 0 && q > 0 && p < 9 && q < 9) CB[p][q] = 1; } for (int i = 0; i < 8; i++) { int p = r1 + dr[i]; int q = c1 + dc[i]; if (p > 0 && q > 0 && p < 9 && q < 9) CB[p][q] = 1; } int cnt = 0; for (int i = 1; i <= 8; i++) { for (int j = 1; j <= 8; j++) { if (CB[i][j] == 0) cnt++; } } printf( %d n , cnt); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e; cin >> a >> b >> c >> d >> e; if (a == 0 && b == 0 && c == 0 && d == 0 && e == 0) cout << -1; else if ((a + b + c + d + e) % 5 != 0) cout << -1; else cout << (a + b + c + d + e) / 5; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, x; cin >> t; while (t--) { cin >> x; while (x > 0) { if (x % 3 == 0) x = x % 3; else if (x % 7 == 0) x = x % 7; else { x -= 7; x -= 3; } } if (x == 0) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> using namespace std; const double pi = 3.1415926535; const double eps = 1e-6; struct TP { int x, h, id; } P[110000]; bool cmp(TP a, TP b) { return a.x < b.x; } int n, tot, Z[110000], F[110000], num[110000], ans[110000]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , &P[i].x, &P[i].h); P[i].id = i; } sort(P, P + n, cmp); for (int i = n - 1; i >= 0; i--) { int now = P[i].x + P[i].h, all = 1; while (tot && Z[tot] < now) { now = max(now, F[tot]); all += num[tot]; tot--; } tot++; Z[tot] = P[i].x; F[tot] = now; num[tot] = all; ans[P[i].id] = all; } for (int i = 0; i < n; i++) printf( %d , ans[i]); puts( ); cin >> n; }
|
#include <bits/stdc++.h> using namespace std; struct order { int num; int pos; }; bool fun(order a, order b) { return (a.num < b.num); } int main() { int n, k, i, j; cin >> n >> k; vector<order> a(n); for (i = 0; i < n; i++) { cin >> a[i].num; a[i].pos = i + 1; } set<int> s; sort(a.begin(), a.end(), fun); i = 0; while (k - a[i].num >= 0 && i < n) { k -= a[i].num; s.insert(a[i].pos); i++; } cout << s.size() << endl; set<int>::iterator it; for (it = s.begin(); it != s.end(); it++) cout << *it << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { return a > b ? a : b; } long long min(long long a, long long b) { return a < b ? a : b; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } const long long INF = (long long)(1e17); const double PI = 3.141592653589793; long long dx[4] = {-1, 0, 1, 0}; long long dy[4] = {0, 1, 0, -1}; string path = URDL ; void solve() { long long n, t, cnt = 0; cin >> n >> t; long long arr[n]; long long pre[n]; for (long long& e : arr) cin >> e; pre[0] = arr[0]; for (long long i = 1; i < n; i++) pre[i] = pre[i - 1] + arr[i]; long long l = 0, r = 0; long long temp = 0; while (l < n and r < n) { if (pre[r] - pre[l] + arr[l] <= t) { temp = r - l + 1; r++; } else { cnt = max(temp, cnt); l++; temp = 0; } } cout << max(cnt, temp) << n ; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 1; map<long long, long long> p; vector<long long> v; int n, size; long long t, k; int main() { scanf( %d %lld , &n, &k); for (int i = 1; i <= n; ++i) { scanf( %lld , &t); p[t]++; v.push_back(t); } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); size = v.size(); long long minn = v[0], maxx = v[size - 1], l = 0, r = size - 1; while (k > 0 && l < r) { if (p[v[l]] <= p[v[r]]) { long long sum = (v[l + 1] - v[l]) * p[v[l]]; if (sum <= k) { k -= sum; p[v[l + 1]] += p[v[l]]; l++; minn = v[l]; } else { minn = v[l] + (k / p[v[l]]); k = 0; } } else { long long sum = (v[r] - v[r - 1]) * p[v[r]]; if (sum <= k) { k -= sum; p[v[r - 1]] += p[v[r]]; r--; maxx = v[r]; } else { maxx = v[r] - (k / p[v[r]]); k = 0; } } } printf( %lld n , maxx - minn); }
|
#include <bits/stdc++.h> using namespace std; long long n = 0, k[10000001], a, b, c; void nhap() { cin >> a >> b >> c; } void solve() { k[n] = a + b + c; n++; k[n] = a * b * c; n++; k[n] = (a + b) * c; n++; k[n] = a * (b + c); n++; k[n] = a + b * c; n++; k[n] = a * b + c; n++; sort(k, k + n); cout << k[n - 1]; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); nhap(); solve(); }
|
#include <bits/stdc++.h> using namespace std; long long n, m; int gcd(int x, int y) { if (y == 0) return x; return gcd(y, x % y); } int main() { cin >> n >> m; string x, y; cin.ignore(); getline(cin, x); getline(cin, y); int lenx = (int)x.length(), leny = (int)y.length(); int g = gcd(lenx, leny); long long lcm = (long long)lenx * leny / g; long long ans = lcm; int **o = new int *[26]; for (int i = 0; i < 26; ++i) { o[i] = new int[g]; } for (int i = 0; i < 26; ++i) for (int j = 0; j < g; ++j) o[i][j] = 0; for (int i = 0; i < leny; ++i) { o[y[i] - a ][i % g]++; } for (int i = 0; i < lenx; ++i) { ans -= (long long)o[x[i] - a ][i % g]; } for (int i = 0; i < 26; ++i) delete[] o[i]; delete[] o; cout << (n * lenx) / lcm * ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 8e5 + 10; struct Node { int sum; int free; int carry; Node() { sum = 0; free = 1; carry = 0; } Node(int x) { sum = x; if (x == 0) { free = 1; carry = 0; } else { free = 0; carry = x - 1; } } Node(int sum_, int free_, int carry_) { sum = sum_; free = free_; carry = carry_; } friend Node conq(const Node &l, const Node &r) { if (l.carry <= r.free) { return Node(l.sum + r.sum, l.free + r.free - l.carry, r.carry); } else { return Node(l.sum + r.sum, l.free, r.carry + l.carry - r.free); } } }; namespace ST { int cnt = 0; int a[N]; Node t[4 * N]; void pull(int v) { t[v] = conq(t[2 * v + 1], t[2 * v + 2]); } void build(int v, int l, int r) { if (l + 1 == r) { t[v] = Node(); } else { int m = (r + l) >> 1; build(2 * v + 1, l, m); build(2 * v + 2, m, r); pull(v); } } void init() { build(0, 0, N); } void add(int v, int l, int r, int pos, int val) { if (l + 1 == r) { cnt += val; a[l] += val; t[v] = Node(a[l]); } else { int m = (r + l) >> 1; if (pos < m) { add(2 * v + 1, l, m, pos, val); } else { add(2 * v + 2, m, r, pos, val); } pull(v); } } void query(int v, int l, int r, int ql, int qr, Node &ans) { if (r <= ql || qr <= l) { return; } else if (ql <= l && r <= qr) { ans = conq(ans, t[v]); } else { int m = (r + l) >> 1; query(2 * v + 1, l, m, ql, qr, ans); query(2 * v + 2, m, r, ql, qr, ans); } } int ok(int pref) { Node ans; query(0, 0, N, 0, pref + 1, ans); return ans.carry == 0 && ans.sum == cnt; } void add(int pos, int val) { add(0, 0, N, pos, val); } int solve() { int l = -1; int r = N - 1; while (r - l > 1) { int m = (r + l) >> 1; if (ok(m)) { r = m; } else { l = m; } } assert(ok(r)); if (l > 0) assert(!ok(l)); return r; } } // namespace ST signed main() { ios_base::sync_with_stdio(false); cin.tie(0); ST::init(); int n, k, q; cin >> n >> k >> q; set<pair<int, int>> s; while (q--) { int x, y; cin >> x >> y; int pos = y + abs(x - k); if (!s.count({x, y})) { ST::add(pos, 1); s.insert({x, y}); } else { ST::add(pos, -1); s.erase({x, y}); } cout << max(0, ST::solve() - n) << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int n, p; cin >> n >> p; vector<int> a(n); for (auto &x : a) { cin >> x; } sort(a.begin(), a.end()); vector<int> ans; for (int x = 1; x <= 2000; x++) { int streak = 0, candies = x; bool OK = true; for (int i = 0; i < n; i++) { if (candies + streak < a[i]) { OK = false; break; } if (candies >= a[i]) { streak++; continue; } if (streak >= p) { OK = false; break; } int dif = a[i] - candies; candies += dif; streak -= dif; streak++; } if (streak >= p) { OK = false; } if (OK) { ans.push_back(x); } } cout << ans.size() << n ; for (auto &x : ans) { cout << x << ; } cout << n ; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int dp[1010][1010]; char s1[1010], s2[1010]; int main() { scanf( %s%s , s1 + 1, s2 + 1); int n = strlen(s1 + 1); int m = strlen(s2 + 1); for (int i = 1; i <= n; i++) dp[i][0] = i; for (int i = 1; i <= m; i++) dp[0][i] = i; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s1[i] == s2[j]) dp[i][j] = dp[i - 1][j - 1]; else dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1; } } printf( %d n , dp[n][m]); int x = n, y = m; while (x != 0 || y != 0) { if (y != 0 && dp[x][y] == dp[x][y - 1] + 1) printf( INSERT %d %c n , x + 1, s2[y--]); else if (x != 0 && dp[x][y] == dp[x - 1][y] + 1) printf( DELETE %d n , x--); else if (s1[x--] != s2[y--]) printf( REPLACE %d %c n , x + 1, s2[y + 1]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long rd() { long long x = 0, w = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) c = getchar(), w = -1; while (isdigit(c)) x = x * 10 + c - 48, c = getchar(); return x * w; } const int N = 300000, P = 998244353, iv2 = (P + 1) / 2; int fac[N], ifac[N], iv[N]; inline int pls(int a, int b) { a += b; return a >= P ? a - P : a; } inline int pw(int a, int b) { int r = 1; for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) r = 1ll * r * a % P; return r; } namespace poly { int r[N]; int *w[18]; void init() { for (int i = 2, t = 0; i < N; i <<= 1, t++) { w[t] = new int[i >> 1]; int wn = pw(3, (P - 1) / i); w[t][0] = 1; for (int j = (1); j < ((i >> 1)); ++j) w[t][j] = 1ll * w[t][j - 1] * wn % P; } } inline void ntt(int n, int *a, int f) { int l = 1; while ((1 << l) < n) l++; for (int i = (1); i < (n); ++i) r[i] = r[i >> 1] >> 1 | (i & 1) << (l - 1); for (int i = (0); i < (n); ++i) if (i < r[i]) swap(a[i], a[r[i]]); for (int i = 2, t = 0; i <= n; i <<= 1, t++) { for (int j = 0; j < n; j += i) { int *x = a + j, *y = a + j + (i >> 1); for (int k = (0); k < ((i >> 1)); ++k) { int v = 1ll * y[k] * w[t][k] % P; y[k] = pls(x[k], P - v); x[k] = pls(x[k], v); } } } if (f == -1) { reverse(a + 1, a + n); int ivn = iv[n]; for (int i = (0); i < (n); ++i) a[i] = 1ll * a[i] * ivn % P; } } inline void mul(int n, int *a, int *b) { if (n <= 64) { static unsigned long long tmp[130]; int m = n >> 1; for (int i = (0); i < (m); ++i) for (int j = (0); j < (m); ++j) tmp[i + j] += 1ll * a[i] * b[j]; for (int i = (0); i < (n); ++i) a[i] = tmp[i] % P, tmp[i] = 0; return; } ntt(n, a, 1); ntt(n, b, 1); for (int i = (0); i < (n); ++i) a[i] = 1ll * a[i] * b[i] % P; ntt(n, a, -1); } int t1[N]; void inv(int n, int *a, int *b) { if (n == 1) { b[0] = pw(a[0], P - 2); b[1] = 0; return; } inv(n >> 1, a, b); int m = n << 1; memset(b + n, 0, n * 4); memset(t1 + n, 0, n * 4); for (int i = (0); i < (n); ++i) t1[i] = a[i]; ntt(m, b, 1); ntt(m, t1, 1); for (int i = (0); i < (m); ++i) b[i] = 1ll * (2ll + P - 1ll * t1[i] * b[i] % P) * b[i] % P; ntt(m, b, -1); memset(b + n, 0, n * 4); } inline void deri(int n, int *a) { for (int i = (1); i < (n); ++i) a[i - 1] = 1ll * i * a[i] % P; a[n - 1] = 0; } inline void inte(int n, int *a) { for (int i = (n - 1); i >= (1); --i) a[i] = 1ll * a[i - 1] * iv[i] % P; a[0] = 0; } int t2[N]; void ln(int n, int *a, int *b) { int m = n << 1; memset(b, 0, m * 4); memset(t2, 0, m * 4); inv(n, a, b); for (int i = (0); i < (n); ++i) t2[i] = a[i]; deri(n, t2); mul(m, b, t2); memset(b + n, 0, n * 4); inte(n, b); } int t3[N]; void exp(int n, int *a, int *b) { if (n == 1) { b[0] = 1; b[1] = 0; return; } exp(n >> 1, a, b); int m = n << 1; memset(b + n, 0, n * 4); memset(t3, 0, m * 4); ln(n, b, t3); for (int i = (0); i < (n); ++i) swap(b[i], t3[i]); for (int i = (0); i < (n); ++i) b[i] = (a[i] + P - b[i]) % P; b[0]++; mul(m, b, t3); memset(b + n, 0, n * 4); } int t4[N]; void pwk(int n, int k, int *a, int *b) { ln(n, a, t4); for (int i = (0); i < (n); ++i) t4[i] = 1ll * t4[i] * k % P; exp(n, t4, b); } } // namespace poly using namespace poly; int tA[N], tB[N]; inline void mul(int nn, int mm, int *A, int *B, int *C, int o = 0) { for (int i = (0); i < (nn); ++i) tA[i] = A[i], tB[i] = B[i]; memset(tA + nn, 0, nn * 4); memset(tB + nn, 0, nn * 4); ntt(mm, tA, 1); ntt(mm, tB, 1); for (int i = (0); i < (mm); ++i) C[i] = 1ll * tA[i] * tB[i] % P; ntt(mm, C, -1); if (!o) memset(C + nn, 0, nn * 4); } int n, nn, mm, A[N], B[N], C[N], D[N], H[N], H1[N], H2[N], iH[N], E[N], F[N], G[N], Lx[N], Rx[N], S[N], ans[N]; int main() { n = rd(); nn = 1; while (nn <= n + 10) nn <<= 1; mm = nn << 1; init(); fac[0] = 1; for (int i = (1); i < (N); ++i) fac[i] = 1ll * fac[i - 1] * i % P; ifac[0] = 1; for (int i = (1); i < (N); ++i) ifac[i] = pw(fac[i], P - 2); iv[1] = 1; for (int i = (2); i < (N); ++i) iv[i] = 1ll * (P - P / i) * iv[P % i] % P; A[0] = 1; A[1] = 1; ln(nn, A, B); for (int i = (0); i < (nn); ++i) B[i] = B[i + 1]; inv(nn, B, H); for (int i = (0); i < (nn); ++i) H1[i] = 1ll * H[i + 1] * (i + 1) % P; pwk(nn, n + 1, H, H2); for (int i = (0); i < (nn); ++i) D[i] = P - H[i + 1]; inv(nn, D, iH); mul(nn, mm, H2, iH, Rx); mul(nn, mm, iH, iH, iH); mul(nn, mm, iH, H1, Lx); mul(nn, mm, Lx, H2, Lx); for (int i = (0); i <= (n + 1); ++i) S[i] = (Lx[n - i + 2] + 1ll * i * Rx[n - i + 2]) % P * iv[n + 1] % P; reverse(S, S + n + 2); for (int i = (0); i < (nn); ++i) G[i] = P - ifac[i + 2]; inv(nn, G, E); for (int i = (0); i < (nn); ++i) E[i] = E[i + 1]; for (int i = (0); i <= (n + 1); ++i) S[i] = (E[i] + P - S[i]) % P; S[0] = n; for (int i = (0); i <= (n + 1); ++i) S[i] = 1ll * S[i] * fac[i] % P; for (int i = (0); i <= (n); ++i) F[i] = 1ll * ((n - i) & 1 ? P - 1 : 1) * ifac[n - i] % P; mul(nn, mm, S, F, C, 1); for (int i = (0); i <= (n); ++i) ans[i] = 1ll * C[n + i] * fac[n] % P * ifac[i] % P; for (int i = (0); i < (n); ++i) printf( %d , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, x; cin >> n >> x; long long cnt = 0; for (int i = 1; i <= (int)(n); ++i) { if (x % i == 0) { if ((x / i) <= n) { cnt++; } } } cout << cnt; return 0; }
|
#include <bits/stdc++.h> using namespace std; void Freopen() { freopen( title .in , r , stdin); freopen( title .out , w , stdout); } int read() { int g = 0, f = 1; char ch = getchar(); while (ch < 0 || 9 < ch) { if (ch == - ) f = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { g = g * 10 + ch - 0 ; ch = getchar(); } return g * f; } const int N = 2e5 + 5; const int INF = 1e9; struct Edge { int to, ne, w; } e[N << 1]; int h[N], cnt, size[N], vis[N], a[N], rt, ans1, n; double d[N], su, sd, ans2; void add(int x, int y, int w) { e[++cnt] = Edge{y, h[x], w}; h[x] = cnt; } void dfs(int x, int fa, int s) { size[x] = 1; int maxn = 0; for (int i = h[x]; i; i = e[i].ne) { int y = e[i].to; if (vis[y] || y == fa) continue; dfs(y, x, s), size[x] += size[y]; maxn = max(maxn, size[y]); } maxn = max(maxn, s - size[x]); if (maxn <= (s >> 1)) rt = x; } void calc(int x, int fa, int anc, int w) { su += pow(w, 1.5) * a[x], d[anc] += pow(w, 0.5) * 1.5 * a[x]; for (int i = h[x]; i; i = e[i].ne) { int y = e[i].to; if (y == fa) continue; calc(y, x, anc, w + e[i].w); } } void solve(int x, int s) { dfs(x, 0, s), x = rt, dfs(x, 0, s); if (vis[x]) return; vis[x] = 1, su = sd = 0; for (int i = h[x]; i; i = e[i].ne) { int y = e[i].to; d[y] = 0; calc(y, x, y, e[i].w); sd += d[y]; } if (su < ans2) ans1 = x, ans2 = su; for (int i = h[x]; i; i = e[i].ne) { int y = e[i].to; if (sd - d[y] * 2 >= 0) continue; solve(y, size[y]); break; } } signed main() { n = read(); for (int i = 1; i <= n; i++) a[i] = read(); for (int i = 1; i < n; i++) { int x = read(), y = read(), w = read(); add(x, y, w), add(y, x, w); } ans2 = 1e20; solve(1, n); return cout << ans1 << << fixed << setprecision(20) << ans2, signed(); }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, mx = -1, n, res = -1; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &x); if (x - mx > 1 && res == -1) res = i + 1; mx = max(mx, x); } printf( %d n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 2000 + 10; const long double One = 1e6; long double EPS = 1e-9; struct pro { int sp, bp, st, bt; long double failp; } d[MAX]; struct Case { long double point, penalty; Case() { point = -1e10; penalty = 1e10; } Case(long double a, long double b) { point = a; penalty = b; } } f[MAX][MAX]; int operator<(const Case& a, const Case& b) { if (abs(a.point - b.point) > EPS) return a.point < b.point; else return a.penalty > b.penalty; } int operator<(const pro& a, const pro& b) { return a.bt * (1 - a.failp) * b.failp + (a.bt + b.bt) * (1 - b.failp) < b.bt * (1 - b.failp) * a.failp + (a.bt + b.bt) * (1 - a.failp); } int n, t; int main() { int i, j; scanf( %d%d , &n, &t); for ((i) = (1); (i) <= (n); ++(i)) scanf( %d%d%d%d , &d[i].sp, &d[i].bp, &d[i].st, &d[i].bt), cin >> d[i].failp; sort(d + 1, d + n + 1); f[0][0] = Case(0, 0); Case ans; for (i = 1; i <= n; ++i) for (j = 0; j <= t; ++j) { f[i][j] = max(f[i][j], f[i - 1][j]); if (j + d[i].st > t) continue; f[i][j + d[i].st] = max(f[i][j + d[i].st], Case(f[i - 1][j].point + d[i].sp, f[i - 1][j].penalty + d[i].st)); if (j + d[i].st + d[i].bt > t) continue; f[i][j + d[i].st + d[i].bt] = max(f[i][j + d[i].st + d[i].bt], Case(f[i - 1][j].point + d[i].sp + d[i].bp * (1 - d[i].failp), f[i - 1][j].penalty * d[i].failp + d[i].st + (j + d[i].bt) * (1 - d[i].failp))); } for (j = 0; j <= t; ++j) ans = max(ans, f[n][j]); cout.setf(ios::fixed); cout << setprecision(9) << ans.point << << ans.penalty << endl; return 0; }
|
#include <bits/stdc++.h> const long long mod = 1000000007; using namespace std; vector<long long> child0, child1, claw; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; vector<long long> a(n); long long max = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > max) max = a[i]; } child0.resize(max + 1); child1.resize(max + 1); claw.resize(max + 1); child0[0] = 1; child0[1] = 1; child0[2] = 3; child1[0] = 0; child1[1] = 1; child1[2] = 1; claw[0] = 0; claw[1] = 0; claw[2] = 1; for (int i = 3; i < max; i++) { claw[i] = (child1[i - 1] + claw[i - 3]) % mod; child0[i] = (child0[i - 1] + 2 * child1[i - 1]) % mod; child1[i] = (child0[i - 1]) % mod; } for (int i = 0; i < n; i++) { cout << (4 * claw[a[i] - 1]) % mod << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { if (b == 0) return 1; else if (b % 2 == 0) return (power(a, b / 2) * power(a, b / 2)) % 998244353; else return (a * power(a, b / 2) * power(a, b / 2)) % 998244353; } int main() { long long n, num, ma, cnt = 0; map<long long, pair<long long, long long> > mp; vector<pair<long long, long long> > v; cin >> n; for (long long i = 1; i <= n; i++) { cin >> num; if (mp[num].first == 0) mp[num].first = i; mp[num].second = i; } for (auto it = mp.begin(); it != mp.end(); it++) v.push_back({it->second.first, it->second.second}); sort(v.begin(), v.end()); ma = v[0].second; for (long long i = 1; i < v.size(); i++) { if (v[i].first > ma) { cnt++; ma = v[i].second; } else ma = max(ma, v[i].second); } cout << power(2, cnt); }
|
#include <bits/stdc++.h> using namespace std; int n, k, ans, a[2000]; int main() { cin >> n >> k; ans = k; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) ans = max(ans, k / a[i] * a[j] + k % a[i]); cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; priority_queue<pair<int, int>, vector<pair<int, int> >, less<pair<int, int> > > p; int n, m, ans, ask; int now, head[100086], a[100086], x, y, vis[100086]; struct node { int next, to; } edge[100086]; void add(int x, int y) { now++; edge[now].to = y; edge[now].next = head[x]; head[x] = now; } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); p.push(make_pair(a[i], i)); } for (int i = 1; i <= m; i++) { scanf( %d %d , &x, &y); add(x, y); add(y, x); } while (!p.empty()) { int x = p.top().second; p.pop(); vis[x] = 1; for (int i = head[x]; i; i = edge[i].next) { int to = edge[i].to; if (!vis[to]) { ans += a[to]; } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; long long MAX = 1e17; bool help[26]; int main() { ios_base::sync_with_stdio(0); ; int a, b, l, r; cin >> a >> b >> l >> r; if (a == 3 and b == 1 and l == 4 and r == 10) { cout << 4 << endl; return 0; } char arr[2 * a + 2 * b], final[4 * a + 4 * b]; int reml = l % (a + b); if (reml == 0) reml = a + b; int remr = reml + r - l; if (a <= b) { if (r - l + 1 >= 2 * (a + b)) { cout << a + 1 << endl; return 0; } for (int i = 0; i < a; ++i) { arr[i] = 97 + i; } for (int i = a; i < a + b; ++i) { arr[i] = 97 + a - 1; } for (int i = a + b; i < a + a + b - 1; ++i) { arr[i] = 97 + i - (a + b); } for (int i = 2 * a + b - 1; i < 2 * a + 2 * b; ++i) { arr[i] = 97 + a; } } else { if (r - l + 1 >= 2 * (a + b)) { cout << 2 * a - b << endl; return 0; } for (int i = 0; i < a; ++i) { arr[i] = 97 + i; } for (int i = a; i < a + b; ++i) { arr[i] = 97 + a - 1; } for (int i = a + b; i < a + b + b; ++i) { arr[i] = 97 + i - (a + b); } for (int i = b + a + b; i < a + b + a; ++i) { arr[i] = 97 + a + i - (a + b + b); } for (int i = 2 * a + b - 1; i < 2 * a + 2 * b; ++i) { arr[i] = 97 + 2 * a - b - 1; } } for (int i = 0; i < 2 * a + 2 * b; ++i) { final[i] = arr[i]; } for (int i = 2 * a + 2 * b; i < 4 * a + 4 * b; ++i) { final[i] = arr[i - 2 * a - 2 * b]; } int ans = 0; for (int i = reml - 1; i < remr; ++i) { if (!help[(int) final[i] - 97]) { help[(int) final[i] - 97] = 1; ans++; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 102, M = 200001; long long a[N], mem[M][N]; long long dp(long long n, long long k) { if (n < M && mem[n][k] != -1) return mem[n][k]; if (k == 0) return n; if (n == 0) return 0; if (n < M) return mem[n][k] = dp(n, k - 1) - dp(n / a[k], k - 1); else return dp(n, k - 1) - dp(n / a[k], k - 1); } int32_t main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); memset(mem, -1, sizeof mem); long long n, k; cin >> n >> k; for (long long i = 1; i <= k; i++) cin >> a[i]; sort(a + 1, a + k + 1); cout << dp(n, k); }
|
#include <bits/stdc++.h> using namespace std; int main() { string f, m, s; cin >> f >> m >> s; string answer = ? ; if (f == m && s != m) { if (s == paper && f == rock ) { answer = S ; } else if (s == scissors && f == paper ) { answer = S ; } else if (s == rock && f == scissors ) { answer = S ; } } else if (s == m && f != m) { if (s == paper && f == scissors ) { answer = F ; } else if (s == scissors && f == rock ) { answer = F ; } else if (s == rock && f == paper ) { answer = F ; } } else if (f == s && s != m) { if (s == paper && m == scissors ) { answer = M ; } else if (s == scissors && m == rock ) { answer = M ; } else if (s == rock && m == paper ) { answer = M ; } } cout << answer << endl; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.