func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 22; int n, mn = N + 1, q; int par[N], ans[N]; bool mark[N]; vector<int> G[N]; void dfs(int v, int p, int rr) { rr = min(rr, v); ans[v] = rr; par[v] = p; for (int i = 0; i < (G[v].size()); i++) { int u = G[v][i]; if (u == p) continue; dfs(u, v, rr); } } int main() { cin >> n >> q; for (int i = 0; i < (n - 1); i++) { int u, v; scanf( %d%d , &u, &v); u--, v--; G[u].push_back(v), G[v].push_back(u); } q--; int x, tp, last = -1; cin >> tp >> x; x = (x + last + 1) % n; mark[x] = true; dfs(x, -1, x); for (int Q = 0; Q < (q); Q++) { scanf( %d%d , &tp, &x); x = (x + last + 1) % n; if (tp == 1) { while (!mark[x]) { mark[x] = true; mn = min(mn, x); x = par[x]; } } else { printf( %d n , min(ans[x], mn) + 1); last = min(ans[x], mn); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; t = 1; while (t--) { int n, k; cin >> n >> k; string s; cin >> s; int b[26] = {0}; for (int i = 0; i < n; i++) { b[s[i] - A ]++; } int mn = INT_MAX; for (int i = 0; i < k; i++) { mn = min(mn, (b[i])); } cout << mn * k; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, u, r; int a[30], b[30], p[30], k[30]; long long res; bool first; void doit(int v[]) { long long tmp = 0; for (int i = 0; i < n; i++) { tmp += v[i] * k[i]; } res = max(res, tmp); if (first) { first = false; res = tmp; } } void dfs(int v[], int _u, bool can) { int next[30]; if (_u % 2 == 0) { doit(v); } if (_u == 0) { return; } if (can) { for (int i = 0; i < n; i++) { next[i] = v[i] ^ b[i]; } dfs(next, _u - 1, 0); } for (int i = 0; i < n; i++) { next[i] = v[p[i]] + r; } dfs(next, _u - 1, 1); } int main() { cin >> n >> u >> r; for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) scanf( %d , &b[i]); for (int i = 0; i < n; i++) scanf( %d , &k[i]); for (int i = 0; i < n; i++) scanf( %d , &p[i]); for (int i = 0; i < n; i++) p[i]--; first = 1; res = 0; dfs(a, u, 1); cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Event { char r; int pos; Event(char r = , int pos = -1) : r(r), pos(pos) {} }; bool operator<(Event a, Event b) { if (a.r != b.r) return a.r > b.r; return a.pos < b.pos; } vector<Event> v; int main() { string s; cin >> s; for (int i = 0; i < int(s.length()); i++) v.push_back(Event(s[i], i)); sort(v.begin(), v.end()); vector<Event> ans; for (int i = 0; i < int(v.size()); i++) if (ans.size() == 0 || (ans[int(ans.size()) - 1].pos < v[i].pos)) ans.push_back(v[i]); for (int i = 0; i < int(ans.size()); i++) cout << ans[i].r; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 110; int N, A[Maxn]; map<int, int> K, dp; int SG(int x) { set<int> S; if (dp.count(x)) return dp[x]; if (x == 0) return 0; for (int i = 1; i <= 30; i++) { int y = (x >> i) | (x & ((1 << (i - 1)) - 1)); if (y != x) S.insert(SG(y)); else break; } int p = 0; while (!S.empty()) { int now = *S.begin(); if (now == p) p++; else if (now > p) return dp[x] = p; S.erase(S.begin()); } return dp[x] = p; } int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) scanf( %d , &A[i]); for (int i = 1; i <= N; i++) { int x = A[i]; for (int j = 2; j * j <= x; j++) { int k = 0; while (x % j == 0) { x /= j; k++; } if (k) K[j] |= (1 << (k - 1)); } if (x != 1) K[x] |= 1; } int tmp = 0; dp[0] = 0; for (auto i : K) tmp ^= SG(i.second); if (tmp == 0) printf( Arpa n ); else printf( Mojtaba n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; long long ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1}; long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } unordered_map<char, long long> mp; string s; long long n; bool fun(long long x) { long long cnt = 0; for (auto it : mp) { long long val = it.second; cnt += it.second / x; if (it.second % x != 0) { cnt++; } } if (cnt <= n) return true; else return false; } void test_case() { cin >> s; cin >> n; for (auto it : s) { mp[it]++; } if (mp.size() > n) { cout << -1 << n ; return; } long long l, r; l = 1; r = 1000; long long ans = 1000; while (l <= r) { long long mid = l + (r - l) / 2; if (fun(mid)) { ans = min(ans, mid); r = mid - 1; } else { l = mid + 1; } } cout << ans << n ; string st = ; for (auto it : mp) { long long val = it.second; long long cnt = 0; cnt = it.second / ans; if (it.second % ans != 0) { cnt++; } while (cnt--) { st += it.first; } } while (st.size() != n) { st += a ; } cout << st << n ; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(20); long long t = 1; while (t--) { test_case(); } }
|
#include <bits/stdc++.h> const long double eps = 1e-6; struct Point { long long x, y; Point(long long _x = 0, long long _y = 0) : x(_x), y(_y) {} Point operator-(const Point &B) const { return Point(x - B.x, y - B.y); } long double operator*(const Point &B) const { return (long double)x * B.y - (long double)y * B.x; } } stk[1023000]; int top; long long k, b; long long calc(Point A) { return A.y + k * A.x + b; } inline int read() { int n = 0; char a; bool z = false; while (a = getchar()) { if (a > 9 || a < 0 ) if (z) break; else continue; if (!z) z = true; n = (n << 3) + (n << 1) + (a ^ 48); } return n; } int main() { long long n = read(); int Q = read(), opt; Point now; stk[top = 1] = Point(); while (Q--) { opt = read(); switch (opt) { case 1: stk[top = 1] = Point(); n += read(); k = b = 0; break; case 2: now = Point(n, -(n * k + b)); n += read(); while (top > 1 && (now - stk[top - 1]) * (stk[top] - stk[top - 1]) > -eps) --top; stk[++top] = now; break; case 3: b += read(); k += read(); break; } while (top > 1 && calc(stk[top]) >= calc(stk[top - 1])) --top; printf( %lld %lld n , stk[top].x + 1, calc(stk[top])); } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; void qread(int &x) { int neg = 1; x = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) neg = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = 10 * x + c - 0 , c = getchar(); x *= neg; } const int maxn = 405; int test, n, mod; int dp[maxn][maxn * 2], fac[maxn]; int quickpow(int x, int pow) { int res = 1; for (; pow; pow >>= 1) { if (pow & 1) res = 1LL * res * x % mod; x = 1LL * x * x % mod; } return res; } void work() { for (int(i) = 1; (i) <= 400; i++) dp[i][i + 400] = 1; for (int(i) = 1; (i) <= 400; i++) { int inv = quickpow(dp[i][i], mod - 2); for (int j = i + 1; j <= 2 * 400; j++) dp[i][j] = 1LL * dp[i][j] * inv % mod; dp[i][i] = 1; for (int j = i + 1; j <= 400; j++) { for (int k = i + 1; k <= 2 * 400; k++) dp[j][k] = (dp[j][k] - 1LL * dp[j][i] * dp[i][k] % mod + mod) % mod; dp[j][i] = 0; } } } int main() { scanf( %d%d , &test, &mod); fac[0] = 1; for (int(i) = 1; (i) <= 400; i++) fac[i] = 1LL * fac[i - 1] * i % mod; for (int(i) = 1; (i) <= 400; i++) { dp[i][1] = fac[i]; for (int k = 2; k <= i; k++) { for (int m = 0; m <= i - k; m++) dp[i][k] = (dp[i][k] + 1LL * fac[m + 1] * dp[i - m - 1][k - 1] % mod) % mod; } } work(); while (test--) { scanf( %d , &n); if (n == 2) { puts( 2 ); continue; } int ans = ((mod - dp[n][401]) % mod + ((n & 1) ? 2 : -2) + mod) % mod; printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, k; int pr[N], sz[N]; int root(int x) { return pr[x] = (pr[x] == x ? x : root(pr[x])); } void merge(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (rand() & 1) { pr[x] = y; sz[y] += sz[x]; } else { pr[y] = x; sz[x] += sz[y]; } } int main() { for (int i = 0; i < N; i++) { pr[i] = i; sz[i] = 1; } scanf( %d %d , &n, &k); for (int i = 0; i < k; i++) { int u, v; scanf( %d %d , &u, &v); u--; v--; merge(u, v); } int sat = 0; for (int i = 0; i < n; i++) if (root(i) == i) sat += sz[i] - 1; printf( %d n , k - sat); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int A[3005][5], dp[3005][3]; int solve(int x, bool a) { int &r = dp[x][a]; if (r != -1) return r; if (x == n) { if (a == 0) { return r = A[x][1]; } else { return r = A[x][2]; } } if (a == 0) { return r = max(solve(x + 1, 0) + A[x][2], solve(x + 1, 1) + A[x][1]); } else { return r = max(solve(x + 1, 1) + A[x][2], solve(x + 1, 0) + A[x][3]); } } int main() { scanf( %d , &n); for (int i = 1; i <= 3; i++) for (int j = 1; j <= n; j++) { scanf( %d , A[j] + i); } memset(dp, -1, sizeof dp); cout << solve(1, 0) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 5000 + 5; const int MOD = 1e9 + 7; const double pi = cos(-1); int n, d, ans[MAXN], fa[MAXN]; int c, now, maxx, cnt, pos; int ch[MAXN]; int getdepth() { int ans_t = now; c++; if (c == maxx) { c = 1; maxx *= 2; now++; } return ans_t; } int main() { int T; cin >> T; while (T--) { cin >> n >> d; cnt = 0; memset(ch, 0, sizeof ch); for (int i = 1; i <= n - 1; i++) { cnt += i; ans[i] = i; } pos = n - 1, now = 1, c = 1, maxx = 2; if (cnt < d) { printf( NO n ); continue; } while (cnt > d) { int dep = getdepth(); if (dep >= pos) break; if (cnt - (pos - dep) >= d) { cnt -= (pos - dep); ans[pos] = dep; } else { ans[pos] -= (cnt - d); cnt = d; } pos--; } if (cnt > d) printf( NO n ); else { printf( YES n ); ans[0] = 0; for (int i = 1; i <= n - 1; i++) { for (int j = 0; j <= n - 1; j++) { if (ans[j] == ans[i] - 1 && ch[j] < 2) { ch[j]++; fa[i] = j; break; } } } for (int i = 1; i <= n - 1; i++) printf( %d , fa[i] + 1); printf( n ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; template <class t, class u> void chmax(t& first, u second) { if (first < second) first = second; } template <class t, class u> void chmin(t& first, u second) { if (second < first) first = second; } template <class t> using vc = vector<t>; template <class t> using vvc = vc<vc<t>>; using pi = pair<ll, ll>; using vi = vc<ll>; template <class t, class u> ostream& operator<<(ostream& os, const pair<t, u>& p) { return os << { << p.first << , << p.second << } ; } template <class t> ostream& operator<<(ostream& os, const vc<t>& v) { os << { ; for (auto e : v) os << e << , ; return os << } ; } using uint = unsigned; using ull = unsigned long long; template <class t, size_t n> ostream& operator<<(ostream& os, const array<t, n>& first) { return os << vc<t>(first.begin(), first.end()); } template <ll i, class T> void print_tuple(ostream&, const T&) {} template <ll i, class T, class H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << , ; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <class... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << { ; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << } ; } template <class t> void print(t x, ll suc = 1) { cout << x; if (suc == 1) cout << n ; if (suc == 2) cout << ; } ll read() { ll i; cin >> i; return i; } vi readvi(ll n, ll off = 0) { vi v(n); for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off; return v; } template <class T> void print(const vector<T>& v, ll suc = 1) { for (ll i = ll(0); i < ll(v.size()); i++) print(v[i], i == ll(v.size()) - 1 ? suc : 2); } string readString() { string s; cin >> s; return s; } template <class T> T sq(const T& t) { return t * t; } void yes(bool ex = true) { cout << Yes << n ; if (ex) exit(0); } void no(bool ex = true) { cout << No << n ; if (ex) exit(0); } void possible(bool ex = true) { cout << Possible << n ; if (ex) exit(0); } void impossible(bool ex = true) { cout << Impossible << n ; if (ex) exit(0); } constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; } const ll infLL = LLONG_MAX / 3; const ll inf = infLL; ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); } ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); } ll popcount(signed t) { return __builtin_popcount(t); } ll popcount(ll t) { return __builtin_popcountll(t); } bool ispow2(ll i) { return i && (i & -i) == i; } ll mask(ll i) { return (ll(1) << i) - 1; } bool inc(ll first, ll second, ll c) { return first <= second && second <= c; } template <class t> void mkuni(vc<t>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } ll rand_int(ll l, ll r) { static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count()); return uniform_int_distribution<ll>(l, r)(gen); } template <class t> void myshuffle(vc<t>& first) { for (ll i = ll(0); i < ll(ll(first.size())); i++) swap(first[i], first[rand_int(0, i)]); } template <class t> ll lwb(const vc<t>& v, const t& first) { return lower_bound(v.begin(), v.end(), first) - v.begin(); } template <class N, class E> struct treedp { const vvc<E>& g; vc<N> first, second, res, sub, bus; void dfs1(ll v, ll p) { first[v].init(v); E up; for (auto e : g[v]) if (e != p) { dfs1(e, v); second[e] = first[v]; first[v] = first[v] + first[e]; } else up = e; sub[v] = first[v]; if (p != -1) first[v] = first[v].up(up); } void dfs2(ll v, ll p, N cur) { for (ll i = ll(g[v].size()) - 1; i >= ll(0); i--) { auto e = g[v][i]; if (e == p) continue; void(0); bus[e] = cur + second[e]; bus[e].show(); dfs2(e, v, bus[e].up(e)); cur = cur + first[e]; } res[v] = cur; } treedp(const vvc<E>& gg) : g(gg), first(ll(g.size())), second(ll(g.size())), res(ll(g.size())), sub(ll(g.size())), bus(ll(g.size())) { dfs1(0, -1); N tmp; tmp.init(0); dfs2(0, -1, tmp); } }; struct N { signed v[2][2], s; void init(ll) { v[0][0] = 1; v[0][1] = 0; v[1][0] = 0; v[1][1] = 0; s = 1; } N up(ll) const { N res{}; res.v[0][0] = v[1][0]; res.v[0][1] = v[0][0] + v[1][1]; res.v[1][0] = v[0][0]; res.v[1][1] = v[0][1]; res.s = s + 1; return res; } N operator+(const N& r) const { show(); r.show(); N res{}; for (ll first = ll(0); first < ll(2); first++) for (ll second = ll(0); second < ll(2 - first); second++) { for (ll c = ll(0); c < ll(2); c++) for (ll d = ll(0); d < ll(2 - c); d++) { res.v[first + second][c + d] += v[first][c] * r.v[second][d]; } } res.s = s + r.s - 1; return res; } ll get() { return v[0][0] + v[1][1]; } ll get2() { return v[1][0] * s; } void show() const { for (ll i = ll(0); i < ll(2); i++) for (ll j = ll(0); j < ll(2); j++) void(0); } }; signed main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20); ll n; cin >> n; vvc<ll> t(n); for (ll i = ll(0); i < ll(n - 1); i++) { ll first, second; cin >> first >> second; first--; second--; t[first].push_back(second); t[second].push_back(first); } treedp<N, ll> dp(t); ll ans = 0; for (ll i = ll(1); i < ll(n); i++) { dp.sub[i].show(); dp.bus[i].show(); ans += dp.sub[i].get() * dp.bus[i].get(); ans += dp.sub[i].get2() * dp.bus[i].get2(); } print(ans); }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:66777216 ) using namespace std; int a, b, c, d, i, j, n, m, k; void brute() { int mas[4][4]; vector<int> num; memset((mas), 0, sizeof(mas)); for (int _n((n * n) - 1), i(0); i <= _n; i++) { scanf( %d , &a); num.push_back(a); } sort((num).begin(), (num).end()); do { a = 0; for (int _n((n)-1), i(0); i <= _n; i++) { for (int _n((n)-1), j(0); j <= _n; j++) { mas[i][j] = num[a++]; } } int s = -1000000000; bool ok = 1; for (int _n((n)-1), i(0); i <= _n; i++) { int sum = 0; for (int _n((n)-1), j(0); j <= _n; j++) sum += mas[i][j]; if (s == -1000000000) s = sum; else if (sum != s) { ok = 0; break; } sum = 0; for (int _n((n)-1), j(0); j <= _n; j++) sum += mas[j][i]; if (sum != s) { ok = 0; break; } } int sum = 0; for (int _n((n)-1), i(0); i <= _n; i++) sum += mas[i][i]; if (sum != s) ok = 0; sum = 0; for (int _n((n)-1), i(0); i <= _n; i++) sum += mas[n - i - 1][i]; if (sum != s) ok = 0; if (ok == 1) { printf( %d n , s); for (int _n((n)-1), i(0); i <= _n; i++) { for (int _n((n)-1), j(0); j <= _n; j++) { if (j) printf( ); printf( %d , mas[i][j]); } printf( n ); } exit(0); } } while (next_permutation((num).begin(), (num).end())); } int mas[16]; int sum[2001], num[1 << 16], inv[2001]; vector<int> perm[2001][24]; unordered_map<unsigned long long, unsigned long long> q; void die(unsigned long long rh, int n1, int n2, int cp1, int cp2, int sum) { int p2 = rh % 24; rh /= 24; int p1 = rh % 24; rh /= 24; int v2 = rh % k; rh /= k; int v1 = rh; printf( %d n , sum); for (int _n((4) - 1), i(0); i <= _n; i++) { vector<int> cur; if (!i) cur = perm[n1][cp1]; else if (i == 1) cur = perm[n2][cp2]; else if (i == 2) cur = perm[v2][p2]; else cur = perm[v1][p1]; for (int _n((4) - 1), j(0); j <= _n; j++) { if (j) printf( ); printf( %d , cur[j]); } printf( n ); } exit(0); } int main() { srand(25091992); scanf( %d , &n); if (n <= 3) brute(); for (int _n((n * n) - 1), i(0); i <= _n; i++) { scanf( %d , &mas[i]); } random_shuffle(mas, mas + n * n); for (int _n((1 << (n * n)) - 1), mask(0); mask <= _n; mask++) { c = 0; d = 0; for (int _n((n * n) - 1), i(0); i <= _n; i++) if (mask & 1 << i) { c += mas[i]; ++d; } if (d != 4) continue; sum[k] = c; inv[k] = mask; num[mask] = ++k; vector<int> cur; for (int _n((n * n) - 1), i(0); i <= _n; i++) if (mask & 1 << i) cur.push_back(mas[i]); sort((cur).begin(), (cur).end()); a = 0; do { perm[k - 1][a++] = cur; } while (next_permutation((cur).begin(), (cur).end())); } int ts = 0; for (int _n((n * n) - 1), i(0); i <= _n; i++) ts += mas[i]; for (int _n((k)-1), i(0); i <= _n; i++) { if (ts != sum[i] * 4) continue; for (int _n((k)-1), j(0); j <= _n; j++) { if (inv[i] & inv[j]) continue; if (sum[i] != sum[j]) continue; int s = sum[i]; for (int _n((24) - 1), p1(0); p1 <= _n; p1++) { if ((int)((perm[i][p1]).size()) == 0) break; const vector<int> &cp1 = perm[i][p1]; for (int _n((24) - 1), p2(0); p2 <= _n; p2++) { if (perm[j][p2].empty()) break; const vector<int> &cp2 = perm[j][p2]; unsigned long long h = 1, rh = 1; for (int _n((4) - 1), z(0); z <= _n; z++) { h = h * 1234567891 + cp1[z] + cp2[z]; rh = rh * 1234567891 + s - cp1[z] - cp2[z]; } h = h * 1234567891 + cp1[0] + cp2[1]; rh = rh * 1234567891 + s - (cp1[3] + cp2[2]); h = h * 1234567891 + cp1[3] + cp2[2]; rh = rh * 1234567891 + s - (cp1[0] + cp2[1]); h = h * 1234567891 * (inv[i] | inv[j]); rh = rh * 1234567891 * ((~(inv[i] | inv[j])) & ((1 << (n * n)) - 1)); if (q.count(rh)) { die(q[rh], i, j, p1, p2, s); } unsigned long long val = (long long)k * 24 * 24 * i + (long long)24 * 24 * j + (long long)24 * p1 + p2; q[h] = val; } } } } }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; long long n, m, q, u, v, l, r, c, res, sum[N], p[N], lmt[N], vst[N]; vector<long long> adj[N], vec; void dfs(int u, int p) { vst[u] = 1; vec.push_back(u); for (auto v : adj[u]) { if (vst[v] == 2) continue; if (vst[v] == 1) { if (v != p) { long long mn = u; long long mx = u; for (int j = vec.size() - 1; j >= 0; j--) { mn = min(mn, vec[j]); mx = max(mx, vec[j]); if (vec[j] == v) break; } lmt[mn] = min(lmt[mn], mx - 1); } } else dfs(v, u); } vec.pop_back(); vst[u] = 2; } void solve() { cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } for (int i = 1; i <= n; i++) { vst[i] = 0; lmt[i] = n; } for (int i = 1; i <= n; i++) { if (vst[i]) continue; dfs(i, -1); } lmt[n] = n; sum[n] = 1; for (int i = n - 1; i >= 1; i--) { if (lmt[i + 1] < lmt[i]) lmt[i] = lmt[i + 1]; sum[i] = lmt[i] - i + 1; } sum[0] = 0; for (int i = 1; i <= n; i++) sum[i] += sum[i - 1]; cin >> q; for (int i = 1, j; i <= q; i++) { cin >> l >> r; j = lower_bound(lmt + l, lmt + r + 1, r) - lmt; c = r + 1 - j; res = ((c * (c + 1)) / 2) + sum[j - 1] - sum[l - 1]; cout << res << n ; } } int main() { std::ios::sync_with_stdio(0); cin.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (T e : v) { os << e << ; } return os; } constexpr ll mod = 998244353; constexpr int maxn = 502; ll lte[maxn]; ll dp[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n, k; cin >> n >> k; --k; for (int i = 1; i <= n; ++i) { ll total = 0; for (int j = 1; j <= n; ++j) { if (j <= i) { dp[j] = total + 1; total += dp[j]; total %= mod; } else { dp[j] = total; total += dp[j]; total -= dp[j - i]; total %= mod; } } lte[i] = (2 * dp[n] % mod + mod) % mod; } for (int i = n; i >= 1; --i) { lte[i] = (lte[i] - lte[i - 1] + mod) % mod; } ll ans = 0; for (int i = 1; i <= min(n, k); ++i) { ll d = k / i; for (int j = 1; j <= min(d, n); ++j) { ans = (ans + lte[i] * lte[j]) % mod; } } cout << ans * ((mod + 1) / 2) % mod << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int in[2 * 100010], s[2 * 100010]; int n; int main() { scanf( %d , &n); memset(in, 0, sizeof(in)); memset(s, 0, sizeof(s)); for (int i = 0; i < n; i++) { int xx; scanf( %d , &xx); s[i] = xx; in[xx] = i + 1; } int t = 0; for (int i = 0; i < n; i++) { int x, j; scanf( %d , &x); if (in[x]) for (j = t; j < n && s[j] != x; j++) in[s[j]] = 0; else { printf( 0 ); continue; } printf( %d , j - t + 1); t = j + 1; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, M; long long K; int A[505][505]; vector<int> goods, bads; int remap[505]; double P[505][505]; typedef double matrix[105][105]; void mult(matrix A, matrix B, matrix C) { matrix temp; memset(temp, 0, sizeof(temp)); for (int i = 0; i < 105; i++) for (int j = 0; j < 105; j++) for (int k = 0; k < 105; k++) temp[i][j] += A[i][k] * B[k][j]; memcpy(C, temp, sizeof(matrix)); } matrix Q, R; int V[505]; int main() { cin >> N >> M >> K; for (int i = 1; i <= N; i++) { int x; cin >> x; if (x || i == 1) bads.push_back(i); else goods.push_back(i); } for (int i = 0; i < bads.size(); i++) remap[bads[i]] = i; for (int i = 0; i < goods.size(); i++) remap[goods[i]] = bads.size() + i; for (int i = 0; i < M; i++) { int u, v; cin >> u >> v; u = remap[u], v = remap[v]; A[u][v]++; A[v][u]++; } for (int i = 0; i < N; i++) { double deg = 0; for (int j = 0; j < N; j++) deg += A[i][j]; for (int j = 0; j < N; j++) P[i][j] += A[i][j] / deg; } while (N > bads.size()) { N--; for (int i = 0; i < N; i++) P[N][i] /= (1.0 - P[N][N]); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) P[i][j] += P[i][N] * P[N][j]; } N--; for (int i = 1; i <= N; i++) P[0][i] /= (1.0 - P[0][0]); for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) Q[i][j] = P[i][j] + P[i][0] * P[0][j]; for (int i = 1; i <= N; i++) R[i][i] = 1; K -= 2; for (int b = 0; b <= 63; b++) { if (K & (1LL << b)) mult(Q, R, R); mult(Q, Q, Q); } double total = 0; for (int i = 1; i <= N; i++) total += P[0][i] * R[i][N]; cout << total << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long arr[n]; int i; map<long long, int> mp; for (i = 0; i < n; i++) { int t; cin >> t; mp[t]++; } auto it = mp.begin(); int maxe = 0; while (it != mp.end()) { if (it->second > maxe) maxe = it->second; it++; } cout << n - maxe << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int count0(0), count5(0); for (int i = 1; i <= n; i++) { int a; cin >> a; if (a == 0) count0++; if (a == 5) count5++; } if (count0 == 0) cout << -1; else if (count5 < 9) cout << 0; else { for (int i = 0; i < floor(count5 / 9); i++) { cout << 555555555; } for (int i = 0; i < count0; i++) cout << 0; } }
|
#include <bits/stdc++.h> using namespace std; int A[20][6], n, B[4]; bool check(int l) { int a0 = 0, a1 = 0, i, j; for (i = 0; i < 4; i++) for (j = i + 1; j < 4; j++) if (B[i] == B[j]) return 0; for (i = 0; i < 4; i++) { a0 += (int)(B[i] == A[l][i + 2]); for (j = 0; j < 4; j++) a1 += (int)(B[i] == A[l][j + 2]); } a1 -= a0; return (a1 == A[l][1] && a0 == A[l][0]); } int main() { int res = 0, ans = 0, i, j, tmp; bool fl = 1; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%d%d , &tmp, &A[i][0], &A[i][1]); for (j = 0; j < 4; j++) A[i][j + 2] = tmp % 10, tmp /= 10; } for (B[0] = 0; B[0] < 10; B[0]++) for (B[1] = 0; B[1] < 10; B[1]++) for (B[2] = 0; B[2] < 10; B[2]++) for (B[3] = 0; B[3] < 10; B[3]++) { fl = 1; for (i = 0; i < n; i++) { fl = (fl && check(i)); } if (fl == 1) res++, ans = B[0] + B[1] * 10 + B[2] * 100 + B[3] * 1000; } if (res == 1) { if (ans >= 1000) printf( %d n , ans); else printf( 0%d n , ans); } if (res > 1) puts( Need more data ); if (res == 0) puts( Incorrect data ); return 0; }
|
#include <bits/stdc++.h> using namespace std; void OUT_TST(string s, istream_iterator<string> it) { cerr << s; } template <typename T, typename... Args> void OUT_TST(string s, istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << ; OUT_TST(s, ++it, args...); } template <class T> void rd(T& ret) { ret = 0; bool ok = 0, u = 0; for (;;) { int c = getchar(); if (c >= 0 && c <= 9 ) ret = (ret << 3) + (ret << 1) + c - 0 , ok = 1; else if (c == - ) u = 1; else if (ok) { if (u) ret *= -1; return; } } } long long powmod(long long p, long long n, long long mod) { long long ret = 1; for (; n; n >>= 1) { if (n & 1) ret = ret * p % mod; p = p * p % mod; } return ret; } template <class T> bool chmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool chmax(T& a, const T& b) { return b > a ? a = b, 1 : 0; } int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } const int INF = (int)1e8; void input(vector<vector<int>>& son, vector<int>& an, vector<int>& sz, int n) { int m; cin >> m; son.resize(m); an.resize(m, -1); sz.resize(m, 0); for (int i = 0; i < m - 1; ++i) { int t; cin >> t; --t; son[t].push_back(i + 1); } for (int i = 0; i < n; ++i) { int t; cin >> t; --t; an[t] = i; } } pair<int, int> dfs(int first, const vector<vector<int>>& son, const vector<int>& idx, vector<vector<pair<int, int>>>& cost, vector<int>& sz) { sz[first] = 1; if (idx[first] != -1) { cost[idx[first]].emplace_back(idx[first], 1); return {idx[first], idx[first]}; } int mi = INF, mx = -INF; pair<int, int> tmp; for (int second : son[first]) { tmp = dfs(second, son, idx, cost, sz); sz[first] += sz[second]; chmin(mi, tmp.first); chmax(mx, tmp.second); } int c = sz[first]; if (first == 0) --c; cost[mi].emplace_back(mx, c); return {mi, mx}; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); int n; cin >> n; vector<int> an, bn, sza, szb; vector<vector<int>> sa, sb; input(sa, an, sza, n); input(sb, bn, szb, n); vector<vector<pair<int, int>>> cost(n); auto tmp = dfs(0, sa, an, cost, sza); assert(tmp.first == 0 && tmp.second == n - 1); tmp = dfs(0, sb, bn, cost, szb); assert(tmp.first == 0 && tmp.second == n - 1); vector<int> dp(n + 1, 0); for (auto& i : cost[0]) { chmax(dp[i.first], i.second); } for (int i = 0; i < n - 1; ++i) { chmax(dp[i + 1], dp[i]); for (auto& j : cost[i + 1]) { chmax(dp[j.first], dp[i] + j.second); } } cout << dp[n - 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<char, long long int>> vp(4000005); void ans(vector<long long int> dp, vector<long long int> star, long long int x, vector<pair<char, long long int>> &vp, long long int n, long long int &flag) { if (x <= 1) { return; } long long int starpos = upper_bound((dp).begin(), (dp).end(), x) - dp.begin(); x -= dp[starpos - 1]; if (x == 0) { for (long long int i = star[starpos - 1]; i < n; i++) { if (vp[i].first == * ) { vp[i].first = b ; } } } else { for (long long int i = star[starpos]; i < n; i++) { while (i < n && vp[i].first == * ) { vp[i].first = b ; i++; } break; } ans(dp, star, x, vp, n, flag); } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int T = 1; cin >> T; while (T--) { long long int n, k, x; cin >> n >> k >> x; string s; cin >> s; string b = ; for (long long int i = 0; i < k; i++) { b += b ; } long long int cnt = 0; for (long long int i = 0; i < n; i++) { if (s[i] == * ) { long long int t = cnt; for (long long int j = cnt; j < t + k; j++) { vp[cnt] = { * , cnt}; cnt++; } } else { vp[cnt] = { a , cnt}; cnt++; } } s.clear(); s = ; for (long long int i = 0; i < cnt; i++) { s += vp[i].first; } vector<long long int> dp; vector<long long int> star; star.push_back(-1); dp.push_back(1); long long int prev = 1; long long int curr = 1; long long int flag1 = 1; for (long long int i = cnt - 1; i >= 0 && flag1; i--) { long long int flag = 0; while (i >= 0 && vp[i].first == * ) { if (x < (curr + 1) * 1ll * prev) { dp.push_back((curr + 1) * 1ll * prev); star.push_back(i); flag1 = 0; break; } dp.push_back((curr + 1) * 1ll * prev); star.push_back(i); i--; curr++; flag = 1; } if (flag) { prev = curr * prev; curr = 1; } } long long int flag = 1; ans(dp, star, x, vp, cnt, flag); for (long long int i = 0; i < cnt; i++) { if (vp[i].first == * ) continue; cout << vp[i].first; } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; const double PI = acos(-1); const double EPS = 1e-8; void func(vector<pair<int, int> > &v) { sort((v).begin(), (v).end()); int start = -1; int end = -1; vector<pair<int, int> > res; for (int i = 0; i < (int)v.size(); ++i) { if (i == 0) { start = v[i].first; end = v[i].second; } else { if (v[i].first <= end) { (end < v[i].second ? (end = v[i].second, 1) : 0); } else { res.push_back(pair<int, int>(start, end)); start = v[i].first; end = v[i].second; } } } if (start != -1) res.push_back(pair<int, int>(start, end)); v = res; } struct P { int v; int t, a; P(int v, int t, int a) : v(v), t(t), a(a) {} }; int maxbit(int a) { int r = 0; while (a) a >>= 1, r++; return r - 1; } const int N = 200000; bool tflag[N]; bool yflag[N]; int main() { int w, h, k; while (cin >> w >> h >> k) { for (int i = 0; i < (int)N; ++i) tflag[i] = yflag[i] = 0; map<int, vector<pair<int, int> > > tate, yoko; for (int i = 0; i < (int)k; ++i) { int x1, y1, x2, y2; scanf( %d%d%d%d , &x1, &y1, &x2, &y2); if (x1 == x2) { tate[x1].push_back(pair<int, int>(min(y1, y2), max(y1, y2))); } else { yoko[y1].push_back(pair<int, int>(min(x1, x2), max(x1, x2))); } } assert(tate.size() <= w - 1 && yoko.size() <= h - 1); vector<P> nim; for (__typeof((tate).begin()) it = (tate).begin(); it != (tate).end(); ++it) { if (it->first < N) tflag[it->first] = 1; vector<pair<int, int> > &v = it->second; func(v); int t = h; for (__typeof((v).begin()) jt = (v).begin(); jt != (v).end(); ++jt) { t -= jt->second - jt->first; } nim.push_back(P(t, 0, it->first)); } for (__typeof((yoko).begin()) it = (yoko).begin(); it != (yoko).end(); ++it) { if (it->first < N) yflag[it->first] = 1; vector<pair<int, int> > &v = it->second; func(v); int t = w; for (__typeof((v).begin()) jt = (v).begin(); jt != (v).end(); ++jt) { t -= jt->second - jt->first; } nim.push_back(P(t, 1, it->first)); } if ((w - 1 - tate.size()) % 2 == 1) { for (int i = 1; i < w; ++i) if (!tflag[i]) { nim.push_back(P(h, 0, i)); break; } } if ((h - 1 - yoko.size()) % 2 == 1) { for (int i = 1; i < h; ++i) if (!yflag[i]) { nim.push_back(P(w, 1, i)); break; } } int val = 0; for (__typeof((nim).begin()) it = (nim).begin(); it != (nim).end(); ++it) { val ^= it->v; } if (val) { puts( FIRST ); int mb = maxbit(val); int x1, y1, x2, y2; for (__typeof((nim).begin()) it = (nim).begin(); it != (nim).end(); ++it) { if ((it->v) >> mb & 1) { int num = it->v - (it->v ^ val); assert(num >= 1); if (it->t == 0) { x1 = x2 = it->a; y1 = 0; vector<pair<int, int> > &v = tate[it->a]; int low = 0, high = h; while (low + 1 < high) { int mid = (low + high) / 2; int sum = mid; for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it) { if (it->second <= mid) sum -= it->second - it->first; else if (it->first <= mid) sum -= mid - it->first; } if (sum >= num) high = mid; else low = mid; } y2 = high; } else { y1 = y2 = it->a; x1 = 0; vector<pair<int, int> > &v = yoko[it->a]; int low = 0, high = w; while (low + 1 < high) { int mid = (low + high) / 2; int sum = mid; for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it) { if (it->second <= mid) sum -= it->second - it->first; else if (it->first <= mid) sum -= mid - it->first; } if (sum >= num) high = mid; else low = mid; } x2 = high; } break; } } printf( %d %d %d %d n , x1, y1, x2, y2); } else { puts( SECOND ); } } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int main() { int t; cin >> t; for (int tc = 0; tc < t; tc++) { long long a, b, c, d; cin >> a >> b >> c >> d; int temp = 1; if (a % 2) { temp *= -1; } if (b % 2) { temp *= -1; } if (temp == 1) { cout << Tidak Tidak ; if (b > 0 || c > 0) { cout << Ya ; } else { cout << Tidak ; } if (a > 0 || d > 0) { cout << Ya << endl; } else { cout << Tidak << endl; } } else { if (a > 0 || d > 0) { cout << Ya ; } else { cout << Tidak ; } if (b > 0 || c > 0) { cout << Ya ; } else { cout << Tidak ; } cout << Tidak Tidak << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 5 * (1e5 + 5); vector<int> e[MAX]; vector<int> ice[MAX]; int n, m; int ans[MAX]; bool vis[MAX]; int cnt; void dfs(int now, int pre) { int len = ice[now].size(); for (int i = 0; i <= len; i++) vis[i] = 0; for (int i = 0; i < len; i++) if (ans[ice[now][i]]) vis[ans[ice[now][i]]] = 1; int f = 1; for (int i = 0; i < len; i++) if (!ans[ice[now][i]]) { int t = ice[now][i]; while (vis[f]) f++; ans[t] = f++; } for (int i = 0; i < e[now].size(); i++) if (e[now][i] != pre) dfs(e[now][i], now); } int main() { cin >> n >> m; int mx = 0; for (int i = 1; i <= n; i++) { int u, g; scanf( %d , &u); mx = max(mx, u); for (int j = 1; j <= u; j++) { scanf( %d , &g); ice[i].push_back(g); } } for (int i = 1; i <= n - 1; i++) { int x, y; scanf( %d%d , &x, &y); e[x].push_back(y); e[y].push_back(x); } dfs(1, -1); if (mx) printf( %d n , mx); else printf( 1 n ); if (ans[1]) printf( %d , ans[1]); else printf( 1 ); for (int i = 2; i <= m; i++) { if (ans[i]) printf( %d , ans[i]); else printf( 1 ); } puts( ); return 0; }
|
#include <bits/stdc++.h> int n, nxt[100005], fa[100005]; int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } int main(void) { scanf( %d , &n); if (n % 2) { puts( -1 ); return 0; } for (int i = 0; i <= n; i++) fa[i] = i; for (int i = 0; i < (n / 2); i++) { int j = i + (n / 2); nxt[i] = i * 2, nxt[j] = i * 2 + 1; fa[find(i)] = find((i * 2) % n); fa[find(j)] = find((i * 2 + 1) % n); } for (int i = 0; i < (n / 2); i++) { int j = i + (n / 2); if (find(i) != find(j)) { nxt[i] ^= nxt[j] ^= nxt[i] ^= nxt[j]; fa[find(i)] = find(j); } } int x = 0; for (int i = 0; i <= n; i++) printf( %d , x), x = nxt[x]; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a; cin >> n >> a; vector<int> m(n); for (int i = 0; i < n; i++) cin >> m[i]; n--; a--; int calc = 0; if (m[a]) calc++; for (int j = 1; j <= max(n - a, a); j++) { if (a - j < 0) { if (m[a + j]) calc++; continue; } if (a + j > n) { if (m[a - j]) calc++; continue; } if (m[a + j] && m[a - j]) calc += 2; } cout << calc; }
|
#include <bits/stdc++.h> using namespace std; int n; int arities[100001]; int legs[100001]; bool markers[100001]; list<int> graph[100001]; void parse() { int a, b; cin >> n; for (int it = 0; it < (100001); it++) { (arities)[it] = (0); }; for (int it = 0; it < (100001); it++) { (markers)[it] = (false); }; for (int it = 0; it < (100001); it++) { (legs)[it] = (0); }; for (int i = 1; i < n; i++) { cin >> a >> b; graph[a].push_back(b); graph[b].push_back(a); arities[a]++; arities[b]++; } } void traverse(int i) { if (markers[i]) return; if (arities[i] >= 3) { legs[i]++; return; } markers[i] = true; for (list<int>::iterator it = graph[i].begin(); it != graph[i].end(); ++it) { traverse(*it); } } void solve() { for (int i = 1; i <= n; i++) { if (arities[i] == 1) traverse(i); } for (int i = 1; i <= n; i++) { if (!markers[i]) { int r = 0; for (list<int>::iterator it = graph[i].begin(); it != graph[i].end(); ++it) { if (!markers[*it] && arities[*it] - min(legs[*it], 2) > 1) r++; } if (r > 2) { cout << No ; return; } } } cout << Yes ; } int main() { ios::sync_with_stdio(false); std::cout.precision(11); parse(); solve(); cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; char stra[110]; char strb[110]; int mark[110]; int g[11000]; int main() { int b, d; scanf( %d%d , &b, &d); scanf( %s , stra); scanf( %s , strb); int lena = strlen(stra); int lenb = strlen(strb); memset(mark, -1, sizeof(mark)); mark[0] = 0; int pos = 0; int key = 0; int cnt = 0; int num = 0; for (int ii = 1; ii <= 1000; ii++) { int sum = 0; for (int i = 0; i < lena; i++) { if (stra[i] == strb[pos]) { pos++; if (pos == lenb) { sum++; pos = 0; } } } g[ii] = sum; if (mark[pos] == -1) mark[pos] = ii; else { key = mark[pos]; cnt = ii - key; for (int ti = key + 1; ti <= ii; ti++) num += g[ti]; break; } } int ans = 0; if (b <= key) { for (int i = 1; i <= b; i++) ans += g[i]; } else { int tb = (b - key) / cnt; int tt = (b - key) - tb * cnt; for (int i = 1; i <= key; i++) ans += g[i]; ans += tb * num; for (int i = key + 1; i <= key + tt; i++) ans += g[i]; } printf( %d n , ans / d); return 0; }
|
#include <bits/stdc++.h> using namespace std; unordered_map<long long, string> Map; unordered_map<long long, string>::iterator it; string Get(long long x) { string ans = ; int s[13], cnt = 0; while (x) { s[++cnt] = x % 10; x /= 10; } for (int i = cnt; i >= 1; i--) ans += char(s[i] + 0 ); return ans; } int main() { long long n; scanf( %lld , &n); long long len = sqrt(n); for (long long i = 2; i <= len; i++) { for (long long j = i * i, k = 2; j <= n; j *= i, k++) { string gg = Get(i) + ^ + Get(k); if (gg.size() >= Get(j).size()) continue; if (Map[j].size() == 0) { Map[j] = gg; } else if (Map[j].size() > gg.size()) Map[j] = gg; } } string ans = Get(n); for (it = Map.begin(); it != Map.end(); it++) { long long k = (*it).first; string gg = (*it).second; if (n / k >= 2) { gg += * ; gg += (Map.count(n / k)) ? Map[n / k] : Get(n / k); } if (n % k) { gg += + ; gg += (Map.count(n % k)) ? Map[n % k] : Get(n % k); } if (ans.size() > gg.size()) ans = gg; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 13; const int INF = 1e6 + 7; int t[MAXN][MAXN]; int tab[MAXN * MAXN]; bool odw[MAXN * MAXN]; int wyn[MAXN * MAXN]; bool prze[MAXN * MAXN]; int xx[4] = {0, 0, -1, 1}; int yy[4] = {-1, 1, 0, 0}; vector<int> v[MAXN * MAXN]; int check(int x) { int spr = 0; odw[x] = true; prze[x] = true; for (auto it : v[x]) { if (odw[it] && prze[it]) spr = 1; else if (!odw[it]) spr = max(spr, check(it)); } prze[x] = false; return spr; } int DFS(int x, int gl) { odw[x] = true; for (auto it : v[x]) { if (odw[it]) wyn[x] = max(wyn[x], wyn[it]); else wyn[x] = max(wyn[x], DFS(it, gl + 1)); } wyn[x]++; return wyn[x]; } int main() { int n, m; int mx = 0; char c; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( ); for (int j = 1; j <= m; j++) { scanf( %c , &c); if (c == I ) t[i][j] = 1; if (c == M ) t[i][j] = 2; if (c == A ) t[i][j] = 3; tab[(i - 1) * m + j] = t[i][j]; } t[i][0] = t[i][m + 1] = 5; } for (int i = 1; i <= m; i++) t[0][i] = t[n + 1][i] = 5; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { for (int l = 0; l < 4; l++) { if (t[i + xx[l]][j + yy[l]] == (t[i][j] + 1) % 4) v[(i - 1) * m + j].push_back((i + xx[l] - 1) * m + j + yy[l]); } } } for (int i = 1; i <= n * m; i++) { if (!odw[i] && tab[i] == 0) { if (check(i) == 1) { printf( Poor Inna! ); return 0; } } } for (int i = 1; i <= n * m; i++) odw[i] = false; for (int i = 1; i <= n * m; i++) { if (!odw[i] && tab[i] == 0) mx = max(mx, DFS(i, 1) / 4); } if (mx == 0) printf( Poor Dima! ); else printf( %d , mx); return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; pair<int, int> a[100003]; int l = 0; bool lios(string s) { if (s.size() < 4) return false; if (s.substr(s.size() - 4, 4) == lios ) return true; return false; } bool liala(string s) { if (s.size() < 5) return false; if (s.substr(s.size() - 5, 5) == liala ) return true; return false; } bool etr(string s) { if (s.size() < 3) return false; if (s.substr(s.size() - 3, 3) == etr ) return true; return false; } bool etra(string s) { if (s.size() < 4) return false; if (s.substr(s.size() - 4, 4) == etra ) return true; return false; } bool initis(string s) { if (s.size() < 6) return false; if (s.substr(s.size() - 6, 6) == initis ) return true; return false; } bool inites(string s) { if (s.size() < 6) return false; if (s.substr(s.size() - 6, 6) == inites ) return true; return false; } bool adj, n, v; int main() { while (cin >> s) { a[l].first = -1, a[l].second = -1; if (lios(s)) { a[l++] = pair<int, int>{0, 0}; continue; } if (liala(s)) { a[l++] = pair<int, int>{0, 1}; continue; } if (etr(s)) { a[l++] = pair<int, int>{1, 0}; continue; } if (etra(s)) { a[l++] = pair<int, int>{1, 1}; continue; } if (initis(s)) { a[l++] = pair<int, int>{2, 0}; continue; } if (inites(s)) { a[l++] = pair<int, int>{2, 1}; continue; } l++; } if (l == 1 && a[0].first != -1) { cout << YES ; return 0; } for (int i = 0; i < l; i++) { if (a[i].first == -1) { cout << NO ; return 0; } if (i == 0) ; else { if (a[i].second != a[i - 1].second) { cout << NO ; return 0; } } if (a[i].first == 0) { if (n || v) { cout << NO ; return 0; } adj = 1; continue; } if (a[i].first == 1) { if (n || v) { cout << NO ; return 0; } n = 1; continue; } if (a[i].first == 2) { if (!n) { cout << NO ; return 0; } v = 1; continue; } } if (!n) cout << NO ; else cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e15; long long binpow(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) { res = res * a; } a = a * a; b >>= 1; } return res; } long long dp[205][205][205]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long T; T = 1; while (T--) { long long n, k; string s, t; cin >> n >> k; cin >> s >> t; memset(dp, -1, sizeof(dp)); dp[0][0][0] = 0; long long i, j; for (i = 0; i < n; i++) { for (j = 0; j <= k; j++) { for (long long f0 = 0; f0 <= n; f0++) { if (dp[i][j][f0] == -1) { continue; } long long e0 = s[i] == t[0]; long long e1 = s[i] == t[1]; long long e01 = t[0] == t[1]; dp[i + 1][j][f0 + e0] = max(dp[i + 1][j][f0 + e0], dp[i][j][f0] + (e1 ? f0 : 0)); if (j + 1 <= k) dp[i + 1][j + 1][f0 + 1] = max(dp[i + 1][j + 1][f0 + 1], dp[i][j][f0] + (e01 ? f0 : 0)); if (j + 1 <= k) dp[i + 1][j + 1][f0 + e01] = max(dp[i + 1][j + 1][f0 + e01], dp[i][j][f0] + f0); } } } long long ans = 0; for (j = 0; j <= k; j++) { for (long long f0 = 0; f0 <= n; f0++) { ans = max(ans, dp[n][j][f0]); } } cout << ans << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int max_n = 1011, inf = 1000111222; int n, a[max_n][max_n], x[max_n]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { scanf( %d , &a[i][j]); } } long long val = 1LL * a[0][1] * a[0][2] / a[1][2]; x[0] = sqrtl(val); while (1LL * x[0] * x[0] < val) { ++x[0]; } printf( %d , x[0]); for (int i = 1; i < n; ++i) { printf( %d , a[0][i] / x[0]); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int di[] = {-1, 0, 1, 0}; const int dj[] = {0, 1, 0, -1}; const long long MOD = 1e9 + 7; const long long INF = 1e9; const double EPS = 1e-11; int main() { ios::sync_with_stdio(false), cin.tie(0); int n, q, c; cin >> n >> q >> c; vector<pair<int, int> > pos(n); vector<int> s(n); vector<vector<vector<int> > > cnt( 101, vector<vector<int> >(101, vector<int>(c + 1))); for (int i = 0; i < n; ++i) { cin >> pos[i].first >> pos[i].second >> s[i]; cnt[pos[i].first][pos[i].second][s[i]]++; } for (int i = 0; i < 101; ++i) { for (int j = 0; j < 101; ++j) { for (int k = 0; k < c + 1; ++k) { if (i > 0) cnt[i][j][k] += cnt[i - 1][j][k]; if (j > 0) cnt[i][j][k] += cnt[i][j - 1][k]; if (i > 0 && j > 0) cnt[i][j][k] -= cnt[i - 1][j - 1][k]; } } } while (q--) { int t, x1, y1, x2, y2; cin >> t >> x1 >> y1 >> x2 >> y2; vector<vector<int> > cum(4, vector<int>(11)); cum[0] = cnt[x2][y2]; cum[1] = cnt[x2][y1 - 1]; cum[2] = cnt[x1 - 1][y1 - 1]; cum[3] = cnt[x1 - 1][y2]; vector<int> cur(11), cur2(11); for (int i = 0; i < c + 1; ++i) cur[i] = cum[0][i] - cum[1][i] - cum[3][i] + cum[2][i]; for (int i = 0; i < c + 1; ++i) cur2[(i + t) % (c + 1)] = cur[i]; int r = 0; for (int i = 0; i < c + 1; ++i) r += i * cur2[i]; cout << r << endl; } }
|
#include <bits/stdc++.h> using namespace std; int t[200005], revt[200005]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> t[i]; revt[t[i]]++; } int ans = 1; for (int i = 0; i <= n; i++) ans += max(0, revt[i] - 1); cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int l[maxn]; int r[maxn]; int mx[maxn]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; long long ans = n; for (int i = 1; i <= n; i++) { cin >> l[i] >> r[i]; } sort(l + 1, l + 1 + n); sort(r + 1, r + 1 + n); for (int i = 1; i <= n; i++) ans += max(r[i], l[i]); cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; bool vowel(char a) { a = toupper(a); if ((a == A ) || (a == E ) || (a == I ) || (a == O ) || (a == U )) return 1; return 0; } long long int n, m, q, a, b, c, sum = 0, cnt = 0; long long int arr[2000005]; map<long long int, bool> mp; string s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; arr[i]--; } cin >> s; long long int mn = 20000051, mx = 0; for (int i = 0; i < n; i++) { if (s[i] == 0 ) { if (arr[i] != i) { cout << NO << endl; return 0; } } else if (s[i] == 1 ) { mn = 20000051, mx = 0; int st = i; mn = min(arr[i], mn); mx = max(arr[i], mx); while (i < n && s[i] == 1 ) { mn = min(arr[i + 1], mn); mx = max(arr[i + 1], mx); i++; } if (mn != st || mx != i) { cout << NO << endl; return 0; } arr[i] = mx; } } cout << YES << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { string a[6], b[6], c[6]; a[0] = purple ; b[0] = Power ; a[1] = green ; b[1] = Time ; a[2] = blue ; b[2] = Space ; a[3] = orange ; b[3] = Soul ; a[4] = red ; b[4] = Reality ; a[5] = yellow ; b[5] = Mind ; int n, i, j, k = 0, flag = 0; int arr[6]; cin >> n; for (i = 0; i < n; i++) cin >> c[i]; for (i = 0; i < n; i++) { for (j = 0; j < 6; j++) { if (c[i] == a[j]) { arr[k] = j; k++; } } } cout << 6 - n << endl; for (i = 0; i < 6; i++) { flag = 0; for (k = 0; k < n; k++) if (i == arr[k]) flag = 1; if (flag == 0) cout << b[i] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int cur = 1; long long num = 1; while (cur != n + 1) { if (cur != 1) cout << cur * 1ll * cur * 1ll * cur + 2 * cur * cur + 1; else cout << 2; cout << endl; cur++; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, cnt[100005], root, par[100005], br[100005], st[100005], brcnt; vector<long long> a[100005]; pair<long long, long long> vert[100005]; map<pair<long long, long long>, long long> mm; set<long long> brcl; long long tmp = 1; void dfs(long long v) { if (a[v].size() > 0) for (long long i = 0; i <= a[v].size() - 1; ++i) { if (v == root) { brcnt++; st[brcnt] = tmp; } if (a[v][i] != par[v]) { br[a[v][i]] = brcnt; mm[make_pair(v, a[v][i])] = tmp++; par[a[v][i]] = v; dfs(a[v][i]); } } } inline long long finddist(long long req1, long long req2) { if (brcl.empty()) return req2 - req1 + 1; set<long long>::iterator curr = (brcl.lower_bound(req2)); if (*curr == req2) return -1; if (curr == brcl.begin()) return req2 - req1 + 1; curr--; if (*curr >= req1 && *curr <= req2) return -1; else return req2 - req1 + 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (long long i = 1; i <= n - 1; ++i) { long long u, v; cin >> u >> v; cnt[u]++; cnt[v]++; if (cnt[u] > 2) root = u; else if (cnt[v] > 2) root = v; a[u].push_back(v); a[v].push_back(u); vert[i] = make_pair(u, v); } if (root == 0) root = 1; par[root] = 0; dfs(root); for (long long i = 1; i <= n - 1; ++i) if (vert[i].second == par[vert[i].first]) swap(vert[i].first, vert[i].second); cin >> m; for (long long loop = 1; loop <= m; ++loop) { long long ty, id; cin >> ty >> id; if (ty == 1) { long long edge = mm[vert[id]]; set<long long>::iterator it = brcl.find(edge); brcl.erase(it); } else if (ty == 2) { long long edge = mm[vert[id]]; brcl.insert(edge); } else { long long en; cin >> en; if (en == id) { cout << 0 << endl; continue; } if (en == root) swap(en, id); if (id == root) { long long req1 = st[br[en]], req2 = mm[make_pair(par[en], en)]; cout << finddist(req1, req2) << endl; } else if (br[id] == br[en]) { if (mm[make_pair(par[en], en)] < mm[make_pair(par[id], id)]) swap(id, en); long long v; for (long long i = 0; i <= a[id].size() - 1; ++i) if (a[id][i] != par[id]) v = a[id][i]; long long req1 = mm[make_pair(id, v)], req2 = mm[make_pair(par[en], en)]; cout << finddist(req1, req2) << endl; } else { long long req1 = st[br[en]], req2 = mm[make_pair(par[en], en)]; long long dist = finddist(req1, req2); req1 = st[br[id]], req2 = mm[make_pair(par[id], id)]; cout << ((dist == -1 || finddist(req1, req2) == -1) ? -1 : (finddist(req1, req2) + dist)) << endl; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, c, pi, pj, max, a[10][10]; char s[10][10]; c = 3; for (i = 0; i < 6; i++) { if (i % 2 == 0 && i > 0) c--; a[i][0] = c; a[i][1] = c; } c = 4; for (i = 0; i < 6; i++) { if (i % 2 == 0 && i > 0) c--; a[i][3] = c; a[i][4] = c; } c = 3; for (i = 0; i < 6; i++) { if (i % 2 == 0 && i > 0) c--; a[i][6] = c; a[i][7] = c; } for (i = 0; i < 6; i++) cin >> s[i]; pi = -1; pj = -1; max = 0; for (i = 0; i < 6; i++) for (j = 0; j < 8; j++) if (j != 2 && j != 5) { if (s[i][j] == . ) { if (a[i][j] > max) { max = a[i][j]; pi = i; pj = j; } } } s[pi][pj] = P ; for (i = 0; i < 6; i++) cout << s[i] << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> A(n + 10, 0); for (int i = 0; i < n; i++) cin >> A[i]; unordered_map<long long, int> fir, sec; fir[A[0]] = 1; for (int i = 1; i < n; i++) sec[A[i]]++; long long S = 0; for (int i = 0; i < n; i++) S += A[i]; long long sdash = 0; if (S & 1) { cout << NO << endl; return 0; } for (int i = 0; i < n; i++) { sdash += A[i]; if (sdash == S / 2) { cout << YES ; return 0; } if (sdash < S / 2) { long long x = S / 2 - sdash; if (sec[x] > 0) { cout << YES ; return 0; } } else { long long y = sdash - S / 2; if (fir[y] > 0) { cout << YES ; return 0; } } fir[A[i + 1]]++; sec[A[i + 1]]--; } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, a, b, k; long long q; long long param = 0; string ciag; long long MOD = 1000000009; long long potega(long long a_1, long long n_1) { if (n_1 == 0) return 1; if (n_1 == 1) return a_1; else if (n_1 % 2 == 0) { long long s = potega(a_1, n_1 / 2); return (s * s) % MOD; } else { return (potega(a_1, n_1 - 1) * a_1) % MOD; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> a >> b >> k; cin >> ciag; q = (potega(b, k) * potega(a, MOD - 1 - k)) % MOD; if (q < 0) { q %= MOD; q += MOD; q %= MOD; } long long krotnosc = ((n + 1) / k); if (q != 1) { for (int i = 0; i < (k); ++i) { if (ciag[i] == - ) { long long a_1 = (potega(a, n - i) * potega(b, i)) % MOD; if (a_1 < 0) { a_1 %= MOD; a_1 += MOD; a_1 %= MOD; } long long temp_ = (((a_1 * ((potega(q, krotnosc) - 1 + MOD) % MOD) % MOD)) * (potega(q - 1, MOD - 2))) % MOD; if (temp_ < 0) { temp_ %= MOD; temp_ += MOD; temp_ %= MOD; } param = ((param - temp_) % MOD + MOD) % MOD; if (param < 0) { param %= MOD; param += MOD; param %= MOD; } } else { long long a_1 = (potega(a, n - i) * potega(b, i)) % MOD; if (a_1 < 0) { a_1 %= MOD; a_1 += MOD; a_1 %= MOD; } long long temp_ = (((a_1 * ((potega(q, krotnosc) - 1 + MOD) % MOD) % MOD)) * (potega(q - 1, MOD - 2))) % MOD; if (temp_ < 0) { temp_ %= MOD; temp_ += MOD; temp_ %= MOD; } param = (param + temp_) % MOD; if (param < 0) { param %= MOD; param += MOD; param %= MOD; } } } } else { for (int i = 0; i < (k); ++i) { if (ciag[i] == - ) { long long a_1 = (potega(a, n - i) * potega(b, i)) % MOD; if (a_1 < 0) { a_1 %= MOD; a_1 += MOD; a_1 %= MOD; } long long temp_ = (a_1 * krotnosc) % MOD; if (temp_ < 0) { temp_ %= MOD; temp_ += MOD; temp_ %= MOD; } param = ((param - temp_) % MOD + MOD) % MOD; if (param < 0) { param %= MOD; param += MOD; param %= MOD; } } else { long long a_1 = (potega(a, n - i) * potega(b, i)) % MOD; if (a_1 < 0) { a_1 %= MOD; a_1 += MOD; a_1 %= MOD; } long long temp_ = (a_1 * krotnosc) % MOD; if (temp_ < 0) { temp_ %= MOD; temp_ += MOD; temp_ %= MOD; } param = (param + temp_) % MOD; if (param < 0) { param %= MOD; param += MOD; param %= MOD; } } } } cout << (param + MOD) % MOD << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long double dist(long double x, long double y, long double a, long double b) { return sqrt((a - x) * (a - x) + (y - b) * (y - b)); } long double distMan(long double x, long double y, long double a, long double b) { return abs(x - a) + abs(y - b); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long tt = 1; while (tt--) { long double a, b, c; cin >> a >> b >> c; long double x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if (a == 0 || b == 0) { cout << << fixed << setprecision(20) << << abs(x1 - x2) + abs(y1 - y2) << n ; } else { long double ans = abs(x2 - x1) + abs(y2 - y1); long double x3, y3, x4, y4; x3 = x1, x4 = x2; y3 = (-a * x3 - c) / b, y4 = (-a * x4 - c) / b; ans = min(ans, distMan(x1, y1, x3, y3) + distMan(x2, y2, x4, y4) + dist(x4, y4, x3, y3)); x3 = x1, y4 = y2; y3 = (-a * x3 - c) / b, x4 = (-b * y4 - c) / a; ans = min(ans, distMan(x1, y1, x3, y3) + distMan(x2, y2, x4, y4) + dist(x4, y4, x3, y3)); y3 = y1, x4 = x2; x3 = (-b * y3 - c) / a, y4 = (-a * x4 - c) / b; ans = min(ans, distMan(x1, y1, x3, y3) + distMan(x2, y2, x4, y4) + dist(x4, y4, x3, y3)); y3 = y1, y4 = y2; x3 = (-b * y3 - c) / a, x4 = (-b * y4 - c) / a; ans = min(ans, distMan(x1, y1, x3, y3) + distMan(x2, y2, x4, y4) + dist(x4, y4, x3, y3)); cout << << fixed << setprecision(20) << << ans << n ; } } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long fp(long long x, long long y) { long long res = 1; while (y) res = (y & 1) ? res * x % mod : res, x = x * x % mod, y >>= 1; return res; } int t; int n, m, rb, cb, rd, cd, lx = 1, ly = 1; long long p; void dfs(int x, int y, int dx, int dy, vector<long long>& v) { int nx = x + dx, ny = y + dy; if (nx > n || nx < 1) dx = -dx; if (ny > m || ny < 1) dy = -dy; if ((x == rb && y == cb && v.size() != 0 && dx == lx && dy == ly)) return; if (x == rd || y == cd) v.push_back(p); else v.push_back(1); nx = x + dx, ny = y + dy; dfs(nx, ny, dx, dy, v); } int main() { scanf( %d , &t); while (t--) { scanf( %d%d%d%d%d%d%lld , &n, &m, &rb, &cb, &rd, &cd, &p); vector<long long> v; long long fz = 1; long long ny = fp(100, mod - 2), xx = 1; p = (100ll - p) * ny % mod; lx = 1, ly = 1; int nx = rb + lx, nn = cb + ly; if (nx > n || nx < 1) lx = -lx; if (nn > m || nn < 1) ly = -ly; dfs(rb, cb, lx, ly, v); for (int i = 0; i < (int)v.size(); i++) { fz = (fz * v[i]) % mod; } long long val = 0; for (int i = 0; i < (int)v.size(); i++) { xx = (v[i] * xx) % mod; val += xx; val %= mod; } fz = (1 - fz + mod) % mod; val = (val * fp(fz, mod - 2)) % mod; printf( %lld n , val); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 5005; int n, T; int pp[MAX]; int t[MAX]; double p[MAX]; double ps[MAX]; double pl[MAX]; double dp[2][MAX]; int main(void) { scanf( %d%d , &n, &T); for (int i = (0); i < (n); ++i) scanf( %d%d , pp + i, t + i); for (int i = (0); i < (n); ++i) { p[i] = 0.01 * pp[i]; double cp = 0.0; double lp = p[i]; for (int j = (0); j < (t[i] - 1); ++j) { cp *= (1.0 - p[i]); cp += p[i]; } for (int j = (0); j < (t[i] - 2); ++j) lp *= (1.0 - p[i]); ps[i] = 1.0 - cp; pl[i] = lp; } for (int i = n - 1; i >= 0; --i) { int I = i % 2; dp[I][0] = 0.0; for (int tt = 1; tt <= T; ++tt) { dp[I][tt] = dp[I][tt - 1]; if (t[i] == 1) { dp[I][tt] = 1.0 + dp[I ^ 1][tt - 1]; } else { if (tt - t[i] - 1 >= 0) dp[I][tt] -= ps[i] * (1 + dp[I ^ 1][tt - t[i] - 1]); if (tt - t[i] >= 0) dp[I][tt] -= pl[i] * (1.0 + dp[I ^ 1][tt - t[i]]); dp[I][tt] *= (1.0 - p[i]); dp[I][tt] += p[i] * (1.0 + dp[I ^ 1][tt - 1]); if (tt - t[i] >= 0) dp[I][tt] += ps[i] * (1.0 + dp[I ^ 1][tt - t[i]]); } } } printf( %.10lf n , dp[0][T]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long int n; cin >> n; ; long long int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long int dp[n]; memset(dp, 0, sizeof(dp)); long long int ans = 0; int c1 = 0; int f = 0; while (f == 0) { f = 1; for (int i = 0; i < n; i++) { if (dp[i] == 0 && a[i] >= c1) { dp[i] = 1; c1++; } } if (c1 > 0) { ans++; f = 0; } c1 = 0; } cout << ans; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; cin >> x >> t >> a >> b >> da >> db; if (x == 0) { cout << YES << endl; return 0; } for (int i = 0; i < t; i++) { if (a - da * i == x) { cout << YES << endl; return 0; } if (b - db * i == x) { cout << YES << endl; return 0; } } for (int i = 0; i < t; i++) { for (int j = 0; j < t; j++) { if (a - da * i + b - db * j == x) { cout << YES << endl; return 0; } } } cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; void FAST() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int gcd(int x, int y) { if (x == 0) return y; return gcd(y % x, x); } int powM(int x, int y, int m) { int ans = 1, r = 1; x %= m; while (r > 0 && r <= y) { if (r & y) { ans *= x; ans %= m; } r <<= 1; x *= x; x %= m; } return ans; } map<long long, long long> factorize(long long n) { map<long long, long long> ans; for (long long i = 2; i * i <= n; i++) { while (n % i == 0) { ans[i]++; n /= i; } } if (n > 1) { ans[n]++; n = 1; } return ans; } const double pi = 3.14159265; int main() { FAST(); int n; cin >> n; string s; cin >> s; int o = 0, c = 0; for (auto x : s) { if (x == ( ) o++; else c++; } if (o != c) cout << -1; else { int depth = 0, last = -1, ans = 0; for (int i = 0; i < n; i++) { if (s[i] == ( ) { depth++; } else { depth--; } if (depth == 0 && s[i] == ( ) { ans += (i - last); last = i; } if (depth == 0) last = i; } cout << ans; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using LL = long long int; struct point { LL x, y; point(LL x_ = 0, LL y_ = 0) : x(x_), y(y_) {} point operator-(const point& b) { return point(x - b.x, y - b.y); } point operator+(const point& b) { return point(x + b.x, y + b.y); } }; LL cross_abs(const point& a, const point& b) { return abs(a.x * b.y - b.x * a.y); } bool mult(const point& sp, const point& ep, const point& op) { return (sp.x - op.x) * (ep.y - op.y) >= (ep.x - op.x) * (sp.y - op.y); } bool operator<(const point& l, const point& r) { return (l.y < r.y) || (l.y == r.y && l.x < r.x); } int graham(point pnt[], int n, point res[]) { int i = 0, len = 0, k = 0, top = 1; sort(pnt, pnt + n); if (n == 0) return 0; res[0] = pnt[0]; if (n == 1) return 1; res[1] = pnt[1]; if (n == 2) return 2; res[2] = pnt[2]; for (i = 2; i < n; i++) { while (top && mult(pnt[i], res[top], res[top - 1])) top--; res[++top] = pnt[i]; } len = top; res[++top] = pnt[n - 2]; for (i = n - 3; i >= 0; i--) { while (top != len && mult(pnt[i], res[top], res[top - 1])) top--; res[++top] = pnt[i]; } return top; } int n = 0; LL ss = 0; const int maxn = 5e3 + 5; point p[maxn], cp[maxn]; LL maxs = 0; int ansa = 0, ansb = 0, ansc = 0; int main(void) { scanf( %d %lld , &n, &ss); for (int i = 0; i < n; ++i) scanf( %lld %lld , &p[i].x, &p[i].y); int cnt = graham(p, n, cp); for (int i = 0; i < cnt; ++i) { for (int j = i + 1, k = (j + 1) % cnt; j < cnt && k != i; ++j) { while (cross_abs(cp[i] - cp[k], cp[j] - cp[k]) < cross_abs(cp[i] - cp[(k + 1) % cnt], cp[j] - cp[(k + 1) % cnt])) k = (k + 1) % cnt; if (k == i || k == j) continue; LL s = cross_abs(cp[i] - cp[k], cp[j] - cp[k]); if (s > maxs) { maxs = s; ansa = i, ansb = j, ansc = k; } } } point a = cp[ansa] - cp[ansb] + cp[ansc]; point b = cp[ansa] + cp[ansb] - cp[ansc]; point c = cp[ansb] + cp[ansc] - cp[ansa]; printf( %lld %lld n , a.x, a.y); printf( %lld %lld n , b.x, b.y); printf( %lld %lld n , c.x, c.y); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } void solve() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; if (n == 1) { cout << 1 n ; return; } vector<long long> difs(n - 1); for (int i = 0; i < n - 1; i++) difs[i] = abs(a[i + 1] - a[i]); vector<long long> cj(n); vector<long long> fj(n); cj[n - 1] = 0; fj[n - 1] = 1; long long res = 0; for (int i = n - 2; i >= 0; i--) { if (gcd(difs[i], fj[i + 1]) > 1) { cj[i] = cj[i + 1] + 1; fj[i] = gcd(difs[i], fj[i + 1]); } else { cj[i] = int(difs[i] > 1ll); fj[i] = difs[i]; for (int k = 1; k < cj[i + 1]; k++) { if (gcd(fj[i], difs[i + k]) > 1) { cj[i]++; fj[i] = gcd(fj[i], difs[i + k]); } else break; } } res = max(res, cj[i]); } cout << res + 1 << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int tst; cin >> tst; while (tst--) solve(); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:247474112 ) #pragma GCC optimize( Ofast ) using namespace std; const long long maxn = 2e5 + 10; long long mx[maxn], val[maxn], sum[maxn]; vector<long long> g[maxn]; long long pass[maxn]; bool ok = 0; long long ans = LLONG_MIN; void dfs(long long aa = 1, long long aaa = 0) { vector<long long> v; sum[aa] = val[aa]; for (long long a : g[aa]) { if (a == aaa) continue; dfs(a, aa); sum[aa] += sum[a]; v.push_back(pass[a]); } if (!v.empty()) { sort(v.begin(), v.end()); pass[aa] = max(v.back(), sum[aa]); if (v.size() >= 2) { ans = max(ans, v[v.size() - 1] + v[v.size() - 2]); } } else { pass[aa] = sum[aa]; } } int32_t main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long n; cin >> n; for (long long i = 1; i <= n; ++i) cin >> val[i]; for (long long i = 1; i <= n; ++i) mx[i] = LLONG_MIN; for (long long i = 1; i < n; ++i) { long long u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } for (long long i = 1; i <= n; ++i) pass[i] = LLONG_MIN; dfs(1); if (ans == LLONG_MIN) cout << Impossible ; else cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long second; long long a1[1231], a2[2131]; long long b[1231]; long long sum[1231]; int main() { int n; cin >> n; for (int i = 2; i <= n; i++) cin >> a1[i]; for (int i = 1; i <= n - 1; i++) cin >> a2[i]; for (int i = 1; i <= n; i++) { cin >> b[i]; second += a1[i]; sum[i] = b[i] + second; } second = 0; for (int i = n; i >= 1; i--) { second += a2[i]; sum[i] += second; } sort(sum, sum + n + 1); cout << sum[1] + sum[2]; }
|
#include <bits/stdc++.h> using namespace std; long long inf; const double eps = 1e-8; const double pi = acos(-1.0); template <class T> long long chkmin(T &a, T b) { return a > b ? a = b, 1 : 0; } template <class T> long long chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; } template <class T> T sqr(T a) { return a * a; } template <class T> T mmin(T a, T b) { return a < b ? a : b; } template <class T> T mmax(T a, T b) { return a > b ? a : b; } template <class T> T aabs(T a) { return a < 0 ? -a : a; } template <class T> long long dcmp(T a, T b) { return a > b; } template <long long *a> long long cmp_a(long long first, long long second) { return a[first] < a[second]; } struct __INIT__ { __INIT__() { memset(&inf, 0x3f, sizeof(inf)); } } __INIT___; namespace io { const long long SIZE = (1 << 21) + 1; char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; long long f, qr; inline void flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; } inline void putc(char first) { *oS++ = first; if (oS == oT) flush(); } template <typename A> inline bool read(A &first) { for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++); c < 0 || c > 9 ; c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) if (c == - ) f = -1; else if (c == EOF) return 0; for (first = 0; c <= 9 && c >= 0 ; c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) first = first * 10 + (c & 15); first *= f; return 1; } inline bool read(char &first) { while ((first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) == || first == n || first == r ) ; return first != EOF; } inline bool read(char *first) { while ((*first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) == n || *first == || *first == r ) ; if (*first == EOF) return 0; while (!(*first == n || *first == || *first == r )) *(++first) = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++); *first = 0; return 1; } template <typename A, typename... B> inline bool read(A &first, B &...second) { return read(first) && read(second...); } template <typename A> inline bool write(A first) { if (!first) putc( 0 ); if (first < 0) putc( - ), first = -first; while (first) qu[++qr] = first % 10 + 0 , first /= 10; while (qr) putc(qu[qr--]); return 0; } inline bool write(char first) { putc(first); return 0; } inline bool write(const char *first) { while (*first) { putc(*first); ++first; } return 0; } inline bool write(char *first) { while (*first) { putc(*first); ++first; } return 0; } template <typename A, typename... B> inline bool write(A first, B... second) { return write(first) || write(second...); } struct Flusher_ { ~Flusher_() { flush(); } } io_flusher_; } // namespace io using io ::putc; using io ::read; using io ::write; long long a[100005], b[100005], f[100005], g[100005]; long long s[100005], t; long long n, k; struct smt { long long amn, bmn, atg; long long ls, rs; smt *l, *r; smt(long long la, long long ra) { amn = inf; bmn = -inf; atg = 0; ls = la; rs = ra; if (ls == rs) { l = r = 0; } else { long long mid = (ls + rs) >> 1; l = new smt(ls, mid); r = new smt(mid + 1, rs); } } void setg(long long first) { if (ls == rs) { amn = bmn = g[first]; return; } if (first <= l->rs) l->setg(first); else r->setg(first); amn = mmin(l->amn, r->amn); bmn = mmin(l->bmn, r->bmn); } void push_down() { l->atg += atg; l->amn += atg; r->atg += atg; r->amn += atg; atg = 0; } void add(long long la, long long ra, long long w) { if (la <= ls && rs <= ra) { atg += w; amn += w; return; } push_down(); if (la <= l->rs) l->add(la, ra, w); if (ra >= r->ls) r->add(la, ra, w); amn = mmin(l->amn, r->amn); } long long query(long long first, long long rm) { if (ls > rm) return 0; if (bmn - k > first) return 0; if (ls == rs) return ls; push_down(); if (mmin(first, l->amn) >= r->bmn - k) { long long ans = r->query(mmin(first, l->amn), rm); if (ans) return ans; } return l->query(first, rm); } }; smt *rt; signed main() { read(n, k); rt = new smt(1, n); for (long long i = 1; i < n; ++i) read(b[i]); for (long long i = 1; i <= n; ++i) read(a[i]); for (long long i = 1; i <= n; ++i) { f[i] = f[i - 1] + a[i - 1] - b[i - 1]; } for (long long i = 1; i <= n; ++i) { g[i] = g[i - 1] + b[i - 1] - a[i]; } long long ans = 0; for (long long i = n; i; --i) { rt->setg(i); while (t && f[s[t]] >= f[i]) { if (t > 1) { rt->add(s[t - 1] - 1, n, f[s[t]] - f[s[t - 1]]); } --t; } s[++t] = i; if (t > 1) assert(f[s[t]] >= f[s[t - 1]]); if (t > 1) { rt->add(s[t - 1] - 1, n, f[s[t - 1]] - f[s[t]]); } s[0] = n + 1; long long l = 1, r = t, mid; while (l <= r) { mid = (l + r) >> 1; if (f[i] - f[s[mid]] <= k) r = mid - 1; else l = mid + 1; } chkmax(ans, rt->query(inf, s[r] - 1) - i + 1); } write(ans, n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream &operator<<(ostream &out, pair<T1, T2> a) { out << a.first << << a.second; return out; } template <typename T, typename T1> T maxs(T &a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T mins(T &a, T1 b) { if (b < a) a = b; return a; } const long long MOD = 1000000007; struct mod_int { long long val; mod_int(long long v = 0) { if (v < 0) v = v % MOD + MOD; if (v >= MOD) v %= MOD; val = v; } static long long mod_inv(long long a, long long m = MOD) { long long g = m, r = a, first = 0, second = 1; while (r != 0) { long long q = g / r; g %= r; swap(g, r); first -= q * second; swap(first, second); } return first < 0 ? first + m : first; } explicit operator long long() const { return val; } mod_int &operator+=(const mod_int &other) { val += other.val; if (val >= MOD) val -= MOD; return *this; } mod_int &operator-=(const mod_int &other) { val -= other.val; if (val < 0) val += MOD; return *this; } static unsigned fast_mod(uint64_t first, unsigned m = MOD) { return first % m; unsigned x_high = first >> 32, x_low = (unsigned)first; unsigned quot, rem; asm( divl %4 n : =a (quot), =d (rem) : d (x_high), a (x_low), r (m)); return rem; } mod_int &operator*=(const mod_int &other) { val = fast_mod((uint64_t)val * other.val); return *this; } mod_int &operator/=(const mod_int &other) { return *this *= other.inv(); } friend mod_int operator+(const mod_int &a, const mod_int &b) { return mod_int(a) += b; } friend mod_int operator-(const mod_int &a, const mod_int &b) { return mod_int(a) -= b; } friend mod_int operator*(const mod_int &a, const mod_int &b) { return mod_int(a) *= b; } friend mod_int operator/(const mod_int &a, const mod_int &b) { return mod_int(a) /= b; } mod_int &operator++() { val = val == MOD - 1 ? 0 : val + 1; return *this; } mod_int &operator--() { val = val == 0 ? MOD - 1 : val - 1; return *this; } mod_int operator++(int32_t) { mod_int before = *this; ++*this; return before; } mod_int operator--(int32_t) { mod_int before = *this; --*this; return before; } mod_int operator-() const { return val == 0 ? 0 : MOD - val; } bool operator==(const mod_int &other) const { return val == other.val; } bool operator!=(const mod_int &other) const { return val != other.val; } mod_int inv() const { return mod_inv(val); } mod_int pow(long long p) const { assert(p >= 0); mod_int a = *this, result = 1; while (p > 0) { if (p & 1) result *= a; a *= a; p >>= 1; } return result; } friend ostream &operator<<(ostream &stream, const mod_int &m) { return stream << m.val; } friend istream &operator>>(istream &stream, mod_int &m) { return stream >> m.val; } }; const long long N = 1e5 + 5; vector<long long> g[N], in[N], out[N]; mod_int p[N]; pair<long long, long long> dp[4 * N][22]; long long te = 0, temp = 0; long long tin[N], LOG[4 * N], dep[N]; mod_int last = 1; void dfs(long long u, long long p) { dep[u] = dep[p] + 1; te++; tin[u] = te; dp[te][0] = {dep[u], u}; for (auto i : g[u]) { if (i != p) { dfs(i, u); te++; dp[te][0] = {dep[u], u}; } } } long long lca(long long u, long long v) { long long l = min(tin[u], tin[v]); long long r = max(tin[u], tin[v]); long long j = LOG[r - l + 1]; pair<long long, long long> p = min(dp[l][j], dp[r - (1 << j) + 1][j]); return p.second; } long long dis(long long u, long long v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; } long long ctree[N]; long long sz[N]; long long vis[N]; mod_int dp1[N], dp2[N]; mod_int dp3[N], dp4[N]; void dfs1(long long u, long long par) { sz[u] = 1; temp++; for (auto i : g[u]) { if (i != par && !vis[i]) { dfs1(i, u); sz[u] += sz[i]; } } } long long dfs2(long long u, long long par) { for (auto i : g[u]) { if (i != par && sz[i] > temp / 2 && !vis[i]) { return dfs2(i, u); } } return u; } void decompose(long long u, long long par) { temp = 0; dfs1(u, u); long long centroid = dfs2(u, u); ctree[centroid] = par; vis[centroid] = 1; for (auto i : g[centroid]) { if (vis[i]) continue; decompose(i, centroid); } } mod_int t = 0; void insert(long long u) { t += p[u] * dp1[u]; dp2[u] += p[u]; long long i = u; while (ctree[i] > 0) { long long par = ctree[i]; mod_int d = dis(u, par); t = t + d * p[u] * (dp2[par] - dp4[i]) + p[u] * (dp1[par] - dp3[i]); dp2[par] += p[u], dp4[i] += p[u]; dp1[par] += p[u] * d, dp3[i] += p[u] * d; i = ctree[i]; } } void remove(long long u) { long long i = u; t -= p[u] * dp1[u]; dp2[u] -= p[u]; while (ctree[i] > 0) { long long par = ctree[i]; mod_int d = dis(u, par); dp2[par] -= p[u]; dp4[i] -= p[u]; dp1[par] -= p[u] * d; dp3[i] -= p[u] * d; t = t - d * p[u] * (dp2[par] - dp4[i]) - p[u] * (dp1[par] - dp3[i]); i = ctree[i]; } } long long solve() { long long n; cin >> n; long long mx = 0; for (long long i = 1; i < n + 1; i++) { long long l; long long r; cin >> l >> r; in[l].push_back(i), out[r].push_back(i); mod_int val = r - l + 1; p[i] = val.inv(); last *= val; maxs(mx, r); } for (long long i = 0; i < n - 1; i++) { long long u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } dfs(1, 1); mod_int ans = 0; for (long long j = 1; j <= 20; j++) { for (long long i = 1; i + (1 << (j - 1)) <= te; i++) { dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]); } } decompose(1, 0); for (long long i = 1; i <= mx; i++) { for (auto j : in[i]) { insert(j); } ans += t; for (auto j : out[i]) { remove(j); } } cout << ans * last << n ; return 0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (long long i = 2; i < 4 * N; i++) { LOG[i] = 1 + LOG[i / 2]; } long long t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s[50]; bool ada[256] = {0}; double dekat[256]; for (int i = 0; i < 256; i++) dekat[i] = 1000000000.0; int n, m; double x; cin >> n >> m >> x; for (int i = 0; i < n; i++) cin >> s[i]; vector<pair<int, int> > v; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (s[i][j] == S ) v.push_back(make_pair(i, j)); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (s[i][j] == S ) continue; ada[s[i][j]] = 1; for (int k = 0; k < v.size(); k++) { double temp = sqrt((v[k].first - i) * (v[k].first - i) + (v[k].second - j) * (v[k].second - j)); dekat[s[i][j]] = min(dekat[s[i][j]], temp); } } } int q; cin >> q; string qw; cin >> qw; int ans = 0; for (int i = 0; i < qw.length(); i++) { if (ada[qw[i]] == 1) continue; if (qw[i] >= a && qw[i] <= z && v.size() > 0) { if (ada[qw[i] - 32] == 0) { ans = -1; break; } else { if (dekat[qw[i] - 32] > x) { ans++; } } } else if (qw[i] >= A && qw[i] <= Z && v.size() > 0) { if (ada[qw[i] + 32] == 0) { ans = -1; break; } else { if (dekat[qw[i] + 32] > x) { ans++; } } } else { ans = -1; break; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, cnt = 1, point = 0; vector<int> x; cin >> n; for (int i = 0; i < n; i++) { cin >> a >> b; if (b == 0) x.push_back(a); else { cnt += (b - 1); point += a; } } sort(x.begin(), x.end()); for (int j = x.size() - 1; j >= 0 && cnt > 0; j--, cnt--) { point += x[j]; } cout << point << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { char ch = getchar(); int nega = 1; while (!isdigit(ch)) { if (ch == - ) nega = -1; ch = getchar(); } int ans = 0; while (isdigit(ch)) { ans = ans * 10 + ch - 48; ch = getchar(); } if (nega == -1) return -ans; return ans; } int fa[200005 * 2], siz[200005 * 2], n; int find(int u) { return fa[u] == u ? u : fa[u] = find(fa[u]); } int a[200005], b[200005]; vector<int> v[200005]; void merge(int u, int v) { u = find(u), v = find(v); if (u == v) return; fa[u] = v; siz[v] += siz[u]; } bool vis[200005 * 2], ch[200005 * 2]; void work() { cin >> n; for (int i = 1; i <= n; i++) v[i].clear(); for (int i = 1; i <= n; i++) a[i] = read(), v[a[i]].push_back(i); for (int i = 1; i <= n; i++) b[i] = read(), v[b[i]].push_back(i + n); for (int i = 1; i <= 2 * n; i++) fa[i] = i; for (int i = 1; i <= n; i++) siz[i] = 1; for (int i = n + 1; i <= 2 * n; i++) siz[i] = 0; for (int i = 1; i <= n * 2; i++) vis[i] = ch[i] = 0; for (int i = 1; i <= n; i++) { if (v[i].size() != 2) { cout << -1 n ; return; } int a = v[i][0], b = v[i][1]; if (a > b) swap(a, b); if (a == b - n) continue; if (a > n) { a -= n, b -= n; merge(a, b + n), merge(a + n, b); } else if (b <= n) merge(a, b + n), merge(a + n, b); else { b -= n; merge(a, b), merge(a + n, b + n); } } for (int i = 1; i <= n; i++) { if (find(i) == find(i + n)) { cout << -1 n ; return; } } int ans = 0; for (int i = 1; i <= n; i++) { int u = find(i), v = find(i + n); if (vis[u] || vis[v]) continue; ans += min(siz[u], siz[v]); vis[u] = vis[v] = 1; if (siz[u] < siz[v]) ch[u] = 1; else ch[v] = 1; } cout << ans << endl; for (int i = 1; i <= n; i++) { int u = find(i); if (ch[u]) printf( %d , i); } cout << n ; } signed main() { int T = read(); while (T--) work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, x[101000], y[101000], fa[101000], sz[101000], tot[101000], u, v; map<int, vector<int> > xx, yy; map<int, vector<int> >::iterator it; long long ans = 1, er[202000]; int GF(int x) { return fa[x] == x ? x : fa[x] = GF(fa[x]); } void doit(vector<int> &the) { for (int i = 1; i < (int)the.size(); i++) if ((u = GF(the[i - 1])) != (v = GF(the[i]))) { sz[v] += sz[u]; tot[v] += tot[u]; fa[u] = v; } tot[GF(the[0])]++; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; xx[x[i]].push_back(i); yy[y[i]].push_back(i); fa[i] = i; sz[i] = 1; } for (it = xx.begin(); it != xx.end(); it++) doit(it->second); for (it = yy.begin(); it != yy.end(); it++) doit(it->second); er[0] = 1; for (int i = 1; i < 202000; i++) er[i] = er[i - 1] * 2 % 1000000007; for (int i = 1; i <= n; i++) if (fa[i] == i) ans = ans * (er[tot[i]] - (tot[i] > sz[i])) % 1000000007; cout << (ans + 1000000007) % 1000000007; }
|
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); int ans, pos[120000], fa[21][120000], tim, dep[120000], K, n, x, y; vector<int> E[120000]; struct wph { bool operator()(const int x, const int y) { return pos[x] < pos[y]; } }; set<int, wph> S; void prep(int x, int ff) { fa[0][x] = ff; for (int i = 1; i <= 20; ++i) fa[i][x] = fa[i - 1][fa[i - 1][x]]; } void dfs(int x, int ff) { pos[x] = ++tim; prep(x, ff); for (int i = 0; i < E[x].size(); ++i) if (E[x][i] != ff) { dep[E[x][i]] = dep[x] + 1; dfs(E[x][i], x); } } int pathlen(int x, int y) { int ans = dep[x] + dep[y]; if (dep[x] < dep[y]) swap(x, y); for (int i = 20; i >= 0; --i) if ((dep[x] - dep[y]) >= 1 << i) x = fa[i][x]; if (x == y) return ans - 2 * dep[x]; for (int i = 20; i >= 0; --i) if (fa[i][x] != fa[i][y]) x = fa[i][x], y = fa[i][y]; return ans - 2 * dep[fa[0][x]]; } int calc(set<int>::iterator it) { int len = 0; auto p1 = it, p2 = it; if (p1 == S.begin()) p1 = S.end(); p1--; len += pathlen(*p1, *it); p2++; if (p2 == S.end()) p2 = S.begin(); len += pathlen(*p2, *it); len -= pathlen(*p2, *p1); return len; } int main() { scanf( %d%d , &n, &K); for (int i = 1; i <= n - 1; ++i) { scanf( %d%d , &x, &y); E[x].push_back(y); E[y].push_back(x); } dfs(1, 0); ans = 1; S.insert(1); int j = 1, size = 0; for (int i = 2; i <= n; ++i) { auto p = S.insert(i).first; size += calc(p); while (size / 2 + 1 > K) { p = S.find(j); size -= calc(p); S.erase(p); j++; } ans = max(ans, i - j + 1); } printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const long long int lim = 1e17; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int T = clock(); long long int n, k; cin >> n >> k; map<long long int, long long int> mpp; vector<long long int> a(n); for (long long int i = 0; i < n; i++) cin >> a[i]; long long int tot = 0; mpp[0] = 1; long long int ans = 0; for (long long int i = 0; i < n; i++) { tot += a[i]; long long int r = 1; if (k == -1) { ans += mpp[tot - 1]; ans += mpp[tot + 1]; } else if (k == 1) ans += mpp[tot - 1]; else { while (r < lim) { if (mpp.find(tot - r) != mpp.end()) ans += mpp[tot - r]; r *= k; } } mpp[tot]++; } cout << ans; cerr << n nTIME: << (double)(clock() - T) / CLOCKS_PER_SEC << sec n ; T = clock(); return 0; }
|
#include <bits/stdc++.h> using namespace std; char a[103], b[103], c[103]; char aa[103], bb[103], cc[103]; char temp[103]; int temp2; char ss[602]; char s[602]; int n; int main() { scanf( %s%s%s , aa, bb, cc); scanf( %d , &n); int i, j, jj; int coun1 = 0, coun2 = 0, coun3 = 0; for (i = 0; aa[i]; i++) if (aa[i] != _ && aa[i] != ; && aa[i] != - ) a[coun1++] = aa[i]; for (i = 0; bb[i]; i++) if (bb[i] != _ && bb[i] != ; && bb[i] != - ) b[coun2++] = bb[i]; for (i = 0; cc[i]; i++) if (cc[i] != _ && cc[i] != ; && cc[i] != - ) c[coun3++] = cc[i]; for (i = 0; a[i]; i++) if (a[i] > 96) a[i] -= 32; for (i = 0; b[i]; i++) if (b[i] > 96) b[i] -= 32; for (i = 0; c[i]; i++) if (c[i] > 96) c[i] -= 32; if (coun1 < coun3) { for (i = 0; i < coun1; i++) temp[i] = a[i]; for (i = 0; i < coun3; i++) a[i] = c[i]; for (i = 0; i < coun1; i++) c[i] = temp[i]; temp2 = coun1; coun1 = coun3; coun3 = temp2; } if (coun1 < coun2) { for (i = 0; i < coun1; i++) temp[i] = a[i]; for (i = 0; i < coun2; i++) a[i] = b[i]; for (i = 0; i < coun1; i++) b[i] = temp[i]; temp2 = coun1; coun1 = coun2; coun2 = temp2; } if (coun2 < coun3) { for (i = 0; i < coun2; i++) temp[i] = b[i]; for (i = 0; i < coun3; i++) b[i] = c[i]; for (i = 0; i < coun2; i++) c[i] = temp[i]; temp2 = coun2; coun2 = coun3; coun3 = temp2; } a[coun1] = 0 ; b[coun2] = 0 ; c[coun3] = 0 ; int coun; bool flag; bool flag2; bool flagi[5]; for (i = 0; i < n; i++) { coun = 0; scanf( %s , ss); for (j = 0; j < 5; j++) flagi[j] = false; for (j = 0; ss[j]; j++) if (ss[j] != ; && ss[j] != _ && ss[j] != - ) s[coun++] = ss[j]; for (j = 0; j < coun; j++) if (s[j] > 96) s[j] -= 32; for (j = 0; j < coun; j++) { flag = false; flag2 = true; for (jj = 0; a[jj]; jj++) if (a[jj] != s[j + jj] || j + jj == coun) flag2 = false; if (flag2 && !flagi[0]) { flag = true; flagi[0] = true; j = j + jj - 1; continue; } flag2 = true; for (jj = 0; b[jj]; jj++) if (b[jj] != s[j + jj] || j + jj == coun) flag2 = false; if (flag2 && !flagi[1]) { flag = true; flagi[1] = true; j = j + jj - 1; continue; } flag2 = true; for (jj = 0; c[jj]; jj++) if (c[jj] != s[j + jj] || j + jj == coun) flag2 = false; if (flag2 && !flagi[2]) { flag = true; flagi[2] = true; j = j + jj - 1; continue; } if (!flag) break; if (j == coun - 1) break; } if (flag) { for (j = 0; j < 3; j++) if (!flagi[j]) flag = false; } if (flag) printf( ACC n ); else printf( WA n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; vector<int> arr; int dp[101][101][101][2]; int solve(int index, int even, int odd, int pre) { if (index == n + 1) return 0; if (dp[index][even][odd][pre] != -1) return dp[index][even][odd][pre]; if (arr[index] != 0) { int ans = solve(index + 1, even, odd, arr[index] % 2); if (pre != -1) { if ((arr[index] % 2) != pre) ans++; } return ans; } int ans = INT_MAX; if (even > 0) { ans = min(ans, solve(index + 1, even - 1, odd, 0) + (pre == 1)); } if (odd > 0) { ans = min(ans, solve(index + 1, even, odd - 1, 1) + (pre == 0)); } dp[index][even][odd][pre] = ans; return ans; } int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(NULL); cin >> n; for (int i = 0; i < 101; i++) { for (int j = 0; j < 101; j++) { for (int k = 0; k < 101; k++) { dp[i][j][k][0] = dp[i][j][k][1] = -1; } } } arr.resize(n + 1); int even = n / 2; int odd = (n + 1) / 2; for (int i = 1; i <= n; i++) { cin >> arr[i]; if (arr[i] % 2) odd--; else if (arr[i]) even--; } int ans = solve(1, even, odd, -1); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 5; int parent[MAX]; int depth[MAX]; int get(int a) { while (a != parent[a]) a = parent[a]; return a; } void join(int a, int b) { a = get(a); b = get(b); if (a == b) return; if (depth[a] > depth[b]) swap(a, b); parent[a] = b; depth[b] += depth[a]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, q, a, b, w; cin >> n >> q; for (int i = 1; i <= n + 1; i++) { parent[i] = i; depth[i] = 1; } vector<pair<int, pair<int, int>>> vp; vector<long long> sol(MAX); long long cnt = 0; for (int i = 0; i < n - 1; i++) { cin >> a >> b >> w; vp.push_back({w, {a, b}}); } sort(vp.begin(), vp.end()); reverse(vp.begin(), vp.end()); for (int j = 1; j < MAX; j++) { while (!vp.empty() && vp.back().first <= j) { a = vp.back().second.first; b = vp.back().second.second; vp.pop_back(); a = get(a); b = get(b); if (a == b) continue; cnt -= 1ll * depth[a] * (depth[a] - 1) / 2; cnt -= 1ll * depth[b] * (depth[b] - 1) / 2; join(a, b); a = get(a); cnt += 1ll * depth[a] * (depth[a] - 1) / 2; } sol[j] = cnt; } while (q--) { cin >> w; cout << sol[w] << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; getline(cin, s); long long n = s.length(), i = n - 1; while (1) { if ((s[i] >= 65 && s[i] <= 91) || (s[i] >= 97 && s[i] <= 122)) { if (s[i] == a || s[i] == y || s[i] == e || s[i] == i || s[i] == o || s[i] == u ) { cout << YES << endl; break; } else if (s[i] == A || s[i] == Y || s[i] == E || s[i] == I || s[i] == O || s[i] == U ) { cout << YES << endl; break; } else { cout << NO << endl; break; } } i--; } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 30; const long long inf = 1LL << 60; const int N = 200010; struct Edge { int to, next; } e1[N], e2[N]; int list1[N], list2[N], d1, d2; priority_queue<pair<int, int> > Q; queue<int> S; bool vis[N]; vector<int> v[N]; void add(int x, int y, int *list, int &d, Edge *e) { e[d].to = y, e[d].next = list[x], list[x] = d++; } int n, m, k; int ans[N], Min[N], din[N], dout[N], d[N]; int read() { int w(0), f(0); char c = getchar(); while ((c < 0 || c > 9 ) && c != - ) c = getchar(); if (c == - ) f = 1, c = getchar(); while (c >= 0 && c <= 9 ) w = w * 10 + c - 0 , c = getchar(); return f ? -w : w; } void Imps() { puts( -1 ); exit(0); } void Delete(int x) { int y; for (int i = list2[x]; i >= 0; i = e2[i].next) { y = e2[i].to; d[y]--; if (!d[y] && !ans[y]) Q.push(make_pair(Min[y], y)); } } int main() { n = read(), m = read(), k = read(); memset(list1, -1, 4 * (n + 1)), memset(list2, -1, 4 * (n + 1)); for (int i = 1; i <= n; ++i) ans[i] = read(), vis[ans[i]] = 1, v[ans[i]].push_back(i); int x, y; pair<int, int> tmp; for (int i = 1; i <= m; ++i) { x = read(), y = read(); add(y, x, list1, d1, e1); add(x, y, list2, d2, e2); din[x]++, dout[y]++; } for (int i = 1; i <= n; ++i) { d[i] = din[i]; if (!d[i]) S.push(i); } while (!S.empty()) { x = S.front(), S.pop(); if (ans[x]) { if (ans[x] < Min[x]) Imps(); else Min[x] = ans[x]; } else if (!Min[x]) Min[x] = 1; for (int i = list1[x]; i >= 0; i = e1[i].next) { y = e1[i].to; Min[y] = max(Min[y], Min[x] + 1); d[y]--; if (!d[y]) S.push(y); } } for (int i = 1; i <= n; ++i) { d[i] = dout[i]; if (!d[i] && !ans[i]) Q.push(make_pair(Min[i], i)); } for (int i = k; i >= 1; --i) { for (int j = 0; j < v[i].size(); ++j) { x = v[i][j]; Delete(x); } while (!Q.empty()) { tmp = Q.top(); if (tmp.first > i) Imps(); else if (tmp.first == i) ans[tmp.second] = i, vis[i] = 1, Q.pop(), Delete(tmp.second); else break; } if (!vis[i]) { if (!Q.empty()) { tmp = Q.top(); ans[tmp.second] = i, vis[i] = 1, Q.pop(), Delete(tmp.second); } else Imps(); } } for (x = 1; x <= n; ++x) for (int i = list1[x]; i >= 0; i = e1[i].next) if (ans[x] >= ans[e1[i].to]) Imps(); for (int i = 1; i <= n; ++i) printf( %d , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; int t; cin >> t; while (t--) { int n; cin >> n; long long move = 0; for (int i = 1; i <= n / 2; ++i) { move += i * 1ll * i; } cout << move * 8 << endl; } return 0; }
|
#include <bits/stdc++.h> int n, m, x, i, ans; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &x); if (x == 2) ++m; } if (n == 1) ans = 1; if (n == 2 && m == 0) ans = 2; if (n == 2 && m == 1) ans = 2; if (n == 2 && m == 2) ans = 2; if (n == 3 && m == 0) ans = 4; if (n == 3 && m == 1) ans = 6; if (n == 3 && m == 2) ans = 6; if (n == 3 && m == 3) ans = 6; if (n == 4 && m == 0) ans = 10; if (n == 4 && m == 1) ans = 16; if (n == 4 && m == 2) ans = 24; if (n == 4 && m == 3) ans = 24; if (n == 4 && m == 4) ans = 24; if (n == 5 && m == 0) ans = 26; if (n == 5 && m == 1) ans = 50; if (n == 5 && m == 2) ans = 80; if (n == 5 && m == 3) ans = 120; if (n == 5 && m == 4) ans = 120; if (n == 5 && m == 5) ans = 120; if (n == 6 && m == 0) ans = 76; if (n == 6 && m == 1) ans = 156; if (n == 6 && m == 2) ans = 300; if (n == 6 && m == 3) ans = 480; if (n == 6 && m == 4) ans = 720; if (n == 6 && m == 5) ans = 720; if (n == 6 && m == 6) ans = 720; if (n == 7 && m == 0) ans = 232; if (n == 7 && m == 1) ans = 532; if (n == 7 && m == 2) ans = 1092; if (n == 7 && m == 3) ans = 2100; if (n == 7 && m == 4) ans = 3360; if (n == 7 && m == 5) ans = 5040; if (n == 7 && m == 6) ans = 5040; if (n == 7 && m == 7) ans = 5040; if (n == 8 && m == 0) ans = 764; if (n == 8 && m == 1) ans = 1856; if (n == 8 && m == 2) ans = 4256; if (n == 8 && m == 3) ans = 8736; if (n == 8 && m == 4) ans = 16800; if (n == 8 && m == 5) ans = 26880; if (n == 8 && m == 6) ans = 40320; if (n == 8 && m == 7) ans = 40320; if (n == 8 && m == 8) ans = 40320; if (n == 9 && m == 0) ans = 2620; if (n == 9 && m == 1) ans = 6876; if (n == 9 && m == 2) ans = 16704; if (n == 9 && m == 3) ans = 38304; if (n == 9 && m == 4) ans = 78624; if (n == 9 && m == 5) ans = 151200; if (n == 9 && m == 6) ans = 241920; if (n == 9 && m == 7) ans = 362880; if (n == 9 && m >= 8) ans = 362880; if (n == 10 && m == 0) ans = 9496; if (n == 10 && m == 1) ans = 26200; if (n == 10 && m == 2) ans = 68760; if (n == 10 && m == 3) ans = 167040; if (n == 10 && m == 4) ans = 383040; if (n == 10 && m == 5) ans = 786240; if (n == 10 && m == 6) ans = 1512000; if (n == 10 && m == 7) ans = 2419200; if (n == 10 && m >= 8) ans = 3628800; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; while (cin >> x >> t >> a >> b >> da >> db) { bool f = 0; for (int i = 0; i <= t; i++) { for (int j = 0; j <= t; j++) { int t1, t2; if (i == t) t1 = 0; else t1 = a - i * da; if (j == t) t2 = 0; else t2 = b - j * db; if (t1 + t2 == x) { f = 1; break; } } } if (f) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> using namespace std; int n, ans; int a[19]; int inv[2000009]; int f[17009]; int tag[19]; int qpow(int a, int b) { int ans = 1; for (; b; b >>= 1, a = (long long)a * a % 1000000007) if (b & 1) ans = (long long)ans * a % 1000000007; return ans; } void init() { for (int i = 1; i <= 2000000; i++) inv[i] = qpow(i, 1000000007 - 2); } int main() { init(); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int s = 1; s < (1 << n); s++) { int sm = 0; for (int t = (s - 1) & s; t; t = (t - 1) & s) { int p = s ^ t, pb = 1; for (int i = 1; i <= n; i++) if (t >> (i - 1) & 1) for (int j = 1; j <= n; j++) if (p >> (j - 1) & 1) pb = (long long)pb * a[i] % 1000000007 * inv[a[i] + a[j]] % 1000000007; sm = (sm + (long long)f[t] * pb) % 1000000007; } f[s] = (1000000007 + 1 - sm) % 1000000007; } int ans = 0; for (int i = 1; i <= n; i++) for (int s = 1; s < (1 << n); s++) if (s >> (i - 1) & 1) { int pb = 1; for (int i = 1; i <= n; i++) if (s >> (i - 1) & 1) for (int j = 1; j <= n; j++) if (!(s >> (j - 1) & 1)) pb = (long long)pb * a[i] % 1000000007 * inv[a[i] + a[j]] % 1000000007; ans = (ans + (long long)f[s] * pb) % 1000000007; } printf( %d , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; void func(void) { freopen( input.c , r , stdin); freopen( output.c , w , stdout); } void print(vector<long long> &v) { cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { printf( %lld , v[i]); } printf( n ); } void print(vector<pair<long long, long long> > &v) { cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { printf( %lld %lld n , v[i].first, v[i].second); } } void print(double d) { cout << fixed << setprecision(10) << d << endl; } void print(string s, double d) { cout << s << ; cout << fixed << setprecision(10) << d << endl; } const int N = 1e5 + 100; struct info { long long day, cost, place; bool operator<(info k1) const { return day < k1.day; } }; vector<info> in; vector<info> out; set<pair<long long, long long> > outFlight[N]; long long inFlight[N]; int main() { long long n, q, i, j = 0, temp, t, k, ans = 0, sum = 0, x, y, z, cnt = 0, m, fg = 0, mx = 0, mx1 = 0, mn = 8e18, mn1 = 8000000000000000000; scanf( %lld %lld %lld , &n, &m, &k); for (int i = 0; i < m; i++) { scanf( %lld %lld , &x, &y); scanf( %lld %lld , &z, &t); info xx; xx.day = x; xx.place = y; if (y == 0) xx.place = z; xx.cost = t; if (y) in.push_back(xx); else out.push_back(xx); } sort(in.begin(), in.end()); sort(out.begin(), out.end()); for (int i = 0; i < N; i++) inFlight[i] = 1e10; int ok = 0; for (int i = 0; i < out.size(); i++) { outFlight[out[i].place].insert({out[i].cost, i}); } long long outSum = 0; long long inSum = 0; for (int i = 1; i <= n; i++) { if (outFlight[i].size() == 0) { printf( -1 n ); return 0; } auto it = outFlight[i].begin(); pair<long long, long long> p = *it; outSum += p.first; } cnt = 0; for (int i = 0; i < in.size(); i++) { long long now = in[i].day; long long place = in[i].place; long long cost = in[i].cost; if (inFlight[place] == 1e10) { inFlight[place] = cost; inSum += cost; cnt++; } else { inSum -= inFlight[place]; inFlight[place] = min(inFlight[place], cost); inSum += inFlight[place]; } now += k + 1; fg = 0; for (; ok < out.size(); ok++) { if (out[ok].day >= now) break; auto it = outFlight[out[ok].place].begin(); pair<long long, long long> p = *it; outSum -= p.first; p = {out[ok].cost, ok}; outFlight[out[ok].place].erase(p); if (outFlight[out[ok].place].size() == 0) { fg = 1; break; } it = outFlight[out[ok].place].begin(); p = *it; outSum += p.first; } if (fg) break; if (cnt == n) { mn = min(mn, inSum + outSum); } } if (mn == 8e18) mn = -1; cout << mn << endl; }
|
#include <bits/stdc++.h> using namespace std; int flag = 0, ans, n; int r[10], d[12], l[12], u[12]; int print(int x1, int y1, int x2, int y2) { cout << ? << x1 << << y1 << << x2 << << y2 << endl; int val; cin >> val; if (flag) { if (x1 <= l[0] && r[0] <= x2 && y1 <= d[0] && u[0] <= y2) return val - 1; } return val; } int findright(int l, int r) { if (l > r) return 0; int mid = (l + r) / 2; int val = print(1, 1, mid, n); if (val > 0) { ans = mid; findright(l, mid - 1); } else { findright(mid + 1, r); } return 0; } int findleft(int l, int r, int r1) { if (l > r) return 0; int mid = (l + r) / 2; int val = print(mid, 1, r1, n); if (val > 0) { ans = mid; findleft(mid + 1, r, r1); } else { findleft(l, mid - 1, r1); } return 0; } int findup(int l, int r, int l1, int r1) { if (l > r) return 0; int mid = (l + r) / 2; int val = print(l1, 1, r1, mid); if (val > 0) { ans = mid; findup(l, mid - 1, l1, r1); } else { findup(mid + 1, r, l1, r1); } return 0; } int finddown(int l, int r, int l1, int r1, int u1) { if (l > r) return 0; int mid = (l + r) / 2; int val = print(l1, mid, r1, u1); if (val > 0) { ans = mid; finddown(mid + 1, r, l1, r1, u1); } else { finddown(l, mid - 1, l1, r1, u1); } return 0; } int main() { std::ios::sync_with_stdio(false); int i; cin >> n; int r1, l1, u1, d1; findright(1, n); r1 = ans; findleft(1, r1, r1); l1 = ans; l[0] = l1; r[0] = r1; findup(1, n, l1, r1); u1 = ans; finddown(1, u1, l1, r1, u1); d1 = ans; u[0] = u1; d[0] = d1; flag = 1; findright(1, n); r1 = ans; findleft(1, r1, r1); l1 = ans; l[1] = l1; r[1] = r1; findup(1, n, l1, r1); u1 = ans; finddown(1, u1, l1, r1, u1); d1 = ans; u[1] = u1; d[1] = d1; cout << ! ; for (i = 0; i < 1; i++) { cout << l[i] << << d[i] << << r[i] << << u[i] << ; } i = 1; cout << l[i] << << d[i] << << r[i] << << u[i]; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = (int)2e5 + 88; char tu[maxn]; int lu[maxn]; int main() { int n, a, b, k; cin >> n >> a >> b >> k; scanf( %s , tu); for (int i = 0; i < maxn; i++) { lu[i] = 0; } int ans = 0; int ant = 0; int ttt = 0; for (int i = 0; i < n; i++) { if (tu[i] == 0 ) { ant++; } else ant = 0; if (ant != 0 && ant % b == 0) { ans++; if (ans >= a) { lu[ttt++] = i; } } } cout << ttt << endl; for (int i = 0; i < ttt; i++) { cout << lu[i] + 1 << ; } }
|
#include <bits/stdc++.h> using std::cerr; using std::cin; using std::cout; using std::endl; using std::list; using std::map; using std::max; using std::min; using std::pair; using std::set; using std::sort; using std::string; using std::swap; using std::vector; const int MAXN = 100005; const long long INF = 100000000009; const long long MOD = (long long)1e9 + 7; bool used[MAXN]; bool cnt[MAXN][50]; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int n; cin >> n; string sec; cin >> sec; for (int i = 0; i < n; ++i) { if (sec[i] != * ) { used[(int)sec[i]] = true; } } int m; cin >> m; vector<string> needed; for (int i = 0; i < m; ++i) { string s; cin >> s; bool flag = true; for (int j = 0; j < n; ++j) { if (sec[j] == * ) { if (used[(int)s[j]]) { flag = false; break; } } else if (sec[j] != s[j]) { flag = false; break; } } if (flag) { needed.push_back(s); } } for (int j = 0; j < needed.size(); ++j) { for (int i = 0; i < n; ++i) { if (sec[i] == * ) { cnt[j][(int)needed[j][i] - a ] = true; } } } int ans = 0; for (int i = 0; i <= (int) z - (int) a ; ++i) { bool flag = true; for (int j = 0; j < needed.size(); ++j) { if (!cnt[j][i]) { flag = false; } } if (flag) { ++ans; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> #pragma clang diagnostic push #pragma clang diagnostic ignored -Wunused-const-variable using namespace std; template <typename T> class Modular { public: using Type = typename decay<decltype(T::value)>::type; constexpr Modular() : value() {} template <typename U> Modular(const U& x) { value = normalize(x); } static Type inverse(Type a, Type mod) { Type b = mod, x = 0, y = 1; while (a != 0) { Type t = b / a; b -= a * t; x -= t * y; swap(a, b); swap(x, y); } if (x < 0) x += mod; return x; } template <typename U> static Type normalize(const U& x) { Type v; if (-mod() <= x && x < mod()) v = static_cast<Type>(x); else v = static_cast<Type>(x % mod()); if (v < 0) v += mod(); return v; } const Type& operator()() const { return value; } template <typename U> explicit operator U() const { return static_cast<U>(value); } constexpr static Type mod() { return T::value; } Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; } Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; } template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); } template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); } Modular& operator++() { return *this += 1; } Modular& operator--() { return *this -= 1; } Modular operator++(int) { Modular result(*this); *this += 1; return result; } Modular operator--(int) { Modular result(*this); *this -= 1; return result; } Modular operator-() const { return Modular(-value); } template <typename U = T> typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) { value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value)); return *this; } template <typename U = T> typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) { int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod()); value = normalize(value * rhs.value - q * mod()); return *this; } template <typename U = T> typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) { value = normalize(value * rhs.value); return *this; } Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); } template <typename U> friend const Modular<U>& abs(const Modular<U>& v) { return v; } template <typename U> friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs); template <typename U> friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs); template <typename U> friend std::istream& operator>>(std::istream& stream, Modular<U>& number); private: Type value; }; template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; } template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); } template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; } template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); } template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); } template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); } template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; } template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; } template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; } template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; } template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; } template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; } template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; } template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; } template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; } template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; } template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; } template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; } template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; } template <typename T, typename U> Modular<T> power(const Modular<T>& a, const U& b) { assert(b >= 0); Modular<T> x = a, res = 1; U p = b; while (p > 0) { if (p & 1) res *= x; x *= x; p >>= 1; } return res; } template <typename T> bool IsZero(const Modular<T>& number) { return number() == 0; } template <typename T> string to_string(const Modular<T>& number) { return to_string(number()); } template <typename T> std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) { return stream << number(); } template <typename T> std::istream& operator>>(std::istream& stream, Modular<T>& number) { typename common_type<typename Modular<T>::Type, int64_t>::type x; stream >> x; number.value = Modular<T>::normalize(x); return stream; } const int md = 1e9 + 7; using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>; long long sqr(long long x) { return x * x; } int mysqrt(long long x) { int l = 0, r = 1e9 + 1; while (r - l > 1) { int m = (l + r) / 2; if (m * (long long)m <= x) l = m; else r = m; } return l; } mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); mt19937_64 rndll( chrono::high_resolution_clock::now().time_since_epoch().count()); template <typename T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; } int gcdex(int a, int b, int& x, int& y) { if (a == 0) { x = 0; y = 1; return b; } int x1, y1; int ret = gcdex(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return ret; } void setmin(int& x, int y) { x = min(x, y); } void setmax(int& x, int y) { x = max(x, y); } void setmin(long long& x, long long y) { x = min(x, y); } void setmax(long long& x, long long y) { x = max(x, y); } const long long llinf = 4e18 + 100; const long double eps = 1e-9, PI = atan2(0, -1); const int maxn = 2e5 + 100, maxw = 1e4 + 100, inf = 1e9 + 100, sq = 450, LG = 18, mod = 1e9 + 933; int tp[maxn], h[maxn], n; vector<int> e[maxn]; long long q[maxn][2]; void dfs(int v, int par) { int X = 0, Y = 0; vector<long long> g; long long cur = 0; for (int i : e[v]) if (i != par) { dfs(i, v); if (h[i] == h[v]) { g.push_back(q[i][1] - q[i][0]); cur += q[i][0]; X++; } else if (h[i] < h[v]) { X++; cur += q[i][0]; } else { Y++; cur += q[i][1]; } } sort(g.begin(), g.end()); q[v][0] = q[v][1] = llinf; auto upd = [&](int t, int x, int y) { setmin(q[v][t], max(x, y) * (long long)tp[v] + cur); }; for (int i = 0; i <= g.size(); i++) { if (par == -1) upd(0, X, Y); else { upd(0, X, Y + 1); upd(1, X + 1, Y); } if (i < g.size()) { cur += g[i]; X--; Y++; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> tp[i]; for (int i = 0; i < n; i++) cin >> h[i]; for (int i = 1; i < n; i++) { int v, u; cin >> v >> u; v--; u--; e[v].push_back(u); e[u].push_back(v); } dfs(0, -1); cout << q[0][0] << n ; }
|
#include <bits/stdc++.h> using namespace std; int sum[501000 << 2], sum2[501000 << 2]; void pushUp(int rt) { sum[rt] = max(sum[rt * 2], sum[rt * 2 + 1]); } void updata(int l, int r, int rt, int q, int val) { if (l == q && r == q) { sum[rt] = val; return; } int m = (l + r) / 2; if (q <= m) updata(l, m, rt * 2, q, val); if (q > m) updata(m + 1, r, rt * 2 + 1, q, val); pushUp(rt); } int query(int l, int r, int rt, int ql, int qr) { if (l > qr || r < ql) return 0; if (l >= ql && r <= qr) return sum[rt]; int m = (l + r) / 2; return max(query(l, m, rt * 2, ql, qr), query(m + 1, r, rt * 2 + 1, ql, qr)); } void build(int l, int r, int rt) { if (l == r) { sum[rt] = 0; return; } int m = (l + r) / 2; build(l, m, rt * 2); build(m + 1, r, rt * 2 + 1); pushUp(rt); } void pushUp2(int rt) { sum2[rt] = min(sum2[rt * 2], sum2[rt * 2 + 1]); } void updata2(int l, int r, int rt, int q, int val) { if (l == q && r == q) { sum2[rt] = val; return; } int m = (l + r) / 2; if (q <= m) updata2(l, m, rt * 2, q, val); if (q > m) updata2(m + 1, r, rt * 2 + 1, q, val); pushUp2(rt); } int query2(int l, int r, int rt, int ql, int qr) { if (l > qr || r < ql) return 0; if (l >= ql && r <= qr) return sum2[rt]; int m = (l + r) / 2; return min(query2(l, m, rt * 2, ql, qr), query2(m + 1, r, rt * 2 + 1, ql, qr)); } void build2(int l, int r, int rt) { if (l == r) { sum2[rt] = 0; return; } int m = (l + r) / 2; build2(l, m, rt * 2); build2(m + 1, r, rt * 2 + 1); pushUp2(rt); } struct edge { int to; int next; } e[501000 << 1]; int box[501000], cnt, tot; int siz[501000], top[501000], son[501000], dep[501000], fa[501000], w[501000]; int we[501000]; int ww = 0; void init() { tot = 0; son[0] = dep[0] = 0; memset(box, -1, sizeof(box)); cnt = 0; } void add(int from, int to) { e[cnt].to = to; e[cnt].next = box[from]; box[from] = cnt++; } void dfs(int now, int pre) { siz[now] = 1; fa[now] = pre; son[now] = 0; dep[now] = dep[pre] + 1; int t, v; for (t = box[now]; t + 1; t = e[t].next) { v = e[t].to; if (v != pre) { dfs(v, now); siz[now] += siz[v]; if (siz[son[now]] < siz[v]) { son[now] = v; } } } } void dfs2(int now, int tp) { w[now] = ++ww; top[now] = tp; if (son[now]) dfs2(son[now], top[now]); int t, v; for (t = box[now]; t + 1; t = e[t].next) { v = e[t].to; if (v != fa[now] && v != son[now]) dfs2(v, v); } we[now] = ww; } int n, m; int solve(int a, int b) { int ma = 0; while (top[a] != top[b]) { if (dep[top[a]] < dep[top[b]]) swap(a, b); ma = max(ma, query(1, n, 1, w[top[a]], w[a])); a = fa[top[a]]; } if (dep[a] > dep[b]) swap(a, b); ma = max(ma, query(1, n, 1, w[a], w[b])); return ma; } int main() { scanf( %d , &n); init(); for (int i = 0; i < n - 1; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y); add(y, x); } build(1, n, 1); build2(1, n, 1); dfs(1, 0); dfs2(1, 1); scanf( %d , &m); for (int i = 1; i <= m; i++) { int q, x; scanf( %d%d , &q, &x); if (q == 1) { updata(1, n, 1, w[x], i); } else if (q == 2) { updata2(1, n, 1, w[x], -1 * i); } else { int zs = query2(1, n, 1, w[x], we[x]); int zx = solve(1, x); if (zx + zs > 0) { printf( 1 n ); } else printf( 0 n ); } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int i, n, k, s = 0, m; vector<pair<int, int> > v(110); scanf( %d , &n); scanf( %d , &k); for (i = 0; i < n; ++i) { scanf( %d , &v[i].first); v[i].second = i + 1; } sort(v.begin(), v.begin() + n); for (i = 0; s <= k && i < n; ++i) s = s + v[i].first; m = i; if (s > k) --m; printf( %d n , m); for (i = 0; i < m; ++i) printf( %d , v[i].second); }
|
#include <bits/stdc++.h> using namespace std; int read() { int v = 0, f = 1; char c = getchar(); while (c < 48 || 57 < c) { if (c == - ) f = -1; c = getchar(); } while (48 <= c && c <= 57) v = (v << 3) + v + v + c - 48, c = getchar(); return v * f; } const int N = 5e5 + 100, INF = 2e9; int val[N], a[N], b[N], n, m; set<pair<int, int> > S; struct node { node *ch[2], *fa; int sum, a, maxID, id; bool rev; node() { ch[0] = ch[1] = fa = this; sum = a = maxID = id = rev = 0; } node(int _a, int _id); }; node *null = new node; node *pool[N]; node ::node(int _a, int _id) { ch[0] = ch[1] = fa = null; sum = _a; a = _a; maxID = _id; id = _id; rev = 0; } bool isRoot(node *u) { return (u->fa->ch[0] != u) && (u->fa->ch[1] != u); } bool cmp(int x, int y) { return val[x] < val[y]; } void up(node *u) { u->sum = u->ch[0]->sum + u->ch[1]->sum + u->a; int t[3] = {u->ch[0]->maxID, u->ch[1]->maxID, u->id}; sort(t, t + 3, cmp); u->maxID = t[2]; } void putRev(node *u) { if (u == null) return; swap(u->ch[0], u->ch[1]); u->rev ^= 1; } void dn(node *u) { if (u->rev) { putRev(u->ch[0]); putRev(u->ch[1]); u->rev = 0; } } void rotate(node *u) { node *v = u->fa; bool w = u == v->ch[0]; if (!isRoot(v)) if (v->fa->ch[0] == v) v->fa->ch[0] = u; else v->fa->ch[1] = u; u->fa = v->fa; v->ch[!w] = u->ch[w]; u->ch[w]->fa = v; u->ch[w] = v; v->fa = u; up(v); up(u); } void splay(node *u) { static node *stk[N]; int top = 1; stk[1] = u; for (node *i = u; !isRoot(i); i = i->fa) stk[++top] = i->fa; for (int i = top; i >= 1; i--) dn(stk[i]); for (node *i; i = u->fa, !isRoot(u); rotate(u)) if (!isRoot(i)) rotate(u == i->ch[0] ^ i == i->fa->ch[0] ? u : i); } void access(node *u) { for (node *t = null; u != null; t = u, u = u->fa) { splay(u); u->a -= t->sum; u->a += u->ch[1]->sum; u->ch[1] = t; up(u); } } void makeRoot(node *u) { access(u); splay(u); putRev(u); } void link(node *u, node *v) { makeRoot(v); access(u); splay(u); u->a += v->sum; u->sum += v->sum; v->fa = u; } void cut(node *u, node *v) { makeRoot(u); access(v); splay(v); v->ch[0] = null; up(v); u->fa = null; } node *getRoot(node *u) { access(u); splay(u); while (u->ch[0] != null) u = u->ch[0]; return u; } int querySize(node *u) { access(u); splay(u); return u->sum; } bool queryOdd(int u) { cut(pool[n + u], pool[a[u]]); bool re = querySize(pool[a[u]]) & 1; link(pool[n + u], pool[a[u]]); return re; } int main() { n = read(), m = read(); if (n & 1) { while (m--) puts( -1 ); return 0; } for (int i = 1; i <= n; i++) pool[i] = new node(1, 0); int num = n; for (int i = 1; i <= m; i++) { a[i] = read(), b[i] = read(), val[i] = read(); node *u = pool[a[i]], *v = pool[b[i]]; if (getRoot(u) != getRoot(v)) { int sizU = querySize(u), sizV = querySize(v); pool[n + i] = new node(0, i); link(pool[n + i], u); link(pool[n + i], v); S.insert(make_pair(-val[i], i)); if ((sizU & 1) && (sizV & 1)) num -= 2; } else { makeRoot(u); access(v); splay(v); int t = v->maxID; if (val[i] < val[t]) { pool[n + i] = new node(0, i); S.erase(make_pair(-val[t], t)); cut(pool[n + t], pool[a[t]]); cut(pool[n + t], pool[b[t]]); S.insert(make_pair(-val[i], i)); link(pool[n + i], pool[a[i]]); link(pool[n + i], pool[b[i]]); } } if (num) puts( -1 ); else { while (1) { int t = (*S.begin()).second; if (!queryOdd(t)) { cut(pool[n + t], pool[a[t]]); cut(pool[n + t], pool[b[t]]); S.erase(S.begin()); } else { printf( %d n , val[t]); break; } } } } }
|
#include <bits/stdc++.h> using namespace std; long long n, x, f[101][101][101], g[101]; char s[101]; int main() { scanf( %I64d%I64d%s , &n, &x, s + 1); for (long long i = 1; i <= n; i++) f[s[i] - 0 ][i][i] = 1; g[0] = g[1] = 2; for (long long i = 2; i <= x; i++) g[i] = g[i - 1] * g[i - 2] % 1000000007; for (long long i = 2; i <= x; i++) for (long long l = 1; l <= n; l++) for (long long r = l; r <= n; r++) { for (long long m = l; m < r; m++) f[i][l][r] += f[i - 1][l][m] * f[i - 2][m + 1][r] % 1000000007, f[i][l][r] %= 1000000007; f[i][l][r] += f[i - 1][l][r] * (r == n ? g[i - 2] : 1) % 1000000007, f[i][l][r] %= 1000000007; f[i][l][r] += f[i - 2][l][r] * (l == 1 ? g[i - 1] : 1) % 1000000007, f[i][l][r] %= 1000000007; } return printf( %I64d n , f[x][1][n]), 0; }
|
#include <bits/stdc++.h> using namespace std; string s[110]; int n, d; int m; int main() { cin >> n >> d; cin >> m; for (int i = 0; i < m; ++i) { int x, y; cin >> x >> y; bool t = false; if (!((x - y) <= d && (x - y) >= -d)) t = true; if (!((x + y) <= n + n - d && (x + y) >= d)) t = true; if (t == true) s[i] = NO ; else s[i] = YES ; } for (int i = 0; i < m; i++) cout << s[i] << endl; return 0; }
|
#include <bits/stdc++.h> const int a = 1 << 18; using namespace std; long long odp[a], n, k, res; vector<int> v[a]; void dfs(int x, int pop) { for (int i = 0; i < v[x].size(); i++) { if (v[x][i] != pop) dfs(v[x][i], x), odp[x] += odp[v[x][i]], res += min(odp[v[x][i]], k - odp[v[x][i]]); } } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n >> k; k *= 2; for (int i = 0; i < k; i++) { int b; cin >> b; odp[b] = 1; } for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dfs(1, 1); cout << res; }
|
#include <bits/stdc++.h> char s[100], Ans[2000]; int n, m, ans, cnt, b[20], a[40][40], p[50], q[50], x[20][20]; void dfs(int c, int d) { if (d == 15) { memset(x, 0, sizeof(x)); for (int i = 1; i <= 28; i++) { if (x[b[p[i]]][b[q[i]]]) return; x[b[p[i]]][b[q[i]]] = x[b[q[i]]][b[p[i]]] = 1; } if (++ans == 1) { cnt = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) Ans[cnt++] = a[i][j] ? (b[a[i][j]] + 47) : . ; Ans[cnt++] = n ; } Ans[cnt] = 0 ; } } else { if (b[d]) { dfs(c, d + 1); return; } b[d] = c; for (int j = d + 1; j <= 14; j++) if (!b[j]) b[j] = c, dfs(c + 1, d + 1), b[j] = 0; b[d] = 0; } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , &s); for (int j = 0; j < m; j++) { if (s[j] != . && !a[i][j]) a[i][j] = a[i + 1][j] = a[i][j + 1] = a[i + 1][j + 1] = ++cnt; if (s[j] != . ) { int t = s[j] <= B ? s[j] - 64 : s[j] - 94; if (!p[t]) p[t] = a[i][j]; else q[t] = a[i][j]; } } } dfs(1, 1); printf( %d n%s , ans * 5040, Ans); }
|
#include <bits/stdc++.h> using namespace std; int b[8]; string str; int main() { int n, i; cin >> n >> str; for (i = 0; i <= (n - 1); i++) switch (str[i]) { case 2 : b[2]++; break; case 3 : b[3]++; break; case 4 : b[2] += 2, b[3]++; break; case 5 : b[5]++; break; case 6 : b[5]++, b[3]++; break; case 7 : b[7]++; break; case 8 : b[7]++, b[2] += 3; break; case 9 : { b[7]++; b[2]++; b[3] += 2; } } while (b[7]--) putchar( 7 ); while (b[5]--) putchar( 5 ); while (b[3]--) putchar( 3 ); while (b[2]--) putchar( 2 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(4); int r, c; cin >> r >> c; int a[r][c]; for (int i = 0; i < r; ++i) { for (int j = 0; j < c; ++j) { cin >> a[i][j]; } } long long sum = 0ll; if (a[r - 1][c - 1] <= a[r - 2][c - 1] || a[r - 1][c - 1] <= a[r - 1][c - 2]) { cout << -1 << n ; return 0; } sum += a[r - 1][c - 1]; for (int i = c - 2; i > 0; --i) { int choose; if (a[r - 1][i] != 0) choose = a[r - 1][i]; else choose = a[r - 1][i + 1] - 1; if (choose <= a[r - 1][i - 1] || choose <= a[r - 2][i] || choose >= a[r - 1][i + 1]) { cout << -1 << n ; return 0; } a[r - 1][i] = choose; sum += a[r - 1][i]; } if (a[r - 1][0] <= a[r - 2][0] || a[r - 1][0] >= a[r - 1][1]) { cout << -1 << n ; return 0; } sum += a[r - 1][0]; for (int i = r - 2; i > 0; --i) { if (a[i][c - 1] <= a[i - 1][c - 1] || a[i][c - 1] >= a[i + 1][c - 1] || a[i][c - 1] <= a[i][c - 2]) { cout << -1 << n ; return 0; } sum += a[i][c - 1]; for (int j = c - 2; j > 0; --j) { int choose; if (a[i][j] != 0) choose = a[i][j]; else choose = min(a[i][j + 1], a[i + 1][j]) - 1; if (choose >= a[i][j + 1] || choose >= a[i + 1][j] || choose <= a[i][j - 1] || choose <= a[i - 1][j]) { cout << -1 << n ; return 0; } a[i][j] = choose; sum += a[i][j]; } if (a[i][0] >= a[i][1] || a[i][0] >= a[i + 1][0] || a[i][0] <= a[i - 1][0]) { cout << -1 << n ; return 0; } sum += a[i][0]; } if (a[0][c - 1] <= a[0][c - 2] || a[0][c - 1] >= a[1][c - 1]) { cout << -1 << n ; return 0; } sum += a[0][c - 1]; for (int i = c - 2; i > 0; --i) { int choose; if (a[0][i] != 0) choose = a[0][i]; else choose = min(a[0][i + 1], a[1][i]) - 1; if (choose >= a[0][i + 1] || choose >= a[1][i] || choose <= a[0][i - 1]) { cout << -1 << n ; return 0; } a[0][i] = choose; sum += a[0][i]; } if (a[0][0] >= a[1][0] || a[0][0] >= a[0][1]) { cout << -1 << n ; return 0; } sum += a[0][0]; cout << sum << n ; return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) #pragma GCC optimize( O2 ) using namespace std; const int maxn = 1e4 + 123; int n, k; int a[maxn]; vector<int> ve[4]; long long sum; int main(int argc, char const *argv[]) { std::cin >> n; for (int i = 0; i < n; i++) { char s[3]; int val; std::cin >> s >> val; int id = 2 * (s[0] - 0 ) + (s[1] - 0 ); ve[id].push_back(val); } if (ve[1].size() < ve[2].size()) { swap(ve[1], ve[2]); } for (int i = 0; i <= 3; i++) { sort(ve[i].begin(), ve[i].end()); } long long cur = (long long)ve[3].size(); while (ve[3].size() > 0) { sum += ve[3][(long long)ve[3].size() - 1]; ve[3].pop_back(); } while (ve[2].size() > 0) { sum += ve[2][ve[2].size() - 1] + ve[1][(long long)ve[1].size() - 1]; ve[1].pop_back(); ve[2].pop_back(); } for (int i = 0; i < (int)ve[1].size(); i++) { ve[0].push_back(ve[1][i]); } sort(ve[0].begin(), ve[0].end()); while (cur > 0 && ve[0].size() > 0) { sum += ve[0][ve[0].size() - 1]; ve[0].pop_back(); cur--; } std::cout << sum << n ; return 0; }
|
#include <bits/stdc++.h> const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x3f3f3f3f3f3f3f3f; __inline__ __attribute__((always_inline)) unsigned int rnd() { static unsigned int seed = 416; return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13; } template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { return a >= 0 ? a : -a; } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b) { return a < b ? b : a; } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b) { return a < b ? a : b; } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) { (a < b) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) { (b < a) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void read(_Tp &x) { char ch(getchar()); bool f(false); while (ch < 48 || ch > 57) f |= ch == 45, ch = getchar(); x = ch & 15, ch = getchar(); while (ch >= 48 && ch <= 57) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar(); if (f) x = -x; } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) { read(t); read(args...); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b, const Args &...args) { return a < b ? min(a, args...) : min(b, args...); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b, const Args &...args) { return a < b ? max(b, args...) : max(a, args...); } __inline__ __attribute__((always_inline)) int read_str(char *s) { char ch(getchar()); while (ch == || ch == r || ch == n ) ch = getchar(); char *tar = s; *tar = ch, ch = getchar(); while (ch != && ch != r && ch != n && ch != EOF) *(++tar) = ch, ch = getchar(); return tar - s + 1; } const int N = 4000005; const int mod = 998244353; template <typename _Tp1, typename _Tp2> __inline__ __attribute__((always_inline)) void add(_Tp1 &a, _Tp2 b) { (a += b) >= mod && (a -= mod); } template <typename _Tp1, typename _Tp2> __inline__ __attribute__((always_inline)) void sub(_Tp1 &a, _Tp2 b) { (a -= b) < 0 && (a += mod); } long long ksm(long long a, long long b = mod - 2) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod, b >>= 1; } return res; } long long fac[N], inv[N], ifac[N]; void init() { fac[0] = fac[1] = inv[0] = inv[1] = ifac[0] = ifac[1] = 1; for (int i = 2; i < N; ++i) { fac[i] = fac[i - 1] * i % mod; inv[i] = inv[mod % i] * (mod - mod / i) % mod; ifac[i] = ifac[i - 1] * inv[i] % mod; } } __inline__ __attribute__((always_inline)) long long C(int n, int m) { if (n < m) return 0; return fac[n] * ifac[m] % mod * ifac[n - m] % mod; } long long f[N]; long long s1[N], s2[N], s3[N]; int main() { init(); long long n, m; read(n, m); for (int i = 0; i <= n; ++i) { if (i) s1[i] = s1[i - 1]; add(s1[i], fac[m + i - 1] * ifac[i] % mod); if (i) s2[i] = s2[i - 1], add(s2[i], fac[m + i - 1] * ifac[i - 1] % mod); long long _ = m * fac[i] % mod * fac[n - i] % mod * ifac[n + m] % mod; long long tmp = _ * C(n + m + 1, m + i + 1) % mod * (s1[i] * (i + 1) % mod - s2[i] + mod) % mod; long long coef = (mod + 1 - _ * C(n + m, m + i) % mod * ifac[i] % mod * fac[m + i - 1] % mod); f[i] = (tmp + _ * C(n + m, m + i) % mod * s3[i] % mod) * ksm(coef) % mod; s3[i + 1] = s3[i], add(s3[i + 1], fac[m + i - 1] * ifac[i] % mod * f[i] % mod); } printf( %lld n , f[n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; using namespace std; vector<pair<pair<int, int>, pair<int, int> > > a[300005]; vector<int> g1[300005]; vector<int> g2[300005]; string Max = , Min = ; int ansMax = 0; int ansMin = 0; bool used[300005]; void getMax(int cur) { ansMax++; used[cur]++; for (auto it : g1[cur]) { if (!used[it]) { getMax(it); } } } void getMin(int cur) { ansMin++; used[cur]++; for (auto it : g2[cur]) { if (!used[it]) { getMin(it); } } } void updateMax(int s) { queue<int> q; q.push(s); while (!q.empty()) { int u = q.front(); q.pop(); if (used[u]) { continue; } used[u]++; for (auto it : a[u]) { if (it.first.first == 1) { if (!used[it.second.second]) { q.push(it.second.second); g1[u].push_back(it.second.second); } } else { if (u == it.second.first) { if (!used[it.second.second]) { q.push(it.second.second); g1[u].push_back(it.second.second); } } else { if (!used[it.second.first]) { q.push(it.second.first); g1[u].push_back(it.second.first); Max[it.first.second] = - ; } } } } } } void updateMin(int s) { queue<int> q; q.push(s); while (!q.empty()) { int u = q.front(); q.pop(); if (used[u]) { continue; } used[u]++; for (auto it : a[u]) { if (it.first.first == 2) { if (u == it.second.first) { if (!used[it.second.second]) { Min[it.first.second] = - ; } } } } for (auto it : a[u]) { if (it.first.first == 1 && !used[it.second.second]) { g2[u].push_back(it.second.second); q.push(it.second.second); } } } } int main() { int n, m, s; scanf( %d%d%d , &n, &m, &s); int i, t, u, v; int d = 0; for (i = 0; i < m; i++) { scanf( %d%d%d , &t, &u, &v); if (t == 1) { a[u].push_back({{t, i}, {u, v}}); } else { a[u].push_back({{t, d}, {u, v}}); a[v].push_back({{t, d}, {u, v}}); d++; Max += + ; Min += + ; } } updateMax(s); memset(used, 0, sizeof used); getMax(s); printf( %d n , ansMax); cout << Max << endl; memset(used, 0, sizeof used); updateMin(s); memset(used, 0, sizeof used); getMin(s); printf( %d n , ansMin); cout << Min; return 0; }
|
#include <bits/stdc++.h> char s[520][520]; char q[520][520]; int main() { int n, m; scanf( %d , &n); memset(s, 0 , sizeof(s)); memset(q, 0 , sizeof(q)); q[1][1] = + , q[1][2] = + , q[2][1] = + , q[2][2] = * ; s[1][1] = + , s[1][2] = + , s[2][1] = + , s[2][2] = * ; m = 2; if (n == 0) printf( + n ); else { while (--n) { for (int i = 1; i <= m; ++i) for (int j = 1; j <= m; ++j) s[i][j] = q[i][j], s[i + m][j] = q[i][j], s[i][j + m] = q[i][j], s[i + m][j + m] = q[i][j] == + ? * : + ; for (int i = 1; i <= m * 2; ++i) for (int j = 1; j <= m * 2; ++j) q[i][j] = s[i][j]; m *= 2; } for (int i = 1; i <= m; ++i) printf( %s n , s[i] + 1); } }
|
#include <bits/stdc++.h> using namespace std; const int maxN = 110000; int t[4 * maxN], m; int get(int k) { int res = 0; for (int i = k; i >= 0; i = (i & (i + 1)) - 1) { res = max(res, t[i]); } return res; } void update(int k, int delta) { for (int i = k; i <= m; i |= (i + 1)) { t[i] = max(t[i], delta); } } int calculate(vector<pair<int, int> > borders) { pair<int, int> start = borders[0]; sort(borders.rbegin(), borders.rend()); for (int i = 0; i < borders.size(); ++i) { int current = get(borders[i].second - 1); update(borders[i].second, current + 1); if (borders[i] == start) { return current; } } } int a, b, c, d, n; struct rational { long long x, y; rational(long long x, long long y) : x(x), y(y) {} rational() : x(0), y(1) {} bool operator<(const rational &other) const { return x * other.y < other.x * y; } }; vector<pair<int, int> > compress(vector<rational> a, vector<rational> b) { set<rational> S; for (int i = 0; i < a.size(); ++i) { S.insert(a[i]); S.insert(b[i]); } map<rational, int> M; m = 0; for (set<rational>::iterator it = S.begin(); it != S.end(); ++it) { M[*it] = ++m; } vector<pair<int, int> > borders; for (int i = 0; i < a.size(); ++i) { borders.push_back(make_pair(M[a[i]], M[b[i]])); } return borders; } int main() { scanf( %d , &n); scanf( %d/%d%d/%d , &a, &b, &c, &d); vector<rational> u, v; for (int i = 0; i <= n; ++i) { long long x, y; if (i == 0) { x = y = 0; } else { cin >> x >> y; } u.push_back(rational(1000000LL * a + y * b - x * a, a + b)); v.push_back(rational(1000000LL * c + y * d - x * c, c + d)); } printf( %d n , calculate(compress(u, v))); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int in() { int x, y; y = scanf( %d , &x); return x; } const int N = 300003; int n, m, k; vector<int> g[N], gr[N]; int to[N], from[N], mark[N], res[N], din[N], rem; int x[N], r[N], y[N]; void out() { cout << -1 n ; exit(0); } void dfs(int v) { mark[v] = 1; for (int u : g[v]) if (mark[u] == 1) out(); else { if (!mark[u]) dfs(u); from[v] = max(from[v], from[u]); } from[v]++; if (r[v] > 0) { if (from[v] > r[v]) out(); from[v] = r[v]; } if (from[v] > k) out(); mark[v] = 2; } bool seen[N]; set<pair<int, int>> ss, qs; void updateRem() { while (rem > 0 && seen[rem]) { rem--; while (qs.size() && qs.rbegin()->first >= rem) { int v = qs.rbegin()->second; qs.erase({to[v], v}); ss.insert({from[v], v}); } } } void addSource(int v) { int x = to[v]; if (x >= rem) ss.insert({from[v], v}); else qs.insert({x, v}); } int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) r[i] = in(); for (int i = 0; i < m; i++) { x[i] = in() - 1; y[i] = in() - 1; g[x[i]].push_back(y[i]); gr[y[i]].push_back(x[i]); din[y[i]]++; } for (int i = 0; i < n; i++) if (!mark[i]) dfs(i); rem = k; fill(to, to + n, k); for (int i = 0; i < n; i++) { if (r[i] > 0) to[i] = min(to[i], r[i]); if (!din[i]) addSource(i); } for (int i = 0; i < n; i++) { if (ss.empty()) out(); int v = ss.rbegin()->second; ss.erase({from[v], v}); assert(to[v] >= rem); if (r[v] > 0) res[v] = r[v]; else res[v] = max(rem, from[v]); seen[res[v]] = true; updateRem(); for (int u : g[v]) { din[u]--; to[u] = min(to[u], res[v] - 1); if (to[u] < from[u]) out(); if (din[u] == 0) addSource(u); } } if (rem != 0) out(); for (int i = 0; i < m; i++) if (res[x[i]] <= res[y[i]]) out(); for (int i = 0; i < n; i++) cout << res[i] << ; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 4e5 + 5; pair<long long, long long> arr[N]; long long l[N]; long long s[N]; long long dp[N]; long long bit[N]; long long n; void update(long long idx, long long val) { while (idx <= n) { bit[idx] = max(bit[idx], val); idx += idx & -idx; } } long long query(long long idx) { long long res = 0; while (idx) { res = max(res, bit[idx]); idx -= idx & -idx; } return res; } int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { long long r, h; scanf( %lld%lld , &r, &h); arr[i] = pair<long long, long long>(r * r * h, -i); } sort(arr + 1, arr + n + 1); for (long long i = 1; i <= n; i++) { dp[i] = max(arr[i].first, query(-arr[i].second) + arr[i].first); update(-arr[i].second, dp[i]); } printf( %.7lf n , 3.14159265358979323846 * query(n)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int cnt[100001]; int main() { int n, k; cin >> n; int ans = 1; int m = n; while (n--) { cin >> k; cnt[k] = cnt[k - 1] + 1; ans = max(ans, cnt[k]); } cout << m - ans; }
|
#include <bits/stdc++.h> char year[10]; int main() { scanf( %s , year); int l = strlen(year) - 1; int num = 0, num2 = 0; for (int i = 0; i <= l; i++) { num = num * 10 + year[i] - 0 ; } for (int i = 1; i <= l; i++) num2 = num2 * 10 + year[i] - 0 ; int x = 1; for (int i = 1; i <= l; i++) x *= 10; printf( %d n , x - num2); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<tuple<int, int, int, int> > v(n); vector<int> used(n, 0); for (int i = 0; i < n; i++) { int a, b, c; cin >> a >> b >> c; v[i] = make_tuple(a, b, c, i); } sort(v.begin(), v.end()); map<pair<int, int>, vector<int> > m; for (int i = 0; i < n; i++) { pair<int, int> t = {get<0>(v[i]), get<1>(v[i])}; if (m.find(t) == m.end()) m[t] = vector<int>(); m[t].push_back(i); } for (auto t : m) { for (int i = 0; i + 1 < t.second.size(); i += 2) { cout << get<3>(v[t.second[i]]) + 1 << << get<3>(v[t.second[i + 1]]) + 1 << n ; used[get<3>(v[t.second[i]])] = 1; used[get<3>(v[t.second[i + 1]])] = 1; } } vector<tuple<int, int, int, int> > v1; for (int i = 0; i < v.size(); i++) { if (used[get<3>(v[i])] == 0) v1.push_back(v[i]); } map<int, vector<int> > m1; for (int i = 0; i < v1.size(); i++) { if (m1.find(get<0>(v1[i])) == m1.end()) { m1[get<0>(v1[i])] = vector<int>(); } m1[get<0>(v1[i])].push_back(i); } for (auto t : m1) { for (int i = 0; i + 1 < t.second.size(); i += 2) { cout << get<3>(v1[t.second[i]]) + 1 << << get<3>(v1[t.second[i + 1]]) + 1 << n ; used[get<3>(v1[t.second[i]])] = 1; used[get<3>(v1[t.second[i + 1]])] = 1; } } vector<tuple<int, int, int, int> > v2; for (int i = 0; i < v1.size(); i++) { if (used[get<3>(v1[i])] == 0) { v2.push_back(v1[i]); } } for (int i = 0; i < v2.size(); i += 2) { cout << get<3>(v2[i]) + 1 << << get<3>(v2[i + 1]) + 1 << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int a = 26; char c[10000], ans[10000]; int p[10000], ap[10000], perm[10000]; map<int, int> m; int main() { string s, st; cin >> s; int n = s.size(), x, t, last, y; x = 17576; for (int i = 0; i < 3; i++) { x /= a; t = 0; last = -1; cout << ? ; for (int j = 0; j < n; j++) { if (j % x == 0 || last != c[j]) { t = (t + 1) % a; } last = c[j]; c[j] = char(t + a ); cout << c[j]; } cout << endl; cin >> st; for (int j = 0; j < n; j++) { y = st[j] - a ; p[j] = p[j] * a + y; ap[j] = ap[j] * a + (c[j] - a ); } } cout << ! ; for (int i = 0; i < n; i++) m[ap[i]] = i; for (int i = 0; i < n; i++) perm[i] = m[p[i]]; for (int i = 0; i < n; i++) ans[perm[i]] = s[i]; for (int i = 0; i < n; i++) cout << ans[i]; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const int lim = 500000001; class TMain { private: int n, m, f[505][505], dis[505][505], ans[505][505], now[505]; public: int run() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i == j) f[i][j] = dis[i][j] = 0; else f[i][j] = dis[i][j] = lim; for (int i = 1; i <= m; i++) { int a, b, c; scanf( %d %d %d , &a, &b, &c); dis[a][b] = dis[b][a] = f[a][b] = f[b][a] = min(f[a][b], c); } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) now[j] = 0; for (int j = 1; j <= n; j++) for (int k = 1; k <= n; k++) if (j != k && f[i][j] + dis[j][k] == f[i][k]) now[k]++; for (int j = 1; j <= n; j++) for (int k = 1; k <= n; k++) if (f[i][j] + f[j][k] == f[i][k]) ans[i][k] += now[j]; } for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) if (f[i][j] == lim) printf( 0 ); else printf( %d , ans[i][j]); printf( n ); return 0; } } Main; int main() { return Main.run(); }
|
#include <bits/stdc++.h> using namespace std; int main() { long long k, n, s, p; cin >> k >> n >> s >> p; long long w = n / s; if (n % s != 0) w++; w *= k; long long ans = w / p; if (w % p != 0) ans++; cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)5e5 + 50; int n; int ans[N]; vector<int> G[N]; int q[N]; int dep[N]; vector<pair<int, int> > hist[N]; void upd(int u, int val) { q[u] = max(q[u], val); } void calc(int v, int p) { dep[v] = 0; for (int nxt : G[v]) { if (nxt == p) continue; calc(nxt, v); dep[v] = max(dep[nxt] + 1, dep[v]); } } void merge(vector<pair<int, int> > h1, vector<pair<int, int> > h2) { int r = 0; for (int i = 0; i < h1.size(); i++) { while (r < h2.size() && (h2[r].first >= h1[i].first)) { r++; } if (r - 1 >= 0 && h2[r - 1].second > 1) upd(2 * h1[i].first, h2[r - 1].second + h1[i].second - 2); } } void dfs(int v, int p = -1, int up_dep = -1) { vector<int> deps; if (up_dep != -1) deps.push_back(up_dep + 1); for (int nxt : G[v]) { if (nxt != p) deps.push_back(dep[nxt] + 1); } sort(deps.begin(), deps.end(), [](const int a, const int b) { return a > b; }); for (int i = 0; i < deps.size(); i++) { upd(2 * deps[i], i + 1); upd(2 * deps[i] - 1, i + 1); if (i > 0 && deps[i - 1] > deps[i]) upd(2 * deps[i] + 1, i + 1); } for (int i = 0; i < deps.size(); i++) { if (hist[v].empty() || hist[v].back().first != deps[i]) hist[v].push_back({deps[i], 1}); else hist[v].back().second++; } for (int i = 1; i < hist[v].size(); i++) hist[v][i].second += hist[v][i - 1].second; for (int nxt : G[v]) { if (nxt == p) continue; dfs(nxt, v, (deps.size() == 1 ? 0 : (deps[0] == dep[nxt] + 1 ? deps[1] : deps[0]))); merge(hist[nxt], hist[v]); merge(hist[v], hist[nxt]); } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); G[b].push_back(a); } for (int i = 0; i < n; i++) { ans[1] = max(ans[1], (int)G[i].size() + 1); } calc(0, -1); dfs(0); int rmax = 0; for (int i = (n - 1) / 2 * 2 + 1; i >= 2; i -= 2) { rmax = max(rmax, q[i]); ans[i] = rmax; } rmax = 0; for (int i = n / 2 * 2; i >= 2; i -= 2) { rmax = max(rmax, q[i]); ans[i] = rmax; } for (int i = 1; i <= n; i++) cout << max(ans[i], 1) << ; }
|
#include <cstdio> #include <iostream> #define ll long long using namespace std; int n , m , cnt = 0; const int N = 5e5 + 5; const int mod = 1e9 + 7; ll pow2[N]; int num[N] , fa[N]; int find(int x){ if(fa[x] == x) return x; return fa[x] = find(fa[x]); } int main(){ pow2[0] = 1; cin >> n >> m; for(int i = 1; i < N; i++) pow2[i] = 1ll * 2 * pow2[i - 1] % mod; for(int i = 1; i <= m + 1; i++) fa[i] = i; for(int i = 1; i <= n; i++){ int k; int x , y; scanf( %d , &k); if(k == 1){ scanf( %d , &x); y = m + 1; } else scanf( %d%d , &x , &y); int fx , fy; fx = find(x); fy = find(y); if(fx == fy) continue; fa[fx] = fy; num[++cnt] = i; } ll ans = pow2[cnt] % mod; cout << ans << << cnt << endl; for(int i = 1; i <= cnt; i++) printf( %d , num[i]); return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.