func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int abs(int x) { return x >= 0 ? x : -x; } int main() { int n; cin >> n; while (n--) { vector<int> x; vector<int> y; char tmp; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> tmp; if (tmp == K ) { x.push_back(i); y.push_back(j); } } } int tx, ty; tx = abs(x[0] - x[1]); ty = abs(y[0] - y[1]); if ((tx % 4 == 0) && (ty % 4 == 0) && ((tx + ty) % 4 == 0)) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int n, i, j, k, mx = 0, sum = 0, vis[5005], letter[26], check[26][5005][26], ok; double ans = 0; int main() { cin >> s; n = s.length(); s = s + s; for (i = 0; i < n; i++) { letter[s[i] - a ]++; for (j = i; j < i + n; j++) { check[s[i] - a ][j - i + 1][s[j] - a ]++; } } for (i = 0; i < 26; i++) { if (!letter[i]) continue; mx = -1; for (j = 2; j <= n; j++) { sum = 0; for (k = 0; k < 26; k++) if (check[i][j][k] == 1) sum += 1; mx = max(mx, sum); } ans += 1.0 * mx / n; } printf( %lf , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int>> sms; int time1, amount1; for (int i = 0; i < n; i++) { cin >> time1 >> amount1; sms.push_back(make_pair(time1, amount1)); } int time = 0; int amount = 0; int maxamount = 0; for (int i = 0; i < n; i++) { if (amount <= sms[i].first - time) { time = sms[i].first; amount = sms[i].second; } else { amount -= sms[i].first - time; time += sms[i].first - time; amount += sms[i].second; } if (amount > maxamount) maxamount = amount; } if (amount) { if (amount > maxamount) maxamount = amount; time += amount; } cout << time << << maxamount << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int n, t, cc, flag[maxn], a[maxn]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; if (n == 1) { cout << + << endl; return 0; } for (int i = 1; i <= n; i++) flag[i] = 1; flag[n] = -1; flag[n - 1] = -1; t = a[n] - a[n - 1]; for (int i = n - 2; i >= 1; i--) { if (t >= a[i]) { t = t - a[i]; flag[i + 1] *= -1; flag[i] *= -1; } else { t = a[i] - t; flag[i + 1] *= -1; } } cc = 1; for (int i = 1; i <= n; i++) { cc *= flag[i]; if (cc < 0) cout << - ; else cout << + ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; double revs, a, b, c, d, C, totdist; const double pi = atan(1) * 4; int n, r, v, s, f; double distcovered(double t) { return max(r * (t + sin(t)), r * (t - sin(t))); } int main() { cout << fixed << setprecision(8); cin >> n >> r >> v; for (int c = 0; c < n; c++) { scanf( %d%d , &s, &f); a = f - s; a = a / 2; double up, low; low = 0; up = a / r + 2 * pi; for (int c = 0; c < 100; c++) { double mid = (low + up) / 2; b = distcovered(mid); if (b == a) break; else if (b > a) up = mid; else low = mid; } double mid = (low + up) / 2; double speed = (double)v / r; double time = mid / speed * 2; printf( %.8f n , time); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e15; const int MOD = 1e9 + 7; const double EPS = 1e-7; const double PI = acos(-1.0); const int N = 3e5 + 5; long long n, a[N]; int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; } long long ans = 0, left = 0; for (int i = 0; i < n; ++i) { if (i) { ans += min(a[i] / 2, left); long long tmp = left; left -= min(a[i] / 2, left); a[i] -= min(a[i] / 2 * 2, tmp * 2); } ans += a[i] / 3; a[i] -= a[i] / 3 * 3; left += a[i]; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; void make(vector<pair<int, int> > &a, long long int b) { int last = 0; int n = a.size(); for (int i = 0; i < a.size() - 1; i++) { if (b >= pow(2, n - 2 - i)) { a[i].first = n - last; last++; b = b - pow(2, n - 2 - i); } else { a[i].first = i + 1 - last; } } a[n - 1].first = n - last; } int main() { long long int n, b; cin >> n >> b; vector<pair<int, int> > a; for (int i = 0; i < n; i++) { a.push_back(make_pair(0, i + 1)); } make(a, b - 1); sort(a.begin(), a.end()); for (int i = 0; i < n; i++) cout << a[i].second << ; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int MAX = 1000005; int n, k; int st1[MAX][20]; int st2[MAX][20]; int v[MAX]; int c[MAX]; int ans[MAX]; double factor[MAX]; int log(int x) { int ct = 0; int k = 1; while (k <= x) { k *= 2; ct++; } return ct - 1; } int pow2(int x) { int ans = 1; for (int i = 0; i < x; i++) { ans *= 2; } return ans; } void process2() { for (int j = 1; (1 << j) <= n; j++) { for (int i = 1; i + (1 << j) - 1 <= n; i++) { if (st2[i][j - 1] < st2[i + (1 << (j - 1))][j - 1]) { st2[i][j] = st2[i][j - 1]; } else { st2[i][j] = st2[i + (1 << (j - 1))][j - 1]; } } } } int rmq2(int i, int j) { int k = log(j - i + 1); if (st2[i][k] <= st2[j - pow2(k) + 1][k]) { return st2[i][k]; } return st2[j - pow2(k) + 1][k]; } void process1() { for (int j = 1; (1 << j) <= n; j++) { for (int i = 1; i + (1 << j) - 1 <= n; i++) { if (st1[i][j - 1] > st1[i + (1 << (j - 1))][j - 1]) { st1[i][j] = st1[i][j - 1]; } else { st1[i][j] = st1[i + (1 << (j - 1))][j - 1]; } } } } int rmq1(int i, int j) { int k = log(j - i + 1); if (st1[i][k] >= st1[j - pow2(k) + 1][k]) { return st1[i][k]; } return st1[j - pow2(k) + 1][k]; } int first(int l, int r) { return 100 * rmq1(l, r); } int g(int l, int r) { return rmq2(l, r); } int p(int l, int r) { return min(g(l, r), first(l, r)); } int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , &v[i + 1]); st1[i + 1][0] = v[i + 1]; } for (int i = 0; i < n; i++) { scanf( %d , &c[i + 1]); st2[i + 1][0] = c[i + 1]; } process1(); process2(); factor[1] = (k + 0.0) / n; for (int i = 2; i < n + 1; i++) { factor[i] = factor[i - 1] * (0.0 + n - k - (i - 2)) / (n - i + 1); } for (int l = 1; l < n + 1; l++) { int lo = l; int hi = n; while (lo < hi) { int mid = (lo + hi) / 2; if (first(l, mid) == g(l, mid)) { lo = mid; ans[l] = first(l, mid); break; } if (first(l, mid) < g(l, mid)) { lo = mid + 1; } else { hi = mid; } } if (ans[l] == 0) { ans[l] = p(l, lo); if (l <= lo - 1) { ans[l] = max(ans[l], p(l, lo - 1)); } } } sort(ans + 1, ans + n + 1); double fin = 0; for (int i = 1; i < n + 1; i++) { fin += ans[i] * factor[i]; } printf( %.10f n , fin); } |
#include <bits/stdc++.h> using namespace std; void fast_in_out() { std::ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); } int main() { fast_in_out(); int n, x, y, c = 0; cin >> n; for (int(i) = 0; (i) < (n); ++(i)) { cin >> x >> y; if (y >= x + 2) c++; } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int w, h; cin >> w >> h; long long int cnt = 0; for (int i = 2; i <= w; i += 2) { for (int j = 2; j <= h; j += 2) { cnt += ((w - i + 1) * (h - j + 1)); } } cout << cnt; return 0; } |
#include <bits/stdc++.h> const int mxn = 1e5 * 4 + 10, mod = 1e9 + 7; using namespace std; long long phi(long long n); long long gcd(long long a, long long b); long long lcm(long long a, long long b); long long n, m, t = 0, l, k, a, tmp, d; int mn = 1e9, mx = -1; int main() { cin >> n >> t >> k >> d; long long ao, bo, c, g; c = (n + k - 1) / k; ao = c * t; c -= d / t; g = d / t * t; c -= (d - g) / t; g += (d - g) / t * t; if (c % 2) { g += (c / 2 + 1) * t; d += (c / 2) * t; } else { g += (c / 2) * t; d += (c / 2) * t; } bo = max(d, g); cout << ((ao > bo) ? YES : NO ); } long long phi(long long n) { long long res = n, i = 2; for (; i * i <= n; i++) if (n % i == 0) { while (n % i == 0) n = n / i; res -= res / i; } if (n > 1) res -= res / n; return res; } long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } |
#include <bits/stdc++.h> using namespace std; int x[10007], y[10007]; int n, w, v, u; int main() { cin >> n >> w >> v >> u; double maxer = -1; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; } double lim = u * 1.0 / v; bool flag1 = false; bool flag2 = false; for (int i = 0; i < n; i++) { if (y[i] * 1.0 / x[i] > lim || y[i] * 1.0 / x[i] < 0) { flag1 = true; } if (y[i] * 1.0 / x[i] < lim) { flag2 = true; } double tmp = x[i] * 1.0 / v + (w - y[i]) * 1.0 / u; maxer = max(maxer, tmp); } if (flag1 == false || flag2 == false) { printf( %.10f n , w * 1.0 / u); return 0; } printf( %.10f n , maxer); } |
#include <bits/stdc++.h> using namespace std; int a[200002], ans[200002]; int main() { int n, i, k = 0, sum = 0; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } for (i = 0; i < n; i++) { if (((sum - a[i]) / (n - 1) == a[i]) && ((sum - a[i]) % (n - 1) == 0)) ans[k++] = i + 1; } printf( %d n , k); for (i = 0; i < k; i++) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int cnt[22]; int main() { int n; cin >> n; int a; for (int i = 0; i < n; i++) { cin >> a; cnt[a + 10]++; } long long int ans = cnt[10] * (cnt[10] - 1) / 2; for (int i = 1; i <= 10; i++) ans += cnt[-i + 10] * cnt[i + 10]; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10, size = 1 << 20, mod = 998244353; template <class o> void qr(o &x) { char c = getchar(); x = 0; int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); x *= f; } template <class o> void qw(o x) { if (x / 10) qw(x / 10); putchar(x % 10 + 0 ); } template <class o> void pr1(o x) { if (x < 0) x = -x, putchar( - ); qw(x); putchar( ); } template <class o> void pr2(o x) { if (x < 0) x = -x, putchar( - ); qw(x); puts( ); } long long mult(long long a, long long b, long long p) { a = (a % p + p) % p; b = (b % p + p) % p; long long c = (long double)a * b / p; return a * b - c * p; } long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long power(long long a, long long b = mod - 2) { long long c = 1; while (b) { if (b & 1) c = c * a % mod; b /= 2; a = a * a % mod; } return c; } long long Power(long long a, long long b = mod - 2) { long long c = 1; while (b) { if (b & 1) c = mult(c, a, mod); b /= 2; a = mult(a, a, mod); } return c; } int n; long long inv, a[N]; int main() { qr(n); inv = power(n); for (int i = 1; i <= n; i++) qr(a[i]); sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) (a[i] += a[i - 1]) %= mod; for (int i = 1; i <= n; i++) { int pos = n - i, t = 1; long long ans = 0; while (pos >= i) { ans += (a[pos] - a[pos - i] + mod) * t++ % mod; pos -= i; } (ans += a[pos] * t) %= mod; pr1(ans * inv % mod); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int a; cin >> a; string s; cin >> s; set<char> st; for (int i = 0; i < s.size(); i++) { st.insert(s[i]); } if (st.size() == 1) { cout << -1 << << -1 << endl; } else { for (int i = 0; i < s.size(); i++) { if (s[i] == a && s[i + 1] == b ) { cout << i + 1 << << i + 2 << endl; break; } if (s[i] == b && s[i + 1] == a ) { cout << i + 1 << << i + 2 << endl; break; } } } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int MOD = 998244353; long long int n; cin >> n; pair<long long int, long long int> arr[n]; for (long long int i = 0; i < n; ++i) cin >> arr[i].first >> arr[i].second; long long int fact[n + 1]; fact[0] = 1; for (long long int i = 1; i <= n; ++i) { fact[i] = (fact[i - 1] * i + MOD) % MOD; } map<long long int, long long int> count1; map<long long int, long long int> count2; map<pair<long long int, long long int>, long long int> count3; for (long long int i = 0; i < n; ++i) { count1[arr[i].first]++; count2[arr[i].second]++; count3[make_pair(arr[i].first, arr[i].second)]++; } long long int n1 = 1, n2 = 1, n3 = 1; map<long long int, long long int>::iterator it; for (it = count1.begin(); it != count1.end(); ++it) { n1 = (n1 * (fact[it->second]) + MOD) % MOD; } for (it = count2.begin(); it != count2.end(); ++it) { n2 = (n2 * (fact[it->second]) + MOD) % MOD; } map<pair<long long int, long long int>, long long int>::iterator itd; long long int last2 = -1; for (itd = count3.begin(); itd != count3.end(); ++itd) { n3 = (n3 * (fact[itd->second]) + MOD) % MOD; if (itd->first.second < last2) { n3 = 0; break; } last2 = itd->first.second; } long long int ans = (fact[n] - n1 - n2 + n3 + 2 * MOD) % MOD; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long h, w; cin >> h >> w; long long pow2max = 1; while (2 * pow2max <= h && 2 * pow2max <= w) pow2max *= 2; long long hmax = min(h, (long long)(1.25 * pow2max)); long long wmax = min(w, (long long)(1.25 * pow2max)); if (hmax >= wmax) cout << hmax << << pow2max; else cout << pow2max << << wmax; return; } signed main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> int main() { long i, n, d = 0; scanf( %ld , &n); for (i = 1; i <= n / 2; i++) { if (n % i == 0) d++; } printf( %d , d); return 0; } |
#include <bits/stdc++.h> using namespace std; long long Ax, Ay, Bx, By, Cx, Cy; bool solvable(long long A, long long B) { return (Cx * A + Cy * B) % (Cx * Cx + Cy * Cy) == 0 && (-Cy * A + Cx * B) % (Cx * Cx + Cy * Cy) == 0; } bool possible() { cin >> Ax >> Ay >> Bx >> By >> Cx >> Cy; if (Cx == 0 && Cy == 0) { if (Bx == Ax && By == Ay) return true; if (Bx == Ay && By == -Ax) return true; if (Bx == -Ax && By == -Ay) return true; if (Bx == -Ay && By == Ax) return true; return false; } if (solvable(Bx - Ax, By - Ay)) return true; if (solvable(Bx - Ay, By + Ax)) return true; if (solvable(Bx + Ax, By + Ay)) return true; if (solvable(Bx + Ay, By - Ax)) return true; return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << (possible() ? YES : NO ) << endl; cout << flush; return 0; } |
#include <bits/stdc++.h> using namespace std; bool a[1000][1000]; int main() { ios::sync_with_stdio(false); int n, m, ans = 0; cin >> n >> m; bool tmp = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { tmp = 0; for (int j = 0; j < m; j++) { tmp = max(tmp, a[i][j]); if (a[i][j] == 0 && tmp) ans++; } } for (int i = 0; i < m; i++) { tmp = 0; for (int j = 0; j < n; j++) { tmp = max(tmp, a[j][i]); if (a[j][i] == 0 && tmp) ans++; } } for (int i = 0; i < n; i++) { tmp = 0; for (int j = m - 1; j >= 0; j--) { tmp = max(tmp, a[i][j]); if (a[i][j] == 0 && tmp) ans++; } } for (int i = 0; i < m; i++) { tmp = 0; for (int j = n - 1; j >= 0; j--) { tmp = max(tmp, a[j][i]); if (a[j][i] == 0 && tmp) ans++; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; char s[6][8], t[10]; int n; bool match(char* a, char* b) { for (int i = 0; i < 7; i++) if (b[i] != . && a[i] != b[i]) return 0; return 1; } int main() { sprintf(s[0], jolteon ); sprintf(s[1], flareon ); sprintf(s[2], umbreon ); sprintf(s[3], leafeon ); sprintf(s[4], glaceon ); sprintf(s[5], sylveon ); scanf( %d%s , &n, t); if (n == 6) return 0 * printf( espeon n ); if (n == 8) return 0 * printf( vaporeon n ); for (int i = 0; i < 6; i++) if (match(s[i], t)) return 0 * printf( %s n , s[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; string s, v; int ans, p, t; char c; char tr[1000]; int mypow(int k) { int c = 1; for (int i = 1; i <= k; i++) { c *= 2; } return c; } int main() { gets(tr); s = (string)tr; p = 0; for (int i = 0; i < s.length(); i++) { v = ; c = s[i]; int k = 7; ans = 0; while ((c > 0) && (k >= 0)) { if (c % 2 == 1) ans += mypow(k); k--; c /= 2; } t = (p - ans) % 256; if (t < 0) t += 256; cout << t << endl; p = ans; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ruchy { bool kol[55]; bool wiersze[55]; }; int dl, szer, ilosc_ruchow; int kolumny[55]; int wiersze[55]; ruchy gra[2510]; char palnsza[54][54]; bool dasie = 1; void wypisgry() { for (int k = 0; k < ilosc_ruchow; k++) { cout << ruch numer << k + 1 << endl; cout << kolumny; << endl; for (int i = 1; i < 50; i++) if (gra[k + 1].kol[i]) cout << i << , ; cout << endl; cout << wiersze; << endl; for (int i = 1; i < 50; i++) if (gra[k + 1].wiersze[i]) cout << i << , ; cout << endl; } } int main() { cin >> dl >> szer; for (int j = 0; j < dl; j++) { for (int i = 0; i < szer; i++) { cin >> palnsza[i + 1][j + 1]; } } for (int j = 0; j < dl; j++) { for (int i = 0; i < szer; i++) { if (palnsza[i + 1][j + 1] == # ) { if (kolumny[i + 1] != 0) { if (wiersze[j + 1] != 0 && wiersze[j + 1] != kolumny[i + 1]) dasie = 0; wiersze[j + 1] = kolumny[i + 1]; gra[kolumny[i + 1]].wiersze[j + 1] = 1; } else { if (wiersze[j + 1] != 0) { if (kolumny[i + 1] != 0 && kolumny[i + 1] != wiersze[j + 1]) dasie = 0; kolumny[i + 1] = wiersze[j + 1]; gra[wiersze[j + 1]].kol[i + 1] = 1; } else { ilosc_ruchow++; kolumny[i + 1] = ilosc_ruchow; wiersze[j + 1] = ilosc_ruchow; gra[ilosc_ruchow].kol[i + 1] = 1; gra[ilosc_ruchow].wiersze[j + 1] = 1; } } } } } for (int k = 0; k < ilosc_ruchow; k++) { for (int j = 0; j < dl; j++) { for (int i = 0; i < szer; i++) { if (gra[k + 1].wiersze[j + 1] && gra[k + 1].kol[i + 1] && palnsza[i + 1][j + 1] == . ) dasie = 0; } } } if (dasie) printf( Yes ); else printf( No ); return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; int dx2[] = {1, -1, 0, 0, -1, 1, -1, 1}; int dy2[] = {0, 0, 1, -1, 1, -1, -1, 1}; int read() { int x; scanf( %d , &x); return x; } int ans[100005]; int a[100005]; int used[1000001]; int main() { int n = read(); int m = read(); for (int i = 1; i <= n; i++) a[i] = read(); for (int i = n; i >= 1; i--) { if (used[a[i]]) ans[i] = ans[i + 1]; else ans[i] = ans[i + 1] + 1, used[a[i]] = 1; } while (m--) { printf( %d n , ans[read()]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, c; cin >> n >> m >> c; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> b(n); for (int i = 0; i < m; i++) cin >> b[i]; int cur = 0; for (int i = 0; i < a.size(); i++) { if (i >= 0 && i < m) cur += b[i]; a[i] += cur; if (i >= (n)-m) cur -= b[i - ((n)-m)]; } for (int i = 0; i < n; i++) cout << a[i] % c << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long Mo = 1e9 + 7; int cnt[1 << 6], sz; void add(long long &x, long long y) { x += y; x %= Mo; } void gao(int n, int C, int R, vector<vector<long long>> &Ma) { int loop = 1 << R; for (int i = 0; i < sz; i++) { int c = i / loop, r = i % loop; int a1 = r >> 1, a2 = r >> 1 | (1 << (R - 1)); if ((r & 1) && c != 0) { Ma[c * loop + a1 - loop][i] += cnt[a1] + 1; Ma[c * loop + a2 - loop][i] += cnt[a2] + 1; } else if (!(r & 1)) { Ma[c * loop + a1][i] += 1; Ma[c * loop + a2][i] += 1; } } } void mul(vector<vector<long long>> &a, vector<vector<long long>> b) { vector<vector<long long>> ret(sz, vector<long long>(sz)); for (int i = 0; i < sz; i++) { for (int j = 0; j < sz; j++) { for (int k = 0; k < sz; k++) { add(ret[i][j], a[i][k] * b[k][j]); } } } a = ret; } void matpw(vector<vector<long long>> &a, long long b) { vector<vector<long long>> ret(sz, vector<long long>(sz)); for (int i = 0; i < sz; i++) ret[i][i] = 1; while (b) { if (b & 1) mul(ret, a); mul(a, a); b >>= 1; } a = ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); for (int i = 0; i < (1 << 6); i++) { for (int j = 0; j < 6; j++) { if (i & (1 << j)) cnt[i]++; } } int n, K, m; cin >> n >> K >> m; sz = (K + 1) * (1 << m); vector<vector<long long>> Ma(sz, vector<long long>(sz)); gao(sz, K + 1, m, Ma); matpw(Ma, n); vector<vector<long long>> base(sz, vector<long long>(sz)); for (int i = 0; i < sz; ++i) base[i][0] = 1; mul(base, Ma); long long ans = 0; for (int i = 0; i < (1 << m); ++i) add(ans, base[0][sz - i - 1]); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000 ) using namespace std; int c, v, c1, v1, *a[262144], *s[262144]; void l(int w, int e, int t) { w <<= 1; if ((c <= e) && (e + t - 1 <= v)) { c1 += a[w][v1]; v1 = s[w][v1]; } else if (min(v, e + t - 1) - max(c, e) >= 0) l(w, e, t >> 1); if ((c <= e + t) && (e + t + t - 1 <= v)) { c1 += a[w + 1][v1]; v1 = s[w + 1][v1]; } else if (min(v, e + t + t - 1) - max(c, e + t) >= 0) l(w + 1, e + t, t >> 1); } int main() { int q, w, e, r, t, o; for (w = 0; w < 262144; w++) { a[w] = new int[60]; s[w] = new int[60]; } cin >> q; for (w = 0; w < q; w++) { cin >> e; for (r = 0; r < 60; r++) { c = 1; if (r % e == 0) c++; a[w + 131072][r] = c; s[w + 131072][r] = (c + r) % 60; } } for (; w < 131072; w++) for (r = 0; r < 60; r++) a[w + 131072][r] = s[w + 131072][r] = 1; for (w = 131071; w; w--) for (e = 0; e < 60; e++) { c = s[w << 1][e]; a[w][e] = a[w << 1][e] + a[(w << 1) + 1][c]; s[w][e] = s[(w << 1) + 1][c]; } char d[2]; for (cin >> o; o; o--) { scanf( %s%d%d , &d, &c, &v); if (d[0] == A ) { c1 = v1 = 0; c--; v -= 2; l(1, 0, 65536); printf( %d n , c1); } else { c += 131071; for (e = 0; e < 60; e++) { r = 1; if (e % v == 0) r++; a[c][e] = r; s[c][e] = (r + e) % 60; } for (c >>= 1; c; c >>= 1) for (e = 0; e < 60; e++) { r = s[c << 1][e]; a[c][e] = a[c << 1][e] + a[(c << 1) + 1][r]; s[c][e] = s[(c << 1) + 1][r]; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> cities[100000], T[100000]; bool visited[100000]; int tin[100000], low[100000], tv[100000]; int up[100000][20]; map<pair<int, int>, int> b; int c = 0, n, l, m, k; void dfs1(int v, int p = -1) { visited[v] = true; tin[v] = low[v] = c++; for (int dest : cities[v]) { if (dest == p) continue; if (visited[dest]) { low[v] = min(low[v], tin[dest]); } else { dfs1(dest, v); low[v] = min(low[v], low[dest]); if (low[dest] > tin[v]) { b[{min(v, dest), max(dest, v)}] = 1; } } } } void preprocessbridges() { memset(visited, false, sizeof visited); memset(tin, -1, sizeof tin); memset(low, -1, sizeof low); for (int i = 0; i < n; ++i) { if (!visited[i]) { dfs1(i); } } } void Tdfs(int u, int d) { visited[u] = true; tv[u] = d; for (int v : cities[u]) { if (visited[v]) continue; T[u].push_back(v); T[v].push_back(u); Tdfs(v, d + b[{min(u, v), max(u, v)}]); } } void dfs(int v, int p) { tin[v] = c++; up[v][0] = p; for (int i = 1; i <= l; ++i) { up[v][i] = up[up[v][i - 1]][i - 1]; } for (int u : T[v]) { if (u == p) { continue; } dfs(u, v); } low[v] = c++; } bool is_ancestor(int u, int v) { return tin[u] <= tin[v] && low[u] >= low[v]; } int lca(int u, int v) { if (is_ancestor(u, v)) { return u; } if (is_ancestor(v, u)) { return v; } for (int i = l; i >= 0; --i) { if (!is_ancestor(up[u][i], v)) { u = up[u][i]; } } return up[u][0]; } void preprocesslca() { memset(visited, false, sizeof visited); memset(tv, 0, sizeof tv); Tdfs(0, -1); memset(tin, 0, sizeof tin); memset(low, 0, sizeof low); c = 0; l = ceil(log2(n)); memset(up, 0, sizeof up); dfs(0, 0); } void preprocess() { preprocessbridges(); preprocesslca(); } int solve(int r, int e) { return tv[r] + tv[e] - 2 * tv[lca(r, e)]; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; cities[x - 1].push_back(y - 1); cities[y - 1].push_back(x - 1); } preprocess(); cin >> k; while (k--) { int root, shop; cin >> root >> shop; cout << solve(root - 1, shop - 1) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long sum[500001], ans; long long solve(long long a, long long b, long long c, long long hh) { if (a < b + c) return 0ll; long long now = min(a - b - c, hh); return (now + 1) * (now + 2) / 2; } int main() { long long a, b, c, l, i; scanf( %lld%lld%lld%lld , &a, &b, &c, &l); sum[0] = 1; for (i = 1; i <= l; i++) sum[i] = sum[i - 1] + (i + 1) * (i + 2) / 2; ans = sum[l]; for (i = 0; i <= l; i++) ans -= solve(a + i, b, c, l - i) + solve(b + i, a, c, l - i) + solve(c + i, a, b, l - i); printf( %lld , ans); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 10005; long long n, m, a[maxn], b[maxn]; int k; long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } long long exgcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return a; } long long r = exgcd(b, a % b, x, y), x0 = x; x = y; y = x0 - (a / b) * y; return r; } long long CRT(long long *m, long long *a) { long long lcm = 1, X = m[1], Y = a[1]; for (int i = 1; i <= k; i++) lcm = lcm / gcd(lcm, m[i]) * m[i]; for (int i = 2; i <= k; i++) { long long A = X, B = m[i], d, x, y, c = a[i] - Y; d = exgcd(A, B, x, y); if (c % d) return -1; long long mod = m[i] / d; long long K = ((x * c / d) % mod + mod) % mod; Y = X * K + Y; X = X * m[i] / d; } if (Y == 0) return lcm; return Y; } bool check() { long long I = CRT(a, b), J; if (I > n || I <= 0) return 0; for (int i = 1; i <= k; i++) b[i] = 1 - i; J = CRT(a, b); if (J + k - 1 > m || J <= 0) return 0; for (int i = 1; i <= k; i++) if (gcd(I, J + i - 1) != a[i]) return 0; return 1; } int main() { cin >> n >> m >> k; for (int i = 1; i <= k; i++) cin >> a[i]; if (check()) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100 * 1000 + 17; long long n, a[MAXN], ans; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { int t = log2(n - i); a[i + (1 << t)] += a[i]; ans += a[i]; a[i] = 0; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[101]; void scan() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); } void out() { int ans = 0, k = 0, c; while (1) { c = 0; for (int i = 0; i < n; i++) { if (a[i] != -1) { if (a[i] >= k) { ++k; a[i] = -1; } } else if (a[i] == -1) ++c; } if (c == n) break; ++ans; k = 0; } cout << ans << n ; } int main() { scan(); out(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n; vector<pair<long long, long long> > serv; bool check(long long x1, long long x2) { long long pos = 0; bool found = false; for (long long i = n - 1; i >= 0; --i) { if (serv[i].first * (n - i) >= x2) { found = true; pos = i; break; } } if (!found) { return false; } found = false; for (long long i = pos - 1; i >= 0; --i) { if (serv[i].first * (pos - i) >= x1) { found = true; break; } } return found; } pair<vector<long long>, vector<long long> > print(long long x1, long long x2) { vector<long long> a1, a2; long long pos = 0; for (long long i = n - 1; i >= 0; --i) { a2.push_back(serv[i].second); if (serv[i].first * (n - i) >= x2) { pos = i; break; } } for (long long i = pos - 1; i >= 0; --i) { a1.push_back(serv[i].second); if (serv[i].first * (pos - i) >= x1) { break; } } return {a1, a2}; } void solve() { long long x1 = 0, x2 = 0; cin >> n >> x1 >> x2; serv.resize(n); for (long long i = 0; i < n; ++i) { cin >> serv[i].first; serv[i].second = i; } sort(serv.begin(), serv.end()); if (check(x1, x2)) { cout << Yes << endl; auto ans = print(x1, x2); cout << ans.first.size() << << ans.second.size() << endl; for (long long x : ans.first) cout << x + 1 << ; cout << endl; for (long long x : ans.second) cout << x + 1 << ; cout << endl; } else if (check(x2, x1)) { cout << Yes << endl; auto ans = print(x2, x1); cout << ans.second.size() << << ans.first.size() << endl; for (long long x : ans.second) cout << x + 1 << ; cout << endl; for (long long x : ans.first) cout << x + 1 << ; cout << endl; } else { cout << No << endl; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 9, base = 27; int cnt_list, pos[20200], pa[20100], len[20100], fs[20100], pc[20100], ls[20100], cnt_ls, tmp[20100], cnt, n, num_q; struct pp { int id; char ch; }; vector<pp> adj[20201]; pp now; void dfs(int id, int pr) { int i, j, s, p, q, ip; pos[id] = cnt_list++; pa[pos[id]] = pr; for (i = 0; i < adj[id].size(); i++) { ip = adj[id][i].id; if (pos[ip] >= 0) continue; pc[cnt_list] = adj[id][i].ch - a ; dfs(ip, pos[id]); } } int main() { int id1, id2, i, j, s, p, q, x, y, fg; char ch; scanf( %d%d , &n, &num_q); for (i = 0; i < n - 1; i++) { scanf( %d%d , &id1, &id2); ch = getchar(); while (ch < a || ch > z ) ch = getchar(); id1--; id2--; now.id = id2; now.ch = ch; adj[id1].push_back(now); now.id = id1; now.ch = ch; adj[id2].push_back(now); } memset(pos, -1, sizeof(pos)); dfs(0, -1); while (num_q--) { scanf( %d%d , &x, &y); x--; y--; x = pos[x]; y = pos[y]; int u, v; u = x; v = y; cnt_ls = cnt = 0; while (u != v) { if (u > v) { ls[cnt_ls++] = pc[u]; u = pa[u]; } else { tmp[cnt++] = pc[v]; v = pa[v]; } } while (cnt > 0) ls[cnt_ls++] = tmp[--cnt]; for (i = 0; i < n; i++) len[i] = -1; u = x; fs[u] = len[u] = 0; int ans = 0; while (u != 0) { len[pa[u]] = len[u] + 1; if (fs[u] == 0) { if (len[u] < cnt_ls) { if (ls[len[u]] > pc[u]) fs[pa[u]] = -1; else if (ls[len[u]] < pc[u]) fs[pa[u]] = 1; else fs[pa[u]] = 0; } else fs[pa[u]] = 1; } else fs[pa[u]] = fs[u]; if (fs[pa[u]] < 0 || (fs[pa[u]] == 0 && len[pa[u]] != cnt_ls)) ans++; u = pa[u]; } for (i = 1; i < n; i++) { if (len[pa[i]] >= 0 && len[i] < 0) { len[i] = len[pa[i]] + 1; if (fs[pa[i]] == 0) { if (len[pa[i]] < cnt_ls) { if (ls[len[pa[i]]] > pc[i]) fs[i] = -1; else if (ls[len[pa[i]]] < pc[i]) fs[i] = 1; else fs[i] = 0; } else fs[i] = 1; } else fs[i] = fs[pa[i]]; if (fs[i] < 0 || (fs[i] == 0 && len[i] != cnt_ls)) ans++; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 50 + 7; int ned[N][N]; string s[N]; void paint(const vector<pair<int, int> > &v) { set<pair<int, int> > s; queue<pair<int, int> > que; map<pair<int, int>, int> cnt; for (auto e : v) { que.push(e); s.insert(e); } const int dx[] = {2, 2, 1, 1, -1, -1, -2, -2}; const int dy[] = {1, -1, 2, -2, 2, -2, 1, -1}; int tot = 0; while (!que.empty()) { auto p = que.front(); que.pop(); tot++; for (int i = (0); i < (8); i++) { int x = p.first + dx[i]; int y = p.second + dy[i]; if (s.find(make_pair(x, y)) != s.end()) continue; if (++cnt[make_pair(x, y)] == 4) { s.insert({x, y}); que.push({x, y}); } } } cout << sz(s) << = << (((int)(s).size())) << n ; int des = ((int)(v).size()) * ((int)(v).size()) / 10; cout << des << = << (des) << n ; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n; cin >> n; vector<pair<int, int> > v; for (int i = (0); i < (n); i++) { if (i & 1) v.push_back({3, i}); v.push_back({0, i}); if (((int)(v).size()) > n) break; } v.resize(n); for (auto e : v) cout << e.first << << e.second << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long x, y, p, q; bool check(long long t) { return ((p * t >= x) && ((q * t - p * t) >= (y - x))); } int main() { int t; scanf( %d , &t); while (t--) { scanf( %I64d%I64d%I64d%I64d , &x, &y, &p, &q); long long l = 0, r = 1e9, mid; long long ans = -1; while (l <= r) { mid = (l + r) / 2; if (check(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } if (ans == -1) printf( -1 n ); else printf( %I64d n , ans * q - y); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; inline int add(int a, int b) { a += b; if (a >= mod) a -= mod; return a; } inline int sub(int a, int b) { a -= b; if (a < 0) a += mod; return a; } inline int mul(int a, int b) { return (a * 1ll * b) % mod; } inline int power(int a, int b) { int rt = 1; while (b > 0) { if (b & 1) rt = mul(rt, a); a = mul(a, a); b >>= 1; } return rt; } inline int inv(int a) { return power(a, mod - 2); } const int N = 1e6 + 5; vector<int> z_function(string s) { int n = (int)s.length(); vector<int> z(n); for (int i = 1, l = 0, r = 0; i < n; ++i) { if (i <= r) z[i] = min(r - i + 1, z[i - l]); while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i]; if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1; } return z; } string a; int mat[N][2], sum0[N], dp[N], sumdp[N]; void fill(string s, int ind) { string s1 = s + $ + a; vector<int> v = z_function(s1); int n1 = s.size(), n = a.size(); for (int i = 0; i < n; i++) mat[i][ind] = v[n1 + 1 + i]; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << setprecision(25); string l, r; cin >> a >> l >> r; int n = a.size(), l1 = l.size(), r1 = r.size(); fill(l, 0); fill(r, 1); for (int i = 0; i < n; i++) { if (i + 1 < l1) continue; if (i > 0) sum0[i] = sum0[i - 1], sumdp[i] = sumdp[i - 1]; if (a[i] == 0 ) sum0[i] = add(sum0[i], i - 1 < 0 ? 1 : dp[i - 1]); int ind1 = -1, ind2 = -1; ind1 = i - l1 + 1; int x = mat[ind1][0]; if (x < l1 && a[ind1 + x] < l[x]) ind1--; if (ind1 < 0) continue; ind2 = i - r1 + 1; if (ind2 < 0) ind2 = 0; else { x = mat[ind2][1]; if (x != r1 && a[ind2 + x] > r[x]) ind2++; } if (ind2 > ind1) continue; if (ind1 == ind2) { if (ind1 == 0) dp[i] = 1; else dp[i] = dp[ind1 - 1]; if (i - ind1 > 0 && a[ind1] == 0 ) dp[i] = 0; } else { dp[i] = sub(sub(sumdp[ind1 - 1], (ind2 - 2 < 0 ? ind2 == 0 ? mod - 1 : 0 : sumdp[ind2 - 2])), sub(sum0[ind1], (ind2 - 1 < 0 ? 0 : sum0[ind2 - 1]))); if (i == ind1 && a[i] == 0 ) dp[i] = add(dp[i], i == 0 ? 1 : dp[i - 1]); } sumdp[i] = add(sumdp[i], dp[i]); } cout << dp[n - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> x[200]; int y[200], n, i, j, k, a, b, c, s, A, B; int main() { scanf( %d , &n); n *= 2; for (i = 1; i <= n; i++) scanf( %d , &k), x[k].push_back(i); for (i = 10; i <= 99; i++) if (x[i].size() == 1) { if (a > b) y[x[i][0]] = 2, b++; else y[x[i][0]] = 1, a++; } s = a * b; A = a; B = b; for (i = 10; i <= 99; i++) if (x[i].size() > 1) { s += a + b; c++; for (j = 0; j < x[i].size(); j++) { if (A > B) y[x[i][j]] = 2, B++; else y[x[i][j]] = 1, A++; } } s += c * c; printf( %d n , s); for (i = 1; i <= n; i++) printf( %d , y[i]); } |
#include <bits/stdc++.h> #include <chrono> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using pll = pair<long, long>; using vi = vector<int>; using vl = vector<long long>; using vb = vector<bool>; using vs = vector<string>; using vld = vector<long double>; #define pb push_back #define f first #define s second #define sz(a) int((a).size()) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() #define sum(a) ( accumulate((a).begin(), (a).end(), 0LL)) #define mine(a) (*min_element((a).begin(), (a).end())) #define maxe(a) (*max_element((a).begin(), (a).end())) #define mini(a) ( min_element((a).begin(), (a).end()) - (a).begin()) #define maxi(a) ( max_element((a).begin(), (a).end()) - (a).begin()) #define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin()) #define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin()) #define each(a, b) for (auto &a: b) #define yes cout << YES << endl #define no cout << NO << endl mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const ll mod = 1e9 + 7; ll n, m, k, p, q, l, r, u, v, x, y, z; // ll ans = 0; void solve(int t = 1) { cin >> n >> m; vi a(n), b(n), c(m); each(u, a) cin >> u; each(u, b) cin >> u; each(u, c) cin >> u; vi ans(m, 0); map<int, vi> mp; for (int i = 0; i < m; i++) { mp[c[i]].push_back(i); } for (int i = 0; i < n; i++) { if (a[i] != b[i]) { if (!mp[b[i]].empty()) { a[i] = b[i]; ans[mp[b[i]].back()] = i + 1; mp[b[i]].pop_back(); } else { no; return; } } } if (a != b) { no; return; } if (ans[m - 1] == 0) { bool flag = true; for (int i = 0; i < n; i++) { if (c[m - 1] == b[i]) { ans[m - 1] = i + 1; flag = false; break; } } if (flag) { no; return; } } each(u, ans) { if (u == 0) u = ans[m - 1]; } yes; each(u, ans) cout << u << ; cout << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int tc = 1; cin >> tc; for (int t = 1; t <= tc; t++) solve(t); return 0; } |
#include <bits/stdc++.h> using namespace std; #define endl n typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef tuple<int, int, int> tiii; typedef tuple<ll, ll, ll> tlll; const int INF = 100000000; const ll INFINITE = 4500000000000000000; int main(void) { int t; cin >> t; while (t--) { int s1, s2, s3, s4; cin >> s1 >> s2 >> s3 >> s4; if (min(s1, s2) < max(s3, s4) &&min(s3, s4) <max(s1, s2)) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); int main() { int n; double R, r; double st; while (scanf( %d %lf , &n, &R) != EOF) { st = pi / (1.0 * n); r = sin(st) * R / (1 - sin(st)); printf( %.7lf n , r); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[2000090]; int d[2000009][11]; int main() { ios::sync_with_stdio(0); for (int i = 1; i < 10; i++) a[i] = i; for (int i = 1; i < 2000009; i++) { int l = 1; int g = i; while (g != 0) { if (g % 10 != 0) l *= (g % 10); g /= 10; } for (int j = 1; j < 10; j++) d[i][j] = d[i - 1][j]; a[i] = a[l]; d[i][a[l]]++; } int q; cin >> q; while (q--) { int x, y, z; cin >> x >> y >> z; cout << d[y][z] - d[x - 1][z] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (m == 0) { cout << n << << n << endl; return 0; } long long min = 0; if (m * 2ll <= n) { min = n - m * 2; } long long e = 1; long long g = 2; long long max = 0; for (long long i = 2; i <= n; i++) { if (e >= m) { max = n - i; break; } e += g; g++; } cout << min << << max << endl; return 0; } |
#include<bits/stdc++.h> #define rep(i, n) for(int i = 0; i < n; i++) using namespace std; typedef long long ll; const ll Mod = 1000000007; int t; int n; ll x[500500]; ll sum_bit[70]; int main(){ ios::sync_with_stdio(false); cin >> t; while(t--){ cin >> n; rep(i, n) cin >> x[i]; memset(sum_bit, 0, sizeof(sum_bit)); rep(b, 60) rep(i, n) sum_bit[b] = (sum_bit[b] + (x[i] & (1LL << b))) % Mod; ll ans = 0; rep(j, n){ ll sum_and = 0, sum_or = 0; rep(b, 60){ if(x[j] & (1LL << b)) sum_and = (sum_and + sum_bit[b]) % Mod, sum_or = (sum_or + (1LL << b) % Mod * n % Mod) % Mod; else sum_or = (sum_or + sum_bit[b]) % Mod; } ans = (ans + sum_and * sum_or) % Mod; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ant { int id; int novo_id; long long int p; int dir; }; struct rotate_edges { int id_ini; int id_fim; }; int compara_p(ant a, ant b) { return a.p < b.p || (a.p == b.p && a.dir < b.dir); } int compara_p_reverso(ant a, ant b) { return a.p > b.p; } int compara_id(ant a, ant b) { return a.id < b.id; } int cont_pos, cont_neg; long long int N, M, T; ant v[400000]; ant v_final[400000]; ant v_pos[400000]; ant v_neg[400000]; char c; rotate_edges calcula_rotate_edges(long long int t, int pivot) { long long int p_pivot = v[pivot].p; int cont_neg = 0; int cont_pos = 0; for (int i = 0; i < N; i++) { if (v[i].dir < 0) { v_neg[cont_neg] = v[i]; if (v_neg[cont_neg].p < p_pivot) v_neg[cont_neg].p += M; cont_neg++; } else { v_pos[cont_pos] = v[i]; if (v_pos[cont_pos].p > p_pivot) v_pos[cont_pos].p -= M; cont_pos++; } } sort(v_neg, v_neg + cont_neg, compara_p); sort(v_pos, v_pos + cont_pos, compara_p_reverso); rotate_edges resp; if (cont_neg == 0) { resp.id_ini = v_pos[0].id; resp.id_fim = v_pos[0].id; } else if (cont_pos == 0) { resp.id_ini = v_neg[0].id; resp.id_fim = v_neg[0].id; } else { resp.id_ini = v_pos[0].id; resp.id_fim = v_pos[0].id; int id_pos; int id_neg; long long int p_pos; long long int p_neg; for (int i = 0;; i++) { id_pos = (i + 1) / 2; id_neg = i / 2; p_pos = v_pos[id_pos % cont_pos].p - M * (id_pos / cont_pos); p_neg = v_neg[id_neg % cont_neg].p + M * (id_neg / cont_neg); if (p_neg - p_pos <= 2 * t) { resp.id_fim = (i % 2 == 0) ? v_neg[id_neg % cont_neg].id : v_pos[id_pos % cont_pos].id; } else { break; } } } return resp; } long long int calcula_delta(rotate_edges re) { int vi_ini, vi_fim; for (int i = 0; i < N; i++) { if (v[i].id == re.id_ini) vi_ini = i; if (v[i].id == re.id_fim) vi_fim = i; } return (vi_fim + N - vi_ini) % N; } void rotate(long long int delta) { for (int i = 0; i < N; i++) { v[i].novo_id = v[(i + N - delta) % N].id; } for (int i = 0; i < N; i++) { v[i].id = v[i].novo_id; } } void rotate_final(rotate_edges re) { int id, id_final; for (int i = 0; i < N; i++) { if (v[i].id == re.id_ini) id = i; if (v_final[i].id == re.id_fim) id_final = i; } for (int i = 0; i < N; i++) { v_final[(id_final + i) % N].id = v[(id + i) % N].id; } } int main() { scanf( %lld %lld %lld , &N, &M, &T); for (int i = 0; i < N; i++) { v[i].id = i; scanf( %lld %c , &v[i].p, &c); v[i].p = v[i].p % M; if (c == L ) { v[i].dir = -1; } else { v[i].dir = 1; } } sort(v, v + N, compara_p); int pivot = 0; for (int i = 0; i < N; i++) { if (v[i].dir > 0 && v[(i + 1) % N].dir < 0) { pivot = i; break; } } long long int delta_por_ciclo = calcula_delta(calcula_rotate_edges(M, pivot)); rotate((delta_por_ciclo * (T / M)) % N); T = T % M; rotate_edges re = calcula_rotate_edges(T, pivot); for (int i = 0; i < N; i++) { v_final[i] = v[i]; v_final[i].p = (((v[i].p + v[i].dir * T) % M) + M) % M; } sort(v_final, v_final + N, compara_p); rotate_final(re); sort(v_final, v_final + N, compara_id); printf( %d , v_final[0].p == 0 ? M : v_final[0].p); for (int i = 1; i < N; i++) { printf( %d , v_final[i].p == 0 ? M : v_final[i].p); } printf( n ); return 0; } |
#include <bits/stdc++.h> int max(int a, int b) { return a > b ? a : b; } int a[510][510], num[510], n, m, Q, ans, x, y; void work(int pos) { num[pos] = 0; int f = 0; for (int i = 1; i <= m; i++) if (a[pos][i]) f++; else num[pos] = max(num[pos], f), f = 0; num[pos] = max(num[pos], f); } int main() { scanf( %d%d%d , &n, &m, &Q); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (int i = 1; i <= n; i++) work(i), ans = max(ans, num[i]); for (int t = 1; t <= Q; t++) { scanf( %d%d , &x, &y); a[x][y] = a[x][y] ^ 1; work(x); ans = 0; for (int i = 1; i <= n; i++) ans = max(ans, num[i]); printf( %d n , ans); } } |
#include <bits/stdc++.h> int main() { int n, start; char str[60]; scanf( %s , str); n = strlen(str); n = n % 2 ? n / 2 : n / 2 - 1; printf( %c , str[n]); for (int i = 1; i <= n; i++) printf( %c%c , str[n + i], str[n - i]); if (strlen(str) % 2 == 0 && strlen(str) > 1) printf( %c , str[strlen(str) - 1]); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, cntx = 0, cntX = 0, c = 0; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == x ) cntx++; else cntX++; } int i = 0; if (cntx > cntX) { while (cntx != cntX) { if (s[i] == x ) { s[i] = X ; cntx--; c++; cntX++; } i++; } } else { while (cntx != cntX) { if (s[i] == X ) { s[i] = x ; cntX--; cntx++; c++; } i++; } } cout << c << endl << s << endl; return 0; } |
#include <bits/stdc++.h> const double EPS = 1e-9; const int INT_INF = 1 << 31 - 1; const long long I64_INF = 1ll << 63 - 1ll; const double PI = acos(-1.0); using namespace std; vector<int> r; string second; void ReadTable(int id, int& FinalId); string GetTag(int id) { string res = ; id++; while (second[id] != > ) res += second[id], id++; return res; } void ReadTd(int id, int& FinalId) { string tag = GetTag(id); while (tag != /td ) { int NewId; ReadTable(id + 7, NewId); id = NewId; tag = GetTag(id); } FinalId = id + 5; } int ReadTr(int id, int& FinalId) { int res = 0; string tag = GetTag(id); while (tag != /tr ) { int NewId; ReadTd(id + 4, NewId); id = NewId; res++; tag = GetTag(id); } FinalId = id + 5; return res; } void ReadTable(int id, int& FinalId) { int res = 0; string tag = GetTag(id); while (tag != /table ) { int NewId; res += ReadTr(id + 4, NewId); id = NewId; tag = GetTag(id); } FinalId = id + 8; r.push_back(res); } int main() { char c; second.clear(); while (scanf( %c , &c) >= 1) if (c != && c != n ) second += c; int loose; ReadTable(7, loose); sort(r.begin(), r.end()); for (int i = 0; i < (int)r.size(); i++) printf( %d , r[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, T, cnt, top; char s[5100][5100]; struct poi { int x, y; poi() {} poi(int x, int y) : x(x), y(y) {} void trs() { swap(x, y); x--; y = n - y; } friend bool operator<(const poi &r1, const poi &r2) { if (r1.x == r2.x) return r1.y < r2.y; return r1.x < r2.x; } friend int operator^(const poi &r1, const poi &r2) { return r1.x * r2.y - r2.x * r1.y; }; friend poi operator-(const poi &r1, const poi &r2) { return poi(r1.x - r2.x, r1.y - r2.y); }; } a[5100 << 5], st[5100 << 5]; int onleft(poi p1, poi p2, poi p3) { return ((p1 - p2) ^ (p3 - p2)) >= 0; } int main() { while (scanf( %d , &n) != EOF && n) { top = 0; cnt = 0; for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (s[i][j] > 0 && s[i][j + 1] > 0 && s[i + 1][j] > 0 && s[i + 1][j + 1] > 0 && (s[i][j] == 1 || s[i][j + 1] == 1 || s[i + 1][j] == 1 || s[i + 1][j + 1] == 1 )) a[++cnt] = poi(i, j + 1); for (int i = 1; i <= cnt; i++) a[i].trs(); sort(a + 1, a + 1 + cnt); for (int i = 1; i <= cnt; i++) { while (top >= 2 && onleft(st[top], st[top - 1], a[i])) top--; st[++top] = a[i]; } int t = top; for (int i = cnt - 1; i >= 1; i--) { while (top > t && onleft(st[top], st[top - 1], a[i])) top--; st[++top] = a[i]; } printf( %d n , top - 1); for (int i = 1; i < top; i++) printf( %d %d n , st[i].x, st[i].y); } return 0; } |
#pragma GCC optimize(3, Ofast , inline ) #include <cstdio> #include <iostream> #include <cstring> #include <algorithm> #include <cmath> #include <set> #include <map> #include <vector> #include <stack> #include <queue> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int maxn = 1e6 + 10; const ll mod = 1e9 + 7; const double pi = acos(-1.0); const double eps = 1e-8; int t; int n, k; string s1, s2; int cnt[27]; void solve() { int f = 0; memset(cnt, 0, sizeof(cnt)); sort(s1.begin(), s1.end()); sort(s2.begin(), s2.end()); if(s1 == s2) puts( Yes ); else{ for(int i = 0; i < n; i ++) cnt[s1[i] - a ] ++; for(int i = 0; i < n; i ++) cnt[s2[i] - a ] --; for(int i = 0; i < 26; i ++){ if(cnt[i] < 0 || cnt[i] % k){ f = 1; break; } cnt[i + 1] += cnt[i]; } puts(!f ? Yes : No ); } } int main(){ std::ios::sync_with_stdio(false); cin >> t; while(t --){ cin >> n >> k; cin >> s1 >> s2; solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, x, a, s; vector<pair<int, long long> > v, u; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x >> a; if (x < 0) v.push_back(make_pair(-x, a)); else u.push_back(make_pair(x, a)); s += a; } sort(v.begin(), v.end()); sort(u.begin(), u.end()); if ((int)v.size() - (int)u.size() <= 1 && (int)u.size() - (int)v.size() <= 1) { cout << s << endl; return 0; } if (v.size() > u.size()) { for (int i = u.size() + 1; i < v.size(); i++) s -= v[i].second; cout << s << endl; return 0; } for (int i = v.size() + 1; i < u.size(); i++) s -= u[i].second; cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[101][101]; void rec(int x, int y) { if (x - 1 > 0 && a[x][y] > a[x - 1][y]) { a[x - 1][y] = a[x][y] - 1; rec(x - 1, y); } if (a[x][y] > a[x + 1][y]) { a[x + 1][y] = a[x][y] - 1; rec(x + 1, y); } if (y - 1 > 0 && a[x][y] > a[x][y - 1]) { a[x][y - 1] = a[x][y] - 1; rec(x, y - 1); } if (a[x][y + 1] < a[x][y]) { a[x][y + 1] = a[x][y] - 1; rec(x, y + 1); } } int main() { int n; cin >> n; for (int i = 1; i <= n * 2 + 1; i++) { for (int j = 1; j <= n * 2 + 1; j++) { a[i][j] = 0; } } a[n + 1][n + 1] = n; rec(n + 1, n + 1); for (int i = 1; i <= n * 2 + 1; i++) { bool ok = 0; for (int j = 1; j <= n * 2 + 1; j++) { if ((i == 1 || i == 2 * n + 1) && j == n + 1) { if (j != 1) { cout << ; } cout << 0; break; } if (a[i][j] == 0 && (a[i][j + 1] <= 0 && a[i][j - 1] <= 0)) { a[i][j] = -1; } if (a[i][j] == -1) { if (ok == 1) { break; } if (j != 1) { cout << ; } cout << ; } else { if (j != 1) { cout << ; } cout << a[i][j]; ok = 1; } } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string i_str(int n) { char buff[10]; sprintf(buff, %d , n); return string(buff); } int main() { int a, b; cin >> a >> b; if (a < b) { cout << b; return 0; } string sa, sb, t, r = , si = ; sb = i_str(b); for (int j = a + 1; j <= 1000000; j++) { r = ; si = i_str(j); int ni = si.length(); for (int i = 0; i < ni; i++) { if (si[i] == 4 ) r = r + si[i]; if (si[i] == 7 ) r = r + si[i]; }; if (r == sb) { cout << j; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const long long mod = 1e9 + 7; long long powr(long long a, long long b) { long long x = 1 % mod; a %= mod; while (b) { if (b & 1) x = (x * a) % mod; a = (a * a) % mod; b >>= 1; } return x; } long long inv(long long a) { return powr(a, mod - 2); } map<int, int> mymap, mymap2; int par[maxn]; int val[maxn]; int main() { int n; cin >> n; int x; map<int, int>::iterator it1, it2; int mx = 0, mn = 1e9 + 10; int maxi = 1, mini = 1; for (int i = 1; i <= n; i++) { cin >> x; if (i == 1) mx = mn = x; val[i] = x; if (i > 1) { if (x > mx) { par[i] = maxi; maxi = i; mx = x; } else if (x < mn) { par[i] = mini; mini = i; mn = x; } else { it2 = mymap.upper_bound(x); int x = it2->second; it2--; int y = it2->second; par[i] = max(x, y); } cout << val[par[i]] << ; } mymap[x] = i; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t, n; string s; cin >> t; while (t--) { cin >> n >> s; vector<int> szs; char prev = s.front(); int sz = 0; for (char c : s) { if (c != prev) { szs.push_back(sz); sz = 1; } else sz++; prev = c; } szs.push_back(sz); int cnt = 0, id = 1; for (int i : szs) { if (i > 1) cnt += min(i - 1, id - cnt); id++; } cout << cnt + (szs.size() - cnt + 1) / 2 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 3e5 + 10; template <typename value_t> class fenwick { public: fenwick(int n) { memset(c, 0, sizeof c); this->n = n; } void add(int i, value_t x) { while (i <= n) { c[i] += x; i += Lowbit(i); } } value_t sum(int x) { value_t sum = 0; while (x > 0) { sum += c[x]; x -= Lowbit(x); } return sum; } value_t sum(int x1, int x2) { return sum(x2) - sum(x1 - 1); } private: value_t c[MAXN]; int n; inline int Lowbit(int x) { return x & (-x); } }; class lfs { public: lfs(int N) { memset(head, -1, sizeof head); ecnt = 0; n = N; } void adde(int from, int to, int w) { e[ecnt].to = to; e[ecnt].w = w; e[ecnt].next = head[from]; head[from] = ecnt++; } void addde(int a, int b, int w) { adde(a, b, w); adde(b, a, w); } void solve() { memset(ans, 0, sizeof ans); arr = new fenwick<long long>(n); dfs(1, 0, 1); } vector<pair<int, int>> opr[MAXN]; long long ans[MAXN]; protected: struct Edge { int to, next, w; } e[MAXN * 2]; int head[MAXN]; int ecnt; int n; fenwick<long long>* arr; void dfs(int u, int fa, int dep) { for (auto& i : opr[u]) { arr->add(dep, i.second); arr->add(dep + i.first + 1, -i.second); } ans[u] = arr->sum(dep); for (int i = head[u]; i != -1; i = e[i].next) { int v = e[i].to; if (v != fa) dfs(v, u, dep + 1); } for (auto& i : opr[u]) { arr->add(dep, -i.second); arr->add(dep + i.first + 1, i.second); } } }; template <typename T = int> inline T read() { T X = 0, w = 0; char ch = 0; while (!isdigit(ch)) { w |= ch == - ; ch = getchar(); } while (isdigit(ch)) { X = (X << 3) + (X << 1) + (ch ^ 48); ch = getchar(); } return w ? -X : X; } int main() { int n = read(); lfs* tree = new lfs(n); for (int i = 1; i < n; i++) { tree->addde(read(), read(), 1); } int m = read(); for (int i = 1; i <= m; i++) { int u = read(); int d = read(); int x = read(); tree->opr[u].push_back(make_pair(d, x)); } tree->solve(); for (int i = 1; i <= n; i++) { cout << tree->ans[i] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, n, t, r = 0; cin >> a >> b >> c >> n; for (int i = 0; i < n; i++) { cin >> t; if (t > b && t < c) r++; } cout << r << endl; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using ld = long double; using pii = pair<int, int>; ll val(ll solve, ll whole) { if (2 * solve > whole) return 500; if (4 * solve > whole) return 1000; if (8 * solve > whole) return 1500; if (16 * solve > whole) return 2000; if (32 * solve > whole) return 2500; return 3000; } ll score(vi &t, vector<ll> &cnt, ll whole) { ll ans = 0; for (int i = 0; i < t.size(); i++) if (t[i] != -1) ans += val(cnt[i], whole) * (250 - t[i]); return ans; } bool go(vector<vi> &a, ll k, int mask) { vector<ll> cnt(a[0].size()); for (int i = 0; i < a.size(); i++) for (int j = 0; j < a[i].size(); j++) if (a[i][j] != -1) cnt[j]++; for (int i = 0; i < 5; i++) if ((mask & (1 << i)) && a[0][i] != -1) cnt[i] += k; ll whole = a.size() + (mask == 0 ? 0 : k); return score(a[0], cnt, whole) > score(a[1], cnt, whole); } void solve() { int n; cin >> n; vector<vi> a(n, vi(5)); for (int i = 0; i < n; i++) for (int j = 0; j < 5; j++) cin >> a[i][j]; for (int k = 0; k < 32 * n; k++) for (int mask = 1; mask < 1 << 5; mask++) if (go(a, k, mask)) { cout << k << n ; return; } cout << -1 << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j; string s; cin >> s; if ((int)s[0] >= 97 && (int)s[0] <= 122) { s[0] = (char)((int)s[0] - 32); } for (i = 0; i < s.size(); i++) { cout << s[i]; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 101000; int a[maxn], x, y, z, cnt, curr, ans, n, m; vector<int> v; int bs(int x) { int l = 0, r = m; while (l < r - 1) { int mid2 = (l + r) / 2; if (v[mid2] < x) { l = mid2; } else { r = mid2; } } if (v[l] >= x) { return -1; } return l; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int j = 0; j < m; ++j) { cin >> x >> y >> z; if (x == 1) { v.push_back(y); if (y == 1000000000) { ++cnt; } } } sort(a, a + n); sort(v.begin(), v.end()); ans = cnt + n; if (!v.size()) { cout << 0 << endl; return 0; } v.push_back(1000001000); m = v.size(); for (int i = 0; i < n; ++i) { curr = i; int val = bs(a[i]); curr += m - val - 2; ans = min(ans, curr); } cout << ans << endl; } |
#include <bits/stdc++.h> long long int mod = 1000000007; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, k; cin >> n >> k; long long int p = k / n; if (k % n != 0) { p += 1; } cout << p; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, z = 1, x, c, zx; map<string, long long> m; string a[1001], s; int main() { while (getline(cin, s)) { a[n++] = s; zx = max(zx, (long long)s.size()); } for (int i = -2; i < zx; i++) cout << * ; cout << n ; for (int i = 0; i < n; i++) { int k = zx - (long long)a[i].size(); cout << * ; for (int j = 0; j < (k + x) / 2; j++) cout << ; cout << a[i].c_str(); for (int j = (k + x) / 2; j < k; j++) cout << ; cout << * << n ; if (k & 1) x = 1 - x; } for (int i = -2; i < zx; i++) cout << * ; } |
#include <bits/stdc++.h> using namespace std; int main() { int samples, len, temp, sz; cin >> samples >> len; deque<int> q; set<int> s; sz = s.size(); for (; samples--;) { cin >> temp; s.insert(temp); if (s.size() > sz) { q.push_front(temp); if (q.size() > len) { s.erase(q[q.size() - 1]); q.pop_back(); } } sz = s.size(); } printf( %d n , q.size()); for (auto x : q) printf( %d , x); return 0; } |
#include <bits/stdc++.h> using namespace std; struct inter { int l, r, id; inter() { l = r = id = -1; } inter(int _l, int _r, int _id) { l = _l, r = _r, id = _id; } bool operator<(const inter &r) const { return l < r.l; } }; int N, L, R; int A[100005], C[100005]; int B[100005]; map<int, inter> S; int main() { while (scanf( %d%d%d , &N, &L, &R) == 3) { for (int i = 0; i < N; i++) scanf( %d , A + i); for (int i = 0; i < N; i++) scanf( %d , C + i), S[C[i]] = inter(L - A[i], R - A[i], i); int nowL = -2147483646; int found = 1; for (map<int, inter>::iterator it = S.begin(); it != S.end(); it++) { nowL = max(nowL, it->second.l); if (nowL > it->second.r) { found = -1; break; } B[it->second.id] = nowL++; } if (found == -1) { printf( -1 ); } else { for (int i = 0; i < N; i++) { if (i) printf( ); printf( %d , B[i] + A[i]); } } puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, c; int a[1005]; bool check() { bool good = a[0] > 0; for (int i = 1; i < n; i++) good &= (a[i] > 0) && (a[i] >= a[i - 1]); return good; } int main() { cin >> n >> m >> c; for (int i = 0; i < n; i++) a[i] = 0; while (m--) { if (check()) return 0; int p; cin >> p; if (p <= c / 2) { for (int i = 0; i < n; i++) { if (a[i] == 0) { a[i] = p; cout << i + 1; break; } if (a[i] > p) { a[i] = p; cout << i + 1; break; } } } else { for (int i = n - 1; i >= 0; i--) { if (a[i] == 0) { a[i] = p; cout << i + 1; break; } if (a[i] < p) { a[i] = p; cout << i + 1; break; } } } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 1 << 19; long long n, k; long long ans[maxn], mx[maxn], mn[maxn]; bool occ[maxn]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k; for (long long i = 0; i < (long long)(1 << k); ++i) mx[i] = -1e9, mn[i] = 1e9, ans[i] = 2e9; for (long long i = 0; i < (long long)(n); ++i) { long long u; cin >> u; occ[u] = 1, mx[u] = u, mn[u] = u; } for (long long i = 0; i < k; ++i) { for (long long j = 0; j < (1 << k); j += (1 << i + 1)) { for (long long t = 0; t < (long long)(1 << i); ++t) { ans[j + t] = ans[j + t + (1 << i)] = min(ans[j + t], ans[j + t + (1 << i)]); ans[j + t] = min(ans[j + t], mn[j + t + (1 << i)] - mx[j + t]); ans[j + t + (1 << i)] = min(ans[j + t + (1 << i)], mn[j + t] - mx[j + t + (1 << i)] + (1 << i + 1)); } } for (long long j = 0; j < (1 << k); j += (1 << i + 1)) { for (long long t = 0; t < (long long)(1 << i); ++t) { long long upmn0 = min(mn[j + t], mn[j + t + (1 << i)]); long long upmn1 = min(mn[j + t + (1 << i)] - (1 << i), mn[j + t] + (1 << i)); long long upmx0 = max(mx[j + t], mx[j + t + (1 << i)]); long long upmx1 = max(mx[j + t + (1 << i)] - (1 << i), mx[j + t] + (1 << i)); mn[j + t] = upmn0, mn[j + t + (1 << i)] = upmn1; mx[j + t] = upmx0, mx[j + t + (1 << i)] = upmx1; } } } for (long long i = 0; i < (long long)(1 << k); ++i) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int d[2005]; vector<int> E[2005]; bool h[2005]; const int INF = 1e9 + 7; void add(int u, int v) { E[u].push_back(v); } void bfs() { queue<int> q; d[0] = 0; q.push(0); while (q.size()) { int t = q.front(); q.pop(); for (int i = 0; i < E[t].size(); i++) { if (d[E[t][i]] == INF) { d[E[t][i]] = d[t] + 1; q.push(E[t][i]); if (E[t][i] == 1001) { return; } } } } return; } int main() { scanf( %d%d , &n, &k); for (int i = 0; i <= 2001; i++) d[i] = INF; for (int i = 1; i <= k; i++) { int x; scanf( %d , &x); x -= n; if (!h[x + 1001]) { add(0, x + 1001); h[x + 1001] = 1; } } for (int i = 1; i <= 2001; i++) { for (int j = 1; j <= 2001; j++) { if (h[j] && (0 <= i + j - 1001 && i + j - 1001 <= 2001)) { add(i, i + j - 1001); } } } bfs(); if (d[1001] != INF) printf( %d n , d[1001]); else puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int ncr(int n, int r) { int ret = 1; for (int i = 1; i <= n - r; i++) { ret = (ret * (n - r + i)) / i; } return ret; } int main() { int n; cin >> n; int x; long long pos = 0; long long neg = 0; long long prod = 1; for (int i = 0; i < n; i++) { scanf( %d , &x); if (x < 0) { prod = (prod + 1) & 1; } if (prod) { pos++; } else { neg++; } } cout << neg * pos + neg << ; cout << (neg * (neg - 1)) / 2 + (pos * (pos - 1)) / 2 + pos << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int a[maxn]; struct node { int l, r, Max, Min, pa, pi; } T[maxn << 2]; void pushup(int o) { T[o].Min = min(T[o << 1].Min, T[o << 1 | 1].Min); T[o].Max = max(T[o << 1].Max, T[o << 1 | 1].Max); if (T[o].Min == T[o << 1].Min) T[o].pi = T[o << 1].pi; else T[o].pi = T[o << 1 | 1].pi; if (T[o].Max == T[o << 1].Max) T[o].pa = T[o << 1].pa; else T[o].pa = T[o << 1 | 1].pa; } void build(int o, int l, int r) { T[o].l = l; T[o].r = r; if (l == r) { T[o].Max = T[o].Min = a[l]; T[o].pa = T[o].pi = l; return; } int mid = (l + r) >> 1; build(o << 1, l, mid); build(o << 1 | 1, mid + 1, r); pushup(o); } int query(int o, int l, int r, int op) { if (T[o].l == l && T[o].r == r) { if (op == 1) return T[o].Max; else if (op == 2) return T[o].Min; else if (op == 3) return T[o].pa; else return T[o].pi; } int mid = (T[o].l + T[o].r) >> 1; if (r <= mid) return query(o << 1, l, r, op); else if (l > mid) return query(o << 1 | 1, l, r, op); else { if (op == 1) return max(query(o << 1, l, mid, 1), query(o << 1 | 1, mid + 1, r, 1)); else if (op == 2) return min(query(o << 1, l, mid, 2), query(o << 1 | 1, mid + 1, r, 2)); else if (op == 3) { int ans1 = query(o << 1, l, mid, 1), ans2 = query(o << 1 | 1, mid + 1, r, 1); int ans = max(ans1, ans2); if (ans == ans1) return query(o << 1, l, mid, 3); else return query(o << 1 | 1, mid + 1, r, 3); } else { int ans1 = query(o << 1, l, mid, 2), ans2 = query(o << 1 | 1, mid + 1, r, 2); int ans = min(ans1, ans2); if (ans == ans1) return query(o << 1, l, mid, 4); else return query(o << 1 | 1, mid + 1, r, 4); } } } int main() { int n, m; while (~scanf( %d%d , &n, &m)) { for (int i = 1; i <= n; i++) scanf( %d , a + i); build(1, 1, n); int l, r, x, Max, Min, pa, pi; while (m--) { scanf( %d%d%d , &l, &r, &x); Max = query(1, l, r, 1); Min = query(1, l, r, 2); pa = query(1, l, r, 3); pi = query(1, l, r, 4); int ans; if (Max == Min && Max == x) ans = -1; else if (Min != x) ans = pi; else if (Max != x) ans = pa; printf( %d n , ans); } } return 0; } |
#include <bits/stdc++.h> typedef struct pair { int x, y; } pair; int const N = 1e4 + 5; int n = 8; pair sMatrix[N], sac[N]; char matrix[N][N], mariaMove[10][10][100]; pair anna, maria; int i, j, k, s, m, h, t; int kontrol(int x, int y) { int i, j; for (i = 0; i < s; i++) { if (sMatrix[i].x == x && sMatrix[i].y == y) return 0; } return 1; } void sDown(int add) { int i; for (i = 0; i < s; i++) { sMatrix[i].x += add; } } void wrtS() { int i; for (i = 0; i < s; i++) { printf( %d-SS-%d , sMatrix[i].x, sMatrix[i].y), puts( ); } } void dfs(int x, int y, int t) { int i, j, k; if (x == anna.x && y == anna.y) { printf( WIN ), puts( ); exit(0); } if (!(!mariaMove[x][y][t] && x >= 0 && x < n && y >= 0 && y < n) || !kontrol(x, y)) return; sDown(1); if (!kontrol(x, y)) { sDown(-1); return; } mariaMove[x][y][t] = 1; for (i = -1, k = 0; i <= 1; i++) { for (j = -1; j <= 1; j++, k++) { dfs(x + i, y + j, k); } } sDown(-1); } void clearMariaMove() { int i, j, k; for (i = 0; i < 10; i++) { for (j = 0; j < 10; j++) { for (k = 0; k < 100; k++) { mariaMove[i][j][k] = 0; } } } } void clear_sMatrix() { int i; for (i = 0; i < s; i++) { sMatrix[i].x = sac[i].x; sMatrix[i].y = sac[i].y; } } int main() { for (i = 0; i < n; i++) { scanf( %s , matrix[i]); for (j = 0; j < n; j++) { if (matrix[i][j] == S ) { sMatrix[s].x = i, sMatrix[s].y = j; sac[s].x = i, sac[s].y = j; s++; } } } maria.x = 7, maria.y = 0; anna.x = 0, anna.y = 7; for (i = -1; i <= 0; i++) { for (j = 0; j <= 1; j++) { dfs(maria.x + i, maria.y + j, 0); clearMariaMove(); clear_sMatrix(); } } puts( LOSE ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; clock_t timeStart, timeFinish; void timeBegin() { timeStart = clock(); } void timeEnd() { timeFinish = clock(); } void timeDuration() { double time_taken = double(timeFinish - timeStart) / double(CLOCKS_PER_SEC); cout << Time taken by program is : << fixed << time_taken << setprecision(5); cout << sec << endl; } long long int n, h, a[105]; bool fun(long long int x) { long long int val = 0; for (int i = 0; i < n - 1; i++) { val += min(a[i + 1] - a[i], x); } val += x; if (val >= h) { return true; } return false; } void solve() { cin >> n >> h; for (int i = 0; i < n; i++) { cin >> a[i]; } long long int l = 1, r = 1000000000000000000; long long int ans = r; while (l <= r) { long long int mid = l + (r - l) / 2; if (fun(mid)) { ans = mid; r = mid - 1; } else { l = mid + 1; } } cout << ans << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; for (int i = 0; i < t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int INF = 1e9 + 7; const int N = 2e5 + 7; const int M = 1e6 + 7; long long a[N], b[N]; long long dp[N][2]; signed main() { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (i > 1) b[i - 1] = abs(a[i] - a[i - 1]); } for (int i = 1; i <= n; i++) { dp[i][0] = max(dp[i - 1][1] + b[i], b[i]); dp[i][1] = max(dp[i - 1][0] - b[i], 0ll); } long long ans = 0; for (int i = 1; i < n; i++) ans = max(ans, max(dp[i][0], dp[i][1])); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1005; const int INF = 0x3f3f3f3f; int n, w[N], h[N]; int maxx; int sum, sum1, ans = INF; inline void fuck(int id, int tot) { sum1 = sum; priority_queue<int> q; int tall; if (tot == 1) tall = w[id], sum1 = sum1 - w[id] + h[id]; else tall = h[id]; for (int i = 1; i <= n; ++i) { if (i == id) continue; if (w[i] > tall && h[i] > tall) return; if (w[i] > tall || h[i] > tall) { if (h[i] > tall) sum1 = sum1 - w[i] + h[i], tot++; } else if (w[i] <= tall && h[i] <= tall) { q.push(w[i] - h[i]); } } if (tot > n / 2) return; while (!q.empty()) { tot++; if (tot > n / 2) break; int now = q.top(); q.pop(); if (now <= 0) break; sum1 -= now; } ans = min(ans, sum1 * tall); } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d%d , &w[i], &h[i]), sum += w[i]; for (int i = 1; i <= n; ++i) { fuck(i, 0); fuck(i, 1); } printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int t, s, q, ans = 0; cin >> t >> s >> q; int downloaded = s; while (downloaded < t) { downloaded += s * (q - 1); s = downloaded; ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 5; struct Node { long long ls, rs, val, key, cnt, tag, add; }; Node t[maxn]; long long pol; void newnode(long long vv) { t[++pol].val = vv; t[pol].cnt = 0; t[pol].key = rand(); t[pol].ls = t[pol].rs = 0; t[pol].tag = t[pol].add = 0; return; } void lazy1(long long p, long long k) { t[p].val += k; return; } void lazy2(long long p, long long k) { t[p].cnt += k; return; } void pushdown(long long p) { t[t[p].ls].tag += t[p].tag; t[t[p].rs].tag += t[p].tag; lazy1(t[p].ls, t[p].tag); lazy1(t[p].rs, t[p].tag); t[p].tag = 0; t[t[p].ls].add += t[p].add; t[t[p].rs].add += t[p].add; lazy2(t[p].ls, t[p].add); lazy2(t[p].rs, t[p].add); t[p].add = 0; return; } long long merge(long long x, long long y) { if (!x || !y) return x + y; if (t[x].key < t[y].key) { pushdown(x); t[x].rs = merge(t[x].rs, y); return x; } else { pushdown(y); t[y].ls = merge(x, t[y].ls); return y; } return 0; } void split(long long now, long long &rx, long long &ry, long long k) { if (!now) { rx = ry = 0; return; } pushdown(now); if (t[now].val <= k) { rx = now; split(t[now].rs, t[rx].rs, ry, k); } else { ry = now; split(t[now].ls, rx, t[ry].ls, k); } return; } long long rt, rx, ry, rz; void ins(long long nd) { split(rt, rx, rz, t[nd].val); rt = merge(merge(rx, nd), rz); return; } void dfs(long long now, long long cc) { if (!now) return; pushdown(now); t[now].val -= cc; t[now].cnt++; dfs(t[now].ls, cc); dfs(t[now].rs, cc); t[now].ls = t[now].rs = 0; ins(now); return; } void out(long long now) { if (!now) return; pushdown(now); out(t[now].ls); cout << t[now].val << ; out(t[now].rs); return; } void costv(long long cc) { split(rt, rx, ry, cc - 1); split(ry, ry, rz, 2 * cc); t[rz].tag -= cc; lazy1(rz, -cc); t[rz].add++; lazy2(rz, 1); rt = merge(rx, rz); dfs(ry, cc); return; } struct tshirts { long long c, q; bool friend operator<(tshirts t1, tshirts t2) { return t1.q == t2.q ? t1.c < t2.c : t1.q > t2.q; } }; tshirts st[maxn]; long long n, k; long long v[maxn]; void dfsans(long long now) { if (!now) return; pushdown(now); dfsans(t[now].ls); dfsans(t[now].rs); return; } int main() { scanf( %lld , &n); for (int i = 1; i <= n; i++) { scanf( %lld %lld , &st[i].c, &st[i].q); } sort(st + 1, st + n + 1); scanf( %lld , &k); for (int i = 1; i <= k; i++) { scanf( %lld , &v[i]); newnode(v[i]); ins(i); } for (int i = 1; i <= n; i++) { costv(st[i].c); } dfsans(rt); for (int i = 1; i <= k; i++) { printf( %lld , t[i].cnt); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long mas[1010]; unordered_map<long long, int> sootv; long long num[100100]; long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } int main() { int n; long long k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> mas[i]; } if (k == 1) { cout << 1 << endl; int minidx = 1; for (int i = 0; i < n; i++) { if (mas[i] < mas[minidx]) minidx = i; } cout << minidx + 1; return 0; } vector<long long> divs; vector<long long> rdivs; for (long long i = 1; i * i <= k; i++) { if (k % i == 0) { divs.push_back(i); if (i * i != k) { rdivs.push_back(k / i); } } } for (auto it = rdivs.rbegin(); it != rdivs.rend(); it++) { divs.push_back(*it); } int cnt = 1; sootv.rehash((int)(divs).size() * 5); for (int i = 0; i < (int)(divs).size(); i++) { sootv.emplace(divs[i], cnt); num[cnt] = divs[i]; cnt++; } int oo = 1e9; vector<vector<int> > dp(n + 3); vector<vector<long long> > sum(n + 3); vector<vector<int> > lst(n + 3); for (int i = 0; i < (int)(dp).size(); i++) { dp[i].resize(cnt + 3); lst[i].resize(cnt + 3); sum[i].resize(cnt + 3); for (int j = 0; j < (int)(dp[i]).size(); j++) { dp[i][j] = oo; } for (int j = 0; j < (int)(lst[i]).size(); j++) { lst[i][j] = -1; } for (int j = 0; j < (int)(sum[i]).size(); j++) { sum[i][j] = (long long)oo * (long long)oo; } } dp[0][sootv[k]] = 0; sum[0][sootv[k]] = 0; int res = oo; for (int i = 0; i < n; i++) { for (int divi = 1; divi < cnt; divi++) { if (dp[i][divi] >= oo) continue; if (dp[i + 1][divi] > dp[i][divi] || dp[i + 1][divi] == dp[i][divi] && sum[i + 1][divi] > sum[i][divi]) { lst[i + 1][divi] = divi; dp[i + 1][divi] = dp[i][divi]; sum[i + 1][divi] = sum[i][divi]; } long long nxt = num[divi] / gcd(num[divi], mas[i]); if (nxt == num[divi]) continue; int idx = sootv[nxt]; if (dp[i + 1][idx] > dp[i][divi] + 1 || dp[i + 1][idx] == dp[i][divi] + 1 && sum[i + 1][idx] > sum[i][divi] + mas[i]) { lst[i + 1][idx] = divi; dp[i + 1][idx] = dp[i][divi] + 1; sum[i + 1][idx] = sum[i][divi] + mas[i]; } } } res = dp[n][sootv[1]]; if (res == oo) { res = -1; cout << res << endl; return 0; } cout << res << endl; vector<int> path; int cur = sootv[1]; for (int i = n; i >= 1; i--) { int l = lst[i][cur]; if (l != cur) { path.push_back(i); } cur = l; if ((int)(path).size() == res) break; } for (int i = (int)(path).size() - 1; i >= 0; i--) printf( %d , path[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100000; int aa[N]; map<int, int> mp; set<int> s; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> aa[i]; for (int i = 0; i < n; i++) { mp[aa[i]]++; if (mp[aa[i]] == 1) s.insert(aa[i]); else s.erase(aa[i]); int j = i - k; if (j >= 0) { mp[aa[j]]--; if (mp[aa[j]] == 1) s.insert(aa[j]); else s.erase(aa[j]); } if (i >= k - 1) if (!s.empty()) cout << *--s.end() << n ; else cout << Nothing n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e9 + 7; class DSU { public: vector<int> parent; vector<int> sizes; int noOfComponenents; DSU(int N) { parent.resize(N); sizes.resize(N); noOfComponenents = N; for (int i = 0; i < N; ++i) { parent[i] = i; sizes[i] = 1; } } int find(int x) { if (parent[x] != x) parent[x] = find(parent[x]); return parent[x]; } void unify(int x, int y) { x = find(x); y = find(y); if (isConnected(x, y)) { return; } --noOfComponenents; sizes[y] += sizes[x]; parent[x] = y; } bool isConnected(int p, int q) { return find(p) == find(q); } int componentSize(int p) { return sizes[p]; } }; void solve() { int n; cin >> n; string s, t; cin >> s >> t; DSU dsu(20); for (int i = 0; i < n; ++i) { if (s[i] == t[i]) { continue; } if (s[i] > t[i]) { cout << -1 << n ; return; } dsu.unify(s[i] - a , t[i] - a ); } cout << 20 - dsu.noOfComponenents << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long C(long long n, long long m) { long long res = 1; for (long long i = n; i > n - m; i--) res *= i; for (long long i = m; i >= 1; i--) res /= i; return res; } int main() { ios::sync_with_stdio(0), cin.tie(0); long long n, k, res = 1; cin >> n >> k; if (k >= 2) res += C(n, 2); if (k >= 3) res += C(n, 3) * 2; if (k >= 4) res += C(n, 4) * 9; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int M = 205; long long n, m, k, cnt, ans; long long g[N], h[N], dp[N][M]; struct redpocket { long long s, t, d, w; bool operator<(const redpocket &x) const { if (w == x.w) return d < x.d; return w < x.w; } } a[N]; priority_queue<redpocket> q; bool cmp(redpocket x, redpocket y) { return x.s < y.s; } signed main() { scanf( %lld %lld %lld , &n, &m, &k); for (long long i = 1; i <= k; i++) scanf( %lld %lld %lld %lld , &a[i].s, &a[i].t, &a[i].d, &a[i].w); sort(a + 1, a + k + 1, cmp); g[0] = 1; cnt = 1; for (long long i = 1; i <= n; i++) { while (i >= a[cnt].s && cnt <= k) q.push(a[cnt++]); if (q.empty()) g[i] = i + 1; else { if (q.top().t < i) { i--; q.pop(); continue; } g[i] = q.top().d + 1; h[i] = q.top().w; } } memset(dp, 0x3f, sizeof(dp)); dp[0][0] = 0; for (long long i = 0; i <= n; i++) { for (long long j = 0; j <= m; j++) { dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]); dp[g[i]][j] = min(dp[g[i]][j], dp[i][j] + h[i]); } } ans = 0x3f3f3f3f3f3f3f3f; for (long long i = 0; i <= m; i++) ans = min(ans, dp[n + 1][i]); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; void PT(long long a); void PT1(long long a); const long long M = 2010, mod = 1e9 + 7; long long n, m, x, y, a, b, dp[M][M], mp[M][M], mp1[M][M]; vector<string> v; void bfs(long long r, long long c, long long l, long long ri) { queue<pair<long long, long long>> q; q.push({r, c}); mp[r][c] = l; mp1[r][c] = ri; while (!q.empty()) { r = (q.front()).first; c = (q.front()).second; q.pop(); l = mp[r][c]; ri = mp1[r][c]; if (l <= a && ri <= b) dp[r][c] = 1; if (c - 1 >= 0 && v[r][c - 1] != * ) { if (l + 1 <= a && ri <= b && (mp[r][c - 1] > l + 1 || mp1[r][c - 1] > ri)) { q.push({r, c - 1}); mp[r][c - 1] = l + 1; mp1[r][c - 1] = ri; } } if (c + 1 < m && v[r][c + 1] != * ) { if (l <= a && ri + 1 <= b && (mp[r][c + 1] > l || mp1[r][c + 1] > ri + 1)) { q.push({r, c + 1}); mp[r][c + 1] = l; mp1[r][c + 1] = ri + 1; } } if (r - 1 >= 0 && v[r - 1][c] != * ) { if (l <= a && ri <= b && (mp[r - 1][c] > l || mp1[r - 1][c] > ri)) { q.push({r - 1, c}); mp[r - 1][c] = l; mp1[r - 1][c] = ri; } } if (r + 1 < n && v[r + 1][c] != * ) { if (l <= a && ri <= b && (mp[r + 1][c] > l || mp1[r + 1][c] > ri)) { q.push({r + 1, c}); mp[r + 1][c] = l; mp1[r + 1][c] = ri; } } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; { cin >> n >> m >> x >> y >> a >> b; for (long long i = 0; i < n; i++) { string s; cin >> s; v.push_back(s); } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { mp[i][j] = INT_MAX; mp1[i][j] = INT_MAX; } } bfs(x - 1, y - 1, 0, 0); long long ans = 0; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (dp[i][j] == 1) ans++; } } cout << ans; } return 0; } void PT(long long a) { cout << a << n ; } void PT1(long long a) { cout << a << ; } |
#include <bits/stdc++.h> using namespace std; int main() { long int i, j, d, m, n, a[100000]; while (cin >> n) { for (i = 1; i <= n; i++) { cin >> a[i]; } i = 1; j = n; int A = a[i], B = a[j]; int ca = 0, cb = 0; while (1) { if (A > B) { B += a[--j]; cb++; } else if (B >= A) { A += a[++i]; ca++; } if (i > j) break; } cout << ca << << cb << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; vector<long long> sc(n); for (typeof(n) i = (0); i < (n); i++) cin >> sc[i]; int m; cin >> m; for (typeof(m) i = (0); i < (m); i++) { long long w, h; cin >> w >> h; long long b = max(sc[0], sc[w - 1]); sc[0] = max(sc[0], b + h); cout << b << endl; } } |
#include <bits/stdc++.h> using namespace std; #pragma GCC diagnostic ignored -Wformat template <typename T> void printContainer(T& a) { auto it = a.begin(); cout << { << *(it++); for (; it != a.end(); ++it) cout << , << (*it); cout << } n ; } map<long long, int> A1, A2; int sol; long long solarea; void dfs1(long long area, int opsSoFar) { A1[area] = opsSoFar; if (area % 3 == 0) { if (!A1.count(area / 3 * 2)) { dfs1(area / 3 * 2, opsSoFar + 1); } } if (area % 2 == 0) { if (!A1.count(area / 2)) dfs1(area / 2, opsSoFar + 1); } } void dfs2(long long area, int opsSoFar) { A2[area] = opsSoFar; if (A1.count(area)) { if (opsSoFar + A1[area] < sol) { sol = opsSoFar + A1[area]; solarea = area; } return; } if (area % 3 == 0) { if (!A2.count(area / 3 * 2)) { dfs2(area / 3 * 2, opsSoFar + 1); } } if (area % 2 == 0) { if (!A2.count(area / 2)) dfs2(area / 2, opsSoFar + 1); } } int threeFactors(long long num) { int cnt = 0; while (num % 3 == 0) num /= 3, cnt++; return cnt; } int main() { long long a1, b1, a2, b2; cin >> a1 >> b1 >> a2 >> b2; long long S1 = a1 * b1, S2 = a2 * b2; dfs1(S1, 0); sol = 1e9; dfs2(S2, 0); if (sol == 1e9) { cout << -1 << endl; return 0; } int T = 0, D = 0; cout << sol << endl; T = threeFactors(S1) - threeFactors(solarea); long long tmp = S1; for (int i = 0; i < (int)(T); ++i) tmp = (tmp / 3 * 2); while (tmp != solarea) ++D, tmp /= 2; while (a1 % 3 == 0 && T > 0) a1 = (a1 / 3 * 2), --T; while (b1 % 3 == 0 && T > 0) b1 = (b1 / 3 * 2), --T; while (a1 % 2 == 0 && D > 0) a1 = (a1 / 2), --D; while (b1 % 2 == 0 && D > 0) b1 = (b1 / 2), --D; cout << a1 << << b1 << endl; T = 0, D = 0; T = threeFactors(S2) - threeFactors(solarea); tmp = S2; for (int i = 0; i < (int)(T); ++i) tmp = (tmp / 3 * 2); while (tmp != solarea) ++D, tmp /= 2; while (a2 % 3 == 0 && T > 0) a2 = (a2 / 3 * 2), --T; while (b2 % 3 == 0 && T > 0) b2 = (b2 / 3 * 2), --T; while (a2 % 2 == 0 && D > 0) a2 = (a2 / 2), --D; while (b2 % 2 == 0 && D > 0) b2 = (b2 / 2), --D; cout << a2 << << b2 << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 17; int l1[N], r1[N], a[N], use[N]; map<int, bool> mt; void dfs(int v, int l, int r) { if (a[v] > l && a[v] < r) mt[a[v]] = 1; if (l1[v] != -1) dfs(l1[v], l, min(r, a[v])); if (r1[v] != -1) dfs(r1[v], max(l, a[v]), r); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i] >> l1[i] >> r1[i]; if (l1[i] != -1) use[l1[i]] = 1; if (r1[i] != -1) use[r1[i]] = 1; } for (int i = 1; i <= n; i++) if (use[i] == 0) dfs(i, -1, 1e9 + 1); int ans = 0; for (int i = 1; i <= n; i++) if (mt[a[i]] == 0) ans++; cout << ans << endl; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int n; int ar[100005]; int main() { scanf( %d , &n); if (n == 2) { printf( 2 1 ); return 0; } for (int i = 1; i <= n; i++) ar[i] = i; for (int i = 1; i <= n; i++) { for (int j = i + i; j <= n; j += i) { if (j % i == 0 && ar[j] % i == 0) swap(ar[i], ar[j]); } } for (int i = 1; i <= n; i++) printf( %d , ar[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; struct pt { long long x, y; int id; pt() {} pt(long long a, long long b, int c = -1) : x(a), y(b), id(c) {} }; pt operator+(pt a, pt b) { return pt(a.x + b.x, a.y + b.y); } pt operator-(pt a, pt b) { return pt(a.x - b.x, a.y - b.y); } long long dot(pt a, pt b) { return a.x * b.x + a.y * b.y; } long long cross(pt a, pt b) { return a.x * b.y - a.y * b.x; } long long sq(pt a) { return dot(a, a); } long long dist(pt a, pt b) { return sq(a - b); } bool operator<(pt a, pt b) { return make_pair(a.x, a.y) < make_pair(b.x, b.y); } vector<pt> ConvexHull(vector<pt> a) { sort(a.begin(), a.end()); vector<pt> b; for (int i = 0; i < a.size(); i++) { while (b.size() > 1 && cross(a[i] - b.back(), b[b.size() - 2] - b.back()) <= 0) b.pop_back(); b.push_back(a[i]); } int sz = b.size(); for (int i = (int)a.size() - 2; i >= 0; i--) { while (b.size() > sz && cross(a[i] - b.back(), b[b.size() - 2] - b.back()) <= 0) b.pop_back(); b.push_back(a[i]); } b.pop_back(); return b; } const int N = 1050; int ty[N]; void rot(vector<pt> &a) { int p = -1; for (int i = 1; i < a.size(); i++) if (ty[a[i].id] != ty[a[0].id]) { p = i; break; } if (p == -1) return; vector<pt> b; for (int i = 0; i < a.size(); i++) b.push_back(a[(i + p) % a.size()]); a = b; } vector<pair<int, int> > edges; void AddEdge(int u, int v) { edges.push_back(make_pair(u, v)); } long long Area(pt a, pt b, pt c) { return abs(cross(a, b) + cross(b, c) + cross(c, a)); } bool Inside(pt a, pt b, pt c, pt d) { return Area(a, b, c) == Area(a, b, d) + Area(a, c, d) + Area(b, c, d); } void SolveTriangle(pt a, pt b, pt c, vector<pt> ps) { int p = -1; for (int i = 0; i < ps.size(); i++) if (ty[ps[i].id] == ty[c.id]) p = i; if (p == -1) { for (int i = 0; i < ps.size(); i++) AddEdge(a.id, ps[i].id); } else { pt d = ps[p]; AddEdge(d.id, c.id); vector<pt> nxt[3]; for (int i = 0; i < ps.size(); i++) if (i != p) { if (Inside(a, b, d, ps[i])) nxt[0].push_back(ps[i]); else if (Inside(c, d, a, ps[i])) nxt[1].push_back(ps[i]); else nxt[2].push_back(ps[i]); } SolveTriangle(a, b, d, nxt[0]); SolveTriangle(c, d, a, nxt[1]); SolveTriangle(c, d, b, nxt[2]); } } bool Check(vector<pt> hull) { int l = -1, r = hull.size(); while (l + 1 < hull.size() && ty[hull[l + 1].id] == ty[hull[0].id]) l++; while (r - 1 >= 0 && ty[hull[r - 1].id] == ty[hull.back().id]) r--; if (r - l > 1) return 0; return 1; } bool onHull[N]; void Triangulate(vector<pt> a) { vector<pt> hull = ConvexHull(a); rot(hull); if (!Check(hull)) { printf( Impossible n ); exit(0); } for (int i = 0; i < hull.size(); i++) onHull[hull[i].id] = 1; if (ty[hull[0].id] == ty[hull.back().id]) { for (int i = 0; i + 1 < hull.size(); i++) AddEdge(hull[i].id, hull[i + 1].id); int p = -1; for (int i = 0; i < a.size(); i++) if (!onHull[a[i].id]) { if (ty[a[i].id] != ty[hull[0].id]) { p = i; break; } } if (p != -1) { for (int i = 0; i < hull.size(); i++) { pt A = hull[i], B = hull[(i + 1) % hull.size()], C = a[p]; vector<pt> work; for (int j = 0; j < a.size(); j++) if (!onHull[a[j].id] && j != p) { if (Inside(A, B, C, a[j])) work.push_back(a[j]); } SolveTriangle(A, B, C, work); } } else { for (int i = 0; i < a.size(); i++) if (!onHull[a[i].id]) AddEdge(hull[0].id, a[i].id); } } else { int p = -1; for (int i = 0; i < hull.size(); i++) if (ty[hull[i].id] != ty[hull[0].id]) { p = i; break; } if (p == -1) { printf( ??? n ); exit(0); } for (int i = 0; i + 1 < p; i++) { pt A = hull[i], B = hull[i + 1], C = hull[p]; AddEdge(A.id, B.id); vector<pt> work; for (int j = 0; j < a.size(); j++) if (!onHull[a[j].id]) { if (Inside(A, B, C, a[j])) work.push_back(a[j]); } SolveTriangle(A, B, C, work); } for (int i = p; i + 1 < hull.size(); i++) { pt A = hull[i], B = hull[i + 1], C = hull[0]; AddEdge(A.id, B.id); vector<pt> work; for (int j = 0; j < a.size(); j++) if (!onHull[a[j].id]) { if (Inside(A, B, C, a[j])) work.push_back(a[j]); } SolveTriangle(A, B, C, work); } } } int main() { int n, i; scanf( %i , &n); vector<pt> ps(n); for (int i = 0; i < n; i++) { int x, y; scanf( %i %i %i , &x, &y, &ty[i]); ps[i] = pt(x, y, i); } if (n == 1) return 0 * printf( 0 n ); if (n == 2) { if (ty[0] == ty[1]) printf( 1 n0 1 n ); else printf( 0 n ); return 0; } Triangulate(ps); printf( %i n , edges.size()); for (auto p : edges) printf( %i %i n , p.first, p.second); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200005, mod = 1e9 + 7; int n, head[N], nxt[N << 1], to[N << 1], num = 0, dfn[N], DFN = 0, a[N], dep[N]; inline void link(int x, int y) { nxt[++num] = head[x]; to[num] = y; head[x] = num; } namespace tr { int fa[N], top[N], sz[N], son[N]; inline void dfs1(int x) { sz[x] = 1; dfn[x] = ++DFN; for (int i = head[x]; i; i = nxt[i]) { int u = to[i]; if (sz[u]) continue; fa[u] = x; dep[u] = dep[x] + 1; dfs1(u); sz[x] += sz[u]; if (sz[u] > sz[son[x]]) son[x] = u; } } inline void dfs2(int x, int tp) { top[x] = tp; if (son[x]) dfs2(son[x], tp); for (int i = head[x]; i; i = nxt[i]) if (to[i] != fa[x] && to[i] != son[x]) dfs2(to[i], to[i]); } inline int lca(int x, int y) { while (top[x] != top[y]) { if (dep[top[x]] < dep[top[y]]) swap(x, y); x = fa[top[x]]; } return dep[x] < dep[y] ? x : y; } void main() { dep[1] = 1; dfs1(1); dfs2(1, 1); } } // namespace tr int prime[N], sp = 0, mu[N], phi[N], b[N], m = 0, id[N], g[N]; bool vis[N]; void priwork() { phi[1] = 1; mu[1] = 1; for (int to, i = 2; i <= n; i++) { if (!vis[i]) prime[++sp] = i, mu[i] = -1, phi[i] = i - 1; for (int j = 1; j <= sp && i * prime[j] <= n; j++) { vis[to = i * prime[j]] = 1; if (i % prime[j]) mu[to] = -mu[i], phi[to] = phi[i] * (prime[j] - 1); else { phi[to] = phi[i] * prime[j]; break; } } } tr::main(); } inline bool comp(int i, int j) { return dfn[i] < dfn[j]; } int st[N], top, w[N], f[N], inv[N], ST[N], cnt = 0; inline int solve() { int sum = 0, x, lca, ret = 0, y = 0; top = 0; for (int i = 1; i <= m; i++) sum = (sum + phi[a[b[i]]]) % mod, w[b[i]] = phi[a[b[i]]]; sort(b + 1, b + m + 1, comp); st[++top] = b[1]; w[b[1]] = phi[a[b[1]]]; ST[++cnt] = b[1]; for (int i = 2; i <= m; i++) { x = b[i]; y = 0; lca = tr::lca(x, st[top]); while (dep[lca] < dep[st[top]]) { if (y) ret = (ret + 1ll * (dep[y] - dep[st[top]]) * w[y] % mod * (sum - w[y] + mod) % mod) % mod; if (y) w[st[top]] = (w[st[top]] + w[y]) % mod; y = st[top--]; } if (st[top] != lca) st[++top] = lca, ST[++cnt] = lca; if (y) ret = (ret + 1ll * (dep[y] - dep[st[top]]) * w[y] % mod * (sum - w[y] + mod) % mod) % mod; if (y) w[st[top]] = (w[st[top]] + w[y]) % mod; if (st[top] != x) st[++top] = x, ST[++cnt] = x; } while (top > 1) { ret = (ret + 1ll * (dep[st[top]] - dep[st[top - 1]]) * w[st[top]] % mod * (sum - w[st[top]] + mod) % mod) % mod; w[st[top - 1]] = (w[st[top]] + w[st[top - 1]]) % mod; top--; } while (cnt) w[ST[cnt]] = 0, cnt--; return (ret << 1) % mod; } long long qm(long long x, long long k) { long long sum = 1; while (k) { if (k & 1) sum = sum * x % mod; x = x * x % mod; k >>= 1; } return sum; } void work() { int x, y; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), id[a[i]] = i; for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); link(x, y); link(y, x); } priwork(); for (int i = 1; i <= n; i++) { m = 0; for (int j = i; j <= n; j += i) b[++m] = id[j]; g[i] = solve(); } for (int i = 1; i <= n; i++) for (int j = i; j <= n; j += i) f[i] = (f[i] + mu[j / i] * g[j]) % mod; int ans = 0; for (int i = 1; i <= n; i++) inv[i] = qm(i, mod - 2); for (int i = 1; i <= n; i++) ans = (ans + 1ll * i * inv[phi[i]] % mod * f[i] % mod) % mod; cout << ans * qm(1ll * n * (n - 1) % mod, mod - 2) % mod << endl; } int main() { work(); return 0; } |
#include <bits/stdc++.h> using namespace std; const double error = 1e-15; const double pi = 2 * acos(0); const int maxn = (int)1e5 + 10; const int mod = (int)1e9; int dx[] = {0, -1, 0, +1, -1, -1, +1, +1}; int dy[] = {-1, 0, +1, 0, -1, +1, +1, -1}; long A[205][200], B[200]; vector<int> v; int main() { ios_base::sync_with_stdio(0); long i, j, n, m; cin >> n; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) { cin >> A[i][j]; if (A[i][j] == 1) { B[i] = 1; } else if (A[i][j] == 2) { B[j] = 1; } else if (A[i][j] == 3) { B[i] = 1; B[j] = 1; } } m = 0; for (i = 1; i <= n; i++) if (B[i] == 0) { m++; v.push_back(i); } cout << m << endl; for (i = 0; i < m; i++) cout << v[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 1) { cout << 1 << endl; } else if (n % 2 == 0) { cout << n / 2 << endl; } else if (n % 2 != 0) { cout << n / 2 + 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300010; map<pair<pair<int, int>, int>, vector<int> > ans; map<pair<pair<int, int>, int>, vector<pair<int, int> > > l; map<pair<pair<int, int>, int>, vector<pair<int, int> > >::iterator it; int n, m; struct Point { int x, y; Point(int _x = 0, int _y = 0) : x(_x), y(_y){}; Point operator-(const Point &rhs) { return Point(x - rhs.x, y - rhs.y); } Point operator*(int v) { return Point(v * x, v * y); } Point operator+(const Point &rhs) { return Point(x + rhs.x, y + rhs.y); } Point operator/(int v) { return Point(x / v, y / v); } int len() { return x * x + y * y; } friend int dis(Point a, Point b) { return Point(a - b).len(); } void read() { scanf( %d%d , &x, &y); } }; struct Circle { int x, y, r; } c[1510]; inline int Pow(int x) { return x * x; } inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } pair<pair<int, int>, int> getLine(Point a, Point b) { if (a.x == b.x) return make_pair(make_pair(0, 0), a.x); if (a.y == b.y) return make_pair(make_pair(1, 0), a.y); int dx = a.x - b.x; int dy = a.y - b.y; int d = gcd(abs(dx), abs(dy)); dx /= d; dy /= d; if (dx < 0) { dx *= -1; dy *= -1; } int v = (a.y % dy + dy) % dy; v = a.x + (v - a.y) / dy * dx; return make_pair(make_pair(dx, dy), v); } int getAns(pair<pair<int, int>, int> tmp, int x) { if (l.find(tmp) == l.end()) return 0; vector<pair<int, int> > &u = l[tmp]; int p = upper_bound(u.begin(), u.end(), make_pair(x, 1)) - u.begin(); return ans[tmp][p]; } pair<pair<int, int>, int> getMirrorLine(Point a, Point b) { Point mid = (a + b) / 2, off = a - b; swap(off.x, off.y), off.x *= -1; return getLine(mid + off, mid - off); } int main() { scanf( %d%d , &n, &m); Point a, b; while (n--) { a.read(); b.read(); a = a * 2; b = b * 2; if (a.x == b.x) { l[getLine(a, b)].push_back(make_pair(min(a.y, b.y), 1)); l[getLine(a, b)].push_back(make_pair(max(a.y, b.y) + 1, -1)); } else { l[getLine(a, b)].push_back(make_pair(min(a.x, b.x), 1)); l[getLine(a, b)].push_back(make_pair(max(a.x, b.x) + 1, -1)); } } for (it = l.begin(); it != l.end(); ++it) { sort((*it).second.begin(), (*it).second.end()); vector<int> &tt = ans[(*it).first]; vector<pair<int, int> > &d = (*it).second; int v = 0; tt.push_back(v); for (int i = 0; i <= d.size(); ++i) { v += d[i].second; tt.push_back(v); } } for (int i = 1; i <= m; ++i) { scanf( %d%d%d , &c[i].x, &c[i].y, &c[i].r); c[i].x *= 2; c[i].y *= 2; c[i].r *= 2; } int cnt = 0; for (int i = 1; i < m; ++i) for (int j = i + 1; j <= m; ++j) { if (c[i].r == c[j].r && dis(Point(c[i].x, c[i].y), Point(c[j].x, c[j].y)) > Pow(c[i].r + c[j].r)) { int mid; if (c[i].y == c[j].y) mid = c[i].y; else mid = (c[i].x + c[j].x) >> 1; cnt += getAns( getMirrorLine(Point(c[i].x, c[i].y), Point(c[j].x, c[j].y)), mid); } } printf( %d n , cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; int n, k; long long f[100009], g[100009]; vector<int> p; string s1, s2; int main() { cin >> s1 >> s2 >> k; int i; n = s1.size(); p.clear(); for (i = 1; i <= n; ++i) { if (s1 == s2) p.push_back(i - 1); s1.push_back(s1[0]); s1.erase(0, 1); } f[0] = 1LL; g[0] = 0LL; for (i = 1; i <= k; ++i) { f[i] = (g[i - 1] * (n - 1)) % MOD; g[i] = (f[i - 1] + g[i - 1] * (n - 2)) % MOD; } long long ans = 0LL; if (!p.empty()) { for (i = 0; i < p.size(); ++i) { if (p[i] == 0) ans = (ans + f[k]) % MOD; else ans = (ans + g[k]) % MOD; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin >> n >> m; cout << min(n, m) + 1 << endl; for (int i = 0; i <= min(n, m); i++) cout << i << << min(n, m) - i << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long A[100005]; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } int main() { long long n; long long i; cin >> n; for (i = 0; i < n; i++) cin >> A[i]; sort(A, A + n); long long g, s, num; s = num = 0; for (i = 0; i < n; i++) { s += A[i] * i - num; num += A[i]; } s = s * 2; s += num; g = gcd(s, n); cout << s / g << << n / g << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 2, M = 1e6 + 2; int n, m, X[N << 1], Y[N << 1], C[N][N]; void Merge(vector<pair<int, pair<int, int> > > &v) { sort(v.begin(), v.end()); int q = 0; for (int i = 1; i < (int)(v.size()); i++) { if (v[i].first != v[q].first || v[i].second.first > v[q].second.second) v[++q] = v[i]; else v[q].second.second = v[i].second.second; } v.resize(q + 1); } bool Check(int t) { vector<pair<int, pair<int, int> > > hor, ver; for (int i = 0; i < m; i++) for (int j = 0; j < m; j++) C[i][j] = 0; for (int i = 0; i < n; i++) hor.push_back(make_pair(Y[i], make_pair(X[i] - 2 * t, X[i] + 2 * t))); for (int i = n; i < n + m; i++) ver.push_back(make_pair(X[i], make_pair(Y[i] - 2 * t, Y[i] + 2 * t))); Merge(hor), Merge(ver); for (pair<int, pair<int, int> > a : hor) { vector<int> adj; for (int i = 0; i < (int)(ver.size()); i++) { pair<int, pair<int, int> > b = ver[i]; if (b.second.first <= a.first && a.first <= b.second.second && a.second.first <= b.first && b.first <= a.second.second) { for (int j : adj) if (C[i][j]++) return true; adj.push_back(i); } } } return false; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0; i < n + m; i++) { cin >> X[i] >> Y[i]; int x = X[i] - Y[i], y = X[i] + Y[i]; X[i] = x, Y[i] = y; } int dw = 0, up = M; while (up - dw > 1) { int md = (dw + up) >> 1; if (Check(md)) up = md; else dw = md; } if (up == M) cout << Poor Sereja! << endl; else cout << up << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long MOD2 = 998244353; double eps = 1e-12; using namespace std; template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T_container, typename T = typename enable_if< !is_same<T_container, string>::value, typename T_container::value_type>::type> ostream &operator<<(ostream &os, const T_container &v) { os << { ; string sep; for (const T &x : v) os << sep << x, sep = , ; return os << } ; } void dbg_out() { cerr << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << << H; dbg_out(T...); } #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) template <typename T> void get_ar(T *ar, long long n) { for (long long i = 0; i < n; i++) cin >> ar[i]; } template <typename T> void printar(T *ar, long long n) { for (long long i = 0; i < n; i++) cout << ar[i] << ; cout << n ; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long imod(long long a, long long m) { return power(a, m - 2, m); } template <typename T, size_t N, size_t M> void print2dArray(T (&theArray)[N][M], long long n = N, long long m = M) { for (long long x = 0; x < n; x++) { for (long long y = 0; y < m; y++) { cout << theArray[x][y] << ; } cout << n ; } } template <typename T, size_t N> void print_ar(T (&theArray)[N], long long n = N) { for (long long x = 0; x < n; x++) { cout << theArray[x] << ; } cout << n ; } struct DSU { long long connected; vector<long long> par, sz, mi, ma; void init(long long n) { par = sz = mi = ma = vector<long long>(n + 1, 0); for (long long i = 1; i <= n; i++) par[i] = i, sz[i] = 1, mi[i] = i, ma[i] = i; connected = n; } long long getPar(long long u) { while (u != par[u]) { par[u] = par[par[u]]; u = par[u]; } return u; } long long getSize(long long u) { return sz[getPar(u)]; } void merge(long long u, long long v) { long long par1 = getPar(u), par2 = getPar(v); if (par1 == par2) return; connected--; if (sz[par1] > sz[par2]) swap(par1, par2); long long aa = min(mi[par1], mi[par2]); long long bb = max(ma[par1], ma[par2]); sz[par2] += sz[par1]; sz[par1] = 0; par[par1] = par[par2]; mi[par2] = aa; ma[par2] = bb; } }; DSU dd; vector<long long> pres, pref; long long give(long long p1) { long long l = dd.mi[p1], r = dd.ma[p1]; long long tot = pres[r] - pres[l - 1]; long long ans = pref[r] - pref[r - tot]; return ans; } void solve() { long long n, m, q, K, ans = 0, tmp; cin >> n >> m >> q; vector<long long> a(n), b(m); for (long long i = 0; i < n; i++) { cin >> a[i]; ans += a[i]; } for (long long i = 0; i < m; i++) { cin >> b[i]; } vector<vector<long long> > temp; temp.push_back({0, 0}); for (long long i = 0; i < n; i++) { temp.push_back({a[i], 1}); } for (long long i = 0; i < m; i++) { temp.push_back({b[i], 0}); } dd.init(n + m + 1); sort((temp).begin(), (temp).end()); pres.resize(n + m + 1, 0); pref.resize(n + m + 1, 0); for (long long i = 1; i < ((long long)(temp).size()); i++) { pres[i] = pres[i - 1] + temp[i][1]; pref[i] = pref[i - 1] + temp[i][0]; } vector<vector<long long> > diff; for (long long i = 1; i < ((long long)(temp).size()) - 1; i++) { diff.push_back({temp[i + 1][0] - temp[i][0], i}); } sort((diff).begin(), (diff).end()); long long cur = 0; vector<vector<long long> > quer; for (long long i = 0; i < q; i++) { long long x; cin >> x; quer.push_back({x, i}); } sort((quer).begin(), (quer).end()); vector<long long> fin(q, 0); for (auto x : quer) { long long k = x[0], ind = x[1]; while (cur < ((long long)(diff).size()) && diff[cur][0] <= k) { long long p1 = dd.getPar(diff[cur][1]), p2 = dd.getPar(diff[cur][1] + 1); ans -= give(p1); ans -= give(p2); dd.merge(p1, p2); long long pa = dd.getPar(p1); ans += give(pa); cur++; } fin[ind] = ans; } for (long long i = 0; i < q; i++) { cout << fin[i] << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; for (long long it = 1; it <= t; it++) { solve(); } return 0; } |
#include <iostream> using namespace std; int main() { int n,q, l,r; cin>>n>>q; string s; cin>>s; int arr[n]; arr[0]=s[0]- a +1; for(int i=1;i<n;i++){ arr[i]=arr[i-1]+s[i]- a +1; } while(q--){ cin>>l>>r; cout<<(arr[r-1]-((l==1)?0:arr[l-2]))<< n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.sync_with_stdio(false), cin.tie(nullptr); int tests; cin >> tests; while (tests--) { int n, k; string s; cin >> n >> k >> s; const int need = n / k; vector<vector<int>> counts(k, vector<int>(26, 0)); for (int i = 0; i < n; i++) { counts[i % k][s[i] - a ]++; } int ans = 0; for (int i = 0, j = k - 1; i <= j; i++, j--) { int cost = need * 2 - counts[i][0] - counts[j][0]; for (int c = 1; c < 26; c++) { cost = min(cost, need * 2 - counts[i][c] - counts[j][c]); } ans += (i == j ? cost / 2 : cost); } cout << ans << n ; } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.