func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> char s[200010]; int tree[26][200010 << 2]; bool vis[200010]; inline void PushUp(int t, int rt) { tree[t][rt] = tree[t][rt << 1] + tree[t][rt << 1 | 1]; } void Update(int t, int x, int L, int R, int rt) { if (L == R) tree[t][rt] = 1; else { int mid = (L + R) >> 1; if (mid >= x) Update(t, x, L, mid, rt << 1); else Update(t, x, mid + 1, R, rt << 1 | 1); PushUp(t, rt); } } int Find(int t, int x, int L, int R, int rt) { if (L == R) { tree[t][rt] = 0; return L; } int ans, mid = (L + R) >> 1; if (tree[t][rt << 1] >= x) ans = Find(t, x, L, mid, rt << 1); else { x -= tree[t][rt << 1]; ans = Find(t, x, mid + 1, R, rt << 1 | 1); } PushUp(t, rt); return ans; } int main() { char ch; int k, i, j, q, len, n; while (~scanf( %d %s%d , &k, s + 1, &q)) { memset(vis, false, sizeof(vis)); memset(tree, 0, sizeof(tree)); len = strlen(s + 1); n = len * k; for (j = len + 1; --k;) { for (i = 1; i <= len; i++) s[j++] = s[i]; } s[j] = 0; for (i = 1; s[i]; i++) Update(s[i] - a , i, 1, n, 1); while (q--) { scanf( %d %c , &i, &ch); k = Find(ch - a , i, 1, n, 1); vis[k] = true; } for (i = 1; s[i]; i++) { if (!vis[i]) putchar(s[i]); } putchar( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; int numb[MAXN], numw[MAXN]; int dp[MAXN][2]; string s[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); for (int i = 0; i < MAXN; i++) dp[i][0] = dp[i][1] = -1; int n, m, x, y; cin >> n >> m >> x >> y; for (int i = 0; i < n; i++) cin >> s[i]; for (int t = 0; t < m; t++) { int num = 0; for (int i = 0; i < n; i++) if (s[i][t] == # ) num++; numb[t] = num; numw[t] = n - num; } for (int t = 1; t < m; t++) numb[t] += numb[t - 1], numw[t] += numw[t - 1]; for (int t = x - 1; t < m; t++) { for (int j = x; j <= y && t - j + 1 >= 0; j++) { if (t - j + 1 == 0) { if (dp[t][0] == -1) dp[t][0] = 1e9; if (dp[t][1] == -1) dp[t][1] = 1e9; dp[t][0] = min(dp[t][0], numb[t]); dp[t][1] = min(dp[t][1], numw[t]); continue; } if (dp[t - j][0] != -1) { if (dp[t][1] == -1) dp[t][1] = 1e9; dp[t][1] = min(dp[t][1], dp[t - j][0] + (numw[t] - numw[t - j])); } if (dp[t - j][1] != -1) { if (dp[t][0] == -1) dp[t][0] = 1e9; dp[t][0] = min(dp[t][0], dp[t - j][1] + (numb[t] - numb[t - j])); } } } cout << min(dp[m - 1][0], dp[m - 1][1]) << n ; }
|
#include<bits/stdc++.h> using namespace std; #define forg(i,x) for(register int i=fir[x];i;i=nxt[i]) #define uu unsigned #define scanf a14=scanf #define rint register int #define fre(x) freopen(#x .in , r ,stdin),freopen(#x .out , w ,stdout) typedef long long ll; typedef uu long long ull; typedef pair<int,int>pii; int a14; inline int rd(int l,int r){return rand()%(r-l+1)+l;} const int mxn=1e5+3,sq=200,qs=320; int n,b[mxn],lp[mxn],rp[mxn],kn,be[mxn],po[mxn],qn; int ju[mxn/sq+2][mxn],ad[mxn/sq+2][mxn/qs+1]; int TG; struct shu{ int a[mxn],tg[mxn]; void add(int x){for(;x<=n;x+=x&-x){if(tg[x]!=TG)tg[x]=TG,a[x]=0;++a[x];}} int ask(int x){ int su=0,p=0; for(int i=1<<16;i;i>>=1){ if(p+i>=n)continue; p+=i;if(tg[p]!=TG)tg[p]=TG,a[p]=0; if(p+a[p]+su>=x)p-=i;else su+=a[p]; } return p+1; } void gb(int t){for(int i=1;i<=n;++i){if(tg[i]!=TG)a[i]=0;ju[t][i]=ju[t][i-(i&-i)]+a[i];}for(int i=1;i<=n;++i)ju[t][i]+=i;} }ar; void add2(int t,int x,int y){ int k=(x-1)/qs; for(int i=x;i<=(k+1)*qs;++i)ju[t][i]+=y; for(++k;k*qs+1<=n;++k)ad[t][k]+=y; } int main(){ //cout<<(sizeof(ju)>>20)<<endl; scanf( %d ,&n);for(int i=1;i<=n;++i)scanf( %d ,b+i),b[i]=i-b[i];scanf( %d ,&qn); for(int l=1,r;r!=n;l=r+1){r=min(l+sq-1,n);lp[++kn]=l,rp[kn]=r;for(int i=l;i<=r;++i)be[i]=kn;} for(int t=1;t<=kn;++t){ ++TG; for(int i=lp[t];i<=rp[t];++i)po[i]=ar.ask(b[i]),ar.add(po[i]); ar.gb(t); } while(qn--){ int o,x,y;scanf( %d%d ,&o,&x);if(o==1){ scanf( %d ,&y);b[x]=x-y;int k=be[x],ls; ++TG;for(int i=lp[k];i<=rp[k];++i){ if(i<x)ar.add(po[i]);else{ ls=po[i],po[i]=ar.ask(b[i]),ar.add(po[i]); if(ls==po[i])continue; if(ls==po[i]-1){--ju[k][ls];continue;} if(ls==po[i]+1){++ju[k][po[i]];continue;} assert(i==x); add2(k,ls,-1),add2(k,po[i],1); } } }else{ int t=be[x],re=b[x];for(int i=x+1;i<=rp[t];++i)re+=b[i]<=re; for(++t;t<=kn;++t)re=ju[t][re]+ad[t][(re-1)/qs]; printf( %d n ,re); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MOD = 1e9 + 7; vector<int> prefix_function(vector<int> s) { int n = s.size(); vector<int> pi(n); pi[0] = 0; for (int i = 1; i < n; ++i) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) { j = pi[j - 1]; } if (s[i] == s[j]) { ++j; } pi[i] = j; } return pi; } vector<int> res_vector(vector<int> s, vector<int> t) { vector<int> res = s; res.push_back(2 * INF); for (int i = 0; i < t.size(); ++i) { res.push_back(t[i]); } return res; } vector<int> process(vector<int> res, vector<int> pi, int n) { vector<int> ans(res.size()); for (int i = n + 1; i < res.size(); ++i) { ++ans[pi[i]]; } for (int i = res.size() - 1; i >= n + 1; --i) { ans[pi[i - 1]] += ans[i]; } return ans; } int main() { ios::sync_with_stdio(0); int n, w; cin >> n >> w; if (w == 1) { cout << n << endl; return 0; } vector<int> a(n - 1); int last; cin >> last; for (int i = 0; i < n - 1; ++i) { int temp; cin >> temp; a[i] = temp - last; last = temp; } cin >> last; vector<int> b(w - 1); for (int i = 0; i < w - 1; ++i) { int temp; cin >> temp; b[i] = temp - last; last = temp; } vector<int> res = res_vector(b, a); vector<int> pi = prefix_function(res); vector<int> ans = process(res, pi, b.size()); cout << ans[w - 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; if (n == 1) cout << 0; else if (k >= n / 2) { long long int ans = 0; for (int i = 0; i < n; i++) ans += n - i - 1; cout << ans << endl; } else { long long int ans = 0; for (int i = 0; i < k; i++) { ans += n - i - 1; ans += k - i - 1; } for (int i = k; i < n - k; i++) { ans += k; } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; vector<char> v; int i = 0; int j = 1; int sum = -1; while (sum < n - 1) { sum = sum + j; v.push_back(s[sum]); j++; } for (auto it = v.begin(); it != v.end(); it++) { cout << *it; } }
|
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } const long long int N = 1000005; struct segmenttree { vector<long long int> st; void init(long long int _n) { st.clear(); st.resize(4 * _n); } void build(long long int l, long long int r, long long int node) { if (l == r) { return; } long long int mid = (l + r) / 2; build(l, mid, node * 2 + 1); build(mid + 1, r, node * 2 + 2); st[node] = max(st[2 * node + 1], st[2 * node + 2]); } void update(long long int l, long long int r, long long int indup, long long int val, long long int node) { if (l == r) { st[node] = val; return; } else { long long int mid = (l + r) / 2; if (indup >= l && indup <= mid) { update(l, mid, indup, val, node * 2 + 1); } else { update(mid + 1, r, indup, val, node * 2 + 2); } st[node] = max(st[2 * node + 1], st[2 * node + 2]); } } long long int query(long long int si, long long int se, long long int l, long long int r, long long int node) { if (se < l || si > r || l > r) { return INT_MIN; } if (si >= l && se <= r) { return st[node]; } long long int mid = (si + se) / 2; long long int q1 = query(si, mid, l, r, node * 2 + 1); long long int q2 = query(mid + 1, se, l, r, node * 2 + 2); return max(q1, q2); } }; segmenttree tree[N]; long long int sz[N], res[N], mx[N], n, m; vector<long long int> pos[N]; long long int give(long long int row, long long int pos) { long long int mn, mx, ret; if (pos < sz[row]) { mn = max(0ll, pos - (m - sz[row])), mx = pos; if ((m - 1) - pos >= sz[row]) ret = 0; else ret = INT_MIN; } else { pos = sz[row] - (m - pos); mn = pos, mx = max(sz[row] - 1, pos + (m - sz[row])); if (pos >= sz[row]) ret = INT_MIN; else ret = 0; } return max(ret, tree[row].query(0, sz[row] - 1, mn, mx, 0)); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); { long long int i, j, k, ans = 0, cnt = 0, sum = 0; cin >> n >> m; for (i = 0; i < n; i++) { cin >> sz[i]; tree[i].init(sz[i]); for (j = 0; j < sz[i]; j++) { long long int x; cin >> x; mx[i] = max(mx[i], x); tree[i].update(0, sz[i] - 1, j, x, 0); } for (j = 0; j < sz[i]; j++) pos[j].push_back(i); for (j = max(sz[i], (m - sz[i])); j < m; j++) pos[j].push_back(i); } for (i = 0; i < n; i++) { ans += mx[i]; } for (i = 0; i < m; i++) { res[i] = ans; for (auto x : pos[i]) { res[i] -= mx[x]; res[i] += give(x, i); } } for (i = 0; i < m; i++) { cout << res[i] << ; } } }
|
#include <bits/stdc++.h> using namespace std; template <typename T> T prod(const T &a, const T &b, const T &mod) { return ((a % mod) * (b % mod)) % mod; } template <typename T> T pow_(const T &a, const T &b) { if (!b) return 1; T p = pow_(a, b / 2); p *= p; return (b % 2) ? (p * a) : p; } template <typename T> T modpow(const T &a, const T &b, const T &mod) { if (!b) return 1; T p = modpow(a, b / 2); p = prod(p, p); return (b % 2) ? (prod(p, a)) : p; } template <typename T> T max(const T &a, const T &b, const T &c) { return max(a, max(b, c)); } template <typename T> T min(const T &a, const T &b, const T &c) { return min(a, min(b, c)); } template <typename T> void dbg(const vector<T> &a, int l, int r) { for (long long int i = l; i <= r; i++) cout << a[i] << ; cout << endl; } template <typename T> void dbg(const vector<T> &a) { for (long long int i = 0; i <= a.size() - 1; i++) cout << a[i] << ; cout << endl; } void main_() { long long int n; cin >> n; vector<long long int> a(n + 1, 0); for (long long int i = 1; i <= n; i++) { cin >> a[i]; a[i] += a[i - 1]; } long long int x, y, z; long long int res = -LLONG_MAX; for (long long int i = 0; i <= n; i++) { long long int m1 = -LLONG_MAX, m2 = -LLONG_MAX; long long int y_, x_, z_; y_ = i; for (long long int j = 0; j <= i; j++) { if (m1 < a[j]) { m1 = a[j]; x_ = j; } } for (long long int j = i; j <= n; j++) { if (m2 < a[j]) { m2 = a[j]; z_ = j; } } long long int sum = 2 * (a[x_] + a[z_] - a[y_]) - a[n]; if (res < sum) { res = sum; x = x_; y = y_; z = z_; } } cout << x << << y << << z << endl; } int main() { { main_(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; template <class T, class U> using Pa = pair<T, U>; template <class T> using vec = vector<T>; template <class T> using vvec = vector<vec<T>>; template <typename Monoid, typename F> class SegmentTree { private: int sz; vector<Monoid> seg; const F op; const Monoid e; public: SegmentTree(int n, const F op, const Monoid &e) : op(op), e(e) { sz = 1; while (sz <= n) sz <<= 1; seg.assign(2 * sz, e); } void set(int k, const Monoid &x) { seg[k + sz] = x; } void build() { for (int i = sz - 1; i > 0; i--) { seg[i] = op(seg[2 * i], seg[2 * i + 1]); } } void update(int k, const Monoid &x) { k += sz; seg[k] += x; while (k >>= 1) { seg[k] = op(seg[2 * k], seg[2 * k + 1]); } } Monoid query(int l, int r) { Monoid L = e, R = e; for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) { if (l & 1) L = op(L, seg[l++]); if (r & 1) R = op(seg[--r], R); } return op(L, R); } Monoid operator[](const int &k) const { return seg[k + sz]; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); int N, M; cin >> N >> M; vvec<char> F(N, vec<char>(M)); vec<int> len(N + M); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) { cin >> F[i][j]; len[i + j]++; } vvec<int> L(N, vec<int>(M, 0)); vvec<int> R = L, D = L; for (int i = N - 1; i >= 0; i--) { for (int j = 0; j < M; j++) { int c = (F[i][j] == z ); if (!c) { L[i][j] = 0; D[i][j] = 0; } else { L[i][j] = 1 + (j != 0 ? L[i][j - 1] : 0); D[i][j] = 1 + ((j != 0 && i != N - 1) ? D[i + 1][j - 1] : 0); } } for (int j = M - 1; j >= 0; j--) { int c = (F[i][j] == z ); if (!c) R[i][j] = 0; else R[i][j] = 1 + (j != M - 1 ? R[i][j + 1] : 0); } } auto op = [](ll a, ll b) { return a + b; }; vec<SegmentTree<ll, decltype(op)>> segs; for (int l = 0; l < N + M - 1; l++) { SegmentTree<ll, decltype(op)> seg(M, op, 0); segs.push_back(seg); } ll ans = 0; for (int j = M - 1; j >= 0; j--) { for (int i = 0; i < N; i++) { int y = j; while (y >= 0 && y + R[i][y] - 1 == j) { segs[i + y].update(y, 1); y--; } } for (int i = 0; i < N; i++) { int a = min(L[i][j], D[i][j]); ans += segs[i + j].query(j - a + 1, j + 1); } } cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k, a, b, i = 0, arr[100000], j = 0; cin >> n >> k; for (int x = 0; x < n; x++) { cin >> a >> b; i++; while (a != b) if (a < b) a++, i++; else a--, i++; } while (i % k != 0) { i++; j++; } cout << j; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, top, len[100005], F1[1005][1005], F2[1005][1005]; pair<int, int> F[30]; char ans[30], dir[100005], a[1005][1005]; bool outside(int first, int second) { return (first < 1 || first > n || second < 1 || second > m); } int tinh1(int first, int y1, int y2) { if (y1 > y2) swap(y1, y2); return F1[first][y2] - F1[first][y1 - 1]; } int tinh2(int second, int x1, int x2) { if (x1 > x2) swap(x1, x2); return F2[x2][second] - F2[x1 - 1][second]; } void tinh(int first, int second, int i, int& x2, int& y2) { int dx = 0, dy = 0; if (dir[i] == N ) dx = -1; else if (dir[i] == S ) dx = 1; else if (dir[i] == W ) dy = -1; else if (dir[i] == E ) dy = 1; x2 = first + dx * len[i], y2 = second + dy * len[i]; } int main() { scanf( %d%d n , &n, &m); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { scanf( %c , &a[i][j]); if (a[i][j] >= A && a[i][j] <= Z ) { F[a[i][j]] = pair<int, int>(i, j); a[i][j] = . ; } } scanf( n ); } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { F1[i][j] = F1[i][j - 1] + (a[i][j] == # ); F2[i][j] = F2[i - 1][j] + (a[i][j] == # ); } int k; scanf( %d n , &k); for (int i = 1; i <= k; ++i) scanf( %c %d n , &dir[i], &len[i]); for (char t = A ; t <= Z ; ++t) if (F[t].first != 0) { int first = F[t].first, second = F[t].second; bool b = true; for (int i = 1; i <= k; ++i) { int x2, y2; tinh(first, second, i, x2, y2); if (outside(x2, y2) || (x2 == first && tinh1(first, second, y2) != 0) || (y2 == second && tinh2(second, first, x2) != 0)) { b = false; break; } first = x2, second = y2; } if (b) ans[++top] = t; } if (!top) cout << no solution << endl; else { for (int i = 1; i <= top; ++i) printf( %c , ans[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int t; int n; int a[5001]; bool coutNO; vector<int> check[5001]; int main() { cin.tie(0); cout.tie(0); cin >> t; for (int ct = 1; ct <= t; ct++) { cin >> n; coutNO = true; for (int i = 1; i <= n; i++) check[i].clear(); for (int i = 1; i <= n; i++) { cin >> a[i]; check[a[i]].push_back(i); if (check[a[i]].size() >= 3) coutNO = false; } if (!coutNO) { cout << YES << n ; continue; } for (int i = 1; i <= n; i++) if (check[i].size() == 2) { if (check[i][0] + 1 != check[i][1]) { coutNO = false; break; } } if (coutNO) cout << NO << n ; else cout << YES << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int const lac = 100000; long long int modmul(long long int a, long long int b) { return ((a % 1000000007) * (b % 1000000007)) % 1000000007; } long long int modadd(long long int a, long long int b) { return (((a % 1000000007) + (b % 1000000007))) % 1000000007; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; else return gcd(b, a % b); } class comp { public: bool operator()(int a, int b) const { return a > b; } }; bool compa(int a, int b) { return a > b; } void solve(long long int t1) { long long int n; cin >> n; vector<long long int> arr(n + 1); for (long long int i = 1; i <= n; i++) { cin >> arr[i]; } vector<long long int> prefix(n + 1, 0); long long int ans = 0; for (long long int i = 1; i <= n; i++) { prefix[i] = prefix[i - 1] ^ i; ans ^= arr[i]; } if (n == 1) { cout << ans << n ; return; } for (long long int i = 1; i <= n - 1; i++) { long long int temp = (n) / (i + 1); long long int rem = n % i; if (temp & 1) { ans ^= prefix[i]; } ans ^= prefix[rem]; } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; t = 1; for (long long int i = 1; i <= t; i++) { solve(t); } cerr << time taken : << (float)clock() / CLOCKS_PER_SEC << secs << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; pair<double, double> p[301]; double a, b, c, den, len; double area(int i) { double num = abs(a * p[i].first + b * p[i].second + c); return (num) / (2.0); } double f(int i, int j) { a = (p[j].second - p[i].second); b = (p[i].first - p[j].first); c = 0 - p[i].second * b - p[i].first * a; den = sqrtf(a * a + b * b); len = sqrtf((p[i].first - p[j].first) * (p[i].first - p[j].first) + (p[i].second - p[j].second) * (p[i].second - p[j].second)); double m1 = -1, m2 = -1; for (int k = 0; k < n; ++k) { if (k == i or k == j) continue; long long temp = a * p[k].first + b * p[k].second + c; double flag = area(k); if (temp >= 0) m1 = max(m1, flag); else m2 = max(m2, flag); } if (m1 == -1 or m2 == -1) return 0; return m1 + m2; } int main() { cin >> n; for (int i = 0; i < n; ++i) { double x, y; scanf( %lf%lf , &x, &y); p[i] = {x, y}; } double ans = 0; for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { ans = max(ans, f(i, j)); } } printf( %0.10f n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, s; vector<long long> v(1001); long long check(long long x) { long long sum = 0; for (long long i = 0; i < n; i++) { if (v[i] < x) return 0; sum += max((long long)0, v[i] - x); } return (sum >= s); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n >> s; for (long long i = 0; i < n; i++) cin >> v[i]; long long l = 0; long long r = 1e15; while (l < r) { long long mid = (l + r + 1) / 2; if (check(mid)) l = mid; else r = mid - 1; } if (check(l)) cout << l; else cout << -1; }
|
#include <bits/stdc++.h> long long n, m, a, d, t[100007], old, ans, aind, firstA, stepD; int main() { std::ios::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0); std::cin >> n >> m >> a >> d; for (int i = 0; i < m; ++i) std::cin >> t[i]; aind = d / a * a + a; for (int i = 0; i < m; ++i) { if (t[i] <= old) continue; if (t[i] <= n * a) { firstA = (old / a + 1) * a; if (t[i] <= firstA) { ++ans; old = t[i] + d; } else { stepD = (t[i] - firstA) / aind + ((t[i] - firstA) % aind ? 1 : 0); ans += stepD; old = firstA + stepD * aind - (a - d % a); if (old < t[i]) { ++ans; firstA = (old / a + 1) * a; old = std::min(t[i], firstA) + d; } } } else { if (old < n * a) { firstA = (old / a + 1) * a; stepD = (n * a - firstA) / aind + ((n * a - firstA) % aind ? 1 : 0); ans += stepD; old = firstA + stepD * aind - (a - d % a); if (old < n * a) { ++ans; firstA = (old / a + 1) * a; old = firstA + d; } } if (old < t[i]) { ++ans; old = t[i] + d; } } } if (old < a * n) { firstA = (old / a + 1) * a; stepD = (a * n - firstA) / aind + ((a * n - firstA) % aind ? 1 : 0); ans += stepD; old = firstA + stepD * aind - (a - d % a); if (old < a * n) { ++ans; } } std::cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const int inf = 50000000; const int maxn = 2010; int n, A[maxn][maxn], vis[maxn]; int bfs(int src, int d) { queue<int> q; q.push(src); for (int i = 1; i <= n; i++) vis[i] = 0; vis[src] = 1; int ret = 1; while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 1; i <= n; i++) { if (!d && !vis[i] && A[u][i] > 0) { vis[i] = 1; ret += 1; q.push(i); } if (d && !vis[i] && A[i][u] > 0) { vis[i] = 1; ret += 1; q.push(i); } } } return ret; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf( %d , &A[i][j]); } } if (bfs(1, 0) == n && bfs(1, 1) == n) printf( YES n ); else printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 205; char str[20][N]; int n, m, des; int dp[20][2]; int call(int flr, int side) { if (flr == des) { if (side == 0) { int p = 0; for (int i = 1; i <= m; i++) if (str[flr][i] == 1 ) p = i; return p; } else { int p = m + 1; for (int i = m; i >= 1; i--) if (str[flr][i] == 1 ) p = i; return m + 1 - p; } } if (dp[flr][side] != -1) return dp[flr][side]; int ret = 1e9; if (side == 0) { ret = min(ret, m + 2 + call(flr - 1, 1)); int p = 0; for (int i = 1; i <= m; i++) if (str[flr][i] == 1 ) p = i; ret = min(ret, 2 * p + 1 + call(flr - 1, 0)); } else { ret = min(ret, m + 2 + call(flr - 1, 0)); int p = m + 1; for (int i = m; i >= 1; i--) if (str[flr][i] == 1 ) p = i; ret = min(ret, (m + 1 - p) * 2 + 1 + call(flr - 1, 1)); } return dp[flr][side] = ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); memset(dp, -1, sizeof(dp)); cin >> n >> m; for (int i = 0; i < n; i++) cin >> str[i]; des = n - 1; for (int i = n - 1; i >= 0; i--) { for (int j = 1; j <= m; j++) if (str[i][j] == 1 ) des = i; } cout << call(n - 1, 0) << n ; }
|
#include <bits/stdc++.h> char s[5][110], ss[5][5]; int main() { int t, n, i, j; scanf( %d , &n); memset(s, 0x00, sizeof(s)); if (n == 1) { s[0][0] = a ; s[1][0] = a ; s[2][0] = b ; s[3][0] = b ; } else if (n & 1) { s[2][0] = f ; s[3][0] = f ; s[0][n - 1] = c ; s[1][n - 1] = c ; for (i = 0; i < n - 1; i += 2) { int tp = i / 2; s[0][i] = a + (tp & 1); s[0][i + 1] = a + (tp & 1); s[1][i] = d + (tp & 1); s[1][i + 1] = d + (tp & 1); s[2][i + 1] = g + (tp & 1); s[2][i + 2] = g + (tp & 1); s[3][i + 1] = i + (tp & 1); s[3][i + 2] = i + (tp & 1); } } else { s[2][0] = e ; s[3][0] = e ; s[2][n - 1] = f ; s[3][n - 1] = f ; for (i = 0; i < n - 1; i += 2) { int tp = i / 2; s[0][i] = a + (tp & 1); s[0][i + 1] = a + (tp & 1); s[1][i] = c + (tp & 1); s[1][i + 1] = c + (tp & 1); } for (i = 1; i < n - 1; i += 2) { int tp = i / 2; s[2][i] = g + (tp & 1); s[2][i + 1] = g + (tp & 1); s[3][i] = i + (tp & 1); s[3][i + 1] = i + (tp & 1); } } for (i = 0; i < 4; ++i) puts(s[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k, x, y, sum, ans, T; char c; int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); vector<int> v, b; for (int i = 1; i <= n; i += 2) { if (i + 1 > n) { v.push_back(i); b.push_back(i); } else { printf( ? %d %d n , i, i + 1); fflush(stdout); scanf( %c , &c); if (c == < ) v.push_back(i + 1), b.push_back(i); else if (c == > ) v.push_back(i), b.push_back(i + 1); else v.push_back(i), b.push_back(i); } } while (v.size() > 1) { x = v[v.size() - 1]; v.pop_back(); y = v[v.size() - 1]; v.pop_back(); printf( ? %d %d n , x, y); fflush(stdout); scanf( %c , &c); if (c == < ) v.push_back(y); else if (c == > ) v.push_back(x); else v.push_back(x); } while (b.size() > 1) { x = b[b.size() - 1]; b.pop_back(); y = b[b.size() - 1]; b.pop_back(); printf( ? %d %d n , x, y); fflush(stdout); scanf( %c , &c); if (c == < ) b.push_back(x); else if (c == > ) b.push_back(y); else b.push_back(x); } printf( ! %d %d n , b[0], v[0]); fflush(stdout); } return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; vector<int> v; set<double> S; set<double>::iterator it, it2; int main() { int n, k; cin >> n >> k; cin >> s; for (int i = 0; i < s.size(); i++) if (s[i] == 0 ) v.push_back(i + 1); int i = 0, j = 0; for (i = 0; i <= k; i++) S.insert(v[i]); j = i - 1; i = 0; int mn = INT_MAX; n = v.size(); while (j < n) { double x = (v[i] + v[j]) / 2.0; it = S.lower_bound(x); it2 = it; it2--; int a = max(v[j] - *it, *it - v[i]); int b = max(*it2 - v[i], v[j] - *it2); mn = min(mn, min(a, b)); j++; if (j < n) { S.erase(v[i]); S.insert(v[j]); i++; } } cout << mn; return 0; }
|
#include <bits/stdc++.h> using namespace std; int firstOne(string s) { int len = s.length(); for (int i = len - 1; i >= 0; i--) { if (s[i] == 1 ) { return len - i; } } } int firstOneAfter(string s, int idx) { int len = s.length(); for (int i = len - idx; i >= 0; i--) { if (s[i] == 1 ) { return len - i; } } } int main() { int t; cin >> t; while (t--) { string x, y; cin >> x >> y; int firstOneX = firstOne(x), firstOneY = firstOne(y); if (firstOneX >= firstOneY) { cout << firstOneX - firstOneY << endl; } else { cout << firstOneAfter(x, firstOneY) - firstOneY << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int val(vector<int> a) { int cur = a[0]; for (int i = 1; i < a.size(); i++) { cur = (a[i] | cur) - a[i]; } return cur; } int brute(vector<int> a) { vector<int> P(a.size()); for (int i = 0; i < a.size(); i++) { P[i] = i; } int ans = 0; vector<int> f; do { vector<int> b = a; for (int i = 0; i < b.size(); i++) { b[i] = a[P[i]]; } if (ans < val(b)) f = b; ans = max(ans, val(b)); } while (next_permutation((P).begin(), (P).end())); return ans; } pair<long long, long long> vec(pair<long long, long long> P, pair<long long, long long> Q) { return {P.first - Q.first, P.second - Q.second}; } bool okay(pair<long long, long long> P1, pair<long long, long long> P2, pair<long long, long long> P3, pair<long long, long long> P4) { return vec(P1, P2) == vec(P3, P4); } int main() { int n; cin >> n; vector<pair<long long, long long> > P(n); for (int i = 0; i < n; i++) { cin >> P[i].first >> P[i].second; } if (n % 2) { cout << no ; return 0; } P.push_back(P[0]); for (int i = 0; i < n / 2; i++) { if (okay(P[i], P[i + 1], P[n / 2 + i + 1], P[n / 2 + i]) || okay(P[i], P[i + 1], P[n / 2 + i], P[n / 2 + i + 1])) { continue; } cout << no ; return 0; } cout << yes ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 105; using ll = long long; int n, m, b[N]; ll a[N], c1, c2; int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 2; i <= m * 2; i++) { for (int j = 1; j <= n; j++) b[j] = a[j] % i; sort(b + 1, b + n + 1); b[n + 1] = m; if (~i & 1) { int t1 = 0; for (int j = 1; j <= n; j++) if (b[j] >= i / 2) t1 ^= 1; if (t1) ++c2; } for (int j = 1; j <= n + 1; j++) { int l = max(b[j - 1] + 1, i / 2 + 1), r = min(min(i - 1, m), b[j]); if (r < l) continue; int al = max(b[j - 1], b[n - 1] / 2), bl = max(l, i - al); if (bl <= r) c1 += r - bl + 1, r = bl - 1; if (r < l) continue; if ((n - j + 1) & 1) c2 += (r - l + 1) * 2; else { al = b[n - 1] / 2 + 1; int ar = b[n] / 2; bl = max(l, i - ar); int br = min(r, i - al); if (br >= bl) c1 += br - bl + 1; } } } cout << c1 << << c1 << << c2 << << m * 1ll * m - c1 * 2 - c2 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int T = 1 << 19; int n, q, a[N]; long long s[N]; int p, x; int tn = 1; long long mx[T], sum[T]; long long tmx[T], tsum[T]; inline void pushup(int x) { mx[x] = max(sum[x << 1] ? mx[x << 1] : -0x3f3f3f3f3f3f3f3f, sum[x << 1 ^ 1] ? mx[x << 1 ^ 1] : -0x3f3f3f3f3f3f3f3f); sum[x] = sum[x << 1] + sum[x << 1 ^ 1]; } inline void pushdown(int x) { if (tmx[x]) { if (mx[x << 1] != -0x3f3f3f3f3f3f3f3f) { mx[x << 1] += tmx[x]; } if (x << 1 ^ 1 != -0x3f3f3f3f3f3f3f3f) { mx[x << 1 ^ 1] += tmx[x]; } tmx[x << 1] += tmx[x]; tmx[x << 1 ^ 1] += tmx[x]; tmx[x] = 0; } if (tsum[x]) { sum[x << 1] += tsum[x]; sum[x << 1 ^ 1] += tsum[x]; tsum[x << 1] += (tsum[x] >> 1); tsum[x << 1 ^ 1] += (tsum[x] >> 1); tsum[x] = 0; } } void update(int l, int r, int x, int y, int nl = 1, int nr = tn, int cur = 1) { if (l == nl && r == nr) { if (mx[cur] != -0x3f3f3f3f3f3f3f3f) { mx[cur] += x; } tmx[cur] += x; sum[cur] += 1ll * y * (nr - nl + 1); tsum[cur] += 1ll * y * (nr - nl + 1); return; } pushdown(cur); int mid = (nl + nr) >> 1; if (r <= mid) { update(l, r, x, y, nl, mid, cur << 1); } else if (l > mid) { update(l, r, x, y, mid + 1, nr, cur << 1 ^ 1); } else { update(l, mid, x, y, nl, mid, cur << 1); update(mid + 1, r, x, y, mid + 1, nr, cur << 1 ^ 1); } pushup(cur); } int query(int l, int r, int x, int nl = 1, int nr = tn, int cur = 1) { if (nl == nr) { return (sum[cur] && (mx[cur] == x)) ? nl : -1; } pushdown(cur); int mid = (nl + nr) >> 1; if (l == nl && r == nr) { int res = -1; if (sum[cur << 1] > 0 && mx[cur << 1] >= x) { res = max(res, query(nl, mid, x, nl, mid, cur << 1)); } if (sum[cur << 1 ^ 1] > 0 && mx[cur << 1 ^ 1] >= x) { res = max(res, query(mid + 1, nr, x, mid + 1, nr, cur << 1 ^ 1)); } return res; } else { if (r <= mid) { return query(l, r, x, nl, mid, cur << 1); } else if (l > mid) { return query(l, r, x, mid + 1, nr, cur << 1 ^ 1); } else { return max(query(l, mid, x, nl, mid, cur << 1), query(mid + 1, r, x, mid + 1, nr, cur << 1 ^ 1)); } } } int query0(int* a) { return a[1] ? -1 : 1; } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); s[i] = s[i - 1] + a[i]; } while (tn < n) { tn <<= 1; } for (int i = tn; i < tn + n; i++) { mx[i] = a[i - tn + 1] - s[i - tn]; sum[i] = a[i - tn + 1]; } for (int i = tn + n; i < tn + tn; i++) { mx[i] = -0x3f3f3f3f3f3f3f3f; sum[i] = 0; } for (int i = tn - 1; i; i--) { pushup(i); } while (q--) { scanf( %d%d , &p, &x); update(p, p, x - a[p], x - a[p]); if (p + 1 <= n) { update(p + 1, n, -(x - a[p]), 0); } a[p] = x; int ans = max(query(1, n, 0), query0(a)); printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MM = 100010; int N, M; bool vis[MM]; int c[MM]; set<int> edge[MM]; void get_data() { int i, j, k, a, b; for (i = 1; i <= N; i++) { edge[i].clear(); scanf( %d , &c[i]); } while (M--) { scanf( %d%d , &a, &b); if (c[b] != c[a]) { edge[c[a]].insert(c[b]); edge[c[b]].insert(c[a]); } } } void solve() { int i, j, k, mx = -1, col = 100001; int count; sort(c + 1, c + N + 1); for (i = 1; i <= N; i++) { if (mx == -1 || mx < edge[c[i]].size()) mx = edge[c[i]].size(), col = c[i]; } printf( %d n , col); } int main() { while (scanf( %d%d , &N, &M) != EOF) get_data(), solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = (1e6) + 5; const int IT_MAX = 1 << 20; const int INF = -1; int bit[IT_MAX + 10]; void update(int p, int dv) { for (; p <= IT_MAX; p += p & (-p)) bit[p] += dv; } int query(int p) { int rv = 0; for (; p; p -= p & (-p)) rv += bit[p]; return rv; } int largerpos(int v) { if (bit[IT_MAX] <= v) return INF; int p = 0; int s = 0; for (int i = 19; i >= 0; i--) { if (s + bit[p + (1 << i)] <= v) { s += bit[p + (1 << i)]; p |= (1 << i); } } return p + 1; } vector<int> st[MAX], en[MAX]; int l[MAX], r[MAX]; int pa[MAX], sz[MAX]; int finPa(int p) { return pa[p] == p ? p : pa[p] = finPa(pa[p]); } bool mergeNode(int u, int v) { int r1 = finPa(u), r2 = finPa(v); if (sz[r1] < sz[r2]) { swap(r1, r2); } pa[r2] = r1; sz[r1] += sz[r2]; return (r1 == r2); } int main() { ios::sync_with_stdio(false); for (int i = 1; i <= MAX; i++) { sz[i] = 1; pa[i] = i; } int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> l[i] >> r[i]; st[l[i]].push_back(i); en[r[i]].push_back(i); } for (int i = 1; i <= 2 * n; i++) { for (int s : st[i]) { update(l[s], 1); } for (int s : en[i]) { int nex = largerpos(query(l[s])); while (nex != -1) { for (int ns : st[nex]) { if (mergeNode(s, ns)) { cout << NO << endl; return 0; } } nex = largerpos(query(nex)); } } for (int s : en[i]) { update(l[s], -1); } } int p = finPa(1); cout << ((sz[p] == n) ? YES : NO ) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long int Mod(long long int n) { return ((n % mod) + mod) % mod; } void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long int f[200005]; long long int invfact[200005]; long long int power(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) { res = (res * x) % mod; } x = (x * x) % mod; y >>= 1; } return res; } void precal() { f[0] = 1; invfact[0] = 1; for (int i = 1; i < 200005; i++) { f[i] = (f[i - 1] * i) % mod; invfact[i] = power(f[i], mod - 2); } } long long int fact(long long int n, long long int k) { if (n < k) { return 0; } return ((f[n] * invfact[k]) % mod * invfact[n - k]) % mod; } bool prime[10000011]; void primenumbers(long long int n) { memset(prime, true, sizeof(prime)); for (long long int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (long long int i = p * p; i <= n; i += p) prime[i] = false; } } } long long int modI(long long int a, long long int m) { long long int m0 = m, y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long int q = a / m; long long int t = m; m = a % m; a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } int spf[100001]; void sieve() { spf[1] = 1; for (int i = 2; i < 100001; i++) spf[i] = i; for (int i = 4; i < 100001; i += 2) spf[i] = 2; for (int i = 3; i * i < 100001; i++) { if (spf[i] == i) { for (int j = i * i; j < 100001; j += i) if (spf[j] == j) spf[j] = i; } } } vector<int> getFactorization(int x) { vector<int> ret; while (x != 1) { ret.push_back(spf[x]); x = x / spf[x]; } return ret; } const long long int mxn = 400010; long long int st[mxn]; long long int a[mxn]; void build(long long int v, long long int l, long long int r) { if (l == r) { st[v] = a[l]; } else { build(2 * v, l, (l + r) / 2); build(2 * v + 1, (l + r) / 2 + 1, r); st[v] = st[2 * v] * st[2 * v + 1]; } } void update(long long int v, long long int l, long long int r, long long int pos, long long int val) { if (pos < l || pos > r) { return; } if (pos == l && pos == r) { st[v] = val; } else { update(2 * v, l, (l + r) / 2, pos, val); update(2 * v + 1, (l + r) / 2 + 1, r, pos, val); st[v] = st[2 * v] * st[2 * v + 1]; } } long long int query(long long int v, long long int l, long long int r, long long int tl, long long int tr, long long int mo) { if (tr < l || tl > r || tl > tr) { return 1; } if (l == tl && r == tr) { return st[v] % mo; } else { return (((query(2 * v, l, (l + r) / 2, tl, min(tr, (l + r) / 2), mo)) % mo) * ((query(2 * v + 1, (l + r) / 2 + 1, r, max(tl, (l + r) / 2 + 1), tr, mo)) % mo)) % mo; } } long long int maxSubArraySum(vector<long long int> a, long long int size) { long long int max_so_far = INT_MIN, max_ending_here = 0, start = 0, end = 0, s = 0; for (long long int i = 0; i < size; i++) { max_ending_here += a[i]; if (max_so_far < max_ending_here) { max_so_far = max_ending_here; } if (max_ending_here < 0) { max_ending_here = 0; s = i + 1; } } return max_so_far; } int main() { fast(); long long int n, q; cin >> n >> q; vector<long long int> d(n + 1, 0); for (long long int i = 1; i < n + 1; i++) { cin >> d[i]; } sort(d.begin(), d.end()); vector<long long int> pr(n + 2, 0); while (q--) { long long int x, y; cin >> x >> y; pr[x]++; pr[y + 1]--; } vector<long long int> get(n + 1, 0); for (long long int i = 1; i < n + 1; i++) { get[i] = get[i - 1] + pr[i]; } sort(get.begin(), get.end()); long long int ans = 0; for (long long int i = 1; i < n + 1; i++) { ans = ans + get[i] * d[i]; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using ll = long long; using ld = long double; const ld PI = 4 * atanl(1); const ld EPS = 1e-12; const int MN = 1e5 + 10; struct vec { public: int x, y; void in() { scanf( %d%d , &x, &y); } ld mag() const { return hypotl(x, y); } ld ang() const { return atan2l(y, x); } }; struct Evt { public: ld t; int v; Evt(ld _t = 0, int _v = 0) : t(_t), v(_v) {} bool operator<(const Evt& o) const { return t < o.t; } }; struct BIT { public: int a[MN * 2], L; void reset(int _L) { memset(a, 0, L * sizeof *a); L = _L; } void upd(int n, int v) { for (++n; n <= L; n += -n & n) a[n - 1] += v; } int qry(int n) { int f = 0; for (; n; n -= -n & n) f += a[n - 1]; return f; } int qry(int l, int r) { return qry(r) - qry(l); } }; int N, p[MN]; ll K; vec a[MN]; std::vector<Evt> evt; BIT bit; ll count(ld d) { ll f = (ll)N * (N - 1) / 2; int ctr = 0; for (int i = 0; i < N; ++i) if (d < a[i].mag()) { ld m = a[i].ang(); ld dif = acosl(d / a[i].mag()); ld s = m - dif, e = m + dif; if (s + EPS < 0) s += 2 * PI, e += 2 * PI; if (2 * PI < e + EPS) e -= 2 * PI; if (e < s) std::swap(s, e); evt.push_back({s, ctr}); evt.push_back({e, ctr}); ctr++; } std::sort(evt.begin(), evt.end()); memset(p, -1, ctr * sizeof *p); bit.reset(ctr * 2); for (int i = 0; i < evt.size(); ++i) { int v = evt[i].v; if (~p[v]) bit.upd(p[v], -1), f -= bit.qry(p[v] + 1, i); else p[v] = i, bit.upd(i, 1); } evt.clear(); return f; } int main() { scanf( %d%lld , &N, &K); for (int i = 0; i < N; ++i) a[i].in(); ld l = -logl(1e8), r = logl(2e4), m; for (int i = 0; i < 100; ++i) { ld m = (r + l) / 2; if (count(exp(m)) < K) l = m; else r = m; } printf( %.9lf n , (double)exp(r)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, tot, a[1001000], ans[1001000 << 2], k[1001000]; long long s; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d , &a[i]), s += a[i], k[i] = s % n; k[m] = n; sort(k + 1, k + m + 1); for (int i = m; i; i--) k[i] -= k[i - 1]; for (int i = 1, j = 1; i <= m; ++i) { int x = a[i]; while (x > 0) ans[++tot] = i, x -= k[j], j = j % m + 1; } while (tot % m) ans[++tot] = 1; printf( %d n , tot / m); for (int i = 1; i <= m; ++i) printf( %d , k[i]); puts( ); for (int i = 1; i <= tot; ++i) { printf( %d , ans[i]); putchar(i % m ? : n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int count = 0; int min = a; if (b < a) { min = b; } int x = c / min; for (int i = 0; i <= x; i++) { for (int j = 0; j <= x; j++) { if (count != 0) { break; } if (a * i + b * j == c) { count++; cout << Yes ; } } } if (count == 0) { cout << No ; } }
|
#include <bits/stdc++.h> using namespace std; void PT(long long a); void PT1(long long a); const long long M = 2 * (1e5) + 7; long long a[M]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; { long long n, k; cin >> n >> k; if (k * (k - 1) < n) return cout << NO << n , 0; cout << YES << n ; vector<pair<long long, long long>> v; long long i = 1, j = 2; while (v.size() < n) { if (v.size() == 0) { v.push_back({i, j}); v.push_back({j, i}); } else if ((v.back()).first == i || (v.back()).second == j) { v.push_back({j, i}); v.push_back({i, j}); } else { v.push_back({i, j}); v.push_back({j, i}); } if (j == k) { i++; j = i + 1; } else j++; } for (long long i = 0; i < n; i++) { cout << v[i].first << << v[i].second << n ; } } return 0; } void PT(long long a) { cout << a << n ; } void PT1(long long a) { cout << a << ; }
|
#include <bits/stdc++.h> using namespace std; struct Edge { int u, v; } e[200050 << 1]; int fa[200050]; int n, color[200050], s, d; int cnt[2], dis[200050]; bool vis[200050]; vector<int> G[200050]; int find(int x) { if (x == fa[x]) return x; return fa[x] = find(fa[x]); } void _union(int x, int y) { int f1 = find(x); int f2 = find(y); if (f1 == f2) return; if (f1 < f2) fa[f2] = f1; else fa[f1] = f2; } queue<int> q; void bfs(int u) { memset(vis, false, sizeof(vis)); memset(dis, 0, sizeof(dis)); while (!q.empty()) q.pop(); q.push(u); vis[u] = true; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i < G[now].size(); i++) { int v = G[now][i]; if (!vis[v]) { q.push(v); vis[v] = true; s = v; dis[v] = dis[now] + 1; } } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &color[i]); fa[i] = i; } for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); e[2 * i - 1].u = u; e[2 * i - 1].v = v; e[i * 2].u = v; e[i * 2].v = u; if (color[u] == color[v]) _union(u, v); } for (int i = 1; i <= n; i++) fa[i] = find(i); for (int i = 1; i < n; i++) { int u = e[i * 2 - 1].u, v = e[i * 2 - 1].v; if (fa[u] != fa[v]) { G[fa[u]].push_back(fa[v]); G[fa[v]].push_back(fa[u]); } } int i = 1; for (; G[i].size() == 0 && i <= n; i++) ; if (i > n) { printf( 0 n ); return 0; } bfs(i); bfs(s); printf( %d n , (dis[s] + 1) / 2); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k; vector<int> g[100010]; const int inf = 1e9; int d[100010], p[100010]; queue<int> Q; void bfs(int x) { for (int i = 1; i <= n; i++) d[i] = inf; d[x] = 0; while (!Q.empty()) Q.pop(); Q.push(x); while (!Q.empty()) { int y = Q.front(); Q.pop(); for (int z : g[y]) { if (d[z] < inf) continue; d[z] = d[y] + 1; p[z] = y; Q.push(z); } } } bool dfs(int x, int pa, int c) { int d = g[x].size(); if (pa) d--; if (c) { if (d < 3) return 0; } else { if (d) return 0; } for (int y : g[x]) { if (y == pa) continue; if (!dfs(y, x, c - 1)) return 0; } return 1; } int main() { cin >> n >> k; for (int i = 1, x, y; i < n; i++) { scanf( %d%d , &x, &y); g[x].push_back(y); g[y].push_back(x); } bfs(1); int x = max_element(d + 1, d + n + 1) - d; bfs(x); int y = max_element(d + 1, d + n + 1) - d; int l = d[y]; while (2 * d[y] > l) y = p[y]; puts(dfs(y, 0, k) ? Yes : No ); }
|
#include <bits/stdc++.h> using namespace std; void code() { long long n, k; cin >> n >> k; long long a[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long ans = 0; for (long long i = 0; i < n; i++) { if ((a[i] - a[0]) % k != 0) { cout << -1 << endl; return; } ans += ((a[i] - a[0]) / k); } cout << ans << endl; } signed main() { code(); }
|
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> istream &operator>>(istream &in, pair<T1, T2> &P) { in >> P.first >> P.second; return in; } template <class T1, class T2> ostream &operator<<(ostream &out, const pair<T1, T2> &P) { out << ( << P.first << , << P.second << ) ; return out; } template <class T> istream &operator>>(istream &in, vector<T> &arr) { for (auto &x : arr) in >> x; return in; } template <class T> ostream &operator<<(ostream &out, const vector<T> &arr) { for (auto &x : arr) out << x << ; cout << n ; return out; } template <class T> istream &operator>>(istream &in, deque<T> &arr) { for (auto &x : arr) in >> x; return in; } template <class T> ostream &operator<<(ostream &out, const deque<T> &arr) { for (auto &x : arr) out << x << ; cout << n ; return out; } int f(int x, int y) { if (x % y == 0) { return f(x / y, y); } return x; } int n, k; int32_t main() { mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int u = 900000; cin >> n >> k; vector<int> v(n); cin >> v; vector<int> stv = v; while (u--) { vector<pair<int, int> > op; stv = v; while (v.size() > 1) { shuffle(v.begin(), v.end(), rng); pair<int, int> nv; nv.first = v.back(); int second = v.back(); v.pop_back(); nv.second = v.back(); second += v.back(); v.pop_back(); op.push_back(nv); v.push_back(f(second, k)); } if (v[0] == 1) { cout << YES << endl; for (auto w : op) { cout << w.first << << w.second << endl; } return 0; } v = stv; } cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; long double tp, temp, temp2, div; vector<long double> v; map<long double, long long int> mp; string in; double storage; cin >> t; while (t--) { cin >> in; storage = 0; temp = -1; temp2 = -1; for (int a1 = 0; a1 < in.size(); a1++) { if (isdigit(in[a1])) { storage *= 10; storage += in[a1] - 0 ; } else { if (storage != 0) { if (temp == -1) { temp = storage; storage = 0; continue; } else if (temp2 == -1) { temp2 = storage; storage = 0; continue; } } } } div = storage; tp = (temp + temp2) / div; v.push_back(tp); mp[tp]++; } for (int a1 = 0; a1 < v.size(); a1++) { if (a1 != v.size() - 1) cout << mp[v[a1]] << ; else cout << mp[v[a1]] << endl; } }
|
#include <bits/stdc++.h> using namespace std; vector<pair<string, string>>::iterator findit( vector<pair<string, string>>::iterator st, vector<pair<string, string>>::iterator en, string s) { while (st != en) { if ((*st).second == s) { return st; } else { ++st; } } return en; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int q; cin >> q; string old, newi; long long int i; vector<pair<string, string>> v; long long int count = 0; for (i = 0; i < q; ++i) { cin >> old >> newi; vector<pair<string, string>>::iterator it = findit(v.begin(), v.end(), old); if (it == v.end()) { v.push_back(make_pair(old, newi)); count++; } else { (*it).second = newi; } } cout << count << n ; for (i = 0; i < count; ++i) { cout << v[i].first << << v[i].second << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } int last = 0; int ans = 0; string s = ; int l = 0, r = n - 1; while (1) { int k = INT_MAX; if (arr[l] > last) { k = arr[l]; } if (arr[r] > last) { k = min(k, arr[r]); } if (k != arr[l] && k != arr[r]) { break; } ans++; last = k; if (k == arr[r] && k == arr[l]) { int c1 = 0, c2 = 0; for (int i = l + 1; i < r; i++) { if (arr[i] > arr[i - 1]) { c1++; } else { break; } } c1++; c2++; for (int i = r - 1; i > l; i--) { if (arr[i] > arr[i + 1]) { c2++; } else { break; } } ans += max(c1, c2); cout << ans - 1 << endl; cout << s; if (c1 >= c2) { for (int i = 0; i < c1; i++) { cout << L ; } } else { for (int i = 0; i < c2; i++) { cout << R ; } } return 0; } else if (k == arr[r]) { r--; s += R ; } else { l++; s += L ; } if (l > r) { break; } } cout << ans << endl; cout << s; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; if (c <= b / 2 && c <= a / 2) cout << First ; else cout << Second ; }
|
#include <bits/stdc++.h> using namespace std; const long long int N = 1001; long long int n, m, k; vector<pair<long long int, long long int> > adj[N]; vector<long long int> func(long long int x) { vector<long long int> dis(n + 1, INT_MAX); if (x == 0) { return dis; } vector<int> vis(n + 1, 0); set<pair<long long int, long long int> > s; s.insert(make_pair(0, x)); dis[x] = 0; while (!s.empty()) { long long int v = (*s.begin()).second; s.erase(s.begin()); if (vis[v]) { continue; } vis[v] = 1; for (auto u : adj[v]) { if (dis[u.first] > dis[v] + u.second) { dis[u.first] = dis[v] + u.second; s.insert(make_pair(dis[u.first], u.first)); } } } return dis; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> k; vector<pair<pair<long long int, long long int>, long long int> > edges; for (long long int i = 0; i < m; ++i) { long long int a, b, w; cin >> a >> b >> w; adj[a].push_back(make_pair(b, w)); adj[b].push_back(make_pair(a, w)); edges.push_back(make_pair(make_pair(a, b), w)); } vector<pair<long long int, long long int> > queries(k); for (long long int i = 0; i < k; ++i) { cin >> queries[i].first >> queries[i].second; } vector<vector<long long int> > dis; for (long long int i = 0; i <= n; ++i) { dis.push_back(func(i)); } long long int ans = 0; for (long long int i = 0; i < k; ++i) { ans += dis[queries[i].first][queries[i].second]; } for (long long int i = 0; i < m; ++i) { long long int a = edges[i].first.first; long long int b = edges[i].first.second; long long int w = edges[i].second; long long int cost = 0; for (long long int j = 0; j < k; ++j) { long long int x = queries[j].first, y = queries[j].second; long long int price = dis[x][y]; if (dis[x][a] < dis[x][b] && dis[y][a] > dis[y][b]) { price = min(price, dis[x][a] + dis[b][y]); } else if (dis[x][b] < dis[x][a] && dis[y][a] < dis[y][b]) { price = min(price, dis[x][b] + dis[y][a]); } cost += price; } ans = min(ans, cost); } cout << ans; return (0); }
|
#include <bits/stdc++.h> using namespace std; struct node { long long x; long long y; long long id; } a[200005]; long long n, t; long long totx, toty; inline void read(long long &x) { long long f; char c; for (f = 1, c = getchar(); c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (x = 0; c <= 9 && c >= 0 ; c = getchar()) x = x * 10 + (c & 15); x *= f; } inline bool cmp(node p, node q) { return p.y < q.y; } int main() { read(t); while (t--) { totx = toty = 0; read(n); for (int i = 1; i < 2 * n; i++) { read(a[i].x); read(a[i].y); a[i].id = (long long)i; totx += a[i].x; } sort(a + 1, a + 2 * n, cmp); for (int i = 1; i < 2 * n; i += 2) toty += a[i].x; puts( YES ); if (toty * 2 >= totx) { for (int i = 1; i < 2 * n; i += 2) printf( %lld , a[i].id); puts( ); } else { for (int i = 2; i < 2 * n; i += 2) printf( %lld , a[i].id); printf( %lld n , a[2 * n - 1].id); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; vector<vector<int> > G(n + 5, vector<int>(0)); int c[m + 5][2]; memset(c, (0), sizeof(c)); for (int i = 1; i <= m; i++) { int l, r; cin >> l >> r; for (int j = l; j <= r; j++) G[j].push_back(i); } int ans[n + 5]; for (int i = 1; i <= n; i++) { int rs = 0, ls = 0; int put = 0; for (int j = 0; j < int(G[i].size()); j++) { int v = G[i][j]; rs += c[v][0]; ls += c[v][1]; if (rs > ls) put = 1; else put = 0; } ans[i] = put; for (int j = 0; j < int(G[i].size()); j++) { int v = G[i][j]; c[v][put]++; } } for (int i = 1; i <= n; i++) cout << ans[i]; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, r[20], b[20]; char ch[20]; long long dp[(1 << 16)][260]; long long dfs(int bit, int discount) { long long& ret = dp[bit][discount]; if (ret != -1) return ret; if (bit == (1 << n) - 1) { return ret = 0; } ret = 0xffffffffffffff; int Rcard = 0, Bcard = 0, cnt = 0; ; long long Rused = 0, Bused = 0; for (int i = 0; i < n; i++) { if (bit & (1 << i)) { ++cnt; Rused += r[i]; Bused += b[i]; if (ch[i] == R ) ++Rcard; else Bcard++; } } int gap = discount - 120; long long remainR = 0, remainB = 0; if (gap > 0) Rused -= gap; else Bused += gap; if (Rused > Bused) { remainB = Rused - Bused; } else { remainR = Bused - Rused; } for (int i = 0; i < n; i++) { if (!(bit & (1 << i))) { long long maxi = max((long long)(r[i] - Rcard - remainR), (long long)(b[i] - Bcard - remainB)); maxi = max(maxi, (long long)0); long long discountR = min(r[i], Rcard); long long discountB = min(b[i], Bcard); long long go = dfs(bit | (1 << i), discount + discountR - discountB); ret = min(ret, go + maxi); } } return ret; } int main() { memset(dp, -1, sizeof(dp)); scanf( %d , &n); for (int i = 0; i < n; i++) { cin >> ch[i]; scanf( %d %d , &r[i], &b[i]); } long long ans = dfs(0, 120); ans += n; cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i = 0, j = 0, flag = 0, hash[100002] = {0}, stack[100002] = {0}, top = -1; string x; char item; getline(cin, x); n = x.length(); for (i = 0; i < n; i++) { if (x[i] == ( ) { stack[++top] = i; } if (x[i] == ) ) { if (top < 0) { flag = 1; break; } else { item = stack[top]; top--; } } if (x[i] == # ) { hash[j] = i; j++; if (top < 0) { flag = 1; break; } } } if (flag == 1 || stack[top] > hash[j - 1]) { cout << -1 ; return 0; } else { for (i = 0; i < j - 1; i++) { hash[i] = 1; item = stack[top]; top--; } } if (top < 0) cout << -1 ; else { hash[i] = top + 1; for (i = 0; i < j; i++) { cout << hash[i] << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long phi(long long x); const long long mod = 1e9 + 7; int main() { long long N, K; cin >> N >> K; while (K > 0 && N > 1) { N = phi(N); K -= 2; } cout << N % mod << endl; } long long phi(long long x) { int R = sqrt(x); long long ans = 1; for (int p = 2; p <= R; ++p) { if (x % p == 0) { long long curr = 1; while (x % p == 0) { curr *= p; x /= p; } ans *= (curr - curr / p); } } if (x > 1) { ans *= (x - 1); } return ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; string x; cin >> n >> x; string a(n, 0 ), b(n, 0 ); for (long long i = 0; i < n; ++i) { if (x[i] == 1 ) { a[i] = 1 ; b[i] = 0 ; for (int j = i + 1; j < n; ++j) { b[j] = x[j]; } break; } else { a[i] = b[i] = 0 + (x[i] - 0 ) / 2; } } cout << a << endl << b << endl; } }
|
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); } const int INF = 1 << 30; const double eps = 1e-8; const int row = 3000; const int cow = 220; const int MAXN = cow * cow; int n, m; long long a[50000]; long long sum[50000]; char s[5000]; int main() { int i, j, t; long long k; cin >> k; scanf( %s , &s); n = strlen(s); sum[0] = 0; for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + s[i - 1] - 0 ; memset(a, 0, sizeof(a)); for (i = 0; i <= n; i++) { for (j = i + 1; j <= n; j++) { a[sum[j] - sum[i]]++; } } long long ans = 0; if (k == 0) { ans += (a[0] * a[0]); for (i = 1; i < 50000; i++) { ans += (a[0] * a[i] * 2); } } else { for (i = 1; i <= 40000; i++) { if (k % i == 0 && k / i <= 40000) { ans += (a[i] * a[k / i]); } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; signed main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { int n, x, y; cin >> n >> x >> y; vector<int> a(n); for (auto &el : a) { cin >> el; el--; } int need = y - x; vector<vector<int>> where(n + 1); for (int i = 0; i < n; i++) { where[a[i]].push_back(i); } int free = 0; while (where[free].size()) { free++; } set<pair<int, int>, greater<pair<int, int>>> st; for (int i = 0; i < n + 1; i++) { st.insert({where[i].size(), i}); } vector<int> ans(n, free); while (x--) { auto [sz, x] = *st.begin(); st.erase(st.begin()); ans[where[x].back()] = x; where[x].pop_back(); st.insert({sz - 1, x}); } int d = st.begin()->first; vector<pair<int, int>> poses; while (st.size()) { auto [sz, x] = *st.begin(); st.erase(st.begin()); while (where[x].size()) { poses.emplace_back(where[x].back(), x); where[x].pop_back(); } } for (int i = 0; i < poses.size() && need; i++) { int j = (i + d) % poses.size(); if (poses[j].second != poses[i].second) { need--; ans[poses[j].first] = poses[i].second; } } if (need) { cout << NO n ; continue; } cout << YES n ; for (auto &el : ans) { cout << el + 1 << ; } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int M = 2e5 + 10; struct Edge { int u, v, cap, flow = 0; Edge(int u, int v, int cap) : u(u), v(v), cap(cap) {} }; class Dinic { public: vector<Edge> edges; vector<vector<int>> G; int n, m = 0, s, t; vector<int> H, ptr; queue<int> q; Dinic(int n, int s, int t) : n(n), s(s), t(t) { G.resize(n + 1); H = ptr = vector<int>(n + 1); } void add(int u, int v, int cap) { edges.emplace_back(u, v, cap); edges.emplace_back(v, u, 0); G[u].push_back(m++); G[v].push_back(m++); } bool bfs() { while (!q.empty()) { int u = q.front(); q.pop(); for (int v : G[u]) { int to = edges[v].v; int gap = edges[v].cap - edges[v].flow; if (H[to] != -1 or gap < 1) continue; H[to] = H[u] + 1, q.push(to); } } return H[t] != -1; } int dfs(int u, int X) { if (!X) return 0; if (u == t) return X; for (int &i = ptr[u]; i < (int)(G[u]).size(); ++i) { int v = G[u][i], to = edges[v].v; int gap = edges[v].cap - edges[v].flow; if (H[to] != (H[u] + 1) or gap < 1) continue; int Y = dfs(to, min(X, gap)); if (!Y) continue; edges[v].flow += Y; edges[v ^ 1].flow -= Y; return Y; } return 0; } int flow() { int ans = 0; while (true) { fill(H.begin(), H.end(), -1); H[s] = 0, q.push(s); if (!bfs()) break; fill(ptr.begin(), ptr.end(), 0); while (int X = dfs(s, (int)(1e18))) ans += X; } return ans; } }; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<pair<int, pair<int, int>>> edges; vector<int> cand; for (int i = 0; i < m; ++i) { int u, v, w; cin >> u >> v >> w; edges.push_back({w, {u, v}}); cand.push_back(w); } sort((cand).begin(), (cand).end()); cand.erase(unique((cand).begin(), (cand).end()), cand.end()); int lo = 0, hi = (int)(cand).size() - 1, mid, ans = -1; int s = 0, t = 2 * n + 1; while (lo <= hi) { mid = (lo + hi) >> 1; Dinic dinic(2 * n + 2, s, t); for (int i = 1; i <= n; ++i) { dinic.add(s, i, 1); dinic.add(i + n, t, 1); } for (auto [w, p] : edges) if (w <= cand[mid]) dinic.add(p.first, p.second + n, 1); int x = dinic.flow(); if (x == n) hi = mid - 1, ans = cand[mid]; else lo = mid + 1; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; int arr[n + 1]; for (int i = 1; i <= n; i++) { cin >> arr[i]; } int peaks = 0, ind = 1; for (int i = 2; i < k; i++) { if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) peaks++; } int ans = peaks; for (int j = 2; j + k - 1 <= n; j++) { if (arr[j] > arr[j - 1] && arr[j] > arr[j + 1] && ans > 0) ans--; if (arr[j + k - 2] > arr[j + k - 1] && arr[j + k - 2] > arr[j + k - 3]) ans++; if (ans > peaks) { peaks = ans; ind = j; } } cout << peaks + 1 << << ind << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> a[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int x; cin >> x; x--; a[i].push_back(x); } } int ans = 0; for (int j = 0; j < m; j++) { vector<int> cnt(n); int c = 0; for (int i = 0; i < n; i++) { if (a[i][j] % m != j || a[i][j] / m > n) c++; else { if (i >= a[i][j] / m) cnt[i - a[i][j] / m]++; else cnt[i + n - a[i][j] / m]++; } } int mn = 1e9; for (int i = 0; i < n; i++) { mn = min(mn, n - cnt[i] + i); } ans += mn; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int sol = (int)1e9 + 7; int op, lim; int ask(int r, int c) { op++; if (op == lim) { cout << ! << sol << endl; exit(0); } cout << ? << r << << c << endl; int x; cin >> x; sol = min(sol, x); return x; } int go = 1; void solve(int r1, int c1, int r2, int c2) { if (r1 > r2 || c1 > c2) { return; } if (r1 == r2 && c1 == c2) { ask(r1, c1); return; } int rm = (r1 + r2) / 2; vector<int> e; for (int j = max(go, c1); j <= c2; j++) { e.push_back(ask(rm, j)); } int mn = e[0]; for (auto &x : e) mn = min(mn, x); for (int j = c1; j <= c2; j++) if (e[j - c1] == mn) { solve(r1, c1, rm - 1, j); go = max(go, j); solve(rm + 1, j, r2, c2); return; } } int main() { int n, m; cin >> n >> m; lim = 4 * (n + m); solve(1, 1, n, m); cout << ! << sol << endl; }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { map<int, int> set; int n, a, b, check1, check2, temp; cin >> n >> a >> b; int arr[n]; vector<int> check; for (int i = int(0); i <= int(n - 1); i++) { cin >> arr[i]; set[arr[i]] = -1; } if (a == b) { for (int i = int(0); i <= int(n - 1); i++) { if (set[a - arr[i]] == 0) { cout << NO << endl; return 0; } } cout << YES << endl; for (int i = int(0); i <= int(n - 1); i++) { cout << 0 ; } return 0; } for (int i = int(0); i <= int(n - 1); i++) { if (set[arr[i]] != -1) continue; check.clear(); check.push_back(arr[i]); check1 = a - arr[i]; check2 = b - arr[i]; bool f = false; while (!f) { if (set[check1] == -1 && set[check2] == -1) { check.push_back(check1); check.push_back(check2); temp = check1; check1 = a - check2; check2 = b - temp; } else if (set[check1] == -1) { check.push_back(check1); f = 1; for (int i = int(0); i <= int(check.size() - 1); i++) { set[check.at(i)] = 1; } } else if (set[check2] == -1) { check.push_back(check2); f = 1; for (int i = int(0); i <= int(check.size() - 1); i++) { set[check.at(i)] = 2; } } else { cout << NO << endl; return 0; } } } cout << YES << endl; for (int i = int(0); i <= int(n - 1); i++) { cout << set[arr[i]] - 1 << ; } return EXIT_SUCCESS; }
|
#include <bits/stdc++.h> using namespace std; int N, M; int _next[10000000]; struct event { int l, r, x; event() {} event(int l, int r, int x) : l(l), r(r), x(x) {} }; vector<event> e[7005]; inline bool cross(int l1, int r1, int l2, int r2) { if (l1 > r2) return false; if (r1 < l2) return false; return true; } int main() { for (int i = 1; i < (1 << 21) - 1; i++) { _next[i] = 1; } for (int i = 0; i < 21; i++) { _next[1 << i]++; } for (int i = 2; i < (1 << 21) - 1; i++) { _next[i] += _next[i - 1]; } cin >> N; cin >> M; int t, v; int n, l, r, x; for (int i = 0; i < M; i++) { cin >> t; if (t == 1) { cin >> n >> l >> r >> x; e[n].push_back(event(l, r, x)); } else { set<int> S; cin >> n >> v; l = v - 1, r = v; for (int i = n; i <= N; i++) { for (int j = 0; j < e[i].size(); j++) { if (cross(l + 1, r, e[i][j].l, e[i][j].r)) S.insert(e[i][j].x); } l = _next[l], r = _next[r]; } cout << S.size() << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, k; long long count(long long num) { long long ans = 0, sum = num, cnt = 0, hest = 0; while (sum) { hest = sum % 10; sum /= 10; cnt++; } cnt--; long long k = 1; for (long long i = 1; i <= cnt; i++) { ans += k; k *= 10; } if (hest > 1) { ans += k; } else { ans += num - k + 1; } return ans; } double pro(long long l, long long r) { double ans = 0; ans = ((double)(count(r) - count(l - 1))) / ((double)(r - l + 1)); return ans; } long long l, r; double p[1005]; double dp[1005][1005]; int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld%lld , &l, &r); p[i] = pro(l, r); } scanf( %lld , &k); dp[0][0] = 1; for (long long j = 1; j <= n; j++) { dp[0][j] = dp[0][j - 1] * (1.0 - p[j]); } for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { dp[i][j] = dp[i - 1][j - 1] * p[j] + dp[i][j - 1] * (1 - p[j]); } } double ans = 0; for (long long i = (long long)(n * k / 100.0 + 0.999); i <= n; i++) { ans += dp[i][n]; } printf( %.10lf , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { int n, m, k; cin >> n >> m >> k; vector<long long> a(n + 1), pref_a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; pref_a[i] = pref_a[i - 1] + a[i]; } vector<long long> b(m + 1), pref_b(m + 1); for (int i = 1; i <= m; i++) { cin >> b[i]; pref_b[i] = pref_b[i - 1] + b[i]; } vector<int> divs; for (int i = 1; i * 1ll * i <= k; i++) { if (k % i == 0) { divs.push_back(i); if (k / i != i) { divs.push_back(k / i); } } } long long ans = 0; for (int x : divs) { int y = k / x; int lin = 0, col = 0; for (int i = x; i <= n; i++) { if (pref_a[i] - pref_a[i - x] == x) { lin++; } } for (int i = y; i <= m; i++) { if (pref_b[i] - pref_b[i - y] == y) { col++; } } ans += lin * col; } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> clock_t t = clock(); namespace my_std { using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <typename T> inline T rnd(T l, T r) { return uniform_int_distribution<T>(l, r)(rng); } template <typename T> inline bool chkmax(T &x, T y) { return x < y ? x = y, 1 : 0; } template <typename T> inline bool chkmin(T &x, T y) { return x > y ? x = y, 1 : 0; } template <typename T> inline void read(T &t) { t = 0; char f = 0, ch = getchar(); double d = 0.1; while (ch > 9 || ch < 0 ) f |= (ch == - ), ch = getchar(); while (ch <= 9 && ch >= 0 ) t = t * 10 + ch - 48, ch = getchar(); if (ch == . ) { ch = getchar(); while (ch <= 9 && ch >= 0 ) t += d * (ch ^ 48), d *= 0.1, ch = getchar(); } t = (f ? -t : t); } template <typename T, typename... Args> inline void read(T &t, Args &...args) { read(t); read(args...); } char __sr[1 << 21], __z[20]; int __C = -1, __zz = 0; inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; } inline void print(register int x) { if (__C > 1 << 20) Ot(); if (x < 0) __sr[++__C] = - , x = -x; while (__z[++__zz] = x % 10 + 48, x /= 10) ; while (__sr[++__C] = __z[__zz], --__zz) ; __sr[++__C] = n ; } void file() {} inline void chktime() {} long long ksm(long long x, int y) { long long ret = 1; for (; y; y >>= 1, x = x * x) if (y & 1) ret = ret * x; return ret; } } // namespace my_std using namespace my_std; int n, K; vector<int> bl[30100]; int ok[30100]; struct hh { int t, nxt; } edge[30100]; int head[30100], ecnt; void make_edge(int f, int t) { edge[++ecnt] = (hh){t, head[f]}; head[f] = ecnt; } int vis[30100]; int pth[30100], c; void dfs(int x) { for (int &i = head[x], t; (t = i); i = edge[i].nxt) if (!vis[i]) vis[i] = 1, dfs(edge[i].t), pth[++c] = edge[t].t; } int ask(int x) { printf( ? %d n , x); fflush(stdout); char c; cin >> c; return c == Y ; } void add(int id, int flg) { for (int i = (0); i <= (K - 1); i++) ok[bl[id][i]] &= !(flg & ask(bl[id][i])); } void add2(int id, int flg) { int p = -1; for (int i = (K - 1); i >= (0); i--) if (ok[bl[id][i]]) p = i; if (p == -1) { for (int i = (0); i <= (K - 1); i++) ask(bl[id][i]); return; } if (p == 0) { for (int i = (0); i <= (K - 1); i++) if (ok[bl[id][i]]) ok[bl[id][i]] &= !(flg & ask(bl[id][i])); else ask(bl[id][p]); } else { ok[bl[id][p]] &= !(flg & ask(bl[id][p])); for (int i = (1); i <= (p); i++) ask(bl[id][p]); for (int i = (p + 1); i <= (K - 1); i++) if (ok[bl[id][i]]) ok[bl[id][i]] &= !(flg & ask(bl[id][i])); else ask(bl[id][p]); } } void work(int t) { int n = ::n / K; for (int i = (1); i <= (n); i++) for (int j = (i + 1); j <= (n); j++) make_edge(i, j); for (int i = (1); i <= (n / 2); i++) for (int j = (1); j <= (n - 2 * i + 1); j++) make_edge(n - i + 1, i); dfs(1); pth[++c] = 1; reverse(pth + 1, pth + c + 1); --c; add(1, !t); for (int i = (2); i <= (c); i++) t ? add2(pth[i], pth[i] > pth[i - 1]) : add(pth[i], pth[i] > pth[i - 1]); for (int i = (1); i <= (ecnt); i++) vis[i] = 0; c = ecnt = 0; for (int i = (1); i <= (n); i++) head[i] = 0; } int main() { read(n, K); for (int i = (1); i <= (n); i++) ok[i] = 1; for (int i = (1); i <= (n / K); i++) for (int j = ((i - 1) * K + 1); j <= (i * K); j++) bl[i].push_back(j); work(0); for (int i = (1); i <= (n / K); i++) reverse(bl[i].begin(), bl[i].end()); if (K != n) work(1); int ans = 0; for (int i = (1); i <= (n); i++) ans += ok[i]; printf( ! %d n , ans); fflush(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> G(n); for (int i = 0; i < n; i++) { cin >> G[i]; } vector<vector<pair<int, int>>> arr(27, vector<pair<int, int>>()); bool ret_flag = false; bool empty_flag = true; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (G[i][j] == . ) continue; empty_flag = false; auto temp = G[i][j] - a ; if (arr[temp].size() == 1 && !(arr[temp][0].first == i || arr[temp][0].second == j)) { ret_flag = true; break; } else if (arr[temp].size() > 1 && !((arr[temp][0].first == i && arr[temp][arr[temp].size() - 1].first == i) || (arr[temp][0].second == j && arr[temp][arr[temp].size() - 1].second == j))) { ret_flag = true; break; } arr[temp].push_back(make_pair(i, j)); } if (ret_flag) break; } if (empty_flag) { cout << YES << endl; cout << 0 << endl; continue; } if (ret_flag) { cout << NO << endl; continue; } int max_snake = 0; for (int i = 25; i >= 0; i--) { if (arr[i].size() == 0) continue; max_snake = max(max_snake, i); if (arr[i][0].first == arr[i][arr[i].size() - 1].first) { int r = arr[i][0].first; for (int j = arr[i][0].second; j <= arr[i][arr[i].size() - 1].second; j++) { if (G[r][j] - a >= i) continue; ret_flag = true; break; } if (ret_flag) break; } else if (arr[i][0].second == arr[i][arr[i].size() - 1].second) { int c = arr[i][0].second; for (int j = arr[i][0].first; j <= arr[i][arr[i].size() - 1].first; j++) { if (G[j][c] >= a + i) continue; ret_flag = true; break; } if (ret_flag) break; } if (ret_flag) break; } if (ret_flag) { cout << NO << endl; continue; } cout << YES << endl; cout << max_snake + 1 << endl; for (int i = 0; i <= 25; i++) { int j = i; if (arr[i].empty()) { while (i < 26 && arr[i].empty()) i++; } if (i == 26) break; cout << arr[i][0].first + 1 << << arr[i][0].second + 1 << << arr[i].back().first + 1 << << arr[i].back().second + 1 << endl; i = j; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; string a, b; int t; string ssort(string x) { if (x.size() & 1) return x; int len = x.size() / 2; string xx, yy; xx = ssort(x.substr(0, len)); yy = ssort(x.substr(len, len)); if (xx < yy) return xx + yy; else return yy + xx; } signed main() { cin >> a >> b; if (a == b) { printf( YES n ); return 0; } if (ssort(a) == ssort(b)) printf( YES n ); else printf( NO n ); }
|
#include <bits/stdc++.h> using namespace std; int T, n; char s[50]; int a[50], b[50]; int main() { scanf( %d , &T); while (T--) { int cnt = 0; scanf( %d , &n); scanf( %s , s + 1); for (int i = 1; i <= n; ++i) a[i] = s[i] - a , b[i] = a[i]; sort(a + 1, a + n + 1); for (int i = 1; i <= n; ++i) if (a[i] != b[i]) cnt++; cout << cnt << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N_MAX = 1e5, V = (1 << 20); int n, x[N_MAX], t[N_MAX]; struct edge { int l, v; }; vector<edge> G[N_MAX]; long long cnt_tree[V + 1], total_tree[V + 1]; void add(int i, long long a, long long tree[]) { while (i <= V) { tree[i] += a; i += (i & -i); } } long long sum(int i, long long tree[]) { long long s = 0; while (i) { s += tree[i]; i -= (i & -i); } return s; } int ind(long long a, long long tree[]) { int idx = 0, mask = V; a--; while (mask && idx < V) { int t = idx + mask; if (a >= tree[t]) { idx = t; a -= tree[t]; } mask >>= 1; } return idx + 1; } long long T, sol[N_MAX]; void DFS(int v) { add(t[v], x[v], cnt_tree); add(t[v], (long long)x[v] * t[v], total_tree); int i = ind(T, total_tree); if (i > V) sol[v] = sum(V, cnt_tree); else sol[v] = sum(i - 1, cnt_tree) + (T - sum(i - 1, total_tree)) / i; long long m1 = -1, m2 = -1; for (edge e : G[v]) { if (T <= e.l) continue; T -= e.l; DFS(e.v); T += e.l; if (m1 < sol[e.v]) { m2 = m1; m1 = sol[e.v]; } else if (m2 < sol[e.v]) m2 = sol[e.v]; } if (v == 0) sol[v] = max(sol[v], m1); else sol[v] = max(sol[v], m2); add(t[v], -x[v], cnt_tree); add(t[v], -(long long)x[v] * t[v], total_tree); } int main() { ios_base::sync_with_stdio(false); cin >> n >> T; for (int i = 0; i < n; i++) cin >> x[i]; for (int i = 0; i < n; i++) cin >> t[i]; for (int i = 1; i <= n - 1; i++) { int p; edge e; cin >> p >> e.l; e.v = i; e.l *= 2; G[p - 1].push_back(e); } DFS(0); cout << sol[0] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1100; const int M = 256; const int K = 26; const int INF = 2000000000; const double eps = 1e-12; int k, m, n, d[K], a[N]; char s[N]; bool ok; int F(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; k = 1; for (int i = 0; i < 26; i++) d[i] = k, k <<= 1; for (int i = 0; i < n; i++) { cin >> s; m = 0; for (int j = 0; s[j]; j++) m = m | d[s[j] - a ]; a[i] = m; } sort(a, a + n); m = 1; for (int i = 1; i < n; i++) if (a[i] != a[i - 1]) m++; cout << m; return 0; } int F() { return 0; }
|
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } int main() { long long test, n, a[55], b[55]; scanf( %lld , &test); while (test--) { scanf( %lld , &n); long long mina = 1000000000; long long minb = 1000000000; for (long long i = 0; i < n; i++) { scanf( %lld , &a[i]); mina = min(a[i], mina); } for (long long i = 0; i < n; i++) { scanf( %lld , &b[i]); minb = min(b[i], minb); } long long ans = 0; for (long long i = 0; i < n; i++) { long long p = a[i] - mina; long long q = b[i] - minb; ans += min(p, q); ans += (p - min(p, q)) + (q - min(p, q)); } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100001], p[100001]; int main() { int min = 1000, sum = 0, n, i, j; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d %d , &a[i], &p[i]); if (p[i] < min) { min = p[i]; } sum += a[i] * min; } printf( %d n , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; const long long MOD = 1e9 + 7; long long n, m, connected = 0; long long col[N], vis[N]; vector<pair<long long, long long> > g[N]; long long pow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } void dfs(long long k, long long c) { if (vis[k]) { if (col[k] != c) { cout << 0 ; exit(0); } return; } vis[k] = 1; col[k] = c; for (auto &it : g[k]) { dfs(it.first, c ^ (1 - it.second)); } } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n >> m; for (long long i = 1; i <= m; i++) { long long u, v, t; cin >> u >> v >> t; g[u].push_back({v, t}); g[v].push_back({u, t}); } for (long long i = 1; i <= n; i++) { if (!vis[i]) { dfs(i, 0); connected++; } } long long ans = pow(2LL, connected - 1, MOD); cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 510000; int n; int sz[MAXN]; int was[MAXN]; int up[MAXN]; vector<int> eds[MAXN]; int ans[MAXN]; void dfs1(int v) { sz[v] = 1; was[v] = 1; for (int u : eds[v]) { if (!was[u]) { dfs1(u); sz[v] += sz[u]; } } } void dfs2(int v) { was[v] = 1; up[v] = 0; if (sz[v] * 2 <= n) up[v] = sz[v]; for (int u : eds[v]) { if (!was[u]) { dfs2(u); up[v] = max(up[v], up[u]); } } } void dfs3(int v, int now) { ans[v] = 1; was[v] = 1; if ((n - sz[v]) * 2 <= n) now = max(now, n - sz[v]); if ((n - sz[v] - now) * 2 > n) ans[v] = 0; int mx1 = 0; int mx2 = 0; for (int u : eds[v]) { if (!was[u]) { mx2 = max(mx2, up[u]); if (mx2 > mx1) swap(mx1, mx2); } } for (int u : eds[v]) { if (!was[u]) { if ((sz[u] - up[u]) * 2 > n) ans[v] = 0; int go = now; if (up[u] == mx1) go = max(now, mx2); else go = max(now, mx1); dfs3(u, go); } } } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; ++i) { int a, b; scanf( %d%d , &a, &b); --a; --b; eds[a].push_back(b); eds[b].push_back(a); } dfs1(0); memset(was, 0, sizeof(was)); dfs2(0); memset(was, 0, sizeof(was)); dfs3(0, 0); for (int i = 0; i < n; ++i) printf( %d , ans[i]); printf( n ); return 0; }
|
#include <bits/stdc++.h> void print_row(int s, int *l, int size) { int i = s + 1; printf( %d , l[s]); while (i < size) printf( %d , l[i++]); i = 0; while (i < s) printf( %d , l[i++]); printf( n ); } int main() { int n, k; scanf( %d %d , &n, &k); int l[n]; l[0] = k; for (int i = 1; i < n; i++) l[i] = 0; for (int i = 0; i < n; i++) print_row(i, l, n); return 0; }
|
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } int ara[55][55]; void solve() { int n; cin >> n; vector<pair<int, int> > odds; map<pair<int, int>, int> done; for (int i = 1; i <= n; i++) { odds.push_back({i, n / 2 + 1}); done[{i, n / 2 + 1}] = 1; } for (int j = 1; j <= n; j++) { if (!done[{n / 2 + 1, j}]) odds.push_back({n / 2 + 1, j}); done[{n / 2 + 1, j}] = 1; } for (int k = 1; k <= n / 2; k++) { int i = k; int j = 1; while (i < n && j < n) { if (!done[{i, j}]) { odds.push_back({i, j}); done[{i, j}] = 1; } if (!done[{i, n - j + 1}]) { odds.push_back({i, n - j + 1}); done[{i, n - j + 1}] = 1; } if (!done[{n - i + 1, j}]) { odds.push_back({n - i + 1, j}); done[{n - i + 1, j}] = 1; } if (!done[{n - i + 1, n - j + 1}]) { odds.push_back({n - i + 1, n - j + 1}); done[{n - i + 1, n - j + 1}] = 1; } i++; j++; } } for (int i = 0, k = 1; k <= n * n; k += 2, i++) { int x = odds[i].first; int y = odds[i].second; ara[x][y] = k; } for (int i = 1, k = 2; i <= n; i++) { for (int j = 1; j <= n; j++) { if (!ara[i][j]) { ara[i][j] = k; k += 2; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) cout << ara[i][j] << ; cout << n ; } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; for (int i = 1; i <= t; i++) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long k, l, ans = 0; cin >> k >> l; while (l % k == 0) { l = l / k; if (l != 1) ans++; } if (l == 1) cout << YES << endl << ans; else cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; int n, w, used[300005]; long long ans, a[300005], b[300005]; priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > Q1, Q2; priority_queue<pair<long long, int>, vector<pair<long long, int> >, less<pair<long long, int> > > Used; int main() { scanf( %d %d , &n, &w); for (int i = 1; i <= n; i++) { scanf( %lld %lld , &a[i], &b[i]); Q1.push(make_pair(a[i], i)); Q2.push(make_pair(b[i], i)); } if (w == 1) { pair<long long, int> x = Q1.top(); ans = x.first; used[x.second]++; printf( %lld n , ans); for (int i = 1; i <= n; i++) printf( %d , used[i]); return 0; } while (w > 0 && !Q1.empty() && !Q2.empty()) { pair<long long, int> x = Q1.top(); if (used[abs(x.second)] == 2) { Q1.pop(); continue; } pair<long long, int> y = Q2.top(); if (used[y.second]) { Q2.pop(); continue; } if (x.first * 2 <= y.first) { int now = x.second; w--; ans += x.first; Q1.pop(); if (now > 0) Q1.push(make_pair(b[now] - a[now], -now)); used[abs(now)]++; Used.push(make_pair(x.first, abs(now))); } else { int now = y.second; w--, w--; ans += y.first; Q2.pop(); used[now] = 2; Used.push(make_pair(b[now] - a[now], now)); } } while (w > 0 && !Q1.empty()) { pair<long long, int> x = Q1.top(); if (used[abs(x.second)] == 2) { Q1.pop(); continue; } int now = x.second; w--; ans += x.first; Q1.pop(); if (now > 0) Q1.push(make_pair(b[now] - a[now], -now)); used[abs(now)]++; Used.push(make_pair(x.first, abs(now))); } while (w > 0 && !Q2.empty()) { pair<long long, int> y = Q2.top(); if (used[y.second]) { Q2.pop(); continue; } int now = y.second; w--, w--; ans += y.first; Q2.pop(); used[now] = 2; Used.push(make_pair(b[now] - a[now], now)); } if (w == -1) { pair<long long, int> x = Used.top(); ans -= x.first; used[x.second]--; } int f = 1; while (f) { f = 0; while (!Q1.empty()) Q1.pop(); while (!Used.empty()) Used.pop(); for (int i = 1; i <= n; i++) { if (used[i] == 2) Used.push(make_pair(b[i], i)); else if (used[i] == 1) Q1.push(make_pair(b[i] - a[i], i)); else Q1.push(make_pair(a[i], i)); } if (Q1.size() < 2 || Used.empty()) break; pair<long long, int> x = Q1.top(); Q1.pop(); pair<long long, int> y = Q1.top(); Q1.pop(); pair<long long, int> z = Used.top(); Used.pop(); if (x.first + y.first < z.first) { ans = ans - (z.first - x.first - y.first); used[x.second]++; used[y.second]++; used[z.second] = 0; f = 1; } } printf( %lld n , ans); for (int i = 1; i <= n; i++) printf( %d , used[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const int MOD = 998244353; struct node { long long a, b; node() {} node(long long a, long long b) { this->a = a; this->b = b; } node operator+(const node& rhs) const { return node((a + rhs.a) % MOD, (b + rhs.b) % MOD); } node operator*(const node& rhs) const { return node(a * rhs.a % MOD, b * rhs.b % MOD); } bool operator==(const node& rhs) const { return a == rhs.a && b == rhs.b; } }; node BASE(2333, 233333); node h[maxn]; node ALL(0, 0); node s[maxn][15]; vector<pair<int, int> > vec[maxn]; int n, m, k, ans; void dfs(int u, node hh) { if (u > k) { ans += (hh == ALL ? 1 : 0); return; } for (int i = 0; i < u; i++) { node v = hh + s[u][i]; dfs(u + 1, v); } return; } int main() { scanf( %d%d%d , &n, &m, &k); h[0] = node(1, 1); for (int i = 1; i <= n; i++) { h[i] = h[i - 1] * BASE; ALL = ALL + h[i]; } for (int i = 1; i <= m; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); vec[u].emplace_back(make_pair(v, w)); } for (int i = 1; i <= n; i++) { sort(vec[i].begin(), vec[i].end(), [](pair<int, int> a, pair<int, int> b) { return a.second < b.second; }); int lens = vec[i].size(); for (int j = 0; j < lens; j++) s[lens][j] = s[lens][j] + h[vec[i][j].first]; } dfs(1, node(0, 0)); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m = 1; vector<vector<int> > edge(105); int from[105]; int to[105]; bool bfs(int a, int b) { int use[105] = {0}; queue<int> q; q.push(a); use[a] = 1; while (!q.empty()) { int cur = q.front(); q.pop(); for (int i = 0; i < edge[cur].size(); i++) { if (edge[cur][i] == b) return true; if (use[edge[cur][i]] == 0) { q.push(edge[cur][i]); use[edge[cur][i]] = 1; } } } return false; } int main() { cin >> n; for (int i = 0; i < n; i++) { int t, x, y; cin >> t >> x >> y; if (t == 1) { from[m] = x; to[m] = y; for (int j = 1; j < m; j++) { if ((from[j] < x && x < to[j] && y >= to[j]) || (from[j] < y && y < to[j]) && x <= from[j]) { edge[j].push_back(m); edge[m].push_back(j); } else if (x <= from[j] && y >= to[j]) { edge[j].push_back(m); } } m++; } else { if (bfs(x, y)) cout << YES << endl; else cout << NO << endl; } } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) using namespace std; const int N = 1e6 + 5; int n, p = 1, pa[N]; int ch[N][26]; vector<int> cnt[N][2]; vector<pair<int, int> > as; long long ans; inline void dfs(int u, int dep) { for (register int i = 0; i <= 25; ++i) { int v = ch[u][i]; if (v) { dfs(v, dep + 1); for (register int j = 0; j < cnt[v][0].size(); ++j) cnt[u][0].push_back(cnt[v][0][j]); for (register int j = 0; j < cnt[v][1].size(); ++j) cnt[u][1].push_back(cnt[v][1][j]); } } ans += min(cnt[u][0].size(), cnt[u][1].size()) * dep; for (register int i = min(cnt[u][0].size(), cnt[u][1].size()) - 1; i > -1; --i) { as.push_back( {cnt[u][0][cnt[u][0].size() - 1], cnt[u][1][cnt[u][1].size() - 1]}); cnt[u][0].pop_back(); cnt[u][1].pop_back(); } } string a; int main() { cin >> n; for (register int id = 1; id <= n; ++id) { cin >> a; int u = 1; for (register int i = 0; i < a.size(); ++i) { int c = a[i] - a ; if (ch[u][c] == 0) ch[u][c] = ++p; u = ch[u][c]; } cnt[u][0].push_back(id); } for (register int id = 1; id <= n; ++id) { cin >> a; int u = 1; for (int i = 0; i < a.size(); ++i) { int c = a[i] - a ; if (!ch[u][c]) ch[u][c] = ++p; u = ch[u][c]; } cnt[u][1].push_back(id); } dfs(1, 0); printf( %d n , ans); for (register int i = 0; i <= n - 1; ++i) printf( %d %d n , as[i].first, as[i].second); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; char a[105][3]; int main() { scanf( %s%d , a[0], &n); for (int i = 1; i <= n; ++i) { scanf( %s , a[i]); if (a[i][0] == a[0][0] && a[i][1] == a[0][1]) { printf( YES n ); return 0; } } for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) if ((a[i][1] == a[0][0] && a[j][0] == a[0][1])) { printf( YES n ); return 0; } printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int T, n, a[N]; map<int, int> mp; int main() { cin >> T; while (T--) { double sum = 0; mp.clear(); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; sum += a[i]; } double mean = sum / n; double need = sum - (n - 2) * mean; if (need != floor(need)) { cout << 0 << endl; continue; } long long ans = 0; for (int i = 0; i < n; ++i) { if (mp.find(need - a[i]) != mp.end()) ans += mp[need - a[i]]; mp[a[i]]++; } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool isPrime(int num); int main() { int n; cin >> n; for (int i = 1; i <= 1000; i++) { if (!(isPrime(n * i + 1))) { cout << i; break; } } return 0; } bool isPrime(int num) { if (num <= 1) return false; else if (num == 2) return true; else if (num % 2 == 0) return false; else { bool prime = true; int divisor = 3; double num_d = static_cast<double>(num); int upperLimit = static_cast<int>(sqrt(num_d) + 1); while (divisor <= upperLimit) { if (num % divisor == 0) prime = false; divisor += 2; } return prime; } }
|
#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 5; int dp[mx][3], arr[mx], n, h[mx]; void solve() { cin >> n; for (int i = 1; i <= n; i++) { cin >> arr[i]; h[arr[i]]++; } sort(arr, arr + n + 1); memset(dp, 0, sizeof dp); dp[1][0] = dp[1][1] = dp[1][2] = 1; for (int i = 2; i <= n; i++) { if (arr[i] - arr[i - 1] > 2) { dp[i][1] = dp[i][2] = dp[i][0] = min(dp[i - 1][0], min(dp[i - 1][1], dp[i - 1][2])) + 1; } else if (arr[i] - arr[i - 1] == 2) { dp[i][0] = min(dp[i - 1][0] + 1, min(dp[i - 1][1] + 1, dp[i - 1][2])); dp[i][1] = dp[i][2] = min(dp[i - 1][0], min(dp[i - 1][1], dp[i - 1][2])) + 1; } else if (arr[i] - arr[i - 1] == 1) { dp[i][0] = min(dp[i - 1][0] + 1, min(dp[i - 1][1], dp[i - 1][2] + 1)); dp[i][1] = min(dp[i - 1][0] + 1, min(dp[i - 1][1] + 1, dp[i - 1][2])); dp[i][2] = min(dp[i - 1][0] + 1, min(dp[i - 1][1] + 1, dp[i - 1][2] + 1)); } else { dp[i][0] = min(dp[i - 1][0], min(dp[i - 1][1] + 1, dp[i - 1][2] + 1)); dp[i][1] = min(dp[i - 1][0] + 1, min(dp[i - 1][1], dp[i - 1][2] + 1)); dp[i][2] = min(dp[i - 1][0] + 1, min(dp[i - 1][1] + 1, dp[i - 1][2])); } } cout << min(dp[n][0], min(dp[n][1], dp[n][2])) << ; set<int> s; for (int i = 0; i < mx; i++) { if (h[i] > 0) { int t = min(3, h[i]); int x = i - 1; if (s.find(x) == s.end()) { s.insert(x); h[i]--; } x++; if (h[i] > 0) { if (s.find(x) == s.end()) { s.insert(x); h[i]--; } } x++; if (h[i] > 0) { if (s.find(x) == s.end()) { s.insert(x); h[i]--; } } } } cout << s.size(); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ; int t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const double esp = 1e-7; const int mod = 1e9 + 7; vector<int> adj[N]; int leaf = 0; void dfs(int node = 1, int par = 0) { int cnt = 0; for (int child : adj[node]) { if (child == par) continue; dfs(child, node); cnt++; } if (!cnt) { leaf++; } } int main() { int n, s, u, v; double ans; scanf( %d %d , &n, &s); for (int i = 1; i < n; i++) { scanf( %d %d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } dfs(); if (adj[1].size() == 1) leaf++; if (n == 2) { leaf = 1; ans = s; } else { ans = 2.0 * s / double(leaf); } printf( %.09f n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cout << *it << = << a << endl; err(++it, args...); } const long long MOD = 1e9 + 7; long long modExp(long long b, long long p) { long long res = 1; while (p > 0) { if (p & 1) { res = (res * b) % MOD; } b = (b * b) % MOD; p >>= 1; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; long long ans = 1; for (int i = 1; i <= n; i++) { ans = ((2 * m - 1) * ans + modExp(m, i - 1)) % MOD; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int k = 1; k <= n / 3; k++) { if (n % k == 0) { for (int p = 0; p < k; p++) { int sum = 0; for (int v = p; v < n; v += k) { if (a[v] == 1) sum++; } if (sum == n / k) { cout << YES n ; return 0; } } } } cout << NO n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); template <class T> long long chkmin(T &a, T b) { return a > b ? a = b, 1 : 0; } template <class T> long long chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; } template <class T> T sqr(T a) { return a * a; } template <class T> T mmin(T a, T b) { return a < b ? a : b; } template <class T> T mmax(T a, T b) { return a > b ? a : b; } template <class T> T aabs(T a) { return a < 0 ? -a : a; } template <class T> long long dcmp(T a, T b) { return a > b; } template <long long *a> long long cmp_a(long long first, long long second) { return a[first] < a[second]; } namespace io { const long long SIZE = (1 << 21) + 1; char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; long long f, qr; inline void flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; } inline void putc(char first) { *oS++ = first; if (oS == oT) flush(); } inline bool read(signed &first) { for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++); c < 0 || c > 9 ; c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) if (c == - ) f = -1; else if (c == EOF) return 0; for (first = 0; c <= 9 && c >= 0 ; c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) first = first * 10 + (c & 15); first *= f; return 1; } inline bool read(long long &first) { for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++); c < 0 || c > 9 ; c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) if (c == - ) f = -1; else if (c == EOF) return 0; for (first = 0; c <= 9 && c >= 0 ; c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) first = first * 10 + (c & 15); first *= f; return 1; } inline bool read(char &first) { first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++); return first != EOF; } inline bool read(char *first) { while ((*first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)) == n || *first == || *first == r ) if (*first == EOF) return 0; while (!(*first == n || *first == || *first == r || *first == EOF)) *(++first) = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++); *first = 0; return 1; } template <typename A, typename... B> inline bool read(A &first, B &...second) { return read(first) && read(second...); } inline bool write(signed first) { if (!first) putc( 0 ); if (first < 0) putc( - ), first = -first; while (first) qu[++qr] = first % 10 + 0 , first /= 10; while (qr) putc(qu[qr--]); return 0; } inline bool write(long long first) { if (!first) putc( 0 ); if (first < 0) putc( - ), first = -first; while (first) qu[++qr] = first % 10 + 0 , first /= 10; while (qr) putc(qu[qr--]); return 0; } inline bool write(char first) { putc(first); return 0; } inline bool write(const char *first) { while (*first) { putc(*first); ++first; } return 0; } inline bool write(char *first) { while (*first) { putc(*first); ++first; } return 0; } template <typename A, typename... B> inline bool write(A first, B... second) { return write(first) || write(second...); } struct Flusher_ { ~Flusher_() { flush(); } } io_flusher_; } // namespace io using io ::putc; using io ::read; using io ::write; long long inf; struct _init_ { _init_() { memset(&inf, 0x3f, sizeof(inf)); } }; _init_ ___INIT__; long long a[20005], b[20005]; long long f[40005], beg[20005]; vector<long long> poly[40005]; long long t; const long long p = 998244353, g = 3; long long rev[1 << 18]; long long fpm(long long a, long long b) { long long c = 1; for (; b; b >>= 1, a = a * a % p) if (b & 1) c = c * a % p; return c; } void NTT(vector<long long> &a, long long n, long long flg) { for (long long i = 0; i < n; ++i) { rev[i] = (rev[i >> 1] >> 1) | ((i & 1) * (n >> 1)); if (i < rev[i]) swap(a[i], a[rev[i]]); } for (long long i = 1; i < n; i <<= 1) { long long ww = fpm(g, (p - 1) / i / 2 * (flg + p - 1)), w; for (long long j = 0; j < n; j += i + i) { w = 1; for (long long k = 0; k < i; ++k) { long long u = a[j + k], v = a[j + k + i] * w % p; a[j + k] = (u + v) % p; a[j + k + i] = (u - v + p) % p; w = w * ww % p; } } } if (flg == -1) { long long in = fpm(n, p - 2); for (long long i = 0; i < n; ++i) a[i] = a[i] * in % p; } } void Prod(vector<long long> &a, vector<long long> &b, vector<long long> &c) { long long first = a.size() + b.size(), n = 1; while (n < first) n <<= 1; a.resize(n); b.resize(n); c.resize(n); NTT(a, n, 1); NTT(b, n, 1); for (long long i = 0; i < n; ++i) c[i] = a[i] * b[i] % p; NTT(c, n, -1); c.resize(first - 1); a.clear(); b.clear(); } long long query(long long k) { long long l = 1; while (l < t) { Prod(poly[l], poly[l + 1], poly[++t]); l += 2; } return poly[t][k]; } signed main() { long long n, k; read(n, k); for (long long i = 1; i <= n; ++i) read(a[i]); long long q; long long tp, first, l, r, d; read(q); for (; q; --q) { read(tp, first, l); if (tp == 1) { read(d); for (long long i = 1; i <= n; ++i) { poly[i].clear(); poly[i].push_back(1); poly[i].push_back((first - (i == l ? d : a[i]) + 2 * p) % p); } } else { read(r, d); for (long long i = 1; i <= n; ++i) { poly[i].clear(); poly[i].push_back(1); poly[i].push_back((first - a[i] + 2 * p) % p); } for (long long i = l; i <= r; ++i) poly[i][1] = (poly[i][1] + 2 * p - d) % p; } t = n; write(query(k), n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int Popcount(long long int a) { int k; for (k = 0; a; a >>= 1) if (a & 1ll) k++; return k; } int Ffs(long long int a) { int k; for (k = 0; a; a >>= 1, k++) ; return k; } long long int C[50][50]; long long int getAns(long long int n, long long int t) { if (n < t || t <= 0) return 0ll; long long int i; int k = 0, j = Ffs(t) - 1; for (i = 1ll; (i << 1) < n; (i <<= 1), k++) ; long long int res = getAns(n - i, t >> 1); if (k < j) return res; return C[k][j] + res; } int main() { C[0][0] = 1ll; for (int i = 1; i < 50; i++) { C[i][0] = C[i][i] = 1ll; for (int j = 1; j < i; j++) C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; } long long int N, T; while (cin >> N >> T) { N++; if (Popcount(T) != 1) { puts( 0 ); continue; } long long int Ans = 0ll, x, di = 0ll; for (x = 1ll; x + di <= N; x <<= 1) { Ans += getAns(x, T); di += x; } Ans += getAns(N - di, T); if (T == 1ll) Ans--; cout << Ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct BIT { vector<int> t; int n; void add(int x, int v) { for (; x < n; x += x & -x) { t[x] += v; } } BIT(int sz) { t = vector<int>(sz); n = sz; } void add(int l, int r, int v) { ++l; ++r; add(l, v); add(r, -v); } int query(int x) { ++x; int ans = 0; for (; x; x -= x & -x) { ans += t[x]; } return ans; } }; const int N = 100100; vector<BIT> bits; vector<int> adj[N]; int my_bit[N], my_ind[N], n, q; int dfs(int u, int p, int bit_ind, int ind) { my_bit[u] = bit_ind; my_ind[u] = ind; int res = ind; for (auto& v : adj[u]) { if (v == p) continue; res = dfs(v, u, bit_ind, ind + 1); } return res; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> n >> q; int u, v; for (int i = 1; i <= n - 1; ++i) { cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } bits.emplace_back(1); int mx = 5; for (int v : adj[1]) { int amt = dfs(v, 1, bits.size(), 2); bits.emplace_back(amt + 5); mx = max(mx, amt + 5); } BIT all(mx); my_ind[1] = 1; for (int qq = 0; qq < q; ++qq) { int type; cin >> type; if (type == 0) { int x, d; cin >> u >> x >> d; if (u == 1) { all.add(1, 2 + d, x); } else { int extra = 0; int lo = my_ind[u] - d; int hi = my_ind[u] + d + 1; if (lo < 2) { extra = 2 - lo; lo = extra + 1; } bits[my_bit[u]].add(lo, hi, x); if (extra) { all.add(1, extra + 1, x); } } } else if (type == 1) { cin >> u; int res = all.query(my_ind[u]); if (u != 1) { assert(my_ind[u] > 1); res += bits[my_bit[u]].query(my_ind[u]); } cout << res << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; using lli = long long int; using pii = pair<int, int>; using vi = vector<int>; using vb = vector<bool>; using vvi = vector<vector<int>>; using vlli = vector<long long int>; using vpii = vector<pair<int, int>>; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); lli n, k, a, x[100005], c[100005], money = 0; multiset<lli> unused; cin >> n >> k; for (int i = 1; i <= n; i++) cin >> x[i]; cin >> a; for (int i = 1; i <= n; i++) cin >> c[i]; for (int i = 1; i <= n; i++) { unused.insert(c[i]); while (!unused.empty() && k < x[i]) { auto temp = unused.begin(); k += a; money += *temp; unused.erase(temp); } if (k < x[i]) return cout << -1, 0; } cout << money; }
|
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) const int N = 1e6 + 5, M = 300, MAX = 10, T = 3e4, INF = 1e9; int d[N], w[T], dist[300][M + 5]; vector<int> h[T], pr; vector<vector<int>> v; map<vector<int>, int> mp; int cnt = 0; vector<int> path; void f(int max, int prod, int ct) { v.push_back(path); pr.push_back(prod); mp[path] = cnt++; if (ct == MAX) return; for (int i = 2; i <= max; i++) { if (prod * i <= M) { path.push_back(i); f(i, prod * i, ct + 1); path.pop_back(); } } } vector<int> getV(int a) { vector<int> g; while (a > 1) { int x = 0, y = d[a]; while (d[a] == y) { a /= d[a]; x++; } g.push_back(x + 1); } sort(g.rbegin(), g.rend()); return g; } int main() { f(M, 1, 0); map<vector<int>, int> g; for (int i = 2; i < N; i++) { if (!d[i]) { d[i] = i; for (long long int j = i * (long long int)i; j < N; j += i) { if (!d[j]) d[j] = i; } } } for (int i = 1; i < N; i++) { vector<int> t = getV(i); if (!g.count(t)) { int x = g.size(); g[t] = x; } } for (int i = 0; i < v.size(); i++) { vector<int> &c = v[i]; for (int j = 0; j < c.size(); j++) { if (j == 0 || c[j - 1] != c[j]) { c[j]++; if (mp.count(c)) { h[i].push_back(mp[c]); h[mp[c]].push_back(i); } c[j]--; } } if (c.size() < MAX) { c.push_back(2); if (mp.count(c)) { h[i].push_back(mp[c]); h[mp[c]].push_back(i); } c.pop_back(); } } for (int i = 0; i < 300; i++) { for (int j = 0; j <= M; j++) { dist[i][j] = INF; } } for (auto &p : g) { fill(w, w + T, -1); queue<int> q; w[mp[p.first]] = 0; q.push(mp[p.first]); while (!q.empty()) { int node = q.front(); q.pop(); for (int to : h[node]) { if (w[to] == -1) { w[to] = w[node] + 1; q.push(to); } } } for (int j = 0; j < v.size(); j++) { dist[p.second][pr[j]] = min(dist[p.second][pr[j]], w[j]); } } int q; scanf( %d , &q); while (q--) { int a, b; scanf( %d%d , &a, &b); a = g[getV(a)]; b = g[getV(b)]; int ans = INF; for (int i = 0; i <= M; i++) ans = min(ans, dist[a][i] + dist[b][i]); printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; inline int min(const int& x, const int& y) { return (x - y >> 31) ? x : y; } namespace ST { int lg[N], t[20][N]; inline void build(int* a, int n) { copy(a + 1, a + 1 + n, t[0] + 1); for (int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1; for (int i = 1; i <= 19; i++) for (int j = 1; j <= n - (1 << i); j++) t[i][j] = min(t[i - 1][j], t[i - 1][j + (1 << i - 1)]); } inline int ask(int l, int r) { int p = lg[r - l]; return min(t[p][l], t[p][r - (1 << p)]); } } // namespace ST namespace SA { int n, m, sa[N], x[N], y[N], c[N], h[N]; char* st; inline void input(char* a, int len) { n = len, m = 128, st = a; for (int i = 1; i <= n; i++) x[i] = st[i], sa[i] = i; } inline void radix_sort() { for (int i = 1; i <= m; i++) c[i] = 0; for (int i = 1; i <= n; i++) c[x[i]]++; for (int i = 1; i <= m; i++) c[i] += c[i - 1]; for (int i = n; i >= 1; i--) sa[c[x[y[i]]]--] = y[i]; } inline void init() { for (int k = 0, p = 0; k <= n; k = k << 1 | !k) { for (int i = n - k + 1; i <= n; i++) y[++p] = i; for (int i = 1; i <= n; i++) if (sa[i] > k) y[++p] = sa[i] - k; radix_sort(), swap(x, y), p = 0; for (int i = 1; i <= n; i++) x[sa[i]] = p += y[sa[i]] != y[sa[i - 1]] || y[sa[i] + k] != y[sa[i - 1] + k]; if (p >= n) break; m = p, p = 0; } for (int i = 1; i <= n; i++) { int& p = h[x[i]] = max(0, h[x[i - 1]] - 1); while (st[i + p] == st[sa[x[i] + 1] + p]) h[x[i]]++; } ST::build(h, n); } } // namespace SA struct tree { set<int> mp; long long int val; inline void init() { mp.clear(), mp.insert(0), mp.insert(N), val = 0; } inline int pre(int x) { return *--mp.lower_bound(x); } inline int nxt(int x) { return *mp.upper_bound(x); } inline void add(int x, int y, int w) { if (x && y != N) val += ST::ask(x, y) * w; } inline void ins(int x) { int p = pre(x), q = nxt(x); add(p, q, 1), add(p, x, -1), add(x, q, -1), mp.insert(x); } } t[N]; namespace SAM { int n, tot, last, top; int fa[N], len[N], ch[N][26], d[N], sta[N], pos[N]; inline void cpy(int x, int y) { for (int i = 0; i <= 25; i++) ch[x][i] = ch[y][i]; } inline void ins(int x) { int p(last), np, q, nq; len[np = last = ++tot] = len[p] + 1; while (p && !ch[p][x]) ch[p][x] = np, p = fa[p]; if (!p) return void(fa[np] = 1); if (len[q = ch[p][x]] == len[p] + 1) return void(fa[np] = q); cpy(nq = ++tot, q), len[nq] = len[p] + 1, fa[nq] = fa[q], fa[q] = fa[np] = nq; while (p && ch[p][x] == q) ch[p][x] = nq, p = fa[p]; } inline void input(char* a, int len) { n = len, tot = last = pos[0] = 1; for (int i = 1; i <= n; i++) ins(a[i] - a ), pos[i] = last; } inline void merge(tree& x, tree& y) { if (x.mp.size() < y.mp.size()) swap(x, y); for (int v : y.mp) if (v && v != N) x.ins(v), x.val += n - SA::sa[v] + 1; } inline void work() { long long int ans = 0; for (int i = 0; i <= tot; i++) d[fa[i]]++, t[i].init(); for (int i = 1; i <= tot; i++) if (!d[i]) sta[++top] = i; for (int i = 0; i <= n - 2; i++) t[pos[i]].ins(SA::x[i + 2]), t[pos[i]].val += n - i - 1; for (int i = 1; i <= tot; i++) ans += len[i] - len[fa[i]] << (i != pos[n]); while (int u = sta[top--]) { ans += t[u].val * (len[u] - len[fa[u]]); if (fa[u]) merge(t[fa[u]], t[u]); if (!--d[fa[u]]) sta[++top] = fa[u]; } cout << ans + t[1].val + 2; } }; // namespace SAM int n; char a[N]; int main() { scanf( %s , a + 1), n = strlen(a + 1), SA::input(a, n); SA::init(), SAM::input(a, n), SAM::work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[2 * 1000005]; int n; int input() { int i; scanf( %d , &n); for (i = 1; i <= n; i++) p[i] = i; return 0; } int solve() { int i, j, ii; int t1, t2; for (i = 2; i <= n; i++) { t1 = p[i - 1]; for (j = i + i - 1; j < n + i - 1; j += i) { t2 = p[j]; p[j] = t1; t1 = t2; } p[n + i - 1] = t1; } return 0; } int output() { int i; for (i = n; i < n + n; i++) printf( %d , p[i]); printf( n ); return 0; } int main() { input(); solve(); output(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int C[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, r; cin >> n >> r; double sum = 0; for (int i = 0; i < (1 << n); i++) { cin >> C[i]; sum += C[i]; } cout << setprecision(15) << fixed << sum / (1 << n) << n ; while (r--) { int z, g; cin >> z >> g; sum += g - C[z]; C[z] = g; cout << setprecision(15) << fixed << sum / (1 << n) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 7; long long a[maxn], b[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; a[i] ^= b[i], b[i] ^= b[i - 1]; } vector<long long> linbs; for (int i = 1; i <= n; i++) { long long temp = a[i]; for (auto &e : linbs) temp = min(temp, temp ^ e); if (temp) { for (auto &e : linbs) e = min(e, e ^ temp); linbs.push_back(temp); } } for (auto &e : linbs) b[n] = min(b[n], b[n] ^ e); if (b[n]) cout << 1 << / << 1 << endl; else { int sz = linbs.size(); long long t1 = 1ll << sz, t2 = t1 - 1; cout << t2 << / << t1 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; void __print(long long int x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename Th, typename V> void __print(const pair<Th, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename Th> void __print(const Th &x) { long long int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename Th, typename... V> void _print(Th t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } void binary_rock() { long long int v, c, n, m; cin >> v >> c >> n >> m; if (v + c < n + m) { cout << No << endl; return; } long long int mini = min(v, c); if (mini >= m) { cout << Yes << endl; return; } if (v >= c) { long long int req = (v - c); if (n < req) { cout << No << endl; return; } n -= req; v -= req; if (n >= m) { cout << Yes << endl; return; } m -= n; v -= n; c -= n; n -= n; if (m > v) { cout << No << endl; return; } else { cout << Yes << endl; return; } return; } else { long long int req = (c - v); if (n < req) { cout << No << endl; } else { n -= req; c -= req; if (n >= m) { cout << Yes << endl; return; } m -= n; v -= n; c -= n; n -= n; if (m > v) { cout << No << endl; return; } else { cout << Yes << endl; return; } cout << Yes << endl; } return; } } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); clock_t t1 = clock(); long long int t = 1; cin >> t; while (t--) { binary_rock(); } clock_t t2 = clock(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 305, Q = (int)2e6 + 50; struct Qry { int x, y, c; void read() { cin >> x >> y >> c; x--, y--; } } qry[Q]; int n, m, q; int mp[N][N]; int f[N * N]; int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0}; int ch[Q], off[Q]; int ans[Q]; int gid(int i, int j) { return i * m + j; } int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); } bool unite(int x, int y) { x = find(x); y = find(y); if (x == y) return false; f[x] = y; return true; } int build(int val, int ig) { for (int k = 0; k < n * m; k++) { f[k] = k; } for (int ki = 0; ki < n; ki++) { for (int kj = 0; kj < m; kj++) { if (ig != -1 && (!((mp[ki][kj] == val) ^ ig))) continue; if (ki + 1 < n && mp[ki + 1][kj] == mp[ki][kj]) unite(gid(ki + 1, kj), gid(ki, kj)); if (kj + 1 < m && mp[ki][kj + 1] == mp[ki][kj]) unite(gid(ki, kj + 1), gid(ki, kj)); } } int ccnt = 0; for (int k = 0; k < n * m; k++) ccnt += (f[k] == k); return ccnt; } bool in_bound(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> q; for (int i = 0; i < q; i++) qry[i].read(); int r = 0; for (int i = 0; i < q; i = r) { while (r < q && qry[r].c == qry[i].c) r++; build(qry[i].c, 0); int cur = 0; for (int j = i; j < r; j++) { int x = qry[j].x, y = qry[j].y; ch[j] = mp[x][y]; if (mp[x][y] != qry[j].c) cur++; mp[x][y] = qry[j].c; for (int d = 0; d < 4; d++) { int nx = x + dx[d], ny = y + dy[d]; if (in_bound(nx, ny) && mp[x][y] == mp[nx][ny]) { if (unite(gid(x, y), gid(nx, ny))) cur--; } } off[j] += cur; } cur = 0; build(qry[i].c, 1); for (int j = r - 1; j >= i; j--) { off[j] += cur; int x = qry[j].x, y = qry[j].y; if (mp[x][y] != ch[j]) { cur++; mp[x][y] = ch[j]; for (int d = 0; d < 4; d++) { int nx = x + dx[d], ny = y + dy[d]; if (in_bound(nx, ny) && mp[x][y] == mp[nx][ny]) { if (unite(gid(x, y), gid(nx, ny))) cur--; } } } } int ccnt = build(qry[i].c, -1); for (int j = i; j < r; j++) { ans[j] = ccnt - cur + off[j]; } for (int j = i; j < r; j++) { int x = qry[j].x, y = qry[j].y; mp[x][y] = qry[j].c; } } for (int i = 0; i < q; i++) cout << ans[i] << n ; }
|
#include <bits/stdc++.h> using namespace std; int n, x[105], mem[101][201][51][3], ans; string s; int solve(int idx, int pos, int rem, int dir) { int &ret = mem[idx][100 + pos][rem][dir + 1]; if (rem == 0) { int cur_dir = dir, sum = 0; for (int i = idx; i < s.size(); i++) if (x[i]) sum += cur_dir; else cur_dir *= -1; return abs(pos + sum); } if (idx == s.size()) return -1e8; if (ret != -1) return ret; int next_dir = (x[idx]) ? dir : -dir; int c1 = solve(idx + 1, pos + x[idx] * dir, rem, next_dir); int new_dir = (x[idx]) ? -dir : dir; int new_pos = (x[idx]) ? pos : pos + dir; int c2 = -1e8; if (rem >= 2) c2 = solve(idx, pos, rem - 2, dir); int c3 = -1e8; if (rem >= 1) c3 = solve(idx + 1, new_pos, rem - 1, new_dir); ans = max(ans, max(max(c1, c2), c3)); return ret = ans; } int main() { cin >> s >> n; memset(mem, -1, sizeof mem); for (int i = 0; i < s.size(); i++) x[i] = (s[i] == F ); cout << max(solve(0, 0, n, -1), solve(0, 0, n, 1)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; if (a == b) { cout << a; } else { cout << 1; } }
|
#include <bits/stdc++.h> using namespace std; long long a, b, p, x; long long Pow(long long x, long long y, long long mod) { if (!y) return 1; if (y == 1) return x % mod; long long t = Pow(x, y >> 1, mod), ans = t * t % mod; if (y & 1) ans = ans * x % mod; return ans; } int main() { while (scanf( %lld %lld %lld %lld , &a, &b, &p, &x) != EOF) { long long P = p * (p - 1), ans = 0; for (long long i = 1; i < p; i++) { long long r = b * Pow(Pow(a, i, p), p - 2, p) % p, c; if (i >= r) c = (i + (i - r) * (p - 1)) % P; else c = (i + (i + p - r) * (p - 1)) % P; if (!c) c = P; ans += ((x / P) + ((x % P >= c) ? 1 : 0)); } printf( %lld n , ans); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int i, j; if (k == 1 && n == 1) { cout << a ; return 0; } if (k > n || (k == 1)) { cout << -1; return 0; } i = 1; while (n - i >= k - 2) { cout << char( a + !(i % 2)); ++i; } for (i = 2; i < k; i++) cout << char( a + i); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int a, b, c; cin >> a >> b >> c; cout << a + b + c - (2 * (min(min(a, b), min(b, c)))) << endl; } }
|
#include<bits/stdc++.h> #include<vector> #include<map> #include<queue> #define LL long long #define INF INT64_MAX #define MOD 1000000007 #define stree SegTree[root] #define lson SegTree[root << 1] #define rson SegTree[root << 1 | 1] using namespace std; const int N = 100005; LL a[N]; int main() { int t, n; cin>>t; LL Min = INF; int tt = 0; while(t--) { tt++; cin>>n; for(int i = 1;i <= n;i++) { cin>>a[i]; } LL ans = INF, tem = 0, m1 = INT_MAX, m2 = INT_MAX; for(int i = 1;i <= n;i++) { if(i&1) { m1 = min(m1, a[i]); ans = min(ans, tem + m1*(n-i/2) + m2*(n-i/2)); tem += a[i]; //printf( 1ans = %lld tem = %lld n , ans, tem); } else { m2 = min(m2, a[i]); ans = min(ans, tem + m2*(n-(i-1)/2) + m1*(n-i/2)); tem += a[i]; //printf( 2ans = %lld tem = %lld n , ans, tem); } } printf( %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> #include <time.h> using namespace std; #define ll long long #define ld long double #define precision(x,d) cout<<fixed<<setprecision(d)<<x #define all(x) x.begin(),x.end() #define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL)); #define MOD 1000000007 #define INF LONG_LONG_MAX #define NINF LONG_LONG_MIN #define endl n #define yes cout<< YES <<endl #define no cout<< NO <<endl #define db4(x,y,z,k) cout<<#x<< : <<x<< t <<#y<< : <<y<< t <<#z<< : <<z<< t <<#k<< : <<k<<endl; int main() { IOS; ll t,n,m,k,u,v,x,y; t=1; cin >> t; while(t--) { cin >> n; vector<ll> a(n); for(int i=0;i<n;i++) cin >> a[i]; sort(all(a)); ll ans = 0; for(int i=1;i<n;i++) { m = i; ans -= m*a[i]; k = (n-i-1); ans += k*a[i]; } ans += a[n-1]; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using Pii = pair<int, int>; using Pll = pair<ll, ll>; template <typename...> static inline int getchar_unlocked(void) { return getchar(); } template <typename...> static inline void putchar_unlocked(int c) { putchar(c); } void reader(int& x) { int k, m = 0; x = 0; for (;;) { (k) = getchar_unlocked(); if (k == - ) { m = 1; break; } if ( 0 <= k && k <= 9 ) { x = k - 0 ; break; } } for (;;) { (k) = getchar_unlocked(); if (k < 0 || k > 9 ) break; x = x * 10 + k - 0 ; } if (m) x = -x; } void reader(ll& x) { int k, m = 0; x = 0; for (;;) { (k) = getchar_unlocked(); if (k == - ) { m = 1; break; } if ( 0 <= k && k <= 9 ) { x = k - 0 ; break; } } for (;;) { (k) = getchar_unlocked(); if (k < 0 || k > 9 ) break; x = x * 10 + k - 0 ; } if (m) x = -x; } int reader(char c[]) { int i, s = 0; for (;;) { (i) = getchar_unlocked(); if (i != && i != n && i != r && i != t && i != EOF) break; } c[s++] = i; for (;;) { (i) = getchar_unlocked(); if (i == || i == n || i == r || i == t || i == EOF) break; c[s++] = i; } c[s] = 0 ; return s; } int reader(string& c) { int i; for (;;) { (i) = getchar_unlocked(); if (i != && i != n && i != r && i != t && i != EOF) break; } c.push_back(i); for (;;) { (i) = getchar_unlocked(); if (i == || i == n || i == r || i == t || i == EOF) break; c.push_back(i); }; return ((int)c.size()); } template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); } template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); } template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V& w) { reader(x); reader(y); reader(z); reader(w); } void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x < 0) m = 1, x = -x; while (x) f[s++] = x % 10, x /= 10; if (!s) f[s++] = 0; if (m) putchar_unlocked( - ); while (s--) putchar_unlocked(f[s] + 0 ); putchar_unlocked(c); } void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x < 0) m = 1, x = -x; while (x) f[s++] = x % 10, x /= 10; if (!s) f[s++] = 0; if (m) putchar_unlocked( - ); while (s--) putchar_unlocked(f[s] + 0 ); putchar_unlocked(c); } void writer(const char c[]) { int i; for (i = 0; c[i] != 0 ; i++) putchar_unlocked(c[i]); } void writer(const string& x, char c) { int i; for (i = 0; x[i] != 0 ; i++) putchar_unlocked(x[i]); putchar_unlocked(c); } void writer(const char x[], char c) { int i; for (i = 0; x[i] != 0 ; i++) putchar_unlocked(x[i]); putchar_unlocked(c); } template <class T> void writerLn(T x) { writer(x, n ); } template <class T, class S> void writerLn(T x, S y) { writer(x, ); writer(y, n ); } template <class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ); writer(y, ); writer(z, n ); } template <class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ); writer(y, ); writer(z, ); writer(v, n ); } template <class T> void writerArr(T x[], int n) { if (!n) { putchar_unlocked( n ); return; } for (int i = 0; i < (n - 1); i++) writer(x[i], ); writer(x[n - 1], n ); } template <class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); } template <class T> void chmin(T& a, const T& b) { if (a > b) a = b; } template <class T> void chmax(T& a, const T& b) { if (a < b) a = b; } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; } ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } template <class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; } ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; } int test(int a, int b, int c) { set<tuple<int, int, int>> st; for (int i = 0; i < (a + 1); i++) if (i != 0 && a % i == 0) { for (int j = 0; j < (b + 1); j++) if (j != 0 && b % j == 0) { for (int k = 0; k < (c + 1); k++) if (k != 0 && c % k == 0) { int cur[] = {i, j, k}; sort(cur, cur + 3); st.emplace(cur[0], cur[1], cur[2]); } } } int x[] = {0, 0, 0, 0}; for (auto abc : st) { int a, b, c; tie(a, b, c) = abc; if (a == b && b == c) x[0]++; else if (a == b && b < c) x[1]++; else if (a < b && b == c) x[2]++; else if (a < b && b < c) x[3]++; else { cout << ? ; } } return ((int)st.size()); } int cnt[((int)1e5) + 1]; void init() { for (int i = 1; i <= ((int)1e5); i++) { for (int j = i; j <= ((int)1e5); j += i) { cnt[j]++; } } } int solve(int x, int y, int z) { int g = cnt[gcd(gcd(x, y), z)]; int d = cnt[gcd(x, y)] - g; int e = cnt[gcd(x, z)] - g; int f = cnt[gcd(y, z)] - g; int a = cnt[x] - d - e - g; int b = cnt[y] - d - f - g; int c = cnt[z] - f - e - g; int h[] = {a, b, c, d, e, f, g}; int oks[3][7] = { {1, 0, 0, 1, 1, 0, 1}, {0, 1, 0, 1, 0, 1, 1}, {0, 0, 1, 0, 1, 1, 1}, }; bool used[7][7][7] = {}; auto checkUsed = [&](int i, int j, int k) { if (i > k) swap(i, k); if (j > k) swap(j, k); if (i > j) swap(i, j); if (used[i][j][k]) return false; used[i][j][k] = true; return true; }; int part[5] = {}; int ans = 0; for (int i = 0; i < (7); i++) if (oks[0][i]) { for (int j = 0; j < (7); j++) if (oks[1][j]) { for (int k = 0; k < (7); k++) if (oks[2][k]) { if (!checkUsed(i, j, k)) { continue; } if (i != j && j != k && i != k) { int cur = h[i] * h[j] * h[k]; ans += cur; part[0] += cur; } else if (i == j && j != k) { int cur = (h[i] - 1) * h[i] / 2 + h[i]; cur *= h[k]; ans += cur; part[1] += cur; } else if (i != j && j == k) { int cur = (h[j] - 1) * h[j] / 2 + h[j]; cur *= h[i]; ans += cur; part[2] += cur; } else if (i == k && j != k) { int cur = (h[k] - 1) * h[k] / 2 + h[k]; cur *= h[j]; ans += cur; part[3] += cur; } else { int aa = h[i]; int bb = (h[i]) * (h[i] - 1) * (h[i] - 2); int cc = h[i] * h[i] * h[i] - aa - bb; int cur = aa + bb / 6 + cc / 3; ans += cur; part[4] += cur; } } } } return ans; } void test() { for (int i = 1; i <= 70; i++) { for (int j = 1; j <= 70; j++) { for (int k = 1; k <= 70; k++) { int a1 = test(i, j, k); int a2 = solve(i, j, k); if (a1 != a2) { cout << ? ; } } } } cout << ok << endl; } int main() { init(); int t; reader(t); while (t--) { int x, y, z; reader(x, y, z); int ans = solve(x, y, z); writerLn(ans); } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.