func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); long long int a, b; cin >> a >> b; vector<long long int> m; vector<long long int> n; set<long long int> s; m.push_back(1); n.push_back(1); if (a == 1) s.insert(1); for (long long int i = 1; i <= b;) { i = i * 2; m.push_back(i); if (i >= a && i <= b) s.insert(i); } for (long long int i = 1; i <= b;) { i = i * 3; n.push_back(i); if (i >= a && i <= b) s.insert(i); } for (int i = 0; i < m.size(); i++) { for (int j = 0; j < n.size(); j++) { long long int x = m[i] * n[j]; if (x >= a && x <= b) { s.insert(x); } } } cout << s.size() << endl; } |
#include <bits/stdc++.h> using namespace std; void rd(int &x) { x = 0; int f = 1; char ch = (getchar()); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = (getchar()); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = (getchar()); x *= f; } const int N = 5e5 + 5; int n, m; int a[N], c[N], tmp[N]; priority_queue<int, vector<int>, greater<int> > Q; int main() { rd(n); long long ans = 0; for (int i = 1; i <= n; ++i) rd(a[i]), ans += a[i]; sort(a + 1, a + n + 1, greater<int>()); for (int i = 1; i <= n; ++i) { int j = i; a[++m] = a[i]; while (j <= n && a[j + 1] == a[i]) ++j; c[m] = j - i + 1, i = j; } n = m; int cnt = 0, tmp0 = 0; for (int i = 1; i <= n; ++i) { int res = min(cnt - 2 * (int)Q.size(), c[i]), ok = min(c[i] - res, cnt - res); tmp0 = 0; for (int j = 1; j <= res; ++j) tmp[++tmp0] = a[i]; for (int j = 1; j <= ok; j += 2) { int val = Q.top(); Q.pop(); if (val < a[i]) { tmp[++tmp0] = a[i]; if (ok - j) tmp[++tmp0] = a[i]; } else { tmp[++tmp0] = val; if (ok - j && 2 * a[i] - val > 0) tmp[++tmp0] = 2 * a[i] - val; } } for (int j = 1; j <= tmp0; ++j) Q.push(tmp[j]); cnt += c[i]; } while (!Q.empty()) ans -= Q.top(), Q.pop(); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, A[105], B[105], w, ans, tmp; int main() { scanf( %d , &n); n *= 2; for (int i = (0); i < (n); i++) scanf( %d , &A[i]); sort(A, A + n); ans = 123412345; for (int i = (0); i < (n); i++) for (int j = (i + 1); j < (n); j++) { w = 0; for (int k = (0); k < (n); k++) { if (k == i || k == j) continue; B[w++] = A[k]; } tmp = 0; for (int k = 0; k < w; k += 2) tmp += B[k + 1] - B[k]; ans = min(ans, tmp); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; vector<int> g[maxn]; int father[maxn]; int a[maxn]; int findfather(int x) { int a = x; while (x != father[x]) x = father[x]; while (a != father[a]) { int z = a; a = father[a]; father[z] = x; } return x; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); g[a[i]].push_back(i); } int wjm = n; for (int i = 1; i <= m; i++) father[i] = i; for (int i = 2; i <= n; i++) if (a[i - 1] == a[i]) wjm--; printf( %d n , wjm - 1); for (int i = 1; i < m; i++) { int x, y; scanf( %d%d , &x, &y); int faX = findfather(x); int faY = findfather(y); if (g[faX].size() > g[faY].size()) swap(faX, faY); for (int j : g[faX]) { if (j + 1 <= n && a[j + 1] == faY) wjm--; if (j - 1 >= 1 && a[j - 1] == faY) wjm--; g[faY].push_back(j); } for (int j : g[faX]) a[j] = faY; father[faX] = faY; printf( %d n , wjm - 1); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5, INF = 0x3f3f3f3f; int a[maxn]; int last[maxn]; int main() { int n; while (cin >> n) { memset(last, INF, sizeof(last)); for (int i = 0; i < n; i++) { cin >> a[i]; last[a[i]] = i; } sort(last, last + maxn); cout << a[last[0]] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char seat[10][1005]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int mark = 2000; int flag; for (int i = 0; i < n; i++) { cin >> seat[0][i] >> seat[1][i] >> seat[2][i] >> seat[3][i] >> seat[4][i]; if (seat[0][i] == O && seat[1][i] == O ) { mark = i; flag = 0; } if (seat[3][i] == O && seat[4][i] == O ) { mark = i; flag = 3; } } if (mark == 2000) cout << NO << endl; else { seat[flag][mark] = + ; seat[flag + 1][mark] = + ; cout << YES << endl; for (int i = 0; i < n; i++) { cout << seat[0][i] << seat[1][i] << seat[2][i] << seat[3][i] << seat[4][i] << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> dp[2001][26]; int q[2000]; pair<int, int> ans[2001][2001]; int nxt[2001][26]; pair<int, int> jump(pair<int, int> p, char c) { if (p.first < m) { p.second = dp[q[p.first]][c - a ][p.second]; if (p.second == -1) { p.first = nxt[p.first + 1][c - a ]; if (p.first < m) p.second = dp[q[p.first]][c - a ][0]; } } return p; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; ++i) { string s; cin >> s; for (int j = 0; j < 26; ++j) { dp[i][j].resize(s.size() + 1); dp[i][j][s.size()] = -1; for (int k = s.size() - 1; k >= 0; --k) dp[i][j][k] = s[k] == j + a ? k + 1 : dp[i][j][k + 1]; } } cin >> m; for (int i = 0; i < m; ++i) cin >> q[i], q[i]--; for (int i = 0; i < 26; ++i) { nxt[m][i] = m; for (int j = m - 1; j >= 0; --j) nxt[j][i] = dp[q[j]][i][0] == -1 ? nxt[j + 1][i] : j; } string s; cin >> s; for (int i = 0; i <= s.size(); ++i) for (int j = 0; j <= s.size(); ++j) ans[i][j] = make_pair(1e9, 1e9); ans[0][0] = make_pair(0, 0); for (int i = 1; i <= s.size(); ++i) for (int j = 0; j <= i; ++j) { ans[i][j] = min(ans[i][j], ans[i - 1][j]); if (j) ans[i][j] = min(ans[i][j], jump(ans[i - 1][j - 1], s[i - 1])); } for (int i = s.size(); i >= 0; --i) if (ans[s.size()][i].first < m) { cout << i << n ; break; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, a, ans, i, b[10000000]; string s, s1; int main() { cin >> n >> s; s1 = 0 ; s1 += s; s1 += 0 ; s = s1; a = s.find( 11 ); if (a < 10000) return cout << No , 0; a = s.find( 000 ); if (a < 10000) return cout << No , 0; cout << Yes ; } |
#include <bits/stdc++.h> const long double eps = 1e-9; const double pi = acos(-1.0); const long long inf = 1e18; using namespace std; int a[33], b[33], p[33], k[33], n, r, u, tt[33], z[33], back[33]; int cnt = 0; long long ans = -inf; void update(int step) { int left = (u - step) % 2; long long now = 0; if (left == 0) for (int i = 1; i <= n; i++) now += 1ll * k[i] * a[i]; if (left == 1) for (int i = 1; i <= n; i++) now += 1ll * k[i] * (a[i] ^ b[i]); ans = max(ans, now); } void rec(int pos) { if (pos == u + 1) return; for (int i = ((z[pos - 1] + 1) & 1); i < 2; i++) { z[pos] = i; if (i == 0) { for (int i = 1; i <= n; i++) a[i] = a[i] ^ b[i]; } if (i == 1) { for (int i = 1; i <= n; i++) tt[i] = a[p[i]]; for (int i = 1; i <= n; i++) a[i] = tt[i] + r; } update(pos); rec(pos + 1); if (i == 0) { for (int i = 1; i <= n; i++) a[i] = a[i] ^ b[i]; } if (i == 1) { for (int i = 1; i <= n; i++) tt[i] = a[back[i]]; for (int i = 1; i <= n; i++) a[i] = tt[i] - r; } } } int main(int argc, const char* argv[]) { cin >> n >> u >> r; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; for (int i = 1; i <= n; i++) cin >> k[i]; for (int i = 1; i <= n; i++) cin >> p[i]; for (int i = 1; i <= n; i++) back[p[i]] = i; z[0] = 1; rec(1); cout << ans; return 0; } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; using namespace std; void file(bool opt) { if (opt && fopen( in.txt , r )) freopen( in.txt , r , stdin), freopen( out.txt , w , stdout); } struct node { double x, y; } point[100000 + 5], tu[100000 + 5]; int tot = 0; int n; double multi(node p0, node p1, node p2) { return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y); } double dis(node a, node b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } bool cmp(node a, node b) { double x = multi(a, b, point[1]); if (x > 0 || (x == 0 && dis(a, point[1]) < dis(b, point[1]))) return 1; return 0; } void Graham() { int k = 1; for (int i = 1; i <= n; i++) if (point[i].y < point[k].y || (point[i].y == point[k].y && point[i].x < point[k].x)) k = i; swap(point[1], point[k]); sort(point + 2, point + 1 + n, cmp); tot = 2, tu[1] = point[1], tu[2] = point[2]; for (int i = 3; i <= n; i++) { while (tot >= 1 && multi(tu[tot], tu[tot - 1], point[i]) >= 0) tot--; tu[++tot] = point[i]; } } int main() { file(1); scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %lf%lf , &point[i].x, &point[i].y); point[i].y = point[i].y - point[i].x * point[i].x; } if (n == 1) { puts( 0 ); return 0; } Graham(); int ans = 0; for (int i = 1; i <= tot; i++) { node a = tu[i], b = tu[(i + 1) > tot ? 1 : (i + 1)], c = {0, (long long)1e15}; if (a.x != b.x) { double x = multi(a, b, c); if (x < 0) ans++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; namespace Work { const int kMaxN = 100010; multiset<int> set; int n; int a[kMaxN], b[kMaxN]; int pos[kMaxN]; void solve(FILE* fin, FILE* fout) { fscanf(fin, %d , &n); for (int i = 1; i <= n; i++) { fscanf(fin, %d , a + i); pos[a[i]] = i; } for (int i = 1; i <= n; i++) { fscanf(fin, %d , b + i); set.insert(i - pos[b[i]]); } multiset<int>::iterator it = set.lower_bound(0); int x = *it, y = x; if (it != set.begin()) { it--; y = *it; } fprintf(fout, %d n , min(abs(x), abs(y))); for (int dt = 1; dt < n; dt++) { set.erase(set.find(dt - pos[b[dt]])); set.insert(n - pos[b[dt]] + dt); it = set.lower_bound(dt); x = *it, y = x; if (it != set.begin()) { it--; y = *it; } fprintf(fout, %d n , min(abs(x - dt), abs(y - dt))); } return; } } // namespace Work int main() { Work::solve(stdin, stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string x, y; cin >> x >> y; int sum = atoi(x.c_str()) + atoi(y.c_str()); int p = 0, now = 1; for (; sum; sum /= 10) { if (sum % 10 != 0) { p += (sum % 10) * now; now *= 10; } } x.erase(remove(x.begin(), x.end(), 0 ), x.end()); y.erase(remove(y.begin(), y.end(), 0 ), y.end()); int X = atoi(x.c_str()), Y = atoi(y.c_str()); if (X + Y == p) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > vec(n); vector<int> x(n); vector<int> y(n); for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; vec[i].first = x[i]; vec[i].second = y[i]; } long long ans = 0; sort(x.begin(), x.end()); long long count = 1; for (int i = 1; i < n; i++) { if (x[i] != x[i - 1]) { ans += (count * (count - 1)) / 2; count = 0; } count++; } ans += (count * (count - 1)) / 2; sort(y.begin(), y.end()); count = 1; for (int i = 1; i < n; i++) { if (y[i] != y[i - 1]) { ans += (count * (count - 1)) / 2; count = 0; } count++; } ans += (count * (count - 1)) / 2; sort(vec.begin(), vec.end()); count = 1; for (int i = 1; i < n; i++) { if (vec[i].first != vec[i - 1].first || vec[i].second != vec[i - 1].second) { ans -= (count * (count - 1)) / 2; count = 0; } count++; } ans -= (count * (count - 1)) / 2; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; int ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { int a; cin >> a; if (i == j || i + j == n - 1 || i == n / 2 || j == n / 2) ans += a; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 1) cout << -1 << n ; else cout << n << << n + 1 << << n * 1LL * (n + 1) << n ; } |
#include <bits/stdc++.h> using namespace std; vector<string> split(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.emplace_back(x); return move(v); } void err(vector<string>::iterator it) {} template <typename T, typename... Args> void err(vector<string>::iterator it, T a, Args... args) { cerr << it->substr((*it)[0] == , it->length()) << = << a << n ; err(++it, args...); } int check(int x, int l) { return x >= 0 && x < l; } int solve(vector<string> board, string per, string comm) { int startx, starty, endx, endy; int r, c; r = board.size(); c = board[0].size(); for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { if (board[i][j] == S ) { startx = i; starty = j; } else if (board[i][j] == E ) { endx = i; endy = j; } } } int cx, cy; cx = startx; cy = starty; int i = 0; while (check(cx, r) && check(cy, c)) { int t = comm[i] - 0 ; i++; if (i > comm.length()) return 0; if (per[t] == U ) cy--; else if (per[t] == D ) cy++; else if (per[t] == L ) cx--; else if (per[t] == R ) cx++; if (!check(cx, r) || !check(cy, c)) return 0; if (board[cx][cy] == E ) return 1; if (board[cx][cy] == # ) return 0; } return 0; } int main() { int n, m; cin >> n >> m; vector<string> board; string comm; for (int i = 0; i < n; i++) { string temp; cin >> temp; board.push_back(temp); } cin >> comm; string per = DLRU ; int ans = 0; while (1) { ans += solve(board, per, comm); bool x = next_permutation(per.begin(), per.end()); if (!x) break; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long oo = 1e16; template <class P> P gcd(P a, P b) { return b ? gcd(b, a % b) : a; }; long long read() { char c = getchar(); long long d = 0, f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; d = d * 10 + c - 48, c = getchar()) ; return d * f; } const int N = 100001; const int M = 400001; const int mod = 1e9 + 7; int n, m, cnt, cyc_amount, head[N]; long long cyc_tot, ans, qz[N], _m2[201], record[62], f[62][2]; bool exist[N]; struct xint { int to, next; long long s; } e[M]; inline void addedge(int x, int y, long long s) { e[++cnt].to = y; e[cnt].next = head[x]; e[cnt].s = s; head[x] = cnt; } inline void dfs(int fa, int x, long long s) { exist[x] = 1; for (int i = 0; i <= 61; i++) f[i][s >> i & 1]++; qz[x] = s; for (int i = head[x]; i; i = e[i].next) { int y = e[i].to; if (y == fa) continue; if (!exist[y]) dfs(x, y, s ^ e[i].s); else { long long t = qz[x] ^ qz[y] ^ e[i].s; cyc_tot |= t; for (int i = 61; i >= 0; i--) { if ((t & (1LL << i)) && !record[i]) { record[i] = t; cyc_amount++; break; } t = min(t, t ^ record[i]); } } } } int main() { n = read(), m = read(); for (int i = 1; i <= n; i++) exist[i] = 1; for (int i = 1; i <= m; i++) { int x = read(), y = read(); long long s = read(); exist[x] = exist[y] = 0; addedge(x, y, s); addedge(y, x, s); } _m2[0] = 1; for (int i = 1; i <= 200; i++) _m2[i] = _m2[i - 1] * 2 % mod; for (int i = 1; i <= n; i++) if (!exist[i]) { cyc_amount = cyc_tot = 0; for (int j = 0; j <= 61; j++) f[j][0] = f[j][1] = record[j] = 0; memset(qz, 0, sizeof qz); dfs(0, i, 0); for (int j = 0; j <= 61; j++) if (cyc_tot & (1LL << j)) ans = (ans + (f[j][0] + f[j][1]) * (f[j][0] + f[j][1] - 1) / 2 % mod * _m2[j + cyc_amount - 1] % mod) % mod; else ans = (ans + f[j][0] * f[j][1] % mod * _m2[j + cyc_amount] % mod) % mod; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxRounds = 200000; double p[110], ans, pw[110][maxRounds + 10]; int times[110], n; int main() { cin >> n; if (n == 1) { cout << 1; return 0; } for (int i = 1; i <= n; ++i) { int first; cin >> first; p[i] = first / 100.0; } double initProd = 1; for (int i = 1; i <= n; ++i) { initProd *= p[i]; pw[i][0] = 1; times[i] = 1; for (int j = 1; j <= maxRounds; ++j) { pw[i][j] = pw[i][j - 1] * (1 - p[i]); } } ans += initProd * n; for (int round = n + 1; round <= maxRounds; ++round) { double best = 0; int besti = 1; double prod = 1; for (int j = 1; j <= n; ++j) prod *= (1 - pw[j][times[j]]); for (int j = 1; j <= n; ++j) { double current = prod / (1 - pw[j][times[j]]) * pw[j][times[j]] * p[j]; if (current > best) { besti = j; best = current; } } ans += best * round; times[besti]++; } cout << fixed << setprecision(8) << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, maxx = 2, s = 1, k = 1; cin >> n; vector<int> a(n); for (i = 0; i < n; i++) cin >> a[i]; a.push_back(0); for (i = 0; i < n; i++) { if (i > 0 && s > 1 && a[i] == 1 && a[i - 1] == 2) s = 1; if (i > 0 && k > 1 && a[i] == 2 && a[i - 1] == 1) k = 1; if (a[i] == 1 && a[i + 1] == 1) s += 1; else if (min(k, s) * 2 > maxx) maxx = min(k, s) * 2; if (a[i] == 2 && a[i + 1] == 2) k += 1; else if (min(k, s) * 2 > maxx) maxx = min(k, s) * 2; } cout << maxx; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, f, k; scanf( %lld %lld %lld %lld , &a, &b, &f, &k); long long ans = 0; long long cfuel = b; for (int i = 0; i < k - 1; i++) { if (i % 2 == 0) { if (cfuel >= 2 * a - f) { cfuel -= a; } else if (cfuel >= f && b >= a - f) { ans++; cfuel = b - (a - f); } else { printf( -1 n ); return 0; } } else { if (cfuel >= a + f) { cfuel -= a; } else if (cfuel >= a - f && b >= f) { ans++; cfuel = b - f; } else { printf( -1 n ); return 0; } } } if (k % 2) { if (cfuel >= a) { } else if (cfuel >= f && b >= a - f) { ans++; } else { printf( -1 n ); return 0; } } else { if (cfuel >= a) { } else if (cfuel >= a - f && b >= f) { ans++; } else { printf( -1 n ); return 0; } } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; void rs(int &x) { scanf( %d , &x); } void rsl(long long &x) { scanf( %I64d , &x); } void rsd(double &x) { scanf( %lf , &x); } void rss(char *str) { scanf( %s , str); } void ws(int &x) { printf( %d , x); } void wsl(long long &x) { printf( %I64d , x); } void wsd(double &x) { printf( %lf , x); } void wss(char *str) { printf( %s , str); } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } int const N = (2e5) + 5; int const mod = (1e9) + 7; int a[N], t[N], suma[N], sumt[N]; priority_queue<int> que; set<pair<int, int>> ms, mns; map<int, int> mm; int ins[N], inns[N]; int main() { int n, w, k; cin >> n >> w >> k; for (int i = 1; i <= n; ++i) { cin >> a[i]; suma[i] = suma[i - 1] + a[i]; } for (int i = 1; i <= n; ++i) { cin >> t[i]; mm[t[i]] = i; sumt[i] = sumt[i - 1] + t[i]; } int ans = 0; int r = 1; int ct = 0; int cp = 0; for (int i = 1; i <= n; ++i) { r = max(r, i); while (r <= n) { int dt = 0; if (ms.size() < w) { dt = t[r] / 2 + t[r] % 2; if (ct + dt <= k) { ms.insert(make_pair(t[r], r)); ins[r] = 1; ct += dt; } else { break; } } else { int var = ms.begin()->first; if (t[r] > var) { int dt = t[r] / 2 + t[r] % 2; int ddt = (var / 2); if (ct + dt + ddt <= k) { ins[ms.begin()->second] = 0; ins[r] = 1; mns.insert(*ms.begin()); ms.erase(ms.begin()); ms.insert(make_pair(t[r], r)); ct += dt + ddt; } else { break; } } else { int dt = t[r]; if (ct + dt <= k) { ct += dt; mns.insert(make_pair(t[r], r)); } else { break; } } } r++; } ans = max(suma[r - 1] - suma[i - 1], ans); if (ins[i] == 0) { ct -= t[i]; } else { ct -= (t[i] / 2 + t[i] % 2); ins[i] = 0; set<pair<int, int>>::iterator it = ms.find(make_pair(t[i], i)); if (it != ms.end()) { ms.erase(it); } while (mns.size() > 0 && ((--mns.end())->second <= i)) { mns.erase(--mns.end()); } if (mns.size() > 0) { it = --mns.end(); ct -= ((it->first) / 2); ins[it->second] = 1; ms.insert(*(--mns.end())); mns.erase((--mns.end())); } } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int generateb(int a, long int nos[], long int noa[], long int nob[]) { int i, minb = 100002; for (i = 0; i < 26; i++) { nos[i] = nos[i] - (noa[i] * a); } for (i = 0; i < 26; i++) { if (nob[i] != 0) { if (nos[i] / nob[i] < minb) { minb = nos[i] / nob[i]; } } } return minb; } int generatea(int b, long int nos[], long int noa[], long int nob[]) { int i, mina = 100002; for (i = 0; i < 26; i++) { nos[i] = nos[i] - (nob[i] * b); } for (i = 0; i < 26; i++) { if (noa[i] != 0) { if (nos[i] / noa[i] < mina) { mina = nos[i] / noa[i]; } } } return mina; } int main() { char s[100010], a[100010], b[100010]; long int nos[26] = {0}, i, lens = 0, noa[26] = {0}, nob[26] = {0}, lena = 0, lenb = 0, j, nos1[26] = {0}, mina = 100002, counta, countb, max = -1, maxa, maxb, minb = 100002, r; cin >> s >> a >> b; for (i = 0; s[i] != 0 ; i++) { nos[s[i] - a ]++; lens++; } for (j = 0; j < 26; j++) { nos1[j] = nos[j]; } for (i = 0; a[i] != 0 ; i++) { noa[a[i] - a ]++; lena++; } for (i = 0; b[i] != 0 ; i++) { nob[b[i] - a ]++; lenb++; } for (i = 0; i < 26; i++) { if (noa[i] != 0) { if (nos[i] / noa[i] < mina) { mina = nos[i] / noa[i]; } } } for (i = 0; i <= mina; i++) { countb = generateb(i, nos, noa, nob); for (j = 0; j < 26; j++) { nos[j] = nos1[j]; } if (i + countb > max) { max = i + countb; maxa = i; maxb = countb; } } for (i = 0; i < 26; i++) { if (nob[i] != 0) { if (nos[i] / nob[i] < minb) { minb = nos[i] / nob[i]; } } } for (i = 0; i <= minb; i++) { counta = generatea(i, nos, noa, nob); for (j = 0; j < 26; j++) { nos[j] = nos1[j]; } if (i + counta > max) { max = i + counta; maxb = i; maxa = counta; } } for (i = 0; i < maxa; i++) { cout << a; } for (i = 0; i < maxb; i++) { cout << b; } for (i = 0; i < 26; i++) { nos[i] = nos[i] - (maxa * noa[i]) - (maxb * nob[i]); } for (i = 0; i < 26; i++) { for (j = 0; j < nos[i]; j++) { cout << char(i + a ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; #define F first #define S second #define rep(i, a, b) for(int i = a; i < (b); ++i) #define per(i, a, b) for(int i = b-1; i>=a ; i--) #define trav(a, x) for(auto& a : x) #define allin(a , x) for(auto a : x) #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() typedef long long ll; typedef pair<int, int> pii; typedef vector<ll> vl; typedef vector<pii> vpi; typedef pair<ll,ll> pll; typedef vector<string> vs; typedef vector<pll> vpl; typedef vector<int> vi; std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count()); int ask(int x , int i , vi v){ cout << 2 << << x << << i << ; for(int j = 0 ; j < i ; j ++){ cout << v[j] << ; } cout << endl; int ans; cin >> ans; return ans; } int32_t main(){ int t; cin >> t; while(t--){ int n; cin >> n; vector<int> v; for(int i = 0 ; i < n; i ++) v.push_back(i); stable_sort(all(v) , [&](int a , int b){ cout << 1 << << a << << b << endl; int ans; cin >> ans; return ans; }); vector< vector<char> > ans(n, vector<char>(n, 0 )); for(int i = 0 ; i < n ; i ++){ for(int j = i ; j < n; j ++){ ans[v[i]][v[j]] = 1 ; } } int pr = n-1; vector< vector<int> > g(n); for(int i = 0 ; i < n - 1; i ++) g[v[i]].push_back(v[i+1]); for(int i = n - 1 ; i >= 0 ; i --){ pr = min(pr, i); while(pr > 0 && ask(v[i] , pr , v)){ pr -- ; } g[v[i]].push_back(v[pr]); } vector< vector<bool> > vis(n , vector<bool> (n)); for(int i = 0 ; i< n; i ++){ queue<int> q; q.push(i); while(sz(q)){ auto u = q.front(); q.pop(); if(vis[i][u]) continue; vis[i][u] = true; for(auto w : g[u]) if(!vis[i][w]) q.push(w); } } cout << 3 << endl; for(int i = 0; i < n; i ++){ for(int j = 0; j < n; j ++) cout << (vis[i][j] ? 1 : 0); cout << endl; } int ansx; cin >> ansx; assert(ansx != -1); } exit(0); } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int maxn = 100086; const double PI = atan(1.0) * 4.0; const double eps = 1e-9; const long long mod = 1000000007; const int maxe = 10086 * 2; long long quick_pow(long long a, long long n) { long long ret = 1; while (n) { if (n & 1) ret = ret * a % mod; a = a * a % mod; n >>= 1; } return ret; } char s[maxn]; int n, num[5]; int main() { scanf( %d%s , &n, s); memset(num, 0, sizeof num); for (int i = 0; i < n; i++) { if (s[i] == A ) num[0]++; else if (s[i] == G ) num[1]++; else if (s[i] == T ) num[2]++; else num[3]++; } int maxx = -1; for (int i = 0; i < 4; i++) maxx = max(maxx, num[i]); int a = 0; for (int i = 0; i < 4; i++) if (maxx == num[i]) a++; cout << quick_pow(a, n) << endl; } |
#include <bits/stdc++.h> using namespace std; const int mo = 1e9 + 7; struct node { int mat[210][210]; } qwq; int n, k, m; inline int ha(int x, int y) { return x * (1 << m) + y; } node ksm(int l) { if (l == 1) return qwq; node op = ksm(l / 2), op2; memset(op2.mat, 0, sizeof(op2.mat)); for (int i = 0; i < (k + 1) * (1 << m); i++) for (int j = 0; j < (k + 1) * (1 << m); j++) for (int h = 0; h < (k + 1) * (1 << m); h++) op2.mat[i][j] = (op2.mat[i][j] + 1ll * op.mat[i][h] * op.mat[h][j]) % mo; if (l % 2 == 0) return op2; node op3; memset(op3.mat, 0, sizeof(op3.mat)); for (int i = 0; i < (k + 1) * (1 << m); i++) for (int j = 0; j < (k + 1) * (1 << m); j++) for (int h = 0; h < (k + 1) * (1 << m); h++) op3.mat[i][j] = (op3.mat[i][j] + 1ll * qwq.mat[i][h] * op2.mat[h][j]) % mo; return op3; } int main() { scanf( %d%d%d , &n, &k, &m); for (int i = 0; i <= k; i++) for (int j = 0; j < (1 << m); j++) { int ovo = (j << 1) % (1 << m); qwq.mat[ha(i, ovo)][ha(i, j)]++; if (i > 0) { int way_to_here = 1; for (int r = 0; r < m; r++) if ((1 << r) & j) way_to_here++; qwq.mat[ha(i, ovo | 1)][ha(i - 1, j)] += way_to_here; } } node uoj = ksm(n); int ans = 0; for (int i = 0; i < (1 << m); i++) ans = (ans + 1ll * uoj.mat[ha(k, i)][0]) % mo; printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MN = 2011; int n, a[MN]; vector<int> ls[MN]; void solve1(int u) { cout << YES << endl; for (int turn = 0, _a = (3); turn < _a; turn++) { for (int i = (1), _b = (2000); i <= _b; i++) { if (i != u) { for (int x = 0, _a = (ls[i].size()); x < _a; x++) cout << ls[i][x] << ; } else { if (turn == 0) cout << ls[i][0] << << ls[i][1] << << ls[i][2] << ; else if (turn == 1) cout << ls[i][0] << << ls[i][2] << << ls[i][1] << ; else cout << ls[i][1] << << ls[i][0] << << ls[i][2] << ; for (int x = (3), _b = (ls[i].size() - 1); x <= _b; x++) cout << ls[i][x] << ; } } cout << endl; } } void solve2(int u, int v) { cout << YES << endl; for (int turn = 0, _a = (3); turn < _a; turn++) { for (int i = (1), _b = (2000); i <= _b; i++) { if (i != u && i != v) { for (int x = 0, _a = (ls[i].size()); x < _a; x++) cout << ls[i][x] << ; } else if (i == u) { if (turn == 0) cout << ls[i][0] << << ls[i][1] << ; else if (turn == 1) cout << ls[i][0] << << ls[i][1] << ; else cout << ls[i][1] << << ls[i][0] << ; for (int x = (2), _b = (ls[i].size() - 1); x <= _b; x++) cout << ls[i][x] << ; } else if (i == v) { if (turn == 0) cout << ls[i][0] << << ls[i][1] << ; else if (turn == 1) cout << ls[i][1] << << ls[i][0] << ; else cout << ls[i][1] << << ls[i][0] << ; for (int x = (2), _b = (ls[i].size() - 1); x <= _b; x++) cout << ls[i][x] << ; } } cout << endl; } } int main() { ios ::sync_with_stdio(false); while (cin >> n) { for (int i = (1), _b = (n); i <= _b; i++) cin >> a[i]; for (int i = (0), _b = (2000); i <= _b; i++) ls[i].clear(); for (int i = (1), _b = (n); i <= _b; i++) { ls[a[i]].push_back(i); } bool ok = false; for (int i = (0), _b = (2000); i <= _b; i++) if (ls[i].size() >= 3) { solve1(i); ok = true; break; } if (ok) continue; for (int i = (1), _b = (2000); i <= _b; i++) { for (int j = (i + 1), _b = (2000); j <= _b; j++) if (ls[i].size() >= 2 && ls[j].size() >= 2) { solve2(i, j); ok = true; break; } if (ok) break; } if (!ok) cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5; const int sqrtN = 320; int countA[sqrtN], countP[sqrtN]; map<int, int> dm[sqrtN]; void recomp(int ind) { int a, p; a = p = 0; for (auto& x : dm[ind]) { if (x.second != -1) { if (p != 0) p--; else (a++); } else { p++; } } countA[ind] = a; countP[ind] = p; } int getTop(int ind, int p) { for (auto& x : dm[ind]) { if (x.second != -1) { if (p != 0) p--; else return x.second; } else { p++; } } } int top() { int p = 0; for (int i = 0; i < sqrtN; ++i) { if (p - countA[i] < 0) return getTop(i, p); p += countP[i] - countA[i]; } return -1; } const long long mod = 1e9 + 7; long long sums(long long a, long long b) { long long ans = a + b; if (ans >= mod) ans -= mod; return ans; } long long mins(long long a, long long b) { long long ans = a - b; if (ans < 0) ans += mod; return ans; } int p = 31; long long nextH(long long h, char a) { return h * p + (a - a ) + 1; } int last[26], sum[5010] = {0}, f[5010] = {0}; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string str; cin >> str; f[0] = 1; for (int step = 0; step < n; ++step) { for (int i = 0; i < 26; ++i) last[i] = -1; sum[0] = 0; for (int i = 0; i < n; ++i) sum[i + 1] = sums(sum[i], f[i]); for (int i = 0; i < n; ++i) { f[i] = mins(sum[i + 1], sum[last[str[i] - a ] + 1]); last[str[i] - a ] = i; } } int ans = 0; for (int i = 0; i < n; ++i) ans = sums(ans, f[i]); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) int ah = 911382323; int bh = 972663749; template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; typename vector<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << } ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; typename set<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename F, typename S> ostream &operator<<(ostream &os, const map<F, S> &v) { os << [ ; typename map<F, S>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } long long dx[8] = {1, -1, 0, 0, 1, 1, -1, -1}; long long dy[8] = {0, 0, 1, -1, 1, -1, 1, -1}; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long(t); cin >> (t); while ((t)--) { long long n; cin >> n; vector<long long> v(n); for (long long i = 0; i < n; i++) cin >> v[i]; long long ind = 0; while (ind < n && v[ind] == 1) ind++; if (ind == n) { if (n % 2) cout << ( First ) << n ; else cout << ( Second ) << n ; } else { if (ind % 2 == 0) cout << ( First ) << n ; else cout << ( Second ) << n ; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6; int cost[N], n, a, b, T; string s; long long l[N], r[N]; bool check(int d) { --d; long long bst = min(l[d], r[d]); for (int i = 1; i < d; ++i) { bst = min(bst, l[i] + r[d - i] + a * i); bst = min(bst, r[i] + l[d - i] + a * i); } return bst + d + 1 + cost[0] <= T; } int main() { ios_base::sync_with_stdio(0); cin >> n >> a >> b >> T; cin >> s; for (int i = 0; i < s.size(); ++i) { cost[i] = (s[i] == w ? b : 0); } for (int i = 1; i < n; ++i) { r[i] = r[i - 1] + cost[i] + a; } for (int i = 1; i < n; ++i) { l[i] = l[i - 1] + cost[n - i] + a; } int L = 0, R = n + 1; while (R - L > 1) { int m = (L + R) >> 1; if (check(m)) L = m; else R = m; } cout << L; return 0; } |
#include <bits/stdc++.h> using namespace std; int a, s, d, f, g, h, j, k, l, i, n, m; string x[2], z[2]; char c; int dfs(int i1, int i2, int tri) { if (x[0] == z[0] && x[1] == z[1]) { return 1; } if (tri < 0) return 0; int ret = 0; if (i1 < 1) { c = x[i1][i2]; x[i1][i2] = x[i1 + 1][i2]; x[i1 + 1][i2] = c; ret = dfs(i1 + 1, i2, tri - 1); c = x[i1][i2]; x[i1][i2] = x[i1 + 1][i2]; x[i1 + 1][i2] = c; } if (i1 > 0) { c = x[i1][i2]; x[i1][i2] = x[i1 - 1][i2]; x[i1 - 1][i2] = c; ret |= dfs(i1 - 1, i2, tri - 1); c = x[i1][i2]; x[i1][i2] = x[i1 - 1][i2]; x[i1 - 1][i2] = c; } if (i2 < 1) { c = x[i1][i2]; x[i1][i2] = x[i1][i2 + 1]; x[i1][i2 + 1] = c; ret |= dfs(i1, i2 + 1, tri - 1); c = x[i1][i2]; x[i1][i2] = x[i1][i2 + 1]; x[i1][i2 + 1] = c; } if (i2 > 0) { c = x[i1][i2]; x[i1][i2] = x[i1][i2 - 1]; x[i1][i2 - 1] = c; ret |= dfs(i1, i2 - 1, tri - 1); c = x[i1][i2]; x[i1][i2] = x[i1][i2 - 1]; x[i1][i2 - 1] = c; } return 0 | ret; } int main() { cin >> x[0] >> x[1] >> z[0] >> z[1]; for (i = 0; i < 2; i++) { for (a = 0; a < 2; a++) { if (x[i][a] == X ) { l = i; j = a; } } } if (dfs(l, j, 20) != 0) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; long long a(-1), b(-1), ans(INT_MAX), tempA, tempB; for (int i = 0;; i++) { if (i * 7 > n) { break; } if ((n - i * 7) % 4 == 0) { tempA = (n - i * 7) / 4; tempB = i; if (tempA + tempB < ans) { a = tempA; b = tempB; ans = a + b; } } } if (a == -1 && b == -1) { cout << -1 << endl; } else { for (int i = 0; i < a; i++) { cout << 4; } for (int i = 0; i < b; i++) { cout << 7; } cout << n ; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.precision(8); long long t(1); while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans; int n, a, b; vector<pair<int, int> > v; int main() { ans = 0; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d %d , &a, &b); v.push_back(make_pair(b, a)); } sort(v.begin(), v.end()); for (int i = 0, j = 0; i < v.size(); ++i) { if (v[i].second > j) { j = v[i].first; ++ans; } } printf( %I64d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using cd = complex<double>; const double PI = acos(-1); int reverse(int num, int lg_n) { int res = 0; for (int i = 0; i < lg_n; i++) { if (num & (1 << i)) res |= 1 << (lg_n - 1 - i); } return res; } void fft(vector<cd> &a, bool invert) { int n = a.size(); int lg_n = 0; while ((1 << lg_n) < n) lg_n++; for (int i = 0; i < n; i++) { if (i < reverse(i, lg_n)) swap(a[i], a[reverse(i, lg_n)]); } for (int len = 2; len <= n; len <<= 1) { double ang = 2 * PI / len * (invert ? -1 : 1); cd wlen(cos(ang), sin(ang)); for (int i = 0; i < n; i += len) { cd w(1); for (int j = 0; j < len / 2; j++) { cd u = a[i + j], v = a[i + j + len / 2] * w; a[i + j] = u + v; a[i + j + len / 2] = u - v; w *= wlen; } } } if (invert) { for (cd &x : a) x /= n; } } vector<int> mult(vector<cd> &a, vector<cd> &b) { vector<cd> fa(a.begin(), a.end()), fb(b.begin(), b.end()); int n = 1; while (n < a.size() + b.size()) n <<= 1; fa.resize(n); fb.resize(n); fft(fa, false); fft(fb, false); for (int i = 0; i < n; i++) fa[i] *= fb[i]; fft(fa, true); vector<int> result(n); for (int i = 0; i < n; i++) { result[i] = round(fa[i].real()); } return result; } long long mdp[1000010]; void crive() { for (long long i = 2; i <= 1000000; i++) { if (mdp[i] == 0) { mdp[i] = i; for (long long j = i * i; j <= 1000000; j += i) { if (mdp[j] == 0) mdp[j] = i; } } } } vector<long long> div(int l) { vector<long long> ans = {1}; int sz = 1; while (l > 1) { long long p = mdp[l]; long long it = p; while (l % it == 0) { for (int j = 0; j < sz; j++) ans.push_back(it * ans[j]); it *= p; } it /= p; sz = ans.size(); l /= it; } sort(ans.begin(), ans.end()); return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); crive(); long long n, x, y; cin >> n >> x >> y; vector<cd> a(x + 1), b(x + 1); for (int i = 0; i < n + 1; i++) { int num; cin >> num; a[x - num] = 1; b[num] = 1; } vector<int> c = mult(a, b); int q; cin >> q; for (int i = 0; i < q; i++) { int l; cin >> l; vector<long long> d = div(l); long long resp = -1; for (int i = d.size() - 1; i >= 0 && d[i] > 2 * y; i--) { long long u = d[i]; if (u & 1) continue; if ((u - 2 * y) / 2 + x < c.size() && c[(u - 2 * y) / 2 + x]) resp = u, i = -1; } cout << resp << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; struct segtree { int n; vector<long long> tree; void init(int s) { n = s; tree.resize(4 * s); } long long qry(int i, int j) { return qry(i, j, 1, 0, n - 1); } void upd(int i, long long v) { upd(i, v, 1, 0, n - 1); } long long qry(int i, int j, int x, int nowi, int nowj) { if (i <= nowi && nowj <= j) return tree[x]; if (nowi > j || nowj < i) return 0; int m = (nowi + nowj) / 2; return qry(i, j, 2 * x, nowi, m) + qry(i, j, 2 * x + 1, m + 1, nowj); } void upd(int i, long long v, int x, int nowi, int nowj) { if (nowi == i && nowj == i) { tree[x] = v; return; } if (nowi > i || nowj < i) return; int m = (nowi + nowj) / 2; upd(i, v, 2 * x, nowi, m); upd(i, v, 2 * x + 1, m + 1, nowj); tree[x] = tree[2 * x] + tree[2 * x + 1]; } }; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, ans = 0; cin >> n; n *= 2; vector<int> a(n), p(n + 1, -1), v(n + 1); for (auto &i : a) cin >> i; for (int i = 0; i < n; ++i) { if (p[a[i]] == -1) p[a[i]] = i; v[i] = p[a[i]]; } segtree s; s.init(n); for (int i = n - 1; ~i; --i) { s.upd(v[i], 1); if (v[i]) ans += s.qry(0, v[i] - 1); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int N, K; vector<int> arr; struct Query { int l, r, p, q; }; vector<Query> query, tmp; vector<vector<long long> > dp; vector<int> cnt; int lpos, rpos; long long cost; void solve(int k) { query.push_back({0, N - 1, 0, N - 1}); while (query.size()) { cnt = vector<int>(N, 0); lpos = rpos = cost = 0; tmp.clear(); for (int i = 0; i < query.size(); i++) { int l = query[i].l; int r = query[i].r; int p = query[i].p; int q = query[i].q; if (l > r) continue; int m = (l + r) >> 1; int a = q; dp[k][m] = 1e18; while (rpos < max(m + 1, p)) { cost -= 1LL * cnt[arr[rpos]] * (cnt[arr[rpos]] - 1) / 2; cnt[arr[rpos]]++; cost += 1LL * cnt[arr[rpos]] * (cnt[arr[rpos]] - 1) / 2; rpos++; } while (rpos > max(m + 1, p)) { rpos--; cost -= 1LL * cnt[arr[rpos]] * (cnt[arr[rpos]] - 1) / 2; cnt[arr[rpos]]--; cost += 1LL * cnt[arr[rpos]] * (cnt[arr[rpos]] - 1) / 2; } while (lpos < m) { cost -= 1LL * cnt[arr[lpos]] * (cnt[arr[lpos]] - 1) / 2; cnt[arr[lpos]]--; cost += 1LL * cnt[arr[lpos]] * (cnt[arr[lpos]] - 1) / 2; lpos++; } for (int i = max(m + 1, p); i <= q; i++) { if (dp[k][m] > dp[k - 1][i] + cost) { dp[k][m] = dp[k - 1][i] + cost; a = i; } cost -= 1LL * cnt[arr[rpos]] * (cnt[arr[rpos]] - 1) / 2; cnt[arr[rpos]]++; cost += 1LL * cnt[arr[rpos]] * (cnt[arr[rpos]] - 1) / 2; rpos++; } tmp.push_back({l, m - 1, p, a}); tmp.push_back({m + 1, r, a, q}); } query = tmp; } } int main() { scanf( %d %d , &N, &K); arr.resize(N); for (int i = 0; i < N; i++) { scanf( %d , &arr[i]); arr[i]--; } dp = vector<vector<long long> >(K + 1, vector<long long>(N)); cnt = vector<int>(N, 0); cost = 0; for (int i = N - 1; i >= 0; i--) { cost -= 1LL * cnt[arr[i]] * (cnt[arr[i]] - 1) / 2; cnt[arr[i]]++; cost += 1LL * cnt[arr[i]] * (cnt[arr[i]] - 1) / 2; dp[1][i] = cost; } for (int i = 2; i <= K; i++) { solve(i); } printf( %lld , dp[K][0]); } |
#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; while (~scanf( %lf%lf%lf%lf , &d, &h, &v, &e)) { double v1, v2; v1 = (d / 2) * (d / 2) * 3.1415927 * e; v2 = (d / 2) * (d / 2) * 3.1415927 * h; if (v1 >= v) printf( NO n ); else { double time = v2 / (v - v1); printf( YES n ); printf( %lf n , time); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int tot = 1; int b[200005], e[200005], h[200005], p[200005], u[200005]; vector<int> ans[200005]; void add(int x, int y) { b[++tot] = y; e[tot] = h[x]; h[x] = tot; } void dfs(int k, int fa_edge) { p[k] = 1; for (int go = h[k]; go; go = e[go]) if (b[go] != b[fa_edge]) { if (p[b[go]] == 0) dfs(b[go], go ^ 1); if (u[go] == 0) ans[k].push_back(b[go]), u[go] = u[go ^ 1] = 1; } int sum = ans[k].size(); if (sum & 1) sum++, ans[k].push_back(b[fa_edge]), u[fa_edge] = u[fa_edge ^ 1] = 1; for (int i = 0; i < sum; i += 2) printf( %d %d %d n , ans[k][i] + 1, k + 1, ans[k][i + 1] + 1); } int main() { scanf( %d%d , &n, &m); if (m % 2) { printf( No solution ); return 0; } int x, y; for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); add(--x, --y); add(y, x); } dfs(0, -1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5; int n; int neg = 0; string s[N + 5]; inline long long pars(int x) { long long ret = 0LL; for (int i = 0; i < s[x].size(); i++) { if (s[x][i] == - ) continue; if (s[x][i] == . ) break; ret *= 10; ret += s[x][i] - 0 ; } if (s[x][0] == - ) ret *= -1; return ret; } bool bisa(int x) { for (int i = s[x].size() - 1; i >= 0; i--) { if (s[x][i] == . ) break; if (s[x][i] != 0 ) return 1; } return 0; } int main() { cin >> n; long long ct = 0LL; for (int i = 1; i <= n; i++) { cin >> s[i]; if (s[i][0] == - ) neg++; ct += pars(i); } for (int i = 1; i <= n; i++) { long long tmp = pars(i); if (bisa(i)) { if (ct > 0) { if (s[i][0] == - ) { tmp--; ct--; } } else if (ct < 0) { if (s[i][0] != - ) { tmp++; ct++; } } } cout << tmp << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int sum; int l, r; int ans = 360; int a[360]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; while (r < n) { sum += a[r]; while (sum >= 180) { ans = min(ans, 2 * abs(180 - sum)); sum -= a[l]; l++; } ans = min(ans, 2 * abs(180 - sum)); r++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n, f, d; int main() { cin >> n; if (n % 3 != 2) d = n / 3; else d = n / 3 + 1; f = d / 12; d %= 12; cout << f << << d; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int INF = 1000000001; const long long int LLINF = 1000000000000000001LL; struct ITree { vector<long long int> T; int p = 1; ITree(int n) { while (p < n) p *= 2; T.resize(2 * p - 1, 0); } int par(int x) { return (x - 1) / 2; } void Set(int l, long long int v) { l += p - 1; T[l] = v; while (l > 0) { l = par(l); T[l] = T[2 * l + 1] + T[2 * l + 2]; } } long long int Query(int l, int r) { l += p - 1; r += p - 1; long long int ans = T[l]; if (l < r) ans += T[r]; while (par(l) != par(r)) { if (l % 2 == 1) ans += T[l + 1]; if (r % 2 == 0) ans += T[r - 1]; l = par(l); r = par(r); } return ans; } }; int main() { ios_base::sync_with_stdio(0); int n, k, a, b, q; cin >> n >> k >> a >> b >> q; ITree treeA(n), treeB(n); vector<long long int> A(n, 0); while (q--) { int type; cin >> type; if (type == 1) { int day, add; cin >> day >> add; day--; A[day] += add; treeB.Set(day, min((long long int)b, A[day])); treeA.Set(day, min((long long int)a, A[day])); } else { int l; cin >> l; l--; int r = l + k - 1; long long int ans = 0; if (l > 0) ans += treeB.Query(0, l - 1); if (r < n - 1) ans += treeA.Query(r + 1, n - 1); cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 1e5 + 5; void solve() { int a, b; cin >> a >> b; if (a * 2 <= b) cout << a << << a * 2 << n ; else cout << -1 -1 n ; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int S = 40; const unsigned long long mod = 998244353; struct poly { int a[S + 10]; inline int& operator[](const int& x) { return a[x]; } poly() { for (int i = 0; i < S; i++) a[i] = 0; } friend poly operator*(poly a, poly b) { poly c; for (int i = 0; i < S; i++) for (int j = 0; j < S && i + j < S; j++) c[i + j] += a[i] * b[j]; return c; } friend poly operator+(poly a, poly b) { poly c; for (int i = 0; i < S; i++) c[i] = a[i] + b[i]; return c; } friend poly operator-(poly a, poly b) { poly c; for (int i = 0; i < S; i++) c[i] = a[i] - b[i]; return c; } poly operator<<(const int& x) { poly c; for (int i = S - 1; i >= x; i--) c[i] = a[i - x]; return c; } } a, b, c, q, fz, fm, fz1, fm1; int n; unsigned long long f0[N]; unsigned long long c0[N]; unsigned long long f1[N]; unsigned long long c1[N]; unsigned long long f2[N]; unsigned long long c2[N]; unsigned long long g[N]; unsigned long long sqr[N]; inline void calc(poly& fz, poly& fm, unsigned long long* f, unsigned long long* c) { for (int i = 0; i < S; i++) f[i] = (mod + fz[i]) % mod; for (int i = 0; i < S; i++) c[i] = (mod - fm[i]) % mod; (c[0] += 1) %= mod; for (int i = 0; i <= n; i++) for (int j = 1; j < S && j <= i; j++) (f[i] += f[i - j] * c[j]) %= mod; } int main() { a[8] = 16; a[6] = 12; a[4] = 20; a[2] = 4; b[8] = 9; b[6] = 2; b[4] = 23; b[2] = 6; b[0] = 1; c[8] = 4; c[6] = -4; c[4] = 24; c[2] = 4; c[0] = 4; q[12] = -1; q[10] = -3; q[6] = +5; q[2] = -3; q[0] = +1; scanf( %d , &n); fz = ((b * b) << 3) - a * ((c << 3) - q); fm = ((c << 3) - q) * ((a << 1) - q) - ((b * b) << 4); calc(fz, fm, f0, c0); fz = b * q; fm = ((c << 3) - q) * ((a << 1) - q) - ((b * b) << 4); calc(fz, fm, f1, c1); fz1 = c * fm + ((b * fz) << 1); fm1 = fm * (q - (c << 3)); calc(fz1, fm1, f2, c2); g[0] = 1; g[2] = 1; for (int i = 4; i <= n; i++) g[i] = (g[i - 2] + g[i - 4]) % mod; for (int i = 1; i <= n; i++) sqr[i] = (unsigned long long)i * i % mod; unsigned long long ans = (g[n - 1] + g[n - 3]) * sqr[n - 1] % mod * n % mod; for (int i = 2; i <= n - 2; i++) { unsigned long long ret = 0; (ret += g[i - 1] * f0[n - i - 1]) %= mod; (ret += g[i - 2] * f1[n - i - 2] * 2) %= mod; if (3 <= i && i <= n - 3) (ret += g[i - 3] * f2[n - i - 3]) %= mod; (ans += ret * sqr[i - 1] % mod * i) %= mod; } printf( %I64d , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, k, m, x, ans = 0; cin >> n >> k >> m; vector<pair<long long, long long> > v; for (int i = 0; i < n; i++) { cin >> x; if (v.empty() || (v.back().first != x)) { v.push_back({x, 1}); } else if (v.back().first == x) { v.back().second = (v.back().second + 1) % k; if (v.back().second == 0) v.pop_back(); } } if (v.size() == 0) return cout << 0, 0; if (v.size() == 1) { return cout << ((v[0].second * m) % k), 0; } for (auto &i : v) { ans += m * i.second; } if (m == 1) return cout << ans, 0; long long rem = 0; int back = v.size() - 1, front = 0; while (back > front) { if ((v[front].first != v[back].first)) { break; } else { rem += ((v[front].second + v[back].second) - ((v[front].second + v[back].second) % k)) * (m - 1); if ((v[front].second + v[back].second) % k) break; } back--; front++; } if (back == front) { rem += ((v[back].second) * m) - ((v[back].second) * m) % k; if (((v[back].second) * m) % k == 0) { back--; front++; } } if (back < front) while (back >= 0) { if ((v[front].first != v[back].first)) { break; } else { rem += ((v[front].second + v[back].second) - ((v[front].second + v[back].second) % k)); if ((v[front].second + v[back].second) % k) break; } back--; front++; } cout << (ans - rem); return 0; } |
#include <bits/stdc++.h> #pragma optimize( avx ) #pragma optimize( no-stack-protector ) namespace io { inline char gnc() { return (char)getchar(); } template <typename T> inline void gi(T &dx) { dx = 0; int yc = gnc(); bool nega = false; while (yc < 0 || yc > 9 ) { nega = (yc == - ? true : nega); yc = gnc(); } while (yc >= 0 && yc <= 9 ) { dx = (T)(dx * 10 + yc - 0 ); yc = gnc(); } if (nega) { dx = -dx; } } void gc(char &a) { do a = gnc(); while (!isgraph(a)); } void gss(char *c) { *c = gnc(); while (!isgraph(*c)) *c = gnc(); while (isgraph(*c)) *++c = gnc(); *c = 0; } template <typename t1, typename t2> inline void gi(t1 &a, t2 &b) { gi(a); gi(b); } template <typename t1, typename t2, typename t3> inline void gi(t1 &a, t2 &b, t3 &c) { gi(a); gi(b); gi(c); } template <typename t1, typename t2, typename t3, typename t4> inline void gi(t1 &a, t2 &b, t3 &c, t4 &d) { gi(a); gi(b); gi(c); gi(d); } template <typename t1, typename t2, typename t3, typename t4, typename t5> inline void gi(t1 &a, t2 &b, t3 &c, t4 &d, t5 &e) { gi(a); gi(b); gi(c); gi(d); gi(e); } } // namespace io using namespace io; using namespace std; inline int gcd(int x, int y) { return y > x ? gcd(y, x) : y ? gcd(y, x % y) : x; } inline void exgcd(int a, int b, int &x, int &y) { if (!b) { x = 1; y = 0; return; } exgcd(b, a % b, x, y); int t = x; x = y; y = t - (a / b) * y; } const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; const int Rev = (MOD + 1) >> 1; template <typename T> inline void Sol(T &x) { if (x >= MOD) x -= MOD; } template <typename t1, typename t2> inline int inc(t1 x, t2 y) { x += y; if (x >= MOD) x -= MOD; return x; } template <typename t1, typename t2> inline int dec(t1 x, t2 y) { x += MOD - y; if (x >= MOD) x -= MOD; return x; } template <typename t1, typename t2> inline long long mul(t1 x, t2 y) { long long res = (long long)x * y; return res >= MOD ? res % MOD : res; } template <typename t1, typename t2, typename t3> inline long long mul(t1 x, t2 y, t3 z) { return mul(mul(x, y), z); } template <typename t1, typename t2, typename t3, typename t4> inline long long mul(t1 a, t2 b, t3 c, t4 d) { return mul(mul(a, b), mul(c, d)); } inline long long qpow(long long x, int y) { long long res = 1; for (; y; y >>= 1, x = x * x % MOD) if (y & 1) res = res * x % MOD; return res; } inline long long read() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } return x * f; } template <typename T1, typename T2> inline void Getmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> inline void Getmax(T1 &x, T2 y) { if (x < y) x = y; } const int MAXN = 52; int n, d[MAXN], f[2][MAXN][MAXN][MAXN][MAXN]; inline long long binom(long long x) { return 1LL * x * (x - 1) / 2ll % MOD; } int main() { n = read(); for (int i = 1; i <= n; i++) d[i] = read(); int np = 0; f[np][d[1] == 2][d[1] == 3][d[2] == 2][d[2] == 3] = 1; for (int i = 3; i <= n; i++) { int p = np, op = d[i] & 1; np ^= 1; memset(f[np], 0, sizeof f[np]); for (int pre1 = 0; pre1 < i; pre1++) for (int pre2 = 0; pre2 < i - pre1; pre2++) { int now1up = i - pre1 - pre2, now2up; for (int now1 = 0; now1 < now1up; now1++) { now2up = now1up - now1; for (int now2 = 0; now2 < now2up; now2++) if (f[p][pre1][pre2][now1][now2]) { if (!(now1 || now2 || pre1 || pre2)) continue; int val = f[p][pre1][pre2][now1][now2]; if (!pre1 && !pre2) { if (now1) f[np][now1 - 1][now2][op ^ 1][op] = inc(f[np][now1 - 1][now2][op ^ 1][op], mul(val, now1)); if (now2) f[np][now1 + 1][now2 - 1][op ^ 1][op] = inc( f[np][now1 + 1][now2 - 1][op ^ 1][op], mul(val, now2)); } else { if (pre1) { int newnow1 = now1 + (op ^ 1), newnow2 = now2 + op; long long v = mul(val, pre1); int newpre1 = pre1 - 1; f[np][newpre1][pre2][newnow1][newnow2] = inc(f[np][newpre1][pre2][newnow1][newnow2], v); if (now1) { f[np][newpre1][pre2][now1 - 1 + op][now2] = inc(f[np][newpre1][pre2][now1 - 1 + op][now2], mul(v, now1)); if (op && now1 > 1) f[np][newpre1][pre2][now1 - 2][now2] = inc(f[np][newpre1][pre2][now1 - 2][now2], mul(v, binom(now1))); } if (now2) { f[np][newpre1][pre2][now1 + op + 1][now2 - 1] = inc(f[np][newpre1][pre2][now1 + op + 1][now2 - 1], mul(v, now2)); if (op && now2 > 1) f[np][newpre1][pre2][now1 + 2][now2 - 2] = inc(f[np][newpre1][pre2][now1 + 2][now2 - 2], mul(v, binom(now2))); } if (now1 && now2 && op) f[np][newpre1][pre2][now1][now2 - 1] = inc(f[np][newpre1][pre2][now1][now2 - 1], mul(mul(v, now1), now2)); } if (pre2) { int newnow1 = now1 + (op ^ 1), newnow2 = now2 + op; long long v = mul(val, pre2); int newpre1 = pre1 + 1, newpre2 = pre2 - 1; f[np][newpre1][newpre2][newnow1][newnow2] = inc(f[np][newpre1][newpre2][newnow1][newnow2], v); if (now1) { f[np][newpre1][newpre2][now1 - 1 + op][now2] = inc(f[np][newpre1][newpre2][now1 - 1 + op][now2], mul(v, now1)); if (op && now1 > 1) f[np][newpre1][newpre2][now1 - 2][now2] = inc(f[np][newpre1][newpre2][now1 - 2][now2], mul(v, binom(now1))); } if (now2) { f[np][newpre1][newpre2][now1 + op + 1][now2 - 1] = inc(f[np][newpre1][newpre2][now1 + op + 1][now2 - 1], mul(v, now2)); if (op && now2 > 1) f[np][newpre1][newpre2][now1 + 2][now2 - 2] = inc(f[np][newpre1][newpre2][now1 + 2][now2 - 2], mul(v, binom(now2))); } if (now1 && now2 && op) f[np][newpre1][newpre2][now1][now2 - 1] = inc(f[np][newpre1][newpre2][now1][now2 - 1], mul(v, now1, now2)); } } } } } } int ans = f[n & 1][0][0][0][0]; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long A = 100000000000000LL, N = 300005; long long p, d, limit; long long cal(long long p) { int x = 0; if (p % 10 != 9) return 0; while (p % 10 == 9) { x++; p /= 10; } return x; } int main() { cin >> p >> d; limit = p - d; long long j = p; long long length = log10(p) + 1; long long initial = cal(p); int i = 0; long long powerr = 10; while (true) { j = p - p % powerr - 1; if (j == -1) break; if (j < limit) break; powerr *= 10; } powerr /= 10; j = p - p % powerr - 1; if (j < limit) j = p; if (j >= limit and powerr == 1) j = p; if (initial >= (log10(powerr))) j = p; cout << j; } |
#include <bits/stdc++.h> using namespace std; int main() { int data[100]; int n, x, y; cin >> n >> x >> y; int c = 0; for (int i = 0; i < n; i++) { cin >> data[i]; if (data[i] <= x) c++; } if (x > y) { cout << n; } else { if (c % 2 == 0) { cout << c / 2; } else cout << (c / 2) + 1; } char a; cin >> a; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int n, c[100005], dp[100005][2], i, j; cin >> n; string s[100005], rs[100005]; for (i = 1; i <= n; i++) cin >> c[i]; for (i = 1; i <= n; i++) { cin >> s[i]; rs[i] = s[i]; dp[i][0] = dp[i][1] = 1e15; reverse(rs[i].begin(), rs[i].end()); } dp[1][0] = 0; dp[1][1] = c[1]; for (i = 2; i <= n; i++) { if (s[i] < s[i - 1] && s[i] < rs[i - 1] && rs[i] < rs[i - 1] && rs[i] < s[i - 1]) { cout << -1 ; return 0; } if ((string)s[i] >= s[i - 1] && dp[i - 1][0] != 1e15) dp[i][0] = min(dp[i][0], dp[i - 1][0]); if ((string)s[i] >= rs[i - 1] && dp[i - 1][1] != 1e15) dp[i][0] = min(dp[i][0], dp[i - 1][1]); if ((string)rs[i] >= s[i - 1] && dp[i - 1][0] != 1e15) dp[i][1] = min(dp[i][1], c[i] + dp[i - 1][0]); if ((string)rs[i] >= rs[i - 1] && dp[i - 1][1] != 1e15) dp[i][1] = min(dp[i][1], c[i] + dp[i - 1][1]); } long long int ans = min(dp[n][0], dp[n][1]); if (ans == 1e15) cout << -1 ; else cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; map<pair<long long unsigned, long long unsigned>, pair<long long unsigned, long long unsigned> > dp; long long unsigned n; void read() { cin >> n; return; } pair<long long unsigned, long long unsigned> find(long long unsigned s, long long unsigned mx) { if (s <= 9) return make_pair(0, s); if (dp.find(make_pair(s, mx)) != dp.end()) return dp[make_pair(s, mx)]; long long unsigned t, r, m; pair<long long unsigned, long long unsigned> &ans = dp[make_pair(s, mx)]; t = 1; while (t * 10 <= s) t *= 10; r = s % t; s = s / t; while (1) { m = max(mx, s); pair<long long unsigned, long long unsigned> f = find(r, m); ans.first += f.first; if (s == 0) { ans.second = f.second; break; } if (f.second >= m) { ans.first += 2; r = t - m; } else { ans.first++; r = t - (m - f.second); } s--; } return ans; } void solve() { read(); pair<long long unsigned, long long unsigned> cvp = find(n, 0); cout << cvp.first + !!cvp.second << endl; return; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 10001001; int min_div[MAXN]; vector<long long> primes; void criba() { for (int i = (int)0; i < (int)MAXN; i++) min_div[i] = i; for (int i = (int)2; i < (int)MAXN; i++) { if (min_div[i] != i) continue; primes.push_back(i); for (int j = i + i; j < MAXN; j += i) { min_div[j] = i; } } } void solve(long long* acum) { long long now = acum[MAXN - 1]; for (int i = MAXN - 2; i > 1; i--) { now += acum[i]; acum[i] = now; } for (int i = MAXN - 1; i > 1; i--) if (acum[i]) { if (min_div[i] == i) continue; int a = min_div[i]; int b = i / min_div[i]; acum[a] += acum[i]; acum[b] += acum[i]; acum[i] = 0; } } long long acum_a[MAXN]; bool test(long long n) { for (int i = (int)0; i < (int)primes.size(); i++) { long long e = 0; long long n_t = n; while (n_t) { e += (n_t /= (long long)primes[i]); } if (e < acum_a[primes[i]]) return false; } return true; } int main() { criba(); int k; scanf( %d , &k); long long lo = 1, hi = 0; for (int i = (int)0; i < (int)k; i++) { int n = 1000101; scanf( %d , &n); acum_a[n]++; hi += n; } solve(acum_a); while (lo < hi) { long long mid = (lo + hi) / 2LL; if (test(mid)) { hi = mid; } else { lo = mid + 1; } } cout << lo << endl; return 0; } |
#include <bits/stdc++.h> const int N = 1e5 + 5; int n; char c[N]; int main() { int T = 1; scanf( %d , &T); while (T--) { scanf( %s , c + 1); n = strlen(c + 1); printf( %d n , 4); printf( L 2 n ); printf( L 2 n ); printf( R 2 n ); n += 2; n += n - 2; printf( R %d n , n - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; char grid[1005][1005]; int lewo[1005][1005], prawo[1005][1005], gora[1005][1005], dol[1005][1005]; bool odwiedzony[1005][1005]; vector<pair<int, int> > przedzialy_x[1005], przedzialy_y[1005]; vector<pair<pair<int, int>, int> > wynik; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int y, x, xd = 0, wszystkie = 0; cin >> y >> x; for (int i = 1; i <= y; i++) { for (int j = 1; j <= x; j++) { cin >> grid[i][j]; if (grid[i][j] == * ) wszystkie++; if (grid[i][j] == . ) lewo[i][j] = j; else lewo[i][j] = lewo[i][j - 1]; } prawo[i][x + 1] = x + 1; for (int j = x; j > 0; j--) { if (grid[i][j] == . ) prawo[i][j] = j; else prawo[i][j] = prawo[i][j + 1]; } } for (int i = 1; i <= x; i++) { for (int j = 1; j <= y; j++) { if (grid[j][i] == . ) gora[j][i] = j; else gora[j][i] = gora[j - 1][i]; } dol[y + 1][i] = y + 1; for (int j = y; j > 0; j--) { if (grid[j][i] == . ) dol[j][i] = j; else dol[j][i] = dol[j + 1][i]; } } for (int i = 2; i < y; i++) for (int j = 2; j < x; j++) { int pom = min(min(j - lewo[i][j] - 1, prawo[i][j] - j - 1), min(i - gora[i][j] - 1, dol[i][j] - i - 1)); if (pom && grid[i][j] == * ) { przedzialy_x[i].push_back({j - pom, j + pom}); przedzialy_y[j].push_back({i - pom, i + pom}); wynik.emplace_back(make_pair(make_pair(i, j), pom)); } } for (int i = 1; i <= y; i++) { przedzialy_x[i].push_back({1e9, 1e9}); sort(przedzialy_x[i].begin(), przedzialy_x[i].end()); int indeks = 0; for (int j = 1; j <= x; j++) { while (przedzialy_x[i][indeks].second < j) indeks++; if (grid[i][j] == * && przedzialy_x[i][indeks].first <= j) { xd++; odwiedzony[i][j] = true; } } } for (int i = 1; i <= x; i++) { przedzialy_y[i].push_back({1e9, 1e9}); sort(przedzialy_y[i].begin(), przedzialy_y[i].end()); int indeks = 0; for (int j = 1; j <= y; j++) { while (przedzialy_y[i][indeks].second < j) indeks++; if (grid[j][i] == * && przedzialy_y[i][indeks].first <= j && !odwiedzony[j][i]) xd++; } } if (xd == wszystkie) { int aha = wynik.size(); cout << aha << n ; for (int i = 0; i < aha; i++) cout << wynik[i].first.first << << wynik[i].first.second << << wynik[i].second << n ; } else cout << -1 n ; } |
#include <bits/stdc++.h> using std::bitset; using std::cin; using std::cout; using std::endl; using std::make_pair; using std::map; using std::pair; using std::priority_queue; using std::queue; using std::set; using std::string; using std::stringstream; using std::vector; class MyTimer { public: void reset() {} void report() {} } myTimer; template <typename A, typename B> std::ostream &operator<<(std::ostream &cout, const pair<A, B> &x) { return cout << ( << x.first << , << x.second << ) ; } template <typename T1, typename T2> inline bool chmin(T1 &a, const T2 &b) { return a > b ? a = b, true : false; } template <typename T1, typename T2> inline bool chmax(T1 &a, const T2 &b) { return a < b ? a = b, true : false; } const int maxN = 100000 + 233; int n, m; int a[maxN], b[maxN], c[maxN], d[maxN], e[maxN]; int ans[maxN]; struct Q { int t; int x, y, L, R; Q(int t, int x, int y, int L, int R) : t(t), x(x), y(y), L(L), R(R) {} bool operator<(const Q &rhs) const { return x != rhs.x ? x < rhs.x : y != rhs.y ? y < rhs.y : t > rhs.t; } }; vector<Q> q, tmp; void initialize() { std::ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= n; ++i) cin >> b[i]; for (int i = 1; i <= n; ++i) cin >> c[i]; for (int i = 1; i <= m; ++i) cin >> d[i]; for (int i = 1; i <= m; ++i) cin >> e[i]; for (int i = 1; i <= n; ++i) { q.emplace_back(i, -c[i] + a[i], c[i] + a[i], a[i], b[i]); } for (int i = 1; i <= m; ++i) { q.emplace_back(-i, -e[i] + d[i], d[i] + e[i], d[i], d[i]); } vector<int> t; for (auto &p : q) t.push_back(p.L), t.push_back(p.R); std::sort(t.begin(), t.end()); t.erase(std::unique(t.begin(), t.end()), t.end()); for (auto &p : q) p.L = std::lower_bound(t.begin(), t.end(), p.L) - t.begin() + 1, p.R = std::lower_bound(t.begin(), t.end(), p.R) - t.begin() + 1; std::sort(q.begin(), q.end()); tmp.resize(q.size(), Q(0, 0, 0, 0, 0)); } int C[maxN * 3]; void add(int p, int x) { p += 2; for (int i = p; i <= n * 2 + m + 5; i += i & -i) C[i] += x; } int sum(int p) { p += 2; int r = 0; for (int i = p; i > 0; i -= i & -i) r += C[i]; return r; } void solve(int L, int R) { if (L >= R) return; int M = (L + R) >> 1; solve(L, M); solve(M + 1, R); int i = L, j = M + 1, qwq = L; const auto left = [&](const Q &p) { tmp[qwq++] = p; if (p.t > 0) add(p.L, 1), add(p.R + 1, -1); }; const auto right = [&](const Q &p) { tmp[qwq++] = p; if (p.t < 0) ans[-p.t] += sum(p.L); }; while (i <= M && j <= R) { if (q[i].y < q[j].y || (q[i].y == q[j].y && q[i].t > 0)) left(q[i++]); else right(q[j++]); } while (i <= M) left(q[i++]); while (j <= R) right(q[j++]); for (int k = L; k <= M; ++k) if (q[k].t > 0) add(q[k].L, -1), add(q[k].R + 1, 1); for (int k = L; k <= R; ++k) q[k] = tmp[k]; } int main() { initialize(); solve(0, (int)q.size() - 1); for (int i = 1; i <= m; ++i) printf( %d%c , ans[i], n [i == m]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; void qr(int &x) { scanf( %d , &x); } int n, sz[N], f[N], root, c[N]; long long k, mn, mx; struct edge { int y, next; } a[N * 2]; int len, last[N]; void ins(int x, int y) { a[++len] = (edge){y, last[x]}; last[x] = len; } void dfs1(int x, int fa) { sz[x] = f[x] = 1; for (int k = last[x], y; k; k = a[k].next) { y = a[k].y; if (y ^ fa) { dfs1(y, x); sz[x] += sz[y]; mn += sz[y] & 1; mx += min(sz[y], n - sz[y]); f[x] = max(f[x], sz[y]); } } f[x] = max(f[x], n - sz[x]); } void dfs2(int x, int fa) { sz[x] = 1; for (int k = last[x], y; k; k = a[k].next) { y = a[k].y; if (y ^ fa) { dfs2(y, x); sz[x] += sz[y]; } } c[sz[x]]++; } vector<int> d[N]; int son[N], tot, A[N], B[N]; void dfs3(int x, int fa) { sz[x] = 1; for (int k = last[x], y; k; k = a[k].next) if ((y = a[k].y) ^ fa) dfs3(y, x), sz[x] += c[y]; int C = (sz[x] - c[x]) >> 1, st = 1, ed; son[tot = 1] = x; d[x].push_back(x); for (int k = last[x], y; k; k = a[k].next) if ((y = a[k].y) ^ fa) son[++tot] = y; ed = tot; for (int i = 1; i <= C; i++) { while (d[son[st]].empty()) st++; A[i] = d[son[st]].back(); d[son[st]].pop_back(); while (d[son[ed]].empty()) ed--; B[i] = d[son[ed]].back(); d[son[ed]].pop_back(); } for (int i = 1; i <= C; i++) printf( %d %d n , A[i], B[C - i + 1]); for (int i = 2; i <= tot; i++) { if (d[son[i]].size() > d[x].size()) swap(d[x], d[son[i]]); for (int j : d[son[i]]) d[x].push_back(j); } } int main() { qr(n); scanf( %lld , &k); for (int i = 1, x, y; i < n; i++) qr(x), qr(y), ins(x, y), ins(y, x); dfs1(1, 0); if (!(mn <= k && k <= mx) || (k - mn) % 2 == 1) puts( NO ), exit(0); root = 1; for (int i = 2; i <= n; i++) if (f[i] < f[root]) root = i; dfs2(root, 0); int p = n - 1; for (; p > 1; p--) if (mx - c[p] * 2 >= k) { mx -= c[p] * 2; c[p - 2] += c[p]; } else break; for (int i = 1; i <= n; i++) c[i] = min(sz[i], p - (p + sz[i]) % 2); c[root] = 0; for (int i = 1; i <= n; i++) if (c[i] == p && mx > k) { mx -= 2; c[i] -= 2; } puts( YES ); dfs3(root, 0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 111111; const int INF = 0x3f3f3f3f; int vis[maxn]; bool selected[maxn]; int n, m; vector<int> adj[maxn]; bool test[maxn]; double elapsed() { return clock() / (double)CLOCKS_PER_SEC; } bool dfs(int v) { if (selected[v] == true) return false; vis[v] = -1; for (auto w : adj[v]) { if (vis[w] == 0) { if (dfs(w)) return true; } else if (vis[w] == -1) { for (int i = 1; i <= n; i++) { if (vis[i] != -1) test[i] = true; } return true; } } vis[v] = 1; return false; } bool check() { memset(vis, 0, sizeof vis); for (int i = 1; i <= n; i++) { if (!vis[i] && dfs(i)) return false; } return true; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { int u, v; scanf( %d%d , &u, &v); adj[u].push_back(v); } vector<int> emp; for (int i = 0; i < n; ++i) emp.push_back(i + 1); random_shuffle(emp.begin(), emp.end()); for (int i = 0; elapsed() <= 0.95 and i < emp.size(); i++) { selected[emp[i]] = true; if (!test[emp[i]] && check()) { printf( %d n , emp[i]); return 0; } selected[emp[i]] = false; } puts( -1 ); } |
#include <bits/stdc++.h> using namespace std; inline int gi() { char c; int num = 0, flg = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flg = -1; while (c >= 0 && c <= 9 ) { num = num * 10 + c - 48; c = getchar(); } return num * flg; } int n, m; int fir[200005], cur[200005], to[5000005], nxt[5000005], cap[5000005], id[2 * 200005], cnt; void adde(int a, int b, int c, int d = 0) { to[++cnt] = b; nxt[cnt] = fir[a]; fir[a] = cnt; cap[cnt] = c; if (d) id[cnt] = d; to[++cnt] = a; nxt[cnt] = fir[b]; fir[b] = cnt; cap[cnt] = 0; if (d) id[cnt] = d; } int fa[200005], son[200005], sonp[200005], siz[200005], top[200005], dep[200005]; void dfs1(int u) { dep[u] = dep[fa[u]] + 1; siz[u] = 1; for (int v, p = fir[u]; p; p = nxt[p]) { if ((v = to[p]) != fa[u]) { fa[v] = u; dfs1(v); siz[u] += siz[v]; if (siz[son[u]] < siz[v]) son[u] = v, sonp[u] = p; } } } int pos[200005], dc, dfn[200005]; void dfs2(int u, int fro) { pos[u] = ++dc; dfn[dc] = id[fro]; if (son[u]) top[son[u]] = top[u], dfs2(son[u], sonp[u]); for (int v, p = fir[u]; p; p = nxt[p]) if ((v = to[p]) != fa[u] && v != son[u]) top[v] = v, dfs2(v, p); } int S, T, sz; const int INF = 0x3f3f3f3f; struct node { int l, r; } a[200005]; int rt; void build(int &i, int l, int r) { if (l == r) { i = dfn[l]; return; } i = ++sz; int mid = (l + r) >> 1; build(a[i].l, l, mid); build(a[i].r, mid + 1, r); adde(i, a[i].l, INF); adde(i, a[i].r, INF); } void insert(int i, int l, int r, int ql, int qr, int p) { if (l > qr || r < ql) return; if (ql <= l && r <= qr) { adde(p, i, INF); return; } int mid = (l + r) >> 1; insert(a[i].l, l, mid, ql, qr, p); insert(a[i].r, mid + 1, r, ql, qr, p); } void QP(int x, int y, int p) { while (top[x] != top[y]) { if (dep[top[x]] < dep[top[y]]) swap(x, y); insert(rt, 1, n, pos[top[x]], pos[x], p); x = fa[top[x]]; } if (dep[x] > dep[y]) swap(x, y); insert(rt, 1, n, pos[x] + 1, pos[y], p); } queue<int> q; int dis[200005]; bool bfs() { for (int i = 1; i <= sz; i++) dis[i] = -1; q.push(T); dis[T] = 0; while (!q.empty()) { int u = q.front(); q.pop(); for (int v, p = fir[u]; p; p = nxt[p]) { v = to[p]; if (cap[p ^ 1] > 0 && dis[v] == -1) { dis[v] = dis[u] + 1; q.push(v); } } } return dis[S] != -1; } int sap(int u, int aug) { if (u == T) return aug; int tmp, ret = 0; for (int v, &p = cur[u]; p; p = nxt[p]) { v = to[p]; if (cap[p] > 0 && dis[u] == dis[v] + 1) { tmp = sap(v, min(cap[p], aug)); cap[p] -= tmp; aug -= tmp; cap[p ^ 1] += tmp; ret += tmp; if (!aug) break; } } return ret; } int flow; void maxflow() { flow = 0; while (bfs()) { for (int i = 1; i <= sz; i++) cur[i] = fir[i]; flow += sap(S, INF); } } int main() { int i, u, v; n = gi(); m = gi(); for (i = 1; i < n; i++) { u = gi(); v = gi(); adde(u, v, 0, i); } dfs1(1); top[1] = 1; dfs2(1, 0); memset(fir, 0, sizeof(fir)); cnt = 1; sz = n; build(rt, 1, n); for (i = 1; i <= m; i++) { u = gi(); v = gi(); QP(u, v, sz + i); } S = sz + m + 1; T = sz + m + 2; int tot = sz; for (i = 1; i < n; i++) adde(i, T, 1); for (i = 1; i <= m; i++) adde(S, sz + i, 1); sz = T; maxflow(); printf( %d n , flow); int cnt1 = 0, cnt2 = 0; for (i = 1; i <= m; i++) if (dis[tot + i] != -1) cnt1++; for (i = 1; i < n; i++) if (dis[i] == -1) cnt2++; printf( %d , cnt1); for (i = 1; i <= m; i++) if (dis[tot + i] != -1) printf( %d , i); printf( n ); printf( %d , cnt2); for (i = 1; i < n; i++) if (dis[i] == -1) printf( %d , i); printf( n ); } |
#include <bits/stdc++.h> using namespace std; long long a[212345], sumi, wow, i; int main() { std::ios::sync_with_stdio(false); int n; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; sumi += a[i]; } wow = 0; for (i = 0; i < n; i++) { wow += a[i]; if (2 * wow >= sumi) break; } cout << i + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9, maxn = (int)1e5 + 1; const double eps = (double)1e-8; const int mod = (int)1000000009; int n, a[1001], x, y, xx, yy, z, my, mx; vector<pair<int, bool> > b[3000]; string c, st; int main() { my = 1500; z = 1500; cin >> n; x = 0; y = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; xx = x; yy = y; x += a[i]; if (i & 1) { y += a[i]; for (int j = yy; j < y; j++) b[z + j].push_back(make_pair(xx + j - yy, 1)); } else { y -= a[i]; for (int j = yy - 1; j >= y; j--) b[z + j].push_back(make_pair(xx + (yy - j - 1), 0)); } my = max(my, y + z); } st = ; for (int i = 0; i < x; i++) st += ; mx = x; for (int i = my - 1;; i--) { c = st; if (b[i].size() == 0) break; for (int j = 0; j < b[i].size(); j++) { if (b[i][j].second) c[b[i][j].first] = / ; else c[b[i][j].first] = char(92); } cout << c << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int H, M, N; set<int> a[200005]; int p[200005], seq[200005], r = 0; int u[200005]; map<int, pair<int, int> > history; void release(pair<int, int> P) { a[P.first].insert(P.second); } int main(void) { scanf( %d%d%d , &H, &M, &N); for (int i = 0; i < H; i++) { if (!u[i]) { for (int c = 0, j = i; !u[j]; j = (j + M) % H, ++c) { p[j] = r; seq[j] = c; a[r].insert(c); u[j] = 1; } ++r; } } long long ans = 0; while (N--) { char x[10]; int id, hash; scanf( %s%d , x, &id); if (x[0] == - ) release(history[id]); else { scanf( %d , &hash); hash %= H; int A = p[hash], B = seq[hash]; set<int>::iterator it = a[A].lower_bound(B); if (it == a[A].end()) { it = a[A].begin(); ans += *it + H / r - B; } else { ans += *it - B; } history[id] = make_pair(A, *it); a[A].erase(it); } } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; int main() { int n; cin >> n; int graph[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { graph[i][j] = INF; } } for (int i = 0; i < n - 1; i++) { int a, b, c; cin >> a >> b >> c; graph[a][b] = graph[b][a] = c; } for (int k = 0; k < n; k++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (graph[i][j] >= graph[i][k] + graph[k][j]) { graph[i][j] = graph[i][k] + graph[k][j]; } } } } int ans = 0; for (int i = 1; i < n; i++) { if (graph[0][i] != INF) ans = max(ans, graph[0][i]); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const int max_n = 300333, inf = 1011111111; int n, m, a[max_n], used[max_n], pos, lb[max_n]; vector<int> g2[max_n], num2[max_n], g[max_n], num[max_n], k, ans; void dfs(int v) { used[v] = 1; for (int i = 0; i < g2[v].size(); ++i) { if (used[g2[v][i]] == 0) { g[v].push_back(g2[v][i]); num[v].push_back(num2[v][i]); dfs(g2[v][i]); } } } void dfs2(int v) { for (int i = 0; i < g[v].size(); ++i) { dfs2(g[v][i]); lb[v] ^= lb[g[v][i]]; if (lb[g[v][i]]) { ans.push_back(num[v][i]); } } } int main() { scanf( %d%d , &n, &m); pos = -1; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); if (a[i] == -1) { pos = i; } if (a[i] == 1) { k.push_back(i); } } if (pos == -1 && k.size() % 2 != 0) { printf( -1 n ); return 0; } for (int i = 0; i < m; ++i) { int u, v; scanf( %d%d , &u, &v); g2[u].push_back(v); g2[v].push_back(u); num2[u].push_back(i); num2[v].push_back(i); } dfs(1); for (int i = 0; i + 1 < k.size(); i += 2) { lb[k[i]] = 1; lb[k[i + 1]] = 1; } if (k.size() % 2) { lb[pos] = 1; lb[k.back()] = 1; } dfs2(1); printf( %d n , ans.size()); for (int i = 0; i < ans.size(); ++i) { printf( %d n , ans[i] + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; int ans; scanf( %d%d%d , &a, &b, &c); ans = (a - b) * c; if (!(ans % b)) ans /= b; else { ans /= b; ans += 1; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 100005, INF = 1e18; void solve() { long long n, ans = 0, max = 0; cin >> n; ans = n / 2; cout << ans << n ; for (long long i = (long long)0; i < ans - 1; i++) { cout << 2 ; } if (n % 2 == 0) cout << 2 << n ; else cout << 3 << n ; } int32_t main() { std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010, maxp = 1000010; int x[maxn], dp[maxp][20], can[maxp], f[maxp]; int n, a, b; inline void chkmax(int& a, int b) { if (a < b) a = b; } inline void chkmin(int& a, int b) { if (a > b) a = b; } int getmin(int l, int r) { int b; for (b = 0; l + (1 << b) < r - (1 << b) + 1; b++) ; return min(dp[l][b], dp[r - (1 << b) + 1][b]); } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &x[i]); sort(x, x + n); n = unique(x, x + n) - x; scanf( %d %d , &a, &b); swap(a, b); for (int i = 0; i < n; i++) { int st = a - a % x[i]; if (st != a) st += x[i]; while (st <= b) { chkmax(can[st - a], x[i]); st += x[i]; } } int length = b - a + 1; memset(f, 0x3f, sizeof f); dp[length - 1][0] = 0; f[length - 1] = 0; for (int i = length - 2; i >= 0; i--) { int pos = min(length - 1, i + can[i] - 1); if (can[i] > 1) chkmin(f[i], getmin(i + 1, pos) + 1); chkmin(f[i], f[i + 1] + 1); dp[i][0] = f[i]; for (int j = 1; i + (1 << j) <= length; j++) dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]); } printf( %d n , f[0]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> g[100000]; vector<int> rev_g[100000]; vector<int> post_order; vector<bool> visited; vector<int> scc; void dfs1(int x) { if (visited[x]) return; visited[x] = true; for (auto y : g[x]) dfs1(y); post_order.push_back(x); } void dfs2(int x, int cc) { if (visited[x]) return; visited[x] = true; scc[x] = cc; for (auto y : rev_g[x]) dfs2(y, cc); } int Kosaraju() { visited = vector<bool>(n, false); for (int i = 0; i < n; i++) dfs1(i); scc = vector<int>(n, -1); visited = vector<bool>(n, false); int cc = 0; assert(post_order.size() == n); reverse(post_order.begin(), post_order.end()); for (auto x : post_order) if (scc[x] == -1) dfs2(x, cc++); return cc; } set<int> par_scc[100000]; set<int> chi_scc[100000]; vector<int> scc_list[100000]; stack<int> source_scc; int q = 0; int pos = 0; bool get_dir(int a, int b) { q++; printf( ? %d %d n , a + 1, b + 1); fflush(stdout); int res; scanf( %d , &res); if (res == 1) pos++; return (res == 1); } int main() { scanf( %d%d , &n, &m); int v = -1, w; for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); a--; b--; g[a].push_back(b); rev_g[b].push_back(a); } int ncc = Kosaraju(); for (int i = 0; i < n; i++) for (auto j : g[i]) if (scc[i] != scc[j]) { assert(scc[i] >= 0 && scc[j] >= 0 && scc[i] < n && scc[j] < n); par_scc[scc[j]].insert(scc[i]); chi_scc[scc[i]].insert(scc[j]); } for (int i = 0; i < n; i++) scc_list[scc[i]].push_back(i); for (int i = 0; i < ncc; i++) if (par_scc[i].empty()) source_scc.push(i); int cur_scc = source_scc.top(); int cur_i = 0; int cur_size = scc_list[cur_scc].size(); source_scc.pop(); int nxt_scc, nxt_i, nxt_size; while (!source_scc.empty()) { nxt_scc = source_scc.top(); nxt_i = 0; nxt_size = scc_list[nxt_scc].size(); source_scc.pop(); while (cur_i < cur_size && nxt_i < nxt_size) { if (!get_dir(scc_list[cur_scc][cur_i], scc_list[nxt_scc][nxt_i])) { swap(cur_scc, nxt_scc); swap(cur_i, nxt_i); swap(cur_size, nxt_size); } nxt_i++; } assert(nxt_i == nxt_size); for (auto x : chi_scc[nxt_scc]) { par_scc[x].erase(nxt_scc); if (par_scc[x].empty()) source_scc.push(x); } } printf( ! %d n , scc_list[cur_scc][cur_i] + 1); fflush(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int query(int x, int y) { cout << 1 << x << << y << endl; string ans; cin >> ans; if (ans == TAK ) return 1; return 0; } int find(int l, int r) { if (l > r) return -1; int L = l; int R = r; while (L < R) { int mid = (L + R) / 2; if (query(mid, mid + 1)) R = mid; else L = mid + 1; } return L; } int main() { cin >> n >> k; int x = find(1, n); int y = find(1, x - 1); if (x == 1 || !query(y, x)) y = find(x + 1, n); cout << 2 << x << << y << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int i, j, k, s, t; int read() { int x = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x; } int n1, n2, n3, p1, p2, p3, m1, m2, m3, st; long long m, n, ans; int st2[1010000], sta[1010000]; struct data { int p, q; }; bool cmp(const data &a, const data &b) { return a.p < b.p; } struct da { data a[50]; int n; } a, b; long long qpow(long long x, int y) { long long ans = 1; while (y) { if (y & 1) ans *= x; x *= x; y >>= 1; } return ans; } void solve1(int x, long long y) { if (y > n) return; if (x == b.n + 1) { ans++; return; } solve1(x + 1, y); for (int i = 1; i <= b.a[x].q; i++) y *= b.a[x].p, solve1(x + 1, y); } void solve2(int x, long long y, int f) { if (!y) return; if (x == st + 1) { ans += y * f; return; } solve2(x + 1, y, f); for (int i = 1; i <= st2[x]; i++) y /= sta[x]; solve2(x + 1, y, -f); } void pre(da &a, int x) { int i, j, k; for (i = 1; i <= a.n; i++) while (x % a.a[i].p == 0) x /= a.a[i].p, a.a[i].q++; for (i = 2; i * i <= x; i++) if (x % i == 0) { a.n++; a.a[a.n].p = i; a.a[a.n].q = 0; while (x % i == 0) x /= i, a.a[a.n].q++; } if (x > 1) { a.n++; a.a[a.n].p = x; a.a[a.n].q = 1; } } int main() { int T = read(); while (T--) { n1 = read(); n2 = read(); n3 = read(); n = (long long)n1 * n2 * n3; m1 = read(); m2 = read(); m3 = read(); m = (long long)m1 * m2 * m3; p1 = read(); p2 = read(); p3 = read(); a.n = 0; b.n = 0; ans = 0; pre(a, n1); pre(a, n2); pre(a, n3); pre(b, p1); pre(b, p2); pre(b, p3); pre(b, 2); sort(a.a + 1, a.a + a.n + 1, cmp); sort(b.a + 1, b.a + b.n + 1, cmp); solve1(1, 1); j = 1; st = 0; for (i = 1; i <= a.n; i++) { while (b.a[j].p < a.a[i].p && j <= b.n) j++; if (j == b.n + 1) break; if (b.a[j].p == a.a[i].p && a.a[i].q > b.a[j].q) { sta[++st] = a.a[i].p; st2[st] = b.a[j].q + 1; } if (b.a[j].p > a.a[i].p) { sta[++st] = a.a[i].p; st2[st] = 1; } } for (; i <= a.n; i++) { sta[++st] = a.a[i].p; st2[st] = 1; } solve2(1, m, 1); cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int mod = 1e9 + 7; struct edge { int u, v, t, c, id; } e[N]; int n, m; vector<edge> s[N]; bool cmp(edge a, edge b) { return a.c < b.c; } struct TwoSat { static const int N = ::N << 1; int dfn[N], low[N], id[N], st[N], _st, _, cc; vector<int> g[N]; int mark[N], n; void init(int _n) { for (int i = ((n = _n << 1)) - 1; i >= (0); --i) g[i].clear(); } int new_node() { for (int i = (0); i < (2); i++) g[n++].clear(); return n / 2 - 1; } void addedge(int a, int va, int b, int vb) { a = a << 1 | va; b = b << 1 | vb; g[a].push_back(b); g[b ^ 1].push_back(a ^ 1); } void add_set(int a, int va) { a = a << 1 | va; g[a ^ 1].push_back(a); } void add_then(int a, int va, int b, int vb) { addedge(a, va, b, vb ^ 1); } void add_or(int a, int va, int b, int vb) { addedge(a, va ^ 1, b, vb); } void add_xor(int a, int va, int b, int vb) { addedge(a, va, b, vb); addedge(b, vb, a, va); } void dfs(int c, vector<int> g[]) { dfn[c] = low[c] = ++cc; st[_st++] = c; for (auto t : g[c]) if (!dfn[t]) dfs(t, g), low[c] = min(low[c], low[t]); else if (!id[t]) low[c] = min(low[c], dfn[t]); if (low[c] == dfn[c]) { ++_; do { id[st[--_st]] = _; } while (st[_st] != c); } } void find() { fill_n(dfn, n, cc = 0); fill_n(low, n, _st = 0); fill_n(id, n, _ = 0); for (int i = (0); i < (n); i++) if (!dfn[i]) dfs(i, g); for (int i = (0); i < (n); i++) --id[i]; return; } bool solve() { find(); for (int i = 0; i < n; i += 2) { if (id[i] == id[i + 1]) return 0; mark[i >> 1] = (id[i] > id[i + 1]); } return 1; } } ts; int p = 0; void solve(int u) { sort(s[u].begin(), s[u].end(), cmp); for (int i = 0, j; i < (int)s[u].size();) { j = i; while (j < (int)s[u].size() && s[u][j].c == s[u][i].c) j++; if (j - i >= 3) { cout << No n ; exit(0); } if (j - i == 2) { int x = s[u][i].id, y = s[u][i + 1].id; ts.add_or(x, 0, y, 0); } i = j; } for (int i = (0); i < ((int)s[u].size() - 1); i++) { ts.addedge(p + i + 1, 0, p + i, 0); } for (int i = (0); i < ((int)s[u].size()); i++) { int x = s[u][i].id; ts.addedge(x, 0, p + i, 0); if (i != (int)s[u].size() - 1) ts.addedge(x, 0, p + i + 1, 1); } } void link() { p = m; for (int i = (1); i < (n + 1); i++) { solve(i); p += (int)s[i].size(); } } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; int L = 0, R = 0; for (int i = (1); i < (m + 1); i++) { cin >> e[i].u >> e[i].v >> e[i].c >> e[i].t; e[i].id = i - 1; R = max(R, e[i].t); s[e[i].u].push_back(e[i]); s[e[i].v].push_back(e[i]); } int ans = -1; while (L <= R) { int mid = (L + R) / 2; ts.init(3 * m); link(); for (int i = (1); i < (m + 1); i++) if (e[i].t > mid) { ts.add_set(e[i].id, 1); } if (ts.solve()) { ans = mid; R = mid - 1; } else L = mid + 1; } if (ans == -1) cout << No ; else { ts.init(3 * m); link(); for (int i = (1); i < (m + 1); i++) if (e[i].t > ans) ts.add_set(e[i].id, 1); ts.solve(); cout << Yes n ; vector<int> task; for (int i = 0; i < m; ++i) if (!ts.mark[i]) task.push_back(i + 1); cout << ans << << (int)task.size() << n ; for (auto v : task) cout << v << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; const long long MOD = 1000000007; long long n, k; long long pre[MAXN], suf[MAXN], fac[MAXN], ifac[MAXN]; inline long long quick_pow(long long x, long long k) { long long res = 1; while (k) { if (k & 1) (res *= x) %= MOD; (x *= x) %= MOD; k >>= 1; } return res; } inline void init() { pre[0] = suf[k + 3] = fac[0] = 1; for (int i = 1; i <= k + 2; i++) pre[i] = pre[i - 1] * (n - i) % MOD; for (int i = k + 2; i >= 1; i--) suf[i] = suf[i + 1] * (n - i) % MOD; for (int i = 1; i <= k + 2; i++) fac[i] = fac[i - 1] * i % MOD; ifac[k + 2] = quick_pow(fac[k + 2], MOD - 2); for (int i = k + 2 - 1; i >= 0; i--) ifac[i] = ifac[i + 1] * (i + 1) % MOD; } inline long long calc(int i, long long tmp) { return ((k - i) & 1 ? -1 : 1) * pre[i - 1] * suf[i + 1] % MOD * ifac[i - 1] % MOD * ifac[k + 2 - i] % MOD * tmp % MOD; } int main() { cin >> n >> k; init(); long long ans = 0, tmp = 0; for (int i = 1; i <= k + 2; i++) { (tmp += quick_pow(i, k)) %= MOD; (ans += calc(i, tmp) % MOD) %= MOD; } cout << (ans + MOD) % MOD; return 0; } |
#include <bits/stdc++.h> using namespace std; string st; double ans = 0.0, curr = 0.0; int flag = 0; int main() { cin >> st; for (int i = 0; i < st.size(); i++) { if ( a <= st[i] && st[i] <= z ) { ans += curr; curr = 0.0; continue; } if (st[i] == . ) { if (i + 3 < st.size() && 0 <= st[i + 3] && st[i + 3] <= 9 ) { curr = curr * 1000 + st[i + 1] * 100 + st[i + 2] * 10 + st[i + 3] - 48 * 111; i += 3; continue; } curr += (st[i + 1] * 10 + st[i + 2] - 48 * 11) / 100.0; i += 2; continue; } curr = curr * 10 + st[i] - 48; } ans += curr; string s = to_string(ans); s.erase(s.end() - 4, s.end()); int n = s.size(); stack<char> S; if (s[n - 1] != 0 || s[n - 2] != 0 ) S.push(s[n - 1]), S.push(s[n - 2]), S.push( . ); for (int i = n - 4, j = 1; i >= 0; i--, j++) { S.push(s[i]); if (j % 3 == 0 && i) S.push( . ); } while (!S.empty()) cout << S.top(), S.pop(); cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10, MAXM = 1e6 + 10; const int INF = INT_MAX, SINF = 0x3f3f3f3f; const long long llINF = LLONG_MAX; const int MOD = 1e9 + 7, mod = 998244353; const int inv2 = 5e8 + 4; long double x, y, z; long double a[MAXN]; string s[MAXN]; int main() { cin >> x >> y >> z; a[1] = powl(y, z) * log(x); a[2] = powl(z, y) * log(x); a[3] = z * y * log(x); a[4] = z * y * log(x); a[5] = powl(x, z) * log(y); a[6] = powl(z, x) * log(y); a[7] = z * x * log(y); a[8] = z * x * log(y); a[9] = powl(x, y) * log(z); a[10] = powl(y, x) * log(z); a[11] = x * y * log(z); a[12] = x * y * log(z); int cnt = max_element(a + 1, a + 13) - a; s[1] = x^y^z ; s[2] = x^z^y ; s[3] = (x^y)^z ; s[4] = (x^z)^y ; s[5] = y^x^z ; s[6] = y^z^x ; s[7] = (y^x)^z ; s[8] = (y^z)^x ; s[9] = z^x^y ; s[10] = z^y^x ; s[11] = (z^x)^y ; s[12] = (z^y)^x ; cout << s[cnt]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int sum(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; } int sub(int a, int b) { return a - b < 0 ? a - b + MOD : a - b; } int mul(int a, int b) { return (1LL * a * b) % MOD; } const int MAXN = 1e6 + 7; int shuru[MAXN], shesh[MAXN]; int zero[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; int n = s.size(); int zerosum = 1; int sheshsum = 0; int z = 0; for (int i = n - 1; i >= 0; i--) { if (s[i] == 0 ) { z++; if (i + z == n) zerosum = sum(zerosum, 1); zerosum = sub(zerosum, zero[z]); zero[z] = shuru[i + z]; zerosum = sum(zerosum, zero[z]); } else { z = 0; shesh[i] = zerosum; sheshsum = sum(sheshsum, shesh[i]); shuru[i] = sheshsum; } } if (z == n) { cout << n << n ; } else { cout << mul(z + 1, shuru[z]) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5E4 + 5; const int M = N * 17 * 17; int n, m, q, x, y, son[N], dep[N], fa[N], g[N], l[N], tot, f[N], mark[M], to[N], ch[M][2], sum, c[N], a[N], k, b[N]; long long ans[N], tr[M], C; vector<int> G[N]; int dfs(int x) { int y; son[x] = 1; dep[x] = dep[fa[x]] + 1; for (int i = 0; i < G[x].size(); i++) { son[x] += dfs(y = G[x][i]); if (son[y] > son[g[x]]) g[x] = y; } return son[x]; } void dfs2(int x, int pre) { l[x] = ++tot; b[tot] = x; f[x] = pre + 1; if (g[x]) dfs2(g[x], pre); for (int i = 0; i < G[x].size(); i++) if (G[x][i] != g[x]) dfs2(G[x][i], tot); } void push_down(int p, int l, int mid, int r, int &lc, int &rc) { if (!mark[p]) return; if (!lc) lc = ++sum; if (!rc) rc = ++sum; tr[lc] += (long long)mark[p] * (mid - l + 1), mark[lc] += mark[p]; tr[rc] += (long long)mark[p] * (r - mid), mark[rc] += mark[p]; mark[p] = 0; } long long get(int &p, int l, int r, int x, int y, int k) { if (x > r || y < l) return 0; if (!p) p = ++sum; if (x <= l && y >= r) { int len = r - l + 1; tr[p] += k * len; mark[p] += k; return tr[p] - k * len; } int mid = (l + r) / 2; push_down(p, l, mid, r, ch[p][0], ch[p][1]); long long ans = get(ch[p][0], l, mid, x, y, k) + get(ch[p][1], mid + 1, r, x, y, k); tr[p] = tr[ch[p][0]] + tr[ch[p][1]]; return ans; } void work(int x, int v, int k) { ans[v] += (long long)c[v] * c[v] * dep[x]; for (; x;) { ans[v] += 2ll * k * (get(to[v], 1, n, f[x], l[x], k) * c[v] - C * (dep[x] - dep[fa[b[f[x]]]])) * c[v]; x = fa[b[f[x]]]; } } int main() { cin >> n >> m >> q >> C; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) ans[i] = C * C * n; for (int i = 2; i <= n; i++) { scanf( %d , &fa[i]); G[fa[i]].push_back(i); } for (int i = 1; i <= m; i++) scanf( %d , &c[i]); dfs(1); dfs2(1, 0); for (int i = 1; i <= n; i++) work(i, a[i], 1); for (int i = 1; i <= q; i++) { scanf( %d%d , &k, &x); if (k == 1) { scanf( %d , &y); work(x, a[x], -1); work(x, y, 1); a[x] = y; } else printf( %.6f n , (double)ans[x] / n); } } |
#include <bits/stdc++.h> using namespace std; const int NN = 50010; const int INF = 0x3f3f3f3f; const int MOD = 100000, STA = 8000010; const long long LNF = 1LL << 60; const double EPS = 1e-8; const double OO = 1e15; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, 1, 0, -1}; const int day[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; inline int sign(double x) { return (x > EPS) - (x < -EPS); } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; } template <class T> inline T lcm(T a, T b, T d) { return a / d * b; } template <class T> inline T Min(T a, T b) { return a < b ? a : b; } template <class T> inline T Max(T a, T b) { return a > b ? a : b; } template <class T> inline T Min(T a, T b, T c) { return min(min(a, b), c); } template <class T> inline T Max(T a, T b, T c) { return max(max(a, b), c); } template <class T> inline T Min(T a, T b, T c, T d) { return min(min(a, b), min(c, d)); } template <class T> inline T Max(T a, T b, T c, T d) { return max(max(a, b), max(c, d)); } int N, M, T; int n, m, x, t, w, h; map<int, deque<int> > Q; struct TT { int g, p, t, id; } E[101111]; int tp[101111], a[101111], b[101111]; bool cp(TT a, TT b) { return a.p < b.p; } void init(int x, int now) { for (int i = 1; i <= n; i++) { if (E[i].g == x) Q[E[i].t - E[i].p].push_back(i); } for (int i = 1; i <= n; i++) if (E[i].g != x) { auto p = Q.find(E[i].t - E[i].p); if (p == Q.end() || p->second.empty()) { tp[i] = i; } else { tp[i] = p->second.back(); p->second.pop_back(); p->second.push_front(i); } } Q.clear(); } int main() { scanf( %d%d%d , &n, &w, &h); int g, p, t; for (int i = 1; i <= n; i++) { scanf( %d%d%d , &E[i].g, &E[i].p, &E[i].t); E[i].id = i; } sort(E + 1, E + n + 1, cp); init(1, 2); init(2, 1); for (int i = 1; i <= n; i++) { if (E[i].g == 1) { a[E[tp[i]].id] = E[i].p; b[E[tp[i]].id] = h; } else { a[E[tp[i]].id] = w; b[E[tp[i]].id] = E[i].p; } } for (int i = 1; i <= n; i++) { printf( %d %d n , a[i], b[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); ; int n, k; cin >> n >> k; while (n > 0 && k > 0) { k--; if (n % 10 == 0) n = n / 10; else n--; } cout << n << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long A[200005], tree[200005]; void update(int pos, long long v) { for (; pos < 200005; pos += pos & -pos) tree[pos] += v; } long long read(int pos) { long long ret = 0; for (; pos; pos -= pos & -pos) ret += tree[pos]; return ret; } int main() { ios::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(10); int i, size = 1, t, n, lo, hi; long long x, sum = 0, a; cin >> n; for (i = 1; i <= n; i++) { cin >> t; if (t == 1) { cin >> a >> x; lo = 1, hi = min((long long)size, a); update(lo, x); update(hi + 1, -x); sum += hi * x; } else { if (t == 2) { cin >> x; update(size + 1, x); update(size + 2, -x); size++; sum += x; } else { if (size >= 2) { long long val = read(size); update(size, -val); update(size + 1, val); size--; sum -= val; } } } cout << (sum * 1.0 / size) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> sg; map<int, bool> us; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { int x, d; cin >> x >> d; sg[x] = x + d; us[x] = true; if (us[x + d] && sg[x + d] == x && sg[x] == x + d) { cout << YES n ; return 0; } } cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int v = 0; map<int, int> s; for (int i = 19; s.size() < 10010; i += 9) { int kk = i; int c = 0; while (kk > 0) { c += kk % 10; kk /= 10; } if (c == 10) s[v++] = i; } cout << s[n - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; struct data { int le, ri, cnt; data(int le_ = 0, int ri_ = 0, int cnt_ = 0) { le = le_; ri = ri_; cnt = cnt_; } }; const int N = 1e6 + 10; int seg[4 * N + 10]; int brk[5][4 * N + 10]; int n; void add(int idx, bool b, int L = 0, int R = n, int id = 1) { if (L == R - 1) { brk[b][id]++; return; } int mid = (L + R) / 2; if (idx < mid) add(idx, b, L, mid, 2 * id + 0); else add(idx, b, mid, R, 2 * id + 1); seg[id] = seg[2 * id + 0] + seg[2 * id + 1] + min(brk[0][2 * id + 0], brk[1][2 * id + 1]); brk[0][id] = brk[0][2 * id + 1] + max(0, brk[0][2 * id + 0] - brk[1][2 * id + 1]); brk[1][id] = brk[1][2 * id + 0] + max(0, brk[1][2 * id + 1] - brk[0][2 * id + 0]); return; } data get(int l, int r, int L = 0, int R = n, int id = 1) { if (L == l && R == r) return data(brk[0][id], brk[1][id], seg[id]); int mid = (L + R) / 2; data le, ri; if (l < mid) le = get(l, min(r, mid), L, mid, 2 * id + 0); if (r > mid) ri = get(max(l, mid), r, mid, R, 2 * id + 1); data ret; ret.cnt = le.cnt + ri.cnt + min(le.le, ri.ri); ret.le = ri.le + max(0, le.le - ri.ri); ret.ri = le.ri + max(0, ri.ri - le.le); return ret; } int main() { ios_base::sync_with_stdio(false); string s; cin >> s, n = s.size(); for (int i = 0; i < s.size(); i++) if (s[i] == ( ) add(i, 0); else add(i, 1); int q; cin >> q; while (q--) { int l, r; cin >> l >> r, l--; cout << 2 * get(l, r).cnt << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long f[1 << 10], M = 1000000; long long l, r, k; class Matrix { public: long long a[3][3]; Matrix(int fib = 0) { memset(a, 0, sizeof(a)); if (fib) a[1][2] = a[2][1] = a[2][2] = 1; } Matrix operator*(const Matrix &v) { Matrix ret; for (int i = 1; i <= 2; ++i) for (int j = 1; j <= 2; ++j) for (int k = 1; k <= 2; ++k) ret.a[i][k] = (ret.a[i][k] + a[i][j] * v.a[j][k]) % M; return ret; } void print() { cout << a[1][2] % M << endl; } }; Matrix one(1); long long solve(long long l, long long r, long long v) { l = (l - 1) / v + 1; r = r / v; return r - l + 1; } Matrix fib(long long u) { if (u == 1) return one; Matrix cache = fib(u / 2); cache = cache * cache; if (u % 2) cache = cache * one; return cache; } int main() { cin >> M >> l >> r >> k; long long ans = 1; if (k >= 1000000) { ans = (r - l + 1) / (k - 1) + 2; while (solve(l, r, ans) < k) --ans; } else { for (int i = 1; i + k - 1 <= 1000000; ++i) { long long tl = (l - 1) / i + 1, tr = r / (i + k - 1); if (tl <= tr) ans = max(ans, tr); } } fib(ans).print(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { return (a > b ? a : b); } long long min(long long a, long long b) { return (a < b ? a : b); } void algo() { string s1, s2; char c; cin >> s1 >> s2; long long j = 0, len = s1.size(); for (long long i = 0; i < len; i++) { c = s1[i]; long long k = j; if (s1[i + 1] == c && i != len - 1) { if (c == s2[j]) j++; else { cout << NO ; return; } } else { while (c == s2[j]) { j++; } } if (k == j) { cout << NO ; return; } } if (j != s2.size()) cout << NO ; else cout << YES ; } int main() { ios::sync_with_stdio(0); cin.tie(0); long long t; cin >> t; while (t--) { algo(); cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; double const EPS = 1.0E-9; int const MOD = (int)1e9 + 7; inline void read(char* s) { scanf( %s , s); } inline void read(int& x) { scanf( %d , &(x)); } inline void read(long long& x) { scanf( %lld , &x); } inline void read(double& x) { scanf( %lf , &x); } inline void writeln(int x) { printf( %d n , x); } inline void writeln(long long x) { printf( %lld n , x); } inline void writeln(double x) { printf( %.12f n , x); } template <typename... T> void read(T&... args) { using swallow = int[]; swallow w = {0, (read(args), 0)...}; } inline long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); } inline long long lcm(long long x, long long y) { return x == 0 && y == 0 ? 0 : x / gcd(x, y) * y; } inline long long powmod(long long x, long long n, long long m = MOD) { long long r = 1; while (n) { if (n & 1) r = (r * x) % m; x = (x * x) % m; n /= 2; } return r; } static int leap(int y) { return y % 4 == 0 && y % 100 != 0 || y % 400 == 0; } static int const month[2][12] = { {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}, {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}}; static const int N = 1 << 18; static const int M = 1 << 20; int freq[N]; int n, k; int f[N]; int h[12]; int hw[5012][512]; static int solve() { read(n, k); for (int i = 1; i <= n * k; ++i) { int a; read(a); freq[a]++; } for (int i = 1; i <= n; ++i) { int x; read(x); f[x]++; } for (int i = 1; i <= k; ++i) { read(h[i]); } for (int i = 0; i < 5012; ++i) { for (int j = 0; j < 512; ++j) { if (i == 0 || j == 0) { hw[i][j] = 0; } else { hw[i][j] = 0; for (int l = 0; l <= k && l <= i; ++l) { hw[i][j] = std::max(hw[i][j], hw[i - l][j - 1] + h[l]); } } } } long long ans = 0; for (int i = (0), vzq_b = (N); i < vzq_b; ++i) { int fa = f[i]; ans += hw[freq[i]][fa]; } writeln(ans); return 0; } int main(int argc, char* argv[]) { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; using ull = unsigned long long; const int MAX_LENGTH = 100000 + 8; const ull B = 100000007ULL; char s[3][MAX_LENGTH]; ull H[3][MAX_LENGTH], B_to[MAX_LENGTH] = {1ULL}; int id[3] = {0, 1, 2}, len[3]; void init_hash() { for (int i = 0; i < 3; ++i) { for (int j = 1; j < len[i] + 1; ++j) { H[i][j] = H[i][j - 1] * B + s[i][j]; } } int n = max(max(len[0], len[1]), len[2]); for (int i = 1; i < n + 1; ++i) { B_to[i] = B_to[i - 1] * B; } } inline ull hash_of(ull *h, int b, int l) { return h[b + l - 1] - h[b - 1] * B_to[l]; } bool contain(int a, int b) { if (len[a] < len[b]) return false; ull bh = H[b][len[b]]; for (int i = 1; i + len[b] <= len[a]; ++i) if (hash_of(H[a], i, len[b]) == bh) return true; return false; } int overlap(int a, int b) { int ans = 0; for (int i = 1; i <= min(len[a], len[b]); ++i) { if (hash_of(H[a], len[a] - i + 1, i) == hash_of(H[b], 1, i)) ans = i; } return ans; } int solve() { int ans = MAX_LENGTH * 3; for (int i = 0; i < 2; ++i) { for (int j = i + 1; j < 3; ++j) { if (contain(i, j) || contain(j, i)) { int x = len[i] > len[j] ? i : j; int y = 3 - i - j; if (contain(x, y) || contain(y, x)) return max(len[x], len[y]); return len[x] + len[y] - max(overlap(x, y), overlap(y, x)); } } } do ans = min(ans, len[0] + len[1] + len[2] - overlap(id[0], id[1]) - overlap(id[1], id[2])); while (next_permutation(id, id + 3)); return ans; } int main() { for (int i = 0; i < 3; ++i) { gets(s[i] + 1); len[i] = strlen(s[i] + 1); } init_hash(); printf( %d n , solve()); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (a < b) swap(a, b); if (b == 0) return a; while (b) { long long int re = a % b; a = b; b = re; } return a; } vector<int> a[1000 + 10], b[1000 + 10]; vector<int> c1(1000 + 10, 0), c2(1000 + 10, 0); void dfs(int i, int k, int p) { if (p) c1[i] = k; else c2[i] = k; if (p) { for (int j : a[i]) { if (c1[j] == 0) dfs(j, k, p); } } else { for (int j : b[i]) { if (c2[j] == 0) dfs(j, k, p); } } } int main() { int n, m1, m2; cin >> n >> m1 >> m2; for (int i = 0; i < m1; i++) { int u, v; cin >> u >> v; a[u].push_back(v); a[v].push_back(u); } for (int i = 0; i < m2; i++) { int u, v; cin >> u >> v; b[u].push_back(v); b[v].push_back(u); } int k = 1; for (int i = 1; i < n + 1; i++) { if (c1[i] == 0) { dfs(i, k, 1); k++; } } k = 1; vector<pair<long long int, long long int> > ans; for (int i = 1; i < n + 1; i++) { if (c2[i] == 0) { dfs(i, k, 0); k++; } } map<int, int> mp1, mp2; for (int i = 0; i < n + 1; i++) { mp1[i] = i; mp2[i] = i; } for (int i = 1; i < n + 1; i++) { for (int j = 1; j < n + 1; j++) { int cai = mp1[c1[i]], caj = mp1[c1[j]], cbi = mp2[c2[i]], cbj = mp2[c2[j]]; if (cai != caj && cbi != cbj) { ans.push_back({i, j}); mp1[c1[j]] = mp1[c1[i]] = -1; mp2[c2[j]] = mp2[c2[i]] = -1; } } } cout << ans.size() << endl; for (auto it : ans) cout << it.first << << it.second << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int val[maxn]; int sito[maxn]; int main() { ios::sync_with_stdio(false); for (int i = 0; i < maxn; i++) { sito[i] = true; } vector<int> v; sito[0] = sito[1] = false; for (int i = 2; i < maxn; i++) { if (sito[i]) { v.push_back(i); if (i < 1000) { for (int j = i * i; j < maxn; j += i) { sito[j] = false; } } } } int n; cin >> n; for (int i = 0; i < n; i++) { cin >> val[i]; val[i]--; } vector<pair<int, int> > ss; for (int i = 0; i < n;) { int pos = i; if (pos == val[pos]) { i++; continue; } while (pos != val[pos]) { int l = 0, r = v.size() - 1; int best = 0; while (l <= r) { int mid = (l + r) / 2; if (pos + v[mid] - 1 <= val[pos]) { l = mid + 1; best = max(best, v[mid] - 1); } else { r = mid - 1; } } ss.push_back(make_pair(pos + 1, pos + best + 1)); swap(val[pos], val[pos + best]); pos += best; } } cout << ss.size() << endl; for (int i = 0; i < ss.size(); i++) { cout << ss[i].first << << ss[i].second << n ; } } |
#include <bits/stdc++.h> using namespace std; long long sqr(long long x) { return x * x; } bool done = false; int p[8][3]; bool same(double x, double y) { return abs(x - y) < 1e-9; } int cnt = 0; void backtr(int idx) { if (done) return; if (idx == 7) { cnt++; map<long long, int> ck; vector<long long> t(28), v(3, 1); int idx = 0, idx2 = 0; long long l1 = -1, l2 = -1, l3 = -1; for (int i = 0; i < 8; ++i) for (int j = i + 1; j < 8; ++j) { t[idx++] = sqr(p[i][0] - p[j][0]) + sqr(p[i][1] - p[j][1]) + sqr(p[i][2] - p[j][2]); if (!ck.count(t[idx - 1])) { if (idx2 == 3) return; v[idx2++] = t[idx - 1], ck[t[idx - 1]] = 1; } else ck[t[idx - 1]]++; } sort(v.begin(), v.end()); if (ck[v[0]] == 12 && ck[v[1]] == 12 && ck[v[2]] == 4 && 2 * v[0] == v[1] && v[0] + v[1] == v[2]) { done = true; printf( YES n ); for (int i = 0; i < 8; ++i) printf( %d %d %d n , p[i][0], p[i][1], p[i][2]); } } else { do { backtr(idx + 1); if (done) return; } while (next_permutation(p[idx], p[idx] + 3)); sort(p[idx], p[idx] + 3); } } int main() { clock_t start_time, end_time; start_time = clock(); for (int i = 0; i < 8; ++i) scanf( %d%d%d , &p[i][0], &p[i][1], &p[i][2]), sort(p[i], p[i] + 3); backtr(0); if (!done) printf( NO ); end_time = clock(); } |
#include <bits/stdc++.h> using namespace std; const long long N = 30; bool vis[N]; int id1 = -1, id2 = -1; char ch; int main() { ios_base::sync_with_stdio(0); cin.tie(0); string s; cin >> s; int n = 27; for (int i = 0; i < 27; i++) { if (vis[s[i] - A ]) { id2 = i; ch = s[i]; } else { vis[s[i] - A ] = true; } } for (int i = 0; i < 27; i++) { if (s[i] == ch) { id1 = i; break; } } if (id2 == id1 + 1) { cout << Impossible n ; return 0; } if ((id2 - id1 - 1) % 2 == 1) { int cnt = id2 - id1 - 1; int rast = cnt / 2, chap = n - id2 - 1; if (rast + chap + 1 <= 13) { int rem = 13 - rast - chap - 1; for (int i = rem; i < id1; i++) cout << s[i]; for (int i = id1 + 1; i <= id1 + cnt / 2 + 1; i++) cout << s[i]; cout << n ; for (int i = rem - 1; i >= 0; i--) cout << s[i]; for (int i = n - 1; i > id2; i--) cout << s[i]; cout << ch; for (int i = id2 - 1; i >= id2 - cnt / 2; i--) cout << s[i]; cout << n ; } else { int rem = rast + chap + 1 - 13; for (int i = 0; i < rem; i++) cout << s[n - rem + i]; for (int i = 0; i < id1; i++) cout << s[i]; for (int i = id1 + 1; i <= id1 + cnt / 2 + 1; i++) cout << s[i]; cout << n ; for (int i = n - rem - 1; i > id2; i--) cout << s[i]; cout << ch; for (int i = id2 - 1; i >= id2 - cnt / 2; i--) cout << s[i]; } } else { int cnt = id2 - id1 - 1; int rast = cnt / 2, chap = n - id2 - 1; if (rast + chap + 1 <= 13) { int rem = 13 - rast - chap - 1; for (int i = rem; i < id1; i++) cout << s[i]; for (int i = id1 + 1; i <= id1 + cnt / 2; i++) cout << s[i]; cout << n ; for (int i = rem - 1; i >= 0; i--) cout << s[i]; for (int i = n - 1; i > id2; i--) cout << s[i]; cout << ch; for (int i = id2 - 1; i >= id2 - cnt / 2; i--) cout << s[i]; cout << n ; } else { int rem = rast + chap + 1 - 13; for (int i = 0; i < rem; i++) cout << s[n - rem + i]; for (int i = 0; i < id1; i++) cout << s[i]; for (int i = id1 + 1; i <= id1 + cnt / 2; i++) cout << s[i]; cout << n ; for (int i = n - rem - 1; i > id2; i--) cout << s[i]; cout << ch; for (int i = id2 - 1; i >= id2 - cnt / 2; i--) cout << s[i]; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 4; void solve() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; float min = 4.5 * n; int mn = (int)min; if (min - mn > 0) mn++; int sum = 0; for (int i = 0; i < n; i++) sum += arr[i]; int req = mn - sum; if (req <= 0) { cout << 0 << endl; return; } sort(arr, arr + n); int ans = 0, i = 0; while (req > 0) { req -= 5 - arr[i]; i++; ans++; } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, i; scanf( %d%d , &n, &k); char s[n]; scanf( %s , s); for (i = 0; i < n; ++i) { if (s[i] == G ) { for (int j = i + k; j < n; j += k) { if (s[j] == # ) { printf( NO n ); return 0; } else if (s[j] == T ) { printf( YES n ); return 0; } } printf( NO n ); return 0; } else if (s[i] == T ) { for (int j = i + k; j < n; j += k) { if (s[j] == # ) { printf( NO n ); return 0; } else if (s[j] == G ) { printf( YES n ); return 0; } } printf( NO n ); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int S = 550; int n, q, a[N]; struct Block { int lid, rid; deque<int> que; int mp[N]; Block() {} void init() { lid = rid = 0; que.clear(); memset(mp, 0, sizeof mp); } void addf(int x) { que.push_front(x); mp[x]++; } void addb(int x) { que.push_back(x); mp[x]++; } void delf() { if (que.empty()) return; int x = que.front(); que.pop_front(); mp[x]--; } void delb() { if (que.empty()) return; int x = que.back(); que.pop_back(); mp[x]--; } } all[S]; int tot; void init() { for (int i = 0; i < S; ++i) all[i].init(); int id = 1; tot = 0; for (int i = 0; id <= n; ++i) { tot++; all[i].lid = all[i].rid = id; for (int j = 1; j <= S && id <= n; ++j) { all[i].addb(a[id]); all[i].rid++; id++; } } for (int i = 0; i < tot; ++i) all[i].rid--; } int st[N], top; void mov(int l, int r) { int sx = 0, tx = 0; for (int i = 0; i < tot; ++i) { if (all[i].lid <= l && l <= all[i].rid) { sx = i; } if (all[i].lid <= r && r <= all[i].rid) { tx = i; } } for (int i = sx + 1; i <= tx; ++i) { all[i].addf(all[i - 1].que.back()); all[i - 1].delb(); } int val = 0; top = 0; for (int i = all[tx].rid; i > r; --i) { st[top++] = all[tx].que.back(); all[tx].delb(); } val = all[tx].que.back(); all[tx].delb(); while (top > 0) all[tx].addb(st[--top]); for (int i = all[sx].lid; i < l; ++i) { st[top++] = all[sx].que.front(); all[sx].delf(); } all[sx].addf(val); while (top > 0) all[sx].addf(st[--top]); } int cal(int ip, int l, int r, int k) { int res = 0; top = 0; for (int i = 1; i <= l - 1; ++i) { st[top++] = all[ip].que.front(); all[ip].delf(); } int alx = all[ip].rid - all[ip].lid + 1; for (int i = 1; i <= alx - r; ++i) { st[top++] = all[ip].que.back(); all[ip].delb(); } res = all[ip].mp[k]; for (int i = 1; i <= alx - r; ++i) { all[ip].addb(st[--top]); } for (int i = 1; i <= l - 1; ++i) { all[ip].addf(st[--top]); } return res; } int qry(int l, int r, int k) { int res = 0; for (int i = 0; i < tot; ++i) { if (all[i].lid <= l && r <= all[i].rid) return cal(i, l - all[i].lid + 1, r - all[i].lid + 1, k); if (l <= all[i].lid && all[i].rid <= r) res += all[i].mp[k]; if (all[i].lid < l && l <= all[i].rid) { res += cal(i, l - all[i].lid + 1, all[i].rid - all[i].lid + 1, k); } if (all[i].lid <= r && all[i].rid > r) { res += cal(i, 1, r - all[i].lid + 1, k); } } return res; } int scan() { int res = 0; char ch; while ((ch = getchar()) && (ch != && ch != n )) res = res * 10 + ch - 0 ; return res; } int Run() { n = scan(); for (int i = 1; i <= n; ++i) a[i] = scan(); init(); int lans = 0; q = scan(); while (q--) { int op, l, r; op = scan(), l = scan(), r = scan(); l = (l + lans - 1) % n + 1; r = (r + lans - 1) % n + 1; if (l > r) swap(l, r); if (op == 1) { mov(l, r); } else { int k; k = scan(); k = (k + lans - 1) % n + 1; lans = qry(l, r, k); printf( %d n , lans); } } return 0; } int main() { return Run(); } |
#include <bits/stdc++.h> using namespace std; int n, f, r[4]; char names[4][16] = { Gryffindor , Hufflepuff , Ravenclaw , Slytherin }; int main() { scanf( %d , &n); vector<vector<int> > v; v.push_back(vector<int>(4)); for (int k = 0; k < (int)(n); k++) { char op; scanf( %c , &op); ((void)0); if (op != ? ) { for (int i = 0; i < (int)(4); i++) if (op == names[i][0]) { for (int j = 0; j < (int)(v.size()); j++) v[j][i]++; } } else { vector<vector<int> > nv; for (int j = 0; j < (int)(v.size()); j++) { int mx = 1 << 30; for (int i = 0; i < (int)(4); i++) mx = min(mx, v[j][i]); for (int i = 0; i < (int)(4); i++) if (v[j][i] == mx) { nv.push_back(v[j]); nv.back()[i]++; } } sort(nv.begin(), nv.end()); nv.erase(unique(nv.begin(), nv.end()), nv.end()); v = nv; } } for (int i = 0; i < (int)(v.size()); i++) { int mx = 1 << 30; for (int j = 0; j < (int)(4); j++) mx = min(mx, v[i][j]); for (int j = 0; j < (int)(4); j++) if (v[i][j] == mx) r[j] = 1; } for (int i = 0; i < (int)(4); i++) if (r[i]) puts(names[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int i, L; char s[100005]; int main() { scanf( %s , &s); L = strlen(s); for (i = 0; i < L; i++) printf( %c , s[i]); for (i = L - 1; i >= 0; i--) printf( %c , s[i]); } |
#include <bits/stdc++.h> using namespace std; int N; vector<int> adj[200005]; int dfs(int cur, int prv, bool valid) { int cnt = valid; for (int nxt : adj[cur]) if (nxt != prv) cnt += dfs(nxt, cur, !valid); return cnt; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for (int i = 0, a, b; i < N - 1; i++) { cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } int cnt = dfs(1, 0, true); cout << min(cnt, N - cnt) - 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; map<string, string> m; int main() { long long int n, mm, i; string s, b, s1, b1; cin >> n >> mm; for (i = 0; i < n; i++) { cin >> s >> b; m[b] = s; } char c; for (i = 0; i < mm; i++) { cin >> s1 >> b1; int l = b1.length(); cout << s1 << << b1.substr(0, l - 1) << ; # << m[b1.substr(0, l - 1)] << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2000010; long long n, m, s, l; vector<pair<long long, long long> > Adj[N]; long long Dis[N], Ans; set<pair<long long, long long> > Res; vector<pair<long long, pair<long long, long long> > > Edges; void Dik() { for (int i = 0; i <= n; i++) Dis[i] = 1e18; Dis[s] = 0; set<pair<long long, long long> > S; S.insert({0, s}); while (!S.empty()) { auto Cur = *S.begin(); S.erase(S.begin()); for (int i = 0; i < Adj[Cur.second].size(); i++) { int to = Adj[Cur.second][i].first; long long w = Adj[Cur.second][i].second; if (Dis[to] > Cur.first + w) { Dis[to] = Cur.first + w; S.insert({Dis[to], to}); } } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> s; for (int i = 0; i < m; i++) { int a, b, w; cin >> a >> b >> w; Edges.push_back({w, {a, b}}); Adj[a].push_back({b, w}); Adj[b].push_back({a, w}); } cin >> l; if (l == 0) { cout << 1 << endl; return 0; } Dik(); for (int i = 1; i <= n; i++) if (Dis[i] == l) Ans++; for (int i = 0; i < Edges.size(); i++) { int a = Edges[i].second.first; int b = Edges[i].second.second; long long w = Edges[i].first; if (Dis[a] < l && Dis[a] + w > l && (w - (l - Dis[a])) + Dis[b] >= l) { Ans++; } if (Dis[b] < l && Dis[b] + w > l && (w - (l - Dis[b])) + Dis[a] >= l) { Ans++; } if (Dis[a] < l && Dis[a] + w > l && (w - (l - Dis[a])) + Dis[b] >= l) { if (Dis[b] < l && Dis[b] + w > l && (w - (l - Dis[b])) + Dis[a] >= l) { if (w - (l - Dis[a]) == (l - Dis[b])) Ans--; } } } cout << Ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n, k, x, y; cin >> n >> k; if (n > k) { x = k * (k + 1); x = x / 2; cout << x << endl; } else { y = n - 1; x = y * (y + 1); x = x / 2; cout << x + 1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPSILON = 1e-9; const double PI = acos(0.0) * 2; const int MOD = 1000000007; const int INF = 0x3c3c3c3c; const long long INFL = 0x3c3c3c3c3c3c3c3c; const int MAX_N = 102; long long S, X; long long solve(long long sum, int pos) { if (sum > S) return 0; if (pos < 0) return sum == S; long long ret = 0; if (X & (1ll << pos)) { if ((1ll << pos) + sum <= S) ret += 2 * solve(sum + (1ll << pos), pos - 1); } else { if ((1ll << (pos + 1)) + sum <= S) ret += solve(sum + 2 * (1ll << pos), pos - 1); if (S - sum <= 2 * ((1ll << pos) - 1)) ret += solve(sum, pos - 1); } return ret; } int main() { scanf( %lld%lld , &S, &X); cout << solve(0, 60) - (X == S ? 2 : 0); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n = 0; long long q, p = 1; cin >> q; for (int i = 0; i < 2; i++) { for (long long s = 2; s * s <= q; s++) { if (q % s == 0) { n++; p *= s; q /= s; break; } } } if (n == 2 && q > 1 || n == 0) { cout << 1 << endl; cout << (n == 0 ? 0 : p) << endl; } else { cout << 2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 212345; int seg[4 * N], v[N], tin[N], tout[N], ans[N]; int a, b, n, q; void init(int r, int i, int j) { if (i == j) { seg[r] = v[i]; } else { init(2 * r, i, (i + j) / 2); init(2 * r + 1, (i + j) / 2 + 1, j); seg[r] = min(seg[2 * r], seg[2 * r + 1]); } } int query(int r, int i, int j) { if (b < i || a > j) return 0x3f3f3f3f; if (i >= a && j <= b) { return seg[r]; } else { int L = query(2 * r, i, (i + j) / 2); int R = query(2 * r + 1, (i + j) / 2 + 1, j); return min(L, R); } } void update(int r, int i, int j, int pos, int val) { if (pos < i || pos > j) return; if (i == j) { seg[r] = val; } else { update(2 * r, i, (i + j) / 2, pos, val); update(2 * r + 1, (i + j) / 2 + 1, j, pos, val); seg[r] = min(seg[2 * r], seg[2 * r + 1]); } } set<int> zeros; int main(void) { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> q; int mx = 0; for (int i = 1; i <= n; i++) { cin >> v[i]; if (v[i] == 0) { zeros.emplace(i); v[i] = 0x3f3f3f3f; } else { if (tin[v[i]] == 0) tin[v[i]] = i; tout[v[i]] = i; mx = max(mx, v[i]); } } if (zeros.size() == n) { cout << YES << endl; for (int i = 1; i <= n; i++) cout << q << ; cout << endl; return 0; } if (mx != q and zeros.size() == 0) { cout << NO << endl; return 0; } init(1, 1, n); if (mx != q and zeros.size()) { auto it = zeros.begin(); update(1, 1, n, *it, q); zeros.erase(it); } for (int i = q; i >= 1; i--) { if (tin[i] == 0) continue; a = tin[i]; b = tout[i]; if (query(1, 1, n) < i) { cout << NO << endl; return 0; } auto it = zeros.lower_bound(tin[i]); while (it != zeros.end() and *it <= tout[i]) { update(1, 1, n, *it, i); it = zeros.erase(it); } } for (int i = 1; i <= n; i++) { a = i; b = i; ans[i] = query(1, 1, n); } for (int i = 2; i <= n; i++) { if (ans[i] == 0x3f3f3f3f and ans[i - 1] != 0x3f3f3f3f) ans[i] = ans[i - 1]; } for (int i = n - 1; i >= 1; i--) { if (ans[i] == 0x3f3f3f3f and ans[i + 1] != 0x3f3f3f3f) ans[i] = ans[i + 1]; } cout << YES << endl; for (int i = 1; i <= n; i++) { assert(ans[i] != 0x3f3f3f3f); cout << ans[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int th = 0; for (int i = 1; i < n; i++) { th += i; th %= n; cout << (th + 1) << ; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.