func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int inf = 2000000005; const int maxt = (1 << 20) + 5; int all[maxt], dp[2][maxt]; int best[30], a[30][30]; int mask[30][30], cost[30][30]; char str[30][30]; int n, m; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s , str[i]), best[i] = inf; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &a[i][j]), best[i] = min(best[i], a[i][j]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { bool ok = true; for (int k = 0; k < n; k++) if (k != i && str[i][j] == str[k][j]) ok = false; if (ok) best[i] = 0; } } for (int j = 0; j < m; j++) { for (int c = 0; c < 26; c++) { mask[j][c] = 0; cost[j][c] = 0; int maxc = 0, cnt = 0; for (int i = 0; i < n; i++) if (str[i][j] - a == c) { mask[j][c] |= 1 << i; cost[j][c] += a[i][j]; maxc = max(maxc, a[i][j]); cnt++; } cost[j][c] -= maxc; if (cnt < 2) mask[j][c] = -1; } } for (int i = 0; i < 1 << n; i++) dp[0][i] = dp[1][i] = inf; int nw = 0, ls = 1; dp[nw][0] = 0; for (int j = 0; j < m; j++) for (int c = 0; c < 26; c++) if (mask[j][c] != -1) { swap(nw, ls); memcpy(dp[nw], dp[ls], sizeof dp[ls]); for (int i = 0; i < 1 << n; i++) { dp[nw][i | mask[j][c]] = min(dp[nw][i | mask[j][c]], dp[ls][i] + cost[j][c]); } } for (int i = 0; i < 1 << n; i++) { all[i] = 0; for (int j = 0; j < n; j++) if ((i >> j) & 1) ; else all[i] += best[j]; } int ans = inf; for (int i = 0; i < 1 << n; i++) ans = min(ans, all[i] + dp[nw][i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[111], maxx; int main() { cin >> n >> m; for (int i = 0; i < n; ++i) cin >> a[i]; maxx = a[0]; for (int i = 1; i < n; ++i) maxx = max(maxx, a[i]); int tot = 0; for (int i = 0; i < n; ++i) tot += maxx - a[i]; int res2 = maxx + m; m -= tot; if (m < 0) m = 0; int res1 = maxx + m / n; if (m % n) ++res1; cout << res1 << << res2; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 5; const long long int M = 1e9 + 7; queue<pair<long long int, long long int> > pq; vector<long long int> v; map<long long int, long long int> mpp; set<pair<long long int, long long int> > st; long long int a[N], h[N], indx[N][2]; long long int val[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long int n, l; cin >> n; string s; cin >> s; long long int a = 0; long long int b = 0; for (int i = int(0); i <= int(n - 1); i++) { if (s[i] == 8 ) a++; } long long int x = n / 11; if (a < x) cout << a; else cout << x; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC optimize( no-stack-protector,fast-math ) using namespace std; const long long N = 2e5 + 100, OO = 1e9 + 7, T = 1e6 + 10, M = 1e9 + 7, P = 6151, SQ = 280, lg = 20; long long n; long long pw(long long x, long long y) { if (y == 0) return 1; long long cnt = pw(x, y / 2); cnt = (cnt * cnt) % n; cnt = (cnt * (y % 2 == 1 ? x : 1)) % n; return cnt; } int32_t main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; if (n == 1) return cout << YES n1 , 0; if (n == 4) return cout << YES n1 n3 n2 n4 n , 0; for (long long i = 2; i * i <= n; i++) if (n % i == 0) return cout << NO , 0; cout << YES n ; long long zr = 1; for (long long i = 1; i < n; i++) { long long cnt = i * pw(zr, n - 2) % n; cout << cnt << n ; zr = (zr * cnt) % n; } cout << n << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, q = 0, s = 0, t = 0; cin >> n; for (int k = 1; k <= n; k++) { cin >> q; if (q == 1) { if (t == 1) s++; else { t++; s++; } } else { if (t == 1) { t--; s++; } } } if (t == 0 && s != 0) s--; cout << s; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; const int mod1 = 1000000007; long long gcd(long long a, long long b) { long long c = a % b; while (c != 0) { a = b; b = c; c = a % b; } return b; } long long issub(string a, string b) { if (a.find(b) != string::npos) return 1; else return 0; } long long expo(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = res * a % mod1; a = a * a % mod1; b >>= 1; } return res; } int32_t lcm(long long n1, long long n2) { long long max = (n1 > n2) ? n1 : n2; do { if (max % n1 == 0 && max % n2 == 0) { return max; } else ++max; } while (true); } string operator*(string a, unsigned long long b) { string output = ; while (b--) output += a; return output; } bool isPerfectSquare(long long n) { for (long long i = 1; i * i <= n; i++) { if ((n % i == 0) && (n / i == i)) { return true; } } return false; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL); ; long long t, a = 0, x; cin >> t; map<long long, long long> m; for (long long i = 0; i < t; i++) { cin >> x; m[x]++; a = max(a, m[x]); } cout << a; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 9; const int Mod = 1e9 + 7; inline int dcmp(double x) { if (fabs(x) <= 1e-9) return 0; return x < 0 ? -1 : 1; } inline int scan() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } inline long long scan(long long x) { int f = 1; char ch = getchar(); x = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } struct Point { int x, y, id; Point(int x = 0, int y = 0) : x(x), y(y) {} Point operator-(const Point &a) const { return Point(x - a.x, y - a.y); } Point operator*(const long long &a) const { return Point(x * a, y * a); } Point operator+(const Point &a) const { return Point(x + a.x, y + a.y); } bool operator==(const Point &a) const { return dcmp(x - a.x) == 0 && dcmp(y - a.y) == 0; } bool operator<(const Point &a) const { if (x == a.x) return y < a.y; return x < a.x; } void read() { scanf( %d%d , &x, &y); } void out() { cout << x << << y << endl; } }; double Dot(Point a, Point b) { return a.x * b.x + a.y * b.y; } double dis(Point a) { return sqrt(Dot(a, a)); } long long Cross(Point a, Point b) { return a.x * 1LL * b.y - a.y * 1LL * b.x; } bool chk(Point p1, Point p2, Point p3, Point p) { return abs(Cross(p2 - p, p1 - p)) + abs(Cross(p3 - p, p2 - p)) + abs(Cross(p1 - p, p3 - p)) == abs(Cross(p2 - p1, p3 - p1)); } int n, k, ti; int a[200005], vis[200005]; void solve() { n = scan(); k = scan(); for (int i = 1; i <= n; i++) a[i] = scan(); memset(vis, 0, sizeof(vis)); sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) { ti = i; while (ti - 1) { ti--; if (vis[ti]) break; if (a[ti] + k < a[i]) break; if (a[ti] < a[i]) vis[ti] = 1; else break; } } ti = 0; for (int i = 1; i <= n; i++) { if (!vis[i]) ti++; } cout << ti << endl; } int main() { int t = 1; for (int i = 1; i <= t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long int dp[3005][3005]; int a[3005]; int tree[3005 * 3005][2]; int cnt = 0; long long int check(int t) { return !((a[t - 3] == 0 && a[t - 2] == 0 && a[t - 1] == 1 && a[t] == 1) || (a[t - 3] == 0 && a[t - 2] == 1 && a[t - 1] == 0 && a[t] == 1) || (a[t - 3] == 1 && a[t - 2] == 1 && a[t - 1] == 1 && a[t] == 0) || (a[t - 3] == 1 && a[t - 2] == 1 && a[t - 1] == 1 && a[t] == 1)); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) for (int j = i - 1; j <= n; j++) { if (j < i) dp[i][j] = 1; else { for (int k = 1; k <= min(j, (check(j) ? 4 : 3)); k++) dp[i][j] = (dp[i][j] + dp[i][j - k]) % 1000000007; } } long long int ans = 0; for (int i = 1; i <= n; i++) { int p = 0; for (int j = i; j >= 1; j--) { if (tree[p][a[j]]) p = tree[p][a[j]]; else { ans = (ans + dp[j][i]) % 1000000007; tree[p][a[j]] = cnt += 1; p = tree[p][a[j]]; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O2,no-stack-protector,unroll-loops,fast-math ) const long long maxn = 1e5 + 10, maxm = 5e2 + 10, lg = 21, mod = 1e9 + 7, inf = 1e18; long long n, m, s; long double dp[101][maxn], ps[maxn]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; if (m == 1) return cout << 1, 0; dp[0][0] = m - 1; fill(ps, ps + maxn, m - 1); for (int i = 1; i <= n; i++) { long long x; cin >> x; s += x; for (int j = 1; j <= n * m; j++) dp[i][j] = (ps[j - 1] - (j - m - 1 >= 0 ? ps[j - m - 1] : 0) - (j - x >= 0 ? dp[i - 1][j - x] : 0)) / (m - 1); ps[0] = 0; for (int j = 1; j <= n * m; j++) ps[j] = ps[j - 1] + dp[i][j]; } cout << fixed << setprecision(18) << ps[s - 1] + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, p; cin >> n >> p; long long ans = 5 * 5000000; for (long long i = 1; i <= 5000000; i++) { long long left = n - p * i; if (left < 1) continue; else { long long k = __builtin_popcount(left); if (k <= i and left >= i) { cout << i; return 0; } } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 7; long long n, a[N], cnt[N]; int32_t main() { cin >> n; for (long long i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++; for (long long i = 1; i < N; i++) if (cnt[i] > 0) { if (cnt[i] > n / 2) cout << Bob ; else cout << Alice ; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 410; int cnt[N]; int temp[N]; long long cost[N][N]; long long dp[N][N]; long long n, m, k; const long long INF = (1LL) << 60; vector<int> v[200]; int main() { while (cin >> n >> m >> k) { memset(dp, 0, sizeof(dp)); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) { cost[i][j] = INF; dp[i][j] = INF; } for (long long i = 0; i < m; i++) { long long l, r, c; cin >> l >> r >> c; cost[l - 1][r] = min(cost[l - 1][r], c); } for (long long i = 0; i <= n; i++) for (long long j = n; j >= i; j--) { cost[i][j - 1] = min(cost[i][j - 1], cost[i][j]); cost[i + 1][j] = min(cost[i + 1][j], cost[i][j]); } dp[0][0] = 0; for (long long i = 1; i <= n; i++) { for (long long j = 0; j <= i; j++) { dp[i][j] = dp[i - 1][j]; for (long long k = 0; k < i; k++) { if (j - i + k >= 0) dp[i][j] = min(dp[i][j], dp[k][j - i + k] + cost[k][i]); } } } long long ans = INF; for (long long i = k; i <= n; i++) ans = min(ans, dp[n][i]); if (ans == INF) cout << -1 << endl; else cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void print(T& x) { cout << x; } template <class T, class U> void print(pair<T, U>& p) { cout << ( ; print(p.first); cout << , ; print(p.second); cout << ) ; } template <class T> void print(vector<T>& v) { cout << { ; if (((int)(v).size())) print(v[0]); for (int i = 1; i < ((int)(v).size()); i++) cout << , , print(v[i]); cout << } n ; } const int n = 1e6 + 10; int N, Q; vector<vector<pair<int, int>>> T; int X[n]; int Par[n]; pair<int, int> intv[n]; int newNum[n]; int cmp[n]; struct fenwick_tree { int n; vector<int> a, f; fenwick_tree(int n = 0) : n(n), a(n), f(n + 1) {} fenwick_tree(vector<int>& a) : fenwick_tree(a.size()) { for (int i = 0; i < n; i++) setValue(i, a[i]); } void changeValue(int i, int d) { for (a[i++] += d; i <= n; i += i & -i) f[i] += d; } void setValue(int i, int v) { changeValue(i, v - a[i]); } int getSum(int i) { int s = 0; for (i++; i; i -= i & -i) s += f[i]; return s; } int getSum(int l, int r) { return getSum(r - 1) - getSum(l - 1); } }; struct sparse_table { int n; vector<int> a; vector<vector<int>> st; int combine(int dl, int dr) { return a[dl] > a[dr] ? dl : dr; } sparse_table() {} sparse_table(vector<int>& a) : n(a.size()), a(a), st((31 - __builtin_clz(n)) + 1, vector<int>(n)) { for (int i = 0; i < n; i++) st[0][i] = i; for (int j = 1; 1 << j <= n; j++) for (int i = 0; i + (1 << j) <= n; i++) st[j][i] = combine(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]); } int query(int l, int r) { int s = (31 - __builtin_clz(r - l)); return combine(st[s][l], st[s][r - (1 << s)]); } }; struct lowest_common_ancestor { int n, m = 0; vector<int> a, v, h; vector<vector<int>>& e; sparse_table st; lowest_common_ancestor(vector<vector<int>>& e, int r) : n(e.size()), a(n), v(2 * n - 1), h(2 * n - 1), e(e) { dfs(r); st = sparse_table(h); } void dfs(int i, int p = -1, int d = 0) { a[i] = m; v[m] = i; h[m++] = d; for (int j : e[i]) { if (j == p) continue; dfs(j, i, d - 1); v[m] = i; h[m++] = d; } } int lca(int x, int y) { return v[st.query(min(a[x], a[y]), max(a[x], a[y]) + 1)]; } }; fenwick_tree BIT(n); void initDSU() { for (int i = 0; i < N; i++) { cmp[i] = i; } } int find(int x) { if (cmp[x] != x) cmp[x] = find(cmp[x]); return cmp[x]; } void combine(int a, int b) { cmp[find(a)] = find(b); } int newN = 0; void dfs(int cur, int par) { newNum[cur] = newN; int l = newN++; for (auto [x, w] : T[cur]) { if (x == par) continue; Par[x] = cur; X[x] = X[cur] ^ w; dfs(x, cur); } intv[cur] = make_pair(l, newN - 1); } void mark(int x) { auto [l, r] = intv[x]; BIT.changeValue(l, 1); BIT.changeValue(r + 1, -1); } void markPath(int x, int to) { while (x != to) { mark(x); x = Par[x]; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> N >> Q; T.resize(N); vector<tuple<int, int, int>> A; initDSU(); for (int i = 0; i < Q; i++) { int u, v, x; cin >> u >> v >> x; u--; v--; A.emplace_back(u, v, x); if (find(u) != find(v)) { T[u].emplace_back(v, x); T[v].emplace_back(u, x); combine(u, v); } } for (int i = 1; i < N; i++) { if (find(i) != find(0)) { combine(0, i); T[0].emplace_back(i, 0); T[i].emplace_back(0, 0); } } initDSU(); dfs(0, -1); vector<vector<int>> e(N); for (int i = 0; i < N; i++) { for (int j = 0; j < ((int)(T[i]).size()); j++) e[i].push_back(T[i][j].first); } lowest_common_ancestor LCA(e, 0); for (auto [u, v, x] : A) { if (find(u) != find(v)) { combine(u, v); cout << YES n ; } else if ((X[u] ^ X[v] ^ x) == 1) { int lca = LCA.lca(u, v); int sum = BIT.getSum(newNum[u]) + BIT.getSum(newNum[v]) - 2 * BIT.getSum(newNum[lca]); if (sum == 0) { cout << YES n ; markPath(v, lca); markPath(u, lca); } else cout << NO n ; } else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; int dp[1005]; long long ncr[1005][1005]; int ones(int n); void calc_ncr(); int main() { string n; int k; cin >> n; cin >> k; calc_ncr(); dp[1] = 0; for (int i(2); i < (1001); i++) { dp[i] = dp[ones(i)] + 1; } long long res = 0, num_ones = 0; int len = n.length(); if (k == 0) { cout << 1 n ; return 0; } for (int i(0); i < (len); i++) { if (n[i] == 0 ) { continue; } int j = max(num_ones, 1LL); while (j < 1000) { if (dp[j] == k - 1) { res = (res + ncr[len - i - 1][j - num_ones]) % 1000000007; if (i == 0 && k == 1) { res = (res + 1000000007 - 1) % 1000000007; } } j++; } num_ones++; } int count = 0; for (int i(0); i < (len); i++) { if (n[i] == 1 ) { count++; } } if (dp[count] == k - 1) { res = (res + 1) % 1000000007; } cout << res << n ; return 0; } int ones(int n) { int count = 0; while (n) { if (n % 2 == 1) { count++; } n /= 2; } return count; } void calc_ncr() { for (int i(0); i < (1001); i++) { ncr[i][0] = 1; } for (int i(1); i < (1001); i++) { for (int j(1); j < (i + 1); j++) { ncr[i][j] = (ncr[i - 1][j - 1] + ncr[i - 1][j]) % 1000000007; } } } |
#include<bits/stdc++.h> using namespace std; vector<int> vec[200001]; int ans[200001],arr[200001]; struct data { int l,r,mini,maxi,d; }; data tree[1000001]; void pushup(int x) { tree[x].maxi=max(tree[x<<1].maxi,tree[(x<<1)+1].maxi); tree[x].mini=min(tree[x<<1].mini,tree[(x<<1)+1].mini); return; } void pushdown(int x) { int mid=(tree[x].l+tree[x].r)>>1; int d=tree[x].d; tree[x<<1].d+=d; tree[(x<<1)+1].d+=d; tree[x<<1].maxi+=d; tree[(x<<1)+1].maxi+=d; tree[x<<1].mini+=d; tree[(x<<1)+1].mini+=d; tree[x].d=0; pushup(x); return; } void revise(int i,int l,int r,int d) { if(l<=tree[i].l&&r>=tree[i].r) { tree[i].d+=d; tree[i].maxi+=d; tree[i].mini+=d; return ; } int mid=(tree[i].l+tree[i].r)>>1; if(tree[i].d!=0) { pushdown(i); } if(mid>=l) { revise(i<<1,l,r,d); } if(mid<r) { revise((i<<1)+1,l,r,d); } pushup(i); } int query_max(int i,int l,int r) { if(r==0) { return 0; } int mid=(tree[i].l+tree[i].r)>>1; if(l<=tree[i].l&&r>=tree[i].r) { return tree[i].maxi; } if(tree[i].d!=0) { pushdown(i); } pushup(i); int ans=-1e9; if(mid>=l) { ans=max(ans,query_max((i<<1),l,r)); } if(mid<r) { ans=max(ans,query_max(((i<<1)+1),l,r)); } pushup(i); return ans; } int query_min(int i,int l,int r) { if(r==0) { return 0; } int mid=(tree[i].l+tree[i].r)>>1; if(l<=tree[i].l&&r>=tree[i].r) { return tree[i].mini; } if(tree[i].d!=0) { pushdown(i); } pushup(i); int ans=1e9; if(mid>=l) { ans=min(ans,query_min((i<<1),l,r)); } if(mid<r) { ans=min(ans,query_min(((i<<1)+1),l,r)); } pushup(i); return ans; } void init(int i,int l,int r) { tree[i].l=l; tree[i].r=r; tree[i].maxi=0; tree[i].d=0; tree[i].mini=0; if(l==r) { return; } int mid=(l+r)>>1; init((i<<1),l,mid); init((i<<1)+1,mid+1,r); return; } int main() { int n; cin>>n; for(int i=1 ; i<=n ; i++) { cin>>arr[i]; vec[arr[i]].push_back(i); } init(1,1,n); for(int i=1; i<=n ; i++) { revise(1,i,n,-1); } for(int i=1 ; i<=n ; i++) { ans[i]=0; } for(int i=1; i<=n ; i++) { for(int j=0 ; j<vec[i].size() ; j++) { revise(1,vec[i][j],n,2); int k=vec[i][j]; int a=query_max(1,1,k-1); int b=query_min(1,k,n); a=max(a,0); int c=b-a; int tmp=(floor)((double)(c-1)/(double)2); //cout<<vec[i][j]<< <<a<< <<b<< n ; ans[k]=max(ans[k],abs(tmp)); revise(1,vec[i][j],n,-2); } for(int j=0 ; j<vec[i].size() ; j++) { int k=vec[i][j]; revise(1,k,n,2); } for(int j=0 ; j<vec[i].size() ; j++) { int k=vec[i][j]; int a=query_min(1,1,k-1); int b=query_max(1,k,n); a=min(0,a); int c=b-a; //cout<<c<< n ; int tmp=(floor)((double)(c-1)/(double)2); //cout<<vec[i][j]<< <<tmp<< <<b<< n ; ans[k]=max(ans[k],abs(tmp)); } } for(int i=1; i<=n ; i++) { cout<<ans[i]<< ; } cout<< n ; } |
#include <bits/stdc++.h> using namespace std; const long long INF(0x3f3f3f3f3f3f3f3fll); const long long inf(0x3f3f3f3f); template <typename T> void read(T &res) { bool flag = false; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (flag = true); for (res = ch - 48; isdigit(ch = getchar()); res = (res << 1) + (res << 3) + ch - 48) ; flag && (res = -res); } template <typename T> void Out(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) Out(x / 10); putchar(x % 10 + 0 ); } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } long long pow_mod(long long x, long long n, long long mod) { long long res = 1; while (n) { if (n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } long long fact_pow(long long n, long long p) { long long res = 0; while (n) { n /= p; res += n; } return res; } long long mult(long long a, long long b, long long p) { a %= p; b %= p; long long r = 0, v = a; while (b) { if (b & 1) { r += v; if (r > p) r -= p; } v <<= 1; if (v > p) v -= p; b >>= 1; } return r; } long long quick_pow(long long a, long long b, long long p) { long long r = 1, v = a % p; while (b) { if (b & 1) r = mult(r, v, p); v = mult(v, v, p); b >>= 1; } return r; } bool CH(long long a, long long n, long long x, long long t) { long long r = quick_pow(a, x, n); long long z = r; for (long long i = 1; i <= t; i++) { r = mult(r, r, n); if (r == 1 && z != 1 && z != n - 1) return true; z = r; } return r != 1; } bool Miller_Rabin(long long n) { if (n < 2) return false; if (n == 2) return true; if (!(n & 1)) return false; long long x = n - 1, t = 0; while (!(x & 1)) { x >>= 1; t++; } srand(time(NULL)); long long o = 8; for (long long i = 0; i < o; i++) { long long a = rand() % (n - 1) + 1; if (CH(a, n, x, t)) return false; } return true; } void exgcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return; } exgcd(b, a % b, x, y); long long t = x; x = y, y = t - (a / b) * y; } long long inv(long long a, long long b) { long long x, y; return exgcd(a, b, x, y), (x % b + b) % b; } long long crt(long long x, long long p, long long mod) { return inv(p / mod, mod) * (p / mod) * x; } long long fac(long long x, long long a, long long b) { if (!x) return 1; long long ans = 1; for (long long i = 1; i <= b; i++) if (i % a) ans *= i, ans %= b; ans = pow_mod(ans, x / b, b); for (long long i = 1; i <= x % b; i++) if (i % a) ans *= i, ans %= b; return ans * fac(x / a, a, b) % b; } long long C(long long n, long long m, long long a, long long b) { long long N = fac(n, a, b), M = fac(m, a, b), Z = fac(n - m, a, b), sum = 0, i; for (i = n; i; i = i / a) sum += i / a; for (i = m; i; i = i / a) sum -= i / a; for (i = n - m; i; i = i / a) sum -= i / a; return N * pow_mod(a, sum, b) % b * inv(M, b) % b * inv(Z, b) % b; } long long exlucas(long long n, long long m, long long p) { long long t = p, ans = 0, i; for (i = 2; i * i <= p; i++) { long long k = 1; while (t % i == 0) { k *= i, t /= i; } ans += crt(C(n, m, i, k), p, k), ans %= p; } if (t > 1) ans += crt(C(n, m, t, t), p, t), ans %= p; return ans % p; } const long long N = 3e5 + 10; signed main() { std::ios::sync_with_stdio(false); long long t; cin >> t; while (t--) { long long n; cin >> n; cout << n << n ; } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; int const maxn = 3000005; string st[maxn]; int ab[200], ac[200], ad[200]; char b[maxn], c[maxn], d[maxn]; int main() { cin >> b >> c; int lenc = strlen(c); for (int i = 0; i < lenc; i++) { ac[c[i] - a ]++; } int tw = 0, t = 0; int lenb = strlen(b); for (int i = 0; i < lenb; i++) { if (b[i] == ? ) tw++; else ab[b[i] - a ]++; } while (tw > 0) { for (int i = 0; i < 26; i++) { if (tw == 0) break; if (ab[i] >= ac[i]) { ab[i] -= ac[i]; } else { if (tw >= ac[i] - ab[i]) { tw -= ac[i] - ab[i]; ad[i] += ac[i] - ab[i]; ab[i] = 0; } else { ad[0] += tw; tw = 0; } } } } for (int i = 0; i < 26; i++) { for (int j = 0; j < ad[i]; j++) { d[t++] = (char)(i + a ); } } t = 0; for (int i = 0; i < lenb; i++) { if (b[i] == ? ) { cout << d[t++]; } else cout << b[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], n; double f(double x) { double sum = 0, mn = 0, mx = 0, ans = 0; for (int i = 0; i < n; i++) { mn = min(mn, sum); mx = max(mx, sum); sum += a[i] - x; ans = max(ans, abs(sum - mn)); ans = max(ans, abs(sum - mx)); } return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; double l = -1e4 - 7, r = 1e4 + 7; int t = 230; while (t--) { double mid1 = (2 * r + l) / 3; double mid2 = (2 * l + r) / 3; if (f(mid1) < f(mid2)) l = mid2; else r = mid1; } cout << setprecision(9) << fixed << f(l) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, ans; int a[6][6]; int convert(char c) { if (c == R ) return 1; if (c == G ) return 2; if (c == B ) return 3; if (c == Y ) return 4; if (c == W ) return 5; } void xuly(int state) { int i, j, dem, c1, c2; bool val[10], col[10]; int temp[15]; dem = 0; for (i = 0; i < 5; i++) if (state & (1 << i)) { dem++; val[i + 1] = true; } else val[i + 1] = false; for (i = 5; i < 10; i++) if (state & (1 << i)) { dem++; col[i - 4] = true; } else col[i - 4] = false; memset(temp, 0, sizeof(temp)); for (i = 1; i <= 5; i++) for (j = 1; j <= 5; j++) if (a[i][j]) { if (val[i] && col[j]) continue; if (val[i]) temp[i]++; else if (col[j]) temp[j + 5]++; else temp[11]++; } for (i = 1; i <= 11; i++) if (temp[i] > 1) return; ans = min(ans, dem); } void solve() { int i, j; ans = 10; for (i = 0; i < (1 << 11); i++) xuly(i); cout << ans << endl; } void input() { int i; char s[10]; scanf( %d , &n); memset(a, 0, sizeof(a)); for (i = 0; i < n; i++) { scanf( %s , &s); a[convert(s[0])][s[1] - 0 ]++; } solve(); } int main() { input(); fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int a; int b; int dado[] = {1, 2, 3, 4, 5, 6}; cin >> a >> b; int r1, r2, r3; r1 = r2 = r3 = 0; for (int i = 0; i < 6; ++i) abs(dado[i] - a)<abs(dado[i] - b) ? r1++ : abs(dado[i] - a)> abs(dado[i] - b) ? r2++ : r3++; cout << r1 << << r3 << << r2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long unsigned int combi(long unsigned int a) { if (a == 0 || a == 1) return 0; return ((a * (a - 1)) / 2); } int main() { int n = 0; cin >> n; char arr[n]; int letras[26]; char temp = 0; long unsigned int res = 0; for (int i = 0; i < 26; i++) { letras[i] = 0; } for (int i = 0; i < n; i++) { cin >> temp; cin.ignore(256, n ); letras[temp - 97]++; } for (int i = 0; i < 26; i++) { res += (combi(letras[i] - (letras[i] / 2)) + (combi(letras[i] / 2))); } printf( %lu , res); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> bool ckmin(T &a, U b) { return b < a ? a = b, true : false; } template <typename T, typename U> bool ckmax(T &a, U b) { return b > a ? a = b, true : false; } int tt; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> tt; while (tt--) { int n, x, y, un = -1; cin >> n >> x >> y; set<int> second; vector<int> v(n, 0), res(n, -1); map<int, vector<int>> m; vector<pair<int, vector<int>>> a, b; for (int i = 0; i < n; ++i) { cin >> v[i]; v[i]--; m[v[i]].push_back(i); } for (int i = 0; i <= n; ++i) second.insert(i); for (auto i : v) { if (second.find(i) != second.end()) second.erase(i); } un = (*second.begin()); for (auto i : m) a.push_back(i); sort(a.begin(), a.end(), [](const pair<int, vector<int>> &a, const pair<int, vector<int>> &b) { return (int)(a.second).size() < (int)(b.second).size(); }); int cnt = 0, pp = 0; map<int, vector<int>> tmp; while (cnt < n - x) { if ((int)(a[pp].second).size()) { tmp[a[pp].first].push_back(a[pp].second.back()); a[pp].second.pop_back(); cnt++; } pp++; if (pp >= (int)(a).size()) pp -= (int)(a).size(); } for (auto i : tmp) { b.push_back(i); } for (auto i : a) { for (auto j : i.second) { res[j] = i.first; } } vector<pair<int, int>> xx, yy; for (auto i : b) { for (auto j : i.second) { xx.push_back(make_pair(i.first, j)); yy.push_back(make_pair(i.first, j)); } } rotate(yy.begin(), yy.begin() + ((int)(yy).size() / 2), yy.end()); vector<int> store; for (int i = 0; i < (int)(yy).size(); ++i) { if (xx[i].first == yy[i].first) store.push_back(i); } if ((int)(store).size() > n - y) { cout << NO n ; continue; } for (auto i : store) { xx[i].first = un; res[yy[i].second] = un; } int rem = n - y - (int)(store).size(); for (int i = 0; i < (int)(yy).size(); ++i) { if (rem && xx[i].first != un) { rem--; xx[i].first = un; res[yy[i].second] = un; } else { res[yy[i].second] = xx[i].first; } } cout << YES n ; for (auto i : res) cout << i + 1 << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 * 2; int n, m, ind; long long L[55], M[55], R[55], A[55], ans = -inf, un; bool all = 1; vector<int> a[55]; void calc() { for (int i = 0; i < n; i++) { R[i] = M[i] = L[i] = -inf; for (int j = 0; j < a[i].size(); j++) { A[i] += (long long)a[i][j]; if (A[i] > L[i]) L[i] = A[i]; } long long sum = 0; for (int j = a[i].size() - 1; j >= 0; j--) { sum += (long long)a[i][j]; if (sum > R[i]) R[i] = sum; } sum = 0; for (int j = 0; j < a[i].size(); j++) { sum = max(sum + (long long)a[i][j], (long long)a[i][j]); M[i] = max(M[i], sum); } } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { int l; scanf( %d , &l); for (int j = 0; j < l; j++) { int x; scanf( %d , &x); a[i].push_back(x); } } calc(); for (int i = 0; i < m; i++) { scanf( %d , &ind), ind--; ans = max(un + L[ind], ans); un = max(un + A[ind], R[ind]); ans = max(ans, M[ind]); } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; double calc(pair<double, double> v1, pair<double, double> v2) { double dx = v1.first - v2.first; double dy = v1.second - v2.second; return sqrt(dx * dx + dy * dy); } int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); double x1, y1, x2, y2; scanf( %lf%lf%lf%lf , &x1, &y1, &x2, &y2); double dist = fabs(x1 - x2) + fabs(y1 - y2); if (a == 0 || b == 0) { printf( %.10f n , dist); return 0; } vector<pair<double, double>> v1, v2; double xl1 = (-1.0 * c - 1.0 * b * y1) / a; double yl1 = (-1.0 * c - 1.0 * a * x1) / b; v1.push_back({xl1, y1}); v1.push_back({x1, yl1}); double xl2 = (-1.0 * c - 1.0 * b * y2) / a; double yl2 = (-1.0 * c - 1.0 * a * x2) / b; v2.push_back({xl2, y2}); v2.push_back({x2, yl2}); for (auto p1 : v1) for (auto p2 : v2) dist = min(dist, calc(p1, p2) + fabs(x1 - p1.first) + fabs(y1 - p1.second) + fabs(x2 - p2.first) + fabs(y2 - p2.second)); printf( %.10f n , dist); } |
#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { for (int i = 2; i < int(sqrt(n) + 1); i++) if (n % i == 0) return 0; return 1; } int main() { int n; cin >> n; if (isPrime(n)) return !(cout << 1 << n ); if (n & 1) { if (isPrime(n - 2)) cout << 2 << n ; else cout << 3 << n ; } else cout << 2 << n ; return 0; } |
#include <bits/stdc++.h> const int MAXN = 1000000007; const int z = 0; using namespace std; int main() { int k, l, m, n, d, ans = 0; cin >> k >> l >> m >> n >> d; for (int i = 1; i <= d; i++) { if (i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0) { ans++; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt, c = 0; cin >> tt; while (tt) { int n = tt; set<int> data; while (n % 2 == 0) { data.insert(2); n = n / 2; } for (int i = 3; i <= sqrt(n); i = i + 2) { while (n % i == 0) { data.insert(i); n = n / i; } } if (n > 2) data.insert(n); if (data.size() == 2) { c++; } tt--; } cout << c << endl; cerr << Time : << (float)clock() / CLOCKS_PER_SEC << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<int, int>; constexpr int INF = 1001001001; constexpr int mod = 1000000007; template <class T> inline bool chmax(T& x, T y) { if (x < y) { x = y; return true; } return false; } template <class T> inline bool chmin(T& x, T y) { if (x > y) { x = y; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<int> a(n + 2), ban(k + 2); a[0] = -1e+7, a[n + 1] = INF; ban[0] = 0, ban[k + 1] = n + 1; for (int i = 1; i <= n; ++i) { cin >> a[i]; a[i] -= i; } for (int i = 1; i <= k; ++i) cin >> ban[i]; int ans = 0; for (int i = 0; i <= k; ++i) { int lb = a[ban[i]], ub = a[ban[i + 1]]; if (ub - lb < 0) { cout << -1 << endl; return 0; } vector<int> vals; int cnt = 0; int s = ban[i] + 1, t = ban[i + 1]; for (int j = s; j < t; ++j) { if (a[j] < lb || a[j] > ub) ++cnt; else vals.emplace_back(a[j]); } int m = vals.size(); vector<int> dp(m, INF); for (int j = 0; j < m; ++j) { *upper_bound(dp.begin(), dp.end(), vals[j]) = vals[j]; } cnt += dp.end() - lower_bound(dp.begin(), dp.end(), INF); ans += cnt; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a[1000]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } long int answer = 0; for (int i = 0; i < (n - 1); i++) { if (a[i] == 1 && a[i + 1] == 2) { answer += 3; } else if (a[i] == 1 && a[i + 1] == 3) { answer += 4; } else if (a[i] == 2 && a[i + 1] == 1) { answer += 3; } else if (a[i] == 2 && a[i + 1] == 3) { cout << Infinite ; return 0; } else if (a[i] == 3 && a[i + 1] == 1) { answer += 4; if (i < n - 2 && a[i + 2] == 2) { answer -= 1; } } else if (a[i] == 3 && a[i + 1] == 2) { cout << Infinite ; return 0; } } cout << Finite << endl; cout << answer; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = (s.size() + 1) / 2 - 1; int b = s.size() / 2 - 1; bool f00 = false, f01 = false, f10 = false, f11 = false; int cq = 0, c0 = 0, c1 = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == 0 ) c0++; else if (s[i] == 1 ) c1++; else cq++; } if (cq + c1 >= a + 2) f11 = true; if (c1 <= a) f00 = true; if (c1 <= a + 1 and c1 + cq >= a + 1) { int q1 = (a + 1) - c1; int q0 = cq - q1; if (s.back() == ? ) { if (q1) f01 = true; if (q0) f10 = true; } else if (s.back() == 0 ) f10 = true; else f01 = true; } if (f00) printf( 00 n ); if (f01) printf( 01 n ); if (f10) printf( 10 n ); if (f11) printf( 11 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; double a, b, Zero = 0.5, One = 1.0; scanf( %d , &t); while (t--) { scanf( %lf%lf , &a, &b); if (a == 0 && b == 0) printf( %.10lf n , One); else if (a == 0) printf( %.10lf n , Zero); else if (b == 0) printf( %.10lf n , One); else if (a >= 4 * b) { float area = 0.5 * 4 * b * b; area = 2 * a * b - area; area /= 2 * a * b; printf( %.10lf n , area); } else { float area = 0.5 * a * a * 0.25 + a * b; area /= 2 * a * b; printf( %.10lf n , area); } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int N = 1e5 + 5, M = 100 + 5, OO = 0x3f3f3f3f, mod = 1e9 + 7, base = 131, MOD2 = 1000136437; const double EPS = 1e-9; long double w, h, theta; complex<double> rotate(complex<double> &p, double a) { return p * polar(1.0, a); } int doubleComp(const double &a, const double &b) { return fabs(a - b) < EPS ? 0 : a < b ? -1 : 1; } bool lineInter(const complex<double> &A, const complex<double> &B, const complex<double> &P, const complex<double> &Q, complex<double> &R, bool isSegA = false, bool isSegB = false) { double d1 = ((conj(P - A) * (B - A)).imag()); double d2 = ((conj(Q - A) * (B - A)).imag()); if (fabs(d1 - d2) < EPS) return false; R = (d1 * Q - d2 * P) / (d1 - d2); if (isSegA && doubleComp(hypot(A.real() - B.real(), A.imag() - B.imag()), hypot(A.real() - R.real(), A.imag() - R.imag()) + hypot(B.real() - R.real(), B.imag() - R.imag())) != 0) return false; if (isSegB && doubleComp(hypot(P.real() - Q.real(), P.imag() - Q.imag()), hypot(P.real() - R.real(), P.imag() - R.imag()) + hypot(Q.real() - R.real(), Q.imag() - R.imag())) != 0) return false; return true; } void polygonCut(const complex<double> &a, const complex<double> &b, const vector<complex<double> > &v, vector<complex<double> > &ret) { ret.clear(); for (int i = 0; i < (int)(v).size(); i++) { int j = (i + 1) % (int)(v).size(); if (((conj(((b) - (a))) * (((v[i]) - (a)))).imag()) >= 0) ret.push_back(v[i]); complex<double> r; if (lineInter(a, b, v[i], v[j], r, 0, 1)) ret.push_back(r); } } void polygonIntersection(const vector<complex<double> > &poly1, const vector<complex<double> > &poly2, vector<complex<double> > &ret) { vector<complex<double> > r2; ret = poly1; for (int i = 0; i < (int)(poly2).size(); i++) { int j = (i + 1) % (int)(poly2).size(); polygonCut(poly2[i], poly2[j], ret, r2); ret = r2; } } double areaPolygon(vector<complex<double> > p) { double area = 0.0; for (int i = 0, n = (int)(p).size(); i < n; i++) area += ((conj(p[i]) * (p[(i + 1) % n])).imag()); return abs(area) / 2.0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> w >> h >> theta; vector<complex<double> > p, p2, ans; w /= 2; h /= 2; p.push_back(complex<double>(w, h)); p.push_back(complex<double>(-w, h)); p.push_back(complex<double>(-w, -h)); p.push_back(complex<double>(w, -h)); p2 = p; theta = (theta / 180.0) * (2 * acos(0)); for (auto &i : p2) i = rotate(i, theta); polygonIntersection(p, p2, ans); cout << fixed << setprecision(6) << areaPolygon(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char buf[1 << 21], *p1 = buf, *p2 = buf; int read() { int w = 0, f = 1; char c = ; while (c < 0 || c > 9 ) c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++), f = c == - ? -1 : f; while (c >= 0 && c <= 9 ) w = w * 10 + c - 48, c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); return w * f; } int n, m, a[1000005]; long long val[1000005 << 2], mod; vector<long long> minn[1000005 << 2]; const long long inf = 1e18; void pushup(int p, int l, int r, int mid) { int ls = p << 1, rs = p << 1 | 1, it1 = 0, it2 = 0; while (it1 <= mid - l + 1) { while (it2 <= r - mid) { long long L = max(minn[ls][it1], minn[rs][it2] - val[ls] + mod * it1), R = it1 == mid - l + 1 ? inf : minn[ls][it1 + 1] - 1; if (L > R) break; minn[p][it1 + it2] = min(minn[p][it1 + it2], L), it2++; } it2 = max(it2 - 1, 0), it1++; } val[p] = val[ls] + val[rs]; } void build(int p, int l, int r) { minn[p].resize(r - l + 2); minn[p][0] = -inf; for (int i = 1; i <= r - l + 1; i++) minn[p][i] = inf; if (l == r) { minn[p][1] = mod - a[l]; val[p] = a[l]; return; } int mid = (l + r) >> 1; build(p << 1, l, mid); build(p << 1 | 1, mid + 1, r); pushup(p, l, r, mid); } long long query(int p, int x, int y, long long v, int l, int r) { if (x <= l && r <= y) { int L = 0, R = r - l + 1, res = 0; while (L <= R) { int mid = (L + R) >> 1; if (minn[p][mid] <= v) res = mid, L = mid + 1; else R = mid - 1; } return v + val[p] - mod * res; } int mid = (l + r) >> 1; if (y <= mid) return query(p << 1, x, y, v, l, mid); if (x > mid) return query(p << 1 | 1, x, y, v, mid + 1, r); return query(p << 1 | 1, x, y, query(p << 1, x, y, v, l, mid), mid + 1, r); } signed main() { n = read(), m = read(), mod = read(); for (int i = 1; i <= n; i++) a[i] = read(); build(1, 1, n); int l, r; while (m--) { l = read(), r = read(); printf( %lld n , query(1, l, r, 0, 1, n)); } return 0; } |
#include <bits/stdc++.h> using namespace std; char s[601000]; long long m; long long ans = 0; long long len; long long ll; long long mod = 1; long long reget(long long x) { long long reans = (10 * (ll - ((long long)(s[x] - 0 ) * mod) % m + m) % m + (long long)(s[x] - 0 ) + m) % m; return reans; } long long get(long long l, long long r) { long long t = l; long long temp = 0; while (t <= r) { if (temp >= m) temp = (temp % m + m) % m; while (temp < m && t <= r) { temp = temp * 10 + (long long)(s[t] - 0 ); t++; } } temp = (temp + m) % m; return temp; } int main() { cin >> s; len = strlen(s); cin >> m; ans = get(0, len - 1); for (long long i = 1; i < len; i++) mod = (mod * 10 + m) % m; ll = ans; for (long long i = 0; i < len - 1; i++) { ll = reget(i); if (s[i + 1] == 0 ) continue; ans = min(ll, ans); } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> const long long int N = 2e5 + 10; using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int n; cin >> n; string second; cin >> second; set<char> x; if (n > 26) { cout << -1 << endl; return 0; } for (int i = 0; i < n; i++) { x.insert(second[i]); } cout << n - x.size() << endl; } |
#include <bits/stdc++.h> using namespace std; string s; struct substring { int f, b; bool operator>(const substring &o) const { int cmp = s.compare(f, b - f + 1, s, o.f, o.b - o.f + 1); return cmp != 0 ? cmp > 0 : f > o.f; } }; string kthSubstring(int k) { priority_queue<substring, vector<substring>, greater<substring>> pq; int len = s.length(); for (int i = 0; i < len; i++) { pq.push({i, i}); } while (!pq.empty()) { int f = pq.top().f, b = pq.top().b; pq.pop(); if (--k == 0) return s.substr(f, b - f + 1); if (++b < len) { pq.push({f, b}); } } return ; } int main() { int k; cin >> s >> k; int len = s.length(); long long possible = ((long long)len * (len + 1)) / 2; if (k > possible) cout << No such line. << n ; else cout << kthSubstring(k) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; map<long long, pair<int, int> > mm; int a[maxn]; int b[maxn]; long long s[maxn], s1[maxn]; int main() { int i, j, n; cin >> n; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); s[i] = s[i - 1] + a[i]; } for (i = 1; i <= n; i++) { scanf( %d , &b[i]); s1[i] = s1[i - 1] + b[i]; } int p = n; if (s[n] <= s1[n]) { i = n; while (i >= 0) { if (s[i] < s1[p]) { p--; continue; } if (mm.find(s[i] - s1[p]) != mm.end()) { pair<int, int> p2 = mm[s[i] - s1[p]]; printf( %d n , p2.first - i); for (j = i + 1; j <= p2.first; j++) printf( %d , j); printf( n ); printf( %d n , p2.second - p); for (j = p + 1; j <= p2.second; j++) printf( %d , j); printf( n ); return 0; } mm[s[i] - s1[p]] = make_pair(i, p); i--; } } else { i = n; while (i >= 0) { if (s1[i] < s[p]) { p--; continue; } if (mm.find(s1[i] - s[p]) != mm.end()) { pair<int, int> p2 = mm[s1[i] - s[p]]; printf( %d n , p2.second - p); for (j = p + 1; j <= p2.second; j++) printf( %d , j); printf( n ); printf( %d n , p2.first - i); for (j = i + 1; j <= p2.first; j++) printf( %d , j); printf( n ); return 0; } mm[s1[i] - s[p]] = make_pair(i, p); i--; } } printf( -1 n ); } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 5; int n; int fa[N], r[N]; int rt[N], ls[N * 30], rs[N * 30], siz[N * 30], tot; long long sum[N * 30], ans; void update(int &rt, int l, int r, int p) { if (!rt) rt = ++tot; if (l == r) { siz[rt] = 1, sum[rt] = p; return; } int mid = (l + r) >> 1; if (p <= mid) update(ls[rt], l, mid, p); else update(rs[rt], mid + 1, r, p); siz[rt] = siz[ls[rt]] + siz[rs[rt]]; sum[rt] = sum[ls[rt]] + sum[rs[rt]]; } int merge(int x, int y) { if (!x || !y) return x | y; ans -= sum[ls[x]] * siz[rs[x]] + sum[ls[y]] * siz[rs[y]]; ls[x] = merge(ls[x], ls[y]); rs[x] = merge(rs[x], rs[y]); ans += sum[ls[x]] * siz[rs[x]]; siz[x] += siz[y]; sum[x] += sum[y]; return x; } inline int findf(int x) { return x == fa[x] ? x : fa[x] = findf(fa[x]); } void unify(int x, int y) { x = findf(x), y = findf(y); fa[y] = x; ans -= sum[rt[x]] * x + sum[rt[y]] * y; rt[x] = merge(rt[x], rt[y]); ans += sum[rt[x]] * x; r[x] = r[y]; } int main() { scanf( %d , &n); for (int i = 1; i <= 400000; i++) fa[i] = i, r[i] = i; for (int i = 1, a, b; i <= n; i++) { scanf( %d%d , &a, &b); int p = rt[a] ? r[findf(a)] + 1 : a; ans -= 1ll * a * b; ans += 1ll * p * b; update(rt[p], 1, n, b); if (rt[p - 1]) unify(p - 1, p); if (rt[p + 1]) unify(p, p + 1); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> int d[1005][1005][15][2]; char a[1005], b[1005]; int max(int a, int b) { if (a < b) return b; return a; } int main() { int n, m, k, i, j, l; scanf( %d %d %d , &n, &m, &k); for (i = 1; i <= n; i++) scanf( %c , &a[i]); for (i = 1; i <= m; i++) scanf( %c , &b[i]); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { for (l = 1; l <= k; l++) { d[i][j][l][1] = max(d[i - 1][j][l][1], d[i][j - 1][l][1]); if (a[i] == b[j]) { d[i][j][l][0] = max(d[i][j][l][0], d[i - 1][j - 1][l - 1][1] + 1); d[i][j][l][0] = max(d[i][j][l][0], d[i - 1][j - 1][l][0] + 1); d[i][j][l][1] = max(d[i][j][l][1], d[i - 1][j - 1][l][0] + 1); d[i][j][l][1] = max(d[i][j][l][1], d[i][j][l][0]); } } } } printf( %d , d[n][m][k][1]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); double r = (1 - 1.0 * a / b) * (1 - 1.0 * c / d); r = 1.0 / (1 - r); printf( %.10f n , r * a / b); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, p, v, t, no = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> p >> v >> t; if (p + v + t >= 2) { no++; } } cout << no << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; scanf( %d%d%d%d%d%d , &x, &t, &a, &b, &da, &db); if (x == 0 || (x <= a && x > a - da * t && (a - x) % da == 0) || (x <= b && x > b - db * t && (b - x) % db == 0)) { cout << YES << endl; return 0; } for (int i = 0; i < t; i++) { for (int j = 0; j < t; j++) { if ((a - j * da) + (b - i * db) == x) { printf( YES ); return 0; } } } printf( NO ); } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 100005; int n, k; char s[NMAX]; int sum[NMAX]; int get(int l, int r) { l = max(1, l); r = min(r, n); return sum[r] - sum[l - 1]; } int main() { cin.sync_with_stdio(false); cin >> n >> k; cin >> (s + 1); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (s[i] == 0 ); int ans = 1 << 30; for (int i = 1; i <= n; i++) if (s[i] == 0 ) { int l = 1; int r = n; int sol = -1; while (l <= r) { int mi = (l + r) / 2; if (get(i - mi, i - 1) + get(i + 1, i + mi) >= k) { sol = mi; r = mi - 1; } else l = mi + 1; } if (sol != -1) ans = min(ans, sol); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { register int x = 0, f = 1; register char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + (ch ^ 48), ch = getchar(); return x * f; } const int P = 998244353; const int N = 1e7 + 5; long long fsp(long long x, int y = P - 2) { long long ans = 1; while (y) { if (y & 1) ans = ans * x % P; x = x * x % P, y >>= 1; } return ans; } long long inv[N]; int n, m, a[N], b[N], f[N]; void Add(int &x, int y) { x += y; if (x < 0) x += P; if (x >= P) x -= P; } int main() { n = read(); for (int i = 1; i <= n; i++) a[i] = read(), m += a[i]; b[n] = m; inv[1] = 1; for (int i = 2; i <= m; i++) inv[i] = (P - P / i) * inv[P % i] % P; long long im = fsp(m), in = fsp(n - 1); for (int i = 1; i < m; i++) { long long inv1 = inv[m - i] * m % P * (n - 1) % P; long long inv2 = (1 - im * in % P * (m - i) % P * (n - 2) % P + P) % P; f[i + 1] = inv1 * (inv2 * f[i] % P - i * im % P * (f[i - 1] + 1) % P + P) % P; } int ans = 0; for (int i = 1; i <= n; i++) Add(ans, f[a[i]]); for (int i = 1; i <= n; i++) Add(ans, P - f[b[i]]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char ans[300][300]; string s; int cnt[300]; int bal[300]; int n, m; void f(int l, int r, int ll, int rr) { if (l + 1 == r) { for (int i = 0; i < n / 2 - bal[r]; ++i) { ans[n / 2 + i][ll] = | ; ans[n / 2 - i][ll] = | ; ans[n / 2 + i][rr] = | ; ans[n / 2 - i][rr] = | ; } ans[bal[l] - 1][ll] = + ; ans[n - bal[l]][ll] = + ; ans[bal[l] - 1][rr] = + ; ans[n - bal[l]][rr] = + ; ans[bal[l] - 1][ll + 1] = - ; ans[n - bal[l]][ll + 1] = - ; ans[bal[l] - 1][rr - 1] = - ; ans[n - bal[l]][rr - 1] = - ; if (ll + 4 != rr) { throw 1; } return; } int q = l; int bl = 0; for (q = l; q <= r; ++q) { if (s[q] == [ ) { ++bl; } else { --bl; } if (bl == 0) { break; } } if (q == r) { for (int i = 0; i < n / 2 - bal[r]; ++i) { ans[n / 2 + i][ll] = | ; ans[n / 2 - i][ll] = | ; ans[n / 2 + i][rr] = | ; ans[n / 2 - i][rr] = | ; } ans[bal[l] - 1][ll] = + ; ans[n - bal[l]][ll] = + ; ans[bal[l] - 1][rr] = + ; ans[n - bal[l]][rr] = + ; ans[bal[l] - 1][ll + 1] = - ; ans[n - bal[l]][ll + 1] = - ; ans[bal[l] - 1][rr - 1] = - ; ans[n - bal[l]][rr - 1] = - ; f(l + 1, r - 1, ll + 1, rr - 1); return; } int qq = ll + q - l + (cnt[q] - cnt[l]) * 3; f(l, q, ll, qq); f(q + 1, r, qq + 1, rr); } int main() { memset(ans, , sizeof(ans)); int qwe; cin >> qwe; cin >> s; int bl = 0; int mx = 0; for (int i = 0; i < s.size(); ++i) { if (s[i] == [ ) { ++bl; mx = max(mx, bl); } else { if (s[i - 1] == [ ) { cnt[i] = 1; } --bl; } bal[i] = bl; cnt[i] += i > 0 ? cnt[i - 1] : 0; } n = mx * 2 + 1; m = s.size() + cnt[s.size() - 1] * 3; f(0, s.size() - 1, 0, m - 1); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << ans[i][j]; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); bool isPrime(long long a) { long long i; for (i = 2; i * i <= a; i++) { if (a % i == 0) { return 0; } } return (a != 1); } bool isPalindrom(const string &s, int l, int r) { for (int i = 0; i < (r - l + 1) / 2; i++) { if (s[l + i] != s[r - i]) { return 0; } } return 1; } template <class type1> type1 gcd(type1 a, type1 b) { type1 t; while (b) { t = b; b = a % b; a = t; } return a; } long long positiveMod(long long v, long long md) { v = v % md; if (v < 0) { v += md; } return v; } class information { public: vector<pair<long long, long long> > dat; vector<long long> *stL, *stR; long long iq, n; void build() { n = dat.size(); sort(dat.begin(), dat.end()); stL = new vector<long long>[4 * n]; stR = new vector<long long>[4 * n]; buildSt(1, 0, n - 1); } void buildSt(long long v, long long l, long long r) { if (l == r) { stL[v].push_back(dat[l].first - dat[l].second); stR[v].push_back(dat[l].first + dat[l].second); } else { long long mid = (l + r) / 2; buildSt(v * 2, l, mid); buildSt(v * 2 + 1, mid + 1, r); int i1, i2; i1 = i2 = 0; while (i1 != stL[v * 2].size() || i2 != stL[v * 2 + 1].size()) { if (i1 == stL[v * 2].size()) { stL[v].push_back(stL[v * 2 + 1][i2]); i2++; } else if (i2 == stL[v * 2 + 1].size()) { stL[v].push_back(stL[v * 2][i1]); i1++; } else { if (stL[v * 2][i1] < stL[v * 2 + 1][i2]) { stL[v].push_back(stL[v * 2][i1]); i1++; } else { stL[v].push_back(stL[v * 2 + 1][i2]); i2++; } } } i1 = i2 = 0; while (i1 != stR[v * 2].size() || i2 != stR[v * 2 + 1].size()) { if (i1 == stR[v * 2].size()) { stR[v].push_back(stR[v * 2 + 1][i2]); i2++; } else if (i2 == stR[v * 2 + 1].size()) { stR[v].push_back(stR[v * 2][i1]); i1++; } else { if (stR[v * 2][i1] > stR[v * 2 + 1][i2]) { stR[v].push_back(stR[v * 2][i1]); i1++; } else { stR[v].push_back(stR[v * 2 + 1][i2]); i2++; } } } } } long long getSum(long long v, long long l, long long r, long long tl, long long tr, long long val) { if (l == tl && tr == r) { long long mid, res = 0; l = 0; r = stL[v].size(); while (l != r) { mid = (l + r) / 2; if (stL[v][mid] > val) { r = mid; } else { l = mid + 1; } } res += stL[v].size() - l; l = 0; r = stR[v].size(); while (l != r) { mid = (l + r) / 2; if (stR[v][mid] >= val) { l = mid + 1; } else { r = mid; } } res += stR[v].size() - l; return res; } else { long long mid = (l + r) / 2; if (tr <= mid) { return getSum(v * 2, l, mid, tl, tr, val); } else if (tl > mid) { return getSum(v * 2 + 1, mid + 1, r, tl, tr, val); } else { return getSum(v * 2, l, mid, tl, mid, val) + getSum(v * 2 + 1, mid + 1, r, mid + 1, tr, val); } } } long long getCount(long long x, long long rad) { long long l, r, i, j, st, en, mid; l = 0; r = n; while (l != r) { mid = (l + r) / 2; if (dat[mid].first >= x - rad) { r = mid; } else { l = mid + 1; } } st = l; l = -1; r = n - 1; while (l != r) { mid = (l + r + 1) / 2; if (dat[mid].first <= x + rad) { l = mid; } else { r = mid - 1; } } en = r; if (en < st) { return 0; } else { return (en - st + 1) - getSum(1, 0, n - 1, st, en, x); } } }; vector<information> inf; vector<pair<long long, pair<long long, long long> > > inp; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, k, i, j, a, b, c, l, r, res = 0; cin >> n >> k; for (i = 0; i < n; i++) { cin >> a >> b >> c; inp.push_back({c, {a, b}}); } sort(inp.begin(), inp.end()); for (i = 0; i < n;) { l = i; r = i; while (r < n) { if (inp[r].first == inp[l].first) { r++; } else { break; } } information t; t.iq = inp[l].first; for (j = l; j < r; j++) { t.dat.push_back(inp[j].second); } inf.push_back(t); inf.back().build(); i = r; } for (i = 0; i < inf.size(); i++) { a = 0; for (auto it : inf[i].dat) { a += inf[i].getCount(it.first, it.second); for (j = i - 1; j >= 0; j--) { if ((inf[i].iq - inf[j].iq) > k) { break; } else { res += inf[j].getCount(it.first, it.second); } } } res += (a - inf[i].n) / 2; } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, k, t, sum = 0, a, b, p; cin >> t; while (t--) { bool fg = 0; p = 0; k = 0; sum = 0; cin >> a >> b; string s; cin >> s; n = s.size(); for (long long int i = 0; i <= n - 1; i++) { if (s[i] == 1 ) { if (fg == 0) { p += a; fg = 1; k = 0; } else if (k > 0) { p += min(k * b, a); k = 0; continue; } } else k++; } cout << p << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a; int main() { scanf( %d%d , &n, &m); if (n == 1) printf( 1 n ); else { if (m > n / 2) printf( %d n , m - 1); else printf( %d n , m + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b, res; int main() { cin >> n >> a >> b; for (int i = 1; i <= min(a, b); i++) { if (a / i + b / i >= n) { res = i; } } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; const string ALICE = Alice , BOB = Bob ; void solve_case() { int N, K; cin >> N >> K; if (K % 3 != 0) { cout << (N % 3 != 0 ? ALICE : BOB) << n ; return; } N %= K + 1; cout << (N % 3 == 0 && N < K ? BOB : ALICE) << n ; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int T; cin >> T; while (T-- > 0) solve_case(); } |
#include <bits/stdc++.h> using namespace std; int a[105][105], u[105], v[105]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); for (int j = 0; j < m; j++) { int cnt[105] = {}; for (int i = 0; i < n; i++) if (!u[i]) ++cnt[a[i][j]]; for (int i = 0; i < n; i++) if (!u[i] && a[i][j]) { if (v[a[i][j]]) u[i] = j + 1; else if (cnt[a[i][j]] >= 2) u[i] = v[a[i][j]] = j + 1; } } for (int i = 0; i < n; i++) printf( %d n , u[i]); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (2 * m >= n) cout << 0; else cout << n - 2 * m; cout << ; for (long long i = 0; i <= n; i++) { if ((i * (i - 1)) / 2 >= m) { cout << n - i; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; return r; } long long inv(long long first) { return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P; } inline int rd() { int first = 0; char p = getchar(); while (p < 0 || p > 9 ) p = getchar(); while (p >= 0 && p <= 9 ) first = first * 10 + p - 0 , p = getchar(); return first; } const int N = 1e6 + 10; int n, m, k, a[N], deg1[N], deg2[N]; int L[N], R[N], vis[N]; int first[N], second[N], b[N]; vector<int> g1[N], g2[N]; int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; ++i) { scanf( %d , a + i); if (a[i]) L[i] = R[i] = a[i]; else L[i] = 1, R[i] = k; } for (int i = 1; i <= m; ++i) { scanf( %d%d , first + i, second + i); g2[first[i]].push_back(second[i]), ++deg2[second[i]]; g1[second[i]].push_back(first[i]), ++deg1[first[i]]; } queue<int> q; for (int i = 1; i <= n; ++i) if (!deg1[i]) q.push(i); int cnt = 0; while (q.size()) { int u = q.front(); q.pop(); if (L[u] > R[u]) return puts( -1 ), 0; ++cnt; for (auto &v : g1[u]) { L[v] = max(L[v], L[u] + 1); if (!--deg1[v]) q.push(v); } } if (cnt != n) return puts( -1 ), 0; for (int i = 1; i <= n; ++i) if (!deg2[i]) q.push(i); while (q.size()) { int u = q.front(); q.pop(); if (L[u] > R[u]) return puts( -1 ), 0; for (auto &v : g2[u]) { R[v] = min(R[v], R[u] - 1); if (!--deg2[v]) q.push(v); } } for (int i = 1; i <= n; ++i) b[i] = i; sort(b + 1, b + 1 + n, [](int a, int b) { return L[a] < L[b]; }); int now = 1; set<pair<int, int> > s; for (int i = 1; i <= k; ++i) { while (now <= n && L[b[now]] <= i) { s.insert(pair<int, int>(R[b[now]], b[now])); ++now; } int ok = 0; while (s.size()) { int id = s.begin()->second; if (ok && R[id] > i) break; ok = 1; s.erase(s.begin()); a[id] = i; } if (!ok) return puts( -1 ), 0; } for (int i = 1; i <= n; ++i) printf( %d , a[i] ? a[i] : L[i]); putchar(10); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int M = 22; int n, a[N]; long long f[N][M][2]; vector<int> v[N]; long long ans = 0; void dfs(int x, int tr) { ans += a[x]; for (int i = 0; i < M; i++) { f[x][i][(a[x] >> i) & 1]++; } for (auto u : v[x]) if (u != tr) { dfs(u, x); for (int i = 0; i < M; i++) { ans += (1 << i) * (f[x][i][0] * f[u][i][1] + f[x][i][1] * f[u][i][0]); f[x][i][((a[x] >> i) & 1) ^ 0] += f[u][i][0]; f[x][i][((a[x] >> i) & 1) ^ 1] += f[u][i][1]; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dfs(1, 0); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int DIM = 1005; bitset<DIM> oki; int val[DIM], nxt[DIM]; int main(void) { ios ::sync_with_stdio(false); cin.tie(); cout.tie(); int n, m, ans = 0; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> val[i], nxt[i] = -1; for (int i = 1; i <= m; ++i) { int x; cin >> x; for (int j = 1; j <= n; ++j) if (nxt[x] < nxt[j]) ans += val[j]; nxt[x] = i; } cout << ans << endl; return 0; } |
// Author: wlzhouzhuan #pragma GCC optimize( Ofast ) #pragma GCC target( avx ) #include <bits/stdc++.h> using namespace std; #define ull unsigned long long namespace IO { const int SIZE = 1 << 23; char ibuf[SIZE], *iS, *iT; char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1; bool flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; return true; } #define gc() (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++) #define pc(x) (*oS++ = x) int read() { int x = 0, f = 0; char c = gc(); while (!isdigit(c)) f |= c == - , c = gc(); while (isdigit(c)) x = 10 * x + c - 0 , c = gc(); return f ? -x : x; } char qu[55]; int qlen; template <class T> void print(T x) { if (!x) pc( 0 ); if (x < 0) pc( - ), x = -x; while (x) qu[++qlen] = x % 10 + 0 , x /= 10; while (qlen) pc(qu[qlen--]); } template <class T> void print(T x, char charset) { print(x), pc(charset); } struct Flusher { ~Flusher() { flush(); } } flusher; } using namespace IO; const int N = 1005; const int mod = 998244353; int qpow(int a, int b = mod - 2) { int res = 1; while (b > 0) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; b >>= 1; } return res; } ull mul(ull a, ull b) { return (static_cast<unsigned long long>(a) * b) % mod; } int a[N], m, n; ull fz = 1, sumfz = 0, fm = 1, ans = 0; int j = 0; void run(int t) { for (; j < t; j++) { fz = mul(fz, 2 * n - j); sumfz = mul(sumfz, (n - j)) + fz; fm = mul(fm, n - j); } } int main() { m = read(); for (int i = 1; i <= m; i++) { a[i] = read(), n += a[i]; } sort(a + 1, a + m + 1); for (int i = 1; i <= m; i++) { run(a[i]); ans = (ans + mul(sumfz, qpow(fm))) % mod; } run(n); ans = (ans + mod - mul(sumfz, qpow(fm))) % mod; print((mod - ans) % mod, n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (n > m) swap(m, n); long long cc = 0; for (int i = 1; i <= n; i++) { cc += (m + i) / 5 - i / 5; } cout << cc << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char c[101]; int count = 0; int sum = 0; while (cin.getline(c, 101)) { if (c[0] == + ) { count++; continue; } if (c[0] == - ) { count--; continue; } int x = 0; for (; c[x] != : ; x++) { } sum += (strlen(c) - (x + 1)) * count; } cout << sum; } |
#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...); } const int SIZE = 2e5 + 5; const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; void fastio() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void solveTest() { long long n, m; cin >> n >> m; --m; vector<long long> a(n); long long mn = INT_MAX; for (int i = 0; i < n; i++) { cin >> a[i]; mn = min(mn, a[i]); } for (int i = 0; i < n; i++) { a[i] -= mn; } long long cnt = (1ll * mn) * n; while (a[m] != 0) { a[m]--; cnt++; if (m == 0) m = n - 1; else m--; } a[m] = cnt; for (int i = 0; i < n; i++) { cout << a[i] << ; } return; } int main() { fastio(); int t = 1; while (t--) { solveTest(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k; int log2(long long x) { int ret = 0; while (x > 0) { x /= 2; ret++; } return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); clock_t ck; ck = clock(); cin >> n >> k; if (k == 1) { cout << n << n ; return 0; } int exp = log2(n); cout << (1ll << exp) - 1 << n ; ck = clock() - ck; cerr << It took << 1.0 * ck / CLOCKS_PER_SEC << sec n ; return 0; } |
#include<bits/stdc++.h> using namespace std; int n; inline int lst(int i){return i==1?n:i-1;} inline int nxt(int i){return i==n?1:i+1;} inline int lst(int i,int d){return (((i-d-1)%n+n)%n+1);} inline int nxt(int i,int d){return ((i+d-1)%n+1);} inline int getval(){ fflush(stdout); int val; scanf( %d ,&val); return val; } inline int curval(int i){ printf( ? %d n n ,i); return getval(); } inline int lstval(int i){ printf( ? %d n n ,lst(i)); return getval(); } inline int nxtval(int i){ printf( ? %d n n ,nxt(i)); return getval(); } int k; int a[200],b[200]; inline void ansis(int ans) { printf( ! %d n ,ans); exit(0); } inline void findit(int pos,int val,int len) { if (val>k){ int lef=1,rig=len,mid; while (lef<=rig){ mid=((lef+rig)>>1); int curpos=lst(pos,mid); int cur=curval(curpos); if (cur==k) ansis(curpos); if (cur>k) lef=mid+1; else rig=mid-1; } }else{ int lef=1,rig=len,mid; while (lef<=rig){ mid=((lef+rig)>>1); int curpos=nxt(pos,mid); int cur=curval(curpos); if (cur==k) ansis(curpos); if (cur<k) lef=mid+1; else rig=mid-1; } } } int main() { scanf( %d%d ,&n,&k); curval(1); int pos=1; for (int t=1;t<=950;t+=2){ int val1=curval(pos); if (val1!=k) { findit(pos,val1,t); return 0; } int val2=nxtval(pos); if (val2!=k) { findit(nxt(pos),val2,t+1); return 0; } pos=nxt(pos,t*2+1); } } |
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 77; int n, q; long long a[N]; vector<long long> V, Ps; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %lld , a + i); if (n == 1) { int q; scanf( %d , &q); long long x, y; while (q--) { scanf( %lld %lld , &x, &y); x = y - x + 1; printf( %lld , x); } return 0; } sort(a + 1, a + 1 + n); for (int i = 2; i <= n; ++i) V.push_back(a[i] - a[i - 1]); sort(V.begin(), V.end()); Ps.push_back(V[0]); for (int i = 3; i <= n; ++i) Ps.push_back(Ps.back() + V[i - 2]); int sz = V.size(); scanf( %d , &q); while (q--) { long long x, y; scanf( %lld %lld , &x, &y); x = y - x + 1; int id = upper_bound(V.begin(), V.end(), x - 1) - V.begin() - 1; long long A = 0; if (id == -1) { A = n * x; } else { A = (n - id - 1) * x + Ps[id]; } printf( %lld , A); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> prefix_function(string s) { int n = (int)s.length(); vector<int> pi(n); 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; } int main() { int t, n, x = 0; cin >> t >> n; string s; cin >> s; cout << s; vector<int> v = prefix_function(s); s = s.substr(v[v.size() - 1], s.size() - v[v.size() - 1]); for (int i = 1; i < n; i++) { cout << s; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; long long d = abs(a - b); long long p1 = (d + 1) / 2, p2 = d / 2; long long s1 = (p1 * (p1 + 1)) / 2, s2 = (p2 * (p2 + 1)) / 2; cout << s1 + s2; } |
#include <bits/stdc++.h> using namespace std; int n, q; int a[200010]; int last[200010]; int x = -1, y = -1, z = -1; stack<int> t; int main() { scanf( %d%d , &n, &q); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] == 0) { z = i; if (i) a[i] = a[i - 1]; } else { if (x == -1) x = i; if (a[i] == q) y = i; } } if (x == -1) { cout << YES << endl; for (int i = 0; i < n; i++) cout << q << ; return 0; } for (int i = x - 1; i >= 0; i--) a[i] = a[i + 1]; if (y == -1) { if (z == -1) { cout << NO << endl; return 0; } a[z] = q; } for (int i = 0; i < n; i++) last[a[i]] = i; for (int i = 0; i < n; i++) { if (!t.empty() && t.top() > a[i]) { cout << NO << endl; return 0; } else if (t.empty() || t.top() < a[i]) t.push(a[i]); if (last[a[i]] == i) t.pop(); } cout << YES << endl; for (int i = 0; i < n; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> char c[99]; int i, x; int main() { for (;;) { scanf( %s , c); fflush(stdout); ; if (*c == e ) break; for (i = 2; i <= 1 << 30; i <<= 1) { printf( ? %d %d n , i, i >> 1); fflush(stdout); ; scanf( %s , c); fflush(stdout); ; if (*c == y || i == 1 << 30) break; } if (*c == x ) { puts( ! 1 ); fflush(stdout); ; continue; } int l = i >> 1, r = i, m; for (; l + 1 < r;) { m = (l + r) >> 1; printf( ? %d %d n , l, m); fflush(stdout); ; scanf( %s , c); fflush(stdout); ; if (*c == y ) l = m; else r = m; } printf( ! %d n , r); fflush(stdout); ; } return 0; } |
#include <bits/stdc++.h> const int maxn = 1e5 + 500; const int mod = 1e9 + 7; const int inf = 123456789; using namespace std; int n, t, a, b, c; vector<int> v[maxn], ans2[maxn]; vector<int> ans; set<int> st[maxn]; int vis[maxn]; map<tuple<int, int>, int> mp; void add(int a, int b, int i) { if (mp.find({a, b}) != mp.end()) { int x = mp[{a, b}]; ans2[x].push_back(i); ans2[i].push_back(x); mp.erase({a, b}); } else { mp[{a, b}] = i; } } void ins(int a, int b) { if (st[a].count(b)) { st[a].erase(b); } else { st[a].insert(b); } if (st[b].count(a)) { st[b].erase(a); } else { st[b].insert(a); } } void dfs(int x, int fa) { vis[x] = 1; ans.push_back(x); for (int i : v[x]) { if (i == fa || vis[i]) continue; dfs(i, x); if (x == 1) break; } } void dfs1(int x, int fa) { for (int i : ans2[x]) { if (i != fa) { dfs1(i, x); } } cout << x << ; } void init(int x) { ans.clear(); mp.clear(); memset(vis, 0, sizeof(vis)); for (int i = 1; i <= x; i++) { ans2[i].clear(); v[i].clear(); st[i].clear(); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { cin >> n; init(n); for (int i = 1; i < n - 1; i++) { cin >> a >> b >> c; if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c); ins(a, b); ins(a, c); ins(b, c); add(a, b, i); add(a, c, i); add(b, c, i); } for (int i = 1; i <= n; i++) { for (int it : st[i]) { v[i].push_back(it); } } dfs(1, 0); for (int i : ans) { cout << i << ; } cout << n ; dfs1(1, 0); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int Tn; cin >> Tn; while (Tn--) { int n, x; cin >> n >> x; int mx = 0, flag = 0; while (n--) { int t; cin >> t; if (t == x) flag = 1; mx = max(mx, t); } if (!flag) printf( %d n , max((x - 1) / mx + 1, 2)); else printf( %d n , 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; long long c[2][2][MAXN][MAXN] = {0}; int n, m; long long val; int lowbit(int x) { return x & -x; } void add(int a, int b) { for (int i = a; i <= n; i += lowbit(i)) for (int j = b; j <= n; j += lowbit(j)) c[a & 1][b & 1][i][j] ^= val; } long long sum(int a, int b) { long long ans = 0; for (int i = a; i >= 1; i -= lowbit(i)) for (int j = b; j >= 1; j -= lowbit(j)) ans ^= c[a & 1][b & 1][i][j]; return ans; } int main() { scanf( %d%d , &n, &m); int x1, x2, y1, y2, op; long long ans; for (int i = 1; i <= m; i++) { scanf( %d , &op); if (op == 1) { scanf( %d%d%d%d , &x1, &y1, &x2, &y2); ans = sum(x2, y2) ^ sum(x2, y1 - 1) ^ sum(x1 - 1, y2) ^ sum(x1 - 1, y1 - 1); printf( %I64d n , ans); } else { scanf( %d%d%d%d%I64d , &x1, &y1, &x2, &y2, &val); add(x1, y1); add(x2 + 1, y1); add(x1, y2 + 1); add(x2 + 1, y2 + 1); } } return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr int maxn = 1010; constexpr int dx[5] = {0, 0, 1, -1}; constexpr int dy[5] = {1, -1, 0, 0}; using Node = struct { int x, y, v; }; char G[maxn][maxn]; bool vis[maxn][maxn]; int n, m; vector<Node> p, ret; inline bool ok(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } void gao(int x, int y) { int tot = 1; bool flag = true; bool yes = false; while (flag) { flag = false; int cnt = 0; for (int i = 0; i < 4; i++) { int tx = x + dx[i] * tot; int ty = y + dy[i] * tot; if (ok(tx, ty) && G[tx][ty] == * ) cnt++; } if (cnt != 4) break; for (int i = 0; i < 4; i++) { int tx = x + dx[i] * tot; int ty = y + dy[i] * tot; vis[tx][ty] = 1; } flag = true; yes = true; tot++; } if (yes) { vis[x][y] = 1; ret.push_back({x + 1, y + 1, tot - 1}); } } signed main() { while (~scanf( %d%d , &n, &m)) { p.clear(); ret.clear(); memset(vis, 0, sizeof(vis)); for (int i = 0; i < n; i++) scanf( %s , G[i]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (G[i][j] == * ) p.push_back({i, j, 0}); } } if (p.size() == 0) { printf( 0 n ); continue; } for (auto t : p) gao(t.x, t.y); if (ret.size() == 0) { printf( -1 n ); continue; } bool flag = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (!vis[i][j] && G[i][j] == * ) { flag = 1; } } } if (flag) { printf( -1 n ); continue; } printf( %d n , ret.size()); for (auto t : ret) { printf( %d %d %d n , t.x, t.y, t.v); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[1003][1003][11][2]; string s, t; int n, m; int k; int rec(int i, int j, int how_k, int op) { if (how_k > k) return -1e9; if (i >= n || j >= m) { if (how_k == k && !op) return 0; return -1e9; } if (s[i] != t[j] && op) return -1e9; int &ret = dp[i][j][how_k][op]; if (ret != -1) return ret; ret = -1e9; if (s[i] == t[j]) { if (op) { ret = max(ret, rec(i + 1, j + 1, how_k + 1, 0) + 1); ret = max(ret, rec(i + 1, j + 1, how_k, op) + 1); } else { ret = max(ret, rec(i + 1, j + 1, how_k + 1, op) + 1); ret = max(ret, rec(i + 1, j + 1, how_k, 1) + 1); } } ret = max(ret, rec(i + 1, j, how_k + (op == 1), 0)); ret = max(ret, rec(i, j + 1, how_k + (op == 1), 0)); return ret; } int main() { cin >> n >> m >> k; memset(dp, -1, sizeof dp); cin >> s >> t; cout << rec(0, 0, 0, 0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200500; int mapp[maxn], num[maxn], ans[maxn]; int main() { int n, a, b, k; while (cin >> n >> a >> b >> k) { memset(ans, 0, sizeof(ans)); char c; for (int i = 0; i < n; i++) { cin >> c; mapp[i] = c - 0 ; } int len = 0, pos = 0, tk = a; int sum, sum2 = 0; for (int i = 0; i < n; i++) { if (0 == mapp[i]) len++; if (1 == mapp[i] || i == n - 1) { num[pos++] = len; int kk = len / b; if (kk <= tk) tk -= kk; else { if (i == n - 1 && !mapp[i]) i++; for (int j = tk + 1; j <= kk; j++) { ans[i - len - 1 + j * b] = 1; sum2++; } tk = 0; } len = 0; } } sum = 1; len = 0; for (int i = 0; i < n; i++) { if (0 == mapp[i]) len++; if ((1 == mapp[i] || i == n - 1) && sum > 0) { if (i == n - 1 && !mapp[i]) i++; int kk = len / b; for (int j = 1; j <= kk; j++) { sum--; if (!ans[i - len - 1 + j * b]) sum2++; ans[i - len - 1 + j * b] = 1; if (sum <= 0) break; } len = 0; } } cout << sum2 << endl; int flag = 0; for (int i = 0; i < n; i++) { if (!ans[i]) continue; if (!flag) flag = 1; else cout << ; cout << i + 1; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; long long n, n1, n2, a[111111], sum1 = 0, sum2 = 0; int main() { cin >> n >> n1 >> n2; for (int i = 0; i < n; i++) cin >> a[i]; if (n1 > n2) swap(n1, n2); sort(a, a + n); reverse(a, a + n); int i = 0; int m1 = n1; int m2 = n2; while (m1 != 0) { sum1 += a[i]; i++; m1--; } while (m2 != 0) { sum2 += a[i]; i++; m2--; } cout << fixed << setprecision(7) << (sum1 * 1.0 / n1) + (sum2 * 1.0 / n2); } |
#include <bits/stdc++.h> using namespace std; const int N = 110000; int s1, s2; int n, a[N]; int mi[17][N * 2], ma[17][N * 2]; int BB[N * 2]; int getmi(int l, int r) { return min(mi[BB[r - l + 1]][l], mi[BB[r - l + 1]][r - (1 << BB[r - l + 1]) + 1]); } int getma(int l, int r) { return max(ma[BB[r - l + 1]][l], ma[BB[r - l + 1]][r - (1 << BB[r - l + 1]) + 1]); } void init() { for (int j = (int)0; j <= (int)16; j++) for (int i = (int)(1 << j); i <= (int)(1 << (j + 1)) - 1; i++) BB[i] = j; for (int i = (int)1; i <= (int)n; i++) { mi[0][i] = ma[0][i] = a[i]; } for (int j = (int)1; j <= (int)16; j++) for (int i = (int)1; i <= (int)n - (1 << j) + 1; i++) { mi[j][i] = min(mi[j - 1][i], mi[j - 1][i + (1 << (j - 1))]); ma[j][i] = max(ma[j - 1][i], ma[j - 1][i + (1 << (j - 1))]); } } bool f[N], g[N]; bool check(int S) { for (int i = (int)0; i <= (int)n; i++) f[i] = g[i] = 0; f[0] = g[0] = 1; int maf, mag; maf = mag = 0; for (int i = (int)0; i <= (int)n - 1; i++) { bool f1 = (i <= maf); bool f2 = (i <= mag); if (f1) { int now = a[i]; if (i == 0) now = s1; int l = i + 1; int r = n; int rt = 0; while (l < r) { int mid = (l + r) >> 1; if ((abs(getma(i + 1, mid) - now) > S) || (abs(getmi(i + 1, mid) - now) > S)) r = mid; else l = mid + 1, rt = mid; } if (!(abs((getma(i + 1, l) - now) > S) || (abs(getmi(i + 1, l) - now) > S))) rt = l; mag = max(mag, rt); } if (f2) { int now = a[i]; if (i == 0) now = s2; int l = i + 1; int r = n; int rt = 0; while (l < r) { int mid = (l + r) >> 1; if ((abs(getma(i + 1, mid) - now) > S) || (abs(getmi(i + 1, mid) - now) > S)) r = mid; else l = mid + 1, rt = mid; } if (!((abs(getma(i + 1, l) - now) > S) || (abs(getmi(i + 1, l) - now) > S))) rt = l; maf = max(maf, rt); } } return (maf == n) || (mag == n); } int main() { scanf( %d%d%d , &n, &s1, &s2); for (int i = (int)1; i <= (int)n; i++) scanf( %d , &a[i]); init(); int L = abs(s1 - s2); int R = 1000000000; int ans = 0; while (L < R) { int mid = (L + R) >> 1; if (check(mid)) ans = mid, R = mid; else L = mid + 1; } if (check(L)) ans = L; cout << ans << endl; return 0; } |
#pragma GCC diagnostic ignored -Wunused-parameter #define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define INP solve #define OUT solve const long long INF_LL = 8e18; const int INF = 1e9 + 100; const int MOD = 1e9 + 7; //const int Base = 311;9 const long double EPS = 1e-10; const int BLOCK = 1000; const int dx[4] = {0, 0, 1, -1}; const int dy[4] = {1, -1, 0, 0}; mt19937 rnd(chrono::system_clock::now().time_since_epoch().count()); void open_file() { #ifdef THEMIS freopen(INP .inp , r ,stdin); freopen(OUT .out , w ,stdout); #endif // THEMIS } const int maxN = 3e5 + 100; void sol(){ int n; cin >> n; vector<vector<int> > s(n); map<int, int> id; int M = 0; int N = 0; for (int i = 0; i < n; i++) { int k; cin >> k; M += k; s[i].resize(k); for (int j = 0; j < k; j++) { int x; cin >> x; if (!id.count(x)) id[x] = N++; s[i][j] = id[x]; } sort(s[i].begin(), s[i].end()); } int block = (int)sqrt(M) + 1; vector<int> large, small; for (int i = 0; i < n; i++) { if ((int)s[i].size() >= block) large.push_back(i); else small.push_back(i); } int time = 0; vector<int> visited(N, 0); for (int u : large) { time++; for (int x : s[u]) visited[x] = time; for (int v = 0; v < n; v++) { if (u == v) continue; int d = 0; for (int val : s[v]) { d += visited[val] == time; if (d == 2) { cout << u + 1 << << v + 1 << n ; return; } } } } vector<vector<int> > adj(N); for (int i = 0; i < n; i++) { for (int x : s[i]) adj[x].push_back(i); } vector<int> last(N, -1), pos(N, -1); for (int u = 0; u < N; u++) { for (int i : adj[u]) { if ((int)s[i].size() < block) { for (int j = 0; j < (int)s[i].size() && s[i][j] < u; j++) { int v = s[i][j]; if (last[v] == u) { cout << pos[v] + 1 << << i + 1 << n ; return; } last[v] = u; pos[v] = i; } } } } cout << -1 << n ; } void solve() { clock_t begin = clock(); int T; cin >> T; //T = 1; int TestCase = 0; while (T--) { TestCase += 1; //cout << Case # << TestCase << : << ; //cout << Test << TestCase << : ; sol(); } clock_t end = clock(); cerr << Time: << fixed << setprecision(10) << (double)(end - begin) / (double)CLOCKS_PER_SEC << n ; } int main(int argc,char *argv[]) { ///srand(time(nullptr)); ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); open_file(); solve(); } |
#include <bits/stdc++.h> #define int long long #define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) using namespace std; #define MOD 1000000007 #define nline n #define pb push_back #define mp make_pair #define fi first #define se second #define yes cout<< YES n #define no cout<< NO n #define vi vector<int> #define pii pair<int,int> #define sz(v) v.size() #define lcm(a,b) (a*b)/(__gcd(a,b)) #define deb(x) cout<<#x<< = <<x<<endl; #define deb2(x,y) cout<<#x<< = <<x<< <<#y<< = <<y<<endl; #define deb3(x,y,z) cout<<#x<< = <<x<< <<#y<< = <<y<< <<#z<< = <<z<<endl; #define PR(a,n) cout<<#a<< = ;for(int _=0;_<n;_++)cout<<a[_]<< ;cout<<endl; #define all(v) v.begin(),v.end() #define sortv(v) sort(all(v)); #define sortrev(v) sort(all(v),greater<int>()) #define maxHeap priority_queue<int> #define minHeap priority_queue<int, vector<int>, greater<int>> int pow(int a, int b, int m){ int ans = 1; while(b){ if (b&1) ans = (ans*a) % m; b /= 2; a = (a*a) % m; } return ans; } int SumOfDigits(int x) { if (x < 0)return -1; int s = 0; while(x) { s += x%10; x /= 10; } return s; } //lower_bound = first element >= val, end otherwise //upper_bound = first element > val, end otherwise //remember 2 pointer , binary search , bits method //always look for the edges i.e max value ad min value possible inline void solve() { int k,n,m; cin>>k>>n>>m; int a[n],b[m]; int cnt1 = 0,cnt2=0; vi x,y; for(int i=0;i<n;i++) { cin>>a[i]; } for(int i=0;i<m;i++) { cin>>b[i]; } vi ans; int i=0,j=0; int total = k; while(1) { if(sz(ans)==n+m) break; if(a[i]==0 && i<n) { ans.pb(0); total++; i++; continue; } else if(b[j]==0 && j<m) { ans.pb(0); total++; j++; continue; } if(( a[i]<b[j] && (i<n && j<m) ) || (i<n && j>=m)) { if(total>=a[i]) { ans.pb(a[i]); i++; } else { cout<<-1<<nline; return; } } else if( (a[i]>=b[j] && (j<m && i<n)) || (j<m && i>=n) ) { if(total>=b[j]) { ans.pb(b[j]); j++; } else { cout<<-1<<nline; return; } } } if(sz(ans)==n+m) { for(auto x:ans) cout<<x<< ; cout<<nline; } else cout<<-1<<nline; return; } signed main() { boost; int t=1; cin>>t; for(int tt=1;tt<=t;tt++) { // cout<< Case # <<tt<< : ; solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 503; int m, n, vis[N][N]; vector<int> adj[N * N]; void init() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int id(int x, int y) { return (x - 1) * n + y; } struct ds { char c; int x, y; }; vector<ds> V; void print(int u, int cc, int type = -1) { int x = (u - 1) / n + 1, y = u - (x - 1) * n; if (adj[u].size() == 0 && !type) { V.push_back((ds){ R , x, y}); return; } V.push_back((ds){ B , x, y}); for (int v : adj[u]) print(v, cc, 0); if (!type) V.push_back((ds){ D , x, y}), V.push_back((ds){ R , x, y}); } int cc = 0; queue<pair<int, int> > Q; int hang[4] = {0, 0, 1, -1}; int cot[4] = {1, -1, 0, 0}; void build(int orgx, int orgy, int cc) { vis[orgx][orgy] = cc; Q.push({orgx, orgy}); while (Q.size()) { int x = Q.front().first, y = Q.front().second; Q.pop(); for (int t = 0; t <= (int)3; ++t) { int nx = x + hang[t], ny = y + cot[t]; if (nx < 1 || nx > m || ny < 1 || ny > n || vis[nx][ny]) continue; adj[id(x, y)].push_back(id(nx, ny)); vis[nx][ny] = cc; Q.push({nx, ny}); } } print(id(orgx, orgy), cc); } void solve() { cin >> m >> n; for (int i = 1; i <= (int)m; ++i) for (int j = 1; j <= (int)n; ++j) { char c; cin >> c; if (c == # ) vis[i][j] = -1; } for (int i = 1; i <= (int)m; ++i) for (int j = 1; j <= (int)n; ++j) if (!vis[i][j]) build(i, j, ++cc); cout << V.size() << n ; for (ds it : V) cout << it.c << << it.x << << it.y << n ; } int main() { init(); solve(); } |
#include <bits/stdc++.h> using namespace std; queue<int> q; const int maxn = 40007; const int maxm = 800007; const int inf = 0x7f7f7f7f; struct E { int u, v, w, cf; } e[maxm]; int first[maxn], nt[maxm], ES = 1; bool acc[maxm]; inline void addE(int u, int v, int w, int cf) { e[++ES] = (E){u, v, w, cf}; nt[ES] = first[u]; first[u] = ES; return; } inline void add(int u, int v, int w) { addE(u, v, w, 1); addE(v, u, w, 0); return; } int tot; int N, M; int cur[maxn]; int dep[maxn]; int S, T; bool BFS() { memset(dep, 0, sizeof(dep)); dep[S] = 1; q.push(S); int u, v; while (!q.empty()) { u = q.front(); q.pop(); for (int i = first[u]; i; i = nt[i]) { v = e[i].v; if (e[i].cf > 0 && acc[i] && !dep[v]) { dep[v] = dep[u] + 1; q.push(v); } } } return dep[T] != 0; } int dfs(int u, int f) { if (u == T) return f; int v, d, sum = 0; for (int &i = cur[u]; i; i = nt[i]) { v = e[i].v; if (dep[v] == dep[u] + 1 && e[i].cf > 0 && acc[i]) { d = dfs(v, min(f, e[i].cf)); if (d > 0) { sum += d; f -= d; e[i].cf -= d; e[i ^ 1].cf += d; if (f <= 0) return sum; } } } return sum; } int solve() { int re = 0; while (BFS()) { memcpy(cur, first, sizeof(first)); re += dfs(S, inf); } return re; } bool check(int p) { for (int i = 1; i <= ES; i++) { if (e[i].w <= p) acc[i] = true; else acc[i] = false; e[i].cf = (i & 1) ^ 1; } return solve() == N; } int main() { scanf( %d%d , &N, &M); int u, v, w; int L = 0, R = 0, mid, ans = -1; for (int i = 1; i <= M; i++) scanf( %d%d%d , &u, &v, &w), add(u, v + N, w); S = 0; T = 2 * N + 1; for (int i = 1; i <= N; i++) add(S, i, -1), add(i + N, T, -1); R = 1e9; while (L <= R) { mid = L + R >> 1; if (check(mid)) ans = mid, R = mid - 1; else L = mid + 1; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6; int Left[N], Right[N]; void pre(int node) { if (node == -1) return; pre(Left[node]); printf( %d n , node + 1); pre(Right[node]); } int main() { memset(Left, -1, sizeof Left); memset(Right, -1, sizeof Right); string s; cin >> s; for (int i = 0; i + 1 < (int)s.size(); ++i) if (s[i] == l ) Left[i] = i + 1; else Right[i] = i + 1; pre(0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const int maxm = 1e3 + 5; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int a[maxn], ans[maxn], l[maxn][6], r[maxn][6]; inline void solve() { int n; scanf( %d , &n); for (int i = 1; i < n + 1; i++) scanf( %d , &a[i]); memset(l, -1, sizeof l); memset(r, -1, sizeof r); if (a[1] > 1) { puts( -1 ); exit(0); } l[1][1] = r[1][1] = 1; for (int i = 2; i < n + 1; i++) { for (int j = 2; j < 5 + 1; j++) { if (l[i - 1][j - 1] != -1) { l[i][j] = l[i - 1][j - 1]; r[i][j] = r[i - 1][j - 1]; } } for (int j = 2; j < 5 + 1; j++) { if (l[i - 1][j] != -1) { if (l[i][1] == -1) l[i][1] = inf; l[i][1] = min(l[i][1], l[i - 1][j] + 1); r[i][1] = max(r[i][1], r[i - 1][j] + 1); } } if (a[i]) { for (int j = 1; j < 5 + 1; j++) { if (l[i][j] != -1) { if (l[i][j] <= a[i] && a[i] <= r[i][j]) l[i][j] = r[i][j] = a[i]; else l[i][j] = r[i][j] = -1; } else r[i][j] = -1; } } bool ok = 0; for (int j = 1; j < 5 + 1; j++) { if (l[i][j] <= r[i][j] && l[i][j] != -1) { ok = 1; break; } } if (!ok) { puts( -1 ); exit(0); } } int up = 0, j = 2; for (int i = 2; i < 5 + 1; i++) { if (l[n][i] <= r[n][i] && l[n][i] != -1) { if (r[n][i] > up) { up = r[n][i]; j = i; } } } if (up == 0) { puts( -1 ); exit(0); } printf( %d n , up); int m = n; while (m) { for (int i = m - j; i < m + 1; i++) ans[i] = up; m -= j; up--; for (int i = 2; i < 5 + 1; i++) { if (l[m][i] <= up && up <= r[m][i]) j = i; } } for (int i = 1; i < n + 1; i++) { if (i == 1) printf( %d , ans[i]); else printf( %d , ans[i]); } puts( ); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Edge { int v, next; } edge[2050]; int e, ft[2050]; int a, n, m; bool rain[2050]; int x[2050], p[2050]; long long dp[2050][2050]; long long opt[2050]; int main() { int l, r; while (cin >> a >> n >> m) { e = 0; for (int i = 0; i <= a; i++) { rain[i] = false; for (int j = 0; j <= m; j++) dp[i][j] = (1ll << 60); ft[i] = -1; } for (int i = 0; i < n; i++) { scanf( %d%d , &l, &r); while (l < r) { rain[l++] = true; } } for (int i = 0; i < m; i++) { scanf( %d%d , x + i, p + i); edge[e].v = i; edge[e].next = ft[x[i]]; ft[x[i]] = e++; if (x[i] == 0) dp[0][i] = 0; } dp[0][m] = 0; p[m] = 0; opt[0] = 0; for (int i = 0; i < a; i++) { for (int j = 0; j <= m; j++) { if (dp[i][j] >= (1ll << 60)) continue; if (j < m || !rain[i]) dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + p[j]); } opt[i + 1] = (1ll << 60); for (int j = 0; j <= m; j++) opt[i + 1] = min(opt[i + 1], dp[i + 1][j]); for (int j = ft[i + 1]; j != -1; j = edge[j].next) { int idx = edge[j].v; dp[i + 1][idx] = min(dp[i + 1][idx], opt[i + 1]); } dp[i + 1][m] = min(dp[i + 1][m], opt[i + 1]); } long long ans = -1; if (opt[a] < (1ll << 60)) ans = opt[a]; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void fastIO(void); void decimal(int); long long int modmulti(long long int, long long int, long long int); long long int modadd(long long int, long long int, long long int); long long int modpower(long long int, long long int, long long int); long long int gcd(long long int, long long int); long long int modinv(long long int, long long int); int main() { fastIO(); long long int n; cin >> n; long long int t1, t2; vector<long long int> a(n); multiset<long long int> b; for (long long int i = 0; i < n; i++) cin >> a[i]; for (long long int i = 0; i < n; i++) { cin >> t1; b.insert(t1); } long long int c[n]; for (long long int i = 0; i < n; i++) { t2 = n - a[i]; auto itr = b.lower_bound(n - a[i]); if (itr == b.end()) itr = b.begin(); c[i] = (a[i] + *itr) % n; b.erase(itr); } for (long long int i = 0; i < n; i++) cout << c[i] << ; cout << n ; } void fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void decimal(int n) { cout << fixed; cout << setprecision(n); } long long int modmulti(long long int a, long long int b, long long int m) { return ((a % m) * (b % m)) % m; } long long int modadd(long long int a, long long int b, long long int m) { return ((a % m) + (b % m) + m) % m; } long long int modpower(long long int a, long long int n, long long int m) { if (n == 0) return 1; long long int result = 1; while (n > 0) { if (n % 2 == 1) result = modmulti(result, a, m); a = modmulti(a, a, m); n = n / 2; } return result; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int modinv(long long int a, long long int m) { return modpower(a, m - 2, m); } |
#include <bits/stdc++.h> using namespace std; const static int maxN = 1000; struct { int r, c; } tooth[maxN]; int toothrow[maxN + 1]; int main() { int n, m, k; int i; int ans; while (scanf( %d%d%d , &n, &m, &k) != EOF) { for (i = 0; i < n; i++) { scanf( %d%d , &tooth[i].r, &tooth[i].c); } memset(toothrow, -1, sizeof(int) * (m + 1)); ans = 0; for (i = 0; i < n; i++) { if (toothrow[tooth[i].r] != -1) { if (tooth[i].c < toothrow[tooth[i].r]) { ans -= toothrow[tooth[i].r]; ans += tooth[i].c; toothrow[tooth[i].r] = tooth[i].c; } } else { ans += tooth[i].c; toothrow[tooth[i].r] = tooth[i].c; } } printf( %d n , min(ans, k)); } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace { using namespace std; template <typename flow_t = long long> struct PushRelabel { struct Edge { int to, rev; flow_t f, c; }; vector<vector<Edge>> g; vector<flow_t> ec; vector<Edge*> cur; vector<vector<int>> hs; vector<int> H; PushRelabel(int n) : g(n), ec(n), cur(n), hs(2 * n), H(n) {} void add_edge(int s, int t, flow_t cap, flow_t rcap = 0) { if (s == t) return; Edge a = {t, (int)g[t].size(), 0, cap}; Edge b = {s, (int)g[s].size(), 0, rcap}; g[s].push_back(a); g[t].push_back(b); } void add_flow(Edge& e, flow_t f) { Edge& back = g[e.to][e.rev]; if (!ec[e.to] && f) hs[H[e.to]].push_back(e.to); e.f += f; e.c -= f; ec[e.to] += f; back.f -= f; back.c += f; ec[back.to] -= f; } flow_t max_flow(int s, int t) { const int n = g.size(); ec.assign(n, 0); cur.assign(n, nullptr); hs.assign(2 * n, {}); H.assign(n, 0); int v = g.size(); H[s] = v; ec[t] = 1; vector<int> co(2 * v); co[0] = v - 1; for (int i = 0; i < v; ++i) cur[i] = g[i].data(); for (auto& e : g[s]) add_flow(e, e.c); if (hs[0].size()) for (int hi = 0; hi >= 0;) { int u = hs[hi].back(); hs[hi].pop_back(); while (ec[u] > 0) if (cur[u] == g[u].data() + g[u].size()) { H[u] = 1e9; for (auto& e : g[u]) if (e.c && H[u] > H[e.to] + 1) H[u] = H[e.to] + 1, cur[u] = &e; if (++co[H[u]], !--co[hi] && hi < v) for (int i = 0; i < v; ++i) if (hi < H[i] && H[i] < v) { --co[H[i]]; H[i] = v + 1; } hi = H[u]; } else if (cur[u]->c && H[u] == H[cur[u]->to] + 1) add_flow(*cur[u], min(ec[u], cur[u]->c)); else ++cur[u]; while (hi >= 0 && hs[hi].empty()) --hi; } return -ec[s]; } }; template <typename flow_t = long long> struct MaxFlow { static constexpr flow_t INF = numeric_limits<flow_t>::max(); PushRelabel<flow_t> flow; MaxFlow(const int n) : flow(n) {} inline void add_arc(const int u, const int v, const flow_t capacity) { flow.add_edge(u, v, capacity); } inline void add_edge(const int u, const int v, const flow_t capacity) { flow.add_edge(u, v, capacity, capacity); } inline void add_infinite_arc(const int u, const int v) { flow.add_edge(u, v, INF); } inline void add_infinite_edge(const int u, const int v) { flow.add_edge(u, v, INF, INF); } flow_t solve(const int s, const int t) { return flow.max_flow(s, t); } }; template <typename flow_t> class MaxFlowLR { private: static constexpr flow_t INF = numeric_limits<flow_t>::max(); int n; vector<flow_t> from_source, to_sink, outgoing_capacity; vector<tuple<int, int, flow_t>> demands; flow_t total_demand; bool invalid; PushRelabel<flow_t> flow; public: MaxFlowLR(const int n) : n(n), from_source(n), to_sink(n), outgoing_capacity(n), total_demand(0), invalid(false), flow(n + 2) {} void add_arc(const int u, const int v, const flow_t demand, const flow_t capacity) { if (demand > capacity) { invalid = true; return; } if (u != v) { from_source[v] += demand; to_sink[u] += demand; flow.add_edge(u, v, capacity - demand); demands.push_back({u, v, demand}); total_demand += demand; outgoing_capacity[u] += capacity; } } flow_t solve(const int s, const int t) { if (invalid) { return -1; } const int source = n; const int sink = n + 1; for (int v = 0; v < n; ++v) { if (from_source[v] != 0) { flow.add_edge(source, v, from_source[v]); } if (to_sink[v] != 0) { flow.add_edge(v, sink, to_sink[v]); } } flow.add_edge(t, s, INF); const flow_t flow_aux = flow.max_flow(source, sink); if (s != t) { flow.g[s].pop_back(); flow.g[t].pop_back(); } for (int v = n - 1; v >= 0; --v) { if (to_sink[v] != 0) { flow.g[sink].pop_back(); flow.g[v].pop_back(); } if (from_source[v] != 0) { flow.g[source].pop_back(); flow.g[v].pop_back(); } } if (flow_aux != total_demand) return -1; const flow_t flow_new = flow.max_flow(s, t); flow_t total_flow = outgoing_capacity[s]; for (const auto& e : flow.g[s]) total_flow -= e.c; return total_flow; } vector<map<int, flow_t>> retrieve() { vector<map<int, flow_t>> ans(n); for (int u = 0; u < n; ++u) for (const auto& e : flow.g[u]) if (e.f > 0) ans[u][e.to] += e.f, ans[e.to][u] -= e.f; for (auto t : demands) if (get<2>(t) > 0) ans[get<0>(t)][get<1>(t)] += get<2>(t), ans[get<1>(t)][get<0>(t)] -= get<2>(t); return ans; } }; } // namespace inline int divceil(const int x, const int y) { const int q = x / y; return q * y == x ? q : q + 1; } inline long long divceil(const long long x, const long long y) { const long long q = x / y; return q * y == x ? q : q + 1; } map<int, int> coordinate_compression(vector<int> v) { sort(v.begin(), v.end()); const int n = unique(v.begin(), v.end()) - v.begin(); map<int, int> compr; for (int i = 0; i < n; ++i) compr[v[i]] = i; return compr; } map<long long, int> coordinate_compression(vector<long long> v) { sort(v.begin(), v.end()); const int n = unique(v.begin(), v.end()) - v.begin(); map<long long, int> compr; for (int i = 0; i < n; ++i) compr[v[i]] = i; return compr; } int main() { int n, m; scanf( %d%d , &n, &m); int r, b; scanf( %d%d , &r, &b); bool flip = false; if (r >= b) { flip = true; swap(r, b); } vector<std::pair<int, int>> original_points; vector<int> allx, ally; for (int i = 0; i < n; ++i) { int x, y; scanf( %d%d , &x, &y); original_points.emplace_back(x, y); allx.push_back(x); ally.push_back(y); } map<int, int> comprx = coordinate_compression(allx), compry = coordinate_compression(ally); const int xlines = comprx.rbegin()->second + 1; const int ylines = compry.rbegin()->second + 1; vector<int> xdeg(xlines), ydeg(ylines); vector<int> xcons(xlines), ycons(ylines); vector<std::pair<int, int>> points; for (const std::pair<int, int> p : original_points) { const int xx = comprx[p.first]; const int yy = compry[p.second]; points.emplace_back(xx, yy); ++xdeg[xx]; ++ydeg[yy]; ++xcons[xx]; ++ycons[yy]; } while (m--) { int t, l, d; scanf( %d%d%d , &t, &l, &d); if (t == 1) { const auto it = comprx.find(l); if (it != comprx.end()) xcons[it->second] = min(xcons[it->second], d); } else { const auto it = compry.find(l); if (it != compry.end()) ycons[it->second] = min(ycons[it->second], d); } } MaxFlowLR<long long> dinic(2 + xlines + ylines); const int source = 0; const int sink = 1; const auto get_xvert = [&](const int i) { return 2 + i; }; const auto get_yvert = [&](const int i) { return 2 + xlines + i; }; for (int i = 0; i < xlines; ++i) { const int L = divceil(xdeg[i] - xcons[i], 2); const int R = (xdeg[i] + xcons[i]) / 2; dinic.add_arc(source, get_xvert(i), L, R); } for (int i = 0; i < ylines; ++i) { const int L = divceil(ydeg[i] - ycons[i], 2); const int R = (ydeg[i] + ycons[i]) / 2; dinic.add_arc(get_yvert(i), sink, L, R); } for (const std::pair<int, int> p : points) dinic.add_arc(get_xvert(p.first), get_yvert(p.second), 0, 1); long long flow_value = dinic.solve(source, sink); if (flow_value == -1) { puts( -1 ); return 0; } long long ans = flow_value * r + (n - flow_value) * b; cout << ans << endl; map<std::pair<int, int>, int> red; auto flow = dinic.retrieve(); for (int i = 0; i < xlines; ++i) { const int x = get_xvert(i); for (const auto p : flow[x]) { const int j = p.first - 2 - xlines; const int f = p.second; if (j >= 0) red[std::pair<int, int>(i, j)] += f; } } for (const std::pair<int, int> p : points) { int& v = red[p]; if (v) { v--; putchar(flip ? b : r ); } else { putchar(flip ? r : b ); } } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void solve() { vector<long long> v(14); long long curr_score = 0; long long o = 0; for (int i = 0; i < 14; i++) { cin >> v[i]; } for (int i = 0; i < 14; i++) { vector<long long> t(14); for (int k = 0; k < 14; k++) { t[k] = v[k]; } long long p = v[i] / 14, q = v[i] % 14; t[i] = 0; for (int j = 0; j < 14; j++) { t[j] += p; } long long j = i + 1; while (q--) { if (j == 14) { j = 0; } t[j++]++; } long long cnt = 0; for (int i = 0; i < 14; i++) { if (t[i] % 2 == 0) { cnt += t[i]; } } curr_score = max(curr_score, cnt); } cout << curr_score << n ; } int main() { int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct edge { long long a, b, cost; edge(long long x, long long y, long long z) : a(x), b(y), cost(z){}; }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, k, p; cin >> n >> k >> p; vector<long long> v(n), a(k); for (long long i = 0; i < (long long)(n); i++) cin >> v[i]; for (long long i = 0; i < (long long)(k); i++) cin >> a[i]; sort((v).begin(), (v).end()); sort((a).begin(), (a).end()); long long ans = INT_MAX; for (long long i = (long long)(0); i <= (long long)(k - n); i++) { long long res = INT_MIN; for (long long j = (long long)(0); j <= (long long)(n - 1); j++) { res = max(res, abs(v[j] - a[i + j]) + abs(a[i + j] - p)); } ans = min(ans, res); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long ans; int n, i, j, k, u, v; int size[80011], fa[80011]; vector<int> e[80011]; void dfs(int now) { unsigned long long o = 0; size[now] = 1; for (int i = 0; i < e[now].size(); i++) if (e[now][i] != fa[now]) { fa[e[now][i]] = now; dfs(e[now][i]); o += (unsigned long long)size[now] * size[e[now][i]]; size[now] += size[e[now][i]]; } ans -= o * (o + 2LL * size[now] * (n - size[now])); } int main() { scanf( %d , &n); for (i = 1; i < n; i++) { scanf( %d%d , &u, &v); e[u].push_back(v); e[v].push_back(u); } ans = (n - 1LL) * n / 2; ans *= ans; dfs(1); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans = 0; string str; int n; int main() { ios::sync_with_stdio(false); cin >> n; cin >> str; for (int i = 0; i < n; ++i) ans += (str[i] - 0 ) & 1 ? 0 : i + 1; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline void normal(long long int &a) { a %= 1000000007; (a < 0) && (a += 1000000007); } inline long long int modMul(long long int a, long long int b) { a %= 1000000007, b %= 1000000007; normal(a), normal(b); return (a * b) % 1000000007; } inline long long int modAdd(long long int a, long long int b) { a %= 1000000007, b %= 1000000007; normal(a), normal(b); return (a + b) % 1000000007; } inline long long int modSub(long long int a, long long int b) { a %= 1000000007, b %= 1000000007; normal(a), normal(b); a -= b; normal(a); return a; } inline long long int modPow(long long int b, long long int p) { long long int r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; } inline long long int modInverse(long long int a) { return modPow(a, 1000000007 - 2); } inline long long int modDiv(long long int a, long long int b) { return modMul(a, modInverse(b)); } inline bool isInside(pair<int, int> p, long long int n, long long int m) { return (p.first >= 0 && p.first < n && p.second >= 0 && p.second < m); } inline bool isInside(pair<int, int> p, long long int n) { return (p.first >= 0 && p.first < n && p.second >= 0 && p.second < n); } inline bool isSquare(long long int x) { long long int s = sqrt(x); return (s * s == x); } inline bool isFib(long long int x) { return isSquare(5 * x * x + 4) || isSquare(5 * x * x - 4); } inline bool isPowerOfTwo(long long int x) { return ((1LL << (long long int)log2(x)) == x); } template <typename first, typename second> ostream &operator<<(ostream &os, const pair<first, second> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << *it; } return os << } ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename first, typename second> ostream &operator<<(ostream &os, const map<first, second> &v) { os << [ ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } clock_t tStart = clock(); void faltu() { cerr << endl; } template <typename T> void faltu(T a[], int n) { for (int i = 0; i < n; ++i) cerr << a[i] << ; cerr << endl; } template <typename T, typename... hello> void faltu(T arg, const hello &...rest) { cerr << arg << ; faltu(rest...); } const long long int INF = 0x3f3f3f3f3f3f3f3f; const long double EPS = 1e-9; const int inf = 0x3f3f3f3f; const int mx = (int)2e5 + 9; long long int n, m, a, b, u, t, i, j, d, cs = 0, counT = 0, k, ans = 0, l = 0, sum1 = 0, sum = 0, Max, Min, num; int _time, idx; set<long long int> vc[mx]; int st[mx], en[mx], pos[mx], arr[mx]; void dfs(int node, int par = 0) { st[node] = ++_time; arr[node] = ++idx; pos[idx] = node; for (auto next : vc[node]) { if (next == par) continue; dfs(next, node); } en[node] = _time; } int main() { cin >> n >> m; for (i = 2; i <= n; i++) { cin >> a; vc[i].insert(a); vc[a].insert(i); } dfs(1); while (m--) { cin >> u >> k; if (arr[u] + k - 1 > n) { cout << -1 << n ; continue; } int v = pos[arr[u] + k - 1]; if (st[u] <= st[v] && en[u] >= en[v]) cout << v << n ; else cout << -1 << n ; } } |
#include <bits/stdc++.h> using namespace std; long long test(vector<long long>& h, int l, int r) { long long ret = 0; for (int i = l; i < r; i++) { long long tmp = 0; for (int j = i + 1; j < r; j++) { tmp = max(tmp, abs(h[j] - h[j - 1])); ret += tmp; } } return ret; } int main() { int n, q; cin >> n >> q; vector<long long> h(n); for (int i = 0; i < n; i++) { scanf( %I64d , &h[i]); } while (q--) { int l, r; scanf( %d%d , &l, &r); l--; long long ans = 0; long long last = 0; deque<pair<long long, int>> dq; for (int i = l + 1; i < r; i++) { long long tmp = abs(h[i] - h[i - 1]); long long len = 1; while (dq.size() && dq.back().first <= tmp) { auto val = dq.back(); dq.pop_back(); len += val.second; last -= val.first * val.second; } dq.push_back({tmp, len}); last += tmp * len; ans += last; } printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long cont = 0; template <typename T, typename F> struct AHO_CORASICK { const long long ALPHA = 26; long long cv(F c) { return c - 0 ; } vector<map<long long, long long>> tgo; vector<long long> link; vector<long long> ch; vector<long long> p; vector<bool> flag; long long sz = 0; long long size() { return sz; } void new_node(long long tp, long long tch) { sz++; tgo.emplace_back(); link.push_back(0); ch.push_back(tch); p.push_back(tp); flag.push_back(false); } AHO_CORASICK() { new_node(0, 0); new_node(1, 0); } void add_string(T cad) { long long pt = 1; for (long long i = 0; i < cad.size(); i++) { long long tch = cv(cad[i]); if (tgo[pt][tch] == 0) { tgo[pt][tch] = sz; new_node(pt, tch); } pt = tgo[pt][tch]; } flag[pt] = true; } long long get_link(long long nodo) { if (link[nodo] == 0) { if (nodo == 1 || p[nodo] == 1) link[nodo] = 1; else link[nodo] = go(get_link(p[nodo]), ch[nodo]); flag[nodo] = flag[nodo] | flag[link[nodo]]; } return link[nodo]; } long long go(long long nodo, F tch) { return go(nodo, cv(tch)); } long long go(long long nodo, long long tch) { if (tgo[nodo][tch] == 0) { tgo[nodo][tch] = (nodo == 1) ? 1 : go(get_link(nodo), tch); } return tgo[nodo][tch]; } }; long long X; vector<string> bf; string temp; void fff(long long sum) { if (sum > X) return; for (long long i = 0; i < temp.size(); i++) { long long s = 0; for (long long j = i; j < temp.size(); j++) { s += temp[j] - 0 ; if (s != X && X % s == 0) return; } } if (sum == X) { bf.push_back(temp); return; } for (long long i = 1; i <= 9; i++) { temp += (i + 0 ); fff(sum + i); temp.pop_back(); } } const long long MAXN = 1010; long long dp[MAXN][MAXN * 5]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); for (long long i = 0; i < MAXN; i++) { for (long long j = 0; j < 5 * MAXN; j++) { dp[i][j] = 1e9; } } string cad; cin >> cad; cin >> X; long long N = cad.size(); fff(0); AHO_CORASICK<string, char> ac; for (auto x : bf) { ac.add_string(x); } dp[0][1] = 0; for (long long i = 0; i < N; i++) { for (long long j = 1; j < ac.size(); j++) { long long pt = ac.go(j, cad[i]); if (ac.flag[pt] == false) dp[i + 1][pt] = min(dp[i + 1][pt], dp[i][j]); dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1); } } long long res = 1e9; for (long long i = 0; i < ac.sz; i++) { res = min(res, dp[N][i]); } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char name[5][10] = { Sheldon , Leonard , Penny , Rajesh , Howard }; int n, c = 5; scanf( %d , &n); while (n > c) { n -= c; c *= 2; } printf( %s n , name[(n - 1) / (c / 5)]); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { map<string, pair<string, long long>> best; long long n; cin >> n; for (long long i = 0; i < n; i++) { string name; long long score; cin >> name >> score; best[name].second = max(best[name].second, score); } for (auto itr = best.begin(); itr != best.end(); itr++) { long long count = 0; for (auto i = best.begin(); i != best.end(); i++) { if (itr->second.second >= i->second.second) count++; } double percent = ((double)count / best.size() * 1.0) * 100.0; if (percent < 50.0) itr->second.first = noob ; else if (percent >= 50.0 && percent < 80.0) itr->second.first = random ; else if (percent >= 80.0 && percent < 90.0) itr->second.first = average ; else if (percent >= 90.0 && percent < 99.0) itr->second.first = hardcore ; else itr->second.first = pro ; } cout << best.size() << endl; for (auto x : best) { cout << x.first << << x.second.first << endl; } } int32_t main() { long long testcases = 1; while (testcases--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; void run_case() { string A, B, C, D; cin >> A; cin >> B; C = (A + B); sort(C.begin(), C.end()); cin >> D; sort(D.begin(), D.end()); if (C == D) cout << YES n ; else cout << NO n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long T = 1; while (T--) run_case(); return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:200000000 ) const double EPS = 1E-9; const int INF = 1000000000; const long long INF64 = (long long)1E18; const double PI = 3.1415926535897932384626433832795; char s[2100][2100]; int ans[2100]; int main() { int n, m, k; scanf( %d%d%d n , &n, &m, &k); for (int i = 0; i < (int)(n); i++) gets(s[i]); for (int i = 0; i < (int)(n); i++) for (int j = 0; j < (int)(m); j++) { if (s[i][j] == . || s[i][j] == D ) continue; if (s[i][j] == U ) { if (i % 2 == 1) continue; ans[j]++; continue; } int nj; if (s[i][j] == L ) nj = j - i; else nj = j + i; if (0 <= nj && nj < m) ans[nj]++; } for (int i = 0; i < (int)(m); i++) printf(i ? %d : %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %lld , &x); return x; } inline string get() { char ch[2000010]; scanf( %s , ch); return ch; } const int MAX_LG = 21; const int maxn = 2e3 + 10; const int maxm = 1e5 + 10; const int base = 29; const int mod = 1e9 + 7; const int INF = 1e9 + 100; const int SQ = 317; int Cmp; int mark[maxn]; int v[maxm], u[maxm], deg[maxn], has[maxn][maxn], e[maxm]; int vc[5]; inline void dfs(int node, int id) { int edgeid = has[node][vc[id]] - 1; if (edgeid < 0) return; int nxt = v[edgeid] == node ? u[edgeid] : v[edgeid]; has[node][vc[id]] = 0; has[nxt][vc[id]] = 0; dfs(nxt, id ^ 1); has[node][vc[id ^ 1]] = edgeid + 1; has[nxt][vc[id ^ 1]] = edgeid + 1; e[edgeid] = vc[id ^ 1]; } int res; int32_t main() { int a = in(), b = in(), m = in(); for (int i = 0; i < m; i++) { v[i] = in(), u[i] = in() + a; deg[v[i]]++; deg[u[i]]++; res = max(res, max(deg[v[i]], deg[u[i]])); } for (int i = 0; i < m; i++) { bool fl = false; for (int col = 1; col <= res; col++) { if (has[v[i]][col] == 0 && has[u[i]][col] == 0 && col <= res) { has[v[i]][col] = has[u[i]][col] = i + 1; e[i] = col; fl = true; break; } } if (!fl) { Cmp++; for (int col = 1; col <= res; col++) { if (has[v[i]][col] && !has[u[i]][col]) vc[0] = col; if (has[v[i]][col] == 0 && has[u[i]][col]) vc[1] = col; } dfs(v[i], 0); has[v[i]][vc[0]] = has[u[i]][vc[0]] = i + 1; e[i] = vc[0]; } } cout << res << n ; for (int i = 0; i < m; i++) cout << e[i] << ; } |
#include <bits/stdc++.h> using namespace std; int f[100005], b[100005], fn[100005], bn[100005], fm, bm; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , f + i); ++fn[f[i]]; fm = max(fm, f[i]); } for (int i = 0; i < m; ++i) { scanf( %d , b + i); ++bn[b[i]]; bm = max(bm, b[i]); } if (fm < bm) { printf( Impossible n ); } else { bool ans = true; bool chong = false; for (int i = 1; i <= bm; ++i) { if (bn[i] > 0) { if (fn[i] == 0) { ans = false; } else if (fn[i] > 1) { chong = true; } } } if (!ans) { printf( Impossible n ); } else { if (chong) { printf( Ambiguity n ); } else { printf( Possible n ); for (int i = 0; i < n; ++i) { fn[f[i]] = i + 1; } for (int i = 0; i < m; ++i) { printf( %d , fn[b[i]]); } printf( n ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int k; int n[3], t[3]; multiset<int> f[3]; int main() { cin >> k; cin >> n[0] >> n[1] >> n[2]; cin >> t[0] >> t[1] >> t[2]; for (int i = 0; i < 3; i++) for (int j = 0; j < n[i]; j++) f[i].insert(0); int ans = 0; for (int i = 0; i < k; i++) { int go[3]; for (int j = 0; j < 3; j++) { go[j] = *f[j].begin(); f[j].erase(f[j].begin()); } go[1] -= t[0]; go[2] -= t[0] + t[1]; int w = max(go[0], max(go[1], go[2])); ans = w + t[0] + t[1] + t[2]; f[0].insert(w + t[0]); f[1].insert(w + t[0] + t[1]); f[2].insert(ans); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { x = 0; char ch = getchar(), flag = 0; while ((ch > 9 || ch < 0 ) && ch != - ) ch = getchar(); if (ch == - ) flag = 1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); if (flag) x = -x; } inline void read(int &x, int &y) { read(x), read(y); } inline void read(int &x, int &y, int &z) { read(x), read(y), read(z); } const int N = 20005, inf = 1e9 + 7, mod = 20000; int n, m, up[N], cup[N], cnt, si[N], num[N], dep[N], use[N]; vector<int> g[N], f[N], s[N]; bool vis[N]; struct node { int to, next, v; } p[N << 4]; int S, T, head[N], st[N], tot, ans; inline void add(int x, int y, int z) { p[tot].to = y; p[tot].next = head[x]; p[tot].v = z; head[x] = tot++; p[tot].to = x; p[tot].next = head[y]; p[tot].v = 0; head[y] = tot++; } queue<int> q; inline bool bfs(int x) { memset(st, 0, sizeof(st)); st[x] = 1; q.push(x); while (!q.empty()) { int x = q.front(); q.pop(); for (int i = head[x]; ~i; i = p[i].next) { int y = p[i].to, v = p[i].v; if (!v || st[y]) continue; st[y] = st[x] + 1; q.push(y); } } return st[T] > 0; } inline int dfs(int x, int f) { int r = 0; if (x == T) return f; for (int i = head[x]; ~i; i = p[i].next) { int y = p[i].to, v = p[i].v, tmp; if (!v || st[y] != st[x] + 1) continue; tmp = dfs(y, min(f - r, v)); r += tmp; p[i].v -= tmp; p[i ^ 1].v += tmp; if (r == f) break; } if (!r) st[x] = -1; return r; } inline void dinic() { int t; while (bfs(S)) while (t = dfs(S, inf)) ans += t; printf( %d n , ans); } inline void Add(int x, int y, int z) { g[x].push_back(y); f[x].push_back(z); g[y].push_back(x); f[y].push_back(z); vis[x] = vis[y] = 1; } inline void Dfs(int x, int fa) { vis[x] = 1; for (int i = 0; i < g[x].size(); i++) { int y = g[x][i], z = f[x][i]; if (y == fa) continue; if (vis[y] && dep[y] < dep[x]) { cnt++; s[cnt].push_back(z); si[z]--; int k = x, o = 0; while (k != y) { si[cup[k]]--; s[cnt].push_back(cup[k]); k = up[k]; } continue; } if (vis[y]) continue; cup[y] = z; up[y] = x; dep[y] = dep[x] + 1; Dfs(y, x); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y, z; scanf( %d%d%d , &x, &y, &z); Add(x, y, z); si[z]++; use[z]++; } for (int i = 1; i <= n; i++) if (vis[i]) { memset(vis, 0, sizeof(vis)); Dfs(i, -1); break; } memset(head, -1, sizeof(head)); S = 0; T = cnt + 1; for (int i = 1; i <= m; i++) if (!si[i] && use[i]) T++; else if (use[i]) ans++; int CNT = cnt; for (int i = 1; i <= m; i++) if (!si[i] && use[i]) add(num[i] = ++CNT, T, 1); for (int i = 1; i <= cnt; i++) { bool isok = 1; for (int j = 0; j < s[i].size(); j++) if (si[s[i][j]]) isok = 0; add(S, i, s[i].size() - 1); for (int j = 0; j < s[i].size(); j++) if (num[s[i][j]]) add(i, num[s[i][j]], 1); } dinic(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 3) { cout << -1; return 0; } if (n == 3) { cout << 210; return 0; } int A[] = {50, 80, 170, 20, 200, 110}; int nA[] = {2, 2, 3, 2, 3, 3}; int j = 0; for (int i = 4; i <= n; i++) { if (j == 6) j = 0; if (i == n) { cout << 1; for (int k = 1; k < n - nA[j]; k++) { cout << 0 ; } cout << A[j]; } j++; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.