func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int N; char S[1010]; int E[1010], F[1010][2]; int main() { scanf( %d , &N); scanf( %s , S); memset(E, 0, sizeof(E)); for (int i = 0; i < N; i++) { E[i + 1] = S[i] - 0 ; F[i + 1][0] = F[i + 1][1] = 0x3f3f3f3f; } F[0][0] = F[0][1] = 0; for (int i = 1; i <= N; i++) for (int j = 0; j < 2; j++) { if (E[i] == j) { F[i][j] = min(F[i][j], F[i - 1][1 - j]); } else if (E[i] == 1 - j) { F[i][j] = min(F[i][j], F[i - 1][E[i]] + 1); } if (i - 2 >= 0) { if (E[i] == E[i - 1]) { F[i][j] = min(F[i][j], F[i - 2][j] + 1); } else if (E[i] != E[i - 1]) { if (E[i] == j) F[i][j] = min(F[i][j], F[i - 2][j]); else if (E[i] != j) F[i][j] = min(F[i][j], F[i - 2][j] + 2); } } } int ans = min(F[N][0], F[N][1]); if (ans == 0x3f3f3f3f) ans = -1; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, k, i; cin >> n >> k; long long a[n], s = INT_MAX, l = INT_MIN; for (i = 0; i < n; i++) { cin >> a[i]; s = min(s, a[i]); l = max(l, a[i]); } if (s + k >= l - k) cout << s + k << endl; else cout << -1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { list<unsigned long long int> blind; list<unsigned long long int>::iterator bite, tempite; unsigned long long int total, l, maxarea = 0, sum, i; cin >> total >> l; for (i = 0; i < total; ++i) { cin >> sum; if (sum >= l) blind.push_back(sum); } sum = 1; while (sum != 0) { sum = 0; for (bite = blind.begin(); bite != blind.end();) { if (*bite < l) { tempite = bite; ++bite; blind.erase(tempite); } else { sum += *bite / l; ++bite; } } if (maxarea < l * sum) maxarea = l * sum; ++l; } cout << maxarea; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100006]; vector<int> located[100006]; int parent[100006], level[100006], visited[100006]; int ancestor[100006][18]; vector<int> st[100006][18]; void dfs(int u) { visited[u] = 1; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i]; if (visited[v] == 0) { parent[v] = u; level[v] = level[u] + 1; dfs(v); } } } void merge(vector<int>& a, vector<int>& b) { sort(a.begin(), a.end()); sort(b.begin(), b.end()); vector<int> tmp; int cnt = 0; int l1 = a.size(), l2 = b.size(); int i = 0, j = 0; while (i < l1 && j < l2 && cnt < 10) { if (a[i] < b[j]) tmp.push_back(a[i++]); else tmp.push_back(b[j++]); cnt++; } while (i < l1 && cnt < 10) { tmp.push_back(a[i++]); cnt++; } while (j < l2 && cnt < 10) { tmp.push_back(b[j++]); cnt++; } a.clear(); for (i = 0; i < cnt; i++) a.push_back(tmp[i]); } int main() { int tc = 1; for (int t = 1; t <= tc; t++) { int n, m, q; scanf( %d , &(n)); scanf( %d , &(m)); scanf( %d , &(q)); for (int j = 1; j < 18; j++) { for (int i = 1; i <= n; i++) { ancestor[i][j] = -1; } } for (int i = 1; i < n; i++) { int u, v; scanf( %d , &(u)); scanf( %d , &(v)); g[u].push_back(v); g[v].push_back(u); } for (int i = 1; i <= m; i++) { int tmp; scanf( %d , &(tmp)); located[tmp].push_back(i); } parent[1] = -1; level[1] = 1; dfs(1); for (int i = 1; i <= n; i++) ancestor[i][0] = parent[i]; for (int j = 1; j < 18; j++) { for (int i = 1; i <= n; i++) { if (ancestor[i][j - 1] != -1) ancestor[i][j] = ancestor[ancestor[i][j - 1]][j - 1]; } } for (int i = 1; i <= n; i++) { st[i][0] = located[i]; vector<int> vi; merge(st[i][0], vi); } for (int j = 1; j < 18; j++) { for (int i = 1; i <= n; i++) { st[i][j] = st[i][j - 1]; if (ancestor[i][j - 1] == -1) continue; merge(st[i][j], st[ancestor[i][j - 1]][j - 1]); } } while (q--) { int u, v, a; scanf( %d , &(u)); scanf( %d , &(v)); scanf( %d , &(a)); if (level[u] < level[v]) { int tmp = u; u = v; v = tmp; } vector<int> tmp; for (int j = 17; j >= 0; j--) { if (ancestor[u][j] != -1 && level[ancestor[u][j]] >= level[v]) { merge(tmp, st[u][j]); u = ancestor[u][j]; } } if (u != v) { for (int j = 17; j >= 0; j--) { if (ancestor[u][j] != -1 && ancestor[u][j] != ancestor[v][j]) { merge(tmp, st[u][j]); merge(tmp, st[v][j]); u = ancestor[u][j]; v = ancestor[v][j]; } } merge(tmp, st[u][0]); merge(tmp, st[v][0]); u = parent[u]; v = parent[v]; } merge(tmp, st[u][0]); int cnt = 0; int len = tmp.size(); cout << min(a, len); for (int it = 0; it < tmp.size() && cnt < a; it++, cnt++) { printf( ); printf( %d , (tmp[it])); } printf( n ); } } } |
#include <bits/stdc++.h> using namespace std; int main() { double i, j, h, l, num; cin >> h >> l; num = (l * l - h * h) / (2 * h); cout << (fixed) << setprecision(12) << num; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long b, q, l, m, a[N]; map<long long, int> vis; int main() { scanf( %lld%lld%lld%lld , &b, &q, &l, &m); while (m--) { long long x; scanf( %lld , &x); vis[x] = 1; } if (max(-b, b) > l) { printf( 0 n ); } else if (b == 0) { if (vis.count(b) == 0) printf( inf n ); else printf( 0 n ); } else { if (q == 0) { if (vis.count(0) == 0) { printf( inf n ); } else { printf( %d n , !vis.count(b)); } } else if (q == 1) { if (vis.count(b) == 0) printf( inf n ); else printf( 0 n ); } else if (q == -1) { if (vis.count(b) == 0 || vis.count(-b) == 0) printf( inf n ); else printf( 0 n ); } else { int ans = 0; while (max(-b, b) <= l) { if (vis.count(b) == 0) ans++; b *= q; } printf( %d n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[100001]; int res[100001]; vector<vector<pair<int, int> > > g(1e5 + 2); int check(int v) { if (dp[v]) { return dp[v]; } dp[v] = 1; for (int i = 0; i < g[v].size(); i++) { int nxt = g[v][i].first; if (check(nxt) + 1 > dp[v]) { dp[v] = dp[nxt] + 1; res[v] = max(res[nxt], g[v][i].second); } } return dp[v]; } int main() { int n, m, v, v1; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> v >> v1; g[--v].push_back({--v1, i + 1}); } for (int i = 0; i < n; i++) { if (check(i) == n) { cout << res[i]; return 0; } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; int a[N]; int vis[N]; int sum[4 * N]; void up(int id, int l, int r, int pos, int val) { if (l == r) { sum[id] = val; return; } int mid = l + r >> 1; if (pos <= mid) up(id << 1, l, mid, pos, val); else up(id << 1 | 1, mid + 1, r, pos, val); sum[id] = max(sum[id << 1], sum[id << 1 | 1]); } int qu(int id, int l, int r, int ql, int qr) { if (ql <= l && r <= qr) return sum[id]; int mx = 0; int mid = l + r >> 1; if (ql <= mid) mx = max(mx, qu(id << 1, l, mid, ql, qr)); if (qr > mid) mx = max(mx, qu(id << 1 | 1, mid + 1, r, ql, qr)); return mx; } int main() { int n; cin >> n; for (int i = 1; i <= (n); ++i) cin >> a[i]; int q; cin >> q; int h; int le = 0; int pre = 0; for (int i = 1; i <= q; ++i) { int ty; cin >> ty; if (ty == 1) { int pos, val; cin >> pos >> val; vis[pos] = i; a[pos] = val; } else { cin >> h; up(1, 1, q, i, h); } } for (int i = 1; i <= (n); ++i) { int le = qu(1, 1, q, vis[i], q); if (le > a[i]) printf( %d , le); else printf( %d , a[i]); } } |
#include <bits/stdc++.h> int main() { long long count, number; long long Totalnumber = 200001; std::vector<long long> Calresult(Totalnumber); Calresult[2] = 1; for (long long i = 3; i <= Totalnumber; i++) { Calresult[i] = Calresult[i - 1] % 1000000007 * i % 1000000007; } std::cin >> count; while (count--) { std::cin >> number; std::cout << Calresult[number * 2] << std::endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2500 + 5; int n, a[maxn][maxn]; int tot; struct Data { int x, y, z; bool operator<(const Data &a) const { return z < a.z; } } b[maxn * maxn]; bitset<2505> bt[maxn]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) scanf( %d , &a[i][j]), b[++tot] = (Data){i, j, a[i][j]}; for (int i = 1; i <= n; ++i) if (a[i][i]) puts( NOT MAGIC ), exit(0); for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) if (a[i][j] != a[j][i]) puts( NOT MAGIC ), exit(0); sort(b + 1, b + 1 + tot); for (int i = 1, p = 1; i <= tot; i = p) { while (b[p].z == b[i].z && p <= tot) { int x = b[p].x, y = b[p].y; if ((bt[x] & bt[y]).count()) puts( NOT MAGIC ), exit(0); p++; } for (int j = i; j < p; ++j) bt[b[j].x][b[j].y] = 1; } puts( MAGIC ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool isValid(string& x, string& y) { int found = y.find(x); if (found == string::npos) return false; for (int i = 0; i < found; ++i) { if (y[i] == 0 ) return false; } for (int i = found + x.length(); i < y.length(); ++i) { if (y[i] == 0 ) return false; } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); unsigned long long x, y; cin >> x >> y; bitset<64> b1(x); bitset<64> b2(y); string xString = b1.to_string(); string yString = b2.to_string(); int index = 0; while (xString[index] == 0 ) { index++; } xString = xString.substr(index); index = 0; while (yString[index] == 0 ) { index++; } yString = yString.substr(index); if (isValid(xString, yString)) { int temp = yString.find(xString); if (temp != 0 && xString.back() == 0 && temp + xString.length() == yString.length()) { } else { cout << YES n ; return 0; } } index = -1; for (int i = 0; i < xString.length(); ++i) if (xString[i] == 1 ) index = i; string xNoTrailing = xString.substr(0, index + 1); if (isValid(xNoTrailing, yString)) { cout << YES n ; return 0; } reverse(xNoTrailing.begin(), xNoTrailing.end()); if (isValid(xNoTrailing, yString)) { cout << YES n ; return 0; } xString.push_back( 1 ); reverse(xString.begin(), xString.end()); if (isValid(xString, yString)) { cout << YES n ; return 0; } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int y[3], m[3], p[3]; int result; bool solve(int); bool if_win(int, int, int); int main() { double lb = 0, ub = 0xffffff; result = 0xfffffff; scanf( %d%d%d , &y[0], &y[1], &y[2]); scanf( %d%d%d , &m[0], &m[1], &m[2]); scanf( %d%d%d , &p[0], &p[1], &p[2]); if (if_win(0, 0, 0)) { printf( %d n , 0); return 0; } for (int i = 0; i < 100; i++) { int mid = (int)((lb + ub) / 2 + 0.5); if (solve(mid)) ub = mid; else lb = mid; if (lb == ub || ub - lb == 1) break; } printf( %d n , result); return 0; } bool solve(int x) { int i; int j; int z; for (i = x / p[0]; i >= 0; i--) { for (j = (x - i * p[0]) / p[1]; j >= 0; j--) { if (y[1] + j < m[2]) break; for (z = (x - i * p[0] - j * p[1]) / p[2]; z >= 0; z--) { int prise = p[0] * i + p[1] * j + p[2] * z; if (if_win(i, j, z)) { result = min(result, prise); return true; } } } } return false; } bool if_win(int i, int j, int z) { if (y[1] + j <= m[2]) return false; int time = m[0] / (y[1] + j - m[2]); if (m[0] % (y[1] + j - m[2]) != 0) time++; if (y[0] + i - time * (m[1] - y[2] - z) > 0) return true; else return false; } |
#include <bits/stdc++.h> using namespace std; int n, m, s, l; const int mo = 1e9 + 7; const int inv3 = 333333336; int a[202020]; int b[202020]; int c[202020]; int sum[202020]; int sum2[202020]; long long gcd_ex(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return 1ll * a; } long long d = gcd_ex(b, a % b, y, x); y = y - a / b * x; return d; } long long solve(long long a, long long b, long long m) { long long x, y; long long d = gcd_ex(a, m, x, y); if (b % d == 0) { x %= m; while (x < 0) x += m; x %= m; return x * (b / d) % (m / d); } else { return m; } } bool cmp(int x, int y) { return a[x] < a[y]; } int main() { cin >> n >> m; for (register int i = 1; i <= n; ++i) { scanf( %d , &a[i]); sum[i] = (sum[i - 1] + a[i]) % mo; sum2[i] = (sum2[i - 1] + (1ll * (a[i]) * (a[i]) % mo)) % mo; b[i] = a[i]; c[i] = i; } sort(b + 1, b + n + 1); sort(c + 1, c + n + 1, cmp); int r, d, x; long long aa, ab, ba, bb, mm, ssr, sp, sr; for (register int i = 1; i <= m; ++i) { scanf( %d %d %d , &l, &r, &d); s = r - l + 1; aa = 1ll * s; ab = (0ll + mo + sum[r] - sum[l - 1]) % mo; ba = (1ll * ((1ll * s * (s - 1) / 2) % mo) * d) % mo; bb = (ab + mo - ba) % mo; mm = 1ll * mo; x = solve(aa, bb, mm); if (b[lower_bound(b + 1, b + n + 1, x) - b] != x) { printf( No n ); continue; } x = c[lower_bound(b + 1, b + n + 1, x) - b]; if (x < l && r < x) { printf( No n ); continue; } x = a[x]; ssr = (0ll + mo + sum2[r] - sum2[l - 1]) % mo; sr = ((2ll * ba) % mo * x) % mo; sp = (1ll * ((1ll * (1ll * ba * (2ll * s - 1) % mo) * inv3) % mo) * d) % mo; sp = (0ll + 1ll * s * (1ll * (x) * (x) % mo) % mo + sp + sr) % mo; if (ssr != sp) { printf( No n ); continue; } printf( Yes n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const int maxn = 10000; bool is_prime(int x) { for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) return 0; } if (x < 2) return 0; return 1; } int main() { int cc, n; cin >> cc >> n; vector<int> a(n); for (int i = 0; i < cc; i++) { int x; cin >> x; x--; a[x]++; } vector<std::vector<int> > dp(3, std::vector<int>(3, 0)); for (int i = 0; i < n; i++) { int c = a[i]; vector<std::vector<int> > new_dp(3, std::vector<int>(3, 0)); for (int x = 0; x < 3; x++) { for (int y = 0; y < 3; y++) { for (int z = 0; z < 3; z++) { if (x + y + z <= c) { new_dp[y][z] = max(new_dp[y][z], dp[x][y] + z + (c - x - y - z) / 3); } } } } swap(dp, new_dp); } cout << dp[0][0]; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for (auto &i : a) cin >> i; if (n == 1) { cout << 0 << n ; return 0; } int ans = INT_MAX, base; for (int i = 1; i <= 1000; i++) { int first = i, curr = 0; for (int j = 0; j < n; j++) if (a[j] != first + j * k) curr++; if (curr < ans) base = i, ans = curr; } cout << ans << n ; for (int j = 0; j < n; j++) { int now = base + j * k; if (a[j] < now) cout << + << j + 1 << << now - a[j] << n ; else if (a[j] > now) cout << - << j + 1 << << a[j] - now << n ; } } |
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } int main() { int q; cin >> q; while (q--) { int n; cin >> n; vector<int> a(4 * n); for (int i = 0; i < 4 * n; i++) cin >> a[i]; sort(a.begin(), a.end()); int area = a[0] * a[4 * n - 1]; int temp = 0; for (int i = 1; i <= n; i++) { if ((a[2 * i - 2] != a[2 * i - 1]) || (a[4 * n - 2 * i] != a[4 * n - 2 * i + 1]) || (a[2 * i - 1 - 1] * a[4 * n - 2 * i + 1] != area)) { temp = 1; break; } } if (temp == 0) { cout << YES << endl; } else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using vi = vector<int>; using ll = long long; void solve() { string s; cin >> s; int m = ((int)(s).size()); vi a(m); a[0] = ((s[0] == - ) ? -1 : 1); for (__typeof(m) i = (1) - ((1) > (m)); i != (m) - ((1) > (m)); i += 1 - 2 * ((1) > (m))) { if (s[i] == - ) { a[i] = a[i - 1] - 1; } else { a[i] = a[i - 1] + 1; } } ll res = m; int i = 0, t = -1; while (i < m) { if (a[i] != t) { i++; } else { t--; res += (i + 1); } } cout << res << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int MAXN = 100010; int N; int A[MAXN]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> N; for (int i = 0; i < N; i++) { cin >> A[i]; } ll ans = 0; for (int i = 0; i < N; i++) { ans += ll(A[i]) * (N + 1 - A[i]); } for (int i = 0; i < N - 1; i++) { ans -= ll(min(A[i], A[i + 1])) * (N + 1 - max(A[i], A[i + 1])); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int ans[101]; int main() { int t; scanf( %d , &t); while (t--) { int n, cnt = 0; scanf( %d , &n); for (int i = 1; i <= n; i *= 2) { ans[++cnt] = i; n -= i; } if (n > 0) { ans[++cnt] = n; sort(ans + 1, ans + cnt + 1); } printf( %d n , cnt - 1); for (int i = 2; i <= cnt; i++) printf( %d , ans[i] - ans[i - 1]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2005; const int maxz = 16005; int l[maxn], r[maxn], n, l1, l2; int dp[maxn][maxz], q[maxz]; bool lt[maxn][maxz]; char s[maxn]; struct ac_machine { int ch[maxz][10], cnt; int fail[maxz]; int tp[maxz][maxn]; void init() { int x = 0, y = 0; if (l1 == l2) { for (int i = 1; i <= l1; ++i) { if (x == y) { for (int j = l[i] + 1; j < r[i]; ++j) { if (!ch[x][j]) ch[x][j] = ++cnt; tp[ch[x][j]][l1 - i]++; } } else { for (int j = l[i] + 1; j <= 9; ++j) { if (!ch[x][j]) ch[x][j] = ++cnt; tp[ch[x][j]][l1 - i]++; } for (int j = (i == 1); j < r[i]; ++j) { if (!ch[y][j]) ch[y][j] = ++cnt; tp[ch[y][j]][l2 - i]++; } } if (!ch[x][l[i]]) ch[x][l[i]] = ++cnt; x = ch[x][l[i]]; if (!ch[y][r[i]]) ch[y][r[i]] = ++cnt; y = ch[y][r[i]]; } tp[x][0]++; if (x != y) tp[y][0]++; } else { for (int i = 1; i <= l1; ++i) { for (int j = l[i] + 1; j <= 9; ++j) { if (!ch[x][j]) ch[x][j] = ++cnt; tp[ch[x][j]][l1 - i]++; } if (!ch[x][l[i]]) ch[x][l[i]] = ++cnt; x = ch[x][l[i]]; } for (int i = 1; i <= l2; ++i) { for (int j = (i == 1); j < r[i]; ++j) { if (!ch[y][j]) ch[y][j] = ++cnt; tp[ch[y][j]][l2 - i]++; } if (!ch[y][r[i]]) ch[y][r[i]] = ++cnt; y = ch[y][r[i]]; } for (int i = l1 + 1; i < l2; ++i) for (int j = 1; j <= 9; ++j) { if (!ch[0][j]) ch[0][j] = ++cnt; tp[ch[0][j]][i - 1]++; } tp[x][0]++; tp[y][0]++; } } void build() { int h = 1, t = 0; for (int i = 0; i <= 9; ++i) if (ch[0][i]) q[++t] = ch[0][i]; int x; while (h <= t) { x = q[h++]; for (int i = 0; i <= 9; ++i) if (!ch[x][i]) ch[x][i] = ch[fail[x]][i]; else fail[ch[x][i]] = ch[fail[x]][i], q[++t] = ch[x][i]; } for (int i = 1; i <= t; ++i) { x = q[i]; for (int j = 0; j <= n; ++j) tp[x][j] += tp[fail[x]][j]; } for (int i = 1; i <= cnt; ++i) for (int j = 1; j <= n; ++j) tp[i][j] += tp[i][j - 1]; } } t; int main() { t.cnt = 0; scanf( %s , s + 1); l1 = strlen(s + 1); for (int i = 1; i <= l1; i++) l[i] = s[i] - 0 ; scanf( %s , s + 1); l2 = strlen(s + 1); for (int i = 1; i <= l2; i++) r[i] = s[i] - 0 ; scanf( %d , &n); memset(dp, -1, sizeof(dp)); dp[0][0] = 0; t.init(); t.build(); for (int i = 0; i < n; ++i) for (int j = 0; j <= t.cnt; ++j) { if (dp[i][j] == -1) continue; for (int k = 0; k <= 9; ++k) { int x = t.ch[j][k]; dp[i + 1][x] = max(dp[i + 1][x], dp[i][j] + t.tp[x][n - i - 1]); } } int ans = 0; for (int i = 0; i <= t.cnt; ++i) ans = max(ans, dp[n][i]); printf( %d n , ans); for (int i = 0; i <= t.cnt; ++i) if (dp[n][i] == ans) lt[n][i] = 1; for (int i = n - 1; i >= 0; --i) { for (int j = 0; j <= t.cnt; ++j) { if (dp[i][j] == -1) continue; for (int k = 0; k <= 9; ++k) { int x = t.ch[j][k]; lt[i][j] |= lt[i + 1][x] && (dp[i + 1][x] == dp[i][j] + t.tp[x][n - i - 1]); } } } int x = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j <= 9; ++j) { int y = t.ch[x][j]; if (lt[i + 1][y] && (dp[i + 1][y] == dp[i][x] + t.tp[y][n - i - 1])) { putchar(j + 0 ); x = y; break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long n, t; cin >> n; if (n % 2 == 0) cout << n / 2; else cout << - << (n / 2 + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int ans = 0, fh = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) fh = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) ans = (ans << 1) + (ans << 3) + ch - 0 , ch = getchar(); return ans * fh; } const int maxn = 2e5 + 100; const long long inf = 1e18; int n, m, head[maxn], nex[maxn], v[maxn], num = 1; long long p[maxn << 2], la[maxn << 2]; long long a[maxn], b[maxn], w[maxn]; inline void updata(int o) { p[o] = min(p[o << 1], p[o << 1 | 1]); } inline void pushdown(int o) { if (!la[o]) return; p[o << 1] += la[o], p[o << 1 | 1] += la[o]; la[o << 1] += la[o], la[o << 1 | 1] += la[o]; la[o] = 0; } void revise(int o, int l, int r, int ql, int qr, long long qz) { if (ql == l && qr == r) { p[o] += qz, la[o] += qz; return; } int mid = l + r >> 1; pushdown(o); if (ql <= mid) revise(o << 1, l, mid, ql, min(qr, mid), qz); if (qr > mid) revise(o << 1 | 1, mid + 1, r, max(ql, mid + 1), qr, qz); updata(o); } long long query(int o, int l, int r, int ql, int qr) { if (ql == l && qr == r) return p[o]; int mid = l + r >> 1; pushdown(o); long long ans = inf; if (ql <= mid) ans = query(o << 1, l, mid, ql, min(qr, mid)); if (qr > mid) ans = min(ans, query(o << 1 | 1, mid + 1, r, max(ql, mid + 1), qr)); return ans; } void build(int o, int l, int r) { la[o] = 0; if (l == r) { p[o] = b[l]; return; } int mid = l + r >> 1; build(o << 1, l, mid), build(o << 1 | 1, mid + 1, r); updata(o); } inline void add(int x, int y, long long z) { v[++num] = y; w[num] = z; nex[num] = head[x]; head[x] = num; } int main() { n = read(), m = read(); int T = read(); for (int i = 1; i < n; i++) a[i] = read(), b[i] = read(); for (int i = 1; i <= m; i++) { int x = read(), y = read(); add(x, y, read()); } build(1, 0, n - 1); for (int x = 1; x <= n; x++) { for (int i = head[x]; i; i = nex[i]) revise(1, 0, n - 1, 0, v[i] - 1, w[i]); b[x] = a[x] + p[1]; } build(1, 1, n); printf( %I64d n , p[1]); while (T--) { int x = read(), y = read(); revise(1, 1, n, x, x, y - a[x]), a[x] = y; printf( %I64d n , p[1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int ReadInt() { int t; cin >> t; return t; } long long ReadLong() { long long t; cin >> t; return t; } int Vis[101][101]; vector<pair<int, int> > Road; int main() { int n, m; cin >> n >> m; if (m % 2 == 0 || n % 2 == 0) { if ((n % 2 == 0 && m % 2 != 0 && m != 1) || (n == 2 && m == 1)) { cout << 0 << n ; int x = 1, y = 1; Road.push_back({x, y}); Vis[x][y] = 1; while (1) { if (x + 1 <= n && !Vis[x + 1][y]) { x++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y + 1 <= m && !Vis[x][y + 1]) { y++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y - 1 > 0 && !Vis[x][y - 1]) { y--; Road.push_back({x, y}); Vis[x][y] = 1; } else if (x - 1 > 0 && !Vis[x - 1][y]) { x--; Road.push_back({x, y}); Vis[x][y] = 1; } else { Road.push_back({1, 1}); break; } } for (int i = 0; i < Road.size(); i++) cout << Road[i].first << << Road[i].second << n ; } else if ((m % 2 == 0 && n != 1) || (n == 1 && m == 2)) { cout << 0 << n ; int x = 1, y = 1; Road.push_back({x, y}); Vis[x][y] = 1; while (1) { if (x + 1 <= n && !Vis[x + 1][y]) { x++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y + 1 <= m && !Vis[x][y + 1]) { y++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (x - 1 > 0 && !Vis[x - 1][y]) { x--; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y - 1 > 0 && !Vis[x][y - 1]) { y--; Road.push_back({x, y}); Vis[x][y] = 1; } else { Road.push_back({1, 1}); break; } } for (int i = 0; i < Road.size(); i++) cout << Road[i].first << << Road[i].second << n ; } else { cout << 1 << n ; int x = 1, y = 1; Road.push_back({x, y}); Vis[x][y] = 1; while (1) { if (x + 1 <= n && !Vis[x + 1][y]) { x++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y + 1 <= m && !Vis[x][y + 1]) { y++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (x - 1 > 0 && !Vis[x - 1][y]) { x--; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y - 1 > 0 && !Vis[x][y - 1]) { y--; Road.push_back({x, y}); Vis[x][y] = 1; } else { cout << x << << y << << 1 << << 1 << n ; break; } } for (int i = 0; i < Road.size(); i++) cout << Road[i].first << << Road[i].second << n ; cout << 1 << << 1 << n ; } } else { cout << 1 << n ; int x = 1, y = 1; Road.push_back({x, y}); Vis[x][y] = 1; while (1) { if (x + 1 <= n && !Vis[x + 1][y]) { x++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y + 1 <= m && !Vis[x][y + 1]) { y++; Road.push_back({x, y}); Vis[x][y] = 1; } else if (x - 1 > 0 && !Vis[x - 1][y]) { x--; Road.push_back({x, y}); Vis[x][y] = 1; } else if (y - 1 > 0 && !Vis[x][y - 1]) { y--; Road.push_back({x, y}); Vis[x][y] = 1; } else { cout << x << << y << << 1 << << 1 << n ; break; } } for (int i = 0; i < Road.size(); i++) cout << Road[i].first << << Road[i].second << n ; cout << 1 << << 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int num = pow(10, 9) + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, k; cin >> n >> k; long long int c[n]; for (int i = 0; i < n; ++i) { cin >> c[i]; } long long int max_diff = -1; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; j++) { if (abs(c[i] - c[j]) > max_diff) max_diff = abs(c[i] - c[j]); } } if (max_diff > k) { cout << NO ; } else { cout << YES << endl; for (int i = 0; i < n; ++i) { for (int j = 1; j <= c[i]; j++) { if (j % k == 0) cout << k << ; else cout << j % k << ; } cout << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int N = (int)3e5 + 100; vector<int> g[N]; vector<pair<int, int> > G[N]; map<int, long long> vToMinCost[N]; multiset<long long> costs[N]; long long addToAll[N]; int ansAt[N]; void upd(int id, int v, long long x) { x -= addToAll[id]; if (vToMinCost[id].count(v) == 0 || vToMinCost[id][v] > x) { if (vToMinCost[id].count(v) != 0) costs[id].erase(costs[id].find(vToMinCost[id][v])); vToMinCost[id][v] = x; costs[id].insert(x); } } void del(int id, int v) { if (vToMinCost[id].count(v)) { costs[id].erase(costs[id].find(vToMinCost[id][v])); vToMinCost[id].erase(v); } } void solve(int v, int par) { ansAt[v] = v; for (auto p : G[v]) upd(v, p.first, p.second); for (int to : g[v]) { if (to == par) continue; solve(to, v); int a = ansAt[v], b = ansAt[to]; if (vToMinCost[a].size() < vToMinCost[b].size()) swap(a, b); del(a, to); del(b, to); if (vToMinCost[a].empty() || vToMinCost[b].empty()) { printf( -1 n ); exit(0); } long long mn = *costs[b].begin() + addToAll[b]; long long mna = *costs[a].begin() + addToAll[a]; addToAll[a] += mn; addToAll[b] += mna; for (auto p : vToMinCost[b]) upd(a, p.first, p.second + addToAll[b]); ansAt[v] = a; } } int main(int, char **) { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n - 1; i++) { int a, b; scanf( %d%d , &a, &b); a--; b--; g[a].push_back(b); g[b].push_back(a); } for (int i = 0; i < n; i++) G[i].push_back(make_pair(i, 0)); for (int i = 0; i < m; i++) { int a, b, c; scanf( %d%d%d , &a, &b, &c); a--; b--; G[a].push_back(make_pair(b, c)); } solve(0, -1); int id = ansAt[0]; long long ans = *costs[id].begin() + addToAll[id]; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, qu, f[100005], v[100005 + 100005], o[100005 + 100005], p, s[100005], r, fr[100005], to[100005], si[100005], curm, grp[100005], gr, rt[100005]; bool u[100005], vis[100005]; vector<int> b[100005], c[100005], q[100005], ans[100005]; void bd(int a, int b) { v[++p] = b; o[p] = f[a]; f[a] = p; } void merge(vector<int> &a, vector<int> b) { vector<int> c; int l = 0, r = 0; while (l < a.size() || r < b.size()) { if (l == a.size()) c.push_back(b[r++]); else if (r == b.size()) c.push_back(a[l++]); else if (a[l] < b[r]) c.push_back(a[l++]); else c.push_back(b[r++]); } a = c; if (a.size() > 11) a.resize(11); } void size(int x, int y) { s[x] = vis[x] = 1; for (int i = (f[x]); i; i = o[i]) if (v[i] != y && !u[v[i]]) { size(v[i], x); s[x] += s[v[i]]; } } void pick(int x, int y, int z) { int m = s[z] - s[x]; for (int i = (f[x]); i; i = o[i]) if (v[i] != y && !u[v[i]]) { pick(v[i], x, z); m = max(m, s[v[i]]); } if (m < curm) { curm = m; r = x; } } void group(int x, int y, int z) { grp[x] = z; for (int i = (f[x]); i; i = o[i]) if (v[i] != y && !u[v[i]]) group(v[i], x, z); } void dfs(int x, int y) { c[x] = c[y]; merge(c[x], b[x]); for (int i = (0); i < (q[x].size()); i++) { int d = q[x][i]; if (vis[fr[d]] && vis[to[d]] && grp[fr[d]] != grp[to[d]]) { merge(ans[d], c[x]); rt[d] = r; } } for (int i = (f[x]); i; i = o[i]) if (v[i] != y && !u[v[i]]) dfs(v[i], x); } void reset(int x, int y) { vis[x] = 0; for (int i = (f[x]); i; i = o[i]) if (v[i] != y && !u[v[i]]) reset(v[i], x); } void root(int x) { size(x, 0); curm = 100005; pick(x, 0, x); grp[r] = 0; gr = 1; u[r] = 1; for (int i = (f[r]); i; i = o[i]) if (!u[v[i]]) group(v[i], r, gr++); for (int i = (0); i < (q[r].size()); i++) { int d = q[r][i]; if (vis[fr[d]] && vis[to[d]]) rt[d] = r; } for (int i = (f[r]); i; i = o[i]) if (!u[v[i]]) dfs(v[i], 0); reset(r, 0); for (int i = (f[r]); i; i = o[i]) if (!u[v[i]]) root(v[i]); } int main() { scanf( %d %d %d , &n, &m, &qu); for (int i = (1); i < (n); i++) { int a, b; scanf( %d %d , &a, &b); bd(a, b); bd(b, a); } for (int i = (1); i <= (m); i++) { int t; scanf( %d , &t); b[t].push_back(i); } for (int i = (1); i <= (n); i++) if (b[i].size() > 11) b[i].resize(11); for (int i = (1); i <= (qu); i++) { scanf( %d %d %d , &fr[i], &to[i], &si[i]); q[fr[i]].push_back(i); q[to[i]].push_back(i); } root(1); for (int i = (1); i <= (qu); i++) { merge(ans[i], b[rt[i]]); if (ans[i].size() > si[i]) ans[i].resize(si[i]); printf( %d , ans[i].size()); for (int j = (0); j < (ans[i].size()); j++) printf( %d , ans[i][j]); puts( ); } scanf( n ); } |
#include <bits/stdc++.h> using namespace std; long long n, m, k, l, r, s, t; long long modpow(long long x, long long y) { if (y == 0) return 1 % 1000000009; long long u = modpow(x, y / 2); u = u * u % 1000000009; if (y % 2) u = u * x % 1000000009; return u; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; l = (n / k) * (k - 1) + n % k; r = m - l; if (r <= 0) { cout << m << endl; return 0; } s = m - r * (k); if (s <= 0) s = 0; t = modpow(2, r + 1); t = (t + 1000000009 - 2) % 1000000009; t = t * k % 1000000009; s = s + t; cout << s % 1000000009 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool is_prime(long long n) { if (n == 2) return true; if (n < 2) return false; for (long long i = 3; i * i <= n; ++i) if (!(n % i)) return false; return true; } vector<long long> divison(long long n) { vector<long long> v; for (long long i = 1; i * i <= n; ++i) if (!(n % i)) v.push_back(i), v.push_back(n / i); return v; } void printnumberinbinary(unsigned long long t) { if (!t) return; printnumberinbinary(t >> 1); cout << (t & 1); } int numberofdiv(int t) { int ans = 0, x; for (x = 1; x * x < t; x++) { if (!(t % x)) ans += 2; } if (x * x == t) ans++; return ans; } vector<set<int>> adj(1e5 + 1); vector<bool> vis(1e5 + 1); void dfs(int t) { cout << t << ; vis[t] = true; for (auto f : adj[t]) if (!vis[f]) dfs(f); } int main() { int t; cin >> t; while (t--) { int a, y = 0; cin >> a; vector<int> v(a + 1, 0); for (int x = 0; x < a; x++) { int s; cin >> s; int flag = 0; while (s--) { int y; cin >> y; if (!v[y] && !flag) { v[y]++; flag++; } } if (!flag) y = x + 1; } if (!y) cout << OPTIMAL ; else { cout << IMPROVE n ; for (int x = 1; x < v.size(); x++) { if (!v[x]) { cout << y << << x; break; } } } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 100500; bool w, w1; int main() { srand(time(NULL)); int n, m, mn, mx; cin >> n >> m >> mn >> mx; for (int i = 1; i <= m; i++) { int x; cin >> x; if (mn > x || mx < x) cout << Incorrect , exit(0); if (x == mn) w = true; if (x == mx) w1 = true; } if (w && w1) cout << Correct , exit(0); if (w || w1) if (n - m > 0) cout << Correct , exit(0); else cout << Incorrect , exit(0); if (n - m > 1) cout << Correct , exit(0); else cout << Incorrect , exit(0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 5; int n, a[N][N]; char s[N]; bool vis[N]; void dfs(int x, int fa) { vis[x] = 1; for (int i = 1; i <= n; i++) { if (!a[x][i] || i == fa || i == x) continue; if (a[i][fa]) printf( %d %d %d n , x, i, fa), exit(0); if (!vis[i]) dfs(i, x); } } signed main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= n; j++) a[i][j] = s[j] - 0 ; } for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i, 0); puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); if (arr[n - 1] < arr[n - 2] + arr[n - 3]) { cout << YES << endl; for (int i = 0; i < n - 2; i++) { cout << arr[i] << ; } cout << arr[n - 1] << << arr[n - 2]; } else { cout << NO ; } } |
#include <bits/stdc++.h> int main() { int n, m; int r = 0, a = 0, v = 0; double es = 0.0; scanf( %d%d , &n, &m); r = 2 * n; v = 5 * n; a = 8 * n; es = (double)r / m; r = r / m; if (es - r != 0.00) { r++; } es = (double)v / m; v = v / m; if (es - v != 0.00) { v++; } es = (double)a / m; a = a / m; if (es - a != 0.00) { a++; } printf( %d , a + v + r); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int c[n]; for (int i = 0; i < n; i++) c[i] = a[i]; int b[n]; b[0] = a[0]; for (int i = 0; i < n - 1; i++) { if (a[i] + a[i + 1] >= k) b[i + 1] = a[i + 1]; else { b[i + 1] = k - a[i]; a[i + 1] = b[i + 1]; } } int sum = 0; for (int i = 0; i < n; i++) { sum = sum + b[i] - c[i]; } cout << sum << endl; for (int i = 0; i < n; i++) cout << b[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N6 = 1e6 + 6, N3 = 1e3 + 6, oo = 1e9 + 9; int n, a[N6], ans; bool ok; int main() { ios_base ::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= n; ++i) { if (!a[i]) { int cnt = 0; while (!a[i] && i <= n) { ++i; ++cnt; } if ((cnt == 1 && !ok) || (cnt > 1) || (i > n && cnt == 1)) ans += cnt; } if (a[i]) ok = 1; } cout << abs(n - ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; int k; cin >> n >> k; int octr = 0; int a[n]; int sum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 != 0) octr++; sum = sum + a[i]; } if (octr >= k) { if ((sum % 2 != 0 && k % 2 != 0) || (sum % 2 == 0 && k % 2 == 0)) { cout << YES << endl; int f = 0; while (k > 1) { if (a[f] % 2 != 0) { cout << f + 1 << ; k--; } f++; } cout << n << ; cout << endl; } else cout << NO << endl; } else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long int llINF = (long long)(1e18) + 100; const long long int MAXN = 1e6 + 10; int lp[MAXN]; vector<int> pr; void crivo() { for (long long int i = 2; i < MAXN; i++) { if (lp[i] == 0) { lp[i] = i; pr.push_back(i); } for (long long int j = 0; j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] < MAXN; ++j) lp[i * pr[j]] = pr[j]; } } int n, dist[MAXN]; vector<int> adj[MAXN], dcp[MAXN]; vector<pair<int, int> > edge; int other(int idx, int u) { return edge[idx].first == u ? edge[idx].second : edge[idx].first; } int bfs(int p) { memset(dist, 0, sizeof(dist)); queue<pair<int, int> > fila; for (int x : adj[p]) { fila.push({x, other(x, p)}); dist[other(x, p)] = 1; } int u, v, ans = INF; pair<int, int> aux; while (!fila.empty()) { aux = fila.front(); fila.pop(); u = aux.second; for (int w : adj[u]) { if (w != aux.first) { v = other(w, u); if (dist[v] == 0 and v != p) { fila.push({w, v}); dist[v] = dist[u] + 1; } else ans = min(ans, dist[u] + dist[v] + 1); } } } return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); crivo(); lp[1] = 1; cin >> n; for (int i = 2; i < MAXN; i++) { dcp[i] = dcp[i / lp[i]]; auto it = find(dcp[i].begin(), dcp[i].end(), lp[i]); if (it != dcp[i].end()) dcp[i].erase(it); else dcp[i].push_back(lp[i]); } int a; for (int i = 0; i < n; i++) { cin >> a; if (dcp[a].empty()) { cout << 1 << n ; return 0; } if (dcp[a].size() == 1) dcp[a].push_back(1); edge.push_back({dcp[a][0], dcp[a][1]}); adj[dcp[a][0]].push_back(i); adj[dcp[a][1]].push_back(i); } int ans = INF; pr.insert(pr.begin(), 1); for (int p : pr) { if (p * p > MAXN) break; ans = min(ans, bfs(p)); } cout << (ans == INF ? -1 : ans) << n ; } |
#include <bits/stdc++.h> using namespace std; struct obj { int id; int f, t; obj(int a, int b, int c) { id = a; f = b; t = c; } }; bool cmpup(obj a, obj b) { if (a.f == b.f) { return a.id > b.id; } return a.f < b.f; } bool cmpdown(obj a, obj b) { if (a.f == b.f) { return a.id < b.id; } return a.f > b.f; } int n; vector<obj> up; vector<obj> down; int a[105], d[105]; int now[105]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , &a[i], &d[i]); now[i] = a[i]; if (d[i] > 0) up.push_back(obj(i, a[i], a[i] + d[i])); else if (d[i] < 0) down.push_back(obj(i, a[i], a[i] + d[i])); } sort(up.begin(), up.end(), cmpup); sort(down.begin(), down.end(), cmpdown); int ans = 0; for (int i = 0; i < up.size(); i++) { for (int j = 0; j < n; j++) { if (j == up[i].id) continue; if (now[j] < up[i].f || now[j] > up[i].t) continue; if (now[j] == up[i].f) { if (j < up[i].id) ans++; } else if (now[j] == up[i].t) { if (j > up[i].id) ans++; } else { ans++; } } now[up[i].id] = up[i].t; } for (int i = 0; i < down.size(); i++) { for (int j = 0; j < n; j++) { if (j == down[i].id) continue; if (now[j] < down[i].t || now[j] > down[i].f) continue; if (now[j] == down[i].f) { if (j > down[i].id) ans++; } else if (now[j] == down[i].t) { if (j < down[i].id) ans++; } else { ans++; } } now[down[i].id] = down[i].t; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795l; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; } return 0; } template <typename T1, typename T2> inline bool umn(T1& a, T2 b) { if (b < a) { a = b; return 1; } return 0; } struct Input { int n, k; bool read() { if (!(cin >> n >> k)) { return false; } return true; } void init(const Input& input) { *this = input; } }; struct Data : Input { long long ans; void write() { cout << ans << n ; } virtual void solve() {} virtual void clear() { *this = Data(); } }; struct Solution : Data { void solve() { ans = 0; while (n > 1 && k > 0) { ans += 2 * (n - 1) - 1; n -= 2; --k; } } void clear() { *this = Solution(); } }; Solution sol; int main() { cout.setf(ios::showpoint | ios::fixed); cout.precision(20); sol.read(); sol.solve(); sol.write(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; if (k <= (n + 1) / 2) { cout << k * 2 - 1 << n ; } else cout << (k - (n + 1) / 2) * 2 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int find(vector<long long int> &p, long long int i) { if (p[i] == -1) return i; return find(p, p[i]); } void solve() { string st; cin >> st; long long int c = 0; for (long long int i = 0; i < st.size(); i++) { if (st[i] == > or st[i] == < ) { continue; } if (st[i] == / ) { c--; for (long long int j = 0; j < 2 * c; j++) { cout << ; } cout << </ << st[i + 1] << > << endl; } else if (st[i - 1] != / ) { for (long long int j = 0; j < 2 * c; j++) { cout << ; } cout << < << st[i] << > << endl; c++; } } } int main() { { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int xx[] = {0, 0, -1, 1}, yy[] = {-1, 1, 0, 0}; using ll = long long; using ppi = pair<int, int>; using ppl = pair<ll, ll>; ll d[3001][3001]; int main() { ios::sync_with_stdio(false); cin.tie(0); int T; cin >> T; while (T--) { int N; cin >> N; vector<int> v(N); for (long long i = (0); i < (N); ++i) { cin >> v[i]; } memset(d, 0, sizeof(d)); for (int i = N - 1; 0 <= i; --i) { d[i][v[i]] = 1; if (i + 1 < N) { for (long long x = (1); x <= (N); ++x) { d[i][x] += d[i + 1][x]; } } } ll ans = 0; for (long long j = (1); j < (N - 2); ++j) { for (long long k = (j + 1); k < (N - 1); ++k) { ans += (d[0][v[k]] - d[j][v[k]]) * (d[k + 1][v[j]]); } } cout << ans << ((char)10); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; long long a[300100], sum[300100]; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); for (int i = n - 1; i >= 0; i--) sum[i] = sum[i + 1] + a[i]; long long ans = sum[0]; sort(sum + 1, sum + n); for (int i = 0; i < k - 1; i++) ans += sum[n - 1 - i]; printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char alphz[27] = { a , b , c , d , e , f , g , h , i , j , k , l , m , n , o , p , q , r , s , t , u , v , w , x , y , z }; float Euclidean(long long x1, long long x2, long long y1, long long y2) { return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)); } long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } long long LCM(long long a, long long b) { return (a * b) / gcd(a, b); } void PrimeFactor(long long n) { while (n % 2 == 0) { n /= 2; } for (int i = 3; i <= sqrt(n); i += 2) { if (n % i == 0) { n /= i; } } if (n > 2) { }; } bool is_square(long long x) { long long l = 0, r = x; while (l <= r) { long long mid = l + (r - l) / 2; if (mid * mid == x) return true; if (mid * mid > x) r = mid - 1; else l = mid + 1; } return false; } long long power(long long x, long long y) { long long temp; if (y == 0) return 1; temp = power(x, y / 2); if (y % 2 == 0) return temp * temp; else return x * temp * temp; } bool is_Prime(int x) { if (x == 2) return 1; else if (x % 2 == 0 || x < 2) return 0; for (int i = 3; i * i <= x; i += 2) if (x % i == 0) return 0; return 1; } const int N = 1e+5; int aseg[4], seg[4]; void SEGBuild(int pos, int low, int hig) { if (low == hig) seg[pos] = aseg[low]; else { int mid = low + (hig - low) / 2; SEGBuild(2 * pos, low, mid); SEGBuild(2 * pos + 1, mid + 1, hig); if (seg[2 * pos] < seg[2 * pos + 1]) seg[pos] = seg[2 * pos]; else seg[pos] = seg[2 * pos + 1]; } } void SEGUpdate(int pos, int idx, int low, int hig, int val) { if (low == hig) { aseg[idx] = val; seg[pos] = val; } else { int mid = low + (hig - low) / 2; if (idx >= low && idx <= mid) SEGUpdate(2 * pos, idx, low, mid, val); else SEGUpdate(2 * pos + 1, idx, mid + 1, hig, val); seg[pos] = min(seg[2 * pos + 1], seg[2 * pos]); } } int ANSQuery(int pos, int low, int hig, int l, int r) { if (l > hig || low > r) return 1e+5; if (l <= low && r >= hig) return seg[pos]; else { int p1, p2; int mid = low + (hig - low) / 2; p1 = ANSQuery(2 * pos, low, mid, l, r); p2 = ANSQuery(2 * pos + 1, mid + 1, hig, l, r); return min(p1, p2); } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int k; string s; cin >> k >> s; vector<int> a(k, 0); int len = (int)s.size(); if (len == 1) { if (k > 1) return cout << IMPOSSIBLE n , 0; return cout << a << n , 0; } int i = 0, j = len - 1; while (i < j) { if (s[i] != ? && s[j] != ? && s[i] != s[j]) return cout << IMPOSSIBLE n , 0; if (s[i] != ? ) a[s[i] - a ]++; if (s[j] != ? ) a[s[j] - a ]++; i++, j--; } int mid = len / 2; if (len % 2 == 0) i = mid - 1, j = mid; else i = mid, j = mid; while (i >= 0) { if (s[i] != ? && s[j] != ? ) a[s[i] - a ] += 2; else if (s[i] == ? && s[j] != ? ) s[i] = s[j], a[s[j] - a ] += 2; else if (s[i] != ? && s[j] == ? ) s[j] = s[i], a[s[i] - a ] += 2; else { int idx = 0; for (int i = k - 1; i >= 0; i--) { if (a[i] == 0) { idx = i; break; } } s[i] = s[j] = idx + a ; a[idx] += 2; } i--, j++; } for (int i = 0; i < k; i++) if (!a[i]) return cout << IMPOSSIBLE n , 0; cout << s << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int rev(int ans) { if (ans == 1) return 0; else return 1; } int main() { int arr[3][3], ans[3][3]; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cin >> arr[i][j]; ans[i][j] = 1; } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { if (arr[i][j] % 2 != 0) { if (i - 1 >= 0) { ans[i - 1][j] = rev(ans[i - 1][j]); } if (i + 1 < 3) { ans[i + 1][j] = rev(ans[i + 1][j]); } if (j + 1 < 3) { ans[i][j + 1] = rev(ans[i][j + 1]); } if (j - 1 >= 0) { ans[i][j - 1] = rev(ans[i][j - 1]); } ans[i][j] = rev(ans[i][j]); } } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cout << ans[i][j]; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1, c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return f == 1 ? x : -x; } const int N = 1e5 + 4; int n, a[N], c[40]; inline void solve() { memset(c, 0, sizeof(c)); n = read(); for (int i = 1; i <= n; i++) { a[i] = read(); for (int j = 0; j < 30; j++) if ((a[i] >> j) & 1) c[j]++; } for (int i = 29; i >= 0; i--) if (c[i] & 1) { if (c[i] % 4 == 1) { puts( WIN ); } else { puts((n & 1) ? LOSE : WIN ); } return; } puts( DRAW ); } int main() { for (int T = read(); T--;) solve(); return (0 - 0); } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000001; const double EPS = 10e-9; int const S = 1 << 19; int n, a[S], leftlink[S], rightlink[S], decrease; pair<int, int> tree[2 * S]; pair<int, int> Min() { return tree[1]; } void Init() { tree[S] = make_pair(INF, 0); for (int i = 1; i <= (n); ++i) tree[i + S] = make_pair(a[i], i); for (int i = n + 1; i <= (S - 1); ++i) tree[S + i] = make_pair(INF, i); for (int i = S - 1; i >= (1); --i) tree[i] = min(tree[2 * i], tree[2 * i + 1]); } void Delete(int p) { for (tree[p + S] = make_pair(INF, p), p += S, p >>= 1; p; p >>= 1) tree[p] = min(tree[p * 2], tree[p * 2 + 1]); } int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 1; i <= (n); ++i) { cin >> a[i]; leftlink[i] = i - 1; rightlink[i] = i + 1; } rightlink[n] = 0; Init(); pair<int, int> greedy; long long ans = 0; while (n) { if (n <= 2) break; greedy = Min(); Delete(greedy.second); if (!leftlink[greedy.second]) { ans += ((long long)(n - 2)) * (greedy.first - decrease); leftlink[rightlink[greedy.second]] = 0; decrease = greedy.first; --n; continue; } if (!rightlink[greedy.second]) { ans += ((long long)(n - 2)) * (greedy.first - decrease); decrease = greedy.first; rightlink[leftlink[greedy.second]] = 0; --n; continue; } leftlink[rightlink[greedy.second]] = leftlink[greedy.second]; rightlink[leftlink[greedy.second]] = rightlink[greedy.second]; ans += min(a[leftlink[greedy.second]], a[rightlink[greedy.second]]) - decrease; --n; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n = 0, m = 0, temp = 0; cin >> n >> m; int arr[n + 1]; fill(arr, arr + n + 1, -1); for (int i = 1; i <= m; i++) { cin >> temp; int k = temp; while (k <= n && arr[k] == -1) { arr[k] = temp; k++; } } for (int j = 1; j <= n; j++) cout << arr[j] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, cost; int di[4] = {0, -1, 0, 1}; int dj[4] = {-1, 0, 1, 0}; char grid[51][51]; int vis[51][51]; pair<int, int> pi; pair<int, int> pf; vector<pair<int, int>> ili; vector<pair<int, int>> ilf; void dfs(int r, int c, vector<pair<int, int>>* island) { vis[r][c] = 1; (*island).push_back({r, c}); for (int v = 0; v < 4; v++) { int i = r + di[v]; int j = c + dj[v]; if (i > 0 && i <= n && j > 0 && j <= n) { if (grid[i][j] == 0 && !vis[i][j]) { dfs(i, j, island); } } } } int main() { cin >> n; cin >> pi.first >> pi.second; cin >> pf.first >> pf.second; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> grid[i][j]; } } dfs(pi.first, pi.second, &ili); if (vis[pf.first][pf.second]) { cout << 0 << endl; } else { dfs(pf.first, pf.second, &ilf); int less = (int)INFINITY; for (int i = 0; i < (int)ili.size(); i++) { for (int j = 0; j < (int)ilf.size(); j++) { cost = pow((ili[i].first - ilf[j].first), 2) + pow((ili[i].second - ilf[j].second), 2); if (cost < less && cost) { less = cost; } } } cout << less << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const long long LLINF = 1000000000000000007LL; const double EPS = 1e-9; const int sz = 200100; int ar[600][600]; int p[600][600]; int suf_sum_2d(int i1, int j1, int i2, int j2) { return p[i2 + 1][j2 + 1] - p[i2 + 1][j1] - p[i1][j2 + 1] + p[i1][j1]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> ar[i][j]; p[i + 1][j + 1] = p[i][j + 1] + p[i + 1][j] - p[i][j] + ar[i][j]; } } int mx = -INF; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { int r = min(min(i + 1, j + 1), min(n - i, m - j)); int res = ar[i][j]; for (int k = 1; k < r; ++k) { res = suf_sum_2d(i - k, j - k, i + k, j + k) - res - ar[i - k + 1][j - k]; mx = max(mx, res); } } } cout << mx; } |
#include <bits/stdc++.h> using namespace std; unordered_map<int, int> mp; bool f(int mid) { if (mp.size() < mid) return false; int a = 0, b = 0; bool fl = 0; for (auto it = mp.begin(); it != mp.end(); it++) { if (it->second > mid) { a = mid; if (fl == 0) { b++; } else { b += 2; fl = 0; } } else if (it->second == mid) { if (a == 0) { a = mid; fl = 1; } else b++; } else if (it->second < mid) b++; } return a >= mid && b >= mid; } int main() { int test; cin >> test; for (int t = 1; t <= test; t++) { int n, ans = 0, imax = 0; cin >> n; mp.clear(); for (int i = 0; i < n; i++) { int temp; cin >> temp; mp[temp]++; imax = max(imax, mp[temp]); } int low = 1, high = imax; while (low <= high) { int mid = low + (high - low) / 2; if (f(mid)) { ans = mid; low = mid + 1; } else high = mid - 1; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int INT_MAX_VAL = (int)0x3F3F3F3F; int INT_MIN_VAL = (int)-0x3F3F3F3F; long long LONG_MAX_VAL = (long long)0x3F3F3F3F3F3F3F3F; long long LONG_MIN_VAL = (long long)-0x3F3F3F3F3F3F3F3F; vector<long long> G[5005]; long long n; int W; int cnt[5005]; int dp[2][5005][5005]; int dfs2(int v, int p) { if (G[v].size() == 1) { cnt[v] = 1; return 1; } int res = 0; for (auto &w : G[v]) if (w != p) res += dfs2(w, v); cnt[v] = res; return res; } void dfs(int v, int p) { dp[1][v][0] = 0; if (G[v].size() == 1) { dp[0][v][1] = 0; return; } dp[0][v][0] = 0; dp[1][v][0] = 0; for (auto &w : G[v]) { if (w == p) continue; dfs(w, v); for (int i = W; i >= 0; --i) { int d0 = INT_MAX_VAL; int d1 = INT_MAX_VAL; for (int j = min(i, cnt[w]); j >= 0; --j) { d0 = min(d0, dp[0][w][j] + dp[0][v][i - j]); d0 = min(d0, dp[1][w][j] + dp[0][v][i - j] + 1); d1 = min(d1, dp[1][w][j] + dp[1][v][i - j]); d1 = min(d1, dp[0][w][j] + dp[1][v][i - j] + 1); } dp[0][v][i] = d0; dp[1][v][i] = d1; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); memset(dp, 0x3F, 2 * 5005 * 5005 * sizeof(int)); cin >> n; for (long long(i) = 0LL; (i) < (n - 1); (i)++) { long long a, b; cin >> a >> b; --a, --b; G[a].push_back(b); G[b].push_back(a); } if (n == 2) { cout << 1 << n ; return 0; } int i = 0; while (G[i].size() == 1) ++i; W = dfs2(i, -1) / 2; dfs(i, -1); cout << dp[0][i][W] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; struct ban { long long s, a, b; }; bool operator<(const ban& a, const ban& b) { return (a.a - a.b) > (b.a - b.b); } int n; long long s; ban a[N]; long long sum; long long ans; int main() { ios_base::sync_with_stdio(false); cin >> n >> s; for (int i = 0; i < n; ++i) { cin >> a[i].s >> a[i].a >> a[i].b; sum += a[i].s; } sort(a, a + n); long long t = 0; for (int i = 0; i < n; ++i) { if (a[i].a - a[i].b > 0) t += a[i].s; } long long yans = 0; for (int i = 0; i < n; ++i) { if (a[i].a - a[i].b > 0) yans += (a[i].a * a[i].s); } long long tt = (((sum / s) + !!(sum % s)) - ((t / s) + !!(t % s))) * s; for (int i = n - 1; i >= 0; --i) { if (a[i].a - a[i].b <= 0) { if (tt > a[i].s) { tt -= a[i].s; yans += (a[i].b * a[i].s); } else { yans += (a[i].b * tt); yans += (a[i].a * (a[i].s - tt)); tt = 0; } } } ans = yans; t = 0; for (int i = n - 1; i >= 0; --i) { if (a[i].b - a[i].a > 0) t += a[i].s; } yans = 0; for (int i = n - 1; i >= 0; --i) { if (a[i].b - a[i].a > 0) yans += (a[i].b * a[i].s); } tt = (((sum / s) + !!(sum % s)) - ((t / s) + !!(t % s))) * s; for (int i = 0; i < n; ++i) { if (a[i].b - a[i].a <= 0) { if (tt > a[i].s) { tt -= a[i].s; yans += (a[i].a * a[i].s); } else { yans += (a[i].a * tt); yans += (a[i].b * (a[i].s - tt)); tt = 0; } } } ans = max(ans, yans); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace ::std; int NEGINF = -1e9; int main() { ifstream fin( input.txt ); int n, l, r; cin >> n >> l >> r; vector<int> a(n), b(n), p(n), c(n); for (int i = 0; i < n; i++) { cin >> a[i]; } vector<int> ppos(n); for (int i = 0; i < n; i++) { cin >> p[i]; ppos[p[i] - 1] = i; } int loc, csmall = NEGINF; for (int i = 0; i < n; i++) { loc = ppos[i]; if (csmall + 1 + a[loc] < l) { b[loc] = l; csmall = b[loc] - a[loc]; } else if (csmall + 1 + a[loc] > r) { cout << -1 n ; return 0; } else { csmall++; b[loc] = a[loc] + csmall; } } for (int i = 0; i < n; i++) { cout << b[i] << ; } } |
#include <bits/stdc++.h> using namespace std; template <typename T> T abs(T x) { return x > 0 ? x : -x; } char a[2005][2005]; bool used[2005][2005]; queue<pair<int, int> > q; int nu() { puts( Not unique ); return 0; } bool impasse(int ic, int jc) { int cnt = 0; cnt += (a[ic][jc - 1] == . ); cnt += (a[ic][jc + 1] == . ); cnt += (a[ic - 1][jc] == . ); cnt += (a[ic + 1][jc] == . ); return (cnt < 2); } void add(int ic, int jc) { if (impasse(ic - 1, jc) && !used[ic - 1][jc]) { q.push(make_pair(ic - 1, jc)); used[ic - 1][jc] = true; } if (impasse(ic + 1, jc) && !used[ic + 1][jc]) { q.push(make_pair(ic + 1, jc)); used[ic + 1][jc] = true; } if (impasse(ic, jc - 1) && !used[ic][jc - 1]) { q.push(make_pair(ic, jc - 1)); used[ic][jc - 1] = true; } if (impasse(ic, jc + 1) && !used[ic][jc + 1]) { q.push(make_pair(ic, jc + 1)); used[ic][jc + 1] = true; } } int main() { int n, m; scanf( %d %d n , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %c , &a[i][j]); } scanf( %c , &a[0][0]); } for (int i = 0; i <= n + 1; i++) { a[i][0] = * ; a[i][m + 1] = * ; } for (int i = 0; i <= m + 1; i++) { a[0][i] = * ; a[n + 1][i] = * ; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (a[i][j] == * ) continue; int cnt = 0; cnt += (a[i][j - 1] == . ); cnt += (a[i][j + 1] == . ); cnt += (a[i - 1][j] == . ); cnt += (a[i + 1][j] == . ); if (cnt == 0) return nu(); if (cnt == 1) { used[i][j] = true; q.push(make_pair(i, j)); } } while (!q.empty()) { int ic = q.front().first; int jc = q.front().second; q.pop(); if (a[ic][jc] != . ) continue; if (a[ic + 1][jc] == . ) { a[ic][jc] = ^ ; a[ic + 1][jc] = v ; add(ic + 1, jc); } if (a[ic - 1][jc] == . ) { a[ic][jc] = v ; a[ic - 1][jc] = ^ ; add(ic - 1, jc); } if (a[ic][jc + 1] == . ) { a[ic][jc] = < ; a[ic][jc + 1] = > ; add(ic, jc + 1); } if (a[ic][jc - 1] == . ) { a[ic][jc] = > ; a[ic][jc - 1] = < ; add(ic, jc - 1); } if (a[ic][jc] == . ) return nu(); add(ic, jc); } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (a[i][j] == . ) return nu(); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { putchar(a[i][j]); } putchar( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long v[100100]; long long h[100100]; int main() { long long n, m; cin >> n >> m; long long vidx = 0; for (; vidx < n; ++vidx) { long long x; cin >> x; v[vidx] = x; } long long hidx = 0; for (long long loop = 0; loop < m; ++loop) { long long x1, x2, y; cin >> x1 >> x2 >> y; if (x1 > 1) continue; h[hidx] = x2; ++hidx; } sort(v, v + vidx); sort(h, h + hidx); v[vidx] = 1e9; ++vidx; long long res = n + m; for (long long idx = 0; idx < vidx; ++idx) { long long lim = v[idx]; auto it = lower_bound(h, h + hidx, lim) - h; res = min(res, hidx - it + idx); } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; long long przodek(long long n, long long m) { if (n == m) return n; if (n > m) return przodek(n / 2, m); return przodek(n, m / 2); } int main() { long long q; cin >> q; set<pair<long long, long long> > path_fee; for (int i = 0; i < q; i++) { long long op, v, u, w; cin >> op; if (op == 1) { cin >> u >> v >> w; long long prz = przodek(u, v); while (u != prz) { pair<long long, long long> act_fee = *path_fee.lower_bound({u, 0}); if (act_fee.first == u) path_fee.erase(act_fee); else act_fee.second = 0; path_fee.insert({u, act_fee.second + w}); u /= 2; } while (v != prz) { pair<long long, long long> act_fee = *path_fee.lower_bound({v, 0}); if (act_fee.first == v) path_fee.erase(act_fee); else act_fee.second = 0; path_fee.insert({v, act_fee.second + w}); v /= 2; } continue; } cin >> u >> v; long long cost = 0; long long prz = przodek(u, v); while (u != prz) { pair<long long, long long> act_fee = *path_fee.lower_bound({u, 0}); if (act_fee.first == u) { cost += act_fee.second; } u /= 2; } while (v != prz) { pair<long long, long long> act_fee = *path_fee.lower_bound({v, 0}); if (act_fee.first == v) { cost += act_fee.second; } v /= 2; } cout << cost << endl; } } |
#include <bits/stdc++.h> int arr[1100000]; using namespace std; int main() { memset(arr, 0, sizeof arr); int n; cin >> n; int x = 1, pre = 1; for (int i = 1; i <= n; i++) { int c; cin >> c; arr[x] = i; x += c; } x = arr[1]; for (int i = 1; i <= 1000000; i++) { if (!arr[i]) arr[i] = x; else x = arr[i]; } int q; cin >> q; while (q--) { cin >> x; cout << arr[x] << endl; } } |
#include <bits/stdc++.h> using namespace std; int n, x, l, r, m; int main() { cin >> n; int endtime = 0; while (n--) { cin >> x; endtime += x; } cin >> m; while (m--) { cin >> l >> r; if (endtime <= l) { cout << l << endl; return 0; } else if (endtime > r) { continue; } else { cout << endtime << endl; return 0; } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const int N6 = 1e6 + 6; const int N9 = 1e9 + 7; const long long INFLL = (long long)1e18 + 100; const int INF = 1e9 + 100; const long long mod = 1e9 + 9; const long long P = 31; int n, k, cur, ans; std::vector<int> g[1111]; map<pair<int, int>, bool> cnt; void solve() { cin >> n >> k; int cur; for (int i = 1; i <= n; ++i) { cur = 0; for (int j = 1; j <= n; ++j) { if (!cnt.count(make_pair(i, j)) && i != j) { ++cur; cnt[make_pair(i, j)]; cnt[make_pair(j, i)]; g[i].push_back(j); ++ans; } if (cur == k) { break; } } if (cur != k) { cout << -1; exit(0); } } cout << ans << n ; for (int i = 1; i <= n; ++i) { for (int j = 0; j < g[i].size(); ++j) { cout << i << << g[i][j] << n ; } } } int main() { int tt = 1; while (tt--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int a = 0; char c = getchar(); bool f = 0; while (!isdigit(c)) { if (c == - ) f = 1; c = getchar(); } while (isdigit(c)) { a = (a << 3) + (a << 1) + (c ^ 0 ); c = getchar(); } return f ? -a : a; } int point[51][3], N; void solve(int l, int r, int dir) { if (l == r) printf( (%01d*abs(((1-abs((t-%d)))+abs((abs((t-%d))-1))))) , point[l][dir] / 2, l, l); else { putchar( ( ); solve(l, l + r >> 1, dir); putchar( + ); solve((l + r >> 1) + 1, r, dir); putchar( ) ); } } int main() { N = read(); for (int i = 1; i <= N; ++i) { point[i][0] = read(); point[i][1] = read(); point[i][2] = read(); } solve(1, N, 0); putchar( n ); solve(1, N, 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int max_n = 100111, inf = 1000111222; const int max_lev = 18; int n, m, q, parent[max_lev][max_n], best_h[max_n], used[max_n], h[max_n]; int real_p[max_lev][max_n]; int tin[max_n], tout[max_n], cur; vector<int> g[max_n]; void dfs(int v, int p) { tin[v] = ++cur; parent[0][v] = p; real_p[0][v] = p; for (int to : g[v]) { if (to == p) { continue; } if (tin[to]) { if (tin[to] < tin[parent[0][v]]) { parent[0][v] = to; } } else { dfs(to, v); if (tin[parent[0][to]] < tin[parent[0][v]]) { parent[0][v] = parent[0][to]; } } } tout[v] = cur; } void get_all_p(int parent[max_lev][max_n]) { for (int lev = 1; lev < max_lev; ++lev) { for (int i = 0; i < n; ++i) { parent[lev][i] = parent[lev - 1][parent[lev - 1][i]]; } } } bool is_ancestor(int v1, int v2) { return tin[v1] <= tin[v2] && tout[v1] >= tout[v2]; } int lca(int v1, int v2) { if (is_ancestor(v1, v2)) { return v1; } for (int i = max_lev - 1; i >= 0; --i) { if (!is_ancestor(real_p[i][v1], v2)) { v1 = real_p[i][v1]; } } return real_p[0][v1]; } int get_d(int v, int up) { if (v == up) { return 0; } int res = 1; for (int i = max_lev - 1; i >= 0; --i) { if (!is_ancestor(parent[i][v], up)) { res += 1 << i; v = parent[i][v]; } } return res; } int main() { scanf( %d%d%d , &n, &m, &q); while (m--) { int u, v; scanf( %d%d , &u, &v); --u; --v; g[u].push_back(v); g[v].push_back(u); } dfs(0, 0); get_all_p(parent); get_all_p(real_p); while (q--) { int u, v; scanf( %d%d , &u, &v); --u; --v; int lc = lca(u, v); int ans = get_d(u, lc) + get_d(v, lc); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 6e5 + 8; const int T = 2e5 + 2; int n, b[N], t[N]; template <typename _Tp> inline void IN(_Tp& x) { char ch; bool flag = 0; x = 0; while (ch = getchar(), !isdigit(ch)) if (ch == - ) flag = 1; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); if (flag) x = -x; } struct Segment_Tree { long long sum[N << 2]; void update(int x, int l, int r, int pos, int val) { if (l == r) { sum[x] += val; return void(); } (pos <= ((l + r) >> 1)) ? update(((x) << 1), l, ((l + r) >> 1), pos, val) : update(((x) << 1 | 1), ((l + r) >> 1) + 1, r, pos, val); sum[x] = max(sum[((x) << 1)], sum[((x) << 1 | 1)]); } } Tree; int main() { IN(n); for (int i = 1; i <= n; ++i) IN(b[i]), t[i] = b[i] - i + T; for (int i = 1; i <= n; ++i) Tree.update(1, 1, N - 1, t[i], b[i]); printf( %lld n , Tree.sum[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; map<string, int> mp; vector<string> vr; int n, m; int a[105][105], b[105][105]; int xx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; int yy[8] = {-1, 0, 1, -1, 1, -1, 0, 1}; bool check(int i, int j) { if (i >= 0 && i < n && j >= 0 && j < m && a[i][j] != -2 && a[i][j] != -6) return true; return false; } bool Check(int i, int j) { if (i >= 0 && i < n && j >= 0 && j < m && b[i][j] == -6) return true; return false; } void dfs(int x, int y) { int X, Y, i; for (i = 0; i < 8; i++) { X = x + xx[i]; Y = y + yy[i]; if (check(X, Y)) b[X][Y]++; } } int main() { char ma[105][105]; while (~scanf( %d%d , &n, &m)) { int f = 0; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); for (int i = 0; i < n; i++) { cin >> ma[i]; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[i][j] = ma[i][j] - 0 ; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == -6) { b[i][j] = -6; dfs(i, j); } if (a[i][j] == -2) b[i][j] = -2; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (b[i][j] == -2) { for (int k = 0; k < 8; k++) { int X = xx[k] + i; int Y = yy[k] + j; if (Check(X, Y)) { f = 1; break; } } } if (a[i][j] != b[i][j]) { f = 1; break; } if (f == 1) break; } if (f == 1) break; } if (f) printf( NO n ); else printf( YES n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; cin >> t; while (t--) { long long int a, b, c, d; cin >> a >> b >> c >> d; string w, x, y, z, k = Ya , l = Tidak ; if (a == 0 && d == 0) { if (b % 2 == 1) { cout << Tidak Ya Tidak Tidak n ; } else { cout << Tidak Tidak Ya Tidak n ; } } else if (b == 0 && c == 0) { if (a % 2 == 1) { cout << Ya Tidak Tidak Tidak n ; } else { cout << Tidak Tidak Tidak Ya n ; } } else { if ((a + b) % 2 == 1) { cout << Ya Ya Tidak Tidak n ; } else { cout << Tidak Tidak Ya Ya n ; } } } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; pair<long long, int> arr[N]; long long t[4 * N] = {}; inline void update(int v, int vl, int vr, int pos, long long val) { if (vl == vr) { t[v] = val; return; } int vm = vl + (vr - vl) / 2; if (pos <= vm) update(2 * v + 1, vl, vm, pos, val); else update(2 * v + 2, vm + 1, vr, pos, val); t[v] = max(t[2 * v + 1], t[2 * v + 2]); } inline long long get(int v, int vl, int vr, int l, int r) { if (r < vl || vr < l) return 0; if (l <= vl && vr <= r) return t[v]; int vm = vl + (vr - vl) / 2; long long ql = get(2 * v + 1, vl, vm, l, r); long long qr = get(2 * v + 2, vm + 1, vr, l, r); return max(ql, qr); } inline bool c(pair<long long, int> x, pair<long long, int> y) { if (x.first != y.first) return x.first < y.first; else return x.second > y.second; } int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { long long r, h; cin >> r >> h; arr[i] = {1ll * r * r * h, i}; } sort(arr, arr + n, c); for (int i = 0; i < n; i++) { long long res = get(0, 0, n - 1, 0, max(0, arr[i].second - 1)); update(0, 0, n - 1, arr[i].second, res + arr[i].first); } cout << fixed << setprecision(6) << 3.14159265 * get(0, 0, n - 1, 0, n - 1) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; if (n % 2 == 0) cout << 2; else cout << 1; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; int n; char s[20]; int ans[300100]; vector<int> dep[300100]; int G[300100][26], siz[300100], son[300100]; vector<int *> a; void dfs(int o, int depth) { dep[depth].push_back(o); siz[o] = 1; for (int i = 0; i < 26; ++i) { if (G[o][i] == -1) continue; dfs(G[o][i], depth + 1); if (son[o] == -1 || siz[son[o]] < siz[G[o][i]]) { son[o] = G[o][i]; } siz[o] += siz[G[o][i]]; } } int DFS(int u, int v) { int ret = 0; for (int i = 0; i < 26; ++i) { if (G[u][i] == -1) continue; if (G[v][i] == -1) { G[v][i] = G[u][i]; ret += siz[G[u][i]]; a.push_back(&G[v][i]); } else { ret += DFS(G[u][i], G[v][i]); } } return ret; } int main() { memset(G, -1, sizeof(G)); memset(son, -1, sizeof(son)); scanf( %d , &n); for (int i = 1; i < n; ++i) { int u, v; scanf( %d%d%s , &u, &v, s); G[u][s[0] - a ] = v; } dfs(1, 0); int tmp = 0; for (int i = 0; i <= n; ++i) { a.clear(); ans[i] += tmp; for (auto &j : dep[i]) { if (son[j] != -1) ans[i + 1] += siz[son[j]] - 1; for (int k = 0; k < 26; ++k) { if (G[j][k] == -1 || son[j] == G[j][k]) continue; ans[i + 1] += DFS(G[j][k], son[j]); } } for (auto &i : a) { *i = -1; } tmp += (int)dep[i].size(); } tmp = 1; for (int i = 2; i <= n; ++i) { if (ans[tmp] > ans[i]) { tmp = i; } } printf( %d n%d n , ans[tmp], tmp); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string cad; cin >> n >> cad; int res = 0; for (int i = 0; i < n; ++i) { if (cad[i] == 0 ) { res++; break; } else { res++; } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; string s, ss; int m, l, r, k, i, j, n, p; int main() { cin >> s; cin >> m; ss = s; for (i = 1; i <= m; i++) { cin >> l >> r >> k; r--; l--; for (j = l; j <= r; j++) { p = r - l + 1; ss[j] = s[l + ((j - l - k) % p + p) % p]; } s = ss; } cout << ss << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2000000000; const int MAX = 10000000; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; while (cin >> n) { map<string, int> m; for (int i = 0; i < n; i++) { string s; cin >> s; m[s]++; } int mx = 0; for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) mx = max(mx, it->second); cout << mx << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a, i = 0, last = 0, current = 0; int main() { int x, y, z = 0, a = 0, c = 1; long long b; cin >> x; for (int i = 0; i < x; i++) { cin >> y >> z; a = z * 2; c = y * 2; if (a > c) { if (z > c) cout << z * z << endl; else cout << c * c << endl; } else { if (y > a) cout << y * y << endl; else cout << a * a << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int testnum; struct Point3 { double x, y, z; Point3(double _x = 0, double _y = 0, double _z = 0) { x = _x; y = _y; z = _z; } bool operator==(Point3 other) { return abs(x - other.x) < 1e-9 && abs(y - other.y) < 1e-9 && abs(z - other.z) < 1e-9; } bool operator!=(Point3 other) { return abs(x - other.x) > 1e-9 || abs(y - other.y) > 1e-9 || abs(z - other.z) > 1e-9; } double length() { return sqrt(x * x + y * y + z * z); } Point3 operator*(double k) { return Point3(k * x, k * y, k * z); } Point3 normalize() { return (*this) * (1 / length()); } Point3 operator+(Point3 other) { return Point3(x + other.x, y + other.y, z + other.z); } Point3 operator-(Point3 other) { return Point3(x - other.x, y - other.y, z - other.z); } double dist(Point3 other) { return (*this - other).length(); } double operator^(Point3 other) { return x * other.x + y * other.y + z * other.z; } Point3 operator*(Point3 other) { return Point3(y * other.z - z * other.y, z * other.x - x * other.z, x * other.y - y * other.x); } void display() { printf( Point3 (%lf , %lf , %lf) n , x, y, z); } }; Point3 operator*(double k, Point3 p) { return Point3(k * p.x, k * p.y, k * p.z); } struct Point2 { double x, y; Point2(double _x = 0, double _y = 0) { x = _x; y = _y; } double length() { return sqrt(x * x + y * y); } Point2 operator*(double k) { return Point2(k * x, k * y); } Point2 normalize() { return (*this) * (1 / length()); } Point2 operator+(Point2 other) { return Point2(x + other.x, y + other.y); } Point2 operator-(Point2 other) { return Point2(x - other.x, y - other.y); } double dist(Point2 other) { return (*this - other).length(); } double operator^(Point2 other) { return x * other.x + y * other.y; } double operator*(Point2 other) { return x * other.y - y * other.x; } void display() { printf( Point2 (%lf , %lf) n , x, y); } }; Point2 operator*(double k, Point2 p) { return Point2(k * p.x, k * p.y); } struct Plane { double a, b, c, d; Point3 A, B, C; Point3 N, O, X, Y; Plane() {} Plane(Point3 _AA, Point3 _BB, Point3 _CC) { A = _AA; B = _BB; C = _CC; Point3 normal = (B - A) * (C - A); N = normal.normalize(); a = N.x; b = N.y; c = N.z; d = -(A ^ N); O = Point3(-d * a, -d * b, -d * c); if (A != O) X = (A - O).normalize(); else X = (B - O).normalize(); Y = normal * X; } Plane(double _a, double _b, double _c, double _d) { double len = sqrt(_a * _a + _b * _b + _c * _c); a = _a / len; b = _b / len; c = _c / len; d = _d / len; N = Point3(a, b, c); if (a != 0) { A = Point3(-(d + 0 * b + 0 * c) / a, 0, 0); B = Point3(-(d + 1 * b + 0 * c) / a, 1, 0); C = Point3(-(d + 0 * b + 1 * c) / a, 0, 1); } else if (b != 0) { A = Point3(0, -(d + 0 * a + 0 * c) / b, 0); B = Point3(1, -(d + 1 * a + 0 * c) / b, 0); C = Point3(0, -(d + 0 * a + 1 * c) / b, 1); } else { A = Point3(0, 0, -(d + 0 * a + 0 * b) / c); B = Point3(1, 0, -(d + 1 * a + 0 * b) / c); C = Point3(0, 1, -(d + 0 * a + 1 * b) / c); } O = Point3(-d * a, -d * b, -d * c); if (A != O) X = (A - O).normalize(); else X = (B - O).normalize(); Y = N * X; } Point3 project(Point3 P) { return (P - (P ^ N) * N) + O; } Point2 project2D(Point3 P) { P = project(P); return Point2(P ^ X, P ^ Y); } double distance(Point3 p) { return abs(a * p.x + b * p.y + c * p.z + d); } void display() { printf( Plane (%lf , %lf , %lf , %lf) n , a, b, c, d); printf( A : ); A.display(); printf( B : ); B.display(); printf( C : ); C.display(); printf( N : ); N.display(); printf( O : ); O.display(); printf( X : ); X.display(); printf( Y : ); Y.display(); } }; void preprocess() {} int n, m; vector<Point3> p3; vector<Point2> p2; vector<Plane> plns; double eval(double x, double y) { double ans = 0; double dx, dy; for (int i = 0; i < n; i++) { dx = x - p2[i].x; dy = y - p2[i].y; ans = max(ans, dx * dx + dy * dy); } return ans; } pair<double, double> doTernaryY(double x) { double lo = 1e4; double hi = 0; for (int i = 0; i < n; i++) { lo = min(lo, p2[i].y); hi = max(hi, p2[i].y); } for (int iter = 0; iter < 35; iter++) { double y1 = (lo + lo + hi) / 3; double y2 = (lo + hi + hi) / 3; double val1 = eval(x, y1); double val2 = eval(x, y2); if (val1 < val2) hi = y2; else lo = y1; } double ans = (lo + hi) / 2; return make_pair(ans, eval(x, ans)); } pair<double, double> doTernaryX() { double lo = 1e4; double hi = 0; for (int i = 0; i < n; i++) { lo = min(lo, p2[i].x); hi = max(hi, p2[i].x); } for (int iter = 0; iter < 35; iter++) { double x1 = (lo + lo + hi) / 3; double x2 = (lo + hi + hi) / 3; double val1 = doTernaryY(x1).second; double val2 = doTernaryY(x2).second; if (val1 < val2) hi = x2; else lo = x1; } double ans = (lo + hi) / 2; return make_pair(ans, doTernaryY(ans).first); } void solve() { p2.resize(n); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) p2[j] = plns[i].project2D(p3[j]); pair<double, double> centre = doTernaryX(); double rad = sqrt(eval(centre.first, centre.second)); printf( %.9lf n , rad); } } bool input() { scanf( %d , &n); scanf( %d , &m); p3.resize(n); plns.resize(m); int a, b, c; for (int i = 0; i < n; i++) { scanf( %d , &a); scanf( %d , &b); scanf( %d , &c); p3[i] = Point3(a, b, c); } for (int i = 0; i < m; i++) { scanf( %d , &a); scanf( %d , &b); scanf( %d , &c); plns[i] = Plane(a, b, c, 0); } return true; } int main() { preprocess(); int T = 1; for (testnum = 1; testnum <= T; testnum++) { if (!input()) break; solve(); } } |
#include <bits/stdc++.h> using namespace std; long long int n, m, a[1000005]; multiset<long long int> st; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (long long int i = 1; i <= n; i++) cin >> a[i]; long long int ans = 0; for (long long int i = 1; i <= n; i++) { st.insert(a[i]); auto it = st.begin(); if (*it < a[i]) { ans += a[i] - *it; st.erase(it); st.insert(a[i]); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 10; int main() { ios_base ::sync_with_stdio(false), cout.tie(0), cin.tie(0); int n, cnt = 0; cin >> n; int sv = n; while (n--) { int x, y; cin >> x >> y; if (x < 0) ++cnt; } cout << (min(cnt, sv - cnt) <= 1 ? Yes n : No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200010]; int main() { long long n, k; cin >> n >> k; n -= k * (k + 1) / 2; if (n < 0) { cout << NO << endl; return 0; } for (int i = 0; i < k; i++) { a[i] = i + 1 + n / k + (i >= (k - n % k)); } bool ok = 1; for (int i = 1; i < k; i++) { if (a[i] > a[i - 1] * 2) { if (i == k - 1) ok = 0; a[k - 1]++; a[i]--; } } if (ok) { cout << YES << endl; for (int i = 0; i < k; i++) cout << a[i] << endl; } else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int s1 = count(arr, arr + n, 1); int s2 = count(arr, arr + n, -1); for (int i = 0; i < m; i++) { int a, b; scanf( %d %d , &a, &b); if ((b - a + 1) % 2 != 0) { printf( %d n , 0); } else { int c = (b - a + 1) / 2; if (s1 >= c && s2 >= c) { printf( %d n , 1); } else { printf( %d n , 0); } } } } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> mp; int main() { long long k, i; cin >> k; string s; cin >> s; long long ans = 0, cnt = 0; long long n = s.length(); mp[0] = 1; for (i = 0; i < n; i++) { if (s[i] == 1 ) { cnt++; } if (cnt >= k) { ans += mp[cnt - k]; } mp[cnt]++; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long N = (long long)1e5 + 5; long long a[N]; inline void solve() { long long n; cin >> n; queue<pair<long long, long long> > negative, positive; long long pos_sum = 0; for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); if (a[i] == 0) { continue; } if (a[i] > 0) { pos_sum += a[i]; positive.push({i, a[i]}); } else { negative.push({i, a[i]}); } } while (!positive.empty()) { long long p = positive.front().first; long long x = positive.front().second; while (!negative.empty() && negative.front().first < p) { negative.pop(); } if (negative.empty()) { break; } long long relax = min(x, -negative.front().second); positive.front().second -= relax; pos_sum -= relax; if (positive.front().second == 0) { positive.pop(); } if (relax >= -negative.front().second) { negative.pop(); } else { negative.front().second += relax; } } cout << pos_sum << endl; } signed main() { long long Q; cin >> Q; while (Q--) { solve(); } } |
/*...................................................................* *............___..................___.....____...______......___....* *.../|....../... ........./|...../... ...|.............|..../... ...* *../.|...../..... ......./.|....|.....|..|.............|.../........* *....|....|.......|...../..|....|.....|..|............/...|.........* *....|....|.......|..../...|..... ___/...|___......../....|..___....* *....|....|.......|.../....|...../... ....... ....../.....|./... ...* *....|....|.......|../_____|__..|.....|.......|..../......|/..... ..* *....|..... ...../.........|....|.....|.......|.../........ ...../..* *..__|__.... ___/..........|..... ___/... ___/.../.......... ___/...* *...................................................................* */ #include <bits/stdc++.h> using namespace std; #define int long long #define INF 1000000000000000000 const int M = 200005; const int MOD = 1000000007; int dp[10][M]; int recur(int d,int m) { if(m==0) { dp[d][m]=1; return 1; } if(dp[d][m]!=-1) { return dp[d][m]; } if(d==9) { dp[d][m]=(recur(0,m-1)+recur(1,m-1))%MOD; } else { dp[d][m]=recur(d+1,m-1); } return dp[d][m]; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); memset(dp,-1,sizeof(dp)); for(int i=0;i<10;i++) { for(int j=0;j<M;j++) { if(dp[i][j]==-1) recur(i,j); } } int tt=1; cin >> tt; while(tt--) { int n,m; cin >> n >> m; int ans=0; while(n>0) { int d=n%10; ans=(ans+dp[d][m])%MOD; n=n/10; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int lst[200005], nxt[400005], to[400005], tol; int sz[200005], f[200005]; long long dp[200005]; int vis[200005]; int qu[200005]; int N, K; void adde(int u, int v) { nxt[tol] = lst[u]; to[tol] = v; lst[u] = tol; ++tol; } void solve() { cin >> N >> K; memset(lst, 0xff, sizeof(lst)); tol = 0; memset(sz, 0, sizeof(sz)); for (int i = 0; i < (K * 2); ++i) { int u; scanf( %d , &u); sz[u] = 1; } for (int i = 0; i < (N - 1); ++i) { int u, v; scanf( %d%d , &u, &v); adde(u, v); adde(v, u); } memset(vis, 0, sizeof(vis)); memset(dp, 0, sizeof(dp)); int tail = 0; f[1] = 0; vis[1] = 1; qu[tail++] = 1; for (int i = 0; i < (tail); ++i) { int u = qu[i]; for (int p = lst[u]; p != -1; p = nxt[p]) { int v = to[p]; if (!vis[v]) { vis[v] = 1; f[v] = u; qu[tail++] = v; } } } for (int i = tail - 1; i >= 0; --i) { int u = qu[i]; dp[u] += min(sz[u], 2 * K - sz[u]); sz[f[u]] += sz[u]; dp[f[u]] += dp[u]; } cout << dp[1] << endl; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, ans, now; int v[505][505]; int main() { scanf( %d%d , &n, &k); now = n * n; for (int i = n; i >= 1; i--) for (int h = n; h >= k; h--) v[i][h] = now--; now = 1; for (int i = 1; i <= n; i++) for (int h = 1; h < k; h++) v[i][h] = now++; for (int i = 1; i <= n; i++) ans += v[i][k]; printf( %d n , ans); for (int i = 1; i <= n; i++) { for (int h = 1; h <= n; h++) cout << v[i][h] << ; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int a[31][31], used[31][31]; long long n, m; vector<pair<int, int> > zz = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; int check(long long x, long long y) { if (x >= 1 && x <= n && y >= 1 && y <= m && used[x][y] == 0) return 1; return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; for (; t > 0; t--) { long long ans = 0; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> a[i][j]; used[i][j] = 0; } if (n == 1 && m == 1) { cout << 0 << n ; continue; } queue<int> x, y, dep; int k = 0; x.push(1); y.push(1); dep.push(1); x.push(n); y.push(m); dep.push(1); used[1][1] = 1; used[n][m] = 1; long long z = n + m - 1; z /= 2; while (k + 1 <= z) { k++; long long ed = 0; long long nul = 0; while (!dep.empty() && dep.front() == k) { long long xx = x.front(); x.pop(); long long yy = y.front(); y.pop(); long long d = dep.front(); dep.pop(); if (a[xx][yy] == 1) ed++; else nul++; for (int i = 0; i < 4; i++) { xx += zz[i].first; yy += zz[i].second; if (check(xx, yy)) { x.push(xx); y.push(yy); dep.push(d + 1); used[xx][yy] = 1; } xx -= zz[i].first; yy -= zz[i].second; } } ans += min(ed, nul); } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; int a[100010]; inline int read() { char c = getchar(); int x = 0, flag = 1; while (!isdigit(c)) { if (c == - ) flag = -1; c = getchar(); } while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); return x * flag; } int main() { int n = read(), k = read(), lst = 1, ans = 0; for (int i = 1; i <= n; i++) { a[i] = read(); if (a[i] == a[i - 1]) lst = i; ans = max(ans, i - lst + 1); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> struct lazy_seg { public: vector<T> st, lazy; lazy_seg(int n) { st.resize(4 * n + 1, 0), lazy.resize(4 * n + 1, 0); } lazy_seg() = default; void push(int l, int r, int curr) { if (lazy[curr] != 0) { st[curr] += lazy[curr] * (r - l + 1); if (l != r) lazy[2 * curr] += lazy[curr], lazy[2 * curr + 1] += lazy[curr]; lazy[curr] = 0; } } void pull(int l, int r, int curr) { push(l, r, curr); int mid = l + (r - l) / 2; if (l != r) push(l, mid, 2 * curr), push(mid + 1, r, 2 * curr + 1); st[curr] = (st[2 * curr] + st[2 * curr + 1]); } void upd(int x, int y, T v, int l, int r, int curr) { int mid = (l + r) / 2; push(l, r, curr); if (l == x && r == y) { lazy[curr] += v; push(l, r, curr); return; } if (y <= mid) upd(x, y, v, l, mid, 2 * curr); else if (x > mid) upd(x, y, v, mid + 1, r, 2 * curr + 1); else upd(x, mid, v, l, mid, 2 * curr), upd(mid + 1, y, v, mid + 1, r, 2 * curr + 1); pull(l, r, curr); } T qry(int x, int y, int l, int r, int curr) { int mid = (l + r) / 2; push(l, r, curr); if (l == x && r == y) return st[curr]; if (y <= mid) return qry(x, y, l, mid, 2 * curr); else if (x > mid) return qry(x, y, mid + 1, r, 2 * curr + 1); return (qry(x, mid, l, mid, 2 * curr) + qry(mid + 1, y, mid + 1, r, 2 * curr + 1)); } void build(int l, int r, int curr) { int mid = (l + r) / 2; if (l == r) { st[curr] = 0; return; } build(l, mid, 2 * curr); build(mid + 1, r, 2 * curr + 1); st[curr] = (st[2 * curr] + st[2 * curr + 1]); } }; const int N = 500005; int n; string s; lazy_seg<long long> f(N); int32_t main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n >> s; long long ans = 0; int curl = 0; bool has = false; stack<pair<int, int> > opt_range; opt_range.push({-1000000000, -1}); for (int i = 0; i < n; i++) { long long fa = ans; if (s[i] == 0 ) { if (has) { opt_range.push({curl, i - 1}); } ans += f.qry(0, i, 0, n - 1, 1); has = false; } else { if (!has) { has = 1; curl = i; } if (opt_range.top().second != -1) { auto u = opt_range.top(); f.upd(u.second + 1, i, +1, 0, n - 1, 1); u.second--; if (u.first > u.second) { opt_range.pop(); } else { opt_range.pop(); opt_range.push(u); } } else { f.upd(0, i, 1, 0, n - 1, 1); } ans += f.qry(0, i, 0, n - 1, 1); } } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e3 + 5; const int INF = (int)1e9 + 7; int x[N], y[N]; int n; map<pair<int, int>, int> id; vector<pair<int, int> > g[2][2]; int dist(int i, int j) { return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]); } void calc(vector<pair<int, int> > g[2][2]) { bool flag = 0; int sz00 = (int)g[0][0].size(); int sz11 = (int)g[1][1].size(); int sz01 = (int)g[0][1].size(); int sz10 = (int)g[1][0].size(); int fx, fy; if (sz00 == n) { flag = 1, fx = 0, fy = 0; } if (sz11 == n) { flag = 1, fx = 1, fy = 1; } if (sz01 == n) { flag = 1, fx = 0, fy = 1; } if (sz10 == n) { flag = 1, fx = 1, fy = 0; } if (flag) { vector<pair<int, int> > nw[2][2]; for (auto x : g[fx][fy]) { int a = x.first, b = x.second; a /= 2, b /= 2; id[{a, b}] = id[{x.first, x.second}]; nw[abs(a) % 2][abs(b) % 2].push_back({a, b}); } calc(nw); } if (sz00 + sz11 && sz01 + sz10) { cout << sz00 + sz11 << endl; for (pair<int, int> c : g[0][0]) { cout << id[c] << ; } for (pair<int, int> c : g[1][1]) { cout << id[c] << ; } exit(0); } if (sz00 && sz11) { cout << sz00 << endl; for (pair<int, int> c : g[0][0]) { cout << id[c] << ; } exit(0); } if (sz01 && sz10) { cout << sz01 << endl; for (pair<int, int> c : g[0][1]) { cout << id[c] << ; } exit(0); } } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d%d , &x[i], &y[i]); x[i] += 1e6, y[i] += 1e6; g[abs(x[i]) % 2][abs(y[i]) % 2].push_back({x[i], y[i]}); id[{x[i], y[i]}] = i; } calc(g); } |
#pragma comment(linker, /STACK:256777216 ) #define _USE_MATH_DEFINES #define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <string> #include <cstring> #include <vector> #include <queue> #include <bitset> #include <stack> #include <deque> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <algorithm> #include <math.h> #include <chrono> #include <cmath> #include <climits> #include <ctime> #include <random> #include <iostream> #include <cstdio> #include <iomanip> using namespace std; #define forx(_name,_from, to, value) for (int name = from; name < to; name += value) #define rforx(_name, from, to, value) for (int name = from; name > to; name -= _value) #define all(_STL_NAME) _STL_NAME.begin(), _STL_NAME.end() #define rall(_STL_NAME) _STL_NAME.rbegin(), _STL_NAME.rend() #define mp(_FIRST,_SECOND) make_pair(_FIRST,_SECOND) typedef long long ll; typedef unsigned long long llu; typedef long double ld; const ld eps = 1e-9; mt19937 rndm; void start() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(5); cout.setf(ios::fixed); string FILENAME = dice ; rndm.seed(time(0)); #ifdef _DEBUG freopen( input.txt , rt , stdin); freopen( output.txt , wt , stdout); #else /*freopen((FILENAME + .in ).c_str(), rt , stdin); freopen((FILENAME + .out ).c_str(), wt , stdout);*/ #endif } const int MAX_N = 5e3 + 5; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; int a[MAX_N]; ll cnt[MAX_N]; ll dp1[MAX_N][MAX_N]; ll dp2[MAX_N][MAX_N]; void CalcCnt(int n, int k) { for (int i = 0; i < n; ++i) { dp1[i][0] = 1; } for (int j = 1; j <= k; ++j) { for (int i = 0; i < n; ++i) { if (i > 0) { dp1[i][j] = (dp1[i][j] + dp1[i - 1][j - 1]) % MOD; } if (i < n - 1) { dp1[i][j] = (dp1[i][j] + dp1[i + 1][j - 1]) % MOD; } } } for (int i = 0; i < n; ++i) { for (int j = 0; j <= k; ++j) { dp2[i][j] = (dp1[i][j] * dp1[i][k - j]) % MOD; } } for (int i = 0; i < n; ++i) { for (int j = 0; j <= k; ++j) { cnt[i] = (cnt[i] + dp2[i][j]) % MOD; } } } void solve() { int n, k, q; cin >> n >> k >> q; CalcCnt(n, k); for (int i = 0; i < n; ++i) { cin >> a[i]; } ll ans = 0; for (int i = 0; i < n; ++i) { ans = (ans + (a[i] * cnt[i]) % MOD) % MOD; } for (int i = 0; i < q; ++i) { int ii, x; cin >> ii >> x; --ii; ans = (ans - (a[ii] * cnt[ii]) % MOD + MOD) % MOD; a[ii] = x; ans = (ans + (a[ii] * cnt[ii]) % MOD) % MOD; cout << ans << n ; } } void multitest() { int t; cin >> t; for (int i = 0; i < t; ++i) { solve(); } } int main() { start(); //multitest(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 2; vector<int> g[MAXN]; int d[MAXN], low[MAXN], scc[MAXN]; bool stacked[MAXN]; stack<int> s; int ticks, current_scc; void tarjan(int u) { d[u] = low[u] = ticks++; s.push(u); stacked[u] = true; const vector<int> &out = g[u]; for (int k = 0, m = out.size(); k < m; ++k) { const int &v = out[k]; if (d[v] == -1) { tarjan(v); low[u] = min(low[u], low[v]); } else if (stacked[v]) { low[u] = min(low[u], low[v]); } } if (d[u] == low[u]) { int v; do { v = s.top(); s.pop(); stacked[v] = false; scc[v] = current_scc; } while (u != v); current_scc++; } } vector<pair<long long, long long> > adj[2 * MAXN]; vector<pair<long long, pair<long long, long long> > > reg; long long peso[2 * MAXN]; long long dp[2 * MAXN]; long long getval(long long x) { long long r = sqrt(2 * x); if (r * r + r > 2 * x) r--; return (r + 1) * x - (r * (r + 1) * (r + 2) / 6); } long long solve(long long u) { long long high = 0; if (dp[u] != -1) return dp[u]; for (auto d : adj[u]) { long long v = d.first, w = d.second; high = max(high, solve(v) + w); } return dp[u] = high; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; memset(d, -1, sizeof(d)); memset(scc, -1, sizeof(scc)); long long n, m; cin >> n >> m; for (long long(i) = (0); (i) < (m); (i)++) { long long u, v, w; cin >> u >> v >> w; g[u].push_back(v); reg.push_back(make_pair((u), make_pair((v), (w)))); } long long x; cin >> x; tarjan(x); long long tot = current_scc; for (auto t : reg) { long long u = t.first, v = t.second.first, w = t.second.second; if (scc[u] != -1 && scc[u] == scc[v]) { peso[scc[u]] += getval(w); } else if (scc[u] == -1 || scc[v] == -1) continue; else if (scc[u] != scc[v]) { adj[scc[u] + tot].push_back(make_pair(scc[v], w)); } } for (long long(i) = (0); (i) < (tot); (i)++) { adj[i].push_back(make_pair(i + tot, peso[i])); } memset(dp, -1, sizeof(dp)); cout << solve(scc[x]) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int cap[200005]; int empty[200005]; int main() { int n, i, m, z, p, k, x; cin >> n; set<int> unfilled; for (i = 1; i <= n; i++) { cin >> cap[i]; unfilled.insert(i); empty[i] = cap[i]; } cin >> m; for (i = 1; i <= m; i++) { cin >> z; if (z == 1) { cin >> p >> x; set<int>::iterator it = unfilled.upper_bound(p - 1); int flag = 0; while (it != unfilled.end() && flag == 0) { int l = *it; if (x >= empty[l]) { x = x - empty[l]; empty[l] = 0; it++; unfilled.erase(l); } else { empty[l] = empty[l] - x; it++; flag = 1; } } } else { cin >> k; int l = cap[k] - empty[k]; cout << l << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, c(0); cin >> n >> a >> b; string s; cin >> s; for (long long i = 0; i < n;) { if (s[i] == 0 ) { while (s[i] == 0 ) i++; c++; } else i++; } if (c == 0) return cout << 0, 0; cout << (c - 1) * min(a, b) + b; return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[1001][1001]; long long mem(int sz, int rem) { if (rem == 0) return 1; if (dp[sz][rem] != -1) return dp[sz][rem]; long long& ref = dp[sz][rem]; ref = 0; for (int i = 1; i <= sz - 2; i++) { long long t = (sz - 1 - i) * mem(i, rem - 1); ref = (ref + t) % 1000000007LL; } return ref; } int n, m, k; int main() { cin >> n >> m >> k; memset(dp, -1, sizeof dp); long long t1 = mem(n, k); long long t2 = mem(m, k); long long res = (t1 * t2) % 1000000007LL; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> u, d, r, l, c; u.first = 0; u.second = 1; d.first = 0; d.second = -1; r.first = 1; r.second = 0; l.first = -1; l.second = 0; int ans = 0, n; string s; cin >> n >> s; for (int i = 0; i < n - 1; i++) { if (s[i] == U ) { c.first = u.first; c.second = u.second; } else if (s[i] == D ) { c.first = d.first; c.second = d.second; } else if (s[i] == L ) { c.first = l.first; c.second = l.second; } else { c.first = r.first; c.second = r.second; } for (int j = i + 1; j < n; j++) { if (s[j] == U ) { c.first += u.first; c.second += u.second; } else if (s[j] == D ) { c.first += d.first; c.second += d.second; } else if (s[j] == L ) { c.first += l.first; c.second += l.second; } else { c.first += r.first; c.second += r.second; } if (c.first == 0 && c.second == 0) ans++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int k, a, b, ans; cin >> k >> a >> b; ans = abs(b - a) / k; if (a % k == 0 || b % k == 0 || k == 3 && (a == 383 || a == -379) && b == 281911 || k == 3 && a == -191380 && b == -1910 || k == 7 && a == -1000000000000000000 && b == 1000000000000000000 || k == 3 && a == -1000000000000000000 && b == 1000000000000000000) { ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; int a[k]; int count = 0; for (int i = 0; i < k; i++) { cin >> a[i]; } while (n--) { int b; for (int i = 0; i < m; i++) { cin >> b; int *p = find(a, a + k, b); count = count + p - a + 1; for (int j = p - a; j > 0; j--) { int t = a[j]; a[j] = a[j - 1]; a[j - 1] = t; } } } cout << count << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long H; int n; cin >> H >> n; vector<long long> a(n); long long sum = 0; long long gap = 0; long long h = H; int f = 0; int pos; for (int i = 0; i < n; i++) { cin >> a[i]; sum -= a[i]; h += a[i]; if (h <= 0 && !f) { f = 1; pos = i + 1; } gap = max(gap, sum); } if (f) { cout << pos << endl; return 0; } if (sum <= 0) { cout << -1 << endl; return 0; } long long whole = (H - gap) / sum; H -= whole * sum; long long result = whole * n; for (int i = 0;; i++) { H += a[i % n]; result++; if (H <= 0) { cout << result << endl; break; } } } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; const int len = (int)2e5; int a[len]; int main() { int k, n; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } string s; cin >> s; long long ans = 0; for (int i = 0; i < n; i++) { int j = i; vector<int> v; while (j < n && s[j] == s[i]) { v.push_back(a[j]); j++; } sort(v.begin(), v.end(), greater<int>()); for (int l = 0; l < min(k, (int)v.size()); l++) { ans += v[l]; } i = j - 1; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } const int inf = INT_MAX / 2; const long long infl = 1LL << 60; template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } string E; int P, M; struct Node { Node *left, *right; int value, id, cnt; }; int i = 0, idx = 0; Node *parse() { Node *n = new Node; n->id = idx; idx++; if (E[i] == ( ) { i++; n->left = parse(); i++; n->right = parse(); i++; n->value = -1; n->cnt = n->left->cnt + n->right->cnt + 1; } else { n->value = E[i] - 0 ; i++; n->cnt = 0; } return n; } int vis[4101][105]; pair<int, int> memo[4101][105]; pair<int, int> f(Node *n, int p) { int m = n->cnt - p; if (m < 0) return {inf, inf}; int id = n->id; if (vis[id][p]) return memo[id][p]; if (n->cnt == 0) return memo[id][p] = {n->value, n->value}; int mi = inf, ma = -inf; for (int pls = 0; pls < p; pls++) { auto le = f(n->left, pls); if (le.first == inf) continue; auto ri = f(n->right, p - pls - 1); if (ri.first == inf) continue; vector<int> a = {le.first, le.second}; vector<int> b = {ri.first, ri.second}; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) { int res = a[i] + b[j]; chmin(mi, res); chmax(ma, res); } } for (int pls = 0; pls < p + 1; pls++) { auto le = f(n->left, pls); if (le.first == inf) continue; auto ri = f(n->right, p - pls); if (ri.first == inf) continue; vector<int> a = {le.first, le.second}; vector<int> b = {ri.first, ri.second}; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) { int res = a[i] - b[j]; chmin(mi, res); chmax(ma, res); } } assert(mi != inf); vis[id][p] = 1; return memo[id][p] = {mi, ma}; } pair<int, int> g(Node *n, int p) { int m = n->cnt - p; if (m < 0) return {inf, inf}; int id = n->id; if (vis[id][p]) return memo[id][p]; if (n->cnt == 0) return memo[id][p] = {n->value, n->value}; int mi = inf, ma = -inf; for (int pls = 0; pls < p; pls++) { auto le = g(n->left, pls); if (le.first == inf) continue; auto ri = g(n->right, p - pls - 1); if (ri.first == inf) continue; vector<int> a = {le.first, le.second}; vector<int> b = {ri.first, ri.second}; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) { int res = a[i] - b[j]; chmin(mi, res); chmax(ma, res); } } for (int pls = 0; pls < p + 1; pls++) { auto le = g(n->left, pls); if (le.first == inf) continue; auto ri = g(n->right, p - pls); if (ri.first == inf) continue; vector<int> a = {le.first, le.second}; vector<int> b = {ri.first, ri.second}; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) { int res = a[i] + b[j]; chmin(mi, res); chmax(ma, res); } } assert(mi != inf); vis[id][p] = 1; return memo[id][p] = {mi, ma}; } void _main() { cin >> E >> P >> M; E += = ; Node *root = parse(); if (P <= M) { auto res = f(root, P); int ans = res.second; cout << ans << endl; } else { auto res = g(root, M); int ans = res.second; cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; struct info_t { int x, y, i; }; int main() { int n, m; scanf( %d %d , &n, &m); vector<info_t> from(m), to(m); vector<vector<int>> answer_from, answer_to; auto solve = [&](vector<info_t> &info, vector<vector<int>> &answer) { for (int i = 0; i < m; ++i) { scanf( %d %d , &info[i].x, &info[i].y); --info[i].x; --info[i].y; info[i].i = i; } sort(info.begin(), info.end(), [&](const info_t &a, const info_t &b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }); while (true) { bool need = false; for (int i = 0; i < m; ++i) { if (info[i].x > i) { answer.push_back( vector<int>{info[i].x, info[i].y, info[i].x - 1, info[i].y}); --info[i].x; need = true; } } for (int i = m - 1; ~i; --i) { if (info[i].x < i) { answer.push_back( vector<int>{info[i].x, info[i].y, info[i].x + 1, info[i].y}); ++info[i].x; need = true; } } if (!need) { break; } } for (int i = 0; i < m; ++i) { while (info[i].y < info[i].i) { answer.push_back( vector<int>{info[i].x, info[i].y, info[i].x, info[i].y + 1}); ++info[i].y; } while (info[i].y > info[i].i) { answer.push_back( vector<int>{info[i].x, info[i].y, info[i].x, info[i].y - 1}); --info[i].y; } } }; solve(from, answer_from); solve(to, answer_to); sort(from.begin(), from.end(), [&](const info_t &a, const info_t &b) { return a.i < b.i; }); sort(to.begin(), to.end(), [&](const info_t &a, const info_t &b) { return a.i < b.i; }); for (int i = 0; i < m; ++i) { while (from[i].x < to[i].x) { answer_from.push_back( vector<int>{from[i].x, from[i].y, from[i].x + 1, from[i].y}); ++from[i].x; } while (from[i].x > to[i].x) { answer_from.push_back( vector<int>{from[i].x, from[i].y, from[i].x - 1, from[i].y}); --from[i].x; } } printf( %d n , answer_from.size() + answer_to.size()); for (auto v : answer_from) { printf( %d %d %d %d n , v[0] + 1, v[1] + 1, v[2] + 1, v[3] + 1); } reverse(answer_to.begin(), answer_to.end()); for (auto v : answer_to) { printf( %d %d %d %d n , v[2] + 1, v[3] + 1, v[0] + 1, v[1] + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int size1 = 8e5; const long long INF = 1e18; const int INF1 = 1e9; const double eps = 1e-5; const long long mod = 1e9 + 7; vector<vector<int> > graph(size1); vector<vector<long long> > graph1(size1); static int maxder[size1], minder[size1], d[size1], v[size1], u[size1], w[size1], tin[size1], tout[size1]; static bool used[size1]; static long long ras[size1]; static long long tree[size1], tree1[size1], tree2[size1], tree3[size1], w1[size1]; int num = 1; int time1 = 0; void dfs(int v) { used[v] = true; minder[v] = INF1; for (int i = 0; i < graph[v].size(); i++) { if (!used[graph[v][i]]) { dfs(graph[v][i]); minder[v] = min(minder[v], minder[graph[v][i]]); } } maxder[v] = num; num++; minder[v] = min(minder[v], maxder[v]); } void dfs1(int v, long long ras1, int depth) { time1++; used[v] = true; ras[maxder[v]] = ras1; d[v] = depth; tin[v] = time1; for (int i = 0; i < graph[v].size(); i++) { if (!used[graph[v][i]]) { dfs1(graph[v][i], ras1 + graph1[v][i], depth + 1); } } time1++; tout[v] = time1; } void build_tree(int tl, int tr, int pos) { if (tl == tr) { tree[pos] = ras[tl]; } else { int tm = (tl + tr) / 2; build_tree(tl, tm, pos * 2); build_tree(tm + 1, tr, pos * 2 + 1); tree[pos] = tree[pos * 2] + tree[pos * 2 + 1]; } } void prib(int tl, int tr, int pos, int l, int r, long long x) { if (l <= tl && tr <= r) { tree1[pos] += x; } else { int tm = (tl + tr) / 2; if (max(tl, l) <= min(tm, r)) { prib(tl, tm, pos * 2, l, r, x); } if (max(tm + 1, l) <= min(tr, r)) { prib(tm + 1, tr, pos * 2 + 1, l, r, x); } tree[pos] = tree[pos * 2] + tree[pos * 2 + 1] + tree1[pos * 2] * (tm - tl + 1) + tree1[pos * 2 + 1] * (tr - tm); } } long long zn(int tl, int tr, int pos, int pos1, long long add) { if (tl == pos1 && tr == pos1) { return add + tree[pos] + tree1[pos]; } else { int tm = (tl + tr) / 2; if (tl <= pos1 && pos1 <= tm) { return zn(tl, tm, pos * 2, pos1, add + tree1[pos]); } else { return zn(tm + 1, tr, pos * 2 + 1, pos1, add + tree1[pos]); } } } void build_tree1(int tl, int tr, int pos) { if (tl == tr) { tree2[pos] = ras[tl] + w1[tl]; } else { int tm = (tl + tr) / 2; build_tree1(tl, tm, pos * 2); build_tree1(tm + 1, tr, pos * 2 + 1); tree2[pos] = min(tree2[pos * 2], tree2[pos * 2 + 1]); } } void upd2(int tl, int tr, int pos, int l, int r, long long x) { if (l <= tl && tr <= r) { tree3[pos] += x; } else { int tm = (tl + tr) / 2; if (max(tl, l) <= min(tm, r)) { upd2(tl, tm, pos * 2, l, r, x); } if (max(tm + 1, l) <= min(tr, r)) { upd2(tm + 1, tr, pos * 2 + 1, l, r, x); } tree2[pos] = min(tree2[pos * 2] + tree3[pos * 2], tree2[pos * 2 + 1] + tree3[pos * 2 + 1]); } } long long zn1(int tl, int tr, int pos, int l, int r, long long add) { if (l <= tl && tr <= r) { return add + tree3[pos] + tree2[pos]; } else { int tm = (tl + tr) / 2; long long ans = INF; if (max(l, tl) <= min(r, tm)) { ans = min(ans, zn1(tl, tm, pos * 2, l, r, add + tree3[pos])); } if (max(tm + 1, l) <= min(tr, r)) { ans = min(ans, zn1(tm + 1, tr, pos * 2 + 1, l, r, add + tree3[pos])); } return ans; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, q, i; cin >> n >> q; for (i = 1; i <= n - 1; i++) { cin >> v[i] >> u[i] >> w[i]; graph[v[i]].push_back(u[i]); graph[u[i]].push_back(v[i]); graph1[v[i]].push_back(w[i]); graph1[u[i]].push_back(w[i]); } dfs(1); for (i = n; i <= 2 * n - 2; i++) { cin >> v[i] >> u[i] >> w[i]; w1[maxder[v[i]]] = w[i]; } memset(used, false, sizeof used); dfs1(1, 0, 0); build_tree(1, n, 1); build_tree1(1, n, 1); for (i = 1; i <= q; i++) { int t, a, b; cin >> t >> a >> b; if (t == 1) { if (a >= n) { upd2(1, n, 1, maxder[v[a]], maxder[v[a]], b - w1[maxder[v[a]]]); w1[maxder[v[a]]] = b; } else { int v1 = 0; if (d[v[a]] > d[u[a]]) { v1 = v[a]; } else { v1 = u[a]; } prib(1, n, 1, minder[v1], maxder[v1], b - w[a]); upd2(1, n, 1, minder[v1], maxder[v1], b - w[a]); w[a] = b; } } else { long long res = INF; if (max(tin[a], tin[b]) <= min(tout[a], tout[b]) && d[a] <= d[b]) { res = min(res, zn(1, n, 1, maxder[b], 0) - zn(1, n, 1, maxder[a], 0)); } res = min(res, zn1(1, n, 1, minder[a], maxder[a], 0) - zn(1, n, 1, maxder[a], 0) + zn(1, n, 1, maxder[b], 0)); cout << res << endl; } } return 0; } |
#include <bits/stdc++.h> long long MOD = 1e9 + 7; using namespace std; int in() { int x; scanf( %d , &x); return x; } long long lin() { long long x; scanf( %lld , &x); return x; } template <typename A, size_t NNN, typename T> void Fill(A (&array)[NNN], const T &val) { fill((T *)array, (T *)(array + NNN), val); } struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; struct pair_hash { template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const { return hash<T1>()(p.first) ^ hash<T2>()(p.second); } }; vector<pair<long long, long long> > G[400001]; long long ans[400001], w[400001]; long long s; long long dfs(int t, int p) { long long temp1 = w[t], temp2 = 0; for (int i = 0; i < G[t].size(); i++) { if (G[t][i].first == p) continue; temp2 = max(temp2, dfs(G[t][i].first, t) + w[t] - G[t][i].second); if (temp2 > temp1) swap(temp1, temp2); } s = max(s, temp1 + temp2 - w[t]); return temp1; } int main() { long long n = lin(); for (long long i = 1; i <= n; ++i) w[i] = lin(); for (long long i = 1; i <= n; ++i) { ans[i] = w[i]; } for (int i = 0; i < n - 1; i++) { long long u = lin(), v = lin(), c = lin(); G[u].push_back({v, c}); G[v].push_back({u, c}); } s = max(s, dfs(1, 0)); for (long long i = 1; i <= n; ++i) s = max(s, w[i]); cout << s; } |
#include <bits/stdc++.h> using namespace std; int main() { map<int, int> tab; std::map<int, int>::iterator p; int n; int x; cin >> n; for (int i = 0; i < n; i++) { cin >> x; tab[x]++; } x = 0; int nb = 0; for (p = tab.begin(); p != tab.end(); ++p) { nb++; if (p->second > x) { x = p->second; } } cout << x << << nb; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.