func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; const long long M = 998244353; const long double PI = acos(-1); long long n, k; long long a[N], d[N], mn[N] = {INT_MAX}; signed main() { long long i, s = 0, ans = 0; cin >> n >> k; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) cin >> d[i], mn[i] = min(mn[i - 1], d[i]); for (i = n; i >= 1; i--) a[i] += a[i + 1]; if (k == 0) { for (i = 1; i <= n; i++) ans = max(ans, a[i] - d[i]); cout << ans; } else if (k == 1) { for (i = 2; i <= n; i++) ans = max(ans, max(0ll, a[1] - a[i] - mn[i - 1]) + max(0ll, a[i] - d[i])); for (i = 1; i < n; i++) ans = max(ans, a[1] - (a[i + 1] - a[i + 2]) - d[1] + max(0ll, a[i + 1] - a[i + 2] - d[i + 1])); cout << ans; } else cout << max({0ll, a[1] - mn[n - 1], a[n] - d[n]}); return 0; } |
#include <bits/stdc++.h> using namespace std; multiset<int64_t> h, hl, v, vl; int main() { cin.tie(0), ios_base::sync_with_stdio(0); int W, H, q, r, c, nr, nc, pr, pc; auto tmp = h.begin(); char t; cin >> W >> H >> q; int64_t mv = H, mh = W; h.insert(0); h.insert(W); hl.insert(W); v.insert(0); v.insert(H); vl.insert(H); while (q--) { cin >> t; if (t == H ) { cin >> r; tmp = v.insert(r); nr = *next(tmp); pr = *prev(tmp); vl.erase(vl.find(nr - pr)); vl.insert(r - pr); vl.insert(nr - r); } else { cin >> c; tmp = h.insert(c); nc = *next(tmp); pc = *prev(tmp); hl.erase(hl.find(nc - pc)); hl.insert(c - pc); hl.insert(nc - c); } cout << *prev(hl.end()) * *(prev(vl.end())) << n ; } return 0; ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); char str[1000][1000]; int i; for (i = 0; i < n; i++) { scanf( %[^ n] , str[i]); } int cnt = 0; int j; for (i = 0; i < n; i++) { if (strcmp(str[i], -1 ) == 0) continue; cnt++; int flag = 0; for (j = i + 1; j < n; j++) { if (strcmp(str[j], -1 ) == 0) continue; if (strcmp(str[i], str[j]) == 0) { strcpy(str[j], -1 ); } } } printf( %d n , cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18 + 9; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, k; cin >> n >> k; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); vector<long long> pref(n, 0), suf(n, 0); for (long long i = 1, sm = a[0]; i < n; i++) { pref[i] = a[i] * i - sm; sm += a[i]; } for (long long i = n - 2, sm = a[n - 1]; i >= 0; i--) { suf[i] = sm - a[i] * (n - i - 1); sm += a[i]; } long long ans = INF; for (long long i = 0, j = 0; i < n; i = j) { for (; j < n && a[j] == a[i]; j++) ; long long prev = 0, forw = 0; long long base = INF; prev += pref[i]; prev -= i; if (i >= k - j + i) base = min(base, prev); forw += suf[j - 1]; forw -= (n - j); if (n - j >= k - j + i) base = min(base, forw); base = min(base, prev + forw); ans = min(ans, base + k - (j - i)); if (j - i >= k) ans = 0; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int test; cin >> test; while (test--) { long long int n; cin >> n; long long int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } long long int total_sum = 0; for (int i = 0; i < n; i++) { total_sum += a[i]; } if (total_sum < 0 && n == 1) { cout << YES << endl; continue; } else if (total_sum < 0) { cout << NO << endl; continue; } long long int sum = 0; long long int max_so_far = 0; long long int element = 0; long long int element_f = 0; for (int i = 0; i < n; i++) { sum = sum + a[i]; element++; if (sum <= 0) { element = 0; sum = 0; } else if (sum > max_so_far) { element_f = element; max_so_far = sum; } } if (max_so_far >= total_sum && element_f < n) cout << NO << endl; else cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> const int maxn = 1e5 + 3; int n; int k; int A; int a[maxn]; int ans[maxn]; int main() { int sum = 0; scanf( %d%d , &n, &k); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), sum += a[i]; if (sum % k) { puts( No ); return 0; } sum /= k; for (int i = 1; i <= n;) { int now = 0, nowsum = 0; while (nowsum < sum && i <= n) nowsum += a[i++], ++now; if (nowsum > sum) { puts( No ); return 0; } ans[++A] = now; } puts( Yes ); for (int i = 1; i < A; ++i) printf( %d , ans[i]); printf( %d n , ans[A]); return 0; } |
#include <bits/stdc++.h> using namespace std; ifstream fi( test.txt ); ifstream fir( inp.txt ); ofstream fo( out.txt ); const long long MOD = 1e9 + 7; const long long base = 269; const int ooi = 1 << 30; const int N = 1e5 + 5; long long n, m, q, k, pos, rs, t, T, cnt, rs1; long long maxx = -1e9, minn = 1e9; long long a[N], b[N]; vector<long long> c[N]; int main() { cin >> n >> k; for (long long(i) = 0; (i) < (n); (i)++) { cin >> a[i]; } for (long long(i) = 0; (i) < (n); (i)++) { cin >> b[i]; c[a[i]].push_back(b[i]); } for (long long(i) = 1; (i) <= (k); (i)++) { sort(c[i].begin(), c[i].end()); if (c[i].size()) c[i].pop_back(), cnt++; } cnt = k - cnt; vector<long long> ans; for (long long(i) = 1; (i) <= (k); (i)++) { for (long long(j) = 0; (j) < (c[i].size()); (j)++) ans.push_back(c[i][j]); } sort(ans.begin(), ans.end()); for (long long(i) = 0; (i) < (cnt); (i)++) rs += ans[i]; cout << rs; } |
#include <bits/stdc++.h> using namespace std; vector<long long> gr[200011]; vector<long long> v; vector<long long> v1; bool vis[200011]; queue<pair<long long, bool> > q; long long n, m; void bfs(long long s, bool k) { q.push({s, k}); while (!q.empty()) { long long node = q.front().first; bool z = q.front().second; q.pop(); if (vis[node]) continue; if (z) v.push_back(node); else v1.push_back(node); vis[node] = 1; for (int i = 0; i < gr[node].size(); i++) if (!vis[gr[node][i]]) q.push({gr[node][i], !z}); } } int main() { ios::sync_with_stdio(0); long long q, i, x, y; cin >> q; while (q--) { cin >> n >> m; for (i = 0; i < m; i++) { cin >> x >> y; gr[x].push_back(y); gr[y].push_back(x); } v.clear(); v1.clear(); bfs(1, 0); if (v.size() <= n / 2) { cout << v.size() << endl; for (i = 0; i < v.size(); i++) cout << v[i] << ; cout << endl; } else { cout << v1.size() << endl; for (i = 0; i < v1.size(); i++) cout << v1[i] << ; cout << endl; } for (i = 1; i <= n; i++) { vis[i] = 0; gr[i].clear(); } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> using vc = vector<T>; template <class T> using vvc = vc<vc<T>>; template <class T> void mkuni(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } template <class T> void print(T x, int suc = 1) { cout << x; if (suc == 1) cout << n ; else cout << ; } template <class T> void print(const vector<T>& v, int suc = 1) { for (int i = 0; i < v.size(); i++) print(v[i], i == (int)(v.size()) - 1 ? suc : 2); } const int INF = 0x3f3f3f3f; const int maxn = 2e5 + 7; const int mod = 998244353; long long quick(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * a % mod; a = a * a % mod; b >>= 1; } return ret; } long long inv(long long a) { return quick(a, mod - 2); } long long sufm[maxn], sufsum[maxn]; int p[maxn]; long long calc(int l, int r) { long long ret = sufsum[l] - sufsum[r]; ret = (ret + mod) % mod; ret = ret * inv(sufm[r]) % mod; return ret; } int main() { std::ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> p[i]; sufm[n + 1] = 1; for (int i = n; i >= 1; i--) { sufm[i] = sufm[i + 1] * (100 * inv(p[i]) % mod) % mod; sufsum[i] = (sufsum[i + 1] + sufm[i]) % mod; } long long ans = sufsum[1]; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; #define ll long long #define f first #define s second const int N = 2e5+5; int n , dp[N] , ans; vector<int> adj[N]; void dfs(int node , int par) { vector<int> v; for(auto ch : adj[node]) { if (ch==par) continue; dfs(ch , node); v.push_back(dp[ch]+1); } sort(v.begin() , v.end()); if (v.size()) { if (node != 1) { int mx = v.back() , mn = v[0]; if (adj[node].size() > 1) ans = max(ans , mx+1); dp[node] = mn; } else { int mx = v.back() , mn; v.pop_back(); if (v.size()) mn = v.back(); else mn = -1; //second maximum ans = max(ans , mn+1); ans = max(ans , mx); dp[node] = mx; } } } void clear() { ans = 0; for(int i=1; i<=n; i++) adj[i].clear() , dp[i] = 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while(t--) { cin >> n; for(int i=1; i<n; i++) { int v,u; cin >> v >> u; adj[v].push_back(u) , adj[u].push_back(v); } dfs(1,1); cout << ans << n ; clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; int a[n][2]; int l = 0, r = 0; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; l += a[i][0]; r += a[i][1]; } int ans = abs(l - r); int ind = 0; int res = ans; for (int i = 0; i < n; i++) { int temp; temp = abs(l - r + 2 * (a[i][1]) - 2 * a[i][0]); if (temp > res) { res = temp; ind = i + 1; } } cout << ind << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e7 + 5; int l, r, x, y; char c; int main() { cin >> l >> c >> r; cin >> x >> c >> y; l = l * 60 + r; x = x * 60 + y; l = l - x; if (l < 0) { l += 24 * 60; } printf( %02d:%02d n , l / 60, l % 60); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int tc; cin >> tc; while (tc-- > 0) { long long int n; cin >> n; if (n % 2 == 0) { long long int a = 2; long long int b = n / 2; cout << a << << b << n ; } else { cout << 2 << << n - 1 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200 + 10; int main() { int n, arr[N]; char f; char ch[N]; scanf( %d , &n); cin >> ch; n = 2 * n; for (int i = 0; i < n; i++) arr[i] = ch[i] - 0 ; sort(arr, arr + n / 2); sort(arr + n / 2, arr + n); bool a = false, b = false; for (int i = 0; i < n / 2; i++) { if (arr[i] >= arr[n / 2 + i]) a = true; if (arr[i] <= arr[n / 2 + i]) b = true; } if (a && b) cout << NO ; else cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; long long int i, j, a, b, ans; for (i = 1; i <= t; i++) { cin >> a >> b; ans = 0; while ((a + b + ans * (ans + 1) / 2) % 2 != 0 || (a + b + ans * (ans + 1) / 2) < 2 * max(a, b)) { ans++; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; struct point { long long x, a; } p[100]; int n; long long key[100][100]; long long k[100]; long long s[3], ans; long long v; void getb(long long ab, long long b, int cur) { if (ab < b * b) return; if (cur > n + 1) return; if (cur == n + 1) { long long a = ab / b; long long c = v / ab; long long tmp = a * c + ab + b * c; if (tmp < ans) { ans = tmp; s[0] = a, s[1] = b, s[2] = c; } return; } int t = p[cur].a - k[cur]; for (int i = t; i >= 0; i--) { getb(ab, b * key[cur][i], cur + 1); } } void dfs(long long c, int cur) { if (v / c < c * c || cur > n + 1) return; if (cur == n + 1) { long long ab = v / c; if (ab + 2 * sqrt(1.0 * v * c) <= ans) { getb(ab, 1, 1); } return; } for (int i = p[cur].a; i >= 0; i--) { k[cur] = i; dfs(c * key[cur][i], cur + 1); } } int main() { int cas; long long suma, sumb; scanf( %d , &cas); while (cas--) { scanf( %d , &n); v = 1; for (int i = 1; i <= n; i++) { cin >> p[i].x >> p[i].a; long long t = 1; key[i][0] = 1; for (int j = 1; j <= p[i].a; j++) { t *= p[i].x; key[i][j] = t; } v *= t; } ans = 2 * v + 1; s[0] = v, s[1] = s[2] = 1; dfs(1, 1); ans *= 2; cout << ans << << s[0] << << s[1] << << s[2] << endl; } return 0; } |
#include <bits/stdc++.h> #include <stdio.h> using namespace std; #define all(v) v.begin(), v.end() #define eb emplace_back #define ll long long const int N = 2e5 + 5; const int inf = 1e9 + 7; ll t[4 * N]; ll z[4 * N]; ll a[N]; bool modify[4 * N]; void push(int tl, int tr, int v) { if (modify[v]) { t[v] += z[v]; if (tl != tr) { modify[v + v + 1] = modify[v + v + 2] = 1; z[v + v + 1] += z[v]; z[v + v + 2] += z[v]; } modify[v] = 0; z[v] = 0; } } void build(int tl, int tr, int v) { if (tl == tr) { t[v] = a[tl]; } else { int tm = (tl + tr) >> 1; build(tl, tm, v + v + 1); build(tm + 1, tr, v + v + 2); t[v] = min(t[v + v + 1], t[v + v + 2]); } } ll query(int ql, int qr, int tl, int tr, int v) { if (ql > tr || qr < tl) { return inf; } push(tl, tr, v); if (ql <= tl && tr <= qr) { return t[v]; } int tm = (tl + tr) >> 1; return min( query(ql, qr, tl, tm, v + v + 1), query(ql, qr, tm + 1, tr, v + v + 2)); } void update(int ql, int qr, int val, int tl, int tr, int v) { push(tl, tr, v); if (ql > tr || qr < tl) { return; } if (ql <= tl && tr <= qr) { z[v] += val; modify[v] = 1; push(tl, tr, v); } else { int tm = (tl + tr) >> 1; update(ql, qr, val, tl, tm, v + v + 1); update(ql, qr, val, tm + 1, tr, v + v + 2); t[v] = min(t[v + v + 1], t[v + v + 2]); } } void solve() { int n; cin >> n; int answer = 0; vector<pair<int, int>> neg; for(int i = 0; i < n; i += 1) { int x; cin >> x; if (x < 0) { neg.emplace_back(x, i); } if (i) a[i] = a[i - 1]; if (x >= 0) { a[i] += x; answer += 1; } } build(0, n - 1, 0); sort(all(neg)); reverse(all(neg)); // for(int i = 0; i < n; i += 1) { // cout << query(i, i, 0, n - 1, 0) << ; // } // cout << endl; for(auto [val, id] : neg) { update(id, n - 1, val, 0, n - 1, 0); if (query(0, n - 1, 0, n - 1, 0) >= 0) { answer += 1; // cout << id = << id << endl; // for(int i = 0; i < n; i += 1) { // cout << query(i, i, 0, n - 1, 0) << ; // } // cout << endl; } else { update(id, n - 1, -val, 0, n - 1, 0); } } cout << answer << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); // freopen( taskA.in , r , stdin); // freopen( taskA.out , w , stdout); int t = 1; // cin >> t; while(t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int cnt[300007]; int main() { int n, k; scanf( %d%d , &n, &k); string s; cin >> s; int check = 100; for (int i = (0); i <= ((int)s.size() - 1); ++i) ++cnt[s[i] - a ]; for (int i = ( a ); i <= ( z ); ++i) { if (k >= cnt[i - a ]) k -= cnt[i - a ]; else { cnt[i - a ] -= k; check = i - a ; break; } } string str = ; for (int i = (0); i <= ((int)s.size() - 1); ++i) { if (s[i] - a < check) continue; if (s[i] - a == check) { if (k) { --k; continue; } } str += s[i]; } cout << str << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; string num; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> num; for (int i = 0; i < num.length(); i++) { cout << num[i]; } for (int i = num.length() - 1; i >= 0; i--) { cout << num[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-7; const long long MOD = 1000000007LL; const int INF = 0x3f3f3f3f; const int _NAN = -0x3f3f3f3f; const double EULC = 0.5772156649015328; const int NIL = -1; template <typename T> void read(T &x) { x = 0; char ch = getchar(); long long f = 1; while (!isdigit(ch)) { if (ch == - ) f *= -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } x *= f; } const int maxn = 1e7 + 10; bool isprime[maxn] = {1, 1}; int prime[maxn], kase; vector<long long> ve; long long ls[12] = {0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024}; int ans; void primeMaker() { for (int i = 2; i < maxn; ++i) { if (!isprime[i]) prime[kase++] = i; for (int j = 0; j < kase && prime[j] * i < maxn; ++j) { isprime[i * prime[j]] = true; if (!(i % prime[j])) break; } } } int solve(long long &n) { long long t2 = n; int __max = -1; for (int i = 0; i < kase && prime[i] <= t2; ++i) { if (!(t2 % prime[i])) { int cnt = 0; while (!(t2 % prime[i])) { ++cnt; t2 /= prime[i]; } if (__max != -1 && __max != cnt) ++ans; __max = max(__max, cnt); ve.push_back(prime[i]); } } if (ans) ans = 1; if (__max == -1) __max = 1; for (int i = 0; i < 10; ++i) { if (__max == ls[i]) break; if (__max > ls[i] && __max < ls[i + 1]) { __max = ls[i + 1]; if (ans != 1) ++ans; break; } } n = 1; if (!ve.empty()) { for (auto num : ve) n *= num; } return __max; } int main(void) { primeMaker(); long long n; while (~scanf( %lld , &n)) { ans = 0; if (!isprime[n]) { printf( %lld %d n , n, 0); continue; } int res = solve(n); ans += log2l(res) + eps; printf( %lld %d n , n, ans); ve.clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; int par[18][100005]; int depth[100005]; void dfs(int u, int p = 0, int d = 0) { par[0][u] = p; depth[u] = d; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i]; if (v == p) continue; dfs(v, u, d + 1); } } int LCA(int a, int b) { if (depth[a] < depth[b]) swap(a, b); int diff = depth[a] - depth[b]; for (int i = 17; i >= 0; i--) if ((diff >> i) & 1) a = par[i][a]; if (a == b) return a; for (int i = 17; i >= 0; i--) { if (par[i][a] != par[i][b]) a = par[i][a], b = par[i][b]; } return par[0][a]; } int dist(int a, int b) { int lca = LCA(a, b); return depth[a] + depth[b] - 2 * depth[lca]; } int main() { int n, q, p; scanf( %d%d , &n, &q); for (int i = 2; i <= n; i++) scanf( %d , &p), g[i].push_back(p), g[p].push_back(i); dfs(1); for (int j = 1; j <= 17; j++) for (int i = 1; i <= n; i++) if (par[j - 1][i] != 0) par[j][i] = par[j - 1][par[j - 1][i]]; while (q--) { int a[3]; scanf( %d%d%d , &a[0], &a[1], &a[2]); int ans = -1; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { for (int k = 0; k < 3; k++) { if (i == j || i == k || j == k) continue; int s = a[i], t = a[j], f = a[k]; ans = max(ans, (dist(s, f) + dist(t, f) - dist(s, t) + 1) / 2); } } } printf( %d n , ans + 1); } } |
#include <bits/stdc++.h> using namespace std; bool is_integer(long double k) { return std::floor(k) == k; } int main() { long long i, j = 0; string s; cin >> s; if (s.length() == 1 && s[0] == 0 ) { cout << 0; return 0; } int c = 0; for (i = (s.length() - 1); i >= 0; i--) { if (s[i] == 1 ) { c++; } } if (c == 1) { cout << floor(s.length() / 2.0); } else { cout << ceil(s.length() / 2.0); } } |
#include <bits/stdc++.h> using namespace std; using tint = tuple<int, int, int>; const int maxn = 200004; int N, M; tint a[maxn]; struct dsu { dsu() { iota(p, p + maxn, 0); } int p[maxn], add[maxn]; int root(int k) { return p[k] != k ? p[k] = root(p[k]) : k; } bool connect(int x, int y) { x = root(x); y = root(y); if (x == y) return false; p[y] = x; add[x] |= add[y]; return true; } } d; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N >> M; for (int i = 0; i < M; i++) { int x, y, w; cin >> x >> y >> w; a[i] = tint(x, y, w); } sort(a, a + M, [](tint x, tint y) { return get<2>(x) > get<2>(y); }); int ans = 0; for (int i = 0; i < M; i++) { int x, y, w; tie(x, y, w) = a[i]; if (d.root(x) != d.root(y) and not(d.add[d.root(x)] and d.add[d.root(y)])) { ans += w; d.connect(x, y); } else if (!d.add[d.root(x)]) { ans += w; d.add[d.root(x)] = true; } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; int totb = 0, totr = 0, totx = 0, deep; int n; struct data { int next, num; } edgeb[400001], edger[400001]; struct data2 { int x; bool judge; } ans[200001]; struct seg { int l, r, va; } tr[1600001], tb[1600001]; int headb[200001], headr[200001]; int wb[200001], wr[200001], vr[200001], vb[200001], db[200001], dr[200001]; int fab[200001][19], far[200001][19], lb[200001], rb[200001], lr[200001], rr[200001]; int eb[200001], er[200001], vab[400001], var[400001], locb[400001], locr[400001], px; bool visb[200001], visr[200001]; queue<data2> q; bool cmp(data2 p, data2 q) { return p.x < q.x; } void add1(int u, int v) { edgeb[++totb].next = headb[u]; edgeb[totb].num = v; headb[u] = totb; } void add2(int u, int v) { edger[++totr].next = headr[u]; edger[totr].num = v; headr[u] = totr; } void dfsb1(int x) { wb[x] = vb[x]; db[x] = deep; lb[x] = totx + 1; totx += wb[x]; for (int i = headb[x]; i != -1; i = edgeb[i].next) { int kx = edgeb[i].num; if (!db[kx]) { deep++; fab[kx][0] = x; dfsb1(kx); deep--; wb[x] += wb[kx]; } } rb[x] = totx; } void dfsr1(int x) { wr[x] = vr[x]; dr[x] = deep; lr[x] = totx + 1; totx += wr[x]; for (int i = headr[x]; i != -1; i = edger[i].next) { int kx = edger[i].num; if (!dr[kx]) { deep++; far[kx][0] = x; dfsr1(kx); deep--; wr[x] += wr[kx]; } } rr[x] = totx; } void build(int i, int l, int r) { tr[i].l = tb[i].l = l; tr[i].r = tb[i].r = r; if (l == r) { tb[i].va = vab[l]; tr[i].va = var[l]; if (locr[l] == px) tr[i].va = INF; return; } int mid = (l + r) / 2; build(i * 2, l, mid); build(i * 2 + 1, mid + 1, r); tr[i].va = min(tr[i * 2].va, tr[i * 2 + 1].va); tb[i].va = min(tb[i * 2].va, tb[i * 2 + 1].va); } void deleb(int i, int l, int r, int va) { int nowl = tb[i].l, nowr = tb[i].r; if (nowl > r || nowr < l) return; if (tb[i].va > va) return; if (nowl == nowr) { tb[i].va = INF; if (visb[locb[nowl]]) return; tb[i].va = INF; data2 now; now.x = locb[nowl]; now.judge = 1; q.push(now); visb[now.x] = 1; return; } deleb(i * 2, l, r, va); deleb(i * 2 + 1, l, r, va); tb[i].va = min(tb[i * 2].va, tb[i * 2 + 1].va); } void deler(int i, int l, int r, int va) { int nowl = tr[i].l, nowr = tr[i].r; if (nowl > r || nowr < l) return; if (tr[i].va > va) return; if (nowl == nowr) { tr[i].va = INF; if (visr[locr[nowl]]) return; data2 now; now.x = locr[nowl]; now.judge = 0; q.push(now); visr[now.x] = 1; return; } deler(i * 2, l, r, va); deler(i * 2 + 1, l, r, va); tr[i].va = min(tr[i * 2].va, tr[i * 2 + 1].va); } void prelca() { fab[1][0] = far[1][0] = 1; for (int j = 1; j <= 18; j++) for (int i = 1; i <= n; i++) { far[i][j] = far[far[i][j - 1]][j - 1]; fab[i][j] = fab[fab[i][j - 1]][j - 1]; } } int lcab(int u, int v) { while (db[u] > db[v]) { int kx = log2(db[u] - db[v]); u = fab[u][kx]; } while (db[u] < db[v]) { int kx = log2(db[v] - db[u]); v = fab[v][kx]; } if (u == v) return u; int kg = log2(db[u]); for (int i = kg; i >= 0; i--) { if (fab[u][i] == fab[v][i]) continue; u = fab[u][i]; v = fab[v][i]; } return fab[u][0]; } int lcar(int u, int v) { while (dr[u] > dr[v]) { int kx = log2(dr[u] - dr[v]); u = far[u][kx]; } while (dr[u] < dr[v]) { int kx = log2(dr[v] - dr[u]); v = far[v][kx]; } if (u == v) return u; int kg = log2(dr[u]); for (int i = kg; i >= 0; i--) { if (far[u][i] == far[v][i]) continue; u = far[u][i]; v = far[v][i]; } return far[u][0]; } void prep() { memset(headr, -1, sizeof(headr)); memset(headb, -1, sizeof(headb)); scanf( %d , &n); for (int i = 2; i <= n; i++) { scanf( %d , &eb[i]); add1(i, eb[i]); add1(eb[i], i); } for (int i = 2; i <= n; i++) { scanf( %d , &er[i]); add2(i, er[i]); add2(er[i], i); } for (int i = 2; i <= n; i++) { vr[i]++; vr[eb[i]]++; vb[i]++; vb[er[i]]++; } deep = 1; totx = 0; dfsb1(1); deep = 1; totx = 0; dfsr1(1); memset(vr, 0, sizeof(vr)); memset(vb, 0, sizeof(vb)); prelca(); for (int i = 2; i <= n; i++) { vr[i]++; vr[eb[i]]++; var[vr[i] + lr[i] - 1] = var[vr[eb[i]] + lr[eb[i]] - 1] = dr[lcar(i, eb[i])]; locr[vr[i] + lr[i] - 1] = locr[vr[eb[i]] + lr[eb[i]] - 1] = i - 1; vb[i]++; vb[er[i]]++; vab[vb[i] + lb[i] - 1] = vab[vb[er[i]] + lb[er[i]] - 1] = db[lcab(i, er[i])]; locb[vb[i] + lb[i] - 1] = locb[vb[er[i]] + lb[er[i]] - 1] = i - 1; } scanf( %d , &px); build(1, 1, 2 * n - 2); } int getp(data2 x) { int i = x.x; if (x.judge == 0) { if (db[i + 1] < db[eb[i + 1]]) return eb[i + 1]; return i + 1; } if (dr[i + 1] < dr[er[i + 1]]) return er[i + 1]; return i + 1; } void work() { data2 gx; gx.judge = 0; gx.x = px; q.push(gx); visr[px] = 1; int headpx = 0; while (!q.empty()) { data2 k = q.front(); ans[++headpx] = k; q.pop(); int point = getp(k); if (k.judge == 0) deleb(1, lb[point], rb[point], db[point] - 1); else deler(1, lr[point], rr[point], dr[point] - 1); } printf( Blue n%d , ans[1].x); for (int i = 2; i <= headpx; i++) { if (ans[i].judge != ans[i - 1].judge) { int nowj = i; while (nowj <= headpx && ans[nowj].judge == ans[i].judge) nowj++; sort(ans + i, ans + nowj, cmp); if (ans[i].judge == 0) printf( nBlue n ); else printf( nRed n ); } printf( %d , ans[i].x); } } int main() { prep(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e6 + 7; const int mod = 1e9 + 7; long long int dp[maxn] = {0}; int main() { int t; cin >> t; dp[1] = 0; dp[2] = 0; dp[3] = 1; for (int i = 4; i < maxn; i++) { dp[i] = 2 * dp[i - 2] + dp[i - 1]; if (i % 3 == 0) dp[i]++; dp[i] %= mod; } while (t--) { int n; cin >> n; cout << (dp[n] * 4 + mod) % mod << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; const int MOD = 1e9 + 7; int read() { int x = 0, ch; while (isspace(ch = getchar())) ; do x = x * 10 + ch - 0 ; while (isdigit(ch = getchar())); return x; } int n; map<int, int> idx, idy; int nid; namespace G { int head[MAXN], nxt[MAXN], to[MAXN], m; void init() { memset(head, -1, sizeof head); } void adde(int u, int v) { to[m] = v, nxt[m] = head[u], head[u] = m++; to[m] = u, nxt[m] = head[v], head[v] = m++; } } // namespace G int fpow(int a, int b) { int c = 1; while (b) { if (b & 1) c = int(1LL * c * a % MOD); a = int(1LL * a * a % MOD); b >>= 1; } return c; } int vis[MAXN]; queue<int> q; int solve(int s) { using namespace G; int e = 0, o = 0; vis[s] = 1, q.push(s); while (!q.empty()) { int u = q.front(); q.pop(); ++o; for (int i = head[u]; ~i; i = nxt[i], ++e) if (!vis[to[i]]) vis[to[i]] = 1, q.push(to[i]); } e >>= 1; return e == o - 1 ? (fpow(2, o) - 1 + MOD) % MOD : fpow(2, o); } int main() { n = read(); G::init(); for (int i = 0; i < n; ++i) { int x = read(), y = read(); if (!idx[x]) idx[x] = ++nid; if (!idy[y]) idy[y] = ++nid; G::adde(idx[x], idy[y]); } int ans = 1; for (int i = 1; i <= nid; ++i) if (!vis[i]) ans = int(1LL * ans * solve(i) % MOD); printf( %d n , ans); return 0; } |
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <ctype.h> #include <deque> #include <cstring> #include <set> #include <bitset> #include <map> #include <chrono> #include <random> #include <unordered_map> #include <stdio.h> using namespace std; typedef long long ll; typedef long double ld; typedef std::vector<int> vi; typedef std::vector<bool> vb; typedef std::vector<string> vs; typedef std::vector<double> vd; typedef std::vector<long long> vll; typedef std::vector<std::vector<int> > vvi; typedef vector<vll> vvll; typedef std::vector<std::pair<int, int> > vpi; typedef vector<vpi> vvpi; typedef std::pair<int, int> pi; typedef std::pair<ll, ll> pll; typedef std::vector<pll> vpll; const long long mod = 1000000007; const unsigned gen_seed = std::chrono::system_clock::now().time_since_epoch().count(); std::mt19937_64 gen(gen_seed); #define all(c) (c).begin(),(c).end() #define srt(c) sort(all(c)) #define srtrev(c) sort(all(c)); reverse(all(c)) #define forn(i, a, b) for(int i = a; i < b; i++) #define read(x) scanf( %d , &x) #define readv(x, n) vi x(n); forn(i,0,n) scanf( %d , &x[i]) #define pb push_back #define mp make_pair void mul(vi & a, int k) { vi b(k,0); for(auto x : a) b.pb(x); forn(i,0,a.size()) b[i] = (b[i] + mod-a[i])%mod; a.resize(b.size() - 1); for(int i = b.size() - 1; i > 0; i--) { a[i-1] = b[i]; b[i-1] = (b[i] + b[i-1])%mod; } } vi c, b; int n; int get(int x) { vi p(1,1); int sb = 0; int sbt = 0; int add = 0; forn(i,0,n) { mul(p, c[i]+1); int cur = x*(i+1) + sbt - add; if(cur > (int)p.size()) { return 0; } if(cur>0) { forn(j,0,p.size() - cur) p[j] = p[j + cur]; p.resize(p.size() - cur); add += cur; } sb+=b[i]; sbt+=sb; } ll ans = 0; forn(i,0,p.size()) ans = ans+p[i]; return ans % mod; } set<int> cool; int death = 1000; void getcool() { int sb = 0; int sbt = 0; int dp = 0; forn(i,0,n) { dp += c[i]; forn(x,-sbt/(i+1),(dp-sbt)/(i+1)+2) { int cur = x*(i+1) + sbt; if(cur >0 && cur <= dp) { cool.insert(x); } else if(cur > dp) { death = min(death, x); } } sb+=b[i]; sbt+=sb; } } int main() { #ifndef ONLINE_JUDGE freopen( input.txt , rt , stdin); freopen( output.txt , wt , stdout); #endif scanf( %d , &n); // readv(c,n); // readv(b,n-1); c.resize(n); b.resize(n-1); forn(i,0,n) scanf( %d , &c[i]); forn(i,0,n-1) scanf( %d , &b[i]); int q; read(q); getcool(); map<int, int> ans; for(auto x : cool) { if(x < death) ans[x] = get(x); else ans[x] = 0; } ll full = 1; forn(i,0,n) full = (full * (c[i]+1))%mod; while(q--) { int x; read(x); if(cool.find(x) != cool.end()) printf( %d n , ans[x]); else if(x >= death) printf( 0 n ); else printf( %d n , full); } } |
#include <bits/stdc++.h> using namespace std; const int inf = ~0u >> 2; const int N = 500010; int Max[N << 2]; struct node { int x, y, z; } in[N]; int tot, n; int num[N]; int max(int a, int b) { return a > b ? a : b; } void pushup(int rt) { Max[rt] = max(Max[rt << 1], Max[rt << 1 | 1]); } void build(int l, int r, int rt) { Max[rt] = 0; if (l == r) return; int m = (l + r) >> 1; build(l, m, rt << 1); build(m + 1, r, rt << 1 | 1); } void update(int p, int val, int l, int r, int rt) { if (l == r) { if (val > Max[rt]) Max[rt] = val; return; } int m = (l + r) >> 1; if (p <= m) update(p, val, l, m, rt << 1); else update(p, val, m + 1, r, rt << 1 | 1); pushup(rt); } int query(int L, int R, int l, int r, int rt) { if (L <= l && r <= R) return Max[rt]; int m = (l + r) >> 1; int ret = 0; if (L <= m) ret = max(ret, query(L, R, l, m, rt << 1)); if (R > m) ret = max(ret, query(L, R, m + 1, r, rt << 1 | 1)); return ret; } void init() { sort(num + 1, num + n + 1); tot = unique(num + 1, num + n + 1) - num - 1; build(1, tot, 1); for (int i = 1; i <= n; i++) in[i].x = lower_bound(num + 1, num + 1 + tot, in[i].x) - num; } inline int cmp(node a, node b) { return a.y > b.y; } int main() { int i, j, k; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &in[i].x); num[i] = in[i].x; } for (i = 1; i <= n; i++) scanf( %d , &in[i].y); for (i = 1; i <= n; i++) scanf( %d , &in[i].z); init(); sort(in + 1, in + n + 1, cmp); int ans = 0; for (i = 1; i <= n; i = j) { for (j = i; j <= n && in[j].y == in[i].y; j++) { int z; z = query(in[j].x + 1, tot, 1, tot, 1); if (z > in[j].z) ans++; } for (; i <= j - 1; i++) { update(in[i].x, in[i].z, 1, tot, 1); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}, n; cin >> n; cout << a[n]; } |
#include <bits/stdc++.h> namespace chtholly { char buf[1 << 23], *p1 = buf, *p2 = buf; inline int read() { int x = 0, f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) f ^= c == - ; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); return f ? x : -x; } template <typename mitsuha> inline bool read(mitsuha &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c) && ~c; c = getchar()) f ^= c == - ; if (!~c) return 0; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); return x = f ? x : -x, 1; } template <typename mitsuha> inline int write(mitsuha x) { if (!x) return 0 & putchar(48); if (x < 0) putchar( - ), x = -x; int bit[20], i, p = 0; for (; x; x /= 10) bit[++p] = x % 10; for (i = p; i; --i) putchar(bit[i] + 48); return 0; } inline char fuhao() { char c = getchar(); for (; isspace(c); c = getchar()) ; return c; } } // namespace chtholly using namespace chtholly; using namespace std; const int yuzu = 1e5; typedef long long fuko[yuzu | 10]; fuko a, b, c, d; int n, k; typedef long long karen[yuzu << 2 | 13]; struct segtree { karen val; void build(int rt = 1, int l = 1, int r = n) { if (l == r) val[rt] = read() % k; else { int mid = l + r >> 1; build(rt << 1, l, mid), build(rt << 1 | 1, mid + 1, r); val[rt] = val[rt << 1] * val[rt << 1 | 1] % k; } } long long query(int ql, int qr, int rt = 1, int l = 1, int r = n) { if (ql > r || qr < l) return 1; if (ql <= l && qr >= r) return val[rt]; int mid = l + r >> 1; return query(ql, qr, rt << 1, l, mid) * query(ql, qr, rt << 1 | 1, mid + 1, r) % k; } } my; int main() { read(n), read(k), my.build(); int i, l = 1, r = 1; long long llx = 0; for (; r <= n; llx += n - r + 1, ++l, r = max(l, r)) for (; r <= n && my.query(l, r); ++r) ; write(llx); } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e17; const long long maxn = 2e5 + 700; const int mod = 1e9 + 7; template <typename T> inline void read(T &a) { char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + c - 0 ; c = getchar(); } a = f * x; } long long n, m, p; char s[maxn]; int a[maxn], b[maxn]; int digit(long long x, int *d) { int ans = 0; while (x) { d[++ans] = x % 10; x /= 10; } return ans; } int path[maxn]; int check(int pos, int lbound, int rbound) { if (!pos) return 1; if (!lbound && !rbound) return 1; int l = lbound ? a[pos] : 0; int r = rbound ? b[pos] : 9; for (int i = l; i <= r; i++) { if (path[i] > 0) { path[i]--; if (check(pos - 1, lbound && i == l, rbound && i == r)) { path[i]++; return 1; } path[i]++; } } return 0; } int pos, res = 0; void dfs(int u, int w) { if (u == 9) { path[u] = w; if (check(pos, 1, 1)) res++; return; } for (int i = 0; i <= w; i++) { path[u] = i; dfs(u + 1, w - i); } } int main() { read(n); read(m); digit(n, a); pos = digit(m, b); dfs(0, pos); printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int q[3001], t, n; int main() { scanf( %d , &n); for (int i = 2; i <= n; i++) { if (q[i - 1] == 2) t++; if (q[i] > 0) continue; for (int j = i; j <= n; j += i) q[j]++; } if (q[n] == 2) t++; printf( %d n , t); } |
#include <bits/stdc++.h> using namespace std; long long n, x; vector<string> ans; long long dec(string s) { long long ret = 0; for (long long i = 0; i < s.size(); i++) { ret = ret * 10 + s[i] - 48; } return ret; } void add(long long v) { long long rs = 0; if (ans.size() == 0) { string tmp = ; while (v > 9) { tmp = 9 + tmp; v -= 9; } tmp = to_string(v) + tmp; ans.push_back(tmp); } else { string p_s = ans[ans.size() - 1], req = p_s; long long cnt = 0; for (long long i = 0; i < req.size(); i++) { cnt += req[i] - 48; } if (cnt < v) { long long df = v - cnt; for (long long i = req.size() - 1; i >= 0; i--) { if (req[i] < 9 && df) { long long dy = 9 - req[i]; req[i] += min(df, dy); df -= min(df, dy); if (!df) { ans.push_back(req); return; } } } while (df >= 9) { req = 9 + req; df -= 9; } if (v) req = to_string(df) + req; ans.push_back(req); } else { string p_s = ans[ans.size() - 1]; long long idx = -1, sm = 0, tmp_sm = 0; for (long long i = 0; i < p_s.size(); i++) { tmp_sm += p_s[i] - 48; if (v > tmp_sm && p_s[i] < 9 ) { idx = i; sm = tmp_sm; } else if (v < sm) break; } if (idx == -1) { string p_s = 1 ; long long sz = ans[ans.size() - 1].size(); for (long long i = 0; i < sz; i++) p_s = p_s + 0 ; v -= 1; long long idx = p_s.size() - 1; while (idx > 0 && v > 0) { char c = (char)min((long long) 9 , v + 48); p_s[idx] = c; idx--, v -= 9; } ans.push_back(p_s); } else { sm = v - sm - 1; p_s[idx] += 1; for (long long j = idx + 1; j < p_s.size(); j++) { p_s[j] = 0 ; } for (long long i = p_s.size() - 1; i > idx; i--) { if (sm > 0) { long long dx = 9 - p_s[i]; p_s[i] += min(sm, dx); sm -= min(sm, dx); } else break; } ans.push_back(p_s); } } } } int main() { cin >> n; for (long long i = 0; i < n; i++) { cin >> x; add(x); } for (long long i = 0; i < ans.size(); i++) cout << ans[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N; scanf( %d , &N); if (N == 1) { puts( 1 ); return 0; } int s = 0; for (int i = 0; i < N; ++i) { int t; scanf( %d , &t); s += t; } printf( %d n , s % N == 0 ? N : N - 1); } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); #pragma GCC diagnostic ignored -Wsign-compare int main() { int n, ind = 0; scanf( %d , &n); vector<long long> vals(n); vector<long long> pref(n); for (int i = 0; i < n; i++) { scanf( %d , &vals[i]); } 42; partial_sum(vals.begin(), vals.end(), pref.begin()); vals.insert(vals.begin(), 0); pref.insert(pref.begin(), 0); vector<double> hull(n); vector<pair<int, int> > inds(n); for (int i = 1; i <= n; i++) { double cur = vals[i]; pair<int, int> use = make_pair(i, i); while (ind > 0 and hull[ind - 1] > cur) { ind--; cur = ((double)pref[i] - pref[inds[ind].first - 1]) / ((double)i - inds[ind].first + (double)1.000000); use = make_pair(inds[ind].first, i); } hull[ind] = cur; inds[ind] = use; ind++; } 42; for (int i = 0; i < ind; i++) { for (int j = inds[i].first; j <= inds[i].second; j++) { printf( %.10f n , hull[i]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a < b) { swap(a, b); } if (a % b == 0) { return b; } return gcd(b, a % b); } vector<vector<int>> gr; vector<int> used; void dfs(int v) { used[v] = 1; for (auto i : gr[v]) { if (!used[i]) { dfs(i); } } } void solution() { long int n; cin >> n; vector<long long> mass(n); long long minn = 1e10; long long minn_ind = 0; for (int i = 0; i < n; i++) { cin >> mass[i]; if (mass[i] < minn) { minn = mass[i]; minn_ind = i; } } gr = vector<vector<int>>(n); used = vector<int>(n, 0); for (int i = 0; i < n; i++) { if (gcd(mass[i], minn) == minn) { gr[i].push_back(minn_ind); gr[minn_ind].push_back(i); } } dfs(minn_ind); vector<long long> sorted = mass; sort(sorted.begin(), sorted.end()); vector<long long> get_ans; for (int i = 0; i < n; i++) { if (mass[i] != sorted[i] || i == minn_ind) { get_ans.push_back(i); } } bool ans = 1; for (auto i : get_ans) { if (!used[i]) { ans = 0; break; } } if (ans) { cout << YES ; } else { cout << NO ; } cout << endl; } int main() { int t; cin >> t; for (int i = 0; i < t; i++) { solution(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int res; cin >> res; if (res % 2 == 0) { cout << Mahmoud ; } else { cout << Ehab ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int grundy[] = {0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1, 10, 9, 3, 6, 11, 12}; int main() { int n; scanf( %d , &n); int ones = n; bool vis[100100] = {false}; vector<int> v; for (long long i = 2; i * i <= n; i++) { if (vis[i]) continue; int size = 0; for (long long j = i; j <= n; j = j * i) { if (j * j <= n) vis[j] = true; size++; ones--; } v.push_back(grundy[size]); } ones %= 2; for (int i = 0; i < (int)v.size(); i++) ones = ones ^ v[i]; if (ones) cout << Vasya << endl; else cout << Petya << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long xyp(long long x, long long y) { if (y == 0) return 1LL; if (y == 1) return x; if (y % 2) { long long p = xyp(x, y - 1); return (x * p) % 1000000007; } long long p = xyp(x, y / 2); return (p * p) % 1000000007; } long long inv(long long x) { return xyp(x, 1000000007 - 2); } long long fact[10000007]; long long pr[10000007]; vector<long long> rp; void init() { fact[0] = 1; for (long long i = 1; i < 10000007; i++) { fact[i] = (fact[i - 1] * i) % 1000000007; } } long long ncr(long long n, long long r) { if (r < 0) return 0LL; if (r == 0 || n == r) return 1LL; if (r == 1 || ((n - r) == 1)) return n; long long p = (((fact[n] * inv(fact[r])) % 1000000007) * inv(fact[n - r])) % 1000000007; return p; } void sieve() { memset(pr, 1, sizeof(pr)); pr[0] = pr[1] = 0; for (long long i = 2; i < 10000007; i++) { if (pr[i]) { rp.push_back(i); for (long long j = i * i; j < 10000007; j += i) { pr[j] = 0; } } } } void solve() { long long n, k; cin >> n >> k; long long a[n + 1], b[n + 1]; long long flag = 1; for (long long i = 1; i <= n; i++) { cin >> a[i]; b[i] = a[i]; if (a[i] == k) flag = 0; } if (flag) { cout << no n ; return; } sort(b + 1, b + n + 1); if (b[(n + 1) / 2] == k) { cout << yes n ; return; } if (n == 1) { if (a[1] == k) cout << yes n ; else cout << no n ; return; } if (n == 2) { if (b[1] == k) cout << yes n ; else cout << no n ; return; } vector<long long> v; for (long long i = 1; i <= n; i++) { if (a[i] >= k) { v.push_back(i); } } flag = 0; for (long long i = 0; i < v.size() - 1; i++) { if ((v[i + 1] - v[i]) <= 2) { flag = 1; } } if (flag) cout << yes n ; else cout << no n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; int testcases; cin >> testcases; while (testcases--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1.0); const long double EPS = 1e-14; const long long INF = 1e18; const long long MOD = 1e9 + 7; const long long p = 97; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.precision(9); long long n; cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } vector<vector<long long>> pr(n, vector<long long>(6, INF)); pr[0] = vector<long long>(6, -1); for (long long i = 1; i < n; i++) { for (long long j = 1; j <= 5; j++) { if (pr[i - 1][j] == INF) continue; for (long long z = 1; z <= 5; z++) { if (a[i] > a[i - 1]) { if (z > j) { pr[i][z] = j; } } else if (a[i] < a[i - 1]) { if (z < j) { pr[i][z] = j; } } else { if (z != j) { pr[i][z] = j; } } } } } long long last = -1; for (long long i = 1; i <= 5; i++) { if (pr[n - 1][i] != INF) last = i; } if (last == -1) { cout << -1; return 0; } long long num = n - 1; vector<long long> ans; while (num != -1) { ans.push_back(last); last = pr[num][last]; num--; } reverse(ans.begin(), ans.end()); for (long long i = 0; i < ans.size(); i++) { cout << ans[i] << ; } return 0; } |
#include<bits/stdc++.h> using namespace std; int main() { int n,i,j,cnt,ara2[20000],m; string ss; cin>>m; for(i=0;i<m;i++) { cin>>n; cin>>ss; if((ss[0]== 2 )&&(ss[n-1]== 0 )&&(ss[n-2]== 2 )&&(ss[n-3]== 0 )) { cout<< Yes <<endl; } else if((ss[0]== 2 )&&(ss[n-1]== 0 )&&(ss[n-2]== 2 )&&(ss[1]== 0 )) { cout<< Yes <<endl; } else if((ss[0]== 2 )&&(ss[1]== 0 )&&(ss[2]== 2 )&&(ss[n-1]== 0 )) { cout<< Yes <<endl; } else if((ss[0]== 2 )&&(ss[1]== 0 )&&(ss[2]== 2 )&&(ss[3]== 0 )) { cout<< Yes <<endl; } else if((ss[n-1]== 0 )&&(ss[n-2]== 2 )&&(ss[n-3]== 0 )&&(ss[n-4]== 2 )) { cout<< Yes <<endl; } else { cout<< No <<endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int nCases; cin >> nCases; for (int i = 0; i < nCases; i++) { long long nCandy = 0; cin >> nCandy; if (nCandy == 1 || nCandy == 2) { cout << 0 << endl; } else if (nCandy % 2 == 0) { cout << (nCandy / 2) - 1 << endl; } else { cout << nCandy / 2 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300005, B = 35; int n; char t[N]; struct AC { struct Trie { int ch[26], fail, c, c2; } A[N]; int siz[B], root[N], top, cnt; string str[N]; void build(int RT) { queue<int> q; q.push(RT); while (!q.empty()) { int x = q.front(), F, k; q.pop(); for (int i = 0; i < 26; i++) if (A[x].ch[i]) { F = A[x].fail; k = A[x].ch[i]; while (F && !A[F].ch[i]) F = A[F].fail; if (F) A[k].fail = A[F].ch[i]; else A[k].fail = RT; q.push(k); A[k].c2 = A[A[k].fail].c2 + A[k].c; } } } int merge(int x, int y) { if (!x || !y) return x + y; A[x].c = A[x].c | A[y].c; for (int i = 0; i < 26; i++) A[x].ch[i] = merge(A[x].ch[i], A[y].ch[i]); return x; } void Add(string s) { root[++top] = ++cnt; int x = root[top], len = s.length(), k; for (int i = 0; i < len; i++) { k = s[i] - a ; if (!A[x].ch[k]) A[x].ch[k] = ++cnt; x = A[x].ch[k]; } A[x].c++; siz[top] = 1; build(root[top]); while (top && siz[top] == siz[top - 1]) { merge(root[top - 1], root[top]); build(root[top - 1]); siz[top - 1] *= 2; top--; } } int Ask(string s) { int len = s.length(), sum = 0; for (int i = 1; i <= top; i++) { int x = root[i], k; for (int j = 0; j < len; j++) { k = s[j] - a ; while (x && !A[x].ch[k]) x = A[x].fail; if (x) x = A[x].ch[k]; else x = root[i]; sum += A[x].c2; } } return sum; } } IN, OUT; int main() { scanf( %d , &n); int tp; while (n--) { scanf( %d %s , &tp, t); if (tp == 1) IN.Add(t); else if (tp == 2) OUT.Add(t); else cout << IN.Ask(t) - OUT.Ask(t) << n << flush; } } |
#include <bits/stdc++.h> using namespace std; typedef long long ll; inline int read(){ int x=0,f=1; char ch=getchar(); while(ch< 0 ||ch> 9 ){ if(ch== - ) f=-1; ch=getchar(); } while(ch>= 0 &&ch<= 9 ){ x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return x*f; } const int maxn = 3e4 + 9; int t; int a[3]; int solve(){ int l = a[0], m = a[1], r = a[2]; int avg = (l + m + r) / 3; //printf( avg: %d n , avg); int ans = 0; if (l < avg){ if (r > avg){ if (m > avg){ ans += (m - avg) * 2 + r - avg; return ans; } else if (m < avg){ ans += avg - l + (avg - m) * 2; return ans; } else{ ans += avg - l; return ans; } } else if (r < avg){ ans += (avg - l) * 2 + avg - r; return ans; } else{ ans += (avg - l) * 2; return ans; } } else if (l == avg){ if (m == avg){ return ans; } else if (m < avg){ ans += (avg - m) * 2; return ans; } else{ ans += m - avg; return ans; } } else{ if (m < avg){ if (r > avg){ ans += (r - avg) * 2 + l - avg; return ans; } else if (r < avg){ ans += (avg - r) * 2 + avg - m; return ans; } else{ ans += avg - m; return ans; } } else if (m > avg){ ans += (l - avg) * 2 + m - avg; return ans; } else{ ans = (l - avg) * 2; return ans; } } return ans; } int main(){ t = read(); while(t--){ int n = read(); int m; a[0] = a[1] = a[2] = 0; for (int i = 1; i <= n; i++){ m = read(); a[m % 3]++; } //sort(a, a + 3); int ans = solve(); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353, N = 20, M = 1 << 5; int n, m; int f[2][N][N][N][N][2][2], (*nxt)[N][N][N][2][2] = f[1], (*cur)[N][N][N][2][2] = *f; int snx[M], sny[M], spx[M], spy[M], A; void add(int &x, int y) { x += y - mod; x += x >> 31 & mod; } int main() { scanf( %d%d , &n, &m); A = (1 << n) - 1; int x, y; for (int i = 0; i < n; i++) { scanf( %d%d , &x, &y); if (x < 0) snx[1 << i] -= x; else spx[1 << i] += x; if (y < 0) sny[1 << i] -= y; else spy[1 << i] += y; } for (int i = 1; i <= A; i++) spx[i] = spx[i - (i & -i)] + spx[i & -i], spy[i] = spy[i - (i & -i)] + spy[i & -i], snx[i] = snx[i - (i & -i)] + snx[i & -i], sny[i] = sny[i - (i & -i)] + sny[i & -i]; ******nxt = 1; for (; m; m >>= 1) { int c = m & 1, tmp; swap(nxt, cur); memset(nxt, 0, sizeof *f); for (int ppx = 0; ppx <= spx[A]; ppx++) for (int ppy = 0; ppy <= spy[A]; ppy++) for (int pnx = 0; pnx <= snx[A]; pnx++) for (int pny = 0; pny <= sny[A]; pny++) for (int ox = 0; ox < 2; ox++) for (int oy = 0; oy < 2; oy++) if (tmp = cur[ppx][pnx][ppy][pny][ox][oy]) for (int d = 0; d <= A; d++) { int npx = ppx + spx[d], npy = ppy + spy[d], nnx = pnx + snx[d], nny = pny + sny[d]; if (((npx ^ nnx) | (npy ^ nny)) & 1) continue; add(nxt[npx >> 1][nnx >> 1][npy >> 1][nny >> 1] [(npx ^ c) & 1 ? !c : ox][(npy ^ c) & 1 ? !c : oy], tmp); } } printf( %d n , ((******nxt) + mod - 1) % mod); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; char s[N]; int main() { int t; scanf( %d , &t); while (t--) { map<long long, long long> mp; long long n; scanf( %lld , &n); scanf( %s , s); long long sum = 0, ans = 0; long long x; for (int i = 1; i <= n; i++) { x = s[i - 1] - 0 - 1; sum += x; if (sum == 0) ans++; ans += mp[sum]; mp[sum]++; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int par[200005], vis[200005], tree[200005]; set<pair<int, int> > par_change; void dfs(int u, vector<int> next[], int dfs_par) { vis[u] = 1; if (par[u] == u) { par_change.insert({1, u}); } for (int i = 0; i < next[u].size(); ++i) { int v = next[u][i]; if (!vis[v]) { dfs(v, next, u); } else if (v != dfs_par) { if (par[u] == v) { par_change.insert({2, u}); } else { par_change.insert({2, v}); } } } vis[u] = 2; } int main() { int n, cnt = 0; scanf( %d , &n); vector<int> next[n + 5]; for (int i = 1; i <= n; ++i) { scanf( %d , &par[i]); tree[i] = par[i]; if (i != par[i]) { next[i].push_back(par[i]); next[par[i]].push_back(i); } } for (int i = 1; i <= n; ++i) { if (!vis[i]) { dfs(i, next, 0); } } int flag = 0; tree[par_change.begin()->second] = par_change.begin()->second; auto it1 = par_change.begin(), it2 = ++it1; it1 = par_change.begin(); for (; it2 != par_change.end(); ++it2, ++it1) { tree[it2->second] = it1->second; } for (int i = 1; i <= n; ++i) { if (tree[i] != par[i]) { ++cnt; } } printf( %d n , cnt); for (int i = 1; i <= n; ++i) { printf( %d , tree[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e6 + 10; int cnt[maxn]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int t; scanf( %d , &t); ++cnt[t]; } int ans = 0; for (int i = 0; i < maxn - 1; i++) { cnt[i + 1] += (cnt[i] / 2); cnt[i] %= 2; ans += cnt[i]; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void swap(int ar[], int i, int j) { int aux = ar[j]; ar[j] = ar[i]; ar[i] = ar[j]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; int Ma[n][m]; int Mb[n][m]; for (int i = 0; i < n; i++) for (int k = 0; k < m; k++) cin >> Ma[i][k]; for (int i = 0; i < n; i++) for (int k = 0; k < m; k++) { int aux; cin >> aux; if (aux <= Ma[i][k]) { int aux2 = Ma[i][k]; Ma[i][k] = aux; Mb[i][k] = aux2; } else Mb[i][k] = aux; } for (int i = 0; i < n; i++) for (int k = 1; k < m; k++) if (Ma[i][k] <= Ma[i][k - 1] || Mb[i][k] <= Mb[i][k - 1]) { cout << Impossible ; return 0; } for (int k = 0; k < m; k++) for (int i = 1; i < n; i++) if (Ma[i][k] <= Ma[i - 1][k] || Mb[i][k] <= Mb[i - 1][k]) { cout << Impossible ; return 0; } cout << Possible ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { char c; int f = 1; while (!isdigit(c = getchar())) if (c == - ) f = -1; x = (c & 15); while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + (c & 15); x *= f; } const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1}; int _, n, m, i, j, k, a[100005], dis[100015], s = 0, t = 100001, ss = 100002, tt = 100003, l[100015]; int dir[100005], res[100005]; int px[2000005], py[2000005], pdx[2000005], pdy[2000005]; int id(int x, int y) { return (x - 1) * m + y; } vector<int> bi[100015]; struct ii { int y, z; } e[2000005]; int tot; void init() { int i; for ((i) = 1; (i) <= (tot); (i)++) px[i] = py[i] = pdx[i] = pdy[i] = 0; tot = 0; memset(l, 0, sizeof(l)); for ((i) = 0; (i) <= (tt); (i)++) bi[i].clear(); } void add(int x, int y, int z) { tot++; bi[x].push_back(tot + tot - 2); bi[y].push_back(tot + tot - 1); e[tot + tot - 2] = (ii){y, z}; e[tot + tot - 1] = (ii){x, 0}; } bool bfs(int s, int t) { memset(dis, 0x3f, sizeof(dis)); dis[s] = 0; queue<int> qx; qx.push(s); while (!qx.empty()) { int x = qx.front(); qx.pop(); for (__typeof((bi[x]).begin()) it = (bi[x]).begin(); it != (bi[x]).end(); ++it) if (e[*it].z && dis[e[*it].y] > dis[x] + 1) { dis[e[*it].y] = dis[x] + 1; qx.push(e[*it].y); } } return dis[t] < dis[100014]; } int dfs(int x, int tt, int flw) { if (x == tt || !flw) return flw; int ans = 0; for (__typeof((bi[x]).begin()) it = (bi[x]).begin(); it != (bi[x]).end(); ++it) if (dis[x] + 1 == dis[e[*it].y] && e[*it].z) { int t = dfs(e[*it].y, tt, min(flw, e[*it].z)); ans += t; flw -= t; e[*it].z -= t; e[(*it) ^ 1].z += t; } if (flw) dis[x] = -1; return ans; } int dinic(int s, int t) { int ans = 0; while (bfs(s, t)) { ans += dfs(s, t, 0x3f3f3f3f); } return ans; } int main() { read(_); while (_--) { read(n); read(m); for ((i) = 1; (i) <= (n); (i)++) for ((j) = 1; (j) <= (m); (j)++) read(a[id(i, j)]); init(); add(t, s, 0x3f3f3f3f); for ((i) = 1; (i) <= (n * m); (i)++) { dir[i] = res[i] = 0; } for ((i) = 1; (i) <= (n); (i)++) for ((j) = 1; (j) <= (m); (j)++) { bool f = 0; for ((k) = 0; (k) < (4); (k)++) { int x = i + dx[k], y = j + dy[k]; if (x < 1 || x > n || y < 1 || y > m) continue; if (a[id(i, j)] == a[id(x, y)] && ((i + j) & 1)) { add(id(i, j), id(x, y), 1); px[tot] = id(i, j); py[tot] = id(x, y); pdx[tot] = k; pdy[tot] = (k ^ 2); } if (a[id(i, j)] > a[id(x, y)]) { dir[id(i, j)] = k; res[id(i, j)] = a[id(i, j)] - a[id(x, y)]; f = 1; } } if ((i + j) & 1) { if (!f) { l[s]--; l[id(i, j)]++; } else add(s, id(i, j), 1); } else { if (!f) { l[id(i, j)]--; l[t]++; } else add(id(i, j), t, 1); } } int sum = 0, ctot = tot; for ((i) = 0; (i) <= (t); (i)++) { if (l[i] > 0) { add(ss, i, l[i]); sum += l[i]; } if (l[i] < 0) { add(i, tt, -l[i]); } } int ans = dinic(ss, tt); if (ans != sum) { puts( NO ); continue; } puts( YES ); for ((i) = (2); (i) <= (ctot); (i)++) if (e[i + i - 1].z) { dir[px[i]] = pdx[i]; dir[py[i]] = pdy[i]; res[px[i]] = 1; res[py[i]] = a[py[i]] - 1; } for ((i) = 1; (i) <= (n); (i)++) { for ((j) = 1; (j) <= (m); (j)++) { printf( %d%c , res[id(i, j)], (j == m ? n : )); } } for ((i) = 1; (i) <= (n); (i)++) { for ((j) = 1; (j) <= (m); (j)++) { printf( %c%c , dir[id(i, j)][ ULDR ], (j == m ? n : )); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 5; vector<pair<int, int> > opt[18 * MAX]; map<pair<int, int>, vector<pair<int, int> > > mp; int par[MAX]; int col[MAX]; int sz[MAX]; int an[MAX]; vector<int> roll_back_num; vector<pair<pair<int, pair<int, int> >, pair<int, pair<int, int> > > > roll_back; void insert(int t, int l, int r, int a, int b, int c, int d) { if (l > b || r < a) { return; } if (l >= a && r <= b) { opt[t].push_back(make_pair(c, d)); return; } int mid = (l + r) / 2; insert(t * 2, l, mid, a, b, c, d); insert(t * 2 + 1, mid + 1, r, a, b, c, d); } int not_cor; int find(int x) { while (x != par[x]) { x = par[x]; } return x; } int color(int x) { int ans = 0; while (x != par[x]) { ans ^= col[x]; x = par[x]; } return (ans ^ col[x]); } void unite(int a, int b) { int ra = find(a), rb = find(b); int ca = color(a), cb = color(b); if (ra == rb) { if (ca == cb) { not_cor++; roll_back_num.push_back(-1); } } else { if (sz[ra] > sz[rb]) { swap(a, b); swap(ra, rb); swap(ca, cb); } roll_back.push_back({{ra, {ra, sz[ra]}}, {rb, {col[ra], sz[rb]}}}); par[ra] = rb; sz[rb] += sz[ra]; if (ca == cb) { col[ra] ^= 1; } } } void solve(int t, int l, int r) { int curn = roll_back_num.size(); int cur = roll_back.size(); for (auto it : opt[t]) { unite(it.first, it.second); } if (l == r) { if (not_cor) { an[l] = 0; } else { an[l] = 1; } } else { int mid = (l + r) / 2; solve(2 * t, l, mid); solve(2 * t + 1, mid + 1, r); } while (roll_back_num.size() > curn) { not_cor += roll_back_num.back(); roll_back_num.pop_back(); } while (roll_back.size() > cur) { pair<pair<int, pair<int, int> >, pair<int, pair<int, int> > > tmp = roll_back.back(); par[tmp.first.first] = tmp.first.second.first; sz[tmp.first.first] = tmp.first.second.second; col[tmp.first.first] = tmp.second.second.first; sz[tmp.second.first] = tmp.second.second.second; roll_back.pop_back(); } } int main() { int n, q; scanf( %d %d , &n, &q); for (int i = 1; i <= q; i++) { int a, b; scanf( %d %d , &a, &b); if (a > b) { swap(a, b); } vector<pair<int, int> >& tmp = mp[make_pair(a, b)]; if (tmp.empty() || (((tmp.back()).second) != -1)) { tmp.push_back(make_pair(i, -1)); } else { (tmp.back()).second = (i - 1); } } for (auto it : mp) { for (auto it1 : it.second) { if (it1.second == -1) { it1.second = q; } insert(1, 1, q, it1.first, it1.second, it.first.first, it.first.second); } } for (int i = 1; i <= n; i++) { sz[i] = 1; par[i] = i; } solve(1, 1, q); for (int i = 1; i <= q; i++) { if (an[i] == 0) { printf( NO n ); } else { printf( YES n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxn = 100006; const int mxm = 100006 * 2; int n, m; int fe[mxn] = {}; int ne[mxm]; int ev[mxm]; bool v[mxm]; int el = 1; void add1(int L, int R) { ++el; ne[el] = fe[L]; fe[L] = el; ev[el] = R; } bool vis[mxn]; int dfs(int x) { if (vis[x]) return 0; vis[x] = true; int last = 0; for (int i = fe[x]; i; i = ne[i]) if (!v[i]) { v[i] = v[i ^ 1] = true; int t = dfs(ev[i]); if (t) { printf( %d %d %d n , x, ev[i], t); } else { if (last) { printf( %d %d %d n , last, x, ev[i]); last = 0; } else { last = ev[i]; } } } return last; } void EXEC() { cin >> n >> m; if (m % 2 == 1) { cout << No solution << endl; return; } for (int i = 0; i < m; ++i) { int L, R; scanf( %d%d , &L, &R); add1(L, R); add1(R, L); } dfs(1); } int main() { EXEC(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct people { long long a, b, id; } p[300010]; long long n, s[300010], t; bool v[300010], ans[300010]; bool cmp(people a, people b) { return a.a == b.a ? a.b > b.b : a.a > b.a; } long double check(people a, people b) { return (long double)a.a * b.a * (b.b - a.b) / (b.a - a.a) / b.b / a.b; } int main() { scanf( %lld , &n); for (int i = 1; i <= n; i++) scanf( %lld%lld , &p[i].a, &p[i].b), p[i].id = i; sort(p + 1, p + n + 1, cmp); s[1] = 1, t = 1; long long maxb = p[1].b; for (int i = 2; i <= n; i++) if (p[i].b <= maxb) v[i] = 1; else maxb = p[i].b; for (int i = 2; i <= n; i++) { if (v[i] || check(p[i], p[s[t]]) > 0) continue; while (t > 1 && check(p[i], p[s[t]]) < check(p[s[t - 1]], p[s[t]])) t--; s[++t] = i; } for (int i = 1; i <= t; i++) { ans[p[s[i]].id] = 1; for (int j = s[i] + 1; j <= n && p[s[i]].a == p[j].a && p[s[i]].b == p[j].b; j++) ans[p[j].id] = 1; } for (int i = 1; i <= n; i++) if (ans[i]) printf( %d , i); return 0; } |
#include <bits/stdc++.h> /** #include <ext/pb_ds/assoc_container.hpp> * #include <ext/pb_ds/tree_policy.hpp> * using namespace __gnu_pbds; */ using namespace std; #define ll long long #define ull unsigned long long #define f(a, b) for (ll i = a; i < b; i++) #define mod 1000000007 #define pb push_back #define vll vector<ll> #define pll vector<pair<ll, ll>> #define ld long double #define fr(a, b) for (ll j = a; j >= b; j--) #define fi(a, b) for (ll j = a; j < b; j++) #define fii(a, b) for (ll k = a; k < b; k++) /** typedef tree<ll * ,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> * ordered_set; */ template <class T> ostream &operator<<(ostream &os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; os << ] ; return os; } template <class T> ostream &operator<<(ostream &os, set<T> S) { os << { ; for (auto s : S) os << s << ; return os << } ; } template <class L, class R> ostream &operator<<(ostream &os, map<L, R> M) { os << { ; for (auto m : M) os << ( << m.first << : << m.second << ) ; return os << } ; } template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } const ll N = 200005; vll adj[N]; ll n, color[N], parent[N], cycle_end, cycle_start, ans; bool C[N]; bool dfs(ll v, ll par) { color[v] = 1; for (ll u : adj[v]) { if (u == par) continue; if (color[u] == 0) { parent[u] = v; if (dfs(u, parent[u])) return true; } else if (color[u] == 1) { cycle_end = v; cycle_start = u; return true; } } color[v] = 2; return false; } ll DFS(ll x, ll pr) { ll k = 1; f(0, adj[x].size()) { if (adj[x][i] != pr) k += DFS(adj[x][i], x); } return k; } void solve() { cycle_start = -1; for (int v = 1; v <= n; v++) { if (color[v] == 0 && dfs(v, parent[v])) break; } vector<int> cycle; C[cycle_start] = 1; cycle.push_back(cycle_start); for (int v = cycle_end; v != cycle_start; v = parent[v]) cycle.push_back(v), C[v] = 1; vll V; f(0, cycle.size()) { ll v = cycle[i]; ll tot = 0; fi(0, adj[v].size()) { if (!C[adj[v][j]]) { tot += DFS(adj[v][j], v); } } V.pb(tot); } ll l = cycle.size(); ans += l * (l - 1); f(0, V.size()) { ll k = V[i]; ans += k * (l - 1) * 2 + k; ans += k * (k - 1) / 2; } ll sum = 0; f(0, V.size()) sum += V[i]; f(0, V.size()) { sum -= V[i]; ans += V[i] * sum * 2; } } int main() { #ifndef ONLINE_JUDGE freopen( input.txt , rt , stdin); freopen( output.txt , wt , stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); ll t; cin >> t; while (t--) { cin >> n; ans = 0; f(1, n + 1) adj[i].clear(), color[i] = 0, parent[i] = -1, C[i] = false; f(0, n) { ll x, y; cin >> x >> y; adj[x].pb(y); adj[y].pb(x); } solve(); cout << ans << n ; } #ifndef ONLINE_JUDGE cout << nTime Elapsed : << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << ms n ; #endif return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n / 2 * 2 + (n + 1) / 2 << endl; for (int i = 2; i <= n; i += 2) cout << i << ; for (int i = 1; i <= n; i += 2) cout << i << ; for (int i = 2; i <= n; i += 2) cout << i << ; } |
#include <bits/stdc++.h> using namespace std; char s1[128]; int l1; char s2[128]; int l2; char virus[128]; int lv; int nxt[128][128]; vector<int> froms[128][128]; void calc_nxt() { char tmp[128]; strcpy(tmp, virus); for (int l = 0; l < lv; l++) { for (char ch = A ; ch <= Z ; ch++) { tmp[l] = ch; for (int i = l + 1; i >= 0; i--) { if (!strncmp(tmp + l + 1 - i, virus, i)) { nxt[l][(int)ch] = i; break; } } froms[nxt[l][(int)ch]][(int)ch].push_back(l); } tmp[l] = virus[l]; } } struct Path { int i, j, k; }; bool operator<(const Path &a, const Path &b) { if (a.i != b.i) return a.i < b.i; if (a.j != b.j) return a.j < b.j; if (a.k != b.k) return a.k < b.k; return false; } pair<int, Path> dp[128][128][128]; pair<int, Path> takeDP(int i, int j, int k) { pair<int, Path> t = dp[i][j][k]; t.second = {i, j, k}; return t; } string getPath(pair<int, Path> runner) { string s; while (runner.first != 0) { Path p = runner.second; auto nr = dp[p.i][p.j][p.k]; Path np = nr.second; if (np.i < p.i && np.j < p.j) { s += s1[p.i - 1]; } runner = nr; } reverse(s.begin(), s.end()); if (s == ) return 0 ; return s; } bool isSub(string s, string p) { size_t l = 0; for (auto ch : p) { cout << ch; while (l < s.size() && s[l] != ch) { l++; } if (l == s.size()) { cout << endl; return false; } l++; } cout << endl; return true; } int TestNum; int main() { scanf( %s%s%s , s1, s2, virus); l1 = strlen(s1); l2 = strlen(s2); lv = strlen(virus); calc_nxt(); for (int i = 0; i < l1; i++) { for (int k = 1; k <= lv; k++) { dp[i][0][k].first = -0x1f1f1f1f; } } for (int i = 0; i < l2; i++) { for (int k = 1; k <= lv; k++) { dp[0][i][k].first = -0x1f1f1f1f; } } dp[0][0][0].first = 0; for (int i = 0; i < l1; i++) { for (int j = 0; j < l2; j++) { for (int k = 0; k < lv; k++) { auto &to = dp[i + 1][j + 1][k]; auto from1 = takeDP(i + 1, j, k), from2 = takeDP(i, j + 1, k); to = max(from1, from2); if (s1[i] == s2[j]) { for (auto tk : froms[k][(int)s1[i]]) { auto from = takeDP(i, j, tk); from.first += 1; to = max(to, from); } } } } } auto best = dp[0][0][0]; for (int k = 0; k < lv; k++) { best = max(best, takeDP(l1, l2, k)); } string s = getPath(best); cout << s << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 3001; const int mod = 1000000007; char s[N][N]; int f[N][N]; int calc(int sr, int sc, int tr, int tc) { if (tr < sr || tc < sc) return 0; int n = tr - sr + 1, m = tc - sc + 1; f[0][0] = (s[sr][sc] != # ); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) if (i || j) { f[i][j] = 0; if (i > 0) f[i][j] += f[i - 1][j]; if (j > 0) f[i][j] += f[i][j - 1]; f[i][j] %= mod; if (s[i + sr][j + sc] == # ) f[i][j] = 0; } } return f[n - 1][m - 1]; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s , s[i]); int a, b, c, d; a = calc(0, 1, n - 2, m - 1); b = calc(1, 0, n - 1, m - 2); c = calc(0, 1, n - 1, m - 2); d = calc(1, 0, n - 2, m - 1); printf( %lld n , ((1LL * a * b - 1LL * c * d) % mod + mod) % mod); return 0; } |
#include <bits/stdc++.h> template <typename T> T inline SQR(const T &a) { return a * a; } template <typename T> T inline ABS(const T &a) { return a < 0 ? -a : a; } template <typename T> T inline MIN(const T &a, const T &b) { if (a < b) return a; return b; } template <typename T> T inline MAX(const T &a, const T &b) { if (a > b) return a; return b; } const double EPS = 1e-9; inline int sgn(double a) { return a > EPS ? 1 : (a < -EPS ? -1 : 0); } inline int cmp(double a, double b) { return sgn(a - b); } using namespace std; struct orientacao_t { char f, c; char v[4]; orientacao_t() {} orientacao_t(char frente, char costas, char vizinhos[]) : f(frente), c(costas) { for (int i = 0; i < 4; i++) v[i] = vizinhos[i]; } bool operator==(const orientacao_t &o) const { if (f == o.f && c == o.c) { if (v[0] == o.v[0] && v[1] == o.v[1] && v[2] == o.v[2] && v[3] == o.v[3]) return true; if (v[0] == o.v[1] && v[1] == o.v[2] && v[2] == o.v[3] && v[3] == o.v[0]) return true; if (v[0] == o.v[2] && v[1] == o.v[3] && v[2] == o.v[0] && v[3] == o.v[1]) return true; if (v[0] == o.v[3] && v[1] == o.v[0] && v[2] == o.v[1] && v[3] == o.v[2]) return true; } if (f == o.c && c == o.f) { if (v[2] == o.v[0] && v[1] == o.v[1] && v[0] == o.v[2] && v[3] == o.v[3]) return true; if (v[2] == o.v[1] && v[1] == o.v[2] && v[0] == o.v[3] && v[3] == o.v[0]) return true; if (v[2] == o.v[2] && v[1] == o.v[3] && v[0] == o.v[0] && v[3] == o.v[1]) return true; if (v[2] == o.v[3] && v[1] == o.v[0] && v[0] == o.v[1] && v[3] == o.v[2]) return true; } return false; } void operator=(const orientacao_t &o) { f = o.f; c = o.c; for (int i = 0; i < 4; i++) v[i] = o.v[i]; } }; struct cubo_t { orientacao_t orientacao[3]; cubo_t() {} cubo_t(char a, char b, char c, char d, char e, char f) { char v[4]; v[0] = e; v[1] = d; v[2] = c; v[3] = b; orientacao[0] = orientacao_t(a, f, v); v[0] = e; v[1] = a; v[2] = c; v[3] = f; orientacao[1] = orientacao_t(b, d, v); v[0] = d; v[1] = a; v[2] = b; v[3] = f; orientacao[2] = orientacao_t(e, c, v); } bool operator==(const cubo_t &c) const { for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (orientacao[i] == c.orientacao[j]) return true; return false; } void operator=(const cubo_t &c) { orientacao[0] = c.orientacao[0]; orientacao[1] = c.orientacao[1]; orientacao[2] = c.orientacao[2]; } }; int main(int argc, char *argv[]) { ios::sync_with_stdio(false); string s; cin >> s; sort(s.begin(), s.end()); vector<cubo_t> cubes; int eq = 0; do { cubo_t aux = cubo_t(s[0], s[1], s[2], s[3], s[4], s[5]); for (int i = 0; i < int((cubes).size()); ++i) if (aux == cubes[i]) goto hell; cubes.push_back(aux); hell: eq++; } while (next_permutation(s.begin(), s.end())); cout << int((cubes).size()) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> adj[100005]; struct Tree { vector<vector<int> > anc; vector<vector<int> > cost; vector<int> T, X; vector<int> depth; vector<bool> vis; int n; int root; Tree(int N = 1e5, int r = 1) { n = N + 5; root = r; anc = vector<vector<int> >(18, vector<int>(n, 0)); depth = vector<int>(n, 0); vis = vector<bool>(n, false); X = T = vector<int>(n, 0); init(root, -1); for (int d = 1; d < 18; d++) { for (int x = 0; x < n; x++) { anc[d][x] = anc[d - 1][anc[d - 1][x]]; } } } void init(int x, int pre) { static int t = 0; T[x] = t++; for (int i = 0; i < adj[x].size(); i++) { int y = adj[x][i]; if (y == pre) continue; anc[0][y] = x; depth[y] = depth[x] + 1; init(y, x); } X[x] = t++; } int LCA(int x, int y) { if (depth[x] < depth[y]) swap(x, y); for (int w = (1 << 17), d = 17; d >= 0; w /= 2, d--) { if (depth[x] - depth[y] >= w) { x = anc[d][x]; } } if (x == y) return x; for (int i = 17; i >= 0; i--) { if (anc[i][x] != anc[i][y]) { x = anc[i][x]; y = anc[i][y]; } } return anc[0][x]; } int up(int x, int k) { for (int w = (1 << 17), d = 17; d >= 0; w /= 2, d--) { if (k >= w) { x = anc[d][x]; k -= w; } } return x; } int dist(int x, int y) { int l = LCA(x, y); return depth[x] + depth[y] - 2 * depth[l]; } bool isparent(int x, int y) { return LCA(x, y) == x; } } A; vector<int> aux[100005]; vector<int> event(100005); vector<int> val(100005), resv; vector<bool> out(100005, false), tmp(100005, false); int n, m, sq, s; int ans = 0, lans = 0; vector<int> temp; vector<int> anc(100005, 0); int root = 1; vector<pair<int, int> > edge[100005]; vector<int> lazy(100005, 0); vector<pair<int, int> > ptr(100005, {0, 0}); void compress(int b) { for (auto x : temp) { aux[x].clear(); lazy[x] = 0; ptr[x] = {0, 0}; edge[x].clear(); anc[x] = 0; tmp[x] = false; } temp.clear(); temp.push_back(1); for (int i = b * sq; i < (b + 1) * sq && i < m; i++) { temp.push_back(abs(event[i])); } sort((temp).begin(), (temp).end(), [&](int x, int y) { return A.T[x] < A.T[y]; }); int ss = ((int)(temp).size()); for (int i = 1; i < ss; i++) { temp.push_back(A.LCA(temp[i - 1], temp[i])); } sort((temp).begin(), (temp).end(), [&](int x, int y) { return A.T[x] < A.T[y]; }); for (auto x : temp) tmp[x] = true; stack<int> st; root = 1; for (auto x : temp) { while (!st.empty() && A.X[st.top()] < A.T[x]) st.pop(); if (!st.empty() && st.top() != x) { aux[x].push_back(st.top()); aux[st.top()].push_back(x); anc[x] = st.top(); int l = A.anc[0][x]; map<int, int> cnt; while (l != st.top()) { if (!out[l]) cnt[val[l]]++; l = A.anc[0][l]; } for (auto itr : cnt) edge[x].push_back({itr.first, itr.second}); for (int i = 0; i < ((int)(edge[x]).size()); i++) { if (edge[x][i].first < 0) ptr[x] = {ptr[x].first + 1, ptr[x].second + edge[x][i].second}; else break; } } st.push(x); } } int currTree(int x, int pre) { int v = 0; if (out[x]) v--; for (auto y : adj[x]) { if (y == pre) continue; v += currTree(y, x); } val[x] += v; return v; } bool stat(int x, int pre) { bool down = false; if (tmp[x]) down = true; for (auto y : adj[x]) { if (y == pre) continue; down |= stat(y, x); } if (!down) { if (!out[x] && val[x] < 0) lans++; } return down; } void update(int x, int v) {} int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (int i = 2; i <= n; i++) { int p; cin >> p; adj[p].push_back(i); adj[i].push_back(p); } A = Tree(); for (int i = 1; i <= n; i++) cin >> val[i]; resv = val; for (int i = 0; i < m; i++) cin >> event[i]; sq = 460; s = (m - 1) / sq + 1; for (int b = 0; b < s; b++) { compress(b); lans = 0; stat(1, 0); for (int i = b * sq; i < (b + 1) * sq && i < m; i++) { if (event[i] < 0) out[-event[i]] = false; else out[event[i]] = true; int p = abs(event[i]); int v = abs(event[i]) / event[i]; while (p != 0) { lazy[p] += v; val[p] -= v; while (ptr[p].first > 0 && edge[p][ptr[p].first - 1].first >= lazy[p]) ptr[p] = {ptr[p].first - 1, ptr[p].second - edge[p][ptr[p].first - 1].second}; while (ptr[p].first < ((int)(edge[p]).size()) && edge[p][ptr[p].first].first < lazy[p]) ptr[p] = {ptr[p].first + 1, ptr[p].second + edge[p][ptr[p].first].second}; p = anc[p]; } ans = 0; int l = -1; for (auto x : temp) { if (x == l) continue; ans += ptr[x].second; if (!out[x] && val[x] < 0) ans++; l = x; } cout << lans + ans << ; } val = resv; currTree(1, 0); } cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl; } |
#include <bits/stdc++.h> using namespace std; int read() { int q = 0; char ch = ; while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) q = q * 10 + ch - 0 , ch = getchar(); return q; } const int N = 200005, inf = 0x3f3f3f3f; int n, m, Q, SZ, st_top, tim; int w[N], dfn[N], low[N], st[N]; multiset<int> S[N]; struct graph { int tot, h[N], ne[N], to[N]; void add(int x, int y) { to[++tot] = y, ne[tot] = h[x], h[x] = tot; } } G, T; void tarjan(int x, int las) { dfn[x] = low[x] = ++tim, st[++st_top] = x; for (register int i = G.h[x]; i; i = G.ne[i]) { if (G.to[i] == las) continue; int y = G.to[i]; if (!dfn[y]) { tarjan(y, x), low[x] = min(low[x], low[y]); if (low[y] == dfn[x]) { ++SZ, w[SZ] = inf, T.add(x, SZ); while (st[st_top] != y) { T.add(SZ, st[st_top]), S[SZ].insert(w[st[st_top]]); w[SZ] = min(w[SZ], w[st[st_top]]), --st_top; } T.add(SZ, y), S[SZ].insert(w[y]), w[SZ] = min(w[SZ], w[y]), --st_top; } else if (low[y] > dfn[x]) ++SZ, w[SZ] = w[y], S[SZ].insert(w[y]), T.add(x, SZ), T.add(SZ, y); } else low[x] = min(low[x], dfn[y]); } if (dfn[x] == low[x]) --st_top; } int sz[N], fa[N], top[N], pos[N], repos[N], dep[N], mi[N << 2]; void dfs1(int x) { sz[x] = 1, dep[x] = dep[fa[x]] + 1; for (register int i = T.h[x]; i; i = T.ne[i]) fa[T.to[i]] = x, dfs1(T.to[i]), sz[x] += sz[T.to[i]]; } void dfs2(int x) { int bj = 0, mx = 0; pos[x] = ++tim, repos[tim] = x; for (register int i = T.h[x]; i; i = T.ne[i]) if (sz[T.to[i]] > mx) mx = sz[T.to[i]], bj = T.to[i]; if (bj) top[bj] = top[x], dfs2(bj); for (register int i = T.h[x]; i; i = T.ne[i]) if (T.to[i] != bj) top[T.to[i]] = T.to[i], dfs2(T.to[i]); } void build(int s, int t, int i) { if (s == t) { mi[i] = w[repos[s]]; return; } int mid = (s + t) >> 1; build(s, mid, i << 1), build(mid + 1, t, (i << 1) | 1); mi[i] = min(mi[i << 1], mi[(i << 1) | 1]); } void chan(int x, int s, int t, int i, int v) { if (s == t) { mi[i] = v; return; } int mid = (s + t) >> 1; if (x <= mid) chan(x, s, mid, i << 1, v); if (mid + 1 <= x) chan(x, mid + 1, t, (i << 1) | 1, v); mi[i] = min(mi[i << 1], mi[(i << 1) | 1]); } int query(int l, int r, int s, int t, int i) { if (l <= s && t <= r) return mi[i]; int mid = (s + t) >> 1, re = inf; if (l <= mid) re = query(l, r, s, mid, i << 1); if (mid + 1 <= r) re = min(re, query(l, r, mid + 1, t, (i << 1) | 1)); return re; } int getans(int x, int y) { int re = inf; while (top[x] != top[y]) { if (dep[top[x]] < dep[top[y]]) swap(x, y); re = min(re, query(pos[top[x]], pos[x], 1, SZ, 1)); x = fa[top[x]]; } if (pos[x] > pos[y]) swap(x, y); re = min(re, query(pos[x], pos[y], 1, SZ, 1)); if (x > n) re = min(re, query(pos[fa[x]], pos[fa[x]], 1, SZ, 1)); return re; } int main() { int x, y; char ch[10]; n = read(), m = read(), Q = read(); for (register int i = 1; i <= n; ++i) w[i] = read(); for (register int i = 1; i <= m; ++i) x = read(), y = read(), G.add(x, y), G.add(y, x); SZ = n, tarjan(1, 0); dfs1(1), tim = 0, top[1] = 1, dfs2(1), build(1, SZ, 1); while (Q--) { scanf( %s , ch), x = read(), y = read(); if (ch[0] == C ) { chan(pos[x], 1, SZ, 1, y); if (x != 1) { S[fa[x]].erase(S[fa[x]].find(w[x])); S[fa[x]].insert(y); int kw = *(S[fa[x]].begin()); if (kw != w[fa[x]]) chan(pos[fa[x]], 1, SZ, 1, kw), w[fa[x]] = kw; } w[x] = y; } else printf( %d n , getans(x, y)); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { if (a > b) return b; return a; } int main() { { ios_base::sync_with_stdio(false); cin.tie(NULL); }; int q; cin >> q; while (q--) { long long a, b, c, r; cin >> a >> b >> c >> r; long long ans = 0; if (b < a) { long long temp = b; b = a; a = temp; } long long low = c - r; long long high = c + r; if (a <= low && high <= b) { ans = b - a - (high - low); } else if (low <= a && high <= b && a <= high) { ans = b - a - (high - a); } else if (b <= high && a <= low && low <= b) { ans = b - a - (b - low); } else if (low <= a && b <= high) { ans = 0; } else { ans = b - a; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; char x; int n; int main() { cin >> n; cin >> x; cout << x; cin >> x; cout << x; n -= 2; if (n % 2 == 1) { cin >> x; cout << x; n--; } for (int i = 1; i <= n; i++) { if (i % 2 == 1) cout << - ; cin >> x; cout << x; } return 0; } |
#include <bits/stdc++.h> using namespace std; std::vector<string> v(2000); vector<vector<int> > mark(2000); set<pair<int, int> > ans; int bfs(int x, int y) { int m = x, n = y; vector<pair<int, int> > q; int i = 0; while (v[x][y] != # && mark[x][y] == -2) { q.push_back(make_pair(x, y)); int Y = y, X = x; Y -= (v[x][y] == < ); Y += (v[x][y] == > ); X -= (v[x][y] == ^ ); X += (v[x][y] == v ); mark[x][y] = -1; x = X; y = Y; } if (v[x][y] == # ) { mark[x][y] = 0; int cnt = 1; for (i = q.size() - 1; i >= 0; i--) { mark[q[i].first][q[i].second] = cnt + mark[x][y]; cnt++; } } else if (mark[x][y] == -1) { for (i = 0; i < q.size(); i++) { mark[q[i].first][q[i].second] = -1; } } else { int cnt = 1; for (i = q.size() - 1; i >= 0; i--) { mark[q[i].first][q[i].second] = cnt + mark[x][y]; cnt++; } } return mark[m][n]; } void check() { while (ans.size() != 1) { vector<pair<int, int> > u; set<pair<int, int> >::iterator it; for (it = ans.begin(); it != ans.end(); it++) { int x = (*it).first; int y = (*it).second; int X = x, Y = y; Y -= (v[x][y] == < ); Y += (v[x][y] == > ); X -= (v[x][y] == ^ ); X += (v[x][y] == v ); if (v[X][Y] == # ) { return; } u.push_back(make_pair(X, Y)); } int i; ans.clear(); for (i = 0; i < u.size(); i++) { ans.insert(u[i]); } } } int main() { int n, m; cin >> n >> m; int i, j; for (i = 0; i < n; i++) { cin >> v[i]; } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { mark[i].push_back(-2); } } int maxi = -100; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (mark[i][j] == -2) { int a = bfs(i, j); if (a == -1) { cout << -1 << endl; return 0; } if (maxi < a) { ans.clear(); maxi = a; ans.insert(make_pair(i, j)); } else if (maxi == a) { ans.insert(make_pair(i, j)); } } } } mark.clear(); check(); if (ans.size() == 1) { if (v[(*(ans.begin())).first][(*(ans.begin())).second] == # ) cout << 0 << endl; else cout << 2 * maxi - 1 << endl; } else { cout << 2 * maxi << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long add(long long n) { long long mi = INT_MAX, ma = INT_MIN; while (n > 0) { mi = min(n % 10, mi); ma = max(n % 10, ma); n = n / 10; } return mi * ma; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; scanf( %d , &t); while (t--) { long long n, k; scanf( %lld%lld , &n, &k); k--; while (k--) { long long j = add(n); n = n + j; if (j == 0) { break; } } cout << n << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k, cntr = 1, s = 1; cin >> n >> m >> k; string str; cin >> str >> str; if (str == head ) cntr = -1; cin >> str; int l = str.length(); if (m < k) s = -1; for (int i = 0; i < l; i++) { if (str[i] == 0 ) { if (m != 1 && m != n) m += s; } else { if (cntr == 1) m = 1; else m = n; } k += cntr; if (k == n) cntr = -1; else if (k == 1) cntr = 1; if (m == k) { cout << Controller << i + 1 << n ; return 0; } } cout << Stowaway n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); long long sum, xr; cin >> sum >> xr; long long dp[2] = {1, 0}; for (int bit = 0; bit < 50; bit++) { long long ndp[2] = {0, 0}; int needSum = (sum >> bit) & 1; int needXor = (xr >> bit) & 1; for (int was = 0; was < 2; was++) { for (int b1 = 0; b1 < 2; b1++) { for (int b2 = 0; b2 < 2; b2++) { int mySum = (b1 + b2 + was) % 2; int myXor = b1 ^ b2; if (myXor == needXor && mySum == needSum) { ndp[(b1 + b2 + was) >> 1] += dp[was]; } } } } for (int _n(2), i(0); i < _n; i++) dp[i] = ndp[i]; } cout << (dp[0] - (sum == xr ? 2 : 0)) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void splay(long long &v) { v = 0; char c = 0; int p = 1; while (c < 0 || c > 9 ) { if (c == - ) p = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { v = (v << 3) + (v << 1) + c - 0 ; c = getchar(); } v *= p; } long long a[1000010]; long long dp[1000010], ans; int main() { long long n; splay(n); for (int i = 1; i <= n; i++) { splay(a[i]); a[i]--; } dp[1] = min(a[1], a[2]); ans += a[1]; for (int i = 2; i <= n; i++) { ans += a[i]; long long x = min(a[i], a[i - 1]); long long y = min(x, a[i + 1]), z = min(a[i], a[i + 1]); ans += dp[i - 1] * x; dp[i] = dp[i - 1] * y + z; ans %= 1000000007LL; dp[i] %= 1000000007LL; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2000010; int main() { int len, cnt; char s, d, st[maxn], word[26]; cin >> len >> cnt; cin >> st; for (int i = 0; i < 26; ++i) { word[i] = a + i; } for (int i = 1; i <= cnt; ++i) { cin >> s >> d; if (s == d) continue; for (int j = 0; j < 26; ++j) { if (word[j] == s) word[j] = d; else if (word[j] == d) word[j] = s; } } for (int i = 0; i < len; ++i) cout << word[st[i] - a ]; cout << endl; return 0; } |
#include <bits/stdc++.h> const int N = 100010; using ll = long long; int a[N]; int main() { int n, d, m; scanf( %d%d%d , &n, &d, &m); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } std::sort(a, a + n); int last = n; for (int i = 0; i < n; ++i) { if (a[i] > m) { last = i; break; } } std::sort(a, a + last, std::greater<int>()); ll ans = 0, sum = 0; for (int i = 0; i < last; ++i) { sum += a[i]; } for (int i = last - 1, j = n - 1; i >= -1; --i) { while (j >= last) { int num = i + 1 + (n - j) * (d + 1) - d; if (num > n) { break; } sum += a[j--]; } ans = std::max(ans, sum); if (i >= 0) { sum -= a[i]; } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, arr[100]; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 0; i < n - 1; i++) { for (int j = i; j < n; j++) { if (arr[i] > arr[j]) { int swap = arr[j]; arr[j] = arr[i]; arr[i] = swap; } } } for (int i = 0; i < n; i++) { cout << arr[i] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { string s; cin >> s; if (s.length() > 10) cout << s[0] << (s.length() - 2) << s[s.length() - 1] << endl; else cout << s << endl; } } |
#include <bits/stdc++.h> const int MAX_N = 1000000; const int MOD = 1000000007; std::vector<int> groups; int table[1 + MAX_N], dp[1 + MAX_N]; std::deque<int> tablePositions; int main() { std::string s; std::cin >> s; groups.push_back(0); int cnt = 0; for (int i = 0; i < s.size(); ++i) if (s[i] == 0 ) ++cnt; else { groups.push_back(cnt); cnt = 0; } groups.push_back(cnt); dp[1] = groups[1] + 1; for (int i = 2; i < groups.size(); ++i) { if (i < groups.size() - 1) dp[i] = dp[i - 1]; for (int lastDigit = 0; lastDigit <= groups[i]; ++lastDigit) { dp[i] = (dp[i] + dp[i - 1]) % MOD; while (!tablePositions.empty() && tablePositions.front() < lastDigit) tablePositions.pop_front(); if (i < groups.size() - 1 && !tablePositions.empty()) dp[i] = (dp[i] + MOD - table[tablePositions.front()]) % MOD; } tablePositions.push_front(groups[i]); table[groups[i]] = dp[i - 1]; } if (groups.size() == 2) dp[groups.size() - 1]--; printf( %d , dp[groups.size() - 1]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 200200; vector<int> adj[MAX]; int ch[MAX], sz, from[MAX], dpthMx[MAX], dpthMn[MAX], n; void dfs(int cur, int par) { for (auto i : adj[cur]) if (i != par) { dfs(i, cur); dpthMn[cur] = min(dpthMn[cur], dpthMn[i] + 1); dpthMx[cur] = max(dpthMx[cur], dpthMx[i] + 1); } if (dpthMn[cur] == MAX) dpthMn[cur] = 0; } pair<int, int> dfs0(int cur, int par, int d) { from[cur] = par; pair<int, int> ret(d, cur); for (auto i : adj[cur]) if (i != par) ret = max(ret, dfs0(i, cur, d + 1)); return ret; } int main() { scanf( %d , &n); fill(dpthMn, dpthMn + n + 1, MAX); for (int i = 1, u, v; i < n; ++i) { scanf( %d%d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } pair<int, int> diam = dfs0(dfs0(1, 0, 0).second, 0, 0); while (diam.first > 0) diam.first -= 2, diam.second = from[diam.second]; dfs(diam.second, 0); for (auto i : adj[diam.second]) { if (dpthMx[i] != dpthMn[i]) return puts( -1 ), 0; ch[sz++] = dpthMx[i] + 1; } sort(ch, ch + sz); sz = unique(ch, ch + sz) - ch; if (sz > 2) return puts( -1 ), 0; ch[sz] = 0; int ans = ch[0] + ch[1]; while (!(ans & 1)) ans >>= 1; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 100005; template <typename T> void readv(vector<T>& v, int n) { for (int i = 0; i < n; ++i) { T tmp; cin >> tmp; v.push_back(tmp); } } struct cmp { bool operator()(const pair<int, int>& i1, const pair<int, int>& i2) const { int sign = (i1.second - i1.first) - (i2.second - i2.first); if (sign != 0) return sign > 0; return i1.first > i2.first; } }; set<pair<int, int>, cmp> intervals; map<int, pair<int, int> > ileft, iright; void insert_intvl(const pair<int, int>& intvl) { intervals.insert(intvl); ileft[intvl.second + 1] = intvl; iright[intvl.first - 1] = intvl; } void erase_intvl(const pair<int, int>& intvl) { intervals.erase(intvl); ileft.erase(intvl.second + 1); iright.erase(intvl.first - 1); } map<int, int> points; class node { public: node() : left(0), right(0), size(0) {} node *left, *right; int size; }; node root; void add_node(node* nd, int x, int shift) { nd->size++; if (shift < 0) { return; } if ((x & (1 << shift)) == 0) { if (!nd->left) { nd->left = new node; } add_node(nd->left, x, shift - 1); } else { if (!nd->right) { nd->right = new node; } add_node(nd->right, x, shift - 1); } } void remove_node(node* nd, int x, int shift) { nd->size -= 1; if (shift < 0) return; if ((x & (1 << shift)) == 0) { remove_node(nd->left, x, shift - 1); } else { remove_node(nd->right, x, shift - 1); } } int query_tree(node* nd, int b, int e, int l, int r, int shift) { if ((e < l) || (b > r)) { return 0; } if ((b >= l) && (e <= r)) { return nd->size; } int mid = (b + e) / 2; int s1 = nd->left ? query_tree(nd->left, b, mid, l, r, shift - 1) : 0; int s2 = nd->right ? query_tree(nd->right, mid + 1, e, l, r, shift - 1) : 0; return s1 + s2; } const int BITS = 30; void add_emp(int e, int p) { add_node(&root, p, BITS - 1); points[e] = p; } void remove_emp(int e) { remove_node(&root, points[e], BITS - 1); points.erase(e); } int query(int l, int r) { return query_tree(&root, 0, (1 << BITS) - 1, l, r, BITS); } int main(int argc, char** argv) { int n, q; cin >> n >> q; intervals.insert(make_pair(1, n)); for (int i = 0; i < q; ++i) { int e; cin >> e; if (e == 0) { int l, r; cin >> l >> r; cout << query(l, r) << endl; } else { if (points.count(e) == 0) { pair<int, int> longest = *intervals.begin(); erase_intvl(longest); int mid = (longest.first + longest.second + 1) / 2; if (longest.first <= (mid - 1)) { insert_intvl(make_pair(longest.first, mid - 1)); } if ((mid + 1) <= longest.second) { insert_intvl(make_pair(mid + 1, longest.second)); } add_emp(e, mid); } else { int pe = points[e]; pair<int, int> intvl = make_pair(pe, pe); if (ileft.count(pe) == 1) { intvl.first = ileft[pe].first; erase_intvl(ileft[pe]); } if (iright.count(pe) == 1) { intvl.second = iright[pe].second; erase_intvl(iright[pe]); } insert_intvl(intvl); remove_emp(e); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; void file_io() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } void PLAY() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); } int main() { PLAY(); int n; cin >> n; int x[1000000] = {0}; for (int i = 0; i < n - 1; i++) { int l, r; cin >> l >> r; x[l]++; x[r]++; } for (int i = 1; i <= n; i++) { if (x[i] == 2) return cout << NO , 0; } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; long long n; int licznik; long long sym(long long k) { long long eat = k, m = n - k; while (m > 0) { licznik++; m -= m / 10; eat += min(k, m); m -= k; } return eat; } long long binsuche(long long lewy, long long prawy) { if (lewy < prawy) { if (sym((lewy + prawy) / 2) * 2 >= n) return binsuche(lewy, (lewy + prawy) / 2); else return binsuche((lewy + prawy) / 2 + 1, prawy); } return lewy; } int main() { licznik = 0; int a, b; cin >> n; cout << binsuche(1, n); } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10, INF = 1e9; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -f; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } return x * f; } int n, l[N], r[N], a[N], b[N], c[N]; int ans, sum, pos, cnt, tot; int t1, t2; signed main() { n = read(); for (int i = 1; i <= n; i++) { l[i] = read(); r[i] = read(); a[++cnt] = l[i]; a[++cnt] = r[i]; } sort(a + 1, a + cnt + 1); for (int i = 1; i <= cnt; i++) if (i == 1 || a[i] != a[i - 1]) a[++tot] = a[i]; for (int i = 1; i <= n; i++) { t1 = lower_bound(a + 1, a + tot + 1, l[i]) - a; t2 = lower_bound(a + 1, a + tot + 1, r[i]) - a; c[t1] = l[i], c[t2] = r[i]; b[t1]++, b[t2]--; } for (int i = 1; i <= tot; i++) { sum += b[i]; if (sum > ans) ans = sum, pos = c[i]; } printf( %d %d , pos, ans); return 0; } |
#include <bits/stdc++.h> using namespace std; double a, b, c; int main() { while (~scanf( %lf%lf%lf , &a, &b, &c)) { double x1 = (-b + sqrt(b * b - 4 * a * c)) / (2 * a), x2 = (-b - sqrt(b * b - 4 * a * c)) / (2 * a); if (a < 0) swap(x1, x2); printf( %.6lf n%.6lf n , x1, x2); } return 0; ; } |
#include <bits/stdc++.h> using namespace std; void _fill_int(int* p, int val, int rep) { int i; for (i = 0; i < rep; i++) p[i] = val; } signed long long GETi() { signed long long i; scanf( %lld , &i); return i; } int N, X, Y; int mat[501][501]; int vis[501][501]; int LM[501], RM[501], TM[501], BM[501]; char str[3000002]; char* P; void dfs(int cy, int cx, int pre, bool on) { char move[16] = *LR*U***D ; int i; if (on && (mat[cy][cx] & 1) == 0) *P++ = 1 ; if ((vis[cy][cx] & 1) && (pre != 1)) *P++ = L , dfs(cy, cx - 1, 2, on); if ((vis[cy][cx] & 2) && (pre != 2)) *P++ = R , dfs(cy, cx + 1, 1, on); if ((vis[cy][cx] & 4) && (pre != 4)) *P++ = U , dfs(cy - 1, cx, 8, on); if ((vis[cy][cx] & 8) && (pre != 8)) *P++ = D , dfs(cy + 1, cx, 4, on); if (!on) *P++ = 2 ; if (pre != 0) *P++ = move[pre]; } void solve() { int f, i, j, k, l, x, y; cin >> N >> Y >> X; X--; Y--; for (y = 0; y < N; y++) for (x = 0; x < N; x++) cin >> mat[y][x]; for (y = 0; y < N; y++) LM[y] = TM[y] = N, RM[y] = BM[y] = -1; l = 0; mat[Y][X] |= 2; for (y = 0; y < N; y++) for (x = 0; x < N; x++) if (mat[y][x]) { l++; if (LM[y] > x) LM[y] = x; RM[y] = x; if (TM[x] > y) TM[x] = y; BM[x] = y; } if (l == 1 && (mat[Y][X] & 1)) return (void)printf( YES n2 n ); P = str; stack<int> Q; Q.push(Y * 1000 + X); while (!Q.empty()) { int k = Q.top(); Q.pop(); int cx = k % 1000, cy = k / 1000; TM[cx] = min(TM[cx], cy); BM[cx] = max(BM[cx], cy); LM[cy] = min(LM[cy], cx); RM[cy] = max(RM[cy], cx); for (i = 0; i < 4; i++) { int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}; int tx = cx + dx[i], ty = cy + dy[i]; if (tx < 0 || ty < 0 || tx >= N || ty >= N) continue; if (dy[i] > 0 && BM[cx] < ty) continue; if (dy[i] < 0 && TM[cx] > ty) continue; if (dx[i] > 0 && RM[cy] < tx) continue; if (dx[i] < 0 && LM[cy] > tx) continue; if (mat[ty][tx] & 2) continue; mat[ty][tx] |= 2; if (dx[i] < 0) vis[cy][cx] |= 1, vis[ty][tx] |= 2; if (dx[i] > 0) vis[cy][cx] |= 2, vis[ty][tx] |= 1; if (dy[i] < 0) vis[cy][cx] |= 4, vis[ty][tx] |= 8; if (dy[i] > 0) vis[cy][cx] |= 8, vis[ty][tx] |= 4; Q.push(ty * 1000 + tx); } } for (y = 0; y < N; y++) for (x = 0; x < N; x++) if (mat[y][x] == 1) return (void)printf( NO n ); dfs(Y, X, 0, true); dfs(Y, X, 0, false); (void)printf( YES n%s n , str); } int main(int argc, char** argv) { if (argc > 1) freopen(argv[1], r , stdin); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long mod = 998244353; const long long maxn = 5e4 + 10, maxval = 1e9 + 10, mlg = (1 << 18) + 10; struct edge { long long u, v, c, t; } ed[maxn * 6]; long long n, m, cnt; long long ans[maxn * 6], comp[maxn * 6], mark1[6 * maxn], mark2[6 * maxn]; vector<long long> ts, nei[maxn * 6][2], adj[maxn * 6]; map<long long, long long> mp; long long N(long long x) { if (x <= m) { return x + m; } else if (x <= 2 * m) { return x - m; } else if (x <= 4 * m) { return x + 2 * m; } else { return x - 2 * m; } } void add_con(long long x, long long y) { long long nagh_x = N(x); long long nagh_y = N(y); nei[nagh_x][1].push_back(y); nei[y][0].push_back(nagh_x); nei[nagh_y][1].push_back(x); nei[x][0].push_back(nagh_y); } void dfs1(long long u) { mark1[u] = 1; for (auto v : nei[u][1]) { if (!mark1[v]) { dfs1(v); } } ts.push_back(u); } void dfs2(long long u) { mark2[u] = 1; comp[u] = cnt; for (auto v : nei[u][0]) { if (!mark2[v]) { dfs2(v); } } } bool ch(long long x) { long long tmp_cnt = 0; cnt = 0; for (int i = 0; i <= 6 * m; i++) { nei[i][1].clear(); nei[i][0].clear(); comp[i] = 0; mark1[i] = 0; mark2[i] = 0; ans[i] = 0; } for (int i = 0; i < m; i++) { if (ed[i + 1].t > x) { nei[i + 1][1].push_back(i + 1 + m); nei[i + 1 + m][0].push_back(i + 1); } } for (int i = 1; i <= n; i++) { mp.clear(); for (int j = 0; j < adj[i].size(); j++) { tmp_cnt++; if (j > 0) { add_con(N(2 * m + tmp_cnt - 1), N(adj[i][j])); add_con(N(2 * m + tmp_cnt - 1), 2 * m + tmp_cnt); add_con(N(adj[i][j]), 2 * m + tmp_cnt); } else { add_con(N(adj[i][j]), 2 * m + tmp_cnt); } if (!mp[ed[adj[i][j]].c]) { mp[ed[adj[i][j]].c] = adj[i][j]; } else if (mp[ed[adj[i][j]].c] == -1) { return false; } else { add_con(adj[i][j], mp[ed[adj[i][j]].c]); mp[ed[adj[i][j]].c] = -1; } } } for (int i = 1; i <= 6 * m; i++) { if (!mark1[i]) { dfs1(i); } } while (!ts.empty()) { long long v = ts.back(); ts.pop_back(); if (!mark2[v]) { cnt++; dfs2(v); } } for (int i = 1; i <= m; i++) { if (comp[i] == comp[i + m]) { return false; } if (comp[i] > comp[i + m]) { ans[i] = 1; } else { ans[i] = 0; } } for (int i = 2 * m + 1; i <= 4 * m; i++) { if (comp[i] == comp[i + 2 * m]) { return false; } } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> ed[i + 1].u >> ed[i + 1].v >> ed[i + 1].c >> ed[i + 1].t; adj[ed[i + 1].u].push_back(i + 1); adj[ed[i + 1].v].push_back(i + 1); } long long l = -1, r = inf; while (r - l > 1) { long long mid = (l + r) / 2; if (ch(mid)) { r = mid; } else { l = mid; } } if (r == inf) { cout << No << endl; return 0; } cout << Yes << endl; ch(r); long long tmp = 0; for (int i = 0; i < m; i++) { if (ans[i + 1]) { tmp++; } } cout << r << << tmp << endl; for (int i = 0; i < m; i++) { if (ans[i + 1]) { cout << i + 1 << ; } } cout << endl; } |
#include <bits/stdc++.h> #pragma optimization_level 3 #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int main() { cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); cout.sync_with_stdio(0); ; long long z; cin >> z; for (; z--;) { long long a; cin >> a; vector<string> m(a); int can[a]; set<string> s; for (int q = 0; q < a; q++) { cin >> m[q]; s.insert(m[q]); } for (int q = 0; q < a; q++) { reverse(m[q].begin(), m[q].end()); can[q] = !s.count(m[q]); reverse(m[q].begin(), m[q].end()); } long long fl = 1; vector<long long> n, t(4), msk(a); int i = 0; for (string &u : m) { int mask = (u[0] == 1 ) * 2 + (u.back() == 1 ) * 1; t[mask]++; msk[i++] = mask; } if (!(t[1] + t[2])) fl = t[0] == a || t[3] == a; else { long long ABS = abs(t[1] - t[2]), nd = t[2] > t[1] ? 2 : 1; for (int q = 0; q < a && ABS > 1; q++) { if (msk[q] != nd || !can[q]) continue; ABS -= 2; n.push_back(q + 1); } fl = ABS < 2; } if (!fl) cout << -1 n ; else { cout << n.size() << n ; for (long long i : n) cout << i << ; cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; ; vector<pair<int, int>> vec; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k, a, b, c; c = 1; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a >> b; vec.push_back(make_pair(a * -1, b)); } sort(vec.begin(), vec.end()); for (int i = 0; i < n; i++) { if (i == k - 1) { while (vec[i] == vec[i + 1]) { i++; c++; } cout << c << n ; break; } if (vec[i] == vec[i + 1]) c++; else c = 1; } cout.flush(); } |
#include <bits/stdc++.h> using namespace std; struct node { int x, y, id; bool operator<(const node &A) const { return x < A.x; } }; vector<node> line[2][100005 << 2]; bool mark[2][100005 << 2]; int n, m, k; long long t[100005]; void add(int x, int y, int i) { node a; a.x = x, a.y = y, a.id = i; line[1][y - x + 200000].push_back(a); line[0][x + y + 200000].push_back(a); } void solve() { bool flag = 0, first = 0; long long res = 0; int k = 1; int x = 0, y = 0; while (!flag) { if (x == 0 || y == 0 || x == n || y == m) { if (first) { if ((x == 0 || x == n) && (y == 0 || y == m)) { flag = 1; break; } k = -k; } else first = 1; } int cur = (k == 1); if (line[cur][y - k * x + 200000].size()) { if (mark[cur][y - k * x + 200000]) flag = 1; else { mark[cur][y - k * x + 200000] = 1; if (k == 1 && (!x || !y) || k == -1 && ((!x && y) || (y == m && x))) { for (int i = 0; i < line[cur][y - k * x + 200000].size(); i++) { int j = line[cur][y - k * x + 200000][i].id; node tmp = line[cur][y - k * x + 200000][i]; if (t[j]) { } else t[j] = res + abs(line[cur][y - k * x + 200000][i].x - x); } } else { for (int i = line[cur][y - k * x + 200000].size() - 1; i >= 0; i--) { int j = line[cur][y - k * x + 200000][i].id; node tmp = line[cur][y - k * x + 200000][i]; if (t[j]) { } else t[j] = res + abs(line[cur][y - k * x + 200000][i].x - x); } } } } int nx1, ny1, nx2, ny2, t1 = x, t2 = y; if (k == 1) { if (0 <= n + y - x && n + y - x <= m) nx1 = n, ny1 = n + y - x; else ny1 = m, nx1 = m + x - y; if (0 <= y - x && y - x <= m) nx2 = 0, ny2 = y - x; else ny2 = 0, nx2 = x - y; if (nx1 == x) { x = nx2, y = ny2; } else x = nx1, y = ny1; } else { if (0 <= x + y && x + y <= m) nx1 = 0, ny1 = x + y; else ny1 = m, nx1 = x + y - m; if (0 <= x + y - n && x + y - n <= m) nx2 = n, ny2 = x + y - n; else ny2 = 0, nx2 = x + y; if (nx1 == x) { x = nx2, y = ny2; } else x = nx1, y = ny1; } res += abs(x - t1); } } inline void print(long long x) { if (!x) return; print(x / 10); putchar(x % 10 ^ 48); } inline void pf(long long x) { print(x); if (!x) puts( 0 ); else puts( ); } inline void rd(int &res) { res = 0; char c; while (c = getchar(), c < 0 || c > 9 ) ; do { res = (res << 3) + (res << 1) + (c ^ 48); } while (c = getchar(), 0 <= c && c <= 9 ); } int main() { rd(n); rd(m); rd(k); for (int i = 1; i <= k; i++) { int a, b; rd(a); rd(b); add(a, b, i); } for (int i = 0; i < 2; i++) for (int j = 0; j < 2 * 100005; j++) { if (line[i][j].size()) { sort(line[i][j].begin(), line[i][j].end()); } } solve(); for (int i = 1; i <= k; i++) { if (t[i]) pf(t[i]); else puts( -1 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, ctr = 0, j; int arr[1000]; cin >> n; for (i = 0; i < n; i++) cin >> arr[i]; for (i = 0; i < n; i++) if (arr[i] == 1) break; if (i == n) { cout << 0; return 0; } for (j = n - 1; j >= 0; j--) if (arr[j] == 1) break; if (i == j) { cout << 1; return 0; } ctr = 1; for (int k = i + 1; k <= j; k++) { if (arr[k] == 1) ctr++; else if (arr[k] == 0 && arr[k - 1] == 1 && arr[k + 1] == 1) ctr++; } cout << ctr; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) const double eps = 1e-7; struct node { long long first; node() {} node(long long first) : first(first) {} bool operator<(const node& a) const { return first < a.first; } }; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; const long long N = 6010; long long mod = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; long long tmp = 0; long long ans = 0; priority_queue<node> q; for (int i = 1; i <= n * k; i++) { cin >> tmp; node tt(tmp); q.push(tt); } int cnt = 0; if (n & 1) { for (int i = 1; i <= k; i++) { for (int j = 1; j <= (n + 1) / 2; j++) { if (j == (n + 1) / 2) { ans += q.top().first; cnt++; } q.pop(); } } } else { for (int i = 1; i <= k; i++) { for (int j = 1; j <= n / 2 + 1; j++) { if (j == n / 2 + 1) { ans += q.top().first; cnt++; } q.pop(); } } } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; int d[] = {25, 18, 15, 12, 10, 8, 6, 4, 2, 1}; int t, n, k; struct edge { string name; int s, win[50]; } a[100]; bool cmp1(edge x, edge y) { if (x.s != y.s) { return x.s > y.s; } for (int i = 0; i < 50; i++) { if (x.win[i] != y.win[i]) { return x.win[i] > y.win[i]; } } return false; } bool cmp2(edge x, edge y) { if (x.win[0] != y.win[0]) { return x.win[0] > y.win[0]; } else { return cmp1(x, y); } } int main() { cin >> t; while (t--) { cin >> n; string name; for (int i = 0; i < n; i++) { cin >> name; bool flag = false; for (int j = 0; j < k; j++) { if (a[j].name == name) { if (i < 10) { a[j].s += d[i]; } a[j].win[i]++; flag = true; break; } } if (flag == false) { a[k].name = name; if (i < 10) { a[k].s = d[i]; } a[k].win[i]++; k++; } } } sort(a, a + k, cmp1); cout << a[0].name << endl; sort(a, a + k, cmp2); cout << a[0].name; return 0; } |
#include <bits/stdc++.h> using namespace std; char ch[200][200]; int rp[200], cp[200]; int main() { int n; while (cin >> n) { memset(rp, 0, sizeof(rp)); memset(cp, 0, sizeof(cp)); for (int i = 1; i <= n; i++) { scanf( %s , ch[i] + 1); for (int j = 1; j <= n; j++) if (ch[i][j] == . ) rp[i] = 1; } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (ch[j][i] == . ) cp[i] = 1; bool rok, cok; rok = cok = 0; int k; for (k = 1; k <= n; k++) if (rp[k] == 0) break; if (k > n) rok = 1; for (k = 1; k <= n; k++) if (cp[k] == 0) break; if (k > n) cok = 1; if (rok == 0 && cok == 0) { puts( -1 ); continue; } if (rok) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (ch[i][j] == . ) { cout << i << << j << endl; break; } } } else { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (ch[j][i] == . ) { cout << j << << i << endl; break; } } } } return 0; } |
#include <bits/stdc++.h> long n, m, x, y, i, a[1000], z; double aa, bb, sum; int main() { scanf( %ld%ld , &n, &m); for (i = 1; i <= n; i++) scanf( %ld , &a[i]); sum = 0; for (i = 1; i <= m; i++) { scanf( %ld%ld%ld , &x, &y, &z); aa = a[x] + a[y]; bb = z; if (aa / bb > sum) { sum = aa / bb; } } printf( %0.15lf , sum); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tests; cin >> tests; for (int test = 0; test < tests; ++test) { int n; cin >> n; vector<ll> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; ll x, y; int fx, fy; cin >> x >> fx >> y >> fy; ll req; cin >> req; int lo = 1, hi = n + 1; for (int i = 0; i < n; ++i) a[i] /= 100; sort(a.begin(), a.end()); reverse(a.begin(), a.end()); while (lo < hi) { int mid = (lo + hi) / 2; vector<ll> c(mid); for (int i = 0; i < mid; ++i) { if (i % fx == fx - 1) c[i] += x; if (i % fy == fy - 1) c[i] += y; } sort(c.begin(), c.end()); reverse(c.begin(), c.end()); ll sum = 0; for (int i = 0; i < mid; ++i) sum += a[i] * c[i]; if (sum >= req) hi = mid; else lo = mid + 1; } if (lo == n + 1) lo = -1; cout << lo << n ; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 100; vector<int> adj[MAXN], *vec[MAXN]; int col[MAXN], pw[MAXN], goni[MAXN], sz[MAXN]; long long sum[MAXN]; void getsz(int v = 1, int pre = -1) { sz[v] = 1; for (auto u : adj[v]) { if (u != pre) { getsz(u, v); sz[v] += sz[u]; } } } void dfs(int v, int pre, bool type) { int idx = -1; int bigchild = -1; for (auto i : adj[v]) if (sz[i] > idx && i != pre) idx = sz[i], bigchild = i; for (auto i : adj[v]) if (i != bigchild && i != pre) dfs(i, v, 0); if (bigchild != -1) { dfs(bigchild, v, 1); vec[v] = vec[bigchild]; sum[v] = sum[bigchild]; pw[v] = pw[bigchild]; } else vec[v] = new vector<int>(); vec[v]->push_back(v); goni[col[v]]++; if (goni[col[v]] == pw[v]) sum[v] += col[v]; else if (goni[col[v]] > pw[v]) { sum[v] = col[v]; pw[v] = goni[col[v]]; } for (auto i : adj[v]) if (i != bigchild && i != pre) for (auto j : *vec[i]) { goni[col[j]]++; vec[v]->push_back(j); if (goni[col[j]] == pw[v]) sum[v] += col[j]; else if (goni[col[j]] > pw[v]) { sum[v] = col[j]; pw[v] = goni[col[j]]; } } if (!type) for (auto u : *vec[v]) goni[col[u]]--; } int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> col[i]; for (int i = 0; i < n - 1; ++i) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } getsz(); dfs(1, -1, 0); for (int i = 1; i <= n; ++i) cout << sum[i] << ; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, k, tmp; vector<long long> ans; vector<int> vec; cin >> t; while (t--) { cin >> n >> k; for (int i = 0; i < n * k; i++) { cin >> tmp; vec.push_back(tmp); } int med; if (n % 2 == 0) med = n / 2; else med = n / 2 + 1; long long medSum = 0; int pos = vec.size() - (n - med) - 1; for (int i = 0; i < k; i++) { medSum += (long long)vec[pos]; pos -= (n - med + 1); } ans.push_back(medSum); vec.clear(); } for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl; } |
#include <bits/stdc++.h> using namespace std; int t, n, k; void solve() { scanf( %d%d , &n, &k); if (n < k) { printf( NO n ); return; } if ((n - (k - 1)) % 2 == 1) { printf( YES n ); for (int i = 1; i <= k - 1; ++i) printf( 1 ); printf( %d n , n - (k - 1)); } else if ((n - (k - 1) * 2) > 0 && (n - (k - 1) * 2) % 2 == 0) { printf( YES n ); for (int i = 1; i <= k - 1; ++i) printf( 2 ); printf( %d n , n - (k - 1) * 2); } else printf( NO n ); } int main() { scanf( %d , &t); while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, Q; const int md = 998244353; const int maxn = 200010; int t[4 * maxn], tmul[4 * maxn], tadd[4 * maxn]; inline int mod(long long x) { return (x % md + md) % md; } void build(int v, int vl, int vr) { tmul[v] = 1, tadd[v] = 0; if (vl == vr) return; int vm = (vl + vr) >> 1; build(2 * v, vl, vm); build(2 * v + 1, vm + 1, vr); } void push(int v, int vl, int vr) { t[v] = mod(mod(1ll * tmul[v] * t[v]) + mod(1ll * tadd[v] * (vr - vl + 1))); if (vl != vr) { tmul[2 * v] = mod(1ll * tmul[2 * v] * tmul[v]); tmul[2 * v + 1] = mod(1ll * tmul[2 * v + 1] * tmul[v]); tadd[2 * v] = mod(1ll * tadd[2 * v] * tmul[v] + tadd[v]); tadd[2 * v + 1] = mod(1ll * tadd[2 * v + 1] * tmul[v] + tadd[v]); } tmul[v] = 1; tadd[v] = 0; } void update(int v, int vl, int vr, int l, int r, int m, int a) { push(v, vl, vr); if (l > vr || r < vl) return; if (l <= vl && vr <= r) { tmul[v] = m; tadd[v] = a; push(v, vl, vr); return; } int vm = (vl + vr) >> 1; update(2 * v, vl, vm, l, r, m, a); update(2 * v + 1, vm + 1, vr, l, r, m, a); t[v] = (t[2 * v] + t[2 * v + 1]) % md; } int getsum(int v, int vl, int vr, int l, int r) { push(v, vl, vr); if (l > vr || r < vl) return 0; if (l <= vl && vr <= r) return t[v]; int vm = (vl + vr) >> 1; return mod(getsum(2 * v, vl, vm, l, r) + getsum(2 * v + 1, vm + 1, vr, l, r)); } set<pair<int, int>> q[maxn]; int main() { ios_base::sync_with_stdio(false); cin >> n >> Q; build(1, 0, n - 1); for (int i = 0; i < Q; i++) { int t, l, r; cin >> t >> l >> r; --l, --r; if (t == 1) { int x; cin >> x; auto itl = q[x].lower_bound({l + 1, 0}); if (itl != q[x].begin()) { --itl; if (itl->second >= l) { int ll = itl->first, rr = itl->second; q[x].erase(itl); if (ll <= l - 1) q[x].insert({ll, l - 1}); q[x].insert({l, rr}); } } auto itr = q[x].lower_bound({r + 1, 0}); if (itr != q[x].begin()) { --itr; if (itr->second >= r) { int ll = itr->first, rr = itr->second; q[x].erase(itr); if (r + 1 <= rr) q[x].insert({r + 1, rr}); q[x].insert({ll, r}); } } int prev = l; while (true) { auto it = q[x].lower_bound({l, 0}); if (it == q[x].end() || it->first > r) break; int ll = it->first, rr = it->second; q[x].erase(it); if (prev <= ll - 1) update(1, 0, n - 1, prev, ll - 1, 1, 1); update(1, 0, n - 1, ll, rr, 2, 0); prev = rr + 1; } if (prev <= r) update(1, 0, n - 1, prev, r, 1, 1); q[x].insert({l, r}); } else { cout << getsum(1, 0, n - 1, l, r) << n ; } } } |
#include <bits/stdc++.h> using namespace std; long long int M = 1e9 + 7; int sum_digit(int x) { int sum = 0; while (x > 0) { sum += x % 10; x /= 10; } return sum; } int reverse_num(int n) { int tmp = n, ans = 0, r; while (tmp > 0) { r = tmp % 10; ans = ans * 10 + r; tmp /= 10; } return ans; } long long int factorial(long long int n) { long long int i, ans = 1; for (i = n; i > 1; i--) { ans *= i; } return ans; } long long int gcd(long long int num1, long long int num2) { long long int a, b, r; a = num1; b = num2; r = a % b; while (r > 0) { a = b; b = r; r = a % b; } return b; } long long int lcm(long long int num1, long long int num2) { return (num1 * num2) / gcd(num1, num2); } bool prime(long long int n) { if (n < 2) return false; for (long long int i = 2; i <= sqrt(n); i++) { if (n % i == 0) return false; } return true; } bool vowel(char ch) { ch = tolower(ch); if (ch == a || ch == e || ch == i || ch == o || ch == u ) return true; return false; } void solve() { double d, h, v, e; cin >> d >> h >> v >> e; double r = d / 2; double v_in = 2 * acos(0) * r * r * h; double L = 0, R = 1e4 + 10; double ans = 0; while (L < R) { double t = L + (R - L) / 2; double dif = (v_in + 2 * acos(0) * r * r * e * t) - v * t; if (abs(dif) < 1e-4) { ans = t; break; } if (dif < 0) R = t; else L = t; } if (ans != 0) { cout << YES n ; cout << setprecision(12) << fixed << ans << endl; } else cout << NO n ; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> adjlist[1000050], ans; bool done[1000050], use[1000050]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; adjlist[a].push_back(b); } for (int i = 1; i <= n; i++) { if (!done[i]) { use[i] = true; for (auto j : adjlist[i]) done[j] = true; } } memset(done, false, sizeof done); for (int i = n; i >= 1; i--) { if (use[i] and !done[i]) { ans.push_back(i); done[i] = true; for (auto j : adjlist[i]) done[j] = true; } } cout << ans.size() << n ; for (auto i : ans) cout << i << ; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, inf = 1e17, N = 1e6 + 10; bool vowel(char che) { if (che == A || che == E || che == I || che == O || che == U || che == Y ) { return true; } else { return false; } } long long pw(long long a, long long b) { long long ans = 1; while (b) { if (b % 2 == 1) { ans = 1ll * ans * a; ans %= mod; } b /= 2; a = 1ll * a * a % mod; a %= mod; } return ans % mod; } bool mark[N], ok[N], h; char o; pair<long long, long long> p; vector<long long> vt[N], vec, jav, vs; string s, s1; int64_t a[N], b[N], c[N], d, dp, t, n, m, k, f, ans1, sum, ps; int64_t fuc[N]; int64_t ans; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; a[i] %= mod; } fuc[0] = 1; for (int i = 1; i <= n; i++) { fuc[i] = 1ll * fuc[i - 1] * i; fuc[i] %= mod; } sort(a, a + n); f = 1; a[n] = -25; ans = 0; for (int i = 1; i <= n; i++) { if (a[i] == a[i - 1]) f++; else { if (i != n) { f %= mod; k = fuc[n] * pw((n - i + f), mod - 2); k %= mod; k *= f; k %= mod; ans += 1ll * k * a[i - 1]; } ans %= mod; f = 1; } } cout << (ans + mod) % mod << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long N, M; cin >> N >> M; set<long long> x_t; set<long long> y_t; vector<long long> ans; for (long long i = 0; i < M; i++) { long long x, y; cin >> x >> y; if (x_t.find(x) == x_t.end()) x_t.insert(x); if (y_t.find(y) == y_t.end()) y_t.insert(y); long long tam_x = x_t.size(); long long tam_y = y_t.size(); ans.push_back(N * N - (tam_x + tam_y) * N + (tam_x * tam_y)); } for (long long i = 0; i < ans.size() - 1; i++) cout << ans[i] << ; cout << ans[ans.size() - 1] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, l, a, q[100001], w[100001], sum = 0, i; cin >> n >> l >> a; for (i = 0; i < n; i++) { cin >> q[i] >> w[i]; } if (n == 0) { cout << l / a; return 0; } sum = sum + q[0] / a; for (i = 1; i < n; i++) { sum = sum + (q[i] - w[i - 1] - q[i - 1]) / a; } sum = sum + (l - w[n - 1] - q[i - 1]) / a; cout << sum; } |
#include <bits/stdc++.h> using namespace std; vector<int> divi[2002]; long long dp[2002][2002]; int main() { int n, k; cin >> k >> n; int i, j; for (i = 1; i <= k; i++) { for (j = i; j <= k; j += i) divi[i].push_back(j); } for (i = 1; i <= n; i++) { for (j = 1; j <= k; j++) { if (i == 1) dp[i][j] = 1; else { for (int x : divi[j]) dp[i][j] += dp[i - 1][x], dp[i][j] %= 1000000007; } } } long long ans = 0; for (i = 1; i <= k; i++) ans += dp[n][i], ans %= 1000000007; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); long long int mx = n * n; for (int i = 1, j = mx; i < j; i++, j--) { cout << i << << j << endl; } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.