func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; long long arr[500005]; map<long long, int> mm; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &arr[i]); for (int i = 1; i <= n - 1; i++) arr[i] += arr[i - 1]; for (int i = 0; i < n; i++) mm[arr[i]]++; int mx = -1; map<long long, int>::iterator it; for (it = mm.begin(); it != mm.end(); it++) { mx = max(mx, it->second); } printf( %d n , n - mx); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100007; long long i, j, k, n, m, t, x, y, ans; long long pw2[32]; long long a[MAXN]; void calPowerTwo() { long long i, j, k; pw2[0] = 1; for (i = 1; i < 32; i++) { pw2[i] = pw2[i - 1] * 2; } } int main() { calPowerTwo(); while (cin >> n) { for (i = 0; i < n; i++) { cin >> a[i]; } ans = 0; for (i = 0; i < n - 1; i++) { ans += a[i]; k = 0; while (i + pw2[k] < n) { k++; } k--; a[i + pw2[k]] += a[i]; a[i] = 0; cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int dadsadasda; const int INF = 0x3f3f3f3f; const long long LLINF = 1e18; const int MAXN = 3e5; int n; int a[MAXN]; int ans[MAXN]; priority_queue<pair<int, int> > pq; int father[MAXN], siz[MAXN], cnt[MAXN]; void makeSet(int nn, int m) { for (int i = nn; i <= m; ++i) { father[i] = -1; siz[i] = 0; cnt[i] = 1; } } int find(int x) { if (father[x] == -1) return x; return father[x] = find(father[x]); } void unio(int x, int y) { if (siz[x] > siz[y]) { father[y] = x; cnt[x] += cnt[y]; } else { father[x] = y; cnt[y] += cnt[x]; if (siz[x] == siz[y]) siz[y]++; } } bool active[MAXN]; int main() { dadsadasda = scanf( %d , &n); for (int i = 0; i < n; i++) { dadsadasda = scanf( %d , &a[i]); pq.push({a[i], i}); } makeSet(0, n - 1); while (!pq.empty()) { auto p = pq.top(); pq.pop(); active[p.second] = true; if (p.second > 0 && find(p.second) != find(p.second - 1) && active[p.second - 1]) unio(find(p.second), find(p.second - 1)); if (p.second < n - 1 && find(p.second) != find(p.second + 1) && active[p.second + 1]) unio(find(p.second), find(p.second + 1)); int sz = cnt[find(p.second)]; ans[sz] = max(ans[sz], p.first); } for (int i = n - 1; i >= 1; i--) { ans[i] = max(ans[i], ans[i + 1]); } for (int i = 1; i < n + 1; i++) { printf( %d , ans[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> double const MOD = 1000000007; double const N = 1000005; double const LN = 20; double const inf = 1e18 + 5; using namespace std; double a, b; void mirror(double &x, double &z) { if (x < 0) { x = -x; return; } if (z < 0) { z = -z; return; } if (x > a) { x = 2 * a - x; return; } if (z > b) { z = 2 * b - z; return; } } int main() { double m; double vx, vy, vz; cin >> a >> b >> m; cin >> vx >> vy >> vz; double ok = abs(m / vy); double x = a / 2 + ok * vx; double z = 0 + vz * ok; while (1) { if (x >= 0 && x <= a && z >= 0 && z <= b) break; mirror(x, z); } printf( %.10f %.10f n , x, z); return 0; } |
#include <bits/stdc++.h> using namespace std; long long ara[100010]; int segtree[20][100010 * 4]; int lazy[20][100010 * 4]; void build(int node, int l, int r, int po) { if (l == r) { segtree[po][node] = 0; if ((ara[l] & (1 << po))) { segtree[po][node] = 1; } return; } int mid = (l + r) >> 1; int left = node << 1; int right = left | 1; build(left, l, mid, po); build(right, mid + 1, r, po); segtree[po][node] = segtree[po][left] + segtree[po][right]; return; } int query(int node, int l, int r, int ql, int qr, int po) { if (lazy[po][node]) { segtree[po][node] = (r - l + 1) - segtree[po][node]; if (l != r) { lazy[po][(node << 1)] ^= 1; lazy[po][1 + (node << 1)] ^= 1; } lazy[po][node] = 0; } if (l >= ql && qr >= r) { return segtree[po][node]; } if (l > qr || ql > r) return 0; int mid = (l + r) >> 1; int left = node << 1; int right = left | 1; int p = query(left, l, mid, ql, qr, po); int q = query(right, mid + 1, r, ql, qr, po); return p + q; } void update(int node, int l, int r, int ql, int qr, int po) { if (lazy[po][node]) { segtree[po][node] = (r - l + 1) - segtree[po][node]; if (l != r) { lazy[po][node << 1] ^= 1; lazy[po][1 + (node << 1)] ^= 1; } lazy[po][node] = 0; } if (l >= ql && qr >= r) { segtree[po][node] = (r - l + 1) - segtree[po][node]; if (l != r) { lazy[po][node << 1] ^= 1; lazy[po][1 + (node << 1)] ^= 1; } lazy[po][node] = 0; return; } if (l > qr || r < ql) return; int mid = (l + r) >> 1; int left = node << 1; int right = left | 1; update(left, l, mid, ql, qr, po); update(right, mid + 1, r, ql, qr, po); segtree[po][node] = segtree[po][left] + segtree[po][right]; return; } int main() { long long n; scanf( %lld , &n); for (int i = 1; i <= n; i++) { scanf( %lld , &ara[i]); } for (int i = 0; i < 20; i++) { build(1, 1, n, i); } long long m; scanf( %lld , &m); while (m--) { long long x; scanf( %lld , &x); if (x == 1) { long long a, b; scanf( %lld%lld , &a, &b); long long sum = 0; for (int i = 0; i < 20; i++) { int y = query(1, 1, n, a, b, i); sum += y * (1LL << i); } printf( %lld n , sum); } else { long long a, b, c; scanf( %lld%lld , &a, &b); scanf( %lld , &c); for (int i = 0; i < 20; i++) { if (c & (1 << i)) { update(1, 1, n, a, b, i); } } } } } |
#include <bits/stdc++.h> using namespace std; int main() { int t, a; cin >> t; while (t--) { cin >> a; cout << a / 2 << endl; } } |
#include <bits/stdc++.h> using namespace std; struct road { int x, next; double dis; } r[305 * 305 * 2]; int N, M; int st[305], w; int vis[305]; double P[305]; double l1 = -1, r1 = 0, mid; double dis[305]; void add(int x, int y, double dis) { r[++w].x = y, r[w].next = st[x]; r[w].dis = dis; st[x] = w; } bool work(int x) { int i, j, tmp; if (vis[x]) return true; vis[x] = 1; for (i = st[x]; i; i = r[i].next) { tmp = r[i].x; if (dis[tmp] > dis[x] + r[i].dis - mid) { dis[tmp] = dis[x] + r[i].dis - mid; if (work(tmp)) return true; } } vis[x] = 0; return false; } int main() { int i, j; int fr, to; scanf( %d , &N); for (i = 0; i <= N; i++) scanf( %lf , &P[i]); M = N * 3; for (i = 0; i <= M; i++) for (j = N, fr = i; j >= -N; j -= 2) { to = fr + j; if (to > M || to < 0) continue; add(fr, to, -P[(N - j) / 2]); } for (i = 1; i <= 21; i++) { mid = (l1 + r1) / 2; for (j = 1; j <= 20; j++) { memset(dis, 63, sizeof(dis)); memset(vis, 0, sizeof(vis)); fr = rand() % M + 1, dis[fr] = 0; if (work(fr)) break; } if (j <= 9) r1 = mid; else l1 = mid; } printf( %.8lf n , -mid); return 0; } |
#include <bits/stdc++.h> char map[1005][1005]; int main() { int n, m; scanf( %d %d , &n, &m); for (int r = 0; r < n; r++) scanf( %s , map[r]); int row[1005] = {0}; int col[1005] = {0}; for (int r = 0; r < n; r++) { int count = 0; for (int c = 0; c < m; c++) if (map[r][c] == * ) count++; row[r] = count; } for (int c = 0; c < m; c++) { int count = 0; for (int r = 0; r < n; r++) if (map[r][c] == * ) count++; col[c] = count; } long long answer = 0; for (int r = 0; r < n; r++) for (int c = 0; c < m; c++) if (map[r][c] == * ) answer += (row[r] - 1) * (col[c] - 1); printf( %I64d n , answer); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 20; const int mod = 1e9 + 7; long double a[N]; int n, k; long double dp[1 << N], out[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; int zeros = 0; for (int i = 0; i < n; i++) cin >> a[i], zeros += fabs(a[i] < (1e-7)); k = min(k, n - zeros); dp[0] = 1.0; for (int i = 0; i < 1 << n; i++) { double tmp = 1.0; for (int j = 0; j < n; j++) if (i >> j & 1) tmp -= a[j]; if (__builtin_popcount(i) == k) for (int j = 0; j < n; j++) if (i >> j & 1) out[j] += dp[i]; if (tmp == 0.0) continue; cout << fixed << setprecision(6); for (int j = 0; j < n; j++) if (!(i >> j & 1)) dp[i | 1 << j] += a[j] * dp[i] / tmp; } for (int i = 0; i < n; i++) cout << out[i] << ; return 0; } |
#include <bits/stdc++.h> const long long N = 1000000; using namespace std; long long n, k, l, i = 0, j, mn, mx = N, ans = 0, als, r1, r2, r3, t, q, v, m, ii, r4; string d1, d3, d2, s; char kl, km, mk, lk; double fg; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n; bool a[N]; for (i = 0; i < n * 2; i++) { cin >> t; a[t - 1] = !a[t - 1]; m += a[t - 1] * 2 - 1; ans = max(ans, m); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; long long r1, r2, r3, d; cin >> n >> r1 >> r2 >> r3 >> d; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<vector<long long>> dp(n, vector<long long>(2, LLONG_MAX)); dp[0][0] = r1 * a[0] + r3; dp[0][1] = min(r1 * (a[0] + 2), r2 + r1); for (int i = 1; i < n; i++) { long long one = r1 * a[i] + r3; long long two = min(r1 * (a[i] + 2), r2 + r1); dp[i][0] = min(dp[i][0], dp[i - 1][0] + one); dp[i][0] = min(dp[i][0], dp[i - 1][1] + min(one, two) + 2 * d); if (i == n - 1) dp[i][0] = min(dp[i][0], dp[i - 1][1] + one + d); dp[i][1] = min(dp[i][1], dp[i - 1][0] + two); } printf( %lld n , min(dp[n - 1][0], dp[n - 1][1] + 2 * d) + (n - 1) * d); return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; const long long MOD = 1000000007; vector<vector<long long> > matrix_mul(vector<vector<long long> > a, vector<vector<long long> > b) { vector<vector<long long> > c(a.size(), vector<long long>(b[0].size())); for (int i = 0; i < a.size(); i++) for (int j = 0; j < b[0].size(); j++) for (int k = 0; k < b.size(); k++) { c[i][j] += (a[i][k] * b[k][j]) % MOD; c[i][j] %= MOD; } return c; } vector<vector<long long> > matrix_pow(vector<vector<long long> > a, long long p) { if (p == 1) return a; if (p % 2 == 1) return matrix_mul(a, matrix_pow(a, p - 1)); vector<vector<long long> > c = matrix_pow(a, p / 2); return matrix_mul(c, c); } int N, B, K, X; long long occ[10]; int main() { cin >> N >> B >> K >> X; for (int i = 0; i < N; i++) { int d; cin >> d; occ[d]++; } vector<long long> f(X); f[0] = 1; vector<vector<long long> > T(X); for (int i = 0; i < X; i++) { T[i] = vector<long long>(X); } for (int i = 0; i < X; i++) { for (int d = 1; d <= 9; d++) if (occ[d]) { int a = (i * 10 + d) % X; T[a][i] += occ[d]; } } T = matrix_pow(T, B); long long res = 0; res = (T[K][0] * f[0] % MOD) % MOD; cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double eps = 1e-6; vector<int> g[maxn]; vector<int> tree[maxn]; int deep[maxn], son[maxn]; int cnt, mx; void dfs(int x, int y) { int sz = g[x].size(); deep[x] = 0; son[x] = -1; for (int i = 0; i < sz; ++i) { int to = g[x][i]; if (to == y) { continue; } tree[x].push_back(to); dfs(to, x); if (son[x] == -1 || deep[son[x]] < deep[to]) { son[x] = son[to]; } } if (son[x] == -1) { son[x] = x; } else { deep[x] = deep[son[x]] + 1; } } struct node { int id, w; bool operator<(const node& rhs) const { return w > rhs.w; } } nd[maxn]; int solve(int x) { int sz = tree[x].size(); for (int i = 0; i < sz; ++i) { nd[i] = {tree[x][i], deep[tree[x][i]]}; } sort(nd, nd + sz); int hf = sz / 2; for (int i = 0; i < hf; ++i) { int a = nd[i * 2].id, b = nd[i * 2 + 1].id; ++cnt; printf( ? %d %d n , son[a], son[b]); fflush(stdout); int c; scanf( %d , &c); if (c != x) { return solve(c); } if (cnt >= mx) break; } if ((sz & 1) == 1 && cnt < mx) { ++cnt; printf( ? %d %d n , x, son[nd[sz - 1].id]); fflush(stdout); int c; scanf( %d , &c); if (c != x) { return solve(c); } } return x; } int main() { int n; scanf( %d , &n); cnt = 0, mx = n / 2; for (int i = 1; i < n; ++i) { int u, v; scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } dfs(1, -1); printf( ! %d n , solve(1)); fflush(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; int N; int main() { cin >> N; int dec[2 * N]; int all_round_down = 0; int z = 0; for (int i = 0; i < 2 * N; i++) { double x; cin >> x; dec[i] = int((x + 0.0005 - int(x + 0.0005)) * 1000); all_round_down += dec[i]; if (dec[i] == 0) z++; } int mi = max(0, N - z); int ma = min(N, 2 * N - z); int best = (all_round_down + 500) / 1000; int ans; if (best >= mi && best <= ma) ans = abs(all_round_down - 1000 * best); else ans = min(abs(all_round_down - 1000 * mi), abs(all_round_down - 1000 * ma)); cout << ans / 1000 << . << (ans % 1000) / 100 << (ans % 100) / 10 << ans % 10; } |
#include <bits/stdc++.h> using namespace std; int n; vector<int> edge[(1 << 18)]; int degree[(1 << 18)]; int DelNode; int DFS(int iDeep, int iNode, int iParent) { int iSons = edge[iNode].size(); if (iParent) iSons--; if (iDeep > n) return -1; if (iSons > 3) return -1; if (iSons == 0) return 1; if (iSons & 1) { if (DelNode) return -1; DelNode = iNode; vector<int> RetList; for (auto Iter : edge[iNode]) { if (Iter == iParent) continue; int iRet = DFS(iDeep + 1, Iter, iNode); if (-1 == iRet) return iRet; RetList.push_back(iRet); } sort(RetList.begin(), RetList.end()); if (iSons == 1) { if (RetList[0] != 1) return -1; return RetList[0] + 1; } else { if (RetList[0] != RetList[1] || RetList[0] + 1 != RetList[2]) return -1; return RetList[2] + 1; } } else { assert(iSons == 2); int iDeepToButtom = -1; for (auto Iter : edge[iNode]) { if (Iter == iParent) continue; int iRet = DFS(iDeep + 1, Iter, iNode); if (-1 == iRet) return iRet; if (iDeepToButtom == -1) iDeepToButtom = iRet; else if (iDeepToButtom != iRet) return -1; } return iDeepToButtom + 1; } } int main() { scanf( %d , &n); int k = (1 << n) - 2; for (int i = 0; i < k - 1; ++i) { int u, v; scanf( %d %d , &u, &v); edge[u].push_back(v); edge[v].push_back(u); degree[u]++; degree[v]++; } vector<int> list; for (int i = 1; i <= k; ++i) if (degree[i] == 1) { list.push_back(i); } for (int i = 0; i < list.size(); ++i) { int iCur = list[i]; for (auto Iter : edge[iCur]) { if (--degree[Iter] == 1) list.push_back(Iter); } } assert(list.size() == k); int i = 0; vector<int> result; for (auto Iter = list.rbegin(); i < 5 && Iter != list.rend(); Iter++, i++) { DelNode = 0; if (DFS(1, *Iter, 0) != -1) { assert(DelNode); result.push_back(DelNode); } } sort(result.begin(), result.end()); result.resize(unique(result.begin(), result.end()) - result.begin()); printf( %d n , result.size()); for (int i = 0; i < result.size(); ++i) { if (i) putchar( ); printf( %d , result[i]); } putchar( n ); } |
#include <bits/stdc++.h> using namespace std; long long n, sz, i, ans, j, a[200001], t[531172], op; void upd(int x) { for (j = x / 2; j >= 1; j /= 2) t[j] = max(t[j * 2], t[j * 2 + 1]); } long long finds(int l, int r) { long long sum = -1; while (l <= r) { if (l % 2 == 1) sum = max(sum, t[l]); if (r % 2 == 0) sum = max(sum, t[r]); l++, r--, l /= 2, r /= 2; } return sum; } int main() { cin >> n; sz = 1; while (sz < n) sz *= 2; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) { t[a[i] + sz - 1] = finds(sz, a[i] + sz - 1) + 1; upd(a[i] + sz - 1); } cout << max(t[1], 1ll); } |
#include <bits/stdc++.h> using namespace std; int read() { register 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 = 10 * x + ch - 0 ; ch = getchar(); } return x * f; } const int Size = 100005; int n, top; struct vec { double x, y; } w[Size], a[Size], O, stk[Size]; inline vec operator-(vec a, vec b) { return (vec){a.x - b.x, a.y - b.y}; } inline vec operator+(vec a, vec b) { return (vec){a.x + b.x, a.y + b.y}; } inline bool operator<(vec a, vec b) { if (a.x != b.x) return a.x < b.x; return a.y < b.y; } inline double Xji(vec p, vec q) { return p.x * q.y - p.y * q.x; } inline double dist(vec mhy) { return mhy.x * mhy.x + mhy.y * mhy.y; } inline bool comp(vec jzm, vec xjp) { double tmp = Xji(jzm, xjp); if (fabs(tmp) > 1e-6) return tmp > 1e-6; return dist(jzm) < dist(xjp); } inline double dist(vec mhy, vec zwt) { return sqrt((mhy.x - zwt.x) * (mhy.x - zwt.x) + (mhy.y - zwt.y) * (mhy.y - zwt.y)); } inline vec rotate(vec a, double rad) { return (vec){a.x * cos(rad) - a.y * sin(rad), a.x * sin(rad) + a.y * cos(rad)}; } int main() { n = read(); for (register int i = 1; i <= n; i++) { double x, y; scanf( %lf %lf , &x, &y); w[i].x = x; w[i].y = y - x * x; } vec O = w[1]; int id = 1; for (register int i = 2; i <= n; i++) { if (w[i] < O) { id = i; O = w[i]; } } swap(w[id], w[1]); for (register int i = 1; i <= n; i++) { a[i] = w[i] - O; } sort(a + 2, a + 1 + n, comp); for (register int i = 1; i <= n; i++) { while (top > 1 && Xji(stk[top] - stk[top - 1], a[i] - stk[top - 1]) <= 0) { top--; } stk[++top] = a[i]; } for (register int i = 1; i <= top; i++) { stk[i] = stk[i] + O; } int ans = 0; for (register int i = 1; i <= top; i++) { int pos = i % top + 1; if (stk[i].x > stk[pos].x) { ans++; } } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long c[55]; struct cmp { bool operator()(long long a, long long b) { return c[a] < c[b]; } }; int main() { long long n, m, k; long long a[55], b[55], ind[55]; long long dp[55][55][105][3]; cin >> n >> m >> k; for (long long i = 0; i < m; ++i) { cin >> a[i] >> b[i] >> c[i]; ind[i] = i; } sort(ind, ind + m, cmp()); if (0) for (long long i = 0; i < m; i++) cout << ind[i] << ; if (0) cout << endl; memset(dp, -1, sizeof(dp)); for (long long i = 0; i < m; i++) { for (long long p = 0; p <= (long long)(b[ind[i]] - a[ind[i]]); p++) { dp[i][1][p][0] = a[ind[i]] + p; dp[i][1][p][1] = i; dp[i][1][p][2] = p; } } long long maxVal, maxInd, maxH; for (long long i = 1; i < m; i++) { for (long long j = 2; j <= min(n, i + 1); j++) { for (long long p = 0; p <= (long long)(b[ind[i]] - a[ind[i]]); p++) { maxVal = -1; maxInd = -1; maxH = -1; long long cur = a[ind[i]] + p, req1 = cur - k, req2 = ((cur % k) ? -1 : (cur / k)); for (long long s = i - 1; s >= 0; s--) { if (c[ind[s]] == c[ind[i]]) continue; if (0) cout << hello << s << << req1 << << req2 << << a[ind[s]] << << b[ind[s]] << << dp[s][j - 1][(long long)(req1 - a[ind[s]])][0] << endl; if (0) cout << MAXVAL << maxVal << endl; if (req1 > 0 && req1 <= b[ind[s]] && req1 >= a[ind[s]]) { if (dp[s][j - 1][(long long)(req1 - a[ind[s]])][0] > maxVal) { maxInd = s; maxVal = dp[s][j - 1][(long long)(req1 - a[ind[s]])][0]; maxH = (req1 - a[ind[s]]); } } if (req2 > 0 && req2 <= b[ind[s]] && req2 >= a[ind[s]]) { if (dp[s][j - 1][(long long)(req2 - a[ind[s]])][0] > maxVal) { maxInd = s; maxVal = dp[s][j - 1][(long long)(req2 - a[ind[s]])][0]; maxH = (req2 - a[ind[s]]); } } } if (0) cout << FUCK << maxVal << << maxH << endl; dp[i][j][p][0] = (maxVal != -1) ? (maxVal + cur) : maxVal; dp[i][j][p][1] = maxInd; dp[i][j][p][2] = maxH; if (0) cout << i << << j << << a[ind[i]] + p << << dp[i][j][p][0] << endl; } } } maxVal = -1; maxInd = -1; maxH = -1; for (long long i = 0; i < m; i++) { for (long long j = 0; j <= (b[ind[i]] - a[ind[i]]); j++) if (maxVal < dp[i][n][j][0]) { maxVal = dp[i][n][j][0]; maxInd = i; maxH = j; } } if (maxVal != -1) { long long j = n; vector<pair<long long, long long> > v; vector<pair<long long, long long> >::iterator it; cout << YES << endl; while (true) { if (0) cout << mind mh << maxInd << << maxH << endl; v.push_back(make_pair(ind[maxInd] + 1, a[ind[maxInd]] + maxH)); long long temp = maxInd; maxInd = dp[temp][j][maxH][1]; maxH = dp[temp][j][maxH][2]; j--; if (j == 0) break; } for (it = --v.end(), j = n; j > 0; it--, j--) { cout << (*it).first << << (*it).second << endl; } } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[1010]; long long b[1010]; long long c[2020]; long long d[1010]; long long mex(long long m) { sort(b, b + m); long long j = 0; long long k = 0; long long ans = m; while (j < m) { if (b[k] > j) { ans = j; break; } else if (b[k] == j) { k++; j++; } else { k++; } } return ans; } long long check(long long m) { long long ct3 = 0; for (long long i = 1; i < m; i++) { if (a[i] < a[i - 1]) { ct3 = 1; break; } } if (ct3 == 1) return 0; else return 1; } int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long ct = 1; long long ct1 = 0; for (long long i = 0; i <= n; i++) { a[i] = 0; b[i] = 0; c[i] = 0; d[i] = 0; } for (long long i = n; i <= (n + n); i++) { c[i] = 0; } for (long long i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; if (a[i] == i) d[i] = 1; } while (ct <= (2 * n)) { if (check(n) == 1) break; ct1 = mex(n); if (ct1 == n) { for (long long i = 0; i < n; i++) { if (d[i] != 1) { a[i] = n; c[ct] = i; break; } } } else { c[ct] = ct1; a[ct1] = ct1; d[ct1] = 1; } for (long long i = 0; i < n; i++) b[i] = a[i]; ct++; } cout << ct - 1 << n ; for (long long i = 1; i < ct; i++) { cout << c[i] + 1 << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class A> ostream& operator<<(ostream& out, const vector<A>& v) { for (long long i = 0; i < v.size(); i++) { if (i) out << ; out << v[i]; } return out << n ; } const long long mod = 1000000007; inline long long add(long long a, long long b) { a += b; if (a >= mod) a -= mod; return a; } inline long long sub(long long a, long long b) { a -= b; if (a < 0) a += mod; return a; } inline long long mul(long long a, long long b) { return (a * 1ll * b) % mod; } inline long long powmod(long long a, long long b) { long long rt = 1; while (b > 0) { if (b & 1) rt = mul(rt, a); a = mul(a, a); b >>= 1; } return rt; } inline long long inv(long long a) { return powmod(a, mod - 2); } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long n, k; long long a[100005]; bool check(long long mid) { long long sum = 0; for (long long i = 0; i < n; i++) { sum += min(mid, a[i]); } return sum <= k; } void solve() { cin >> n >> k; long long rt = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; rt += a[i]; } if (rt < k) { cout << -1 << n ; return; } long long lo = 1; long long hi = *max_element(a, a + n); long long ans = 0; while (hi - lo >= 0) { long long mid = (hi + lo) >> 1; if (check(mid)) { lo = mid + 1; ans = mid; } else { hi = mid - 1; } } if (false) cerr << ans << n ; for (long long i = 0; i < n; i++) { k -= min(a[i], ans); a[i] -= min(a[i], ans); } if (false) cerr << k << n ; long long i = 0; for (i = 0; i < n && k > 0; i++) { if (a[i] <= 0) continue; else { a[i]--; k--; } if (false) cerr << a[i] << ; } if (false) cerr << n ; long long y = 0; for (long long j = i; j < i + n; j++) { long long tmp = j % n; if (false) cerr << a[tmp] << ; if (a[tmp] <= 0) continue; y = 1; cout << tmp + 1 << ; } cout << n ; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL), cout << setprecision(14); ; long long t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; string in_name = sample.in ; string out_name = sample.out ; ifstream in; ofstream out; vector<int> v[1001]; int N; int main() { cin >> N; int k, x; for (int i = 0; i < N; i++) { cin >> k; for (int j = 0; j < k; j++) { cin >> x; v[i].push_back(x); } sort(v[i].begin(), v[i].end()); } int res = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < v[i].size() - 1; j++) { std::vector<int>::iterator low, up; int before = (i - 1 + N) % N; int after = (i + 1) % N; int left = 0, right = 0; up = upper_bound(v[before].begin(), v[before].end(), v[i][j]); low = lower_bound(v[before].begin(), v[before].end(), v[i][j + 1]); int u = (int)(up - v[before].begin()); int l = (int)(low - v[before].begin()); if (u < v[before].size() && v[before][u] < v[i][j + 1]) left += (l - u) + 1; up = upper_bound(v[after].begin(), v[after].end(), v[i][j]); low = lower_bound(v[after].begin(), v[after].end(), v[i][j + 1]); u = (int)(up - v[after].begin()); l = (int)(low - v[after].begin()); if (u < v[after].size() && v[after][u] < v[i][j + 1]) right += (l - u) + 1; if (left != right) { res++; } } } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int firstt(int* a, int n) { long long l, r, s; for (int i = 0; i <= n - 1; ++i) { l = 0; r = 10000000000; while (l < r - 1) { s = (-l + r) / 2 + l; if (s * n >= a[i] - i) { r = s; } else { l = s; } } if (l * n >= a[i] - i) { a[i] = l; } else { a[i] = l + 1; } } l = 0; int minn = a[0]; for (int i = 1; i <= n - 1; ++i) { if (a[i] < minn) { minn = a[i]; l = i; } } return (l + 1); } int main() { int n, i; cin >> n; int* a = new int[n]; for (i = 0; i <= n - 1; ++i) { cin >> a[i]; } long long res = firstt(a, n); cout << res; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > V(7); vector<vector<string> > S(7); set<string> SS; int n, m; void DFS(int node, string T) { if (T.length() == n) { SS.insert(T); return; } for (int i = 0; i < S[node].size(); i++) { string R = S[node][i]; string E; E += R[1]; if (T.length() + 2 == n) { DFS(0, T + R); } else DFS(R[0] - a , T + E); } } int main() { cin >> n >> m; string y; char C; char A[m]; for (int i = 0; i < m; i++) { cin >> y >> C; A[i] = C; S[C - a ].push_back(y); } for (int i = 0; i < m; i++) { if (A[i] == a ) { DFS(A[i] - a , ); } } cout << SS.size() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 5e5 + 5; struct Node { long long t, h, m; } a[MAXN]; bool cmp(Node x, Node y) { return x.m > y.m; } long long n, x; long long vis[MAXN]; long long solve(long long now) { memset(vis, 0, sizeof(vis)); long long ans = 0; long long h = x; while (1) { long long f = 0; for (long long i = 1; i <= n; i++) { if (vis[i] == 0 && now != a[i].t && h >= a[i].h) { f = 1; now = 1 - now; vis[i] = 1; ans++; h += a[i].m; break; } } if (f == 0) { break; } } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> x; for (long long i = 1; i <= n; i++) { cin >> a[i].t >> a[i].h >> a[i].m; } sort(a + 1, a + n + 1, cmp); long long ans = max(solve(1), solve(0)); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, perm[305], m[305][305]; char s[305]; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &perm[i]); } memset(m, 0, sizeof(m)); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < n; j++) { if (s[j] == 1 ) { m[i][j] = 1; } } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (m[i][j] == 1) { for (int a = 0; a < n; a++) { if (m[i][a] == 1 || m[j][a] == 1 || m[a][i] == 1 || m[a][j] == 1) { m[i][a] = 1; m[j][a] = 1; m[a][i] = 1; m[a][j] = 1; } } } } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (m[i][j] && perm[j] < perm[i]) { swap(perm[j], perm[i]); } } } for (int i = 0; i < n; i++) { if (i != 0) { printf( ); } printf( %d , perm[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; #define ll long long int #define pb push_back #define mp make_pair #define deb(x) cout<< #x << << x << n ; #define MAX 9223372036854775807 #define MIN -9223372036854775807 #define PI 3.141592653589 #define setbits(n) __builtin_popcountll(n) #define mkunique(a) a.resize(unique(a.begin(),a.end())-a.begin()); const ll mod=998244353; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll T=clock(); ll t; cin>>t; while(t--){ ll n,m; cin>>n>>m; vector<vector<ll>> a(n,vector<ll>(m)); vector<ll> p(n+m); for(ll i=0;i<n;i++){ for(ll j=0;j<m;j++){ cin>>a[i][j]; p[i+j]^=a[i][j]; } } bool ok=false; for(ll i=0;i<n+m;i++) if(p[i]!=0) ok=true; if(ok) cout<< Ashish n ; else cout<< Jeel n ; } cerr<< n nTIME: <<(double)(clock()-T)/CLOCKS_PER_SEC<< sec n ; T = clock(); return 0; } |
#include <bits/stdc++.h> using namespace std; int q; int n; int nav[200005], pos[200005]; int main() { scanf( %d , &q); while (q--) { int men = 999999, lar = 999999; scanf( %d , &n); int a; for (int i = 0; i < n; i++) { scanf( %d , &a); if (nav[a] == 0) nav[a] = 1, pos[a] = i; if (nav[a] == 1) lar = i - pos[a], pos[a] = i; if (lar < men && lar != 0) men = lar; } printf( %d n , men == 999999 ? -1 : men + 1); for (int i = 0; i < 200001; i++) nav[i] = pos[i] = 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e3; int main() { int n; cin >> n; for (int i = 1; i < N; i++) if (i * (i + 1) <= 2 * n && (i + 2) * (i + 1) > 2 * n) { cout << i << endl; for (int j = 1; j < i; j++) cout << j << ; cout << n - (i - 1) * i / 2; return 0; } } |
#include <bits/stdc++.h> using namespace std; int dir[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; int ans[505][505]; int col = 1, n, coz = 0; int main() { std::ios::sync_with_stdio(false); scanf( %d , &n); if (n < 3) { printf( -1 ); return 0; } int now_ = 0, cot = n; int x = 1, y = 0; int rest = n * n; while (rest != 9) { for (int i = 1; i <= cot; i++) { coz++; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz; } rest -= cot; col++; if (col % 2 == 0) cot--; now_ = (now_ + 1) % 4; } x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 1; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 2; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 4; now_ = (now_ + 1) % 4; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 5; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 9; now_ = (now_ + 1) % 4; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 6; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 7; now_ = (now_ + 1) % 4; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 8; now_ = (now_ + 1) % 4; x += dir[now_][0]; y += dir[now_][1]; ans[x][y] = coz + 3; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) printf( %d , ans[i][j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, tf = 0, f = 0, hun = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 25) tf++; else if (a[i] == 50) { f++; tf--; } else { hun++; if (f >= 1) { f--; tf--; } else tf = tf - 3; } if (tf < 0) { cout << NO ; break; } } if (tf >= 0) cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, y; int main() { cin >> n; n--; for (int i = 1; i <= sqrt(n); i++) if (n % i == 0) { y = n / i - 1 - i; if ((y % 2 == 0) && (y > 0)) { cout << i << << y / 2; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n]; int b[m]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> b[i]; int flag = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i] == b[j] && flag == 0) { cout << a[i] << ; flag = 1; } } flag = 0; } } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int power(int a, int b, int p) { int ans = 1 % p; for (; b; b >>= 1) { if (b & 1) ans = (long long)ans * a % p; a = (long long)a * a % p; } return ans; } int a, b, c, d; int main() { scanf( %d%d%d%d , &a, &b, &c, &d); if (a == d && (a != 0 || c == 0)) printf( 1 n ); else printf( 0 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXINT = 1000001; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n), b(n); vector<bool> used(MAXINT); set<int> dif; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { dif.insert(a[i] - a[j]); } } int p = 1; bool can = true; for (int i = 0; i < n; i++) { while (p < MAXINT && used[p]) { ++p; } if (p == MAXINT) { can = false; break; } b[i] = p; used[p] = true; for (int d : dif) { if (b[i] + d < MAXINT) { used[b[i] + d] = true; } } } if (can) { cout << YES n ; for (int i : b) { cout << i << ; } cout << n ; } else { cout << NO n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[100001]; int tmp, n, b[100001]; vector<pair<int, int> > a; int main() { int tt, ss; cin >> n; for (int i = (0); i <= (n - 1); i++) { cin >> tt >> ss; a.push_back(make_pair(tt, ss)); } sort(a.begin(), a.end()); tmp = 0; int mn = INT_MIN; for (int i = (0); i <= (n - 1); i++) { int lb = lower_bound(a.begin(), a.end(), make_pair(a[i].first - a[i].second, 0)) - a.begin(); dp[i] = dp[lb - 1] + 1; mn = max(mn, dp[i]); } cout << n - mn << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long b, deocoai, g, n, p, q, i, a[300], t, tong, z, a1, a2, k2, k1; cin >> b >> g >> n; if (min(b, g) >= n) { cout << n + 1; return 0; } if (max(b, g) >= n && min(b, g) <= n) { cout << min(b, g) + 1; return 0; } cout << b + g - n + 1; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); long long ans = 0; vector<pair<int, int> > v; vector<int> all; for (int i = 1; i <= n; ++i) { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); if (a + b < c + d) { if (a > d) v.push_back(make_pair(a - d, d - a)); if (b > c) v.push_back(make_pair(c - b, b - c)); } else { v.push_back(make_pair(a, b)); v.push_back(make_pair(c, d)); } } for (auto p : v) { int a = p.first, b = p.second; all.push_back(a + b); ans += a - b; } sort(all.begin(), all.end(), greater<int>()); for (int i = 0; i < (int)all.size(); ++i) { if (i & 1) ans -= all[i]; else ans += all[i]; } printf( %lld n , ans / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long max_sz = 1e5 + 1; const long long mod = 1e9 + 7; const long long MAXN = 4e18 + 1; char flip(char k) { if (k == 0 ) return 1 ; return 0 ; } long long sum_digit(long long n) { long long a = 0, i; for (i = n; i > 0; i = i / 10) { a += (i % 10); } return a; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { long long t; t = 1; while (t--) { long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); long long f = 0; for (long long i = 0; i < n - 2; i++) { if (a[i] == a[i + 1] && a[i] == a[i + 2]) { f = 1; break; } } if (f == 1) cout << NO << n ; else { cout << YES << n ; vector<long long> inc, dec; for (long long i = 0; i < n;) { if (a[i] == a[i + 1]) { inc.push_back(a[i]); dec.push_back(a[i + 1]); i += 2; } else { inc.push_back(a[i]); i++; } } cout << inc.size() << endl; for (auto it : inc) cout << it << ; cout << endl; cout << dec.size() << endl; sort(dec.begin(), dec.end(), greater<long long>()); for (auto it : dec) cout << it << ; cout << endl; } } cerr << endl << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double EPS = 1e-8; using namespace std; int main() { int n; while (cin >> n) { if (n <= 2) puts( -1 ); else { if (n % 2) cout << 2 * ((long long)(n / 2) * (n / 2) + n / 2) << << 2 * ((long long)(n / 2) * (n / 2) + n / 2) + 1 << endl; else cout << (long long)(n / 2) * (n / 2) - 1 << << (long long)(n / 2) * (n / 2) + 1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; double across(int n, int num_sides) { double ang = M_PI * ((double)num_sides / n) / 2; return 0.5 / sin(M_PI / (2 * n)) * sin(ang) * 2; } int main() { cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; double arg = (M_PI * (n - 1)) / ((double)2 * n); if (n % 2 == 0) { cout << setprecision(50) << tan(arg) << n ; } else { double r = 0.5 / sin(M_PI / (2 * n)); double side = r * 2 * sin((M_PI / n * (n - 1)) / 2); cout << setprecision(50) << sqrt(pow(across(n, n / 2), 2) / (double)2) + sqrt(pow(across(n, n / 2 + 1), 2) / (double)2) << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int t, a, i, j, ans, k, n, m; scanf( %d , &t); while (t--) { ans = 0; set<int> a; a.clear(); scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &k); if (k % 2 == 0) a.insert(k); } while (a.size() != 0) { m = *a.rbegin(); ans++; a.erase(m); m /= 2; if (m % 2 == 0) a.insert(m); } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline pair<long long int, long long int> compute_pos( pair<long long int, long long int> prev, char ch) { int flag = 1; pair<long long int, long long int> dest; dest = prev; if (ch == U ) dest.second += flag; if (ch == D ) dest.second -= flag; if (ch == R ) dest.first += flag; if (ch == L ) dest.first -= flag; return dest; } int main() { string str; pair<long long int, long long int> dest; ios_base::sync_with_stdio(false); cin >> dest.first >> dest.second; cin >> str; long long int R_num = 0, L_num = 0, U_num = 0, D_num = 0, i; for (i = 0; i < str.length(); i++) if (str[i] == U ) U_num++; else if (str[i] == D ) D_num++; else if (str[i] == L ) L_num++; else R_num++; long long int initial_moves, initial_moves_1 = 0, initial_moves_2 = 0, R_net = R_num - L_num, U_net = U_num - D_num; if (R_net != 0) initial_moves_1 = dest.first / R_net; if (U_net != 0) initial_moves_2 = dest.second / U_net; int s_bit_1 = 1, s_bit_2 = 1; s_bit_1 = dest.first > 0 ? 1 : -1; s_bit_2 = dest.second > 0 ? 1 : -1; while (initial_moves_1 * R_net * s_bit_1 + R_num >= s_bit_1 * dest.first && initial_moves_1 > 0) initial_moves_1--; while (initial_moves_2 * U_net * s_bit_2 + U_num >= s_bit_2 * dest.second && initial_moves_2 > 0) initial_moves_2--; initial_moves = initial_moves_2 < initial_moves_1 ? initial_moves_1 : initial_moves_2; pair<long long int, long long int> position; position.first = 0; position.second = 0; initial_moves = initial_moves > 0 ? initial_moves : 0; position.first = R_net * initial_moves; position.second = U_net * initial_moves; int flag = 0; { if (position == dest) flag = 1; else if (R_net == 0 && U_net == 0) { for (i = 0; i < str.length(); i++) { position = compute_pos(position, str[i]); if (dest == position) { flag = 1; break; } } } else { while (true) { for (i = 0; i < str.length(); i++) { if (position == dest) { flag = 1; break; } position = compute_pos(position, str[i]); } if (position == dest) { flag = 1; break; } if (position.first - dest.first > L_num) break; if (position.second - dest.second > D_num) break; if (dest.first - position.first > R_num) break; if (dest.second - position.second > U_num) break; } } } if (flag == 1) cout << Yes << n ; else cout << No << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int d[101], t, m, c, b, i, j, k, l; string s; int main() { cin >> t >> m; for (k = 0; k < t; k++) { cin >> s; if (s[0] == a ) { cin >> c; for (i = 0, j = -1; i < m; i++) if (i - j == c && !d[i]) break; else if (d[i]) j = i; if (i - j == c && i < m) { cout << ++b << endl; for (l = j + 1; l <= i; l++) d[l] = b; } else cout << NULL << endl; } else if (s[0] == e ) { cin >> c; for (i = 0, j = 0; i < m; i++) if (d[i] == c && c != 0) d[i] = 0, j = 1; if (!j) cout << ILLEGAL_ERASE_ARGUMENT << endl; } else if (s[0] == d ) for (i = 0, j = 0; i < m; i++) if (d[i]) l = d[j], d[j] = d[i], d[i] = l, j++; } return 0; } |
#include <bits/stdc++.h> using namespace std; char ch, s[22][22]; int n, m, N, sg[22][22][22][22], op[22][22]; bool ok, bo[100000]; void read(int &x) { for (ok = 0, ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) ok = 1; for (x = 0; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; if (ok) x = -x; } int calc(int a, int b, int c, int d) { if (a > b || c > d) return 0; if (sg[a][b][c][d] != -1) return sg[a][b][c][d]; for (int i = a; i <= b; i++) for (int j = c; j <= d; j++) if (op[i][j] == 1) calc(a, b, c, j - 1), calc(a, b, j + 1, d); else if (op[i][j] == 2) calc(a, i - 1, c, d), calc(i + 1, b, c, d); else if (op[i][j] == 3) calc(a, i - 1, c, j - 1), calc(a, i - 1, j + 1, d), calc(i + 1, b, c, j - 1), calc(i + 1, b, j + 1, d); for (int i = a; i <= b; i++) for (int j = c; j <= d; j++) if (op[i][j] == 1) bo[calc(a, b, c, j - 1) ^ calc(a, b, j + 1, d)] = 1; else if (op[i][j] == 2) bo[calc(a, i - 1, c, d) ^ calc(i + 1, b, c, d)] = 1; else if (op[i][j] == 3) bo[calc(a, i - 1, c, j - 1) ^ calc(a, i - 1, j + 1, d) ^ calc(i + 1, b, c, j - 1) ^ calc(i + 1, b, j + 1, d)] = 1; for (int i = 0;; i++) if (!bo[i]) { sg[a][b][c][d] = i; break; } for (int i = a; i <= b; i++) for (int j = c; j <= d; j++) if (op[i][j] == 1) bo[calc(a, b, c, j - 1) ^ calc(a, b, j + 1, d)] = 0; else if (op[i][j] == 2) bo[calc(a, i - 1, c, d) ^ calc(i + 1, b, c, d)] = 0; else if (op[i][j] == 3) bo[calc(a, i - 1, c, j - 1) ^ calc(a, i - 1, j + 1, d) ^ calc(i + 1, b, c, j - 1) ^ calc(i + 1, b, j + 1, d)] = 0; return sg[a][b][c][d]; } int solve(int p) { memset(op, 0, sizeof(op)); memset(sg, -1, sizeof(sg)); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (((i + j) & 1) == p) { op[(i - j + m + 1) >> 1][(i + j) >> 1] = s[i][j] == L ? 1 : s[i][j] == R ? 2 : 3; } int t = calc(1, N, 1, N); return t; } int main() { read(n), read(m), N = (n + m) >> 1; for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); puts(solve(0) ^ solve(1) ? WIN : LOSE ); return 0; } |
#include <bits/stdc++.h> using namespace std; int num[100010]; int l[100010], r[100010]; int tree[100010 << 2]; int lazy[100010 << 2]; vector<int> v[100010]; void build(int l, int r, int rt) { if (l == r) { tree[rt] = num[l]; lazy[rt] = 0; return; } int m = l + r >> 1; build(l, m, rt << 1); build(m + 1, r, rt << 1 | 1); tree[rt] = max(tree[rt << 1], tree[rt << 1 | 1]); } void update(int L, int R, int l, int r, int rt, int w) { if (L <= l && r <= R) { tree[rt] += w; lazy[rt] += w; return; } if (lazy[rt]) { tree[rt << 1] += lazy[rt]; tree[rt << 1 | 1] += lazy[rt]; lazy[rt << 1] += lazy[rt]; lazy[rt << 1 | 1] += lazy[rt]; lazy[rt] = 0; } int m = l + r >> 1; if (L <= m) update(L, R, l, m, rt << 1, w); if (R > m) update(L, R, m + 1, r, rt << 1 | 1, w); tree[rt] = max(tree[rt << 1], tree[rt << 1 | 1]); } int query(int x, int l, int r, int rt) { if (l == r) return tree[rt]; int m = l + r >> 1; if (lazy[rt]) { tree[rt << 1] += lazy[rt]; tree[rt << 1 | 1] += lazy[rt]; lazy[rt << 1] += lazy[rt]; lazy[rt << 1 | 1] += lazy[rt]; lazy[rt] = 0; } int ans = -0x3f3f3f3f; if (x <= m) ans = query(x, l, m, rt << 1); else ans = query(x, m + 1, r, rt << 1 | 1); return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> num[i]; build(1, n, 1); for (int i = 1; i <= m; ++i) { cin >> l[i] >> r[i]; v[l[i]].emplace_back(i); v[r[i] + 1].emplace_back(-i); } long long ans = -0x3f3f3f3f; int mark; for (int i = 1; i <= n; ++i) { int sz = v[i].size(); for (int j = 0; j < sz; j++) { int t = v[i][j]; if (t > 0) update(l[t], r[t], 1, n, 1, -1); else update(l[-t], r[-t], 1, n, 1, 1); } long long maxx = tree[1]; long long now = query(i, 1, n, 1); if (maxx - now > ans) { ans = maxx - now; mark = i; } } cout << ans << endl; long long number = 0; for (int i = 1; i <= m; ++i) { if (l[i] <= mark && r[i] >= mark) { number++; } } cout << number << endl; for (int i = 1; i <= m; ++i) { if (l[i] <= mark && r[i] >= mark) { cout << i << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } int main() { fast(); long long int t; t = 1; while (t--) { int n; cin >> n; long long arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n, greater<int>()); int a = ceil((float)n / 2); int b = n - a; int answer = 0; int curr = a; vector<long long> arr2; vector<long long> arr3; for (int i = 1; i < a; i++) { for (int j = curr; j < n; j++) { if (arr[j] < arr[i]) { curr = j + 1; answer++; arr2.push_back(arr[j]); break; } else arr3.push_back(arr[j]); } } cout << answer << endl; for (int i = 0; i < arr3.size(); i++) arr2.push_back(arr3[i]); if (arr2.size() != b) { for (int i = 0; i < (b - arr2.size()); i++) arr2.push_back(arr[n - 1 - i]); } for (int i = 0; i < n; i++) { if (i % 2) cout << arr2[i / 2] << ; else cout << arr[i / 2] << ; } } } |
#include <bits/stdc++.h> using namespace std; int cnt(vector<vector<pair<int, int>>>& graph, int cur, int parent, int val) { int ans = 1; for (auto p : graph[cur]) { if (p.first == parent) continue; if (p.second == val) ans += cnt(graph, p.first, cur, val); } return ans; } void fill(vector<vector<pair<int, int>>>& graph, vector<pair<bool, bool>>& visited, vector<pair<int, int>>& cnt_vec, int cur, int parent, int val, int num) { if (val == 0) { visited[cur].first = true; cnt_vec[cur].first = num; } else { visited[cur].second = true; cnt_vec[cur].second = num; } for (auto p : graph[cur]) { if (p.first == parent) continue; if (p.second == val) fill(graph, visited, cnt_vec, p.first, cur, val, num); } } int process(vector<vector<pair<int, int>>>& graph, vector<pair<bool, bool>>& visited, vector<pair<int, int>>& cnt_vec, int start, int val) { int n = graph.size(), ans; ans = cnt(graph, start, -1, val); fill(graph, visited, cnt_vec, start, -1, val, ans); return ans; } int main() { int n, i, a, b, val, tmp; long long ans = 0; cin >> n; vector<vector<pair<int, int>>> graph(n + 1); for (i = 0; i < n - 1; ++i) { cin >> a >> b >> val; graph[a].push_back({b, val}); graph[b].push_back({a, val}); } vector<pair<int, int>> cnt_vec(n + 1, {0, 0}); vector<pair<bool, bool>> visited(n + 1, {false, false}); vector<int> components; for (i = 1; i <= n; ++i) { if (!visited[i].first) { tmp = process(graph, visited, cnt_vec, i, 0); if (tmp > 1) components.push_back(tmp); } if (!visited[i].second) { tmp = process(graph, visited, cnt_vec, i, 1); if (tmp > 1) components.push_back(tmp); } } for (auto num : components) ans += 1LL * num * (num - 1); for (i = 1; i <= n; ++i) ans += 1LL * (cnt_vec[i].first - 1) * (cnt_vec[i].second - 1); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; void pr_init() {} void solve() { string str[2]; cin >> str[0] >> str[1]; long long ss = (long long)str[0].size(); long long dp[2][ss + 1]; for (long long i = 0; i < 2; i++) { for (long long j = 0; j < ss; j++) { if (str[i][j] == X ) dp[i][j] = 0; else dp[i][j] = 1; } } dp[0][ss] = dp[1][ss] = 0; long long ways = 0; for (long long j = 0; j < ss; j++) { if (dp[0][j] == 1 && dp[1][j] == 1) { if (dp[0][j + 1] == 1) ways++, dp[0][j + 1] = 0; else if (dp[1][j + 1] == 1) ways++, dp[1][j + 1] = 0; continue; } else if (dp[0][j] == 1) { if (dp[0][j + 1] == 1 && dp[1][j + 1] == 1) ways++, dp[0][j + 1] = 0, dp[1][j + 1] = 0; continue; } else if (dp[1][j] == 1) { if (dp[0][j + 1] == 1 && dp[1][j + 1] == 1) ways++, dp[0][j + 1] = 0, dp[1][j + 1] = 0; continue; } } cout << ways << endl; } int32_t main() { pr_init(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); } |
#include <bits/stdc++.h> using namespace std; template <class t> inline t read(t &x) { char c = getchar(); bool f = 0; x = 0; while (!isdigit(c)) f |= c == - , c = getchar(); while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); if (f) x = -x; return x; } template <class t, class... A> inline void read(t &x, A &...a) { read(x); read(a...); } template <class t> inline void write(t x) { if (x < 0) putchar( - ), write(-x); else { if (x > 9) write(x / 10); putchar( 0 + x % 10); } } const int N = 55; int n, a[N], cnt; signed main() { read(n); for (int i = 1; i <= n; i++) read(a[i]); sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) cnt += a[i] == a[1]; if (cnt > n / 2) puts( Bob ); else puts( Alice ); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5, Lim = 18; int tr[maxn * 19][2], nowxor, cnt = 1, siz[maxn * 19], n, m; template <typename T> inline void read(T &x) { char c; int f = 1; while (!isdigit(c = getchar())) (c == - ) && (f = -1); x = c ^ 48; while (isdigit(c = getchar())) x = x * 10 + (c ^ 48); x *= f; } void insert(int x, int u = 1, int now = Lim) { if (now == -1) return siz[u] = 1, void(); int s = x >> now & 1; if (!tr[u][s]) tr[u][s] = ++cnt; insert(x, tr[u][s], now - 1); siz[u] = siz[tr[u][0]] + siz[tr[u][1]]; } inline int query(int x = nowxor) { int u = 1, res = 0; for (int i = Lim; i >= 0; --i) { int s = x >> i & 1; if (siz[tr[u][s]] == ((1 << i))) u = tr[u][s ^ 1], res |= (1 << i); else u = tr[u][s]; if (!u) return res; } return res; } int main() { int x; read(n); read(m); for (int i = 1; i <= n; ++i) read(x), insert(x); while (m--) { read(x); nowxor ^= x; printf( %d n , query()); } return 0; int yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; yy = 0; } |
#include <bits/stdc++.h> long long vx[200010], vy[200010]; std::map<long long, long long> mp, gg; int main() { int n; long long a, b; scanf( %d%lld%lld , &n, &a, &b); long long ans = 0; for (int k = 1; k <= n; k++) { long long t; scanf( %lld%lld%lld , &t, &vx[k], &vy[k]); long long c = a * vx[k] - vy[k]; long long d = (long long)2000000000 * vx[k] + vy[k]; ans -= gg[d]; gg[d]++; ans += mp[c]; mp[c]++; } printf( %lld n , 2 * ans); } |
#include <bits/stdc++.h> using namespace std; const int mmmm = 1111; int n; char s[mmmm]; int a[mmmm], f[mmmm]; void qwe() { a[0] = 1989; f[0] = 1; for (int i = 1; i <= 9; i++) { f[i] = f[i - 1] * 10; a[i] = a[i - 1] + f[i]; } } int main() { qwe(); while (scanf( %d , &n) != EOF) { for (int i = 1; i <= n; i++) { scanf( %s , s); int l = strlen(s) - 4; int c = 0; for (int i = 4; i < l + 4; i++) { c = c * 10 + s[i] - 0 ; } int asd = a[l - 1]; int zxc = a[l]; int t1 = asd / f[l] * f[l] + c; int t2 = zxc / f[l] * f[l] + c; if (t1 >= asd && t1 < zxc) { printf( %d n , t1); } else { printf( %d n , t2); } } } return 0; } |
#include <bits/stdc++.h> const double PI = 3.141592653589793238463; using namespace std; inline long long add(long long a, long long b) { a += b; if (a >= 1000000007) a -= 1000000007; return a; } inline long long sub(long long a, long long b) { a -= b; if (a < 0) a += 1000000007; return a; } inline long long mul(long long a, long long b) { return (long long)((long long)a * b % 1000000007); } long long fast_power(long long base, long long power) { long long result = 1; while (power > 0) { if (power % 2 == 1) { result = (result * base); } base = (base * base); power = power / 2; } return result; } long long min(long long a, long long b) { return a > b ? b : a; } long long max(long long a, long long b) { return a > b ? a : b; } void SieveOfEratosthenes(long long n, unordered_set<long long> &s) { bool prime[n + 1]; memset(prime, true, sizeof(prime)); for (long long p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } for (long long p = 2; p <= n; p++) if (prime[p]) s.insert(p); } void dfs(long long s, vector<bool> &vis, vector<vector<long long>> &adlist) { if (vis[s]) return; vis[s] = true; for (auto x : adlist[s]) { if (vis[x] == false) { cout << s << << x << n ; } dfs(x, vis, adlist); } } void bfs(long long x, vector<bool> &vis, vector<vector<long long>> &adlist) { queue<long long> q; vis[x] = true; q.push(x); while (!q.empty()) { long long s = q.front(); q.pop(); for (auto u : adlist[s]) { if (vis[u]) continue; vis[u] = true; q.push(u); } } } bool bpchk(vector<vector<long long>> &adj, vector<long long> &color) { color[1] = 1; queue<long long> q; q.push(1); while (!q.empty()) { long long u = q.front(); q.pop(); for (auto x : adj[u]) { if (color[x] == -1) { color[x] = color[u] ^ 1; q.push(x); } } } for (long long i = 1; i < adj.size(); i++) { for (auto x : adj[i]) { if (color[x] == color[i]) return false; } } return true; } int main() { string s; cin >> s; bool flag = true; long long zc = 0, oc = 0; for (long long i = 0; i < s.size(); i++) { if (s[i] == 0 ) { zc += 1; } else { oc += 1; } if (zc < oc) { flag = false; break; } } zc = 0, oc = 0; for (long long i = s.size() - 1; i >= 0; i--) { if (s[i] == 0 ) { zc += 1; } else { oc += 1; } if (zc < oc) { flag = false; break; } } if (flag == false) { cout << -1 << n ; } else { long long vecsz = 0; long long ctr = 1; long long i = 0; vector<long long> s2; while (i < s.size()) { if (i == 0) { ctr = 1; s2.push_back(ctr); } else { if (s[i] == s[i - 1] && s[i] == 0 ) { ctr += 1; s2.push_back(ctr); } else if (s[i] == s[i - 1] && s[i] == 1 ) { ctr -= 1; s2.push_back(ctr); } else { s2.push_back(ctr); } } vecsz = max(vecsz, ctr); i += 1; } cout << vecsz << n ; vector<vector<long long>> v(vecsz + 1, vector<long long>()); for (long long i = 0; i < s2.size(); i++) { v[s2[i]].push_back(i + 1); } for (long long i = 1; i < v.size(); i++) { cout << v[i].size() << ; for (long long j = 0; j < v[i].size(); j++) { cout << v[i][j] << ; } cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000000 + 7; const int N = 10000001; long long dp[N]; int main() { dp[1] = 0; dp[2] = 3; for (int i = 3; i < N; i++) dp[i] = (dp[i - 2] * 3 + dp[i - 1] * 2) % mod; int n; while (scanf( %d , &n) != EOF) printf( %lld n , dp[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int maxn = 1e4 + 5; int n, b, q; int a[maxn], c[maxn]; inline int f(int x, int j) { return (x / 5) + (x % 5 >= j); } inline int calc(int j, int l, int r) { return f(r, j) - f(l - 1, j); } int main() { scanf( %d%d%d , &n, &b, &q); memset(a, -1, sizeof(a)); for (int i = (0); i < (q); ++i) { int x, k; scanf( %d%d , &x, &k); if (~a[x] && a[x] != k) { puts( unfair ); return 0; } a[x] = k; } if (~a[b] && a[b] != n) { puts( unfair ); return 0; } a[b] = n; a[0] = 0; for (int msk = (0); msk < (1 << 5); ++msk) { int x, g = 0, lst = 0; for (int i = (1); i <= (b); ++i) if (~a[i]) { int sub = 0, nin = 0; if (a[i] < a[lst]) { puts( unfair ); return 0; } for (int j = (0); j < (5); ++j) { if (msk >> j & 1) sub += calc(j, lst + 1, i); else nin += calc(j, lst + 1, i); } g += min(a[i] - a[lst], sub); if (a[i] - a[lst] > i - lst) { puts( unfair ); return 0; } lst = i; } x = __builtin_popcount(msk) * n / 5; if (x > g) { puts( unfair ); return 0; } } puts( fair ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e7; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { int n, ans = INT_MAX, count = 0; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; count += (v[i] == 1); } if (count > 0) { cout << n - count << endl; } else { vector<vector<int>> dp(n, vector<int>(n)); for (int i = 0; i < n; i++) dp[i][i] = v[i]; for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) dp[i][j] = gcd(v[j], dp[i][j - 1]); for (int i = 0; i < n; i++) for (int j = i; j < n; j++) if (dp[i][j] == 1) ans = min(ans, j - i); if (ans == INT_MAX) cout << -1 << endl; else cout << ans + n - 1 << endl; } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; pair<int, int> p[10][10]; int nom[4]; bool cmp(int a, int b) { if (p[a][0] != p[b][0]) return (p[a][0] < p[b][0]); else return (p[a][1] < p[b][1]); } int main() { for (int i = (0); i < (4); i++) { for (int j = (0); j < (2); j++) { scanf( %d%d , &p[i][j].first, &p[i][j].second); } if (p[i][0].first == p[i][1].first) { if (p[i][0].second > p[i][1].second) swap(p[i][0], p[i][1]); } else { if (p[i][0].first > p[i][1].first) swap(p[i][0], p[i][1]); } } for (int i = (0); i < (4); i++) nom[i] = i; sort(nom, nom + 4, &cmp); if (p[nom[1]][0].second == p[nom[1]][1].second && p[nom[1]][0].first != p[nom[1]][1].first) { if (p[nom[0]][0].first == p[nom[0]][1].first && p[nom[0]][0].second != p[nom[0]][1].second) { if (p[nom[2]][0].second == p[nom[2]][1].second && p[nom[2]][0].first != p[nom[2]][1].first) { if (p[nom[3]][0].first == p[nom[3]][1].first && p[nom[3]][0].second != p[nom[3]][1].second) { if (p[nom[0]][0] == p[nom[1]][0] && p[nom[0]][1] == p[nom[2]][0] && p[nom[2]][1] == p[nom[3]][1] && p[nom[3]][0] == p[nom[1]][1]) { printf( YES n ); return 0; } } } } } printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int A[200000]; int cost[200001]; int sub() { int n, p, k; cin >> n >> p >> k; for (int i = 0; i < n; i++) { cin >> A[i]; } sort(A, A + n); for (int i = 0; i < n; i++) { if (i < k - 1) { cost[i + 1] = cost[i] + A[i]; } else { cost[i + 1] = cost[i - k + 1] + A[i]; } } int ans = 0; for (int i = 0; i <= n; i++) { if (cost[i] <= p) { ans = i; } } cout << ans << endl; return 0; } int main() { int t; cin >> t; while (t--) { sub(); } } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) const long long INF = 1e18 + 1LL; const double Pi = acos(-1.0); const int N = 5e5 + 10, M = 1e3 + 20, mod = 1e9 + 7, inf = 2e9; vector<int> G[N]; long long dp[N][10], fs[N][10]; long long ans = 0; int n, k, a, b; void dfs(int u, int f) { dp[u][0] = 1; for (int i = 0; i < G[u].size(); ++i) { int to = G[u][i]; if (to == f) continue; dfs(to, u); for (int j = 0; j <= k; ++j) { for (int h = 0; h <= k; ++h) { if (!dp[u][j] || !dp[to][h]) continue; long long tmp = j + h + 1; if (tmp % k) tmp = tmp / k + 1; else tmp = tmp / k; ans += tmp * dp[to][h] * dp[u][j] + fs[u][j] * dp[to][h] + fs[to][h] * dp[u][j]; } } for (int j = 1; j <= k; ++j) dp[u][j] += dp[to][j - 1], fs[u][j] += fs[to][j - 1]; dp[u][1] += dp[to][k]; fs[u][1] += fs[to][k] + dp[to][k]; } } int main() { scanf( %d%d , &n, &k); for (int i = 1; i < n; ++i) { scanf( %d%d , &a, &b); G[a].push_back(b); G[b].push_back(a); } dfs(1, 0); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s >> t; reverse(s.begin(), s.end()); reverse(t.begin(), t.end()); int i = 0; while (i < s.length() && i < t.length() && s[i] == t[i]) { i++; } cout << s.length() + t.length() - 2 * i; } |
#include <bits/stdc++.h> int main() { int n, s; scanf( %d%d , &n, &s); s *= 100; int max = 0; bool tr = false; for (int i = 1; i <= n; i++) { int d, c; scanf( %d%d , &d, &c); int money = d * 100 + c; if (money <= s) { tr = true; int sweet = (s - money) % 100; if (max < sweet) max = sweet; } } if (tr == false) printf( -1 n ); else printf( %d n , max); } |
#include <bits/stdc++.h> using namespace std; int n, k, m; int times[45]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> m; for (int i = 0; i < k; i++) cin >> times[i]; int s = 0; for (int i = 0; i < k; i++) s += times[i]; sort(begin(times), begin(times) + k); int currBest = 0; for (int numSolves = 0; numSolves < n + 1; numSolves++) { if (s * numSolves > m) break; int score = 0; score += numSolves * (k + 1); int timeLeft = m - s * numSolves; int numUnsolved = n - numSolves; int i = 0; while (timeLeft >= times[i] && i < k) { score += min(timeLeft / times[i], numUnsolved); timeLeft -= times[i] * min(timeLeft / times[i], numUnsolved); i++; } currBest = max(score, currBest); } cout << currBest << n ; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename V> void bugp(const pair<T, V> &x) { cerr << { << x.first << , << x.second << } << endl; } template <typename T, typename U, typename V> void bugpp(const pair<T, pair<U, V> > &x) { cerr << { << x.first << , { << x.second.first << , << x.second.second << }} << endl; } template <typename T> bool maximize(T &x, const T &y) { if (x < y) { x = y; return 1; } return 0; } template <typename T> bool minimize(T &x, const T &y) { if (x > y) { x = y; return 1; } return 0; } const int N = 100001; int n, arr[N], dp[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; int total_sum = 0; map<int, int> cnt; for (int i = 1, _n = (n); i <= _n; ++i) { cin >> arr[i]; total_sum += arr[i]; if (!(total_sum & 1)) dp[i] = cnt[total_sum - total_sum / 2]; ++cnt[total_sum]; } long long ans = 0; int sum = 0; for (int i = (n), _b = (3); i >= _b; --i) { sum += arr[i]; if (3 * sum == total_sum) ans += dp[i - 1]; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const long long OO = 0x3f3f3f3f3f3f3f3fLL; const int maxn = 200000; int d, V, n; pair<int, int> a[maxn + 5]; long long dp[maxn + 5]; int Min[maxn + 5]; int main() { memset(Min, -1, sizeof Min); scanf( %d%d%d , &d, &V, &n); for (int i = (0), _end_ = (n); i < _end_; ++i) scanf( %d%d , &a[i].first, &a[i].second); a[n++] = make_pair(0, 0); a[n++] = make_pair(d, 0); sort(a, a + n); for (int i = (0), _end_ = (n - 1); i < _end_; ++i) if (a[i].first + V < a[i + 1].first) { printf( -1 n ); return 0; } long long ans = 0; int lst = 0, cur = 0; for (int i = (1), _end_ = (n); i < _end_; ++i) { cur = a[i - 1].first; while (a[lst].first + V < a[i].first) { ans += (long long)(a[lst].first + V - cur) * a[lst].second; cur = a[lst].first + V; int best = -1; for (int j = lst + 1; j <= n; j += j & -j) if (best == -1 || (Min[j] != -1 && a[Min[j]].second < a[best].second)) best = Min[j]; lst = best; } ans += (long long)(a[i].first - cur) * a[lst].second; cur = a[i].first; if (a[i].second < a[lst].second) lst = i; for (int j = i; j > 0; j -= j & -j) if (Min[j] == -1 || a[Min[j]].second > a[i].second) Min[j] = i; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, x, y, ans = 0, t; bool p1[1010], p2[1010]; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) p1[i] = p2[i] = 1; p1[1] = p2[1] = p1[n] = p2[n] = 0; for (i = 1; i <= m; i++) { scanf( %d%d , &x, &y); p1[x] = p2[y] = 0; } ans = 2 * (n - 2); for (i = 2; i < n; i++) { if (p1[i] == 0) ans--; if (p2[i] == 0) ans--; } if (n % 2) { t = n / 2 + 1; if (p1[t] == 0) ans++; if (p2[t] == 0) ans++; ans -= 2; if (p1[t] || p2[t]) ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); if (n % 2) printf( black n ); else printf( white n1 2 n ); } |
#include <bits/stdc++.h> using namespace std; namespace fastIO { bool IOerror = 0; inline char nc() { static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000; if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, 100000, stdin); if (pend == p1) { IOerror = 1; return -1; } } return *p1++; } inline bool blank(char ch) { return ch == || ch == n || ch == r || ch == t ; } inline long long read() { bool sign = 0; char ch = nc(); long long x = 0; for (; blank(ch); ch = nc()) ; if (IOerror) return 0; if (ch == - ) sign = 1, ch = nc(); for (; ch >= 0 && ch <= 9 ; ch = nc()) x = x * 10 + ch - 0 ; if (sign) x = -x; return x; } }; // namespace fastIO using namespace fastIO; vector<long long> e[2000010]; long long dep[2000010], fa[2000010], son[2000010], top[2000010], id[2000010], now = 0, f[2000010]; void dfs1(long long x, long long pre) { dep[x] = 1; for (auto i : e[x]) { if (i == pre) continue; dfs1(i, x); fa[i] = x; if (dep[i] > dep[son[x]]) son[x] = i; dep[x] = max(dep[x], dep[i] + 1); } } void dfs2(long long x, long long tp) { id[x] = ++now; top[x] = tp; if (son[x]) dfs2(son[x], son[x]); for (auto i : e[x]) { if (i == son[x] || i == fa[x]) continue; dfs2(i, tp); } } long long maxx[1000010], maxi[1000010]; void merge(long long p, long long x, long long y) { for (long long i = 1; i <= dep[y]; i++) { f[id[x] + i - 1] += f[id[y] + i - 1]; if (f[id[x] + i - 1] > maxx[p] || (f[id[x] + i - 1] == maxx[p] && i < maxi[p])) maxx[p] = f[id[x] + i - 1], maxi[p] = i; } } void dfs3(long long x, long long pre) { if (son[x]) dfs3(son[x], x); if (son[x]) maxx[x] = maxx[son[x]], maxi[x] = maxi[son[x]] + 1; else maxx[x] = 1, maxi[x] = 0; for (auto i : e[x]) { if (i == fa[x] || i == son[x]) continue; dfs3(i, x); merge(x, son[x], i); } f[id[x]] = 1; if (maxx[x] == 1) maxi[x] = 0; } signed main() { long long n = read(); for (long long i = 1; i < n; i++) { long long x = read(), y = read(); e[x].push_back(y); e[y].push_back(x); } dfs1(1, 1); dfs2(1, 1); dfs3(1, 1); for (long long i = 1; i <= n; i++) cout << maxi[i] << n ; return 0; } |
#include <iostream> #include <string.h> #include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while(t--) { int x; cin >> x; bool isPossible = false; for (int i = 0; i < 11; i++) { if (111*i <= x && (x - 111*i)%11 == 0) { isPossible = true; } } if(isPossible) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; int a[maxn], ra[maxn]; int main() { int n, m, k; while (~scanf( %d%d%d , &n, &m, &k)) { for (int i = 0; i < n; i++) { scanf( %d , &a[i]); ra[a[i]] = i; } int t; long long cnt = 0; for (int i = 0; i < m; i++) { scanf( %d , &t); int j = ra[t]; if ((j + 1) % k == 0) cnt += (j + 1) / k; else cnt += ((j + 1) / k + 1); if (j != 0) { swap(a[j], a[j - 1]); swap(ra[t], ra[a[j]]); } } cout << cnt << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 30; unsigned long long n, k, x; unsigned long long a[300000]; unsigned long long dpL[300000]; unsigned long long dpR[300000]; int main() { int i, j; cin >> n >> k >> x; unsigned long long s = 0, MAX = 0; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n - 1; i++) { dpL[i + 1] = dpL[i] | a[i]; } for (i = n - 1; i > 0; i--) { dpR[i - 1] = dpR[i] | a[i]; } unsigned long long ans1 = a[0], ans2 = a[n - 1]; for (i = 0; i < k; i++) { ans1 = ans1 * x; ans2 = ans2 * x; } unsigned long long ans = max(ans1 | dpR[0], ans2 | dpL[n - 1]); for (i = 1; i < n - 1; i++) { unsigned long long ANS = a[i]; for (j = 0; j < k; j++) { ANS *= x; } ans = max(ans, ANS | dpL[i] | dpR[i]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int64_t n, m; cin >> n >> m; pair<char, int64_t> a[n][m]; for (int64_t i = 0; i < n; ++i) { for (int64_t j = 0; j < m; ++j) { cin >> a[i][j].first; a[i][j].second = 0; } } for (int64_t i = 0; i < n; ++i) { for (int64_t j = 0; j < m; ++j) { int64_t c = 0; for (int64_t k = 0; k < n; ++k) c += a[k][j].first == a[i][j].first; if (c > 1) a[i][j].second = 1; c = 0; for (int64_t k = 0; k < m; ++k) c += a[i][j].first == a[i][k].first; if (c > 1) a[i][j].second = 1; } } for (int64_t i = 0; i < n; ++i) { for (int64_t j = 0; j < m; ++j) { if (a[i][j].second == 0) cout << a[i][j].first; } } } |
#include <bits/stdc++.h> using namespace std; int l, s, cnt, last, b[100005]; char a[100005]; int main() { int i, j; scanf( %s , a); l = strlen(a); for (i = 0; i < strlen(a); i++) { if (a[i] == ( ) s++; else if (a[i] == ) ) s--; else if (a[i] == # ) { s--; cnt++; } if (s < 0) { puts( -1 ); return 0; } } for (i = 0; i < cnt; i++) { b[i] = 1; } b[cnt - 1] += s; s = 0; for (i = 0, j = 0; i < strlen(a); i++) { if (a[i] == ( ) s++; else if (a[i] == ) ) s--; else if (a[i] == # ) s -= b[j++]; if (s < 0) { puts( -1 ); return 0; } } for (i = 0; i < cnt; i++) { printf( %d , b[i]); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, first, last, ans, flag; cin >> n; if (n <= 2) { cout << 0 << endl; return 0; } ans = flag = 0; first = 1; last = n; for (int i = 1; i < n; i++) { ans += (first + last) % (n + 1); if (!flag) { first++; swap((first), last); } else { first--; swap((first), last); } flag = 1 - flag; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> months = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int MAX = 1e5 + 55; const int inf = 1e9 + 77; const int MOD = 1e9 + 7; const double PI = acos(-1.0); const double eps = 1e-7; int main() { long long n; scanf( %I64d , &n); long long div = 3; while (n % div == 0) div *= 3; n /= div; ++n; printf( %I64d , n); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { float n; cin >> n; cout << ceil(n / 5); return 0; } |
#include <bits/stdc++.h> #define ll long long using namespace std; void solve(){ ll n, i; cin >> n; ll u, r, d, l; ll u1=0, r1=0, d1=0, l1=0; cin >> u >> r >> d >> l; if(u==n) r1++,l1++; if(d==n) r1++,l1++; if(r==n) u1++,d1++; if(l==n) u1++,d1++; if(u==n-1){ if(r1<r) r1++; else l1++; } if(d==n-1){ if(r1<r) r1++; else l1++; } if(r==n-1){ if(u1<u) u1++; else d1++; } if(l==n-1){ if(u1<u) u1++; else d1++; } if(u>=u1 and r>=r1 and l>=l1 and d>=d1) cout << YES n ; else cout << NO n ; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); ll t; cin >> t; while(t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int x; cin >> x; cin.ignore(); string input; getline(cin, input); int len = input.length(); int cnt[3] = {0}; for (int i = 0; i < len; i++) { if (input[i] == 0 ) cnt[0]++; else if (input[i] == 1 ) cnt[1]++; else if (input[i] == 2 ) cnt[2]++; } int max = len / 3; cnt[0] = max - cnt[0]; cnt[1] = max - cnt[1]; cnt[2] = max - cnt[2]; if (cnt[0] == 0 && cnt[1] == 0 && cnt[2] == 0) { std::cout << input << n ; } else { for (int i = 0; i < len && cnt[0] > 0; i++) { if (input[i] == 1 && cnt[1] < 0) { input[i] = 0 ; cnt[1]++; cnt[0]--; } else if (input[i] == 2 && cnt[2] < 0) { input[i] = 0 ; cnt[2]++; cnt[0]--; } } for (int i = len - 1; cnt[2] > 0; i--) { if (input[i] == 1 && cnt[1] < 0) { input[i] = 2 ; cnt[1]++; cnt[2]--; } else if (input[i] == 0 && cnt[0] < 0) { input[i] = 2 ; cnt[0]++; cnt[2]--; } } for (int i = 0; i < len && cnt[1] > 0 && cnt[2] < 0; i++) { if (input[i] == 2 ) { input[i] = 1 ; cnt[1]--; cnt[2]++; } } for (int i = len - 1; i >= 0 && cnt[1] > 0 && cnt[0] < 0; i--) { if (input[i] == 0 ) { input[i] = 1 ; cnt[1]--; cnt[2]++; } } std::cout << input << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[120], b[120], c[120], d[120]; map<int, int> mp; vector<int> ans; int main() { memset(b, -1, sizeof(b)); scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d %d , &x, &y); b[x] = y; mp[x] = i; } for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { ans.clear(); memcpy(c, a, sizeof(c)); memcpy(d, b, sizeof(d)); for (int q = 1; q <= m; q++) { int choose = -1, hp = 2000000000; for (int j = 1; j <= n; j++) { if (d[j] == -1) continue; int tmp = d[j], ok = 1; if (j <= i) { for (int k = j; k <= i; k++) { tmp += c[k]; if (tmp < 0) { ok = 0; break; } } } else { for (int k = j; k >= i; k--) { tmp += c[k]; if (tmp < 0) { ok = 0; break; } } } if (!ok) continue; if (tmp < hp) { choose = j; hp = tmp; } } if (choose == -1) break; for (int j = min(i, choose); j <= max(i, choose); j++) c[j] = 0; d[choose] = -1; ans.push_back(choose); } if (ans.size() == m) { printf( %d n , i); for (int j = 0; j < ans.size(); j++) printf( %d , mp[ans[j]]); return 0; } } printf( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 5; long double x[maxN], y[maxN], r[maxN], val[maxN]; long double f(long double xx, long double yy) { for (int i = 0; i < 3; ++i) { val[i] = sqrt((x[i] - xx) * (x[i] - xx) + (y[i] - yy) * (y[i] - yy)) / r[i]; } val[3] = val[0]; long double answer = 0; for (int i = 0; i < 3; ++i) answer += (val[i] - val[i + 1]) * (val[i] - val[i + 1]); return answer; } int main() { for (int i = 0; i < 3; ++i) cin >> x[i] >> y[i] >> r[i]; long double pX = (x[0] + x[1] + x[2]) / 3., pY = (y[0] + y[1] + y[2]) / 3.; long double qq = 1.; while (qq > 1e-5) { if (f(pX - qq, pY) < f(pX, pY)) pX -= qq; else if (f(pX + qq, pY) < f(pX, pY)) pX += qq; else if (f(pX, pY - qq) < f(pX, pY)) pY -= qq; else if (f(pX, pY + qq) < f(pX, pY)) pY += qq; else qq *= 0.777777777; } if (f(pX, pY) > 1e-5) return 0; cout << fixed << setprecision(15) << pX << << pY << endl; return 0; } |
#include <bits/stdc++.h> const double eps = 1e-9; const double PI = acos(-1.0); const long long int mod = 1e9 + 7; const int MAXN = 2e3 + 5; using namespace std; vector<vector<int>> adj(MAXN); int mxd; void dfs(int u, int d) { mxd = max(mxd, d); for (int v : adj[u]) dfs(v, d + 1); } void cp() { int n; cin >> n; vector<int> roots; for (int i = 0; i < n; i++) { int p; cin >> p; if (p == -1) roots.push_back(i); else adj[p - 1].push_back(i); } for (int u : roots) dfs(u, 1); cout << mxd << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t; t = 1; while (t--) { cp(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int power(long long int x, long long int y) { long long int temp; if (y == 0) return 1; temp = power(x, y / 2); if (y % 2 == 0) return temp * temp; else return x * temp * temp; } bool prime_check(long long int n) { long long int i, j; if (n == 1) { return false; } for (i = 2; i <= sqrt(n); i++) { if (n % i == 0) { return false; } } return true; } long long int fact(long long int n) { long long int prod = 1; for (long long int i = 1; i <= n; i++) { prod = (prod * i) % 1000000007; } return prod; } bool vowl(char c) { return c == a || c == e || c == i || c == o || c == u ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n, i; cin >> n; int a[n + 3]; multiset<int, greater<int>> ms; for (i = 0; i < n; i++) { cin >> a[i]; ms.insert(a[i]); } bool flag = 0; int x = *ms.begin(); --x; ms.erase(ms.begin()); while (!ms.empty()) { int first = *ms.begin(); --first; ms.erase(ms.begin()); if (x) ms.insert(x); x = first; flag = 1 - flag; } if (!flag) cout << T << n ; else cout << HL << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline char nchar() { static const int bufl = 1 << 20; static char buf[bufl], *a = NULL, *b = NULL; return a == b && (b = (a = buf) + fread(buf, 1, bufl, stdin), a == b) ? EOF : *a++; } inline int read() { int x = 0, f = 1; char c = nchar(); for (; !isdigit(c); c = nchar()) if (c == - ) f = -1; for (; isdigit(c); c = nchar()) x = x * 10 + c - 0 ; return x * f; } const int maxn = 1e5 + 1; int n, m; namespace sgt { struct D { double s, j; D(double s = 0, double j = 0) : s(s), j(j) {} inline void set() { int x = read(), y = read(); double d = (double)x / y; d = (1 - d) / d; s = (j = d) + 1; } inline friend D operator+(D a, D b) { return D(a.s + a.j * (b.s - 1), a.j * b.j); } } t[maxn << 1]; inline int ID(int l, int r) { return l + r | l != r; } void build(int l, int r) { int x = ID(l, r); if (l == r) { t[x].set(); return; } int mid = l + r >> 1; build(l, mid), build(mid + 1, r); t[x] = t[ID(l, mid)] + t[ID(mid + 1, r)]; } void reset(int l, int r, int p) { int x = ID(l, r); if (l == r) { t[x].set(); return; } int mid = l + r >> 1; p <= mid ? reset(l, mid, p) : reset(mid + 1, r, p); t[x] = t[ID(l, mid)] + t[ID(mid + 1, r)]; } void reset(int p) { reset(1, n, p); } D query(int L, int R, int l, int r) { if (L == l && R == r) return t[ID(L, R)]; int mid = L + R >> 1; if (r <= mid) return query(L, mid, l, r); if (l > mid) return query(mid + 1, R, l, r); return query(L, mid, l, mid) + query(mid + 1, R, mid + 1, r); } double query(int l, int r) { D d = query(1, n, l, r); return 1. / d.s; } } // namespace sgt int main() { n = read(), m = read(); sgt::build(1, n); while (m--) { int o = read(); if (o == 1) sgt::reset(read()); else { int l = read(), r = read(); double ans = sgt::query(l, r); printf( %.12lf n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 9223372036854775807LL; #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroint-loops ) long long int power(long long int a, long long int b, long long int m) { long long int res = 1; while (b) { if (b & 1) res = ((res % m) * (a % m)) % m; a = ((a % m) * (a % m)) % m; b >>= 1; } return res; } long long int power(long long int a, long long int b) { long long int res = 1; while (b) { if (b & 1) res *= a; a *= a; b >>= 1; } return res; } void solve() { long long int a, b, c, d, x, y; cin >> a >> b >> c >> d >> x >> y; if (abs(c - a) % x == 0 and abs(d - b) % y == 0) { long long int xx = abs(c - a) / x; long long int yy = abs(d - b) / y; if ((xx & 1 and yy & 1) or (xx & 1 ^ 1 and yy & 1 ^ 1)) cout << YES ; else cout << NO ; } else cout << NO ; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int tt = 1; while (tt--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int c[10000] = {0}, d[10000] = {0}; int main() { int n, m, i; scanf( %d%d , &n, &m); for (i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); c[x]++; d[y]++; } int ans = 0, j, kc = 0, kd = 0; for (i = 2; i <= n - 1; i++) { if (!c[i]) ans++; if (!d[i]) ans++; } if (n % 2 == 1 && !c[(n + 1) / 2] && !d[(n + 1) / 2]) ans--; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int x = a[0], j = 0; vector<int> pol(n, 0); pol[0] = 1; for (int i = 1; i < n; i++) { if (a[i] == x) pol[j]++; else { j++; pol[j]++; x = a[i]; } } bool same = 1; for (int i = 1; i <= j; i++) if (pol[i] != pol[i - 1]) same = false; if (same) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int n, m; int visited[200001]; int colour[200001]; vector<int> adj_list[200001]; int* graph[1000001]; int* finalcolour[1000001]; int size[1000001]; int check; int count1 = 0; int k[9]; int l[9]; int dp[9][1001]; int A[9][11]; int c[9][10]; bool pairCompare(const pair<int, int>& firstElem, const pair<int, int>& secondElem) { return firstElem.first > secondElem.first; } int solve(int cards, int coins) { int i; if (cards <= 0) return 0; if (dp[cards][coins] != -1) return dp[cards][coins]; int ret = A[cards][l[cards]] + solve(cards - 1, coins); int use = 0; int coins_left = coins; for (i = l[cards] + 1; i <= k[cards]; i++) { coins_left = coins_left - c[cards][i - 1]; if (coins_left >= 0) ret = max(ret, A[cards][i] + solve(cards - 1, coins_left)); else break; } dp[cards][coins] = ret; return ret; } long long powe(long long a, long long b, long long k) { if (b == 0) return 1; long long temp = powe(a, b / 2, k); temp *= temp; if (temp >= k) temp %= k; if (b % 2 == 1) temp *= a; if (temp >= k) temp %= k; return temp; } void dfs(int x) { int i; visited[x] = 1; for (i = 0; i < adj_list[x].size(); i++) { if (visited[adj_list[x][i]] == 0) { printf( %d , x); if (colour[x] == -1) { colour[x] = 1; } else { colour[x] = -1; } dfs(adj_list[x][i]); if (colour[adj_list[x][i]] == -1) { printf( %d %d , x, adj_list[x][i]); colour[adj_list[x][i]] = 1; if (colour[x] == -1) { colour[x] = 1; } else { colour[x] = -1; } } } } printf( %d , x); if (colour[x] == -1) { colour[x] = 1; } else { colour[x] = -1; } } int main() { int n, i, count = 0; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &colour[i]); visited[i] = 0; if (colour[i] == 1) count++; } for (i = 1; i < n; i++) { int x, y; scanf( %d %d , &x, &y); adj_list[x].push_back(y); adj_list[y].push_back(x); } if (count == n) { printf( 1 n ); return 0; } if (colour[1] == -1) colour[1] = 1; else colour[1] = -1; dfs(1); if (colour[1] == -1) { printf( %d 1 %d , adj_list[1][0], adj_list[1][0]); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long inf = 4e18, mod = 1e9 + 7; vector<pair<pair<long long, long long>, pair<long long, long long>>> v; int segt[4 * 6000000 + 5], lazy[4 * 6000000 + 5]; void push(int v, int l, int r) { segt[v] += lazy[v]; if (l != r) { lazy[2 * v] += lazy[v]; lazy[2 * v + 1] += lazy[v]; } lazy[v] = 0; } void update_range(int v, int l, int r, int qs, int qe, int x) { push(v, l, r); if (l > qe || r < qs) return; if (qs <= l && r <= qe) { lazy[v] += x; push(v, l, r); return; } int m = (l + r) / 2; update_range(2 * v, l, m, qs, qe, x); update_range(2 * v + 1, m + 1, r, qs, qe, x); segt[v] = max(segt[2 * v], segt[2 * v + 1]); } int query(int v, int l, int r, int qs, int qe) { push(v, l, r); if (l > qe || r < qs) return 0; if (qs <= l && r <= qe) return segt[v]; int m = (l + r) / 2; int val1 = query(2 * v, l, m, qs, qe); int val2 = query(2 * v + 1, m + 1, r, qs, qe); return max(val1, val2); } void solve() { int n, r; cin >> n >> r; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; int X = x + y, Y = y - x; int lx, ly, ux, uy; lx = X - r, ux = X + r, ly = Y - r, uy = Y + r; lx += 3000000; ux += 3000000; ly += 3000000; uy += 3000000; v.push_back({{ly, 0}, {lx, ux}}); v.push_back({{uy, 1}, {lx, ux}}); } sort(v.begin(), v.end()); int res = 0; for (auto it : v) { if (it.first.second == 0) update_range(1, 0, 6000000, it.second.first, it.second.second, 1); else update_range(1, 0, 6000000, it.second.first, it.second.second, -1); int val = query(1, 0, 6000000, 0, 6000000); res = max(res, val); } cout << res << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; bool m[1001][1001]; bool ff[1001][1001]; int n, num; int ans; int main() { cin >> n >> num; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= i + num; j++) if (!m[i][(j - 1) % n + 1]) { m[i][(j - 1) % n + 1] = true; m[(j - 1) % n + 1][i] = true; ff[i][(j - 1) % n + 1] = true; } else { cout << -1 << endl; return 0; } if (n == 1) { cout << -1 << endl; return 0; } cout << num * n << endl; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (ff[i][j]) printf( %d %d n , i, j); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2 == 0) { cout << n / 2 - 1; } else { cout << (n + 1) / 2 - 1; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int a[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t, i, j, n, m, l, r; cin >> n; for (i = 0; i < n; i++) { cin >> l; a[l] = 1; } l = r = 0; if (a[1] == 1) l++; if (a[(int)1e6] == 1) l++; for (i = 2, j = 1e6 - 1; i < j && l < n; i++, j--, r++) { if (a[i] == 1) l++; if (a[j] == 1) l++; } cout << r << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int AbsDifference(int a, int b) { if (a >= b) return a - b; return b - a; } long long AbsDifference(long long a, long long b) { if (a >= b) return a - b; return b - a; } const int mod = 1000000007; const int mod2 = 1000000009; const int inf = 1 << 30; const long long infLL = 1ll << 62; const int impossible = -1; struct stoyan_point { int x, y; int id; }; struct stoyan_pointLL { long long x, y; int id; }; struct stoyan_segment { stoyan_point first, second; int lenght; bool type; int id; }; struct stoyan_segmentLL { stoyan_pointLL first, second; long long lenght; bool type; int id; }; string translate(int number, int lenght, int k) { string ans; while (number) { ans += char(( 1 ) + number & 1); number >>= 1; } reverse(ans.begin(), ans.end()); return ans; } vector<int> find_divisors(long long number) { vector<int> ans; int sq = sqrt(number), j; for (j = 1; j <= sq; j++) { if (number % j == 0) { ans.push_back(j); if (j * j != number) ans.push_back(number / j); } } sort(ans.begin(), ans.end()); return ans; } int cnt_divisors(long long number) { int ans = 0; int sq = sqrt(number), j; for (j = 1; j <= sq; j++) { if (number % j == 0) { ans++; if (j * j != number) ans++; } } return ans; } int n; string s; int x, y; int where_last = 0; int AnswerProblem; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; cin >> s; for (int i = 0; i < int(s.size()); i++) { if (s[i] == R ) x++; else y++; if (y > x) { if (where_last == -1) { AnswerProblem++; } where_last = 1; } if (y < x) { if (where_last == 1) { AnswerProblem++; } where_last = -1; } } cout << AnswerProblem << endl; return 0; } |
#include <bits/stdc++.h> int t[10000]; int main() { int n, m, k; std::cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { std::cin >> t[100 * i + j]; } } int ans = 1000000; if (n > k) { for (int j = 0; j < n; j++) { int dc = 0; for (int j2 = 0; j2 < m; j2++) { int c = 0; for (int i = 0; i < n; i++) { if (t[100 * i + j] == t[100 * i + j2]) c++; } dc += std::min(c, n - c); } ans = std::min(ans, dc); } } else { for (int j = 0; j < (1 << n); j++) { int dc = 0; for (int j2 = 0; j2 < m; j2++) { int c = 0; for (int i = 0; i < n; i++) { if (((int)(bool)(j & (1 << i))) == t[100 * i + j2]) c++; } dc += std::min(c, n - c); } ans = std::min(ans, dc); } } if (ans > k) { std::cout << -1; } else { std::cout << ans; } } |
#include <bits/stdc++.h> using namespace std; char c[101]; int n, ans; int check(int k) { int cnt = 0, sum = 0; for (int i = 0; i < n; i++) { sum += c[i] - 0 ; if (sum > k) return 0; if (sum == k) sum = 0, cnt++; } return (sum == 0 && cnt > 1) ? 1 : 0; } int main() { scanf( %d , &n); scanf( %s , c); for (int i = 0; i <= 1000; i++) { if (check(i)) { printf( YES ); return 0; } } printf( NO ); return 0; } |
#include <bits/stdc++.h> int main() { long long t, i, l, k, j, b[23132], s, n; char ch[1000000]; while (gets(ch)) { l = strlen(ch); for (k = 0; k < 124; k++) b[k] = 0; for (k = 0; k < l; k++) { b[ch[k] - 48]++; } s = 0; for (j = 0; j < 124; j++) { if (0 < b[j]) s += b[j] * b[j]; } printf( %lld n , s); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long w, m, k; int main() { scanf( %I64d%I64d%I64d , &w, &m, &k); w /= k; if (!w) { puts( 0 ); return 0; } long long cnt = 0; long long tmp = m; while (tmp) { cnt++; tmp /= 10; } tmp = 1; for (int i = 0; i < cnt; i++) tmp *= 10; long long x = m - 1, y = tmp - 1; while (w) { if (w < cnt) break; if (w >= (y - x) * cnt) { w -= (y - x) * cnt; x = y; y = y * 10 + 9; cnt++; } else { x += w / cnt; w = 0; break; } } cout << x - m + 1 << endl; } |
#include <bits/stdc++.h> using namespace std; long long INF = (1e19); int n, m; int a[105]; bool cmp(int a, int b) { return a > b; } bool check(int d) { int i = 1, k = 0, ans = 0; while (a[i] - k > 0 && i <= n) { ans += (a[i] - k); if (i % d == 0) { k++; } if (ans >= m) { return true; } i++; } return false; } int main() { scanf( %d%d , &n, &m); int ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); ans += a[i]; } if (ans < m) { printf( -1 ); } else { sort(a + 1, a + 1 + n, cmp); int l = 1, r = n, p; while (l <= r) { int mid = (l + r) / 2; if (check(mid)) { r = mid - 1; p = mid; } else { l = mid + 1; } } printf( %d n , p); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<long long> a(n); map<long long, long long> mp; long long ans = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; if (mp[a[i]]) { mp[a[i]] = 0; mp[i + 1] = 1; } else { mp[i + 1] = 1; ans++; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; const int MAXN = 1005; vector<int> child[200000]; int ceng[200000]; void dfs(int v, int ii) { ceng[ii]++; for (int i = 0; i < child[v].size(); i++) { dfs(child[v][i], ii + 1); } } int main() { int n; scanf( %d , &n); int temp; for (int i = 2; i <= n; i++) { scanf( %d , &temp); child[temp].push_back(i); } int ans = 0; dfs(1, 1); for (int i = 1; i <= n; i++) { if (ceng[i] % (2) == 0) ceng[i] = 0; if (ceng[i]) ceng[i] = 1; ans += ceng[i]; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 309, mod = 1e9 + 7; inline long long read() { register long long x = 0, f = 1; register char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 48, c = getchar(); } return x * f; } void pls(long long &x, long long y) { x += y; x = (x >= mod ? x - mod : x); } long long n, a[N], s[N]; namespace Solution_1 { long long s[N], f[2][N][N]; void solve() { long long d = 0; for (register long long i = (1); i <= (n); i++) { if (a[i] == a[i - 1]) s[i] = s[i - 1] + 1; else s[i] = 0; } f[0][0][0] = 1; for (register long long i = (1); i <= (n); i++) { if (a[i] != a[i - 1]) { for (register long long j = (0); j <= (i); j++) for (register long long k = (1); k <= (s[i - 1]); k++) pls(f[d ^ 1][j][0], f[d ^ 1][j][k]), f[d ^ 1][j][k] = 0; } for (register long long j = (0); j <= (i); j++) { long long upk = min(s[i], j); for (register long long k = (0); k <= (upk); k++) { if (j && k) pls(f[d][j][k], f[d ^ 1][j - 1][k - 1] * (2 * s[i] - k + 1) % mod); pls(f[d][j][k], f[d ^ 1][j][k] * (i - 2 * s[i] + 2 * k - j) % mod); pls(f[d][j][k], f[d ^ 1][j + 1][k] * (j - k + 1) % mod); } } memset(f[d ^ 1], 0, sizeof(f[d ^ 1])); if (i != n) d ^= 1; } printf( %lld n , f[d][0][0]); } } // namespace Solution_1 signed main() { n = read(); for (register long long i = (1); i <= (n); i++) { a[i] = read(); for (long long j = 2; j * j <= a[i]; j++) while (a[i] % (j * j) == 0) a[i] /= j * j; } sort(a + 1, a + n + 1); Solution_1::solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int poww(int a, int b) { for (int i = 0; i < b; i++) a *= a; return a; } int main() { int n, t; cin >> n; if (n < 10) { cout << n << endl; return 0; } long long i = 2; long long sum = 9; long long x = 10, v[] = {999999999, 99999999, 9999999, 999999, 99999, 9999, 999, 99, 9, 0, 0}; reverse(v, v + 11); for (int i = 10; i > 1; i--) { if (n - v[i] > 0) { sum += (n - v[i]) * i; n -= (n - v[i]); } } cout << sum << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.