Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, M = 1e9 + 7; int n, a[N]; long long bigmod(long long b, long long p) { long long t = 1; for (; p; b = (b * b) % M, p >>= 1) if (p & 1) t = (t * b) % M; return t; } long long go(int now) { vector<int> div; for (int i = 1; i * i <= now; i++) { if (now % i == 0) { div.push_back(i); if (i * i != now) div.push_back(now / i); } } div.push_back(N); sort(div.begin(), div.end()); long long last = 1, cur = 1; for (int i = 0; i < div.size() - 1; i++) { int x = lower_bound(a, a + n, div[i]) - a; int y = lower_bound(a, a + n, div[i + 1]) - a; long long tmp = bigmod(i + 1, y - x); cur *= tmp; cur %= M; } int sz = div.size() - 2; div[sz] = N; for (int i = 0; i < div.size() - 2; i++) { int x = lower_bound(a, a + n, div[i]) - a; int y = lower_bound(a, a + n, div[i + 1]) - a; long long tmp = bigmod(i + 1, y - x); last *= tmp; last %= M; } return (cur - last + M) % M; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long ans = 1; for (int i = 1; i < N; i++) { ans += go(i); ans %= M; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> const int MX = 1e5 + 23; const long long MOD = 998244353; int read() { char k = getchar(); int x = 0; while (k < 0 || k > 9 ) k = getchar(); while (k >= 0 && k <= 9 ) x = x * 10 + k - 0 , k = getchar(); return x; } struct node { int l, r; int sum, mx; node *lch, *rch; } * root; void pushup(node *x) { x->sum = x->lch->sum + x->rch->sum; x->mx = std::max(x->lch->mx + x->rch->sum, x->rch->mx); } node *build(int l, int r) { node *x = new node; x->l = l, x->r = r; if (l == r) { x->sum = x->mx = 0; x->lch = x->rch = nullptr; } else { int mid = (l + r) >> 1; x->lch = build(l, mid); x->rch = build(mid + 1, r); pushup(x); } return x; } void add(node *x, int p, int v) { if (x->l == x->r) { x->sum += v; x->mx += v; return; } if (p <= x->lch->r) add(x->lch, p, v); else add(x->rch, p, v); pushup(x); } int query(node *x, int ex) { if (x->l == x->r) return x->l; if (x->rch->mx + ex >= 1) return query(x->rch, ex); return query(x->lch, ex + x->rch->sum); } int m, w[MX]; int main() { root = build(1, 100000 + 233); m = read(); for (int i = 1, type, x, v; i <= m; ++i) { x = read(), type = read(); if (type == 0) { add(root, x, -1); } else { v = read(); w[x] = v; add(root, x, 1); } if (root->mx <= 0) { puts( -1 ); } else { printf( %d n , w[query(root, 0)]); } } return 0; }
#include <bits/stdc++.h> using namespace std; int n; long long x, y; vector<pair<pair<long long, long long>, int> > p; long long dx, dy; bool dot(long long x, long long y) { long long x1 = x - p[0].first.first; long long x2 = x - p[1].first.first; long long y1 = y - p[0].first.second; long long y2 = y - p[1].first.second; return x1 * y2 - y1 * x2; return true; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %I64d%I64d , &x, &y); p.push_back(make_pair(make_pair(x, y), i + 1)); } sort(p.begin(), p.end()); dx = p[0].first.first - p[1].first.first; dy = p[0].first.second - p[1].first.second; for (int i = 2; i < n; i++) { if (dot(p[i].first.first, p[i].first.second)) { printf( %d %d %d n , p[0].second, p[1].second, p[i].second); return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; int n; string a[55]; long long f[(1LL << (21))]; double fac[55]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int l = a[0].size(); fac[0] = 1; for (int i = 1; i <= l; i++) fac[i] = fac[i - 1] * i; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int s = 0; for (int k = 0; k < l; k++) if (a[i][k] == a[j][k]) s |= (1LL << (k)); f[s] |= (1LL << (i)) | (1LL << (j)); } } double res = 0; for (int s = (1LL << (l)) - 1; s >= 0; s--) { for (int k = 0; k < l; k++) if (s >> k & 1) f[s ^ (1LL << (k))] |= f[s]; } for (int s = 0; s < (1LL << (l)); s++) { int nturn = __builtin_popcount(s); for (int k = 0; k < l; k++) if (s >> k & 1) { int nreveal = 0; long long x = f[s] ^ f[s ^ (1LL << (k))]; while (x) { x -= x & (-x); nreveal++; } res += (fac[nturn - 1] / fac[l] * fac[l - nturn]) * nturn * nreveal / n; } } printf( %.15lf , res); }
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 2 * 1e5 + 10; ll res; ll a[N]; void solve() { ll t, x, y, ex, ey, neast = 0, nnorth = 0, nsouth = 0, nwest = 0; map<char, int> mp; cin >> t >> x >> y >> ex >> ey; ll k = ex - x; ll l = ey - y; string s; cin >> s; if (k > 0) { neast = k; } else { nwest = abs(k); } if (l > 0) { nnorth = l; } else { nsouth = abs(l); } for (int i = 0; i < s.size(); i++) { if (s[i] == N and nnorth > 0) { nnorth--; } if (s[i] == E and neast > 0) { neast--; } if (s[i] == S and nsouth > 0) { nsouth--; } if (s[i] == W and nwest > 0) { nwest--; } if (nnorth == 0 and nsouth == 0 and neast == 0 and nwest == 0) { cout << i + 1; return; } } cout << -1; } int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ll t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int MN = 1000 * 100 + 100; int arr[MN], n, s_l, s_r; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; s_r += arr[i]; } s_r -= arr[0]; s_l = arr[0]; int cnt = 0; for (int i = 1; i < n; i++) { if (s_l == s_r) cnt++; s_r -= arr[i]; s_l += arr[i]; } cout << cnt; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = int64_t; using ii = pair<ll, ll>; int main() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); ll n, m; cin >> n >> m; ll nn = n - 2; ll n1 = nn / 2; ll n2 = nn - n1; ll sm = (n1 + 1) * n1 / 2 + (n2 + 1) * n2 / 2; if (m == 0) { ll fff = ll(1e9) - 5050 * 5050; for (int i = (0); i < (n); i++) { cout << fff + i * 5050 << ; } cout << endl; return 0; } if (sm >= m) { if (m == 1) { cout << 1 << << 2 << << 3 << ; n -= 3; ll fff = ll(1e9) - 5050 * 5050; for (int i = (0); i < (n); i++) { cout << fff + i * 5050 << ; } cout << endl; return 0; } ll f1 = 1, f2 = 1; sm = 0; for (int i = (0); i < (n - 2); i++) { if (sm + f1 >= m) { f2 = i - 1; break; } sm += f1; if (i % 2 == 1) f1++; } ll last; ll ff1 = f1 - (m - sm); if (f2 % 2 == 0) { last = 2 * ff1 + 1; } else { last = 2 * ff1; if (ff1 == 0) last = 1; } cout << 1 << << 2 << ; for (int i = (0); i < (f2 + 1); i++) { cout << i + 3 << ; if (i == f2) { cout << i + 3 + last << ; } } ll kk = f2 + 4; kk = n - kk; ll fff = ll(1e9) - 5050 * 5050; for (int i = (0); i < (kk); i++) { cout << fff + i * 5050 << ; } cout << endl; } else { cout << -1 << endl; } return 0; }
#include <bits/stdc++.h> int main() { int n, i, j, g, k, a[3]; while (~scanf( %d , &n)) { for (i = 0, k = 0; i < n; i++) { for (j = 0, g = 0; j < 3; j++) { scanf( %d , &a[j]); if (a[j] == 1) { g++; } } if (g >= 2) { k++; } } printf( %d n , k); } return 0; }
#include <bits/stdc++.h> const int MAX_N = 500000; const int MAX_M = 500000; const int MOD = 998244353; int l[MAX_M], r[MAX_M], val[MAX_M]; int smen[1 + MAX_N + 1], left[1 + MAX_N], dp[1 + MAX_N], _sp[1 + 1 + MAX_N], *sp = _sp + 1; int solve(int n, int m, int bit) { int last = 0, p = 0; for (int i = 1; i <= n; ++i) { smen[i] = 0; left[i] = 0; } smen[n + 1] = left[n + 1] = 0; for (int i = 0; i < m; ++i) if ((1 << bit) & val[i]) { smen[l[i]]++; smen[r[i] + 1]--; } else left[r[i] + 1] = std::max(left[r[i] + 1], l[i]); sp[0] = 1; dp[0] = 1; for (int i = 1; i <= n + 1; ++i) { p += smen[i]; last = std::max(last, left[i]); if (p == 0) { dp[i] = (sp[i - 1] + MOD - sp[last - 1]) % MOD; } else dp[i] = 0; sp[i] = (sp[i - 1] + dp[i]) % MOD; } return dp[n + 1]; } int main() { int n, k, m; scanf( %d%d%d , &n, &k, &m); for (int i = 0; i < m; ++i) scanf( %d%d%d , &l[i], &r[i], &val[i]); int res = 1; for (int i = 0; i < k; ++i) res = (long long)res * solve(n, m, i) % MOD; printf( %d , res); return 0; }
#include <bits/stdc++.h> using namespace std; int d[3 * 1000001], v1[3 * 1000001], v2[3 * 1000001], a[1000001], i, n, tt, tt2, kq; void BFS1(int s, int k) { queue<int> q; if (v1[s] == 0) { q.push(s); v1[s] = k; } while (q.size() > 0) { int u = q.front(); q.pop(); for (int i = 0; i <= 21; i++) if ((u >> i) & 1) { int v = u - (1 << i); if (v1[v] == 0) { q.push(v); v1[v] = k; } } } } void BFS2(int s, int k) { queue<int> q; if (v2[s] > 0) return; if (d[s] == 0 || d[s] > k) { q.push(s); if (d[s] == 0) d[s] = k; else v2[s] = k; } while (q.size() > 0) { int u = q.front(); q.pop(); for (int i = 0; i <= 21; i++) if ((u >> i) & 1) { int v = u - (1 << i); if (v2[v] > 0) continue; if (d[v] == 0 || d[v] > k) { q.push(v); if (d[v] == 0) d[v] = k; else v2[v] = k; } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) BFS1(a[i], i); for (i = n; i >= 1; i--) BFS2(a[i], i); for (tt = 0; tt <= 2000000; tt++) { tt2 = 0; if (v2[tt] == 0) continue; for (i = 21; i >= 0; i--) { if ((tt >> i) & 1) continue; if (v1[tt2 | (1 << i)] < v2[tt] && v1[tt2 | (1 << i)] > 0) tt2 |= (1 << i); } kq = max(kq, tt | tt2); } cout << kq; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> ans; int x[n], y[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; x[i] += 1e8; y[i] += 1e8; } while (1) { for (int i = 0; i < n; i++) { if ((x[i] + y[i]) & 1) ans.push_back(i + 1); } if (ans.size() == 0 || ans.size() == n) { ans.clear(); for (int j = 0; j < n; j++) { int op = (x[j] + y[j]) / 2; x[j] = (x[j] - y[j] + (int)1e9) / 2 - 5e8; y[j] = op; } } else break; } cout << ans.size() << endl; for (auto x : ans) { cout << x << ; } }
#include <bits/stdc++.h> int n; int mat[3][6]; int solv[6]; int pt[6]; int main() { memset(solv, 0, sizeof solv); memset(mat, -1, sizeof mat); scanf( %d , &n); int i, j; for (i = 0; i < 2; i++) for (j = 0; j < 5; j++) { scanf( %d , &mat[i][j]); if (mat[i][j] != -1) solv[j]++; } for (i = 2; i < n; i++) for (j = 0; j < 5; j++) { int a; scanf( %d , &a); if (a != -1) solv[j]++; } for (i = 0; i <= 31 * n; i++) { for (j = 0; j < 5; j++) { int cur = solv[j]; if (mat[0][j] != -1 && mat[1][j] != -1 && mat[1][j] < mat[0][j]) cur += i; pt[j] = 500; while (pt[j] < 3000 && cur * 2 <= n + i) pt[j] += 500, cur *= 2; } int sc1 = 0, sc2 = 0; for (j = 0; j < 5; j++) { if (mat[0][j] != -1) sc1 += pt[j] / 250 * (250 - mat[0][j]); if (mat[1][j] != -1) sc2 += pt[j] / 250 * (250 - mat[1][j]); } if (sc1 > sc2) { printf( %d n , i); return 0; } } printf( -1 n ); return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double eps = 1e-9; template <class T> T Abs(T x) { return x > 0 ? x : -x; } template <class T> string toString(T n) { ostringstream ost; ost << n; ost.flush(); return ost.str(); } template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, -b); return a * (b / gcd(a, b)); } long long bit_set(long long k, int p) { return k = (k | (1 << p)); } long long re_set(long long k, int p) { return k = (k & ~(1 << p)); } template <class T> inline T sqr(T n) { return n * n; } template <class T> T power(T n, int p) { if (!p) return 1; else { T sum = sqr(power(n, p >> 1)); if (p & 1) sum = n; return sum; } } int main() { long long num; cin >> num; num = (num + 1) / 3LL; cout << (num / 12LL) << << num % 12LL << endl; return 0; }
#include <bits/stdc++.h> using namespace std; string s[105]; int main() { int n, m, cnt = 0, t, tt, temp, dis = 0, ans = 0, len; int row = 0, rowup = 2e9, rowdn = -1, col = 0, collft = 2e9, colrt = -1; int rowupcol, rowdncol, collftrow, colrtrow; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (s[i][j] == B ) { cnt++; if (i < rowup) { rowup = i; rowupcol = j; } if (rowdn < i) { rowdn = i; rowdncol = j; } if (j < collft) { collft = j; collftrow = i; } if (colrt < j) { colrt = j; colrtrow = i; } } } } if (!cnt) printf( 1 n ); else if (cnt == 1) printf( 0 n ); else { len = max(rowdn - rowup + 1, colrt - collft + 1); if (len > n || len > m) printf( -1 n ); else printf( %d n , (len * len) - cnt); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long i, j, k, n, m, ans = 0, sum = 0, a[100005] = {0}, mn = 2e9, mx = 0, cnt = 1, index = 0, x, y, z, xptr, yptr, id1, id2, zptr; string s; set<int> all; set<int>::iterator it2; set<pair<int, int> > seg, tem; set<pair<int, int> >::iterator it1, it, it3, it4; cin >> s; n = s.size(); for (i = 0; i < n; i++) { all.insert(i); if (i + 1 == n || s[i] != s[i + 1]) { seg.insert(make_pair(index, cnt)); tem.insert(make_pair(index, index + cnt - 1)); cnt = 1; index = i + 1; } else { cnt++; } } while (seg.size() > 1) { ans++; vector<pair<int, int> > v; for (it = seg.begin(); it != seg.end(); it++) { x = it->first; y = it->second; it1 = it; it1++; if (it == seg.begin()) { if (y > 1) { v.push_back(make_pair(x, y - 1)); } it3 = tem.lower_bound(make_pair(x, -1)); it2 = all.upper_bound(it3->second); it2--; all.erase(it2); if (y == 1) { tem.erase(it3); } } else if (it1 == seg.end()) { if (y > 1) { v.push_back(make_pair(x, y - 1)); } it2 = all.lower_bound(x); all.erase(it2); if (y == 1) { it3 = tem.lower_bound(make_pair(x, -1)); tem.erase(it3); } } else { it2 = all.lower_bound(x); all.erase(it2); if (y > 1) { it3 = tem.lower_bound(make_pair(x, -1)); it2 = all.upper_bound(it3->second); it2--; all.erase(it2); if (y > 2) { v.push_back(make_pair(x, y - 2)); } } if (y == 1 || y == 2) { it3 = tem.lower_bound(make_pair(x, -1)); tem.erase(it3); } } } seg.clear(); if (v.size() != 0) { xptr = v[0].first; yptr = v[0].second; it3 = tem.lower_bound(make_pair(xptr, -1)); zptr = it3->second; tem.erase(it3); } for (i = 0; i < v.size(); i++) { z = xptr; it2 = all.lower_bound(z); id1 = *it2; z = v[i].first; it2 = all.lower_bound(z); id2 = *it2; if (s[id1] == s[id2]) { if (i != 0) { yptr = yptr + v[i].second; it3 = tem.lower_bound(make_pair(v[i].first, -1)); zptr = it3->second; tem.erase(it3); } } else { seg.insert(make_pair(xptr, yptr)); tem.insert(make_pair(xptr, zptr)); xptr = v[i].first; yptr = v[i].second; it3 = tem.lower_bound(make_pair(v[i].first, -1)); zptr = it3->second; tem.erase(it3); } if (i + 1 == v.size()) { seg.insert(make_pair(xptr, yptr)); tem.insert(make_pair(xptr, zptr)); } } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> using vec = vector<T>; template <typename Iter> ostream &_IterOutput_(ostream &o, Iter b, Iter e, const string ss = , const string se = ) { o << ss; for (auto it = b; it != e; it++) o << (it == b ? : , ) << *it; return o << se; } template <typename T1, typename T2> ostream &operator<<(ostream &o, const pair<T1, T2> &pair) { return o << ( << pair.first << , << pair.second << ) ; } template <typename T> ostream &operator<<(ostream &o, const vector<T> &vec) { return _IterOutput_(o, begin(vec), end(vec), [ , ] ); } template <typename T> ostream &operator<<(ostream &o, const set<T> &st) { return _IterOutput_(o, begin(st), end(st), { , } ); } template <typename T, size_t N> ostream &operator<<(ostream &o, const array<T, N> &arr) { return _IterOutput_(o, begin(arr), end(arr), | , | ); } template <typename T1, typename T2> ostream &operator<<(ostream &o, const map<T1, T2> &mp) { o << { ; for (auto it = mp.begin(); it != mp.end(); it++) { o << (it == mp.begin() ? : , ) << it->first << : << it->second; } o << } ; return o; } void lucky_test() { std::random_device rd; std::mt19937 gen_(rd()); std::normal_distribution<double> dist_(0.0, 1.0); if (dist_(gen_) >= 4.44444444) { cout << Not lucky << endl; exit(0); } } int N; const int MX = 131072 * 4; const int INF = 1e9; int ZZ = 0; struct Seg { int val[MX]; int nl[MX], nr[MX]; int lz[MX]; void init(int id, int ql, int qr) { nl[id] = ql; nr[id] = qr; val[id] = -INF; if (ql == qr - 1) { return; } int md = (ql + qr) / 2; init(id * 2, ql, md); init(id * 2 + 1, md, qr); } void push(int id) { ZZ++; int l = nl[id], r = nr[id]; int v = lz[id]; lz[id] = 0; if (l == r - 1) { return; } adj(id * 2, v); adj(id * 2 + 1, v); return; } void pull(int id) { ZZ++; int l = nl[id], r = nr[id]; if (l == r - 1) return; val[id] = max(val[id * 2], val[id * 2 + 1]); } void adj(int id, int v) { lz[id] += v; val[id] += v; } void add(int id, int ql, int qr, int v) { push(id); int l = nl[id], r = nr[id]; if (l == ql and r == qr) { adj(id, v); return; } int md = (l + r) / 2; if (qr <= md) add(id * 2, ql, qr, v); else if (ql >= md) add(id * 2 + 1, ql, qr, v); else { add(id * 2, ql, md, v); add(id * 2 + 1, md, qr, v); } pull(id); } int walk(int id) { push(id); if (val[id] < 0) return -1; int l = nl[id], r = nr[id]; if (l == r - 1) { return val[id] >= 0 ? l : -1; } if (val[id * 2 + 1] >= 0) return walk(id * 2 + 1); else return walk(id * 2); } } tree; struct Hao { int val[MX]; int n; void init(int id, int l, int r) { n = r; for (int i = l; i < r; i++) val[i] = -INF; } void add(int id, int l, int r, int v) { for (int i = l; i < r; i++) val[i] += v; } int walk(int id) { for (int i = n - 1; i >= 0; i--) if (val[i] >= 0) return i; return -1; } void dmp() { for (int i = 0; i < n; i++) cout << val[i] << ; cout << endl; } }; int V[MX]; int32_t main() { do { ios_base::sync_with_stdio(0); cin.tie(0); } while (0); cin >> N; tree.init(1, 0, N + 5); for (int i = 0; i < N; i++) { int p, t; cin >> p >> t; if (t == 0) { tree.add(1, 0, p, -1); } else { cin >> V[p]; tree.add(1, p, p + 1, INF); tree.add(1, 0, p, 1); } int pos = tree.walk(1); if (pos == -1) cout << -1 << n ; else cout << V[pos] << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int n; cin >> n; vector<int> a(n + 1), b(n + 1), p(n + 1); for (int i = 1; i <= n; ++i) { cin >> a[i]; p[a[i]] = 0; } for (int i = 1; i <= n; ++i) { cin >> b[i]; p[b[i]] = i; } if (p[1]) { int k = 1, i; for (i = 2; p[i] == p[1] + i - 1; ++i) { k++; } if (p[i - 1] == n) { set<int> s; for (auto x : a) { if (x) { s.insert(x); } } int f = 1; int ind = 1; for (; i <= n; ++i) { auto it = s.find(i); if (it == s.end()) { f = 0; break; } s.erase(it); s.insert(b[ind]); ind++; } if (f == 1) { cout << n - k; return 0; } } } int ans = 0; for (int i = 1; i <= n; ++i) { ans = max(ans, p[i] - i + 1 + n); } cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, t; cin >> n >> t; if (n == 1 && t == 10) { cout << -1 ; return 0; } if (t != 10) cout << t; else cout << 1 ; for (int i = 1; i < n; i++) cout << 0 ; return 0; }
#include <bits/stdc++.h> using namespace std; long long h[1000010], dp[1000010][2]; int n; int main() { int i, j; while (scanf( %d , &n) != EOF) { for (i = 1; i <= n; i++) scanf( %lld , &h[i]), h[i]--; for (i = 1; i <= n; i++) { dp[i][0] = (dp[i - 1][0] + dp[i - 1][1] * min(h[i], h[i - 1]) + h[i]) % 1000000007; dp[i][1] = (min(h[i + 1], h[i]) + min(min(h[i], h[i - 1]), h[i + 1]) * dp[i - 1][1]) % 1000000007; } printf( %d n , dp[n][0]); } return 0; }
#include <bits/stdc++.h> using namespace std; char board[8][8]; int main() { for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) scanf( %c , &board[i][j]); } int minA = 100, minB = 100; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { if (board[i][j] == W ) { int k; for (k = i; k >= 0; k--) { if (k == i) continue; if (board[k][j] != . ) break; } if (k < 0 and i < minA) minA = i; } if (board[i][j] == B ) { int k; for (k = i; k < 8; k++) { if (k == i) continue; if (board[k][j] != . ) break; } if (k >= 8 and 7 - i < minB) minB = 7 - i; } } } if (minA <= minB) cout << A << endl; else cout << B << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long x, y; cin >> x >> y; long long d = x * x + y * y; if (x == 0 || y == 0) { cout << black << endl; return 0; } for (long long i = 1; i <= 10000; i++) { if (d < i * i) { bool white = (i % 2 == 0 && x * y > 0) || (i % 2 == 1 && x * y < 0); cout << (white ? white : black ) << endl; return 0; } if (d == i * i) { cout << black << endl; return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 1002006; long long const M = 998244353; long double const ep = .000000000000000001; vector<int> G[N]; long long pw[N]; int od = 0, ev = 0; int vis[N]; bool wtf = 1; void dfs(int node, int col) { if (col % 2 == 0) ev++; else od++; vis[node] = col; for (int i = 0; i < G[node].size(); i++) { int el = G[node][i]; if (vis[el] == -1) dfs(el, col ^ 1); else if (col == vis[el]) wtf = 0; } } int main() { pw[0] = 1; for (int i = 1; i < N; i++) pw[i] = (pw[i - 1] * 2) % M; int t; cin >> t; while (t--) { int n, e; scanf( %d%d , &n, &e); for (int i = 1; i <= n; i++) { G[i].clear(); vis[i] = -1; } for (int i = 0; i < e; i++) { int temp, temp1; scanf( %d%d , &temp, &temp1); G[temp].push_back(temp1); G[temp1].push_back(temp); } wtf = 1; long long ans = 1; for (int i = 1; i <= n; i++) { if (vis[i] == -1) { od = 0, ev = 0; dfs(i, 0); long long tot = pw[od] + pw[ev]; tot %= M; ans = (ans * tot) % M; } } ans *= wtf; printf( %lld n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int mx = 705; long long int dp[mx][mx][3][3]; char s[mx]; int p[mx]; stack<int> st; long long int dfs(int l, int r, int lc, int rc) { if (l >= r) return 1; if (dp[l][r][lc][rc] != -1) return dp[l][r][lc][rc]; int x = p[l]; int y = p[r]; dp[l][r][lc][rc] = 0; if (x == r) { for (int i = 1; i <= 2; i++) if (i != rc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, r - 1, 0, i)) % mod; for (int i = 1; i <= 2; i++) if (i != lc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, r - 1, i, 0)) % mod; } else if (x + 1 == y) { for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (i != lc && j != rc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, i, 0) * dfs(y + 1, r - 1, 0, j)) % mod; for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (i != j) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, 0, i) * dfs(y + 1, r - 1, j, 0)) % mod; for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (i != lc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, i, 0) * dfs(y + 1, r - 1, j, 0)) % mod; for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (j != rc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, 0, i) * dfs(y + 1, r - 1, 0, j)) % mod; } else { for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (i != lc && j != rc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, i, 0) * dfs(x + 1, y - 1, 0, 0) % mod * dfs(y + 1, r - 1, 0, j)) % mod; for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, 0, i) * dfs(x + 1, y - 1, i, j) % mod * dfs(y + 1, r - 1, j, 0)) % mod; for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (i != lc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, i, 0) * dfs(x + 1, y - 1, 0, j) % mod * dfs(y + 1, r - 1, j, 0)) % mod; for (int i = 1; i <= 2; i++) for (int j = 1; j <= 2; j++) if (j != rc) dp[l][r][lc][rc] = (dp[l][r][lc][rc] + dfs(l + 1, x - 1, 0, i) * dfs(x + 1, y - 1, i, 0) % mod * dfs(y + 1, r - 1, 0, j)) % mod; } return dp[l][r][lc][rc]; } int main() { memset(dp, -1, sizeof(dp)); int n; scanf( %s , s + 1); n = strlen(s + 1); for (int i = 1; i <= n; i++) if (s[i] == ( ) st.push(i); else { p[st.top()] = i; p[i] = st.top(); st.pop(); } long long int ans = dfs(1, n, 0, 0); printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int a[maxn], cnt[maxn], n, q; long long ans = 0; map<pair<long long, long long>, int> mp; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; ans += a[i]; } cin >> q; long long s, t, u; while (q--) { cin >> s >> t >> u; if (mp.find(pair<long long, long long>(s, t)) != mp.end()) { int c = mp[pair<long long, long long>(s, t)]; if (cnt[c] <= a[c]) ans++; cnt[c]--; mp.erase(pair<long long, long long>(s, t)); } if (u != 0) { mp[pair<long long, long long>(s, t)] = u; if (cnt[u] < a[u]) ans--; cnt[u]++; } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long n, i, j, pw = 1, ans1, ans2, diff = 1; char a[100000], b[100000]; int main() { ios_base::sync_with_stdio(0); cin.tie(); cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) cin >> b[i]; ans1 = ans2 = 1; for (i = 0; i < n; i++) { if (a[i] == ? ) pw = (pw * 10) % mod; if (b[i] == ? ) pw = (pw * 10) % mod; if (a[i] == ? && b[i] == ? ) ans1 = (ans1 * 55) % mod, ans2 = (ans2 * 55) % mod, diff *= 10; else { if (a[i] == ? || b[i] == ? ) { if (a[i] == ? ) ans1 = (ans1 * ( 9 - b[i] + 1)) % mod, ans2 = (ans2 * (b[i] - 0 + 1)) % mod; else ans2 = (ans2 * ( 9 - a[i] + 1)) % mod, ans1 = (ans1 * (a[i] - 0 + 1)) % mod; } else { if (a[i] < b[i]) ans1 = 0, diff = 0; if (a[i] > b[i]) ans2 = 0, diff = 0; } } } cout << (pw - ans1 - ans2 + 3 * mod + diff) % mod; return 0; }
#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1.0); vector<long long> v1, v2; long long ans = 0, x, y; long long fact[1008], dp[1008][1008]; void pow1(long long a[], long long i, long long end, long long sum) { if (i == end) { v1.push_back(sum); return; } pow1(a, i + 1, end, sum + a[i]); pow1(a, i + 1, end, sum); } void subsetSums1(long long arr[], long long l, long long r, long long sum = 0) { if (l > r) { v1.push_back(sum); return; } subsetSums1(arr, l + 1, r, sum + arr[l]); subsetSums1(arr, l + 1, r, sum); } void subsetSums2(long long arr[], long long l, long long r, long long sum = 0) { if (l > r) { v2.push_back(sum); return; } subsetSums2(arr, l + 1, r, sum + arr[l]); subsetSums2(arr, l + 1, r, sum); } void pow2(long long a[], long long i, long long end, long long sum) { if (i == end) { v2.push_back(sum); return; } pow1(a, i + 1, end, sum + a[i]); pow1(a, i + 1, end, sum); } string bn(long long length) { string s; s.resize(length); char a[length]; for (int i = 0; i < length; ++i) a[i] = 0 ; for (int i = 0; i < length; ++i) s[i] = a[i]; cout << s; return s; int count = length - 1; while (length) { s[count--] = (length % 2); length /= 2; } return s; } long long powm(long long a, long long b, long long m) { if (b == 0) return 1; long long t = powm(a, b / 2, m); if (b % 2) return a * t % m * t % m; return t * t % m; } long long modinv1(long long b, long long m) { return powm(b, m - 2, m); } long long nck(long long n, long long k) { return fact[n] * modinv1(fact[n - k], 1000000007) % 1000000007 * modinv1(fact[k], 1000000007) % 1000000007; } int suffix(int l, vector<int> v) { int ans = 0; long long p = 1; for (int i = 0; i < max((int)v.size(), l); ++i) { if (i < v.size()) { ans = (ans + p * v[i] % 998244353) % 998244353; p = (p * 10) % 998244353; } if (i < l) { p = (p * 10) % 998244353; } } return ans; } int prefix(vector<int> v, int l) { int ans = 0; long long p = 1; for (int i = 0; i < max((int)v.size(), l); ++i) { if (i < l) { p = (p * 10) % 998244353; } if (i < v.size()) { ans = (ans + p * v[i] % 998244353) % 998244353; p = (p * 10) % 998244353; } } return ans; } int ct = 0; void sum(long long n) { if (n / 10 == 0) return; long long ans = 0; while (n) { ans += n % 10; n /= 10; } ct++; sum(ans); } vector<long long> v; long long string_num(string); void perm(long long l, long long cur, long long n) { if (cur == l) { v.push_back(n); return; } perm(l, cur + 1, n * 10 + 4); perm(l, cur + 1, n * 10 + 7); } long long string_num(string s) { int x = s.size(); long long ans = 0, i = 0; while (x--) { ans += (pow(10, x) * (s[i++] - 0 )); } return ans; } void DJ() { long long l, r; cin >> l >> r; long long ans = 0; for (int i = 1; i < 11; ++i) { perm(i, 0, 0); } long long it = lower_bound(v.begin(), v.end(), l) - v.begin(); long long sum = r - l + 1; if (v[it] - l >= sum) { ans += sum * v[it]; sum = 0; } else { ans += v[it] * (v[it] - l + 1); sum -= v[it] - l + 1; it++; } while (sum) { if (v[it] - v[it - 1] >= sum) { ans += sum * (v[it]); sum = 0; } else { ans += v[it] * (v[it] - v[it - 1]); sum -= v[it] - v[it - 1]; it++; } } cout << ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) DJ(); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; int n, m; int a[maxn]; int res0, res1; void output(int l, int r) { printf( ? ); for (int i = 1; i < l; i++) printf( 0 ); for (int i = l; i <= r; i++) printf( 1 ); for (int i = r + 1; i <= n; i++) printf( 0 ); printf( n ); fflush(stdout); } void dfs(int l, int r) { if (res0 && res1) return; if (l == r) { output(l, l); scanf( %d , &a[++m]); if (a[m] - a[1] == 1) res0 = l; else res1 = l; return; } if (r - l == 1) { output(l, l); scanf( %d , &a[++m]); if (a[m] - a[1] == 1) res0 = l; if (a[1] - a[m] == 1) res1 = l; if (res0 && res1) return; dfs(r, r); return; } int mid = (l + r) >> 1; output(l, mid); scanf( %d , &a[++m]); if (a[m] - a[1] == mid - l + 1) { res0 = l; if (res0 && res1) return; dfs(mid + 1, r); } else if (a[1] - a[m] == mid - l + 1) { res1 = l; if (res0 && res1) return; dfs(mid + 1, r); } else { if (res0 && res1) return; dfs(l, mid); if (res0 && res1) return; dfs(mid + 1, r); } } int main() { scanf( %d , &n); output(1, 0); scanf( %d , &a[++m]); dfs(1, n); printf( ! %d %d n , res0, res1); fflush(stdout); return 0; }
#include <bits/stdc++.h> using namespace std; const int mmax = 1e6 + 10; const int eps = 1e-9; struct node { string name; } s[105]; long long cmp(node a, node b) { if (a.name == b.name) return a.name < b.name; return a.name < b.name; } int main() { long long n; while (cin >> n) { for (int i = 0; i < n; i++) { cin >> s[i].name; } sort(s, s + n, cmp); long long ans = 0, sum = 0; for (int i = 0; i < n; i++) { if (s[i].name[0] == s[i + 1].name[0]) ans++; else { long long num0 = (ans + 1) / 2; long long num1 = ans + 1 - num0; long long sum0 = 0, sum1 = 0; for (int i = 1; i < num0; i++) sum0 += i; for (int i = 1; i < num1; i++) sum1 += i; sum += (sum0 + sum1); ans = 0; } } cout << sum << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k, kk; vector<int> g[10], e[10]; int cnt = 0; bool used[10] = {}, vis[10] = {}; int usedCnt, visCnt; long long cur; int st; int pc[1024]; void go(int v) { vis[v] = true, ++visCnt; vector<int> &f = e[v]; int sz = 0; for (int x : g[v]) if (!used[x]) { f[sz++] = x; } for (int mask = 0; mask < (int)(1 << sz); ++mask) { int pcm = pc[mask]; for (int i = 0; i < (int)(sz); ++i) if (mask & (1 << i)) { used[f[i]] = true; } usedCnt += pcm; int pos = 0; while (pos < n && (!used[pos] || vis[pos])) ++pos; if (pos != n) { go(pos); } else { if (usedCnt == n) ++cur; } for (int i = 0; i < (int)(sz); ++i) if (mask & (1 << i)) { used[f[i]] = false; } usedCnt -= pcm; } vis[v] = false, --visCnt; } long long ans[15], c[15][15]; int main() { for (int i = 0; i < (int)(1024); ++i) pc[i] = __builtin_popcount(i); scanf( %d%d%d , &n, &m, &kk); for (int i = 0; i < (int)(m); ++i) { int from, to; scanf( %d%d , &from, &to), --from, --to; g[from].push_back(to); g[to].push_back(from); } for (int i = 0; i < (int)(n); ++i) e[i].resize(g[i].size()); for (int i = 0; i < (int)(15); ++i) c[0][i] = 0; c[0][0] = 1; for (int i = 1; i < 15; ++i) { c[i][0] = 1; for (int j = 1; j < 15; ++j) { c[i][j] = c[i - 1][j] + c[i - 1][j - 1]; } } for (int k = n - 1; k >= kk; --k) { for (int mask = 0; mask < (int)(1 << n); ++mask) if (pc[mask] == k) { for (int i = 0; i < (int)(n); ++i) vis[i] = used[i] = (mask & (1 << i)) > 0; st = 0; while (used[st]) ++st; if (st == n) break; usedCnt = k + 1; visCnt = k; used[st] = true; cur = 0; go(st); for (int i = 0; i < (int)(n); ++i) if (mask & (1 << i)) { int mul = 0; for (int to : g[i]) if (!(mask & (1 << to))) { ++mul; } cur *= mul; } ans[k] += cur; } for (int x = n - 1; x > k; --x) { ans[k] -= ans[x] * c[x][k]; } } printf( %d n , (int)ans[kk]); return 0; }
#include <bits/stdc++.h> using namespace std; long long s; int main() { int n, a, b, c, d; cin >> n >> a >> b >> c >> d; for (int x = 1; x <= n; x++) { int y = x + b - c; int z = x + a - d; int w = y + a - d; if (y <= n && z <= n && w <= n && y > 0 && z > 0 && w > 0) s++; } s *= n; cout << s; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n = 0, m = 0; string s; cin >> s; for (int i = 0; i < s.length(); i++) if (s[i] == x ) n++; else m++; if (n > m) for (int i = 1; i <= n - m; i++) cout << x ; else if (n < m) for (int i = 1; i <= m - n; i++) cout << y ; return 0; }
#include <bits/stdc++.h> const int N = 1e5 + 10; int ri() { char c = getchar(); int x = 0, f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 1) + (x << 3) - 0 + c; return x * f; } struct Pt { long long x, y; Pt(long long _x = 0, long long _y = 0) : x(_x), y(_y) {} Pt operator+(Pt a) { return Pt(x + a.x, y + a.y); } Pt operator-(Pt a) { return Pt(x - a.x, y - a.y); } double operator*(Pt a) { return (double)x * a.y - (double)y * a.x; } } A[N * 60], B[N], p[N], Ans[N * 60]; int tpa, tpb, all, cnt, tot, n, m, sums, G, mn, lst[N], sz[N << 1]; bool del[N << 1]; bool cmp(Pt a, Pt b) { return a.x == b.x ? a.y > b.y : a.x < b.x; } struct Edge { int pr[N << 1], to[N << 2], nx[N << 2], tp; Pt w[N << 2]; Edge() { tp = 1; } void add(int u, int v, Pt _w) { to[++tp] = v; nx[tp] = pr[u]; pr[u] = tp; w[tp] = _w; } void adds(int u, int v, Pt w = Pt()) { add(u, v, w); add(v, u, w); } } R, T; void Ins(int u, int v, Pt w) { ++tot; T.adds(tot, v, w); T.adds(tot, lst[u]); lst[u] = tot; } void Build(int u, int fa) { for (int i = R.pr[u], v; i; i = R.nx[i]) if ((v = R.to[i]) != fa) Ins(u, v, R.w[i]), Build(v, u); } void Dfs(int u, int fa, Pt D) { if (u <= n) p[++cnt] = D; for (int i = T.pr[u], v; i; i = T.nx[i]) if (!del[i >> 1] && (v = T.to[i]) != fa) Dfs(v, u, D + T.w[i]); } void Get(Pt *p, int &cnt, Pt *A, int &tp) { if (!cnt) return void(tp = 0); std::sort(p + 1, p + cnt + 1, cmp); A[tp = 1] = p[1]; for (int i = 2; i <= cnt; ++i) if (p[i].x != p[i - 1].x) { for (; tp > 1 && (p[i] - A[tp]) * (A[tp - 1] - A[tp]) >= 0;) --tp; A[++tp] = p[i]; } } void Push() { if (!tpa) { for (int i = 1; i <= tpb; ++i) Ans[++all] = B[i]; return; } if (!tpb) { for (int i = 1; i <= tpa; ++i) Ans[++all] = A[i]; return; } Ans[++all] = A[1] + B[1]; for (int i = 1, j = 1; i < tpa || j < tpb;) { ++all; if (i >= tpa) Ans[all] = A[i] + B[++j]; else if (j >= tpb) Ans[all] = A[++i] + B[j]; else { Pt v1 = A[i + 1] - A[i]; Pt v2 = B[j + 1] - B[j]; Ans[all] = Ans[all - 1] + (v1 * v2 < 0 ? ++i, v1 : (++j, v2)); } } } void Rt(int u, int fa) { sz[u] = 1; for (int i = T.pr[u], v; i; i = T.nx[i]) if (!del[i >> 1] && (v = T.to[i]) != fa) { Rt(v, u); sz[u] += sz[v]; int tmp = std::max(sz[v], sums - sz[v]); if (mn > tmp) mn = tmp, G = i; } } void Div(int u, int pres) { if (pres == 1) return; sums = pres; mn = tot + 1; Rt(u, 0); del[G >> 1] = true; int x = T.to[G], y = T.to[G ^ 1], sy = pres - sz[x]; cnt = 0; Dfs(x, 0, Pt()); Get(p, cnt, A, tpa); cnt = 0; Dfs(y, 0, T.w[G]); Get(p, cnt, B, tpb); Push(); Div(x, sz[x]); Div(y, sy); } long long F(int p, long long i) { return A[p].x * i + A[p].y; } int main() { tot = n = ri(); m = ri(); for (int i = 1; i < n; ++i) { int u = ri(), v = ri(), a = ri(), b = ri(); R.adds(u, v, Pt(a, b)); } for (int i = 1; i <= n; ++i) lst[i] = i; Build(1, 0); Div(1, tot); Get(Ans, all, A, tpa); int r = 1; long long mmx = 0; int ps = 0; for (int i = 1; i <= tpa; ++i) if (A[i].y > mmx) mmx = A[i].y, ps = i; for (int i = 0; i < m; ++i) { for (; r < tpa && F(r + 1, i) >= F(r, i); ++r) ; if (!i && mmx != F(r, i)) { for (int i = 20; i <= 44; ++i) printf( %lld %lld n , A[i].x, A[i].y); printf( %d %d %d n , r, ps, tot); } printf( %lld , F(r, i)); } puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> vc[200007]; int main() { int n; scanf( %d , &n); int res = 0; for (auto i = (1); i <= (n); ++i) { int m; scanf( %d , &m); vc[i].resize(m); for (auto j = (0); j <= (m - 1); ++j) scanf( %d , &vc[i][j]); sort(vc[i].rbegin(), vc[i].rend()); res = max(res, vc[i][0]); } long long ans = 0LL; for (auto i = (1); i <= (n); ++i) ans += (long long)(res - vc[i][0]) * (int)vc[i].size(); printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long int a, i, j, ct = 0; int main() { cin >> a; for (i = 0; i < a; i++) { ct++; if (ct == 1 || ct == 2) { cout << a ; } if (ct == 3 || ct == 4) { cout << b ; if (ct == 4) { ct = 0; } } } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; int n, k; char str[100005]; long long jie[100005]; long long ni[100005]; long long sum[100005]; long long extend_gcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1, y = 0; return a; } long long gcd = extend_gcd(b, a % b, x, y); long long t = x; x = y; y = t - a / b * x; return gcd; } long long Get_Inverse(long long num) { long long x, y; extend_gcd(num, 1000000007, x, y); return (x % 1000000007 + 1000000007) % 1000000007; } void init() { jie[0] = jie[1] = 1; ni[0] = ni[1] = 1; for (int i = 2; i <= 100000; i++) { jie[i] = (jie[i - 1] * i) % 1000000007; ni[i] = Get_Inverse(jie[i]); } } long long cal(int n, int m) { if (n < m) return 0; return jie[n] * ni[n - m] % 1000000007 * ni[m] % 1000000007; } int main(void) { init(); scanf( %d%d , &n, &k); scanf( %s , str + 1); long long ans = 0; long long ten = 1; for (int i = 1; i <= n; i++) { sum[i] = (sum[i - 1] + ten * cal(n - i - 1, k - 1) % 1000000007) % 1000000007; ten = ten * 10 % 1000000007; } ten = 1; for (int i = n; i >= 1; i--) { int c = str[i] - 0 ; ans += c * ten % 1000000007 * cal(i - 1, k) % 1000000007; ans += c * sum[n - i] % 1000000007; ans %= 1000000007; ten = ten * 10 % 1000000007; } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<string> s(100, string(100, . )); int n, k; int solve() { ios::sync_with_stdio(false), cin.tie(0); cin >> n >> k; if (n - 2 == k) { for (int i = 1; i < n - 1; i++) { s[1][i] = # ; } return 1; } if (k % 2 == 0) { for (int j = 0; j < n; j++) { for (int i = 0; i < 4; i++) { if (i != 0 && i != 3 && j != 0 && j != n - 1 && k) { s[i][j] = # ; k--; } } } return 1; } if (k >= 5) { s[1][1] = # ; s[2][1] = # ; k -= 2; for (int i = 2; i < n - 2; i++) { s[1][i] = # ; k--; if (k == 2) { s[1][i + 1] = s[2][i + 1] = # ; return 1; } } s[1][n - 2] = s[2][n - 2] = # ; k -= 2; for (int i = 2; i < n - 2; i++) { s[2][i] = # ; k--; if (k == 0) return 1; } } if (k == 3) { s[1][n / 2 + 1] = s[2][n / 2] = s[1][n / 2 - 1] = # ; return 1; } if (k == 1) { s[2][n / 2] = # ; return 1; } assert(0); } int main() { int t = solve(); if (!solve()) return (cout << NO << endl, 0); cout << YES << endl; for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { cout << s[i][j]; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; void hashLine(int n) { for (int i = 0; i < n; i++) cout << # ; cout << endl; } void right(int n) { cout << . ; for (int i = 1; i < n - 1; i++) cout << . ; cout << # n ; } void left(int n) { cout << # ; for (int i = 1; i < n - 1; i++) cout << . ; cout << . n ; } int main() { int n, m, i, j, dir = 0; cin >> n >> m; for (i = 0; i < n; i++) { if (i % 2 == 0) hashLine(m); else { if (dir == 0) { right(m); dir = 1; } else { left(m); dir = 0; } } } return 0; }
#include <bits/stdc++.h> using namespace std; bool a[1000009]; int main() { int n, x; cin >> n; for (int i = 0; i < n; i++) { cin >> x; if (x == 1) { cout << -1 ; return 0; } a[x] = 1; } for (int i = 1; i <= n; i++) { if (a[i] == 0) { cout << i; return 0; } } cout << -1 ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 222222; unsigned long long p4423[maxn]; struct State { unsigned long long hashValue; int count; void assign(int value) { if (value == 0) { hashValue = 0; count = 0; } else { hashValue = value; count = 1; } } void assign(const State &l, const State &r) { hashValue = p4423[r.count] * l.hashValue + r.hashValue; count = l.count + r.count; } }; State states[maxn * 2]; int n, m; int a[maxn], b[maxn]; int pos[maxn]; void update(int l, int r, int p, int v) { if (l == r) { if (p == l) { states[(((l) + (r)) | ((l) != (r)))].assign(v); } return; } int m = l + r >> 1; if (p <= m) { update(l, m, p, v); } if (p > m) { update(m + 1, r, p, v); } states[(((l) + (r)) | ((l) != (r)))].assign( states[(((l) + (m)) | ((l) != (m)))], states[(((m + 1) + (r)) | ((m + 1) != (r)))]); } int main() { p4423[0] = 1; for (int i = 1; i < maxn; i++) { p4423[i] = p4423[i - 1] * 4423; } scanf( %d%d , &n, &m); unsigned long long targetHash = 0, ones = 0; for (int i = 0; i < n; i++) { scanf( %d , a + i); targetHash = targetHash * 4423 + a[i]; ones = ones * 4423 + 1; } for (int i = 0; i < m; i++) { scanf( %d , b + i); pos[b[i]] = i; } for (int i = 1; i < n; i++) { update(0, m - 1, pos[i], i); } int ret = 0; for (int i = n; i <= m; i++) { update(0, m - 1, pos[i], i); assert(states[(((0) + (m - 1)) | ((0) != (m - 1)))].count == n); if (states[(((0) + (m - 1)) | ((0) != (m - 1)))].hashValue == targetHash) { ret++; } targetHash += ones; update(0, m - 1, pos[i - n + 1], 0); } printf( %d n , ret); }
#include <bits/stdc++.h> using namespace std; signed main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; long long int x = a[0]; for (long long int i = n - 1; i > 0; i--) { a[i] -= a[i - 1]; if (a[i] < 0) x += a[i]; } if (x >= 0) cout << YES << endl; else { cout << NO << endl; } } }
#include <bits/stdc++.h> using namespace std; int n, m; vector<pair<long long, int> > vertices; bool cmp(pair<long long, int> x, pair<long long, int> y) { return x.first < y.first; } bool cmp2(pair<long long, pair<int, int> > x, pair<long long, pair<int, int> > y) { return x.first < y.first; } int lab[200010]; vector<pair<long long, pair<int, int> > > ed; void uni(int r1, int r2) { int x = lab[r1] + lab[r2]; if (lab[r1] < lab[r2]) { lab[r1] = x; lab[r2] = r1; } else { lab[r2] = x; lab[r1] = r2; } } int get(int x) { if (lab[x] < 0) return x; lab[x] = get(lab[x]); return lab[x]; } static int desyncIO = []() { std::ios::sync_with_stdio(false); std::cout.tie(nullptr); std::cin.tie(nullptr); return 0; }(); int main() { ios::sync_with_stdio(false); memset(lab, -1, sizeof(lab)); cin >> n >> m; for (int i = 1; i <= n; i++) { long long x; cin >> x; vertices.push_back(make_pair(x, i)); } sort(vertices.begin(), vertices.end(), cmp); for (int i = 1; i < n; i++) { int u = vertices[0].second; int v = vertices[i].second; long long w = vertices[0].first + vertices[i].first; ed.push_back(make_pair(w, make_pair(u, v))); } for (int i = 1; i <= m; i++) { int u, v; long long w; cin >> u >> v >> w; ed.push_back(make_pair(w, make_pair(u, v))); } sort(ed.begin(), ed.end(), cmp2); long long ret = 0; for (int i = 0; i < ed.size(); i++) { int u = ed[i].second.first; int v = ed[i].second.second; long long w = ed[i].first; int r1 = get(u); int r2 = get(v); if (r1 != r2) { ret += w; uni(r1, r2); } } cout << ret; return 0; }
#include <bits/stdc++.h> using namespace std; vector<string> com; vector<int> num; vector<string> adj[1000010]; struct node { string s; int i; node() {} node(string x, int idx) { s = x; i = idx; } }; int toNum(string s) { int i, j, k; int l = s.length(); k = 1; j = 0; for (i = l - 1; i >= 0; i--) { j += (s[i] - 48) * k; k *= 10; } return j; } int jdx, sz; void solve(node x, int lvl) { if (lvl >= 0) adj[lvl].push_back(x.s); if (lvl >= 0 && num[x.i] == 0) return; while (jdx < sz) { if (lvl == -1) { node temp = node(com[jdx], jdx); jdx++; solve(temp, lvl + 1); } else { while (num[x.i] > 0) { num[x.i]--; node temp = node(com[jdx], jdx); jdx++; solve(temp, lvl + 1); } if (!num[x.i]) return; } } } int main() { int i, j, k; int n, m; string s, t; cin >> s; t = ; n = s.length(); for (i = 0; i < n; i++) { if (s[i] == , ) { if (isdigit(t[0])) num.push_back(toNum(t)); else com.push_back(t); t = ; } else { t += s[i]; } } num.push_back(toNum(t)); jdx = 0; sz = com.size(); node r = node( root , -1); solve(r, -1); k = 0; for (i = 0; i < 1000010; i++) { if (adj[i].size() > 0) k++; else break; } printf( %d n , k); for (i = 0; i < k; i++) { m = adj[i].size(); for (j = 0; j < m; j++) cout << adj[i][j] << ; printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n; cin >> m; cin >> k; bool done = false; int num = 0; int lanes = 0; int desks = 0; int d = 0; while (num < k) { desks = 0; done = false; num += 2 * m; lanes++; while (done == false) { if (d >= num || d >= k) { done = true; break; } d += 2; desks++; } } cout << lanes << << desks << ; if (k % 2 == 0) { cout << R << endl; } else cout << L << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 0x3f3f3f3f; const long long MAXN = 3e5 + 5; long long n, MOD, k, ans; map<long long, long long> mp; signed main() { scanf( %lld%lld%lld , &n, &MOD, &k); for (long long i = 1; i <= n; i++) { long long x; scanf( %lld , &x); x = (x * x % MOD * x % MOD * x % MOD + MOD - x * k % MOD) % MOD; mp[x]++; } for (map<long long, long long>::iterator it = mp.begin(); it != mp.end(); it++) { long long x = it->second; ans += (x - 1) * x / 2; } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long binpow(long long a, long long b) { a = a % 1000000007; long long res = 1; while (b > 0) { if (b & 1) res *= a % 1000000007; a = a * a % 1000000007; b = b >> 1; } return res; } void speedup() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int dx[] = {1, -1, 2, 2, -2, -2, 1, -1}; int dy[] = {2, 2, 1, -1, 1, -1, -2, -2}; int bfs(int sx, int sy, int desx, int desy) { int vis[9][9]; int d[9][9]; for (int i = 1; i <= 8; i++) { for (int j = 1; j <= 8; j++) { vis[i][j] = 0; d[i][j] = 0; } } vis[sx][sy] = 1; queue<pair<int, int> > q; q.push(pair<int, int>(sx, sy)); while (!q.empty()) { pair<int, int> top = q.front(); q.pop(); for (int i = 0; i < 8; i++) { int tx = top.first + dx[i]; int ty = top.second + dy[i]; if (tx >= 1 && tx <= 8 && ty >= 1 && ty <= 8 && vis[tx][ty] == 0) { vis[tx][ty] = 1; d[tx][ty] = d[top.first][top.second] + 1; q.push(pair<int, int>(tx, ty)); } } } return d[desx][desy]; } int main() { speedup(); int n; cin >> n; int a[n], l[n], r[n]; for (int i = 0; i < n; i++) cin >> l[i]; for (int i = 0; i < n; i++) cin >> r[i]; for (int i = 0; i < n; i++) a[i] = n - l[i] - r[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { l[i] -= (a[j] > a[i]); } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { r[i] -= (a[j] > a[i]); } } for (int i = 0; i < n; i++) { if (l[i] != 0 || r[i] != 0) { cout << NO n ; return 0; } } cout << YES n ; for (int i = 0; i < n; i++) cout << a[i] << ; cout << n ; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, c, r, x, y, z, i, j, k, count = 0, result; cin >> a >> b >> c >> r; x = c - r; y = c + r; r = (a >= b) ? a : b; z = (a <= b) ? a : b; a = z; b = r; if (x < a && y <= b && y >= a) count = y - a; else if (x >= a && y <= b) count = y - x; else if (x < b && x >= a && y > b) count = b - x; else if (x < a && y > b) count = b - a; else count = 0; result = b - a - count; cout << result << n ; } }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; using namespace std; const string tp[4] = { aaaa , aabb , abab , abba }; int n, k; int m; string w[10000]; int prime(int x) { if (x == 1) return 0; for (int i = 2; i * i <= x; i++) if (x % i == 0) return 0; return 1; } int check(int x, int y) { if (x > n || x < 1 || y >= m || y < 0) return 0; return 1; } long long gcd(long long a, long long b) { if (b == 0) { return a; } return gcd(b, a % b); } int vowel(char t) { if (t == a || t == e || t == i || t == o || t == u ) return 1; return 0; } int main() { cin >> n >> k; int bad = 0; for (int i = 0; i < n * 4; i++) { string s; cin >> s; w[i] = ; int l = 0; while (l < k and s.size()) { char c = s[s.size() - 1]; w[i] += c; s.erase(s.size() - 1); l += vowel(c); } if (l < k) { bad = 1; } } if (!bad) { for (int t = 0; t < 4; t++) { int ok2 = 1; for (int i = 0; i < n * 4; i += 4) { int ok = 1; for (int p = 0; p < 4 and ok; p++) { for (int q = p + 1; q < 4 and ok; q++) { if (tp[t][p] == tp[t][q] and w[i + p] != w[i + q]) { ok = 0; } } } if (!ok) { ok2 = 0; break; } } if (ok2) { cout << tp[t]; return 0; } } } cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 5; int n, k, l, sm[MAXN]; char s[MAXN]; pair<long long, long long> dp[MAXN]; long long solve(char a) { for (int i = 1; i <= n; i++) sm[i] = sm[i - 1] + (s[i] == a); int lo = 0, hi = l; long long ans = 0; while (lo <= hi) { int mi = (lo + hi) / 2; for (int i = 1; i <= l; i++) dp[i] = max(dp[i - 1], {sm[i] - mi, -1}); for (int i = l + 1; i <= n; i++) dp[i] = max(dp[i - 1], {dp[i - l].first + sm[i] - sm[i - l] - mi, dp[i - l].second - 1}); if (-dp[n].second <= k) hi = mi - 1, ans = dp[n].first; else lo = mi + 1; } return sm[n] - k * lo - ans; } int main() { scanf( %d %d %d , &n, &k, &l); scanf( %s , s + 1); if ((long long)k * (long long)l >= n) return !printf( 0 n ); for (int i = 1; i <= n; i++) s[i] = a <= s[i] ? a : b ; printf( %I64d n , min(solve( a ), solve( b ))); return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 9; int main() { long long n, m; cin >> n >> m; vector<int> row(n), col(n); int r = 0, c = 0; int x, y; long long ans = n * n; for (int i = 0; i < m; i++) { scanf( %d %d , &x, &y); long long v = 0; if (row[x - 1] == 0 && col[y - 1] == 0) v = n + n - (1 + r + c); else if (row[x - 1] && col[y - 1]) v = 0; else if (row[x - 1]) v = n - r; else if (col[y - 1]) v = n - c; ans -= v; if (row[x - 1] == 0) row[x - 1] = 1, r++; if (col[y - 1] == 0) col[y - 1] = 1, c++; printf( %lld , ans); } printf( n ); }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long tecpoint = 0; vector<long long> mas(n); for (int i = 0; i < n; i++) { long long a; cin >> mas[i]; } vector<long long> questions(m); vector<bool> visited(n); for (int i = 0; i < m; i++) { int a; cin >> a; a--; questions[i] = mas[a]; visited[a] = 1; } for (int i = 0; i < n; i++) { if (!visited[i]) tecpoint += mas[i]; } vector<bool> take(m); for (int i = 0; i < m; i++) { long long tecma = 0; long long tecmai = 0; for (int j = 0; j < m; j++) { if (take[j]) continue; if (max(questions[j], tecpoint) > tecma) { tecma = max(questions[j], tecpoint); tecmai = j; } } tecpoint += tecma; take[tecmai] = 1; } cout << tecpoint << ; return 0; }
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, m, i; scanf( %d , &n); m = 1; for (i = 1; i < n; i++) { m = (m + i); if (m > n) m -= n; printf( %d , m); if (i < n) printf( ); else printf( n ); } return EXIT_SUCCESS; }
#include <bits/stdc++.h> using namespace std; long long x, y, c; int n; const int maxn = 300009; char str[maxn]; long long cnt = 0; int main() { cin >> n >> x >> y; cin >> str; int now = 0; for (int i = 0; i < n; ++i) { if (str[i] == 1 ) { if (now != 0) cnt++; now = 0; } else { now++; } } if (now) cnt++; if (!cnt) return 0 * puts( 0 ); if (y <= x) cout << cnt * y << endl; else { cout << (cnt - 1) * x + y << endl; } return 0; }
#include <bits/stdc++.h> int main() { int n, bags[100000], i; scanf( %d , &n); for (i = 0; i < (n * n); i++) bags[i] = (i + 1); for (i = 0; i < ((n * n) / 2); i += 2) { printf( %d , bags[i]); printf( %d , bags[(n * n) - i - 1]); } printf( n ); for (i = 1; i <= (((n * n) / 2)); i += 2) { printf( %d , bags[i]); printf( %d , bags[(n * n) - i - 1]); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int n; vector<int> g[MAXN]; int d[MAXN]; int bio[MAXN]; void dfs(int x, int dep) { d[x] = dep; bio[x] = 1; for (int i : g[x]) if (!bio[i]) dfs(i, dep + 1); } int main() { scanf( %d , &n); int a, b; for (int i = 0; i < n - 1; i++) { scanf( %d%d , &a, &b); a--; b--; g[a].push_back(b); g[b].push_back(a); } dfs(0, 1); double rj = 0; for (int i = 0; i < n; i++) { rj += 1.0 / d[i]; } printf( %lf n , rj); return 0; }
#include <bits/stdc++.h> using namespace std; inline long long read() { char c = getchar(); long long x = 0; bool f = 0; for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45); for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); if (f) x = -x; return x; } const long long maxn = 2007, maxm = 4007, inf = 0x3f3f3f3f3f3f3f3f; long long n, m, s, t, maxflow; long long dep[maxn], cur[maxn], de[maxn]; long long tot = 1, head[maxn]; struct edge { long long to, nxt, w; } e[maxm << 1]; inline void adde(long long u, long long v, long long w) { e[++tot] = (edge){v, head[u], w}; head[u] = tot; } inline void add(long long u, long long v, long long w) { adde(u, v, w); adde(v, u, 0); } inline void ins(long long u, long long v, long long l, long long r) { add(u, v, r - l), de[u] -= l, de[v] += l; } bool bfs(long long s, long long t) { queue<long long> q; memcpy(cur, head, sizeof cur); memset(dep, 63, sizeof dep); dep[s] = 0; q.push(s); while (!q.empty()) { long long u = q.front(); q.pop(); for (long long i = head[u]; i; i = e[i].nxt) { long long v = e[i].to; if (dep[v] == inf && e[i].w) { dep[v] = dep[u] + 1; q.push(v); } } } return dep[t] < inf; } long long dfs(long long u, long long t, long long minn) { if (!minn || u == t) return minn; long long res = 0; for (long long i = cur[u]; i; i = e[i].nxt) { long long v = e[i].to; cur[u] = i; if (dep[v] != dep[u] + 1) continue; long long flow = dfs(v, t, min(minn, e[i].w)); if (!flow) continue; res += flow, minn -= flow; e[i].w -= flow, e[i ^ 1].w += flow; if (!minn) break; } if (!res) dep[u] = 0; return res; } inline long long dinic(long long s, long long t) { long long maxflow = 0; while (bfs(s, t)) maxflow += dfs(s, t, inf); return maxflow; } long long a[maxn], b[maxn], c[maxn], d[maxn], uu[maxn], vv[maxn], lim = 100000000; map<long long, long long> mp; long long func(long long v) { if (mp.count(v)) return mp[v]; for (register long long i = (1); i <= (n + 2); ++i) head[i] = de[i] = 0; s = n + 1, t = n + 2; tot = 1; for (register long long i = (1); i <= (m); ++i) { long long l = a[i] * v + b[i] * lim, r = c[i] * v + d[i] * lim; ins(uu[i], vv[i], l, r); } long long res = 0; for (register long long i = (1); i <= (n); ++i) if (de[i] > 0) add(s, i, de[i]), res += de[i]; else add(i, t, -de[i]); return mp[v] = res - dinic(s, t); } signed main() { n = read(), m = read(); for (register long long i = (1); i <= (m); ++i) { uu[i] = read(), vv[i] = read(); a[i] = read(), b[i] = read(), c[i] = read(), d[i] = read(); } func(75000004); long long l = 0, r = lim; while (r - l >= 5) { long long m1 = l + (r - l) / 3, m2 = r - (r - l) / 3; if (func(m1) < func(m2)) r = m2; else l = m1; } pair<long long, long long> mg = make_pair(inf, inf); for (register long long i = (l); i <= (r); ++i) mg = min(mg, make_pair(func(i), i)); if (mg.first) { puts( 0 ); return 0; } l = mg.second + 1, r = lim; long long resl = mg.second, resr = mg.second; while (l <= r) { long long mid = l + r >> 1; if (!func(mid)) resr = mid, l = mid + 1; else r = mid - 1; } l = 0, r = mg.second - 1; while (l <= r) { long long mid = l + r >> 1; if (!func(mid)) resl = mid, r = mid - 1; else l = mid + 1; } printf( %.8lf , 1.0 * (resr - resl) / lim); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 200009; const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0); int n, k, tot; cin >> n >> k; tot = n; vector<int> sta, vis(n + 2); vis[n + 1] = 1; int cur = 1; vector<int> ans; for (int i = 0; i < k; ++i) { int t; cin >> t; ans.push_back(t); sta.push_back(t); vis[t] = 1; tot--; while (((int)(sta).size()) && sta.back() == cur) { cur++; sta.pop_back(); } } for (int i = 1; i < ((int)(sta).size()); ++i) { if (sta[i] > sta[i - 1]) { cout << -1 n ; return 0; } } while (tot) { while (((int)(sta).size()) && sta.back() == cur) { cur++; sta.pop_back(); } int top; if (((int)(sta).size()) == 0) top = n + 1; else top = sta.back(); for (int i = top; i >= cur; --i) { if (!vis[i]) sta.push_back(i), tot--, ans.push_back(i); vis[i] = 1; } } for (int i : ans) cout << i << ; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; long long arr[200005], lazy[4 * 200005], seg[4 * 200005]; void build(int node, int start, int end) { int mid = (start + end) / 2; if (start == end) { lazy[node] = 0; seg[node] = arr[start]; return; } build(2 * node, start, mid); build(2 * node + 1, mid + 1, end); seg[node] = min(seg[2 * node], seg[2 * node + 1]); } void update(int node, int start, int end, int left, int right, long long val) { int mid = (start + end) / 2; if ((start > right) || (end < left)) return; if ((left <= start) && (end <= right)) { lazy[node] += val; seg[node] += val; return; } else { update(2 * node, start, mid, left, right, val); update(2 * node + 1, mid + 1, end, left, right, val); seg[node] = min(seg[2 * node], seg[2 * node + 1]) + lazy[node]; } } long long query(int node, int start, int end, int left, int right) { int mid = (start + end) / 2; if ((start > right) || (end < left)) return LLONG_MAX; if ((left <= start) && (end <= right)) return seg[node]; else return lazy[node] + min(query(2 * node, start, mid, left, right), query(2 * node + 1, mid + 1, end, left, right)); } int main() { int n, m, lf, rg; long long v; char c; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &arr[i]); build(1, 0, n - 1); scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %d%d , &lf, &rg); c = getchar(); if (c != n ) { scanf( %lld , &v); if (lf <= rg) update(1, 0, n - 1, lf, rg, v); else { update(1, 0, n - 1, lf, n - 1, v); update(1, 0, n - 1, 0, rg, v); } } else { if (lf <= rg) printf( %lld n , query(1, 0, n - 1, lf, rg)); else printf( %lld n , min(query(1, 0, n - 1, lf, n - 1), query(1, 0, n - 1, 0, rg))); } } return 0; }
#include <bits/stdc++.h> using namespace std; int sa[100005], s1[100005]; char s[100005]; int save[6]; int main() { int n; while (scanf( %d , &n) != EOF) { for (int a = 1; a <= n; a++) scanf( %d , &sa[a]); scanf( %s , s + 1); int l = -1000000000, r = 1000000000; for (int a = 1; a <= n; a++) s1[a] = s[a] - 48; for (int a = 5; a <= n; a++) { for (int b = a - 4; b <= a; b++) save[b - (a - 5)] = sa[b]; sort(save + 1, save + 1 + 5); if (s1[a - 1] == 0 && s1[a - 2] == 0 && s1[a - 3] == 0 && s1[a - 4] == 0) { if (s1[a] == 1 && s1[a - 1] != 1) l = max(l, save[5] + 1); else { continue; } } else if (s1[a - 1] == 1 && s1[a - 2] == 1 && s1[a - 3] == 1 && s1[a - 4] == 1) { if (s1[a] == 0 && s1[a - 1] != 0) { r = min(r, save[1] - 1); } else continue; } else { continue; } } printf( %d %d n , l, r); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; int cnt = 0; if (a > x) cnt += (a - x) / 2; if (b > y) cnt += (b - y) / 2; if (c > z) cnt += (c - z) / 2; if (a < x) if (x - a <= cnt) { cnt -= x - a; a += x - a; } if (b < y) if (y - b <= cnt) { cnt -= y - b; b += y - b; } if (c < z) if (z - c <= cnt) { cnt -= z - c; c += z - c; } if (a >= x && b >= y && c >= z) cout << Yes << endl; else cout << No << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, to[N << 1], nxt[N << 1], head[N], cnt; int len[N], son[N], tmp[N], *f[N], *id = tmp, ans[N]; void link(int u, int v) { to[++cnt] = v; nxt[cnt] = head[u]; head[u] = cnt; to[++cnt] = u; nxt[cnt] = head[v]; head[v] = cnt; } void dfs(int u, int ff) { for (int e = head[u]; e; e = nxt[e]) if (to[e] != ff) { dfs(to[e], u); if (len[to[e]] > len[son[u]]) son[u] = to[e]; } len[u] = len[son[u]] + 1; } void dp(int u, int ff) { f[u][0] = 1; if (son[u]) f[son[u]] = f[u] + 1, dp(son[u], u), ans[u] = ans[son[u]] + 1; for (int e = head[u]; e; e = nxt[e]) { int v = to[e]; if (v == ff || v == son[u]) continue; f[v] = id; id += len[v]; dp(v, u); for (int j = 1; j <= len[v]; ++j) { f[u][j] += f[v][j - 1]; if ((j < ans[u] && f[u][j] >= f[u][ans[u]]) || (j > ans[u] && f[u][j] > f[u][ans[u]])) ans[u] = j; } } if (f[u][ans[u]] == 1) ans[u] = 0; } int main() { cin >> n; for (int i = 1; i < n; ++i) { int u, v; scanf( %d%d , &u, &v); link(u, v); } dfs(1, 0); f[1] = id; id += len[1]; dp(1, 0); for (int i = 1; i <= n; ++i) printf( %d n , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; long long int power(long long int n, long long int k) { long long int ans = 1; long long int mod = 1000000007; while (k) { if (k & 1) ans = (ans * n) % mod, k--; n = (n * n) % mod, k >>= 2; } return ans; } long long int mod(long long int n, long long int k) { long long int ans = n % k; if (n < 0) ans += k; return ans; } string cins() { char ss[1000000]; fgets(ss, 1000000, stdin); string s; for (int i = 0; i < strlen(ss); i++) s += ss[i]; return s; } void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int tt; cin >> tt; for (int T = 1; T < tt + 1; T++) solve(); return 0; } void solve() { int n; cin >> n; int ans = 0; for (int i = 1; i < n + 1; i++) { int x; cin >> x; if (x > i + ans) ans += x - (i + ans); } { cout << ans << n ; return; }; ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, ar[110]; while (cin >> n) { for (int i = 0; i < n; i++) { cin >> ar[i]; } if ((n % 2 == 1) && (ar[0] % 2 == 1) && (ar[n - 1] % 2 == 1)) cout << Yes << endl; else cout << No << endl; } }
#include <bits/stdc++.h> const double inf = 1e19; const double eps = 1e-9; int ch[600050][2]; double K[600050], B[600050], L[600050], R[600050]; double TK[600050], TB[600050], TX[600050]; int fa[600050]; double x[300050], y[300050]; double q, a, b; int n, tot, root; inline int dir(int x) { return x == ch[fa[x]][1]; } inline void mutate(int x, double tk, double tb, double tx) { if (x >= 3) { L[x] += tx; R[x] += tx; B[x] += tb - K[x] * tx; K[x] += tk; } if (x) { TX[x] += tx; TB[x] += tb - TK[x] * tx; TK[x] += tk; } } inline void release(int x) { mutate(ch[x][0], TK[x], TB[x], TX[x]); mutate(ch[x][1], TK[x], TB[x], TX[x]); TK[x] = 0; TB[x] = 0; TX[x] = 0; } inline void rotate(int x) { int y, z, a, b, c; y = fa[x]; z = fa[y]; b = dir(x); a = ch[x][!b]; if (z) { c = dir(y); ch[z][c] = x; } else root = x; fa[x] = z; fa[y] = x; ch[x][!b] = y; ch[y][b] = a; if (a) fa[a] = y; } void splay(int x, int i) { int y, z, b, c; while (fa[x] != i) { y = fa[x]; z = fa[y]; if (z == i) { release(y); release(x); rotate(x); } else { b = dir(x); c = dir(y); release(z); release(y); release(x); if (b ^ c) { rotate(x); rotate(x); } else { rotate(y); rotate(x); } } } release(x); } inline void newnode(int f, int d, double k, double b, double l, double r) { tot++; ch[tot][0] = 0; ch[tot][1] = 0; fa[tot] = f; if (f) ch[f][d] = tot; else root = tot; K[tot] = k; B[tot] = b; L[tot] = l; R[tot] = r; TK[tot] = 0; TB[tot] = 0; TX[tot] = 0; } int find_minmax(int i, int d) { while (ch[i][d]) { release(i); i = ch[i][d]; } return i; } inline double calc(int i, double x) { return K[i] * x + B[i]; } int find(int x) { int y; if (x < 3) return 0; release(x); if (K[x] * R[x] + B[x] >= 0) { y = find(ch[x][0]); if (y) return y; else return x; } return find(ch[x][1]); } int main() { double ans; int i, X, Y; scanf( %d%lf%lf%lf , &n, &q, &a, &b); for (i = 1; i <= n; i++) scanf( %lf , &x[i]); tot = 0; newnode(0, 0, 0, -inf, -inf, -inf); newnode(1, 1, 0, inf, inf, inf); newnode(2, 0, 2, -x[1] * 2, 1, q - (n - 1) * a); for (i = 1; i <= n; i++) { splay(1, 0); splay(2, 1); X = ch[2][0]; Y = find_minmax(X, 1); if (K[Y] * R[Y] + B[Y] < 0) y[i] = R[Y]; else { Y = find(X); if (K[Y] * L[Y] + B[Y] > 0) y[i] = L[Y]; else y[i] = -B[Y] / K[Y]; } if (i < n) { if (b - a > eps) { splay(Y, 0); if (y[i] - L[Y] < eps) { X = find_minmax(ch[Y][0], 1); splay(X, Y); newnode(X, 1, 0, 0, y[i] + a, y[i] + b); } else if (R[Y] - y[i] < eps) { X = find_minmax(ch[Y][1], 0); splay(X, Y); newnode(X, 0, 0, 0, y[i] + a, y[i] + b); } else { X = find_minmax(ch[Y][1], 0); splay(X, Y); newnode(X, 0, K[Y], B[Y], y[i], R[Y]); R[Y] = y[i]; newnode(tot, 0, 0, 0, y[i] + a, y[i] + b); } splay(tot, 0); mutate(ch[tot][0], 0, 0, a); mutate(ch[tot][1], 0, 0, b); } else mutate(root, 0, 0, a); mutate(root, 2, -x[i + 1] * 2, 0); splay(2, 0); Y = find_minmax(ch[2][0], 1); while (L[Y] >= q - (n - i - 1) * a) { splay(Y, 2); X = ch[Y][0]; ch[2][0] = X; fa[X] = 2; Y = find_minmax(ch[2][0], 1); } if (R[Y] > q - (n - i - 1) * a) R[Y] = q - (n - i - 1) * a; } } for (i = n - 1; i >= 1; i--) if (y[i + 1] - y[i] < a) y[i] = y[i + 1] - a; else if (y[i + 1] - y[i] > b) y[i] = y[i + 1] - b; ans = 0; for (i = 1; i <= n; i++) { printf( %.7lf , y[i]); ans += (y[i] - x[i]) * (y[i] - x[i]); } printf( n%.7lf n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; static const int N = 500005; long long l[N]; long long d[N]; char s[N]; int main() { int a, b, t, n; cin >> n >> a >> b >> t; scanf( %s , &s); l[0] = 1 + b * (s[0] == w ); for (int i = 1; i < n; i++) l[i] = 1 + l[i - 1] + a + b * (s[i] == w ); for (int i = n - 1; i >= 0; i--) d[i] = 1 + d[i + 1] + a + b * (s[i] == w ); int j = 1; int m = 0; for (int i = 0; i < n; i++) { while (j < n && l[i] + d[j] + i * a > t) j++; if ((j < n || l[i] <= t) && i + 1 + n - j > m) m = i + 1 + n - j; } int m1 = m; int i = 1; j = n - 1; while (i < j) { swap(s[i], s[j]); i++; j--; } l[0] = 1 + b * (s[0] == w ); for (int i = 1; i < n; i++) l[i] = 1 + l[i - 1] + a + b * (s[i] == w ); for (int i = n - 1; i >= 0; i--) d[i] = 1 + d[i + 1] + a + b * (s[i] == w ); j = 1; m = 0; for (int i = 0; i < n; i++) { while (j < n && l[i] + d[j] + i * a > t) j++; if ((j < n || l[i] <= t) && i + 1 + n - j > m) m = i + 1 + n - j; } m = max(m, m1); cout << min(m, n) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int nod = 1e9 + 7; const int modulo = (119 << 23) + 1; const int maxn = 3e5 + 1; int n, m; vector<int> a(maxn); int test() { std::ios::sync_with_stdio(false); std::cin.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; int l = 0, r = m; while (l < r) { bool flag = false; int mid = (l + r) / 2; int now = 0; for (int i = 0; i < n; i++) { int x = a[i], y = a[i] + mid; if (x <= now && y >= now || x <= now + m && y >= now + m) continue; if (now >= x) { flag = true; break; } now = a[i]; } if (flag) l = mid + 1; else r = mid; } cout << l; return 0; } int solve(int tmp[], int a, int b, int n) { int cnt = 0; int div = tmp[b] - tmp[a]; int now = 2; for (int i = b + 1; i < n; i++) { if (tmp[i] == tmp[a] + div * now) { cnt++, now++; } } return cnt; } static int search(int num, int b[], int n) { for (int i = 0; i < n; i++) { if (b[i] == num) { i + 1; return 0; } } return 1; } int donot() { return 0; } int hack() { return 1; } string me() { const char* s = do not hack me ; return s; } class havenoidea { int ameaninglessnum = 49935; bool iamanaduit = 1; public: int iwillsolvefiveproblems(int x) { return x; } }; int main() { if (hack()) donot(); int tmp[6] = {1, 1, 4, 5, 1, 4}; solve(tmp, search(114514, tmp, 6), 1, 6); int a, b, c, d; havenoidea fuck; fuck.iwillsolvefiveproblems(hack()); test(); if (me() == do not fack me ) if (me() == do not hack me ) hack() == donot(); return 0; }
#include <bits/stdc++.h> using namespace std; char a[200000], b[200000]; int kmp[200000]; int n, m, i, j, first, curr, val[200000], l; int dyn[200000]; int sum[200000]; int MOD = 1000000007; int main(void) { cin >> b >> a; n = strlen(a); m = strlen(b); kmp[0] = 1; if (n == 1) { for (i = 0; i <= m - 1; i++) { if (a[0] == b[i]) { l++; val[l] = i; } } } else { for (i = 1; i <= n - 1; i++) { j = kmp[i - 1]; while (j < i && a[i] != a[i - j]) j += kmp[i - 1 - j]; if (j == i) { if (a[i] == a[0]) kmp[i] = i; else kmp[i] = i + 1; } else kmp[i] = j; } if (a[0] == b[0]) { first = 0; } else { first = 1; } for (i = 1; i <= m - 1; i++) { while (first < i && b[i] != a[i - first]) first += kmp[i - 1 - first]; if (first == i) { if (b[i] == a[0]) first = i; else first = i + 1; } if (i - first == n - 1) { l++; val[l] = first; first += kmp[n - 1]; } } } val[0] = -1; dyn[m] = 0; sum[m] = 1; for (i = m - 1; i >= 0; i--) { while (l > 1 && val[l - 1] >= i) l--; if (val[l] >= i) { dyn[i] = dyn[i + 1] + sum[val[l] + n]; if (dyn[i] >= MOD) dyn[i] -= MOD; sum[i] = sum[i + 1] + dyn[i] + 1; if (sum[i] >= MOD) sum[i] -= MOD; } else { dyn[i] = 0; sum[i] = sum[i + 1] + 1; } } cout << dyn[0]; return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9, MOD = INF + 7; const int N = 1e5 + 5; int n, a[N], nxt[N], lucky[N]; struct Node { int mn = INF, cnt = 0, idx = -1, lazy = 0; } seg[4 * N]; int doLuck(int i, int x) { if (x > 1e4) return i; if (x) lucky[i] = x, i++; i = doLuck(i, 10 * x + 4); return doLuck(i, 10 * x + 7); } void apply(int id, int x) { seg[id].mn += x; seg[id].lazy += x; } void shift(int id) { if (seg[id].lazy == 0) return; apply(2 * id, seg[id].lazy); apply(2 * id + 1, seg[id].lazy); seg[id].lazy = 0; } Node merge(const Node &x, const Node &y) { Node z; z.mn = min(x.mn, y.mn); if (z.mn == y.mn) z.cnt += y.cnt, z.idx = y.idx; if (z.mn == x.mn) z.cnt += x.cnt, z.idx = x.idx; return z; } void build(int id = 1, int s = 0, int e = n) { if (e - s < 2) { int d = lucky[0] - a[s]; seg[id].mn = d; seg[id].cnt = 1; seg[id].idx = s; return; } int md = (s + e) / 2; build(2 * id, s, md); build(2 * id + 1, md, e); seg[id] = merge(seg[2 * id], seg[2 * id + 1]); } void update(int l, int r, int x, int id = 1, int s = 0, int e = n) { if (l >= e || s >= r) return; if (l <= s && e <= r) { apply(id, x); return; } shift(id); int md = (s + e) / 2; update(l, r, x, 2 * id, s, md); update(l, r, x, 2 * id + 1, md, e); seg[id] = merge(seg[2 * id], seg[2 * id + 1]); } Node get(int l, int r, int id = 1, int s = 0, int e = n) { if (l >= e || s >= r) return Node(); if (l <= s && e <= r) return seg[id]; shift(id); int md = (s + e) / 2; return merge(get(l, r, 2 * id, s, md), get(l, r, 2 * id + 1, md, e)); } void recheck() { if (seg[1].mn >= 0) return; int x = seg[1].idx; update(x, x + 1, lucky[nxt[x] + 1] - lucky[nxt[x]]); nxt[x]++; recheck(); } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int m = doLuck(0, 0); sort(lucky, lucky + m); lucky[m] = INF; int q; cin >> n >> q; for (int i = 0; i < n; i++) cin >> a[i]; build(); while (q--) { recheck(); string s; cin >> s; int l, r; cin >> l >> r; l--; if (s == add ) { int d; cin >> d; update(l, r, -d); } else { Node x = get(l, r); cout << (x.mn == 0) * x.cnt << n ; } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; long long qpow(long long x, long long y) { long long ret = 1; while (y) { if (y & 1) ret = ret * x % MOD; y >>= 1; x = x * x % MOD; } return ret % MOD; } int main() { long long n, sum = 0, C = 1; scanf( %lld , &n); for (int i = 1; i <= n; i++) { C = C * (n - i + 1) % MOD * qpow(i, MOD - 2) % MOD; if (i & 1) sum = (sum + C * qpow(3, i) % MOD * qpow(3, n * (n - i))) % MOD; else sum = ((sum - C * qpow(3, i) % MOD * qpow(3, n * (n - i))) % MOD + MOD) % MOD; } sum = sum * 2 % MOD; C = 1; long long ans = 0; for (int i = 0; i < n; i++) { if (i) C = C * (n - i + 1) % MOD * qpow(i, MOD - 2) % MOD; long long tmp = qpow(((1 - qpow(3, i)) % MOD + MOD) % MOD, n); if (n & 1) tmp = (tmp + qpow(3, i * n)) % MOD; else tmp = (tmp - qpow(3, i * n) + MOD) % MOD; if (i & 1) ans = (ans + tmp * C) % MOD; else ans = ((ans - tmp * C) % MOD + MOD) % MOD; } cout << (sum + ans * 3) % MOD << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int mp[200005]; int a[200005]; int n; int main() { int y, T, n, m, i, t, j, k, x; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &x); mp[x] = i + 1; } for (i = 0; i < n; i++) { scanf( %d , &x); a[i] = mp[x]; } int c = 1; int ans = 0; for (i = 0; i < n; i++) { if (a[i] == c) { c++; ans++; } } printf( %d n , n - ans); return 0; }
#include <bits/stdc++.h> using namespace std; void equalse(int arr[], int n) { int m = 0, c = 0; for (int i = 0; i < n; i += 2) { if (arr[i] > arr[i + 1]) m++; if (arr[i] < arr[i + 1]) c++; } if (c > m) cout << Chris ; if (m > c) cout << Mishka ; if (m == c) cout << Friendship is magic!^^ ; } void input(int arr[], int n) { for (int i = 0; i < n; i++) cin >> arr[i]; } int main() { int n; cin >> n; n *= 2; int arr[n]; input(arr, n); equalse(arr, n); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, i, j; cin >> n; int x[n], y[n]; for (i = 0; i < n; ++i) { cin >> x[i] >> y[i]; } long long int c1 = 0, c2 = 0; std::map<pair<double, double>, int> d; std::map<double, int> k, pa; for (i = 0; i < n - 1; ++i) { for (j = i + 1; j < n; ++j) { double p, c; if (x[i] != x[j]) { p = (y[j] - y[i]) * 1.000 / (x[j] - x[i]); c = (x[j] * y[i] - x[i] * y[j]) * 1.000 / (x[j] - x[i]); if (!d[make_pair(p, c)]) { d[make_pair(p, c)]++; c1++; pa[p]++; } } else { if (!k[x[i]]) { k[x[i]]++; c2++; } } } } long long int ans = 0; map<double, int>::iterator it; for (it = pa.begin(); it != pa.end(); ++it) { ans += (c1 - (it->second)) * (it->second); } ans = ans / 2; for (it = pa.begin(); it != pa.end(); ++it) { ans += c2 * (it->second); } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; map<long long, long long> f; long long n, mm, ret, cur; long long a[200005], sum[200005]; long long calc(long long m) { f.clear(); ret = cur = 0; for (long long i = 0; i < n; i++) { sum[i + 1] = sum[i] + (a[i] < m ? -1 : 1); f[sum[i + 1]]++; } for (auto it : f) if (it.first > 0) cur += it.second; for (long long i = 0; i < n; i++) { ret += cur; f[sum[i + 1]]--; if (sum[i + 1] > sum[i]) cur--; if (sum[i + 1] > sum[i]) cur -= f[sum[i + 1]]; else cur += f[sum[i]]; } return ret; } int main() { ios::sync_with_stdio(false); vector<long long> v; cin >> n >> mm; for (long long i = 0; i < n; i++) cin >> a[i]; cout << calc(mm) - calc(mm + 1); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int h, m; scanf( %d:%d , &h, &m); int tmp = 0; int htmp = h; tmp = h % 10; tmp = tmp * 10; tmp = tmp + h / 10; if (tmp >= m && tmp < 60) printf( %d n , tmp - m); else { h++; while (true) { tmp = 0; tmp = h % 10; tmp = tmp * 10; tmp = tmp + h / 10; if (tmp < 60) break; h++; } tmp = (h - htmp - 1) * 60 + tmp + (60 - m); if (h == 24) { tmp = 0; printf( %d n , 60 - m); } else printf( %d n , tmp); } return 0; }
#include <bits/stdc++.h> using namespace std; int n, a[200010], pos[200010][3], tag[200010][3]; long long ans, num1, num2, cnt1, cnt2; int main() { int i; scanf( %d , &n); for (i = 1; i <= n * 2; i++) { scanf( %d , &a[i]); pos[a[i]][0]++; pos[a[i]][pos[a[i]][0]] = i; } pos[0][1] = pos[0][2] = 1; for (i = 1; i <= n; i++) { cnt1 = fabs(pos[i][1] - pos[i - 1][1]) + fabs(pos[i][2] - pos[i - 1][2]); cnt2 = fabs(pos[i][1] - pos[i - 1][2]) + fabs(pos[i][2] - pos[i - 1][1]); if (cnt1 < cnt2) ans += cnt1; else ans += cnt2; } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const long long MAX = 3e5 + 10; const long long INF = 1e18; const long long M = 1e6 + 10; int main() { int n, i, j, k, l, p, q; string s; cin >> n >> s; set<char> a; char st[3] = { R , G , B }; for (i = 0; i < n; i++) a.insert(s[i]); if (a.size() == 1) { cout << *a.begin(); return 0; } if (n == 2) { if (s[i] == s[i + 1]) cout << s[i]; else { for (i = 0; i < 3; i++) { if (a.find(st[i]) == a.end()) cout << st[i]; } } } else { if (a.size() == 3) cout << BGR ; else { char ch; string s2 = ; for (i = 0; i < 3; i++) { if (a.find(st[i]) == a.end()) ch = st[i]; } for (i = 0; i < 3; i++) { l = 0; for (j = 0; j < n; j++) { if (s[j] == st[i]) l++; } if (l == 1) { s2 += ch; s2 += st[i]; sort(s2.begin(), s2.end()); cout << s2; break; } } if (l != 1) cout << BGR ; } } }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; void _IOS() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); } long long a[500009], b[500009]; long long n, m, k; map<long long, bool> pg; long long dp[100009][3]; int main() { _IOS(); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int i = n - 2; while (i >= 0 && k--) { a[n - 1] += a[i]; a[i] = 0; i--; } long long mn = (long long)1e10, mx = 0; for (int i = 0; i < n; i++) { mn = min(a[i], mn); mx = max(a[i], mx); } cout << abs(mx - mn) << endl; } }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; int len, S, T; bool o[N * 40][15]; char str[N]; long long n, Ans; struct matrix { long long f[4][4]; matrix() { memset(f, 63, sizeof(f)); } } Trans, bin[70], X; void cmin(long long& x, long long y) { x = x < y ? x : y; } matrix operator*(matrix a, matrix b) { matrix c; for (int i = 0; i < 4; ++i) for (int j = 0; j < 4; ++j) for (int k = 0; k < 4; ++k) cmin(c.f[i][j], a.f[i][k] + b.f[k][j]); return c; } int bfs() { queue<int> q, d; q.push(S), d.push(1); while (!q.empty()) { int u = q.front(), dis = d.front(); q.pop(), d.pop(); if (!o[u * 4 + T][dis + 1]) return dis + 1; for (int i = 0; i < 4; ++i) { int v = u * 4 + i; q.push(v), d.push(dis + 1); } } return 233; } int main() { scanf( %lld , &n); scanf( %s , str + 1); len = strlen(str + 1); for (int i = 1; i <= len; ++i) for (int k = 1, tp = 0; i + k - 1 <= len && k <= 10; ++k) tp = tp * 4 + str[i + k - 1] - A , o[tp][k] = 1; for (int i = 0; i < 4; ++i) for (int j = 0; j < 4; ++j) S = i, T = j, Trans.f[i][j] = bfs() - 1; bin[0] = Trans; for (int i = 1; i < 62; ++i) bin[i] = bin[i - 1] * bin[i - 1]; memset(X.f, 0, sizeof(X.f)); for (int i = 61; ~i; --i) { matrix tmp = X * bin[i]; long long mn = 2e18; for (int j = 0; j < 4; ++j) for (int k = 0; k < 4; ++k) cmin(mn, tmp.f[j][k]); if (mn < n) X = tmp, Ans += 1ll << i; } ++Ans; printf( %lld , Ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long q, t, v, u, w; map<long long, long long> cost; cin >> q; while (q--) { cin >> t; if (t == 1) { cin >> v >> u >> w; while (v != u) { while (u > v) { cost[u] += w; u >>= 1; } while (v > u) { cost[v] += w; v >>= 1; } } } else { cin >> v >> u; long long res = 0; while (v != u) { while (u > v) { res += cost[u]; u >>= 1; } while (v > u) { res += cost[v]; v >>= 1; } } cout << res << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const long long LINF = 1e17; const double DINF = numeric_limits<double>::max(); const int ITER = 300; const int MOD = 1e9 + 7; const double EPS = 1e-10; const int MAXN = 1e5 + 10; int n, m; vector<pair<int, int> > v; void solve() { cin >> n >> m; for (int i = 1; i <= m; i++) { int q, w; cin >> q >> w; v.push_back({w, q}); } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); long long ans = 0; for (int i = 0; i < v.size(); i++) { long long cnt = i + 1; long long need = (cnt & 1) ? cnt * (cnt - 1) / 2 : cnt * (cnt - 1) / 2 + cnt / 2 - 1; if (need + 1 <= n) { ans += v[i].first; } } cout << ans << endl; } int main() { cout << setprecision(12) << fixed; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; int n, root = 0; vector<vector<int>> adj; vector<int> d; void dfs() { d.assign(n, INF); d[root] = 0; queue<int> q; q.push(root); while (!q.empty()) { int cur = q.front(); q.pop(); for (auto nxt : adj[cur]) if (d[nxt] == INF) { d[nxt] = 1 + d[cur]; q.push(nxt); } } } int main() { cin >> n; adj.resize(n); for (int i = 1; i < n; i++) { int p; cin >> p; p -= 1; adj[i].push_back(p); adj[p].push_back(i); } dfs(); vector<int> cnt(n, 0); for (int i = 0; i < n; i++) cnt[d[i]] += 1; int res = 0; for (int i = 0; i < n; i++) res += (cnt[i] & 1); cout << res << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n, h; while (~scanf( %d%d , &n, &h)) { for (int i = 1; i < n; i++) { printf( %f , h * (sqrt((double)i / n))); } printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, dx[]{-1, 0, 0, 1}, dy[]{0, -1, 1, 0}; vector<string> tab; vector<vector<int>> dist; priority_queue<pair<int, pair<int, int>>> PQ; int dijkstra(int x, int y) { dist.assign(n, vector<int>(m, INT_MAX / 2)); dist[x][y] = 1; PQ.push({0, {x, y}}); while (!PQ.empty()) { int d = -PQ.top().first; x = PQ.top().second.first; y = PQ.top().second.second; PQ.pop(); if (d > dist[x][y]) continue; for (int i = 0; i < 4; i++) { int x2 = x + dx[i], y2 = y + dy[i]; if (x2 < 0 or x2 >= n or y2 < 0 or y2 >= m) continue; d = dist[x][y] + (tab[x][y] != tab[x2][y2]); if (dist[x2][y2] > d) { dist[x2][y2] = d; PQ.push({-d, {x2, y2}}); } } } int maxi = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (tab[i][j] == B ) maxi = max(maxi, dist[i][j]); return maxi; } int main() { cin >> n >> m; tab.resize(n); for (int i = 0; i < n; i++) cin >> tab[i]; int ans = INT_MAX; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) ans = min(ans, dijkstra(i, j)); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int dp1[101010] = {0}, dp2[101010] = {0}; int main() { cin.sync_with_stdio(0); cin.tie(0); int n; cin >> n; int h[101010]; for (int i = 0; i < n; i++) cin >> h[i]; dp1[0] = 1; for (int i = 1; i < n - 1; i++) { dp1[i] = dp1[i - 1] + 1; dp1[i] = min(h[i], dp1[i]); if (h[i] > h[i - 1]) { dp1[i] = min(dp1[i], h[i - 1] + 1); } if (h[i] > h[i + 1]) { dp1[i] = min(dp1[i], h[i + 1] + 1); } } dp2[n - 1] = 1; for (int i = n - 2; i >= 1; i--) { dp2[i] = dp2[i + 1] + 1; dp2[i] = min(h[i], dp2[i]); if (h[i] > h[i - 1]) { dp2[i] = min(dp2[i], h[i - 1] + 1); } if (h[i] > h[i + 1]) { dp2[i] = min(dp2[i], h[i + 1] + 1); } } int ma = 1; for (int i = 0; i < n; i++) { ma = max(ma, min(dp1[i], dp2[i])); } cout << ma << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 111, dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; bool a[N][N][4]; int w, h, n, c[N][N], now; vector<int> ans; int dfs(int x, int y) { c[x][y] = now; int res = 1; for (int d = 0; d < 4; ++d) if (a[x][y][d]) { int nx = x + dx[d], ny = y + dy[d]; if (!c[nx][ny]) res += dfs(nx, ny); } return res; } int main() { scanf( %d%d%d , &w, &h, &n); for (int i = 0; i < w; ++i) { for (int j = 0; j < h; ++j) { for (int d = 0; d < 4; ++d) { int ni = i + dx[d], nj = j + dy[d]; a[i][j][d] = ni >= 0 && ni < w && nj >= 0 && nj < h; } } } for (int i = 0; i < n; ++i) { int x1, x2, y1, y2; scanf( %d%d%d%d , &x1, &y1, &x2, &y2); if (x1 == x2) { for (int y = min(y1, y2); y < max(y1, y2); ++y) { a[x1 - 1][y][1] = false; a[x1][y][3] = false; } } else { for (int x = min(x1, x2); x < max(x1, x2); ++x) { a[x][y1 - 1][0] = false; a[x][y1][2] = false; } } } for (int i = 0; i < w; ++i) { for (int j = 0; j < h; ++j) { if (!c[i][j]) { ++now; ans.push_back(dfs(i, j)); } } } sort(ans.begin(), ans.end()); int m = ans.size(); for (int i = 0; i < m; ++i) { printf( %d%s , ans[i], i + 1 == m ? n : ); } }
#include <bits/stdc++.h> using namespace std; double ans = 1; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); if (k >= m) printf( 1 n ); else if (n + k < m) printf( 0 n ); else { for (int i = 1; i <= k + 1; i++) ans = ans * (m - i + 1) / (n + i); ans = 1.0 - ans; printf( %.6lf , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; map<long long, long long> M[400004]; vector<long long> Z[400004]; map<long long, long long> MA; map<long long, long long> AM; long long MAer; bool cmp(long long& a, long long& b) { return a > b; } long long xa[200002], xb[200002]; signed main() { long long n, a, b; cin >> n; long long maxx = 0, maxi = 0; for (long long i = 1; i <= n; i++) { cin >> a >> b; MA[a] = 0, MA[b] = 0; maxx = max(maxx, a); if (a == maxx) { maxi = max(maxi, b); } xa[i] = a, xb[i] = b; } for (auto& it : MA) { it.second = ++MAer; AM[it.second] = it.first; } for (long long i = MA[maxi] + 1; i <= MA[maxx]; i++) { M[i][0] = 1; } for (long long i = 1; i <= n; i++) { Z[MA[xa[i]]].push_back(MA[xb[i]]); } for (long long i = MA[maxx]; i > 0; i--) { while (M[i].size() > 1) { M[i].erase(++M[i].begin(), M[i].end()); } for (auto& a : Z[i]) { for (auto& b : M[i]) { M[a][b.first] += b.second; M[a][b.first] %= 1000000007; } } for (auto& a : M[i]) { M[i - 1][AM[i] - AM[i - 1] + a.first] += a.second; M[i - 1][AM[i] - AM[i - 1] + a.first] %= 1000000007; } } cout << M[1].begin()->second << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } int A[100], B[40200], n, N, M[40200]; long long r1; int lis() { int L = 0, lo, hi, mid, i; for (i = 0; i < N; i++) { lo = 1; hi = L; while (lo <= hi) { mid = (lo + hi) / 2 + ((lo + hi) % 2); if (B[M[mid]] <= B[i]) lo = mid + 1; else hi = mid - 1; } M[lo] = i; if (lo > L) L = lo; if (i == N - n - 1) r1 = L; } return L; } int main() { int T, i, j, k; long long r2; scanf( %d%d , &n, &T); for (i = 0; i < n; i++) { scanf( %d , &A[i]); } if (T <= 401) { for (i = 0, j = 0; i < T; i++) for (k = 0; k < n; k++) B[j++] = A[k]; N = n * T; printf( %d n , lis()); } else { for (i = 0, j = 0; i < 401; i++) for (k = 0; k < n; k++) B[j++] = A[k]; N = 401 * n; r2 = lis(); cout << r1 + (r2 - r1) * (T - 400) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; inline void normal(long long &a) { a = (a + 998244353) % 998244353; } inline long long modMul(long long a, long long b) { a %= 998244353, b %= 998244353; normal(a), normal(b); return (a * b) % 998244353; } inline long long modAdd(long long a, long long b) { a %= 998244353, b %= 998244353; normal(a), normal(b); return (a + b) % 998244353; } inline long long modSub(long long a, long long b) { a %= 998244353, b %= 998244353; normal(a), normal(b); a -= b; normal(a); return a; } inline long long modPow(long long b, long long p) { long long r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; } inline long long modInv(long long a) { return modPow(a, 998244353 - 2); } inline long long modDiv(long long a, long long b) { return modMul(a, modInv(b)); } const long long N = 4e5 + 1; vector<long long> V; long long n, x, R, C, cntt[N]; map<long long, long long> M; void solve() { cin >> n; for (long long i = 0; i < n; i++) { cin >> x; M[x]++; } for (auto u = (M).begin(); u != (M).end(); u++) { cntt[u->second]++; } x = n; for (long long i = n; i > 0; i--) { if (R * C < (x / i * i) && i <= x / i) { R = i, C = x / i; } x -= cntt[i]; cntt[i - 1] += cntt[i]; } cout << R * C << endl; cout << R << << C << endl; if (!(R * C)) return; long long ans[R][C]; x = min(R, C); vector<pair<long long, long long> > p; for (auto u = (M).begin(); u != (M).end(); u++) { p.push_back({min(u->second, x), u->first}); } sort((p).rbegin(), (p).rend()); while ((long long)((p).size())) { while (p.back().first) { V.push_back(p.back().second), p.back().first--; } p.pop_back(); } long long i = 0, j = 0, cnt = 0; for (long long i = 0; i < C; i++) { for (long long j = 0; j < R; j++) { ans[j][(i + j) % C] = V.back(), V.pop_back(); } } for (long long i = 0; i < R; i++) { for (long long j = 0; j < C; j++) { cout << ans[i][j] << ; } cout << endl; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; clock_t start, end; start = clock(); cout << fixed << setprecision(18); ; while (t--) { solve(); } end = clock(); double time_taken = double(end - start) / double(CLOCKS_PER_SEC); }
#include <bits/stdc++.h> using namespace std; int main() { iostream::sync_with_stdio(0); long long n; cin >> n; vector<long long> q{1, 1}; while (q.back() < 1e18) q.push_back(q.back() + q[q.size() - 2]); cout << upper_bound(q.begin(), q.end(), n) - q.begin() - 2; return 0; }
#include <bits/stdc++.h> const int maxn = 1e5 + 10; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qpow(long long p, long long q) { long long f = 1; while (q) { if (q & 1) f = f * p; p = p * p; q >>= 1; } return f; } inline long long read() { long long x = 0; int f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, m, k, t, c[21][21], vis[21][21], num[4]; struct node { int cnt, id; bool operator<(const node& p) const { return cnt > p.cnt; } } ca[25]; bool flag; bool solve(int a, int b) { int d[21][21]; int i, j; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) d[i][j] = c[i][j]; for (i = 1; i <= n; i++) swap(d[i][a], d[i][b]); for (i = 1; i <= n; i++) { int now = 0; for (j = 1; j <= m; j++) if (d[i][j] != j) now++; if (now > 2) return false; } return true; } int main() { int i, j; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) ca[i].id = i; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { scanf( %d , &c[i][j]); if (c[i][j] != j) ca[i].cnt++; } sort(ca + 1, ca + n + 1); if (ca[1].cnt <= 2) puts( YES ); else if (ca[1].cnt > 4) puts( NO ); else { j = 0; int pos = ca[1].id; for (i = 1; i <= m; i++) if (c[pos][i] != i) num[j++] = i; for (i = 0; i <= 3; i++) for (j = i + 1; j <= 3; j++) { if (solve(num[i], num[j])) return 0 * puts( YES ); } puts( NO ); } return 0; }
#include <bits/stdc++.h> using namespace std; long long dp[2000005]{}; long long dp2[2000005]{}; int main() { long long n, t; cin >> t; while (t--) { string ss; cin >> n; cin >> ss; memset(dp, 0, n * 8 + 40); memset(dp2, 0, n * 8 + 40); long long prev = 0; for (int i = 1; i <= n; i++) { if (ss[i - 1] == . ) { dp[i] = dp[i - 1] + prev; } else { prev++; dp[i] = dp[i - 1]; } } prev = 0; for (int i = n; i > 0; i--) { if (ss[i - 1] == . ) { dp2[i] = dp2[i + 1] + prev; } else { prev++; dp2[i] = dp2[i + 1]; } } long long ans = dp[n]; for (int i = 1; i <= n - 1; i++) { ans = min(ans, dp[i] + dp2[i + 1]); } printf( %lld n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; void qSort(int *A, int low, int high, int *ii) { int i = low; int j = high; int x = A[(low + high) / 2]; do { while (A[i] < x) ++i; while (A[j] > x) --j; if (i <= j) { int temp = A[i]; int buf = ii[i]; ii[i] = ii[j]; ii[j] = buf; A[i] = A[j]; A[j] = temp; i++; j--; } } while (i <= j); if (low < j) qSort(A, low, j, ii); if (i < high) qSort(A, i, high, ii); } int gcd(int a, int b) { if (b == 0) { return a; } else { return gcd(b, a % b); } } int lcm(int a, int b) { return a / gcd(a, b) * b; } int main() { int n; cin >> n; int *mas = new int[n]; int *ii = new int[n]; for (int i = 0; i < n; i++) { cin >> mas[i]; ii[i] = i; } qSort(mas, 0, n - 1, ii); if (n % 2 == 0) { cout << n / 2 << endl; } else { cout << n / 2 + 1 << endl; } for (int i = 0; i < n; i += 2) { cout << ii[i] + 1 << ; } cout << endl; if (n % 2 == 0) { cout << n / 2 << endl; } else { cout << n / 2 << endl; } for (int i = 1; i < n; i += 2) { cout << ii[i] + 1 << ; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n; int n1, n2, n3, n4, n5, n6, n7; int a, b, c; void doA(int i) { if (n1 >= i) n1 -= i; else n1 = 0; } void doB(int i) { if (n2 >= i) n2 -= i; else { doA(i - n2); n2 = 0; } } void doC(int i) { if (n3 >= i) n3 -= i; else { doB(i - n3); n3 = 0; } } void work() { int ans = 0; ans = n7; ans += n6; doA(n6); ans += n5; doB(n5); if (c < a + b) { ans += n4; doC(n4); int ANS = 0x3fffffff; for (int i = 0; i <= n3; i++) { int N1 = n1, N2 = n2, N3 = n3; int j = n3 - i; int now = max(i, j); if (i > j) { doB(i - j); doA(i - j); } else doB(j - i); now += max((n2 + 1) / 2, (n1 + n2 + 2) / 3); ANS = min(ANS, now); n1 = N1; n2 = N2; n3 = N3; } cout << ans + ANS << endl; } else { int ANS = 0x3fffffff; for (int i = n4; i <= n3 + n4; i++) { int N1 = n1, N2 = n2, N3 = n3; int j = n3 + n4 - i; int now = max(i, j); if (i > j) { doB(i - j); doA(i - j); } else doB(j - i); now += max((n2 + 1) / 2, (n1 + n2 + 2) / 3); ANS = min(ANS, now); n1 = N1; n2 = N2; n3 = N3; } cout << ans + ANS << endl; } } int main() { cin >> n; cin >> a >> b >> c; if (c < b) swap(b, c); if (b < a) swap(a, b); if (c < b) swap(b, c); int x1 = min(a + b, c), x2 = max(a + b, c); for (int i = 1; i <= n; i++) { int t; scanf( %d , &t); if (t > a + b + c) { cout << -1 << endl; return 0; } if (t <= a) n1++; else if (t <= b) n2++; else if (t <= x1) n3++; else if (t <= x2) n4++; else if (t <= a + c) n5++; else if (t <= b + c) n6++; else n7++; } work(); return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, a[5000 + 5], num[5000 + 5], res[5000 + 5][5000 * 2 + 5], ans[5000 * 2 + 5]; inline int pow(int x, int k) { int sum = 1; for (; k; k >>= 1, x = 1LL * x * x % 1000000007) if (k & 1) sum = 1LL * sum * x % 1000000007; return sum; } int main() { n = read(); num[1] = 1; for (int i = 1; i < n; ++i) a[i] = read(), num[i + 1] = 1LL * num[i] * a[i] % 1000000007; for (int i = 1; i <= n; ++i) { int x = 1, inv = pow(a[i], 1000000007 - 2); for (int j = 1; j <= 2 * n - 2; ++j) { x = i + j > n ? 0 : 1LL * x * a[i + j - 1] % 1000000007; int sum = (res[i][j] + x) % 1000000007; ans[j] = (ans[j] + 1LL * num[i] * sum) % 1000000007; if (i < n) res[i + 1][j + 1] = (1LL * res[i + 1][j + 1] + res[i][j] + 1LL * x * inv % 1000000007 * (a[i] - 1)) % 1000000007; } if (i < n) res[i + 1][1] = (res[i + 1][1] + 1) % 1000000007; } for (int i = 1; i <= n * 2 - 2; ++i) printf( %d , 1LL * ans[i] * (1000000007 + 1) / 2 % 1000000007); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 300010; const int INF = 2000000010; int n, m, k; int mi[maxn], ma[maxn], a[maxn], sum[maxn], v[maxn], la[maxn]; vector<pair<int, int>> G; void add(int x, int cnt) { for (int i = x; i <= max(n, m); i += (i & -i)) { sum[i] += cnt; } } int get_sum(int x) { int ans = 0; for (int i = x; i >= 1; i -= (i & -i)) { ans += sum[i]; } return ans; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) mi[i] = ma[i] = i; for (int i = 1; i <= m; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) { if (!v[a[i]]) ma[a[i]] = max(ma[a[i]], a[i] + get_sum(n) - get_sum(a[i])), add(a[i], 1); else G.push_back(make_pair(v[a[i]], i)); la[i] = v[a[i]] + 1; v[a[i]] = i; mi[a[i]] = 1; } for (int i = 1; i <= n; i++) { if (!v[i]) { int x = get_sum(n) - get_sum(i); ma[i] = max(ma[i], i + x); } } for (int i = 1; i <= max(n, m); i++) sum[i] = 0; k = 0; for (int i = 0; i < (int)G.size(); i++) { while (k < G[i].second) { ++k; add(la[k], 1); add(k + 1, -1); } int x = get_sum(G[i].first); ma[a[G[i].first]] = max(ma[a[G[i].first]], x); } while (k < m) { ++k; add(la[k], 1); add(k + 1, -1); } for (int i = 1; i <= n; i++) { if (v[i] > 0) { int x = get_sum(v[i]); ma[i] = max(ma[i], x); } } for (int i = 1; i <= n; i++) { printf( %d %d n , mi[i], ma[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; long long int get(long long int s, long long int w, long long int cs, long long int cw, long long int p) { if (s > w) return get(w, s, cw, cs, p); if (s * cs >= p) return p / s; return cs + min(cw, (p - s * cs) / w); }; void solve() { long long int p, f; cin >> p >> f; long long int cs, cw; cin >> cs >> cw; long long int s, w; cin >> s >> w; long long int mx = 0; for (long long int x = 0; x <= cs; ++x) { if (x * s <= p) { long long int y = min(cw, (p - x * s) / w); mx = max(mx, x + y + get(s, w, cs - x, cw - y, f)); } } cout << mx << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long int T = 1; cin >> T; for (long long int i = 1; i <= T; ++i) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long a[8], pro[1 << 8]; int bit_cnt[1 << 8]; vector<long long> pp; bitset<1000000> p; map<long long, int> H; int N, an; int qq(long long x) { if (H.count(x)) return H[x]; long long X = x; int res = 0; for (int i = 0; i < ((int)(pp).size()) && pp[i] * pp[i] <= x; i++) { while (x % pp[i] == 0) { x /= pp[i]; res++; } } if (x != 1) res++; return H[X] = res; } int qq2(long long x) { if (H.count(x)) { int tmp = H[x]; if (tmp == 1) return 0; return tmp; } long long X = x; int res = 0; for (int i = 0; i < ((int)(pp).size()) && pp[i] * pp[i] <= x; i++) { while (x % pp[i] == 0) { x /= pp[i]; res++; } } if (x != 1) res++; H[X] = res; if (res == 1) return 0; return res; } void dfs(int x, int mask, int v, int head) { if (x == -1) { if (head == 1) an = min(an, v); else an = min(an, v + 1); return; } if (!((mask >> x) & 1)) { v++; head++; } for (int i = 0; i < (1 << x); ++i) { if (!i) { dfs(x - 1, mask, v + qq2(a[x]), head); } else if (!(mask & i) && a[x] % pro[i] == 0) { dfs(x - 1, mask | i, v + bit_cnt[i] + qq(a[x] / pro[i]), head); } } } int main() { for (int i = 3; i < 1000; i += 2) { for (int j = i * i; j < 1000000; j += i + i) p[j] = 1; } pp.push_back(2); for (int i = 3; i < 1000000; i += 2) { if (!p[i]) pp.push_back(i); } int(n); scanf( %d , &n); N = n; for (int i = 0; i < (n); ++i) cin >> a[i]; sort(a, a + n); pro[0] = 1; for (int i = (1); i < (1 << n); ++i) { int k = 0; while (!((i >> k) & 1)) k++; bit_cnt[i] = bit_cnt[i - (1 << k)] + 1; long long tmp1 = pro[i - (1 << k)]; long long tmp2 = a[k]; if (tmp1 > 10000000000000ll / tmp2) pro[i] = 10000000000000ll; else pro[i] = tmp1 * tmp2; } an = 1000000; dfs(n - 1, 0, 0, 0); printf( %d n , an); return 0; }
#include <bits/stdc++.h> using namespace std; int x, y, a, b, num_of_results; pair<int, int> game, results[10101]; int main() { scanf( %d %d %d %d , &x, &y, &a, &b); num_of_results = 0; if (b >= x) printf( 0 n ); else { for (int i = a; i <= x; i++) { for (int j = b; j <= y; j++) { if (i > j) { results[num_of_results++] = make_pair(i, j); } } } cout << num_of_results << endl; for (int i = 0; i < num_of_results; i++) { cout << results[i].first << << results[i].second << endl; } } }
#include <bits/stdc++.h> using namespace std; const int N = 16 + 5; string a[N], x, y; int n, m, M = -1; map<string, map<string, int> > mm; bool vis[N]; void dfs(int deep, int mod) { if (deep > n + 1) return; if (deep == n + 1) { int tot = 0, f = 1; for (int i = 1; i <= n; ++i) tot += vis[i]; for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) if (vis[i] && vis[j]) if (mm[a[i]][a[j]]) { f = 0; break; } if (f) { if (mod) { int tot = 0; for (int i = 1; i <= n; ++i) tot += vis[i]; if (tot != M) return; printf( %d n , M); string res[N]; for (int i = 1; i <= 17; ++i) res[i] = 0 ; int pos = 1; for (int i = 1; i <= n; ++i) if (vis[i]) res[pos++] = a[i]; sort(res + 1, res + pos); pos = 1; while (res[pos] != 0 ) { cout << res[pos] << endl; pos++; } exit(0); } else if (mod == 0) M = max(M, tot); } } vis[deep] = true; dfs(deep + 1, mod); vis[deep] = false; dfs(deep + 1, mod); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= m; ++i) { cin >> x >> y; mm[x][y] = mm[y][x] = 1; } dfs(1, 0); dfs(1, 1); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; struct VIS { int c, p; int id; bool operator<(const VIS& t) const { if (p == t.p) return c < t.c; return p > t.p; } } A[MAXN]; struct TAB { int c; int id; bool operator<(const int t) const { return c < t; } bool operator<(const TAB& t) const { return c < t.c; } } Tb[MAXN]; bool vis[MAXN]; struct PAIR { int v; int t; bool operator<(const PAIR& t) const { return v < t.v; } } pai[MAXN]; int len; int sum; int main() { int N, K; while (scanf( %d , &(N)) != EOF) { for (int i = (1); i < (N + 1); ++i) { scanf( %d%d , &A[i].c, &A[i].p); A[i].id = i; } sort(A + 1, A + N + 1); scanf( %d , &(K)); for (int i = (1); i < (K + 1); ++i) { scanf( %d , &(Tb[i].c)); Tb[i].id = i; } sort(Tb + 1, Tb + K + 1); len = 0; sum = 0; memset(vis, 0, sizeof(vis)); for (int i = (1); i < (N + 1); ++i) { int p = lower_bound(Tb + 1, Tb + K + 1, A[i].c) - Tb; while (p <= K && vis[p]) ++p; if (p > K) continue; vis[p] = 1; sum += A[i].p; pai[len].v = A[i].id; pai[len].t = Tb[p].id; ++len; } sort(pai, pai + len); printf( %d %d n , len, sum); for (int k = (0); k < (len); ++k) { printf( %d %d n , pai[k].v, pai[k].t); } } return 0; }