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; int n, m, Q, ans[100005], t[265000]; vector<int> v[100005]; vector<pair<int, int> > vq[100005]; void build(int k, int l, int r) { t[k] = 1e9; if (l == r) return; int mid = (l + r) / 2; build(k * 2, l, mid); build(k * 2 + 1, mid + 1, r); } void pushdown(int k) { t[k * 2] = min(t[k * 2], t[k]); t[k * 2 + 1] = min(t[k * 2 + 1], t[k]); } void change(int k, int l, int r, int x, int y, int v) { if (t[k] <= v) return; if (l == x && r == y) { t[k] = v; return; } int mid = (l + r) / 2; pushdown(k); if (y <= mid) change(k * 2, l, mid, x, y, v); else if (x > mid) change(k * 2 + 1, mid + 1, r, x, y, v); else change(k * 2, l, mid, x, mid, v), change(k * 2 + 1, mid + 1, r, mid + 1, y, v); t[k] = max(t[k * 2], t[k * 2 + 1]); } int ask(int k, int l, int r, int p, int v) { if (t[k] <= v) return -1; if (p <= l) { for (; l < r;) { int mid = (l + r) / 2; pushdown(k); k *= 2; if (t[k] > v) r = mid; else l = mid + 1, k++; } return l; } int mid = (l + r) / 2; int tmp = -1; if (p <= mid) tmp = ask(k * 2, l, mid, p, v); if (tmp != -1) return tmp; return ask(k * 2 + 1, mid + 1, r, p, v); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); if (x < y) v[x].push_back(y); } scanf( %d , &Q); for (int i = 1; i <= Q; i++) { int x, y; scanf( %d%d , &x, &y); vq[x].push_back(make_pair(y, i)); } build(1, 1, n); for (int i = n; i; i--) { for (int j = 0; j < v[i].size(); j++) change(1, 1, n, i, v[i][j] - 1, v[i][j]); for (int j = 0; j < vq[i].size(); j++) ans[vq[i][j].second] = ask(1, 1, n, i, vq[i][j].first); } for (int i = 1; i <= Q; i++) printf( %d n , ans[i]); }
#include <bits/stdc++.h> using namespace std; long long int n, m; vector<long long int> ar[100001]; vector<long long int> res[2]; long long int vis[100001]; long long int col[100001]; bool dfs(long long int node, long long int c) { vis[node] = 1; res[c].push_back(node); col[node] = c; for (long long int child : ar[node]) { if (vis[child] == 0) { if (dfs(child, c ^ 1) == false) return false; } else if (col[node] == col[child]) return false; } return true; } void solve() { long long int test = 1; while (test--) { cin >> n >> m; while (m--) { long long int a, b; cin >> a >> b; ar[a].push_back(b); ar[b].push_back(a); } long long int count = 1; vector<long long int> von; memset(vis, 0, sizeof(vis)); for (long long int i = 1; i <= n; i++) { if (vis[i] == 0) { if (ar[i].empty()) continue; if (dfs(i, 0) == false) { cout << -1 << endl; return; } } } for (long long int i = 0; i < 2; i++) { cout << res[i].size() << endl; for (auto x : res[i]) cout << x << ; cout << endl; } } return; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0 || b == 0) return a + b; if (a < b) return gcd(b % a, a); return gcd(a % b, b); } int a[111]; int main() { int n; cin >> n; int g = 0, max = 0; for (int i = 0; i < n; i++) { cin >> a[i]; g = gcd(g, a[i]); if (max < a[i]) max = a[i]; } for (int i = 0; i < n; i++) { a[i] /= g; } max /= g; int moves = max - n; if (moves % 2) cout << Alice ; else cout << Bob ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; vector<long long> p; int main() { int n, q; cin >> n >> q; string s; cin >> s; p.resize(1e5 + 1); p[0] = 1; for (int i = 1; i <= 1e5; i++) { p[i] = (p[i - 1] * 2) % MOD; } vector<long long> kum(n + 1); kum[0] = 0; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { kum[i + 1] = kum[i] + 1; } else { kum[i + 1] = kum[i]; } } for (int i = 0; i < q; i++) { int l, r; cin >> l >> r; long long kol_1 = kum[r] - kum[l - 1]; long long kol_0 = r - l + 1 - kol_1; long long ans_1 = p[kol_1] - 1; long long ans_0 = ans_1 * (p[kol_0] - 1); cout << (ans_1 + ans_0) % MOD << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; priority_queue<int> a, b; int c = 0; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; a.push(x); } cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; b.push(x); } while (!b.empty() && !a.empty()) { if (abs(a.top() - b.top()) < 2) { c++; a.pop(); b.pop(); continue; } if (a.top() > b.top()) a.pop(); else b.pop(); } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; vector<long long> v; int n, k; bool check(long long m) { long long sum = 0; for (int i = n / 2; i < n; i++) { sum += max(m - v[i], 0ll); } if (sum <= k) { return true; } return false; } int main() { cin >> n >> k; v.resize(n); for (int i = 0; i < n; i++) { cin >> v[i]; } sort(v.begin(), v.end()); long long l = v[n / 2]; long long r = 1e10; while (l + 1 < r) { long long m = (l + r) / 2; if (check(m)) { l = m; } else { r = m; } } cout << l; return 0; }
#include <bits/stdc++.h> using namespace std; void reverseStr(string& str); void reverseQueue(queue<int>& Queue); void print_queue(queue<int>& q); int n, a[250], sum, num; int main() { cin >> n; for (int i = 0; i < n * 2; i++) cin >> a[i]; for (int i = 0; i < n * 2; i++) { for (int j = i + 2; j < n * 2; j++) { if (a[i] == a[j]) { sum += j - i - 1; for (int l = j; l > i; l--) { swap(a[l], a[l - 1]); } } } } cout << sum; } void reverseStr(string& str) { int n = str.length(); for (int i = 0; i < n / 2; i++) swap(str[i], str[n - i - 1]); } void reverseQueue(queue<int>& Queue) { stack<int> Stack; while (!Queue.empty()) { Stack.push(Queue.front()); Queue.pop(); } while (!Stack.empty()) { Queue.push(Stack.top()); Stack.pop(); } } void print_queue(queue<int>& q) { while (!q.empty()) { cout << q.front() << ; q.pop(); } cout << endl; }
#include <bits/stdc++.h> using namespace std; const int MX = 1e5 + 7; vector<long long> v[MX]; bool vis[MX]; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long n; cin >> n; pair<long long, long long> p[n]; for (long long i = 0; i < n; i++) cin >> p[i].first >> p[i].second; long double l = 0, r = 1e10; for (long long i = 0; i < 100; i++) { long long cnt; long double mid = (l + r) / 2, d = -1e20; for (cnt = 0; cnt < n; cnt++) { if (p[cnt].second > 0) d = max(d, p[cnt].first + mid * p[cnt].second); else if (p[cnt].first + mid * p[cnt].second <= d) break; } if (cnt < n) r = mid; else l = mid; } if (r == 1e10) cout << -1; else cout << fixed << setprecision(18) << l; }
#include <bits/stdc++.h> using namespace std; int t, ans, tot, pus, a, b, c, d; int main() { register int i; scanf( %d , &t); while (t--) { scanf( %d%d%d%d , &a, &b, &c, &d); ans = a * (b - d - 1); ans = ((ans) > (a * d) ? (ans) : (a * d)); ans = ((ans) > (b * (a - c - 1)) ? (ans) : (b * (a - c - 1))); ans = ((ans) > (b * c) ? (ans) : (b * c)); printf( %d n , ans); } }
#include <bits/stdc++.h> using namespace std; vector<int> factor[100001]; void precal() { for (int i = (1); i < (100001); ++i) for (int j = (i); j < (100001); j += (i)) factor[j].push_back(i); } int expo(int a, int b) { if (b == 0) return 1; if (b == 1) return a % 1000000007; int c = expo(a, b >> 1); c = ((long long)c * c) % 1000000007; if (b & 1) c = ((long long)c * a) % 1000000007; return c; } int main(int argc, char **argv) { int N; scanf( %d , &N); vector<int> A(N); for (int i = (0); i < (N); ++i) scanf( %d , &A[i]); sort(A.begin(), A.end()); precal(); int res = 0; for (int f = (1); f < (100001); ++f) { int numFactor = factor[f].size(); int bound[numFactor]; int cur = 0; for (int i = (0); i < (numFactor); ++i) { int lo = cur, hi = N - 1; int nextFactor = (i + 1 == numFactor) ? (1 << 29) : factor[f][i + 1]; while (lo <= hi) { int mi = (lo + hi) / 2; if (A[mi] >= nextFactor) hi = mi - 1; else lo = mi + 1; } bound[i] = lo - cur; cur = lo; } if (!bound[numFactor - 1]) continue; int countWays = 1; for (int i = (0); i < (numFactor - 1); ++i) countWays = ((long long)countWays * expo(i + 1, bound[i])) % 1000000007; countWays = ((long long)countWays * (((long long)expo(numFactor, bound[numFactor - 1]) + 1000000007 - expo(numFactor - 1, bound[numFactor - 1])) % 1000000007)) % 1000000007; res = (res + countWays) % 1000000007; } cout << res; return 0; }
#include <bits/stdc++.h> using namespace std; struct inf { long long t, w; }; struct djk { long long n, v; bool operator>(const djk &i) const { return v < i.v; } bool operator<(const djk &i) const { return v > i.v; } } n; struct edge { long long n1, n2, t; bool operator<(const edge &i) const { return t < i.t; } }; long long nodes, edges, n1, n2, weight, nn, totes, p1, p2, ports; long long isp[100005], cp[100005], pd[100005], rnk[100005], head[100005]; edge elist[100005]; vector<inf> nlist[100005]; priority_queue<djk> viser; long long ufind(long long n) { if (head[n] != n) head[n] = ufind(head[n]); return head[n]; } void uni(long long n1, long long n2) { p1 = ufind(n1); p2 = ufind(n2); if (rnk[p1] > rnk[p2]) head[p1] = p2; else if (rnk[p2] > rnk[p1]) head[p2] = p1; else head[p1] = p2, rnk[p1]++; } int main() { scanf( %I64d%I64d , &nodes, &edges); for (int i = 1; i <= nodes; i++) pd[i] = -1, head[i] = i, rnk[i] = 1; for (int i = 1; i <= edges; i++) { scanf( %I64d%I64d%I64d , &n1, &n2, &weight); nlist[n1].push_back({n2, weight}); nlist[n2].push_back({n1, weight}); elist[i] = {n1, n2, weight}; } scanf( %I64d , &ports); for (int i = 1; i <= ports; i++) { scanf( %I64d , &n1); isp[n1] = 1; viser.push({n1, 0}); pd[n1] = 0; cp[n1] = n1; } while (!viser.empty()) { n = viser.top(); viser.pop(); if (pd[n.n] > n.v) continue; for (int i = 0; i < nlist[n.n].size(); i++) { nn = nlist[n.n][i].t; if (pd[nn] == -1 || pd[nn] > nlist[n.n][i].w + pd[n.n]) { pd[nn] = nlist[n.n][i].w + pd[n.n]; cp[nn] = cp[n.n]; viser.push({nn, pd[nn]}); } } } for (int i = 1; i <= edges; i++) elist[i].t += pd[elist[i].n1] + pd[elist[i].n2]; sort(elist + 1, elist + 1 + edges); for (int i = 1; i <= edges; i++) { if (ufind(cp[elist[i].n1]) != ufind(cp[elist[i].n2])) { uni(cp[elist[i].n1], cp[elist[i].n2]); totes += elist[i].t; } } if (!isp[1] && pd[1] != -1) totes += pd[1]; printf( %I64d n , totes); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 55; const int INF = 1 << 20; bool dp1[MAXN][MAXN][26] = {false}; bool dp2[MAXN][MAXN][26] = {false}; int dp[MAXN][MAXN]; char s1[MAXN], s2[MAXN]; string tr[MAXN]; int n; void cal(char* s, bool f[MAXN][MAXN][26]) { int len = strlen(s); for (int i = 0; i < len; i++) { f[i][i][s[i] - a ] = true; } for (int L = 1; L <= len; L++) { for (int i = 0; i + L - 1 < len; i++) { int j = i + L - 1; for (int k = i; k < j; k++) { for (int c = 0; c < n; c++) { if (f[i][k][tr[c][3] - a ] && f[k + 1][j][tr[c][4] - a ]) { f[i][j][tr[c][0] - a ] = true; } } } } } } int main() { cin >> s1 >> s2; cin >> n; for (int i = 0; i < n; i++) { cin >> tr[i]; } cal(s1, dp1); cal(s2, dp2); int len1 = strlen(s1); int len2 = strlen(s2); for (int i = 0; i <= len1; i++) for (int j = 0; j <= len2; j++) dp[i][j] = INF; dp[0][0] = 0; for (int i = 0; i < len1; i++) for (int ii = i; ii < len1; ii++) for (int c = 0; c < 26; c++) if (dp1[i][ii][c]) for (int j = 0; j < len2; j++) for (int jj = j; jj < len2; jj++) if (dp2[j][jj][c]) dp[ii + 1][jj + 1] = min(dp[ii + 1][jj + 1], dp[i][j] + 1); int ans = (dp[len1][len2] == INF ? -1 : dp[len1][len2]); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; void c_p_c() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long me(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int main() { c_p_c(); long long t; cin >> t; while (t--) { long long n; cin >> n; long long a[n]; long long b[n]; for (long long i = 0; i < n; i++) cin >> a[i]; for (long long i = 0; i < n; i++) cin >> b[i]; long long c[n]; multiset<long long> s; long long l = 0; vector<long long> v; long long g = 0; long long temp = 0; long long g1 = 0; for (long long i = 0; i < n; i++) { c[i] = b[i] - a[i]; if (c[i] == 0 && g1 == 1) { break; } if (c[i] < 0) { cout << NO n ; l = 1; break; } if (c[i] != 0 && (temp == c[i] || g == 0)) { a[i] = a[i] + c[i]; temp = c[i]; g = 1; g1 = 1; } } if (l == 1) { continue; } long long flg = 0; for (long long i = 0; i < n; i++) { if (a[i] != b[i]) { flg = 1; break; } } if (flg == 1) { cout << NO n ; } else { cout << YES n ; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t, n, k, c = 0, d = 0; cin >> n >> k; map<long long, long long> m; for (int i = 0; i < n; ++i) { cin >> t; m[t]++; } auto it2 = m.begin(); for (auto it = m.begin(); it != m.end(); ++it) { it2 = it; it2++; t = it->first; if (it2 == m.end()) { c += it->second; break; } d = it2->first; if (t + k < d) c += it->second; } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T a) { return a * a; } int n; int a[21000]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int best = -1000000000; for (int i = 3; i <= n; i++) if (n % i == 0) { int g = n / i; for (int j = 0; j < g; j++) { int cur = 0; for (int k = j; k < n; k += g) cur += a[k]; best = max(cur, best); } } cout << best; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFL = 0x3f3f3f3f3f3f3f3fLL; struct Edge { int src, dst; int weight; Edge(int src_, int dst_, int weight_) : src(src_), dst(dst_), weight(weight_) {} Edge(int dst_, int weight_) : src(-2), dst(dst_), weight(weight_) {} }; bool operator<(const Edge &e, const Edge &f) { return e.weight != f.weight ? e.weight > f.weight : e.dst < f.dst; } void dijkstra(const vector<vector<Edge> > &g, int start, vector<int> &dist) { int n = g.size(); dist.assign(n, INF); dist[start] = 0; vector<int> prev(n, -1); priority_queue<Edge> q; for (q.push(Edge(-2, start, 0)); !q.empty();) { Edge e = q.top(); q.pop(); if (prev[e.dst] != -1) continue; prev[e.dst] = e.src; for (typeof((g[e.dst]).begin()) f = ((g[e.dst]).begin()); f != (g[e.dst]).end(); ++f) { if (dist[f->dst] > e.weight + f->weight) { dist[f->dst] = e.weight + f->weight; q.push(Edge(f->src, f->dst, e.weight + f->weight)); } } } } int main() { int n; int x0, y0, x1, y1; vector<pair<int, pair<int, int> > > v; cin >> y0 >> x0 >> y1 >> x1; cin >> n; for (int(i) = 0; (i) < (int)(n); ++(i)) { int o, a, b; cin >> o >> a >> b; v.push_back(make_pair((o), (make_pair((a), (b))))); } sort((v).begin(), (v).end()); map<pair<int, int>, int> m; int t = 0; static const int dy[4] = {0, -1, -1, -1}, dx[4] = {-1, 0, -1, 1}; vector<vector<Edge> > g; for (typeof((v).begin()) i = ((v).begin()); i != (v).end(); ++i) { for (int(j) = (int)(i->second.first); (j) <= (int)(i->second.second); ++(j)) { if (m.count(make_pair((i->first), (j)))) continue; int q = m[make_pair((i->first), (j))] = t++; g.push_back(vector<Edge>()); for (int(d) = 0; (d) < (int)(4); ++(d)) if (m.count(make_pair((i->first + dy[d]), (j + dx[d])))) { g[q].push_back( Edge(q, m[make_pair((i->first + dy[d]), (j + dx[d]))], 1)); } } } vector<vector<Edge> > gg(t); for (int(i) = 0; (i) < (int)(t); ++(i)) for (typeof((g[i]).begin()) j = ((g[i]).begin()); j != (g[i]).end(); ++j) { gg[j->src].push_back(Edge(j->src, j->dst, 1)); gg[j->dst].push_back(Edge(j->dst, j->src, 1)); } int r = -1; if (!m.count(make_pair((y0), (x0)))) r = -999; else if (!m.count(make_pair((y1), (x1)))) r = -999; else { vector<int> d; dijkstra(gg, m[make_pair((y0), (x0))], d); r = d[m[make_pair((y1), (x1))]]; if (r == INF) r = -1; } cout << r << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << [ << *it << = << a << ] ; err(++it, args...); } template <typename Tk, typename Tv> ostream& operator<<(ostream& os, const pair<Tk, Tv>& p) { os << { << p.first << , << p.second << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& p) { os << [ ; for (T x : p) os << x << ; os << ] << n ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& p) { os << { ; for (T x : p) os << x << ; os << } << n ; return os; } template <typename Tk, typename Tv> ostream& operator<<(ostream& os, const map<Tk, Tv>& p) { os << { ; for (pair<Tk, Tv> x : p) os << x << ; os << } << n ; return os; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t = 1; cin >> t; while (t--) { long long int n, k, l; cin >> n >> k >> l; vector<long long int> depth(n), time(2 * k); for (long long int i = 0; i <= k; i++) { time[i] = i; } long long int ct = 1; for (long long int i = 0; i < n; i++) { cin >> depth[i]; } for (long long int i = k - 1; i > 0; i--) { time[k + (ct++)] = i; } bool dp[2 * k][n]; memset(dp, false, sizeof(dp)); for (long long int i = 0; i < 2 * k; i++) { if (depth[0] + time[i] <= l) { dp[i][0] = true; } } for (long long int i = 0; i < n - 1; i++) { if (depth[i] + k <= l) { if (i == 0) { for (long long int j = 0; j < 2 * k; j++) { dp[j][i] = true; } } else { bool find_true = false; for (long long int j = 0; j < 2 * k; j++) { if (dp[j][i]) { find_true = true; } } if (find_true) { for (long long int j = 0; j < 2 * k; j++) { dp[j][i] = true; } } } } for (long long int j = 0; j < 2 * k; j++) { if (dp[j][i] && (depth[i + 1] + (long long int)time[(j + 1) % (2 * k)] <= l)) { dp[(j + 1) % (2 * k)][i + 1] = true; } } } bool pass = false; for (long long int i = 0; i < 2 * k; i++) { if (dp[i][n - 1]) { pass = true; break; } } cout << (pass ? YES n : NO n ); } return 0; }
#include <bits/stdc++.h> int max(int a, int b) { if (a > b) return a; return b; } int min(int a, int b) { if (a < b) return a; else return b; } char s1[600000], s2[600000]; int z[600000], y[600000]; struct student { int l; int r; } a[600000]; int main() { int i; int n, m, p; int j; scanf( %d%d%d , &n, &m, &p); for (i = 0; i <= n + 1; i++) { a[i].l = i - 1; a[i].r = i + 1; } getchar(); gets(s1 + 1); gets(s2 + 1); int num = 0; int len = strlen(s1 + 1); for (i = 1; i <= len; i++) { if (s1[i] == ( ) z[num++] = i; else { y[z[--num]] = i; y[i] = z[num]; } } len = strlen(s2 + 1); for (i = 1; i <= len; i++) { if (s2[i] == R ) p = a[p].r; else if (s2[i] == L ) p = a[p].l; else { a[a[max(p, y[p])].r].l = a[min(p, y[p])].l; a[a[min(p, y[p])].l].r = a[max(p, y[p])].r; a[min(p, y[p])].r = a[max(p, y[p])].r; p = a[p].r; } if (p < 1) p = a[p].r; if (p > n) p = a[p].l; } for (i = a[0].r; i <= n; i = a[i].r) { printf( %c , s1[i]); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; const int sieve_size = 5e6; void solve() { int n; cin >> n; vector<int> a(n); for (int &x : a) cin >> x; vector<int> primes; vector<bool> sieve(sieve_size); for (int i = 2; i < int((sieve).size()); i++) { if (sieve[i]) continue; primes.push_back(i); for (int j = i + i; j < int((sieve).size()); j += i) { sieve[j] = true; } } auto get_decomp = [](int x) { vector<int> decomp; for (int j = 2; j * j <= x; j++) { if (x % j == 0) { decomp.push_back(j); x /= j; while (x % j == 0) x /= j; } } if (x != 1) decomp.push_back(x); return decomp; }; set<int> occupied_primes; vector<int> b(n); bool a_coprime = true; for (int i = 0, primes_idx = 0; i < n; i++) { if (a_coprime) { vector<int> decomp = get_decomp(a[i]); for (int x : decomp) { if (occupied_primes.count(x)) { a_coprime = false; break; } } if (!a_coprime) { for (a[i]++;; a[i]++) { decomp = get_decomp(a[i]); bool ok = true; for (int x : decomp) { if (occupied_primes.count(x)) { ok = false; break; } } if (ok) break; } } for (int x : decomp) occupied_primes.insert(x); b[i] = a[i]; } else { while (occupied_primes.count(primes[primes_idx])) primes_idx++; b[i] = primes[primes_idx++]; } } for (int x : b) cout << x << ; } int main() { ios::sync_with_stdio(0), cin.tie(0); int tcs = 1; for (int tc = 1; tc <= tcs; tc++) { solve(); } }
#include <bits/stdc++.h> using namespace std; long long n, h; long long l[200010], r[200010]; long long dsum[200010], rsum[200010]; int main() { scanf( %lld%lld , &n, &h); for (long long i = (long long)(0); i < (long long)(n); i++) scanf( %lld%lld , l + i, r + i); for (long long i = (long long)(0); i < (long long)(n - 1); i++) dsum[i + 1] = dsum[i] + l[i + 1] - r[i]; for (long long i = (long long)(0); i < (long long)(n); i++) rsum[i + 1] = rsum[i] + r[i] - l[i]; long long res = h; for (long long i = (long long)(0); i < (long long)(n - 1); i++) { long long lb = 0, ub = n; while (ub - lb > 1) { long long mid = (lb + ub) / 2; if (dsum[mid] - dsum[i] < h) lb = mid; else ub = mid; } res = (res > h + rsum[ub] - rsum[i] ? res : h + rsum[ub] - rsum[i]); } res = (res > h + r[n - 1] - l[n - 1] ? res : h + r[n - 1] - l[n - 1]); cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; struct Act { int l, r; int mx; double pb; vector<Act *> son; static int dp_size; double dp[5005]; bool operator<(const Act &act) const { if (l < act.l) { return true; } else if (l > act.l) { return false; } else if (r > act.r) { return true; } return false; } bool contains(Act &act) { return act.l >= l && act.r <= r; } double p(int profit) { if (profit < 0) return 0.0; if (profit > dp_size) return 1.0; return dp[profit]; } }; int Act::dp_size = 0; int n, q; int *a; int **m; int *lg; Act act[5005]; void dfs(Act &act) { for (int i = 0; i < act.son.size(); i++) { dfs(*act.son[i]); } for (int i = 0; i <= Act::dp_size; i++) { act.dp[i] = 0.0; } for (int i = 0; i <= Act::dp_size; i++) { double p = (i == 0 ? 0.0 : act.pb); double np = 1.0 - act.pb; for (int j = 0; j < act.son.size(); j++) { Act *son = act.son[j]; p *= son->p(act.mx - son->mx + i - 1); np *= son->p(act.mx - son->mx + i); } act.dp[i] = p + np; } } int main() { cin >> n >> q; a = new int[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } lg = new int[n + 1]; lg[1] = 0; for (int i = 2; i <= n; i++) { lg[i] = lg[i / 2] + 1; } m = new int *[lg[n] + 1]; for (int i = 0; i <= lg[n]; i++) { m[i] = new int[n]; } for (int i = 0; i < n; i++) { m[0][i] = a[i]; } for (int i = 1; i <= lg[n]; i++) { int psz = 1 << (i - 1); int nsz = 1 << i; for (int j = 0; j + nsz <= n; j++) { m[i][j] = max(m[i - 1][j], m[i - 1][j + psz]); } } q++; for (int i = 0; i < q; i++) { if (i == q - 1) { act[i].l = 1; act[i].r = n; act[i].pb = 0.0; } else { cin >> act[i].l >> act[i].r >> act[i].pb; } act[i].l--, act[i].r--; int tlg = lg[act[i].r - act[i].l + 1]; int tsz = 1 << tlg; act[i].mx = max(m[tlg][act[i].l], m[tlg][act[i].r - tsz + 1]); } sort(act, act + q); Act::dp_size = q; for (int i = 1; i < q; i++) { int j = i - 1; while (!act[j].contains(act[i])) j--; act[j].son.push_back(act + i); } dfs(act[0]); double ans = 0.0; for (int i = 0; i <= Act::dp_size; i++) { ans += (act[0].mx + i) * (act[0].p(i) - act[0].p(i - 1)); } printf( %.8lf , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long i, j, k, l, n, a, b, ans = 0; int gcd(int a, int b) { if (a < b) swap(a, b); return (b == 0) ? a : gcd(b, a % b); } struct st { int first; long double second; }; int main() { std::ios_base::sync_with_stdio(0); string s; cin >> s; n = s.size(); list<int> left, right; j = 0; for (auto i : s) { if (i == l ) { left.push_front(++j); } else { right.push_front(++j); } } reverse(right.begin(), right.end()); for (auto i : right) cout << i << n ; for (auto i : left) cout << i << n ; fflush(stdin); return 0; }
#include <bits/stdc++.h> using namespace std; template <class _T> inline _T sqr(const _T &x) { return x * x; } template <class _T> inline string tostr(const _T &a) { ostringstream os( ); os << a; return os.str(); } const long double PI = 3.1415926535897932384626433832795; const long double EPS = 1e-11; const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, -1, 0, 1}; int n, m; int a[2024][2024]; bool u[2024][2024]; int u2[2024][2024]; bool u3[2024][2024]; int d[2024][2024]; int q[2024 * 2024][2]; int e[1024000]; void bfs(int x, int y, signed long long &sx, signed long long &sy, int &s) { int qb = 0, qe = 0; s = 1; sx = x; sy = y; u[x][y] = true; q[qe][0] = x; q[qe][1] = y; qe++; while (qb != qe) { x = q[qb][0]; y = q[qb][1]; qb++; for (int l = 0; l < (int)(4); l++) { int xn = x + dx[l]; int yn = y + dy[l]; if (xn < 0 || xn >= n || yn < 0 || yn >= m || !a[xn][yn] || u[xn][yn]) continue; u[xn][yn] = true; q[qe][0] = xn; q[qe][1] = yn; sx += xn; sy += yn; s++; qe++; } } } int bfs2(int x, int y, int col) { if (!a[x][y]) for (;;) ; int qb = 0, qe = 0; u2[x][y] = col; d[x][y] = 0; q[qe][0] = x; q[qe][1] = y; qe++; while (qb != qe) { x = q[qb][0]; y = q[qb][1]; qb++; for (int l = 0; l < (int)(4); l++) { int xn = x + dx[l]; int yn = y + dy[l]; if (xn < 0 || xn >= n || yn < 0 || yn >= m || !a[xn][yn] || u2[xn][yn]) continue; d[xn][yn] = d[x][y] + 1; u2[xn][yn] = col; q[qe][0] = xn; q[qe][1] = yn; qe++; } } return qe; } int main() { cout << setiosflags(ios::fixed) << setprecision(10); scanf( %d%d , &n, &m); for (int i = 0; i < (int)(n); i++) { for (int j = 0; j < (int)(m); j++) { scanf( %d , &a[i][j]); } } int cnt = 0; memset((u), 0, sizeof(u)); memset((u2), 0, sizeof(u2)); memset((u3), 0, sizeof(u3)); for (int i = 0; i < (int)(n); i++) { for (int j = 0; j < (int)(m); j++) { if (a[i][j] && !u[i][j]) { signed long long xs, ys; int s; bfs(i, j, xs, ys, s); int t = bfs2(xs / s, ys / s, cnt + 1); int z = 0; for (int k = 0; k < (int)(t); k++) { int x = q[k][0]; int y = q[k][1]; bool bb = false; for (int l = 0; l < (int)(4); l++) { int xn = x + dx[l]; int yn = y + dy[l]; if (xn < 0 || xn >= n || yn < 0 || yn >= m || !a[xn][yn]) continue; if (d[xn][yn] > d[x][y]) bb = true; } if (!u3[x][y] && bb) { int w = 0; for (int di = (-4); di <= (int)(4); di++) { for (int dj = (-4); dj <= (int)(4); dj++) { int xn = x + di; int yn = y + dj; if (xn < 0 || xn >= n || yn < 0 || yn >= m || !a[xn][yn] || u2[xn][yn] != cnt + 1) continue; w++; } } if (w < 27) { z++; for (int di = (-4); di <= (int)(4); di++) { for (int dj = (-4); dj <= (int)(4); dj++) { int xn = x + di; int yn = y + dj; if (xn < 0 || xn >= n || yn < 0 || yn >= m || !a[xn][yn] || u3[xn][yn]) continue; u3[xn][yn] = true; } } } } } e[cnt] = z; cnt++; } } } printf( %d n , cnt); sort(e, e + cnt); for (int i = 0; i < (int)(cnt); i++) { if (i) putchar( ); printf( %d , e[i]); } puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; long long a[105], ans, n; int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); ans += a[i] * i; } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> int main() { int n, q; std::cin >> n >> q; int ans[q], servers[n], server; for (server = 0; server < n; ++server) { servers[server] = 0; } int index, t, k, d, planner[n]; for (int i = 0; i < q; ++i) { server = 0; index = 0; std::cin >> t >> k >> d; while (index < k && server < n) { if (servers[server] <= t) { planner[index++] = server; servers[server] = t; } ++server; } if (index == k) { ans[i] = k; for (index = 0; index < k; ++index) { ans[i] += planner[index]; servers[planner[index]] += d; } } else { ans[i] = -1; } } for (int a : ans) { std::cout << a << std::endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); vector<int> sml, big; for (int i = 1, j = n; i < j; i++, j--) { printf( ? %d %d n , i, j); fflush(stdout); char c[5]; scanf( %s , c); if (c[0] == < ) { sml.push_back(i); big.push_back(j); } if (c[0] == > ) { sml.push_back(j); big.push_back(i); } if (c[0] == = ) { sml.push_back(i); big.push_back(j); } } if (n % 2) { big.push_back(ceil(n / 2.0)); sml.push_back(ceil(n / 2.0)); } int mn = sml[0]; for (int i = 1; i < sml.size(); i++) { printf( ? %d %d n , mn, sml[i]); fflush(stdout); char c[5]; scanf( %s , c); if (c[0] == > ) { mn = sml[i]; } } int mx = big[0]; for (int i = 1; i < big.size(); i++) { printf( ? %d %d n , mx, big[i]); fflush(stdout); char c[5]; scanf( %s , c); if (c[0] == < ) { mx = big[i]; } } printf( ! %d %d n , mn, mx); fflush(stdout); } }
#include <bits/stdc++.h> using namespace std; int mpow(int base, int exp); void ipgraph(int m); void dfs(int u, int par); const long long mod = 1000000007 * 1LL * 1000000007; const int N = 1e6 + 3, M = N; vector<int> g[N]; int a[N]; long long h[N], val[N]; vector<pair<int, int> > E; long long r() { return rand() * 32000 + rand(); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i, n, k, j, m; cin >> n >> m; srand(1234); for (i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1; 1 < n + 1 ? i += 1 : i -= 1) h[i] = (r() * r() + r() + r()) % mod; ipgraph(m); long long ans = 0; for (pair<int, int> e : E) { int u = e.first, v = e.second; val[u] = (val[u] + mod - h[v]) % mod; val[v] = (val[v] + mod - h[u]) % mod; ans += val[u] == val[v]; val[u] = (val[u] + h[v]) % mod; val[v] = (val[v] + h[u]) % mod; } vector<long long> fin; for (i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1; 1 < n + 1 ? i += 1 : i -= 1) fin.push_back(val[i]); sort(fin.begin(), fin.end()); long long c = 1; for (i = 1; 1 < fin.size() ? i < fin.size() : i > fin.size(); 1 < fin.size() ? i += 1 : i -= 1) { if (fin[i] == fin[i - 1]) c++; else ans += c * (c - 1) / 2, c = 1; } ans += c * (c - 1) / 2; cout << ans << endl; return 0; } int mpow(int base, int exp) { base %= mod; int result = 1; while (exp > 0) { if (exp & 1) result = ((long long)result * base) % mod; base = ((long long)base * base) % mod; exp >>= 1; } return result; } void ipgraph(int m) { int i, u, v; for (i = 0; i < m; i++) { cin >> u >> v; val[u] = (val[u] + h[v]) % mod; val[v] = (h[u] + val[v]) % mod; E.push_back({u, v}); u++, v++; g[u - 1].push_back(v - 1); g[v - 1].push_back(u - 1); } } void dfs(int u, int par) { for (int v : g[u]) { if (v == par) continue; dfs(v, u); } }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; int card_to_person = n / k; if (card_to_person >= m) { cout << m << n ; continue; } int tmp = (m - card_to_person) / (k - 1); if ((m - card_to_person) % (k - 1) != 0) { tmp++; } cout << card_to_person - tmp << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000005; int N; vector<int> G[MAX_N]; int cyid[MAX_N], Q[MAX_N]; vector<vector<int>> cycles, newcycles; void find_cycle(int s, int curid) { cyid[s] = curid; cycles.back().push_back(s); for (int i = 0; i < G[s].size(); i++) { if (cyid[G[s][i]] == -1) { find_cycle(G[s][i], curid); } } } void get_cycles() { fill(cyid + 1, cyid + N + 1, -1); int nCycles = 0; for (int i = 1; i <= N; i++) { if (cyid[i] == -1) { cycles.push_back(vector<int>()); find_cycle(i, ++nCycles); } } } void construct_root_permutation() { int numEven = 0, numOdd = 0; for (vector<int> p : cycles) { if (p.size() % 2 == 0) numEven++; else numOdd++; } if (numEven % 2 == 1) { printf( -1 n ); return; } sort(cycles.begin(), cycles.end(), [](vector<int> a, vector<int> b) { return a.size() < b.size(); }); for (int i = 0; i < cycles.size();) { if (cycles[i].size() % 2 == 1) { if (cycles[i].size() == 1) newcycles.push_back({cycles[i][0]}); else { vector<int> newcyk; int ptr1 = 0, ptr2 = (cycles[i].size() - 1) / 2 + 1; for (int j = 0; j < cycles[i].size() / 2; j++) { newcyk.push_back(cycles[i][ptr1++]); newcyk.push_back(cycles[i][ptr2++]); } newcyk.push_back(cycles[i][ptr1]); newcycles.emplace_back(newcyk); } i++; } else { if (i + 1 < cycles.size()) { if (cycles[i].size() != cycles[i + 1].size()) { printf( -1 n ); return; } else { vector<int> merged; for (int j = 0; j < cycles[i].size(); j++) { merged.push_back(cycles[i][j]); merged.push_back(cycles[i + 1][j]); } newcycles.emplace_back(merged); i += 2; } } else { printf( -1 n ); return; } } } for (int i = 0; i < newcycles.size(); i++) { if (newcycles[i].size() == 1) Q[newcycles[i][0]] = newcycles[i][0]; else { newcycles[i].push_back(newcycles[i][0]); for (int j = 0; j < newcycles[i].size() - 1; j++) { int next = newcycles[i][j + 1]; Q[newcycles[i][j]] = next; } } } for (int i = 1; i <= N; i++) printf( %d , Q[i]); printf( n ); } int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { int pi; scanf( %d , &pi); G[i].push_back(pi); } get_cycles(); construct_root_permutation(); return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; int mod = MOD; struct ModInt { unsigned val; ModInt() : val(0) {} ModInt(long long x) : val(x >= 0 ? x % mod : x % mod + mod) {} ModInt pow(long long exponent) { ModInt tmp = *this, res = 1; while (exponent > 0) { if (exponent & 1) res *= tmp; tmp *= tmp; exponent >>= 1; } return res; } ModInt &operator+=(const ModInt &rhs) { if ((val += rhs.val) >= mod) val -= mod; return *this; } ModInt &operator-=(const ModInt &rhs) { if ((val += mod - rhs.val) >= mod) val -= mod; return *this; } ModInt &operator*=(const ModInt &rhs) { val = (unsigned long long)val * rhs.val % mod; return *this; } ModInt &operator/=(const ModInt &rhs) { return *this *= rhs.inv(); } bool operator==(const ModInt &rhs) const { return val == rhs.val; } bool operator!=(const ModInt &rhs) const { return val != rhs.val; } bool operator<(const ModInt &rhs) const { return val < rhs.val; } bool operator<=(const ModInt &rhs) const { return val <= rhs.val; } bool operator>(const ModInt &rhs) const { return val > rhs.val; } bool operator>=(const ModInt &rhs) const { return val >= rhs.val; } ModInt operator-() const { return ModInt(-val); } ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; } ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; } ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; } ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; } friend ostream &operator<<(ostream &os, const ModInt &rhs) { return os << rhs.val; } friend istream &operator>>(istream &is, ModInt &rhs) { long long x; is >> x; rhs = ModInt(x); return is; } private: ModInt inv() const { unsigned a = val, b = mod; int x = 1, y = 0; while (b) { unsigned tmp = a / b; a -= tmp * b; swap(a, b); x -= tmp * y; swap(x, y); } return ModInt(x); } }; ModInt abs(const ModInt &x) { return x.val; } struct Combinatorics { Combinatorics(int MAX = 5000000) { MAX <<= 1; fact.resize(MAX + 1); fact_inv.resize(MAX + 1); fact[0] = 1; for (int i = (1); i < (MAX + 1); ++i) fact[i] = fact[i - 1] * i; fact_inv[MAX] = ModInt(1) / fact[MAX]; for (int i = MAX; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i; } ModInt nCk(int n, int k) { if (n < 0 || n < k || k < 0) return ModInt(0); return fact[n] * fact_inv[k] * fact_inv[n - k]; } ModInt nPk(int n, int k) { if (n < 0 || n < k || k < 0) return ModInt(0); return fact[n] * fact_inv[n - k]; } ModInt nHk(int n, int k) { if (n < 0 || k < 0) return ModInt(0); return (k == 0 ? ModInt(1) : nCk(n + k - 1, k)); } private: vector<ModInt> fact, fact_inv; }; int main() { cin.tie(0); ios::sync_with_stdio(false); int n, m; cin >> n >> m; vector<int> a(n); for (int i = (0); i < (n); ++i) cin >> a[i]; vector<int> w(n); for (int i = (0); i < (n); ++i) cin >> w[i]; int dl = 0, l = 0; for (int i = (0); i < (n); ++i) (a[i] == 0 ? dl : l) += w[i]; vector<vector<ModInt> > dp(m + 1, vector<ModInt>(m + 1, 0)); dp[0][0] = 1; for (int i = (0); i < (m); ++i) for (int j = (0); j < (m); ++j) { int sum = l + dl - j + (i - j); if (j > dl || j > i || sum <= 0) continue; dp[i + 1][j + 1] += dp[i][j] * (dl - j) / sum; dp[i + 1][j] += dp[i][j] * (l + (i - j)) / sum; } vector<ModInt> ans(2, 0); ModInt tmp = 1; for (int i = (0); i < (dl + 1); ++i) { if (i > m) break; ans[0] += tmp * dp[m][i]; if (i < dl) tmp *= (ModInt(1) - ModInt(1) / (dl - i)); } tmp = 1; for (int i = (0); i < (m + 1); ++i) { ans[1] += tmp * dp[m][m - i]; tmp *= (ModInt(1) + ModInt(1) / (l + i)); } for (int i = (0); i < (n); ++i) cout << ans[a[i]] * w[i] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> using vv = vector<vector<T>>; template <class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; } template <class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; } const long long MOD = 1e9 + 7; int N; long long C[114514]; long long T[114514]; vector<long long> ds, es; int main() { scanf( %d , &N); for (int(i) = 0; (i) < (N); ++(i)) { scanf( %lld , &C[i]); if (i > 0) ds.emplace_back(C[i] - C[i - 1]); } for (int(i) = 0; (i) < (N); ++(i)) { scanf( %lld , &T[i]); if (i > 0) es.emplace_back(T[i] - T[i - 1]); } sort((ds).begin(), (ds).end()); sort((es).begin(), (es).end()); if (C[0] != T[0]) { puts( No ); return 0; } assert((int)ds.size() == N - 1); assert((int)es.size() == N - 1); for (int(i) = 0; (i) < (N - 1); ++(i)) { if (ds[i] != es[i]) { puts( No ); return 0; } } puts( Yes ); }
#include <bits/stdc++.h> using namespace std; int main() { int N, M, x, y; cin >> N >> M >> x >> y; x--; y--; cout << x + 1 << << y + 1 << endl; for (int i = 1; i < x; i++) cout << i + 1 << << y + 1 << endl; for (int i = x + 1; i < N; i++) cout << i + 1 << << y + 1 << endl; cout << 1 << << y + 1 << endl; int uneven = 0; for (int j = 0; j < M; j++) { if (j == y) { uneven = 1; continue; } if (j % 2 == uneven) { for (int i = 0; i < N; i++) { cout << i + 1 << << j + 1 << endl; } } if (j % 2 != uneven) { for (int i = N - 1; i > -1; i--) { cout << i + 1 << << j + 1 << endl; } } } }
#include <bits/stdc++.h> using namespace std; const int maxN = 20, inf = 1000 * 1000 * 1000; int i, n, ans, t, j, k, a[maxN], b[maxN], c[maxN], d[maxN], nul, h; bool f; string s; int main() { getline(cin, s); n = s.length(); for (i = 0; i < n; ++i) { ++a[s[i] - 0 ]; } j = 0; ans = 0; k = 0; for (i = 1; i <= 9; ++i) { for (j = 0; j < 10; ++j) { b[j] = a[j]; c[j] = a[j]; } t = 0; if (b[i] > 0 && c[10 - i] > 0) { --b[i]; --c[10 - i]; ++t; for (j = 0; j < 10; ++j) { t += min(b[j], c[9 - j]); } if (t > ans) { ans = t; k = i; } } } for (i = 0; i < 10; ++i) { b[i] = a[i]; c[i] = a[i]; } f = false; if (b[k] > 0 && c[10 - k] > 0) { --b[k]; --c[10 - k]; f = true; } h = min(c[0] - min(b[9], c[0]), b[0] - min(b[0], c[9])); for (i = 0; i < b[0] - h - min(b[0], c[9]); ++i) { cout << 0; } for (i = 1; i < 10; ++i) { for (j = 0; j < b[i] - min(b[i], c[9 - i]); ++j) { cout << i; ++d[i]; } } for (i = 0; i < 10; ++i) { for (j = 0; j < min(b[i], c[9 - i]); ++j) { cout << i; ++d[i]; } } if (f) { cout << k; ++d[k]; } for (i = 0; i < h; ++i) { cout << 0; ++d[0]; } cout << endl; for (i = 0; i < c[0] - h - min(b[9], c[0]); ++i) { cout << 0; } for (i = 1; i < 10; ++i) { for (j = 0; j < c[i] - min(b[9 - i], c[i]); ++j) { cout << i; --d[i]; } } for (i = 9; i >= 0; --i) { for (j = 0; j < min(b[9 - i], c[i]); ++j) { cout << i; --d[i]; } } if (f) { cout << 10 - k; --d[10 - k]; } for (i = 0; i < h; ++i) { cout << 0; --d[0]; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int a[10]; int main() { int T, N, ans; scanf( %d , &T); while (T--) { scanf( %d , &N); ans = 1; for (int i = 0; i <= 30; i++) if (N & (1 << i)) ans *= 2; printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int n, m; scanf( %d%d , &n, &m); int x, ans = 0; for (int i = 0; i < n; i++) { scanf( %d , &x); ans += x; } if (ans == m) printf( YES n ); else printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxN = 2000 * 100 + 10; map<int, int> val; int a[maxN]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; val[a[i]]++; } sort(a, a + n); n = unique(a, a + n) - a; cout << a[n - 1] - a[0] << ; if (n == 1) cout << 1LL * val[a[0]] * (val[a[0]] - 1) / 2 << endl; else cout << 1LL * val[a[0]] * val[a[n - 1]] << endl; }
#include <bits/stdc++.h> #define ff first #define ss second #define endl n using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 3.5e4+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n, lst[MAXN], nx[MAXN], pr[MAXN], a[MAXN]; set<ll> idx[MAXN]; ll dp[105][MAXN]; ll t[101][4*MAXN], lazy[101][4*MAXN]; int x; void push(int v){ if(lazy[x][v] == 0) return; lazy[x][2*v] += lazy[x][v]; lazy[x][2*v + 1] += lazy[x][v]; t[x][2*v] += lazy[x][v]; t[x][2*v + 1] += lazy[x][v]; lazy[x][v] = 0; } void upd(int v, int tl, int tr, int l, int r, ll val){ if(l > r) return; if(tl == l && tr == r){ t[x][v] += val; lazy[x][v] += val; }else{ push(v); int tm = (tl + tr) / 2; upd(2*v, tl, tm, l, min(tm, r), val); upd(2*v+1, tm + 1, tr, max(tm + 1, l), r, val); t[x][v] = max(t[x][2*v], t[x][2*v + 1]); } } ll que(int v, int tl, int tr, int l, int r){ if(l > r) return -INF; if(tl == l && tr == r) return t[x][v]; else { push(v); int tm = (tl + tr) / 2; return max(que(2*v, tl, tm, l, min(tm, r)), que(2*v+1, tm + 1, tr, max(tm + 1, l), r)); } } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen( C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt , r ,stdin); freopen( C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt , w ,stdout); #endif ll k; cin>>n>>k; ll top = 0; for(ll i = 1; i <= n; i++){ cin>>a[i]; if(lst[a[i]] != 0) top += i - lst[a[i]]; pr[i] = lst[a[i]]; lst[a[i]] = i; } memset(lst, 0x7f, sizeof(lst)); for(int i = n; i >= 1; i--){ nx[i] = min(n + 1, lst[a[i]]); lst[a[i]] = i; } memset(dp, 0xf7, sizeof(dp)); dp[0][0] = 0; ll mx = 0; for(int i = 1; i < k; i++){ x = i - 1; ll cev = 0; for(ll j = 1; j <= n; j++){ if(j != 1) if(pr[j - 1] != 0) upd(1, 0, n, pr[j - 1] + 1, j - 1, j - 1 - pr[j - 1]); dp[i][j] = que(1, 0, n, 0, j - 1) + cev; upd(1, 0, n, j, j, dp[i - 1][j] - cev); //cerr<<dp[i][j]<< ; mx = max(mx, dp[i][j]); if(pr[j] != 0) cev -= j - pr[j]; if(nx[j] != n + 1) cev += nx[j] - j; } } cout<<top - mx<<endl; #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< milliseconds ; #endif }
#include <bits/stdc++.h> using namespace std; void sort(int temp[2000], int start, int end) { int flag; for (int i = start; i < end - 1; i++) { for (int j = start; j < end - i - 1; j++) { if (temp[j] < temp[j + 1]) { flag = temp[j]; temp[j] = temp[j + 1]; temp[j + 1] = flag; } } } } int main() { int n, k, arr[2000], count = 0; cin >> n; cin >> k; cout << n ; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, 0, n); for (int i = 0; i < n; i += k) count = count + (2 * (arr[i] - 1)); cout << n << count; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int m, n, t, ans; pair<int, int> a[N]; vector<pair<int, int>> v; int main() { scanf( %d , &t); while (t--) { scanf( %d%d , &n, &m); ans = 0; v.clear(); for (int i = 1; i <= n; i++) scanf( %d , &a[i].first), a[i].second = i; sort(a + 1, a + n + 1); for (int i = 1; i < n; i++) { v.push_back(make_pair(a[i].second, a[i + 1].second)); ans += a[i].first + a[i + 1].first; } v.push_back(make_pair(a[n].second, a[1].second)); ans += a[n].first + a[1].first; if (v.size() > m || n == 2) { puts( -1 ); continue; } for (int i = v.size() + 1; i <= m; i++) { v.push_back(make_pair(a[1].second, a[2].second)); ans += a[1].first + a[2].first; } printf( %d n , ans); for (int i = 0; i < v.size(); i++) printf( %d %d n , v[i].first, v[i].second); } }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b; cin >> a >> b; cout << (a ^ b) << endl; } }
#include <bits/stdc++.h> using namespace std; string A, B; bool is_divisor(const string &a, const string &b) { int sa = a.size(), sb = b.size(); for (int i = 0; i < sb; i += sa) { if (b.substr(i, sa) != a) return false; } return true; } int process(const string &a, const string &b) { int sz = a.size(); vector<int> divi; for (int i = 1; i < sqrt(sz) + 1; ++i) { if (sz % i == 0) { divi.push_back(i); if (i * i != sz) divi.push_back(sz / i); } } set<string> s; for (int i = 0; i < divi.size(); ++i) if (is_divisor(a.substr(0, divi[i]), a)) s.insert(a.substr(0, divi[i])); sz = b.size(); divi.clear(); for (int i = 1; i < sqrt(sz) + 1; ++i) { if (sz % i == 0) { divi.push_back(i); if (i * i != sz) divi.push_back(sz / i); } } int ans = 0; set<string> ss; for (int i = 0; i < divi.size(); ++i) if (is_divisor(b.substr(0, divi[i]), b)) ss.insert(b.substr(0, divi[i])); for (string a : s) if (ss.find(a) != ss.end()) ++ans; return ans; } int main() { char a[100001]; scanf( %s , a); A = string(a); scanf( %s , a); B = string(a); cout << process(A, B) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; scanf( %lld , &n); printf( 1 ); if ((n - 1) % 3 == 1) printf( 2 %lld , n - 3); else printf( 1 %lld , n - 2); return 0; }
#include <bits/stdc++.h> using namespace std; map<string, string> mmap; map<string, string>::iterator it; int main() { int t; cin >> t; while (t--) { string a; string b; cin >> a >> b; if (mmap[b] != ) { for (it = mmap.begin(); it != mmap.end(); it++) { if (it->first == b) { mmap.erase(it); break; } } } int flag = 0; for (it = mmap.begin(); it != mmap.end(); it++) { if (it->second == a) { it->second = b; flag = 1; break; } } if (!flag) mmap[a] = b; } int flag = 0; for (it = mmap.begin(); it != mmap.end(); it++) if (it->second == ) flag++; cout << mmap.size() - flag << endl; for (it = mmap.begin(); it != mmap.end(); it++) if (it->second != ) cout << it->first << << it->second << endl; }
#include <bits/stdc++.h> using namespace std; vector<int> g[100010]; long long int weight[100010], add[100010], sub[100010]; int n; void dfs(int mom, int u) { for (vector<int>::iterator v = g[u].begin(); v != g[u].end(); v++) if (*v != mom) { dfs(u, *v); add[u] = max(add[*v], add[u]); sub[u] = max(sub[u], sub[*v]); } weight[u] += add[u] - sub[u]; if (weight[u] < 0) add[u] -= weight[u]; else sub[u] += weight[u]; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int u, v; scanf( %d %d , &u, &v); g[u].push_back(v), g[v].push_back(u); } for (int i = 1; i <= n; i++) scanf( %I64d , weight + i); dfs(-1, 1); printf( %I64d n , add[1] + sub[1]); }
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const long long llinf = (long long)3e18; const int N = (int)1e5 + 111; const long double PI = (long double)acos(-1); int main() { int n, cur, num, ans = 0; scanf( %d , &n); vector<int> a(n); vector<char> us(n, 0); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a.begin(), a.end()); for (int i = 0; i < n; i++) if (us[i] == 0) { cur = i; num = 0; while (cur < n) { if (us[cur] == 1 || a[cur] < num) cur++; else { num++; us[cur] = 1; } } ans++; } printf( %d , ans); return 0; }
#include <bits/stdc++.h> int x[10]; int cp, dp; using namespace std; void print() { for (int i = 0; i < 10; ++i) { cout << x[i]; if (i == 9) cout << n ; else cout << ; } } int pp(char a, int &dp) { if (a == < ) { dp = -1; return -2; } else if (a == > ) { dp = 1; return -2; } else return a - 0 ; } void work(int l, int r, string ch1) { cp = l; dp = 1; int temp; bool ins = true; while (cp >= l && cp <= r) { temp = pp(ch1[cp], dp); if (temp >= 0) { x[temp]++; ch1[cp]--; cp += dp; } else { if (temp == -1) cp += dp; if (temp == -2) { int cpt = cp; cp += dp; if (cp < l || cp > r) break; int temp1 = pp(ch1[cp], dp); while (temp1 == -1) { cp += dp; temp1 = pp(ch1[cp], dp); } if (cp < l || cp > r) break; if (temp1 == -2) ch1[cpt] = 0 - 1; if (temp1 >= 0) x[temp1]++, ch1[cp]--, cp += dp; } } } print(); } int main() { int n, q; string ch; cin >> n >> q; cin >> ch; for (int i = 0; i < q; ++i) { int l, r; cin >> l >> r; l--, r--; memset(x, 0, sizeof(x)); if (l == r) { int pk = ch[l]; if (pk == < || pk == > ) print(); else x[pk - 0 ]++, print(); } else work(l, r, ch); } return 0; }
#include <bits/stdc++.h> using namespace std; void Swap(int &a, int &b) { a = a ^ b; b = a ^ b; a = a ^ b; } int Max(int a, int b) { if (a > b) return a; return b; } int Scan() { int res = 0; char ch; ch = getchar(); if (ch >= 0 && ch <= 9 ) res = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) res = res * 10 + (ch - 0 ); return res; } int main() { int T = Scan(); int X = 0, Y = 0; while (T--) { char c; cin >> c; int a = Scan(); int b = Scan(); if (a < b) Swap(a, b); if (c == + ) X = Max(X, a), Y = Max(Y, b); else if (a >= X && b >= Y) cout << YES n ; else cout << NO n ; } }
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; cout << s[0]; for (int i = 1; i < s.size() - 1; i += 2) { cout << s[i]; } cout << s.back(); cout << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t_; cin >> t_; while (t_--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long r = 1000000007; int h[10]; int n, k, m, i, j; long long a[100001], b[100001]; long long ans, x, y, z, c1, c2; int main() { cin >> n >> k; for (i = 1; i <= n / k; i++) cin >> a[i]; for (i = 1; i <= n / k; i++) cin >> b[i]; h[0] = 1; for (i = 1; i <= 9; i++) h[i] = h[i - 1] * 10; ans = 1; for (i = 1; i <= n / k; i++) { x = 9; for (j = 2; j <= k; j++) x = x * 10 + 9; c1 = x / a[i] + 1; x = b[i] * h[k - 1]; z = x % a[i]; if (z > 0) x = x + (a[i] - z); y = b[i]; for (j = 2; j <= k; j++) y = y * 10 + 9; z = y % a[i]; if (z > 0) y = y - z; c2 = (y - x) / a[i] + 1; ans = ans * (c1 - c2) % r; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { while (b) { a = a % b; swap(a, b); } return a; } int pre[1000010]; int GetN(int n) { if (pre[n] > 0) return pre[n]; if (n < 10) { pre[n] = n; return n; } int temp = n; int product = 1; while (n > 0) { int rem = n % 10; product *= rem == 0 ? 1 : rem; n = n / 10; } return pre[temp] = GetN(product); } int dp[1000010][10]; void Precal() { for (int i = 1; i < 1000010; i++) { int res = GetN(i); dp[i][res] = 1; for (int k = 1; k <= 9; k++) { dp[i][k] = dp[i][k] + dp[i - 1][k]; if (dp[i][0] == 1) { cout << i << << k; int v; cin >> v; exit(0); } } } } int main() { Precal(); int n; cin >> n; for (int i = 1; i <= n; i++) { int l, r, k; cin >> l >> r >> k; cout << dp[r][k] - dp[l - 1][k] << endl; ; } int v; cin >> v; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = int(3e5) + 228, mod = int(1e9) + 7; const long long inf = (long long)(1e16); int n; pair<int, int> p[N]; pair<long long, long long> t[2 * N], dp[N]; pair<long long, long long> merg(pair<long long, long long> a, pair<long long, long long> b) { if (a.first > b.first) return b; if (a.first < b.first) return a; a.second += b.second; if (a.second >= mod) a.second -= mod; return a; } void upd(int v, pair<long long, long long> a) { v += n - 1; t[v] = merg(t[v], a); while (v > 1) { v >>= 1; t[v] = merg(t[v + v], t[v + v + 1]); } } pair<long long, long long> get(int l, int r) { l += n - 1; r += n - 1; pair<long long, long long> res = make_pair(inf, 0); while (l <= r) { if (l & 1) res = merg(res, t[l]); if (!(r & 1)) res = merg(res, t[r]); l = (l + 1) >> 1; r = (r - 1) >> 1; } return res; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &p[i].first, &p[i].second); } for (int i = 1; i <= 2 * n; i++) { t[i] = make_pair(inf, 0); } sort(p + 1, p + n + 1); for (int i = 1; i <= n; i++) { int l = 0, r = i; while (r - l > 1) { int mid = (l + r) >> 1; if (p[mid].first <= p[i].second) l = mid; else r = mid; } if (l == 0) { dp[i] = make_pair(p[i].second, 1); } else { dp[i] = get(1, l); dp[i].first += p[i].second; } upd(i, make_pair(dp[i].first - p[i].first, dp[i].second)); } int mx = 0; pair<long long, long long> ans = make_pair(inf, 0); for (int i = n; i > 0; i--) { if (mx < p[i].first) ans = merg(ans, dp[i]); mx = max(mx, p[i].second); } printf( %lld , ans.second); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; while (a[i] % 2 == 0) a[i] /= 2; while (a[i] % 3 == 0) a[i] /= 3; } int flag = 1; int val = a[0]; for (int i = 1; i < n; i++) { if (a[i] != val) flag = 0; } if (flag) cout << Yes ; else cout << No ; return 0; }
#include <bits/stdc++.h> using namespace std; int mx = INT_MIN, n, a[10]; char x; int main() { cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= 7; j++) { cin >> x; a[j] += x - 48; } } for (int i = 1; i <= 7; i++) if (mx < a[i]) mx = a[i]; cout << mx; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a, b; int t = n / 2; if (n % 2 == 1) { cout << t << << t + 1; } else if (n % 4 == 2) { cout << t - 2 << << t + 2; } else if (n % 4 == 0) { cout << t - 1 << << t + 1; } }
#include <bits/stdc++.h> using namespace std; int as[10001]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; for (int i = 1; i <= n; ++i) as[i] = 1; as[n] = 0; for (int j = 0; j < k; ++j) { for (int i = 1; i <= n - (1 << (j + 1)); ++i) { if (as[i] != n - i) { cout << n - (1 << j) << ; as[i] += as[n - (1 << j)]; } else { cout << n << ; } } int x = 1; if (n - (1 << (j + 1)) + 1 > 0) { for (int i = n - (1 << (j + 1)) + 1; i <= n; ++i) { if (as[i] != n - i) { cout << n - (1 << j) + x << ; as[i] += as[n - (1 << j) + x]; ++x; } else { cout << n << ; } } } else { for (int i = 1; i <= n; ++i) { if (as[i] != n - i) { cout << i + as[i] << ; as[i] += as[i + as[i]]; } else { cout << n << ; } } } cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; long long c[n], s[n]; for (int i = 0; i < n; i++) { cin >> c[i] >> s[i]; } long long dp[m + 1]; dp[m] = 0; for (int i = m - 1; i >= 0; i--) { dp[i] = m - i; for (int j = 0; j < n; j++) { long long l = c[j] - s[j]; l = max(0LL, l); long long r = c[j] + s[j]; r = min(r, m); if (i + 1 >= l && i + 1 <= r) { dp[i] = min(dp[i], dp[i + 1]); break; } if (i < l) { long long gap = l - i - 1; long long rr = r + gap; rr = min(m, rr); dp[i] = min(dp[i], gap + dp[rr]); } } } cout << dp[0] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int a[] = {1, 2, 4, 3}; int b[] = {1, 3, 4, 2}; int c[] = {1, 4, 1, 4}; int d[] = {1, 1, 1, 1}; int main() { string s; cin >> s; int n = s.length(); int rem = 0; for (int i = 0; i < n; i++) { rem = (rem * 10 + s[i] - 0 ) % 4; } int ans = a[rem] + b[rem] + c[rem] + d[rem]; ans %= 5; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1), eps = 1e-6, INF = 1e16; bool isEqual(long double x, long double y) { return fabs(x - y) < eps; } int sgn(long double sc) { if (isEqual(sc, 0)) return 0; if (sc < eps) return -1; return 1; } struct pnt { long double x, y; pnt() {} pnt(long double _x, long double _y) { x = _x; y = _y; } pnt(pnt A, pnt B) { x = B.x - A.x; y = B.y - A.y; } pnt operator+(pnt p) { return pnt(x + p.x, y + p.y); } pnt operator-(pnt p) { return pnt(x - p.x, y - p.y); } void operator+=(pnt p) { x += p.x, y += p.y; } void operator-=(pnt p) { x -= p.x, y -= p.y; } pnt operator*(long double sc) { return pnt(x * sc, y * sc); } pnt operator/(long double sc) { return pnt(x / sc, y / sc); } long double operator*(pnt p) { return x * p.x + y * p.y; } long double operator^(pnt p) { return x * p.y - p.x * y; } bool operator==(pnt p) { return isEqual(x, p.x) && isEqual(y, p.y); } bool operator!=(pnt p) { return !isEqual(x, p.x) || !isEqual(y, p.y); } void normalize() { long double sq = sqrt(x * x + y * y); x /= sq; y /= sq; return; } long double dist2(pnt p) { return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y); } long double dist(pnt p) { return sqrt(dist2(p)); } bool isParallel(pnt p) { return isEqual(pnt(x, y) ^ p, 0); } }; struct line { long double a, b, c; line() {} line(long double _a, long double _b, long double _c) { a = _a, b = _b, c = _c; } line(pnt p1, pnt p2) { a = p1.y - p2.y; b = p2.x - p1.x; c = -(a * p1.x + b * p1.y); } pnt getPerpendicularVector() { return pnt(a, b); } pnt getParallelVector() { return pnt(-b, a); } line getPerpendicularLine() { return line(-b, a, c); } bool isParallel(line l) { return getParallelVector().isParallel(l.getParallelVector()); } pnt intersect(line l) { if (isParallel(l)) { return pnt(INF, INF); } long double q = a * l.b - b * l.a; return pnt((b * l.c - c * l.b) / q, (c * l.a - a * l.c) / q); } long double dist(pnt p) { return fabs(a * p.x + b * p.y + c) / sqrt(a * a + b * b); } pnt basePerp(pnt p) { return intersect(line(p, p + getPerpendicularVector())); } bool isOnLine(pnt p) { return isEqual(a * p.x + b * p.y + c, 0); } }; int main() { int n, d; cin >> n >> d; pnt A(0, d), B(d, 0), C(n, n - d), D(n - d, n); pnt BA(B, A), BC(B, C), CD(C, D), DA(D, A), AC(A, C), DC(D, C); line BAl(B, A), BCl(B, C), CDl(C, D), DAl(D, A), ACl(A, C); int m, x, y; cin >> m; for (int i = 0; i < m; i++) { cin >> x >> y; pnt kuz(x, y), Bkuz(B, kuz), Dkuz(D, kuz); if ((((BA ^ Bkuz) < 0 && (BC ^ Bkuz) > 0) && (((DA ^ Dkuz) > 0) && ((DC ^ Dkuz) < 0))) || BAl.isOnLine(kuz) || BCl.isOnLine(kuz) || CDl.isOnLine(kuz) || DAl.isOnLine(kuz)) { cout << YES << endl; } else { cout << NO << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1024000000,1024000000 ) long long ans; int son[100010][2], fa[100010], cnt[100010], val[100010]; int is[100010]; long long sumVal[100010], sumCnt[100010], sum[100010], all[100010], lazy[100010]; void up(int p) { sumCnt[p] = sumCnt[son[p][0]] + sumCnt[son[p][1]] + cnt[p]; sumVal[p] = sumVal[son[p][0]] + sumVal[son[p][1]] + val[p]; sum[p] = sum[son[p][0]] + sum[son[p][1]] + 1LL * cnt[p] * val[p]; } void func(int p, long long v) { if (!p) return; all[p] += v * cnt[p]; lazy[p] += v; } void down(int p) { if (lazy[p]) { func(son[p][0], lazy[p]); func(son[p][1], lazy[p]); lazy[p] = 0; } } void Rotate(int x) { int y = fa[x], z = fa[y]; int o = son[y][0] == x; down(y), down(x); son[y][!o] = son[x][o], fa[son[x][o]] = y; son[x][o] = y, fa[y] = x; fa[x] = z; if (is[y]) is[y] = 0, is[x] = 1; else son[z][son[z][1] == y] = x; up(y); } void Splay(int x) { int y, z; down(x); while (!is[x]) { y = fa[x], z = fa[y]; if (is[y]) Rotate(x); else if ((son[y][0] == x) ^ (son[z][0] == y)) Rotate(x), Rotate(x); else Rotate(y), Rotate(x); } up(x); } int Access(int x) { int y = 0; for (; x; x = fa[x]) { Splay(x); is[son[x][1]] = 1; if (son[x][1]) { cnt[x] += sumCnt[son[x][1]]; } son[x][1] = y; if (y) { cnt[x] -= sumCnt[y]; } is[y] = 0; y = x; up(x); } return y; } int vv[100010], nxt[100010], h[100010], e; void add(int u, int v) { vv[e] = v, nxt[e] = h[u], h[u] = e++; } void dfs(int u, int f) { fa[u] = f, is[u] = 1, cnt[u] = 1; son[u][0] = son[u][1] = 0; all[u] = 1; for (int i = h[u]; i + 1; i = nxt[i]) { int v = vv[i]; dfs(v, u); all[u] += 1LL * cnt[v] * cnt[u] * 2; cnt[u] += cnt[v]; } ans += all[u] * val[u]; up(u); } void change(int x, long long v) { Splay(x); ans += (v - val[x]) * all[x]; val[x] = v; up(x); } int getFa(int x) { Splay(x); if (!son[x][0]) return fa[x]; int y = son[x][0]; while (son[y][1]) y = son[y][1]; return y; } void gao(int u, int v) { Access(u); Splay(v); if (!fa[v]) swap(u, v); int f = getFa(v); if (f == u) return; Access(f), Splay(f); cnt[f] -= sumCnt[v], up(f); fa[v] = 0; ans -= 2 * sum[f] * sumCnt[v]; func(f, -2 * sumCnt[v]); Access(u), Splay(u); ans += 2 * sum[u] * sumCnt[v]; func(u, 2 * sumCnt[v]); cnt[u] += sumCnt[v], up(u); fa[v] = u; } int main() { int n; int u; scanf( %d , &n); memset(h, -1, sizeof(h)), e = 0; for (int i = 2; i <= n; ++i) { scanf( %d , &u); add(u, i); } for (int i = 1; i <= n; ++i) scanf( %d , val + i); dfs(1, 0); int m, v; scanf( %d , &m); char c[3]; double mu = 1.0 * n * n; printf( %.10lf n , ans / mu); while (m--) { scanf( %s%d%d , c, &u, &v); if (c[0] == P ) gao(v, u); else change(u, v); printf( %.10lf n , ans / mu); } }
#include <bits/stdc++.h> using namespace std; long long n, m, k, day, dep[1000010], arr[1000010], cost[1000010], cel, from, coss; long long mini[1000010], wylot[1000010], dolot[1000010], sum, inf = 1e7; vector<pair<long long, int> > tab; int ptr; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; inf *= inf; for (int a = 1; a <= m; a++) { cin >> day >> dep[a] >> arr[a] >> cost[a]; tab.push_back(make_pair(day, a)); } sort(tab.begin(), tab.end()); ptr = 0; for (int a = 1; a <= n; a++) mini[a] = inf; sum = n * inf; dolot[0] = n * inf; for (int a = 1; a <= 1e6; a++) { while (ptr < tab.size() && tab[ptr].first <= a) { cel = arr[tab[ptr].second]; from = dep[tab[ptr].second]; coss = cost[tab[ptr].second]; if (cel != 0) { ptr++; continue; } if (coss < mini[from]) { sum -= mini[from]; mini[from] = coss; sum += coss; } ptr++; } dolot[a] = sum; } reverse(tab.begin(), tab.end()); ptr = 0; for (int a = 1; a <= n; a++) mini[a] = inf; sum = n * inf; wylot[(int)1e6 + 1] = n * inf; for (int a = 1e6; a >= 0; a--) { while (ptr < tab.size() && tab[ptr].first >= a) { cel = arr[tab[ptr].second]; from = dep[tab[ptr].second]; coss = cost[tab[ptr].second]; if (cel == 0) { ptr++; continue; } if (coss < mini[cel]) { sum -= mini[cel]; mini[cel] = coss; sum += coss; } ptr++; } wylot[a] = sum; } long long ans = inf; for (int a = 1; a <= 1e6 - k; a++) { if (dolot[a - 1] < n * inf && wylot[a + k] < n * inf) ans = min(ans, dolot[a - 1] + wylot[a + k]); } if (ans == inf) cout << -1; else cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n; int a[3][11]; int sum[11]; int x, len, i; int main() { scanf( %d , &n); for (i = 0; i < n; i++) for (int j = 0; j < 6; j++) { scanf( %d , &x); a[i][x]++; sum[x]++; } for (i = 1; i < 1000; i++) { if (i < 10) { if (sum[i]) continue; else break; } else if (i < 100) { int flag = 0; for (int j = 0; j < 3; j++) for (int k = 0; k < 3; k++) { if (k == j) continue; if (a[j][i % 10] && a[k][i / 10]) flag = 1; } if (flag == 0) break; } else { int flag = 0; for (int j = 0; j < 3; j++) { for (int k = 0; k < 3; k++) { if (k == j) continue; for (int l = 0; l < 3; l++) { if (l == k || l == j) continue; if (a[j][i % 10] && a[k][i / 10 % 10] && a[l][i / 100]) flag = 1; } } } if (flag == 0) break; } } cout << i - 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, mem[100004][28]; char x, y; string s; map<pair<int, int>, int> m; int dp(int i = 0, int j = 27) { if (i == (int)s.size()) return 0; int& ret = mem[i][j]; if (~ret) return ret; if (m[{(int)(s[i] - a ), j}] != 1) { return ret = max(dp(i + 1, (int)(s[i] - a )) + 1, dp(i + 1, j)); } else return ret = dp(i + 1, j); } int main() { cin >> s; cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; m[{(int)(x - a ), (int)(y - a )}] = 1; m[{(int)(y - a ), (int)(x - a )}] = 1; } memset(mem, -1, sizeof mem); cout << (int)s.size() - dp(); return 0; }
#include <bits/stdc++.h> void answer(unsigned long long v) { std::cout << v << n ; } void solve(unsigned n, unsigned k) { const auto s = n * (n - 1ull) / 2; if (k > n / 2) return answer(s); const auto m = n - 2 * k; const auto d = m * (m - 1ull) / 2; answer(s - d); } int main() { unsigned n, k; std::cin >> n >> k; solve(n, k); return 0; }
#include <bits/stdc++.h> using namespace std; bool dp[1005][2005]; pair<long long int, long long int> prv[1005][2005]; char val[1005][2005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n, k; cin >> n >> k; string s; cin >> s; s = * + s; dp[0][k] = 1; for (long long int i = 1; i < n; i++) { for (long long int j = 0; j <= 2 * k; j++) { if (s[i] == W ) { if (j == 1 && i != n) continue; if (j >= 1 && dp[i - 1][j - 1]) { dp[i][j] = 1; prv[i][j] = {i - 1, j - 1}; val[i][j] = W ; } } if (s[i] == L ) { if (j == 2 * k - 1 && i != n) continue; if (j <= 2 * k - 1 && dp[i - 1][j + 1]) { dp[i][j] = 1; prv[i][j] = {i - 1, j + 1}; val[i][j] = L ; } } if (s[i] == D ) { if ((j == 0 || j == 2 * k) && i != n) continue; if (dp[i - 1][j]) { dp[i][j] = 1; prv[i][j] = {i - 1, j}; val[i][j] = D ; } } if (s[i] == ? ) { if (!(j == 1 && i != n) && j >= 1 && dp[i - 1][j - 1]) { dp[i][j] = 1; prv[i][j] = {i - 1, j - 1}; val[i][j] = W ; } if (!(j == 2 * k - 1 && i != n) && j <= 2 * k - 1 && dp[i - 1][j + 1]) { dp[i][j] = 1; prv[i][j] = {i - 1, j + 1}; val[i][j] = L ; } if (!((j == 0 || j == 2 * k) && i != n) && dp[i - 1][j]) { dp[i][j] = 1; prv[i][j] = {i - 1, j}; val[i][j] = D ; } } } } if (s[n] == W ) { if (!dp[n - 1][2 * k - 1]) return cout << NO , 0; dp[n][2 * k] = 1; prv[n][2 * k] = {n - 1, 2 * k - 1}; val[n][2 * k] = W ; } if (s[n] == L ) { if (!dp[n - 1][1]) return cout << NO , 0; dp[n][0] = 1; prv[n][0] = {n - 1, 1}; val[n][0] = L ; } if (s[n] == D ) { return cout << NO , 0; } if (s[n] == ? ) { if (dp[n - 1][2 * k - 1]) { dp[n][2 * k] = 1; prv[n][2 * k] = {n - 1, 2 * k - 1}; val[n][2 * k] = W ; } if (dp[n - 1][1]) { dp[n][0] = 1; prv[n][0] = {n - 1, 1}; val[n][0] = L ; } } if (dp[n][0] || dp[n][2 * k]) { long long int x, y; if (dp[n][0]) x = n, y = 0; else x = n, y = 2 * k; string ans; while (x) { ans.push_back(val[x][y]); pair<long long int, long long int> xx = prv[x][y]; x = xx.first, y = xx.second; } reverse(ans.begin(), ans.end()); cout << ans; } else return cout << NO , 0; }
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; long long gcd(long long a, long long b) { if (a == 0) return b; if (b == 0) return a; if (a > b) return gcd(b, a % b); return gcd(a, b % a); } int main() { long long n, x, y; cin >> n >> x >> y; long long d = gcd(x, y); long long xd = x / d; long long yd = y / d; long long nok = x / d * y; for (int i = 0; i < n; i++) { long long a; cin >> a; long long l = 0; long long r = (a / (x + y) + 2) * nok; while ((r - l) > 1) { long long m = (r + l) / 2; long long hits = m / yd + m / xd; if (hits >= a) r = m; else l = m; } if (((r % yd) == 0) && ((r % xd) == 0)) cout << Both n ; else if (r % yd == 0) cout << Vanya n ; else cout << Vova n ; } }
#include <bits/stdc++.h> using namespace std; const int N = 100010; int ans, tot, head[N], ver[N], Next[N], val[N], n, m, deg[N]; queue<int> q[2]; bool vis[N]; inline void add(int x, int y) { ver[++tot] = y; Next[tot] = head[x]; head[x] = tot; deg[y]++; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) scanf( %d , &val[i]); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); x++; y++; add(y, x); } for (int i = 1; i <= n; i++) if (!deg[i]) q[val[i]].push(i); while ((!q[0].empty()) || (!q[1].empty())) { while (!q[0].empty()) { int x = q[0].front(); q[0].pop(); vis[x] = true; for (int i = head[x]; i; i = Next[i]) { int y = ver[i]; if (vis[y]) continue; if (!(--deg[y])) q[val[y]].push(y); } } if (!q[1].empty()) { ans++; while (!q[1].empty()) { int x = q[1].front(); q[1].pop(); vis[x] = true; for (int i = head[x]; i; i = Next[i]) { int y = ver[i]; if (vis[y]) continue; if (!(--deg[y])) q[val[y]].push(y); } } } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 7050; int dp[2][maxn]; vector<int> g[2]; int state[2][maxn]; void dfs(int player, int cur, int n) { if (state[player][cur] == 1) return; state[player][cur] = 1; for (int i = 0; i < g[player].size(); i++) { int v = (cur + g[player][i]) % n; if (v == 0) { dp[player][cur] = 1; return; } } int cnt = 0; for (int i = 0; i < g[player].size(); i++) { int v = (cur + g[player][i]) % n; dfs(player ^ 1, v, n); if (dp[player ^ 1][v] == (-1)) { dp[player][cur] = 1; return; } if (dp[player ^ 1][v] == 1) { cnt++; } } if (cnt == g[player].size()) dp[player][cur] = (-1); return; } void WORK(int n) { for (int i = 0; i <= n; i++) dp[0][i] = dp[1][i] = 2; for (int k = 1; k <= 5; k++) { memset(state, 0, sizeof(state)); for (int i = n - 1; i >= 0; i--) { dfs(0, i % n, n); dfs(1, i % n, n); } } } int main() { int n; while (scanf( %d , &n) != EOF) { for (int i = 0; i < 2; i++) { g[i].clear(); int cnt; scanf( %d , &cnt); while (cnt--) { int x; scanf( %d , &x); g[i].push_back(x); } } WORK(n); for (int i = 0; i < 2; i++) { for (int j = 1; j < n; j++) { if (dp[i][j] == 1) printf( Win ); else if (dp[i][j] == (-1)) printf( Lose ); else printf( Loop ); } printf( n ); } } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } const int maxn = 1e6 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; int m; cin >> n >> m; int need = (n + 4 - 1) / 4; string a = 5 ; int tota = 5; while ((int)a.size() < need) { a += 5 ; tota += 5; } string b = 5 ; int totb = 5; while ((int)b.size() < need) { b += 4 ; totb += 4; } reverse(a.begin(), a.end()); reverse(b.begin(), b.end()); cout << a << n ; cout << b << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, cnt; map<int, int> g[200005]; set<int> s, ns; void dfs(int x) { vector<int> v; v.clear(); ns.clear(); for (set<int>::iterator it = s.begin(); it != s.end(); it++) if (!g[x][*it]) v.push_back(*it); else ns.insert(*it); s = ns; for (int i : v) dfs(i); } int main() { scanf( %d%d , &n, &m); for (int i = 1, u, v; i <= m; ++i) scanf( %d%d , &u, &v), g[u][v] = 1, g[v][u] = 1; for (int i = 1; i <= n; ++i) s.insert(i); for (; s.size();) { ++cnt; int t = *s.begin(); s.erase(t); dfs(t); } printf( %d n , cnt - 1); }
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int t, a, b, c, d, k; cin >> t; while (t--) { cin >> a >> b >> c >> d >> k; int x = a / c; int y = b / d; if (a % c) x++; if (b % d) y++; if (x + y <= k) { cout << x << << k - x << endl; } else cout << -1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long n, a[300000], b[300000]; long long s; map<long, long> x, y; map<pair<long, long>, long> t; int main() { cin >> n; for (long i = 0; i < n; i++) { cin >> a[i] >> b[i]; x[a[i]]++; y[b[i]]++; pair<long, long> p; p.first = a[i]; p.second = b[i]; t[p]++; } for (long i = 0; i < n; i++) { pair<long, long> p; p.first = a[i]; p.second = b[i]; s += (x[a[i]] + y[b[i]] - 1 - t[p]); } s /= 2; cout << s; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; scanf( %lld , &n); scanf( %lld , &k); long long a[k + 5], mn = -1, ans1, ans2, flag = 0; for (long long i = 1; i <= k; i++) { scanf( %lld , &a[i]); if (a[i] > n) { continue; } flag = 1; long long r = n % a[i]; if (mn == -1) { mn = r; ans1 = i; ans2 = n / a[i]; continue; } if (mn > r) { mn = r; ans1 = i; ans2 = n / a[i]; } } if (flag == 0) { cout << 1 0 n ; return 0; } cout << ans1 << << ans2 << n ; }
#include <bits/stdc++.h> using namespace std; const int N = 200005; vector<int> adj[N]; int n, st[N], sz[N], flat[N], tim = 1; int dfs(int u) { int s = 1; st[u] = tim; flat[tim] = u; for (int v : adj[u]) { tim++; s += dfs(v); } return sz[u] = s; } int main(int argc, char const *argv[]) { int q; cin >> n >> q; for (int i = 2; i <= n; ++i) { int p; cin >> p; adj[p].push_back(i); } for (int i = 1; i <= n; ++i) { sort(adj[i].begin(), adj[i].end()); } dfs(1); while (q--) { int u, k; cin >> u >> k; if (k > sz[u]) cout << -1 << n ; else cout << flat[st[u] + k - 1] << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, d; cin >> n >> d; int in[n]; vector<pair<int, int>> c; in[0] = in[n - 1] = 0; for (int i = 1; i < n - 1; i++) cin >> in[i]; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; c.push_back({x, y}); } long long dis[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dis[i][j] = d * (abs(c[i].first - c[j].first) + abs(c[i].second - c[j].second)); if (i != 0 && i != n - 1 && i != j) dis[i][j] -= in[i]; } } for (int k = 0; k < n; k++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (dis[i][k] + dis[k][j] < dis[i][j]) dis[i][j] = dis[i][k] + dis[k][j]; } } } cout << dis[0][n - 1] << endl; }
#include <bits/stdc++.h> using namespace std; int r, c, w; char a[1005][1005]; int rows[1005], columns[1005]; int main() { scanf( %d%d , &r, &c); for (int i = 1; i <= r; i++) for (int j = 1; j <= c; j++) { cin >> a[i][j]; if (a[i][j] == * ) { w++; rows[i]++; columns[j]++; } } for (int i = 1; i <= r; i++) for (int j = 1; j <= c; j++) { if (rows[i] + columns[j] - (a[i][j] == * ) == w) { printf( YES n%d %d , i, j); return 0; } } printf( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; vector<int> id; int a[N]; int tr[N]; int find(int u) { return lower_bound(id.begin(), id.end(), u) - id.begin() + 1; } int lowbit(int x) { return x & -x; } void add(int x, int c) { for (int i = x; i <= n; i += lowbit(i)) tr[i] += c; } int sum(int x) { int res = 0; for (int i = x; i; i -= lowbit(i)) res += tr[i]; return res; } int main() { int t; cin >> t; while (t--) { cin >> n; id.clear(); memset(tr, 0, sizeof tr); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); id.push_back(a[i]); } sort(id.begin(), id.end()); id.erase(unique(id.begin(), id.end()), id.end()); int tot = id.size(); long long res = 0; for (int i = 0; i < n; i++) { int id = find(a[i]); int q1 = sum(tot) - sum(id); int q2 = sum(id - 1); add(id, 1); res += (long long)min(q1, q2); } cout << res << endl; } }
#include <bits/stdc++.h> using namespace std; pair<int, int> a[110]; int n, k; double p[110]; double dp[110][110]; int was[110][110]; double dist(pair<int, int> a, pair<int, int> b) { double x = a.first - b.first; double y = a.second - b.second; return sqrt(x * x + y * y); } double rec(int pos, int kol) { if (pos == n) { if (kol >= k) return 1; return 0; } if (was[pos][kol]) return dp[pos][kol]; was[pos][kol] = 1; double res = p[pos] * rec(pos + 1, kol + 1); res += (1 - p[pos]) * rec(pos + 1, kol); return dp[pos][kol] = res; } int main() { scanf( %d , &n); int x, y, e; scanf( %d%d , &k, &e); scanf( %d%d , &x, &y); e = 1000 - e; for (int i = (0); i < (n); ++i) scanf( %d%d , &a[i].first, &a[i].second); double l = 0, r = 1e40; double best = -1; for (int i = (0); i < (1000); ++i) { double m = (l + r) / 2; for (int i = (0); i < (n); ++i) { double d = dist(make_pair(x, y), a[i]); if (d <= m) p[i] = 1; else { double k = d * d / m / m; p[i] = exp(1.0 - k); } } memset(was, 0, sizeof(was)); double prob = rec(0, 0); if (prob * 1000 >= e) { best = m; r = m; } else l = m; } printf( %.10lf n , best); return 0; }
#include <bits/stdc++.h> using namespace std; int n; int m; struct st { int go; long long int a; long long int b; st() { go = -1; a = 0; b = 0; } st(int a_, long long int b_, long long int c_) { go = a_; a = b_; b = c_; } }; vector<st> v[300002]; vector<st> g[300002]; int lim; st p[300002]; inline void trans(int b, int pr = -1) { if (pr == -1) { lim = n; } for (int j = 0; j < v[b].size(); j++) { if (v[b][j].go == pr) continue; if (g[b].size() == 2) { swap(g[b], g[lim]); lim++; g[b].push_back({lim - 1, 0, 0}); } g[b].push_back(v[b][j]); } for (int j = 0; j < v[b].size(); j++) { if (v[b][j].go == pr) continue; trans(v[b][j].go, b); } } bool used[300002]; int dp[300002]; pair<int, int> cent(int b, int whole, int pr = -1) { pair<int, int> ret = make_pair(INT_MAX, -1); dp[b] = 1; int deg = 0; for (int i = 0; i < g[b].size(); i++) { int go = g[b][i].go; if (go == pr) continue; if (used[go]) continue; ret = min(ret, cent(go, whole, b)); dp[b] += dp[go]; deg = max(deg, dp[go]); } deg = max(deg, whole - dp[b]); ret = min(ret, make_pair(deg, b)); return ret; } struct line { long long int a; long long int b; line(long long int A = 0, long long int B = 0) { a = A; b = B; } long long int at(long long int x) { return a * x + b; } }; inline bool enu(int b, vector<line> &lis, int pr = -1, line propagate = line()) { bool leaf = true; for (int i = 0; i < g[b].size(); i++) { int go = g[b][i].go; if (go == pr) continue; if (used[go]) continue; leaf = false; propagate.a += g[b][i].a; propagate.b += g[b][i].b; enu(go, lis, b, propagate); propagate.a -= g[b][i].a; propagate.b -= g[b][i].b; } if (leaf) lis.emplace_back(propagate); return true; } vector<line> all; bool cmp(line a, line b) { if (a.a == b.a) { return a.b < b.b; } return a.a < b.a; } vector<line> v2; void clean(vector<line> &v1) { v2.clear(); sort(v1.begin(), v1.end(), cmp); for (int i = 0; i < v1.size(); i++) { while (v2.size()) { if (v2.back().a == v1[i].a) { v2.pop_back(); continue; } if (v2.size() > 1) { auto a = v2[v2.size() - 2]; auto b = v2[v2.size() - 1]; auto c = v1[i]; if ((c.b - a.b) * (a.a - b.a) <= (b.b - a.b) * (a.a - c.a)) { v2.pop_back(); continue; } } break; } v2.push_back(v1[i]); } v1 = v2; } inline void init(int b) { cent(b, -1); b = cent(b, dp[b]).second; used[b] = true; vector<vector<line> > vv; for (int i = 0; i < g[b].size(); i++) { if (used[g[b][i].go]) continue; vv.push_back(vector<line>()); if (!enu(g[b][i].go, vv.back(), b, line(g[b][i].a, g[b][i].b))) vv.pop_back(); } while (1) { if (vv.size() == 0) break; if (vv.size() == 1) { for (auto el : vv[0]) { all.push_back(el); } vv.clear(); break; } for (int i = 0; i < vv.size(); i++) { clean(vv[i]); } for (int i1 = 0; i1 < vv.size(); i1++) { for (int j1 = i1 + 1; j1 < vv.size(); j1++) { int i = 0; int j = 0; while (i < vv[i1].size() && j < vv[j1].size()) { all.push_back( line(vv[i1][i].a + vv[j1][j].a, vv[i1][i].b + vv[j1][j].b)); if (i == vv[i1].size() - 1 && j == vv[j1].size() - 1) break; if (i == vv[i1].size() - 1) { j++; continue; } if (j == vv[j1].size() - 1) { i++; continue; } if (vv[i1][i].a == vv[i1][i + 1].a) { i++; continue; } if (vv[j1][j].a == vv[j1][j + 1].a) { j++; continue; } if ((vv[i1][i + 1].b - vv[i1][i].b) * (vv[j1][j].a - vv[j1][j + 1].a) <= (vv[i1][i].a - vv[i1][i + 1].a) * (vv[j1][j + 1].b - vv[j1][j].b)) { i++; } else { j++; } } } } break; } for (int i = 0; i < g[b].size(); i++) { if (used[g[b][i].go] == false) { init(g[b][i].go); } } } int main() { cin >> n >> m; for (int i = 1; i < n; i++) { int a, b; long long int c, d; scanf( %d%d%lld%lld , &a, &b, &c, &d); a--; b--; v[a].push_back(st(b, c, d)); v[b].push_back(st(a, c, d)); } trans(0); n = lim; for (int i = 0; i < n; i++) p[i].go = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < g[i].size(); j++) { p[g[i][j].go] = g[i][j]; p[g[i][j].go].go = i; } } for (int i = 0; i < n; i++) { if (p[i].go == -1) continue; g[i].push_back(p[i]); } init(0); int idx = 0; all.push_back(line()); clean(all); for (int t = 0; t <= m - 1; t++) { if (t) { printf( ); } long long int mx = 0; int pos = -1; while (idx + 1 < all.size() && all[idx].at(t) <= all[idx + 1].at(t)) { idx++; } printf( %lld , all[idx].at(t)); } puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 300500; int T[N], L[N], C[N]; int m; int len = 0; const int inf = 100500; int A[N]; int fs = -1, pos = -1; void apply() { for (int i = 0; i < m; i++) { if (i == m - 1) { pos = len; fs = m - 1; goto end; } if (T[i] == 1) { A[len++] = L[i]; if (len >= inf) { fs = i + 1; pos = len; goto end; } } else { assert(L[i] <= len); for (int q = 0; q < C[i]; q++) { for (int j = 0; j < L[i]; j++) { A[len++] = A[j]; } if (len >= inf) { for (int u = m - 1; u >= i; u--) T[u + 1] = T[u], L[u + 1] = L[u], C[u + 1] = C[u]; ++m; C[i + 1] = C[i] - q - 1; C[i] = q + 1; fs = i + 1; pos = len; goto end; } } } } end:; } inline int blen(int o) { if (T[o] == 1) return 1; else return L[o] * C[o]; } int main() { scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %d , &T[i]); if (T[i] == 1) scanf( %d , &L[i]); else scanf( %d %d , &L[i], &C[i]); } T[m] = 0; L[m] = -42; m++; apply(); int n; scanf( %d , &n); int curg = fs; long long l = pos, r = pos + blen(fs); for (int i = 0; i < n; i++) { long long x; scanf( %I64d , &x); --x; int ans = -1; if (x < len) ans = A[(int)x]; else { while (r <= x && curg < m - 1) l = r, r += blen(++curg); assert(l <= x && x < r); if (T[curg] == 1) ans = L[curg]; else ans = A[(x - l) % L[curg]]; } printf( %d%c , ans, n [i + 1 == n]); } }
#include <bits/stdc++.h> using namespace std; int main() { int t; string s1, s2, s3; cin >> t; map<string, int> mp; mp[ polycarp ] = 1; while (t--) { cin >> s1 >> s2 >> s3; transform(s1.begin(), s1.end(), s1.begin(), ::tolower); transform(s3.begin(), s3.end(), s3.begin(), ::tolower); mp[s1] = mp[s3] + 1; } map<string, int>::iterator it; int ans = 0; for (it = mp.begin(); it != mp.end(); ++it) if (it->second > ans) ans = it->second; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int vp, vd, t, f, c, ans = 0; double tempt; double curs = 0; cin >> vp >> vd >> t >> f >> c; curs = vp * t; if (vp >= vd) { cout << 0 << endl; return 0; } while (curs < c) { tempt = curs / (vd - vp); curs += tempt * vp; if (curs >= c) break; else curs += (tempt + f) * vp; ans++; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const long long INFL = 1e18 + 123; const double PI = atan2(0, -1); mt19937 tw(960172); long long rnd(long long x, long long y) { static uniform_int_distribution<long long> d; return d(tw) % (y - x + 1) + x; } bool check(string s) { string tmp = s; reverse(tmp.begin(), tmp.end()); return tmp != s; } void solve() { string s; cin >> s; int ans = 0; for (int i = 0; i < ((int)(s).size()); ++i) { string cur = ; for (int j = i; j < ((int)(s).size()); ++j) { cur += s[j]; if (check(cur)) { ans = max(ans, j - i + 1); } } } cout << ans << n ; } int main() { cerr << fixed << setprecision(15); cout << fixed << setprecision(15); ios::sync_with_stdio(false); int tests = 1; for (int it = 1; it <= tests; ++it) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; int n; cin >> t; for (int i = 0; i < t; i++) { cin >> n; int arr[2 * n]; for (int j = 0; j < 2 * n; j++) { cin >> arr[j]; } sort(arr, arr + 2 * n); vector<int> left, right; for (int j = 0; j < 2 * n; j++) { if (j == 2 * n - 1) { if (n % 2 == 0) { if (j % 2 != 0) left.push_back(arr[j]); else right.push_back(arr[j]); } else { if (j % 2 == 0) left.push_back(arr[j]); else right.push_back(arr[j]); } } else { if (j % 2 == 0) left.push_back(arr[j]); else right.push_back(arr[j]); } } cout << abs(left[left.size() / 2] - right[right.size() / 2]) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int a[n]; for (int i = 0; i < n; ++i) { scanf( %d , a + i); } sort(a, a + n); if (n % 2) printf( %d n , a[n / 2]); else printf( %d n , a[n / 2 - 1]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int q, n, x, y, f1, f2, f3, f4; cin >> q; for (int i = 0; i < q; ++i) { cin >> n; int minx = -100000, miny = -100000, maxx = 100000, maxy = 100000; for (int o = 0; o < n; ++o) { cin >> x >> y >> f1 >> f2 >> f3 >> f4; if (f1 == 0 && minx < x) { minx = x; } if (f2 == 0 && maxy > y) { maxy = y; } if (f3 == 0 && maxx > x) { maxx = x; } if (f4 == 0 && miny < y) { miny = y; } } if (minx > maxx || miny > maxy) { cout << 0 << endl; } else { cout << 1 << << minx << << miny << endl; } } cin >> n; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int main() { int t; cin >> t; while (t--) { long long a, b; cin >> a >> b; int tmp = b + 1; long long len = -1; while (tmp != 0) { tmp /= 10; len++; } long long ans = a * len; cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; bitset<7000> bit; int main() { int n, count = 0; cin >> n; while (n--) { int int1, int2; string stars; cin >> int1 >> int2; if (n >= 1) cin >> stars; int a = int1 / 10, b = int1 % 10, c = int2 % 10, d = int2 / 10; int i1 = 1000 * a + 100 * b + 10 * c + d, i2 = 1000 * d + 100 * a + 10 * b + c, i3 = 1000 * c + 100 * d + 10 * a + b, i4 = 1000 * b + 100 * c + 10 * d + a; if (!bit[i1] && !bit[i2] && !bit[i3] && !bit[i4]) { count++; bit.set(i1); bit.set(i2); bit.set(i3); bit.set(i4); } } cout << count << endl; }
#include <bits/stdc++.h> using namespace std; const int maxN = (int)3e5, maxM = (int)2e3, intMax = INT_MAX, maxValue = (int)1e4, intInf = (int)1e9, mod = (int)1e9 + 7, www = 97; const long long llmax = LLONG_MAX, INF = (long long)1e9 + 1; long long nod(long long a, long long b) { while (a != 0 && b != 0) { if (a < b) b %= a; else a %= b; } return a + b; } int nod(int a, int b) { while (a != 0 && b != 0) { if (a < b) b %= a; else a %= b; } return a + b; } long long nok(long long a, long long b) { return a * b / nod(a, b); } int nok(int a, int b) { return a * b / nod(a, b); } long long modPlus(long long a, long long b) { return ((a % mod) + (b % mod)) % mod; } int modPlus(int a, int b) { return ((a % mod) + (b % mod)) % mod; } long long binPow(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; } double binPow(double a, long long b) { double res = 1; while (b) { if (b % 2 == 1) { res *= a; while (res >= mod) res -= mod; } a *= a; while (a >= mod) a -= mod; b >>= 1; } return res; } long long mulmod(long long a, long long b) { long long res = 0; a = a % mod; while (b > 0) { if (b % 2 == 1) res = (res + a) % mod; a = (a * 2) % mod; b /= 2; } return res % mod; } pair<int, int> max(pair<int, int> a, pair<int, int> b) { if (a.first > b.first) return a; if (a.first < b.first) return b; if (a.second > b.second) return a; return b; } pair<int, int> min(pair<int, int> a, pair<int, int> b) { if (a.first < b.first) return a; if (a.first != b.first) return b; if (a.second < b.second) return a; return b; } int n, k, Q[4][maxN]; vector<tuple<int, int, int> > res; int main() { scanf( %d%d , &n, &k); int x = -1, y = -1; int count = 0; for (int i = 0; i < 4; ++i) { for (int j = 0; j < n; ++j) { scanf( %d , &Q[i][j]); if (i && i < 3) { if (Q[i][j]) count++; else { x = j; y = i - 1; } } if ((i == 1 || i == 3) && Q[i - 1][j] == Q[i][j]) { x = j; if (i == 1) y = 0; else y = 1; } } } if (x == -1) { printf( %d n , -1); fflush(stdout); return 0; } while (count) { if (y) { if (Q[1 + y][x]) { res.emplace_back(Q[1 + y][x], 4, x + 1); Q[1 + y][x] = 0; count--; } else if (x) { if (Q[1 + y][x - 1] && Q[1 + y][x - 1] != Q[2 + y][x - 1]) { res.emplace_back(Q[1 + y][x - 1], 3, x + 1); Q[1 + y][x] = Q[1 + y][x - 1]; Q[1 + y][x - 1] = 0; } x--; } else { if (Q[1][0] && Q[1][0] != Q[0][0]) { res.emplace_back(Q[1][x], 3, 1); Q[2][0] = Q[1][0]; Q[1][0] = 0; } y = !y; } } else { if (Q[1 + y][x]) { res.emplace_back(Q[1 + y][x], 1, x + 1); Q[1 + y][x] = 0; count--; } else if (x < n - 1) { if (Q[1 + y][x + 1] && Q[1 + y][x + 1] != Q[0][x + 1]) { res.emplace_back(Q[1 + y][x + 1], 2, x + 1); Q[1 + y][x] = Q[1 + y][x + 1]; Q[1 + y][x + 1] = 0; } x++; } else { if (Q[2][n - 1] && Q[2][n - 1] != Q[3][n - 1]) { res.emplace_back(Q[2][n - 1], 2, n); Q[1][n - 1] = Q[2][n - 1]; Q[2][n - 1] = 0; } y = !y; } } } printf( %d n , (int)res.size()); fflush(stdout); int a, b, c; for (auto i : res) { tie(a, b, c) = i; printf( %d %d %d n , a, b, c); } return 0; }
#include <bits/stdc++.h> int main() { unsigned long long int n; scanf( %llu , &n); printf( %llu , (n / 2) + 1); }
#include <bits/stdc++.h> using namespace std; int dx[3] = {-1, 1, 0}; int dy[3] = {1, 1, 1}; int d[5][205]; char mp[5][205]; int n, k, flag; void dfs(int x, int y) { d[x][y] = 1; if (flag) return; if (y >= n) { flag = 1; return; } if (mp[x][y + 1] != . ) return; if (x < 2 && !d[x + 1][y + 3]) { if (mp[x + 1][y + 1] == . && mp[x + 1][y + 2] == . && mp[x + 1][y + 3] == . ) dfs(x + 1, y + 3); } if (x > 0 && !d[x - 1][y + 3]) { if (mp[x - 1][y + 1] == . && mp[x - 1][y + 2] == . && mp[x - 1][y + 3] == . ) dfs(x - 1, y + 3); } if (!d[x][y + 3]) { if (mp[x][y + 1] == . && mp[x][y + 2] == . && mp[x][y + 3] == . ) dfs(x, y + 3); } } int main() { int t; cin >> t; while (t--) { memset(d, 0, sizeof(d)); cin >> n >> k; for (int i = 0; i < 3; i++) { for (int j = 0; j < n; j++) { cin >> mp[i][j]; } mp[i][n] = mp[i][n + 1] = mp[i][n + 2] = mp[i][n + 3] = mp[i][n + 4] = mp[i][n + 5] = mp[i][n + 6] = mp[i][n + 7] = . ; } flag = 0; for (int i = 0; i < 3; i++) { for (int j = 0; j < n; j++) { if (mp[i][j] == s ) { dfs(i, j); } } } if (flag) cout << YES << endl; else cout << NO << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int cx[] = {-1, 0, 0, 1, -1, -1, 1, 1, 0}, cy[] = {0, -1, 1, 0, -1, 1, 1, -1, 0}; int ingrid(int ii, int jj, int R, int C) { if (ii < 0 || jj < 0 || ii >= R || jj >= C) return 0; return 1; } int main() { long long n; cin >> n; long long maxx = -1, minn = (1LL << 60); for (int i = 1; i <= sqrt(n); i++) { long long a = i; if (n % a == 0) { long long c = n / a; for (int i = a; i <= sqrt(c); i++) { if (c % i == 0) { long long b = c / i; long long c = i; long long temp = (a + 1) * (b + 2) * (c + 2); minn = min(minn, temp); maxx = max(maxx, temp); temp = (b + 1) * (a + 2) * (c + 2); minn = min(minn, temp); maxx = max(maxx, temp); temp = (c + 1) * (a + 2) * (b + 2); minn = min(minn, temp); maxx = max(maxx, temp); } } } } cout << minn - n << << maxx - n << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; const int INF = ~0U >> 1; int N, idx[MAXN]; map<int, int> mp, o_cnt, ls; map<int, vector<int> > rs; int main() { scanf( %d , &N); int a; for (int i = 1; i <= N; ++i) { scanf( %d , &a); mp[a] = i; } int o = INF; for (int i = 1; i <= N; ++i) { scanf( %d , &a); a = idx[i] = mp[a]; if (i <= a) { o_cnt[ls[i] = a - i] += 1; } else { rs[i - a].push_back(i); } o = min(o, abs(a - i)); } printf( %d n , o); for (int i = 1; i < N; ++i) { if ((o_cnt[ls[i]] -= 1) == 0) { o_cnt.erase(o_cnt.find(ls[i])); } ls.erase(ls.find(i)); rs[N + i - idx[i]].push_back(i); if (rs.count(i)) { for (vector<int>::iterator it = rs[i].begin(); it != rs[i].end(); ++it) { o_cnt[ls[*it] = -i] += 1; } rs.erase(rs.find(i)); } o = o_cnt.size() ? o_cnt.begin()->first + i : INF; o = min(o, rs.size() ? rs.begin()->first - i : INF); printf( %d n , o); } return 0; }
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long n, ans, dp[200005][3], sz[200005][3]; vector<int> gr[200005]; void dfs(int x, int p) { sz[x][0]++; for (int i = 0; i < gr[x].size(); i++) { int u = gr[x][i]; if (u == p) continue; dfs(u, x); dp[x][0] += dp[u][1] + sz[u][1] + 1; dp[x][1] += dp[u][0] + sz[u][0]; sz[x][0] += sz[u][0]; sz[x][1] += sz[u][1]; } } void root(int x, int p) { ans += dp[x][0]; for (int i = 0; i < gr[x].size(); i++) { int u = gr[x][i]; if (u == p) continue; dp[x][0] -= dp[u][1] + sz[u][1] + 1; dp[x][1] -= dp[u][0] + sz[u][0]; sz[x][0] -= sz[u][0]; sz[x][1] -= sz[u][1]; sz[u][1] += sz[x][1]; sz[u][0] += sz[x][0]; dp[u][1] += dp[x][0] + sz[x][0]; dp[u][0] += dp[x][1] + sz[x][1] + 1; root(u, x); dp[u][0] -= dp[x][1] + sz[x][1] + 1; dp[u][1] -= dp[x][0] + sz[x][0]; sz[u][0] -= sz[x][0]; sz[u][1] -= sz[x][1]; sz[x][1] += sz[u][1]; sz[x][0] += sz[u][0]; dp[x][1] += dp[u][0] + sz[u][0]; dp[x][0] += dp[u][1] + sz[u][1] + 1; } } int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; gr[x].push_back(y); gr[y].push_back(x); } dfs(1, 0); root(1, 0); cout << ans / 2; }
#include <bits/stdc++.h> using namespace std; int main() { int n; string s, t; cin >> n >> s >> t; vector<int> a(n + 1); for (int i = 0; i < n; ++i) a[i] = (s[n - i - 1] - a ) + (t[n - i - 1] - a ); for (int i = 0; i < n; ++i) { if (a[i] >= 26) { ++a[i + 1]; a[i] -= 26; } } vector<int> b(n + 1); b[0] = a[0] / 2; for (int i = 1; i <= n; ++i) { b[i] = a[i] / 2; if (a[i] & 1) b[i - 1] += 13; } for (int i = n - 1; i >= 0; --i) cout << char( a + b[i]); }
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k, l; cin >> n >> m >> k >> l; if (m > n || n - k < l) return cout << -1, 0; long long ans = k / m; k %= m; while (k > 0) { k -= m; ans++; } l += k; ans += (l + m - 1) / m; if (ans * m > n) return cout << -1, 0; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:16777216 ) const string debug_line = yolo ; const long long linf = 1e15 + 5; const int BLOCK = 330; struct answerType { int val; vector<int> edges; public: answerType() { val = INT_MAX; edges.clear(); }; answerType(int _val, vector<int> _edges) { val = _val; edges = _edges; }; void reset() { val = 0; edges.clear(); } }; struct solve { bool visited[1010]; int component[1010]; int arr[1010]; bool isbridge[30010]; vector<pair<pair<int, int>, int> > Adj[1010]; queue<int> Q[1010]; int comp2[1010]; vector<int> tree[1010]; int P[1010][36]; int level1[1010]; vector<pair<pair<pair<int, int>, int>, int> > edges; int s; int t; int ignoreEdge; int n; int m; answerType answer; int comcount; int countPairNodes; map<pair<int, int>, int> mp1; vector<int> edgeList[30010]; int dfs_timer; solve() { s = -1; t = -1; ignoreEdge = -1; edges.clear(); n = -1; m = -1; countPairNodes = 0; comcount = 0; dfs_timer = 0; }; solve(int _s, int _t, int _ignoreEdge, vector<pair<pair<pair<int, int>, int>, int> > _edges, int _n, int _m) { s = _s; t = _t; n = _n; m = _m; countPairNodes = 0; comcount = 0; ignoreEdge = _ignoreEdge; edges = _edges; dfs_timer = 0; for (int(i) = (0); (i) < (n + 1); ++(i)) { Adj[i].clear(); visited[i] = false; } for (int(i) = (0); (i) < (m + 1); ++(i)) { isbridge[i] = false; } for (auto &(t1) : (edges)) { if (t1.second != ignoreEdge) { Adj[t1.first.first.first].push_back(make_pair( make_pair(t1.first.first.second, t1.first.second), t1.second)); Adj[t1.first.first.second].push_back(make_pair( make_pair(t1.first.first.first, t1.first.second), t1.second)); } } answer.val = INT_MAX; answer.edges.clear(); }; public: int DFS(int u, int p, int edge) { visited[u] = true; component[u] = comcount; arr[u] = dfs_timer++; int dbe = arr[u]; for (auto &(t1) : (Adj[u])) { if (!visited[t1.first.first] && t1.first.first != p) { dbe = min(dbe, DFS(t1.first.first, u, t1.second)); } else if (edge != t1.second) { dbe = min(dbe, arr[t1.first.first]); } } if (dbe == arr[u] && edge != -1) { isbridge[edge] = true; } return dbe; }; void DFS1(int u) { int curcmp = comcount; Q[curcmp].push(u); visited[u] = true; while (!Q[curcmp].empty()) { int v = Q[curcmp].front(); comp2[v] = curcmp; Q[curcmp].pop(); for (auto &(t1) : (Adj[v])) { if (visited[t1.first.first]) { continue; } else if (isbridge[t1.second]) { comcount++; tree[curcmp].push_back(comcount); tree[comcount].push_back(curcmp); DFS1(t1.first.first); } else { Q[curcmp].push(t1.first.first); visited[t1.first.first] = true; } } } }; void DFS2(int u, int p) { visited[u] = true; P[u][0] = p; level1[u] = level1[p] + 1; for (int(i) = (1); (i) < (35); ++(i)) { P[u][i] = P[P[u][i - 1]][i - 1]; } for (auto &(t1) : (tree[u])) { if (!visited[t1]) { DFS2(t1, u); } } }; int LCA(int u, int v) { if (level1[u] < level1[v]) { swap(u, v); } for (int(i) = (34); (i) > (-1); --(i)) { if (level1[P[u][i]] >= level1[v]) { u = P[u][i]; } } if (u == v) { return u; } for (int(i) = (34); (i) > (-1); --(i)) { if (P[u][i] != P[v][i]) { u = P[u][i]; v = P[v][i]; } } return P[u][0]; }; void fillListNodes(vector<pair<int, int> > &listNodes, int s, int t) { int lca = LCA(s, t); if (lca == s) { int currNode = t; while (currNode != lca) { listNodes.push_back(make_pair(currNode, P[currNode][0])); currNode = P[currNode][0]; } } else if (lca == t) { int currNode = s; while (currNode != lca) { listNodes.push_back(make_pair(currNode, P[currNode][0])); currNode = P[currNode][0]; } } else { int currNode = s; while (currNode != lca) { listNodes.push_back(make_pair(currNode, P[currNode][0])); currNode = P[currNode][0]; } currNode = t; while (currNode != lca) { listNodes.push_back(make_pair(currNode, P[currNode][0])); currNode = P[currNode][0]; } } }; void findAnswer() { memset(visited, 0, sizeof(visited)); for (int(i) = (1); (i) < (n + 1); ++(i)) { if (!visited[i]) { DFS(i, 0, -1); comcount++; } } memset(visited, 0, sizeof(visited)); for (int(i) = (1); (i) < (n + 1); ++(i)) { if (!visited[i]) { DFS1(i); } } memset(visited, 0, sizeof(visited)); for (int(i) = (1); (i) < (n + 1); ++(i)) { if (!visited[i]) { level1[i] = 0; DFS2(i, i); } } for (int(i) = (1); (i) < (n + 1); ++(i)) { } for (auto &(t1) : (edges)) { if (isbridge[t1.second]) { if (level1[comp2[t1.first.first.first]] < level1[comp2[t1.first.first.second]]) { swap(t1.first.first.first, t1.first.first.second); } if (mp1.count(make_pair(comp2[t1.first.first.first], comp2[t1.first.first.second])) == 0) { mp1[make_pair(comp2[t1.first.first.first], comp2[t1.first.first.second])] = countPairNodes++; } assert(level1[comp2[t1.first.first.first]] - level1[comp2[t1.first.first.second]] == 1); edgeList[mp1[make_pair(comp2[t1.first.first.first], comp2[t1.first.first.second])]] .push_back(t1.second); } } if (component[s] != component[t]) { if (ignoreEdge == -1) { answer.val = 0; answer.edges.clear(); } else { answer.val = edges[ignoreEdge].first.second; answer.edges = {ignoreEdge + 1}; } return; } else { int s1 = s; int t1 = t; s1 = comp2[s1]; t1 = comp2[t1]; if (s1 == t1) { answer.val = INT_MAX; answer.edges.clear(); return; } int lca = LCA(s1, t1); vector<pair<int, int> > listNodes; fillListNodes(listNodes, s1, t1); answerType temp; bool poss = false; for (auto &(t1) : (listNodes)) { if (edgeList[mp1[t1]].size() == 1) { answerType currentAnswer; if (ignoreEdge == -1) { poss = true; currentAnswer.val = edges[edgeList[mp1[t1]][0]].first.second; currentAnswer.edges = {edgeList[mp1[t1]][0] + 1}; } else { poss = true; currentAnswer.val = edges[edgeList[mp1[t1]][0]].first.second + edges[ignoreEdge].first.second; currentAnswer.edges = {edgeList[mp1[t1]][0] + 1, ignoreEdge + 1}; } if (currentAnswer.val < answer.val) { answer = currentAnswer; } } } if (!poss) { answer.val = INT_MAX; answer.edges.clear(); } } }; }; vector<pair<pair<pair<int, int>, int>, int> > edges; vector<pair<pair<int, int>, int> > Adj[1010]; bool visited[1010]; vector<int> answerPath; answerType answer; vector<int> path; void DFSPath(int u, int p, int end1) { visited[u] = true; if (u == end1) { answerPath = path; } for (auto &(t1) : (Adj[u])) { if (!visited[t1.first.first] && t1.first.first != p) { path.push_back(t1.second); DFSPath(t1.first.first, u, end1); path.pop_back(); } } } int main() { int n, m; scanf( %d%d , &n, &m); int s, t; scanf( %d%d , &s, &t); for (int(i) = (0); (i) < (m); ++(i)) { int a, b, c; scanf( %d%d%d , &a, &b, &c); edges.push_back(make_pair(make_pair(make_pair(a, b), c), i)); Adj[a].push_back(make_pair(make_pair(b, c), i)); Adj[b].push_back(make_pair(make_pair(a, c), i)); } solve tryAll = solve(s, t, -1, edges, n, m); tryAll.findAnswer(); if (tryAll.answer.val < answer.val) { answer = tryAll.answer; } DFSPath(s, 0, t); for (auto &(t1) : (answerPath)) { solve tryAll = solve(s, t, t1, edges, n, m); tryAll.findAnswer(); if (tryAll.answer.val < answer.val) { answer = tryAll.answer; } } if (answer.val == INT_MAX) { printf( -1 n ); } else { printf( %d n , answer.val); printf( %d n , (int)answer.edges.size()); for (auto &(t1) : (answer.edges)) { printf( %d , t1); } printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 300 * 1000 + 9; const int LOGN = 19; const int M = 21; const long long INF64 = 1e18; int n, m, q; vector<pair<int, int> > g[N]; int p[LOGN][N]; int tin[N], tout[N], T; long long h[N]; set<pair<int, int> > badEdges; long long d[M + M][N]; bool u[N]; void dfs(int v, int pr) { tin[v] = T++; p[0][v] = pr; u[v] = true; for (int i = 1; i < LOGN; ++i) p[i][v] = p[i - 1][p[i - 1][v]]; for (auto e : g[v]) { int to = e.first, len = e.second; if (!u[to]) { h[to] = h[v] + len; dfs(to, v); if (v < to) badEdges.erase(make_pair(v, to)); else badEdges.erase(make_pair(to, v)); } } tout[v] = T; } bool isAncestor(int a, int b) { return tin[a] <= tin[b] && tout[a] >= tout[b]; } int getLCA(int a, int b) { if (isAncestor(a, b)) return a; if (isAncestor(b, a)) return b; for (int i = LOGN - 1; i >= 0; --i) if (!isAncestor(p[i][a], b)) a = p[i][a]; return p[0][a]; } void dij(int st, long long d[N]) { set<pair<long long, int> > q; for (int i = 0; i < n; ++i) d[i] = INF64; d[st] = 0; q.insert(make_pair(d[st], st)); while (!q.empty()) { int v = q.begin()->second; q.erase(q.begin()); for (auto e : g[v]) { int to = e.first, len = e.second; if (d[to] > d[v] + len) { q.erase(make_pair(d[to], to)); d[to] = d[v] + len; q.insert(make_pair(d[to], to)); } } } } int main() { scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) { int u, v, w; scanf( %d %d %d , &u, &v, &w); --u, --v; g[u].push_back(make_pair(v, w)); g[v].push_back(make_pair(u, w)); } for (int v = 0; v < n; ++v) for (auto e : g[v]) if (v < e.first) badEdges.insert(make_pair(v, e.first)); dfs(0, 0); int cpos = 0; for (auto e : badEdges) dij(e.first, d[cpos++]); scanf( %d , &q); for (int tc = 0; tc < q; ++tc) { int u, v; scanf( %d %d , &u, &v); --u, --v; int lca = getLCA(u, v); long long ans = h[u] + h[v] - 2 * h[lca]; for (int i = 0; i < badEdges.size(); ++i) ans = min(ans, d[i][u] + d[i][v]); printf( %lld n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int i, j; int n; scanf( %d , &n); if ((n * n) % 2 == 1) { printf( %d n , ((n * n) / 2) + 1); } else { printf( %d n , (n * n) / 2); } for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if ((i + j) % 2 == 0) { printf( C ); } else { printf( . ); } } printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; bitset<20> a; vector<int> w; int sol = 0; void verific(int &l, int &r, int &x) { int sum = 0, i, minim = INT_MAX, maxim = INT_MIN; for (i = 0; i < w.size(); ++i) { if (a[i]) { sum += w[i]; minim = min(minim, w[i]); maxim = max(maxim, w[i]); } } if (sum >= l and sum <= r and maxim - minim >= x) ++sol; } int main() { int n, i, val, l, r, x; cin >> n >> l >> r >> x; for (i = 1; i <= n; ++i) { cin >> val; w.push_back(val); } for (i = 1; i <= 1 << n; ++i) { a = i; if (i & (i - 1) == 0) continue; verific(l, r, x); } cout << sol; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; string s; cin >> s; int arr[10] = {0}; for (int i = 0; i < s.size(); i++) { if (s[i] == L ) { int i = 0; for (; i < 10; i++) { if (arr[i] == 0) break; } arr[i] = 1; } else if (s[i] == R ) { int i = 9; for (; i >= 0; i--) { if (arr[i] == 0) break; } arr[i] = 1; } else { int t = s[i] - 48; arr[t] = 0; } } for (int i = 0; i < 10; i++) cout << arr[i]; return 0; }