func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> const int N = 254; const long long INF = 0x3f3f3f3f3f3f3f3fll; int n, t, K; int a[N], d[N]; long long A[N], D[N], lim[N]; long long f[N][N][2], g[N][N][2]; inline void down(long long &x, const long long y) { x > y ? x = y : 0; } inline long long max(const long long x, const long long y) { return x < y ? y : x; } int main() { int i, j, k, r; long long times, time2, rem, need; scanf( %d%d%d , &n, &t, &K); for (i = 1; i <= n; ++i) scanf( %d%d%lld , a + i, d + i, lim + i); ++n, a[n] = d[n] = INT_MAX, lim[n] = INF; for (i = 1; i <= n; ++i) A[i] = A[i - 1] + a[i], D[i] = D[i - 1] + d[i]; memset(f, 63, sizeof f), memset(g, 63, sizeof g); memset(f, 0, sizeof *f), memset(g, 0, sizeof *g); for (i = 1; i <= n; ++i) for (j = 0; j <= t; ++j) for (k = 0; k < 2; ++k) { if ((long long)k * a[i] + (long long)j * d[i] <= lim[i] && f[i - 1][j][k] < INF) { down(f[i][j][k], f[i - 1][j][k]), times = (k * A[i - 1] + j * D[i - 1] + K - 1) / K; if (times * K <= k * A[i] + j * D[i]) down(g[i][j][k], times); } for (r = 0; r < j; ++r) if ((times = g[i][r][k]) < INF) { rem = k * A[i] + r * D[i] - K * times, assert(rem >= 0); need = (max(0, rem + (long long)(j - r) * d[i] - lim[i]) + K - 1) / K; if (need * K <= rem && f[i - 1][j - r][0] < INF) { down(f[i][j][k], times + need + f[i - 1][j - r][0]); time2 = ((j - r) * D[i - 1] + K - 1) / K; if (time2 * K <= (j - r) * D[i] + (rem - need * K)) down(g[i][j][k], times + need + time2); } } } printf( %lld n , f[n][t][1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long C[4003 + 2][4003 + 2]; void pascal() { for (int i = 0; i < 4003; ++i) C[i][i] = C[i][0] = 1; for (int i = 2; i < 4003; ++i) { for (int j = 1; j < i; ++j) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007LL; } } long long pd[4003 + 2]; long long spd[4003]; long long proc(int N) { pd[1] = 1; pd[2] = 3; pd[3] = 10; if (N < 4) return pd[N]; spd[1] = 1; spd[2] = 4; spd[3] = 14; for (int n = 4; n <= N; n++) { for (int i = 2; i < n; i++) { pd[n] = (pd[n] + (spd[i - 1] * C[n][i]) % 1000000007LL) % 1000000007LL; } for (int i = 0; i < n; i++) { pd[n] = (pd[n] + C[n][i]) % 1000000007LL; } spd[n] = (spd[n - 1] + pd[n]) % 1000000007LL; } return pd[N]; } int main() { pascal(); int n; scanf( %d , &n); printf( %lld n , proc(n)); }
|
#include <bits/stdc++.h> const int maxn = 2e7 + 10; const int mod = 998244853; int n, m, qwq[maxn + 5], ifac[maxn + 5], f[maxn + 5]; void zzh_NB(int &x, int y) { (x += y) >= mod && (x -= mod); } int add(int x) { return x >= mod ? x - mod : x; } int readINT() { int xx = 0, ch = getchar(), f = 1; while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) xx = xx * 10 + ch - 0 , ch = getchar(); return xx * f; } int kehaixing(int x) { return x < 0 ? x + mod : x; } int quick_pp(int x, int k) { int ans = 1; for (; k > 0; k >>= 1, x = 1LL * x * x % mod) { if ((k & 1) == 1) ans = 1LL * ans * x % mod; } return ans; } int inv(int x) { return quick_pp(x, mod - 2); } void init(int n) { qwq[0] = 1; for (int i = 1; i <= n; i++) qwq[i] = 1LL * qwq[i - 1] * i % mod; ifac[n] = inv(qwq[n]); for (int i = n; i >= 1; i--) ifac[i - 1] = 1LL * ifac[i] * i % mod; } int wssb(int n, int m) { if (n < m) return 0; return 1LL * qwq[n] * ifac[m] % mod * ifac[n - m] % mod; } int ans = 0; inline void duru() { n = readINT(), m = readINT(); init(n + m); for (int i = 0; i <= n; i++) { f[i] = (i <= n - m ? wssb(n + m, n) : wssb(n + m, n - i)); } for (int i = 0; i <= n; i++) { zzh_NB(ans, 1LL * i * kehaixing(f[i] - f[i + 1]) % mod); } printf( %d n , ans); } int main() { duru(); return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; int main() { cin >> s; long long int ans = 0; vector<string> v; string temp = ; for (int i = 0; i < s.size(); i++) { if (s[i] == . && v.size() != 0) { for (int i = 0; i < v.size(); i++) { if (temp == v[i]) ++ans; } if (temp == ) v.pop_back(); temp = ; continue; } if (s[i] == : ) { for (int i = 0; i < v.size(); i++) { if (temp == v[i]) ++ans; } v.push_back(temp); temp = ; continue; } if (s[i] != , ) temp += s[i]; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:256000000 ) template <class T> T sqr(T a) { return a * a; } double a, d, s; int n; void init() { cin >> a >> d >> n; } void solve() { double x = 0, y = 0; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int t = d / (4 * a); d = d - t * (4 * a); int q = 0; for (int i = 0; i < n; ++i) { double t = d; if (!q) { if (a - x - t < 1e-5) { t -= a - x; x = a; q++; } } else if (q == 1) { if (a - y - t < 1e-5) { t -= a - y; y = a; q++; } } else if (q == 2) { if (x - t < 1e-5) { t -= x; x = 0; q++; } } else { if (y - t < 1e-5) { t -= y; y = 0; q = 0; } } while (t - a > 1e-5) { x += dx[q] * a; y += dy[q] * a; q++; if (q == 4) q = 0; t -= a; } x += dx[q] * t; y += dy[q] * t; printf( %0.4f %0.4f n , x, y); } } int main() { init(); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<char> line; bool isPossible(int gLoc, int k); int main() { int n, k; cin >> n; cin >> k; char curr; int grasshopperLocation; for (int i = 0; i < n; i++) { cin >> curr; line.push_back(curr); if (curr == G ) grasshopperLocation = i; } if (isPossible(grasshopperLocation, k)) cout << YES ; else cout << NO ; return 0; } bool isPossible(int gLoc, int k) { for (int j = gLoc; j < line.size(); j += k) { if (line[j] == T ) return true; else if (line[j] == # ) break; } for (int j = gLoc; j >= 0; j -= k) { if (line[j] == T ) return true; else if (line[j] == # ) break; } return false; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; inline long long getint() { long long _x = 0, _tmp = 1; char _tc = getchar(); while ((_tc < 0 || _tc > 9 ) && _tc != - ) _tc = getchar(); if (_tc == - ) _tc = getchar(), _tmp = -1; while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); return _x * _tmp; } inline long long add(long long _x, long long _y, long long _mod = 1000000007LL) { _x += _y; return _x >= _mod ? _x - _mod : _x; } inline long long sub(long long _x, long long _y, long long _mod = 1000000007LL) { _x -= _y; return _x < 0 ? _x + _mod : _x; } inline long long mul(long long _x, long long _y, long long _mod = 1000000007LL) { _x *= _y; return _x >= _mod ? _x % _mod : _x; } long long mypow(long long _a, long long _x, long long _mod) { if (_x == 0) return 1LL; long long _ret = mypow(mul(_a, _a, _mod), _x >> 1, _mod); if (_x & 1) _ret = mul(_ret, _a, _mod); return _ret; } long long mymul(long long _a, long long _x, long long _mod) { if (_x == 0) return 0LL; long long _ret = mymul(add(_a, _a, _mod), _x >> 1, _mod); if (_x & 1) _ret = add(_ret, _a, _mod); return _ret; } inline bool equal(double _x, double _y) { return _x > _y - 1e-9 && _x < _y + 1e-9; } void sleep(double sec = 1021) { clock_t s = clock(); while (clock() - s < CLOCKS_PER_SEC * sec) ; } int __ = 1, _cs; void build() {} int n; vector<int> vx[100001], vy[100001]; void init() { n = getint(); for (int i = 0, x, y; i < n; i++) { x = getint(); y = getint(); vx[x].push_back(y); vy[y].push_back(x); } for (int i = 0; i < 100001; i++) { sort(vx[i].begin(), vx[i].end()); sort(vy[i].begin(), vy[i].end()); } } int ans; vector<int> cand[100001]; void solve() { for (int x = 0; x < 100001; x++) for (int y : vx[x]) { size_t xptr = upper_bound(vx[x].begin(), vx[x].end(), y) - vx[x].begin(); size_t yptr = upper_bound(vy[y].begin(), vy[y].end(), x) - vy[y].begin(); while (xptr < vx[x].size() and yptr < vy[y].size()) { if (vx[x][xptr] - y == vy[y][yptr] - x) { if (not vx[vy[y][yptr]].empty()) cand[vy[y][yptr]].push_back(vx[x][xptr]); xptr++; yptr++; } else if (vx[x][xptr] - y < vy[y][yptr] - x) xptr = lower_bound(vx[x].begin(), vx[x].end(), y + (vy[y][yptr] - x)) - vx[x].begin(); else yptr = lower_bound(vy[y].begin(), vy[y].end(), x + (vx[x][xptr] - y)) - vy[y].begin(); } } for (int x = 0; x < 100001; x++) { sort(cand[x].begin(), cand[x].end()); size_t ptr = 0; for (int y : cand[x]) { while (ptr < vx[x].size() and vx[x][ptr] < y) ptr++; if (ptr == vx[x].size()) break; ans += (vx[x][ptr] == y); } } cout << ans << endl; } int main() { build(); while (__--) { init(); solve(); } }
|
#include <bits/stdc++.h> #pragma GCC optimize ( O2,unroll-loops ) //#pragma GCC optimize( no-stack-protector,fast-math ) //#pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<pii, int> piii; typedef pair<ll, ll> pll; #define debug(x) cerr<<#x<< = <<(x)<<endl; #define debugp(x) cerr<<#x<< = { <<(x.first)<< , <<(x.second)<< } <<endl; #define debug2(x, y) cerr<< { <<#x<< , <<#y<< } = { <<(x)<< , <<(y)<< } <<endl; #define debugv(v) {cerr<<#v<< : ;for (auto x:v) cerr<<x<< ;cerr<<endl;} #define all(x) x.begin(), x.end() #define pb push_back #define kill(x) return cout<<x<< n , 0; const int inf=1000000010; const ll INF=1000000000000001000LL; const int mod=1000000007; const int MAXN=200010, LOG=18, SGM=26; ll out, ans; int n, m, k, u, v, x, y, t, a, b; map<vector<int>, vector<string>> fuck; int TR[MAXN][SGM], ts; int par[LOG][MAXN]; int inc[MAXN], dest[MAXN]; vector<int> vec[MAXN]; string S[MAXN]; inline int Lcp(string &x, string &y){ int res=0; while (res<m && x[res]==y[res]) res++; return res; } int Count(vector<int> &vec, int l, int r){ // [l...r) return lower_bound(all(vec), r)-lower_bound(all(vec), l); } int GetPar(int v, int k){ for (int i=0; (1<<i)<=k; i++) if (k&(1<<i)) v=par[i][v]; return v; } ll Solve(){ if (m==1) return 1ll*n*(n-1)/2; sort(S, S+n); ll res=0;/* if (n<=2000){ for (int i=0; i<n; i++) for (int j=i+1; j<n; j++){ int l=Lcp(S[i], S[j]), r=m-1; if (l==m){ res++; continue ; } while (r && S[i][r]==S[j][r]) r--; int ok=1; while (l<r){ ok&=(S[i][l]<=S[i][l+1]); l++; } res+=ok; } return res; }*/ ts=0; memset(TR[0], 0, sizeof(TR[0])); vec[0].clear(); for (int i=0; i<n; i++){ vec[0].pb(i); int v=0; for (int j=m-1; ~j; j--){ int c=S[i][j]- a ; if (!TR[v][c]){ TR[v][c]=++ts; par[0][ts]=v; vec[ts].clear(); memset(TR[ts], 0, sizeof(TR[ts])); } v=TR[v][c]; vec[v].pb(i); } dest[i]=v; } for (int i=1; i<=ts; i++) sort(all(vec[i])); for (int j=1; j<LOG; ++j) for (int i=1; i<=ts; i++) par[j][i]=par[j-1][par[j-1][i]]; for (int i=0; i<n; i++){ inc[m-1]=m-1; for (int j=m-2; ~j; j--){ if (S[i][j]<=S[i][j+1]) inc[j]=inc[j+1]; else inc[j]=j; } int l=i+1; for (int lcp=m-1; ~lcp; lcp--){ int dwn=l-1, up=n; while (up-dwn>1){ int mid=(dwn+up)>>1; int tmp=Lcp(S[i], S[mid]); if (tmp<lcp) up=mid; else dwn=mid; } int r=up; if (l==r) continue ; // debug2(inc[lcp], GetPar(dest[i], inc[lcp])) res+=Count(vec[GetPar(dest[i], inc[lcp]+1)], l, r); // cerr<<S[i]<< <<lcp<< <<l<< <<r<< n ; // debug(res) // cerr<< n ; l=r; } } return res; } int main(){ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); //freopen( input.txt , r , stdin); //freopen( output.txt , w , stdout); cin>>n; for (int i=0; i<n; i++){ cin>>S[i]; vector<int> shit(26, 0); for (char ch:S[i]) shit[ch- a ]++; fuck[shit].pb(S[i]); } m=S[0].size(); out=1337ll*n*(n-1)/2; for (auto p:fuck){ n=0; for (string s:p.second) S[n++]=s; out-=1337ll*n*(n-1)/2; out+=2ll*n*(n-1)/2; ans+=Solve(); } debug(ans) cout<<out-ans<< n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long read() { long long x = 0, F = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) F = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 0 ; c = getchar(); } return x * F; } int add(int x, int y) { return (x + y >= 998244353) ? x + y - 998244353 : x + y; } int dec(int x, int y) { return (x - y < 0) ? x - y + 998244353 : x - y; } int mul(int x, int y) { return 1LL * x * y % 998244353; } int n; pair<int, int> a[800000 + 5]; int dp[800000 + 5][7], pre[800000 + 5]; int ans[800000 + 5], pt[800000 + 5]; int cnt; int main() { n = read(); for (int i = 1; i <= n; i++) a[i] = pair<int, int>(read(), i); sort(a + 1, a + n + 1); memset(dp, 0x3f, sizeof(dp)); dp[1][1] = 0, pre[1] = 1; for (int i = 2; i <= n + 1; i++) { for (int j = 1; j <= 5; j++) { dp[i][j + 1] = min(dp[i][j + 1], dp[i - 1][j] - a[i - 1].first + a[i].first); if (j >= 3) { if (dp[i][1] > dp[i - 1][j]) { dp[i][1] = dp[i - 1][j]; pre[i] = j; } } } if (dp[i][1] > dp[i - 1][6]) { dp[i][1] = dp[i - 1][6]; pre[i] = 6; } } printf( %d , dp[n + 1][1]); int p = n + 1; while (p >= 1) { int nxt = p - pre[p]; p = nxt; cnt++; ans[p] = cnt; } printf( %d n , cnt - 1); for (int i = 1; i <= n; i++) if (!ans[i]) ans[i] = ans[i - 1]; for (int i = 1; i <= n; i++) pt[a[i].second] = ans[i]; for (int i = 1; i <= n; i++) printf( %d , pt[i]); }
|
#include <bits/stdc++.h> using namespace std; set<int> s[400000]; int bl[400000], S[400000], sz, n, m; void dfs(int x, int y) { bl[x] = y; ++sz; for (int z : s[x]) if (z != 1 && !bl[z]) dfs(z, y); } void dft(int x) { S[x] = sz; for (int y : s[x]) if (y != 1 && !S[y]) dft(y); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); s[x].insert(y); s[y].insert(x); } if (s[1].count(n)) return printf( 1 n1 %d n , n), 0; for (int x : s[1]) if (s[x].count(n)) return printf( 2 n1 %d %d n , x, n), 0; for (int x : s[1]) for (int y : s[x]) if (s[y].count(n)) return printf( 3 n1 %d %d %d n , x, y, n), 0; for (int x : s[1]) for (int y : s[x]) if (y != 1 && !s[1].count(y)) return printf( 4 n1 %d %d 1 %d n , x, y, n), 0; if (!s[1].size()) return puts( -1 ), 0; for (int x : s[1]) if (!bl[x]) { sz = 0; dfs(x, x); dft(x); } int mn = n + 10, mid = 0; for (int x : s[1]) if (S[x] != s[x].size()) { if (s[x].size() < mn) { mn = s[x].size(); mid = x; } } if (mid) { puts( 5 ); for (int y : s[mid]) if (y != 1) for (int z : s[y]) if (z != 1 && z != mid && !s[mid].count(z)) return printf( 1 %d %d %d %d %d n , mid, y, z, mid, n), 0; } puts( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mx = 19; const long long mx1 = 262150; long long s[mx]; long long n, m, k; long long extra[mx][mx]; long long dp[mx][mx1]; long long solve(long long prev, long long bitmask, long long m) { if (m == 0) return 0; if (dp[prev][bitmask] != -1) return dp[prev][bitmask]; long long ans = INT_MIN; for (long long j = 0; j < mx; j++) { if (bitmask & (1 << j)) ans = max(ans, extra[prev][j + 1] + s[j + 1] + solve(j + 1, bitmask ^ (1 << j), m - 1)); } return dp[prev][bitmask] = ans; } signed main() { cin >> n >> m >> k; for (long long i = 1; i <= n; i++) cin >> s[i]; long long a, b, c; memset(extra, 0, sizeof(extra)); for (long long i = 0; i < k; i++) { cin >> a >> b >> c; extra[a][b] = c; } long long bitmask = (1 << n) - 1; long long prev = 0; memset(dp, -1, sizeof(dp)); cout << solve(prev, bitmask, m) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const long long LINF = 1e17; const double DINF = numeric_limits<double>::max(); const int ITER = 300; const int MOD = 1e9 + 7; const double EPS = 1e-10; const int MAXN = 1e5 + 10; int n; vector<int> g[MAXN]; int B[MAXN]; int dp[MAXN][2]; void mod(int v) { for (int i = 0; i < 2; i++) dp[v][i] %= MOD; } void dfs(int v) { dp[v][0] = 1 - B[v]; dp[v][1] = B[v]; for (int u : g[v]) { int old[2]; old[0] = dp[v][0]; old[1] = dp[v][1]; dp[v][0] = dp[v][1] = 0; dfs(u); dp[v][0] += (1ll * old[0] * dp[u][1]) % MOD; dp[v][1] += (1ll * old[1] * dp[u][1]) % MOD; mod(v); dp[v][1] += (1ll * old[1] * dp[u][0]) % MOD; mod(v); dp[v][1] += (1ll * old[0] * dp[u][1]) % MOD; mod(v); dp[v][0] += (1ll * old[0] * dp[u][0]) % MOD; mod(v); } } void solve() { cin >> n; for (int i = 1; i < n; i++) { int p; cin >> p; g[p].push_back(i); } for (int i = 0; i < n; i++) { cin >> B[i]; } dfs(0); cout << dp[0][1] << endl; } int main() { cout << setprecision(12) << fixed; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int a[3000010], v[2 * 1000010 + 5]; int main() { int n, k, i, mn, ans, j; scanf( %d%d , &n, &k); for (i = 0; i < n; i++) scanf( %d , &a[i]); mn = a[0]; for (i = 1; i < n; i++) mn = min(mn, a[i]); if (mn <= k + 1) { cout << mn; return 0; } ans = k + 1; for (i = 0; i < n; i++) v[a[i]]++; for (i = 1; i <= 2 * 1000010; i++) v[i] += v[i - 1]; for (i = k + 2; i <= mn; i++) { int cnt = 0; for (j = i; j <= 1000010; j += i) cnt += (v[j + k] - v[j - 1]); if (cnt == n) ans = i; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int N; int main(void) { ios_base::sync_with_stdio(false); cin.tie(0); cin >> N; int x = 0; int res = 0; if (N == 1) { printf( 1 n ); printf( 1 n ); return 0; } for (int i = 1; i <= N; i++) { x += i; if (x > N) { res = i - 1; break; } } printf( %d n , res); for (int i = 1; i < res; i++) { printf( %d , i); N -= i; } printf( %d n , N); }
|
#include <bits/stdc++.h> using namespace std; const int maxint = -1u >> 1; template <class T> bool get_max(T& a, const T& b) { return b > a ? a = b, 1 : 0; } template <class T> bool get_min(T& a, const T& b) { return b < a ? a = b, 1 : 0; } int k; int num[26]; string s; int main() { cin >> k; cin >> s; memset(num, 0, sizeof(num)); for (int i = 0; i < s.size(); i++) num[s[i] - a ]++; int flag = 1; for (int i = 0; i < 26; i++) if (num[i] % k != 0) { flag = 0; } if (flag == 0) puts( -1 ); else { string ans; for (int i = 0; i < k; i++) for (int j = 0; j < 26; j++) for (int g = 0; g < num[j] / k; g++) { ans = ans + char(j + a ); } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, sav, mn = 1e9; struct point { long long x, y, uz; } p[2005]; string s; int det(point A, point B, point C) { if (A.x * B.y + A.y * C.x + B.x * C.y - A.x * C.y - A.y * B.x - B.y * C.x < 0) return -1; return 1; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> p[i].x >> p[i].y; if (p[i].y < mn) { mn = p[i].y; sav = i; } } cin >> s; p[sav].uz = 1; cout << sav << ; for (int i = 0; i < s.size(); i++) { int crt = 1, j, sgn; while (p[crt].uz) crt++; j = crt + 1; if (s[i] == R ) sgn = 1; else sgn = -1; while (j <= n) { while (j <= n && p[j].uz) j++; if (j > n) break; if (det(p[sav], p[crt], p[j]) == sgn) crt = j; j++; } sav = crt; p[crt].uz = 1; cout << sav << ; } for (int i = 1; i <= n; i++) if (!p[i].uz) cout << i << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, m; cin >> n >> m; vector<string> v, vec; for (long long i = 1; i <= n; i++) { string s; cin >> s; v.push_back(s); } for (long long i = 1; i <= m; i++) { string s; cin >> s; vec.push_back(s); } long long q; cin >> q; while (q--) { long long a; cin >> a; long long u = a % v.size(); cout << v[(u - 1 + v.size()) % v.size()]; u = a % vec.size(); cout << vec[(u - 1 + vec.size()) % vec.size()]; cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; void z_func(const string &s, vector<int> &z) { int L = 0, R = 0; int n = s.length(); z.resize(n); for (int i = 1; i < n; i++) { if (i > R) { L = R = i; while (R < n && s[R - L] == s[R]) R++; z[i] = R - L; R--; } else { int k = i - L; if (z[k] < R - i + 1) z[i] = z[k]; else { L = i; while (R < n && s[R - L] == s[R]) R++; z[i] = R - L; R--; } } } } int main() { string str; cin >> str; vector<int> z; z_func(str, z); int maxz = 0, res = 0; int n = (int)str.length(); for (int i = 0; i < (int)str.length(); i++) { if (z[i] == n - i) { if (maxz >= z[i]) res = max(res, z[i]); } maxz = max(maxz, z[i]); } if (res == 0) cout << Just a legend << endl; else cout << str.substr(0, res) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n, a, b; cin >> n >> a >> b; ll tot = 6 * n; ll ans = 1e18; if (a * b >= tot) { cout << a * b << n << a << << b << n ; } else { bool swp = false; if (a > b) { swp = true; swap(a, b); } ll na = a, nb = b; for (ll i = 1; i * i <= tot; i++) { ll j = tot / i; if (i * j < tot) j++; if (i >= a && j >= b) { if (i * j >= tot && i * j <= ans) { ans = i * j; na = i; nb = j; } } } if (swp) swap(na, nb); cout << na * nb << n << na << << nb << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; namespace IO { char buf[1 << 23], *p1 = buf, *p2 = buf; template <typename T> inline void read(T &x) { x = 0; register char ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); while (!(ch >= 48 && ch <= 57)) ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); while ((ch >= 48 && ch <= 57)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); } } template <typename T, typename... Args> inline void read(T &t, Args &...args) { read(t); read(args...); } } // namespace IO using namespace IO; const int N = 1e5 + 10, inf = 0x3f3f3f3f; struct ALTXDY { int tp, t, x, y, id; bool operator<(ALTXDY const &a) const { return x == a.x ? tp < a.tp : x < a.x; } }; ALTXDY q[N << 1]; int n, m, k, tot, rt, bus[N], ans[N], c[N << 1], dat[N << 2], ls[N << 2], rs[N << 2]; void update(int &i, int l, int r, int x, int k) { if (!i) i = ++tot; if (bus[dat[i]] < bus[k]) dat[i] = k; if (l == r) return; int mid = (l + r) >> 1; if (x <= mid) update(ls[i], l, mid, x, k); else update(rs[i], mid + 1, r, x, k); } int query(int i, int l, int r, int x, int y, int val) { if (l == r) return dat[i]; int mid = (l + r) >> 1, t = -1; if (x <= mid && ls[i] && bus[dat[ls[i]]] >= val) t = query(ls[i], l, mid, x, y, val); if (t == -1 && y >= mid + 1 && rs[i] && bus[dat[rs[i]]] >= val) t = query(rs[i], mid + 1, r, x, y, val); return t; } int main() { read(n, m); for (int i = 1; i <= n; i++) { int s, f, t; read(s, f, t); q[i] = (ALTXDY){0, t, s, f, i}; c[++k] = t; bus[i] = f; } for (int i = 1; i <= m; i++) { int b, l, r; read(l, r, b); q[i + n] = (ALTXDY){1, b, l, r, i}; c[++k] = b; } sort(c + 1, c + 1 + k); k = unique(c + 1, c + 1 + k) - c - 1; for (int i = 1; i <= n + m; i++) q[i].t = lower_bound(c + 1, c + 1 + k, q[i].t) - c; sort(q + 1, q + 1 + n + m); for (int i = 1; i <= n + m; i++) if (q[i].tp == 0) update(rt, 1, k, q[i].t, q[i].id); else ans[q[i].id] = query(rt, 1, k, q[i].t, k, q[i].y); for (int i = 1; i <= m; i++) printf( %d , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, i; double am, vm2, d, tant, ti, vm, t, s, daux, tfin; int main() { scanf( %d %lf %lf , &n, &am, &d); tant = 0; for (i = 0; i < n; i++) { scanf( %lf %lf , &ti, &vm); t = (vm / am); s = 0.5 * (vm * vm / am); daux = d - s; if (daux < 0) { vm2 = sqrt(2 * d * am); tfin = vm2 / am; tfin += ti; } else { tfin = daux / vm; tfin += (ti + t); } if (tfin > tant) { tant = tfin; } printf( %.10lf n , tant); } return 0; }
|
#include <bits/stdc++.h> using namespace std; namespace io { const int L = (1 << 20) + 1; char buf[L], *S, *T, c; char getchar() { if (__builtin_expect(S == T, 0)) { T = (S = buf) + fread(buf, 1, L, stdin); return (S == T ? EOF : *S++); } return *S++; } int inp() { int x = 0, f = 1; char ch; for (ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; return x * f; } unsigned inpu() { unsigned x = 0; char ch; for (ch = getchar(); !isdigit(ch); ch = getchar()) ; for (; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; return x; } long long inp_ll() { long long x = 0; int f = 1; char ch; for (ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; return x * f; } char B[25], *outs = B + 20, *outr = B + 20; template <class T> inline void print(register T a, register char x = 0) { if (x) *--outs = x, x = 0; if (!a) *--outs = 0 ; else while (a) *--outs = (a % 10) + 48, a /= 10; if (x) *--outs = x; fwrite(outs, outr - outs, 1, stdout); outs = outr; } }; // namespace io using io ::inp; using io ::inp_ll; using io ::inpu; using io ::print; using i32 = int; using i64 = long long; using u8 = unsigned char; using u32 = unsigned; using u64 = unsigned long long; using f64 = double; using f80 = long double; long long power(long long a, long long b, long long p) { if (!b) return 1; long long t = power(a, b / 2, p); t = t * t % p; if (b & 1) t = t * a % p; return t; } template <class T> inline void freshmin(T &a, const T &b) { if (a > b) a = b; } template <class T> inline void freshmax(T &a, const T &b) { if (a < b) a = b; } const int MAXN = 510; const int MAXP = 10000000; const u64 MOD = 1000000007; const f80 MI = f80(1) / MOD; const long long INF = 10000000000000000LL; const long long inf = 5000000000000LL; int n; struct node { long long a, b, k; void init() { scanf( %lld%lld%lld , &a, &b, &k); } bool operator<(const node &A) const { return b > A.b; } } p[MAXN]; long long F[MAXN][MAXN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) p[i].init(); sort(p + 1, p + n + 1); for (int i = 1; i <= n; ++i) for (int j = 0; j <= i; ++j) { F[i][j] = F[i - 1][j] + max(p[i].a - p[i].b * p[i].k, 0LL); if (j) freshmax(F[i][j], F[i - 1][j - 1] + p[i].a - p[i].b * (j - 1)); } cout << *max_element(F[n], F[n] + n + 1) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long N = 2e5 + 5; long long gcd(long long n, long long m) { if (n == 0) return m; else return gcd(m % n, n); } long long a[105], b[105]; vector<pair<long long, long long> > v1, v2; long long dp[103][60000]; long long go(long long pos, long long r) { if (r < 0) return -MOD; if (pos == v2.size()) { return 0; } long long &ans = dp[pos][r]; if (ans != -1) return ans; ans = go(pos + 1, r); if (r >= a[v2[pos].second]) { ans = max(ans, go(pos + 1, r + b[v2[pos].second]) + 1); } return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, r; cin >> n >> r; for (long long i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (b[i] >= 0) { v1.push_back({a[i], b[i]}); } else { v2.push_back({-(a[i] + b[i]), i}); } } memset(dp, -1, sizeof(dp)); if (v1.size() > 0) { sort(v1.begin(), v1.end()); long long ans = 0; for (long long i = 0; i < v1.size(); i++) { if (r >= v1[i].first) { r += v1[i].second; ans++; } } if (v2.size() == 0) { cout << ans << endl; return 0; } sort(v2.begin(), v2.end()); long long k = go(0, r); cout << ans + k << endl; } else { sort(v2.begin(), v2.end()); cout << go(0, r) << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; long long f[N][2], down[N], g[N], h[N], a[N]; vector<int> e[N]; template <typename T> inline void chkmax(T &x, T y) { x = max(x, y); } template <typename T> inline void chkmin(T &x, T y) { x = min(x, y); } template <typename T> inline void read(T &x) { T f = 1; x = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -f; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - 0 ; x *= f; } inline void DFS(int u, int par) { f[u][0] = f[u][1] = down[u] = g[u] = a[u]; for (unsigned i = 0; i < e[u].size(); ++i) { int v = e[u][i]; if (v == par) continue; DFS(v, u); chkmax(f[u][0], f[v][0]); chkmax(f[u][0], f[u][1] + f[v][1]); chkmax(f[u][0], down[u] + g[v]); chkmax(f[u][0], down[v] + g[u]); chkmax(f[u][1], f[v][1]); chkmax(f[u][1], down[u] + down[v]); chkmax(g[u], g[v] + a[u]); chkmax(g[u], down[u] + f[v][1]); chkmax(g[u], down[v] + a[u] + h[u]); chkmax(h[u], f[v][1]); chkmax(down[u], a[u] + down[v]); } } int main() { read(n); for (int i = 1; i <= n; ++i) read(a[i]); for (int i = 1; i < n; ++i) { int u, v; read(u); read(v); e[u].push_back(v); e[v].push_back(u); } DFS(1, 0); printf( %lld n , f[1][0]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, x, y, i, j, a1 = 0, a2 = 0, b1 = 0, b2 = 0; cin >> n >> m; int a[n], b[m]; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < m; i++) cin >> b[i]; for (i = 0; i < n; i++) { if (a[i] % 2 == 1) a1++; else a2++; } for (i = 0; i < m; i++) { if (b[i] % 2 == 1) b1++; else b2++; } x = a1; if (b2 < x) x = b2; y = a2; if (b1 < y) y = b1; cout << x + y; }
|
#include <bits/stdc++.h> using namespace std; int n, s, i, j, k, l, x, y; int a[200010]; struct node { int i; }; bool operator<(node x, node y) { return a[x.i] < a[y.i]; } multiset<node> S; multiset<node>::iterator p, p2; int li[200010]; vector<pair<int, int> > v; int main() { scanf( %d%d , &n, &s); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) S.insert((node){i}); while (!S.empty()) { if (a[(*S.begin()).i] == 0) { S.erase(S.begin()); continue; } p = --S.end(); x = (*p).i; S.erase(p); for (li[0] = 0; a[x]; a[x]--) if (S.empty()) return puts( No ), 0; else { p2 = --S.end(); y = (*p2).i; S.erase(p2); li[++li[0]] = y; a[y]--; v.push_back(make_pair(x, y)); } for (; li[0]; li[0]--) S.insert((node){li[li[0]]}); } if (S.empty()) { printf( Yes n ); printf( %d n , s / 2); for (int k = 0; k < v.size(); k++) printf( %d %d n , v[k].first, v[k].second); } else printf( No n ); scanf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; int read() { char ch = ; int x = 0; bool flag = false; while (!isdigit(ch)) { if (ch == - ) flag = true; ch = getchar(); } while (isdigit(ch)) { x = (x << 3) + (x << 1) + ch - 0 ; ch = getchar(); } return flag ? -x : x; } struct heap { vector<pair<int, int> > v; int loc[N]; heap() { v.push_back(make_pair(-1, -1)); memset(loc, -1, sizeof loc); } void push(pair<int, int> p) { int cur; cur = v.size(); loc[p.second] = cur; v.push_back(p); while (v[cur] < v[cur >> 1]) { swap(v[cur], v[cur >> 1]); swap(loc[v[cur].second], loc[v[cur >> 1].second]); cur >>= 1; } } void pop() { if (empty()) return; swap(v[1], v.back()); loc[v[1].second] = 1; loc[v.back().second] = -1; v.pop_back(); int cur = 1; while ((cur << 1) < v.size()) { if ((cur << 1) + 1 == v.size()) { if (v[cur] > v[cur << 1]) swap(v[cur], v[cur << 1]), swap(loc[v[cur].second], loc[v[cur << 1].second]); break; } if (v[cur] < min(v[cur << 1], v[(cur << 1) + 1])) break; if (v[cur << 1] < v[(cur << 1) + 1]) { swap(v[cur], v[cur << 1]); swap(loc[v[cur].second], loc[v[cur << 1].second]); cur <<= 1; } else { swap(v[cur], v[(cur << 1) + 1]); swap(loc[v[cur].second], loc[v[(cur << 1) + 1].second]); cur = (cur << 1) + 1; } } } pair<int, int> top() { return v[1]; } bool empty() { return v.size() == 1; } }; int n, m; vector<int> bad[N]; vector<pair<int, int> > v[N]; int d[N]; heap pq; int main() { n = read(), m = read(); for (int i = 0; i < m; i++) { int a = read(), b = read(), c = read(); --a, --b; v[a].push_back(make_pair(b, c)); v[b].push_back(make_pair(a, c)); } for (int i = 0; i < n; i++) { int num = read(); while (num--) { bad[i].push_back(read()); } } for (int i = 0; i < n; i++) d[i] = 0x3f3f3f3f; d[0] = 0; pq.push(make_pair(0, 0)); while (!pq.empty()) { pair<int, int> tp = pq.top(); pq.pop(); int t = tp.first; int cur = tp.second; if (t != d[cur]) continue; int j = 0; while (j < bad[cur].size() && bad[cur][j] < t) j++; while (j < bad[cur].size() && bad[cur][j] == t) t++, j++; for (int i = 0; i < v[cur].size(); i++) { int to = v[cur][i].first, cost = v[cur][i].second; if (t + cost < d[to]) { d[to] = t + cost; pq.push(make_pair(d[to], to)); } } } if (d[n - 1] >= 0x3f3f3f3f) puts( -1 ); else cout << d[n - 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int atoi(string s) { int sol = 0, st = 1; for (int i = 0; i < int(s.size()); i++) { sol += (s[i] - 48) * st; st *= 10; } return sol; } int main() { string a, b; cin >> a >> b; reverse(a.begin(), a.end()); cout << atoi(a) + atoi(b) << endl; }
|
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const long long ooo = 9223372036854775807ll; const int _cnt = 1000 * 1000 + 7; const int _p = 1000 * 1000 * 1000 + 7; const int N = 1001005; const double PI = acos(-1.0); const double eps = 1e-9; int o(int x) { return x % _p; } int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } void file_put() { freopen( filename.in , r , stdin); freopen( filename.out , w , stdout); } int p[N], prime[N], phi[N], top, T, X, P, K, pp[N]; long long l, r, mid, ans; void init_prime(int N) { top = 0, phi[1] = 1; for (int i = 2; i <= N; ++i) { if (!p[i]) prime[++top] = i, phi[i] = i - 1; for (int j = 1; j <= top; ++j) { if ((long long)i * prime[j] > N) break; p[i * prime[j]] = 1; if (i % prime[j] == 0) { phi[i * prime[j]] = phi[i] * prime[j]; break; } phi[i * prime[j]] = phi[i] * phi[prime[j]]; } } } void init(int x) { pp[0] = 0; for (int i = 1; i <= top && (long long)prime[i] * prime[i] <= x; i++) if (x % prime[i] == 0) { pp[++pp[0]] = prime[i]; while (x % prime[i] == 0) x /= prime[i]; if (x == 1) return; if (!p[x]) { pp[++pp[0]] = x; return; } } if (x > 1) pp[++pp[0]] = x; } void dfs(int k, int op, long long s, long long n, long long &ans) { if (k > pp[0]) { ans += n / s * op; return; } dfs(k + 1, op, s, n, ans); if (s * pp[k] <= n) dfs(k + 1, -op, s * pp[k], n, ans); } long long Count(long long x) { long long ans = 0; dfs(1, 1, 1, x % P, ans); return x / P * phi[P] + ans; } int main() { scanf( %d , &T); init_prime(N - 5); while (T--) { scanf( %d%d%d , &X, &P, &K), init(P); K += Count(X), l = 1, r = 1e8; while (l <= r) { mid = (l + r) >> 1; if (Count(mid) >= K) ans = mid, r = mid - 1; else l = mid + 1; } printf( %I64d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool cmp(long long x, long long y) { return x > y; } int main() { long long n; cin >> n; string S; cin >> S; vector<long long> C; for (long long i = 0; i < n; i++) { long long x = S[i] - 0 ; if (x == 0 || x == 1) continue; else if (x == 2) C.push_back(2); else if (x == 3) C.push_back(3); else if (x == 4) C.push_back(2), C.push_back(2), C.push_back(3); else if (x == 5) C.push_back(5); else if (x == 6) C.push_back(5), C.push_back(3); else if (x == 7) C.push_back(7); else if (x == 8) C.push_back(7), C.push_back(2), C.push_back(2), C.push_back(2); else if (x == 9) C.push_back(7), C.push_back(3), C.push_back(3), C.push_back(2); } sort(C.begin(), C.end(), cmp); for (auto it : C) cout << it; }
|
#include <bits/stdc++.h> using namespace std; int read() { int x = 0; char c = getchar(); while (c < 0 || 9 < c) c = getchar(); while ( 0 <= c && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return x; } int p[200000 + 5]; int tp, stk[200000 + 5]; int U[200000 + 5], V[200000 + 5]; map<pair<int, int>, bool> Map; int main() { int n = read(), m = read(); for (int i = 1; i <= m; i++) { U[i] = read(), V[i] = read(); Map[make_pair(U[i], V[i])] = 1; Map[make_pair(V[i], U[i])] = 1; } for (int i = 1; i <= n; i++) p[i] = i; for (int t = 100; t >= 0; t--) { random_shuffle(p + 1, p + n + 1); p[n + 1] = p[1]; tp = 0; for (int i = 1; i <= n && tp < m; i++) if (!Map.count(make_pair(p[i], p[i + 1]))) stk[++tp] = i; if (tp == m) { for (int i = 1; i <= m; i++) printf( %d %d n , p[stk[i]], p[stk[i] + 1]); return 0; } } puts( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native ) #pragma GCC optimize( fast-math ) #pragma GCC optimize -O3 long long INF = (long long)1e20; int iINF = (int)1e20; long long mod = 1e9 + 7; long long mult(long long a, long long b) { if (a == 0) return 0; if (a == 1) return (b % mod); if (a % 2) { long long kek = mult(a / 2, b) % mod; kek *= 2; kek %= mod; kek += b; kek %= mod; return kek; } else { long long kek = mult(a / 2, b) % mod; kek *= 2; kek %= mod; return kek; } } long long f(long long r) { long long odd = 0, even = 0; long long now = 1; bool chet = false; while (r > 0) { long long num = min(r, now); if (chet) even += num; else odd += num; r -= now; now *= 2; chet = !chet; } return (mult(odd, odd) + mult(even, even) + even) % mod; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long l, r; cin >> l >> r; cout << (f(r) - f(l - 1) + mod) % mod; }
|
#include <bits/stdc++.h> int in[301]; int c[301]; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int n, i, j; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , in + i); for (i = 1; i <= n; i++) scanf( %d , c + i); for (i = 1; i <= n; i++) { for (j = 2; j * j <= in[i]; j++) { if (in[i] % j == 0) { while (in[i] % j == 0) in[i] /= j; in[i] *= j; } } } std::map<int, int> dp, dt; dp[0] = 0; for (i = 1; i <= n; i++) { for (auto t : dp) { int xx = gcd(t.first, in[i]); int xy = t.second + c[i]; if (dp.count(xx) == 0 || dp[xx] > xy) { if (dt.count(xx) == 0 || dt[xx] > xy) dt[xx] = xy; } } for (auto t : dt) { dp[t.first] = t.second; } dt.clear(); } if (dp.count(1) == 0) printf( -1 ); else printf( %d , dp[1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { char c = getchar(); int n = 0; bool f = 0; while (c < 0 || c > 9 ) { if (c == - ) f = 1; c = getchar(); } while (c >= 0 && c <= 9 ) { n = (n << 1) + (n << 3) + (c ^ 48); c = getchar(); } return f ? -n : n; } int r, c, n, t, x, y, ans, res; bool m[101][101]; int main() { r = read(), c = read(), n = read(), t = read(); for (int i = 1; i <= n; i++) { x = read(), y = read(); m[x][y] = 1; } for (int i = 1; i <= r; i++) for (int j = 1; j <= c; j++) for (int k = i; k <= r; k++) for (int h = j; h <= c; h++) { res = 0; for (int a = i; a <= k; a++) for (int b = j; b <= h; b++) if (m[a][b]) res++; if (res >= t) ans++; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool umax(T &a, T b) { return a < b ? (a = b, true) : false; } long long POW(long long a, long long p, long long M) { if (!p) return 1LL; long long T = POW(a, p / 2, M); T = T * T % M; if (p & 1) T = T * (a % M) % M; return T; } long long SQRT(long long a) { long long b = (long long)sqrtl(((double)a) + 0.5); while (b * b < a) ++b; while (b * b > a) --b; return (b * b == a) ? b : -1; } const long long MOD = 1e9 + 7; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.precision(10); cout << fixed; long long n, m; cin >> n >> m; if (n == 1) { cout << 0 << endl; return 0; } vector<vector<long long>> guess(n + 1); long long f = 0; long long N = 2e5; long long fq[4 * N]; memset(fq, 0, sizeof(fq)); for (long long i = 1; i <= n; i++) fq[N + i] = 1; for (long long i = 1; i <= n; i++) { long long mx = min(n, i + m + 1); f += 2 * (mx - i + 1) - 1; } long long st; for (long long i = 1; i <= m; i++) { long long a; cin >> a; guess[a].push_back(i); } for (long long i = 1; i <= n; i++) { if (guess[i].empty()) continue; long long ss = guess[i][0]; for (long long j = 1; j <= guess[i].size(); ++j) { if (j < guess[i].size() && guess[i][j] == guess[i][j - 1] + 1) continue; else { long long ct = 0; for (long long k = i - ss; k >= i - guess[i][j - 1]; --k) { long long org = min(n, k + m + 1); long long wt = min(n, k + m - (guess[i][j - 1] + (k - i) + 1) + 1); f -= fq[N + k] * (org - wt); ct += fq[N + k]; fq[N + k] = 0; } fq[N + i - guess[i][j - 1] - 1] += ct; if (j < guess[i].size()) ss = guess[i][j]; } } } memset(fq, 0, sizeof(fq)); for (long long i = 1; i <= n; i++) fq[i] = 1; for (long long i = n; i >= 1; i--) { if (guess[i].empty()) continue; long long ss = guess[i][0]; for (long long j = 1; j <= guess[i].size(); ++j) { if (j < guess[i].size() && guess[i][j] == guess[i][j - 1] + 1) continue; else { long long ct = 0; for (long long k = i + ss; k <= i + guess[i][j - 1]; ++k) { long long org = max(1LL, k - m - 1); long long wt = max(1LL, k - m + (guess[i][j - 1] - (k - i) + 1) - 1); f -= fq[k] * (wt - org); ct += fq[k]; fq[k] = 0; } fq[i + guess[i][j - 1] + 1] += ct; if (j < guess[i].size()) ss = guess[i][j]; } } } cout << f << endl; cerr << Time elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n; inline bool check2(long long x, long long y3) { return (x * x + y3 * y3 * 3 <= n * n); } inline bool check(long long x, long long y3) { return check2(x - 2, y3) & check2(x - 1, y3 - 1) & check2(x + 1, y3 - 1) & check2(x + 2, y3) & check2(x + 1, y3 + 1) & check2(x - 1, y3 + 1); } long long calc(long long x, long long d) { long long l = 0, r = 3e6; while (l < r) { long long mid = (l + r + 1) / 2; long long y3 = d + mid * 2; if (check(x, y3)) l = mid; else r = mid - 1; } long long ret = r * 2; if (d == 0 && check(x, 0)) ret += 1; if (d == 1 && check(x, d)) ret += 2; return ret; } int main() { ios::sync_with_stdio(false); cin >> n; n *= 2; long long s = 0; int x = 3, d = 1; while (true) { long long t = calc(x, d); if (t == 0) break; s += t; x += 3, d ^= 1; } s *= 2; s += calc(0, 0); cout << s << endl; }
|
#include <bits/stdc++.h> inline int getint() { register char ch; while (!isdigit(ch = getchar())) ; register int x = ch ^ 0 ; while (isdigit(ch = getchar())) x = (((x << 2) + x) << 1) + (ch ^ 0 ); return x; } const long long mod = 1e9 + 7; const int N = 150001, M = 150002, K = 100001; void exgcd(const long long &a, const long long &b, long long &x, long long &y) { if (!b) { x = 1; y = 0; return; } exgcd(b, a % b, y, x); y -= a / b * x; } inline long long inv(const long long &x) { long long tmp, ret; exgcd(x, mod, ret, tmp); return (ret + mod) % mod; } long long f[2][M]; long long p[M], q[M]; long long fact[K], tcaf[K]; int k; inline long long calc(const int &x) { return fact[k] * tcaf[k - x] % mod * tcaf[x] % mod * p[x] % mod * q[k - x] % mod; } signed main() { int n = getint(), m = getint(); long long a = getint(), b = getint(); k = getint(); fact[0] = 1; for (register int i = 1; i <= k; i++) { fact[i] = fact[i - 1] * i % mod; } tcaf[k] = inv(fact[k]); for (register int i = k - 1; ~i; i--) { tcaf[i] = tcaf[i + 1] * (i + 1) % mod; } p[0] = q[0] = 1; p[1] = a * inv(b) % mod; q[1] = (b - a) * inv(b) % mod; for (register int i = 2; i <= k; i++) { p[i] = p[i - 1] * p[1] % mod; q[i] = q[i - 1] * q[1] % mod; } f[0][m] = 1; for (register int i = 1; i <= n; i++) { long long s1 = 0, s2 = 0; for (register int j = 0; j <= m; j++) { f[i & 1][j] = (s1 * (f[!(i & 1)][m] - f[!(i & 1)][m - j]) - s2) % mod * calc(m - j) % mod; s1 = (s1 + calc(j)) % mod; s2 = (s2 + f[!(i & 1)][j] * calc(j)) % mod; } for (register int j = 1; j <= m; j++) { f[i & 1][j] = (f[i & 1][j] + f[i & 1][j - 1]) % mod; } } printf( %I64d n , (f[n & 1][m] + mod) % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { register int x = 0, t = 1; register char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) t = -1, ch = getchar(); while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 48, ch = getchar(); return x * t; } struct Line { int v, next; }; struct Link { Line e[444444 << 1]; int h[444444], cnt; void Add(int u, int v) { e[++cnt] = (Line){v, h[u]}; h[u] = cnt++; e[++cnt] = (Line){u, h[v]}; h[v] = cnt++; } } Gr, Tr; multiset<int> MS[444444]; int W[444444]; int n, m, Q, Tot; struct Graph { int dfn[444444], low[444444], S[444444], tim, top; void Tarjan(int u) { dfn[u] = low[u] = ++tim; S[++top] = u; for (int i = Gr.h[u]; i; i = Gr.e[i].next) { int v = Gr.e[i].v; if (!dfn[v]) { Tarjan(v); low[u] = min(low[u], low[v]); if (low[v] >= dfn[u]) { Tr.Add(++Tot, u); int x; do { x = S[top--]; Tr.Add(Tot, x); } while (v != x); } } else low[u] = min(low[u], dfn[v]); } } } G; struct SegMentTree { int t[444444 << 2]; void Modify(int now, int l, int r, int p, int w) { if (l == r) { t[now] = w; return; } int mid = (l + r) >> 1; if (p <= mid) Modify((now << 1), l, mid, p, w); else Modify((now << 1 | 1), mid + 1, r, p, w); t[now] = min(t[(now << 1)], t[(now << 1 | 1)]); } int Query(int now, int l, int r, int L, int R) { if (L <= l && r <= R) return t[now]; int ret = 1e9, mid = (l + r) >> 1; if (L <= mid) ret = min(ret, Query((now << 1), l, mid, L, R)); if (R > mid) ret = min(ret, Query((now << 1 | 1), mid + 1, r, L, R)); return ret; } } SMT; int fa[444444], tim, dfn[444444], low[444444]; int size[444444], hson[444444], top[444444], dep[444444]; void dfs1(int u, int ff) { fa[u] = ff; dep[u] = dep[ff] + 1; size[u] = 1; if (u <= n && ff) MS[ff].insert(W[u]); for (int i = Tr.h[u]; i; i = Tr.e[i].next) { int v = Tr.e[i].v; if (v == ff) continue; dfs1(v, u); size[u] += size[v]; if (size[v] > size[hson[u]]) hson[u] = v; } } void dfs2(int u, int tp) { top[u] = tp; dfn[u] = ++tim; low[tim] = u; if (hson[u]) dfs2(hson[u], tp); for (int i = Tr.h[u]; i; i = Tr.e[i].next) if (Tr.e[i].v != fa[u] && Tr.e[i].v != hson[u]) dfs2(Tr.e[i].v, Tr.e[i].v); } int Query(int u, int v) { int ret = 1e9; while (top[u] ^ top[v]) { if (dep[top[u]] < dep[top[v]]) swap(u, v); ret = min(ret, SMT.Query(1, 1, Tot, dfn[top[u]], dfn[u])); u = fa[top[u]]; } if (dep[u] > dep[v]) swap(u, v); ret = min(ret, SMT.Query(1, 1, Tot, dfn[u], dfn[v])); if (u <= n) return ret; else return min(ret, W[fa[u]]); } void Modify(int u, int w) { if (fa[u]) { MS[fa[u]].erase(MS[fa[u]].find(W[u])); MS[fa[u]].insert(w); SMT.Modify(1, 1, Tot, dfn[fa[u]], *MS[fa[u]].begin()); } W[u] = w; SMT.Modify(1, 1, Tot, dfn[u], w); } int main() { Tot = n = read(); m = read(); Q = read(); W[0] = 1e9; for (int i = 1; i <= n; ++i) W[i] = read(); for (int i = 1; i <= m; ++i) Gr.Add(read(), read()); G.Tarjan(1); dfs1(1, 0); dfs2(1, 1); for (int i = 1; i <= n; ++i) SMT.Modify(1, 1, Tot, dfn[i], W[i]); for (int i = n + 1; i <= Tot; ++i) SMT.Modify(1, 1, Tot, dfn[i], *MS[i].begin()); char ch[2]; while (Q--) { scanf( %s , ch); int a = read(), b = read(); if (ch[0] == C ) Modify(a, b); else printf( %d n , Query(a, b)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long dp[5005][5005], bad[30][5005], pre[5005]; const long long MOD = 1e9 + 7; long long fact[5005]; long long qikpow(long long a, long long b) { if (!b) { return 1; } long long ret = qikpow(a, b / 2); ret *= ret; ret %= MOD; if (b & 1) { ret *= a; ret %= MOD; } return ret; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; fact[0] = 1; dp[0][0] = 1; pre[0] = 1; for (int i = 1; i <= N; i++) { char c; cin >> c; fact[i] = (fact[i - 1] * i) % MOD; for (int k = 1; k <= i; k++) { dp[i][k] = pre[k - 1]; dp[i][k] = (dp[i][k] - bad[c - a ][k - 1] + MOD) % MOD; dp[i][k] = (dp[i][k] - bad[c - a ][k] + MOD) % MOD; } for (int k = 1; k <= i; k++) { bad[c - a ][k] = (bad[c - a ][k] + dp[i][k]) % MOD; pre[k] = (pre[k] + dp[i][k]) % MOD; } } long long ans = 0; for (int i = 1; i <= N; i++) { ans += pre[i] * fact[N - 1] % MOD * qikpow(fact[i - 1] * fact[N - i] % MOD, MOD - 2) % MOD; ans %= MOD; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int n, s[3000 + 5], c[3000 + 5], f[3000 + 5][5]; inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 , ch = getchar(); return s * w; } int main() { n = read(); memset(f, inf, sizeof(f)); for (int i = 1; i <= n; i++) s[i] = read(); for (int i = 1; i <= n; i++) c[i] = read(); for (int i = 1; i <= n; i++) { f[i][1] = c[i]; for (int j = 1; j < i; j++) if (s[j] < s[i]) f[i][2] = min(f[j][1] + c[i], f[i][2]); for (int j = 1; j < i; j++) if (s[j] < s[i]) f[i][3] = min(f[j][2] + c[i], f[i][3]); } int ans = inf; for (int i = 1; i <= n; i++) if (f[i][3]) ans = min(ans, f[i][3]); if (ans == inf) cout << -1; else cout << ans; return 0; }
|
#include <bits/stdc++.h> int main() { long long a, sum, l, i, b; char ch[10]; while (scanf( %I64d , &a) != EOF) { getchar(); scanf( %s , ch); l = strlen(ch); b = 0; for (i = l - 1; i > 0; i--) b = (ch[i] - 0 + b) * 10; b = ch[0] - 0 + b; sum = a + b; printf( %I64d n , sum); } }
|
#include <bits/stdc++.h> int x[5], j = 1, b, d, ans, t, i, u = 0; void GCD(int a, int b) { if (a == b) { x[j] = a; j++; } else if (a < b) GCD(b - a, a); else GCD(a - b, b); } int main() { scanf( %d , &b); scanf( %d , &d); GCD(b - 1, d); GCD(b, d); GCD(b + 1, d); GCD(x[1], x[3]); t = (x[1] * x[2] * x[3] / x[4]) % d; for (i = 1; i <= 8; i++) { if (t == 0) { u = i; break; } else t = (t * x[2]) % d; } if (u == 0) ans = 7; else { if (x[1] == 1 && x[3] == 1) ans = 2; else if (x[2] == 1 && x[3] == 1) ans = 3; else if (x[1] == 1 && x[2] == 1) ans = 11; else if (x[1] == 1 || x[3] == 1) ans = 6; else if (x[2] > 1) ans = 6; else if (x[3] == 2) ans = 3; else if (x[1] == 2 && x[3] > 2) ans = 11; else ans = 6; } printf( %d-type , ans); if (ans == 2) printf( n%d , u); }
|
#include <bits/stdc++.h> using namespace std; const long long N = 50; long long dp[N]; void solve() { long long n; cin >> n; long long count = 0; while (n > 0) { long long quotient = n / 3; long long rem = n % 3; n = n / 3; dp[count] = rem; count++; } for (long long i = 0; i < N; i++) { if (dp[i] == 0 || dp[i] == 1) continue; else { dp[i] = -1; dp[i + 1] += 1; } } long long finalAns = 0; for (long long i = N - 1; i >= 0; i--) { if (dp[i] == 0) continue; if (dp[i] == -1) break; else { long long coeff = dp[i]; finalAns += pow(3, i); } } cout << finalAns << endl; for (long long i = 0; i < N; i++) dp[i] = 0; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = int(1e9 + 7), MAXN = int(1e3 + 50); int n, s[MAXN], br, raz, z[MAXN]; vector<int> v[MAXN]; vector<pair<pair<int, int>, int>> rez; void dfs(int i, int ot) { s[i] = 1; for (auto j : v[i]) if (j != ot) { dfs(j, i); s[i] += s[j]; } } int centroid() { dfs(1, -1); int c = 1, ot = -1; while (1) { int br = 1; for (auto j : v[c]) if (j != ot && 2 * s[j] >= n) { br = 0; ot = c; c = j; break; } if (br) break; } return c; } void dfs2(int i, int ot) { br += raz; z[i] = br; rez.push_back({{i, ot}, z[i] - z[ot]}); for (auto j : v[i]) if (j != ot) dfs2(j, i); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n; for (int i = 1; i <= n - 1; i++) { int p, q; cin >> p >> q; v[p].push_back(q); v[q].push_back(p); } if (n == 1) { exit(0); } if (n == 2) { printf( 1 2 1 n ); exit(0); } int c = centroid(); dfs(c, -1); vector<pair<int, int>> v2, g1, g2; multiset<pair<int, vector<int>>> sv; for (auto i : v[c]) { vector<int> vv{i}; sv.insert({s[i], vv}); } while (sv.size() > 2) { auto pom1 = *sv.begin(); sv.erase(sv.begin()); auto pom2 = *sv.begin(); sv.erase(sv.begin()); vector<int> vu; for (auto i : pom1.second) vu.push_back(i); for (auto i : pom2.second) vu.push_back(i); sv.insert({pom1.first + pom2.first, vu}); } auto a = *sv.begin(); sv.erase(sv.begin()); auto b = *sv.begin(); sv.erase(sv.begin()); z[c] = 0; br = 0; raz = 1; for (auto i : a.second) dfs2(i, c); br = 0; raz = a.first + 1; for (auto i : b.second) dfs2(i, c); for (auto i : rez) printf( %d %d %d n , i.first.first, i.first.second, i.second); return 0; }
|
#include <bits/stdc++.h> using namespace std; const uint64_t seed = std::chrono::system_clock::now().time_since_epoch().count(); mt19937_64 rnd(seed); const int MOD = 998244353; void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; set<pair<long long, long long>> ss; int cnt = 0; long long x = 1, y = 0; auto has = [&](int v) { long long d = (v - y) / x; auto it = ss.upper_bound({d, LLONG_MAX}); if (it != ss.begin()) { it = prev(it); return it->first <= d && it->second >= d; } return false; }; for (int p : a) { if (p % 2 == 0 && has(p / 2)) { ss.clear(); ss.insert({p / 2, p / 2}); x = 1, y = 0; continue; }; x = -x; y = p - y; cnt++; if (p % 2 == 0) { long long d = (p / 2 - y) / x; ss.insert({d, d}); } long long r1 = (1 - y) / x; long long r2 = (p - 1 - y) / x; if (r1 > r2) swap(r1, r2); for (auto it = ss.begin(); it != ss.end();) { long long aa, bb; tie(aa, bb) = *it; aa = max(aa, r1); bb = min(bb, r2); if (aa > bb) it = ss.erase(it); else { ss.erase(it); ss.insert({aa, bb}); break; } } for (auto it = ss.rbegin(); it != ss.rend();) { long long aa, bb; tie(aa, bb) = *it; aa = max(aa, r1); bb = min(bb, r2); it = decltype(it){ss.erase(next(it).base())}; if (aa <= bb) { ss.insert({aa, bb}); break; } } if (ss.empty()) { cnt++; ss.insert({r1, r2}); } } cout << cnt << n ; } int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); cout.precision(10); int T = 1; cin >> T; for (int i = 1; i <= T; i++) { solve(); } cout.flush(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 200005; long long n, m, u, v, k; long long flag; long long a[N]; long long x, y, z; long long aa, bb, cc, dd; long long ans[100005]; long long sum; void init() {} long long gcd(long long x, long long y) { if (!y) return x; return gcd(y, x % y); } struct node { long long x, id; bool operator<(const node t) const { return x < t.x; } }; long long getn(long long x, long long y, long long z) { long long n; cout << ? << x << << y << << z << endl; cin >> n; return n; } void solve() { init(); cin >> n; sum = 0; for (long long i = 1; i <= n; i++) { a[i] = 0; } for (long long i = 0; i < n / 3; i++) { ans[i] = getn(i * 3 + 1, i * 3 + 2, i * 3 + 3); if (!ans[i]) { u = i; } else { v = i; } } aa = getn(u * 3 + 1, u * 3 + 2, v * 3 + 1); bb = getn(u * 3 + 1, u * 3 + 2, v * 3 + 2); cc = getn(v * 3 + 1, v * 3 + 2, u * 3 + 1); dd = getn(v * 3 + 1, v * 3 + 2, u * 3 + 2); if (aa + bb == 0) { x = u * 3 + 1; } else { x = u * 3 + 3; } a[x] = 0; if (cc + dd == 2) { y = v * 3 + 1; } else { y = v * 3 + 3; } a[y] = 1; for (long long i = 0; i < n / 3; i++) { if (ans[i]) { aa = getn(i * 3 + 1, i * 3 + 2, x); bb = getn(i * 3 + 2, i * 3 + 3, x); if (aa + bb == 0) { a[i * 3 + 1] = 1; a[i * 3 + 2] = 0; a[i * 3 + 3] = 1; } else if (aa + bb == 2) { a[i * 3 + 1] = 1; a[i * 3 + 2] = 1; a[i * 3 + 3] = 1; } else if (aa == 1) { a[i * 3 + 1] = 1; a[i * 3 + 2] = 1; a[i * 3 + 3] = 0; } else { a[i * 3 + 1] = 0; a[i * 3 + 2] = 1; a[i * 3 + 3] = 1; } } else { aa = getn(i * 3 + 1, i * 3 + 2, y); bb = getn(i * 3 + 2, i * 3 + 3, y); if (aa + bb == 0) { a[i * 3 + 1] = 0; a[i * 3 + 2] = 0; a[i * 3 + 3] = 0; } else if (aa + bb == 2) { a[i * 3 + 1] = 0; a[i * 3 + 2] = 1; a[i * 3 + 3] = 0; } else if (aa == 1) { a[i * 3 + 1] = 1; a[i * 3 + 2] = 0; a[i * 3 + 3] = 0; } else { a[i * 3 + 1] = 0; a[i * 3 + 2] = 0; a[i * 3 + 3] = 1; } } } for (long long i = 1; i <= n; i++) { if (a[i] == 0) sum++; } cout << ! << sum << ; for (long long i = 1; i <= n; i++) { if (a[i] == 0) cout << i << ; } cout << endl; } signed main() { long long t = 1; cin >> t; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; bool compare(const int a, const int b) { if (a <= b) { return false; } return true; } int main() { int t; cin >> t; for (int i = 0; i < t; i++) { string s; cin >> s; int last_count = 0; vector<int> arr; for (int j = 0; j < s.length(); j++) { if (j == 0) { if (s[0] == 1 ) { last_count++; } } else { if (s[j] == 0 ) { if (last_count != 0) { arr.push_back(last_count); } last_count = 0; } else { last_count++; } } } if (last_count != 0) { arr.push_back(last_count); } if (arr.size() == 0) { cout << 0 << endl; } else { sort(arr.begin(), arr.end(), compare); int alice_Count = 0; for (int j = 0; j < arr.size(); j++) { if (j % 2 == 0) { alice_Count += arr[j]; } } cout << alice_Count << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1000 * 1000 * 1000; const double PI = acos(-1.0); const int MAX = 150005; int n, len, h; pair<int, int> a[MAX]; int b[MAX]; pair<int, int> T[MAX * 8]; int lazy[MAX * 8]; bool pzdc[MAX]; void push(int v) { T[v].first += lazy[v]; lazy[v * 2] += lazy[v]; lazy[v * 2 + 1] += lazy[v]; lazy[v] = 0; } void upd(int v, int tl, int tr, int l, int r, int delta) { push(v); if (l > r) return; if (tl == l && tr == r) { lazy[v] += delta; push(v); return; } int tm = (tl + tr) / 2; upd(v * 2, tl, tm, l, min(r, tm), delta); upd(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, delta); T[v] = min(T[v * 2], T[v * 2 + 1]); } void build(int v, int tl, int tr) { if (tl == tr) { T[v].second = tl; return; } int tm = (tl + tr) / 2; build(v * 2, tl, tm); build(v * 2 + 1, tm + 1, tr); T[v] = min(T[v * 2], T[v * 2 + 1]); } int main() { ios_base::sync_with_stdio(0); cin >> n >> len >> h; build(1, 0, n - len); for (int i = 0; i < len; i++) cin >> b[i]; sort(b, b + len); for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; } sort(a, a + n); int ptr = n - 1; for (int i = 0; i < len; i++) { while (ptr >= 0 && a[ptr].first + b[i] >= h) { upd(1, 0, n - len, max(0, a[ptr].second - len + 1), min(n - len, a[ptr].second), 1); ptr--; } while (T[1].first <= i) { pzdc[T[1].second] = 1; upd(1, 0, n - len, T[1].second, T[1].second, INF); } } int ans = 0; for (int i = 0; i < n - len + 1; i++) ans += !pzdc[i]; cout << ans; }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> a; int main(int argc, char *argv[]) { int n; cin >> n; if (n == 1) { cout << 1; return 0; } if (n == 2) { cout << 1 << << 2; return 0; } if (n == 3) { cout << 1 << << 1 << << 3; return 0; } int so = 1, ts = 2, ss = n, luu = 1; while (ss > 2) { int m = n / ts; m = ss - m; for (int i = 1; i <= m; i++) cout << luu << ; ss = ss - m; if (ss == 1) { cout << ts; return 0; } if (ss == 2) { cout << ts << << ts * 2; return 0; } if (ss == 3) { cout << ts << << ts << << ts * 3; return 0; } luu = ts; ts = ts * 2; } }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int> > T; vector<vector<int> > T2; set<int> att; bool keep[123456 + 5]; bool hasa(int from, int v) { keep[v] = false; if (att.find(v) != att.end()) keep[v] = 1; for (int i = 0; i < T[v].size(); ++i) { if (T[v][i] != from) keep[v] |= hasa(v, T[v][i]); } return keep[v]; } map<pair<int, int>, long long> dp[2]; long long get(bool back, int from, int v) { pair<int, int> state(from, v); if (dp[back].find(state) == dp[back].end()) { long long ans = 0; for (int i = 0; i < T2[v].size(); ++i) { int u = T2[v][i]; if (u == from) continue; ans += 2 + get(true, v, u); } long long a2 = ans; if (!back) { for (int k = 0; k < T2[v].size(); ++k) { int u = T2[v][k]; if (u == from) continue; a2 = min(a2, ans - 2 - get(true, v, u) + 1 + get(false, v, u)); } } dp[back][state] = a2; } return dp[back][state]; } int main() { int n, m; cin >> n >> m; for (int i = 0; i <= n; ++i) { T.push_back(vector<int>()); T2.push_back(vector<int>()); } for (int i = 1; i < n; ++i) { int a, b; cin >> a >> b; T[a].push_back(b); T[b].push_back(a); } for (int i = 0; i < m; ++i) { int a; cin >> a; att.insert(a); } fill(keep, keep + n, false); hasa(-1, *att.begin()); for (int i = 1; i <= n; ++i) { for (int j = 0; j < T[i].size(); ++j) { int u = T[i][j]; if (keep[i] && keep[u]) T2[i].push_back(u); } } long long vert = -1, mn = 0x7fffffffffffffff; for (int i = 1; i <= n; ++i) { if (keep[i]) { long long score = get(false, -1, i); if (score < mn) { vert = i; mn = score; } } } cout << vert << n << mn << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5; const long long inf = 0x3f3f3f3f3f; long long a[1010][1010]; long long n, k; int main() { cin >> n >> k; long long cnt = 0; for (int i = 1; i <= n; i++) { for (int j = n; j >= k; j--) { a[i][j] = n * n - cnt; cnt++; } } long long fcnt = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j < k; j++) { fcnt++; a[i][j] = fcnt; } } long long sum = 0; for (int i = 1; i <= n; i++) sum += a[i][k]; cout << sum << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cout << a[i][j] << ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; signed main() { string s; cin >> s; long long n = s.size(); long long an = 0; for (long long i = 0; i < n; i++) { long long r = INT_MAX; for (long long j = i; j <= min((long long)(i + 9), n - 1); j++) { for (long long k = 1; k <= 8; k++) { if (j + 2 * k < n) { if (s[j] == s[j + k] and s[j] == s[j + 2 * k]) { r = min(r, j + 2 * k); } } } } if (r != INT_MAX) an = an + n - r; } cout << an << endl; }
|
#include <bits/stdc++.h> using namespace std; bool cmp(string s1, string s2) { return (s1 + s2) < (s2 + s1); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z; cin >> n; vector<string> v1; string s1; for (i = 0; i < n; i++) { cin >> s1; v1.push_back(s1); } sort(v1.begin(), v1.end(), cmp); for (i = 0; i < n; i++) cout << v1[i]; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c, d, e, i, j, has = 0; cin >> a >> b; has += (a / 5) * (b / 5); c = a / 5; d = b / 5; if (a % 5 >= 1) c++; if (b % 5 >= 4) d++; has += (c * d); c = a / 5; d = b / 5; if (a % 5 >= 2) c++; if (b % 5 >= 3) d++; has += (c * d); c = a / 5; d = b / 5; if (a % 5 >= 3) c++; if (b % 5 >= 2) d++; has += (c * d); c = a / 5; d = b / 5; if (a % 5 >= 4) c++; if (b % 5 >= 1) d++; has += (c * d); cout << has << n ; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) using namespace std; const int N = 3e5 + 100; set<pair<int, int> > s[N]; int a[N]; int nxt[N]; int dp[N]; int mol[N]; int n; void add(long long int v, long long int u) { long long int m = mol[u]; if (m != n + 2) s[m].insert({a[v], v}); mol[v] = mol[u]; } int tt; void Main(long long int oo) { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; nxt[i] = n + 2; s[i].clear(); dp[i] = 0; } s[n + 1].clear(); s[n + 2].clear(); a[n + 1] = -1; a[n + 2] = -1; dp[n + 2] = 0; dp[n + 1] = 0; nxt[n + 2] = n + 2; mol[n + 2] = n + 2; nxt[n + 1] = n + 1; for (int i = 1; i <= n + 1; i++) { mol[i] = n + 1; } vector<int> pashm; for (int i = n; i; i--) { if (a[i] == a[i + 1]) { nxt[i] = i + 2; add(i, i + 2); } else { long long int z = mol[nxt[i + 1]]; if (z == n + 3) z = n + 2; auto y = s[z].lower_bound({a[i], 0}); if (y != s[z].end() && y->first == a[i]) { long long int p = y->second; nxt[i] = p + 1; add(i, p + 1); } else { mol[i] = i; nxt[i] = n + 2; add(i, i); } } } long long int ans = 0; for (int i = n; i; i--) { if (nxt[i] != n + 2) { dp[i] = 1 + dp[nxt[i]]; } ans += dp[i]; } cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> tt; for (int i = 1; i <= tt; i++) Main(i); }
|
#include <bits/stdc++.h> using namespace std; template <class n, class second> ostream &operator<<(ostream &p, pair<n, second> x) { return p << < << x.first << , << x.second << > ; } template <class n> auto operator<<(ostream &p, n y) -> typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type { int o = 0; p << { ; for (auto c : y) { if (o++) p << , ; p << c; } return p << } ; } void dor() { cerr << endl; } template <class n, class... second> void dor(n p, second... y) { cerr << p << ; dor(y...); } template <class n, class second> void mini(n &p, second y) { if (p > y) p = y; } template <class n, class second> void maxi(n &p, second y) { if (p < y) p = y; } const int M = 1024 * 256; int n, k, x; int in[M]; int main() { scanf( %d%d , &n, &k); for (int i = (2); i <= (int)(n); ++i) { int a, b; scanf( %d%d , &a, &b); in[a]++; in[b]++; } for (int i = (1); i <= (int)(n); ++i) { if (in[i] == 1) { x++; } } printf( %.9Lf n , (long double)(k * 2) / x); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 5; const long long INF = 1e18 + 5; const long long maxn = 5e5 + 5; long long n = 1000000007, d[151111], mx = -1000000001; long long a[1511111], ok[100005], sum, cnt, rg[555555], v[555555]; long long bi(long long x, long long y) { if (y == 0) return 1ll; if (y == 1) return x; long long z = bi(x, y / 2); z = z * z % n; if (y & 1) z = z * x % n; return z % n; } bool ch(string a, string b) { return a > b; } map<string, long long> mm; map<pair<string, string>, long long> ma; long long first(long long m) { long long ans = m; for (long long i = 2; i * i <= m; i++) { if (m % i == 0) { while (m % i == 0) m /= i; ans -= ans / i; } } if (m > 1) ans -= ans / m; return ans; } long long dp[555555][55], b[55][55]; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(NULL); long long m; cin >> m; while (m--) { long long l, r, x; cin >> l >> r; x = l; for (long long i = 0; i <= 60; i++) { if ((x | (1ll << i)) <= r) { x |= (1ll << i); } } cout << x << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t = 1; cin >> t; while (t--) { long long int n; cin >> n; cout << n << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) const int N = 2000005; long long n, A, B, x, y; int p[N]; int main() { scanf( %lld%lld%lld , &n, &A, &B); y = -1; for (; x * A <= n; ++x) { long long tmp = n - x * A; if (tmp / B * B == tmp) { y = tmp / B; break; } } if (y == -1) return 0 * printf( -1 n ); int i = 1; while (x--) { int ti = i; p[ti + A - 1] = i; for (int ci = 1; ci <= A; ++ci) { if (ci < A) p[i] = i + 1; ++i; } } while (y--) { int ti = i; p[ti + B - 1] = i; for (int ci = 1; ci <= B; ++ci) { if (ci < B) p[i] = i + 1; ++i; } } for (int i = 1; i <= n; ++i) printf( %d , p[i]); return 0; }
|
#include <bits/stdc++.h> 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 { template <class c> debug& operator<<(const c&) { return *this; } }; void test_case() { int n; scanf( %d , &n); vector<int> a(n); const int INF = 1e9 + 5; long long L = 1, R = INF; set<long long> s; long long offset = 0; int dp = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); if (i % 2 == 1) { int diff = a[i] - a[i - 1]; L += diff; R += diff; offset += diff; } L = max(L, 1LL); R = min(R, a[i] - 1LL); while (!s.empty() && *s.begin() + offset < 1) { s.erase(s.begin()); } while (!s.empty() && *s.rbegin() + offset >= a[i]) { s.erase(prev(s.end())); } if (L <= R || !s.empty()) { if (i != 0) { dp++; } if (a[i] % 2 == 0) { if ((L <= a[i] / 2 && a[i] / 2 <= R) || s.count(a[i] / 2 - offset)) { dp++; L = R = a[i] / 2; s.clear(); } else { s.insert(a[i] / 2 - offset); } } } else { L = 1; R = a[i] - 1; if (a[i] % 2 == 0) { L = R = a[i] / 2; dp++; } } } debug() << [ << dp : << (dp) << ] ; printf( %d n , 2 * n - dp); } int main() { int T; scanf( %d , &T); while (T--) { test_case(); } }
|
#include <bits/stdc++.h> using namespace std; struct kmp { vector<int> lps; string pattern; void compute_lps() { int lptr = 0, rptr = 1; lps[0] = 0; while (rptr < lps.size()) { while (lptr != 0 && pattern[lptr] != pattern[rptr]) lptr = lps[lptr - 1]; if (pattern[lptr] == pattern[rptr]) lptr++; lps[rptr] = lptr; rptr++; } } kmp(string& s) { pattern = s; lps.resize(s.size()); compute_lps(); } void search(string& s) { vector<int> hits; int lptr = 0, rptr = 0; while (rptr < s.size()) { while (lptr != 0 && pattern[lptr] != s[rptr]) lptr = lps[lptr - 1]; if (pattern[lptr] == s[rptr]) lptr++; rptr++; if (lptr == pattern.size()) { hits.push_back(rptr - pattern.size()); lptr = lps[lptr - 1]; } } } }; long long mod = 1e9 + 7; long long add(long long a, long long b) { return (a + b) % mod; } long long sub(long long a, long long b) { return ((a - b) % mod + mod) % mod; } long long mul(long long a, long long b) { return (a * b) % mod; } const int maxn = 205; long long dp[maxn][maxn][maxn][2], ans; int n; string s; int getmaxlen(kmp& KMP, char t, int mptr) { if (mptr == s.size()) mptr = KMP.lps[mptr - 1]; while (s[mptr] != t && mptr != 0) mptr = KMP.lps[mptr - 1]; if (s[mptr] == t) mptr++; return mptr; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n >> s; dp[0][0][0][0] = 1; kmp KMP(s); for (int i = 0; i < (2 * n); i++) { for (int j = 0; j <= n; j++) { for (int k = 0; k < (2 * n) && k <= s.size(); k++) { for (int l = 0; l < 2; l++) { if (dp[i][j][k][l] == 0) continue; int mptr = getmaxlen(KMP, ( , k); int matched = l; if (mptr == s.size()) matched = 1; dp[i + 1][j + 1][mptr][matched] = add(dp[i + 1][j + 1][mptr][matched], dp[i][j][k][l]); if (j != 0) { mptr = getmaxlen(KMP, ) , k); matched = l; if (mptr == s.size()) matched = 1; dp[i + 1][j - 1][mptr][matched] = add(dp[i + 1][j - 1][mptr][matched], dp[i][j][k][l]); } } } } } for (int i = 0; i <= s.size(); i++) ans = add(ans, dp[2 * n][0][i][1]); cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const long double INF = 1e100; const long double eps = 1e-12; template <typename T> void chkmax(T &x, T y) { x = max(x, y); } template <typename T> void chkmin(T &x, T y) { x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -f; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; x *= f; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar( - ); if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } template <typename T> void writeln(T x) { write(x); puts( ); } int n, p, q; long double a[MAXN], b[MAXN]; long double check(long double x) { long double y = 1; for (int i = 1; i <= n; i++) chkmin(y, (1.0 - x * a[i]) / b[i]); return x * p + y * q; } int main() { read(n), read(p), read(q); long double l = 0, r = INF; for (int i = 1; i <= n; i++) { read(a[i]), read(b[i]); chkmin(r, 1.0 / a[i]); } while (l + eps < r) { long double ml = (2 * l + r) / 3, mr = (l + 2 * r) / 3; if (check(ml) > check(mr)) r = mr; else l = ml; } printf( %.10Lf n , check((l + r) / 2)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { double l, r; cin >> l >> r; if (l > r / 2) { cout << YES << endl; } else { cout << NO << endl; } } return 0; }
|
// In the name of Allah. // We re nothing and you re everything. // Ya Ali! #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAX_N = 1e5 + 14, MAX_K = 40; int n, k; struct XorKeeper { int a[MAX_K]{}; XorKeeper operator^(const XorKeeper &o) { XorKeeper ret; for (int i = 0; i < 2 * k; ++i) { ret.a[i] = a[i] ^ o.a[i]; } return ret; } XorKeeper &operator^=(const XorKeeper &o) { return *this = *this ^ o; } XorKeeper next() const { XorKeeper ret = *this; rotate(ret.a, ret.a + 2 * k - 1, ret.a + 2 * k); return ret; } int get_ans() { return accumulate(a + k, a + 2 * k, 0, [](int x, int y) { return x ^ y; }); } } down[MAX_N], up[MAX_N]; vector<int> g[MAX_N]; int a[MAX_N]; void dfs_down(int v = 0, int p = -1) { down[v].a[0] = a[v]; for (auto u : g[v]) if (u != p) { dfs_down(u, v); down[v] ^= down[u].next(); } } void dfs_up(int v = 0, int p = -1) { for (auto u : g[v]) if (u != p) { up[u] = (up[v] ^ down[v] ^ down[u].next()).next(); dfs_up(u, v); } } int main() { ios::sync_with_stdio(0), cin.tie(0); cin >> n >> k; for (int i = 0; i < n - 1; ++i) { int v, u; cin >> v >> u; v--, u--; g[v].push_back(u); g[u].push_back(v); } for (int i = 0; i < n; ++i) { cin >> a[i]; } dfs_down(); dfs_up(); for (int i = 0; i < n; ++i) { cout << bool(down[i].get_ans() ^ up[i].get_ans()) << ; } cout << n ; }
|
#include <bits/stdc++.h> using namespace std; namespace hjt { template <typename A, typename B> std::ostream &operator<<(std::ostream &o, const std::pair<A, B> &x) { return o << ( << x.first << , << x.second << ) ; } } // namespace hjt using namespace hjt; const double eps = 1e-7; const double PI = acos(-1); const int MOD = 998244353; const int INF = 0x3f3f3f3f; const int N = 3e5 + 7; int n; int a[N], b[N], dp[N]; pair<int, int> path[N]; set<int> st; vector<int> ans; void update(int &x, int y) { if (x == -1 || y < x) x = y; } inline void solve() { cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= n; ++i) cin >> b[i]; st.clear(); for (int i = 0; i <= n + 1; ++i) { dp[i] = -1; st.insert(i); } queue<int> q; dp[n] = 0; q.push(n); while (q.size()) { int u = q.front(); q.pop(); while (true) { int x = *st.lower_bound(u - a[u]); if (x > u) break; st.erase(x); int v = x + b[x]; if (dp[v] == -1 || dp[u] + 1 < dp[v]) { dp[v] = dp[u] + 1; path[v] = {u, x}; q.push(v); } } } if (dp[0] == -1) { cout << -1 n ; return; } ans.clear(); for (int i = 0; i != n; i = path[i].first) { ans.emplace_back(path[i].second); } reverse(ans.begin(), ans.end()); cout << ans.size() << n ; for (int &i : ans) cout << i << ; cout << n ; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int T = 1; for (int t = 1; t <= T; ++t) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, s, f, h, co = 0, sum, savesum, res, re, savere; cin >> n; long long a[n + 1]; for (i = 1; i <= n; i++) { cin >> a[i]; } cin >> s >> f; h = f - s; queue<long long> qu; i = 1; sum = 0; savesum = 0; res = 1; for (i = 1; i <= h; i++) { qu.push(a[i]); sum += a[i]; savesum = sum; } re = s; savere = s; for (i = h + 1; i <= n; i++) { sum += a[i] - qu.front(); qu.pop(); qu.push(a[i]); if (sum > savesum) { res = i - h + 1; savesum = sum; re = s - res + 1; if (re < 1) re += n; savere = re; } else if (sum == savesum) { res = i - h + 1; savesum = sum; re = s - res + 1; if (re < 1) re += n; if (savere > re) savere = re; } } for (i = 1; i <= h; i++) { sum += a[i] - qu.front(); qu.pop(); qu.push(a[i]); if (sum > savesum) { savesum = sum; res = n - h + 1 + i; re = s - res + 1; if (re < 1) re += n; savere = re; } else if (sum == savesum) { res = n - h + 1 + i; re = s - res + 1; if (re < 1) re += n; if (savere > re) savere = re; } } cout << savere; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int>> tr; int n; int mx_bits = 40; int ind = 0; long long xor_sum = 0; long long ans; vector<long long> v; void insert_tr(long long num) { int node = 0; for (int i = (int)mx_bits; i >= (int)0; --i) { bool bit = ((num >> i) & 1) > 0; if (tr[node][bit] == -1) { tr.push_back(vector<int>(2, -1)); ++ind; tr[node][bit] = ind; } node = tr[node][bit]; } } long long query_tr(long long num) { long long ret = 0; int node = 0; long long val = 1; for (int i = (int)mx_bits; i >= (int)0; --i) { bool bit = ((num >> i) & 1) > 0; if (tr[node][1 - bit] != -1) { ret += val << i; node = tr[node][1 - bit]; } else node = tr[node][bit]; } return ret; } void solve() { ans = xor_sum; long long cur = 0; insert_tr(cur); for (int i = (int)0; i < (int)n; ++i) { cur ^= v[i]; insert_tr(cur); long long ret = query_tr(xor_sum ^ cur); ans = max(ans, ret); } cout << ans; } int main() { ios_base::sync_with_stdio(false); tr.push_back(vector<int>(2, -1)); cin >> n; v.resize(n); for (int i = (int)0; i < (int)n; ++i) { cin >> v[i]; xor_sum = xor_sum ^ v[i]; } solve(); return 0; }
|
#include <bits/stdc++.h> using uiII = unsigned int long long; using II = int long long; using namespace std; const II N = 0x3f3f3f3f3f3f3f; int main() { vector<pair<II, II>> v; vector<pair<II, II>>::iterator it; v.reserve(1000000); II t, n, l, r, i(0); for (cin >> t; i < t; i++) { cin >> n; v.push_back(make_pair(1, n)); bool x[2000][2000]{false}; for (II i = 0; i < n; i++) { cin >> l >> r; x[l][r] = true; } bool f = false; for (II i = 0; i < v.size(); i++) { for (II j = v[i].first; j <= v[i].second; j++) { if (v[i].first == v[i].second) { cout << v[i].first << << v[i].second << << v[i].first << endl; } if (j - v[i].first == 0) { if (v[i].second - v[i].first >= 2) { if (x[j + 1][v[i].second] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(j + 1, v[i].second)); } continue; } if (v[i].second - v[i].first == 1) { if (x[v[i].second][v[i].second] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(v[i].second, v[i].second)); } continue; } } if (j - v[i].second == 0) { if (j - v[i].first >= 2) { if (x[v[i].first][v[i].second - 1] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(v[i].first, v[i].second - 1)); } continue; } if (j - v[i].first == 1) { if (x[v[i].first][v[i].first] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(v[i].first, v[i].first)); } continue; } } if (j != v[i].first && j != v[i].second) { if (j - v[i].first == 1) { if (x[v[i].first][v[i].first] == true) { if (x[j + 1][v[i].second] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(v[i].first, v[i].first)); v.push_back(make_pair(j + 1, v[i].second)); break; } } continue; } if (v[i].second - j == 1) { if (x[v[i].first][j - 1] == true) { if (x[v[i].second][v[i].second] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(v[i].second, v[i].second)); v.push_back(make_pair(v[i].first, j - 1)); break; } } continue; } else { if (x[v[i].first][j - 1] == true) { if (x[j + 1][v[i].second] == true) { cout << v[i].first << << v[i].second << << j << endl; v.push_back(make_pair(v[i].first, j - 1)); v.push_back(make_pair(j + 1, v[i].second)); break; } } continue; } } } } v.clear(); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 305; int n; int f[N][N], dp[2][N][N]; int main() { std::ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cin >> f[i][j]; } } memset(dp, -1, sizeof(dp)); dp[0][0][0] = f[0][0]; for (int d = 1; d < 2 * n; ++d) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { int x1 = i, y1 = d - i; int x2 = j, y2 = d - j; if (y1 < 0 || y2 < 0 || y1 > n - 1 || y2 > n - 1) continue; int add; if (x1 == x2 && y1 == y2) add = f[x1][y1]; else add = f[x1][y1] + f[x2][y2]; int &res = dp[d % 2][x1][x2] = -1000 * 1000 * 1000; if (x1 > 0 && x2 > 0) res = max(res, dp[(d - 1) % 2][x1 - 1][x2 - 1] + add); if (x1 > 0 && y2 > 0) res = max(res, dp[(d - 1) % 2][x1 - 1][x2] + add); if (y1 > 0 && y2 > 0) res = max(res, dp[(d - 1) % 2][x1][x2] + add); if (y1 > 0 && x2 > 0) res = max(res, dp[(d - 1) % 2][x1][x2 - 1] + add); } } } cout << dp[(2 * n - 2) % 2][n - 1][n - 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t-- > 0) { long long int n, k, can = 0; cin >> n >> k; can += n / k; can = can * k; if (can < n) { if (n - can < k / 2) can += n - can; else can += k / 2; } cout << can << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int MAXN = 30005; int lst[MAXN], N; bool ok(vector<int> &v) { if ((int)v.size() <= 2) return true; for (int i = (int)v.size() - 2; i >= max(1, (int)v.size() - 5); i--) if (v[i + 1] - v[i] != v[1] - v[0]) return false; return true; } bool check(vector<int> &a, vector<int> &b, int n) { if ((int)a.size() < 2) { b.push_back(lst[n]); if (!ok(b)) { b.erase(b.end() - 1); a.push_back(lst[n]); } } else if ((int)b.size() < 2) { a.push_back(lst[n]); if (!ok(a)) { a.erase(a.end() - 1); b.push_back(lst[n]); } } else { a.push_back(lst[n]); if (!ok(a)) { a.erase(a.end() - 1); b.push_back(lst[n]); } } return ok(a) && ok(b); } int main() { cin >> N; for (int i = 0; i < N; i++) cin >> lst[i]; int sz = min(6, N); vector<int> x, y; for (int mask = 0; mask < (1 << sz); mask++) { vector<int> a, b; for (int i = 0; i < sz; i++) { if (mask & (1 << i)) a.push_back(lst[i]); else b.push_back(lst[i]); } if (!ok(a) || !ok(b)) continue; bool k = true; for (int i = sz; i < N; i++) { if (!check(a, b, i)) { k = false; break; } } if (k) { x = a, y = b; break; } } if ((int)x.size() == 0 && (int)y.size() > 0) { x.push_back(y[(int)y.size() - 1]); y.erase(y.end() - 1); } else if ((int)y.size() == 0 && (int)x.size() > 0) { y.push_back(x[(int)x.size() - 1]); x.erase(x.end() - 1); } if ((int)x.size() == 0 && (int)y.size() == 0) { cout << No solution << endl; return 0; } for (int i = 0; i < (int)x.size(); i++) cout << x[i] << ; cout << endl; for (int i = 0; i < (int)y.size(); i++) cout << y[i] << ; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int A[2], B[2], C[2]; scanf( %d %d %d %d %d %d , &A[0], &A[1], &B[0], &B[1], &C[0], &C[1]); int r1 = A[0]; int r2 = B[0]; int r3 = C[0]; int c1 = A[1]; int c2 = B[1]; int c3 = C[1]; bool check = false; int row1, row2, row3, col1, col2, col3; for (int i = 0; i < (1 << 3); i++) { A[0] = r1; B[0] = r2; C[0] = r3; A[1] = c1; B[1] = c2; C[1] = c3; if ((i & 1) == 1) { swap(A[0], A[1]); } if (((i >> 1) & 1) == 1) { swap(B[0], B[1]); } if (((i >> 2) & 1) == 1) { swap(C[0], C[1]); } if (A[0] == B[0] && B[0] == C[0] && A[0] == A[1] + B[1] + C[1]) { row1 = A[1]; row2 = B[1]; row3 = C[1]; col1 = A[0]; printf( %d n , col1); for (int i = 0; i < row1; i++) { for (int j = 0; j < col1; j++) { printf( A ); } printf( n ); } for (int i = 0; i < row2; i++) { for (int j = 0; j < col1; j++) { printf( B ); } printf( n ); } for (int i = 0; i < row3; i++) { for (int j = 0; j < col1; j++) { printf( C ); } printf( n ); } return 0; } if (A[0] == B[0] + C[0] && B[1] == C[1] && A[0] == A[1] + B[1]) { row1 = A[1]; row2 = B[1]; col1 = A[0]; col2 = B[0]; col3 = C[0]; printf( %d n , col1); for (int i = 0; i < row1; i++) { for (int j = 0; j < col1; j++) { printf( A ); } printf( n ); } for (int i = 0; i < row2; i++) { for (int j = 0; j < col2; j++) { printf( B ); } for (int j = 0; j < col3; j++) { printf( C ); } printf( n ); } return 0; } if (B[0] == A[0] + C[0] && A[1] == C[1] && B[0] == B[1] + C[1]) { row1 = B[1]; row2 = A[1]; col1 = B[0]; col2 = A[0]; col3 = C[0]; printf( %d n , col1); for (int i = 0; i < row1; i++) { for (int j = 0; j < col1; j++) { printf( B ); } printf( n ); } for (int i = 0; i < row2; i++) { for (int j = 0; j < col2; j++) { printf( A ); } for (int j = 0; j < col3; j++) { printf( C ); } printf( n ); } return 0; } if (C[0] == A[0] + B[0] && A[1] == B[1] && C[0] == A[1] + C[1]) { row1 = C[1]; row2 = A[1]; col1 = C[0]; col2 = A[0]; col3 = B[0]; printf( %d n , col1); for (int i = 0; i < row1; i++) { for (int j = 0; j < col1; j++) { printf( C ); } printf( n ); } for (int i = 0; i < row2; i++) { for (int j = 0; j < col2; j++) { printf( A ); } for (int j = 0; j < col3; j++) { printf( B ); } printf( n ); } return 0; } } if (!check) { printf( -1 ); return 0; } }
|
#include <bits/stdc++.h> const int INF = 0x7fffffff; const long long int LNF = 0x7fffffffffffffff; using namespace std; int ac[26], az[26]; char aa[105], bb[105]; int main() { int i, k, nn, kk = 0, len1, len2, s; scanf( %d , &nn); getchar(); while (kk < nn) { gets(aa); gets(bb); len1 = strlen(aa); len2 = strlen(bb); memset(az, 0, sizeof(az)); k = 0; while (k < len1) { az[aa[k] - a ]++; k++; } k = 0; s = 1; while (k + len1 <= len2) { memset(ac, 0, sizeof(ac)); i = 0; while (i < len1) { ac[bb[k + i] - a ]++; i++; } i = 0; s = 0; while (i < 26) { if (ac[i] != az[i]) { s = 1; break; } i++; } if (s == 0) { break; } k++; } if (s == 0) { printf( YES n ); } else { printf( NO n ); } kk++; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t, c; cin >> n >> t >> c; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int count = 0; int ans = 0; for (int i = 0; i < n; i++) { if (arr[i] <= t) { count++; if (i == n - 1) { ans += max(0, count - c + 1); } } else { ans += max(0, count - c + 1); count = 0; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native ) using namespace std; const long long inf = 1e9 + 5; struct Node { Node *l = 0, *r = 0; long long lo, hi, mset = inf, madd = 0, val = 0, smol = inf; Node(int lo, int hi) : lo(lo), hi(hi) {} Node(vector<long long>& v, int lo, int hi) : lo(lo), hi(hi) { if (lo + 1 < hi) { int mid = lo + (hi - lo) / 2; l = new Node(v, lo, mid); r = new Node(v, mid, hi); val = l->val + r->val; smol = min(l->smol, r->smol); } else val = v[lo], smol = v[lo]; } long long query(int L, int R) { if (R <= lo || hi <= L) return 0; if (L <= lo && hi <= R) return val; push(); return l->query(L, R) + r->query(L, R); } int find(long long v) { if (smol > v) return hi; if (lo + 1 == hi) return lo; if (mset <= v) return lo; if (l->smol <= v) return l->find(v); return r->find(v); } void set(int L, int R, int x) { if (R <= lo || hi <= L) return; if (L <= lo && hi <= R) mset = x, val = (hi - lo) * x, smol = x, madd = 0; else { push(), l->set(L, R, x), r->set(L, R, x); val = l->val + r->val; smol = min(l->smol, r->smol); } } void push() { if (!l) { int mid = lo + (hi - lo) / 2; l = new Node(lo, mid); r = new Node(mid, hi); } if (mset != inf) l->set(lo, hi, mset), r->set(lo, hi, mset), mset = inf; } }; int n, q; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> q; vector<long long> l(n, 0); for (int i = 0; i < n; i++) { long long v; cin >> v; l[i] = v; } Node seg = Node(l, 0, n); for (int it = 0; it < q; it++) { long long y; int t, x; cin >> t >> x >> y; x -= 1; if (t == 1) { int left = seg.find(y); if (x + 1 > left) { seg.set(left, x + 1, y); } } else { int out = 0; x = max(x, seg.find(y)); while (x < n) { long long dist = y / seg.query(x, x + 1); int lo = min((long long)n - 1, x + dist - 1); y -= seg.query(x, lo + 1); out += (lo - x + 1); x = max(lo + 1, seg.find(y)); } cout << out << n ; } } }
|
#include <bits/stdc++.h> using namespace std; double EPS = 1e-9; int conversion(string p) { int o; o = atoi(p.c_str()); return o; } string toString(int h) { stringstream ss; ss << h; return ss.str(); } long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long lcm(long long a, long long b) { return (a * (b / gcd(a, b))); } long long toi(string p) { long long x; istringstream in(p); in >> x; return x; } long long square(long long n) { return n * n; } long long fastexp(long long base, long long power) { if (power == 0) return 1LL; else if (power % 2 == 0) return square(fastexp(base, power / 2)); else return base * (fastexp(base, power - 1)); } bool is_prime(int n) { for (int i = 2; i * i <= n; i++) if (n % i == 0) return 0; return 1; } int logba(int a, int b) { return log(a) / log(b); } int rd(double d) { int x = (int)((double)d + 0.5); return x; } vector<pair<int, int> > W, B, Q; char lab[8][8]; bool go(int x, int y, int id) { if (id == 0) { for (int i = x - 1; i >= 0; i--) { if (lab[i][y] != . ) return false; } } else { for (int i = x + 1; i < 8; i++) { if (lab[i][y] != . ) return false; } } return true; } int main() { int res = 0, x, y; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> lab[i][j]; if (lab[i][j] == W ) W.push_back(make_pair(i, j)); if (lab[i][j] == B ) B.push_back(make_pair(i, j)); } } for (int i = 0; i < W.size(); i++) { x = W[i].first; y = W[i].second; if (go(x, y, 0)) Q.push_back(make_pair(x, 0)); } for (int i = 0; i < B.size(); i++) { x = B[i].first; y = B[i].second; if (go(x, y, 1)) Q.push_back(make_pair(7 - x, 1)); } sort(Q.begin(), Q.end()); if (Q[0].second == 0) cout << A << endl; else cout << B << endl; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 2e9; const long long LINF = 2e16; const int magic = 348; const int MOD = 1e9 + 7; const double eps = 1e-10; const double pi = acos(-1); struct fastio { static const int S = 1e7; char rbuf[S + 48], wbuf[S + 48]; int rpos, wpos, len; fastio() { rpos = len = wpos = 0; } inline char Getchar() { if (rpos == len) rpos = 0, len = fread(rbuf, 1, S, stdin); if (!len) return EOF; return rbuf[rpos++]; } template <class T> inline void Get(T &first) { char ch; bool f; T res; while (!isdigit(ch = Getchar()) && ch != - ) { } if (ch == - ) f = false, res = 0; else f = true, res = ch - 0 ; while (isdigit(ch = Getchar())) res = res * 10 + ch - 0 ; first = (f ? res : -res); } inline void getstring(char *s) { char ch; while ((ch = Getchar()) <= 32) { } for (; ch > 32; ch = Getchar()) *s++ = ch; *s = 0 ; } inline void flush() { fwrite(wbuf, 1, wpos, stdout); fflush(stdout); wpos = 0; } inline void Writechar(char ch) { if (wpos == S) flush(); wbuf[wpos++] = ch; } template <class T> inline void Print(T first, char ch) { char s[20]; int pt = 0; if (first == 0) s[++pt] = 0 ; else { if (first < 0) Writechar( - ), first = -first; while (first) s[++pt] = 0 + first % 10, first /= 10; } while (pt) Writechar(s[pt--]); Writechar(ch); } inline void printstring(char *s) { int pt = 1; while (s[pt] != 0 ) Writechar(s[pt++]); } } io; template <typename T> inline void check_max(T &first, T cmp) { first = max(first, cmp); } template <typename T> inline void check_min(T &first, T cmp) { first = min(first, cmp); } template <typename T> inline T myabs(T first) { return first >= 0 ? first : -first; } const int MAXN = 1e5; inline int add(int first) { if (first >= MOD) first -= MOD; return first; } inline int sub(int first) { if (first < 0) first += MOD; return first; } inline int quick_pow(int first, int second) { int res = 1; while (second) { if (second & 1) res = (1ll * res * first) % MOD, second--; first = (1ll * first * first) % MOD; second >>= 1; } return res; } int inv[MAXN + 48], fac[MAXN + 48]; inline void init_inv() { fac[0] = 1; for (register int i = 1; i <= MAXN; i++) fac[i] = (1ll * fac[i - 1] * i) % MOD; inv[MAXN] = quick_pow(fac[MAXN], MOD - 2); for (register int i = MAXN - 1; i >= 0; i--) inv[i] = (1ll * inv[i + 1] * (i + 1)) % MOD; } inline int C(int first, int second) { if (first < second || first < 0 || second < 0) return 0; return 1ll * fac[first] * inv[second] % MOD * inv[first - second] % MOD; } inline int split(int first, int second) { if (!second) { return first == 0; } return C(first + second - 1, second - 1); } inline int calc(int c[2][2]) { if (c[0][1] - c[1][0] < 0 || c[0][1] - c[1][0] > 1) return 0; return 1ll * split(c[0][0], c[1][0] + 1) * split(c[1][1], c[0][1]) % MOD; } int c[2][2], cc[2][2], n; char A[MAXN + 48], B[MAXN + 48]; inline int solve(int c[2][2], char *s) { int len = strlen(s + 1); if (len == 1 && s[1] == 0 ) return 0; if (len < n) return 0; if (len > n) for (register int i = n; i >= 1; i--) s[i] = 1 ; char last = 1 ; int res = 0, i; for (i = n - 1; i >= 1; i--) if (s[i] == 1 ) { if (c[last - 0 ][0]) { c[last - 0 ][0]--; res = add(res + calc(c)); c[last - 0 ][0]++; } if (!c[last - 0 ][1]) break; c[last - 0 ][1]--; last = 1 ; } else { if (!c[last - 0 ][0]) break; c[last - 0 ][0]--; last = 0 ; } if (!i) res = add(res + 1); return res; } inline void Minus() { int len = strlen(A + 1), pt = 1; while (A[pt] == 0 ) A[pt] = 1 , pt++; A[pt] = 0 ; while (len >= 1 && A[len] == 0 ) len--; if (!len) len++; A[len + 1] = 0 ; } int main() { init_inv(); io.getstring(A + 1); io.getstring(B + 1); int lena = strlen(A + 1), lenb = strlen(B + 1); reverse(A + 1, A + lena + 1); reverse(B + 1, B + lenb + 1); io.Get(c[0][0]); io.Get(c[0][1]); io.Get(c[1][0]); io.Get(c[1][1]); Minus(); n = c[0][0] + c[0][1] + c[1][0] + c[1][1] + 1; for (register int i = 0; i <= 1; i++) for (register int j = 0; j <= 1; j++) cc[i][j] = c[i][j]; int resb = solve(c, B), resa = solve(cc, A); io.Print(sub(resb - resa), n ); io.flush(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int TOUR = 1 << 18, MOD = 1e9 + 7; int Add(int a, int b) { a += b; if (a >= MOD) a -= MOD; return a; } int Sub(int a, int b) { a -= b; if (a < 0) a += MOD; return a; } int Mul(int a, int b) { return (int)(((long long)a * b) % MOD); } int Inverz(int x) { int ret = 1; for (int e = MOD - 2; e; e /= 2, x = Mul(x, x)) if (e & 1) ret = Mul(ret, x); return ret; } int Div(int a, int b) { return Mul(a, Inverz(b)); } struct node { int sum, mul, prop; }; struct tour { node t[2 * TOUR]; tour() { for (int i = 0; i < 2 * TOUR; i++) { t[i].sum = 0; t[i].mul = t[i].prop = 1; } } void propagiraj(int x) { for (int i = 2 * x; i <= 2 * x + 1; i++) { t[i].sum = Mul(t[i].sum, t[x].prop); t[i].mul = Mul(t[i].mul, t[x].prop); t[i].prop = Mul(t[i].prop, t[x].prop); } t[x].prop = 1; } void stavi_sum(int pos, int lo, int hi, int ind, int val) { if (lo >= ind + 1 || hi <= ind) return; if (lo == ind && hi == ind + 1) { t[pos].sum = Mul(t[pos].mul, val); return; } propagiraj(pos); stavi_sum(2 * pos + 0, lo, (lo + hi) / 2, ind, val); stavi_sum(2 * pos + 1, (lo + hi) / 2, hi, ind, val); t[pos].sum = Add(t[2 * pos].sum, t[2 * pos + 1].sum); } void stavi_sum(int pos, int val) { stavi_sum(1, 0, TOUR, pos, val); } void stavi_mul(int pos, int lo, int hi, int begin, int end, int val) { if (lo >= end || hi <= begin) return; if (lo >= begin && hi <= end) { t[pos].sum = Mul(t[pos].sum, val); t[pos].mul = Mul(t[pos].mul, val); t[pos].prop = Mul(t[pos].prop, val); return; } propagiraj(pos); stavi_mul(2 * pos + 0, lo, (lo + hi) / 2, begin, end, val); stavi_mul(2 * pos + 1, (lo + hi) / 2, hi, begin, end, val); t[pos].sum = Add(t[2 * pos].sum, t[2 * pos + 1].sum); } void stavi_mul(int begin, int end, int val) { stavi_mul(1, 0, TOUR, begin, end, val); } int query_sum(int pos, int lo, int hi, int begin, int end) { if (lo >= end || hi <= begin) return 0; if (lo >= begin && hi <= end) return t[pos].sum; propagiraj(pos); return Add(query_sum(2 * pos + 0, lo, (lo + hi) / 2, begin, end), query_sum(2 * pos + 1, (lo + hi) / 2, hi, begin, end)); } int query_sum(int begin, int end) { return query_sum(1, 0, TOUR, begin, end); } int query_mul(int pos, int lo, int hi, int ind) { if (lo >= ind + 1 || hi <= ind) return 0; if (lo == ind && hi == ind + 1) return t[pos].mul; propagiraj(pos); return Add(query_mul(2 * pos + 0, lo, (lo + hi) / 2, ind), query_mul(2 * pos + 1, (lo + hi) / 2, hi, ind)); } int query_mul(int ind) { return query_mul(1, 0, TOUR, ind); } } T; vector<int> V[TOUR]; pair<int, int> ev[TOUR]; int disc[TOUR], fin[TOUR], vr = 1; int pocval[TOUR], par[TOUR]; int brdjec[TOUR]; void Dfs(int node) { disc[node] = vr++; for (int i = 0; i < (int)V[node].size(); i++) Dfs(V[node][i]); fin[node] = vr; } void Dodaj(int node) { int p = par[node]; T.stavi_mul(disc[p], fin[p], Mul(Inverz(brdjec[p]), brdjec[p] + 1)); T.stavi_sum(disc[node], pocval[node]); brdjec[p]++; } int Query(int node) { int ret = T.query_sum(disc[node], fin[node]); if (node) ret = Div(ret, T.query_mul(disc[par[node]])); return ret; } int main() { int brq, brcv = 1; scanf( %d%d , &pocval[0], &brq); for (int i = 0; i < brq; i++) { int st; scanf( %d , &st); if (st == 2) { int tmp; scanf( %d , &tmp); tmp--; ev[i] = pair<int, int>(st, tmp); } else { scanf( %d%d , &par[brcv], &pocval[brcv]); par[brcv]--; V[par[brcv]].push_back(brcv); ev[i] = pair<int, int>(st, brcv++); } } Dfs(0); T.stavi_sum(disc[0], pocval[0]); for (int i = 0; i < brcv; i++) brdjec[i] = 1; for (int i = 0; i < brq; i++) { if (ev[i].first == 1) Dodaj(ev[i].second); else printf( %d n , Query(ev[i].second)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1 << 16; int n, m; int d[2][N]; int get_n(int x, int n) { int tmp = 3 << (n * 2); tmp = x & tmp; tmp >>= n * 2; return tmp; } int set_n(int x, int n, int y) { int tmp = 3 << (n * 2); x = x & (~tmp); y <<= (n * 2); x |= y; return x; } void update(int &x, int y) { if (x == -1 || x < y) x = y; } int solve() { int i, j, k; int t = 0; memset(d, -1, sizeof(d)); d[0][0] = 0; int tot = 1 << (n * 2 + 2); for (i = 0; i < m; ++i) { for (j = 0; j < n; ++j) { memset(d[1 - t], -1, sizeof(d[1 - t])); for (k = 0; k < tot; ++k) { if (d[t][k] == -1) continue; int t0 = get_n(k, j); int t1 = get_n(k, j + 1); int st = set_n(k, j, 1); st = set_n(st, j + 1, 1); update(d[1 - t][st], d[t][k]); if (t0 > 0) { st = set_n(k, j - 1, 2); st = set_n(st, j, 0); st = set_n(st, j + 1, 0); update(d[1 - t][st], d[t][k] + 1); if (t0 == 1) { st = set_n(k, j - 1, 0); st = set_n(st, j, 2); st = set_n(st, j + 1, 2); update(d[1 - t][st], d[t][k] + 1); } } if (t1 > 0) { st = set_n(k, j, 0); st = set_n(st, j + 1, 0); update(d[1 - t][st], d[t][k] + 1); if (t1 == 1) { st = set_n(k, j, 2); st = set_n(st, j + 1, 2); update(d[1 - t][st], d[t][k] + 1); } } if (t0 == 1 && t1 == 1) { st = set_n(k, j - 1, 0); st = set_n(st, j, 2); st = set_n(st, j + 1, 2); update(d[1 - t][st], d[t][k] + 2); } } t = 1 - t; } memset(d[1 - t], -1, sizeof(d[1 - t])); for (k = 0; k < tot; ++k) { int st = set_n(k, n, 0); st <<= 2; update(d[1 - t][st], d[t][k]); } t = 1 - t; } int ans = -1; for (k = 0; k < tot; ++k) { update(ans, d[t][k]); } return ans; } int main() { int i, j, k, t, nc = 0; while (scanf( %d%d , &n, &m) != EOF) { if (n > m) swap(n, m); int ans = solve(); printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int> > g; vector<long double> ans; vector<int> sum; void dfs0(int x) { sum[x] = 1; for (int to : g[x]) { dfs0(to); sum[x] += sum[to]; } } void dfs(int x, long double f) { ans[x] = f; int s = sum[x] - 1; for (int to : g[x]) { dfs(to, ((s - sum[to]) / 2.0) + f + 1.0); } } int main() { ios_base::sync_with_stdio(0); int n; cin >> n; g.resize(n); ans.resize(n); sum.resize(n); for (int i = 1; i < n; i++) { int p; cin >> p; p--; g[p].push_back(i); } dfs0(0); dfs(0, 1.0); cout << fixed << setprecision(8); for (long double x : ans) cout << x << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; long long k; long long f(int a[], int l, int r) { long long m = 0; for (int i = 0; i < n; i++) if (a[i] < l) m += l - a[i]; else if (a[i] > r) m += a[i] - r; return m; } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); cin >> n >> k; int a[n]; for (int& i : a) cin >> i; int l = 0, r = 1e9; while (l <= r) { int m = (l + r) / 2; int lt = 0, rt = 1e9; while (rt - lt > 1) { int mt = (lt + rt) / 2; if (f(a, mt, mt + m) < f(a, mt + 1, mt + 1 + m)) rt = mt; else lt = mt; } if (f(a, rt, rt + m) <= k) r = m - 1; else l = m + 1; } cout << l << n ; }
|
#include <bits/stdc++.h> using namespace std; struct tree { int C; int root; int number_of_branches; int *branches; }; int main() { int c, p, n, i, j, r = 0; int start, D[100000] = {0}, k = 0; struct tree A[100000]; cin >> n; for (i = 0; i < n; i++) { A[i].branches = new int[1]; A[i].number_of_branches = 0; } for (i = 0; i < n; i++) { cin >> p >> c; if (p == -1) { start = i; } else { A[i].C = c; A[i].root = p - 1; A[p - 1].branches[A[p - 1].number_of_branches] = i; A[p - 1].number_of_branches++; A[p - 1].branches = (int *)realloc(A[p - 1].branches, (A[p - 1].number_of_branches) * sizeof(struct tree)); } } for (i = 0; i < n; i++) { if (A[i].C == 1) { k = 0; for (j = 0; j < A[i].number_of_branches; j++) { if (A[A[i].branches[j]].C == 1) { k++; } } if ((k == A[i].number_of_branches) || (k == 0 && k == A[i].number_of_branches)) { cout << i + 1 << ; r = 1; } } } if (r == 0) { cout << -1; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int N = 2e5 + 5; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } long long int n, k; long long int a[N]; long long int month[2 * N]; long long int sum(long long int days) { return (days * (days + 1) / 2); } void solve() { cin >> n >> k; for (long long int i = 0; i < n; i++) { cin >> a[i]; month[i] = a[i]; month[n + i] = a[i]; } long long int j = 0; long long int hugs = 0, days = 0, best = 0; for (long long int i = 0; i < 2 * n; i++) { hugs += sum(month[i]); days += month[i]; while (days > k) { days -= month[j]; hugs -= sum(month[j]); j++; } long long int curr = hugs; if (j > 0) { long long int skips = month[j - 1] + days - k; curr += sum(month[j - 1]) - sum(skips); } best = max(best, curr); } cout << best << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); return 0; }
|
#include <bits/stdc++.h> #define ll long long #define ld long double #define pb push_back #define VI vector<int> #define VL vector<ll> #define MX vector<VI > #define all(x) x.begin(), x.end() #define IOS cin.tie(0)->sync_with_stdio(0) using namespace std; ll gcd(ll a, ll b){ if(!b) return a; return gcd(b, a%b); } int main(){ int n, m; cin >> n >> m; VL a(n), b(m); for(ll &i : a) cin >> i; for(ll &i : b) cin >> i; sort(all(a)); ll t = 0; for(int i=1; i<n; i++) t = gcd(a[i]-a[i-1], t); for(ll &i : b) cout << gcd(i+a[0], t) << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } inline int readInt() { int x; scanf( %d , &x); return x; } int a[55]; int main() { int n; scanf( %d , &n); for (int i = 0; i < (int)n; ++i) scanf( %d , &a[i]); sort(a, a + n); if (a[0] == a[n / 2]) printf( Bob n ); else printf( Alice n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const int INF = 0x7fffffff; const double PI = acos(-1.0); const int MAX = 100005; const int MOD = 1000000007; inline bool isEq(double a, double b) { return abs(a - b) < EPS; } inline bool isEq(double a, double b, double eps) { return abs(a - b) < eps; } inline double toRad(double deg) { return deg * PI / 180; } inline double toDeg(double rad) { return rad * 180 / PI; } class Timer { clock_t start; string name; public: Timer() { name = ; start = clock(); } Timer(string s) { name = s; start = clock(); } ~Timer() { fprintf(stderr, %s: %.3gs n , name.c_str(), 1.0 * (clock() - start) / CLOCKS_PER_SEC); } }; double cross(complex<double> &a, complex<double> &b) { return imag((conj(a) * b)); } double perpendicularDist(double x1, double y1, double x2, double y2, double x3, double y3) { complex<double> A = complex<double>(x2 - x1, y2 - y1); complex<double> B = complex<double>(x3 - x1, y3 - y1); return cross(A, B) / abs(A); } double getYaxiyIntersection(complex<double> start, complex<double> a) { double lo = 0, hi = 1000000000, dist = 0; int cnt = 300; a = a / abs(a); complex<double> en; while (cnt--) { dist = (lo + hi) / 2; en = start + a * dist; if (start.real() * en.real() > 0) lo = dist; else hi = dist; } return en.imag(); } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); double y1, y2, yw, xb, yb, r; cin >> y1 >> y2 >> yw >> xb >> yb >> r; double lowxw = 0, highxw = xb, xw, y, rxb; int cnt = 300; double yweff = yw - r; bool found = false; complex<double> A; while (cnt--) { xw = (lowxw + highxw) / 2; rxb = xw - (xb - xw); A = complex<double>(xw - rxb, yweff - yb); if (rxb > 0) A = -A; y = getYaxiyIntersection(complex<double>(rxb, yb), A); if (y - r >= y1 && y2 >= y + r && perpendicularDist(0, y, xw, yweff, 0, y2) >= r) { found = true; break; } else { if (y - r < y1) highxw = xw; else lowxw = xw; } } if (found) cout << fixed << setprecision(10) << xw << endl; else cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long i, n, m, a[200000], q, l, p, k, c[200000], b[200000], j, ans; string s[200000], ss, s1; int main() { ios_base::sync_with_stdio(0); ans = 1000000007; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + 1 + n); for (i = 1; i <= n / 2; i++) { ans = min(ans, a[n / 2 + i] - a[i]); } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> a(n); for (int &i : a) { cin >> i; } vector<vector<bool> > match(n + 1, vector<bool>(n + 1, false)); for (int i = 0, x, y; i < m; i++) { cin >> x >> y; x--; y--; match[x][y] = true; match[y][x] = true; } int ans = INT_MAX; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { for (int z = j + 1; z < n; z++) { if (match[i][j] && match[j][z] && match[z][i]) { ans = min(ans, a[i] + a[j] + a[z]); } } } } if (ans == INT_MAX) ans = -1; cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, x, ans; priority_queue<long long> q; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> x; q.push(x); if (q.top() > x) { ans += q.top() - x; q.pop(); q.push(x); } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int *p = new int[100010]; fill(p, p + 100010, -1000000000); for (int i = 0; i < n; ++i) { int x, y; int res = 0; scanf( %d%d , &x, &y); int q = (int)sqrt((double)x); for (int j = 1; j <= q; ++j) { if (x % j == 0) { if (p[j] < i - y) ++res; p[j] = i; if (p[x / j] < i - y) ++res; p[x / j] = i; } } cout << res << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { if (y == 0) return 1; long long int d = power(x, y / 2) % 1000000007; if (y % 2 == 0) return (d * d) % 1000000007; else return (((x * d) % 1000000007) * d) % 1000000007; } long long int divmod(long long int num, long long int den) { return (num * (power(den, 1000000007 - 2))) % 1000000007; } int mobius[100001]; int mob(int x) { int cnt = 0; for (int i = 2; i * i <= x; i++) { if (x % i == 0) { x = x / i; cnt++; } if (x % i == 0) { return 0; } } if (x > 1) { cnt++; } if (cnt & 1) return -1; return 1; } long long int nmod(long long int x) { return (x % 1000000007 + 1000000007) % 1000000007; } long long int fact[100001]; long long int ncr(long long int n, long long int r) { long long int num = fact[n]; long long int den = fact[r] * fact[n - r]; den %= 1000000007; return divmod(num, den); } long long int calc(long long int n, long long int k, long long int x) { n = n / x; n = n - k; if (n < 0) return 0; if (n == 0) return 1; return ncr(n + k - 1, k - 1); } void solve() { int n, k; scanf( %d , &n); scanf( %d , &k); vector<int> f; for (int i = 1; i * i <= n; i++) { if (i * i == n) { f.push_back(i); break; } if (n % i == 0) { f.push_back(i); f.push_back(n / i); } } long long int ans = 0; for (int i = 0; i < f.size(); i++) { if (mobius[f[i]] == 0) continue; ans = ans + mobius[f[i]] * calc(n, k, f[i]); } ans = nmod(ans); printf( %lld n , ans); } int main() { fact[0] = 1; for (int i = 1; i <= 100000; i++) fact[i] = (i * fact[i - 1]) % 1000000007; mobius[1] = 1; for (int i = 2; i <= 100000; i++) { mobius[i] = mob(i); } int q; scanf( %d , &q); for (int i = 0; i < q; i++) solve(); }
|
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1, ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch - 0 ); ch = getchar(); } return f * x; } const int maxn = 1e5 + 10, mod = 1e9 + 7, limit = 1e7; int n, num[2][maxn], k[2]; int f[2][maxn], cnt[2][maxn], ans[2][maxn]; queue<pair<int, int> > q; int main() { n = read(); memset(ans, 127, sizeof(ans)); k[0] = read(); for (int i = 1; i <= k[0]; i++) num[0][i - 1] = read(); k[1] = read(); for (int i = 1; i <= k[1]; i++) num[1][i - 1] = read(); ans[0][0] = ans[1][0] = 0; q.push(make_pair(0, 0)); q.push(make_pair(1, 0)); while (q.size()) { while (q.size()) { int x = q.front().first, y = q.front().second; q.pop(); for (int i = 0; i < k[x ^ 1]; i++) { int x1 = x ^ 1, y1 = (y - num[x1][i] + n) % n; if (!ans[x1][y1] || ans[x1][y1] == 1) continue; ans[x1][y1] = 1; for (int j = 0; j < k[x]; j++) { int y2 = (y1 - num[x][j] + n) % n; ++cnt[x][y2]; } } } for (int i = 0; i < 2; i++) for (int j = 0; j < n; j++) { if (!ans[i][j] || ans[i][j] == 1) continue; if (cnt[i][j] == k[i]) { ans[i][j] = 0; q.push(make_pair(i, j)); } } } for (int i = 0; i < 2; i++) { for (int j = 1; j < n; j++) { if (ans[i][j] == 0) printf( Lose ); else if (ans[i][j] == 1) printf( Win ); else printf( Loop ); } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; while (cin >> n) { stack<int> st; bool ov = true; int ovs = 0; int res = 0; int spd = 0; for (int i = 0; i < n; i++) { scanf( %d , &(a)); if (a == 1) { scanf( %d , &(b)); spd = b; } else if (a == 2) { res += ovs; ovs = 0; } else if (a == 3) { scanf( %d , &(b)); st.push(b); } else if (a == 4) { ovs = 0; } else if (a == 5) { while (!st.empty()) st.pop(); } else if (a == 6) { ovs++; } while (!st.empty() && st.top() < spd) { st.pop(); res++; } } cout << res << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using db = double; using str = string; using pi = pair<int, int>; using pl = pair<ll, ll>; using pd = pair<db, db>; using vi = vector<int>; using vb = vector<bool>; using vl = vector<ll>; using vd = vector<db>; using vs = vector<str>; using vpi = vector<pi>; using vpl = vector<pl>; using vpd = vector<pd>; template <class T> using V = vector<T>; template <class T, size_t SZ> using AR = array<T, SZ>; const int MOD = 1e9 + 7; const int MX = 2e5 + 5; const ll INF = 1e18; const ld PI = acos((ld)-1); const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1}; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); constexpr int pct(int x) { return __builtin_popcount(x); } constexpr int bits(int x) { return 31 - __builtin_clz(x); } ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); } template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template <class T, class U> T fstTrue(T lo, T hi, U first) { hi++; assert(lo <= hi); while (lo < hi) { T mid = lo + (hi - lo) / 2; first(mid) ? hi = mid : lo = mid + 1; } return lo; } template <class T, class U> T lstTrue(T lo, T hi, U first) { lo--; assert(lo <= hi); while (lo < hi) { T mid = lo + (hi - lo + 1) / 2; first(mid) ? lo = mid : hi = mid - 1; } return lo; } template <class T> void remDup(vector<T>& v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <class T, class U> void erase(T& t, const U& u) { auto it = t.find(u); assert(it != end(t)); t.erase(u); } template <class T> void re(complex<T>& c); template <class T, class U> void re(pair<T, U>& p); template <class T> void re(vector<T>& v); template <class T, size_t SZ> void re(AR<T, SZ>& a); template <class T> void re(T& x) { cin >> x; } void re(db& d) { str t; re(t); d = stod(t); } void re(ld& d) { str t; re(t); d = stold(t); } template <class T, class... U> void re(T& t, U&... u) { re(t); re(u...); } template <class T> void re(complex<T>& c) { T a, b; re(a, b); c = {a, b}; } template <class T, class U> void re(pair<T, U>& p) { re(p.first, p.second); } template <class T> void re(vector<T>& x) { for (auto& a : x) re(a); } template <class T, size_t SZ> void re(AR<T, SZ>& x) { for (auto& a : x) re(a); } str to_string(char c) { return str(1, c); } str to_string(const char* second) { return (str)second; } str to_string(str second) { return second; } str to_string(bool b) { return to_string((int)b); } template <class T> str to_string(complex<T> c) { stringstream ss; ss << c; return ss.str(); } str to_string(vector<bool> v) { str res = { ; for (int i = (0); i < ((int)(v).size()); ++i) res += char( 0 + v[i]); res += } ; return res; } template <size_t SZ> str to_string(bitset<SZ> b) { str res = ; for (int i = (0); i < (SZ); ++i) res += char( 0 + b[i]); return res; } template <class T, class U> str to_string(pair<T, U> p); template <class T> str to_string(T v) { bool fst = 1; str res = ; for (const auto& x : v) { if (!fst) res += ; fst = 0; res += to_string(x); } return res; } template <class T, class U> str to_string(pair<T, U> p) { return to_string(p.first) + + to_string(p.second); } template <class T> void pr(T x) { cout << to_string(x); } template <class T, class... U> void pr(const T& t, const U&... u) { pr(t); pr(u...); } void ps() { pr( n ); } template <class T, class... U> void ps(const T& t, const U&... u) { pr(t); if (sizeof...(u)) pr( ); ps(u...); } void DBG() { cerr << ] << endl; } template <class T, class... U> void DBG(const T& t, const U&... u) { cerr << to_string(t); if (sizeof...(u)) cerr << , ; DBG(u...); } void setIn(str second) { freopen(second.c_str(), r , stdin); } void setOut(str second) { freopen(second.c_str(), w , stdout); } void unsyncIO() { cin.tie(0)->sync_with_stdio(0); } void setIO(str second = ) { unsyncIO(); if ((int)(second).size()) { setIn(second + .in ), setOut(second + .out ); } } int main() { setIO(); int l; cin >> l; ll num = 0; vl v; v.push_back(1); for (int a = (0); a < (l); ++a) { string second; cin >> second; if (second == add ) { num += v.back(); if (num > 4294967295) { cout << OVERFLOW!!! << endl; return 0; } } else if (second == for ) { int k; cin >> k; v.push_back(min(4294967296LL, k * v.back())); } else v.pop_back(); } cout << num << endl; }
|
#include <bits/stdc++.h> using namespace std; const int cmax = 1e5 + 8; int n; int cnt[cmax]; vector<pair<int, int> > l(cmax); long long psum[cmax]; int d[202]; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) cin >> l[i].first, cnt[l[i].first]++; for (int i = 1; i <= n; i++) cin >> l[i].second; sort(l.begin() + 1, l.begin() + n + 1); for (int i = 1; i <= n; i++) psum[i] = psum[i - 1] + l[i].second; long long ans = 284488937875784; for (int i = 1; i <= n; i++) { int p = i; while (i < n and l[i].first == l[i + 1].first) i++; long long t = psum[n] - psum[i]; int x = max(0, i - 2 * cnt[l[i].first] + 1); for (int j = 1; j <= 200 and x > 0; j++) { int u = min(x, d[j]); x -= u; t += (long long)u * j; } ans = min(ans, t); for (int k = p; k <= i; k++) d[l[k].second]++; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; using i64 = long long; int n, p[666][666], quad[666]; bool alive[666]; i64 x[666], y[666], px[666], py[666]; int gopos[666][666], goneg[666][666], f[666], id[666]; i64 dp[666][666][4], ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %lld%lld , &x[i], &y[i]); } for (int i = 1; i <= n; i++) { auto getquad = [&](int px, int py) { if (px == 0 && py == 0) return 0; if (py < 0 || (py == 0 && px < 0)) return 1; return 2; }; for (int j = 1; j <= n; j++) { px[j] = x[j] - x[i]; py[j] = y[j] - y[i]; p[i][j] = j; quad[j] = getquad(px[j], py[j]); } for (int j = 1; j <= n; j++) { px[j + n] = x[i] - x[j]; py[j + n] = y[i] - y[j]; p[i][j + n] = j + n; quad[j + n] = getquad(px[j + n], py[j + n]); } sort(p[i] + 1, p[i] + 2 * n + 1, [&](int a, int b) { return quad[a] != quad[b] ? quad[a] < quad[b] : (px[a] * py[b] < px[b] * py[a]); }); for (int j = 1; j <= 2 * n; j++) if (p[i][j] > n) p[i][j] = n - p[i][j]; } for (int i = 1; i <= n; i++) { int m = 0; for (int j = 1; j <= n; j++) { if (y[j] > y[i] || (y[j] == y[i] && x[j] >= x[i])) alive[j] = 1; else alive[j] = 0; px[j] = x[j] - x[i]; py[j] = y[j] - y[i]; if (alive[j] && j != i) { f[++m] = j; } } sort(f + 1, f + m + 1, [&](int a, int b) { return px[a] * py[b] < px[b] * py[a]; }); f[0] = i; for (int i = 0; i <= m; i++) id[f[i]] = i; memset(gopos, -1, sizeof(gopos)); memset(goneg, -1, sizeof(goneg)); for (int i = 0; i <= m; i++) { int nxtpos = -1; for (int j = 4 * n; j >= 1; j--) { int aj = (j - 1) % (2 * n) + 1; int u = p[f[i]][aj]; if (u > 0 && alive[u] && nxtpos >= 0) { gopos[i][id[u]] = nxtpos; } if (u < 0 && alive[-u] && nxtpos >= 0) { goneg[i][id[-u]] = nxtpos; } if (u > 0 && alive[u] && u != f[i]) { nxtpos = id[u]; } } } memset(dp, 0, sizeof(dp)); dp[0][1][0] = 1; for (int i = 0; i <= m; i++) { int u = goneg[i][0]; for (int j = 0; j < m - 1; j++) { int v = gopos[i][u]; for (int k = 0; k <= 3; k++) { dp[i][v][k] += dp[i][u][k]; } u = v; } for (int j = i + 1; j <= m; j++) { ans += dp[i][j][3]; int nxt = goneg[j][i]; if (nxt > j) { for (int k = 0; k <= 2; k++) { dp[j][nxt][k + 1] += dp[i][j][k]; } } } } } printf( %lld n , ans); }
|
#include <bits/stdc++.h> using namespace std; template <class T> typename T::value_type arr_sum(const T& v, int n) { typename T::value_type sum = 0; for (int i = 0; i < n; ++i) sum += v[i]; return sum; } struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; int main() { int n, m; cin >> n >> m; vector<int> left; vector<int> right(n); for (int i = 0; i < n; ++i) { int t; cin >> t; left.push_back(t); } sort(left.begin(), left.end()); for (int i = 0, j = n / 2; i < n; ++i, j = (j + 1) % n) { right[i] = left[j]; } int res = 0; for (int i = 0; i < n; ++i) { if (left[i] == right[i]) { ++res; } } cout << n - res << n ; for (int i = 0; i < n; ++i) { cout << left[i] << << right[i] << n ; } }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long min(long long a, long long b) { return (a < b) ? a : b; } long long max(long long a, long long b) { return (a > b) ? a : b; } long long fp(long long a, long long b) { if (b == 0) return 1; long long x = fp(a, b / 2); x = (x * x) % mod; if (b & 1) x = (x * a) % mod; return x; } const long long N = 2000; long long bit[4 * N]; void update(long long id, long long l, long long r, long long point, long long val) { if (point < l || point > r) return; if (l == r) { bit[id] += val; return; } long long mid = (l + r) / 2; update(2 * id, l, mid, point, val); update(2 * id + 1, mid + 1, r, point, val); bit[id] = bit[2 * id] + bit[2 * id + 1]; } long long get(long long id, long long l, long long r, long long point) { if (point < l) { return 0; } if (r <= point) { return bit[id]; } long long mid = (l + r) / 2; return get(2 * id, l, mid, point) + get(2 * id + 1, mid + 1, r, point); } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; long long a[n + 1]; for (long long i = 1; i <= n; i++) { cin >> a[i]; } map<long long, vector<array<long long, 2>>> mp; for (long long i = 1; i <= n; i++) { long long sm = 0; for (long long j = i; j <= n; j++) { sm += a[j]; mp[sm].push_back({i, j}); } } vector<array<long long, 2>> ans; for (auto i : mp) { vector<array<long long, 2>> tmp; sort(i.second.begin(), i.second.end()); for (long long j = 0; j < i.second.size(); j++) { update(1, 1, n, i.second[j][1], 1); } long long st = 1; for (long long j = 0; j < i.second.size(); j++) { update(1, 1, n, i.second[j][1], -1); if (i.second[j][0] < st) continue; if (i.second[j][0] == i.second[j][1]) { tmp.push_back(i.second[j]); st = i.second[j][1] + 1; } else { long long x = get(1, 1, n, i.second[j][1] - 1) - get(1, 1, n, i.second[j][0]); if (x > 0) { continue; } else { tmp.push_back(i.second[j]); st = i.second[j][1] + 1; } } } if (tmp.size() > ans.size()) ans = tmp; } cout << ans.size() << n ; for (auto i : ans) cout << i[0] << << i[1] << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int ans = 1, n, k, i; cin >> n >> k; cout << (n / k + 1) * k; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { std::cout << std::setprecision(6) << std::fixed; double tux; cin >> tux; double foo = 0, bar = 0, baz = 0, quz = 1; for (; tux != 0.0; tux--) { double pur; cin >> pur; foo = foo + pur; bar = bar + 1; if ((foo * quz) >= (bar * baz)) { baz = foo; quz = bar; } } cout << (double)(baz / quz); return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.