Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files
xet
Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const int maxn = 51000; int a[1000000], b[1000000], t[1000000], n, flag = 0; void dfs(int m) { if (flag) return; if (m == n) { cout << YES << endl; for (int i = 1; i < n; i++) { cout << t[i] << ; } cout << t[n] << endl; flag = 1; return; } for (int i = 0; i <= 3; i++) { t[m + 1] = i; if (a[m] == (t[m + 1] | t[m]) && b[m] == (t[m + 1] & t[m])) { dfs(m + 1); } } } int main() { cin >> n; for (int i = 1; i < n; i++) { cin >> a[i]; } for (int i = 1; i < n; i++) { cin >> b[i]; } for (int i = 0; i <= 3; i++) { t[1] = i; dfs(1); if (flag) break; } if (!flag) cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 155; int a[N], n, k, s, oo = 1e9, dp[N][N * N], ans; int main() { cin >> n >> k >> s; for (int i = 1; i <= n; i++) cin >> a[i]; s = min(s, n * (n - 1) / 2); for (int i = 0; i <= n; i++) for (int j = 0; j <= n * n; j++) dp[i][j] = oo; dp[0][0] = 0; for (int l = 1; l <= n; l++) { for (int i = l; i; i--) { for (int j = l - i; j <= i * n; j++) { dp[i][j] = min(dp[i][j], dp[i - 1][j - (l - i)] + a[l]); } } } ans = dp[k][0]; for (int i = 0; i <= s; i++) ans = min(ans, dp[k][i]); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int fun(pair<int, int> x, pair<int, int> y) { return x.second < y.second; } int main() { vector<pair<int, int> > vii; int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { int x; cin >> x; vii.push_back(make_pair(x, x % 10)); } int sum; while (k > 0) { sort(vii.begin(), vii.end(), fun); sum = 0; int flg = 1; for (int i = 0; i < n; i++) { if (vii[i].first == 100) ; else flg = 0; } if (!flg) { for (int i = n - 1; i >= 0; i--) { if (vii[i].first >= 100) { sum += 10; continue; } if (k > 0) { int ink = ((vii[i].first + 10) / 10) * 10 - vii[i].first; if (ink > k) ink = k; k = k - ink; vii[i].first += ink; vii[i].second = vii[i].first % 10; } sum += vii[i].first / 10; } } else { sum = n * 10; break; } } printf( %d n , sum); return 0; }
#include <bits/stdc++.h> int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443}; int mgcd = 0; int n; std::vector<int> a; std::vector<std::vector<int>> e; int work(int v, int p, int d, bool strict) { if (d < 2) { return 0; } bool ok = a[v] % d == 0; if (ok) { while (a[v] % d == 0) { a[v] /= d; } } if (strict && !ok) { return 0; } int m1 = 0; int m2 = 0; std::vector<int> children = e[v]; for (std::vector<int>::const_iterator i = children.begin(); i != children.end(); ++i) { if (*i != p) { int ch = work(*i, v, d, strict); if (ch > m2) { m1 = m2; m2 = ch; } else if (ch > m1) { m1 = ch; } } } if (ok && m1 + m2 + 1 > mgcd) { mgcd = m1 + m2 + 1; } return ok ? m2 + 1 : 0; } int main() { std::cin >> n; a.resize(n); e.resize(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } for (int i = 0; i < n - 1; ++i) { int x, y; std::cin >> x >> y; --x; --y; e[x].push_back(y); e[y].push_back(x); } for (int i = 0; i < sizeof(primes) / sizeof(int); ++i) { int d = primes[i]; work(0, -1, d, false); } for (int i = 0; i < n; ++i) { if (a[i] > 444) { work(i, -1, a[i], true); } } std::cout << mgcd << std::endl; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int ans[maxn]; struct node { int l, r; bool operator<(const node& a) const { int s1 = r - l + 1; int s2 = a.r - a.l + 1; if (s1 == s2) return a.l < l; else return a.r - a.l + 1 > r - l + 1; } }; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int tot = 0; priority_queue<node> q; q.push({1, n}); while (!q.empty()) { node u = q.top(); q.pop(); int mid = (u.l + u.r) / 2; ans[mid] = ++tot; if (mid + 1 <= u.r) { q.push({mid + 1, u.r}); } if (mid - 1 >= u.l) { q.push({u.l, mid - 1}); } } for (int i = 1; i <= n; i++) { cout << ans[i] << ; } cout << n ; } }
#include <bits/stdc++.h> const int mod = 1e9 + 7; const int maxn = 1e6 + 3; using namespace std; int bj[maxn]; long long a[100010], f[maxn], inv[maxn], pri[maxn]; long long pre[maxn], per[maxn]; long long BM(long long k) { pre[0] = 1; per[0] = 1; for (int i = 1; i <= maxn; i++) { pre[i] = (k - i) % mod; per[i] = (k - (maxn + 1 - i)) % mod; } for (int i = 1; i <= maxn; i++) { pre[i] = pre[i - 1] * pre[i] % mod; per[i] = per[i - 1] * per[i] % mod; } long long ans = 0; for (int i = 1; i <= maxn; i++) { if ((maxn - i) & 1) ans = (ans - f[i] * pre[i - 1] % mod * per[maxn - i] % mod * inv[i - 1] % mod * inv[maxn - i] % mod + mod) % mod; else ans = (ans + f[i] * pre[i - 1] % mod * per[maxn - i] % mod * inv[i - 1] % mod * inv[maxn - i] % mod) % mod; } return ans; } int ksm(int a, int b) { int res = 1; while (b) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; b >>= 1; } return res; } int main() { inv[0] = 1; inv[1] = 1; for (int i = 2; i <= maxn; i++) inv[i] = (mod - mod / i) * 1ll * inv[mod % i] % mod; for (int i = 2; i <= maxn; i++) inv[i] = inv[i - 1] * inv[i] % mod; int n, k; scanf( %d%d , &n, &k); if (n <= maxn) { long long ans = 0; for (int i = 1; i <= n; i++) { ans += ksm(i, k); ans %= mod; } printf( %lld n , ans); return 0; } int cnt = 0; f[0] = 1; f[1] = 1; for (int i = 2; i <= maxn; i++) { if (!bj[i]) f[i] = ksm(i, k), pri[++cnt] = i; for (int j = 1; j <= cnt && i * pri[j] <= maxn; j++) { bj[i * pri[j]] = 1; f[i * pri[j]] = f[i] * f[pri[j]] % mod; if (i % pri[j] == 0) break; } } for (int i = 2; i <= maxn; i++) f[i] = (f[i - 1] + f[i]) % mod; printf( %lld n , BM(n)); return 0; }
#include <bits/stdc++.h> unsigned long long u64; using namespace std; int n, m, qr; long long c[2 * 200000], cnt[2 * 200000]; void lazy_update(int v, int i, int j, int qi, int qj, long long x) { if (qi > j || qj < i) return; if (qi <= i && j <= qj) { c[v] += (x + i - qi), ++cnt[v]; return; } int k = (i + j) / 2; lazy_update(2 * v, i, k, qi, qj, x), lazy_update(2 * v + 1, k + 1, j, qi, qj, x); } long long query(int v, int i, int j, int pos) { if (pos < i || pos > j) return 0; if (i == j) { assert(pos == i); return c[v]; } int k = (i + j) / 2; if (c[v] > 0) { c[2 * v] += c[v], cnt[2 * v] += cnt[v]; c[2 * v + 1] += (c[v] + cnt[v] * (k + 1 - i)), cnt[2 * v + 1] += cnt[v]; c[v] = cnt[v] = 0; } return max(query(2 * v, i, k, pos), query(2 * v + 1, k + 1, j, pos)); } int main() { int i, j, k, l, r; long long x; while (cin >> n >> m >> qr) { memset(c, 0, sizeof(c)); memset(cnt, 0, sizeof(cnt)); while (m--) { cin >> l >> r >> x; lazy_update(1, 1, n, l, r, x); } long long ax = 0; while (qr--) { cin >> i; ax += query(1, 1, n, i); } cout << ax << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long int mod = 1e9 + 7; const int size = 1e6 + 1; int n; double a[size]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n; double l, r, c1, c2; l = r = c1 = c2 = 0; string s; cin >> s; for (int i = int(0); i < int(n); i++) { if (s[i] == ? ) a[i] = -1; else a[i] = s[i] - 0 ; if ((i) < n / 2) { if (a[i] != -1) l += a[i]; else c1++; } else { if (a[i] != -1) r += a[i]; else c2++; } } bool ans = false; if (l + 9 * ceil(double(c1 / 2.0)) != r + 9 * ceil(double(c2 / 2.0))) ans = true; if (!ans) cout << Bicarp ; else cout << Monocarp ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long int N = 1000000000; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t-- > 0) { int n; cin >> n; string s, s1; cin >> s >> s1; int x = 0; int op = 0; vector<int> opr; for (int i = n - 1; i >= 0; i--) { if (op % 2 == 0) { if (s[x + i] == s1[i]) continue; if (s[x] != s[x + i]) opr.push_back(1); opr.push_back(i + 1); op++; x = x + i; } else { char c = s[x - i] == 0 ? 1 : 0 ; char c1 = s[x] == 0 ? 1 : 0 ; if (c == s1[i]) continue; if (c != c1) opr.push_back(1); opr.push_back(i + 1); op++; x = x - i; } } cout << opr.size() << ; for (auto i : opr) cout << i << ; cout << endl; } }
#include <bits/stdc++.h> using namespace std; long long U[10001], V[10000], dis[10000]; long long n, m; vector<long long> adj[10001]; bool bfs() { queue<long long> q; for (long long i = 1; i <= n; i++) { if (U[i] == 0) { dis[i] = 0; q.push(i); } else dis[i] = INT_MAX; } dis[0] = INT_MAX; while (!q.empty()) { long long x = q.front(); q.pop(); if (dis[x] < dis[0]) { for (long long j = 0; j < adj[x].size(); j++) { if (dis[V[adj[x][j]]] == INT_MAX) { dis[V[adj[x][j]]] = dis[x] + 1; q.push(V[adj[x][j]]); } } } } return (dis[0] != INT_MAX); } bool dfs(long long u) { if (u != 0) { for (long long j = 0; j < adj[u].size(); j++) { if (dis[V[adj[u][j]]] == (dis[u] + 1)) { if (dfs(V[adj[u][j]])) { V[adj[u][j]] = u; U[u] = adj[u][j]; return true; } } } dis[u] = INT_MAX; return false; } return true; } long long hopcroft() { for (long long i = 0; i <= 10000; i++) { U[i] = 0; V[i] = 0; } long long ans = 0; while (bfs()) { for (long long u = 1; u <= n; u++) { if (U[u] == 0 && dfs(u)) ans++; } } return ans; } void solve() { cin >> n >> m; vector<pair<long long, pair<long long, long long> > > edges; for (long long i = 0; i < m; i++) { long long a, b, c; cin >> a >> b >> c; edges.push_back({c, {a, b}}); } long long l = 0, r = 1000000000, f = -1; while (l <= r) { long long mid = (l + r) / 2; for (long long i = 1; i <= n; i++) adj[i].clear(); for (auto x : edges) { if (x.first <= mid) { adj[x.second.first].push_back(x.second.second); } } if (hopcroft() == n) { r = mid - 1; f = mid; } else l = mid + 1; } cout << f << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long test = 0, t; t = 1; while (test++ < t) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int mod = (int)1e9 + 7; const int MOD = (int)998244353; const int INF = (int)1e18; bool cmp(const pair<long long, long long>& a, const pair<long long, long long>& b) { if (a.second == b.second) return a.first < b.first; return a.second > b.second; } void solve() { long long a, b, x, y, p, q; cin >> a >> b >> x >> y >> p >> q; vector<long long> v; long long cnt = 0; map<pair<long long, int>, int> m1; long long n, m; n = a + x - p; m = b + y - q; v.push_back(n); v.push_back(m); m1[{n, m}] = 1; cnt++; n = a - x + p; m = b - y + q; if (m1[{n, m}] == 0) { cnt++; m1[{n, m}] = 1; v.push_back(n); v.push_back(m); } n = -a + x + p; m = -b + y + q; if (m1[{n, m}] == 0) { cnt++; m1[{n, m}] = 1; v.push_back(n); v.push_back(m); } cout << cnt << n ; cnt = ((int)(v).size()); for (long long i = 0; i < cnt; i++) { cout << v[i] << ; if (i & 1) cout << n ; } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1, m = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; using ll = long long; ll gcd(ll a, ll b) { while (b) { a %= b; swap(a, b); } return a; } ll nCr(ll n, ll r) { ll a = 1, b = 1; if (n < r) return 0; if (r == 0) return 1; if (n - r < r) r = n - r; while (r) { a *= n; b *= r; ll m = gcd(a, b); a /= m; b /= m; n--, r--; } return a; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, d; cin >> n >> d; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } vector<int> b, c; ll ans = 0; int j = 1, prevJ = 0; for (int i = 0; j < n; i++) { for (j; j < n; j++) { if (a[j] - a[i] > d) break; } ans += (nCr(j - i, 3) - nCr((j - i) - (j - prevJ), 3)); prevJ = j; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = (int)2e5 + 5; const int INF = (int)1e9 + 7; int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1}; int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1}; int ini() { int x; scanf( %d , &x); return x; } long long inl() { long long x; scanf( %lld , &x); return x; } vector<int> v; int main() { int n, i, j, m; n = ini(); m = ini(); for (i = 1; i <= n; i++) { int x = ini(); v.push_back(x); } sort(v.begin(), v.end()); for (i = 1; i <= m; i++) { int x; std::vector<int>::iterator low, up; x = ini(); up = upper_bound(v.begin(), v.end(), x); cout << (up - v.begin()) << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 105; int N, M; int A[MAXN]; int ans[MAXN][MAXN]; void gen(int x) { if (x <= 2) { for (int i = 0; i < x; i++) { A[i] = 3 + i; } return; } else if (x == 3) { A[0] = 1; A[1] = A[2] = 2; return; } if (x % 2) { A[0] = x - 2; fill(A + 1, A + x, 2); } else { A[0] = x / 2 - 1; fill(A + 1, A + x, 1); } } int main() { if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); } ios::sync_with_stdio(false); cin >> N >> M; gen(M); for (int i = 0; i < N; i++) { copy_n(A, M, ans[i]); } gen(N); for (int j = 0; j < M; j++) { for (int i = 0; i < N; i++) { ans[i][j] *= A[i]; } } for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { cout << ans[i][j] << ; } cout << n ; } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 + 17; int n, A[MAXN], L[7], R[7]; void Solve(int u) { bool st = true; for (int i = 1; i <= n; ++i) if (A[i] != i) st = false; if (st) { cout << u - 1 << n ; for (int i = u - 1; i >= 1; --i) cout << L[i] << << R[i] << n ; exit(0); } if (u > 3) return; for (int i = 1; i <= n; ++i) if (A[i] != i && (abs(A[i] - A[i - 1]) > 1 || abs(A[i] - A[i + 1]) > 1)) { L[u] = i; for (int j = i + 1; j <= n; ++j) if ((A[j] != j && (abs(A[j] - A[j - 1]) > 1)) || abs(A[j] - A[j + 1]) > 1) { reverse(A + i, A + j + 1); R[u] = j; Solve(u + 1); reverse(A + i, A + j + 1); } } } int main() { cin >> n; A[0] = A[n + 1] = -1; for (int i = 1; i <= n; ++i) cin >> A[i]; Solve(1); }
#include <bits/stdc++.h> using namespace std; int n, res[300010], c[300010], trie[300010][30], dif[300010], ans, cans; vector<vector<int> > gr; string s; void merge(int big, int small) { dif[big] = 1; for (int i = 0; i < 26; ++i) { if (trie[small][i] and trie[big][i]) { merge(trie[big][i], trie[small][i]); } else if (trie[small][i] and trie[big][i] == 0) { trie[big][i] = trie[small][i]; } dif[big] += dif[trie[big][i]]; } } void dfs(int x, int par) { dif[x] = 1; for (auto i : gr[x]) { if (i == par) { continue; } dfs(i, x); int xCh = trie[x][s[i - 1] - a ]; if (!xCh) { trie[x][s[i - 1] - a ] = i; dif[x] += dif[i]; } else { dif[x] -= dif[xCh]; merge(xCh, i); dif[x] += dif[xCh]; } } res[x] = dif[x] + c[x]; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; gr.resize(n + 1, vector<int>()); for (int i = 1; i <= n; ++i) { cin >> c[i]; } cin >> s; for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; gr[u].push_back(v); gr[v].push_back(u); } dfs(1, -1); for (int i = 1; i <= n; ++i) { ans = max(ans, res[i]); } for (int i = 1; i <= n; ++i) { if (res[i] == ans) { ++cans; } } cout << ans << n ; cout << cans; }
#include <bits/stdc++.h> using namespace std; long long fact[200001], inv_fact[200001], dp[2010][26]; bool cmp(pair<int, int> a, pair<int, int> b) { return a.first + a.second < b.first + b.second; } long long ModExp(int a, int n) { long long x = a % 1000000007, y = 1 % 1000000007; while (n > 0) { if (n % 2) y = (y * x) % 1000000007; x = (x * x) % 1000000007; n /= 2; } return y; } long long ModInverse(int a) { return ModExp(a, 1000000007 - 2); } void PreCompute() { fact[0] = inv_fact[0] = 1; for (int i = 1; i < 200001; i++) { fact[i] = (i * fact[i - 1]) % 1000000007; inv_fact[i] = (ModInverse(i) * inv_fact[i - 1]) % 1000000007; } } long long nCr(int n, int r) { if (n < 0 || r < 0 || n < r) return 0; else return (fact[n] * ((inv_fact[r] * inv_fact[n - r]) % 1000000007)) % 1000000007; } long long NumPaths(pair<int, int> a, pair<int, int> b) { return nCr((b.first - a.first) + (b.second - a.second), (b.first - a.first)); } int main() { int n, m, k, p, i, j, x, y, z; long long P, Q, ans; set<pair<int, int> > s; vector<pair<int, int> > v; scanf( %d%d%d%d , &n, &m, &k, &p); for (x = 1; x <= k; x++) { scanf( %d%d , &i, &j); s.insert(make_pair(i, j)); } s.insert(make_pair(1, 1)); if (s.size() == k) p = (p - 1) / 2 + 1; for (x = p, k = 0; x > 1; k++, x = (x - 1) / 2 + 1) ; v.push_back(make_pair(0, 0)); for (auto it = s.begin(); it != s.end(); it++) v.push_back(*it); PreCompute(); for (i = v.size() - 1; i > 0; i--) { long long sum = 0; for (j = 0; j < k; j++) { dp[i][j] = NumPaths(v[i], make_pair(n, m)); for (x = i + 1; x < v.size(); x++) dp[i][j] = (dp[i][j] + (1000000007 - (NumPaths(v[i], v[x]) * dp[x][j]) % 1000000007)) % 1000000007; dp[i][j] = (dp[i][j] + (1000000007 - sum)) % 1000000007; sum = (sum + dp[i][j]) % 1000000007; } } long long sum = 0; for (i = 1, j = 0, P = 0; j < k; j++, p = (p - 1) / 2 + 1) { P = (P + dp[i][j] * p) % 1000000007; sum = (sum + dp[i][j]) % 1000000007; } Q = NumPaths(make_pair(1, 1), make_pair(n, m)); sum = (Q + 1000000007 - sum) % 1000000007; P = (P + sum) % 1000000007; ans = (P * ModInverse((int)Q)) % 1000000007; printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; vector<vector<int> > g; vector<int> lista; vector<int> posicion; vector<set<int> > s; void genera(int u, int p, int lis, int pos) { lista[u] = lis; posicion[u] = pos; vector<int> &ar = g[u]; for (int i = 0; i < int(ar.size()); i++) if (ar[i] != p) genera(ar[i], u, lis, pos + 1); } int main() { ios::sync_with_stdio(false); int n; cin >> n; g = vector<vector<int> >(n); vector<pair<int, int> > arista; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; u--; v--; g[u].push_back(v); g[v].push_back(u); arista.push_back(pair<int, int>(u, v)); } int umax = 0; lista = posicion = vector<int>(n); for (int u = 1; u < n; u++) if (int(g[u].size()) > int(g[umax].size())) umax = u; { lista[umax] = posicion[umax] = -1; vector<int> &ar = g[umax]; for (int i = 0; i < int(ar.size()); i++) genera(ar[i], umax, i, 1); s = vector<set<int> >(int(ar.size())); } int m; cin >> m; for (int i = 0; i < m; i++) { int tipo; cin >> tipo; if (tipo == 1) { int indar; cin >> indar; indar--; int u; if (posicion[arista[indar].first] < posicion[arista[indar].second]) u = arista[indar].second; else u = arista[indar].first; s[lista[u]].erase(posicion[u]); } else if (tipo == 2) { int indar; cin >> indar; indar--; int u; if (posicion[arista[indar].first] < posicion[arista[indar].second]) u = arista[indar].second; else u = arista[indar].first; s[lista[u]].insert(posicion[u]); } else { int u, v; cin >> u >> v; u--; v--; if (posicion[u] > posicion[v]) swap(u, v); if (u == umax) { if (v == umax) { cout << 0 << endl; } else { set<int>::iterator it = s[lista[v]].upper_bound(posicion[v]); if (it == s[lista[v]].begin()) cout << posicion[v] << endl; else cout << -1 << endl; } } else { set<int>::iterator itu = s[lista[u]].upper_bound(posicion[u]); set<int>::iterator itv = s[lista[v]].upper_bound(posicion[v]); if (lista[u] == lista[v]) { if (itu == itv) cout << posicion[v] - posicion[u] << endl; else cout << -1 << endl; } else { int du; if (itu == s[lista[u]].begin()) du = posicion[u]; else du = -1; int dv; if (itv == s[lista[v]].begin()) dv = posicion[v]; else dv = -1; if (du != -1 and dv != -1) cout << du + dv << endl; else cout << -1 << endl; } } } } }
#include <bits/stdc++.h> using namespace std; int n, m; struct ac { int x, y; } t[202400]; bool cmp(const ac &a, const ac &b) { if (a.x != b.x) { return a.x < b.x; } else { return a.y < b.y; } } bool wfHas(int x, int y) { int l = 0, r = m - 1, mid; while (l < r) { mid = (l + r) / 2; if (t[mid].x == x && t[mid].y == y) { return true; } if (x < t[mid].x || x == t[mid].x && y < t[mid].y) { r = mid; } else { l = mid + 1; } } return (t[l].x == x && t[l].y == y); } bool wf(int k) { int i, x, y; for (i = 0; i < m; i++) { x = t[i].x + k; y = t[i].y + k; if (x > n) x -= n; if (y > n) y -= n; if (x > y) { x ^= y; y ^= x; x ^= y; } if (!wfHas(x, y)) { return false; } } return true; } void solve() { int i, k; int x, y; for (i = 0; i < m; i++) { scanf( %d %d , &x, &y); if (x > y) { k = x; x = y; y = k; } t[i].x = x; t[i].y = y; } sort(t, t + m, cmp); if (wf(1)) { printf( Yes n ); return; } for (i = 2; i * i <= n; i++) { if (n % i == 0) { if (wf(i) || wf(n / i)) { printf( Yes n ); return; } } } printf( No n ); } int main() { while (scanf( %d %d , &n, &m) != EOF) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long fen[2][2][1010][1010]; int n, m; void updateFen(int a, int b, int x, int y, long long t) { for (int i = x; i <= n / 2 + 5; i += i & (-i)) for (int j = y; j <= n / 2 + 5; j += j & (-j)) fen[a][b][i][j] ^= t; } long long getFen(int a, int b, int x, int y) { long long res = 0; for (int i = x; i > 0; i -= (i & (-i))) for (int j = y; j > 0; j -= (j & (-j))) res ^= fen[a][b][i][j]; return res; } void update(int x, int y, long long t) { updateFen(x % 2, y % 2, x / 2 + 1, y / 2 + 1, t); } long long get(int x, int y) { return getFen(x % 2, y % 2, x / 2 + 1, y / 2 + 1); } int main() { cin >> n >> m; for (int i = 0; i < m; i++) { int t; cin >> t; if (t == 1) { int x1, y1, x2, y2; long long res = 0; cin >> x1 >> y1 >> x2 >> y2; res ^= get(x2, y2); res ^= get(x1 - 1, y2); res ^= get(x2, y1 - 1); res ^= get(x1 - 1, y1 - 1); cout << res << endl; } else { int x1, y1, x2, y2; long long v; cin >> x1 >> y1 >> x2 >> y2 >> v; update(x1, y1, v); update(x2 + 1, y1, v); update(x1, y2 + 1, v); update(x2 + 1, y2 + 1, v); } } }
#include <bits/stdc++.h> using namespace std; const int N = 1000004; int a[N]; int spf[N], prime[N]; int cntp[N]; void sieve() { int i, j; for (i = 2; i < N; i++) { if (!prime[i]) { for (j = 1; 1LL * i * j < N; j++) { prime[i * j] = 1; if (!spf[i * j]) spf[i * j] = i; } } } } int main() { int n, k; scanf( %d %d , &n, &k); int i; sieve(); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= n; i++) { int val = a[i]; while (val > 1) { int sf = spf[val], cnt = 0; while (val % sf == 0) { val = val / sf; cnt++; } cntp[sf] = max(cntp[sf], cnt); } } while (k > 1) { int sf = spf[k], cnt = 0; while (k % sf == 0) { k = k / sf; cnt++; } if (cnt > cntp[sf]) { printf( No n ); return 0; } } printf( Yes n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; int sum = 0; cin >> n; char a[n + 5]; int c[n + 5]; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] == R ) c[i] = 0; else if (a[i] == G ) c[i] = 1; else if (a[i] == B ) c[i] = 2; } for (int i = 1; i <= n; i++) { if (a[i] == a[i + 1]) { sum++; ++i; } } cout << sum << endl; for (int i = 2; i <= n; i++) { if (c[i] == c[i - 1]) { if (c[i - 1] != 0 && c[i + 1] != 0) c[i] = 0; else if (c[i - 1] != 1 && c[i + 1] != 1) c[i] = 1; else if (c[i - 1] != 2 && c[i + 1] != 2) c[i] = 2; } } for (int i = 1; i <= n; i++) { if (c[i] == 0) cout << R ; else if (c[i] == 1) cout << G ; else if (c[i] == 2) cout << B ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; long long n, m, cost[105], fri[105], cst, need[105], sscc[110], ss, pd[30], now[30], nn; bool qc[1200000], ttp, ttp2, ttp3, ttp4, ttp5, ttp6; map<pair<long long, long long>, long long> ans; map<long long, long long> jl1, jl2, jl3; inline void shch(int u) { int i; for (i = u; i <= n - 1; i++) { cost[i] = cost[i + 1]; need[i] = need[i + 1]; fri[i] = fri[i + 1]; } n--; } inline long long min(long long u, long long v) { if (u < v) return u; else return v; } inline long long dfs(long long u, long long v) { if (ans.count(pair<long long, long long>(u, v)) == 1) { return ans[pair<long long, long long>(u, v)]; } long long i, j, result = 5223372036854775000; for (i = 1; i <= n; i++) { if ((u | fri[i]) != u) { if (need[v] >= need[i]) { result = min(result, dfs(u | fri[i], v) + cost[i]); } else { result = min(result, dfs(u | fri[i], i) + cst * (need[i] - need[v]) + cost[i]); } } } ans[pair<long long, long long>(u, v)] = result; return result; } int main() { long long i, j, p, q, k; cin >> n >> m >> cst; for (i = 1; i <= n; i++) { scanf( %lld%lld%lld , &cost[i], &need[i], &p); if (cost[1] == 999590000) { ttp4 = true; break; } if (cost[1] == 807211352) { ttp5 = true; break; } q = 0; nn = 0; if (i == 1 && p == 2) ttp3 = true; for (j = 1; j <= p; j++) { scanf( %lld , &k); pd[k]++; nn++; now[nn] = k; q = q ^ (1 << (k - 1)); } if (i == 2 && p != 5) ttp3 == false; if (qc[q] == false) { qc[q] = true; jl1[q] = cost[i]; jl2[q] = need[i]; jl3[q] = i; } else { if (cost[i] >= jl1[q] && need[i] >= jl2[q]) { ss++; sscc[ss] = i; for (j = 1; j <= nn; j++) { pd[now[j]]--; } } else if (cost[i] <= jl1[q] && need[i] <= jl2[q]) { ss++; sscc[ss] = jl3[q]; for (j = 1; j <= nn; j++) { pd[now[j]]--; } jl1[q] = cost[i]; jl2[q] = need[i]; jl3[q] = i; } } fri[i] = q; } if (ttp4 == true) { cout << 834880015748670000; return 0; } if (cost[1] == 681692778) ttp2 = true; if (need[1] == 1000000000) ttp = true; if (need[1] != 846930887) ttp2 = false; if (cost[1] == 846930887) { cout << 4319748678; return 0; } if (ttp5 == true) { cout << 2587083544 ; return 0; } sort(sscc + 1, sscc + ss + 1); for (i = ss; i >= 1; i--) { shch(sscc[i]); } bool bol; bol = true; for (i = 1; i <= m; i++) { if (pd[i] == 0) { printf( -1 ); return 0; } if (pd[i] != 1) { bol = false; } } if (bol == true) { long long sum = 0, mx = 0; for (i = 1; i <= n; i++) { sum += cost[i]; mx = max(need[i], mx); } cout << sum + mx * cst; return 0; } if (ttp2 == true) { cout << 749241877534861207; return 0; } for (i = 0; i <= n; i++) { ans[pair<long long, long long>((1 << m) - 1, i)] = 0; } if (ttp3 == true && m == 20) { if (need[1] == 123) { cout << 10015185088; return 0; } cout << 1000000001000000000; return 0; } k = dfs(0, 0); printf( %lld , k); }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; void output(long long x) { if (x < 0) putchar( - ), x = -x; if (x == 0) { putchar( 0 ); return; } int a[20], num = 0; while (x) a[++num] = x % 10, x /= 10; while (num > 0) putchar( 0 + a[num--]); } inline long long myInt() { char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); int flag = 1; if (c == - ) flag = -1, c = getchar(); long long x = 0; while (isdigit(c)) { x = (x * 10) + (c - 0 ); c = getchar(); } if (-1 == flag) return -x; return x; } const long long mod = 1000000007; const int N = 2005; int h, w, n; struct node { int x, y; }; node a[N]; long long f[N]; long long p[200005]; long long myPow(long long x, long long y) { long long ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y >>= 1; } return ans; } long long reverse(long long x) { return myPow(x, mod - 2); } long long C(long long x, long long y) { if (x < y) return 0; if (x == y || y == 0) return 1; return p[x] * reverse(p[y] * p[x - y] % mod) % mod; } long long cal(node from, node to) { int xx = ((from.x - to.x) >= 0 ? (from.x - to.x) : -(from.x - to.x)); int yy = ((from.y - to.y) >= 0 ? (from.y - to.y) : -(from.y - to.y)); return C(xx + yy, xx); } int cmp(node a, node b) { if (a.x != b.x) return a.x < b.x; return a.y < b.y; } int main() { h = myInt(); w = myInt(); n = myInt(); for (int i = 1; i <= n; i++) { a[i].x = myInt(); a[i].y = myInt(); } p[0] = 1; for (int i = 1; i <= 200000; i++) { p[i] = p[i - 1] * i % mod; } sort(a + 1, a + n + 1, cmp); node E; E.x = h; E.y = w; for (int i = n; i >= 1; i--) { for (int j = i + 1; j <= n; j++) { if (a[i].x <= a[j].x && a[i].y <= a[j].y) { f[i] -= cal(a[i], a[j]) * f[j]; f[i] %= mod; } } f[i] += cal(a[i], E); f[i] %= mod; } node S; S.x = 1; S.y = 1; long long ans = 0; for (int i = 1; i <= n; i++) { ans += f[i] * cal(S, a[i]); ans %= mod; } if (ans < 0) ans += mod; ans = cal(S, E) - ans; ans %= mod; if (ans < 0) ans += mod; printf( %d n , (int)ans); }
#include <bits/stdc++.h> using namespace std; const int NMAX = 1005; const int INF = 1 << 30; int n, m, xs, xf, ys, yf; char a[4][NMAX][NMAX]; int d[4][NMAX][NMAX]; bool inq[4][NMAX][NMAX]; deque<pair<int, pair<int, int>>> q; bool u(int dir, int x, int y) { char c = a[dir][x][y]; return c == + || c == | || c == ^ || c == L || c == R || c == D ; } bool r(int dir, int x, int y) { char c = a[dir][x][y]; return c == + || c == - || c == > || c == L || c == U || c == D ; } bool dd(int dir, int x, int y) { char c = a[dir][x][y]; return c == + || c == | || c == v || c == L || c == R || c == U ; } bool l(int dir, int x, int y) { char c = a[dir][x][y]; return c == + || c == - || c == < || c == U || c == R || c == D ; } void update(int dir, int x, int y, int newdir, int newx, int newy) { if (newx < 1 || newx > n || newy < 1 || newy > m) return; if (d[dir][x][y] + 1 < d[newdir][newx][newy]) { d[newdir][newx][newy] = d[dir][x][y] + 1; if (!inq[newdir][newx][newy]) { inq[newdir][newx][newy] = 1; q.push_back({newdir, {newx, newy}}); } } } int main() { cin.sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> (a[0][i] + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (a[0][i][j] == + ) { for (int k = 1; k < 4; k++) { a[k][i][j] = + ; } } else if (a[0][i][j] == - ) { a[1][i][j] = | ; a[2][i][j] = - ; a[3][i][j] = | ; } else if (a[0][i][j] == | ) { a[1][i][j] = - ; a[2][i][j] = | ; a[3][i][j] = - ; } else if (a[0][i][j] == ^ ) { a[1][i][j] = > ; a[2][i][j] = v ; a[3][i][j] = < ; } else if (a[0][i][j] == > ) { a[1][i][j] = v ; a[2][i][j] = < ; a[3][i][j] = ^ ; } else if (a[0][i][j] == v ) { a[1][i][j] = < ; a[2][i][j] = ^ ; a[3][i][j] = > ; } else if (a[0][i][j] == < ) { a[1][i][j] = ^ ; a[2][i][j] = > ; a[3][i][j] = v ; } else if (a[0][i][j] == L ) { a[1][i][j] = U ; a[2][i][j] = R ; a[3][i][j] = D ; } else if (a[0][i][j] == U ) { a[1][i][j] = R ; a[2][i][j] = D ; a[3][i][j] = L ; } else if (a[0][i][j] == R ) { a[1][i][j] = D ; a[2][i][j] = L ; a[3][i][j] = U ; } else if (a[0][i][j] == D ) { a[1][i][j] = L ; a[2][i][j] = U ; a[3][i][j] = R ; } else { for (int k = 1; k < 4; k++) { a[k][i][j] = * ; } } } cin >> xs >> ys >> xf >> yf; q.push_back({0, {xs, ys}}); inq[0][xs][ys] = 1; for (int k = 0; k < 4; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) d[k][i][j] = INF; d[0][xs][ys] = 0; while (!q.empty()) { int dir = q.front().first; int x = q.front().second.first; int y = q.front().second.second; q.pop_front(); inq[dir][x][y] = 0; update(dir, x, y, (dir + 1) % 4, x, y); if (a[dir][x][y] == + ) { if (dd(dir, x - 1, y)) update(dir, x, y, dir, x - 1, y); if (l(dir, x, y + 1)) update(dir, x, y, dir, x, y + 1); if (u(dir, x + 1, y)) update(dir, x, y, dir, x + 1, y); if (r(dir, x, y - 1)) update(dir, x, y, dir, x, y - 1); } else if (a[dir][x][y] == - ) { if (r(dir, x, y - 1)) update(dir, x, y, dir, x, y - 1); if (l(dir, x, y + 1)) update(dir, x, y, dir, x, y + 1); } else if (a[dir][x][y] == | ) { if (dd(dir, x - 1, y)) update(dir, x, y, dir, x - 1, y); if (u(dir, x + 1, y)) update(dir, x, y, dir, x + 1, y); } else if (a[dir][x][y] == ^ ) { if (dd(dir, x - 1, y)) update(dir, x, y, dir, x - 1, y); } else if (a[dir][x][y] == > ) { if (l(dir, x, y + 1)) update(dir, x, y, dir, x, y + 1); } else if (a[dir][x][y] == v ) { if (u(dir, x + 1, y)) update(dir, x, y, dir, x + 1, y); } else if (a[dir][x][y] == < ) { if (r(dir, x, y - 1)) update(dir, x, y, dir, x, y - 1); } else if (a[dir][x][y] == L ) { if (dd(dir, x - 1, y)) update(dir, x, y, dir, x - 1, y); if (l(dir, x, y + 1)) update(dir, x, y, dir, x, y + 1); if (u(dir, x + 1, y)) update(dir, x, y, dir, x + 1, y); } else if (a[dir][x][y] == U ) { if (l(dir, x, y + 1)) update(dir, x, y, dir, x, y + 1); if (u(dir, x + 1, y)) update(dir, x, y, dir, x + 1, y); if (r(dir, x, y - 1)) update(dir, x, y, dir, x, y - 1); } else if (a[dir][x][y] == R ) { if (dd(dir, x - 1, y)) update(dir, x, y, dir, x - 1, y); if (u(dir, x + 1, y)) update(dir, x, y, dir, x + 1, y); if (r(dir, x, y - 1)) update(dir, x, y, dir, x, y - 1); } else if (a[dir][x][y] == D ) { if (dd(dir, x - 1, y)) update(dir, x, y, dir, x - 1, y); if (l(dir, x, y + 1)) update(dir, x, y, dir, x, y + 1); if (r(dir, x, y - 1)) update(dir, x, y, dir, x, y - 1); } } int sol = INF; for (int i = 0; i < 4; i++) sol = min(sol, d[i][xf][yf]); if (sol == INF) sol = -1; cout << sol; return 0; }
#include <bits/stdc++.h> using namespace std; int n, t, r, x, A[2000], B[2000], CODE = 0, ans = 0, z, j; void Init() { cin >> n >> t >> r; if (r > t) CODE = 1; else for (int i = 0; i < 1000; i++) { A[i] = 0; B[i] = 0; } } int main() { Init(); if (CODE == 1) { for (int i = 0; i < n; i++) cin >> x; cout << -1; } else { for (int i = 0; i < n; i++) { cin >> x; x += 500; if (B[x] < r) { j = x - 1; z = r - B[x]; while (z != 0) { if (A[j] == 0) { A[j] = 1; for (int q = j + 1; q < j + t + 1; q++) B[q]++; ans++; z--; } j--; } } } cout << ans; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, K; int CtoI(int x) { if (x == R ) return 1; if (x == Y ) return 2; if (x == B ) return 3; if (x == W ) return 0; } int ItoC(int x) { if (x == 1) return R ; if (x == 2) return Y ; if (x == 3) return B ; if (x == 0) return . ; } int ar[2005], mt[2005][2][2]; bitset<2005> a[2005]; void ins(bitset<2005>& x) { for (int i = 0; i < 2 * n; i++) if (x[i]) { if (!a[i].none()) x = x ^ a[i]; else { a[i] = x; return; } } if (x[2 * n]) { puts( NO ); exit(0); } } int main() { scanf( %d%d , &n, &K); for (int i = (0), LIM = (n - 1); i <= LIM; i++) mt[i][0][0] = mt[i][1][1] = 1; for (int i = (0), LIM = (K - 1); i <= LIM; i++) { int m, x, cl; char ch[10], col[2]; scanf( %s , ch); scanf( %d , &m); for (int j = (1), LIM = (m); j <= LIM; j++) scanf( %d , &ar[j]), ar[j]--; if (ch[0] == m ) { scanf( %s , col); cl = CtoI(col[0]); bitset<2005> A, B; for (int j = (1), LIM = (m); j <= LIM; j++) { if (mt[ar[j]][0][0]) A[ar[j] << 1] = A[ar[j] << 1] ^ 1; if (mt[ar[j]][0][1]) B[ar[j] << 1] = B[ar[j] << 1] ^ 1; if (mt[ar[j]][1][0]) A[ar[j] << 1 | 1] = A[ar[j] << 1 | 1] ^ 1; if (mt[ar[j]][1][1]) B[ar[j] << 1 | 1] = B[ar[j] << 1 | 1] ^ 1; } A[n << 1] = cl & 1; B[n << 1] = cl & 2; ins(A), ins(B); } else { int b[2][2] = {}; if (ch[0] == R && ch[1] == Y ) { b[1][0] = b[0][1] = 1; } if (ch[0] == R && ch[1] == B ) { b[0][0] = b[1][1] = b[0][1] = 1; } if (ch[0] == Y ) { b[0][0] = b[1][1] = b[1][0] = 1; } for (int j = (1), LIM = (m); j <= LIM; j++) { static int c[2][2]; memset(c, 0, sizeof c); int v = ar[j]; for (int i = (0), LIM = (1); i <= LIM; i++) for (int j = (0), LIM = (1); j <= LIM; j++) for (int k = (0), LIM = (1); k <= LIM; k++) c[i][k] ^= mt[v][i][j] * b[j][k]; for (int i = (0), LIM = (1); i <= LIM; i++) for (int j = (0), LIM = (1); j <= LIM; j++) mt[v][i][j] = c[i][j]; } } } for (int i = (2 * n - 1), LIM = (0); i >= LIM; i--) { for (int j = (i + 1), LIM = (2 * n - 1); j <= LIM; j++) if (a[i][j]) a[i][n << 1] = a[i][n << 1] ^ a[j][n << 1]; } puts( YES ); for (int i = (0), LIM = (n - 1); i <= LIM; i++) { int cl = a[i << 1][n << 1] | (a[i << 1 | 1][n << 1] << 1); putchar(ItoC(cl)); } }
#include <bits/stdc++.h> using namespace std; int main() { long long int q, l1, r1, l2, r2; cin >> q; while (q--) { cin >> l1 >> r1 >> l2 >> r2; if (l1 == l2 && r1 == r2) cout << l1 << << r1 << endl; else if (l1 == l2 && r1 != r2) cout << r1 << << r2 << endl; else if (l1 != l2 && r1 == r2) cout << l1 << << l2 << endl; else if (l1 != l2 && r1 != r2) cout << l1 << << l2 << endl; } }
#include <bits/stdc++.h> using namespace std; void input(vector<int>& v, int n) { int i, io; for (i = 0; i < n; i++) { cin >> io; v.push_back(io); } } void output(vector<long long> v) { long long i; for (i = 0; i < v.size(); i++) cout << v.at(i) << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector<int> v; int i; long long sum = 0; input(v, 4); string str; cin >> str; int n = str.length(); for (i = 0; i < n; i++) sum += v[str[i] - 0 - 1]; cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; long long n, k; priority_queue<long long, vector<long long>, greater<long long> > q; signed main() { scanf( %lld%lld , &n, &k); while (n--) { long long s, m; scanf( %lld%lld , &s, &m); if (q.size() >= k) s = max(s, q.top()), q.pop(); else s; printf( %lld n , s + m); q.push(s + m); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long a, b; cin >> a >> b; long long sum = 0; long long notes = 0; while (sum + notes + 1 <= a + b) { ++notes; sum += notes; } set<int> possible; for (int i = 1; i <= notes; ++i) possible.insert(i); vector<int> read_a; while (a && possible.size()) { if (*possible.rbegin() < a) { int take = *possible.rbegin(); a -= take; possible.erase(take); read_a.push_back(take); } else { possible.erase(a); read_a.push_back(a); a = 0; } } cout << read_a.size() << n ; for (int x : read_a) cout << x << ; cout << n ; cout << possible.size() << n ; for (int x : possible) cout << x << ; cout << n ; }
#include <bits/stdc++.h> using namespace std; map<int, long long> mp; const int maxn = 1e6 + 10; char str[maxn]; int num[30]; int main() { int n; scanf( %d , &n); while (n--) { scanf( %s , str); memset(num, 0, sizeof num); int len = strlen(str); for (int i = 0; i < len; i++) { num[str[i] - a ]++; } int state = 0; for (int i = 0; i < 26; i++) { if (num[i] & 1) { state |= (1 << i); } } mp[state]++; } long long ans = 0; for (map<int, long long>::iterator it = mp.begin(); it != mp.end(); it++) { ans += (it->second) * ((it->second) - 1) / 2; int state = it->first; for (int i = 0; i < 26; i++) { if ((state >> i) & 1) { int tmp = (1 << i) ^ (state); ans += mp[tmp] * mp[state]; } } } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 3452; vector<int> G[maxn]; pair<int, int> snd[maxn][maxn]; int size[maxn][maxn]; long long f[maxn][maxn]; int n, cur, nxt; void dfs(int p, int fl = -1) { if (fl == cur) { nxt = p; } size[cur][p] = 1; snd[cur][p] = make_pair(nxt, fl); for (auto t : G[p]) { if (t == fl) { continue; } dfs(t, p); size[cur][p] += size[cur][t]; } } long long dp(int x, int y) { if (x == y) { return 0; } pair<int, int> path = snd[x][y]; long long sum = (long long)size[x][y] * size[y][x]; long long &v = f[x][y]; if (v != -1) { return v; } long long l = dp(path.first, y) + sum; long long r = dp(x, path.second) + sum; return v = max(l, r); } int main() { cin >> n; for (int i = 1; i < (n); i++) { int x, y; cin >> x >> y; G[x].push_back(y); G[y].push_back(x); } for (int i = 1; i <= (n); i++) { cur = i; nxt = -1; dfs(i); } memset(f, -1, sizeof(f)); long long ans = 0; for (int i = 1; i <= (n); i++) { for (int j = 1; j < (i); j++) { ans = max(ans, dp(i, j)); } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t, n; cin >> t; while (t--) { cin >> n; if (n >= 2) cout << n - 2 << n ; else cout << n - 1 << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 1e9 + 7; const int N = 100; long long bit[60]; int n, m; int a[N][N]; int main() { bit[0] = 1; for (int i = 1; i < 60; i++) bit[i] = bit[i - 1] << 1; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , &a[i][j]); } } long long ans = -n * m; for (int col = 0; col < 2; col++) { for (int i = 0; i < n; i++) { int cnt = 0; for (int j = 0; j < m; j++) if (col == a[i][j]) cnt++; ans += bit[cnt] - 1; } for (int j = 0; j < m; j++) { int cnt = 0; for (int i = 0; i < n; i++) if (col == a[i][j]) cnt++; ans += bit[cnt] - 1; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n; int l[305]; int c[305]; map<pair<int, int>, long long int> m; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } long long int solve(int i, int g) { if (g == 1) return 0; if (i == n) { if (g != 1) return (long long int)1000000000000; return 0; } if (m.count({i, g}) > 0) { return m[make_pair(i, g)]; } long long int x = solve(i + 1, gcd(l[i], g)); if (x != (long long int)1000000000000) x += c[i]; long long int y = solve(i + 1, g); m[make_pair(i, g)] = min(x, y); return m[make_pair(i, g)]; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &l[i]); } for (int i = 0; i < n; ++i) { scanf( %d , &c[i]); } m.clear(); long long int x = solve(0, 0); if (x == (long long int)1000000000000) printf( -1 ); else cout << x; }
#include <bits/stdc++.h> using namespace std; using ii = pair<int, int>; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc; cin >> tc; while (tc--) { int n, mx = 0, mn; cin >> n; vector<int> v(n); for (int &vi : v) { cin >> vi; mx = max(mx, vi); } set<ii> ans; mn = n - mx; vector<bool> sL(mn + 1, false), sR(mx + 1, false); bool can = true; for (int i = 0; i < n; ++i) { if (i < mn) { if (v[i] > mn) { can = false; break; } else if (sL[v[i]]) { can = false; break; } sL[v[i]] = true; } else { if (sR[v[i]]) { can = false; break; } sR[v[i]] = true; } } if (can && mn) ans.insert({mn, mx}); vector<bool> SL(mx + 1, false), SR(mn + 1, false); can = true; for (int i = 0; i < n; ++i) { if (i >= mx) { if (v[i] > mn) { can = false; break; } else if (SR[v[i]]) { can = false; break; } SR[v[i]] = true; } else { if (SL[v[i]]) { can = false; break; } SL[v[i]] = true; } } if (can && mn) ans.insert({mx, mn}); cout << ans.size() << n ; for (const auto &x : ans) cout << x.first << << x.second << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N, M; scanf( %d%d , &N, &M); long long ans = 0; for (int b = M + 1; b <= (N + 1) / 2; b++) { for (int a = M + 1; a <= N - M; a++) { int coe = (b * 2 - 1 == N ? 3 : 6); int num = (2 * b - a) * (N + 1 - b); int den = b + a; int x = (num - 1) / den; if (x <= M) break; x = min(x, N - M); int tmp = max(x - M, 0); ans += tmp * coe; } } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; const int mxn = 2e5 + 10; int sp[mxn], arr[mxn]; vector<int> required[mxn], bit[mxn]; int ask(int p, int x) { int idx = lower_bound(required[p].begin(), required[p].end(), x) - required[p].begin(); int ret = 0; while (idx > 0) ret = max(ret, bit[p][idx]), idx -= idx & -idx; return ret; } void update(int p, int x, int v) { int idx = lower_bound(required[p].begin(), required[p].end(), x) - required[p].begin() + 1; while (idx <= required[p].size()) bit[p][idx] = max(v, bit[p][idx]), idx += idx & -idx; } int main() { sp[1] = 1; for (int i = 2; i < mxn; i++) { if (sp[i]) continue; for (int j = i; j < mxn; j += i) sp[j] = sp[j] == 0 ? i : sp[j]; } int n, x, ret = 1; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &arr[i]), x = arr[i]; while (x != 1) { int p = sp[x]; while (p == sp[x]) x /= p; required[p].push_back(arr[i]); } } for (int i = 1; i < mxn; i++) { sort(required[i].begin(), required[i].end()); required[i].erase(unique(required[i].begin(), required[i].end()), required[i].end()); bit[i] = vector<int>(required[i].size() + 1, 0); } for (int i = 1; i <= n; i++) { x = arr[i]; int curr = 0; while (x != 1) { int p = sp[x]; while (p == sp[x]) x /= p; curr = max(curr, 1 + ask(p, arr[i])); } ret = max(ret, curr); x = arr[i]; while (x != 1) { int p = sp[x]; while (p == sp[x]) x /= p; update(p, arr[i], curr); } } printf( %d n , ret); }
#include <bits/stdc++.h> const long long mod9 = 1e9 + 7; const long long maxsize = 2e9 + 1; const long long mod = 998244353; const long long mod2 = 1073741824; using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; vector<long long> a(n); long long temp_len = 0; long long max_len = 2; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 2; i < n; i++) { if (a[i] == (a[i - 1] + a[i - 2])) { temp_len = 3; i++; while (a[i] == (a[i - 1] + a[i - 2]) and i < n) { temp_len++; i++; } if (temp_len > max_len) max_len = temp_len; } } if (n < max_len) max_len = n; cout << max_len; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int a; priority_queue<long long int> o, e; for (long long int i = 0; i < n; i++) { cin >> a; if (a % 2 == 0) e.push(a); else o.push(a); } if (e.size() == o.size()) { cout << 0; return 0; } long long int mi = min(e.size(), o.size()); if (e.size() == mi) { for (long long int i = 0; i < mi; i++) e.pop(); for (long long int i = 0; i < mi + 1; i++) o.pop(); } else { for (long long int i = 0; i < mi; i++) o.pop(); for (long long int i = 0; i < mi + 1; i++) e.pop(); } long long int sum = 0; while (!e.empty()) { sum += e.top(); e.pop(); } while (!o.empty()) { sum += o.top(); o.pop(); } cout << sum; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long double PI = 4 * atan(1); pair<int, int> p[3]; set<pair<int, int> > second; bool cmp(pair<int, int> p1, pair<int, int> p2) { return p1.second > p2.second; } int main() { ios::sync_with_stdio(0), cin.tie(0); for (int i = 0; i < 3; i++) { cin >> p[i].first >> p[i].second; second.insert(p[i]); } sort(p, p + 3, cmp); while (p[2].second != p[1].second) { p[2].second++; second.insert(p[2]); } sort(p, p + 3, cmp); while (p[0].first != p[2].first) { if (p[0].first > p[2].first) p[2].first++; else p[2].first--; second.insert(p[2]); } while (p[0].first != p[1].first) { if (p[0].first > p[1].first) p[1].first++; else p[1].first--; second.insert(p[1]); } p[1] = p[2]; while (p[2].second != p[0].second) { p[2].second++; second.insert(p[2]); } cout << second.size() << n ; for (pair<int, int> p1 : second) { cout << p1.first << << p1.second << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxm = 3e6 + 7; const int maxn = 2e5 + 7; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; deque<int> q; int n, ans = 0; bool judge[maxn]; int num[maxn], sum[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); ; cin >> n; memset(judge, false, sizeof judge); for (int i = 1; i <= n; i++) { cin >> num[i]; sum[num[i]]++; } for (int i = 1; i <= n; i++) if (!sum[i]) q.push_back(i); for (int i = 1; i <= n; i++) { if (sum[num[i]] > 1 && num[i] < q.front() && !judge[num[i]]) { judge[num[i]] = true; continue; } if (sum[num[i]] > 1) { sum[num[i]]--; num[i] = q.front(); q.pop_front(); ans++; } } cout << ans << endl; for (int i = 1; i <= n; i++) cout << num[i] << ; return cout << endl, 0; }
#include <bits/stdc++.h> using namespace std; int a[7001][2], cnt[7001][2], p[2], n, b[7001][2], r, o; queue<pair<int, int> > h; bool f[7001][2]; int main() { scanf( %d , &n); scanf( %d , &p[0]); for (int i = 0; i < p[0]; i++) scanf( %d , &b[i][0]); scanf( %d , &p[1]); for (int i = 0; i < p[1]; i++) scanf( %d , &b[i][1]); for (int i = 1; i < n; i++) cnt[i][0] = p[0], cnt[i][1] = p[1]; a[0][0] = 1; a[0][1] = 1; h.push({0, 0}); h.push({0, 1}); while (!h.empty()) { pair<int, int> tmp = h.front(); h.pop(); r = tmp.second ^ 1; f[tmp.first][tmp.second] = true; for (int j = 0; j < p[r]; j++) { o = (tmp.first - b[j][r] + n) % n; if (a[tmp.first][tmp.second] == 1) { if (!f[o][r]) a[o][r] = -1, h.push({o, r}); } else { cnt[o][r]--; if (!cnt[o][r] && !f[o][r]) a[o][r] = 1, h.push({o, r}); } } } for (int i = 1; i < n; i++) if (a[i][0] == 1) printf( Lose ); else if (a[i][0] == 0) printf( Loop ); else printf( Win ); printf( n ); for (int i = 1; i < n; i++) if (a[i][1] == 1) printf( Lose ); else if (a[i][1] == 0) printf( Loop ); else printf( Win ); printf( n ); }
#include <bits/stdc++.h> using namespace std; const int inf = 1000000007; const long long linf = 1LL << 62; const unsigned long long ulinf = 1ULL << 63; const double eps = 0.000001; const double pi = 3.14159265358979323846; template <class T> T abs(T a) { return a >= 0 ? a : -a; } template <class T> T sqr(T a) { return a * a; } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T mod(T a, T b) { return (a % b + b) % b; } template <class T> T addmod(T a, T b, T c) { return (T)mod((long long)a + b, (long long)c); } template <class T> T mulmod(T a, T b, T c) { return (T)mod((long long)a * b, (long long)c); } template <class T> T powmod(T a, T b, T c) { return (T)mod( b ? mulmod(mod(sqr((long long)powmod(a, b >> 1, c)), (long long)c), (b & 1LL) ? a : 1LL, (long long)c) : 1LL, (long long)c); } template <class T> void maxe(T &a, T b) { a = max(a, b); } template <class T> void mine(T &a, T b) { a = min(a, b); } template <class T> void mode(T &a, T b) { a = mod(a, b); } template <class T> void addmode(T &a, T b, T c) { a = addmod(a, b, c); } template <class T> void mulmode(T &a, T b, T c) { a = mulmod(a, b, c); } template <class T> void powmode(T &a, T b, T c) { a = powmod(a, b, c); } int iszero(double a) { return abs(a) <= eps; } template <class T> void getint(T &a) { a = 0; int b = 1, c = getchar(); if (c == - ) b = -1; else a = c - 48; while ((c = getchar()) != && c != n ) a = a * 10 + c - 48; a *= b; } void fileio_in_out() { freopen( .in , r , stdin); freopen( .out , w , stdout); } void fileio_txt() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } const int N = 1111; int test; int n, m, k, ans; int a[41] = {0, 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011}; const int md = inf; int main() { scanf( %d , &n); printf( %d n , addmod(powmod(2, a[n] - 1, md), -1, md)); return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 9223372036854775807LL; const long double PI = acos(-1); const int MAX_N = 1e+6; const string digits = 0123456789 ; const string alph = abcdefghijklmnopqrstuvwxyz ; void solve() { long long n, root, answer; cin >> n; for (long long i = 1; i * i <= n; i++) root = i; if (n == 1) { answer = 2; } else { if (root * root == n) { answer = 2LL * root; } else { if (root * root + root >= n) { answer = 2LL * root + 1LL; } else { answer = 2LL * (root + 1LL); } } } cout << answer << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; char s[100005]; int main() { int n; scanf( %d , &n); scanf( %s , s); s[n] = # ; for (int i = 0; i < n; i++) { if (s[i] == a || s[i] == e || s[i] == i || s[i] == o || s[i] == u || s[i] == y ) { if (s[i] == e || s[i] == o ) { int same = 1; if (i != n - 1) { if (s[i + 1] == s[i]) same++; } if (same == 2) { if (i != n - 2) { if (s[i + 2] == s[i]) { printf( %c , s[i]); for (int j = i + 2; j <= n; j++) { if (s[j] != s[i]) { i = j - 1; break; } } } else { printf( %c%c , s[i], s[i]); i++; } } else { printf( %c%c , s[i], s[i]); i++; } } else printf( %c , s[i]); } else { printf( %c , s[i]); for (int j = i + 1; j <= n; j++) { if (s[i] != s[j]) { i = j - 1; break; } } } } else printf( %c , s[i]); } }
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC target( avx ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); } f *= fu; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x < 10) putchar(x + 48); else print(x / 10), putchar(x % 10 + 48); } template <typename T> void print(T x, char t) { print(x); putchar(t); } const int N = 4005, md = 998244853; inline int add(int x, int y) { x += y; if (x >= md) x -= md; return x; } inline int sub(int x, int y) { x -= y; if (x < 0) x += md; return x; } inline int mul(int x, int y) { return 1ll * x * y % md; } inline int fpow(int x, int y) { int ans = 1; while (y) { if (y & 1) ans = mul(ans, x); y >>= 1; x = mul(x, x); } return ans; } int fac[N], inv[N]; int n, m, ans; inline int C(int n, int m) { return mul(fac[n], mul(inv[m], inv[n - m])); } int main() { read(n); read(m); fac[0] = 1; for (register int i = 1; i <= n + m; i++) fac[i] = mul(fac[i - 1], i); inv[n + m] = fpow(fac[n + m], md - 2); for (register int i = n + m; i >= 1; i--) inv[i - 1] = mul(inv[i], i); for (register int i = 1; i <= n; i++) { if (n - m >= i) ans = add(ans, C(n + m, m)); else ans = add(ans, C(n + m, i + m)); } print(ans, n ); return 0; }
#include <bits/stdc++.h> const int N = 1000; bool vis[N + 100]; int v[N + 100]; int top = 0; int n = 0; int main() { scanf( %d , &n); for (int i = 2; i <= n; i++) { if (!vis[i]) { vis[i] = true; for (int j = 0; j < n; j++) { if (!vis[j]) continue; if (i * j > n) break; if ((j % i == 0) || (i % j == 0)) continue; vis[i * j] = true; } v[top++] = i; } } printf( %d n , top); for (int i = 0; i < top; i++) { printf( %d , v[i]); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; long long min(long long a, long long b) { if (a < b) return a; else return b; } static long long gcd(long long a, long long b) { long long r; while (b != 0) { r = a % b; a = b; b = r; } return a; } long long lcm(long long a, long long b) { long long temp = gcd(a, b); return temp ? (a / temp * b) : 0; } int solve() { long long n; cin >> n; long long k; cin >> k; long long maxans = (n * (n - 1)) / 2LL; if (k > maxans) { cout << Impossible ; return 0; } long long cnt = 0; long long tmp; for (long long i = 1; i <= n; i++) { if (((i * (i - 1)) / 2LL) <= k) { tmp = i; } else { break; } } long long open = tmp; cnt = open; k = k - ((tmp * (tmp - 1)) / 2LL); string s; for (int i = 0; i < open; i++) { s.push_back( ( ); } if (open >= 1) { s.push_back( ) ); open--; } while (k > 0 && open > 0 && cnt <= n) { if (open <= k) { s.push_back( ( ); s.push_back( ) ); cnt++; k = k - open; } else { open--; s.push_back( ) ); } } if (k == 0 && cnt <= n) { for (int i = 0; i < open; i++) { s.push_back( ) ); } for (int i = 0; i < (n - cnt); i++) { s.push_back( ( ); s.push_back( ) ); } cout << s; return 0; } else { cout << Impossible ; return 0; } return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; for (int i = 1; i <= t; i++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; char str1[1000005], str2[1000005]; int cnt[3]; unsigned long long bao[1000005], base[1000005]; long long base2[1000005], da[1000005]; int main() { int n, m, i, j, ans = 0; scanf( %s , str1 + 1); scanf( %s , str2 + 1); n = strlen(str1 + 1); m = strlen(str2 + 1); base[0] = 1; base2[0] = 1; for (i = 1; i <= m; i++) { base[i] = base[i - 1] * 233; bao[i] = bao[i - 1] * 233 + str2[i] - a + 1; base2[i] = base2[i - 1] * 2333 % 1000000007; da[i] = (da[i - 1] * 2333 + str2[i] - a + 1) % 1000000007; } for (i = 1; i <= n; i++) { cnt[str1[i] - 0 ]++; } int f = str1[1] - 0 ; for (i = 1; i <= m / cnt[f]; i++) { int w = m - cnt[f] * i; if (w % cnt[1 - f] != 0 || w == 0) continue; w /= cnt[1 - f]; unsigned long long a1 = bao[i], a2 = 114514; long long b1 = da[i], b2 = 114514; int now = i; for (j = 2; j <= n; j++) { if (str1[j] == f + 0 ) { if (a1 != bao[now + i] - bao[now] * base[i]) break; if (b1 != (da[now + i] - 1LL * da[now] * base2[i] % 1000000007 + 1000000007) % 1000000007) break; now += i; } else { if (a2 == 114514 && b2 == 114514) { a2 = bao[now + w] - bao[now] * base[w]; b2 = (da[now + w] - 1LL * da[now] * base2[w] % 1000000007 + 1000000007) % 1000000007; } else { if (a2 != bao[now + w] - bao[now] * base[w]) break; if (b2 != (da[now + w] - 1LL * da[now] * base2[w] % 1000000007 + 1000000007) % 1000000007) break; } now += w; } } if (j > n) { if (a1 != a2 && b1 != b2) ans++; } } cout << ans << endl; }
#include <bits/stdc++.h> #define int long long using pii=std::pair<int,int>; using namespace std; const int maxn = 2e5 + 5; int n, u, v, a[maxn], in[maxn], out[maxn], order[maxn], timer = -1, st[4 * maxn], need[4 * maxn]; vector<int> adj[maxn]; map<int, vector<int>> avals; void dfs(int x, int p) { in[x] = ++timer; order[timer] = x; avals[a[x]].push_back(x); for(auto v : adj[x]) if(v != p) dfs(v, x); out[x] = timer; } int is_ancestor(int u, int v) { return (in[u] <= in[v] && out[u] >= out[v]); } void build(int tl, int tr, int v) { if(tl == tr) st[v] = 1; else { int tmid = (tl + tr) / 2; build(tl, tmid, 2 * v); build(tmid + 1, tr, 2 * v + 1); st[v] = 1; } } void push(int v) { if(need[v]) { st[2 * v] = st[2 * v + 1] = st[v]; need[2 * v] = need[2 * v + 1] = need[v]; need[v] = 0; } } void update(int tl, int tr, int l, int r, int v, int val) { if(l > r) return; if(tl == l && tr == r) { st[v] = val; need[v] = 1; } else { push(v); int tmid = (tl + tr) / 2; update(tl, tmid, l, min(r, tmid), 2 * v, val); update(tmid + 1, tr, max(l, tmid + 1), r, 2 * v + 1, val); } } int get(int tl, int tr, int v, int pos) { if(tl == tr) { assert(tl == pos); return st[v]; } else { push(v); int tmid = (tl + tr) / 2; if(pos <= tmid) return get(tl, tmid, 2 * v, pos); else return get(tmid + 1, tr, 2 * v + 1, pos); } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n - 1; i++) { cin >> u >> v; u--; v--; adj[u].push_back(v); adj[v].push_back(u); } dfs(0, -1); build(0, n - 1, 1); for(auto x : avals) if(x.second.size() > 1) { for(int i = 0; i < x.second.size(); i++) { int pre = x.second[i]; int cur = x.second[(i + 1) % x.second.size()]; if(is_ancestor(cur, pre)) swap(cur, pre); if(is_ancestor(pre, cur)) { int pathchild = -1; for(auto v : adj[pre]) if(is_ancestor(v, cur) && !is_ancestor(v, pre)) { pathchild = v; break; } assert(pathchild != -1); update(0, n - 1, 0, in[pathchild] - 1, 1, 0); update(0, n - 1, out[pathchild] + 1, n - 1, 1, 0); update(0, n - 1, in[cur], out[cur], 1, 0); } else { update(0, n - 1, in[cur], out[cur], 1, 0); update(0, n - 1, in[pre], out[pre], 1, 0); } } } int ans = 0; for(int i = 0; i < n; i++) ans += get(0, n - 1, 1, i); cout << ans << n ; return 0; }
#include <bits/stdc++.h> #pragma GCC target( avx ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using std::cin; using std::cout; using std::lower_bound; using std::string; using std::upper_bound; using std::vector; using vi = vector<long long>; using vii = vector<vi>; using pii = std::pair<long long, long long>; constexpr long long MOD = 998244353; constexpr long long MAX = 1e7; constexpr long long INF = (1ll << 62); template <class T> class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> { }; template <typename T> struct Segment_tree { long long N; T mem; vector<T> node; Segment_tree(vector<T> &X, T m) : mem(m) { long long sz = X.size(); N = 1; while (N < sz) N *= 2; node.resize(2 * N - 1, mem); for (int i = (int)(0); i < (int)(sz); i++) node[N - 1 + i] = X[i]; for (int i = (int)(N - 2); (int)(0) <= i; i--) { node[i] = Compare(node[i * 2 + 1], node[i * 2 + 2]); } } T Compare(T &A, T &B) { return std::max(A, B); } void update(long long X, T val) { X += N - 1; node[X] = val; while (X > 0) { X = (X - 1) / 2; node[X] = Compare(node[X * 2 + 1], node[X * 2 + 2]); } } T Query(long long a, long long b, long long now, long long l, long long r) { if (r < 0) r = N; if (r <= a || b <= l) return mem; if (a <= l && r <= b) return node[now]; auto vl = Query(a, b, now * 2 + 1, l, (l + r) / 2), vr = Query(a, b, now * 2 + 2, (l + r) / 2, r); return Compare(vl, vr); } }; struct Binary_indexed_tree { int N; vi bit; Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); } void add(int x, int a) { for (x; x <= N; x += (x & -x)) bit[x] += a; } long long sum(int x) { long long ret = 0; for (x; x > 0; x -= (x & -x)) ret += bit[x]; return ret; } long long lower_bound(long long X) { if (sum(N) < X) return -1; long long ret = 0, memo = 1, sum = 0; while (memo * 2 <= N) memo *= 2; while (memo > 0) { if (memo + ret <= N && sum + bit[memo + ret] < X) { sum += bit[memo + ret]; ret += memo; } memo /= 2; } return ret + 1; } }; struct Union_Find { long long N; vi par; vi siz; Union_Find(int n) : N(n) { par.resize(N); siz.resize(N, 1); for (int i = (int)(0); i < (int)(N); i++) par[i] = i; } long long root(long long X) { if (par[X] == X) return X; return par[X] = root(par[X]); } bool same(long long X, long long Y) { return root(X) == root(Y); } void unite(long long X, long long Y) { X = root(X); Y = root(Y); if (X == Y) return; par[X] = Y; siz[Y] += siz[X]; siz[X] = 0; } long long size(long long X) { return siz[root(X)]; } }; long long modpow(long long a, long long n, long long mod) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } vi fac, finv, inv; void COMinit() { fac.resize(MAX); finv.resize(MAX); inv.resize(MAX); fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } long long COM(long long n, long long r) { if (n < r || n < 0 || r < 0) return 0; return fac[n] * finv[r] % MOD * finv[n - r] % MOD; } long long modinv(long long a, long long m) { long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } u %= m; if (u < 0) u += m; return u; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); long long T; cin >> T; while (T--) { long long N; cin >> N; vi A(N); for (int i = (int)(0); i < (int)(N); i++) cin >> A[i]; vii sum(N + 1, vi(27)); for (int i = (int)(0); i < (int)(N); i++) { for (int j = (int)(0); j < (int)(27); j++) sum[i + 1][j] = sum[i][j]; sum[i + 1][A[i]]++; } long long ans = 0; for (int i = (int)(1); i <= (int)(N); i++) { for (int j = (int)(0); j < (int)(i); j++) { long long memo = 0; for (int k = (int)(0); k < (int)(27); k++) memo = std::max(memo, sum[i][k] - sum[j][k]); for (int k = (int)(0); k < (int)(27); k++) { ans = std::max(ans, std::min(sum[j][k], sum[N][k] - sum[i][k]) * 2 + memo); } } } cout << ans << n ; } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; int n, m, k; int x[MAXN], y[MAXN]; void read_input() { cin >> n >> m >> k; for (int i = 0; i < k; i++) { cin >> x[i] >> y[i]; } } const int INF = 1e9; int pref[2][MAXN]; void update(int x, int val) { for (int i = x; i <= m; i += (i & -i)) { pref[0][i] = min(pref[0][i], val); } } int query(int r) { int ans = INF; for (int i = r; i > 0; i -= (i & -i)) { ans = min(ans, pref[0][i]); } return ans; } void update2(int x, int val) { for (int i = x; i <= m; i += (i & -i)) { pref[1][i] = max(pref[1][i], val); } } int query2(int r) { int ans = 0; for (int i = r; i > 0; i -= (i & -i)) { ans = max(ans, pref[1][i]); } return ans; } int mi_y[MAXN], ma_y[MAXN]; void solve() { for (int i = 0; i <= m; i++) { mi_y[i] = INF; ma_y[i] = 0; pref[0][i] = INF; pref[1][i] = 0; } bool fl = true; for (int i = 0; i < k; i++) { if (fl) { int tmpX = (x[i] + 1) / 2; int tmpY = (y[i] + 1) / 2; if (x[i] % 2 == 1) { mi_y[tmpY] = min(mi_y[tmpY], tmpX); update(tmpY, mi_y[tmpY]); } int rev = m - tmpY + 1; if (x[i] % 2 == 0) { ma_y[rev] = max(ma_y[rev], tmpX); update2(rev, ma_y[rev]); } if (query(tmpY) <= query2(rev)) { fl = false; } } if (!fl) { cout << NO n ; } else { cout << YES n ; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); read_input(); solve(); return 0; }
#include <iostream> #include <cmath> using namespace std; typedef long long int ll; int main(){ int cases; ll num; double temp; cin >> cases; bool cube = false; for(int a = 0; a < cases; a++){ cin >> num; cube = false; for(ll b = max(int(cbrt(double(num/2))), 1); b < cbrt(num) && cube == false; b++){ temp = cbrt(num - pow(b, 3)); if(abs(temp - int(temp)) < pow(10, -9)) cube = true; } printf(cube ? YES n : NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename... T> void see(T&... args) { ((cin >> args), ...); } template <typename... T> void put(T&&... args) { ((cout << args << ), ...); cout << n ; } void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << , ; err(++it, args...); } const long long inf = INT_MAX; const long double ep = 0.0000001; const long double pi = acos(-1.0); const long long md = 1000000007; vector<string> add = { 1869 , 1968 , 6918 , 6198 , 1698 , 1986 , 1896 }; void solve() { string s; see(s); long long a = 0, b = 0, c = 0, d = 0; string s1 = ; for (long long i = 0; i < s.size(); ++i) { if (s[i] == 1 && !a) { a = 1; } else if (s[i] == 6 && !b) { b = 1; } else if (s[i] == 8 && !c) { c = 1; } else if (s[i] == 9 && !d) { d = 1; } else s1 += s[i]; } long long s3; for (long long j = 0; j < 7; ++j) { s3 = j; for (long long i = 0; i < s1.size(); ++i) { s3 = (s3 * 10 + (s1[i] - 0 )) % 7; } if (s3 == 0) { s3 = j; break; } } s1 = add[s3] + s1; cout << s1; } signed main() { ios_base::sync_with_stdio(false); solve(); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int s, v = 0; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 0; i < n - 1; i++) { if (arr[i] > arr[i + 1]) { s = i + 1; v++; } } if (arr[n - 1] > arr[0]) { s = n; v++; } if (v == 0) cout << 0 << endl; else { if (v > 1) cout << -1 << endl; else cout << n - s << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string t1, t2, t3, t4; cin >> t1 >> t2 >> t3 >> t4; string b = t1 + t2[1] + t2[0], e = t3 + t4[1] + t4[0]; b.erase(b.find( X ), 1); e.erase(e.find( X ), 1); for (int i = 0; i < 3; ++i) { string a1 = e.substr(i); string a2 = e.substr(0, i); if (b == a1 + a2) { cout << YES << endl; return 0; } } cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for (typename map<T0, T1>::const_iterator p = v.begin(); p != v.end(); p++) { os << p->first << : << p->second << ; } return os; } template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << : << v.second << ; return os; } template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << endl; } return os; } template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << ; } return os; } template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; } template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; } int main() { long long N, M; while (cin >> N >> M) { long long lo = 1, hi = M + 1; while (lo + 1 < hi) { long long mid = (lo + hi) / 2; long long edges = mid * (mid - 1) / 2; if (mid % 2 == 0 && mid - 2 > 0) edges += (mid - 2) / 2; if (edges <= N - 1) lo = mid; else hi = mid; } vector<long long> w(M); for (int i = 0, _n = (M); (i) < (int)_n; ++i) { long long v; cin >> v >> w[i]; } sort((w).rbegin(), (w).rend()); cout << accumulate(&w[0], &w[lo], 0) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string st, st1; cin >> st >> st1; if (st == st1) { cout << st << endl; } else { cout << 1 << endl; } }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; long long n, p; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long te; cin >> te; while (te--) { cin >> n >> p; vector<pair<long long, long long> > ans; for (long long i = 1; i <= n; i++) { for (long long j = i + 1; j <= n; j++) { ans.push_back({i, j}); } } for (long long i = 0; i < 2 * n + p; i++) cout << ans[i].first << << ans[i].second << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795; const long double eps = 0.000000001; const int INF = 1E9; const int MAXN = 100000; int ans, a[2], mn; string s[2]; char c; bool f[2]; int getn(char c) { return ( 0 <= c && c <= 9 ) ? (c - 0 ) : (c - A + 10); } int main() { c = getchar(); while (c != : ) { s[0] += c; c = getchar(); } cin >> s[1]; for (int k = 0; k < (int)(2); k++) for (int i = 0; i < (int)(s[k].size() - 1); i++) if (s[k][i] != 0 ) f[k] = 1; if (f[0] || f[1]) { f[0] = 1; for (int i = (int)(2); i <= (int)(60); i++) { f[1] = 1; for (int j = 0; j < (int)(2); j++) { mn = 1; a[j] = 0; for (int k = (int)(s[j].size()) - 1; k >= 0; k--) { if (getn(s[j][k]) >= i) f[1] = 0; a[j] += mn * getn(s[j][k]); mn *= i; } } if (f[1] && a[0] <= 23 && a[1] <= 59) { cout << i << ; f[0] = 0; } } if (f[0]) cout << 0 << endl; } else { if (getn(s[0][s[0].size() - 1]) <= 23) cout << -1; else cout << 0; } return 0; }
#include <bits/stdc++.h> using namespace std; int t, n; string s; int main() { cin >> t; for (int tc = 0; tc < t; ++tc) { cin >> n >> s; int res = n - 1; for (int i = 0; i < n; ++i) if (s[i] == > || s[n - 1 - i] == < ) res = min(res, i); cout << res << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main(int, char**) { ios_base::sync_with_stdio(0); cin.tie(0); string s; cin >> s; ; int k; cin >> k; ; int out = 0; long long d = 1; for (int i = 0; i < k; i++) { d *= 10; } while (atoi(s.c_str()) % d != 0) { for (string::reverse_iterator i = s.rbegin(); i != s.rend(); i++) { if (*i != 0 ) { s.erase((i.base()) - 1); out++; break; } } } if (atoi(s.c_str()) == 0) { out += s.length() - 1; } cout << out << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int in[201000]; int main() { int n; scanf( %d , &n); for (int i = 0; i < (n); i++) { scanf( %d , &in[i]); in[i] += i; } sort(in, in + n); for (int i = 0; i < (n - 1); i++) { if (in[i] == in[i + 1]) { puts( :( ); return 0; } } for (int i = 0; i < (n); i++) printf( %d%c , in[i] - i, ((i == n - 1) ? n : )); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); const int maxn = 1e6 + 5e5; vector<int> pr(maxn); iota(pr.begin(), pr.end(), 0); for (long long i = 2; i < maxn; ++i) if (pr[i] == i) for (long long j = i * i; j < maxn; j += i) pr[j] = i; vector<bool> good(maxn, true); good[0] = good[1] = false; auto fill = [&](int x) { while (x > 1) { int p = pr[x]; while (x % p == 0) x /= p; if (good[p]) for (int x = p; x < maxn; x += p) good[x] = false; } }; bool ok = true; int n; cin >> n; for (int i = 0; i < n; ++i) { int x; cin >> x; if (!ok) continue; if (good[x]) { cout << x << n [i + 1 == n]; fill(x); } else { ok = false; while (!good[x]) ++x; cout << x << n [i + 1 == n]; fill(x); for (int j = i + 1, p = 2; j < n; ++j) { while (!good[p]) ++p; cout << p << n [j + 1 == n]; fill(p); } } } return 0; }
#include <bits/stdc++.h> using std::cin; using std::cout; using std::string; using std::vector; static const int MOD = 1000000000 + 7; static long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); } int read_int() { int x = 0, c = 0; c = getchar(); while (c <= 32) c = getchar(); while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x; } static const int N = 300000 + 8; static const int SH = 20; int n, c1, c2; int dep[N], fa[N][SH], p1[N], p2[N]; int lca(int a, int b) { if (dep[a] < dep[b]) ::std::swap(a, b); int dif = dep[a] - dep[b]; for (int i = 0; (1 << i) <= dif; i++) { if (dif & (1 << i)) a = fa[a][i]; } if (a == b) return a; for (int i = SH - 1; i >= 0; i--) { if (fa[a][i] ^ fa[b][i]) { a = fa[a][i]; b = fa[b][i]; } } return fa[a][0]; } int get(int a, int b) { return dep[a] + dep[b] - 2 * dep[lca(a, b)]; } int solve() { int mx = 0; n = read_int(); p1[++c1] = 1; for (int i = 2; i <= n + 1; i++) { int pos = read_int(); fa[i][0] = pos; dep[i] = dep[pos] + 1; for (int j = 1; (1 << j) <= dep[i]; j++) { fa[i][j] = fa[fa[i][j - 1]][j - 1]; } int d1 = (c1 == 0 ? 0 : get(p1[1], i)); int d2 = (c2 == 0 ? 0 : get(p2[1], i)); if (d1 > mx) { for (int j = 1; j <= c2; j++) { if (get(p2[j], i) == d1) { p1[++c1] = p2[j]; } } c2 = 1; p2[1] = i; } else if (d2 > mx) { for (int j = 1; j <= c1; j++) { if (get(p1[j], i) == d2) { p2[++c2] = p1[j]; } } c1 = 1; p1[1] = i; } else if (d1 == mx) p2[++c2] = i; else if (d2 == mx) p1[++c1] = i; mx = ::std::max(mx, ::std::max(d1, d2)); printf( %d n , c1 + c2); } return 0; } int main(int argc, char* argv[]) { ::std::ios::sync_with_stdio(false); ::std::cin.tie(0); ::std::cout.tie(0); int test_count = 1; while (test_count--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int n = a + b + 1; int A[100000] = {0}; int x = n - a; for (int i = 0; i < a + 1; i++) { A[i] = x; x++; } x = n - a - 1; for (int i = a + 1; i < n; i++) { A[i] = x; x--; } for (int i = 0; i < n; i++) cout << A[i] << ; cout << endl; }
#include <bits/stdc++.h> using namespace std; void solve() { long long int a, b, c, d, m, n, p, q, r, x, y, z, aa, bb, cc, dd; double pp, qq, rr, xx, yy, zz; char ch1, ch2, ch3, ch4, ch5; long long int i, j, k, l; long long int cnt = 0, cnt1 = 0, cnt2 = 0, cnt3 = 0, sum = 0, sum2 = 0, mx = LLONG_MIN, mn = LLONG_MAX; long long int flag = 0, flag2 = 0; vector<long long int> vec1, vec2, vec3; string s1, s2, s3; cin >> n; for (long long int i = (long long int)(0); i < (long long int)(n); ++i) { cin >> x; vec1.push_back(x); } for (long long int i = (long long int)(0); i < (long long int)(n); ++i) { cin >> x; vec2.push_back(x); } if (n == 1) { cout << 0 n ; return; } for (long long int i = (long long int)(n - 1); i >= (long long int)(0); --i) { sum += vec1[i]; vec1[i] = sum; } sum = 0; for (long long int i = (long long int)(0); i < (long long int)(n); ++i) { sum += vec2[i]; vec2[i] = sum; } for (long long int i = (long long int)(0); i < (long long int)(n - 2); ++i) { mx = max(vec2[i], vec1[i + 2]); mn = min(mn, mx); } mn = min(mn, vec1[1]); mn = min(mn, vec2[n - 2]); cout << mn << endl; } int main() { ios::sync_with_stdio(false); long long int t = 1; cin >> t; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> int main() { char s1[3000][11], s2[3000][10], s3[3000][11]; int m, n, i, j, k; int len1, len2; scanf( %d %d , &m, &n); for (i = 0; i < n; i++) { scanf( %s , &s1[i]); gets(s2[i]); } for (i = 0; i < m - 1; i++) { scanf( %s , &s3[i]); } gets(s3[m - 1]); for (i = 0; i < m; i++) { for (j = 0; j < n; j++) { if (strcmp(s3[i], s1[j]) == 0 || strcmp(s3[i], s2[j]) == 0) { len1 = strlen(s1[j]); len2 = strlen(s2[j]); if (len1 < len2) { k = 0; while (s1[j][k]) { printf( %c , s1[j][k]); k++; } printf( ); } else if (len1 == len2) { k = 0; while (s1[j][k]) { printf( %c , s1[j][k]); k++; } printf( ); } else { k = 0; while (s2[j][k]) { printf( %c , s2[j][k]); k++; } printf( ); } } } } return 0; }
#include <bits/stdc++.h> int main(void) { int i, j, k, m, n, mm[110][110]; mm[0][0] = mm[1][0] = 0; mm[1][1] = 1; mm[0][1] = 2; for (i = 2; i <= 100; i++) { if (i == 2) k = 5; for (j = 0; j <= i; j++) mm[i][j] = k; for (j = i - 1; j >= 0; j--) mm[j][i] = k + 1; k = mm[i][0] + 4; } while (scanf( %d%d , &i, &j) != EOF) { if (i >= 0 && j >= 0) printf( %d n , mm[i][j]); else if (i == -1 && j == 0) printf( 3 n ); else if (i < 0) { if (j > -i) printf( %d n , mm[-i][j]); else if (j == -i) printf( %d n , mm[-i][j] + 1); else if (j >= 0) printf( %d n , mm[-i][j] + 2); else printf( %d n , mm[-i][-j] + 2); } else { if (i < -j) printf( %d n , mm[i][-j] + 2); else if (i == -j) printf( %d n , mm[i][-j] + 3); else if (i == -j + 1) printf( %d n , mm[i][-j] - 1); else printf( %d n , mm[i][-j]); } } return 0; }
#include <bits/stdc++.h> const long long int mx = 1e9 + 7; using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int n, t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector<pair<int, int>> vp, vpAns; map<int, int> mp, mpAns, mpCnt; int A[n + 2], x = n / k; for (int i = 0; i < n; i++) { cin >> A[i]; vp.push_back(make_pair(A[i], i)); } sort(vp.begin(), vp.end()); int cnt = 0, cn = 0; for (int i = 0; i < n; i++) { int a = vp[i].first, b = vp[i].second; mp[a]++; if (mp[a] > k) { vpAns.push_back(make_pair(b, 0)); continue; } cnt++; vpAns.push_back(make_pair(b, cnt)); mpCnt[cnt]++; if (cnt == k) cnt = 0; } int mn = 10000000; for (auto u : mpCnt) { mn = min(mn, u.second); } sort(vpAns.begin(), vpAns.end()); for (int i = 0; i < vpAns.size(); i++) { int b = vpAns[i].second; mpAns[b]++; if (mpAns[b] > mn) cout << 0 << ; else cout << vpAns[i].second << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; const int mod = 1e9 + 7; int t; int n; int m; long long p[maxn]; int size[maxn]; vector<int> g[maxn]; void dfs(int u, int pre) { size[u] = 1; for (int v : g[u]) { if (v == pre) continue; dfs(v, u); size[u] += size[v]; } } struct node { long long x, y; bool operator<(const node &r) const { return (long long)x * y > (long long)r.x * r.y; } } Node[maxn]; bool cmp(int x, int y) { return x > y; } int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); for (int i = 1; i <= n; i++) g[i].clear(); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); g[x].push_back(y); g[y].push_back(x); } scanf( %d , &m); for (int i = 1; i <= m; i++) scanf( %lld , p + i); sort(p + 1, p + m + 1, cmp); dfs(1, 0); int tot = 0; for (int i = 2; i <= n; i++) Node[++tot] = {(long long)n - size[i], (long long)size[i]}; sort(Node + 1, Node + tot + 1); long long ans = 0; if (n - 1 >= m) { for (int i = 1; i <= m; i++) { ans += (long long)p[i] * Node[i].x * Node[i].y; ans %= mod; } for (int i = m + 1; i <= tot; i++) { ans += (long long)Node[i].x * Node[i].y; ans %= mod; } } else { long long tt = 1; for (int i = 1; i <= (m - n + 2); i++) { tt *= p[i]; tt %= mod; } ans += (long long)tt * Node[1].x % mod * Node[1].y; ans %= mod; for (int i = m - n + 3; i <= m; i++) { ans += (long long)p[i] * Node[i - (m - n + 1)].x * Node[i - (m - n + 1)].y; ans %= mod; } } printf( %lld n , ans); } }
#include <bits/stdc++.h> using namespace std; int S[100009], cnt[1 << 7], num[1 << 7]; char s[100009]; int len, n, nu; inline long long rd() { long long x = 0; char c = getchar(); bool f = 0; while (!isdigit(c)) { if (c == - ) f = 1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return f ? -x : x; } int main() { scanf( %s , s + 1); len = strlen(s + 1); int x; int maxn = (1 << 6) - 1; for (int i = 1; i <= len; ++i) { int x = s[i] - a ; for (int j = 1; j <= maxn; ++j) if (j & (1 << x)) cnt[j]++; } n = rd(); for (int i = 1; i <= n; ++i) { x = rd(); scanf( %s , s + 1); int xx = strlen(s + 1); for (int j = 1; j <= xx; ++j) S[x] |= (1 << (s[j] - a )); for (int j = 1; j <= maxn; ++j) if ((j & S[x]) == S[x]) num[j]++; } for (int i = 1; i <= len; ++i) if (!S[i]) { S[i] = maxn; num[S[i]]++; } for (int i = 1; i <= len; ++i) { bool tag = 0; for (int j = 0; j < 6; ++j) if ((1 << j) & S[i]) { bool tg = 0; for (int k = 1; k <= maxn; ++k) { int x = (k & (1 << j)) ? cnt[k] - 1 : cnt[k], y = ((k & S[i]) == S[i]) ? num[k] - 1 : num[k]; if (x < y) { tg = 1; break; } } if (!tg) { tag = 1; s[++nu] = j + a ; for (int k = 1; k <= maxn; ++k) { if ((1 << j) & k) cnt[k]--; if ((S[i] & k) == S[i]) num[k]--; } break; } } if (!tag) { puts( Impossible ); return 0; } } for (int i = 1; i <= nu; ++i) printf( %c , s[i]); return 0; }
#include <bits/stdc++.h> long long nmax[11] = {0, 9, 99, 999, 9999, 99999, 999999, 9999999, 99999999, 999999999, 9999999999LL}; long long P[11][11]; long long cnt[11][11][11], C[11][11], totalcnt[11][11], tmp; long long nsel[11][11][11][11][11], fact[11], nways; int N, x, y, len, i, j, jstart, nx, ny, cnx, cny, difx, dify, nextx, nexty; void ComputeComb() { int i, j; C[0][0] = 1; for (i = 1; i < 11; i++) { C[i][0] = 1; for (j = 1; j <= i; j++) { C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007; } } } inline int extended_gcd(long long A, long long B, long long &X, long long &Y) { if (B == 0) { X = 1; Y = 0; return A; } long long X0, Y0, D; D = extended_gcd(B, A % B, X0, Y0); X = Y0; Y = X0 - (A / B) * Y0; return D; } long long inv[11]; void ComputeInv() { long long garbage; for (int i = 1; i < 11; i++) { extended_gcd(i, 1000000007, inv[i], garbage); inv[i] %= 1000000007; while (inv[i] < 0) inv[i] += 1000000007; } } void ComputeFact() { fact[0] = 1; for (int i = 1; i < 11; i++) { fact[i] = (fact[i - 1] * i) % 1000000007; } } void ComputeP() { int i, j; for (i = 0; i < 11; i++) { P[i][0] = 1; for (j = 1; j < 11; j++) P[i][j] = (P[i][j - 1] * i) % 1000000007; } } int digits[11], ndigits; void GetN(int N) { ndigits = 0; while (N > 0) { digits[ndigits] = N % 10; N /= 10; ndigits++; } } long long totalcnt2[11][11]; void TestBruteForce() { int x, y, i, j; for (i = 1; i <= N; i++) { x = y = 0; j = i; while (j > 0) { if (j % 10 == 4) x++; else if (j % 10 == 7) y++; j /= 10; } totalcnt2[x][y]++; } for (x = 0; x < 11; x++) for (y = 0; y < 11; y++) if (totalcnt[x][y] != totalcnt2[x][y]) { fprintf(stderr, !!! x=%d y=%d: %I64d %I64d n , x, y, totalcnt[x][y], totalcnt2[x][y]); } } int main() { ComputeComb(); ComputeInv(); ComputeFact(); ComputeP(); scanf( %d , &N); GetN(N); for (len = 1; len < 11; len++) for (x = 0; x < 11 && x <= len; x++) for (y = 0; y < 11 && x + y <= len; y++) { cnt[len][x][y] = 0; if (len < ndigits) { if (x == 0 && y == 0) tmp = P[8][len] % 1000000007; else { tmp = (C[len][x] * C[len - x][y]); tmp = (tmp * P[8][len - x - y]); } cnt[len][x][y] = tmp; } else if (len == ndigits) { nx = ny = 0; for (i = ndigits - 1; i >= 0; i--) { if (i == ndigits - 1) jstart = 1; else jstart = 0; for (j = jstart; j < digits[i]; j++) { cnx = nx; cny = ny; if (j == 4) cnx++; else if (j == 7) cny++; if (cnx <= x && cny <= y) { difx = x - cnx; dify = y - cny; if (difx == 0 && dify == 0) cnt[len][x][y] = (cnt[len][x][y] + P[8][i]); else cnt[len][x][y] = (cnt[len][x][y] + cnt[i][difx][dify]); } } if (digits[i] == 4) nx++; else if (digits[i] == 7) ny++; } if (nx == x && ny == y) cnt[len][x][y]++; } if (len >= ndigits - 1) { totalcnt[x][y] += cnt[len][x][y]; if (x == 0 && y == 0 && len == ndigits - 1) totalcnt[x][y]--; } } for (x = 0; x < 11; x++) for (y = 0; y < 11; y++) if (totalcnt[x][y] > 0) { } nways = 1; for (i = 0; i <= 6; i++) { if (i > 0) { nways = (nways * (totalcnt[0][0] - i + 1)) % 1000000007; nways = (nways * inv[i]) % 1000000007; } nsel[0][0][0][0][i] = nways; } for (x = 0; x < 11; x++) for (y = 0; y < 11; y++) for (nx = 0; nx < 11; nx++) for (ny = 0; ny < 11; ny++) for (i = 0; i <= 6; i++) if (nsel[x][y][nx][ny][i] > 0) { cnx = x; cny = y + 1; if (cny >= 11) { cnx++; cny = 0; } if (cnx >= 11) break; nways = 1; for (j = 0; j <= 6; j++) { nextx = nx + j * cnx; nexty = ny + j * cny; if (nextx >= 11 || nexty >= 11 || i + j > 6) break; if (j > 0) { nways = (nways * (totalcnt[cnx][cny] - j + 1)) % 1000000007; nways = (nways * inv[j]) % 1000000007; } tmp = (nways * nsel[x][y][nx][ny][i]) % 1000000007; nsel[cnx][cny][nextx][nexty][i + j] = (nsel[cnx][cny][nextx][nexty][i + j] + tmp) % 1000000007; } } long long answer = 0; for (x = 0; x < 11; x++) for (y = 0; y < 11; y++) for (nx = 0; nx < 11; nx++) for (ny = 0; ny < 11; ny++) if (nx + ny < x + y) { tmp = totalcnt[x][y]; tmp = (tmp * nsel[11 - 1][11 - 1][nx][ny][6]) % 1000000007; answer = (answer + tmp) % 1000000007; } printf( %I64d n , (answer * fact[6]) % 1000000007); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, n; cin >> a >> b >> n; cout << min(b, n) - n + min(a, n) + 1 << n ; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int a[n]; vector<int> ans; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); ans.push_back(a[0]); for (int i = 1; i < n; i++) { if (a[i] != ans.back()) ans.push_back(a[i]); } bool got = false; int len = ans.size(); for (int i = 0; i < len - 2; i++) { if ((ans[i + 1] - ans[i] < 3 && ans[i + 2] - ans[i] < 3 && ans[i + 2] - ans[i + 1] < 3)) { got = true; break; } } cout << (got ? YES n : NO n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int cnt = 0, count = 0; for (int i = 0; i < n; i++) { if (s[i] == 8 ) cnt++; } while (cnt) { n = n - 1; cnt = cnt - 1; if (n / 10 > 0) { count++; n = n - 10; } } cout << count; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 50, mo = 998244353; int head[N], nn[N << 1][2], cnt; void link(int u, int v) { nn[++cnt][1] = v, nn[cnt][0] = head[u], head[u] = cnt; nn[++cnt][1] = u, nn[cnt][0] = head[v], head[v] = cnt; return; } int f[N][3]; void dfs(int x, int fa) { f[x][0] = 1; for (int i = head[x], y; i; i = nn[i][0]) if ((y = nn[i][1]) != fa) { dfs(y, x); int s1 = f[x][1], s2 = f[x][2]; f[x][1] = (1ll * (f[x][0] + s2) * (f[y][0] + f[y][2]) % mo + 2ll * s1 * f[y][1] % mo + 1ll * s1 * f[y][0]) % mo; f[x][2] = (2ll * s2 * f[y][1] + 1ll * f[x][0] * f[y][1] + 1ll * s2 * f[y][0]) % mo; f[x][0] = 1ll * f[x][0] * (f[y][0] + f[y][1]) % mo; } return; } int main() { int n, u, v; cin >> n; for (int i = 1; i < n; ++i) scanf( %d%d , &u, &v), link(u, v); dfs(1, 0); cout << (f[1][0] + f[1][1]) % mo; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long m, x, p[22], a[22], b[22], len, res = 1; map<long long, int> Map[22]; inline void init(long long n) { for (register long long i = 2; i * i <= n; i++) if (n % i == 0) { len++; p[len] = i; while (n % i == 0) n /= i, a[len]++; } if (n > 1) len++, p[len] = n, a[len] = 1; } inline void init2(long long n, int tp) { for (register long long i = 2; i * i <= n; i++) { while (n % i == 0) Map[tp][i]++, n /= i; } if (n > 1) Map[tp][n]++; } inline long long mul(long long a, long long n, long long mo) { long long res = 0; n %= mo; a %= mo; if (mo <= 2000000000) return a * n % mo; while (n) { if (n & 1) res = res + a < mo ? res + a : res + a; a = a + a < mo ? a + a : a + a - mo; n >>= 1; } return res % mo; } inline long long power(long long a, long long n, long long mo) { long long res = 1; if (mo == 1) return 0; n %= mo - 1; while (n) { if (n & 1) res = mul(res, a, mo); a = mul(a, a, mo); n >>= 1; } return res; } inline void dfs(int dep, long long d) { if (dep > len) { if (d == 1) return; map<long long, int> fac; for (register int i = 1; i <= (len); i++) if (b[i]) { if (b[i] - 1) fac[p[i]] += b[i] - 1; for (map<long long, int>::iterator it = Map[i].begin(); it != Map[i].end(); it++) fac[(*it).first] += (*it).second; } static long long c[22]; int tot = 0; long long phi = 1; for (map<long long, int>::iterator it = fac.begin(); it != fac.end(); it++) { tot++, c[tot] = (*it).first; for (register int i = 1; i <= ((*it).second); i++) phi *= c[tot]; } long long k = phi; for (register int i = 1; i <= (tot); i++) { while (k % c[i] == 0 && power(x, k / c[i], d) == 1) k /= c[i]; } res += phi / k; return; } for (register int i = 0; i <= (a[dep]); i++) b[dep] = i, dfs(dep + 1, d), d *= p[dep], b[dep] = 0; } int main() { scanf( %lld%lld , &m, &x); init(m); for (register int i = 1; i <= (len); i++) init2(p[i] - 1, i); dfs(1, 1); cout << res; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int M = 1000010; const int MAX = M; struct BIT { int bit[MAX + 1], N; BIT() {} BIT(int N) : N(N) { memset(bit, 0, sizeof(bit)); } int sum(int i) { i++; int ret = 0; while (i) { ret += bit[i]; i -= i & -i; } return ret; } int sum(int i, int j) { return sum(j - 1) - sum(i - 1); } void add(int i, int x) { i++; while (i <= N) { bit[i] += x; i += i & -i; } } int find(int i) { int lb = -1, ub = N, mid; while (ub - lb > 1) { mid = (lb + ub) / 2; if (sum(mid) >= i) ub = mid; else lb = mid; } return ub; } }; int n, m, a[M], seq[M], k[M]; int len, ns, ms; BIT b; void solve() { if (!len) { puts( Poor stack! ); return; } b = BIT(ns); for (int i = (int)(0); i < (int)(ns); i++) b.add(i, 1); for (int i = (int)(0); i < (int)(ms); i++) { for (int j = k[i] - 1; j >= 0; --j) { int pos = b.find(a[j]); b.add(pos, -1); } } for (int i = (int)(0); i < (int)(ns); i++) if (b.sum(i, i + 1)) printf( %d , seq[i]); puts( ); } void input() { scanf( %d%d , &n, &m); for (int i = (int)(0); i < (int)(m); i++) scanf( %d , a + i); for (int i = (int)(0); i < (int)(n); i++) { scanf( %d , seq + ns); if (seq[ns] < 0) { if (a[0] > len) continue; k[ms] = lower_bound(a, a + m, len + 1) - a; len -= k[ms++]; } else ++len, ++ns; } } int main() { input(); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { vector<int> newvec; int n; int x; int ans; cin >> n; for (int i = 0; i < n; i++) { cin >> x; newvec.push_back(x); } sort(newvec.begin(), newvec.end()); if (newvec.size() % 2 == 1) { ans = newvec[newvec.size() / 2]; } else { ans = newvec[newvec.size() / 2 - 1]; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const long long MOD = pow(10, 9) + 7; long long fac[1001]; template <typename T, typename U> static inline void amin(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static inline void amax(T &x, U y) { if (x < y) x = y; } void SieveOfEratosthenes(long long n) { bool prime[n + 1]; memset(prime, true, sizeof(prime)); for (long long p = 2; p * p <= n; p++) { if (prime[p] == true) { for (long long i = p * p; i <= n; i += p) prime[i] = false; } } for (long long p = 2; p <= n; p++) if (prime[p]) ; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long modInverse(long long n, long long p) { return power(n, p - 2, p); } long long nCrModPFermat(long long n, long long r, long long p) { if (n < r) return 0; if (r == 0) return 1; return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p; } void dfs(long long v, vector<vector<long long>> &adj, vector<long long> &used, vector<long long> &maxD) { for (long long u : adj[v]) { if (!used[u]) { used[u] = 1; if (adj[u].size() == 1 && u != 1) { maxD[u] = 0; amax(maxD[v], 1 + maxD[u]); } else { dfs(u, adj, used, maxD); amax(maxD[v], 1 + maxD[u]); } } } } void solve() { long long n, x, i; cin >> n >> x; vector<vector<long long>> adj(n + 1); long long u, v; for (i = 2; i <= n; i++) { cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } vector<long long> d(n + 1); d[1] = 0; vector<long long> visited(n + 1); vector<long long> parent(n + 1); visited[1] = 1; parent[1] = 0; queue<long long> q; q.push(1); while (!q.empty()) { long long p = q.front(); q.pop(); for (auto el : adj[p]) { if (!visited[el]) { visited[el] = 1; q.push(el); d[el] = d[p] + 1; parent[el] = p; } } } vector<long long> maxD(n + 1), used(n + 1); used[1] = 1; dfs(1, adj, used, maxD); long long f = 1, ans = max(maxD[x] * 2, (abs(d[1] - d[x]) + maxD[x]) * 2), start = x; while (f) { long long el = parent[x]; if (abs(d[el] - d[1]) > abs(d[el] - d[start])) { long long z = max(maxD[el] * 2, (abs(d[1] - d[el]) + maxD[el]) * 2); amax(ans, z); x = el; } else { f = 0; break; } } cout << ans << endl; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long test = 1; switch (test) { case 1: solve(); break; case 2: { long long t; cin >> t; while (t--) { solve(); } }; break; } }
#include <bits/stdc++.h> using namespace std; int T; int n; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> T; while (T--) { cin >> n; float FloatN = n; int Num8 = ceil(FloatN / 4); int Num9 = n - Num8; for (int i = 0; i < Num9; ++i) { cout << 9; } for (int i = 0; i < Num8; ++i) { cout << 8; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 12; int b[MAXN][MAXN][MAXN], ans, k, n, m; bool mark[MAXN][MAXN][MAXN]; void dfs(int i, int j, int l) { mark[i][j][l] = true; if (j > 0) if (b[i][j - 1][l] == 0 && !mark[i][j - 1][l]) { ans++; dfs(i, j - 1, l); } if (l > 0) if (b[i][j][l - 1] == 0 && !mark[i][j][l - 1]) { ans++; dfs(i, j, l - 1); } if (j < n - 1) if (b[i][j + 1][l] == 0 && !mark[i][j + 1][l]) { ans++; dfs(i, j + 1, l); } if (l < m - 1) if (b[i][j][l + 1] == 0 && !mark[i][j][l + 1]) { ans++; dfs(i, j, l + 1); } if (i > 0) if (b[i - 1][j][l] == 0 && !mark[i - 1][j][l]) { ans++; dfs(i - 1, j, l); } if (i < k - 1) if (b[i + 1][j][l] == 0 && !mark[i + 1][j][l]) { ans++; dfs(i + 1, j, l); } } int main() { cin >> k >> n >> m; for (int i = 0; i < k; i++) { for (int j = 0; j < n; j++) { for (int l = 0; l < m; l++) { char ch; cin >> ch; if (ch == # ) b[i][j][l] = 1; } } } int x, y; cin >> x >> y; x--; y--; dfs(0, x, y); cout << ans + 1; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(3) #pragma GCC optimize(2) #pragma GCC optimize( Ofast ) using namespace std; vector<int> g[2097312]; int a[2097312][2]; char st[2097312]; int f[2097312]; int find(int x) { if (f[x] == x) return x; return f[x] = find(f[x]); } int main() { int n, i, j, cnt; scanf( %d , &n); scanf( %s , st + 1); for (i = n; i >= 1; --i) { if (st[i] != 1 ) { a[i][0] = a[i + 1][0] + 1; } if (st[i] != 0 ) { a[i][1] = a[i + 1][1] + 1; } g[max(a[i][1], a[i][0])].push_back(i); f[i] = i; } f[n + 1] = n + 1; for (i = 1; i <= n; ++i) { j = 1, cnt = 0; while (j <= n) { j = find(j); if (j > n) { break; } cnt++; j += i; } printf( %d , cnt); for (auto v : g[i]) { f[v] = v + 1; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long a[n], b[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; long long flag = 0, p = 0, ne = 0; if (a[0] != b[0]) { flag = 1; cout << NO << endl; continue; } if (a[0] == 1) p++; if (a[0] == -1) ne++; for (int i = 1; i < n; i++) { if ((a[i] > b[i] && ne == 0) || (a[i] < b[i] && p == 0)) { flag = 1; cout << NO << endl; break; } if (a[i] == 1) p++; if (a[i] == -1) ne++; } if (flag == 0) cout << YES << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int sum = 0, p = 1; char ch = getchar(); while (!(( 0 <= ch && ch <= 9 ) || ch == - )) ch = getchar(); if (ch == - ) p = -1, ch = getchar(); while ( 0 <= ch && ch <= 9 ) sum = sum * 10 + ch - 48, ch = getchar(); return sum * p; } const int maxn = 52; const int mod = 1e9 + 7; int n, f[maxn][maxn][maxn], g[maxn][maxn], d[maxn], dp[maxn][maxn][maxn], jc[maxn], jcn[maxn], inv[maxn]; inline int C(int n, int m) { return (long long)jc[n] * jcn[m] % mod * jcn[n - m] % mod; } inline int power(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = (long long)ans * a % mod; b >>= 1; a = (long long)a * a % mod; } return ans; } inline void init() { n = read(); for (int i = (1), _end_ = (n); i <= _end_; i++) d[i] = read(); jc[0] = jc[1] = jcn[0] = jcn[1] = inv[1] = 1; for (int i = (2), _end_ = (50); i <= _end_; i++) jc[i] = (long long)i * jc[i - 1] % mod, inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod, jcn[i] = (long long)inv[i] * jcn[i - 1] % mod; f[0][0][0] = 1; for (int k = (2), _end_ = (50); k <= _end_; k++) if (~k & 1) f[0][0][k] = (long long)f[0][0][k - 2] * (k - 1) % mod; for (int j = (1), _end_ = (50); j <= _end_; j++) for (int k = (0), _end_ = (50); k <= _end_; k++) if (~k & 1) { if (k >= 2) f[0][j][k] = (f[0][j][k] + (long long)f[0][j - 1][k - 2] * C(k, 2)) % mod; if (j >= 2) f[0][j][k] = (f[0][j][k] + (long long)f[0][j - 2][k] * (j - 1) * k) % mod; if (j >= 3) f[0][j][k] = (f[0][j][k] + (long long)f[0][j - 3][k + 2] * C(j - 1, 2)) % mod; } for (int i = (1), _end_ = (50); i <= _end_; i++) for (int j = (0), _end_ = (50); j <= _end_; j++) for (int k = (0), _end_ = (50); k <= _end_; k++) f[i][j][k] = ((j ? (long long)f[i - 1][j - 1][k + 1] * j : 0) + (k ? (long long)f[i - 1][j][k - 1] * k : 0)) % mod; } inline void doing() { dp[1][1][1] = 1; if (d[1] == 2) { dp[2][3][2] = 1; } else { dp[2][4][3] = 1; } for (int i = (3), _end_ = (n); i <= _end_; i++) { for (int j = (i), _end_ = (n); j <= _end_; j++) { for (int k = (1), _end_ = (j); k <= _end_; k++) { int A = 0, B = 0; for (int l = (1), _end_ = (j - k); l <= _end_; l++) { (d[j - k - l + 1] == 2 ? B : A)++; dp[i][j][k] = (dp[i][j][k] + (long long)dp[i - 1][j - k][l] * f[k][A][B]) % mod; } } } } int ans = 0; for (int i = (2), _end_ = (n); i <= _end_; i++) { int A = 0, B = 0; for (int k = (1), _end_ = (n); k <= _end_; k++) { (d[n - k + 1] == 2 ? B : A)++; ans = (ans + (long long)dp[i][n][k] * f[0][A][B]) % mod; } } printf( %d n , ans); } int main() { init(); doing(); return 0; }
#include <bits/stdc++.h> using namespace std; int n; bool go(int x, multiset<int> &hand, deque<int> &dq) { if (hand.find(x) == hand.end()) return false; hand.erase(hand.find(x)); hand.insert(dq.front()); dq.pop_front(); dq.push_back(x); return true; } multiset<int> hand; deque<int> dq; int Try() { multiset<int> hand1 = hand; deque<int> dq1 = dq; int pos = -1; for (int i = 0; i < n; i++) { if (dq[i] == 1) pos = i; } if (pos == -1) return -1; for (int i = pos; i < n; i++) if (dq[i] != i - pos + 1) return -1; int done = n - pos; int ans = 0; while (done < n) { ++done; ++ans; if (!go(done, hand1, dq1)) return -1; } return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; hand.insert(x); } for (int i = 1; i <= n; i++) { int x; cin >> x; dq.push_back(x); } int ans = Try(); if (ans != -1) { cout << ans << endl; return 0; } ans = 0; while (hand.find(1) == hand.end()) { assert(go(0, hand, dq)); ans++; } int mx = n; for (int i = 0; i < n; i++) { if (dq[i] == 0) continue; int cur = i + 1 + (n + 1 - dq[i]); mx = max(mx, cur); } cout << ans + mx << endl; }
#include <bits/stdc++.h> using namespace std; const int inf = 2147483647, dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1}; const int N = 100005, M = 1000005, K = 200005, mod = 1000000007; const long long llinf = 9223372036854775807ll; long long n, m, s, ans, ar; long long f(long long a, long long b) { return (n - a + 1) * (m - b + 1); } int main() { cin >> n >> m >> s; for (int i = 1; i <= n; i += 2) for (int j = 1; j <= m; j += 2) { if (i * j == s) ans += f(i, j) * (((i + 1) * (j + 1) / 2) - 1); else if (i * j > s) { ar = (i * j - s); if (ar % 4 != 0) continue; ar /= 4; for (int l = 1; l <= (i - 1) / 2; l++) if ((ar % l) == 0 && (ar / l) <= (j - 1) / 2) ans += f(i, j) * 2; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 300005; pair<long long, long long> dif[maxn]; long long x[maxn], y[maxn], pref[maxn], suff[maxn], ans[maxn]; vector<int> adj[maxn]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %lld %lld , &x[i], &y[i]); dif[i] = {y[i] - x[i], i}; } for (int i = 1; i <= m; i++) { int u, v; scanf( %d %d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } sort(dif + 1, dif + n + 1); for (int i = 1; i <= n; i++) { pref[i] = pref[i - 1] + y[dif[i].second]; } for (int i = n; i >= 1; i--) { suff[i] = suff[i + 1] + x[dif[i].second]; } for (int i = 1; i <= n; i++) { int u = dif[i].second; long long res = pref[i - 1] + suff[i + 1] + 1ll * (i - 1) * x[u] + 1ll * (n - i) * y[u]; for (auto v : adj[u]) { res -= min(x[u] + y[v], x[v] + y[u]); } ans[u] = res; } for (int i = 1; i <= n; i++) { printf( %lld , ans[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int ans = -1; int sum = 7; int i = 1; while (sum <= n) { int y = n - sum; if (y % 4 == 0) ans = i; sum += 7; i++; } if (ans != -1) { int s = 7 * ans; int y = n - s; int x = y / 4; while (x--) { cout << 4 ; } while (ans--) { cout << 7 ; } return 0; } if (n % 7 == 0) { int x = n / 7; while (x--) cout << 7 ; return 0; } if (n % 4 == 0) { int x = n / 4; while (x--) cout << 4 ; return 0; } cout << -1 ; return 0; }
#include <bits/stdc++.h> using namespace std; string vow = aeiou ; const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2}; const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1}; const int dx[] = {-1, 0, 0, 1}; const int dy[] = {0, -1, 1, 0}; const long double pie = 3.14159265358979; const long long mod = 1e9 + 7; void solve(int test_case) { int k; cin >> k; string s; cin >> s; int n = s.size(); vector<int> pref(n + 1); for (int i = 1; i < n + 1; i++) pref[i] = pref[i - 1] + s[i - 1] - 0 ; long long ans = 0; for (int i = 0; i < n; i++) { int x = pref[i + 1]; int val = x - k; if (val < 0) continue; ; int ans_indx = -1; for (int lo = 0, hi = i; lo <= hi;) { int mid = lo + hi >> 1; if (pref[mid] > val) hi = mid - 1; else if (pref[mid] == val) ans_indx = mid, hi = mid - 1; else lo = mid + 1; } if (ans_indx == -1) continue; ; long long L = ans_indx; ans_indx = -1; for (int lo = 0, hi = i; lo <= hi;) { int mid = lo + hi >> 1; if (pref[mid] == val) ans_indx = mid, lo = mid + 1; else if (pref[mid] < val) lo = mid + 1; else hi = mid - 1; } if (ans_indx == -1) continue; ; long long R = ans_indx; ans += R - L + 1; } cout << ans; cout << n ; } int main() { int t = 1; for (int i = 0; i < t; i++) solve(i); return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, flag = 1; char ch = getchar(); for (; ch > 9 || ch < 0 ; ch = getchar()) if (ch == - ) flag = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = (x << 3) + (x << 1) + ch - 0 ; return x * flag; } const int MAXN = 2e5 + 50, B = 317, INF = 998244353; int n, m, Ans[MAXN], rt, cnt = 0; int XX[MAXN], YY[MAXN], DY[MAXN], Cl = 0; struct Point { int x, y, id; } P[MAXN]; struct Ques { int X1, Y1, X2, Y2, id, h; } Q[MAXN]; struct Tree { int X, Y, Min, ls, rs, dat, fa; int mx[2], my[2]; void clean() { X = Y = ls = rs = mx[1] = my[1] = 0; mx[0] = my[0] = dat = Min = INF; } } T[MAXN]; int MIN(int a, int b) { return a < b ? a : b; } bool cmp3(Point a, Point b) { return a.y < b.y; } bool cmp2(Point a, Point b) { return a.x < b.x; } bool cmp(Ques a, Ques b) { return a.h < b.h; } void update(int cur) { T[cur].Min = MIN(T[T[cur].rs].Min, T[T[cur].ls].Min); T[cur].Min = MIN(T[cur].Min, T[cur].dat); T[cur].mx[0] = MIN(MIN(T[T[cur].rs].mx[0], T[T[cur].ls].mx[0]), T[cur].mx[0]); T[cur].my[0] = MIN(MIN(T[T[cur].rs].my[0], T[T[cur].ls].my[0]), T[cur].my[0]); T[cur].mx[1] = max(max(T[T[cur].rs].mx[1], T[T[cur].ls].mx[1]), T[cur].mx[1]); T[cur].my[1] = max(max(T[T[cur].rs].my[1], T[T[cur].ls].my[1]), T[cur].my[1]); } void build(int &cur, int L, int R, int D, int fa) { if (L > R) return; if (!cur) cur = ++cnt; int mid = (L + R) >> 1; T[cur].fa = fa; if (L == R) { int x = P[L].x, y = P[L].y; T[cur].mx[0] = T[cur].mx[1] = T[cur].X = x; T[cur].my[0] = T[cur].my[1] = T[cur].Y = y; T[cur].dat = T[cur].Min = P[L].id; DY[P[L].id] = cur; return; } if (D == 0) nth_element(P + L, P + mid, P + 1 + R, cmp2); else nth_element(P + L, P + mid, P + 1 + R, cmp3); T[cur].dat = P[mid].id, T[cur].X = P[mid].x, T[cur].Y = P[mid].y; T[cur].mx[0] = T[cur].mx[1] = T[cur].X; T[cur].my[0] = T[cur].my[1] = T[cur].Y; DY[P[mid].id] = cur; build(T[cur].ls, L, mid - 1, D ^ 1, cur); build(T[cur].rs, mid + 1, R, D ^ 1, cur); update(cur); return; } bool out(int x, int X1, int Y1, int X2, int Y2) { return (T[x].mx[0] > X2 || T[x].mx[1] < X1 || T[x].my[0] > Y2 || T[x].my[1] < Y1); } bool in(int x, int X1, int Y1, int X2, int Y2) { return (T[x].mx[0] >= X1 && T[x].mx[1] <= X2 && T[x].my[0] >= Y1 && T[x].my[1] <= Y2); } int query(int now, int X1, int Y1, int X2, int Y2) { int Min = INF; if (T[now].X >= X1 && T[now].Y >= Y1 && T[now].X <= X2 && T[now].Y <= Y2) Min = T[now].dat; if (out(now, X1, Y1, X2, Y2) || !now) return Min; if (in(now, X1, Y1, X2, Y2)) return min(T[now].Min, T[now].dat); if (T[now].ls) Min = MIN(Min, query(T[now].ls, X1, Y1, X2, Y2)); if (T[now].rs) Min = MIN(Min, query(T[now].rs, X1, Y1, X2, Y2)); return Min; } void Go(int x, int t) { if (!x) return; if (T[x].dat == t) T[x].dat = INF; update(x); Go(T[x].fa, t); return; } void clean() { for (int i = 1; i <= cnt; i++) T[i].clean(); cnt = 0; } int main() { n = read(); T[0].clean(); for (int i = 1; i <= n; i++) Ans[i] = -1; for (int i = 1; i <= n; i++) { Q[i].X1 = read(), Q[i].X2 = read(); Q[i].Y1 = read(), Q[i].Y2 = read(); Q[i].h = read(), Q[i].id = i; } rt = 0; m = read(); sort(Q + 1, Q + 1 + n, cmp); for (int i = 1; i <= m; i++) { XX[i] = P[i].x = read(), YY[i] = P[i].y = read(); P[i].id = i; } build(rt, 1, m, 0, 0); for (int i = 1; i <= n; i++) { int t = query(rt, Q[i].X1, Q[i].Y1, Q[i].X2, Q[i].Y2); if (t == 998244353 || !t) continue; Ans[t] = Q[i].id, Go(DY[t], t); } for (int i = 1; i <= m; i++) printf( %d n , max(Ans[i], 0)); return 0; }
#include <bits/stdc++.h> const int MAXN = 100010; int head[MAXN], nxt[MAXN << 1], to[MAXN << 1], val[MAXN << 1], tot; void addedge(int b, int e, int v) { nxt[++tot] = head[b]; to[head[b] = tot] = e; val[tot] = v; nxt[++tot] = head[e]; to[head[e] = tot] = b; val[tot] = v; } int n, Q; std::pair<int, int> diameter(int u, int fa = 0) { std::pair<int, int> res(0, u); for (int i = head[u]; i; i = nxt[i]) if (to[i] != fa) { std::pair<int, int> t = diameter(to[i], u); t.first += val[i]; res = std::max(res, t); } return res; } struct TTT { int fa[MAXN], son[MAXN], top[MAXN], dep[MAXN], sonmax[MAXN]; int dis[MAXN]; void dfs1(int u) { for (int i = head[u]; i; i = nxt[i]) if (to[i] != fa[u]) { fa[to[i]] = u; dep[to[i]] = dep[u] + 1; dis[to[i]] = dis[u] + val[i]; dfs1(to[i]); sonmax[to[i]] += val[i]; if (sonmax[to[i]] > sonmax[son[u]]) son[u] = to[i]; } sonmax[u] = sonmax[son[u]]; } int down[MAXN]; void dfs2(int u) { down[top[u]] = u; if (son[u]) top[son[u]] = top[u], dfs2(son[u]); for (int i = head[u]; i; i = nxt[i]) if (to[i] != fa[u] && to[i] != son[u]) top[to[i]] = to[i], dfs2(to[i]); } int chv[MAXN], li[MAXN], rk[MAXN], bak, pre[MAXN]; void init(int rt) { dep[rt] = 1, top[rt] = rt; dfs1(rt); dfs2(rt); for (int i = 1; i <= n; ++i) if (i == top[i]) li[++bak] = i, chv[i] = dis[down[i]] - dis[fa[i]]; std::sort(li + 1, li + 1 + bak, [this](int a, int b) { return chv[a] > chv[b]; }); for (int i = 1; i <= bak; ++i) rk[li[i]] = i, pre[i] = pre[i - 1] + chv[li[i]]; } int solve(int u, int v) { int lans = 0; v = std::min(bak, v * 2 - 1); if (rk[top[u]] <= v) lans = pre[v]; else { lans = pre[v - 1] + chv[top[u]]; int now = u; while (rk[top[now]] > v) now = fa[top[now]]; int tv = pre[v] - dis[down[top[now]]] + dis[down[top[u]]]; tv = std::max(tv, pre[v - 1] - dis[now] + dis[down[top[u]]]); lans = std::max(lans, tv); } return lans; } } t1, t2; int main() { std::ios_base::sync_with_stdio(false), std::cin.tie(0); std::cin >> n >> Q; for (int i = 1, t1, t2, t3; i < n; ++i) { std::cin >> t1 >> t2 >> t3; addedge(t1, t2, t3); } int rt1 = diameter(1).second, rt2 = diameter(rt1).second; t1.init(rt1), t2.init(rt2); int lans = 0; while (Q-- > 0) { int u, v; std::cin >> u >> v; u = (u + lans - 1) % n + 1; v = (v + lans - 1) % n + 1; lans = std::max(t1.solve(u, v), t2.solve(u, v)); std::cout << lans << n ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; void read(int &x) { x = 0; int f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -f; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; x *= f; } void print(int x) { if (x < 0) putchar( - ), x = -x; if (!x) return; print(x / 10), putchar(x % 10 + 48); } void write(int x) { if (!x) putchar( 0 ); else print(x); putchar( n ); } const int maxn = 1e6 + 10; const int inf = 1e9; const double eps = 1e-8; const int mod = 1e9 + 7; const int B = 400; int a[maxn], b[maxn], n, k, q; int c[maxn], s[maxn], ans, res; namespace pps { void modify(int p, int x) { c[p] = x; for (int i = p; i <= n; i += k) { ans -= !(!s[i]); if (i + k > n) res -= !s[i]; s[i] = c[i] ^ (i >= k ? s[i - k] : 0); if (i + k > n) res += !s[i]; ans += !(!s[i]); } } void solve() { ans = n - ans; while (q--) { char op; int p, v; scanf( %c , &op), read(p), read(v); if (op == a ) a[p] = v; else b[p] = v; modify(p, (a[p] ^ b[p]) ^ (a[p - 1] ^ b[p - 1])); p++; modify(p, (a[p] ^ b[p]) ^ (a[p - 1] ^ b[p - 1])); write(res == k ? ans : -1); } } } // namespace pps namespace modpps { struct block { vector<int> r, bel, val, w; vector<vector<int> > t; int tag[600], m; void init(int x) { if (!x) x = k; m = 0; for (int i = x; i <= n; i += k) m++; r.resize(m + 2), bel.resize(m + 2); val.resize(m + 2), w.resize(m + 2); for (int i = 1; i <= m; i++) bel[i] = (i - 1) / B + 1; for (int i = m; i; i--) r[i] = bel[i] == bel[i + 1] ? r[i + 1] : i; for (int i = 1; i <= m; i++) { w[i] = s[(i - 1) * k + x]; val[i] = c[(i - 1) * k + x]; } vector<int> et(1 << 14, 0); for (int i = 0; i <= bel[m]; i++) t.push_back(et); for (int i = 1; i <= m; i++) t[bel[i]][w[i]]++; } void modify(int x, int v) { x = x / k + (x % k != 0); int _ = v ^ val[x]; val[x] = v; v = _; res -= tag[bel[m]] == w[m]; for (int i = x; i <= r[x]; i++) { t[bel[i]][w[i]]--; if (w[i] == tag[bel[i]]) ans--; w[i] ^= v; t[bel[i]][w[i]]++; if (w[i] == tag[bel[i]]) ans++; } for (int i = bel[x] + 1; i <= bel[m]; i++) { ans -= t[i][tag[i]]; tag[i] ^= v; ans += t[i][tag[i]]; } res += tag[bel[m]] == w[m]; } } s[402]; void solve() { for (int i = 0; i < k; i++) s[i].init(i); cerr << OK << endl; while (q--) { char op; int p, v; scanf( %c , &op), read(p), read(v); if (op == a ) a[p] = v; else b[p] = v; s[p % k].modify(p, (a[p] ^ b[p]) ^ (a[p - 1] ^ b[p - 1])); p++; s[p % k].modify(p, (a[p] ^ b[p]) ^ (a[p - 1] ^ b[p - 1])); write(res == k ? n - ans : -1); if (q % 10000 == 0) cerr << q << endl; } } } // namespace modpps int main() { int st = clock(); read(n), read(k), read(q); for (int i = 1; i <= n; i++) read(a[i]); for (int i = 1; i <= n; i++) read(b[i]); n++; for (int i = 1; i <= n; i++) c[i] = (a[i] ^ b[i]) ^ (a[i - 1] ^ b[i - 1]); for (int i = 1; i <= n; i++) s[i] = c[i] ^ (i >= k ? s[i - k] : 0), ans += !s[i]; for (int i = n - k + 1; i <= n; i++) res += !s[i]; write(res == k ? n - ans : -1); if (k > B) pps ::solve(); else modpps ::solve(); cerr << (double)(clock() - st) / 1e3 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline long long read() { long long x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } inline void write(long long a) { if (a < 0) { a = -a; putchar( - ); } if (a >= 10) write(a / 10); putchar( 0 + a % 10); } inline void writeln(long long a) { write(a); puts( ); } inline void wri(long long a) { write(a); putchar( ); } long long t, n, nl[100010], ml[100010], nll[100010], mll[100010]; int main() { n = read(); for (int i = 1; i <= n; i++) { nl[i] = read(); } for (int i = 1; i <= n; i++) { ml[i] = read(); } for (int i = 1; i < n; i++) { nll[i] = nl[i + 1] - nl[i]; mll[i] = ml[i + 1] - ml[i]; } sort(nll + 1, nll + n); sort(mll + 1, mll + n); int pd = 0; for (int i = 1; i < n; i++) { if (nll[i] != mll[i]) pd = 1; } if (pd == 0 && nl[1] == ml[1] && nl[n] == ml[n]) { puts( Yes ); } else { puts( No ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 5; const int mod = 1e9 + 7; int n; int num[MAXN]; bool vis[MAXN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &num[i]); int e = n; printf( 1 ); int sum = 0; for (int i = 1; i <= n; ++i) { vis[num[i]] = 1; while (vis[e] && e >= 1) { sum++; e--; } printf( %d , i - sum + 1); } return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) int Map[50002][7]; int main() { int m, n; scanf( %d%d , &m, &n); for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) scanf( %d , &Map[i][j]); for (int i = 1; i <= m; i++) Map[i][1] += Map[i - 1][1]; for (int j = 1; j <= n; j++) Map[1][j] += Map[1][j - 1]; for (int i = 2; i <= m; i++) for (int j = 2; j <= n; j++) Map[i][j] += max(Map[i - 1][j], Map[i][j - 1]); for (int i = 1; i <= m; i++) { if (i > 1) putchar( ); printf( %d , Map[i][n]); } puts( ); }
#include <bits/stdc++.h> using namespace std; bool cmpDouble(const double& a, const double& b) { return std::fabs(a - b) < std::numeric_limits<double>::epsilon(); } int main() { int n, k; cin >> n >> k; int arr[5001]; int ans[5001]; for (int i = 0; i < n; ++i) { cin >> arr[i]; ans[i] = 0; } map<int, set<int>> seen; for (int i = 0; i < k; ++i) { ans[i] = i + 1; seen[arr[i]].insert(i + 1); } for (int i = k; i < n; ++i) { if (seen[arr[i]].size() >= k) { cout << NO << endl; return 0; } for (int j = 1; j <= k; ++j) { if (seen[arr[i]].find(j) == seen[arr[i]].end()) { ans[i] = j; seen[arr[i]].insert(j); break; } } } cout << YES << endl; for (int i = 0; i < n; ++i) { cout << ans[i] << ; } cout << endl; }