func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int maxn = 100000, maxlog = 12; long long pw[maxlog]; int n, qn; long long a[maxn + 5]; struct lab_type { bool ty; long long val; lab_type() : ty(0), val(0) {} lab_type(int _ty, const long long &_val) : ty(_ty), val(_val) {} bool empty() { return !ty && !val; } friend lab_type &operator+=(lab_type &first, const lab_type &second) { if (second.ty) return first = second; if (!first.ty || first.val) first.val += second.val; return first; } friend long long &operator+=(long long &first, const lab_type &second) { if (second.ty) return first = second.val; if (!first) return first; return first += second.val; } }; struct node { node *c[2]; long long Max; lab_type label; node() : Max(0) { memset(c, 0, sizeof c); } void update() { Max = 0; for (int i = (0), _end_ = (2); i < _end_; ++i) if (c[i]) chkmax(Max, c[i]->Max); } void flag_label(const lab_type &_label) { label += _label; Max += _label; } void push_down() { if (!label.empty()) { for (int i = (0), _end_ = (2); i < _end_; ++i) if (c[i]) c[i]->flag_label(label); label = lab_type(); } } }; const int max0 = 100000; node *nd_pool; int nd_res = 0; node *newnode() { if (!nd_res) nd_pool = new node[max0], nd_res = max0; return nd_pool + (--nd_res); } node *rt[maxlog]; int seg_x, seg_y; lab_type seg_z; long long seg_ret; int seg_id; void add(node *&rt, int l, int r) { if (seg_x <= l && r <= seg_y) { rt->flag_label(seg_z); return; } int mid = (l + r) >> 1; rt->push_down(); if (seg_x < mid) add(rt->c[0], l, mid); if (seg_y > mid) add(rt->c[1], mid, r); rt->update(); } void doit(node *rt, int l, int r) { if (!rt) return; if (rt->Max <= pw[seg_id]) return; if (r - l <= 1) { rt->Max = 0; return; } if (rt->label.ty) { rt->flag_label(lab_type(1, 0)); return; } rt->push_down(); int mid = (l + r) >> 1; doit(rt->c[0], l, mid); doit(rt->c[1], mid, r); rt->update(); } void query(node *rt, int l, int r) { if (!rt) return; if (seg_x <= l && r <= seg_y) { chkmax(seg_ret, rt->Max); return; } rt->push_down(); int mid = (l + r) >> 1; if (seg_x < mid) query(rt->c[0], l, mid); if (seg_y > mid) query(rt->c[1], mid, r); rt->update(); } void build(node *&rt, int l, int r) { if (!rt) rt = newnode(); if (r - l <= 1) { if (a[l] <= pw[seg_id]) rt->Max = a[l]; else rt->Max = 0; return; } rt->push_down(); int mid = (l + r) >> 1; build(rt->c[0], l, mid); build(rt->c[1], mid, r); rt->update(); } int main() { pw[0] = 1; for (int i = (1), _end_ = (maxlog); i < _end_; ++i) pw[i] = pw[i - 1] * 42; scanf( %d%d , &n, &qn); for (int i = (0), _end_ = (n); i < _end_; ++i) scanf( %I64d , a + i); for (int i = (0), _end_ = (maxlog); i < _end_; ++i) { seg_id = i; build(rt[i], 0, n); } for (int i = (0), _end_ = (qn); i < _end_; ++i) { int ty, l, r, first; scanf( %d , &ty); if (ty == 1) { scanf( %d , &first), --first; seg_x = first, seg_y = first + 1, seg_ret = 0; query(rt[maxlog - 1], 0, n); printf( %I64d n , seg_ret); } else { scanf( %d%d%d , &l, &r, &first), --l; seg_x = l, seg_y = r; if (ty == 2) { seg_z = lab_type(1, first); for (int i = maxlog - 1; i >= 0; --i) { if (first > pw[i]) seg_z.val = 0; add(rt[i], 0, n); } } else { static long long Max[maxlog]; static long long cnt[maxlog]; for (int i = (0), _end_ = (maxlog); i < _end_; ++i) { seg_ret = 0; query(rt[i], 0, n); Max[i] = seg_ret; cnt[i] = 0; } while (1) { bool ok = 1; for (int i = (0), _end_ = (maxlog); i < _end_; ++i) { cnt[i] += first; if (Max[i] && Max[i] + cnt[i] > pw[i]) { seg_z = lab_type(0, cnt[i]); add(rt[i], 0, n); cnt[i] = 0; seg_id = i; doit(rt[i], 0, n); seg_ret = 0; query(rt[i], 0, n); Max[i] = seg_ret; } if (Max[i] && Max[i] + cnt[i] == pw[i]) ok = 0; } if (ok) break; } for (int i = (0), _end_ = (maxlog); i < _end_; ++i) if (cnt[i]) { seg_z = lab_type(0, cnt[i]), add(rt[i], 0, n), cnt[i] = 0; assert(rt[i]->Max != pw[i]); } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long s, n; cin >> n >> s; if (n >= s) cout << 1 n ; else { int div = s / n; (s % n == 0) ? cout << div << endl : cout << (div + 1) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-11; const int mod = 1e7 + 9; const int oo = (1 << 31) - 1; template <class T> inline void readInt(T &n) { n = 0; T ch = getchar(); int sign = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) sign = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) n = (n << 3) + (n << 1) + ch - 0 , ch = getchar(); n = n * sign; } const int maxn = 100005; int n, m, q, x, y, a[505][505], b[505]; int main() { cin >> n >> m >> q; for (int i = ((int)(0)); i < ((int)(n)); i++) b[i] = 0; for (int i = ((int)(0)); i < ((int)(n)); i++) for (int j = ((int)(0)); j < ((int)(m)); j++) cin >> a[i][j]; for (int i = ((int)(0)); i < ((int)(n)); i++) { int c = a[i][0]; for (int j = ((int)(1)); j < ((int)(m)); j++) { if (a[i][j] == 0) { if (a[i][j - 1] == 1) b[i] = max(b[i], c); c = 0; continue; } if (a[i][j - 1] == 0) c = 1; else c++; } b[i] = max(b[i], c); } for (int i = ((int)(0)); i < ((int)(q)); i++) { cin >> x >> y; --x; --y; a[x][y] = 1 - a[x][y]; int res = 0, c = a[x][0]; for (int j = ((int)(1)); j < ((int)(m)); j++) { if (a[x][j] == 0) { if (a[x][j - 1] == 1) res = max(res, c); c = 0; continue; } if (a[x][j - 1] == 0) c = 1; else c++; } res = max(res, c); b[x] = res; res = 0; for (int j = ((int)(0)); j < ((int)(n)); j++) if (b[j] > res) res = b[j]; cout << res << endl; } return 0; } |
#include <bits/stdc++.h> namespace fdd { int n, m1, m2; std::priority_queue<int> q[1010]; std::vector<int> v1, v2; void solve() { std::cin >> n; for (int i = 3; i < n; i++) { scanf( %d%d , &m1, &m2); if (m1 > m2) std::swap(m1, m2); q[m1].push(m2); } for (int i = 2; i <= n; i++) { while (!q[i].empty()) { m1 = q[i].top(); q[i].pop(); v1.push_back(i); v1.push_back(m1); } } for (int i = 3; i < n; i++) { scanf( %d%d , &m1, &m2); if (m1 > m2) std::swap(m1, m2); q[m1].push(m2); } for (int i = 2; i <= n; i++) { while (!q[i].empty()) { m1 = q[i].top(); q[i].pop(); if (q[i].empty()) m2 = i + 1; else m2 = q[i].top(); v2.push_back(1); v2.push_back(m2); } } printf( %d n , (v1.size() + v2.size()) >> 1); int l = v1.size(); for (int i = 0; i < l; i += 2) printf( %d %d n , v1[i], v1[i + 1]); l = v2.size(); for (int i = l - 1; i >= 0; i -= 2) printf( %d %d n , v2[i - 1], v2[i]); } } // namespace fdd int main() { fdd::solve(); return 0; } |
#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native ) #pragma GCC optimize( Ofast,O3,unroll-loops ) using namespace std; struct cplx { long double a, b; cplx(long double a = 0, long double b = 0) : a(a), b(b) {} const cplx operator+(const cplx &c) const { return cplx(a + c.a, b + c.b); } const cplx operator-(const cplx &c) const { return cplx(a - c.a, b - c.b); } const cplx operator*(const cplx &c) const { return cplx(a * c.a - b * c.b, a * c.b + b * c.a); } const cplx operator/(const long double &x) const { return cplx(a / x, b / x); } const cplx conj() const { return cplx(a, -b); } }; const long double PI = acosl(-1); const int N = (1 << 20) + 5; int rev[N]; cplx w[N]; void prepare(int &n) { int sz = __builtin_ctz(n); for (int i = 1; i < n; ++i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (sz - 1)); w[0] = 0, w[1] = 1, sz = 1; while (1 << sz < n) { cplx w_n = cplx(cosl(2 * PI / (1 << (sz + 1))), sinl(2 * PI / (1 << (sz + 1)))); for (int i = 1 << (sz - 1); i < (1 << sz); ++i) { w[i << 1] = w[i], w[i << 1 | 1] = w[i] * w_n; } ++sz; } } void fft(cplx *a, int n) { for (int i = 1; i < n - 1; ++i) { if (i < rev[i]) swap(a[i], a[rev[i]]); } for (int h = 1; h < n; h <<= 1) { for (int s = 0; s < n; s += h << 1) { for (int i = 0; i < h; ++i) { cplx &u = a[s + i], &v = a[s + i + h], t = v * w[h + i]; v = u - t, u = u + t; } } } } static cplx f[N]; vector<long long> multiply(vector<long long> a, vector<long long> b) { int n = a.size(), m = b.size(), sz = 1; while (sz < n + m - 1) sz <<= 1; prepare(sz); for (int i = 0; i < sz; ++i) f[i] = cplx(i < n ? a[i] : 0, i < m ? b[i] : 0); fft(f, sz); for (int i = 0; i <= (sz >> 1); ++i) { int j = (sz - i) & (sz - 1); cplx x = (f[i] * f[i] - (f[j] * f[j]).conj()) * cplx(0, -0.25); f[j] = x, f[i] = x.conj(); } fft(f, sz); vector<long long> c(n + m - 1); for (int i = 0; i < n + m - 1; ++i) c[i] = f[i].a / sz + 0.3; return c; } int main() { long long a, b, c, d; cin >> a >> b >> c >> d; long long ans = (b - a + 1) * (c - b + 1) * (d - c + 1); std::vector<long long> A(b + 1); std::vector<long long> B(c + 1); for (int i = a; i <= b; i++) A[i] = 1; for (int i = b; i <= c; i++) B[i] = 1; std::vector<long long> C = multiply(A, B); long long prev = 0; for (int i = 0; i <= d; i++) { if (i < C.size()) prev += C[i]; if (i >= c) { ans -= prev; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans[60]; int main() { long long t, a, n, m, b, v, xmin, xmax, act, sum, i, vmi; cin >> t; while (t--) { cin >> a >> b >> m; if (a == b) { cout << 1 << a << n ; continue; } for (n = 2; n <= 50; n++) { v = ((1ll) << (n - 2)); xmin = v * a + v; xmax = v * a + v * m; if (xmin > b) { n = 51; break; } if (b <= xmax) { act = xmax; ans[1] = a; sum = ans[1]; for (i = 2; i <= n; i++) { v = ((1ll) << (max(n - i - 1, 0ll))); vmi = m - (act - b) / v; vmi = max(vmi, 1ll); ans[i] = sum + vmi; sum = sum + ans[i]; act -= (m - vmi) * v; } if (i <= n || ans[n] != b) continue; cout << n << ; for (i = 1; i <= n; i++) cout << ans[i] << ; cout << n ; break; } } if (n == 51) { cout << -1 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 110; int n, m, k, ans, a; vector<int> adj[N], lan[N]; bool mark[N]; void input() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> k; if (k == 0) a++; while (k--) { int v; cin >> v; lan[v].push_back(i); } } } void aa_adj() { for (int i = 1; i <= m; i++) { if (lan[i].size() == 0) continue; for (int j = 0; j < lan[i].size() - 1; j++) { adj[lan[i][j]].push_back(lan[i][j + 1]), adj[lan[i][j + 1]].push_back(lan[i][j]); } } } void dfs(int v) { mark[v] = true; for (int u : adj[v]) if (!mark[u]) dfs(u); } void find_ans() { for (int i = 1; i <= n; i++) { if (!mark[i]) { dfs(i), ans++; } } if (a == n) cout << ans << endl; else cout << ans - 1 << endl; } int main() { input(); aa_adj(); find_ans(); } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:167177216 ) using namespace std; const int MAXN = 9; int main() { long long n, A; scanf( %I64d %I64d , &n, &A); long long sum = 0; vector<int> d(n); for (int i = 0; i < n; i++) { scanf( %d , &d[i]); sum += d[i]; } for (int i = 0; i < n; i++) { long long without = sum - d[i]; long long need = A - without; if (need <= 0) { long long need = A - (n - 1); if (d[i] <= need) cout << 0 << ; else { cout << d[i] - need << ; } } else { long long ans = need - 1; long long razn = d[i] - need; if (without - (n - 1) < razn) ans += (razn - without + (n - 1)); cout << ans << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double EPS = 1e-6; const int MOD = 1e9 + 7; const int MAXN = 110; const double PI = acos(-1.0); int ipt[MAXN][MAXN]; int main() { int n, m, k; while (~scanf( %d%d%d , &n, &m, &k)) { int ans = INF, all = 1 << m; for (int i = 0; i < (n); ++i) for (int j = 0; j < (m); ++j) scanf( %d , &ipt[i][j]); if (n < m) { for (int i = 0; i < (n); ++i) for (int j = (i + 1); j < (m); ++j) swap(ipt[i][j], ipt[j][i]); swap(n, m); } if (n > k) { for (int i = 0; i < (n); ++i) { int tans = 0; for (int j = 0; j < (n); ++j) { int cnt = 0; for (int k = 0; k < (m); ++k) cnt += ipt[i][k] ^ ipt[j][k]; tans += min(cnt, m - cnt); } ans = min(ans, tans); } } else { for (int mask = 0; mask < all; mask++) { int tans = 0; for (int i = 0; i < (n); ++i) { int cnt = 0; for (int j = 0; j < (m); ++j) cnt += ipt[i][j] ^ (mask >> j & 1); tans += min(cnt, m - cnt); } ans = min(ans, tans); } } printf( %d n , ans <= k ? ans : -1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int t, n; int cnt, num, maxx; int a[maxn]; int vis[maxn]; int m1[maxn]; int m2[maxn]; void init() { num = 0; maxx = 0; memset(vis, 0, sizeof(vis)); } int main() { scanf( %d , &t); while (t--) { cnt = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) m1[i] = 0, m2[i] = 0; init(); for (int i = 1; i <= n; i++) { maxx = max(maxx, a[i]); if (!vis[a[i]]) { num++; vis[a[i]] = 1; } else break; if (num == maxx) m1[i] = 1; else m1[i] = 0; } init(); for (int i = n; i >= 1; i--) { maxx = max(maxx, a[i]); if (!vis[a[i]]) { num++; vis[a[i]] = 1; } else break; if (num == maxx) { m2[i] = 1; if (i > 1 && m1[i - 1]) cnt++; } else m2[i] = 0; } printf( %d n , cnt); for (int i = 1; i < n; i++) if (m1[i] && m2[i + 1]) printf( %d %d n , i, n - i); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100, M = 10000; int n, m, a[N + 9], ca; double x, ans; void into() { scanf( %d%lf , &n, &x); int p = 0; for (int i = 1; i <= n; ++i) { int t; scanf( %d , &t); t << 1 <= x ? ans += t : m += a[++ca] = t; } x /= 2; } double dp[N + 9][M + 9]; void Get_dp() { dp[0][0] = 1; for (int i = 1; i <= ca; ++i) for (int j = i; j >= 1; --j) for (int k = m; k >= a[i]; --k) dp[j][k] += dp[j - 1][k - a[i]] * j / (ca - j + 1); } void Get_ans() { for (int i = 1; i <= ca; ++i) for (int j = 0; j <= m; ++j) ans += dp[i][j] * min((1.0 * n / i + 1) * x, 1.0 * j / i); } void work() { Get_dp(); Get_ans(); } void outo() { printf( %.12lf n , ans); } int main() { into(); work(); outo(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (1 << 30); const int MAXN = 100000; struct node { int le, ri; set<int> Set; int mx, mn; } tree[24 * MAXN + 5]; bool tag[MAXN + 5]; void pushup(int x) { if (tree[x].le == tree[x].ri) tree[x].mx = tree[x].mn = *tree[x].Set.rbegin(); else { tree[x].mn = max(*tree[x].Set.rbegin(), min(tree[x << 1].mn, tree[x << 1 | 1].mn)); tree[x].mx = max(*tree[x].Set.rbegin(), max(tree[x << 1].mx, tree[x << 1 | 1].mx)); } if (tree[x].mx < tree[x].mn) tree[x].mx = -1; if (tree[x].mx != -1 && tag[tree[x].mx]) tree[x].mx = -1; } void build(int x, int l, int r) { tree[x].le = l, tree[x].ri = r; tree[x].mx = tree[x].mn = 0; tree[x].Set.clear(); tree[x].Set.insert(0); if (l == r) return; int mid = (l + r) >> 1; build(x << 1, l, mid); build(x << 1 | 1, mid + 1, r); } void modify(int x, int l, int r, int k, int type) { if (l > tree[x].ri || r < tree[x].le) return; if (l <= tree[x].le && tree[x].ri <= r) { if (type) tree[x].Set.insert(k); else tree[x].Set.erase(k); pushup(x); return; } modify(x << 1, l, r, k, type); modify(x << 1 | 1, l, r, k, type); pushup(x); } void update(int x, int l, int r) { if (l > tree[x].ri || r < tree[x].le) return; if (l <= tree[x].le && tree[x].ri <= r) { pushup(x); return; } update(x << 1, l, r); update(x << 1 | 1, l, r); pushup(x); } int N; int Xa[MAXN + 5], Xb[MAXN + 5], Ya[MAXN + 5], Yb[MAXN + 5]; int dct[2][6 * MAXN + 5], dcnt[2]; void discrete() { for (int i = 0; i < 2; i++) sort(dct[i] + 1, dct[i] + dcnt[i] + 1); for (int i = 0; i < 2; i++) dcnt[i] = unique(dct[i] + 1, dct[i] + dcnt[i] + 1) - dct[i] - 1; for (int i = 1; i <= N; i++) { Xa[i] = lower_bound(dct[0] + 1, dct[0] + dcnt[0] + 1, Xa[i]) - dct[0]; Xb[i] = lower_bound(dct[0] + 1, dct[0] + dcnt[0] + 1, Xb[i]) - dct[0]; Ya[i] = lower_bound(dct[1] + 1, dct[1] + dcnt[1] + 1, Ya[i]) - dct[1]; Yb[i] = lower_bound(dct[1] + 1, dct[1] + dcnt[1] + 1, Yb[i]) - dct[1]; } } void insert_dct(int val, int type) { dct[type][++dcnt[type]] = val; } struct query { int le, ri, num; bool type; query(int _l = 0, int _r = 0, int _n = 0, bool _t = 0) : le(_l), ri(_r), num(_n), type(_t) {} }; vector<query> vec[6 * MAXN + 5]; int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %d%d%d%d , &Xa[i], &Ya[i], &Xb[i], &Yb[i]); Xb[i]--, Yb[i]--; insert_dct(Xa[i], 0); insert_dct(Xa[i] + 1, 0); insert_dct(Xa[i] - 1, 0); insert_dct(Xb[i], 0); insert_dct(Xb[i] + 1, 0); insert_dct(Xb[i] - 1, 0); insert_dct(Ya[i], 1); insert_dct(Ya[i] + 1, 1); insert_dct(Ya[i] - 1, 1); insert_dct(Yb[i], 1); insert_dct(Yb[i] + 1, 1); insert_dct(Yb[i] - 1, 1); } discrete(); for (int i = 1; i <= N; i++) { vec[Xa[i]].push_back(query(Ya[i], Yb[i], i, 1)); vec[Xb[i] + 1].push_back(query(Ya[i], Yb[i], i, 0)); } build(1, 1, dcnt[1]); Ya[0] = 1; Yb[0] = dcnt[1]; for (int i = 1; i <= dcnt[0]; i++) { for (int j = 0; j < vec[i].size(); j++) modify(1, vec[i][j].le, vec[i][j].ri, vec[i][j].num, vec[i][j].type); while (tree[1].mx != -1) { tag[tree[1].mx] = true; update(1, Ya[tree[1].mx], Yb[tree[1].mx]); } } int ans = 0; for (int i = 0; i <= N; i++) if (tag[i]) ans++; printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; using PII = pair<int, int>; using PLL = pair<long long, long long>; using VLL = vector<long long>; using VI = vector<int>; inline void fastio() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fL; const int mod1 = 998244353; const int mod2 = 1e9 + 7; void solve() { int n, m, k; cin >> n >> m >> k; if (k <= 1) { cout << NO << endl; return; } if (m < n - 1) { cout << NO << endl; return; } long long cnt = 1ll * n * (n - 1) / 2; if (m > cnt) { cout << NO << endl; return; } if (k == 2 && n > 1) { cout << NO << endl; return; } if (k >= 2 && n == 1) { cout << YES << endl; return; } if (k > 3) { cout << YES << endl; return; } if (m == cnt) { cout << YES << endl; } else { cout << NO << endl; } } signed main() { fastio(); int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool prime[100000 + 5]; int ans[100000 + 5]; int main() { long long int n; cin >> n; for (int i = 0; i <= n; i++) prime[i] = true; long long int k = 1; for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { ans[p] = k; for (int i = p * p; i <= n; i += p) { if (i <= n) { prime[i] = false; ans[i] = k; } } prime[p] = false; k++; } } for (int p = 2; p <= n; p++) { if (prime[p] == true) { for (int i = p; i <= n; i += p) { if (i <= n) { prime[i] = false; ans[i] = k; } } k++; } } for (int p = 2; p <= n; p++) cout << ans[p] << ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; string s; cin >> n >> k; cin >> s; int isThere[26]; for (int i = 0; i < 26; i++) isThere[i] = 0; bool ok = true; for (int i = 0; i < n; i++) { isThere[s[i] - a ]++; if (isThere[s[i] - a ] > k) { ok = false; break; } } if (ok) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; const int MAXD = 60 + 5; const int MAXN = 2e3 * 60 + 5; const int mod = 1e9 + 7; inline long long pw(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } inline int get_lb(long long x) { int res = 0; while (x >> res) ++res; return res - 1; } int d; long long a[MAXN]; int b[MAXN]; long long pt[MAXN]; int pcnt = 0, must[MAXN], dp[MAXN][5]; int f[MAXD]; inline int get(long long u) { int pos = lower_bound(pt + 1, pt + pcnt + 1, u) - pt; if (pos > pcnt || pt[pos] != u) return -1; return pos; } inline vector<int> get_dp(long long u) { int id = get(u); if (id != -1) return vector<int>(dp[id], dp[id] + 3); else return vector<int>(3, f[d - get_lb(u)]); } int main(void) { int n; scanf( %d%d , &d, &n); for (int i = 1; i <= n; ++i) { static char t[100]; scanf( %lld%s , &a[i], t + 1); b[i] = t[1] == w || t[1] == y ? 1 : t[1] == g || t[1] == b ? 2 : 3; } f[1] = 1; for (int i = 2; i <= d; ++i) f[i] = 4ll * f[i - 1] * f[i - 1] % mod; pt[++pcnt] = 1; for (int i = 1; i <= n; ++i) { long long u = a[i]; while (u) { pt[++pcnt] = u; u >>= 1; } } sort(pt + 1, pt + pcnt + 1); pcnt = unique(pt + 1, pt + pcnt + 1) - pt - 1; for (int i = 1; i <= n; ++i) must[get(a[i])] = b[i]; for (int i = pcnt; i >= 1; --i) { if (pt[i] >= (1ll << (d - 1))) { if (!must[i]) dp[i][0] = dp[i][1] = dp[i][2] = 1; else dp[i][must[i] - 1] = 1; continue; } long long u = pt[i]; vector<int> ls = get_dp(u << 1); vector<int> rs = get_dp(u << 1 | 1); for (int x = 0; x < 3; ++x) { if (must[i] && x != must[i] - 1) continue; for (int y = 0; y < 3; ++y) if (y != x) for (int z = 0; z < 3; ++z) if (z != x) dp[i][x] = (dp[i][x] + (long long)ls[y] * rs[z]) % mod; } } int ans = 0; for (int i = 0; i < 3; ++i) ans = (ans + dp[1][i]) % mod; ans = ans * pw(2, (1ll << d) - 1 - n) % mod; printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> ans; bool check(string s, int L, int R) { if (s[L] == 0 ) { if (R == L + 1) { return true; } return false; } int n = 0; for (int i = L; i < R; i++) { n *= 10; n += s[i] - 0 ; } return (n >= 0 && n < 256); } void func(string s) { int N = s.length(); for (int i = 1; i <= 3; i++) { for (int j = i + 1; j <= i + 3; j++) { for (int k = j + 1; k <= j + 3; k++) { if (N - k >= 1 && N - k <= 3) { if (check(s, 0, i) && check(s, i, j) && check(s, j, k) && check(s, k, N)) { string final; final = s.substr(0, i) + . + s.substr(i, j - i) + . + s.substr(j, k - j) + . + s.substr(k, N - k); ans.push_back(final); } } } } } } void dfs(int L, string s, int mask, int pos, int used) { if (pos == L) { if (used == mask) { func(s); return; } } int pos2 = L - 1 - pos; if (pos2 < pos) { if (mask != used) { return; } char c = s[pos2]; dfs(L, s + c, mask, pos + 1, used); } else { char c; for (int i = 0; i < 10; i++) { if (mask & (1 << i)) { c = i + 0 ; dfs(L, s + c, mask, pos + 1, (used | (1 << i))); } } } } int main() { int n; int a[11]; cin >> n; int mask = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; mask |= (1 << a[i]); } if (n <= 6) { for (int i = 4; i <= 12; i++) { dfs(i, , mask, 0, 0); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { cout << ans[i].c_str() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { long long int a; long long int b; }; node p[100005]; bool comp(node x, node y) { if (x.b < y.b) return true; return false; } int main() { long long int n, r, avg; cin >> n >> r >> avg; long long int s = 0; for (int i = (0); i < (n); ++i) { cin >> p[i].a >> p[i].b; s += p[i].a; } long long int cc = avg * n; if (s >= cc) cout << 0 << endl; else { long long int to = avg * n; long long int add = to - s; long long int count = 0; sort(p, p + n, comp); for (int j = (0); j < (n); ++j) { if (add == 0) break; long long int maxim = r - p[j].a; if (r < p[j].a) continue; if (add > maxim) { add = add - maxim; count += p[j].b * maxim; } else { count += add * p[j].b; add = 0; } } cout << count << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int columns[n + 1]; memset(columns, 0, sizeof(columns)); for (int i = 0; i < m; i++) { int tmp; cin >> tmp; columns[tmp]++; } int ans = 1001; for (int i = 1; i <= n; i++) { ans = min(ans, columns[i]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int head[100005]; struct edge { int vet, next; } E[200005]; int i, j, k, n, m, s, t, tot, L; int top[100005]; int fa[100005]; int dep[100005]; int a[100005]; int dist[3005][3005]; double ans; int X, Y, all; int cyc[100005]; int getf(int x) { if (x != fa[x]) fa[x] = getf(fa[x]); return fa[x]; } void add(int u, int v) { E[++tot] = (edge){v, head[u]}; head[u] = tot; } void getroad(int u, int dad) { if (u == Y) { L = cyc[u] = 1; return; } for (int e = head[u]; e != -1; e = E[e].next) if (e != dad) { getroad(E[e].vet, e ^ 1); if (cyc[E[e].vet] > 0) { cyc[u] = cyc[E[e].vet] + 1; L = max(L, cyc[u]); } } } void dfs(int u, const int &anc, int dad, int deep) { dep[u] = deep; top[u] = anc; for (int e = head[u]; e != -1; e = E[e].next) if (e != dad && cyc[E[e].vet] == 0) dfs(E[e].vet, anc, e ^ 1, deep + 1); } void getdis(int u, const int &anc, int dad, int D) { dist[anc][u] = D; for (int e = head[u]; e != -1; e = E[e].next) if (e != dad) getdis(E[e].vet, anc, e ^ 1, D + 1); } void DO() { for (int i = 1; i <= n; i++) getdis(i, i, -1, 0); } int main() { tot = -1; memset(head, -1, sizeof(head)); scanf( %d , &n); for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= n; i++) { int x, y; scanf( %d%d , &x, &y); x++; y++; if (getf(x) == getf(y)) { X = x; Y = y; continue; } add(x, y); add(y, x); fa[getf(x)] = getf(y); } DO(); getroad(X, -1); for (int i = 1; i <= n; i++) if (cyc[i] > 0) dfs(i, i, -1, 0); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j) { if (top[i] == top[j]) ans += 1.0 / (dist[i][j] + 1); else { int x = dep[i] + dep[j]; int y = abs(cyc[top[i]] - cyc[top[j]]); int z = L - y; ans += 1.0 / (x + y + 1) + 1.0 / (x + z + 1) - 1.0 / (x + L); } } ans += n; printf( %.14f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int x[4], y[4], a[4], b[4]; vector<int> v[2]; void yes() { puts( YES ); exit(0); } void add(bool is, int at, int to) { if (is) v[is].push_back(y[at]), v[is].push_back(y[to]); else v[is].push_back(x[at]), v[is].push_back(x[to]); } void can(int a, int b) { if (v[0][0] <= a && v[0][1] >= a && v[1][0] <= b && v[1][1] >= b) yes(); } int main() { for (int i = 0; i < 4; i++) scanf( %d%d , x + i, y + i); add(x[0] == x[1], 0, 1); add(x[1] == x[2], 1, 2); sort(v[0].begin(), v[0].end()); sort(v[1].begin(), v[1].end()); for (int i = 0; i < 4; i++) { scanf( %d%d , a + i, b + i); can(a[i], b[i]); } can((a[0] + a[2]) / 2, (b[0] + b[2]) / 2); int dis = b[0] != b[2] ? abs(b[0] - b[2]) : abs(a[0] - a[2]), mx = (a[0] + a[2]) / 2, my = (b[0] + b[2]) / 2; for (int i = 0; i < 4; i++) { int dis1 = abs(x[i] - mx) + abs(y[i] - my); if (dis1 * 2 <= dis) yes(); } puts( NO ); } |
#include <bits/stdc++.h> using namespace std; double pi = 2 * acos(0.0); template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; for (const auto &x : v) os << << x; return os << } ; } void solve() { long long int l, r, m; cin >> l >> r >> m; long long int a, b, c; long long int mm = r - l; long long int p, q, ss; if (m < l) { a = l; b = l; c = l + (l - m); cout << a << << b << << c << endl; return; } for (long long int i = l; i <= r; i++) { p = m % i; q = m / i; q++; ss = q * i; ss -= m; if (p <= mm) { a = i; c = l; b = c + p; break; } else if (ss <= mm) { a = i; b = l; c = l + ss; break; } } cout << a << << b << << c << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int test_cases; cin >> test_cases; for (int tc = 1; tc <= test_cases; tc++) { solve(); } return 0; } |
#include <bits/stdc++.h> long long mod = 1e9 + 7, mod2 = 998244353; using namespace std; long long fac[10000000]; long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } long long fexp(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % m; b /= 2; a = a * a % m; } return ans; } long long inverse(long long a, long long p) { return fexp(a, p - 2, p); } long long ncr(long long n, long long r, long long p) { if (r == 0) return 1; return (fac[n] * inverse(fac[n - r], p) % p * inverse(fac[r], p) % p) % p; } vector<long long> za(string s) { long long n = s.size(); vector<long long> z(n); long long x = 0, y = 0, p = 0; for (long long i = 1; i < n; i++) { z[i] = max(p, min(z[i - x], y - i + 1)); while (i + z[i] < n && s[z[i]] == s[i + z[i]]) { x = i; y = i + z[i]; z[i]++; } } return z; } void subset(long long a[], long long k) { for (int i = 1; i < pow(2, k); i++) { for (int j = 0; j < k; j++) { if (i & 1 << j) { cout << a[j] << ; } } cout << n ; ; } } vector<long long> pr(string s) { long long n = s.length(); vector<long long> pi(n); for (int i = 1; i < n; i++) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) j++; pi[i] = j; } return pi; } long long d[100005]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, s, l, r, x = 0; cin >> n >> s; for (long long i = 1; i < n; i++) { cin >> l >> r; d[l]++; d[r]++; } for (long long i = 1; i <= n; i++) { if (d[i] == 1) x++; } cout << fixed << setprecision(50) << ((2 * s) / (1.0 * x)); } |
#include <bits/stdc++.h> using namespace std; int n, m; map<int, int> mp; int a[11], aa[11]; int b[11]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { cin >> b[i]; if (a[b[i]] == 0) { a[b[i]]++; mp[b[i]]++; } } for (int i = 0; i < m; i++) { int x; cin >> x; if (aa[x] == 0) { aa[x]++; mp[x]++; } } for (int i = 0; i < n; i++) { if (mp[b[i]] == 2) cout << b[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y, a = 0, b = 0; cin >> n; vector<pair<int, int>> v; while (n--) { cin >> x >> y; a += x; b += y; v.push_back(make_pair(x, y)); } bool ok = 0; if (a % 2 == 0 && b % 2 == 0) { cout << 0; return 0; } if (a % 2 && b % 2) { for (auto i : v) { if ((i.first % 2 == 0 && i.second % 2) || (i.first % 2 && i.second % 2 == 0)) { ok = 1; break; } } } cout << (ok ? 1 : -1); } |
#include <bits/stdc++.h> const int MAXN = 3000 + 1000; int n, sum; int in[MAXN], out[MAXN]; struct Union_Find_Set { int f[MAXN]; void Init(int N) { for (int i = 1, _ = N; i <= _; i++) f[i] = i; } int Find(int x) { return x == f[x] ? x : f[x] = Find(f[x]); } bool Union(int x, int y) { x = Find(x); y = Find(y); if (x == y) return 0; in[x] += in[y]; out[x] += out[y]; f[y] = x; if (in[x] + out[x] > sum) return 1; return 0; } } t; struct Edge { int u, v, w; Edge() {} Edge(int u, int v, int w) : u(u), v(v), w(w) {} bool operator<(const Edge &a) const { return w < a.w; } } G[MAXN]; void Init() { int u, v, w; scanf( %d , &n); t.Init(n); for (int i = 1, _ = n - 1; i <= _; i++) { scanf( %d%d%d , &u, &v, &w); G[i] = Edge(u, v, w); } for (int i = 1, _ = n; i <= _; i++) { scanf( %d , &out[i]); sum += out[i]; in[i] = 1; } } void Solve() { if (n == 1) { puts( 0 ); return; } int u, v; std::sort(G + 1, G + n); for (int i = 1, _ = n - 1; i <= _; i++) { if (t.Union(G[i].u, G[i].v)) { printf( %d n , G[i].w); return; } } } int main() { Init(); Solve(); } |
#include <bits/stdc++.h> using namespace std; using LL = long long; namespace _buff { const size_t BUFF = 1 << 19; char buff[BUFF], *begin = buff, *end = buff; char getc() { if (begin == end) { begin = buff; end = buff + fread(buff, 1, BUFF, stdin); } return begin == end ? -1 : *begin++; } } // namespace _buff LL read() { using namespace _buff; LL ret = 0; bool pos = true; char c = getc(); for (; (c < 0 || c > 9 ) && c != - ; c = getc()) { assert(~c); } if (c == - ) { pos = false; c = getc(); } for (; c >= 0 && c <= 9 ; c = getc()) { ret = (ret << 3) + (ret << 1) + (c ^ 48); } return pos ? ret : -ret; } const size_t N = 100 + 5; const int MOD = 1e9 + 7; void add(int &dp, LL val) { dp = (dp + val) % MOD; } int f[N][N], g[N][N][N], cnt3[N], d[N]; LL getG(int i, int j, int k) { if (i < 0 || j < 0 || k < 0) return 0; return g[i][j][k]; } int main() { int n = read(); for (int i = 1; i <= n; ++i) { cnt3[i] = cnt3[i - 1] + ((d[i] = read()) & 1); } g[0][0][0] = 1; for (int c0 = 0; c0 <= n; ++c0) { for (int c2 = 0; c2 <= n; ++c2) { for (int c1 = !c2; c1 <= n; ++c1) { int &cg = g[c0][c1][c2]; if (c2 > 0) { add(cg, getG(c0 - 2, c1, c2 - 1) * c0 * (c0 - 1) / 2); add(cg, getG(c0 - 1, c1 + 1, c2 - 2) * c0 * (c2 - 1)); add(cg, getG(c0, c1 + 2, c2 - 3) * (c2 - 1) * (c2 - 2) / 2); add(cg, getG(c0, c1, c2 - 2) * (c2 - 1) * c1); add(cg, getG(c0 - 1, c1 - 1, c2 - 1) * c0 * c1); add(cg, getG(c0, c1 - 2, c2 - 1) * c1 * (c1 - 1) / 2); } else { add(cg, getG(c0 - 1, c1 - 1, c2) * c0); add(cg, getG(c0, c1 - 2, c2) * (c1 - 1)); } } } } f[n + 1][n] = 1; for (int l = n; l >= 2; --l) { for (int r = l; r <= n; ++r) { int c2 = cnt3[r] - cnt3[l - 1]; int c1 = r - l + 1 - c2; for (int k = 0; k + r <= n; ++k) { add(f[l][r], static_cast<LL>(f[r + 1][r + k]) * g[k][c1][c2]); } } } printf( %d n , f[2][d[1] + 1]); return 0; } |
#include <bits/stdc++.h> using namespace std; void func(void) { freopen( input.c , r , stdin); freopen( output.c , w , stdout); } void print(vector<long long> &v) { cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { printf( %lld , v[i]); } printf( n ); } void print(vector<pair<long long, long long> > &v) { cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { printf( %lld %lld n , v[i].first, v[i].second); } } void print(double d) { cout << fixed << setprecision(10) << d << endl; } void print(string s, double d) { cout << s << ; cout << fixed << setprecision(10) << d << endl; } int main() { long long n, q, i, j = 0, temp, t, k, ans = 0, sum = 0, x, y, z, cnt = 0, m, fg = 0, mx = 0, mx1 = 0, mn = 8000000000000000000, mn1 = 8000000000000000000; cin >> t; while (t--) { cin >> n; vector<int> v1, v2, temp1; for (int i = 0; i < n; i++) { cin >> x; v1.push_back(x); } for (int i = 0; i < n; i++) { cin >> x; v2.push_back(x); } int mid = (n + 1) / 2; vector<pair<int, int> > vp1, vp2; for (int i = 0; i < mid; i++) { vp1.push_back({v1[i], v1[n - i - 1]}); vp2.push_back({v2[i], v2[n - i - 1]}); if (vp1[i].first > vp1[i].second) swap(vp1[i].first, vp1[i].second); if (vp2[i].first > vp2[i].second) swap(vp2[i].first, vp2[i].second); } sort(vp1.begin(), vp1.end()); sort(vp2.begin(), vp2.end()); if (vp1 == vp2) { cout << Yes n ; } else cout << No n ; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = 1e9; const int MAXN = 20010; const int MAXK = 110; int N, K; int A[MAXN]; int ord[MAXN]; int lo[MAXN], hi[MAXN]; struct line { int k, b; line() {} line(int k_, int b_) : k(k_), b(b_) {} int eval(int x) const { return k * x + b; } }; bool bad(const line& a, const line& b, const line& c) { return ll(b.b - a.b) * (b.k - c.k) <= ll(c.b - b.b) * (a.k - b.k); } void insert_hull(vector<line>& hull, const line& l) { while (hull.size() >= 2 && bad(hull.end()[-2], hull.end()[-1], l)) { hull.pop_back(); } hull.push_back(l); } int get_min(vector<line>& hull, int x) { if (hull.empty()) { return INF; } while (hull.size() >= 2 && hull.back().eval(x) >= hull.end()[-2].eval(x)) { hull.pop_back(); } return hull.back().eval(x); } vector<line> segg[2 * MAXN]; void update_g(int a, const line& l) { for (a += N + 1; a >= 1; a /= 2) { insert_hull(segg[a], l); } } int query_g(int a, int b, int x) { int res = INF; for (a += N + 1, b += N + 1; a < b; a /= 2, b /= 2) { if (a & 1) { res = min(res, get_min(segg[a], x)); a++; } if (b & 1) { b--; res = min(res, get_min(segg[b], x)); } } return res; } vector<line> segdp[2 * MAXN]; void update_dp(int a, int b, const line& l) { for (a += N + 1, b += N + 1; a < b; a /= 2, b /= 2) { if (a & 1) { insert_hull(segdp[a], l); a++; } if (b & 1) { b--; insert_hull(segdp[b], l); } } } int query_dp(int a, int x) { int res = INF; for (a += N + 1; a >= 1; a /= 2) { res = min(res, get_min(segdp[a], x)); } return res; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> N >> K; for (int i = 1; i <= N; i++) { cin >> A[i]; } iota(ord, ord + N + 1, 0); sort(ord, ord + N + 1, [&](int i, int j) { return A[i] < A[j]; }); vector<int> st; for (int i = 0; i <= N; i++) { while (st.size() && A[i] >= A[st.back()]) st.pop_back(); if (st.size()) { lo[i] = st.back(); } else { lo[i] = 0; } st.push_back(i); } A[N + 1] = INF; st = {N + 1}; for (int i = N; i >= 1; i--) { while (A[i] >= A[st.back()]) st.pop_back(); hi[i] = st.back(); st.push_back(i); } vector<int> dp(N + 1, INF); dp[0] = 0; for (int k = 0; k < K; k++) { for (int i = 1; i < 2 * (N + 1); i++) { segg[i].clear(); segdp[i].clear(); } for (int i = 0; i <= N; i++) { if (dp[i] != INF) { update_g(i, line(i, dp[i])); } } vector<int> vals(N + 1); for (int o = N; o >= 0; o--) { int i = ord[o]; vals[o] = query_g(lo[i], i, -A[i]); } for (int o = 0; o <= N; o++) { int i = ord[o]; if (vals[o] < INF) { update_dp(i, hi[i], line(A[i], vals[o])); } } for (int i = 0; i <= N; i++) { dp[i] = query_dp(i, i); } } cout << dp[N] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int kMaxN = 1000005; int aib[2 * kMaxN]; int x[kMaxN], poz[kMaxN]; int el[2 * kMaxN]; bool first[kMaxN]; void aib_update(int ind, int val) { while (ind < 2 * kMaxN) { aib[ind] += val; ind += ind & (-ind); } return; } int aib_search(int val) { int p = 20; int rez = 0; for (; p >= 0; --p) if ((1 << p) + rez < 2 * kMaxN) if (aib[(1 << p) + rez] < val) { val -= aib[(1 << p) + rez]; rez += (1 << p); } return rez + 1; } int main() { int n, m; ios_base::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= m; ++i) cin >> x[i] >> poz[i]; int st = m + 2; for (int i = st; i < st + n; ++i) { el[i] = 0; aib_update(i, +1); } bool ok = true; for (int i = 1; i <= m and ok; ++i) { st--; int p = aib_search(poz[i]); if (first[x[i]] == false) { if (el[p] != false) ok = false; el[p] = x[i]; first[x[i]] = true; el[st] = x[i]; aib_update(p, -1); aib_update(st, +1); } else { if (el[p] != x[i]) ok = false; aib_update(p, -1); aib_update(st, +1); el[st] = x[i]; } } if (not ok) cout << -1 n ; else { int st = m + 2; int dr = 1; for (int i = st; i < st + n; ++i) if (el[i] == 0) { while (first[dr] != 0) ++dr; cout << dr << ; ++dr; } else { cout << el[i] << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); unsigned long long t; cin >> t; while (t--) { unsigned long long x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2 || y1 == y2) { cout << 1 << n ; } else { unsigned long long d = x2 - x1; unsigned long long r = y2 - y1; cout << d * r + 1 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int p[N], used[N]; void solve() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> p[i]; } for (int i = 1; i <= n; i++) { if (p[i] == i) { cout << YES n ; for (int j = 1; j <= n; j++) { if (i == j) continue; cout << i << << j << n ; } return; } } for (int i = 1; i <= n; i++) { if (used[i]) continue; int j = i, length = 0; while (!used[j]) { used[j] = 1; length++; j = p[j]; } if (length & 1) { cout << NO ; return; } } memset(used, 0, sizeof used); for (int i = 1; i <= n; i++) { int j = p[i]; if (p[j] == i) { cout << YES n ; cout << i << << j << n ; for (int l = 1; l <= n; l++) { if (l == i || l == j || used[l]) continue; int v = l, xr = 0; while (!used[v]) { used[v] = 1; cout << v << << (xr == 0 ? i : j) << n ; xr ^= 1; v = p[v]; } } return; } } cout << NO ; } int main() { ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0); cout.setf(ios::fixed), cout.precision(20); solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, i, j; cin >> n >> m; char a[200][200]; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) cin >> a[i][j]; vector<vector<long long> > b(200, vector<long long>(200)); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (a[i][j] == * ) { b[i][j + 1]++; b[i][j - 1]++; b[i + 1][j]++; b[i - 1][j]++; b[i + 1][j + 1]++; b[i + 1][j - 1]++; b[i - 1][j + 1]++; b[i - 1][j - 1]++; } } } char c[200][200]; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (a[i][j] == * ) c[i][j] = a[i][j]; else if (b[i][j] == 0) c[i][j] = . ; else c[i][j] = b[i][j] += 0 ; } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (a[i][j] != c[i][j]) { cout << NO << endl; return 0; } } } cout << YES << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 111; vector<pair<int, int> > g[N]; void printAns(int id, int v, int u, double x) { if (x >= 1) { swap(v, u); x -= 1; } x = 1 - x; printf( 1 %d %d %d %.12lf n , id, u, v, x); } void dfs(int v, int par, double x) { for (pair<int, int> e : g[v]) { if (e.first == par) continue; x += 2. / (int)g[v].size(); if (x >= 2) x -= 2; printAns(e.second, v, e.first, x); double y = x + 1; if (y >= 2) y -= 2; dfs(e.first, v, y); } } int main() { int n; scanf( %d , &n); for (int i = 1; i < n; i++) { int v, u; scanf( %d%d , &v, &u); g[v].push_back(make_pair(u, i)); g[u].push_back(make_pair(v, i)); } printf( %d n , n - 1); double x = 0; for (pair<int, int> e : g[1]) { printAns(e.second, 1, e.first, x); double y = x + 1; if (y >= 2) y -= 2; dfs(e.first, 1, y); x += 2. / (int)g[1].size(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5 * 100005; int sum[N]; char str[5 * 100005]; int costf[5 * 100005]; int costb[5 * 100005]; int n, a, b, t; int main() { scanf( %d , &n); scanf( %d , &a); scanf( %d , &b); scanf( %d , &t); cin >> str; if (str[0] == h ) costf[1] = 1; else costf[1] = 1 + b; for (int i = 2; i <= n; i++) { if (str[i - 1] == h ) costf[i] = (costf[i - 1] + 1 + a); else costf[i] = (costf[i - 1] + 1 + a + b); } if (str[n - 1] == h ) costb[n] = 1; else costb[n] = (1 + b); for (int i = n - 1; i >= 1; i--) { if (str[i - 1] == h ) costb[i] = (costb[i + 1] + 1 + a); else costb[i] = (costb[i + 1] + 1 + a + b); } vector<int> v; for (int i = n; i >= 1; i--) { v.push_back(costb[i]); } int ans = 0; for (int i = 1; i <= n; i++) { int x = t; if (costf[i] > x) { break; } else { int temp = 0; temp += i; x -= costf[i]; x -= (a * i); if (x > 0) temp += (upper_bound(v.begin(), v.end(), x) - v.begin()); if (temp > n) temp = n; ans = max(ans, temp); } } vector<int> vv; for (int i = 2; i <= n; i++) { vv.push_back(costf[i] - a - costf[1]); } for (int i = n; i >= 1; i--) { int x = t; if (costb[i] + costf[1] + a > x) break; else { int temp = 0; temp += (n - i + 1); temp += 1; x -= (costb[i] + a + costf[1]); x -= (n - i + 2) * a; if (x > 0) temp += (upper_bound(vv.begin(), vv.end(), x) - vv.begin()); if (temp > n) temp = n; ans = max(ans, temp); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T BM(T p, T e, T M) { long long int ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <class T> inline T MDINV(T a, T M) { return BM(a, M - 2, M); } template <class T> inline T PW(T p, T e) { long long int ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p); p = (p * p); } return (T)ret; } template <class T> string NTS(T Number) { stringstream ss; ss << Number; return ss.str(); } template <class T> T stringtonumber(const string &Text) { istringstream ss(Text); T result; return ss >> result ? result : 0; } string h; long long int b; long long int vis[13][2][13]; long long int dp(long long int i, long long int choto, long long int ld) { if (i == h.size()) { if (ld == b) return 1; else return 0; } long long int &ret = vis[i][choto][ld]; if (ret != -1) return ret; ret = 0; if (!choto) { long long int ab = h[i] - 0 ; for (long long int j = 0; j <= ab; j++) { if (j == ab) { if (j == 4 || j == 7) ret += dp(i + 1, choto, ld + 1); else ret += dp(i + 1, choto, ld); } else { if (j == 4 || j == 7) ret += dp(i + 1, 1, ld + 1); else ret += dp(i + 1, 1, ld); } } } else { for (long long int j = 0; j <= 9; j++) { if (j == 4 || j == 7) ret += dp(i + 1, 1, ld + 1); else ret += dp(i + 1, 1, ld); } } return ret; } long long int fact(long long int num1, long long int num2) { if (num1 < num2) return 0; if (num1 == num2) return 1; else { long long int sum = num1 - num2; long long int res = 1; for (long long int i = sum + 1; i <= num1; i++) { res = (res * i) % 1000000007LL; } for (long long int i = 1; i <= num2; i++) { res = (res * MDINV(i, 1000000007LL)) % 1000000007LL; } return res; } } long long int digi[12]; long long int vi[12][100][7]; long long int dp1(long long int i, long long int ld, long long int nu) { if (i == b) { if (nu == 6 && ld < b) return 720; else return 0; } if (nu == 6) { if (ld < b) return 720; else return 0; } long long int &ret = vi[i][ld][nu]; if (ret != -1) return ret; ret = 0; for (long long int j = 1; j <= min(6 - nu, digi[i]); j++) { ret = (ret + fact(digi[i], j) * dp1(i + 1, j * i + ld, nu + j)) % 1000000007LL; } ret = (ret + dp1(i + 1, ld, nu)) % 1000000007LL; return ret; } int main() { long long int n, m; scanf( %lld , &n); h = NTS(n); long long int tot = 0; for (long long int i = 1; i <= ((int)h.size()); i++) { b = i; memset(vis, -1, sizeof vis); digi[i] = dp(0, 0, 0); tot += digi[i]; } long long int res = 0; digi[0] = n - tot; for (int j = 1; j <= ((int)h.size()); j++) { b = j; memset(vi, -1, sizeof vi); res = (res + digi[j] * dp1(0, 0, 0)) % 1000000007LL; } printf( %lld n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.precision(1); cout << fixed; double n, x, y; cin >> n >> x >> y; double s = (y * n) / 100; int p = ceil(s) - x; if (p >= 0) cout << p; else cout << 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n; cin >> n; int a, b; int s1 = 0; int s2 = 0; int flag = 0; while (n--) { cin >> a >> b; if ((a & 1) != (b & 1)) flag = 1; s1 += a; s2 += b; } cerr << s1 << << s2 << endl; int ans = 0; if (s1 % 2 != s2 % 2) { ans = -1; } else { if (s1 % 2 == 0) ans = 0; else if (!flag) ans = -1; else ans = 1; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n; int i; cin >> m >> n; double p[m]; double pre[m]; p[0] = pow(1.0 / m, n); pre[0] = p[0]; for (i = 1; i < m; i++) { p[i] = pow(double(i + 1) / m, n) - pre[i - 1]; pre[i] = pre[i - 1] + p[i]; } double a = 0; for (int k = 1; k <= m; k++) { a += k * p[k - 1]; } cout << a << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int arr[200] = {}, i, j, k, w, ans = 0; for (i = 0; i < n; i++) cin >> arr[i]; cin >> w; sort(arr, arr + n); for (i = 0; i < n; i++) { int c = 1; for (j = i + 1; j < n; j++) { if (arr[j] - arr[i] <= w) c++; else break; } ans = (ans > c ? ans : c); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int nmax = 200001; long long n, k; int main() { cin >> n >> k; int p = (n / k) % 2; cout << (p % 2 == 1 ? YES : NO ) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2010; const int INF = (int)1e9; char ch[N][N]; int n, m, k; int CountSpider(int x, int y, int time) { int ans = 0; if (x - time >= 1 && ch[y][x - time] == R ) ans++; if (x + time <= m && ch[y][x + time] == L ) ans++; if (y - time >= 1 && ch[y - time][x] == D ) ans++; if (y + time <= n && ch[y + time][x] == U ) ans++; return ans; } int main() { scanf( %d%d%d n , &n, &m, &k); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) scanf( %c , &ch[i][j]); scanf( n ); } for (int j = 1; j <= m; ++j) { int time = 0; int ans = 0; for (int i = 1; i <= n; ++i) { ans += CountSpider(j, i, time); time++; } printf( %d , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N, F, M; cin >> N >> F >> M; int FR[200], MO[200]; vector<int> V; int mi = 10000; for (int i = 0; i < F; ++i) cin >> FR[i]; for (int j = 0; j < M; ++j) cin >> MO[j]; for (int i = 0; i < F; ++i) { int cnt = 0; for (int j = 0; j < M; ++j) if (MO[j] % FR[i] == 0) cnt++; if (cnt < mi) { V.clear(); V.push_back(i + 1); mi = cnt; } else if (mi == cnt) V.push_back(i + 1); } cout << V.size() << endl; for (int i = 0; i < V.size(); ++i) { if (i < V.size() - 1) cout << V[i] << ; else cout << V[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; void solve(){ int n; scanf( %d , &n); if (n == 2){ printf( 1 n2 1 n1 n2 1 n ); } else if (n == 3){ printf( 5 n2 3 1 n2 n1 3 n2 3 n ); } else { long long t = 0; vector<int> ans; vector<pair<int, int>> vc; ans.push_back(n / 2 + 1); for (int i = 3; i <= n / 2; ++i) ans.push_back(i); ans.push_back(1); for (int i = n / 2 + 2; i <= n; ++i) ans.push_back(i); ans.push_back(2); for (int i = 2; i <= n / 2; ++i){ vc.push_back({i, n}); t += (long long)(n - i) * (n - i); } for (int i = n / 2 + 1; i <= n; ++i){ vc.push_back({i, 1}); t += (long long)(i - 1) * (i - 1); } printf( %lld n , t); for (int it : ans) printf( %d , it); printf( n ); printf( %d n , n - 1); for (auto it : vc){ printf( %d %d n , it.first, it.second); } } } int main(){ int T; scanf( %d , &T); while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k; long long bmm(long long x, long long y) { if (y) return bmm(y, x % y); return x; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; long long d = k; for (long long i = 0; i < n; i++) { long long x; cin >> x; d = bmm(d, x % k); } if (d == k) { cout << 1 << n ; cout << 0 << n ; } else { n = (k + d - 1) / d; cout << n << n ; for (long long i = 0; i < n; i++) cout << i * d << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 2e5 + 4; int main() { string s; int n; scanf( %d , &n); cin >> s; int pre[n], suf[n], minm = 0, bal = 0; for (int i = 0; i < n; i++) { if (s[i] == ( ) { pre[i] = 1; suf[i] = -1; } else { pre[i] = -1; suf[i] = 1; } bal += pre[i]; minm = min(minm, bal); } if (bal == 0) { if (minm > -2) { printf( Yes ); return 0; } } printf( No ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, o = 0, x = 0; cin >> n; for (int i = 0; i < n; i++) { int a; cin >> a; if (a) x++; else o++; } int s = x / 9; if (s && o) { for (int i = 0; i < 9 * s; i++) { cout << 5; } for (int i = 0; i < o; i++) { cout << 0; } } else if (o) cout << 0; else cout << -1; return 0; } |
#include <bits/stdc++.h> char a[200005], b[200005], c[200005]; int v[200005], n, m; bool verif(int poz) { int i, j; for (i = 1; i <= n; i++) c[i] = a[i]; for (i = 1; i <= poz; i++) c[v[i]] = 0; for (i = 1, j = 1; i <= n && j <= m; i++) if (c[i] == b[j]) j++; if (j == m + 1) return true; return false; } int main() { int i, st, dr, mij, rasp = 0; char ch; ch = fgetc(stdin); while (ch >= a && ch <= z ) { n++; a[n] = ch; ch = fgetc(stdin); } ch = fgetc(stdin); while (ch >= a && ch <= z ) { m++; b[m] = ch; ch = fgetc(stdin); } for (i = 1; i <= n; i++) fscanf(stdin, %d , &v[i]); st = 1; dr = n; while (st <= dr) { mij = (st + dr) / 2; if (verif(mij) == true) { rasp = mij; st = mij + 1; } else { dr = mij - 1; } } fprintf(stdout, %d , rasp); fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a, b, c, ans; int main() { cin >> n >> a >> b >> c; if (n >= b) ans = (n - ((n - b) / (b - c) + 1) * (b - c)) / a + (n - b) / (b - c) + 1; cout << max(n / a, ans); } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native ) using namespace std; int a1, b1, c1, a2, b2, c2; int d1, d2, d3, d4, d5, d6, d7; int f1, f2, f3, f4, f5, f6, f7; bool check() { return f1 <= d1 && f2 <= d2 && f3 <= d3 && f4 <= d4 && f5 <= d5 && f6 <= d6 && f7 <= d7 && (f1 + f2 + f3 + f4 <= a1) && (f1 + f2 + f5 + f6 <= b1) && (f1 + f3 + f5 + f7 <= c1) && (f1 + f2 + f3 + f4 >= d1 + d2 + d3 + d4 - a2) && (f1 + f2 + f5 + f6 >= d1 + d2 + d5 + d6 - b2) && (f1 + f3 + f5 + f7 >= d1 + d3 + d5 + d7 - c2); } void solve() { cin >> a1 >> b1 >> c1 >> a2 >> b2 >> c2; cin >> d1 >> d2 >> d3 >> d4 >> d5 >> d6 >> d7; if (d1 + d2 + d3 + d4 > a1 + a2 || d1 + d2 + d5 + d6 > b1 + b2 || d1 + d3 + d5 + d7 > c1 + c2) { cout << -1 n ; return; } int t = d2 + d3 + d5; for (int A = 0; A <= a1; ++A) { for (int B = 0; B <= t; ++B) { int lf3 = max({0, A + B - b1}); int rf3 = min({d3, A + B + b2 - d1 - d2 - d5}); int lf5 = max({0, A + B - a1}); int rf5 = min({d5, A + B + a2 - d1 - d2 - d3}); int lf3f5 = max({0, B - d2, d1 + d3 + d5 - A - c2}); int rf3f5 = min({d3 + d5, c1 - A, B}); if (rf3 < lf3 || rf5 < lf5 || rf3f5 < lf3f5) continue; f3 = lf3; f5 = lf5; if (f3 + f5 > rf3f5) continue; if (f3 + f5 < lf3f5) { int tmp; int delta = lf3f5 - (f3 + f5); tmp = min(delta, rf3 - f3); f3 += tmp; delta -= tmp; tmp = min(delta, rf5 - f5); f5 += tmp; delta -= tmp; if (delta > 0) continue; } f1 = A; f2 = B - f3 - f5; f4 = max(0, d1 + d2 + d3 + d4 - a2 - A - B + f5); f6 = max(0, d1 + d2 + d5 + d6 - b2 - A - B + f3); f7 = max(0, d1 + d3 + d5 + d7 - c2 - A - B + f2); if (check()) { cout << f1 << << f2 << << f3 << << f4 << << f5 << << f6 << << f7 << n ; return; } } } cout << -1 n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; inline string to_string(char c) { string s; s.push_back(c); return s; } struct Node { bool can_delete_all = true; char first_cant = 0; bool more = false; string first = ; string last = ; int ans_len = 0; Node(bool can_delete_all = true, char first_cant = 0, bool more = false, string first = , string last = , int ans_len = 0) : can_delete_all(can_delete_all), first_cant(first_cant), more(more), first(first), last(last), ans_len(ans_len) {} friend Node operator+(pair<int, char> p, Node n) { auto [len, c] = p; if (n.can_delete_all) return Node(len % 2 == 0, c, false, (len % 2 == 0 ? : to_string(c)), (len % 2 == 0 ? : to_string(c)), len % 2); auto add = [](string &first, string &last, int len, char c, int &ans_len) { ans_len += len; reverse(last.begin(), last.end()); for (int i = 0; i < len && (int)last.size() < 2; i++) last.push_back(c); reverse(last.begin(), last.end()); reverse(first.begin(), first.end()); for (int i = 0; i < len && i < 12; i++) first.push_back(c); reverse(first.begin(), first.end()); while ((int)first.size() > 12) first.pop_back(); }; if (c == n.first_cant) { if (n.more) add(n.first, n.last, len, c, n.ans_len); else add(n.first, n.last, len % 2, c, n.ans_len); return n; } if (c < n.first_cant) { add(n.first, n.last, len, c, n.ans_len); n.more = true; n.first_cant = c; return n; } assert(c > n.first_cant); if (len % 2 == 0) return n; add(n.first, n.last, 1, c, n.ans_len); n.more = false; n.first_cant = c; return n; } void print() { cout << ans_len << ; if (ans_len <= 10) cout << first << n ; else cout << first.substr(0, 5) << ... << last << n ; } }; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); string s; cin >> s; int n = (int)s.size(); vector<pair<int, int>> segs; for (int i = 0; i < n;) { int j = i; while (j < n && s[i] == s[j]) j++; segs.emplace_back(i, j); i = j; } int m = (int)segs.size(); segs.emplace_back(n, n); vector<Node> dp(m + 1); for (int i = m - 1; i >= 0; i--) dp[i] = pair<int, char>{segs[i].second - segs[i].first, s[segs[i].first]} + dp[i + 1]; int segi = 0; pair<int, char> cur; for (int i = 0; i < n; i++) { while (segs[segi].first < i) segi++; if (segs[segi].first == i) { dp[segi].print(); cur = {segs[segi].second - segs[segi].first, s[segs[segi].first]}; cur.first--; } else { (cur + dp[segi]).print(); cur.first--; } } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; int a[MAXN], ans[MAXN]; pair<int, int> tab[MAXN]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { cin >> tab[i].first; tab[i].second = i; } sort(a, a + n, greater<int>()); sort(tab, tab + n); for (int i = 0; i < n; i++) ans[tab[i].second] = a[i]; for (int i = 0; i < n; i++) cout << ans[i] << ; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; int a[15][123]; int b[15][123]; int c[15][123]; vector<int> v; bool cmp(int x, int y) { return x > y; } int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) { string s; cin >> s; for (int j = 0; j < m; j++) cin >> a[i][j] >> b[i][j] >> c[i][j]; } int ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (i == j) continue; v.clear(); for (int h = 0; h < m; h++) for (int t = 0; t < c[i][h]; t++) if (b[j][h] - a[i][h] > 0) v.push_back(b[j][h] - a[i][h]); sort(v.begin(), v.end(), cmp); int tmp = 0; for (int h = 0; h < min(k, (int)v.size()); h++) tmp += v[h]; ans = max(ans, tmp); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int const inf = 1000 * 1000 * 1000; long long const inf64 = 1ll * inf * inf; struct Fenwick { int n; vector<long long> fen; Fenwick() { n = 0; } Fenwick(int nn) { n = nn; fen.resize(n + 1); } void put(int pos, int val) { for (int cur = pos; cur <= n; cur |= (cur + 1)) fen[cur] += val; } long long get(int pos) { long long res = 0; for (int cur = pos; cur > 0; cur = (cur & (cur + 1)) - 1) res += fen[cur]; return res; } long long get(int l, int r) { return get(r) - get(l - 1); } }; bool solve() { int n, m, k; scanf( %d %d %d , &n, &m, &k); vector<vector<pair<pair<int, int>, int> > > add(m + 1); for (int i = 1; i <= m; i++) add[i].reserve(n); for (int len, i, j, w, iter = 0; iter < k; iter++) { scanf( %d , &len); for (int iter2 = 0; iter2 < len; iter2++) { scanf( %d %d %d , &i, &j, &w); add[j].push_back({{i, w}, iter}); } } int q; scanf( %d , &q); vector<char> type(q); vector<int> sw(q); vector<pair<int, int> > ask(q); vector<vector<long long> > res(2005, vector<long long>(k)); vector<vector<int> > era(m + 1), ins(m + 1); vector<int> ide(q); char buffer[10]; for (int i, x1, y1, x2, y2, iter = 0; iter < q; iter++) { scanf( %s , buffer); if (string(buffer) == SWITCH ) { scanf( %d , &i); type[iter] = 0; sw[iter] = i - 1; } else { scanf( %d %d %d %d , &x1, &y1, &x2, &y2); type[iter] = 1; ask[iter] = {x1, x2}; ins[y1].push_back(iter); era[y2].push_back(iter); static int rectange_size = 0; ide[iter] = rectange_size++; } } vector<Fenwick> fen(k, Fenwick(n)); for (int pos, value, id, l, r, j = 1; j <= m; j++) { for (int iter : ins[j]) { tie(l, r) = ask[iter]; for (int kk = 0; kk < k; kk++) { res[ide[iter]][kk] -= fen[kk].get(l, r); } } for (auto _iter : add[j]) { tie(pos, value) = _iter.first; id = _iter.second; fen[id].put(pos, value); } for (int iter : era[j]) { tie(l, r) = ask[iter]; for (int kk = 0; kk < k; kk++) { res[ide[iter]][kk] += fen[kk].get(l, r); } } } vector<char> state(k, 1); for (int iter = 0; iter < q; iter++) { if (type[iter] == 0) { state[sw[iter]] ^= 1; } else { long long result = 0; for (int i = 0; i < k; i++) { if (state[i]) result += res[ide[iter]][i]; } printf( %I64d n , result); } } return true; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; map<pair<int, int>, int> id; vector<int> a[100005]; int main() { int i, j, k, n; cin >> n; cout << n - 1 << endl; int idd = 1; for (k = (1); k <= (n - 1); k++) { cin >> i >> j; a[i].push_back(j); a[j].push_back(i); id[make_pair(i, j)] = idd; id[make_pair(j, i)] = idd++; printf( 2 %d %d n , i, j); } for (i = (1); i <= (n); i++) for (j = 1; j < a[i].size(); j++) { cout << id[make_pair(i, a[i][j - 1])] << << id[make_pair(i, a[i][j])] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int t; char a[30]; int main() { cin >> t; while (t--) { string s; cin >> s; int len = s.size(), id = 0; for (int i = 0; i < len; i++) { int temp = 1; while (s[i + 1] == s[i]) { i++; temp++; } if (temp % 2 == 0) continue; int flag = 0; for (int j = 0; j < id; j++) { if (a[j] == s[i]) { flag = 1; break; } } if (!flag) a[id++] = s[i]; } if (!id) cout << endl; else { sort(a, a + id); for (int i = 0; i < id; i++) cout << a[i]; cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void swap(long long &a, long long &b) { long long t = a; a = b; b = t; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; set<long long> s; long long arr[n]; for (long long i = 0; i < n; i++) { cin >> arr[i]; s.insert(arr[i]); } if (n > 1 && s.size() > 1 && k == 1) { cout << -1 << endl; continue; } if (s.size() == 1) { cout << 1 << endl; continue; } long long count = 0; while (1) { if (s.size() == 1) { break; } set<long long> s1; long long j = 0; long long last = 0; for (auto x : s) { if (j < k) { s1.insert(0); j++; last = x; } else { s1.insert(x - last); j++; } } count++; s = s1; } cout << count << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 19; int a[1 << N]; int main() { int n, q; cin >> n >> q; long long sum = 0; for (int i = 0; i < (1 << n); i++) cin >> a[i], sum += a[i]; cout << setprecision(10) << 1.0 * sum / (1 << n) << n ; for (int i = 0; i < q; i++) { int id, v; cin >> id >> v; sum += v - a[id]; a[id] = v; cout << setprecision(10) << 1.0 * sum / (1 << n) << n ; } } |
#include <bits/stdc++.h> using namespace std; int p(string s) { string a = s; s += # ; reverse(a.begin(), a.end()); s += a; int n = s.size(); vector<int> pi(n); pi[0] = 0; int j = 0; for (int i = 1; i < n; i++) { j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) j++; pi[i] = j; } return j; } int main() { int t = 1; cin >> t; while (t--) { string s; cin >> s; int cnt = 0; int n = s.size(); for (int i = 0; i < n / 2; i++) { if (s[i] != s[n - 1 - i]) break; cnt++; } string ans; if (cnt > 0) cout << s.substr(0, cnt); ; string a = s; reverse(a.begin(), a.end()); int pos = p(s.substr(cnt, n - 2 * cnt)); string w = s.substr(cnt, pos); pos = p(a.substr(cnt, n - 2 * cnt)); w = (pos > w.length()) ? a.substr(cnt, pos) : w; cout << w; if (cnt > 0) cout << s.substr(n - cnt, cnt); cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); string s; deque<char> vec; cin >> s; for (int i = 0; i < s.size(); ++i) vec.push_back(s[i]); int cnt = 0, i; while (vec.size() > 1) { if (vec[vec.size() - 1] == 0 ) { ++cnt; vec.pop_back(); } else { for (i = vec.size() - 1; i >= 0; --i) { if (vec[i] == 0 ) break; vec[i] = 0 ; } if (i < 0) vec.push_front( 1 ); else vec[i] = 1 ; ++cnt; } } cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005, M = 998244353; int read(int x = 0, int f = 1, char c = getchar()) { for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; return x * f; } int n, a[N][N], f[N][N], p[N], fac[N], ans; struct Tree { int t[N], v[N]; void Add(int x, int w) { if (w == -1 && !v[x]) return; v[x] ^= 1; for (; x <= n; x += x & -x) t[x] += w; } int Ask(int x, int w = 0) { for (; x; x -= x & -x) w += t[x]; return w; } void Init() { for (int i = 1; i <= n; ++i) t[i] = i & -i, v[i] = 1; } } t1, t2; int main() { n = read(); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) a[i][j] = read(); f[0][0] = 1; f[1][1] = 0; f[2][2] = 1; for (int i = 3; i <= n; ++i) f[i][i] = 1ll * (i - 1) * (f[i - 1][i - 1] + f[i - 2][i - 2]) % M; for (int i = 1; i <= n; ++i) for (int j = i - 1; j >= 0; --j) if ((f[i][j] = f[i][j + 1] + f[i - 1][j]) >= M) f[i][j] -= M; fac[0] = p[0] = 1; for (int i = 1; i <= n; ++i) { fac[i] = 1ll * fac[i - 1] * i % M; p[i] = 1ll * p[i - 1] * f[n][n] % M; } t1.Init(); for (int j = 1; j <= n; ++j) t1.Add(a[1][j], -1), ans = (ans + 1ll * t1.Ask(a[1][j]) * fac[n - j]) % M; ans = 1ll * ans * p[n - 1] % M; for (int i = 2; i <= n; ++i) { int sum = 0; t1.Init(); t2.Init(); for (int j = 1; j <= n; ++j) { int tot, cnt, tmp; t1.Add(a[i][j], -1); tot = t1.Ask(a[i][j]); if (a[i - 1][j] < a[i][j] && t1.v[a[i - 1][j]]) tot--; t2.Add(a[i - 1][j], -1); tmp = t2.Ask(n); cnt = t2.Ask(a[i][j] - 1); sum = (sum + 1ll * cnt * f[n - j][tmp - 1] + 1ll * (tot - cnt) * f[n - j][tmp]) % M; t2.Add(a[i][j], -1); } ans = (ans + 1ll * sum * p[n - i]) % M; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<long long> v; vector<pair<pair<long long, long long>, long long> > vv; vector<long long> ary; void update(int pos, long long val, int mx) { while (pos <= mx) { ary[pos] += val; pos += pos & -pos; } } long long get(int pos, int mx) { long long re = 0; while (pos > 0) { re += ary[pos]; pos -= pos & -pos; } return re; } int main(void) { ios_base::sync_with_stdio(0); cin >> n >> m >> k; v.resize(n); for (int i = 0; i < (n); i++) cin >> v[i]; vv.resize(m); for (int i = 0; i < (m); i++) cin >> vv[i].first.first >> vv[i].first.second >> vv[i].second; ary.resize(m + 1, 0); for (int i = 0; i < (k); i++) { long long t, tt; cin >> t >> tt; update(t, 1, m); update(tt + 1, -1, m); } for (int i = 0; i < (m); i++) { vv[i].second *= get(i + 1, m); } ary.clear(); ary.resize(n + 2, 0); for (int i = 0; i < (m); i++) { update(vv[i].first.first, vv[i].second, n); update(vv[i].first.second + 1, -vv[i].second, n); } for (int i = 0; i < (n); i++) { v[i] += get(i + 1, n); } for (int i = 0; i < (n); i++) cout << v[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int X, t[10000], h[10000], m[10000], v[10000]; int f(int x) { int ht = X; memset(v, 0, sizeof(v)); for (int i = (0); i < (n); i++) { int tmp = -1; for (int j = (0); j < (n); j++) { if (v[j] || t[j] != ((i + x) & 1) || h[j] > ht) continue; if (tmp == -1) tmp = j; if (m[j] > m[tmp]) tmp = j; } if (tmp == -1) return i; ht += m[tmp]; v[tmp] = 1; } return n; } int main() { scanf( %d%d , &n, &X); for (int i = (0); i < (n); i++) scanf( %d%d%d , t + i, h + i, m + i); int ans = 0, tmp = 0; ans = f(0); ans = max(ans, f(1)); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s; set<string> aux; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { cin >> s; string ns = ; for (int j = 0; j < s.size(); j++) { if (s[j] == u ) ns += oo ; else if (s[j] == h ) { while (!ns.empty() && ns.back() == k ) ns.pop_back(); ns += s[j]; } else ns += s[j]; } aux.insert(ns); } printf( %d n , aux.size()); return 0; } |
#include<bits/stdc++.h> using namespace std; #define ll long long int #define inf 1e18 #define F first #define S second #define io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define pb push_back #define pll pair<ll,ll> #define vl vector<ll> #define all(x) (x).begin(),(x).end() #define siz 300005 #define MOD 998244353 vector<vector<ll> > adj(siz); vector<ll> vis(siz,0); ll mod=MOD; ll power(ll x, ll y){ if (y == 0) return 1; else if (y % 2 == 0) return ((power(x, y / 2))%mod * (power(x, y / 2))%mod)%mod; else return (x%mod * (power(x, y / 2))%mod * (power(x, y / 2))%mod)%mod; } ll foo(ll n){ return ( n*(n+1) )/2; } int main(){ ll q=1; cin>>q; while(q--){ string s; cin>>s; ll n=s.size(),gap=0,last=-1,l=0,r=0,ans=0; while(l<n){ //cout<<last<< <<l<< <<r<< <<ans<<endl; if(r==n or (last!=-1 and s[r]!= ? and ((s[r]!=s[last] and gap%2==1) or(s[r]==s[last] and gap%2==0)) ) ){ if(r==n){ ans+=foo(r-l); break; } ll nl=last+1; ans+=(foo(r-l)-foo(r-nl)); if(last<nl)last=-1;l=nl; } else{ if(s[r]!= ? ){last=r;gap=0;} else gap++; r++; } } cout<<ans<<endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, k, l; cin >> n >> m; k = (n - m) / 2; j = 1; while (j <= n) { if (j % (k + 1) == 0) { cout << 1 ; } else { cout << 0 ; } j++; } } |
#include <bits/stdc++.h> using namespace std; const long long maxS = 2e5 + 5; long long N, M; long long A[201], B[201]; long long DP[201][515]; long long go(long long pos, long long prev) { if (pos == N + 1) return 0; if (DP[pos][prev] != -1) return DP[pos][prev]; long long ans = INT_MAX; for (long long i = 1; i <= M; i++) ans = min(ans, (prev | (A[pos] & B[i]) | go(pos + 1, (prev | (A[pos] & B[i]))))); return DP[pos][prev] = ans; } void code_idhr_h() { cin >> N >> M; for (long long i = 1; i <= N; i++) cin >> A[i]; for (long long i = 1; i <= M; i++) cin >> B[i]; memset(DP, -1, sizeof DP); cout << go(1, 0) << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long T = 1; for (long long t = 1; t <= T; t++) { code_idhr_h(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5000000 + 10; const int mod = 51123987; int n; long long p[maxn], sum; char s1[maxn], s[maxn]; long long min(int a, int b) { return a < b ? a : b; } inline void init() { s[0] = $ ; for (int i = 1; i <= n; ++i) s[2 * i] = s1[i], s[2 * i - 1] = # ; s[2 * n + 1] = # ; n = 2 * n + 1; } inline void manacher() { init(); p[0] = 0; for (int i = 1, id = 0, mx = 0; i <= n; ++i) { if (mx > i) p[i] = min(mx - i + 1, p[2 * id - i]); else p[i] = 0; while (s[i - p[i]] == s[i + p[i]]) ++p[i]; if (i + p[i] - 1 > mx) id = i, mx = i + p[i] - 1; sum += (p[i] - 1) / 2; if (i % 2 == 0) ++sum; } } long long f[maxn], g[maxn]; inline void solve() { sum %= mod; sum = sum * (sum - 1) / 2; sum %= mod; for (int i = 2; i <= n; i += 2) { ++f[i - p[i] + 2]; --f[i + 2]; ++g[i]; --g[i + p[i]]; } for (int i = 1; i <= n; i += 2) { ++f[i - p[i] + 2]; --f[i + 1]; ++g[i + 1]; --g[i + p[i]]; } for (int i = 2; i <= n; i += 2) { f[i] += f[i - 2]; f[i] %= mod; g[i] += g[i - 2]; g[i] %= mod; } f[n + 1] = 0; for (int i = n - 1; i >= 1; i -= 2) f[i] += f[i + 2]; for (int i = 2; i <= n; i += 2) { sum = sum - (g[i] * f[i + 2]) % mod; sum = (sum + mod) % mod; } sum = (sum + mod) % mod; printf( %I64d n , sum); } int main() { scanf( %d%s , &n, s1 + 1); manacher(); solve(); return 0; } |
#include <bits/stdc++.h> char ar[10][10]; int q[10 * 10 * 10 * 10][3]; bool forb[10][10][10 * 10]; bool used[10][10][10 * 10]; int dir[9][2] = {{1, 1}, {1, 0}, {1, -1}, {0, 1}, {0, 0}, {0, -1}, {-1, 1}, {-1, 0}, {-1, -1}}; void BFS(void) { int x = 8, y = 1; q[1][0] = x; q[1][1] = y; q[1][2] = 1; used[x][y][1] = 1; for (int al = 1, at = 1; al <= at; al++) { x = q[al][0]; y = q[al][1]; if (x == 1 && y == 8) { printf( WIN n ); return; } for (int i = 0; i < 9; i++) { int cx = x + dir[i][0]; int cy = y + dir[i][1]; if (cx > 0 && cx <= 8 && cy > 0 && cy <= 8) if (!used[cx][cy][q[al][2] + 1]) if (!forb[cx][cy][q[al][2]] && !forb[cx][cy][q[al][2] + 1]) { q[++at][0] = cx; q[at][1] = cy; q[at][2] = q[al][2] + 1; used[cx][cy][q[al][2] + 1] = 1; } } } printf( LOSE n ); } int main() { for (int i = 1; i <= 8; i++) for (int j = 1; j <= 8; j++) { scanf( %c , &ar[i][j]); if (ar[i][j] == S ) for (int k = i; k <= 8; k++) forb[k][j][k - i + 1] = 1; } BFS(); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using vi = vector<int>; constexpr int MOD = 998244353; int sum(int a, int b, int mod = MOD) { int c = a + b; if (c >= mod) { c -= mod; } return c; } inline int prod(int a, int b, int mod = MOD) { return (1LL * a * b) % mod; } int modpow(int base, ll exp, int mod = MOD) { int res = 1; int cur = base; for (ll p = 1LL; p <= exp; p <<= 1LL) { if (p & exp) { res = prod(res, cur, mod); } cur = prod(cur, cur, mod); } return res; } inline int inv(int x, int mod = MOD) { return modpow(x, mod - 2, mod); } constexpr int MAXN = 1e6 + 6; int fact[MAXN], tcaf[MAXN]; void gen_fact() { fact[0] = 1; for (int i = 1; i < MAXN; ++i) { fact[i] = prod(fact[i - 1], i); } tcaf[MAXN - 1] = inv(fact[MAXN - 1]); for (int i = MAXN - 2; i >= 0; --i) { tcaf[i] = prod(tcaf[i + 1], i + 1); } } int choose(int n, int k) { assert(n >= 0); assert(0 <= k and k <= n); return prod(fact[n], prod(tcaf[k], tcaf[n - k])); } int solve(ll n) { int ans = modpow(3, 1LL * n * n); for (int i = 1; i <= n; ++i) { int x = prod(choose(n, i), modpow(3, 1LL * (n * (n - i)) + i)); int v = prod(2, x); if (i % 2 == 0) { ans = sum(ans, v); } else { ans = sum(ans, MOD - v); } } for (int i = 1; i < n; ++i) { int v = prod(6, choose(n, i)); if ((i + n) % 2 == 0) { ans = sum(ans, v); } else { ans = sum(ans, MOD - v); } } ans = sum(ans, 3); int square_sum = 0; for (int i = 1; i < n; ++i) { int row_sum = modpow(1 + MOD - modpow(3, i), n); row_sum = sum(row_sum, MOD - 1); row_sum = sum(row_sum, MOD - modpow(MOD - modpow(3, i), n)); square_sum = sum(square_sum, prod(modpow(MOD - 1, i), prod(choose(n, i), row_sum))); } ans = sum(ans, prod(3, square_sum)); return sum(modpow(3, 1LL * n * n), MOD - ans); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); gen_fact(); int n; cin >> n; cout << solve(n); return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; long long l = -1, r = -1; for (long long i = 0; i < s.length(); i++) { if (s[i] == [ ) { l = i; break; } } for (long long i = s.length(); i >= 0; i--) { if (s[i] == ] ) { r = i; break; } } if (l == -1 || r == -1 || r < l) cout << -1 << n , exit(0); s = s.substr(l, r - l + 1); l = -1; r = -1; for (long long i = 1; i < s.length() - 1; i++) { if (s[i] == : ) { l = i; break; } } for (long long i = s.length() - 2; i >= 1; i--) { if (s[i] == : ) { r = i; break; } } if (l == r || l == -1) cout << -1 n , exit(0); string v = s.substr(l, r - l + 1); long long ct = 0; for (auto it : v) { if (it == | ) ct++; } cout << ct + 4 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, car[101][101]; bool t[101] = {0}; vector<int> ans; ans.clear(); scanf( %d , &n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { scanf( %d , &car[i][j]); if (car[i][j] == 2) { t[j] = true; } else if (car[i][j] == 1) { t[i] = true; } else if (car[i][j] == 3) { t[i] = true; t[j] = true; } } } for (int i = 0; i < n; i++) { if (t[i] == false) ans.push_back(i + 1); } printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i]); if (i < ans.size() - 1) printf( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 4003; int t[N][N]; int a; string s; map<long long, long long> mp; long long acc[N]; int main() { cin >> a >> s; int n = s.size(); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) t[i][j] = (s[i] - 0 ) * (s[j] - 0 ); for (int i = 0; i < n; i++) { long long sum = 0; for (int j = 0; j <= i; j++) sum += (s[j] - 0 ); acc[i] = sum; } acc[-1] = 0; for (int i = 0; i < n; i++) for (int j = 0; j <= i; j++) { long long sum = acc[i] - acc[j - 1]; mp[sum]++; } long long ans = 0; for (int i = 0; i < n; i++) { long long sum = 0; for (int j = 0; j <= i; j++) { sum = acc[i] - acc[j - 1]; if (sum) if (a % sum == 0) { ans += mp[a / sum]; } if (!sum && !a) ans += n * (n + 1) / 2; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T X) { return X * X; } const int maxn = 110; const double zero = 1e-8; int n, K; double omiga; struct COO { double x, y; } ob[maxn], nuclear; double p[maxn], f[maxn][maxn]; double numb; double ans; void init() { scanf( %d , &n); scanf( %d%lf , &K, &omiga); omiga = 1.0 - omiga / 1000; scanf( %lf%lf , &nuclear.x, &nuclear.y); for (int i = 1; i <= n; i++) scanf( %lf%lf , &ob[i].x, &ob[i].y); } int ZO(double comX, double comY) { if (abs(comY - comX) <= zero) return 0; if (comX < comY) return -1; else return 1; } void work1(double R) { for (int i = 1; i <= n; i++) { double Di = sqr(nuclear.x - ob[i].x) + sqr(nuclear.y - ob[i].y); if (ZO(Di, sqr(R)) <= 0) p[i] = 1.0; else p[i] = exp(1 - Di / sqr(R)); } } void dp() { for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) f[i][j] = 0.0; f[0][0] = 1.0; for (int i = 1; i <= n; i++) f[i][0] = f[i - 1][0] * (1 - p[i]); for (int i = 1; i <= n; i++) for (int j = 1; j <= i; j++) f[i][j] = f[i - 1][j - 1] * p[i] + f[i - 1][j] * (1.0 - p[i]); numb = 0.0; for (int j = K; j <= n; j++) numb += f[n][j]; } void solve() { double Lx = 0, Rx = 4000.0; while (ZO(Lx, Rx) < 0) { double mid = (Lx + Rx) / 2; work1(mid); dp(); if (numb >= omiga) Rx = mid; else Lx = mid; } ans = Lx; } void print() { printf( %.10lf n , ans); } int main() { init(); solve(); print(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const int nax = 1e3 + 20; const int mod = 1e9 + 7; int fact[nax]; int binpow(int a, int e) { int ans = 1; while (e > 1) { if (e & 1) { ans = (1LL * ans * a) % mod; --e; } a = (1LL * a * a) % mod; e >>= 1; } ans = (1LL * ans * a) % mod; return ans; } int C(int n, int k) { if (k > n) return 0; return (1LL * fact[n] * (1LL * binpow(fact[n - k], mod - 2) * binpow(fact[k], mod - 2) % mod)) % mod; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << setprecision(20) << fixed; fact[0] = 1; for (int i = 1; i <= (int)nax - 1; ++i) { fact[i] = (1LL * fact[i - 1] * i) % mod; } int n, m, k; cin >> n >> m >> k; cout << (1LL * C(n - 1, 2 * k) * C(m - 1, 2 * k)) % mod << n ; } |
#include <bits/stdc++.h> using namespace std; template <class X, class Y> void amax(X& x, const Y& y) { if (x < y) x = y; } template <class X, class Y> void amin(X& x, const Y& y) { if (x > y) x = y; } const int INF = 1e9 + 10; const long long INFL = (long long)1e18 + 10; const int MAX = 2e5 + 10; int n; long long l[MAX], r[MAX]; map<long long, long long> cnt, inc, ddec; void process() { cin >> n; for (int i = 1; i <= n; i++) cin >> l[i] >> r[i]; long long maxr = 0, minl = INFL; for (int i = 1; i <= n; i++) { inc[l[i]] = ddec[l[i]] = 0; inc[r[i]] = ddec[r[i]] = 0; amax(maxr, r[i]); amin(minl, l[i]); } ddec[maxr + 1] = 0; for (int i = 1; i <= n; i++) { inc[l[i]]++; auto p2 = ddec.find(r[i]); p2 = next(p2); p2->second++; } long long ppost = minl - 1; int psum = 0; for (auto p : inc) { psum -= ddec[p.first]; cnt[psum] += p.first - ppost - 1; psum += p.second; cnt[psum]++; ppost = p.first; } for (int i = 1; i <= n; i++) cout << cnt[i] << ; } int main() { ios_base::sync_with_stdio(false); process(); } |
#include <bits/stdc++.h> int main() { long long int m, n, a; scanf( %lld %lld %lld , &m, &n, &a); if (m % a == 0 && n % a == 0) { printf( %lld , m * n / a / a); } if (m % a != 0 && n % a == 0) { printf( %lld , ((m + a) / a) * (n / a)); } if (m % a != 0 && n % a != 0) { printf( %lld , ((m + a) / a) * ((n + a) / a)); } if (m % a == 0 && n % a != 0) { printf( %lld , m / a * ((n + a) / a)); } } |
#include <bits/stdc++.h> using namespace std; vector<int> e[200000 + 5]; int main() { int T, n; int m, p; scanf( %d , &T); for (int t = 1; t <= T; ++t) { scanf( %d , &n); for (int i = 0; i <= n; ++i) e[i].clear(); for (int i = 1; i <= n; ++i) { scanf( %d%d , &m, &p); e[m].push_back(p); } priority_queue<int, vector<int>, greater<int> > que; long long ans = 0; for (int i = n; i >= 0; --i) { int len = e[i].size(); for (int j = 0; j < len; ++j) que.push(e[i][j]); while (que.size() > n - i) { ans += que.top(); que.pop(); } } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> v[200009]; set<int> ss; pair<int, int> help[200009]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int a, b; scanf( %d %d , &a, &b); v[a].push_back(b); } for (int i = 1; i <= n; i++) sort(v[i].begin(), v[i].end()); help[0] = pair<int, int>(0, 0); for (int i = 1; i <= n; i++) if (v[i].size() != 0) help[i] = pair<int, int>(v[i][v[i].size() - 1], i); else help[i] = pair<int, int>(0, 0); sort(help, help + n + 1); int q; cin >> q; for (int i = 0; i < q; i++) { ss.clear(); int k; cin >> k; for (int i = 0; i < k; i++) { int a; scanf( %d , &a); ss.insert(a); } int A, B; A = B = -1; for (int j = n; j >= 1; j--) { if (help[j].first == 0) break; if (A != -1 && B != -1) break; if (A == -1) { if (ss.find(help[j].second) == ss.end() && help[j].second != 0) A = help[j].second; } else { if (ss.find(help[j].second) == ss.end() && help[j].second != 0) B = help[j].second; } } if (B == -1 && A == -1) printf( 0 0 n ); else if (B == -1) printf( %d %d n , A, v[A][0]); else { int x = v[B][v[B].size() - 1]; int y = *lower_bound(v[A].begin(), v[A].end(), x); printf( %d %d n , A, y); } } return 0; } |
#include <bits/stdc++.h> using namespace std; char a[100010]; int c[100010]; const int mod = 1000000007; long long Pow(long long a, long long b, long long c) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % c; b >>= 1; a = a * a % c; } return ans; } int main() { scanf( %s , a); int n = strlen(a), k; int cnt0 = count(a, a + n, 0 ); int cnt5 = count(a, a + n, 5 ); int cnt = 0; for (int i = 0; i <= n - 1; i++) { if (a[i] == 0 || a[i] == 5 ) { c[cnt++] = i; } } scanf( %d , &k); long long tmp1 = Pow(2, (long long)n * k, mod); tmp1 -= 1; if (tmp1 < 0) tmp1 += mod; long long tmp2 = Pow(2, n, mod); tmp2 -= 1; if (tmp2 < mod) tmp2 += mod; tmp2 = Pow(tmp2, mod - 2, mod); long long ans = 0; for (int i = 0; i <= cnt - 1; i++) { ans += Pow(2, c[i], mod) * tmp1 % mod * tmp2 % mod; if (ans >= mod) ans -= mod; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, ans = 0, xs, ys, xe, ye; char q[105][105]; cin >> n >> m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> q[i][j]; if (q[i][j] == S ) { xs = i; ys = j; } if (q[i][j] == E ) { xe = i; ye = j; } } } string line; cin >> line; int x, y; for (int w = 0; w <= 3; ++w) { for (int l = 0; l <= 3; ++l) { for (int s = 0; s <= 3; ++s) { for (int r = 0; r <= 3; ++r) { if (w == l || w == s || w == r) { continue; } if (l == s || l == r) { continue; } if (s == r) { continue; } x = xs; y = ys; for (int i = 0; i < line.size(); ++i) { int p = line[i] - 0 ; if (p == w) { x++; if (x >= n) { break; } } if (p == l) { y--; if (y < 0) { break; } } if (p == s) { x--; if (x < 0) { break; } } if (p == r) { y++; if (y >= m) { break; } } if (x == xe && y == ye) { break; } if (q[x][y] == # ) { break; } } if (x == xe && y == ye) { ans++; } } } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double TOLL = 1e-9; int N, L, K; int a[210]; double p[210]; const int maxn = 400; double dp[201][401][maxn + 2]; double rec(int ind, int l, int cap) { if (cap < -202) cap = -200; if (cap > 202) cap = 200; if (ind == N) { if (l <= 0 && cap >= 0) return 1; return 0; } if (dp[ind][l + 200][cap + 200] > -.5) return dp[ind][l + 200][cap + 200]; double rv = p[ind] * rec(ind + 1, l - 1, cap + a[ind]) + (1 - p[ind]) * rec(ind + 1, l, cap); return dp[ind][l + 200][cap + 200] = rv; } int main() { while (cin >> N >> L >> K) { for (int i = 0; i < N; i++) { cin >> p[i]; p[i] /= 100; } for (int i = 0; i < N; i++) cin >> a[i]; memset(dp, -1, sizeof dp); printf( %.12lf n , rec(0, L, K)); } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) using namespace std; const int N = 2e5 + 100, sq = 1002, nsq = 200; int cnt[nsq][N], b[nsq][N / 2]; int a[N]; map<int, int> mp, nmp; vector<pair<int, pair<int, int> > > q; void add(int id, int val) { while (id < nsq) { cnt[id][val]++; b[id][cnt[id][val]]++; id++; } } void rem(int id, int val) { while (id < nsq) { b[id][cnt[id][val]]--; cnt[id][val]--; id++; } } int get1(int id) { int val = a[id]; int pid = id / sq; int ans = cnt[pid][val]; int x = pid * sq; for (int i = x; i <= id; i++) { if (a[i] == val) ans++; } return ans; } int get2(int id) { int val = a[id]; int pid = id / sq; int w = cnt[pid][val]; int x = pid * sq; for (int i = x; i <= id; i++) { if (a[i] == val) w++; } int ans = b[pid][w]; for (int i = x; i <= id; i++) { cnt[pid][a[i]]++; if (cnt[pid][a[i]] == w) ans++; } for (int i = x; i <= id; i++) { cnt[pid][a[i]]--; } return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; vector<int> mol; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; mol.push_back(a[i]); } int q1; cin >> q1; for (int i = 0; i < q1; i++) { int t, u, v; cin >> t >> u >> v; if (t == 1) mol.push_back(u); q.push_back({t, {u, v - 1}}); } sort(mol.begin(), mol.end()); mol.resize(unique(mol.begin(), mol.end()) - mol.begin()); for (int i = 0; i < mol.size(); i++) { mp[mol[i]] = i + 1; nmp[i + 1] = mol[i]; } for (int i = 0; i < n; i++) a[i] = mp[a[i]]; for (int i = 0; i < q1; i++) if (q[i].first == 1) q[i].second.first = mp[q[i].second.first]; int id = 0; while (id < n) { for (int i = 0; i < id; i++) { cnt[id / sq][a[i]]++; } for (int i = 0; i < N; i++) { b[id / sq][cnt[id / sq][i]]++; } for (int i = N - 1; i; i--) { b[id / sq][i] += b[id / sq][i + 1]; } id += sq; } for (int i = 0; i < q1; i++) { if (q[i].first == 1) { int v = q[i].second.first, p = q[i].second.second; int z = a[p]; add(p / sq + 1, v); rem(p / sq + 1, a[p]); a[p] = v; } else { int x = q[i].second.first, y = q[i].second.second; if (x == 1) cout << nmp[a[y]] << n ; else if (x % 2 == 0) { int ans = get1(y); cout << ans << n ; } else { int ans = get2(y); cout << ans << n ; } } } } |
#include <bits/stdc++.h> using namespace std; template <typename T> T getint() { T x = 0, p = 1; char ch; do { ch = getchar(); } while (ch <= ); if (ch == - ) p = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * p; } template <typename T1, typename T2> bool umin(T1 &x, const T2 &y) { if (x > y) return x = y, true; return false; } template <typename T1, typename T2> bool umax(T1 &x, const T2 &y) { if (x < y) return x = y, true; return false; } const int maxn = (int)6e5 + 10; const int inf = (int)1e9 + 5; const int mod = (int)1e9 + 7; const long long llinf = (long long)1e18 - 1; const long double pi = acos(-1.0); int nxt[maxn][26]; bool leaf[maxn]; int diff[maxn]; int c[maxn]; char s[maxn]; int n; vector<int> g[maxn]; int sz[maxn]; int root[maxn]; int T = 1; int calc(int v) { int ret = leaf[v]; for (int i = (0); i < (26); i++) if (nxt[v][i]) ret += calc(nxt[v][i]); return ret; } void addTrie(int globroot, int root, int v) { for (int c = (0); c < (26); c++) { if (nxt[v][c] == 0) continue; if (nxt[root][c] == 0) { diff[globroot] += calc(nxt[v][c]); nxt[root][c] = nxt[v][c]; continue; } diff[globroot] += leaf[nxt[v][c]] - leaf[nxt[root][c]]; leaf[nxt[root][c]] |= leaf[nxt[v][c]]; addTrie(globroot, nxt[root][c], nxt[v][c]); } } void dfs(int v, int par = -1) { sz[v] = 1; int chi = -1; for (int x : g[v]) { if (x == par) continue; dfs(x, v); sz[v] += sz[x]; if (chi == -1 || sz[x] > sz[chi]) { chi = x; } } int &rt = root[v]; rt = T++; int &link = nxt[rt][s[v] - a ]; if (chi != -1) { link = root[chi]; diff[rt] += diff[link]; for (int x : g[v]) { if (x == par || x == chi) continue; addTrie(rt, link, root[x]); } } else { link = T++; } leaf[link] = true; diff[rt]++; c[v] += diff[rt]; } int main() { scanf( %d , &n); for (int i = (0); i < (n); i++) scanf( %d , c + i); gets(s); gets(s); for (int i = (0); i < (n - 1); i++) { int x, y; scanf( %d%d , &x, &y); --x; --y; g[x].push_back(y), g[y].push_back(x); } dfs(0, -1); int mx = c[0] + diff[0], cnt = 1; for (int i = (1); i < (n); i++) { int val = c[i]; if (val > mx) mx = val, cnt = 0; if (val == mx) cnt++; } printf( %d n%d n , mx, cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rnd; const int N = 1e5 + 10; long long a[N], pref[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, d, m; cin >> n >> d >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { pref[i] = pref[i - 1] + a[i]; } int cnt = 0; for (int i = 1; i <= n; i++) { if (a[i] <= m) { cnt++; } } long long ans = 0; for (int k = 0; k <= n - cnt; k++) { if (1ll * k * d + k + cnt < n) { continue; } if (1ll * (k - 1) * d + k > n) { continue; } int x = min(cnt, n - (k - 1) * d - k); ans = max(ans, pref[cnt] - pref[cnt - x] + pref[n] - pref[n - k]); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<pair<long long, long long>> vp; long long p, a, l = 0, r = 0, ss = 0; for (int i = 0; i < n; i++) { cin >> p >> a; if (p < 0) { ++l; } else { ++r; } ss += a; vp.push_back(make_pair(p, a)); } if (l == r or l == r + 1 or r == l + 1) { cout << ss << n ; return; } sort(vp.begin(), vp.end()); if (l == 0) { cout << vp[0].second << n ; return; } else if (r == 0) { cout << vp[n - 1].second << n ; return; } long long ans = 0; if (l < r) { for (int i = 0; i <= 2 * l; i++) { ans += vp[i].second; } } else { for (int i = l - r - 1; i < n; i++) { ans += vp[i].second; } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; int t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; double work(int x) { if (x == 0) return 1; double n = 1.000000011; double ans = 1; while (x > 0) { if ((x & 1) == 1) ans *= n; n *= n; x /= 2; } return ans; } int main() { int n, t; cin >> n >> t; printf( %0.20lf n , work(t) * n); return 0; } |
//Template Made By: Ojassvi Kumar #include<bits/stdc++.h> using namespace std; #define ios ios_base::sync_with_stdio(false);cin.tie(NULL); #define ll long long int #define fo(i,a,b) for(long long int i=a; i<b; i++) #define endl n #define max3(a,b,c) max(max((a),(b)),(c)) #define max4(a,b,c,d) max(max((a),(b)),max((c),(d))) #define min3(a,b,c) min(min((a),(b)),(c)) #define min4(a,b,c,d) min(min((a),(b)),min((c),(d))) #define pb push_back #define lb lower_bound #define up upper_bound #define all(V) V.begin(),V.end() #define itv vector<long long int>::iterator #define pll pair<long long int,long long int> #define mp make_pair #define itp vector<pair<long long int,long long int>>::iterator #define sll set<long long int,greater<long long int>> #define its set<long long int,greater<long long int>>::iterator #define d0(x) cout<<(x)<< #define d1(x) cout<<(x)<<endl #define d2(x,y) cout<<(x)<< <<(y)<<endl //const long double pi = 3.14159265358979323846264338; //Template Ends int main(){ ios #ifndef ONLINE_JUDGE freopen( INPUT.txt , r , stdin); freopen( OUTPUT.txt , w , stdout); #endif ll Tests=1; cin>>Tests; while(Tests--){ ll N,L,R,S; cin>>N>>L>>R>>S; ll num=R-L+1; ll Hsum=0,Lsum=0; fo(i,0,num){ Hsum+=(N-i); Lsum+=(i+1); } if(S>Hsum||S<Lsum){ cout<<-1<<endl; } else{ vector<ll> V(num); fo(i,0,V.size()) V[i]=i+1; ll curS=Lsum; ll j=num-1; ll ceill=N; while(1){ if(curS==S){ break; } else{ V[j]++; curS++; if(V[j]==ceill){ j--; ceill--; } } } set<ll> ST; fo(i,0,num) ST.insert(V[i]); vector<ll> VV; fo(i,0,N){ if(!ST.count(i+1)){ VV.pb(i+1); } } ll jj=0,jjj=0; fo(i,0,N){ if(i>=(L-1)&&i<=(R-1)){ cout<<V[jj]<< ; jj++; } else{ cout<<VV[jjj]<< ; jjj++; } } cout<<endl; } } } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } double PI = 3.1415926536; const int inf = 1e9 + 7; long long MAX(long long a, long long b) { return a > b ? a : b; } long long MIN(long long a, long long b) { return a > b ? b : a; } inline bool ispalindrome(string s) { int n = s.length(), i = 0, j = n - 1; while (i <= j) { if (s[i] != s[j]) return false; i++, j--; } return true; } inline bool isprime(long long n) { if (n % 2 == 0) return false; for (int i = 3; i * i <= n; i += 2) if (n % i == 0) return false; return true; } void solve() { int n, k; cin >> n >> k; queue<int> q; set<int> vals; for (int i = 0; i < n; ++i) { int id; cin >> id; if (!vals.count(id)) { if (int(q.size()) >= k) { int cur = q.front(); q.pop(); vals.erase(cur); } vals.insert(id); q.push(id); } } vector<int> res; while (!q.empty()) { res.push_back(q.front()); q.pop(); } reverse(res.begin(), res.end()); cout << res.size() << n ; for (auto it : res) cout << it << ; cout << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); int t = 1; for (int i = 1; i <= t; i++) { solve(); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; string a[2 * n], b[2 * m]; for (int i = 0; i < 2 * n; i += 2) { cin >> a[i] >> a[i + 1]; } for (int i = 0; i < 2 * m; i += 2) { cin >> b[i] >> b[i + 1]; } for (int i = 1; i < 2 * m; i += 2) { for (int j = 1; j < 2 * n; j += 2) { string x = b[i]; if ((x.erase(x.size() - 1)).compare(a[j]) == 0) { cout << b[i - 1] << << b[i] << # << a[j - 1]; } } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; double n; cin >> t; while (t--) { cin >> n; if (n * n - 4 * n < 0) { cout << N << endl; continue; } if (n == 0) { double x = 0, y = 0; cout << Y << fixed << setprecision(9) << x << << y << endl; continue; } double x = n + sqrt(n * n - 4 * n); x /= 2; double y = x / (x - 1); cout << Y << fixed << setprecision(9) << x << << y << endl; } return 0; } |
#include <bits/stdc++.h> struct three_t { int x, y, z; inline three_t(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {} }; std::vector<int> next[100010]; std::vector<three_t> to[100010]; int n, q, t[100010], v[100010], spc[100010], clr[100010], tag[100010], col[100010], tmp[100010]; void build(int x, int p, int count, int delta) { if (spc[x]) { if (p) to[p].emplace_back(x, count, delta); count = delta = 0; p = x; } else { count += !col[x]; delta += 1; } for (auto &y : next[x]) build(y, p, count, delta); } void setBlack(int x) { if (!col[x]) return void(col[x] = 1); tag[x]++; for (auto &y : to[x]) { if (y.y < tag[x]) { setBlack(y.x); } } } void setWhite(int x) { clr[x] = 1; col[x] = 0; tag[x] = 0; for (auto &y : to[x]) { y.y = y.z; setWhite(y.x); } } void restore(int x, int setWhite, int setBlack) { if (spc[x]) { setWhite |= clr[x]; setBlack = tag[x]; } else { col[x] = tmp[x] && !setWhite; if (setBlack && !col[x]) col[x] = 1, --setBlack; } for (auto &y : next[x]) restore(y, setWhite, setBlack); } int main() { std::ios::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0); std::cin >> n >> q; for (int i = 2, x; i <= n; i++) std::cin >> x, next[x].push_back(i); for (int i = 1; i <= q; i++) std::cin >> t[i] >> v[i]; for (int i = 1; i <= q; i += 480) { memset(spc, 0, sizeof(spc)); memset(clr, 0, sizeof(clr)); memset(tag, 0, sizeof(tag)); memcpy(tmp, col, sizeof(tmp)); for (int i = 1; i <= n; i++) to[i].clear(); for (int j = 0; j < 480 && i + j <= q; j++) spc[v[i + j]] = 1; build(1, 0, 0, 0); for (int j = 0; j < 480 && i + j <= q; j++) { if (t[i + j] == 1) { setBlack(v[i + j]); } else if (t[i + j] == 2) { setWhite(v[i + j]); } else { std::cout << (col[v[i + j]] ? black : white ) << std::endl; } } restore(1, 0, 0); } return 0; } |
#include <bits/stdc++.h> using namespace std; void bktk(int i, char *s, int val, int &ans, vector<int> &cnt) { if (!s[i]) { ans += cnt[val]; return; } val *= 3; if (s[i] == A ) { bktk(i + 1, s, val, ans, cnt); bktk(i + 1, s, val + 1, ans, cnt); } if (s[i] == a ) { bktk(i + 1, s, val + 2, ans, cnt); } if (s[i] == O ) { bktk(i + 1, s, val, ans, cnt); } if (s[i] == o ) { bktk(i + 1, s, val + 1, ans, cnt); bktk(i + 1, s, val + 2, ans, cnt); } if (s[i] == X ) { bktk(i + 1, s, val, ans, cnt); bktk(i + 1, s, val + 2, ans, cnt); } if (s[i] == x ) { bktk(i + 1, s, val + 1, ans, cnt); } } int main() { int w, n, m; scanf( %d %d %d , &w, &n, &m); vector<int> f(1 << w, 0); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); f[x]++; } vector<int> b3(1 << w, 0); for (int i = 0; i < (1 << w); i++) { for (int k = w - 1; k >= 0; k--) { b3[i] = b3[i] * 3 + ((i >> k) & 1); } } vector<int> cnt(531441, 0); for (int i = 0; i < (1 << w); i++) { for (int j = 0; j < (1 << w); j++) { cnt[b3[i] + b3[j]] += f[i] * f[j]; } } while (m--) { char s[14]; scanf( %s , s); int ans = 0; bktk(0, s, 0, ans, cnt); printf( %d n , ans); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, w, x, sum = 0, mmax = 0, us = 0; cin >> n >> w; for (int i = 1; i <= n; ++i) { scanf( %d , &x); sum += x; us = min(us, sum); mmax = max(mmax, sum); } if (us < 0) us = -us; else us = 0; printf( %d n , max(w - mmax - us + 1, 0)); return 0; } |
#include <bits/stdc++.h> int MOD = 1000000007; long long inf = 1e18; using namespace std; vector<int> A, B, C; int as, bs, cs; int a, b, c; int k, n1, n2, n3, t1, t2, t3; bool ok(int t) { if (a == n1) return false; int cntb = 0; for (int i = bs; i < B.size(); i++) { if (t + t1 < B[i] + t2) { cntb++; } } for (int i = as; i < A.size(); i++) { if (t + t1 < A[i] + t1 + t2) { cntb++; } } if (cntb >= n2) return false; int cntc = 0; for (int i = cs; i < C.size(); i++) { if (t + t1 + t2 < C[i] + t3) { cntc++; } } for (int i = bs; i < B.size(); i++) { if (t + t1 + t2 < B[i] + t2 + t3) { cntc++; } } for (int i = as; i < A.size(); i++) { if (t + t1 + t2 < A[i] + t1 + t2 + t3) { cntc++; } } if (cntc >= n3) return false; return true; } int main() { ios::sync_with_stdio(0); cin >> k >> n1 >> n2 >> n3 >> t1 >> t2 >> t3; int t, x; bool cont; for (t = 1; t <= 30000001; t++) { if (k == 0 && c == 0 && b == 0 && a == 0) { break; } cont = true; while (c != 0 && cont) { x = C[cs]; cont = false; if (x + t3 == t) { cs++; c--; cont = true; } } cont = true; while (b != 0 && cont) { x = B[bs]; cont = false; if (x + t2 == t) { bs++; b--; cont = true; C.push_back(t); c++; } } cont = true; while (a != 0 && cont) { x = A[as]; cont = false; if (x + t1 == t) { as++; a--; cont = true; B.push_back(t); b++; } } cont = true; while (k != 0 && cont) { x = t; cont = false; if (ok(t)) { A.push_back(x); a++; cont = true; k--; } } } cout << t - 2; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = (int)5e5 + 5; int n; struct node { int x, y; } a[MAXN]; struct BIT { long long sum[MAXN]; int n; void init(int _n) { n = _n; memset(sum, 0, sizeof(sum)); ; } int lowbit(int x) { return x & -x; } void update(int x, long long num) { while (x <= n) { sum[x] += num; x += lowbit(x); } return; } long long query(int x) { long long ans = 0; while (x) { ans += sum[x]; x -= lowbit(x); } return ans; } } bita; vector<int> v; int getid(int x) { return lower_bound(v.begin(), v.end(), x) - v.begin() + 1; } map<int, int> mpx; int main() { while (~scanf( %d , &n)) { for (int i = 1; i <= n; i++) scanf( %d%d , &a[i].x, &a[i].y), v.push_back(a[i].x), v.push_back(a[i].y); sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end()); for (int i = 1; i <= n; i++) { a[i].x = getid(a[i].x); a[i].y = getid(a[i].y); } sort(a + 1, a + 1 + n, [](node a, node b) { if (a.y != b.y) return a.y > b.y; return a.x < b.x; }); mpx.clear(); bita.init(MAXN); long long ans = 0; for (int i = 1; i <= n; i++) { int xx = a[i].x, yy = a[i].y, pre = 0; int now = i; while (a[now].y == a[i].y && now <= n) { if (!mpx[a[now].x]) { mpx[a[now].x] = 1; bita.update(a[now].x, 1ll); } now++; } now--; for (int j = i; j <= now; j++) { long long l = bita.query(a[j].x - 1) - bita.query(pre); long long r = bita.query(2 * n + 1) - bita.query(a[j].x); pre = a[j].x; ans += (long long)l * r + l + r + 1; } i = now; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; scanf( %d%d , &a, &b); if (b > a) { printf( -1 n ); } else if (a == b) { printf( %d.000000000 n , a); } else { int k((a - b) / b); if (k & 1) { k--; } double ans1(1. * (a - b) / k); k = (a + b) / b; if (k & 1) { k--; } double ans2(1. * (a + b) / k); printf( %.9f n , min(ans1, ans2)); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, m, k, i, j, a[200002], sum = 0; vector<long long int> v; set<pair<long long int, long long int>> s; cin >> n >> m >> k; for (i = 0; i < n; i++) { cin >> a[i]; s.insert(make_pair(a[i], i)); } set<pair<long long int, long long int>>::iterator it1, it2; it1 = s.begin(); it2 = s.end(); for (i = 0; i < m * k; i++) { it2--; } s.erase(it1, it2); for (i = 0; i < n; i++) { if (s.find(make_pair(a[i], i)) != s.end()) { sum += a[i]; } } long long int cnt = 0; for (i = 0; i < n; i++) { auto it = s.find(make_pair(a[i], i)); if (cnt == m * (k - 1)) { break; } if (it != s.end()) { cnt++; if (cnt % m == 0) { v.push_back(it->second + 1); } } } long long int sz = v.size(); cout << sum << endl; for (i = 0; i < sz; i++) { cout << v[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; char zf = 1; char ch = getchar(); while (ch != - && !isdigit(ch)) ch = getchar(); if (ch == - ) zf = -1, ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * zf; } void write(long long y) { if (y < 0) putchar( - ), y = -y; if (y > 9) write(y / 10); putchar(y % 10 + 48); } void writeln(const long long y) { write(y); putchar( n ); } int i, j, k, m, n, x, y, z, cnt, dx[10010], dy[10010]; struct now { int t, x, y, p; } q[1000010]; int h, t; long long dis[105][12][12][3]; bool vis[105][12][12][3]; void push(now x, long long ds) { if (x.x == dx[x.t] && x.y == dy[x.t]) x.t++; if (ds >= dis[x.t][x.x][x.y][x.p]) return; dis[x.t][x.x][x.y][x.p] = ds; if (!vis[x.t][x.x][x.y][x.p]) q[++t] = {x.t, x.x, x.y, x.p}, vis[x.t][x.x][x.y][x.p] = 1; } int main() { n = read(); for (register int i = 1; i <= n; i++) for (register int j = 1; j <= n; j++) { x = read(); dx[x] = i; dy[x] = j; } memset(dis, 10, sizeof(dis)); long long ans = 1000000000000ll; for (register int i = 0; i <= 2; i++) dis[2][dx[1]][dy[1]][i] = 0, vis[2][dx[1]][dy[1]][i] = 1; t = 3; q[1] = {2, dx[1], dy[1], 0}; q[2] = {2, dx[1], dy[1], 1}; q[3] = {2, dx[1], dy[1], 2}; while (h < t) { now u = q[++h]; vis[u.t][u.x][u.y][u.p] = 0; long long ds = dis[u.t][u.x][u.y][u.p]; if (u.t > n * n) { ans = min(ans, ds); continue; } long long b1 = ds + 1000000; if (u.p == 0) { for (register int i = 1; i <= n; i++) { push({u.t, i, u.y, u.p}, b1); push({u.t, u.x, i, u.p}, b1); } } if (u.p == 1) { for (register int i = -2; i <= 2; i++) for (register int j = -2; j <= 2; j++) if (i * j == 2 || i * j == -2) { int xx = u.x + i, yy = u.y + j; if (xx < 1 || xx > n || yy < 1 || yy > n) continue; push({u.t, xx, yy, u.p}, b1); } } if (u.p == 2) { for (register int i = -n; i <= n; i++) for (register int j = -1; j <= 1; j += 2) { int xx = u.x + i, yy = u.y + i * j; if (xx < 1 || xx > n || yy < 1 || yy > n) continue; push({u.t, xx, yy, u.p}, b1); } } for (register int i = 0; i <= 2; i++) push({u.t, u.x, u.y, i}, b1 + 1); } cout << ans / 1000000 << << ans % 1000000; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x0, y0, x, y; cin >> x0 >> y0 >> x >> y; if (x0 != x && y != y0 && abs(x - x0) != abs(y - y0)) { cout << -1 << endl; return 0; } int dx = abs(y - y0); int dy = abs(x0 - x); if (x0 == x) cout << x0 + dx << << y0 << << x + dx << << y << endl; else if (y0 == y) cout << x0 << << y0 + dy << << x << << y + dy << endl; else cout << x0 << << y << << x << << y0 << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.