func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int M = 100000 + 10; int leaf[M]; vector<int> adj[M]; int childnum[M]; void dfs(int cur, int par) { for (int i = 0; i < adj[cur].size(); i++) { int nxt = adj[cur][i]; if (nxt != par) { childnum[cur]++; dfs(nxt, cur); } } } bool ok = true; long long int coef[M]; long long int thres = 1e16 + 10; void dfs1(int cur, int par) { coef[cur] = childnum[par] * coef[par]; if (coef[cur] > thres) { ok = false; return; } for (int i = 0; i < adj[cur].size(); i++) { int nxt = adj[cur][i]; if (nxt != par) { dfs1(nxt, cur); } } } vector<int> leafnode; long long int gcd(long long int x, long long int y) { return y == 0 ? x : gcd(y, x % y); } int main() { int n; cin >> n; long long int s = 0; for (int i = 1; i <= n; i++) { cin >> leaf[i]; s = s + leaf[i]; } for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } for (int i = 2; i <= n; i++) { if (adj[i].size() == 1) { leafnode.push_back(i); } } dfs(1, 0); coef[0] = 1; childnum[0] = 1; dfs1(1, 0); long long int minv = -1; for (int i = 0; i < leafnode.size(); i++) { int curleaf = leafnode[i]; long long int x = leaf[curleaf]; long long int k = coef[curleaf]; long long int v = k * x; if (minv == -1) { minv = v; } else { minv = min(minv, v); } } if (!ok) { cout << s << endl; } else { long long int lcm = 1; for (int i = 0; i < leafnode.size(); i++) { int curleaf = leafnode[i]; long long int k = coef[curleaf]; long long int d = gcd(lcm, k); lcm = lcm * k / d; if (lcm > minv) { ok = false; break; } } if (!ok) { cout << s << endl; } else { lcm = minv / lcm * lcm; long long int ans = 0; for (int i = 0; i < leafnode.size(); i++) { int curleaf = leafnode[i]; long long int k = coef[curleaf]; long long int x = lcm / k; long long int val = leaf[curleaf] - x; ans = ans + val; } cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; cout << ((m % 2) ? m * (n / 2) + (n % 2) * (m / 2) : n * (m / 2) + (m % 2) * (n / 2)); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long a[300000]; int main() { while (cin >> n) { for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long ans = 0; for (int i = 0; i < n; i++) { int x = (i == n - 1 ? -1 : 0); ans += (x + i + 2) * a[i]; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool check(const string &str) { vector<string> vec{ ABSINTH , BEER , BRANDY , CHAMPAGNE , GIN , RUM , SAKE , TEQUILA , VODKA , WHISKEY , WINE }; for (int i = 0; i < (int)vec.size(); ++i) { if (str == vec[i]) return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int cnt = 0; for (int i = 0; i < n; ++i) { string str; cin >> str; if (isdigit(str[0])) { int num = stoi(str); if (num < 18) ++cnt; } else { if (check(str)) ++cnt; } } cout << cnt << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<vector<int> > a(n), b(m); for (int i = 0; i < n; i++) { a[i].resize(m); for (int j = 0; j < m; j++) cin >> a[i][j]; } for (int j = 0; j < m; j++) { b[j].resize(n); for (int i = 0; i < n; i++) cin >> b[j][i]; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][0] == b[j][0]) { swap(a[0], a[i]); swap(b[0], b[j]); break; } } } for (int j = 0; j < n; j++) { for (int i = 0; i < n; i++) { if (a[i][0] == b[0][j]) { for (auto x : a[i]) cout << x << ; cout << n ; break; } } } } } |
#include <bits/stdc++.h> using namespace std; int yy[100005], id; int n, m; int st[100005 * 4], lz[100005 * 4]; int a[100005]; int l[305], r[305]; inline void pu(int rt) { st[rt] = max(st[2 * rt + 1], st[2 * rt + 2]); } void pd(int rt, int l, int r, int m) { if (lz[rt]) { int t = lz[rt]; lz[2 * rt + 1] += t; lz[2 * rt + 2] += t; st[2 * rt + 1] += t; st[2 * rt + 2] += t; lz[rt] = 0; } } void build(int rt, int l, int r) { lz[rt] = 0; if (l == r) { st[rt] = a[l]; return; } int mid = (l + r) / 2; build(2 * rt + 1, l, mid); build(2 * rt + 2, mid + 1, r); pu(rt); } void ud(int rt, int l, int r, int ul, int ur, int dt) { if (l > ur || r < ul) return; if (ul <= l && r <= ur) { lz[rt] += dt; st[rt] += dt; return; } int mid = (l + r) / 2; pd(rt, l, r, mid); ud(2 * rt + 1, l, mid, ul, ur, dt), ud(2 * rt + 2, mid + 1, r, ul, ur, dt); pu(rt); } int query(int rt, int l, int r, int ql, int qr) { if (l > qr || r < ql) return -(0x3f3f3f3f); if (ql <= l && r <= qr) return st[rt]; int mid = (l + r) / 2; pd(rt, l, r, mid); return max(query(2 * rt + 1, l, mid, ql, qr), query(2 * rt + 2, mid + 1, r, ql, qr)); } void init() {} int main() { cin >> n >> m; int ans = -(0x3f3f3f3f), p = -1; int mmx = -(0x3f3f3f3f), mmn = (0x3f3f3f3f); for (int i = (1); i <= (n); i++) { scanf( %d , a + i); mmx = max(a[i], mmx), mmn = min(a[i], mmn); } if (m == 0) { printf( %d n0 , mmx - mmn); return 0; } for (int i = (0); i < (m); i++) scanf( %d%d , l + i, r + i); build(0, 1, n); for (int i = (1); i <= (n); i++) { for (int j = (0); j < (m); j++) { if (l[j] == i) { ud(0, 1, n, l[j], r[j], -1); } else if (i - 1 == r[j]) { ud(0, 1, n, l[j], r[j], 1); } } int mx = query(0, 1, n, 1, n); int nowmin = query(0, 1, n, i, i); if (mx - nowmin > ans) { ans = mx - nowmin; p = i; } } for (int i = (0); i < (m); i++) { if (p >= l[i] && p <= r[i]) { yy[id++] = i + 1; } } printf( %d n%d n , ans, id); for (int i = (0); i < (id); i++) printf( %d , yy[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 10; const int INF = 2147000000; int n, k; int a[maxn][maxn]; int b[maxn], vis[maxn]; int ans = INF; int make(int num) { int res = 0; for (int i = 1; i <= k; i++) { int c = b[i]; res = res * 10 + a[num][c]; } return res; } void solve() { int Max = -INF, Min = INF; for (int i = 1; i <= n; i++) { int res = make(i); Max = max(Max, res); Min = min(Min, res); } ans = min(ans, Max - Min); } void dfs(int cur) { if (cur == k + 1) { solve(); return; } for (int i = 1; i <= k; i++) { if (!vis[i]) { vis[i] = 1; b[cur] = i; dfs(cur + 1); vis[i] = 0; } } } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= k; j++) { char c; scanf( %c , &c); a[i][j] = c - 0 ; } } memset(vis, 0, sizeof(vis)); dfs(1); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int m, n, arr[2000][2000], temp[2000][2000]; char ctrl(int i) { for (int j = 1; j <= n; j++) if (arr[i][j] and arr[i][j] != temp[i][j]) return 0; return 1; } char solve(int a, int b, int c, int d, int ttt = 0) { if (ttt) ttt = 3; for (int i = 1; i <= m; i++) { if (i & 1) { for (int j = 1; j <= n; j++) if (j & 1) temp[i][j] = a; else temp[i][j] = b; if (ctrl(i)) continue; for (int j = 1; j <= n; j++) if (j & 1) temp[i][j] = b; else temp[i][j] = a; if (ctrl(i)) continue; return 0; } else { for (int j = 1; j <= n; j++) if (j & 1) temp[i][j] = c; else temp[i][j] = d; if (ctrl(i)) continue; for (int j = 1; j <= n; j++) if (j & 1) temp[i][j] = d; else temp[i][j] = c; if (ctrl(i)) continue; return 0; } } while (ttt--) { for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) arr[j][m - i + 1] = temp[i][j]; swap(m, n); for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) temp[i][j] = arr[i][j]; } for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) cout << temp[i][j]; cout << endl; } return 1; } int main() { ios_base::sync_with_stdio(false); cin >> m >> n; char c; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { cin >> c; arr[i][j] = c - 0 ; } if (solve(1, 2, 3, 4)) return 0; if (solve(1, 3, 2, 4)) return 0; if (solve(1, 4, 2, 3)) return 0; if (solve(2, 3, 1, 4)) return 0; if (solve(2, 4, 1, 3)) return 0; if (solve(3, 4, 1, 2)) return 0; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) temp[j][m - i + 1] = arr[i][j]; swap(m, n); for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) arr[i][j] = temp[i][j]; if (solve(1, 2, 3, 4, 1)) return 0; if (solve(1, 3, 2, 4, 1)) return 0; if (solve(1, 4, 2, 3, 1)) return 0; if (solve(2, 3, 1, 4, 1)) return 0; if (solve(2, 4, 1, 3, 1)) return 0; if (solve(3, 4, 1, 2, 1)) return 0; cout << 0 << endl; } |
#include <bits/stdc++.h> using namespace std; struct Data { int r, c, v; bool operator<(const Data &r) const { return v < r.v; } }; vector<vector<int> > mat, ans; Data sorteds[1001000]; int mR[1001000], mC[1001000]; map<pair<int, int>, vector<int> > mr, mc; void recursiveFix(int rr, int cc) { vector<int> &vv = mr[pair<int, int>(rr, mat[rr][cc])]; vector<int> t = vv; for (int j = int(0); j < int(vv.size()); j++) { ans[rr][vv[j]] = ans[rr][cc]; } vv.clear(); vector<int> &vv2 = mc[pair<int, int>(cc, mat[rr][cc])]; vector<int> t2 = vv2; for (int j = int(0); j < int(vv2.size()); j++) { ans[vv2[j]][cc] = ans[rr][cc]; } vv2.clear(); for (int j = int(0); j < int(t2.size()); j++) recursiveFix(t2[j], cc); for (int j = int(0); j < int(t.size()); j++) recursiveFix(rr, t[j]); } int main() { int N, M; while (scanf( %d %d , &N, &M) != EOF) { int c = 0; vector<int> t(M + 1); mr.clear(), mc.clear(); mat.clear(); ans.clear(); mat.push_back(t); ans.push_back(t); for (int i = int(1); i < int(N + 1); i++) { mat.push_back(t); ans.push_back(t); for (int j = int(1); j < int(M + 1); j++) { scanf( %d , &mat[i][j]); sorteds[c++] = Data{i, j, mat[i][j]}; ans[i][j] = 1; mr[pair<int, int>(i, mat[i][j])].push_back(j); mc[pair<int, int>(j, mat[i][j])].push_back(i); } } sort(sorteds, sorteds + c); memset(mR, 0, sizeof(mR)); memset(mC, 0, sizeof(mC)); int prev = -1; priority_queue<Data> q; for (int i = int(0); i < int(c); i++) { if (prev != sorteds[i].v) { while (!q.empty()) { int rr = q.top().r, cc = q.top().c; recursiveFix(rr, cc); q.pop(); } } int r = sorteds[i].r, c = sorteds[i].c; ans[r][c] = 0; if (mat[r][mR[r]] == mat[r][c]) ans[r][c] = max(ans[r][c], ans[r][mR[r]]); else ans[r][c] = max(ans[r][c], ans[r][mR[r]] + 1); if (mat[mC[c]][c] == mat[r][c]) ans[r][c] = max(ans[r][c], ans[mC[c]][c]); else ans[r][c] = max(ans[r][c], ans[mC[c]][c] + 1); q.push(Data{r, c, ans[r][c]}); mR[r] = c; mC[c] = r; prev = sorteds[i].v; } while (!q.empty()) { int rr = q.top().r, cc = q.top().c; recursiveFix(rr, cc); q.pop(); } for (int i = int(0); i < int(N); i++) { for (int j = int(0); j < int(M); j++) printf( %d%c , ans[i + 1][j + 1], n [j == M - 1]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct EDGE { EDGE(int _v, int _cap, int _edgeidx) : v(_v), cap(_cap), edgeidx(_edgeidx) {} int v; int cap; int edgeidx; }; int DEBUG = 0; const int MAXN = 200001; vector<EDGE> edge[MAXN]; int in[MAXN], total[MAXN], dir[MAXN]; int mark[MAXN]; int main(int argc, char **argv) { DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; int n, m; cin >> n >> m; memset(total, 0, sizeof(total)); memset(in, 0, sizeof(in)); memset(mark, 0, sizeof(mark)); for (int i = 1; i <= m; i++) { int a, b, c; cin >> a >> b >> c; edge[a].push_back(EDGE(b, c, i)); edge[b].push_back(EDGE(a, c, -i)); total[a] += c; total[b] += c; } if (DEBUG) { for (int i = 1; i <= m; i++) { printf( total[%d]= %d , i, total[i]); } printf( n ); } queue<int> que; mark[1] = 1; que.push(1); while (!que.empty()) { int u = que.front(); que.pop(); mark[u] = 1; if (DEBUG) { printf( nu= %d n , u); } for (int i = 0; i < edge[u].size(); i++) { int edgeidx = edge[u][i].edgeidx; int v = edge[u][i].v; int cap = edge[u][i].cap; if (DEBUG) { printf( u= %d, v= %d, edgeidx= %d, cap= %d, mark[%d]= %d n , u, v, edgeidx, cap, v, mark[v]); } if (mark[v] == 0) { in[v] += cap; if (total[v] == 2 * in[v] && v != n) { if (DEBUG) { printf( que.push(%d) n , v); } que.push(v); } dir[abs(edgeidx)] = ((edgeidx < 0) ? 1 : 0); } } if (DEBUG) { printf( que.size()= %d n , que.size()); } } for (int i = 1; i <= m; i++) { cout << dir[i] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1.0e-8; const int maxn = 1e6 + 10; const int maxm = 300; const int turn[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; long long mod = 1e9 + 7; vector<int> tree[10005]; int ans[10005]; int anser = 0; void dfs(int x, int pre, int c) { int cur = c; if (c != ans[x]) { anser++, cur = ans[x]; } int len = tree[x].size(); for (int i = 0; i < len; i++) { int to = tree[x][i]; if (to == pre) { continue; } dfs(to, x, cur); } } int main() { int n; int now; cin >> n; for (int i = 2; i <= n; i++) { cin >> now; tree[now].push_back(i); tree[i].push_back(now); } for (int i = 1; i <= n; i++) { cin >> ans[i]; } dfs(1, 0, 0); cout << anser << endl; } |
#include <bits/stdc++.h> clock_t t = clock(); namespace my_std { using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <typename T> inline T rnd(T l, T r) { return uniform_int_distribution<T>(l, r)(rng); } template <typename T> inline bool chkmax(T &x, T y) { return x < y ? x = y, 1 : 0; } template <typename T> inline bool chkmin(T &x, T y) { return x > y ? x = y, 1 : 0; } template <typename T> inline void read(T &t) { t = 0; char f = 0, ch = getchar(); double d = 0.1; while (ch > 9 || ch < 0 ) f |= (ch == - ), ch = getchar(); while (ch <= 9 && ch >= 0 ) t = t * 10 + ch - 48, ch = getchar(); if (ch == . ) { ch = getchar(); while (ch <= 9 && ch >= 0 ) t += d * (ch ^ 48), d *= 0.1, ch = getchar(); } t = (f ? -t : t); } template <typename T, typename... Args> inline void read(T &t, Args &...args) { read(t); read(args...); } char __sr[1 << 21], __z[20]; int __C = -1, __zz = 0; inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; } inline void print(register int x) { if (__C > 1 << 20) Ot(); if (x < 0) __sr[++__C] = - , x = -x; while (__z[++__zz] = x % 10 + 48, x /= 10) ; while (__sr[++__C] = __z[__zz], --__zz) ; __sr[++__C] = n ; } void file() {} inline void chktime() {} long long ksm(long long x, int y) { long long ret = 1; for (; y; y >>= 1, x = x * x) if (y & 1) ret = ret * x; return ret; } } // namespace my_std using namespace my_std; int n; int a[505050]; namespace BIT { int tr[505050]; void add(int x, int w) { ++x; x = n - x + 2; while (x <= n + 1) chkmax(tr[x], w), x += x & -x; } int query(int x) { ++x; x = n - x + 2; int res = -1e9; while (x) chkmax(res, tr[x]), x -= x & -x; return res; } void clear() { for (int i = (1); i <= (n + 1); i++) tr[i] = -1e9; } } // namespace BIT struct hh { int k; long long b; int l, r; const int q(long long x) const { x = x * k + b; return max(1ll * l, min(x, 1ll * r)); } const hh operator+(const hh &x) const { hh res; res.k = k * x.k, res.b = b * x.k + x.b; long long L = x.q(l), R = x.q(r); if (L > R) swap(L, R); res.l = L, res.r = R; return res; } }; struct hhh { hh a, b; int tp; const hhh operator+(const hhh &x) { return tp ? (hhh){a + x.b, b + x.a, x.tp ^ 1} : (hhh){a + x.a, b + x.b, x.tp}; } pair<long long, long long> q(long long l, long long r) { return tp ? make_pair(b.q(r), a.q(l)) : make_pair(a.q(l), b.q(r)); } }; hhh tr[505050 << 2]; void pushup(int k) { tr[k] = tr[k << 1 | 1] + tr[k << 1]; } void build(int k, int l, int r) { if (l == r) return tr[k] = (hhh){(hh){-1, a[l], 0, a[l] - 1}, (hh){-1, a[l], 1, a[l]}, 1}, void(); int mid = (l + r) >> 1; build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r), pushup(k); } int query(int k, int l, int r, int x, long long &L, long long &R) { if (r <= x) { pair<long long, long long> xx = tr[k].q(L, R); if (xx.first <= xx.second) return tie(L, R) = xx, l; if (l == r) return L = R = -1, l + 1; int mid = (l + r) >> 1; int res = query(k << 1 | 1, mid + 1, r, x, L, R); return L == -1 ? res : query(k << 1, l, mid, x, L, R); } int mid = (l + r) >> 1; if (x <= mid) return query(k << 1, l, mid, x, L, R); int res = query(k << 1 | 1, mid + 1, r, x, L, R); return L == -1 ? res : query(k << 1, l, mid, x, L, R); } int qL(int x, long long l, long long r) { return query(1, 1, n, x, l, r); } int dp[505050]; namespace Q2 { long long dB; int tp; map<long long, int> w; multiset<int> s; void clear() { dB = 0, tp = 1; w.clear(), s.clear(); } void insert(long long B, int W) { B = (B - dB) * tp; if (w.find(B) == w.end()) w[B] = W, s.insert(W); else if (w[B] < W) s.erase(s.find(w[B])), s.insert(W), w[B] = W; } void maintain(long long a) { tp *= -1, dB = a - dB; for (auto it = w.begin(); it != w.end();) { long long b = it->first * tp + dB; if (b < 1 || b >= a) s.erase(s.find(it->second)), w.erase(it++); else break; } int c = 0; for (auto it = w.rbegin(); it != w.rend();) { long long b = it->first * tp + dB; if (b < 1 || b >= a) s.erase(s.find(it->second)), it++, c++; else break; } while (c--) w.erase(prev(w.end())); } void add(long long B) { B = (B - dB) * tp; auto it = w.find(B); if (it == w.end()) return; s.erase(s.find(it->second)), s.insert(it->second + 1); ++w[B]; } int mx() { return s.size() ? *(s.rbegin()) : -1e9; } } // namespace Q2 void work() { read(n); for (int i = (1); i <= (n); i++) read(a[i]); BIT::clear(); Q2::clear(); BIT::add(0, 0); build(1, 1, n); for (int i = (1); i <= (n); i++) { int p = qL(i, 1, a[i] - 1); dp[i] = BIT::query(p - 1) + i - 1; Q2::maintain(a[i]); if (a[i] % 2 == 0) Q2::add(a[i] / 2); chkmax(dp[i], Q2::mx() + i - 1); if (a[i] % 2 == 0) { p = qL(i, a[i] / 2, a[i] / 2); int w = BIT::query(p - 1) + 1; chkmax(dp[i], w + i - 1); Q2::insert(a[i] / 2, w); } BIT::add(i, dp[i] - i); } print(n + n - dp[n]); } int main() { file(); int T; read(T); while (T--) work(); Ot(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int hell = 1000000007; void solve() { long long int n, m; cin >> n >> m; vector<long long int> used(3 * n + 5, 0); vector<long long int> mx; long long int ctr = 1; for (long long int i = 1; i <= m; i++) { long long int u, v; cin >> u >> v; if (!used[u] and !used[v]) { mx.push_back(i); used[u] = used[v] = 1; } } if ((long long int)((mx).size()) >= n) { cout << Matching n ; for (long long int i = 0; i < n; i++) cout << mx[i] << ; cout << n ; } else { cout << IndSet n ; long long int ctr = n; for (long long int i = 1; i <= 3 * n; i++) { if (!used[i]) { cout << i << ; ctr--; } if (!ctr) break; } cout << n ; } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t; cin >> t; for (long long int i = 0; i < t; i++) solve(); cerr << Time elapsed : << clock() * 1000.0 / CLOCKS_PER_SEC << ms << n ; } |
#include <bits/stdc++.h> using namespace std; int n; vector<long long> S; vector<int> N, L, R; vector<bool> E; pair<long long, pair<int, int>> merge(int l, int r, int mid, pair<long long, pair<int, int>> L, pair<long long, pair<int, int>> R) { int ll = L.second.first, lr = L.second.second; int rl = R.second.first, rr = R.second.second; long long ls = L.first, rs = R.first; long long sum = ls + rs; int lw = ll, rw = rr; int lLength = mid - l + 1, rLength = r - (mid + 1) + 1; if (lr && rl && N[mid + 1] >= N[mid]) { if (ll == lLength) lw += rl; if (rr == rLength) rw += lr; if (ll != lLength && rl != rLength) sum += (long long)(lr + rl) * (lr + rl - 1) / 2; } else { if (ll != lLength) sum += (long long)(lr) * (lr - 1) / 2; if (rr != rLength) sum += (long long)(rl) * (rl - 1) / 2; } return {sum, {lw, rw}}; } pair<long long, pair<int, int>> getVal(int lq, int rq, int l = 0, int r = n - 1, int index = 0) { if (l == r) return {0, {1, 1}}; if (lq == l && rq == r && E[index]) return {S[index], {L[index], R[index]}}; int mid = (l + r) >> 1; if (rq <= mid) { return getVal(lq, rq, l, mid, 2 * index + 1); } else if (lq > mid) { return getVal(lq, rq, mid + 1, r, 2 * index + 2); } auto lv = getVal(lq, mid, l, mid, 2 * index + 1); auto rv = getVal(mid + 1, rq, mid + 1, r, 2 * index + 2); auto ret = merge(lq, rq, mid, lv, rv); if (l == lq && r == rq) { E[index] = true; S[index] = ret.first, L[index] = ret.second.first, R[index] = ret.second.second; } return ret; } void update(int lq, int rq, int l = 0, int r = n - 1, int index = 0) { if (l == r) return; E[index] = false; int mid = (l + r) >> 1; if (rq <= mid) { return update(lq, rq, l, mid, 2 * index + 1); } else if (lq > mid) { return update(lq, rq, mid + 1, r, 2 * index + 2); } update(lq, mid, l, mid, 2 * index + 1); update(mid + 1, rq, mid + 1, r, 2 * index + 2); return; } int main() { ios::sync_with_stdio(0); cin.tie(0); int q; cin >> n >> q; N = vector<int>(n); S = vector<long long>(4 * n + 1); L = R = vector<int>(4 * n + 1); E = vector<bool>(4 * n + 1, false); for (auto &it : N) cin >> it; int cmd, x, y; for (int qq = 0; qq < q; qq++) { cin >> cmd >> x >> y; if (cmd == 1) { N[x - 1] = y; update(x - 1, x - 1); } else { x--, y--; auto res = getVal(x, y); auto sum = res.first; int l = res.second.first, r = res.second.second; if (l == (y - x + 1)) sum += (long long)(l) * (l - 1) / 2; else sum += ((long long)(l) * (l - 1) + (long long)(r) * (r - 1)) / 2; sum += (y - x + 1); cout << sum << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 505; int n, in[N], out[N], w[N], s[N], v[N]; vector<int> st[N << 1]; int f1[N][N << 1], f2[N][N << 1]; int dfs(int x, int S) { if (S < 0) return 0; if (~f1[x][S]) return f1[x][S]; f2[x][out[x] + 1] = 0; for (int i = out[x]; i >= in[x]; i--) { f2[x][i] = f2[x][i + 1]; for (int j = 0; j < st[i].size(); j++) { int p = st[i][j]; if (out[p] > out[x] || p == x) continue; f2[x][i] = max(f2[x][i], dfs(p, min(S - w[p], s[p])) + f2[x][out[p]]); } } return f1[x][S] = f2[x][in[x]] + v[x]; } int main() { int S; scanf( %d%d , &n, &S); for (int i = 1; i <= n; i++) { scanf( %d%d%d%d%d , &in[i], &out[i], &w[i], &s[i], &v[i]); st[in[i]].push_back(i); } memset(f1, -1, sizeof f1); in[0] = 0; out[0] = 2 * n + 1; printf( %d n , dfs(0, S)); return 0; } |
#include <bits/stdc++.h> using namespace std; void fr(int &a, bool f = 0, char ch = getchar()) { for (a = 0; ch < 0 || ch > 9 ; ch = getchar()) ch == - ? f = 1 : 0; for (; ch >= 0 && ch <= 9 ; ch = getchar()) a = a * 10 + ch - 0 ; a = f ? -a : a; } int fr() { int a; return fr(a), a; } const int N = 12; int arr[(1 << N) + 10], a[(1 << N) + 10], ans[(1 << N) + 10], p[(1 << N) + 10]; int tmp[(1 << N) + 10]; bool visval[(1 << N) + 10], vispos[(1 << N) + 10]; struct OI { int RP, score; } CSPS2021, NOIP2021; int main() { CSPS2021.RP++, CSPS2021.score++, NOIP2021.RP++, NOIP2021.score++, 392699; srand(time(0)); int n = fr(), xsum = 0, tot = 1 << n; for (int i = 0; i < (1 << n); i++) fr(a[i]), xsum ^= a[i], arr[i] = i; if (xsum) return puts( Fou ), 0; puts( Shi ); for (int i = 0; i < (1 << n); i++) { int pos = rand() % tot, arrpos = arr[pos]; if (pos != tot - 1) arr[pos] = arr[tot - 1]; tot--, tmp[0] = 0; bool flag = 0; for (int j = 0; j < (1 << n); j++) if (vispos[j] == 0 && visval[arrpos ^ a[j]] == 0) { flag = visval[arrpos ^ a[j]] = vispos[j] = 1, ans[j] = arrpos, p[arrpos ^ a[j]] = j; break; } else if (vispos[j] == 0) tmp[++tmp[0]] = j; if (flag == 0) { int j = tmp[rand() % tmp[0] + 1]; vispos[p[arrpos ^ a[j]]] = 0; arr[tot++] = ans[p[arrpos ^ a[j]]], ans[j] = arrpos; vispos[j] = 1; visval[ans[j] ^ a[j]] = 1; p[ans[j] ^ a[j]] = j; i--; } } for (int i = 0; i < (1 << n); i++) printf( %d , ans[i] ^ a[i]); puts( ); for (int i = 0; i < (1 << n); i++) printf( %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int ans[2020], cnt = 0, k; int main() { cin >> k; k++; ans[++cnt] = -1; while (k >= 1e6 - 1) { k -= 1e6 - 1; ans[++cnt] = 1e6 - 1 + 1; } ans[++cnt] = k + 1; cout << cnt << endl; for (int i = 1; i <= cnt; i++) cout << ans[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long f = 0, j, q = 1, i, n; while (q--) { long long y, k = 1, x, M, s; cin >> n >> M >> s >> f; unordered_map<int, pair<int, int> > m; for (i = 0; i < M; i++) { long long X, Y, Z; cin >> X >> Y >> Z; m.insert(make_pair(X, make_pair(Y, Z))); } if (s < f) { while (s != f) { if (m.count(k)) { if ((s >= m[k].first && s <= m[k].second) || (s + 1 >= m[k].first && s + 1 <= m[k].second)) cout << X ; else { cout << R ; s++; } } else { cout << R ; s++; } k++; } } else { while (s != f) { if (m.count(k)) { if ((s >= m[k].first && s <= m[k].second) || (s - 1 >= m[k].first && s - 1 <= m[k].second)) cout << X ; else { cout << L ; s--; } } else { cout << L ; s--; } k++; } } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { string ch1, ch2, ch3; getline(cin, ch1); getline(cin, ch2); for (int s = 0; s < ch1.size(); s++) { if (ch1[s] != ch2[s]) { ch3 += 1 ; } else { ch3 += 0 ; } } cout << ch3 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long n, k; cin >> n >> k; long long l = 0; long long r = n; while (l != r) { long long mid = (l + r) / 2; if (mid * (mid + 1) / 2 - (n - mid) < k) l = mid + 1; else r = mid; } cout << n - l; return 0; } |
#include <bits/stdc++.h> using namespace std; struct Solve { bool mark[(int)(3e5 + 10)]; vector<pair<int, int>> ed[(int)(3e5 + 10)]; vector<int> mtch; int n, m, T; void go() { T = 0; input(); find_mx_match(); if (T >= 2 * n) prnt_match(); else prnt_ind(); } void input() { cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--, v--; ed[u].push_back({v, i + 1}); ed[v].push_back({u, i + 1}); } } void find_mx_match() { for (int i = 0; i < 3 * n; i++) { if (mark[i]) continue; for (auto x : ed[i]) { if (mark[x.first]) continue; mark[x.first] = mark[i] = true; mtch.push_back(x.second); T += 2; break; } } } void prnt_match() { cout << Matching n ; int I = 0; for (auto x : mtch) { if (I == n) break; cout << x << ; I++; } cout << endl; } void prnt_ind() { cout << IndSet n ; for (int I = 0, J = 0; I < 3 * n && J < n; I++) { if (!mark[I]) { cout << I + 1 << ; J++; } } cout << endl; } void clear() { T = 0; for (int i = 0; i < 3 * n; i++) mark[i] = false; for (int i = 0; i < 3 * n; i++) ed[i].clear(); n = -1, m = -1; mtch.clear(); } } S; int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); int T; cin >> T; while (T--) { S.go(); S.clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long t; cin >> t; while (t--) { long long n, x, m, i, flag = 0, a, b, l, r, sum = 2, ones = 0, zero = 0, output = 0, j; vector<pair<long long, long long> > v; cin >> n >> m; long long arr[n + 1][m + 1]; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { cin >> arr[i][j]; } } a = 0; sum = 2; flag = 0; while (flag == 0) { for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if ((i + j == sum) || (i + j == n + m - a)) v.push_back(make_pair(i, j)); } } while (v.size() > 0) { i = v[v.size() - 1].first; j = v[v.size() - 1].second; if (arr[i][j] == 0) zero++; else ones++; v.pop_back(); } output = output + min(zero, ones); zero = 0; ones = 0; a++; sum++; if (sum == n + m - a) break; else if (sum > (n + m - a)) break; } cout << output << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int c, m, x; cin >> c >> m >> x; long long int y = c + m + x; y = y / 3; long long int ans = 0; if (c >= 1 && m >= 1) { long long int v = min(c, m); ans = min(v, y); } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; struct Edge { int t, next; Edge() {} Edge(int a, int b) : t(a), next(b) {} }; Edge e[200005]; int head[100005]; vector<int> g[100005]; queue<int> bel[100005]; int d[100005], scc_cnt; namespace Graph { int dfn[100005], low[100005], dfs_cnt; int st[100005], top; bool in[100005]; int id[100005]; void dfs(int x) { dfn[x] = low[x] = ++dfs_cnt; st[++top] = x; in[x] = 1; for (int i = head[x]; i; i = e[i].next) { int u = e[i].t; if (!dfn[u]) { dfs(u); low[x] = min(low[x], low[u]); } else if (in[u]) low[x] = min(low[x], dfn[u]); } if (low[x] >= dfn[x]) { scc_cnt++; int t; do { t = st[top--]; in[t] = 0; id[t] = scc_cnt; bel[scc_cnt].push(t); } while (t != x); } } void build(int n) { for (int i = 1; i <= n; i++) if (!dfn[i]) dfs(i); for (int i = 1; i <= n; i++) for (int j = head[i]; j; j = e[j].next) if (id[i] != id[e[j].t]) { int u = id[i], v = id[e[j].t]; g[u].push_back(v); d[v]++; } } } // namespace Graph bool ask(int x, int y) { printf( ? %d %d n , x, y); fflush(stdout); scanf( %d , &x); return x; } queue<int> q; void erase(int x) { for (int i = 0; i < g[x].size(); i++) { int u = g[x][i]; d[u]--; if (!d[u]) q.push(u); } } int solve(int n) { int ans = 0; for (int i = 1; i <= scc_cnt; i++) if (!d[i]) { if (!ans) ans = bel[i].front(); else q.push(i); } while (!q.empty()) { int t = q.front(), x = bel[t].front(); if (ask(ans, x)) { bel[t].pop(); if (!bel[t].size()) { erase(t); q.pop(); } } else { int p = Graph::id[ans]; bel[p].pop(); if (!bel[p].size()) erase(p); else q.push(p); ans = x; q.pop(); } } return ans; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); e[i] = Edge(y, head[x]); head[x] = i; } Graph::build(n); printf( ! %d n , solve(n)); return 0; } |
#include <bits/stdc++.h> using namespace std; int d[66000], s[66000]; int que[66000]; bool f[66000]; int n, m; vector<pair<int, int> > res; int biton(int x, int k) { return (x | (1 << k)); } int Minus(int x, int y) { int z = 0; for (int i = 0; i < 17; i++) { int u = ((x >> i) & 1); int v = ((y >> i) & 1); if (u != v) z = biton(z, i); } return z; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >> d[i] >> s[i]; for (int i = 0; i < n; i++) if (d[i] == 1) { f[i] = true; m++; que[m] = i; } while (m > 0) { int u = que[m]; if (d[u] == 0) { m--; continue; } int v = s[u]; res.push_back(make_pair(u, v)); s[v] = Minus(s[v], u); d[v]--; m--; if (d[v] == 1 && f[v] == false) { f[v] = true; m++; que[m] = v; } } cout << res.size() << n ; for (int i = 0; i < res.size(); i++) cout << res[i].first << << res[i].second << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200005]; int main() { int t; cin >> t; while (t--) { memset(a, 0, sizeof(a)); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); if (a[0] != a[n - 1]) { printf( 1 n ); } else { printf( %d n , n); } } return 0; } |
#include <bits/stdc++.h> using namespace std; void _fill_int(int* p, int val, int rep) { int i; for (i = 0; i < rep; i++) p[i] = val; } signed long long GETi() { signed long long i; scanf( %lld , &i); return i; } int N, M; int A[10000], B[10000]; int T[4][10000]; void solve() { int f, i, j, k, l, x, y; cin >> N >> M; for (i = 0; i < N; i++) A[i] = 1 << 29; for (i = 0; i < M; i++) { cin >> T[0][i] >> T[1][i] >> T[2][i] >> T[3][i]; T[1][i]--; T[2][i]--; } for (i = M - 1; i >= 0; i--) { if (T[0][i] == 1) { for (j = T[1][i]; j <= T[2][i]; j++) A[j] -= T[3][i]; } else { for (j = T[1][i]; j <= T[2][i]; j++) A[j] = min(A[j], T[3][i]); } } int ng = 0; memmove(B, A, sizeof(A)); for (i = 0; i < M; i++) { int y = -1 << 29; if (T[0][i] == 1) for (j = T[1][i]; j <= T[2][i]; j++) B[j] += T[3][i]; else { for (j = T[1][i]; j <= T[2][i]; j++) y = max(y, B[j]); if (y != T[3][i]) ng = 1; } } if (ng) (void)printf( NO n ); else { (void)printf( YES n ); for (i = 0; i < N; i++) (void)printf( %d , A[i]); (void)printf( n ); } } int main(int argc, char** argv) { if (argc > 1) freopen(argv[1], r , stdin); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, t; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> t; while (t--) { cin >> n; if (n == 1) { cout << -1 << endl; continue; } string ans = 2 ; for (int i = 1; i < n; i++) ans += 3 ; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int MinDist(int n, int k, const string& s) { int first_cow_pos = 0; while (first_cow_pos < n && s[first_cow_pos] == 1 ) { ++first_cow_pos; } int last_cow_pos = first_cow_pos; int rooms = 1; while (rooms < k + 1) { ++last_cow_pos; if (s[last_cow_pos] == 0 ) { ++rooms; } } int farmer_pos = first_cow_pos; int delta = last_cow_pos - first_cow_pos; for (int i = first_cow_pos + 1; i <= last_cow_pos; ++i) { if (s[i] == 0 && i - first_cow_pos < delta && last_cow_pos - i < delta) { delta = max(i - first_cow_pos, last_cow_pos - i); farmer_pos = i; } } --rooms; for (++first_cow_pos; first_cow_pos < n; ++first_cow_pos) { if (s[first_cow_pos] == 1 ) { continue; } while (rooms < k + 1 && last_cow_pos < n) { ++last_cow_pos; if (last_cow_pos == n) { break; } if (s[last_cow_pos] == 0 ) { ++rooms; } } if (last_cow_pos == n) { break; } int npos = max(farmer_pos, first_cow_pos); int cur_delta = max(farmer_pos - first_cow_pos, last_cow_pos - farmer_pos); while (npos < last_cow_pos) { ++npos; if (s[npos] == 1 ) { continue; } if (npos - first_cow_pos < cur_delta && last_cow_pos - npos < cur_delta) { cur_delta = max(npos - first_cow_pos, last_cow_pos - npos); farmer_pos = npos; } else if (npos - first_cow_pos >= cur_delta) { break; } } delta = min(delta, cur_delta); --rooms; } return delta; } int MinDistSlow(int n, int k, const string& s) { int result = n; for (int fcp = 0; fcp < n; ++fcp) { if (s[fcp] == 1 ) { continue; } int lcp = fcp; int rooms = 1; while (rooms < k + 1 && lcp < n) { ++lcp; if (lcp == n) { break; } if (s[lcp] == 0 ) { ++rooms; } } if (lcp == n) { break; } for (int fp = fcp; fp <= lcp; ++fp) { if (s[fp] == 1 ) { continue; } int delta = max(fp - fcp, lcp - fp); if (delta < result) { result = delta; } } } return result; } int main() { int n, k; cin >> n >> k; string s; char buffer[1000000]; scanf( %s , buffer); s = buffer; int delta = MinDist(n, k, s); cout << delta << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const long long INF = 1e18; long long n, sum, ans; long long a[200010]; struct BIT { long long tree[600010]; BIT() { memset(tree, 0, sizeof(tree)); } void update(long long i, long long x) { while (i <= 600000) { tree[i] += x; i += i & -i; } } long long sum(long long i) { long long ret = 0; while (i) { ret += tree[i]; i -= i & -i; } return ret; } } t1, t2; int main() { ios::sync_with_stdio(false); cin.tie(0); ; cin >> n; for (long long i = 1; i <= n; i++) { cin >> a[i]; ans += (i - 1) * a[i] - t1.sum(a[i]); long long x = sum; for (long long j = a[i]; j <= 300000; j += a[i]) { t1.update(j, a[i]); x -= (j / a[i]) * a[i] * (t2.sum(j + a[i] - 1) - t2.sum(j - 1)); } ans += x; sum += a[i]; t2.update(a[i], 1); cout << ans << ; } } |
#include <bits/stdc++.h> using namespace std; struct city_t : array<bitset<99>, 4> { int n, k, m, p; city_t() { cin >> n >> k, m = n / 2, p = n - 2; } void hotel(int i, int j) { if (!(*this)[i][j] && k > 0) (*this)[i][j] = true, k--; } void solve() { if (k % 2) hotel(1, m); for (int i = 1; i < 3 && k > 0; i++) for (int u = 1, v = p; v > u && k > 0; u++, v--) hotel(i, u), hotel(i, v); hotel(1, m), hotel(2, m); } void write() { cout << YES ; for (int i = 0; i < 4; i++) { cout << n ; for (int j = 0; j < n; j++) if ((*this)[i][j]) cout << # ; else cout << . ; } } }; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); city_t city; city.solve(), city.write(); } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void smin(T &a, T b) { if (a > b) a = b; } template <class T> inline void smax(T &a, T b) { if (a < b) a = b; } int V, E, src, tar; int head[60000], work[60000], dis[60000]; int to[2000000], cap[2000000], nxt[2000000]; int q[60000], qf, qb; void init(int n) { memset(head, -1, sizeof(int) * n); V = n; E = 0; } void add_edge(int u, int v, int c) { to[E] = v; cap[E] = c; nxt[E] = head[u]; head[u] = E++; to[E] = u; cap[E] = 0; nxt[E] = head[v]; head[v] = E++; } bool bfs() { memset(dis, -1, sizeof(dis)); qf = qb = 0; q[qb++] = src; dis[src] = 0; while (qf < qb && dis[tar] == -1) { int u = q[qf++]; for (int i = head[u]; i >= 0; i = nxt[i]) { int v = to[i]; if (dis[v] == -1 && cap[i] > 0) { dis[v] = dis[u] + 1; q[qb++] = v; } } } return dis[tar] >= 0; } int dfs(int u, int &bot) { int v, bot1, delta; if (u == tar) return bot; for (int &i = work[u]; i >= 0; i = nxt[i]) { v = to[i]; if (dis[v] != dis[u] + 1 || cap[i] == 0) continue; bot1 = min(bot, cap[i]); if (delta = dfs(v, bot1)) { cap[i] -= delta; cap[i ^ 1] += delta; bot = bot1; return delta; } } return 0; } int dinic() { int ans = 0, delta, bot; while (bfs()) { memcpy(work, head, sizeof(int) * V); delta = 0x3f3f3f3f; while (delta = dfs(src, bot = 0x3f3f3f3f)) ans += delta; } return ans; } int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1}; int n, m, dst[33][33][33][33]; char grid[33][33]; int c[2], x[2][33 * 33], y[2][33 * 33], t[2][33 * 33]; bool can(long long mid) { int A = c[0], nm = n * m; src = A * 2 + 2 * nm, tar = src + 1; init(tar + 10); for (int i = (0); i < (A); i++) add_edge(src, i, 1); for (int i = (0); i < (A); i++) add_edge(A + 2 * nm + i, tar, 1); for (int i = (0); i < (nm); i++) add_edge(A + i, A + nm + i, 1); for (int r = (0); r < (2); r++) for (int k = (0); k < (A); k++) for (int i = (0); i < (n); i++) for (int j = (0); j < (m); j++) { if (grid[i][j] == # ) continue; int xx = x[r][k], yy = y[r][k], tt = t[r][k]; if (dst[xx][yy][i][j] < 1000 && (long long)dst[xx][yy][i][j] * tt <= mid) { if (!r) add_edge(k, A + i * m + j, 1); else add_edge(A + nm + i * m + j, k + A + 2 * nm, 1); } } return dinic() == A; } int main() { ; scanf( %d%d%d%d , &n, &m, &c[0], &c[1]); for (int i = (0); i < (n); i++) scanf( %s , grid[i]); int u, v, w; scanf( %d%d%d , &u, &v, &w); u--; v--; for (int i = (0); i < (2); i++) for (int j = (0); j < (c[i]); j++) { scanf( %d%d%d , &x[i][j], &y[i][j], &t[i][j]); x[i][j]--; y[i][j]--; } if (c[0] < c[1]) { x[0][c[0]] = u; y[0][c[0]] = v; t[0][c[0]++] = w; } else { x[1][c[1]] = u; y[1][c[1]] = v; t[1][c[1]++] = w; } if (c[0] != c[1]) { puts( -1 ); return 0; } memset(dst, 0x3f, sizeof(dst)); for (int i = (0); i < (n); i++) for (int j = (0); j < (m); j++) { if (grid[i][j] == # ) continue; qb = qf = 0; q[qb++] = i; q[qb++] = j; dst[i][j][i][j] = 0; while (qb > qf) { u = q[qf++]; v = q[qf++]; for (int k = (0); k < (4); k++) { int uu = u + dx[k], vv = v + dy[k]; if ((uu < 0 || vv < 0 || uu >= n || vv >= m)) continue; if (grid[uu][vv] == # ) continue; if (dst[i][j][uu][vv] > dst[i][j][u][v] + 1) { dst[i][j][uu][vv] = dst[i][j][u][v] + 1; q[qb++] = uu; q[qb++] = vv; } } } } long long st = -1, ed = (1LL << 40), mid; while (st + 1 < ed) { mid = (st + ed) >> 1; if (can(mid)) ed = mid; else st = mid; } if (ed == (1LL << 40)) puts( -1 ); else printf( %I64d n , ed); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, k, x, y, z; int main() { cin >> n >> k >> m; if (m <= k) cout << m << endl; else if (m <= n) cout << k << endl; else { long long tmp = n + k; cout << tmp - m << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> E[3010]; int mark[3010]; int c, f; bool find(int i, int p) { if (mark[i] == 1) { c = i; f = 1; return true; } mark[i] = 1; for (vector<int>::iterator to = E[i].begin(); to < E[i].end(); to++) { if (*to != p && find(*to, i)) { if (f) mark[i] = 2; if (i == c) f = 0; return true; } } return false; } int ans[3010]; void bfs(int i) { queue<int> v; v.push(i); while (!v.empty()) { int to = v.front(); v.pop(); for (vector<int>::iterator at = E[to].begin(); at < E[to].end(); at++) { if (ans[*at] > ans[to] + 1) { ans[*at] = ans[to] + 1; v.push(*at); } } } } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int a, b; scanf( %d%d , &a, &b); a--; b--; E[a].push_back(b); E[b].push_back(a); } find(0, -1); for (int i = 0; i < 3010; i++) ans[i] = 10000000; for (int i = 0; i < n; i++) if (mark[i] == 2) { ans[i] = 0; bfs(i); } for (int i = 0; i < n; i++) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, k; std::cin >> n >> k; int64_t s1 = 0; int s2 = 0; for (int i = 0; i < k; ++i) { int a, b; std::cin >> a >> b; s1 += b; s2 = (s2 + 1ll * a * b) % n; } if (s1 > n) { std::cout << -1 << n ; } else if (s1 < n) { std::cout << 1 << n ; } else if (1ll * n * (n - 1) / 2 % n == s2) { std::cout << 1 << n ; } else { std::cout << -1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> a(26), a2(26), a3(26); string s1, s2, s3; char ss1[100001], ss2[100001], ss3[100001]; scanf( %s%s%s , ss1, ss2, ss3); s1 = ss1; s2 = ss2; s3 = ss3; for (int i = 0; i < s1.size(); i++) a[s1[i] - a ]++; for (int i = 0; i < s2.size(); i++) a2[s2[i] - a ]++; for (int i = 0; i < s3.size(); i++) a3[s3[i] - a ]++; int max1 = 0, max2 = 0; int ma2 = 100000; for (int i = 0; i < 26; i++) if (a2[i]) ma2 = min(ma2, a[i] / a2[i]); for (int i = 0; i <= ma2; i++) { int r = 100000; for (int j = 0; j < 26; j++) if (a3[j]) r = min(r, (a[j] - i * a2[j]) / a3[j]); if (r + i > max1 + max2) max1 = i, max2 = r; } for (int i = 0; i < max1; i++) printf( %s , ss2); for (int i = 0; i < max2; i++) printf( %s , ss3); for (int i = 0; i < 26; i++) a[i] -= (a2[i] * max1 + a3[i] * max2); for (int i = 0; i < 26; i++) { while (a[i] > 0) { printf( %c , i + a ); a[i]--; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 501; int dp[N][N][2]; char a[N][N]; const int MOD = 1e9 + 7; void add(int &a, int b) { a += b; if (a >= MOD) a -= MOD; if (a < 0) a += MOD; } int mul(int a, int b) { return (long long)a * b % MOD; } int power(int a, int b) { int ans = 1; while (b > 0) { if (b & 1) ans = mul(ans, a); a = mul(a, a); b >>= 1; } return ans; } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> (a[i] + 1); } for (int x2 = 1; x2 <= n; x2++) { for (int x1 = n; x1 >= 1; x1--) { for (int y1 = m; y1 >= 1; y1--) { int x2cc = x2 % 2; int y2 = n + m - x2 - x1 - y1 + 2; dp[x1][y1][x2cc] = 0; if (x1 > x2 || y1 > y2) continue; if (y2 < 1 || y2 > m) continue; if (x1 == x2 && y1 == y2) { dp[x1][y1][x2cc] = 1; continue; } if ((x2 == x1 + 1 && y1 == y2) || (x1 == x2 && y2 == y1 + 1)) if (a[x1][y1] == a[x2][y2]) { dp[x1][y1][x2cc] = 1; continue; } if (x1 < n) { if (x2 > 1) if (a[x1 + 1][y1] == a[x2 - 1][y2]) add(dp[x1][y1][x2cc], dp[x1 + 1][y1][!x2cc]); if (y2 > 1) if (a[x1 + 1][y1] == a[x2][y2 - 1]) add(dp[x1][y1][x2cc], dp[x1 + 1][y1][x2cc]); } if (y1 < m) { if (x2 > 1) if (a[x1][y1 + 1] == a[x2 - 1][y2]) add(dp[x1][y1][x2cc], dp[x1][y1 + 1][!x2cc]); if (y2 > 1) if (a[x1][y1 + 1] == a[x2][y2 - 1]) add(dp[x1][y1][x2cc], dp[x1][y1 + 1][x2cc]); } } } } if (a[1][1] != a[n][m]) dp[1][1][n % 2] = 0; cout << dp[1][1][n % 2] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, x, y, good, bad; scanf( %d , &t); while (t--) { scanf( %d%d%d , &n, &x, &y); bad = min(n, x + y - 1); if (x + y <= n) good = 1; else good = min(n, x + y - n + 1); printf( %d %d n , good, bad); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } long long int lcm(long long int a, long long int b) { return a * b / gcd(a, b); } int n, m, cnt[11][11], a[22], b[22], tr[11], mx; void bktk(int i) { if (i == n + 1) { int ans = 0; memset(cnt, 0, sizeof(cnt)); for (int j = 1; j <= m; j++) cnt[min(tr[a[j]], tr[b[j]])][max(tr[b[j]], tr[a[j]])]++; for (int j = 1; j <= 6; j++) for (int k = 1; k <= 6; k++) if (cnt[j][k]) ans++; mx = max(ans, mx); return; } for (int j = 1; j <= 6; j++) { tr[i] = j; bktk(i + 1); } } int main() { cin >> n >> m; if (n < 7) { cout << m << endl; return 0; } for (int i = 1; i <= m; i++) cin >> a[i] >> b[i]; bktk(1); cout << mx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long q; cin >> q; if (q == 1) { cout << 1 n0 n ; return 0; } long long a = -1, b = -1; for (long long d = 2; d * d <= q; d++) { if (q % d) continue; a = d; b = q / d; break; } if (a == -1) { cout << 1 n0 n ; return 0; } for (long long d = 2; d * d <= b; d++) { if (b % d) continue; cout << 1 n << a * d << n ; return 0; } cout << 2 n ; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int MAX = 5e5 + 10; const long long MAX2 = 11; const long long MOD = 1000000007; const long long MOD2 = 1000000006; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = acos(-1); const double EPS = 1e-9; const int block = 2000; long long n, k, ans; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> k; ans = 1; for (int i = 2; i <= k; ++i) ans = (ans * k) % MOD; n -= k; for (int i = 1; i <= n; ++i) ans = (ans * n) % MOD; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void main0(); int main() { ios::sync_with_stdio(false); cin.tie(0); main0(); return 0; } const int dx[8] = {0, 1, -1, 0, 1, 1, -1, -1}; const int dy[8] = {1, 0, 0, -1, 1, -1, -1, 1}; const int N = 2e3 + 1; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3f; const int mod = 998244353; const double eps = 1e-6; const double Pi = acos(-1.0); mt19937 rnd( (unsigned int)chrono::steady_clock::now().time_since_epoch().count()); int n, m; char a[N][N]; int ans[N][N]; int vis[N][N], step; int incyc, cyclen; pair<int, int> cycp; void dfs(int x, int y) { vis[x][y] = ++step; int xt = x; int yt = y; if (a[x][y] == U ) xt--; else if (a[x][y] == D ) xt++; else if (a[x][y] == L ) yt--; else yt++; if ((1 > xt) || (xt > n) || (1 > yt) || (yt > m)) { vis[x][y] = 0; ans[x][y] = 1; return; } if (vis[xt][yt]) { incyc = 1; cyclen = vis[x][y] - vis[xt][yt] + 1; vis[xt][yt] = 0; vis[x][y] = 0; ans[x][y] = cyclen; return; } if (ans[xt][yt] == 0) { dfs(xt, yt); } if (incyc) ans[x][y] = cyclen; else ans[x][y] = ans[xt][yt] + 1; if (vis[x][y] == 0) incyc = 0; vis[x][y] = 0; } void main0() { int T; cin >> T; while (T--) { cin >> n >> m; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { ans[i][j] = vis[i][j] = 0; } } for (int i = 1; i <= n; ++i) { cin >> a[i] + 1; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (ans[i][j]) continue; step = 0; dfs(i, j); } } pair<int, int> pos = {1, 1}; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (ans[i][j] > ans[pos.first][pos.second]) pos = {i, j}; } } cout << pos.first << << pos.second << << ans[pos.first][pos.second] << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = int(1e5 + 5); vector<int> g[N]; int cnt[N]; void dfs(int v, int depth = 0) { cnt[depth]++; for (int to : g[v]) { dfs(to, depth + 1); } } int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 2; i <= n; i++) { int p; cin >> p; g[p].push_back(i); } dfs(1); int res = 0; for (int i = 0; i <= n; i++) { res += cnt[i] % 2; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int ans[110000], add[110000]; int n, m, a, cnt, me; char temp[3]; int main() { while (~scanf( %d%d , &n, &m)) { for (int i = 1; i <= n; i++) ans[i] = 1, add[i] = 0; ; cnt = 0; me = 0; for (int i = 1; i <= m; i++) { scanf( %s%d , temp, &a); if (*temp == + ) { if (!me || (me == a)) me = a; else ans[a] = 0; add[a] = 1; if (a != me && !add[me]) ans[me] = 0; cnt++; } else { if (!me) me = a; if (a != me && add[a] == 0) { ans[me] = 0; me = a; } if (add[a]) { add[a] = 0; cnt--; } if (cnt) ans[a] = 0; } } int tt = 0; bool fi = true; for (int i = 1; i <= n; i++) if (ans[i]) tt++; printf( %d n , tt); for (int i = 1; i <= n; i++) { if (ans[i]) { if (!fi) printf( ); printf( %d , i); if (fi) fi = false; } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string str[1009]; int n, m; while (cin >> n >> m) { for (int i = 0; i < n; i++) cin >> str[i]; int ret = 0, cury = 0; for (int i = 0; i < n; i++) { int right = cury; if (i % 2 == 0) { for (int j = 0; j < m; j++) if (str[i][j] == W ) right = j; int right1 = cury; if (i < n - 1) for (int j = 0; j < m; j++) if (str[i + 1][j] == W ) right1 = j; right = max(right, right1); ret += (right - cury); cury = right; } else { int left = cury, left1 = cury; for (int j = m - 1; j >= 0; j--) if (str[i][j] == W ) left = j; if (i < n - 1) for (int j = m - 1; j >= 0; j--) if (str[i + 1][j] == W ) left1 = j; left = min(left, left1); ret += (cury - left); cury = left; } } int row = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (str[i][j] == W ) row = i; ret += row; cout << ret << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int dis[3]; int n; int main() { scanf( %d , &n); scanf( %d %d %d , &dis[0], &dis[1], &dis[2]); int ans = 0; n--; int idx = 0; while (n--) { if (dis[idx] < dis[(idx + 1) % 3]) { ans += dis[idx]; idx = (idx + 2) % 3; } else { ans += dis[(idx + 1) % 3]; idx = (idx + 1) % 3; } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int maxl = 1000 * 100 + 5; int n, k; string s; int dis[30][maxl]; int main() { cin >> n >> k >> s; memset(dis, -1, sizeof dis); for (int i = 0; i < 27; i++) { queue<int> q; for (int j = 0; j < k; j++) if (s[j] == (char)(i + a )) { q.push(j); dis[i][j] = 0; } while (!q.empty()) { int index = q.front(); q.pop(); if (index != 0) if (dis[i][index - 1] == -1) { dis[i][index - 1] = dis[i][index] + 1; q.push(index - 1); } if (index != maxl - 1) if (dis[i][index + 1] == -1) { dis[i][index + 1] = dis[i][index] + 1; q.push(index + 1); } } } for (int j = 0; j < n; j++) { string tmp; cin >> tmp; long long int ans = 0; for (int i = 0; i < tmp.size(); i++) ans += (dis[tmp[i] - a ][i] == -1 ? tmp.size() : dis[tmp[i] - a ][i]); cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s(200, a ); cout << s << endl; for (int i = 0; i < n; i++) { int u; cin >> u; s[u] = s[u] == a ? b : a ; cout << s << endl; } } } |
#include <bits/stdc++.h> using namespace std; vector<vector<long long>> gr; vector<bool> used; vector<long long> tin, up; const long long Nmax = 400000; long long p[Nmax]; long long sz[Nmax]; long long timer = 0; long long diametr(long long u, vector<vector<long long>> gr) { queue<long long> q; long long n = (long long)(gr.size()); vector<long long> h(n + 1, -1); q.push(u); h[u] = 0; long long ml = u; while (!q.empty()) { long long v = q.front(); q.pop(); for (long long x : gr[v]) { if (h[x] == -1) { h[x] = h[v] + 1; if (h[x] > h[ml]) ml = x; q.push(x); } } } vector<long long> prev(n + 1, -1); h.assign(n + 1, -1); q.push(ml); h[ml] = 0; long long ms = ml; prev[ml] = ml; while (!q.empty()) { long long v = q.front(); q.pop(); for (long long x : gr[v]) { if (prev[x] == -1) { h[x] = h[v] + 1; prev[x] = v; if (h[x] > h[ms]) ms = x; q.push(x); } } } vector<long long> res; while (prev[ms] != ms) { res.push_back(ms); ms = prev[ms]; } res.push_back(ms); reverse((res).begin(), (res).end()); return (long long)(res.size()) - 1; } long long find(long long x) { if (p[x] != x) { p[x] = find(p[x]); } return p[x]; } void merge(long long x, long long y) { x = find(x); y = find(y); p[y] = x; } void restart(long long N) { for (long long i = 0; i < N; ++i) { sz[i] = 1; p[i] = i; } } vector<pair<long long, long long>> most; void dfs(long long u, long long p) { used[u] = true; tin[u] = timer++; up[u] = tin[u]; for (long long v : gr[u]) { if (used[v] && v != p) up[u] = min(up[u], tin[v]); if (!used[v]) { dfs(v, u); up[u] = min(up[u], up[v]); if (tin[u] < up[v]) { most.emplace_back(u, v); } else { merge(u, v); } } } } void solve() { long long n, m; cin >> n >> m; gr.resize(n); tin.assign(n, 0); up.assign(n, 0); used.assign(n, 0); restart(n); for (long long i = (0); i < (m); ++i) { long long u, v; cin >> u >> v; u--; --v; gr[u].push_back(v); gr[v].push_back(u); } dfs(0, -1); vector<vector<long long>> gr2(n); if (most.empty()) { cout << 0; return; } for (long long i = (0); i < ((long long)(most.size())); ++i) { long long u = most[i].first, v = most[i].second; u = find(u); v = find(v); gr2[u].push_back(v); gr2[v].push_back(u); } long long v = most[0].first; v = find(v); cout << diametr(v, gr2); } signed main() { ios::sync_with_stdio(0); cin.tie(0); long long t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; const int MX = 1e5 + 10; template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto i = begin(v); i != end(v); i++) is >> *i; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto i = begin(v); i != end(v); i++) os << *i << (i == end(v) - 1 ? n : ); return os; } template <typename T> inline void rd(T &s) { s = 0; T t = 1, k = getchar(); for (; k < 0 || k > 9 ; k = getchar()) if (k == - ) t = -1; for (; k >= 0 && k <= 9 ; k = getchar()) s = (s << 1) + (s << 3) + (k ^ 48); s *= t; } ll n, m, t; char a[1111][1111]; ll b[1111][1111]; ll dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}; void solve() { cin >> n >> m >> t; for (register ll i = 1, ilen = (ll)(n); i <= ilen; ++i) cin >> (a[i] + 1); queue<pii> q; for (register ll i = 1, ilen = (ll)(n); i <= ilen; ++i) for (register ll j = 1, jlen = (ll)(m); j <= jlen; ++j) { if (a[i][j] == a[i + 1][j] || a[i][j] == a[i - 1][j] || a[i][j] == a[i][j + 1] || a[i][j] == a[i][j - 1]) b[i][j] = 1, q.push(make_pair(i, j)); else b[i][j] = 2e18; } while (q.size()) { ll x = q.front().first, y = q.front().second; q.pop(); for (register ll i = 0, ilen = (ll)(4); i < ilen; ++i) { ll nx = x + dx[i], ny = y + dy[i]; if (nx >= 1 && nx <= n && ny >= 1 && ny <= m) { if (b[x][y] + 1 < b[nx][ny]) q.push(make_pair(nx, ny)); b[nx][ny] = min(b[nx][ny], b[x][y] + 1); } } } while (t--) { ll x, y, p; cin >> x >> y >> p; if (p >= b[x][y] && (p - b[x][y]) % 2 == 0) { if (a[x][y] == 1 ) cout << 0 << n ; else cout << 1 << n ; } else cout << a[x][y] << n ; } } signed main() { ll T = 1; while (T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e6 + 5; void compute() { int n, m; scanf( %d %d , &n, &m); vector<int> v(n); for (int i = 0; i < n; ++i) scanf( %d , &v[i]); vector<pair<int, int> > seg(m); vector<vector<int> > lf(n), rg(n); for (int i = 0; i < m; ++i) { scanf( %d%d , &seg[i].first, &seg[i].second); --seg[i].first; --seg[i].second; lf[seg[i].second].push_back(seg[i].first); rg[seg[i].first].push_back(seg[i].second); } vector<int> add(n, 0); vector<int> ansv(n, -inf); int mn = v[0]; for (int i = 0; i < n; ++i) { ansv[i] = max(ansv[i], v[i] - mn); for (auto l : lf[i]) { for (int j = l; j <= i; ++j) { --add[j]; mn = min(mn, v[j] + add[j]); } } mn = min(mn, v[i] + add[i]); } add = vector<int>(n, 0); mn = v[n - 1]; for (int i = n - 1; i >= 0; --i) { ansv[i] = max(ansv[i], v[i] - mn); for (auto r : rg[i]) { for (int j = i; j <= r; ++j) { --add[j]; mn = min(mn, v[j] + add[j]); } } mn = min(mn, v[i] + add[i]); } int res = *max_element(ansv.begin(), ansv.end()); vector<int> res2; for (int i = 0; i < n; ++i) { if (ansv[i] == res) { for (int j = 0; j < m; ++j) { if (!(seg[j].first <= i && seg[j].second >= i)) res2.push_back(j + 1); } break; } } printf( %d n%d n , res, (int)res2.size()); for (auto i : res2) printf( %d , i); printf( n ); } int main() { compute(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; bool odd = false, even = false; cin >> n >> k; if (n & 1) { if (k > (n / 2 + 1)) { even = true; k -= (n / 2 + 1); } else odd = true; } else { if (k > n / 2) { even = true; k -= (n / 2); } else odd = true; } if (odd) cout << 2 * k - 1 << endl; else cout << 2 * k << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; bool Finish_read; template <class T> inline void read(T &x) { Finish_read = 0; x = 0; int f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; if (ch == EOF) return; ch = getchar(); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); x *= f; Finish_read = 1; } template <class T> inline void print(T x) { if (x / 10 != 0) print(x / 10); putchar(x % 10 + 0 ); } template <class T> inline void writeln(T x) { if (x < 0) putchar( - ); x = abs(x); print(x); putchar( n ); } template <class T> inline void write(T x) { if (x < 0) putchar( - ); x = abs(x); print(x); } const int maxn = 100005, maxnode = 16500005; int mx, my, mz, n, m, k, lx, rx, ly, ry, lz, rz, cnt, lc[maxnode], rc[maxnode], lv[maxnode], rv[maxnode], rt[maxn << 2]; inline bool Open(int x, int y, int z) { return lx <= x && x <= rx && ly <= y && y <= ry && lz <= z && z <= rz; } inline void update(int &o, int l, int r, int y, int z) { if (!o) o = ++cnt, rv[o] = mz + 1; if (lz <= z) rv[o] = min(rv[o], z); if (z <= rz) lv[o] = max(lv[o], z); if (l == r) return; int mid = (l + r) >> 1; if (y <= mid) update(lc[o], l, mid, y, z); else update(rc[o], mid + 1, r, y, z); } inline void modify(int o, int l, int r, int x, int y, int z) { update(rt[o], 1, my, y, z); if (l == r) return; int mid = (l + r) >> 1; if (x <= mid) modify(o << 1, l, mid, x, y, z); else modify(o << 1 | 1, mid + 1, r, x, y, z); } inline bool getans(int o, int l, int r, int yl, int yr, int zl, int zr) { if (!o) return 1; if (yl <= l && r <= yr) return lv[o] < zl && zr < rv[o]; bool res = 1; int mid = (l + r) >> 1; if (yl <= mid) res &= getans(lc[o], l, mid, yl, yr, zl, zr); if (yr > mid) res &= getans(rc[o], mid + 1, r, yl, yr, zl, zr); return res; } inline bool query(int o, int l, int r, int xl, int xr, int yl, int yr, int zl, int zr) { if (xl <= l && r <= xr) return getans(rt[o], 1, my, yl, yr, zl, zr); bool res = 1; int mid = (l + r) >> 1; if (xl <= mid) res &= query(o << 1, l, mid, xl, xr, yl, yr, zl, zr); if (xr > mid) res &= query(o << 1 | 1, mid + 1, r, xl, xr, yl, yr, zl, zr); return res; } inline void solve(int x, int y, int z) { if (Open(x, y, z)) return (void)puts( OPEN ); if (query(1, 1, mx, min(lx, x), max(rx, x), min(ly, y), max(ry, y), min(lz, z), max(rz, z))) return (void)puts( UNKNOWN ); return (void)puts( CLOSED ); } int main() { read(mx), read(my), read(mz), read(n), read(m), read(k); lx = mx, ly = my, lz = mz; for (int i = 1, x, y, z; i <= n; ++i) { read(x), read(y), read(z); lx = min(lx, x), rx = max(rx, x); ly = min(ly, y), ry = max(ry, y); lz = min(lz, z), rz = max(rz, z); } for (int i = 1, x, y, z; i <= m; ++i) { read(x), read(y), read(z); if (Open(x, y, z)) return 0 * puts( INCORRECT ); modify(1, 1, mx, x, y, z); } puts( CORRECT ); for (int i = 1, x, y, z; i <= k; ++i) read(x), read(y), read(z), solve(x, y, z); } |
#include <bits/stdc++.h> using namespace std; long long a[(200020)], b[(200020)], close[100][2]; set<pair<long long, long long> > vis; signed main() { long long n; cin >> n; for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); for (long long i = 1; i <= n; i++) b[i] = b[i - 1] + a[i]; long long ans = 0; for (long long i = 1; i <= n; i++) { if (i >= 3) for (long long k = 0; k < 30; k++) if (!(a[i] & (1 << k))) { if (close[k][0] && i - close[k][0] > 1) { if ((a[i] ^ a[close[k][0]]) == b[i - 1] - b[close[k][0]]) { if (vis.find(make_pair(close[k][0], i)) != vis.end()) continue; ans++; vis.insert(make_pair(close[k][0], i)); } } if (close[k][1] && i - close[k][1] > 1) { if ((a[i] ^ a[close[k][1]]) == b[i - 1] - b[close[k][1]]) { if (vis.find(make_pair(close[k][1], i)) != vis.end()) continue; ans++; vis.insert(make_pair(close[k][1], i)); } } } for (long long k = 0; k < 30; k++) { if (a[i] & (1 << k)) { close[k][1] = close[k][0]; close[k][0] = i; } } } memset(close, 0, sizeof(close)); for (long long i = n; i >= 1; i--) { if (n - i + 1 >= 3) for (long long k = 0; k < 30; k++) if (!(a[i] & (1 << k))) { if (close[k][0] && close[k][0] - i > 1) { if ((a[i] ^ a[close[k][0]]) == b[close[k][0] - 1] - b[i]) { if (vis.find(make_pair(i, close[k][0])) != vis.end()) continue; ans++; vis.insert(make_pair(i, close[k][0])); } } if (close[k][1] && close[k][1] - i > 1) { if ((a[i] ^ a[close[k][1]]) == b[close[k][1] - 1] - b[i]) { if (vis.find(make_pair(i, close[k][1])) != vis.end()) continue; ans++; vis.insert(make_pair(i, close[k][1])); } } } for (long long k = 0; k < 30; k++) { if (a[i] & (1 << k)) { close[k][1] = close[k][0]; close[k][0] = i; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, s, i, j, k, a, b, w, l1, l2, c, rt, lw; double v[109][109], t[109][109], tp, tc, p1, p2, t1, t2; int main() { cin >> n >> s; for (i = 0; i < n; i++) { cin >> k; for (j = 0; j < k; j++) cin >> v[i][j] >> t[i][j]; t[i][k] = 9999999.0; } for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { p1 = p2 = 0.0; w = lw = c = 0; t1 = t[i][0]; t2 = t[j][0]; for (l1 = l2 = 0;;) { a = b = 0; if (t1 > t2) { tc = t2; b = 1; } else { if (t1 < t2) { tc = t1; a = 1; } else { tc = t1; a = b = 1; } } t1 -= tc; t2 -= tc; p1 += v[i][l1] * tc; p2 += v[j][l2] * tc; if (w == 0) { if (p1 > p2) { w = 1; if (lw == 2) c++; } if (p1 < p2) { w = 2; if (lw == 1) c++; } } else { if (w == 1) { if (p1 < p2) { c++; w = 2; } if (p1 == p2) lw = 1, w = 0; } else { if (p1 > p2) { c++; w = 1; } if (p1 == p2) lw = 2, w = 0; } } if (a == 1) { l1++; t1 = t[i][l1]; } if (b == 1) { l2++; t2 = t[j][l2]; } if (p1 >= s || p2 >= s) break; } rt += c; } } cout << rt; } |
#include <bits/stdc++.h> int main(void) { double a, v, l, d, w, t = 0; scanf( %lf%lf%lf%lf%lf , &a, &v, &l, &d, &w); if (2 * a * d <= w * w || w >= v) { if (l * a * 2 >= v * v) { t += v / a; t += (l - v * v / (2 * a)) / v; } else { t += sqrt(2 * l / a); } } else if (2 * a * d >= 2 * v * v - w * w) { t += v / a; t += (v - w) / a; t += (d - (2 * v * v - w * w) / (2 * a)) / v; if (2 * a * (l - d) > v * v - w * w) { t += (v - w) / a; t += (l - d - (v * v - w * w) / (2 * a)) / v; } else { t += sqrt(2 * (l - d) / a + w * w / (a * a)) - w / a; } } else { t += (sqrt(a * d + w * w / 2) + sqrt(a * d + w * w / 2) - w) / a; if (2 * a * (l - d) > v * v - w * w) { t += (v - w) / a; t += (l - d - (v * v - w * w) / (2 * a)) / v; } else { t += sqrt(2 * (l - d) / a + w * w / (a * a)) - w / a; } } printf( %f n , t); return 0; } |
#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { long long int n, k; scanf( %lld %lld , &n, &k); long long int ans = 0; ans += (n / k) * k; if (n - ans > k / 2) ans += k / 2; else ans = n; printf( %lld n , ans); } } |
#include <bits/stdc++.h> using namespace std; const int N = 105; int freq[N]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int type; cin >> type; freq[type]++; } int start = 1, end = 100; while (start <= end) { int mid = (start + end) >> 1; int persons = 0; for (int types = 1; types <= 100; types++) { persons += (freq[types] / mid); } if (persons >= n) start = mid + 1; else end = mid - 1; } cout << end << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long TC = 1; while (TC--) { long long n; cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) cin >> a[i]; long long lcnt = 1, rcnt = 1; for (long long i = 1; i < n; i++) { if (a[i] > a[i - 1]) lcnt++; else break; } for (long long i = n - 1 - 1; i >= 0; i--) { if (a[i] > a[i + 1]) rcnt++; else break; } if ((a[0] >= a[n - 1] && lcnt % 2) || (a[0] <= a[n - 1] && rcnt % 2)) { cout << Alice n ; continue; } else if (lcnt % 2 == 0 && rcnt % 2 == 0) { cout << Bob n ; } else { cout << Alice n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; const double eps = 1.0e-8; const double pi = acos(-1.0); complex<double> p[MAXN], P; double cross(complex<double> a, complex<double> b) { return (conj(a) * b).imag(); } double check(complex<double> a, complex<double> b) { double l = 0, r = 1; complex<double> v = b - a; for (int i = 0; i < 50; i++) { double mid = (l + r) * 0.5; double midd = (mid + r) * 0.5; complex<double> x = a + v * mid, y = a + v * midd; if (abs(P - x) + eps < abs(P - y)) { r = midd; } else { l = mid; } } return abs(P - (a + v * l)); } int main() { int n; cin >> n; int x, y; cin >> x >> y; P = complex<double>(x, y); for (int i = 0; i < n; i++) { scanf( %d %d , &x, &y); p[i] = complex<double>(x, y); } p[n] = p[0]; double r1 = 1.0e20, r2 = 0; for (int i = 0; i < n; i++) { r1 = min(r1, check(p[i], p[i + 1])); r2 = max(r2, abs(P - p[i])); } printf( %.10f n , pi * (r2 * r2 - r1 * r1)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int f[MAXN + 5]; int main() { memset(f, 0, sizeof(f)); int m = 0, a = 0, r0 = 0, b = 0, ans = 1; cin >> a >> b >> m >> r0; f[r0] = 1; for (int i = 2;; ++i) { r0 = (a * r0 + b) % m; ++ans; if (f[r0] != 0) { ans = ans - f[r0]; break; } f[r0] = ans; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, count = 0; cin >> n >> m; int x = min(n, m); n = n - x; m = m - x; int rest = (n / 2) + (m / 2); cout << x << << rest << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { unordered_map<char, int> mp; int n; cin >> n; string arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; for (auto c : arr[i]) { mp[c]++; } } bool ok = true; for (auto p : mp) { if (p.second % n != 0) { ok = false; break; } } cout << ((ok) ? YES n : NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, c, l; cin >> a >> b >> c >> l; long long int Total = (l + 1) * (l + 2) * (l + 3) / 6; for (long long int la = 0; la <= l; la++) { long long int mini = min(a - b - c + la, l - la); if (mini < 0) continue; long long int wrong = (mini + 1) * (mini + 2) / 2; Total -= wrong; } for (long long int lb = 0; lb <= l; lb++) { long long int mini = min(b - a - c + lb, l - lb); if (mini < 0) continue; long long int wrong = (mini + 1) * (mini + 2) / 2; Total -= wrong; } for (long long int lc = 0; lc <= l; lc++) { long long int mini = min(c - b - a + lc, l - lc); if (mini < 0) continue; long long int wrong = (mini + 1) * (mini + 2) / 2; Total -= wrong; } cout << Total << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int MAX = 1 << 20; bitset<MAX> dpgl, mv, dp[20]; map<char, int> to; char rv[20]; int cnt[20], le[20], ri[20], n, A, B, b; void solve(int ms) { int L = 1e9, R = -1, tot = 0; vector<int> tr, chr, oth; for(int i = 0; i < b; i++) { if(ms & (1 << i)) { L = min(L, le[i]); R = max(R, ri[i]); tot += cnt[i]; chr.push_back(i); if(dp[i][ms ^ (1 << i)]) dp[i][ms] = dpgl[ms] = 1; } else oth.push_back(i); } if(tot >= ((R - L + 1) * A + B - 1) / B) mv[ms] = 1; if(oth.empty()) return; sort(chr.begin(), chr.end(), [&](int a, int b){ return le[a] < le[b]; }); int cms = 0; for(auto c : chr) { cms |= (1 << c); if(mv[cms] && dpgl[cms] && dp[oth[0]][ms ^ cms]) { for(auto tc : oth) dp[tc][ms] = 1; return; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> A >> B; string s; cin >> s; for(auto &c : s) { if(!to.count(c)) { rv[b] = c; to[c] = b++; } } for(int i = 0; i < s.size(); i++) { cnt[to[s[i]]]++; ri[to[s[i]]] = i; } for(int i = s.size() - 1; i >= 0; i--) le[to[s[i]]] = i; dpgl[0] = mv[0] = 1; for(int i = 0; i < b; i++) { dp[i][0] = dp[i][1 << i] = 1; dpgl[1 << i] = 1; } for(int i = 1; i < (1 << b); i++) solve(i); vector<char> ans; for(int i = 0; i < b; i++) if(dp[i][(1 << b) - 1]) ans.push_back(rv[i]); sort(ans.begin(), ans.end()); cout << ans.size(); for(auto &c : ans) cout << << c; cout << n ; /*for(int i = 0; i < (1 << b); i++) { for(int j = 0; j < b; j++) cout << bitset<4>(i) << << j << << dp[j][i] << n ; } cout << n ;*/ } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9+7, M = (1e9+7), MAXN = 1 * 2e5; int A[MAXN], C[MAXN]; int64_t modpow(int64_t a, int64_t b) { int64_t res = 1; for(; b; b >>= 1) { if(b&1) res=res*a%M; a=a*a%M; } return res; } void solve() { const int MOD = M; int N, M; cin >> N >> M; vector<string> G(N); for(int i = 0; i < N; i++) cin >> G[i]; int cnt = 0; for(int i = 0; i < N; i++) cnt += count(G[i].begin(), G[i].end(), # ); cerr << Count: << cnt << endl; int64_t x = modpow(2, cnt); if(cnt == N * M) { cout << (x - 1 + MOD) % MOD << endl; } else { cout << modpow(2, cnt) << endl; } } int main() { cin.tie(0)->sync_with_stdio(0); int T; cin >> T; while(T--) { solve(); } } |
#include <iostream> #include <fstream> #include <vector> #include <algorithm> #include <cmath> #include <iomanip> #include <cstring> std::ifstream fin( input.txt ); std::ofstream fout( output.txt ); int main(){ std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); std::cout.tie(NULL); std::cout << std::setprecision(6) << std::fixed << n ; int Q; std::cin >> Q; while(Q --){ int n, m; std::cin >> n >> m; int x[n], pos; long double ans = 0; for(int i=0; i<n; i++) std::cin >> x[i]; for(pos=n-1; pos>=0 and x[pos] == pos+1; pos--); if(pos == -1) ans = 1; while(m --){ int p; long double prob; std::cin >> p >> prob; p--; if(p >= pos){ ans = 1.0 - (1.0 - ans) * (1.0 - prob); } } std::cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; long long int A[N]; vector<int> g[N]; long long int dfs(int x, int p) { A[x] = 1; for (int i = 0; i < g[x].size(); ++i) { int y = g[x][i]; if (y == p) continue; A[x] += dfs(y, x); } return A[x]; } long double E[N]; void solve(int x, int p) { long long int n = (long long int)g[x].size(); for (int i = 0; i < g[x].size(); ++i) { int y = g[x][i]; if (y == p) continue; E[y] = E[x] + 1; long double med = (A[x] - 1 - A[y]) / (long double)(n - 1); if (g[x].size() != 1) { E[y] += (med * (n - 1)) / (2.0); } solve(y, x); } } int main(void) { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 2; i <= n; ++i) { int x; cin >> x; g[x].push_back(i); g[i].push_back(x); } E[1] = 1.0; dfs(1, -1); solve(1, -1); cout.precision(10); for (int i = 1; i <= n; ++i) { cout << fixed << E[i] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1200; int x, y; bool run() { bool fox = true; while (1) { if (fox) { if (x == 0) { if (y >= 22) { y -= 22; } else { return false; } } else if (x == 1) { if (y >= 12) { y -= 12; } else { return false; } } else { if (y >= 2) { x -= 2; y -= 2; } else { return false; } } } else { if (y >= 22) { y -= 22; } else if (y >= 12) { y -= 12; if (x == 0) { return true; } else { x--; } } else if (y >= 2) { y -= 2; if (x < 2) { return true; } else { x -= 2; } } else { return true; } } fox ^= 1; } return false; } int main() { scanf( %d%d , &x, &y); if (run()) { puts( Ciel ); } else { puts( Hanako ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; const int maxm = 1 << 13; int n; long long k; pair<int, long long> dp[maxn][maxm]; int pre[maxn][maxm]; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } vector<long long> v; void get_div(long long k) { for (long long i = 1; i * i <= k; i++) { if (k % i == 0) { long long j = k / i; v.push_back(i); if (i != j) v.push_back(j); } } sort(v.begin(), v.end()); } long long a[maxn], c[maxn]; int main() { scanf( %d%lld , &n, &k); get_div(k); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); c[i] = gcd(a[i], k); } if (k == 1) { printf( 1 n ); int p = 1; long long minn = a[1]; for (int i = 2; i <= n; i++) { if (a[i] < minn) minn = a[i], p = i; } printf( %d n , p); return 0; } int m = v.size(); for (int i = 0; i <= n; i++) for (int j = 0; j < m; j++) dp[i][j] = make_pair((int)1e9, (long long)1e16); dp[0][0] = make_pair(0, 0); for (int i = 1; i <= n; i++) for (int j = 0; j < m; j++) { if (dp[i][j] > dp[i - 1][j]) { dp[i][j] = dp[i - 1][j]; pre[i][j] = j; } int t = lower_bound(v.begin(), v.end(), v[j] / gcd(v[j], c[i])) - v.begin(); if (dp[i][j] > make_pair(dp[i - 1][t].first + 1, dp[i - 1][t].second + a[i])) { dp[i][j] = make_pair(dp[i - 1][t].first + 1, dp[i - 1][t].second + a[i]); pre[i][j] = t; } } if (dp[n][m - 1].first > n) printf( -1 n ); else { printf( %d n , dp[n][m - 1].first); int k = m - 1; bool first = true; for (int i = n; i >= 1; i--) { if (pre[i][k] != k) { if (first) { printf( %d , i); first = false; } else printf( %d , i); } k = pre[i][k]; } } printf( n ); return 0; } |
#include <bits/stdc++.h> int dp[1000]; int mm[200][200]; int main() { int i, j, n, m, t; dp[3] = 3; for (i = 4; i < 1000; ++i) dp[i] = dp[i - 1] + i - 1; while (scanf( %d , &n) != EOF) { for (i = 3; i < 1000; ++i) { if (dp[i] > n) break; } m = i - 1; printf( %d n , m); t = 1; for (i = 1; i < m; ++i) { for (j = i; j < m; ++j) mm[i][j] = mm[j + 1][i] = t++; } for (i = 1; i <= m; ++i) { for (j = 1; j < m; ++j) printf( %d , mm[i][j]); printf( n ); } } return 0; } |
#include<bits/stdc++.h> #include<string.h> #define int long long #include<vector> #define rep(i,a,b) for(int i=a;i<b;i++) #define pb push_back #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; const int N=2e5+5; vector<int> v[N]; int siz[N]; int lvl[N]; int forefather[N]; int tim = 0, st[N], et[N]; void dfs(int z,int p = -1,int ff = 0){ if(p == -1) lvl[z] = 0; else lvl[z] = lvl[p] + 1; if(lvl[z] == 1) ff = z; forefather[z] = ff; st[z] = tim++; siz[z] = 1; for(int x:v[z]){ if(x == p) continue; dfs(x,z,ff); siz[z] += siz[x]; } et[z] = tim; } // x is ancestor of y bool ancestor(int x,int y){ if(st[y] > st[x] && et[y] <= et[x]){ return true; } return false; } int calc(int x,int y){ if(y == 0) swap(x,y); if(x == 0){ return siz[y] * (siz[0] - siz[forefather[y]]); } return siz[x] * siz[y]; } void solve(){ tim = 0; int n; cin >> n; rep(i,0,n){ v[i].clear(); siz[i] = 0; lvl[i] = 0; forefather[i] = 0; } rep(i,1,n){ int x,y; cin >> x >> y; v[x].pb(y); v[y].pb(x); } dfs(0); int paths = n * (n - 1) / 2; int donthavezero = 0; rep(i,1,n){ if(lvl[i] != 1) continue; donthavezero += siz[i] * (siz[i] - 1) / 2; } cout << donthavezero << ; paths -= donthavezero; int a = 0, b = 0; rep(i,1,n){ if(paths == 0){ cout << 0 << ; continue; } if(a == 0) swap(a,b); if(ancestor(i,a) || ancestor(i,b)){ cout << 0 << ; continue; } if(ancestor(a,i)){ a = i; int wont_work = calc(a,b); cout << paths - wont_work << ; paths = wont_work; } else if(ancestor(b,i)){ if(forefather[i] == forefather[a]){ cout << paths << ; paths = 0; continue; } b = i; int wont_work = calc(a,b); cout << paths - wont_work << ; paths = wont_work; } else{ cout << paths << ; paths = 0; } } cout << paths; cout << n ; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); int t=1; cin>>t; while(t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans = -((long long)1 << 62); int n, u, r; int a[105]; int b[105]; int k[105]; int p[105]; void process(int m, int op) { if (((u - m) & 1) == 0) { long long an = 0; for (int i = 1; i <= n; i++) an += a[i] * k[i]; ans = max(an, ans); } if (m == u) { return; } if (op == 0) { for (int i = 1; i <= n; i++) a[i] ^= b[i]; process(m + 1, 1); for (int i = 1; i <= n; i++) a[i] ^= b[i]; } vector<int> a1; a1.push_back(1); for (int i = 1; i <= n; i++) a1.push_back(a[i]); for (int i = 1; i <= n; i++) a[i] = a1[p[i]] + r; process(m + 1, 0); for (int i = 1; i <= n; i++) a[i] = a1[i]; } int main() { scanf( %d %d %d , &n, &u, &r); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) scanf( %d , &b[i]); for (int i = 1; i <= n; i++) scanf( %d , &k[i]); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); process(0, 0); printf( %I64d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int m; int k; vector<vector<int> > A; cin >> n >> m >> k; for (int i = 0; i < n; i++) { vector<int> X; for (int j = 0; j < m; j++) { int l; cin >> l; X.push_back(l); } A.push_back(X); } int totalSum = 0; int changes = 0; for (int j = 0; j < m; j++) { int maxSum = 0; vector<int> maxI; maxI.push_back(0); for (int i = 0; i < n; i++) { if (A[i][j] == 1) { int sum = 0; for (int z = i; z < min(i + k, n); z++) { sum += A[z][j]; } if (sum > maxSum) { maxSum = sum; for (int elem = 0; elem < maxI.size(); elem++) { maxI[elem] = i; } } else if (sum == maxSum) { maxI.push_back(i); } } } int minimumChanges = 10000000; for (auto elem : maxI) { int toChange = 0; for (int i = 0; i < elem; i++) { if (A[i][j] == 1) { toChange++; } } if (toChange < minimumChanges) { minimumChanges = toChange; } } changes += minimumChanges; totalSum += maxSum; } cout << totalSum << << changes; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxh = 200 * 1000 + 5; struct item { int pos, hash; item(int pos, int hash) : pos(pos), hash(hash) {} }; bool operator<(item a, item b) { return a.pos < b.pos; } int n, m, h; set<item> S[maxh]; map<int, int> M; int pos[maxh]; int Len[maxh]; int Base[maxh]; bool used[maxh]; long long add(int x, int hash) { int base = Base[hash]; set<item>::iterator it = S[base].lower_bound(item(pos[hash], hash)); if (it == S[base].end()) { it = S[base].begin(); } int nhash = it->hash; M[x] = nhash; S[base].erase(it); long long res = pos[nhash] - pos[hash]; if (res < 0) { res += Len[base]; } return res; } void del(int x) { int base = Base[M[x]]; S[base].insert(item(pos[M[x]], M[x])); } int main() { scanf( %d%d%d , &h, &m, &n); for (int i = 0; i < h; ++i) { if (used[i]) { continue; } for (int j = i, p = 0; !used[j]; j += m, j %= h, ++p) { S[i].insert(item(p, j)); pos[j] = p; Base[j] = i; used[j] = 1; } Len[i] = (int)S[i].size(); } long long res = 0; for (int i = 0; i < n; ++i) { char op; int id; scanf( n%c %d , &op, &id); if (op == + ) { int hash; scanf( %d , &hash); res += add(id, hash); } else { del(id); } } printf( %I64d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; long long const MAXN = 5e1 + 8; long long const INF = 3e3 + 8; long long const delta = 1000000007; long long a[MAXN]; long long dp[MAXN][MAXN][INF]; double calc(long long t, long long n, long long b) { double ans = t; for (long long i = b + 1; i <= n; i++) ans /= (double)i; for (long long i = 1; i <= n - b; i++) ans *= (double)i; return ans; } int main() { std::ios::sync_with_stdio(0); ; cin.tie(0); cout.tie(0); long long n; cin >> n; for (long long i = 1; i <= n; i++) cin >> a[i]; long long p; cin >> p; cout.precision(10); cout << fixed; double ans = 0; dp[0][0][0] = 1; for (long long i = 1; i <= n; i++) { for (long long j = 0; j <= n; j++) { for (long long k = 0; k < INF; k++) { dp[i][j][k] = dp[i - 1][j][k]; if (j && k >= a[i]) dp[i][j][k] += dp[i - 1][j - 1][k - a[i]]; } } } for (long long i = 1; i <= p; i++) { for (long long j = 1; j <= n; j++) ans += calc(dp[n][j][i], n, j); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5005; const int K = 100005; int n, m, k; int t, p; int l[N], c[N], x[K]; int main() { scanf( %d%d%d , &n, &m, &k); x[0] = 0; for (int i = 1; i <= k; ++i) { scanf( %d%d%d , &t, &p, &x[i]); if (t == 1) l[--p] = i; else c[--p] = i; } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) printf( %d , x[max(l[i], c[j])]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int N, K; long double ans, s; int R[1000010], data[100010]; int v[1000010], c[1000010]; int STv[20][1000010], STc[20][1000010]; int calcv(int l, int r) { int delta = r - l + 1; int t = log(delta) / log(2); return max(STv[t][l], STv[t][r - (1 << t) + 1]); } int calcc(int l, int r) { int delta = r - l + 1; int t = log(delta) / log(2); return min(STc[t][l], STc[t][r - (1 << t) + 1]); } int main() { scanf( %d%d , &N, &K); for (int i = 1; i <= N; i++) scanf( %d , &v[i]), v[i] *= 100; for (int i = 1; i <= N; i++) scanf( %d , &c[i]); for (int i = 1; i <= N; i++) STv[0][i] = v[i], STc[0][i] = c[i]; for (int step = 1; step <= 19; step++) for (int i = 1; i <= N; i++) { STv[step][i] = STv[step - 1][i]; STc[step][i] = STc[step - 1][i]; int x = i + (1 << (step - 1)); if (x <= N) { STv[step][i] = max(STv[step][i], STv[step - 1][x]); STc[step][i] = min(STc[step][i], STc[step - 1][x]); } } R[0] = 1; for (int l = 1; l <= N; l++) { R[l] = R[l - 1]; for (int r = max(R[l - 1], l); r <= N; r++) if (calcv(l, r) <= calcc(l, r)) R[l] = r; else break; } for (int l = 1; l <= N; l++) { if (R[l] < N && min(calcv(l, R[l]), calcc(l, R[l])) < min(calcv(l, R[l] + 1), calcc(l, R[l] + 1))) R[l]++; data[l] = min(calcv(l, R[l]), calcc(l, R[l])); } sort(data + 1, data + N + 1); s = double(K) / (N - K + 1); for (int l = 1; l + K - 1 <= N; l++) { s = s / (N - l + 1) * (N - K - l + 2); ans = ans + data[l] * s; } printf( %.15lf , double(ans)); } |
#include <bits/stdc++.h> int main() { int i; char a[1000]; gets(a); for (i = 0; i < strlen(a); i++) { printf( %c , a[i]); } for (i = strlen(a) - 1; i >= 0; i--) { printf( %c , a[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 42, K = 11; int n, k, cnt, mark[N], nw[K]; vector<long long> v[K], mask[K]; void do_it(long long u, int x) { for (int i = 0; i < nw[x] + 1; i++) { int cnt = i + __builtin_popcountll(u & mask[x].back()); v[x + 1].push_back((u & (1ll << n) - 1 - mask[x].back()) | mask[x][cnt]); } } int main() { cin >> n >> k; for (int i = 0; i < k; i++) { int x, u; long long msk = 0; mask[i].push_back(0); cin >> x; for (int j = 0; j < x; j++) { cin >> u; u--; msk |= (1ll << u); mask[i].push_back(msk); if (!mark[u]) { cnt++; nw[i]++; mark[u] = 1; } } } v[0].push_back(0); for (int i = 0; i < k; i++) { for (int j = 0; j < v[i].size(); j++) { do_it(v[i][j], i); } } if (n != cnt && n > 1) return cout << REJECTED << endl, 0; for (int i = 0; i < v[k].size(); i++) { int cnt = __builtin_popcountll(v[k][i]); if ((1ll << cnt) - 1 != v[k][i]) return cout << REJECTED << endl, 0; } cout << ACCEPTED << endl; } |
#include <bits/stdc++.h> using namespace std; long long PRIME = 1000000007; long long n, m, k; long long maxm = (long long)(-10e13); long long a[100005][6]; long long max_in_range[100005][6][20]; long long ans[6]; long long times(long long length) { long long cnt = 0; while (length >= 2) { length /= 2; cnt++; } return cnt; } void calculate(long long index, long long length) { long long t = times(length); for (long long d = 1; d <= m; d++) { ans[d] = max(max_in_range[index][d][t], max_in_range[index + length - (1 << t)][d][t]); } } long long query(long long index, long long length) { long long t = times(length); long long sum = 0; for (long long d = 1; d <= m; d++) { sum += max(max_in_range[index][d][t], max_in_range[index + length - (1 << t)][d][t]); } return sum; } long long search(long long index, long long startlength, long long endlength) { if (startlength == endlength) { return startlength; } if (endlength - startlength == 1) { if (query(index, endlength) <= k) { return endlength; } return startlength; } long long mid = (startlength + endlength) / 2; long long val = query(index, mid); if (val > k) { return search(index, startlength, mid - 1); } else { return search(index, mid, endlength); } } void solve() { cin >> n >> m >> k; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { cin >> a[i][j]; } } long long maxallowed = 0; for (long long p = 0; p < 20; p++) { for (long long i = 1; i <= n; i++) { long long sum = 0; for (long long d = 1; d <= m; d++) { if (p == 0) { max_in_range[i][d][p] = a[i][d]; } else if (i + (1 << p) - 1 > n) { max_in_range[i][d][p] = (long long)(10e13); } else { max_in_range[i][d][p] = max(max_in_range[i][d][p - 1], max_in_range[i + (1 << (p - 1))][d][p - 1]); } sum += max_in_range[i][d][p]; } if (sum <= k) { maxallowed = p; } } } for (long long i = 1; i <= n; i++) { long long sum = 0; for (long long d = 1; d <= m; d++) { sum += max_in_range[i][d][maxallowed]; } if (sum > k) { continue; } else { long long l = search(i, (1 << maxallowed), (1 << (maxallowed + 1)) - 1); if (l >= maxm) { calculate(i, l); maxm = l; } } } for (long long d = 1; d <= m; d++) { cout << ans[d] << ; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int max(long long int a, long long int b) { if (a >= b) return a; else return b; } long long int min(long long int a, long long int b) { if (a >= b) return b; else return a; } long long int diff(long long int a, long long int b) { if (a >= b) return a - b; else return b - a; } long long int mod(long long int a) { if (a >= 0) return a; else return -a; } void pairsort(int a[], int b[], int n) { pair<int, int> pairt[n]; for (int i = 0; i < n; i++) { pairt[i].first = a[i]; pairt[i].second = b[i]; } sort(pairt, pairt + n); for (int i = 0; i < n; i++) { a[i] = pairt[i].first; b[i] = pairt[i].second; } } int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); char c; cin >> c; string s1, s2; char s[9] = { 6 , 7 , 8 , 9 , T , J , Q , K , A }; cin >> s1 >> s2; int ind1, ind2; if (s1[1] == s2[1]) { for (int i = 0; i < 9; i++) if (s[i] == s1[0]) ind1 = i; for (int i = 0; i < 9; i++) if (s[i] == s2[0]) ind2 = i; if (ind1 > ind2) cout << YES ; else cout << NO ; } else { if (s1[1] == c) cout << YES ; else cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct p { int x, y, z; }; int c[102][102][102] = {0}; bool ck(int x, int y, int z) { if (!c[x][y][z]) return false; if (c[x - 1][y][z] && c[x + 1][y][z]) return true; if (c[x][y - 1][z] && c[x][y + 1][z]) return true; if (c[x][y][z - 1] && c[x][y][z + 1]) return true; if (c[x - 1][y][z] && c[x][y + 1][z] && !c[x - 1][y + 1][z]) return true; if (c[x - 1][y][z] && c[x][y][z + 1] && !c[x - 1][y][z + 1]) return true; if (c[x][y - 1][z] && c[x + 1][y][z] && !c[x + 1][y - 1][z]) return true; if (c[x][y - 1][z] && c[x][y][z + 1] && !c[x][y - 1][z + 1]) return true; if (c[x][y][z - 1] && c[x + 1][y][z] && !c[x + 1][y][z - 1]) return true; if (c[x][y][z - 1] && c[x][y + 1][z] && !c[x][y + 1][z - 1]) return true; return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { string r; cin >> r; for (int l = 1; l <= k; ++l) c[i][j][l] = r[l - 1] == 1 ? 1 : 0; } } int ans = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { for (int l = 1; l <= k; ++l) { if (ck(i, j, l)) ans++; } } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int BIT = (1 << 17), M = 110, N = 25; int n, m, cnt[BIT], a[M]; long long f[BIT][N], b[N], p[N], year; void solve(int x) { memset(f, 0, sizeof(f)); f[0][0] = 1; int maxb = (1 << n); for (int i = 0; i < maxb; i++) { for (int j = 0; j <= n; j++) { int y = cnt[i] + 1; if (b[y]) { if ((a[b[y]] & i) != a[b[y]]) continue; if ((1 << (b[y] - 1) & i) == (1 << b[y] - 1)) continue; f[i | (1 << b[y] - 1)][j] += f[i][j]; } else { for (int k = 1; k <= n; k++) { if (!(i & (1 << k - 1))) { if ((a[k] & i) != a[k]) continue; if (k == x) f[i | (1 << k - 1)][y] += f[i][j]; else f[i | (1 << k - 1)][j] += f[i][j]; } } } } } } int main() { scanf( %d%lld%d , &n, &year, &m); year -= 2000; for (int i = 1; i < BIT; i++) cnt[i] = cnt[i ^ (i & (-i))] + 1; for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); a[y] |= (1 << x - 1); } for (int i = 1; i <= n; i++) { solve(i); long long sum = 0; for (int j = 1; j <= n; j++) { if (!b[j] && sum + f[(1 << n) - 1][j] >= year) { b[j] = i; p[i] = j; year -= sum; break; } sum += f[(1 << n) - 1][j]; } if (!p[i]) { puts( The times have changed ); return 0; } } for (int i = 1; i <= n; i++) printf( %lld , p[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; multiset<int> all[40]; long long s[40]; int getpos(int x) { int ret = 0; while ((1 << ret) < x) ret++; return ret; } void check() { long long tot = 0LL; int ret = 0; for (int i = 0; i <= 31; i++) { ret += all[i].size(); ret -= (all[i].size() && *(all[i].begin()) > 2 * tot); tot += s[i]; } cout << ret << n ; } int main() { int q; cin >> q; while (q--) { string op; int x; cin >> op >> x; int id = getpos(x); if (op == + ) { s[id] += x; all[id].insert(x); } else { s[id] -= x; all[id].erase(all[id].find(x)); } check(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, c, r[200001], u, v, i, t, k; vector<long long> graph[200001], ans; bool dfs(long long x, long long p) { long long s = 0; for (auto i : graph[x]) if (i != p) s += dfs(i, x); if (r[x] && !s) ans.push_back(x); return s + (long long)(r[x] && r[p]); } int main() { cin >> n; for (i = 0; i < n - 1; i++) { cin >> u >> v >> t, graph[u].push_back(v), graph[v].push_back(u); if (t == 2) r[u] = 1, r[v] = 1; } dfs(1, 0); for (cout << ans.size() << endl, i = 0; i < ans.size(); i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int n0 = 1003, m = 1e5, mod = 998244353; int n, k, a[n0], dp[2][n0], b[n0]; int calc(int gap) { for (int i = 1; i <= n; i++) b[i] = upper_bound(a + 1, a + n + 1, a[i] - gap) - a - 1; memset(&dp, 0, sizeof(dp)); for (int j = 0; j <= n; j++) dp[0][j] = 1; for (int i = 1; i <= k; i++) { dp[i & 1][0] = 0; for (int j = 1; j <= n; j++) { int &x = dp[i & 1][j]; x = dp[i & 1][j - 1] + dp[(i - 1) & 1][b[j]]; x = (x >= mod) ? (x - mod) : x; } } return dp[k & 1][n]; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); int res = 0; for (int gap = 1; gap <= m / (k - 1); gap++) { res += calc(gap); if (res >= mod) res -= mod; } cout << res; } |
#include <bits/stdc++.h> using namespace std; struct Room { int length, width, height, total_length; } room[500]; struct Wallpaper { int length, width, price; } wallpaper[500]; int main() { int n, m, i, j, ans, tmp, price, ret; cin >> n; for (i = 0; i < n; ++i) { cin >> room[i].length >> room[i].width >> room[i].height; room[i].total_length = 2 * (room[i].length + room[i].width); } cin >> m; for (i = 0; i < m; ++i) cin >> wallpaper[i].length >> wallpaper[i].width >> wallpaper[i].price; for (ret = i = 0; i < n; ++i) { for (price = 500 * 500 * 500, ans = j = 0; j < m; ++j) { tmp = wallpaper[j].length / room[i].height; tmp *= wallpaper[j].width; if (tmp == 0) continue; ans = (room[i].total_length / tmp + (room[i].total_length % tmp == 0 ? 0 : 1)) * wallpaper[j].price; price = min(price, ans); } ret += price; } cout << ret << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (n == 1) cout << 1; else if (abs(n - m) > abs(m - 1)) { cout << m + 1; } else { cout << m - 1; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b, diff; cin >> n >> a >> b; vector<long long int> v; long long int arr[n]; for (long long int i = 0; i < n; i++) { cin >> arr[i]; v.push_back(arr[i]); } sort(v.begin(), v.end()); diff = v[n - a] - v[b - 1]; if (diff < 0) { cout << 0 << endl; } else { cout << diff << endl; } } |
#include <bits/stdc++.h> using namespace std; int n, q, k; vector<int> v[1000010]; int lastans = 0, res[1000010]; void dfs(int np, int fath, int val) { res[np] = val; for (auto &x : v[np]) { if (x == fath) continue; dfs(x, np, min(val, x)); } } int main() { scanf( %d%d , &n, &q); for (int i = 1, ti, tj; i < n; i++) { scanf( %d%d , &ti, &tj); v[ti].push_back(tj); v[tj].push_back(ti); } int a, b; scanf( %d%d , &a, &b); b = b % n + 1; dfs(b, 0, b); lastans = 0; k = b; for (int i = 2, ti, tj; i <= q; i++) { scanf( %d%d , &ti, &tj); tj = (tj + lastans) % n + 1; if (ti == 1) k = min(k, res[tj]); else printf( %d n , lastans = min(k, res[tj])); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100]; long long b[100]; vector<long long> pos[101]; int main() { long long i, j, k, l, m, n, t; scanf( %lld , &n); scanf( %lld , &k); for (i = 0; i < n; i++) { scanf( %lld , &a[i]); pos[a[i]].push_back(i); } long long sum = 0, count = 0; long long flag = 0; for (i = 1; i <= 100; i++) { for (j = 0; j < pos[i].size(); j++) { sum = sum + a[pos[i][j]]; if (sum > k) { flag = 1; break; } b[count++] = pos[i][j]; } if (flag == 1) break; } cout << count << endl; for (j = 0; j < count; j++) cout << b[j] + 1 << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; template <class T> inline T biton(T n, T pos) { return n | ((T)1 << pos); } template <class T> inline T bitoff(T n, T pos) { return n & ~((T)1 << pos); } template <class T> inline T ison(T n, T pos) { return (bool)(n & ((T)1 << pos)); } template <class T> inline T gcd(T a, T b) { while (b) { a %= b; swap(a, b); } return a; } template <typename T> string NumberToString(T Number) { ostringstream second; second << Number; return second.str(); } inline int nxt() { int aaa; scanf( %d , &aaa); return aaa; } inline long long int lxt() { long long int aaa; scanf( %lld , &aaa); return aaa; } inline double dxt() { double aaa; scanf( %lf , &aaa); return aaa; } template <class T> inline T bigmod(T p, T e, T m) { T ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % m; p = (p * p) % m; } return (T)ret; } int ar[1000010]; long long F(long long int limit, long long int a, long long int b) { if (limit < a) return 1LL; long long int sum = 1LL; long long int x = 0; while (true) { if (x + a > limit) break; long long int temp = (limit - x) / a; sum += temp; long long int r = (a * temp) + x; if (r - b < 0) break; temp = (r + b - 1) / b; temp--; sum += temp; r -= temp * b; x = r; if (x % a == 0) break; } return sum; } long long int get(long long int st, long long int len) { long long int sum = (len * len + len) / 2LL; sum *= st; return sum; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, a, b; cin >> n >> a >> b; long long limit = min(a + b - 2, n); long long sum = 0; for (long long i = 0; i <= limit; i++) { sum += F(i, a, b); } limit++; long long int gc = gcd(a, b); while (limit <= n) { if (limit % gc == 0) break; sum += (limit / gc) + 1; limit++; } long long int upperLimit = n; while (upperLimit >= limit) { sum += (upperLimit / gc) + 1; if (upperLimit % gc == 0) break; upperLimit--; } if (upperLimit > limit) { long long int diff = (upperLimit - limit); sum += diff; diff /= gc; long long int chunk = limit * diff + get(gc, diff - 1); sum += chunk; } cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, A[2005], DP[2005]; inline int ok(int X) { memset(DP, 0, sizeof(DP)); int i, j; long long l1, r1, l2, r2; for (i = 1; i <= n; i++) DP[i] = i - 1; for (i = 2; i <= n; i++) if (abs(A[i] - A[i - 1]) <= X) DP[i] = 0; else break; for (i = 1; i <= n; i++) for (j = i + 1; j <= n; j++) { l1 = (long long)A[i] - (long long)X * (j - i - 1); r1 = (long long)A[i] + (long long)X * (j - i - 1); l2 = A[j] - X; r2 = A[j] + X; if (!(l2 > r1 || l1 > r2)) DP[j] = min(DP[j], DP[i] + j - i - 1); } for (i = 1; i <= n; i++) if (DP[i] + n - i <= k) return 1; return 0; } int cbin() { int i, step = (1 << 30); for (i = -1; step; step >>= 1) if (!ok(i + step)) i += step; return ++i; } int main() { scanf( %d%d , &n, &k); int i; for (i = 1; i <= n; i++) scanf( %d , &A[i]); printf( %d n , cbin()); return 0; } |
#include <bits/stdc++.h> using namespace std; int N; int A[100005]; int G[100005]; int m; int main() { scanf( %d , &N); for (int i = 0; i < N; ++i) scanf( %d , &A[i]); for (int i = 0; i < N; ++i) { if (i < N / 2) { if (A[i] - i >= 1) ++G[A[i] - i]; } else { if (A[i] - (N - i - 1) >= 1) ++G[A[i] - (N - i - 1)]; } } m = 0; for (int i = 0; i <= 1e5; ++i) if (G[i] >= m) m = G[i]; printf( %d , N - m); return 0; } |
#include <bits/stdc++.h> using namespace std; const int size = 1007; const long long modulo = 1000000007; const long long oo = 1e18; const double EPS = 1e-13; const double PI = acos(-1.0); int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<vector<int> > g(n); vector<long long> cost(n), v(n); for (int i = 0; i < n; i++) cin >> v[i]; while (m--) { int a, b; cin >> a >> b; --a; --b; cost[a] += v[b]; cost[b] += v[a]; g[a].push_back(b); g[b].push_back(a); } vector<bool> was(n, false); long long ans = 0; for (int h = 0; h < n; h++) { int ver = -1; for (int i = 0; i < n; i++) if (!was[i] && (ver < 0 || v[ver] < v[i])) ver = i; was[ver] = true; ans += cost[ver]; for (int i = 0; i < g[ver].size(); i++) { int to = g[ver][i]; if (!was[to]) { cost[ver] -= v[to]; cost[to] -= v[ver]; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int test, a, sum = 0, wait = 0, counter = 0; priority_queue<int, vector<int>, greater<int> > q; queue<int> qqq; cin >> test; int num = test; while (test--) { cin >> a; sum += a; q.push(a); qqq.push(a); } while (!q.empty()) { int serve = q.top(); if (serve >= wait) counter++; else { q.pop(); continue; } wait += serve; q.pop(); } cout << counter << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 3010; const int M = 11; const int INF = 1 << 30; const double EPS = 1e-8; const int MOD = 1000000007LL; int n, tot[N]; vector<int> edge[N], edge2[N]; int dfs(int u, int fa) { int num = 0, sz; sz = edge[u].size(); for (int i = 0; i < sz; i++) { int v = edge[u][i]; if (v == fa) { continue; } num += dfs(v, u); } sz = edge2[u].size(); for (int i = 0; i < sz; i++) { int v = edge2[u][i]; if (v == fa) { continue; } num += dfs(v, u) + 1; } return num; } void init() { memset(tot, 0, sizeof(tot)); for (int i = 0; i < n; i++) { edge[i].clear(); edge2[i].clear(); } for (int i = 1; i < n; i++) { int u, v; scanf( %d %d , &u, &v); u--, v--; edge[u].push_back(v); edge2[v].push_back(u); } for (int u = 0; u < n; u++) { int sz; sz = edge[u].size(); for (int i = 0; i < sz; i++) { int v = edge[u][i]; int num = dfs(v, u); tot[u] += num; } sz = edge2[u].size(); for (int i = 0; i < sz; i++) { int v = edge2[u][i]; int num = dfs(v, u) + 1; tot[u] += num; } } } int dfs2(int u, int fa) { int sz, ret = tot[u]; sz = edge[u].size(); for (int i = 0; i < sz; i++) { int v = edge[u][i]; if (v == fa) { continue; } ret = min(ret, dfs2(v, u)); } sz = edge2[u].size(); for (int i = 0; i < sz; i++) { int v = edge2[u][i]; if (v == fa) { continue; } ret = min(ret, dfs2(v, u)); } return ret; } void solve() { int ans = INF; for (int i = 0; i < n; i++) { ans = min(ans, tot[i]); } for (int i = 0; i < n; i++) { vector<int> p; int sz; sz = edge[i].size(); for (int j = 0; j < sz; j++) { int v = edge[i][j]; p.push_back(dfs2(v, i)); } sz = edge2[i].size(); for (int j = 0; j < sz; j++) { int v = edge2[i][j]; p.push_back(dfs2(v, i)); } if (p.size() <= 1) { continue; } sort(p.begin(), p.end()); int tmp = p[0] + p[1] - tot[i]; ans = min(ans, tmp); } cout << ans << endl; } int main() { while (cin >> n) { init(); solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i = (a); i < b; ++i) #define rrep(i,a,b) for(int i = (b); i --> (a);) #define trav(x, v) for(auto &x : v) #define all(v) (v).begin(),(v).end() #define sz(v) (int)(v).size() bool que_big(int s, string x){ cout << s+1 << << x << endl; string res; cin >> res; return res == yes ; } int main(){ int n = 200, b = 200; cin >> n >> b; vector<string> ub(n, string(b, 1 )); string lb(b, 0 ); deque<int> ko; rep(i,0,n) ko.push_back(i); string nxt = string(b, 1 ); nxt[0] = 0 ; while(true){ int s = ko.front(); if(ub[s] < lb){ ko.pop_front(); continue; } if(ub[s] == lb){ cout << 0 << << lb << endl; return 0; } if(que_big(s, nxt)){ lb = nxt; rrep(i,0,b){ if(lb[i]== 0 ){ lb[i] = 1 ; nxt[i] = 1 ; break; } else { lb[i] = 0 ; } } } else { ub[s] = nxt; ko.pop_front(); ko.push_back(s); rep(i,0,b) if(nxt[i] > lb[i]){ nxt[i] = 0 ; break; } } } } |
#include <bits/stdc++.h> inline long long read() { long long x = 0, f = 1; char c = getchar(); for (; c > 9 || c < 0 ; c = getchar()) { if (c == - ) f = -1; } for (; c >= 0 && c <= 9 ; c = getchar()) { x = x * 10 + c - 0 ; } return x * f; } int dp[18][(1 << 18)][2][2]; bool fan[200005]; inline void work() { int n = read(), k = read(); for (int i = 1; i <= k; i++) { int x = read(); fan[x] = 1; } memset(dp, -0x3f, sizeof dp); for (int i = 1; i <= n; i++) { for (int j = 1; j <= (1 << n); j += (1 << i)) { if (i == 1) { dp[i][j][fan[j]][fan[j + 1]] = (fan[j] | fan[j + 1]); dp[i][j][fan[j + 1]][fan[j]] = (fan[j] | fan[j + 1]); } else { for (int x1 = 0; x1 < 2; x1++) { for (int x2 = 0; x2 < 2; x2++) { for (int y1 = 0; y1 < 2; y1++) { for (int y2 = 0; y2 < 2; y2++) { int tmp = dp[i - 1][j][x1][y1] + dp[i - 1][j + (1 << i - 1)][x2][y2]; if (x1 | x2) tmp++; if (y1 | y2) tmp++; dp[i][j][x1][x2] = std::max(dp[i][j][x1][x2], tmp + (x2 | y1)); dp[i][j][x1][x2] = std::max(dp[i][j][x1][x2], tmp + (x2 | y2)); dp[i][j][x1][y1] = std::max(dp[i][j][x1][y1], tmp + (y1 | x2)); dp[i][j][x1][y2] = std::max(dp[i][j][x1][y2], tmp + (y2 | x2)); dp[i][j][x2][x1] = std::max(dp[i][j][x2][x1], tmp + (x1 | y1)); dp[i][j][x2][x1] = std::max(dp[i][j][x2][x1], tmp + (x1 | y2)); dp[i][j][x2][y1] = std::max(dp[i][j][x2][y1], tmp + (y1 | x1)); dp[i][j][x2][y2] = std::max(dp[i][j][x2][y2], tmp + (y2 | x1)); } } } } } } } int ans = -0x3f3f3f3f; ans = std::max(ans, dp[n][1][1][1] + 1); ans = std::max(ans, dp[n][1][0][1] + 1); ans = std::max(ans, dp[n][1][1][0] + 1); ans = std::max(ans, dp[n][1][0][0]); printf( %d n , ans); } int main() { work(); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.