func_code_string stringlengths 59 71.4k |
|---|
#include <cassert> #include <climits> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <cctype> #include <vector> #include <string> #include <queue> #include <deque> #include <stack> #include <set> #include <map> #include <utility> #include <algorithm> #include <iostream> #include <sstream> #include <numeric> using namespace std; #define SIZE(x) int((x).size()) #define REP(i,c) for(auto &i : c) #define pb push_back #define eb emplace_back typedef long long i64; typedef unsigned long long u64; const double EPS = 1e-12; const int INF = 999999999; typedef vector<int> VI; typedef vector<string> VS; typedef pair<int,int> PII; typedef vector<PII> VPII; const int MAXN=1500; int n,m; int a[MAXN][MAXN]; int f[MAXN][MAXN]; // colors in square (i,j) ... (i+f[i]][j]-1, j+f[i][j-1]), order max(x-i,y-i) VPII sq[2][MAXN]; int cur; bool seen[MAXN*MAXN+1]; int ans[MAXN+1]; void Solve() { scanf( %d%d ,&n,&m); for(int i=0;i<n;i++) for(int j=0;j<n;j++) { scanf( %d ,&a[i][j]); } fill(ans+1,ans+(n+1),0); cur=0; for(int i=n-1;i>=0;i--) { int pre=cur; cur=cur^1; for(int j=n-1;j>=0;j--) { sq[cur][j]={{0,a[i][j]}}; if(i==n-1 || j==n-1) { f[i][j]=1; ans[f[i][j]]++; continue; } seen[a[i][j]]=1; VI ps={0,0,0}; vector<const VPII*> vs={&sq[cur][j+1],&sq[pre][j],&sq[pre][j+1]}; while(SIZE(sq[cur][j])<=m) { int md=INF; int mi=-1; for(int i=0;i<3;i++) { const VPII& v=*vs[i]; if(ps[i]==SIZE(v)) continue; if(v[ps[i]].first<md) { md=v[ps[i]].first; mi=i; } } if(mi<0) break; const PII &u=(*vs[mi])[ps[mi]++]; if(!seen[u.second]) { seen[u.second]=1; sq[cur][j].eb(u.first+1,u.second); } } REP(p,sq[cur][j]) seen[p.second]=0; f[i][j]=min(n-i,n-j); if(SIZE(sq[cur][j])>m) f[i][j]=min(f[i][j],sq[cur][j][m].first); ans[f[i][j]]++; } } for(int i=n-1;i>=1;i--) ans[i]+=ans[i+1]; for(int i=1;i<=n;i++) printf( %d n ,ans[i]); } int main() { Solve(); return 0; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int a, b; for (int i = 0; i <= n; i++) { scanf( %d%d , &a, &b); } printf( %d n , (n - 4) / 2); } |
#include <bits/stdc++.h> using namespace std; bool flag; const double eps = 1e-12; double sqr(double x) { return x * x; } void read(complex<double> &A) { double x, y; cin >> x >> y; A = complex<double>(x, y); } bool tri(complex<double> A, double ra, complex<double> B, double rb) { double a[] = {abs(A - B), ra, rb}; sort(a, a + 3); return (a[0] + a[1] + eps > a[2]); } bool ok(complex<double> A, double ra, complex<double> B, double rb, complex<double> C, double rc) { if (abs(A - C) < ra + eps && abs(B - C) < rb + eps) return true; if (!tri(A, ra, B, rb)) return false; double d = abs(A - B); double t = (sqr(ra) + sqr(d) - sqr(rb)) / 2.0 / sqr(d); double h = sqrt(max(sqr(ra) - sqr(t * d), 0.0)); double mx = A.real() + t * (B.real() - A.real()), my = A.imag() + t * (B.imag() - A.imag()); double dx, dy; if (abs(A.imag() - my) < eps) { dy = h * (A.real() - mx) / sqrt(sqr(A.real() - mx) + sqr(A.imag() - my)), dx = dy * (my - A.imag()) / (A.real() - mx); } else { dx = h * (A.imag() - my) / sqrt(sqr(A.real() - mx) + sqr(A.imag() - my)), dy = dx * (mx - A.real()) / (A.imag() - my); } complex<double> tmp; tmp = complex<double>(mx + dx, my + dy); if (abs(tmp - C) < rc + eps) return true; tmp = complex<double>(mx - dx, my - dy); if (abs(tmp - C) < rc + eps) return true; return false; } bool check(complex<double> A, double ra, complex<double> B, double rb, complex<double> C, double rc) { if (ok(A, ra, B, rb, C, rc)) return true; if (ok(A, ra, C, rc, B, rb)) return true; if (ok(B, rb, C, rc, A, ra)) return true; return false; } int main() { double t1, t2; complex<double> A, B, C; cin >> t1 >> t2; read(A); read(B); read(C); if (abs(A - C) + abs(B - C) < abs(A - B) + t2 + eps) { double ans = min(abs(A - C) + abs(B - C) + t1, abs(A - B) + t2); printf( %.9lf , ans); return 0; } double low = 0, high = min(abs(A - C) + t1, abs(A - B) + t2), mid; int k = 100; while (k--) { mid = (low + high) / 2.0; if (check(A, mid, B, abs(A - B) + t2 - mid, C, abs(A - C) + t1 - mid)) low = mid; else high = mid; } printf( %.9lf , mid); } |
#include <bits/stdc++.h> using namespace std; double PI = acos(-1); double EPS = 1e-7; int INF = 1000000000; int MOD = 1000000007; int MAXINT = 2147483647; long long INFLL = 1000000000000000000LL; long long MAXLL = 9223372036854775807LL; int mx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}; int my[8] = {0, 0, -1, 1, -1, 1, -1, 1}; int rem[1000005]; int lol[1000005]; int pos[1000005]; int nx[1000005][20]; int bit[1000005]; int n, m; void build() { memset(bit, 0, sizeof(bit)); for (int(a) = (1); (a) <= (n); (a)++) { pos[lol[a]] = a; nx[a][0] = lol[a]; if (rem[lol[a]]) nx[a][0] = INF; } for (int(k) = (1); (k) <= (19); (k)++) { for (int(a) = (1); (a) <= (n - (1 << k) + 1); (a)++) { nx[a][k] = min(nx[a][k - 1], nx[a + (1 << (k - 1))][k - 1]); } } } int query(int pos, int lim) { int ret = 0; for (int(a) = (19); (a) >= (0); (a)--) { if (pos + (1 << a) - 1 <= n && nx[pos][a] > lim) { pos += (1 << a); ret += (1 << a); } } return ret; } void update(int bit[], int x, int v) { for (int i = x; i <= n; i += (i & -i)) { bit[i] += v; } } int query(int bit[], int x) { int res = 0; for (int i = x; i >= 1; i -= (i & -i)) { res += bit[i]; } return res; } int query(int bit[], int l, int r) { return query(bit, r) - query(bit, l - 1); } long long calc() { build(); long long ans = 0; for (int(v) = (1); (v) <= (n); (v)++) { int a = pos[v]; if (rem[v] == 1) { int tmp = query(a + 1, lol[a]); ans += tmp; ans -= query(bit, a + 1, a + tmp); update(bit, a, 1); } } return ans; } int main() { scanf( %d%d , &n, &m); for (int(a) = (1); (a) <= (n); (a)++) { scanf( %d , &lol[a]); rem[a] = 1; } for (int(a) = (1); (a) <= (m); (a)++) { int k; scanf( %d , &k); rem[k] = 0; } long long ans = n - m; ans += calc(); reverse(lol + 1, lol + n + 1); ans += calc(); printf( %I64d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7; int p[11]; vector<int> operator*(const vector<int> &lhs, const vector<int> &rhs) { vector<int> ret; ret.resize(lhs.size() + rhs.size() - 1, 0); for (int i = 0; i < lhs.size(); i++) { for (int j = 0; j < rhs.size(); j++) { ret[i + j] = (ret[i + j] + lhs[i] * 1LL * rhs[j]) % P; } } return ret; } vector<int> operator+(const vector<int> &lhs, const vector<int> &rhs) { vector<int> ret; ret.resize(max(lhs.size(), rhs.size()), 0); for (int i = 0; i < ret.size(); i++) ret[i] = ((i < lhs.size() ? lhs[i] : 0) + (i < rhs.size() ? rhs[i] : 0)) % P; return ret; } vector<int> modExp(vector<int> &a, long long m, vector<int> &c) { int n = a.size(); vector<int> ret(n, 0); ret[0] = 1; if (m == 0) return ret; for (int i = 63 - __builtin_clz(m); i >= 0; i--) { ret = ret * ret; if (m >> i & 1) ret = ret * a; for (int i = (int)ret.size() - 1; i >= n; i--) if (ret[i]) { for (int j = 0; j < n; j++) if (c[j]) ret[i - j - 1] = (ret[i - j - 1] + ret[i] * 1LL * c[j]) % P; } ret.resize(n); } return ret; } int main() { int F, B; long long N; cin >> F >> B >> N; for (int i = 1; i <= F; i++) cin >> p[i]; vector<int> a(250, 0), b(250, 0), c(250, 0); for (int i = 1; i <= B; i++) { int x; cin >> x; c[x - 1]++; } b[0] = 1; for (int i = 1; i < 250; i++) { for (int j = 0; j < i; j++) b[i] = (b[i] + b[i - j - 1] * 1LL * c[j]) % P; } a[1] = 1; vector<int> d(250, 0); for (int i = 1; i <= F; i++) d = d + modExp(a, p[i], c); d = modExp(d, N, c); int ans = 0; for (int i = 0; i < 250; i++) ans = (ans + d[i] * 1LL * b[i]) % P; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; int con[26][26]; char str1[maxn]; char str2[maxn]; char strans[maxn]; int main() { scanf( %s%s , str1, str2); memset(con, inf, sizeof(con)); for (int i = 0; i < 26; i++) con[i][i] = 0; int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { getchar(); char a, b; int w; scanf( %c %c %d , &a, &b, &w); int num1 = a - a ; int num2 = b - a ; if (num1 == num2) continue; con[num1][num2] = min(w, con[num1][num2]); } for (int k = 0; k < 26; k++) { for (int i = 0; i < 26; i++) for (int j = 0; j < 26; j++) { con[i][j] = min(con[i][k] + con[k][j], con[i][j]); } } int len = strlen(str1); int len1 = strlen(str2); if (len != len1) { printf( -1 n ); return 0; } int ans = 0; int ff = 1; for (int i = 0; i < len; i++) { int sum1 = inf; int num1 = str1[i] - a ; int num2 = str2[i] - a ; for (int j = 0; j < 26; j++) { if (con[num1][j] + con[num2][j] < sum1) { sum1 = con[num1][j] + con[num2][j]; strans[i] = a + j; } } if (sum1 >= inf) { ff = 0; break; } ans += sum1; } strans[len] = n ; if (ff == 0) printf( -1 n ); else { printf( %d n , ans); printf( %s n , strans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int maxn = 4; template <class T> struct Matrix { int r, c; T a[maxn][maxn]; Matrix() { memset(a, 0, sizeof a); } Matrix(int si) { memset(a, 0, sizeof a); r = c = si; for (int i = 0; i < si; i++) a[i][i] = 1; } Matrix operator*(Matrix &rhs) { Matrix<T> ret; ret.r = r; ret.c = rhs.c; for (int k = 0; k < c; ++k) for (int i = 0; i < ret.r; ++i) for (int j = 0; j < ret.c; ++j) ret.a[i][j] = (ret.a[i][j] + (long long)a[i][k] * rhs.a[k][j]) % mod; return ret; } Matrix operator^(long long b) { Matrix<T> ret, base = *this; int setret = 0; while (b) { if (b & 1) ret = (setret ? ret * base : base), setret = 1; base = base * base; b >>= 1; } return ret; } }; int P[1000000]; int KMP(string A, string B) { int l = A.length(); A = A + # + B; P[0] = -1; int x = -1, ret = 0; for (int i = (1); i < (A.length()); ++i) { while (x >= 0 && A[x + 1] != A[i]) x = P[x]; if (A[x + 1] == A[i]) x++; P[i] = x; if (P[i] == l - 1) ret++; } return ret; } Matrix<int> M; string fs[30]; string instr; long long k; int go() { if (k < 30) return KMP(instr, fs[k]); string A, B; int I; for (int i = 1; i < 30; i++) { if (fs[i].length() >= instr.length()) { B = fs[i + 1]; A = fs[i]; I = i; break; } } long long CA = KMP(instr, A); long long CB = KMP(instr, B); long long CBA = KMP(instr, B + A) - CB - CA; long long CAB = KMP(instr, A + B) - CA - CB; long long CBB = KMP(instr, B + B) - CB - CB; Matrix<int> co, POW; co.r = 1; co.c = 4; co.a[0][1] = 1; POW = M ^ (k - I - 1); co = co * POW; return (co.a[0][0] * (CBA + CA) + co.a[0][1] * CB + co.a[0][2] * CAB + co.a[0][3] * CBB) % mod; } int main() { ios_base::sync_with_stdio(0); M.r = M.c = 4; M.a[0][1] = M.a[0][2] = M.a[1][0] = M.a[1][1] = M.a[2][3] = M.a[3][2] = 1; fs[1] = a ; fs[2] = b ; for (int i = 3; i < 30; ++i) fs[i] = fs[i - 1] + fs[i - 2]; int m; cin >> k >> m; while (m--) { cin >> instr; cout << go() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N; scanf( %d , &N); int neg = 0, sum = 0; int mini = 1005; for (int i = 1; i < 2 * N; i++) { int x; scanf( %d , &x); neg ^= x < 0; x = abs(x); mini = min(mini, x); sum += x; } printf( %d n , sum - (neg && !(N % 2) ? 2 * mini : 0)); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void dbg(T a) {} template <typename T, typename... Arg> void dbg(T a, Arg... arg) {} const int maxn = (1e6) + 7; const int inf = (1e9) + 7; const long long LLinf = (1e18) + 7; const long double eps = 1e-9; const long long mod = 1e9 + 7; vector<long long> wek[maxn]; long long n; long long dwa[maxn]; long long tab[maxn]; void dodaj(int l, int p) { while (l > n && p > n) { l -= n; p -= n; } if (l <= n && p <= n) { wek[l].push_back(p); wek[l + n].push_back(p + n); } else wek[l].push_back(p); } void czysc() { for (int i = 0; i <= 3 * n; i++) wek[i].clear(); } bool czy(long long val) { long long l = 1; long long p = 1; czysc(); for (int i = n + 1; i <= 2 * n; i++) { while (dwa[l] < tab[i] - val) l++; while (p < l + n - 1 && dwa[p + 1] <= tab[i] + val) p++; if (abs(dwa[l] - tab[i]) > val || abs(dwa[p] - tab[i]) > val) return 0; dodaj(l, p); } priority_queue<long long> q; for (int i = 1; i <= 2 * n; i++) { for (auto s : wek[i]) q.push(-s); if (((int)(q).size())) { int a = -q.top(); q.pop(); if (a < i) return 0; } } if (((int)(q).size()) > 0) return 0; return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long dl; cin >> n >> dl; for (int i = 1; i <= n; i++) { cin >> tab[i]; tab[i + n] = tab[i] + dl; tab[i + 2 * n] = tab[i] + 2 * dl; } sort(tab + 1, tab + n + 1 + n + n); for (int i = 1; i <= n; i++) { cin >> dwa[i]; dwa[i + n] = dwa[i] + dl; dwa[i + 2 * n] = dwa[i] + 2 * dl; dwa[i + 3 * n] = dwa[i] + 3 * dl; } sort(dwa + 1, dwa + n + 1 + n + n + n); int l = -1; int p = dl; while (l + 1 < p) { int sr = (l + p) / 2; if (czy(sr) == 1) p = sr; else l = sr; } cout << p; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a; cin >> n; vector<int> nums(8, 0); for (int i = 0; i < n; i++) { cin >> a; nums[a]++; } if (nums[7] > 0 || nums[5] > 0) { cout << -1; return 0; } if (nums[2] < nums[4]) { cout << -1; return 0; } if (nums[1] == nums[2] + nums[3] && nums[1] == nums[4] + nums[6]) { if (nums[2] - nums[4] + nums[3] != nums[6]) { cout << -1; } else { while (nums[4] > 0) { cout << 1 << << 2 << << 4 << endl; nums[4]--; nums[2]--; } while (nums[2] > 0) { cout << 1 << << 2 << << 6 << endl; nums[2]--; } while (nums[3] > 0) { cout << 1 << << 3 << << 6 << endl; nums[3]--; } } } else { cout << -1; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> v; int n, m; void addOne(string &res) { int i = (int)res.size() - 1; while (res[i] == 1 ) { res[i--] = 0 ; } res[i] = 1 ; } string toBinary(long long k) { if (k == 0) { return string(m, 0 ); } string res; while (k) { res.push_back((k % 2) + 0 ); k >>= 1; } while (res.size() != m) { res.push_back( 0 ); } reverse(res.begin(), res.end()); return res; } void findRes(string &res, long long k) { long long x = max(k - 100, 0ll); res = toBinary(x); int a = lower_bound(v.begin(), v.end(), res) - v.begin(); long long rem = min(100ll, k) + a + (a != n && v[a] == res); while (rem) { addOne(res); rem -= !binary_search(v.begin(), v.end(), res); } } int main() { int t; cin >> t; while (t--) { cin >> n >> m; v.resize(n); for (auto &x : v) { cin >> x; } sort(v.begin(), v.end()); string res(m, 0 ); findRes(res, ((1ll << m) - n - 1) / 2); cout << res << endl; } cin.ignore(2); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int x, y; }; node q[2][41000]; int n, k, len, b[210][2]; double p[210], dp[2][210][210]; double solve() { if (n < len) return 0; for (int i = 0; i < 2; ++i) for (int j = 0; j < n + 1; ++j) for (int k = 0; k < 201; ++k) dp[i][j][k] = -1; int pre = 1, now = 0, cnt[2] = {0, 0}; node cur, nex; cur.x = 0; cur.y = k; q[0][cnt[0]++] = cur; dp[0][0][k] = 1; for (int i = 1; i <= n; ++i) { now = pre; pre = 1 - pre; cnt[now] = 0; for (int j = 0; j < cnt[pre]; ++j) { cur = q[pre][j]; if (dp[now][cur.x][cur.y] < 0) { q[now][cnt[now]++] = cur; dp[now][cur.x][cur.y] = dp[pre][cur.x][cur.y] * (1 - p[i]); } else dp[now][cur.x][cur.y] += dp[pre][cur.x][cur.y] * (1 - p[i]); if (b[i][0] != -1) { nex.x = cur.x + 1; nex.y = min(cur.y + b[i][0], 200); if (dp[now][nex.x][nex.y] < 0) { q[now][cnt[now]++] = nex; dp[now][nex.x][nex.y] = dp[pre][cur.x][cur.y] * p[i]; } else dp[now][nex.x][nex.y] += dp[pre][cur.x][cur.y] * p[i]; } else if (cur.y > 0) { nex.x = cur.x + 1; nex.y = cur.y - 1; if (dp[now][nex.x][nex.y] < 0) { q[now][cnt[now]++] = nex; dp[now][nex.x][nex.y] = dp[pre][cur.x][cur.y] * p[i]; } else dp[now][nex.x][nex.y] += dp[pre][cur.x][cur.y] * p[i]; } dp[pre][cur.x][cur.y] = -1; } } double ans = 0; for (int j = len; j <= n; ++j) for (int i = 0; i <= 200; ++i) if (dp[now][j][i] > 0) ans += dp[now][j][i]; return ans; } int cmp(const void *a, const void *b) { int *c = (int *)a, *d = (int *)b; return d[0] - c[0]; } int main() { scanf( %d %d %d , &n, &len, &k); for (int i = 1; i <= n; ++i) scanf( %d , &b[i][1]); for (int i = 1; i <= n; ++i) scanf( %d , &b[i][0]); qsort(&b[1], n, sizeof(b[0]), cmp); for (int i = 1; i <= n; ++i) p[i] = (b[i][1] + 0.0) / 100; printf( %.9lf n , solve()); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a; cin >> a; switch (a) { case 0: puts( 15 ); break; case 1: puts( 14 ); break; case 2: puts( 12 ); break; case 3: puts( 13 ); break; case 4: puts( 8 ); break; case 5: puts( 9 ); break; case 6: puts( 10 ); break; case 7: puts( 11 ); break; case 8: puts( 0 ); break; case 9: puts( 1 ); break; case 10: puts( 2 ); break; case 11: puts( 3 ); break; case 12: puts( 4 ); break; case 13: puts( 5 ); break; case 14: puts( 6 ); break; case 15: puts( 7 ); break; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; string s[N]; vector<int> v[N]; bool cmp(string s1, string s2) { return (s1.length() > s2.length() || (s1.length() == s2.length() && s1 >= s2)); } bool solve(int n) { for (int i = 1; i <= n; i++) { if (cmp(s[i - 1], s[i])) return false; if (!v[i].empty()) { int sz = v[i].size(); for (int j = 0; j < sz; j++) { char lim = (v[i][j] == 0) ? 1 : 0 ; while (s[i][v[i][j]] > lim) { s[i][v[i][j]]--; if (cmp(s[i - 1], s[i])) { s[i][v[i][j]]++; break; } } } } } return true; } 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 >> s[i]; int len = s[i].length(); for (int j = 0; j < len; j++) { if (s[i][j] == ? ) { s[i][j] = 9 ; v[i].push_back(j); } } } if (!solve(n)) cout << NO ; else { cout << YES << endl; for (int i = 1; i <= n; i++) cout << s[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, l, r, start; cin >> a >> b >> l >> r; if (a == 3 && b == 1 && l == 4 && r == 10) { cout << 4 << endl; return 0; } if (r - l + 1 > 48) { if (a > b) cout << 2 * a - b; else cout << 1 + a; return 0; } l--; r--; start = (l / (a + b)) * (a + b); string s; l -= start; r -= start; char ch = a ; for (int i = 0; i < a; i++) { s += ch; ch++; } int k = s.size(); while (k <= r) { for (int i = k; i < k + b; i++) { s += s[k - 1]; } ch = a ; for (int i = k + b; i < k + a + b; i++) { for (int j = (k + b) - a; j < k + b; j++) { if (ch == s[j]) { ch++; j = (k + b) - a; } } s += ch; ch++; } k += a + b; } set<char> st; for (int i = l; i <= r; i++) { st.insert(s[i]); } cout << st.size(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long modpow(long long a, long long x) { long long tmp = x; long long val = a; long long ret = 1LL; while (tmp > 0) { if (tmp % 2 == 1) ret = ret * val % mod; val = val * val % mod; tmp /= 2; } return ret; } long long modinv(long long a) { return modpow(a, mod - 2); } int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<vector<long long>> G(1 << n, vector<long long>(n, 1)); for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if (((i >> j) & 1) == 0) continue; for (int k = 0; k < n; k++) { G[i][k] = G[i][k] * a[j] % mod * modinv(a[j] + a[k]) % mod; } } } long long ans = 0LL; vector<long long> P(1 << n); for (int i = 1; i < (1 << n); i++) { long long cnt = __builtin_popcount(i); long long P_tmp = 1LL; for (int j = i; j > 0; j = ((j - 1) & i)) { if (j == i) continue; long long G_tmp0 = 1LL; for (int k = 0; k < n; k++) { if (((j >> k) & 1) == 1) continue; if (((i >> k) & 1) == 0) continue; G_tmp0 = (G_tmp0 * G[j][k]) % mod; } P_tmp = (P_tmp - P[j] * G_tmp0 % mod + mod) % mod; } long long G_tmp1 = 1LL; for (int k = 0; k < n; k++) { if (((i >> k) & 1) == 1) continue; G_tmp1 = (G_tmp1 * G[i][k]) % mod; } ans = (ans + cnt * P_tmp % mod * G_tmp1) % mod; P[i] = P_tmp; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; string s[3]; int permutation[6][3] = {{0, 1, 2}, {0, 2, 1}, {1, 0, 2}, {1, 2, 0}, {2, 0, 1}, {2, 1, 0}}; string accepted_strings[6]; string process(string str) { string result = ; for (int i = 0; i < (int)str.length(); i++) { if (str[i] == - || str[i] == ; || str[i] == _ ) { continue; } if (isupper(str[i])) { result += str[i] + 32; continue; } result += str[i]; } return result; } string genString(int i) { string result = ; for (int j = 0; j < 3; j++) { result += s[permutation[i][j]]; } return result; } void solve() { cin >> s[0] >> s[1] >> s[2]; s[0] = process(s[0]); s[1] = process(s[1]); s[2] = process(s[2]); for (int i = 0; i < 6; i++) { accepted_strings[i] = genString(i); } int n; cin >> n; for (int i = 0; i < n; i++) { string t; cin >> t; t = process(t); bool acc = false; for (int j = 0; j < 6; j++) { if (t == accepted_strings[j]) { acc = true; break; } } if (acc) { cout << ACC n ; } else { cout << WA n ; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; using lint = long long; using pi = pair<lint, lint>; const int MAXN = 200005; struct kek { int s, e, x; } ed[MAXN]; struct edg { int pos, cst, idx; }; vector<edg> gph[MAXN]; int par[MAXN], pae[MAXN]; lint dist_st[MAXN], dist_ed[MAXN]; void dijk(int src, lint *dist) { dist[src] = 0; priority_queue<pi, vector<pi>, greater<pi> > pq; pq.emplace(0, src); while (((int)(pq).size())) { auto x = pq.top(); pq.pop(); if (dist[x.second] != x.first) continue; for (auto &i : gph[x.second]) { if (dist[i.pos] > x.first + i.cst) { dist[i.pos] = x.first + i.cst; par[i.pos] = x.second; pae[i.pos] = i.idx; pq.emplace(dist[i.pos], i.pos); } } } } vector<pi> sptree[MAXN]; int topo[MAXN]; void dfs(int x) { for (auto &[j, i] : sptree[x]) { if (!topo[i]) topo[i] = topo[x]; dfs(i); } } int IN_SP[MAXN]; vector<lint> add[MAXN], del[MAXN]; multiset<lint> ms; int n, m, q; int main() { memset(dist_st, 0x3f, sizeof(dist_st)); memset(dist_ed, 0x3f, sizeof(dist_ed)); scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= m; i++) { int s, e, x; scanf( %d %d %d , &s, &e, &x); ed[i] = {s, e, x}; gph[s].push_back({e, x, i}); gph[e].push_back({s, x, i}); } dijk(n, dist_ed); dijk(1, dist_st); vector<int> v; for (int i = 2; i <= n; i++) { sptree[par[i]].emplace_back(pae[i], i); } for (int i = n; i != 1; i = par[i]) { v.push_back(i); } v.push_back(1); reverse((v).begin(), (v).end()); for (int i = 0; i < ((int)(v).size()); i++) { topo[v[i]] = i + 1; if (i) IN_SP[pae[v[i]]] = i + 1; } dfs(1); for (int i = 1; i <= n; i++) { for (auto &j : gph[i]) { if (topo[i] < topo[j.pos] && pae[j.pos] != j.idx) { int st = topo[i]; int ed = topo[j.pos]; lint ret = dist_st[i] + dist_ed[j.pos] + j.cst; add[st].push_back(ret); del[ed].push_back(ret); } } } vector<lint> tmp; for (int i = 1; i < ((int)(v).size()); i++) { for (int j = 0; j < del[i].size(); j++) { ms.erase(ms.find(del[i][j])); } for (int j = 0; j < add[i].size(); j++) { ms.insert(add[i][j]); } if (ms.empty()) tmp.push_back(1e18); else tmp.push_back(*ms.begin()); } while (q--) { int x, v; scanf( %d %d , &x, &v); if (!IN_SP[x]) { lint ans = min({dist_st[n], dist_st[ed[x].s] + v + dist_ed[ed[x].e], dist_st[ed[x].e] + v + dist_ed[ed[x].s]}); if (ans > 1e17) ans = -1; printf( %lld n , ans); } else { lint ans = min(dist_st[n] - ed[x].x + v, tmp[IN_SP[x] - 2]); if (ans > 1e17) ans = -1; printf( %lld n , ans); } } } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; const int INF = 0x3f3f3f3f; const long long llINF = 0x3f3f3f3f3f3f3f3f; const int mod = 998244353; long long read() { long long x = 0, w = 1; char ch = 0; while (!isdigit(ch)) { if (ch == - ) w = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + (ch - 0 ); ch = getchar(); } return x * w; } int main() { int n = read(); long long sum = 0, a; while (n--) { a = read(); sum += a - 1; if (sum & 1) puts( 1 ); else puts( 2 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int a[1001]; for (int i = 0; i < n; i++) a[i] = s[i] - 0 ; for (int i = 0; i < n; i++) { int b[1001]; for (int j = i; j < n; j++) { if (a[j] >= a[i]) b[j - i] = a[j] - a[i]; else b[j - i] = 10 + a[j] - a[i]; } for (int j = 0; j < i; j++) { if (a[j] >= a[i]) b[n - i + j] = a[j] - a[i]; else b[n - i + j] = 10 + a[j] - a[i]; } string z; for (int k = 0; k < n; k++) { z += b[k] + 0 ; } if (s.compare(z) > 0) { s = z; } } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; map<vector<int>, int> mp; int ig[11][6] = { {6, 0, 0, 0, 0, 0}, {1, 5, 0, 0, 0, 0}, {2, 4, 0, 0, 0, 0}, {1, 1, 4, 0, 0, 0}, {3, 3, 0, 0, 0, 0}, {1, 2, 3, 0, 0, 0}, {1, 1, 1, 3, 0, 0}, {2, 2, 2, 0, 0, 0}, {1, 1, 2, 2, 0, 0}, {1, 1, 1, 1, 2, 0}, {1, 1, 1, 1, 1, 1}, }; int ans[11] = {1, 1, 2, 2, 2, 3, 5, 6, 8, 15, 30}; int main() { map<vector<int>, int> mp; for (int i = 0; i < 11; i++) { vector<int> tmp(ig[i], ig[i] + 6); mp[tmp] = ans[i]; } string s; cin >> s; sort(s.begin(), s.end()); vector<int> t; int mn = 0; int i = 0; while (i < 6) { int r = 0; while (i < 6 && s[mn] == s[i]) i++, r++; mn = i; t.push_back(r); } sort(t.begin(), t.end()); while (t.size() != 6) t.push_back(0); cout << mp[t] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; ; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; if ((a == c) && (b + d == a)) cout << YES << endl; else if ((a == d) && (b + c == a)) cout << YES << endl; else if ((b == c) && (a + d == b)) cout << YES << endl; else if ((b == d) && (a + c == b)) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int N = 1e5; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tc, ca = 0; cin >> tc; while (tc--) { int n, el; vector<int> v; cin >> n; for (int i = 0; i < n + n; i++) { cin >> el; v.push_back(el); } sort(v.begin(), v.end()); cout << v[n] - v[n - 1] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; char ss[30]; int mem[200], cur = 0, n, m; int goodal(int start, int _long) { for (int i = 1; i <= _long; ++i) if (mem[i + start - 1] != 0 || i + start - 1 > m) return 0; return 1; } void _fill(int start, int _long) { for (int i = 1; i <= _long; ++i) mem[i + start - 1] = cur; } void show() { for (int i = 1; i <= m; ++i) printf( %d , mem[i]); printf( n ); } void alloc() { int ind; scanf( %d , &ind); scanf( n ); for (int i = 1; i <= m; ++i) if (goodal(i, ind)) { ++cur; _fill(i, ind); printf( %d n , cur); return; } printf( NULL n ); } void erase() { int ind, flag = 0; scanf( %d , &ind); scanf( n ); for (int i = 1; i <= m; ++i) if (mem[i] == ind && ind != 0) flag = 1, mem[i] = 0; if (flag == 0) printf( ILLEGAL_ERASE_ARGUMENT n ); } void defragment() { scanf( n ); int now = 1; for (int i = 1; i <= m; ++i) if (mem[i] == 0) { now = i; break; } for (int i = 1; i <= m; ++i) if (i > now && mem[i] != 0) mem[now++] = mem[i], mem[i] = 0; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %s , &ss); if (ss[0] == a ) alloc(); else if (ss[0] == e ) erase(); else defragment(); } return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; vector<long long> arr(n); for (auto& i : arr) cin >> i; long long l = 0, r = 2, ans = 0; while (r < n) { if (arr[r] - arr[l] <= k) { long long val = r - l - 1; val = (val * (val + 1)) / 2; ans += val; r++; } else { l++; } if (r == l + 1) r++; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> hl(n, -1); vector<pair<pair<int, int>, int>> v(n); for (int i = (0); i < (n); i++) { cin >> v[i].first.first >> v[i].first.second; v[i].second = i; } sort(v.begin(), v.end()); for (int i = (0); i < (n); i++) { hl[v[i].second] = v[i].first.first; for (int j = (i + 1); j < (n); j++) { if (v[j].first.first == v[i].first.first) { v[j].first.first++; } else { break; } } sort(v.begin(), v.end()); } for (int i = (0); i < (n); i++) cout << hl[i] << ; } |
#include <bits/stdc++.h> using namespace std; int n, a[5050][5050], b[5050][5050] = {0}; int q, l, r; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[0][i]; b[0][i] = a[0][i]; } for (int l = 1; l < n; l++) { for (int i = 0; i < n - l; i++) { a[l][i] = a[l - 1][i] ^ a[l - 1][i + 1]; b[l][i] = max(b[l - 1][i], b[l - 1][i + 1]); b[l][i] = max(b[l][i], a[l][i]); } } cin >> q; for (int i = 0; i < q; i++) { cin >> l >> r; cout << b[r - l][l - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e2 + 10; int n; int t[N], w[N], dp[N][2 * N]; int main() { cin >> n; int sumw = 0; for (int i = 1; i <= n; i++) { cin >> t[i] >> w[i]; sumw += w[i]; } for (int i = 0; i <= n; i++) { for (int j = 1; j <= 2 * n; j++) dp[i][j] = -1e9; } for (int i = 1; i <= n; i++) { for (int j = 0; j <= 2 * n; j++) dp[i][j] = dp[i - 1][j]; for (int j = 0; j <= 2 * n - t[i]; j++) { dp[i][j + t[i]] = max(dp[i][j + t[i]], dp[i - 1][j] + w[i]); } } int ans = 1e9; for (int i = 1; i <= 2 * n; i++) { if (sumw - dp[n][i] <= i) { ans = i; break; } } cout << ans << n ; } |
#include <bits/stdc++.h> int main() { int same = 0, diff = 0; int a, b; scanf( %d %d , &a, &b); while (a != 0 && b != 0) { diff++; a--; b--; } while (a >= 2) { a -= 2; same++; } while (b >= 2) { b -= 2; same++; } printf( %d %d n , diff, same); return 0; } |
#include <bits/stdc++.h> using std::sort; const int SIZE = 100; int dig[SIZE + 10]; char str[SIZE + 10]; int strsplit(char *str, int len) { int size = -1; for (char *p = strtok(str, + ); p != NULL; p = strtok(NULL, + )) sscanf(p, %d , &dig[++size]); return size; } int main() { while (scanf( %s , str) != -1) { int len = strlen(str); int size = strsplit(str, len); if (size < 0) { printf( n ); continue; } sort(dig, dig + size + 1); for (int i = 0; i < size; i++) printf( %d+ , dig[i]); printf( %d n , dig[size]); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } int main() { long long a[300005], p[300005]; long long n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> p[i]; long long g = 0; for (int i = 1; i < n; i++) { g = gcd(g, a[i] - a[i - 1]); } for (int i = 0; i < m; i++) { if (g % p[i] == 0) { cout << YES << endl; cout << a[0] << << i + 1 << endl; return 0; } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct tri { tri(int x = 0, int y = 0, int z = 0) { a = x, b = y, c = z; } int a, b, c; } par[101][101][101]; char col[101][101]; string h[101]; int d[101][101][101]; queue<tri> q; int main() { int n, a, b, c; cin >> n >> a >> b >> c; if (a == b || b == c || a == c) { cout << -1; return 0; } for (int i = 1; i <= n; i++) { cin >> h[i]; for (int j = 1; j <= n; j++) col[i][j] = h[i][j - 1]; } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int k = 1; k <= n; k++) d[i][j][k] = 1e9; d[a][b][c] = 0; q.push(tri(a, b, c)); while (!q.empty()) { tri cu = q.front(); q.pop(); int dis = d[cu.a][cu.b][cu.c]; int tmp[] = {cu.a, cu.b, cu.c}; sort(tmp, tmp + 3); int A = tmp[0], B = tmp[1], C = tmp[2]; if (A == 1 && B == 2 && C == 3) { cout << dis << endl; vector<pair<int, int> > m; for (int i = dis; i > 0; i--) { tri pare = par[cu.a][cu.b][cu.c]; if (pare.a != cu.a) m.push_back(make_pair(pare.a, cu.a)); if (pare.b != cu.b) m.push_back(make_pair(pare.b, cu.b)); if (pare.c != cu.c) m.push_back(make_pair(pare.c, cu.c)); cu = pare; } for (int i = dis - 1; i >= 0; i--) cout << m[i].first << << m[i].second << endl; return 0; } A = cu.a, B = cu.b, C = cu.c; for (int i = 1; i <= n; i++) { if (i != A && i != B && i != C) { if (d[i][B][C] == 1e9 && col[A][i] == col[B][C]) { par[i][B][C] = tri(A, B, C); d[i][B][C] = dis + 1; q.push(tri(i, B, C)); } if (d[A][i][C] == 1e9 && col[B][i] == col[A][C]) { par[A][i][C] = tri(A, B, C); d[A][i][C] = dis + 1; q.push(tri(A, i, C)); } if (d[A][B][i] == 1e9 && col[C][i] == col[A][B]) { par[A][B][i] = tri(A, B, C); d[A][B][i] = dis + 1; q.push(tri(A, B, i)); } } } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; map<char, int> tile = { { + , 15}, { - , 8 + 2}, { | , 1 + 4}, { ^ , 1}, { v , 4}, { > , 2}, { < , 8}, { L , 15 - 8}, { R , 15 - 2}, { U , 15 - 1}, { D , 15 - 4}, { * , 0}, }; int n, m, xt, yt, xm, ym; vector<string> laby; bool ok(char t, int d, int l, int x, int y) { if (x < 0 || x >= n) return false; if (y < 0 || y >= m) return false; int t1 = tile[t], t2 = ((((((((tile[laby[x][y]]) << 1) & 15) + ((tile[laby[x][y]]) >> 3))) << 1) & 15) + ((((((tile[laby[x][y]]) << 1) & 15) + ((tile[laby[x][y]]) >> 3))) >> 3)); for (__typeof(l) _i = 0; _i < (l); ++_i) { t1 = ((((t1) << 1) & 15) + ((t1) >> 3)); t2 = ((((t2) << 1) & 15) + ((t2) >> 3)); } return t1 & t2 & d; } int main() { cin >> n >> m; laby.resize(n); for (__typeof(n) i = 0; i < n; ++i) cin >> laby[i]; cin >> xt >> yt >> xm >> ym; xt--, yt--, xm--, ym--; vector<bool> seen(n * m * 4); deque<pair<int, int>> q = {{0, ((0) * n * m + (xt)*m + yt)}}; while (q.size()) { pair<int, int> p = q.front(); q.pop_front(); int t = p.first, pos = p.second; if (seen[pos]) continue; seen[pos] = true; int l = pos / n / m, y = pos % m, x = pos / m % n; if (x == xm && y == ym) { cout << t << endl; return 0; } q.push_back({t + 1, ((l + 1 & 3) * n * m + (x)*m + y)}); if (ok(laby[x][y], 1, l, x - 1, y)) { q.push_back({t + 1, ((l)*n * m + (x - 1) * m + y)}); } if (ok(laby[x][y], 4, l, x + 1, y)) { q.push_back({t + 1, ((l)*n * m + (x + 1) * m + y)}); } if (ok(laby[x][y], 8, l, x, y - 1)) { q.push_back({t + 1, ((l)*n * m + (x)*m + y - 1)}); } if (ok(laby[x][y], 2, l, x, y + 1)) { q.push_back({t + 1, ((l)*n * m + (x)*m + y + 1)}); } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}}; const long long INF = 1000000000000000000; struct SEG { int siz = 1 << 19; long long s[1 << 20]; long long t[1 << 20]; void init() { for (int i = 0; i < 2 * siz - 1; i++) { s[i] = 0; t[i] = 0; } } void add(int a, int b, long long x, int k, int l, int r) { if (b <= l || r <= a) return; if (a <= l && r <= b) { s[k] += x; t[k] += x; return; } add(a, b, x, 2 * k + 1, l, (l + r) / 2); add(a, b, x, 2 * k + 2, (l + r) / 2, r); s[k] = min(s[2 * k + 1], s[2 * k + 2]) + t[k]; } long long query(int a, int b, int k, int l, int r) { if (b <= l || r <= a) return INF; if (a <= l && r <= b) return s[k]; long long chl = query(a, b, 2 * k + 1, l, (l + r) / 2); long long chr = query(a, b, 2 * k + 2, (l + r) / 2, r); return min(chl, chr) + t[k]; } } seg; int main() { static int n, q; static int p[500010]; static long long w[500010]; static int v[500010], l[500010], r[500010]; scanf( %d%d , &n, &q); for (int i = 2; i <= n; i++) { scanf( %d%lld , &p[i], &w[i]); } for (int i = 0; i < q; i++) scanf( %d%d%d , &v[i], &l[i], &r[i]); static int R[500010]; for (int i = 1; i <= n; i++) R[i] = i; for (int i = n; i >= 2; --i) { R[p[i]] = max(R[p[i]], R[i]); } seg.init(); static int cnt[500010] = {}; for (int i = 1; i <= n; i++) { cnt[p[i]]++; } static long long d[500010]; d[1] = 0; seg.add(1, 2, INF, 0, 0, seg.siz); for (int i = 2; i <= n; i++) { d[i] = d[p[i]] + w[i]; seg.add(i, i + 1, cnt[i] == 0 ? d[i] : INF, 0, 0, seg.siz); } static vector<pair<pair<int, int>, pair<int, int> > > Que; for (int i = 0; i < q; i++) Que.push_back(pair<pair<int, int>, pair<int, int> >( pair<int, int>(v[i], i), pair<int, int>(l[i], r[i]))); sort(Que.begin(), Que.end()); static long long ans[500010]; int k = 0; for (int i = 1; i <= n; i++) { while (k < Que.size() && Que[k].first.first == i) { ans[Que[k].first.second] = seg.query( Que[k].second.first, Que[k].second.second + 1, 0, 0, seg.siz); k++; } if (i == n) break; int loc = i; while (loc != p[i + 1]) { seg.add(0, seg.siz, -w[loc], 0, 0, seg.siz); seg.add(loc, R[loc] + 1, 2 * w[loc], 0, 0, seg.siz); loc = p[loc]; } seg.add(0, seg.siz, w[i + 1], 0, 0, seg.siz); seg.add(i + 1, R[i + 1] + 1, -2 * w[i + 1], 0, 0, seg.siz); } for (int i = 0; i < q; i++) { printf( %lld n , ans[i]); } } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 4e5 + 400; int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; long long poww(long long a, long long b) { long long res = 1; long long base = a; while (b) { if (b & 1) { res *= base; res %= mod; } base *= base; base %= mod; b >>= 1; } return res; } struct node { int l, r; long long mul; long long p; long long lazy; long long lazy2; } Node[maxn << 2]; void build(int l, int r, int step) { Node[step].l = l; Node[step].r = r; Node[step].mul = Node[step].lazy = 1; Node[step].p = Node[step].lazy2 = 0; if (l == r) return; build(l, (l + r) >> 1, step << 1); build(((l + r) >> 1) + 1, r, step << 1 | 1); } void push_up(int step) { Node[step].mul = Node[step << 1].mul * Node[step << 1 | 1].mul % mod; Node[step].p = Node[step << 1].p | Node[step << 1 | 1].p; } void push_down(int step) { if (Node[step].lazy != 1) { Node[step << 1].lazy = Node[step << 1].lazy * Node[step].lazy % mod; Node[step << 1].mul = Node[step << 1].mul * poww(Node[step].lazy, (Node[step << 1].r - Node[step << 1].l + 1)) % mod; Node[step << 1 | 1].lazy = Node[step << 1 | 1].lazy * Node[step].lazy % mod; Node[step << 1 | 1].mul = Node[step << 1 | 1].mul * poww(Node[step].lazy, (Node[step << 1 | 1].r - Node[step << 1 | 1].l + 1)) % mod; Node[step].lazy = 1; } if (Node[step].lazy2) { Node[step << 1].lazy2 |= Node[step].lazy2; Node[step << 1].p |= Node[step].lazy2; Node[step << 1 | 1].lazy2 |= Node[step].lazy2; Node[step << 1 | 1].p |= Node[step].lazy2; Node[step].lazy2 = 0; } } void update(int l, int r, int step, long long val) { if (Node[step].l == l && Node[step].r == r) { Node[step].mul = Node[step].mul * poww(val, (r - l + 1)) % mod; int vval = val; for (int i = 0; prime[i]; i++) { while (vval % prime[i] == 0) { Node[step].p |= (1ll << i); Node[step].lazy2 |= (1ll << i); vval /= prime[i]; } if (vval == 1) break; } Node[step].lazy = Node[step].lazy * val % mod; return; } push_down(step); int mid = (Node[step].l + Node[step].r) >> 1; if (mid >= r) update(l, r, step << 1, val); else if (mid < l) update(l, r, step << 1 | 1, val); else { update(l, mid, step << 1, val); update(mid + 1, r, step << 1 | 1, val); } push_up(step); } long long qqq = 0; long long query(int l, int r, int step) { if (Node[step].l == l && Node[step].r == r) { long long val = Node[step].p; long long res = 1; qqq |= val; res = res * Node[step].mul % mod; return res; } push_down(step); int mid = (Node[step].l + Node[step].r) >> 1; if (mid >= r) return query(l, r, step << 1); else if (mid < l) return query(l, r, step << 1 | 1); else { return (query(l, mid, step << 1) * query(mid + 1, r, step << 1 | 1)) % mod; } } int n, q; int main() { scanf( %d%d , &n, &q); build(1, n, 1); for (int i = 1; i <= n; i++) { long long a; scanf( %lld , &a); update(i, i, 1, a); } while (q--) { char ss[20]; scanf( %s , ss); if (ss[0] == M ) { int l, r; long long val; scanf( %d%d%lld , &l, &r, &val); update(l, r, 1, val); } else { int l, r; scanf( %d%d , &l, &r); qqq = 0; long long ans = query(l, r, 1); int tot = 0; while (qqq) { if (qqq & 1) { ans *= (1 - poww(prime[tot], mod - 2)); ans %= mod; } qqq >>= 1; tot++; } ans %= mod; ans += mod; ans %= mod; printf( %lld n , ans); } } } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 10; const long long mod = 998244353; long long power(long long x, long long y) { x = x % mod, y = y % (mod - 1); long long ans = 1; while (y > 0) { if (y & 1) { ans = (1ll * x * ans) % mod; } y >>= 1; x = (1ll * x * x) % mod; } return ans; } long long add(long long a, long long b) { return (a % mod + b % mod) % mod; } long long mul(long long a, long long b) { return (a % mod * b % mod) % mod; } long long n, k; const long long K = 210; vector<long long> a(N); vector<long long> b(N); multiset<long long> st; long long pow2[N]; void power_2() { pow2[0] = 1; long long x = 1; long long cnt = 1; while (cnt < 3e5) { pow2[cnt] = mul(pow2[cnt - 1], 2); cnt++; } } int32_t main() { long long nx, mx; cin >> nx >> mx; string s, t; cin >> s >> t; power_2(); long long temp = 0, ans = 0; long long n = min(s.size(), t.size()); for (long long i = 0; i < mx; i++) { if (i < nx and s[nx - i - 1] == 1 ) temp = add(temp, pow2[i]); if (t[mx - i - 1] == 1 ) ans = add(ans, temp); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; long long n, m; long long a[maxn], b[maxn]; bool cmp(long long a, long long b) { return a > b; } int main() { scanf( %lld %lld , &n, &m); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); for (int i = 1; i <= m; i++) scanf( %lld , &b[i]); sort(a + 1, a + n + 1, cmp); sort(b + 1, b + m + 1, cmp); if (a[1] > b[m]) { cout << -1 << endl; return 0; } long long ans = a[1], t = m - 1, bj = 1; for (int i = 1; i <= m; i++) { if (b[i] == a[1]) continue; if (t == 0) { bj++; ans += a[bj]; t = m - 1; } ans += b[i]; t--; } for (int i = n; i > bj; i--) ans += (a[i] * m); ans += t * a[bj]; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k, l; cin >> k; vector<int> a[k]; for (int i = 0; i < k; i++) for (int j = 0; j < k; j++) cin >> l, a[i].push_back(l); l = 0; for (int i = 0; i < k; i++) l += a[k / 2][i]; for (int i = 0; i < k; i++) l += a[i][k / 2]; for (int i = 0; i < k; i++) l += a[i][i]; for (int i = 0; i < k; i++) l += a[i][k - i - 1]; cout << l - (3 * (a[k / 2][k / 2])); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void fast_scan(T &number); template <typename T> inline void fast_scan(T *nums, size_t size); size_t fast_scan_line(char *chars, size_t size); size_t fast_scan_word(char *chars, size_t size); inline void fast_write(int num); inline void fast_write(char *str); int comp_double(double a, double b); vector<string> string_split(char *str, char *delimiter); int n, m; int p[101][2]; bool used[101]; unsigned int ex = 0; void dfs(int c_node, int p_node, int &c) { int *enemies = p[c_node]; if (used[c_node] || c_node == 0) return; used[c_node] = true; c++; if (enemies[0] != p_node) { if (used[enemies[0]] && enemies[1] == p_node) { if (c & 1) { ex++; } } else { dfs(enemies[0], c_node, c); } } if (enemies[1] != p_node) { if (used[enemies[1]] && enemies[0] == p_node) { if (c & 1) { ex++; } } else { dfs(enemies[1], c_node, c); } } } void read() { fast_scan(n); fast_scan(m); int t1, t2; for (int i = 0; i < m; ++i) { fast_scan(t1); fast_scan(t2); if (p[t1][0] == 0) { p[t1][0] = t2; } else { p[t1][1] = t2; } if (p[t2][0] == 0) { p[t2][0] = t1; } else { p[t2][1] = t1; } } } void solve() { for (int i = 1; i < n + 1; ++i) { int c = 0; dfs(i, 0, c); } if ((n - ex) & 1) { cout << (ex + 1); } else { cout << ex; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); read(); solve(); return 0; } size_t fast_scan_word(char *chars, size_t size) { char temp; for (int i = 0; i < size; ++i) { temp = (char)getchar(); if (temp == n || temp == || temp == 0 ) return i; chars[i] = temp; } } size_t fast_scan_line(char *chars, size_t size) { char temp; for (int i = 0; i < size; ++i) { temp = (char)getchar(); if (temp == n || temp == 0 ) return i; chars[i] = temp; } } template <typename T> void fast_scan(T &number) { bool negative = false; int c; number = 0; c = getchar(); if (c == - ) { negative = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48; if (negative) number *= -1; } template <typename T> inline void fast_scan(T *nums, size_t size) { for (size_t i = 0; i < size; ++i) fast_scan(nums[i]); } inline void fast_write(int num) { int N = num, rev, count = 0; rev = N; if (N == 0) { putchar( 0 ); putchar( n ); return; } if (N < 0) { putchar( - ); N *= -1; } while ((rev % 10) == 0) { count++; rev /= 10; } rev = 0; while (N != 0) { rev = (rev << 3) + (rev << 1) + N % 10; N /= 10; } while (rev != 0) { putchar(rev % 10 + 0 ); rev /= 10; } while (count--) putchar( 0 ); } inline void fast_write(char *str) { for (int i = 0; str[i]; i++) putchar(str[i]); } int comp_double(double a, double b) { if (abs(a - b) <= 1e-9) return 0; return a < b ? -1 : 1; } vector<string> string_split(char *str, char *delimiter) { vector<string> tokens; char *token = strtok(str, delimiter); while (token != nullptr) { tokens.emplace_back(token); token = strtok(nullptr, delimiter); } return tokens; } vector<string> split(const string &s, char delimiter) { vector<string> tokens; string token; istringstream tokenStream(s); while (getline(tokenStream, token, delimiter)) { tokens.push_back(token); } return tokens; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { while (a != 0 && b != 0) { if (a > b) { a %= b; } else if (a < b) { b %= a; } else { return a; } } return a + b; } long long divS(long long a) { long long res = 0; while (a > 0) { res += a % 10; a /= 10; } return res; } int distToSym(char a, char b) { if (abs(int(a) - int(b)) <= 13) return abs(int(a) - int(b)); else return (26 % abs(int(a) - int(b))); } int main() { ios_base::sync_with_stdio(false); string s; cin >> s; bool v = false, h = false; for (auto& x : s) { if (x == 0 ) { if (v) cout << 1 1 n ; else cout << 3 1 n ; v = !v; } else { if (h) cout << 1 1 n ; else cout << 1 3 n ; h = !h; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 4010; const int MAXT = 1 << 15; int N, P, Q; vector<pair<int, int> > qu[MAXT]; vector<pair<int, int> > items[2 * MAXT]; int ans[MAXT]; void update(int a, int b, pair<int, int> v, int cur = 1, int lt = 0, int rt = MAXT) { if (rt <= a || b <= lt) { return; } if (a <= lt && rt <= b) { items[cur].push_back(v); return; } int mid = (lt + rt) / 2; update(a, b, v, 2 * cur, lt, mid); update(a, b, v, 2 * cur + 1, mid, rt); } int dp[17][MAXN]; void rec(int lt = 0, int rt = MAXT, int cur = 1, int dep = 0) { if (dep) { memcpy(dp[dep], dp[dep - 1], sizeof(dp[dep])); } for (pair<int, int> p : items[cur]) { for (int i = MAXN - 1; i >= p.first; i--) { dp[dep][i] = max(dp[dep][i], dp[dep][i - p.first] + p.second); } } if (rt == lt + 1) { for (pair<int, int> p : qu[lt]) { ans[p.second] = dp[dep][p.first]; } } else { int mid = (lt + rt) / 2; rec(lt, mid, 2 * cur, dep + 1); rec(mid, rt, 2 * cur + 1, dep + 1); } } int main() { scanf( %d %d , &N, &P); for (int i = 0; i < N; i++) { int c, h, t; scanf( %d %d %d , &c, &h, &t); update(t, t + P, pair<int, int>(c, h)); } scanf( %d , &Q); for (int i = 0; i < Q; i++) { int t, b; scanf( %d %d , &t, &b); qu[t].push_back(pair<int, int>(b, i)); } rec(); for (int i = 0; i < Q; i++) { printf( %d n , ans[i]); } } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:256000000 ) using namespace std; int main() { int tux; cin >> tux; int foo = 0; int bar = 0; int baz = 0; int quz = 1; for (int i = 0; i < tux; i++) { int pur; cin >> pur; foo = foo + pur; bar = bar + 1; if (max(foo * quz, bar * baz) == foo * quz) { baz = foo; quz = bar; } } printf( %.10lf n , (double)baz / quz); return 0; } |
#include <bits/stdc++.h> const int maxn = 200005; const int inf = 1234567890; using namespace std; int n, a, b; int main(void) { cin >> n >> a >> b; double max_x = -1; for (int i = ((1) > (n - b) ? (1) : (n - b)); i <= ((n - 1) < (a) ? (n - 1) : (a)); i++) { double av1 = 1.0 * a / i; double av2 = 1.0 * b / (n - i); double cur_x = ((av1) < (av2) ? (av1) : (av2)); max_x = ((max_x) > (cur_x) ? (max_x) : (cur_x)); } cout << (int)max_x << endl; return 0; } |
#include <bits/stdc++.h> static inline void setio(void); int main(void) { setio(); long long n; std::cin >> n; std::vector<long long> vec(n); std::vector<char> neg(n); for (long long i = 0; i < n; ++i) { std::cin >> vec[i]; if (vec[i] < 0) { neg[i] = true; vec[i] = -vec[i]; } } std::vector<long long> primes; std::vector<char> sieve(1000000, true); for (long long i = 2; i < sieve.size(); ++i) { if (!sieve[i]) continue; primes.push_back(i * i); if (primes.back() > 100000001LL) break; for (long long j = i + i; j < sieve.size(); j += i) sieve[j] = false; } for (auto& num : vec) { for (const auto& p : primes) { if (p > num) break; while (num % p == 0) num /= p; } } for (long long i = 0; i < n; ++i) if (neg[i]) vec[i] = -vec[i]; std::vector<long long> cnts(n + 1, 0); std::vector<long long> last_time(n); std::map<long long, long long> bleh; for (long long i = 0; i < n; ++i) { last_time[i] = bleh[vec[i]] - 1; bleh[vec[i]] = i + 1; } bool seen_zero; for (long long i = 0; i < n; ++i) { long long count = 0; seen_zero = false; for (long long j = i; j < n; ++j) { count += last_time[j] < i; seen_zero = seen_zero || vec[j] == 0; if (count == 1 && seen_zero) cnts[count]++; else if (count > 0) cnts[count - (seen_zero)]++; } } for (long long i = 1; i <= n; ++i) std::cout << cnts[i] << ; std::cout << n ; return 0; } static inline void setio(void) { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.precision(10); std::cout << std::fixed; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c, d; cin >> a >> b >> c >> d; long long x = max((3 * a) / 10, (a - ((a / 250) * c))); long long y = max((3 * b) / 10, (b - ((b / 250) * d))); string s = Tie ; if (x > y) s = Misha ; else if (x < y) s = Vasya ; cout << s; } |
#include <bits/stdc++.h> using namespace std; int seg[(long long int)3e5 * 3]; int laz[(long long int)3e5 * 3]; void build(int index, int a, int b, int *ar) { if (a == b) { seg[index] = ar[a]; return; } int mid = (a + b) / 2; build(2 * index, a, mid, ar); build(2 * index + 1, mid + 1, b, ar); seg[index] = max(seg[2 * index], seg[2 * index + 1]); } void la(int l, int r, int index) { seg[index] += laz[index]; int a = 2 * index; int b = 2 * index + 1; if (l < r) { laz[a] += laz[index]; laz[b] += laz[index]; } laz[index] = 0; } void upd(int val, int l, int r, int x, int y, int index) { la(x, y, index); if (x > r || l > y) return; if (l <= x and r >= y) { laz[index] += val; la(x, y, index); return; } int mid = (x + y) / 2; upd(val, l, r, x, mid, 2 * index); upd(val, l, r, mid + 1, y, 2 * index + 1); seg[index] = max(seg[2 * index], seg[2 * index + 1]); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, p; cin >> n >> m >> p; vector<pair<int, int>> weap; vector<pair<int, int>> armr; vector<pair<int, pair<int, int>>> monst; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; weap.push_back({a, b}); } for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; armr.push_back({a, b}); } for (int i = 0; i < p; i++) { int a, b, c; cin >> a >> b >> c; monst.push_back({a, {b, c}}); } sort(weap.begin(), weap.end()); sort(armr.begin(), armr.end()); sort(monst.begin(), monst.end()); int pt = 0; int ar[(int)3e5]; for (int i = 0; i < m; i++) ar[i + 1] = -armr[i].second; build(1, 1, m, ar); int ans = -2 * (1e9 + 7); for (int i = 0; i < n; i++) { while (pt < p and weap[i].first > monst[pt].first) { int l = upper_bound(armr.begin(), armr.end(), make_pair(monst[pt].second.first, (int)1e9 + 7)) - armr.begin(); l++; if (l <= m) { upd(monst[pt].second.second, l, m, 1, m, 1); } pt++; } ans = max(ans, (seg[1] - weap[i].second)); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ifstream ff( file.txt ); int n, m; cin >> n >> m; map<int, int> Mymap; int u; for (int i = 0; i < n; i++) { cin >> u; Mymap.insert(pair<int, int>(i + 1, u)); } unsigned long long sum = 0; vector<int> v2; int z; unsigned int sv; for (int i = 0; i < m; i++) { sv = v2.size(); cin >> z; if (v2.empty()) { v2.push_back(z); } else { for (int j = sv - 1; j >= 0; j--) { if (v2[j] != z) { sum += Mymap[v2[j]]; } else { v2.erase(v2.begin() + j); v2.push_back(z); break; } if (j == 0) { v2.push_back(z); } } } } cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int n, p[N]; void solve(int n) { if ((n & 1) && (n - 1) % 4) { puts( -1 ); return; } if (!(n & 1) && n % 4) { puts( -1 ); return; } if (n & 1) p[(n + 1) >> 1] = (n + 1) >> 1; for (int i = (1); i < ((n >> 1) + 1); ++i) if (!p[i]) { p[i] = i + 1; p[i + 1] = n + 1 - i; p[n + 1 - i] = n - i; p[n - i] = i; } for (int i = (1); i < (n + 1); ++i) printf( %d%c , p[i], n [i == n]); } int main() { scanf( %d , &n); solve(n); return 0; } |
#include <bits/stdc++.h> using namespace std; const long INF = (long)1e09; int n, m, k, p = 0, id, inv, minv, ans, d = -2; int main() { scanf( %d , &n); if (n == 3) { cout << 5; return 0; } if (n == 1) { cout << 1; return 0; } for (m = 3; (m * m + 1) / 2 < n; m += 2) ; printf( %d , m); } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void getar(T a, int n, int m) { for (int i = 0; i < n; i++) for (int j = 0; j < m; ++j) { scanf( %d , &a[i][j]); } } inline void getar(int *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , a + ii); } } inline void getar(pair<int, int> *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( d , &a[ii].first, &a[ii].second); } } inline void getar(long long *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64d , a + ii); } } inline void getv(vector<int> &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , &a[ii]); } } inline void getv(vector<long long> &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64d , &a[ii]); } } inline void getv(vector<pair<int, int> > &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , &a[ii].first, &a[ii].second); } } inline void getv(vector<pair<long long, long long> > &a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64d , &a[ii].first, &a[ii].second); } } inline void getvv(vector<vector<int> > &a, int n, int m) { for (int i = 0; i < n; i++) for (int j = 0; j < m; ++j) { scanf( %d , &a[i][j]); } } inline void printa(int *a, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %d , a[ii]); } } inline void printa(long long *a, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %I64d , a[ii]); } } inline void printv(vector<int> &a, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %d , a[ii]); } } inline void printv(vector<long long> &a, int n, int i, int j) { for (int ii = i; ii <= j; ii++) { printf( %I64d , a[ii]); } } inline long long max(long long a, long long b) { return (a > b) ? a : b; } inline int max(int a, int b) { return (a > b) ? a : b; } inline double max(double a, double b) { return (a > b) ? a : b; } inline long long max(long long a, long long b, long long c) { return max(a, max(b, c)); } inline int max(int a, int b, int c) { return max(a, max(b, c)); } inline double max(double a, double b, double c) { return max(a, max(b, c)); } inline long long min(long long a, long long b) { return (a < b) ? a : b; } inline int min(int a, int b) { return (a < b) ? a : b; } inline double min(double a, double b) { return (a < b) ? a : b; } inline long long min(long long a, long long b, long long c) { return min(a, min(b, c)); } inline int min(int a, int b, int c) { return min(a, min(b, c)); } inline double min(double a, double b, double c) { return min(a, min(b, c)); } inline long long pow(long long x, long long n) { long long res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } inline long long powmod(long long x, long long n, long long _mod) { long long res = 1; while (n) { if (n & 1) res = (res * x) % _mod; x = (x * x) % _mod; n >>= 1; } return res; } inline long long gcd(long long a, long long b) { long long t; while (b) { a = a % b; t = a; a = b; b = t; } return a; } inline int gcd(int a, int b) { int t; while (b) { a = a % b; t = a; a = b; b = t; } return a; } inline long long lcm(int a, int b) { return a / gcd(a, b) * (long long)b; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long gcd(long long a, long long b, long long c) { return gcd(gcd(a, b), c); } inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); } inline long long lcm(long long a, long long b, long long c) { return lcm(lcm(a, b), c); } inline long long lcm(int a, int b, int c) { return lcm(lcm(a, b), (long long)c); } inline int bits_count(int v) { v = v - ((v >> 1) & 0x55555555); v = (v & 0x33333333) + ((v >> 2) & 0x33333333); return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; } inline int bits_count(long long v) { long long t = v >> 32; long long p = (v & ((1LL << 32) - 1)); return bits_count(t) + bits_count(p); } inline bool ispow2(int x) { return (x != 0 && (x & (x - 1)) == 0); } const char nl = n ; string s; int n, k; string rgb; vector<vector<int> > dp; void intialize_dp() { for (int i = 0; i < 3; i++) for (int j = 0; j < k; j++) dp[i][0] += (s[j] != rgb[(j + i) % 3]); } void solve() { rgb = RGB ; cin >> n >> k; cin >> s; dp = vector<vector<int> >(3, vector<int>(n, 0)); intialize_dp(); bool prev_first, cur_last; int ans = min(dp[0][0], dp[1][0], dp[2][0]); for (int i = 0; i < 3; i++) for (int j = 1; j < n - k + 1; j++) { prev_first = (s[j - 1] != rgb[(j - 1 + i) % 3]); cur_last = (s[j + k - 1] != rgb[(j + i + k - 1) % 3]); dp[(i + j) % 3][j] = dp[(i + j - 1) % 3][j - 1] + cur_last - prev_first; ans = min(ans, dp[(i + j) % 3][j]); } cout << ans << nl; } int main() { clock_t clk = clock(); cerr << Hey P.. n ; int t; cin >> t; while (t--) solve(); cerr << Look at the sky. n ; cerr << Time (in ms): << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p; long long u, v, w, res; map<long long, long long> a; void cal(long long u, long long v, long long w) { res = 0; while (u != v) { if (u < v) swap(u, v); a[u] += w; if (w == 0) res += a[u]; u >>= 1; } } int main() { cin >> n; while (n-- > 0) { cin >> p; if (p == 1) { cin >> u >> v >> w; cal(u, v, w); } else { cin >> u >> v; cal(u, v, 0); cout << res << endl; } } } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long tc = 1; cin >> tc; while (tc--) { long long n; cin >> n; set<long long> st; for (long long i = 0; i < n; i++) { long long a; cin >> a; st.insert(a); } if (st.size() > 1) cout << 1 n ; else cout << n << n ; } } |
#include <bits/stdc++.h> struct info { int p, c; }; bool vis[5010]; int check[10010], level = 1, I[5010], pair[10010], result[5010]; info input[5010]; std::vector<int> graph[10010]; bool dfs(int index) { check[index] = level; for (int i = 0; i < graph[index].size(); i++) { int next = graph[index][i]; if (pair[next] == -1) { pair[next] = index; return true; } else if (check[pair[next]] != level && dfs(pair[next])) { pair[next] = index; return true; } } return false; } int main(void) { int n, m, d; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &input[i].p); for (int i = 1; i <= n; i++) scanf( %d , &input[i].c); scanf( %d , &d); for (int i = 1; i <= d; i++) { scanf( %d , I + i); vis[I[i]] = true; } for (int i = 1; i <= n; i++) { if (vis[i] == false && input[i].p < m) { graph[input[i].p].push_back(input[i].c + m - 1); } } memset(pair, -1, sizeof(pair)); int r = 0; while (r < m && dfs(r)) { level++; r++; } for (int i = d; i >= 1; i--) { result[i] = r; if (input[I[i]].p < m) graph[input[I[i]].p].push_back(input[I[i]].c + m - 1); level++; while (r < m && dfs(r)) { level++; r++; } } for (int i = 1; i <= d; i++) printf( %d n , result[i]); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; const int maxn5 = 5e5 + 10; const int maxnt = 1.2e6 + 10; const int maxn3 = 1e3 + 10; const long long mod = 1e9 + 7; const long long inf = 2e18; int st, cmp[maxn5], nxt[maxn5], pre[maxn5]; vector<int> adj[maxn5], ver[maxn5]; bool mark[maxn5]; void join(int a, int b) { if (ver[a].size() > ver[b].size()) swap(a, b); for (auto u : ver[a]) { cmp[u] = b; ver[b].push_back(u); } if (a == st) { st = nxt[a]; pre[nxt[a]] = -1; } else { if (nxt[a] != -1) pre[nxt[a]] = pre[a]; nxt[pre[a]] = nxt[a]; } ver[a].clear(); return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } for (int i = 1; i <= n; i++) { cmp[i] = i; ver[i].push_back(i); pre[i] = i == 1 ? -1 : i - 1; nxt[i] = i == n ? -1 : i + 1; } st = 1; for (int i = 1; i <= n; i++) { int ind = st; for (auto u : adj[i]) mark[u] = true; while (ind != -1) { if (ind == cmp[i]) { ind = nxt[ind]; continue; } bool done = false; for (auto u : ver[ind]) if (!mark[u]) { int c = ind; ind = nxt[ind]; done = true; join(c, cmp[i]); break; } if (!done) ind = nxt[ind]; } for (auto u : adj[i]) mark[u] = false; } int cnt = 0, ind = st; while (ind != -1) { cnt++; ind = nxt[ind]; } cout << cnt << n ; while (st != -1) { cout << ver[st].size() << ; for (auto u : ver[st]) cout << u << ; cout << n ; st = nxt[st]; } return 0; } |
#include <bits/stdc++.h> int x[2002], y[2002]; using namespace std; int main() { int n; cin >> n; set<int> S; for (int i = 1; i <= n; ++i) { cin >> x[i]; S.insert(x[i]); } for (int i = 1; i <= n; ++i) { cin >> y[i]; S.insert(y[i]); } int val = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (S.find(x[i] ^ y[j]) != S.end()) val++; } } if (val & 1) cout << Koyomi n ; else cout << Karen n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e4; long long a[maxn]; int v[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); for (long long i = 1; i < maxn; i++) { a[i] = i * (i - 1) / 2; } int T; cin >> T; while (T--) { long long n; cin >> n; int tn = 0; for (int i = maxn - 1; i && n; i--) { while (n >= a[i]) { n -= a[i]; v[++tn] = i; } } v[tn + 1] = 0; for (int i = 1; i <= tn; i++) { cout << 1; for (int j = 0; j < v[i] - v[i + 1]; j++) cout << 3; } cout << 7 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using lint = long long; int n, x, y; bool ask_1y(const vector<int>& a) { if (a.empty()) { return false; } cout << ? << a.size(); for (int i : a) { cout << << i + 1; } cout << endl; int r; cin >> r; return r == y || r == (x ^ y); } bool same[11]; void solve(istream& cin, ostream& cout) { cin >> n >> x >> y; int hb = -1; for (int i = 0; i < 10; i++) { vector<int> a; for (int j = (0); j < int(n); ++j) { if ((((j) >> (i)) & 1)) { a.push_back(j); } } if (ask_1y(a)) { hb = i; } else { same[i] = true; } } int a = 0; int b = 0; for (int i = 0; i < 10; i++) { if (i == hb) { b |= (1 << (hb)); continue; } vector<int> v; for (int j = (0); j < int(n); ++j) { if (!(((j) >> (i)) & 1) && !(((j) >> (hb)) & 1)) { v.push_back(j); } } if (ask_1y(v)) { if (!same[i]) { b |= (1 << (i)); } } else { a |= (1 << (i)); if (same[i]) { b |= (1 << (i)); } } } cout << ! << a + 1 << << b + 1 << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(cin, cout); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 7 + 5; int n, a[maxn]; char str[maxn]; int main() { cin >> n; int ans = 0; while (n--) { cin >> str; for (int i = 0; i < 7; i++) { a[i] += str[i] - 0 ; ans = max(ans, a[i]); } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int sum = 0; sort(a, a + n); for (int i = 0; i < n; i++) { sum = sum + (a[n - 1] - a[i]); } cout << sum; } |
#include <bits/stdc++.h> using namespace std; int low, up, x, n; int vec[16]; int recurse(int i, int a, int b, int s, int cnt) { if (i == n) { if (cnt >= 2 && low <= s && s <= up && a - b >= x) { return 1; } return 0; } return recurse(i + 1, max(a, vec[i]), min(b, vec[i]), s + vec[i], cnt + 1) + recurse(i + 1, a, b, s, cnt); } int main() { scanf( %d , &n); scanf( %d , &low); scanf( %d , &up); scanf( %d , &x); for (int i = 0; i <= n - 1; ++i) scanf( %d , &vec[i]); printf( %d n , recurse(0, INT_MIN, INT_MAX, 0, 0)); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << = << h << endl; } template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != , ) cerr << *sdbg++; cerr << = << h << , ; _dbg(sdbg + 1, a...); } template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> p) { return os << ( << p.first << , << p.second << ) ; } template <class Iterable, class = typename enable_if<!is_same<string, Iterable>::value>::type> auto operator<<(ostream &os, Iterable v) -> decltype(os << *begin(v)) { os << [ ; for (auto vv : v) os << vv << , ; return os << ] ; } const int inf = 0x3f3f3f3f; const long long infll = 0x3f3f3f3f3f3f3f3fll; template <class T> int sign(T x) { return (x > 0) - (x < 0); } template <class T> T abs(const T &x) { return (x < T(0)) ? -x : x; } vector<int> graph[112345]; int c[112345][4]; int main() { cin.sync_with_stdio(0); cin.tie(0); int n, a, b; cin >> n; for (int k = 1; k <= 3; k++) for (int i = 1; i <= n; i++) cin >> c[i][k]; for (int i = 0; i + 1 < n; i++) { cin >> a >> b; graph[a].push_back(b); graph[b].push_back(a); } int start; for (int i = 1; i <= n; i++) { if (graph[i].size() > 2) { cout << -1 << endl; return 0; } if (graph[i].size() == 1) start = i; } vector<int> pi = {1, 2, 3}; long long ans = infll; vector<int> best_color; vector<int> color(n + 1); do { long long tmp = 0; int cur = start; int prev = start; for (int i = 0; i < n; i++) { color[cur] = pi[i % 3]; tmp += c[cur][pi[i % 3]]; for (int j = 0; j < graph[cur].size(); j++) if (graph[cur][j] != prev) { prev = cur; cur = graph[cur][j]; break; } } if (tmp < ans) { ans = min(ans, tmp); best_color = color; } } while (next_permutation(pi.begin(), pi.end())); cout << ans << endl; for (int i = 1; i <= n; i++) cout << best_color[i] << ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 6) cout << -1 << endl; else { for (int i = 2; i <= 4; i++) cout << 1 << << i << endl; for (int i = 5; i <= n; i++) { cout << 2 << << i << endl; } } for (int i = 1; i < n; i++) { cout << i << << i + 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<vector<int>> adj; vector<vector<int>> vis; int dfs1(int a, int b) { if (a == n - 1 and b == m - 1) return 1; vis[a][b] = 1; if (a + 1 < n and adj[a + 1][b] and !vis[a + 1][b]) if (dfs1(a + 1, b)) return 1; if (b + 1 < m and adj[a][b + 1] and !vis[a][b + 1]) if (dfs1(a, b + 1)) return 1; vis[a][b] = 2; return 0; } int dfs2(int a, int b) { if (a == n - 1 and b == m - 1) return 1; vis[a][b] = 1; if (a + 1 < n and adj[a + 1][b] and vis[a + 1][b] != 1) if (dfs2(a + 1, b)) return 1; if (b + 1 < m and adj[a][b + 1] and vis[a][b + 1] != 1) if (dfs2(a, b + 1)) return 1; return 0; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; adj = vector<vector<int>>(n, vector<int>(m)); for (int i = 0; i < n; ++i) { string s; cin >> s; for (int j = 0; j < m; ++j) { if (s[j] == . ) adj[i][j] = 1; else adj[i][j] = 0; } } int a = 0; vis = vector<vector<int>>(n, vector<int>(m, 0)); a += dfs1(0, 0); a += dfs2(0, 0); cout << a << n ; } |
#include <bits/stdc++.h> long long cmpfunc(const void* a, const void* b) { return (*(long long*)a - *(long long*)b); } int main(void) { long long int test, i, j, n, count, flag = 0, o1 = 0, o2 = 0, b1, x, m, l, max, sum2, min, f, r, o, sum1, sum = 0, y, count1 = 0, a[1000000]; scanf( %lld , &n); count = 0; f = 0; for (i = 0; i < n; i++) { scanf( %lld , &x); if (a[x] == 0 && x != 0) { count++; a[x]++; } } printf( %lld n , count); return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a % b == 0) return b; return gcd(b, a % b); } int v[11]; int main() { int a, k = 0; scanf( %d , &a); for (int i = 2; i < a; i++) { int t = a; int pos = 0; while (t) { int mod = t % i; k += mod; t = (t - mod) / i; if (!t) break; } } int vbcd = gcd(k, a - 2); printf( %d/%d , k / vbcd, (a - 2) / vbcd); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x[100009], y[100009], sx, sy; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; sx += x[i]; sy += y[i]; } if (sx % 2 == 0 && sy % 2 == 0) { cout << 0; return 0; } for (int i = 1; i <= n; i++) { if ((sx - x[i] + y[i]) % 2 == 0 && (sy - y[i] + x[i]) % 2 == 0) { cout << 1; return 0; } } cout << -1; } |
#include <bits/stdc++.h> using namespace std; long long int min(long long int a, long long int b) { if (a < b) { return a; } else { return b; } } long long int max(long long int a, long long int b) { if (a > b) { return a; } else { return b; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t; cin >> t; while (t--) { long long int n; cin >> n; string str; cin >> str; if (n == 1) { cout << 1 << n ; continue; } if (n == 2) { if (str[0] == str[1]) { cout << 1 << n ; continue; } } vector<long long int> seg; long long int curr_length = 1; for (long long int i = 0; i < str.size() - 1; i++) { if (str[i] == str[i + 1]) { curr_length++; } else { seg.push_back(curr_length); curr_length = 1; } } seg.push_back(curr_length); long long int segtillnow = 0; long long int ans = 0; for (long long int i = 0; i < seg.size(); i++) { segtillnow++; if (seg[i] == 1) { continue; } else if (seg[i] > 1) { long long int operations = min(seg[i] - 1, segtillnow); ans += operations; segtillnow -= operations; } } ans += ((segtillnow + 1) / 2); cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string cad1; string cad2; cin >> cad1 >> cad2; if (cad1 == cad2) { cout << YES ; } else { if (cad1.size() != cad2.size()) { cout << NO ; } else { int ceros = 0; int unos = 0; for (int i = 0; i < cad2.size(); ++i) { if (cad2[i] == 0 ) ceros++; if (cad1[i] == 1 ) unos++; } if (ceros == cad2.size()) cout << NO ; else { if (unos > 0) cout << YES ; else cout << NO ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; char s[100000]; int n, m, x, y, i, sol, v[501][501]; int main() { cin >> n >> m >> x >> y; cin >> s; cout << 1 << ; int l = strlen(s); for (i = 0; i < l - 1; i++) { v[x][y] = 1; if (s[i] == R && y < m) y++; if (s[i] == L && y > 1) y--; if (s[i] == U && x > 1) x--; if (s[i] == D && x < n) x++; if (v[x][y] == 1) cout << 0 << ; else { cout << 1 << ; sol++; } } cout << n * m - sol - 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, cnt; char phone[128]; int main() { scanf( %d , &n); scanf( %s , phone); cnt = 0; for (int i = 0; i < n; i++) { if (cnt == 2 and n - i >= 2) { printf( - ); cnt = 0; } printf( %c , phone[i]); cnt++; } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long double a, b; int main() { cin >> a >> b; cout << fixed << a * pow((long double)1.000000011, b) << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<string> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } set<string> s; for (int i = n - 1; i >= 0; i--) { if (s.find(a[i]) == s.end()) { cout << a[i] << n ; } s.insert(a[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const long double EPS = 1e-10; const int dyx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}}; const int MAX_N = 400; int ans[181]; void init() { fill(ans, ans + 181, -1); for (int i = 3; i <= MAX_N; ++i) { double min_deg = 180.0 / i; for (int deg = 1; deg <= 180; ++deg) { if (ans[deg] != -1) continue; if (deg - floor(deg / min_deg + EPS) * min_deg < EPS && deg <= min_deg * double(i - 2)) ans[deg] = i; } } } int main() { init(); int t, deg; cin >> t; while (t--) { cin >> deg; cout << ans[deg] << n ; } } |
#include <bits/stdc++.h> using namespace std; long long ans; void solve(long long a, long long b, long long c, long long l) { for (long long i = 0; i <= l; i++) { long long x = min(a - b - c + i, l - i); if (x >= 0) ans -= (x + 1) * (x + 2) / 2LL; } } int main(void) { ios::sync_with_stdio(false); cin.tie(0); long long a, b, c, l; cin >> a >> b >> c >> l; ans = (l + 1) * (l + 2) * (l + 3) / 6LL; solve(a, b, c, l); solve(b, a, c, l); solve(c, a, b, l); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T m, T n) { while (n) { T t = m % n; m = n; n = t; }; return m; } template <typename T> T exgcd(T a, T b, T& sa, T& ta) { T q, r, sb = 0, tb = 1, sc, tc; sa = 1, ta = 0; if (b) do q = a / b, r = a - q * b, a = b, b = r, sc = sa - q * sb, sa = sb, sb = sc, tc = ta - q * tb, ta = tb, tb = tc; while (b); return a; } template <typename T> T mul_inv(T a, T b) { T t1 = a, t2 = b, t3; T v1 = 1, v2 = 0, v3; T x; while (t2 != 1) x = t1 / t2, t3 = t1 - x * t2, v3 = v1 - x * v2, t1 = t2, t2 = t3, v1 = v2, v2 = v3; return (v2 + b) % b; } template <typename T> T powmod(T a, T b, T MOD) { if (b < 0) return 0; T rv = 1; while (b) (b % 2) && (rv = (rv * a) % MOD), a = a * a % MOD, b /= 2; return rv; } const int maxn = 2e5 + 7; int n; int L; int a[maxn]; int b[maxn]; vector<int> to_remove[maxn]; vector<int> to_add[maxn]; int dist_tbl[maxn]; bool explored[maxn]; int dis(int x, int y) { return min(abs(x - y), L - abs(x - y)); } int calc(int k) { int& r = dist_tbl[k]; if (r >= 0) return r; r = 0; for (int i = 0; i < n; i++) r = max(r, dis(a[i], b[(i + k) % n])); return r; } int main(int argc, char* argv[]) { std::cin.sync_with_stdio(false); std::cin.tie(nullptr); cin >> n >> L; { clock_t time_start = clock(); clock_t time_end = time_start + CLOCKS_PER_SEC * 0.8; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; sort(a, a + n); sort(b, b + n); memset(dist_tbl, -1, sizeof(dist_tbl)); memset(explored, 0, sizeof(explored)); map<int, set<int> > values; for (int i = 0, ij = max(1, n / 64); i < n; i += ij) { values[calc(i)].insert(i); } int explore_values[] = {-4, -2, -1, 1, 2, 4, 0}; while (clock() < time_end && values.size() < n) { vector<int> toExplore; int nmin = 64; for (auto it : values) { if (it.second.empty()) --nmin; for (int k : it.second) { if (--nmin < 0) break; if (!explored[k]) { toExplore.push_back(k); explored[k] = true; } } if (nmin < 0) break; } if (toExplore.size() == 0) break; int new_explore = 0; for (int k : toExplore) { values[calc(k)].erase(k); for (int ei = 0; explore_values[ei]; ei++) { int k2 = (k + n + explore_values[ei]) % n; k2 = (k2 + n) % n; if (dist_tbl[k2] < 0) { new_explore++; values[calc(k2)].insert(k2); } } } if (!new_explore) break; } cout << values.begin()->first << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void fr() { freopen( test_input.txt , r , stdin); freopen( a.out , w , stdout); } const int N = 5e5 + 5; const int MAX = 5e6 + 123; const int INF = 2e9; const int mod = 1e9 + 7; const double pi = 3.1415926536; double eps = 1e-10; bool used1[N], used2[N]; void solve() { int n; string s1, s2; map<int, int> cnt1, cnt2; map<int, pair<int, int> > ans; cin >> s1 >> s2; cin >> n; for (int i = 1; i <= n; i++) { int t, m; char p, c; cin >> t >> p >> m >> c; if (p == h ) { if (c == y ) cnt1[m]++; else cnt1[m] += 2; if (cnt1[m] >= 2 and !used1[m]) { ans[t] = make_pair(0, m); used1[m] = 1; } } else { if (c == y ) cnt2[m]++; else cnt2[m] += 2; if (cnt2[m] >= 2 and !used2[m]) { ans[t] = make_pair(1, m); used2[m] = 1; } } } for (int i = 1; i <= 90; i++) { if (ans[i] != make_pair(0, 0)) { if (ans[i].first == 0) cout << s1 << ; else cout << s2 << ; cout << ans[i].second << << i << endl; } } } int t; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5010; int n, k; int a[N]; int dp[N][N / 2][2]; int solve(int r, int num, int sub) { if (num == 0) return 0; int& res = dp[r][num][sub]; if (res != 1000000000) return res; if (sub == 1) { res = solve(r - 2, num - 1, (a[r - 1] < a[r] ? 0 : 1)) + (a[r - 1] < a[r] ? 0 : (a[r - 1] - a[r] + 1)) + (a[r + 2] - 1 < a[r] ? 0 : (a[r + 2] - 1 - a[r] + 1)); if (num * 2 <= r) { res = min(res, solve(r - 1, num, 0)); } } else { res = solve(r - 2, num - 1, (a[r - 1] < a[r] ? 0 : 1)) + (a[r - 1] < a[r] ? 0 : (a[r - 1] - a[r] + 1)) + (a[r + 1] < a[r] ? 0 : (a[r + 1] - a[r] + 1)); if (num * 2 <= r) { res = min(solve(r - 1, num, 0), res); } } return res; } int main() { ios::sync_with_stdio(false); cin >> n; k = (n + 1) / 2; for (int i = 0; i < n; i++) { cin >> a[i + 1]; } a[0] = -100; a[n + 1] = -100; for (int i = 0; i < N; i++) { for (int j = 0; j < N / 2; j++) { for (int k = 0; k < 2; k++) { dp[i][j][k] = 1000000000; } } } cout << solve(n, 1, 0); for (int i = 2; i < k + 1; i++) { cout << << solve(n, i, 0); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, p, q1, q2, t, a[300010], y[300010], w, u; long long x[300010]; map<long long, int> f, g; vector<int> r[300010]; inline bool cmp(int a, int b) { return x[a] < x[b]; } inline int power(int a, int b, int q) { if (!b) return 1; int c = power(a, b >> 1, q); c = (long long)c * c % q; if (b & 1) c = (long long)c * a % q; return c; } inline long long ran() { return ((long long)rand() << 45) + ((long long)rand() << 30) + (rand() << 15) + rand(); } inline void dfs(int i) { int j; u--; g[x[i]] = ++w; for (j = 0; j < r[i].size(); j++) if (!g[x[r[i][j]]]) dfs(r[i][j]); } inline bool check(int p) { int i; for (i = 2; i * i <= p; i++) if (p % i == 0) return 0; return 1; } int main() { int i, j, k; srand(time(0)); ran(); ran(); ran(); for (q1 = ran() % 1000000000 + 100000000; !check(q1); q1++) ; for (q2 = ran() % 1000000000 + 100000000; !check(q2); q2++) ; for (p = ran() % 1000000 + 100000; !check(p); p++) ; for (t = ran() % 1000000 + 100000; !check(t); t++) ; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { x[i] = power(p, i ^ t, q1); y[i] = power(p, i ^ t, q2); } for (i = 1; i <= m; i++) { scanf( %d%d , &j, &k); x[j] = (x[j] + power(p, k ^ t, q1)) % q1; y[j] = (y[j] + power(p, k ^ t, q2)) % q2; x[k] = (x[k] + power(p, j ^ t, q1)) % q1; y[k] = (y[k] + power(p, j ^ t, q2)) % q2; r[j].push_back(k); r[k].push_back(j); } for (i = 1; i <= n; i++) { x[i] = x[i] * 2000000000 + y[i]; a[i] = i; } sort(a + 1, a + n + 1, cmp); for (i = 1; i <= n; i++) if (i == 1 || x[a[i]] != x[a[i - 1]]) { for (j = 0, k = 0; j < r[a[i]].size(); j++) if (x[r[a[i]][j]] != x[a[i]] && !g[x[r[a[i]][j]]]) { g[x[r[a[i]][j]]] = 1; k++; } g.clear(); f[x[a[i]]] = k; u++; } for (i = 1; i <= n; i++) if (f[x[i]] > 2) { u = 1; break; } else if (f[x[i]] <= 1 && !g[x[i]]) dfs(i); if (u) printf( NO n ); else { printf( YES n ); for (i = 1; i <= n; i++) printf( %d , g[x[i]]); } return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n, m; cin >> n >> m; int a[n]; for (__typeof((n)) i = (0); i < (n); i++) cin >> a[i]; int fq[m]; for (__typeof((m)) i = (0); i < (m); i++) fq[i] = 0; for (__typeof((n)) i = (0); i < (n); i++) { fq[a[i] % m]++; } int flg = 0; for (__typeof((m)) i = (0); i < (m); i++) { if (fq[i] >= 2) { flg = 1; break; } } if (flg == 1) cout << 0 << endl; else { int prd = 1; for (__typeof((n)) i = (0); i < (n); i++) { for (int j = i + 1; j < n; j++) prd = ((prd % m) * (abs(a[i] - a[j]) % m)) % m; } cout << prd << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n1, n2; cin >> n1 >> n2; int k, m; cin >> k >> m; long long a[n1], b[n2]; for (int i = 0; i < n1; i++) cin >> a[i]; for (int i = 0; i < n2; i++) cin >> b[i]; int count = 0; for (int i = 0; i < n1; i++) { if (a[i] >= b[n2 - m]) break; count++; if (count >= k) break; } if (count >= k && n2 >= m) cout << YES n ; else cout << NO n ; } |
#include <bits/stdc++.h> using namespace std; int n, m; int color[400100]; int w[400100]; struct segment_tree { long long a[1600100]; bool put[1600100]; void push(int x) { if (put[x]) { a[x * 2] = a[x * 2 + 1] = a[x]; put[x] = false; put[x * 2] = put[x * 2 + 1] = true; } } void calc(int x) { a[x] = a[x * 2] | a[x * 2 + 1]; } void build(int x, int l, int r) { if (l < r) { int y = (l + r) >> 1; build(x * 2, l, y); build(x * 2 + 1, y + 1, r); a[x] = a[x * 2] | a[x * 2 + 1]; put[x] = false; } else { a[x] = (1LL << color[w[l]]); put[x] = true; } } void modify(int x, int l, int r, int ll, int rr, long long v) { if (r < ll || l > rr) return; if (ll <= l && rr >= r) { a[x] = v; put[x] = true; return; } push(x); int y = (l + r) >> 1; modify(x * 2, l, y, ll, rr, v); modify(x * 2 + 1, y + 1, r, ll, rr, v); calc(x); } long long get(int x, int l, int r, int ll, int rr) { if (r < ll || l > rr) return 0LL; if (ll <= l && rr >= r) { return a[x]; } push(x); int y = (l + r) >> 1; long long ret = get(x * 2, l, y, ll, rr); ret |= get(x * 2 + 1, y + 1, r, ll, rr); calc(x); return ret; } } seg; vector<int> ga[400100]; int u, v; int din[400100], dout[400100]; int timer; void dfs(int u, int p) { timer++; din[u] = timer; w[timer] = u; for (int i = 0; i < ga[u].size(); i++) { int v = ga[u][i]; if (v != p) dfs(v, u); } dout[u] = timer; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> color[i]; for (int i = 1; i < n; i++) { cin >> u >> v; ga[u].push_back(v); ga[v].push_back(u); } dfs(1, -1); seg.build(1, 1, n); int tp, aa, bb; for (int i = 1; i <= m; i++) { cin >> tp; if (tp == 1) { cin >> aa >> bb; seg.modify(1, 1, n, din[aa], dout[aa], (1LL << bb)); } else { cin >> aa; cout << __builtin_popcountll(seg.get(1, 1, n, din[aa], dout[aa])) << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; string name[7]; int a, b, c, n, max_p, dexp, was[7]; bool p[7][7]; void perebor(int point, int num); int main() { name[0] = Anka ; name[1] = Chapay ; name[2] = Cleo ; name[3] = Troll ; name[4] = Dracul ; name[5] = Snowy ; name[6] = Hexadecimal ; cin >> n; for (int i = 0; i < n; i++) { int a, b; string name1, name2, s; cin >> name1 >> s >> name2; for (int j = 0; j < 7; j++) { if (name[j] == name1) a = j; if (name[j] == name2) b = j; } p[a][b] = true; } cin >> a >> b >> c; dexp = (int)1e9 * 2 + 1; max_p = -1; perebor(1, 0); cout << dexp << << max_p; return 0; } void perebor(int point, int num) { if (point == 4 && num != 7) return; if (num == 7) { int c_p = 0, t[4], ans; for (int i = 0; i < 4; i++) t[i] = 0; for (int i = 0; i < 7; i++) { t[was[i]]++; for (int j = 0; j < 7; j++) if (was[i] == was[j] && p[i][j] == true && i != j) c_p++; } if (!(t[1] && t[2] && t[3])) return; else { ans = max(ceil(a / t[1]), max(ceil(b / t[2]), ceil(c / t[3]))) - min(ceil(a / t[1]), min(ceil(b / t[2]), ceil(c / t[3]))); if (ans <= dexp) { if (ans < dexp) max_p = 0; dexp = ans; if (max_p < c_p) max_p = c_p; } } return; } for (int i = 0; i < 7; i++) if (was[i] == 0) { was[i] = point; perebor(point, num + 1); perebor(point + 1, num + 1); was[i] = 0; } return; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; double x, sum = 0; cin >> t; for (int i = 1; i <= t; i++) { cin >> x; sum += x; } cout << (sum / t) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 2e5 + 10; const int mod = 1e9 + 7; struct pairNode { char ch; long long times; pairNode(char ch = 0, long long times = 0) : ch(ch), times(times) {} ~pairNode() = default; bool operator==(const pairNode &rhs) const { return ch == rhs.ch && times == rhs.times; } bool operator!=(const pairNode &rhs) const { return ch != rhs.ch || times != rhs.times; } bool operator>=(const pairNode &rhs) const { return ch == rhs.ch && times >= rhs.times; } }; int tS, tT; vector<pairNode> S, T, newT; int nxt[M]; inline void getInput(vector<pairNode> &S, int len) { char cur = 0, ch[3]; long long curtimes = 0, times; for (int i = 0; i < len; ++i) { scanf( %I64d-%s , ×, ch); if (ch[0] == cur) { curtimes += times; } else { if (i) S.push_back(pairNode(cur, curtimes)); cur = ch[0]; curtimes = times; } } S.push_back(pairNode(cur, curtimes)); } int main() { S.clear(); T.clear(); cin >> tS >> tT; getInput(S, tS); getInput(T, tT); if (T.size() == 1) { long long ans = 0; for (int i = 0; i < S.size(); ++i) if (S[i] >= T[0]) ans += S[i].times - T[0].times + 1; cout << ans << endl; return 0; } if (T.size() == 2) { long long ans = 0; for (int i = 0; i < S.size() - 1; ++i) if (S[i] >= T[0] && S[i + 1] >= T[1]) ++ans; cout << ans << endl; return 0; } for (int i = 1; i < T.size() - 1; ++i) newT.push_back(T[i]); nxt[0] = -1; int k = -1; for (int i = 1; i < newT.size(); ++i) { while (k != -1 && newT[k + 1] != newT[i]) k = nxt[k]; if (newT[k + 1] == newT[i]) ++k; nxt[i] = k; } long long ans = 0; k = -1; for (int i = 0; i < S.size(); ++i) { while (k != -1 && newT[k + 1] != S[i]) k = nxt[k]; if (newT[k + 1] == S[i]) ++k; if (k == newT.size() - 1) { if (i >= newT.size() && i + 1 <= S.size() && S[i - newT.size()] >= T[0] && S[i + 1] >= T[T.size() - 1]) ++ans; k = nxt[k]; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #define ll long long int #define ii pair<int,int> #define int long long int using namespace std; const int inf = 0x3f3f3f3f; int32_t main() { int t; scanf( %lld ,&t); while(t--) { int n, m, x; scanf( %lld%lld%lld ,&n,&m,&x); --x; int c = (x/n); int r = (x%n); int ans = r*m+c; printf( %lld n ,ans+1); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, sum, k, ans, c; long long arr[1000000 + 5]; long long tmp[1000000 + 5]; vector<long long> frac; signed main() { cin >> n; for (long long i = 0; i < n; i++) { cin >> arr[i], sum += arr[i]; } ans = 1e18; for (long long i = 2; i <= sqrt(sum); i++) { if (sum % i == 0) frac.push_back(i), frac.push_back(sum / i); } frac.push_back(1); for (long long i : frac) { k = sum / i, c = 0; for (long long j = 0; j < n; j++) tmp[j] = 0; for (long long j = 0; j < n; j++) { tmp[j] += arr[j]; if (tmp[j] < 0) { c += -tmp[j]; tmp[j + 1] += tmp[j]; tmp[j] = 0; } if (tmp[j] % k != 0) { if (tmp[j] % k < k - tmp[j] % k) { c += tmp[j] % k; tmp[j + 1] += tmp[j] % k; } else { c += k - tmp[j] % k; tmp[j + 1] -= k - tmp[j] % k; } } } ans = min(ans, c); } if (sum > 1) cout << ans << n ; else cout << -1 << n ; } |
#include <bits/stdc++.h> using namespace std; long long m[10000005], x = 0, n, k, i, j, a; int main() { cin >> a >> n; for (i = 1; i < a + n; i++) { m[i] = i; } for (i = 2; i < 3400; i++) { k = 0; for (j = i * i; j <= a + n; j = j + i * i) { k++; m[j] = k; } } for (i = a; i < a + n; i++) x = x + m[i]; cout << x; } |
#include <bits/stdc++.h> using namespace std; long long big = 1000000007; long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long a, b; cin >> a >> b; int g = gcd(a, b); a /= g; b /= g; int ctr = 0; while (a % 2 == 0) { ctr += 1; a /= 2; } while (a % 3 == 0) { ctr += 1; a /= 3; } while (a % 5 == 0) { ctr += 1; a /= 5; } if (a != 1) { cout << -1 << n ; return 0; } while (b % 2 == 0) { ctr += 1; b /= 2; } while (b % 3 == 0) { ctr += 1; b /= 3; } while (b % 5 == 0) { ctr += 1; b /= 5; } if (b != 1) { cout << -1 << n ; return 0; } cout << ctr << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e5 + 10; struct Edge { int u, v, cost, idx; bool operator<(const Edge& rhs) const { return cost < rhs.cost; } } ed[MAX_N]; inline bool cmp_idx(const Edge& lhs, const Edge& rhs) { return lhs.idx < rhs.idx; } map<pair<int, int>, int> ID; int ver[MAX_N][19], maxCost[MAX_N][19], dep[MAX_N]; int par[MAX_N], _rank[MAX_N]; int n, m, ans[MAX_N]; bool inMST[MAX_N]; vector<pair<int, int> > g[MAX_N]; inline void init(int n) { for (int i = 1; i <= n; i++) { par[i] = i; _rank[i] = 0; } } int find(int x) { if (par[x] == x) return x; return par[x] = find(par[x]); } inline void unite(int x, int y) { x = find(x), y = find(y); if (x == y) return; if (_rank[x] < _rank[y]) { par[x] = y; } else { par[y] = x; if (_rank[x] == _rank[y]) _rank[x]++; } } inline bool same(int x, int y) { return find(x) == find(y); } void dfs(int u, int fa, int d) { dep[u] = d; for (pair<int, int>& e : g[u]) { int v = e.first, cost = e.second; if (v != fa) { ver[v][0] = u; maxCost[v][0] = cost; dfs(v, u, d + 1); } } } void initLca() { memset(ver, -1, sizeof ver); memset(maxCost, 0x8f, sizeof maxCost); dfs(1, -1, 1); for (int k = 1; k < 19; k++) { for (int v = 1; v <= n; v++) { if (ver[v][k - 1] != -1 && ver[ver[v][k - 1]][k - 1] != -1) { maxCost[v][k] = max(maxCost[v][k - 1], maxCost[ver[v][k - 1]][k - 1]); ver[v][k] = ver[ver[v][k - 1]][k - 1]; } } } } pair<int, int> find_lca(int u, int v) { if (dep[u] > dep[v]) swap(u, v); int res = -0x7fffffff; for (int k = 18; k >= 0; k--) { if (ver[v][k] != -1 && dep[ver[v][k]] >= dep[u]) { res = max(res, maxCost[v][k]); v = ver[v][k]; } } if (u == v) return pair<int, int>(res, v); for (int k = 18; k >= 0; k--) { if (ver[v][k] != ver[u][k]) { res = max(res, max(maxCost[v][k], maxCost[u][k])); v = ver[v][k]; u = ver[u][k]; } } res = max(res, max(maxCost[v][0], maxCost[u][0])); return pair<int, int>(res, ver[v][0]); } void modify(int u, int v, int w) { v = find(v); while (dep[u] < dep[v]) { int fa = ver[v][0], id = ID[pair<int, int>(fa, v)]; ans[id] = min(ans[id], w); par[v] = find(fa); v = find(v); } } int main() { int u, v, c; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d%d , &u, &v, &c); ed[i] = (Edge){u, v, c, i}; ID[pair<int, int>(u, v)] = i; ID[pair<int, int>(v, u)] = i; ans[i] = 0x7fffffff; } sort(ed, ed + m); init(n); for (int i = 0; i < m; i++) { Edge& e = ed[i]; if (!same(e.u, e.v)) { unite(e.u, e.v); g[e.u].push_back(pair<int, int>(e.v, e.cost)); g[e.v].push_back(pair<int, int>(e.u, e.cost)); inMST[i] = true; } } initLca(); init(n); for (int i = 0; i < m; i++) { if (inMST[i]) continue; Edge& e = ed[i]; pair<int, int> lca = find_lca(e.u, e.v); ans[e.idx] = min(ans[e.idx], lca.first - 1); modify(lca.second, e.u, e.cost - 1); modify(lca.second, e.v, e.cost - 1); } for (int i = 0; i < m; i++) { if (ans[i] == 0x7fffffff) ans[i] = -1; printf( %d , ans[i]); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = (long long)((1e5) + 100); long long cuberoot(long long x) { long long lo = 1, hi = min(2000000ll, x); while (hi - lo > 1) { long long mid = (lo + hi) / 2; if (mid * mid * mid < x) { lo = mid; } else hi = mid; } if (hi * hi * hi <= x) return hi; else return lo; } const long long dx[4] = {-1, 1, 0, 0}; const long long dy[4] = {0, 0, -1, 1}; long long XX[] = {-1, -1, -1, 0, 0, 1, 1, 1}; long long YY[] = {-1, 0, 1, -1, 1, -1, 0, 1}; const long long N = (long long)(1 * 1e6 + 10); bool comp(pair<long long, pair<long long, long long>> p1, pair<long long, pair<long long, long long>> p2) { if (p1.first > p2.first) return true; else if (p1.second == p2.second) { if (p1.second.first < p2.second.first) return true; } return false; } long long fact(long long n); long long ncr(long long n, long long r) { return fact(n) / (fact(r) * fact(n - r)); } long long fact(long long n) { long long res = 1; for (long long i = 2; i <= n; i++) res = res * i; return res % 1000000007; } const long long a = 1000000000; long long nCr(long long n, long long r) { long long fac1 = 1, fac2 = 1, fac; for (long long i = r; i >= 1; i--, n--) { fac1 = fac1 * n; if (fac1 % i == 0) fac1 = fac1 / i; else fac2 = fac2 * i; } fac = fac1 / fac2; return fac % a; } const long long m = 1000000007; long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } signed main() { long long n; cin >> n; long long arr[n + 1]; for (long long i = 0; i < n; i++) { cin >> arr[i]; } long long mx = 0; vector<long long> v; for (long long i = n - 1; i >= 0; i--) { if (i == n - 1) { v.push_back(0); mx = arr[i]; } else { long long ans = 0; if (mx >= arr[i]) ans = max(mx, arr[i]) - arr[i] + 1; else ans = max(mx, arr[i]) - arr[i]; v.push_back(ans); mx = max(mx, arr[i]); } } for (long long i = n - 1; i >= 0; i--) cout << v[i] << ; } |
#include <bits/stdc++.h> using namespace std; const int MN = 100000 + 1; int N; char buf[2000]; int main() { scanf( %d , &N); for (int i = 0; i < N; i++) { int a, b; scanf( %s%d%d , buf, &a, &b); if (a >= 2400 && b > a) { puts( YES ); return 0; } } puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1005], b[1005], c[1005], d[1005], posa[1005], posb[1005]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int q = 1; q <= n; q++) { int x; cin >> x; a[x] = q; } for (int q = 1; q <= n; q++) { int x; cin >> x; b[x] = q; } for (int q = 1; q <= n; q++) { c[q] = d[q] = posa[q] = posb[q] = q; } vector<array<int, 4>> v; for (int q = 1; q <= n; q++) { if (c[q] == a[q] && d[q] == b[q]) continue; v.push_back({q, posb[b[q]], posa[a[q]], q}); posb[d[q]] = posb[b[q]]; posa[c[q]] = posa[a[q]]; d[posb[d[q]]] = d[q]; c[posa[c[q]]] = c[q]; } cout << ((int)((v).size())) << n ; for (int q = 0; q < ((int)((v).size())); q++) { for (int w = 0; w < 4; w++) cout << v[q][w] << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int tree[4 * 200005]; void update(int n, int st, int en, int index, int val) { if (st == en) { tree[n] = val; return; } int mid = (st + en) / 2, lc = 2 * n, rc = lc + 1; if (index <= mid) update(lc, st, mid, index, val); else update(rc, mid + 1, en, index, val); tree[n] = max(tree[lc], tree[rc]); } int query(int n, int st, int en, int l, int r) { if (r < st || en < l) return 0; if (l <= st && en <= r) return tree[n]; int mid = (st + en) / 2, lc = 2 * n, rc = lc + 1; return max(query(lc, st, mid, l, r), query(rc, mid + 1, en, l, r)); } vector<int> pos[200005 + 5]; int main() { int n, inp; scanf( %d , &n); int mx = 0; for (int i = 1; i < n + 1; i++) { scanf( %d , &inp); pos[inp].push_back(i); } for (int num = 1; num < 200005; num++) { reverse(pos[num].begin(), pos[num].end()); for (auto position : pos[num]) { if (position < num) continue; int highestDeletePossible = position - num; int maxAns = query(1, 0, 200005, 0, highestDeletePossible) + 1; update(1, 0, 200005, highestDeletePossible, maxAns); } } cout << query(1, 0, 200005, 0, 200005) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXM = 111111; vector<int> v[MAXM]; int n, m, lim, x, lower, upper; inline bool check(int score) { for (int i = 1; i <= m; ++i) for (int j = score - 1; j < (int)v[i].size(); ++j) { int k = j - score + 1; if (v[i][j] - v[i][k] - lim <= score - 1) return true; } return false; } int main() { scanf( %d %d %d , &n, &m, &lim); for (int i = 0; i < n; ++i) { scanf( %d , &x); v[x].push_back(i); } lower = 0, upper = n; while (lower < upper) { int mid = (lower + upper + 1) / 2; if (check(mid)) lower = mid; else upper = mid - 1; } printf( %d n , lower); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 + 10, MAXL = 500 + 10; int n, S, in[MAXN], out[MAXN], w[MAXN], s[MAXN], v[MAXN]; int id[MAXN], h[MAXN][MAXN], g[MAXN][MAXN], f[MAXL][MAXN], Tohka; vector<int> l[MAXN]; bool cmp(int first, int second) { if ((out[first] - in[first]) != (out[second] - in[second])) return (out[first] - in[first]) < (out[second] - in[second]); return (s[first] + w[first]) < (s[second] + w[second]); } int main() { scanf( %d%d , &n, &S); for (int i = 1; i <= n; ++i) scanf( %d%d%d%d%d , &in[i], &out[i], &w[i], &s[i], &v[i]), ++in[i], id[i] = i; ++n; in[n] = 1, out[n] = n * 2 + 1, w[n] = 0, s[n] = S; id[n] = n; sort(id + 1, id + n + 1, cmp); for (int i = 1; i <= n; ++i) l[out[id[i]]].push_back(id[i]); for (int t = 1; t <= n; ++t) { int i = id[t], R = min(S - w[i], s[i]); for (int k = 0; k <= R; ++k) g[in[i] - 1][k] = 0; for (int j = in[i]; j <= out[i]; ++j) { for (int k = 0; k <= R; ++k) g[j][k] = g[j - 1][k]; vector<int> &L = l[j]; for (int p = 0; p < (int)L.size() && L[p] != i && in[L[p]] >= in[i]; ++p) for (int k = w[L[p]]; k <= R; ++k) g[j][k] = max(g[j][k], g[in[L[p]] - 1][k] + f[L[p]][k]); } for (int k = R; k >= 0; --k) f[i][k + w[i]] = g[out[i]][k] + v[i], Tohka = max(Tohka, f[i][k + w[i]]); for (int k = 0; k < w[i]; ++k) f[i][k] = 0; for (int k = 1; k <= S; ++k) f[i][k] = max(f[i][k], f[i][k - 1]); } cout << Tohka << endl; fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int long long n; cin >> n; if (n % 2 == 0) cout << 2; else cout << 1; return 0; } |
#include <bits/stdc++.h> using namespace std; struct flight { int d, f, t, c; flight() {} flight(int d, int f, int t, int c) : d(d), f(f), t(t), c(c) {} bool operator<(const flight& a) const { return d > a.d; } }; int n, m, k; priority_queue<flight> arr, dep; priority_queue<pair<int, int> > cheap[100010]; long long minarr[100010], arrcost, depcost; int main() { cin >> n >> m >> k; for (int i = 0; i < m; i++) { int d, f, t, c; cin >> d >> f >> t >> c; if (t == 0) { arr.push(flight(d, f, t, c)); } else { dep.push(flight(d, f, t, c)); cheap[t].push(make_pair(-c, d)); } } for (int i = 1; i <= n; i++) { if (cheap[i].empty()) { cout << -1 << n ; return 0; } depcost += -cheap[i].top().first; } memset(minarr, -1, sizeof(minarr)); int num = 0; long long ans = -1; while (!arr.empty()) { flight f = arr.top(); arr.pop(); int u = f.f; if (minarr[u] == -1) { num++; minarr[u] = f.c; arrcost += f.c; } else if (f.c < minarr[u]) { arrcost += f.c - minarr[u]; minarr[u] = f.c; } if (num < n) continue; bool done = 0; while (!dep.empty() && dep.top().d <= f.d + k) { flight df = dep.top(); dep.pop(); depcost -= -cheap[df.t].top().first; while (!cheap[df.t].empty() && cheap[df.t].top().second <= df.d) cheap[df.t].pop(); if (cheap[df.t].empty()) { done = 1; break; } depcost += -cheap[df.t].top().first; } if (done) break; if (ans == -1 || arrcost + depcost < ans) { ans = arrcost + depcost; } } cout << ans << n ; } |
#include <bits/stdc++.h> const int INF = (int)(1e9); const long long INFLL = (long long)(1e18); const double EPS = 1e-13; using namespace std; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; vector<int> b(n); for (int i = 0; i < n; i++) cin >> b[i]; vector<int> a; for (int i = 0; i < n; i++) if (b[i] == 0) a.push_back(i); for (int i = n - 1; i >= 0; i--) if (b[i] > 0) { int cnt = 0; int index = -1; for (int j = 0; j < a.size(); j++) { if (a[j] >= i + k) cnt++; if (cnt == b[i]) { index = j + 1; break; } } a.insert(a.begin() + index, i); } for (int i = 0; i < n; i++) cout << a[i] + 1 << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int in() { int x; scanf( %d , &x); return x; } const long double EPS = 1e-12; const int INF = 1e9 + 10; const long long LINF = 1000ll * 1000 * 1000 * 1000 * 1000 * 1000 + 100; const int MN = 1e5 + 10; vector<int> fir[MN], lst[MN]; int arr[MN]; int n, q, sz; pair<int, int> inv[MN]; bool lz[4 * MN]; int seg[4 * MN]; void input() { cin >> n >> q; for (int i = 0; i < n; ++i) cin >> arr[i]; sort(arr, arr + n); while (q--) { int l, r; cin >> l >> r; int L = lower_bound(arr, arr + n, l) - arr; int R = upper_bound(arr, arr + n, r) - arr; if (L >= R) continue; --R; if (L == R) continue; inv[sz++] = make_pair(L, R); lst[R].push_back(sz - 1), fir[L].push_back(sz - 1); } } void shift(int segnum, int left, int right) { if (lz[segnum] == false) return; int mid = (left + right) >> 1; lz[2 * segnum] = !lz[2 * segnum], lz[2 * segnum + 1] = !lz[2 * segnum + 1]; lz[segnum] = false; seg[2 * segnum] = (mid - left + 1) - seg[2 * segnum]; seg[2 * segnum + 1] = (right - mid) - seg[2 * segnum + 1]; } void upd(int segnum, int left, int right, int l, int r) { if (r < left || right < l) return; if (l <= left && right <= r) { lz[segnum] = !lz[segnum]; seg[segnum] = (right - left + 1) - seg[segnum]; return; } shift(segnum, left, right); int mid = (left + right) >> 1; upd(2 * segnum, left, mid, l, r); upd(2 * segnum + 1, mid + 1, right, l, r); seg[segnum] = seg[2 * segnum] + seg[2 * segnum + 1]; } int get(int segnum, int left, int right, int l, int r) { if (r < left || right < l) return 0; if (l <= left && right <= r) return seg[segnum]; shift(segnum, left, right); int mid = (left + right) >> 1; return get(2 * segnum, left, mid, l, r) + get(2 * segnum + 1, mid + 1, right, l, r); } void solve() { long long ans = 1ll * n * (n - 1) * (n - 2) / 6; for (int i = 0; i < n; ++i) { upd(1, 0, n - 1, i, n - 1); for (int j = 0; j < ((int)(fir[i]).size()); ++j) upd(1, 0, n - 1, inv[fir[i][j]].first, inv[fir[i][j]].second); if (i - 1 >= 0) { for (int j = 0; j < ((int)(lst[i - 1]).size()); ++j) upd(1, 0, n - 1, inv[lst[i - 1][j]].first, inv[lst[i - 1][j]].second); } int t = 0; if (i - 1 >= 0) t += get(1, 0, n - 1, 0, i - 1); if (i != n - 1) t += get(1, 0, n - 1, i + 1, n); upd(1, 0, n - 1, i, n - 1); long long val = 1ll * t * (t - 1) / 2; ans -= val; } cout << ans << n ; } int main() { ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0); input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long QuickPow(long long x, long long y) { long long Res = 1, Temp = x; while (y) { if (y & 1) Res = Res * Temp % 1000000007; Temp = Temp * Temp % 1000000007; y /= 2; } return Res; } inline void Swap(long long &x, long long &y) { long long Temp = x; x = y; y = Temp; } inline long long Max(long long x, long long y) { return x > y ? x : y; } inline long long Min(long long x, long long y) { return x < y ? x : y; } inline void read(long long &x) { x = 0; long long f = 1; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = (x << 3) + (x << 1) + (s ^ 48); s = getchar(); } x *= f; } struct node { long long v, Index; node() {} node(long long V, long long INDEX) { v = V; Index = INDEX; } }; set<long long> Ans, Bian[100005], Dian[100005]; set<long long>::iterator item; stack<long long> S; vector<node> G[100005]; bool InStack[100005]; long long Dfn[100005], Low[100005], Cnt, Col; void Tarjan(long long x, long long Pre) { Dfn[x] = Low[x] = ++Cnt; int l = G[x].size(); for (register long long i = 0; i < l; ++i) { long long to = G[x][i].v; if (to == Pre) continue; if (!Dfn[to]) { S.push(to); S.push(x); S.push(G[x][i].Index); Tarjan(to, x); Low[x] = Min(Low[x], Low[to]); if (Low[to] >= Dfn[x]) { Col++; long long u, v; do { Bian[Col].insert(S.top()); S.pop(); u = S.top(); S.pop(); v = S.top(); S.pop(); Dian[Col].insert(u); Dian[Col].insert(v); } while (u != x || v != to); } } else if (Dfn[to] < Dfn[x]) { S.push(to); S.push(x); S.push(G[x][i].Index); Low[x] = Min(Low[x], Dfn[to]); } } } int main() { long long n, m; read(n); read(m); for (register long long i = 1; i <= m; ++i) { long long u, v; read(u); read(v); G[u].push_back(node(v, i)); G[v].push_back(node(u, i)); } for (register long long i = 1; i <= n; ++i) if (!Dfn[i]) Tarjan(i, i); for (register long long i = 1; i <= Col; ++i) if (Bian[i].size() == Dian[i].size()) Ans.insert(Bian[i].begin(), Bian[i].end()); int l = Ans.size(); printf( %d n , l); for (item = Ans.begin(); item != Ans.end(); item++) printf( %lld , *item); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.