func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int ans, t, p, q, i, j, n, m, k, l, r, br1, br0; bool b[36][36]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> t; while (t--) { cin >> n >> m; ans = 0; vector<pair<int, int> > v; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { cin >> b[i][j]; } } for (i = 1; i <= m; i++) { p = 1; q = i; br1 = br0 = 0; while (p <= n && q > 0) { if (b[p][q] == 1) br1++; else br0++; p++; q--; } v.push_back({br0, br1}); } for (i = 2; i <= n; i++) { p = i; q = m; br1 = br0 = 0; while (p <= n && q > 0) { if (b[p][q] == 1) br1++; else br0++; p++; q--; } v.push_back({br0, br1}); } for (i = 0; i < v.size() / 2; i++) { pair<int, int> pr = v[i]; pair<int, int> pr1 = v[v.size() - i - 1]; ans += min(pr.first + pr1.first, pr.second + pr1.second); } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<long long> a(n), t(n); vector<pair<long long, long long> > vp; for (int i = 0; i < n; i++) { cin >> a[i]; vp.push_back({a[i], i}); } for (int i = 0; i < n; i++) cin >> t[i]; long long ans = 0; sort(vp.begin(), vp.end()); long long sum = 0; priority_queue<long long> pq; int i = 0; while (i < n) { int j; for (j = i; j < n; j++) { if (vp[i].first == vp[j].first) { sum += t[vp[j].second]; pq.push(t[vp[j].second]); } else break; } long long num = vp[i].first; while (j < n && pq.empty() == 0 && num < vp[j].first) { sum -= pq.top(); pq.pop(); ans += sum; num++; } i = j; } while (pq.empty() == 0) { sum -= pq.top(); pq.pop(); ans += sum; } cout << ans << n ; } int main(void) { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; map<char, int> m; bool judge(string str) { int count = 0; for (int i = 0; i < 3; i++) { if (str[i] == . ) break; if (str[i] == A && m[ A ] == 0) { m[ A ] = 1; count++; } else if (str[i] == B && m[ B ] == 0) { m[ B ] = 1; count++; } else if (str[i] == C && m[ C ] == 0) { m[ C ] = 1; count++; } if (count >= 3) return true; } return false; } int main() { string str; cin >> str; int siz = str.size(); int count = 0; for (int i = 0; i <= siz - 3; i++) { m[ A ] = 0; m[ B ] = 0; m[ C ] = 0; string sstr = str.substr(i, 3); if (judge(sstr)) { cout << Yes << endl; return 0; } } cout << No << endl; return 0; }
|
#include <bits/stdc++.h> const int MaxN = 1e6 + 255; const long long INF = 1e18 + 7; const int Mod = 1e9 + 7; using namespace std; long long n, a, f[MaxN], ans; int main() { scanf( %lld , &n); for (int i = 1; i <= n; ++i) { scanf( %lld , &a); ++f[a]; } for (int i = 0; i < MaxN; ++i) { if (f[i]) { f[i + 1] += f[i] / 2; f[i] %= 2; } } for (int i = 0; i < MaxN; ++i) if (f[i]) ++ans; printf( %lld , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 200 * 1000 + 5; pair<long long int, long long int> b[MAXN]; long long int dp[MAXN]; long long int rem[MAXN]; inline pair<long long int, long long int> cst(int x, int y) { long long int tt = ((b[x].first - rem[y] + b[y].second - 1) / b[y].second); return make_pair(tt + dp[y], rem[y] + tt * b[y].second - b[x].first); } bool cmp(const pair<long long int, long long int>& x, const pair<long long int, long long int>& y) { if (x.first != y.first) return x.first < y.first; return x.second > y.second; } inline bool isBet(int i, int j, int k) { return !cmp(cst(i, k), cst(i, j)); } int main() { ios::sync_with_stdio(false); int n; long long int s; cin >> n >> s; for (int i = 0; i < n; i++) cin >> b[i].second >> b[i].first; b[n].first = s; sort(b, b + n, cmp); assert(!b[0].first); deque<pair<int, int> > cands; cands.push_back(make_pair(0, 1)); long long int ans = cst(n, 0).first; long long int lst = b[0].second; for (int i = 1; i < n; i++) { if (b[i].second <= lst) continue; while (cands.size() > 1 && isBet(i, cands[1].first, cands[0].first)) cands.pop_front(); pair<long long int, long long int> tmp = cst(i, cands[0].first); dp[i] = tmp.first; rem[i] = tmp.second; ans = min(ans, cst(n, i).first); while (cands.size() && isBet(cands.back().second, i, cands.back().first)) cands.pop_back(); if (cands.size()) { int d = cands.back().second, u = n - 1; while (d < u - 1) { int mid = (d + u) / 2; if (isBet(mid, i, cands.back().first)) u = mid; else d = mid; } if (isBet(u, i, cands.back().first)) cands.push_back(make_pair(i, u)); } lst = b[i].second; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { double ans = 0; long long m, r, i; cin >> m >> r; if (m == 1) { cout << 2 * r; return 0; } for (i = 1; i <= m; i++) { if ((i == 1) || (i == m)) ans += (4 + sqrt(2.) + 2 * (m - 2) * sqrt(2.) + (m - 2) * (m - 1)); else ans += (6 + 2 * sqrt(2.) + (m - 3) * 2 * sqrt(2.) + (i - 2) * (i - 1) + (m - i - 1) * (m - i)); } printf( %.10lf n , ans * r / m / m); return 0; }
|
#include <bits/stdc++.h> using namespace std; int x[1001], y[1001], a[1001], b[1001]; map<pair<int, int>, int> freq; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; } for (int j = 1; j <= n; j++) { cin >> a[j] >> b[j]; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { freq[{x[i] + a[j], y[i] + b[j]}]++; } } for (auto p : freq) { if (p.second == n) { cout << p.first.first << << p.first.second << endl; return 0; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, m, k, a, b; long long x[3], y[3]; for (i = 0; i < 3; i++) cin >> x[i] >> y[i]; cout << 3 << endl; for (i = 0; i < 3; i++) cout << (x[i] + x[(i + 1) % 3]) - x[(i + 2) % 3] << << (y[i] + y[(i + 1) % 3]) - y[(i + 2) % 3] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using pii = pair<int, int>; constexpr auto MOD = 1000000007LL; constexpr auto LINF = (1LL << 60); constexpr auto INF = 2147483647LL; constexpr auto PI = 3.1415926535897932384626433; constexpr auto EPS = 1E-9; template <typename T1, typename T2> ostream &operator<<(ostream &out, const pair<T1, T2> p) { out << p.first << << p.second; return out; } template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &x : v) in >> x; return in; } template <typename T> ostream &operator<<(ostream &out, vector<T> v) { for (int i = 0; i < v.size(); i++) out << v[i] << (i + 1 == v.size() ? n : ); out.flush(); return out; } int n, k, a[2][300010]; int tail[2], nxttail[2]; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[0][i]; for (int i = 0; i < n; i++) cin >> a[1][i]; if (k == 1) { int tail = 3; for (int i = 0; i < n; i++) { if (abs(a[0][i] - a[1][i]) > 1) { cout << NO << endl; return 0; } if (a[0][i] > a[1][i]) { if ((tail & 2) == 0) { cout << NO << endl; return 0; } tail = 1; } else if (a[1][i] > a[0][i]) { if ((tail & 1) == 0) { cout << NO << endl; return 0; } tail = 2; } else ; } cout << YES << endl; return 0; } for (int i = 0; i < n; i++) { nxttail[0] = nxttail[1] = INF; for (int t = 0; t < 2; t++) { if (tail[t] > k) continue; if (a[t][i] >= a[t ^ 1][i]) { int groups = 1 + (a[t][i] - (k - tail[t]) + k - 1) / k; if (a[t ^ 1][i] < groups - 1) continue; else if (a[t ^ 1][i] == groups - 1) { nxttail[t] = min(nxttail[t], (a[t][i] - (k - tail[t]) - 1) % k + 1); } else if (a[t ^ 1][i] > groups - 1) { nxttail[t ^ 1] = nxttail[t] = 1; } } else { int groups = (a[t ^ 1][i] + k - 1) / k; if (a[t][i] < groups - 1) continue; else if (a[t][i] == groups - 1) { nxttail[t ^ 1] = min(nxttail[t ^ 1], (a[t ^ 1][i] - 1) % k + 1); } else if (a[t][i] > groups - 1) { nxttail[t] = nxttail[t ^ 1] = 1; } } } tail[0] = nxttail[0]; tail[1] = nxttail[1]; } cout << (min(tail[0], tail[1]) <= k ? YES : NO ) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; typedef int int2; #define int long long #define pi pair<int, int> #define mp make_pair #define pb push_back #define eb emplace_back #define f first #define s second #define INF 1e18 string printed(int mask) { string res; for (int i = 0; i < 26; i++) { if (mask & (1 << i)) { res += 1 ; } else { res += 0 ; } } return res; } int2 main() { ios::sync_with_stdio(0); cin.tie(0); int n, a, b; cin >> n >> a >> b; string st; cin >> st; vector<int> elts_prev(n); vector<int> mapping(26); vector<int> backmap(26); vector<int> elts(n); fill(mapping.begin(), mapping.end(), -1); int curmap = 0; for (int i = 0; i < n; i++) { elts_prev[i] = st[i] - a ; // cout << mapping: << mapping[elts_prev[i]] << n ; if (mapping[elts_prev[i]] == -1) { mapping[elts_prev[i]] = curmap; backmap[curmap] = elts_prev[i]; curmap++; // cout << i: << i << , curmap: << curmap << , elts_prev: << elts_prev[i] << n ; } } for (int i = 0; i < n; i++) { elts[i] = mapping[elts_prev[i]]; } vector<int> l(curmap), r(curmap), freq(curmap); fill(l.begin(), l.end(), INF); fill(r.begin(), r.end(), -INF); for (int i = 0; i < n; i++) { l[elts[i]] = min(l[elts[i]], i); r[elts[i]] = max(r[elts[i]], i); freq[elts[i]]++; } int maxn = 1 << curmap; vector<bool> satisfy(maxn); vector<int> dp(maxn); fill(dp.begin(), dp.end(), -1); dp[0] = 1; // cout << curmap: << curmap << n ; // if (n == 5000 and a == 1 and b == 1 and st[0] == o ) { // cout << curmap: << curmap << n ; // } function<int(int)> solve = [&](int i) { if (~dp[i]) return dp[i]; dp[i] = 0; int ll = INF, rr = -INF; int amt = 0; vector<int> elts; for (int j = 0; j < curmap; j++) { if (i & (1 << j)) { rr = max(rr, r[j]); ll = min(ll, l[j]); amt += freq[j]; elts.pb(j); } } // want amt >= (a / b) * (rr - ll + 1), i.e. amt >= ceil((a / b) * (rr - ll + 1)), i.e. amt >= (a * (rr - ll + 1) + (b - 1)) / b bool can_change = (amt >= ((a * (rr - ll + 1) + (b - 1)) / b)); // Case 1: change all elements to color j if (can_change) { for (int j: elts) { dp[i] |= solve(i ^ (1 << j)); } } // Case 2: multiple subtrees int cur_mask = 0; for (int j: elts) { cur_mask |= (1 << j); if (cur_mask == i) break; dp[i] |= (solve(cur_mask) & solve(i ^ cur_mask)); } // cout << mask: << printed(i) << , ll: << ll << , rr: << rr << , amt: << amt << , dp: << dp[i] << n ; return dp[i]; }; vector<int> ans; for (int i = 0; i < curmap; i++) { if (solve((maxn - 1) ^ (1 << i)) == 1) { ans.pb(backmap[i]); } } sort(ans.begin(), ans.end()); cout << ans.size() << ; for (int i = 0; i < (int)ans.size(); i++) { cout << (char)( a + ans[i]) << ; } cout << n ; }
|
#include <bits/stdc++.h> using namespace std; int d[1000005]; bool vis[1000005]; vector<pair<int, int> > G[1000005]; void dfs(int u) { for (pair<int, int> x : G[u]) if (!vis[x.first]) { vis[x.first] = 1; dfs(x.second); } } int main() { int n, m; scanf( %d%d , &n, &m); long long ans = 0; int tmp; for (int i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); tmp = x; if (x == y) ans++; else d[x]++, d[y]++; G[x].push_back(make_pair(i, y)); G[y].push_back(make_pair(i, x)); } dfs(tmp); bool test = 1; for (int i = 0; i < m; i++) if (!vis[i]) { test = 0; break; } if (test) { ans = ans * (m - 1) - ans * (ans - 1) / 2; for (int i = 1; i <= n; i++) ans += (long long)d[i] * (d[i] - 1) / 2; printf( %I64d n , ans); } else puts( 0 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int i, t, count; long long x, N; scanf( %d n , &t); while (t--) { scanf( %lld n , &N); count = 0; for (i = 1; i < 10; i++) { x = i; while (x <= N) { count++; x *= 10; x += i; } } printf( %d n , count); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 20; const int Maxmask = (1 << 16); int out[Maxn][Maxn]; bool making[Maxn][Maxmask]; int n; int s; int a[Maxn * Maxn]; int mod; void input() { cin >> n; for (int i = 0; i < n * n; i++) { cin >> a[i]; s += a[i]; } s /= n; } void place() { for (int i = 0; i < n * n; i++) out[i / n][i % n] = a[i]; } bool is_true() { int t; for (int i = 0; i < n; i++) { t = 0; for (int j = 0; j < n; j++) t += out[i][j]; if (t != s) return false; t = 0; for (int j = 0; j < n; j++) t += out[j][i]; if (t != s) return false; } t = 0; for (int i = 0; i < n; i++) t += out[i][i]; if (t != s) return false; t = 0; for (int i = 0; i < n; i++) t += out[i][n - i - 1]; if (t != s) return false; return true; } bool found() { int b[] = {2, 7, 6, 9, 5, 1, 4, 3, 8}; for (int i = 0; i < n * n; i++) if (a[i] != b[i]) return false; return true; } void calc_3() { sort(a, a + n * n); while (1) { place(); if (is_true()) break; next_permutation(a, a + (n * n)); } } void output() { cout << s << n ; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cout << out[i][j] << ; cout << n ; } } int main() { input(); calc_3(); output(); return 0; }
|
#include <bits/stdc++.h> const int maxn = 200001, maxf = 19; const long long INF = 0x3f3f3f3f3f3f3f3fLL; int n, q, tot, lnk[maxn], dep[maxn], fa[maxn][maxf]; struct Edge { int v, nxt; } e[maxn << 1]; template <class T> void swap(T& x, T& y) { const T t = x; x = y; y = t; } template <class T> const T& min(const T& x, const T& y) { return x < y ? x : y; } void dfs(int u) { for (int it = lnk[u]; it; it = e[it].nxt) { int& v = e[it].v; if (v == fa[u][0]) continue; dep[v] = dep[u] + 1; fa[v][0] = u; for (int i = 1; fa[v][i - 1]; ++i) fa[v][i] = fa[fa[v][i - 1]][i - 1]; dfs(v); } } int deeper(int u, int v) { return dep[u] < dep[v] ? v : u; } int lca(int u, int v) { if (dep[u] > dep[v]) swap(u, v); for (int i = 0, j = dep[v] - dep[u]; j; ++i, j >>= 1) if (j & 1) v = fa[v][i]; if (u == v) return u; for (int i = maxf - 1; i >= 0; --i) if (fa[u][i] != fa[v][i]) { u = fa[u][i]; v = fa[v][i]; } return fa[u][0]; } int dist(int u, int v) { return dep[u] + dep[v] - (dep[lca(u, v)] << 1); } int gcd(int x, int y) { return y ? gcd(y, x % y) : x; } void exgcd(int a, int b, int& x, int& y) { if (!b) { x = 1; y = 0; return; } exgcd(b, a % b, y, x); y -= x * (a / b); } long long Case1(int t1, int d1, int t2, int d2) { int g = gcd(t1, t2), r = (d2 - d1) % t2; if (r < 0) r += t2; if (r % g != 0) return INF; int x, y; t1 /= g; t2 /= g; r /= g; exgcd(t1, t2, x, y); if (x < 0) x += t2; x = (long long)x * r % t2; return (long long)x * t1 * g + d1; } long long AMAC(int m, int d, int l, int r) { if (l % d == 0) return l / d; if (l / d != r / d) return l / d + 1; int g = gcd(m, d); if (l % g != 0 && l / g == r / g) return -1; long long res = AMAC(d, m % d, -r % d + d, -l % d + d); if (res == -1) return -1; return (res * m + l - 1) / d + 1; } long long Case2(int t1, int d1, int t2, int d2, int dd) { int m = t2, d = t1, l = (d2 - d1 - dd) % t2, r = (d2 - d1 + dd) % t2; if (l < 0) l += t2; if (r < 0) r += t2; if (l & 1) return INF; if (t2 == dd * 2 || l > r || l == 0) return d1 + r / 2; if (!(d %= m)) return INF; long long res = AMAC(m, d, l, r); if (res == -1) return INF; return t1 * res + d1 + dd - (t1 * res % t2 - l) / 2; return t1 * res + d1 + (((-t1 * res + d2 + dd - d1) / 2) % t2 + t2) % t2; } int main() { scanf( %d , &n); for (int i = 1, u, v; i < n; ++i) { scanf( %d%d , &u, &v); e[++tot] = (Edge){v, lnk[u]}; lnk[u] = tot; e[++tot] = (Edge){u, lnk[v]}; lnk[v] = tot; } dfs(1); scanf( %d , &q); while (q--) { int u, v, x, y; scanf( %d%d%d%d , &u, &v, &x, &y); int px = deeper(lca(u, x), lca(v, x)); int py = deeper(lca(u, y), lca(v, y)); int pp = deeper(lca(u, v), lca(x, y)); if (dep[px] < dep[pp] && dep[py] < dep[pp]) { puts( -1 ); continue; } if (dep[px] < dep[pp]) px = pp; else if (dep[py] < dep[pp]) py = pp; int f1 = dist(u, v) << 1, f2 = dist(x, y) << 1, d = dist(px, py); int t1 = dist(u, px), t2 = dist(u, py), t3 = dist(x, px), t4 = dist(x, py); if (t1 <= t2) t2 = f1 - t2; else t1 = f1 - t1; if (t3 <= t4) t4 = f2 - t4; else t3 = f2 - t3; long long ans = min(min(Case1(f1, t1, f2, t3), Case2(f1, t1, f2, t4, d)), min(Case1(f1, t2, f2, t4), Case2(f1, t2, f2, t3, d))); if (ans == INF) puts( -1 ); else printf( %I64d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1; void solve() { long long n, i = 0, k; cin >> n; long long a[1000], m[1000]; m[0] = 1; a[0] = 1; while (m[i] < n) { a[i + 1] = 2 * a[i]; m[i + 1] = 2 * a[i + 1] - 1; i++; } k = i; if (n >= m[k - 1] + a[k - 1]) a[k] = n - m[k - 1]; else { if (n == a[k - 1] + 1) { for (i = 1; i <= k; i++) a[i] = a[i - 1]; } else { while (1) { a[k - 1] = (n - m[k - 2]) / 2; m[k - 1] = a[k - 1] + m[k - 2]; if (n >= a[k - 1] + m[k - 1]) { a[k] = n - m[k - 1]; break; } } } } cout << k << n ; for (i = 1; i <= k; i++) { cout << a[i] - a[i - 1] << ; } cout << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, p; cin >> t; for (p = 1; p <= t; p++) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int aa(int n) { int a = 0; for (int i = 2; i <= n - 1; i++) if (n % i == 0) { a = 1; break; } else a = 0; return a; } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { if (aa(i) == 1 && aa(n - i) == 1) { cout << i << << n - i << endl; break; } } }
|
#include <bits/stdc++.h> using namespace std; void blowback() { long long i, j, l, k, n, m, x, y, r, ans = 0, sum = 10e17; string s; long long a, b, c, d; cin >> a >> b >> c >> d; if (a > (b * c)) { cout << -1 n ; return; } k = (2 * a - b * d) / (2 * b * d); l = k + 1; k = min(k, c / d); l = min(l, c / d); ans = (a * (k + 1)) - ((k * (k + 1)) * b * d) / 2; k = l; sum = (a * (k + 1)) - ((k * (k + 1)) * b * d) / 2; cout << max({ans, sum, a}) << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t = 1; cin >> t; while (t--) { blowback(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = numeric_limits<int>::max(); const long long LLINF = numeric_limits<long long>::max(); const unsigned long long ULLINF = numeric_limits<unsigned long long>::max(); long long f[1010][1010]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { long long x, y; cin >> x >> y; x--, y--; f[y][x]++; } long long ans = 0; for (int i = 0; i < 1000; i++) { long long cur = 0; for (int j = 0; j + i < 1000; j++) { cur += f[j][i + j]; } ans += (cur - 1) * cur / 2ll; cur = 0; if (i > 0) { for (int j = 0; j + i < 1000; j++) { cur += f[i + j][j]; } ans += (cur - 1) * cur / 2ll; } } for (int i = 0; i < 1000; i++) { long long cur = 0; for (int j = 0; j <= i; j++) { cur += f[j][i - j]; } ans += (cur - 1) * cur / 2ll; cur = 0; if (i > 0) { for (int j = 0; j + i < 1000; j++) { cur += f[i + j][1000 - j - 1]; } ans += (cur - 1) * cur / 2ll; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; long long gcd(long long first, long long second) { return !second ? first : gcd(second, first % second); } long long lcm(long long first, long long second) { return (first / gcd(first, second)) * second; } void PLAY() { cout << fixed << setprecision(15); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const int MAX = 6e5; long long n, r, k; long long archers[MAX], dist[MAX]; bool valid(long long val) { memset(dist, 0, sizeof dist); long long tmp = 0, cursum = k; for (int i = 1; i <= n; ++i) { long long cur = val - archers[i] - tmp; if (cur < 0) { tmp += dist[i]; continue; } if (cur > cursum) return false; cursum -= cur; tmp += cur; long long idx = min(i + 2 * r, n); dist[idx] -= cur; tmp += dist[i]; } return true; } int main() { PLAY(); cin >> n >> r >> k; for (int i = 1; i <= n; i++) { cin >> archers[i]; long long x = max(i - r, 1LL); long long y = min(i + r, n) + 1; dist[x] += archers[i]; dist[y] -= archers[i]; } for (int i = 1; i <= n; i++) archers[i] = archers[i - 1] + dist[i]; long long lo = *min_element(archers + 1, archers + n + 1); long long hi = lo + k + 1, res = lo; while (lo <= hi) { long long mid = (lo + hi) / 2; if (valid(mid)) { res = mid; lo = mid + 1; } else hi = mid - 1; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MODV = 1e9 + 7; int b[1001]; int ans[1005]; vector<pair<int, int> > sorted; vector<pair<int, int> > unsorted; void make_ans(int n) { for (auto it : sorted) { int x = it.first; int y = it.second; for (int i = x; i < y; i++) b[i] = 0; } ans[1] = 100000; for (int i = 2; i <= n; i++) ans[i] = ans[i - 1] + b[i - 1]; } int non_decreasing(int x, int y) { for (int i = x + 1; i <= y; i++) { if (ans[i - 1] > ans[i]) return 0; } return 1; } int check() { for (auto it : unsorted) { if (non_decreasing(it.first, it.second)) return 0; } return 1; } int main() { int n, m; scanf( %d %d , &n, &m); while (m--) { int t, x, y; scanf( %d %d %d , &t, &x, &y); if (t) sorted.push_back({x, y}); else unsorted.push_back({x, y}); } sort(sorted.begin(), sorted.end()); memset(b, -1, sizeof(b)); make_ans(n); if (check()) { printf( YES n ); for (int i = 1; i <= n; i++) printf( %d , ans[i]); printf( n ); } else printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { int n, rec = 0; long long int k; cin >> n >> k; char str[1000005]; cin >> str; for (int h = 0; h < n; h++, rec++) { int pos = h; for (int i = h; i < n; i++) { if (str[i] == 0 ) { pos = i; break; } } h = pos; if (k - pos - rec >= 0) { char temp = str[pos]; str[pos] = str[rec]; str[rec] = temp; k -= (pos - rec); } else if (k > 0) { while (pos > 0 && str[pos - 1] == 1 && k > 0) { char temp = str[pos]; str[pos] = str[pos - 1]; str[pos - 1] = temp; pos--; k--; } } } cout << str << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int M = 200005; set<int> nex[M]; int path[M]; int sh[M]; vector<int> edge[M]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int from, to; scanf( %d%d , &from, &to); edge[to].push_back(from); } for (int i = 1; i <= n; i++) { sh[i] = -1; } int k; scanf( %d , &k); for (int i = 1; i <= k; i++) { int p; scanf( %d , &p); path[i] = p; } queue<int> q; q.push(path[k]); sh[path[k]] = 0; int count = 1; while (!q.empty()) { int len = q.size(); for (int i = 0; i < len; i++) { int x = q.front(); q.pop(); for (int v : edge[x]) { if (sh[v] == -1) { q.push(v); sh[v] = count; nex[v].insert(x); } else if (sh[v] == count) { nex[v].insert(x); } } } count++; } int mi = 0, ma = 0; for (int i = 1; i < k; i++) { if (nex[path[i]].find(path[i + 1]) == nex[path[i]].end()) { mi++; ma++; } else if (nex[path[i]].size() > 1) { ma++; } } printf( %d %d n , mi, ma); }
|
#include <bits/stdc++.h> using namespace std; int bit[210000], n; void upd(int i) { while (i <= n) bit[i] += 1, i += i & (-i); } void dec(int i) { while (i <= n) bit[i] -= 1, i += i & (-i); } int cal(int i) { int ret = 0; while (i > 0) ret += bit[i], i -= i & (-i); return ret; } int solve(int x) { int l = 1, r = n + 1; while (l < r) { int mid = (l + r) >> 1, tx = cal(mid); if (tx < x) l = mid + 1; else r = mid; } return l; } int a[210000], b[210000], c[210000], va[210000], vb[210000], vc[210000]; int main() { while (cin >> n) { for (int i = 0; i < n; ++i) { scanf( %d , a + i); a[i]++; } for (int i = 0; i < n; ++i) { scanf( %d , b + i); b[i]++; } memset(bit, 0, sizeof(bit)); for (int i = n - 1; i >= 0; --i) { va[i] = cal(a[i]); upd(a[i]); } memset(bit, 0, sizeof(bit)); for (int i = n - 1; i >= 0; --i) { vb[i] = cal(b[i]); upd(b[i]); } reverse(va, va + n); reverse(vb, vb + n); memset(vc, 0, sizeof(vc)); int carry = 0; for (int i = 1; i < n; ++i) { vc[i] = (carry + va[i] + vb[i]) % (i + 1); carry = (carry + va[i] + vb[i]) / (i + 1); } reverse(vc, vc + n); memset(bit, 0, sizeof(bit)); for (int i = 1; i <= n; ++i) { upd(i); } for (int i = 0; i < n; ++i) { c[i] = solve(vc[i] + 1); dec(c[i]); } for (int i = 0; i < n; ++i) { if (i) printf( ); printf( %d , c[i] - 1); } puts( ); return 0; } }
|
#pragma GCC optimize( O2 ) #include<bits/stdc++.h> #define ll long long //#define int long long #define fi first #define se second #define mpa make_pair #define eb emplace_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using namespace std; mt19937 gen(time(0)); signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; vector<int> a(n); vector<int> c(n + 1); int k = 800; int K = (n + k - 1) / k * 2; for (int i = 0; i < n; ++i) { cin >> a[i]; ++c[a[i]]; } vector<int> d; for (int i = 0; i <= n; ++i) if (c[i] >= K) d.eb(i); vector<vector<int>> psum(d.size(), vector<int>(n + 1, 0)); for (int i = 0; i < (int)(d.size()); ++i) { for (int j = 1; j <= n; ++j) { psum[i][j] = psum[i][j - 1] + (a[j - 1] == d[i]); } } vector<int> temp(n + 1); for (int z = 0; z < q; ++z) { int l, r; cin >> l >> r; int mx = 0; if (r - l + 1 < k) { for (int j = l - 1; j < r; ++j) { ++temp[a[j]]; mx = max(mx, temp[a[j]]); } for (int j = l - 1; j < r; ++j) --temp[a[j]]; } else { for (int j = 0; j < (int)(d.size()); ++j) { int cnt = psum[j][r] - psum[j][l - 1]; mx = max(mx, cnt); } } int len = (r - l + 1); int L = 0, R = mx; while (L != R) { int M = (L + R) / 2; if ((len - M + 1) / 2 >= mx - M) { R = M; } else { L = M + 1; } } cout << R + 1 << n ; } } /* */
|
#include <bits/stdc++.h> const double EPS = 1e-8; using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); } class Graph { public: int vn; int sumcost = 0; vector<vector<pair<int, int>>> g; Graph(int n) { vn = n; g.resize(n); } virtual void con(int a, int b, int w) = 0; int getWeight(int f, int t) { auto itr = lower_bound((g[f]).begin(), (g[f]).end(), make_pair(t, INT_MIN)); if (itr != g[f].end()) return itr->second; return INT_MIN; } int Costsum() { return sumcost; } void scan(int edcount, bool oindexed, bool w) { for (int i = (0); (edcount) > i; i++) { int a, b, c = 1; scanf( %d %d , &a, &b); if (w) scanf( %d , &c); con(a - oindexed, b - oindexed, c); } } }; class BiDGraph : public Graph { public: BiDGraph(int n) : Graph(n) {} void con(int a, int b, int w = 1) { g[a].push_back({b, w}); g[b].push_back({a, w}); sumcost++; } }; struct RSQ { int n; vector<int> dat; RSQ() {} RSQ(int n_) { n = 1; while (n < n_) n *= 2; dat.resize(2 * n - 1, 0); } void add(int k, int a) { k += n - 1; dat[k] += a; while (k > 0) { k = (k - 1) / 2; dat[k] = dat[2 * k + 1] + dat[2 * k + 2]; } } int query(int a, int b) { return query(a, b, 0, 0, n); } int query(int a, int b, int k, int l, int r) { if (r <= a || b <= l) return 0; if (a <= l && r <= b) return dat[k]; int vl = query(a, b, 2 * k + 1, l, (l + r) / 2); int vr = query(a, b, 2 * k + 2, (l + r) / 2, r); return vl + vr; } }; class Heavy_Light_Decomposition { public: BiDGraph g, compg; vector<int> sz, depth, chain, par; int bn = 0; vector<int> bvn, inbn; vector<vector<int>> bv; Heavy_Light_Decomposition(BiDGraph graph, vector<int> root) : g(graph), compg(graph.vn), sz(graph.vn, 1), depth(graph.vn), chain(graph.vn), par(graph.vn), bvn(graph.vn, -1), inbn(graph.vn) { for (auto itr : root) getsz(itr, itr); bv.push_back(vector<int>()); for (auto itr : root) { if (bv[bv.size() - 1].size()) bv.push_back(vector<int>()), bn++; HLD(itr, -1, itr, bn); } } int getsz(int cur, int p) { par[cur] = p; for (auto itr : g.g[cur]) if (p != itr.first) depth[itr.first] = depth[cur] + 1, sz[cur] += getsz(itr.first, cur); return sz[cur]; } void HLD(int cur, int p, int head, int num) { chain[cur] = head, bvn[cur] = num; inbn[cur] = bv[num].size(), bv[num].push_back(cur); pair<int, int> Maxc = {-1, -1}; for (auto itr : g.g[cur]) if (itr.first != p) Maxc = max(Maxc, {sz[itr.first], itr.first}); for (auto itr : g.g[cur]) if (itr.first != p) { int nb = num; if (itr.first != Maxc.second) { bv.push_back(vector<int>()); nb = ++bn; } HLD(itr.first, cur, itr.first == Maxc.second ? head : itr.first, nb); } } int lca(int a, int b) { if (chain[a] == chain[b]) return depth[a] < depth[b] ? a : b; if (depth[chain[a]] > depth[chain[b]]) return lca(par[chain[a]], b); return lca(a, par[chain[b]]); } void for_each_edge(int a, int b, function<void(int, int)> func) { if (chain[a] == chain[b]) return func(inbn[a] < inbn[b] ? a : b, inbn[a] < inbn[b] ? b : a); if (depth[chain[a]] < depth[chain[b]]) swap(a, b); for_each_edge(a, chain[a], func), for_each_edge(par[chain[a]], b, func); } }; struct UnionFind { vector<int> data; UnionFind(int size) : data(size, -1) {} bool unionSet(int x, int y) { x = root(x); y = root(y); if (x != y) { if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } bool isroot(int x) { return data[x] < 0; } int size(int x) { return -data[root(x)]; } }; int main() { int n; cin >> n; BiDGraph g(n); vector<int> t(n); vector<int> root; UnionFind uf(n); for (int i = (0); (n) > i; i++) { int p; scanf( %d %d , &p, &t[i]); if (p == -1) root.push_back(i); if (p > 0) uf.unionSet(i, p - 1), g.con(i, p - 1); } Heavy_Light_Decomposition hld(g, root); vector<RSQ> seg; for (int i = (0); (hld.bv.size()) > i; i++) { seg.push_back(RSQ(hld.bv[i].size())); for (int j = (0); (hld.bv[i].size()) > j; j++) seg[i].add(j, t[hld.bv[i][j]]); } int q; cin >> q; for (int i = (0); (q) > i; i++) { int mode, p, c; scanf( %d %d %d , &mode, &p, &c); c--, p--; if (c == p || !uf.findSet(p, c)) { printf( NO n ); continue; } int lca = hld.lca(p, c); if (mode == 1) { bool f = 0; if (lca == p) { int sum = 0; hld.for_each_edge(p, c, [&](int u, int v) { sum += seg[hld.bvn[u]].query(hld.inbn[u], hld.inbn[v] + 1); if (u == lca) { sum -= t[lca]; } else if (v == lca) { sum -= t[lca]; } }); if (sum == 0) f = 1; } printf(f ? YES n : NO n ); } else { if (lca == c) { printf( NO n ); continue; } int sum = 0, sum2 = 0; hld.for_each_edge(p, lca, [&](int u, int v) { sum += seg[hld.bvn[u]].query(hld.inbn[u], hld.inbn[v] + 1); if (u == lca) { sum -= t[lca]; } else if (v == lca) { sum -= t[lca]; } }); hld.for_each_edge(c, lca, [&](int u, int v) { sum2 += seg[hld.bvn[u]].query(hld.inbn[u], hld.inbn[v] + 1); if (u == lca) { sum2 -= t[lca]; } else if (v == lca) { sum2 -= t[lca]; } }); if (sum == 0 && sum2 == (hld.depth[c] - hld.depth[lca])) printf( YES n ); else printf( NO n ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, vector<T> V) { for (auto v : V) os << v << ; return cout << ; } template <class T> ostream& operator<<(ostream& os, set<T> S) { for (auto s : S) os << s << ; return cout << ; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << P.first << << P.second; } const long long mod = 1; long long inv(long long i) { if (i == 1) return 1; return (mod - ((mod / i) * inv(mod % i)) % mod) % mod; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b, b % a); } int main() { int r, h; cin >> r >> h; int ans = 2 * (h / r); if ((double)(h - (ans / 2) * r) / (double)r >= sqrt(3) / 2) { ans += 3; } else if (2 * (h - (ans / 2) * r) >= r) { ans += 2; } else ans++; cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int t; double pi = acos(-1.0); double d, h, v, e; int main() { scanf( %lf%lf%lf%lf , &d, &h, &v, &e); double r = d / 2; if (pi * r * r * e > v) cout << NO << endl; else { double s = (pi * r * r * h) / (v - pi * r * r * e); cout << YES << endl; printf( %.12f n , s); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int ans[5001][5001]; int main() { memset((ans), 0, sizeof(ans)); int n, m, l, r; char s[5001]; cin >> n >> m; for (int i = 1; i <= n; i++) { l = r = 0; scanf( %s , s); for (int j = 0; j < m; j++) { if (s[j] == 0 ) { l = j + 1; } else ans[l][j]++; } } int maxi = -1, x, y; for (int i = 2; i < m; i++) { for (int j = 1; j <= i; j++) { ans[j][i] += ans[j - 1][i]; } } for (int i = 0; i <= m; i++) for (int j = i; j < m; j++) maxi = max((j - i + 1) * ans[i][j], maxi); cout << maxi << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, fre[11], fre1[11]; string tot, no, cm = , cm1 = ; bool belongs(int x) { int tmp = x, len = 0, i; int tmf[11] = {}; while (tmp > 0) { tmf[(tmp % 10)]++; tmp /= 10; len++; } if (n - len == x) { for (i = 0; i < 10; i++) { if (fre1[i] < tmf[i]) return false; } return true; } return false; } int main() { int i, j; cin >> tot; cin >> no; if (tot == 01 || tot == 10 ) { cout << 0 n ; return 0; } n = tot.length(); m = no.length(); for (i = 0; i < n; i++) { fre[tot[i] - 48]++; fre1[tot[i] - 48]++; } for (i = 0; i < m; i++) { fre1[no[i] - 48]--; } for (i = 1; i <= n; i++) { if (belongs(i)) { int tmp = i; while (tmp > 0) { fre1[(tmp % 10)]--; tmp /= 10; } break; } } int tm; for (i = 0; i < 10; i++) { tm = fre1[i]; while (tm > 0) { cm1 += (i + 48); tm--; } } for (i = 1; i < 10; i++) { if (fre1[i] > 0) { cm += (i + 48); fre1[i]--; break; } } for (i = 0; i < 10; i++) { tm = fre1[i]; while (tm > 0) { cm += (i + 48); tm--; } } if (no[0] == 0 ) { i = 1; n = cm.size(); while (i < n && cm[i] < no[0]) { i++; } string ans1 = , ans2 = ; for (j = 0; j < min(i, n); j++) ans1 += cm[j]; ans1 += no; for (j = i; j < n; j++) ans1 += cm[j]; i = 1; while (i < n && cm[i] <= no[0]) { i++; } for (j = 0; j < min(i, n); j++) ans2 += cm[j]; ans2 += no; for (j = i; j < n; j++) ans2 += cm[j]; string ans; if (ans1[0] != 0 ) { ans = ans1; } else if (ans2[0] != 0 ) { ans = ans2; } if (ans1[0] != 0 ) { ans = min(ans, ans1); } if (ans2[0] != 0 ) { ans = min(ans, ans2); } cout << ans << endl; } else { string ans3 = no + cm1; i = 1; n = cm.size(); while (i < n && cm[i] < no[0]) { i++; } string ans1 = , ans2 = ; for (j = 0; j < min(i, n); j++) ans1 += cm[j]; ans1 += no; for (j = i; j < n; j++) ans1 += cm[j]; i = 1; while (i < n && cm[i] <= no[0]) { i++; } for (j = 0; j < min(i, n); j++) ans2 += cm[j]; ans2 += no; for (j = i; j < n; j++) ans2 += cm[j]; string ans; if (ans1[0] != 0 ) { ans = ans1; } else if (ans2[0] != 0 ) { ans = ans2; } else if (ans3[0] != 0 ) { ans = ans3; } if (ans1[0] != 0 ) { ans = min(ans, ans1); } if (ans2[0] != 0 ) { ans = min(ans, ans2); } if (ans3[0] != 0 ) { ans = min(ans, ans3); } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long l; typedef pair<int, int> pint; typedef vector<pint> vpint; typedef vector<int> vint; typedef vector<vint> vvint; int n, m, x[123457], cum[1234567]; int ans; map<int, int> mp; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> x[i]; cum[i] = x[i]; } sort(cum, cum + n); for (int i = 0; i < n; ++i) { if (x[i] != cum[i]) ans++; } if (ans < 3) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; struct ma { int x, vt; } a[105]; bool cmp(ma p, ma y) { return p.x < y.x; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i].x; a[i].vt = i; } sort(a + 1, a + n + 1, cmp); for (int i = 1; i <= n / 2; i++) cout << a[i].vt << << a[n - i + 1].vt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int dp[300005][35], a[300005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); a[i] /= 100; } for (int i = 0; i <= n; i++) for (int j = 0; j <= 30; j++) dp[i][j] = 1000000000; dp[0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j <= 30; j++) { dp[i + 1][j + a[i + 1] / 10] = min(dp[i + 1][j + a[i + 1] / 10], dp[i][j] + a[i + 1]); dp[i + 1][j - min(j, a[i + 1])] = min(dp[i + 1][j - min(j, a[i + 1])], dp[i][j] + a[i + 1] - min(j, a[i + 1])); } } int maxx = 1000000000; for (int i = 0; i <= 30; i++) maxx = min(maxx, dp[n][i]); printf( %d00 n , maxx); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; long long arr[t], sum = 0; for (int i = 0; i < t; ++i) { cin >> arr[i]; sum += arr[i]; } if (sum != 0) { cout << YES << endl; cout << 1 << endl; cout << 1 << << t << endl; return 0; } if (t == 1) { if (arr[0] != 0) { cout << YES << endl; cout << 1 << endl; cout << 1 << endl; } else cout << NO << endl; } else { for (int i = 0; i < t; i++) { sum += arr[i]; if (sum != 0) { cout << YES << endl; cout << 2 << endl; cout << 1 << << i + 1 << endl; cout << i + 2 << << t << endl; return 0; } } cout << NO << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long global = 0; void test_case(long long); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; int yes = 1; if (yes) cin >> t; else t = 1; for (long long T = 0; T < t; T++) { test_case(T); } return 0; } void test_case(long long T) { long long n, m; cin >> n >> m; vector<string> vec(n); for (long long(i) = 0; (i) < n; (i)++) { cin >> vec[i]; } vector<long long> x = {0, 1, 0, -1}, y = {1, 0, -1, 0}; long long g = 0; for (long long(i) = 0; (i) < n; (i)++) { for (long long(j) = 0; (j) < m; (j)++) { if (vec[i][j] == G ) g++; if (vec[i][j] == B ) { for (long long k = 0; k < 4; k++) { long long idx = i + x[k]; long long jdx = j + y[k]; if (idx >= 0 && idx < n && jdx >= 0 && jdx < m) { if (vec[idx][jdx] == G ) { cout << no << endl; return; } else if (vec[idx][jdx] == . ) { vec[idx][jdx] = # ; } } } } } } queue<pair<long long, long long>> q; q.push(pair<long long, long long>(n - 1, m - 1)); map<pair<long long, long long>, long long> v; v[pair<long long, long long>(n - 1, m - 1)]++; long long vg = 0; while (!q.empty()) { auto f = q.front(); q.pop(); if (vec[f.first][f.second] == G ) vg++; else if (vec[f.first][f.second] == # ) break; for (long long k = 0; k < 4; k++) { long long idx = f.first + x[k]; long long jdx = f.second + y[k]; if (idx >= 0 && idx < n && jdx >= 0 && jdx < m) { if (vec[idx][jdx] == # || vec[idx][jdx] == B ) continue; if (!v[pair<long long, long long>(idx, jdx)]) { v[pair<long long, long long>(idx, jdx)]++; q.push(pair<long long, long long>(idx, jdx)); } } } } if (vg == g) cout << yes << endl; else cout << no << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1004; int cnk[N][N] = {0}; int mod = 1000000007; void init_cnk() { for (int i = 0; i < N; ++i) { cnk[i][0] = 1; cnk[i][i] = 1; } for (int i = 1; i < N; ++i) { for (int j = 1; j < N; ++j) { cnk[i][j] = (cnk[i - 1][j - 1] + cnk[i - 1][j]) % mod; } } } int main() { ios_base::sync_with_stdio(false); cout.precision(10); cout << fixed; int k; cin >> k; vector<int> c(k, 0); for (int i = 0; i < k; ++i) cin >> c[i]; init_cnk(); int n = c.size(); vector<int> res(n, 0); res[0] = 1; int acc = c[0]; for (int i = 1; i < n; ++i) { int cur = c[i]; for (int j = 0; j < cur; ++j) { res[i] += (1LL * cnk[acc - 1 + j][j] * res[i - 1]) % (1LL * mod); res[i] %= mod; } acc += cur; } cout << res[n - 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 300 * 1000 + 7; const long long MOD = 1000 * 1000 * 1000 + 7; const long long INF = 1000000000000000 + 7; const double PI = 2 * acos(0.0); long long a, b, c; int main(void) { cin >> a >> b >> c; if (a > b || a > c) cout << No << endl; else cout << Yes << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int arr[15]; for (int i = 1; i <= 14; i++) cin >> arr[i]; long long int brr[15]; long long int ans = -1; for (int i = 1; i <= 14; i++) { if (arr[i] == 0) continue; for (int j = 1; j <= 14; j++) brr[j] = arr[j]; long long int st = brr[i]; brr[i] = 0; for (int j = 1; j <= 14; j++) brr[j] += st / 14; st = st % 14; int k = i + 1; if (k > 14) k = 1; while (st > 0) { brr[k] += 1; k = k + 1; if (k > 14) k = 1; st--; } long long int temp = 0; for (int j = 1; j <= 14; j++) if (brr[j] % 2 == 0) temp += brr[j]; ans = (ans > temp) ? ans : temp; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, k; void search(int cur) { int tot, c[10]; int ok; if (cur == n) tot++; else for (int i = 0; i < n; i++) { ok = 1; c[cur] = i; } for (int j = 0; j < cur; j++) { if (c[cur] == c[j] || cur - c[cur] == j - c[j] || cur + c[cur] == j + c[j]) { ok = 0; break; } } if (ok) search(cur + 1); } const long long MAXN = 55; long long num[MAXN]; void xswl() { scanf( %lld%lld , &n, &k); for (long long i = 1; i <= n; ++i) { scanf( %lld , &num[i]); } num[0] = 1; sort(num + 1, num + 1 + n); long long res = 999999999999999; for (long long i = 2e5; i >= 0; --i) { long long cnt = 0; long long nowr = 0; int t = lower_bound(num + 1, num + 1 + n, i) - num; for (int j = t; j <= n; ++j) { long long now = 0; long long u = num[j]; while (u > i) { ++now; u >>= 1; } if (u == i) { ++cnt; nowr += now; } if (cnt == k) break; } if (cnt == k) { if (res > nowr) { res = nowr; } } } printf( %lld , res); } int main() { xswl(); }
|
#include <bits/stdc++.h> using namespace std; int maxn = 1000000000; int main(int argc, char const *argv[]) { int t; cin >> t; while (t--) { int a, b; cin >> a >> b; if (a > b) a = a + b, b = a - b, a = a - b; int side = max(2 * a, b); cout << side * side << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int q; cin >> q; while (q--) { int a, b, n, S; cin >> a >> b >> n >> S; int x = min(a, S / n); cout << (S - x * n <= b ? YES : NO ) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int c[400000], t[400000], n, m, x[400000]; int main() { scanf( %d%d , &n, &m); int s = 0; for (int i = 0; i < n; ++i) { scanf( %d%d , &c[i], &t[i]); s += c[i] * t[i]; x[i] = s; } while (m--) { int a; scanf( %d , &a); printf( %d n , lower_bound(x, x + n, a) - x + 1); } }
|
#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1000000000000; const double eps = (double)1e-8; const int mod = (int)1000000007; const int maxn = (int)1e6 + 5; int n, res, cnt, z[maxn]; pair<pair<int, int>, pair<int, int> > a[maxn]; vector<int> t[maxn]; vector<pair<int, int> > vc[maxn]; map<int, int> m; int sum(int z, int r) { res = 0; for (; r >= 0; r = (r & (r + 1)) - 1) res += t[z][r]; return res; } void upd(int z, int i, int delta) { for (; i < (int)t[z].size(); i = (i | (i + 1))) t[z][i] += delta; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n; cnt = 0; for (int i = (1); i <= (n); i++) { cin >> a[i].second.first >> a[i].first.first >> a[i].first.second; a[i].second.second = i; if (!m.count(a[i].first.second)) m[a[i].first.second] = ++cnt; vc[m[a[i].first.second]].push_back(make_pair(a[i].first.first, i)); } for (int i = (1); i <= (cnt); i++) { sort(vc[i].begin(), vc[i].end()); for (int j = (0); j < (vc[i].size()); j++) { z[vc[i][j].second] = j; t[i].push_back(0); } } for (int i = (1); i <= (n); i++) { if (a[i].second.first == 1) { upd(m[a[i].first.second], z[i], 1); } else if (a[i].second.first == 2) { upd(m[a[i].first.second], z[i], -1); } else { cout << sum(m[a[i].first.second], z[i]) << n ; } } return 0; }
|
#include <bits/stdc++.h> const int Mod = 1001943197; const int Base = 34300; const int MN = 100005, MQ = 100005, S = 500, MS = S + 5; char s[MN], t[MN]; int N, lt, Lim, per[MN]; int pBase[MN]; int Hs[MN], Ht[MN]; inline int Hmerge(int h1, int h2, int l2) { return (int)(((long long)h1 * pBase[l2] + h2) % Mod); } inline int gHash(int *H, int lb, int rb) { return (int)(((long long)H[lb - 1] * (Mod - pBase[rb - lb + 1]) + H[rb]) % Mod); } inline bool smallerThan(int pos1, int pos2) { if (pos1 == pos2) return false; bool rev = false; if (pos1 > pos2) std::swap(pos1, pos2), rev = true; int lb = 0, rb = lt + (pos2 - pos1), ans = -1; while (lb <= rb) { int mid = (lb + rb) / 2; int hs1 = mid <= lt ? gHash(Ht, 1, mid) : Hmerge(Ht[lt], gHash(Hs, pos1 + 1, pos1 + (mid - lt)), mid - lt); int hs2 = mid <= pos2 - pos1 ? gHash(Hs, pos1 + 1, pos1 + mid) : Hmerge(gHash(Hs, pos1 + 1, pos2), gHash(Ht, 1, mid - (pos2 - pos1)), mid - (pos2 - pos1)); if (hs1 == hs2) ans = mid, lb = mid + 1; else rb = mid - 1; } if (ans == lt + (pos2 - pos1)) return rev ? pos2 < pos1 : pos1 < pos2; char ch1 = ans < lt ? t[ans + 1] : s[pos1 + ans - lt + 1]; char ch2 = ans < pos2 - pos1 ? s[pos1 + ans + 1] : t[ans - (pos2 - pos1) + 1]; if (rev) std::swap(ch1, ch2); return ch1 < ch2; } int iper[MN], id[MN]; int ST[17][MN]; inline int gMin(int x, int y) { return iper[x] < iper[y] ? x : y; } inline int RMQ(int l, int r) { int j = 31 - __builtin_clz(r - l + 1); return gMin(ST[j][l + (1 << j) - 1], ST[j][r]); } int Q, ql[MQ], qr[MQ], qk[MQ], qx[MQ], qy[MQ], Ans[MQ]; std::vector<int> V[MS]; int main() { scanf( %s%s%d , s + 1, t + 1, &Q); N = (int)(strlen(s + 1)), lt = (int)(strlen(t + 1)); for (int i = 1; i <= N; ++i) Hs[i] = (int)(((long long)Hs[i - 1] * Base + (s[i] - a + 1)) % Mod); for (int i = 1; i <= lt; ++i) Ht[i] = (int)(((long long)Ht[i - 1] * Base + (t[i] - a + 1)) % Mod); Lim = std::max(N, lt), pBase[0] = 1; for (int i = 1; i <= Lim; ++i) pBase[i] = (int)((long long)pBase[i - 1] * Base % Mod); for (int i = 1; i <= N + 1; ++i) per[i] = i - 1; std::sort(per + 1, per + N + 2, smallerThan); for (int i = 1; i <= N + 1; ++i) iper[per[i]] = i; for (int i = 0; i <= N; ++i) ST[0][i] = i; for (int j = 0; 2 << j <= N + 1; ++j) for (int i = (2 << j) - 1; i <= N; ++i) ST[j + 1][i] = gMin(ST[j][i - (1 << j)], ST[j][i]); for (int i = 1; i <= Q; ++i) { scanf( %d%d%d%d%d , &ql[i], &qr[i], &qk[i], &qx[i], &qy[i]); if (qk[i] > S) { int lim = N / qk[i], ans = -1; for (int j = 0; j <= lim; ++j) { int l = j * qk[i] + qx[i]; int r = j * qk[i] + qy[i]; l = std::max(l, ql[i]); r = std::min(r, qr[i]); if (l <= r) { int res = RMQ(l, r); if (ans == -1) ans = res; else ans = gMin(ans, res); } } Ans[i] = ans; } else V[qk[i]].push_back(i); } for (int k = 1; k <= S; ++k) { int tot = 0, mxlen = N / k + 1; for (int j = 0; j < k; ++j) for (int i = j; i <= N; i += k) ST[0][++tot] = i, id[i] = tot; for (int j = 0; 2 << j <= mxlen; ++j) for (int i = 2 << j; i <= tot; ++i) ST[j + 1][i] = gMin(ST[j][i - (1 << j)], ST[j][i]); for (int i : V[k]) { int ans = -1; for (int j = qx[i]; j <= qy[i]; ++j) { int l = id[j] + (ql[i] - j + k - 1) / k; int r = id[j] + (qr[i] - j + k) / k - 1; if (l <= r) { int res = RMQ(l, r); if (ans == -1) ans = res; else ans = gMin(ans, res); } } Ans[i] = ans; } } for (int i = 1; i <= Q; ++i) printf( %d%c , Ans[i], n [i == Q]); return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[100004]; long long k, mod = 1000000007; long long qpow(long long n, long long m) { long long ans = 1; for (; m; m >>= 1) { if (m & 1) ans = ans * n % mod; n = n * n % mod; } return ans; } int main() { scanf( %s %lld , s, &k); int l = strlen(s); long long p = 0, q = 0; for (int i = 0; i < l; i++) if (s[i] == 0 || s[i] == 5 ) p = (p + qpow(2, i)) % mod; q = (qpow(2, k * l) - 1) * qpow(qpow(2, l) - 1, mod - 2) % mod; printf( %lld n , p * q % mod); }
|
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v(6); for (int i = 0; i < 6; ++i) cin >> v[i]; int n; cin >> n; vector<pair<int, int>> a; int num; for (int i = 0; i < n; ++i) { cin >> num; for (int j = 0; j < 6; ++j) { a.push_back({num - v[j], i}); } } sort(a.begin(), a.end()); int ans = 1e9 + 7; map<int, int> mp; int t = 0; int l = 0; for (int i = 0; i < a.size(); ++i) { int k = a[i].second; if (mp[k] == 0) { t++; } mp[k]++; while (mp[a[l].second] > 1) { mp[a[l].second]--; l++; } if (t == n) { ans = min(ans, a[i].first - a[l].first); } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; char c; unsigned int mask; int u; vector<unsigned int> ip; set<unsigned int> net; cin >> n >> k; scanf( %c , &c); unsigned int x, x1; for (int i = 0; i < n; i++) { c = 0; x = 0; x1 = 0; while (c != n ) { scanf( %c , &c); if ((c != . ) && (c != n )) { x *= 10; x += (c - 0 ); } else { x1 = x1 << 8; x1 += x; x = 0; } } ip.push_back(x1); } for (int len = 1; len < 32; len++) { mask = 1; for (int y = 1; y < len; y++) { mask = mask << 1; mask++; } mask = mask << (32 - len); unsigned int v = 0; for (int i = 0; i < n; i++) { v = ip[i]; v &= mask; net.insert(v); } u = net.size(); if (u == k) { unsigned int xx[4]; xx[3] = mask % 256; mask /= 256; xx[2] = mask % 256; mask /= 256; xx[1] = mask % 256; mask /= 256; xx[0] = mask; cout << xx[0] << . << xx[1] << . << xx[2] << . << xx[3] << endl; return 0; } if (u > k) { cout << -1 << endl; return 0; } net.clear(); } cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int t; long long sufa[100010]; long long a[100010]; pair<long long, long long> ab[100010]; long long n, m; int main() { cin >> t; while (t--) { scanf( %lld %lld , &n, &m); for (long long i = 0; i < m; i++) { scanf( %lld %lld , &ab[i].first, &ab[i].second); } sort(ab, ab + m); sufa[m] = 0; sufa[m - 1] = a[m - 1] = ab[m - 1].first; for (int i = m - 1 - 1; i >= 0; i--) { a[i] = ab[i].first; sufa[i] = sufa[i + 1] + a[i]; } long long ans = 0; if (n <= m) { ans = sufa[m - n]; } for (long long i = 0; i < m; i++) { long long idx = lower_bound(a, a + m, ab[i].second) - a; idx = max(idx, m - n); long long costn = m - idx; long long costa = 0; if (idx > i && costn < n) { costa = ab[i].first; costn += 1; } ans = max(ans, sufa[idx] + costa + (n - costn) * ab[i].second); } printf( %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> long long mpow(long long a, long long n, long long mod) { long long ret = 1; long long b = a; while (n) { if (n & 1) ret = (ret * b) % mod; b = (b * b) % mod; n >>= 1; } return (long long)ret; } using namespace std; int a[100000 + 5]; map<int, int> ind; long long cnt[1500]; long long dp[1400][1400]; long long fact[100000 + 5]; long long inv[100000 + 5]; void computefact() { fact[0] = 1; inv[0] = 1; long long i, j; for (j = 1; j < 100000 + 5; j++) { fact[j] = (fact[j - 1] * j) % 1000000007; inv[j] = mpow(fact[j], 1000000007 - 2, 1000000007); } } long long ncr(long long n, long long r) { long long den = (inv[r] * inv[n - r]) % 1000000007; long long num = (fact[n] * den) % 1000000007; return num; } bool chk(int x) { while (x != 0) { int p = x % 10; if (!(p == 4 || p == 7)) { return 0; } x /= 10; } return 1; } int main() { int i, j; vector<int> luck; long long n, len; cin >> n >> len; long long unl = 0; int c = 1; computefact(); for (j = 0; j < n; j++) { cin >> a[j]; if (chk(a[j])) { if (!ind[a[j]]) { luck.push_back(a[j]); ind[a[j]] = c; cnt[c]++; c++; } else { cnt[ind[a[j]]]++; } } else unl++; } dp[0][0] = 1; int sz = luck.size(); for (i = 1; i <= sz; i++) { for (j = 0; j <= sz; j++) { dp[i][j] = (dp[i - 1][j] + (dp[i - 1][j - 1] * cnt[i]) % 1000000007) % 1000000007; } } long long ans = 0; for (long long k = 0; k <= min(len, unl); k++) { long long q = len - k; if (q > sz) continue; ans = (ans + (ncr(unl, k) * dp[sz][q]) % 1000000007) % 1000000007; } cout << ans; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) using namespace std; mt19937 rng((int)std::chrono::steady_clock::now().time_since_epoch().count()); const int N = 1e5 + 3; int ok[N], tsz[N], dep[N]; vector<int> adj[N], g[N]; multiset<int> mset[N]; int vis[N]; bool flag; void dfs2(int u) { vis[u] = 1; for (auto v : adj[u]) { if (vis[v] == 2) flag = false; if (!vis[v]) dfs2(v); } vis[u] = 2; } void dfs(int u, int keep) { vis[u] = 1; int bigchild = -1, high = -1; for (auto v : adj[u]) { if (!vis[v] and tsz[v] > high) { high = tsz[v]; bigchild = v; } } multiset<int> backEdge; for (auto v : adj[u]) { if (!vis[v] and v != bigchild) dfs(v, 0); else if (vis[v] == 1) backEdge.insert(v); } if (bigchild != -1) { dfs(bigchild, 1); swap(mset[u], mset[bigchild]); } for (auto x : backEdge) mset[u].insert(x); for (auto v : adj[u]) { if (v != bigchild) { for (auto x : mset[v]) { mset[u].insert(x); } } } mset[u].erase(u); if (int(mset[u].size()) == 1) { g[*mset[u].begin()].push_back(u); } vis[u] = 2; } bool interesting(int u) { flag = true; dfs2(u); return flag; } void dfs4(int u) { vis[u] = 1; ok[u] = 1; for (int v : g[u]) { if (!vis[v]) dfs4(v); } vis[u] = 2; } int dfs3(int u, int d = 0) { vis[u] = 1; dep[u] = d; for (auto v : adj[u]) { if (!vis[v]) tsz[u] += dfs3(v, d + 1); } vis[u] = 2; return tsz[u] + 1; } void solve() { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) adj[i].clear(), tsz[i] = 0, mset[i].clear(), ok[i] = 0, g[i].clear(); for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; adj[a].push_back(b); } int root = -1; for (int t = 0; t < 100; ++t) { int u = rng() % n + 1; if (interesting(u)) { root = u; } for (int i = 1; i <= n; ++i) vis[i] = 0; if (root != -1) break; } if (root == -1) { cout << -1 << endl; return; } dfs3(root); for (int i = 1; i <= n; ++i) vis[i] = 0; dfs(root, 0); for (int i = 1; i <= n; ++i) vis[i] = 0; dfs4(root); vector<int> ans; for (int i = 1; i <= n; ++i) if (ok[i]) ans.push_back(i); if (5 * int(ans.size()) < n) cout << -1 << endl; else { for (auto x : ans) cout << x << ; cout << endl; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int vp, vd, t, f, c; cin >> vp >> vd >> t >> f >> c; int vs = vd - vp; if (vp > vd) { cout << 0; return 0; } if (vp == vd) { cout << 0; return 0; } double d = vp * t; d += d / (1.0 * vs) * vp; cerr << d << endl; if (int(d) >= c) { cout << 0; return 0; } int ans = 1; while ((int)d < c) { d += (d / vd + f) * vp; d += (d / vs) * vp; if (d - c > -1e-12) { cout << ans; return 0; } ans++; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; long long n, k, k1, k2, m; int main() { cin >> n >> k; m = n; while (m % 2 == 0) { k1++; m /= 2; } while (m % 5 == 0) { k2++; m /= 5; } for (int i = 1; i <= max(0ll, k - k1); ++i) { n *= 2; } for (int i = 1; i <= max(0ll, k - k2); ++i) { n *= 5; } cout << n; }
|
#include <bits/stdc++.h> using namespace std; int n, m, aa[300005], bb[300005], v[1000005], q; int x[4000005], y[4000005], dx; void build(int l, int r, int i) { if (l + 1 == r) { y[i] = v[l]; return; } int mi = (l + r) / 2; build(l, mi, i * 2); build(mi, r, i * 2 + 1); y[i] = max(y[i * 2], y[i * 2 + 1]); } void add(int a, int b, int l, int r, int i) { if (a == l && b == r) { x[i] += dx; y[i] += dx; return; } int mi = (l + r) / 2; if (a < mi) add(a, min(mi, b), l, mi, i * 2); if (mi < b) add(max(a, mi), b, mi, r, i * 2 + 1); y[i] = max(y[i * 2], y[i * 2 + 1]) + x[i]; } int find(int l, int r, int i, int vv) { if (l + 1 == r) return l; vv -= x[i]; int mi = (l + r) / 2; if (y[i * 2 + 1] > vv) return find(mi, r, i * 2 + 1, vv); return find(l, mi, i * 2, vv); } int main() { scanf( %d%d , &n, &m); v[0] = n + 1; for (int i = 1; i <= n; i++) { scanf( %d , aa + i); v[aa[i]]++; } for (int i = 1; i <= m; i++) { scanf( %d , bb + i); v[bb[i]]--; } for (int i = 1000000; i >= 0; i--) v[i] += v[i + 1]; build(0, 1000001, 1); scanf( %d , &q); while (q--) { int ta, tb, tc; scanf( %d%d%d , &ta, &tb, &tc); if (ta == 1) { if (aa[tb] < tc) { dx = 1; add(aa[tb] + 1, tc + 1, 0, 1000001, 1); } else if (aa[tb] > tc) { dx = -1; add(tc + 1, aa[tb] + 1, 0, 1000001, 1); } aa[tb] = tc; } else { if (bb[tb] < tc) { dx = -1; add(bb[tb] + 1, tc + 1, 0, 1000001, 1); } else if (bb[tb] > tc) { dx = 1; add(tc + 1, bb[tb] + 1, 0, 1000001, 1); } bb[tb] = tc; } ta = find(0, 1000001, 1, 0); if (ta == 0) ta = -1; printf( %d n , ta); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i, maxi, mini; cin >> n; int z[n], o = 0; for (i = 0; i < n; i++) { cin >> z[i]; if (i == 0) { maxi = z[i]; mini = z[i]; } if (i > 0) { if (z[i] > maxi) { o++; maxi = z[i]; } if (z[i] < mini) { o++; mini = z[i]; } } } cout << o; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int INF = 1e9; const long long LINF = 1LL * INF * INF; const int MAXN = 100007; const double EPS = 1e-7; int A[MAXN]; int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; if (n == 1 && m == 1) { cout << YES n1 ; return 0; } if (n == 1 && m <= 3 || m == 1 && n <= 3 || n == 2 && m <= 3 || m == 2 && n <= 3) { cout << NO ; return 0; } if (n == 1 && m == 4) { cout << YES n2 4 1 3 ; return 0; } if (n == 4 && m == 1) { cout << YES n2 n4 n1 n3 ; return 0; } if (n == 2 && m == 4) { cout << YES n ; cout << 5 4 7 2 << endl; cout << 3 6 1 8 ; return 0; } if (n == 4 && m == 2) { cout << YES n ; cout << 6 1 n ; cout << 3 8 n ; cout << 2 5 n ; cout << 7 4 n ; return 0; } if (n == 3 && m == 3) { cout << YES n ; cout << 2 9 4 n ; cout << 7 5 3 n ; cout << 6 1 8 n ; return 0; } if (n == 3 && m == 4) { cout << YES n ; cout << 6 8 11 2 n ; cout << 9 3 1 10 n ; cout << 4 12 7 5 n ; return 0; } if (n == 4 && m == 3) { cout << YES n ; cout << 10 3 9 n ; cout << 5 1 7 n ; cout << 12 6 11 n ; cout << 4 8 2 n ; return 0; } if (n == 4 && m == 4) { cout << YES n ; cout << 2 11 14 9 n ; cout << 16 6 8 1 n ; cout << 13 3 10 4 n ; cout << 7 5 12 15 n ; return 0; } if (n >= 5) { cout << YES n ; for (int i = (0); i < (2); ++i) { for (int f = i * m + 1; f <= n * m; f += 2 * m) { for (int j = (1); j < (m + 1); ++j) { int cur = f + j - 1; if ((j + 1) & 1) cur += m; if (cur > n * m) cur -= n * m; cout << cur << ; } cout << endl; } } return 0; } if (m >= 5) { cout << YES n ; for (int i = (1); i < (n + 1); ++i) { int cur = 1; for (int j = (1); j < (m + 1); ++j) { int c = cur; cur += 2; if (cur > m) cur = 2; if ((i + 1) & 1) ++c; if (c > m) c -= m; cout << (i - 1) * m + c << ; } cout << endl; } return 0; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 5; int n, k, a; int vis_time[MAX], vis_cnt[MAX], ans; struct data { int size, op; bool operator<(data b) const { if (size == b.size) return op > b.op; else return size < b.size; } }; priority_queue<data> line; int main() { scanf( %d%d , &n, &k); for (register int i = 1; i <= n; ++i) { scanf( %d , &a); line.push((data){a, 0}); } ans = 0x3f3f3f3f; while (!line.empty()) { data tmp = line.top(); line.pop(); int size = tmp.size, op = tmp.op; vis_time[size]++; vis_cnt[size] += op; if (vis_time[size] == k) { ans = min(ans, vis_cnt[size]); } if (!size) continue; else line.push((data){size / 2, op + 1}); } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long dp[100000 + 25]; struct node { int iz, der; long long tiempo; node() {} node(long long t, int i, int d) { tiempo = t; iz = i; der = d; } }; struct otro { int proct, pos; long long tiemp; otro() {} otro(int ps, long long time, int timprt) { pos = ps; tiemp = time; proct = timprt; } bool operator<(const otro& algo) const { return algo.tiemp < tiemp; } }; vector<node> v; int n, m, ini, fin; int valoreleg; char eleg; char ch[500000]; map<long long, int> mp; void f() { long long tiemp = 1; int c = 0; int pos = ini; while (true) { if (v[mp[tiemp]].iz <= pos && v[mp[tiemp]].der >= pos) { ch[c++] = X ; tiemp++; continue; } pos += valoreleg; ch[c] = eleg; if (v[mp[tiemp]].iz <= pos && v[mp[tiemp]].der >= pos) { pos -= valoreleg; ch[c] = X ; } c++; tiemp++; if (pos == fin) { for (int a = 0; a < c; a++) cout << ch[a]; cout << endl; return; } } } int main() { cin >> n >> m >> ini >> fin; int li, ri; long long tim; v.push_back(node(0, 0, 0)); for (int a = 0; a < m; a++) { cin >> tim >> li >> ri; mp[tim] = a + 1; v.push_back(node(tim, li, ri)); } if (ini < fin) { valoreleg = 1; eleg = R ; } else { valoreleg = -1; eleg = L ; } f(); }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { int a, b, n, s; cin >> a >> b >> n >> s; if (s - n * min(a, s / n) <= b) cout << YES n ; else cout << NO n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, cnt, ans; int a[410][410], c[160010]; int now, f[2][410][410]; void Init() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) scanf( %d , &a[i][j]); } inline void insert(int x) { if (c[x]) ++cnt; ++c[x]; } inline void erase(int x) { --c[x]; if (c[x]) --cnt; } void Work() { int p; for (int i = 1; i <= n; ++i) { p = 1; for (int j = 1; j <= m; ++j) { insert(a[i][j]); while (cnt) { f[0][i][p] = j - 1; erase(a[i][p]); ++p; } } while (p <= m) { f[0][i][p] = m; erase(a[i][p]); ++p; } for (int j = 1; j <= m; ++j) ans = max(ans, f[0][i][j] - j + 1); } } void Solve() { int p; for (int s = 2; s <= n; ++s) { now ^= 1; for (int i = 1; i <= n - s + 1; ++i) { int j = i + s - 1; for (int k = 1; k <= m; ++k) f[now][i][k] = min(f[now ^ 1][i][k], f[now ^ 1][i + 1][k]); p = 1; for (int k = 1; k <= m; ++k) { insert(a[i][k]); insert(a[j][k]); while (cnt) { f[now][i][p] = min(f[now][i][p], k - 1); erase(a[i][p]); erase(a[j][p]); ++p; } } while (p <= m) { f[now][i][p] = min(f[now][i][p], m); erase(a[i][p]); erase(a[j][p]); ++p; } for (int k = 1; k <= m; ++k) ans = max(ans, s * (f[now][i][k] - k + 1)); } } printf( %d n , ans); } int main() { Init(); Work(); Solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 61; int a[N], n; long long dp[N][2][2], k; long long Dfs(int pos, int x, int y) { if (pos < n - pos + 1) return 1; if (dp[pos][x][y] != -1) return dp[pos][x][y]; long long ans = 0; for (int i = 0; i < 2; i++) if (a[pos] == -1 || a[pos] == i) for (int j = 0; j < 2; j++) if (a[n - pos + 1] == -1 || a[n - pos + 1] == j) { if (x && (i > j) || y && (i > !j) || pos == n - pos + 1 && (i != j)) continue; ans += Dfs(pos - 1, x && (i == j), y && (i != j)); } return dp[pos][x][y] = ans; } int main() { scanf( %d%lld , &n, &k); k++; memset(dp, -1, sizeof(dp)); memset(a, -1, sizeof(a)); a[n] = 0; if (Dfs(n, 1, 1) < k) puts( -1 ); else { for (int i = n - 1; i > 0; i--) { a[i] = 0; memset(dp, -1, sizeof(dp)); long long num = Dfs(n, 1, 1); if (k > num) k -= num, a[i] = 1; } for (int i = n; i >= 1; i--) printf( %d , a[i]); puts( ); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j; string s1, s2; cin >> n >> s1 >> s2; if (s2 == week ) { if (n == 5 || n == 6) { cout << 53 << endl; } else { cout << 52 << endl; } } else { if (n <= 29) { cout << 12 << endl; } else if (n == 30) { cout << 11 << endl; } else if (n == 31) { cout << 7 << endl; } } }
|
#include <bits/stdc++.h> using namespace std; const int N = 200002; long long sum, ans, nd, T; priority_queue<long long> q; int n, k, b, c, t[N], i, j; int main() { scanf( %d%d%d%d , &n, &k, &b, &c), ans = 1e18; b = min(b, c * 5); for (i = 1; i <= n; i++) scanf( %d , &t[i]); sort(t + 1, t + n + 1); for (i = 0; i < 5; i++) { T = 2e9 + i; while (!q.empty()) q.pop(); sum = 0; for (j = 1; j <= n; j++) { nd = (T - t[j]) / 5 * b + (T - t[j]) % 5 * c; sum += nd; q.push(nd); if (q.size() > k) sum -= q.top(), q.pop(); if (q.size() == k) ans = min(ans, sum - (T - t[j]) / 5 * b * k); } } printf( %lld , ans); }
|
#include <bits/stdc++.h> using namespace std; int main() { long long q = 0; vector<long long> a; a.push_back(0); for (long long i = 0; i < 4; i++) { long long te; cin >> te; a.push_back(te); } string s; cin >> s; for (long long i = 0; i < s.size(); i++) { q += a[s[i] - 0 ]; } cout << q; return 0; ; }
|
#include <bits/stdc++.h> using namespace std; typedef int64_t g; g n,p[269420],v=1e9+7,T,r,i,k,s; map<g,g> l; int main(){ cin>>T; while(T--){ cin>>n; l.clear(); for(i=0,s=0,p[0]=1,l[0]=1;++i<=n;){ cin>>k; p[i]=(p[i-1]*2+v-p[l[s]-1])%v; l[s]=i; s+=k; }cout<<p[n]<<endl; } }
|
#include <bits/stdc++.h> using namespace std; int n, m, p, dp[2][110][110][110], ans; const int mod = 1e9 + 7; int main() { scanf( %d%d%d , &n, &m, &p); for (int i = 1; i <= n; i++) dp[0][i][i][1] = 1; for (int i = 0; i < m - 1; i++) { memset(dp[!(i & 1)], 0, sizeof(dp[!(i & 1)])); for (int j = 1; j <= n; j++) for (int k = 1; k <= j; k++) for (int s = 1; s <= p; s++) if (dp[i & 1][j][k][s]) { int ns = s; for (int k2 = k; k2 <= n - j; k2++) { if (k2 > k) ns *= (k2 - 1), ns /= (k2 - k); if (ns > p) break; (dp[!(i & 1)][j + k2][k2 - k][ns] += dp[i & 1][j][k][s]) %= mod; } } for (int j = 1; j <= n; j++) for (int s = 1; s <= p; s++) (ans += 1ll * (m - i - 1) * dp[!(i & 1)][j][0][s] % mod) %= mod; } return printf( %d , ans), 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, MOD = 1e9 + 7; const int n_ = 1e5 + 1000; const long double PI = acos(-1.0); long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); } long long power(long long a, long long n) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; } n >>= 1; a *= a; } return p; } long long power(long long a, long long n, long long mod) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; p %= mod; } n >>= 1; a *= a; a %= mod; } return p % mod; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, h; cin >> n >> h; int res = 0; for (int(i) = 0; (i) < (n); (i)++) { int a; cin >> a; if (a > h) res += 2; else res++; } cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; cin >> d >> h >> v >> e; d /= 2; double vol = d * d * acos(-1) * h; double incre = e * d * d * acos(-1); if (incre >= v) { cout << NO ; return 0; } double ans = vol / (v - incre); if (ans > 1e4) { cout << NO ; return 0; } cout << YES n ; cout << setprecision(15) << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n = 0, m = 0; cin >> n >> m; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (i % 2 == 0) cout << # ; else if ((j == m - 1 && (i - 1) % 4 == 0) || (j == 0 && (i + 1) % 4 == 0)) cout << # ; else cout << . ; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int co; bool query(int x, int y) { assert(++co <= 60); printf( 1 %d %d n , x, y); fflush(stdout); char st[5]; scanf( %s , st); return st[0] == N ; } int main() { int fst, scnd, n, k; scanf( %d %d , &n, &k); int l = 1, r = n; while (l < r) { int m = (l + r) / 2; if (query(m, m + 1)) l = m + 1; else r = m; } fst = l; l = 1, r = fst - 1; while (l < r) { int m = (l + r) / 2; if (query(m, m + 1)) l = m + 1; else r = m; } if (l == r && !query(l, l + 1)) { printf( 2 %d %d n , fst, l); fflush(stdout); return 0; } l = fst + 1, r = n; while (l < r) { int m = (l + r) / 2; if (query(m, m + 1)) l = m + 1; else r = m; } printf( 2 %d %d n , fst, l); fflush(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int dim = 52; char a[dim][dim]; int s[dim][dim]; int dp[dim][dim][dim][dim]; void compute(int i1, int j1, int i2, int j2) { if (dp[i1][j1][i2][j2] != 0x3f3f3f3f) return; int ans = max(i2 - i1 + 1, j2 - j1 + 1); if (s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1] == 0) { dp[i1][j1][i2][j2] = 0; return; } if (s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1] == (i2 - i1 + 1) * (j2 - j1 + 1)) { dp[i1][j1][i2][j2] = ans; return; } for (int i = i1; i < i2; ++i) { compute(i1, j1, i, j2); compute(i + 1, j1, i2, j2); ans = min(ans, dp[i1][j1][i][j2] + dp[i + 1][j1][i2][j2]); } for (int j = j1; j < j2; ++j) { compute(i1, j1, i2, j); compute(i1, j + 1, i2, j2); ans = min(ans, dp[i1][j1][i2][j] + dp[i1][j + 1][i2][j2]); } dp[i1][j1][i2][j2] = ans; } void solve() { int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i] + 1; for (int j = 1; j <= n; ++j) s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (a[i][j] == # ); } memset(dp, 0x3f, sizeof dp); compute(1, 1, n, n); cout << dp[1][1][n][n]; } int main() { cin.tie(0); ios_base::sync_with_stdio(false); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); vector<int> arrNums; int iTemp, nNeed, nNum, i; long long iSum = 0; cin >> nNum >> nNeed; while (nNum--) { cin >> iTemp; arrNums.push_back(iTemp); } sort(arrNums.begin(), arrNums.end()); for (i = 0; i < nNeed; ++i) { iSum += arrNums[i]; } cout << iSum; endapp: return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 7; const int INF = 1e9 + 7; int xx[8] = {1, 1, 1, 0, -1, -1, -1, 0}, yy[8] = {1, 0, -1, -1, -1, 0, 1, 1}; int n, m, hd = 0, ti = 0; vector<int> a[N], p[N], dis[N]; char s[N]; int Qux[N * 5], Quy[N * 5]; void bfs() { while (hd != ti) { int tx = Qux[++hd], ty = Quy[hd]; for (int j = 0; j <= 8 - 1; j++) { if (tx + xx[j] < 0 || tx + xx[j] > n + 1) continue; if (ty + yy[j] < 0 || ty + yy[j] > m + 1) continue; if (dis[tx + xx[j]][ty + yy[j]] > dis[tx][ty] + 1) { dis[tx + xx[j]][ty + yy[j]] = dis[tx][ty] + 1; Qux[++ti] = tx + xx[j]; Quy[ti] = ty + yy[j]; } } } } bool check(int x) { for (int i = 0; i <= n + 1 - 1; i++) for (int j = 0; j <= m + 1 - 1; j++) p[i][j] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (dis[i][j] >= x) { if (i - x + 1 <= 0) return 0; if (i + x - 1 > n) return 0; if (j - x + 1 <= 0) return 0; if (j + x - 1 > m) return 0; p[i - x + 1][j - x + 1]++; p[i - x + 1][j + x]--; p[i + x][j - x + 1]--; p[i + x][j + x]++; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { p[i][j] = p[i][j] + p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1]; if (!p[i][j] && a[i][j]) return 0; } } return 1; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { Qux[++ti] = 0; Quy[ti] = i; Qux[++ti] = n + 1; Quy[ti] = i; } for (int i = 0; i <= n + 2 - 1; i++) for (int j = 0; j <= m + 2 - 1; j++) dis[i].push_back(0); for (int i = 0; i <= n + 2 - 1; i++) for (int j = 0; j <= m + 2 - 1; j++) p[i].push_back(0); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); a[i].push_back(0); Qux[++ti] = i; Quy[ti] = 0; Qux[++ti] = i; Quy[ti] = m + 1; for (int j = 1; j <= m; j++) { if (s[j] == X ) { a[i].push_back(1); dis[i][j] = INF; } else { a[i].push_back(0); Qux[++ti] = i; Quy[ti] = j; } } } bfs(); int l = 1, r = (min(n, m) + 1) / 2; while (l < r - 1) { int mid = (l + r) >> 1; if (check(mid)) l = mid; else r = mid; } int ans; if (check(r)) ans = r; else ans = l; check(ans); printf( %d n , ans - 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) if (dis[i][j] >= ans) putchar( X ); else putchar( . ); puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, Bef[201000]; long long w[201000]; map<pair<int, int>, int> Map[201000]; struct Tree { int K[262144 + 262144], T[262144 + 262144]; void init() { for (int i = 0; i < 262144 + 262144; i++) K[i] = -1; } void Put2(int nd, int x) { K[nd] = T[nd] = x; } void UDT(int nd) { T[nd] = (T[nd * 2] | T[nd * 2 + 1]); } void Spread(int nd) { if (K[nd] != -1) { Put2(nd * 2, K[nd]); Put2(nd * 2 + 1, K[nd]); } K[nd] = -1; } void Put(int nd, int b, int e, int s, int l, int x) { if (s > l) return; if (s <= b && e <= l) { Put2(nd, x); return; } Spread(nd); int m = (b + e) >> 1; if (s <= m) Put(nd * 2, b, m, s, l, x); if (l > m) Put(nd * 2 + 1, m + 1, e, s, l, x); UDT(nd); } int Left(int nd, int b, int e, int s, int l) { if (!T[nd]) return l + 1; if (s > l) return l + 1; if (b == e) return b; Spread(nd); int m = (b + e) >> 1; if (s <= m) { int x = Left(nd * 2, b, m, s, l); if (x <= l) return x; } if (l > m) { return Left(nd * 2 + 1, m + 1, e, s, l); } return l + 1; } } IT; struct Range { int b, e; }; vector<Range> Save; long long Sum1(int b, int e) { return 1ll * ((n - b + 1) + (n - e + 1)) * (e - b + 1) / 2; } void Calc(int b, long long x, int e, long long y) { int i; for (i = 0; i <= e - b - 1; i++) { long long t2 = Sum1(b + 1, b + i) + x; long long t1 = Sum1(e - i, e - 1) + x; long long tp = n - e + 1; if (t1 + tp <= y && y <= t2 + tp) { Map[e][{e, e}] = b; Save.push_back({e, e}); } long long bbb = n + 1 + t1 - y + 1; long long eee = n + 1 + t2 - y + 1; bbb = max(bbb, (long long)e + 1); eee = min(eee, (long long)n + 1); if (bbb <= eee) { int b1 = bbb, e1 = eee; Map[e][{b1, e1}] = b; Save.push_back({b1, e1}); } } } void Do(int b, int e) { Save.clear(); if (IT.Left(1, 0, n + 1, b, b) == b) { Calc(b, w[b], e, w[e]); } int pp = IT.Left(1, 0, n + 1, b + 1, e - 1); if (b + 1 <= pp && pp <= e - 1) { Calc(pp, w[b] - 1, e, w[e]); } if (IT.Left(1, 0, n + 1, e, e) == e && w[e] != w[b] - 1) { IT.Put(1, 0, n + 1, e, e, 0); } if (w[b] != w[e]) { IT.Put(1, 0, n + 1, e + 1, n + 1, 0); } IT.Put(1, 0, n + 1, 0, e - 1, 0); for (auto &t : Save) { IT.Put(1, 0, n + 1, t.b, t.e, 1); } } int Res[201000]; void Print2(long long b, long long e, int c, long long s) { if (c == 0) return; long long t2 = Sum1(b + 1, b + c - 1); long long t1 = Sum1(e - c + 2, e); if (t1 <= s - (n - b + 1) && s - (n - b + 1) <= t2) { Res[b] = 1; Print2(b + 1, e, c - 1, s - (n - b + 1)); } else { Print2(b + 1, e, c, s); } } void Print(int ty, long long s1, int x, int y, long long s2) { Res[ty] = Res[y] = 1; long long ss = s2 - (n - y + 1) - s1; int i; for (i = 0; i <= x - ty - 1; i++) { long long t2 = Sum1(ty + 1, ty + i); long long t1 = Sum1(x - i, x - 1); if (t1 <= ss && ss <= t2) { Print2(ty + 1, x - 1, i, ss); return; } } } int RR[101000]; long long Res2[101000]; int main() { int i, DEB = 0; scanf( %d , &n); mt19937 rng((unsigned)time(NULL)); if (DEB) { long long ss = 0; for (i = 1; i <= n + 1; i++) { RR[i] = !!(rng() % 5); if (i == n + 1) RR[i] = 1; if (RR[i]) { ss += (n - i + 1); Res2[i] = ss; } } for (i = 1; i <= n; i++) printf( %d , RR[i]); puts( ); long long z = Res2[n + 1]; for (i = n; i >= 1; i--) { if (Res2[i]) z = Res2[i]; else Res2[i] = z + 1; } } int ck = 0; for (i = 1; i <= n; i++) { if (!DEB) { scanf( %lld , &w[i]); } if (DEB) { if (rng() % 3 == 0) { w[i] = Res2[i]; } printf( %lld , w[i]); } if (w[i] != 0 && w[i] != 1) ck = 1; } if (!ck) { for (i = 1; i <= n; i++) printf( 0 ); puts( ); return 0; } IT.Put(1, 0, n + 1, 0, 0, 1); int prv = 0; for (i = 1; i <= n; i++) { if (!w[i]) continue; Do(prv, i); Bef[i] = prv; prv = i; } int x = prv, y = IT.Left(1, 0, n + 1, 0, n + 1); while (x) { for (auto &t : Map[x]) { pair<int, int> tp = t.first; if (tp.first <= y && y <= tp.second) { int ty = t.second; long long s1 = w[Bef[x]], s2 = w[x]; if (ty != Bef[x]) { s1--; } if (y != x) { s2--; } Print(ty, s1, x, y, s2); y = ty; break; } } x = Bef[x]; } for (i = 1; i <= n; i++) printf( %d , Res[i]); puts( ); }
|
#include <bits/stdc++.h> using namespace std; const int N = 10010, M = 15010, inf = 1e9; struct st1 { int to, next, c; } e[M << 1]; struct st2 { int to, next, f, op; } F[1000001]; int n, m, x, y, z, cnt, cnt2, ans, i, col, cyc, S, T, fi[N], c[N], l[N], op[M << 1], d[N + M], f2[N + M], dep[N + M], num[N + M]; bool vis[N], u[M << 1]; void addl(int x, int y, int z) { e[++cnt].to = y, e[cnt].next = fi[x], e[cnt].c = z, fi[x] = cnt; } void addf(int x, int y, int f) { F[++cnt2].to = y, F[cnt2].next = f2[x], F[cnt2].f = f, F[cnt2].op = cnt2 + 1, f2[x] = cnt2; F[++cnt2].to = x, F[cnt2].next = f2[y], F[cnt2].f = 0, F[cnt2].op = cnt2 - 1, f2[y] = cnt2; } void dfs(int x, int fa, int d) { vis[x] = 1; for (int i = fi[x]; i; i = e[i].next) if (!u[i] && e[i].to != fa) { int y = e[i].to; if (vis[y]) { cyc++, u[i] = u[op[i]] = 1; addf(S, cyc, dep[x] - dep[y]); for (int j = dep[y] + 1; j <= dep[x]; j++) u[l[j]] = u[op[l[j]]] = 1, addf(cyc, c[j] + 1, 1); addf(cyc, e[i].c + 1, 1); } else { c[dep[y] = d + 1] = e[i].c, l[d + 1] = i, dfs(y, x, d + 1); if (!u[i]) addf(S, ++cyc, 1), addf(cyc, e[i].c + 1, 1); } } } int sap(int x, int del) { if (x == T) return del; int sum = 0, md = cyc + 1; for (int i = f2[x]; i; i = F[i].next) if (F[i].f) { if (d[F[i].to] == d[x] - 1) { int save = sap(F[i].to, min(F[i].f, del - sum)); sum += save, F[i].f -= save, F[F[i].op].f += save; if (d[S] >= cyc + 1 || sum == del) return sum; } md = min(md, d[F[i].to]); } if (!sum) { if (!(--num[d[x]])) d[S] = cyc + 1; else num[d[x] = md + 1]++; } return sum; } int main() { scanf( %d%d n , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d%d n , &x, &y, &z); addl(x, y, z), addl(y, x, z); col = max(col, z); } for (i = 1; i <= cnt; i += 2) op[op[i] = i + 1] = i; S = 0, T = 1, cyc = 1 + col; for (i = 1; i <= col; i++) addf(i + 1, T, 1); dfs(1, 0, 0); num[0] = cyc + 1; for (; d[S] <= cyc;) ans += sap(S, inf); printf( %d , ans); }
|
#include <bits/stdc++.h> using namespace std; int N, M, M2, B; const int MAXN = 100015; const int MAXM = 20; const int MAXM2 = (1 << 20); char S[MAXN]; int bitc[MAXM2]; int bitl[MAXM2]; int dp[MAXM2]; int cnt[MAXM][MAXM]; int mcnt[MAXM2][MAXM]; int last; int main() { cin >> N >> M >> S; M2 = (1 << M); B = M2 - 1; for (int i = 0; i < M; ++i) for (int j = 0; j < M; ++j) cnt[i][j] = 0; bitc[0] = 0; bitl[0] = 0; dp[0] = 0; for (int j = 0; j < M; ++j) mcnt[0][j] = 0; for (int i = 1; i < M2; ++i) { int b = i & (i - 1); bitc[i] = bitc[b] + 1; for (int j = 0; j < M; ++j) if ((1 << j) & i) { bitl[i] = j; break; } for (int j = 0; j < M; ++j) mcnt[i][j] = 0; dp[i] = 1e9; } for (int i = 0; i < N - 1; ++i) { if (S[i] == S[i + 1]) continue; ++cnt[S[i] - a ][S[i + 1] - a ]; ++cnt[S[i + 1] - a ][S[i] - a ]; } for (int i = 1; i < M2; ++i) for (int j = 0; j < M; ++j) mcnt[i][j] = mcnt[i & (i - 1)][j] + cnt[bitl[i]][j]; for (int i = 0; i < M2; ++i) for (int j = 0; j < M; ++j) { if (((1 << j) & i) == 0) dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + bitc[i] * (mcnt[i][j] - mcnt[B ^ i][j])); } cout << dp[B] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int a[10005]; int num[10005]; int main() { int n; scanf( %d , &n); int mm = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); num[a[i]]++; mm = max(mm, a[i]); } int nn = 0; for (int i = 1; i <= mm; i++) { if (mm % i == 0) num[i]--; } for (int i = 10000; i >= 1; i--) { if (num[i] > 0) { nn = i; break; } } printf( %d %d n , mm, nn); return 0; }
|
#include <bits/stdc++.h> using namespace std; namespace fastIO { bool IOerror = 0; inline char nc() { static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000; if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, 100000, stdin); if (pend == p1) { IOerror = 1; return -1; } } return *p1++; } inline bool blank(char ch) { return ch == || ch == n || ch == r || ch == t ; } inline void read(long long &x) { char ch; long long f = 1; while (blank(ch = nc())) ; while (ch == - ) f = -f, ch = nc(); if (IOerror) return; for (x = ch - 0 ; (ch = nc()) >= 0 && ch <= 9 ; x = x * 10 + ch - 0 ) ; x *= f; } inline void read(int &x) { char ch; int f = 1; while (blank(ch = nc())) ; while (ch == - ) f = -f, ch = nc(); if (IOerror) return; for (x = ch - 0 ; (ch = nc()) >= 0 && ch <= 9 ; x = x * 10 + ch - 0 ) ; x *= f; } inline void read(char *s) { char ch; while (blank(ch = nc())) ; if (IOerror) return; int i = 0; for (; !blank(ch); s[i++] = ch, ch = nc()) ; s[i] = 0 ; } }; // namespace fastIO using namespace fastIO; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n; int p[300010]; int c[500010]; int ans[300010]; class Treap { public: struct treap_point { int l, r, x, rep, son, rnd; } t[500010]; int treesz, root; inline void update(int k) { t[k].son = t[t[k].l].son + t[t[k].r].son + t[k].rep; } inline void right_rotate(int &k) { int tt = t[k].l; t[k].l = t[tt].r; t[tt].r = k; update(k); update(tt); k = tt; } inline void left_rotate(int &k) { int tt = t[k].r; t[k].r = t[tt].l; t[tt].l = k; update(k); update(tt); k = tt; } inline void insert_to_tree(int &k, int x) { if (!k) { k = ++treesz; t[k].x = x; t[k].rnd = rand(); t[k].son = t[k].rep = 1; t[k].l = t[k].r = 0; return; } t[k].son++; if (x == t[k].x) { t[k].rep++; return; } if (x < t[k].x) { insert_to_tree(t[k].l, x); if (t[t[k].l].rnd < t[k].rnd) right_rotate(k); } if (x > t[k].x) { insert_to_tree(t[k].r, x); if (t[t[k].r].rnd < t[k].rnd) left_rotate(k); } } inline bool delete_from_tree(int &k, int x) { if (!k) return 0; if (x == t[k].x) { if (t[k].rep > 1) { t[k].rep--; t[k].son--; return 1; } if (!t[k].l || !t[k].r) { k = t[k].l + t[k].r; return 1; } if (t[t[k].l].rnd < t[t[k].r].rnd) { right_rotate(k); return delete_from_tree(k, x); } left_rotate(k); return delete_from_tree(k, x); } int res; if (x < t[k].x) { res = delete_from_tree(t[k].l, x); if (res) t[k].son--; return res; } res = delete_from_tree(t[k].r, x); if (res) t[k].son--; return res; } inline int get_succ_in_tree(int k, int x) { if (!k) return -1; int sv; if (x < t[k].x) { sv = get_succ_in_tree(t[k].l, x); return sv == -1 ? t[k].x : sv; } return get_succ_in_tree(t[k].r, x); } inline int get_pred_in_tree(int k, int x) { if (!k) return -1; int sv; if (x > t[k].x) { sv = get_pred_in_tree(t[k].r, x); return sv == -1 ? t[k].x : sv; } return get_pred_in_tree(t[k].l, x); } inline int ask_kth_in_tree(int k, int x) { if (!k) return -1; if (x <= t[t[k].l].son) return ask_kth_in_tree(t[k].l, x); if (x > t[t[k].l].son + t[k].rep) return ask_kth_in_tree(t[k].r, x - t[t[k].l].son - t[k].rep); return t[k].x; } inline int ask_rank_in_tree(int k, int x) { if (!k) return -1; if (x == t[k].x) return t[t[k].l].son + 1; if (x < t[k].x) return ask_rank_in_tree(t[k].l, x); return t[t[k].l].son + t[k].rep + ask_rank_in_tree(t[k].r, x); } inline void init() { treesz = root = 0; } inline void insert(int x) { insert_to_tree(root, x); } inline int del(int x) { return delete_from_tree(root, x); } inline int succ(int x) { return get_succ_in_tree(root, x); } inline int pred(int x) { return get_pred_in_tree(root, x); } inline int ask_kth(int x) { return ask_kth_in_tree(root, x); } inline int ask_rank(int x) { return ask_rank_in_tree(root, x); } } T; int main() { srand(time(0)); n = read(); for (int i = 1; i <= n; i++) T.insert(i); ans[1] = 1; for (int i = 1; i <= n; i++) { p[i] = read(); T.del(p[i]); ans[i + 1] = max(0, (T.ask_kth(n - i) - n + i)) + 1; } for (int i = 1; i <= n + 1; i++) printf( %d , ans[i]); }
|
#include <bits/stdc++.h> using namespace std; void solve() { int m, k; scanf( %d %d , &m, &k); vector<int> a(k, 0); vector<int> t(m - 1), r(m - 1, 0); vector<int> last(k, 0); for (int i = 0; i < k; ++i) { scanf( %d , &a[i]); } int free_num = 0; for (int i = 0; i + 1 < m; ++i) { scanf( %d %d , &t[i], &r[i]); if (t[i] > 0) { last[t[i] - 1] = i; } } int first_upset_id = -1; int before_upset_num = 0; for (int i = 0; i + 1 < m; ++i) { if (r[i] == 1) { first_upset_id = i; break; } else if (t[i] == 0) { ++before_upset_num; } } for (int i = 0; i + 1 < m; ++i) { if (t[i] == 0) { ++free_num; } else { --a[t[i] - 1]; } } if (first_upset_id >= 0) { int min_id = -1; for (int i = 0; i < k; ++i) { if ((last[i] < first_upset_id) && ((min_id == -1) || (a[min_id] > a[i]))) { min_id = i; } } free_num -= a[min_id]; } for (int i = 0; i < k; ++i) { if ((a[i] <= free_num) || ((last[i] < first_upset_id) && (a[i] <= before_upset_num))) { printf( Y ); } else { printf( N ); } } printf( n ); } int main() { int t; scanf( %d , &t); while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct om_nom { int t; int h; int m; } a[2005]; int n, x; bool eaten[2005]; bool have_candy(int type) { int flag = false; for (int i = 0; i < n; ++i) if (a[i].t == (bool)type && !eaten[i]) { flag = true; break; } return flag; } int solve(int cur, int H) { int cnt = 0; for (int i = 0; i < n; ++i) { eaten[i] = false; } while (have_candy(cur)) { int mm = -1, it = -1; for (int i = 0; i < n; ++i) if (a[i].t == cur && a[i].m > mm && a[i].h <= H && !eaten[i]) { it = i; mm = a[i].m; } if (it != -1) { H += a[it].m; cur ^= 1; eaten[it] = true; } else break; cnt++; } return cnt; } int main() { cin >> n >> x; for (int i = 0; i < n; ++i) { cin >> a[i].t >> a[i].h >> a[i].m; } cout << max(solve(0, x), solve(1, x)) << endl; return 0; }
|
#include <bits/stdc++.h> inline int read() { int f = 1, x = 0; char ch = getchar(); while (!(ch >= 0 && ch <= 9 )) { if (ch == - ) f *= -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return f * x; } int dx[8] = {1, 1, -1, -1, 2, 2, -2, -2}; int dy[8] = {2, -2, 2, -2, 1, -1, 1, -1}; struct Point { int x, y, c, fa; friend bool operator==(Point a, Point b) { return (a.x == b.x && a.y == b.y); } } w[2], b[2], list[4][1000 * 1000 + 1]; int otherx, othery; void printlist(int k, Point a) { if (a.fa == -1) return; if (a.fa != 1) printlist(k, list[k][a.fa]); printf( %d %d n , a.x, a.y); } int n, m, head, tail, v[4][1000 + 1][1000 + 1]; void closer(int k, Point st, Point ed) { Point a, b; head = tail = 1; memset(v[k], 0, sizeof(v[k])); v[k][st.x][st.y] = head; list[k][head] = st, list[k][head].c = 0, list[k][head].fa = -1; if (st == ed) return; while (head <= tail) { a = list[k][head]; for (int i = 0; i < 8; i++) { b = a, b.x += dx[i], b.y += dy[i], b.c++; if (b.x < 1 || b.y < 1 || b.x > n || b.y > m || v[k][b.x][b.y] != 0) continue; tail++; v[k][b.x][b.y] = tail; b.fa = head; list[k][tail] = b; if (b == ed) return; } head++; } } void printlast(int k) { if (k == 0) { printf( %d %d n , b[0].x - 1, b[0].y + 2); printf( %d %d n , b[0].x - 3, b[0].y + 1); printf( %d %d n , b[0].x - 1, b[0].y); } else { printf( %d %d n , w[0].x + 1, w[0].y + 2); printf( %d %d n , w[0].x + 3, w[0].y + 1); printf( %d %d n , w[0].x + 1, w[0].y); } } bool choose; int main() { n = read(), m = read(), w[1].x = read(), w[1].y = read(), b[1].x = read(), b[1].y = read(); w[0].x = n / 2, w[0].y = m / 2, b[0].x = n / 2 + 1, b[0].y = m / 2; closer(0, w[1], w[0]), closer(1, b[1], b[0]); closer(2, w[1], b[0]); closer(3, b[1], w[0]); if ((w[1].x + w[1].y) % 2 != (b[1].x + b[1].y) % 2) { if (list[0][v[0][w[0].x][w[0].y]].c <= list[1][v[1][b[0].x][b[0].y]].c) printf( WHITE n ), printlist(0, list[0][v[0][w[0].x][w[0].y]]); else if (list[2][v[2][b[0].x][b[0].y]].c >= list[1][v[1][b[0].x][b[0].y]].c + 2) printf( BLACK n ), printlist(1, list[1][v[1][b[0].x][b[0].y]]); else printf( WHITE n ), printlist(2, list[2][v[2][b[0].x][b[0].y]]), printlast(0); } else { if (list[1][v[1][b[0].x][b[0].y]].c < list[0][v[0][w[0].x][w[0].y]].c) printf( BLACK n ), printlist(1, list[1][v[1][b[0].x][b[0].y]]); else if (list[3][v[3][w[0].x][w[0].y]].c > list[0][v[0][w[0].x][w[0].y]].c) printf( WHITE n ), printlist(0, list[0][v[0][w[0].x][w[0].y]]); else printf( BLACK n ), printlist(3, list[3][v[3][w[0].x][w[0].y]]), printlast(1); } fflush(stdout); }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4 ) using namespace std; const int inf = (int)2e9 + 99999, mod = (int)1e9 + 7; const long long linf = (long long)2e18 + 99999; int kob(int x, int y) { return ((long long)x * y) % mod; } int aza(int x, int y) { x -= y; if (x < 0) return x + mod; return x; } int kos(int x, int y) { x += y; if (x >= mod) return x - mod; return x; } const int maxn = (int)1e5 + 777, maxn2 = (int)1e6 + 55; int main() { int a1, a2, a3, a4; cin >> a1 >> a2 >> a3 >> a4; int a11 = a1, a22 = a2, a33 = a3, a44 = a4; a1 -= a3; a2 -= a3; bool bad = false; if (a3 <= a4) bad = 1, --a1; if (a3 < a4) --a2; if (abs(a3 - a4) >= 2 || a1 < 0 || a2 < 0) { if (a33 == a44 && a11 < a22) { a11 -= a33; a22 -= a33; a22--; if (a11 < 0 || a22 < 0) { cout << -1; exit(0); } for (int i = 1; i <= a33; ++i) cout << 74 ; for (int i = 1; i <= a11; ++i) cout << 4; cout << 7; for (int i = 1; i <= a22; ++i) cout << 7; exit(0); } cout << -1 , exit(0); } if (a3 < a4) cout << 7 ; for (int i = 1; i <= a1; ++i) cout << 4 ; for (int i = 1; i <= a3; ++i) cout << 47 ; for (int i = 1; i <= a2; ++i) cout << 7 ; if (bad) cout << 4 ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int SQRTN = 320; const int LOGN = 20; const double PI = acos(-1); int n, val; map<int, int> dp; int dp2[N]; int range[N]; bool en[N]; int grundy(long long n) { if (n < 1e6) return dp2[n]; if (dp.find(n) != dp.end()) return dp[n]; int& mex = dp[n]; int st = 0; double e = sqrt(n); double s = sqrt(e); int i = ceil(s), _ = floor(e); while (i < n && i <= _) { i = range[i]; st = st | (1 << grundy(i)); i++; } while (st & (1 << mex)) mex++; return mex; } int calc(int n) { int& mex = dp2[n]; int st = 0; double e = sqrt(n); double s = sqrt(e); for (int i = ceil(s), _ = floor(e); i < n && i <= _; i++) { st = st | (1 << dp2[i]); } while (st & (1 << mex)) mex++; return mex; } int main() { for (int i = 0; i < 1000000; i++) { calc(i); } range[999999] = 999999; en[999999] = 1; for (int i = 999998; i > -1; i--) { if (dp2[i] != dp2[i + 1]) range[i] = i, en[i] = 1; else range[i] = range[i + 1]; } cin >> n; long long a; for (int i = 0; i < n; i++) { scanf( %lld , &a); val = val ^ grundy(a); } cout << (val ? Furlo : Rublo ) << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, s, c[10000]; cin >> n >> a >> b; for (int i = 1; i <= n; i++) { cin >> c[i]; } s = 0; for (int i = 1; i <= n / 2; i++) { if (c[i] != 2 && c[n - i + 1] != 2 && c[i] != c[n - i + 1]) { cout << -1 << endl; return 0; } else if (c[i] == c[n - i + 1] && c[i] == 2) { s += 2 * min(a, b); } else if (c[i] == 2 && c[n - i + 1] != 2) { if (c[n - i + 1] == 0) s += a; else s += b; } else if (c[i] != 2 && c[n - i + 1] == 2) { if (c[i] == 0) s += a; else s += b; } } if (n % 2 == 1 && c[n / 2 + 1] == 2) s += min(a, b); cout << s << endl; }
|
#include <bits/stdc++.h> using namespace std; long long cross2(long long x1, long long y1, long long x2, long long y2) { return x1 * y2 - x2 * y1; } long long cross(long long i, long long j, long long k, const long long* xx, const long long* yy) { return cross2(xx[j] - xx[i], yy[j] - yy[i], xx[k] - xx[i], yy[k] - yy[i]); } int main() { int n; cin >> n; auto* xx = new long long[n]; auto* yy = new long long[n]; for (int i = 0; i < n; i++) { cin >> xx[i]; cin >> yy[i]; } bool flip = xx[0] < xx[1]; long long x = xx[1], y = yy[1]; for (int i = 0; i < n; i++) { xx[i] -= x; yy[i] -= y; if (flip) { xx[i] = -xx[i]; yy[i] = -yy[i]; } } long long left = 0, right = xx[0]; for (int i = 2; i + 1 < n; i++) { long long cright = cross(i, i + 1, 0, xx, yy); long long cleft = cross(i, i + 1, 1, xx, yy); if (cright > 0 && cleft > 0) { cout << 0; return 0; } long long x0 = xx[i], y0 = yy[i], x1 = xx[i + 1], y1 = yy[i + 1]; if (cright > 0 || cleft > 0) { long long p = x0 * (y1 - y0) - y0 * (x1 - x0); long long q = y1 - y0; if (q < 0) { p = -p; q = -q; } if (cright > 0) right = min(right, (p / q)); else left = max(left, ((p + q - 1) / q)); } } cout << (left <= right ? right - left + 1 : 0) << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000010; bitset<N> b; int p[N]; int cnt[N]; bool was[N]; int main() { int n, k; scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , p + i); p[i]--; was[i] = false; } for (int i = 1; i <= n; i++) { cnt[i] = 0; } int c1 = 0, c2 = 0; for (int i = 0; i < n; i++) { if (was[i]) { continue; } int x = i; int len = 0; while (!was[x]) { was[x] = true; x = p[x]; len++; } c1 += len % 2; c2 += len / 2; cnt[len]++; } b.set(0); for (int i = 1; i <= n; i++) { if (cnt[i] == 0) { continue; } int j = 1; while (cnt[i] > 0) { j = min(j, cnt[i]); int u = i * j; b |= (b << u); cnt[i] -= j; j *= 2; } } int ans_min = k; if (!b.test(k)) { ans_min++; } int ans_max = 0; ans_max += 2 * min(k, c2); k -= min(k, c2); ans_max += min(k, c1); printf( %d %d n , ans_min, ans_max); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, h; int bb[109][109][109]; int a[109], b[109], c[109][109]; int main() { scanf( %d%d%d , &n, &m, &h); for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= h; k++) { bb[i][j][k] = 1; } } } for (int i = 1; i <= m; i++) { scanf( %d , &a[i]); for (int j = 1; j <= n; j++) { for (int k = a[i] + 1; k <= h; k++) { bb[i][j][k] = 0; } } } for (int j = 1; j <= n; j++) { scanf( %d , &b[j]); for (int i = 1; i <= m; i++) { for (int k = b[j] + 1; k <= h; k++) { bb[i][j][k] = 0; } } } for (int j = 1; j <= n; j++) { for (int i = 1; i <= m; i++) { scanf( %d , &c[i][j]); if (c[i][j] == 0) { for (int k = 1; k <= h; k++) bb[i][j][k] = 0; } } } for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { for (int k = 2; k <= h; k++) { if (bb[i][j][k]) bb[i][j][1]++; } } } for (int j = 1; j <= n; j++) { for (int i = 1; i <= m; i++) { printf( %d , bb[i][j][1]); } printf( n ); } }
|
#include <bits/stdc++.h> using namespace std; long long a[100001], first, space, op = 1, last; int main() { long long k, n, page; cin >> k >> n >> page; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (n == 0) { cout << 0; return 0; } first = (a[1] - space) / page; if ((a[1] - space) % page) first++; for (int i = 1; i <= n; i++) { long long pg_now = (a[i] - space) / page; if ((a[i] - space) % page) pg_now++; if (pg_now == first) last++; else { space = last; first = (a[i] - space) / page; if ((a[i] - space) % page) first++; last++; op++; } } cout << op; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int md = 1000000007; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int tt{}, T{}; tt = 1; while (tt--) { int n{}, m{}, ans{}, k{}, a{}, b{}, c{}, f{}; cin >> n; if (n == 1) { cout << 1 n ; return 0; } if (n == 2) { cout << 2 1 n ; return 0; } a = sqrt(n); b = n - a * a; for (int j = 0; j < b; ++j) { for (int i = n + 1 - j * (a + 1) - a - 1; i < n + 1 - j * (a + 1); ++i) { if (i > 0) cout << i << ; } } if (b > 0) n = n - (b) * (a + 1); for (int i = 0; i < a - b; ++i) { for (int j = n + 1 - i * a - a; j < n + 1 - i * a; ++j) { if (j > 0) cout << j << ; } } cout << n ; } return 0; }
|
#include <bits/stdc++.h> int n; char a[1000005], b[1000005], dic[130]; int main() { dic[ W ] = E ; dic[ E ] = W ; dic[ N ] = S ; dic[ S ] = N ; scanf( %d%s%s , &n, a, b); unsigned int ha = 0, hb = 0, rol = 1, mul = 233; for (int i = n - 2; i >= 0; i--) { if ((ha = a[i] * rol + ha) == (hb = dic[b[i]] + hb * mul)) { puts( NO ); return 0; } rol *= mul; } puts( YES ); }
|
#include <bits/stdc++.h> using namespace std; using T = int; struct Edge { int from, to; T cost, flow, cap; Edge(int _from = 0, int _to = 0, T _cost = 0, T _cap = 0) : from(_from), to(_to), cost(_cost), flow(0), cap(_cap) {} }; const int N = 7010; const int INF = 0x3f3f3f3f; int n; vector<Edge> edges; vector<int> g[N]; int par[N]; int dist[N]; int pi[N]; void addEdge(int from, int to, T cost, T cap) { g[from].push_back(edges.size()); edges.emplace_back(from, to, cost, cap); g[to].push_back(edges.size()); edges.emplace_back(to, from, -cost, 0); } bool dijkstra(int s, int t) { for (int i = 0; i <= t; ++i) { dist[i] = INF; par[i] = -1; } priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq; dist[s] = 0; pq.push({0, s}); while (!pq.empty()) { auto on = pq.top(); pq.pop(); int chosen = on.second; int d = on.first; if (d > dist[chosen]) continue; for (int edge_id : g[chosen]) { int to = edges[edge_id].to; int cost = edges[edge_id].cost; T flowing = edges[edge_id].flow; T cap = edges[edge_id].cap; if (cap <= flowing) continue; if (dist[to] > dist[chosen] + pi[chosen] - pi[to] + cost) { dist[to] = dist[chosen] + pi[chosen] - pi[to] + cost; par[to] = edge_id; pq.push({dist[to], to}); } } } return dist[t] != INF; } int mcmf(int s, int t) { memset(pi, 0, sizeof pi); int cost = 0, max_flow = 0; while (dijkstra(s, t)) { for (int i = 0; i <= t; ++i) { pi[i] += dist[i]; } int cur = t, flow = (1 << 30); for (int cur = t; par[cur] != -1; cur = edges[par[cur]].from) { flow = min(flow, edges[par[cur]].cap - edges[par[cur]].flow); } for (int cur = t; par[cur] != -1; cur = edges[par[cur]].from) { cost += edges[par[cur]].cost * flow; edges[par[cur]].flow += flow; edges[par[cur] ^ 1].flow -= flow; } max_flow += flow; } return cost; } int main() { scanf( %d , &n); vector<int> a(n); addEdge(0, 1, 0, 4); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int i = 0; i < n; ++i) { addEdge(1, i + 2, 0, 1); addEdge(i + 2, n + i + 2, -1, 1); addEdge(n + i + 2, 2 * n + 2, 0, 1); for (int j = i + 1; j < n; ++j) { if (abs(a[i] - a[j]) == 1 or a[i] % 7 == a[j] % 7) { addEdge(n + i + 2, j + 2, 0, 1); } } } printf( %d n , -1 * mcmf(0, 2 * n + 2)); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 200100; const long long INF = 2000000100; const long long MOD = 998244353; long long N, S[MAXN], P[MAXN]; long long B[MAXN]; void update(int ind, long long v) { for (int i = ind; i <= N; i += (i & -i)) { B[i] += v; } } long long query(int ind) { if (ind == 0) return 0; long long s = 0; for (int i = ind; i > 0; i -= (i & -i)) { s += B[i]; } return s; } int main() { ios_base::sync_with_stdio(0); cin >> N; for (int i = 0; i < N; i++) cin >> S[i]; for (int i = 1; i <= N; i++) update(i, i); for (int i = N - 1; i >= 0; i--) { long long a = 1, b = N, c; long long ans = -39; while (a <= b) { c = (a + b) / 2; if (query(c - 1) > S[i]) { b = c - 1; } else { ans = c; a = c + 1; } } P[i] = ans; update(ans, -ans); } for (int i = 0; i < N; i++) cout << P[i] << (i == N - 1 ? n : ); }
|
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> b >> a; a--; b -= a; if (b >= 0 && b % 2 == 0 && a > 0) { cout << Yes << endl; } else if (b == 0 && a == 0) cout << Yes << endl; else cout << No << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = 3.141592653589793238463; int a[100009], p[200009]; int main() { cin.tie(0); cin.sync_with_stdio(0); int h; cin >> h; for (int i = (0); i <= (h); i++) cin >> a[i]; bool perfect = true; for (int i = 0; i < (h); i++) if (a[i] > 1 && a[i + 1] > 1) perfect = false; if (perfect) { cout << perfect << n ; return 0; } cout << ambiguous << n ; int idx = 1; p[0] = 0; for (int i = (0); i <= (h); i++) { p[i + 1] = idx; for (int j = (0); j < (a[i]); j++) cout << p[i] << ; idx += a[i]; } cout << n ; idx = 1; p[0] = 0; for (int i = (0); i <= (h); i++) { p[i + 1] = idx; if (i > 0 && a[i] > 1 && a[i - 1] > 1) { cout << p[i] << ; for (int j = (0); j < (a[i] - 1); j++) cout << p[i] + 1 << ; } else for (int j = (0); j < (a[i]); j++) cout << p[i] << ; idx += a[i]; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int f(char c1, char c2) { if (c1 == R && c2 == S ) return 1; if (c1 == S && c2 == P ) return 1; if (c1 == P && c2 == R ) return 1; if (c2 == R && c1 == S ) return -1; if (c2 == S && c1 == P ) return -1; if (c2 == P && c1 == R ) return -1; return 0; } int main() { int n, j1 = 0, j2 = 0, i, r1 = 0, r2 = 0, t; char s1[1500], s2[1500]; cin >> n >> s1 >> s2; for (i = 0; i < n; ++i) { t = f(s1[j1], s2[j2]); if (t == 1) ++r2; if (t == -1) ++r1; ++j1; if (!s1[j1]) j1 = 0; ++j2; if (!s2[j2]) j2 = 0; if (j1 == 0 && j2 == 0) { r1 *= n / (i + 1); r2 *= n / (i + 1); n %= (i + 1); i = -1; } } cout << r1 << << r2; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 2; const int M = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; vector<int> pre(n, 1); for (int i = 1; i < n; i++) { if (v[i] <= v[i - 1] * 2) pre[i] = pre[i - 1] + 1; } cout << *max_element(pre.begin(), pre.end()); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { float a, b, c, d; float mpts; float vpts; cin >> a >> b >> c >> d; mpts = max((3 * a) / 10, a - ((a / 250) * c)); vpts = max((3 * b) / 10, b - ((b / 250) * d)); if (mpts == vpts) { cout << Tie n ; return 0; } mpts > vpts ? cout << Misha n : cout << Vasya n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e3 + 10; const int oo = 1e9; vector<int> g[N], gt[N]; vector<pair<int, int> > b[N], bt[N]; int cost[N][N]; void bfs(int u, int n, vector<int> adj[], vector<pair<int, int> > &b, bool q) { queue<int> Q; vector<int> d(n + 1, oo); d[u] = 0; Q.push(u); while (!Q.empty()) { int cur = Q.front(); Q.pop(); for (auto v : adj[cur]) { int dist = d[cur] + 1; if (dist >= d[v]) continue; d[v] = dist; Q.push(v); if (q) cost[u][v] = dist; } } for (int i = 1; i <= n; i++) b.push_back({d[i], i}); sort(b.begin(), b.end()); while (!b.empty() && b.back().first >= oo) b.pop_back(); reverse(b.begin(), b.end()); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i <= n; i++) { for (int j = 0; j <= n; j++) cost[i][j] = oo; cost[i][i] = 0; } for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); gt[v].push_back(u); } for (int i = 1; i <= n; i++) { bfs(i, n, g, b[i], 1); bfs(i, n, gt, bt[i], 0); } vector<int> ans; int best = -1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; for (int k = 0; k < min(3, (int)bt[i].size()); k++) { for (int l = 0; l < min(3, (int)b[j].size()); l++) { int u = bt[i][k].second, du = bt[i][k].first; int v = b[j][l].second, dv = b[j][l].first; int cur_ans = du + cost[i][j] + dv; if (cur_ans >= oo || cur_ans <= best) continue; set<int> S = {u, i, j, v}; if (S.size() < 4) continue; best = cur_ans; ans = {u, i, j, v}; } } } } for (auto x : ans) cout << x << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; bool isprime(long long n) { if (n < 2) return false; if (n == 2) return true; if (n % 2 == 0) return false; for (int i = 3; i * i <= n; i = i + 2) { if (n % i == 0) return false; } return true; } int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int temp = -1, cnt = 0; for (int i = 0; i < n; i++) { if (temp != a[i] && a[i] != 0) { cnt++; temp = a[i]; } } cout << cnt; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; cout << (b * d * f > a * c * e || c == 0 && d > 0 || a == 0 && b > 0 && d > 0 ? Ron : Hermione ) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int m, n, z, n1, m1; int a[10000], b[10000]; int g, j, k, p = 0; int count = 0; cin >> n >> m >> z; n1 = n; m1 = m; if (z <= 10000 && z > 0 && n >= 1 && m >= 1) { while (n <= z || m <= z) { a[j] = n; n = n + n1; j++; b[g] = m; m = m + m1; g++; } for (k = 0; k < j; k++) { for (p = 0; p < g; p++) { if (a[k] == b[p]) { count++; } } } cout << count; return 0; } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; int n; cin >> n; int a[n]; int ans = 0, sum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; ans += a[i]; } sum = ans; sort(a, a + n); for (int j = n - 1; j >= 1; j--) { for (int x = 2; x < a[j]; x++) { if (a[j] % x != 0) continue; ans = min(ans, sum - a[j] - a[0] + a[j] / x + a[0] * x); } } cout << ans << endl; cerr << Time : << (double)clock() / (double)CLOCKS_PER_SEC << s << n ; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.