func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int n; double p[110], S = 0, P = 1, ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %lf , &p[i]); sort(p + 1, p + n + 1); for (int i = n; i >= 1; i--) if (1.0 - S >= 1e-12) { ans += P * p[i] * (1 - S); S += p[i] / (1.0 - p[i]); P *= (1.0 - p[i]); } printf( %.12lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int x[N], p[N], n, d, ind[N]; long long ans = 0; vector<pair<int, int> > tank; int head, cur; bool cmp(int a, int b) { return x[a] < x[b]; } bool use(int dis) { while (dis) { if (head == (int)tank.size()) return 1; int tmp = min(dis, tank[head].first); dis -= tmp; tank[head].first -= tmp; cur -= tmp; if (tank[head].first == 0) head++; } return 0; } void sale(int p) { while ((int)tank.size() > head && tank.back().second > p) { ans -= 1LL * tank.back().second * tank.back().first; cur -= tank.back().first; tank.pop_back(); } } void buy(int p) { ans += 1LL * p * (n - cur); tank.push_back(make_pair(n - cur, p)); cur = n; } int main() { int m; scanf( %d%d%d , &d, &n, &m); for (int i = 1; i <= m; ++i) scanf( %d%d , &x[i], &p[i]), ind[i] = i; x[m + 1] = d; p[m + 1] = 0; ind[m + 1] = m + 1; sort(ind + 1, ind + 1 + m, cmp); tank.push_back(make_pair(n, 0)); cur = n; for (int i = 1; i <= m + 1; ++i) { int dis = x[ind[i]] - x[ind[i - 1]]; if (use(dis)) return 0 * puts( -1 ); sale(p[ind[i]]); buy(p[ind[i]]); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e5 + 1, INF = 1e17, MOD = 1e9 + 7; long long n; string s, t = UDRL ; map<char, long long> m; int32_t main() { ios_base::sync_with_stdio(0); cin >> n >> s; for (long long i = 0; i < n; ++i) { m[s[i]]++; } cout << 2 * (min(m[t[0]], m[t[1]]) + min(m[t[2]], m[t[3]])) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char buffer[100000], *p1, *p2; template <class T> void read(T& x) { char ch = ((p1 == p2 && (p2 = (p1 = buffer) + fread(buffer, 1, 100000, stdin), p1 == p2)) ? EOF : *p1++); x = 0; bool f = 1; while (!( 0 <= ch && ch <= 9 ) && ch != - ) ch = ((p1 == p2 && (p2 = (p1 = buffer) + fread(buffer, 1, 100000, stdin), p1 == p2)) ? EOF : *p1++); if (ch == - ) f = 0, ch = ((p1 == p2 && (p2 = (p1 = buffer) + fread(buffer, 1, 100000, stdin), p1 == p2)) ? EOF : *p1++); while ( 0 <= ch && ch <= 9 ) x = (x << 1) + (x << 3) + ch - 0 , ch = ((p1 == p2 && (p2 = (p1 = buffer) + fread(buffer, 1, 100000, stdin), p1 == p2)) ? EOF : *p1++); x = (f) ? x : -x; } int n, m; int a[605]; bool vis[605][605]; int dp[605][605]; int DP(int l, int r) { if (l >= r) return 1; if (vis[l][r]) return dp[l][r]; vis[l][r] = 1; int& ans = dp[l][r]; int mi = n + 1, mip = -1; for (register int i = l; i <= r; i++) if (mi > a[i]) mi = a[i], mip = i; int le = 0, ri = 0; for (register int i = l - 1; i < mip; i++) le += (long long int)DP(l, i) * DP(i + 1, mip - 1) % 998244353, le %= 998244353; for (register int i = r + 1; i > mip; i--) ri += (long long int)DP(i, r) * DP(mip + 1, i - 1) % 998244353, ri %= 998244353; return ans = (long long int)le * ri % 998244353; } int main() { read(n), read(m); for (register int i = 1; i <= n; i++) read(a[i]); printf( %d , DP(1, n)); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int N = 1000000 + 10; const int M = 1000; const string st2 = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; const string s1 = abcdefghijklmnopqrstuvwxyz ; pair<int, int> a[N]; int b[N]; string ans[N], da[N]; int main() { cin >> b[1] >> b[2] >> b[3] >> b[4] >> b[5] >> b[6]; int n; cin >> n; da[1] = S ; da[2] = M ; da[3] = L ; da[4] = XL ; da[5] = XXL ; da[6] = XXXL ; for (int i = 1; i <= n; i++) { string second; cin >> second; if (second == S ) a[i] = make_pair(1, 0); else if (second == M ) a[i] = make_pair(2, 0); else if (second == L ) a[i] = make_pair(3, 0); else if (second == XL ) a[i] = make_pair(4, 0); else if (second == XXL ) a[i] = make_pair(5, 0); else if (second == XXXL ) a[i] = make_pair(6, 0); else if (second[0] == S ) a[i] = make_pair(1, 1); else if (second[0] == M ) a[i] = make_pair(2, 1); else if (second[0] == L ) a[i] = make_pair(3, 1); else if (second[1] == L ) a[i] = make_pair(4, 1); else if (second[2] == L ) a[i] = make_pair(5, 1); else a[i] = make_pair(6, 1); } for (int i = 1; i <= n; i++) if (a[i].second == 0) { if (b[a[i].first] != 0) { ans[i] = da[a[i].first]; b[a[i].first]--; } } for (int i = 1; i <= 6; i++) { for (int j = 1; j <= n; j++) if (ans[j] == && a[j].second == 1) { if (a[j].first + 1 == i && b[i] > 0) { b[i]--; ans[j] = da[i]; } } for (int j = 1; j <= n; j++) if (ans[j] == && a[j].second == 1) { if (a[j].first == i && b[i] > 0) { b[i]--; ans[j] = da[i]; } } } for (int i = 1; i <= n; i++) if (ans[i] == ) { cout << NO << endl; return 0; } cout << YES << endl; for (int i = 1; i <= n; i++) cout << ans[i] << endl; } |
#include<bits/stdc++.h> using namespace std; typedef unsigned long long int ull; typedef long long int ll; typedef long double ld; #define fr(i,a,b) for(ll i=a; i<b; i++) #define rf(i,a,b) for(ll i=a; i>=b; i--) #define pb push_back #define mp make_pair #define show(a) for(auto el:a)cout<<el<< #define ff first #define ss second #define pairv vector<pair<ll,ll>> #define vec vector <ll> #define all(a) a.begin(),a.end() #define fam(v,i) for(auto i=v.begin();i!=v.end();i++) #define fai(v,i) for(auto i : v) #define mo 1000000007 #define nn cout<< n ; #define Y cout<< YES n ; #define N cout<< NO n ; #define cout_dec cout << fixed << setprecision(9) #define casepr(ti) cout<< case # <<ti+1<< : #define fill(a,b) memset(a, b, sizeof(a)) ll pow1(ll n,ll p) { if(p==0) return 1; ll x=pow1(n, p/2); x=(x*x)%mo; if(p%2==0) return x; else return (x*n)%mo; } bool sortbysec(const pair<ll,ll> &a, const pair<ll,ll> &b) { return (a.second < b.second); } bool compare(const pair<ll, ll>&p1, const pair<ll,ll>&p2) { if(p1.ff < p2.ff) return true; if(p1.ff == p2.ff) return p1.ff < p2.ss; return false; } ll const maxn=200007; ll nxt[maxn]; void seive() { for (ll i = 2; i < maxn; ++i) { if (nxt[i] == 0) { nxt[i] = i; for (ll j = i * i; j < maxn; j += i) { if(j>=maxn) { break; } if (nxt[j] == 0) nxt[j] = i; } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test=1; cin>>test; for(int ti=0;ti<test;ti++) { ll i,j,k,e,f,n,c=0,x=0; cin>>n; ll m=n+2; ll b[n+2]; fr(i,0,n+2) cin>>b[i]; sort(b,b+m); fr(i,0,n) { c=c+b[i]; } if(c== b[n] || c==b[n+1]) { fr(i,0,n) { cout<<b[i]<< ; } nn continue; } x=-1; fr(i,0,n) { if(c-b[i]+b[n]==b[n+1]) { x=i; break; } } if(x==-1) { cout<<-1; } else { fr(i,0,n+1) { if(i==x) { continue; } cout<<b[i]<< ; } } nn } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 300000 + 10; int n, a[MAXN], p[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i], p[a[i]] = i; for (int i = 0; i < n; i++) { for (int j = min(i + 100, n - 1); j > i; j--) { int nx = 2 * a[j] - a[i], nxt = 2 * a[i] - a[j]; if (nx > 0 && nx <= n && p[nx] > j) return cout << YES << endl, 0; if (nxt > 0 && nxt <= n && p[nxt] < i) return cout << YES << endl, 0; } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; return os << ] ; } template <class T> ostream& operator<<(ostream& os, set<T> S) { os << { ; for (auto s : S) os << s << ; return os << } ; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } template <class L, class R> ostream& operator<<(ostream& os, map<L, R> M) { os << { ; for (auto m : M) os << ( << m.F << : << m.S << ) ; return os << } ; } template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << std::endl; } 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...); } const int R = 65; char G[R][R]; int solve() { int n, m; cin >> n >> m; bool all = true, none = true; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> G[i][j]; if (G[i][j] == A ) none = false; else all = false; } } if (all) return 0; if (none) return -1; bool row = true; for (int i = 1; i <= m; ++i) if (G[1][i] == P ) row = false; if (row) return 1; row = true; for (int i = 1; i <= m; ++i) if (G[n][i] == P ) row = false; if (row) return 1; row = true; for (int i = 1; i <= n; ++i) if (G[i][1] == P ) row = false; if (row) return 1; row = true; for (int i = 1; i <= n; ++i) if (G[i][m] == P ) row = false; if (row) return 1; if (G[1][1] == A ) return 2; if (G[1][m] == A ) return 2; if (G[n][1] == A ) return 2; if (G[n][m] == A ) return 2; for (int i = 2; i <= n - 1; ++i) { bool eq = true; for (int j = 1; j <= m; ++j) { if (G[i][j] == P ) eq = false; } if (eq) return 2; } for (int i = 2; i <= m - 1; ++i) { bool eq = true; for (int j = 1; j <= n; ++j) { if (G[j][i] == P ) eq = false; } if (eq) return 2; } bool any = false; for (int i = 2; i <= n - 1; ++i) { if (G[i][1] == A || G[i][m] == A ) any = true; } for (int i = 2; i <= m - 1; ++i) { if (G[1][i] == A || G[n][i] == A ) any = true; } if (any) return 3; return 4; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed << setprecision(25); int t; cin >> t; while (t--) { int ans = solve(); if (ans != -1) cout << ans << n ; else cout << MORTAL << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; #define mod 1000000007 #define int long long #define pb push_back #define endl n #define ff first #define ss second #define FIO ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL); #define all(x) (x).begin(),(x).end() int32_t main() { FIO int t; cin >> t; while(t--) { int n, x, t; cin >> n >> x >> t; if(x > t) cout << 0 << endl; else { int a = t/x; int ans=0; if(a>n) ans+= (n*(n-1))/2; else { ans+= (n-a) * a; ans+= (a*(a-1))/2; } cout << ans << endl; } } } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 2e5 + 7; long long parent[MAXN], rank1[MAXN]; vector<pair<long long, pair<long long, long long>>> edges; void makest(long long v) { parent[v] = v; rank1[v] = 0; } long long find(long long v) { if (v == parent[v]) return v; return parent[v] = find(parent[v]); } void merge(long long a, long long b) { a = find(a); b = find(b); if (a != b) { if (rank1[a] < rank1[b]) swap(a, b); parent[b] = a; if (rank1[a] == rank1[b]) rank1[a]++; } } signed main() { long long n, m, mini = 1e14, node, ans = 0; cin >> n >> m; long long a[n + 1]; for (long long i = 1; i <= n; ++i) { cin >> a[i]; if (mini > a[i]) { mini = a[i]; node = i; } } for (long long i = 1; i <= n; ++i) { makest(i); } long long x, y, z; for (long long i = 1; i <= m; ++i) { cin >> x >> y >> z; edges.push_back({z, {x, y}}); } for (long long i = 1; i <= n; ++i) { if (i != node) { edges.push_back({mini + a[i], {i, node}}); } } sort(edges.begin(), edges.end()); for (auto t : edges) { x = t.second.first; y = t.second.second; z = t.first; if (find(x) != find(y)) { ans += z; merge(x, y); } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; long long a, b, n, k, h; int main() { int arr[3]; cin >> arr[0] >> arr[1] >> arr[2]; int y = 1, b = 2, r = 3; while (y < arr[0] && b < arr[1] && r < arr[2]) { y++; r++; b++; } cout << y + b + r; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, SQ = 780; const long long inf = 1e18; long long dp[2][SQ]; vector<int> v[maxn]; int n, m; long long ans; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); if ((a = n + 1 - a) >= (SQ - 1)) ans += 3; else v[b].push_back(a); } for (int i = 1; i < SQ; i++) dp[0][i] = inf; dp[0][0] = 0; for (int i = 1; i <= n; i++) { dp[i & 1][SQ - 1] = inf; sort(v[i].begin(), v[i].end()); int num = 0; for (int j = SQ - 2; j >= 0; j--) { dp[i & 1][j] = min(dp[i & 1][j + 1], num + min(dp[(i + 1) & 1][0] + (j == 0 ? 0 : 2) + 1ll * ((j * (j + 1)) / 2), dp[(i + 1) & 1][j + 1])); if (!v[i].empty() && v[i].back() == j) num += 3, v[i].pop_back(); } } ans += dp[n & 1][0]; printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; long long modex(long long a, long long b) { long long ans = 1LL; while (b) { if (b % 2) { ans *= a; ans %= 1000000009; } a *= a; a %= 1000000009; b /= 2LL; } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m, x, y; cin >> n >> m; if (m <= 20) { x = 1LL << m; if (x <= n) { cout << 0 << n ; return 0; } } x = modex(2LL, m); y = 1LL; for (int i = 1; i <= n; i++) { if (i >= x) y *= (x - i + 1000000009); else y *= (x - i); y %= 1000000009; } cout << y << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b; cin >> a >> b; if ((abs(a - b)) % 2) { cout << -1 << endl; continue; } if (a == b && b == 0) { cout << 0 << endl; continue; } if (a == b) cout << 1 << endl; else cout << 2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int ckmax(int &a, int b) { return a < b ? a = b, 1 : 0; } inline int ckmin(int &a, int b) { return a > b ? a = b, 1 : 0; } int n, r, x[1010]; double y[1010]; int main() { scanf( %d%d , &n, &r); for (int i = 1; i <= n; ++i) { scanf( %d , x + i); y[i] = r; for (int j = 1; j < i; ++j) { if (abs(x[i] - x[j]) <= 2 * r) { int d = abs(x[i] - x[j]); double l = sqrt(4 * r * r - d * d); y[i] = max(y[i], y[j] + l); } } printf( %.10f , y[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> ostream& operator<<(ostream& o, pair<A, B> a) { return o << a.first << << a.second; } template <typename A, typename B> istream& operator>>(istream& o, pair<A, B>& a) { return o >> a.first >> a.second; } const int mod = 1e9 + 7, abc = 864197532, N = 300087, K = 111; long long int modpow(long long int a, int b) { long long int ans = 1; for (; b; b >>= 1, a = a * a % mod) { if (b & 1) ans = ans * a % mod; } return ans; } int inter(vector<int> l, vector<int> r) { int ll = *max_element(l.begin(), l.end()), rr = *min_element(r.begin(), r.end()); if (ll <= rr) return rr - ll + 1; return 0; } void add(long long int& a, long long int b) { a += b; if (a >= mod) a -= mod; } void del(long long int& a, long long int b) { a -= b; if (a < 0) a += mod; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> l(n), r(n), sz(n), inv(n); for (int i = 0; i < n; ++i) cin >> l[i]; long long int al = 1; for (int i = 0; i < n; ++i) { cin >> r[i]; sz[i] = r[i] - l[i] + 1; al = al * sz[i] % mod; inv[i] = modpow(sz[i], mod - 2); } long long int square = 0, sum = 0; for (int i = 0; i + 1 < n; ++i) { add(sum, inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * al % mod * inv[i] % mod * inv[i + 1] % mod); } square = sum; for (int i = 0; i + 2 < n; ++i) { add(square, inter({l[i], l[i + 1], l[i + 2]}, {r[i], r[i + 1], r[i + 2]}) * al % mod * inv[i] % mod * inv[i + 1] % mod * inv[i + 2] % mod * 2 % mod); } long long int now = 0; for (int i = 0; i + 1 < n; ++i) add(now, 1ll * inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * inv[i] % mod * inv[i + 1] % mod); for (int i = 0; i + 1 < n; ++i) { if (i - 1 >= 0) del(now, 1ll * inter({l[i - 1], l[i]}, {r[i - 1], r[i]}) * inv[i - 1] % mod * inv[i] % mod); del(now, 1ll * inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * inv[i] % mod * inv[i + 1] % mod); if (i + 2 < n) del(now, 1ll * inter({l[i + 1], l[i + 2]}, {r[i + 1], r[i + 2]}) * inv[i + 1] % mod * inv[i + 2] % mod); add(square, now * inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) % mod * inv[i] % mod * inv[i + 1] % mod * al % mod); if (i - 1 >= 0) add(now, 1ll * inter({l[i - 1], l[i]}, {r[i - 1], r[i]}) * inv[i - 1] % mod * inv[i] % mod); add(now, 1ll * inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * inv[i] % mod * inv[i + 1] % mod); if (i + 2 < n) add(now, 1ll * inter({l[i + 1], l[i + 2]}, {r[i + 1], r[i + 2]}) * inv[i + 1] % mod * inv[i + 2] % mod); } cout << ((square + mod - sum * n * 2 % mod) * modpow(al, mod - 2) + 1ll * n * n) % mod; } |
#include <bits/stdc++.h> using namespace std; int n, a[1005]; long long dp[1005]; long long dpsum[1005]; bool b[1005]; long long ch[1005][1005]; long long gc(int c, int x) { if (x == 0 || c == x) return 1; if (!ch[c][x]) { ch[c][x] = (gc(c - 1, x - 1) + gc(c - 1, x)) % 998244353; } return ch[c][x]; } int getdp(int x) { if (!b[x]) { b[x] = 1; if (a[x] > 0) { for (int i = x + a[x] + 1; i <= n + 1; ++i) { dp[x] = (dp[x] + gc(i - x - 2, a[x] - 1) * (1LL + dpsum[i])) % 998244353; } } } return dp[x]; } int main() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; } long long ans = 0; for (int i = n; i >= 1; --i) { dpsum[i] = dpsum[i + 1] + getdp(i); dpsum[i] %= 998244353; } for (int i = 1; i <= n; ++i) { ans = ans + getdp(i); ans %= 998244353; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { short n, pos, l, r; cin >> n >> pos >> l >> r; if (1 == l && n == r) { cout << 0 ; return 0; } if (1 == l) { cout << abs(r - pos) + 1; return 0; } if (n == r) { cout << abs(pos - l) + 1; return 0; } short time = 0; if (abs(r - pos) <= abs(pos - l)) { time += abs(r - pos) + 1; pos = r; time += abs(pos - l) + 1; } else { time += abs(pos - l) + 1; pos = l; time += abs(r - pos) + 1; } cout << time; return 0; } |
#include<bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t,n; cin>>t; while(t--) { cin>>n; string str; cin>>str; int cnt_t=0,cnt_m=0; for(int i=0;i<n;i++) { if(str[i]== T ) { cnt_t++; } else { cnt_m++; } } if(cnt_t!=2*cnt_m) { cout<< NO <<endl; } else { int x=0,y=0; int flag=0; // forward check for(int i=0;i<n;i++) { if(str[i]== T ) { x++; } if(str[i]== M ) { y++; } if(y>x) { cout<< NO <<endl; flag=1; break; } } if(flag==0) { x=0; y=0; // backward check for(int i=n-1;i>=0;i--) { if(str[i]== T ) { x++; } if(str[i]== M ) { y++; } if(y>x) { cout<< NO <<endl; flag=1; break; } } } if(flag==0) { cout<< YES <<endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; char getc() { char c = getchar(); while ((c < A || c > Z ) && (c < a || c > z ) && (c < 0 || c > 9 )) c = getchar(); return c; } int gcd(int n, int m) { return m == 0 ? n : gcd(m, n % m); } int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); return x * f; } int n, a[200010], pre[200010][32], suf[200010][32], PRE[200010], SUF[200010]; long long ans; signed main() { n = read(); for (int i = 1; i <= n; i++) a[i] = read(); for (int i = 1; i <= n; i++) { for (int j = 0; j < 32; j++) pre[i][j] = pre[i - 1][j]; for (int j = 0; j < 32; j++) if (a[i - 1] & (1 << j)) pre[i][j] = i - 1; } for (int j = 0; j < 32; j++) suf[n + 1][j] = n + 1; for (int i = n; i >= 1; i--) { for (int j = 0; j < 32; j++) suf[i][j] = suf[i + 1][j]; for (int j = 0; j < 32; j++) if (a[i + 1] & (1 << j)) suf[i][j] = i + 1; } a[0] = a[n + 1] = 1000000010; for (int i = 1; i <= n; i++) { int j = i - 1; while (a[j] < a[i]) j = PRE[j]; PRE[i] = j; } SUF[n + 1] = n + 1; for (int i = n; i >= 1; i--) { int j = i + 1; while (a[j] <= a[i]) j = SUF[j]; SUF[i] = j; } for (int i = 1; i <= n; i++) { int x = PRE[i], y = SUF[i]; int u = PRE[i], v = SUF[i]; for (int j = 0; j < 32; j++) if (!(a[i] & (1 << j))) u = max(u, pre[i][j]), v = min(v, suf[i][j]); ans += 1ll * (SUF[i] - i) * (u - PRE[i]) + 1ll * (i - u) * (SUF[i] - v); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; bool pal(string s) { long long n = s.size(); for (long long i = 0; i < n / 2; i++) if (s[i] != s[n - i - 1]) return false; return true; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long test = 1; while (test--) { long long n, k, x, ab = 1e10, p, c = 0, f; cin >> n >> k >> x; vector<long long> v(n); for (long long i = 0; i < n; i++) { cin >> v[i]; if (abs(v[i]) < abs(ab)) { ab = abs(v[i]); p = i; } if (v[i] < 0) c++; } if (c % 2 == 0) { f = abs(ab) / x + 1; f = min(f, k); k -= f; if (v[p] < 0) v[p] += f * x; else v[p] -= f * x; } set<pair<long long, long long> > s; for (long long i = 0; i < n; i++) s.insert({abs(v[i]), i}); while (k > 0) { k--; p = s.begin()->second; if (v[p] < 0) { v[p] -= x; s.erase(s.begin()); s.insert({abs(v[p]), p}); } else { v[p] += x; s.erase(s.begin()); s.insert({v[p], p}); } } for (long long i = 0; i < n; i++) cout << v[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 550; char grid[maxn][maxn]; int rdp[maxn][maxn], cdp[maxn][maxn], dp[maxn][maxn]; int val[maxn][maxn]; int main() { int n, m, q, c1, c2, r1, r2; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s , grid[i]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (!i) rdp[i][j] = 0; else { rdp[i][j] = rdp[i - 1][j]; if (grid[i][j] == . && grid[i - 1][j] == . ) rdp[i][j]++; } if (!j) cdp[i][j] = 0; else { cdp[i][j] = cdp[i][j - 1]; if (grid[i][j] == . && grid[i][j - 1] == . ) cdp[i][j]++; } } } scanf( %d , &q); while (q--) { scanf( %d%d%d%d , &r1, &c1, &r2, &c2); r1--, c1--, r2--, c2--; int ans = 0; for (int i = r1; i <= r2; i++) ans += cdp[i][c2] - cdp[i][c1]; for (int j = c1; j <= c2; j++) ans += rdp[r2][j] - rdp[r1][j]; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { float H, L; cin >> H >> L; float x; x = ((L * L) - (H * H)) / (2 * H); printf( %0.6f , x); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100, maxp = 20; int n, a[maxp][maxp], ma[(1 << maxp)], cur[1 << maxp], dp[1 << maxp], cnt[maxn], f[maxp][maxn]; int ans, mp, p; char s[maxn]; vector<int> pos[20]; void solve() { dp[mp] = 1; for (int i = mp; i >= 0; i--) { if (!dp[i]) continue; for (int j = 0; j < p; j++) if ((i >> j) & 1) dp[(i ^ (1 << j))] = ma[(i ^ (1 << j))]; } return; } void init() { for (int i = 1; i <= n; i++) { cnt[s[i] - a ]++; pos[s[i] - a ].push_back(i); for (int c = 0; c < p; c++) f[c][i + 1] = f[c][i] + (s[i] == ( a + c)); } for (int i = 0; i <= mp; i++) ma[i] = 1; for (int i = 0; i < p; i++) { for (int j = 0; j <= i; j++) { memset(cur, 0, sizeof(cur)); if (a[i][j]) continue; int pos1 = 0, pos2 = 0; while (pos1 < pos[i].size() && pos2 < pos[j].size()) { if (i == j && pos[i][pos1] == pos[j][pos2]) { pos2++; continue; } int m = 0; if (pos[i][pos1] < pos[j][pos2]) { for (int c = 0; c < p; c++) { if (f[c][pos[j][pos2]] - f[c][pos[i][pos1] + 1] != 0) { m |= (1 << c); } } pos1++; } else { for (int c = 0; c < p; c++) { int pp1 = f[c][pos[j][pos2] + 1]; int pp2 = f[c][pos[i][pos1]]; if (f[c][pos[i][pos1]] - f[c][pos[j][pos2] + 1] != 0) { m = m ^ (1 << c); } } pos2++; } if ((m >> i) & 1) continue; if ((m >> j) & 1) continue; m = m ^ (mp); cur[m] = 1; } for (int i = 0; i <= mp; i++) cur[i] = !cur[i]; for (int ii = mp; ii > 0; ii--) { if (cur[ii]) continue; for (int jj = 0; jj < p; jj++) { if (jj != i && jj != j && (ii >> jj) & 1) { cur[(ii ^ (1 << jj))] = 0; } } ma[ii] &= cur[ii]; } } } } int main() { ios_base::sync_with_stdio(false); cin >> n >> p; ans = n; mp = (1 << p) - 1; for (int i = 1; i <= n; i++) cin >> s[i]; for (int i = 0; i < p; i++) for (int j = 0; j < p; j++) cin >> a[i][j]; init(); solve(); for (int i = 0; i <= mp; i++) { int res = 0; if (!dp[i]) continue; for (int j = 0; j < p; j++) if ((i >> j) & 1) { res += cnt[j]; } ans = min(ans, res); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long n, l, r, ans = 0; bool kk(long long x, long long i) { if (x == 1) { if (i == 1) return 1; else return 0; } else { long long t = 1, g; while (t <= x) t *= 2; t--; g = t / 2; if (g + 1 == i) { if (x % 2) return 1; else return 0; } else { if (i <= g) return kk(x / 2, i); else { return kk(x / 2, i - g - 1); } } } } int main() { long long i, j; cin >> n >> l >> r; if (n == 0) { cout << 0; return 0; } for (i = l; i <= r; i++) { if (kk(n, i) == 1) ans++; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 1061109567; const long long LINF = 4557430888798830399ll; void TestCase() { long long d; scanf( %lld , &d); d %= 360; if (d < 0) d += 360; int ans = INF, cnt = 0; for (int i = 0; i < 4; ++i) { int nd = abs(d - 90 * i); if (min(nd, 360 - nd) < ans) { ans = min(nd, 360 - nd); cnt = i; } } printf( %d n , cnt); } int main() { int t = 1; for (int i = 1; i <= t; ++i) { TestCase(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long lpow(long long a, long long n) { long long c = 1ll; while (n) { if (n % 2) c = (c * a) % 1000000007ll; a = (a * a) % 1000000007ll; n /= 2; } return c; } long long c[104][105], C[105][105], a[10005]; int main() { long long n, m, k, x; int i, j; cin >> n >> m >> k; for (i = 0; i <= 100; i++) { c[i][0] = 1ll; c[i][1] = i; for (j = 2; j <= i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007ll; } for (i = 0; i < n; i++) { x = m / n; if (m % n > i) x++; for (j = 0; j <= n; j++) C[i][j] = lpow(c[n][j], x); } a[0] = 1ll; for (i = 0; i < n; i++) { for (j = k; j >= 0; j--) for (x = n; x >= 1; x--) if (j >= x) a[j] = (a[j] + (a[j - x] * C[i][x]) % 1000000007ll) % 1000000007ll; } cout << a[k] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[3010][3010], t[3010][3010], S[3010], T[3010]; int nxt[3010], len, pos, tl, tr, p[3010], pre[3010][3010], n, len_s[3010]; void change(int id) { int n = strlen(s[id] + 1), j = 0; for (int i = 1; i <= n; i++) { while (j && S[j + 1] != s[id][i]) j = nxt[j]; if (S[j + 1] == s[id][i]) j++; if (j == len) { for (int k = 1; k <= len; k++) s[id][i - len + k] = T[k]; break; } } } void check(int id) { int j = 0, diff = 0; for (int i = 1; i <= len_s[id]; i++) { while (j && S[j + 1] != s[id][i]) j = nxt[j]; if (S[j + 1] == s[id][i]) j++; if (j == len && pre[id][i] - pre[id][i - len]) { p[id] = i - len + 1; break; } else if (j == len) j = nxt[j]; } } void get_S() { int mx = 0; for (int i = 1; i <= tl - 1; i++) { int flag = 1; for (int j = 1; j <= n; j++) if (p[j] && (p[j] - i <= 0 || s[j][p[j] - i] != s[pos][tl - i])) { flag = 0; break; } if (flag) mx++; else break; } tl -= mx; mx = 0; for (int i = 1; i <= n; i++) if (p[i]) p[i] = p[i] + len - 1; for (int i = 1; i <= len_s[pos] - tr; i++) { int flag = 1; for (int j = 1; j <= n; j++) if (p[j] && (p[j] + i > len_s[j] || s[j][p[j] + i] != s[pos][tr + i])) { flag = 0; break; } if (flag) mx++; else break; } tr += mx; len = tr - tl + 1; for (int i = 1; i <= len; i++) { S[i] = s[pos][i + tl - 1]; T[i] = t[pos][i + tl - 1]; } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , s[i] + 1); len_s[i] = strlen(s[i] + 1); } for (int i = 1; i <= n; i++) scanf( %s , t[i] + 1); for (int i = 1; i <= n; i++) { int lef = len_s[i] + 1, righ = 0; for (int j = 1; j <= len_s[i]; j++) if (s[i][j] != t[i][j]) { lef = min(lef, j); righ = max(righ, j); pre[i][j] = pre[i][j - 1] + 1; } else pre[i][j] = pre[i][j - 1]; if (righ - lef + 1 > len) { len = righ - lef + 1; for (int j = lef; j <= righ; j++) { S[j - lef + 1] = s[i][j]; T[j - lef + 1] = t[i][j]; } pos = i; tl = lef; tr = righ; } } int j = 0; for (int i = 2; i <= len; i++) { while (j && S[j + 1] != S[i]) j = nxt[j]; if (S[j + 1] == S[i]) j++; nxt[i] = j; } for (int i = 1; i <= n; i++) check(i); get_S(); j = 0; for (int i = 2; i <= len; i++) { while (j && S[j + 1] != S[i]) j = nxt[j]; if (S[j + 1] == S[i]) j++; nxt[i] = j; } for (int i = 1; i <= n; i++) { change(i); int len = strlen(s[i] + 1); for (int j = 1; j <= len; j++) if (s[i][j] != t[i][j]) { puts( NO ); return 0; } } puts( YES ); puts(S + 1); puts(T + 1); return 0; } |
#include<bits/stdc++.h> #define int long long #define reg register using namespace std; const int maxn=5e5+5; const int mod=1e9+7; const int INF=2e9; inline int read() { int x=0,f=1; char ch=getchar(); while(ch< 0 || ch> 9 ) { if(ch== - ) f=-1; ch=getchar(); } while(ch>= 0 && ch<= 9 ) { x=x*10+ch- 0 ; ch=getchar(); } return x*f; } int T; int d; int prime[maxn]; int tot=0; int check[maxn]; void Pre(int maxx) { check[1]=1; for(int i=2;i<=maxx;i++) { if(check[i]==0) prime[++tot]=i; for(int j=1;j<=tot && prime[j]*i<=maxx;j++) { check[i*prime[j]]=1; if(i%prime[j]==0) break; } } } signed main() { Pre(500000); //for(int i=1;i<=20;i++) //cout<<prime[i]<< ; T=read(); //cout<<tot<<endl; while(T--) { d=read(); /* if(d==2) { printf( 15 n ); continue; } else if(d==1) { printf( 6 n ); continue; }*/ int l=1,r=tot; while(l<r) { int mid=(l+r)>>1; if(prime[mid]-1>=d) r=mid; else l=mid+1; } int ans1=l; //cout<<ans1<<endl; l=ans1+1,r=tot; while(l<r) { int mid=(l+r)>>1; if(prime[mid]-prime[ans1]>=d) r=mid; else l=mid+1; } int ans2=l; printf( %lld n ,prime[ans1]*prime[ans2]); } return 0; } /* 4 3 3 2 1 6 3 4 5 1 6 2 0 */ |
#include <bits/stdc++.h> using namespace std; long long ans1, ans2; int n; char s[111111]; long long a[111111], pa[111111], b[111111], pb[111111]; inline long long get(long long x, int first) { long long t = first, ans = 0; while (t <= x) { ans += (x + 1 - t); t += 2; } return ans; } inline void solve(long long *a, long long *b, int n) { long long sum1 = 0, sum2 = 0; for (int i = 1; i <= n; i++) { if (b[i] % 2 == 0) { int r = b[i] + a[i] - 1; if (r % 2 == 0) sum1 += a[i] / 2, sum2 += a[i] / 2 + 1; else if (r % 2 == 1) sum1 += a[i] / 2, sum2 += a[i] / 2; } else if (b[i] % 2 == 1) { int r = b[i] + a[i] - 1; if (r % 2 == 0) sum1 += a[i] / 2, sum2 += a[i] / 2; else if (r % 2 == 1) sum1 += a[i] / 2 + 1, sum2 += a[i] / 2; } } for (int i = 1; i <= n; i++) { int r = b[i] + a[i] - 1; if (b[i] % 2 == 0) { if (r % 2 == 0) sum1 -= a[i] / 2, sum2 -= a[i] / 2 + 1; else if (r % 2 == 1) sum1 -= a[i] / 2, sum2 -= a[i] / 2; } else if (b[i] % 2 == 1) { if (r % 2 == 0) sum1 -= a[i] / 2, sum2 -= a[i] / 2; else if (r % 2 == 1) sum1 -= a[i] / 2 + 1, sum2 -= a[i] / 2; } if (b[i] % 2 == 0) { if (r % 2 == 0) ans2 += (a[i] / 2) * sum2, ans2 += (a[i] / 2 + 1) * sum1, ans1 += (a[i] / 2) * sum1, ans1 += (a[i] / 2 + 1) * sum2; else if (r % 2 == 1) ans2 += (a[i] / 2) * sum2, ans2 += (a[i] / 2) * sum1, ans1 += (a[i] / 2) * sum1, ans1 += (a[i] / 2) * sum2; } else if (b[i] % 2 == 1) { if (r % 2 == 0) ans2 += (a[i] / 2) * sum2, ans2 += (a[i] / 2) * sum1, ans1 += (a[i] / 2) * sum1, ans1 += (a[i] / 2) * sum2; else if (r % 2 == 1) ans2 += (a[i] / 2) * sum1, ans2 += (a[i] / 2 + 1) * sum2, ans1 += (a[i] / 2) * sum2, ans1 += (a[i] / 2 + 1) * sum1; } ans1 += get(a[i], 1); ans2 += get(a[i], 2); } } int main() { scanf( %s , s); int len = strlen(s); int t = 1; a[1] = 1; pa[1] = 0; for (int i = 1; i < len; i++) if (s[i - 1] == s[i]) a[t]++; else a[++t] = 1, pa[t] = i; int t1 = 0; for (int i = 1; i <= t; i++) if (i % 2 == 1) b[++t1] = a[i], pb[t1] = pa[i]; ans1 = 0, ans2 = 0; solve(b, pb, t1); t1 = 0; for (int i = 1; i <= t; i++) if (i % 2 == 0) b[++t1] = a[i], pb[t1] = pa[i]; solve(b, pb, t1); cout << ans2 << << ans1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int idx[2 * n + 1], chk = 2 * n; vector<long long int> coin; coin.push_back(0LL); for (long long int i = 1; i <= 2 * n; i++) { long long int x; cin >> x; idx[x] = i; } for (long long int i = 2 * n; i >= 1; i--) { if (idx[i] <= chk) { coin.push_back(chk - idx[i] + 1); chk = idx[i] - 1; } } long long int cost = n, coin_no = coin.size() - 1; long long int dp[coin_no + 1][cost + 1]; memset(dp, 0, sizeof(dp)); for (long long int i = 0; i <= coin_no; i++) dp[i][0] = 1; for (long long int i = 1; i <= coin_no; i++) { for (long long int j = 1; j <= cost; j++) { dp[i][j] = dp[i - 1][j]; if (coin[i] <= j) dp[i][j] |= dp[i - 1][j - coin[i]]; } } if (dp[coin_no][cost]) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, p[10]; map<long long, string> m; set<long long> s[10]; template <class T> string toString(T x) { ostringstream os; os << x; return os.str(); } int getlen(long long x) { int ans = 0; while (x) { ans++; x /= 10; } return max(ans, 1); } string get(long long x) { if (m.count(x)) return m[x]; return toString(x); } void relaxPower(long long x, string str) { if (x > n || str.length() >= getlen(x)) return; if (m.count(x) && m[x].length() <= str.length()) return; s[m[x].length()].erase(x); m[x] = str; s[str.length()].insert(x); } void getPowers() { for (long long x = 2; x * x <= n; x++) { long long rs = x * x; int p = 2; while (rs <= n) { string tmp = toString(x) + ^ + toString(p); relaxPower(rs, tmp); rs *= x; p++; } } } void getPowerAndPower(int len) { for (int i = 1; i <= len; i++) for (int j = i; i + j + 1 <= len; j++) for (auto x : s[i]) for (auto y : s[j]) relaxPower(x * y, get(x) + * + get(y)); } void getSimpleAndPower(int len) { for (int i = 1; i + 2 <= len; i++) { for (long long x = 1; x < p[len - i - 1]; x++) for (long long y : s[i]) relaxPower(x * y, toString(x) + * + get(y)); } } void precalc() { getPowers(); getPowerAndPower(7); getSimpleAndPower(7); } string ans; void relaxAnswer(string str) { if (str.length() < ans.length()) ans = str; } void checkAnswer() { for (int i = 1; i * 2 + 1 < ans.length(); i++) { for (long long x = 1; x <= p[i]; x++) { relaxAnswer(get(n - x) + + + get(x)); if (n % x == 0) relaxAnswer(get(n / x) + * + get(x)); } for (auto x : s[i]) { relaxAnswer(get(n - x) + + + get(x)); if (n % x == 0) relaxAnswer(get(n / x) + * + get(x)); } } } int main() { p[0] = 1; for (int i = 1; i < 10; i++) p[i] = p[i - 1] * 10; cin >> n; precalc(); ans = get(n); checkAnswer(); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, v; cin >> n >> v; map<int, int> s; for (int i = 1; i <= n; i++) { long long a; cin >> a; for (int j = 0; j < a; j++) { long long b; cin >> b; if (v > b) { s[i] = 1; } } } cout << s.size() << endl; for (map<int, int>::iterator it = s.begin(); it != s.end(); it++) cout << it->first << ; return 0; } |
#include <bits/stdc++.h> using namespace std; enum { AABB, ABAB, ABBA, AAAA }; int n, k; string s1, s2, s3, s4; bool isvow(char c) { return (c == a || c == e || c == i || c == o || c == u ); } string suf(string s) { static int sp = 0; auto i = s.end(), beg = s.begin(); int tk = 0; while (tk < k && i > beg) { --i; tk += isvow(*i); } string res(i, s.end()); if (tk < k) { res = string(sp++, ); } return res; } void foo() { cout << NO n ; exit(0); } int main(void) { int i; cin >> n >> k; int ans = AAAA; for (i = 0; i < n; ++i) { cin >> s1 >> s2 >> s3 >> s4; auto suf1 = suf(s1), suf2 = suf(s2), suf3 = suf(s3), suf4 = suf(s4); if (suf1 == suf2 && suf2 == suf3 && suf3 == suf4) { } else if (suf1 == suf2 && suf3 == suf4) { if (ans == AAAA || ans == AABB) { ans = AABB; } else { foo(); } } else if (suf1 == suf3 && suf2 == suf4) { if (ans == AAAA || ans == ABAB) { ans = ABAB; } else { foo(); } } else if (suf1 == suf4 && suf2 == suf3) { if (ans == AAAA || ans == ABBA) { ans = ABBA; } else { foo(); } } else { foo(); } } switch (ans) { case AABB: cout << aabb n ; break; case ABAB: cout << abab n ; break; case ABBA: cout << abba n ; break; case AAAA: cout << aaaa n ; break; default: foo(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> struct outputer; struct outputable {}; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; } return 0; } template <typename T1, typename T2> inline bool umn(T1& a, T2 b) { if (b < a) { a = b; return 1; } return 0; } const int N = 200000; struct Input { int n; int a[N]; vector<int> e[N]; bool read() { if (!(cin >> n)) { return 0; } for (int i = int(0); i < int(n); ++i) { scanf( %d , &a[i]); --a[i]; } for (int i = int(0); i < int(n - 1); ++i) { int x, y; scanf( %d%d , &x, &y); --x; --y; e[x].emplace_back(y); e[y].emplace_back(x); } return 1; } void init(const Input& input) { *this = input; } }; struct Data : Input { int ans; void write() { cout << ans << endl; } }; namespace Main { struct Solution : Data { int mx; array<int, 2> calc(int v, int pr) { array<int, 2> res{0, 0}; if (a[v] != -1) { res[a[v]] = 1; } for (int to : e[v]) { if (to == pr) { continue; } array<int, 2> cur = calc(to, v); for (int t = int(0); t < int(2); ++t) { umx(mx, res[t] + cur[!t]); } for (int t = int(0); t < int(2); ++t) { umx(res[t], cur[t]); if (a[v] == t) { umx(res[t], cur[!t] + 1); } } } for (int t = int(0); t < int(2); ++t) { umx(mx, res[t]); } return res; } void solve() { mx = 0; calc(0, -1); ans = mx / 2 + 1; } void clear() { for (int i = int(0); i < int(n); ++i) { e[i] = vector<int>(); } } }; } // namespace Main Main::Solution sol; int main() { cout.setf(ios::showpoint | ios::fixed); cout.precision(20); int t; cin >> t; for (int i = int(0); i < int(t); ++i) { sol.read(); sol.solve(); sol.write(); sol.clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 400010; vector<pair<int, long long> > forc[N]; vector<pair<int, pair<int, long long> > > other[N]; vector<pair<int, pair<int, long long> > > centroid[N]; long long dist[N]; int sub[N]; bool alive[N]; int belongs[N]; vector<pair<int, int> > g[N]; int perm[N], pos[N]; int v_goes_to[N]; vector<int> all; void dfs(int v, int pr) { all.push_back(v); sub[v] = 1; int sz = g[v].size(); for (int j = 0; j < sz; j++) { int u = g[v][j].first; if (!alive[u] || u == pr) { continue; } int len = g[v][j].second; dist[u] = dist[v] + len; belongs[u] = (belongs[v] == -1 ? u : belongs[v]); dfs(u, v); sub[v] += sub[u]; } } void build(int v) { all.clear(); dfs(v, -1); { int old_v = v; int total = sub[v]; int pr = -1; while (true) { bool found = false; int sz = g[v].size(); for (int j = 0; j < sz; j++) { int u = g[v][j].first; if (!alive[u] || u == pr) { continue; } if (2 * sub[u] >= total) { pr = v; v = u; found = true; break; } } if (!found) { break; } } v_goes_to[old_v] = v; } all.clear(); dist[v] = 0; belongs[v] = -1; dfs(v, -1); int cnt = all.size(); for (int i = 0; i < cnt; i++) { int u = all[i]; centroid[u].push_back(make_pair(v, make_pair(belongs[u], dist[u]))); } for (int i = 0; i < cnt; i++) { int u = all[i]; forc[v].push_back(make_pair(pos[u], dist[u])); } sort(forc[v].begin(), forc[v].end()); for (int j = 1; j < cnt; j++) { forc[v][j].second += forc[v][j - 1].second; } for (int i = 1; i < cnt; i++) { int u = all[i]; other[v].push_back(make_pair(belongs[u], make_pair(pos[u], dist[u]))); } sort(other[v].begin(), other[v].end()); for (int j = 1; j < cnt - 1; j++) { other[v][j].second.second += other[v][j - 1].second.second; } vector<int> children; for (int i = 0; i < cnt; i++) { int u = all[i]; if (belongs[u] == u) { children.push_back(u); } } alive[v] = false; for (int i = 0; i < (int)children.size(); i++) { build(children[i]); } } int main() { int n, tt; scanf( %d %d , &n, &tt); for (int i = 0; i < n; i++) { scanf( %d , perm + i); perm[i]--; pos[perm[i]] = i; } for (int i = 0; i < n - 1; i++) { int x, y, z; scanf( %d %d %d , &x, &y, &z); x--; y--; g[x].push_back(make_pair(y, z)); g[y].push_back(make_pair(x, z)); } for (int i = 0; i < n; i++) { alive[i] = true; } build(0); int last = 0; while (tt--) { int com; scanf( %d , &com); if (com == 1) { int from, to, ver; scanf( %d %d %d , &from, &to, &ver); from ^= last; to ^= last; ver ^= last; from--; to--; ver--; long long ans = 0; for (pair<int, pair<int, long long> > p : centroid[ver]) { int v = p.first; int bel = p.second.first; long long d = p.second.second; long long sumd = 0; int cnt = 0; { int pf = lower_bound(forc[v].begin(), forc[v].end(), make_pair(from, -1LL)) - forc[v].begin(); int pt = lower_bound(forc[v].begin(), forc[v].end(), make_pair(to + 1, -1LL)) - forc[v].begin(); if (pf < pt) { sumd += forc[v][pt - 1].second; if (pf > 0) { sumd -= forc[v][pf - 1].second; } cnt += pt - pf; } } { int pf = lower_bound(other[v].begin(), other[v].end(), make_pair(bel, make_pair(from, -1LL))) - other[v].begin(); int pt = lower_bound(other[v].begin(), other[v].end(), make_pair(bel, make_pair(to + 1, -1LL))) - other[v].begin(); if (pf < pt) { sumd -= other[v][pt - 1].second.second; if (pf > 0) { sumd += other[v][pf - 1].second.second; } cnt -= pt - pf; } } ans += sumd + cnt * d; } printf( %lld n , ans); last = ans & ((1 << 30) - 1); } else { int x; scanf( %d , &x); x ^= last; x--; int v1 = perm[x]; int v2 = perm[x + 1]; int c1 = centroid[v1].size(); int c2 = centroid[v2].size(); int i1 = 0; int i2 = 0; while (i1 < c1 && i2 < c2 && centroid[v1][i1].first == centroid[v2][i2].first) { pair<int, pair<int, long long> > p = centroid[v1][i1]; int v = p.first; int bel1 = p.second.first; int bel2 = centroid[v2][i2].second.first; long long d2 = centroid[v2][i2].second.second; { int at = lower_bound(forc[v].begin(), forc[v].end(), make_pair(pos[v1], -1LL)) - forc[v].begin(); forc[v][at].second = (at == 0 ? 0LL : forc[v][at - 1].second) + d2; } { if (bel1 == bel2) { int at = lower_bound(other[v].begin(), other[v].end(), make_pair(bel1, make_pair(pos[v1], -1LL))) - other[v].begin(); other[v][at].second.second = (at == 0 ? 0LL : other[v][at - 1].second.second) + d2; } else { if (v != v1) { int at = lower_bound(other[v].begin(), other[v].end(), make_pair(bel1, make_pair(pos[v1], -1LL))) - other[v].begin(); other[v][at].second.first = pos[v2]; } if (v != v2) { int at = lower_bound(other[v].begin(), other[v].end(), make_pair(bel2, make_pair(pos[v2], -1LL))) - other[v].begin(); other[v][at].second.first = pos[v1]; } } } i1++; i2++; } for (int rot = 0; rot < 2; rot++) { while (i1 < c1) { pair<int, pair<int, long long> > p = centroid[v1][i1]; int v = p.first; int bel = p.second.first; { int at = lower_bound(forc[v].begin(), forc[v].end(), make_pair(pos[v1], -1LL)) - forc[v].begin(); forc[v][at].first = pos[v2]; } if (v != v1) { int at = lower_bound(other[v].begin(), other[v].end(), make_pair(bel, make_pair(pos[v1], -1LL))) - other[v].begin(); other[v][at].second.first = pos[v2]; } i1++; } swap(v1, v2); swap(c1, c2); swap(i1, i2); } swap(perm[x], perm[x + 1]); pos[perm[x]] = x; pos[perm[x + 1]] = x + 1; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, A, B, inf = 1e9, f[110][110], x, y, K, g[110][110], Cnt[110], d[110][110]; bool vis[110][110], V[110][110], Must[110][110]; vector<int> E1[110], E2[110], E[110][110]; queue<pair<int, int> > h; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 || ch > 9 ); ch = getchar()) ; if (ch == - ) mark = -1, ch = getchar(); for (x = 0; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 48; x *= mark; } int main() { read(n); read(m); read(A); read(B); for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) f[i][j] = f[j][i] = inf; for (int i = 1; i <= m; i++) { read(x); read(y); f[x][y] = 1; E1[x].push_back(y); E2[y].push_back(x); } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]); read(K); for (int i = 1; i <= K; i++) { read(x); read(y); int dis = f[x][y]; if (dis == inf) continue; memset(Cnt, 0, sizeof(Cnt)); for (int j = 1; j <= n; j++) if (f[x][j] + f[j][y] == dis) { V[i][j] = 1; Cnt[f[x][j]]++; for (int k = 0; k < E1[j].size(); k++) { int v = E1[j][k]; if (f[x][j] + 1 + f[v][y] == dis) E[i][v].push_back(j), d[i][j]++; } } for (int j = 1; j <= n; j++) if (V[i][j] && Cnt[f[x][j]] == 1) Must[i][j] = 1; } for (int i = 1; i <= K; i++) if (V[i][B]) { vis[B][i] = 1, g[B][i] = 1; h.push(make_pair(B, i)); } for (int _ = 1; _ <= K; _++) { while (h.size()) { pair<int, int> now = h.front(); h.pop(); int u = now.first, x = now.second; for (int i = 0; i < E[x][u].size(); i++) { int v = E[x][u][i]; d[x][v]--; if (d[x][v] == 0 && !vis[v][x]) { vis[v][x] = 1; g[v][x] = g[u][x]; h.push(make_pair(v, x)); } } } for (int i = 1; i <= K; i++) if (vis[A][i] && Must[i][A]) { printf( %d n , _); return 0; } for (int i = 1; i <= n; i++) for (int j = 1; j <= K; j++) if (vis[i][j] && Must[j][i] && g[i][j] == _) { for (int k = 1; k <= K; k++) if (!vis[i][k] && V[k][i]) { g[i][k] = g[i][j] + 1; vis[i][k] = 1; h.push(make_pair(i, k)); } } } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; string S; signed long long mo = 1000000007; int N; string qs[100005]; signed long long memo[20][100005]; signed long long dig[20][100005]; void solve() { int i, j, k, l, r, x, y; string s; cin >> qs[0]; cin >> N; N++; qs[0] = 0-> + qs[0]; for (i = 1; i < N; i++) cin >> qs[i]; for (i = 0; i < 10; i++) memo[i][N] = i, dig[i][N] = 10; for (i = N - 1; i >= 0; i--) { for (j = 0; j < 10; j++) memo[j][i] = memo[j][i + 1], dig[j][i] = dig[j][i + 1]; int from = qs[i][0] - 0 ; memo[from][i] = 0; dig[from][i] = 1; for (j = qs[i].size() - 1; j >= 3; j--) { int nn = qs[i][j] - 0 ; memo[from][i] = (memo[from][i] + memo[nn][i + 1] * dig[from][i]) % mo; dig[from][i] = (dig[from][i] * dig[nn][i + 1]) % mo; } } cout << memo[0][0] << endl; } int main(int argc, char** argv) { string s; int i; if (argc == 1) ios::sync_with_stdio(false); for (i = 0; i < argc - 1; i++) s += argv[i + 1], s += n ; for (i = 0; i < s.size(); i++) ungetc(s[s.size() - 1 - i], stdin); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1); const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int N = 2e5 + 5; int n, m, idx; char s[N], ans[N]; bool st[10]; set<int> all; bool check(int x) { if (x == 2) return 0; for (int i = 2; i <= x / i; ++i) if (x % i == 0) return 1; return 0; } void dfs(int i, int sum) { if (i > n) { all.insert(sum); return; } ans[++idx] = s[i]; dfs(i + 1, sum * 10 + s[i] - 0 ); --idx; dfs(i + 1, sum); } int main() { st[2] = st[3] = st[5] = st[7] = 1; int t; cin >> t; while (t--) { cin >> n >> s + 1; int cnt[10] = {0}; idx = 0; for (int i = 1; i <= n; ++i) { if (!st[s[i] - 0 ]) { ans[++idx] = s[i]; goto out; } } for (int i = 1; i <= n; ++i) { cnt[s[i] - 0 ]++; if (cnt[s[i] - 0 ] > 1) { ans[++idx] = s[i]; ans[++idx] = s[i]; goto out; } } all.clear(); dfs(1, 0); for (int i : all) if (check(i)) { int k = i; while (k) { ans[++idx] = k % 10 + 0 ; k /= 10; } reverse(ans + 1, ans + 1 + idx); break; } out: printf( %d n , idx); for (int i = 1; i <= idx; ++i) printf( %c , ans[i]); puts( ); } return 0; } |
#include <bits/stdc++.h> int main() { int n, m, sum = 0, i, j; int a[500][3], b[500][3]; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d %d %d , &a[i][0], &a[i][1], &a[i][2]); scanf( %d , &m); for (i = 0; i < m; i++) scanf( %d %d %d , &b[i][0], &b[i][1], &b[i][2]); for (i = 0; i < n; i++) { int min = 1e9; int x = (a[i][0] + a[i][1]) * 2; for (j = 0; j < m; j++) { int y; if (a[i][2] > b[j][0]) continue; y = b[j][0] / a[i][2] * b[j][1]; if (x % y == 0) { y = x / y; } else { y = x / y + 1; } if (y * b[j][2] < min) min = y * b[j][2]; } sum += min; } printf( %d n , sum); return 0; } |
#include <bits/stdc++.h> using namespace std; pair<long long, long long> a[100001]; long long start = 0; long long h; long long res; long long c[100001]; long long n; int main() { ios_base::sync_with_stdio(false); cin >> n >> h; for (int i = 1; i <= n; ++i) { cin >> a[i].first; a[i].second = i; } sort(a + 1, a + n + 1); res = a[n].first + a[n - 1].first - a[1].first - a[2].first; for (int i = n; i >= 2; --i) { long long curmax, curmin; if (i == n) curmax = max(a[n].first + a[n - 1].first + h, a[n - 1].first + a[n - 2].first); else curmax = max(a[n].first + a[n - 1].first, a[n].first + a[i - 1].first + h); if (i != 2) curmin = min(a[i].first + a[1].first + h, a[1].first + a[2].first); else curmin = min(a[2].first + a[1].first + h, a[2].first + a[3].first); long long curdif = curmax - curmin; if (curdif < res) { res = curdif; start = i - 1; } } for (int i = 1; i <= start; ++i) { c[a[i].second] = 1; } cout << res << endl; for (int i = 1; i <= n; ++i) { if (c[i]) cout << c[i] << ; else cout << 2 << ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; clock_t timeStart, timeFinish; void timeBegin() { timeStart = clock(); } void timeEnd() { timeFinish = clock(); } void timeDuration() { double time_taken = double(timeFinish - timeStart) / double(CLOCKS_PER_SEC); cout << Time taken by program is : << fixed << time_taken << setprecision(5); cout << sec << endl; } int blo[1000005]; bool fun(const pair<pair<int, int>, int> &x, const pair<pair<int, int>, int> &y) { if (blo[x.first.first] != blo[y.first.first]) { return blo[x.first.first] < blo[y.first.first]; } if (blo[x.first.first] % 2) { return x.first.second > y.first.second; } else { return x.first.second < y.first.second; } } void solve() { int n; cin >> n; int x[n + 3], y[n + 3]; vector<pair<pair<int, int>, int>> v; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; v.push_back({{x[i], y[i]}, i}); } for (int i = 0; i <= 1000000; i++) { blo[i] = i / 1000; } sort(v.begin(), v.end(), fun); for (int i = 0; i < n; i++) cout << v[i].second << ; cout << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Dinic { static const int MXN = (int)2e6; struct Edge { int v, f, re; }; int n, s, t, level[MXN]; vector<Edge> E[MXN]; void init(int _n, int _s, int _t) { n = _n; s = _s; t = _t; } void add_edge(int u, int v, int f) { E[u].push_back({v, f, (int)E[v].size()}); E[v].push_back({u, 0, (int)E[u].size() - 1}); } bool BFS() { for (int i = 0; i < n; i++) level[i] = -1; queue<int> que; que.push(s); level[s] = 0; while (!que.empty()) { int u = que.front(); que.pop(); for (auto &it : E[u]) { if (it.f > 0 && level[it.v] == -1) { level[it.v] = level[u] + 1; que.push(it.v); } } } return level[t] != -1; } int DFS(int u, int nf) { if (u == t) return nf; int res = 0; for (auto &it : E[u]) { if (it.f > 0 && level[it.v] == level[u] + 1) { int tf = DFS(it.v, min(nf, it.f)); res += tf; nf -= tf; it.f -= tf; E[it.v][it.re].f += tf; if (nf == 0) return res; } } if (!res) level[u] = -1; return res; } int flow(int res = 0) { while (BFS()) res += DFS(s, 2147483647); return res; } } flow; struct Node { int l, r, y, v; bool operator<(const Node &rhs) const { return y < rhs.y; } }; int n, q, s, t, tot; vector<Node> seg; namespace segtree { static const int N = (int)1e4 + 5; static const int inf = (int)1e9; int id[N * 4], id2[N * 4], tag[N * 4]; void pull(int o, int lson, int rson) { id[o] = tot++; if (!tag[lson]) flow.add_edge(id[o], id[lson], inf); if (!tag[rson]) flow.add_edge(id[o], id[rson], inf); } void build1(int l, int r, int o = 0) { if (l + 1 == r) return void(id[o] = n + l); int mid = (l + r) >> 1, lson = o * 2 + 1, rson = o * 2 + 2; build1(l, mid, lson); build1(mid, r, rson); pull(o, lson, rson); } void build2(int l, int r, int o = 0) { if (l + 1 == r) return void(id2[o] = l); int mid = (l + r) >> 1, lson = o * 2 + 1, rson = o * 2 + 2; id2[o] = tot++; build2(l, mid, lson); build2(mid, r, rson); flow.add_edge(id2[lson], id2[o], inf); flow.add_edge(id2[rson], id2[o], inf); } void build(int l, int r) { build1(l, r); build2(l, r); } void modify1(int l, int r, int ql, int qr, int v, int o = 0) { if (ql <= l && r <= qr) return void(tag[o] += v); int mid = (l + r) >> 1, lson = o * 2 + 1, rson = o * 2 + 2; if (ql < mid) modify1(l, mid, ql, qr, v, lson); if (mid < qr) modify1(mid, r, ql, qr, v, rson); pull(o, lson, rson); } void modify2(int l, int r, int ql, int qr, int o = 0) { if (ql <= l && r <= qr) return void(flow.add_edge(id2[o], id[0], inf)); int mid = (l + r) >> 1, lson = o * 2 + 1, rson = o * 2 + 2; if (ql < mid) modify2(l, mid, ql, qr, lson); if (mid < qr) modify2(mid, r, ql, qr, rson); } void modify(int l, int r, int ql1, int qr1, int v, int ql2, int qr2) { if (!tag[0] && ql2 < qr2) modify2(l, r, ql2, qr2); modify1(l, r, ql1, qr1, v); } } // namespace segtree void init() { cin >> n >> q; for (int i = 0; i < q; ++i) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; seg.push_back({x1, x2 + 1, y1, 1}); seg.push_back({x1, x2 + 1, y2 + 1, -1}); } sort(seg.begin(), seg.end()); } void solve() { tot = 2 * n + 2, s = 0, t = 2 * n + 1; for (int i = 1; i <= n; ++i) { flow.add_edge(s, i, 1); flow.add_edge(i + n, t, 1); } segtree::build(1, n + 1); int preY = 1; for (auto [l, r, y, v] : seg) { segtree::modify(1, n + 1, l, r, v, preY, y); preY = y; } if (preY < n + 1) segtree::modify2(1, n + 1, preY, n + 1); flow.init(tot, s, t); cout << flow.flow() << n ; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); init(); solve(); } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int n) { if (x == 0) return 0; if (n == 0) return 1; if (n == 1) return x; if (n % 2 == 0) { long long int temp = power(x, n / 2); return (temp % 1000000007 * temp % 1000000007) % 1000000007; } else { long long int temp = power(x, n / 2); return (x % 1000000007 * ((temp % 1000000007 * temp % 1000000007) % 1000000007) % 1000000007) % 1000000007; } } long long int findroot(long long int i, long long int Arr[]) { while (Arr[i] != i) { Arr[i] = Arr[Arr[i]]; i = Arr[i]; } return i; } void weightedunion(long long int i, long long int j, long long int arr[], long long int size[]) { long long int x = findroot(i, arr); long long int y = findroot(j, arr); if (size[x] > size[y]) { size[x] += size[y]; arr[y] = arr[x]; } else { size[y] += size[x]; arr[x] = arr[y]; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, k, i, j, temp, ans = 0; cin >> n >> k; long long int arr[n]; set<long long int> s; map<long long int, long long int> mp; for (i = 0; i < n; i++) { cin >> arr[i]; mp[arr[i]]++; } if (k == 1) cout << mp.size() << n ; else { sort(arr, arr + n); for (i = 0; i < n; i++) { if (s.find(arr[i]) != s.end()) continue; else { s.insert(arr[i]); vector<long long int> inc; vector<long long int> ninc; inc.push_back(mp[arr[i]]); ninc.push_back(0); for (temp = k * arr[i]; temp <= (long long int)1e9; temp = temp * k) { s.insert(temp); if (mp.find(temp) == mp.end()) { inc.push_back(max(inc.back(), ninc.back())); ninc.push_back(inc.back()); } else { long long int x = inc.back(), y = ninc.back(); inc.push_back(mp[arr[i]] + ninc.back()); ninc.push_back(max(x, y)); } } ans += max(inc.back(), ninc.back()); } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int ara[1000005], n, m, dp[1005][1005]; long long int func(long long int i, long long int j) { if ((j + ara[i]) % m == 0) { return 1; } if (i >= n - 1) { if ((j + ara[i]) % m == 0) { return 1; } else return 0; } if (dp[i][j] != -1) { return dp[i][j]; } long long int p1 = 0, p2 = 0; p1 = func(i + 1, (j + ara[i]) % m); p2 = func(i + 1, j); dp[i][j] = p1 | p2; return dp[i][j]; } int main() { long long int i, k, sum = 0; scanf( %I64d %I64d , &n, &m); for (i = 0; i < n; i++) { scanf( %I64d , &ara[i]); } if (n > m) { printf( YES n ); return 0; } memset(dp, -1, sizeof dp); k = func(0, 0); if (k == 1) { printf( YES n ); } else { printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(0); std::cout.tie(0); } 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 / gcd(a, b) * b; } void solve() { long long n; cin >> n; vector<long long> a(n); vector<long long> cnt(n + 1); for (long long(i) = 0; (i) < (n); (i)++) { cin >> a[i]; cnt[a[i]]++; } vector<long long> ans(n + 1); vector<long long> add; long long i = 0; for (; i < n + 1; i++) { ans[i] = cnt[i]; if (cnt[i] == 0) break; for (long long j = 0; j < cnt[i] - 1; j++) add.push_back(i); } i++; for (; i < n + 1; i++) { if (ans[i - 1] == -1) { ans[i] = -1; continue; } ans[i] = ans[i - 1] + cnt[i] - cnt[i - 1]; if (cnt[i - 1] == 0) { if (add.empty()) { ans[i] = -1; continue; } ans[i] += (i - add.back() - 1); add.pop_back(); } for (long long j = 0; j < cnt[i] - 1; j++) add.push_back(i); } for (auto x : ans) cout << x << ; cout << n ; } signed main() { fast(); long long t = 1; cin >> t; for (long long(i) = 0; (i) < (t); (i)++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; int a[MAXN]; int main() { int n, k; while (scanf( %d%d , &n, &k) != EOF) { for (int i = 0; i < n; i++) scanf( %d , &a[i]); int res = 0; int sum = (1 << 29); for (int i = 0; i < n; i++) { int tmp = 0, flag = true; for (int j = 0; j < n; j++) if (a[j] != a[i] + (j - i) * k) { tmp++; if (a[i] + (j - i) * k <= 0) flag = false; } if (flag && tmp < sum) sum = tmp, res = i; } printf( %d n , sum); if (sum) { for (int i = 0; i < n; i++) { int tmp = a[res] + (i - res) * k; if (a[i] < tmp) printf( + %d %d n , i + 1, tmp - a[i]); else if (a[i] > tmp) printf( - %d %d n , i + 1, a[i] - tmp); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long M = 1000000000000000003LL; int n, m; long long pow2[262144]; char S[262144]; char T[262144]; long long hS[262144][26]; long long hT[262144][26]; long long curh[26]; vector<int> ans; bool v[26]; inline long long mulmod(long long x, long long y, long long mod) { return (x * y) - mod * (long long)((long double)x * y / mod); } bool check(long long a[26], long long b[26]) { memset(v, false, sizeof v); for (int i = 0; i < 26; ++i) { if (a[i] == 0) continue; if (v[i]) continue; if (a[i] == b[i]) { v[i] = true; continue; } for (int j = 0; j < 26; ++j) if (a[i] == b[j]) { if (v[j]) return false; if (b[i] == a[j]) { v[j] = true; v[i] = true; break; } else return false; } if (!v[i]) return false; } return true; } int main() { pow2[0] = 1; for (int i = 1; i < 262144; ++i) pow2[i] = pow2[i - 1] * 2ll % M; scanf( %d%d , &n, &m); scanf( %s , S + 1); scanf( %s , T + 1); for (int i = 1; i <= m; ++i) { for (int j = 0; j < 26; ++j) hT[i][j] = hT[i - 1][j] * 2ll % M; (hT[i][T[i] - 97] += 1ll) %= M; } for (int i = 1; i <= n; ++i) { for (int j = 0; j < 26; ++j) hS[i][j] = hS[i - 1][j] * 2ll % M; (hS[i][S[i] - 97] += 1ll) %= M; } for (int i = m; i <= n; ++i) { for (int j = 0; j < 26; ++j) { curh[j] = (hS[i][j] - mulmod(hS[i - m][j], pow2[m], M)) % M; if (curh[j] < 0) curh[j] += M; } if (check(hT[m], curh)) ans.push_back(i - m + 1); } int sz = ans.size(); printf( %d n , sz); for (int i = 0; i < sz; ++i) { printf( %d , ans[i]); if (i + 1 < sz) printf( ); else printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; const long double pi = 3.141592; const long long mod1 = 1e9 + 7; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int n; cin >> n; vector<int> d(n + 1); set<int> set; int x = 1, y = 1; int m = 1; for (int i = 1; i <= n; i++) { cin >> d[i]; m = max(m, d[i]); } for (int i = 1; i <= n; i++) { if (m % d[i] == 0 && set.find(d[i]) == set.end()) { set.insert(d[i]); d[i] = -1; } } for (int i = 1; i <= n; i++) { y = max(y, d[i]); } cout << m << << y; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = ~(1 << 31); int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); } int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; int m = 0, l = 0; for (int i = 1; i < n; i++) { if (v[i] < v[m] && m != 0) { cout << 3 << endl; cout << 1 << m + 1 << << i + 1 << endl; return 0; } if (v[i] > v[l] && l != 0) { cout << 3 << endl; cout << 1 << l + 1 << << i + 1 << endl; return 0; } if (v[i] > v[m]) { m = i; } if (v[i] < v[l]) { l = i; } } cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000000 + 7; const int MAX = 100000; map<pair<string, int>, int> F; vector<pair<string, int>> v, ans; pair<string, int> q; set<string> s; int n; vector<int> g[300000]; vector<int> S[300000]; bool used[300000]; bool cmp(int i1, int i2) { return v[i1].second > v[i2].second; } bool qw(int i1, int i2) { return i1 > i2; } int main() { cin >> n; for (int i = (0); i < (n); i++) { cin >> q.first >> q.second; if (!F.count(q)) F[q] = v.size(), v.push_back(q); int V = F[q]; int k; cin >> k; for (int j = (0); j < (k); j++) { cin >> q.first >> q.second; if (!F.count(q)) F[q] = v.size(), v.push_back(q); g[V].push_back(F[q]); } } S[0].push_back(0); used[0] = 1; s.insert(v[0].first); for (int i = (0); i < (n); i++) { sort(S[i].begin(), S[i].end(), cmp); for (int j = (0); j < (S[i].size()); j++) { if (i && !s.count(v[S[i][j]].first)) { s.insert(v[S[i][j]].first); ans.push_back(v[S[i][j]]); } else if (i) continue; for (int k = (0); k < (g[S[i][j]].size()); k++) if (!used[g[S[i][j]][k]]) S[i + 1].push_back(g[S[i][j]][k]), used[g[S[i][j]][k]] = 1; } } sort(ans.begin(), ans.end()); cout << ans.size() << n ; for (int i = (0); i < (ans.size()); i++) cout << ans[i].first << << ans[i].second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y, m{99999}; cin >> n; int* A = new int[n]; for (int i{0}; i < n; i++) cin >> A[i]; for (int i{0}; i < n; i++) { int s{0}; for (int j{0}; j < A[i]; j++) { cin >> x; s += x; } y = (15 * A[i]) + s * 5; if (y < m) m = y; } cout << m; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1003, mod = 998244353; template <typename T> void read(T &x) { int ch = getchar(); x = 0; bool f = false; for (; ch < 0 || ch > 9 ; ch = getchar()) f |= ch == - ; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; if (f) x = -x; } int n, fa[N]; bool vis[N]; vector<int> in[N], nxt[N], pos; char str[N]; map<vector<int>, vector<bool> > buc; vector<bool> query(const vector<int> &v) { if (buc.count(v)) return buc[v]; putchar( ? ); for (int u : v) printf( %d , u); putchar( n ); fflush(stdout); scanf( %s , str); vector<bool> res(n); for (int i = 0; i < n; ++i) res[i] = (str[i] != 0 ); return buc[v] = res; } int main() { read(n); in[0].emplace_back(0); vis[0] = vis[n] = true; for (int i = 1; i < n; ++i) nxt[0].emplace_back(i); while (true) { bool flg = true; pos.resize(0); for (int i = 0; i <= n; ++i) if (vis[i]) pos.emplace_back(i); for (int _ = 0; _ < 2; ++_) { vector<int> d1(n, 0), d2(n, 0); for (int i = _; i + 1 < pos.size(); i += 2) { if (in[pos[i]].empty() || pos[i + 1] == pos[i] + 1) continue; if (pos[i + 1] == pos[i] + 2) { in[pos[i] + 1] = nxt[pos[i]]; nxt[pos[i]].resize(0); vis[pos[i] + 1] = true; continue; } flg = false; int mid = pos[i] + pos[i + 1] + 1 >> 1; for (int u : in[pos[i]]) { d2[u] = mid - pos[i]; d1[u] = d2[u] - 1; } } vector<bool> a1 = query(d1), a2 = query(d2); for (int i = _; i + 1 < pos.size(); i += 2) { if (in[pos[i]].empty() || pos[i + 1] <= pos[i] + 2) continue; int mid = pos[i] + pos[i + 1] + 1 >> 1; vector<int> tmp = nxt[pos[i]]; nxt[pos[i]].resize(0); for (int x : tmp) { if (a1[x]) nxt[pos[i]].emplace_back(x); else if (a2[x]) in[mid].emplace_back(x); else nxt[mid].emplace_back(x); } vis[mid] = true; } } if (flg) break; } for (int _ = 1; _ <= 3; ++_) for (int i = 0; (1 << i) < n; ++i) { vector<int> d(n, 0); bool flg = true; for (int x = _; x < n; x += 3) if (!in[x].empty()) for (int v : in[x - 1]) if (v >> i & 1) { d[v] = 1; flg = false; } if (flg) continue; vector<bool> res = query(d); for (int x = _; x < n; x += 3) if (!in[x].empty()) for (int v : in[x]) if (res[v]) fa[v] |= 1 << i; } puts( ! ); for (int i = 1; i < n; ++i) printf( %d %d n , fa[i] + 1, i + 1); } |
#include <bits/stdc++.h> using namespace std; namespace fastIO { bool IOerror = 0; inline bool blank(char ch) { return ch == || ch == n || ch == r || ch == t ; } inline long long read() { bool sign = 0; char ch = getchar(); long long x = 0; for (; blank(ch); ch = getchar()) ; if (IOerror) return 0; if (ch == - ) sign = 1, ch = getchar(); for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; if (sign) x = -x; return x; } }; // namespace fastIO using namespace fastIO; struct node { long long l, r, len; node(long long x, long long y) { l = x, r = y, len = y - x + 1; } bool operator<(const node& bb) const { return len != bb.len ? len > bb.len : l < bb.l; } }; set<node> s; long long now = 0; long long l[1000010], r[1000010], len[1000010], num[1000010], ans[2010][2010]; signed main() { long long n = read(), maxx = 0; s.insert(node(1, n + 1)); for (long long i = 1; i <= n; i++) { long long x = read(); now = 0; for (auto i : s) { l[++now] = i.l, r[now] = i.r, len[now] = i.len; num[now] = 0; } for (long long j = 1; j <= now; j++) { num[j] = 1; ans[l[j]][i] = 1; maxx = max(maxx, l[j]); x--; if (!x) break; } if (x) { for (long long j = 1; j <= now; j++) { while (num[j] < len[j] - 1 && x) { ans[l[j] + num[j]][i] = 1; maxx = max(maxx, l[j] + num[j]); num[j]++; x--; } } } if (x) { for (long long j = 1; j <= now; j++) { if (x && num[j] != len[j]) ans[r[j]][i] = 1, x--, num[j]++, maxx = max(maxx, r[j]); } } s.clear(); for (long long j = 1; j <= now; j++) { if (num[j]) s.insert(node(l[j], l[j] + num[j] - 1)); if (num[j] != len[j]) s.insert(node(l[j] + num[j], r[j])); if (len[j] == 1) s.insert(node(l[j], r[j])); } } cout << maxx << n ; for (long long i = 1; i <= maxx; i++) { for (long long j = 1; j <= n; j++) cout << ans[i][j]; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace mincostflow { struct edge { int to, cap, cost, rev; edge(int to = 0, int cap = 0, int cost = 0, int rev = 0) : to(to), cap(cap), cost(cost), rev(rev) {} }; vector<edge> g[7000]; int dist[7000], q[7000 * 2]; int frome[7000], fromv[7000]; bool inq[7000]; int s, t; void add_edge(int from, int to, int cap, int cost) { g[from].push_back(edge(to, cap, cost, g[to].size())); g[to].push_back(edge(from, 0, -cost, g[from].size() - 1)); } bool dij() { for (int i = 0; i <= t; i++) dist[i] = 1000000000; dist[s] = 0; q[0] = s; inq[s] = 1; int head = 0, tail = 1; while (head != tail) { int now = q[head++]; if (head == 7000 + 1) head = 0; for (int i = 0; i < g[now].size(); i++) { edge &e = g[now][i]; if (e.cap && dist[e.to] > dist[now] + e.cost) { dist[e.to] = dist[now] + e.cost; frome[e.to] = i; fromv[e.to] = now; if (!inq[e.to]) { if (dist[e.to] < dist[q[head]]) { head--; if (head == -1) head = 7000; q[head] = e.to; } else { q[tail++] = e.to; if (tail == 7000 + 1) tail = 0; } } } } inq[now] = 0; } return dist[t] != 1000000000; } int augment() { int c = 1000000000, ret = 0; for (int i = t; i != s; i = fromv[i]) c = min(c, g[fromv[i]][frome[i]].cap); for (int i = t; i != s; i = fromv[i]) { edge &e = g[fromv[i]][frome[i]]; ret += c * e.cost; e.cap -= c; g[e.to][e.rev].cap += c; } return ret; } int mcf() { int ans = 0; while (dij()) ans += augment(); return ans; } }; // namespace mincostflow int a[100][100]; int id[100][100]; int n, m, cnt; int main() { using namespace mincostflow; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); id[i][j] = ++cnt; } } s = ++cnt; t = ++cnt; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if ((i + j) & 1) add_edge(s, id[i][j], 1, 0); else add_edge(id[i][j], t, 1, 0); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if ((i + j) % 2 == 0) continue; if (id[i][j - 1]) add_edge(id[i][j], id[i][j - 1], 1, (a[i][j] != a[i][j - 1])); if (id[i][j + 1]) add_edge(id[i][j], id[i][j + 1], 1, (a[i][j] != a[i][j + 1])); if (id[i - 1][j]) add_edge(id[i][j], id[i - 1][j], 1, (a[i][j] != a[i - 1][j])); if (id[i + 1][j]) add_edge(id[i][j], id[i + 1][j], 1, (a[i][j] != a[i + 1][j])); } } printf( %d n , mcf()); return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> lc, rc, pr; set<int> nodes; set<int>::iterator it; vector<int> v; int main() { int n; cin >> n; int root; cin >> root; nodes.insert(root); for (int i = 1; i < n; ++i) { int x; cin >> x; v.push_back(x); it = nodes.upper_bound(x); if (it == nodes.end()) { it--; rc[*it] = x; pr[x] = (*it); } else if (it == nodes.begin()) { lc[*it] = x; pr[x] = (*it); } else { int ul = (*it); it--; int ll = (*it); if (lc[ul]) rc[ll] = x, pr[x] = ll; else lc[ul] = x, pr[x] = ul; } nodes.insert(x); } for (int i = 0; i < v.size(); ++i) { cout << pr[v[i]] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int R[300010 * 2], L[300010 * 2], n, m, sum[300010], sz; struct Fun { int k, b; } f[300010], id[300010 * 20], s[300010]; inline int Read() { char c = getchar(); int num = 0, f = 1; while ( 0 > c || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while ( 0 <= c && c <= 9 ) num = num * 10 + c - 0 , c = getchar(); return (num * f); } inline bool Pd(Fun c, Fun a, Fun b) { return ((long long)(c.b - a.b) * (b.k - c.k) <= (long long)(c.b - b.b) * (a.k - c.k)); } inline void Ins(int rt, Fun x) { id[++sz] = x; if (!R[rt]) L[rt] = sz; R[rt] = sz; while (R[rt] - L[rt] >= 2 && Pd(id[R[rt] - 2], id[R[rt] - 1], id[R[rt]])) { id[R[rt] - 1] = id[R[rt]]; id[R[rt]] = (Fun){0, 0}; sz--; R[rt]--; } } inline void Merge(int rt, int l, int mid, int r) { int i = l, j = mid + 1, k = l - 1; while (i <= mid && j <= r) { if ((f[i].k < f[j].k) || (f[i].k == f[j].k && f[i].b < f[j].b)) s[++k] = f[i], i++; else s[++k] = f[j], j++; } for (; j <= r; j++) s[++k] = f[j]; for (; i <= mid; i++) s[++k] = f[i]; f[l] = s[l]; Ins(rt, f[l]); for (int t = l + 1; t <= r; t++) { f[t] = s[t]; if (f[t].k != f[t - 1].k) Ins(rt, f[t]); } } inline void Build(int rt, int l, int r) { int mid = (l + r) / 2; if (l == r) { Ins(rt, f[l]); return; } Build(rt * 2, l, mid); Build(rt * 2 + 1, mid + 1, r); Merge(rt, l, mid, r); } inline int Cal(int l, int r, int x) { while (r - l > 1) { int mid = (l + r) / 2; if (id[mid].k * x + id[mid].b < id[mid + 1].k * x + id[mid + 1].b) { r = mid; continue; } if (id[mid].k * x + id[mid].b > id[mid + 1].k * x + id[mid + 1].b) { l = mid; continue; } if (id[mid].k * x + id[mid].b < id[mid - 1].k * x + id[mid - 1].b) { l = mid; continue; } if (id[mid].k * x + id[mid].b > id[mid - 1].k * x + id[mid - 1].b) { r = mid; continue; } } return (min(id[l].k * x + id[l].b, id[r].k * x + id[r].b)); } inline int Find(int rt, int l, int r, int a, int b, int p) { int mid = (l + r) / 2; if (l == a && r == b) { if (l <= 115 && 115 <= r) int deb = 0; return (Cal(L[rt], R[rt], p)); } if (b <= mid) return (Find(rt * 2, l, mid, a, b, p)); if (mid < a) return (Find(rt * 2 + 1, mid + 1, r, a, b, p)); if (a <= mid && mid < b) { int L = Find(rt * 2, l, mid, a, mid, p); int R = Find(rt * 2 + 1, mid + 1, r, mid + 1, b, p); return (min(L, R)); } } int main() { n = Read(); for (int i = 1; i <= n; i++) f[i].k = Read(); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + f[i].k, f[i].b = f[i].k * i - sum[i]; Build(1, 1, n); m = Read(); for (int i = 1; i <= m; i++) { int x = Read(), y = Read(); int Min = Find(1, 1, n, y - x + 1, y, x - y); printf( %d n , min(sum[y] - sum[y - x], sum[y] + Min)); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; queue<int> r, d; char c; for (int i = 0; i < n; i++) { cin >> c; if (c == D ) d.push(i); else r.push(i); } while (r.size() != 0 && d.size() != 0) { if (r.front() < d.front()) { d.pop(); r.push(r.front() + n); r.pop(); } else { r.pop(); d.push(d.front() + n); d.pop(); } } if (r.size() == 0) cout << D n ; else cout << R n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool checkmax(T &a, T b) { return a < b ? a = b, true : false; } template <class T> bool checkmin(T &a, T b) { return a > b ? a = b, true : false; } template <class T> void string_reader(string s, vector<T> &vec) { istringstream sin(s); copy(istream_iterator<T>(sin), istream_iterator<T>(), back_inserter(vec)); } const int N = 200; const int K = 7; const int INF = N * N * 10000; const int dx[] = {0, 0, 1, -1}; const int dy[] = {1, -1, 0, 0}; int matrix[N][N]; int dp[N][N][1 << K], inq[N][N][1 << K]; tuple<int, int, int> pre[N][N][1 << K]; tuple<int, int> nodes[K]; int n, m, k; bool is_legal(int x, int y) { return 0 <= x && x < n && 0 <= y && y < m; } char fig[N][N]; void dfs(int x, int y, int s) { fig[x][y] = X ; int tmpx = get<0>(pre[x][y][s]), tmpy = get<1>(pre[x][y][s]), tmps = get<2>(pre[x][y][s]); if (tmpx == -1) return; else if (x == tmpx && y == tmpy) { dfs(x, y, s ^ tmps); dfs(x, y, tmps); } else dfs(tmpx, tmpy, tmps); } void DP() { int als = 1 << k; for (int i = 0; i < int(n); ++i) for (int j = 0; j < int(m); ++j) { fill(dp[i][j], dp[i][j] + als, INF); memset(pre[i][j], -1, sizeof(pre[i][j])); for (int kk = 0; kk < int(als); ++kk) { get<0>(pre[i][j][kk]) = -1; get<1>(pre[i][j][kk]) = -1; get<2>(pre[i][j][kk]) = -1; } } memset(inq, false, sizeof(inq)); queue<tuple<int, int, int> > q; for (int i = 0; i < int(k); ++i) { int x = get<0>(nodes[i]), y = get<1>(nodes[i]); dp[x][y][1 << i] = matrix[x][y]; inq[x][y][1 << i] = true; q.push(tuple<int, int, int>(x, y, 1 << i)); } while (q.empty() == false) { auto now = q.front(); q.pop(); int x = get<0>(now), y = get<1>(now), s = get<2>(now); for (int kk = 0; kk < int(4); ++kk) { int tmpx = x + dx[kk]; int tmpy = y + dy[kk]; if (is_legal(tmpx, tmpy) == false) continue; if (checkmin(dp[tmpx][tmpy][s], dp[x][y][s] + matrix[tmpx][tmpy])) { get<0>(pre[tmpx][tmpy][s]) = x; get<1>(pre[tmpx][tmpy][s]) = y; get<2>(pre[tmpx][tmpy][s]) = s; if (!inq[tmpx][tmpy][s]) { q.push(tuple<int, int, int>(tmpx, tmpy, s)); inq[tmpx][tmpy][s] = 1; } } } for (int kk = 0; kk < int(4); ++kk) { int nxts = (als - 1) ^ s; for (int i = nxts; i != 0; i = (i - 1) & nxts) { if (checkmin(dp[x][y][i | s], dp[x][y][i] + dp[x][y][s] - matrix[x][y])) { get<0>(pre[x][y][s | i]) = x; get<1>(pre[x][y][s | i]) = y; get<2>(pre[x][y][s | i]) = s; if (!inq[x][y][i | s]) { q.push(tuple<int, int, int>(x, y, i | s)); inq[x][y][i | s] = 1; } } } } inq[x][y][s] = false; } int ans = INF; pair<int, int> p; for (int i = 0; i < int(n); ++i) for (int j = 0; j < int(m); ++j) if (checkmin(ans, dp[i][j][als - 1])) p = make_pair(i, j); cout << ans << endl; dfs(p.first, p.second, als - 1); for (int i = 0; i < int(n); ++i) for (int j = 0; j < int(m); ++j) { cout << fig[i][j]; if (j == m - 1) cout << endl; } } int main() { while (cin >> n >> m >> k) { for (int i = 0; i < int(n); ++i) for (int j = 0; j < int(m); ++j) cin >> matrix[i][j]; memset(fig, . , sizeof(fig)); for (int i = 0; i < int(k); ++i) { cin >> get<0>(nodes[i]) >> get<1>(nodes[i]); get<0>(nodes[i])--; get<1>(nodes[i])--; } DP(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int Get() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * f; } const long long mod = 1e9 + 7; const long long Mod = 998244353; int n, m; long long f[2005][15]; struct road { int to, next; } s[2005 << 1]; int h[2005], cnt; void add(int i, int j) { s[++cnt] = (road){j, h[i]}; h[i] = cnt; } vector<int> e[2005]; long long fac[2005], ifac[2005]; long long ksm(long long t, long long x) { long long ans = 1; for (; x; x >>= 1, t = t * t % mod) if (x & 1) ans = ans * t % mod; return ans; } long long Hash[2005]; long long Hash2[2005]; const long long p = 666233, p2 = 134341; unsigned long long p3 = 233333; int size[2005]; bool cmp(int a, int b) { if (size[a] != size[b]) return size[a] < size[b]; if (Hash[a] != Hash[b]) return Hash[a] < Hash[b]; return Hash2[a] < Hash2[b]; } long long t[2005]; vector<int> sn[2005]; int dep[2005], mxdep[2005]; void dfs1(int v, int fr) { size[v] = 1; mxdep[v] = dep[v]; for (int i = 0; i < e[v].size(); i++) { int to = e[v][i]; if (to == fr) continue; sn[v].push_back(to); dep[to] = dep[v] + 1; dfs1(to, v); mxdep[v] = max(mxdep[v], mxdep[to]); size[v] += size[to]; } sort(sn[v].begin(), sn[v].end(), cmp); t[v] = 1; for (int i = 0; i < sn[v].size(); i++) { int j = i; while (j + 1 < sn[v].size() && size[sn[v][i]] == size[sn[v][j + 1]] && Hash[sn[v][i]] == Hash[sn[v][j + 1]] && Hash2[sn[v][j]] == Hash2[sn[v][j + 1]]) j++; t[v] = t[v] * ifac[j - i + 1] % mod; i = j; } Hash2[v] = Hash[v] = ( ; long long now = 1, now2 = 1; for (int i = 0; i < sn[v].size(); i++) { Hash[v] = ((Hash[v] * now % mod) ^ Hash[sn[v][i]]) % mod; Hash2[v] = ((Hash2[v] * now2 % Mod) ^ Hash2[sn[v][i]]) % Mod; now = now * p % mod; now2 = now2 * p2 % Mod; } Hash[v] = (Hash[v] * p + ) ) % mod; Hash2[v] = (Hash2[v] * p + ) ) % Mod; } int st[2005], top; int cal(int v, int u) { if (!top) return 0; static long long ans[1 << 13], g[1 << 13]; int num = sn[u].size(); for (int i = 0; i < 1 << num; i++) ans[i] = 0; ans[0] = 1; for (int i = 1; i <= top; i++) { memcpy(g, ans, sizeof(g)); int now = st[i]; for (int j = 0; j < num; j++) { if (!f[now][sn[u][j]]) continue; int t = 1 << j; for (int sta = 0; sta < 1 << num; sta++) { if (!(sta & t)) g[sta | t] = (g[sta | t] + ans[sta] * f[now][sn[u][j]]) % mod; } } memcpy(ans, g, sizeof(g)); } return ans[(1 << num) - 1] * t[u] % mod; } long long ans; int rt; void solve(int v, int fr) { for (int i = 1; i <= m; i++) if (sn[i].size() == 0) f[v][i] = 1; for (int i = h[v]; i; i = s[i].next) { int to = s[i].to; if (to == fr) continue; solve(to, v); } top = 0; for (int i = h[v]; i; i = s[i].next) { if (s[i].to == fr) continue; st[++top] = s[i].to; } for (int i = 1; i <= m; i++) { if (sn[i].size()) { f[v][i] = cal(v, i); } } (ans += f[v][rt]) %= mod; } map<pair<int, int>, int> vis; int work() { for (int i = 1; i <= m; i++) sn[i].clear(); for (int i = 1; i <= m; i++) Hash[i] = Hash2[i] = 0; dep[rt] = 1; dfs1(rt, 0); if (vis.find(make_pair(Hash[rt], Hash2[rt])) != vis.end()) return 0; vis[make_pair(Hash[rt], Hash2[rt])] = 1; memset(f, 0, sizeof(f)); ans = 0; solve(1, 0); return ans; } int main() { n = Get(); int a, b; for (int i = 1; i < n; i++) { a = Get(), b = Get(); add(a, b), add(b, a); } m = Get(); fac[0] = 1; for (int i = 1; i <= m; i++) fac[i] = fac[i - 1] * i % mod; ifac[m] = ksm(fac[m], mod - 2); for (int i = m - 1; i >= 0; i--) ifac[i] = ifac[i + 1] * (i + 1) % mod; for (int i = 1; i < m; i++) { a = Get(), b = Get(); e[a].push_back(b); e[b].push_back(a); } long long tot = 0; for (rt = m; rt >= 1; rt--) (tot += work()) %= mod; cout << tot << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 310; int l[maxn], c[maxn]; int n; int f[1 << 9]; int g[maxn][10], cnt[maxn]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> l[i]; for (int i = 1; i <= n; i++) cin >> c[i]; for (int i = 1; i <= n; i++) { int x = l[i]; for (int j = 2; j * j <= x; j++) { if (x % j == 0) { g[i][++cnt[i]] = j; while (x % j == 0) x /= j; } } if (x > 1) { g[i][++cnt[i]] = x; } } int ans = 1e9 + 10; for (int i = 1; i <= n; i++) { memset(f, 0x3f, sizeof f); int tot = (1 << cnt[i]) - 1; f[tot] = c[i]; for (int j = 1; j <= n; j++) { if (i == j) continue; int s = 0; for (int k = 1; k <= cnt[i]; k++) { int flag = 0; for (int x = 1; x <= cnt[j]; x++) { if (g[i][k] == g[j][x]) { flag = 1; break; } } if (flag) s |= (1 << (k - 1)); } for (int k = 0; k <= tot; k++) f[k & s] = min(f[k & s], f[k] + c[j]); } ans = min(ans, f[0]); } if (ans == 1e9 + 10) cout << -1; else cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 * 3 + 10; int n, k, m; vector<int> graph[2][MAXN]; int p[2][MAXN]; int sum; void read_input() { scanf( %d , &n); scanf( %d , &k); int v; for (int i = 0; i < k - 1; i++) { sum++; scanf( %d , &v); graph[0][n + i + 2].push_back(v + n); graph[0][v + n].push_back(n + i + 2); p[0][n + i + 2] = v + n; } for (int i = 0; i < n; i++) { scanf( %d , &v); graph[0][i + 1].push_back(v + n); graph[0][v + n].push_back(i + 1); p[0][i + 1] = n + v; } scanf( %d , &m); for (int i = 0; i < m - 1; i++) { sum++; scanf( %d , &v); graph[1][n + i + 2].push_back(v + n); graph[1][v + n].push_back(n + i + 2); p[1][n + i + 2] = v + n; } for (int i = 0; i < n; i++) { scanf( %d , &v); graph[1][i + 1].push_back(v + n); graph[1][v + n].push_back(i + 1); p[1][i + 1] = n + v; } } int timer; int in[2][MAXN], out[2][MAXN]; int depth[2][MAXN]; void dfs(int v, int p, int r, int dt = 0) { in[r][v] = timer++; depth[r][v] = dt; for (auto x : graph[r][v]) { if (in[r][x] == 0 && x != p) { dfs(x, v, r, dt + 1); } } out[r][v] = timer++; } int lca[2][MAXN][MAXN]; const int INF = 1e9; int _abs(int f) { if (f < 0) return -f; return f; } int T[MAXN][MAXN]; int rec(int l, int r) { int temp = max(l, r) + 1; if (temp > n) return 0; if (T[l][r]) return T[l][r]; int ans = INF; int add = 0; if (l != 0) { int LCA = lca[0][l][temp]; add = _abs(depth[0][LCA] - depth[0][temp]) - 1; ans = min(ans, rec(temp, r) + add); } else { ans = rec(temp, r) + depth[0][temp] - 1; } if (r != 0) { int LCA = lca[1][r][temp]; add = _abs(depth[1][LCA] - depth[1][temp]) - 1; ans = min(ans, rec(l, temp) + add); } else { ans = min(ans, rec(l, temp) + depth[1][temp] - 1); } return T[l][r] = ans; } void solve() { timer = 1; dfs(n + 1, n + 1, 0); for (int i = 0; i < n; i++) { int temp = i + 1; int LCA = temp; for (int j = i + 1; j < n; j++) { int tr = j + 1; while (in[0][tr] > out[0][LCA] || out[0][tr] < in[0][LCA]) LCA = p[0][LCA]; lca[0][temp][tr] = lca[0][tr][temp] = LCA; } } timer = 1; dfs(n + 1, n + 1, 1); for (int i = 0; i < n; i++) { int temp = i + 1; int LCA = temp; for (int j = i + 1; j < n; j++) { int tr = j + 1; while (in[1][tr] > out[1][LCA] || out[1][tr] < in[1][LCA]) LCA = p[1][LCA]; lca[1][temp][tr] = lca[1][tr][temp] = LCA; } } printf( %d n , sum - rec(0, 0)); } int main() { read_input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; if (n > 1) sort(a, a + n); int cont = 0; if (k == n) { cout << a[k - 1] << n ; } else if (k == 0) { if (a[0] - 1 >= 1) cout << a[0] - 1 << endl; else puts( -1 ); } else { k--; if (a[k] == a[k + 1]) cout << -1 << endl; else cout << a[k] << endl; } } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; long long v[N]; signed main() { long long n; cin >> n; long long p = 2 * n; long long x = p * (p + 1); if (x % 4 == 0) cout << NO n ; else { cout << YES n ; for (long long i = 1; i <= 2 * n; i++) v[i] = i; for (long long i = 1; i <= n; i++) { if (i & 1) { cout << 2 * i - 1 << ; v[2 * i - 1] = 0; } else { cout << 2 * i << ; v[2 * i] = 0; } } for (long long i = 1; i <= 2 * n; i++) if (v[i] != 0) cout << v[i] << ; } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16000000 ) using namespace std; const int Maxn = 505; const int Maxk = 11; const int Maxd = 10; const int Inf = 1000000000; int n, k; string s; int w; struct trie { trie *ch[Maxd]; int cnt; trie() { for (int i = 0; i < Maxd; i++) ch[i] = nullptr; cnt = 0; } }; trie *tr; void Add(trie *tr, int lvl, const string &s, int add) { if (lvl >= s.length()) { tr->cnt += add; return; } int dig = s[lvl] - 0 ; if (!tr->ch[dig]) tr->ch[dig] = new trie(); Add(tr->ch[dig], lvl + 1, s, add); } void Solve(trie *tr, int lvl, int dp[][Maxk]) { for (int i = 0; i <= lvl; i++) { for (int j = 0; j <= k; j++) dp[i][j] = Inf; dp[i][0] = (lvl - i) * tr->cnt; } int my[Maxk]; for (int j = 0; j <= k; j++) my[j] = Inf; my[1] = 0; int oth[Maxn][Maxk]; for (int i = 0; i < Maxd; i++) if (tr->ch[i]) { Solve(tr->ch[i], lvl + 1, oth); for (int l = 0; l <= lvl; l++) for (int j = k; j >= 0; j--) { int ways = dp[l][j]; dp[l][j] = Inf; for (int z = 0; j + z <= k; z++) dp[l][j + z] = min(dp[l][j + z], ways + oth[l][z]); } for (int j = k; j > 0; j--) { int ways = my[j]; my[j] = Inf; for (int z = 0; j + z <= k; z++) my[j + z] = min(my[j + z], ways + oth[lvl][z]); } } for (int i = 0; i <= lvl; i++) for (int j = 0; j <= k; j++) dp[i][j] = min(dp[i][j], my[j]); } int main() { tr = new trie(); cin >> n >> k; for (int i = 0; i < n; i++) { cin >> s >> w; Add(tr, 0, s, w); } int dp[Maxn][Maxk]; Solve(tr, 0, dp); int res = Inf; for (int j = 0; j <= k; j++) res = min(res, dp[0][j]); printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, w, r, k, i, j, s, q, x, y, l, a[22000]; int main() { ios_base::sync_with_stdio(0); cin >> n; for (i = 1; i <= n; i++) { cin >> a[i], s += a[i]; if (a[i] < 0) k = 1; } if (k == 0) { cout << s; return 0; } for (l = 2; l <= n; l++) if (n % l == 0 && n / l >= 3) for (j = 1; j <= l; j++) { m = 0; for (i = j; i <= n; i += l) m += a[i]; s = max(s, m); } cout << s; } |
#include<bits/stdc++.h> using namespace std; int main() { long long t,n,x; cin>>t; while(t--) { cin>>n>>x; long long a[n+1],m=30,j,s=0,k,c; for (long long i = 0; i < n; ++i) { cin>>a[i]; k=a[i]; c=0; while(k%x==0) { k/=x; c++; } if (m>c) m=c,j=i; } //cout<<m<< <<j<<endl; for (long long i = 0; i < n; ++i) { s+=(m+1)*a[i]; } for (long long i = 0; i < j; ++i) { s+=a[i]; } cout<<s<<endl; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2005; int n, m, k, l[MAXN][MAXN], r[MAXN][MAXN]; char S[MAXN]; int a[MAXN][MAXN], dp[MAXN][MAXN], x[MAXN], y[MAXN], ans[MAXN]; void clr(int i) { for (int j = 1; j <= m; ++j) l[i][j] = a[i][j] ? 0 : l[i][j - 1] + 1; for (int j = m; j >= 1; --j) r[i][j] = a[i][j] ? 0 : r[i][j + 1] + 1; } int solve() { int re = 0; for (int i = 1; i <= n; ++i) clr(i); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (!a[i][j]) { dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1; re = max(re, dp[i][j]); } return re; } int v[2][MAXN], q[2][MAXN], s[2], t[2]; inline void del(int p) { while (s[0] < t[0] && q[0][s[0]] <= p) ++s[0]; while (s[1] < t[1] && q[1][s[1]] <= p) ++s[1]; } inline void ins(int i) { while (s[0] < t[0] && v[0][q[0][t[0] - 1]] >= v[0][i]) --t[0]; q[0][t[0]++] = i; while (s[1] < t[1] && v[1][q[1][t[1] - 1]] >= v[1][i]) --t[1]; q[1][t[1]++] = i; } bool calc(int j, int len) { for (int i = 1; i <= n; ++i) v[0][i] = l[i][j], v[1][i] = r[i][j]; s[0] = s[1] = t[0] = t[1] = 0; q[0][0] = q[1][0] = 0; for (int i = 1, p = 0; i <= n; ++i) { while (i - p >= len) del(p++); ins(i); if (i >= len && v[0][q[0][s[0]]] + v[1][q[1][s[1]]] - 1 >= len) return 1; } return 0; } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; ++i) { scanf( %s , S + 1); for (int j = 1; j <= m; ++j) a[i][j] = S[j] == X ; } for (int i = 1; i <= k; ++i) scanf( %d%d , &x[i], &y[i]), a[x[i]][y[i]] = 1; ans[k] = solve(); for (int i = k; i > 1; --i) { a[x[i]][y[i]] = 0; clr(x[i]); for (ans[i - 1] = ans[i]; calc(y[i], ans[i - 1] + 1); ++ans[i - 1]) ; } for (int i = 1; i <= k; ++i) printf( %d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; void setIO(string name = ) { ios_base::sync_with_stdio(0); cin.tie(0); if (!name.empty()) { freopen((name + .in ).c_str(), r , stdin); freopen((name + .out ).c_str(), w , stdout); } } long long calc(long long a, long long b) { return (a + a * b) * b / 2; } int main() { setIO(); long long a, b; cin >> a >> b; if (b == 1) { cout << a; return 0; } long long cur; if (b % 2) cur = (b + 1) / 2 * b; else cur = b / 2 * (b + 1); if (a <= b || a < cur || b >= 400000) { cout << -1; return 0; } vector<long long> divs; for (long long i = 1; i * i <= a; i++) { if (a % i == 0) { if (i == a / i) divs.push_back(i); else { divs.push_back(i); divs.push_back(a / i); } } } sort(divs.begin(), divs.end()); for (int i = (int)divs.size() - 1; i >= 0; i--) { if (calc(divs[i], b) <= a && (calc(divs[i], b) % divs[i] == 0)) { long long cur = divs[i]; for (int j = 1; j <= b; j++) { if (j != b) { cout << cur * j << ; a -= cur * j; } else { cout << a; return 0; } } } } cout << -1; } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 2; signed main() { ios::sync_with_stdio(false); cin.tie(0); srand(time(NULL)); int N; long long sa = 0, sb = 0; cin >> N; vector<int> A(N), B(N), ind(N); iota(ind.begin(), ind.end(), 0); for (int i = 0; i < N; ++i) { cin >> A[i]; sa += A[i]; } for (int i = 0; i < N; ++i) { cin >> B[i]; sb += B[i]; } int ok = (N >> 1) + 1; while (1) { mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count()); long long x = 0, y = 0; random_shuffle(ind.begin(), ind.end()); for (int i = 0; i < ok; ++i) { x += A[ind[i]]; y += B[ind[i]]; } if (x << 1LL > sa && y << 1LL > sb) { cout << ok << n ; for (int i = 0; i < ok; ++i) { cout << ind[i] + 1 << ; } exit(0); } } return 0; } |
#include <bits/stdc++.h> using namespace std; bool lucky(int n) { n = abs(n); if (n == 8) return true; while (n) { int x = n % 10; if (x == 8) return true; n /= 10; } return false; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= 100; i++) { int x = n + i; if (lucky(x)) { printf( %d n , i); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; 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; } const int N = 2e5 + 10; int a[N]; map<int, long long> mp; signed main() { int _; read(_); while (_--) { mp.clear(); int n; read(n); long long s = 0, ans = 0; for (int i = (1); i <= (n); i++) read(a[i]), s += a[i], mp[a[i]]++; if (s * 2 % n != 0) { puts( 0 ); continue; } long long mid = s * 2 / n; for (int i = (1); i <= (n); i++) if (a[i] < mid - a[i]) ans += mp[mid - a[i]]; if (mid % 2 == 0) ans += mp[mid / 2] * (mp[mid / 2] - 1) / 2; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int p[2005], c[2005]; int n, root = -1; vector<int> v[2005]; int d[2005], vis[2005]; int ans[2005]; struct cmp { bool operator()(int x, int y) { return d[x] > d[y]; } }; priority_queue<int, vector<int>, cmp> q; void dfs(int x) { if (c[x] == 0) q.push(x); for (auto y : v[x]) { if (vis[y]) continue; vis[y] = 1; d[y] = d[x] + 1; dfs(y); } } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> p[i] >> c[i]; if (!p[i]) { root = i; continue; } v[i].push_back(p[i]); v[p[i]].push_back(i); } vis[root] = 1; dfs(root); bool flag = true; int count = 1; while (!q.empty()) { int _top = q.top(); q.pop(); ans[_top] = count++; int head = p[_top]; while (head) { c[head]--; if (c[head] == 0) q.push(head); head = p[head]; } } for (int i = 1; i <= n; i++) { if (c[i] > 0) { flag = false; break; } } if (flag) { cout << YES << endl; for (int i = 1; i <= n; i++) cout << ans[i] << ; cout << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; vector<pair<int, int> > g; cin >> n; for (int i = 0; i < n; i++) { cin >> a >> b; g.push_back(make_pair(a, b)); } sort(g.begin(), g.end()); int mx = 0, ans = 0; for (int i = 0; i < n; i++) { if (g[i].second < mx) ans++; mx = max(mx, g[i].second); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int spf[15000005], ans[15000002]; void sieve() { spf[1] = 1; for (int i = 2; i < 15000002; i++) spf[i] = i; for (int i = 4; i < 15000002; i += 2) spf[i] = 2; for (int i = 3; i * i < 15000002; i++) { if (spf[i] == i) { for (int j = i * i; j < 15000002; j += i) if (spf[j] == j) spf[j] = i; } } } int main() { int i, n, ans1 = 1, k = 0; scanf( %d , &n); int a[300005]; sieve(); for (i = 1; i <= n; i++) scanf( %d , &a[i]); ans1 = a[1]; for (i = 1; i <= n; i++) ans1 = gcd(ans1, a[i]); for (i = 1; i <= n; i++) a[i] = (a[i] / ans1); for (i = 1; i <= n; i++) { int x = a[i]; set<int> q; while (x != 1) { q.insert(spf[x]); x = x / spf[x]; } set<int>::iterator it1; for (it1 = q.begin(); it1 != q.end(); ++it1) ans[*it1]++; } int p = 0; for (i = 1; i <= 15000000; i++) p = max(p, ans[i]); if (p == 0) printf( -1 n ); else printf( %d n , n - p); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string name; ostringstream convert; for (int i = 1; i <= n; i++) { convert << i; name = convert.str(); } cout << name[n - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; int fx[] = {1, 0, 0, -1}; int fy[] = {0, -1, 1, 0}; int n, m; int data[1002][1002], dist[1002][1002]; void bfs(int sx, int sy) { for (int i = 0; i < 1002; i++) { for (int j = 0; j < 1002; j++) dist[i][j] = INT_MAX; } queue<int> q; q.push(sx); q.push(sy); dist[sx][sy] = 0; while (!q.empty()) { int u = q.front(); q.pop(); int v = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int x = u + fx[i]; int y = v + fy[i]; if (x >= 0 && x < n && y >= 0 && y < m && data[x][y] == 0 && dist[x][y] > dist[u][v] + 1) { dist[x][y] = dist[u][v] + 1; q.push(x); q.push(y); } } } } int main() { int k; scanf( %d , &n); scanf( %d , &m); scanf( %d , &k); int sx, sy; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { char ch; cin >> ch; if (ch == * ) data[i][j] = 1; else if (ch == X ) { sx = i; sy = j; } } } if (k % 2 != 0) { cout << IMPOSSIBLE n ; return 0; } bfs(sx, sy); vector<char> res; while (k > 0) { if (sx < n - 1 && dist[sx + 1][sy] < k) { sx++; res.push_back( D ); } else if (sy > 0 && dist[sx][sy - 1] < k) { sy--; res.push_back( L ); } else if (sy < m - 1 && dist[sx][sy + 1] < k) { sy++; res.push_back( R ); } else if (sx > 0 && dist[sx - 1][sy] < k) { sx--; res.push_back( U ); } else { cout << IMPOSSIBLE n ; return 0; } k--; } for (int i = 0; i < res.size(); i++) { cout << res[i]; } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxN = 210; int n, a[mxN], pos[mxN][3]; int next(int i) { if (pos[a[i]][0] == i) return pos[a[i]][1]; return pos[a[i]][0]; } void upd(int u, int v) { if (pos[a[u]][0] == u) pos[a[u]][0] = v; else pos[a[u]][1] = v; } bool gd() { for (int i = 1; i < 2 * n; i += 2) { if (a[i] != a[i - 1]) return false; } return true; } void prnt() { cout << Array << endl; for (int i = 0; i < 2 * n; i++) { cout << a[i] << ; } cout << endl << endl; } int main() { memset(pos, -1, sizeof pos); cin >> n; for (int i = 0; i < 2 * n; i++) { cin >> a[i]; if (pos[a[i]][0] == -1) pos[a[i]][0] = i; else pos[a[i]][1] = i; } int cnt = 0; while (!gd()) { for (int i = 0; i < 2 * n; i++) { if (i + 1 < 2 * n && a[i] == a[i + 1]) continue; if (i && a[i] == a[i - 1]) continue; if (i + 1 < 2 * n && next(i) > i && next(i + 1) < next(i)) { upd(i, i + 1); upd(i + 1, i); swap(a[i], a[i + 1]); cnt++; } else if (i && next(i) < i && next(i - 1) > next(i)) { upd(i, i - 1); upd(i - 1, i); swap(a[i], a[i - 1]); cnt++; } } } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int f[256], b[8]; vector<pair<int, int>> a; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) { int l, r; scanf( %d%d , &l, &r); a.push_back({l, i}); a.push_back({r + 1, -i}); } sort(a.begin(), a.end()); for (int i = 0; i < 2 * n; i++) { if (i > 0) { int ms = 0; for (int p = 0; p < 8; p++) { if (b[p]) ms += 1 << p; } for (int s = 0; s < (1 << k); s++) { int cnt = __builtin_popcount(s & ms); if (cnt & 1) f[s] += a[i].first - a[i - 1].first; } } int j = i; while (j < 2 * n && a[j].first == a[i].first) { int y = a[j].second; if (y < 0) { y = -y; for (int p = 0; p < 8; p++) { if (b[p] == y) { for (int s = 0; s < (1 << k); s++) f[s] = max(f[s], f[s ^ (1 << p)]); b[p] = 0; break; } } } else { for (int p = 0; p < 8; p++) { if (b[p] == 0) { b[p] = y; break; } } } j++; } i = j - 1; } int ans = 0; for (int i = 0; i < (1 << k); i++) ans = max(ans, f[i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int N = 3e5 + 100; int a[N], n; long long ans; void update(int i, int c) { if (i <= 0 || i > n) return; if (a[i] > a[i - 1] && a[i] > a[i + 1]) ans += a[i] * c; if (a[i] < a[i - 1] && a[i] < a[i + 1]) ans -= a[i] * c; } int main() { int w; cin >> w; while (w--) { int q; scanf( %d%d , &n, &q); a[0] = a[n + 1] = 0; for (int i = 1; i <= n; i++) scanf( %d , a + i); ans = 0; for (int i = 1; i <= n; i++) update(i, 1); printf( %lld n , ans); while (q--) { int l, r; scanf( %d%d , &l, &r); set<int> st; for (int i = -1; i <= 1; i++) { st.insert(l + i); st.insert(r + i); } for (int i : st) update(i, -1); swap(a[l], a[r]); for (int i : st) update(i, 1); printf( %lld n , ans); } } return 0; } |
#include <bits/stdc++.h> int main() { int n, i, sum = 0; char str[51]; scanf( %s , &str); n = strlen(str); for (i = 0; i < n; i = i + 1) { if (str[i] == a ) { sum++; } } if (sum > n / 2) { printf( %d n , n); } else { printf( %d n , 2 * sum - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k; vector<long long int> v; cin >> n >> k; long long int r; for (long long int i = 0; i < n; i++) { long long int a; cin >> a; v.push_back(a); } r = v[0] % k; long long int mn = 10000000000000; for (long long int i = 0; i < n; i++) { if (v[i] % k != r) { cout << -1 n ; return 0; } mn = min(mn, v[i]); } long long int count = 0; for (int i = 0; i < n; i++) { count += (v[i] - mn) / k; } cout << count << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> string NumberToString(T Number) { std::ostringstream second; second << Number; return second.str(); } long long qpow(long long p, long long q) { long long f = 1; while (q) { if (q & 1) f = f * p % 1000000007LL; p = p * p % 1000000007LL; q >>= 1; } return f; } inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } const long long mod7 = 998244353LL; inline long long add(long long _x, long long _y, long long _mod = mod7) { _x += _y; return _x >= _mod ? _x - _mod : _x; } inline long long sub(long long _x, long long _y, long long _mod = mod7) { _x -= _y; return _x < 0 ? _x + _mod : _x; } inline long long mul(long long _x, long long _y, long long _mod = mod7) { _x *= _y; return _x >= _mod ? _x % _mod : _x; } int const N = 553; long long t[N][N], cum[N][N]; int main() { for (auto ik = 0; ik < (501); ++ik) cum[0][ik] = 1LL; for (int in = 1; in <= 500; ++in) { for (int ik = 1; ik <= in; ++ik) { for (int before = 0; (in - ik - before) >= 0; ++before) { t[in][ik] = add(t[in][ik], mul(cum[before][min(before, ik - 1)], cum[(in - ik - before)][min((in - ik - before), ik)])); } cum[in][ik] = add(cum[in][ik - 1], t[in][ik]); } } int n, k; cin >> n >> k; long long sol = 0LL; for (int a = 1; a < min(k, n + 1); ++a) { if (k % a == 0) sol = add(sol, mul(t[n][a], cum[n][min(n, (k - 1) / a)])); else sol = add(sol, mul(t[n][a], cum[n][min(n, k / a)])); } cout << mul(sol, 2LL); return 0; } |
#include <bits/stdc++.h> using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } template <typename T> string to_str(T str) { stringstream stream; stream << str; return stream.str(); } template <typename T> int to_int(T num) { int val; stringstream stream; stream << num; stream >> val; return val; } vector<string> split(const string& s, char delim) { vector<string> elems; stringstream ss(s); string item; while (getline(ss, item, delim)) elems.push_back(item); return elems; } const int dr[] = {-1, -1, 0, 1, 1, 1, 0, -1}; const int dc[] = {0, 1, 1, 1, 0, -1, -1, -1}; const int T2 = 105; const int T3 = 1005; const int T4 = 10005; const int T5 = 100005; int a[T3], b[T3]; const int M = 475; bool check(int s, int p) { int i = (s / 50) % M; int loop = 25; while (loop--) { i = (i * 96 + 42) % M; if (26 + i == p) { return true; } } return false; } int main() { ios_base::sync_with_stdio(0); int p, x, y; cin >> p >> x >> y; int s = x; bool f = 0; while (s >= y) { if (check(s, p)) { f = 1; break; } s -= 50; } if (!f) { s = x; while (1) { if (check(s, p)) { f = 1; break; } s += 50; } } int diff = s - x; if (diff < 0) cout << 0 n ; else cout << ceil(diff * 1.0 / 100) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long double esp = 1e-11; const long double PI = acos(-1.0); const long long int INF = 0x3f3f3f3f; const long long int MOD = 1000000007; const int maxn = 10010; const int NUM = 25; long long int wn[NUM]; long long int mu(long long int a, long long int b, long long int P) { long long int ans = 1; a %= P; while (b) { if (b & 1) ans = ans * a % P; a = a * a % P; b >>= 1; } return ans; } void GetWn(long long int G, long long int P) { long long int t; for (int i = 0; i < NUM; i++) { t = 1ll << i; wn[i] = mu(G, (P - 1) / t, P); } } void Rader(long long int a[], int len) { int j = len >> 1, k; for (int i = 1; i < len - 1; i++) { if (i < j) swap(a[i], a[j]); k = len >> 1; while (j >= k) { j -= k; k >>= 1; } if (j < k) j += k; } } void NTT(long long int a[], int len, int on, long long int P) { Rader(a, len); long long int id = 0, w, u, t; for (int h = 2; h <= len; h <<= 1) { id++; for (int j = 0; j < len; j += h) { w = 1; for (int k = j; k < j + h / 2; k++) { u = a[k] % P; t = w * a[k + h / 2] % P; a[k] = (u + t) % P; a[k + h / 2] = (u - t + P) % P; w = w * wn[id] % P; } } } if (on == -1) { for (int i = 1; i < len / 2; i++) swap(a[i], a[len - i]); long long int inv = mu(len, P - 2, P); for (int i = 0; i < len; i++) a[i] = a[i] * inv % P; } } long long int a[1ll << 20]; int main() { int n, k, tem; scanf( %d%d , &n, &k); memset(a, 0, sizeof(a)); for (int x = 1; x <= n; x++) { scanf( %d , &tem); a[tem] = 1; } long long int N = 1ll << 20, G = 3, P = 469762049ll; GetWn(G, P); NTT(a, N, 1, P); for (int i = 0; i < N; i++) a[i] = mu(a[i], k, P); NTT(a, N, -1, P); for (int i = 0; i < N; i++) if (a[i]) printf( %d , i); return 0; } |
#include <bits/stdc++.h> int res[1000008]; using namespace std; int main() { bool pr[1000008 + 1]; memset(pr, true, sizeof(pr)); int cnt = 0; for (int p = 2; p * p <= 1000008; p++) { if (pr[p] == true) { for (int j = p * p; j <= 1000008; j += p) pr[j] = false; } } for (int i = 2; i <= 1000008; i++) { if (pr[i]) { cnt++; } res[i] = cnt; } ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int k = sqrt(n); int r = res[n] - res[k]; cout << r + 1 << n ; } } |
#include <bits/stdc++.h> using namespace std; long long ans[1000005]; long long n; struct cht { vector<pair<long long, long long> > v; long long pt = 0; long long val(long long pos, long long x) { return v[pos].first * x + v[pos].second; } bool lmao(pair<long long, long long> p0, pair<long long, long long> p1, pair<long long, long long> p2) { double lel = 1.0 * (p1.second - p0.second) * (p1.first - p2.first) - 1.0 * (p2.second - p1.second) * (p0.first - p1.first) >= 1e-7; if (lel > 0) return true; return false; } void add(long long first, long long second) { for (pair<long long, long long> hic = {first, second}; v.size() > 1 && lmao(hic, v[v.size() - 1], v[v.size() - 2]); v.pop_back()) ; v.push_back({first, second}); } long long get(long long x) { for (pt = min(pt, (long long)v.size() - 1); pt + 1 < (long long)v.size() && val(pt, x) < val(pt + 1, x); pt++) ; return val(pt, x); } } C; pair<long long, pair<long long, long long> > first[1000005]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; C.add(0, 0); for (long long i = 1; i <= n; i++) { cin >> first[i].first >> first[i].second.first >> first[i].second.second; } sort(first + 1, first + n + 1); long long hihi = -1000000000000000000; for (long long i = 1; i <= n; i++) { ans[i] = C.get(first[i].second.first) - first[i].second.second + first[i].first * first[i].second.first; C.add(-first[i].first, ans[i]); hihi = max(hihi, ans[i]); } cout << hihi; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using ii = pair<int, int>; using pli = pair<ll, int>; using vi = vector<int>; using vll = vector<ll>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using vvi = vector<vi>; using vpi = vector<ii>; const int N = 100100; ll mod = 1000000007; vvi adj; vi p, h; int n, m; vi vis; ii solve(int i) { int tot_people = p[i]; int good = 0; vis[i] = true; for (auto x : adj[i]) { if (vis[x]) continue; auto temp = solve(x); if (temp.first == -1) { return temp; } tot_people += temp.first; good += temp.second; } int good_calculated = (tot_people + h[i]) / 2; if (good_calculated > tot_people || (tot_people + h[i]) % 2 || good > good_calculated) { return make_pair(-1, -1); } else { return make_pair(tot_people, good_calculated); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tt; cin >> tt; while (tt--) { int n, m; cin >> n >> m; adj.resize(n); for (int i = 0; i <= n - 1; i++) adj[i].clear(); p.clear(); p.resize(n); vis.clear(); vis.resize(n); for (int i = 0; i <= n - 1; i++) cin >> p[i]; assert(accumulate(p.begin(), p.end(), 0) == m); h.resize(n); for (int i = 0; i <= n - 1; i++) { cin >> h[i]; } for (int i = 0; i <= n - 2; i++) { int x, y; cin >> x >> y; x--, y--; adj[x].push_back(y); adj[y].push_back(x); } auto ans = solve(0); if (ans.first != -1) { cout << YES << n ; } else { cout << NO << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int N = 1e6 + 5; int a[N], m[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, b; cin >> n >> b; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = n; i >= 0; --i) m[i] = max(m[i + 1], a[i]); int ans = b; for (int i = 1; i <= n; ++i) { ans = max(ans, b % a[i] + b / a[i] * m[i + 1]); } cout << (n == 1 ? b : ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1005]; int main() { int n, maxp, mx2p; scanf( %d , &n); for (register int i = 1; i <= n; ++i) { scanf( %d , a + i); } if (a[1] > a[2]) { maxp = 1; mx2p = 2; } else { maxp = 2; mx2p = 1; } for (register int i = 3; i <= n; ++i) { if (a[i] > a[maxp]) { mx2p = maxp; maxp = i; } else if (a[i] > a[mx2p]) { mx2p = i; } } printf( %d %d , maxp, a[mx2p]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 2) { cout << white n1 2 n ; } else if (n % 2 == 0) { cout << white n1 2 n ; } else { cout << black n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int l, r; cin >> l >> r; cout << l << << l * 2 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long add(long long x, long long y) { x += y; if (x >= 1000000007) x -= 1000000007; return x; } inline long long sub(long long x, long long y) { x -= y; if (x < 0) x += 1000000007; return x; } inline long long mul(long long x, long long y) { return ((x % 1000000007) * (y % 1000000007)) % 1000000007; } inline long long pwr(long long a, long long b) { long long x = 1LL; while (b) { if (b & 1) x = mul(x, a); a = mul(a, a); b >>= 1; } return x; } bool CHK(long long n) { if (n == 1) return 0; if (n == 2 or n == 3) return 1; if (n % 2 == 0 or n % 3 == 0) return 0; for (long long i = 5; i * i <= n; i += 6) if (n % i == 0 or n % (i + 2) == 0) return 0; return 1; } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); long long n = 0; cin >> n; string s; cin >> s; long long cnt = 0; for (long long i = 0; i < n - 1; i++) { if (s[i] == * ) continue; if (s[i] == s[i + 1]) cnt++, s[i + 1] = * ; } cout << cnt << n ; for (long long i = 0; i < n; i++) { if (s[i] == * and i != n - 1) { if (s[i - 1] == R and s[i + 1] == G ) s[i] = B ; else if (s[i - 1] == G and s[i + 1] == B ) s[i] = R ; else if (s[i - 1] == R and s[i + 1] == B ) s[i] = G ; else if (s[i - 1] == R and s[i + 1] == R ) s[i] = G ; else if (s[i - 1] == B and s[i + 1] == B ) s[i] = G ; else if (s[i - 1] == G and s[i + 1] == G ) s[i] = R ; else if (s[i - 1] == G and s[i + 1] == R ) s[i] = B ; else if (s[i - 1] == B and s[i + 1] == G ) s[i] = R ; else if (s[i - 1] == B and s[i + 1] == R ) s[i] = G ; } else if (s[i] == * and i == n - 1) { if (s[i - 1] == R ) s[i] = G ; else if (s[i - 1] == B ) s[i] = G ; else if (s[i - 1] == G ) s[i] = B ; } } for (auto u : s) cout << u; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5; set<int> v[MAXN]; int last = -1, lastx = -1; vector<int> f; int ans = 0; int t[MAXN], x_[MAXN]; bool find(vector<int> &d, int k) { if (d.empty()) return false; int l = 0, r = int(d.size()); while (r - l > 1) { int m = (l + r) / 2; if (d[m] <= k) l = m; else r = m; } return d[l] == k; } int main() { ios_base::sync_with_stdio(false); int n, q; cin >> n >> q; for (int i = 0; i < q; i++) { int type, x; cin >> type >> x; x--; t[i] = type, x_[i] = x; if (type == 1) { v[x].insert(i); f.push_back(i); ans++; } else if (type == 2) { ans -= (int)v[x].size(); v[x].clear(); } else if (type == 3) if (last < f[x]) { for (int j = lastx + 1; j <= x; j++) { int id = f[j]; if (v[x_[id]].find(id) != v[x_[id]].end()) v[x_[id]].erase(id), ans--; } last = f[x], lastx = x; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, t1, t2, t3, t4, t5, dif, yes, rep, cnt[1005], last[1005], ans[1005][1005], ma[1005][1005]; vector<int> nod, re, v[1005]; vector<pair<int, int> > path, more; vector<pair<pair<int, int>, int> > sol; bool vis[1005]; pair<int, int> pl, pr; bool ok; void clr() { for (int i = 1; i <= n; i++) vis[i] = 0; return; } int any(int mo) { vis[mo] = 1; if (v[mo].size() == 1) return mo; else { for (int i = 0; i < v[mo].size(); i++) { if (!vis[v[mo][i]]) { return any(v[mo][i]); } } } } pair<int, int> exp(int mo) { clr(); vis[t4] = 1, vis[t5] = 1; vector<int> ret; for (int i = 0; i < v[mo].size(); i++) { if (v[mo][i] != t4 && v[mo][i] != t5) { ret.push_back(any(v[mo][i])); if (ret.size() > 1) { return make_pair(ret[0], ret[1]); } } } } void dfs(int from, int to, int val) { ok = 0; vis[from] = 1; if (from == to) { ok = 1, yes = from; return; } for (int i = 0; i < v[from].size(); i++) { if (!vis[v[from][i]] && !ok) { dfs(v[from][i], to, val); } } if (ok) { ma[from][yes] += val; ma[yes][from] += val; yes = from; return; } } int main() { cin >> n; for (int i = 0; i < n - 1; i++) { cin >> t1 >> t2 >> t3; path.push_back(make_pair(t1, t2)); cnt[t1]++, cnt[t2]++; last[t1] = t3, last[t2] = t3; v[t1].push_back(t2); v[t2].push_back(t1); ans[t1][t2] = t3; } for (int i = 1; i <= n; i++) { if (cnt[i] == 2) { cout << NO << endl; return 0; } if (cnt[i] == 1 && last[i] != 0) { nod.push_back(i); } } for (int i = 0; i < path.size(); i++) { if (cnt[path[i].first] > 1 && cnt[path[i].second] > 1) { more.push_back(path[i]); } } sort(nod.begin(), nod.end()); while (nod.size() > 1) { sol.push_back(make_pair(make_pair(nod[0], nod[1]), last[nod[0]])); clr(); dfs(nod[0], nod[1], last[nod[0]]); last[nod[1]] -= last[nod[0]]; if (re.size() < 2) re.push_back(nod[0]); nod.erase(nod.begin()); } if (nod.size() == 1 && n > 2) { sol.push_back(make_pair(make_pair(re[1], nod[0]), last[nod[0]] / 2)); clr(); dfs(re[1], nod[0], last[nod[0]] / 2); sol.push_back(make_pair(make_pair(re[0], re[1]), last[nod[0]] / -2)); clr(); dfs(re[0], re[1], last[nod[0]] / -2); sol.push_back(make_pair(make_pair(re[0], nod[0]), last[nod[0]] / 2)); clr(); dfs(re[0], nod[0], last[nod[0]] / 2); } for (int i = 0; i < more.size(); i++) { t4 = more[i].first, t5 = more[i].second; if (ma[t4][t5] != ans[t4][t5]) { pl = exp(t4), pr = exp(t5), dif = ans[t4][t5] - ma[t4][t5]; sol.push_back(make_pair(make_pair(pl.first, pr.first), dif / 2)); sol.push_back(make_pair(make_pair(pl.second, pr.second), dif / 2)); sol.push_back(make_pair(make_pair(pl.first, pl.second), dif / -2)); sol.push_back(make_pair(make_pair(pr.first, pr.second), dif / -2)); } } cout << YES << endl << sol.size() << endl; for (int i = 0; i < sol.size(); i++) { cout << sol[i].first.first << << sol[i].first.second << << sol[i].second << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> n >> a >> b; int r = 0; for (int i = 1; i < 300; i++) { int x1 = a / i; int x2 = b / i; if (x1 + x2 >= n && x1 != 0 && x2 != 0) r = i; } cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5; long long dmod(long long x, long long MOD) { return x % MOD; } long long m; long long fe(long long x, long long p) { if (p == 0) return 1; long long ret = fe(x, p / 2); ret = dmod(ret * ret, m); if (p & 1) ret = dmod(ret * x, m); return ret; } int n; long long li[N + 5]; set<long long> ada; long long get_count(long long x) { long long ret = 0; for (int i = 1; i <= n; i++) { long long cur = (li[i] + x) % m; if (ada.find(cur) != ada.end()) ret++; } return ret; } bool proc() { if (2 * n < m) return 0; set<long long> tmp; long long cur = 0; for (int i = 1; i <= n; i++) { while (cur != li[i]) tmp.insert(cur++); cur++; } while (cur != m) tmp.insert(cur++); int id = 0; for (auto x : tmp) { id++; li[id] = x; } n = id; return 1; } int main() { scanf( %d%d , &m, &n); for (int i = 1; i <= n; i++) scanf( %lld , &li[i]); if (n == 1) { printf( %lld 0 n , li[1]); return 0; } else if (m == 2 || n == m) { printf( 0 1 n ); return 0; } else if (n == m - 1) { sort(li + 1, li + n + 1); for (int i = 1; i <= n; i++) { if (li[i] != (i - 1)) { printf( %d 1 n , i); return 0; } } printf( 0 1 n ); return 0; } sort(li + 1, li + n + 1); bool tukar = proc(); for (int i = 1; i <= n; i++) ada.insert(li[i]); long long dif = li[2] - li[1]; long long cnt = get_count(dif); long long inv = fe(n - cnt, m - 2); dif = dmod(dif * inv, m); deque<long long> dq; dq.push_front(li[1]); while (1) { long long now = dq.front(); now = dmod(now - dif + m, m); if (ada.find(now) != ada.end()) dq.push_front(now); else break; } while (1) { long long now = dq.back(); now = dmod(now + dif, m); if (ada.find(now) != ada.end()) dq.push_back(now); else break; } if (dq.size() != n) { printf( -1 n ); return 0; } if (tukar) { printf( %lld %lld n , dmod(dq.back() + dif, m), dif); } else { printf( %lld %lld n , dq.front(), dif); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[300300]; int a[300300], h[300300], d[300300]; vector<int> ans; inline void calc(int i) { int mn = min(a[i], a[i + 1]); if (!mn) return; ans.push_back(i); a[i] -= mn, a[i + 1] -= mn; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= 2; i++) dp[i] = a[i], d[i] = 1; for (int i = 3; i <= n; i++) { if (dp[i - 2] + a[i] < dp[i - 3] + max(a[i], a[i - 1])) dp[i] = dp[i - 2] + a[i], d[i] = 1; else dp[i] = dp[i - 3] + max(a[i], a[i - 1]), d[i] = 2; } for (int i = n - (dp[n] >= dp[n - 1]); i > 0; i -= d[i] + 1) { h[i] = h[i - d[i] + 1] = 1; } for (int i = 1; i <= n; i++) if (h[i]) { if (h[i + 1]) calc(i); calc(i - 1), calc(i); } printf( %d n , ans.size()); for (int x : ans) printf( %d n , x); } |
#include <bits/stdc++.h> using namespace std; vector<string> a; long long i, j, k, sumA = 0, sumB = 0, min_sumA = 8, min_sumB = 8; string t; int main() { for (i = 0; i < 8; i++) { cin >> t; a.push_back(t); } for (i = 0; i < 8; i++) for (j = 0; j < 8; j++) { sumA = sumB = 0; if (a[i][j] == W ) { for (k = i - 1; k >= 0; k--) if (a[k][j] != B ) ++sumA; else { sumA = min_sumA; break; } sumB = min_sumB; } else if (a[i][j] == B ) { for (k = i + 1; k < 8; k++) if (a[k][j] != W ) ++sumB; else { sumB = min_sumB; break; } sumA = min_sumA; } else { sumA = min_sumA; sumB = min_sumB; } if (sumA < min_sumA) min_sumA = sumA; if (sumB < min_sumB) min_sumB = sumB; } if (min_sumA <= min_sumB) printf( A ); else printf( B ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool good(int x, int y, int n) { return x >= 0 && y >= 0 && x < n && y < n; } int main() { cin.tie(0); cin.sync_with_stdio(0); int x; cin >> x; for (int i = 1; i <= 200; i += 2) { int n = i; int o = 1; int t = (n / 2) * 2; int f = (n / 2) * (n / 2); int O = 1; int T = t; int F = f; if ((n / 2) % 2 == 0) { t = T / 2; f = F / 2; int X = x; if (X % 2) X--; while (f) { if (X - 4 >= 0) X -= 4; f--; } while (t) { if (X - 2 >= 0) X -= 2; t--; } if (X == 0) { cout << n; return 0; } } else { int X = x; o = 0; t = ((n / 2) / 2 + 1) * 2; f = ((n / 2) * (n / 2)) / 2; while (f) { if (X - 4 >= 0) X -= 4; f--; } while (t) { if (X - 2 >= 0) X -= 2; t--; } if (X == 0) { cout << n; return 0; } X = x; o = 1; t = ((n / 2) / 2) * 2; f = (((n / 2) * (n / 2)) / 2) + 1; if (X % 2) X--; while (f) { if (X - 4 >= 0) X -= 4; f--; } while (t) { if (X - 2 >= 0) X -= 2; t--; } if (X == 0) { cout << n; return 0; } } } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.