func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 998244353; void add(int &x, int y) { x += y; if (x >= MOD) x -= MOD; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> x(n), y(n), s(n); for (int i = 0; i < (int)(n); i++) cin >> x[i] >> y[i] >> s[i]; vector<int> cost(n + 1); for (int i = 0; i < (int)(n); i++) { int j = lower_bound((x).begin(), (x).end(), y[i]) - x.begin(); cost[i + 1] = (x[i] - y[i]) % MOD; add(cost[i + 1], cost[i]); add(cost[i + 1], MOD - cost[j]); add(cost[i + 1], cost[i]); } for (int i = (int)(n)-1; i >= ((int)0); i--) add(cost[i + 1], MOD - cost[i]); int ans = (x.back() + 1) % MOD; for (int i = 0; i < (int)(n); i++) if (s[i]) add(ans, cost[i + 1]); cout << ans % MOD << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool checkbitt(long long int num, int pos); long long int setbitt(long long int num, long long int pos); long long int resetbitt(long long int num, int pos); const long long int mod = 1e9 + 7; const long long int N = 1e6 + 10; long long int count(long long int x) { x--; return (x * (x + 1)) / 2; } int solve() { int n; cin >> n; pair<int, int> arr[n]; map<int, int> a; map<int, int> b; map<pair<int, int>, int> c; long long int bad = 0; for (int i = 0; i < n; i++) { cin >> arr[i].first >> arr[i].second; a[arr[i].first]++; b[arr[i].second]++; c[arr[i]]++; bad += c[arr[i]] - 1; } long long int res = 0; for (auto x : a) { res += count(x.second); } for (auto x : b) { res += count(x.second); } cout << res - bad << endl; return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int cs = 1; int cn = 1; while (cs--) { solve(); } } bool checkbitt(long long int num, int pos) { return (num >> pos) & 1; } long long int setbitt(long long int num, long long int pos) { return (1 << pos) | num; } long long int resetbitt(long long int num, int pos) { if (!checkbitt(num, pos)) return num; else return (1 << pos) ^ num; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; const int N = 2e5 + 5; const double pi = acos(-1); int t; int main() { cin >> t; while (t--) { int n, m; cin >> n >> m; if (n % m == 0) cout << YES << n ; else cout << NO << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, ans = 1e9; vector<vector<int> > cnt(65); vector<set<int> > ed; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; ed.resize(n + 1); bool tw = false; for (int i = 0; i < n; i++) { long long a; cin >> a; int d = 0; while (a && !(tw)) { if (a & 1) { for (int k : cnt[d]) { if (ed[k].find(i) == ed[k].end()) { ed[k].insert(i); ed[i].insert(k); } } cnt[d].push_back(i); if (cnt[d].size() > 2) tw = true; } a >>= 1, d++; } } if (tw) { cout << 3 << n ; return 0; } for (int j = 0; j < 64; j++) { unordered_set<int> vis; if (cnt[j].size() == 2) { queue<pair<int, int> > q; for (int k : ed[cnt[j][0]]) if (k != cnt[j][1]) q.push(make_pair(k, 1)); vis.insert(cnt[j][0]); while (!q.empty()) { pair<int, int> cur = q.front(); q.pop(); if (vis.find(cur.first) != vis.end()) continue; vis.insert(cur.first); if (cur.first == cnt[j][1]) { ans = min(ans, cur.second); break; } for (int k : ed[cur.first]) q.push(make_pair(k, cur.second + 1)); } } } if (ans == 1e9) cout << -1 << n ; else cout << ans + 1 << n ; } |
#include <bits/stdc++.h> using namespace std; const long long INF64 = 1e18 + 1337; const int INF32 = 1e9 + 228; const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, s; cin >> n >> s; vector<long long> a(n); long long sum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } if (sum < s) { cout << -1; return 0; } sort(a.begin(), a.end(), greater<int>()); for (int i = 0; i < n - 1; i++) s -= (a[i] - a[n - 1]); while (s > 0 && a[n - 1] > 0) { s -= n; a[n - 1]--; } cout << a[n - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; pair<long long, long long> P, d[100000]; double rm, rM; int main() { scanf( %d%I64d%I64d , &n, &P.first, &P.second); for (int i = 0; i < n; i++) { pair<long long, long long> Q; scanf( %I64d%I64d , &Q.first, &Q.second); double t = (P.first - Q.first) * (P.first - Q.first) + (P.second - Q.second) * (P.second - Q.second); if (i == 0) rm = rM = t; else { if (rm > t) rm = t; if (rM < t) rM = t; } d[i] = Q; } for (int i = 0; i < n; i++) { int j = (i + 1) % n; pair<long long, long long> Q = make_pair(d[j].first - d[i].first, d[j].second - d[i].second); double t = Q.first * (P.first - d[i].first) + Q.second * (P.second - d[i].second); t /= (Q.first * Q.first + Q.second * Q.second); if (0 <= t && t <= 1) { long long a = d[j].second - d[i].second; long long b = -(d[j].first - d[i].first); long long c = -(a * d[i].first + b * d[i].second); double t = (a * P.first + b * P.second + c); t = t * t / (a * a + b * b); if (t < rm) rm = t; } } double r = rM - rm; printf( %.9f n , r * 3.1415926535897932384626433832795); return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << p.second << ) ; } template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v) { cout << [ ; for (int i = 0; i < v.size(); i++) { if (i) cout << , ; cout << v[i]; } return cout << ] ; } template <typename A, typename B> istream &operator>>(istream &cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } mt19937 rng(61378913); void usaco(string filename) { freopen((filename + .in ).c_str(), r , stdin); freopen((filename + .out ).c_str(), w , stdout); } const long double pi = 3.14159265358979323846; const long long mod = 1000000007; namespace modop { long long madd(long long a, long long b) { return (a + b) % mod; } long long msub(long long a, long long b) { return (((a - b) % mod) + mod) % mod; } long long mmul(long long a, long long b) { return ((a % mod) * (b % mod)) % mod; } long long mpow(long long base, long long exp) { long long res = 1; while (exp) { if (exp % 2 == 1) { res = (res * base) % mod; } exp >>= 1; base = (base * base) % mod; } return res; } long long minv(long long base) { return mpow(base, mod - 2); } long long mdiv(long long a, long long b) { return mmul(a, minv(b)); } } // namespace modop using namespace modop; long long n, m, k, q, l, r, x, y, z; long long a[1000005]; long long b[1000005]; long long c[1000005]; string second, t; long long ans = 0; map<long long, long long> cnt; pair<long long, long long> vals[1000005]; void solve(int tc) { cin >> n >> k; cnt.clear(); for (int ele = 0; ele < n; ele++) cin >> a[ele]; ; if (k == 1) { cout << (n & 1) << n ; return; } for (long long i = 0; i < (n); ++i) ++cnt[a[i]]; long long second = cnt.size(); int pos = 0; for (pair<long long, long long> x : cnt) vals[pos++] = x; reverse(vals, vals + second); long long req = 0, last = vals[0].first, ans = 0; bool fin = 0; for (long long i = 0; i < (second); ++i) { long long diff = last - vals[i].first; last = vals[i].first; for (long long j = 0; j < (diff); ++j) { if (req == 0) break; if (req > 1000000) { fin = 1; break; } req *= k; if (req > 1000000) { fin = 1; break; } } long long c = vals[i].second; if (fin) { ans = msub(ans, c * mpow(k, vals[i].first)); continue; } if (c <= req) { req -= c; ans = msub(ans, c * mpow(k, vals[i].first)); } else { c -= req; ans = 0; req = 0; if (c & 1) { req = 1; ans = (ans + mpow(k, vals[i].first)) % mod; } } } cout << (ans % mod) << n ; } int main() { { ios_base::sync_with_stdio(false); } { cin.tie(NULL); cout.tie(NULL); } int tc = 1; cin >> tc; for (int t = 0; t < tc; t++) solve(t); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int i, j, k, n, m, vis[maxn], cnt, Q[maxn], top; void dfs(int now) { vis[now]++; if (!vis[now * 2 % n]) dfs(now * 2 % n); if (!vis[(now * 2 + 1) % n]) dfs((now * 2 + 1) % n); Q[++top] = now; } int main() { cin >> n; if (n & 1) cout << -1 << endl; else { dfs(0); while (top) cout << Q[top--] << ; cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<long long int, long long int> > getfac(long long int n) { vector<pair<long long int, long long int> > ret; for (long long int i = 1; i < sqrt(n) + 1; i++) { if (n % i == 0) { ret.push_back({min({i, n / i}), max({i, n / i})}); } } return ret; } bool fun1(pair<long long int, long long int> a, pair<long long int, long long int> b) { return a.first + a.second < b.first + b.second; } bool isin(pair<long long int, long long int> a, pair<long long int, long long int> b) { return b.first <= a.first && a.second >= b.second; } long long int max(long long int a, long long int b) { if (a <= b) return a; return b; } long long int min(long long int a, long long int b) { if (a <= b) return b; return a; } int main() { long long int a, b, c, d, ans = 1e17; cin >> a >> b; c = a; d = b; a = min({c, d}); b = max({c, d}); vector<pair<long long int, long long int> > af = getfac(a), bf = getfac(b), cf = getfac(a + b); sort(cf.begin(), cf.end(), fun1); for (int i = 0; i < cf.size(); i += 1) { long long int p = cf[i].first, q = cf[i].second; for (int j = 0; j < af.size(); j++) { if (isin(cf[i], af[j])) { ans = min({ans, 2 * (p + q)}); } } for (int j = 0; j < bf.size(); j++) { if (isin(cf[i], bf[j])) { ans = min({ans, 2 * (p + q)}); } } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = (2e5 + 42); const int MAXLOG = 20; const int64_t inf = (int64_t)1e18; int n, m, S; vector<pair<int, int> > G[MAXN]; void read() { cin >> n >> m >> S; for (int i = 0; i < m; i++) { int u, v, w; cin >> u >> v >> w; G[u].push_back({v, w}); G[v].push_back({u, w}); } } bool in_queue[MAXN]; vector<int> pars[MAXN], adj[MAXN]; int64_t dist[MAXN]; int par[MAXN][MAXLOG], d[MAXN]; int lca(int u, int v) { if (d[u] < d[v]) swap(u, v); for (int lg = MAXLOG - 1; lg >= 0; lg--) if (d[par[u][lg]] >= d[v]) u = par[u][lg]; if (u == v) return u; for (int lg = MAXLOG - 1; lg >= 0; lg--) if (par[u][lg] != par[v][lg]) u = par[u][lg], v = par[v][lg]; return par[u][0]; } void spfa(int st) { for (int i = 0; i <= n; i++) dist[i] = inf, adj[i].clear(), in_queue[i] = 0; queue<int> Q; in_queue[st] = 1; dist[st] = 0; Q.push(st); while (!Q.empty()) { int u = Q.front(); in_queue[u] = 0; Q.pop(); for (auto e : G[u]) { int v = e.first, w = e.second; if (dist[v] > dist[u] + w) { dist[v] = dist[u] + w; if (!in_queue[v]) Q.push(v); in_queue[v] = 1; } } } for (int i = 1; i <= n; i++) for (auto e : G[i]) if (dist[e.first] == dist[i] + e.second) pars[e.first].push_back(i); } int tr_sz[MAXN]; void dfs(int u) { tr_sz[u] = 1; for (int v : adj[u]) { dfs(v); tr_sz[u] += tr_sz[v]; } } void solve() { spfa(S); int ans = 0; vector<pair<int64_t, int> > order; for (int i = 1; i <= n; i++) if (dist[i] < inf) order.push_back({dist[i], i}); sort(order.begin(), order.end()); for (int i = 0; i < MAXLOG; i++) par[S][i] = S; for (pair<int64_t, int> e : order) { if (e.second == S) continue; int u = e.second; int l = pars[u][0]; for (int anc : pars[u]) l = lca(l, anc); par[u][0] = l; d[u] = d[l] + 1; adj[l].push_back(u); for (int lg = 1; lg < MAXLOG; lg++) par[u][lg] = par[par[u][lg - 1]][lg - 1]; } dfs(S); for (int i = 1; i <= n; i++) if (dist[i] < inf && i != S) ans = max(ans, tr_sz[i]); cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); read(); solve(); return 0; } |
#include <bits/stdc++.h> int main() { int n, ce = 0, co = 0, A[100], i, o = 0, e = 0; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &A[i]); for (i = 0; i < n; i++) { if (A[i] % 2 == 0) ce++; if (A[i] % 2 != 0) co++; } if (co == 1) { for (i = 0; i < n; i++) { if (A[i] % 2 != 0) { o++; break; } else o++; } printf( %d , o); } if (ce == 1) { for (i = 0; i < n; i++) { if (A[i] % 2 == 0) { e++; break; } else e++; } printf( %d , e); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long c[(1 << 20)]; struct SuffixTree { int s[(1 << 20)]; map<int, int> to[(1 << 20)]; int len[(1 << 20)] = {(1 << 30)}, fpos[(1 << 20)], link[(1 << 20)], id[(1 << 20)]; int node, pos, sz = 1, n = 0; int make_node(int p, int l, int k) { fpos[sz] = p; len[sz] = l; id[sz] = k; return sz++; } void go_edge() { while (pos > len[to[node][s[n - pos]]]) { node = to[node][s[n - pos]]; pos -= len[node]; } } void add(int c, int k) { s[n++] = c; pos++; int last = 0; while (pos > 0) { go_edge(); int edge = s[n - pos]; int& v = to[node][edge]; int t = s[fpos[v] + pos - 1]; if (v == 0) { v = make_node(n - pos, (1 << 30), k); link[last] = node; last = 0; } else if (t == c) { link[last] = node; return; } else { int u = make_node(fpos[v], pos - 1, k); to[u][c] = make_node(n - 1, (1 << 30), k); to[u][t] = v; fpos[v] += pos - 1; len[v] -= pos - 1; v = u; link[last] = u; last = u; } if (node == 0) pos--; else node = link[node]; } } long long rr; int asd[(1 << 20)]; long long dfs(int x, int d) { long long r = 0; d += len[x]; if (!((int)(to[x]).size())) r = c[id[x]]; else { for (auto p : to[x]) r += dfs(p.second, d); } if (len[x]) rr = max(rr, r * d); return r; } long long doit() { for (int i = n - 1; i >= 0; --i) { if (s[i] <= 0) asd[i] = 0; else asd[i] = asd[i + 1] + 1; } for (int i = 1, ThxDem = sz; i < ThxDem; ++i) len[i] = min(len[i], asd[fpos[i]]); len[0] = 0; rr = 0; dfs(0, 0); return rr; } }; int n; SuffixTree t; char _s[(1 << 20)]; int main() { scanf( %d , &n); for (int i = 0, ThxDem = n; i < ThxDem; ++i) { scanf( %s , _s); for (int j = 0; _s[j]; ++j) { t.add(_s[j], i); } t.add(-i, i); } for (int i = 0, ThxDem = n; i < ThxDem; ++i) scanf( %lld , c + i); printf( %lld n , t.doit()); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long a[100000], b[100000]; vector<pair<int, long long>> connections[100000]; pair<long long, long long> needed(int node) { long long temp = a[node] - b[node]; long long temp2 = temp / 1000000007; temp %= 1000000007; for (const pair<int, int> edge : connections[node]) { pair<long long, long long> curr = needed(edge.first); if (curr.first > 0 || curr.first == 0 && curr.second >= 0) { curr.first *= edge.second; curr.second *= edge.second; } temp += curr.second; temp2 += temp / 1000000007; temp %= 1000000007; temp2 += curr.first; } return make_pair(temp2, temp); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < (n); i++) cin >> b[i]; for (int i = 0; i < (n); i++) cin >> a[i]; for (int i = 0; i < (n - 1); i++) { int x; long long k; cin >> x >> k; connections[--x].push_back(make_pair(i + 1, k)); } pair<long long, long long> res = needed(0); if (res.first <= 0 && res.second <= 0) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {-1, 1, 0, 0, 0, 0, 0, 0}; int dy[] = {0, 0, 1, -1, 0, 0, 0, 0}; const int inf = 1000000000; const double eps = 0.000000009; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; string a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long ans = 7; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int diff = 0; for (int k = 0; k < 6; k++) { if (a[i][k] != a[j][k]) diff++; } ans = min(ans, (long long)ceil(diff / 2.0)); } } cout << ans - 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; multiset<long long> s; long long now = 0; for (int i = 1; i <= n; i++) { long long a; cin >> a; a -= i; s.insert(a); s.insert(a); now -= a; long long x = (*s.rbegin()); s.erase(s.find(x)); now += x; } cout << now << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7; int n, m; int u[N], v[N]; vector<int> G[N]; bool check(int m) { for (int i = 1; i <= n; ++i) G[i].clear(); vector<int> in(n + 1, 0); for (int i = 1; i <= m; ++i) { G[u[i]].push_back(v[i]); ++in[v[i]]; } queue<int> q; for (int i = 1; i <= n; ++i) if (!in[i]) q.push(i); while (q.size()) { int u = q.front(); q.pop(); if (q.size()) return false; for (int v : G[u]) if (--in[v] == 0) q.push(v); } return true; } int main() { ios_base::sync_with_stdio(0); scanf( %d%d , &n, &m); for (int i = 1; i <= m; ++i) scanf( %d%d , u + i, v + i); int l = 1, r = m; while (l <= r) { int m = l + r >> 1; if (check(m)) r = m - 1; else l = m + 1; } if (l == m + 1) l = -1; printf( %d n , l); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; const int MOD = 1e9 + 7; const int INF = 1e9; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; int a[n][m], b[n][m]; vector<int> col[n + m], col2[n + m]; int i, j; bool ans = true; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> a[i][j]; } } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> b[i][j]; } } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { col[i + j].push_back(a[i][j]); col2[i + j].push_back(b[i][j]); } } for (i = 0; i < (n + m - 1); i++) { sort(col[i].begin(), col[i].end()); sort(col2[i].begin(), col2[i].end()); if (col[i] != col2[i]) { ans = false; } } if (ans) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n; int p[N]; pair<int, int> v[N]; void solve(int nx, int nnx) { int curr = 1; for (int i = 1; i <= n; i++) p[i] = 0; p[curr] = nx; p[nx] = nnx; curr = nx; bool okay = true; for (int i = 2; i <= n; i++) { if (v[curr].first == nnx) { if (!p[nnx]) p[nnx] = v[curr].second; nx = nnx; nnx = v[curr].second; curr = nx; } else if (v[curr].second == nnx) { if (!p[nnx]) p[nnx] = v[curr].first; nx = nnx; nnx = v[curr].first; curr = nx; } else { okay = false; break; } } curr = 1; for (int i = 1; i <= n; i++) { curr = p[curr]; } if (curr != 1) okay = false; if (okay) { curr = 1; for (int i = 1; i <= n; i++) { printf( %d , curr); curr = p[curr]; } exit(0); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x, y; scanf( %d %d , &x, &y); v[i].first = x; v[i].second = y; } solve(v[1].first, v[1].second); solve(v[1].second, v[1].first); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int tmp = 3; int x = 1, y = 2; int n; cin >> n; bool flag = true; for (int i = 1; i <= n; i++) { int q; cin >> q; if (q == tmp) { flag = false; } if (q == x) swap(tmp, y); else swap(tmp, x); } if (flag) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename...> static inline int getchar_unlocked(void) { return getchar(); } template <typename...> static inline void putchar_unlocked(int c) { putchar(c); } void reader(int& x) { int k, m = 0; x = 0; for (;;) { (k) = getchar_unlocked(); if (k == - ) { m = 1; break; } if ( 0 <= k && k <= 9 ) { x = k - 0 ; break; } } for (;;) { (k) = getchar_unlocked(); if (k < 0 || k > 9 ) break; x = x * 10 + k - 0 ; } if (m) x = -x; } void reader(long long& x) { int k, m = 0; x = 0; for (;;) { (k) = getchar_unlocked(); if (k == - ) { m = 1; break; } if ( 0 <= k && k <= 9 ) { x = k - 0 ; break; } } for (;;) { (k) = getchar_unlocked(); if (k < 0 || k > 9 ) break; x = x * 10 + k - 0 ; } if (m) x = -x; } int reader(char c[]) { int i, s = 0; for (;;) { (i) = getchar_unlocked(); if (i != && i != n && i != r && i != t && i != EOF) break; } c[s++] = i; for (;;) { (i) = getchar_unlocked(); if (i == || i == n || i == r || i == t || i == EOF) break; c[s++] = i; } c[s] = 0 ; return s; } template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); } template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); } template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V& w) { reader(x); reader(y); reader(z); reader(w); } void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x < 0) m = 1, x = -x; while (x) f[s++] = x % 10, x /= 10; if (!s) f[s++] = 0; if (m) putchar_unlocked( - ); while (s--) putchar_unlocked(f[s] + 0 ); putchar_unlocked(c); } void writer(long long x, char c) { int s = 0, m = 0; char f[20]; if (x < 0) m = 1, x = -x; while (x) f[s++] = x % 10, x /= 10; if (!s) f[s++] = 0; if (m) putchar_unlocked( - ); while (s--) putchar_unlocked(f[s] + 0 ); putchar_unlocked(c); } void writer(const char c[]) { int i; for (i = 0; c[i] != 0 ; i++) putchar_unlocked(c[i]); } void writer(const char x[], char c) { int i; for (i = 0; x[i] != 0 ; i++) putchar_unlocked(x[i]); putchar_unlocked(c); } template <class T> void writerLn(T x) { writer(x, n ); } template <class T, class S> void writerLn(T x, S y) { writer(x, ); writer(y, n ); } template <class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ); writer(y, ); writer(z, n ); } template <class T> void writerArr(T x[], int n) { if (!n) { putchar_unlocked( n ); return; } for (int i = 0; i < (n - 1); i++) writer(x[i], ); writer(x[n - 1], n ); } template <class T> void chmax(T& l, const T r) { l = max(l, r); } template <class T> void chmin(T& l, const T r) { l = min(l, r); } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; } template <class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; } long long mod_pow(long long a, long long n, long long mod) { long long ret = 1; long long p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } struct P { long double x, y; P() : x(0), y(0) {} P(const long double& x, const long double& y) : x(x), y(y) {} P operator+(const P& a) const { return P(x + a.x, y + a.y); } P& operator+=(const P& a) { x += a.x; y += a.y; return *this; } P operator-(const P& a) const { return P(x - a.x, y - a.y); } P& operator-=(const P& a) { x -= a.x; y -= a.y; return *this; } P operator*(const long double a) const { return P(a * x, a * y); } P& operator*=(const long double a) { x *= a; y *= a; return *this; } P operator/(const long double a) const { return P(x / a, y / a); } P& operator/=(const long double a) { x /= a; y /= a; return *this; } bool operator<(const P& a) const { return (x != a.x) ? (x < a.x) : (y < a.y); } }; const double PI = acos(-1); P rot(const P& a, double theta) { theta = -theta / 180 * PI; return P(a.x * cos(theta) - a.y * sin(theta), a.x * sin(theta) + a.y * cos(theta)); } long double SQ(long double x) { return x * x; } long double dist2(const P& a, const P& b) { return SQ(a.x - b.x) + SQ(a.y - b.y); } long double abs2(const P& p) { return SQ(p.x) + SQ(p.y); } long double dot(const P& a, const P& b) { return a.x * b.x + a.y * b.y; } long double cross(const P& a, const P& b) { return a.x * b.y - a.y * b.x; } long double abs(const P& p) { return sqrt(abs2(p)); } double arg(const P& a) { double t = atan2(a.y, a.x); return t < 0 ? t + 2 * PI : t; } struct Q { long double x, y; int argsum; static Q zero() { Q ret = {0, 0, 0}; return ret; } bool is_zero() const { return x == 0 && y == 0; } Q operator+(const Q& r) const { if (is_zero()) return r; else if (r.is_zero()) return *this; P p1(x, y); P p2(r.x, r.y); p2 = rot(p2, argsum); P cur = p1 + p2; Q ret; ret.x = cur.x; ret.y = cur.y; ret.argsum = argsum + r.argsum; return ret; } }; class seg_tree { public: vector<int> len, args; vector<Q> dat; int n; void propagate(int i) { dat[i] = dat[i * 2 + 1] + dat[i * 2 + 2]; } void init(int size) { n = 1; len.resize(size, 1); args.resize(size); while (n < size) n <<= 1; dat.resize(2 * n - 1); fill(dat.begin(), dat.end(), Q::zero()); for (int i = 0; i < size; i++) dat[n - 1 + i].x = 1.0; for (int i = n - 2; i >= 0; i--) propagate(i); } void update_k(int k) { P cur(len[k], 0); cur = rot(cur, args[k]); k += n - 1; dat[k].x = cur.x; dat[k].y = cur.y; dat[k].argsum = args[k - n + 1]; } void update_len(int k, int len) { this->len[k] += len; update_k(k); k += n - 1; while (k > 0) { k = (k - 1) / 2; propagate(k); } } void update_arg(int k, int arg) { args[k] += arg; update_k(k); k += n - 1; while (k > 0) { k = (k - 1) / 2; propagate(k); } } void update_query(int t, int id, int val) { id--; if (t == 1) { update_len(id, val); } else { update_arg(id, val); } } Q query(int a, int b) { return query(a, b, 0, 0, n); } Q query(int a, int b, int k, int l, int r) { if (r <= a || b <= l) return Q::zero(); if (a <= l && r <= b) return dat[k]; int md = (l + r) / 2; int nl = k * 2 + 1, nr = nl + 1; Q lval = query(a, b, nl, l, md); Q rval = query(a, b, nr, md, r); return lval + rval; } }; P q2p(Q& q) { return P(q.x, q.y); } void print(seg_tree& seg, int n) { for (int i = 0; i < (n); i++) { Q q = seg.dat[seg.n - 1 + i]; P p = q2p(q); printf( %d : (%lf,%lf) n , i, p.x, p.y); } } int main() { int n, q; reader(n, q); seg_tree seg; seg.init(n); for (int i = 0; i < (q); i++) { int t, a, b; reader(t, a, b); seg.update_query(t, a, b); Q val = seg.query(0, n); P cur = q2p(val); printf( %.10lf %.10lf n , (double)cur.x, (double)cur.y); } return 0; } |
#include <bits/stdc++.h> using namespace std; int p[1000005]; int fnd(int x) { return p[x] = p[x] == x ? x : fnd(p[x]); } void unn(int x, int y) { p[fnd(y)] = fnd(x); } int dir[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; int gcd(int x, int y) { return x % y ? gcd(y, x % y) : y; } int pq[5144]; vector<int> pr; int net[100005]; int a[100005]; int main() { int n; scanf( %d , &n); if (n == 1) return printf( 1 n ), 0; for (int i = 2; i <= 10000; i++) { if (net[i]) continue; pr.push_back(i); for (int j = i * i; j <= 100000; j += i) net[j] = 1; } for (int i = 0; i < n; i++) { scanf( %d , a + i); int mx = 0; for (int j = 0; j < pr.size(); j++) { if (a[i] % pr[j] == 0) { mx = max(mx, pq[j]); } } for (int j = 0; j < pr.size(); j++) { if (a[i] % pr[j] == 0) { pq[j] = max(mx + 1, pq[j]); } } } int mx = 1; for (int i = 0; i < pr.size(); i++) mx = max(mx, pq[i]); printf( %d , mx); } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 305; const long long mode = 1e9 + 7; const long long maxm = 1e5 + 10; long long n, q, t, w[maxn], fa[maxn], nw[maxn], dp[maxm], son[maxn], z[maxn], cur, ww[maxn]; long long u, v; signed main() { cin >> n >> q >> t; for (long long i = 1; i <= n; ++i) cin >> w[i]; bool juge = true; while (q--) { cin >> u >> v; if (fa[u] == v) { juge = false; } fa[v] = u; son[u] = v; } if (!juge) { cout << 0; return 0; } for (long long i = 1; i <= n; ++i) { if (fa[i] == 0 && son[i]) { long long sum = 0; long long now = i; while (now) { ww[now] = sum + w[now]; nw[now] = nw[fa[now]] + sum + w[now]; sum += w[now]; now = son[now]; } } if (fa[i] == 0 && son[i] == 0) nw[i] = ww[i] = w[i]; if (son[i] == 0 && fa[i]) { z[++cur] = i; } } long long sum = 0; for (long long i = 1; i <= n; ++i) { if (son[i] == 0 && fa[i]) { long long temp = 0, now = i; while (now) { temp += w[now]; now = fa[now]; } sum += nw[i] - temp; } } if (sum > t) { cout << 0; return 0; } else if (sum == t) { cout << 1; return 0; } dp[sum] = 1; for (long long i = 1; i <= n; ++i) { for (long long j = ww[i]; j <= t; ++j) { if (dp[j - ww[i]]) dp[j] += dp[j - ww[i]]; dp[j] %= mode; } } cout << dp[t]; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } template <typename T> T modMul(T a, T b, T m) { T x = 0, y = a % m; while (b > 0) { if (b % 2 == 1) x = (x + y) % m; y = (y * 2) % m; b /= 2; } return x % m; } template <typename T> T pollard(T n) { int i = 0, k = 2, d; T x = 3, y = 3; while (true) { i++; x = (modMul(x, x, n) + n - 1) % n; d = gcd(abs(y - x), n); if (d != 1 && d != n) return d; if (i == k) y = x, k *= 2; } } template <typename T> T modExp(T a, T b, T m) { if (b == 0) return (T)1; T c = modExp(a, b / 2, m); c = modMul(c, c, m); if (b % 2 != 0) c = modMul(c, a, m); return c; } bool miller(long long n) { const int pn = 9; const int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23}; for (int i = 0; i < pn; i++) if (n % p[i] == 0) return n == p[i]; if (n < p[pn - 1]) return false; long long s = 0, t = n - 1; while (~t & 1) t >>= 1, ++s; for (int i = 0; i < pn; ++i) { long long pt = modExp((long long)p[i], t, n); if (pt == 1) continue; bool ok = false; for (int j = 0; j < s && !ok; j++) { if (pt == n - 1) ok = true; pt = modMul(pt, pt, n); } if (!ok) return false; } return true; } long long arr[200009], mskcnt[1 << 16]; int main() { long long n, x, y; scanf( %lld %lld %lld , &n, &x, &y); vector<long long> div; int cnt_y[20], cnt_x[20]; long long d = y; for (int i = 2; 1LL * i * i <= d && i <= 10000000; i++) { if (d % i == 0) { int cnt = 0; while (d % i == 0) { d /= i; cnt++; } cnt_y[div.size()] = cnt; div.push_back(i); } } if (d > 1) { if (miller(d)) { cnt_y[div.size()] = 1; div.push_back(d); } else { long long p = pollard(d); if (p * p == d) { cnt_y[div.size()] = 2; div.push_back(p); } else { cnt_y[div.size()] = 1; div.push_back(p); cnt_y[div.size()] = 1; div.push_back(d / p); } } } if (y % x != 0) { puts( 0 ); return 0; } d = x; for (int idx = 0; idx < div.size(); idx++) { long long i = div[idx]; int cnt = 0; while (d % i == 0) { d /= i; cnt++; } if (cnt == cnt_y[idx]) { swap(div.back(), div[idx]); swap(cnt_y[div.size() - 1], cnt_y[idx]); idx--; div.pop_back(); } else cnt_x[idx] = cnt; } for (int i = 0; i < n; i++) scanf( %lld , &arr[i]); for (int i = 0; i < n; i++) { long long val = arr[i]; if (val % x == 0) { int mask = 0; d = val; for (int idx = 0; idx < div.size(); idx++) { long long i = div[idx]; int cnt = 0; while (d % i == 0) { d /= i; cnt++; } if (cnt > cnt_x[idx]) { mask |= (1 << idx); } } mskcnt[mask]++; } } for (int i = 0; i < div.size(); i++) { for (int mask = 0; mask < (1 << div.size()); mask++) { if (mask & (1 << i)) { mskcnt[mask] += mskcnt[mask ^ (1 << i)]; } } } long long ans = 0; for (int i = 0; i < n; i++) { long long val = arr[i]; if (y % val == 0) { int mask = 0; d = val; for (int idx = 0; idx < div.size(); idx++) { long long i = div[idx]; int cnt = 0; while (d % i == 0) { d /= i; cnt++; } if (cnt < cnt_y[idx]) { mask |= (1 << idx); } } mask = (~mask) & ((1 << div.size()) - 1); ans += mskcnt[mask]; } } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100000; int N, M, S; vector<pair<int, int> > b; vector<pair<pair<int, int>, int> > s; vector<pair<int, int> > b2; vector<pair<pair<int, int>, int> > s2; int ans[MAX_N + 1]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; bool chk(int x) { long long cost = 0; while (!b.empty()) b.pop_back(); while (!s.empty()) s.pop_back(); for (int i = 0; i < b2.size(); i++) { b.push_back(b2[i]); } for (int i = 0; i < s2.size(); i++) { s.push_back(s2[i]); } while (!pq.empty()) pq.pop(); while (!b.empty()) { while (!s.empty() && s.back().first.first >= b.back().first) { pq.push({s.back().first.second, s.back().second}); s.pop_back(); } if (pq.empty()) { return false; } pair<int, int> now = pq.top(); pq.pop(); cost += (long long)now.first; for (int i = 0; i < x; i++) { if (b.empty()) break; pair<int, int> p = b.back(); b.pop_back(); ans[p.second] = now.second; } } return cost <= (long long)S; } int main() { scanf( %d%d%d , &N, &M, &S); for (int i = 0; i < M; i++) { int x; scanf( %d , &x); b2.push_back({x, i}); } for (int i = 0; i < N; i++) { int x; scanf( %d , &x); s2.push_back({{x, 0}, i}); } for (int i = 0; i < N; i++) { int x; scanf( %d , &x); s2[i].first.second = x; } sort(b2.begin(), b2.end()); sort(s2.begin(), s2.end()); int st = 0, ed = 100000, m; while (st < ed) { m = (st + ed) / 2; if (chk(m)) ed = m; else st = m + 1; } if (chk(st)) { printf( YES n ); for (int i = 0; i < M; i++) { printf( %d , ans[i] + 1); } } else { printf( NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool yes; int t, n, m, len, l, sender[105]; map<string, int> msi; map<int, string> mis; string str, user[105], text[105]; set<int> mention[105]; int ans[105]; int dp[105][105]; char c; bool solve(int pos, int idx) { if (pos == m) return 1; if (dp[pos][idx] != -1) return dp[pos][idx]; if (mention[pos].find(idx) != mention[pos].end()) return 0; dp[pos][idx] = 0; if (pos + 1 < m && sender[pos + 1] != -1) { if (idx == sender[pos + 1]) return 0; dp[pos][idx] = solve(pos + 1, sender[pos + 1]); } else { for (int i = 0; i < n; ++i) { if (i != idx) { dp[pos][idx] |= solve(pos + 1, i); if (dp[pos][idx]) break; } else if (pos == m - 1) dp[pos][idx] = true; } } if (dp[pos][idx]) ans[pos] = idx; return dp[pos][idx]; } int main() { scanf( %d%c , &t, &c); while (t--) { scanf( %d%c , &n, &c); memset(sender, -1, sizeof sender); memset(dp, -1, sizeof dp); for (int i = 0; i < n; ++i) { cin >> user[i]; msi[user[i]] = i; mis[i] = user[i]; } scanf( %d%c , &m, &c); for (int i = 0; i < m; ++i) { getline(cin, str, : ); if (str.compare( ? ) == 0) sender[i] = -1; else sender[i] = msi[str]; getline(cin, text[i]); } for (int i = 0; i < m; ++i) { len = text[i].size(); for (int j = 0; j < n; ++j) { l = user[j].size(); yes = false; for (int k = 0; k < len; ++k) { if (text[i][k] == user[j][0] && k + l - 1 < len && text[i].compare(k, l, user[j]) == 0) { if (((k - 1 >= 0 && text[i][k - 1] != . && text[i][k - 1] != , && text[i][k - 1] != ! && text[i][k - 1] != ? && text[i][k - 1] != ) || (k + l < len && text[i][k + l] != . && text[i][k + l] != , && text[i][k + l] != ! && text[i][k + l] != ? && text[i][k + l] != ))) { } else { yes = true; break; } } } if (yes) mention[i].insert(msi[user[j]]); } } l = 0; if (sender[0] != -1) l |= solve(0, sender[0]); else { for (int i = 0; i < n; ++i) { l |= solve(0, i); if (l) break; } } if (!l) cout << Impossible << endl; else { for (int i = 0; i < m; ++i) { cout << user[ans[i]] << : << text[i] << endl; } } msi.clear(), mis.clear(); for (int i = 0; i < m; ++i) mention[i].clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n), b(n); for (auto &it : a) cin >> it; for (auto &it : b) cin >> it; int mna = *min_element(a.begin(), a.end()); int mnb = *min_element(b.begin(), b.end()); long long ans = 0; for (int i = 0; i < n; ++i) { ans += max(a[i] - mna, b[i] - mnb); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1050; int s[maxn][maxn]; int main(int argc, char const *argv[]) { int n, a, b; cin >> n >> a >> b; if (a != 1 && b != 1) { printf( NO n ); return 0; } if (n == 1) { printf( YES n0 n ); return 0; } if (a == 1 && b == 1 && n <= 3) { printf( NO n ); return 0; } printf( YES n ); if (a == 1 && b == 1) { for (int i = 1; i < n; ++i) { s[i][i + 1] = s[i + 1][i] = 1; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { printf( %d , s[i][j]); } printf( n ); } } else if (a == 1) { for (int i = b; i <= n; ++i) { for (int j = b; j <= n; ++j) { s[i][j] = 1; } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { s[i][j] = 1 - s[i][j]; } s[i][i] = 0; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { printf( %d , s[i][j]); } printf( n ); } } else { for (int i = a; i <= n; ++i) { for (int j = a; j <= n; ++j) { s[i][j] = 1; } } for (int i = 1; i <= n; ++i) s[i][i] = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { printf( %d , s[i][j]); } printf( n ); } } return 0; } |
#include <bits/stdc++.h> template <typename T> T power(T x, T y, T mod) { T res = 1; while (y > 0) { if (y & 1) res = (res * x) % mod; y /= 2; x = (x * x) % mod; } return res; } using namespace std; long long int a[2005][2005]; long long int d1[4005]; long long int d2[4005]; long long int ele[2005][2005]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n; cin >> n; for (long long int i = 0; i < n; i++) for (long long int j = 0; j < n; j++) cin >> a[i][j]; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < n; j++) { long long int b = a[i][j]; d1[j - i + n] += b; d2[n + n - i - j - 1] += b; } } long long int max1 = 0; long long int max2 = 0; long long int x1, y1, x2, y2; x1 = 1; x2 = 1; y1 = 1; y2 = 2; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < n; j++) { ele[i][j] = d1[j - i + n] + d2[2 * n - i - j - 1] - a[i][j]; if ((i + j) % 2) { if (max1 < ele[i][j]) { max1 = ele[i][j]; x1 = i + 1; y1 = j + 1; } } else { if (max2 < ele[i][j]) { max2 = ele[i][j]; x2 = i + 1; y2 = j + 1; } } } } cout << max1 + max2 << n ; cout << x1 << << y1 << << x2 << << y2 << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int tmp; cin >> tmp; if (tmp % 2) cout << tmp << ; else cout << tmp - 1 << ; } cin.get(); cin.get(); } |
#include <bits/stdc++.h> using namespace std; int n, a[1005], b[1005]; int main() { bool same = 1; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , a + i, b + i); same &= a[i] == b[i]; } if (!same) { puts( rated ); return 0; } for (int i = 2; i <= n; ++i) { if (a[i] > a[i - 1]) { puts( unrated ); return 0; } } puts( maybe ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long fpow(long long x, long long y, long long m) { long long temp; if (y == 0 || x == 1) return 1; temp = fpow(x, y / 2, m); if (y % 2 == 0) return ((temp) * (temp)) % m; else return (((x) % m) * ((temp * temp) % m)) % m; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void sieve(long long n) { bool prime[5 * 100005]; memset(prime, true, sizeof(prime)); for (long long p = 2; p * p <= n; p++) if (prime[p] == true) for (long long i = p * p; i <= n; i += p) prime[i] = false; prime[1] = 0; } long long cnt, sum, mid, mx = -1e17, mn = 1e17, a[2 * 100005]; long long n, m, d, t, i, j, k, l, r, x, y, z; bool f, f1, f2; string s; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; vector<long long> dp(100005); for ((i) = 1; (i) <= (n); (i)++) { cin >> x >> y; cnt = 0; for (j = 1; j * j <= x; j++) { if (x % j == 0) { if (dp[j] < i - y) { cnt++; } dp[j] = i; if (dp[x / j] < i - y) { cnt++; } dp[x / j] = i; } } cout << cnt; cout << n ; } } |
#include <bits/stdc++.h> int main() { char c, str[100]; int i; scanf( %c , &c); getchar(); gets(str); if (c == L ) { for (i = 0; i < strlen(str); i++) { if (str[i] == q ) { str[i] = w ; } else if (str[i] == w ) { str[i] = e ; } else if (str[i] == r ) { str[i] = t ; } else if (str[i] == t ) { str[i] = y ; } else if (str[i] == y ) { str[i] = u ; } else if (str[i] == u ) { str[i] = i ; } else if (str[i] == i ) { str[i] = o ; } else if (str[i] == o ) { str[i] = p ; } else if (str[i] == a ) { str[i] = s ; } else if (str[i] == s ) { str[i] = d ; } else if (str[i] == d ) { str[i] = f ; } else if (str[i] == f ) { str[i] = g ; } else if (str[i] == g ) { str[i] = h ; } else if (str[i] == h ) { str[i] = j ; } else if (str[i] == j ) { str[i] = k ; } else if (str[i] == k ) { str[i] = l ; } else if (str[i] == l ) { str[i] = ; ; } else if (str[i] == z ) { str[i] = x ; } else if (str[i] == x ) { str[i] = c ; } else if (str[i] == c ) { str[i] = v ; } else if (str[i] == v ) { str[i] = b ; } else if (str[i] == b ) { str[i] = n ; } else if (str[i] == n ) { str[i] = m ; } else if (str[i] == m ) { str[i] = , ; } else if (str[i] == , ) { str[i] = . ; } else if (str[i] == . ) { str[i] = / ; } else if (str[i] == e ) { str[i] = r ; } } } else if (c == R ) { for (i = 0; i < strlen(str); i++) { if (str[i] == w ) { str[i] = q ; } else if (str[i] == e ) { str[i] = w ; } else if (str[i] == r ) { str[i] = e ; } else if (str[i] == t ) { str[i] = r ; } else if (str[i] == y ) { str[i] = t ; } else if (str[i] == u ) { str[i] = y ; } else if (str[i] == i ) { str[i] = u ; } else if (str[i] == o ) { str[i] = i ; } else if (str[i] == p ) { str[i] = o ; } else if (str[i] == s ) { str[i] = a ; } else if (str[i] == d ) { str[i] = s ; } else if (str[i] == f ) { str[i] = d ; } else if (str[i] == g ) { str[i] = f ; } else if (str[i] == h ) { str[i] = g ; } else if (str[i] == j ) { str[i] = h ; } else if (str[i] == k ) { str[i] = j ; } else if (str[i] == l ) { str[i] = k ; } else if (str[i] == ; ) { str[i] = l ; } else if (str[i] == x ) { str[i] = z ; } else if (str[i] == c ) { str[i] = x ; } else if (str[i] == v ) { str[i] = c ; } else if (str[i] == b ) { str[i] = v ; } else if (str[i] == n ) { str[i] = b ; } else if (str[i] == m ) { str[i] = n ; } else if (str[i] == , ) { str[i] = m ; } else if (str[i] == . ) { str[i] = , ; } else if (str[i] == / ) { str[i] = . ; } } } printf( %s , str); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long sum, n, q; long long a[16]; long long P[16]; long long fac[16]; bool vis[16]; void get(long long sum) { long long res = 0; for (long long i = 1; i < n; i++) res = (res + a[i]) * (n - i); for (long long i = 1; i <= 15; i++) { a[i] = sum / fac[15 - i]; sum %= fac[15 - i]; } memset(vis, 0, sizeof(vis)); for (long long i = 1; i <= 15; i++) { long long cnt = 0; for (long long j = 1; j <= 15; j++) { if (!vis[j]) cnt++; if (cnt == a[i] + 1) { P[i] = j; vis[j] = 1; break; } } } } signed main() { n = read(); q = read(); fac[0] = 1; for (long long i = 1; i <= 15; i++) fac[i] = fac[i - 1] * i; while (q--) { long long opt; opt = read(); if (opt == 1) { long long l, r; l = read(); r = read(); long long ans = 0; get(sum); if (r > n - 15) { if (l > n - 15) { for (long long i = l - n + 15; i <= r - n + 15; i++) ans += P[i]; ans += (r - l + 1) * (n - 15); } else { ans += (l + n - 15) * (n - 14 - l) / 2; for (long long i = 1; i <= r - n + 15; i++) ans += P[i]; ans += (r - n + 15) * (n - 15); } } else ans = (l + r) * (r - l + 1) / 2; printf( %lld n , ans); } if (opt == 2) { long long x; x = read(); sum += x; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long modpow(long long a, long long b, long long m = 1000000007) { a %= m; long long res = 1; while (b) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } long long bpow(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; } long long modinv(long long a) { return modpow(a, 1000000007 - 2, 1000000007); } void graph(vector<vector<long long> > &adj, long long m) { long long x, y; for (long long i = 0; i < m; i++) { cin >> x >> y; adj[x - 1].push_back(y - 1); adj[y - 1].push_back(x - 1); } } const int mxN = 2e5 + 5; void solve() { int n; cin >> n; string s; cin >> s; set<int> color[26]; std::vector<int> out(n); for (long long i = 0; i < s.size(); i++) { int x = s[i] - a ; for (long long j = 1; j <= 26; j++) { bool ok = true; for (long long k = x + 1; k < 26; k++) { ok &= !(color[k].count(j)); } if (ok) { color[x].insert(j); out[i] = j; break; } } } set<int> distinct; for (auto &k : out) distinct.insert(k); cout << distinct.size() << n ; for (auto &k : out) cout << k << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); } template <class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template <class T1, class T2> void sortPair(vector<T1> &v1, vector<T2> &v2) { vector<pair<T1, T2>> u(v1.size()); for (int i = 0; i < u.size(); i++) u[i] = make_pair(v1[i], v2[i]); sort(u.begin(), u.end()); for (int i = 0; i < u.size(); i++) tie(v1[i], v2[i]) = u[i]; } long long solve() { long long d, n, m; cin >> d >> n >> m; vector<long long> x(m), p(m); for (int i = 0; i < (m); i++) scanf( %lld %lld , &x[i], &p[i]); x.insert(x.begin(), 0); p.insert(p.begin(), 0); x.push_back(d); p.push_back(0); m += 2; sortPair(x, p); vector<long long> next(m, -1); stack<int> s; for (int i = (m)-1; i >= 0; i--) { while (!s.empty() && p[i] <= p[s.top()]) s.pop(); next[i] = s.empty() ? -1 : s.top(); s.push(i); } long long full = n; long long ans = 0; int i = 0; while (i < m - 1) { if (x[i + 1] - x[i] > full) return -1; long long use, dist, ni; if (x[next[i]] - x[i] > full) { dist = x[i + 1] - x[i]; use = full - n; ni = i + 1; } else { dist = x[next[i]] - x[i]; use = max(0ll, dist - n); ni = next[i]; } ans += use * p[i]; n += use - dist; i = ni; } return ans; } int main() { cout << solve() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { char c; bool nega = 0; while ((!isdigit(c = getchar())) && (c != - )) ; if (c == - ) { nega = 1; c = getchar(); } x = c - 48; while (isdigit(c = getchar())) x = x * 10 + c - 48; if (nega) x = -x; } template <typename T> inline void writep(T x) { if (x > 9) writep(x / 10); putchar(x % 10 + 48); } template <typename T> inline void write(T x) { if (x < 0) { putchar( - ); x = -x; } writep(x); } template <typename T> inline void writeln(T x) { write(x); putchar( n ); } int n, m, q; char a[2 * 1003][2 * 1003]; long long sum[2 * 1003][2 * 1003], sum1[2 * 1003][2 * 1003], ret, cn_n, cm_n; long long mx, my; long long sx1, sy1, sx2, sy2; void dcy(long long left, long long right, long long lx, long long rx) { if (left > sy2 || right < sy1) return; if (left >= sy1 && right <= sy2) { ret += (right - left + 1) * (rx - lx + 1) / 2; } else if (right - left + 1 == m) { long long ly = max(sy1, left), ry = min(sy2, right); long long x = (lx - 1) / n, y = (ly - 1) / m; int k = ((x) ^ (y)); int k1 = 0; while (k) k1 += k & 1, k >>= 1; lx = (lx - 1) % n + 1, ly = (ly - 1) % m + 1, rx = (rx - 1) % n + 1, ry = (ry - 1) % m + 1; if (k1 & 1) ret += sum1[rx][ry] + sum1[lx - 1][ly - 1] - sum1[lx - 1][ry] - sum1[rx][ly - 1]; else ret += sum[rx][ry] + sum[lx - 1][ly - 1] - sum[lx - 1][ry] - sum[rx][ly - 1]; } else { long long mid = (left + right) >> 1; dcy(left, mid, lx, rx), dcy(mid + 1, right, lx, rx); } } void dcx(long long left, long long right) { if (left > sx2 || right < sx1) return; if (left >= sx1 && right <= sx2) ret += (sy2 - sy1 + 1) * (right - left + 1) / 2; else if (right - left + 1 == n) dcy(1, my, max(left, sx1), min(right, sx2)); else { int mid = (left + right) >> 1; dcx(left, mid), dcx(mid + 1, right); } } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int i, j; scanf( %d%d%d , &n, &m, &q); for (i = 1; i <= n; i++) scanf( %s , a[i] + 1); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { sum[i][j] = sum[i + n][j + m] = a[i][j] - 0 ; sum[i + n][j] = sum[i][j + m] = sum[i][j] ^ 1; } n <<= 1, m <<= 1; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1]; sum1[i][j] = i * j - sum[i][j]; } } mx = n; while (mx < 1e9) { mx *= 2; } my = m; while (my < 1e9) { my *= 2; } while (q--) { scanf( %d%d%d%d , &sx1, &sy1, &sx2, &sy2); ret = 0; dcx(1, mx); cout << ret << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int mark[111111]; int a[111111]; int b[111111]; int n; int noEle, cnt; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n + 1); for (int i = 1; i <= n; i++) { if (b[i] != a[i]) { noEle++; if (noEle % 2 != 0) cnt++; if (cnt > 1) { cout << NO ; return 0; } } } cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, t = 2; cin >> n; string s; cin >> s; for (int i = 0; i < n;) { cout << s.at(i); i += t; t++; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; struct Point { int x, y; Point(int x_ = 0, int y_ = 0) : x(x_), y(y_) {} Point(std::istream &in) { in >> x >> y; x *= 2; y *= 2; } }; bool operator<(const Point &a, const Point &b) { return (a.x < b.x) || (a.x == b.x && a.y < b.y); } bool cmp_sum(const Point &a, const Point &b) { return (a.x + a.y < b.x + b.y); } bool cmp_diff(const Point &a, const Point &b) { return (a.x - a.y < b.x - b.y); } int n, k; vector<Point> gnome, metro; vector<int> sorted_x, sorted_y; vector<int> tree; int curk; void upd_val(int x, int val, const vector<int> &coords) { x = lower_bound(coords.begin(), coords.end(), x) - coords.begin(); x += curk; tree[x] = min(tree[x], val); x /= 2; while (x != 1) { tree[x] = min(tree[x * 2], tree[x * 2 + 1]); x /= 2; } } int get_min_val(int l, int r, const vector<int> &coords) { l = lower_bound(coords.begin(), coords.end(), l) - coords.begin(); r = lower_bound(coords.begin(), coords.end(), r) - coords.begin(); l += curk; r += curk; int res = INF; while (l < r) { res = min(res, min(tree[l], tree[r])); l = (l + 1) / 2; r = (r - 1) / 2; } if (l == r) { res = min(res, tree[l]); } return res; } void shrink(vector<int> &coord) { sort(coord.begin(), coord.end()); coord.resize(unique(coord.begin(), coord.end()) - coord.begin()); } template <typename T> std::vector<int> argsort(const std::vector<T> &vals, bool reverse = false) { vector<int> result(vals.size()); for (int i = 0; i < int(vals.size()); ++i) { result[i] = i; } sort(result.begin(), result.end(), [&](int a, int b) -> bool { return (vals[a] < vals[b]); }); if (reverse) { std::reverse(result.begin(), result.end()); } return result; } void get_min_dist(const std::vector<Point> &gnome, std::vector<Point> metro, std::vector<int> &result) { sorted_x.clear(); sorted_y.clear(); for (auto &x : gnome) { sorted_x.push_back(x.x); sorted_y.push_back(x.y); } for (auto &x : metro) { sorted_x.push_back(x.x); sorted_y.push_back(x.y); } shrink(sorted_x); shrink(sorted_y); int nn = gnome.size(); result.assign(nn, INF); auto indices = argsort(gnome); sort(metro.begin(), metro.end()); curk = 2; while (int(sorted_y.size()) > curk) curk *= 2; { tree.assign(2 * curk, INF); int l = 0, r = 0; while (l < nn) { int ind = indices[l]; while (r < k && metro[r].x <= gnome[ind].x) { upd_val(metro[r].y, -metro[r].x - metro[r].y, sorted_y); ++r; } result[ind] = min(result[ind], get_min_val(sorted_y.front(), gnome[ind].y, sorted_y) + gnome[ind].x + gnome[ind].y); ++l; } } { tree.assign(2 * curk, INF); int l = 0, r = 0; while (l < nn) { int ind = indices[l]; while (r < k && metro[r].x <= gnome[ind].x) { upd_val(metro[r].y, -metro[r].x + metro[r].y, sorted_y); ++r; } result[ind] = min(result[ind], get_min_val(gnome[ind].y, sorted_y.back(), sorted_y) + gnome[ind].x - gnome[ind].y); ++l; } } reverse(metro.begin(), metro.end()); reverse(indices.begin(), indices.end()); { tree.assign(2 * curk, INF); int l = 0, r = 0; while (l < nn) { int ind = indices[l]; while (r < k && metro[r].x >= gnome[ind].x) { upd_val(metro[r].y, metro[r].x - metro[r].y, sorted_y); ++r; } result[ind] = min(result[ind], get_min_val(sorted_y.front(), gnome[ind].y, sorted_y) - gnome[ind].x + gnome[ind].y); ++l; } } { tree.assign(2 * curk, INF); int l = 0, r = 0; while (l < nn) { int ind = indices[l]; while (r < k && metro[r].x >= gnome[ind].x) { upd_val(metro[r].y, metro[r].x + metro[r].y, sorted_y); ++r; } result[ind] = min(result[ind], get_min_val(gnome[ind].y, sorted_y.back(), sorted_y) - gnome[ind].x - gnome[ind].y); ++l; } } } int find_dist(pair<pair<int, int>, pair<int, int> > rect, const Point &pnt) { int sum = pnt.x + pnt.y; int diff = pnt.x - pnt.y; int sum_dist = max(0, -min(rect.first.second, sum) + max(rect.first.first, sum)); int diff_dist = max(0, -min(rect.second.second, diff) + max(rect.second.first, diff)); return max(sum_dist, diff_dist); } void get_all_min_dist(vector<pair<pair<int, int>, pair<int, int> > > rect, vector<Point> metro, vector<int> &dist) { dist.assign(n, INF); vector<Point> ok_points; for (int i = 0; i < n; ++i) { const auto &cr = rect[i]; int a, b, c, d; tie(a, b) = cr.first; tie(c, d) = cr.second; ok_points.emplace_back((a + c) / 2, (a - c) / 2); ok_points.emplace_back((a + d) / 2, (a - d) / 2); ok_points.emplace_back((b + c) / 2, (b - c) / 2); ok_points.emplace_back((b + d) / 2, (b - d) / 2); } vector<int> tmp; get_min_dist(ok_points, metro, tmp); for (int i = 0; i < n * 4; ++i) { dist[i / 4] = min(dist[i / 4], tmp[i]); } vector<int> sorted_sum; vector<int> sorted_diff; for (auto &pnt : rect) { sorted_sum.push_back(pnt.first.first); sorted_sum.push_back(pnt.first.second); sorted_diff.push_back(pnt.second.first); sorted_diff.push_back(pnt.second.second); } for (auto &pnt : metro) { sorted_sum.push_back(pnt.x + pnt.y); sorted_diff.push_back(pnt.x - pnt.y); } shrink(sorted_sum); shrink(sorted_diff); sort(metro.begin(), metro.end(), cmp_sum); curk = 2; while (curk < int(sorted_diff.size())) curk *= 2; vector<pair<pair<int, int>, pair<int, int> > > segment(n); for (int i = 0; i < n; ++i) { segment[i] = make_pair(make_pair(rect[i].first.first, i), rect[i].second); } sort(segment.begin(), segment.end()); { tree.assign(curk * 2, INF); int nn = segment.size(); int l = 0, r = 0; while (l < nn) { while (r < k && metro[r].x + metro[r].y <= segment[l].first.first) { upd_val(metro[r].x - metro[r].y, -metro[r].y - metro[r].x, sorted_diff); ++r; } int ind = segment[l].first.second; dist[ind] = min(dist[ind], get_min_val(segment[l].second.first, segment[l].second.second, sorted_diff) + segment[l].first.first); ++l; } } reverse(metro.begin(), metro.end()); for (int i = 0; i < n; ++i) { segment[i] = make_pair(make_pair(rect[i].first.second, i), rect[i].second); } sort(segment.rbegin(), segment.rend()); { tree.assign(curk * 2, INF); int nn = segment.size(); int l = 0, r = 0; while (l < nn) { while (r < k && metro[r].x + metro[r].y >= segment[l].first.first) { upd_val(metro[r].x - metro[r].y, metro[r].x + metro[r].y, sorted_diff); ++r; } int ind = segment[l].first.second; dist[ind] = min(dist[ind], get_min_val(segment[l].second.first, segment[l].second.second, sorted_diff) - segment[l].first.first); ++l; } } sort(metro.begin(), metro.end(), cmp_diff); for (int i = 0; i < n; ++i) { segment[i] = make_pair(make_pair(rect[i].second.first, i), rect[i].first); } sort(segment.begin(), segment.end()); curk = 2; while (curk < int(sorted_sum.size())) curk *= 2; { tree.assign(curk * 2, INF); int nn = segment.size(); int l = 0, r = 0; while (l < nn) { while (r < k && metro[r].x - metro[r].y <= segment[l].first.first) { upd_val(metro[r].x + metro[r].y, metro[r].y - metro[r].x, sorted_sum); ++r; } int ind = segment[l].first.second; dist[ind] = min(dist[ind], get_min_val(segment[l].second.first, segment[l].second.second, sorted_sum) + segment[l].first.first); ++l; } } reverse(metro.begin(), metro.end()); for (int i = 0; i < n; ++i) { segment[i] = make_pair(make_pair(rect[i].second.second, i), rect[i].first); } sort(segment.rbegin(), segment.rend()); { tree.assign(curk * 2, INF); int nn = segment.size(); int l = 0, r = 0; while (l < nn) { while (r < k && metro[r].x - metro[r].y >= segment[l].first.first) { upd_val(metro[r].x + metro[r].y, metro[r].x - metro[r].y, sorted_sum); ++r; } int ind = segment[l].first.second; dist[ind] = min(dist[ind], get_min_val(segment[l].second.first, segment[l].second.second, sorted_sum) - segment[l].first.first); ++l; } } } int main() { ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 0; i < n; ++i) { gnome.emplace_back(std::cin); } for (int i = 0; i < k; ++i) { metro.emplace_back(std::cin); } int min_x = INF, max_x = -INF; int min_y = INF, max_y = -INF; for (const auto &pnt : gnome) { min_x = min(min_x, pnt.x + pnt.y); max_x = max(max_x, pnt.x + pnt.y); min_y = min(min_y, pnt.x - pnt.y); max_y = max(max_y, pnt.x - pnt.y); } int result = (max(max_x - min_x, max_y - min_y) + 1) / 2; if (n > 1 && k) { vector<int> dist; get_min_dist(gnome, metro, dist); auto indices = argsort(dist, true); vector<pair<pair<int, int>, pair<int, int> > > all_rect; vector<int> add_dist; min_x = INF, max_x = -INF; min_y = INF, max_y = -INF; for (int i = 0; i < n; ++i) { const auto &pnt = gnome[indices[i]]; min_x = min(min_x, pnt.x + pnt.y); max_x = max(max_x, pnt.x + pnt.y); min_y = min(min_y, pnt.x - pnt.y); max_y = max(max_y, pnt.x - pnt.y); int dist = (max(max_x - min_x, max_y - min_y) + 1) / 2; add_dist.push_back(dist); all_rect.emplace_back(make_pair(max_x - dist, min_x + dist), make_pair(max_y - dist, min_y + dist)); } result = min(result, dist[indices[0]]); vector<int> new_dist; get_all_min_dist(all_rect, metro, new_dist); for (int i = 0; i < n - 1; ++i) { int t1 = add_dist[i]; int t2 = new_dist[i]; int t3 = dist[indices[i + 1]]; int x = (max(0, min(2 * t2, t3 + t2 - t1)) + 1) / 2; result = min(result, max(t1 + x, t3 + t2 - x)); } } result = (result + 1) / 2; cout << result << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, w, h; char a[101][101]; cin >> w >> h; for (i = 0; i < h; i++) { for (j = 0; j < w; j++) { char x; cin >> x; a[j][i] = x; } } for (j = 0; j < w; j++) { for (int k = 0; k < 2; k++) { for (i = 0; i < h; i++) { cout << a[j][i]; cout << a[j][i]; } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; #define ll long long #define f(i, x, n) for (int i = x; i < (int)(n); ++i) const int N = 1e6 + 10, mod = 998244353; const double eps = 1e-7; inline int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; } inline int mul(int a, int b) { return (ll)a * b % mod; } int n; string s; ll fact[1000001], inv[1000001];// mod inv = n ^ mod-2 ll FastPower(int a, int b) { if(b == 0) return 1; ll res = FastPower(a, b/2); if(b%2) return res * res % mod * a % mod; return res * res % mod; } ll nCk(int n, int k) { if(n < k) return 0; return fact[n] * inv[k] % mod * inv[n-k] % mod; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); #endif fact[0] = 1; inv[0] = FastPower(1, mod-2); for(int i=1; i<=1000000; ++i) { fact[i] = fact[i-1] * i % mod; inv[i] = FastPower(fact[i], mod-2); } int t; cin >> t; while(t--) { cin >> n >> s; vector<int> a; for(int i=0; i<n; ++i){ if(i < n-1 && s[i] == 1 && s[i+1] == 1 ){ a.push_back(2); ++i; continue; } a.push_back(s[i]- 0 ); } n = a.size(); ll ans = 1; int space = 0, nof2 = 0; for(int i=0; i<n; ++i){ //cout << a[i] << ; nof2 += a[i] == 2; space += a[i] == 0; } ans = nCk(nof2+space, space); cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const double eps = 0.00000001; void pr() { cout << endl; } template <typename T1, typename... T2> void pr(const T1& arg, const T2&... args) { cout << arg << ; pr(args...); } const int N = 5e5 + 10; vector<int> v[N], mp[N], l_u[N], l_d[N], r_u[N], r_d[N]; int dui[N], n, m; void init() { for (int i = 1; i <= n; ++i) v[i].clear(), mp[i].clear(), l_u[i].clear(), l_d[i].clear(), r_u[i].clear(), r_d[i].clear(); } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int T; cin >> T; while (T--) { cin >> n >> m; vector<pair<int, int> > temp; for (int i = 1; i <= n; ++i) { v[i].push_back(233); for (int j = 1; j <= m; ++j) { int x; cin >> x; v[i].push_back(x); } } for (int i = 1; i <= n; ++i) { temp.push_back(pair<int, int>(v[i][1], i)); } sort(temp.begin(), temp.end()); int cnt = 0; for (int i = 0; i < temp.size(); ++i) { int fir = temp[i].second; mp[++cnt].push_back(233); dui[cnt] = temp[i].second; l_u[cnt].push_back(233); l_d[cnt].push_back(233); r_u[cnt].push_back(233); r_d[cnt].push_back(233); for (int j = 1; j <= m; ++j) { mp[cnt].push_back(v[fir][j]); l_u[cnt].push_back(v[fir][j]); l_d[cnt].push_back(v[fir][j]); r_u[cnt].push_back(v[fir][j]); r_d[cnt].push_back(v[fir][j]); } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { l_u[i][j] = max({i - 1 >= 1 ? l_u[i - 1][j] : 0, j - 1 >= 1 ? l_u[i][j - 1] : 0, l_u[i][j]}); } } for (int i = n; i >= 1; --i) { for (int j = 1; j <= m; ++j) { l_d[i][j] = min({i + 1 <= n ? l_d[i + 1][j] : inf, j - 1 >= 1 ? l_d[i][j - 1] : inf, l_d[i][j]}); } } for (int i = 1; i <= n; ++i) { for (int j = m; j >= 1; --j) { r_u[i][j] = min({i - 1 >= 1 ? r_u[i - 1][j] : inf, j + 1 <= m ? r_u[i][j + 1] : inf, r_u[i][j]}); } } for (int i = n; i >= 1; --i) { for (int j = m; j >= 1; --j) { r_d[i][j] = max({i + 1 <= n ? r_d[i + 1][j] : 0, j + 1 <= m ? r_d[i][j + 1] : 0, r_d[i][j]}); } } bool flag = 1; for (int i = 1; i < n; ++i) { for (int j = 1; j < m; ++j) { if (l_u[i][j] < l_d[i + 1][j] && r_u[i][j + 1] > r_d[i + 1][j + 1]) { flag = 0; cout << YES << endl; bool op[N]; memset(op, 0, sizeof(op)); for (int k = 1; k <= i; ++k) { op[dui[k]] = 1; } for (int k = 1; k <= n; ++k) { if (op[k]) cout << B ; else cout << R ; } cout << << j << endl; } if (!flag) break; } if (!flag) break; } if (flag) cout << NO << endl; init(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; map<int, set<pair<int, string>, greater<pair<int, string> > > > mp; for (int i = 0; i < n; i++) { string s; int a, b; cin >> s >> a >> b; mp[a].insert(pair<int, string>(b, s)); } for (int i = 1; i <= m; i++) { pair<int, string> a, b, c; auto it = mp[i].begin(); a = *it; it++; b = *it; if (mp[i].size() > 2) it++; else { cout << a.second << << b.second << endl; continue; } c = *it; if ((b.first == c.first)) { cout << ? << endl; } else { cout << a.second << << b.second << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3fffffff; const long long oo = 3000000000000000000LL; int tes, n; long long ans[3], mn[4], mx[4], ll[4], rr[4], lt[4], rt[4], ret[3]; bool get(long long s, long long x, long long y, long long z) { if (s <= x) { ret[0] = s; ret[1] = 0; ret[2] = 0; return 1; } else if (s <= x + y) { ret[0] = x; ret[1] = s - x; ret[2] = 0; return 1; } else if (s <= x + y + z) { ret[0] = x; ret[1] = y; ret[2] = s - x - y; return 1; } return 0; } long long shr1(long long x) { return (x - (x & 1)) / 2; } bool jd(long long t) { int i, j; long long s, x, y, z; for (i = 0; i <= 3; i++) { if (mn[i] + t < mx[i] - t) return 0; ll[i] = mx[i] - t; rr[i] = mn[i] + t; } for (i = 0; i < 2; i++) { lt[0] = shr1(ll[0] - 3 * i + 1); rt[0] = shr1(rr[0] - 3 * i); for (j = 1; j <= 3; j++) { lt[j] = shr1(ll[j] - i + 1); rt[j] = shr1(rr[j] - i); } if (lt[0] <= rt[0] && lt[1] <= rt[1] && lt[2] <= rt[2] && lt[3] <= rt[3] && lt[1] + lt[2] + lt[3] <= rt[0]) { if (lt[1] + lt[2] + lt[3] >= lt[0]) { ret[0] = lt[1]; ret[1] = lt[2]; ret[2] = lt[3]; ans[0] = ret[1] + ret[2] + i; ans[1] = ret[0] + ret[2] + i; ans[2] = ret[0] + ret[1] + i; return 1; } if (get(lt[0] - lt[1] - lt[2] - lt[3], rt[1] - lt[1], rt[2] - lt[2], rt[3] - lt[3])) { ret[0] += lt[1]; ret[1] += lt[2]; ret[2] += lt[3]; ans[0] = ret[1] + ret[2] + i; ans[1] = ret[0] + ret[2] + i; ans[2] = ret[0] + ret[1] + i; return 1; } } } return 0; } int main() { long long x, y, z, s, l, r, mid; int i; scanf( %d , &tes); while (tes--) { scanf( %d , &n); for (i = 0; i <= 3; i++) { mx[i] = -oo; mn[i] = oo; } for (i = 1; i <= n; i++) { scanf( %I64d%I64d%I64d , &x, &y, &z); s = x + y + z; mx[0] = max(mx[0], s); mn[0] = min(mn[0], s); mx[1] = max(mx[1], s - x - x); mn[1] = min(mn[1], s - x - x); mx[2] = max(mx[2], s - y - y); mn[2] = min(mn[2], s - y - y); mx[3] = max(mx[3], s - z - z); mn[3] = min(mn[3], s - z - z); } l = 0; r = oo; while (l < r) { mid = (l + r) >> 1; if (jd(mid)) r = mid; else l = mid + 1; } jd(l); printf( %I64d %I64d %I64d n , ans[0], ans[1], ans[2]); } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int n, c; cin >> n; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == s[i + 1] && i != s.size() - 1) { c += 1; } } cout << c; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b, i, j, arr[1005] = {0}; cin >> n >> m; for (i = 1; i <= m; i++) { cin >> a >> b; arr[a] = 1; arr[b] = 1; } for (i = 1; i <= n; i++) { if (arr[i] == 0) break; } cout << n - 1 << endl; for (j = 1; j <= n; j++) { if (i != j) { cout << i << << j << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct block { string str; int pos; }; static bool compare(block b1, block b2) { int n = b1.str.length(); for (int i = 0; i < n; i++) { if (b1.str[i] != b2.str[i]) { if ((i + 1) % 2) { return (b1.str[i] < b2.str[i]); } else { return (b1.str[i] > b2.str[i]); } } } } int main() { int n, m; cin >> n >> m; vector<block> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i].str; arr[i].pos = i + 1; } sort(arr.begin(), arr.end(), compare); for (int i = 0; i < n; i++) { cout << arr[i].pos << ; } } |
#include <bits/stdc++.h> using namespace std; double ans[3], temp[3]; int a[200200]; int n; bool f(double d) { double x = 0; int cnt = 0; for (int i = 0; i < n; i++) { if (x < a[i]) { if (cnt == 3) return false; x = a[i] + 2 * d; temp[cnt++] = a[i] + d; } } for (int i = 0; i < 3; i++) ans[i] = temp[i]; return true; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); double ul = 0, ur = a[n - 1]; for (int k = 0; k < 400; k++) { double mid = (ul + ur) / 2; if (f(mid)) ur = mid; else ul = mid; } printf( %.6f n , ul); printf( %.6f %.6f %.6f n , ans[0], ans[1], ans[2]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 3e6; const double eps = 0.00000001; long long ksm(long long a, long long n) { long long ans = 1; while (n) { if (n & 1) ans = ans * a % mod; a = a * a % mod; n >>= 1; } return ans; } int main() { long long c, n, ans; std::ios::sync_with_stdio(false); cin >> n; c = 1; for (int i = 1; i <= n; i++) c = c * i % mod; ans = (c + mod - ksm(2, n - 1)) % mod; cout << ans << endl; } |
#include <bits/stdc++.h> /*#include <iostream> #include <algorithm> #include <math.h> #include <iomanip> #include <string> #include <vector> #include <set> #include <sstream>*/ #define ll long long #define fop(i,m,n) for(int i=m; i<n; i++) #define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0) #define X first #define Y second #define pb push_back #define mp make_pair #define all(v) v.begin(),v.end() #define ep emplace_back using namespace std; const long long MOD = 1e9+7; const long long N = 3e5+5; const long long Nlog = 17; const long long Hash = 257; const double PI = 2.0*acos(0.0);//<cmath> //const double PI = 3.141592653; const double E = 2.718281828; struct bot{ int p, w; }x[N]; bool cmp(int a, int b){ return x[a].p < x[b].p; } void solve(){ int n, m; cin >> n >> m; fop(i,0,n) cin >> x[i].p; fop(i,0,n){ char in; cin >> in; if(in == R ) x[i].w = 1; else x[i].w = -1; } vector<int> v[2]; fop(i,0,n){ v[x[i].p%2].pb(i); } fop(i,0,2) sort(all(v[i]), cmp); vector<int> ans(n, -1); fop(t,0,2){ vector<int> s; for(int i : v[t]){ if(x[i].w == 1){ s.pb(i); }else{ if(s.empty()){ s.pb(i); }else{ int j = s.back(); s.pop_back(); if(x[j].w == 1) ans[i] = ans[j] = (x[i].p-x[j].p)/2; else ans[i] = ans[j] = (x[i].p+x[j].p)/2; //cout << i << << j << : << ans[i] << n ; } } } while(s.size() > 1){ int i = s.back(); s.pop_back(); int j = s.back(); s.pop_back(); if(x[j].w == 1) ans[i] = ans[j] = m - (x[i].p + x[j].p)/2; else ans[i] = ans[j] = m - (x[i].p - x[j].p)/2; //cout << i << << j << : << ans[i] << n ; } } fop(i,0,n){ cout << ans[i] << ; } cout << n ; } int main() { fastIO; int t=1; cin >> t; while(t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; inline void add(int& x, int y) { x += y; if (x >= mod) x -= mod; if (x < 0) x += mod; } inline int mul(int x, int y) { return ((long long)x * y) % mod; } int gcd(int a, int b) { if (b) return gcd(b, a % b); return a; } int power(int a, int p) { int ret = 1; while (p) { if (p & 1) ret = mul(ret, a); a = mul(a, a); p /= 2; } return ret; } int phi(int n) { int ret = n; int i = 2; if (n % i == 0) { ret -= ret / i; while (n % i == 0) n /= i; } for (i = 3; i * i <= n; i++) if (n % i == 0) { ret -= ret / i; while (n % i == 0) n /= i; } if (n > 1) ret -= ret / n; return ret; } bool E[400][400]; int D[2][400][400]; int main() { int N; scanf( %d , &N); int M; scanf( %d , &M); memset(D, 31, sizeof(D)); queue<pair<pair<int, int>, int>> Q; int inf = D[0][0][0]; ; D[0][0][0] = 0; while (M--) { int x, y; scanf( %d , &x); scanf( %d , &y); E[x - 1][y - 1] = E[y - 1][x - 1] = true; } Q.push({{0, 0}, 0}); while (!Q.empty()) { int ty = Q.front().second; pair<int, int> a = Q.front().first; Q.pop(); int nd = D[ty][a.first][a.second] + 1; int x = a.first; int y = a.second; if (ty == 0) { if (x != N - 1) { for (int i = 0; i < N; i++) if (i != x and E[x][i] == true and D[1][i][y] == inf) { D[1][i][y] = nd; Q.push({{i, y}, 1}); ; } } else if (D[1][x][y] == inf) { D[1][x][y] = nd; Q.push({{x, y}, 1}); } } if (ty == 1) { if (x == N - 1 and E[y][N - 1] == false) { cout << nd / 2 << endl; return 0; } if (y != N - 1) { for (int i = 0; i < N; i++) if (i != x and i != y and E[y][i] == false and D[0][x][i] == inf) { D[0][x][i] = nd; Q.push({{x, i}, 0}); ; } } else if (D[0][x][y] == inf) { D[0][x][y] = nd; Q.push({{x, y}, 0}); } } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int inf = 1e9 + 10; const ll inf_ll = 1e18 + 10; template <ll M> struct modint { static ll reduce(ll n) { constexpr static ll b = -1ull / M; ll r = n - (ll)(__uint128_t(b) * n >> 64) * M; return r >= M ? r - M : r; } static ll inv(ll n) { ll r = 1; for (ll k = M - 2; k > 0; k >>= 1, n = reduce(n * n)) if (k & 1) r = reduce(r * n); return r; } ll v; modint(ll n = 0) : v(reduce(n)) { v += (M & 0 - (v < 0)); } friend string to_string(const modint n) { return to_string(n.v); } friend istream& operator>>(istream& i, modint& n) { return i >> n.v; } friend ostream& operator<<(ostream& o, const modint n) { return o << n.v; } template <typename T> explicit operator T() { return T(v); } friend bool operator==(const modint n, const modint m) { return n.v == m.v; } friend bool operator!=(const modint n, const modint m) { return n.v != m.v; } friend bool operator<(const modint n, const modint m) { return n.v < m.v; } friend bool operator<=(const modint n, const modint m) { return n.v <= m.v; } friend bool operator>(const modint n, const modint m) { return n.v > m.v; } friend bool operator>=(const modint n, const modint m) { return n.v >= m.v; } modint& operator+=(const modint n) { v += n.v; v -= (M & 0 - (v >= M)); return *this; } modint& operator-=(const modint n) { v -= n.v; v += (M & 0 - (v < 0)); return *this; } modint& operator*=(const modint n) { v = reduce(v * n.v); return *this; } modint& operator/=(const modint n) { v = reduce(v * inv(n.v)); return *this; } friend modint operator+(const modint n, const modint m) { return modint(n) += m; } friend modint operator-(const modint n, const modint m) { return modint(n) -= m; } friend modint operator*(const modint n, const modint m) { return modint(n) *= m; } friend modint operator/(const modint n, const modint m) { return modint(n) /= m; } modint& operator++() { return *this += 1; } modint& operator--() { return *this -= 1; } modint operator++(int) { modint t = *this; return *this += 1, t; } modint operator--(int) { modint t = *this; return *this -= 1, t; } modint operator+() { return *this; } modint operator-() { return modint(0) -= *this; } modint pow(const ll k) const { if (k < 1) return k == 0 ? modint(1) : modint(inv(this->v)).pow(-k); return k & 1 ? *this * (this->pow(k - 1)) : (*this * *this).pow(k >> 1); } }; using mod = modint<int(1e9 + 7)>; const int N = 2e5 + 5; ll l[N], r[N]; mod p[N], w[N], s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; mod ans = n * n; for (int i = 0; i < n; i++) cin >> l[i]; for (int i = 0; i < n; i++) cin >> r[i]; for (int i = 0; i < n; i++) w[i] = r[i] - l[i] + 1; for (int i = 0; i < n - 1; i++) { p[i] = mod(max(0ll, min(r[i], r[i + 1]) - max(l[i], l[i + 1]) + 1)) / (w[i] * w[i + 1]); if (i >= 2) s += p[i - 2]; ans += p[i] * (2 * s + 1 - 2 * n); } for (int i = 0; i < n - 2; i++) { mod x = mod(max(0ll, min({r[i], r[i + 1], r[i + 2]}) - max({l[i], l[i + 1], l[i + 2]}) + 1)) / (w[i] * w[i + 1] * w[i + 2]); ans += 2 * x; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { long long N, K; cin >> N >> K; vector<long long> P(N); for (long long i = 0; i < N; i++) { cin >> P[i]; } sort(P.begin(), P.end()); long long min = P[0], vid = 0; for (long long i = 1; i < P.size(); i++) { if ((P[i] - P[0]) % K == 0) { vid += abs(P[i] - P[0]) / K; } else { cout << -1 << endl; return 0; } } cout << vid << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; const long long INFLL = (long long)1e16; const int MOD = (int)1e9 + 7; template <typename T> void out(T x) { cout << x << endl; exit(0); } bool bysec(const pair<int, int> &a, const pair<int, int> &b) { return a.second < b.second; } const int maxn = (int)2e5 + 5; int n, a[maxn]; vector<int> zero, pos; set<pair<int, int> > neg; int main() { ios_base::sync_with_stdio(false); cin.tie(0); bool deleted = false; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x > 0) { pos.push_back(i); } else if (x < 0) { neg.insert(make_pair(x, i)); } else { zero.push_back(i); } } if (pos.size() == 0 && neg.size() == 1 && zero.size() > 0) { if (zero.size() > 1) { for (int i = 1; i < (int)zero.size(); i++) { cout << 1 << zero[i] << << zero[0] << endl; } } cout << 2 << neg.begin()->second << endl; return 0; } if (pos.size() == 0 && neg.size() == 0 && zero.size() > 0) { if (zero.size() > 1) { for (int i = 1; i < (int)zero.size(); i++) { cout << 1 << zero[i] << << zero[0] << endl; } } return 0; } if (zero.size() > 1) { for (int i = 1; i < (int)zero.size(); i++) { cout << 1 << zero[i] << << zero[0] << endl; } } if (pos.size() > 1) { for (int i = 1; i < (int)pos.size(); i++) { cout << 1 << pos[i] << << pos[0] << endl; } } if (neg.size() % 2 == 1) { int ind = neg.rbegin()->second; if (zero.size() > 0) { cout << 1 << ind << << zero[0] << endl; } else { deleted = true; cout << 2 << ind << endl; } } int sz = neg.size(); if (sz > 1) { int end = sz % 2 == 1 ? sz - 1 : sz; int f = neg.begin()->second; int i = 0; for (auto &p : neg) { if (i == 0) { i++; continue; } if (i == end) break; int cur = p.second; cout << 1 << cur << << f << endl; i++; } } if (zero.size() > 0 && !deleted) { cout << 2 << zero[0] << endl; deleted = true; } if (pos.size() > 0 && sz > 1) { cout << 1 << pos[0] << << neg.begin()->second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); string s; cin >> s; long long i = 0; while (i + 1 < s.size() && s[i] == s[i + 1]) { if (s[i] == 0 ) { cout << 3 << << 1 << n ; cout << 1 << << 1 << n ; } else { cout << 1 << << 1 << n ; cout << 1 << << 3 << n ; } i += 2; } bool r = 0, c = 0; while (i < s.size()) { if (s[i] == 0 ) { if (r) { cout << 1 << << 1 << n ; r = 0; } else { cout << 3 << << 1 << n ; r = 1; } } else { if (c) { cout << 1 << << 1 << n ; c = 0; } else { cout << 1 << << 3 << n ; c = 1; } } i++; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, y; cin >> x >> y; if (x > y) { int t = x; x = y; y = t; } cout << x << << (y - x) / 2 << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; string s; int main() { cin >> s; int i = 0, cnt = 0; int len = s.size(); while ((i = s.find( VK )) != -1) { s[i] = s[i + 1] = . ; cnt++; } if (s.find( VV ) != -1 || s.find( KK ) != -1) cnt++; printf( %d n , cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double PI = acos(-1.0); int a[100005], s[100005], dp1[100005], dp2[100005], b[100005], ans[100005]; int main() { int n, i, maxlen, k; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]), b[n - i + 1] = -a[i]; for (i = 0; i <= n; i++) s[i] = 0x3f3f3f3f; maxlen = 0; for (i = 1; i <= n; i++) { k = lower_bound(s, s + n, a[i]) - s; s[k] = a[i]; dp1[i] = k + 1; maxlen = max(maxlen, dp1[i]); } for (i = 0; i <= n; i++) s[i] = 0x3f3f3f3f; for (i = 1; i <= n; i++) { k = lower_bound(s, s + n, b[i]) - s; s[k] = b[i]; dp2[n - i + 1] = k + 1; } k = 0; memset(ans, -1, sizeof(ans)); for (i = 1; i <= n; i++) { if (dp1[i] + dp2[i] - 1 < maxlen) ans[i] = 1; else s[k++] = dp1[i]; } sort(s, s + k); for (i = 1; i <= n; i++) { if (ans[i] == 1) printf( 1 ); else { if (upper_bound(s, s + k, dp1[i]) - lower_bound(s, s + k, dp1[i]) > 1) printf( 2 ); else printf( 3 ); } } puts( ); } |
#include <bits/stdc++.h> using namespace std; int n, m, q, tot, rec[100010], cnt[100010][360], num[360], Limit, W, tmp[100010]; long long delta[360], sum[360], a[100010]; struct Set { int k, l, r; } s[100010]; long long AskBig(int now) { int pos = tmp[now]; long long ans = sum[pos]; for (int i = 1; i <= W; i++) ans += (long long)cnt[now][i] * delta[i]; return ans; } long long AskSmall(int now) { long long ans = 0; for (int i = s[now].l; i <= s[now].r; i++) ans += a[rec[i]]; for (int i = 1; i <= W; i++) ans += (long long)cnt[now][i] * delta[i]; return ans; } void ChangeSmall(int now, int v) { for (int i = s[now].l; i <= s[now].r; i++) a[rec[i]] += v; for (int i = 1; i <= W; i++) sum[i] += (long long)cnt[now][i] * v; } int main() { scanf( %d%d%d , &n, &m, &q); Limit = ceil(sqrt(n)); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= m; i++) { int k; scanf( %d , &k); s[i].k = k; s[i].l = tot + 1; for (int j = 1; j <= k; j++) { int x; scanf( %d , &x); rec[++tot] = x; } s[i].r = tot; if (k > Limit) num[++W] = i; } for (int i = 1; i <= W; i++) { int u = num[i]; for (int j = s[u].l; j <= s[u].r; j++) { ++tmp[rec[j]]; sum[i] += a[rec[j]]; } for (int j = 1; j <= m; j++) for (int k = s[j].l; k <= s[j].r; k++) cnt[j][i] += tmp[rec[k]]; for (int j = s[u].l; j <= s[u].r; j++) --tmp[rec[j]]; } for (int i = 1; i <= W; i++) tmp[num[i]] = i; for (int i = 1; i <= q; i++) { char c = getchar(); int x, v; while (c != ? && c != + ) c = getchar(); if (c == ? ) { scanf( %d , &x); if (s[x].k > Limit) printf( %I64d n , AskBig(x)); else printf( %I64d n , AskSmall(x)); } else { scanf( %d%d , &x, &v); if (s[x].k > Limit) delta[tmp[x]] += v; else ChangeSmall(x, v); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x; string case1[3] = { >.v , >.. , ^.< }, case2[5] = { >>>.v , >>.vv , .>..v , ^^.<. , ^.<<< }; int main() { cin >> n >> x; if (n == 5 && x == 5) { for (int i = 0; i < 5; i++) cout << case2[i] << endl; cout << 1 << << 1; } else if (n == 3 && x == 2) { for (int i = 0; i < 3; i++) cout << case1[i] << endl; cout << 1 << << 1; } else { cout << >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>. >.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v << endl << ^v.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; for (int i = 1; i <= 24; i++) cout << .>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>. >.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v << endl << ^v.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; for (int i = 1; i <= 24; i++) cout << ^>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>. >.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v << endl << ^v.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; cout << ^>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>. >.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v << endl << ^<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl << 1 << << 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 5; long long n, a[maxn], dp[maxn][2], f[maxn][2], d[maxn]; long long head[maxn], ecnt; struct edge { long long to, next; } e[maxn << 1]; void adde(long long u, long long v) { e[++ecnt].to = v; e[ecnt].next = head[u]; head[u] = ecnt; } long long read() { long long res = 0, f = 1; char ch; do { ch = getchar(); if (ch == - ) f = -1; } while (!isdigit(ch)); do { res = res * 10 + ch - 0 ; ch = getchar(); } while (isdigit(ch)); return res * f; } void dfs1(long long u, long long fa) { dp[u][0] = dp[u][1] = f[u][0] = d[u] = a[u]; for (long long i = head[u]; i; i = e[i].next) { long long v = e[i].to; if (v == fa) continue; dfs1(v, u); dp[u][0] = max(dp[u][0], dp[v][0]); dp[u][0] = max(dp[u][0], dp[u][1] + dp[v][1]); dp[u][0] = max(dp[u][0], d[u] + f[v][0]); dp[u][0] = max(dp[u][0], d[v] + f[u][0]); dp[u][1] = max(dp[u][1], dp[v][1]); dp[u][1] = max(dp[u][1], d[u] + d[v]); f[u][0] = max(f[u][0], a[u] + f[v][0]); f[u][0] = max(f[u][0], d[u] + dp[v][1]); f[u][0] = max(f[u][0], a[u] + d[v] + f[u][1]); f[u][1] = max(f[u][1], dp[v][1]); d[u] = max(d[u], d[v] + a[u]); } } signed main() { n = read(); for (long long i = (1); i <= (n); ++i) a[i] = read(); for (long long i = (1); i <= (n - 1); ++i) { long long u = read(), v = read(); adde(u, v); adde(v, u); } dfs1(1, 0); printf( %lld n , dp[1][0]); } |
#include<bits/stdc++.h> #define FOR(i,a,b) for( int i=(a); i<(b); ++i) #define REP(i,a,b) for( int i=(a); i<=(b); ++i) #define SHOW(x) for(auto i:(x)){ cout << i << ;} cout << endl; #define MAXN 25 using namespace std; typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; void solve(){ string s;cin >> s; bool f1 = false,f2 = false; for(int i = 1; i < s.size(); i++){ if(s[i] == s[i-1] && s[i] == 1 ){ f1 = true; } if(f1 && s[i] == s[i-1] && s[i] == 0 ){ f2 = true; break; } } if(f2) cout << NO << endl; else cout << YES << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; while(n--){ solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2000000 + 77, Mod = 1000000007, L = 30; int n, m, k, dp[N], T[L], P[N], Ps[N], SS[L]; char S[N]; int main() { scanf( %d %d , &n, &k); scanf( %s , S + 1); m = strlen(S + 1); dp[0] = Ps[0] = 1; for (int i = 1; i <= m; ++i) { P[i] = T[S[i] - a ], T[S[i] - a ] = i; dp[i] = (Ps[i - 1] - SS[S[i] - a ] + Mod) % Mod; Ps[i] = (Ps[i - 1] + dp[i]) % Mod; SS[S[i] - a ] = (SS[S[i] - a ] + dp[i]) % Mod; } for (int i = m + 1; i <= n + m; ++i) { int Mn = 0; for (int j = 1; j < k; ++j) if (T[j] < T[Mn]) Mn = j; P[i] = T[Mn], T[Mn] = i; dp[i] = (Ps[i - 1] - SS[Mn] + Mod) % Mod; Ps[i] = (Ps[i - 1] + dp[i]) % Mod; SS[Mn] = (SS[Mn] + dp[i]) % Mod; } printf( %d n , Ps[n + m]); return 0; } |
#include <bits/stdc++.h> using namespace std; unordered_map<string, int> mp; char ans[2][1005]; bool x[5005]; int oprd[2][5005]; char orig[5005][1005]; char op[5005][20]; char input[4][1005]; char line[4 * 1005]; int main() { int n, m; while (scanf( %d%d , &n, &m) != EOF) { mp.clear(); for (int i = (1); i <= (n); i++) { fgets(line, 4 * 1005, stdin); int num = sscanf(line, %s := %s %s %s , input[0], input[1], input[2], input[3]); mp[string(input[0])] = i; if (num == 4) { if (input[1][0] == ? ) oprd[0][i] = -1; else oprd[0][i] = mp[string(input[1])]; strcpy(op[i], input[2]); if (input[3][0] == ? ) oprd[1][i] = -1; else oprd[1][i] = mp[string(input[3])]; } else op[i][0] = # , strcpy(orig[i], input[1]); } for (int i = (0); i <= (m - 1); i++) { int val[2]; val[0] = val[1] = 0; for (int j = (0); j <= (1); j++) { for (int k = (1); k <= (n); k++) { if (op[k][0] == # ) x[k] = orig[k][i] - 0 ; else { int oprd1 = (oprd[0][k] == -1 ? j : x[oprd[0][k]]); int oprd2 = (oprd[1][k] == -1 ? j : x[oprd[1][k]]); if (op[k][0] == X ) x[k] = oprd1 ^ oprd2; else if (op[k][0] == O ) x[k] = oprd1 | oprd2; else x[k] = oprd1 & oprd2; } val[j] += x[k]; } } ans[0][i] = (val[0] <= val[1] ? 0 : 1 ); ans[1][i] = (val[0] < val[1] ? 1 : 0 ); } ans[0][m] = ans[1][m] = 0 ; printf( %s n , ans[0]); printf( %s n , ans[1]); } return 0; } |
#include <bits/stdc++.h> const int inf = 0x3f3f3f3f; const int maxn = 500050; const int mod = 1e9 + 7; using namespace std; int main() { ios::sync_with_stdio(0); int n, a, b; cin >> n >> a >> b; int c = 0, ans = 0; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x == 1) { if (a > 0) a--; else { if (b > 0) { b--; c++; } else if (c > 0) c--; else ans++; } } else { if (b > 0) b--; else ans += 2; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 2; string s; long long n; long long func(vector<long long> a) { stack<long long> st; long long max_ = 0; for (long long i = 0; i < n; i++) { while (!st.empty() && a[i] > st.top()) { long long cur = st.top(); st.pop(); max_ = max(cur ^ a[i], max_); } st.push(a[i]); } return max_; } void solve() { cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } long long ans = func(a); reverse(a.begin() + 0, a.end()); ans = max(ans, func(a)); cout << ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; for (int i = 1; i <= 400; i++) s += to_string(i); int n; cin >> n; cout << s[n - 1]; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, b, g, ans = 0; cin >> b >> g >> n; if (n < b && n < g) ans = n + 1; else if (n < b && n > g) ans = g + 1; else if (n < g && n > b) ans = b + 1; else { ans = min(b, g) + 1 - (n - max(b, g)); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void checkMin(T &a, T b) { if (b < a) a = b; } template <typename T> inline void checkMax(T &a, T b) { if (a < b) a = b; } const int P = 1e7 + 19; const int Q = 1e9 + 7; const int MAX_N = 5005 + 30000; int n, k, w[MAX_N], v[MAX_N]; long long dp[32][1001]; int beg[MAX_N], qc[MAX_N]; set<pair<int, int>, greater<pair<int, int>>> es[MAX_N]; void dfs(int depth, int l, int r) { copy(dp[depth - 1], dp[depth], dp[depth]); for (auto iter = es[l].begin(); iter != es[l].end();) { if (iter->first < r) break; int i = iter->second; if (iter->first > r) { es[r + 1].emplace(iter->first, i); } iter = es[l].erase(iter); for (int j = k; j >= w[i]; --j) { checkMax(dp[depth][j], dp[depth][j - w[i]] + v[i]); } } if (l == r) { if (!qc[l]) return; int ans = 0; for (int i = k; i >= 1; --i) { ans = ((long long)ans * P + dp[depth][i]) % Q; } for (int i = 0; i < int(qc[l]); ++i) { printf( %d n , ans); } } else { int m = (l + r) >> 1; dfs(depth + 1, l, m); dfs(depth + 1, m + 1, r); } } int main() { while (~scanf( %d%d , &n, &k)) { fill(qc, qc + MAX_N, 0); fill(es, es + MAX_N, set<pair<int, int>, greater<pair<int, int>>>()); int ts = 1; for (int i = 1; i <= n; ++i) { scanf( %d%d , &v[i], &w[i]); beg[i] = ts; } int q, type, x; scanf( %d , &q); for (int i = 0; i < int(q); ++i) { scanf( %d , &type); if (type == 1) { ++ts; ++n; scanf( %d%d , &v[n], &w[n]); beg[n] = ts; } else if (type == 2) { scanf( %d , &x); es[beg[x]].emplace(ts++, x); beg[x] = -1; } else { ++qc[ts]; } } for (int i = 1; i <= n; ++i) { if (beg[i] == -1) continue; es[beg[i]].emplace(ts, i); } dfs(1, 1, ts); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; inline long long getint() { long long _x = 0, _tmp = 1; char _tc = getchar(); while ((_tc < 0 || _tc > 9 ) && _tc != - ) _tc = getchar(); if (_tc == - ) _tc = getchar(), _tmp = -1; while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); return _x * _tmp; } inline long long add(long long _x, long long _y, long long _mod = 1000000007LL) { _x += _y; return _x >= _mod ? _x - _mod : _x; } inline long long sub(long long _x, long long _y, long long _mod = 1000000007LL) { _x -= _y; return _x < 0 ? _x + _mod : _x; } inline long long mul(long long _x, long long _y, long long _mod = 1000000007LL) { _x *= _y; return _x >= _mod ? _x % _mod : _x; } long long mypow(long long _a, long long _x, long long _mod) { if (_x == 0) return 1LL; long long _ret = mypow(mul(_a, _a, _mod), _x >> 1, _mod); if (_x & 1) _ret = mul(_ret, _a, _mod); return _ret; } long long mymul(long long _a, long long _x, long long _mod) { if (_x == 0) return 0LL; long long _ret = mymul(add(_a, _a, _mod), _x >> 1, _mod); if (_x & 1) _ret = add(_ret, _a, _mod); return _ret; } inline bool equal(double _x, double _y) { return _x > _y - 1e-9 && _x < _y + 1e-9; } int __ = 1, _cs; struct Maxflow { static const int MAXV = 20010; struct Edge { int v, c, r; Edge(int _v, int _c, int _r) : v(_v), c(_c), r(_r) {} }; int s, t; vector<Edge> G[MAXV * 2]; int iter[MAXV * 2], d[MAXV * 2], gap[MAXV * 2], tot; void init(int x) { tot = x + 2; s = x + 1, t = x + 2; for (int i = 0; i <= tot; i++) { G[i].clear(); iter[i] = d[i] = gap[i] = 0; } } void addEdge(int u, int v, int c) { G[u].push_back(Edge(v, c, (int)(G[v]).size())); G[v].push_back(Edge(u, 0, (int)(G[u]).size() - 1)); } int dfs(int p, int flow) { if (p == t) return flow; for (int &i = iter[p]; i < (int)(G[p]).size(); i++) { Edge &e = G[p][i]; if (e.c > 0 && d[p] == d[e.v] + 1) { int f = dfs(e.v, min(flow, e.c)); if (f) { e.c -= f; G[e.v][e.r].c += f; return f; } } } if ((--gap[d[p]]) == 0) d[s] = tot; else { d[p]++; iter[p] = 0; ++gap[d[p]]; } return 0; } int solve() { int res = 0; gap[0] = tot; for (res = 0; d[s] < tot; res += dfs(s, 1000000LL)) ; return res; } } flow; void build() {} int n, m, s, t; int ui[10210], vi[10210], gi[10210]; vector<int> g[10210], rg[10210]; void init() { n = getint(); m = getint(); s = getint(); t = getint(); flow.init(n); for (int i = 0; i < m; i++) { ui[i] = getint(); vi[i] = getint(); gi[i] = getint(); g[ui[i]].push_back(i); rg[vi[i]].push_back(i); if (gi[i]) { flow.addEdge(ui[i], vi[i], 1); flow.addEdge(vi[i], ui[i], 1000000LL); } else flow.addEdge(ui[i], vi[i], 1000000LL); } flow.addEdge(flow.s, s, 1000000LL); flow.addEdge(t, flow.t, 1000000LL); } set<int> reachable; bool tg[10210], sat[10210]; int f[10210], c[10210]; int sbk[10210], sbke[10210]; int tbk[10210], tbke[10210]; bool vst[10210], vst2[10210]; int fucktag[10210], fuck; bool go_to_s(int cur) { assert(vst[cur]); ++fuck; int st = cur; while (cur != s) { if (fucktag[sbke[cur]] == fuck) return false; fucktag[sbke[cur]] = fuck; f[sbke[cur]]++; cur = sbk[cur]; if (cur == st) return false; } return true; } bool go_to_t(int cur) { assert(vst2[cur]); ++fuck; int st = cur; while (cur != t) { if (fucktag[tbke[cur]] == fuck) return false; fucktag[tbke[cur]] = fuck; f[tbke[cur]]++; cur = tbk[cur]; if (cur == st) return false; } return true; } int ss[10210], stmp; int who[10210], ee[10210]; bool find_cycle(int now, int st, int dep = 0) { ss[now] = stmp; who[dep] = now; for (auto eid : g[now]) { if (gi[eid] == 0) continue; int nxt = vi[eid]; if (nxt == st) { sbke[st] = eid; sbk[st] = now; vst[st] = true; for (int i = 1; i <= dep; i++) { sbk[who[i]] = who[i - 1]; vst[who[i]] = true; sbke[who[i]] = ee[i - 1]; } return true; } if (ss[nxt] == stmp) continue; ee[dep] = eid; if (find_cycle(nxt, st, dep + 1)) return true; } return false; } bool find_cycle2(int now, int st, int dep = 0) { ss[now] = stmp; who[dep] = now; for (auto eid : rg[now]) { if (gi[eid] == 0) continue; int nxt = ui[eid]; if (nxt == st) { tbke[st] = eid; tbk[st] = now; vst2[st] = true; for (int i = 1; i <= dep; i++) { tbk[who[i]] = who[i - 1]; vst2[who[i]] = true; tbke[who[i]] = ee[i - 1]; } return true; } if (ss[nxt] == stmp) continue; ee[dep] = eid; if (find_cycle2(nxt, st, dep + 1)) return true; } return false; } void pre_build() { { vst[s] = true; queue<int> Q; Q.push(s); while (Q.size()) { int tn = Q.front(); Q.pop(); for (auto eid : g[tn]) { if (gi[eid] == 0) continue; if (vst[vi[eid]]) continue; vst[vi[eid]] = true; sbk[vi[eid]] = ui[eid]; sbke[vi[eid]] = eid; Q.push(vi[eid]); } } for (int i = 1; i <= n; i++) { if (!vst[i]) { ++stmp; if (find_cycle(i, i)) vst[i] = true; } } } { vst2[t] = true; queue<int> Q; Q.push(t); while (Q.size()) { int tn = Q.front(); Q.pop(); for (auto eid : rg[tn]) { if (gi[eid] == 0) continue; if (vst2[ui[eid]]) continue; vst2[ui[eid]] = true; tbk[ui[eid]] = vi[eid]; tbke[ui[eid]] = eid; Q.push(ui[eid]); } } for (int i = 1; i <= n; i++) if (!vst2[i]) { ++stmp; if (find_cycle2(i, i)) vst2[i] = true; } } } int ff[10210]; void solve() { int ans = flow.solve(); queue<int> Q; reachable.insert(s); tg[s] = true; Q.push(s); while (Q.size()) { int tn = Q.front(); Q.pop(); for (auto e : flow.G[tn]) { if (e.c == 0) continue; if (1 <= e.v and e.v <= n and !tg[e.v]) { tg[e.v] = true; Q.push(e.v); reachable.insert(e.v); } } } int cc = 0; for (int i = 0; i < m; i++) if (reachable.find(ui[i]) != reachable.end() and reachable.find(vi[i]) == reachable.end()) { sat[i] = true; ++cc; } assert(cc == ans); pre_build(); for (int i = 0; i < m; i++) { if (f[i]) continue; if (gi[i] == 0) continue; bool x = go_to_s(ui[i]); bool y = go_to_t(vi[i]); if (x and y) f[i]++; if (f[i] == 0) f[i] = 1; } for (int i = 0; i < m; i++) { if (gi[i] == 0) c[i] = 1000000LL; else { c[i] = f[i]; if (!sat[i]) c[i]++; } } ans = 0; for (int i = 0; i < m; i++) if (f[i] == c[i]) ans++; printf( %d n , ans); for (int i = 0; i < m; i++) { printf( %d %d n , f[i], c[i]); ff[ui[i]] -= f[i]; ff[vi[i]] += f[i]; } } int main() { build(); while (__--) { init(); solve(); } } |
#include <bits/stdc++.h> using namespace std; long long dp[10000006]; int main() { long long n, x, y; scanf( %lld%lld%lld , &n, &x, &y); for (int i = 0; i <= n; ++i) dp[i] = 1e18 + 100; dp[1] = x; for (int i = 2; i <= n; ++i) { if (i % 2 == 1) dp[i] = min(dp[i - 1] + x, min(dp[i / 2] + y + x, dp[i / 2 + 1] + y + x)); else dp[i] = min(dp[i - 1] + x, dp[i / 2] + y); } printf( %lld n , dp[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n, t = 0, a[6], d1, d2, d3, d4, s1, s2; cin >> m >> n; char s[m][n]; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { cin >> s[i][j]; if (s[i][j] == * ) { a[t] = i; a[t + 1] = j; t = t + 2; } } for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if ((a[2] != a[0]) && (i != a[4])) { s1 = (a[3] - a[1]) / (a[2] - a[0]); s2 = (j - a[5]) / (i - a[4]); } if (s1 == s2 || s1 == (-s2) || (a[2] == a[0] && i == a[4])) { d1 = pow((a[3] - a[1]), 2) + pow((a[2] - a[0]), 2); d2 = pow((j - a[5]), 2) + pow((i - a[4]), 2); d3 = pow((a[5] - a[3]), 2) + pow((a[4] - a[2]), 2); d4 = pow((j - a[1]), 2) + pow((i - a[0]), 2); if (d1 == d2 && d3 == d4) { cout << i + 1 << << j + 1; i = m; j = n; } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, m; cin >> n >> m; long long tot = n * (n + 1) / 2, zr = n - m, gr = m + 1; long long k = zr / gr, ans = 0; if (zr % gr == 0) { ans = tot - (k * (k + 1) / 2) * gr; } else { ans = tot - (zr % gr) * ((k + 1) * (k + 2) / 2) - (gr - (zr % gr)) * (k * (k + 1) / 2); } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long fp(long long n, long long p) { if (p == 0) return 1; if (p == 1) return n; long long res = fp(n, p / 2) % (long long)(1e9 + 7); res = ((res) * (res)) % (long long)(1e9 + 7); if (p % 2) res = (res * n) % (long long)(1e9 + 7); return res; } int n, m, x[100005], a[100005], b[100005], cnt, suspects = 0; int ans[100005]; char c[100005]; int main() { ios::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); ; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> c[i] >> x[i]; if (c[i] == + ) { a[x[i]]++; } else { b[x[i]]++; cnt++; } } for (int i = 1; i <= n; i++) { if (a[i] - b[i] + cnt == m) ans[i] = 1, suspects++; } for (int i = 1; i <= n; i++) { if (suspects > 1 && ans[x[i - 1]] == 1) cout << Not defined << n ; else if (c[i - 1] == + && ans[x[i - 1]] == 1) cout << Truth << n ; else if (c[i - 1] == - && ans[x[i - 1]] == 0) cout << Truth << n ; else cout << Lie << n ; } return 0; } |
#include<bits/stdc++.h> using namespace std; #define int long long int #define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define pii pair<int,int> #define F first #define S second #define pb push_back const int mod1=998244353,mod2=(int) 1e9+7; int power(int n,int k,int mod){int ans=1; n=n%mod;while(k>0){if(k&1)ans=(ans*n)%mod;n=(n*n)%mod;k>>=1;}return (ans+mod)%mod;}//negative nos & 0^0 struct triplet{int a,b,c;};bool operator < (const triplet &t1,const triplet &t2){if(t1.a<t2.a)return true;if(t1.a==t2.a && t1.b <t2.b)return true;if(t1.a==t2.a && t1.b ==t2.b && t1.c<t2.c)return true;return false;} // memset(dp, -1, sizeof dp); void problemSolver() { int h,w; cin>>h>>w; string s[h]; for(int i=0;i<h;i++) cin>>s[i]; int i=0,j=0,c=0; if(s[0][0]== * ) c++; while(i<=h-1 && j<=w-1) { if(j+1<w && s[i][j+1]== * ) j++; else if(i+1<h && s[i+1][j]== * ) i++; else if(j+1<w) j++; else i++; if(s[i][j]== * ) c++; if(i==h-1 && j==w-1) break; } cout<<c; } int32_t main() { // fio; #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif int testcases=1; // cin>>testcases; while(testcases--) problemSolver(); } |
#include <bits/stdc++.h> using namespace std; struct qnode { int id; long long val; bool operator<(qnode b) const { return val > b.val; } }; queue<int> qu[200100]; int w[200100], vis[200100], add[200100]; int n, m, Q, opt, x, y, z; long long dis[200100]; priority_queue<qnode> q; vector<pair<int, int> > edge[200100]; void Dijkstra() { memset(dis, 0x3f, sizeof(dis)); dis[1] = 0; memset(vis, false, sizeof(vis)); q.push((qnode){1, 0}); while (!q.empty()) { int x = q.top().id; q.pop(); if (vis[x]) continue; vis[x] = true; for (auto i : edge[x]) { int upup = i.first, z = w[i.second]; dis[upup] = min(dis[upup], dis[x] + z); if (!vis[upup]) q.push((qnode){upup, dis[upup]}); } } } int main() { scanf( %d%d%d , &n, &m, &Q); for (int i = 1; i <= m; i++) { scanf( %d%d%lld , &x, &y, &w[i]); edge[x].push_back(make_pair(y, i)); } Dijkstra(); while (Q--) { scanf( %d , &opt); if (opt == 1) { scanf( %d , &x); if (dis[x] == 0x3f3f3f3f3f3f3f3f) puts( -1 ); else printf( %lld n , dis[x]); } else { scanf( %d , &x); for (int i = 1; i <= x; i++) { scanf( %d , &y); w[y]++; } for (int i = 1; i <= n; i++) add[i] = x + 1; qu[add[1] = 0].push(1); for (int i = 0; i <= x; i++) for (; !qu[i].empty(); qu[i].pop()) { int now = qu[i].front(); if (add[now] != i) continue; for (auto j : edge[now]) { int y = j.first, z = w[j.second]; long long d = dis[now] + z + add[now] - dis[y]; if (d < add[y]) qu[add[y] = d].push(y); } } for (int i = 1; i <= n; i++) if (add[i] != x + 1) dis[i] += add[i]; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 2019, mod = 998244353; int n, m, ans, f[N << 1][N], g[N << 1][N]; int qpow(int a, int b) { int ret = 1; while (b) { if (b & 1) ret = 1ll * ret * a % mod; a = 1ll * a * a % mod, b >>= 1; } return ret; } int main() { scanf( %d%d%d , &n, &m, &ans); f[0][0] = 1; for (int i = 1; i <= 2 * n; i++) for (int j = 0; j <= min(i, n); j++) { if (!j) f[i][j] = f[i - 1][j + 1], g[i][j] = g[i - 1][j + 1]; else f[i][j] = (f[i - 1][j - 1] + 1ll * (j + 1) * f[i - 1][j + 1]) % mod, g[i][j] = (g[i - 1][j - 1] + 1ll * (j + 1) * g[i - 1][j + 1]) % mod; if (j >= m) g[i][j] = (f[i][j] + g[i][j]) % mod; } ans = 1ll * ans * qpow(1ll * f[2 * n][0] * (2 * n + 1) % mod, mod - 2) % mod * g[2 * n][0] % mod; printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; const int N = 4040; int dp[N][N]; int n, m; int main() { while (scanf( %d%d , &n, &m) != EOF) { int i, j; memset(dp, 63, sizeof(dp)); memset(dp[0], 0, sizeof(dp[0])); int ret = 0; for (i = 1; i <= n; i++) { int x, y; scanf( %d%d , &x, &y); for (j = 0; j <= m; j++) { int w = dp[i - 1][j]; dp[i][j] = min(dp[i][j], max(w, x - 1) + y); dp[i][j + 1] = min(dp[i][j + 1], w); ret = max(ret, x - 1 - w); } } for (i = 0; i <= m; i++) ret = max(ret, 86400 - dp[n][i]); printf( %d n , ret); } } |
#include <bits/stdc++.h> using namespace std; const long long LINF = 0x3f3f3f3f3f3f3f3f; const long long NLINF = 0xf7f7f7f7f7f7f7f7; const int INF = 0x3f3f3f3f, NINF = 0xf7f7f7f7; const int MOD1 = 1e9 + 7, MOD2 = 1e9 + 9; const int N = 2e5 + 10; int n, freq[30], mark[30]; vector<char> odd, ch; char s[N], r[N]; int main() { scanf( %s , &s), n = strlen(s); for (int i = 0; i < n; i++) { freq[s[i] - a ]++; } for (int i = 0; i < n; i++) { if (freq[s[i] - a ] % 2 == 0) ch.push_back(s[i]); if (freq[s[i] - a ] % 2 && !mark[s[i] - a ]) odd.push_back(s[i]), mark[s[i] - a ] = 1; } sort(odd.begin(), odd.end()); for (int i = 0; i < odd.size(); i++) { if (odd.size() % 2 && i == odd.size() / 2) while (freq[odd[i] - a ]--) ch.push_back(odd[i]); else if (i >= odd.size() / 2) { freq[odd[i] - a ]--; while (freq[odd[i] - a ]--) ch.push_back(odd[i]); } else { freq[odd[i] - a ]++; while (freq[odd[i] - a ]--) ch.push_back(odd[i]); } } sort(ch.begin(), ch.end()); assert(ch.size() == n); bool par = 1; for (int i = 0, lo = 0, hi = n - 1; i < n; i++) { if (i % 2 == par) r[hi--] = ch[i]; else if (ch[i] == ch[i + 1]) r[lo++] = ch[i]; else par = !par, r[n / 2] = ch[i]; } printf( %s n , r); } |
#include <bits/stdc++.h> #pragma GCC target( pclmul ) using ul = std::uint32_t; using ull = std::uint64_t; using li = std::int32_t; using ll = std::int64_t; using llf = long double; using uss = std::uint8_t; const ul tau = 15; const ul fib[] = { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986}; const ul sz = fib[tau]; char f[tau + 1][sz + 1]; ul ord[sz + sz]; class sam_t { public: ul las; class node { public: ul ch[2]; ul len = 0; ul fa = 0; ul cnt = 0; node() { std::memset(ch, 0, sizeof(ch)); } }; std::vector<node> st = std::vector<node>(sz + sz); void add(ul c) { ul p = las; ul np = las = st.size(); st.push_back(node()); st[np].len = st[p].len + 1; for (; p && !st[p].ch[c]; p = st[p].fa) { st[p].ch[c] = np; } if (!p) { st[np].fa = 1; } else { ul q = st[p].ch[c]; if (st[q].len == st[p].len + 1) { st[np].fa = q; } else { ul nq = st.size(); st.push_back(node()); st[nq] = st[q]; st[nq].cnt = 0; st[nq].len = st[p].len + 1; st[q].fa = st[np].fa = nq; for (; p && st[p].ch[c] == q; p = st[p].fa) { st[p].ch[c] = nq; } } } } void init() { las = 1; st.resize(0); st.resize(2); } }; sam_t sams[tau + 1]; ul n, m; ull k; const ul maxn = 200; ull lambda[maxn + 1][4]; const ul maxm = 200; ul tim = 0; char ans[maxm + 2]; ul currs[4]; ul nexts0[4]; ul nexts1[4]; ull getnum(ul st[4]) { ull ret = 0; for (ul i = 0; i != 4; ++i) { ret += lambda[n][i] * sams[tau - i].st[st[i]].cnt; } return ret; } int main() { f[0][1] = 0 ; f[1][1] = 1 ; std::scanf( %u%llu%u , &n, &k, &m); for (ul x = 2; x <= std::min(n, tau); ++x) { std::memcpy(f[x] + 1, f[x - 2] + 1, fib[x - 2]); std::memcpy(f[x] + fib[x - 2] + 1, f[x - 1] + 1, fib[x - 1]); } if (n <= tau) { sams[n].init(); for (ul i = 1; i <= fib[n]; ++i) { sams[n].add(f[n][i] - 0 ); ++sams[n].st[sams[n].las].cnt; } for (ul i = 1; i != sams[n].st.size(); ++i) { ord[i] = i; } std::sort(ord + 1, ord + sams[n].st.size(), [&](ul a, ul b) { return sams[n].st[a].len < sams[n].st[b].len; }); for (ul it = sams[n].st.size() - 1; it >= 2; --it) { ul i = ord[it]; sams[n].st[sams[n].st[i].fa].cnt += sams[n].st[i].cnt; } ul curr = 1; ull cc = sams[n].st[1].cnt; while (tim < m) { ul next0 = sams[n].st[curr].ch[0]; ul next1 = sams[n].st[curr].ch[1]; ull cn0 = sams[n].st[next0].cnt; ull cn1 = sams[n].st[next1].cnt; if (cc - cn0 - cn1 >= k) { break; } else { k -= cc - cn0 - cn1; } if (cn0 >= k) { ++tim; ans[tim] = 0 ; curr = next0; cc = cn0; } else { ++tim; ans[tim] = 1 ; curr = next1; k -= cn0; cc = cn1; } } std::printf(ans + 1); std::putchar( n ); } else { for (ul x = tau - 3; x <= tau; ++x) { sams[x].init(); for (ul i = 1; i <= fib[x]; ++i) { sams[x].add(f[x][i] - 0 ); ++sams[x].st[sams[x].las].cnt; } for (ul i = 1; i != sams[x].st.size(); ++i) { ord[i] = i; } std::sort(ord + 1, ord + sams[x].st.size(), [&](ul a, ul b) { return sams[x].st[a].len < sams[x].st[b].len; }); for (ul it = sams[x].st.size() - 1; it >= 2; --it) { ul i = ord[it]; sams[x].st[sams[x].st[i].fa].cnt += sams[x].st[i].cnt; } lambda[x][tau - x] = 1; } for (ul x = tau + 1; x <= n; ++x) { for (ul i = 0; i != 4; ++i) { lambda[x][i] = lambda[x - 1][i] + lambda[x - 2][i] + lambda[x - 2][i] - lambda[x - 3][i] - lambda[x - 4][i]; } } for (ul i = 0; i != 4; ++i) { currs[i] = 1; } ull cc = getnum(currs); while (tim < m) { for (ul i = 0; i != 4; ++i) { nexts0[i] = sams[tau - i].st[currs[i]].ch[0]; nexts1[i] = sams[tau - i].st[currs[i]].ch[1]; } ull cn0 = getnum(nexts0); ull cn1 = getnum(nexts1); if (cc - cn0 - cn1 >= k) { break; } else { k -= cc - cn0 - cn1; } if (cn0 >= k) { ++tim; ans[tim] = 0 ; std::memcpy(currs, nexts0, sizeof(currs)); cc = cn0; } else { ++tim; ans[tim] = 1 ; std::memcpy(currs, nexts1, sizeof(currs)); k -= cn0; cc = cn1; } } std::printf(ans + 1); std::putchar( n ); } return 0; } |
#include <bits/stdc++.h> const int N = 1e5 + 1; const int INF = 1e9 + 9; int n; int d[N]; std::vector<int> a[N]; int dfs(int v) { for (int u : a[v]) { d[v] += dfs(u); } if (d[v] == 0) return d[v] = 1; return d[v]; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x; scanf( %d , &x); x--; a[x].push_back(i); } dfs(0); std::sort(d, d + n); for (int i = 0; i < n; i++) printf( %d , d[i]); } |
#include <bits/stdc++.h> using namespace std; int n, m, n1, m1; double dp[1002][1002], ans, c[1003][1003]; int main() { scanf( %d %d , &n, &m); scanf( %d%d , &n1, &m1); if (n == n1) ans = 0.000000; else if (m == 1) dp[n1][m1] = 2 * (n - n1); else { for (int i = n - 1; i >= n1; i--) { for (int j = 2; j < m; j++) { c[j][j] = 0.75, c[j][j - 1] = -0.25; c[j][j + 1] = -0.25; c[j][1002] = 1.0 + 0.25 * dp[i + 1][j]; } c[1][1] = 2.0 / 3.0; c[1][2] = -1.0 / 3.0; c[1][1002] = 1.0 + 1.0 / 3 * dp[i + 1][1]; c[m][m] = 2.0 / 3.0; c[m][m - 1] = -1.0 / 3.0; c[m][1002] = 1.0 + 1.0 / 3 * dp[i + 1][m]; c[1][2] /= c[1][1]; c[1][1002] /= c[1][1]; c[1][1] = 1; for (int j = 2; j <= m; j++) { c[j][j] -= c[j][j - 1] * c[j - 1][j]; c[j][1002] -= c[j][j - 1] * c[j - 1][1002]; c[j][j + 1] /= c[j][j]; c[j][1002] /= c[j][j]; c[j][j] = 1; } for (int j = m; j >= 1; j--) dp[i][j] = (c[j][1002] - dp[i][j + 1] * c[j][j + 1]); } } printf( %.12lf n , dp[n1][m1]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { if (x > y) swap(x, y); if (x <= 0) return y; if (y % x == 0) return x; return gcd(y % x, x); } int main() { vector<long long> a; long long b[400000]; bool c[400000]; for (long long i = 0; i < (long long)(400000); i++) { b[i] = 0; c[i] = false; } int n, k; long long g; long long x, y, z, xx, yy, zz; long long s, ans; bool v = true; ans = 0; scanf( %I64d %I64d %I64d , &z, &x, &y); g = gcd(x, y); a.push_back(0); c[0] = true; xx = 0; while (true) { if (xx >= y) xx -= y; else xx += x; if (c[xx]) break; else c[xx] = true; a.push_back(xx); } xx = 0; yy = 0; zz = 0; while (true) { if (xx < a[yy]) { b[xx] = yy; zz = max(zz, yy); xx++; } else yy++; if (yy >= a.size()) break; } ans = 0; if (z < (x + y - g)) { for (long long i = 0; i < (long long)(z + 1); i++) ans += b[i]; printf( %I64d n , ans); return 0; } for (long long i = 0; i < (long long)(x + y - g); i++) { ans += b[i]; } xx = (x + y) / g; yy = z / g; zz = (xx + yy) * (yy - xx + 1) / 2; zz *= g; ans += zz; zz = (z % g) + 1; zz *= ((z / g) + 1); ans += zz; printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9; struct outgoing { long long wt = INF, to = -1; }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; vector<long long> stations; vector<pair<long long, long long>> connections; long long n, i, j, k, t, temp; cin >> n; vector<outgoing> edge(n + 1); pair<long long, long long> vertices[n + 1]; long long cost[n + 1]; long long mult[n + 1]; for (i = 1; i <= n; i++) { cin >> vertices[i].first >> vertices[i].second; } for (i = 1; i <= n; i++) { cin >> cost[i]; edge[i].wt = cost[i]; edge[i].to = i; } for (i = 1; i <= n; i++) { cin >> mult[i]; } long long total = 0; vector<bool> selected(n + 1, false); for (i = 1; i <= n; i++) { long long v = -1; for (j = 1; j <= n; j++) { if (!selected[j] && (v == -1 || edge[j].wt < edge[v].wt)) { v = j; } } selected[v] = true; long long x_now = vertices[v].first; long long y_now = vertices[v].second; if (edge[v].to == v) { stations.push_back(v); } else { connections.push_back({v, edge[v].to}); } total += edge[v].wt; for (j = 1; j <= n; j++) { long long x_diff = fabs(vertices[j].first - vertices[v].first); long long y_diff = fabs(vertices[j].second - vertices[v].second); if ((mult[v] + mult[j]) * (x_diff + y_diff) < edge[j].wt) { edge[j].wt = (mult[v] + mult[j]) * (x_diff + y_diff); edge[j].to = v; } } } cout << total << endl; cout << stations.size() << endl; for (auto x : stations) { cout << x << ; } cout << n ; cout << connections.size() << endl; for (auto x : connections) { cout << x.first << << x.second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<char> v; vector<char> vv; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); char s[3][3], ss[3][3]; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) cin >> s[i][j]; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) cin >> ss[i][j]; if (s[0][0] != X ) v.push_back(s[0][0]); if (s[0][1] != X ) v.push_back(s[0][1]); if (s[1][1] != X ) v.push_back(s[1][1]); if (s[1][0] != X ) v.push_back(s[1][0]); if (v[0] == ss[0][0]) { if (ss[0][0] != X ) vv.push_back(ss[0][0]); if (ss[0][1] != X ) vv.push_back(ss[0][1]); if (ss[1][1] != X ) vv.push_back(ss[1][1]); if (ss[1][0] != X ) vv.push_back(ss[1][0]); } else if (ss[0][1] == v[0]) { if (ss[0][1] != X ) vv.push_back(ss[0][1]); if (ss[1][1] != X ) vv.push_back(ss[1][1]); if (ss[1][0] != X ) vv.push_back(ss[1][0]); if (ss[0][0] != X ) vv.push_back(ss[0][0]); } else if (v[0] == ss[1][1]) { vv.push_back(ss[1][1]); if (ss[1][0] != X ) vv.push_back(ss[1][0]); if (ss[0][0] != X ) vv.push_back(ss[0][0]); if (ss[0][1] != X ) vv.push_back(ss[0][1]); } else if (v[0] == ss[1][0]) { if (ss[1][0] != X ) vv.push_back(ss[1][0]); if (ss[0][0] != X ) vv.push_back(ss[0][0]); if (ss[0][1] != X ) vv.push_back(ss[0][1]); if (ss[1][1] != X ) vv.push_back(ss[1][1]); } for (int i = 0; i < 3; i++) if (v[i] != vv[i]) { cout << NO << endl; return 0; } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n / 2; i++) { cin >> a[i]; } sort(a, a + n / 2); int bb = 0, cc = 0; for (int i = 0; i < n / 2; i++) { bb += abs(a[i] - (i * 2 + 1)); cc += abs(a[i] - (i * 2 + 2)); } cout << min(bb, cc) << endl; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 10; const long long mod = 1e9 + 7; const long long INF = 1e18 + 10; int main() { long long n, m, i; string s; cin >> n; while (n--) { cin >> m >> s; if (s.size() < 11) cout << NO n ; else { for (i = 0; i < s.size(); ++i) { if (s[i] == 8 ) break; } if (i == s.size()) cout << NO n ; else { if (s.size() - i >= 11) cout << YES n ; else cout << NO n ; } } } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, mod = 1000000007, INF = 1e9 + 7; const int block = 316; int n, k, type[N], a[N], m, cnt[N * 3], l[N][5]; long long ans, res[N], p[N][5]; set<long long> s; map<long long, int> conv; struct query { int l, r, id, num; query(){}; query(int a, int b, int c) : l(a), r(b), id(a / block), num(c){}; } q[N]; bool cmp(query q1, query q2) { if (q1.id != q2.id) return q1.id < q2.id; return q1.r < q2.r; } void add(int v, int cond) { ans += cnt[l[v][cond]]; cnt[l[v][1]]++; } void remove(int v, int cond) { cnt[l[v][1]]--; ans -= cnt[l[v][cond]]; } int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> type[i]; } for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 0; i <= n; i++) { if (type[i] == 2) a[i] *= -1; p[i][1] = p[i - 1][1] + a[i]; p[i][2] = p[i][1] - k; p[i][3] = p[i][1] + k; s.insert(p[i][1]); s.insert(p[i][2]); s.insert(p[i][3]); } int cnt = 0; for (long long e : s) { conv[e] = ++cnt; } for (int i = 0; i <= n; i++) { l[i][1] = conv[p[i][1]]; l[i][2] = conv[p[i][2]]; l[i][3] = conv[p[i][3]]; } cin >> m; for (int i = 1; i <= m; i++) { int l, r; cin >> l >> r; l--; q[i] = query(l, r, i); } sort(q + 1, q + m + 1, &cmp); int l = 0, r = -1; for (int i = 1; i <= m; i++) { int L = q[i].l, R = q[i].r; while (r < R) add(++r, 2); while (l < L) remove(l++, 3); while (R < r) remove(r--, 2); while (L < l) add(--l, 3); res[q[i].num] = ans; } for (int i = 1; i <= m; i++) { cout << res[i] << endl; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 5; const int MAXQ = 3e5 + 5; const int inf = 0x3f3f3f3f; struct Query { int id, l, r; Query(void) {} Query(int _id, int _l, int _r) : id(_id), l(_l), r(_r) {} }; long long res[MAXQ]; struct Solver { vector<int> a, b; vector<Query> qs; void solve(void) { int n = (int)a.size(); a.push_back(-inf); b.push_back(-inf); vector<vector<Query> > f(n), g(n); for (Query x : qs) x.r = min(x.r, n - 1), f[x.l].push_back(x); vector<int> sta(1, n), val(1, -inf); for (int i = n - 1; i >= 0; --i) { int pos = lower_bound(val.begin(), val.end(), b[i]) - val.begin(); pos = sta[pos - 1]; for (Query x : f[i]) { int id = x.id, l = x.l, r = x.r; if (pos > r) { res[id] = (long long)(r - l + 1) * b[i]; continue; } res[id] = (long long)(pos - l) * b[i]; x.l = pos; g[pos].push_back(x); } while (val.back() >= a[i]) val.pop_back(), sta.pop_back(); sta.push_back(i); val.push_back(a[i]); } sta = vector<int>(1, n); val = vector<int>(1, -inf); vector<long long> sum(1, 0); for (int i = n - 1; i >= 0; --i) { while (val.back() >= a[i]) { val.pop_back(); sta.pop_back(); sum.pop_back(); } sum.push_back((long long)a[i] * (sta.back() - i) + sum.back()); sta.push_back(i); val.push_back(a[i]); for (Query x : g[i]) { int id = x.id, r = x.r; int pos = lower_bound(sta.begin(), sta.end(), r, greater<int>()) - sta.begin(); res[id] += sum.back() - sum[pos]; res[id] += (long long)(x.r - sta[pos] + 1) * val[pos]; } } } } slv[MAXN]; int a[MAXN], f[MAXN]; int main(void) { int n, Q, d; scanf( %d%d%d , &n, &Q, &d); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); deque<int> q; for (int i = 0; i < n; ++i) { while (q.size() && q.front() <= i - d) q.pop_front(); while (q.size() && a[q.back()] >= a[i]) q.pop_back(); q.push_back(i); f[i] = a[q.front()]; } for (int i = 0; i < n; ++i) { int t = i % d; slv[t].a.push_back(f[i]); slv[t].b.push_back(a[i]); } for (int i = 1; i <= Q; ++i) { int l, r; scanf( %d%d , &l, &r); --l; --r; int t = l % d; if (r % d < l % d) r -= d; l /= d; r /= d; slv[t].qs.emplace_back(i, l, r); } for (int i = 0; i < d; ++i) slv[i].solve(); for (int i = 1; i <= Q; ++i) printf( %lld n , res[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long A[300010], B[300010]; int n, m; struct node { int negpos, negpos_pref, negpos_suf, neg, neg_pref, neg_suf, pos, pos_pref, pos_suf, len; node() { negpos = negpos_pref = negpos_suf = neg = neg_pref = neg_suf = pos = pos_pref = pos_suf = 0; } }; node ST[3000010]; void merge(node a, node b, node &x) { x.negpos = x.negpos_pref = x.negpos_suf = -0x3f3f3f3f; x.neg = x.neg_pref = x.neg_suf = -0x3f3f3f3f; x.pos = x.pos_pref = x.pos_suf = -0x3f3f3f3f; x.negpos = max(a.negpos, max(b.negpos, a.neg_suf + b.pos_pref)); x.negpos = max(x.negpos, max(a.negpos_suf + b.pos_pref, a.neg_suf + b.negpos_pref)); x.negpos_pref = a.negpos_pref; if (a.neg == a.len) x.negpos_pref = max(x.negpos_pref, a.neg + b.negpos_pref); if (a.negpos == a.len) x.negpos_pref = max(x.negpos_pref, a.negpos + b.pos_pref); x.negpos_suf = b.negpos_suf; if (b.pos == b.len) x.negpos_suf = max(x.negpos_suf, a.negpos_suf + b.pos); if (b.negpos == b.len) x.negpos_suf = max(x.negpos_suf, a.neg_suf + b.negpos); x.pos = a.pos + b.pos; x.neg = a.neg + b.neg; x.pos_pref = a.pos_pref; if (a.pos_pref == a.len) x.pos_pref = a.len + b.pos_pref; x.pos_suf = b.pos_suf; if (b.pos_suf == b.len) x.pos_suf = a.pos_suf + b.len; x.neg_pref = a.neg_pref; if (a.neg_pref == a.len) x.neg_pref = a.len + b.neg_pref; x.neg_suf = b.neg_suf; if (b.neg_suf == b.len) x.neg_suf = a.neg_suf + b.len; } void init_node(node &x, long long v) { x.negpos = x.negpos_pref = x.negpos_suf = 0; x.pos = x.pos_pref = x.pos_suf = 0; x.neg = x.neg_pref = x.neg_suf = 0; if (v < 0) { x.neg = x.neg_pref = x.neg_suf = 1; } else if (v > 0) { x.pos = x.pos_pref = x.pos_suf = 1; } if (v) { x.negpos = x.negpos_pref = x.negpos_suf = 1; } } void init(int N, int li, int ls) { ST[N].len = (ls - li + 1); if (li == ls) { init_node(ST[N], B[li]); } else { int mid = (li + ls) / 2; init(2 * N, li, mid); init(2 * N + 1, mid + 1, ls); merge(ST[2 * N], ST[2 * N + 1], ST[N]); } } void upd(int N, int li, int ls, int p, long long v) { if (p > ls || p < li) return; if (li == p && ls == p) { B[p] += v; init_node(ST[N], B[p]); return; } int mid = (li + ls) / 2; upd(2 * N, li, mid, p, v); upd(2 * N + 1, mid + 1, ls, p, v); merge(ST[2 * N], ST[2 * N + 1], ST[N]); } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &A[i]); scanf( %d , &m); for (int i = 0; i < n - 1; i++) B[i] = A[i] - A[i + 1]; n--; if (n == 0) { while (m--) printf( 1 n ); return 0; } init(1, 0, n - 1); for (int i = 0; i < m; i++) { int l, r; long long v; scanf( %d %d %lld , &l, &r, &v); l -= 2; r--; if (l >= 0 && l < n) upd(1, 0, n - 1, l, -v); if (r >= 0 && r < n) upd(1, 0, n - 1, r, v); printf( %d n , ST[1].negpos + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[110], b[110], cnt, n; map<int, int> mp; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int num; scanf( %d , &num); if (!mp[num]) { mp[num]++; b[cnt++] = num; } } sort(b, b + cnt); if (cnt == 1) printf( 0 ); else if (cnt == 2) { if (abs(b[1] - b[0]) % 2) printf( %d , abs(b[1] - b[0])); else printf( %d , abs(b[1] - b[0]) / 2); } else if (cnt == 3 && ((b[1] - b[0]) == (b[2] - b[1]))) printf( %d , b[1] - b[0]); else printf( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n >> s; int ans = 15; for (int i = 0; i < n; i++) { if (s[i] == 0 ) ans &= 8; if (s[i] == 1 || s[i] == 2 || s[i] == 3 ) ans &= 7; if (s[i] == 1 || s[i] == 4 || s[i] == 7 ) ans &= 13; if (s[i] == 3 || s[i] == 6 || s[i] == 9 ) ans &= 14; if (s[i] == 7 || s[i] == 9 ) ans &= 11; } if (ans) cout << NO ; else cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; set<string> normal; set<string> grumpy; void build_normal() { normal.insert( great! ); normal.insert( don t think so ); normal.insert( don t touch me ); normal.insert( not bad ); normal.insert( cool ); } void build_grumpy() { grumpy.insert( no way ); grumpy.insert( don t even ); grumpy.insert( are you serious? ); grumpy.insert( go die in a hole ); grumpy.insert( worse ); grumpy.insert( terrible ); } int main() { build_normal(); build_grumpy(); for (int i = 0; i < 10; i++) { cout << i << endl; string s; getline(cin, s); if (normal.count(s)) { cout << normal << endl; return 0; } else if (grumpy.count(s)) { cout << grumpy << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 100010; int dp[550][550], A[550], B[550], path[550][550], n, m; bool print(int x) { if (!x) return false; if (print(path[n][x])) printf( %d , B[x]); else printf( %d , B[x]); return true; } int main() { int i, j, tp, ans, pos; while (~scanf( %d , &n)) { for (i = 1; i <= n; i++) scanf( %d , &A[i]); scanf( %d , &m); for (i = 1; i <= m; i++) scanf( %d , &B[i]); memset(dp, 0, sizeof dp); for (i = 1; i <= n; i++) { tp = pos = 0; for (j = 1; j <= m; j++) { dp[i][j] = dp[i - 1][j]; path[i][j] = path[i - 1][j]; if (A[i] == B[j] && tp + 1 > dp[i][j]) dp[i][j] = tp + 1, path[i][j] = pos; if (B[j] < A[i] && dp[i - 1][j] > tp) tp = dp[i - 1][j], pos = j; } } ans = 1; for (i = 1; i <= m; i++) if (dp[n][i] > dp[n][ans]) ans = i; printf( %d n , dp[n][ans]); if (dp[n][ans]) print(ans); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007LL; void solve() { long long n; cin >> n; vector<long long> a(n); for (long long &i : a) cin >> i; unordered_map<long long, bool> m; for (int i = 0; i < n; i++) { long long sum = a[i]; for (int j = i + 1; j < n; j++) { sum += a[j]; if (sum > n) break; m[sum] = true; } } long long count = 0; for (long long i : a) { count += m[i]; } cout << count << n ; } int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); int T; cin >> T; while (T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, maxi = 0; cin >> n; std::stack<int> stk; for (int i = 0; i < n; ++i) { cin >> a; a %= 2; maxi = max(maxi, a); if (!stk.empty()) { if (stk.top() == a) stk.pop(); else stk.push(a); } else stk.push(a); } if (stk.size() < 2) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a, b; long long c, nr = 0; for (a = 1; a <= n; ++a) { for (b = a; b <= n; ++b) { c = sqrt(a * a + b * b); if (c * c == a * a + b * b && c >= b && c <= n) ++nr; } } cout << nr; return 0; } |
#include <bits/stdc++.h> using namespace std; void fastIO() { ios_base::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(10); cout.tie(nullptr); cin.tie(nullptr); } template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } template <class T> T GCD(T A, T B) { return (A % B == 0) ? B : GCD(B, A % B); } const int MOD = 1e9 + 7; const int MX = 2e5 + 5; const double delta = 1e-9; const long long INF = 1e18; const long double PI = acos((long double)-1); void setIn(string s) { freopen(s.c_str(), r , stdin); } void setOut(string s) { freopen(s.c_str(), w , stdout); } bool sort_rev(int a, int b) { return a > b; } bool sort_(pair<string, int> &p1, pair<string, int> &p2) { if (p1.first == p2.first) return p1.second < p2.second; return p1.first < p2.first; } bool func(pair<int, int> a, pair<int, int> b) { return a.first > b.first; } int main() { fastIO(); int t = 1; cin >> t; while (t--) { int n; cin >> n; pair<int, int> ara[n + 1]; for (int i = 0; i < n; i++) { cin >> ara[i].first; } for (int i = 0; i < n; i++) cin >> ara[i].second; sort(ara, ara + n, func); long long aa = 0, bb = 0; for (int i = 0; i < n; i++) { long long canB = bb + ara[i].second; long long canA = max(aa, (long long)ara[i].first); if (canA <= canB) aa = canA; else bb = canB; } cout << max(aa, bb) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); template <class T> T sqr(T x) { return x * x; } template <class T> T alex(T x) { return (x > 0) ? x : -x; } template <class T> void read(T& x) { x = 0; T f = 1; char ch = getchar(); while ((ch < 48 || ch > 57) && ch != 45) ch = getchar(); if (ch == 45) f = -1, ch = getchar(); while (ch >= 48 && ch <= 57) x = x * 10 + ch - 48, ch = getchar(); x *= f; } int n, q; char s[200005]; int t[200005 << 1]; int st[200005], ed[200005], len; int tmp[200005 << 1], sa[200005 << 1], rnk[200005 << 1], sum[200005 << 1]; bool cmp(int* tmp, int x, int y, int l) { return tmp[x] == tmp[y] && tmp[x + l] == tmp[y + l]; } void getsa(int n, int m) { memset(sum, 0, sizeof(sum)); for (int i = (1); i <= (n); i++) sum[rnk[i] = t[i]]++; for (int i = (1); i <= (m); i++) sum[i] += sum[i - 1]; for (int i = (n); i >= (1); i--) sa[sum[rnk[i]]--] = i; for (int j = 1; j <= n; j <<= 1) { int p = 0; for (int i = (n); i >= (n - j + 1); i--) tmp[++p] = i; for (int i = (1); i <= (n); i++) if (sa[i] > j) tmp[++p] = sa[i] - j; memset(sum, 0, sizeof(sum)); for (int i = (1); i <= (n); i++) sum[rnk[tmp[i]]]++; for (int i = (1); i <= (max(n, m)); i++) sum[i] += sum[i - 1]; for (int i = (n); i >= (1); i--) sa[sum[rnk[tmp[i]]]--] = tmp[i]; for (int i = (1); i <= (n); i++) tmp[i] = rnk[i]; p = 1; rnk[sa[1]] = 1; for (int i = (2); i <= (n); i++) rnk[sa[i]] = p += !cmp(tmp, sa[i - 1], sa[i], j); } } int height[200005 << 1][20]; void getheight(int n) { for (int i = (1); i <= (n); i++) { int l = max(height[rnk[i - 1]][0] - 1, 0), j = sa[rnk[i] - 1]; while (i + l <= n && j + l <= n && t[i + l] == t[j + l]) l++; height[rnk[i]][0] = l; } for (int j = (1); j < (20); j++) for (int i = (1); i <= (n - (1 << j) + 1); i++) height[i][j] = min(height[i][j - 1], height[i + (1 << (j - 1))][j - 1]); } int _log2[200005 << 1]; int LCP(int x, int y) { if (x == y) return n - sa[x] + 1; if (x > y) swap(x, y); x++; int j = _log2[y - x + 1]; return min(height[x][j], height[y - (1 << j) + 1][j]); } struct Node { int idx, l, sign; Node() {} Node(int idx, int l, int sign) : idx(idx), l(l), sign(sign) {} }; int sum_bit[200005 << 1]; int lowbit(int x) { return x & (-x); } void insert(int v, int x) { for (int i = x; i <= len; i += lowbit(i)) sum_bit[i]++; } int ask(int l, int r) { int res = 0; for (int i = l - 1; i; i -= lowbit(i)) res -= sum_bit[i]; for (int i = r; i; i -= lowbit(i)) res += sum_bit[i]; return res; } vector<Node> que[200005]; int ans[500005]; void insert(int idx) { for (int i = (st[idx]); i <= (ed[idx]); i++) insert(1, rnk[i]); } int findl(int l, int r, int pos, int val) { while (l <= r) { int mid = (l + r) >> 1; if (LCP(mid, pos) >= val) r = mid - 1; else l = mid + 1; } return l; } int findr(int l, int r, int pos, int val) { while (l <= r) { int mid = (l + r) >> 1; if (LCP(pos, mid) >= val) l = mid + 1; else r = mid - 1; } return r; } int query(int idx) { int len2 = ed[idx] - st[idx] + 1; int l = findl(1, rnk[st[idx]] - 1, rnk[st[idx]], len2); int r = findr(rnk[st[idx]] + 1, len, rnk[st[idx]], len2); return ask(l, r); } int main() { read(n); read(q); int m = 26; len = 0; for (int i = (1); i <= (n); i++) { scanf( %s , s + 1); int l = strlen(s + 1); st[i] = len + 1; for (int k = (1); k <= (l); k++) t[++len] = s[k] - a + 1; ed[i] = len; t[++len] = ++m; } getsa(len, m); getheight(len); for (int i = (0); i <= (len); i++) _log2[i] = log2(i); for (int i = (1); i <= (q); i++) { int l, r, k; read(l); read(r); read(k); que[l - 1].push_back(Node(i, k, -1)); que[r].push_back(Node(i, k, 1)); } for (int i = (1); i <= (n); i++) { insert(i); for (int k = (0); k < (que[i].size()); k++) if (que[i][k].sign == -1) ans[que[i][k].idx] -= query(que[i][k].l); else ans[que[i][k].idx] += query(que[i][k].l); } for (int i = (1); i <= (q); i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; string s, ss; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> s; ss = s; reverse(ss.begin(), ss.end()); cout << s + ss; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.