Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; struct bing { int fa[N]; void init() { for (int i = (1); i < (N); i++) fa[i] = i; } int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } void unite(int x, int y) { fa[find(x)] = find(y); } bool same(int x, int y) { return find(x) == find(y); } } bi[2]; int n, m1, m2; int main() { for (int i = (0); i < (2); i++) bi[i].init(); cin >> n >> m1 >> m2; int op = m1 > m2 ? 0 : 1; for (int i = (1); i < (m1 + 1); i++) { int u, v; scanf( %d%d , &u, &v); bi[op].unite(u, v); } for (int i = (1); i < (m2 + 1); i++) { int u, v; scanf( %d%d , &u, &v); bi[1 - op].unite(u, v); } printf( %d n , min(n - 1 - m1, n - 1 - m2)); for (int i = (1); i < (n + 1); i++) if (!bi[0].same(1, i) && !bi[1].same(1, i)) { bi[0].unite(1, i), bi[1].unite(1, i); printf( %d %d n , 1, i); } for (int a = 2, b = 2; a <= n; a++) { if (bi[0].same(1, a)) continue; while (b <= n && bi[1].same(1, b)) b++; if (b <= n) { bi[0].unite(a, b), bi[1].unite(a, b); printf( %d %d n , a, b); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, m, n, rez = 0; int a[300]; bool b[300] = {0}; bool c; cin >> n >> k; for (i = 1; i <= 2 * n + 1; i++) cin >> a[i]; for (j = 0; j < k; j++) { c = true; i = 2; while (c) { if (!b[i] && a[i] > a[i - 1] + 1 && a[i] > a[i + 1] + 1) { a[i]--; b[i] = true; c = false; } i += 2; } } for (i = 1; i <= 2 * n + 1; i++) cout << a[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; const int MAXM = 1e6 + 10; const int MAXLOG = 20; struct Edge { int x, y, w; int id; } edge[MAXM]; int T, n, m, i; int val; vector<pair<int, int> > e[MAXN]; int fa[MAXN], anc[MAXN][MAXLOG], dep[MAXN]; int ans[MAXM]; int mx[MAXN][MAXLOG]; bool on_mst[MAXM]; inline bool cmp(Edge a, Edge b) { return a.w < b.w; } inline int get_root(int x) { if (fa[x] == x) return x; return fa[x] = get_root(fa[x]); } inline void kruskal() { int i, x, y, sx, sy; int w; for (i = 1; i <= n; i++) fa[i] = i; sort(edge + 1, edge + m + 1, cmp); for (i = 1; i <= m; i++) { x = edge[i].x; y = edge[i].y; w = edge[i].w; sx = get_root(x); sy = get_root(y); if (sx != sy) { fa[sx] = sy; on_mst[edge[i].id] = 1; e[x].push_back(make_pair(y, w)); e[y].push_back(make_pair(x, w)); } } } inline void build(int u) { int i, v; for (i = 1; i < MAXLOG; i++) { anc[u][i] = anc[anc[u][i - 1]][i - 1]; mx[u][i] = max(mx[u][i - 1], mx[anc[u][i - 1]][i - 1]); } for (i = 0; i < e[u].size(); i++) { v = e[u][i].first; if (anc[u][0] != v) { dep[v] = dep[u] + 1; anc[v][0] = u; mx[v][0] = e[u][i].second; build(v); } } } inline int get(int x, int y) { int i, t; int ans = 0; if (dep[x] > dep[y]) swap(x, y); t = dep[y] - dep[x]; for (i = 0; i < MAXLOG; i++) { if (t & (1 << i)) { ans = max(ans, mx[y][i]); y = anc[y][i]; } } if (x == y) return ans; for (i = MAXLOG - 1; i >= 0; i--) { if (anc[x][i] != anc[y][i]) { ans = max(ans, max(mx[x][i], mx[y][i])); x = anc[x][i]; y = anc[y][i]; } } return max(ans, max(mx[x][0], mx[y][0])); } int main() { scanf( %d%d , &n, &m); if (m == n - 1) return 0; for (i = 1; i <= m; i++) { scanf( %d%d%d , &edge[i].x, &edge[i].y, &edge[i].w); edge[i].id = i; } kruskal(); build(1); for (int i = 1; i <= m; ++i) { if (!on_mst[edge[i].id]) ans[edge[i].id] = get(edge[i].x, edge[i].y); } for (int i = 1; i <= m; ++i) if (!on_mst[i]) printf( %d n , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; using namespace std; int M1(int x) { return x >= 1000000007 ? x - 1000000007 : x; } int M2(int x) { return x >= 1000000009 ? x - 1000000009 : x; } struct Hash { int a, b; Hash() { a = b = 0; } Hash(int a, int b) : a(a), b(b) {} Hash(int a) : a(a), b(a) {} bool operator<(const Hash& h) const { return a == h.a ? b < h.b : a < h.a; } bool operator!=(const Hash& h) const { return a != h.a || b != h.b; } bool operator==(const Hash& h) const { return a == h.a && b == h.b; } Hash operator+(const Hash& h) const { return Hash(M1(a + h.a), M2(b + h.b)); } Hash operator-(const Hash& h) const { return Hash(M1(a - h.a + 1000000007), M2(b - h.b + 1000000009)); } Hash operator*(const Hash& h) const { return Hash(((long long)a * h.a) % 1000000007, ((long long)b * h.b) % 1000000009); } Hash inv() const { return Hash(M1(1000000007 - a), M2(1000000009 - b)); } }; struct Hash_map { Hash v[11009989 + 1]; int val[11009989 + 1], head[11009989 + 1], nxt[11009989 + 1], ptr; void clear() { ptr = 0; } void insert(Hash a) { int x = (19260817ll * a.a + a.b) % 11009989; for (int y = head[x]; y; y = nxt[y]) if (v[y] == a) return; v[++ptr] = a, nxt[ptr] = head[x], head[x] = ptr; } int count(Hash a) { int x = (19260817ll * a.a + a.b) % 11009989; for (int y = head[x]; y; y = nxt[y]) if (v[y] == a) return true; return false; } int& operator[](Hash a) { int x = (19260817ll * a.a + a.b) % 11009989; for (int y = head[x]; y; y = nxt[y]) if (v[y] == a) return val[y]; v[++ptr] = a, nxt[ptr] = head[x], head[x] = ptr; return val[ptr]; } } st; Hash pw[100100], _pw[100100]; struct Data { int len, id; Hash h; }; int anses[100100], prec[100100], dep[100100], fa[21][100100], n, m; vector<pair<int, int> > G[100100]; vector<Data> Q[100100]; void dfs(int u, int f) { fa[0][u] = f; for (auto c : G[u]) if (c.first != f) { dep[c.first] = dep[u] + 1; pw[c.first] = pw[u] * Hash(19260817, 20010911) + Hash(c.second, c.second); prec[c.first] = c.second; dfs(c.first, u); } } Hash get(int l, int r) { return pw[l] - pw[r] * _pw[dep[l] - dep[r]]; } int lca(int u, int v) { if (dep[u] < dep[v]) swap(u, v); int d = dep[u] - dep[v]; for (int i = 0; d >> i; i++) if (d >> i & 1) u = fa[i][u]; if (u == v) return u; for (int i = 19; i >= 0; --i) if (fa[i][u] ^ fa[i][v]) u = fa[i][u], v = fa[i][v]; return fa[0][u]; } int jmp(int u, int d) { for (int i = 0; d >> i; i++) if (d >> i & 1) u = fa[i][u]; return u; } Hash geth(char* s) { Hash ret = 0; for (int i = 0; s[i]; i++) ret = ret * Hash(19260817, 20010911) + (s[i]); return ret; } int kmp(char* t, char* s) { static int f[100100]; int ns = strlen(s); for (int i = 0; i < ns; ++i) f[i] = 0; f[0] = -1; for (int i = 1; s[i]; i++) { int j = f[i - 1]; while (j != -1 && s[j + 1] != s[i]) j = f[j]; if (s[j + 1] == s[i]) j++; f[i] = j; } int ans = 0; for (int i = 0, x = -1; t[i]; i++) { while (x != -1 && s[x + 1] != t[i]) x = f[x]; if (s[x + 1] == t[i]) x++; if (x == ns - 1) ans++; } return ans; } void dfs2(int u, int f) { for (int i = 1, x = f; i <= 100 && x; i++) { st[get(u, x)]++; x = fa[0][x]; } for (auto c : Q[u]) { anses[abs(c.id)] += (c.id > 0 ? 1 : -1) * st[c.h]; } for (auto c : G[u]) if (c.first != f) dfs2(c.first, u); for (int i = 1, x = f; i <= 100 && x; i++) st[get(u, x)]--, x = fa[0][x]; } int main() { scanf( %d , &n); _pw[0] = Hash(1, 1); for (int i = 1; i <= n; ++i) _pw[i] = _pw[i - 1] * Hash(19260817, 20010911); for (int i = 2, u, v; i <= n; ++i) { char s[2]; scanf( %d%d%s , &u, &v, s); G[u].push_back(pair<int, int>(v, s[0])); G[v].push_back(pair<int, int>(u, s[0])); } dfs(1, 0); for (int i = 1; i < 20; ++i) for (int j = 1; j <= n; ++j) fa[i][j] = fa[i - 1][fa[i - 1][j]]; scanf( %d , &m); for (int i = 1, u, v; i <= m; ++i) { char s[200], t[300]; int tp = 0; scanf( %d%d%s , &u, &v, s); int lc = lca(u, v), len = strlen(s); int zu = jmp(u, max(0, dep[u] - dep[lc] - len)); int zv = jmp(v, max(0, dep[v] - dep[lc] - len)); Q[zv].push_back(Data{len, -i, geth(s)}); Q[v].push_back(Data{len, i, geth(s)}); reverse(s, s + len); Q[zu].push_back(Data{len, -i, geth(s)}); Q[u].push_back(Data{len, i, geth(s)}); reverse(s, s + len); while (zu != lc) t[tp++] = prec[zu], zu = fa[0][zu]; int xp = tp; while (zv != lc) t[tp++] = prec[zv], zv = fa[0][zv]; reverse(t + xp, t + tp); t[tp] = 0; anses[i] = kmp(t, s); } dfs2(1, 0); for (int i = 1; i <= m; ++i) printf( %d n , anses[i]); }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int l = s.length(); vector<vector<int>> dp(5000, vector<int>(5000, 0)); vector<int> kk(s.size() + 1, 0); for (int length = 1; length <= l; length++) { for (int right = 0; right < s.size(); right++) { int r = right + length - 1; if (r >= s.size()) break; if (s[right] != s[r]) continue; if (right == r) { dp[r][r] = 1; } else if (length == 2) { dp[right][r] = 2; } else if (dp[right + 1][r - 1] > 0) { int haf = length / 2; int ml = right + haf - 1; int mr = r - haf + 1; dp[right][r] = 1 + min(dp[right][ml], dp[mr][r]); } kk[dp[right][r]]++; } } for (int i = l; i >= 1; i--) { kk[i - 1] = kk[i] + kk[i - 1]; } for (int i = 1; i <= l; i++) { string pt = to_string(kk[i]) + ; cout << pt; } }
#include <bits/stdc++.h> using namespace std; const int Z = (int)3e3 + 111; const int N = (int)1e6 + 111; const int INF = (int)1e9 + 111; const int MOD = (int)1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string t, ans; cin >> t; int k; if (t.size() % 2) k = 1; else k = 0; int po1(0), po2(t.size() - 1); while (ans.size() != t.size()) { if (k) { ans = t[po1] + ans; po1++; } else { ans = t[po2] + ans; po2--; } k = !k; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const long long mod = (int)1e9 + 7; int dx[] = {0, 0, -1, 1, 1, 1, -1, -1}; int dy[] = {1, -1, 0, 0, 1, -1, -1, 1}; const int N = 1000001; void stop() {} void file() {} struct point { long long x, y; }; unsigned long long gcd(unsigned long long a, unsigned long long b) { return !b ? a : gcd(b, a % b); } long long fixMod(long long a, long long b) { return ((a % b) + b) % b; } double triangle_area(int x1, int y1, int x2, int y2, int x3, int y3) { return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.; }; long long dis(pair<long long, long long> a, pair<long long, long long> b) { long long x = a.first - b.first, y = a.second - b.second; return abs(x) + abs(y); } unsigned long long LCM(unsigned long long a, unsigned long long b) { return a / gcd(a, b) * b; } long long power(long long x, long long y) { if (y == 0) return 1; if (y == 1) return x; long long r = power(x, y / 2); return r * r * power(x, y % 2); } bool isPrime(long long x) { if (x <= 1 || (x % 2 == 0 && x != 2)) return 0; for (long long i = 3; i * i <= x; i += 2) { if (x % i == 0) return 0; } return 1; } vector<vector<int>> v; int n; vector<int> dep; int dfs(int node, int pr = -1) { int ret = 1; for (auto ch : v[node]) { if (ch != pr) { ret += dfs(ch, node); } } dep[node] = ret; return ret; } int aa = -1, bb = -1; int x = -1; void sol(int node, int pr = -1) { if (v[node].size() == 1 && aa == -1) { aa = node; bb = pr; } for (auto ch : v[node]) { if (ch != pr && ch != x) { sol(ch, node); } } } void solve() { cin >> n; v.clear(); v.resize(n); dep.clear(); map<pair<int, int>, bool> mp; int mx = 0; int st = 0; dep.resize(n); for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--; b--; mp[{a, b}] = true; v[a].push_back(b); v[b].push_back(a); } for (int i = 0; i < n; i++) { if (v[i].size() > mx) { mx = v[i].size(); st = i; } } int ans = dfs(st); if (count(((dep).begin()), ((dep).end()), ans / 2) == 0 || ans & 1) { for (auto i : mp) { cout << i.first.first + 1 << << i.first.second + 1 << n ; cout << i.first.first + 1 << << i.first.second + 1 << n ; break; } } else { aa = -1; bb = -1; x = -1; for (int i = 0; i < n; i++) { if (dep[i] * 2 == ans) { x = i; break; } } sol(st); if (mp[{aa, bb}] == true) { cout << aa + 1 << << bb + 1 << n ; } else { cout << bb + 1 << << aa + 1 << n ; } if (v[aa].size() == 1) { cout << x + 1 << << aa + 1 << n ; } else { cout << x + 1 << << bb + 1 << n ; } } mp.clear(); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, first, second, third, fourth; cin >> a >> b >> c; first = a + b + c; second = 2 * (a + b); third = 2 * (b + c); fourth = 2 * (a + c); cout << min(first, min(second, min(third, fourth))); }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; template <typename T> inline T Abs(T x) { return (x >= 0) ? x : -x; } template <typename T> inline T sqr(T x) { return x * x; } template <typename T> string toStr(T x) { stringstream st; st << x; string s; st >> s; return s; } inline int nextInt() { int x; if (scanf( %d , &x) != 1) throw; return x; } inline long long nextInt64() { long long x; if (scanf( %I64d , &x) != 1) throw; return x; } inline double nextDouble() { double x; if (scanf( %lf , &x) != 1) throw; return x; } const int INF = (int)1E9; const long long INF64 = (long long)1E18; const long double EPS = 1E-9; const long double PI = 3.1415926535897932384626433832795; const int MAXN = 100100; unsigned long long d[MAXN], ans; vector<int> g[MAXN]; int n; unsigned long long DFS(int v, int prev) { if (prev != -1) g[v].erase(find((g[v]).begin(), (g[v]).end(), prev)); d[v] = 0; long long sum2 = 0; for (int i = 0; i < (int)(g[v].size()); i++) { unsigned long long cur = DFS(g[v][i], v); sum2 += 1LL * d[v] * cur; d[v] += cur; } d[v]++; ans -= sqr(sum2); ans -= 2LL * sum2 * ((n - d[v] + 1) * d[v] - 1); ans -= 2LL * (d[v] - 1) * ((n - d[v] + 1) * d[v] - 1) - sqr(d[v] - 1); return d[v]; } int main() { n = nextInt(); for (int i = 0; i < (int)(n - 1); i++) { int v = nextInt() - 1; int u = nextInt() - 1; g[v].push_back(u); g[u].push_back(v); } ans = sqr(1LL * n * (n - 1) / 2); DFS(0, -1); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, count = 0; string s; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == 8 ) count++; } if (n < 11) cout << 0 << endl; else { cout << min(count, n / 11) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int a[maxn], n, x, k, l; long long ans = 0; int main() { cin >> n >> x; for (int i = 1; i <= n; i++) { cin >> k >> l; ans += min(k, l); a[i] = min(max(l - k, 0), k); } sort(a + 1, a + 1 + n); for (int i = 1; i <= x; i++) ans += a[n - i + 1]; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 500005, M = 60; int q, fa[N], n = 1; double dp[N][M + 5]; int main() { ios::sync_with_stdio(false); cin >> q; int opt, pos; for (int i = 0; i <= M; i++) dp[1][i] = 1; for (int _ = 1; _ <= q; _++) { cin >> opt >> pos; if (opt == 1) { fa[++n] = pos; for (int i = 0; i <= M; i++) dp[n][i] = 1; double pre = 1; int pp = n; for (int i = 0, cur = pos; cur && i <= M; i++, cur = fa[cur]) { double tmp = dp[cur][i]; dp[cur][i] /= 0.5 * (pre + 1); if (i) dp[cur][i] *= 0.5 * (1 + dp[pp][i - 1]); else dp[cur][i] *= 0.5; pp = cur; pre = tmp; } } else { double ans = 0; for (int i = 1; i <= M; i++) ans += (dp[pos][i] - dp[pos][i - 1]) * i; printf( %.10lf n , ans); } } return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > all; int isable[100005], cnt[100005]; int main() { int i, n, k; scanf( %d , &n); scanf( %d , &k); long long b; scanf( %I64d , &b); for (i = 0; i < n; i++) { int x; scanf( %d , &x); cnt[i] = x; if (i != n - 1) all.push_back(make_pair(x, i)); } sort(all.begin(), all.end()); i = all.size() - 1; long long sm = 0; int choto; while (k) { sm += all[i].first; choto = all[i].first; isable[all[i].second] = 1; k--; i--; } for (i = 0; i < n - 1; i++) { long long temp = sm; if (!isable[i]) { temp -= choto; temp += cnt[i]; } if (temp > b) break; } printf( %d n , i + 1); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string a; string b; cin >> a >> b; long long int len1 = a.length(); long long int len2 = b.length(); if (a.compare(b) == 0) { cout << -1 n ; } else { if (len1 > len2) cout << len1 << n ; else cout << len2 << n ; } }
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; const double eps = 1e-6; int n, m; int sum, res; int f[21][1 << 21], col[MAX]; char s[MAX]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < m; j++) if (s[j] == 1 ) col[j] |= (s[j] == 1 ) << i; } for (int i = 0; i < m; i++) f[0][col[i]]++; for (int i = 1; i <= n; i++) { for (int j = 0; j < 1 << n; j++) { sum = i < 2 ? 0 : (i - 2 - n) * f[i - 2][j]; for (int k = 0; k < n; k++) sum += f[i - 1][j ^ (1 << k)]; f[i][j] = sum / i; } } res = n * m; for (int i = 0; i < 1 << n; i++) { sum = 0; for (int j = 0; j <= n; j++) sum += (j < n - j ? j : n - j) * f[j][i]; res = res < sum ? res : sum; } printf( %d , res); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = int; namespace SEG { static const ll STAR = 1, FINI = 2e5 + 110; struct NODE { ll l, r, min; NODE() : l(0), r(0), min(0) {} } node[1000000 * 10 + 110]; ll newnode(ll pre = 0) { static ll cnt = 0; node[++cnt] = node[pre]; return cnt; } ll& lson(ll now) { return node[now].l; } ll& rson(ll now) { return node[now].r; } ll ins(ll pre, ll val, ll pos, ll star = STAR, ll fini = FINI) { ll now = newnode(pre); if (star < fini) { if (val <= ((star + fini) / 2)) lson(now) = ins(lson(pre), val, pos, star, ((star + fini) / 2)); else rson(now) = ins(rson(pre), val, pos, ((star + fini) / 2) + 1, fini); node[now].min = min(node[lson(now)].min, node[rson(now)].min); } else { node[now].min = pos; } return now; } ll ask(ll now, ll limit, ll star = STAR, ll fini = FINI) { if (star == fini) return star; if (node[lson(now)].min < limit) return ask(lson(now), limit, star, ((star + fini) / 2)); else return ask(rson(now), limit, ((star + fini) / 2) + 1, fini); } void debug(ll now, ll star = STAR, ll fini = FINI) { if (star > fini or now == 0) return; if (star == fini) { if (star == STAR) cout << SEG::debug:: << endl; if (node[now].min != INT64_MAX) cout << star << << node[now].min << endl; if (star == FINI) cout << endl; return; } debug(lson(now), star, ((star + fini) / 2)); debug(rson(now), ((star + fini) / 2) + 1, fini); } } // namespace SEG vector<ll> pos[100000 + 110]; ll date[100000 + 110]; static ll T[100000 + 110]; bool check(ll val) { for (ll i = 1; i < pos[val].size(); i++) if (pos[val][i - 1] < pos[val][i] - 1) { if (SEG::ask(T[pos[val][i] - 1], pos[val][i - 1] + 1) == val) { return 1; } } return 0; } int main() { ll n; cin >> n; for (ll i = 1; i <= n + 10; i++) pos[i].push_back(0); for (ll i = 1; i <= n; i++) { cin >> date[i]; pos[date[i]].push_back(i); T[i] = SEG::ins(T[i - 1], date[i], i); } for (ll i = 1; i <= n + 10; i++) pos[i].push_back(n + 1); for (ll i = 1; i <= n + 10; i++) if (check(i) == 0) { cout << i << n ; return 0; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 250005; int qr[maxn], qp[maxn], wm[maxn], loc[maxn]; int pp[maxn], pr[maxn], pm[maxn]; long long pd[maxn]; stack<int> f[maxn]; bool used[maxn]; int n, nx, ny, totm; long long dist(int x, int y) { return (long long)x * x + (long long)y * y; }; bool cmp(int a, int b) { return pd[a] > pd[b]; }; int main() { int i, x, y, h, t; long long d; scanf( %d%d%d%d%d , &nx, &ny, qp + 1, qr + 1, &n); for (i = 1; i <= n; ++i) { scanf( %d%d%d%d%d , &x, &y, pm + i, pp + i, pr + i); pd[i] = dist(x - nx, y - ny); wm[i - 1] = pm[i]; loc[i] = i; } sort(wm, wm + n); totm = unique(wm, wm + n) - wm; for (i = 1; i <= n; ++i) pm[i] = lower_bound(wm, wm + totm, pm[i]) - wm + 1; sort(loc + 1, loc + n + 1, cmp); for (i = 1; i <= n; ++i) for (x = pm[loc[i]]; x <= totm; x += x & -x) f[x].push(loc[i]); for (h = 1, t = 1; h <= t; ++h) { x = upper_bound(wm, wm + totm, qp[h]) - wm; d = (long long)qr[h] * qr[h]; for (; x > 0; x -= x & -x) while (!f[x].empty() && pd[f[x].top()] <= d) { y = f[x].top(); f[x].pop(); if (!used[y]) { used[y] = true; ++t; qp[t] = pp[y]; qr[t] = pr[y]; } } } printf( %d n , t - 1); return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, d[2][100005], q1[100005], q2[100005], x, y, st, en; char s[2][100005]; int main() { cin >> n >> k; cin >> s[0]; cin >> s[1]; d[0][0] = 1; for (en = 1; st < en;) { x = q1[st]; y = q2[st++]; if (y >= n - k) { cout << YES ; return 0; } if (s[x][y - 1] == - && d[x][y - 1] == 0 && y > 0 && y > d[x][y]) { d[x][y - 1] = d[x][y] + 1; q1[en] = x; q2[en++] = y - 1; } if (s[x][y + 1] == - && d[x][y + 1] == 0) { d[x][y + 1] = d[x][y] + 1; q1[en] = x; q2[en++] = y + 1; } if (s[1 - x][y + k] == - && d[1 - x][y + k] == 0) { d[1 - x][y + k] = d[x][y] + 1; q1[en] = 1 - x; q2[en++] = y + k; } } cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a[20]; a[0] = 2; a[1] = 3; a[2] = 5; a[3] = 7; a[4] = 11; a[5] = 13; a[6] = 17; a[7] = 19; a[8] = 23; a[9] = 29; a[10] = 31; a[11] = 37; a[12] = 41; a[13] = 43; a[14] = 47; a[15] = 4; a[16] = 9; a[17] = 25; a[18] = 49; char s[10]; long int i, flag = 0; for (i = 0; i <= 18; i++) { printf( %ld n , a[i]); fflush(stdout); scanf( %s , s); if (s[0] == y ) { flag++; } if (flag == 2) { printf( composite n ); fflush(stdout); break; } } if (flag < 2) printf( prime n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 5 * 100000; vector<int> g[MAXN + 1], e[MAXN + 1]; int col[MAXN + 1], cur = 1, used[MAXN + 1]; void dfs(int v, int p) { int num = 1; vector<int> del; for (auto x : g[v]) { del.push_back(col[x]); used[col[x]] = 1; } for (auto x : g[v]) { if (col[x]) continue; while (used[num]) num++; used[num] = 1; del.push_back(num); col[x] = num; } for (auto x : del) used[x] = 0; for (auto x : e[v]) { if (x == p) continue; dfs(x, v); } } int main() { int n, m; scanf( %d%d , &n, &m); int pos = 0; for (int i = 1; i <= n; i++) { int sz; scanf( %d , &sz); for (int j = 0; j < sz; j++) { int x; scanf( %d , &x); g[i].push_back(x); } if (g[i].size() > g[pos].size()) pos = i; sort(g[i].begin(), g[i].end()); } for (int i = 0; i < n - 1; i++) { int a, b; scanf( %d%d , &a, &b); e[a].push_back(b); e[b].push_back(a); } for (auto x : g[pos]) col[x] = cur++, used[cur] = 1; dfs(pos, -1); cout << max(1, *max_element(col + 1, col + 1 + m)) << n ; for (int i = 1; i <= m; i++) { if (!col[i]) col[i] = 1; printf( %d , col[i]); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; struct Person { int a; int id; }; bool operator<(Person a, Person b) { return a.a < b.a; } class TSolver { public: int n; vector<Person> persons; explicit TSolver(std::istream& in) { in >> n; persons.resize(n); for (int i = 0; i < n; ++i) { in >> persons[i].a; persons[i].id = i; } } bool ok = true; vector<int> ans; void Solve() { sort((persons).begin(), (persons).end()); ans.resize(n); int color = 1; for (int i = 0; ok && i < n;) { int same = n - persons[i].a; ok = ok && i + same <= n; for (int j = 0; ok && j < same; ++j) { if (persons[i + j].a != persons[i].a) { ok = false; } ans[persons[i + j].id] = color; } i += same; ++color; } } void PrintAnswer(std::ostream& out) const { if (ok) { out << Possible n ; for (int i = 0; i < n; ++i) { out << ans[i] << n [i + 1 == n]; } } else { out << Impossible n ; } } }; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); { auto solver = std::make_shared<TSolver>(std::cin); solver->Solve(); solver->PrintAnswer(std::cout); } do { } while (false); return 0; }
#include <bits/stdc++.h> using namespace std; long long binpow(long long a, long long b) { long long exp = 10e9; long long res = 1; while (b > 0) { if (b & 1) res = ((res % exp) * (a % exp)) % exp; a = ((a % exp) * (a % exp)) % exp; b >>= 1; } return res; } bool isprime(int x) { for (int d = 2; d * d <= x; d++) { if (x % d == 0) return false; } return true; } unsigned int cntsb(unsigned int n) { unsigned int count = 0; while (n) { count += n & 1; n >>= 1; } return count; } void solve(int cas) {} int main() { ios::sync_with_stdio(false); cin.tie(0); int number = 0; long long n; cin >> n; int last = n % 10; if (last <= 5) n -= last; else n += (10 - last); cout << n; }
#include <bits/stdc++.h> using namespace std; #define vec vector #define PB push_back #define MP make_pair #define MT make_tuple #define F first #define S second using ll = long long int; // watch out for overflows in your code using pii = pair<int,int>; //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void debug() { cout << n ; }; template <typename T, typename... Targs> void debug(T t, Targs... args) { cout << t << ; debug(args...); } template <typename T1, typename T2> inline ostream& operator << (ostream& os, const pair<T1,T2>& p) { return os << ( << p.F << , << p.S << ) ; } template <typename T> inline ostream& operator << (ostream& os, const vec<T>& v) { for(auto& t : v) { os << t << ; } return os; } template <typename T> inline ostream& operator << (ostream& os, const vec<vec<T>>& m) { for(auto& v : m) { for(auto& t : v) { os << t << ; } os << n ; } return os; } template <typename T> inline ostream& operator << (ostream& os, const set<T>& v) { for(auto& t : v) { os << t << ; } return os; } template <typename K, typename V> inline ostream& operator << (ostream& os, const map<K,V>& m) { for(auto& p : m) { os << p.F << -> << p.S << n ; } return os; } const int INF = 2 * 1e9; int T, N, M; vec<int> A, B; int increment(int& i, const vec<int>& v) { int S = v.size(); if(i >= S) { return -INF; } int P = v[i++]; while(i < S && P < 0) { P += v[i]; i++; } while(i < S && P <= P + v[i]) { P = P + v[i]; ++i; } return P; } int compute() { int j = 0, i = 0; int pa, pb; int S = 0; int ans = 0; pa = increment(i, A); pb = increment(j, B); while(i <= N || j <= M) { //debug( pa , pa, pb , pb); if(pa < 0 && pb < 0) { break; } if(pa >= pb) { S += pa; pa = increment(i, A); } else { S += pb; pb = increment(j, B); } ans = max(ans, S); } return ans; } //////////////////////////////////////////////////////////////////////// int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> T; while(T--) { cin >> N; A.assign(N, 0); for(int i = 0; i < N; ++i) { cin >> A[i]; } cin >> M; B.assign(M, 0); for(int j = 0; j < M; ++j) { cin >> B[j]; } cout << compute() << n ; } }
#include <bits/stdc++.h> using namespace std; const int N = 100; const int M = 2e6 + 7; const int inf = 1e9; int n, m, mx, p[N], minn[N], D[M][2], sum = 0; int a[N][N]; bool check() { for (int t = 0, tE = (1 << mx) - 1; t <= tE; t++) { int ds = 0, bs = 0; for (int i = 1, iE = mx; i <= iE; i++) if (t & (1 << (i - 1))) ds += p[i]; if (!ds) continue; for (int i = 1, iE = mx; i <= iE; i++) if (t & (1 << (i - 1))) for (int j = 1, jE = mx; j <= jE; j++) if (t & (1 << (j - 1))) bs += a[i][j]; if (bs >= ds) return 0; } return 1; } int Cnt(int x) { return x == 0 ? 0 : Cnt(x / 10) + 1; } char sa[N], sb[N]; bool get() { for (int x = 1, xE = mx; x <= xE; x++) for (int i = 1, iE = mx; i <= iE; i++) if (a[x][i]) { a[x][i]--, p[x]--; if (check()) return printf( %d %d n , minn[x] + p[x], minn[i]), 1; a[x][i]++, p[x]++; a[x][i]--, p[i]--; if (check()) return printf( %d %d n , minn[x], minn[i] + p[i]), 1; a[x][i]++, p[i]++; } return 0; } int main() { scanf( %d , &n), mx = Cnt(n); for (int i = 1, iE = n; i <= iE; i++) p[Cnt(i)]++; minn[1] = 1; for (int i = 2, iE = mx; i <= iE; i++) minn[i] = minn[i - 1] * 10; for (int i = 1, iE = n - 1; i <= iE; i++) scanf( %s%s , sa, sb), D[i][0] = strlen(sa), D[i][1] = strlen(sb), a[D[i][0]][D[i][1]]++; if (!check()) return puts( -1 ), 0; while (get()) sum++; for (int x = 1, xE = mx; x <= xE; x++) for (int i = 1, iE = mx; i <= iE; i++) if (a[x][i]) printf( %d %d n , minn[x] + p[x] - 1, minn[i] + p[i] - 1), sum++; if (sum != n - 1) assert(0); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, n, m, A[11] = {0}, count = 0, B[2000], sum1, sum2, last, flag = 0; char ch; for (i = 1; i <= 10; i++) { scanf( %c , &ch); if (ch == 1 ) A[i] = 1; else A[i] = 0; } scanf( %d , &m); for (k = 1; k <= 10; k++) { if (A[k] == 1) { flag = 0; sum1 = k; sum2 = 0; last = k; B[0] = k; i = 1; while (i < m) { for (j = 1; j <= 10; j++) { if (A[j] == 1) { if (sum2 + j > sum1 && last != j) { sum2 += j; last = j; B[i++] = j; break; } } } if (j == 11) { flag = 1; break; } if (i == m) break; for (j = 1; j <= 10; j++) { if (A[j] == 1) { if (sum1 + j > sum2 && last != j) { sum1 += j; last = j; B[i++] = j; break; } } } if (j == 11) { flag = 1; break; } } } if (i == m) break; } if (k == 11) printf( NO n ); else if (i == m) { printf( YES n ); for (i = 0; i < m; i++) { if (i != m - 1) printf( %d , B[i]); else printf( %d n , B[i]); } } return 0; }
#include<bits/stdc++.h> using namespace std; typedef long long ll; void solve() { int x,y; cin>>x>>y; string s; cin>>s; int cR=0,cU=0,cL=0,cD=0; for(int i=0;i<s.size();i++) { if(s[i]== R ) cR++; else if(s[i]== U ) cU++; else if(s[i]== L ) cL++; else cD++; } //cout<<cR<< <<cL<< <<cU<< <<cD<< n ; if(x>0&&y>0) { if(cR>=x&&cU>=y) cout<< YES n ; else cout<< NO n ; } else if(x>0&&y<0) { if(cR>=x&&cD>=abs(y)) cout<< YES n ; else cout<< NO n ; } else if(x<0&&y>0) { if(cL>=abs(x)&&cU>=y) cout<< YES n ; else cout<< NO n ; } else if(x<0&&y<0) { if(cL>=abs(x)&&cD>=abs(y)) cout<< YES n ; else cout<< NO n ; } else { if(x>0&&y==0) { if(cR>=x) cout<< YES n ; else cout<< NO n ; } else if(x<0&&y==0) { if(cL>=abs(x)) cout<< YES n ; else cout<< NO n ; } else if(x==0&&y>0) { if(cU>=y) cout<< YES n ; else cout<< NO n ; } else if(x==0&&y<0) { if(cD>=abs(y)) cout<< YES n ; else cout<< NO n ; } else cout<< NO n ; } } int main() { int t; ios::sync_with_stdio(false); cin>>t; cin.tie(0); cout.tie(0); while(t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, ans = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ans = ans * 10 + c - 0 ; c = getchar(); } return f * ans; } const int MAXN = 4e5 + 11; vector<int> vec[MAXN]; int ch[MAXN][27], las = 1, tot = 1, TT = 0, N, Q, len[MAXN], fa[MAXN], rt[MAXN], all; char S[MAXN]; struct Segment { int ls[MAXN * 34], rs[MAXN * 34]; void Modify(int &k, int l, int r, int ps) { if (!k) k = ++TT; if (l == r) return; int mid = (l + r) >> 1; if (ps <= mid) Modify(ls[k], l, mid, ps); if (mid < ps) Modify(rs[k], mid + 1, r, ps); return; } void print(int k, int l, int r) { if (!k) return; if (l == r) { printf( %d , l); return; } int mid = (l + r) >> 1; print(ls[k], l, mid), print(rs[k], mid + 1, r); } int merge(int p, int q) { if (!p || !q) return p + q; int u = (++TT); ls[u] = merge(ls[p], ls[q]), rs[u] = merge(rs[p], rs[q]); return u; } bool Query(int k, int l, int r, int x, int y) { if (!k) return 0; if (x <= l && r <= y) return 1; int mid = (l + r) >> 1; bool res = 0; if (x <= mid) res |= Query(ls[k], l, mid, x, y); if (mid < y) res |= Query(rs[k], mid + 1, r, x, y); return res; } void debug(int k) { print(rt[k], 1, N); printf( n ); return; } } T; void ins(int c) { int p = las, np = las = ++tot; len[np] = len[p] + 1; T.Modify(rt[np], 1, N, len[np]); for (; p && !ch[p][c]; p = fa[p]) ch[p][c] = np; if (!p) { fa[np] = 1; return; } int q = ch[p][c]; if (len[p] + 1 == len[q]) { fa[np] = q; return; } int nq = ++tot; len[nq] = len[p] + 1, fa[nq] = fa[q]; for (int i = 0; i < 27; i++) ch[nq][i] = ch[q][i]; fa[q] = fa[np] = nq; for (; p && ch[p][c] == q; p = fa[p]) ch[p][c] = nq; return; } void dfs(int u) { for (auto v : vec[u]) dfs(v), rt[u] = T.merge(rt[u], rt[v]); } int L, R, LEN; char Ans[MAXN]; bool ff = 1; void calc(int now, int len, bool f) { if (!f) { for (int i = 1; i < len; i++) printf( %c , Ans[i]); printf( n ); ff = 0; return; } int be; if (!f || len > LEN) be = 0; else be = S[len] - a ; for (int i = be; i < 26; i++) { int u = ch[now][i]; if (!u) continue; if (!T.Query(rt[u], 1, N, L + len - 1, R)) continue; Ans[len] = i + a ; calc(u, len + 1, f & (i == (S[len] - a ))); if (!ff) return; } } int main() { scanf( %s , S + 1); N = strlen(S + 1); Q = read(); for (int i = 1; i <= N; i++) ins(S[i] - a ); for (int i = 2; i <= tot; i++) vec[fa[i]].push_back(i); dfs(1); while (Q--) { L = read(), R = read(); scanf( %s , S + 1); LEN = strlen(S + 1); ff = 1; calc(1, 1, 1); if (ff) printf( -1 n ); } }
#include <bits/stdc++.h> using namespace std; void solve() { long long n, k; cin >> n >> k; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; ; sort(a.begin(), a.end()); long long mm = a[n / 2]; for (int i = n / 2; i < n - 1; i++) { long long r = a[i + 1] - a[i]; if (k >= r * (i - n / 2 + 1)) k -= r * (i - n / 2 + 1); else if (k > 0) { mm += k / (i - n / 2 + 1); k = 0; break; } else break; mm = a[i + 1]; } if (k > 0) mm += k / (n / 2 + 1); cout << mm << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 200005; int n, m, tot, ans; struct Node { int u, v, w; } node[M]; int vis[M], match[M]; int sum1[M], sum2[M]; int head[M], Nxt[M], ver[M]; bool v[M], flag = 0; vector<int> e[M]; inline bool dfs(long long x) { for (int i = 0; i < e[x].size(); i++) { long long y = e[x][i]; if (!vis[y]) { vis[y] = 1; if (!match[y] || dfs(match[y])) { match[y] = x; return 1; } } } return 0; } bool cmp(Node a, Node b) { return a.w > b.w; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d%d , &node[i].u, &node[i].v, &node[i].w); sum1[node[i].u]++; sum2[node[i].v]++; e[node[i].u].push_back(node[i].v); } for (int i = 1; i <= n; i++) { memset(vis, 0, sizeof(vis)); if (dfs(i)) ans++; } if (ans != n) { printf( -1 n ); return 0; } sort(node + 1, node + 1 + m, cmp); for (int i = 1; i <= m; i++) { sum1[node[i].u]--; sum2[node[i].v]--; if (sum1[node[i].u] == 0 || sum2[node[i].v] == 0) { printf( %d n , node[i].w); return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int z = 0; z < t; z++) { int n; cin >> n; string s; cin >> s; bool found = false; for (int i = 0; i <= n - 11; i++) { if (s[i] == 8 ) { cout << YES << endl; found = true; break; } } if (found) { continue; } cout << NO << endl; } }
#include <bits/stdc++.h> using namespace std; template <class T> void show(const vector<T> &a) { for (T x : a) cout << x << ; cout << n ; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); vector<long long> xx = {1, 0, -1, 0}; vector<long long> yy = {0, 1, 0, -1}; string dir = LRUD ; const long long N = 3e5 + 50, oo = 2e18 + 500; const long long mod = 998244353; const long long M2 = 1000000093, x2 = 27162; const long long M1 = 1000000087, x1 = 241; const double eps = 1e-12, PI = 2 * acos(0.0); long long n, m, k; long long cnt = 0; long long lg = 18; vector<vector<long long>> g; vector<vector<long long>> rg; signed main() { ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); string s; cin >> s; n = ((long long)(s.size())); vector<vector<string>> vc(26); for (long long i = 0; i < n; i++) { string t = s.substr(i, n - i) + s.substr(0, i); vc[s[i] - a ].push_back(t); } double ans = 0; for (long long i = 0; i < 26; i++) { if (!((long long)(vc[i].size()))) continue; long long val = 0; for (long long j = 0; j < n; j++) { vector<long long> count_letters(26); for (long long z = 0; z < ((long long)(vc[i].size())); z++) { count_letters[vc[i][z][j] - a ]++; } bool fl = 1; long long cur = 0; for (long long z = 0; z < 26; z++) { if (count_letters[z] == 1) { cur++; } else { if (count_letters[z]) fl = 0; } } if (fl) { val = ((long long)(vc[i].size())); break; } val = max(val, cur); ; } cnt += val; } ans = (double)cnt / (double)n; cout << fixed << setprecision(10) << ans; }
#include<bits/stdc++.h> using namespace std ; # define all(v) (v).begin() , (v).end() # define allrev(v) (v).rbegin() , (v).rend() # define allcomp(v) (v).begin() , (v).end() , comp # define ll long long # define line cout << n ; # define fast ios_base :: sync_with_stdio ( false ) ; cin.tie ( 0 ) ; # define pii pair < int , int > # define pll pair < ll , ll > # define F first # define S second const int mod = 998244353 ; const int dx[] = { -1 , 0 , 1 , 0 , -1 , -1 , 1 , 1 } ; const int dy[] = { 0 , 1 , 0 , -1 , -1 , 1 , -1 , 1 } ; ll mod_pow ( ll a , ll b ) { if ( b == 0 ) return 1 ; if ( b == 1 ) return a%mod ; if ( b == 2 ) { return ((a%mod) * (a%mod))%mod ; } return (mod_pow ( mod_pow ( a , b>>1 ) , 2 ) * mod_pow ( a , b&1 ))%mod ; } void solve ( int test_case ) { int n ; cin >> n ; int bak = n ; int nr = 0 ; if ( n <= 2 ) nr = 1 ; else { n -= 2 ; ll a = 1 , b = 1 ; while ( n -- ) { b += a ; a = b - a ; a %= mod ; b %= mod ; } nr = b ; } ll f = 1 ; for ( int i = 1 ; i <= bak ; i ++ ) f <<= 1 , f %= mod ; // cout << nr : << nr << and dr : << f ; line ; f = mod_pow ( f , mod - 2 ) ; ll ans = nr * f ; ans %= mod ; cout << ans ; line ; } int main() {fast int t = 1 ; // cin >> t ; for ( int i = 1 ; i <= t ; i ++ ) { solve ( i ) ; } return 0 ; }
#include <bits/stdc++.h> using namespace std; map<long long, long long> mp; void Hash(string str, long long B, long long mod) { long long power = 1, h = 0; long long m = (int)str.length(); for (long long i = m - 1; i >= 0; i--) { h = h + (power * (str[i] - a + 1)) % mod; h = h % mod; power = (power * B) % mod; } mp[h]++; } bool match(string str, long long B, long long mod) { long long power = 1, h = 0; long long m = (int)str.length(); for (long long i = m - 1; i >= 0; i--) { h = h + (power * (str[i] - a + 1)) % mod; h = h % mod; power = (power * B) % mod; } power = 1; for (long long i = m - 1; i >= 0; i--) { long long t1, t2; if (str[i] == a ) { t1 = h + power; t1 = t1 % mod; t2 = t1 + power; t2 = t2 % mod; } else if (str[i] == b ) { t1 = h - power; t1 = (t1 + mod) % mod; t2 = h + power; t2 = (t2 + mod) % mod; } else { t1 = h - power; t1 = (t1 + mod) % mod; t2 = t1 - power; t2 = (t2 + mod) % mod; } power = (power * B) % mod; if (mp[t1] != 0) return true; if (mp[t2] != 0) return true; } return false; } int main() { long long B[10], mod[10]; B[0] = 137, B[1] = 347; mod[0] = 100404001, mod[1] = 1000000007; int n, m; scanf( %d %d , &n, &m); string str[n], query[m]; for (int i = 0; i < n; i++) cin >> str[i]; for (int i = 0; i < m; i++) cin >> query[i]; bool ans[m]; memset(ans, true, sizeof ans); for (int i = 0; i < 2; i++) { mp.clear(); for (int j = 0; j < n; j++) { Hash(str[j], B[i], mod[i]); } for (int j = 0; j < m; j++) { if (match(query[j], B[i], mod[i]) == false) ans[j] = false; } } for (int j = 0; j < m; j++) { if (ans[j]) printf( YES n ); else printf( NO n ); } }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int l = n - k; int max_1 = 0; for (int i = 0; i < (n - k); i++) { max_1 = max(max_1, a[i] + a[2 * (n - k) - i - 1]); } max_1 = max(max_1, a[n - 1]); cout << max_1 << endl; }
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a < b) return b; return a; } long long min(long long a, long long b) { if (a < b) return a; return b; } long long X; vector<long long> x; long long dfs(long long node, long long par, vector<vector<long long> > &v) { long long cnt = 0; for (int i = 0; i < v[node].size(); i++) { long long adj = v[node][i]; if (adj == par) continue; long long y = dfs(adj, node, v); if (node == X) x.push_back(y); cnt += y; } return cnt + 1; } void solve() { x.clear(); long long n; cin >> n >> X; vector<vector<long long> > v(n + 1); long long degree[n + 1]; memset(degree, 0, sizeof(degree)); vector<vector<long long> > comp; for (int i = 0; i < n - 1; i++) { long long a, b; cin >> a >> b; degree[a]++, degree[b]++; v[a].push_back(b); v[b].push_back(a); } if (degree[X] == 1 || n == 1) cout << Ayush n ; else { dfs(X, -1, v); long long cnt = 0; for (int i = 0; i < x.size(); i++) cnt += max(0, x[i] - 1); cnt += max(0, v[X].size() - 1); if (cnt % 2 == 0) { cout << Ayush n ; } else cout << Ashish n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long test = 0; cin >> test; while (test--) solve(); return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using std::bitset; using namespace std; int g[302][302][302], f[302][302]; int s[10]; int n, ans; void updateg(int a, int b, int c) { int i, j, tem, t; for (i = c + 1; i < 300; i++) { g[a][b][i] = 1; g[a][c][i] = 1; g[b][c][i] = 1; } for (i = b + 1; i <= c; i++) { g[a][i][c] = 1; g[b][i][c] = 1; } for (i = a + 1; i <= b; i++) g[i][b][c] = 1; for (t = 1; c + t < 300; t++) g[a + t][b + t][c + t] = 1; } void updatef(int a, int b) { int i, j, tem, t; for (i = b + 1; i < 300; i++) { f[a][i] = 1; f[b][i] = 1; } for (i = a + 1; i <= b; i++) f[i][b] = 1; for (t = 1; b + t < 300; t++) f[a + t][b + t] = 1; } void init() { int i, j, tem; memset(g, -1, sizeof(g)); ; int a, b, c; for (a = 0; a < 300; a++) for (b = a; b < 300; b++) for (c = b; c < 300; c++) { if (g[a][b][c] == -1) { g[a][b][c] = 0; updateg(a, b, c); } } memset(f, -1, sizeof(f)); ; for (a = 0; a < 300; a++) for (b = a; b < 300; b++) { if (f[a][b] == -1) { f[a][b] = 0; updatef(a, b); } } } int main() { int i, j, tem; init(); while (scanf( %d , &n) != EOF) { memset(s, 0, sizeof(s)); ; for (i = 1; i <= n; i++) scanf( %d , &s[i]); if (n == 1) { if (s[1] != 0) printf( BitLGM n ); else printf( BitAryo n ); } else if (n == 2) { if (s[1] > s[2]) swap(s[1], s[2]); if (f[s[1]][s[2]] == 1) printf( BitLGM n ); else printf( BitAryo n ); } else { sort(s + 1, s + 1 + 3); if (g[s[1]][s[2]][s[3]] == 1) printf( BitLGM n ); else printf( BitAryo n ); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, a, b, p, q, z, k; cin >> t; while (t--) { z = 0; k = 0; cin >> a >> b >> n; p = max(a, b); q = min(a, b); while (k <= n) { z++; k = q + p; q = p; p = k; } cout << z << endl; } }
#include <bits/stdc++.h> using namespace std; int t, a[30], n, b[2010], r; vector<int> aux[30]; int val(int x, int y) { int hr = 0, hxt = 0; for (int i = 1; i <= aux[x].size() / 2; i++) { hxt = lower_bound(aux[y].begin(), aux[y].end(), aux[x][aux[x].size() - i]) - upper_bound(aux[y].begin(), aux[y].end(), aux[x][i - 1]); if (hxt > 0) hr = max(hr, 2 * i + hxt); } return hr; } int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); for (int i = 1; i <= 26; i++) aux[i].clear(); r = 0; for (int i = 0; i < n; i++) { scanf( %d , &b[i]); aux[b[i]].push_back(i); int h = aux[b[i]].size(); r = max(r, h); } for (int i = 1; i < 26; i++) for (int j = i + 1; j <= 26; j++) r = max(r, max(val(i, j), val(j, i))); printf( %d n , r); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long b, r, g, w, i, j = 0, p = 0, n, m, s1, s2; cin >> n >> m >> s1 >> s2; if (s2 == 2) { cout << s1 << << s2 << endl; cout << 1 << << s2 << endl; for (i = 1; i <= n; i++) { if (i % 2 == 1) { for (j = 1; j <= m; j++) { if ((i == 1 && j == 2) || (i == s1 && j == 2)) { continue; } else cout << i << << j << endl; } } else { for (j = m; j >= 1; j--) { if ((i == 1 && j == 2) || (i == s1 && j == 2)) { continue; } else cout << i << << j << endl; } } } } else { cout << s1 << << s2 << endl; cout << s1 << << 2 << endl; cout << 1 << << 2 << endl; for (i = 1; i <= n; i++) { if (i % 2 == 1) { for (j = 1; j <= m; j++) { if ((i == 1 && j == 2) || (i == s1 && j == s2) || (i == s1 && j == 2)) { continue; } else cout << i << << j << endl; } } else { for (j = m; j >= 1; j--) { if ((i == 1 && j == 2) || (i == s1 && j == s2) || (i == s1 && j == 2)) { continue; } else cout << i << << j << endl; } } } } return 0; }
#pragma GCC optimize(3, Ofast , inline ) #include <bits/stdc++.h> #define rep(i,a,b) for(int i=(a);i<=(b);i++) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> P; typedef pair<double, double> Pd; typedef pair<ll, ll> pll; const int maxn = 1e6+10; int n,m; int a[111][111]; struct node { int x,y; int v; }e[10005]; int tot = 0; bool cmp(node A,node B) { return A.v<B.v; } int main() { #ifndef ONLINE_JUDGE freopen( /volumes/D/acm/1.txt , r , stdin); #endif int T; scanf( %d ,&T); while(T--) { tot = 0; scanf( %d%d ,&n,&m); rep(i,1,n) { rep(j,1,m) { scanf( %d ,&a[i][j]); e[++tot]={i,j,a[i][j]}; } } sort(e+1,e+1+tot,cmp); for(int i=1;i<=m;i++) { int x = e[i].x; int y = e[i].y; int z = e[i].v; for(int j=i+1;j<=m;j++) { if(e[j].v==a[x][i]&&e[j].x==x&&e[j].y==i) { e[j].y=y; break; } } swap(a[x][i],a[x][y]); } rep(i,1,n) { rep(j,1,m) { printf( %d ,a[i][j]); if(j!=m) printf( ); else printf( n ); } } } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 200100; mt19937 rnd; struct Treap { int id, y, best; Treap *l, *r; Treap(int id) : id(id), y(rnd()), best(id), l(NULL), r(NULL) {} }; int n, m; int x[MAXN]; long long len[MAXN]; int p[MAXN], b[MAXN]; set<pair<int, int> > alive; int c[MAXN]; void update(Treap *&t) { if (t) { t->best = t->id; if (t->l && x[t->l->best] < x[t->best]) t->best = t->l->best; if (t->r && x[t->r->best] < x[t->best]) t->best = t->r->best; } } void merge(Treap *&t, Treap *l, Treap *r) { if (!l) t = r; else if (!r) t = l; else if (l->y < r->y) { merge(l->r, l->r, r); t = l; } else { merge(r->l, l, r->l); t = r; } update(t); } void split(Treap *t, Treap *&l, Treap *&r, long long k, int id) { if (!t) { l = r = NULL; } else if (x[t->id] + len[t->id] < k || (x[t->id] + len[t->id] == k && t->id < id)) { split(t->r, t->r, r, k, id); l = t; } else { split(t->l, l, t->l, k, id); r = t; update(t); } } Treap *t; void insert(int id) { Treap *L, *R; split(t, L, R, x[id] + len[id], id); merge(t, L, new Treap(id)); merge(t, t, R); } void erase(Treap *&t, int id) { if (t->id == id) { merge(t, t->l, t->r); } else if (x[t->id] + len[t->id] < x[id] + len[id] || (x[t->id] + len[t->id] == x[id] + len[id] && t->id < id)) { erase(t->r, id); } else { erase(t->l, id); } update(t); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); rnd = mt19937(0xdeadbeef); cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> x[i] >> len[i]; insert(i); } for (int i = 0; i < m; ++i) { cin >> p[i] >> b[i]; Treap *L, *R; split(t, L, R, p[i], 0); int best = R ? R->best : -1; merge(t, L, R); if (best != -1 && x[best] <= p[i]) { erase(t, best); len[best] += b[i]; insert(best); ++c[best]; while (true) { auto it = alive.upper_bound(make_pair(x[best] - 1, 1e9)); if (it != alive.end() && it->first <= x[best] + len[best]) { ++c[best]; erase(t, best); len[best] += b[it->second]; insert(best); alive.erase(it); } else break; } } else { alive.insert(make_pair(p[i], i)); } } for (int i = 0; i < n; ++i) cout << c[i] << << len[i] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s, s1, s2; cin >> s >> s1 >> s2; bool lock = false; for (int i = 0; i < s.length(); i++) { if (s[i] == s2[i]) { swap(s1[i], s2[i]); } else { if (s1[i] == s2[i]) { swap(s[i], s2[i]); } else { lock = true; break; } } } if (lock) cout << NO << endl; else { if (s == s1) cout << YES << endl; else cout << NO << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long int sz = 2e5; long long int col[sz], vis[sz]; vector<long long int> adj[sz]; long long int n; void reset() { long long int i; for (i = 0; i < n + 14; i++) { col[i] = -1; adj[i].clear(); vis[i] = 0; } } void coloring(long long int n, long long int c) { vis[n] = 1; col[n] = c; for (auto it : adj[n]) { if (vis[it] == 0) coloring(it, c ^ 1); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int i, j, k, len, x, y, z, c, f, flag, p, q, mx, mn, l, r, sum, ans, tmp, it, pos, avg, m, cnt; long long int t; cin >> t; while (t--) { f = 0; flag = 0; ans = 0; cnt = 0; sum = 0; mn = LLONG_MAX; mx = LLONG_MIN; string s; cin >> n >> m; reset(); for (i = 0; i < m; i++) { cin >> l >> r; adj[l].push_back(r); adj[r].push_back(l); } coloring(1, 0); vector<long long int> sol1, sol2; for (i = 1; i <= n; i++) { if (col[i]) sol1.push_back(i); else sol2.push_back(i); } if (sol2.size() < sol1.size()) { cout << sol2.size() << n ; for (auto dsp : sol2) cout << dsp << ; cout << n ; ; } else { cout << sol1.size() << n ; for (auto dsp : sol1) cout << dsp << ; cout << n ; ; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int lbracket = s.length(), rbracket = -1, lcolon = s.length(), rcolon = -1; for (int i = 0; i < s.length(); i++) if (s[i] == [ ) { lbracket = i; break; } for (int i = lbracket; i < s.length(); i++) if (s[i] == : ) { lcolon = i; break; } for (int i = s.length() - 1; i > -1; i--) if (s[i] == ] ) { rbracket = i; break; } for (int i = rbracket; i > -1; i--) if (s[i] == : ) { rcolon = i; break; } if (lcolon < rcolon) { int ans = 4; for (int i = lcolon + 1; i < rcolon; i++) if (s[i] == | ) ans++; cout << ans; } else cout << -1; return 0; }
#include <bits/stdc++.h> using namespace std; const int NMAX = 1001000; long long a[NMAX * 2]; long long n, l, t; long long cnt(int i, int j) { long long v = (a[i] - a[j] + t * 2 + l) / l; return v; } long double ans(int i) { int lo = i + 2, hi = i + n; long long tv = cnt(i, i + 1); while (lo < hi) { int m = (lo + hi) / 2; if (cnt(i, m) < tv) { hi = m; } else { lo = m + 1; } } if (hi == i + n) { long double v = (long double)tv * (n - 1) / 4; return v; } long double v = (long double)((tv - 1) * (i + n - hi) + tv * (hi - i - 1)) / 4; return v; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> n >> l >> t; for (int i = 0; i < n; ++i) { cin >> a[i]; a[i + n] = a[i] + l; } long double out = 0; for (int i = 0; i < n; ++i) { out += ans(i); } cout << fixed << setprecision(5) << out << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long Mod = 1e9 + 7; const long long maxn = 700 + 10; long long n; long long brac[maxn]; char s[maxn]; stack<long long> sta; inline long long read() { long long x = 0; bool fopt = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) fopt = 0; for (; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + ch - 48; return fopt ? x : -x; } long long f[maxn][maxn][3][3]; void dfs(long long l, long long r) { if (r == l + 1) return f[l][r][0][1] = f[l][r][1][0] = f[l][r][0][2] = f[l][r][2][0] = 1, void(); if (brac[l] == r) { dfs(l + 1, r - 1); for (long long i = 0; i <= 2; i++) for (long long j = 0; j <= 2; j++) { if (i != 1) f[l][r][1][0] = (f[l][r][1][0] + f[l + 1][r - 1][i][j]) % Mod; if (i != 2) f[l][r][2][0] = (f[l][r][2][0] + f[l + 1][r - 1][i][j]) % Mod; if (j != 1) f[l][r][0][1] = (f[l][r][0][1] + f[l + 1][r - 1][i][j]) % Mod; if (j != 2) f[l][r][0][2] = (f[l][r][0][2] + f[l + 1][r - 1][i][j]) % Mod; } } else { dfs(l, brac[l]); dfs(brac[l] + 1, r); for (long long i = 0; i <= 2; i++) for (long long j = 0; j <= 2; j++) for (long long k = 0; k <= 2; k++) for (long long q = 0; q <= 2; q++) if (!(j && j == k)) f[l][r][i][q] = (f[l][r][i][q] + f[l][brac[l]][i][j] * f[brac[l] + 1][r][k][q] % Mod) % Mod; } } signed main() { scanf( %s , s + 1); n = strlen(s + 1); for (long long i = 1; i <= n; i++) { if (s[i] == ( ) sta.push(i); else brac[sta.top()] = i, sta.pop(); } dfs(1, n); long long ans = 0; for (long long i = 0; i <= 2; i++) for (long long j = 0; j <= 2; j++) ans = (ans + f[1][n][i][j]) % Mod; cout << ans << endl; return 0; }
#include<bits/stdc++.h> #pragma GCC optimize ( -O3 ) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long #define double long double #define pb push_back #define mod 1000000007 #define int long long #define endl n #define ss second #define ff first #define INF 1000000000 #define all(a) a.begin(),a.end() #define gcd(a, b) __gcd((a), (b)) //ceil(a/b) is equal to (a+b-1)/b using namespace std; int power(int a,int n,int p) { int res=1; while(n) { if(n%2) { res=(res*a)%p; n--;} else { a=(a*a)%p; n=n/2;} } return res; } int binarySearch(int arr[],int l,int r,int x) { int mid; while(l<=r) { mid=(l+r)/2; if(arr[mid]==x) return mid; if(arr[mid]<x) l=mid+1; else r=mid-1; } return -1; } int fact(int n,int k) //for calculating nCk { int ans=1; if(k>n-k) { k=n-k; } for(int i=1;i<=k;i++) { ans*=(n-i+1); ans/=i; } return ans; } // cout << std::fixed; // std::cout << std::setprecision(9); // auto it = lower_bound(v.begin(), v.end(), n); int32_t main() { IOS; int t; cin>>t; while(t--) { int n; cin>>n; int a[n+1]; std::map<int, int> m; for(int i=0;i<n;i++){ cin>>a[i]; m[a[i]]++; } set<int>s; std::map<int, int> m1; for(auto x:m) { s.insert(x.ss); m1[x.ss]++; } int ans=INF; for(int x:s) { int cnt=0; for(auto y:m1) { if(y.ff<x){ cnt+=y.ss*y.ff; } else { cnt+=abs(y.ff-x)*y.ss; } } ans=min(ans,cnt); } cout<<ans<<endl; } }
#include <bits/stdc++.h> using namespace std; const int N = 15e4 + 10; long long a[N]; bool vis[N]; int main() { int n; scanf( %d , &n); set<pair<long long, int> > se; for (int i = 0; i < n; i++) { scanf( %lld , a + i); se.insert(pair<long long, int>(a[i], i)); } int sz = n; while (!se.empty()) { pair<long long, int> x = *se.begin(); if (!se.empty()) { se.erase(se.begin()); pair<long long, int> y = *se.begin(); if (x.first == y.first) { se.erase(se.begin()); se.insert(pair<long long, int>(y.first * 2, y.second)); vis[x.second] = true; sz--; a[y.second] = y.first * 2; } } else break; } printf( %d n , sz); for (int i = 0; i < n; i++) { if (vis[i]) continue; printf( %lld , a[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; const int Maxn = 2005; int n; int p[Maxn], b[Maxn]; int inb[Maxn]; int res; int best[Maxn]; vector<pair<int, int> > seq; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); for (int i = 1; i <= n; i++) { scanf( %d , &b[i]); inb[b[i]] = i; } for (int i = 1; i <= n; i++) p[i] = inb[p[i]]; for (int i = 1; i <= n; i++) { int pos = i; while (p[pos] != i) pos++; res += pos - i; best[i] = p[i]; for (int j = i + 1; j < pos; j++) best[j] = max(best[j - 1], p[j]); for (int j = pos - 1; j >= i; j--) if (best[j] == p[j]) { seq.push_back(pair<int, int>(j, pos)); swap(p[j], p[pos]); pos = j; } } printf( %d n , res); printf( %d n , seq.size()); for (int i = 0; i < seq.size(); i++) printf( %d %d n , seq[i].first, seq[i].second); return 0; }
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > p; set<pair<int, int> > h; set<pair<int, int> > v; int cut(); int cut(set<pair<int, int> >::iterator s, set<pair<int, int> >::iterator e) { int c = 0; vector<int> all; while (s != e) { all.push_back(s->second); ++s; } for (int &x : all) { h.erase(pair<int, int>(p[x].first, x)); v.erase(pair<int, int>(p[x].second, x)); } c += cut(); h.clear(); v.clear(); for (int &x : all) { h.insert(pair<int, int>(p[x].first, x)); v.insert(pair<int, int>(p[x].second, x)); } c += cut(); return c; } int cut() { set<pair<int, int> >::iterator xs = h.begin(); set<pair<int, int> >::iterator ys = v.begin(); set<pair<int, int> >::iterator xe = h.end(); set<pair<int, int> >::iterator ye = v.end(); --xe; --ye; for (int i = 0; i < (int)h.size() / 2; ++i) { set<pair<int, int> >::iterator nxs = xs; ++nxs; if (xs->first + 1 < nxs->first) { return cut(h.begin(), nxs); } ++xs; set<pair<int, int> >::iterator nxe = xe; --xe; if (xe->first + 1 < nxe->first) { return cut(nxe, h.end()); } set<pair<int, int> >::iterator nys = ys; ++nys; if (ys->first + 1 < nys->first) { return cut(v.begin(), nys); } ++ys; set<pair<int, int> >::iterator nye = ye; --ye; if (ye->first + 1 < nye->first) { return cut(nye, v.end()); } } return 1; } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; i < n; ++i) { int x, y; cin >> x >> y; p.push_back(pair<int, int>(x, y)); h.insert(pair<int, int>(x, i)); v.insert(pair<int, int>(y, i)); } cout << cut() << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, ans, x, mn = 100001; vector<int> A, B; map<int, int> Ps1, Ps2, Mn; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x; Ps1[x] = i; } for (int i = 0; i < n; i++) { cin >> x; Ps2[i] = Ps1[x]; } for (int i = n - 1; i >= 0; i--) { mn = min(mn, Ps2[i]); Mn[i] = mn; } for (int i = 0; i < n; i++) { if (Ps2[i] > Mn[i]) ans++; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int num[5005]; int rmq(int l, int r) { int ans = 1 << 30, tmp = l; for (int i = l; i <= r; i++) { if (ans > num[i]) { ans = num[i]; tmp = i; } } return tmp; } int get(int l, int r, int h) { if (l > r) return 0; if (l == r) { if (num[l] == h) return 0; else return 1; } int tmp = rmq(l, r); int ans = 0; ans = min(r - l + 1, get(l, tmp - 1, num[tmp]) + get(tmp + 1, r, num[tmp]) + num[tmp] - h); return ans; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &num[i]); int ans = get(0, n - 1, 0); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; int g2[1002][1002]; int main() { int n, m; cin >> n >> m; for (int i = n; i <= m; i++) { int ind = 0; string s = to_string(i); string m = s; sort(s.begin(), s.end()); for (int p = 1; p < s.size(); p++) if (s[p] == s[p - 1]) { ind = 1; break; } if (ind == 1) continue; cout << m; return 0; } cout << -1; return 0; }
#include <bits/stdc++.h> using namespace std; long long int c1, c2, x, y; long long int comp(long long int t) { long long int r1 = t / x, r2 = t / y, l = x * y, both = t / l; long long int left = t - r1 - r2 + both; r1 = r1 - both; r2 = r2 - both; long long int left1 = c1 - r2, left2 = c2 - r1; if (left1 < 0) left1 = 0; if (left2 < 0) left2 = 0; if (left1 + left2 <= left) return 1; else return 0; } long long int bs() { long long int st = 0, en = 1e18; while (en - st > 1) { long long int mid = (st + en) / 2; if (comp(mid)) en = mid; else st = mid; } return en; } int main() { cin >> c1 >> c2 >> x >> y; cout << bs(); }
#include <bits/stdc++.h> using namespace std; long long n, cnt; long long arr[100000], h[100000]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 0; i <= n - 1; i++) { cin >> arr[i]; h[i] = arr[i]; } sort(h, h + n); for (long long i = 0; i <= n - 1; i++) { if (arr[i] != h[i]) cnt++; } if (cnt > 2) cout << NO n ; else cout << YES n ; cin >> n; return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1608864 ) void ASS(bool b) { if (!b) ++*(int*)0; } int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); const int inf = 1 << 30; vector<int> v(m, inf); for (int i = 0; i < (int)(n); i++) { int x, y; scanf( %d %d , &x, &y); x--; v[x] = min(v[x], y); } int res = 0; for (int i = 0; i < (int)(m); i++) res += v[i]; res = min(res, k); printf( %d n , res); return 0; }
#include <bits/stdc++.h> using namespace std; const int Inf = 1000000000; const int Maxn = 30005; const int Maxk = 205; const int Maxd = 6; int n, k; int a[Maxn]; int dp[Maxn][Maxk][2][Maxd]; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); fill((int*)dp, (int*)dp + Maxn * Maxk * 2 * Maxd, -Inf); for (int i = 0; i < n; i++) { dp[i][1][1][0] = dp[i][1][0][0] = -a[i]; dp[i][1][1][1] = dp[i][1][0][1] = a[i]; } for (int i = n - 1; i >= 0; i--) for (int j = 1; j <= k; j++) { dp[i][j][1][0] = max(dp[i][j][1][0], dp[i + 1][j][1][0] - a[i]); dp[i][j][1][1] = max(dp[i][j][1][1], dp[i + 1][j][1][1] + a[i]); dp[i][j][1][2] = max(dp[i][j][1][2], dp[i + 1][j][1][2] - 2 * a[i]); if (j) { dp[i][j][1][2] = max(dp[i][j][1][2], dp[i + 1][j - 1][0][1] - 2 * a[i]); dp[i][j][1][2] = max(dp[i][j][1][2], dp[i + 1][j - 1][0][3] - 2 * a[i]); } dp[i][j][1][3] = max(dp[i][j][1][3], dp[i + 1][j][1][3] + 2 * a[i]); if (j) { dp[i][j][1][3] = max(dp[i][j][1][3], dp[i + 1][j - 1][0][0] + 2 * a[i]); dp[i][j][1][3] = max(dp[i][j][1][3], dp[i + 1][j - 1][0][2] + 2 * a[i]); } dp[i][j][1][4] = max(dp[i][j][1][4], dp[i + 1][j][1][4] - a[i]); if (j) { dp[i][j][1][4] = max(dp[i][j][1][4], dp[i + 1][j - 1][0][1] - a[i]); dp[i][j][1][4] = max(dp[i][j][1][4], dp[i + 1][j - 1][0][3] - a[i]); } dp[i][j][1][5] = max(dp[i][j][1][5], dp[i + 1][j][1][5] + a[i]); if (j) { dp[i][j][1][5] = max(dp[i][j][1][5], dp[i + 1][j - 1][0][0] + a[i]); dp[i][j][1][5] = max(dp[i][j][1][5], dp[i + 1][j - 1][0][2] + a[i]); } for (int z = 0; z < Maxd; z++) { dp[i][j][0][z] = max(dp[i][j][1][z], dp[i + 1][j][0][z]); if (j) dp[i][j][0][z] = max(dp[i][j][0][z], dp[i + 1][j - 1][0][z]); } } printf( %d n , max(dp[0][k][0][4], dp[0][k][0][5])); return 0; }
#include <bits/stdc++.h> using namespace std; struct point { int x, y; point(){}; point(int xx, int yy) { x = xx; y = yy; } point friend operator+(point a, point b) { return point(a.x + b.x, a.y + b.y); } point friend operator-(point a, point b) { return point(a.x - b.x, a.y - b.y); } long long friend operator*(point a, point b) { return (long long)a.x * b.y - (long long)a.y * b.x; } } a[5050], s[5050]; int n, tot; long long S; bool cmp(point a, point b) { if (a.x != b.x) return a.x < b.x; return a.y < b.y; } void put(point a) { printf( %d %d n , a.x, a.y); } long long area(int i, int j, int k) { return abs((s[j] - s[i]) * (s[k] - s[i])); } int main() { scanf( %d%I64d , &n, &S); for (int i = 1; i <= n; i++) scanf( %d%d , &a[i].x, &a[i].y); sort(a + 1, a + 1 + n, cmp); for (int i = 1; i <= n; i++) { while (tot > 1 && (a[i] - s[tot - 1]) * (s[tot] - s[tot - 1]) <= 0) tot--; s[++tot] = a[i]; } int k = tot; for (int i = n - 1; i > 0; i--) { while (tot > k && (a[i] - s[tot - 1]) * (s[tot] - s[tot - 1]) <= 0) tot--; s[++tot] = a[i]; } tot--; S = 0; int ii, jj, kk; for (int i = 1; i < tot - 1; i++) { int tmp = i + 2; for (int j = i + 1; j <= tot; j++) { while (tmp < tot && area(i, j, tmp + 1) > area(i, j, tmp)) tmp++; if (area(i, j, tmp) > S) { S = area(i, j, tmp); ii = i; jj = j; kk = tmp; } } } put(s[ii] + s[jj] - s[kk]); put(s[jj] + s[kk] - s[ii]); put(s[kk] + s[ii] - s[jj]); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 23333; int aa[maxn]; int p[maxn]; int main() { int a, b, w, x, c; scanf( %d%d%d%d%d , &a, &b, &w, &x, &c); c -= a; if (c <= 0) { printf( 0 n ); return 0; } int m = 0, haj; for (int i = b; !p[i];) { p[i] = ++m; if (i >= x) { i -= x; aa[m] = 1; } else { i = w - x + i; } if (p[i]) haj = p[i]; } for (int i = 1; i < haj; ++i) { c -= aa[i]; if (c <= 0) { printf( %d n , i); return 0; } } long long sum = (long long)haj - 1; int s = 0; for (int i = haj; i <= m; ++i) s += aa[i]; sum += (long long)((c - 1) / s) * (long long)(m - haj + 1); c -= ((c - 1) / s) * s; for (int i = haj; i <= m && c > 0; ++i) { c -= aa[i]; ++sum; } printf( %I64d n , sum); }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 50; int t, m, n; long long su, s[maxn], cf[maxn]; int a[maxn], b[maxn], c[maxn], x, y; int main() { scanf( %d %d , &n, &m); scanf( %d , a + 1); for (int i = 2; i <= m; ++i) { scanf( %d , a + i); su += abs(a[i] - a[i - 1]); } for (int i = 1; i <= n; ++i) s[i] = su; for (int i = 1; i <= m - 1; ++i) { x = min(a[i], a[i + 1]), y = max(a[i], a[i + 1]); if (x == y) continue; s[x] += x - 1; s[y] += 2 * x - y; if (x + 1 == y) continue; b[i] = x + 1; c[i] = y - 1; } for (int i = 1; i <= m - 1; ++i) { x = b[i]; y = c[i]; --cf[x]; ++cf[y + 1]; } for (int i = 1; i <= n; i++) { cf[i] = cf[i - 1] + cf[i]; s[i] += cf[i]; } for (int i = 1; i <= n; ++i) printf( %lld , s[i]); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int n, m; vector<int> g[MAXN]; int max1[MAXN], max2[MAXN]; bool vis[MAXN]; void dfs(int v) { vis[v] = true; for (auto to : g[v]) { if (!vis[to]) { dfs(to); if (max1[v] <= max1[to] + 1) { max2[v] = max1[v]; max1[v] = max1[to] + 1; } else if (max2[v] < max1[to] + 1) { max2[v] = max1[to] + 1; } } } } int ans; int main() { cin >> n >> m; while (m--) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i); for (int i = 1; i <= n; i++) ans = max(ans, max1[i] + max2[i]); cout << ans; return 0; }
#include<bits/stdc++.h> using namespace std; #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define f first #define s second #define for1(i,a,b) for (int i = a; i < b; i++) #define for2(i,a,b) for (int i = a; i > b; i--) #define arrin(a,n) for (int i = 0; i < n; i++) cin >> a[i]; #define arrout(a,n) for (int i = 0; i < n; i++) cout << a[i] << ; cout << n ; #define arrin2d(a,m,n) for (int i = 0; i < m; i++){for (int j = 0; j < n; j++) cin >> a[i][j];} #define arrout2d(a,m,n) for (int i = 0; i < m; i++){for (int j = 0; j < n; j++) cout << a[i][j] << ; cout << n ;} #define w(t) int t; cin >> t; while(t--) #define strin(s) getline(cin,s) #define pushb push_back #define popb pop_back #define pushf push_front #define popf pop_front #define mp make_pair #define lower_bound lb #define upper_bound ub #define yes cout << YES n #define no cout << NO n typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pair<int,int>> vp; typedef vector<char> vch; typedef vector<string> vstr; typedef set<ll> sll; typedef pair<int,int> pi; typedef map<int,int> mi; typedef map<int,char> mch; //typedef __int128_t vvlint; const int inf = 1e9 + 7; /* freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); */ void tc() { int a1,a2,a3,a4,a5,c1,c2,c3; cin >> c1 >> c2 >> c3; cin >> a1 >> a2 >> a3 >> a4 >> a5; if (a1 <= c1 && a2 <= c2 && a3 <= c3) { c1 -= a1; c2 -= a2; c3 -= a3; a4 -= min(a4,c1); a5 -= min(a5,c2); if (a4 + a5 <= c3) yes; else no; } else no; } int main() { fastio; w(t) { tc(); } return 0; }
#include <bits/stdc++.h> int n; char a[11][11], b[11][11], c[11][11]; void turn() { int i, j, k, l; for (i = n - 1, k = 0; i >= 0; --i, ++k) for (j = 0, l = 0; j < n; ++j, ++l) c[k][l] = a[j][i]; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] = c[i][j]; } int same() { int i, j; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) if (a[i][j] != b[i][j]) return 0; return 1; } void p() { int i, j; printf( n n ); for (i = 0; i < n; ++i) { for (j = 0; j < n; ++j) printf( %c , a[i][j]); printf( n ); } printf( n n ); } void f() { int i, j; for (i = 0; i < 3; ++i) { if (same()) { printf( Yes n ); return; } turn(); } if (same()) { printf( Yes n ); return; } for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) c[i][j] = a[i][n - j - 1]; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] = c[i][j]; for (i = 0; i < 3; ++i) { if (same()) { printf( Yes n ); return; } turn(); } if (same()) { printf( Yes n ); return; } printf( No n ); return; } int main() { scanf( %d , &n); int i, j; for (i = 0; i < n; ++i) scanf( %s , a[i]); for (i = 0; i < n; ++i) scanf( %s , b[i]); f(); return 0; }
#include <bits/stdc++.h> using namespace std; int const N = 1e6 + 6; bool us[N], use[N]; long long a[N]; long long n, x, k, q, x1, x2, y, ibibibibbibibibiibigbabypanfewewf, y2, ans, m; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> x1; for (int I = 0; I < x1; I++) { cin >> n; y = 0; ibibibibbibibibiibigbabypanfewewf = 1e9 + 7; for (int i = 1; i <= n; i++) { cin >> k >> q; y = max(y, k); ibibibibbibibibiibigbabypanfewewf = min(ibibibibbibibibiibigbabypanfewewf, q); } cout << max(0ll, y - ibibibibbibibibiibigbabypanfewewf) << endl; } }
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int n, long long int p) { long long int result = 1; while (n > 0) { if (n % 2 == 1) result = (result % p * x % p) % p; x = (x % p * x % p) % p; n = n / 2; } return result % p; } void solve() { long long int n, m; cin >> n >> m; vector<long long int> cnt(1005); for (long long int i = 0; i <= n - 1; i++) { long long int a1; cin >> a1; cnt[a1] = 1; } for (long long int i = 0; i <= m - 1; i++) { long long int a2; cin >> a2; if (cnt[a2] == 1) cnt[a2]++; } for (long long int i = 1; i <= 1000; i++) { if (cnt[i] >= 2) { cout << YES << endl; cout << 1 << i << endl; return; } } cout << NO << endl; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t = 1; cin >> t; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int i, a[26], ans = 0, tot = 0; string s; map<pair<long long int, long long int>, long long int> mp; for (i = 0; i < 26; i++) cin >> a[i]; cin >> s; for (i = 0; i < s.length(); i++) { ans += mp[{s[i] - a , tot}]; tot += a[s[i] - a ]; mp[{s[i] - a , tot}]++; } cout << ans; return 0; }
#include <bits/stdc++.h> template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } using namespace std; int main() { cin.tie(NULL), ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int a, b; cin >> a >> b; if (a > b) { if ((b - a) % 2 == 0) cout << 1 << n ; else cout << 2 << n ; } else if (a == b) cout << 0 << n ; else { if ((b - a) % 2 != 0) cout << 1 << n ; else cout << 2 << n ; } } }
#include <bits/stdc++.h> using namespace std; double pi = 3.14159265359; using namespace std; int main() { ios::sync_with_stdio(false); string a, b; cin >> a >> b; string c(a.size(), 0 ); int count = 0; for (unsigned int i = 0; i < a.size(); i++) if (a[i] == b[i]) c[i] = a[i], count++; if ((a.size() - count) % 2) cout << impossible ; else { bool ok = 0; for (unsigned int i = 0; i < a.size(); i++) if (a[i] != b[i] && !ok) c[i] = a[i], ok = 1; else if ((a[i] != b[i] && ok)) c[i] = b[i], ok = 0; cout << c << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; long long mul[100010], inv[100010]; const int mod = 998244353; const int maxn = 5050; void init() { mul[0] = 1; for (int i = 1; i < maxn; i++) mul[i] = (mul[i - 1] * i) % mod; inv[0] = inv[1] = 1; for (int i = 2; i < maxn; i++) inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod; for (int i = 1; i < maxn; i++) inv[i] = (inv[i - 1] * inv[i]) % mod; } long long C(int n, int m) { return mul[n] * inv[m] % mod * inv[n - m] % mod; } long long f(long long a, long long b) { long long ans = 0; for (int i = 0; i <= min(a, b); i++) ans = (ans + C(a, i) * C(b, i) % mod * mul[i] % mod) % mod; return ans; } int main() { int a, b, c; init(); cin >> a >> b >> c; cout << f(a, b) * f(a, c) % mod * f(b, c) % mod << endl; }
#include <bits/stdc++.h> using namespace std; const double pi = 2.0 * acos(0.0); const double eps = 1.0e-9; const int dr[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1}; const int dr6[] = {1, 1, 0, -1, -1, 0}, dc6[] = {0, 1, 1, 0, -1, -1}; const int dr8[] = {-1, -1, 0, 1, 1, 1, 0, -1}, dc8[] = {0, 1, 1, 1, 0, -1, -1, -1}; int main(void) { int kase = 1000000000; for (int ks = 1, n; ks <= kase && cin >> n; ++ks) { int c[32] = {0}; for (int i = 0, x; i < n && cin >> x; ++i) ++c[x + 16]; long long s = (long long)c[16] * (c[16] - 1) / 2; for (int i = 1; i <= 10; ++i) s += (long long)c[16 - i] * c[16 + i]; cout << s << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int rev(int n) { int ret = 0; while (n != 0) { ret = (10 * ret) + (n % 10); n /= 10; } return ret; } int main() { int mx, my, w; int i, j, k, t; int ax, ay; vector<int> v; map<pair<int, int>, vector<int> > mp; scanf( %d%d%d , &mx, &my, &w); for (i = 1; i <= my; i++) { j = rev(i); k = gcd(i, j); mp[make_pair(i / k, j / k)].push_back(i); } vector<int> vec(my + 1, 0); vector<vector<int> > vv; vv.push_back(v); for (i = 1; i <= mx; i++) { j = rev(i); k = gcd(i, j); v = mp[make_pair(j / k, i / k)]; for (j = 0; j < v.size(); j++) vec[v[j]]++; vv.push_back(v); } long long ans = -1; for (i = mx, j = 0, k = 0; i > 0; i--) { if (k < w && j < my) { do { j++; k += vec[j]; } while (k < w && j < my); } if (k >= w && (ans == -1 || ans > (long long)i * j)) { ans = (long long)i * j; ax = i; ay = j; } for (t = 0; t < vv[i].size(); t++) { if (vv[i][t] <= j) k--; vec[vv[i][t]]--; } } if (ans == -1) printf( -1 n ); else printf( %d %d n , ax, ay); return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 10; int n, a[N], b[N], c[N], p[N]; vector<int> v; int main() { cin >> n; for (int i = 1; i < N; i++) p[i] = i; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (a[i] == 2) cin >> c[i]; } for (int i = n; i >= 1; i--) { if (a[i] == 1) v.push_back(p[b[i]]); else if (a[i] == 2) p[b[i]] = p[c[i]]; } for (int i = v.size() - 1; i >= 0; i--) printf( %d , v[i]); return 0; }
#include <bits/stdc++.h> using namespace std; queue<int> qQuit; int ind[100000], n; bool entered[100000]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > qLeft, qRight; int data[100000]; int main(void) { scanf( %d , &n); for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); ind[temp - 1] = i; } for (int i = 0; i < n; i++) { scanf( %d , data + i); data[i]--; } for (int i = 0; i < n; i++) { qQuit.push(data[i]); if (i >= ind[data[i]]) qRight.push(make_pair(i - ind[data[i]], data[i])); else { qLeft.push(make_pair(ind[data[i]] - i, data[i])); entered[data[i]] = true; } } for (int i = 0; i < n; i++) { int minVal = 99999999; int minFrom; if (qRight.size()) { if (minVal > qRight.top().first - i) minFrom = qRight.top().second; minVal = min(minVal, qRight.top().first - i); } while (qLeft.size() && entered[qLeft.top().second] == false) qLeft.pop(); if (qLeft.size()) { if (minVal > qLeft.top().first + i) minFrom = qLeft.top().second; minVal = min(minVal, qLeft.top().first + i); } printf( %d n , minVal); while (qRight.size() && qRight.top().first - i == 0) { pair<int, int> val = qRight.top(); qRight.pop(); qLeft.push(make_pair(-i, val.second)); entered[val.second] = true; } int toQuit = qQuit.front(); qQuit.pop(); entered[toQuit] = false; qRight.push(make_pair(n - 1 - ind[toQuit] + (i + 1), toQuit)); } return 0; }
#include <bits/stdc++.h> using namespace std; int dque[500005]; int s = 0, t = 0, num = 0, q, maxi; double mean = 0; int main() { memset(dque, 0, sizeof(dque)); scanf( %d , &q); while (q--) { int type, x; scanf( %d , &type); if (type == 1) { scanf( %d , &x); if (num != 0) { mean = (mean * num + x - maxi) / num; dque[t++] = maxi; } else { mean = x; num++; } maxi = x; while (s < t && dque[s] < mean) { mean = (mean * num + dque[s]) / (num + 1); num++; s++; } } else printf( %.10f n , (double)maxi - mean); } return 0; }
#include <bits/stdc++.h> using namespace std; int dp[605][305][305]; int a[305][305]; int max(int a, int b) { return a > b ? a : b; } int main() { int n; while (scanf( %d , &n) != EOF) { int i, j, k; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { scanf( %d , &a[i][j]); } } for (i = 0; i <= 2 * n; i++) { for (j = 0; j < n; j++) { for (k = 0; k < n; k++) { dp[i][j][k] = -1000000000; } } } dp[0][0][0] = a[0][0]; for (i = 1; i <= 2 * (n - 1); i++) { for (j = 0; j < n && j <= i; j++) { if (i - j >= n) continue; for (k = 0; k < n && k <= i; k++) { if (i - k >= n) continue; int y1, y2, s; if (j == k && i - j == i - k) s = a[j][i - j]; else s = a[j][i - j] + a[k][i - k]; if (j - 1 >= 0) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j - 1][k] + s); if (j - 1 >= 0 && k - 1 >= 0) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j - 1][k - 1] + s); if (k - 1 >= 0) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k - 1] + s); dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k] + s); } } } printf( %d n , dp[2 * (n - 1)][n - 1][n - 1]); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; deque<int> vec(300000); int l = 0, r = 0; for (int i = 0; i < n; i++) { string s; int id; cin >> s >> id; if (!i) { vec[id] = l; l--, r++; } else { if (s == L ) { vec[id] = l; l--; } if (s == R ) { vec[id] = r; r++; } if (s == ? ) { cout << min(abs(vec[id] - l), abs(vec[id] - r)) - 1 << endl; } } } return 0; }
#include <bits/stdc++.h> using namespace std; vector<long long> adj[1002]; map<long long, long long> vis; map<pair<long long, long long>, long long> dia; long long st[1002], en[1002]; void dfs(long long tar, long long cur, bool &found, long long mini, long long &mini2) { vis[cur] = 1; if (tar == cur) { found = true; mini2 = min(mini, mini2); return; } for (long long i = 0; i < adj[cur].size(); i++) { if (vis[adj[cur][i]] == 0) { dfs(tar, adj[cur][i], found, min(mini, dia[{cur, adj[cur][i]}]), mini2); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); long long t, n, num, m, k; cin >> n >> k; for (long long i = 0; i < k; i++) { long long a, b, d; cin >> a >> b >> d; adj[a].push_back(b); adj[b].push_back(a); st[a]++; en[b]++; dia[{a, b}] = d; dia[{b, a}] = d; } vector<long long> v1, v2; for (long long i = 1; i <= n; i++) { if (en[i] == 0 && st[i] == 1) { v1.push_back(i); } if (st[i] == 0 && en[i] == 1) { v2.push_back(i); } } cout << v1.size() << n ; for (long long i = 0; i < v1.size(); i++) { for (long long j = 0; j < v2.size(); j++) { bool found = false; long long mini2 = LLONG_MAX; dfs(v2[j], v1[i], found, LLONG_MAX, mini2); vis.clear(); if (found) { cout << v1[i] << << v2[j] << << mini2 << n ; } } } return 0; }
#include <bits/stdc++.h> using namespace std; char mp[1001][1001]; int visit[1001][1001]; int dist[1001][1001]; int N, M; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; bool chk(int x, int y) { return 0 <= x && x < N && 0 <= y && y < M; } void dfs(int x, int y, bool isfirst) { visit[x][y] = 1; if (!isfirst) dist[x][y] = 1; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; if (chk(nx, ny) && mp[x][y] == mp[nx][ny] && visit[nx][ny] == 0) { dist[x][y] = 1; dfs(nx, ny, false); } } } int main(int argc, char *argv[]) { int Q; scanf( %d %d %d , &N, &M, &Q); for (int i = 0; i < N; i++) scanf( %s , mp[i]); for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (visit[i][j] == 0) dfs(i, j, true); } } queue<pair<int, int> > q; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (dist[i][j] == 1) q.push({i, j}); } } while (!q.empty()) { auto [x, y] = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int nx = x + dx[i], ny = y + dy[i]; if (chk(nx, ny) && dist[nx][ny] == 0) { dist[nx][ny] = dist[x][y] + 1; q.push({nx, ny}); } } } while (Q--) { long long x, y, t; scanf( %lld %lld %lld , &x, &y, &t); printf( %lld n , dist[x - 1][y - 1] ? ((mp[x - 1][y - 1] - 0 ) + max(t - (dist[x - 1][y - 1] - 1), 0LL)) % 2 : mp[x - 1][y - 1] - 0 ); } }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-15; const double pi = acos(-1.0); const long long Mod = 1000000007; const int N = 1e3 + 5; int ks = 0; int n, m, s, t; long long dis[N], cost[N * 10], L; int used[N], deleted[N * 10]; pair<int, int> parent[N]; vector<pair<int, int> > g[N]; struct edge { int x, y; long long z; bool operator<(const edge &f) const { return z > f.z; } } E[N * 10]; void SPFA() { for (int i = 0; i < n; i++) { dis[i] = LLONG_MAX; used[i] = 0; } priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > q; q.emplace(0, s); dis[s] = 0; while (q.size()) { int from = q.top().second; used[from] = 1; q.pop(); for (auto i : g[from]) { int to = i.first; int id = i.second; if (dis[from] + cost[id] < dis[to]) { dis[to] = dis[from] + cost[id]; parent[to] = {from, id}; if (!used[to]) q.emplace(dis[to], to); } } } } int main() { scanf( %d%d%I64d%d%d , &n, &m, &L, &s, &t); for (int i = 0; i < m; i++) { scanf( %d%d%I64d , &E[i].x, &E[i].y, &E[i].z); } sort(E, E + m); int last = 0; for (int i = 0; i < m && E[i].z; i++, last++) { cost[i] = E[i].z; g[E[i].x].emplace_back(E[i].y, i); g[E[i].y].emplace_back(E[i].x, i); } SPFA(); if (dis[t] < L) { puts( NO ); return 0; } for (int i = last; i < m; i++) { deleted[i] = cost[i] = 1; g[E[i].x].emplace_back(E[i].y, i); g[E[i].y].emplace_back(E[i].x, i); } SPFA(); if (dis[t] > L) { puts( NO ); return 0; } puts( YES ); while (dis[t] < L) { int cur = t; while (cur != s) { int id = parent[cur].second; cur = parent[cur].first; if (deleted[id]) { cost[id] += L - dis[t]; break; } } SPFA(); } bool done[N]; memset(done, false, sizeof done); for (int i = 0; i < n; i++) { for (auto j : g[i]) { if (done[j.first]) continue; cout << i << << j.first << << cost[j.second] << n ; } done[i] = true; } }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int pre = INT_MIN; int cur; int state = 0; for (int i = 0; i < n; i++) { cin >> cur; if (cur > pre) { if (state == 0) { pre = cur; continue; } else { cout << NO << endl; return 0; } } else if (cur == pre) { if (state == 1) { pre = cur; continue; } if (state == 0) { pre = cur; state = 1; continue; } cout << NO << endl; return 0; } else { if (state == 2) { pre = cur; continue; } if (state < 2) { pre = cur; state = 2; continue; } cout << NO << endl; return 0; } } cout << YES << endl; return 0; }
#include <bits/stdc++.h> int main(int argc, const char* argv[]) { int n; std::cin >> n; std::string s; std::cin >> s; std::vector<int> v0(n); for (int i = 0; i < n; i++) v0[i] = s[i] - 0 ; bool add = true; std::vector<int> v1(n); for (int i = 0; i < n; i++) { if (add) v1[i] = v0[i] + 1; else v1[i] = v0[i]; if (v1[i] == 2) { add = true; v1[i] = 0; } else add = false; } int count = 0; for (int i = 0; i < n; i++) if (v0[i] != v1[i]) count++; std::cout << count << std::endl; return 0; }
#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; struct node { long long x, l, r; } a[10005]; long long b[20005]; int is[20005][4], ed[20005][4]; int l = 2; struct Matrix { long long v[3][3]; Matrix() { memset(v, 0, sizeof(v)); } Matrix operator*(const Matrix B) { Matrix C; for (int i = 0; i <= l; i++) for (int j = 0; j <= l; j++) for (int k = 0; k <= l; k++) { C.v[i][j] = (C.v[i][j] + v[i][k] * B.v[k][j]) % mod; } return C; } }; Matrix mtpow(Matrix A, long long k) { int i; Matrix B; for (int i = 0; i <= l; i++) B.v[i][i] = 1; while (k) { if (k & 1) B = B * A; A = A * A; k >>= 1; } return B; } int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i].x >> a[i].l >> a[i].r; b[++b[0]] = a[i].l; b[++b[0]] = a[i].r; } b[++b[0]] = 1, b[++b[0]] = m; sort(b + 1, b + b[0] + 1); b[0] = unique(b + 1, b + b[0] + 1) - b - 1; for (int i = 1; i <= n; i++) { a[i].l = lower_bound(b + 1, b + b[0] + 1, a[i].l) - b; a[i].r = lower_bound(b + 1, b + b[0] + 1, a[i].r) - b; is[a[i].l][a[i].x]++, is[a[i].r + 1][a[i].x]--; ed[a[i].r][a[i].x]++; } long long x1 = 0, x2 = 1, x3 = 0; long long x11, x22, x33; Matrix B; for (int i = 0; i <= l; i++) { for (int j = 0; j <= l; j++) { if ((i == 0 && j == 2) || (i == 2 && j == 0)) B.v[i][j] = 0; else B.v[i][j] = 1; } } for (int i = 2; i <= b[0]; i++) { for (int j = 1; j <= 3; j++) is[i][j] += is[i - 1][j]; long long c = b[i] - b[i - 1] - 1; Matrix temp = B; for (int j = 1; j <= 3; j++) { if (is[i - 1][j] - ed[i - 1][j] >= 1) for (int k = 0; k <= 2; k++) temp.v[j - 1][k] = 0; } temp = mtpow(temp, c); x11 = (temp.v[0][0] * x1 + temp.v[0][1] * x2 + temp.v[0][2] * x3) % mod; x22 = (temp.v[1][0] * x1 + temp.v[1][1] * x2 + temp.v[1][2] * x3) % mod; x33 = (temp.v[2][0] * x1 + temp.v[2][1] * x2 + temp.v[2][2] * x3) % mod; x1 = (x11 + x22) % mod, x2 = (x11 + x22 + x33) % mod, x3 = (x33 + x22) % mod; if (is[i][1]) x1 = 0; if (is[i][2]) x2 = 0; if (is[i][3]) x3 = 0; } cout << x2 << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int x = 1; while (x <= n) { if (x == n || x + 1 == n) { cout << 1 << n ; return 0; } if (x & 1) { x = x * 2 + 2; } else { x = x * 2 + 1; } } cout << 0 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 6; vector<pair<int, int> > G[maxn]; int out, m, d[maxn], ans[maxn][3], leaf[maxn][2]; void add_m(int u, int v, int d) { ans[++m][0] = u, ans[m][1] = v, ans[m][2] = d; } void add_link(int u, int l, int d) { if (u == out) { add_m(u, l, d); return; } int a = l, b = leaf[u][0] == l ? leaf[u][1] : leaf[u][0], c = out; add_m(a, c, d / 2), add_m(a, b, d / 2), add_m(b, c, -d / 2); } void dfs(int u, int f, int l) { if (G[u].size() == 1 && f) { leaf[u][0] = u; return; } for (int i = 0; i < G[u].size(); ++i) { int v = G[u][i].first; if (v != f) { dfs(v, u, l); if (leaf[u][0]) leaf[u][1] = leaf[v][0]; else leaf[u][0] = leaf[v][0]; } } for (int i = 0; i < G[u].size(); ++i) { int v = G[u][i].first; if (v != f) { int d = G[u][i].second; if (G[v].size() == 1) add_link(u, v, G[u][i].second); else { add_link(u, leaf[v][0], G[u][i].second); add_link(v, leaf[v][0], -G[u][i].second); } } } } int main() { int n; cin >> n; for (int i = 1; i < n; ++i) { int u, v, c; cin >> u >> v >> c; G[u].push_back(make_pair(v, c)); G[v].push_back(make_pair(u, c)); ++d[u], ++d[v]; } for (int i = 1; i <= n; ++i) if (d[i] == 2) { cout << NO << endl; return 0; } for (int i = 1; i <= n; ++i) if (G[i].size() == 1) { out = i, dfs(i, 0, i); break; } cout << YES << endl; cout << m << endl; for (int i = 1; i <= m; ++i) cout << ans[i][0] << << ans[i][1] << << ans[i][2] << endl; }
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, k, j, i, a[10001], s[1002], n1, n2, num[1002], h1, h2; double x, sum1, sum2, l, r, m; scanf( %d %d , &n, &k); h1 = 1000; h2 = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (h1 > a[i]) h1 = a[i]; if (h2 < a[i]) h2 = a[i]; } for (i = 0; i <= h2; i++) { s[i] = 0; num[i] = 0; } for (i = 0; i < n; i++) { for (j = a[i]; j <= h2; j++) { s[j] += a[i]; num[j]++; } } l = h1; r = h2; while (r - l >= 1e-9) { m = (l + r) / 2; sum1 = ((double)num[(int)m]) * m - (double)s[(int)m]; sum2 = (double)(s[h2] - s[(int)m]) - (((double)(num[h2] - num[(int)m])) * m); if (sum2 * (1 - k / 100.0) > sum1) { l = m; } else { r = m; } } cout.precision(6); cout.setf(ios::fixed, ios::floatfield); cout << (s[h2] - sum2 * (double)k / 100.0) / (double)n << endl; return EXIT_SUCCESS; }
#include <bits/stdc++.h> using namespace std; long long vectorMult(pair<int, int> a, pair<int, int> b, pair<int, int> c) { return (c.first - a.first) * 1ll * (b.second - a.second) - (c.second - a.second) * 1ll * (b.first - a.first); } bool cmp(pair<int, int> a, pair<int, int> b) { return a.first < b.first || a.first == b.first && a.second < b.second; } vector<pair<int, int> > convex_hull(vector<pair<int, int> > t) { if (t.size() == 1) return t; sort(t.begin(), t.end(), cmp); vector<pair<int, int> > up, down; auto l = t[0]; auto r = t.back(); up.push_back(t[0]); down.push_back(t[0]); for (int i = 1; i < t.size(); i++) { if (vectorMult(l, r, t[i]) <= 0) { while (up.size() >= 2 && vectorMult(up[up.size() - 2], up.back(), t[i]) <= 0) { up.pop_back(); } up.push_back(t[i]); } if (vectorMult(l, r, t[i]) >= 0) { while (down.size() >= 2 && vectorMult(down[down.size() - 2], down.back(), t[i]) >= 0) { down.pop_back(); } down.push_back(t[i]); } } up.insert(up.end(), down.rbegin() + 1, down.rend() - 1); if (up.size() == 2 && up[0] == up[1]) up.pop_back(); return up; } int main() { ios_base::sync_with_stdio(0); while (true) { int n; cin >> n; if (n == 0) break; vector<string> v; for (int i = 0; i < n; i++) { string x; cin >> x; v.push_back(x); } for (int i = 0; i < n - i - 1; i++) { swap(v[i], v[n - i - 1]); } vector<pair<int, int> > t; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - 1; j++) { if (v[i][j] > 0 && v[i][j + 1] > 0 && v[i + 1][j] > 0 && v[i + 1][j + 1] > 0 ) { t.push_back(make_pair(j + 1, i + 1)); } } } t = convex_hull(t); int mn = 0; for (int i = 1; i < t.size(); i++) if (t[i] < t[mn]) { mn = i; } vector<pair<int, int> > ans; ans.insert(ans.end(), t.begin() + mn, t.end()); ans.insert(ans.end(), t.begin(), t.begin() + mn); cout << ans.size() << endl; for (auto it : ans) cout << it.first << << it.second << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 5, Mod = 1e9 + 7, Lg = 27, P = 727, Sq = 350; const long long Inf = 3e18 + 10; long long ans; long long gcd(long long x, long long y) { if (x > y) swap(y, x); if (!x) return y; return gcd(x, y % x); } void solve(long long x, long long y, long long d1, long long z, long long w, long long d2) { long long t = y - x + 1; long long g = gcd(d1, d2); long long d = abs(x - z); long long q = d / g; if (x < z) { x += q * g; if (x < z) x += g; } else { x -= q * g; if (x > y) x -= g; } if (x < z || x > w) return; ans = max(ans, min(t, w - x + 1)); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); long long x, y, d1, z, w, d2; cin >> x >> y >> d1 >> z >> w >> d2; solve(x, y, d1, z, w, d2); solve(z, w, d2, x, y, d1); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) { fu = -1; } c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); } f *= fu; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x < 10) putchar(x + 48); else print(x / 10), putchar(x % 10 + 48); } template <typename T> void print(T x, char t) { print(x); putchar(t); } int main() { for (int i = 1; i <= 35; i++) printf( l ); for (int i = 1; i <= 36; i++) printf( dsut0r ); printf( luu ); for (int i = 1; i <= 35; i++) printf( l ); for (int i = 1; i <= 36; i++) printf( usdt0r ); for (int i = 1; i <= 36; i++) printf( le ); printf( ddd ); for (int i = 1; i <= 35; i++) printf( 0r ); printf( 0uu ); for (int i = 1; i <= 33; i++) { printf( r10ltldr01lt0utd10ut ); printf( uur01ltlldr10ltr10lt0utd10ut ); printf( lrr01ltl10rtl1rt ); printf( rrelelu10dtu10dtddlr10ltu10dtu ); printf( r10ltldr01lt0utd10ut ); printf( uur01ltlldr10ltr10lt0utd10ut ); printf( lrr01ltl10rtl1rt ); printf( l10rtd10utl10rtd10ut ); printf( uereuerererelueueledeleue ); printf( lddd10utuuur10ltd10utd10utl0rt ); printf( r10ltl01rtl1rt ); printf( rdu10dt0ut ); printf( r10ltl01rtl1rt ); printf( ru0utd10ut ); printf( r10ltl01rtl1rt ); printf( reueuerededeldeleuuu ); } printf( ddddr ); return 0; }
#include <bits/stdc++.h> using namespace std; pair<pair<long long, long long>, pair<long long, long long> > st1[4000000]; pair<pair<long long, long long>, pair<long long, long long> > st2[4000000]; long long arrL[600010]; long long arrR[600010]; long long dist[600010]; long long height[600010]; pair<pair<long long, long long>, pair<long long, long long> > maximize( pair<pair<long long, long long>, pair<long long, long long> > p, pair<pair<long long, long long>, pair<long long, long long> > q) { pair<long long, long long> a[4]; a[0] = p.first; a[1] = p.second; a[2] = q.first; a[3] = q.second; sort(a, a + 4); return make_pair(a[2], a[3]); } void build(pair<pair<long long, long long>, pair<long long, long long> > st[], long long arr[], int node, int L, int R) { if (L == R) st[node] = make_pair(make_pair(arr[L], L), make_pair(-1LL << 60, -1)); else { int mid = (R + L) / 2; build(st, arr, node * 2, L, mid); build(st, arr, node * 2 + 1, mid + 1, R); st[node] = maximize(st[node * 2], st[node * 2 + 1]); } } pair<pair<long long, long long>, pair<long long, long long> > query( pair<pair<long long, long long>, pair<long long, long long> > st[], int node, int L, int R, int i, int j) { if (i > R || j < L) return make_pair(make_pair(-1LL << 60, -1), make_pair(-1LL << 60, -1)); if (L >= i && R <= j) return st[node]; int mid = (L + R) / 2; pair<pair<long long, long long>, pair<long long, long long> > qL = query(st, node * 2, L, mid, i, j); pair<pair<long long, long long>, pair<long long, long long> > qR = query(st, node * 2 + 1, mid + 1, R, i, j); return maximize(qL, qR); } int main() { int N, M; cin >> N >> M; for (int i = 0; i < N; i++) { cin >> dist[i]; dist[i + N] = dist[i]; } for (int i = 1; i < 2 * N - 1; i++) dist[i] += dist[i - 1]; for (int i = 0; i < N; i++) { cin >> height[i]; height[i + N] = height[i]; } for (int i = 0; i < 2 * N - 1; i++) { arrL[i] = arrR[i] = 2 * height[i]; if (i) { arrL[i] -= dist[i - 1]; arrR[i] += dist[i - 1]; } } build(st1, arrL, 1, 0, 2 * N - 1); build(st2, arrR, 1, 0, 2 * N - 1); for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--, b--; int x, y; if (a <= b) { x = b + 1; y = a + N - 1; } else { x = b + 1; y = a - 1; } pair<pair<long long, long long>, pair<long long, long long> > p = query(st1, 1, 0, 2 * N - 1, x, y); pair<pair<long long, long long>, pair<long long, long long> > q = query(st2, 1, 0, 2 * N - 1, x, y); vector<pair<long long, long long> > v1; v1.push_back(p.first); v1.push_back(p.second); vector<pair<long long, long long> > v2; v2.push_back(q.first); v2.push_back(q.second); vector<long long> ret; for (int i = 0; i < int((v1).size()); i++) for (int j = 0; j < int((v2).size()); j++) if (v1[i].second == v2[j].second) continue; else ret.push_back(v1[i].first + v2[j].first); sort((ret).begin(), (ret).end()); cout << ret.back() << endl; } }
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int N = 3e6 + 7; const int INF = 1e9 + 9; const int xi[] = {0, 0, +1, -1}; const int yi[] = {-1, +1, 0, 0}; const int xxi[] = {-1, +1, 0, 0, -1, +1, +1, -1}; const int yyi[] = {0, 0, -1, +1, -1, +1, -1, +1}; int n, ans; int w[1000001], cnt[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> w[i]; cnt[w[i]]++; } for (int i = 0; i <= N - 1; i++) { cnt[i + 1] += cnt[i] / 2; cnt[i] %= 2; ans += cnt[i]; } cout << ans; }
#include <bits/stdc++.h> using namespace std; template <class T> inline int read(T& x) { static char ch; static bool neg; for (ch = neg = 0; ch < 0 || 9 < ch; neg |= ch == - , ch = getchar()) ; for (x = 0; 0 <= ch && ch <= 9 ; (x *= 10) += ch - 0 , ch = getchar()) ; return (x = neg ? -x : x); } template <class T> inline void write(T x) { if (x < 0) { putchar( - ); x = -x; } if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } template <class T> inline void writeln(T x) { write(x); putchar( n ); } const int N = 2e5 + 10; int m, n, k, t; int a[N]; struct T { int l, r, d; } trap[N]; int c[N]; inline bool check(int val) { int sum = 0; for (int i = 1; i <= k; i++) { if (trap[i].d > val) { c[trap[i].l]++; c[trap[i].r + 1]--; } } for (int i = 1, s = 0; i <= n + 1; i++) { s += c[i]; if (s > 0) sum += 2; } for (int i = 1; i <= k; i++) { if (trap[i].d > val) { c[trap[i].l]--; c[trap[i].r + 1]++; } } return sum + n + 1 <= t; } int main(void) { read(m); read(n); read(k); read(t); for (int i = 1; i <= m; i++) read(a[i]); sort(a + 1, a + m + 1); for (int i = 1; i <= k; i++) { read(trap[i].l); read(trap[i].r); read(trap[i].d); } a[m + 1] = 1e9 + 10; int st = 1, en = m + 1; while (st != en) { int md = (st + en) >> 1; if (check(a[md])) en = md; else st = md + 1; } printf( %d n , m - st + 1); }
#include <bits/stdc++.h> using namespace std; constexpr int MAXN = 200000; int x[MAXN + 2]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; sort(x, x + n); int ans = INT_MAX; for (int i = 0; i < n / 2; i++) ans = min(ans, x[i + n / 2] - x[i]); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, k, q; scanf( %d%d , &n, &k); n = 1 << n; printf( %d , (n >> (k < n)) - 1), q = i = 0; while (++i < n) if (i < (i ^ k)) printf( %d , i ^ q), q = i; }
#include <bits/stdc++.h> using namespace std; queue<pair<int, int> > L, R; int **M; int ori, n, m; bool play(pair<int, int> &p, int &ori) { for (int i = 0; i < 2; i++) { if (ori == 0) { if (M[p.first + 1][p.second] > 0) ori++; else { p = {p.first + 1, p.second}; return 1; } } if (ori == 1) { if (M[p.first][p.second + 1] > 0) ori++; else { p = {p.first, p.second + 1}; return 1; } } if (ori == 2) { if (M[p.first - 1][p.second] > 0) ori++; else { p = {p.first - 1, p.second}; return 1; } } if (ori == 3) { if (M[p.first][p.second - 1] > 0) ori = 0; else { p = {p.first, p.second - 1}; return 1; } } } return 0; } void f(pair<int, int> l, pair<int, int> r, int oril, int orir) { L.push(l); if (l != r) R.push(r); else return; M[l.first][l.second] = 1; M[r.first][r.second] = 2; if (play(l, oril) == 0) return; if (play(r, orir) == 0) return; f(l, r, oril, orir); } int main() { scanf( %d%d , &n, &m); M = new int *[n + 2]; for (int i = 0; i < n + 2; i++) { M[i] = new int[m + 2]; for (int j = 0; j < m + 2; j++) M[i][j] = 0; } for (int i = 0; i < n + 2; i++) M[i][0] = M[i][m + 1] = 1; for (int i = 0; i < m + 2; i++) M[0][i] = M[n + 1][i] = 1; f({1, 1}, {n, m}, 0, 2); while (!L.empty()) { printf( %d %d n , L.front().first, L.front().second); L.pop(); if (!R.empty()) { printf( %d %d n , R.front().first, R.front().second); R.pop(); } } }
#include <bits/stdc++.h> using namespace std; string multiply(string num1, string num2) { int len1 = num1.size(); int len2 = num2.size(); if (len1 == 0 || len2 == 0) return 0 ; vector<int> result(len1 + len2, 0); int i_n1 = 0; int i_n2 = 0; for (int i = len1 - 1; i >= 0; i--) { int carry = 0; int n1 = num1[i] - 0 ; i_n2 = 0; for (int j = len2 - 1; j >= 0; j--) { int n2 = num2[j] - 0 ; int sum = n1 * n2 + result[i_n1 + i_n2] + carry; carry = sum / 10; result[i_n1 + i_n2] = sum % 10; i_n2++; } if (carry > 0) result[i_n1 + i_n2] += carry; i_n1++; } int i = result.size() - 1; while (i >= 0 && result[i] == 0) i--; if (i == -1) return 0 ; string s = ; while (i >= 0) s += std::to_string(result[i--]); return s; } string divide(string number, int divisor) { string ans; int idx = 0; int temp = number[idx] - 0 ; while (temp < divisor) temp = temp * 10 + (number[++idx] - 0 ); while (number.size() > idx) { ans += (temp / divisor) + 0 ; temp = (temp % divisor) * 10 + number[++idx] - 0 ; } if (ans.length() == 0) return 0 ; return ans; } int main() { int spf[100000]; for (int i = 0; i < 100000; ++i) { spf[i] = i; } for (int i = 4; i < 100000; i += 2) { spf[i] = 2; } for (int i = 3; i * i < 100000; ++i) { if (spf[i] == i) { for (int j = i * i; j < 100000; j += i) { if (spf[j] == j) { spf[j] = i; } } } } vector<int> primes; for (int i = 2; i < 100000; ++i) { if (spf[i] == i) { primes.push_back(i); } } int n; cin >> n; if (n == 2) { cout << -1 << endl; return 0; } string ans = 1 ; for (int i = 0; i < n; ++i) { ans = multiply(ans, to_string(primes[i])); } for (int i = 0; i < n; ++i) { cout << divide(ans, primes[i]) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, -b); return a * (b / gcd(a, b)); } template <class T> inline T sqr(T x) { return x * x; } template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } long long toInt64(string s) { long long r = 0; istringstream sin(s); sin >> r; return r; } double LOG(long long N, long long B) { return (log10l(N)) / (log10l(B)); } string itoa(long long a) { if (a == 0) return 0 ; string ret; for (long long i = a; i > 0; i = i / 10) ret.push_back((i % 10) + 48); reverse(ret.begin(), ret.end()); return ret; } vector<string> token(string a, string b) { const char *q = a.c_str(); while (count(b.begin(), b.end(), *q)) q++; vector<string> oot; while (*q) { const char *e = q; while (*e && !count(b.begin(), b.end(), *e)) e++; oot.push_back(string(q, e)); q = e; while (count(b.begin(), b.end(), *q)) q++; } return oot; } int isvowel(char s) { s = tolower(s); if (s == a || s == e || s == i || s == o || s == u ) return 1; return 0; } int isupper(char s) { if (s >= A and s <= Z ) return 1; return 0; } int Set(int N, int pos) { return N = N | (1 << pos); } int reset(int N, int pos) { return N = N & ~(1 << pos); } int check(int N, int pos) { return (N & (1 << pos)); } int toggle(int N, int pos) { if (check(N, pos)) return N = reset(N, pos); return N = Set(N, pos); } void pbit(int N) { printf( ( ); for (int i = 10; i >= 0; i--) { bool x = check(N, i); cout << x; } puts( ) ); } int main() { int n, q; cin >> n >> q; string s; cin >> s; string w = s; while (q--) { s = w; int val[202] = {0}, del[202] = {0}; for (int i = 0; i < (int)s.size(); i++) { if (s[i] >= 0 and s[i] <= 9 ) val[i + 1] = s[i] - 0 ; } s = # + s; char prev = ) ; int pidx, freq[111] = {0}; int l, r; cin >> l >> r; int cp = l, dp = 1; while (cp >= l and cp <= r) { if (del[cp]) { cp += dp; } else { if (s[cp] >= 0 and s[cp] <= 9 ) { freq[val[cp]]++; val[cp]--; if (val[cp] == -1) del[cp] = 1; } else { if (prev == > or prev == < ) { del[pidx] = 1; } if (s[cp] == > ) dp = 1; else dp = -1; } prev = s[cp]; pidx = cp; cp += dp; } } for (int i = 0; i < (int)10; i++) { if (i) printf( ); printf( %d , freq[i]); } puts( ); } }
#include <bits/stdc++.h> using namespace std; const int N = int(1e5) + 500; int n, m, a[N], s, h, mm; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> s; for (int i = 1; i <= n; i++) { cin >> h >> mm; a[++m] = h * 60 + mm; } if (a[1] >= s + 1) { cout << 0 << << 0; exit(0); } for (int i = 2; i <= n; i++) { if (a[i] - a[i - 1] >= s * 2 + 2) { cout << (a[i - 1] + s + 1) / 60 << << (a[i - 1] + s + 1) % 60; exit(0); } } cout << (a[m] + s + 1) / 60 << << (a[m] + s + 1) % 60; return 0; }
#include <bits/stdc++.h> using namespace std; string second; int n, k; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; cin >> second >> k; if (second.size() < k) return cout << impossible n , 0; set<char> st; for (auto i : second) st.insert(i); if (st.size() > k) cout << 0 ; else cout << k - st.size() << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int arr[60]; signed main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> arr[i]; sort(arr, arr + n); bool aliceWins = (arr[0] < arr[n >> 1]); cout << (aliceWins ? Alice n : Bob n ); }
#include <bits/stdc++.h> using namespace std; const int maxn = 3e8; int l, r, cnt, ans1, pre1[20000005]; bitset<maxn> pre; int max1, max2; int main() { cin >> l >> r; pre[1] = pre[0] = 1; ans1 = 1; for (int yui = 2; yui <= r; yui++) { if (pre[yui] == 0) { cnt++; pre1[cnt] = yui; if (yui % 4 == 1) ans1++; } if (yui == l - 1) max1 = ans1; if (yui == r) max2 = ans1; for (int j = 1; j <= cnt && pre1[j] * yui <= r; j++) { pre[yui * pre1[j]] = 1; if (yui % pre1[j] == 0) break; } } cout << max2 - max1; }