func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const int M = 1e6 + 6; const int inf = 0x3f3f3f3f; long long a[M], sum[M]; int main() { int t; scanf( %d , &t); while (t--) { int n, p, k; scanf( %d%d%d , &n, &p, &k); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; int ans = 0; for (int i = 0; i < k; i++) { long long now = sum[i]; int num = i; if (now > p) { num--; ans = max(ans, num); break; } for (int j = i + k; j <= n; j += k) { now += a[j]; num += k; if (now > p) { num -= k; break; } } ans = max(ans, num); } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; const string ALPHA = abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ; string NAME[3] = { Kuro , Shiro , Katie }; int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20); ll N; while (cin >> N) { vector<string> S(3); vll ma(3); for (int(a) = (0); (a) < (int)(3); ++(a)) { cin >> S[a]; for (char b : ALPHA) { ll x = 0; for (auto &(c) : (S[a])) { if (b == c) x++; } if (N > (int)(S[a]).size() - x) { ll p = N - (int)(S[a]).size() + x; if (p == 1 && x == (int)(S[a]).size()) (ma[a]) = max((ma[a]), ((int)(S[a]).size() - p)); else (ma[a]) = max((ma[a]), ((ll)(int)(S[a]).size())); } else { (ma[a]) = max((ma[a]), (N + x)); } } } ll m = -1, cnt = 0, cat = -1; for (int(a) = (0); (a) < (int)(3); ++(a)) { if (m < ma[a]) { cat = a; m = ma[a]; } } for (int(a) = (0); (a) < (int)(3); ++(a)) if (m == ma[a]) cnt++; if (cnt > 1) cout << Draw << endl; else cout << NAME[cat] << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, sum = 0; vector<long long> A; int n; cin >> n; A.resize(n); for (int i = 0; i < n; i++) { cin >> a; sum += a; A[i] = sum; } b = sum / 2 + (sum % 2); a = 0; while (A[a] < b) a++; cout << a + 1; } |
#include <bits/stdc++.h> int main() { int n, c = 0, i, s = 0, j, k = 0; scanf( %d , &n); for (i = 1; i <= n; i++) { for (j = 1; j <= i; j++) { s = s + j; if (s > n) { k = 1; break; } } c = c + 1; if (k == 1) { c--; break; } } printf( %d , c); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int awsl[maxn]; int main() { int n; scanf( %d , &n); string s; cin >> s; vector<int> sum(n); vector<int> m(n); for (int i = 0; i < n; ++i) { if (s[i] == ( ) awsl[i] = 1; else awsl[i] = -1; } sum[0] = awsl[0]; for (int i = 1; i < n; ++i) { sum[i] = sum[i - 1] + awsl[i]; } m.back() = sum.back(); for (int i = n - 2; i >= 0; i--) { m[i] = min(sum[i], m[i + 1]); } int cnt = 0; for (int i = 0; i < n; ++i) { int v = 2 * awsl[i]; if (m[i] - v >= 0 && sum.back() - v == 0) cnt++; if (sum[i] < 0) break; } cout << cnt << n ; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; int d[100005]; int pr[100005]; int cnt[100005]; int a[100005]; vector<int> g[100005]; int b[100005]; int main() { int n, i, j; scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %d , &a[i]); ++cnt[a[i]]; } for (i = 1; i <= n; ++i) { int x; scanf( %d , &x); d[a[i]] += x; g[a[i]].push_back(x); } for (i = 100000; i > 0; --i) { pr[i] = pr[i + 1] + d[i]; } int tot = 0; int ans = 1000000000; for (i = 1; i <= 100000; ++i) { if (cnt[i] == 0) continue; int cost = pr[i + 1]; int need = tot + cnt[i] - (cnt[i] * 2 - 1); for (j = 1; j <= 200; ++j) { if (need <= 0) break; if (need - b[j] >= 0) { need -= b[j]; cost += j * b[j]; } else { cost += need * j; need = 0; break; } } if (cost < ans) { ans = cost; } for (j = 0; j < g[i].size(); ++j) { ++b[g[i][j]]; } tot += cnt[i]; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int n, m, cnt, a[300002]; int32_t main() { ios_base ::sync_with_stdio(0); cin.tie(); cout.tie(); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n - 1; i++) if (a[i] <= a[i + 1]) cnt++; if (cnt == n - 1) return cout << 0, 0; int l = 0, r = m; while (r - l > 1) { int cur = 0, mid = (l + r) / 2; bool ctrl = true; for (int i = 1; i <= n && ctrl; i++) { int mn = m, mx = 0; if (a[i] + mid >= m) mn = 0; else mn = a[i]; if (a[i] + mid >= m - 1) mx = m - 1; else mx = a[i] + mid; if (mx < cur) { ctrl = false; } else if (a[i] > cur && mn == 0 && ((a[i] + mid) % m) < cur) cur = a[i]; else if (a[i] > cur && mn != 0) cur = a[i]; } if (ctrl) r = mid; else l = mid; } cout << r; } |
#include <bits/stdc++.h> using namespace std; long long inf = 1e18 + 42; const double eps = 1e-8; const int M = 1e9 + 7; const int MN = 1e9; int main() { vector<int> In; for (int i = 1; i <= 4; i++) { cout << ? << i << << i + 1 << endl; int x; cin >> x; In.push_back(x); } vector<int> v = {4, 8, 15, 16, 23, 42}; do { vector<int> res; for (int i = 1; i <= 4; i++) { res.push_back(v[i - 1] * v[i]); } if (res == In) { cout << ! ; for (int x : v) cout << x << ; cout << endl; return 0; } } while (next_permutation(v.begin(), v.end())); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t = 1; cin >> t; while (t--) { long long n, i, j; string s, a, b; cin >> n >> s; a = b = ; bool flag = true; ; a += 1 , b += 1 ; for (i = 1; i < n; i++) { if (s[i] == 0 ) { a += 0 , b += 0 ; } else if (s[i] == 1 ) { if (flag) { a += 1 ; b += 0 ; flag = false; } else { a += 0 ; b += 1 ; } } else if (s[i] == 2 ) { if (flag) { a += 1 , b += 1 ; } else { a += 0 , b += 2 ; } } } cout << a << n << b << n ; } return 0; } |
#include<bits/stdc++.h> #define rep(i,a,b) for(long long i=a;i<b;i++) #define pb push_back #define f first #define s second #define is insert #define vector_int vector<int> #define ll long long #define pqi priority_queue<int> #define all(x) x.begin(),x.end() #define mem(x,y) memset(x,y,sizeof(x)) #define sz(x) (int)x.size() #define pii pair<int,int> #define pll pair<ll,ll> #define INF 1e9 #define INFL 1e18 #define mod 1000000007 #define fast ios::sync_with_stdio(false);cin.tie(0); using namespace std; int equalPartition(int n, vector<int> arr) { int sum = 0; int i, j; // Calculate sum of all elements for (i = 0; i < n; i++) sum += arr[i]; if (sum % 2 != 0) return false; bool part[sum / 2 + 1][n + 1]; // initialize top row as true for (i = 0; i <= n; i++) part[0][i] = true; // initialize leftmost column, // except part[0][0], as 0 for (i = 1; i <= sum / 2; i++) part[i][0] = false; // Fill the partition table in bottom up manner for (i = 1; i <= sum / 2; i++) { for (j = 1; j <= n; j++) { part[i][j] = part[i][j - 1]; if (i >= arr[j - 1]) part[i][j] = part[i][j] || part[i - arr[j - 1]][j - 1]; } } /* // uncomment this part to print table for (i = 0; i <= sum/2; i++) { for (j = 0; j <= n; j++) cout<<part[i][j]; cout<<endl; } */ return part[sum / 2][n]; } void solve(){ ll n=0;cin>>n; vector<int> arr; for(int i=0;i<n;i++) { int x; cin>>x; arr.pb(x); } if(equalPartition( n,arr)==0) cout<<0<<endl; else { for(int i=0;i<n;i++){ int x=arr[i]; arr[i]=0; if(equalPartition(n,arr)==0) { cout<<1<<endl<<i+1<<endl; break; } else{ arr[i]=x; } } } } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int arr[2 * n], maxi[2 * n], c = 1; vector<long long int> v; for (int i = 0; i < 2 * n; i++) { cin >> arr[i]; if (!i) maxi[i] = arr[i]; else maxi[i] = max(maxi[i - 1], arr[i]); } for (int i = 1; i < 2 * n; i++) { if (maxi[i] != maxi[i - 1]) v.push_back(c), c = 1; else c++; } v.push_back(c); long long int dp[v.size()][n + 1]; for (int i = 0; i < v.size(); i++) { for (int j = 0; j <= n; j++) dp[i][j] = 0; } dp[0][v[0]] = 1; for (int i = 1; i < v.size(); i++) { for (int j = 0; j <= n; j++) dp[i][j] = dp[i - 1][j]; for (int j = v[i]; j <= n; j++) { if (dp[i - 1][j - v[i]]) dp[i][j] = 1; } } if (dp[v.size() - 1][n]) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct proc { string name; string var[10]; }; struct vari { string name; string x; }; string s, t, name, varr[10]; proc a[1005]; vari b[1005]; int res, n, m, k, para[1005], p; bool check; int main() { if (0) { freopen( a.inp , r , stdin); }; scanf( %d n , &n); size_t found; for (int i = 0; i < n; i++) { getline(cin, s); found = s.find( void ); s.erase(0, int(found) + 4); while (s[0] == ) s.erase(0, 1); for (int j = 0; j < s.length(); j++) { if (s[j] == || s[j] == ( ) break; a[i].name += s[j]; } t = ; found = s.find( ( ); for (int j = int(found) + 1; s[j] != ) ; j++) { if (s[j] == , || s[j] == ) continue; while (s[j] != , && s[j] != && s[j] != ) ) t += s[j], j++; para[i]++; a[i].var[para[i]] = t; t = ; if (s[j] == ) ) break; } } scanf( %d n , &m); for (int i = 0; i < m; i++) { getline(cin, s); int j = 0; t = ; while (s[j] == ) j++; while (s[j] != ) t += s[j], j++; b[i].x = t; t = ; while (s[j] == ) j++; while (j < s.length() && s[j] != ) t += s[j], j++; b[i].name = t; } scanf( %d n , &k); for (int i = 0; i < k; i++) { getline(cin, s); int j = 0; while (s[j] == ) j++; t = ; while (s[j] != && s[j] != ( ) t += s[j], j++; name = t; while (s[j] != ( ) j++; j++; t = ; p = 0; for (; s[j] != ) ; j++) { if (s[j] == || s[j] == , ) continue; while (s[j] != && s[j] != , && s[j] != ) ) t += s[j], j++; check = false; for (int x = 0; x < m; x++) if (b[x].name == t) { t = b[x].x; check = true; break; } if (!check) break; p++; varr[p] = t; t = ; if (s[j] == ) ) break; } if (!check) { printf( 0 n ); continue; } res = 0; for (int x = 0; x < n; x++) { if (para[x] != p || a[x].name != name) continue; check = true; for (int y = 1; y <= p; y++) { if (a[x].var[y][0] == T ) continue; if (a[x].var[y][0] != varr[y][0]) { check = false; break; } } if (check) res++; } printf( %d n , res); } } |
#include <bits/stdc++.h> using namespace std; int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1}; const int N = 1e2 + 5, M = (1 << 17) + 5, inf = 1e7; int a[N], dp[N][M], bit[N], n; bool ip(int i) { for (int it = 2; it * it <= i; it++) { if (i % it == 0) return false; } return true; } int rec(int idx, int mask) { int &res = dp[idx][mask]; if (idx == n) return res = 0; if (~res) return res; res = inf; for (long long i = (1); i <= (60); ++i) { if (bit[i] & mask) continue; res = min(res, rec(idx + 1, mask | bit[i]) + abs(a[idx] - (int)i)); } return res; } void print(int idx, int mask) { if (idx == n) return; for (long long i = (1); i <= (60); ++i) { if ((bit[i] & mask) == 0 && dp[idx][mask] == (dp[idx + 1][mask | bit[i]] + abs(a[idx] - i))) { cout << i << ; print(idx + 1, mask | bit[i]); break; } } } int main() { memset(dp, -1, sizeof dp); ; cin >> n; for (long long i = 0; i < n; i++) cin >> a[i]; int idx = 0; for (long long i = (2); i <= (60); ++i) { if (ip(i)) { for (int j = i; j <= 60; j += i) { bit[j] |= (1 << idx); } idx++; } } rec(0, 0); print(0, 0); } |
#include <bits/stdc++.h> using namespace std; mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count()); long long inf = 1e18, MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int ti = 1; while (ti--) { int n; cin >> n; vector<long long> in(n + 1), cnt(n + 1, 0); map<pair<long long, long long>, long long> ma; for (int i = 1; i <= n; i++) cin >> in[i]; long long ans = accumulate(in.begin(), in.end(), 0ll); int q; cin >> q; while (q--) { long long s, t, u; cin >> s >> t >> u; long long prev = ma[make_pair(s, t)]; if (prev != 0) { if (cnt[prev] <= in[prev]) ans++; cnt[prev]--; } if (u != 0) { if (cnt[u] < in[u]) ans--; cnt[u]++; } ma[make_pair(s, t)] = u; cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 100; int f[N]; struct node { int u, v, w; bool operator<(const node& a) const { return w < a.w; } }; struct qq { int id, u, v, w; bool operator<(const qq& a) const { if (a.w == w) return id < a.id; return w < a.w; } }; vector<pair<int, int> > v; qq q[N]; node pt[N]; bool vis[N]; int Find(int x, bool tmp) { if (tmp) v.push_back({x, f[x]}); return x == f[x] ? x : f[x] = Find(f[x], tmp); } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= m; i++) { scanf( %d %d %d , &pt[i].u, &pt[i].v, &pt[i].w); } int qs; cin >> qs; int tot = 0; for (int i = 1; i <= qs; i++) { int k; scanf( %d , &k); for (int j = 1; j <= k; j++) { q[tot].id = i; int now; scanf( %d , &now); q[tot].u = pt[now].u; q[tot].v = pt[now].v; q[tot].w = pt[now].w; tot++; } } sort(q, q + tot); sort(pt + 1, pt + 1 + m); int cnt = 0; for (int i = 1; i <= n; i++) f[i] = i; for (int i = 1; i <= m; i++) { while (cnt < tot && q[cnt].w == pt[i].w) { queue<qq> que; que.push(q[cnt]); int tmp = q[cnt].id; for (int j = cnt + 1; j <= tot; j++) { if (q[j].w == q[j - 1].w && q[j].id == q[j - 1].id) que.push(q[j]); else { cnt = j; break; } } bool res = true; while (!que.empty()) { qq now = que.front(); que.pop(); int f1 = Find(now.u, true); int f2 = Find(now.v, true); if (f1 == f2) { res = false; break; } f[f1] = f2; v.push_back({f1, f1}); } if (res == false) vis[tmp] = true; for (int i = v.size() - 1; i >= 0; i--) { f[v[i].first] = v[i].second; } v.clear(); } int f1 = Find(pt[i].u, false); int f2 = Find(pt[i].v, false); if (f1 == f2) continue; f[f1] = f2; } int cns = 0; for (int i = 1; i <= n; i++) if (Find(i, false) == i) cns++; if (cns >= 2) { for (int i = 1; i <= qs; i++) { puts( NO ); } } else { for (int i = 1; i <= qs; i++) { if (vis[i]) puts( NO ); else puts( YES ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1000005], n; long long ans = 0; long long now = 0; long long solve(long long p) { ans = 0; now = 0; for (int i = 1; i <= n; i++) { now += a[i]; now %= p; ans += min(now, p - now); } return ans; } int main() { cin >> n; long long sum = 0; for (int i = 1; i <= n; i++) { scanf( %d , a + i); sum = sum + a[i]; } if (sum == 1) { cout << -1 << endl; } else { long long ans0 = (1ll << 62); for (int p = 2; p <= 1e6; p++) { if (sum % p == 0) { ans0 = min(ans0, solve(p)); while (sum % p == 0) sum /= p; } } if (sum != 1) ans0 = min(ans0, solve(sum)); cout << ans0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf( %d %d , &n, &k); vector<long long int> v; vector<long long int>::iterator it; long long int a[k], i, j, c, t, x; for (i = 0; i < k; i++) scanf( %lld , &a[i]); for (i = 1; i <= n; i++) v.push_back(i); c = 0; for (i = 0; i < k; i++) { c = (c + a[i]) % (n); cout << v[c] << ; v.erase(v.begin() + c); n--; } return 0; } |
#include <bits/stdc++.h> using namespace std; int c[5005], dp[5005][5005][2]; int n; int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &c[i]); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) dp[i][j][0] = dp[i][j][1] = 0; else dp[i][j][0] = dp[i][j][1] = 0x3f3f3f3f; } } for (int len = 2; len <= n; len++) { for (int i = 1; i <= n; i++) { int j = len - 1 + i; if (j > n) break; dp[i][j][0] = min(dp[i][j][0], dp[i + 1][j][0] + (c[i] != c[i + 1])); dp[i][j][0] = min(dp[i][j][0], dp[i + 1][j][1] + (c[j] != c[i])); dp[i][j][1] = min(dp[i][j][1], dp[i][j - 1][0] + (c[i] != c[j])); dp[i][j][1] = min(dp[i][j][1], dp[i][j - 1][1] + (c[j - 1] != c[j])); } } cout << min(dp[1][n][0], dp[1][n][1]) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline string toString(T a) { ostringstream os( ); os << a; return os.str(); } template <typename T> inline long long toLong(T a) { long long res; istringstream os(a); os >> res; return res; } template <typename T> inline int toInt(T a) { int res; istringstream os(a); os >> res; return res; } template <typename T> inline double toDouble(T a) { double res; istringstream os(a); os >> res; return res; } template <typename T> inline T SQ(T a) { return a * a; } template <typename T> inline T GCD(T a, T b) { if (b == 0) return a; else return GCD(b, a % b); } template <typename T> inline T LCM(T a, T b) { long long res = a * b; res /= GCD(a, b); return res; } template <typename T> inline unsigned long long BIGMOD(T a, T b, T m) { if (b == 0) return 1; else if (b % 2 == 0) return SQ(BIGMOD(a, b / 2, m)) % m; else return (a % m * BIGMOD(a, b - 1, m)) % m; } template <typename T> inline vector<string> PARSE(T str) { vector<string> res; string s; istringstream os(str); while (os >> s) res.push_back(s); return res; } template <typename T> inline unsigned long long DIST(T A, T B) { unsigned long long res = (A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y); return res; } template <typename T> inline long long CROSS(T A, T B, T C) { return (B.x - A.x) * (C.y - A.y) - (C.x - A.x) * (B.y - A.y); } template <typename T> inline double cosAngle(T a, T b, T c) { double res = a * a + b * b - c * c; res = res / (2 * a * b); res = acos(res); return res; } template <typename T> inline T POWER(T base, int po) { T res = 1; if (base == 0) return 0; for (int i = (0); i < (po); i++) res *= base; return res; } template <typename T> inline bool IS_ON(T mask, T pos) { return mask & (1 << pos); } template <typename T> inline int OFF(T mask, T pos) { return mask ^ (1 << pos); } template <typename T> inline int ON(T mask, T pos) { return mask | (1 << pos); } template <typename T> inline bool INSIDE_GRID(int R, int C, int ro, int clm) { if (R >= 0 && C >= 0 && R < ro && C < clm) return 1; return 0; } template <typename T> inline void PRINT_GRID(T GRID, int ro, int clm) { cout << GRID << : << GRID << endl; for (int i = (0); i < (ro); i++) { for (int j = (0); j < (clm); j++) cout << GRID[i][j] << ; puts( ); } } long long arr[500005]; vector<pair<long long, int> > inp; int main() { ios_base::sync_with_stdio(0); cin.tie(); ; int n; cin >> n; for (int i = (0); i < (n); i++) { cin >> arr[i]; inp.push_back(make_pair(arr[i], i)); } sort((inp).begin(), (inp).end()); long long hell = 0; for (int i = (0); i < (n); i++) { hell = max(inp[i].first, hell + 1); arr[inp[i].second] = hell; } for (int i = (0); i < (n); i++) cout << arr[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> u, v; int n, ans = 0; long long a, b, c, p, q; scanf( %d%d%d%d , &u.first, &u.second, &v.first, &v.second); scanf( %d , &n); while (n--) { scanf( %lld%lld%lld , &a, &b, &c); p = a * u.first + b * u.second + c; q = a * v.first + b * v.second + c; if ((p > 0 && q < 0) || (p < 0 && q > 0)) ++ans; } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i; cin >> n; long long int a[n], p, b[100000], sum = 0, r = 0, c[n]; for (i = 0; i < n; i = i + 1) { cin >> a[i]; p = a[i]; b[p] = 0; c[i] = 1; } for (i = 0; i < n; i = i + 1) { p = a[i]; b[p] = b[p] + 1; if (b[p] > 1) { c[i] = 0; } else { r = r + 1; } } for (i = 0; i < n; i = i + 1) { p = a[i]; if (c[i] != 0) { p = a[i]; if (b[p] > 1) { sum = sum + r; b[p] = b[p] - 1; } else if (b[p] > 0) { r = r - 1; sum = sum + r; b[p] = b[p] - 1; } } else { b[p] = b[p] - 1; if (b[p] == 0) { r = r - 1; } } } printf( %lld n , sum); } |
#include <bits/stdc++.h> using namespace std; int dp, p[201000], tt[201000], pre[201000], l[201000], vis[201000]; int n, m, i, j, a[1010][1010], g[201000], now[201000], s, t, dis[201000], z[201000], ans; void link(int x, int y, int z) { dp++; pre[dp] = p[x]; p[x] = dp; tt[dp] = y; g[dp] = z; } int dfs(int x) { int i; i = p[x]; while (i) { if (vis[tt[i]] == 0) { vis[tt[i]] = 1; if ((l[tt[i]] == 0) || (dfs(l[tt[i]]))) { l[tt[i]] = x; return 1; } } i = pre[i]; } return 0; } int bfs() { int i, head, tail; memcpy(now, p, sizeof(p)); memset(vis, 0, sizeof(vis)); head = 0; tail = 1; vis[s] = 1; dis[s] = 0; z[tail] = s; do { head++; i = p[z[head]]; while (i) { if ((vis[tt[i]] == 0) && (g[i] > 0)) { vis[tt[i]] = 1; dis[tt[i]] = dis[z[head]] + 1; tail++; z[tail] = tt[i]; } i = pre[i]; } } while (head != tail); return vis[t]; } int dfs(int u, int flow) { int ans, tmp, i; if (u == t) return flow; i = now[u]; ans = 0; while (i) { if ((dis[u] + 1 == dis[tt[i]]) && (g[i] > 0)) { tmp = dfs(tt[i], min(flow - ans, g[i])); ans += tmp; g[i] -= tmp; if (i % 2 == 1) g[i + 1] += tmp; else g[i - 1] += tmp; if (flow == ans) return flow; } i = pre[i]; now[u] = i; } if (flow > ans) dis[u] = 1; return ans; } int main() { cin >> n; for (i = 1; i <= n; i++) { cin >> a[i][0]; for (j = 1; j <= a[i][0]; j++) { cin >> a[i][j]; link(n + i, a[i][j], 0); } } for (i = n + 1; i <= 2 * n; i++) { memset(vis, 0, sizeof(vis)); dfs(i); } dp = 0; memset(p, 0, sizeof(p)); s = 0; t = n + 1; for (i = 1; i <= n; i++) { cin >> m; if (m > 0) { link(s, i, m); link(i, s, 0); } else { ans += m; link(i, t, -m); link(t, i, 0); } } for (i = 1; i <= n; i++) { for (j = 1; j <= a[i][0]; j++) if (l[a[i][j]] - n != i) { link(l[a[i][j]] - n, i, 0x37373737); link(i, l[a[i][j]] - n, 0); } } while (bfs()) ans += dfs(s, 0x37373737); cout << ans; } |
#include <bits/stdc++.h> using namespace std; int n; string s; bool ok1 = 1, ok2 = 1; int a[220], b[220], l[110], r[110]; void qs(int u[], int L, int R) { int i = L; int j = R; int m = u[(L + R) >> 1]; while (i < j) { while (u[i] < m) i++; while (u[j] > m) j--; if (i <= j) { swap(u[i], u[j]); i++; j--; } } if (L < j) qs(u, L, j); if (i < R) qs(u, i, R); } int main() { cin >> n; cin >> s; for (size_t i = 0; (int)i < s.size(); ++i) a[i] = s[i] - 0 ; for (int i = 0; i < n; i++) { l[i] = a[i]; } for (int i = 0; i < n; i++) { r[i] = a[i + n]; } qs(r, 0, n - 1); qs(l, 0, n - 1); for (size_t i = 0; (int)i < n; ++i) { if (!(l[i] > r[i])) { ok1 = 0; } if (!(l[i] < r[i])) { ok2 = 0; } } if (ok1 || ok2) { printf( YES ); return 0; } printf( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int arr[1000008]; int l[1000008]; int mx[1000008 << 2], lazy[1000008 << 2]; void pushup(int rt) { mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]); } void build(int rt, int l, int r) { if (l > r) return; if (l == r) { mx[l] = arr[l]; return; } int mid = (l + r) >> 1; build(rt << 1, l, mid); build(rt << 1 | 1, mid + 1, r); pushup(rt); } void pushdown(int rt) { mx[rt << 1] += lazy[rt]; mx[rt << 1 | 1] += lazy[rt]; lazy[rt << 1] += lazy[rt]; lazy[rt << 1 | 1] += lazy[rt]; lazy[rt] = 0; } void update(int rt, int l, int r, int L, int R, int C) { if (L <= l && r <= R) { lazy[rt] += C; mx[rt] += C; return; } pushdown(rt); int mid = (l + r) >> 1; if (L <= mid) update(rt << 1, l, mid, L, R, C); if (mid < R) update(rt << 1 | 1, mid + 1, r, L, R, C); pushup(rt); } int query(int rt, int l, int r, int L, int R) { if (L <= l && r <= R) return mx[rt]; int mid = (l + r) >> 1; pushdown(rt); int ret = -1; if (L <= mid) ret = max(ret, query(rt << 1, l, mid, L, R)); if (mid < R) ret = max(ret, query(rt << 1 | 1, mid + 1, r, L, R)); return ret; } stack<int> sta; int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; ++i) scanf( %d , &arr[i]); for (int i = n; i >= 1; --i) { while (!sta.empty() && arr[sta.top()] <= arr[i]) { l[sta.top()] = i + 1; sta.pop(); } sta.push(i); } while (!sta.empty()) { l[sta.top()] = 1; sta.pop(); } for (int i = 1; i <= n; ++i) { update(1, 1, n, l[i], i, 1); if (i >= k) { printf( %d , query(1, 1, n, i - k + 1, i)); update(1, 1, n, l[i - k + 1], i - k + 1, -1); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int c[100005], n, m; map<int, int> f; int lowbit(int x) { return x & (-x); } void add(int x, int j) { while (x < 100005) { c[x] += j; x += lowbit(x); } } int sum(int x) { int s = 0; while (x > 0) { s += c[x]; x -= lowbit(x); } return s; } struct node { int id; int num; } a[100005]; bool cmp_id(node A, node B) { return A.id < B.id; } bool cmp_num(node A, node B) { return A.num < B.num; } int main() { int i, j, k, m, cnt, ans, tem; while (scanf( %d , &n) != EOF) { f.clear(); cnt = 1; ans = 0; for (i = 1; i <= n; i++) { scanf( %d , &a[i].num); a[i].id = i; } sort(a + 1, a + 1 + n, cmp_num); for (i = 1; i <= n; i++) if (f[a[i].num] == 0) f[a[i].num] = cnt++; sort(a + 1, a + 1 + n, cmp_id); for (i = 1; i <= n; i++) a[i].num = f[a[i].num]; for (i = 1; i <= n; i++) add(a[i].num, 1); for (i = n; i >= 1; i--) { tem = sum(a[i].num); add(a[i].num, -1); if (tem == i) ans++; else { int ant = a[i].num; while (i--) { ant = min(a[i].num, ant); int tp = sum(ant); add(a[i].num, -1); if (sum(ant) == i - 1) break; } ans++; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n, q; cin >> n >> q; deque<int> deq; for (int i = 0; i < n; i++) { int a; cin >> a; deq.push_back(a); } vector<pair<int, int>> ans; for (int i = 0; i < 2 * n + 7; i++) { int a = deq.front(); deq.pop_front(); int b = deq.front(); deq.pop_front(); ans.push_back(make_pair(a, b)); if (b > a) { swap(b, a); } deq.push_front(a); deq.push_back(b); } while (q--) { long long int x; cin >> x; x--; if (x < 2 * n) { cout << ans[x].first << << ans[x].second << endl; } else { x -= n; x %= (n - 1); x += n; cout << ans[x].first << << ans[x].second << endl; } } } |
#include <bits/stdc++.h> using namespace std; struct BIT { int N; vector<int> B; BIT(int n = 0) { N = n; B.resize(n + 2, 0); } void add(int x, int v) { x++; while (x <= N) { B[x] += v; x += x & -x; } } int sum(int x) { int s = 0; x++; while (x > 0) { s += B[x]; x -= x & -x; } return s; } int sum(int a, int b) { return sum(b) - sum(a - 1); } }; int main() { int h, m, n; scanf( %d%d%d , &h, &m, &n); long long sol = 0; map<int, pair<int, int> > pos; vector<BIT> X; vector<bool> visited(h, false); vector<int> ai(h), bi(h); for (int i = 0; i < h; ++i) { if (!visited[i]) { int cnt = 0; for (int j = i; !visited[j]; j = (j + m) % h) { visited[j] = true; ai[j] = X.size(); bi[j] = cnt; cnt++; } X.push_back(BIT(cnt)); } } for (int i = 0; i < n; ++i) { char op[8]; scanf( %s , op); int id, hs; if (op[0] == - ) { scanf( %d , &id); X[pos[id].first].add(pos[id].second, -1); } else { scanf( %d%d , &id, &hs); int xi = ai[hs], ti = bi[hs]; assert(X[xi].sum(0, X[xi].N - 1) < X[xi].N); if (X[xi].sum(ti, X[xi].N - 1) == X[xi].N - ti) { int lo = -1, hi = ti - 1; sol += X[xi].N - ti; while (hi - lo > 1) { int mid = (hi + lo) / 2; if (X[xi].sum(0, mid) == mid + 1) lo = mid; else hi = mid; } sol += hi; X[xi].add(hi, 1); pos[id] = make_pair(xi, hi); } else { int lo = ti - 1, hi = X[xi].N - 1; while (hi - lo > 1) { int mid = (hi + lo) / 2; if (X[xi].sum(ti, mid) == mid - ti + 1) lo = mid; else hi = mid; } sol += hi - ti; X[xi].add(hi, 1); pos[id] = make_pair(xi, hi); } } } printf( %I64d n , sol); return 0; } |
#include <bits/stdc++.h> using namespace std; int const N = 70; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; char s[N][N]; int vis[N][N]; int n, m; int dfs(int x, int y) { if (s[x][y] != # || vis[x][y]) return 0; vis[x][y] = 1; for (int i = 0; i < (4); i++) dfs(x + dx[i], y + dy[i]); return 1; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < (n); i++) scanf( %s , s[i]); int cnt = 0; for (int i = 0; i < (n); i++) for (int j = 0; j < (m); j++) { if (s[i][j] == . ) continue; cnt++; s[i][j] = . ; int k = 0; memset(vis, 0, sizeof(vis)); for (int d = 0; d < (4); d++) k += dfs(i + dx[d], j + dy[d]); if (k > 1) { puts( 1 ); return 0; } s[i][j] = # ; } printf( %d n , cnt > 2 ? 2 : -1); } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const long long mod = 1e6 + 3; const int INF = 1e9 + 1; const int N = 105; long long H[N], c, h, w; struct Matrix { long long arr[N][N]; Matrix() { memset(arr, 0, sizeof arr); } Matrix(int x) { memset(arr, 0, sizeof arr); for (int i = 0; i < w + 1; i++) arr[i][i] = x; } Matrix operator*(Matrix a) { Matrix ret; for (int i = 0; i < w + 1; i++) { for (int j = 0; j < w + 1; j++) { for (int k = 0; k < w + 1; k++) { ret.arr[i][j] += this->arr[i][k] * a.arr[k][j]; ret.arr[i][j] %= mod; } } } return ret; } }; Matrix poww(Matrix a, int p) { if (!p) return Matrix(1); Matrix ret = poww(a, p >> 1); ret = ret * ret; if (p & 1) ret = ret * a; return ret; } void print(Matrix a) { for (int i = 0; i < w + 1; i++) { for (int j = 0; j < w + 1; j++) { cout << a.arr[i][j] << ; } cout << n ; } cout << n ; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); H[0] = 1; cin >> c >> w >> h; for (int i = 1; i < N; i++) H[i] = (H[i - 1] * h) % mod; Matrix A = Matrix(), B = Matrix(); for (int i = 0; i < w + 1; i++) { B.arr[i][0] = H[i]; } for (int i = 0; i < w; i++) { B.arr[i][i + 1] = 1; } A.arr[0][0] = A.arr[0][1] = 1; B = poww(B, c + 1); cout << B.arr[0][0]; } |
#include <bits/stdc++.h> using namespace std; template <class T1> void deb(T1 e) { cout << e << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e2 << << e3 << endl; } template <class T1, class T2, class T3, class T4> void deb(T1 e1, T2 e2, T3 e3, T4 e4) { cout << e1 << << e2 << << e3 << << e4 << endl; } template <class T1, class T2, class T3, class T4, class T5> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; } template <class T1, class T2, class T3, class T4, class T5, class T6> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 << endl; } long long sqr(long long n) { return n * n; } double LOG(long long a, long long b) { return (log(a) / log(b)); } long long GCD(long long a, long long b) { if (a < 0) return GCD(-a, b); if (b < 0) return GCD(a, -b); return (!b) ? a : GCD(b, a % b); } long long LCM(long long a, long long b) { if (a < 0) return LCM(-a, b); if (b < 0) return LCM(a, -b); return (a * (b / GCD(a, b))); } long long BigMod(long long B, long long P, long long M) { if (!P) return 1; if (!(P % 2)) return sqr(BigMod(B, P / 2, M)) % M; return (B % M) * (BigMod(B, P - 1, M)) % M; } int par[205]; int dp[105][105][105]; string s1, s2, vir; string ans; int rec(int x, int y, int z) { if (z == (int)vir.size()) return -(1 << 30); if (x == (int)s1.size() || y == (int)s2.size()) return 0; int &ret = dp[x][y][z]; if (ret != -1) return ret; ret = rec(x + 1, y, z); ret = max(ret, rec(x, y + 1, z)); if (s1[x] == s2[y]) { int k = z; while (k > 0 && s1[x] != vir[k]) k = par[k - 1]; if (s1[x] == vir[k]) k++; ret = max(ret, rec(x + 1, y + 1, k) + 1); } return ret; } void prec(int x, int y, int z) { if (z == (int)vir.size()) return; if (x == (int)s1.size() || y == (int)s2.size()) return; int &ret = dp[x][y][z]; if (ret == rec(x + 1, y, z)) return prec(x + 1, y, z); if (ret == rec(x, y + 1, z)) return prec(x, y + 1, z); if (s1[x] == s2[y]) { int k = z; while (k > 0 && s1[x] != vir[k]) k = par[k - 1]; if (s1[x] == vir[k]) k++; if (ret == rec(x + 1, y + 1, k) + 1) { ans += s1[x]; return prec(x + 1, y + 1, k); } } return; } int main(void) { cin >> s1 >> s2 >> vir; memset(par, 0, sizeof(par)); int k = 0; string cur = vir; for (int i = 1; i < (int)cur.size(); i++) { while (k > 0 && cur[i] != cur[k]) k = par[k - 1]; if (cur[i] == cur[k]) k++; par[i] = k; } memset(dp, -1, sizeof(dp)); int res = rec(0, 0, 0); if (!res) { deb(res); return 0; } ans = ; prec(0, 0, 0); deb(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; int child[N], w[N]; long long dp[N][35][3], ans[N][2]; void pre(int n) { for (int i = 0; i < n; i++) { dp[i][0][0] = w[i]; dp[i][0][2] = w[i]; dp[i][0][1] = child[i]; } for (int j = 1; j < 35; j++) { for (int i = 0; i < n; i++) { dp[i][j][1] = dp[dp[i][j - 1][1]][j - 1][1]; dp[i][j][0] = dp[i][j - 1][0] + dp[dp[i][j - 1][1]][j - 1][0]; dp[i][j][2] = min(dp[i][j - 1][2], dp[dp[i][j - 1][1]][j - 1][2]); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; long long k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> child[i]; for (int i = 0; i < n; i++) cin >> w[i]; pre(n); int pt; for (int i = 0; i < n; i++) { pt = i; ans[i][1] = 1000000007ULL; for (long long j = 0; (1LL << j) <= k; j++) { if ((1LL << j) & k) { ans[i][0] += dp[pt][j][0]; ans[i][1] = min(ans[i][1], dp[pt][j][2]); pt = dp[pt][j][1]; } } } for (int i = 0; i < n; i++) cout << ans[i][0] << << ans[i][1] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int is_prime[5000010 + 10], primes[5000010 + 10], firstp[5000010 + 10], prime_cnt; void get_primes() { memset(is_prime, -1, sizeof(is_prime)); for (int i = 2; i <= 5000010; i++) { if (is_prime[i]) { primes[prime_cnt++] = i; firstp[i] = i; } for (int j = 0; j < prime_cnt && primes[j] * i <= 5000010; j++) { firstp[i * primes[j]] = primes[j]; is_prime[i * primes[j]] = 0; if (i % primes[j] == 0) break; } } } long long bin[5000010], f[5000010], t, l, r; int main() { get_primes(); scanf( %I64d %I64d %I64d , &t, &l, &r); long long ans = 0, pre = 1; for (int i = 2; i < (5000001); i++) f[i] = (f[i / firstp[i]] + (1LL * i * (firstp[i] - 1)) / 2 % 1000000007) % 1000000007; for (int i = l; i < (r + 1); i++) { ans = (ans + pre * f[i] % 1000000007) % 1000000007; pre = pre * t % 1000000007; } printf( %I64d n , ans); } |
#include <bits/stdc++.h> int main() { int a; scanf( %d , &a); if (a == 5) printf( 1 n ); else printf( %d n , a % 3 + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); cout.tie(NULL); ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { string s; cin >> s; int ans = 0; int one; bool turn = true; while (s.size() != 0) { one = 0; vector<pair<int, int>> len; bool go = false; int start; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { if (!go) { start = i; go = true; } if (i == s.size() - 1) { len.push_back({start, i}); } one++; } else { if (go) { len.push_back({start, i - 1}); go = false; } } } if (!one) { cout << 0 n ; break; } int length = len[0].second - len[0].first; pair<int, int> se = {len[0].first, len[0].second}; for (int i = 1; i < len.size(); i++) { if (length < len[i].second - len[i].first) { length = len[i].second - len[i].first; se = {len[i].first, len[i].second}; } } if (turn) ans += length + 1; s.erase(se.first, length + 1); if (one - (length + 1) == 0) { cout << ans << n ; break; } if (turn) turn = false; else turn = true; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; if (a > b || (b - a) % 2) { cout << -1; return 0; } if (a == b) { if (a == 0) cout << 0; else cout << 1 << n << a; } else if (((a + (b - a) / 2) ^ ((b - a) / 2)) == a) { cout << 2 << n << a + (b - a) / 2 << << (b - a) / 2; } else cout << 3 << endl << a << << (b - a) / 2 << << (b - a) / 2; } |
#include <bits/stdc++.h> using namespace std; int arr[100000]; int main() { int n, i, mi = 1e9 + 1, ans, last; cin >> n, ans = n; for (i = 0; i < n; i++) cin >> arr[i], mi = min(mi, arr[i]); for (last = 0; arr[last] != mi; last++) ; for (i = last + 1; i < n; i++) if (arr[i] == mi) ans = min(i - last, ans), last = i; cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int stak1[200010], tot1, stak0[200010], tot0; int pre[200010], nex[200010]; char s[200010]; int a[200010]; int n, ans; int stak_ans[200010], tot_ans; int main() { int i, j, k; scanf( %s , s); n = strlen(s); for (i = 0; i < n; i++) a[i + 1] = s[i] == 1 ? 1 : 0; for (i = 1; i <= n; i++) if (a[i]) { if (!tot0) { printf( -1 n ); return 0; } nex[stak0[tot0]] = i; pre[i] = stak0[tot0]; tot0--; stak1[++tot1] = i; } else { if (tot1) { nex[stak1[tot1]] = i; pre[i] = stak1[tot1]; tot1--; } stak0[++tot0] = i; } if (tot1) { printf( -1 n ); return 0; } for (i = 1; i <= n; i++) if (!pre[i]) ans++; printf( %d n , ans); for (i = 1; i <= n; i++) if (!pre[i]) { j = i, tot_ans = 0; while (j) { stak_ans[++tot_ans] = j; j = nex[j]; } printf( %d , tot_ans); for (j = 1; j <= tot_ans; j++) printf( %d , stak_ans[j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool isprime(long long n) { if (n == 2) return true; if (n < 2 || n % 2 == 0) return false; for (long long i = 3; i * i <= n; i += 2) { if (n % i == 0) return false; } return true; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; int n; cin >> n; if (isprime(n)) cout << 1 << endl; else if (n % 2 == 0) cout << 2 << endl; else if (isprime(n - 2)) cout << 2 << endl; else cout << 3 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x, i; int reachable[1000000]; int need_to_convert[1000000]; int main(int argc, char **argv) { scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %d , &x); int trans_op_num = 0; while (x) { ++reachable[x]; need_to_convert[x] += trans_op_num; ++trans_op_num; x >>= 1; } } for (i = 1e5; i > 1 && reachable[i] != n; --i) ; x = need_to_convert[i]; while (true) { int y = reachable[i + i]; if (n > y + y) break; i = i + i; x = x - y + n - y; } printf( %d n , x); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x = 0, y = 0, z = 0; for (int i = 0; i < n; i++) { int a, b, c; cin >> a >> b >> c; x += a; y += b; c += z; } if (!x && !y && !z) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 1e18; const int inf = 1e9; const int MOD = 1e9 + 7; const int nax = 1000000 + 10; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, s; cin >> n >> s; int a, b, c, d; cin >> a >> b; if (a * 60 + b >= s + 1) { cout << 0 << << 0; return 0; } for (int i = 1; i < n; i++) { cin >> c >> d; if (a == c) { int m = d - b; if (m >= 2 * s + 2) { int k = b + s + 1; int j = k / 60; int f = k % 60; cout << a + j << << f; return 0; } } else { int m = c - a - 1; m *= 60; m += 60 - b; m += d; if (m >= 2 * s + 2) { int k = b + s + 1; int j = k / 60; int f = k % 60; cout << a + j << << f; return 0; } } a = c, b = d; } int k = b + s + 1; int j = k / 60; int f = k % 60; cout << a + j << << f; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int ff[15][40000][15]; int maskk[15]; bool ok[15][40000][15]; int need[15], n; vector<int> forbit[15]; long long int f(int x, int mask, int pre) { if (ok[x][mask][pre]++) return ff[x][mask][pre]; long long int &ans = ff[x][mask][pre]; if (mask == 0) return ans = 1; for (int submask = mask; submask > 0; submask--) { submask &= mask; bool ch = false; if (submask == 0) break; if (__builtin_popcount(submask & maskk[x]) > 1) continue; for (int i = 0; i < forbit[x].size(); i++) { if ((forbit[x][i] & submask) == forbit[x][i]) { ch = true; break; } } if (ch) continue; for (int i = pre + 1; i < n; i++) { if (submask & (1 << i) && ((maskk[i] & (submask | (1 << x))) == maskk[i])) if (__builtin_popcount((submask ^ (1 << i)) & maskk[x]) == 0 && (need[i] & submask) == need[i]) { ans = (ans + 1LL * f(i, submask ^ (1 << i), 0) * f(x, mask ^ submask, i)); } } } return ans; } void read() { int i, q, m, x, y; scanf( %d %d %d , &n, &m, &q); for (i = 1; i <= m; i++) { scanf( %d %d , &x, &y); x--; y--; maskk[x] |= (1 << y); maskk[y] |= (1 << x); } for (i = 1; i <= q; i++) { scanf( %d %d %d , &x, &y, &m); x--; y--; m--; forbit[m].push_back((1 << x) | (1 << y)); need[m] |= (1 << x) | (1 << y); } printf( %lld n , f(0, (1 << n) - 2, 0)); } int main() { read(); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int cnt, curk; int pos[N], fa[N]; struct Wall { int z, pos; int xmin, xmax, ymin, ymax; Wall() {} bool operator<(const Wall &x) const { return z < x.z; } } w[N]; struct Queries { int x, y; int pos; Queries() {} bool operator<(const Queries &xx) const { return curk ? x < xx.x : y < xx.y; } } ask[N]; struct K_Dimensional_Tree { struct KDT { int id, minval, x, y, xmin, xmax, ymin, ymax; int lson, rson; KDT() { minval = id = xmin = xmax = ymin = ymax = lson = rson = x = y = 0; } } t[N]; void pushup(int u) { t[u].minval = t[u].id; if (t[u].lson) { t[u].minval = min(t[u].minval, t[t[u].lson].minval); t[u].xmin = min(t[u].xmin, t[t[u].lson].xmin); t[u].xmax = max(t[u].xmax, t[t[u].lson].xmax); t[u].ymin = min(t[u].ymin, t[t[u].lson].ymin); t[u].ymax = max(t[u].ymax, t[t[u].lson].ymax); } if (t[u].rson) { t[u].minval = min(t[u].minval, t[t[u].rson].minval); t[u].xmin = min(t[u].xmin, t[t[u].rson].xmin); t[u].xmax = max(t[u].xmax, t[t[u].rson].xmax); t[u].ymin = min(t[u].ymin, t[t[u].rson].ymin); t[u].ymax = max(t[u].ymax, t[t[u].rson].ymax); } } int BuildTree(int d, int l, int r) { int p = ++cnt, u = (l + r) / 2; curk = d; nth_element(ask + l, ask + u, ask + r + 1); t[p].minval = t[p].id = ask[u].pos; pos[ask[u].pos] = p; t[p].xmin = t[p].xmax = t[p].x = ask[u].x; t[p].ymin = t[p].ymax = t[p].y = ask[u].y; if (l < u) t[p].lson = BuildTree(d ^ 1, l, u - 1), fa[t[p].lson] = p; if (r > u) t[p].rson = BuildTree(d ^ 1, u + 1, r), fa[t[p].rson] = p; pushup(p); return p; } int Query(int p, int xl, int xr, int yl, int yr) { if (t[p].xmin > xr || t[p].xmax < xl || t[p].ymin > yr || t[p].ymax < yl) return 0x3f3f3f3f; if (xl <= t[p].xmin && t[p].xmax <= xr && yl <= t[p].ymin && t[p].ymax <= yr) return t[p].minval; int ans = 0x3f3f3f3f; if (t[p].id != 0x3f3f3f3f && xl <= t[p].x && t[p].x <= xr && yl <= t[p].y && t[p].y <= yr) ans = min(ans, t[p].id); if (t[p].lson) ans = min(ans, Query(t[p].lson, xl, xr, yl, yr)); if (t[p].rson) ans = min(ans, Query(t[p].rson, xl, xr, yl, yr)); return ans; } void Del(int p) { t[p].id = 0x3f3f3f3f; while (p) { pushup(p); p = fa[p]; } } } KD; int n, ANS[N], q; int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return x * f; } int main() { n = read(); for (int i = 1; i <= n; i++) w[i].xmin = read(), w[i].xmax = read(), w[i].ymin = read(), w[i].ymax = read(), w[i].z = read(), w[i].pos = i; sort(w + 1, w + n + 1); q = read(); for (int i = 1; i <= q; i++) ask[i].x = read(), ask[i].y = read(), ask[i].pos = i; KD.BuildTree(0, 1, q); for (int i = 1; i <= n; i++) { int ans = KD.Query(1, w[i].xmin, w[i].xmax, w[i].ymin, w[i].ymax); if (ans == 0x3f3f3f3f) continue; ANS[ans] = w[i].pos; KD.Del(pos[ans]); } for (int i = 1; i <= q; i++) cout << ANS[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int a[2020]; void solve() { int n, x, y; cin >> n >> x >> y; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); reverse(a, a + n); int c = 0; cout << a[x - 1] - a[x]; } int main() { ios::sync_with_stdio(false); cin.tie(0); int T = 1; while (T--) solve(); } |
#include <bits/stdc++.h> const int N = 100001, M = 998244353, mod = 1000000007; const long long MX = INT64_MAX, MN = INT64_MIN, oo = 1e18; using namespace std; vector<string> tokenizer(string str, char ch) { std::istringstream var((str)); vector<string> v; string t; while (getline((var), t, (ch))) { v.emplace_back(t); } return v; } template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { out << a.first << << a.second; return out; } void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << n ; err(++it, args...); } template <typename... T> void read(T&... args) { ((cin >> args), ...); } template <typename... T> void put(T&&... args) { ((cout << args << ), ...); } void file_i_o() { freopen( ./tests/test01.txt , r , stdin); freopen( ./tests/output01.txt , w , stdout); } void solve(int T) { int n, m, k; read(n, m, k); vector<vector<int>> grid(n, vector<int>(m)); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> grid[i][j]; while (k--) { int c; read(c); c--; int r = 0; while (r < n) { if (grid[r][c] == 2) r++; else { int nc = c; if (grid[r][c] == 1) nc++; else nc--; grid[r][c] = 2; c = nc; } } put(c + 1); } } int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; for (int i = 1; i < t + 1; i++) { solve(t); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void cmax(T &a, T b) { a = (a > b ? a : b); } template <class T> void cmin(T &a, T b) { a = (a > b ? b : a); } const long long maxn = 270000, base = 31, kcz = 1e9 + 7; long long inv; long long ksm(long long ds, long long zs = kcz - 2, long long mod = kcz) { long long res = 1; for (; zs; zs >>= 1, ds = ds * ds % mod) if (zs & 1) res = res * ds % kcz; return res; } struct node { long long len, l, r, val; } tr[maxn << 1]; long long p[maxn]; node merge(node a, node b) { node res; if (!a.len) return b; if (!b.len) return a; if (a.r && b.l) { a.val = (a.val + kcz - 1 - 1) * inv % kcz; b.val = (b.val + (kcz - p[b.len - 1]) * 2) % kcz; --b.len; --a.len; if (!a.len) { b.l = 0; return b; } if (!b.len) { a.r = 0; return a; } } res.l = a.l; res.r = b.r; res.len = a.len + b.len; res.val = (a.val * p[b.len] + b.val) % kcz; return res; } char s[maxn]; void build(long long l, long long r, long long now) { if (l == r) { tr[now].l = tr[now].r = s[l] - 0 ; tr[now].val = (s[l] - 0 + 1) * p[0]; tr[now].len = 1; return; } build(l, ((l + r) >> 1), (now << 1)); build(((l + r) >> 1) + 1, r, (now << 1 | 1)); tr[now] = merge(tr[(now << 1)], tr[(now << 1 | 1)]); } node get(long long l, long long r, long long now, long long x, long long y) { if (x <= l && r <= y) return tr[now]; if (y <= ((l + r) >> 1)) return get(l, ((l + r) >> 1), (now << 1), x, y); if (x > ((l + r) >> 1)) return get(((l + r) >> 1) + 1, r, (now << 1 | 1), x, y); return merge(get(l, ((l + r) >> 1), (now << 1), x, y), get(((l + r) >> 1) + 1, r, (now << 1 | 1), x, y)); } long long n, m; int main() { scanf( %lld , &n); inv = ksm(base); p[0] = 1; for (long long i = (1); i <= (n); ++i) p[i] = (p[i - 1] * base) % kcz; scanf( %s , s + 1); build(1, n, 1); scanf( %lld , &m); for (long long i = (1); i <= (m); ++i) { if (i == 28) { ++i; --i; } long long x, y, L; scanf( %lld%lld%lld , &x, &y, &L); node na = get(1, n, 1, x, x + L - 1), nb = get(1, n, 1, y, y + L - 1); if (na.val == nb.val) puts( YES ); else puts( NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAX = 1000000000; const int N = 100005; struct Edge { int to, next, w, vis; }; struct Edge e[N << 1]; int head[N], E, f[N]; struct P { long long val; int idx; P(long long val, int idx) : val(val), idx(idx) {} bool operator<(const P &h) const { return val > h.val; } }; priority_queue<P> Q; long long dfs(int u) { f[u] = 1; long long ret = 0; for (int i = head[u]; i != -1; i = e[i].next) { if (e[i].vis) continue; e[i].vis = e[i ^ 1].vis = 1; ret += e[i].w; if (!f[e[i].to]) ret += dfs(e[i].to); } return ret; } void addedge(int u, int to, int w) { e[E].to = to; e[E].w = w; e[E].vis = 0; e[E].next = head[u]; head[u] = E++; } int main() { memset(head, -1, sizeof head); E = 0; int n, m, p, q; scanf( %d%d%d%d , &n, &m, &p, &q); int uu, vv; for (int i = 0; i < m; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); addedge(u, v, w); addedge(v, u, w); uu = u, vv = v; } int tot = 0; for (int i = 1; i <= n; i++) { if (!f[i]) { long long val = dfs(i); Q.push(P(val, i)); tot++; } } if (p + q < tot || tot < q) { puts( NO ); return 0; } if (m == 0) { if (p > 0 && q == n) { puts( NO ); return 0; } } puts( YES ); tot -= q; int sum = 0; while (sum < tot) { P c1 = Q.top(); Q.pop(); P c2 = Q.top(); Q.pop(); printf( %d %d n , c1.idx, c2.idx); uu = c1.idx, vv = c2.idx; long long add = min(MAX, c1.val + c2.val + 1); c1.val += add + c2.val; Q.push(c1); sum++; } for (int i = 0; i < p - tot; i++) { printf( %d %d n , uu, vv); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 1; vector<long long> arr(2e5 + 2, 0); vector<long long> dp(2e5 + 2, 0); vector<long long> left1(2e5 + 2, 0); void solve() { int n, k; string s; cin >> n >> k >> s; for (int i = 0; i < n; i++) { arr[i] = (s[i] - 0 ) * k; } long long last = n; for (int i = n; i >= 0; i--) { left1[i] = last; if (i - 1 >= 0 && arr[i - 1] != 0) last = i - 1; } dp[0] = 1; for (int i = 1; i < n; i++) { long long firstcost = (i - 1 - arr[i] >= 0) ? (dp[i - 1 - arr[i]] + i + 1) : (i + 1); firstcost = min(firstcost, dp[i - 1] + i + 1); long long rr = left1[i + 1]; if (rr < n && rr - i <= k) { firstcost = min(firstcost, (rr - k - 1 >= 0) ? (dp[rr - k - 1] + rr + 1) : (rr + 1)); } long long l = max(i - k - 1, -1); long long r = left1[l + 1]; if (r < i) { firstcost = min(firstcost, ((r - k - 1 >= 0) ? dp[r - k - 1] + r + 1 : (r + 1))); } dp[i] = firstcost; } cout << dp[n - 1]; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[105]; bool judge(int x) { for(int i=1;i<=100;i++) { if(i*i==x) return true; } return false; } int main() { int t; cin>>t; while(t--) { int n; cin>>n; for(int i=1; i<=n; i++) { cin>>a[i]; } int loop=0; for(int i=1; i<=n; i++) { if(judge(a[i])) { continue; } else { cout<< YES <<endl; loop=1; break; } } if(loop==0) cout<< NO <<endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { string s, provera; int p = -1, d = -1, brojac = 0; bool flag = false; cin >> s >> provera; for (int i = 0; i < provera.length(); ++i) { if (provera[i] == s[brojac]) { brojac++; } if (brojac == s.length()) { p = i; brojac--; break; } } for (int i = provera.length() - 1; i >= 0; --i) { if (provera[i] == s[brojac]) brojac--; if (brojac < 0) { d = i; break; } } if ((d - p) > 0) cout << d - p << endl; else cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int lace[110][110]; int main() { int x, y, i, j; while (cin >> n >> m) { memset(lace, 0, sizeof(lace)); for (i = 1; i <= m; i++) { cin >> x >> y; lace[x][y] = lace[y][x] = 1; } int xx, ans = 0; while (1) { int g[110], num = 0; for (i = 1; i <= n; i++) { xx = 0; for (j = 1; j <= n; j++) if (lace[i][j]) xx++; if (xx == 1) g[++num] = i; } for (j = 1; j <= num; j++) { for (i = 1; i <= n; i++) lace[g[j]][i] = lace[i][g[j]] = 0; } if (!num) break; ans++; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y) { long long res = 1; x = x % 1000000007; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res % 1000000007; } long long inv(long long n) { return power(n, 1000000007 - 2) % 1000000007; } long long isprime(long long n) { if (n < 2) return 0; long long i; for (i = 2; i * i <= n; i++) if (n % i == 0) return 0; return 1; } void solve() { long long ans = 1e18; string s; long long n; cin >> n >> s; for (char ch = a ; ch <= z ; ch++) { long long i = 0, j = n - 1; long long moves = 0; long long ok = 1; while (i < j) { if (s[i] == s[j]) { i++, j--; } else if (s[i] == ch) { i++; moves++; } else if (s[j] == ch) { j--; moves++; } else { ok = 0; break; } } if (ok) { ans = min(ans, moves); } } if (ans > n) ans = -1; cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; long long tc = 0; cin >> t; while (t--) { tc++; solve(); } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 3e6 + 44; const int X[] = {1, 0, -1, 0, 1, -1, 1, -1}; const int Y[] = {0, 1, 0, -1, 1, 1, -1, -1}; const int mod = 998244353; const int INF = 1e9; ll ans[N], add[N]; vector<int> g[N]; vector<pair<int, int> > query[N]; void dfs(int v = 0, int p = -1, int h = 0, ll sum = 0) { for (auto pairr : query[v]) { int d = pairr.first, x = pairr.second; add[h] += x; if (h + d + 1 < N) add[h + d + 1] -= x; } sum += add[h]; ans[v] = sum; for (int to : g[v]) if (to != p) { dfs(to, v, h + 1, sum); } for (auto pairr : query[v]) { int d = pairr.first, x = pairr.second; add[h] -= x; if (h + d + 1 < N) add[h + d + 1] += x; } } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); ; int n; cin >> n; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; u--, v--; g[u].push_back(v); g[v].push_back(u); } int m; cin >> m; for (int i = 0; i < m; ++i) { int v, d, x; cin >> v >> d >> x; v--; query[v].push_back({d, x}); } dfs(); for (int i = 0; i < n; ++i) cout << ans[i] << ; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; int a[25]; LL dp[25][5], l, r; LL dfs(int pos, int cnt, bool zero, bool limit) { if (pos == -1) return 1; if (!limit && !zero && dp[pos][cnt] != -1) return dp[pos][cnt]; int up = limit ? a[pos] : 9; if (cnt == 3) up = 0; LL ans = 0; for (int i = 0; i <= up; ++i) ans += dfs(pos - 1, cnt + (i == 0 ? 0 : 1), zero && i == 0, limit && i == a[pos]); if (!limit && !zero) dp[pos][cnt] = ans; return ans; } LL solve(LL x) { int pos = 0; while (x) { a[pos++] = x % 10; x /= 10; } return dfs(pos - 1, 0, true, true); } int main() { int T; LL l, r; scanf( %d , &T); while (T--) { memset(dp, -1, sizeof dp); scanf( %I64d%I64d , &l, &r); printf( %I64d n , solve(r) - solve(l - 1)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(0.0) * 2.0; const long double eps = 1e-10; const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {-1, 1}, {1, 1}, {1, -1}, {-1, -1}}; template <class T> inline T abs1(T a) { return a < 0 ? -a : a; } template <typename t, typename t1> t min1(t a, t1 b) { return a < b ? a : b; } template <typename t, typename... arg> t min1(t a, arg... arr) { return min1(a, min1(arr...)); } template <typename t, typename t1> t max1(t a, t1 b) { return a > b ? a : b; } template <typename t, typename... arg> t max1(t a, arg... arr) { return max1(a, max1(arr...)); } inline int jud(double a, double b) { if (abs(a) < eps && abs(b) < eps) return 0; else if (abs1(a - b) / abs1(a) < eps) return 0; if (a < b) return -1; return 1; } template <typename t> inline int jud(t a, t b) { if (a < b) return -1; if (a == b) return 0; return 1; } template <typename it, typename t1> inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) { int be = 0, en = na - 1; if (*a <= *(a + na - 1)) { if (f_lb == 0) while (be < en) { int mid = (be + en + 1) / 2; if (jud(*(a + mid), val) != 1) be = mid; else en = mid - 1; } else while (be < en) { int mid = (be + en) / 2; if (jud(*(a + mid), val) != -1) en = mid; else be = mid + 1; } if (f_small && jud(*(a + be), val) == 1) be--; if (!f_small && jud(*(a + be), val) == -1) be++; } else { if (f_lb) while (be < en) { int mid = (be + en + 1) / 2; if (jud(*(a + mid), val) != -1) be = mid; else en = mid - 1; } else while (be < en) { int mid = (be + en) / 2; if (jud(*(a + mid), val) != 1) en = mid; else be = mid + 1; } if (!f_small && jud(*(a + be), val) == -1) be--; if (f_small && jud(*(a + be), val) == 1) be++; } return be; } template <class T> inline T lowb(T num) { return num & (-num); } inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); } inline int bitnum(int nValue) { return __builtin_popcount(nValue); } inline int bitnum(unsigned long long nValue) { return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32); } inline int bitnum(long long nValue) { return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32); } inline int bitmaxl(unsigned int a) { if (a == 0) return 0; return 32 - __builtin_clz(a); } inline int bitmaxl(int a) { if (a == 0) return 0; return 32 - __builtin_clz(a); } inline int bitmaxl(unsigned long long a) { int temp = a >> 32; if (temp) return 32 - __builtin_clz(temp) + 32; return bitmaxl(int(a)); } inline int bitmaxl(long long a) { int temp = a >> 32; if (temp) return 32 - __builtin_clz(temp) + 32; return bitmaxl(int(a)); } long long pow(long long n, long long m, long long mod = 0) { if (m < 0) return 0; long long ans = 1; long long k = n; while (m) { if (m & 1) { ans *= k; if (mod) ans %= mod; } k *= k; if (mod) k %= mod; m >>= 1; } return ans; } template <class t1, class t2> inline void add(t1 &a, t2 b, int mod = -1) { if (mod == -1) mod = 1000000007; a += b; while (a >= mod) a -= mod; while (a < 0) a += mod; } template <class t> void output1(t arr) { for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ; cerr << endl; } template <class t> void output2(t arr) { for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]); } const int maxn = 100100; struct edge { int to, nxt, val; } e[maxn * 2]; int head[maxn], le; int fa[maxn], anc[maxn], sz[maxn], hv[maxn], deep[maxn], loc[maxn]; int orig[maxn], lorig; int n, nq; int f[maxn]; pair<int, int> st[2][maxn]; int lst[2]; int ans[maxn]; struct node { int a, b, cate; int yul; bool operator<(const node &a) const { if (yul == a.yul) return cate < a.cate; return yul < a.yul; } } arr[maxn * 2]; int larr; struct segment_node { int be, en; int sumv, lef, rig; bool flag; }; struct segment_tree { int l; segment_node tree[maxn * 4]; inline int gleft(int no) { return no << 1; } inline int gright(int no) { return (no << 1) + 1; } inline int gfa(int no) { return no >> 1; } inline segment_tree() { l = 0; } void build(int no, int l, int r, int orig = 0, int *a = NULL) { if (l > r) r = l; if (l == r) { tree[no].be = tree[no].en = l; tree[no].sumv = 0; tree[no].lef = tree[no].rig = 0; tree[no].flag = 0; return; } tree[no].be = l; tree[no].en = r; int mid = (l + r) / 2; build(gleft(no), l, mid, orig, a); build(gright(no), mid + 1, r, orig, a); tree[no].sumv = 0; tree[no].lef = tree[no].rig = 0; } inline void pushup(segment_node *no, segment_node *nl, segment_node *nr) { if (nl->flag && nr->flag) { no->lef = no->rig = nr->lef + nl->rig; no->sumv = 0; no->flag = 1; return; } if (nl->flag && nl->lef == 0) { memcpy(no, nr, sizeof(segment_node)); return; } if (nr->flag && nr->lef == 0) { memcpy(no, nl, sizeof(segment_node)); return; } no->flag = 0; if (nl->flag) { no->lef = nr->lef + nl->rig; no->rig = nr->rig; no->sumv = nr->sumv; return; } if (nr->flag) { no->lef = nl->lef; no->rig = nl->rig + nr->lef; no->sumv = nl->sumv; return; } no->lef = nl->lef; no->rig = nr->rig; no->sumv = nl->sumv + nr->sumv + f[nl->rig + nr->lef]; } void down(int loc, int no) { if (loc <= tree[no].be && loc >= tree[no].en) { tree[no].rig = tree[no].lef = 1; tree[no].flag = 1; tree[no].sumv = 0; return; } int mid = (tree[no].be + tree[no].en) >> 1; if (loc <= mid) down(loc, gleft(no)); else down(loc, gright(no)); pushup(tree + no, tree + gleft(no), tree + gright(no)); } void getsum(int l, int r, int no, int pp1) { if (l > r) return; int pp2 = pp1 + 100; if (l <= tree[no].be && r >= tree[no].en) { pushup(tree + pp2, tree + pp1, tree + no); tree[pp1] = tree[pp2]; return; } int mid = (tree[no].be + tree[no].en) >> 1; if (r >= tree[no].be && l <= mid) getsum(l, r, gleft(no), pp1); if (r >= mid + 1 && l <= tree[no].en) getsum(l, r, gright(no), pp1); } } sgt; void dfs(int no) { sz[no] = 1; hv[no] = -1; for (int i = head[no]; i != -1; i = e[i].nxt) if (e[i].to != fa[no]) { fa[e[i].to] = no; deep[e[i].to] = deep[no] + 1; dfs(e[i].to); sz[no] += sz[e[i].to]; if (hv[no] == -1 || sz[hv[no]] < sz[e[i].to]) hv[no] = e[i].to; } } void dfs1(int no) { orig[lorig] = no; loc[no] = lorig++; if (hv[no] != -1) { anc[hv[no]] = anc[no]; dfs1(hv[no]); } for (int i = head[no]; i != -1; i = e[i].nxt) if (e[i].to != fa[no] && e[i].to != hv[no]) { anc[e[i].to] = e[i].to; dfs1(e[i].to); } } void addedge(int a, int b, int c) { e[le].to = b; e[le].nxt = head[a]; e[le].val = c; head[a] = le++; } int main() { ios_base::sync_with_stdio(0); memset(head, -1, sizeof(head)); scanf( %d%d , &n, &nq); for (int i = 1; i < n; i++) scanf( %d , f + i); for (int i = 0; i < n - 1; i++) { int a, b, c; scanf( %d%d%d , &a, &b, &c); a--; b--; addedge(a, b, c); addedge(b, a, c); arr[i].a = a; arr[i].b = b; arr[i].yul = -c; arr[i].cate = -(i + 1); } sgt.build(1, 0, n); dfs(0); dfs1(0); for (int i = 0; i < nq; i++) { scanf( %d%d%d , &arr[i + n - 1].a, &arr[i + n - 1].b, &arr[i + n - 1].yul); arr[i + n - 1].cate = i; arr[i + n - 1].a--; arr[i + n - 1].b--; arr[i + n - 1].yul = -arr[i + n - 1].yul; } sort(arr, arr + nq + n - 1); for (int i = 0; i < nq + n - 1; i++) { if (arr[i].cate < 0) { int no = arr[i].a; if (deep[arr[i].b] > deep[no]) no = arr[i].b; sgt.down(loc[no], 1); } else { int a = arr[i].a, b = arr[i].b; int l = 0; lst[0] = lst[1] = 0; while (anc[a] != anc[b]) { int no = a, cate = 0; if (deep[anc[a]] < deep[anc[b]]) { no = b; cate = 1; } st[cate][lst[cate]++] = make_pair(loc[anc[no]], loc[no]); l += abs(loc[anc[no]] - loc[no]) + 1; if (deep[anc[a]] < deep[anc[b]]) b = fa[anc[no]]; else a = fa[anc[no]]; } if (a != b) { if (deep[a] > deep[b]) st[0][lst[0]++] = make_pair(loc[b] + 1, loc[a]); else st[1][lst[1]++] = make_pair(loc[a] + 1, loc[b]); l += abs(deep[a] - deep[b]); } int ff1 = 400000, ff2 = ff1 + 1, ff3 = ff1 + 2; sgt.tree[ff1].rig = sgt.tree[ff1].lef = sgt.tree[ff1].sumv = 0; sgt.tree[ff1].flag = 1; sgt.tree[ff2].rig = sgt.tree[ff2].lef = sgt.tree[ff2].sumv = 0; sgt.tree[ff2].flag = 1; for (int i = lst[0] - 1; i >= 0; i--) sgt.getsum(st[0][i].first, st[0][i].second, 1, ff1); for (int i = lst[1] - 1; i >= 0; i--) sgt.getsum(st[1][i].first, st[1][i].second, 1, ff2); swap(sgt.tree[ff1].lef, sgt.tree[ff1].rig); sgt.pushup(sgt.tree + ff3, sgt.tree + ff1, sgt.tree + ff2); int rans = sgt.tree[ff3].sumv + f[sgt.tree[ff3].lef]; if (!sgt.tree[ff3].flag) rans += f[sgt.tree[ff3].rig]; ans[arr[i].cate] = rans; } } for (int i = 0; i < nq; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int result = n / 2 + 1; cout << result; return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = 2 * acos(0); const int oo = 2e9; const int N = 205; const int AL = 26; vector<int> idx[AL]; vector<int> adj[N]; int clr[N]; bool dfs(int u, int c = 0); int main() { int n; scanf( %d , &(n)); string s(n, ); for (int i = 0; i < n; i++) scanf( %c , &s[i]); memset(clr, -1, sizeof(clr)); for (int i = 0; i < n; i++) { int x = s[i] - a ; for (int c = x + 1; c < AL; c++) { for (auto& j : idx[c]) { adj[i].push_back(j); adj[j].push_back(i); } } idx[x].push_back(i); } bool valid = true; for (int i = 0; i < n; i++) { if (clr[i] == -1) valid &= dfs(i); } if (valid) { puts( YES ); for (int i = 0; i < n; i++) { printf( %d , clr[i]); } printf( n ); } else printf( NO n ); return 0; } bool dfs(int u, int c) { clr[u] = c; bool ret = true; for (auto& v : adj[u]) { if (clr[v] == -1) ret &= dfs(v, !c); else if (c == clr[v]) return false; } return ret; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5; long long int rev[N], fac[N], mod = 1e9 + 7; long long int wop(long long int x, long long int y) { if (y == 0) return 1; long long int ret = wop(x, y / 2); ret %= mod; ret *= ret; ret %= mod; if (y & 1) ret *= x; ret %= mod; return ret; } long long int chos(long long int r, long long int n) { return (fac[n] * ((rev[r] * rev[n - r]) % mod)) % mod; } int main() { long long int n, m; cin >> n >> m; rev[0] = fac[0] = 1; for (int i = 1; i < 2e3; i++) { fac[i] = fac[i - 1] * i; fac[i] %= mod; rev[i] = wop(fac[i], mod - 2); } long long int ans = 0; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { long long int f1 = chos(i - 1, i + m - 2); long long int f2 = chos(n - j, n + m - j - 1); ans += (f1 * f2) % mod; ans %= mod; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int euclid(int a, int b, int &x, int &y) { if (!a) { x = 0; y = 1; return b; } int _x, _y; int g = euclid(b % a, a, _x, _y); x = _y - b / a * _x; y = _x; return g; } void relax(int &obj, int C3, int C4, int C5, int _k3, int k4, int _k5, int &K3, int &K4, int &K5) { int f = abs(C3 * _k3 - C4 * k4) + abs(C4 * k4 - C5 * _k5); if (f < obj) { obj = f; K3 = _k3, K4 = k4, K5 = _k5; } } int main() { int n, S, a[333]; cin >> n >> S; for (int i = 0; i < n; ++i) { cin >> a[i]; } int C[11] = {0}; for (int _n(n), i(0); i < _n; i++) C[a[i]]++; int K3 = 1011111111, K4 = 1011111111, K5 = 1011111111, F = 1011111111; int ek3 = 1011111111, ek5 = 1011111111; const int D = euclid(C[3], C[5], ek3, ek5); for (int k4 = 0; k4 * C[4] <= S; ++k4) { const int REM = S - k4 * C[4]; if (REM % D) continue; int k3 = ek3 * (REM / D), k5 = ek5 * (REM / D); assert(k3 * C[3] + k5 * C[5] == REM); int idx[] = {(k4 - k3 + C[5] / D - 1) / (C[5] / D), (k5 - k4 + C[3] / D - 1) / (C[3] / D), (k5 - k4 * C[4] / C[5] + C[3] / D - 1) / (C[3] / D) + 2, (k4 * C[4] / C[3] - k3 + C[5] / D - 1) / (C[5] / D) + 2}; for (int o = 0; o < 4; ++o) { int j = idx[o]; for (int it = 0; it < 5; --j, ++it) { int _k3 = k3 + j * (C[5] / D); int _k5 = k5 - j * (C[3] / D); if (_k3 < 0) continue; if (_k3 > k4) continue; if (_k5 < k4) continue; relax(F, C[3], C[4], C[5], _k3, k4, _k5, K3, K4, K5); } } } if (F == 1011111111) { cout << -1 << endl; } else { printf( %d %d %d n , K3, K4, K5); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 505 * 505 * 4; int n; using vi = vector<int>; vi G[maxn]; int dfn[maxn]; int low[maxn]; int scc[maxn]; int scnt[maxn]; int ntime; int scc_cnt; int sta[maxn]; int sz; void tarjan(int u) { dfn[u] = low[u] = ++ntime; sta[sz++] = u; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (!dfn[v]) { tarjan(v); low[u] = min(low[u], low[v]); } else if (!scc[v]) { low[u] = min(low[u], dfn[v]); } } if (low[u] == dfn[u]) { scc_cnt++; int tmp; do { --sz; tmp = sta[sz]; scc[tmp] = scc_cnt; scnt[scc_cnt]++; } while (tmp != u); } } bool find_bcc() { sz = 0; memset(scc, 0, sizeof(scc)); memset(dfn, 0, sizeof(dfn)); memset(scnt, 0, sizeof(scnt)); ntime = scc_cnt = 0; for (int i = 1; i <= n; ++i) if (!dfn[i]) tarjan(i); for (int i = 1; i <= n; i += 2) { if (scc[i] == scc[i + 1]) return false; } return true; } char s[505][505]; int w, h; int id(int x, int y) { return (x - 1) * w + y; } int res[505][505]; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int main() { scanf( %d %d , &h, &w); n = 2 * h * w; for (int i = 1; i <= h; i += 1) { scanf( %s , s[i] + 1); } for (int i = 1; i <= h; i += 1) { for (int j = 1; j <= w; j += 1) { if (s[i][j] == . ) continue; int cnt = 0; vector<int> lst; for (int k = 0; k < 4; k += 1) { int nx = i + dx[k]; int ny = j + dy[k]; if (s[nx][ny] == . ) { cnt += 1; lst.emplace_back(id(nx, ny)); } } if (cnt == 1 || cnt == 3) { puts( NO ); return 0; } if (!cnt) continue; if (cnt == 2) { G[lst[0] * 2 - 1].emplace_back(lst[1] * 2); G[lst[1] * 2 - 1].emplace_back(lst[0] * 2); G[lst[0] * 2].emplace_back(lst[1] * 2 - 1); G[lst[1] * 2].emplace_back(lst[0] * 2 - 1); } if (cnt == 4) { for (int i = 0; i < 2; i += 1) { G[2 * lst[i]].emplace_back(2 * lst[i + 2]); G[2 * lst[i] - 1].emplace_back(2 * lst[i + 2] - 1); G[2 * lst[i + 2]].emplace_back(2 * lst[i]); G[2 * lst[i + 2] - 1].emplace_back(2 * lst[i] - 1); } for (int i = 0; i < 4; i += 2) { int nx = lst[(i + 1) % 4]; G[2 * lst[i] - 1].emplace_back(2 * nx); G[2 * lst[i]].emplace_back(2 * nx - 1); nx = lst[(i + 3) % 4]; G[2 * lst[i] - 1].emplace_back(2 * nx); G[2 * lst[i]].emplace_back(2 * nx - 1); } } } } if (!find_bcc()) puts( NO ); else { puts( YES ); for (int i = 1; i <= h; i += 1) { for (int j = 1; j <= w; j += 1) { if (s[i][j] == X ) continue; int cur = id(i, j); if (scc[2 * cur - 1] < scc[2 * cur]) res[i][j] = 1; else res[i][j] = 4; } } for (int i = 1; i <= h; i += 1) { for (int j = 1; j <= w; j += 1) { if (s[i][j] == . ) continue; for (int k = 0; k < 4; k += 1) { int nx = i + dx[k]; int ny = j + dy[k]; if (s[nx][ny] == X ) continue; res[i][j] += res[nx][ny]; } } } for (int i = 1; i <= h; i += 1) { for (int j = 1; j <= w; j += 1) { printf( %d%c , res[i][j], n [j == w]); } } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( tune=native ) using namespace std; const int MAX = 1e6 + 5; const long long MOD = 1000000007; const long long MOD2 = 2010405347; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = acos(-1); const double EPS = 1e-9; const int block = 315; inline long long pw(long long x, long long y, long long md = MOD) { long long ret = 1; while (y) { if (y & 1) ret = ret * x % md; x = x * x % md, y >>= 1; } return ret; } int n, x[MAX], y[MAX], z[MAX], nw; long long ans; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = (1); i <= (n); ++i) { cin >> x[i]; y[i] = max(y[i - 1], x[i] + 1); } for (int i = (n); i >= (1); --i) { nw = max(nw - 1, x[i] + 1); z[i] = nw; } for (int i = (1); i <= (n); ++i) { nw = max(y[i], z[i]); ans += nw - x[i] - 1; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void chkmax(T& x, T y) { if (x < y) x = y; } template <typename T> void chkmin(T& x, T y) { if (x > y) x = y; } inline int read() { int x = 0; char c = getchar(); bool f = 0; while (c < 48) f |= c == - , c = getchar(); while (c > 47) x = x * 10 + (c ^ 48), c = getchar(); return f ? -x : x; } int N, p[114]; long long getv(long long x) { long long res = 0; for (int i = (N - 1), iend = (0); i >= iend; --i) { if ((long double)res * x + p[i] > 1e18) return -1; res = res * x + p[i]; } return res; } void solve() { long long t, a, b; cin >> t >> a >> b; int res = a == b ? 1 : 0, tt = -1, ct = 0; if (t > a || a > b || (t == a && a == 1 && b > 1)) return printf( %d n , res), void(); if (b == 1) return puts( inf ), void(); if (a != 1) { for (long long tp = b; tp; tp /= a) p[N++] = tp % a, ct += tp % a != 0; res += getv(t) == a && getv(a) == b; if (ct == 1) tt = N - 1; } long long zzh = 1, yyh = 1; for (int i = (1), iend = (60); i <= iend; ++i) { if ((long double)yyh * a > 1e18) break; zzh *= t, yyh *= a; if (i != tt && a % zzh == 0 && b % yyh == 0 && a / zzh == b / yyh) res++; } cout << res << endl; } signed main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long MOD = 1000000007; long long dp[2001][2001]; long long dp1[2001][2001]; int main() { int N, K; string S; cin >> N >> K >> S; memset(dp, 0, sizeof(dp)); memset(dp1, 0, sizeof(dp1)); dp[0][0] = dp1[0][0] = 1; for (int n = 1; n <= N; ++n) { for (int k = 0; k <= K; ++k) { dp[n][k] = dp1[n - 1][k] * (long long)(S[n - 1] - a ) % MOD; } for (int i = 0; i < n; ++i) { int delta = (n - i) * (N - n + 1); for (int k = 0; k + delta <= K; ++k) { dp[n][k + delta] += dp[i][k] * (long long)( z - S[n - 1]) % MOD; dp[n][k + delta] %= MOD; } } for (int k = 0; k <= K; ++k) { dp1[n][k] = (dp1[n - 1][k] + dp[n][k]) % MOD; } } cout << dp1[N][K] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5; int type[N], n, p[N], out[N]; int go(int u, bool print = false) { int res = p[u] == -1 || out[p[u]] > 1 ? 1 : go(p[u], print) + 1; if (print) cout << u + 1 << ; return res; } int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> type[i]; for (int i = 0; i < n; ++i) { cin >> p[i]; if (--p[i] >= 0) ++out[p[i]]; } int res = -1; for (int i = 0; i < n; ++i) if (type[i] == 1) if (res == -1 || go(i) > go(res)) res = i; cout << go(res) << endl; go(res, true); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) const int MAXN = 1e5 + 5; using namespace std; struct node { int i; node *l, *r; }; node *newN(int i) { node *x = new node; x->i = i; x->r = x->l = NULL; return x; } node *insert(node *actual, int i, bool k) { if (!actual) return newN(i); if (k) return actual->r = newN(i); else return actual->l = newN(i); } void inorder(node *root) { if (!root) return; inorder(root->l); cout << root->i << n ; inorder(root->r); } int main() { ios::sync_with_stdio(0); cin.tie(0); string a; cin >> a; node *root = newN(1), *actual = root; for (int i = 0; i < (int)a.size() - 1; i++) { if (a[i] == l ) actual = insert(actual, i + 2, 0); else actual = insert(actual, i + 2, 1); } inorder(root); return 0; } |
#include <bits/stdc++.h> const double eps = 1e-10; const float epsf = 1e-6; using namespace std; inline long long int __gcd(long long int a, long long int b) { if (a == 0 || b == 0) { return max(a, b); } long long int tempa, tempb; while (1) { if (a % b == 0) return b; else { tempa = a; tempb = b; a = tempb; b = tempa % tempb; } } } inline int compfloat(float& x, float& y) { if (fabs(x - y) < epsf) return 0; else if (x - y > 0) return 1; return -1; } inline int compdouble(double x, double y) { if (fabs(x - y) < eps) return 0; else if (x - y > 0) return 1; else return -1; } bool prime(long long int k) { for (long long int i = 2; i * i <= k; i++) if (k % i == 0) { return false; } return true; } void pdash(int n = 1) { for (int i = 0; i < n; i++) { for (int j = 0; j < 30; j++) { cout << - ; } cout << n ; } } void solve() { long long int n; cin >> n; long long int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; long long int dpi[n], dpd[n]; dpi[0] = 0; dpd[n - 1] = 0; for (int i = 1; i < n; i++) dpi[i] = max(dpi[i - 1] + arr[i - 1] + 1 - arr[i], (long long int)0); for (int i = (int)n - 2; i >= 0; i--) dpd[i] = max(dpd[i + 1] + arr[i + 1] + 1 - arr[i], (long long int)0); long long int sumi[n], sumd[n]; sumi[0] = dpi[0]; sumd[n - 1] = dpd[n - 1]; for (int i = 1; i < n; i++) sumi[i] = sumi[i - 1] + dpi[i]; for (int i = (int)n - 2; i >= 0; i--) sumd[i] = sumd[i + 1] + dpd[i]; long long int ans = numeric_limits<long long int>::max(); for (int i = 1; i < n - 1; i++) ans = min(ans, sumi[i - 1] + sumd[i + 1] + max(dpi[i], dpd[i])); ans = min({sumd[0], sumi[n - 1], ans}); cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100007; struct LinkCutTree { struct Node { int L, R, P, lazyFlip; int PP; }; Node LCT[MAXN]; void normalize(int u) { assert(u != -1); if (LCT[u].L != -1) LCT[LCT[u].L].P = u; if (LCT[u].R != -1) LCT[LCT[u].R].P = u; } void setLeftChild(int p, int v) { LCT[p].L = v; normalize(p); } void setRightChild(int p, int v) { LCT[p].R = v; normalize(p); } void pushLazy(int u) { if (!LCT[u].lazyFlip) return; swap(LCT[u].L, LCT[u].R); LCT[u].lazyFlip = 0; if (LCT[u].L != -1) LCT[LCT[u].L].lazyFlip ^= 1; if (LCT[u].R != -1) LCT[LCT[u].R].lazyFlip ^= 1; } void make_tree(int v) { LCT[v].L = LCT[v].R = LCT[v].P = LCT[v].PP = -1; LCT[v].lazyFlip = 0; } void rotate(int v) { if (LCT[v].P == -1) return; int p = LCT[v].P; int g = LCT[p].P; if (LCT[p].L == v) { setLeftChild(p, LCT[v].R); setRightChild(v, p); } else { setRightChild(p, LCT[v].L); setLeftChild(v, p); } LCT[v].P = g; if (g != -1) { if (LCT[g].L == p) { setLeftChild(g, v); } else { setRightChild(g, v); } } LCT[v].PP = LCT[p].PP; LCT[p].PP = -1; } void pushEmAll(int v) { if (LCT[v].P != -1) pushEmAll(LCT[v].P); pushLazy(v); } void splay(int v) { pushLazy(v); while (LCT[v].P != -1) { int p = LCT[v].P; int g = LCT[p].P; if (g != -1) pushLazy(g); pushLazy(p); pushLazy(v); if (g == -1) { rotate(v); } else if ((LCT[p].L == v) == (LCT[g].L == p)) { rotate(p); rotate(v); } else { rotate(v); rotate(v); } } } vector<int> access(int v, bool doIt = false) { splay(v); int _v = v, _r = -1; if (LCT[v].R != -1) { if (doIt) { _r = LCT[v].R; } LCT[LCT[v].R].PP = v; LCT[LCT[v].R].P = -1; setRightChild(v, -1); } vector<int> ret; while (LCT[v].PP != -1) { int w = LCT[v].PP; splay(w); ret.push_back(w); if (LCT[w].R != -1) { LCT[LCT[w].R].PP = w; LCT[LCT[w].R].P = -1; } LCT[v].PP = -1; setRightChild(w, v); splay(v); } if (_r != -1) { splay(_v); assert(LCT[_v].R == -1); setRightChild(_v, _r); LCT[_r].PP = -1; } return ret; } int find_root(int v) { access(v); int ret = v; while (LCT[ret].L != -1) { ret = LCT[ret].L; pushLazy(ret); } access(ret); return ret; } void link(int v, int w) { access(w); setLeftChild(v, w); LCT[w].PP = -1; } void cut(int v) { access(v); if (LCT[v].L != -1) { LCT[LCT[v].L].P = -1; LCT[LCT[v].L].PP = -1; setLeftChild(v, -1); } } void make_root(int v) { access(v); int l = LCT[v].L; if (l != -1) { setLeftChild(v, -1); LCT[l].P = -1; LCT[l].PP = v; LCT[l].lazyFlip ^= 1; } } bool isConnected(int p, int q) { return find_root(p) == find_root(q); } int LCA(int p, int q) { access(p); return access(q).back(); } }; vector<pair<int, int> > edg[MAXN]; long long depth[MAXN]; LinkCutTree lct; int bap[MAXN]; vector<int> accessOrder; int st[MAXN], ed[MAXN]; int tym; void dfs(int u, int p) { st[u] = ++tym; bap[u] = p; bool called = false; for (pair<int, int> pr : edg[u]) { if (p == pr.first) continue; called = true; depth[pr.first] = depth[u] + pr.second; lct.link(pr.first, u); dfs(pr.first, u); } if (!called) accessOrder.push_back(u); ed[u] = tym; } map<long long, long long> vacancy; bool makePlace(long long l, long long r) { auto it = vacancy.lower_bound(l); if (l <= prev(it)->second) { it = prev(it); long long _l = it->first; long long _r = it->second; vacancy.erase(it); if (_l < l) vacancy[_l] = l - 1; if (l < _r) vacancy[l + 1] = _r; return true; } else { assert(it != vacancy.end()); long long _l = it->first; long long _r = it->second; if (r < _l) return false; vacancy.erase(it); if (_l < _r) vacancy[_l + 1] = _r; return true; } assert(false); } set<int> tr[4 * MAXN]; void update(int u, int l, int r, int i, int t) { tr[u].insert(t); if (l == r) return; int mid = (l + r) / 2; if (i <= mid) update(u * 2, l, mid, i, t); else update(u * 2 + 1, mid + 1, r, i, t); } int ask(int u, int l, int r, int x, int y, int t) { if (y < l || r < x) return 0; if (x <= l && r <= y) { auto it = tr[u].lower_bound(t); if (it == tr[u].begin()) return 0; return *prev(it); } int mid = (l + r) / 2; return max(ask(u * 2, l, mid, x, y, t), ask(u * 2 + 1, mid + 1, r, x, y, t)); } void printEdges(int s) { while (s != 1) { cout << s << @ << depth[s] << <- ; s = bap[s]; } cout << 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i < n; i++) { int u, v, w; cin >> u >> v >> w; edg[u].emplace_back(v, w); edg[v].emplace_back(u, w); } for (int i = 1; i <= n; i++) lct.make_tree(i); dfs(1, 0); for (int leaf : accessOrder) { lct.access(leaf); } map<long long, vector<long long> > mp; for (int _m = 0; _m < m; _m++) { int s, t; cin >> s >> t; if (s == 1) continue; vector<int> need = lct.access(s, true); for (int p : need) { int l = ask(1, 1, n, st[p], ed[p], t); if (l > 0) mp[t + depth[p]].push_back(l + 1 + depth[p]); else mp[t + depth[p]].push_back(1); } update(1, 1, n, st[bap[s]], t); } vacancy[0] = 1e15; int ans = 0; for (pair<const long long, vector<long long> >& pr : mp) { sort(pr.second.begin(), pr.second.end()); bool okay = true; for (long long x : pr.second) { if (!makePlace(x, pr.first)) { okay = false; break; } } if (!okay) { cout << pr.first << << ans << endl; return 0; } ans += pr.second.size(); } cout << -1 << << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; long long arr[MAX], arr2[MAX]; int n, m; bool check(long long mid) { int prv = 0; for (int i = 0; i < n; ++i) { while (prv < m && arr2[prv] + mid < arr[i]) ++prv; if (prv == m || arr2[prv] - mid > arr[i]) return 0; } return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) cin >> arr[i]; for (int i = 0; i < m; ++i) cin >> arr2[i]; sort(arr, arr + n); sort(arr2, arr2 + m); long long l = 0, r = 2e9; long long ans = r; while (l <= r) { long long mid = (l + r) >> 1; if (check(mid)) ans = mid, r = mid - 1; else l = mid + 1; } return cout << ans << n , 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 2; int a[maxn << 1]; long long vis[maxn]; int main(void) { std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n, m; while (cin >> n >> m) { int k = 0; int t; vector<int> a(n + m + 1); vector<long long> vis(m); for (int i = 1; i <= n + m; i++) cin >> a[i]; for (int i = 1; i <= n + m; i++) cin >> t, t ? vis[k++] = a[i] : 1; vis[k] = (int)1e18; for (int i = 1, j = 0; i <= n + m; j++) { int cnt = 0; while (a[i] < vis[j]) cnt++, i++; i++; while (a[i] - vis[j] <= vis[j + 1] - a[i] && i <= n + m) cnt++, i++; cout << cnt << ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; bool isprime[N] = {1, 1, 0}; int sum[N] = {}; void YesIcan() { for (int i = 2; i * i <= N; ++i) { for (int j = i * i; j <= N; j += i) isprime[j] = true; } } int main() { YesIcan(); int a, b, k; cin >> a >> b >> k; for (int i = a; i <= b; ++i) { sum[i] = sum[i - 1]; if (!isprime[i]) ++sum[i]; } if (sum[b] < k) { cout << -1; return 0; } int i = a - 1, l = 1; for (; i <= b - l; ++i) { while (sum[i + l] - sum[i] < k && l <= b - a + 1 && i + l <= b) ++l; } cout << l; } |
#include <bits/stdc++.h> using namespace std; int main() { #ifdef LOCAL freopen( ../IO/d.in , r , stdin); // freopen( ../IO/d.out , w , stdout); #else std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); #endif int number_of_tests; cin >> number_of_tests; while (number_of_tests--) { int n; cin >> n; std::vector<int> b(n); std::vector<int> used(2 * n); for (int &i : b) cin >> i, --i, used[i] = 1; std::vector<int> unused; unused.reserve(n); for (int i = 0; i < 2 * n; ++i) { if (!used[i]) unused.push_back(i); } vector<int> c(n + 1, true); int l = -1, r = -1; auto check1 = [&](int x) { deque<int> dq(unused.begin(), unused.end()); bool ok = true; for (int i = x - 1; i >= 0; --i) { ok &= b[i] < dq.back(); dq.pop_back(); } return ok; }; auto check2 = [&](int x) { deque<int> dq(unused.begin(), unused.end()); bool ok = true; for (int i = x; i < n; ++i) { ok &= b[i] > dq.front(); dq.pop_front(); } return ok; }; int lo = -1, hi = n + 1; while (hi - lo > 1) { int x = (lo + hi) / 2; if (check1(x)) { lo = x; } else { hi = x; } } l = 0, r = lo; lo = -1, hi = n + 1; while (hi - lo > 1) { int x = (lo + hi) / 2; if (check2(x)) { hi = x; } else { lo = x; } } l = std::max(l, hi); // std::cout << l << << r << n ; std::cout << std::max(0, r - l + 1) << n ; } return 0; } |
#include <bits/stdc++.h> int gcd(int a, int b) { if (b == 0) return a; gcd(b, a % b); } using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int q; cin >> q; while (q--) { int a, b; cin >> a >> b; if (gcd(a, b) != 1) cout << INFINITE << endl; else cout << FINITE << endl; } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16000000 ) using namespace std; const int Maxn = 1000005; const int Maxm = 4194304; const int Inf = 1000000000; int n, c; pair<int, int> lef[Maxn], rig[Maxn]; int me[Maxn]; int res[Maxn], rlen; int st[Maxm]; void Insert(int v, int l, int r, int x, int val) { if (l == r) st[v] = val; else { int m = l + r >> 1; if (x <= m) Insert(2 * v, l, m, x, val); else Insert(2 * v + 1, m + 1, r, x, val); st[v] = max(st[2 * v], st[2 * v + 1]); } } int Get(int v, int l, int r, int a, int b) { if (l == a && r == b) return st[v]; else { int res = -Inf; int m = l + r >> 1; if (a <= m) res = max(res, Get(2 * v, l, m, a, min(m, b))); if (m + 1 <= b) res = max(res, Get(2 * v + 1, m + 1, r, max(m + 1, a), b)); return res; } } bool isNull(const pair<int, int> &p) { return p == pair<int, int>(Inf, -Inf); } void Print(int l, int r) { if (l > r) return; if (l == r) res[rlen++] = l; else { int from = l + 1; if (!isNull(lef[l])) { Print(l + 1, lef[l].second); from = lef[l].second + 1; } res[rlen++] = l; Print(from, r); } } int main() { scanf( %d %d , &n, &c); for (int i = 1; i <= n; i++) { lef[i] = pair<int, int>(Inf, -Inf); rig[i] = pair<int, int>(Inf, -Inf); } int a, b; char s[10]; while (c--) { scanf( %d %d %s , &a, &b, s); if (s[0] == L ) { lef[a].first = min(lef[a].first, b); lef[a].second = max(lef[a].second, b); } else { rig[a].first = min(rig[a].first, b); rig[a].second = max(rig[a].second, b); } } for (int i = n; i >= 1; i--) { if (isNull(lef[i]) && isNull(rig[i])) me[i] = i; else if (isNull(lef[i])) if (rig[i].first <= i) { printf( IMPOSSIBLE n ); return 0; } else me[i] = Get(1, 1, n, i + 1, rig[i].second); else if (isNull(rig[i])) if (lef[i].first <= i) { printf( IMPOSSIBLE n ); return 0; } else { lef[i].second = Get(1, 1, n, i + 1, lef[i].second); me[i] = lef[i].second; } else if (lef[i].first <= i) { printf( IMPOSSIBLE n ); return 0; } else { lef[i].second = Get(1, 1, n, i + 1, lef[i].second); if (lef[i].second >= rig[i].first) { printf( IMPOSSIBLE n ); return 0; } else me[i] = Get(1, 1, n, lef[i].second + 1, rig[i].second); } Insert(1, 1, n, i, me[i]); } Print(1, n); for (int i = 0; i < rlen; i++) printf( %d%c , res[i], i + 1 < rlen ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int sz = 7e5; long long int sum[sz]; long long int mi[sz]; long long int arr[sz]; void build(long long int node, long long int l, long long int r) { if (l == r) { sum[node] = arr[l]; } else { long long int mid = (l + r) / 2; build(2 * node, l, mid); build(2 * node + 1, mid + 1, r); sum[node] = sum[node * 2] + sum[node * 2 + 1]; } } long long int query(long long int node, long long int l, long long int r, long long int tl, long long int tr) { if (l > tr || r < tl) return 0; else if (l >= tl && r <= tr) return sum[node]; else return (query(node * 2, l, (l + r) / 2, tl, tr) + query(node * 2 + 1, (l + r) / 2 + 1, r, tl, tr)); } void build2(long long int node, long long int l, long long int r) { if (l == r) { mi[node] = arr[l]; } else { long long int mid = (l + r) / 2; build2(2 * node, l, mid); build2(2 * node + 1, mid + 1, r); mi[node] = min(mi[node * 2], mi[node * 2 + 1]); } } long long int query2(long long int node, long long int l, long long int r, long long int tl, long long int tr) { if (l > tr || r < tl) return 0; else if (l >= tl && r <= tr) return mi[node]; else return min(query2(node * 2, l, (l + r) / 2, tl, tr), query2(node * 2 + 1, (l + r) / 2 + 1, r, tl, tr)); } long long int pre[sz]; int main() { std::ios::sync_with_stdio(false); long long int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; build(1, 1, n); build2(1, 1, n); sort(arr, arr + n + 1); for (int i = 1; i <= n; i++) { pre[i] = pre[i - 1] + arr[i]; } long long int q; cin >> q; while (q--) { long long int t; cin >> t; if (t == 1) { long long int l, r; cin >> l >> r; cout << query(1, 1, n, l, r) << endl; } else { long long int l, r; cin >> l >> r; cout << pre[r] - pre[l - 1] << endl; } } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 1e18; template <typename T> void read(T &x) { x = 0; int s = 1, c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) s = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 48; x *= s; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar( - ); if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } template <typename T> void writeln(T x) { write(x); puts( ); } const int maxn = 1e5 + 5, maxm = 1e6 + 5; struct Edge { int u, v, c, id; bool operator<(const Edge &rhs) const { return c < rhs.c; } } e[maxm]; int n, m; int fa[maxn]; vector<pair<int, int> > adj[maxn]; int f[maxn][20], dis[maxn][20], d[maxn]; vector<Edge> v; int find(int v) { return v == fa[v] ? v : fa[v] = find(fa[v]); } void dfs(int u, int fa) { d[u] = d[fa] + 1; for (pair<int, int> x : adj[u]) if (x.first ^ fa) { int v = x.first, c = x.second; f[v][0] = u; dis[v][0] = c; dfs(v, u); } } int LCA(int x, int y, int op) { int res = 0; if (d[x] > d[y]) swap(x, y); for (int t = 19; t >= 0; t--) if (d[x] <= d[f[y][t]]) { res = max(res, dis[y][t]); y = f[y][t]; } if (x == y) return op ? res : x; for (int t = 19; t >= 0; t--) if (f[x][t] != f[y][t]) { res = max(res, max(dis[x][t], dis[y][t])); x = f[x][t], y = f[y][t]; } res = max(res, max(dis[x][0], dis[y][0])); return op ? res : f[x][0]; } int main() { read(n), read(m); for (int i = 1; i <= m; i++) { read(e[i].u), read(e[i].v), read(e[i].c); e[i].id = i; } sort(e + 1, e + 1 + m); for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= m; i++) { int p = find(e[i].u), t = find(e[i].v); if (p != t) { adj[e[i].u].emplace_back(e[i].v, e[i].c); adj[e[i].v].emplace_back(e[i].u, e[i].c); fa[p] = t; } else v.emplace_back(e[i]); } dfs(1, 0); for (int j = 1; j <= 19; j++) for (int i = 1; i <= n; i++) { f[i][j] = f[f[i][j - 1]][j - 1]; dis[i][j] = max(dis[i][j - 1], dis[f[i][j - 1]][j - 1]); } sort((v.begin()), (v.end()), [&](Edge x, Edge y) { return x.id < y.id; }); for (auto i : v) { int lca = LCA(i.u, i.v, 0); printf( %d n , max(LCA(i.u, lca, 1), LCA(i.v, lca, 1))); } } |
#include <bits/stdc++.h> const size_t max_vertices = 1 << 16; int degree[max_vertices], xor_sum[max_vertices]; std::queue<int> queue; std::vector<std::pair<int, int>> result; int main() { int vcount = 0; std::cin >> vcount; for (int i = 0; i < vcount; i++) { std::cin >> degree[i] >> xor_sum[i]; if (degree[i] == 1) { queue.push(i); } } while (!queue.empty()) { int cur = queue.front(); queue.pop(); int next = xor_sum[cur]; if (degree[cur] > 0 && degree[next] > 0) { result.push_back(std::make_pair(cur, next)); degree[next]--; degree[cur]--; xor_sum[next] ^= cur; } if (degree[next] == 1) { queue.push(next); } } std::cout << result.size() << std::endl; for (int i = 0; i < result.size(); i++) { std::cout << result[i].first << << result[i].second << std::endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long isPrime(long long x) { long long i, flag = 1; if (x == 0 || x == 1) { flag = 0; } for (i = 2; i <= sqrt(x); i++) { if (x % i == 0) { flag = 0; break; } } return flag; } long long fact(long long n) { long long ans = 1; for (long long i = 2; i <= n; i++) { ans *= i; } return ans; } const long long INF = 1e18; const long long N = 2 * 1e5; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); { long long n; cin >> n; if (n == 0) { cout << 1 << n ; return 0; } if (n % 4 == 1) { cout << 8 << n ; } else if (n % 4 == 2) { cout << 4 << n ; } else if (n % 4 == 3) { cout << 2 << n ; } else if (n % 4 == 0) { cout << 6 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[6], b[6], ord[6], c[6]; vector<pair<int, int> > v, nv; struct S { vector<pair<int, int> > v; int from; S(vector<pair<int, int> > v, int from) : v(v), from(from) {} S() {} }; vector<S> s; void pr(int a, int b) { if (a == 1) { printf( inc %d n , ord[b] + 1); } else { printf( dec %d n , ord[b] + 1); } } S hor, ver, res; bool invI, invJ; void _incI() { assert(ver.from < (int)ver.v.size()); res.v.push_back(ver.v[ver.from++]); } void _decI() { assert(ver.from > 0); pair<int, int> p = ver.v[--ver.from]; p.first = -p.first; res.v.push_back(p); } void _incJ() { assert(hor.from < (int)hor.v.size()); res.v.push_back(hor.v[hor.from++]); } void _decJ() { assert(hor.from > 0); pair<int, int> p = hor.v[--hor.from]; p.first = -p.first; res.v.push_back(p); } void decI() { if (invI) _incI(); else _decI(); } void incI() { if (invI) _decI(); else _incI(); } void decJ() { if (invJ) _incJ(); else _decJ(); } void incJ() { if (invJ) _decJ(); else _incJ(); } S merge() { res.v.clear(); res.from = 0; int i = ver.from; int j = hor.from; int n = (int)ver.v.size() + 1; int m = (int)hor.v.size() + 1; assert(i % 2 == j % 2); invI = invJ = false; if (i % 2 == 1) { for (int jj = j; jj >= 0; --jj) { if (jj & 1) { for (int _ = 0; _ < (int)(i); ++_) decI(); } else { for (int _ = 0; _ < (int)(i); ++_) incI(); } if (jj != 0) decJ(); else incI(); } for (int ii = i + 1; ii < n; ++ii) { if (ii & 1) { for (int _ = 0; _ < (int)(j); ++_) decJ(); } else { for (int _ = 0; _ < (int)(j); ++_) incJ(); } if (ii != n - 1) incI(); else incJ(); } for (int jj = j + 1; jj < m; ++jj) { if (jj & 1) { for (int _ = 0; _ < (int)(n - 1); ++_) incI(); } else { for (int _ = 0; _ < (int)(n - 1); ++_) decI(); } if (jj != m - 1) incJ(); } } else { if (i == n - 1) { i = 0; invI = true; } if (j == 0) { j = m - 1; invJ = true; } for (int _ = 0; _ < (int)(i); ++_) decI(); decJ(); for (int ii = 0; ii < (int)(i + 1); ++ii) { if (ii & 1) { for (int _ = 0; _ < (int)(j - 1); ++_) incJ(); } else { for (int _ = 0; _ < (int)(j - 1); ++_) decJ(); } incI(); } for (int jj = 0; jj < (int)(j + 1); ++jj) { if (jj & 1) { for (int _ = 0; _ < (int)(n - i - 2); ++_) decI(); } else { for (int _ = 0; _ < (int)(n - i - 2); ++_) incI(); } if (jj != j) incJ(); } if (j != m - 1) { incJ(); for (int jj = j + 1; jj < m; ++jj) { if (jj & 1) { for (int _ = 0; _ < (int)(n - 1); ++_) decI(); } else { for (int _ = 0; _ < (int)(n - 1); ++_) incI(); } if (jj != m - 1) incJ(); } } } return res; } int main() { cin >> n; for (int i = 0; i < (int)(n); ++i) cin >> a[i]; for (int i = 0; i < (int)(n); ++i) cin >> b[i]; if (n == 1) { if (a[0] == 2) { cout << Cycle << endl; if (b[0] == 1) { cout << inc 1 << endl; cout << dec 1 << endl; } else { cout << dec 1 << endl; cout << inc 1 << endl; } } else { if (b[0] == 1) { cout << Path << endl; for (int i = 0; i < (int)(a[0] - 1); ++i) { cout << inc 1 n ; } } else if (b[0] == a[0]) { cout << Path << endl; for (int i = 0; i < (int)(a[0] - 1); ++i) { cout << dec 1 n ; } } else { cout << No << endl; } } return 0; } for (int i = 0; i < (int)(n); ++i) ord[i] = i; for (int i = 0; i < (int)(n - 1); ++i) if (a[i] % 2 == 0) { swap(a[i], a[n - 1]); swap(b[i], b[n - 1]); swap(ord[i], ord[n - 1]); break; } if (a[n - 1] % 2 == 0) { for (int i = 0; i < (int)(n - 1); ++i) { nv.clear(); for (int j = 0; j < (int)(a[i]); ++j) { if (j & 1) { reverse(v.begin(), v.end()); for (pair<int, int> p : v) { nv.push_back(make_pair(-p.first, p.second)); } reverse(v.begin(), v.end()); } else { for (pair<int, int> p : v) { nv.push_back(p); } } if (j != a[i] - 1) { nv.push_back(make_pair(1, i)); } } v = nv; } nv.clear(); for (pair<int, int> p : v) { nv.push_back(p); } for (int i = 0; i < (int)(a[n - 1] - 1); ++i) { nv.push_back(make_pair(1, n - 1)); if (i & 1) { for (int j = 1; j < (int)v.size(); ++j) { nv.push_back(v[j]); } } else { for (int j = (int)v.size() - 1; j >= 1; --j) { nv.push_back(make_pair(-v[j].first, v[j].second)); } } } nv.push_back(make_pair(-v[0].first, v[0].second)); for (int i = 0; i < (int)(a[n - 1] - 1); ++i) { nv.push_back(make_pair(-1, n - 1)); } for (int i = 0; i < (int)(n); ++i) c[i] = 1; v = nv; int ind = 0; while (true) { bool ok = true; for (int j = 0; j < (int)(n); ++j) if (c[j] != b[j]) { ok = false; break; } if (ok) break; c[v[ind].second] += v[ind].first; ++ind; } printf( Cycle n ); for (int i = ind; i < (int)v.size(); ++i) { pr(v[i].first, v[i].second); } for (int i = 0; i < ind; ++i) { pr(v[i].first, v[i].second); } return 0; } int sum = 0; for (int i = 0; i < (int)(n); ++i) sum += b[i] - 1; if (sum % 2 == 1) { cout << No << endl; return 0; } cout << Path << endl; for (int i = 0; i < (int)(n); ++i) { vector<pair<int, int> > cur; for (int j = 0; j < (int)(a[i] - 1); ++j) { cur.push_back(make_pair(1, i)); } s.push_back(S(cur, b[i] - 1)); } while ((int)s.size() > 1) { bool done = false; for (int i = 0; i < (int)(s.size()); ++i) { for (int j = 0; j < (int)(i); ++j) { if ((s[i].from + s[j].from) % 2 == 0) { hor = s[i]; ver = s[j]; s[i] = merge(); swap(s[j], s.back()); s.pop_back(); done = true; break; } } if (done) { break; } } assert(done); } for (pair<int, int> p : s[0].v) { pr(p.first, p.second); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const int inf = -INF; const int N = 100005; const int M = 2005; const int mod = 1000000007; const double pi = acos(-1.0); int mp1[N], mp2[N]; int main() { int n, m; int d, p; char s[2]; scanf( %d %d , &n, &m); memset(mp1, 0, sizeof(mp1)); memset(mp2, 0, sizeof(mp2)); for (int i = 1; i <= n; i++) { scanf( %s %d %d , &s, &p, &d); if (s[0] == S ) mp1[p] += d; else mp2[p] += d; } int k = 0, t = 0; for (int it = 0; it < N, t < m; it++) { if (it > 100000) break; if (mp1[it] > 0) t++, k = it; } for (int j = k; j >= 0; j--) if (mp1[j] > 0) printf( S %d %d n , j, mp1[j]); t = 0; for (int it = N; it >= 0 && t < m; it--) { if (mp2[it] > 0) printf( B %d %d n , it, mp2[it]), t++; } } |
#include <bits/stdc++.h> using namespace std; char arr[300001]; int main(void) { int N; scanf( %d , &N); scanf( %s , arr); int i; char _max = 0; int idx = -1; for (i = 0; i < N; i++) { if (_max < arr[i]) { _max = arr[i]; idx = i; } if (idx != -1 && _max > arr[i]) { printf( YES n ); printf( %d %d n , idx + 1, i + 1); return 0; } } printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mo = 1000000007; const int Maxn = 1010; int f[110000], g[110000]; int a[Maxn * 2], b[Maxn * 2]; int sum[110000]; char st[Maxn]; int n, m, cnt; bool Check(int s) { for (int i = 0; i < n; ++i) if (a[s + i] != b[i]) return false; return true; } void Update(int &x, int y) { if (y < 0) y += mo; x += y; if (x >= mo) x -= mo; } int main() { scanf( %s , st); n = strlen(st); for (int i = 0; i < n; ++i) a[i] = st[i] - a ; for (int i = 0; i < n; ++i) a[i + n] = a[i]; scanf( %s , st); for (int i = 0; i < n; ++i) b[i] = st[i] - a ; scanf( %d , &m); sum[0] = 1; for (int i = 1; i <= m; ++i) sum[i] = (long long)sum[i - 1] * (n - 1) % mo; f[0] = 0; f[1] = 1; for (int i = 2; i <= m; ++i) { f[i] = sum[i - 1] - f[i - 1]; if (f[i] < 0) f[i] += mo; } g[0] = 1; g[1] = 0; for (int i = 2; i <= m; ++i) { g[i] = sum[i - 1] - g[i - 1]; if (g[i] < 0) g[i] += mo; } if (!m) { if (Check(0)) printf( 1 n ); else printf( 0 n ); return 0; } int ans = 0; if (Check(0)) Update(ans, g[m]); for (int i = 1; i < n; ++i) if (Check(i)) Update(ans, f[m]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int w = 1, s = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = 0; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = (s << 1) + (s << 3) + ch - 0 ; ch = getchar(); } return w ? s : -s; } const int N = 1001; struct point { int x, y, num; } p[N]; struct square { int x, y, r; } s[N]; int opp[N], bel[N]; bool num[N]; int n, m, k, ans; vector<int> f[N]; bool cmp1(point a, point b) { return a.x < b.x; } bool cmp2(square a, square b) { return a.x - a.r < b.x - b.r; } bool solve(int x) { if (x == 0) return 1; return 0; } void content() { n = read(), m = read(), k = read(); for (int i = 1; i <= n; i++) p[i].x = read(), p[i].y = read(), p[i].num = i; sort(p + 1, p + n + 1, cmp1); for (int i = 1; i <= n; i++) opp[p[i].num] = i; for (int i = 1; i <= m; i++) { s[i].r = read(); s[i].x = read(), s[i].y = read(); } sort(s + 1, s + m + 1, cmp2); for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { if (p[j].x < s[i].x - s[i].r) continue; if (p[j].x > s[i].x + s[i].r) break; int a = p[j].x, b = p[j].y, c = s[i].x, d = s[i].y; double lc = sqrt(pow((a - c), 2) + pow((b - d), 2)); if (lc < s[i].r) f[p[j].num].push_back(i); } } for (int i = 1; i <= k; i++) { int x = read(), y = read(); for (int j = 0; j < f[x].size(); j++) num[f[x][j]] = solve(num[f[x][j]]); for (int j = 0; j < f[y].size(); j++) num[f[y][j]] = solve(num[f[y][j]]); for (int j = 1; j <= m; j++) if (num[j]) ans++; printf( %d n , ans); ans = 0; memset(num, 0, sizeof(num)); } } int main() { content(); return 0; } |
#include <bits/stdc++.h> using namespace std; int k[3]; long long t[200000]; long long c[200000]; int n; long long T[3]; long long nt[200000]; multiset<long long> s; int main(void) { for (int i = 0; i < 3; i++) scanf( %d , &k[i]); for (int i = 0; i < 3; i++) scanf( %I64d , &T[i]); scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %I64d , &c[i]), nt[i] = c[i]; for (int i = 0; i < 3; i++) k[i] = min(k[i], n + 1); for (int step = 0; step < 3; step++) { s.clear(); for (int i = 0; i < k[step]; i++) { s.insert(0ll); } for (int i = 0; i < n; i++) t[i] = nt[i]; for (int i = 0; i < n; i++) { long long TM = max(*s.begin(), t[i]); nt[i] = TM + T[step]; s.erase(s.begin()); s.insert(nt[i]); } } long long ans = 0; for (int i = 0; i < n; i++) { ans = max(ans, nt[i] - c[i]); } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void print(T a) { for (auto x : a) cout << x << ; cout << n ; } void solve() { int n, m; cin >> n >> m; char a[n][m]; short down[n][m], up[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; down[i][j] = 0; up[i][j] = 0; } } short l[m], r[m]; for (int j = 0; j < m; j++) up[0][j] = 1; int ans = 0; for (int i = 1; i < n; i++) { for (int j = 0; j < m; j++) { if (j == 0 || (a[i][j - 1] != a[i][j])) l[j] = j; else l[j] = l[j - 1]; } for (int j = m - 1; j >= 0; j--) { if (j == m - 1 || (a[i][j + 1] != a[i][j])) r[j] = j; else r[j] = r[j + 1]; } for (int j = 0; j < m; j++) { int x = 1; if (a[i - 1][j] == a[i][j]) x = up[i - 1][j] + 1; x = min(x, j - l[j] + 1); x = min(x, r[j] - j + 1); up[i][j] = x; } } for (int j = 0; j < m; j++) down[n - 1][j] = 1; for (int i = n - 2; i >= 0; i--) { for (int j = 0; j < m; j++) { if (j == 0 || (a[i][j - 1] != a[i][j])) l[j] = j; else l[j] = l[j - 1]; } for (int j = m - 1; j >= 0; j--) { if (j == m - 1 || (a[i][j + 1] != a[i][j])) r[j] = j; else r[j] = r[j + 1]; } for (int j = 0; j < m; j++) { int x = 1; if (a[i + 1][j] == a[i][j]) x = down[i + 1][j] + 1; x = min(x, j - l[j] + 1); x = min(x, r[j] - j + 1); down[i][j] = x; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { short res = min(up[i][j], down[i][j]); ans += res; } } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; for (int i = 0; i < t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 30; const int p = 10000007; pair<long long, int> c[500005]; pair<long long, long long> sum[500005]; int id[500005]; long long a[500005], b[500005], ans[500005]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = (int)1; i <= (int)n; i++) { scanf( %I64d%I64d , &a[i], &b[i]); c[i] = make_pair(a[i] - b[i], i); } sort(c + 1, c + n + 1); for (int i = (int)1; i <= (int)n; i++) id[c[i].second] = i; sum[0] = make_pair(0, 0); sum[n + 1] = make_pair(0, 0); for (int i = (int)1; i <= (int)n; i++) sum[i].first = sum[i - 1].first + a[c[i].second]; for (int i = (int)n; i >= (int)1; i--) sum[i].second = sum[i + 1].second + b[c[i].second]; for (int i = (int)1; i <= (int)n; i++) ans[i] = a[i] * (n - id[i]) + b[i] * (id[i] - 1) + sum[id[i] - 1].first + sum[id[i] + 1].second; for (int times = (int)1; times <= (int)m; times++) { int x, y; scanf( %d%d , &x, &y); if (id[x] < id[y]) ans[x] -= a[x] + b[y], ans[y] -= a[x] + b[y]; else ans[x] -= a[y] + b[x], ans[y] -= a[y] + b[x]; } for (int i = (int)1; i <= (int)n; i++) printf( %I64d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; string s; cin >> s; while (b--) { for (int i = 0; i < a - 1; i++) { if (s[i] == B && s[i + 1] == G ) { int t; t = s[i]; s[i] = s[i + 1]; s[i + 1] = t; i++; } } } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; int abss(int n) { if (n < 0) return -n; else return n; } const int maxn = 3e5 + 10; int _min(int a, int b) { if (a < b) return a; else return b; } int _max(int a, int b) { if (a > b) return a; else return b; } char s[maxn]; int main() { int a, b, x; cin >> a >> b >> x; int w = _min(a, b); if (a > b) { int c0 = 0, c1 = 0; int tail = 0; printf( 0 ); c0++; for (int i = 1; i <= x - 1; i++) { if (i % 2 == 1) printf( 1 ), c1++, tail = 1; else printf( 0 ), c0++, tail = 0; } if (tail == 0 || x - 1 == 0) { int temp = a - c0; while (temp--) printf( 0 ); temp = b - c1; while (temp--) printf( 1 ); } else { int temp = b - c1; while (temp--) printf( 1 ); temp = a - c0; while (temp--) printf( 0 ); } printf( n ); } else { int c0 = 0, c1 = 0; printf( 1 ); c1++; int tail = 1; for (int i = 1; i <= x - 1; i++) { if (i % 2 == 1) printf( 0 ), c0++, tail = 0; else printf( 1 ), c1++, tail = 1; } if (tail == 0 && x - 1 != 0) { int temp = a - c0; while (temp > 0) printf( 0 ), temp--; temp = b - c1; while (temp > 0) printf( 1 ), temp--; } else { int temp = b - c1; while (temp > 0) printf( 1 ), temp--; temp = a - c0; while (temp > 0) printf( 0 ), temp--; } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int a, b, c, d, m, v; cin >> a >> b >> c >> d; m = max((3 * a) / 10, a - (a / 250) * c); v = max((3 * b) / 10, b - (b / 250) * d); if (m > v) cout << Misha ; else if (v > m) cout << Vasya ; else cout << Tie ; return 0; } |
#include <bits/stdc++.h> using namespace std; int nn[2000000]; int ans[2000000]; string ss; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> nn[i]; int se = 0, en = n - 1; int noa = 0; ans[noa] = 0; while ((nn[se] > ans[noa] || nn[en] > ans[noa]) && en != se) { if (nn[se] > ans[noa] && nn[se] < nn[en]) { ans[++noa] = nn[se]; se++; ss.append( L ); } else if (nn[en] > ans[noa]) { ans[++noa] = nn[en]; en--; ss.append( R ); } else { ans[++noa] = nn[se]; se++; ss.append( L ); } } if (en == se) if (nn[se] > ans[noa]) { noa++; ss.append( L ); } cout << noa << endl; cout << ss << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 355001; const int SQRTN = 320; const int LOGN = 20; const long double PI = acos(-1); const long double TAU = 2 * PI; int n, a[N], idx[N], last, m, an[N]; long long ans; signed main() { cin >> n >> m; for (int i = 1; i <= n; i++) { scanf( %d , a + i); idx[a[i]] = i; an[i] = n + 1; } for (int j = 0, x, y; j < m; j++) { scanf( %d%d , &x, &y); if (idx[x] > idx[y]) swap(x, y); an[idx[x]] = min(an[idx[x]], idx[y]); } int x = n + 1; ans = -(n * 1ll * (n + 1)) >> 1; for (int i = n; i > 0; i--) x = min(x, an[i]), ans += x; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; void propagate(int node, const map<int, set<int> >& idToChildren, set<int>& leaves) { map<int, set<int> >::const_iterator it = idToChildren.find(node); if (it == idToChildren.end()) { leaves.insert(node); return; } const set<int>& s = (*it).second; for (set<int>::const_iterator cit = s.begin(); cit != s.end(); ++cit) { propagate(*cit, idToChildren, leaves); } } int main() { int n; cin >> n; int f[n + 1]; char visited[n + 1]; char inLoop[n + 1]; int tag[n + 1]; char hasParent[n + 1]; char hasChild[n + 1]; for (int i = 1; i <= n; i++) { cin >> f[i]; visited[i] = inLoop[i] = 0; tag[i] = i; hasParent[i] = hasChild[i] = 0; } for (int i = 1; i <= n; i++) { if (visited[i]) continue; bool found = false; set<int> traversed; visited[i] = 1; traversed.insert(i); int x = i; int confluence = -1; while (1) { int xTemp = f[x]; if (inLoop[xTemp]) { f[x] = tag[xTemp]; break; } else if (traversed.find(xTemp) != traversed.end()) { found = true; confluence = xTemp; break; } else if (visited[xTemp]) { break; } else { x = xTemp; visited[x] = 1; traversed.insert(x); } } if (found) { int y = confluence; do { tag[y] = confluence; inLoop[y] = 1; y = f[y]; } while (y != confluence); } } map<int, set<int> > idToChildren; map<int, set<int> > rootToLeaves; for (int i = 1; i <= n; i++) { if (inLoop[i]) continue; hasParent[i] = hasChild[f[i]] = 1; idToChildren[f[i]].insert(i); } set<int> roots; set<int> leaves; for (int i = 1; i <= n; i++) { if (tag[i] != i) continue; if (!hasParent[i]) { roots.insert(i); } if (!hasChild[i]) { leaves.insert(i); } } for (set<int>::const_iterator it = roots.begin(); it != roots.end(); ++it) { propagate(*it, idToChildren, rootToLeaves[*it]); } if (leaves.size() == 1 && *leaves.begin() == *roots.begin()) { cout << 0 << endl; return 0; } cout << leaves.size() << endl; int firstRoot = *roots.begin(); int prevRoot = firstRoot; { set<int>::const_iterator it = roots.begin(); advance(it, 1); for (; it != roots.end(); ++it) { for (set<int>::const_iterator lit = rootToLeaves[*it].begin(); lit != rootToLeaves[*it].end(); ++lit) { cout << prevRoot << << *lit << endl; } prevRoot = *it; } } for (set<int>::const_iterator it = rootToLeaves[firstRoot].begin(); it != rootToLeaves[firstRoot].end(); ++it) { cout << prevRoot << << *it << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i = 0; cin >> n; for (i = n + 1; i <= (2 * n); i++) cout << i << ; return (0); } |
#include <bits/stdc++.h> using namespace std; const int N = 600010, inf = N; int n, m; int head[N], cnt = 1; struct edge { int to, next; } e[N << 1]; void adde(int a, int b) { e[++cnt].to = b; e[cnt].next = head[a]; head[a] = cnt; } int nxt[N], st[N], vis[N], top, mn, mx, in[N]; void dfs(int k, int fa) { vis[k] = 1; st[++top] = k; for (int i = head[k]; i; i = e[i].next) { int v = e[i].to; if (v == fa) continue; if (!vis[v]) dfs(v, k); else if (!in[v]) { mx = 0; mn = inf; while (top) { mx = max(st[top], mx); mn = min(mn, st[top]); in[st[top]] = 1; top--; if (st[top + 1] == v) break; } nxt[mn] = min(nxt[mn], mx); } } if (!in[k]) top--; } long long sum[N]; int main() { scanf( %d%d , &n, &m); int u, v, q; for (int i = 1; i <= m; i++) { scanf( %d%d , &u, &v); adde(u, v); adde(v, u); } for (int i = 1; i <= n + 1; i++) nxt[i] = n + 1; for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i, 0); for (int i = n; i; i--) nxt[i] = min(nxt[i + 1], nxt[i]); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + nxt[i]; scanf( %d , &q); int L, R; while (q--) { scanf( %d%d , &L, &R); int l = L, r = R, res = L - 1; while (l <= r) { int mid = l + r >> 1; if (nxt[mid] > R) r = mid - 1; else l = mid + 1, res = mid; } printf( %lld n , 1ll * (R - res) * (R - res + 1) / 2 + sum[res] - sum[L - 1] - 1ll * (res + L) * (res - L + 1) / 2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s1, s2; cin >> s1 >> s2; int a, b, c, d; a = s1[0] - 0 ; b = s1[1] - 0 ; c = s2[1] - 0 ; d = s2[0] - 0 ; vector<int> v1({a, b, c, d}); map<vector<int>, int> mp; mp[{a, b, c, d}] = 1; n--; while (n--) { string s; cin >> s; cin >> s1 >> s2; a = s1[0] - 0 ; b = s1[1] - 0 ; c = s2[1] - 0 ; d = s2[0] - 0 ; vector<int> v1({a, b, c, d}); vector<int> v2({b, c, d, a}); vector<int> v3({c, d, a, b}); vector<int> v4({d, a, b, c}); if (mp.find({a, b, c, d}) != mp.end()) { continue; } else if (mp.find({b, c, d, a}) != mp.end()) { continue; } else if (mp.find({c, d, a, b}) != mp.end()) { continue; } else if (mp.find({d, a, b, c}) != mp.end()) { continue; } else mp[{a, b, c, d}] = 1; } cout << mp.size() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; long long t, j = 0; cin >> t; cin >> s; for (long long i = 0; i < s.size(); i++) { if (s[i] == F ) if (s[i + 1] == S ) j--; if (s[i] == S ) if (s[i + 1] == F ) j++; } if (j <= 0) cout << NO ; else if (j > 0) cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; char g[3010][3010]; long long dp[2][3010][3010]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i < n + 1; i++) scanf( %s , g[i] + 1); if (g[1][2] == . ) dp[0][1][2] = 1; if (g[2][1] == . ) dp[1][2][1] = 1; for (int i = 1; i < n + 1; i++) for (int j = 1; j < m + 1; j++) { if (g[i][j] == . ) { for (int z = 0; z < 2; z++) dp[z][i][j] = (dp[z][i][j] + dp[z][i - 1][j] + dp[z][i][j - 1]) % 1000000007LL; } } printf( %lld n , (((dp[0][n - 1][m] * dp[1][n][m - 1] - dp[0][n][m - 1] * dp[1][n - 1][m]) % 1000000007LL) + 1000000007LL) % 1000000007LL); return 0; } |
#include <bits/stdc++.h> using namespace std; int mas[1010][1010]; int mas1[1001][1001]; bool check(int i, int j) { return mas[i][j] && mas[i + 1][j] && mas[i + 2][j] && mas[i + 2][j + 1] && mas[i + 2][j + 2] && mas[i + 1][j + 2] && mas[i][j + 2] && mas[i][j + 1]; } void draw(int i, int j) { mas1[i][j] = mas1[i + 1][j] = mas1[i + 2][j] = mas1[i + 2][j + 1] = mas1[i + 2][j + 2] = mas1[i + 1][j + 2] = mas1[i][j + 2] = mas1[i][j + 1] = 1; } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { char temp; cin >> temp; if (temp == # ) mas[i][j] = 1; else mas[i][j] = 0; } for (int i = 1; i <= n - 2; ++i) for (int j = 1; j <= m - 2; ++j) { if (check(i, j)) draw(i, j); } bool f = 1; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { if (mas[i][j] && !mas1[i][j]) f = 0; } if (f) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2004; int pa[N]; int n, m, x, y, op, pos = 1, ans = 0; pair<int, int> p[N]; bool b[N]; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n * 2; i++) { scanf( %d , &p[i].first); p[i].second = i; } for (int i = 0; i < m; i++) { scanf( %d %d , &x, &y); pa[x] = y; pa[y] = x; } sort(p + 1, p + 2 * n + 1, greater<pair<int, int> >()); scanf( %d , &op); for (int i = 1; i <= n; i++) { if (op == 1) { bool g = 0; for (int i = pos; i <= 2 * n; i++) if (!b[p[i].second] && pa[p[i].second] != 0) { ans = p[i].second; g = 1; break; } if (!g) { for (; pos <= 2 * n && b[p[pos].second]; ++pos) ; ans = p[pos].second; } b[ans] = 1; cout << ans << endl; scanf( %d , &x); b[x] = 1; } else { scanf( %d , &x); b[x] = 1; if (pa[x] == 0 || b[pa[x]]) { bool g = 0; for (int i = pos; i <= 2 * n; i++) if (!b[p[i].second] && pa[p[i].second] != 0) { ans = p[i].second; g = 1; break; } if (!g) { for (; pos <= 2 * n && b[p[pos].second]; ++pos) ; ans = p[pos].second; } } else { ans = pa[x]; b[pa[x]] = 1; } b[ans] = 1; cout << ans << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> segs; int numNeg = 0; int curLen = 0; for (int i = 0; i < n; i++) { int a; scanf( %d , &a); if (a < 0) { if (numNeg == 2) { segs.push_back(curLen); curLen = 1; numNeg = 1; } else { numNeg += 1; curLen += 1; } } else { curLen += 1; } } if (curLen != 0) { segs.push_back(curLen); } printf( %d n , segs.size()); for (int s : segs) { printf( %d , s); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000, INF = 2000000000; struct edge { int x; int y; int w; int o; }; vector<vector<edge> > G(MAXN + 1); int n, m, depth[MAXN + 1], low[MAXN + 1], s, t, previous[MAXN + 1], prevCost[MAXN + 1], cntEdges[MAXN + 1][MAXN + 1], c, sons[MAXN + 1], p1 = -1, p2; bool vis[MAXN + 1]; edge removedEdge = {0, 0, 0, -1}, e1, e2, prevEdge[MAXN + 1]; vector<edge> edgesOnPath, currentPath, allEdges; bool eq(edge a, edge b) { return a.w == b.w && min(a.x, a.y) == min(b.x, b.y) && max(a.x, a.y) == max(b.x, b.y); } void redo() { memset(prevCost, 0, sizeof(prevCost)); memset(previous, 0, sizeof(previous)); memset(vis, 0, sizeof(vis)); memset(depth, 0, sizeof(depth)); memset(low, 0, sizeof(low)); memset(sons, 0, sizeof(sons)); currentPath.clear(); } bool isBridge(edge e) { if (cntEdges[e.x][e.y] == 1) { if (low[e.x] > depth[e.y] || low[e.y] > depth[e.x]) return true; } else { if (cntEdges[e.x][e.y] != 2) return false; if (min(removedEdge.x, removedEdge.y) != min(e.x, e.y) || max(removedEdge.x, removedEdge.y) != max(e.x, e.y)) return false; if (low[e.x] > depth[e.y] || low[e.y] > depth[e.x]) return true; } return false; } int getEdgeOrder(edge e) { for (int i = 0; i < allEdges.size(); i++) if (eq(e, allEdges[i]) == true && (i + 1 != p1)) return i + 1; } void dfs(int node) { vis[node] = true; for (int i = 0; i < G[node].size(); i++) { int nextNode = G[node][i].y; if (G[node][i].o != removedEdge.o) { if (vis[nextNode] == false) { sons[node]++; depth[nextNode] = depth[node] + 1; low[nextNode] = depth[nextNode]; previous[nextNode] = node; prevCost[nextNode] = G[node][i].w; prevEdge[nextNode] = G[node][i]; dfs(nextNode); low[node] = min(low[node], low[nextNode]); } else { if (previous[node] != nextNode) low[node] = min(low[node], low[nextNode]); } } } } void findPath(int x, int y, vector<edge> &e) { int node = t; while (node != x) { e.push_back(prevEdge[node]); node = previous[node]; } } int answer = -1; void solve() { if (m == 0) { cout << 0 << endl << 0; return; } dfs(s); if (vis[t] == false) { cout << 0 << endl << 0; return; } findPath(s, t, edgesOnPath); for (int i = 0; i < edgesOnPath.size(); i++) if (isBridge(edgesOnPath[i]) == true) { if (answer == -1 || answer > edgesOnPath[i].w) { answer = edgesOnPath[i].w; c = 1; e1 = edgesOnPath[i]; } } for (int i = 0; i < edgesOnPath.size(); i++) { removedEdge = edgesOnPath[i]; redo(); dfs(s); if (vis[t] == true) findPath(s, t, currentPath); for (int j = 0; j < currentPath.size(); j++) if (isBridge(currentPath[j]) == true) { if (answer == -1 || removedEdge.w + currentPath[j].w < answer) { answer = removedEdge.w + currentPath[j].w; c = 2; e1 = removedEdge; e2 = currentPath[j]; } } } cout << answer << endl; if (c != 0) cout << c << endl; if (c == 1) cout << e1.o; if (c == 2) { cout << e2.o << << e1.o; } } void readData() { scanf( %d %d %d %d , &n, &m, &s, &t); for (int i = 1; i <= m; i++) { int x, y, w; scanf( %d %d %d , &x, &y, &w); allEdges.push_back({min(x, y), max(x, y), w, i}); if (x != y) { cntEdges[x][y]++; cntEdges[y][x]++; G[x].push_back({x, y, w, i}); G[y].push_back({y, x, w, i}); G[x][G[x].size() - 1].o = i; G[y][G[y].size() - 1].o = i; } } } int main() { readData(); solve(); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.