Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files
xet
Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; bool cmp(pair<int, int> a, pair<int, int> b) { return abs(a.first) + abs(a.second) < abs(b.first) + abs(b.second); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<pair<int, int>> q1; vector<pair<int, int>> q2; vector<pair<int, int>> q3; vector<pair<int, int>> q4; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; if (x > 0 && y >= 0) { q1.push_back(make_pair(x, y)); } if (x <= 0 && y > 0) { q2.push_back(make_pair(x, y)); } if (x < 0 && y <= 0) { q3.push_back(make_pair(x, y)); } if (x >= 0 && y < 0) { q4.push_back(make_pair(x, y)); } } sort(q1.begin(), q1.end(), cmp); sort(q2.begin(), q2.end(), cmp); sort(q3.begin(), q3.end(), cmp); sort(q4.begin(), q4.end(), cmp); int ans = 0; for (int i = 0; i < q1.size(); i++) { ans += 4; if (q1[i].second != 0) { ans += 2; } } for (int i = 0; i < q2.size(); i++) { ans += 4; if (q2[i].first != 0) { ans += 2; } } for (int i = 0; i < q3.size(); i++) { ans += 4; if (q3[i].second != 0) { ans += 2; } } for (int i = 0; i < q4.size(); i++) { ans += 4; if (q4[i].first != 0) { ans += 2; } } cout << ans << endl; for (int i = 0; i < q1.size(); i++) { cout << 1 << abs(q1[i].first) << R n ; if (q1[i].second != 0) { cout << 1 << abs(q1[i].second) << U n ; } cout << 2 << endl; if (q1[i].second != 0) { cout << 1 << abs(q1[i].second) << D n ; } cout << 1 << abs(q1[i].first) << L n ; cout << 3 << endl; } for (int i = 0; i < q2.size(); i++) { cout << 1 << abs(q2[i].second) << U n ; if (q2[i].first != 0) { cout << 1 << abs(q2[i].first) << L n ; } cout << 2 << endl; if (q2[i].first != 0) { cout << 1 << abs(q2[i].first) << R n ; } cout << 1 << abs(q2[i].second) << D n ; cout << 3 << endl; } for (int i = 0; i < q3.size(); i++) { cout << 1 << abs(q3[i].first) << L n ; if (q3[i].second != 0) { cout << 1 << abs(q3[i].second) << D n ; } cout << 2 << endl; if (q3[i].second != 0) { cout << 1 << abs(q3[i].second) << U n ; } cout << 1 << abs(q3[i].first) << R n ; cout << 3 << endl; } for (int i = 0; i < q4.size(); i++) { cout << 1 << abs(q4[i].second) << D n ; if (q4[i].first != 0) { cout << 1 << abs(q4[i].first) << R n ; } cout << 2 << endl; if (q4[i].first != 0) { cout << 1 << abs(q4[i].first) << L n ; } cout << 1 << abs(q4[i].second) << U n ; cout << 3 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2007; set<pair<int, int> > E[N]; struct edge { int x, y; } e[N]; int n, rk[N], mxrk, mxid; void adde(int x, int y, int i) { E[x].insert(make_pair(y, i)), E[y].insert(make_pair(x, i)); } void dele(int i) { int x = e[i].x, y = e[i].y; E[x].erase(make_pair(y, i)), E[y].erase(make_pair(x, i)); printf( ? %d %d n , x, y), fflush(stdout); } bool check(vector<pair<__int128, int> > &ve, __int128 x) { priority_queue<pair<__int128, int> > q; for (auto u : ve) q.push(u); for (int i = n - 1; i >= 0; i--) if (x >> i & 1) { pair<__int128, int> v = q.top(); q.pop(); v.first -= __int128(1) << i, rk[v.second] = i; q.push(v); } return q.top().first < 0; } __int128 produce(vector<pair<__int128, int> > &ve) { if (!ve.size()) return 0; __int128 z = (__int128(1) << n) - 1; for (int i = n - 1; i >= 0; i--) if (check(ve, z - (__int128(1) << i))) z -= __int128(1) << i; check(ve, z); return z; } __int128 dfs(int v, int fa) { vector<pair<__int128, int> > ve; for (auto x : E[v]) { int u = x.first; if (u == fa) continue; ve.push_back(make_pair(dfs(u, v), x.second)); } return produce(ve); } void find(int v, int fa) { for (auto x : E[v]) { int u = x.first, i = x.second; if (u == fa) continue; if (rk[i] > mxrk) mxrk = rk[i], mxid = i; find(u, v); } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); adde(x, y, i), adde(y, x, i); e[i] = {x, y}; } dfs(1, 0); int rt = 1; while (1) { mxrk = -1, mxid = 0; find(rt, 0); if (mxrk == -1) break; dele(mxid); scanf( %d , &rt); } printf( ! %d n , rt), fflush(stdout); return 0; }
#include <bits/stdc++.h> using namespace std; long long bin_pow(long long a, long long b) { if (b == 0) return 1; if (b % 2 == 0) { long long t = bin_pow(a, b / 2); return t * t % 1000000007; } else return a * bin_pow(a, b - 1) % 1000000007; } vector<long long> a; int main() { ios::sync_with_stdio(false); cin.tie(0); long long t = 1, n, m, k = 0, x = 0, y = 0, z = 0, sum = 0, l = 0, r = 0, ans = 0, mn = LLONG_MAX, mx = LLONG_MIN; cin >> n; a.resize(n); vector<pair<long long, long long> > d; stack<long long> s; for (int i = 0; i < n; i++) cin >> a[i]; t = 0; for (int i = 0; i < n; i++) { if (a[i] < t) { while (a[i] != t) { x = s.top(); s.pop(); d.push_back({x, i}); t--; } } else { while (a[i] != t) { s.push(i + 1); t++; } } } while (!s.empty()) { x = s.top(); d.push_back({x, n}); s.pop(); } cout << d.size() << n ; for (auto u : d) cout << u.first << << u.second << n ; return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> graph[5001]; bool subset[5001][5001]; set<pair<int, int>> ans_pairs; vector<int> child_nodes(5001, -1); int total_nodes; void insert_into_answer(int network1, int network2) { if (network1 != 0 && network2 != 0) { ans_pairs.insert({network1, network2}); ans_pairs.insert({network2, network1}); } return; } bool isSubsetSum(vector<int> &set, int n, int sum) { for (int i = 0; i <= set.size(); i++) subset[i][0] = true; for (int j = 1; j <= sum; j++) subset[0][j] = false; for (int i = 1; i <= n; i++) { for (int j = 1; j <= sum; j++) { if (j < set[i - 1]) subset[i][j] = subset[i - 1][j]; if (j >= set[i - 1]) subset[i][j] = subset[i - 1][j] || subset[i - 1][j - set[i - 1]]; } } return subset[n][sum]; } int dfs(int id, int parent) { if (child_nodes[id] != -1) { return child_nodes[id]; } if (graph[id].size() == 0) { return child_nodes[id] = 1; } int temp = 0; for (long long i = 0; i < graph[id].size(); i++) { if (graph[id][i] != parent) { temp += dfs(graph[id][i], id); } } return child_nodes[id] = temp + 1; } void solve(int id, int parent) { insert_into_answer(child_nodes[id] - 1, total_nodes - child_nodes[id]); vector<int> childs_to_adjacent; for (long long i = 0; i < graph[id].size(); i++) { if (graph[id][i] != parent) { childs_to_adjacent.push_back(child_nodes[graph[id][i]]); } } isSubsetSum(childs_to_adjacent, childs_to_adjacent.size(), child_nodes[id]); int child_length = childs_to_adjacent.size(); for (long long i = 1; i < child_nodes[id]; i++) { if (subset[child_length][i]) { insert_into_answer(i, total_nodes - i - 1); } } for (long long i = 0; i < graph[id].size(); i++) { if (graph[id][i] != parent) { solve(graph[id][i], id); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> total_nodes; int x, y; for (long long i = 1; i < total_nodes; i++) { cin >> x >> y; graph[x - 1].push_back(y - 1); graph[y - 1].push_back(x - 1); } int a = dfs(0, -1); solve(0, -1); cout << ans_pairs.size() << endl; for (auto it : ans_pairs) { cout << it.first << << it.second << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; int e = max(c, d); if (e > 2 * c || e > 2 * d || e >= b) { cout << -1; return 0; } cout << 2 * a << endl << 2 * b << endl << e; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string str; int n; cin >> n; cin.ignore(); getline(cin, str); int l = 0, r = n - 1; while (l < n && str[l] == 0 ) { l++; } while (r >= 0 && str[r] == 1 ) { r--; } if (l >= r) { cout << str << endl; } else { cout << str.substr(0, l) << 0 << str.substr(r + 1, n) << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k, l; cin >> n >> k; vector<int> barrel; for (int i = 0; i < n; i++) { cin >> l; barrel.push_back(l); } sort(barrel.begin(), barrel.end()); long long int resp = 0; k++; while (k--) { resp += barrel.back(); barrel.pop_back(); } cout << resp << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; char buf[100000]; vector<pair<int, string> > vp; int b[maxn], n, m; pair<int, string> me; int getL() { int tx = 0, ret = 1; if (m == n) { me.first -= b[0]; tx = 1; } for (int i = 0; i < (int)vp.size(); i++) { if (vp[i] < me) { ret++; continue; } while (tx < m) { pair<int, string> tmp = vp[i]; tmp.first -= b[tx]; tx++; if (tmp < me) { ret++; break; } } } if (m == n) me.first += b[0]; return ret; } int getH() { me.first -= b[m - 1]; int tx = m - 2, ret = 1; vector<pair<int, string> > vp2; for (int i = 0; i < (int)vp.size(); i++) { if (vp[i] < me) { if (tx >= 0) tx--; ret++; } else vp2.push_back(vp[i]); } for (int i = (int)vp2.size() - 1; i >= 0; i--) { while (tx >= 0) { pair<int, string> tmp = vp2[i]; tmp.first -= b[tx]; tx--; if (tmp < me) { ret++; } else break; } } while (tx >= 0) { ret++; tx--; } me.first += b[m - 1]; return ret; } int main() { while (scanf( %d , &n) != EOF) { vp.clear(); for (int i = 0; i < n; i++) { int tmp; scanf( %s%d , buf, &tmp); vp.push_back(make_pair(-tmp, string(buf))); } scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %d , &b[i]); } sort(b, b + m); scanf( %s , buf); string s(buf); for (int i = 0; i < (int)vp.size(); i++) { if (vp[i].second == s) { me = vp[i]; swap(vp[i], vp[vp.size() - 1]); vp.pop_back(); break; } } sort(vp.begin(), vp.end()); printf( %d %d n , getH(), getL()); } return 0; }
#include <bits/stdc++.h> using namespace std; struct edge { int x, y, d, r; bool operator<(edge const &T) const { return d < T.d; } }; int n, t, ed, x, y; int v[100005], b[100005], p[100005], s[100005], l[100005], qd[100005 + 100005], qn[100005 + 100005], qr[100005 + 100005]; long long int sum, mx, sz[100005], res[100005]; edge a[100005]; void bd(int x, int y, int r) { qd[++ed] = y, qn[ed] = l[x], qr[ed] = r, l[x] = ed; } void precal(int x) { sum += s[x]; v[x] = 1; for (int i = l[x]; i; i = qn[i]) if (!v[qd[i]]) precal(qd[i]); } void dfs(int x, int y) { sz[x] = s[x]; for (int i = l[x]; i; i = qn[i]) { if (qd[i] == y) continue; dfs(qd[i], x); res[qr[i]] = (sum - sz[qd[i]]) * sz[qd[i]]; sz[x] += sz[qd[i]]; } } int find(int x) { return x == p[x] ? x : p[x] = find(p[x]); } int main() { scanf( %d , &n); for (int i = (0); i < (n - 1); i++) scanf( %d%d%d , &a[i].x, &a[i].y, &a[i].d), a[i].r = i + 1; for (int i = (1); i <= (n); i++) p[i] = i, s[i] = 1; sort(a, a + n - 1); for (int i = 0, j = 0; i < n - 1; i = j) { ed = t = 0; while (j < n - 1 && a[i].d == a[j].d) { b[t++] = x = find(a[j].x); b[t++] = y = find(a[j].y); bd(x, y, a[j].r), bd(y, x, a[j].r); j++; } sort(b, b + t); t = unique(b, b + t) - b; for (int k = (0); k < (t); k++) v[b[k]] = 0; for (int k = (0); k < (t); k++) { if (v[b[k]]) continue; sum = 0; precal(b[k]); dfs(b[k], -1); } for (int k = (0); k < (t); k++) l[b[k]] = 0; for (int k = i; k < j; k++) { x = find(a[k].x), y = find(a[k].y); p[x] = y; s[y] += s[x]; } } mx = 0; for (int i = (1); i <= (n - 1); i++) mx = max(mx, res[i]); sum = 0; for (int i = (1); i <= (n - 1); i++) sum += res[i] == mx; printf( %I64d %I64d n , mx << 1, sum); for (int i = (1); i <= (n - 1); i++) if (res[i] == mx) printf( %d , i); puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > v; int promena[3002]; long long d[3001], s[3002][3002], pom; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int j, n, i, x, p; cin >> n; for (i = 0; i < n; i++) { cin >> x >> p; v.push_back(make_pair(x, p)); } sort(v.begin(), v.end()); d[n - 1] = v[n - 1].second; for (i = 0; i < n - 1; i++) for (j = i + 1; j < n; j++) s[i][j] = s[i][j - 1] + (long long)v[j].first - v[i].first; for (i = n - 2; i >= 0; i--) { for (j = i; j < n; j++) { pom = d[j + 1] + s[i][j] + (long long)v[i].second; if (promena[i] == 0) { d[i] = pom; promena[i] = 1; } else { if (d[i] > pom) d[i] = pom; } } } cout << d[0]; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; long long int a[n]; map<long long int, long long int> mp; for (long long int i = 0; i < n; i++) { cin >> a[i]; mp[a[i]] = i; } long long int prev = mp[1]; long long int mx = 1; for (long long int i = 2; i <= n; i++) { if (mp[i] > mp[i - 1]) { long long int j = i; long long int cnt = 1; while (mp[j] > mp[j - 1]) { cnt++; j++; } mx = max(mx, cnt); i = j - 1; } } long long int ans = n - mx; cout << ans << n ; cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; }
#include <bits/stdc++.h> using namespace std; bool SR(int &_x) { return scanf( %d , &_x) == 1; } bool SR(long long &_x) { return scanf( %lld , &_x) == 1; } bool SR(double &_x) { return scanf( %lf , &_x) == 1; } bool SR(char *_s) { return scanf( %s , _s) == 1; } bool RI() { return true; } template <typename I, typename... T> bool RI(I &_x, T &..._tail) { return SR(_x) && RI(_tail...); } void SP(const int _x) { printf( %d , _x); } void SP(const long long _x) { printf( %lld , _x); } void SP(const double _x) { printf( %.16lf , _x); } void SP(const char *s) { printf( %s , s); } void PL() { puts( ); } template <typename I, typename... T> void PL(const I _x, const T... _tail) { SP(_x); if (sizeof...(_tail)) putchar( ); PL(_tail...); } const int maxn = 55; struct Solver { int wid, hei; char mp[maxn][maxn]; void rot(int x, int y) { if (mp[x][y] == L ) { for (int i : {x, x + 1}) for (int j : {y, y + 1}) mp[i][j] = UD [i - x]; } else { for (int i : {x, x + 1}) for (int j : {y, y + 1}) mp[i][j] = LR [j - y]; } } vector<pair<int, int> > solve() { assert(wid % 2 == 0); vector<pair<int, int> > ret; for (int i = 0; i < int(hei); i++) for (int j = 0; j < wid; j += 2) { vector<pair<int, int> > cur; int x = i, y = j, f = 0; while (1) { if ((f == 0 && mp[x][y] == L ) || (f == 1 && mp[x][y] == U )) break; cur.push_back({x, y}); if (f == 0) y++; else x++; f ^= 1; } reverse((cur).begin(), (cur).end()); for (auto p : cur) rot(p.first, p.second); ret.insert(ret.end(), (cur).begin(), (cur).end()); } return ret; } } sol0, sol1; int n, m; char f0[maxn][maxn], f1[maxn][maxn]; void read() { RI(n, m); for (int i = 0; i < int(n); i++) RI(f0[i]); for (int i = 0; i < int(n); i++) RI(f1[i]); } bool flip; void build() { if (m % 2) { flip = 1; auto rev = [&](char c) { if (c == L ) return U ; if (c == R ) return D ; if (c == U ) return L ; if (c == D ) return R ; assert(0); }; { sol0.hei = m; sol0.wid = n; for (int i = 0; i < int(n); i++) for (int j = 0; j < int(m); j++) sol0.mp[j][i] = rev(f0[i][j]); sol1.hei = m; sol1.wid = n; for (int i = 0; i < int(n); i++) for (int j = 0; j < int(m); j++) sol1.mp[j][i] = rev(f1[i][j]); } } else { sol0.hei = n; sol0.wid = m; for (int i = 0; i < int(n); i++) for (int j = 0; j < int(m); j++) sol0.mp[i][j] = f0[i][j]; sol1.hei = n; sol1.wid = m; for (int i = 0; i < int(n); i++) for (int j = 0; j < int(m); j++) sol1.mp[i][j] = f1[i][j]; } } void sol() { auto res0 = sol0.solve(), res1 = sol1.solve(); reverse((res1).begin(), (res1).end()); res0.insert(res0.end(), (res1).begin(), (res1).end()); if (flip) for (auto &p : res0) swap(p.first, p.second); PL(((int)(res0).size())); for (auto p : res0) PL(p.first + 1, p.second + 1); } int main() { read(); build(); sol(); return 0; }
#include <bits/stdc++.h> using namespace std; inline int setBit(int N, int pos) { return N = N | (1 << pos); } inline int resetBit(int N, int pos) { return N = N & ~(1 << pos); } inline bool checkBit(int N, int pos) { return (bool)(N & (1 << pos)); } int A[400000 + 10]; vector<int> nxt[400000 + 10]; int idx[400000 + 10]; struct data { int id, p; }; bool operator<(data a, data b) { return a.p < b.p; } priority_queue<data> Q; int holding[400000 + 10]; void validate(int i) { while (Q.size() && Q.top().p <= i) Q.pop(); } int main() { int n, k; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &A[i]), nxt[A[i]].push_back(i); for (int i = 1; i <= n; i++) nxt[i].push_back(n + 1), idx[i] = 1; int ans = 0; int have = 0; for (int i = 1; i <= n; i++) { if (holding[A[i]] == true) { Q.push({A[i], nxt[A[i]][idx[A[i]]]}); idx[A[i]]++; } else { if (have < k) { have++; ans++; Q.push({A[i], nxt[A[i]][idx[A[i]]]}); idx[A[i]]++; holding[A[i]] = true; } else { validate(i); ans++; holding[Q.top().id] = false; Q.pop(); Q.push({A[i], nxt[A[i]][idx[A[i]]]}); holding[A[i]] = true; idx[A[i]]++; } } } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 100 + 3; int n, m, k, ns[MAX]; long long dp[MAX][MAX][MAX], cs[MAX][MAX]; long long solve(int cur = 0, int pre = 0, int rem = k) { if (cur == n && rem == 0) return 0; if (rem < 0 || (cur == n && rem != 0)) return 1e18; long long &ret = dp[cur][pre][rem]; if (ret != -1) return ret; if (ns[cur] == 0) { ret = 1e18; for (int i = 1; i <= m; i++) ret = min(ret, solve(cur + 1, i, rem - (pre != i)) + cs[cur][i - 1]); } else { if (ns[cur] == pre) ret = solve(cur + 1, pre, rem); else ret = solve(cur + 1, ns[cur], rem - 1); } return ret; } int main() { scanf( %d%d%d , &n, &m, &k); memset(dp, -1, sizeof(dp)); for (int i = 0; i < n; i++) { scanf( %d , &ns[i]); } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , &cs[i][j]); } } long long ans = solve(); if (ans == 1e18) printf( -1 ); else printf( %lld , ans); return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, i, count = 0; vector<long long int> v; string s1, s2, s3, reverses1, reverses2, reverses3; cin >> s1 >> s2 >> s3; reverses1 = s1; reverses2 = s2; reverses3 = s3; reverse(s1.begin(), s1.end()); reverse(s2.begin(), s2.end()); reverse(s3.begin(), s3.end()); if (reverses1 == s3 && reverses2 == s2 && reverses3 == s1) cout << YES << n ; else cout << NO << n ; } void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } int main() { fast(); int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 3e18 + 100; const int MOD = 1e9 + 7; const int N = 100; int32_t main() { cin.sync_with_stdio(0); cin.tie(0); cin.exceptions(cin.failbit); int n; cin >> n; set<int> s, tot; vector<int> a(n + 5, 0), cnt(n + 5, 0), last(n + 5); vector<bool> ok(n + 4, true); for (int i = 1; i <= n; ++i) { s.insert(i); } for (int i = 1; i <= n; ++i) { cin >> a[i]; cnt[a[i]]++; tot.insert(a[i]); if (s.find(a[i]) != s.end()) { s.erase(a[i]); } } cout << n - tot.size() << endl; for (int i = 1; i <= n; ++i) { if (cnt[a[i]] == 1) continue; if (ok[a[i]] and *s.begin() > a[i]) { ok[a[i]] = false; } else { cnt[a[i]]--; a[i] = *s.begin(); s.erase(s.begin()); } } for (int i = 1; i <= n; ++i) { cout << a[i] << ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, i, cnt; string s; map<int, pair<int, int> > mapp; cin >> n; cin >> s; cnt = 0; int maxm = 0; for (i = 0; i < n; i++) { if (s[i] == 0 ) cnt--; else cnt++; if (mapp.find(cnt) == mapp.end()) { mapp[cnt].first = i; mapp[cnt].second = i; } else { mapp[cnt].second = i; int len = mapp[cnt].second - mapp[cnt].first; if (len > maxm) maxm = len; } } if (mapp.find(0) != mapp.end()) maxm = max(maxm, mapp[0].second + 1); cout << maxm << endl; }
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const vector<int> mods = {998244353, 1000000007, 1000000009}; const long long inf = 3e18; const double pi = acos(-1.0); const double eps = 0.0000001; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <class... K> using umap = unordered_map<K...>; template <class... K> using uset = unordered_set<K...>; const int N = 1000100; int n, l[N]; vector<vector<int> > a, ord; string s; umap<int, long long> dp; long long res; void build(int x) { vector<int> cur = {}; vector<int> bk; auto ad = [&](vector<int>& to) { while (((int)(cur).size())) { to.push_back(cur.back()); cur.pop_back(); } }; for (long long i = (0); i < (l[x] - 1); ++i) { cur.push_back(i); if (a[x][i] < a[x][i + 1]) ad(ord[x]); if (a[x][i] > a[x][i + 1]) ad(bk); } cur.push_back(l[x] - 1); ad(ord[x]); for (int i = ((int)(bk).size()) - 1; i >= 0; i--) ord[x].push_back(bk[i]); } int p(int i, int si) { return i + (i >= si); } bool gt(int i, int si, int j, int sj) { int pp = 0; while (p(pp, si) < l[i] && p(pp, sj) < l[j]) { int ppi = p(pp, si), ppj = p(pp, sj); if (a[i][ppi] < a[j][ppj]) return 0; if (a[i][ppi] > a[j][ppj]) return 1; pp++; } long long il = l[i] - (si != l[i] - 1); long long jl = l[j] - (sj != l[j] - 1); if (il > jl) return 1; else return 0; } int main() { cin.sync_with_stdio(0); cin.tie(0); cout.precision(13); cin >> n; a.resize(n + 1); ord.resize(n + 1); for (long long i = (0); i < (n); ++i) { cin >> s; l[i] = s.length() + 1; for (long long j = (0); j < (l[i] - 1); ++j) a[i].push_back(s[j] - a ); a[i].push_back(-1); } a[n] = {27, -1}; l[n] = 2; for (long long i = (0); i < (n + 1); ++i) build(i); dp[0] = 1; dp[1] = 0; for (int i = n; i >= 1; i--) { umap<int, long long> nxdp; int j = i - 1; int pi = 0, pj = 0; long long pre = 0; while (pi < l[i] || pj < l[j]) { if (pi >= l[i] || pj < l[j] && gt(j, ord[j][pj], i, ord[i][pi])) nxdp[pj++] = pre; else pre = (pre + dp[pi++]) % mod; } dp = move(nxdp); } for (auto& d_ : dp) res = (res + d_.second) % mod; cout << res << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2200000; int chk[N]; int main() { ios_base::sync_with_stdio(0); int cnt = 0, n, m; cin >> n >> m; for (int i = 0; i < n; i++) if (!chk[i]) { for (int j = i; (j < n && chk[j] < 2) || (j >= n && chk[n + n - 2 - j] < 2); j = (j + m + m - 2) % (n + n - 2)) { if (j < n) chk[j]++; else chk[n + n - 2 - j]++; } cnt++; } cout << cnt << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int a[55][55]; const int MAX = 1e3 + 5; const int INF = 0x3f3f3f3f; int color; int A[MAX][MAX]; int A1[MAX][MAX], A2[MAX][MAX]; int N; int DX[2] = {0, 1}, DY[2] = {1, 0}; int NOW1[4], NOW2[4]; int X1, Y1, X2, Y2; bool FLAG = false; bool VIS[MAX][MAX]; void dfs(int x, int y, int count) { if (FLAG) return; if (count == 4) { if (NOW1[1] == NOW1[2] && NOW1[0] == NOW1[3]) { if (NOW2[1] != NOW2[2] || NOW2[0] != NOW2[3]) { FLAG = true; X2 = x, Y2 = y; color = 1; return; } } if (NOW2[1] == NOW2[2] && NOW2[0] == NOW2[3]) { if (NOW1[1] != NOW1[2] || NOW1[0] != NOW1[3]) { FLAG = true; X2 = x, Y2 = y; color = 2; return; } } return; } for (int i = 0; i < 2; ++i) { int numX = x + DX[i]; int numY = y + DY[i]; if (numX >= 1 && numX <= N && numY >= 1 && numY <= N && !VIS[numX][numY]) { NOW1[count] = A1[numX][numY]; NOW2[count] = A2[numX][numY]; VIS[numX][numY] = true; dfs(numX, numY, count + 1); VIS[numX][numY] = false; } } } void solve() { for (int i = 1; i <= N; ++i) { for (int j = 1; j <= N; ++j) { A[i][j] = a[i][j]; if ((i + j) & 1) { if (A[i][j] == 0) A1[i][j] = 1, A2[i][j] = 0; else A1[i][j] = 0, A2[i][j] = 1; } else A1[i][j] = A2[i][j] = A[i][j]; } } for (int i = 1; i <= N; ++i) { for (int j = 1; j <= N; ++j) { NOW1[0] = A1[i][j]; NOW2[0] = A2[i][j]; VIS[i][j] = true; dfs(i, j, 1); VIS[i][j] = false; if (FLAG) { X1 = i, Y1 = j; return; } } } } int main() { int n, t; scanf( %d , &n); N = n; a[1][1] = 1; a[1][2] = 0; a[n][n] = 0; printf( ? %d %d %d %d n , 1, 2, 2, 3); fflush(stdout); scanf( %d , &t); if (t == 1) a[2][3] = a[1][2]; else a[2][3] = a[1][2] ^ 1; printf( ? %d %d %d %d n , 2, 1, 2, 3); fflush(stdout); scanf( %d , &t); if (t == 1) a[2][1] = a[2][3]; else a[2][1] = a[2][3] ^ 1; for (int i = 3; i <= n; i++) { printf( ? %d %d %d %d n , i - 2, 1, i, 1); fflush(stdout); scanf( %d , &t); if (t == 1) a[i][1] = a[i - 2][1]; else a[i][1] = a[i - 2][1] ^ 1; printf( ? %d %d %d %d n , 1, i - 2, 1, i); fflush(stdout); scanf( %d , &t); if (t == 1) a[1][i] = a[1][i - 2]; else a[1][i] = a[1][i - 2] ^ 1; } for (int i = 2; i <= n; i++) { for (int j = 2; j <= n; j++) { if (i == j && j == n) continue; if (i == 2 && j == 3) continue; printf( ? %d %d %d %d n , i - 1, j - 1, i, j); fflush(stdout); scanf( %d , &t); if (t == 1) a[i][j] = a[i - 1][j - 1]; else a[i][j] = a[i - 1][j - 1] ^ 1; } } solve(); printf( ? %d %d %d %d n , X1, Y1, X2, Y2); fflush(stdout); scanf( %d , &t); printf( ! n ); if (t == 1) { if (color == 1) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if ((i + j) % 2 == 1) printf( %d , a[i][j] ^ 1); else printf( %d , a[i][j]); } printf( n ); } } else { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) printf( %d , a[i][j]); printf( n ); } } } else { if (color == 2) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if ((i + j) % 2 == 1) printf( %d , a[i][j] ^ 1); else printf( %d , a[i][j]); } printf( n ); } } else { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) printf( %d , a[i][j]); printf( n ); } } } }
#include <bits/stdc++.h> int main() { int n, i, b; while (scanf( %d , &n) != EOF) { int j = 0, str[10001] = {0}, total = 0; for (i = 0; i < n; i++) { scanf( %d , &b); if (str[b] == 0) ++total; ++str[b]; if (str[b] > j) j = str[b]; } printf( %d %d n , j, total); } return 0; }
#include <bits/stdc++.h> using namespace std; double eps = 1e-6; double pi = acos(0.0) * 2; double dinf = 1e250; long long INF = static_cast<long long>(2e18); long long inf = static_cast<long long>(1e9 + 7); long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <class T> void OUT(T a) { cout << a; exit(0); } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long extgcd(long long a, long long b, long long& x, long long& y) { if (a == 0) { x = 0; y = 1; return b; } long long x1, y1; long long d = extgcd(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; for (long long i = 0; i < n; i++) { long long x, y, k; cin >> x >> y >> k; if (x < 0) x = -x; if (y < 0) y = -y; if (x < y) swap(x, y); if (x > k) cout << -1 << endl; else { if ((x & 1) != (y & 1)) { k -= 1; x -= 1; } else if ((x & 1) != (k & 1)) { x -= 1; y -= 1; k -= 2; } cout << k << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n, x, y, a, b, c, t, q; string s; while (cin >> n >> q) { if ((n / q) % 2 == 0) { cout << NO << endl; } else cout << YES << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[100001], l = 1; for (int i = 1; i <= n; i++) { int c, t; cin >> c >> t; int x = c * t; a[l] = c * t; l++; } int d = 1, s = 0; for (int i = 0; i < m; i++) { int k; cin >> k; if (s + a[d] >= k) { cout << d << endl; } else { while (1) { s += a[d]; d++; if (s + a[d] >= k) { cout << d << endl; break; } } } } return 0; }
#include <bits/stdc++.h> using namespace std; void OJ() {} long long n, m, x, k, y; long long a[200000 + 5], b[200000 + 5]; void imp() { cout << -1 << n , exit(0); } long long remove(long long start, long long end) { if (start > end) return 0; long long sz = end - start + 1; long long maxneb = max(a[start - 1], a[end + 1]); long long m = *max_element(a + start, a + end + 1); long long a1 = (sz / k) * x + (sz % k) * y; if (maxneb > m) return min(a1, y * sz); if (sz < k) imp(); return min(a1, (sz - k) * y + x); } void solve() { cin >> n >> m >> x >> k >> y; for (long long i = 1; i <= n; ++i) cin >> a[i]; for (long long i = 1; i <= m; ++i) cin >> b[i]; long long ans = 0; long long j = 1; for (long long i = 1; i <= m; ++i) { long long start = j; while (j <= n && a[j] != b[i]) j++; if (j > n) imp(); ans += remove(start, j - 1); j++; } ans += remove(j, n); cout << ans << n ; } signed main() { OJ(); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } const int N = 100005; void solve() { long long n; cin >> n; long long ans = 1; for (long long i = 2; i <= n; i++) { ans = ans + 4 * (i - 1); } cout << ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { solve(); } cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; }
#include <bits/stdc++.h> using namespace std; struct ton { vector<pair<long long, long long> > v[1919810 + 3]; long long& operator()(long long a, int b, int c, int d) { a = ((a * 4000ll + b) * 4000ll + c) * 3ll + (d == 1); int k = a % 1919810; for (auto u = v[k].begin(); u != v[k].end(); u++) if (u->first == a) return u->second; v[k].push_back(make_pair(a, -1e17)); return v[k].back().second; } } f; long long s[100010]; long long F(int l, int r, int k, int p) { if (r - l + 1 < k) return 0; if (r - l + 1 == k) return p * (s[r] - s[l - 1]); long long& u = f(l, r, k, p); if (u != -1e17) return u; if (p == -1) u = min(F(l, r - k, k, 1) - (s[r] - s[r - k]), F(l, r - k - 1, k + 1, 1) - (s[r] - s[r - k - 1])); else u = max(F(l + k, r, k, -1) + (s[l + k - 1] - s[l - 1]), F(l + k + 1, r, k + 1, -1) + (s[l + k] - s[l - 1])); return u; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %lld , &s[i]), s[i] += s[i - 1]; printf( %lld n , F(1, n, 1, 1)); return 0; }
#include <bits/stdc++.h> using namespace std; char dirs[100001]; int todo[4]; int main() { int n, fx, fy, tx, ty; string wind; cin >> n >> fx >> fy >> tx >> ty >> wind; memcpy(dirs, wind.c_str(), n); memset(todo, 0, sizeof(todo)); if (fx < tx) todo[0] = tx - fx; if (fy < ty) todo[3] = ty - fy; if (fx > tx) todo[2] = fx - tx; if (fy > ty) todo[1] = fy - ty; for (int i = 0; i < n; i++) { switch (dirs[i]) { case E : if (todo[0]) todo[0]--; break; case S : if (todo[1]) todo[1]--; break; case W : if (todo[2]) todo[2]--; break; case N : if (todo[3]) todo[3]--; break; } if (todo[0] == 0 && todo[1] == 0 && todo[2] == 0 && todo[3] == 0) { cout << i + 1 << endl; return 0; } } cout << -1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, n, p; cin >> t; for (; t > 0; t--) { cin >> n >> p; int br = 0; for (int r = 1; r <= n; r++) { for (int i = 1; i <= n; i++) { cout << i << << (i + r - 1) % n + 1 << endl; br++; if (br == 2 * n + p) goto st; } } st:; } return 0; }
#include <bits/stdc++.h> using namespace std; long long int div_floor(const long long int &a, const long long int &b) { return a / b - (((a ^ b) < 0) and a % b); } long long int div_ceil(const long long int &a, const long long int &b) { return a / b + (((a ^ b) >= 0) and a % b); } long long int diff(long long int a, long long int cnt) { long long int rem = a % cnt; return a * a - ((a / cnt + 1) * (a / cnt + 1) * rem + (a / cnt) * (a / cnt) * (cnt - rem)); } void solve() { long long int n, k; cin >> n >> k; long long int sum = 0; multiset<pair<long long int, pair<long long int, long long int> > > mst; vector<long long int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i] * a[i]; mst.insert({diff(a[i], 2), {a[i], 2}}); } while (n++ < k) { auto it = mst.end(); it--; auto el = *it; mst.erase(it); sum -= el.first; long long int x = el.second.first, ct = el.second.second; mst.insert({diff(x, ct + 1) - diff(x, ct), {x, ct + 1}}); } cout << sum << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; int n; int a[111]; int vv(int k) { int i, j; j = 0; for (i = 1; i < k; i++) if (a[i] == 0) j++; for (i = k; i <= n; i++) if (a[i] == 1) j++; return j; } int main() { cin >> n; int i, j, k; for (i = 1; i <= n; i++) cin >> a[i]; a[n + 1] = 1; int d = 1; for (i = 0; i <= n + 1; i++) { d = max(vv(i), d); } cout << d; }
#include <bits/stdc++.h> using namespace std; int n; long long a[30]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long now = a[n - 1]; long long ans = 0; for (int i = n - 1; i >= 0; i--) { now = min(now, a[i]); ans += now; now--; if (now < 0) break; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; string s; int num_e = 1e9 + 10, num_m, ans, w, q; string answer; void read_input() { cin >> s; } void solve() { for (int i = 0; i < s.size(); i++) { if (s[i] == e ) num_e = i; if (s[i] == . ) num_m = i; } string s2 = ; for (int i = 0; i < num_e; i++) if (s[i] != . ) s2 += s[i]; for (int i = num_e + 1; i < s.size(); i++) { int q = s[i] - 0 ; w = w * 10 + q; } w -= (num_e - num_m - 1); if (w >= 0) { answer += s2; for (int i = 0; i < w; i++) answer += 0 ; } else { for (int i = 0; i < s2.size(); i++) { if (s2.size() - i == -w) answer += . ; answer += s2[i]; } } } void write_output() { bool check = false; for (int i = 0; i < answer.size(); i++) if (answer[i] != . && answer[i] != 0 ) check = true; if (!check) cout << 0; else { int start; for (int i = 0; i < answer.size(); i++) { if (answer[i] == . ) { start = i - 1; break; } if (answer[i] != 0 ) { start = i; break; } } int num_m = -1; for (int i = 0; i < answer.size(); i++) if (answer[i] == . ) num_m = i; check = false; for (int i = num_m + 1; i < answer.size(); i++) if (answer[i] != 0 ) check = true; if (check || num_m == -1) for (int i = start; i < answer.size(); i++) cout << answer[i]; else for (int i = start; i < num_m; i++) cout << answer[i]; } } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); read_input(), solve(), write_output(); }
#include <bits/stdc++.h> using namespace std; long long n, a, b; long long arr[1000002]; long long dp[1000002][3]; set<int> prime; int main() { ios::sync_with_stdio(false); cin >> n >> a >> b; for (int i = 0; i < n; ++i) cin >> arr[i]; for (int i = 0; i < 2; ++i) { for (int j = 0; j < 3; ++j) { int k = arr[i * (n - 1)] + j - 1; for (int j = 2; j < 1e9; ++j) { if (j * j > k) break; while (k % j == 0) { prime.insert(j); k /= j; } } if (k != 1 && k != 0) prime.insert(k); } } long long ans = 1e18; for (int p : prime) { for (int i = 0; i < n + 1; ++i) for (int j = 0; j < 3; ++j) dp[i][j] = 1e18; dp[0][0] = 0; dp[0][1] = 0; dp[0][2] = 0; for (int i = 0; i < n; ++i) { if (arr[i] % p == 0) { dp[i + 1][0] = min(dp[i + 1][0], dp[i][0]); dp[i + 1][2] = min(dp[i + 1][2], dp[i][2]); } else { if ((arr[i] + 1) % p == 0 || (arr[i] - 1) % p == 0) { dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + b); dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + b); } } dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + a); dp[i + 1][1] = min(dp[i + 1][0], dp[i + 1][1]); dp[i + 1][2] = min(dp[i + 1][2], dp[i + 1][1]); } ans = min(ans, dp[n][2]); } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const bool online_judge = true; const long long inf = 1LL << 60; long long toInt(string s) { long long res; stringstream ss; ss << s; ss >> res; return res; } string toString(long long n) { stringstream ss; ss << n; return ss.str(); } long long dx[3] = {1, 0, -1}; long long dy[3] = {1, 0, -1}; vector<pair<long long, long long> > statue; bool valid(long long x, long long y, long long turn) { if (!(((x) >= (0) && (x) <= (7)) && ((y) >= (0) && (y) <= (7)))) return false; for (long long i = 0; i < ((long long)((statue).size())); i++) { long long sx = statue[i].first + turn; long long sy = statue[i].second; if ((sx == x && sy == y) || (sx + 1 == x && sy == y)) return false; } return true; } bool solve(long long x, long long y, long long turn) { if (turn == 8) return true; for (long long i = 0; i < 3; i++) { for (long long j = 0; j < 3; j++) { long long nx = x + dx[i]; long long ny = y + dy[j]; if (valid(nx, ny, turn) && solve(nx, ny, turn + 1)) { return true; } } } return false; } void run() { statue.clear(); for (long long i = 0; i < 8; i++) { string s; cin >> s; for (long long j = 0; j < 8; j++) { if (s[j] == S ) statue.emplace_back(i, j); } } bool ans = solve(7, 0, 0); if (ans) cout << WIN << endl; else cout << LOSE << endl; } int main(int argc, char *argv[]) { run(); return 0; }
#include <bits/stdc++.h> int const M = 1010000; int const N = 10100; int n; int len[N]; int x[N]; int y[N]; int sq[M]; int perm[N]; double angle[N]; int resx[N]; int resy[N]; void filllens() { std::fill(sq, sq + M, -1); for (int i = 0; i * i < M; ++i) { sq[i * i] = i; } int last = 0; int sum = 0; for (int i = n - 1; i >= 0; --i) { while (x[i] == 0 && y[i] == 0) { len[i] = ++last; x[i] = 0; y[i] = 0; for (int q = 0; q * q <= len[i]; ++q) { if (sq[len[i] - q * q] != -1) { x[i] = q; y[i] = sq[len[i] - q * q]; break; } } } sum += len[i]; } if (sum % 2 == 1) { int xx = 0; int yy = 0; while (xx == 0 && yy == 0) { ++last; for (int q = 0; q * q <= last; ++q) { if (sq[last - q * q] != -1) { xx = q; yy = sq[last - q * q]; break; } } } int i = 0; while (len[i] % 2 == last % 2) ++i; len[i] = last; x[i] = xx; y[i] = yy; for (; i > 0; --i) { std::swap(len[i], len[i - 1]); std::swap(x[i], x[i - 1]); std::swap(y[i], y[i - 1]); } } } void solve() { filllens(); int sumx = 0; int sumy = 0; std::function<int(int, int)> len2 = [](int x, int y) { return x * x + y * y; }; for (int i = 0; i < n; ++i) { int ax = x[i]; int ay = y[i]; for (int it = 0; it < 2; ++it) { for (int px : {-1, 1}) { for (int py : {-1, 1}) { if (len2(sumx + ax, sumy + ay) > len2(sumx + px * x[i], sumy + py * y[i])) { ax = px * x[i]; ay = py * y[i]; } } } std::swap(x[i], y[i]); } x[i] = ax; y[i] = ay; sumx += ax; sumy += ay; } assert(sumx == 0 && sumy == 0); for (int i = 0; i < n; ++i) { perm[i] = i; angle[i] = atan2(x[i], y[i]); } std::sort(perm, perm + n, [](int i, int j) { return angle[i] > angle[j]; }); sumx = 0; sumy = 0; for (int i = 0; i < n; ++i) { resx[i] = sumx; resy[i] = sumy; sumx += x[perm[i]]; sumy += y[perm[i]]; } } void out() { puts( YES ); for (int i = 0; i < n; ++i) { printf( %d %d n , resx[i], resy[i]); } } int main() { scanf( %d , &n); solve(); out(); }
#include <bits/stdc++.h> using namespace std; int _; long long a1, a2, b1, b2, c1, c2; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> a1 >> a2 >> b1 >> b2 >> c1 >> c2; if ((c2 - b2) * (c1 - a1) == (c2 - a2) * (c1 - b1)) { cout << No ; } else if ((a1 - b1) * (a1 - b1) + (a2 - b2) * (a2 - b2) == (b1 - c1) * (b1 - c1) + (b2 - c2) * (b2 - c2)) { cout << Yes ; } else cout << No ; }
#include <bits/stdc++.h> using namespace std; const int oo = ~0u >> 1; int n, m, a, ans; int b[100015], p[100015]; bool check(int x) { int sum = 0; ans = 0; for (int i = 0; i < x; i++) { sum += max(p[x - i - 1] - b[i], 0), ans += p[x - i - 1]; if (sum > a) break; } if (sum <= a) return true; return false; } int main() { scanf( %d %d %d , &n, &m, &a); for (int i = 0; i < n; i++) scanf( %d , &b[i]); for (int i = 0; i < m; i++) scanf( %d , &p[i]); sort(b, b + n, greater<int>()); sort(p, p + m); int l = 0, r = min(n, m), res = 0, anser = 0; while (l <= r) { int mid = l + (r - l) / 2; if (check(mid)) { res = mid, anser = ans; l = mid + 1; } else r = mid - 1; } printf( %d %d n , res, max(anser - a, 0)); return 0; }
#if !defined(ONLINE_JUDGE) #include prettyprint.hpp #include debug.h #else #include <bits/stdc++.h> using namespace std; #define deb(...) 1729 #define dbg(...) 29 #define cer(x) 13 #endif const bool testcase = 1; typedef long long int ll; const ll mod1 = 1000000007; const ll mod2 = 998244353; #define fast ios_base::sync_with_stdio(0);cin.tie(NULL) #define test int T_T = 1; if(testcase){cin>>T_T;}while(T_T--) #define all(ve) ve.begin(),ve.end() const ll N = 1e7 + 7; std::vector<ll> spf, prime; std::vector<bool> isp; void sieve(ll MAXN) { spf.resize(MAXN); spf[1] = 1; for (int i=2; i<MAXN; i++) spf[i] = i; for (int i=4; i<MAXN; i+=2) spf[i] = 2; for (int i=3; i*i<MAXN; i++) { if (spf[i] == i) { for (int j=i*i; j<MAXN; j+=i) { if (spf[j]==j) spf[j] = i; } } } } void linearSieve(ll n) { spf.resize(n); isp.resize(n,true); isp[0] = isp[1] = 0; isp[2] = 1; for (int i = 2; i <= n; ++i) { if(isp[i]) { prime.push_back(i); spf[i] = i; } for (int j = 0; j < prime.size() && prime[j] <= spf[i] && prime[j] * i <= N; ++j) { isp[i*prime[j]] = 0; spf[i*prime[j]] = prime[j]; } } } map<ll,ll> getFactor(ll x) { map<ll,ll> ret; while (x != 1) { ret[spf[x]]++; x = x / spf[x]; } return ret; } // SOLVE void solve() { // cout << N << n ; // dbg(spf); ll n, k; cin >> n >> k; std::vector<ll> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; // dbg(a[i]); map<ll,ll> pf = getFactor(a[i]); // dbg(pf); ll cur = 1; for(auto [u, v]: pf) { if(v & 1) { cur = cur * u; } } a[i] = cur; } set<ll> st; ll ans = 0; for (int i = 0; i < n; ++i) { if(st.find(a[i]) != st.end()) { ans++; st.clear(); } st.insert(a[i]); // while(!st.count()) } if(st.size()) { ans++; } cout << ans << n ; } //MAIN int main(){ fast; #ifndef ONLINE_JUDGE // for getting input from input.txt freopen( input.txt , r , stdin); // for writing output to output.txt freopen( output.txt , w , stdout); // for debug in error.txt freopen( error.txt , w , stderr); #endif sieve(N); test { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int question, r, speed, st, en, len, did; double lft, rht, middle, dist, p; inline double euclid_dist(double a, double b) { return sqrt(a * a + b * b); } inline bool check(double dis) { p = 1.0 * dis / r; return r * euclid_dist(1 - cos(p), sin(p)) >= len - dis; } int main() { scanf( %d%d%d , &question, &r, &speed); for (register int i = 1; i <= question; i++) { scanf( %d%d , &st, &en); len = en - st; lft = 0; rht = len; did = 0; while (lft < rht && did <= 50) { middle = (lft + rht) / 2.0; switch (check(middle)) { case true: dist = middle; rht = middle; break; case false: lft = middle; break; } did++; } dist /= speed; printf( %0.12lf n , dist); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXP = 18; const int MAXN = 1000001; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int n, p; string cad; int freq[MAXP]; int val[1 << MAXP]; int vis[1 << MAXP]; vector<pair<int, int> > lista[1 << MAXP]; bool mat[MAXP][MAXP]; bool invalid[1 << MAXP]; bool marked[MAXP][MAXP][1 << MAXP]; int mapea(int i) { return cad[i] - a ; } int dfs(int u) { if (vis[u]) return val[u]; vis[u] = 1; int ans = 0; for (int j = 0; j < p; j++) { if (u & 1 << j) continue; int v = u | 1 << j; if (!invalid[v]) ans = max(ans, dfs(v) + freq[j]); } return val[u] = ans; } void compute(int a, int b) { int id = 0, last = -1, mask; while (id < n) { if (mapea(id) == b && last != -1 && mask) { lista[mask].push_back(pair<int, int>(a, b)); mask = 0; last = -1; } if (mapea(id) == a) { last = id; mask = 0; } if (mapea(id) != a && mapea(id) != b) mask |= 1 << mapea(id); id++; } } void bfs(int mask, int a, int b) { queue<int> q; q.push(mask); invalid[mask] = 1; marked[a][b][mask] = 1; while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 0; i < p; i++) { if (i == a || i == b) continue; int v = u | 1 << i; if (!marked[a][b][v]) { invalid[v] = 1; marked[a][b][v] = 1; q.push(v); } } } invalid[(1 << p) - 1] = 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> p; cin >> cad; for (int i = 0; i < n; i++) freq[mapea(i)]++; for (int i = 0; i < p; i++) for (int j = 0; j < p; j++) { cin >> mat[i][j]; if (!mat[i][j]) compute(i, j); } for (int i = 0; i < 1 << p; i++) for (int j = 0; j < lista[i].size(); j++) bfs(i, lista[i][j].first, lista[i][j].second); cout << n - dfs(0) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int ch[101]; int main() { int n, pos; cin >> n; for (int i = 0; i < n / 2; i++) { cin >> ch[i]; } sort(ch, ch + (n / 2)); int black = 0; pos = 1; for (int i = 0; i < n / 2; i++) { black += abs(ch[i] - pos); pos += 2; } int white = 0; pos = 2; for (int i = 0; i < n / 2; i++) { white += abs(ch[i] - pos); pos += 2; } cout << min(white, black) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; char s[200000], c[200000]; cin >> s; int x = k / 2, r = k / 2; if (k == n) { cout << s; return 0; } for (int i = 0, j = 0; i < n; ++i) { if (s[i] == ( ) { if (x > 0) c[j++] = ( ; --x; } else { if (r > 0) c[j++] = ) ; --r; } } cout << c << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long re() { long long x; scanf( %lld , &x); return x; } int main() { long long y1 = re(), x1 = re(), y2 = re(), x2 = re(); long long h = (x2 - x1) / 2 + 1; cout << h * (((y2 - y1 + 1) + 1) / 2) + (h - 1) * ((y2 - y1 + 1) / 2) << endl; }
#include <bits/stdc++.h> using namespace std; using li = long long; int get_num(string s) { istringstream is(s); int x; if ((is >> x) && to_string(x) == s) return x; return -1; } void solve(bool read) { int n; cin >> n; vector<pair<string, int>> s(n); int n_e = 0; for (int i = 0; i < n; i++) { cin >> s[i].first >> s[i].second; if (s[i].second) n_e++; } set<string> non_e, non_t, non_num_e, non_num_t; set<int> e_slots, t_slots; for (int i = 1; i <= n_e; i++) e_slots.insert(i); for (int i = n_e + 1; i <= n; i++) t_slots.insert(i); set<string> all_s; for (int i = 0; i < n; i++) { int num = get_num(s[i].first); all_s.insert(s[i].first); if (s[i].second == 1) { if (num >= 1 && num <= n_e) { e_slots.erase(num); continue; } if (num > n_e && num <= n) { non_e.insert(s[i].first); t_slots.erase(num); } else non_num_e.insert(s[i].first); } else { if (num > n_e && num <= n) { t_slots.erase(num); continue; } if (num >= 1 && num <= n_e) { non_t.insert(s[i].first); e_slots.erase(num); } else non_num_t.insert(s[i].first); } } string rnd = ; while (true) { rnd = ; for (int i = 0; i < 6; i++) rnd += a + rand() % 26; if (!all_s.count(rnd)) break; } vector<string> answer; if (e_slots.empty() && t_slots.empty()) { assert(non_num_t.empty() && non_num_e.empty()); if (!non_t.empty()) { assert(!non_e.empty()); string test = *non_t.begin(); non_t.erase(non_t.begin()); e_slots.insert(get_num(test)); answer.push_back( move + test + + rnd); non_num_t.insert(rnd); } } if (!e_slots.empty() || !t_slots.empty()) { while (!e_slots.empty() || !t_slots.empty()) { if (!e_slots.empty()) { if (!non_e.empty()) { answer.push_back( move + *non_e.begin() + + to_string(*e_slots.begin())); t_slots.insert(get_num(*non_e.begin())); non_e.erase(non_e.begin()); e_slots.erase(e_slots.begin()); continue; } if (!non_num_e.empty()) { answer.push_back( move + *non_num_e.begin() + + to_string(*e_slots.begin())); non_num_e.erase(non_num_e.begin()); e_slots.erase(e_slots.begin()); continue; } } if (!t_slots.empty()) { if (!non_t.empty()) { answer.push_back( move + *non_t.begin() + + to_string(*t_slots.begin())); e_slots.insert(get_num(*non_t.begin())); non_t.erase(non_t.begin()); t_slots.erase(t_slots.begin()); continue; } if (!non_num_t.empty()) { answer.push_back( move + *non_num_t.begin() + + to_string(*t_slots.begin())); non_num_t.erase(non_num_t.begin()); t_slots.erase(t_slots.begin()); continue; } } } assert(non_num_e.empty() && non_num_t.empty() && non_t.empty() && non_e.empty()); } printf( %d n , (int)answer.size()); for (string s : answer) printf( %s n , s.c_str()); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int nt = 1; for (int i = 0; i < nt; i++) solve(true); return 0; }
#include <bits/stdc++.h> using namespace std; long long tot, n, q, u, v, z, a, b, c, p, k; long long dep[200005], f[200005][25], fa[200005], va[200005]; struct edge { long long from, head, nxt, val, go; } e[200005 * 4]; long long find(long long x) { long long o = x; while (x != fa[x]) x = fa[x] = fa[fa[x]]; while (o != x) { long long j = fa[o]; fa[o] = x; o = j; } return x; } void add(long long u, long long v, long long z) { e[++tot].nxt = e[u].head; e[u].head = tot; e[tot].from = u; e[tot].go = v; e[tot].val = z; } void deal_first(long long u, long long father) { dep[u] = dep[father] + 1; for (int i = 0; i <= 19; i++) f[u][i + 1] = f[f[u][i]][i]; for (long long i = e[u].head; i; i = e[i].nxt) { long long v = e[i].go, w = e[i].val; if (v == father) continue; if (w == 1) fa[v] = find(u); va[v] = w; f[v][0] = u; deal_first(v, u); } } long long lca(long long u, long long v) { if (dep[u] < dep[v]) swap(u, v); for (long long i = 17; i >= 0; i--) { if (dep[f[u][i]] >= dep[v]) u = f[u][i]; if (u == v) return u; } for (long long i = 17; i >= 0; i--) { if (f[u][i] != f[v][i]) { u = f[u][i]; v = f[v][i]; } } return f[u][0]; } int main() { scanf( %lld%lld , &n, &q); for (int i = 1; i < n; i++) { scanf( %lld%lld%lld , &u, &v, &z); add(u, v, z); add(v, u, z); } for (int i = 1; i <= n; i++) fa[i] = i; deal_first(1, 0); while (q--) { scanf( %lld , &k); if (k == 1) { scanf( %lld%lld%lld , &a, &b, &c); long long finish = lca(a, b); while (dep[a] > dep[finish] && c) { c = c / va[a]; a = find(f[a][0]); } while (dep[b] > dep[finish] && c) { c = c / va[b]; b = find(f[b][0]); } printf( %lld n , c); } else { scanf( %lld%lld , &p, &c); long long u = e[p << 1].from, v = e[p << 1].go; if (f[u][0] == v) z = u; else z = v; va[z] = c; if (va[z] == 1) fa[z] = find(f[z][0]); } } }
#include <bits/stdc++.h> using namespace std; int main() { int n, k, p, c = 0; cin >> n >> k; vector<int> v; map<int, int> m; for (int i = 1; i <= n; i++) { cin >> p; v.push_back(p); m[p]++; } if (m[k] == 0) v.push_back(k), c++, n++; sort(v.begin(), v.end()); while (1) { int x = (n + 1) / 2; if (v[x - 1] == k) { cout << c; return 0; } else if (v[x - 1] < k) { v.push_back(100000); n++; c++; } else v.push_back(1), n++, c++; sort(v.begin(), v.end()); } }
#include <bits/stdc++.h> using namespace std; int grid[500][500]; int srow[500][500]; int scircle[500][500]; int rmaxcircle[500][500 + 1]; int cmaxcircle[500][500 + 1]; int width[((500 - 1) / 2) + 1]; int separation[2 * ((500 - 1) / 2) + 1]; int skip_whitespace() { int ch; while (true) { ch = getchar_unlocked(); if (ch != && ch != n ) break; } return ch; } template <typename T> T read_unsigned_integer() { T result = (T)0; int ch = skip_whitespace(); while (ch >= 0 && ch <= 9 ) { result = 10 * result + (ch - 0 ); ch = getchar_unlocked(); } return result; } template <typename T> T read_signed_integer() { T result = (T)0; bool flip = false; int ch = skip_whitespace(); if (ch == - ) { flip = true; ch = skip_whitespace(); } while (ch >= 0 && ch <= 9 ) { result = 10 * result + (ch - 0 ); ch = getchar_unlocked(); } return flip ? -result : result; } int partial_row_sum(int row, int left, int right) { return srow[row][right + 1] - srow[row][left]; } long long mul_ll(long long x, long long y) { return x * y; } int solve_problem() { int n, m, r; n = read_unsigned_integer<int>(); m = read_unsigned_integer<int>(); r = read_unsigned_integer<int>(); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) grid[i][j] = read_unsigned_integer<int>(); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) srow[i][j + 1] = srow[i][j] + grid[i][j]; width[0] = r; for (int i = 1; i <= r; i++) { int w = width[i - 1]; while (i * i + w * w > r * r) --w; width[i] = w; } for (int i = 0; i <= 2 * r; i++) { int limit = min(i / 2, r); for (int j = max(0, i - r); j <= limit; j++) { int cand = width[j] + width[i - j] + 1; if (cand > separation[i]) separation[i] = cand; } } for (int i = r; i < n - r; i++) for (int j = r; j < m - r; j++) for (int k = 0; k <= r; k++) { scircle[i][j] += partial_row_sum(i + k, j - width[k], j + width[k]); if (k > 0) scircle[i][j] += partial_row_sum(i - k, j - width[k], j + width[k]); } for (int i = r; i < n - r; i++) for (int j = m - r - 1; j >= r; j--) if (scircle[i][j] <= rmaxcircle[i][j + 1]) { rmaxcircle[i][j] = rmaxcircle[i][j + 1]; cmaxcircle[i][j] = cmaxcircle[i][j + 1]; if (rmaxcircle[i][j] == scircle[i][j]) ++cmaxcircle[i][j]; } else { rmaxcircle[i][j] = scircle[i][j]; cmaxcircle[i][j] = 1; } int result = 0; long long mult = 0; for (int i = r; i < n - r; i++) for (int j = i + 2 * r + 1; j < n - r; j++) { int cand = rmaxcircle[i][r] + rmaxcircle[j][r]; if (cand > result) { result = cand; mult = mul_ll(cmaxcircle[i][r], cmaxcircle[j][r]); } else if (cand == result) { mult += mul_ll(cmaxcircle[i][r], cmaxcircle[j][r]); } } for (int i = r; i < n - r; i++) for (int j = r; j < m - r; j++) { int limit = min(i + 2 * r + 1, n - r); for (int k = max(i - 2 * r, r); k < limit; k++) { int delta = k - i; if (delta < 0) delta = -delta; int l = j + separation[delta]; if (l < m - r) { int cand = scircle[i][j] + rmaxcircle[k][l]; if (cand > result) { result = cand; mult = cmaxcircle[k][l]; } else if (cand == result) { mult += cmaxcircle[k][l]; } } } } cout << result << << mult << endl; return 0; } int main() { solve_problem(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 300010; int n, l[N], t[N]; long long r, dv, res, tcur; vector<long long> ans; void solve(int l, int t) { if (2 * l <= t) { tcur += 2 * l; return; } long long x = t - l; long long tmp = (1ll * l - x + r - 1) / r; res += tmp; dv = x + tmp * r - l; tcur += 2 * x; long long t1 = tcur; while (ans.size() < 1e5 + 10 && tmp) { ans.push_back(t1); tmp--; t1 += r; } tcur += l - x; } int main() { cin >> n >> r; for (int i = 1; i <= n; i++) cin >> l[i]; for (int i = 1; i <= n; i++) cin >> t[i]; res = 0; dv = 0; tcur = 0; for (int i = 1; i <= n; i++) { if (l[i] > t[i]) { res = -1; break; } if (l[i] <= dv) { dv -= l[i]; tcur += l[i]; continue; } l[i] -= dv; t[i] -= dv; tcur += dv; dv = 0; solve(l[i], t[i]); } cout << res << endl; if (res != -1 && ans.size() <= 1e5) { assert(res == ans.size()); for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 228; const int big = 2e9; const int md = 1e9 + 7; struct node { int l, r, s; }; int n, m, a[N], pr[N], root[N], k, tex, jj; node t[N * 40]; bool ok; void build(int v, int l, int r) { if (l == r) return; t[v].l = ++k; t[v].r = ++k; int d = (l + r) >> 1; build(t[v].l, l, d); build(t[v].r, d + 1, r); } void update(int v, int l, int r, int ps, int vl) { if (l == r) { t[++k].s = vl; return; } int d = (l + r) >> 1; if (ps <= d) { update(t[v].l, l, d, ps, vl); t[++k].l = k - 1; t[k].r = t[v].r; } else { update(t[v].r, d + 1, r, ps, vl); t[++k].r = k - 1; t[k].l = t[v].l; } t[k].s = t[t[k].l].s + t[t[k].r].s; } void mod(int v, int l, int r, int ps, int vl) { if (l == r) { t[v].s = vl; return; } int d = (l + r) >> 1; if (ps <= d) mod(t[v].l, l, d, ps, vl); else mod(t[v].r, d + 1, r, ps, vl); t[v].s = t[t[v].l].s + t[t[v].r].s; } int go(int v, int l, int r) { if (l == r) return l; int d = (l + r) >> 1; if (t[t[v].l].s >= tex) return go(t[v].l, l, d); else { tex -= t[t[v].l].s; return go(t[v].r, d + 1, r); } } void nx(int v, int tl, int tr, int l, int r) { if (l > r || ok) return; if (tl == l && tr == r) { if (tex <= t[v].s) { ok = 1; jj = go(v, l, r); } else tex -= t[v].s; return; } int d = (tl + tr) >> 1; nx(t[v].l, tl, d, l, min(r, d)); nx(t[v].r, d + 1, tr, max(l, d + 1), r); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; k = 1; root[n + 1] = 1; build(1, 1, n); for (int i = n; i >= 1; i--) { update(root[i + 1], 1, n, i, 1); if (pr[a[i]] != 0) update(k, 1, n, pr[a[i]], 0); root[i] = k; pr[a[i]] = i; } for (int i = 1; i <= n; i++) { int j = 1, ans = 0; ok = 1; while (j <= n && ok) { ans++; tex = i + 1; ok = 0; nx(root[j], 1, n, j, n); j = jj; } cout << ans << ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int test; cin >> test; while (test--) { int n; cin >> n; for (int i = 2 * n, j = 0; j < n; i += 2, ++j) { cout << i << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5 + 10; int le[MAXN], ri[MAXN]; int a[MAXN]; struct num { int val, pos; }; num data[MAXN]; bool cmp(num a, num b) { return a.val < b.val; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; data[i].val = a[i]; data[i].pos = i; le[i] = i - 1; ri[i] = i + 1; } sort(data, data + n, cmp); long long ans = 0; int low = 0; int hi = n - 1; for (int i = 0; i < n - 2; i++) { int pos = data[i].pos; if (low == pos) { ans += a[pos]; low = ri[pos]; } else if (hi == pos) { ans += a[pos]; hi = le[pos]; } else { ans += min(a[le[pos]], a[ri[pos]]); ri[le[pos]] = ri[pos]; le[ri[pos]] = le[pos]; } } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int SZ = 1000010; const long long INF = 1e18 + 10; const int mod = 1e9 + 7; const long double eps = 1e-12; long long read() { long long n = 0; char a = getchar(); bool flag = 0; while (a > 9 || a < 0 ) { if (a == - ) flag = 1; a = getchar(); } while (a <= 9 && a >= 0 ) { n = n * 10 + a - 0 , a = getchar(); } if (flag) n = -n; return n; } int a[SZ], s[SZ], b[SZ]; int main() { int n = read(), m = read(), sum = 0; for (int i = 1; i <= m; i++) a[i] = read(), b[i] = (sum += a[i]) % n; printf( %d n , (sum + n - 1) / n); b[m] = n; sort(b + 1, b + 1 + m); for (int i = 1; i <= m; i++) s[i] = b[i] - b[i - 1]; for (int i = 1; i <= m; i++) printf( %d , s[i]); puts( ); int k = 1; for (int i = 1, j = 1; i <= m; i++) while (a[i] > 0) { a[i] -= s[j]; printf( %d , i); if (k % m == 0) puts( ); k++; j++, j = (j - 1) % m + 1; } while ((k - 1) % m) k++, printf( 1 ); }
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int INF = (int)1e9; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return a > val ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } inline long long isqrt(long long k) { long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } const int maxn = 100010; const int magic = 320; int fac[maxn]; int rfac[maxn]; int f[maxn]; int p25[maxn]; int binomial(int a, int b) { if (!a || a == b) { return 1; } return mult(fac[b], mult(rfac[a], rfac[b - a])); } void solve() { fac[0] = 1; for (int i = (1); i < (maxn); i++) fac[i] = mult(fac[i - 1], i); for (int i = (0); i < (maxn); i++) rfac[i] = inv(fac[i]); p25[0] = 1; for (int i = (1); i < (maxn); i++) p25[i] = mult(p25[i - 1], 25); int m, k; cin >> m; string s; cin >> s; if ((k = int((s).size())) > magic) memset(f, -1, sizeof(f)); while (m--) { int op; cin >> op; if (op == 1) { string s; cin >> s; if ((k = int((s).size())) > magic) memset(f, -1, sizeof(f)); } else { int n; cin >> n; if (n < k) { cout << 0 << n ; continue; } if (k > magic && ~f[n]) { cout << f[n] << n ; continue; } int res = fpow(26, n); for (int i = (0); i < (k); i++) { submod(res, mult(binomial(i, n), p25[n - i])); } if (k > magic) f[n] = res; cout << res << n ; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; }
#include <bits/stdc++.h> const int MXN = 100010; bool alive[MXN * 5]; int L[MXN], R[MXN], T[MXN]; struct heap_t { int idx; heap_t(int nidx) : idx(nidx) {} bool operator<(const heap_t& cmp) const { return T[idx] > T[cmp.idx]; } }; struct ele_t { int idx, val; bool operator<(const ele_t& cmp) const { return val < cmp.val; } } ele[MXN * 2], ele2[MXN * 5]; int ans[MXN]; int main() { int n, m; scanf( %d %d , &m, &n); for (int i = 1; i <= n; i++) { scanf( %d %d %d , &L[i], &R[i], &T[i]); ele[i].idx = i, ele[i].val = L[i]; ele[i + n].idx = i, ele[i + n].val = R[i]; } int cele2 = m; for (int i = 1; i <= m; i++) { ele2[i].idx = i; scanf( %d , &ele2[i].val); } int lstPos = -1; std::priority_queue<heap_t> heap; std::sort(ele + 1, ele + n * 2 + 1); for (int i = 1; i <= n * 2; i++) { while (!heap.empty() && !alive[heap.top().idx]) heap.pop(); if (!heap.empty()) { ++cele2; ele2[cele2].idx = cele2; ele2[cele2 + 1].idx = cele2; ele2[cele2].val = T[heap.top().idx] - lstPos; ele2[cele2 + 1].val = T[heap.top().idx] - ele[i].val; ++cele2; } lstPos = ele[i].val; alive[ele[i].idx] = !alive[ele[i].idx]; if (alive[ele[i].idx]) heap.push(ele[i].idx); } int sum = 0, cnt = 0; std::sort(ele2 + 1, ele2 + cele2 + 1); for (int i = 1; i <= cele2; i++) { sum += cnt * (ele2[i].val - lstPos); lstPos = ele2[i].val; if (ele2[i].idx <= m) ans[ele2[i].idx] = sum; else { alive[ele2[i].idx] = !alive[ele2[i].idx]; cnt += (alive[ele2[i].idx]) ? 1 : -1; } } for (int i = 1; i <= m; i++) printf( %d%c , ans[i], i == m ? n : ); }
#include <bits/stdc++.h> const long long INF = (long long)1e18 + 18; const long long maxn = (long long)1e6 + 6; using namespace std; long long n; signed main() { cin >> n; long long a[n], c[n], b[maxn]; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) { long long inp; cin >> inp; b[inp] = i + 1; } for (long long i = 0; i < n; i++) { c[i] = b[a[i]]; } long long fine = 0, maxx = c[0]; for (long long i = 0; i < n; i++) { if (c[i] < maxx) { fine++; } maxx = max(maxx, c[i]); } cout << fine; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> using dpair = pair<T, T>; template <class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; } template <class T1, class T2> void operator+=(vector<T1> &v, const T2 &obj) { v.push_back(obj); } template <class T1> void operator+=(vector<T1> &v, const T1 &obj) { v.push_back(obj); } long long get_millis() { using namespace std::chrono; return duration_cast<milliseconds>(system_clock::now().time_since_epoch()) .count(); } const int INF = 0x3f3f3f3f; const long long mod = 1e9 + 7; class xrange { public: xrange(int end) : _start(0), _end(end), _step(1) {} xrange(int start, int end) : _start(start), _end(end), _step(1) {} xrange(int start, int end, int step) : _start(start), _end(end), _step(step) {} class iterator { public: iterator(int v, xrange &par) : val(v), parent(par){}; int operator*() const { return val; } int operator++() { return (val += parent._step); } bool operator==(const xrange::iterator &iter) const { if (&parent != &iter.parent) return false; if (val == iter.val) return true; if (parent._step > 0) return val >= parent._end && iter.val >= parent._end; else return val <= parent._end && iter.val <= parent._end; } bool operator!=(const xrange::iterator &iter) const { return !(this->operator==(iter)); } private: int val; xrange &parent; }; xrange::iterator begin() { return {_start, *this}; } xrange::iterator end() { return {_end, *this}; } protected: int _start, _end, _step; private: }; struct irange : public xrange { irange(int i) : xrange(1, i + 1) {} irange(int i, int j) : xrange(i, j + 1) {} }; const int MAXN = 1e4 + 5; namespace std { template <> struct hash<dpair<int>> { size_t operator()(dpair<int> p) const { return p.first * 123456789 + p.second; } }; } // namespace std unordered_map<dpair<int>, int> ump; int N, M, K; struct dir { bool lit; int r, c; int dist; dir(int _l, int _r, int _c, int _d) { lit = _l; r = _r; c = _c; dist = _d; } bool operator>(const dir &d) const { return dist > d.dist; } }; minheap<dir> pq; set<int> availR[MAXN], availC[MAXN]; int best[MAXN]; int main() { cin.tie(0); cin.sync_with_stdio(0); cin >> N >> M >> K; for (int a = 0; a < K; a++) { int r, c; cin >> r >> c; availR[r].insert(c); availC[c].insert(r); ump[{r, c}] = a; } pq.push({false, 1, 1, 0}); pq.push({true, 1, 1, 1}); availR[1].erase(1); availC[1].erase(1); memset(best, 0x3f, sizeof(best)); best[ump[{1, 1}]] = 0; while (!pq.empty()) { dir top = pq.top(); pq.pop(); if (top.lit) { for (int r = max(1, top.r - 2); r <= top.r + 2; r++) { for (int i : availR[r]) { int id = ump[{r, i}]; best[id] = min(best[id], top.dist); pq.push(dir{false, r, i, top.dist}); pq.push(dir{true, r, i, top.dist + 1}); } availR[r].clear(); } for (int c = max(1, top.c - 2); c <= top.c + 2; c++) { for (int i : availC[c]) { int id = ump[{i, c}]; best[id] = min(best[id], top.dist); pq.push(dir{false, i, c, top.dist}); pq.push(dir{true, i, c, top.dist + 1}); } availC[c].clear(); } } else { int dr = 1, dc = 0; if (ump.count({top.r + dr, top.c + dc}) && best[ump[{top.r + dr, top.c + dc}]] > top.dist) { best[ump[{top.r + dr, top.c + dc}]] = top.dist; pq.push(dir{false, top.r + dr, top.c + dc, top.dist}); pq.push(dir{true, top.r + dr, top.c + dc, top.dist + 1}); availR[top.r + dr].erase(top.c + dc); availC[top.c + dc].erase(top.r + dr); } dr = -1; dc = 0; if (ump.count({top.r + dr, top.c + dc}) && best[ump[{top.r + dr, top.c + dc}]] > top.dist) { best[ump[{top.r + dr, top.c + dc}]] = top.dist; pq.push(dir{false, top.r + dr, top.c + dc, top.dist}); pq.push(dir{true, top.r + dr, top.c + dc, top.dist + 1}); availR[top.r + dr].erase(top.c + dc); availC[top.c + dc].erase(top.r + dr); } dr = 0; dc = 1; if (ump.count({top.r + dr, top.c + dc}) && best[ump[{top.r + dr, top.c + dc}]] > top.dist) { best[ump[{top.r + dr, top.c + dc}]] = top.dist; pq.push(dir{false, top.r + dr, top.c + dc, top.dist}); pq.push(dir{true, top.r + dr, top.c + dc, top.dist + 1}); availR[top.r + dr].erase(top.c + dc); availC[top.c + dc].erase(top.r + dr); } dr = 0; dc = -1; if (ump.count({top.r + dr, top.c + dc}) && best[ump[{top.r + dr, top.c + dc}]] > top.dist) { best[ump[{top.r + dr, top.c + dc}]] = top.dist; pq.push(dir{false, top.r + dr, top.c + dc, top.dist}); pq.push(dir{true, top.r + dr, top.c + dc, top.dist + 1}); availR[top.r + dr].erase(top.c + dc); availC[top.c + dc].erase(top.r + dr); } } } int ans = INF; for (auto au : ump) { if (au.first == dpair<int>{N, M}) { ans = min(ans, best[au.second]); } if (abs(au.first.first - N) <= 1 || abs(au.first.second - M) <= 1) { ans = min(ans, best[au.second] + 1); } } if (ans > 10000000) { cout << -1; } else { cout << ans; } }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 10010; int f[2][N], g[2][N], a[N], ans[N], b[N], pr[N]; inline int qpow(long long a, int b, const int p) { int ret = 1; a %= p; while (b) { ret = ret * 1ll * (b & 1 ? a : 1) % p; a = a * a % p, b >>= 1; } return ret; } int main() { auto _add = [&](int &x, int y) { x += y; if (x >= mod) x -= mod; }; int n; scanf( %d , &n); a[1] = 1; b[1] = 1; const int inv_2 = mod - mod / 2; for (int i = 2; i <= n; i++) scanf( %d , &a[i]), b[i] = a[i]; for (int i = 2; i <= n; i++) b[i] = b[i - 1] * 1ll * b[i] % mod; for (int i = n; i >= 2; i--) pr[i] = (pr[i + 1] + b[i]) % mod; for (int i = 1; i <= n; i++) { f[i & 1][0] = g[i & 1][0] = 1; for (int j = 1; j <= n * 2 - 2; j++) { f[i & 1][j] = f[i & 1][j - 1] * 1ll * a[i + j] % mod; g[i & 1][j] = 0; if (j >= 2) _add(g[i & 1][j], f[i & 1][j - 2] * 1ll * (a[i] - 1 + mod) % mod); _add(g[i & 1][j], g[(i - 1) & 1][j - 1]); _add(ans[j], g[i & 1][j] * 1ll * b[i] % mod); } } for (int i = 1; i <= 2 * n - 2; i++) { if (i <= n - 1) { ans[i] = ((ans[i] - pr[1 + i] + mod) % mod * 1ll * inv_2 % mod + pr[1 + i]) % mod; } else ans[i] = ans[i] * 1ll * inv_2 % mod; } for (int i = 1; i <= 2 * n - 2; i++) printf( %d%c , ans[i], i == 2 * n - 2 ? n : ); return 0; }
#include <bits/stdc++.h> const int INF = 1e9 + 1; const int MOD = 1e9 + 7; const int N = 1e6 + 1; using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, m; cin >> n >> m; if (m == 1) { cout << 100003 100003 << endl; cout << 1 2 100003 << endl; return 0; } cout << 100003 100003 << endl; for (int i = 1; i < n - 1; i++) { cout << i << << i + 1 << 1 << endl; m--; } cout << n - 1 << << n << << 100003 - n + 2 << endl; m--; long long int z = 1000000000; for (int i = 1; i < n && m > 0; i++) { for (int j = i + 2; j <= n && m > 0; j++) { cout << i << << j << << z << endl; m--; } } return 0; }
#include <bits/stdc++.h> using namespace std; double memo[2002][2002]; double p; int main() { int n, t; cin >> n >> p >> t; double ans = 0; memo[0][0] = 1.0; for (int per = 1; per <= n; per++) for (int s = 1; s <= t; s++) memo[per][s] = memo[per - 1][s - 1] * p + memo[per][s - 1] * (1.0 - p); for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) ans += memo[i][j]; printf( %lf , ans); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void *wmem; char memarr[10485760]; template <class T> inline void walloc1d(T **arr, int x, void **mem = &wmem) { static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; (*mem) = (void *)(((char *)(*mem)) + skip[((unsigned long long)(*mem)) & 15]); (*arr) = (T *)(*mem); (*mem) = ((*arr) + x); } inline void rd(int &x) { int k; int m = 0; x = 0; for (;;) { k = getchar(); if (k == - ) { m = 1; break; } if ( 0 <= k && k <= 9 ) { x = k - 0 ; break; } } for (;;) { k = getchar(); if (k < 0 || k > 9 ) { break; } x = x * 10 + k - 0 ; } if (m) { x = -x; } } inline void wt_L(char a) { putchar(a); } inline void wt_L(int x) { int s = 0; int m = 0; char f[10]; if (x < 0) { m = 1; x = -x; } while (x) { f[s++] = x % 10; x /= 10; } if (!s) { f[s++] = 0; } if (m) { putchar( - ); } while (s--) { putchar(f[s] + 0 ); } } struct unionFind { int *d; int N; int M; inline void malloc(const int n) { d = (int *)std::malloc(n * sizeof(int)); M = n; } inline void free(void) { std::free(d); } inline void walloc(const int n, void **mem = &wmem) { walloc1d(&d, n, mem); M = n; } inline void init(const int n) { int i; N = n; for (i = (0); i < (n); i++) { d[i] = -1; } } inline void init(void) { init(M); } inline int get(int a) { int t = a; int k; while (d[t] >= 0) { t = d[t]; } while (d[a] >= 0) { k = d[a]; d[a] = t; a = k; } return a; } inline int connect(int a, int b) { if (d[a] >= 0) { a = get(a); } if (d[b] >= 0) { b = get(b); } if (a == b) { return 0; } if (d[a] < d[b]) { d[a] += d[b]; d[b] = a; } else { d[b] += d[a]; d[a] = b; } return 1; } inline int operator()(int a) { return get(a); } inline int operator()(int a, int b) { return connect(a, b); } inline int &operator[](const int a) { return d[a]; } inline int size(int a) { a = get(a); return -d[a]; } inline int sizeList(int res[]) { int i; int sz = 0; for (i = (0); i < (N); i++) { if (d[i] < 0) { res[sz++] = -d[i]; } } return sz; } }; int N; int M; int Q; int X; int Y; int C; int res[2000000 + 2]; int mp[300][300]; vector<int> tmm[2000000 + 1]; vector<int> type[2000000 + 1]; vector<int> place[2000000 + 1]; int main() { wmem = memarr; int i; int j; int k; int c; int t; int x; int y; int nx; int ny; int d; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; unionFind uf; rd(N); rd(M); rd(Q); for (i = (0); i < (N * M); i++) { tmm[0].push_back(0); type[0].push_back(1); place[0].push_back(i); } for (i = (0); i < (Q); i++) { rd(X); X += (-1); rd(Y); Y += (-1); rd(C); if (mp[X][Y] == C) { continue; } k = mp[X][Y]; tmm[k].push_back(i + 1); type[k].push_back(-1); place[k].push_back(X * M + Y); k = mp[X][Y] = C; tmm[k].push_back(i + 1); type[k].push_back(1); place[k].push_back(X * M + Y); } for (i = (0); i < (N * M); i++) { k = mp[i / M][i % M]; tmm[k].push_back(Q + 1); type[k].push_back(-1); place[k].push_back(i); } uf.walloc(N * M); for (k = (0); k < (2000000 + 1); k++) { if (tmm[k].size()) { for (i = (0); i < (N); i++) { for (j = (0); j < (M); j++) { mp[i][j] = 0; } } uf.init(N * M); t = c = 0; for (i = (0); i < (tmm[k].size()); i++) { if (tmm[k][i] != t) { res[t] += c; t = tmm[k][i]; res[t] -= c; } if (type[k][i] == -1) { break; } x = place[k][i] / M; y = place[k][i] % M; mp[x][y] = 1; c++; for (d = (0); d < (4); d++) { nx = x + dx[d]; ny = y + dy[d]; if (nx < 0 || ny < 0 || nx >= N || ny >= M) { continue; } if (mp[nx][ny] == 1) { c -= uf(x * M + y, nx * M + ny); } } } for (i = (0); i < (N); i++) { for (j = (0); j < (M); j++) { mp[i][j] = 0; } } uf.init(N * M); t = Q + 1; c = 0; for (i = (tmm[k].size()) - 1; i >= (0); i--) { if (type[k][i] == 1) { break; } if (tmm[k][i] != t) { res[t] -= c; t = tmm[k][i]; res[t] += c; } x = place[k][i] / M; y = place[k][i] % M; mp[x][y] = 1; c++; for (d = (0); d < (4); d++) { nx = x + dx[d]; ny = y + dy[d]; if (nx < 0 || ny < 0 || nx >= N || ny >= M) { continue; } if (mp[nx][ny] == 1) { c -= uf(x * M + y, nx * M + ny); } } } } } for (i = (1); i < (Q + 1); i++) { res[i] += res[i - 1]; wt_L(res[i]); wt_L( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, val; int arr[3] = {0}, count = 0; cin >> n; for (int i = 0; i < n; ++i) { cin >> val; arr[val]++; } if (arr[2] <= arr[1]) { count += arr[2]; arr[1] -= arr[2]; count += (arr[1] / 3); } else { count += arr[1]; } cout << count; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int t; cin >> t; while (t--) { int n; cin >> n; set<int> se; for (int i = 0; i < n; i++) { int va; cin >> va; se.insert(va & 1); } if (se.size() == 1) { cout << YES n ; } else { cout << NO n ; } } }
#include <bits/stdc++.h> using namespace std; const int maxn = 100010, mod = 998244353; inline long long read() { char ch = getchar(); long long x = 0, f = 0; while (ch < 0 || ch > 9 ) f |= ch == - , ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } int n, m, dfn[maxn], low[maxn], stk[maxn], tp, cnt, id[maxn], deg[maxn], scnt, el, head[maxn], to[maxn], nxt[maxn], ans, q[maxn], h = 1, r; bool ins[maxn]; vector<int> vec[maxn]; inline int ask(int u, int v) { printf( ? %d %d n , u, v); fflush(stdout); return read(); } inline void add(int u, int v) { to[++el] = v; nxt[el] = head[u]; head[u] = el; } void dfs(int u) { dfn[u] = low[u] = ++cnt; stk[++tp] = u; ins[u] = true; for (int i = head[u]; i; i = nxt[i]) { int v = to[i]; if (!dfn[v]) dfs(v), low[u] = min(low[u], low[v]); else if (ins[v]) low[u] = min(low[u], dfn[v]); } if (low[u] == dfn[u]) { scnt++; do { int v = stk[tp]; ins[v] = false; id[v] = scnt; vec[scnt].push_back(v); } while (stk[tp--] != u); } } int main() { n = read(); m = read(); for (int i = (1); i <= (m); i++) { int u = read(), v = read(); add(u, v); } for (int i = (1); i <= (n); i++) if (!dfn[i]) dfs(i); for (int u = (1); u <= (n); u++) for (int i = head[u]; i; i = nxt[i]) if (id[u] != id[to[i]]) deg[id[to[i]]]++; for (int i = (1); i <= (scnt); i++) if (!deg[i]) q[++r] = i; ans = vec[q[h]].back(); while (h != r) { int &at = q[h + 1]; int u = vec[at].back(); if (!ask(ans, u)) swap(u, ans), swap(q[h], q[h + 1]); for (int i = head[u]; i; i = nxt[i]) if (id[u] != id[to[i]] && !--deg[id[to[i]]]) q[++r] = id[to[i]]; vec[at].pop_back(); if (vec[at].empty()) swap(q[h], q[h + 1]), h++; } printf( ! %d n , ans); fflush(stdout); }
#include<bits/stdc++.h> using namespace std; const int N=1e5+5; int tot; int head[N],to[N*2],next1[N*2]; void lian(int x,int y) { to[++tot]=y; next1[tot]=head[x]; head[x]=tot; } int d[N],k; struct qw{ int a,b,c,d; }e[N]; struct er{ int a,b; }jie[N]; void dfs(int x,int fa) { jie[x].a=x,jie[x].b=0; for(int i=head[x];i;i=next1[i]) { int v=to[i]; if(v==fa) continue; d[x]++; dfs(v,x); } if(d[x]==0) return; int v1=-1; for(int i=head[x];i;i=next1[i]) { int v=to[i]; if(v==fa) continue; if(jie[v].b==0) { if(v1==-1) jie[x].a=jie[v].a; else if(jie[x].b==0) jie[x].b=jie[v].a; else e[++k]=(qw){v,x,v,jie[x].a},jie[x].a=jie[v].a; v1=0; } } if(v1==-1) { for(int i=head[x];i;i=next1[i]) { int v=to[i]; if(v==fa) continue; v1=v; e[++k]=(qw){v,x,x,jie[v].a}; jie[x].a=jie[v].b; break; } } for(int i=head[x];i;i=next1[i]) { int v=to[i]; if(v==fa||jie[v].b==0||v==v1) continue; if(jie[v].a&&jie[v].b) e[++k]=(qw){v,x,jie[v].a,jie[x].a},jie[x].a=jie[v].b; else e[++k]=(qw){v,x,jie[x].a,v},jie[x].a=jie[v].a; } } int main() { int T; cin>>T; while(T--) { int n; cin>>n; int x,y; for(int i=1;i<=n-1;i++) { scanf( %d %d ,&x,&y); lian(x,y),lian(y,x); } k=0; dfs(1,0); printf( %d n ,k); for(int i=1;i<=k;i++) printf( %d %d %d %d n ,e[i].a,e[i].b,e[i].c,e[i].d); tot=0; for(int i=1;i<=n;i++) head[i]=d[i]=0; } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, k, a[100100]; int main() { scanf( %lld %lld , &n, &k); int temp = 0, t = 0; vector<int> v; for (int i = 1; i <= n; i++) { long long x; scanf( %lld , &x); if (temp + (i - n) * x * 1ll * (i - t - 1) < k) { v.push_back(i); t++; } else temp = temp + x * 1ll * (i - t - 1); } for (int i = 0; i < v.size(); i++) printf( %d n , v[i]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[1001]; int b[1001] = {0}; for (int i = 0; i < n; i++) { cin >> a[i]; b[a[i]] = 1; } sort(a, a + n); int ans = 0; int sum = a[n - 1] - a[0] + 1; cout << sum - n << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long double eps = 1e-7; const int inf = 1000000010; const long long INF = 10000000000000010LL; const int mod = 1000000007; const int MAXN = 100010; int n, m, k, u, v, x, y, t, a, b, ans; string A[5]; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> s; for (int i = 0; i < 5; i++) { cin >> A[i]; if (A[i][0] == s[0] || A[i][1] == s[1]) return cout << YES << n , 0; } return cout << NO << n , 0; return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int n, a, b, c, ans = 0; int main() { cin >> n >> a >> b >> c; for (int i = 0; i <= a; i += 2) for (int j = 0; j < (int)(b + 1); j++) { int k = n - (i * 0.5 + j); if (k < 0) break; if (!k) { ans++; continue; } if (k % 2 == 0) { int l = k / 2; if (l <= c) ans++; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int M = 1e6 + 10; const long long INF = 0x3f3f3f3f3f3f3f; const int inf = 0x3f3f3f; const double esp = 1e-6; long long read() { long long x = 0; long long k = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) k = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + (c - 0 ); c = getchar(); } return x * k; } int n; int a[N]; int main() { int t; cin >> t; while (t--) { int a, b; cin >> a >> b; if (a == 1) { if (b <= 1) { cout << YES << endl; } else cout << NO << endl; } else if (a == 2) { if (b <= 3) { cout << YES << endl; } else cout << NO << endl; } else if (a == 3) { if (b <= 3) { cout << YES << endl; } else cout << NO << endl; } else cout << YES << endl; } }
#include <bits/stdc++.h> using namespace std; int Ask(int x, int y) { printf( ? %d %d n , x, y); fflush(stdout); int t; scanf( %d , &t); return t; } int vis[105], t[105], n; struct bt { bitset<105> A; int id; int operator[](int x) { return A[x]; } friend bool operator<(bt x, bt y) { for (int i = n; ~i; i--) if (x[i] ^ y[i]) return x[i] < y[i]; return 0; } int mx() { for (int i = n; ~i; i--) if (A[i]) return i; return -1; } } dp[105]; map<pair<int, int>, int> val; priority_queue<bt> q; vector<int> e[105]; bool chk(vector<bt> f) { for (auto x : f) q.push(x); if (q.empty()) return 1; for (int i = n; ~i; i--) if (t[i]) { bt x = q.top(); q.pop(); int v = x.mx(); if (v > i) break; else if (v == i) x.A[v] = 0, q.emplace(x); if (!q.size()) return 1; } while (q.size()) q.pop(); return 0; } void produce(int u, vector<bt> f) { for (auto x : f) q.push(x); if (q.empty()) return; for (int i = n; ~i; i--) if (t[i]) { bt x = q.top(); q.pop(); int v = x.mx(); if (v == i) x.A[v] = 0, q.emplace(x); else val[pair<int, int>(x.id, u)] = val[pair<int, int>(u, x.id)] = i; if (!q.size()) break; } while (q.size()) q.pop(); } void dfs1(int u, int fa) { vector<bt> g; dp[u].id = u; for (int v : e[u]) if (v != fa) dfs1(v, u), g.push_back(dp[v]); fill(t, t + n, 1); t[n] = 0; for (int i = n; ~i; i--, t[i] = 0) if (!chk(g)) t[i] = 1; for (int i = 0; i <= n; i++) dp[u].A[i] = t[i]; produce(u, g); } pair<int, int> id; void dfs2(int u, int fa, int &mx) { for (int v : e[u]) if (!vis[v] && v != fa) { int k = val[pair<int, int>(u, v)]; if (k > mx) mx = k, id = pair<int, int>(u, v); dfs2(v, u, mx); } } void solve(int u, int fa) { int mx = -1; dfs2(u, fa, mx); if (mx == -1) printf( ! %d n , u), fflush(stdout), exit(0); int res = Ask(id.first, id.second); if (res == id.first) vis[id.second] = 1, solve(id.first, id.second); else vis[id.first] = 1, solve(id.second, id.first); } int main() { scanf( %d , &n); for (int i = 1, u, v; i < n; i++) scanf( %d%d , &u, &v), e[u].emplace_back(v), e[v].emplace_back(u); dfs1(1, 0); solve(1, 0); }
#include <bits/stdc++.h> using namespace std; template <typename... T> inline void inp(T &...args) { ((cin >> args), ...); } template <typename T> inline istream &operator>>(istream &in, vector<T> &a) { for (auto &x : a) in >> x; return in; } template <typename T, typename U> inline istream &operator>>(istream &in, pair<T, U> &a) { in >> a.first >> a.second; return in; } const long long int MX = 1e6 + 10; const long long int Mod = 998244353; inline long long int md(long long int x, long long int M = Mod) { x %= M; return ((x < 0) ? (x + M) : x); } vector<long long int> fact(MX), invfact(MX), inv(MX); void init_fact(long long int m = Mod) { inv[0] = 0; inv[1] = fact[0] = fact[1] = invfact[0] = invfact[1] = 1; for (long long int i = 2; i < MX; i++) { fact[i] = md(fact[i - 1] * i, m); inv[i] = m - (m / i) * inv[m % i] % m; invfact[i] = md(inv[i] * invfact[i - 1], m); } } long long int NPR(long long int n, long long int r) { if (0 <= r and r <= n) { return md(fact[n] * invfact[n - r]); } return 0; } long long int NCR(long long int n, long long int r) { if (0 <= r and r <= n) { return md(fact[n] * md(invfact[r] * invfact[n - r])); } return 0; } void solve(int &T) { long long int n, k; cin >> n >> k; vector<pair<long long int, long long int>> a; for (long long int i = (0); ((1) > 0 ? i < (n) : i > (n)); i += (1)) { long long int x, y; cin >> x >> y; a.push_back({x, 1}); a.push_back({y + 1, -1}); } sort((a).begin(), (a).end()); long long int cnt = 0, ans = 0; for (long long int i = (0); ((1) > 0 ? i < (2 * n) : i > (2 * n)); i += (1)) { if (a[i].second == 1) { if (cnt >= k - 1) { ans = md(ans + NCR(cnt, k - 1)); } cnt++; } else { cnt--; } } cout << ans << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); init_fact(); int t = 1; for (int i = 1; i <= t; i++) { if (0) cerr << Case # << i << n ; solve(i); } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; long long a[100005]; long long sum1[100005], sum2[100005]; int main() { memset(sum1, 0, sizeof(sum1)); memset(sum2, 0, sizeof(sum2)); cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; sum1[i] = sum1[i - 1] + a[i]; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; ++i) { sum2[i] = sum2[i - 1] + a[i]; } cin >> m; for (int i = 0; i < m; ++i) { int q, l, r; cin >> q >> l >> r; if (q == 1) { cout << sum1[r] - sum1[l - 1] << endl; } else { cout << sum2[r] - sum2[l - 1] << endl; } } return 0; }
#include <bits/stdc++.h> bool fun(long long a); using namespace std; int main() { long long num, num1, num2; cin >> num; if (num % 2 == 0) { num1 = num / 2; num2 = num / 2; while (!fun(num1) || !fun(num2)) { num1 -= 1; num2 += 1; } } else { num1 = num / 2; num2 = num / 2 + 1; while (!fun(num1) || !fun(num2)) { num1 -= 1; num2 += 1; } } cout << num1 << << num2; } bool fun(long long a) { int c = 0; for (int i = 2; i < a; i++) { if (a % i == 0) { c = 1; break; } } return c == 1; }
#include <bits/stdc++.h> using namespace std; int n, tab[1000001]; void draw() { for (int i = 0; i < n; i++) { cout << tab[i] << ; } cout << endl; } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> tab[i]; } sort(tab, tab + n); if (n % 2 == 1) { cout << tab[n / 2] << endl; } else { cout << tab[n / 2 - 1] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read(T& x) { x = 0; int f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) f |= (ch == - ), ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x = f ? -x : x; } const int N = 3e5 + 10; const int INF = 2000000000; int n, k, i, ans, minx, maxx, miny, maxy, x[N], y[N]; int main() { read(n); minx = miny = INF, maxx = maxy = -INF; for (i = 0; i < n; ++i) { read(x[i]), read(y[i]); minx = min(minx, x[i]); miny = min(miny, y[i]); maxx = max(maxx, x[i]); maxy = max(maxy, y[i]); } for (ans = -INF, i = 0; i < n; ++i) { ans = max(ans, 2 * (maxx - x[i]) + 2 * (maxy - y[i])); ans = max(ans, 2 * (maxx - x[i]) + 2 * (y[i] - miny)); ans = max(ans, 2 * (x[i] - minx) + 2 * (maxy - y[i])); ans = max(ans, 2 * (x[i] - minx) + 2 * (y[i] - miny)); } printf( %d%c , ans, n == 3 ? n : ); for (i = 4; i <= n; ++i) printf( %d%c , 2 * (maxx - minx + maxy - miny), i == n ? n : ); return 0; }
#include <bits/stdc++.h> using namespace std; bool debug = 1; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; long long ln, lk, lm; vector<int> mp[100005]; int r1, r2, fa[100005], s[100005], no[100005], cnt, d[100005], w[100005]; bool vis[100005]; int bfs(int x) { queue<int> q; q.push(x); fa[x] = 0; vis[x] = 1; while (!q.empty()) { x = q.front(); q.pop(); for (int c : mp[x]) if (!vis[c]) { fa[c] = x; vis[c] = 1; q.push(c); } } for (int(i) = 0; (i) < (int)(100005); (i)++) vis[i] = 0; return x; } void dfs(int x, int dp, int fa, int col) { d[x] = dp; no[x] = col; w[col] = max(w[col], dp); for (int c : mp[x]) if (c != fa && !vis[c]) { dfs(c, dp + 1, x, col); } } int T[2][100005][20]; void init() { for (int(i) = 1; (i) <= (int)(cnt); (i)++) { T[0][i][0] = w[i] + i; T[1][i][0] = w[i] - i; } for (int j = 1; (1 << j) <= cnt; j++) { for (int i = 1; i + (1 << j) - 1 <= cnt; i++) { for (int(x) = 0; (x) < (int)(2); (x)++) T[x][i][j] = max(T[x][i][j - 1], T[x][i + (1 << (j - 1))][j - 1]); } } } int qym(int l, int r, int p) { if (l > r) return -(1 << 30); int x = log(r - l + 1) / log(2); int y = max(T[p][l][x], T[p][r - (1 << x) + 1][x]); return y; } int main() { scanf( %d , &n); for (int i = 0, u, v; i < n - 1; i++) { scanf( %d%d , &u, &v); mp[u].push_back(v); mp[v].push_back(u); } r1 = bfs(1); r2 = bfs(r1); for (int(i) = 0; (i) < (int)(100005); (i)++) vis[i] = 0; for (int i = r2; i; i = fa[i]) { vis[i] = 1; s[++cnt] = i; no[i] = cnt; } for (int(i) = 1; (i) <= (int)(cnt); (i)++) dfs(s[i], 0, 0, i); init(); scanf( %d , &m); for (int i = 0, x, y, ans; i < m; i++) { scanf( %d%d , &x, &y); int l = no[x], r = no[y]; if (r < l) { swap(l, r); swap(x, y); } if (l == r) { ans = max(l - 1, cnt - r) + min(d[x], d[y]); } else { int mid2 = l + r - d[x] + d[y]; if (mid2 <= l * 2) { ans = d[y] + max(r - 1, cnt - r); } else if (mid2 >= r * 2) { ans = d[x] + max(l - 1, cnt - l); } else { int mid = mid2 / 2; int L = max(l - 1, qym(l + 1, mid, 0) - l) + d[x]; int R = max(cnt - r, qym(mid + 1, r - 1, 1) + r) + d[y]; ans = max(L, R); } } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; namespace fio { streambuf* in = cin.rdbuf(); char bb[1000000], *s = bb, *t = bb; inline long long read() { long long x = 0; char ch = (s == t && (t = (s = bb) + in->sgetn(bb, 1000000), s == t) ? EOF : *s++); while (ch < 48) ch = (s == t && (t = (s = bb) + in->sgetn(bb, 1000000), s == t) ? EOF : *s++); while (ch >= 48) x = x * 10 + ch - 48, ch = (s == t && (t = (s = bb) + in->sgetn(bb, 1000000), s == t) ? EOF : *s++); return x; } } // namespace fio using fio::read; long long n; int m, llm; int lim[26]; vector<int> road[26]; map<array<int, 26>, int> huaji; array<int, 26> pm; class mat { public: int val[125][125]; int* operator[](int x) { return val[x]; } mat operator*(mat _) { mat ans; for (int i = 1; i <= llm; i++) for (int u = 1; u <= llm; u++) { ans[i][u] = 0; for (int j = 1; j <= llm; j++) ans[i][u] = (ans[i][u] + val[i][j] * _[j][u]) % 12345; } return ans; } }; mat ksm(mat x, long long y) { mat ans = x; y--; for (; y; y >>= 1, x = x * x) if (y & 1) ans = ans * x; return ans; } mat base; int ans; int main() { n = read(), m = read(); if (!n) return cout << 1, 0; if (!m) return cout << 0, 0; for (int i = 1, x, y; i <= m; i++) x = read() + 0 - A , road[x].emplace_back(y = read()), lim[x] = max(lim[x], 1) * road[x].back(); while (pm[25] < max(lim[25], 1)) { huaji[pm] = ++llm, pm[0]++; for (int i = 0; i < 25; i++) if (lim[i]) pm[i + 1] += pm[i] / lim[i], pm[i] %= lim[i]; else pm[i + 1] += pm[i], pm[i] = 0; } for (pair<array<int, 26>, int> it : huaji) for (int i = 0; i < 26; i++) if (lim[i]) it.first[i] = (it.first[i] + 1) % lim[i], base[it.second][huaji[it.first]]++, it.first[i] = (it.first[i] - 1 + lim[i]) % lim[i]; base = ksm(base, n); for (pair<array<int, 26>, int> it : huaji) { bool flag = 1; for (int i = 0, fx = 0; flag && i < 26; i++, flag &= fx, fx = 0) if (!lim[i]) fx = 1; else for (int p : road[i]) fx |= !(it.first[i] % p); flag ? ans = (ans + base[1][it.second]) % 12345 : ans; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; vector<vector<set<int> > > setgrid; vector<string> grid; int k; int ro[4] = {1, -1, 0, 0}; int co[4] = {0, 0, -1, 1}; struct s { s() : r(-1), c(-1), set(-1), path( ), let( A ), d(0) {} s(int nr, int nc, unsigned int nset, string npath, char nlet, int nd) : r(nr), c(nc), set(nset), path(npath), let(nlet), d(nd) {} int r, c, d; unsigned int set; string path; char let; }; bool operator<(const s &lhs, const s &rhs) { if (lhs.d == rhs.d) if (lhs.path == rhs.path) return lhs.let >= rhs.let; else return lhs.path >= rhs.path; else return lhs.d >= rhs.d; } bool visited(int r, int c, unsigned int set) { unsigned int subset = set; do { subset = (subset - 1) & set; if (setgrid[r][c].find(subset) != setgrid[r][c].end()) { return true; } } while (subset != set); return false; } int main(void) { s qf; int rs, cs, nr, nc; unsigned int nset, one = 0x00000001; priority_queue<s> q; vector<s> pv, tv; cin >> rs >> cs >> k; grid.resize(rs); for (int i = 0; i < rs; i++) cin >> grid[i]; setgrid.resize(rs); for (int i = 0; i < rs; i++) setgrid[i].resize(cs); int sr, sc; for (int i = 0; i < rs; i++) for (int j = 0; j < cs; j++) if (grid[i][j] == S ) { sr = i; sc = j; break; } q.push(s(sr, sc, 0, , a , 0)); setgrid[sr][sc].insert(0); while (!q.empty()) { pv.clear(); qf = q.top(); for (int i = 0; i < 4; i++) { nr = qf.r + ro[i]; nc = qf.c + co[i]; if (nr < 0 || nr >= rs || nc < 0 || nc >= cs) continue; if (grid[nr][nc] == T ) goto success; nset = qf.set | (one << int(grid[nr][nc] - a )); if ((__builtin_popcount(nset) > k) || visited(nr, nc, nset)) continue; pv.push_back( s(nr, nc, nset, qf.path + grid[nr][nc], grid[nr][nc], qf.d + 1)); setgrid[nr][nc].insert(nset); } sort(pv.begin(), pv.end()); for (int i = 0; i < pv.size(); i++) q.push(pv[i]); q.pop(); } cout << -1 << n ; return 0; success: if (qf.path != ) cout << qf.path << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, x, y; bool a[401][401]; bool viz[401]; int dist[401]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr.tie(0); cout.tie(0); cin >> n >> m; while (m--) { cin >> x >> y; a[x][y] = a[y][x] = 1; } queue<int> q; q.push(1); viz[1] = 1; while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 1; i <= n; i++) if (!viz[i] && (a[u][i] ^ a[1][n])) { q.push(i); viz[i] = 1; dist[i] = dist[u] + 1; } } return cout << ((!viz[n]) ? -1 : max(1, dist[n])), 0; }
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { char s[3][3]; bool is = false; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cin >> s[i][j]; if (s[i][j] == X ) is = true; } } int i = 0, j = 0; bool isY = true; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) if (s[i][j] != s[2 - i][2 - j]) isY = false; } if (isY) cout << YES ; else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; double p1, p2; double fastPow(double b, int n) { if (n == 0) return 1.0; double po = fastPow(b, n / 2); po = po * po; if (n & 1) return po * b; return po; } double proba(int turno) { double ans = 1; ans = ans * fastPow(1 - p1, turno / 2); ans = ans * fastPow(1 - p2, turno / 2); return ans * p1; return ans * p1; } int main() { double a, b, c, d; while (cin >> a >> b >> c >> d) { double prob = 0; p1 = a / b; p2 = c / d; for (int i = 1; i < 100000; i += 2) prob = prob + proba(i); cout << prob << endl; } }
#include <bits/stdc++.h> using namespace std; const int maxN = 3e5 + 5; map<pair<int, int>, int> mp; int counts[maxN]; set<int> s[maxN]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, P; cin >> N >> P; for (int i = 0; i < N; i++) { pair<int, int> xy; cin >> xy.first >> xy.second; xy = {min(xy.first, xy.second), max(xy.first, xy.second)}; if (mp.count(xy) > 0) mp[xy]++; else mp[xy] = 1; counts[xy.first]++; counts[xy.second]++; s[xy.first].insert(xy.second); s[xy.second].insert(xy.first); } vector<int> ordered; for (int i = 1; i <= N; i++) { ordered.push_back(counts[i]); } sort(ordered.begin(), ordered.end()); long long ans = 0; for (int i = 1; i <= N; i++) { int rem = P - counts[i]; int k = lower_bound(ordered.begin(), ordered.end(), rem) - ordered.begin(); int tot = N - k; if (counts[i] >= rem) tot--; for (auto it = s[i].begin(); it != s[i].end(); it++) { pair<int, int> ordp = {min(i, *it), max(i, *it)}; if (counts[i] + counts[*it] >= P && counts[i] + counts[*it] - mp[ordp] < P) { tot--; } } ans += tot; } cout << ans / 2; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string second, a = 1968 ; string rem[10]; cin >> second; int zero = 0; bool one = 0, six = 0, eight = 0, nine = 0; string alt = ; for (int i = 0; i < second.size(); i++) { if (second[i] == 0 ) zero++; if (second[i] == 1 && one) alt += second[i]; if (second[i] == 6 && six) alt += second[i]; if (second[i] == 8 && eight) alt += second[i]; if (second[i] == 9 && nine) alt += second[i]; if (second[i] == 1 ) one = 1; else if (second[i] == 6 ) six = 1; else if (second[i] == 8 ) eight = 1; else if (second[i] == 9 ) nine = 1; else if (second[i] != 0 ) alt += second[i]; } int t = 1, mo = 0; for (int i = 0; i < zero; i++) { t = (t * 10) % 7; } int ft = t; do { int m = 0; t = ft; for (int i = 4 - 1; i >= 0; i--) { m = (m + t * (a[i] - 0 )) % 7; t = (t * 10) % 7; } rem[m] = a; } while (next_permutation(a.begin(), a.end())); for (int i = alt.size() - 1; i >= 0; i--) { mo = (mo + (alt[i] - 0 ) * t) % 7; t = (t * 10) % 7; } rem[7] = rem[0]; cout << alt << rem[7 - mo]; for (int i = 0; i < zero; i++) cout << 0; return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 1e5, OO = 1e14; const int di[] = {1, -1, 0, 0}; const int dj[] = {0, 0, 1, -1}; long long TC, n, m, k, a, b, c, cnt, u, mx, mn, ans, arr[N]; bool f, vis[N], mark[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> TC; while (TC--) { cin >> n >> m; cnt = f = 0; m += (2 * n); for (int i = 1; i <= n && !f; i++) { for (int j = i + 1; j <= n; j++) { cout << i << << j << n ; if (++cnt == m) { f = 1; break; } } } } return 0; }
#pragma GCC optimize( O3 ) #pragma GCC target( avx2 ) #include<bits/stdc++.h> using namespace std; #define int long long signed main() { int t; cin >> t; for (int u = 0; u < t; ++u) { string s; cin >> s; int b1 = 0, b2 = 0; int ans = 0; for (char c : s) { if (c == ( ) { ++b1; } else if (c == [ ) { ++b2; } else if (c == ) && b1) { --b1; ++ans; } else if (c == ] && b2) { --b2; ++ans; } } cout << ans << n ; } }
#include <bits/stdc++.h> using namespace std; string toString(long long n) { string str = ; while (n) { str += n % 10 + 0 ; n /= 10; } reverse(str.begin(), str.end()); return str; } int main() { string s = ; for (auto i = (1); i <= (10000); ++i) { string t = toString(i); s += t; } long long n; scanf( %lld , &n); if (n <= (int)s.size()) printf( %c n , s[n - 1]); else { n -= 9; long long cur = 180LL; int digit = 2; long long power = 10; while (n > cur) { n -= cur; power *= 10LL; ++digit; cur = 9LL * digit * power; } power += n / digit - 1; n %= digit; if (n) ++power; string str = toString(power); if (n == 0) cout << str[(int)str.size() - 1] << endl; else cout << str[n - 1] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, b; cin >> n >> b; long long int a[n], i, j, k, l, t1, t2, sum = 0, ad[n]; for (i = 0; i < n; i++) { cin >> a[i]; ad[i] = a[i]; } vector<pair<long long int, long long int>> v; map<long long int, long long int> mp; for (i = 0; i < b; i++) { cin >> t1 >> t2; v.push_back(make_pair(t1, t2)); } sort(v.begin(), v.end()); sort(a, a + n); i = j = sum = 0; for (i = 0; i < n; i++) { while (a[i] >= v[j].first && j < b) { sum = sum + v[j].second; j++; } mp[a[i]] = sum; } for (i = 0; i < n; i++) { cout << mp[ad[i]] << ; } }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n; double p[maxn], dp[maxn]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lf , &p[i]); double sol = 0.; dp[0] = 0; for (int i = 1; i < n; i++) { dp[i] = (dp[i - 1] + p[i - 1]) * p[i]; sol += 2. * dp[i]; } for (int i = 0; i < n; i++) sol += p[i]; printf( %.9lf n , sol); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int numTest; cin >> numTest; for (int num = 0; num < numTest; ++num) { int n; cin >> n; int arr[n]; for (int i = 0; i < n; ++i) { cin >> arr[i]; } sort(arr, arr + n); int temp = arr[0], temp2 = 0; for (int i = 1; i < n; ++i) { temp2 += arr[i - 1]; arr[i] -= temp; temp += arr[i]; if (arr[0] < arr[i]) arr[0] = arr[i]; } cout << arr[0] << endl; } }
#include <bits/stdc++.h> using namespace std; int getInt() { int x; scanf( %d , &x); return x; } long long getLongLong() { long long x; scanf( %I64d , &x); return x; } double getDouble() { double x; scanf( %lf , &x); return x; } char getChar() { char x; scanf( %c , &x); return x; } template <typename t> t abs(t a) { if (a >= 0) return a; return -a; } struct dual { int a, b; bool const operator<(const dual &x) const { if (a == x.a) return b > x.b; return a < x.a; } }; struct triple { int a, b, c; bool const operator<(const triple &x) const { if (c == x.c) { if (a == x.a) return b > x.b; return a < x.a; } return c < x.c; } }; void FastIO() { ios::sync_with_stdio(0); cin.tie(0); } int a[512345]; char s[512345]; long long ssb[512345] = {0}, psb[512345] = {0}; long long ssa[512345] = {0}, psa[512345] = {0}; int main() { int n = getInt(); for (int i = 0; i < n; i++) a[i] = getInt(); scanf( %s , s); if (s[0] == B ) psb[0] = a[0]; else psa[0] = a[0]; for (int i = 1; i < n; i++) { psa[i] = psa[i - 1]; psb[i] = psb[i - 1]; if (s[i] == A ) psa[i] += a[i]; else psb[i] += a[i]; } for (int i = n - 1; i >= 0; i--) { ssa[i] = ssa[i + 1]; ssb[i] = ssb[i + 1]; if (s[i] == A ) ssa[i] += a[i]; else ssb[i] += a[i]; } long long ans = max(ssa[0], ssb[0]); for (int i = 0; i < n; i++) { ans = max(ans, max(psa[i] + ssb[i + 1], psb[i] + ssa[i + 1])); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000; const int dx[4] = {1, 1, -1, -1}; const int dy[4] = {1, -1, -1, 1}; int n, m; int t[MAXN + 2][MAXN + 2]; int dp[4][MAXN + 2][MAXN + 2]; int sol; int main() { ios::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) cin >> t[i][j]; for (int d = 0; d < 4; ++d) for (int i = dy[d] == 1 ? 1 : n; i && i <= n; i += dy[d]) for (int j = dx[d] == 1 ? 1 : m; j && j <= m; j += dx[d]) dp[d][i][j] = max(dp[d][i - dy[d]][j], dp[d][i][j - dx[d]]) + t[i][j]; for (int i = 2; i < n; ++i) for (int j = 2; j < m; ++j) sol = max(sol, max(dp[0][i - 1][j] + dp[1][i][j - 1] + dp[2][i + 1][j] + dp[3][i][j + 1], dp[0][i][j - 1] + dp[1][i + 1][j] + dp[2][i][j + 1] + dp[3][i - 1][j])); cout << sol << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N]; int n; int res[N]; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } void solve() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } if (n % 2 == 0) { for (int i = 0; i < n / 2; i++) { int j = n - 1 - i; int t = lcm(a[i], a[j]); res[i] = t / a[i]; res[j] = t / a[j]; if (1) { res[i] *= -1; } } for (int i = 0; i < n; i++) cout << res[i] << ; cout << endl; } else { for (int i = 0; i < n / 2 - 1; i++) { int j = n - 1 - i; int t = lcm(a[i], a[j]); res[i] = t / a[i]; res[j] = t / a[j]; if (1) { res[i] *= -1; } } res[n / 2 - 1] = 1; res[n / 2 + 1] = -1; int t = 1 * a[n / 2 - 1] + -1 * a[n / 2 + 1]; if (t == 0) { t += a[n / 2 - 1]; res[n / 2 - 1]++; } int t2 = lcm(t, a[n / 2]); res[n / 2] = t2 / a[n / 2]; res[n / 2 - 1] *= t2 / t; res[n / 2 + 1] *= t2 / t; if (1) { res[n / 2] *= -1; } for (int i = 0; i < n; i++) cout << res[i] << ; cout << endl; } } int main() { int K; scanf( %d , &K); while (K--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 9; struct Node { double st, ed, dir; } p[N]; struct flag { double num, id; } q[N]; bool cmp(flag a, flag b) { return a.num < b.num; } int main() { int n, m, i, j, k; while (~scanf( %d , &n)) { for (i = 0; i < n; ++i) { scanf( %lf%lf , &p[i].st, &p[i].dir); } double L = 0, R = 1e9 + 10, mid, ans = -1; for (j = 0; j < 100; ++j) { mid = (L + R) / 2; bool ok = false; double Max = -1e50; for (i = 0; i < n; ++i) { p[i].ed = p[i].st + p[i].dir * mid; if (p[i].dir >= 0) { Max = max(Max, p[i].ed); } else { if (p[i].ed <= Max) { ok = true; break; } } } if (ok) { ans = mid; R = mid; } else { L = mid; } } printf( %.20f n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 200020; long long a; int main() { cin >> a; long long l = 1, r = 1e18; long long ans = (((9 * (5 * (9 * (2 * (long long)1e17) % a) % a) % a) % a) + 1) % a; cout << l + (a - ans) << << r + (a - ans) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int task; scanf( %d , &task); while (task--) { int n, p; scanf( %d%d , &n, &p); int rest(2 * n + p); for (int i = 1; (i <= n) && rest; i++) for (int j = i + 1; (j <= n) && rest; j++) printf( %d %d n , i, j), rest--; } return 0; }
#include <bits/stdc++.h> const long long max9 = 10 + 1e9, max6 = 10 + 1e6, max12 = 10 + 1e12, max15 = 10 + 1e15; const long long min6 = -1 * max6, min9 = -1 * max9, min12 = -1 * max12, min15 = -1 * max15; const long long R = 7 + 1e9, NN = 10 + 1e5; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; long long k; cin >> n >> k; long long mn = n * (n + 1); mn /= 2; long long nn = n / 2 - 1, mx = 2 * (nn + 1) * n - nn * (nn + 1); if (n % 2) mx += nn + 2; if (k < mn) { cout << -1; return 0; } if (k >= mx) { cout << mx << endl; for (int i = (0); i < (n); ++i) cout << i + 1 << ; cout << endl; for (int i = (0); i < (n); ++i) cout << n - i << ; return 0; } vector<int> a(n); long long l = 0, last = n; for (int i = (0); i < (n); ++i) a[i] = i + 1; long long ben = k - mn; for (int i = (0); i < (n / 2); ++i) { if (ben == 0) break; long long test = a[i] + ben; if (test > last) { a[i] = last; a[last - 1] = i + 1; ben -= last - i - 1; last--; } else { a[i] = test; a[test - 1] = i + 1; break; } } long long sum = 0; for (int i = (0); i < (n); ++i) sum += max(i + 1, a[i]); cout << sum << endl; for (int i = (0); i < (n); ++i) cout << i + 1 << ; cout << endl; for (int i = (0); i < (n); ++i) cout << a[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:167772160 ) int comp(const void* a, const void* b) { return (*(long long*)a) - (*(long long*)b); } int main() { int n; long long mas[300000], ans(0); scanf( %d , &n); for (int i(0); i < n; ++i) scanf( %I64d , &mas[i]); qsort(mas, n, sizeof(long long), comp); for (int i(0); i < n; ++i) ans += mas[i] * (2 + i); ans -= mas[n - 1]; printf( %I64d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; char s[105]; int main() { int n, m, i, l, r; char ch1, ch2; cin >> n >> m; cin >> (s + 1); while (m--) { cin >> l >> r >> ch1 >> ch2; for (i = l; i <= r; i++) if (s[i] == ch1) s[i] = ch2; } cout << (s + 1); return 0; }
#include <bits/stdc++.h> using namespace std; string a[100], b[100]; map<string, int> m; int n, s; int main(void) { scanf( %d , &n); for (int i = 0; i < n; i++) { cin >> a[i]; m[a[i]]++; } for (int i = 0; i < n; i++) { cin >> b[i]; m[b[i]]--; } s += abs(m[ S ]); s += abs(m[ M ]); s += abs(m[ L ]); s += abs(m[ XS ]); s += abs(m[ XXS ]); s += abs(m[ XXXS ]); s += abs(m[ XL ]); s += abs(m[ XXL ]); s += abs(m[ XXXL ]); cout << s / 2; return 0; }