func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; void cmin(long long& x, long long y) { if (x > y) { x = y; } } int n, a[N]; long long f[N][2]; bool best[N][2]; vector<int> adj[N], answer; void dfs1(int u, int p) { long long min_diff = 0; bool go = false; for (auto v : adj[u]) { if (v != p) { go = true; dfs1(v, u); f[u][0] += f[v][0]; f[u][1] += f[v][0]; cmin(min_diff, f[v][1] - f[v][0]); } } f[u][1] += min_diff; if (!go) { f[u][0] = a[u]; } else { cmin(f[u][0], f[u][1] + a[u]); } } void dfs2(int u, int p) { if (f[u][0] == f[u][1] + a[u]) { best[u][1] |= best[u][0]; if (best[u][0]) { answer.push_back(u); } } long long sumf = 0; for (auto v : adj[u]) { if (v != p) { sumf += f[v][0]; } } vector<int> diff_nodes; for (auto v : adj[u]) { if (v != p) { if (sumf == f[u][0]) { best[v][0] |= best[u][0]; } if (sumf + f[v][1] - f[v][0] == f[u][1] && best[u][1]) { best[v][1] = true; diff_nodes.push_back(v); } else if (sumf + f[v][1] - f[v][0] + a[u] == f[u][0] && best[u][0]) { diff_nodes.push_back(v); } } } for (auto v : adj[u]) { if (v != p) { if (diff_nodes.size() > 1) { best[v][0] |= true; } else if (diff_nodes.size() == 1 && v != diff_nodes.back()) { best[v][0] |= true; } dfs2(v, u); } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } for (int i = 1; i < n; ++i) { int u, v; scanf( %d%d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } dfs1(1, 0); best[1][0] = true; dfs2(1, 0); printf( %lld %d n , f[1][0], answer.size()); sort(answer.begin(), answer.end()); for (auto v : answer) { printf( %d , v); } return puts( ), 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = (int)(1e9 + 1e6); const long long LINF = (long long)(4e18); const double EPS = 1e-9; const long long mod = 1e9 + 7; mt19937 ggen; void solve(); int main() { iostream::sync_with_stdio(false); cin.tie(0); ggen = mt19937(1337); solve(); } void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int x, f; cin >> x >> f; long long ans = 0; long long ft = x + f; for (int i = 0; i < n; ++i) { long long gh = static_cast<long long>(a[i]); long long mt = gh / ft; ans += mt * f; if (gh - mt * ft > x) { ans += f; } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int x, y; cin >> x >> y; int tx = x - y; int ty = x + y; x = tx; y = ty; if (x < 0) cout << -1 n ; else { int l = 1, r = 1e9 + 5; while (r - l > 1) { int mid = (l + r) / 2; if ((1LL * y * (mid - 1) + mid - 1) / mid <= x) l = mid; else r = mid; } long double ans = y; ans /= l; ans /= 2.0; cout << setprecision(19) << fixed << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int nxt() { int res; scanf( %d , &res); return res; } bool is_perm(int *p, int n) { char used[n]; memset(used, 0, sizeof(used)); for (int i = 0; i < n; ++i) { used[p[i]] = 1; } for (int i = 0; i < n; ++i) { if (!used[i]) { return false; } } return true; } void solve(int n) { int a[n]; for (int i = 0; i < n; ++i) { a[i] = i + 1; } do { int p[n]; p[0] = a[0] % n; for (int i = 1; i < n; ++i) { p[i] = p[i - 1] * a[i] % n; } if (is_perm(p, n)) { for (int i = 0; i < n; ++i) { cout << a[i] << ; } cout << endl; } } while (next_permutation(a, a + n - 1)); } void solveTest(int n) { cout << YES n ; if (n == 1) { cout << 1 n ; return; } if (n == 2) { cout << 1 n2 n ; return; } if (n == 3) { cout << 1 n2 n3 n ; return; } if (n == 4) { cout << 1 n3 n2 n4 n ; return; } } bool isprime(int n) { for (int i = 2; i * i <= n; ++i) { if (n % i == 0) { return false; } } return true; } long long powMod(long long a, int n, long long mod) { long long ret = 1; while (n) { if (n & 1) ret = ret * a % mod; n >>= 1; a = a * a % mod; } return ret; } void solve() { int n = nxt(); if (n <= 4) { solveTest(n); return; } if (!isprime(n)) { cout << NO n ; return; } int ans[n]; ans[0] = 1; ans[n - 1] = n; long long pw = 1; for (int i = 1; i + 1 < n; ++i) { ans[i] = (i + 1) * powMod(pw, n - 2, n) % n; pw = pw * ans[i] % n; } cout << YES n ; for (int i = 0; i < n; ++i) { cout << ans[i] << n ; } } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a, b, i, c = 0; a = 8 * n; b = 9 * n; c = b - a; cout << b << << a << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); std::string data; cin >> data; long long int counter = 0; char ch; for (int i = 0; i < data.length(); i++) { if (data[i] == 0 ) counter++; else counter = 0; } std::string to_join; while (counter != 0) { counter--; data = 0 + data; } int flag = 0; for (int i = 0; i < data.length() / 2; i++) { if (data[i] != data[data.length() - i - 1]) { flag = 1; break; } } if (flag) cout << NO ; else cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int f[20]; bool ischange[300000]; int main() { memset(ischange, 0, sizeof ischange); int n; scanf( %d , &n); string a; cin >> a; for (int i = 1; i <= 9; i++) { scanf( %d , &f[i]); } int ff = 0; for (int i = 0; i < a.length(); i++) { if (ff == 1) break; int now = a[i] - 0 ; int change = f[now]; if (change > now) { ff = 1; while (f[a[i] - 0 ] >= a[i] - 0 && i < a.length()) { ischange[i] = 1; i++; } } if (ff == 1) break; } for (int i = 0; i < a.length(); i++) { if (ischange[i]) cout << f[a[i] - 0 ]; else cout << a[i]; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void show(T *a, int n) { for (int i = 0; i < n; i++) cout << a[i] << ; puts( ); } template <class T> void queue_clear(T *a, int n) { for (int i = 0; i < n; i++) { while (!a->empty()) a->pop(); } } template <class T> void Bit_add(T *a, int x, int p, int MAX) { while (p < MAX) { a[p] += x; p += p & (-p); } } template <class T> T Bit_sum(T *a, int p) { T ret = 0; while (p) { ret += a[p]; p -= p & (-p); } return ret; } const int MAXN = 1007; int d[MAXN], s[MAXN]; int main() { int m, k; while (~scanf( %d%d , &m, &k)) { int i; for (i = 1; i <= m; i++) scanf( %d , d + i); for (i = 1; i <= m; i++) scanf( %d , s + i); int tank = s[1], mx = s[1]; int p = 1, ans = 0; while (p <= m) { if (tank < d[p]) { int t = ((d[p] - tank) + mx - 1) / mx; ans += t * k; tank += t * mx; } tank -= d[p]; ans += d[p]; p++; mx = max(mx, s[p]); tank += s[p]; } printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; int i = 0; cin >> s; int z = 0, o = 0; while (s[i] == 0 ) { i++; } for (; i < s.length(); i++) { if (s[i] == 0 ) { z++; } else { if (!o) { o = s.length() - i; } } } if (z >= 6 && o >= 7) { cout << Yes << n ; } else { cout << No << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 1; char a[N], b[N]; int f[N][N]; int res; int n, m; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (a[i] == b[j]) { f[i][j] = f[i - 1][j - 1] + 2; } f[i][j] = max(f[i][j], max(f[i - 1][j], f[i][j - 1]) - 1); res = max(res, f[i][j]); } } cout << res; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int dp[1501][1501], sum[1501], tsum[1501], pro, ex[2][100001], c[100001], P[1501]; int sp[1501], gp[1501], inv[1501]; int power(int a, int n) { if (n == 0) return 1; int res = power(a, n / 2); res = (int)((long long)res * (long long)res % mod); if (n % 2) res = (int)((long long)res * (long long)a % mod); return res; } int main() { int n, m, a, b, k, i, j, s, p, q, tmp; scanf( %d%d%d%d%d , &n, &m, &a, &b, &k); pro = (int)((long long)a * (long long)power(b, mod - 2) % mod); for (i = 0; i <= 100000; i++) { if (i == 0) { ex[0][i] = ex[1][i] = 1; c[i] = 1; } else { ex[1][i] = (int)((long long)ex[1][i - 1] * (long long)(1 - pro) % mod); if (ex[1][i] < 0) ex[1][i] += mod; ex[0][i] = (int)((long long)ex[0][i - 1] * (long long)pro % mod); c[i] = (int)((long long)c[i - 1] * (long long)(k - i + 1) % mod); c[i] = (int)((long long)c[i] * (long long)power(i, mod - 2) % mod); } } memset(P, 0, sizeof(P)); for (i = 0; i <= m; i++) { if (i <= k) { P[i] = (int)((long long)c[i] * (long long)ex[0][i] % mod); P[i] = (int)((long long)P[i] * (long long)ex[1][k - i] % mod); } sp[i] = P[i]; if (i) sp[i] = (sp[i - 1] + sp[i]) % mod; inv[i] = power(P[i], mod - 2); } memset(dp, 0, sizeof(dp)); dp[0][m] = 1; for (i = 0; i < n; i++) { for (j = 0; j <= m; j++) { sum[j] = (int)((long long)P[j] * (long long)dp[i][j] % mod); if (j) sum[j] = (sum[j - 1] + sum[j]) % mod; } for (j = 0; j < m; j++) { tsum[j] = (int)((long long)sp[m - 1 - j] * (long long)dp[i][m] % mod); tmp = (int)((long long)sp[m - 1 - j] * (long long)dp[i][j] % mod); tsum[j] = (tsum[j] - tmp + mod) % mod; tsum[j] = (tsum[j] - sum[m - 1 - j] + mod) % mod; tsum[j] = (int)((long long)tsum[j] * (long long)P[j] % mod); if (j) tsum[j] = (tsum[j - 1] + tsum[j]) % mod; } dp[i + 1][0] = 0; dp[i + 1][m] = tsum[m - 1]; for (j = 1; j < m; j++) { if (j == 0) dp[i + 1][m - j] = tsum[j - 1]; else dp[i + 1][m - j] = (dp[i + 1][m] - tsum[j - 1] + mod) % mod; } } printf( %d n , dp[n][m]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long INF; int n; long long v[100005]; int c[100005]; long long mx[100005]; pair<long long, int> st[2]; int q; long long a, b; void solve(long long a, long long b) { long long ans = 0; st[0].first = 0; st[0].second = -2; st[1].first = 0; st[1].second = -1; fill(mx, mx + n, -INF); for (int i = 0; i < n; i++) { int clr = c[i]; long long val = v[i]; long long w1, w2, w; int td = 1; if (st[td].second == clr) td--; w1 = st[td].first + v[i] * b; w2 = mx[clr] + v[i] * a; w = max(w1, w2); if (w > mx[clr]) { if (st[1].second == clr) { st[1].first = w; } else if (st[0].second == clr) { st[0].first = w; } else { if (w >= st[1].first) { st[0] = st[1]; st[1] = make_pair(w, clr); } else if (w > st[0].first) { st[0] = make_pair(w, clr); } } mx[clr] = w; if (st[0] > st[1]) swap(st[0], st[1]); } } for (int i = 0; i < n; i++) { ans = max(ans, mx[i]); } cout << ans << endl; } int main() { INF = 1.0e18; cin >> n >> q; for (int i = 0; i < n; i++) cin >> v[i]; for (int i = 0; i < n; i++) cin >> c[i], c[i]--; for (int i = 0; i < q; i++) cin >> a >> b, solve(a, b); return 0; }
|
#include <bits/stdc++.h> const int N = 500; using namespace std; int n, yh, yhuo = 0, huo = 0, yu, x = 0, y; char pd; int main() { y = 1023; x = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { cin >> pd >> yh; if (pd == & ) x &= yh, y &= yh; if (pd == | ) x |= yh, y |= yh; if (pd == ^ ) x ^= yh, y ^= yh; } huo = 0; yhuo = 0; for (int i = 0; i <= 9; i++) { int a = x & (1 << i), b = y & (1 << i); if (a && b == 0) yhuo |= (1 << i); if (a == 0 && b == 0) huo |= (1 << i), yhuo |= (1 << i); if (a && b) huo |= (1 << i); } printf( 2 n ); printf( | %d n^ %d n , huo, yhuo); return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { string ss, tt; cin >> ss >> tt; int l = ss.size(); vector<int> s(30); vector<int> t(30); for (int i = 0; i < l; i++) { s[ss[i] - a ]++; t[tt[i] - a ]++; } bool ok = false; for (int i = 0; i < s.size(); i++) { if (s[i] && t[i]) { ok = true; } } cout << (ok ? YES n : NO n ); return; } int main() { int q; cin >> q; while (q--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2000; int pre[maxn]; int countlen(int i) { int ans = 0, p; for (p = i; p != -2; p = pre[p]) ans++; return ans; } int main() { int i, n; cin >> n; for (i = 0; i < n; i++) cin >> pre[i], pre[i]--; int ans = 0; for (i = 0; i < n; i++) ans = max(ans, countlen(i)); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100004; long long int a[MAXN]; long long int k, n; vector<long long int> b(MAXN, 0); long long int f(double num) { long long int res = 0; for (int i = 0; i < n; i++) { if (num > a[i] + 0.25) { b[i] = 0; continue; } double tem = sqrt(12 * (a[i] - num) - 3); b[i] = (long long int)(tem / 6 + 0.5); if (b[i] > a[i]) b[i] = a[i]; res += b[i]; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; double mid; double lo = -3e18, hi = 1e9; for (int i = 0; i < 200; i++) { mid = (lo + hi) / 2; if (f(mid) >= k) lo = mid; else hi = mid; } long long int tot = 0; priority_queue<pair<long long int, int>, vector<pair<long long int, int> >, greater<pair<long long int, int> > > pq; priority_queue<pair<long long int, int> > pq1; for (int i = 0; i < n; i++) { double tem = sqrt(12 * (a[i] - lo) - 3); b[i] = min((long long int)(tem / 6 + 0.5), a[i]); tot += b[i]; if (b[i]) pq.push({a[i] - 3 * b[i] * b[i] + 3 * b[i] - 1, i}); if (b[i] != a[i]) pq1.push({a[i] - 3 * b[i] * b[i] - 3 * b[i] - 1, i}); } while (tot - k > 0) { pair<long long int, int> tem = pq.top(); pq.pop(); int i = tem.second; b[i]--; tem.first = a[i] - 3 * b[i] * b[i] + 3 * b[i] - 1; pq.push(tem); tot--; } for (int i = 0; i < n; i++) { int bu = b[i]; printf( %d , bu); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int bl = 400, sz = 4e5 + 10; int pr[sz], bor[sz][26], cnt[sz], an[sz], q = 1; char prsy[sz]; vector<pair<int, int> > sp[sz]; vector<int> sv[sz]; void dfs(int v) { int u = v, s = 0; for (int a = 0; (a < bl and u != 0 and s != -1); a++) { s = bor[s][prsy[u] - a ]; if (s != -1) cnt[s]++; u = pr[u]; } for (int a = 0; a < sp[v].size(); a++) { int s = sp[v][a].first, nu = sp[v][a].second; an[nu] = cnt[s]; } for (int a = 0; a < sv[v].size(); a++) { dfs(sv[v][a]); } u = v, s = 0; for (int a = 0; (a < bl and u != 0 and s != -1); a++) { s = bor[s][prsy[u] - a ]; if (s != -1) cnt[s]--; u = pr[u]; } } int f(string &s, int le) { int n = s.size(), re = 0; int zf[n], l = 0, r = -1; zf[0] = 0; for (int a = 1; a < n; a++) { zf[a] = 0; if (r >= a) zf[a] = min(zf[a - l], r - a + 1); while (a + zf[a] < n) { if (s[zf[a]] == s[a + zf[a]]) zf[a]++; else break; } if (a + zf[a] - 1 > r) l = a, r = a + zf[a] - 1; if (zf[a] == le) re++; } return re; } int main() { int n; cin >> n; for (int a = 1; a <= n; a++) { int ty; scanf( %d , &ty); if (ty == 2) scanf( %d , &pr[a]); scanf( %s , prsy + a); sv[pr[a]].push_back(a); } int m; cin >> m; for (int a = 0; a < 26; a++) bor[0][a] = -1; for (int a = 0; a < m; a++) { int v; scanf( %d , &v); string st; cin >> st; reverse(st.begin(), st.end()); if (st.size() < bl) { int s = 0; for (int b = 0; b < st.size(); b++) { int ne = st[b] - a ; if (bor[s][ne] == -1) { bor[s][ne] = q++; for (int i = 0; i < 26; i++) bor[q - 1][i] = -1; } s = bor[s][ne]; } sp[v].push_back({s, a}); } else { int l = st.size(); st.push_back( # ); while (v) { st.push_back(prsy[v]), v = pr[v]; } an[a] = f(st, l); } } dfs(0); for (int a = 0; a < m; a++) printf( %d n , an[a]); }
|
#include <bits/stdc++.h> using namespace std; bool vis[101]; vector<int> a[101]; void dfs(int x) { vis[x] = true; for (int i = 0; i < a[x].size(); i++) if (!vis[a[x][i]]) dfs(a[x][i]); } int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } dfs(1); if (*min_element(vis + 1, vis + n + 1) && m == n) cout << FHTAGN! ; else cout << NO ; }
|
#include <bits/stdc++.h> const int MOD = 1000000007; const int Inv2 = 500000004; inline int mul(int x, int y) { return (long long)x * (long long)y % MOD; } inline int add(int x, int y) { int r = x + y; if (r >= MOD) r -= MOD; return r; } inline int qpow(int a, int p) { int x = a, ans = 1; while (p) { if (p & 1) ans = mul(ans, x); x = mul(x, x); p >>= 1; } return ans; } using namespace std; template <typename T> inline void read(T &x) { char ch; while ((ch = getchar()), (ch < 0 || ch > 9 )) ; x = ch - 0 ; while ((ch = getchar()), (ch >= 0 && ch <= 9 )) x = x * 10 + (ch - 0 ); } inline int readbin(int *str) { char ch; int len = 1; while ((ch = getchar()), (ch < 0 || ch > 1 )) ; *(str++) = ch - 0 ; while ((ch = getchar()), (ch >= 0 && ch <= 1 )) *(str++) = ch - 0 , len++; return len; } void fwt(int A[], int n) { int i, h, k, A0, A1; for (h = 2; h <= n; h <<= 1) { for (i = 0; i < n; i += h) { for (k = i; k < i + (h / 2); k++) { A0 = A[k]; A1 = A[k + (h / 2)]; A[k] = (A0 + A1) % MOD; A[k + (h / 2)] = (A0 - A1) % MOD; } } } } void ifwt(int A[], int n) { int i, h, k, A0, A1; for (h = 2; h <= n; h <<= 1) { for (i = 0; i < n; i += h) { for (k = i; k < i + (h / 2); k++) { A0 = A[k]; A1 = A[k + (h / 2)]; A[k] = mul(Inv2, A0 + A1); A[k + (h / 2)] = mul(Inv2, A0 - A1); } } } } const int MAXN = 5 + (1 << 20); int A[MAXN], P[MAXN]; int N, NB; int main() { int i; read(NB); N = readbin(A); fwt(A, N); for (i = 0; i < N; i++) P[i] = mul(A[i], A[i]); ifwt(P, N); int Ans = 0; for (i = 0; i < N; i++) Ans = add(Ans, mul(P[i], 1 << (NB - __builtin_popcount(i)))); Ans = mul(Ans, 3); printf( %d , Ans); }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t, n, m, i, j, k, sum = 0; long long int p, w, d; cin >> n >> p >> w >> d; long long int l = 0; long long int r = n; for (i = 0; i <= w; i++) { long long int temp = p - i * d; if (temp < 0) break; if ((temp) % w != 0) continue; long long int q = temp / w; if (i + q <= n) { cout << q << << i << << n - q - i << n ; return 0; } } cout << -1 << n ; return 0; }
|
#include <bits/stdc++.h> int main() { int q; int a[510][2]; int m = 0; int l1, r1, l2, r2; int flag; scanf( %d , &q); for (int i = 0; i < q; i++) { scanf( %d%d%d%d , &l1, &r1, &l2, &r2); flag = 0; for (int j = l1; j <= r1; j++) { a[m][0] = j; for (int k = l2; k <= r2; k++) { if (j != k) { flag = 1; a[m][1] = k; break; } } if (flag == 1) { m++; break; } } } for (int i = 0; i < q; i++) printf( %d %d n , a[i][0], a[i][1]); 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 + 4, mxk = 20; int n, q; int d[mxn], parent[mxn][mxk]; void add(int i, int p) { parent[i][0] = p; d[i] = d[p] + 1; for (int j = 0; j < mxk; j++) if (j) parent[i][j] = parent[parent[i][j - 1]][j - 1]; } int lca(int i, int j) { if (d[i] > d[j]) swap(i, j); int diff = d[j] - d[i]; for (int k = mxk - 1; k >= 0; k--) if (diff & (1 << k)) j = parent[j][k]; if (i == j) return i; for (int k = mxk - 1; k >= 0; k--) if (parent[i][k] != parent[j][k]) i = parent[i][k], j = parent[j][k]; return parent[i][0]; } int dist(int i, int j) { return d[i] + d[j] - 2 * d[lca(i, j)]; } void solve() { for (int j = 0; j < mxk; j++) parent[0][j] = 0; d[0] = 0; add(1, 0); add(2, 0); add(3, 0); scanf( %d , &q); n = 4; stringstream ss; int a = 1, b = 2; int best = dist(a, b); for (int _ = 0; _ < q; _++) { int x; scanf( %d , &x); x--; add(n++, x); add(n++, x); int d1 = dist(a, n - 1), d2 = dist(b, n - 1); if (max(d1, d2) > best) { best = max(d1, d2); if (d1 > d2) b = n - 1; else a = n - 1; } ss << best << endl; } cout << ss.str(); } 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); cin.tie(NULL); int t; cin >> t; while (t--) { int k; string s; cin >> k >> s; s += A ; vector<int> a; for (int i = 0; i < s.size(); i++) { if (s[i] == A ) a.push_back(i); } int ans = 0; for (int i = 0; i + 1 < a.size(); i++) { ans = max(ans, a[i + 1] - a[i] - 1); } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long x, k; long long qow(long long a, long long b) { long long ans = 1; a = a % mod; while (b) { if (b % 2 == 1) { ans = (ans * a) % mod; } a = (a * a) % mod; b /= 2; } return ans; } int main() { while (~scanf( %lld %lld , &x, &k)) { if (x == 0) { printf( 0 n ); continue; } x = x % mod; cout << (((2 * x - 1) * qow(2, k) + mod) % mod + 1 + mod) % mod << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; struct node { long long x, y; } s, t, dist[100005]; int dx[4] = {0, 0, -1, 1}; int dy[4] = {1, -1, 0, 0}; char wind[100005]; string mov = UDLR ; long long pos, l, r, mid; bool check(long long mid) { long long zq = mid / n, sy = mid % n; long long x = s.x + zq * dist[n].x + dist[sy].x; long long y = s.y + zq * dist[n].y + dist[sy].y; long long dis = abs(t.x - x) + abs(t.y - y); return dis <= mid; } int main() { cin >> s.x >> s.y >> t.x >> t.y; cin >> n >> wind; for (int i = 0; i < n; i++) { pos = -1; for (int j = 0; j < 4; j++) { if (wind[i] == mov[j]) pos = j; } dist[i + 1].x = dist[i].x + dx[pos]; dist[i + 1].y = dist[i].y + dy[pos]; } l = 0, r = 1e15; while (l <= r) { mid = (l + r) >> 1; if (check(mid)) { r = mid - 1; } else { l = mid + 1; } } if (l > 1e15) cout << -1 << endl; else cout << l << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } if (flag) x = -x; } int n, lenth, las = 1, root = 1, tot = 1; long long ans; int ch[1000010][26], fa[1000010], len[1000010], siz[1000010][15], l[1000010], r[1000010]; char s[1000010], str[1000010]; struct edge { int to, nxt; } e[1000010]; int head[1000010], edge_cnt; void add(int from, int to) { e[++edge_cnt] = (edge){to, head[from]}; head[from] = edge_cnt; } void insert(int c, int id) { int p = las, np = las = ++tot; len[np] = len[p] + 1, siz[np][id] = 1; while (p && !ch[p][c]) ch[p][c] = np, p = fa[p]; if (!p) fa[np] = root; else { int q = ch[p][c]; if (len[q] == len[p] + 1) fa[np] = q; else { int nq = ++tot; memcpy(ch[nq], ch[q], sizeof(ch[q])); len[nq] = len[p] + 1, fa[nq] = fa[q], fa[q] = fa[np] = nq; while (ch[p][c] == q) ch[p][c] = nq, p = fa[p]; } } } void dfs(int x) { for (int i = head[x]; i; i = e[i].nxt) { int y = e[i].to; dfs(y); for (int j = 0; j <= n; ++j) siz[x][j] += siz[y][j]; } } void calc(int x) { if (!siz[x][0]) return; for (int i = 1; i <= n; ++i) if (siz[x][i] < l[i] || siz[x][i] > r[i]) return; ans += len[x] - len[fa[x]]; } int main() { scanf( %s , str + 1), lenth = strlen(str + 1); for (int i = 1; i <= lenth; ++i) insert(str[i] - a , 0); read(n); for (int i = 1; i <= n; ++i) { las = 1, scanf( %s , s + 1), lenth = strlen(s + 1), read(l[i]), read(r[i]); for (int j = 1; j <= lenth; ++j) insert(s[j] - a , i); } for (int i = 2; i <= tot; ++i) add(fa[i], i); dfs(root); for (int i = 2; i <= tot; ++i) calc(i); printf( %lld , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 69; const long long Inf = 1e13; long long n, newa[maxn], ans[maxn], newb[maxn]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 2; i <= n; i += 2) cin >> ans[i]; for (long long i = 2; i <= n; i += 2) { long long found = 0; for (long long j = sqrt(ans[i]); j >= 1; j--) if (ans[i] % j == 0) { long long newj = ans[i] / j; if (!((j + newj) & 1)) { newa[i] = (newj + j) / 2; newb[i] = (newj - j) / 2; if (newb[i] <= newa[i - 2]) continue; found = 1; break; } } if (!found) return cout << No , 0; } for (long long i = 1; i <= n; i++) { if (i & 1) { ans[i] = (newb[i + 1] - newa[i - 1]) * (newb[i + 1] + newa[i - 1]); if (ans[i] > Inf) return cout << No , 0; } } cout << Yes << n ; for (long long i = 1; i <= n; i++) cout << ans[i] << ; }
|
#include <bits/stdc++.h> using namespace std; int la, lb; int a[2000000]; int b[2000000]; int bpos[1000001]; void deb(int* x, int xlow, int xhigh) { cout << [ ; for (int i = xlow; i < xhigh; i++) { cout << << x[i]; } cout << ] ; } int seen[1000001]; int solve() { fill(bpos, bpos + 1000001, -1); for (int i = 0; i < lb; i++) { bpos[b[i]] = i; } int res = 0; for (int i = la; i < la * 2; i++) { a[i] = a[i - la]; } int alow = -1; int ahigh = alow + la; int blow = -1; int last = -1; int len = 0; fill(seen, seen + 1000001, 0); int steps = 0; for (int i = 0; i < la; i++) { alow++; ahigh++; len = max(len - 1, 0); if (len == 0) { if (bpos[a[alow]] != -1) { blow = bpos[a[alow]]; } else { blow += lb - 1; if (blow >= lb) { blow -= lb; } } last = -1; } else { blow = bpos[a[alow]]; } while (len < la) { int y = bpos[a[alow + len]]; bool good = false; if ((y != -1) && (last != -1)) { if (y < blow) { if (last < blow) { good = (y > last); } else { good = (y > last - lb); } } else { if (last >= blow) { good = (y > last); } else { good = (y - lb > last); } } } else if (y != -1) { good = true; } if (good) { seen[a[alow + len]]++; assert(seen[a[alow + len]] <= 2); last = y; steps++; assert(steps < 4000000); len++; } else { break; } } res = std::max(res, len); } return res; } inline void init() {} int main() { init(); ios_base::sync_with_stdio(0); bool prev = false; while (cin >> la >> lb) { if (prev) { cout << endl; } prev = true; for (int i = 0; i < la; i++) { cin >> a[i]; } for (int i = 0; i < lb; i++) { cin >> b[i]; } cout << solve() << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct data { string name; int score; data() {} data(string name, int score) : name(name), score(score) {} const bool operator<(const data& other) const { if (score != other.score) return score > other.score; return name < other.name; } const bool operator==(const data& other) const { return name == other.name; } }; data vasya; int n, m, b[100005]; int best(vector<data> v) { sort(b, b + m); reverse(b, b + m); v.erase(find(v.begin(), v.end(), vasya)); sort(v.rbegin(), v.rend()); v.insert(v.begin(), vasya); for (int i = 0; i < m; i++) v[i].score += b[i]; sort(v.begin(), v.end()); return find(v.begin(), v.end(), vasya) - v.begin() + 1; } int worst(vector<data> v) { multiset<int> S; multiset<int>::iterator it; int idx; for (int i = 0; i < m; i++) S.insert(b[i]); idx = find(v.begin(), v.end(), vasya) - v.begin(); if (m == n) v[idx].score += *S.begin(), S.erase(S.begin()); sort(v.begin(), v.end()); idx = find(v.begin(), v.end(), vasya) - v.begin(); for (int i = idx + 1; i < (int)v.size() && S.size(); i++) { int add; if (v[i].name < vasya.name) add = v[idx].score - v[i].score; else add = v[idx].score - v[i].score + 1; it = S.lower_bound(add); if (it == S.end()) continue; v[i].score += *it; S.erase(it); } sort(v.begin(), v.end()); return find(v.begin(), v.end(), vasya) - v.begin() + 1; } int main() { cin >> n; vector<data> v(n); for (int i = 0; i < n; i++) cin >> v[i].name >> v[i].score; cin >> m; for (int i = 0; i < m; i++) cin >> b[i]; cin >> vasya.name; vasya.score = v[find(v.begin(), v.end(), vasya) - v.begin()].score; int place1 = best(v); int place2 = worst(v); cout << place1 << << place2 << endl; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; vector<vector<vector<int> > > dp; vector<vector<int> > tmp; vector<vector<int> > base; int get_dig(int pos, int k) { return (pos < k) ? pos : (get_dig(pos / k, k) + pos % k) % k; } inline int get_val(const vector<vector<int> > &a, int i, int j, int shift, int k) { if (i == k && j < k) { return a[k][(j + k - shift) % k]; } return a[(i + k - shift) % k][(j + k - shift) % k]; } vector<vector<int> > shift(const vector<vector<int> > &a, int shift) { int k = int(a.size()) - 1; vector<vector<int> > res = a; for (int i = 0; i <= k; ++i) { for (int j = 0; j < k; ++j) { res[i][j] = get_val(a, i, j, shift, k); } } return res; } vector<vector<int> > operator*(const vector<vector<int> > &a, const vector<vector<int> > &b) { int n = int(a.size()), k = int(a[0].size()), m = int(b[0].size()); vector<vector<int> > res(n, vector<int>(m, 0)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { for (int l = 0; l < k; ++l) { res[i][j] = (res[i][j] + 1ll * a[i][l] * b[l][j]) % MOD; } } } return res; } int main() { long long n; int k; cin >> n >> k; int max_depth = 0; { long long tmp = n; while (tmp != 0) { ++max_depth; tmp /= k; } } dp.resize(max_depth); { dp[0].assign(k + 1, vector<int>(k + 1, 0)); for (int i = 0; i <= k; ++i) { for (int j = 0; j <= k; ++j) { dp[0][i][j] = (i == j || j == 0); } } vector<vector<int> > e(k + 1, vector<int>(k + 1, 0)); for (int i = 0; i <= k; ++i) { e[i][i] = 1; } for (int depth = 1; depth < max_depth; ++depth) { dp[depth] = e; vector<vector<int> > bs = dp[depth - 1]; vector<vector<int> > &res = dp[depth]; int curx = k; for (int i = 0; (1 << i) <= curx; ++i) { if (curx & (1 << i)) { res = bs * shift(res, (1 << i)); curx ^= (1 << i); } bs = bs * shift(bs, (1 << i)); } } } base.assign(1, vector<int>(k + 1, 0)); base[0][k] = 1; int sl = 0; long long x = n; vector<int> vec; while (x != 0) { vec.push_back(x % k); x /= k; } int len = int(vec.size()); for (int cur_depth = len - 1; cur_depth >= 0; --cur_depth) { int rest = vec[cur_depth]; for (int it = 0; it < rest; ++it, sl = (sl + 1) % k) { base = base * shift(dp[cur_depth], sl); } } { int res = 0; for (int i = 0; i <= k; ++i) { res = (res + base[0][i]) % MOD; } cout << res << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 10001; long long a[MAXN]; int f[MAXN]; long long c[MAXN], b[MAXN]; int n; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { long long X = a[i], cnt = 0; while (!(X & 1)) { ++cnt; X >>= 1; } b[i] = X; c[i] = cnt; } int ans = 0; for (int i = 0; i < n; ++i) { f[i] = 1; for (int j = 0; j < i; ++j) { if (a[j] % a[i] == 0 && a[i] % 2 == 1) f[i] = max(f[i], f[j] + 1); if (a[i] % 2 == 0) { long long t1 = b[j], t2 = b[i]; if (t1 % t2 == 0) { if (c[i] - c[j] == i - j || c[i] <= i - j - 1) f[i] = max(f[i], f[j] + 1); } } } if (f[i] > ans) ans = f[i]; } cout << n - ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int inf = (1 << 30) - 1, n, X, x, y, z, f[510][510], c[510], R, g[510][510], size[510], h[2][510], H[2][510][510], q[510], L[510]; int Lng[510]; double a[510][510]; vector<int> E[510]; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 || ch > 9 ); ch = getchar()) ; if (ch == - ) mark = -1, ch = getchar(); for (x = 0; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 48; x *= mark; } double Solve(int m, int n) { bool flag = 1; for (; flag;) { flag = 0; for (int i = 1; i <= n; i++) if (a[0][i] > 0) { double Min = inf; int l; for (int j = 1; j <= m; j++) if (a[j][i] < 0) { double tmp = -a[j][0] / a[j][i]; if (Min > tmp) Min = tmp, l = j; } if (Min == inf) continue; flag = 1; double tmp = -a[l][i]; a[l][i] = -1; for (int j = 0; j <= n; j++) a[l][j] /= tmp; for (int j = 0; j <= m; j++) if (a[j][i] && j != l) { for (int k = 0; k <= n; k++) if (k != i) a[j][k] += a[j][i] * a[l][k]; a[j][i] *= a[l][i]; } } } return a[0][0]; } void dfs(int u, int pre) { int cnt = 0; for (int i = 0; i < E[u].size(); i++) if (E[u][i] != pre) { dfs(E[u][i], u); ++cnt; Lng[u] = max(Lng[u], min(Lng[E[u][i]] + f[u][E[u][i]], inf)); } size[u] = 1; int A = 0; for (int j = 0; j <= R; j++) h[A][j] = inf; for (int Bg = 0; Bg <= cnt; Bg++) for (int j = 0; j <= R; j++) H[A][Bg][j] = inf; H[A][0][0] = inf - 1; h[A][1] = 0; cnt = 0; L[0] = -inf; for (int i = 0; i < E[u].size(); i++) if (E[u][i] != pre) { int v = E[u][i]; q[++cnt] = v; L[cnt] = min(inf, f[u][v] + Lng[v]); A ^= 1; for (int j = 0; j <= R; j++) h[A][j] = inf; for (int Bg = 0; Bg <= cnt; Bg++) for (int j = 0; j <= R; j++) H[A][Bg][j] = inf; for (int k = 0; k <= size[u] && k <= R; k++) for (int j = 0; j <= size[v] && j + k <= R; j++) { if (j == 0 && max(h[A ^ 1][k], Lng[v] + f[u][v]) <= X) h[A][j + k] = 0; if (j && g[v][j] != inf && max(h[A ^ 1][k], min(g[v][j], f[u][v])) <= X) h[A][j + k] = 0; } for (int Bg = 0; Bg < cnt; Bg++) for (int k = 0; k <= size[u] && k <= R; k++) if (H[A ^ 1][Bg][k] != inf) { for (int j = 1; j + k <= R && j <= size[v]; j++) if (g[v][j] <= X) H[A][Bg][j + k] = min(H[A][Bg][j + k], min(H[A ^ 1][Bg][k], g[v][j] + f[u][v])); if (L[cnt] > L[Bg]) H[A][cnt][k] = min(H[A][cnt][k], H[A ^ 1][Bg][k]); else H[A][Bg][k] = min(H[A][Bg][k], H[A ^ 1][Bg][k]); } size[u] += size[v]; } for (int j = 0; j <= R; j++) g[u][j] = h[A][j]; for (int Bg = 0; Bg <= cnt; Bg++) for (int j = 0; j <= R; j++) if (H[A][Bg][j] + L[Bg] <= X) g[u][j] = min(g[u][j], H[A][Bg][j]); } bool check() { for (int i = 1; i <= n; i++) for (int j = 0; j <= n; j++) g[i][j] = inf; dfs(1, 0); return (g[1][R] <= X); } int main() { read(n); read(X); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) f[i][j] = inf; f[i][i] = 0; read(c[i]); R += c[i]; } for (int i = 1; i < n; i++) { read(x); read(y); read(z); f[x][y] = f[y][x] = z; E[x].push_back(y); E[y].push_back(x); } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) if (i ^ k) for (int j = 1; j <= n; j++) if ((i ^ j) && (k ^ j)) f[i][j] = min(f[i][k] + f[k][j], f[i][j]); if (!check()) { printf( -1 n ); return 0; } a[0][n + 1] = -R; for (int i = 1; i <= n; i++) { a[0][i] = 1; a[i][n + 1] = 1; a[i][0] = c[i] ^ 1; for (int j = 1; j <= n; j++) a[i][j] = -(f[i][j] <= X); } printf( %.0lf n , Solve(n, n + 1)); return 0; }
|
#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while(t--){ int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; ++i){ cin >> a[i]; } sort(a.begin(), a.end()); long long ans = 0; for (int k = 1; k < n; ++k){ ans += a[k] * (2 * k + 1 - n); } ans -= a[n-1]; cout << -ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; struct line { int l, r; } p[510], q[510]; struct Point { long double x, y; } Q[10], tmp[10]; int vis[10]; long double A, B, C; int n, H, F, tot, cnt; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 || ch > 9 ); ch = getchar()) ; if (ch == - ) mark = -1, ch = getchar(); for (x = 0; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 48; x *= mark; } inline bool cmp(line a, line b) { if (a.l == b.l) return a.r > b.r; return a.l < b.l; } inline long double Get(long double x, long double y) { return A * x + B * y + C; } inline long double Abs(long double x) { if (x < 0) return -x; return x; } inline long double dis(Point X, long double A, long double B, long double C) { return Abs(X.x * A + X.y * B + C) / sqrt(A * A + B * B); } inline long double Getsum(long double x1, long double y1, long double x2, long double y2) { return x1 * y2 - x2 * y1; } Point Getp(Point X, Point Y, long double A, long double B, long double C) { long double d1 = dis(X, A, B, C), d2 = dis(Y, A, B, C); Point Ans; Ans.x = (d2 * X.x + d1 * Y.x) / (d1 + d2); Ans.y = (d2 * X.y + d1 * Y.y) / (d1 + d2); return Ans; } void solve() { int tot = 0; int s1 = 0, s2 = 0; for (int k = 1; k <= cnt; k++) { double t = Get(Q[k].x, Q[k].y); if (t == 0) vis[k] = -1, s2++; else if (t > 0) vis[k] = 1, s1++; else vis[k] = -1, s2++; } if (s1 == 0) { cnt = 0; return; } else if (s2 == 0) return; Q[cnt + 1] = Q[1]; vis[cnt + 1] = vis[1]; for (int i = 1; i <= cnt; i++) { if (vis[i] == 1) tmp[++tot] = Q[i]; if (vis[i] * vis[i + 1] < 0) { tmp[++tot] = Getp(Q[i], Q[i + 1], A, B, C); } } cnt = tot; for (int i = 1; i <= cnt; i++) Q[i] = tmp[i]; } int main() { read(n); read(H); read(F); for (int i = 1; i <= n; i++) read(p[i].l), read(p[i].r); sort(p + 1, p + n + 1, cmp); q[++tot] = p[1]; for (int i = 2; i <= n; i++) { if (p[i].l > q[tot].r) q[++tot] = p[i]; else q[tot].r = max(q[tot].r, p[i].r); } long double sum = 0; for (int i = 1; i <= tot; i++) { long double d = (long double)(F + H) / (F - H) * (q[i].r - q[i].l); sum += (d + q[i].r - q[i].l) * H * 2; } for (int i = 1; i <= tot; i++) { for (int j = 1; j <= tot; j++) { cnt = 4; Q[1].x = q[i].l; Q[1].y = -H; Q[2].x = q[i].r; Q[2].y = -H; Q[3].x = (long double)(F + H) / (F - H) * q[i].r; Q[3].y = H; Q[4].x = (long double)(F + H) / (F - H) * q[i].l; Q[4].y = H; A = H - F; B = -q[j].l; C = F * q[j].l; A = -A; B = -B; C = -C; solve(); if (cnt <= 2) continue; A = H - F; B = -q[j].r; C = F * q[j].r; solve(); if (cnt <= 2) continue; long double over = 0; for (int k = 2; k < cnt; k++) over += Getsum(Q[k].x - Q[1].x, Q[k].y - Q[1].y, Q[k + 1].x - Q[1].x, Q[k + 1].y - Q[1].y) / 2; sum -= over; } } printf( %.7lf n , (double)sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; int i, j, k, n, t, f[4], ans, a[2048], l1[2048], r2[2048]; int main() { scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %d , a + i); l1[i] = l1[i - 1] + (a[i] == 1); for (j = a[i]; ~j; --j) if (f[j] + 1 > f[a[i]]) f[a[i]] = f[j] + 1; } ans = f[1] > f[2] ? f[1] : f[2]; for (i = n; i; --i) r2[i] = r2[i + 1] + (a[i] == 2); for (i = 1; i <= n; ++i) { f[1] = f[2] = 0; for (k = i; k <= n; ++k) { for (j = a[k]; j < 4; ++j) if (f[j] + 1 > f[a[k]]) f[a[k]] = f[j] + 1; t = l1[i - 1] + r2[k + 1] + (f[1] > f[2] ? f[1] : f[2]); ans = ans < t ? t : ans; } } printf( %d , ans); }
|
#include <bits/stdc++.h> using namespace std; int n, m1, q; int m[102][102]; struct query { int t; int a; int b; int c; }; void rote(int type, int val) { if (type == 1) { int aux = m[val][m1]; for (int i = m1 - 1; i >= 1; i--) m[val][i + 1] = m[val][i]; m[val][1] = aux; } else { int aux = m[n][val]; for (int i = n - 1; i >= 1; i--) m[i + 1][val] = m[i][val]; m[1][val] = aux; } } int main() { cin >> n >> m1 >> q; stack<query> st; for (int i = 0; i < q; i++) { int in; cin >> in; if (in == 3) { int a, b, c; cin >> a >> b >> c; query qu; qu.t = in; qu.a = a; qu.b = b; qu.c = c; st.push(qu); } else { int a; cin >> a; query qu; qu.t = in; qu.a = a; st.push(qu); } } memset(m, 0, sizeof(m)); while (!st.empty()) { int type = st.top().t; if (type == 3) { int x, y, v; x = st.top().b; y = st.top().a; v = st.top().c; st.pop(); m[y][x] = v; } else { int a = st.top().a; st.pop(); rote(type, a); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m1; j++) cout << m[i][j] << ; cout << endl; } }
|
#include <bits/stdc++.h> const int maxn = 1005; int n, m; int a[maxn], b[maxn]; bool solve(double v) { for (int i = 0; i < n; i++) { if ((m + v) / a[i] <= v) v -= (m + v) / a[i]; else return false; if ((m + v) / b[i] <= v) v -= (m + v) / b[i]; else return false; } if (v >= 0) return true; return false; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } scanf( %d , &b[n - 1]); for (int i = 0; i < n - 1; i++) { scanf( %d , &b[i]); } double left = -1, right = 1e9 + 1; while (left + 0.000001 < right) { double mid = (left + right) / 2; if (solve(mid)) { right = mid; } else { left = mid; } } if (right > 1e9 + 0.00001) puts( -1 ); else printf( %f n , right); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct info { long long int val, in; }; long long int arr[100010]; info tree[100010 * 4], temp; void init(long long int node, long long int b, long long int e) { if (b == e) { tree[node].val = arr[b]; tree[node].in = b; return; } long long int Left = node * 2; long long int Right = node * 2 + 1; long long int mid = (b + e) / 2; init(Left, b, mid); init(Right, mid + 1, e); if (tree[Left].val >= tree[Right].val) { tree[node].val = tree[Right].val; tree[node].in = tree[Right].in; } else { tree[node].val = tree[Left].val; tree[node].in = tree[Left].in; } } info query(long long int node, long long int b, long long int e, long long int i, long long int j) { if (i > e || j < b) { temp.in = temp.val = 30; return temp; } if (b >= i && e <= j) return tree[node]; long long int Left = node * 2; long long int Right = node * 2 + 1; long long int mid = (b + e) / 2; info p1 = query(Left, b, mid, i, j); info p2 = query(Right, mid + 1, e, i, j); if (p1.val >= p2.val) return p2; else return p1; } int main() { long long int i, j, len, mn = 30, m, last = 1, in; long long int used = -1; string s; vector<char> v, ans; char mxx = a - 1; cin >> m >> s; len = s.length(); for (i = 0; i < s.length(); i++) { arr[i + 1] = s[i] - a + 1; } init(1, 1, len); for (i = 1; i <= len - m + 1; i++) { info ret = query(1, 1, len, i, i + m - 1); if (used == -1) { used = ret.in; i = ret.in; last = ret.val; v.push_back(last - 1 + a ); mxx = max(mxx, (char)(last - 1 + a )); } else { if (ret.val == last && used == ret.in) { } else { used = ret.in; i = ret.in; last = ret.val; v.push_back(last - 1 + a ); mxx = max(mxx, (char)(last - 1 + a )); } } } if (v.size() == 0) v.push_back(s[0]); sort(v.begin(), v.end()); long long int inx = v.size() - 1; long long int cnt = 0; for (i = 0; i < v.size(); i++) { if (v[i] == v[inx]) cnt++; } for (i = 0; i < s.length(); i++) { if (s[i] < v[inx]) ans.push_back(s[i]); } for (i = 1; i <= cnt; i++) { ans.push_back(v[inx]); } sort(ans.begin(), ans.end()); for (i = 0; i < ans.size(); i++) { cout << ans[i]; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 3; const int INF = 2000000000; inline long long ab(long long x) { return x < 0 ? -x : x; } long long a[MAXN]; int c_a[MAXN]; int l[MAXN], r[MAXN], x[MAXN], t[MAXN]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { a[i] = INF; } for (int q = 0; q < m; q++) { cin >> t[q] >> l[q] >> r[q] >> x[q]; --l[q], --r[q]; } for (int q = m - 1; q >= 0; q--) { if (t[q] == 1) { for (int i = l[q]; i <= r[q]; i++) { a[i] -= x[q]; } } else { bool found = false; for (int i = l[q]; i <= r[q]; i++) { if (a[i] >= x[q]) { a[i] = x[q]; found = true; } } if (!found) { cout << NO ; return 0; } } } for (int i = 0; i < n; i++) { if (a[i] < 0) { if (ab(a[i]) > INF / 2) a[i] = -INF / 2; } else { if (a[i] > INF / 2) a[i] = INF / 2; } } for (int i = 0; i < n; i++) { c_a[i] = a[i]; } for (int q = 0; q < m; q++) { if (t[q] == 1) { for (int i = l[q]; i <= r[q]; i++) { a[i] += x[q]; } } else { long long maxv = -INF; for (int i = l[q]; i <= r[q]; i++) { maxv = max(maxv, a[i]); } if (maxv != x[q]) { cout << NO ; return 0; } } } cout << YES n ; for (int i = 0; i < n; i++) { if (i > 0) cout << ; cout << c_a[i]; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long x, i, j, n = 0, t; cin >> x; while (x / 2 != 0) { if (x % 2 == 1) n++; x = x / 2; } cout << n + 1 << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 105; long long g[N][N], f[N][N], a[N], d; int n; pair<int, int> p[N]; void FloydWarshall() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) f[i][j] = g[i][j]; f[i][i] = 0; } for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { f[i][j] = min(f[i][j], f[i][k] + f[k][j]); } } } } int main() { scanf( %d%lld , &n, &d); for (int i = 2; i < n; i++) scanf( %lld , &a[i]); for (int i = 1; i <= n; i++) scanf( %d%d , &p[i].first, &p[i].second); for (int i = 2; i < n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; g[i][j] -= a[i]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; g[i][j] += 1ll * d * (abs(p[i].first - p[j].first) + abs(p[i].second - p[j].second)); } } FloydWarshall(); printf( %lld , f[1][n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t, s, a, b, c; cin >> t; for (int i = 0; i < t; i++) { cin >> s >> a >> b >> c; cout << s / c + ((s / c) / a) * b << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int lpd(int n) { int ans = -1; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { ans = i; while (n % i == 0) n /= i; } } if (n > 1) ans = n; return ans; } int x, p[1000006], pd, t, ans; int main() { ios::sync_with_stdio(false); cin.tie(0); p[0] = p[1] = 1; for (int i = 2; i * i <= 1e6; i++) { if (p[i] == 0) { for (int j = i * i; j <= 1e6; j += i) { p[j] = 1; } } } cin >> x; ans = 1e9; pd = lpd(x); t = x / pd; t -= 1; if (p[pd * t + 1] == 0 && (pd * t + 2 == x)) { cout << (x - 1) << n ; return 0; } for (int i = pd * t + 1; i < x; i++) { if (p[i] == 0) continue; pd = lpd(i); t = i / pd; t -= 1; ans = min(ans, pd * t + 1); } cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; long long int dp[4011][4011]; long long int b[2000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; long long int a[n]; set<long long int> st; for (int i = 0; i < n; i++) { cin >> a[i]; st.insert(a[i]); } long long int k = 0; for (auto u : st) { b[u] = k; k++; } for (int i = 0; i < n; i++) { a[i] = b[a[i]]; } for (int i = 0; i < n; i++) { long long int f = 0; for (int j = i - 1; j >= 0; j--) { if (a[i] == a[j]) { if (f == 1) continue; f = 1; dp[a[i]][a[j]]++; } else { dp[a[i]][a[j]] = max(dp[a[i]][a[j]], 1 + dp[a[j]][a[i]]); } } } long long int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) ans = max(ans, dp[i][j]); } cout << ans + 1; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a = 1, b, c = 0, d = 0, e = 0, f, i = 0, k = 0, j = 0, n = 0, t = 0, l = 0, m = 0, h[3000] = {0}; string s, x; cin >> t; n = 1000000; for (i = 0; i < t; i++) { cin >> b; j = max(j, min(b - 1, 1000000 - b)); } cout << j; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long cp1[102]; long long cp2[102]; long long dp[102][10002]; long long comb[102][102]; bool mark[102][10002]; long long Calculate_Pow(long long x, long long y) { long long val = 1; for (long long i = 1, t = x; i <= y; i <<= 1, t = (t * t) % 1000000007) if (y & i) val = (val * t) % 1000000007; return val; } void Calculate_Combination() { for (long long i = 0; i <= n; i++) comb[i][0] = 1; for (long long i = 1; i <= n; i++) for (long long j = 1; j <= i; j++) comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % 1000000007; } long long f(long long col, long long last) { if (last < 0) return 0; if (col == n && last) return 0; if (col == n) return 1; if (mark[col][last]) return dp[col][last]; mark[col][last] = true; if (col >= m % n) { for (long long i = 0; i <= n; i++) dp[col][last] = (dp[col][last] + cp1[i] * f(col + 1, last - i)) % 1000000007; } else { for (long long i = 0; i <= n; i++) dp[col][last] = (dp[col][last] + cp2[i] * f(col + 1, last - i)) % 1000000007; } return dp[col][last]; } int main() { scanf( %I64d%I64d%I64d , &n, &m, &k); Calculate_Combination(); for (long long i = 0; i <= n; i++) { cp1[i] = Calculate_Pow(comb[n][i], m / n); cp2[i] = Calculate_Pow(comb[n][i], m / n + 1); } printf( %I64d n , f(0, k)); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int mod = 1e9 + 7; vector<int> G[maxn]; char s[maxn]; int vis[maxn]; map<string, int> mp; long long a[maxn], n, L, R, t; void solve1() { L = 0, R = n; for (int i = 0; i <= n - 2; i++) { if (s[i] == < ) L++; else { for (int i = R - L; i <= R; i++) printf( %d , i); R = R - L - 1, L = 0; } } for (int i = R - L; i <= R && i >= 1; i++) printf( %d , i); printf( n ); } void solve2() { L = 0, R = 1; for (int i = 0; i <= n - 2; i++) { if (s[i] == > ) L++; else { for (int i = R + L; i >= R; i--) printf( %d , i); R = R + L + 1, L = 0; } } for (int i = R + L; i >= R && i <= n; i--) printf( %d , i); printf( n ); } int main() { cin >> t; while (t--) { scanf( %lld%s , &n, s); solve1(); solve2(); } }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int C = 26; void add(int &x, int y) { x += y; while (x >= MOD) x -= MOD; while (x < 0) x += MOD; } int fix(int x) { while (x >= MOD) x -= MOD; while (x < 0) x += MOD; return x; } int pw(int a, int b) { int ret = 1; while (b) { if (b & 1) ret = 1ll * ret * a % MOD; b >>= 1; a = 1ll * a * a % MOD; } return ret; } const int MAXN = 1e6 + 10; int a[MAXN], ans[MAXN], n, K, sz; vector<int> who[MAXN], vec[2][2]; void solve() { string s; cin >> s; n = s.size(); for (int i = 0; i < n; i++) a[i] = s[i] == L ; set<int> avail[2]; for (int i = 0; i < n; i++) { if (avail[a[i] ^ 1].empty()) { avail[a[i]].insert(K); who[K].push_back(i); K++; } else { int x = *avail[a[i] ^ 1].begin(); avail[a[i] ^ 1].erase(x); who[x].push_back(i); avail[a[i]].insert(x); } } for (int i = 0; i < K; i++) { vec[a[who[i][0]]][a[who[i].back()]].push_back(i); } int cur = vec[0][0].size() < vec[1][1].size(); int last = vec[0][0].size() > vec[1][1].size(); while ((int)max(vec[0][0].size(), vec[1][1].size()) > 1) { int i = vec[cur][cur].back(); vec[cur][cur].pop_back(); for (int x : who[i]) ans[sz++] = x; cur ^= 1; } up: if (vec[0][0].size() && vec[1][1].size()) { if (last) { for (int i : vec[1][1]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[0][1]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[0][0]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[1][0]) for (int x : who[i]) ans[sz++] = x; } else { for (int i : vec[0][0]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[1][0]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[1][1]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[0][1]) for (int x : who[i]) ans[sz++] = x; } } else { if (vec[0][0].size()) { for (int i : vec[0][1]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[0][0]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[1][0]) for (int x : who[i]) ans[sz++] = x; } else if (vec[1][1].size()) { for (int i : vec[1][0]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[1][1]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[0][1]) for (int x : who[i]) ans[sz++] = x; } else if (!!vec[0][1].size() ^ !!vec[1][0].size()) { for (int i : vec[1][0]) for (int x : who[i]) ans[sz++] = x; for (int i : vec[0][1]) for (int x : who[i]) ans[sz++] = x; } else { int i = vec[0][1].back(); vec[0][1].pop_back(); int j = vec[1][0].back(); for (int k = 1; k < (int)who[i].size(); k++) who[j].push_back(who[i][k]); while ((int)who[i].size() > 1) who[i].pop_back(); vec[0][0].push_back(i); goto up; } } cout << K - 1 << n ; for (int i = 0; i < n; i++) cout << ans[i] + 1 << ; cout << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int te = 1; for (int w = 1; w <= te; w++) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; vector<int> a[2002]; int b[2002]; vector<int> ans[4]; void Work() { int l; int maxT = 0; int specialNum = -1; for (int i = 0; i < n; i++) { cin >> l; a[l].push_back(i + 1); if (l > maxT) maxT = l; b[l]++; if (b[l] >= 3) specialNum = l; } int check = 0; for (int i = 0; i <= maxT; i++) { if (b[i] >= 2) check++; if (b[i] >= 3) check++; if (check == 2) break; } if (check < 2) { cout << NO ; return; } for (int i = 1; i <= maxT; i++) { for (int j = 0; j < a[i].size(); j++) { if (a[i][j] > 0) { ans[1].push_back(a[i][j]); } } } for (int i = 1; i <= maxT; i++) { for (int j = a[i].size() - 1; j >= 0; j--) { if (a[i][j] > 0) { ans[2].push_back(a[i][j]); } } } bool tt = false; if (specialNum == -1) for (int i = 1; i <= maxT; i++) { if (b[i] >= 2 && !tt) { for (int j = a[i].size() - 1; j >= 0; j--) { if (a[i][j] > 0) { ans[3].push_back(a[i][j]); tt = true; } } } else { for (int j = 0; j < a[i].size(); j++) { if (a[i][j] > 0) { ans[3].push_back(a[i][j]); } } } } else { for (int i = 1; i <= specialNum; i++) { if (i != specialNum) for (int j = a[i].size() - 1; j >= 0; j--) { if (a[i][j] > 0) { ans[3].push_back(a[i][j]); tt = true; } } } for (int i = 0; i < a[specialNum].size() / 2; i++) { if (a[specialNum][i] > 0) { ans[3].push_back(a[specialNum][i]); } } for (int i = a[specialNum].size() - 1; i >= a[specialNum].size() / 2; i--) { if (a[specialNum][i] > 0) { ans[3].push_back(a[specialNum][i]); } } for (int i = specialNum + 1; i <= maxT; i++) { if (i != specialNum) for (int j = a[i].size() - 1; j >= 0; j--) { if (a[i][j] > 0) { ans[3].push_back(a[i][j]); tt = true; } } } } cout << YES << endl; for (int i = 1; i <= 3; i++) { for (int j = 0; j < ans[i].size(); j++) { cout << ans[i][j]; if (j < ans[i].size() - 1) cout << ; } if (i != 3) cout << endl; } } int main() { cin >> n; Work(); }
|
#include <bits/stdc++.h> int main() { uint64_t a, b, x; std::cin >> a >> b; a < b | a - b & 1 ? std::cout << -1 : (x = a - b >> 1, x ^ a - x ^ b ? std::cout << -1 : std::cout << x << << a - x); }
|
#include <bits/stdc++.h> using namespace std; int read() { char ch = getchar(); int w = 1, c = 0; for (; !isdigit(ch); ch = getchar()) if (ch == - ) w = -1; for (; isdigit(ch); ch = getchar()) c = (c << 3) + (c << 1) + (ch ^ 48); return w * c; } const int mod = 998244353, M = 1e6 + 10; int n; long long fac[M], inv[M]; long long C(int x, int y) { if (y > x || y < 0) return 0; return fac[x] * inv[y] % mod * inv[x - y] % mod; } char s[M]; long long fast(long long x, long long p) { long long ret = 1; for (; p; p >>= 1, x = x * x % mod) if (p & 1) ret = ret * x % mod; return ret; } int main() { scanf( %s , s + 1); n = strlen(s + 1); fac[0] = 1; for (int i = 1; i <= n; ++i) fac[i] = fac[i - 1] * i % mod; inv[n] = fast(fac[n], mod - 2); for (int i = n; i >= 1; --i) inv[i - 1] = inv[i] * i % mod; int l = 0, x = 0, y = 0, r = 0; for (int i = 1; i <= n; ++i) { if (s[i] == ( ) l++; if (s[i] == ? ) x++; } long long ans = 0; for (int i = n; i >= 1; --i) { if (s[i] == ( ) l--; if (s[i] == ) ) r++; if (s[i] == ? ) x--, y++; ans = (ans + C(x + y, y + r - l) * l + C(x + y - 1, y + r - l - 1) * x) % mod; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000010; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } int main(void) { int c, d, n, m, k, i, j, ans = 10000; scanf( %d %d %d %d %d , &c, &d, &n, &m, &k); for (i = 0; i <= 10000; i++) for (j = 0; j <= 10000; j++) if (i * n + j >= n * m - k) ans = min(ans, i * c + j * d); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; const int lim = 2001; int A[lim]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &A[i]); long long int total = 0ll; for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { if (A[i] > A[j]) total = total + 1ll; } } int q; scanf( %d , &q); while (q--) { int a, b; scanf( %d %d , &a, &b); total = total + ((b - a + 1) * 1ll * (b - a)) / 2ll; if (total % 2 == 1ll) printf( odd n ); else printf( even n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[105][105]; char s[105][105]; int n, m; long long k; void color(int x, int y, char c) { while (x < n && y >= 0) { s[x][y] = c; x++; y--; } } vector<pair<pair<int, int>, pair<int, int> > > v; vector<int> vals; long long mem[305][305]; int vis[305][305]; int id; long long add(long long x, long long y) { if (x < 0 || y < 0) return -1; long long z = x + y; if (z >= k) return -1; return z; } long long solve(int ind, int r) { if (r < 0) return 0; if (ind >= int(vals.size())) return r == 0; if (vis[ind][r] == id) return mem[ind][r]; vis[ind][r] = id; long long ans = 0; if (vals[ind] != 1) ans = add(ans, solve(ind + 1, r + 1)); if (vals[ind] != 0) ans = add(ans, solve(ind + 1, r - 1)); return mem[ind][r] = ans; } void gen(int ind) { if (ind >= int(vals.size())) return; vals[v[ind].first.second] = 0; id++; long long tmp = solve(0, 0); if (tmp == -1) { color(v[ind].second.first, v[ind].second.second, ( ); gen(ind + 1); } else { vals[v[ind].first.second] = 1; k -= tmp; color(v[ind].second.first, v[ind].second.second, ) ); gen(ind + 1); } } int main() { ios::sync_with_stdio(false); cin >> n >> m; cin >> k; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> p[i][j]; for (int j = 0; j < m; j++) { int x = 0, y = j, pr = n * m + 1; while (x < n && y >= 0) { pr = min(pr, p[x][y]); x++; y--; } v.push_back(make_pair(make_pair(pr, v.size()), make_pair(0, j))); vals.push_back(-1); } for (int i = 1; i < n; i++) { int x = i, y = m - 1, pr = n * m + 1; while (x < n && y >= 0) { pr = min(pr, p[x][y]); x++; y--; } v.push_back(make_pair(make_pair(pr, v.size()), make_pair(i, m - 1))); vals.push_back(-1); } sort(v.begin(), v.end()); gen(0); for (int i = 0; i < n; i++) cout << s[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } long long powmod(long long a, long long b, long long MOD) { long long ans = 1; while (b) { if (b % 2) ans = ans * a % MOD; a = a * a % MOD; b /= 2; } return ans; } int main() { int t; int n, x, y, d; ios::sync_with_stdio(false); string a; cin >> n; cin >> a; int l = a.size(); vector<int> v; v.push_back(-1); int fa = n + 12, fb = -23; for (int i = 0; i < l; i++) { if (a[i] == S ) v.push_back(i); if (fa == n + 12 && a[i] == G ) fa = i; if (a[i] == G ) fb = i; } v.push_back(n); if (v.size() == 2) { cout << n << endl; return 0; } else { int ma = 0; for (int i = 1; i < v.size() - 1; i++) { int xa = v[i + 1] - v[i - 1] - 1; if (v[i + 1] > fb && v[i - 1] < fa) xa--; if (ma < xa) ma = xa; } cout << ma << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-6; const int maxn = 1 << 17; int a[maxn]; void merge(int l, int r, int from, int to, int& res) { if (res <= 0 || l + 1 == r) { for (int i = l, j = from; i <= r; i++, j++) a[i] = j; return; } res -= 2; int m = (l + r) >> 1; int mid = (from + to + 1) >> 1; merge(l, m, mid, to, res); merge(m, r, from, mid, res); } int main() { int n, k; while (cin >> n >> k) { k--; merge(0, n, 0, n, k); if (k) cout << -1 << endl; else { for (int i = 0; i < n; i++) { if (i) cout << ; cout << a[i] + 1; } cout << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e4 + 9; long long a[maxn]; long long n; void solve() { cin >> n; long long sum = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } if (sum % n != 0) { cout << -1 n ; return; } sum /= n; long long j = -1; for (long long i = n - 1; i >= 1; i--) { if (a[i] >= i + 1) { j = i; break; } } vector<pair<pair<long long, long long>, long long> > ans; if (j != -1) { ans.emplace_back(make_pair(j, 0), 1); a[j] -= j + 1; a[0] += j + 1; for (long long e = j; e >= 1; e--) { if (a[e] % (e + 1) != 0) { long long x = (e + 1) - a[e] % (e + 1); ans.emplace_back(make_pair(0, e), x); a[0] -= x; a[e] += x; } ans.emplace_back(make_pair(e, 0), a[e] / (e + 1)); a[0] += a[e]; a[e] = 0; } } else { j = 0; } vector<pair<long long, long long> > kek; for (long long e = j + 1; e < n; e++) { kek.emplace_back((e + 1) - a[e], e); } sort(kek.begin(), kek.end()); for (auto x : kek) { if (a[0] >= x.first) { ans.emplace_back(make_pair(0, x.second), x.first); ans.emplace_back(make_pair(x.second, 0), 1); a[0] += a[x.second]; a[x.second] = 0; } else { cout << -1 n ; return; } } for (long long i = 1; i < n; i++) { ans.emplace_back(make_pair(0, i), sum); } if ((long long)ans.size() > 3 * n) { cout << -1 n ; return; } cout << ans.size() << n ; for (auto x : ans) cout << x.first.first + 1 << << x.first.second + 1 << << x.second << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int k[n][n]; for (int j = 0; j < n; j++) for (int i = 0; i < n; i++) k[i][j] = (i)*n + j + 1; for (int i = 0; i < n; i += 2) reverse(k[i], k[i] + n); for (int j = n - 1; j >= 0; j--) { for (int i = 0; i < n; i++) cout << k[i][j] << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); ; long long t = 1; while (t--) { long long n; cin >> n; long long a[n], b[n]; for (long long i = 0; i < n; i++) cin >> a[i]; multiset<long long> s; for (long long i = 0; i < n; i++) cin >> b[i], s.insert(b[i]); vector<long long> c(n); for (long long i = 0; i < n; i++) { multiset<long long>::iterator it = s.begin(); long long ans = (a[i] + *it) % n, num = *it; it = s.lower_bound(n - a[i]); if (it != s.end() && (a[i] + *it) % n < ans) { ans = (a[i] + *it) % n; num = *it; } c[i] = ans; s.erase(s.find(num)); } for (long long i = 0; i < n; i++) cout << c[i] << ; cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; int ans = 9999; string s, t; int main() { cin >> s >> t; for (int i = 0; i < t.size(); i++) s = . + s + . ; for (int i = 0; i + t.size() - 1 < s.size(); i++) { int temp = 0; for (int j = 0; j < t.size(); j++) temp += (s[i + j] != t[j]); if (ans > temp) ans = temp; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int a[200005]; vector<long long int> g[200005]; vector<long long int> c[200005]; multiset<long long int> st[200005]; long long int idx[200005], toAdd[200005], ans[200005]; void mergeTree(long long int id1, long long int id2) { multiset<long long int>::iterator it; long long int x; for (it = st[id2].begin(); it != st[id2].end(); it++) { x = *it + toAdd[id2] - toAdd[id1]; st[id1].insert(x); } return; } void dfs(long long int u) { idx[u] = u; long long int i, j, k, mx; mx = st[idx[u]].size(); long long int id = idx[u]; for (i = 0; i < g[u].size(); i++) { long long int v = g[u][i]; dfs(v); if (st[idx[v]].size() > mx) { mx = st[idx[v]].size(); id = idx[v]; } toAdd[idx[v]] -= c[u][i]; } idx[u] = id; for (i = 0; i < g[u].size(); i++) { long long int v = g[u][i]; if (id != idx[v]) mergeTree(id, idx[v]); st[id].insert((a[v] - c[u][i]) - toAdd[id]); } multiset<long long int>::iterator it; while (!st[id].empty()) { it = st[id].begin(); if ((*it + toAdd[id]) < 0) st[id].erase(it); else break; } ans[u] = (long long int)st[id].size(); return; } int main() { long long int i, j, k, l, m, n; cin >> n; for (i = 1; i <= n; i++) scanf( %lld , &a[i]); for (i = 2; i <= n; i++) { scanf( %lld %lld , &k, &l); g[k].push_back(i); c[k].push_back(l); } memset(toAdd, 0, sizeof(toAdd)); dfs(1); for (i = 1; i <= n; i++) { printf( %lld , ans[i]); if (i < n) printf( ); else printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int mas[100500]; int main() { int n, k, p = 1, t; bool cur = false; char q; string s = , s1; cin >> n >> k; mas[1] = 1; for (int i = 2; i <= n; i++) { if (p < k) { if (!cur) mas[i] = n - mas[i - 1] + 1; else mas[i] = mas[i - 2] + 1; if (!cur) cur = true; else cur = false; p++; } else { if (!cur) { mas[i] = mas[i - 1] + 1; } else { mas[i] = mas[i - 1] - 1; } } } for (int i = 1; i <= n; i++) { s1 = ; while (mas[i] > 0) { q = mas[i] % 10 + 0 ; mas[i] /= 10; s1 = q + s1; } s += s1 + ; } cout << s; return 0; }
|
#include <bits/stdc++.h> using namespace std; int gr[1000005]; int was[1000005]; long long GetPow(long long val, int deg) { long long ret = 1; for (int i = 0; i < deg; ++i) { ret *= val; } return ret; } long long arr[100000]; int main() { long long sq4 = 2, sq2 = 2, val4 = 16, val2 = 4; int least = 0; for (int i = 4; i < 1000005; ++i) { if (val2 == i) { was[gr[sq2]]++; ++sq2; val2 = GetPow(sq2, 2); while (was[least]) { ++least; } } gr[i] = least; if (val4 == i) { was[gr[sq4]]--; if (!was[gr[sq4]] && gr[sq4] < least) { least = gr[sq4]; } ++sq4; val4 = GetPow(sq4, 4); } } int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i]; } sort(arr, arr + n); sq2 = 1; sq4 = 1; val2 = 1; val4 = 1; long long xr = 0, cur = 0; memset(was, 0, sizeof was); least = 0; for (int i = 0; i < n; ++i) { if (arr[i] == 1) { continue; } while (val2 <= arr[i]) { was[gr[sq2]]++; ++sq2; val2 = GetPow(sq2, 2); } while (val4 < arr[i]) { was[gr[sq4]]--; if (!was[gr[sq4]] && least > gr[sq4]) { least = gr[sq4]; } ++sq4; val4 = GetPow(sq4, 4); } while (was[least]) { ++least; } xr ^= least; } if (xr) { puts( Furlo ); } else { puts( Rublo ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; long long m, n; void solve() { cin >> n >> m; bool visited[n + 5]; memset(visited, 0, sizeof(visited)); for (long long i = 0; i < m; i++) { long long a, b, c; cin >> a >> b >> c; visited[b] = 1; } long long node = -1; for (long long i = 1; i < n + 1; i++) if (!visited[i]) { node = i; break; } for (long long i = 1; i < n + 1; i++) { if (i == node) continue; cout << node << << i << n ; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; long long solve(long long n, string str1, string str2) { long long t1 = 0, t2 = 0; for (long long i = 0; i < n; i++) { if (str1[i] != str2[i]) { if (str1[i] == 1 ) t1++; else t2++; } } if (t1 != t2) return -1; else return 2 * t1; } int main() { long long t; cin >> t; while (t--) { long long n; string str1, str2; cin >> n; cin >> str1 >> str2; long long a1 = solve(n, str1, str2); long long ind = -1; for (long long i = 0; i < n; i++) { if (str1[i] == 1 && str2[i] == 1 ) { ind = i; break; } } long long a2 = -1; string temp = str1; if (ind != -1) { for (long long i = 0; i < n; i++) { if (str1[i] == 1 && i != ind) str1[i] = 0 ; else if (str1[i] == 0 ) str1[i] = 1 ; } a2 = solve(n, str1, str2); } long long a3 = -1; str1 = temp; long long ind2 = -1; for (long long i = 0; i < n; i++) { if (str1[i] == 1 && str2[i] == 0 ) { ind2 = i; break; } } if (ind2 != -1) { for (long long i = 0; i < n; i++) { if (str1[i] == 1 && i != ind2) str1[i] = 0 ; else if (str1[i] == 0 ) str1[i] = 1 ; } a3 = solve(n, str1, str2); } if (a1 == -1 && a2 == -1 && a3 == -1) { cout << -1 << endl; } else { if (a1 == -1 && a2 == -1) cout << (a3 + 1) << endl; else if (a1 == -1 && a3 == -1) cout << (a2 + 1) << endl; else if (a2 == -1 && a3 == -1) cout << a1 << endl; else if (a1 == -1) cout << min(a2 + 1, a3 + 1) << endl; else if (a2 == -1) cout << min(a1, a3 + 1) << endl; else if (a3 == -1) cout << min(a1, a2 + 1) << endl; else { long long b = min(a2 + 1, a3 + 1); long long ans = min(b, a1); cout << ans << endl; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; double PI = acos(-1); vector<int> adj[100005]; bool vis[100005]; map<pair<int, int>, long long> edge; map<pair<int, int>, pair<long long, int>> weight; long long mod = 1e9 + 7; int n, k; long long dfs(int node) { vis[node] = 1; long long ans = 1; for (auto v : adj[node]) { if (!vis[v]) { long long a = dfs(v); edge[{v, node}] = a; edge[{node, v}] = a; ans += a; } } if (ans > 1) ans--; return ans; } void clc() { for (int i = 0; i <= n; i++) { adj[i].clear(); vis[i] = 0; } edge.clear(); weight.clear(); } void test_case() { long long sum = 0, ans = 1e8, s; cin >> n >> s; pair<int, int> arr[n]; vector<long long> v1, v2; v1.push_back(0), v2.push_back(0); for (int i = 0; i < n - 1; i++) { int x, y, c, w; cin >> x >> y >> c >> w; adj[x].push_back(y), adj[y].push_back(x); arr[i] = {x, y}; weight[{x, y}] = {c, w}, weight[{y, x}] = {c, w}; } dfs(1); for (int i = 0; i < n; i++) { long long x = edge[{arr[i].first, arr[i].second}], y = weight[{arr[i].first, arr[i].second}].first; sum += x * y; while (y) { if (weight[{arr[i].first, arr[i].second}].second == 1) v1.push_back(x * y - x * (y / 2)); else v2.push_back(x * y - x * (y / 2)); y /= 2; } } sort(v1.begin() + 1, v1.end()); sort(v2.begin() + 1, v2.end()); reverse(v1.begin() + 1, v1.end()); reverse(v2.begin() + 1, v2.end()); for (int i = 1; i < v1.size(); i++) v1[i] += v1[i - 1]; for (int i = 1; i < v2.size(); i++) v2[i] += v2[i - 1]; for (int i = 0; i < v2.size(); i++) { long long pos = lower_bound(v1.begin(), v1.end(), sum - s - v2[i]) - v1.begin(); if (pos == v1.size()) continue; ans = min(ans, pos + 2 * i); } cout << ans << n ; clc(); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { test_case(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long min(long long x, long long y) { return (x < y) ? x : y; } long long max(long long x, long long y) { return (x > y) ? x : y; } const int N = 1000009; const int E = 1000000; int x, y, n, m, e, i, u, w, mx, z, sum, l, r, best, cnt, g, j, k, t; int a[N], flag[N], mark[N]; string s; vector<int> pos, ans; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; flag[a[i]] = true; } for (int i = 1; i <= E / 2; i++) if (!flag[i] && !flag[E - i + 1]) pos.push_back(i); for (int i = 0; i < n; i++) { if (mark[a[i]]) continue; mark[a[i]] = true; k = a[i]; if (!flag[E - k + 1]) ans.push_back(E - k + 1); else { w = pos[cnt]; cnt++; ans.push_back(w); ans.push_back(E - w + 1); mark[E - k + 1] = true; } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int ma = -1, mi = 1000000000000000; inline long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } inline long long int lcm(long long int a, long long int b, long long int MOD) { return a / gcd(a, b) * b % MOD; } long long int power(long long int x, unsigned int y) { if (y == 0) return 1; else if (y % 2 == 0) return power(x, y / 2) * power(x, y / 2); else return x * power(x, y / 2) * power(x, y / 2); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int i, j, k, a[100009] = {0}, b[100009] = {0}, c = 0, d = 0; string n, m; cin >> n >> m; if (n == monday ) { if (m == monday || m == wednesday || m == thursday ) { cout << YES << endl; return 0; } } if (n == tuesday ) { if (m == tuesday || m == friday || m == thursday ) { cout << YES << endl; return 0; } } if (n == wednesday ) { if (m == friday || m == wednesday || m == saturday ) { cout << YES << endl; return 0; } } if (n == thursday ) { if (m == saturday || m == sunday || m == thursday ) { cout << YES << endl; return 0; } } if (n == friday ) { if (m == friday || m == sunday || m == monday ) { cout << YES << endl; return 0; } } if (n == saturday ) { if (m == saturday || m == monday || m == tuesday ) { cout << YES << endl; return 0; } } if (n == sunday ) { if (m == sunday || m == wednesday || m == tuesday ) { cout << YES << endl; return 0; } } cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; void rr(vector<vector<long long>> &m, long long r, long long nr, long long nc) { long long t = m[r - 1][nc - 1]; for (long long i = nc - 2; i >= 0; i--) m[r - 1][i + 1] = m[r - 1][i]; m[r - 1][0] = t; return; } void rc(vector<vector<long long>> &m, long long c, long long nr, long long nc) { long long t = m[nr - 1][c - 1]; for (long long i = nr - 2; i >= 0; i--) m[i + 1][c - 1] = m[i][c - 1]; m[0][c - 1] = t; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, q, t; cin >> n >> m >> q; vector<vector<long long>> mat(n, vector<long long>(m, 0)); vector<vector<long long>> op; for (long long i = 0; i < q; i++) { cin >> t; if (t == 1 || t == 2) { long long roc; cin >> roc; op.push_back({t, roc}); } else { long long r, c, x; cin >> r >> c >> x; op.push_back({t, r, c, x}); } } bool f3 = false; for (long long i = op.size() - 1; i >= 0; i--) { if (!f3) { if (op[i][0] == 3) { f3 = true; mat[op[i][1] - 1][op[i][2] - 1] = op[i][3]; } } else { if (op[i][0] == 1) { rr(mat, op[i][1], n, m); } else if (op[i][0] == 2) { rc(mat, op[i][1], n, m); } else { mat[op[i][1] - 1][op[i][2] - 1] = op[i][3]; } } } for (auto i : mat) { for (auto j : i) cout << j << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 10004; long long a[N], b[N], c, sa = 0, mb = 0, M; int n; bool ok1(long long x) { long long s = 0; for (int i = 1; i <= n; i++) { if (a[i] > 0 && x / b[i] > c / a[i]) return 0; s += a[i] * x / b[i] + 1; if (s >= c) return 0; } return 1; } bool ok2(long long x) { long long s = 0; for (int i = 1; i <= n; i++) { if (a[i] > 0 && x / b[i] > c / a[i]) return 1; s += a[i] * x / b[i] + 1; if (s > c) return 1; } return 0; } int main() { scanf( %d %lld , &n, &c); for (int i = 1; i <= n; i++) { scanf( %lld %lld , &a[i], &b[i]); sa += a[i]; mb = max(mb, b[i]); } long long u, v; M = c * mb; if (sa == 0) return puts(n == c ? -1 : 0 ), 0; long long l = 0, r = M; while (l < r) { long long mid = (l + r + 1) / 2; if (ok1(mid)) l = mid; else r = mid - 1; } u = l; l = 0, r = M; while (l < r) { long long mid = (l + r) / 2; if (ok2(mid)) r = mid; else l = mid + 1; } v = r; printf( %lld n , max(v - u - 1, 0ll)); }
|
#include <bits/stdc++.h> using namespace std; const int N = 1005; long long ara[N]; int main() { long long n, m; cin >> n >> m; for (long long i = 0; i < m; ++i) { long long x; cin >> x; ++ara[x]; } vector<long long> v; for (long long i = 1; i <= 100; ++i) { if (ara[i] != 0) v.push_back(ara[i]); } long long mx = 0; for (long long i = 1; i <= 100; ++i) { long long s = 0; for (long long j = 0; j < v.size(); ++j) { s += v[j] / i; } if (s >= n) mx = max(mx, i); } cout << mx; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100; int main() { long long a[maxn], b[maxn]; int n, m; while (cin >> n >> m) { for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= m; ++i) { cin >> b[i]; } sort(a + 1, a + n + 1); sort(b + 1, b + m + 1); long long ans1 = a[1] * b[1], ans2 = a[n] * b[m], ans3 = a[1] * b[m], ans4 = a[n] * b[1]; long long maxx = max(ans1, max(ans2, max(ans3, ans4))); if (maxx == ans1) cout << max(a[2] * b[1], max(ans2, max(a[2] * b[m], ans4))) << endl; else if (maxx == ans2) cout << max(a[n - 1] * b[m], max(ans1, max(ans3, a[n - 1] * b[1]))) << endl; else if (maxx == ans3) cout << max(a[2] * b[1], max(ans2, max(a[2] * b[m], ans4))) << endl; else cout << max(ans1, max(a[n - 1] * b[m], max(ans3, a[n - 1] * b[1]))) << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool debug = true; long long n, m, a, b; int main(int argc, char* argv[]) { cin >> n >> m >> a >> b; long long r = n % m; cout << min(r * b, (m - r) * a); while (clock() <= 300) { } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct seq { int num; char color; }; int main() { string s; cin >> s; int i = 1, N = 0, j; seq temp; vector<seq> arr; temp.num = 1; temp.color = s[0]; while (s[i] != 0 ) { if (s[i] == temp.color) { temp.num++; } else { arr.push_back(temp); temp.num = 1; temp.color = s[i]; N++; } i++; } arr.push_back(temp); N++; if (N % 2 == 0) { cout << 0 << endl; return 0; } i = 0; j = N - 1; while (i < j) { if (arr[i].color == arr[j].color) { if (arr[i].num + arr[j].num >= 3) { i++; j--; } else { break; } } else { break; } } if (i == j) { if (arr[i].num + 1 >= 3) { cout << arr[i].num + 1 << endl; } else { cout << 0 << endl; } } else { cout << 0 << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main(void) { char tramp; cin >> tramp; string rank = 6789TJQKA ; char c1_s, c1_r; cin >> c1_r >> c1_s; char c2_s, c2_r; cin >> c2_r >> c2_s; if (c1_s == tramp && c2_s != tramp) { cout << YES << endl; return 0; } if (c1_s == c2_s && rank.find(c1_r) > rank.find(c2_r)) { cout << YES << endl; return 0; } cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; int true_mod(int A, int N) { A %= N; if (A < 0) A += N; return A; } const long long MOD = 1000LL * 1000LL * 1000LL + 7LL; const int MX = 109; struct matrix { long long A[MX][MX]; }; int x; void output(const matrix& A) { for (int i = 0; i < x; i++) { for (int j = 0; j < x; j++) cout << A.A[i][j] << ; cout << endl; } } matrix operator*(const matrix& A, const matrix& B) { matrix R; for (int i = 0; i < x; i++) { for (int k = 0; k < x; k++) { long long t = 0; for (int j = 0; j < x; j++) t += A.A[i][j] * B.A[j][k] % MOD; R.A[i][k] = t % MOD; } } return R; } matrix unity() { matrix R; for (int i = 0; i < x; i++) for (int j = 0; j < x; j++) R.A[i][j] = (i == j ? 1 : 0); return R; } matrix power(const matrix& A, int N) { matrix R = unity(), A_pow = A; while (N != 0) { if (N % 2 == 1) R = R * A_pow; A_pow = A_pow * A_pow; N /= 2; } return R; } int n, b, k; const long long B = 10; int cnt_D[MX] = {0}; matrix get_A() { matrix R; for (int i = 0; i < x; i++) { for (int j = 0; j < x; j++) { int smth = true_mod(j - 10 * i, x); R.A[i][j] = cnt_D[smth]; } } return R; } int main() { cin >> n >> b >> k >> x; for (int i = 0; i < n; i++) { int a; cin >> a; cnt_D[a % x]++; } matrix A = get_A(); matrix A_pow = power(A, b); cout << A_pow.A[0][k]; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int n, m; char arr[2004][2004]; pair<int, int> v[2004][2004]; long long int dist[8000003]; const long long int oo = 1000000007; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; int get_node(int x, int y) { return x * m + y; } void bfs(int r, int c) { for (int i = 0; i < n * m; i++) dist[i] = oo; dist[get_node(r, c)] = 0; deque<pair<int, int>> dq; dq.push_back({r, c}); v[r][c] = {0, 0}; while (!dq.empty()) { int x = dq[0].first; int y = dq[0].second; dq.pop_front(); for (int i = 0; i < 4; i++) { int xx = x + dx[i]; int yy = y + dy[i]; if (xx < 0 || xx >= n || yy < 0 || yy >= m) continue; if (arr[xx][yy] == * ) continue; int flag = 0; if (yy < y) flag = 1; int node = get_node(xx, yy); int u = get_node(x, y); if (dist[node] > dist[u] + flag) { dist[node] = dist[u] + flag; v[xx][yy] = v[x][y]; if (i == 2) v[xx][yy].second++; if (i == 3) v[xx][yy].first++; if (flag) dq.push_back({xx, yy}); else dq.push_front({xx, yy}); } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; long long int r, c; cin >> r >> c; r--; c--; long long int le, ri; cin >> le >> ri; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> arr[i][j], v[i][j] = {oo, oo}; bfs(r, c); long long int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (arr[i][j] == * ) continue; if (v[i][j].first <= le && v[i][j].second <= ri) ans++; } } cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const int maxmn = 505; long long a[maxmn][maxmn]; long long luu1[maxmn][maxmn]; bool k[1000005]; long long maxx = 1e9; void readquick() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { readquick(); vector<long long> luu; memset(k, true, sizeof k); for (int i = 2; i <= sqrt(1000000); i++) { if (k[i] == true) { for (int j = i * i; j <= 1000000; j += i) { k[j] = false; } } } for (int i = 2; i <= 1000000; i++) { if (k[i] == true) luu.push_back(i); } int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; int w = lower_bound(luu.begin(), luu.end(), a[i][j]) - luu.begin(); luu1[i][j] = luu[w] - a[i][j]; } } for (int i = 1; i <= n; i++) { long long tong = 0; for (int j = 1; j <= m; j++) { tong += luu1[i][j]; } if (tong >= 0) { maxx = min(maxx, tong); } } for (int i = 1; i <= m; i++) { long long tong = 0; for (int j = 1; j <= n; j++) { tong += luu1[j][i]; } if (tong >= 0) { maxx = min(maxx, tong); } } cout << maxx; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; vector<vector<int> > v(N); int col[N]; int par[N]; int n; int in[N], out[N]; int timer; bool all_same[N]; bool can[N]; int euler[2 * N]; int tree[8 * N]; int answer = -1; void dfs(int node) { all_same[node] = true; can[node] = true; timer++; in[node] = timer; euler[timer] = col[node]; for (int to : v[node]) { if (to == par[node]) continue; par[to] = node; dfs(to); can[node] &= (all_same[to]); all_same[node] &= (all_same[to] and (col[node] == col[to])); } out[node] = timer; } void build(int id, int lo, int hi) { if (lo == hi) { tree[id] = euler[lo]; return; } int mid = (lo + hi) >> 1; build(2 * id, lo, mid); build(2 * id + 1, mid + 1, hi); if (tree[2 * id + 1] == tree[2 * id]) tree[id] = tree[2 * id]; } int query(int id, int lo, int hi, int l, int r) { if (r < l) return -2; if (l > hi or r < lo) return -2; if (l <= lo and r >= hi) { if (tree[id] == 0) return -1; return (tree[id]); } int mid = (lo + hi) >> 1; int tmp1 = query(2 * id, lo, mid, l, r); int tmp2 = query(2 * id + 1, mid + 1, hi, l, r); if (tmp1 == tmp2) { return tmp1; } if (tmp1 == -2) { return tmp2; } if (tmp2 == -2) { return tmp1; } return -1; } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int x, y; scanf( %d %d , &x, &y); v[x].emplace_back(y); v[y].emplace_back(x); } for (int i = 1; i <= n; i++) { scanf( %d , &col[i]); } dfs(1); build(1, 1, timer); for (int i = 1; i <= n; i++) { if (can[i]) { int node = i; int tmp1 = query(1, 1, timer, 1, in[node] - 1); int tmp2 = query(1, 1, timer, out[node] + 1, timer); if ((tmp1 == tmp2 and tmp1 != -1) or (tmp1 == -2 and tmp2 != -1) or (tmp1 != -1 and tmp2 == -2)) { puts( YES ); printf( %d n , i); return 0; } } } puts( NO ); }
|
#include <bits/stdc++.h> using namespace std; clock_t time_p = clock(); void ktj() { time_p = clock() - time_p; cerr << Time elapsed : << (float)(time_p) / CLOCKS_PER_SEC << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i, j, k; cin >> n; vector<long long> a(n); for (i = 0; i < n; i++) { cin >> a[i]; } if (n % 2) { for (i = 0; i < n; i++) { if (a[i] >= 0) { a[i] = -a[i] - 1; } } auto mn = min_element(a.begin(), a.end()); a[mn - a.begin()] = -a[mn - a.begin()] - 1; for (i = 0; i < n; i++) { cout << a[i] << ; } cout << n ; } else { for (i = 0; i < n; i++) { if (a[i] >= 0) cout << -a[i] - 1 << ; else cout << a[i] << ; } cout << n ; } ktj(); }
|
#include <bits/stdc++.h> using namespace std; int n, a, b, x, y, f[1000001]; void make(int l, int r) { for (int i = l; i < r; i++) f[i] = i + 1; f[r] = l; } int main() { scanf( %d%d%d , &n, &a, &b); for (x = 0; x * a <= n; x++) if ((n - x * a) % b == 0) { y = (n - x * a) / b; break; } if (a * x + b * y != n) return printf( -1 n ), 0; for (int i = 1; i <= x; i++) make(i * a - a + 1, i * a); for (int i = 1; i <= y; i++) make(a * x + i * b - b + 1, a * x + i * b); for (int i = 1; i <= n; i++) printf( %d%c , f[i], i < n ? : n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mx[] = {0, 2, 3, 1}; long long get_base(long long n) { long long b = 4; for (;;) { if (b > n) return b / 4; b <<= 2; } return 0; } long long func1(long long n) { long long b = get_base(n); return (n - b) / 3 + b; } long long func2(long long n) { long long b = get_base(n); long long m = (n - b - 1) / 3; long long bb = b; vector<int> v; while (bb >= 4) { v.push_back(m % 4); m /= 4; bb /= 4; } long long r = b + b; bb = b / 4; for (int i = v.size() - 1; i >= 0; i--) { r += bb * mx[v[i]]; bb /= 4; } if (n == 2) return 2; return r; } int main() { int t; long long n, ans; ios::sync_with_stdio(0); cin.tie(0); cin >> t; while (t--) { cin >> n; if (n % 3 == 0) ans = func1(n - 2) ^ func2(n - 1); else if (n % 3 == 1) ans = func1(n); else ans = func2(n); cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 3 * 1e5 + 10, D = 313, mod = 1e9 + 7; long long hsh[maxn], n, ht, ans, tz, p[maxn]; string t, s[maxn]; vector<pair<int, int> > nei[maxn]; void find_p() { p[0] = 1; for (int i = 1; i < maxn; i++) p[i] = (p[i - 1] * D) % mod; } long long get_hash(int st, int en) { return ((hsh[en] - hsh[st] * p[en - st]) % mod + mod) % mod; } void st_hash() { for (int i = 0; i < tz; i++) hsh[i + 1] = ((hsh[i] * D) + t[i]) % mod; ht = hsh[tz]; memset(hsh, 0, sizeof hsh); } void dfs(int v, int par, int ptr) { for (auto u : nei[v]) if (u.first != par) { for (auto i : s[u.second]) { hsh[ptr + 1] = ((hsh[ptr] * D) + i) % mod; ptr++; if (ptr - tz >= 0 && get_hash(ptr - tz, ptr) == ht) ans++; } dfs(u.first, v, ptr); ptr -= (int)s[u.second].size(); } } int main() { ios::sync_with_stdio(0), cout.tie(0), cin.tie(0); int a; string b; cin >> n; for (int i = 1; i < n; i++) { cin >> a >> b; a--; s[i] = b; nei[i].push_back({a, i}); nei[a].push_back({i, i}); } cin >> t; tz = (int)t.size(); find_p(); st_hash(); dfs(0, -1, 0); cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n; cin >> t; while (t--) { cin >> n; long long int c = 0; string s = ; cin >> s; string h = s; sort(h.begin(), h.end()); for (int j = 0; j < n; j++) if (h.at(j) != s.at(j)) c++; cout << c << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 3; int n, m, i, j, k, l, r, s, t, d, u, ii, jj, x, y, z, lz[4 * N], h[N]; char c[100]; pair<pair<int, int>, pair<int, int> > first[4 * N]; void init(int root, int bas, int son) { if (bas == son) { if (h[bas] == 4) first[root].first.first = 1; else first[root].first.second = 1; first[root].second.first = first[root].second.second = 1; return; } init((root + root), bas, (bas + son >> 1)); init(((root + root) + 1), (bas + son >> 1) + 1, son); first[root].first.first = first[(root + root)].first.first + first[((root + root) + 1)].first.first; first[root].first.second = first[(root + root)].first.second + first[((root + root) + 1)].first.second; first[root].second.first = max(first[(root + root)].second.first + first[((root + root) + 1)].first.second, first[(root + root)].first.first + first[((root + root) + 1)].second.first); first[root].second.second = max(first[(root + root)].second.second + first[((root + root) + 1)].first.first, first[(root + root)].first.second + first[((root + root) + 1)].second.second); } void push(int root, int bas, int son) { if (lz[root] and bas != son) { lz[((root + root) + 1)] = 1 - lz[((root + root) + 1)]; lz[(root + root)] = 1 - lz[(root + root)]; swap(first[(root + root)].first.first, first[(root + root)].first.second); swap(first[((root + root) + 1)].first.first, first[((root + root) + 1)].first.second); swap(first[((root + root) + 1)].second.first, first[((root + root) + 1)].second.second); swap(first[(root + root)].second.first, first[(root + root)].second.second); } lz[root] = 0; } void g(int root, int bas, int son) { push(root, bas, son); if (x > son or y < bas) return; if (x <= bas and y >= son) { swap(first[root].first.first, first[root].first.second); swap(first[root].second.first, first[root].second.second); lz[root] = 1; return; } g((root + root), bas, (bas + son >> 1)); g(((root + root) + 1), (bas + son >> 1) + 1, son); first[root].first.first = first[(root + root)].first.first + first[((root + root) + 1)].first.first; first[root].first.second = first[(root + root)].first.second + first[((root + root) + 1)].first.second; first[root].second.first = max(first[(root + root)].second.first + first[((root + root) + 1)].first.second, first[(root + root)].first.first + first[((root + root) + 1)].second.first); first[root].second.second = max(first[(root + root)].second.second + first[((root + root) + 1)].first.first, first[(root + root)].first.second + first[((root + root) + 1)].second.second); } int main() { cin >> n >> m; for (i = 1; i <= n; i++) { scanf( %c , &c[0]); if (c[0] == 4 ) h[i] = 4; } init(1, 1, n); while (m--) { scanf( %s , c); if (c[0] == c ) printf( %d n , first[1].second.first); else { scanf( %d%d , &x, &y); g(1, 1, n); } } }
|
#include <bits/stdc++.h> int n, k; int count; int x; std::vector<int> negTemps; std::priority_queue<int, std::vector<int>, std::greater<int> > intervals; int main(void) { scanf( %d %d , &n, &k); for (int i = 0; i <= n - 1; ++i) { scanf( %d , &x); if (x < 0) { negTemps.push_back(i); } } if (!negTemps.size()) { printf( 0 n ); return 0; } if (k < negTemps.size()) { printf( -1 n ); return 0; } int count = negTemps.size() << 1; int rem = k - negTemps.size(); auto it1 = negTemps.begin(); auto it2 = it1 + 1; while (it2 != negTemps.end()) { intervals.push(*it2 - 1 - *it1); ++it1; ++it2; } while (intervals.size() && intervals.top() <= rem) { count -= 2; rem -= intervals.top(); intervals.pop(); } if (n - *it1 - 1 <= rem) --count; printf( %d n , count); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 3e6 + 10; long long a[maxn], sum[maxn], n, m, big = 0, tmp; int main() { scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &m); a[m]++; big = max(big, m); } for (int i = 0; i <= big; i++) { for (int j = 0; j <= big; j++) { if ((long long)i * j > maxn - 10) break; sum[i * j] += a[i] * a[j]; if (i == j) sum[i * j] -= a[i]; } } for (int i = 1; i < maxn; i++) sum[i] += sum[i - 1]; scanf( %lld , &m); for (int i = 0; i < m; i++) { scanf( %lld , &tmp); printf( %lld n , n * (n - 1) - sum[tmp - 1]); } }
|
#include <bits/stdc++.h> using namespace std; const int M = 2e6 + 2e5; const int N = M >> 1; const int MX = 2e6; const int D = 1e6; double L[M], R[M]; int g[M]; struct pnt { int x, y; void input() { scanf( %d %d , &x, &y); } } p[N]; int n; double ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { p[i].input(); p[i].x += D, p[i].y += D; } function<void(int, double)> update = [&](int y, double x) { L[y] = min(L[y], x); R[y] = max(R[y], x); }; for (int step = 0; step < 2; step++) { for (int i = 0; i <= MX; i++) L[i] = M, R[i] = -1; for (int i = 1; i <= n; i++) { update(p[i].y, p[i].x); int ni = i == n ? 1 : i + 1; if (p[i].y == p[ni].y) continue; double d = (p[ni].x - p[i].x) * 1.0 / (p[ni].y - p[i].y); double cur; cur = p[i].x; for (int j = p[i].y + 1; j < p[ni].y; j++) { cur += d; update(j, cur); } cur = p[ni].x; for (int j = p[ni].y + 1; j < p[i].y; j++) { cur += d; update(j, cur); } } long long tot = 0; for (int i = 0; i <= MX; i++) { int lx = L[i] + 0.9999999; int rx = R[i] + 0.0000001; g[i] = rx >= lx ? rx - lx + 1 : 0; tot += g[i]; } double c = 0, d = 0, dd = 0; for (int i = 0; i < MX; i++) { double r = g[i] * 1.0 / (tot - 1); d = d + dd + r; dd = dd + r + r; c = c + d; ans += 1.0 * g[i + 1] / tot * c; } for (int i = 1; i <= n; i++) swap(p[i].x, p[i].y); } cout << fixed << setprecision(10) << ans << endl; return 0; }
|
#include <bits/stdc++.h> static int v1[100001]; static int v2[100001]; int comp(const void *elem1, const void *elem2) { return *((const int *)elem2) - *((const int *)elem1); } int main(void) { int k, r, n; scanf( %d %d %d , &n, &k, &r); k--; r--; for (int i = 0; i < n; ++i) { int a; scanf( %d , &a); v1[i] = a; } for (int i = 0; i < n; ++i) { int a; scanf( %d , &a); v2[i] = a; } qsort(v1 + k, r - k + 1, sizeof(int), comp); qsort(v2 + k, r - k + 1, sizeof(int), comp); for (int i = 0; i < n; ++i) { if (v1[i] != v2[i]) { printf( LIE ); return 0; } } printf( TRUTH ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int r, g, b, w; cin >> r >> g >> b >> w; int e = 0; if (r % 2 == 0) e++; if (g % 2 == 0) e++; if (b % 2 == 0) e++; if (e == 3) { cout << YES n ; continue; } else if (e == 2) { if (w % 2 == 0) { cout << YES n ; continue; } else { cout << NO n ; continue; } } else if (e == 1) { if (r > 0 && b > 0 && g > 0 && w % 2) { cout << YES n ; continue; } else { cout << NO n ; continue; } } else { cout << YES n ; } } }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long powm(long long a, long long n) { long long base = 1; a %= MOD; while (n) { if (n & 1) base = base * a % MOD; a = a * a % MOD; n >>= 1; } return base; } int main() { long long a, b, t; cin >> a >> b >> t; if ((a & 1) != (b & 1) && t == -1) { cout << 0 << endl; return 0; } long long ans = powm(2, a - 1); ans = powm(ans, b - 1); cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; long long int modpow(long long int a, long long int n, long long int temp) { long long int res = 1; while (n > 0) { res = (res * res) % temp; if (n & 1) res = (res * a) % temp; n /= 2; } return res; } long long int gcd(long long int a, long long int b) { if (a == 0) return (b); else return (gcd(b % a, a)); } int main() { int n; vector<int> a; cin >> n; for (int i = 0; i < n; i++) { int t; cin >> t; a.push_back(t); } sort(a.begin(), a.end()); for (int i = 0; i < n - 1; i++) { while (a[i + 1] == a[i]) i++; if (i >= n - 1) break; if (2 * a[i] > a[i + 1]) { cout << YES ; return 0; } } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int M = 998244353; struct modint { int val = 0; modint() {} modint(int a) : val(a) { while (val < 0) { val += M; } while (val >= M) { val -= M; } } modint(long long a) : val(a % M) { if (val < 0) { val += M; } } modint operator+=(modint oth) { val += oth.val; val -= (val >= M) ? M : 0; return *this; } modint operator-=(modint oth) { val -= oth.val; val += (val < 0) ? M : 0; return *this; } modint operator*=(modint oth) { val = 1LL * val * oth.val % M; return *this; } void operator++() { ++val; if (val == M) { val = 0; } } void operator--() { --val; if (val == -1) { val = M - 1; } } modint operator-() { modint res; res.val = (val == 0) ? 0 : M - val; return res; } int mod() { return M; } modint pow(long long e) { modint base = val; modint res = 1; while (e > 0) { if (e % 2 == 1) { res *= base; } base *= base; e /= 2; } return res; } modint inv() { return pow(M - 2); } friend modint operator+(modint a, modint b) { return modint(a) += b; } friend modint operator-(modint a, modint b) { return modint(a) -= b; } friend modint operator*(modint a, modint b) { return modint(a) *= b; } friend bool operator==(modint a, modint b) { return a.val == b.val; } friend bool operator!=(modint a, modint b) { return a.val != b.val; } }; using mint = modint; void ntt(vector<mint> &a) { int n = a.size(); for (int i = 1, j = 0; i < n; ++i) { int k = n / 2; while ((j & k) > 0) { j ^= k; k /= 2; } j ^= k; if (i < j) { swap(a[i], a[j]); } } mint base = mint(3).pow((M - 1) / n); for (int len = 2; len <= n; len *= 2) { mint root = base.pow(n / len); for (int i = 0; i < n; i += len) { mint cur = 1; for (int j = 0; j < len / 2; ++j) { mint l = a[i + j]; mint r = a[i + j + len / 2] * cur; a[i + j] = l + r; a[i + j + len / 2] = l - r; cur *= root; } } } } vector<mint> mul(const vector<mint> &u, const vector<mint> &v) { int n = 1; while (n < int(u.size() + v.size())) { n *= 2; } vector<mint> a(u.begin(), u.end()); vector<mint> b(v.begin(), v.end()); a.resize(n); b.resize(n); ntt(a); ntt(b); for (int i = 0; i < n; ++i) { a[i] *= b[i]; } ntt(a); mint inv = mint(n).inv(); for (mint &i : a) { i *= inv; } reverse(a.begin() + 1, a.end()); return a; } void solve() { int n; string s; cin >> n >> s; vector<mint> v(n), k(n); for (int i = 0; i < n; ++i) { if (s[i] == V ) { v[i] = 1; } else if (s[i] == K ) { k[n - 1 - i] = 1; } } vector<bool> bad(n + 1); vector<mint> vk = mul(v, k); for (int i = 0; i < 2 * n; ++i) { if (vk[i] != 0) { bad[abs(n - 1 - i)] = true; } } vector<int> ans; for (int i = 1; i <= n; ++i) { bool good = true; for (int j = i; j <= n; j += i) { good &= !bad[j]; } if (good) { ans.push_back(i); } } cout << ans.size() << n ; for (auto i : ans) { cout << i << ; } cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { string s; cin >> s; int len = s.size(); int ok = 1; for (int i = 0; i < len; i++) { if (i == len) { if (s[i - 1] != a ) s[i] = a ; else if (s[i - 1] != b ) s[i] = b ; else if (s[i - 1] != c ) s[i] = c ; } if (s[i] == ? && i != len) { if (s[i - 1] != a && s[i + 1] != a ) s[i] = a ; else if (s[i - 1] != b && s[i + 1] != b ) s[i] = b ; else if (s[i - 1] != c && s[i + 1] != c ) s[i] = c ; } } for (int i = 0; i < len - 1; i++) { if (s[i] == s[i + 1]) ok = 0; } if (!ok) cout << -1 << n ; else cout << s << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; while (scanf( %d%d , &n, &k) != EOF) { int i; for (i = 0; i <= n; i++) { if (i * 2 + (n - i) * 5 >= k && i * 2 + (n - i) * 3 <= k) break; } printf( %d n , i); } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<bool> used; vector<vector<int>> g; int dfs(int v) { if (used[v]) return 0; used[v] = true; int size = 1; for (int i = 0; i < g[v].size(); i++) size += dfs(g[v][i]); return size; } void Solve() { int n, m, k; scanf( %d%d%d , &n, &m, &k); g.assign(n, vector<int>()); vector<int> c(k); for (int i = 0; i < k; i++) { scanf( %d , &c[i]); c[i]--; } for (int i = 0; i < m; i++) { int u, v; scanf( %d%d , &u, &v); u--, v--; g[u].push_back(v); g[v].push_back(u); } used.assign(n, false); int answer = 0; int maxsize = 0; for (int i = 0; i < k; i++) { int size = dfs(c[i]); maxsize = max(maxsize, size); answer += size * (size - 1) / 2; } for (int i = 0; i < n; i++) { if (!used[i]) { int size = dfs(i); answer += size * (size - 1) / 2 + size * maxsize; maxsize += size; } } printf( %d , answer - m); } int main() { Solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, n, p; cin >> t; while (t--) { cin >> n; string s; cin >> s; int c = 0; for (int i = 0; i < n; i++) { if (s[i] == s[i + 1]) c++; } if (c == 1) cout << c << endl; else if (c % 2 != 0) { c /= 2; ++c; cout << c << endl; } else { c /= 2; cout << c << endl; } } }
|
#include <bits/stdc++.h> using namespace std; bool diverse(string x) { sort(x.begin(), x.end()); for (int i = 1; i < x.size(); i++) if (x[i] - x[i - 1] != 1) return 0; return 1; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int n; cin >> n; cin.ignore(256, n ); vector<string> in(n); for (int i = 0; i < n; i++) getline(cin, in[i], n ); for (int i = 0; i < n; i++) { if (diverse(in[i]) || in[i].size() == 1) cout << Yes << endl; else cout << No << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; set<int> inchat; set<int> inchat2; bool leaders[100005]; int id[100005]; char in[100005]; int main() { int N, M; scanf( %d %d , &N, &M); for (int i = 1; i <= N; i++) leaders[i] = true; for (int i = 0; i < M; i++) { scanf( %c %d n , &in[i], &id[i]); } for (int i = M - 1; i > 0; i--) { if (in[i] == - ) { inchat2.insert(id[i]); } else { auto it = inchat2.find(id[i]); if (it != inchat2.end()) { inchat2.erase(it); } } } for (int i = 0; i < M; i++) { if (in[i] == + ) { if (inchat.size() == 0 && (inchat2.size() == 0 || (inchat2.size() == 1 && *inchat2.begin() == id[i]))) { if (i == 0 || id[i - 1] == id[i]) { } else { leaders[id[i]] = false; } } else { leaders[id[i]] = false; } inchat.insert(id[i]); } else { if (inchat.size() == 0 || (inchat.size() == 1 && (*inchat.begin() == id[i]))) { if (inchat2.size() == 0 || (inchat2.size() == 1 && *inchat2.begin() == id[i])) { if (i == M - 1 || id[i + 1] == id[i]) { } else { leaders[id[i]] = false; } } else { leaders[id[i]] = false; } } else { leaders[id[i]] = false; } auto it = inchat.find(id[i]); if (it != inchat.end()) { inchat.erase(it); } } if (i != M - 1) { if (in[i + 1] == - ) { auto it = inchat2.find(id[i + 1]); if (it != inchat2.end()) { inchat2.erase(it); } } else { inchat2.insert(id[i + 1]); } } } int cnt = 0; for (int i = 1; i <= N; i++) { if (leaders[i]) { cnt++; } } printf( %d n , cnt); for (int i = 1; i <= N; i++) { if (leaders[i]) { printf( %d , i); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; pair<int, int> a[N]; pair<int, int> ra[N]; int ans[N]; pair<int, int> cross(pair<int, int> a, pair<int, int> b) { if (a > b) swap(a, b); return pair<int, int>(b.first, min(a.second, b.second)); } void solve() { ra[n] = pair<int, int>(a[n].first, a[n].first + a[n].second); for (int i = n - 1; i >= 1; i--) { ra[i] = cross(pair<int, int>(ra[i + 1].first - 1, ra[i + 1].second + 1), pair<int, int>(a[i].first, a[i].first + a[i].second)); if (ra[i].first > ra[i].second) { cout << -1 ; return; } } ans[1] = ra[1].second; for (int i = 2; i <= n; i++) { pair<int, int> cur = cross(pair<int, int>(ans[i - 1] - 1, ans[i - 1] + 1), ra[i]); ans[i] = cur.second; } long long sum = 0; for (int i = 1; i <= n; i++) sum += ans[i] - a[i].first; cout << sum << n ; for (int i = 1; i <= n; i++) cout << ans[i] << ; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d , &a[i].first, &a[i].second); solve(); }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.