func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; string s[101][2]; int n, m; int main() { cin >> n; m = 0; for (int i = 1; i <= n; i++) { bool mark = true; m++; cin >> s[m][0] >> s[m][1]; for (int j = 1; j < m; j++) if ((s[m][0] == s[j][0]) && (s[m][1] == s[j][1])) { mark = false; break; } if (!mark) { m--; } } cout << m << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int N; int main() { cin >> N; cout << N / 2 << n ; for (int i = 0; i < N / 2 - 1; i++) { cout << 2 ; } if (N % 2 == 0) cout << 2 n ; else cout << 3 n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int N[100000 + 100]; long long int ans = 0; int main() { int n; cin >> n; int court = 0; int court_1 = 0; int court_2 = 0; for (int i = 0; i < n; ++i) cin >> N[i]; for (int i = 0; i < n; ++i) { if (N[i] < -1) { ans += -1 - N[i]; N[i] = -1; ++court_2; } else if (N[i] > 1) { ans += N[i] - 1; N[i] = 1; ++court_1; } else if (N[i] == 0) { court++; } else if (N[i] == 1) { court_1++; } else if (N[i] == -1) { court_2++; } } if (court_2 % 2 != 0) { if (court != 0) { ans += 1; court--; } else if (court == 0) { if (court_1 != 0) { court_1--; ans += 2; } else if (court_1 == 0) { ans += 2; } } } if (court != 0) ans += court; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; char buf[1 << 15], *fs, *ft; inline char getc() { return (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 15, stdin), fs == ft)) ? 0 : *fs++; } inline int read() { int x = 0, f = 1; char ch = getc(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getc(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getc(); } return x * f; } const int MAXN = 40010; int n, m; int q[MAXN * 20], vis[MAXN * 20], mark[MAXN * 20]; int cnt, S, T, len, tot = 1, maxflow, t, h, st; int f[MAXN][16], num[MAXN][16], Log[MAXN], d[MAXN]; int lin[MAXN], ver[MAXN << 1], nex[MAXN << 1], pos[MAXN << 1]; int lc[MAXN * 20], nc[MAXN * 20 << 2], vc[MAXN * 20 << 2], e[MAXN * 20 << 2]; int cur[MAXN * 20]; inline void add(int x, int y) { ver[++len] = y; nex[len] = lin[x]; lin[x] = len; } inline void adc(int x, int y, int z) { vc[++tot] = y; nc[tot] = lc[x]; lc[x] = tot; e[tot] = z; vc[++tot] = x; nc[tot] = lc[y]; lc[y] = tot; e[tot] = 0; } inline void dfs(int x, int father) { d[x] = d[father] + 1; for (int i = lin[x]; i; i = nex[i]) { int tn = ver[i]; if (tn == father) continue; f[tn][0] = x; num[tn][0] = pos[i]; for (int j = 1; j <= Log[d[x]]; ++j) { num[tn][j] = ++cnt; f[tn][j] = f[f[tn][j - 1]][j - 1]; adc(num[tn][j], num[tn][j - 1], 1000000000); adc(num[tn][j], num[f[tn][j - 1]][j - 1], 1000000000); } dfs(tn, x); } } inline void LCA(int x, int y) { if (d[x] < d[y]) swap(x, y); for (int i = Log[d[x]]; i >= 0; --i) if (d[f[x][i]] >= d[y]) { adc(st, num[x][i], 1); x = f[x][i]; } if (x == y) return; for (int i = Log[d[x]]; i >= 0; --i) if (f[x][i] != f[y][i]) { adc(st, num[x][i], 1); adc(st, num[y][i], 1); x = f[x][i]; y = f[y][i]; } adc(st, num[x][0], 1); adc(st, num[y][0], 1); return; } inline int bfs() { t = h = 0; for (int i = 1; i <= cnt; ++i) { cur[i] = lc[i]; vis[i] = 0; } q[++t] = S; vis[S] = 1; while (h++ < t) { int x = q[h]; for (int i = lc[x]; i; i = nc[i]) { int tn = vc[i]; if (vis[tn] || !e[i]) continue; q[++t] = tn; vis[tn] = vis[x] + 1; if (tn == T) return 1; } } return 0; } inline int dinic(int x, int flow) { if (x == T) return flow; int rest = flow, k; for (int i = cur[x]; i && rest; i = nc[i]) { cur[x] = i; int tn = vc[i]; if (vis[tn] == vis[x] + 1 && e[i]) { k = dinic(tn, min(e[i], rest)); if (!k) { vis[tn] = 0; continue; } e[i] -= k; e[i ^ 1] += k; rest -= k; } } return flow - rest; } inline void bfs(int s) { t = h = 0; memset(vis, 0, sizeof(vis)); q[++t] = s; while (h++ < t) { int x = q[h]; vis[x] = 1; for (int i = lc[x]; i; i = nc[i]) { int tn = vc[i]; if (!e[i]) continue; if (vis[tn]) continue; q[++t] = tn; } } } int main() { n = read(); m = read(); cnt = n - 1; for (int i = 1; i < n; ++i) { int x, y; x = read(); y = read(); add(x, y); add(y, x); pos[len] = pos[len - 1] = i; Log[i + 1] = Log[(i + 1) >> 1] + 1; } dfs(1, 0); S = ++cnt; T = ++cnt; for (int i = 1; i < n; ++i) adc(i, T, 1); for (int i = 1; i <= m; ++i) { int x, y; st = i + cnt; x = read(); y = read(); adc(S, st, 1); LCA(x, y); } int flow = 0; st = cnt; cnt = cnt + m; while (bfs()) while ((flow = dinic(S, 1000000000))) maxflow += flow; printf( %d n , maxflow); bfs(S); int count = 0; for (int i = 1; i <= m; ++i) if (!vis[st + i]) ++count; printf( %d , count); for (int i = 1; i <= m; ++i) if (!vis[st + i]) printf( %d , i); puts( ); count = 0; for (int i = 1; i < n; ++i) if (vis[i]) ++count; printf( %d , count); for (int i = 1; i < n; ++i) if (vis[i]) printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, t[200005], ans = 0; bool chk[200005]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , t + i); chk[0] = true; for (int i = n; i >= 1; i--) if (!chk[i]) { int x = i; ans++; while (!chk[x]) chk[x] = true, x = t[x]; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int x, y, z; cin >> x >> y >> z; if (x != y && y != z && z != x) cout << NO << n ; else { int a = min(min(x, y), z); int c = max(max(x, y), z); int b = x + y + z - a - c; if (a == c || b == c) cout << YES << n << min(a, b) << << min(a, b) << << c << n ; else if (a == b) { if (b == c) cout << YES << n << a << << b << << c << n ; else cout << NO << n ; } } } } |
#include <bits/stdc++.h> using namespace std; long long ppow(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = (res * a) % 998244353; a = (a * a) % 998244353; b >>= 1; } return res; } struct st { long long c, x, y; }; long long sum[2000000]; long long x_2[2000000]; long long xx[2000000]; long long y_2[2000000]; long long yy[2000000]; long long ans[2000000]; signed main() { int n, m; scanf( %d%d , &n, &m); vector<st> v; for (int i = 0; i < (n); i++) for (int j = 0; j < (m); j++) { int a; scanf( %d , &a); v.push_back({a, i, j}); } int r, c; scanf( %d%d , &r, &c); r--; c--; sort(v.begin(), v.end(), [](st a, st b) { return a.c < b.c; }); for (int i = 0; i < (v.size()); i++) { st a = v[i]; int j = lower_bound(v.begin(), v.end(), v[i], [](st a, st b) { return a.c < b.c; }) - v.begin(); if (j == 0) { ans[i] = 0; } else { j--; ans[i] = (sum[j] + x_2[j] * a.x + xx[j] + (a.x * a.x) * (j + 1) + y_2[j] * a.y + yy[j] + (a.y * a.y) * (j + 1)) % 998244353 * ppow(j + 1, 998244353 - 2) % 998244353; } sum[i] = ans[i]; x_2[i] = (-2 * a.x + 998244353) % 998244353; xx[i] = a.x * a.x; y_2[i] = (-2 * a.y + 998244353) % 998244353; yy[i] = a.y * a.y; if (i) { (sum[i] += sum[i - 1]) %= 998244353; (x_2[i] += x_2[i - 1]) %= 998244353; (xx[i] += xx[i - 1]) %= 998244353; (y_2[i] += y_2[i - 1]) %= 998244353; (yy[i] += yy[i - 1]) %= 998244353; } if (a.x == r && a.y == c) { cout << ans[i] % 998244353 << endl; return 0; } } } |
#include <bits/stdc++.h> using namespace std; ifstream in( file.in ); ofstream out( file.out ); struct om { int p, t, id; } a[100005], b[100005]; int n, w, h, cnt1[200005], cnt2[200005], ans[100005], v[200005], k, m, first, nibab[100005]; pair<int, int> fk[100005]; queue<int> q[200005]; bool comp(om a, om b) { return a.p < b.p; } int main() { ios_base ::sync_with_stdio(0); cin.tie(); cin >> n >> w >> h; for (int i = 1; i <= n; i++) { cin >> first; if (first == 1) { k++; cin >> a[k].p >> a[k].t; a[k].id = i; cnt1[a[k].t - a[k].p + 100000]++; } else { m++; cin >> b[m].p >> b[m].t; b[m].id = i; cnt2[b[m].t - b[m].p + 100000]++; } } sort(a + 1, a + k + 1, comp); sort(b + 1, b + m + 1, comp); for (int i = m; i >= 1; i--) { q[b[i].t - b[i].p + 100000].push(b[i].id); } for (int i = 1; i <= k; i++) { q[a[i].t - a[i].p + 100000].push(a[i].id); } for (int i = 1; i <= k; i++) { ans[a[i].id] = q[a[i].t - a[i].p + 100000].front(); q[a[i].t - a[i].p + 100000].pop(); } for (int i = m; i >= 1; i--) { while (q[b[i].t - b[i].p + 100000].size()) q[b[i].t - b[i].p + 100000].pop(); } for (int i = 1; i <= k; i++) { while (q[a[i].t - a[i].p + 100000].size()) q[a[i].t - a[i].p + 100000].pop(); } for (int i = k; i >= 1; i--) { q[a[i].t - a[i].p + 100000].push(a[i].id); } for (int i = 1; i <= m; i++) { q[b[i].t - b[i].p + 100000].push(b[i].id); } for (int i = 1; i <= m; i++) { ans[b[i].id] = q[b[i].t - b[i].p + 100000].front(); q[b[i].t - b[i].p + 100000].pop(); } for (int i = 1; i <= n; i++) nibab[ans[i]] = i; for (int i = 1; i <= k; i++) { fk[a[i].id] = {a[i].p, h}; } for (int i = 1; i <= m; i++) { fk[b[i].id] = {w, b[i].p}; } for (int i = 1; i <= n; i++) { cout << fk[nibab[i]].first << << fk[nibab[i]].second << n ; } } |
#include <bits/stdc++.h> using namespace std; template <class n, class second> ostream &operator<<(ostream &p, pair<n, second> x) { return p << < << x.first << , << x.second << > ; } template <class n> auto operator<<(ostream &p, n y) -> typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type { int o = 0; p << { ; for (auto c : y) { if (o++) p << , ; p << c; } return p << } ; } void dor() { cerr << n ; } template <class n, class... second> void dor(n p, second... y) { cerr << p << ; dor(y...); } template <class n, class second> void mini(n &p, second y) { if (p > y) p = y; } template <class n, class second> void maxi(n &p, second y) { if (p < y) p = y; } int main() { vector<vector<int> > res; string second; cin >> second; while (1) { if (second.size() == 0) break; int wsk = second.size() - 1; vector<int> act; for (int i = 0; i < (int)(second.size()); ++i) { ; if (second[i] == ( ) { while (wsk > i && second[wsk] != ) ) { wsk--; } if (wsk <= i) break; act.push_back(i); act.push_back(wsk); second[i] = ; second[wsk] = ; } } if (act.size() == 0) break; res.push_back(act); } sort((res).begin(), (res).end()); if (res.size() == 0) cout << 0 << n ; else { cout << res.size() << n ; for (auto j : res) { sort((j).begin(), (j).end()); cout << j.size() << n ; for (auto i : j) cout << i + 1 << ; cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; vector<int> basis; void add(int x) { for (int& a : basis) if (a & -a & x) x ^= a; if (x == 0) return; for (int& a : basis) if (x & -x & a) a ^= x; basis.emplace_back(x); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int x = 0; int n; cin >> n; for (int i = 1; i <= n; ++i) { int a; cin >> a; add(x ^= a); } if (x) cout << basis.size(); else cout << -1 ; } |
#include <bits/stdc++.h> using namespace std; const int mod = (int)1e9 + 7; int pw(int a, int b) { if (b == 0) return 1; long long t = pw(a, b / 2); t = (t * t) % mod; if (b % 2) t = (t * a) % mod; return t; } int arr[26]; int main() { int n, i, j; string str; cin >> n >> str; for (i = 0; i < n; i++) arr[str[i] - A ]++; int mx = 0; for (i = 0; i < 26; i++) mx = max(mx, arr[i]); int k = 0; for (i = 0; i < 26; i++) { if (arr[i] == mx) k++; } cout << pw(k, n) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long modpow(long long a, long long b, long long mod = (long long)(1e9 + 7)) { if (!b) return 1; a %= mod; return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int mxn = 1e6; const long long infty = 1e18; int n, a, b, p; int x[mxn]; vector<int> primes; long long dp[mxn][3]; long long cost(int i) { return x[i] % p ? (x[i] % p == 1 || x[i] % p + 1 == p ? b : infty) : 0; } long long dpsolve() { for (int i = 0; i < n; i++) for (int j = 0; j < 3; j++) dp[i][j] = infty; dp[0][0] = dp[0][2] = cost(0); dp[0][1] = a; for (int i = 0; i < n - 1; i++) for (int j = 0; j < 3; j++) if (dp[i][j] < infty) for (int k = j; k <= 2; k++) { if (k == 1) (dp[i + 1][k]) = min((dp[i + 1][k]), (dp[i][j] + a)); else (dp[i + 1][k]) = min((dp[i + 1][k]), (dp[i][j] + cost(i + 1))); } long long ans = infty; for (int k = 0; k < 3; k++) (ans) = min((ans), (dp[n - 1][k])); return ans; } inline void getPrime(int temp) { for (long long p = 2; p * p <= temp; p++) if (temp % p == 0) { primes.push_back(p); while (temp % p == 0) temp /= p; } if (temp > 1) primes.push_back(temp); } void solve() { scanf( %d , &n); scanf( %d , &a); scanf( %d , &b); for (int i = 0; i < n; i++) scanf( %d , &x[i]); for (int d = -1; d <= 1; d++) getPrime(x[0] + d), getPrime(x[n - 1] + d); long long ans = infty; for (int pp : primes) p = pp, (ans) = min((ans), (dpsolve())); cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long T; cin >> T; while (T--) { long long n; cin >> n; long long ans = 0; long long one = 0, two = 0; for (int i = 1; i <= n; i++) { long long x; cin >> x; x %= 3; if (x == 0) ans++; if (x == 1) one++; if (x == 2) two++; } if (one >= two) { ans += two; ans += (one - two) / 3; } else { ans += one; ans += (two - one) / 3; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, cnt11 = 0, cnt12 = 0, cnt13 = 0, cnt14 = 0, cnt15 = 0, cnt16 = 0, cnt17 = 0, cnt18 = 0, cnt19 = 0; int cnt21 = 0, cnt22 = 0, cnt23 = 0, cnt24 = 0, cnt25 = 0, cnt26 = 0, cnt27 = 0, cnt28 = 0, cnt29 = 0; cin >> n >> m; int a[n], b[m]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < m; i++) { cin >> b[i]; } sort(a, a + n); sort(b, b + m); for (int i = 0; i < n; i++) { if (a[i] == 1) { cnt11++; } if (a[i] == 2) { cnt12++; } if (a[i] == 3) { cnt13++; } if (a[i] == 4) { cnt14++; } if (a[i] == 5) { cnt15++; } if (a[i] == 6) { cnt16++; } if (a[i] == 7) { cnt17++; } if (a[i] == 8) { cnt18++; } if (a[i] == 9) { cnt19++; } } for (int i = 0; i < m; i++) { if (b[i] == 1) { cnt21++; } if (b[i] == 2) { cnt22++; } if (b[i] == 3) { cnt23++; } if (b[i] == 4) { cnt24++; } if (b[i] == 5) { cnt25++; } if (b[i] == 6) { cnt26++; } if (b[i] == 7) { cnt27++; } if (b[i] == 8) { cnt28++; } if (b[i] == 9) { cnt29++; } } if (cnt11 > 0 && cnt21 > 0) { cout << 1 << endl; } else if (cnt12 > 0 && cnt22 > 0) { cout << 2 << endl; } else if (cnt13 > 0 && cnt23 > 0) { cout << 3 << endl; } else if (cnt14 > 0 && cnt24 > 0) { cout << 4 << endl; } else if (cnt15 > 0 && cnt25 > 0) { cout << 5 << endl; } else if (cnt16 > 0 && cnt26 > 0) { cout << 6 << endl; } else if (cnt17 > 0 && cnt27 > 0) { cout << 7 << endl; } else if (cnt18 > 0 && cnt28 > 0) { cout << 8 << endl; } else if (cnt19 > 0 && cnt29 > 0) { cout << 9 << endl; } else { if (a[0] == b[0]) { cout << a[0] << endl; } if (a[0] > b[0]) { cout << b[0] << a[0] << endl; } if (a[0] < b[0]) { cout << a[0] << b[0] << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int mx = (1 << 30) - 1; int n, m; struct node { vector<pair<int, int> > p; void cal(int a, int b) { int res = a ^ b; for (int i = 0; i < 30; i++) { int t = res ^ (1 << i) ^ (res & ((1 << i) - 1)); if ((t ^ a) > b) p.emplace_back(t, t + (1 << i) - 1); } } void get(int first, int l, int r) { cal(first, r); cal(mx ^ first, mx ^ l); } }; void solve() { node temp; scanf( %d%d , &n, &m); temp.get(n, 0, m); sort(temp.p.begin(), temp.p.end()); printf( %d n , temp.p[0].first); } int main() { int t; scanf( %d , &t); while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; inline long long rd() { long long x = 0; char c = getchar(); int neg = 1; while (c < 0 || c > 9 ) { if (c == - ) neg = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return x * neg; } int N, Q, pre[maxn], A[maxn], tmp[maxn], ans[maxn]; pair<int, int> mn[maxn << 2]; struct Node { int l, r, i; } que[maxn]; inline bool cmp(Node a, Node b) { return a.r < b.r; }; inline void update(int p) { mn[p] = min(mn[p << 1], mn[p << 1 | 1]); } void change(int p, int l, int r, int x, int y) { if (l == r) mn[p] = make_pair(y, x); else { int m = l + r >> 1; if (x <= m) change(p << 1, l, m, x, y); else change(p << 1 | 1, m + 1, r, x, y); update(p); } } pair<int, int> query(int p, int l, int r, int x, int y) { if (x <= l && r <= y) return mn[p]; int m = l + r >> 1; pair<int, int> re = make_pair(N + 1, 0); if (x <= m) re = query(p << 1, l, m, x, y); if (y >= m + 1) re = min(re, query(p << 1 | 1, m + 1, r, x, y)); return re; } int main() { int i, j, k; N = rd(); for (i = 1; i <= N; i++) { A[i] = rd(); pre[i] = tmp[A[i]], tmp[A[i]] = i; } Q = rd(); for (i = 1; i <= Q; i++) { que[i].l = rd(), que[i].r = rd(), que[i].i = i; } sort(que + 1, que + Q + 1, cmp); memset(mn, 127, sizeof(mn)); for (i = 1, j = 1; i <= Q; i++) { for (; j <= que[i].r && j <= N; j++) { if (pre[j]) change(1, 1, N, pre[j], N + 1); change(1, 1, N, j, pre[j]); } pair<int, int> re = query(1, 1, N, que[i].l, que[i].r); if (re.first < que[i].l) ans[que[i].i] = A[re.second]; } for (i = 1; i <= Q; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) const int N = 2e5 + 5, L = 19; string s; int cl[L][N], sf[L][N], ct[N], pos[N], lcp[N], t[L][N], g[N]; pair<int, int> a[N + N]; int *suf = sf[L - 1]; int que(int l, int r) { int k = g[r - l + 1]; return min(t[k][l], t[k][r - (1 << k) + 1]); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); for (int i = 2; i < N; i++) g[i] = g[i >> 1] + 1; int n, q; cin >> n >> q >> s; s += # ; n++; for (int i = 0; i < n; i++) { ct[s[i]]++; } for (int i = 0; i < N - 1; i++) { ct[i + 1] += ct[i]; } for (int i = n - 1; i >= 0; i--) { sf[0][--ct[s[i]]] = i; cl[0][i] = s[i]; } for (int i = 1; i < L; i++) { for (int j = 0; j < n; j++) { sf[i - 1][j] = (sf[i - 1][j] - (1 << (i - 1)) % n + n) % n; } fill(ct, ct + N, 0); for (int j = 0; j < n; j++) { ct[cl[i - 1][sf[i - 1][j]]]++; } for (int j = 0; j < N - 1; j++) { ct[j + 1] += ct[j]; } for (int j = n - 1; j >= 0; j--) { sf[i][--ct[cl[i - 1][sf[i - 1][j]]]] = sf[i - 1][j]; } for (int j = 0, k = 0; j < n; j++) { cl[i][sf[i][j]] = k; if (j + 1 < n && (cl[i - 1][sf[i][j]] != cl[i - 1][sf[i][j + 1]] || cl[i - 1][(sf[i][j] + (1 << (i - 1))) % n] != cl[i - 1][(sf[i][j + 1] + (1 << (i - 1))) % n])) { k++; } } } for (int i = 0; i < n; i++) { pos[suf[i]] = i; } for (int i = 0, j = 0; i < n; i++) { int p = pos[i]; if (p == n - 1) { j = 0; continue; } int q = suf[p + 1]; while (i + j < n && q + j < n && s[i + j] == s[q + j]) { j++; } lcp[p] = j; j = max(0, j - 1); } for (int i = 0; i < n; i++) { t[0][i] = lcp[i]; } for (int i = 1; i < L; i++) { for (int j = 0; j + (1 << i) <= n; j++) { t[i][j] = min(t[i - 1][j], t[i - 1][j + (1 << (i - 1))]); } } for (int i = 0; i < q; i++) { int la, lb, ls; cin >> la >> lb; ls = 0; for (int j = 0; j < la; j++) { cin >> a[ls].first; a[ls].first--; a[ls++].second = 1; } for (int j = 0; j < lb; j++) { cin >> a[ls].first; a[ls].first--; a[ls++].second = 0; } sort(a, a + ls, [](pair<int, int> &x, pair<int, int> &y) { if (pos[x.first] == pos[y.first]) return x.second < y.second; return pos[x.first] < pos[y.first]; }); long long ans = 0; for (int j = 0; j < ls - 1; j++) { if (a[j].first == a[j + 1].first) ans += n - 1 - a[j].first; } vector<pair<int, int>> v; v.push_back({-1, 0}); long long sum = 0; for (int j = 1; j < ls; j++) { if (a[j - 1].first != a[j].first) { int h = que(pos[a[j - 1].first], pos[a[j].first] - 1), x = a[j - 1].second; while (v.back().first >= h) { x += v.back().second; sum -= v.back().first * (long long)v.back().second; v.pop_back(); } v.push_back({h, x}); sum += x * (long long)h; } if (!a[j].second) ans += sum; } for (int j = 0; j < ls - 1; j++) { if (a[j].first == a[j + 1].first) swap(a[j], a[j + 1]); } v.clear(); v.push_back({-1, 0}); sum = 0; for (int j = ls - 2; j >= 0; j--) { if (a[j + 1].first != a[j].first) { int h = que(pos[a[j].first], pos[a[j + 1].first] - 1), x = a[j + 1].second; while (v.back().first >= h) { x += v.back().second; sum -= v.back().first * (long long)v.back().second; v.pop_back(); } v.push_back({h, x}); sum += x * (long long)h; } if (!a[j].second) ans += sum; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; double f[100]; int k[100]; double cpw[100]; int N; double calc(int i) { return (1 - cpw[i] * f[i]) / (1 - cpw[i]); } int main() { cin >> N; int c; int highInc = 0; double P = 1; for (int i = 0; i < N; i++) { cin >> c; cpw[i] = f[i] = 1.0 - (c / 100.0); k[i] = 1; if (calc(i) > calc(highInc)) highInc = i; P *= (1 - f[i]); } double expval = 0; double oldP; for (int i = 1; i <= 300000; i++) { oldP = P; P *= calc(highInc); k[highInc]++; cpw[highInc] *= f[highInc]; expval += i * (P - oldP); for (int j = 0; j < N; j++) if (calc(j) > calc(highInc)) highInc = j; } cout << fixed << setprecision(20) << expval + N << n ; } |
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const int SIZE = 4000050; const int P = 67; const int maxn = 20; int a[maxn], b[maxn]; int F[260]; char str[10]; struct HASH { int head[SIZE], next[SIZE]; unsigned long long state[SIZE]; double dp[SIZE]; int tol; void init() { memset(head, -1, sizeof head); tol = 0; } double find(unsigned long long s) { for (int i = head[s % SIZE]; i != -1; i = next[i]) { if (state[i] == s) return dp[i]; } return -1; } bool ins(unsigned long long s, double f) { if (find(s) > -1) return false; dp[++tol] = f; state[tol] = s; next[tol] = head[s % SIZE]; head[s % SIZE] = tol; return true; } } mat; unsigned long long Hash(int n) { for (int i = 1; i <= n; i++) b[i] = a[i]; sort(b + 1, b + n); unsigned long long s = 0; for (int i = 1; i <= n; i++) { s *= P; s += b[i]; } return s; } inline void set_ST(int st[], int x) { st[0] = (x >> 4) & 3; st[1] = (x >> 2) & 3; st[2] = x & 3; } inline int get_ST(int a, int b, int c) { if (a > c) swap(a, c); return (((a << 2) + b) << 2) + c; } double dfs(int n) { unsigned long long s = Hash(n); double f = mat.find(s), c[4] = {0, 1e9, 1e9, 1e9}; if (f > -1) return f; for (int i = 1; i < n; i++) { int x[3], y[3], nn = n; int ai = a[i], an = a[n]; set_ST(x, ai); set_ST(y, an); if ((!!x[0]) + (!!x[1]) + (!!x[2]) == 1) continue; if (y[0] && y[1] && y[2]) { nn++; y[0] = y[1] = y[2] = 0; } for (int j = 0; j < 3; j++) if (x[j]) { if ((!!x[0]) + (!!x[1]) + (!!x[2]) == 2 && (j == 1 || !x[1])) continue; int t = x[j]; x[j] = 0; a[i] = get_ST(x[0], x[1], x[2]); if ((!!x[0]) + (!!x[1]) + (!!x[2]) == 1 || !x[1]) a[i] = 0; x[j] = t; for (int k = 0; k < 3; k++) if (!y[k]) { y[k] = t; a[nn] = get_ST(y[0], y[1], y[2]); y[k] = 0; c[t] = min(c[t], dfs(nn)); } } a[i] = ai; a[n] = an; } if (c[1] == 1e9 && c[2] == 1e9 && c[3] == 1e9) { mat.ins(s, 0); return 0.0; } double p = 1.0 / 6.0; if (c[1] == 1e9) p += 1.0 / 3.0, c[1] = 0; if (c[2] == 1e9) p += 1.0 / 3.0, c[2] = 0; if (c[3] == 1e9) p += 1.0 / 6.0, c[3] = 0; f = (c[1] / 3.0 + c[2] / 3.0 + c[3] / 6.0 + 1.0) / (1.0 - p); mat.ins(s, f); return f; } int main() { int n; F[ G ] = 1; F[ B ] = 2; F[ R ] = 3; mat.init(); while (scanf( %d , &n) != EOF) { for (int i = 1; i <= n; i++) { scanf( %s , str); a[i] = get_ST(F[str[0]], F[str[1]], F[str[2]]); } printf( %.15lf n , dfs(n)); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n; cin >> n; vector<int> a(101); for (int i = 0; i < n; i++) { int x; cin >> x; ++a[x]; } cout << *max_element(a.begin(), a.end()) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<int> v; void solve() { if (k == 1) { for (int i = 0; 1 + i * (n - 1) <= n + m; i++) v.push_back(1 + i * (n - 1)); return; } for (int i = 1; i <= k; i++) v.push_back(1); v.push_back(n); for (int i = 1; i < k; i++) v.push_back(n + 1); if (n == m) v.push_back(2 * n); } int main() { scanf( %d %d %d , &n, &m, &k); solve(); printf( %d n , v.size()); for (int i = 0; i < v.size(); i++) printf( %d%c , v[i], i < v.size() - 1 ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; void solve() { int n, b, d; cin >> n >> b >> d; int res = 0; int currMass = 0; for (int i = 0; i < n; i++) { int got; cin >> got; if (got > b) continue; currMass += got; if (currMass > d) { currMass = 0; res++; } } cout << res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int dp[2005][2005]; int main() { int n, i, k1, j, k; cin >> n >> k1; long long int ans = 0; dp[0][1] = 1; for (i = 1; i <= k1; i++) { for (j = 1; j <= n; j++) { for (k = j; k <= n; k += j) { dp[i][k] += dp[i - 1][j]; dp[i][k] %= 1000000007; } } } for (j = 1; j <= n; j++) { ans += dp[k1][j]; ans %= 1000000007; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n; int cnt = 0; void rec(vector<bool> mask, int i, int ops) { if (cnt == n) return; if (i == n) { for (int j = 0; j < n; j++) cout << char( ( + mask[j]); for (int j = 0; j < n; j++) { if (ops > 0) { cout << ) ; ops--; } else { cout << ( ; ops++; } } cout << endl; cnt++; } else { mask[i] = 0; rec(mask, i + 1, ops + 1); if (ops > 0) { mask[i] = 1; rec(mask, i + 1, ops - 1); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int T; cin >> T; while (T--) { cin >> n; cnt = 0; vector<bool> t(n, 0); rec(t, 0, 0); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = (int)1e4 + 22; int n, m; void solve() { int l, r; cin >> n >> m; int val = INT_MAX; for (int i = 0; i < m; i++) { cin >> l >> r; val = min(val, r - l + 1); } cout << val << n ; for (int i = 0; i < n; i++) cout << i % val << ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> x; int modulo_sum(int a, int b) { return ((a % 1000000007) + (b % 1000000007)) % 1000000007; } int modulo_subtract(int a, int b) { return ((a % 1000000007) - (b % 1000000007)) % 1000000007; } int modulo_mult(int a, int b) { return ((long long)a * b) % 1000000007; } int power(int n) { int ini = 2; int ret = 1; while (n >= 1) { if (n % 2 == 1) ret = modulo_mult(ret, ini); ini = modulo_mult(ini, ini); n /= 2; } return ret; } int powerr[300005]; int main() { int n; cin >> n; powerr[0] = 1; for (int i = 1; i <= n; i++) { powerr[i] = modulo_sum(powerr[i - 1], powerr[i - 1]); int apl; cin >> apl; x.push_back(apl); } x.push_back(0); sort(x.begin(), x.end()); int ans = 0; for (int i = 1; i <= n; i++) { ans = modulo_sum( ans, modulo_mult(modulo_sum(powerr[i - 1], (-1) * powerr[n - i]), x[i])); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; for (int i = n + 1; i <= m; i++) { int count = 0; for (int j = 2; j < i; j++) { if (i % j == 0) count++; } if (count == 0) { if (m == i) { cout << YES << endl; return 0; } else break; } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, S, top, pos[2005], id[2005]; struct point { long long x, y; } a[2005]; struct line { long long x, y; double k; } b[4000005]; inline bool cmp1(point A, point B) { return A.x != B.x ? A.x < B.x : A.y < B.y; } inline bool cmp2(line A, line B) { return A.k < B.k; } inline long long cross(point A, point B) { return abs((A.x * B.y) - (B.x * A.y)); } inline point operator-(point A, point B) { return (point){A.x - B.x, A.y - B.y}; } inline long long getS(point A, point B, point C) { return abs(cross(B - A, C - A)); } inline long long read() { long long ret = 0, ff = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) ff = -1; ch = getchar(); } while (isdigit(ch)) { ret = (ret << 3) + (ret << 1) + (ch ^ 48); ch = getchar(); } return ret * ff; } signed main() { n = read(); S = read() * 2; for (long long i = 1; i <= n; i++) { a[i].x = read(); a[i].y = read(); pos[i] = id[i] = i; } sort(a + 1, a + n + 1, cmp1); for (long long i = 1; i <= n; i++) for (long long j = i + 1; j <= n; j++) b[++top] = (line){i, j, atan2((double)(a[j] - a[i]).y, (double)(a[j] - a[i]).x)}; sort(b + 1, b + top + 1, cmp2); for (long long i = 1; i <= top; i++) { long long x = b[i].x, y = b[i].y; if (pos[x] > pos[y]) swap(x, y); long long l, r, t; l = 1, r = pos[x] - 1; while (l <= r) { long long mid = (l + r) >> 1; if (getS(a[id[mid]], a[x], a[y]) >= S) l = mid + 1, t = mid; else r = mid - 1; } if (getS(a[id[t]], a[x], a[y]) == S) { puts( Yes ); printf( %lld %lld n , a[id[t]].x, a[id[t]].y); printf( %lld %lld n , a[x].x, a[x].y); printf( %lld %lld n , a[y].x, a[y].y); return 0; } l = pos[y] + 1, r = n; while (l <= r) { long long mid = (l + r) >> 1; if (getS(a[id[mid]], a[x], a[y]) >= S) r = mid - 1, t = mid; else l = mid + 1; } if (getS(a[id[t]], a[x], a[y]) == S) { puts( Yes ); printf( %lld %lld n , a[id[t]].x, a[id[t]].y); printf( %lld %lld n , a[x].x, a[x].y); printf( %lld %lld n , a[y].x, a[y].y); return 0; } swap(pos[x], pos[y]); swap(id[pos[x]], id[pos[y]]); } printf( No ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e6; int a[maxn], ans; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; while (n--) { int tmp; cin >> tmp; a[tmp]++; } for (int i = 0; i < maxn; i++) { a[i + 1] += a[i] / 2; ans += a[i] % 2; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int main() { long long int tc; cin >> tc; while (tc--) { long long int n; cin >> n; while (n--) cout << 1 << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, S[2]; int num[1505][1505][2]; bool s[1505][1505]; int p[4][2] = {0, -1, 1, 0, 0, 1, -1, 0}; void dfs(int x, int y) { if (num[x % n][y % m][0] == -1 && num[x % n][y % m][1] == -1) { num[x % n][y % m][0] = x; num[x % n][y % m][1] = y; } else if (num[x % n][y % m][0] != x || num[x % n][y % m][1] != y) { printf( Yes n ); exit(0); } else return; for (int i = 0; i < 4; i++) { if (s[(x + p[i][0]) % n][(y + p[i][1]) % m]) dfs(x + p[i][0], y + p[i][1]); } } int main() { scanf( %d %d , &n, &m); char ch; getchar(); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { ch = getchar(); if (ch == . ) s[i][j] = true; if (ch == S ) { s[i][j] = true; S[0] = i + n * m; S[1] = j + n * m; } } getchar(); } memset(num, -1, sizeof(num)); dfs(S[0], S[1]); printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100100, SQRT = 320, MAXM = 13; int N, M, Q; pair<int, int> up[MAXN][MAXM]; pair<int, int> jump[MAXN][MAXM]; char grid[MAXN][MAXM]; bool bounded(int x, int y) { return 1 <= x && x <= N && 1 <= y && y <= M; } bool bounded(pair<int, int> p) { return bounded(p.first, p.second); } pair<int, int> getup(int x, int y) { pair<int, int> &ref = up[x][y]; if (ref.first != -2) { return ref; } if (!bounded(x, y)) { return ref = pair<int, int>(x, y); } if (grid[x][y] == ^ ) { return ref = pair<int, int>(x - 1, y); } else if (grid[x][y] == < ) { return ref = (grid[x][y - 1] == > ? pair<int, int>(-1, -1) : getup(x, y - 1)); } else { return ref = (grid[x][y + 1] == < ? pair<int, int>(-1, -1) : getup(x, y + 1)); } } void calcjump(int i) { if (i % SQRT == 1) { copy_n(up[i] + 1, M, jump[i] + 1); } else { for (int j = 1; j <= M; j++) { pair<int, int> p = up[i][j]; jump[i][j] = bounded(p) ? jump[p.first][p.second] : p; } } } int main() { if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); } ios_base::sync_with_stdio(false); scanf( %d %d %d n , &N, &M, &Q); for (int i = 1; i <= N; i++) { gets(grid[i] + 1); fill_n(up[i], M + 2, pair<int, int>(-2, -2)); } for (int i = 0; i <= N; i++) { for (int j = 0; j <= M + 1; j++) { getup(i, j); } } for (int i = 1; i <= N; i++) { calcjump(i); } char ch; for (int x, y; Q--;) { scanf( %c %d %d , &ch, &x, &y); if (ch == A ) { pair<int, int> p(x, y); while (bounded(p)) { p = jump[p.first][p.second]; } printf( %d %d n , p.first, p.second); } else { scanf( %c , &ch); grid[x][y] = ch; fill_n(up[x] + 1, M, pair<int, int>(-2, -2)); for (int j = 1; j <= M; j++) { getup(x, j); } for (calcjump(x++); x <= N && x % SQRT != 1; x++) { calcjump(x); } } getchar(); } } |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> tree; int res = 0; int dfs(int node, int parent) { int left = 2; for (int child : tree[node]) { if (child == parent) { continue; } int x = dfs(child, node); if (x == 1 && left > 0) { ++res; --left; } } return left > 0; } int main() { int n, x, y; cin >> n >> x >> y; vector<int> degs(n, 0); tree.resize(n); for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b; --a; --b; tree[a].push_back(b); tree[b].push_back(a); ++degs[a]; ++degs[b]; } if (x < y) { dfs(0, -1); cout << res * (long long)x + (n - res - 1) * (long long)y << n ; } else { if (*max_element(degs.begin(), degs.end()) == n - 1) { cout << (long long)(n - 2) * y + x << n ; } else { cout << (long long)(n - 1) * y << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> a, b; int f[100005]; int main() { int n, tmp, i; scanf( %d , &n); a.clear(); b.clear(); for (i = 0; i < n; i++) { scanf( %d , &tmp); a.insert(make_pair(tmp, i)); } for (i = 0; i < n; i++) { scanf( %d , &tmp); b.insert(make_pair(tmp, i)); } for (i = 0; i < n; i++) f[b[i + 1]] = a[i + 1]; for (i = 0; i < n - 1; i++) printf( %d , f[i] + 1); printf( %d n , f[n - 1] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int64_t n; vector<int64_t> adj[100001]; int64_t ss[100001]; void dfs(int64_t no, int64_t par = -1) { ss[no] = 1; for (auto j : adj[no]) { if (j == par) { continue; } dfs(j, no); ss[no] += ss[j]; } } vector<int64_t> ord; int64_t dfs2(int64_t no, int64_t par = -1) { for (auto j : adj[no]) { if (j == par) { continue; } if (ss[j] > n / 2) { return dfs2(j, no); } } return no; } int64_t ans = 0; void dfs3(int64_t no, int64_t par = -1, int64_t levv = 0) { ord.push_back(no); ans += levv * 2; for (auto j : adj[no]) { if (j == par) { continue; } dfs3(j, no, levv + 1); } } int64_t ans2[100001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int64_t i = 0; i < n - 1; i++) { int64_t aa, bb; cin >> aa >> bb; aa--; bb--; adj[aa].push_back(bb); adj[bb].push_back(aa); } dfs(0); int64_t cen = dfs2(0); dfs3(cen); for (int64_t i = 0; i < n; i++) { ord.push_back(ord[i]); } int64_t x = (n / 2); cout << ans << endl; for (int64_t i = 0; i < n; i++) { ans2[ord[i]] = ord[i + x] + 1; } for (int64_t i = 0; i < n; i++) { cout << ans2[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 400005; multiset<int> S; int x, y, n, m, k; map<pair<int, int>, int> flag; struct Tree { int l, r, num, flag; } T[N * 4]; void build(int x, int l, int r) { T[x].l = l; T[x].r = r; if (l == r) { T[x].num = l - 1; return; } int mid = (l + r) / 2; build(x * 2, l, mid); build(x * 2 + 1, mid + 1, r); T[x].num = max(T[x * 2].num, T[x * 2 + 1].num); } void down(int x) { T[x * 2].num += T[x].flag; T[x * 2 + 1].num += T[x].flag; T[x * 2].flag += T[x].flag; T[x * 2 + 1].flag += T[x].flag; T[x].flag = 0; } void insert(int x, int l, int r, int z) { if (T[x].l > r || l > T[x].r) return; if (T[x].l >= l && T[x].r <= r) { T[x].num += z; T[x].flag += z; return; } down(x); insert(x * 2, l, r, z); insert(x * 2 + 1, l, r, z); T[x].num = max(T[x * 2].num, T[x * 2 + 1].num); } int find(int x, int l, int r) { if (T[x].l > r || l > T[x].r) return 0; if (T[x].l >= l && T[x].r <= r) return T[x].num; down(x); return max(find(x * 2, l, r), find(x * 2 + 1, l, r)); } int main() { scanf( %d%d%d , &n, &k, &m); build(1, 1, n + n); S.insert(n + 1); while (m--) { scanf( %d%d , &x, &y); if (flag[make_pair(x, y)]) { S.erase(S.find(y + abs(x - k))); flag[make_pair(x, y)] = 0; insert(1, 1, y + abs(x - k), -1); } else { S.insert(y + abs(x - k)); flag[make_pair(x, y)] = 1; insert(1, 1, y + abs(x - k), 1); } printf( %d n , find(1, 1, *S.rbegin()) - n); } } |
#include <bits/stdc++.h> int main(int argc, const char* argv[]) { int n, k; int a[100000 + 1]; scanf( %d%d , &n, &k); int i; int count = 0; int is_ukn = scanf( %d , a) != 1; for (i = !is_ukn; i <= n; i++) scanf( %d , a + i) != 1 && getchar() && count++; int is_man_move = (n + 1 - count) & 1; int is_man_end = n & 1; if (k == 0) { puts((is_ukn && is_man_move) || (!is_ukn && a[0] == 0) ? Yes : No ); return 0; } int some_ukn = is_ukn || count; if (some_ukn) { puts(is_man_end ? Yes : No ); return 0; } int sum2 = 0; for (i = 0; i <= n && sum2 % k == 0; i++) { sum2 /= k; sum2 += a[i]; } if (i == n + 1) { if (k != 1 && k != -1) while (sum2 != 0 && sum2 % k == 0) sum2 /= k; if (sum2 == 0) { puts( Yes ); return 0; } } puts( No ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; inline int f(int a) { int n1 = n; bool y = 0; while (n1 != 0) { int h = a; int u = n1 % 10; n1 = n1 / 10; while (h != 0) { int j = h % 10; h = h / 10; if (u == j) { y = 1; break; } } } return y; } int main() { cin >> n; int ans = 0; for (int i = 1; i * i <= n; i++) { if (n % i == 0) { int i2 = n / i; if (f(i) == 1) ans++; if (f(i2) == 1 && i2 != i) ans++; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m, d = 1; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; while (n > d) { for (int i = 1; i < (m + 1); i++) { cout << d << << i << n ; cout << n << << m + 1 - i << n ; } n--; d++; } if (n == d) { for (int i = 0; i < (m / 2); i++) { cout << d << << 1 + i << n ; cout << d << << m - i << n ; } if (m & 1) cout << d << << (m + 1) / 2 << n ; } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1073741824 ) #pragma warning(disable : 4996) using namespace std; const int N = 1e5 + 100; pair<int, int> ar[N]; int col[N], us[5]; int ct(int m) { int c = 0; while (m) { c += m & 1; m >>= 1; } return c; } int main() { int n, h; scanf( %d%d , &n, &h); for (int i = 0; i < n; i++) { scanf( %d , &ar[i].first); ar[i].second = i; } if (n < 8) { int ans = 2e9, t; for (int mk = 0; mk < (1 << n); mk++) { int mx = -1, mn = 2e9; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int d = ar[i].first + ar[j].first; if (((mk >> i) & 1) != ((mk >> j) & 1)) d += h; mx = max(mx, d); mn = min(mn, d); } } if (ans > mx - mn) { ans = mx - mn; t = mk; } } printf( %d n , ans); for (int i = 0; i < n; i++) printf( %d , ((t >> i) & 1) + 1); return 0; } sort(ar, ar + n); int ans = ar[n - 1].first + ar[n - 2].first - ar[0].first - ar[1].first, s = -1, f; for (int g = 0; g < (1 << 4); g++) { int mn = 2e9, mx = -1, c = ct(g); if (c != 2) continue; for (int a = 0; a < 4; a++) { for (int b = a + 1; b < 4; b++) { int d = ar[a].first + ar[b].first; if (((g >> a) & 1) != ((g >> b) & 1)) d += h; mx = max(mx, d); mn = min(mn, d); } } for (int k = g == 0; k < (1 << 4); k++) { c = ct(k); if (c != 2) continue; int cmx = mx, cmn = mn; for (int a = 0; a < 4; a++) { for (int b = a + 1; b < 4; b++) { int d = ar[n - 4 + a].first + ar[n - 4 + b].first; if (((k >> a) & 1) != ((k >> b) & 1)) d += h; cmn = min(cmn, d); cmx = max(cmx, d); } } if (ans > cmx - cmn) { ans = cmx - cmn; f = g; s = k; } } } int cans = 2e9, ind = -1; for (int i = 0; i < n; i++) { int j = 0, d = 0, mx = -1, mn = 2e9; while (j == i) j++; mn = min(mn, ar[i].first + ar[j].first + h); d += ar[j].first; j++; while (j == i) j++; d += ar[j].first; mn = min(d, mn); d = 0; j = n - 1; while (j == i) j--; mx = max(mx, ar[i].first + ar[j].first + h); d += ar[j].first; j--; while (j == i) j--; d += ar[j].first; mx = max(d, mx); if (cans > mx - mn) { cans = mx - mn; ind = i; } } if (cans < ans) { printf( %d n , cans); ind = ar[ind].second; for (int i = 0; i < n; i++) { printf( %d , i == ind ? 2 : 1); } return 0; } if (s != -1) { for (int i = 0; i < 4; i++) { col[ar[i].second] = (f >> i) & 1; us[ar[i].second] = 1; } for (int i = 0; i < 4; i++) { col[ar[n - 4 + i].second] = (s >> i) & 1; us[col[ar[n - 4 + i].second]] = us[col[ar[n - 4 + i].second]] == 1 ? 2 : 1; } if (us[0] == 2) for (int i = 5; i < n - 4; i++) col[ar[i].second] = 0; else for (int i = 5; i < n - 4; i++) col[ar[i].second] = 1; } printf( %d n , ans); for (int i = 0; i < n; i++) printf( %d , col[i] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; pair<long long, long long> ans1[N], ans2[N]; long long x; long long cal(long long n) { n--; long long tmp = n * (n + 1) * (2 * n + 1) / 6; n++; tmp -= (n * n * n - n * n) / 2; if (2 * (x - tmp) % (n * n + n)) return -1; long long m = 2 * (x - tmp) / (n * n + n); return m; } void solve() { int cnt = 0, tot = 0; for (int i = 1; i < 1500000; i++) { long long m = cal((long long)i); if (m == -1) continue; if (m < i) break; ans1[tot++] = make_pair(i, m); if (m == i) break; ans2[cnt++] = make_pair(m, i); } printf( %d n , tot + cnt); for (int i = 0; i < tot; i++) printf( %I64d %I64d n , ans1[i].first, ans1[i].second); for (int i = cnt - 1; i >= 0; i--) printf( %I64d %I64d n , ans2[i].first, ans2[i].second); } int main() { scanf( %I64d , &x); solve(); return 0; } |
#include <bits/stdc++.h> int main() { int n, m; int left, right; int i; int count = 0; scanf( %d %d , &n, &m); while (n--) { for (i = 0; i < m; i++) { scanf( %d %d , &left, &right); if (left == 1 || right == 1) { count++; } } } printf( %d n , count); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 1) { cout << 0 << endl; return 0; } if (n == 2) { cout << 3 << endl; return 0; } long long a, b, c; a = 0; b = 3; c = 6; for (int i = 3; i <= n; i++) { c = ((a * 3) % 1000000007 + (b * 2) % 1000000007) % 1000000007; a = b; b = c; } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char str1[50], str2[50]; int n, c, k, cnt, flag; cin >> n; while (n--) { flag = cnt = 0; cin >> str1; k = strlen(str1); str1[k] = : ; str1[k + 1] = 0 ; for (int i = 0; i <= k; ++i) { if (str1[i] != : ) flag = 1; else if (flag == 1) { cnt++; flag = 0; } } for (int i = 0; i <= 38; ++i) { if (i == 4 || i == 9 || i == 14 || i == 19 || i == 24 || i == 29 || i == 34) str2[i] = : ; else str2[i] = 0 ; } c = 0; int j = 38; for (int i = k - 1; i >= 0; i--) { if (str1[i] != : ) { c++; str2[j--] = str1[i]; } if (str1[i] == : ) { if (c == 4) j--; if (c == 3) j -= 2; if (c == 2) j -= 3; if (c == 1) j -= 4; c = 0; } if (str1[i] == : && str1[i - 1] == : ) { j -= (8 - cnt) * 5; i--; } } for (int i = 0; i <= 37; ++i) cout << str2[i]; cout << str2[38] << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; struct P { int t, id; bool operator<(const P &tmp) const { if (t != tmp.t) return t < tmp.t; return id < tmp.id; } } p[N]; priority_queue<int, vector<int>, greater<int> > qu; queue<int> q; set<int> s; long long ans[N]; int n, t; long long now = 0, ed = -1, nid = 0; void gao() { if (qu.empty()) return; int x = qu.top(); if (!s.empty() && (*s.begin()) < x) return; if (q.empty()) ed += t; qu.pop(); q.push(x); s.insert(x); } int main() { scanf( %d%d , &n, &t); for (int i = 0; i < n; i++) scanf( %d , &p[i].t), p[i].id = i; sort(p, p + n); while (true) { if (nid < n && (ed >= p[nid].t || q.empty())) { now = p[nid].t; if (!s.empty() && (*s.begin()) < p[nid].id) qu.push(p[nid].id); else if (ed == p[nid].t) qu.push(p[nid].id); else { if (q.empty()) ed = now + t; q.push(p[nid].id); s.insert(p[nid].id); } nid++; } else if (!q.empty()) { int x = q.front(); q.pop(); now = max(now, ed); s.erase(x); ans[x] = ed; if (!q.empty()) ed += t; gao(); } else break; } for (int i = 0; i < n; i++) printf( %lld , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; string b[1 << 15]; int x[100], y[100], n; map<string, int> mp; int main() { scanf( %d , &n); for (int i = 0, z; i < n; i++) { scanf( %d , &z); x[i] = z & ((1 << 15) - 1); y[i] = z >> 15; } for (int B = 0; B < (1 << 15); B++) { for (int i = 1, j = __builtin_popcount(B ^ y[0]); i < n; i++) { b[B].push_back(__builtin_popcount(B ^ y[i]) - j); } if (!mp.count(b[B])) mp[b[B]] = B; } for (int B = 0; B < 1 << 15; B++) { string tmp; for (int i = 1, j = __builtin_popcount(B ^ x[0]); i < n; i++) { tmp.push_back(j - __builtin_popcount(B ^ x[i])); } if (mp.count(tmp)) { printf( %d n , B + (mp[tmp] << 15)); return 0; } } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; char a[505][505]; long long int ans, mod; namespace tree { int edge[505][505]; long long int a[505][505]; inline void init() { memset(edge, 0, sizeof(edge)); } inline long long int qpow(long long int x, long long int y) { long long int ans = 1, base = x; while (y) { if (y & 1) ans = ans * base % mod; base = base * base % mod; y >>= 1; } return ans; } inline long long int solve(int n) { memset(a, 0, sizeof(a)); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) { (a[i][j] -= edge[i][j]) %= mod; (a[i][i] += edge[i][j]) %= mod; } long long int ans = 1; for (int i = 1; i < n; ++i) { int pos = i; while (pos < n && !a[pos][i]) ++pos; if (pos >= n) continue; if (pos != i) ans = mod - ans, swap(a[pos], a[i]); for (int j = i + 1; j < n; ++j) { long long int d = qpow(a[i][i], mod - 2) * a[j][i] % mod; for (int k = 1; k < n; ++k) a[j][k] = (a[j][k] - a[i][k] * d % mod) % mod; } } for (int i = 1; i < n; ++i) ans = ans * a[i][i] % mod; return (ans % mod + mod) % mod; } } // namespace tree struct UFO { int fa[123456]; inline void init() { for (int i = 0; i < 123456; ++i) fa[i] = i; } int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } inline void merge(int x, int y) { fa[find(x)] = find(y); } } U; const int maxn = 1E6 + 5; inline void clear() { U.init(); } inline int num(int x, int y) { return x * (m + 1) + y + 1; } inline int c(int x) { if (m % 2 == 1) return (x + (x - 1) / (m + 1)) & 1; return x & 1; } int tot, bel[maxn]; inline void solve1() { clear(); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (a[i][j] == ) U.merge(num(i - 1, j - 1), num(i, j)); else if (a[i][j] == / ) U.merge(num(i - 1, j), num(i, j - 1)); for (int i = 1; i <= (n + 1) * (m + 1); ++i) if (c(i) == 0 && (!bel[U.find(i)])) bel[U.find(i)] = ++tot; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { if (a[i][j] != * ) continue; int u = num(i - 1, j - 1), v = num(i, j); if (c(num(i - 1, j - 1)) == 1) u = num(i, j - 1), v = num(i - 1, j); if (u > v) swap(u, v); u = bel[U.find(u)], v = bel[U.find(v)]; if (u == v) continue; ++tree::edge[u][v]; ++tree::edge[v][u]; } ans = (ans + tree::solve(tot)) % mod; } inline void solve2() { clear(); tree::init(); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (a[i][j] == ) U.merge(num(i - 1, j - 1), num(i, j)); else if (a[i][j] == / ) U.merge(num(i - 1, j), num(i, j - 1)); tot = 0; memset(bel, 0, sizeof(bel)); for (int i = 1; i <= (n + 1) * (m + 1); ++i) if (c(i) == 1 && (!bel[U.find(i)])) bel[U.find(i)] = ++tot; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { if (a[i][j] != * ) continue; int u = num(i - 1, j - 1), v = num(i, j); if (c(num(i - 1, j - 1)) == 0) u = num(i, j - 1), v = num(i - 1, j); if (u > v) swap(u, v); u = bel[U.find(u)], v = bel[U.find(v)]; if (u == v) continue; ++tree::edge[u][v]; ++tree::edge[v][u]; } ans = (ans + tree::solve(tot)) % mod; } int main() { ios::sync_with_stdio(false); cin >> n >> m >> mod; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) cin >> a[i][j]; solve1(); solve2(); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int ni() { int a; scanf( %d , &a); return a; } const int max_n = 5000; char s1[max_n + 1], s2[max_n + 1], res[max_n + 1]; int digits[26], minuses[26]; bool check(int from, int code, int n, int m) { bool ok = true, founded = false; digits[code]--; memset(minuses, 0, sizeof(minuses)); for (int i = from; i < m; i++) { int next = -1, need = s2[i] - a ; for (int j = 25; j >= 0; j--) { if (j >= need && digits[j] > 0) { next = j; break; } } if (next == -1) { ok = false; break; } else if (next > need) { founded = true; break; } else { digits[next]--; minuses[next]++; } } for (int i = 0; i < int(26); i++) digits[i] += minuses[i]; digits[code]++; if (n <= m && !founded) ok = false; return ok; } int main() { scanf( %s , s1); scanf( %s , s2); int n = strlen(s1), m = strlen(s2); bool found = true, before = false; for (int i = 0; i < int(n); i++) digits[s1[i] - a ]++; for (int i = 0; i < int(n); i++) { if (i >= m || before) { int code = -1; for (int j = 0; j < int(26); j++) { if (digits[j] > 0) { code = j; break; } } res[i] = a + code; digits[code]--; } else { int same = s2[i] - a , next = -1; for (int j = 0; j < int(26); j++) { if (j > same && digits[j] > 0) { next = j; break; } } if (digits[same] > 0 && check(i + 1, same, n, m)) { digits[same]--; res[i] = a + same; } else if (next != -1) { digits[next]--; res[i] = a + next; before = true; } else { found = false; break; } } } if (found) { res[n] = 0 ; printf( %s n , res); } else { printf( -1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int intersection = n * m; int turn = 0; while (n > 1 && m > 1) { intersection -= (n + m - 1); n--; m--; turn++; } if (n == 1 && m == 1 && turn % 2 == 0) { cout << Akshat << endl; } else if (n == 1 && m == 1 && turn % 2 != 0) { cout << Malvika << endl; } else if ((n != 1 || m != 1) && turn % 2 == 0) { cout << Akshat << endl; } else { cout << Malvika << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long in() { int32_t x; scanf( %d , &x); return x; } const long long maxn = 1e5 + 10; const long long mod = 1e9 + 7; const long long inf = 1e9 + 10; long long pref[2][maxn], pref2[maxn]; long long maxDp[maxn], minDp[maxn]; int32_t main() { long long n = in(); string s; cin >> s; long long lenT = in(); long long cntA = (lenT + 1) / 2; long long cntB = lenT / 2; for (long long i = 0; i < n; i++) { pref[0][i + 1] = (i ? pref[0][i - 1] : 0) + (s[i] != b ); if (i - cntA * 2 >= 0) pref[0][i + 1] -= (s[i - cntA * 2] != b ); pref[1][i + 1] = (i ? pref[1][i - 1] : 0) + (s[i] != a ); if (i - cntB * 2 >= 0) pref[1][i + 1] -= (s[i - cntB * 2] != a ); pref2[i + 1] = pref2[i] + (s[i] == ? ) - (i >= lenT ? (s[i - lenT] == ? ) : 0); } for (long long i = 0; i < n; i++) { if (i + 1 < lenT) continue; maxDp[i + 1] = maxDp[i]; long long value = maxDp[i - lenT + 1]; bool fl = (pref[1][i + 1 * bool(lenT % 2 == 0)] + pref[0][i + 1 * bool(lenT % 2)]) == lenT; value += fl; maxDp[i + 1] = max(maxDp[i + 1], value); long long options[2] = {inf, inf}; if (maxDp[i + 1] == maxDp[i]) options[0] = minDp[i]; if (fl) options[1] = minDp[i - lenT + 1] + pref2[i + 1]; minDp[i + 1] = min(options[0], options[1]); } cout << minDp[n] << n ; } |
#include <bits/stdc++.h> using namespace std; int stuff(int x) { int s = 0; while (x / 10 != 0) { int r = x % 10; x /= 10; s += r; } s += x; return s; } int main() { ios_base::sync_with_stdio(false); long long int i = 0; long long int p, f, a, b, c, s, spow = 1; long long int arr[1000]; cin >> a >> b >> c; f = a; for (s = 1; s <= 81; s++) { f = a; spow = 1; while (f--) { spow *= s; } p = (b * spow) + c; if (stuff(p) == s && p < 1000000000) { arr[i] = p; i++; } } sort(arr, arr + i); cout << i << n ; for (int j = 0; j < i; j++) { cout << arr[j] << ; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; for (int k = 0; k < t; k++) { int n, total = 0; cin >> n; while (n / 10 > 0) { total = total + (n - (n % 10)); n = ((n - (n % 10)) / 10) + n % 10; } cout << total + (n % 10) << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void max_self(T &a, const T &b) { if (a < b) a = b; } template <class T> void min_self(T &a, const T &b) { if (a > b) a = b; } const int INF = 1e9 + 7; const double PI = acos(-1.0); const double EPS = (1e-9); int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, d; long long cnt = 0; cin >> N >> d; vector<int> pos(N); for (int &ele : pos) cin >> ele; for (auto itr = pos.begin(); itr != pos.end(); ++itr) { auto lim = upper_bound((pos).begin(), (pos).end(), *itr + d); int len = distance(itr, lim) - 1; cnt += (long long)len * (len - 1) / 2; } cout << cnt << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void init() { ios::sync_with_stdio(0); cin.tie(0); } int main() { init(); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; long long arr[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> arr[i][j]; } } long long ops = 0; for (long long i = 0; i < n; i++) { for (int j = 0; j < m; j++) { long long a[4]; a[0] = arr[i][j]; a[1] = arr[n - 1 - i][m - 1 - j]; a[2] = arr[i][m - 1 - j]; a[3] = arr[n - 1 - i][j]; sort(a, a + 4); long long m = (a[1] + a[2]) / 2; for (int ii = 0; ii < 4; ii++) { ops += abs(a[ii] - (m)); } } } ops /= 4; cout << ops << endl; } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const int maxn = 3e5 + 5; const long long mod = 998244353; const double eps = 1e-6L; struct node { int l, r; bool operator<(const node& k) const { if (l == k.l) return r > k.r; return l < k.l; } } a[maxn]; long long fac[maxn], f[maxn], inv[maxn]; void init() { fac[1] = 1; f[1] = 1; inv[1] = 1; for (long long i = 2; i <= maxn; i++) { fac[i] = fac[i - 1] * i % mod; f[i] = (mod - mod / i) * f[mod % i] % mod; inv[i] = inv[i - 1] * f[i] % mod; } } long long C(long long m, long long n) { if (m < n) return 0; if (n == 0 || m == n) return 1; return fac[m] * inv[n] % mod * inv[m - n] % mod; } int b[maxn]; int main() { int T = 1; init(); while (T--) { int n, k, m = 1; scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d %d , &a[i].l, &a[i].r); b[i] = a[i].r; } sort(a, a + n); sort(b, b + n); int left = a[0].l, right = a[0].r; long long ans = 0; bool flag = true; for (int i = n - 1; i >= 0; i--) { int num = i + 1 - (lower_bound(b, b + n, a[i].l) - b); ans = (ans + C(num - 1, k - 1)) % mod; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long N; void solve() { int i, j, k, l, r, x, y; string s; cin >> N; long long ret = 0; long long a = 1; while (N > 1) { ret += N / 2 * a; N = (N + 1) >> 1; a <<= 1; } cout << ret << endl; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200008; int n, k, l, r; char g[2][maxn]; bool f[2][maxn]; struct arr { int t, s, x; } h[maxn]; bool Add(int t, int s, int x) { if (t >= x) return 0; if (x > n) return 1; if (f[s][x]) return 0; if (g[s][x] == X ) return 0; f[s][x] = 1; ++r; h[r].t = t; h[r].s = s; h[r].x = x; return 0; } bool Work() { h[1].t = 0; h[1].s = 0; h[1].x = 1; l = 1, r = 1; f[0][1] = 1; while (l <= r) { int t = h[l].t, s = h[l].s, x = h[l].x; ++l; if (Add(t + 1, s, x + 1)) return 1; if (Add(t + 1, s, x - 1)) return 1; if (Add(t + 1, s ^ 1, x + k)) return 1; } return 0; } int main() { scanf( %d%d%*c , &n, &k); scanf( %s , &g[0][1]); scanf( %s , &g[1][1]); if (Work()) printf( YES n ); else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n, m, a, b; cin >> n >> m >> a >> b; int ans = 1000000000; for (int i = 0; i <= n / m + 1; i++) { ans = min(ans, i * b + max(n - m * i, 0) * a); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 5e2 + 5; vector<pair<int, int> > adj[MAX]; int dis[MAX][MAX], in[MAX][MAX]; int n, m; void dijkstra(int source) { memset(dis[source], 0x3F, sizeof dis[source]); dis[source][source] = 0; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; pq.emplace(dis[source][source], source); while (!pq.empty()) { pair<int, int> cur = pq.top(); pq.pop(); int w, v; tie(w, v) = cur; if (w > dis[source][v]) { continue; } for (auto &each : adj[v]) { int vv, ww; tie(vv, ww) = each; if (dis[source][vv] > w + ww) { dis[source][vv] = w + ww; in[source][vv] = 1; pq.emplace(dis[source][vv], vv); } else if (dis[source][vv] == w + ww) { in[source][vv]++; } } } } int main() { scanf( %d %d , &n, &m); for (int i = int(0); i < int(m); i++) { int u, v, w; scanf( %d %d %d , &u, &v, &w); adj[u].emplace_back(v, w); adj[v].emplace_back(u, w); } for (int i = int(1); i < int(n + 1); i++) { dijkstra(i); } for (int i = int(1); i < int(n + 1); i++) { for (int j = int(i + 1); j < int(n + 1); j++) { int total = 0; for (int k = int(1); k < int(n + 1); k++) { if (dis[i][k] + dis[k][j] == dis[i][j]) { total += in[i][k]; } } printf( %d , total); } } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; if (n % 2 == 0) { cout << NO << endl; return 0; } cout << YES << endl; int arr[2 * n + 5]; for (int i = 1, j = 2 * n; i <= n; i++) { if (i % 2 == 1) { arr[i] = j; j--; arr[i + n] = j; j--; } else { arr[i + n] = j; j--; arr[i] = j; j--; } } for (int i = 1; i <= 2 * n; i++) { cout << arr[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class II, class SZ, class OI> OI cpy_n(II _i, SZ _s, OI _o) { for (int_fast64_t _j = 1; _j <= _s; _j++) { *(_o++) = *_i; if (_j != _s) { _i++; } }; return _o; } template <class T> void slurp(vector<T>& v, int_least32_t n = 1000000000) { istream_iterator<T> i(cin); istream_iterator<T> eoi; ; if (n == 1000000000) { copy((i), (eoi), back_inserter((v))); } else { v.reserve(n); cpy_n(i, n, back_inserter((v))); } } template <class T, class U> void slurp2(vector<T>& va, vector<U>& vb, int_least32_t n = 1000000000) { istream_iterator<T> a(cin); istream_iterator<T> eoa; ; istream_iterator<U> b(cin); istream_iterator<U> eob; ; if (n != 1000000000) { va.reserve(n); vb.reserve(n); } auto ao = back_inserter((va)); auto bo = back_inserter((vb)); for (int_fast64_t i = 1; i <= n; i++) { if (a == eoa) break; *(ao++) = *a; *(bo++) = *b; if (i != n) { a++; b++; } } } chrono::time_point<chrono::system_clock> start_time; void do_thing(vector<string>& bs, int_fast64_t i, int_fast64_t j) { for (int_fast64_t int_least32_t = (i); int_least32_t <= (i + 2); int_least32_t++) { if (bs[int_least32_t][j + 1] != . ) { return; } } for (int_fast64_t jj = (j); jj <= (j + 2); jj++) { if (bs[i + 1][jj] != . ) { return; } } for (int_fast64_t int_least32_t = (i); int_least32_t <= (i + 2); int_least32_t++) { bs[int_least32_t][j + 1] = # ; } for (int_fast64_t jj = (j); jj <= (j + 2); jj++) { bs[i + 1][jj] = # ; } } void do_it() { int_fast64_t n; cin >> n; vector<string> bs; slurp(bs, n); for (int_fast64_t i = (0); i <= (n - 3); i++) { for (int_fast64_t j = (0); j <= (n - 3); j++) { do_thing(bs, i, j); } } for (int_fast64_t i = (0); i <= (n - 1); i++) { for (int_fast64_t j = (0); j <= (n - 1); j++) { if (bs[i][j] != # ) { cout << NO << endl; return; } } } cout << YES << endl; } void start() { start_time = chrono::system_clock::now(); } void end() { chrono::time_point<chrono::system_clock> end_time; end_time = chrono::system_clock::now(); chrono::duration<double> diff = end_time - start_time; cerr << fixed << setprecision(4) << diff.count() << s << endl; } void do_mult() { int_least32_t times; cin >> times; for (int_fast64_t i = 1; i <= times; i++) { do_it(); } } int main() { ios::sync_with_stdio(false); start(); do_it(); end(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int prime = 999983; const int INF = 0x7FFFFFFF; const long long INFF = 0x7FFFFFFFFFFFFFFF; const double pi = acos(-1.0); const double inf = 1e18; const double eps = 1e-6; const long long mod = 1e9 + 7; long long qpow(long long a, long long b) { long long s = 1; while (b > 0) { if (b & 1) s = s * a % mod; a = a * a % mod; b >>= 1; } return s; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1}; using namespace std; const int N = 2e5 + 5; int n, m, q, to[N << 1], nxt[N << 1], ww[N << 1], head[N]; int vis[N], o[N], len, pre[N], id[N], mrk[N]; long long dis[N], sid[N], tr[N << 2]; vector<int> E[N]; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q; void spfa(int s) { memset(dis, 63, sizeof(dis)); memset(vis, 0, sizeof(vis)); Q.push(make_pair(dis[s] = 0, s)); pre[s] = 0; while (!Q.empty()) { int u = Q.top().second; Q.pop(); if (vis[u]) continue; vis[u] = 1; for (int e = head[u]; e; e = nxt[e]) { int v = to[e], w = ww[e]; if (dis[v] > dis[u] + w) pre[v] = e, Q.push(make_pair(dis[v] = dis[u] + w, v)); } } } void dfs(int u) { for (int v : E[u]) { if (!id[v]) id[v] = id[u]; dfs(v); } } void modify(int x, int l, int r, int ql, int qr, long long v) { if (l >= ql && r <= qr) { tr[x] = min(tr[x], v); return; } int mid = (l + r) >> 1; if (ql <= mid) modify(x << 1, l, mid, ql, qr, v); if (qr > mid) modify(x << 1 | 1, mid + 1, r, ql, qr, v); } long long query(int x, int l, int r, int p) { if (l == r) return tr[x]; int mid = (l + r) >> 1; if (p <= mid) return min(tr[x], query(x << 1, l, mid, p)); else return min(tr[x], query(x << 1 | 1, mid + 1, r, p)); } int main() { ios::sync_with_stdio(false); cin >> n >> m >> q; for (int i = 1, j = 1; i <= m; ++i) { int u, v, w; cin >> u >> v >> w; to[++j] = v; nxt[j] = head[u]; ww[j] = w; head[u] = j; to[++j] = u; nxt[j] = head[v]; ww[j] = w; head[v] = j; } spfa(n); memcpy(sid, dis, sizeof(sid)); spfa(1); for (int i = n; i > 1; i = to[pre[i] ^ 1]) { o[++len] = i, mrk[pre[i] >> 1] = 1; } o[++len] = 1, reverse(o + 1, o + len + 1); for (int i = 1; i <= len; ++i) { id[o[i]] = i; } for (int i = 2; i <= n; ++i) if (pre[i]) { E[to[pre[i] ^ 1]].push_back(i); } dfs(1); memset(tr, 63, sizeof(tr)); for (int i = 1; i <= n; ++i) { for (int e = head[i]; e; e = nxt[e]) { int u = i, v = to[e]; if (id[u] >= id[v] || mrk[e >> 1]) continue; modify(1, 1, len, id[u], id[v] - 1, dis[u] + ww[e] + sid[v]); } } while (q--) { int x, y; cin >> x >> y; x <<= 1; if (mrk[x >> 1]) { if (id[to[x]] > id[to[x ^ 1]]) x ^= 1; printf( %lld n , min(dis[n] - ww[x] + y, query(1, 1, len, id[to[x]]))); } else { printf( %lld n , min(dis[n], min(dis[to[x]] + sid[to[x ^ 1]], dis[to[x ^ 1]] + sid[to[x]]) + y)); } } } |
#include <bits/stdc++.h> using namespace std; int addOne(int x) { return x + 1; } int main() { int a, b; cin >> a >> b; while (b) { a = addOne(a); b--; } cout << a << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; const int dx[4] = {0, 0, -1, 1}; const int dy[4] = {-1, 1, 0, 0}; const int N = 1e5 + 1; int n; long long a[N], s[N], p[N], k; int ans = INF; bool Check(int val) { long long ans = k + 1; for (int l = 1, r = 1; l <= n; l++) { while (r <= n && a[r] - a[l] <= val) r++; r--; long long x = (a[l] * l - p[l]) + (s[r + 1] - (a[l] + val) * (n - r)); ans = min(ans, x); } for (int r = n, l = n; r > 0; r--) { while (l > 0 && a[r] - a[l] <= val) l--; l++; long long x = (s[r] - a[r] * (n - r + 1)) + ((a[r] - val) * (l - 1) - p[l - 1]); ans = min(ans, x); } return (ans <= k); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) p[i] = ((i == 1) ? a[i] : p[i - 1] + a[i]); for (int i = n; i > 0; i--) s[i] = ((i == n) ? a[i] : s[i + 1] + a[i]); int l = 0; int r = INF; while (l <= r) { int m = (l + r) / 2; if (Check(m)) { ans = m; r = m - 1; } else l = m + 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100000]; int b[100000]; int c[100000]; struct P { int a, b; } p[100000]; int cmp(P x, P y) { return x.a < y.a; } int main() { int n, x; while (cin >> n) { for (int i = 1; i <= n; i++) { cin >> x; a[x] = i; } for (int i = 1; i <= n; i++) { cin >> x; b[x] = i; p[i - 1].a = i; p[i - 1].b = x; } for (int i = 1; i <= n; i++) { int key = a[i]; int l = 0, r = n, mid; while (l < r) { mid = (l + r) / 2; if (p[mid].a == key) { if (i != n) cout << p[mid].b << ; else cout << p[mid].b << endl; break; } else if (p[mid].a > key) r = mid; else l = mid + 1; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int cnt[N], steps[N], vis[N]; void solve() { int n, res = INT_MAX, x, y; cin >> n; for (int i = 1; i < n + 1; i++) { cin >> x; queue<pair<int, int>> q; q.push({x, 0}); while (!q.empty()) { x = q.front().first; y = q.front().second; q.pop(); if (x > N) continue; if (vis[x] == i) continue; vis[x] = i; steps[x] += y; cnt[x]++; q.push({2 * x, y + 1}); q.push({x / 2, y + 1}); } } for (int i = 0; i < N; i++) { if (cnt[i] == n) { if (res > steps[i]) res = steps[i]; } } cout << res; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0), cerr.tie(0); ; int t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, k, a[N], ans = 0; multiset<int> ms; int main(int argc, char const *argv[]) { cin >> n >> k; for (int i = 1; i <= n; ++i) { cin >> a[i]; if (!a[i] && i != k) a[i] = n + 1; if (i == k && a[i]) a[i] = 0, ans = 1; ms.insert(a[i]); } int mex = 0; while (!ms.empty()) { if (ms.find(mex) == ms.end()) { int k = *ms.rbegin(); ms.erase(ms.find(k)); ans++; } else { ms.erase(mex); } mex++; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 3e5 + 5; int n, q; struct Edge { int to, nxt; } e[MAX_N]; int head[MAX_N], tote; void add_edge(int u, int v) { e[++tote].to = v, e[tote].nxt = head[u]; head[u] = tote; } int siz[MAX_N], fa[MAX_N], ans[MAX_N]; void dfs(int u, int pre) { fa[u] = pre; siz[u] = 1; int son = -1; for (int i = head[u]; i; i = e[i].nxt) { int to = e[i].to; dfs(to, u); siz[u] += siz[to]; if (son == -1 || siz[to] > siz[son]) son = to; } if (son == -1) ans[u] = u; else { son = ans[son]; while ((2 * (siz[u] - siz[son])) > siz[u]) son = fa[son]; ans[u] = son; } } void init() { memset(head, 0, sizeof(head)), tote = 0; }; int main() { init(); scanf( %d , &n), scanf( %d , &q); for (register int i = 2; i <= n; i++) { int x; scanf( %d , &x); add_edge(x, i); } dfs(1, 1); while (q--) { int x; scanf( %d , &x); printf( %d n , ans[x]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long inff = 0x3f3f3f3f3f3f3f3f; const int mod = 998244353; const double eps = 1e-9; const int maxV = 3e5 + 5; int n, V, mV, a[maxV], tot; long long dp[5][maxV]; vector<long long> w[5]; void solve(int l, int r, int L, int R, int id) { if (l > r) return; int pos = L, mid = l + r >> 1; for (int i = max(mid - (int)w[id].size(), L); i <= min(mid, R); i++) { if (dp[id][a[mid]] < dp[id - 1][a[i]] + (i == mid ? 0 : w[id][mid - i - 1])) { dp[id][a[mid]] = dp[id - 1][a[i]] + (i == mid ? 0 : w[id][mid - i - 1]); pos = i; } } solve(l, mid - 1, L, pos, id); solve(mid + 1, r, pos, R, id); } namespace fastIO { static char buf[100000], *h = buf, *d = buf; template <typename T> inline void read(T& x) { int f = 1; x = 0; register char c( h == d && (d = (h = buf) + fread(buf, 1, 100000, stdin), h == d) ? EOF : *h++); while (c > 9 || c < 0 ) { if (c == - ) f = -1; c = h == d && (d = (h = buf) + fread(buf, 1, 100000, stdin), h == d) ? EOF : *h++; } while (c <= 9 && c >= 0 ) x = (x << 1) + (x << 3) + (c ^ 48), c = h == d && (d = (h = buf) + fread(buf, 1, 100000, stdin), h == d) ? EOF : *h++; x *= f; } template <typename T> void output(T x) { if (x < 0) { putchar( - ); x = ~(x - 1); } static int s[20], top = 0; while (x) { s[++top] = x % 10; x /= 10; } if (!top) s[++top] = 0; while (top) putchar(s[top--] + 0 ); } } // namespace fastIO using fastIO::output; using fastIO::read; int main() { read(n), read(V); for (int i = (1); i <= (int)(n); ++i) { int c, w0; read(c), read(w0); w[c].push_back(w0); mV = max(mV, c); } for (int i = (1); i <= (int)(mV); ++i) { sort(w[i].begin(), w[i].end(), greater<int>()); for (int j = 1; j < w[i].size(); j++) { w[i][j] += w[i][j - 1]; } } for (int i = (1); i <= (int)(mV); ++i) { for (int j = (0); j <= (int)(i - 1); ++j) { tot = 0; for (int k = j; k <= V; k += i) { a[++tot] = k; } solve(1, tot, 1, tot, i); } } int flag = 0; printf( %lld n , dp[mV][V]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long max_n = 500 + 5; long long n; long long a[max_n], b[max_n]; bool are_equal(long long arr1[], long long arr2[], long long sz) { for (int i = 0; i < sz; ++i) { if (arr1[i] != arr2[i]) return false; } return true; } bool same_elements(long long arr1[], long long arr2[], long long sz) { long long tarr1[sz], tarr2[sz]; for (int i = 0; i < sz; ++i) { tarr1[i] = arr1[i]; tarr2[i] = arr2[i]; } sort(tarr1, tarr1 + sz); sort(tarr2, tarr2 + sz); return are_equal(tarr1, tarr2, sz); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { cin >> n; for (int z = 0; z < n; ++z) cin >> a[z]; ; for (int z = 0; z < n; ++z) cin >> b[z]; ; if (!same_elements(a, b, n) or (n & 1 and a[n / 2] != b[n / 2])) { cout << No n ; continue; } vector<pair<long long, long long> > p; for (int i = 0; i < (n / 2); ++i) p.push_back({a[i], a[n - 1 - i]}); bool flag = true; for (int i = 0; i < (n / 2) and flag; ++i) { long long x; bool got = false; pair<long long, long long> temp = {b[i], b[n - 1 - i]}; for (x = 0; x < p.size() and !got; ++x) { if (p[x] == temp) { p.erase(p.begin() + x); got = true; } } temp = {b[n - 1 - i], b[i]}; for (x = 0; x < p.size() and !got; ++x) { if (p[x] == temp) { p.erase(p.begin() + x); got = true; } } flag = got; } if (flag) cout << Yes n ; else cout << No n ; } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const double pi = acos(-1); const double e = exp(1); const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; template <typename T> inline void read(T &x) { T ans = 0; char last = , ch = getchar(); while (ch < 0 || ch > 9 ) last = ch, ch = getchar(); while (ch >= 0 && ch <= 9 ) ans = ans * 10 + ch - 0 , ch = getchar(); if (last == - ) ans = -ans; x = ans; } const int maxn = 1000 + 10; char str[maxn]; int vis[maxn]; int main() { while (~scanf( %s , str)) { memset(vis, 0, sizeof(vis)); int flag = 1; for (int i = 0; str[i]; i++) { for (int j = 0; j < str[i] - a ; j++) { if (!vis[j]) { flag = 0; break; } } if (!flag) break; vis[str[i] - a ] = 1; } puts(flag ? YES : NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[105][105], v[105][105], dp[105][105]; long long slove(int x, int y, int n, int m) { long long t = a[x][y] - (x + y - 2); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { v[i][j] = a[i][j] - (t + i + j - 2); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j] = -1; if (v[i][j] < 0) continue; if (i == 1 && j == 1) dp[i][j] = v[i][j]; else if (i == 1) { long long t = dp[i][j - 1]; if (t != -1) dp[i][j] = t + v[i][j]; } else if (j == 1) { long long t = dp[i - 1][j]; if (t != -1) dp[i][j] = t + v[i][j]; } else { long long t1 = dp[i - 1][j], t2 = dp[i][j - 1]; if (t1 != -1) dp[i][j] = t1 + v[i][j]; if (t2 != -1) { if (dp[i][j] == -1) dp[i][j] = t2 + v[i][j]; else dp[i][j] = min(dp[i][j], t2 + v[i][j]); } } } } if (dp[n][m] != -1) return dp[n][m]; else return 1e18; } int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } long long ans = 1e18; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { ans = min(ans, slove(i, j, n, m)); } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> const int INF = (1 << 31) - 1; const double EPS = 1E-9; const double PI = acos(-1); using namespace std; vector<bool> U; vector<vector<int> > G; vector<int> P, order, T; int M[5100][5100]; void dfs(int v) { U[v] = true; for (int i = 0; i < G[v].size(); ++i) if (!U[G[v][i]]) { P[G[v][i]] = v; dfs(G[v][i]); } order.push_back(v); } int main() { int n, a, b, c; cin >> n; priority_queue<pair<int, int> > Q[n]; G.resize(n); P.resize(n); T.resize(n); T.assign(n, 0); U.resize(n); U.assign(n, false); for (int i = 0; i < n; ++i) { cin >> a; Q[i].push(make_pair(-a, i)); } for (int i = 0; i < n - 1; ++i) { cin >> a >> b >> c; G[a - 1].push_back(b - 1); G[b - 1].push_back(a - 1); M[a - 1][b - 1] = c; M[b - 1][a - 1] = c; } P[0] = -1; dfs(0); int TIMER = 0; reverse(order.begin(), order.end()); while (Q[0].size() < n) { TIMER++; for (int i = 1; i < n; ++i) for (int j = 0; j < M[order[i]][P[order[i]]] && !Q[order[i]].empty(); ++j) { pair<int, int> v = Q[order[i]].top(); Q[order[i]].pop(); Q[P[order[i]]].push(v); if (P[order[i]] == 0) T[v.second] = TIMER; } } for (int i = 0; i < n; ++i) cout << T[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long base = 7; const long long maxn = 1e6 + 9; const long long inf = 1e9 + 7; set<long long> W, H; multiset<long long> l1, l2; long long w, h, n, a; long long x, y; char c; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> w >> h >> n; W.insert(0); W.insert(w); l1.insert(w); H.insert(0); H.insert(h); l2.insert(h); long long maxx; while (n--) { cin >> c >> a; if (c == V ) { W.insert(a); x = *prev(W.find(a)); y = *next(W.find(a)); auto it = l1.find(y - x); l1.erase(it); l1.insert(y - a); l1.insert(a - x); } else { H.insert(a); x = *prev(H.find(a)); y = *next(H.find(a)); auto it = l2.find(y - x); l2.erase(it); l2.insert(y - a); l2.insert(a - x); } long long p = *prev(l1.end()); long long q = *prev(l2.end()); cout << p * q << n ; } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 6; const long long MOD = 1e9 + 7; int par[MAX]; long long sz[MAX]; long long triplets(long long x) { return x * (x - 1) * (x - 2); } bool isLucky(long long x) { while (x) { if (x % 10 != 4 and x % 10 != 7) return false; x /= 10; } return true; } int Find(int u) { if (u == par[u]) return u; return par[u] = Find(par[u]); } void Union(int u, int v) { u = Find(u); v = Find(v); if (sz[u] < sz[v]) swap(u, v); if (u != v) { par[v] = u; sz[u] += sz[v]; } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; for (int i = 1; i <= n; i++) par[i] = i, sz[i] = 1; for (int i = 1; i <= n - 1; i++) { long long u, v, w; cin >> u >> v >> w; if (!isLucky(w)) Union(u, v); } long long ans = n * (n - 1) * (n - 2); for (int i = 1; i <= n; i++) { if (Find(i) == i) { ans -= 2 * sz[i] * (sz[i] - 1) * (n - sz[i]) + sz[i] * (sz[i] - 1) * (sz[i] - 2); } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-10; const double PI = acos(-1.L); struct Point { double x; double y; Point() { x = 0; y = 0; } Point(double x, double y) : x(x), y(y) {} Point operator+(const Point& other) const { return Point(x + other.x, y + other.y); } Point operator-(const Point& other) const { return Point(x - other.x, y - other.y); } double operator*(const Point& other) const { return x * other.x + y * other.y; } double operator^(const Point& other) const { return x * other.y - y * other.x; } }; ostream& operator<<(ostream& s, Point p) { return s << p.x << << p.y; } int main() { double px, py, vx, vy, a, b, c, d; cin >> px >> py >> vx >> vy >> a >> b >> c >> d; Point displ(px, py); Point t1(0, b); Point t2(-a / 2., 0); Point t3(-c / 2., 0); Point t4(-c / 2., -d); Point t5(c / 2., -d); Point t6(c / 2., 0); Point t7(a / 2., 0); double angle = atan2(vy, vx) - PI / 2.; Point rotx(cos(angle), -sin(angle)); Point roty(sin(angle), cos(angle)); cout << fixed << setprecision(12); Point s1(rotx * t1, roty * t1); s1 = s1 + displ; Point s2(rotx * t2, roty * t2); s2 = s2 + displ; Point s3(rotx * t3, roty * t3); s3 = s3 + displ; Point s4(rotx * t4, roty * t4); s4 = s4 + displ; Point s5(rotx * t5, roty * t5); s5 = s5 + displ; Point s6(rotx * t6, roty * t6); s6 = s6 + displ; Point s7(rotx * t7, roty * t7); s7 = s7 + displ; cout << s1 << n << s2 << n << s3 << n << s4 << n << s5 << n << s6 << n << s7 << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[200], b[200]; int countA = 0; int countB = 0; int countC = 0; int n = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; } for (int i = 0; i < n; i++) { if (a[i] == 1 && b[i] == 0) countA++; if (a[i] == b[i]) countB++; if (a[i] < b[i]) countC++; } if (countA == 0) { countA = -1; } else { countA = (countC / countA) + 1; } printf( %d , countA); return 0; } |
#include <bits/stdc++.h> long long i, j, k, m, n; int main() { scanf( %lld , &n); if (n <= 1) puts( -1 ); else printf( %lld %lld %lld n , n, n + 1, n * (n + 1)); return 0; } |
#include <bits/stdc++.h> int search(int n, long long int a[n], long long int target) { int i; if (a[0] >= target) { printf( 1 %lld n , target); return 0; } int L = 0, R = n - 1; int M; while ((R - L) > 1) { if ((L + R) % 2 == 0) { M = (L + R) / 2; } else { M = (L + R - 1) / 2; } if (a[M] < target) { L = M; } else if (a[M] == target) { printf( %d %lld n , M + 1, target - a[M - 1]); return 0; } else { R = M; } } if (target == a[L]) { printf( %d %lld n , L + 1, target); return 0; } else if (target == a[R]) { printf( %d %lld n , R + 1, target - a[R - 1]); } else { printf( %d %lld n , L + 2, target - a[L]); } } int main() { int n, m, i; scanf( %d %d , &n, &m); long long int a[n]; long long int b[m]; long long int sum = 0; long long int tmp; for (i = 0; i < n; i++) { scanf( %lld , &tmp); a[i] = tmp + sum; sum = tmp + sum; } for (i = 0; i < m; i++) { scanf( %lld , &b[i]); } for (i = 0; i < m; i++) search(n, a, b[i]); } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { while (a && b) a > b ? a %= b : b %= a; return a + b; } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } int main() { int n; cin >> n; int i, j, sum = 0, in; int a[n]; for (i = 0; i < n; ++i) { cin >> a[i]; sum += a[i]; } int x = n / 2; int avg = sum / x; for (i = 0; i < n; i++) { if (a[i] == 0) continue; cout << i + 1 << ; for (j = i + 1; j < n; j++) { if (a[j] == 0) continue; if ((a[j] + a[i]) == avg) { cout << j + 1 << ; a[j] = 0; a[i] = 0; break; } } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void _print(long long t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(long double t) { cerr << t; } void _print(double t) { cerr << t; } void _print(unsigned long long t) { cerr << t; } template <class T, class V> void _print(pair<T, V> p); template <class T> void _print(vector<T> v); template <class T> void _print(set<T> v); template <class T, class V> void _print(map<T, V> v); template <class T> void _print(multiset<T> v); template <class T, class V> void _print(pair<T, V> p) { cerr << { ; _print(p.first); cerr << , ; _print(p.second); cerr << } ; } template <class T> void _print(vector<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(set<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(multiset<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T, class V> void _print(map<T, V> v) { cerr << [ ; for (auto i : v) { _print(i); cerr << ; } cerr << ] ; } const long long N = 1e6 + 5; void solve() { long long n; cin >> n; vector<vector<long long>> a; for (long long i = 0; i < n; i++) { long long x; cin >> x; vector<long long> temp(x); for (long long j = 0; j < x; j++) cin >> temp[j]; a.push_back(temp); } set<vector<long long>> vis; set<vector<long long>> banned; long long m; cin >> m; for (long long i = 0; i < m; i++) { vector<long long> temp(n); for (long long j = 0; j < n; j++) { cin >> temp[j]; temp[j]--; } banned.insert(temp); } set<pair<long long, vector<long long>>> st; long long s = 0; vector<long long> temp; for (long long i = 0; i < n; i++) { s += a[i][(long long)a[i].size() - 1]; temp.push_back((long long)a[i].size() - 1); } st.insert({s, temp}); vis.insert(temp); while (!st.empty()) { auto [val, vec] = *prev(st.end()); st.erase(prev(st.end())); if (banned.find(vec) == banned.end()) { for (auto i : vec) cout << i + 1 << ; return; } for (long long i = 0; i < n; i++) { if (vec[i] - 1 >= 0) { long long newval = val - a[i][vec[i]] + a[i][vec[i] - 1]; vector<long long> newvec = vec; newvec[i]--; if (vis.find(newvec) == vis.end()) { st.insert({newval, newvec}); vis.insert(newvec); } } } } } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; set<int> vec; for (int i = 0; i < n; i++) { int d; cin >> d; vec.insert(d); } cout << vec.size() << n ; } } |
#include <bits/stdc++.h> long long k; int _, n, a[200020]; int main() { for (scanf( %d , &_); _--;) { scanf( %d%lld , &n, &k); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < (k & 1) + 2; i++) for (int i = 0, d = *std::max_element(a, a + n); i < n; i++) a[i] = d - a[i]; for (int i = 0 * puts( ); i < n; i++) printf( %d , a[i]); } } |
#include <bits/stdc++.h> using namespace std; const long double PI = atan(1.0) * 4.0; const long long int MOD = 1e9 + 7; const long long int INF = 1e18; const long double EPS = 0.0000001; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; map<char, int> a; for (int i = 0; i < n; i++) a[s[i]]++; int j = 97; while (k != 0 && j <= 122) { for (int i = 0; i < n; i++) { if (s[i] == char(j)) { s[i] = * ; k--; if (k == 0) break; } } j++; } for (int i = 0; i < n; i++) { if (s[i] != * ) cout << s[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct abc { int val, key, s, e, ind; } z[100005]; bool cmp(abc a, abc b) { if (a.key == b.key) return a.val < b.val; return a.key > b.key; } bool cmp1(abc a, abc b) { return a.ind < b.ind; } int main() { int n, m, i, j, k, a[100005], l; scanf( %d , &n); scanf( %d , &m); for (i = 0; i < m; i++) { scanf( %d , &z[i].val); scanf( %d , &z[i].key); z[i].ind = i; } sort(z, z + m, cmp); for (i = 0; i < n - 1; i++) { z[i].s = i + 1; z[i].e = i + 2; } l = 1; j = 1; k = 3; for (i = n - 1; i < m; i++) { if (z[i].val >= z[k - 2].val) { z[i].s = j; z[i].e = k; j++; if (j == k - 1) { j = 1; k++; } } else { l = 0; break; } } if (l == 0) printf( -1 n ); else { sort(z, z + m, cmp1); for (i = 0; i < m; i++) printf( %d %d n , z[i].s, z[i].e); } return 0; } |
#include<bits/stdc++.h> using namespace std; int a[505],ch[505][505],cnt[505]; int main(){ ios_base::sync_with_stdio(0),cin.tie(0); int n,c=0,i,j; cin>>n; for(i=1;i<=n;i++)cin>>a[i],ch[i][i]=a[i],cnt[a[i]]=a[i]-1; for(i=1;i<=n&&c==0;i++){ int x,y; x=y=i; while(cnt[a[i]]>0){ cnt[a[i]]--; if(x-1>0&&ch[y][x-1]==0)x--,ch[y][x]=a[i]; else if(y+1<=n&&ch[y+1][x]==0)y++,ch[y][x]=a[i]; else {c=1;break;} } } if(c)cout<< -1 n ; else{ for(i=1;i<=n;i++){ for(j=1;j<=i;j++)cout<<ch[i][j]<< ; cout<<endl; } } return 0; } |
#include <bits/stdc++.h> #define int long long #define mp make_pair #define pb push_back #define ld long double #define pii pair<int,int> #define sz(x) (int)x.size() #define piii pair<pii,pii> #define precise cout<<fixed<<setprecision(10) #define st first #define nd second #define ins insert #define vi vector<int> #define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std; const int MAX=5005; pii p[MAX]; bool O[MAX]; int dist(pii a,pii b){ return (a.st-b.st)*(a.st-b.st)+(a.nd-b.nd)*(a.nd-b.nd); } int32_t main(){ BOOST; int n; cin>>n; for (int i=1;i<=n;i++){ cin>>p[i].st>>p[i].nd; } vi ans; ans.clear(); ans.pb(1); O[1]=true; while (sz(ans)<n){ int x=ans.back(); int maxi=0,wsk=-1; for (int i=1;i<=n;i++){ if (!O[i] && dist(p[x],p[i])>maxi){ maxi=dist(p[x],p[i]); wsk=i; } } assert(wsk!=-1); O[wsk]=true; ans.pb(wsk); } for (auto it:ans)cout<<it<< ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 2e5 + 9, lg = 19, MOD = 998244353, maxV = 1e3 + 9; int T[3][maxN], n, q, arr[maxN], mp[129]; priority_queue<int> pqs[2][3]; string st; int query(int w, int *T) { int ret = 0; for (w++; w > 0; w -= w & -w) ret += T[w]; return ret; } int query(int l, int r, int *T) { return query(r - 1, T) - query(l - 1, T); } void update(int w, int x, int *T) { for (w++; w <= n; w += w & -w) T[w] += x; } pair<int, int> getpa(int heroe, int mamon, priority_queue<int> *pqs) { if (pqs[mamon].empty()) return pair<int, int>(n, n); if (pqs[heroe].empty()) return pair<int, int>(0, pqs[mamon].top()); return pair<int, int>(min(pqs[mamon].top(), pqs[heroe].top()), pqs[mamon].top()); } pair<int, int> gira(pair<int, int> x) { return pair<int, int>(n - x.second, n - x.first); } int mergpl(pair<int, int> one, pair<int, int> two, int *lT) { if (one > two) swap(one, two); if (two.first < one.second) return query(one.first, max(one.second, two.second), lT); return query(one.first, one.second, lT) + query(two.first, two.second, lT); } int countGood() { int ret = 0; for (int u = 0, offs = 0, mu = 1; u < 2; u++, offs = n - 1, mu = -1) for (int i = 0; i < 3; i++) while (pqs[u][i].size() && arr[offs + mu * pqs[u][i].top()] != i) pqs[u][i].pop(); for (int i = 0; i < 3; i++) { int heroe = (i + 1) % 3, mamon = (i + 2) % 3; ret += query(n - 1, T[i]) - mergpl(getpa(heroe, mamon, pqs[0]), gira(getpa(heroe, mamon, pqs[1])), T[i]); } return ret; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); mp[ R ] = 1; mp[ S ] = 2; cin >> n >> q >> st; for (int i = 0; i < n; i++) { arr[i] = mp[st[i]]; pqs[0][arr[i]].push(i); pqs[1][arr[i]].push(n - 1 - i); update(i, 1, T[arr[i]]); } cout << countGood() << n ; while (q--) { int pos; char c; cin >> pos >> c; pos--; update(pos, -1, T[arr[pos]]); arr[pos] = mp[c]; update(pos, 1, T[arr[pos]]); pqs[0][arr[pos]].push(pos); pqs[1][arr[pos]].push(n - 1 - pos); cout << countGood() << n ; } } |
#include <bits/stdc++.h> using namespace std; const int NN = 1010; double first[NN], second[NN]; int main() { int n, a, b, c, d; cin >> n; for (int i = 0; i < n; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); double s = a * a * d * d + c * c * b * b; first[i] = a * b * d * d / s; second[i] = c * b * b * d / s; } const double eps = 1e-9; vector<pair<pair<double, double>, double> > line(n * (n - 1) / 2); for (int i = 0, id = 0; i < n; i++) for (int j = i + 1; j < n; j++, id++) { line[id] = make_pair(make_pair(first[i] + first[j], second[i] + second[j]), fabs(first[i] - first[j]) < eps ? 1e9 : (second[i] - second[j]) / (first[i] - first[j])); } sort(line.begin(), line.end(), [&](const pair<pair<double, double>, double> &a, const pair<pair<double, double>, double> &b) { if (fabs(a.first.first - b.first.first) > eps) return a.first.first < b.first.first; if (fabs(a.first.second - b.first.second) > eps) return a.first.second < b.first.second; return a.second < b.second - eps; }); auto cmp1 = [&](double first, double second) { return fabs(first - second) < eps; }; auto cmp = [&](pair<double, double> first, pair<double, double> second) { return cmp1(first.first, second.first) && cmp1(first.second, second.second); }; int ans = 0; const int mod = 1000000007; for (int i = 0, j, k; i < line.size(); i = j) { int mid = 1; for (j = i; j < line.size() && cmp(line[i].first, line[j].first); j = k) { for (k = j; k < line.size() && cmp(line[k].first, line[j].first) && cmp1(line[j].second, line[k].second); k++) ; mid = (long long)mid * (k - j + 1) % mod; } mid = (mid + mod - 1 - j + i) % mod; ans += mid; if (ans >= mod) ans -= mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { set<pair<pair<long long, long long>, pair<long long, long long> > > rem; long long xi = 0, yi = 0, xf = 0, yf = 0; string s; cin >> s; long long ans = 0; for (long long i = 0; i < (long long)(s.length()); ++i) { if (s[i] == N ) { yf++; } else if (s[i] == S ) { yf--; } else if (s[i] == E ) { xf++; } else { xf--; } if (rem.count({{xi, yi}, {xf, yf}})) { ans += 1; } else { ans += 5; rem.insert({{xi, yi}, {xf, yf}}); rem.insert({{xf, yf}, {xi, yi}}); } xi = xf; yi = yf; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e5 + 7; long long n; pair<long double, long double> a[MAXN]; void read() { cin >> n; for (long long i = 0; i < n; ++i) { cin >> a[i].first >> a[i].second; } bool ch1 = 0, ch2 = 0; for (long long i = 0; i < n; ++i) { if (a[i].second < 0) ch1 = 1; else ch2 = 1; } if (ch1 && ch2) { cout << -1 n ; exit(0); } } const long double INF = 1e16; const long long IT = 100; bool check(long double r) { long double tl = -INF, tr = INF; for (long long i = 0; i < n; ++i) { if (abs(a[i].second - r) > r) return 0; long double d = sqrtl(r * r - (a[i].second - r) * (a[i].second - r)); tl = max(tl, a[i].first - d); tr = min(tr, a[i].first + d); } return tl <= tr; } long double ans = INF; void solve() { for (long long i = 0; i < n; ++i) a[i].second = abs(a[i].second); long double l = 0; long double r = INF; for (long long i = 0; i < IT; ++i) { long double m = (l + r) / 2; if (check(m)) r = m; else l = m; } ans = r; } void print() { cout << ans << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.precision(20); read(); solve(); print(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); if (n % 2 == 1) { ans = a[(n - 1) / 2]; } if (n % 2 == 0) { ans = a[(n / 2) - 1]; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 1e6 + 5; int n, k, top; int a[N], l[N], r[N], s[N]; long long ans; long long calc(int l, int r) { if (l > r || r - l + 1 < k) return 0; int m = (r - l + 2 - k) / (k - 1); long long ret = 1LL * (m + 1) * (r - l + 2 - k) % mod - 1LL * (1 + m) * m / 2 % mod * (k - 1) % mod; return ret; } int main() { int i; scanf( %d%d , &n, &k); for (i = 1; i <= n; ++i) scanf( %d , &a[i]); for (i = 1; i <= n; ++i) { while (top && a[s[top]] < a[i]) --top; l[i] = s[top] + 1, s[++top] = i; } top = 0, s[top] = n + 1; for (i = n; i; --i) { while (top && a[s[top]] <= a[i]) --top; r[i] = s[top] - 1, s[++top] = i; } for (i = 1; i <= n; ++i) ans = (ans + (calc(l[i], r[i]) - calc(l[i], i - 1) - calc(i + 1, r[i])) * a[i]) % mod; if (ans < 0) ans += mod; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int m, n; int a[11][11] = {{0, 1, 2}, {1, 0, 2}, {1, 2, 0}, {2, 1, 0}, {2, 0, 1}, {0, 2, 1}, {0, 1, 2}}; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m; cout << a[n % 6][m] << endl; return 0; } |
#include <bits/stdc++.h> int64_t k; int a, b; int result[9]; int ascore[9] = {0, 0, 1, 1, 0, 0, 0, 1, 0}; int bscore[9] = {0, 1, 0, 0, 0, 1, 1, 0, 0}; int stack[10]; int64_t atotalscore, btotalscore; int cyclestart, cycleend, cyclelength; int acyclescore, bcyclescore; int64_t cycletime, cycleremain; int main() { int i, j, t; scanf( %I64d%d%d , &k, &a, &b); stack[0] = 3 * (a - 1) + (b - 1); for (i = 0; i < 9; i++) { scanf( %d , &t); result[i] = 3 * (t - 1); } for (i = 0; i < 9; i++) { scanf( %d , &t); result[i] += (t - 1); } for (i = 1; i < k; i++) { stack[i] = result[stack[i - 1]]; for (j = 0; j < i; j++) { if (stack[i] == stack[j]) { cyclestart = j; cycleend = i - 1; cyclelength = i - j; break; } } if (cyclelength != 0) break; } if (cyclelength == 0) { for (i = 0; i < k; i++) { atotalscore += ascore[stack[i]]; btotalscore += bscore[stack[i]]; } printf( %I64d %I64d n , atotalscore, btotalscore); return 0; } for (i = 0; i < cyclestart; i++) { atotalscore += ascore[stack[i]]; btotalscore += bscore[stack[i]]; } for (i = cyclestart; i <= cycleend; i++) { acyclescore += ascore[stack[i]]; bcyclescore += bscore[stack[i]]; } cycletime = (k - cyclestart) / cyclelength; cycleremain = (k - cyclestart) % cyclelength; atotalscore += acyclescore * cycletime; btotalscore += bcyclescore * cycletime; for (i = cyclestart; i < cyclestart + cycleremain; i++) { atotalscore += ascore[stack[i]]; btotalscore += bscore[stack[i]]; } printf( %I64d %I64d n , atotalscore, btotalscore); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x[100005], y[100005]; bool sign(int t) { return (t > 0); } bool check(long double r) { vector<pair<long double, long double> > v; for (int i = 0; i < n; i++) { long double t = (2.0 * r - y[i]) * y[i]; if (t < 0) return 0; long double l = sqrt(t); v.push_back({-l + x[i], l + x[i]}); } long double mn = 1e18, mx = -1e18; for (auto p : v) { mn = min(mn, p.second); mx = max(mx, p.first); } return (mx <= mn); } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , &x[i], &y[i]); if (sign(y[i]) != sign(y[0])) { printf( -1 ); return 0; } } for (int i = 0; i < n; i++) y[i] = abs(y[i]); long double st = 0.0, en = 1e14; for (int _ = 0; _ < 100; _++) { long double mid = (st + en) / 2; if (check(mid)) en = mid; else st = mid; } printf( %.9Lf , st); } |
#include <bits/stdc++.h> using namespace std; const int N = 5005; const int M = 1005; const int K = 15; int n, m; char name[N][K], oper[N][K], val[N][M]; bool isV[N]; int idx1[N], idx2[N]; map<string, int> mp; char ansmx[M], ansmn[M]; int res[N]; int work(int a, int b, char op[]) { if (op[0] == A ) return a & b; if (op[0] == O ) return a | b; return a ^ b; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , name[i]); mp[name[i]] = i; char buf[M]; scanf( %s , buf); scanf( %s , buf); if (buf[0] >= 0 && buf[0] <= 9 ) { memcpy(val[i], buf, sizeof(buf)); isV[i] = 0; } else { isV[i] = 1; idx1[i] = buf[0] == ? ? -1 : mp[buf]; scanf( %s , oper[i]); scanf( %s , buf); idx2[i] = buf[0] == ? ? -1 : mp[buf]; } } for (int i = 0; i < m; i++) { int ans[2] = {0, 0}; for (int j = 0; j < 2; j++) { for (int k = 0; k < n; k++) { if (!isV[k]) res[k] = (val[k][i] - 0 ); else { int op1 = idx1[k] == -1 ? j : res[idx1[k]]; int op2 = idx2[k] == -1 ? j : res[idx2[k]]; res[k] = work(op1, op2, oper[k]); } ans[j] += res[k]; } } if (ans[0] == ans[1]) ansmx[i] = ansmn[i] = 0 ; else { ansmx[i] = ans[0] > ans[1] ? 0 : 1 ; ansmn[i] = ans[0] < ans[1] ? 0 : 1 ; } } printf( %s n%s n , ansmn, ansmx); return 0; } |
#include <bits/stdc++.h> using namespace std; const int64_t INF = 1e18 + 10; const int N = 2e7 + 10; int MOD = 1000000007; int g[26], in[26], used[26]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (int i = 0; i < 26; i++) g[i] = -1; int n; cin >> n; vector<string> a(n, ); bool arr = 1; for (int i = 0; i < n; i++) { string s; cin >> s; for (auto j : s) used[j - a ] = 1; for (int j = 1; j < s.size(); j++) { int u = s[j - 1] - a ; if (g[u] != -1 && g[u] != s[j] - a || s[j] == s[j - 1]) arr = 0; g[s[j - 1] - a ] = s[j] - a ; in[s[j] - a ]++; } } if (!arr) { cout << NO ; return 0; } string ans = ; for (int i = 0; i < 26; i++) { if (in[i] == 0 && used[i]) { int x = i; while (x != -1) { used[x]--; if (used[x] < 0) break; ans += a + x; x = g[x]; } } } for (int i = 0; i < 26; i++) { if (used[i] != 0) arr = 0; } if (arr) cout << ans; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; using vl = vector<long long>; using vpl = vector<pair<long long, long long>>; using vs = vector<string>; using pl = pair<long long, long long>; using ll = long long int; using vb = vector<bool>; void printcase(ll x) { cout << Case # << x << : ; } void read(vector<ll> &v, ll &n) { for (ll i = 0; i < n; ++i) cin >> v[i]; } void read(ll a[], ll &n) { for (ll i = 0; i < n; ++i) cin >> a[i]; } void print() { cout << endl; } void write(vector<ll> &v, ll &n) { for (ll i = 0; i < n; ++i) cout << v[i] << ; cout << endl; } void write(vector<ll> &v) { ll n = v.size(); for (ll i = 0; i < n; ++i) cout << v[i] << ; cout << endl; } void write(ll a[], ll &n) { for (ll i = 0; i < n; ++i) cout << a[i] << ; cout << endl; } bool sorted(vl &v) { ll n = v.size(); for (int i = 0; i < n - 1; i++) { if (v[i] > v[i + 1]) return 0; } return 1; } bool solve() { ll n; cin >> n; vl v(n); read(v, n); if (n <= 2) return 1; vl suff(n), suffind(n), preind(n); suff[n - 1] = v[n - 1]; suffind[n - 1] = n - 1; preind[0] = 0; for (int i = 1; i < n; i++) { if (v[i] == v[i - 1]) preind[i] = preind[i - 1]; else preind[i] = i; } for (int i = n - 2; i >= 0; i--) { if (v[i] < suff[i + 1]) suffind[i] = i; else suffind[i] = suffind[i + 1]; suff[i] = min(v[i], suff[i + 1]); } for (int i = 0; i < n - 1; i++) { if (v[i] > v[i + 1]) { swap(v[preind[i]], v[suffind[i + 1]]); if (sorted(v)) return 1; else return 0; } } return 1; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; if (solve()) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct plan { bool used; int type; int single; int start; int end; long long cost; }; void getInput(vector<plan> &plans, vector<vector<int> > &outs, vector<forward_list<int> > &segtree); void addPlan(vector<forward_list<int> > &segtree, int st_ind, int cs, int ce, int ds, int de, int pi); void getMinCosts(vector<long long> &min_costs, int source, vector<vector<int> > &outs, vector<forward_list<int> > &segtree, vector<plan> &plans); void processNode(int n, vector<bool> &visited, set<int> &unvisited, priority_queue<pair<long long, int> > &to_visit, vector<vector<int> > &outs, vector<forward_list<int> > &segtree, vector<plan> &plans, long long cur_cost, vector<long long> &min_costs); int main() { int num_planets, num_plans, source; cin >> num_planets >> num_plans >> source; source--; vector<long long> min_costs(num_planets, LLONG_MAX); min_costs[source] = 0; vector<vector<int> > outs(num_planets); vector<forward_list<int> > segtree(2 * pow(2, ceil(log(num_planets) / log(2)))); vector<plan> plans(num_plans); getInput(plans, outs, segtree); getMinCosts(min_costs, source, outs, segtree, plans); for (int i = 0; i < min_costs.size(); i++) cout << ((min_costs[i] < LLONG_MAX) ? min_costs[i] : -1) << ; cout << n ; return 0; } void getInput(vector<plan> &plans, vector<vector<int> > &outs, vector<forward_list<int> > &segtree) { for (int pi = 0; pi < plans.size(); pi++) { plans[pi].used = false; cin >> plans[pi].type >> plans[pi].single >> plans[pi].start; plans[pi].type -= 2; if (plans[pi].type >= 0) cin >> plans[pi].end; else { plans[pi].end = plans[pi].start; plans[pi].type = 0; } plans[pi].single--; plans[pi].start--; plans[pi].end--; cin >> plans[pi].cost; if (plans[pi].type == 0) outs[plans[pi].single].push_back(pi); else addPlan(segtree, 1, 0, segtree.size() / 2 - 1, plans[pi].start, plans[pi].end, pi); } } void addPlan(vector<forward_list<int> > &segtree, int st_ind, int cs, int ce, int ds, int de, int pi) { if (cs > de || ce < ds) return; else if (cs >= ds && ce <= de) segtree[st_ind].push_front(pi); else { int cm = (cs + ce) / 2; addPlan(segtree, 2 * st_ind, cs, cm, ds, de, pi); addPlan(segtree, 2 * st_ind + 1, cm + 1, ce, ds, de, pi); } } void getMinCosts(vector<long long> &min_costs, int source, vector<vector<int> > &outs, vector<forward_list<int> > &segtree, vector<plan> &plans) { vector<bool> visited(min_costs.size(), false); set<int> unvisited; for (int i = 0; i < min_costs.size(); i++) unvisited.insert(i); priority_queue<pair<long long, int> > to_visit; processNode(source, visited, unvisited, to_visit, outs, segtree, plans, 0, min_costs); while (to_visit.size() > 0) { int cur_pi = to_visit.top().second; long long cur_cost = -to_visit.top().first; to_visit.pop(); if (plans[cur_pi].type == 0) { set<int>::iterator s_it = unvisited.lower_bound(plans[cur_pi].start); set<int>::iterator e_it = unvisited.upper_bound(plans[cur_pi].end); for (set<int>::iterator it = s_it; it != e_it;) { int n = *it; it++; processNode(n, visited, unvisited, to_visit, outs, segtree, plans, cur_cost, min_costs); } } else { if (!visited[plans[cur_pi].single]) processNode(plans[cur_pi].single, visited, unvisited, to_visit, outs, segtree, plans, cur_cost, min_costs); } } } void processNode(int n, vector<bool> &visited, set<int> &unvisited, priority_queue<pair<long long, int> > &to_visit, vector<vector<int> > &outs, vector<forward_list<int> > &segtree, vector<plan> &plans, long long cur_cost, vector<long long> &min_costs) { if (visited[n]) return; min_costs[n] = cur_cost; visited[n] = true; unvisited.erase(n); for (auto &out : outs[n]) to_visit.push(make_pair(-(cur_cost + plans[out].cost), out)); for (int st_ind = segtree.size() / 2 + n; st_ind > 0; st_ind /= 2) { for (auto &pi : segtree[st_ind]) if (!plans[pi].used) { plans[pi].used = true; to_visit.push(make_pair(-(cur_cost + plans[pi].cost), pi)); } segtree[st_ind].clear(); } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.