func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { string s[40] = { Washington , Adams , Jefferson , Madison , Monroe , Adams , Jackson , Van Buren , Harrison , Tyler , Polk , Taylor , Fillmore , Pierce , Buchanan , Lincoln , Johnson , Grant , Hayes , Garfield , Arthur , Cleveland , Harrison , Cleveland , McKinley , Roosevelt , Taft , Wilson , Harding , Coolidge , Hoover , Roosevelt , Truman , Eisenhower , Kennedy , Johnson , Nixon , Ford , Carter , Reagan }; int a; cin >> a; cout << s[a - 1] << n ; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } const int maxn = 1e6 + 5; int n, m; int a[maxn]; vector<int> g[maxn]; vector<pair<int, pair<int, int>>> edges; int par[maxn], siz[maxn]; int f(int x) { return par[x] == x ? x : par[x] = f(par[x]); } void join(int x, int y) { x = f(x); y = f(y); if (x == y) return; if (siz[x] < siz[y]) swap(x, y); siz[x] += siz[y]; par[y] = x; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; par[i] = i; siz[i] = 1; } for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); edges.push_back({min(a[u], a[v]), {u, v}}); } auto cmp = [](pair<int, pair<int, int>> p1, pair<int, pair<int, int>> p2) { return p1.first > p2.first; }; long double num = 0; long double den = 0; sort(edges.begin(), edges.end(), cmp); for (auto p : edges) { int wei = p.first; int u = f(p.second.first); int v = f(p.second.second); if (u == v) continue; long double paths = 1LL * siz[u] * siz[v]; den += paths; num += 1.0 * wei * paths; join(u, v); } long double ans = num / den; cout << fixed << setprecision(9) << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; class flow { private: int n; vector<int> head, d, cur; vector<tuple<int, ll, int>> edge; bool bfs(int s, int t) { d.assign(n, -1); queue<int> que; que.push(s); d[s] = 0; while (!que.empty()) { int u = que.front(); que.pop(); for (int i = head[u]; i != -1; i = get<2>(edge[i])) { int v = get<0>(edge[i]); if (get<1>(edge[i]) && d[v] == -1) { d[v] = d[u] + 1; if (v == t) { return true; } que.push(v); } } } return false; } ll dfs(int u, int t, ll f) { if (u == t) { return f; } ll res = f; for (int &i = cur[u]; i != -1 && res; i = get<2>(edge[i])) { int v = get<0>(edge[i]); ll &c = get<1>(edge[i]); if (d[v] == d[u] + 1 && c) { ll aug = dfs(v, t, min(res, c)); res -= aug; c -= aug; get<1>(edge[i ^ 1]) += aug; } } return f - res; } public: flow(int _n) { n = _n; head.assign(n, -1); } void insert_edge(int u, int v, ll c) { edge.emplace_back(v, c, head[u]); head[u] = edge.size() - 1; edge.emplace_back(u, 0, head[v]); head[v] = edge.size() - 1; } ll max_flow(int s, int t) { ll flow = 0; while (bfs(s, t)) { cur = head; flow += dfs(s, t, 1e18); } return flow; } }; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<vector<int>> dis(n, vector<int>(n, 1e9)); for (int i = 0; i < n; ++i) { dis[i][i] = 0; } for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; --u; --v; dis[u][v] = 1; dis[v][u] = 1; } for (int k = 0; k < n; ++k) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); } } } int s, b, k; cin >> s >> b >> k; vector<tuple<int, int, int, int>> ship; vector<vector<pair<int, int>>> base(n); for (int i = 0; i < s; ++i) { int x, a, f, p; cin >> x >> a >> f >> p; --x; ship.emplace_back(x, a, f, p); } for (int i = 0; i < b; ++i) { int x, d, g; cin >> x >> d >> g; --x; base[x].emplace_back(d, g); } for (int i = 0; i < n; ++i) { sort(base[i].begin(), base[i].end()); for (int j = 1; j < base[i].size(); ++j) { base[i][j].second = max(base[i][j].second, base[i][j - 1].second); } } vector<ll> gain(s); for (int i = 0; i < s; ++i) { int x = get<0>(ship[i]); int a = get<1>(ship[i]); int f = get<2>(ship[i]); int p = get<3>(ship[i]); gain[i] = -1e14; for (int j = 0; j < n; ++j) { if (dis[x][j] <= f && !base[j].empty() && a >= base[j][0].first) { gain[i] = max(gain[i], 1ll * (--upper_bound(base[j].begin(), base[j].end(), make_pair(a, (int)1e9))) ->second - p); } } } vector<bool> used(s); vector<pair<int, int>> rel; for (int i = 0; i < k; ++i) { int x, y; cin >> x >> y; --x; --y; used[x] = true; used[y] = true; rel.emplace_back(x, y); } int cnt = 0; ll ans = 0; vector<int> id(s, -1); for (int i = 0; i < s; ++i) { if (used[i]) { id[i] = cnt++; } else if (gain[i] > 0) { ans += gain[i]; } } flow G(cnt + 2); int S = cnt; int T = cnt + 1; for (int i = 0; i < s; ++i) { if (used[i]) { if (gain[i] > 0) { G.insert_edge(S, id[i], gain[i]); ans += gain[i]; } else if (gain[i] < 0) { G.insert_edge(id[i], T, -gain[i]); } } } for (int i = 0; i < k; ++i) { G.insert_edge(id[rel[i].first], id[rel[i].second], 1e18); } ans -= G.max_flow(S, T); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int FFTMOD = 119 << 23 | 1; const int INF = (int)1e9 + 23111992; const long long LINF = (long long)1e18 + 23111992; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return val < a ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } inline unsigned long long isqrt(unsigned long long k) { unsigned long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; } inline int sign(long double x, long double y) { return sign(x - y); } mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int mrand() { return abs((int)mt()); } inline int mrand(int k) { return abs((int)mt()) % k; } template <class num_t> struct SegmentTree { struct node_t { num_t max[2]; num_t pref[2]; num_t suff[2]; num_t pref2[2]; num_t suff2[2]; num_t lz; int size; node_t() { lz = 0; size = -1; } }; int n; vector<node_t> st; void init(int n_) { n = n_; st.resize(n << 2); } node_t merge(node_t u, node_t v) { if (u.size == -1) return v; if (v.size == -1) return u; node_t c; for (int i = (0); i < (2); ++i) { c.max[i] = max(u.max[i], v.max[i]); c.pref[i] = u.pref[i]; c.suff[i] = v.suff[i]; c.pref2[i] = u.pref2[i]; c.suff2[i] = v.suff2[i]; } for (int i = (0); i < (2); ++i) { if (u.pref[i] == u.size) { c.pref[i] = u.pref[i] + v.pref[i]; } if (v.suff[i] == v.size) { c.suff[i] = u.suff[i] + v.suff[i]; } if (u.pref[i ^ 1] == u.size) { c.pref2[i] = u.pref[i ^ 1] + v.pref2[i]; } if (v.suff[i ^ 1] == v.size) { c.suff2[i] = u.suff2[i] + v.suff[i ^ 1]; } if (u.pref2[i] == u.size) { chkmax(c.pref2[i], u.pref2[i] + v.pref[i]); } if (v.suff2[i] == v.size) { chkmax(c.suff2[i], u.suff[i] + v.suff2[i]); } } for (int i = (0); i < (2); ++i) { chkmax(c.pref2[i], c.pref[i]); chkmax(c.suff2[i], c.suff[i]); } for (int i = (0); i < (2); ++i) { chkmax(c.max[i], c.pref[i]); chkmax(c.max[i], c.suff[i]); chkmax(c.max[i], c.pref2[i]); chkmax(c.max[i], c.suff2[i]); chkmax(c.max[i], u.suff[i] + v.pref2[i]); chkmax(c.max[i], u.suff2[i] + v.pref[i]); } c.size = u.size + v.size; return c; } void build(int p, int L, int R, vector<int>& a) { if (L == R) { st[p].max[0] = st[p].max[1] = 1; for (int i = (0); i < (2); ++i) { st[p].pref[i] = st[p].pref2[i] = (a[L] == i); st[p].suff[i] = st[p].suff2[i] = (a[R] != i); } st[p].size = 1; return; } build(p << 1, L, L + R >> 1, a); build(p << 1 | 1, (L + R >> 1) + 1, R, a); st[p] = merge(st[p << 1], st[p << 1 | 1]); } void push(int p, int L, int R) { if (st[p].lz) { swap(st[p].max[0], st[p].max[1]); swap(st[p].pref[0], st[p].pref[1]); swap(st[p].suff[0], st[p].suff[1]); swap(st[p].pref2[0], st[p].pref2[1]); swap(st[p].suff2[0], st[p].suff2[1]); if (L < R) { st[p << 1].lz ^= st[p].lz; st[p << 1 | 1].lz ^= st[p].lz; } st[p].lz = 0; } } void upd(int p, int l, int r, int L, int R, num_t val) { push(p, L, R); if (r < L || R < l) return; if (l <= L && R <= r) { st[p].lz = val; push(p, L, R); return; } upd(p << 1, l, r, L, L + R >> 1, val); upd(p << 1 | 1, l, r, (L + R >> 1) + 1, R, val); st[p] = merge(st[p << 1], st[p << 1 | 1]); } node_t query(int p, int l, int r, int L, int R) { push(p, L, R); if (r < L || R < l) return node_t(); if (l <= L && R <= r) { return st[p]; } return merge(query(p << 1, l, r, L, L + R >> 1), query(p << 1 | 1, l, r, (L + R >> 1) + 1, R)); } void upd(int l, int r, num_t val) { upd(1, l, r, 0, n - 1, val); } node_t query(int l, int r) { return query(1, l, r, 0, n - 1); } }; SegmentTree<int> seg; void chemthan() { int n, q; cin >> n >> q; string s; cin >> s; vector<int> a(n); for (int i = (0); i < (n); ++i) a[i] = s[i] == > ; seg.init(n); seg.build(1, 0, n - 1, a); while (q--) { int l, r; cin >> l >> r; l--, r--; seg.upd(l, r, 1); cout << seg.query(l, r).max[0] << n ; } } int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0), cin.tie(0); if (argc > 1) { assert(freopen(argv[1], r , stdin)); } if (argc > 2) { assert(freopen(argv[2], wb , stdout)); } chemthan(); cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int T; cin >> T; while (T--) { long long a, b, c, d; cin >> a >> b >> c >> d; d -= min(a, d / c) * c; if (d > b) puts( NO ); else puts( YES ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s[10]; s[0] = O-|-OOOO ; s[1] = O-|O-OOO ; s[2] = O-|OO-OO ; s[3] = O-|OOO-O ; s[4] = O-|OOOO- ; s[5] = -O|-OOOO ; s[6] = -O|O-OOO ; s[7] = -O|OO-OO ; s[8] = -O|OOO-O ; s[9] = -O|OOOO- ; int n; cin >> n; if (n == 0) cout << s[0] << endl; while (n != 0) { int z = n % 10; cout << s[z] << endl; n /= 10; } return 0; } |
#include <bits/stdc++.h> using namespace std; int ROW[] = {+0, +0, -1, +1}; int COL[] = {+1, -1, +0, +0}; int X[] = {+0, +0, +1, -1, -1, +1, -1, +1}; int Y[] = {-1, +1, +0, +0, +1, +1, -1, -1}; int KX[] = {-2, -2, -1, -1, 1, 1, 2, 2}; int KY[] = {-1, 1, -2, 2, -2, 2, -1, 1}; long long calc(long long num, long long val, long long cnt1, long long cnt2) { while (cnt1 >= cnt2) { num /= val; cnt1--; } return num; } int main() { int t; scanf( %d , &t); while (t--) { long long p, q, n, m; scanf( %lld %lld , &p, &q); n = p; m = q; if (p % q) { printf( %lld n , p); continue; } map<long long, long long> mp, mpp; for (long long i = 2; i * i <= q; i++) { if (q % i) continue; while (q % i == 0) { mp[i]++; q /= i; } } if (q > 1) mp[q]++; long long ans = 1LL; for (auto it : mp) { while (p % it.first == 0) { p /= it.first; mpp[it.first]++; } ans = max(ans, calc(n, it.first, mpp[it.first], it.second)); } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int poz, sol; int main() { sol = INT_MAX; cin >> s; int n = s.size(); for (int c = 1; c <= 26; c++) { char ch = c + a - 1; poz = -1; int maxx = 0; for (int i = 0; i < n; i++) { if (s[i] == ch) { if (i - poz > maxx) maxx = i - poz; poz = i; } } if (n - poz > maxx) maxx = n - poz; if (sol > maxx) sol = maxx; } cout << sol; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n << ; for (int i = 1; i < n; ++i) cout << i << ; } |
#include <bits/stdc++.h> int main() { int n, m; int sum = 0; int a, b; int i = 0; int x[1010] = {0}, y[1010] = {0}; scanf( %d %d , &n, &m); while (m-- > 0) { scanf( %d %d , &a, &b); y[a] = 1; x[b] = 1; } for (i = 2; i <= n - 1; i++) { if (x[i] == 0) sum++; if (y[i] == 0) sum++; } if (n % 2 == 1 && x[n / 2 + 1] == 0 && y[n / 2 + 1] == 0) sum--; printf( %d n , sum); return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long n, w; cin >> n >> w; vector<long long> arr(n); for (long long i = 0; i < n; ++i) cin >> arr[i]; vector<long long> runsum(n); long long min_elem = arr[0]; long long max_elem = arr[0]; vector<long long> run(n); long long cur = 0; long long tillnow = -1e9; for (long long i = 0; i < n; ++i) { cur = max(arr[i], cur + arr[i]); tillnow = max(tillnow, cur); } if (tillnow > w) { cout << 0 << endl; return 0; } max_elem = tillnow; cur = 0; tillnow = 1e9; for (long long i = 0; i < n; ++i) { cur = min(arr[i], cur + arr[i]); tillnow = min(tillnow, cur); } if (tillnow < -w) { cout << 0 << endl; return 0; } min_elem = tillnow; long long answer = w - max(abs(max_elem), abs(min_elem)) + 1; cout << answer << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void ASS(bool bb) { if (!bb) { ++*(int*)0; } } #pragma comment(linker, /STACK:106777216 ) int main() { int a, b, m; cin >> a >> b >> m; for (int i = 0; i < (int)(min(a + 1, m)); i++) { int x = i * (long long)1000000000 % m; x = (m - x) % m; if (x > b) { printf( 1 %09d n , i); return 0; } } cout << 2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int start, ed = 0, sz = 130000000; long long marked[(130000000 / 64) + 5]; vector<int> primes; inline bool check(int pos) { return !(marked[pos / 64] & (1LL << (pos % 64))); } int pos; bool isPrime(int n) { if (n != 2 and n % 2 == 0) return false; int sq = sqrt(n); for (int i = 3; i <= sq; i += 2) { if (n % i == 0) return false; } return true; } void genPrimes(int n) { int sq = sqrt(n); for (int i = 2; i <= sq; i++) { if (isPrime(i)) primes.push_back(i); } } void segSieve(int L, int R) { if (L <= 1 and R >= 1) pos = 1 - start, marked[pos / 64] |= (1LL << (pos % 64)); int sq = sqrt(R), st; for (int i = 0; primes[i] <= sq and i < primes.size(); i++) { if (L <= primes[i]) st = primes[i] + primes[i]; else st = ((L + primes[i] - 1) / primes[i]) * primes[i]; for (int j = st; j <= R; j += primes[i]) { pos = j - start, marked[pos / 64] |= (1LL << (pos % 64)); } } } unsigned int ans = 0, a, b, c, d; inline unsigned int F(unsigned int x) { return x * (x * (a * x + b) + c) + d; } void call(int n) { int sum = 0; long long cur; for (int i = 2; i <= n; i++) { if (i > ed) { memset(marked, 0, sizeof(marked)); start = ed + 1; ed = start + sz - 1; segSieve(start, min(ed, 300000000)); } if (!check(i - start)) continue; cur = i, sum = 0; while (cur <= n) { sum += (n / cur); cur *= i; } ans += sum * F(i); } } int main() { int n; cin >> n >> a >> b >> c >> d; genPrimes(n); call(n); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int l, r; int num; } Treex[4000009], Treey[4000009]; map<int, int> vis; int i; int tot = 1; int Tot = 1; int x, y; char str[5]; void update_y(int ll, int rr, int c, int l, int r, int t) { if (ll <= l && r <= rr) Treey[t].num = max(Treey[t].num, c); else { if (ll <= ((l + r) >> 1)) { if (!Treey[t].l) Treey[t].l = ++tot; update_y(ll, rr, c, l, ((l + r) >> 1), Treey[t].l); } if (rr > ((l + r) >> 1)) { if (!Treey[t].r) Treey[t].r = ++tot; update_y(ll, rr, c, ((l + r) >> 1) + 1, r, Treey[t].r); } } } void update_x(int ll, int rr, int c, int l, int r, int t) { if (ll <= l && r <= rr) Treex[t].num = max(Treex[t].num, c); else { if (ll <= ((l + r) >> 1)) { if (!Treex[t].l) Treex[t].l = ++Tot; update_x(ll, rr, c, l, ((l + r) >> 1), Treex[t].l); } if (rr > ((l + r) >> 1)) { if (!Treex[t].r) Treex[t].r = ++Tot; update_x(ll, rr, c, ((l + r) >> 1) + 1, r, Treex[t].r); } } } void query_x(int c, int l, int r, int rt) { i = max(i, Treex[rt].num); if (l == r) return; if (((l + r) >> 1) >= c) query_x(c, l, ((l + r) >> 1), Treex[rt].l); else query_x(c, ((l + r) >> 1) + 1, r, Treex[rt].r); } void query_y(int c, int l, int r, int rt) { i = max(i, Treey[rt].num); if (l == r) return; if (((l + r) >> 1) >= c) query_y(c, l, ((l + r) >> 1), Treey[rt].l); else query_y(c, ((l + r) >> 1) + 1, r, Treey[rt].r); } int main() { int n, q; scanf( %d%d , &n, &q); update_x(0, n, 0, 0, n, 1); update_y(0, n, 0, 0, n, 1); while (q--) { scanf( %d%d%s , &x, &y, str); if (vis[x]) { puts( 0 ); } else { vis[x] = 1; i = 0; if (str[0] == U ) { query_x(x, 0, n, 1); printf( %d n , y - i); update_y(i, y, x, 0, n, 1); } else { query_y(y, 0, n, 1); printf( %d n , x - i); update_x(i, x, y, 0, n, 1); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long PINF = 1E9; const long long NINF = -1E9; const long long M = 1E9 + 7; const double EPS = 1E-9; const double PI = 2 * acos(0); void print_arr(const vector<long long> &a) { for (int i = 0; i < (int)a.size(); i++) cout << a[i] << ; cout << n ; } int m; vector<long long> weights, ans; bool visited[1001][11][11]; void dfs(int step, int balance, int prev_weight) { if (visited[step][balance][prev_weight]) return; visited[step][balance][prev_weight] = true; if (step == m) { cout << YES << n ; print_arr(ans); exit(0); } for (int i = 0; i < (int)weights.size(); i++) { int w = weights[i]; if (prev_weight != w && abs(balance) < w) { ans[step] = w; if (step % 2 == 0) dfs(step + 1, balance + w, w); else dfs(step + 1, balance - w, w); } ans[step] = 0; } visited[step][balance][prev_weight] = false; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; for (int i = 0; i < 10; i++) { if (s[i] == 1 ) weights.push_back(i + 1); } cin >> m; ans.resize(m); dfs(0, 0, 0); cout << NO << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); } template <class T> inline T lcm(T a, T b) { a = abs(a); b = abs(b); return (a / gcd(a, b)) * b; } template <class T, class X> inline bool getbit(T a, X i) { T t = 1; return ((a & (t << i)) > 0); } template <class T, class X> inline T setbit(T a, X i) { T t = 1; return (a | (t << i)); } template <class T, class X> inline T resetbit(T a, X i) { T t = 1; return (a & (~(t << i))); } inline long long power(long long a, long long b) { long long multiply = 1; for (int i = (0); i < (b); i++) { multiply *= a; } return multiply; } vector<int> v[102]; int main() { int n, m, x; int first = 0, second = 0; cin >> n; for (int i = (0); i < (n); i++) { cin >> m; for (int j = (0); j < (m); j++) { cin >> x; v[i].push_back(x); } } vector<int> rest; for (int i = (0); i < (n); i++) { if (v[i].size() % 2 == 0) { for (int j = (0); j < (v[i].size() / 2); j++) first += v[i][j]; for (int j = (v[i].size() / 2); j < (v[i].size()); j++) second += v[i][j]; } else { for (int j = (0); j < (v[i].size() / 2); j++) first += v[i][j]; for (int j = (v[i].size() / 2 + 1); j < (v[i].size()); j++) second += v[i][j]; } } for (int j = (0); j < (n); j++) { if (v[j].size() % 2 == 0) continue; rest.push_back(v[j][v[j].size() / 2]); } sort(rest.begin(), rest.end(), greater<int>()); for (int j = (0); j < (rest.size()); j++) { if (j % 2 == 0) first += rest[j]; else second += rest[j]; } cout << first << << second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct edge { int t, nxt; } e[600010]; int n, cnt, be[300010], mn_mx[300010], f, vid[300010], tot; void add(const int& x, const int& y) { e[++cnt].t = y, e[cnt].nxt = be[x], be[x] = cnt; } void dfs(const int& x) { if (!be[x]) return (void)(++tot, vid[x] = 1); if (mn_mx[x]) { vid[x] = 1e9; for (int i = be[x]; i; i = e[i].nxt) dfs(e[i].t), vid[x] = min(vid[x], vid[e[i].t]); } else for (int i = be[x]; i; i = e[i].nxt) dfs(e[i].t), vid[x] += vid[e[i].t]; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &mn_mx[i]); for (int i = 2; i <= n; ++i) scanf( %d , &f), add(f, i); dfs(1), printf( %d , tot - vid[1] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; long long int MAX = 1e18; void solve() { long long int n; scanf( %lld , &n); long long int a[n]; vector<pair<long long int, long long int> > v(n), ans; for (long long int i = 0; i < n; i++) { long long int num; scanf( %lld , &num); a[i] = num; v[i] = {num - 1, i}; } sort(begin(v), end(v)); for (long long int i = n / 2, j = n / 2 - 1; i < n; i++, j--) { if (v[i].second > i) { ans.push_back({v[i].second + 1, 1}); ans.push_back({1, i + 1}); ans.push_back({v[i].second + 1, 1}); v[a[i] - 1].second = v[i].second; swap(a[i], a[v[i].second]); } else if (v[i].second < i) { ans.push_back({v[i].second + 1, n}); ans.push_back({n, 1}); ans.push_back({1, i + 1}); ans.push_back({n, 1}); ans.push_back({v[i].second + 1, n}); v[a[i] - 1].second = v[i].second; swap(a[i], a[v[i].second]); } if (v[j].second < j) { ans.push_back({v[j].second + 1, n}); ans.push_back({j + 1, n}); ans.push_back({n, v[j].second + 1}); v[a[j] - 1].second = v[j].second; swap(a[j], a[v[j].second]); } else if (v[j].second > j) { ans.push_back({v[j].second + 1, 1}); ans.push_back({1, n}); ans.push_back({j + 1, n}); ans.push_back({n, 1}); ans.push_back({v[j].second + 1, 1}); v[a[j] - 1].second = v[j].second; swap(a[j], a[v[j].second]); } } cout << ans.size() << endl; for (long long int i = 0; i < ans.size(); i++) printf( %lld %lld n , ans[i].first, ans[i].second); } int main() { long long int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, c = 0; cin >> n; long long int d; cin >> d; long long int s[n + 5]; for (long long int i = 0; i < n; i++) { cin >> s[i]; } sort(s, s + n); for (long long int i = 0; i < n - 1; i++) { for (long long int j = i + 1; j < n; j++) { if (s[j] - s[i] <= d) { c++; } } } cout << c * 2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p); inline int D() { int t; scanf( %d , &t); return t; } inline long long llD() { long long t; scanf( %lld , &t); return t; } const int N = 1e6 + 5; long long arr[N], cost[N]; int main() { long long n = llD(), k = llD(), l = 1, r = 0, mid = -1; for (int i = 0; i < n; ++i) r += pow(2, i); while (mid != k) { mid = (l + r) / 2; if (mid > k) r = mid - 1, --n; else if (mid < k) l = mid + 1, --n; } printf( %lld , n); } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e6 + 20; struct Edge { int to, w, next; } edge[M]; int head[M], cnt, fa[M]; inline void add(int u, int v, int w) { edge[++cnt].to = v, edge[cnt].w = w, edge[cnt].next = head[u], head[u] = cnt; } long long mxp[M]; int val[M]; long long dfs1(int now) { mxp[now] = val[now]; for (int i = head[now]; i; i = edge[i].next) { if (edge[i].to == fa[now]) continue; fa[edge[i].to] = now, mxp[now] = max(mxp[now], val[now] - edge[i].w + dfs1(edge[i].to)); } return mxp[now]; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &val[i]); for (int i = 1; i <= n - 1; ++i) { int u, v, w; scanf( %d%d%d , &u, &v, &w), add(u, v, w), add(v, u, w); } dfs1(1); long long ans = 0; for (int i = 1; i <= n; ++i) { long long mx1 = 0, mx2 = 0; for (int j = head[i]; j; j = edge[j].next) { if (edge[j].to == fa[i]) continue; long long c = mxp[edge[j].to] - edge[j].w; if (c > mx1) mx2 = mx1, mx1 = c; else if (c > mx2) mx2 = c; } ans = max(ans, val[i] + mx1 + mx2); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int main() { int n; scanf( %d , &n); vector<vector<pair<int, int>>> a(n); for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d %d , &u, &v); --u, --v; a[u].emplace_back(v, i); a[v].emplace_back(u, i); } vector<int> lev(n, 1), pr(n); function<void(int, int)> dfs = [&](int u, int p) { pr[u] = p; for (auto [v, id] : a[u]) { if (v != p) { lev[v] = 1 + lev[u]; dfs(v, u); } } }; dfs(0, -1); vector<vector<int>> sp(n, vector<int>(22, -1)); for (int i = 0; i < 22; i++) { for (int j = 0; j < n; j++) { if (i == 0) { sp[j][i] = pr[j]; } else if (sp[j][i - 1] != -1) { sp[j][i] = sp[sp[j][i - 1]][i - 1]; } } } function<int(int, int)> lca = [&](int u, int v) { if (lev[u] < lev[v]) { swap(u, v); } int lg = 0; while ((1 << lg) <= lev[u]) { ++lg; } --lg; for (int i = lg; i >= 0; i--) { if (lev[u] >= lev[v] + (1 << i)) { u = sp[u][i]; } } if (u == v) { return u; } for (int i = lg; i >= 0; i--) { if (sp[u][i] != sp[v][i]) { u = sp[u][i]; v = sp[v][i]; } } return (u == v) ? u : pr[u]; }; int k; scanf( %d , &k); vector<int> val(n); for (int i = 0; i < k; i++) { int u, v; scanf( %d %d , &u, &v); --u, --v; int g = lca(u, v); ++val[u], ++val[v]; val[g] -= 2; } vector<int> ans(n - 1); function<void(int, int)> dfs2 = [&](int u, int p) { for (auto [v, id] : a[u]) { if (v != p) { dfs2(v, u); val[u] += val[v]; ans[id] = val[v]; } } }; dfs2(0, -1); for (int v : ans) { printf( %d , v); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; const int MODD = 1000000007; struct Stop { int s, t; bool operator<(const Stop &ss) const { return t < ss.t; } } bus[MAXN]; int n, m, nn, dp[MAXN], sum[MAXN]; int main() { while (scanf( %d%d , &n, &m) != EOF) { map<int, int> stops; stops[0] = stops[n] = 0; for (int i = 0; i < m; ++i) { scanf( %d%d , &bus[i].s, &bus[i].t); stops[bus[i].s] = stops[bus[i].t] = 0; } nn = 0; for (map<int, int>::iterator it = stops.begin(); it != stops.end(); ++it) it->second = ++nn; sort(bus, bus + m); int bi = 0; dp[1] = sum[1] = 1; for (int i = 2; i <= nn; ++i) { dp[i] = 0; for (; bi < m && stops[bus[bi].t] == i; ++bi) { int ms = stops[bus[bi].s]; int mt = stops[bus[bi].t]; dp[i] = ((long long)dp[i] + sum[mt - 1] - sum[ms - 1] + MODD) % MODD; } sum[i] = ((long long)sum[i - 1] + dp[i]) % MODD; } printf( %d n , dp[nn]); } return 0; } |
#include <bits/stdc++.h> const int N = 1e6; const long long mod = 998244353; const int INF = 0x7fffffff; const int inf = 0x3f3f3f3f; using namespace std; void exgcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return; } exgcd(b, a % b, y, x); y -= a / b * x; } long long getlnverse(long long x, long long y) { long long res, tmp; exgcd(x, y, res, tmp); return (res + y) % y; } long long a[N + 5]; long long cal(long long n, long long m) { long long tmp1 = getlnverse(a[m], mod); tmp1 = a[n] * tmp1 % mod; long long tmp2 = getlnverse(a[n - m], mod); return tmp1 * tmp2 % mod; } long long qpow(long long a, long long b) { long long sum = 1; while (b) { if (b & 1) { sum = (sum * a) % mod; b--; } b /= 2; a = a * a % mod; } return sum; } int main() { std::ios::sync_with_stdio(false); long long n, ans2 = 0; cin >> n; a[0] = 1; for (int i = 1; i <= n; i++) { a[i] = i * a[i - 1] % mod; } for (long long i = 1; i <= n; i++) { ans2 += (((cal(n, i) * qpow(-1, i)) % mod) * (qpow((qpow(3, n - i) - 1), n) + mod - qpow(3, n * (n - i))) % mod) % mod; ans2 = ans2 % mod; } long long ans1 = (2 * (qpow(3, n * n) - qpow((mod + qpow(3, n) - 3) % mod, n) + mod)) % mod; cout << (3 * mod + ans1 - (3 * ans2)) % mod << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, top, tot, cnt; int fir[202020], nxt[202020 << 1], to[202020 << 1]; int dfn[202020], fa[202020], st[202020]; struct evol { int v, nm; } l1[202020], l2[202020]; void add(int x, int y) { nxt[++cnt] = fir[x]; fir[x] = cnt; to[cnt] = y; } void dfs(int x) { dfn[x] = ++tot; l1[x] = l2[x] = (evol){tot, x}; for (int i = fir[x]; i; i = nxt[i]) if (to[i] != fa[x]) { if (!dfn[to[i]]) { fa[to[i]] = x; dfs(to[i]); if (l1[to[i]].v < l1[x].v) { if (l2[to[i]].v < l1[x].v) l1[x] = l1[to[i]], l2[x] = l2[to[i]]; else l2[x] = l1[x], l1[x] = l1[to[i]]; } else if (l1[to[i]].v < l2[x].v) l2[x] = l1[to[i]]; } else if (dfn[to[i]] < l1[x].v) l2[x] = l1[x], l1[x] = (evol){dfn[to[i]], x}; else if (dfn[to[i]] < l2[x].v) l2[x] = (evol){dfn[to[i]], x}; } if (l2[x].v < dfn[x]) { puts( YES ); int ed = l2[x].v; top = 0; for (int i = x;; i = fa[i]) { st[++top] = i; if (dfn[i] == ed) { ed = i; break; } } printf( %d , top); for (int i = 1; i <= top; i++) printf( %d , st[i]); puts( ); st[top = 1] = ed; for (int i = l2[x].nm; st[top] != x; i = fa[i]) st[++top] = i; printf( %d , top); while (top) printf( %d , st[top--]); puts( ); dfn[0] = tot + 1; for (int i = ed; dfn[st[top]] > l1[x].v; i = fa[i]) st[++top] = i; for (int i = l1[x].nm; st[top] != x; i = fa[i]) st[++top] = i; printf( %d , top); while (top) printf( %d , st[top--]); puts( ); exit(0); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y); add(y, x); } for (int i = 1; i <= n; i++) if (!dfn[i]) dfs(i); puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int k, q; long long f[10], dp[maxn]; void update(long long v, long long w) { for (int i = 1000000; i >= w; i--) dp[i] = max(dp[i], dp[i - w] + v); return; } void solve(long long v, long long w) { int num = min((long long)k, 1000000 / w); for (int i = 0; (1 << i) <= num; i++) { int c = (1 << i); update(v * c, w * c); num -= c; } if (num) update(v * num, w * num); return; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> k; k = 3 * (k - 1); for (int i = 0; i <= 5; i++) cin >> f[i]; for (int i = 0; i <= 1000000; i++) { int cur = 0, x = i; while (x) { int low = x % 10; if (low % 3 == 0) { dp[i] += f[cur] * (low / 3); } x /= 10; ++cur; } } int sz = 1; for (int i = 0; i <= 5; i++) { solve(f[i], sz * 3); sz *= 10; } cin >> q; while (q--) { int n; cin >> n; cout << dp[n] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 500050; const long long inf = 1e18; int a[maxn]; vector<int> G[maxn]; int f[maxn][20], root; long long ans = 0; void dfs(int x, int par) { f[x][0] = par; long long t = inf; if (par) t = a[x] + a[par]; for (int i = 1; f[x][i - 1]; ++i) { f[x][i] = f[f[x][i - 1]][i - 1]; if (f[x][i]) t = min(t, (1ll + i) * a[f[x][i]] + a[x]); else t = min(t, (1ll + i) * a[root] + a[x]); } if (par) ans += t; for (auto &v : G[x]) { if (v != par) dfs(v, x); } } int main() { int n; scanf( %d , &n); root = 1; for (int i = 1; i <= n; ++i) scanf( %d , a + i), a[i] < a[root] ? root = i : 0; for (int i = 0; i < n - 1; ++i) { int x, y; scanf( %d%d , &x, &y); G[x].push_back(y); G[y].push_back(x); } dfs(root, 0); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; double PI = 3.14159265358979323843; int BS(int arr[], int sz, int n) { int l = 0, r = sz - 1, mid; while (l <= r) { if (arr[mid] >= n) r = mid - 1; else l = mid + 1; } return l; } bool prime(long long x) { for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) { return false; } } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; int c = 0; if (s.size() == 1) { return puts( 0 ), 0; } while (true) { long long sum = 0; for (int i = 0; i < s.size(); i++) { sum += s[i] - 0 ; } s.clear(); if (sum / 10 == 0) { break; } c++; s = to_string(sum); } cout << ++c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int sta[10][100005]; int top[10]; int tail[10]; int a[100005][10]; int ans[10]; int main() { int n, m; int k; scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); } } for (int i = 1; i <= m; i++) { top[i] = 1; } int ma = -1; int i = 1; for (int l = 1; l <= n; l++) { if (l > 1) { for (int j = 1; j <= m; j++) { if (top[j] <= tail[j] && sta[j][top[j]] < l) { top[j]++; } } } for (i = max(i, l); i <= n; i++) { int sum = 0; for (int j = 1; j <= m; j++) { sum += max(a[sta[j][top[j]]][j], a[i][j]); } if (sum > k) break; for (int j = 1; j <= m; j++) { while (tail[j] >= top[j] && a[sta[j][tail[j]]][j] < a[i][j]) { tail[j]--; } sta[j][++tail[j]] = i; } if (i - l + 1 > ma) { ma = i - l + 1; for (int j = 1; j <= m; j++) ans[j] = a[sta[j][top[j]]][j]; } } } for (int i = 1; i <= m; i++) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int imax = INT32_MAX; const int imin = INT32_MIN; const long long int inf = 1e18; const long long int MOD = 1e9 + 7; const long long int range = 1e9 + 7; vector<vector<int>> g; template <class T> T cal(T n) { return (n * 1ll * (n + 1)); } template <class T> T mx(T begin, T end) { return max_element(begin, end); } template <class T> T mn(T begin, T end) { return min_element(begin, end); } template <class T> void getUnique(vector<T>& nums) { sort(nums.begin(), nums.end()); nums.erase(unique(nums.begin(), nums.end()), nums.end()); } template <class T> void print(vector<T> nums) { for (T i : nums) cout << i << ; cout << n ; } template <class T> void read(vector<T>& nums) { for (T& i : nums) cin >> i; } template <class T> void alloc(vector<vector<T>*> nums, T n) { for (auto nums : nums) nums->resize(n + 1); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long int t = 1; while (t--) { long long int n; cin >> n; vector<long long int> dp(n + 1, imax); dp[0] = 0; for (long long int i = 1; i <= n; ++i) { long long int num = i; while (num > 0) { dp[i] = min(dp[i], 1 + dp[i - num % 10]); num /= 10; } } cout << dp[n]; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, a2, a3; getline(cin, a); getline(cin, a2); getline(cin, a3); int lin1 = 0, lin2 = 0, lin3 = 0; for (int i = 0; i < a.size(); i++) { if (a[i] == e || a[i] == a || a[i] == i || a[i] == o || a[i] == u || a[i] == E || a[i] == A || a[i] == O || a[i] == I || a[i] == U ) { lin1++; } } for (int i = 0; i < a2.size(); i++) { if (a2[i] == e || a2[i] == a || a2[i] == i || a2[i] == o || a2[i] == u || a2[i] == E || a2[i] == A || a2[i] == O || a2[i] == I || a2[i] == U ) { lin2++; } } for (int i = 0; i < a3.size(); i++) { if (a3[i] == e || a3[i] == a || a3[i] == i || a3[i] == o || a3[i] == u || a3[i] == E || a3[i] == A || a3[i] == O || a3[i] == I || a3[i] == U ) { lin3++; } } if (lin1 == 5 && lin2 == 7 && lin3 == 5) { cout << YES ; return 0; } else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; cin >> x >> t >> a >> b >> da >> db; for (int i = 0; i < t; i++) for (int h = 0; h <= 1; h++) for (int j = 0; j < t; j++) for (int s = 0; s <= 1; s++) if (((a - (da * i)) * h) + ((b - (db * j)) * s) == x) { cout << YES << endl; return 0; } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int times = 1; cin >> times; for (int i = 0; i < times; i++) { solve(); cout << n ; } return 0; } long long a, b, c, d, e, f, g, h; long long arr[500000 + 50]; void solve() { cin >> a >> b >> c; for (int i = 1; i <= a; i++) cin >> arr[i]; sort(arr + 1, arr + a + 1); long long dp[a + 50][2]; for (int i = 1; i <= a; i++) dp[i][0] = dp[i][1] = 21474836477777; dp[0][0] = dp[0][1] = 0; for (int i = 1; i <= a; i++) { if (i > 0) { dp[i][0] = min(dp[i][0], dp[i - 1][0] + arr[i]); dp[i][0] = min(dp[i][0], dp[i - 1][1] + arr[i]); } if (i >= c) { dp[i][1] = min(dp[i][1], dp[i - c][0] + arr[i]); dp[i][1] = min(dp[i][1], dp[i - c][1] + arr[i]); } } int ans = 0; for (int i = 1; i <= a; i++) { if (dp[i][0] <= b || dp[i][1] <= b) ans = i; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const int maxn = 3e5 + 10; const int mod = 1e9 + 7; long long a[maxn]; int main() { long long n, m; scanf( %I64d%I64d , &n, &m); for (int i = 0; i < n; i++) { scanf( %I64d , &a[i]); } int now = 0; for (int i = 0; i < n; i++) { printf( %I64d%c , (a[i] + now) / m, n [i == n - 1]); now = (a[i] + now) % m; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a, x; long long ans = 0; map<vector<pair<int, int>>, int> mp; for (int i = 0; i < n; i++) { vector<pair<int, int>> v; cin >> a; for (int j = 2; j * j <= a; j++) { int pow = 0; while (a % j == 0) { a = a / j; pow++; } pow = pow % k; if (pow) { v.push_back({j, k - pow}); } } if (a != 1) { v.push_back({a, k - 1}); } ans = ans + mp[v]; for (int i = 0; i < v.size(); i++) v[i].second = k - v[i].second; mp[v]++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int long long n, a, b, x = 4, y = 2, ans, m, ans1, ans2, ans3; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> m >> a >> b; while (x > 0 || y > 0) { ans++; n = m; while (x > 0 && n >= a) { x--; n -= a; } while (y > 0 && n >= b) { y--; n -= b; } } x = 4; y = 2; while (x > 0 || y > 0) { ans1++; n = m; while (y > 0 && n >= b) { y--; n -= b; } while (x > 0 && n >= a) { x--; n -= a; } } x = 4; y = 2; while (x > 0 || y > 0) { ans2++; n = m; while (x > 0 && y > 0 && n >= a + b) { x--; y--; n -= a + b; } while (y > 0 && n >= b) { y--; n -= b; } while (x > 0 && n >= a) { x--; n -= a; } } x = 4; y = 2; while (x > 0 || y > 0) { ans3++; n = m; while (x > 0 && y > 0 && n >= a + b) { x--; y--; n -= a + b; } while (x > 0 && n >= a) { x--; n -= a; } while (y > 0 && n >= b) { y--; n -= b; } } cout << min(min(ans, ans1), min(ans2, ans3)); } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 1; vector<int> s[N], e[N]; int n, m, l[N], r[N], x[N], res[N]; bool vis[N]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { scanf( %d%d%d , &l[i], &r[i], &x[i]); s[l[i]].push_back(i); e[r[i]].push_back(i); } priority_queue<int> qu; vector<int> w; for (int i = 1; i <= n; ++i) { for (size_t j = 0; j < s[i].size(); ++j) qu.push(-s[i][j]); bool can = false; while (!qu.empty()) { int v = -qu.top(); if (!vis[v]) { can = true; break; } qu.pop(); } if (!can) continue; w.clear(); while (!qu.empty()) { int v = -qu.top(); if (x[v] == i || i < l[v] || i > r[v]) { qu.pop(); w.push_back(v); continue; } res[i] = x[v]; break; } for (size_t j = 0; j < w.size(); ++j) qu.push(-w[j]); for (size_t j = 0; j < e[i].size(); ++j) vis[e[i][j]] = true; } for (int i = 1; i <= n; ++i) printf( %s%d , i > 1 ? : , res[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int i, j = 0, k, a, b; int main() { long long int n, m; cin >> n; long long int aa[n + 1]; for (i = 1; i <= n; i++) cin >> aa[i]; cin >> m; while (m--) { cin >> a >> b; if (a != 1) aa[a - 1] += b - 1; if (a != n) aa[a + 1] += aa[a] - b; aa[a] = 0; } for (i = 1; i <= n; i++) cout << aa[i] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); int a[n + 2][3]; for (int i = 0; i < n + 1; i++) for (int j = 0; j < 3; j++) a[i][j] = 0; for (int k = 0; k < s.length(); k++) { if (s[k] == . ) continue; else if (s[k] == A ) { a[k][1] = 1; a[k + 1][1] = 1; a[k + 2][1] = 1; } else if (s[k] == B ) { a[k][0] = 1; a[k + 1][0] = 1; a[k + 2][0] = 1; } else { a[k][2] = 1; a[k + 1][2] = 1; a[k + 2][2] = 1; } } for (int l = 1; l <= n; l++) { if (a[l][0] == 1 && a[l][1] == 1 && a[l][2] == 1) { cout << YES ; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 400010; vector<int> g[N]; int pos[N], to[N]; int kw = 0, w[N]; void dfs(int v, int pr) { pos[v] = kw; w[kw++] = v; for (int j = 0; j < (int)g[v].size(); j++) { int u = g[v][j]; if (u != pr) { dfs(u, v); } } to[v] = kw - 1; } long long a[4 * N]; bool put[4 * N]; int color[N]; void build(int x, int l, int r) { if (l < r) { int y = (l + r) >> 1; build(x + x, l, y); build(x + x + 1, y + 1, r); a[x] = a[x + x] | a[x + x + 1]; put[x] = false; } else { a[x] = 1LL << color[w[l]]; put[x] = true; } } inline void push(int x) { if (put[x]) { a[x + x] = a[x + x + 1] = a[x]; put[x + x] = put[x + x + 1] = true; put[x] = false; } } inline void gather(int x) { a[x] = a[x + x] | a[x + x + 1]; } void modify(int x, int l, int r, int ll, int rr, long long v) { if (r < ll || rr < l) { return; } if (ll <= l && r <= rr) { a[x] = v; put[x] = true; return; } push(x); int y = (l + r) >> 1; modify(x + x, l, y, ll, rr, v); modify(x + x + 1, y + 1, r, ll, rr, v); gather(x); } long long get(int x, int l, int r, int ll, int rr) { if (r < ll || rr < l) { return 0; } if (ll <= l && r <= rr) { return a[x]; } push(x); int y = (l + r) >> 1; long long res = get(x + x, l, y, ll, rr); res |= get(x + x + 1, y + 1, r, ll, rr); gather(x); return res; } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , color + i); } for (int i = 0; i < n; i++) { g[i].clear(); } for (int i = 0; i < n - 1; i++) { int foo, bar; scanf( %d %d , &foo, &bar); foo--; bar--; g[foo].push_back(bar); g[bar].push_back(foo); } dfs(0, -1); build(1, 0, n - 1); while (m--) { int type; scanf( %d , &type); if (type == 1) { int foo, bar; scanf( %d %d , &foo, &bar); foo--; modify(1, 0, n - 1, pos[foo], to[foo], 1LL << bar); } else { int foo; scanf( %d , &foo); foo--; long long value = get(1, 0, n - 1, pos[foo], to[foo]); printf( %d n , __builtin_popcountll(value)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; long long max(long long a, long long b) { return a > b ? a : b; } bool r(long long p1, long long p2) { return (p2 < p1); } long long min(long long a, long long b) { return a < b ? a : b; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } const int N = 9; long long power(long long a, long long b) { long long ans = 1; while (b > 0) { if (b & 1) { ans = (ans * a); } a = (a * a); b >>= 1; } return ans; } void solve() { int n; cin >> n; int a[n], b[n], c[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; for (int i = 0; i < n; i++) cin >> c[i]; int p[n]; p[0] = a[0]; for (int i = 1; i < n; i++) { p[i] = a[i]; if (p[i] == p[i - 1]) p[i] = b[i]; } if (p[n - 1] == p[0]) p[n - 1] = c[n - 1]; if (p[n - 1] == p[n - 2]) p[n - 1] = b[n - 1]; for (int i = 0; i < n; i++) cout << p[i] << ; cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; string s; while (t--) { cin >> n >> s; int x = 0, y = 0; map<pair<int, int>, int> m; int l = 0, r = n + 1; m[{0, 0}] = 1; for (int i = 0; i < n; i++) { if (s[i] == L ) x--; if (s[i] == R ) x++; if (s[i] == U ) y++; if (s[i] == D ) y--; if (m[{x, y}]) { if (i - m[{x, y}] < r - l) { l = m[{x, y}]; r = i; } } m[{x, y}] = i + 2; } if (l == 0) { cout << -1 << n ; } else { cout << l << << r + 1 << n ; } } } |
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; long long a[N], pos[N]; long long n; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t = 1; cin >> t; while (t--) { cin >> n; for (long long i = 1; i <= n; i++) cin >> a[i]; long long ok = 1; for (long long i = 1; i + 1 <= n; i++) { if (a[i + 1] == a[i] + 1 || a[i + 1] < a[i]) continue; ok = 0; } if (ok) cout << Yes << n ; else cout << No << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[100500]; int b[200500]; int c[100500]; multiset<int> pl, mnus; int addpl, addmn; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; c[a[i]] = i; } for (int i = 0; i < n; ++i) { cin >> b[i]; b[i + n] = b[i]; } for (int i = 0; i < n; ++i) { if (c[b[i]] >= i) mnus.insert(c[b[i]] - i); else pl.insert(i - c[b[i]]); } pl.insert(1e9); mnus.insert(1e9); cout << min(*mnus.begin() + addmn, *pl.begin() + addpl) << endl; for (int i = 0; i < n - 1; ++i) { addpl--; addmn++; mnus.erase(mnus.lower_bound(c[b[i]] + 1 - addmn)); pl.insert(n - c[b[i]] - 1 - addpl); while (*pl.begin() + addpl == 0) mnus.insert(-addmn), pl.erase(pl.begin()); cout << min(*mnus.begin() + addmn, *pl.begin() + addpl) << endl; } } |
#include <bits/stdc++.h> using namespace std; string s[110 * 110]; vector<string> v; char sub(string s1, string s2) { int dem[30]; memset(dem, 0, sizeof(dem)); for (int i = 0; i < s1.size(); i++) dem[s1[i] - a ]++; for (int i = 0; i < s2.size(); i++) dem[s2[i] - a ]--; for (int i = 0; i <= z - a ; i++) if (dem[i] == 1) return char(i + a ); } bool cmp(string s1, string s2) { return (s1.length() > s2.length()); } int main() { int n; cin >> n; if (n == 1) { cout << ? << << 1 << << 1 << endl; cout.flush(); string s; cin >> s; cout << ! << s; return 0; } cout << ? << << 1 << << n - 1 << endl; cout.flush(); int t = (n * (n - 1)) / 2; map<string, int> ma; for (int i = 1; i <= t; i++) { string s; cin >> s; sort(s.begin(), s.end()); ma[s]++; } cout << ? << << 1 << << n << endl; cout.flush(); t = (n * (n + 1)) / 2; for (int i = 1; i <= t; i++) { string s; cin >> s; sort(s.begin(), s.end()); if (ma[s] > 0) ma[s]--; else v.push_back(s); } sort(v.begin(), v.end(), cmp); cout << ! ; for (int i = 0; i < v.size() - 1; i++) cout << sub(v[i], v[i + 1]); cout << v.back(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool EulerianPathExists(const map<string, pair<int, int>>& in_out_degrees) { int different_in_out_count = 0; for (auto& key_val : in_out_degrees) { if (key_val.second.first != key_val.second.second) { ++different_in_out_count; if (different_in_out_count > 2) return false; } } return true; } void FindEulerianPath(string v, map<string, unordered_map<string, int>>& graph, vector<string>& res) { while (!graph[v].empty()) { auto adj_pair = graph[v].begin(); auto w = adj_pair->first; --adj_pair->second; if (adj_pair->second == 0) graph[v].erase(adj_pair); FindEulerianPath(w, graph, res); } res.push_back(v); } bool UntraversedEdgesLeft( const map<string, unordered_map<string, int>>& graph) { for (auto& key_val : graph) if (!key_val.second.empty()) return true; return false; } string RestorePassword(vector<string>& path) { reverse(path.begin(), path.end()); string password = path[0]; for (int i = 1; i < path.size(); ++i) password += path[i][1]; return password; } bool CheckCornerCases(const map<string, pair<int, int>>& in_out_degree, const map<string, unordered_map<string, int>>& graph) { if (in_out_degree.size() != 2) return true; auto first_adj_pair = graph.begin()->second; if (graph.size() == 1 && first_adj_pair.begin()->second == 1) return true; int num_of_outward_edges = 0; auto v = graph.begin()->first; auto w = v; reverse(w.begin(), w.end()); if (graph.begin()->second.count(w)) num_of_outward_edges = graph.begin()->second.at(w); int num_of_inward_edges = 0; if (graph.count(w) > 0 && graph.at(w).count(v) > 0) { num_of_inward_edges = graph.at(w).at(v); } if (abs(num_of_inward_edges - num_of_outward_edges) > 1 || (!num_of_inward_edges && !num_of_outward_edges)) { return false; } return true; } int main() { map<string, unordered_map<string, int>> graph; map<string, pair<int, int>> in_out_degree; int N; cin >> N; for (int i = 0, num = 0; i < N; ++i) { string s; cin >> s; string v = s.substr(0, 2); string w = s.substr(1, 2); ++in_out_degree[v].second; ++in_out_degree[w].first; ++graph[v][w]; } bool path_exists = EulerianPathExists(in_out_degree); if (!path_exists) { cout << NO ; return 0; } if (!CheckCornerCases(in_out_degree, graph)) { cout << NO ; return 0; } vector<string> eulerian_path; auto graph_cpy = graph; for (auto& key_val : in_out_degree) { if (key_val.second.second > key_val.second.first) { FindEulerianPath(key_val.first, graph_cpy, eulerian_path); break; } } bool untraversed_edges_left = UntraversedEdgesLeft(graph_cpy); for (auto& v : graph) { graph_cpy = graph; if (eulerian_path.empty() || untraversed_edges_left) { FindEulerianPath(v.first, graph_cpy, eulerian_path); untraversed_edges_left = UntraversedEdgesLeft(graph_cpy); break; } else break; } if (eulerian_path.empty() || untraversed_edges_left) cout << NO ; else { cout << YES << endl; cout << RestorePassword(eulerian_path); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } long long rand_int(long long l, long long r) { static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count()); return uniform_int_distribution<long long>(l, r)(gen); } long long power(long long b, long long e) { if (e == 0) return 1; if (e % 2) return ((b * power((b) * (b), (e - 1) / 2))); else return power((b) * (b), e / 2); } long long modpower(long long b, long long e, long long q) { long long MOD = q; if (e == 0) return 1; if (e % 2) return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD; else return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD; } void dpv(vector<long long> v) { for (long long i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << endl; } void dpv(vector<pair<long long, long long> > v) { for (long long i = 0; i < v.size(); i++) { cout << v[i].first << << v[i].second << endl; } } void dpv(set<long long> v) { for (auto i : v) { cout << i << ; } cout << endl; } bool check(long long l, long long r) { assert(l <= r); cout << l << << r << endl; string s; cin >> s; if (s == Bad ) { exit(0); } if (s == Yes ) { if (l == r) exit(0); return true; } return false; } void oblivious() { srand(time(0)); long long n, K; cin >> n >> K; long long L = 1, R = n; while (true) { if (R - L + 1 > 70) { long long M = (L + R) / 2; if (check(L, M)) R = M; else L = M + 1; } else { long long p = rand() % (R - L + 1) + L; check(p, p); } L = max(1LL, L - K); R = min(n, R + K); } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { oblivious(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 110000; int n, q; map<pair<int, int>, int> M; int u[maxn], v[maxn]; int s[maxn], e[maxn]; vector<int> V[maxn << 4]; struct DSU { int fa[maxn], col[maxn], sz[maxn]; stack<pair<pair<int *, int>, int>> stk; int findfa(int x, int &val) { val ^= col[x]; return x == fa[x] ? x : findfa(fa[x], val); } void init() { for (int i = 1; i <= n; i++) fa[i] = i, col[i] = 0, sz[i] = 1; } bool dsunion(int x, int y, int t) { int cx = 0, cy = 0; int fx = findfa(x, cx), fy = findfa(y, cy); if (fx == fy) return cx ^ cy; if (sz[fx] > sz[fy]) swap(fx, fy); stk.push({{&fa[fx], fa[fx]}, t}); fa[fx] = fy; stk.push({{&sz[fy], sz[fy]}, t}); sz[fy] += sz[fx]; stk.push({{&col[fx], col[fx]}, t}); col[fx] = cx ^ cy ^ 1; return 1; } void goback(int t) { while (!stk.empty()) { if (stk.top().second != t) break; (*stk.top().first.first) = stk.top().first.second; stk.pop(); } } } dsu; void Add(int L, int R, int val, int l, int r, int rt) { if (L <= l && R >= r) { V[rt].push_back(val); return; } int m = (l + r) >> 1; if (L <= m) Add(L, R, val, l, m, rt << 1); if (R > m) Add(L, R, val, m + 1, r, rt << 1 | 1); } void solve(int l, int r, int rt) { for (int i = 0; i < V[rt].size(); i++) { int _ = V[rt][i]; if (!dsu.dsunion(u[_], v[_], rt)) { for (int j = l; j <= r; j++) puts( NO ); dsu.goback(rt); return; } } if (l == r) puts( YES ); else { int m = (l + r) >> 1; solve(l, m, rt << 1); solve(m + 1, r, rt << 1 | 1); } dsu.goback(rt); } int main() { int cnt = 0; scanf( %d%d , &n, &q); dsu.init(); for (int i = 1; i <= q; i++) { int uu, vv; scanf( %d%d , &uu, &vv); if (!M.count({uu, vv})) { ++cnt; u[cnt] = uu, v[cnt] = vv; M[{uu, vv}] = cnt; s[cnt] = i; } else { e[M[{uu, vv}]] = i - 1; M.erase({uu, vv}); } } for (auto it = M.begin(); it != M.end(); it++) e[it->second] = q; for (int i = 1; i <= cnt; i++) Add(s[i], e[i], i, 1, q, 1); solve(1, q, 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 20; char s1[N], s2[N], ans[N]; int main() { scanf( %s%s , s1, s2); int n1 = strlen(s1), cnt = 0; ans[cnt++] = s1[0]; for (int i = 1; i < n1; i++) { if (s1[i] >= s2[0]) break; ans[cnt++] = s1[i]; } ans[cnt++] = s2[0]; printf( %s n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 998244353; long long fast_exp(long long a, long long b) { if (b <= 0) return 1; else { long long res = 1; res = fast_exp(a, b / 2); res = (res * res) % mod; if (b % 2 == 1) res = (res * a) % mod; return res; } } long long n, m, k; long long dp[5001][5010] = {}; long long inv; int main() { cin >> n >> m >> k; dp[0][0] = 1; for (long long i = 0; i < k; i++) { for (long long j = 0; j < 5001; j++) { dp[i + 1][j] = (dp[i + 1][j] + (j)*dp[i][j]) % mod; dp[i + 1][j + 1] = (dp[i + 1][j + 1] + (n - j) * dp[i][j]) % mod; } } inv = fast_exp(m, mod - 2); long long num = 0; long long beg = fast_exp(m, n); for (long long i = 0; i <= 5001; i++) { num = (num + beg * dp[k][i]) % mod; beg = (beg * inv) % mod; } long long denom = fast_exp(m, n); denom = fast_exp(denom, mod - 2); cout << (num * denom) % mod << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; int *sher = new int[n]; char d; for (int i = 0; i < n; i++) { cin >> d; sher[i] = d - 0 ; } int *mor = new int[n]; for (int i = 0; i < n; i++) { cin >> d; mor[i] = d - 0 ; } sort(sher, sher + n, greater<int>()); sort(mor, mor + n, greater<int>()); int out = 0; int l = 0, r = n - 1; for (int i = 0; i < n; i++) { if (sher[i] > mor[l]) { r--; out++; } else l++; } cout << out << endl; l = 0; r = n - 1; out = 0; for (int i = 0; i < n; i++) { if (sher[i] < mor[l]) { l++; out++; } else r--; } cout << out << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> int sz(const T &a) { return (int)a.size(); } const int MAXN = 2e5 + 1; int arr[MAXN]; int fir[MAXN]; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q; int main() { cin.tie(NULL); ios_base::sync_with_stdio(false); int n; cin >> n; set<int> leaves; for (int i = 1; i <= n; i++) leaves.insert(i), fir[i] = INT_MAX; for (int i = 1; i < n; i++) { cin >> arr[i]; fir[arr[i]] = min(fir[arr[i]], i); leaves.erase(arr[i]); } vector<pair<int, int>> edges; for (int x : leaves) { q.push({x, x}); } for (int i = n - 1; i >= 1; i--) { auto cur = q.top(); q.pop(); edges.push_back({cur.second, arr[i]}); if (i == fir[arr[i]]) q.push({max(cur.first, arr[i]), arr[i]}); } printf( %d n , arr[1]); for (auto x : edges) printf( %d %d n , x.first, x.second); return 0; } |
#include <bits/stdc++.h> int main() { int i, j, t, n, a[20000], counto, counte; scanf( %d , &t); for (i = 1; i <= t; i++) { counto = 0, counte = 0; scanf( %d , &n); for (j = 0; j < n; j++) { scanf( %d , &a[j]); if (a[j] % 2 == 0) counte++; else counto++; } if (counto == n && n % 2 == 0 || counte == n) printf( NO ); else printf( YES ); if (i != t) printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000; int fs[100], ft[100]; char c[1050], s[100], t[100]; int dp[1050][100][100]; void GetNextval(char* p, int next[]) { int pLen = strlen(p); next[0] = -1; int k = -1; int j = 0; while (j < pLen) { if (k == -1 || p[j] == p[k]) { ++j; ++k; if (p[j] != p[k]) next[j] = k; else next[j] = next[k]; } else { k = next[k]; } } } int main() { scanf( %s%s%s , c, s, t); GetNextval(s, fs); GetNextval(t, ft); int nc = strlen(c); int ns = strlen(s); int nt = strlen(t); for (int i = 0; i <= nc; i++) for (int j = 0; j <= ns; j++) for (int k = 0; k <= nt; k++) dp[i][j][k] = -1e9; dp[0][0][0] = 0; for (int i = 0; i <= nc; i++) { for (char ch = a ; ch <= z ; ch++) { if (c[i] != * && ch != c[i]) continue; for (int j = 0; j <= ns; j++) { for (int k = 0; k <= nt; k++) { if (dp[i][j][k] == -1e9) continue; int jj = j; int kk = k; while (jj && ch != s[jj]) jj = fs[jj]; while (kk && ch != t[kk]) kk = ft[kk]; int f = 0; if (s[jj] == ch) jj++; if (t[kk] == ch) kk++; if (jj == ns) f++; if (kk == nt) f--; dp[i + 1][jj][kk] = max(dp[i + 1][jj][kk], dp[i][j][k] + f); } } } } int sum = -1e9; for (int j = 0; j <= ns; j++) for (int k = 0; k <= nt; k++) sum = max(sum, dp[nc][j][k]); printf( %d n , sum); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 5; struct node { int l, r; } num[MAXN]; int cmp(node x, node y) { return x.r < y.r; } int main() { int N; vector<int> v; v.clear(); scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %d%d , &num[i].l, &num[i].r); if (num[i].r < num[i].l) { int temp = num[i].l; num[i].l = num[i].r; num[i].r = temp; } } sort(num, num + N, cmp); v.push_back(num[0].r); for (int i = 1; i < N; i++) { if (num[i].l > v.back()) { v.push_back(num[i].r); } } printf( %d n , v.size()); for (int i = 0; i < v.size(); i++) printf( %d , v[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, i, p = 0, k = 0; cin >> x; char n[x + 1]; cin >> n; for (i = 0; i < x; i++) { if (n[i] == L ) p++; else k++; } cout << p + k + 1 << endl; } |
#include <bits/stdc++.h> using namespace std; int a[2000], b[2000]; inline bool valid(int i, int j, pair<int, int> pii) { return i != pii.first && j != pii.second; } int main() { int n, m; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); scanf( %d , &m); for (int i = 0; i < m; i++) scanf( %d , &b[i]); vector<pair<int, pair<int, int> > > v; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int d = a[i] - b[j]; v.push_back(make_pair(d, make_pair(i, j))); } } sort(v.begin(), v.end()); long long sa = 0, sb = 0; for (int i = 0; i < n; i++) sa += a[i]; for (int i = 0; i < m; i++) sb += b[i]; long long minD = abs(sa - sb); vector<pair<int, int> > pp; int sz = v.size(), id; if (sa - sb - 2LL * v[0].first <= 0) id = 0; else if (sa - sb - 2LL * v[sz - 1].first >= 0) id = sz - 1; else { int lo = 0, hi = sz - 1; while (hi - lo > 1) { int mid = lo + (hi - lo) / 2; if (sa - sb - 2LL * v[mid].first >= 0) lo = mid; else hi = mid; } if (abs(sa - sb - 2LL * v[lo].first) < abs(sa - sb - 2LL * v[hi].first)) id = lo; else id = hi; } long long diff = abs(sa - sb - 2LL * v[id].first); if (diff < minD) { minD = diff; pp.push_back(v[id].second); } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { long long sab = sa - sb - 2LL * (a[i] - b[j]); if (sab - 2LL * v[0].first <= 0) id = 0; else if (sab - 2LL * v[sz - 1].first >= 0) id = sz - 1; else { int lo = 0, hi = sz - 1; while (hi - lo > 1) { int mid = lo + (hi - lo) / 2; if (sab - 2LL * v[mid].first >= 0) lo = mid; else hi = mid; } if (abs(sab - 2LL * v[lo].first) < abs(sab - 2LL * v[hi].first)) id = lo; else id = hi; } for (int k = -20; k <= 20; k++) { if (id + k >= 0 && id + k < sz) { long long diff = abs(sab - 2LL * v[id + k].first); if (diff < minD && valid(i, j, v[id + k].second)) { minD = diff; pp.clear(); pp.push_back(make_pair(i, j)); pp.push_back(v[id + k].second); } } } } } cout << minD << endl; cout << pp.size() << endl; for (int i = 0; i < pp.size(); i++) cout << pp[i].first + 1 << << pp[i].second + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int sub_tree[maxn], n, T[maxn], P[maxn][22], L[maxn], par[maxn], ans[maxn], nn; set<int> adj[maxn]; void lca_dfs(int u, int p) { T[u] = p; L[u] = (p > -1) ? L[p] + 1 : 0; for (int s : adj[u]) { if (s == p) continue; lca_dfs(s, u); } } void sub_dfs(int u, int p) { nn++; sub_tree[u] = 1; for (int nd : adj[u]) { if (nd == p) continue; sub_dfs(nd, u); sub_tree[u] += sub_tree[nd]; } } int getCentroid(int u, int p) { for (int nd : adj[u]) { if (nd == p) continue; if (sub_tree[nd] > nn / 2) return getCentroid(nd, u); } return u; } void decompose(int u, int p) { nn = 0; sub_dfs(u, -1); int centroid = getCentroid(u, -1); par[centroid] = p; for (int nd : adj[centroid]) { adj[nd].erase(centroid); if (nd == p) continue; decompose(nd, centroid); } adj[centroid].clear(); } void init_LCA(int n) { memset(P, -1, sizeof(P)); L[1] = 0; lca_dfs(1, -1); for (int i = 1; i <= n; i++) { P[i][0] = T[i]; } for (int j = 1; (1 << j) < n; j++) { for (int i = 1; i <= n; i++) { if (P[i][j - 1] != -1) P[i][j] = P[P[i][j - 1]][j - 1]; } } } int lca_query(int p, int q) { int tmp, log, i; if (L[p] < L[q]) tmp = p, p = q, q = tmp; log = 1; while (1) { int next = log + 1; if ((1 << next) > L[p]) break; log++; } for (i = log; i >= 0; i--) if (L[p] - (1 << i) >= L[q]) p = P[p][i]; if (p == q) return p; for (i = log; i >= 0; i--) if (P[p][i] != -1 && P[p][i] != P[q][i]) p = P[p][i], q = P[q][i]; return T[p]; } int getDist(int p, int q) { int lca = lca_query(p, q); return L[p] + L[q] - 2 * L[lca]; } void update(int x) { int u = x; while (u != -1) { ans[u] = min(ans[u], getDist(u, x)); u = par[u]; } } void query(int x) { int mini = 1e8; int u = x; while (u != -1) { mini = min(mini, ans[u] + getDist(u, x)); u = par[u]; } printf( %d n , mini); } int main() { int a, b, m; scanf( %d %d , &n, &m); ; for (int i = 0; i < n - 1; i++) { scanf( %d %d , &a, &b); ; adj[a].insert(b); adj[b].insert(a); } init_LCA(n); decompose(1, -1); for (int i = 1; i <= n; i++) ans[i] = 1e8; update(1); for (int i = 0; i < m; i++) { scanf( %d %d , &a, &b); ; if (a == 2) query(b); else update(b); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 305; int n, m; inline int gi() { char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); int sum = 0; while ( 0 <= c && c <= 9 ) sum = sum * 10 + c - 48, c = getchar(); return sum; } const int Maxn = 605, Maxm = Maxn * Maxn; const long long Inf = 1ll << 60, zero = 5000000; long long ans; struct edge { int to, next; long long cap; } e[Maxm]; int h[Maxn], tot, s, t; inline void add(int u, int v, long long w) { e[++tot] = (edge){v, h[u], w}; h[u] = tot; e[++tot] = (edge){u, h[v], 0}; h[v] = tot; } bool vis[Maxn]; int l, r, que[Maxn], d[Maxn], cur[Maxn]; inline bool bfs() { l = 0; r = 1; que[r] = s; vis[s] = true; do { int u = que[++l]; for (int i = h[u], v; ~i; i = e[i].next) if (e[i].cap && !vis[v = e[i].to]) { vis[v] = true; d[v] = d[u] + 1; que[++r] = v; } } while (l < r); return vis[t]; } long long dfs(int u, long long a) { if (u == t || a == 0) return a; long long f, flow = 0; for (int &i = cur[u], v; ~i; i = e[i].next) { if (d[u] + 1 == d[v = e[i].to] && (f = dfs(v, min(a, e[i].cap)))) { e[i].cap -= f; e[i ^ 1].cap += f; flow += f; a -= f; if (a == 0) break; } } return flow; } int main() { memset(h, -1, sizeof(h)); tot = -1; n = gi(); s = n * 2 + 1; t = s + 1; for (int t, i = 1; i <= n; ++i) { t = gi(); while (t--) add(i, gi() + n, Inf); } for (int i = 1; i <= n; ++i) add(i + n, t, zero); for (int p, i = 1; i <= n; ++i) { scanf( %d , &p); add(s, i, zero - p); ans -= zero - p; } while (bfs()) { memset(vis, 0, sizeof(bool) * (t + 1)); memcpy(cur, h, sizeof(int) * (t + 1)); ans += dfs(s, Inf); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long double EPS = 1e-9; const long double PI = acos(-1); const long long INF = 1e18; const long long mod = 1e9 + 7; long long factorial(long long n) { if (n == 0) return 1; long long x = 1; for (long long i = 1; i <= n; i++) { x = (x * i) % mod; } return x; } long long power(long long x, long long y) { long long res = 1; x = x % mod; while (y > 0) { if (y & 1) res = (res * x) % mod; x = (x * x) % mod; y = y >> 1; } return res % mod; } long long modInverse(long long n) { return power(n, mod - 2); } long long nCr(long long n, long long r) { if (n < r) return 0; if (r == 0) return 1; return ((factorial(n) % mod) * (modInverse(((factorial(r) % mod) * (factorial(n - r) % mod)) % mod) % mod) % mod); } long long xor_1_x(long long x) { if (x % 4 == 0) return x; if (x % 4 == 1) return 1; if (x % 4 == 2) return x + 1; return 0; } bool prime(long long n) { if (n < 2) return false; for (long long x = 2; x * x <= n; x++) { if (n % x == 0) return false; } return true; } vector<long long> factors(long long n) { vector<long long> f; for (long x = 2; x * x <= n; x++) { while (n % x == 0) { f.push_back(x); n /= x; } } if (n > 1) f.push_back(n); return f; } int dp[1000005], p[1000005], pf[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int test_cases = 1, tt = 1; while (test_cases--) { int n, mx = 0; cin >> n; memset(p, 0, sizeof(p)), memset(pf, 0, sizeof(pf)); int power[1000005]; memset(power, 0, sizeof(power)); for (int i = 0; i <= n - 1; i++) { int a, b; cin >> a >> b; power[a] = b; p[a] = 1; mx = max(mx, a); } for (int i = 0; i <= mx; i++) { pf[i] = (i - 1 >= 0 ? pf[i - 1] : 0) + p[i]; } memset(dp, 0, sizeof(dp)); int ans = 1e7; for (int i = 0; i <= mx; i++) { if (p[i]) { if (i - power[i] < 0) dp[i] = pf[i] - 1; else { if (i - power[i] == 0) { if (p[0] == 0) dp[i] = dp[i - power[i]] + pf[i] - pf[i - power[i]] - 1; else dp[i] = dp[i - power[i]] + pf[i] - (pf[i - power[i]] - 1) - 1; } else dp[i] = dp[i - power[i] - 1] + pf[i] - pf[i - power[i] - 1] - 1; } ans = min(ans, dp[i] + pf[mx] - pf[i]); } else { dp[i] = (i - 1 >= 0 ? dp[i - 1] : 0); } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class A, class B> ostream &operator<<(ostream &os, pair<A, B> p) { return os << ( << p.first << , << p.second << ) ; } template <class A> ostream &operator<<(ostream &os, vector<A> v) { os << { ; for (auto &x : v) cout << x << ; return os << } ; } template <class A> ostream &operator<<(ostream &os, vector<vector<A>> v) { os << { << v.front() << n ; for (auto it = next(v.begin()); it != v.end(); it++) os << << *it << n ; return os << } ; } using VI = vector<int>; using VVI = vector<VI>; using II = pair<int, int>; using VII = vector<II>; using L = long long; using VL = vector<L>; using VB = vector<bool>; using VVB = vector<VB>; VVI graph; VII ans; int T; void dfs(int v = 0, int f = -1, int t = 0) { ; ans.emplace_back(v, t); int faza = t + 1; int time = int(graph[v].size()); bool cor = 0; if (t >= time) { cor = true; ans.emplace_back(v, t - time); faza = t - time + 1; } for (auto &u : graph[v]) { if (u != f) { dfs(u, v, faza); ans.emplace_back(v, faza); faza++; if (faza > time and !cor) { ans.emplace_back(v, 0); faza = 1; } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; graph.resize(n); for (decltype((n - 1) - 1) i = (0), i__ = ((n - 1) - 1); i <= i__; i++) { int u, v; cin >> u >> v; u--; v--; graph[u].emplace_back(v); graph[v].emplace_back(u); } T = 1; for (decltype((n)-1) i = (0), i__ = ((n)-1); i <= i__; i++) T = max(T, int(graph[i].size())); dfs(); ans.pop_back(); cout << int(ans.size()) << n ; for (auto &p : ans) cout << p.first + 1 << << p.second << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; int n, x, tot = 0, Ans = 0, prime[maxn]; bool isprime[maxn]; map<int, int> sg, st; void init() { memset(isprime, true, sizeof(isprime)); isprime[1] = false; for (int i = 2; i < maxn; i++) { if (isprime[i]) prime[++tot] = i; for (int j = 1; j <= tot && i * prime[j] < maxn; j++) { isprime[i * prime[j]] = false; if (i % prime[j] == 0) break; } } } void gao(int x) { for (int i = 1; prime[i] * prime[i] <= x; i++) { int t = 0; while (x % prime[i] == 0) { x /= prime[i]; t++; } if (t) st[prime[i]] |= 1 << (t - 1); } if (x != 1) st[x] |= 1; } int getsg(int x) { if (x == 0) return 0; if (sg.count(x)) return sg[x]; map<int, int> vis; int p = x, t = 0; while (p) p >>= 1, t++; for (int i = 1; i <= t; i++) { vis[getsg((x >> i) | (x & ((1 << i - 1) - 1)))] = 1; } for (int i = 0;; i++) if (!vis[i]) return sg[x] = i; } int main() { init(); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &x), gao(x); for (map<int, int>::iterator it = st.begin(); it != st.end(); it++) Ans ^= getsg(it->second); if (Ans) puts( Mojtaba ); else puts( Arpa ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; int i = 0; while (k--) { int j = i; for (int h = 0; h < m; h++) { int x = h < n % m ? n / m + 1 : n / m; cout << x; while (x--) { cout << << ++j; j %= n; } if (h < n % m) i = j; cout << n ; } } } return 0; } |
#include <bits/stdc++.h> const int kN = 100000 + 5; int n, parent[kN], type[kN]; std::vector<int> edges[2][kN]; int left[2][kN], right[2][kN], stmp; int top[2][kN]; void dfs(int color, int u, int root) { left[color][u] = ++stmp; top[color][u] = root; for (int v : edges[color][u]) { dfs(color, v, root); } right[color][u] = stmp; } bool is_ancestor(int color, int u, int v) { return top[color][u] == top[color][v] && left[color][u] <= left[color][v] && right[color][v] <= right[color][u]; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , &parent[i], &type[i]); if (parent[i] != -1) edges[type[i]][parent[i]].emplace_back(i); } for (int c = 0; c < 2; ++c) { stmp = 0; for (int i = 1; i <= n; ++i) { if (left[c][i] == 0) { dfs(c, i, i); } } } int q; scanf( %d , &q); while (q--) { int tp, u, v; scanf( %d%d%d , &tp, &u, &v); if (u == v || top[0][u] == v) { puts( NO ); continue; } bool flag = false; if (tp == 1) { flag = is_ancestor(0, u, v); } else { flag = type[v] == 1 && (is_ancestor(0, top[1][v], u) || is_ancestor(1, top[0][u], v)); } puts(flag ? YES : NO ); } } |
#include <bits/stdc++.h> const int MaxN = 1 << 20; using namespace std; int dp[MaxN + 5]; char s[30][30]; int a[30][30], cost[30][30]; int bit[30][30]; int n, m; int main() { while (~scanf( %d%d , &n, &m)) { for (int i = 0; i < n; i++) scanf( %s , s[i]); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int Max = 0, tmp = 0; bit[i][j] = 0; for (int k = 0; k < n; k++) { if (s[k][j] == s[i][j]) { Max = max(Max, a[k][j]); tmp += a[k][j]; bit[i][j] |= (1 << k); } } cost[i][j] = tmp - Max; } } for (int i = 0; i < (1 << n); i++) dp[i] = 1 << 29; dp[0] = 0; for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if ((i & (1 << j)) == 0) { for (int k = 0; k < m; k++) { dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + a[j][k]); dp[i | bit[j][k]] = min(dp[i | bit[j][k]], dp[i] + cost[j][k]); } } } } printf( %d n , dp[(1 << n) - 1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, src, dest, dist[100001], par[100001], mark[100001], vol[100001], vis[100001]; vector<int> v[100001]; vector<pair<int, int> > edge; vector<int> g[100001]; int reachable() { memset(vis, 0, sizeof vis); vis[src] = 1; queue<int> q; q.push(src); while (!q.empty()) { int x = q.front(); q.pop(); for (auto it : g[x]) { int y = it; if (vis[y]) continue; vis[y] = 1; q.push(y); } } return vis[dest]; } int ok(int val) { int i, x, y, cur, dis, parent, nxt; for (i = 1; i <= n; i++) dist[i] = 10000000; priority_queue<pair<int, pair<int, int> > > q; for (i = 1; i <= k; i++) { dist[vol[i]] = 0; par[vol[i]] = vol[i]; q.push({-dist[vol[i]], {par[vol[i]], vol[i]}}); } while (!q.empty()) { cur = q.top().second.second; parent = q.top().second.first; dis = -q.top().first; q.pop(); if (dis != dist[cur] || parent != par[cur]) continue; for (i = 0; i < v[cur].size(); i++) { nxt = v[cur][i]; if (dist[nxt] > dist[cur] + 1) { dist[nxt] = dist[cur] + 1; par[nxt] = parent; q.push({-dist[nxt], {par[nxt], nxt}}); } } } for (i = 1; i <= n; i++) g[i].clear(); for (auto it : edge) { x = it.first; y = it.second; if (par[x] == par[y]) continue; if (dist[x] + dist[y] + 1 <= val) { g[par[x]].push_back(par[y]); g[par[y]].push_back(par[x]); } } if (reachable()) return 1; return 0; } int main() { ios::sync_with_stdio(false); ; cin.tie(0); ; int i, j, x, y, lo, mid, hi; cin >> n >> m >> k; for (i = 1; i <= k; i++) { cin >> vol[i]; mark[vol[i]] = 1; } for (i = 1; i <= m; i++) { cin >> x >> y; edge.push_back({x, y}); v[x].push_back(y); v[y].push_back(x); } cin >> src >> dest; if (!mark[dest]) { mark[dest] = 1; k++; vol[k] = dest; } lo = 0; hi = 10000000; if (!ok(hi)) { cout << -1 ; return 0; } while (hi - lo > 1) { mid = (lo + hi) / 2; if (ok(mid)) hi = mid; else lo = mid; } cout << hi; return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int left, right; int time[60]; node(int left = 0, int right = 0) : left(left), right(right) {} } arb[4 * 100000 + 5]; inline void unite(node &a, node b, node &c) { for (int i = 0; i < 60; i++) a.time[i] = b.time[i] + c.time[(i + b.time[i]) % 60]; } int a[100000 + 5]; void build(int left, int right, int pos) { arb[pos].left = left, arb[pos].right = right; if (left == right) { for (int i = 0; i < 60; i++) if (i % a[left]) arb[pos].time[i] = 1; else arb[pos].time[i] = 2; return; } int mijl = (left + right) >> 1; build(left, mijl, pos << 1); build(mijl + 1, right, (pos << 1) + 1); unite(arb[pos], arb[pos << 1], arb[(pos << 1) + 1]); } void update(int up_pos, int val, int pos) { if (arb[pos].left == arb[pos].right) { for (int i = 0; i < 60; i++) if (i % val) arb[pos].time[i] = 1; else arb[pos].time[i] = 2; return; } int mijl = (arb[pos].left + arb[pos].right) >> 1; if (up_pos <= mijl) update(up_pos, val, pos << 1); else update(up_pos, val, (pos << 1) + 1); unite(arb[pos], arb[pos << 1], arb[(pos << 1) + 1]); } int ans; void query(int x, int y, int pos) { if (arb[pos].left == x && arb[pos].right == y) { ans += arb[pos].time[ans % 60]; return; } int mijl = (arb[pos].left + arb[pos].right) >> 1; if (y <= mijl) query(x, y, pos << 1); else if (x > mijl) query(x, y, (pos << 1) + 1); else { query(x, mijl, pos << 1); query(mijl + 1, y, (pos << 1) + 1); } } int main() { ios_base::sync_with_stdio(false); int n = 0; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; build(1, n, 1); int q = 0; cin >> q; char type; int x, y; while (q--) { cin >> type >> x >> y; if (type == A ) { y--; ans = 0; query(x, y, 1); cout << ans << n ; } else update(x, y, 1); } return 0; } |
#include <bits/stdc++.h> int Fa[200010]; std::vector<int> v[200010]; int Find(int x) { return Fa[x] == x ? x : Fa[x] = Find(Fa[x]); } bool vis[200010]; inline void merge(int a, int b) { int f1 = Find(a), f2 = Find(b); if (f1 != f2) { Fa[f1] = f2; } } int main() { int n, m, q; scanf( %d%d%d , &n, &m, &q); for (; q; --q) { int x, y; scanf( %d%d , &x, &y); v[x].push_back(y); } for (int i = 1; i <= m; ++i) Fa[i] = i; int ans = 0; for (int i = 1; i <= n; ++i) { if (!v[i].size()) ++ans; else { int a = v[i][0]; for (int j = 1, _ = v[i].size(); j < _; ++j) merge(a, v[i][j]); } } for (int i = 1; i <= m; ++i) if (!vis[Find(i)]) ++ans, vis[Find(i)] = 1; printf( %d n , ans - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int c, a, b; cin >> a >> b >> c; cout << a * b * c - (a - 1) * (b - 1) * (c - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; long long int vi[100000], m, n, k, p1, p2, p3, p, f, t; long long int powmod(long long int a1, long long int b1) { long long int res = 1; a1 %= mod; for (; b1; b1 >>= 1) { if (b1 & 1) res = res * a1 % mod; a1 = (a1 * a1) % mod; } return res; } vector<long long int> v[20000]; void dfs(long long int s) { vi[s] = 1; long long int x = v[s].size(); for (long long int i1 = 0; i1 < (int)(x); i1++) if (!vi[v[s][i1]]) dfs(v[s][i1]); } int main() { cin >> n; for (long long int i = 0; i < (int)(n); i++) { cin >> p1; p1--; v[p1].push_back(i); v[i].push_back(p1); } long long int o = 0; for (long long int i = 0; i < (int)(n); i++) { if (!vi[i]) { o++; dfs(i); } } cout << o; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k, n1, n2, n3, t1, t2, t3; cin >> k >> n1 >> n2 >> n3 >> t1 >> t2 >> t3; multiset<int> A, B, C; for (int i = 0; i < n1; ++i) A.insert(0); for (int i = 0; i < n2; ++i) B.insert(0); for (int i = 0; i < n3; ++i) C.insert(0); for (int i = 0; i < k; ++i) { int a = *A.begin(); int b = *B.begin(); int c = *C.begin(); int t = max(a, max(b - t1, c - t1 - t2)); A.erase(A.begin()); A.insert(t + t1); B.erase(B.begin()); B.insert(t + t1 + t2); C.erase(C.begin()); C.insert(t + t1 + t2 + t3); } int ret = *max_element(C.begin(), C.end()); cout << ret; return 0; } |
#include <bits/stdc++.h> using namespace std; bool comp(const pair<int, int> &a, const pair<int, int> &b) { if (a.first > b.first) return true; if (a.first == b.first) return a.second > b.second; return false; } int main() { int n; scanf( %d , &n); vector<pair<int, int> > v; for (int i = 0; i < n; i++) { int k; scanf( %d , &k); int a[100001]; int ok = 1; for (int i = 0; i < k; i++) { scanf( %d , &a[i]); if (i && a[i] > a[i - 1]) ok = 0; } if (ok) v.push_back(make_pair(a[0], a[k - 1])); } sort(v.begin(), v.end(), comp); vector<int> lo, hi; for (auto i : v) { hi.push_back(i.first); lo.push_back(i.second); } long long ans = 0; for (int i = 0; i < v.size(); i++) { int m = upper_bound(hi.rbegin(), hi.rend(), lo[i]) - hi.rbegin(); ans += m; } printf( %lld , ((long long)n * (long long)n) - ans); } |
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; i++) { cin >> arr[i]; } long long c = 0; long long d = 0; long long e = 0; long long h; long long g; for (long long i = 0; i < n; i++) { if (arr[i] >= 0) { c++; } else { d++; } } if (n == 1) { cout << arr[0]; return 0; } if (c >= 1 && d >= 1) { for (long long i = 0; i < n; i++) { e = e + abs(arr[i]); } } else if (c == 0 || d == 0) { h = abs(arr[0]); for (long long i = 0; i < n; i++) { e = e + abs(arr[i]); h = min(h, abs(arr[i])); } e = e - 2 * h; } cout << e; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, i, j = 1, j2 = 0, j3, k, h = 1; string s; cin >> s; for (i = 1; i < s.length(); ++i) { if (j < h) j = h; if (h == s.length()) break; if (s[i - 1] != s[i] && i != 0) h++; else if (i == 0 && s[i] != s[s.length() - 1]) h++; else h = 1; if (i == s.length() - 1 && j2 == 0) { i = -1; j2 = 1; } } if (j < h) j = h; cout << j << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 123456; void pre(); void post(); int n; int mas[MAXN]; int solve[MAXN]; void read() { cin >> n; for (int i = 0; i < n; i++) { scanf( %lld , &mas[i]); solve[mas[i] - 1] = i; } } int main() { pre(); read(); int ans = 0; int l = 0; for (int i = 1; i < n; i++) { if (solve[i] < solve[i - 1]) { l = i; } ans = max(ans, i - l + 1); } ans = max(ans, n - l); cout << n - ans; post(); return 0; } void pre() {} void post() {} |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int streak = 0; int maxStreak = 0; char c = 2 ; for (int i = 0; i < s.length(); i++) { if (c != s[i]) { c = s[i]; streak = 0; } streak++; maxStreak = streak > maxStreak ? streak : maxStreak; } cout << (maxStreak >= 7 ? YES : NO ) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long bigmod(long long base, long long power) { if (power == 0) return 1; long long ret = bigmod(base, power / 2); ret = (ret * ret) % 1000000007; if (power & 1) ret = (ret * base) % 1000000007; return ret; } long long modInverse(long long n) { return (bigmod(n, 1000000007 - 2) % 1000000007); } const int MX = 1e6 + 7; int store[MX] = {}, check[MX] = {}, id[1007], n; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { int p; scanf( %d , &p); id[i] = p; store[p]++; } int mx = -1; for (int i = 0; i < MX; i++) mx = max(mx, store[i]); for (int i = 0; i < n; i++) { check[id[i]]++; if (check[id[i]] == mx) { cout << id[i] << n ; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; vector<long long int> array1, array2; for (long long int i = 0; i < n; i++) { long long int p; cin >> p; array1.push_back(p); array2.push_back(p); } sort(array2.begin(), array2.end()); long long int count = 0; for (long long int i = 0; i < n; i++) { if (array1[i] != array2[i]) { count++; } } if (count == 0 || count == 2) { cout << YES << endl; } else { cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void Read(T &x) { int f = 1; char t = getchar(); while (t < 0 || t > 9 ) { if (t == - ) f = -1; t = getchar(); } x = 0; while (t >= 0 && t <= 9 ) { x = x * 10 + t - 0 ; t = getchar(); } x *= f; } const int modulo = 1000000007; const int maxn = 1000005; int p, k; int fst[maxn], v[maxn << 1], nxt[maxn << 1], e_cn; bool flag[maxn], vis[maxn], cycle; void addedge(int x, int y) { e_cn++; v[e_cn] = y, nxt[e_cn] = fst[x], fst[x] = e_cn; } void input() { Read(p), Read(k); } int pwr(long long x, long long k) { long long re = 1; while (k > 0) { if (k & 1) re = 1ll * re * x % modulo; x = 1ll * x * x % modulo; k >>= 1; } return re; } void dfs(int cn) { vis[cn] = true; cycle |= flag[cn]; for (register int i = fst[cn]; i; i = nxt[i]) { if (!vis[v[i]]) { dfs(v[i]); } } } void solve() { if (k == 0) { cout << pwr(p, p - 1) << endl; return; } if (k == 1) { cout << pwr(p, p) << endl; return; } long long ans = 1; for (register int i = 0; i < p; i++) { int x = i, y = 1ll * i * k % p; if (x == y) flag[x] = true; else addedge(x, y), addedge(y, x); } for (register int i = 0; i < p; i++) { if (!vis[i]) { cycle = false; dfs(i); if (!cycle) ans = 1ll * ans * p % modulo; } } cout << ans << endl; } int main() { input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int t, x, y, a, b; int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while (t--) { cin >> x >> y >> a >> b; int tmp = (y - x) / (a + b); if (x + tmp * a == y - tmp * b) cout << tmp << n ; else cout << -1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { set<int> a; int n, b, c; cin >> n; for (int i = 0; i < n; i++) { cin >> b; a.insert(b); } if (a.size() == 1) std::cout << 0 << endl; else if (a.size() == 2) { b = *a.begin(); c = *(--a.end()); int a1; if ((c - b) % 2 == 1) a1 = c - b; else a1 = (c - b) / 2; cout << a1 << endl; } else if (a.size() == 3) { auto iter = a.begin(); int a1, a2, a3; a1 = *iter++; a2 = *iter++; a3 = *iter; if (a2 - a1 == a3 - a2) cout << a2 - a1 << endl; else cout << -1 << endl; } else cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 * 100 * 3 + 10; long long int mod = 998244353; long long int x[MAXN]; long long int y[MAXN]; pair<long long int, long long int> p[MAXN]; long long int f(long long int n) { long long int m = 1; for (int i = 1; i <= n; i++) { m *= i % mod; m = m % mod; } return m % mod; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; p[i].first = x[i]; p[i].second = y[i]; } sort(x, x + n); sort(y, y + n); sort(p, p + n); long long int k1 = 1; long long int k2 = 1; long long int c = 1; for (int i = 0; i < n - 1; i++) { long long int t = i, cnt = 1; bool bol = false; while (i < n && x[t] == x[i + 1]) { bol = true; cnt++; i++; } if (bol) { i--; } k1 *= f(cnt); k1 = k1 % mod; } for (int i = 0; i < n - 1; i++) { long long int t = i, cnt = 1; bool bol = false; while (i < n && y[t] == y[i + 1]) { bol = true; cnt++; i++; } if (bol) { i--; } k2 *= f(cnt); k2 = k2 % mod; } bool fl = false; for (int i = 1; i < n; i++) { if (p[i].second < p[i - 1].second) { fl = true; } } if (fl) { c = 0; } else { for (int i = 0; i < n - 1; i++) { long long int t = i, cnt = 1; bool bol = false; while (i < n && p[t].first == p[i + 1].first && p[t].second == p[i + 1].second) { bol = true; cnt++; i++; } if (bol) { i--; } c *= f(cnt); c = c % mod; } } cout << ((f(n) % mod - (k1 + k2) % mod + mod) % mod + c % mod) % mod << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1000010; int T, n, m, flag, cnt; vector<int> e[N], E[N]; int dfn[N], idx = 0, low[N], bl[N], lb, sta[N], top; template <typename T> void gi(T &x) { x = 0; register char c = getchar(), pre = 0; for (; c < 0 || c > 9 ; pre = c, c = getchar()) ; for (; c >= 0 && c <= 9 ; c = getchar()) x = x * 10ll + (c ^ 48); if (pre == - ) x = -x; } int ksm(int x, int y = mod - 2) { int w = 1; for (; y; y >>= 1, x = 1ll * x * x % mod) if (y & 1) w = 1ll * x * w % mod; return w; } void tarjan(int u) { dfn[u] = low[u] = ++idx, sta[++top] = u; for (auto v : e[u]) { if (!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]); else if (!bl[v]) low[u] = min(low[u], dfn[v]); } if (dfn[u] == low[u]) { bl[u] = ++lb; for (; sta[top] != u; --top) bl[sta[top]] = lb; --top; } } void solve() { gi(n), gi(m); for (int i = (1); i <= (n); i++) e[i].clear(), E[i].clear(), dfn[i] = low[i] = bl[i] = 0; for (int i = (1); i <= (m); i++) { int x, y; gi(x), gi(y); if (x == y) continue; e[y].push_back(x); } top = idx = lb = 0; for (int i = (1); i <= (n); i++) if (!dfn[i]) tarjan(i); if (lb == 1) { puts( No ); return; } puts( Yes ), cnt = 0; for (int i = (1); i <= (n); i++) for (auto v : e[i]) if (bl[i] != bl[v]) E[bl[i]].push_back(bl[v]); for (int i = (1); i <= (lb); i++) if (!E[i].size()) flag = i; for (int i = (1); i <= (n); i++) if (bl[i] != flag) ++cnt; printf( %d %d n , cnt, n - cnt); for (int i = (1); i <= (n); i++) if (bl[i] != flag) printf( %d , i); puts( ); for (int i = (1); i <= (n); i++) if (bl[i] == flag) printf( %d , i); puts( ); puts( ); } int main() { for (gi(T); T; --T) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = (long long)(2 * 1e5) + 5; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); map<int, int> mp; int n; cin >> n; vector<int> a(n + 1), b(n + 1), p(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; p[a[i]] = i; } for (int i = 1; i <= n; i++) { cin >> b[i]; } for (int i = 1; i <= n; i++) { int x = p[b[i]] - i; if (x < 0) { x += n; } mp[x]++; } int mx = 0; for (auto i : mp) { mx = max(mx, i.second); } cout << mx << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = 0; for (int i = 0; i < n; i++) { int x1, x2, y1, y2; cin >> x1 >> x2 >> y1 >> y2; sum += (max(x1, y1) - min(x1, y1) + 1) * (max(x2, y2) - min(x2, y2) + 1); } cout << sum << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; char buf[32]; int Solution() { int n, m; scanf( %d%d , &n, &m); vector<int> mas(n); for (int i = 0; i < n; ++i) scanf( %d , &mas[i]); sort(mas.begin(), mas.end()); map<string, int> fr; gets(buf); for (int i = 0; i < m; ++i) { gets(buf); string f = buf; if (fr.find(f) == fr.end()) fr.insert(make_pair(f, 1)); else fr[f]++; } map<string, int>::iterator it = fr.begin(); vector<int> z; while (it != fr.end()) { z.push_back(it->second); ++it; } sort(z.rbegin(), z.rend()); int res = 0; for (int i = 0; i < z.size(); ++i) res += z[i] * mas[i]; printf( %d , res); res = 0; for (int i = 0; i < z.size(); ++i) res += z[i] * mas[mas.size() - i - 1]; printf( %d n , res); return 0; } int main() { Solution(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int MOD = 1e9 + 7; long long dp[N][2]; void solve() { memset(dp, 0, sizeof(dp)); string a, b; cin >> a >> b; (a == b ? dp[0][1] = 1 : dp[0][0] = 1); int k; cin >> k; long long way_good = 0, way_bad = 0; string s = a; for (int i = 0; i < (int)(a).size(); i++) { (s == b ? ++way_good : ++way_bad); s = a.substr(i + 1, (int)(a).size() - i) + a.substr(0, i + 1); } for (int i = 1; i <= k; i++) { dp[i][1] = (((dp[i - 1][1] * (way_good - 1)) % MOD) + (dp[i - 1][0] * (way_good)) % MOD) % MOD; dp[i][0] = (((dp[i - 1][1] * (way_bad)) % MOD) + (dp[i - 1][0] * (way_bad - 1)) % MOD) % MOD; } cout << dp[k][1] % MOD << n ; return; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100005]; void solve() { long long n, k; cin >> n >> k; if (n == k) { cout << -1 << endl; return; }; if (k == 0) { cout << n << ; for (__typeof((n)) i = (1); i < (n); i++) cout << i << ; return; } if (k == n - 1) { for (__typeof((n + 1)) i = (1); i < (n + 1); i++) cout << i << ; return; } k = n - k; if (k % 2) cout << k << ; for (__typeof((k / 2)) i = (0); i < (k / 2); i++) cout << 2 * i + 2 - k % 2 << << 2 * i + 1 + k % 2 << ; for (__typeof((n + 1)) i = (k + 1); i < (n + 1); i++) cout << i << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; set<pair<int, int> > vis; int mx[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; int my[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; int main() { long long K; int N; cin >> K >> N; for (int i = 0; i < N; i++) { int x, y; cin >> x >> y; vis.insert(pair<int, int>(x, y)); } int i = 0; vector<pair<int, int> > cur; cur.push_back(pair<int, int>(0, 0)); vis.insert(pair<int, int>(0, 0)); int pinc, ppinc; for (i = 0; i < 100 && i < K; i++) { vector<pair<int, int> > nxt; for (int j = 0; j < cur.size(); j++) { int cx = cur[j].first, cy = cur[j].second; for (int m = 0; m < 8; m++) { int nx = cx + mx[m], ny = cy + my[m]; pair<int, int> t(nx, ny); if (!vis.count(t)) { vis.insert(t); nxt.push_back(t); } } } cur = nxt; ppinc = pinc; pinc = nxt.size(); } const int md = 1000000007; long long num = (K - i); long long dif = pinc - ppinc; num %= md; dif %= md; long long a = pinc + num * dif + pinc + dif; if (a % 2 == 0) { a /= 2; } else { num /= 2; } a %= md; num %= md; cout << (vis.size() - N + a * num) % md; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { fast(); long long n; cin >> n; if (n % 4 == 1) cout << 0 << << A << endl; else if (n % 4 == 0) cout << 1 << << A << endl; else if (n % 4 == 2) cout << 1 << << B << endl; else if (n % 4 == 3) cout << 2 << << A << endl; return 0; } |
#include <bits/stdc++.h> int min(int a, int b) { return a < b ? a : b; } int max(int a, int b) { return a > b ? a : b; } int oo[1 + (50 + 50 * 26 + 26) * 2], oh[1 + (50 + 50 * 26 + 26) * 2]; int link(int o, int h) { static int _ = 1; oo[_] = o, oh[_] = h; return _++; } int ii[(50 + 50 * 26 + 26)], jj[(50 + 50 * 26 + 26)], cc[(50 + 50 * 26 + 26) * 2], ww[(50 + 50 * 26 + 26)], ww_[(50 + 50 * 26 + 26)], m_; int ae[(1 + 50 + 26 + 1)], dd[(1 + 50 + 26 + 1)], kk[(1 + 50 + 26 + 1)], ff[(1 + 50 + 26 + 1)], n_; int pq[1 + (1 + 50 + 26 + 1)], iq[(1 + 50 + 26 + 1)], cnt; void link_(int i, int j, int c, int w) { int h = m_++; ii[h] = i, jj[h] = j, cc[h << 1] = c; ww[h] = w; ae[i] = link(ae[i], h << 1); ae[j] = link(ae[j], h << 1 | 1); } int less(int u, int v) { return dd[u] < dd[v] || dd[u] == dd[v] && kk[u] < kk[v]; } int i2(int i) { return (i *= 2) > cnt ? 0 : i < cnt && less(pq[i + 1], pq[i]) ? i + 1 : i; } void pq_up(int u) { int i, j, v; for (i = iq[u]; (j = i / 2) && less(u, v = pq[j]); i = j) pq[iq[v] = i] = v; pq[iq[u] = i] = u; } void pq_dn(int u) { int i, j, v; for (i = iq[u]; (j = i2(i)) && less(v = pq[j], u); i = j) pq[iq[v] = i] = v; pq[iq[u] = i] = u; } void pq_add_last(int u) { pq[iq[u] = ++cnt] = u; } int pq_remove_first() { int u = pq[1], v = pq[cnt--]; if (v != u) iq[v] = 1, pq_dn(v); iq[u] = 0; return u; } int dijkstra(int s, int t) { memset(dd, 0x3f, n_ * sizeof *dd); dd[s] = 0, pq_add_last(s); while (cnt) { int i, k, o; i = pq_remove_first(); k = kk[i] + 1; for (o = ae[i]; o; o = oo[o]) { int h_ = oh[o]; if (cc[h_] > 0) { int h = h_ >> 1, j = i ^ ii[h] ^ jj[h]; int d = dd[i] + ((h_ & 1) == 0 ? ww_[h] : -ww_[h]); if (dd[j] > d || dd[j] == d && kk[j] > k) { if (dd[j] == 0x3f3f3f3f) pq_add_last(j); dd[j] = d, kk[j] = k, ff[j] = h_; pq_up(j); } } } } return dd[t] != 0x3f3f3f3f; } int trace(int s, int t) { while (t != s) { int h_ = ff[t], h = h_ >> 1; cc[h_]--, cc[h_ ^ 1]++; t ^= ii[h] ^ jj[h]; } return 1; } int edmonds_karp(int s, int t) { int h, f, cost; for (h = 0; h < m_; h++) { int i = ii[h], j = jj[h]; dd[j] = min(dd[j], dd[i] + ww[h]); } for (h = 0; h < m_; h++) { int i = ii[h], j = jj[h]; ww_[h] = ww[h] + dd[i] - dd[j]; } f = 0; while (dijkstra(s, t)) { f += trace(s, t); for (h = 0; h < m_; h++) { int i = ii[h], j = jj[h]; if (dd[i] != 0x3f3f3f3f && dd[j] != 0x3f3f3f3f) { ww_[h] += dd[i] - dd[j]; } } } cost = 0; for (h = 0; h < m_; h++) cost += ww[h] * cc[h << 1 | 1]; return cost; } int main() { static char cc[50 * 2 + 1]; static int bb[50 * 2], kk[26]; int n, i, a; scanf( %d%s , &n, cc), n /= 2; n_ = 1 + n + 26 + 1; for (i = 0; i < n * 2; i++) scanf( %d , &bb[i]); for (i = 0; i < n; i++) link_(0, 1 + i, 2, 0); for (i = 0; i < n; i++) { int j = n * 2 - 1 - i; int ai = cc[i] - a ; int aj = cc[j] - a ; for (a = 0; a < 26; a++) { int b; if (a == ai && a == aj) b = max(bb[i], bb[j]); else if (a == ai) b = bb[i]; else if (a == aj) b = bb[j]; else b = 0; link_(1 + i, 1 + n + a, 1, -b); } } for (i = 0; i < n * 2; i++) { a = cc[i] - a ; kk[a]++; } for (a = 0; a < 26; a++) link_(1 + n + a, n_ - 1, kk[a], 0); printf( %d n , -edmonds_karp(0, n_ - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long t, n; long long qpow(long long a, long long b) { long long x = 1, base = a; while (b) { if (b & 1) { x = (x * base) % 1000000007; } base = (base * base) % 1000000007; b >>= 1; } return x % 1000000007; } int main() { ios::sync_with_stdio(0); cin >> n; long long ans = (qpow(4, ((1ll << n) - 2)) * 6) % 1000000007; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; bool check(int a, int b, int frst, int s) { return a * frst / (double)s >= (double)b; } int main() { int n, a, b, *arr; cin >> n >> a >> b; arr = new int[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr + 1, arr + n); for (int i = 1; i < n; i++) { arr[i] = arr[i] + arr[i - 1]; } int l = 0, r = n - 1, ans; while (l <= r) { int mid = (l + r) / 2; bool now = check(a, b, arr[0], arr[mid]); bool nx = check(a, b, arr[0], arr[mid + 1]); if (mid == n - 1 || (now && !nx)) { ans = mid; break; } else if (now && nx) { l = mid + 1; } else { r = mid - 1; } } cout << n - (ans + 1) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int dcmp(double p) { if (abs(p) < 1e-10) return 0; return p > 1e-10 ? 1 : -1; } struct Point { double x, y; Point() {} Point(double x, double y) : x(x), y(y) {} friend Point operator+(const Point &a, const Point &b) { return Point(a.x + b.x, a.y + b.y); } friend Point operator-(const Point &a, const Point &b) { return Point(a.x - b.x, a.y - b.y); } friend Point operator*(const Point &a, const double &p) { return Point(a.x * p, a.y * p); } friend Point operator/(const Point &a, const double &p) { return Point(a.x / p, a.y / p); } friend double operator*(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; } friend bool operator<(const Point &a, const Point &b) { return a.x < b.x || (dcmp(a.x - b.x) == 0 && a.y < b.y); } friend bool operator==(const Point &a, const Point &b) { return !dcmp(a.x - b.x) && !dcmp(a.y - b.y); } friend bool operator<=(const Point &a, const Point &b) { return a < b || a == b; } void Read() { scanf( %lf %lf , &x, &y); } } S, T, p[110]; double Dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; } double Len(const Point &a) { return sqrt(Dot(a, a)); } int n; void read() { S.Read(), T.Read(); scanf( %d , &n); for (int i = 1; i <= n; ++i) p[i].Read(); } bool in(Point a, Point b, Point c) { if (dcmp((a - b) * (c - b))) return false; if (c < b) swap(b, c); return b <= a && a <= c; } int inter(Point a, Point b, Point c, Point d) { double d1 = dcmp((c - a) * (b - a)), d2 = dcmp((d - a) * (b - a)); double d3 = dcmp((d - c) * (b - c)), d4 = dcmp((d - c) * (a - c)); if ((in(c, a, b) || in(d, a, b)) && dcmp((c - a) * (d - a))) return 2; if (d1 * d2 < 0 && d3 * d4 < 0) return 2; if (dcmp((c - a) * (d - a)) == 0 && d1 * d2 == 0 && d3 * d4 == 0) return 1; return 0; } Point getinter(const Point &p, const Point &v1, const Point &q, const Point &v2) { Point u = q - p; double t = (u * v2) / (v1 * v2); return p + v1 * t; } void work() { vector<Point> q; int cnt1 = 0; for (int i = 1; i <= n; ++i) { int type = inter(S, T, p[i], p[i % n + 1]); if (type == 1) ++cnt1; if (type == 2) q.push_back(getinter(S, T - S, p[i], p[i % n + 1] - p[i])); } sort(q.begin(), q.end()); q.resize(unique(q.begin(), q.end()) - q.begin()); if (cnt1 || cnt1 + q.size() <= 1) printf( %.10lf n , Len(T - S)); else { q.push_back(S), q.push_back(T); sort(q.begin(), q.end()); double temp1 = Len(q[1] - q[0]) + 2 * Len(q[2] - q[1]) + Len(q[3] - q[2]); double temp2 = 0, len = 0, sum = 0; int t1, t2; for (int i = 1; i <= n; ++i) sum = sum + Len(p[i] - p[i % n + 1]); for (int i = 1; i <= n; ++i) if (in(q[1], p[i], p[i % n + 1])) { t1 = i; break; } for (int i = 1; i <= n; ++i) if (in(q[2], p[i], p[i % n + 1])) { t2 = i; break; } if (t1 == n && t2 == 1) len = len + Len(p[1] - q[1]) + Len(p[1] - q[2]); else len = len + Len(p[t1 % n + 1] - q[1]) + Len(p[t2] - q[2]); for (int i = t1 % n + 1; i != t2; i = i % n + 1) len = len + Len(p[i] - p[i % n + 1]); temp2 = min(len, sum - len) + Len(q[1] - q[0]) + Len(q[3] - q[2]); printf( %.10lf n , min(temp1, temp2)); } } int main() { read(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 100020; int n, q; int a[Maxn]; int pre[Maxn], fin[Maxn], rel[Maxn]; int tree[Maxn << 2]; vector<int> V; int getid(int x) { return lower_bound(V.begin(), V.end(), x) - V.begin() + 1; } void add(int tar, int w, int l, int r, int x) { if (l == r) { tree[x] = max(tree[x], w); return; } int mid = (l + r) >> 1; if (tar <= mid) add(tar, w, l, mid, x << 1); else add(tar, w, mid + 1, r, x << 1 | 1); tree[x] = max(tree[x << 1], tree[x << 1 | 1]); } int query(int L, int R, int l, int r, int x) { if (L <= l && R >= r) return tree[x]; int mid = (l + r) >> 1; int ret = 0; if (L <= mid) ret = max(ret, query(L, R, l, mid, x << 1)); if (R > mid) ret = max(ret, query(L, R, mid + 1, r, x << 1 | 1)); return ret; } void cal(int *a, int *b, int flag = 0) { memset(tree, 0, sizeof(tree)); for (int i = 1; i <= n; i++) { if (flag) b[i] = query(a[i], V.size(), 1, V.size(), 1); else { b[i] = query(a[i] + 1, V.size(), 1, V.size(), 1); } add(a[i], i, 1, V.size(), 1); } } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i < n; i++) a[i] = abs(a[i + 1] - a[i]); n--; for (int i = 1; i <= n; i++) V.push_back(a[i]); sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end()); for (int i = 1; i <= n; i++) a[i] = getid(a[i]); cal(a, pre); reverse(a + 1, a + n + 1); cal(a, fin, 1); reverse(a + 1, a + n + 1); for (int i = 1; i <= n; i++) rel[i] = n + 1 - fin[n + 1 - i]; for (int i = 1; i <= q; i++) { int l, r; scanf( %d%d , &l, &r); r--; long long ans = 0; for (int j = l; j <= r; j++) { long long L = j - max(l - 1, pre[j]); long long R = min(r + 1, rel[j]) - j; ans += L * R * V[a[j] - 1]; } printf( %lld n , ans); } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int INF = 0x3f3f3f3f; template <typename X> inline bool minimize(X& p, X q) { if (p <= q) return 0; p = q; return 1; } template <typename X> inline bool maximize(X& p, X q) { if (p >= q) return 0; p = q; return 1; } char str[100]; bool v[10000005]; int a[5005]; int n, kk; void doit() { memset(v, 0, sizeof(v)); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); v[a[i]] = 1; } int q, x, tmp, left, xx; scanf( %d , &q); for (int ii = 1; ii <= q; ii++) { scanf( %d , &xx); int ans = 50; for (int i = 1; i <= n; i++) for (int j = 0; j <= kk; j++) { x = xx; tmp = a[i] * j; if (x < tmp) continue; if (x == tmp) { ans = min(ans, j); continue; } x -= tmp; left = kk - j; for (int k = 1; k <= left; k++) if (x % k == 0) { if (x / k >= 10000005) continue; if (v[x / k]) { ans = min(ans, j + k); break; } } } if (ans != 50) printf( %d n , ans); else printf( %d n , -1); } } int main() { while (scanf( %d%d , &n, &kk) != EOF) doit(); } |
#include <bits/stdc++.h> using namespace std; int i, dp[100000], t; string s; int main() { cin >> s; for (i = 0; i < s.size(); i++) if (s[i] >= a ) { dp[i] = dp[i - 1]; t++; } else dp[i] = min(dp[i - 1] + 1, t); cout << dp[s.size() - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int nbPairs[5001][5001]; const int MOD = 1e9 + 7; int main() { char s[5001], t[5001]; scanf( %s%s , &s, &t); int ss = strlen(s), st = strlen(t); for (int is = ss - 1; is >= 0; is--) for (int it = st - 1; it >= 0; it--) { if (s[is] == t[it]) nbPairs[is][it] += 1 + nbPairs[is + 1][it + 1]; nbPairs[is][it] += nbPairs[is][it + 1]; nbPairs[is][it] %= MOD; } int a = 0; for (int i = 0; i < ss; i++) { a += nbPairs[i][0]; a %= MOD; } printf( %d n , a); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = 3.1415926535897932384626433832795; const string task = ; template <class T> T sqr(T first) { return first * first; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } pair<int, int> operator-(pair<int, int> a, pair<int, int> b) { return make_pair(a.first - b.first, a.second - b.second); } pair<int, int> operator+(pair<int, int> a, pair<int, int> b) { return make_pair(a.first + b.first, a.second + b.second); } long long dist(pair<int, int> a, pair<int, int> b) { return sqr(a.first - b.first) + sqr(a.second - b.second); } const int nmax = 1010; pair<int, int> p[nmax]; int n, k, m; pair<long long, pair<int, int> > e[nmax * nmax]; pair<int, int> die[nmax * 40]; int res[nmax]; int ord[nmax]; vector<int> g[nmax]; int cnt; int deg[nmax]; set<pair<int, int> > alive; void kill(int v) { res[v] = 1; alive.erase(make_pair(-deg[v], v)); for (int i = 0; i < (int)(g[v].size()); i++) { int u = g[v][i]; if (alive.count(make_pair(-deg[u], u))) { alive.erase(make_pair(-deg[u], u)); deg[u]--; if (deg[u] > 0) alive.insert(make_pair(-deg[u], u)); } } } void rekill(int v) { res[v] = 0; for (int i = 0; i < (int)(g[v].size()); i++) { int u = g[v][i]; if (alive.count(make_pair(-deg[u], u)) || deg[u] == 0) { alive.erase(make_pair(-deg[u], u)); deg[u]++; alive.insert(make_pair(-deg[u], u)); } } alive.insert(make_pair(-deg[v], v)); } bool go(int kl) { if (kl > k) return 0; if (alive.size() == 0) return 1; pair<int, int> now = *alive.begin(); int v = now.second; if (alive.size() / (-now.first + 1) + kl > k) return 0; if (now.first == -1) { int w = alive.size(); assert(w % 2 == 0); if (kl + w / 2 > k) return 0; while (alive.size() > 0) { pair<int, int> now = *alive.begin(); kill(now.second); kl++; } assert(kl <= k); return 1; } if (kl + deg[v] <= k) { vector<int> buf; int nkl = kl; for (int i = 0; i < (int)(g[v].size()); i++) if (res[g[v][i]] == 0) { buf.push_back(g[v][i]); kill(g[v][i]); nkl++; } if (go(nkl)) return 1; for (int i = (int)(buf.size()) - 1; i >= 0; i--) rekill(buf[i]); } if (kl + 1 <= k) { kill(v); if (go(kl + 1)) return 1; rekill(v); } return 0; } bool check(int st) { st++; int e1 = 0; for (int i = st; i < m; i++) die[e1++] = e[i].second; for (int i = 0; i < (int)(n); i++) g[i].clear(); for (int i = 0; i < (int)(e1); i++) { g[die[i].first].push_back(die[i].second); g[die[i].second].push_back(die[i].first); } for (int i = 0; i < (int)(n); i++) deg[i] = g[i].size(); alive.clear(); for (int i = 0; i < (int)(n); i++) if (deg[i] > 0) alive.insert(make_pair(-deg[i], i)); memset(res, 0, sizeof res); return go(0); } int main() { cin >> n >> k; for (int i = 0; i < (int)(n); i++) scanf( %d %d , &p[i].first, &p[i].second); m = 0; for (int i = 0; i < (int)(n); i++) for (int j = i + 1; j < n; j++) e[m++] = make_pair(dist(p[i], p[j]), make_pair(i, j)); sort(e, e + m); int r = m - 1, l = max(0, r - n * k); while (l < r) { int mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid + 1; } check(l); vector<int> buf; for (int i = 0; i < (int)(n); i++) if (res[i] > 0) res[i] = 1; else buf.push_back(i); while (buf.size() > n - k) { res[buf.back()] = 1; buf.pop_back(); } for (int i = 0; i < (int)(n); i++) if (res[i]) cout << i + 1 << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2000005; char str[MAXN]; struct Palindromic_Tree { vector<pair<int, int>> next[MAXN]; int fail[MAXN]; int cnt[MAXN]; int num[MAXN]; int len[MAXN]; int S[MAXN]; int last; int n; int p; int newnode(int l) { next[p].clear(); cnt[p] = 0; num[p] = 0; len[p] = l; return p++; } void init() { p = 0; next[0].clear(); next[1].clear(); newnode(0); newnode(-1); last = 0; n = 0; S[n] = -1; fail[0] = 1; } int get_fail(int x) { while (S[n - len[x] - 1] != S[n]) x = fail[x]; return x; } int find(int cur, int c) { for (int i = 0; i < next[cur].size(); i++) { if (next[cur][i].first == c) return next[cur][i].second; } return 0; } int add(int c) { c -= a ; S[++n] = c; int cur = get_fail(last); int k = find(cur, c); if (k == 0) { int now = newnode(len[cur] + 2); fail[now] = find(get_fail(fail[cur]), c); next[cur].push_back(make_pair(c, now)); num[now] = num[fail[now]] + 1; } last = find(cur, c); cnt[last]++; return num[last]; } void count() { for (int i = p - 1; i >= 0; --i) cnt[fail[i]] += cnt[i]; } } tree; long long head[MAXN], tail[MAXN]; int main() { int n; while (~scanf( %d , &n)) { memset(head, 0, sizeof(head)); memset(tail, 0, sizeof(tail)); scanf( %s , str + 1); tree.init(); for (int i = 1; i <= n; i++) { tail[i] = tree.add(str[i]); } tree.init(); for (int i = n; i >= 1; i--) { head[i] = ((head[i + 1] + tree.add(str[i])) % 51123987) % 51123987; } long long ans = head[1] * (head[1] - 1) / 2 % 51123987; for (int i = 2; i <= n; i++) ans = (ans - tail[i - 1] * head[i] % 51123987) % 51123987; ans = (ans + 51123987) % 51123987; printf( %lld n , ans); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.