func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> const int MOD = 1000000007; const int MAX = 10000005; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); long long n; cin >> n; long long b, d; long long max = -1; long long y = 0; vector<pair<long long, long long> > vecx, vecy; for (long long i = 0; i < n; i++) { cin >> b >> d; vecx.push_back(make_pair(b, d)); vecy.push_back(make_pair(d, b)); } sort(vecx.begin(), vecx.end()); sort(vecy.begin(), vecy.end()); long long pointer1 = 0; long long pointer2 = 0; long long sum = 0; for (long long i = 0; i < 2 * vecx.size(); i++) { if (pointer1 == vecx.size() || pointer2 == vecx.size()) { goto ab; } if (vecx[pointer1].first < vecy[pointer2].first) { sum++; if (sum > max) { max = sum; y = vecx[pointer1].first; } pointer1++; } else if (vecx[pointer1].first > vecy[pointer2].first) { sum--; pointer2++; } else { sum--; pointer2++; } } ab:; cout << y << << max << ; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long N = 2e5 + 10, alp = 26; const long double pi = 3.14159265358979; void solve() { long long n, m; cin >> n >> m; vector<vector<long long> > g1(n), rg1(n), g2(n), rg2(n); for (long long i = 0; i < m; ++i) { long long u, v, t; cin >> u >> v >> t; --u; --v; if (t) g1[u].push_back(v), rg1[v].push_back(u); else g2[u].push_back(v), rg2[v].push_back(u); } vector<long long> ans(n, -1), len(n, -1); ans[n - 1] = 0; len[n - 1] = 0; queue<long long> q; q.push(n - 1); while (q.size()) { long long u = q.front(); q.pop(); set<long long> s1, s2; for (long long to : rg1[u]) if (ans[to] == 1 && len[to] == -1) len[to] = len[u] + 1, q.push(to); for (long long to : rg2[u]) if (ans[to] == 2 && len[to] == -1) len[to] = len[u] + 1, q.push(to); for (long long to : rg1[u]) if (ans[to] == -1) s1.insert(to); for (long long to : rg2[u]) if (ans[to] == -1) s2.insert(to); for (long long x : s1) if (!s2.count(x)) ans[x] = 2; for (long long x : s2) if (!s1.count(x)) ans[x] = 1; for (long long x : s1) if (s2.count(x) && len[x] == -1) ans[x] = 1, len[x] = len[u] + 1, q.push(x); } cout << len[0] << n ; for (long long i = 0; i < n; ++i) cout << (ans[i] == 1 ? 1 : 0); } int32_t main() { ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0); long long t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int maxn = 212345; int n, a[maxn], f[maxn], pre[maxn]; vector<int> b; int F(int x) { return x == f[x] ? x : f[x] = F(f[x]); } inline void U(int a, int b) { f[min(F(a), F(b))] = max(F(a), F(b)); } inline void go(int l, int r) { for (int i = l, j;; i = j) { j = F(i) + 1; if (j > r) return; U(i, j); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) b.push_back(a[i]); for (int i = 1; i <= n; ++i) f[i] = i; sort(b.begin(), b.end()); b.erase(unique(b.begin(), b.end()), b.end()); for (int i = 1; i <= n; ++i) a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin(); for (int i = 1; i <= n; ++i) { if (pre[a[i]]) go(pre[a[i]], i); pre[a[i]] = i; } long long res = 1, cnt = 0; for (int i = 1; i <= n; ++i) if (F(i) == i) { if (cnt) res = (res + res) % mod; ++cnt; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, y, a[(int)1e5 + 4]; unsigned long long x, sum; void error() { puts( -1 ); exit(0); } int main() { scanf( %d%I64d%d , &n, &x, &y); sum = (unsigned long long)n; if (n > y || (n == y && sum < x)) error(); for (int i = 0; i < n; i++) a[i] = 1; a[n - 1] += (y - n); if (sum - 1LL + (unsigned long long)a[n - 1] * (unsigned long long)a[n - 1] < x) error(); for (int i = 0; i < n; i++) printf( %d n , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long counter; long long n, r, l, x; vector<long long> a; long long sum, rr; bool cheake(long long mask) { long long nmax = -1; long long nmin = 10000000000; long long i = 0; rr = 0; sum = 0; while ((mask >> i) != 0) { if ((mask >> i) % 2 == 1) { rr++; sum = sum + a[i]; nmax = max(a[i], nmax); nmin = min(a[i], nmin); } i++; } if ((rr >= 2) && (sum >= l) && (sum <= r) && (nmax - nmin) >= x) return true; else return false; } void solv(long long i, long long mask) { if (i == n) return; solv(i + 1, mask); long long nmask = mask | (1 << i); solv(i + 1, nmask); if (cheake(nmask)) counter++; } int main() { long long k; cin >> n >> l >> r >> x; for (long long i = 0; i < n; i++) { cin >> k; a.push_back(k); } solv(0, 0); cout << counter; } |
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<stack> #include<queue> #include<set> #include<map> //#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 1e5+5; const int inf = 0x3f3f3f3f; const ll INF = 1e18; const ll mod = 998244353; #define for1(i,n) for(int i=1;i<=n;i++) #define forn(i,n) for(int i=0;i<n;i++) #define m_p(x,y) make_pair(x,y) inline int read(){//ll?? int x=0,f=1;char ch=getchar(); while(ch< 0 ||ch> 9 ){if(ch== - )f=-1;ch=getchar();} while(ch>= 0 &&ch<= 9 ){x=x*10+ch- 0 ;ch=getchar();} return x*f; } int main(){ int t=read(); while(t--){ int x=read(), y=read(); if(abs(x-y)<=1) cout << x+y << endl; else cout << x+y+abs(x-y)-1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p, s; vector<int> v1, v2; pair<int, pair<int, int>> arr[3005]; bool cmp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) { if (a.second.first == b.second.first) return a.second.second < b.second.second; return a.second.first > b.second.first; } int dp[3005][3005]; int solve(int x, int taken) { if (x == n) { if (taken == p) return 0; return -1e9; } int &ret = dp[x][taken]; if (ret != -1) return ret; ret = 0; if (taken < p) { ret = max(ret, arr[x].second.second + solve(x + 1, taken + 1)); } int lef = min(s, x - taken); if (lef < s) { ret = max(ret, arr[x].second.first + solve(x + 1, taken)); } ret = max(ret, solve(x + 1, taken)); return ret; } void trace(int x, int taken) { if (x == n) return; int &ret = dp[x][taken]; if (taken < p && ret == arr[x].second.second + solve(x + 1, taken + 1)) { v2.push_back(arr[x].first); trace(x + 1, taken + 1); return; } int lef = min(s, x - taken); if (lef < s) { if (ret == arr[x].second.first + solve(x + 1, taken)) { v1.push_back(arr[x].first); trace(x + 1, taken); return; } } trace(x + 1, taken); } int main() { cin >> n >> p >> s; swap(p, s); for (int i = 0; i < n; i++) { cin >> arr[i].second.first; arr[i].first = i + 1; } for (int i = 0; i < n; i++) { cin >> arr[i].second.second; } sort(arr, arr + n, cmp); memset(dp, -1, sizeof dp); cout << solve(0, 0) << n ; trace(0, 0); for (auto i : v1) cout << i << ; cout << n ; for (auto i : v2) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = (int)1e5 + 100; const int MAX = (int)1e5 + 1; int l[maxN], d[maxN], cnt[maxN], q[maxN]; vector<int> pool[maxN]; multiset<int> p; void solveTask() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> l[i]; for (int i = 1; i <= n; ++i) cin >> d[i]; for (int i = 1; i <= n; ++i) q[l[i]] += d[i], cnt[l[i]] += 1, pool[l[i]].push_back(d[i]); int answer = 0; int all_sum = 0; for (int i = 1; i <= MAX; ++i) { if (cnt[i] == 0) continue; int possibleCnt = cnt[i] - 1; int cur_sum = 0; for (set<int>::iterator it = p.begin(); it != p.end(); ++it) { if (possibleCnt == 0) break; cur_sum -= *it; --possibleCnt; } answer = max(answer, cur_sum + q[i]); all_sum += q[i]; for (int j = 0; j < pool[i].size(); ++j) { p.insert(-pool[i][j]); } } cout << all_sum - answer << endl; } int main() { solveTask(); ios_base::sync_with_stdio(false); return 0; } |
#include <bits/stdc++.h> using namespace std; long long get(long long n) { for (long long i = 2; i * i <= n; ++i) if (n % i == 0) return i; return n; } int main() { long long n; scanf( %lld , &n); long long cnt = 0; if (n % 2 != 0) { n -= get(n); ++cnt; } printf( %lld n , cnt + n / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, x, m = 0; char a[1000]; int s[26]; cin >> n; while (n--) { cin >> a; m = 0; int mi = 1000, mx = -1; for (i = 0; i < 26; i++) { s[i] = 0; } x = strlen(a); for (i = 0; i < x; i++) { s[a[i] - a ]++; mi = min(mi, (a[i] - a )); mx = max(mx, (a[i] - a )); } for (i = 0; i < 26; i++) { if (s[i] > 1) { cout << No << endl; m = 1; break; } } for (i = mi; i <= mx; i++) { if (s[i] != 1 && m != 1) { cout << No << endl; m = 1; break; } } if (m == 0) cout << Yes << endl; } } |
#include <bits/stdc++.h> using namespace std; long long int ar[500009], br[500009]; int main() { long long int a, b, c, i, j = 0, k = 9999999999999; string s; cin >> a; getchar(); cin >> s; for (i = 0; i < a; i++) { cin >> ar[i]; } for (i = 0; i < a - 1; i++) { if (s[i] == R && s[i + 1] == L ) { k = min(k, (ar[i + 1] - ar[i])); } } if (k == 9999999999999) { cout << -1 ; } else cout << (k / 2) << endl; } |
#include <bits/stdc++.h> #pragma diag_suppress 177 using namespace std; const int MM = 220000; int m, n, k, p1, p2, p3, f, a[MM], pr[MM], af[MM], tree[4 * MM]; string s, s1, s2; int MINN = 0; int func(int aa, int bb) { return (aa | bb); } void build(int node, int start, int end) { if (start == end) tree[node] = a[start]; else { int mid = (start + end) / 2; build(2 * node, start, mid); build(2 * node + 1, mid + 1, end); tree[node] = func(tree[2 * node], tree[2 * node + 1]); } } int query(int node, int start, int end, int l, int r) { if (r < start or end < l) return MINN; if (l <= start and end <= r) return tree[node]; int mid = (start + end) / 2; int px1 = query(2 * node, start, mid, l, r); int px2 = query(2 * node + 1, mid + 1, end, l, r); return func(px1, px2); } bool chk(int hi, int mid, int val) { return (query(1, 0, n - 1, mid, hi) > val); } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); int cur; priority_queue<pair<int, int> > pq; vector<int> ind; for (int i = 0; i < n; i++) { cur = i; while (!ind.empty() && a[ind.back()] <= a[i]) { cur = pr[ind.back()]; ind.pop_back(); } pr[i] = cur; ind.push_back(i); } ind.clear(); for (int i = n - 1; i >= 0; i--) { cur = i; while (!ind.empty() && a[ind.back()] < a[i]) { cur = af[ind.back()]; ind.pop_back(); } af[i] = cur; ind.push_back(i); } long long ans = 0; build(1, 0, n - 1); int ls, rs, hi, lo, mid, xx, yy; for (int i = 0; i < n; i++) { ls = i - pr[i] + 1; rs = af[i] - i + 1; hi = i; lo = pr[i]; while (hi > lo) { mid = (hi + lo) / 2; if (chk(i, mid, a[i])) lo = mid + 1; else hi = mid; } xx = i - lo + 1; ans += (long long)ls * (long long)rs; hi = af[i]; lo = i; while (hi > lo) { mid = (hi + lo) / 2; if (chk(mid, i, a[i])) hi = mid; else lo = mid + 1; } if (chk(lo, i, a[i])) lo--; yy = lo - i + 1; ans -= (long long)xx * (long long)yy; } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5; const int INF = 1e9 + 9; const int B = 1e9 + 7; long long n; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; long long pwr = 1; for (;;) { long long x = (n + (pwr - 1)) / pwr; if (n % pwr != 0) { cout << x << n ; return 0; } if (x == 1) { cout << x << n ; return 0; } if (x == 2 && pwr * 3 < n) { cout << x << n ; return 0; } pwr *= 3; } assert(0); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { int n; long long a = 0, b; cin >> n; b = pow(2, n); for (int i = 1; i < n / 2; i++) b += pow(2, i); for (int i = n / 2; i < n; i++) a += pow(2, i); cout << abs(b - a) << endl; } } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; if (b == 0) return a; if (a == b) return a; if (a > b) return gcd(a - b, b); return gcd(a, b - a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { int a, h, sum = 0; cin >> a; for (int i = 2; i < a; i++) { int n = a; while (n >= i) { sum += n % i; n = n / i; } sum += n; } h = gcd(sum, a - 2); cout << sum / h << / << (a - 2) / h << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int i, arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; int ap{0}, bp{n}, asize{arr[0]}, bsize{}, moves{1}, left = n - 1; bool a = 1; while (left != 0) { if (a) { while (bsize <= asize && left != 0) { bsize += arr[bp - 1]; bp--; left--; } moves++; asize = 0; a = 0; } else { while (asize <= bsize && left != 0) { asize += arr[ap + 1]; ap++; left--; } moves++; bsize = 0; a = 1; } } cout << moves << ; asize = 0; for (i = 0; i <= ap; i++) asize += arr[i]; cout << asize << ; bsize = 0; for (; i < n; i++) bsize += arr[i]; cout << bsize << endl; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long int; ll hell = 998244353; int main() { ll n; cin >> n; vector<ll> v[n]; for (ll i = 0; i < n; ++i) { ll x; cin >> x; for (ll j = 0; j < x; ++j) { ll y; cin >> y; v[i].push_back(y); } v[i].push_back(100009); sort(v[i].begin(), v[i].end()); } ll ans = 0; for (ll i = 0; i < n; ++i) { ll e = (i != 0) ? i - 1 : n - 1; ll f = (i != n - 1) ? i + 1 : 0; for (ll j = 1; j < v[i].size() - 1; ++j) { ll v1 = v[i][j]; ll v2 = v[i][j - 1]; ll c1 = lower_bound(v[e].begin(), v[e].end(), v1) - lower_bound(v[e].begin(), v[e].end(), v2); ll c2 = lower_bound(v[f].begin(), v[f].end(), v1) - lower_bound(v[f].begin(), v[f].end(), v2); if (c1 != c2) ans++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; bool f = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48); if (f) x = -x; } template <typename F> inline void write(F x) { static short st[30]; short tp = 0; if (x < 0) putchar( - ), x = -x; do st[++tp] = x % 10, x /= 10; while (x); while (tp) putchar( 0 | st[tp--]); putchar( n ); } template <typename T> inline void Mx(T &x, T y) { x < y && (x = y, 0); } template <typename T> inline void Mn(T &x, T y) { x > y && (x = y); } const int N = 2005; int m, n; double f[N][N]; int main() { read(n), read(m); int mx = max(n, m); for (int i = 0; i <= mx; i++) f[i][0] = 1; for (int i = 1; i <= mx; i++) f[0][i] = 1.0 / (i + 1); for (int i = 2; i <= n + m; i++) { for (int j = 1; j < i; j++) { if (i - j < 1) continue; int x = j, y = i - j; double inv = 1.0 / (y + 1); double c = inv * y * (1 - f[y - 1][x]), b = (1 - f[y][x - 1]); double d = c + inv; double p = (1.0 - b) / (1 - c + d - b); f[x][y] = p * c + (1 - p); } } printf( %.9lf %.9lf n , f[n][m], 1 - f[n][m]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, ns[10005] = {}; cin >> n; for (int i = 0; i < n; i++) { cin >> a; ns[a]++; } int ans = 0; for (int i = 0; i < 10000; i++) { int j = i + 1; while (ns[i] > 1) { for (; j < 10000 && ns[j] != 0; j++) ; ns[j]++; ns[i]--; ans += j - i; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string c = ; string t = ; cin >> t >> c; char lt = t[0]; int nt = int(t[1]) - 48; char lc = c[0]; int nc = int(c[1]) - 48; int cnt = 16; vector<pair<char, int> > torre; vector<pair<char, int> > caballo; for (int i = -2; i <= 2; i += 4) { for (int j = -1; j <= 1; j += 2) { char x = lt + i; int y = nt + j; char xx = lt + j; int yy = nt + i; if (int(x) < 105 && int(x) > 96 && y < 9 && y > 0) { cnt++; torre.push_back(make_pair(x, y)); } if (int(xx) < 105 && int(xx) > 96 && yy < 9 && yy > 0) { cnt++; torre.push_back(make_pair(xx, yy)); } } } for (int i = -2; i <= 2; i += 4) { for (int j = -1; j <= 1; j += 2) { char x = lc + i; int y = nc + j; char xx = lc + j; int yy = nc + i; if (int(x) < 105 && int(x) > 96 && y < 9 && y > 0 && x != lt && y != nt) { cnt++; caballo.push_back(make_pair(x, y)); } if (int(xx) < 105 && int(xx) > 96 && yy < 9 && yy > 0 && xx != lt && yy != nt) { cnt++; caballo.push_back(make_pair(xx, yy)); } } } for (int i = 0; i < torre.size(); i++) { for (int j = 0; j < caballo.size(); j++) { if (torre[i].first == caballo[j].first && torre[i].second == caballo[j].second) cnt--; } } cout << 64 - cnt << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read(int f = 1, int x = 0, char ch = ) { while (!isdigit(ch = getchar())) if (ch == - ) f = -1; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f * x; } const int N = 1e5 + 5, oo = 1e9 + 7; int n, m, a[N], ans[N], b[N], f[N], g[N], l[N], p[N], vis[N]; int get(int i, int x) { int j = lower_bound(b + 1, b + 1 + m, x) - b - 1; return vis[j] = 1, ans[i] = b[j]; } int main() { n = read(); for (int i = 1; i <= n; ++i) a[i] = read(), f[i] = oo; ++n, a[n] = f[n] = oo; m = read(); for (int i = 1; i <= m; ++i) b[i] = read(); sort(b + 1, b + 1 + m); for (int i = 1; i <= n; ++i) if (~a[i]) { int j = lower_bound(f + 1, f + 1 + n, a[i]) - f - 1; l[i] = j + 1, f[j + 1] = a[i], p[i] = g[j], g[j + 1] = i; } else for (int j = n, k = m; k; f[j + 1] = b[k], g[j + 1] = i, --k) for (; f[j] >= b[k]; --j) ; for (int i = l[n], j = n, x = a[n]; i; --i) if (~a[j]) ~a[p[j]] ? x = a[p[j]] : x = get(p[j], x), j = p[j]; else { bool flg = false; for (int k = j - 1; k && !flg; --k) if (~a[k] && l[k] == i - 1 && a[k] < x) x = a[j = k], flg = true; for (int k = j - 1; k && !flg; --k) if (!~a[k]) x = get(j = k, x), flg = true; } for (int i = 1; i < n; ++i) if (ans[i]) a[i] = ans[i]; for (int i = 1, j = 1; i < n; ++i) if (!~a[i]) { for (; vis[j]; ++j) ; vis[j] = 1, a[i] = b[j]; } for (int i = 1; i < n; ++i) printf( %d , a[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, k; cin >> n >> k; string second; cin >> second; if (k > 2) { int c = 0; for (int i = 1; i < n; i++) { if (second[i] == second[i - 1]) { if (i + 1 < n) { int j = 0; while (j < k && ((j + A ) == second[i - 1] || (j + A ) == second[i + 1])) j++; second[i] = j + A ; } else { second[i] = ((second[i - 1] - A + 1) % k) + A ; } c++; } } cout << c << n ; cout << second << n ; return; } string t = A , h = B ; for (int i = 1; i < n; i++) { if (t[i - 1] == A ) t += B ; else t += A ; if (h[i - 1] == A ) h += B ; else h += A ; } int c1 = 0, c2 = 0; for (int i = 0; i < n; i++) { if (second[i] != t[i]) c1++; if (h[i] != second[i]) c2++; } cout << min(c1, c2) << n ; if (c1 <= c2) cout << t << n ; else cout << h << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Event { int type; int p; int x; }; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<int> v(n); for (auto& el : v) { cin >> el; } int q; cin >> q; vector<Event> evs(q); for (auto& ev : evs) { cin >> ev.type; if (ev.type == 2) { cin >> ev.x; } else { cin >> ev.p >> ev.x; ev.p--; } } int mx = 0; vector<bool> has_ans(n, false); for (int i = q - 1; i >= 0; i--) { if (evs[i].type == 1) { if (!has_ans[evs[i].p]) { v[evs[i].p] = max(mx, evs[i].x); has_ans[evs[i].p] = true; } } else { mx = max(evs[i].x, mx); } } for (int i = 0; i < n; i++) { if (!has_ans[i]) { v[i] = max(v[i], mx); } } for (auto& el : v) { cout << el << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; typedef int ll; const ll MAX = 5e5 + 100; const ll inf = 1e9; const ll mod = 1e9 + 7; bool go[MAX]; ll p[MAX], dsu[MAX], n, m; pair<ll, ll> e[MAX]; vector<pair<ll, ll> > Querie; ll ans[MAX]; ll vertex; vector<ll> adj[MAX]; vector<ll> querys_on_graph[MAX]; ll find(ll u) { return (dsu[u] == u ? u : dsu[u] = find(dsu[u])); } void uni(ll u, ll v) { ll x = find(u), y = find(v); if (x == y) return; vertex++; adj[vertex].push_back(x); adj[vertex].push_back(y); dsu[y] = vertex; dsu[x] = vertex; } ll L[MAX], R[MAX], pos[MAX], leaf = 1, val[MAX], val_to_u[MAX]; ll tree[MAX * 2]; void dfs(ll u) { L[u] = inf; for (ll v : adj[u]) { dfs(v); L[u] = min(L[u], L[v]); R[u] = max(R[u], R[v]); } if (adj[u].size() == 0) { pos[u] = leaf++; L[u] = R[u] = pos[u]; val[pos[u]] = p[u]; } } void build(ll node, ll l, ll r) { if (l == r) { tree[node] = val[l]; return; } ll mid = (l + r) >> 1; build(node << 1, l, mid); build(node << 1 | 1, mid + 1, r); tree[node] = max(tree[node << 1], tree[node << 1 | 1]); } void update(ll node, ll l, ll r, ll x) { if (l == r) { tree[node] = 0; return; } ll mid = (l + r) >> 1; if (x <= mid) update(node << 1, l, mid, x); else update(node << 1 | 1, mid + 1, r, x); tree[node] = max(tree[node << 1], tree[node << 1 | 1]); } ll query(ll node, ll l, ll r, ll i, ll j) { if (j < l || r < i) return 0; if (i <= l && r <= j) { return tree[node]; } ll mid = (l + r) >> 1; return max(query(node << 1, l, mid, i, j), query(node << 1 | 1, mid + 1, r, i, j)); } void dfs_go(ll u) { for (ll v : adj[u]) { dfs_go(v); } sort(querys_on_graph[u].begin(), querys_on_graph[u].end()); for (ll it : querys_on_graph[u]) { ll answer = query(1, 1, n, L[u], R[u]); ans[it] = answer; if (answer != 0) { update(1, 1, n, pos[val_to_u[answer]]); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll q, t, u; cin >> n >> m >> q; for (ll i = 1; i < (ll)n + 1; i++) cin >> p[i], val_to_u[p[i]] = i; for (ll i = 1; i < (ll)m + 1; i++) cin >> e[i].first >> e[i].second; for (ll i = 0; i < (ll)q; i++) { cin >> t >> u; if (t == 2) go[u] = 1; Querie.push_back({t, u}); } for (ll i = 1; i < (ll)2 * n + 5; i++) dsu[i] = i; for (ll i = 1; i < (ll)m + 1; i++) if (!go[i]) Querie.push_back({2, i}); vertex = n; vector<ll> ask; reverse(Querie.begin(), Querie.end()); for (pair<ll, ll> it : Querie) { if (it.first == 2) { uni(e[it.second].first, e[it.second].second); } else { ask.push_back(find(it.second)); } } vertex++; for (ll i = 1; i < (ll)vertex; i++) if (find(i) == i) adj[vertex].push_back(find(i)); dfs(vertex); build(1, 1, n); reverse(ask.begin(), ask.end()); for (ll i = 0; i < (ll)ask.size(); i++) { ll u = ask[i]; ll answer = query(1, 1, n, L[u], R[u]); cout << answer << endl; if (answer != 0) { update(1, 1, n, pos[val_to_u[answer]]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; vector<int> one; vector<int> two; cin >> n; for (int i = 0; i < n; i++) { int t, w; cin >> t >> w; if (t == 1) one.push_back(w); else two.push_back(w); } sort(one.begin(), one.end()); sort(two.begin(), two.end()); vector<int> pref_one = {0}; vector<int> pref_two = {0}; for (int i = 1; i <= one.size(); i++) { int val = one[i - 1] + pref_one[i - 1]; pref_one.push_back(val); } for (int i = 1; i <= two.size(); i++) { int val = two[i - 1] + pref_two[i - 1]; pref_two.push_back(val); } int res = 1000000; for (int i = 0; i <= one.size(); i++) { for (int j = 0; j <= two.size(); j++) { bool possible = false; int ans = i + 2 * j; int w_one = pref_one[one.size() - i]; int w_two = pref_two[two.size() - j]; if (ans >= (w_one + w_two)) possible = true; if (possible) res = min(res, ans); } } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; long long Mypow(long long X, long long Y) { if (Y < 0) return 0; if (Y == 0) return 1; if (Y == 1) { return X; } else { long long x = Mypow(X, Y / 2); x *= x; if (Y % 2) return (x * X); else return x; } } long long n, m, l, r, x; long long p[100100]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> p[i]; } while (m--) { scanf( %I64d %I64d %I64d , &l, &r, &x); if (x < l || x > r) { printf( Yes n ); continue; } int sum = 0; for (int i = l; i <= r; i++) { if (p[i] < p[x]) { sum++; } } if (x == l + sum) { printf( Yes n ); } else { printf( No n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; const double eps = 1e-8; void read(int &k) { k = 0; char x = getchar(); while (x < 0 || x > 9 ) x = getchar(); while (x >= 0 && x <= 9 ) { k = k * 10 - 48 + x; x = getchar(); } } int n, tra[128], lx, ly, Lx[10010], Ly[10010], a[2100][2100], ll, rr, tx, ty, nx, ny, k; pair<pair<int, int>, pair<int, int> > ope[1010]; pair<int, int> dd[5000000]; char s[10]; void update(int type, int &x) { if (!type) x = lower_bound(Lx + 1, Lx + lx + 1, x) - Lx; else x = lower_bound(Ly + 1, Ly + ly + 1, x) - Ly; } int main() { tra[ R ] = 0; tra[ D ] = 1; tra[ L ] = 2; tra[ U ] = 3; scanf( %d , &n); nx = 0; ny = 0; Lx[++lx] = 0; Ly[++ly] = 0; Ly[++ly] = Lx[++lx] = 1000000003; Ly[++ly] = Lx[++lx] = -1000000003; Lx[++lx] = 1; Ly[++ly] = 1; for (int i = 1; i <= n; i++) { scanf( %s%d , s, &k); ope[i].first = make_pair(nx, ny); nx += dx[tra[s[0]]] * k; ny += dy[tra[s[0]]] * k; ope[i].second = make_pair(nx, ny); Lx[++lx] = nx; Ly[++ly] = ny; Lx[++lx] = nx + 1; Ly[++ly] = ny + 1; } sort(Lx + 1, Lx + lx + 1); lx = unique(Lx + 1, Lx + lx + 1) - Lx - 1; sort(Ly + 1, Ly + ly + 1); ly = unique(Ly + 1, Ly + ly + 1) - Ly - 1; for (int i = 1; i <= n; i++) { update(0, ope[i].first.first); update(1, ope[i].first.second); update(0, ope[i].second.first); update(1, ope[i].second.second); if (ope[i].first.first == ope[i].second.first) { if (ope[i].first.second > ope[i].second.second) swap(ope[i].first.second, ope[i].second.second); for (int j = ope[i].first.second; j <= ope[i].second.second; j++) a[ope[i].first.first][j] = 1; } else { if (ope[i].first.first > ope[i].second.first) swap(ope[i].first.first, ope[i].second.first); for (int j = ope[i].first.first; j <= ope[i].second.first; j++) a[j][ope[i].first.second] = 1; } } a[1][1] = 2; for (dd[ll = rr = 0] = make_pair(1, 1); ll <= rr; ll++) { for (int dir = 0; dir < 4; dir++) { tx = dd[ll].first + dx[dir]; ty = dd[ll].second + dy[dir]; if (tx > 0 && tx <= lx && ty > 0 && ty <= ly && !a[tx][ty]) a[tx][ty] = 2, dd[++rr] = make_pair(tx, ty); } } long long ans = 0; for (int i = 1; i <= lx; i++) for (int j = 1; j <= ly; j++) if (a[i][j] <= 1) ans += 1ll * (Lx[i + 1] - Lx[i]) * (Ly[j + 1] - Ly[j]); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, dist1, dist2, i, blank; string s, t; for (i = 0; i < 300; i++) cout << a ; cout << endl; cin >> dist1; if (dist1 == 0) return 0; for (i = 0; i < 300; i++) cout << b ; cout << endl; cin >> dist2; if (dist2 == 0) return 0; blank = dist1 + dist2 - 300; dist1 -= blank; dist2 -= blank; n = dist1 + dist2; s = ; for (i = 0; i < n; i++) s += a ; if (dist2 == n) { cout << s << endl; cin >> dist2; return 0; } for (i = 0; i < n - 1; i++) { t = s; t[i] = b ; cout << t << endl; cin >> dist2; if (dist2 == 0) return 0; if (dist2 < dist1) s[i] = b ; dist1 = min(dist2, dist1); } s[n - 1] = b ; cout << s << endl; cin >> dist2; return 0; } |
#include <bits/stdc++.h> using namespace std; struct tp { int l, r; }; int n; vector<tp> t; bool comp(tp a, tp b) { return a.l < b.l or a.l == b.l and a.r < b.r; } int main() { cout.sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { int l, r; cin >> l >> r; t.push_back({l, r}); } sort(t.begin(), t.end(), comp); int cl = -1; int cr = -1; int ans = 0; for (int i = 0; i < t.size(); i++) { if (t[i].l > cr) { ans += 1; cl = t[i].l; cr = t[i].r; } else if (t[i].l <= cr and t[i].r > cr) { continue; } else if (t[i].l <= cr and t[i].r <= cr) { cl = t[i].l; cr = t[i].r; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 140000; int sx[MAX + 10], ex[MAX], sy[MAX + 10], ey[MAX]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d %d %d %d , &sx[i], &sy[i], &ex[i], &ey[i]); vector<pair<int, int> > px, py; for (int i = 0; i < n; i++) { px.push_back(make_pair(sx[i], -i - 1)); px.push_back(make_pair(ex[i], i + 1)); } sort(px.begin(), px.end()); set<int> rec; int rx = -1, ry = -1; for (int i = 0; i < (int)px.size(); i++) { if (px[i].second < 0) { rec.insert(-1 * px[i].second); } else { rec.erase(px[i].second); } if ((int)rec.size() >= n - 1) { py.clear(); for (set<int>::iterator it = rec.begin(); it != rec.end(); it++) { py.push_back(make_pair(sy[*it - 1], -1 * (*it))); py.push_back(make_pair(ey[*it - 1], *it)); } sort(py.begin(), py.end()); int inter = 0; for (int j = 0; j < (int)py.size(); j++) { if (py[j].second < 0) inter++; else inter--; if (inter >= n - 1) rx = px[i].first, ry = py[j].first; } } } printf( %d %d n , rx, ry); } |
#include <bits/stdc++.h> using namespace std; const int N = 13 * 16, M = 1e9 + 7; int n, m, k; struct zz { int a[N][N]; } A; inline zz cf(zz x, zz y) { zz z; memset(z.a, 0, sizeof z.a); for (int i = 0; i < (1 << m) * (k + 1); i++) for (int j = 0; j < (1 << m) * (k + 1); j++) for (int l = 0; l < (1 << m) * (k + 1); l++) z.a[i][j] = (z.a[i][j] + (long long)x.a[i][l] * y.a[l][j]) % M; return z; } inline zz ksm(zz x, int y) { zz ans; memset(ans.a, 0, sizeof ans.a); for (int i = 0; i < (1 << m) * (k + 1); i++) ans.a[i][i] = 1; for (; y; y >>= 1, x = cf(x, x)) if (y & 1) ans = cf(ans, x); return ans; } int main() { scanf( %d%d%d , &n, &k, &m); for (int i = 0; i < 1 << m; i++) for (int j = 0; j <= k; j++) { int num = 1; for (int l = 0; l < m; l++) if ((1 << l) & i) num++; A.a[(i >> 1) * (k + 1) + j][i * (k + 1) + j] = 1; if (j < k) A.a[(i >> 1 | (1 << (m - 1))) * (k + 1) + j + 1][i * (k + 1) + j] = num; } A = ksm(A, n); int ans = 0; for (int i = 0; i < 1 << m; i++) (ans += A.a[i * (k + 1) + k][0]) %= M; printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; set<int> b[127]; set<int>::iterator it, itt; int n, m, l, r, c[200005]; char s, ch[2], a[200005]; void upd(int v, int d) { while (v <= n) { c[v] += d; v += v & -v; } } int find(int x) { int cur = 0, ans = 0; for (int i = 20; i >= 0; i--) { ans += (1 << i); if (ans >= n || cur + c[ans] >= x) ans -= (1 << i); else cur += c[ans]; } return ans + 1; } int gsum(int v) { int sum = 0; while (v > 0) { sum += c[v]; v -= v & -v; } return sum; } int main() { scanf( %d%d , &n, &m); scanf( %s , a + 1); for (int i = 1; i <= n; i++) b[a[i]].insert(i); for (int i = 1; i <= n; i++) upd(i, 1); for (int i = 0; i < m; i++) { scanf( %d%d%s , &l, &r, ch); s = ch[0]; l = find(l); r = find(r); it = b[s].lower_bound(l); while (it != b[s].end() && *it <= r) upd(*it, -1), a[*it] = # , itt = it, it++, b[s].erase(itt); } for (int i = 1; i <= n; i++) if (gsum(i) - gsum(i - 1) == 1) printf( %c , a[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1 << 17; const int INF = 7 << 28; struct T { int maxa, minr; T() : maxa(0), minr(INF) {} T(int a, int b) : maxa(a), minr(b) {} T operator+(T t) const { return T(max(maxa, t.maxa), min(minr, t.minr)); } }; T a[MAXN * 2]; int del[MAXN * 2]; int l[MAXN], r[MAXN], t[MAXN]; void setDel(int i, int d) { del[i] += d; a[i].minr -= d; } void push(int i) { setDel(i * 2, del[i]); setDel(i * 2 + 1, del[i]); del[i] = 0; } void com(int i) { push(i); a[i] = a[i * 2] + a[i * 2 + 1]; } void clear(int i) { int j; for (j = 0; (1 << j) < MAXN; j++) ; for (; j; j--) push(i >> j); } T get(int i) { clear(i); T ret = T(); while (i) { if (~i & 1) ret = a[i + 1] + ret; i >>= 1; } return ret; } void modify(int i, T t) { i += MAXN; clear(i); a[i] = t; del[i] = 0; i >>= 1; while (i) { com(i); i >>= 1; } } void init() { fill(a, a + MAXN * 2, T()); } void put(int t) { printf( %d , t); } int main() { int n; int i, j, k; int ans = 0; init(); scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d%d%d , &l[i], &r[i], &t[i]); r[i]++; } for (i = 1; i <= n; i++) { if (max(ans, l[i]) + t[i] <= r[i]) { put(0); modify(i, T(t[i], max(ans, l[i]) - l[i])); ans = max(ans, l[i]) + t[i]; } else { int ra, rr; j = 1; ra = 0; rr = INF; while (j < MAXN) { push(j); j = j * 2 + 1; if (max(a[j].maxa, ra) < min(rr, a[j].minr)) { ra = max(a[j].maxa, ra); rr = min(a[j].minr, rr); j--; } } T temp = get(j); int move = max(temp.maxa, min(temp.minr, a[j].maxa)); if (max(ans - move, l[i]) + t[i] > r[i] || max(ans - move, l[i]) + t[i] >= ans) { put(-1); continue; } move = min(move, ans - l[i]); j = 1; while (j < MAXN) { j = j * 2 + 1; if (a[j].maxa < move) j--; } put(j - MAXN); temp = get(j); move = min(temp.minr, a[j].maxa); ans -= move; modify(j - MAXN, T(0, INF)); while (j != 1) { if (~j & 1) setDel(j + 1, move); j >>= 1; com(j); } modify(i, T(t[i], max(ans, l[i]) - l[i])); ans = max(ans, l[i]) + t[i]; } } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; for (int i = 0; i < q; ++i) { long long n; cin >> n; int a = 0; int b = 0; int c = 0; while (n % 2 == 0) { n /= 2; ++a; } while (n % 3 == 0) { n /= 3; ++b; } while (n % 5 == 0) { n /= 5; ++c; } if (n != 1) { cout << -1 << endl; } else { cout << a + b * 2 + c * 3 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, cnt, Max, head[N]; struct Edge { int to, nxt, val; } e[N << 1]; int read() { int x = 0, flg = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) flg = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * flg; } void add(int x, int y, int w) { e[++cnt].to = y; e[cnt].val = w; e[cnt].nxt = head[x]; head[x] = cnt; } void dfs(int x, int fa, int dis) { Max = max(Max, dis); for (int i = head[x]; i; i = e[i].nxt) { int u = e[i].to; if (u == fa) continue; dfs(u, x, dis + e[i].val); } } int main() { n = read(); int x, y, w; long long sum = 0; for (int i = 2; i <= n; ++i) { x = read(), y = read(), w = read(); add(x, y, w); add(y, x, w); sum += 2 * w; } dfs(1, 0, 0); printf( %lld n , sum - Max); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; std::cin >> n; std::vector<int> v(101); for (int i = 0; i < n; ++i) { int temp; std::cin >> temp; v[temp]++; } int mex_A = -1; int mex_B = -1; bool flag1 = 1; for (int i = 0; i < n; ++i) { if (v[i] > 1 && flag1) { mex_A = mex_B = i; } else if (v[i] >= 1) { mex_A = i; flag1 = 0; } else if (v[i] == 0) { break; } } std::cout << ++mex_A + ++mex_B << n ; } int main() { int x; cin >> x; while (x--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct compare { bool operator()(const pair<int, int>& a, const pair<int, int>& b) { return true; } }; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { int n, x, y; cin >> n >> x >> y; vector<int> ans; for (int i = 1; i <= 50; i++) { ans.clear(); if ((x - y) % i != 0) continue; for (int j = x; j <= y; j += i) ans.push_back(j); if (ans.back() != y || ans.size() > n) continue; int j = x - i; while (ans.size() < n && j >= 1) { ans.push_back(j); j -= i; } j = y + i; while (ans.size() < n) { ans.push_back(j); j += i; } break; } for (auto ai : ans) cout << ai << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; const int p = 257; const long long mods = 1610612741; const int maxn = 200010; long long hash1[maxn][2]; int cntzero[maxn]; char s[maxn]; int N; long long pp[maxn]; void gethash(char s[]) { hash1[0][0] = 0; hash1[0][1] = 0; for (int i = 1; i <= N; i++) { cntzero[i] = cntzero[i - 1]; if (s[i] == 0 ) { cntzero[i]++; hash1[i][0] = (hash1[i - 1][0] * p + (i & 1) + 1) % mods; hash1[i][1] = (hash1[i - 1][1] * p + ((i + 1) & 1) + 1) % mods; } else { hash1[i][0] = hash1[i - 1][0]; hash1[i][1] = hash1[i - 1][1]; } } return; } void init() { pp[0] = 1; for (int i = 1; i <= N; i++) { pp[i] = (pp[i - 1] * p) % mods; } } long long getsubhash(int L, int R) { return (hash1[R][L & 1] - (hash1[L - 1][L & 1] * pp[cntzero[R] - cntzero[L - 1]]) % mods + mods) % mods; } int main() { scanf( %d , &N); scanf( %s , s + 1); init(); gethash(s); int q; scanf( %d , &q); while (q--) { int l1, l2, lens; scanf( %d%d%d , &l1, &l2, &lens); if (getsubhash(l1, l1 + lens - 1) == getsubhash(l2, l2 + lens - 1)) printf( Yes n ); else printf( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int binary_search(vector<int> a, int korol) { if (a[a.size() - 1] < korol) return a.size() - 1; if (a[0] > korol) return -1; int max = a.size() - 1, min = 0, mid; if (min + max >= 0) mid = (int)((min + max) / 2); else mid = (int)((min + max - 1) / 2); while (1) { while (a[mid] > korol) { max = mid; if (min + max >= 0) mid = (int)((min + max) / 2); else mid = (int)((min + max - 1) / 2); } while (a[mid] < korol && mid != min) { min = mid; if (min + max >= 0) mid = (int)((min + max) / 2); else mid = (int)((min + max - 1) / 2); } if (min == mid) return min; } } int result(vector<int> a, vector<int> b, int korol) { sort(a.begin(), a.begin() + a.size()); sort(b.begin(), b.begin() + b.size()); int min_a = binary_search(a, korol); int min_b = binary_search(b, korol); if (min_a != -1 && min_b == -1) { cout << YES ; return 1; } if (min_b != -1 && min_a != -1 && a[min_a] > b[min_b]) { cout << YES ; return 1; } if (min_a + 1 != a.size() && min_b + 1 == b.size()) { cout << YES ; return 1; } if (min_a + 1 != a.size() && min_b + 1 != b.size() && a[min_a + 1] < b[min_b + 1]) { cout << YES ; return 1; } return 0; } int main() { int n; cin >> n; int korol_x, korol_y; cin >> korol_x >> korol_y; vector<int> slon_na_glav(0); vector<int> slon_na_dobav(0); vector<int> pomecha_gor(0); vector<int> pomecha_ver(0); vector<int> ladia_na_gor(0); vector<int> ladia_na_ver(0); vector<int> pomecha_glav(0); vector<int> pomecha_dobav(0); for (int i = 0; i < n; i++) { char fig; cin >> fig; int x, y; cin >> x >> y; if (fig == B ) { if (y - x == korol_y - korol_x) slon_na_glav.push_back(x); if (y + x == korol_x + korol_y) slon_na_dobav.push_back(x); if (x == korol_x) pomecha_ver.push_back(y); if (y == korol_y) pomecha_gor.push_back(x); } if (fig == R ) { if (y - x == korol_y - korol_x) pomecha_glav.push_back(x); if (y + x == korol_x + korol_y) pomecha_dobav.push_back(x); if (x == korol_x) ladia_na_ver.push_back(y); if (y == korol_y) ladia_na_gor.push_back(x); } if (fig == Q ) { if (y - x == korol_y - korol_x) slon_na_glav.push_back(x); if (y + x == korol_x + korol_y) slon_na_dobav.push_back(x); if (x == korol_x) ladia_na_ver.push_back(y); if (y == korol_y) ladia_na_gor.push_back(x); } } int progress = 0; if (!slon_na_glav.empty()) { if (pomecha_glav.empty()) { cout << YES ; return 0; } progress = result(slon_na_glav, pomecha_glav, korol_x); if (progress) return 0; } if (!slon_na_dobav.empty()) { if (pomecha_dobav.empty()) { cout << YES ; return 0; } progress = result(slon_na_dobav, pomecha_dobav, korol_x); if (progress) return 0; } if (!ladia_na_gor.empty()) { if (pomecha_gor.empty()) { cout << YES ; return 0; } progress = result(ladia_na_gor, pomecha_gor, korol_x); if (progress) return 0; } if (!ladia_na_ver.empty()) { if (pomecha_ver.empty()) { cout << YES ; return 0; } progress = result(ladia_na_ver, pomecha_ver, korol_y); if (progress) return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void boost() { ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); } const long long maxn = 1e5 + 123; const long long inf = 1e9 + 123; const long long mod = 1e9 + 7; const double infm = 1e-9; const double pi = acos(-1); map<char, int> m; int main() { boost(); int n; cin >> n; string s; cin >> s; int ans = 0; for (int i = 1; i < s.size(); i++) { if (s[i] == s[i - 1]) { m[s[i - 1]]++; m[s[i + 1]]++; if (m[ B ] == 0) { s[i] = B ; } else if (m[ G ] == 0) { s[i] = G ; } else if (m[ R ] == 0) { s[i] = R ; } m[s[i - 1]]--; m[s[i + 1]]--; ans++; } } cout << ans << n << s; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void readInt(int &num) { num = 0; int c = getchar(); int s = 1; if (c == - ) { s = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = num * 10 + (c - 0 ); c = getchar(); } num *= s; } inline void printInt(int num) { string s = ; if (num < 0) { putchar( - ); num = -num; } if (num == 0) putchar( 0 ); while (num) { s += 0 + num % 10; num /= 10; } for (int i = s.size() - 1; i >= 0; i--) { putchar(s[i]); } } inline void readLL(long long &num) { num = 0; int c = getchar(); int s = 1; if (c == - ) { s = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = num * 10 + (c - 0 ); c = getchar(); } num *= s; } inline void printLL(long long num) { string s = ; if (num < 0) { putchar( - ); num = -num; } if (num == 0) putchar( 0 ); while (num) { s += 0 + num % 10; num /= 10; } for (int i = s.size() - 1; i >= 0; i--) { putchar(s[i]); } } inline void readString(string &s) { s = ; char c = getchar(); while (c != && c != n && c != EOF) { s += c; c = getchar(); } } inline void readLine(string &s) { s = ; char c = getchar(); while (c != n && c != EOF) { s += c; c = getchar(); } } inline void printString(const string &s) { for (int i = 0; i < (int)s.size(); i++) putchar(s[i]); } int main() { int n; readInt(n); string str; string zeroes = ; string ugly = ; bool is_find = false; for (int i = 0; i < (int)n; i++) { string temp; readString(temp); if (temp.size() == 1 && temp[0] == 0 ) { putchar( 0 ); return 0; } else if (!is_find) { if (temp[0] != 1 ) { ugly = temp; is_find = true; } else if (temp.size() > 1) { string tz = ; for (int i = 1; i < temp.size(); i++) if (temp[i] != 0 ) { ugly = temp; is_find = true; break; } else tz += 0 ; if (!is_find) zeroes += tz; } } else if (temp.size() > 1) { for (int j = 1; j < temp.size(); j++) zeroes += 0 ; } } string ans = (is_find) ? ugly + zeroes : 1 + zeroes; printString(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int fa[100020], sz[100020]; vector<int> g[100020]; int n, m, q; int find(int x) { if (fa[x] != x) fa[x] = find(fa[x]); return fa[x]; } int dp[100020][3], G[100020], mx[100020]; vector<int> d[100020]; vector<long long> sum[100020]; bool cmp(int i, int j) { return i > j; } void dfs(int u, int p) { for (auto v : g[u]) { if (v == p) continue; dfs(v, u); dp[u][2] = dp[v][0] + 1; sort(dp[u], dp[u] + 3, cmp); } } void dfs2(int u, int p) { for (auto v : g[u]) { if (v == p) continue; int t; if (dp[u][0] == dp[v][0] + 1) t = dp[u][1]; else t = dp[u][0]; G[v] = max(G[u] + 1, t + 1); dfs2(v, u); } } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= n; ++i) { fa[i] = i; sz[i] = 1; } for (int i = 1; i <= m; ++i) { int u, v; scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); sz[find(v)] += sz[find(u)]; fa[find(u)] = find(v); } for (int i = 1; i <= n; ++i) { if (fa[i] == i) { dfs(i, 0); } } for (int i = 1; i <= n; ++i) { if (fa[i] == i) dfs2(i, 0); } for (int i = 1; i <= n; ++i) { d[i].push_back(0); sum[i].push_back(0); } for (int i = 1; i <= n; ++i) { int x = find(i); mx[x] = max(mx[x], max(dp[i][0], G[i])); int t = max(dp[i][0], G[i]); d[x].push_back(t); sum[x].push_back(0); } for (int i = 1; i <= n; ++i) { sort(d[i].begin(), d[i].end()); if (fa[i] == i) { for (int j = 1; j < sum[i].size(); ++j) { sum[i][j] = sum[i][j - 1] + d[i][j]; } } } map<pair<int, int>, double> ans; while (q--) { int x, y; scanf( %d%d , &x, &y); x = find(x), y = find(y); if (x == y) { puts( -1 ); continue; } if (sz[x] > sz[y]) swap(x, y); if (ans.count(make_pair(x, y))) { printf( %.10lf n , ans[make_pair(x, y)]); continue; } long long res = 0; int k = max(mx[x], mx[y]); bool fst = 1; for (auto v : d[x]) { if (fst) { fst = 0; continue; } int p = lower_bound(d[y].begin(), d[y].end(), k - 1 - v) - d[y].begin(); p = max(p, 1); res += sum[y][sum[y].size() - 1] - sum[y][p - 1] + 1LL * (v + 1) * (sum[y].size() - p); res += 1LL * (p - 1) * k; } double res2 = res * 1.0 / sz[x] / sz[y]; ans[make_pair(x, y)] = res2; printf( %.12lf n , res2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int l[1000000]; int one_line[5001][5001] = {0}; int summ[5001][5001] = {0}; int fac[5001]; int main() { int n, m, p; scanf( %d %d %d , &n, &m, &p); for (int i = 0; i < n; i++) scanf( %d , &l[i]); fac[0] = 1; for (int i = 1; i <= 5000; i++) fac[i] = ((fac[i - 1]) * (long long)i) % p; one_line[1][1] = 1; for (int i = 2; i <= 5000; i++) { for (int j = 1; j <= min(m, 5000); j++) { one_line[i][j] = (one_line[i - 1][j] * (long long)(j - 1) + one_line[i - 1][j - 1]) % p; } } summ[1][1] = m; for (int i = 2; i <= 5000; i++) { for (int j = 1; j <= min(m, 5000); j++) { summ[i][j] = (summ[i - 1][j] * (long long)(j - 1) + summ[i - 1][j - 1] * (long long)(m - j + 1)) % p; } } int prev_progress[5001] = {0}; int prev_l = 0; prev_progress[0] = 1; for (int i = 0; i < n; i++) { int next_progress[5001]; for (int j = 0; j <= l[i]; j++) next_progress[j] = 0; int tot1 = 0; for (int j = 0; j <= prev_l; j++) tot1 = (tot1 + prev_progress[j]) % p; int tot2 = 1; tot2 = (tot2 * (long long)m) % p; for (int j = 1; j < l[i]; j++) tot2 = (tot2 * (long long)(m - 1)) % p; for (int j = 1; j <= l[i]; j++) { next_progress[j] = (tot1 * (long long)summ[l[i]][j]) % p; int prev = 0; if (j <= prev_l) prev = prev_progress[j]; next_progress[j] -= (((prev * (long long)one_line[l[i]][j]) % p) * fac[j]) % p; if (next_progress[j] < 0) next_progress[j] += p; } for (int j = 0; j <= l[i]; j++) prev_progress[j] = next_progress[j]; prev_l = l[i]; } int res = 0; for (int i = 0; i <= prev_l; i++) res = (res + prev_progress[i]) % p; printf( %d n , res); } |
#include <bits/stdc++.h> const int N = (1 << 19) - 1; using namespace std; int n; double dp[N + 1], a[20][20]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) scanf( %lf , &a[i][j]); } dp[(1 << n) - 1] = 1; for (int s = ((1 << n) - 1); s > 0; s--) { int c = 0; for (int i = 0; i < n; i++) { if ((1 << i) & s) c++; } if (c < 2) continue; for (int i = 0; i < n; i++) if ((1 << i) & (s)) for (int j = 0; j < n; j++) { if (i == j) continue; if ((1 << j) & s) { dp[s ^ (1 << i)] += dp[s] * a[j][i] / c / (c - 1); dp[s ^ (1 << j)] += dp[s] * a[i][j] / c / (c - 1); } } } for (int i = 1; i < (1 << n); i <<= 1) { printf( %.10f , dp[i]); } } |
#include <bits/stdc++.h> using namespace std; long long int pwr(long long int base, long long int p) { long long int ans = 1; while (p) { if (p & 1) ans = (ans * base) % 1000000007; base = (base * base) % 1000000007; p /= 2; } return ans; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int n; int dyn[5005][5005][2]; char ch[5001][2]; int dp(int neww, int val, int cont) { dyn[neww][val][cont] %= 1000000007; if (neww == n && !val) return 1; if (dyn[neww][val][cont] != -1) return dyn[neww][val][cont]; if (val < 0 || neww > n) return 0; int final = 0; if (ch[neww][0] != f ) { final += dp(neww + 1, val, 0); final = final % 1000000007; } else { final += dp(neww + 1, val + 1, 1); final = final % 1000000007; } if (cont == 0) { final += dp(neww, val - 1, 0); final = final % 1000000007; } final = final % 1000000007; return dyn[neww][val][cont] = final; } int main() { int i, j, k, m; memset(dyn, -1, sizeof dyn); scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %s , &ch[i]); } int ans = dp(0, 0, 0); printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int N; vector<pair<int, int> > v; vector<int> query; int ans; struct SEG { SEG(int l, int r, int sum) : l(l), r(r), sum(sum) {} int l, r; int sum; }; vector<SEG> seg; void init(int idx, int s, int e) { if (s == e) return; seg[idx].l = seg.size(); seg.push_back({-1, -1, 0}); seg[idx].r = seg.size(); seg.push_back({-1, -1, 0}); init(seg[idx].l, s, (s + e) / 2); init(seg[idx].r, (s + e) / 2 + 1, e); } void update(int idx, int s, int e, int x, int y) { seg[idx].sum += y; if (s == e) return; if (x <= (s + e) / 2) { update(seg[idx].l, s, (s + e) / 2, x, y); } else { update(seg[idx].r, (s + e) / 2 + 1, e, x, y); } } int calc(int idx, int s, int e, int x, int y) { if (x <= s && e <= y) return seg[idx].sum; if (x > e || y < s) return 0; return calc(seg[idx].l, s, (s + e) / 2, x, y) + calc(seg[idx].r, (s + e) / 2 + 1, e, x, y); } int main() { seg.push_back({-1, -1, 0}); scanf( %d , &N); init(0, 0, N - 1); for (int i = 0; i < N; i++) { int x; scanf( %d , &x); v.push_back({(x > 0) ? x : -x, i}); update(0, 0, N - 1, i, 1); } sort(v.begin(), v.end()); while (!v.empty()) { pair<int, int> now = v.back(); v.pop_back(); update(0, 0, N - 1, now.second, -1); query.push_back(now.second); while (!v.empty() && v.back().first == now.first) { query.push_back(v.back().second); update(0, 0, N - 1, v.back().second, -1); v.pop_back(); } while (!query.empty()) { int x = query.back(); query.pop_back(); ans += min(calc(0, 0, N - 1, 0, x - 1), calc(0, 0, N - 1, x + 1, N - 1)); } } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> const int MAX_LEN = 1010; using namespace std; template <typename U, typename V> string to_string(pair<U, V>); string to_string(const string& e_) { return + e_ + ; } string to_string(char e_) { return + string(1, e_) + ; } string to_string(bool e_) { return e_ ? true : false ; } template <typename T> string to_string(T e_) { string s_ = [ ; for (const auto& x_ : e_) s_ += to_string(x_) + ; return s_ + ] ; } template <typename U, typename V> string to_string(pair<U, V> e_) { return ( + to_string(e_.first) + , + to_string(e_.second) + ) ; } void dbg_str() { ; } template <typename U, typename... V> void dbg_str(U u, V... v) { ; dbg_str(v...); } int n, m, x; map<int, vector<int> > a; map<vector<int>, vector<int> > b; int main() { scanf( %d , &n); if (n == 2) { vector<int> l; scanf( %d %d , &m, &x); printf( 1 %d n , x); printf( %d , --m); while (m--) { scanf( %d , &x); printf( %d , x); } exit(0); } for (int i = 0; i < (n * (n - 1)) / 2; i++) { scanf( %d , &m); while (m--) { scanf( %d , &x); a[x].push_back(i); } }; for (auto& it : a) { b[it.second].push_back(it.first); } for (auto& it : b) { printf( %d , (int)it.second.size()); for (int i = 0; i < (int)it.second.size(); i++) printf( %d , it.second[i]); printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { int r, c; char s[15][15]; int cake = 0; int row = 0; scanf( %d %d , &r, &c); for (int i = 1; i <= r; i++) { scanf( %s , s[i]); } for (int i = 1; i <= r; i++) { for (int j = 0; j < c; j++) { if (s[i][j] == S ) break; else if (s[i][j] == . && j == c - 1) { cake += c; row++; } } } for (int j = 0; j < c; j++) { for (int i = 1; i <= r; i++) { if (s[i][j] == S ) break; else if (s[i][j] == . && i == r) cake += (r - row); } } printf( %d , cake); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; char str[105]; ll best[105]; ll memo[105][105][105]; ll dp(int l, int r, int p) { if (l >= r) return 0; if (memo[l][r][p] != -1) return memo[l][r][p]; int ptr = l; while (ptr < r && str[ptr] == str[l]) ptr++; ll ret = best[p + ptr - l] + dp(ptr, r, 0); for (int i = ptr; i < r; ++i) { if (str[i] == str[l]) { ret = max(ret, dp(ptr, i, 0) + dp(i, r, p + ptr - l)); } } return memo[l][r][p] = ret; } int main() { int n; cin >> n >> str; for (int i = 1; i <= n; ++i) { cin >> best[i]; for (int j = 1; j < i; ++j) { best[i] = max(best[i], best[j] + best[i - j]); } } memset(memo, -1, sizeof memo); cout << dp(0, n, 0) << n ; } |
#include <bits/stdc++.h> using namespace std; double eps = 1e-9; const int INF = 1e9 + 7; const int MAXN = int(3e5 + 7); vector<pair<int, int> > v[MAXN]; int n, p, a[MAXN]; long long ans[MAXN], dp[MAXN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); scanf( %d , &p); for (int i = 0; i < p; i++) { int x, y; scanf( %d%d , &x, &y); v[y].push_back(make_pair(x, i)); } for (int i = 1; i <= 500; i++) { for (int j = n; j > 0; j--) { dp[j] += a[j]; if (j + i <= n) dp[j] += dp[j + i]; } for (int j = 0; j < v[i].size(); j++) ans[v[i][j].second] = dp[v[i][j].first]; memset(dp, 0, sizeof(dp)); } for (int i = 501; i <= 300000; i++) { for (int j = 0; j < v[i].size(); j++) { long long cur = 0; for (int k = v[i][j].first; k <= n; k += i) cur += a[k]; ans[v[i][j].second] = cur; } } for (int i = 0; i < p; i++) printf( %I64d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 16; string s; long long string_int(string s) { long long num = 0; for (int i = 0; i < s.size(); i++) { num += s[i] - 0 ; num *= 10; } return num / 10; } int main() { ios_base::sync_with_stdio(false); cin >> s; bool flag = false; if (s[0] == 0 ) flag = true; int epos = s.find( e ); int d = string_int(s.substr(epos + 1)); s = s.substr(0, epos); for (int i = 0; i < 125; i++) s.push_back( 0 ); s.erase(1, 1); int exp = 1 + d; s.insert(exp, . ); epos = s.find( e ); for (int i = 0; i < s.size(); i++) { if (s[i] == . ) { s = s.substr(i - 1); break; } else if (s[i] != 0 ) { s = s.substr(i); break; } } for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == 0 ) s.pop_back(); else break; } if (s[s.size() - 1] == . ) s.pop_back(); cout << s << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; while (cin >> n) { vector<int> v; int x; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } bool in = false; int cnt = 0; bool f = true; bool s = false, l = false; int ind1 = 1, ind2 = 1; for (int i = 1; i < n; i++) { bool d = false; while (v[i - 1] > v[i] && i < n) { d = true; if (f) { ind1 = i; ind2 = i + 1; f = false; } else { ind2 = i + 1; } if (i - 1 == 0) s = true; if (i == n - 1) l = true; i++; } if (d) { d = false; cnt++; } } bool val = false; if (cnt == 0) val = 1; else if (cnt == 1) { if (s && l) val = true; else if (s && v[ind1 - 1] < v[ind2]) val = true; else if (l && v[ind2 - 1] > v[ind1 - 2]) val = true; else if (v[ind1 - 1] < v[ind2] && v[ind2 - 1] > v[ind1 - 2]) val = true; } if (val) { cout << yes << endl; cout << ind1 << << ind2 << endl; } else { cout << no << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[300005]; int rev[300005]; int b[300005]; int main() { int n, m; long long ans = 0; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); rev[a[i]] = i; } for (int i = 0; i < m; i++) { int x, y; scanf( %d %d , &x, &y); x = rev[x]; y = rev[y]; b[max(x, y)] = max(b[max(x, y)], min(x, y)); } int t = 0; for (int i = 1; i <= n; i++) { t = max(t, b[i]); ans += i - t; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 505, mod = 1e9 + 7; int n, m, e[N][N], f[N][N], g[N][N]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = (1); i <= (n); i++) for (int j = (1); j <= (n); j++) cin >> e[i][j]; for (int i = (1); i <= (n); i++) g[i][i] = f[i][i] = 1; for (int len = (1); len <= (n); len++) for (int l = (1); l <= (n - len + 1); l++) { int r = l + len - 1; for (int k = (l); k <= (r - 1); k++) if (e[l][r]) (g[l][r] += (long long)f[l][k] * f[k + 1][r] % mod) %= mod; for (int k = (l + 1); k <= (r); k++) (f[l][r] += (long long)g[l][k] * f[k][r] % mod) %= mod; } cout << f[1][n] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int MAXM = 100010; const int INF = 1000000000; int dist[MAXN], dp[MAXN]; pair<int, int> par[MAXN]; bool marked[MAXM]; vector<pair<int, int> > edges[MAXN]; queue<int> q; vector<pair<int, int> > v; int x[MAXM], y[MAXM], z[MAXM]; int n, m; void bfs(int s) { for (int i = 0; i < n; i++) dist[i] = INF; dist[s] = 0; q.push(s); while (!q.empty()) { int v = q.front(); q.pop(); for (int i = 0; i < edges[v].size(); i++) { int u = edges[v][i].first; if (dist[u] > dist[v] + 1) { dist[u] = dist[v] + 1; q.push(u); } } } } int main() { cin >> n >> m; int working = 0; for (int i = 0; i < m; i++) { cin >> x[i] >> y[i] >> z[i]; x[i]--, y[i]--; working += z[i]; edges[x[i]].push_back(pair<int, int>(y[i], i)); edges[y[i]].push_back(pair<int, int>(x[i], i)); } bfs(0); for (int i = 0; i < n; i++) { v.push_back(pair<int, int>(dist[i], i)); dp[i] = INF; } sort(v.begin(), v.end()); dp[0] = 0; for (int i = 0; i < n; i++) { int u = v[i].second; for (int j = 0; j < edges[u].size(); j++) { int q = edges[u][j].first; int w = 1 - z[edges[u][j].second]; if (dist[q] == dist[u] + 1 && dp[q] > dp[u] + w) { par[q] = pair<int, int>(u, edges[u][j].second); dp[q] = dp[u] + w; } } } int now = n - 1; while (now != 0) { marked[par[now].second] = true; now = par[now].first; } cout << working - dist[n - 1] + dp[n - 1] * 2 << endl; for (int i = 0; i < m; i++) if (marked[i] ^ z[i]) cout << x[i] + 1 << << y[i] + 1 << << 1 - z[i] << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const long long mod = 998244353; const int N = 2e5 + 10; mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); int n; int z[100][2]; int qry(int i, int j) { cout << ? << i << << j << endl; int ans; cin >> ans; return ans; } int p[N]; int f(int i) { if (p[i] != -1) return p[i]; if (i != z[0][0]) p[i] = qry(i, z[0][0]); else p[i] = qry(i, z[0][1]); for (int j = 1; j < 11; j++) { if (i != z[j][0]) p[i] &= qry(i, z[j][0]); else p[i] &= qry(i, z[j][1]); } return p[i]; } int main() { scanf( %d , &n); memset(p, -1, sizeof(p)); while (1) { bool ok = 1; for (int i = 0; i < 11; i++) if (!z[i][0]) ok = 0; if (ok) break; int i = uniform_int_distribution<int>((1), (n))(mt), j = uniform_int_distribution<int>((1), (n))(mt); while (i == j) i = uniform_int_distribution<int>((1), (n))(mt), uniform_int_distribution<int>((1), (n))(mt); int tmp = qry(i, j); for (int u = 0; u < 11; u++) if (!(tmp >> u & 1)) z[u][0] = i, z[u][1] = j; } int idx = 1, val = f(idx); for (int i = 2; i <= n && val != 0; i++) { if (qry(i, idx) != val) continue; idx = i, val = f(i); } for (int i = 1; i <= n; i++) { if (p[i] == -1) p[i] = qry(idx, i); } cout << ! ; for (int i = 1; i <= n; i++) cout << << p[i]; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, T; double dp[5001][5001]; int p[5001], t[5001]; double quickpow(double x, int y) { double res = 1; while (y) { if (y & 1) res *= x; x *= x; y >>= 1; } return res; } int main() { cin >> n >> T; dp[0][0] = 1; for (int i = 0; i < n; i++) scanf( %d%d , &p[i], &t[i]); double ans = 0; for (int i = 0; i < n; i++) { double pp = p[i] * 0.01; double now = 0; double r = quickpow(1 - pp, t[i] - 1) * pp; double r2 = quickpow(1 - pp, t[i] - 1); for (int j = 0; j < T; j++) { now *= (1 - pp); now += dp[i][j] * pp; if (j + 1 >= t[i]) { now -= dp[i][j + 1 - t[i]] * r; dp[i + 1][j + 1] = now + dp[i][j + 1 - t[i]] * r2; } else { dp[i + 1][j + 1] = now; } } for (int j = 0; j <= T; j++) ans += dp[i + 1][j]; } printf( %.12f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 2; int n, l; long long a[N], f[N]; int main() { scanf( %d %d , &n, &l); for (int i = 1; i < n; ++i) scanf( %lld , &a[i]), a[i] += a[i - 1]; long long ans = LLONG_MAX; for (int i = l; i < n; ++i) ans = min(ans, a[i] - a[i - l]); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, i, j, ans = 0; long long a, b; const long long M = (long long)1E9 + 7; long long power(long long x, long long y) { long long res = 1; x %= M; while (y) { if (y % 2) res = (res * x) % M; y = y >> 1; x = (x * x) % M; } return res % M; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; b = power(2LL, (long long)s.length() - 1); long long x = 1; for (i = (long long)s.length() - 1; i >= 0; i--) { if (s[i] == 1 ) a += x; x *= 2; if (x > M) x %= M; a %= M; } cout << (a * b) % M; } |
#include <bits/stdc++.h> using namespace std; int a[100005]; map<long long, int> ma; int main() { long long b1, q, m, l; cin >> b1 >> q >> l >> m; while (m--) { long long x; cin >> x; ma[x] = 1; } int ans = 0, i; for (i = 1; i < 100; i++) { if (abs(b1) > l) break; if (!ma[b1]) ans++; b1 *= q; } if (ans < 49) cout << ans << endl; else cout << inf << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int nuts, divis, maxsec, capacity, boxees = 0; cin >> maxsec >> nuts >> divis >> capacity; while (nuts > 0) { boxees++; nuts -= ((min(maxsec, divis + 1)) * capacity); divis -= ((min(maxsec, divis + 1)) - 1); } cout << boxees << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int vis[100010], h[100100]; vector<int> res; set<int> q, off; int a[100100]; char s[100010][2]; int main() { int i, j, z, T, d; while (cin >> n >> m) { q.clear(); res.clear(); off.clear(); memset(vis, 0, sizeof(vis)); for (i = 1; i <= m; i++) { scanf( %s%d , s[i], &a[i]); if (s[i][0] == - && !vis[a[i]]) q.insert(a[i]); if (s[i][0] == + && !vis[a[i]]) off.insert(a[i]); vis[a[i]]++; } memset(vis, 0, sizeof(vis)); if (q.size() != 0) { set<int>::iterator it; for (it = off.begin(); it != off.end(); it++) vis[*it]++; off.clear(); } for (i = 1; i <= m; i++) { if (s[i][0] == + && q.size() != 0) { set<int>::iterator it; for (it = off.begin(); it != off.end(); it++) vis[*it]++; off.clear(); } if (s[i][0] == - ) { q.erase(a[i]); off.insert(a[i]); } else { if (off.count(a[i]) != 0) off.erase(a[i]); q.insert(a[i]); } if (q.size() != 0) { set<int>::iterator it; for (it = off.begin(); it != off.end(); it++) vis[*it]++; off.clear(); } } for (i = 1; i <= n; i++) { if (!vis[i]) res.push_back(i); } printf( %d n , res.size()); for (i = 0; i < res.size(); i++) { if (i) printf( ); printf( %d , res[i]); } if (res.size() != 0) puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; long long fac[N], infac[N]; int n, m; long long poww(long long b, long long p) { if (p == 0) return 1; if (p & 1) return (b * poww(b, p - 1)) % m; return poww((b * b) % m, p / 2); } long long npk(int n, int k) { return (fac[n] * infac[n - k]) % m; } long long nck(int n, int k) { return (((fac[n] * infac[n - k]) % m) * infac[n - k]) % m; } int main() { cin >> n >> m; fac[0] = infac[0] = 1; for (int i = 1; i <= n; i++) { fac[i] = (i * fac[i - 1]) % m; infac[i] = poww(fac[i], m - 2); } long long ans = 0; for (int i = 1; i <= n; i++) { long long a = n - i + 1; a = (a * fac[i]) % m; ans = (ans + a * fac[n - i + 1]) % m; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int result; string input; cin >> input; set<string> sinput; sinput.insert(input); for (int i = input.size() - 1; i >= 0; --i) { input = input[input.size() - 1] + input; input.pop_back(); sinput.insert(input); } result = sinput.size(); printf( %d n , result); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100100; long long n, m, A, cf, cm, maxForce = -1, minSkill, minIdx, i, a[N], b[N]; pair<long long, int> sum[N]; inline long long query(long long money, int limit) { long long l = sum[1].first, r = A, mid; if (limit <= 1) { return A; } while (l < r) { mid = (l + r + 1) / 2; int x = upper_bound(b + 1, b + limit, mid) - b - 1; if (mid * x - sum[x].first <= money) l = mid; else r = mid - 1; } return r; } int main() { cin >> n >> A >> cf >> cm >> m; for (i = 1; i <= n; ++i) { scanf( %d , a + i); sum[i].first = a[i]; sum[i].second = i; } sort(sum + 1, sum + n + 1); for (i = 1; i <= n; ++i) { b[i] = sum[i].first; sum[i].first += sum[i - 1].first; } b[n + 1] = A; for (i = n + 1; i >= 1; --i) { m -= A - b[i]; if (m < 0) { break; } long long x = query(m, i); long long force = cf * (n - i + 1) + cm * x; if (maxForce < force) { maxForce = force; minIdx = i; minSkill = x; } } for (i = n; i >= minIdx; --i) { a[sum[i].second] = A; } cout << maxForce << endl; for (i = 1; i <= n; ++i) { printf( %d , max(a[i], minSkill)); } return 0; } |
#include <bits/stdc++.h> #define dumb ios_base::sync_with_stdio(false);cin.tie(NULL); typedef long long ll; using namespace std; #define modulo 1000000007; bool isprime(long long n) { for(long long int i=2;i*i<=n;i++) { if(n%i==0) return 0; } return 1; } long long gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } // Function to return LCM of two numbers long long lcm(int a, int b) { return (a / gcd(a, b)) * b; } ll ncr(ll n,ll k) { ll res = 1; if (k > n - k) k = n - k; for (ll i = 0; i < k; ++i) { res *= (n - i); res /= (i + 1); } return res; } map<int,int> m; void solve() { int n; cin>>n; auto it=m.lower_bound(n); if(it->first==n) { cout<<it->second<<endl; return; } else { int diff=it->first-n; if(diff==1) cout<<it->second+1<<endl; else cout<<it->second<<endl; return; } return; } int main() { dumb; int t=1; cin>>t; int i=1; m[0]=0; int sum=0; while(1) { m[sum+i]=i; if(sum+i>1000000) break; sum+=i; i++; } while(t--) { //cout<< in ; solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, size_t N> void PRINT_ARRAY(const T (&a)[N], int n = -1) { if (!n) n = N; for (int i = 0; i < n; i++) cout << a[i] << ; cout << n ; } template <typename T, size_t N, size_t M> void PRINT_ARRAY(const T (&a)[N][M], int n, int m) { for (int i = 0; i < n; i++) PRINT_ARRAY(a[i], m); cout << n ; } long long arr[3005], cost[3005], lessc, more, ans; int n; void solve() { cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n; i++) cin >> cost[i]; ans = (int)(1e9 + 7); for (int i = 1; i < n - 1; i++) { lessc = (int)(1e9 + 7); more = (int)(1e9 + 7); for (int j = 0; j < i; j++) if (arr[i] > arr[j]) lessc = min(lessc, cost[j]); for (int j = i + 1; j < n; j++) if (arr[j] > arr[i]) more = min(more, cost[j]); ans = min(ans, cost[i] + lessc + more); } cout << (ans == (int)(1e9 + 7) ? -1 : ans); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; solve(); } |
#include <bits/stdc++.h> using namespace std; int N, M; bitset<2020> mat[2020]; int main() { int T; scanf( %d , &T); while (T--) { scanf( %d%d , &N, &M); vector<pair<int, int> > E; int deg[2020] = {}; for (int i = 1; i <= M; i++) { int x, y; scanf( %d%d , &x, &y); deg[x]++; deg[y]++; E.push_back(pair<int, int>(x, y)); } int ok = 1; for (int i = 1; i <= N; i++) if (deg[i] & 1) ok = 0; if (ok) { puts( 1 ); for (int i = 1; i <= N; i++) printf( 1 ); puts( ); } else { for (int i = 1; i <= N; i++) mat[i].reset(); for (int i = 1; i <= N; i++) if (deg[i] & 1) mat[i][i] = 1; for (pair<int, int> e : E) { int x = e.first, y = e.second; mat[x][y] = !mat[x][y]; mat[y][x] = !mat[y][x]; } int V[2020] = {}; for (int i = 1; i <= N; i++) V[i] = (deg[i] & 1); int now = 1; int base[2020]; for (int i = 1; i <= N; i++) { int f = -1; for (int j = now; j <= N; j++) if (mat[j][i]) { f = j; break; } if (f == -1) continue; swap(mat[f], mat[now]); swap(V[f], V[now]); for (int j = now + 1; j <= N; j++) { if (mat[j][i]) { mat[j] ^= mat[now]; V[j] ^= V[now]; } } base[now] = i; ++now; } --now; int res[2020] = {}; for (int i = now; i; i--) { int p = base[i]; res[p] = V[i]; if (res[p]) { for (int j = 1; j < i; j++) if (mat[j][p]) V[j] ^= 1; } } puts( 2 ); for (int i = 1; i <= N; i++) printf( %d , res[i] + 1); puts( ); } } } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const long long MOD = 1000000007; void solve_test() { int n; cin >> n; vector<int> arr(n); vector<int> ct(101); for (int i = 0; i < n; i++) { cin >> arr[i]; ct[arr[i]]++; } int max_val = -1; int max_freq = -1; for (int i = 1; i <= 100; i++) { if (ct[i] > max_freq) { max_freq = ct[i]; max_val = i; } } unordered_map<int, int> um; int ans = 0; for (int i = 1; i <= 100; i++) { if (max_val == i) continue; um.clear(); int st = 0; um[0] = -1; for (int j = 0; j < n; j++) { if (arr[j] == i) { st++; } else if (arr[j] == max_val) { st--; } if (um.find(st) == um.end()) { um[st] = j; } else { ans = max(ans, j - um[st]); } } } cout << ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int tests; tests = 1; while (tests--) { solve_test(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int N, T; char str[15], temp[15]; int main() { int i, j, k; scanf( %s%s , str, temp); i = strlen(str); sort(str, str + i); if (str[0] == 0 ) { do { if (str[0] != 0 ) break; } while (next_permutation(str, str + i)); } if (strcmp(str, temp) == 0) printf( OK n ); else printf( WRONG_ANSWER n ); scanf( ); } |
#include <bits/stdc++.h> using namespace std; void init() {} const int N = (int)1e6 + 34; const long long INF = (long long)1e9 + 34; int n, m; int a[555][555]; int c[555], r[555]; int main() { init(); int mxr = -N, mnr = N, mxc = -N, mnc = N; cin >> n >> m; int sum = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; sum += a[i][j]; } } if (n == 1) { for (int j = 0; j < m; j++) { c[j] = a[0][j]; } r[0] = 0; } if (m == 1) { for (int i = 0; i < n; i++) { r[i] = a[i][0]; } c[0] = 0; } if (max(n, m) > 1) { c[0] = 0; for (int i = 0; i < n; i++) r[i] = a[i][0]; for (int j = 1; j < m; j++) for (int i = 0; i < n; i++) { c[j] = a[i][j] - r[i]; } } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (a[i][j] != r[i] + c[j]) { cout << -1 n ; return 0; } } for (int i = 0; i < n; i++) { mnr = min(mnr, r[i]); mxr = max(mxr, r[i]); } for (int j = 0; j < m; j++) { mxc = max(mxc, c[j]); mnc = min(mnc, c[j]); } if (mnr + mnc < 0) { cout << -1 n ; return 0; } int dr = 0; int dc = 0; if (mnr < 0) { dc = mnr; dr = -dc; } else if (mnc < 0) { dr = mnc; dc = -dr; } while (n > m && mnr + dr > 0) { dr--; dc++; } while (n < m && mnc + dc > 0) { dr++; dc--; } int num = 0; for (int i = 0; i < n; i++) num += r[i] + dr; for (int j = 0; j < m; j++) num += c[j] + dc; cout << num << n ; for (int i = 0; i < n; i++) { for (int j = 0; j < r[i] + dr; j++) cout << row << i + 1 << n ; } for (int j = 0; j < m; j++) { for (int i = 0; i < c[j] + dc; i++) cout << col << j + 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, v; scanf( %d%d%d , &n, &m, &v); int spec = 1; if (m < n - 1 || m > (n - 1) * (n - 2) / 2 + 1) { printf( -1 n ); return 0; } if (spec == v) spec++; printf( %d %d n , v, spec); m--; for (int i = 1; i <= n; i++) { if (i == spec) continue; for (int j = i + 1; j <= n; j++) { if (j == spec) continue; printf( %d %d n , i, j); m--; if (m == 0) return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; string str[1005]; int tim[1005][1005]; int n, m, t; int fx[] = {-1, +1, 0, 0}; int fy[] = {0, 0, -1, +1}; vector<pair<int, int> > cur; bool okay(int x, int y) { return (x >= 0 && x < n && y >= 0 && y < m); } void dfs(int x, int y, int curr) { tim[x][y] = curr; cur.push_back(make_pair(x, y)); for (int k = 0; k < 4; k++) { int tx = x + fx[k]; int ty = y + fy[k]; if (okay(tx, ty) == false || tim[tx][ty] != -1 || str[tx][ty] != str[x][y]) continue; dfs(tx, ty, curr); } } char alt(char x) { if (x == 0 ) return 1 ; else return 0 ; } char query(int x, int y, long long curr) { if (tim[x][y] == -1) return str[x][y]; long long diff = curr - 1LL * tim[x][y]; if (diff % 2LL == 1LL) return alt(str[x][y]); else return str[x][y]; } int main() { scanf( %d %d %d , &n, &m, &t); for (int i = 0; i < n; i++) { cin >> str[i]; } memset(tim, -1, sizeof tim); vector<pair<int, int> > last; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) last.push_back(make_pair(i, j)); } for (int curTim = 0; curTim <= n * m; curTim++) { for (int i = 0; i < last.size(); i++) { int x = last[i].first, y = last[i].second; char col = query(x, y, curTim); for (int k = 0; k < 4; k++) { int tx = x + fx[k]; int ty = y + fy[k]; if (okay(tx, ty) == false || tim[tx][ty] != -1 || str[tx][ty] != col) continue; dfs(tx, ty, curTim); } } last = cur; cur.clear(); if (last.empty()) break; } while (t--) { int x, y; long long q; scanf( %d %d %lld , &x, &y, &q); x--, y--; char ans = query(x, y, q); cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 100005; int a[3], d; void Solve() { cin >> a[0] >> a[1] >> a[2] >> d; sort(a, a + 3); long long res = 0; if (a[2] < a[1] + d) res += a[1] + d - a[2]; if (a[0] > a[1] - d) res += a[0] - a[1] + d; cout << res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); if (fopen( .inp , r )) { freopen( .inp , r , stdin); freopen( .out , w , stdout); } int test_case = 1; while (test_case--) Solve(); return 0; } |
#include <bits/stdc++.h> struct circle { double r, x, y; circle(void) : r(0), x(0), y(0) {} bool contains(const circle& o) const { double dx, dy; dx = o.x - x; dy = o.y - y; return (dx * dx + dy * dy <= r * r) && o.r < r; } }; circle fences[1024]; circle control[1024]; int depth[1024]; int parent[11][1024]; int control_parent[1024]; int V, n; int find_parent(const circle& c, const int& ignore) { int best_j, best, j; best_j = V; best = -INT_MAX; for (j = 0; j < V; ++j) { if (j != ignore && fences[j].contains(c)) { if (depth[j] > best) { best = depth[j]; best_j = j; } } } return best_j; } void build_tree(void) { int i, j; for (i = 0; i < V; ++i) { depth[i] = 1; for (j = 0; j < V; ++j) { if (i != j && fences[j].contains(fences[i])) { ++depth[i]; } } } for (i = 0; i < V; ++i) { parent[0][i] = find_parent(fences[i], i); } for (i = 1; i <= n; ++i) { control_parent[i] = find_parent(control[i], -1); } } void build_lca(void) { int lg2, i; parent[0][V] = V; for (lg2 = 1; lg2 < 11; ++lg2) { for (i = 0; i < V; ++i) { parent[lg2][i] = parent[lg2 - 1][parent[lg2 - 1][i]]; } } } int get_lca(int a, int b) { int step, lg2; if (depth[a] < depth[b]) { std::swap(a, b); } for (lg2 = 10, step = 1024; lg2 >= 0; --lg2, step >>= 1) { if (depth[a] - step >= depth[b]) { a = parent[lg2][a]; } } if (a == b) { return a; } for (lg2 = 10, step = 1024; lg2 >= 0; --lg2, step >>= 1) { if (parent[lg2][a] != parent[lg2][b]) { a = parent[lg2][a]; b = parent[lg2][b]; } } return parent[0][a]; } int main(void) { int i, q; int control_1, control_2, control_3; std::cin.tie(0); std::ios_base::sync_with_stdio(0); std::cin >> n >> V >> q; for (i = 1; i <= n; ++i) { std::cin >> control[i].x >> control[i].y; } for (i = 0; i < V; ++i) { std::cin >> fences[i].r >> fences[i].x >> fences[i].y; } build_tree(); build_lca(); for (i = 0; i < q; ++i) { std::cin >> control_1 >> control_2; control_1 = control_parent[control_1]; control_2 = control_parent[control_2]; control_3 = get_lca(control_1, control_2); std::cout << (depth[control_1] + depth[control_2] - 2 * depth[control_3]) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int logb(int base, int x) { return (log(x) / log(base)); } int occurs(vector<long long> v, int n) { auto it = lower_bound(((v)).begin(), ((v)).end(), (n)); auto it1 = upper_bound(((v)).begin(), ((v)).end(), (n)); int x = it1 - it; return x; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long powm(int a, int b) { long long res = 1; while (b) { if (b & 1) res = (res * 1LL * a) % mod; b >>= 1; a = (a * 1LL * a) % mod; } return res; } long long nCr(long long n, long long k) { int fact[n]; long long res = (fact[n] * powm(fact[k], mod - 2)) % mod; return (res * powm(fact[n - k], mod - 2)) % mod; } const int N = 1e5 + 5, inf = 1e9; vector<int> g[N]; int n, m, d; int mxin[N], mxout[N], marked[N]; void dfs_down(int v, int p) { mxin[v] = -inf; if (marked[v]) mxin[v] = 0; for (auto u : g[v]) { if (u == p) continue; dfs_down(u, v); mxin[v] = max(mxin[v], mxin[u] + 1); } } void dfs_up(int v, int p) { int max1 = -1 * inf, max2 = -1 * inf; for (auto u : g[v]) { if (u == p) continue; if (mxin[u] >= max1) max2 = max1, max1 = mxin[u]; else if (mxin[u] > max2) max2 = mxin[u]; } for (auto u : g[v]) { if (u == p) continue; int used = (mxin[u] == max1) ? max2 : max1; mxout[u] = max(1 + mxout[v], 2 + used); if (mxout[u] < 0 && marked[u]) mxout[u] = 0; dfs_up(u, v); } } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> d; int x, y; for (int(i) = 0; (i) < (m); ++(i)) { cin >> x; marked[x] = 1; } for (int(i) = 0; (i) < (n - 1); ++(i)) { cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } dfs_down(1, 0); mxout[1] = (marked[1] ? 0 : -inf); dfs_up(1, 0); int ans = 0; for (int i = 1; i <= n; i++) ans += (mxin[i] <= d && mxout[i] <= d); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, V, A[64], B[64]; bool canCook(double x) { double tot = 0.0; for (int i = 0; i < n; i++) if (A[i] * x > B[i]) return 0; else tot += A[i] * x; return tot <= V; } double totalAmount(double x) { double tot = 0.0; for (int i = 0; i < n; i++) tot += A[i] * x; return tot; } int main() { scanf( %d%d , &n, &V); for (int i = 0; i < n; i++) scanf( %d , &A[i]); for (int i = 0; i < n; i++) scanf( %d , &B[i]); double lo = 0.0, hi = double(2 * V), mid; while (abs(hi - lo) >= 1e-6) { mid = (hi + lo) / 2; if (canCook(mid)) lo = mid; else hi = mid; } printf( %.6f n , totalAmount(lo)); } |
#include <bits/stdc++.h> using namespace std; map<long long, int> mp; long long n, k, i, v[500005], val[500005], x, sum[500005], fr[500005], frec[500005], fr3[500005], nr, sum2[500005], bucket, val1, m, st, dr, s, stcur, drcur, sol[500005], fr2[500005], val2, b[500005]; struct wow { long long st, dr, poz; } a[500005]; long long cautbin(long long x) { long long st = 0, dr = n, mij, sol = 0; while (st <= dr) { mij = (st + dr) / 2; if (sum2[mij] <= x) { if (sum2[mij] == x) { sol = mij; } st = mij + 1; } else { dr = mij - 1; } } return sol; } bool compare(wow a, wow b) { if (a.st / bucket != b.st / bucket) { return a.st < b.st; } return a.dr < b.dr; } int main() { cin >> n >> k; for (i = 1; i <= n; i++) { cin >> x; if (x == 1) { val[i] = 1; } else { val[i] = -1; } } for (i = 1; i <= n; i++) { cin >> x; v[i] = x * val[i]; } for (i = 1; i <= n; i++) { sum[i] = sum[i - 1] + v[i]; } for (i = 0; i <= n; i++) { mp[sum[i] - k] = mp[sum[i]] = mp[sum[i] + k] = 0; } nr = 0; for (auto &a : mp) { a.second = ++nr; } for (i = 0; i <= n; i++) { fr[i] = mp[sum[i] - k]; fr2[i] = mp[sum[i]]; fr3[i] = mp[sum[i] + k]; } cin >> m; for (i = 1; i <= m; i++) { cin >> a[i].st >> a[i].dr; a[i].st--; a[i].poz = i; } bucket = 300; sort(a + 1, a + m + 1, compare); st = 0; dr = -1; s = 0; for (i = 1; i <= m; i++) { stcur = a[i].st; drcur = a[i].dr; while (st > stcur) { st--; s = s + frec[fr3[st]]; frec[fr2[st]]++; } while (dr < drcur) { dr++; s = s + frec[fr[dr]]; frec[fr2[dr]]++; } while (st < stcur) { frec[fr2[st]]--; s = s - frec[fr3[st]]; st++; } while (dr > drcur) { frec[fr2[dr]]--; s = s - frec[fr[dr]]; dr--; } sol[a[i].poz] = s; } for (i = 1; i <= m; i++) { cout << sol[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[200005], sum, cnt, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); sum += a[i]; } for (int i = 1; i <= n; i += 2) cnt += a[i]; ans = cnt; for (int i = 1; i < n; i++) { cnt = sum - cnt + a[i]; ans = max(ans, cnt); } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; long long m; long long p(long long x) { long long kmx = 0; while ((kmx * kmx * kmx) <= x) kmx++; kmx--; long long ret = 0; for (long long i = 2; i <= kmx; i++) ret += x / (i * i * i); return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> m; long long ans = 0; long long lo = 1, hi = 1e16; while (lo <= hi) { long long mi = (lo + hi) / 2; if (p(mi) >= m) { ans = mi; hi = mi - 1; } else lo = mi + 1; } if (p(ans) != m) ans = -1; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxx = 200010; unsigned long long t, n; unsigned long long ans = 0, total = 0, sum = 0; unsigned long long a[maxx], b[maxx], bj[maxx]; int main() { scanf( %lld , &t); while (t--) { scanf( %lld , &n); ans = 0, total = 0, sum = 1; while (n >= sum) { unsigned long long opt = sum; total++; sum *= 2; ans += total + (n - opt) / sum * total; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const long long inf = 1e18 + 9; int n, m, k, q; vector<pair<int, int> > g[maxn]; pair<long long, pair<int, int> > edges[maxn]; pair<int, int> query[maxn]; struct data { int id; long long val; bool operator<(const data& other) const { return val > other.val; } }; long long d[maxn]; int lab[maxn]; int low[maxn], high[maxn]; vector<int> vec[maxn]; void read_input() { cin >> n >> m >> k >> q; for (int i = 1; i <= m; ++i) { int u, v, w; cin >> u >> v >> w; edges[i] = make_pair(w, pair<int, int>(u, v)); g[u].push_back(pair<int, int>(v, w)); g[v].push_back(pair<int, int>(u, w)); } for (int i = 1; i <= q; ++i) { int u, v; cin >> u >> v; query[i] = pair<int, int>(u, v); } } void dijkstra() { priority_queue<data> pq; fill(d + 1, d + n + 1, inf); for (int i = 1; i <= k; ++i) { d[i] = 0; pq.push({i, 0}); } while (!pq.empty()) { data tp = pq.top(); pq.pop(); if (tp.val != d[tp.id]) continue; int u = tp.id; for (auto& to : g[u]) { int v = to.first, w = to.second; if (d[v] > d[u] + w) { d[v] = d[u] + w; pq.push({v, d[v]}); } } } } int find_set(int u) { return lab[u] < 0 ? u : lab[u] = find_set(lab[u]); } void union_sets(int u, int v) { if (lab[u] < lab[v]) swap(u, v); lab[v] += lab[u]; lab[u] = v; } void solve() { dijkstra(); for (int i = 1; i <= m; ++i) { int u = edges[i].second.first, v = edges[i].second.second; edges[i].first += d[u] + d[v]; } sort(edges + 1, edges + m + 1); for (int i = 1; i <= q; ++i) { low[i] = 1; high[i] = m; } while (true) { bool stop = true; for (int i = 1; i <= q; ++i) if (low[i] <= high[i]) { stop = false; int mid = (low[i] + high[i]) / 2; vec[mid].push_back(i); } if (stop) break; fill(lab + 1, lab + n + 1, -1); for (int i = 1; i <= m; ++i) { int u = edges[i].second.first, v = edges[i].second.second; u = find_set(u); v = find_set(v); if (u != v) union_sets(u, v); while ((int)vec[i].size()) { int id = vec[i].back(); vec[i].pop_back(); if (find_set(query[id].first) == find_set(query[id].second)) high[id] = i - 1; else low[id] = i + 1; } } } for (int i = 1; i <= q; ++i) cout << edges[low[i]].first << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); read_input(); solve(); } |
#include <bits/stdc++.h> using namespace std; bool in_range(long long l, long long v, long long r) { return (l <= v && v <= r); } int main() { long long x; cin >> x; x = ((-x) % 360 + 360) % 360; int ans = 0; if (x >= 225 && x < 315) ans = 1; else if (x >= 135 && x < 225) ans = 2; else if (x > 45 && x < 135) ans = 3; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline pair<int, int> best(pair<int, int> a, pair<int, int> b) { if ((a.first > b.first) || ((a.first == b.first) && (a.second < b.second))) return a; return b; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; string s; cin >> n; cin >> s; cin >> m; vector<vector<int> > ka(n, vector<int>(2)); vector<vector<int> > kb(n, vector<int>(2)); vector<int> kv(n); vector<int> preva(n, -1); if (s[0] == a ) { preva[0] = 0; ka[0][0] = 1; } if (s[0] == b ) kb[0][0] = 1; if (s[0] == ? ) kv[0] = 1, preva[0] = 0; for (int i = 1; i < n; i++) { ka[i][0] = ka[i - 1][0]; ka[i][1] = ka[i - 1][1]; if (s[i] == a ) ka[i][i % 2]++; kb[i][0] = kb[i - 1][0]; kb[i][1] = kb[i - 1][1]; if (s[i] == b ) kb[i][i % 2]++; if ((s[i] == a ) || (s[i] == ? )) preva[i] = i; else preva[i] = preva[i - 1]; kv[i] = kv[i - 1]; if (s[i] == ? ) kv[i]++; } vector<vector<pair<int, int> > > dp(n, vector<pair<int, int> >(2)); if (((s[0] == a ) || (s[0] == ? )) && (m <= n) && (kb[m - 1][0] == 0) && (ka[m - 1][1] == 0)) dp[0][1] = {1, kv[m - 1]}; for (int i = 1; i < n; i++) { dp[i][0] = best(dp[i - 1][0], dp[i - 1][1]); if (i + m - 1 >= n) continue; int bada = ka[i + m - 1][(i % 2) ^ 1] - ka[i - 1][(i % 2) ^ 1]; int badb = kb[i + m - 1][i % 2] - kb[i - 1][i % 2]; if ((bada != 0) || (badb != 0)) continue; if (i < m) { dp[i][1] = {1, kv[i + m - 1] - kv[i - 1]}; } else { int p = preva[i - m]; if (p < 0) { dp[i][1] = {1, kv[i + m - 1] - kv[i - 1]}; } else { dp[i][1] = best(dp[p][0], dp[p][1]); dp[i][1].first++; dp[i][1].second += kv[i + m - 1] - kv[i - 1]; } } } pair<int, int> rez = best(dp[n - 1][0], dp[n - 1][1]); cout << rez.second << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; class Solution { public: void solve(std::istream& in, std::ostream& out) { long long n, k, b, c, a, d; in >> n >> k >> b >> c; b = min(b, 5 * c); vector<pair<long long, long long>> x(n); for (int i = 0; i < n; i++) { in >> a; x[i] = make_pair(a, 0); } for (int i = 0; i < n; i++) { for (int j = 1; j < 5; j++) { x.push_back(make_pair(x[i].first + j, -j)); } } n = x.size(); vector<vector<pair<long long, long long>>> y(5), z(5); for (int i = 0; i < n; i++) { a = x[i].first % 5; if (a < 0) { a = a + 5; } y[a].push_back(x[i]); } for (int i = 0; i < 5; i++) { sort(begin(y[i]), end(y[i])); int t = y[i].size(); long long h = y[i].back().first; z[i] = vector<pair<long long, long long>>(t); for (int j = 0; j < t; j++) { z[i][j] = make_pair(-((h - y[i][j].first) / 5 * b - y[i][j].second * c), j); } sort(begin(z[i]), end(z[i])); } long long m = 100000000000000000; for (int i = 0; i < 5; i++) { int t = y[i].size(); priority_queue<pair<int, int>> q; long long p = 0; int l = t - 1, r = t - 1; long long h; while (l >= 0) { if (r < 0) break; d = y[i][r].first; if (q.size()) { a = q.top().first; p -= (h - a) / 5 * b * q.size(); h = a; } while (q.size() && d < q.top().first) { p += q.top().second * c; q.pop(); if (q.size()) { a = q.top().first; p -= (h - a) / 5 * b * q.size(); h = a; } else p = 0; } if (q.size()) { a = q.top().first; p += (d - a) / 5 * b * q.size(); } while (l >= 0 && q.size() < k) { a = z[i][l].second; if (y[i][a].first > d) { l--; continue; } p -= y[i][a].second * c; p += (d - y[i][a].first) / 5 * b; q.push(y[i][a]); l--; } if (q.size() == k) m = min(m, p); h = d; r--; while (r >= 0 && y[i][r].first == y[i][r + 1].first) r--; } } out << m; } }; void solve(std::istream& in, std::ostream& out) { out << std::setprecision(12); Solution solution; solution.solve(in, out); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); istream& in = cin; ostream& out = cout; solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], s = 0, nz = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) { if (a[i] == a[i + 1] && a[i] != 0) s++; if (a[i] == 0) nz++; } cout << n - s - nz << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; string now, st; vector<int> num[26]; int main(void) { int n, k; cin >> n >> k; cin >> st; for (int i = 0; i < (k); i++) { num[st[i] - a ].push_back(i); } for (int Case = 0; Case < (n); Case++) { cin >> now; long long res = 0; int len = now.size(); for (int i = 0; i < (len); i++) { if (i >= k || st[i] != now[i]) { int alpha = now[i] - a ; if (num[alpha].empty()) { res += len; continue; } int left = 0, right = num[alpha].size() - 1, mid; while (left < right) { mid = (left + right + 1) >> 1; if (num[alpha][mid] <= i) left = mid; else right = mid - 1; } int tmp = abs(i - num[alpha][left]); if (left + 1 < num[alpha].size()) tmp = min(tmp, abs(i - num[alpha][left + 1])); res += tmp; } } cout << res << endl; } } |
#include <bits/stdc++.h> using namespace std; const int mn = 500005; int n, fp, ln; pair<double, double> inp[mn]; bool f(double mid) { double ma = -(int)1e9; for (int i = fp; i < ln + 1; i++) { double pos = inp[i].first + mid * inp[i].second; if (inp[i].second < 0) { if (pos <= ma) return 1; } else ma = max(ma, pos); } return 0; } int main() { n = ({ int t; scanf( %d , &t); t; }); for (int i = 0; i < n; i++) inp[i].first = ({ int t; scanf( %d , &t); t; }), inp[i].second = ({ int t; scanf( %d , &t); t; }); fp = ln = -1; for (int i = n - 1; i >= 0; i--) if (inp[i].second > 0) fp = i; for (int i = 0; i < n; i++) if (inp[i].second < 0) ln = i; if (fp == -1 || ln == -1 || fp > ln) { printf( -1 n ); return 0; } double lo = 0, hi = double(1e9) + 5, mid = (lo + hi) / 2; for (int times = 0; times < 100; times++) { if (f(mid)) hi = mid; else lo = mid; mid = (lo + hi) / 2; } printf( %.15lf n , mid); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using ld = long double; const int mod = 1e9 + 7; const ll inf = 2e9; const ll INF = 2e18; const ld EPS = 1e-7; const int N = 1e5 + 55; ll sx[N], sy[N]; void solve() { int n, m; cin >> n >> m; vector<vector<int>> a(n, vector<int>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> a[i][j]; sx[i] += a[i][j]; sy[j] += a[i][j]; } } ll mx = 0; vector<ll> v; for (int i = 0; i < n; ++i) { v.clear(); for (int j = 0; j < m; ++j) { v.push_back(sy[j] - a[i][j]); sort(v.rbegin(), v.rend()); while (v.size() > 3) { v.pop_back(); } } ll cur = sx[i]; for (ll a : v) { cur += a; } mx = max(mx, cur); } for (int j = 0; j < m; ++j) { v.clear(); for (int i = 0; i < n; ++i) { v.push_back(sx[i] - a[i][j]); sort(v.rbegin(), v.rend()); while (v.size() > 3) { v.pop_back(); } } ll cur = sy[j]; for (ll a : v) { cur += a; } mx = max(mx, cur); } if (n > m) { for (int i = 0; i < m; ++i) { for (int k = i + 1; k < m; ++k) { v.clear(); for (int j = 0; j < n; ++j) { v.push_back(sx[j] - a[j][i] - a[j][k]); sort(v.rbegin(), v.rend()); while (v.size() > 2) { v.pop_back(); } } ll cur = sy[i] + sy[k]; for (ll a : v) { cur += a; } mx = max(mx, cur); } } } else { for (int i = 0; i < n; ++i) { for (int k = i + 1; k < n; ++k) { v.clear(); for (int j = 0; j < m; ++j) { v.push_back(sy[j] - a[i][j] - a[k][j]); sort(v.rbegin(), v.rend()); while (v.size() > 2) { v.pop_back(); } } ll cur = sx[i] + sx[k]; for (ll a : v) { cur += a; } mx = max(mx, cur); } } } sort(sx, sx + n); sort(sy, sy + m); for (ll i = n - 1, sum = 0; i >= max(0, n - 4); --i) { sum += sx[i]; mx = max(mx, sum); } for (ll i = m - 1, sum = 0; i >= max(0, m - 4); --i) { sum += sy[i]; mx = max(mx, sum); } cout << mx; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; int tt = 1; while (tt--) { solve(); cout << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6, M = 1e9 + 7; int gcd(int a, int b) { if (!b) return a; return gcd(b, a % b); } int n, x[N], y[N]; map<pair<long double, long double>, int> mp; int t(int i, int j) { long double dX = x[i] - x[j]; long double dY = y[i] - y[j]; long double g = gcd(dX, dY); dX /= g, dY /= g; vector<int> r; for (int k = 0; k < n; k++) { if (k == i || k == j) continue; long double tmpx = x[i] - x[k]; long double tmpy = y[i] - y[k]; long double g = gcd(tmpx, tmpy); tmpx /= g, tmpy /= g; if (tmpx == dX && tmpy == dY) continue; else r.push_back(k); } if (r.size() < 2) return true; long double x2 = x[r[0]] - x[r[1]]; long double y2 = y[r[0]] - y[r[1]]; g = gcd(x2, y2); if (g) x2 /= g, y2 /= g; for (int i = 1; i < r.size(); i++) { long double tmpx = x[r[0]] - x[r[i]]; long double tmpy = y[r[0]] - y[r[i]]; long double g = gcd(tmpx, tmpy); if (g) tmpx /= g, tmpy /= g; if (x2 != tmpx || y2 != tmpy) return false; } return true; } int main() { scanf( %d , &n); int cnt = 0; for (int i = 0; i < n; i++) scanf( %d%d , &x[i], &y[i]); for (int i = 1; i < n; i++) { long double dX = x[i] - x[0]; long double dY = y[i] - y[0]; long double g = gcd(dX, dY); dX /= g, dY /= g; if (!mp[{dX, dY}]) mp[{dX, dY}] = i, cnt++; if (cnt == 2) break; } if (cnt < 2) { return puts( YES ), 0; } else { vector<int> v; for (auto it = mp.begin(); it != mp.end(); it++) { v.push_back(it->second); if (t(0, it->second)) return puts( YES ); } if (t(v[0], v[1])) return puts( YES ); } puts( NO ); } |
#include <bits/stdc++.h> using namespace std; long long n, a, b; int main() { cin >> n; a = (n + 2) * (n + 1) / 2 * n / 3; b = (n + 4) * (n + 3) / 2 * (n + 2) / 3 * (n + 1) / 4 * n / 5; cout << a * b; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int MOD = 1e9 + 7; vector<pair<long long int, long long int> > vp; map<long long int, long long int> mp, mpp; vector<long long int> v, v1, v2; long long int dp[N], visit[N]; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << ; __f(comma + 1, args...); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int n, m, val, k, d, mi = 1e9, mx(0); long long int sum(0), ct(0), p(0), q(0); cin >> n >> m; if (n <= 2 * m) cout << 0 << ; else cout << n - 2 * m << ; long long int low = 0, high = n; while (low <= high) { long long int mid = (low + high) >> 1; if (((mid * (mid - 1) / 2)) >= m) { high = mid - 1; } else { low = mid + 1; } } cout << n - (high + 1); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &(n)); static long long a[int(5e3 + 5)]; set<int> s; for (int i = 1, __R = n; i <= __R; i++) { scanf( %lld , &(a[i])); s.insert(a[i]); } static long long b[int(5e3 + 5)], k = 0; for (long long x : s) b[++k] = x; static long long dp[2][int(5e3 + 5)]; int lst = 0, cur = 1; dp[lst][1] = abs(a[1] - b[1]); for (int j = 2, __R = k; j <= __R; j++) dp[lst][j] = min(dp[lst][j - 1], abs(a[1] - b[j])); for (int i = 2, __R = n; i <= __R; i++) { dp[cur][1] = dp[lst][1] + abs(a[i] - b[1]); for (int j = 2, __R = k; j <= __R; j++) dp[cur][j] = min(dp[cur][j - 1], dp[lst][j] + abs(a[i] - b[j])); swap(lst, cur); } cout << dp[lst][k] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int count1[100005], count2[100005], count3[100005]; bool can_be_palin(int *a, int size) { int i, no_of_odd = 0; for (i = 0; i < size; i++) no_of_odd += a[i] % 2; return (no_of_odd <= 1); } bool is_palin(int *a, int l, int r) { for (int i = l; i <= (l + r) / 2; i++) if (a[i] != a[r + l - i]) return false; return true; } bool func(int *a, int n, int end, int l, int r) { int i; fill(count1, count1 + n + 1, 0); fill(count2, count2 + n + 1, 0); if (end - l + 1 >= r - end) { for (i = l; i <= end; i++) count1[a[i]]++; for (i = r; i > end; i--) count2[a[i]]++; for (i = 1; i <= n; i++) { if (count2[i] > count1[i]) return false; count1[i] -= count2[i]; } return can_be_palin(count1, n + 1); } else { for (i = l; i <= end; i++) count1[a[i]]++; for (i = r; i >= r - end + l; i--) count2[a[i]]++; for (i = 1; i <= n; i++) { if (count2[i] > count1[i]) return false; count1[i] -= count2[i]; } return can_be_palin(count1, n + 1) && is_palin(a, end + 1, r - end + l - 1); } } bool func2(int *a, int n, int end, int l, int r) { int i; fill(count1, count1 + n + 1, 0); fill(count2, count2 + n + 1, 0); if (r - end + 1 >= end - l) { for (i = r; i >= end; i--) count1[a[i]]++; for (i = l; i < end; i++) count2[a[i]]++; for (i = 1; i <= n; i++) { if (count2[i] > count1[i]) return false; count1[i] -= count2[i]; } return can_be_palin(count1, n + 1); } else { for (i = r; i >= end; i--) count1[a[i]]++; for (i = l; i <= l + r - end; i++) count2[a[i]]++; for (i = 1; i <= n; i++) { if (count2[i] > count1[i]) return false; count1[i] -= count2[i]; } return can_be_palin(count1, n + 1) && is_palin(a, r - end + l + 1, end - 1); } } int main() { int n, i; scanf( %d , &n); long long ans = 0; int a[n]; for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n / 2 && a[i] == a[n - 1 - i]; i++) ; if (i == n / 2) { printf( %I64d , (long long)n * (n + 1) / 2); return 0; } int l = i, r = n - 1 - i, left_prev = l, right_prev = r, end = (l + r) / 2; int prev_pos = -1; while (left_prev < end - 1 && end < right_prev - 1) { bool flag = true; flag = func(a, n, end, l, r); int mid1 = (end + left_prev) / 2; int mid2 = (end + right_prev) / 2; if (flag == false) { left_prev = end; end = mid2; } else { right_prev = end; prev_pos = end; end = mid1; } } for (int k = left_prev; k < r && k < right_prev; k++) if (func(a, n, k, l, r) == true) prev_pos = (prev_pos == -1) ? k : min(prev_pos, k); if (prev_pos != -1) ans += (long long)(l + 1) * (r - prev_pos); right_prev = r, left_prev = l, end = (l + r) / 2; prev_pos = -1; while (end < right_prev - 1 && left_prev < end - 1) { bool flag = true; flag = func2(a, n, end, l, r); int mid1 = (end + right_prev) / 2; int mid2 = (end + left_prev) / 2; if (flag == false) { right_prev = end; end = mid2; } else { left_prev = end; prev_pos = end; end = mid1; } } for (int k = right_prev; k > l && k > left_prev; k--) if (func2(a, n, k, l, r) == true) prev_pos = (prev_pos == -1) ? k : max(prev_pos, k); if (prev_pos != -1) ans += (long long)(n - r) * (prev_pos - l); fill(count1, count1 + n + 1, 0); for (i = l; i <= r; i++) count1[a[i]]++; if (can_be_palin(count1, n + 1) == true) ans += (long long)(l + 1) * (n - r); printf( %I64d , ans); } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( unroll-loops ) std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {-1, 1}, {-1, -1}, {1, 1}, {1, -1}}; using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { ~debug() { cerr << endl; } template <class c> typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class c, class b> debug& operator<<(pair<b, c> d) { return *this << ( << d.first << , << d.second << ) ; } template <class c> debug& operator<<(rge<c> d) { *this << [ ; for (auto it = d.b; it != d.e; ++it) *this << , + 2 * (it == d.b) << *it; return *this << ] ; } }; long long gcd(long long a, long long b) { if (b) return gcd(b, a % b); return a; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n, m, a, b, g[3005 * 3005], val[3005][3005], mn[3005][3005], x, y, z, ans; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr.tie(0); cout.tie(0); cin >> n >> m >> a >> b; cin >> g[0] >> x >> y >> z; for (long long i = 1; i < n * m; i++) { g[i] = (g[i - 1] * x + y) % z; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { val[i][j] = g[i * m + j]; } } for (long long j = 0; j < m; j++) { deque<long long> dq; for (long long i = 0; i < a; i++) { while ((long long)((dq).size()) && val[dq.back()][j] >= val[i][j]) dq.pop_back(); dq.push_back(i); } mn[0][j] = val[dq.front()][j]; for (long long i = 1; i <= n - a; i++) { if (dq.front() == i - 1) dq.pop_front(); while ((long long)((dq).size()) && val[dq.back()][j] >= val[i + a - 1][j]) dq.pop_back(); dq.push_back(i + a - 1); mn[i][j] = val[dq.front()][j]; } } for (long long i = 0; i <= n - a; i++) { deque<long long> dq; for (long long j = 0; j < b; j++) { while ((long long)((dq).size()) && mn[i][dq.back()] >= mn[i][j]) dq.pop_back(); dq.push_back(j); } ans += mn[i][dq.front()]; for (long long j = 1; j <= m - b; j++) { if (dq.front() == j - 1) dq.pop_front(); while ((long long)((dq).size()) && mn[i][dq.back()] >= mn[i][j + b - 1]) dq.pop_back(); dq.push_back(j + b - 1); ans += mn[i][dq.front()]; } } return cout << ans, 0; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline int rand(int x, int y) { ++y; return (rng() % (y - x)) + x; } string to_string(char c) { string second(1, c); return second; } string to_string(bool b) { return (b ? true : false ); } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } void degug_out() { cerr << endl; } template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) { cerr << << to_string(H); degug_out(T...); } inline int gcd(int a, int b) { if (a > b) swap(a, b); if (a == 0) return b; return gcd(b % a, a); } int n; int read() { bool neg = false; int res = 0; char c = getchar(); while (true) { if (c == - ) break; if ( 0 <= c && c <= 9 ) break; c = getchar(); } if (c == - ) neg = true; else res = c - 0 ; while (true) { c = getchar(); if (c < 0 || c > 9 ) break; res = (res << 1) + (res << 3) + (c - 0 ); } if (neg) return -res; return res; } const int sz = 670; int store[sz + 2][sz + 2]; int A[(500006)]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); n = read(); for (int i = (0); i <= (int)(n - 1); ++i) { int op, x, y; op = read(), x = read(), y = read(); if (op == 1) { for (int i = (1); i <= (int)(sz); ++i) { store[i][x % i] += y; } A[x] += y; } else { if (x > sz) { int ans = 0; for (int i = y; i <= 500000; i += x) ans += A[i]; cout << ans << n ; } else { cout << store[x][y] << n ; } } } } |
#include <bits/stdc++.h> int f[100005]; int g[100005]; int h[1000005]; int v[100005]; int main() { int n, m = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &f[i]); } for (int i = 1; i <= n; i++) { if (v[i] == 0) { if (f[i] == i) { m++; h[m] = i; v[i] = m; g[i] = m; } else { if (v[f[i]] == 0) { if (f[f[i]] == f[i]) { m++; h[m] = f[i]; v[f[i]] = m; g[f[i]] = m; g[i] = m; } else { puts( -1 ); return 0; } } else { g[i] = v[f[i]]; } } } } printf( %d n , m); for (int i = 1; i <= n; i++) { printf( %d , g[i]); } puts( ); for (int i = 1; i <= m; i++) { printf( %d , h[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int a[MAXN], b[MAXN], c[MAXN]; int tb[MAXN]; int d, n; long long x; long long getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initAB() { for (int i = 0; i < n; i = i + 1) { a[i] = i + 1; } for (int i = 0; i < n; i = i + 1) { swap(a[i], a[getNextX() % (i + 1)]); } for (int i = 0; i < n; i = i + 1) { if (i < d) b[i] = 1; else b[i] = 0; } for (int i = 0; i < n; i = i + 1) { swap(b[i], b[getNextX() % (i + 1)]); } } struct node { int p, num; bool operator<(const node &t) const { return num > t.num; } }; node nd[MAXN]; int main() { while (cin >> n >> d >> x) { initAB(); int cnt = 10000000; for (int i = 0; i < n; i++) { nd[i].num = a[i]; nd[i].p = i; } sort(nd, nd + n); int l = 0; for (int i = 0; i < n; i++) { if (b[i] == 1) { tb[l++] = i; } } memset(c, -1, sizeof(c)); for (int i = 0; i < n; i++) { int p = nd[i].p; for (int j = 0; j < l && cnt > 0; j++) { if (p + tb[j] < n && c[p + tb[j]] == -1) { c[p + tb[j]] = a[p]; } cnt--; } } for (int i = 0; i < n; i++) { if (c[i] == -1) { c[i] = 0; for (int j = 0; j < l && i - tb[j] >= 0; j++) { c[i] = max(c[i], a[i - tb[j]] * b[tb[j]]); } } printf( %d n , c[i]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; string s; cin >> s; long long int i = 0; string ans = s; string w; string temp; long long int k = 1; while (i != n) { if ((n - i) % 2 == 0) { w = s.substr(i, n - i) + s.substr(0, i); } else { temp = s.substr(0, i); reverse(temp.begin(), temp.end()); w = s.substr(i, n - i) + temp; } if (w.compare(ans) < 0) { ans = w; k = i + 1; } i += 1; } cout << ans << endl; cout << k << endl; } return 0; } |
#include <bits/stdc++.h> const double PI = acos(-1.0); const double EPS = 1e-9; using namespace std; template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; typename vector<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << } ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; typename set<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename F, typename S> ostream &operator<<(ostream &os, const map<F, S> &v) { os << [ ; typename map<F, S>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } template <class T> void deb_array(T *arr, int length) { for (int i = 0; i < length; i++) { cout << arr[i] << ; } cout << n ; } const int maxn = 500; const double INF = 1e18 + 1; double p[maxn][maxn], dp[maxn][maxn], prob[maxn][maxn]; int n, m; int main() { ios_base::sync_with_stdio(0); cin >> n; m = 1 << n; for (int i = 1; i <= m; i++) { for (int j = 1; j <= m; j++) { cin >> p[i][j]; p[i][j] /= 100; } } for (int i = 0; i <= m; i++) { for (int j = 0; j <= m; j++) { prob[i][j] = 1.0; } } for (int i = 1; i <= n; i++) { int k = (1 << i); int bonus = k >> 1; for (int j = 0; j <= m; j += k) { int b = j; int e = j + k; int m = (b + e) / 2; for (int c = j + 1; c <= m; c++) { prob[i][c] = 0; for (int d = m + 1; d <= e; d++) { prob[i][c] = prob[i][c] + prob[i - 1][c] * prob[i - 1][d] * p[c][d]; } } for (int c = m + 1; c <= e; c++) { prob[i][c] = 0; for (int d = j + 1; d <= m; d++) { prob[i][c] = prob[i][c] + prob[i - 1][c] * prob[i - 1][d] * p[c][d]; } } for (int c = m + 1; c <= e; c++) { if (prob[i][c] == 0 || (dp[i - 1][c] == 0 && i != 1)) { continue; } for (int d = j + 1; d <= m; d++) { dp[i][c] = max(dp[i][c], dp[i - 1][c] + dp[i - 1][d] + prob[i][c] * bonus); } } for (int c = j + 1; c <= m; c++) { if (prob[i][c] == 0 || (dp[i - 1][c] == 0 && i != 1)) { continue; } for (int d = m + 1; d <= e; d++) { dp[i][c] = max(dp[i][c], dp[i - 1][c] + dp[i - 1][d] + prob[i][c] * bonus); } } } } cout << fixed << setprecision(12) << *max_element(dp[n], dp[n] + m + 1) << n ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.