func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int x[55], y[55]; int main(int argc, char** argv) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &x[i]); for (int i = 1; i <= n; i++) scanf( %d , &y[i]); int sum = 0; for (int i = 1; i <= n; i++) { sum += x[i] - y[i]; } if (sum >= 0) cout << Yes ; else cout << No ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void read(T &x) { T res = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { res = (res << 3) + (res << 1) + c - 0 ; c = getchar(); } x = res * f; } const long long N = 200000 + 10; long long w, a[N], n, mn = 1e13, mx = -1e13, sum; int main() { read(n), read(w); for (int i = 1; i <= n; i++) { read(a[i]); sum += a[i]; mn = min(mn, sum); mx = max(mx, sum); } if (abs(mx) > w || abs(mn) > w) { printf( 0 ); return 0; } long long l = 0, r = w; if (mn < 0) { l = 0 - mn; } if (mx > 0) { r = w - mx; } long long ans = r - l + 1; if (ans > 0) printf( %lld , r - l + 1); else printf( 0 ); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long getint() { long long _x = 0, _tmp = 1; char _tc = getchar(); while ((_tc < 0 || _tc > 9 ) && _tc != - ) _tc = getchar(); if (_tc == - ) _tc = getchar(), _tmp = -1; while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); return _x * _tmp; } inline long long add(long long _x, long long _y, long long _mod = 1000000007ll) { long long _ = _x + _y; if (_ >= _mod) _ -= _mod; return _; } inline long long sub(long long _x, long long _y, long long _mod = 1000000007ll) { long long _ = _x - _y; if (_ < 0) _ += _mod; return _; } inline long long mul(long long _x, long long _y, long long _mod = 1000000007ll) { long long _ = _x * _y; if (_ >= _mod) _ %= _mod; return _; } long long mypow(long long _a, long long _x, long long _mod) { if (_x == 0) return 1ll; long long _tmp = mypow(_a, _x / 2, _mod); _tmp = mul(_tmp, _tmp, _mod); if (_x & 1) _tmp = mul(_tmp, _a, _mod); return _tmp; } long long mymul(long long _a, long long _x, long long _mod) { if (_x == 0) return 0ll; long long _tmp = mymul(_a, _x / 2, _mod); _tmp = add(_tmp, _tmp, _mod); if (_x & 1) _tmp = add(_tmp, _a, _mod); return _tmp; } inline bool equal(double _x, double _y) { return _x > _y - 1e-9 && _x < _y + 1e-9; } int __ = 1, _cs; void build() {} long long n, m, a, b; void init() { n = getint(); m = getint(); a = getint() - 1; b = getint() - 1; } void solve() { long long ai = a / m, aj = a % m; long long bi = b / m, bj = b % m; if (ai == bi || (a == 0 && b == n - 1) || m == 1) { puts( 1 ); exit(0); } if (aj == 0 && (bj == m - 1 || b == n - 1)) { puts( 1 ); exit(0); } if (aj == 0 || bj == m - 1 || bi == ai + 1 || bj + 1 == aj || b == n - 1) { puts( 2 ); exit(0); } puts( 3 ); } int main() { build(); while (__--) { init(); solve(); } } |
#include <bits/stdc++.h> using namespace std; template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } template <class T> ostream &operator<<(ostream &os, vector<T> V) { os << [ ; for (auto vv : V) os << vv << , ; return os << ] ; } template <class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << = << h << n ; } template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != , ) cerr << *sdbg++; cerr << = << h << , ; _dbg(sdbg + 1, a...); } const long long N = 4e5 + 7; long long n, a[N], pre[N], ansLen, ansIdx; double ans = -1.0; double sum(long long l, long long r) { return pre[r] - (l > 0 ? pre[l - 1] : 0); } double f(long long len, long long idx) { double ret = pre[idx] - pre[idx - len - 1]; ret += pre[n] - pre[n - len]; ret /= len + len + 1; ret -= a[idx]; if (ret > ans) { ans = ret; ansIdx = idx; ansLen = len; } return ret; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n; for (long long i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); for (long long i = 1; i <= n; i++) pre[i] = a[i] + pre[i - 1]; for (long long i = 1; i <= n; i++) { long long cnt = min(i - 1, n - i); long long lo = 0, hi = cnt; while (hi - lo > 3) { long long m1 = lo + (hi - lo) / 3, m2 = hi - (hi - lo) / 3; if (f(m1, i) < f(m2, i)) lo = m1; else hi = m2; } for (long long k = lo; k <= hi; k++) f(k, i); } cout << 2 * ansLen + 1 << n ; for (long long i = ansIdx; i >= ansIdx - ansLen; i--) cout << a[i] << ; for (long long i = n - ansLen + 1; i <= n; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, n, a, j, b, m, s = 0, t = 0; int x[105] = {0}; cin >> n >> m; for (i = 1; i <= m; ++i) { cin >> a; for (j = a; j <= n; ++j) { if (x[j] != 0) break; x[j] = a; } } for (i = 1; i <= n; ++i) cout << x[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 100; const int MAXM = 15; int N, Q, M; int log2(int v) { int r = 1; while (v >>= 1) r++; return r; } int a[MAXN]; int t[2][MAXN]; struct ST { int v[3 * MAXN][2][MAXM]; int l[3 * MAXN], r[3 * MAXN]; bool lz[3 * MAXN]; int NXT; int sz; void updv(const int& n) { assert(n != -1 and l[n] != -1 and r[n] != -1); for (int i = 0; i <= M; i++) for (int j = 0; j < 2; j++) v[n][j][i] = v[l[n]][j][v[r[n]][j][i]]; } void init(int n, int nl, int nr) { assert(n != -1 and nl < nr); lz[n] = false; l[n] = r[n] = -1; if (nr - nl == 1) { for (int i = 0; i < M; i++) for (int j = 0; j < 2; j++) v[n][j][i] = i + 1; v[n][a[nl]][M] = M, v[n][!a[nl]][M] = 0; } if (nr - nl > 1) { int m = nl + ((nr - nl) >> 1); init(l[n] = NXT++, nl, m); init(r[n] = NXT++, m, nr); updv(n); } } ST() {} ST(const int& s, bool ini) { sz = s; NXT = 0; if (ini) init(NXT++, 0, sz); } void prop(int n, int nl, int nr) { if (!lz[n]) return; for (int i = 0; i <= M; i++) swap(v[n][0][i], v[n][1][i]); if (nr - nl > 1) { lz[l[n]] = !lz[l[n]]; lz[r[n]] = !lz[r[n]]; } lz[n] = false; } void upd(int n, int nl, int nr, int gl, int gr) { if (gl <= nl and gr >= nr) { lz[n] = !lz[n]; prop(n, nl, nr); return; } if (nr - nl > 1) { prop(n, nl, nr); int m = nl + ((nr - nl) >> 1); if (gl < m) upd(l[n], nl, m, gl, gr); else prop(l[n], nl, m); if (gr > m) upd(r[n], m, nr, gl, gr); else prop(r[n], m, nr); updv(n); return; } assert(false); } void upd(int gl, int gr) { upd(0, 0, sz, gl, gr); } int qry(int n, int nl, int nr, int gl, int gr, int c = M) { prop(n, nl, nr); if (gl <= nl and gr >= nr) { return v[n][0][c]; } if (nr - nl > 1) { int m = nl + ((nr - nl) >> 1); if (gr > m) c = qry(r[n], m, nr, gl, gr, c); if (gl < m) c = qry(l[n], nl, m, gl, gr, c); return c; } assert(false); return -1; } int qry(int gl, int gr) { return qry(0, 0, sz, gl, gr); } } st; void q1() { int l, r, v; scanf( %d%d%d , &l, &r, &v); if (v & 1) st.upd(--l, r); } void q2() { int l, r; scanf( %d%d , &l, &r); printf( %d n , (st.qry(--l, r) == 0 ? 2 : 1)); } int main() { scanf( %d%d%d , &N, &M, &Q); for (int i = 0, v; i < N; i++) { scanf( %d , &v); a[i] = v & 1; } st = *(new ST(N, true)); for (int i = 0, type; i < Q; i++) { scanf( %d , &type); if (type == 1) q1(); else if (type == 2) q2(); } return 0; } |
#include <bits/stdc++.h> const int N = (int)2e5 + 5; const int MOD = (int)1e9 + 7; const bool MULTI_TEST = true; const double PI = acos(-1.0); using namespace std; void solve() { int n; cin >> n; int a[n]; int max = 0, index = -1; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > max) { max = a[i]; } } if (*min_element(a, a + n) == max) cout << -1 n ; else { for (int i = 0; i < n - 1; i++) { if (a[i] == max && a[i] > a[i + 1]) index = i + 1; } if (index != -1) { cout << index << n ; return; } else { for (int i = 1; i < n; i++) { if (a[i] == max && a[i] > a[i - 1]) index = i + 1; } } cout << index << endl; } } int main() { ios_base::sync_with_stdio(false); int t = 1; if (MULTI_TEST) cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100500], c[300], dp[100500][305], z, cnt, tmp, e, s, l, r, n, m, x, y, k, j, p, k1, k2, i, cur, rez; vector<long long> f[100500]; long long Abs(long long x) { if (x < 0) return -x; return x; } int main() { cin >> n >> m >> s >> e; for (i = 0; i < n; i++) cin >> a[i]; for (j = 0; j < m; j++) { cin >> x; f[x].push_back(j); } for (i = 0; i <= n; i++) for (j = 0; j <= s / e; j++) dp[i][j] = m + 1; dp[0][0] = -1; for (i = 0; i < n; i++) { for (j = 0; j <= s / e; j++) if (dp[i][j] != m + 1) { long long tmp = upper_bound(f[a[i]].begin(), f[a[i]].end(), dp[i][j]) - f[a[i]].begin(); if (tmp != f[a[i]].size()) dp[i + 1][j + 1] = min(dp[i + 1][j + 1], f[a[i]][tmp]); dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]); } } rez = 0; for (i = 0; i <= n; i++) { for (j = 0; j <= s / e; j++) { if (i + dp[i][j] + 1 + j * e <= s && dp[i][j] != m + 1) rez = max(rez, j); } } cout << rez << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct data { float x, a; } h[1005]; bool cmp(data a, data b) { return a.x < b.x; }; int main() { int n, ans = 2; float t, d; cin >> n >> t; for (int i = 1; i <= n; i++) cin >> h[i].x >> h[i].a; sort(h + 1, h + n + 1, cmp); for (int i = 1; i < n; i++) { d = h[i + 1].x - h[i].x - h[i].a / 2 - h[i + 1].a / 2; if (d > t) ans += 2; if (abs(d - t) < 1e-6) ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; int ans = 0; if (n % 2 == 0) { ans = 3 * (n / 2); } else { ans = 3 * (n / 2) + 1; } cout << ans << endl; for (int i = 1; i <= n; i++) { if (!(i % 2)) cout << i << ; } for (int i = 1; i <= n; i++) { if (i % 2) cout << i << ; } for (int i = 1; i <= n; i++) { if (!(i % 2)) cout << i << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>; const int N = 5e5 + 5; int n; long long a[N], x; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = (0); i < ((n + 1) / 2); i++) cin >> a[i]; cin >> x; long long sum = 0, mn = n / 2 + 1, mx = n; vector<pair<long long, long long>> ve; for (int i = (n + 1) / 2 - 1; i >= 0; i--) { sum += a[i]; if (x > 0) { if (sum <= 0) { mn = max(mn, min((long long)n - i + 1, (-sum + x) / x + (n + 1) / 2 - i)); } } else if (x < 0) { if (sum > 0) { long long val = (sum - x - 1) / -x - 1 + (n + 1) / 2 - i; if (n - i + 1 > val) { ve.emplace_back(val + 1, n - i); } } else { mn = max(mn, (long long)n - i + 1); } } else if (sum <= 0) { mn = max(mn, (long long)n - i + 1); } } reverse((ve).begin(), (ve).end()); for (auto &p : ve) { if (p.first <= mx && mx <= p.second) { mx = p.first - 1; } } if (mn <= mx) { cout << mx << n ; } else { cout << -1 n ; } } |
#include <bits/stdc++.h> const long long Inf = 1e18; const long double eps = 1e-7; long long LINF = (long long)2e18; using namespace std; long long mod = 1e9 + 7; long long mod5 = 1e9 + 9; long long mod3 = 998244353; long long mod4 = 1000003; long long mod2 = 1e9 + 123; const int MAXN = 10100000; const int INF = 1000000000; vector<vector<int> > a; int n, m; vector<pair<int, int> > mx; int rec(int pos, vector<int> mxs) { if (pos == m) { int ss = 0; for (long long(i) = 0; (i) < n; (i)++) { ss += mxs[i]; } return ss; } int cur = 0; int ss = 0; for (long long(i) = 0; (i) < n; (i)++) { cur += mxs[i]; ss += mxs[i]; } int ans = cur; for (long long(i) = 0; (i) < n; (i)++) { cur = ss; vector<int> lol = mxs; for (long long(j) = 0; (j) < n; (j)++) { if (a[(i + j) % n][mx[pos].second] > mxs[j]) { cur += a[(i + j) % n][mx[pos].second] - mxs[j]; lol[j] = a[(i + j) % n][mx[pos].second]; } } ans = max(ans, rec(pos + 1, lol)); } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.precision(20); int tt; cin >> tt; while (tt--) { cin >> n >> m; a.clear(); a.resize(n, vector<int>(m)); for (long long(i) = 0; (i) < n; (i)++) { for (long long(j) = 0; (j) < m; (j)++) { cin >> a[i][j]; } } mx.clear(); for (long long(i) = 0; (i) < m; (i)++) { int cur = -1; for (long long(j) = 0; (j) < n; (j)++) { cur = max(cur, a[j][i]); } mx.push_back({cur, i}); } sort((mx).rbegin(), (mx).rend()); mx.resize(min(4, m)); m = min(m, 4); vector<int> kek(n, 0); cout << rec(0, kek) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long M = 1000000007; int main() { int n, x, y; cin >> n >> x >> y; string s; cin >> s; int ans = 0; for (int i = 0; i < x; i++) { int pos = n - i - 1; char current = 0 ; if (i == y) { current = 1 ; } if (current != s[pos]) { ans++; } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, OO = 0x3f3f3f3f; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; int tc, n, m; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; cin >> tc; while (tc--) { cin >> n >> m; cin >> s; vector<long long> freq(n + 1, 0); vector<int> indx(m); for (int i = 0; i < int(m); i++) { cin >> indx[i]; freq[0]++; freq[indx[i]]--; } freq[0]++; for (int i = int(1); i <= int(n - 1); i++) freq[i] += freq[i - 1]; vector<long long> karakter(26, 0); for (int i = 0; i < int(n); i++) karakter[s[i] - a ] += freq[i]; for (int i = 0; i < int(26); i++) cout << karakter[i] << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N]; int sum[11]; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); sum[a[i]]++; } while (1) { int i, aa[11]; memset(aa, 0, sizeof(aa)); for (i = 1; i < 11; ++i) aa[i] = sum[i]; sort(aa, aa + 11); for (i = 0; i < 11; ++i) if (aa[i]) break; if (aa[10] - aa[i] > 1) { if (aa[i] == 1) { if (aa[i + 1] == aa[10]) { cout << n; break; } } } else if (aa[i] == aa[10]) { if (aa[i] == 1 || i == 10) { cout << n; break; } } else { if (aa[i] == 1) { if (aa[i + 1] == aa[10]) { cout << n; break; } } if (aa[i] == aa[9]) { cout << n; break; } } sum[a[n]]--; n--; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } long long a, b, c, type, ric[300007], par[300007], cost[300007], d[300007], n, m, lvl[300007], P[300007][20 * 2]; vector<pair<long long, long long> > E[300007]; pair<pair<long long, long long>, long long> way[300007]; long long atabul(long long x) { if (ric[x] == x) return x; return ric[x] = atabul(ric[x]); } void dfs(long long x, long long y, long long z) { lvl[x] = lvl[y] + 1; P[x][0] = y; cost[x] = z; if (z == 1) { ric[x] = y; atabul(x); } for (int i = 0; i < int(E[x].size()); i++) if (E[x][i].first != y) dfs(E[x][i].first, x, E[x][i].second); } void build_table() { for (int j = 1; j <= 20; j++) for (int i = 1; i <= n; i++) if (P[i][j - 1] > 0) P[i][j] = P[P[i][j - 1]][j - 1]; } void form_LCA() { for (int i = 0; i <= n; i++) for (int j = 0; j <= 20; j++) P[i][j] = -1; dfs(1, 0, 0); build_table(); } long long LCA(long long x, long long y) { if (lvl[x] < lvl[y]) swap(x, y); for (int i = 20; i >= 0; i--) if (lvl[x] - (1 << i) >= lvl[y]) x = P[x][i]; if (x == y) return x; for (int i = 20; i >= 0; i--) if (P[x][i] > 0 && P[x][i] != P[y][i]) x = P[x][i], y = P[y][i]; return P[x][0]; } int main() { scanf( %lld%lld , &n, &m); ric[n] = n; for (int i = 1; i < n; i++) { scanf( %lld%lld%lld , &a, &b, &c); E[a].push_back(make_pair(b, c)); E[b].push_back(make_pair(a, c)); ric[i] = i; way[i] = {{a, b}, c}; } form_LCA(); while (m--) { scanf( %lld , &type); if (type == 1) { scanf( %lld%lld%lld , &a, &b, &c); long long tr = LCA(a, b); while (atabul(a) != atabul(tr) && c > 0) { if (cost[a] == 1) { a = atabul(a); continue; } c /= cost[a]; a = P[a][0]; } while (atabul(b) != atabul(tr) && c > 0) { if (cost[b] == 1) { b = atabul(b); continue; } c /= cost[b]; b = P[b][0]; } printf( %lld n , c); } else { scanf( %lld%lld , &a, &b); long long qm = way[a].first.first, gr = way[a].first.second; if (lvl[qm] < lvl[gr]) swap(qm, gr); cost[qm] = b; if (b == 1) { ric[qm] = gr; atabul(qm); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline string get() { char ch[1000010]; scanf( %s , ch); return ch; } const int MAX_LG = 60; const long long maxn = 1e6 + 100; const long long base = 29; const long long mod = 1e9 + 7; const long long INF = 1e18 + 100; struct state { long long a = 0, b = 0, tp = 0; state() {} state(long long a, long long b, long long tp) : a(a), b(b), tp(tp) {} }; long long cnt[maxn]; long long di[51][51][2]; long long C[51][51]; long long ways[51][51][2]; queue<state> q; int32_t main() { long long n = in(), k = in(); for (long long i = 0; i < n; i++) cnt[in() / 51]++; q.push({cnt[0], cnt[1], 0}); for (long long i = 0; i <= 50; i++) for (long long j = 0; j <= 50; j++) di[i][j][0] = di[i][j][1] = INF; for (long long i = 0; i <= 50; i++) { for (long long j = 0; j <= i; j++) { if (j == 0) C[i][j] = 1; else C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; } } di[cnt[0]][cnt[1]][0] = 0; ways[cnt[0]][cnt[1]][0] = 1; while (q.empty() == false) { state now = q.front(); q.pop(); long long a2 = cnt[0] - now.a; long long b2 = cnt[1] - now.b; for (long long i = 0; i <= now.a; i++) { for (long long j = 0; j <= now.b; j++) { if (i + j == 0) continue; if (i * 50 + j * 100 > k) continue; long long d2 = di[now.a][now.b][now.tp] + 1; long long *d3 = &di[a2 + i][b2 + j][now.tp ^ 1]; if (*d3 == INF) { *d3 = d2; q.push({a2 + i, b2 + j, now.tp ^ 1}); } if (*d3 == d2) { ways[a2 + i][b2 + j][now.tp ^ 1] += ways[now.a][now.b][now.tp] * C[now.a][i] % mod * C[now.b][j] % mod; if (ways[a2 + i][b2 + j][now.tp ^ 1] > mod) ways[a2 + i][b2 + j][now.tp ^ 1] -= mod; } } } } if (ways[cnt[0]][cnt[1]][1] == 0) return cout << -1 << n << 0 << n , 0; else { cout << di[cnt[0]][cnt[1]][1] << n ; cout << ways[cnt[0]][cnt[1]][1] << n ; } } |
#include <bits/stdc++.h> using namespace std; long long modulo(long long base, long long exponent, long long modulus); long long choose(long long n, long long k); long long inverse(long long a, long long m); void build(); void fileio(); long long ncr(long long n, long long r); const int nax = 1e6 + 10; const int LG = log2(nax) + 1; vector<long long> fact(nax); long long dp[1LL << 20]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; string s; cin >> s; long long freq[m][m]; memset(freq, 0, sizeof(freq)); for (int i = 1; i < n; i++) { freq[s[i] - a ][s[i - 1] - a ]++; freq[s[i - 1] - a ][s[i] - a ]++; } for (int i = 0; i < (1LL << m); i++) dp[i] = 1000000000000000; for (int mask = 0; mask < (1LL << m); mask++) { long long cost = 0; for (int i = 0; i < m; i++) { for (int j = i + 1; j < m; j++) { if ((mask >> i & 1) ^ (mask >> j & 1)) { cost += freq[i][j]; } } } for (int i = 0; i < m; i++) { if ((mask & (1LL << i)) == 0) continue; dp[mask] = min(dp[mask], dp[mask ^ (1LL << i)] + cost); if ((mask ^ (1LL << i)) == 0) dp[mask] = cost; } } long long ans = dp[(1LL << m) - 1]; cout << ans << n ; return 0; } long long ncr(long long n, long long r) { if (r > n || r < 0 || n < 0) return 0; long long ans = fact[n]; long long temp = (fact[n - r] * fact[r]) % 1000000007; ans = (ans * inverse(temp, 1000000007)) % 1000000007; return ans; } void fileio() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } void build() { fact[0] = 1; for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007; } long long modulo(long long base, long long exponent, long long modulus) { if (modulus == 1) return 0; long long result = 1; base = base % modulus; while (exponent > 0) { if (exponent % 2 == 1) { result = (result * base) % modulus; } exponent = exponent >> 1; base = (base * base) % modulus; } return result; } long long choose(long long n, long long k) { if (k == 0) return 1; return (n * choose(n - 1, k - 1)) / k; } void EE(long long a, long long b, long long &co1, long long &co2) { if (a % b == 0) { co1 = 0; co2 = 1; return; } EE(b, a % b, co1, co2); long long temp = co1; co1 = co2; co2 = temp - co2 * (a / b); } long long inverse(long long a, long long m) { long long x, y; EE(a, m, x, y); if (x < 0) x += m; return x; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100500]; int c[100500]; int n; bool vis[100500]; bool dfs(int u, int cu) { if (vis[u]) return 0; vis[u] = 1; bool r = 0; if (c[u] != cu) return 1; for (int v : g[u]) r |= dfs(v, cu); return r; } int main() { scanf( %d , &n); for (int i = 0, qwe = n - 1; i < qwe; ++i) { int u, v; scanf( %d%d , &u, &v); u--; v--; g[u].push_back(v); g[v].push_back(u); } for (int i = 0, qwe = n; i < qwe; ++i) scanf( %d , c + i); int u = -1, sz = 0; for (int i = 0, qwe = n; i < qwe; ++i) { set<int> s; for (int v : g[i]) if (c[i] != c[v]) s.insert(v); if (s.size() > sz) u = i, sz = s.size(); } if (u == -1) { puts( YES n1 ); return 0; } vis[u] = 1; for (int i = 0, qwe = g[u].size(); i < qwe; ++i) if (dfs(g[u][i], c[g[u][i]])) { puts( NO ); return 0; } printf( YES n%d n , u + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[105][105]; int main() { scanf( %d %d , &n, &m); if (n + m == 3 or n + m == 4) printf( -1 n ); else { int num = 2; if (n >= m) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (num > m * n) num = 1; a[i][j] = num; num += 2; } } else for (int j = 1; j <= m; j++) for (int i = 1; i <= n; i++) { if (num > m * n) num = 1; a[i][j] = num; num += 2; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { printf( %d , a[i][j]); if (j == m) printf( n ); else printf( ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const inline int __GET_INT() { int ret; scanf( %d , &ret); return ret; } const int maxn = 2002; int n, m; char grid[maxn][maxn]; int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1}; int cntStar(int r, int c) { return (grid[r][c] == * ) + (grid[r + 1][c] == * ) + (grid[r][c + 1] == * ) + (grid[r + 1][c + 1] == * ); } void dfs(int r, int c) { if (r < 0 || c < 0 || (r + 1) >= n || (c + 1) >= m) { return; } if (cntStar(r, c) != 1) { return; } grid[r][c] = grid[r + 1][c] = grid[r][c + 1] = grid[r + 1][c + 1] = . ; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) { for (int k = 0; k < 8; ++k) { dfs(r + i + dx[k], c + j + dy[k]); } } } int main() { n = __GET_INT(); m = __GET_INT(); for (int i = 0; i < n; ++i) { scanf( %s , grid[i]); } for (int i = 0; (i + 1) < n; ++i) for (int j = 0; (j + 1) < m; ++j) { dfs(i, j); } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) printf( %c , grid[i][j]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200005]; int b[200005]; int n, k, Q; long long ans; int l, r; int main() { scanf( %d , &Q); while (Q--) { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); for (int i = 1; i <= k; i++) scanf( %d , &b[i]); sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + k); int l, r; ans = 0; l = 1; r = n; for (int i = 1; i <= k; i++) { if (b[i] == 1) ans += a[r] + a[r]; else break; r--; } for (int i = k; i >= 1; i--) { if (b[i] == 1) break; ans += a[l] + a[r]; r--; l += b[i] - 1; } printf( %lld n , ans); } } |
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { if (a < b) return a; return b; } const int MOD = 1e9 + 7, N = 102, L = 3005, INF = INT_MAX; pair<long long, long long> a[N]; long long dp[L][N][2]; int main() { int n, l; cin >> n >> l; for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } for (int i = 1; i <= l; i++) { for (int j = 0; j < n; j++) { if (a[j].first == i) dp[i][j][0] = 1; else if (a[j].first < i) { for (int c = 0; c < n; c++) { if (c == j) continue; if (a[c].second == a[j].first) dp[i][j][0] += dp[i - a[j].first][c][0]; if (a[c].first == a[j].first && a[c].first != a[c].second) dp[i][j][0] += dp[i - a[j].first][c][1]; dp[i][j][0] %= MOD; } } if (a[j].second == i) dp[i][j][1] = 1; else if (a[j].second < i) { for (int c = 0; c < n; c++) { if (c == j) continue; if (a[c].second == a[j].second) dp[i][j][1] += dp[i - a[j].second][c][0]; if (a[c].first == a[j].second && a[c].first != a[c].second) dp[i][j][1] += dp[i - a[j].second][c][1]; dp[i][j][1] %= MOD; } } } } long long ans = 0; for (int i = 0; i < n; i++) { ans += dp[l][i][0]; if (a[i].first != a[i].second) ans += dp[l][i][1]; ans %= MOD; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 11, N = 2e5 + 5; int n, k; int a[N]; map<int, int> rem[M]; long long solve() { long long ans = 0; for (int i = 0; i < n; ++i) { unsigned long long f = 10; int ln = ((int)(to_string(a[i])).size()); for (int l = 1; l < M; ++l) { int r = (k - (int)((f * a[i]) % k)) % k; ans += rem[l][r]; if (l == ln && r == a[i] % k) ans--; f *= 10; } } return ans; } int main() { ios::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> k; for (int i = 0; i < n; ++i) { cin >> a[i]; int l = ((int)(to_string(a[i])).size()); rem[l][a[i] % k]++; } cout << solve() << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, x; cin >> n; for (long long i = 0; i < n; i++) { cin >> k >> x; cout << x + (k - 1) * 9 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5; int main() { long long v, w1, w2, v1, v2; cin >> v >> w1 >> w2 >> v1 >> v2; long long x = max(v1, v2); if (x * x >= v) { if (v1 < v2) swap(v1, v2), swap(w1, w2); long long ans = 0; for (int i = 0; i <= v / v1; i++) { ans = max(ans, i * w1 + (v - i * v1) / v2 * w2); } cout << ans << endl; } else { if (1.0 * w1 / v1 > 1.0 * w2 / v2) { swap(v1, v2), swap(w1, w2); } long long ans = 0; for (int i = 0; i < v2; i++) { ans = max(ans, i * w1 + (v - i * v1) / v2 * w2); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> const int mod = 1000000007; const int inf = 1000000009; const long long INF = 1000000000000000009; const long long big = 1000000000000000; const long double eps = 0.000000000000000000001; using namespace std; const int M = 100000; int W[M + 5], U[M + 5], cnt[M + 5]; vector<int> D[M + 5], S; long long int funkcja(int x) { long long int wynik = 0; for (auto v : D[x]) wynik += cnt[v] * U[v]; return wynik; } void aktualizuj(int x, int c) { for (auto v : D[x]) cnt[v] += c; } int main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(); int n; cin >> n; for (int i = 1; i <= M; i++) { for (int j = i; j <= M; j += i) D[j].push_back(i); if (i == 1) U[i] = 1; else if ((i / D[i][1]) % D[i][1] == 0) U[i] = 0; else U[i] = -U[i / D[i][1]]; } long long int wynik = 0; for (int i = 1; i <= n; i++) { int a; cin >> a; wynik = max(wynik, (long long int)a); for (auto v : D[a]) W[v] = 1; } for (int j = M; j >= 1; j--) { if (!W[j]) continue; while (funkcja(j)) { wynik = max(wynik, (long long int)j * S.back()); aktualizuj(S.back(), -1); S.pop_back(); } aktualizuj(j, 1); S.push_back(j); } cout << wynik; return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, sum, x; int main() { cin >> a >> b; while (a) { sum += a; x += a % b; a /= b; a += x / b; x %= b; } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, arr[500010], temp, j, i, ans; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (long long i = 0; i < n; i++) { cin >> arr[i]; }; sort(arr, arr + n); i = 0, j = n / 2; ans = n; while (i < n / 2) { while (j < n) { if (arr[i] * 2 <= arr[j]) { ans--; j++; break; } else j++; } i++; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int l[210000], r[210000]; vector<pair<int, int> > v; int n, m, k; int mp[1000]; int lbit[1000]; int dp[210000][300]; int msk[210000]; int main() { for (int i = 0; i < 210000; i++) for (int j = 0; j < 300; j++) dp[i][j] = -0x3f3f3f3f; dp[0][0] = 0; for (int i = 0; i < (1 << 9); i++) { int cnt = 0; for (int j = 0; j < 8; j++) if (i & (1 << j)) { mp[i]++; } else if (lbit[i] == 0) { lbit[i] = (1 << j); } } cin >> n >> m >> k; for (int i = 1; i <= n; i++) { scanf( %d%d , &l[i], &r[i]); v.push_back({l[i] - 1, i}); v.push_back({r[i], -i}); } sort(v.begin(), v.end()); int tim = 0; int posmsk = 0; int ans = 0; int lst = 0; for (auto p : v) { tim++; if (p.second < 0) { for (int j = 0; j < (1 << 8); j++) if (j & msk[-p.second]) dp[tim][j ^ msk[-p.second]] = max(dp[tim][j ^ msk[-p.second]], dp[tim - 1][j] + max(0, p.first - lst) * (mp[j] & 1)); else { dp[tim][j] = max(dp[tim][j], dp[tim - 1][j] + (p.first - lst) * (mp[j] & 1)); } posmsk ^= msk[-p.second]; } else { msk[p.second] = lbit[posmsk]; posmsk ^= msk[p.second]; for (int j = 0; j < (1 << 8); j++) if ((j & msk[p.second]) == 0) { dp[tim][j ^ msk[p.second]] = max(dp[tim][j ^ msk[p.second]], dp[tim - 1][j] + (max(0, p.first - lst)) * (mp[j] & 1)); dp[tim][j] = max(dp[tim][j], dp[tim - 1][j] + (p.first - lst) * (mp[j] & 1)); } } lst = p.first; } cout << dp[2 * n][0]; return ~~(0 ^ 0 ^ 0); } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int N = 3005; int n, c, a[N], dp[N][N], g[N][N], freq[N], mul[N], imul[N], pw[N], cnt[N]; int dp2[2][N][1 << 12]; int inverse(int n) { if (n == 1) return 1; return inverse(mod % n) * 1LL * (mod - mod / n) % mod; } inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; } void solve1() { for (int i = 1; i <= n; i++) { a[i]--; } memset(dp2, 0, sizeof(dp2)); int flg = 0; dp2[0][0][0] = 1; for (int i = 1; i <= n; i++) { for (int p = 0; p * c <= i; p++) { for (int mask = 0; mask < (1 << c); mask++) { dp2[flg ^ 1][p][mask] = 0; } } for (int p = 0; p * c <= i; p++) { for (int mask = 0; mask + 1 < (1 << c); mask++) { int nmask = mask | (1 << a[i]); if (nmask + 1 == (1 << c)) { add(dp2[flg ^ 1][p + 1][0], dp2[flg][p][mask]); } else { add(dp2[flg ^ 1][p][nmask], dp2[flg][p][mask]); } add(dp2[flg ^ 1][p][mask], dp2[flg][p][mask]); } } flg ^= 1; } memset(cnt, 0, sizeof(cnt)); for (int p = 0; p <= n; p++) { for (int mask = 0; mask + 1 < (1 << c); mask++) { add(cnt[p], dp2[flg][p][mask]); } } add(cnt[0], mod - 1); for (int i = 0; i <= n; i++) { cout << cnt[i] << ; } cout << n ; } void solve2() { mul[0] = 0; pw[0] = 1; for (int i = 1; i <= n; i++) { mul[i] = mul[i - 1] + mul[i - 1] + 1; if (mul[i] >= mod) mul[i] -= mod; imul[i] = inverse(mul[i]); pw[i] = mul[i] + 1; } memset(g, 0, sizeof(g)); for (int i = 1; i <= n; i++) { int cnt = 0; long long prd = 1; memset(freq, 0, sizeof(freq)); for (int j = i; j <= n; j++) { if (freq[a[j]] == 0) { cnt++; } else { (prd *= imul[freq[a[j]]]) %= mod; } freq[a[j]]++; (prd *= mul[freq[a[j]]]) %= mod; if (cnt == c) { g[i][j] = prd * imul[freq[a[j]]] % mod; } } } memset(dp, 0, sizeof(dp)); for (int i = 1; i <= n; i++) { dp[i][1] = g[1][i]; for (int j = 1; j <= i; j++) { for (int p = 2; p * c <= i; p++) { dp[i][p] += dp[j - 1][p - 1] * 1LL * g[j][i] % mod; if (dp[i][p] >= mod) dp[i][p] -= mod; } } } memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; i++) { for (int p = 1; p * c <= i; p++) { cnt[p] += dp[i][p] * 1LL * pw[n - i] % mod; if (cnt[p] >= mod) cnt[p] -= mod; } } cnt[0] = mul[n] + mod - cnt[1]; if (cnt[0] >= mod) cnt[0] -= mod; for (int p = 1; p <= n; p++) { cnt[p] += mod - cnt[p + 1]; if (cnt[p] >= mod) cnt[p] -= mod; } for (int i = 0; i <= n; i++) { cout << cnt[i] << ; } cout << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> c; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (c <= 10) { solve1(); } else { solve2(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int ans[101000], mark[101000]; char s[101000]; int n, top, now, n_; int main() { do s[++n_] = getchar(); while (s[n_] != = ); scanf( %d , &n); mark[1] = 0; top = 1; for (int i = 3; i < n_; i += 4) mark[++top] = (s[i] == - ); now = 0; for (int i = 1; i <= top; i++) ans[i] = 1; for (int i = 1; i <= top; i++) if (mark[i]) now--; else now++; while (now != n) { if (now < n) { int q = 0; for (int i = 1; i <= top; i++) if (!mark[i] && ans[i] < n) { q = i; break; } if (!q) { printf( Impossible ); return 0; } int inc = min(n - ans[q], n - now); ans[q] += inc; now += inc; } else { int q = 0; for (int i = 1; i <= top; i++) if (mark[i] && ans[i] < n) { q = i; break; } if (!q) { printf( Impossible ); return 0; } int inc = min(n - ans[q], now - n); ans[q] += inc; now -= inc; } } printf( Possible n ); printf( %d , ans[1]); for (int i = 2; i <= top; i++) { putchar( ); if (mark[i]) putchar( - ); else putchar( + ); putchar( ); printf( %d , ans[i]); } printf( = %d , n); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 4e5 + 5; long long a[maxn], f[maxn], d[maxn]; int q[maxn]; int main() { int n, i, j, l, r; long long c; scanf( %d%lld , &n, &c); for (i = 1; i < (n << 1); i++) { scanf( %lld , &a[i]); a[i] += a[i - 1]; } l = r = 1; j = q[1] = 0; for (i = 1; i <= n; i++) { while (j < i && a[(i << 1) - 1] - a[j << 1] > c) j++; while (l <= r && q[l] < j) l++; if (j) f[i] = f[j - 1] + c; if (l <= r) f[i] = max(f[i], d[q[l]] + a[(i << 1) - 1]); d[i] = f[i] - a[i << 1]; while (l <= r && d[i] > d[q[r]]) r--; q[++r] = i; } printf( %lld n , f[n]); return 0; } |
#include <bits/stdc++.h> template <typename T> std::istream& operator>>(std::istream& input, std::vector<T>& v) { for (T& a : v) input >> a; return input; } void answer(bool v) { constexpr const char* s[2] = { NO , YES }; std::cout << s[v] << n ; } void solve(const std::vector<unsigned>& a) { const size_t n = a.size(); for (size_t i = 1; i < n; ++i) { if (a[i] >= a[i - 1]) return answer(true); } answer(false); } void test_case() { size_t n; std::cin >> n; std::vector<unsigned> a(n); std::cin >> a; solve(a); } int main() { size_t t; std::cin >> t; while (t-- > 0) test_case(); return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; }; void __print(long x) { cerr << x; }; void __print(long long x) { cerr << x; }; void __print(unsigned x) { cerr << x; }; void __print(unsigned long x) { cerr << x; }; void __print(unsigned long long x) { cerr << x; }; void __print(float x) { cerr << x; }; void __print(double x) { cerr << x; }; void __print(long double x) { cerr << x; }; void __print(char x) { cerr << << x << ; }; void __print(const char *x) { cerr << << x << ; }; void __print(const string &x) { cerr << << x << ; }; void __print(bool x) { cerr << (x ? true : false ); } long long powmod(long long a, long long b) { long long res = 1; a %= 1000000007; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; } return res; } long long string_to_int(string s) { long long ans = 0; long long p = 1; for (long long i = s.size() - 1; i >= 0; i--) { ans += (s[i] - 0 ) * p; p *= 10; } return ans; } long long fast_pow(long long a, long long b) { if (b == 1) return a; if (b == 0) return 1; long long x = fast_pow(a, b / 2); x *= x; if (b & 1) x *= a; return x; } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { long long f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } void t_c_c() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, k; cin >> n >> m >> k; long long arr[m]; for (long long i = 0; i < m; i++) { cin >> arr[i]; } long long days = 0; long long pages = k; long long point = 0; long long x = 0; long long xx = 0; for (long long i = 0; i < m;) { if (arr[i] - x <= pages) { while (arr[i] - xx <= pages) { ; x++; i++; } xx = x; days++; } else { long long factor = ((arr[i] - x) - pages) / k; pages += (((arr[i] - x) - pages) % k == 0 ? factor * k : (factor + 1) * k); } } cout << days << n ; } int32_t main() { t_c_c(); return 0; } |
/** * author: Ujjwal Tripathi * created: 15.04.2021 18:04:04 **/ #include<bits/stdc++.h> using namespace std; #define ar array<ll, 2> #define ll long long #define in insert #define pb push_back #define pii pair<ll,ll> #define vt vector #define P_Q(x) priority_queue<x> #define p_q(x) priority_queue<x, vector<x>, greater<x>> #define For(i, n) for(ll i = 0; i < n; i++) #define Rev(i, n) for(ll i = n-1; i >= 0; i--) #define FOR(i, n) for(ll i = 1; i <= n; i++) #define REV(i, n) for(ll i = n; i >= 1; i--) #define Rep(i,a,b) for(ll i = a; i <= b; i++) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) (int) (x).size() // Maximum priority queue template <typename T> using mxpq = priority_queue<T>; // Minimum priority queue template <typename T> using mnpq = priority_queue<T, vt<T>, greater<T>>; // x | (x + 1) sets lowest unset bit of x // x & (x - 1) unsets lowest set bit of x const ll mod = 1e9L + 7; const ll INF = 1e18L + 5; const ll mxN = 2e5 + 1; ll n; ll dp[1000004]; // remember to read no of test_cases void solve() { cin>>n; vt<ll> v(n); For(i,n) { cin>>v[i]; if(v[i]%2==0) { cout<<v[i]<< ; } } For(i,n) { if(v[i]%2==1) { cout<<v[i]<< ; } } cout<<endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); ll t = 1; cin >> t; FOR(tt, t) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[200010], b[200010], n, cnt = 0; int main() { ios::sync_with_stdio(0); cin >> n; for (int i = 2; i <= n; i++) cin >> a[i]; for (int tmp = n; tmp; tmp = a[tmp]) b[++cnt] = tmp; reverse(b + 1, b + cnt + 1); for (int i = 1; i <= cnt; i++) cout << b[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cin.sync_with_stdio(0); int t; long long n; cin >> t; for (int i = 0; i < t; i++) { cin >> n; cout << (-1 * n) + 1 << << n << n ; } } bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } bool sort_descending(int a, int b) { return (a > b); } |
#include <bits/stdc++.h> using namespace std; const int seed = 131; const long long LLMAX = 2e18; const int MOD = 1e9 + 7; const double eps = 1e-8; const int MAXN = 1e5 + 10; const int hmod1 = 0x48E2DCE7; const int hmod2 = 0x60000005; inline long long sqr(long long x) { return x * x; } inline int sqr(int x) { return x * x; } inline double sqr(double x) { return x * x; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long exgcd(long long a, long long b, long long &x, long long &y) { long long d; (b == 0 ? (x = 1, y = 0, d = a) : (d = exgcd(b, a % b, y, x), y -= a / b * x)); return d; } long long qpow(long long a, long long n) { long long sum = 1; while (n) { if (n & 1) sum = sum * a % MOD; a = a * a % MOD; n >>= 1; } return sum; } inline int dcmp(double x) { if (fabs(x) < eps) return 0; return (x > 0 ? 1 : -1); } long long need[MAXN], tim[MAXN], v[MAXN][2], cnt = 0; struct node { long long id, a, b; node() {} node(long long x, long long y, long long z) { id = x, a = y, b = z; } bool operator<(const node &n) const { if (a - b == n.a - n.b) return a > n.a; return a - b > n.a - n.b; } } in[MAXN]; long long check(long long n, long long a, long long b) { long long sum = 0; for (int i = 0; i <= n; i++) tim[i] = need[i]; for (int i = 0; i < cnt; i++) { if (tim[in[i].id]) { long long minn = min(tim[in[i].id], a); sum += in[i].a * minn; tim[in[i].id] -= minn; a -= minn; } if (tim[in[i].id]) { long long minn = min(tim[in[i].id], b); sum += in[i].b * minn; tim[in[i].id] -= minn; b -= minn; } } return sum; } int main(void) { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, s, sum = 0, ans = 0; cin >> n >> s; for (int i = 0; i < n; i++) { cin >> need[i] >> v[i][0] >> v[i][1]; sum += need[i]; in[cnt++] = node(i, v[i][0], v[i][1]); } long long all = (sum + s - 1) / s, l = 0, r = all; need[n] = all * s - sum; in[cnt++] = node(n, 0, 0); sort(in, in + cnt); while (l + 3 < r) { long long m1 = (l + r) / 2, m2 = (m1 + r) / 2; if (check(n, m1 * s, (all - m1) * s) > check(n, m2 * s, (all - m2) * s)) r = m2; else l = m1; } for (long long i = l; i <= r; i++) ans = max(ans, check(n, i * s, (all - i) * s)); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long poww(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md)); } const long long MAXN = 1e6 + 10; const long long INF = 8e18; const long long MOD = 1e9 + 7; vector<pair<pair<long long, long long>, int>> v; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { v.clear(); int n; cin >> n; n = n * 2 - 1; v.resize(n); for (int i = 0; i < n; i++) cin >> v[i].first.first >> v[i].first.second, v[i].second = i + 1; sort((v).begin(), (v).end(), greater<pair<pair<long long, long long>, int>>()); vector<int> ans = {v.front().second}; for (int i = 1; i < n; i += 2) { if (v[i].first.second < v[i + 1].first.second) ans.push_back(v[i + 1].second); else ans.push_back(v[i].second); } sort((ans).begin(), (ans).end()); cout << YES << n ; for (int e : ans) cout << e << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t, x, sum = 0, y, z, flag = 0, a, p, l, r, b, c, q, i, j, k, n, m, maxi = LONG_MIN, mini = LONG_MAX, mul = 1; string s, s1; vector<long long int> v, va, vb; map<long long int, long long int> mp, mp1; cin >> n; for (i = 0; i < n; i++) { cin >> x; mp[x]++; mp1[x]++; } auto it = mp.begin(); auto it1 = mp1.begin(); while (it1 != mp1.end()) { if (it->first == it1->first) it1++; if (it1 == mp1.end()) break; x = it->second; y = it1->second; for (i = 0; i < x && i < y; i++) { mp[it->first]--; sum++; mp1[it1->first]--; } if (x == i) it++; if (y == i) it1++; } cout << sum << endl; } |
#include <bits/stdc++.h> using namespace std; struct ele { long long next, prev, delta, y; }; long long r, c, k, n, curcnt = 0, ans = 0; vector<ele> a; vector<long long> deltaleft, deltaright; vector<vector<long long> > X, id; vector<pair<long long, long long> > tmp; void init() { X.clear(); X.resize(r + 1); id.resize(r + 1); } void remove(long long id) { long long cur = id; deltaleft.clear(); deltaright.clear(); for (long long i = 0; i <= k; i++) { if (cur == -1 || a[cur].delta == -1) break; deltaleft.push_back(a[cur].delta); cur = a[cur].prev; } cur = a[id].next; for (long long i = 0; i <= k; i++) { if (cur == -1 || a[cur].delta == -1) break; deltaright.push_back(a[cur].delta); cur = a[cur].next; } curcnt -= deltaright[0] * deltaleft[0]; curcnt -= deltaright[0] * (deltaright[0] - 1) / 2 + deltaleft[0] * (deltaleft[0] - 1) / 2; curcnt += (deltaright[0] + deltaleft[0]) * (deltaright[0] + deltaleft[0] - 1) / 2; for (long long i = 0; i <= k; i++) { if (i < deltaleft.size() && k - i < deltaright.size()) curcnt += deltaleft[i] * deltaright[k - i]; } a[a[id].prev].next = a[id].next; a[a[id].next].prev = a[id].prev; a[a[id].next].delta += a[id].delta; } long long cmp(pair<long long, long long> a, pair<long long, long long> b) { return X[a.first][a.second] < X[b.first][b.second]; } void solve(long long r1) { tmp.clear(); for (long long i = r1; i <= r; i++) { for (long long j = 0; j < X[i].size(); j++) { tmp.push_back({i, j}); } } sort(tmp.begin(), tmp.end(), cmp); a.resize(tmp.size() + 2); a[0].prev = -1; a[0].next = 1; a[0].y = 0; a[tmp.size() + 1].prev = (long long)tmp.size(); a[tmp.size() + 1].next = -1; a[tmp.size() + 1].y = c + 1; for (long long i = 0; i < tmp.size(); i++) { id[tmp[i].first][tmp[i].second] = i + 1; a[i + 1].y = X[tmp[i].first][tmp[i].second]; a[i + 1].prev = i; a[i + 1].next = i + 2; } a[0].delta = -1; for (long long i = 1; i < a.size(); i++) { a[i].delta = a[i].y - a[i - 1].y; } curcnt = 0; for (long long i = 1; i < a.size(); i++) { curcnt += (a[i].delta - 1) * a[i].delta / 2; for (long long j = 1; j <= k; j++) { if (i - j <= 0) break; curcnt += a[i].delta * a[i - j].delta; } } for (long long i = r; i >= r1; i--) { ans += curcnt; for (long long j = 0; j < X[i].size(); j++) { remove(id[i][j]); } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> r >> c >> n >> k; k--; init(); for (long long i = 1; i <= n; i++) { long long u, v; cin >> u >> v; X[u].push_back(v); } for (long long i = 1; i <= r; i++) { id[i].resize(X[i].size()); } for (long long i = 1; i <= r; i++) { solve(i); } ans = (r + 1) * r / 2 * (c + 1) * c / 2 - ans; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 300007; struct tup { int u, v, pos; friend bool operator<(tup x, tup y) { if (x.v < y.v) { return 1; } return 0; } } ans[maxn]; int rec[maxn], n; int solve() { int cnt = 0; rec[cnt++] = n; ans[n].v = 2 * n + 1; for (int i = n - 1; i >= 0; --i) { if (ans[i].u < ans[rec[cnt - 1]].v && ans[i].u < ans[i].v) { rec[cnt++] = i; } } return cnt; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d%d , &ans[i].u, &ans[i].v); ans[i].pos = i; } sort(ans, ans + n); int cnt1 = solve() - 1; int tmp[maxn]; for (int i = 1; i <= cnt1; ++i) { tmp[i] = ans[rec[i]].pos + 1; } for (int i = 0; i < n; ++i) { ans[i].u = -ans[i].u; ans[i].v = -ans[i].v; } sort(ans, ans + n); int cnt = solve() - 1; if (cnt <= cnt1) { printf( %d n , cnt1); for (int i = 1; i <= cnt1; ++i) { printf( %d , tmp[i]); } } else { printf( %d n , cnt); for (int i = 1; i <= cnt; ++i) { printf( %d , ans[rec[i]].pos + 1); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int n, q, counts = 0; cin >> n; int s[n]; for (int i = 0; i < n; i++) cin >> s[i]; cin >> q; int l[q], r[q]; for (int i = 0; i < q; i++) cin >> l[i] >> r[i]; int sums[n + 1]; sums[0] = 0; for (int i = 1; i < n + 1; i++) sums[i] = sums[i - 1] + s[i - 1]; for (int i = 0; i < q; i++) cout << (sums[r[i]] - sums[l[i] - 1]) / 10 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const int M = 107; const int inf = 1e9 + 7; vector<int> g[N], a[M]; int w[N][M], d[N]; void bfs(int u) { queue<int> q; memset(d, inf, sizeof(d)); for (int i = 0; i < (int)a[u].size(); ++i) { q.push(a[u][i]); d[a[u][i]] = 0; } while (!q.empty()) { int v = q.front(); q.pop(); w[v][u] = d[v]; for (int i = 0; i < (int)g[v].size(); ++i) { int to = g[v][i]; if (d[to] > d[v] + 1) { d[to] = d[v] + 1; q.push(to); } } } } int main() { int n, m, k, second; scanf( %d %d %d %d , &n, &m, &k, &second); for (int i = 1, x; i <= n; ++i) { scanf( %d , &x); a[x].push_back(i); } for (int i = 0, u, v; i < m; ++i) { scanf( %d %d , &u, &v); g[u].push_back(v); g[v].push_back(u); } for (int i = 1; i <= k; ++i) bfs(i); for (int i = 1; i <= n; ++i) { sort(w[i] + 1, w[i] + k + 1); int ans = 0; for (int j = 1; j <= second; ++j) ans += w[i][j]; printf( %d , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, m, x; unordered_map<int, int> mp; cin >> t; int a[t]; for (int i = 1; i <= t; i++) { cin >> a[i]; mp[i] = a[i]; } for (int i = 1; i <= t; i++) { n = mp[i]; m = mp[n]; x = mp[m]; if (i == x) { cout << YES ; return 0; } } cout << NO << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 23; const int mod = 1000 * 1000 * 1000 + 7; int dp[2][1 << maxN]; int a[maxN]; int res[maxN][maxN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; dp[0][1] = 1; dp[0][0] = mod; memset(res, -1, sizeof res); for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) for (int k = 0; k < i; k++) if (a[j] + a[k] == a[i]) res[i][j] = k; for (int i = 1; i < n; i++) { int u = i & 1; for (int mask = 0; mask < (1 << (i + 1)); mask++) dp[u][mask] = mod; for (int mask = 0; mask < (1 << i); mask++) { for (int j = 0; j < i; j++) { if (res[i][j] == -1) continue; if (mask >> j & 1) if (mask >> res[i][j] & 1) { int tmp = mask ^ (1 << i); dp[u][tmp] = min(dp[u][tmp], max(__builtin_popcount(tmp), dp[!u][mask])); for (int k = 0; k < i; k++) { if (mask >> k & 1) { dp[u][tmp ^ (1 << k)] = min(dp[u][tmp ^ (1 << k)], dp[!u][mask]); } } break; } } } } int ans = mod; for (int mask = 0; mask < (1 << n); mask++) ans = min(ans, dp[(n - 1) & 1][mask]); if (ans == mod) cout << -1 << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MN = 51; char a[MN][MN], b[MN][MN]; const char L = L , R = R , U = U , D = D ; vector<pair<int, int> > sol, sol2; int n, m; void show() { ; for (int i = 0; i < n; ++i) ; ; ; for (int i = 0; i < n; ++i) ; ; } bool move(char arr[MN][MN], int i, int j) { ; if (arr[i][j] == U && arr[i][j + 1] == U && arr[i + 1][j] == D && arr[i + 1][j + 1] == D) { ; arr[i][j] = arr[i + 1][j] = L; arr[i][j + 1] = arr[i + 1][j + 1] = R; } else if (arr[i][j] == L && arr[i + 1][j] == L && arr[i][j + 1] == R && arr[i + 1][j + 1] == R) { ; arr[i][j] = arr[i][j + 1] = U; arr[i + 1][j] = arr[i + 1][j + 1] = D; } else { ; return false; } sol.emplace_back(i, j); return true; ; show(); } void push(char arr[MN][MN], int i, int k, bool ver) { char aim = ver ? U : L; ; show(); assert(arr[i][k] == L || arr[i][k] == U); if (arr[i][k] != aim) { if (!move(arr, i, k)) { push(arr, i + ver, k + !ver, !ver); move(arr, i, k); } } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) scanf( %s , a[i]); for (int i = 0; i < n; ++i) scanf( %s , b[i]); if (n % 2) { ; for (int k = 0; k < m; k += 2) for (int i = 0; i < n; ++i) push(a, i, k, false); swap(sol, sol2); ; for (int k = 0; k < m; k += 2) for (int i = 0; i < n; i++) push(b, i, k, false); } else { ; for (int i = 0; i < n; i += 2) for (int k = 0; k < m; k++) push(a, i, k, true); swap(sol, sol2); ; for (int i = 0; i < n; i += 2) for (int k = 0; k < m; k++) push(b, i, k, true); } printf( %d n , (int)(sol.size() + sol2.size())); reverse(sol.begin(), sol.end()); for (auto x : sol2) printf( %d %d n , x.first + 1, x.second + 1); for (auto x : sol) printf( %d %d n , x.first + 1, x.second + 1); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t-- > 0) { int l, r; cin >> l >> r; cout << l << << 2 * l << n ; } return 0; } |
#include <bits/stdc++.h> char ans[4][128]; int main() { int i, j, n; while (scanf( %d , &n) != EOF) { memset(ans, 0, sizeof(ans)); if (n % 2 == 1) { j = 0; ans[0][0] = a + j; ans[1][0] = a + j; j = (j + 1) % 26; for (i = 0; i < n; i += 2) { ans[0][i + 1] = ans[0][i + 2] = a + j; j = (j + 1) % 26; ans[1][i + 1] = ans[1][i + 2] = a + j; j = (j + 1) % 26; ans[2][i + 1] = ans[2][i] = a + j; j = (j + 1) % 26; ans[3][i + 1] = ans[3][i] = a + j; j = (j + 1) % 26; } ans[2][n - 1] = a + j; ans[3][n - 1] = a + j; ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = 0 ; } else { j = 0; ans[1][0] = a + j; ans[2][0] = a + j; j = (j + 1) % 26; for (i = 0; i < n; i += 2) { ans[1][i + 1] = ans[1][i + 2] = a + j; j = (j + 1) % 26; ans[2][i + 1] = ans[2][i + 2] = a + j; j = (j + 1) % 26; ans[0][i + 1] = ans[0][i] = a + j; j = (j + 1) % 26; ans[3][i + 1] = ans[3][i] = a + j; j = (j + 1) % 26; } ans[1][n - 1] = a + j; ans[2][n - 1] = a + j; ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = 0 ; } puts(ans[0]); puts(ans[1]); puts(ans[2]); puts(ans[3]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, Mod, p[100010], a[200010], nxt[200010], w[200010], tot, root, size[100010], son[100010], cnt; bool vis[100010]; long long ans, mul[100010]; struct record { int dep, step; record(int D = 0, int S = 0) { dep = D; step = S; } } pre[100010], suf[100010]; int comp(record a, record b) { return a.dep < b.dep; } void add(int x, int y, int val) { tot++; a[tot] = y; nxt[tot] = p[x]; w[tot] = val; p[x] = tot; } void getroot(int u, int fa, int N) { size[u] = 1; son[u] = 0; for (int i = p[u]; i != 0; i = nxt[i]) if (a[i] != fa && vis[a[i]] == false) { getroot(a[i], u, N); size[u] += size[a[i]]; son[u] = max(son[u], size[a[i]]); } son[u] = max(son[u], N - size[u]); if (son[u] < son[root]) root = u; } void getdeep(int u, int fa, long long pred, int step, long long sufd) { pre[++cnt] = record(pred, step); suf[cnt] = record(sufd, step); for (int i = p[u]; i != 0; i = nxt[i]) if (a[i] != fa && vis[a[i]] == false) getdeep(a[i], u, (pred * 10 + w[i]) % Mod, step + 1, (sufd + w[i] * mul[step] % Mod) % Mod); } int findL(int l, int r, int x, record *v) { int mid; while (l != r) { mid = (l + r) >> 1; if (v[mid].dep >= x) r = mid; else l = mid + 1; } if (v[l].dep != x) return 1000000000; return l; } int findR(int l, int r, int x, record *v) { int mid, ans = 0; while (l <= r) { mid = (l + r) >> 1; if (v[mid].dep <= x) { ans = max(ans, mid); l = mid + 1; } else r = mid - 1; } if (v[ans].dep != x) return 0; return ans; } long long getnum(int l, int r, int now, record *v) { int L, R; if (l > r) return 0; L = findL(l, r, now, v); R = findR(l, r, now, v); if (L <= R) return R - L + 1; return 0; } void exgcd(int a, int b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return; } long long t; exgcd(b, a % b, x, y); t = x; x = y; y = t - (a / b) * y; } int getinv(long long A, long long B) { long long x, y; exgcd(A, Mod, x, y); x = (x % Mod + Mod) % Mod; x = (x * B) % Mod; return x; } long long calc(int u, int pre0, int s0, int suf0) { long long sum = 0; cnt = 0; getdeep(u, 0, pre0, s0, suf0); sort(pre + 1, pre + cnt + 1, comp); sort(suf + 1, suf + cnt + 1, comp); for (int i = 1; i <= cnt; i++) { int now = getinv(mul[pre[i].step], Mod - pre[i].dep); sum += getnum(1, cnt, now, suf); if (now == 0) --sum; } return sum; } void work(int u) { ans += calc(u, 0, 0, 0); vis[u] = true; for (int i = p[u]; i != 0; i = nxt[i]) if (vis[a[i]] == false) { ans -= calc(a[i], w[i] % Mod, 1, w[i] % Mod); root = 0; getroot(a[i], 0, size[a[i]]); work(root); } } int main() { scanf( %d%d , &n, &Mod); for (int i = 1; i < n; i++) { int x, y, v; scanf( %d%d%d , &x, &y, &v); ++x; ++y; add(x, y, v); add(y, x, v); } son[0] = 1000000000; root = 0; mul[0] = 1; for (int i = 1; i <= n; i++) mul[i] = mul[i - 1] * 10 % Mod; getroot(1, 0, n); work(root); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> inline T LCM(T a, T b) { if (a < 0) return LCM(-a, b); if (b < 0) return LCM(a, -b); return a * (b / gcd(a, b)); } vector<int> arr; const int N = 50005; int memo[5001]; int save[N]; int visit[N]; int find(int pos, int &xr) { for (int i = 0; i < N; i++) visit[i] = 0; vector<int> toAdd; int end = pos; visit[arr[pos]] = 1; for (int i = 0; i < pos; i++) { visit[arr[i]] = 2; } if (visit[arr[pos]] == 2) { return -1; } bool cant = false; for (int i = pos; i < arr.size(); i++) { if (visit[arr[i]] == 2) { cant = true; } if (visit[arr[i]] == 1) { if (cant) return -1; for (int j = 0; j < toAdd.size(); j++) { visit[toAdd[j]] = 1; } toAdd.clear(); end = i; } else { toAdd.push_back(arr[i]); } } xr = 0; for (int i = 0; i < N; i++) { if (visit[i] == 1) { xr = xr ^ i; } } return end; } int solve(int from) { int txr = 0; int ret = 0; if (from >= arr.size()) return 0; if (memo[from] != -1) { return memo[from]; } int end = find(from, txr); if (end != -1) { ret = max(txr + solve(end + 1), solve(from + 1)); } else { ret = solve(from + 1); } memo[from] = ret; return ret; } int main() { int n, i, temp, j; for (i = (int)0; i < (int)5001; ++i) { memo[i] = -1; } scanf( %d , &n); for (i = (int)0; i < (int)n; ++i) { scanf( %d , &temp); arr.push_back(temp); } int xx; cout << solve(0); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, d; void solve() { double m = max((3.0) * a / (10.0), (double)(a - a * c / 250)); double v = max((3.0) * b / (10.0), (double)(b - b * d / 250)); if (m > v) cout << Misha << endl; if (m == v) cout << Tie << endl; if (m < v) cout << Vasya << endl; } int main() { while (cin >> a >> b >> c >> d) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; string op; bool check(int l, int r) { char c; cout << ? << l << << r << endl; cin >> c; return c == x ; } int main() { while (cin >> op) { if (op == end ) { return 0; } int l = 1, r = 2; while (1) { if (check(l, r)) break; l <<= 1, r <<= 1; } while (l + 1 < r) { int mid = (l + r) >> 1; if (check(l - 1, mid)) r = mid; else l = mid + 1; } if (l == 1 && r == 2) { if (check(2, 3)) cout << ! 1 << endl; else cout << ! 2 << endl; } else { if (l == r) cout << ! << l << endl; else { if (check(l, l + 1)) cout << ! << l + 1 << endl; else cout << ! << l << endl; } } } } |
#include <bits/stdc++.h> using namespace std; int n, k, a[1000005]; long long l; vector<int> val, cou, dp[1000005]; void add(int &a, int b) { a += b; if (a >= 1000000007) a -= 1000000007; } void setup() { cin >> n >> l >> k; for (int i = 0; i <= n - 1; i++) { cin >> a[i]; val.push_back(a[i]); } sort(val.begin(), val.end()); val.resize(unique(val.begin(), val.end()) - val.begin()); cou.resize(val.size()); for (int i = 0; i <= n - 1; i++) { dp[i].resize(k + 1); dp[i][1] = 1; a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin(); } } void xuly() { for (int j = 2; j <= k; j++) { for (int i = 0; i <= int(cou.size()) - 1; i++) cou[i] = 0; for (int i = 0; i <= n - 1; i++) add(cou[a[i]], dp[i][j - 1]); for (int i = 1; i <= int(cou.size()) - 1; i++) add(cou[i], cou[i - 1]); for (int i = 0; i <= n - 1; i++) dp[i][j] = cou[a[i]]; } int ans = 0; for (int i = 0; i <= n - 1; i++) for (int j = 1; j <= k; j++) { long long m = l / n; if (i < l % n) m++; m = m - j + 1; if (m > 0) ans = (ans + (m % 1000000007) * dp[i][j]) % 1000000007; } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); setup(); xuly(); return 0; } |
#include <bits/stdc++.h> const int N = 500005; int to[N << 1], edge, Next[N << 1], last[N], n, x, y, d[N], mx1[N], mx2[N]; int f[N], fmx[N], ans1, mx[N], f0[N], f1[N], sum[N]; std::vector<int> e[N]; void upd(int &x, int y) { if (y > x) x = y; } void add(int x, int y) { to[++edge] = y; Next[edge] = last[x]; last[x] = edge; } void dfs1(int x, int y) { f[x] = y; for (int i = last[x]; i; i = Next[i]) { int u = to[i]; if (u == y) continue; dfs1(u, x); if (mx1[u] + 1 > mx1[x]) mx2[x] = mx1[x], mx1[x] = mx1[u] + 1; else if (mx1[u] + 1 > mx2[x]) mx2[x] = mx1[u] + 1; } } void dfs2(int x, int y) { if (y) e[fmx[x]].push_back(x); for (int i = last[x]; i; i = Next[i]) { int u = to[i]; if (u == y) continue; if (mx1[x] == mx1[u] + 1) fmx[u] = std::max(mx2[x], fmx[x]) + 1; else fmx[u] = std::max(mx1[x], fmx[x]) + 1; e[mx1[u] + 1].push_back(x); } for (int i = last[x]; i; i = Next[i]) if (to[i] != y) dfs2(to[i], x); } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); add(x, y), add(y, x); d[x]++, d[y]++; } for (int i = 1; i <= n; i++) upd(ans1, d[i] + 1); dfs1(1, 0); dfs2(1, 0); f0[n] = f1[n] = 1; for (int i = n; i >= 1; i--) { int lst = 0; for (auto u : e[i]) { sum[u]++; upd(f0[i], sum[u]); upd(f1[i - 1], sum[u]); if (lst != u) upd(f1[i], sum[u]); upd(mx[f[u]], sum[u]); upd(f0[i], sum[u] + mx[u] - 2); if (f[u]) upd(f0[i], sum[u] + sum[f[u]] - 2); lst = u; } } for (int i = n; i >= 1; i--) upd(f0[i], f0[i + 1]), upd(f1[i], f1[i + 1]); printf( %d , ans1); for (int i = 2; i <= n; i++) if (i & 1) printf( %d , f1[i / 2]); else printf( %d , f0[i / 2]); } |
#include <bits/stdc++.h> using namespace std; int a[1000]; bool b[1000][1000]; int main() { int N, M; scanf( %d%d , &N, &M); for (int i = 0; i < N; i++) scanf( %d , &a[i]); for (int i = 0; i < M; i++) { int x, y; scanf( %d%d , &x, &y); --x; --y; b[x][y] = true; b[y][x] = true; } int mincost = 1000000000; for (int x = 0; x < N; x++) for (int y = 0; y < N; y++) for (int z = 0; z < N; z++) if (b[x][y] && b[y][z] && b[x][z]) if (a[x] + a[y] + a[z] < mincost) mincost = a[x] + a[y] + a[z]; if (mincost == 1000000000) printf( -1 ); else printf( %d n , mincost); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<vector<int> > arr(n + 1, vector<int>(m + 1)); for (int k = 1; k <= n; k++) { for (int i = 1; i <= m; i++) { cin >> arr[k][i]; arr[k][i] += arr[k][i - 1]; } } for (int i = 1; i <= m; i++) { for (int k = 1; k <= n; k++) { arr[k][i] += arr[k - 1][i]; } } int a, b; cin >> a >> b; int res = 1e9; for (int k = a; k <= n; k++) { for (int i = b; i <= m; i++) { res = min(res, arr[k][i] - arr[k][i - b] - arr[k - a][i] + arr[k - a][i - b]); } } for (int k = b; k <= n; k++) { for (int i = a; i <= m; i++) { res = min(res, arr[k][i] - arr[k][i - a] - arr[k - b][i] + arr[k - b][i - a]); } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> const int N = 1e5 + 50; using namespace std; int n, m, h, tot, mx, maxn, ans; int a[N], b[N], cnt[N], num[N]; int read() { int s = 0, t = 1; char c; while (c < 0 || c > 9 ) { if (c == - ) t = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { s = s * 10 + c - 0 ; c = getchar(); } return s * t; } long long readl() { long long s = 0, t = 1; char c; while (c < 0 || c > 9 ) { if (c == - ) t = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { s = s * 10 + c - 0 ; c = getchar(); } return s * t; } int main() { n = read(); m = read(); for (int i = 1; i <= m; i++) a[i] = read(), b[a[i]]++, mx = max(mx, a[i]); for (int i = 1; i <= mx; i++) if (b[i] > 0) cnt[++tot] = b[i]; for (int i = 1; i <= m; i++) { h = 0; for (int j = 1; j <= tot; j++) h += cnt[j] / i; if (h >= n) ans = i; else break; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, q; cin >> n >> q; set<int> s; multiset<int> d; auto Add = [&](int x) { auto ret = s.insert(x); auto it = ret.first; if (next(it) != s.end() && it != s.begin()) { d.erase(d.find(*next(it) - *prev(it))); } if (it != s.begin()) { d.insert(*it - *prev(it)); } if (next(it) != s.end()) { d.insert(*next(it) - *it); } }; auto Remove = [&](int x) { auto it = s.find(x); if (it != s.begin()) { d.erase(d.find(*it - *prev(it))); } if (next(it) != s.end()) { d.erase(d.find(*next(it) - *it)); } if (next(it) != s.end() && it != s.begin()) { d.insert(*next(it) - *prev(it)); } s.erase(it); }; for (int i = 0; i < n; i++) { int foo; cin >> foo; Add(foo); } for (int i = 0; i <= q; i++) { if (d.empty()) { cout << 0 << n ; } else { cout << *prev(s.end()) - *s.begin() - *prev(d.end()) << n ; } if (i == q) { break; } int c, x; cin >> c >> x; if (c) { Add(x); } else { Remove(x); } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { char ch = getchar(); long long s = 0, w = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = s * 10 + ch - 0 ; ch = getchar(); } return s * w; } int d[1000010], t[1000010], prime[1000010], tot, vis[1000010]; int n, fa[1000010], a[1000010], m; long long c[1000010]; inline void prepare(int Maxn) { d[1] = 1; for (register int i = 2; i <= Maxn; i++) { if (!vis[i]) { prime[++tot] = i; t[i] = d[i] = 2; } for (register int j = 1; 1LL * prime[j] * i <= Maxn; j++) { vis[i * prime[j]] = 1; if (i % prime[j]) { d[i * prime[j]] = d[i] * 2; t[i * prime[j]] = 2; } else { d[i * prime[j]] = d[i] / t[i] * (t[i] + 1); t[i * prime[j]] = t[i] + 1; break; } } } } inline void add(int x, int v) { for (; x <= n; x += x & (-x)) c[x] += v; } inline long long query(int x) { long long sum = 0; for (; x; x -= x & (-x)) sum += c[x]; return sum; } int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } int main() { prepare(1000010 - 10); n = read(), m = read(); for (register int i = 1; i <= n; i++) a[i] = read(), fa[i] = i; fa[n + 1] = n + 1; for (register int i = 1; i <= n; i++) add(i, a[i]); while (m--) { int opt = read(), l = read(), r = read(); if (opt == 1) { for (register int i = l; i <= r; i = find(i + 1)) { add(i, d[a[i]] - a[i]); a[i] = d[a[i]]; if (a[i] == 2 || a[i] == 1) fa[find(i)] = find(i + 1); } } else { printf( %lld n , query(r) - query(l - 1)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; char str[100050]; char a[5000], b[5000]; int len1, len2, len3; bool pp(int s1, int s2) { while (s2 <= len2) { if (str[s1] != a[s2]) return false; s1++, s2++; } return true; } bool pp2(int s1, int s2) { while (s2 <= len3) { if (str[s1] != b[s2]) return false; s1++, s2++; } return true; } bool rp(int s1, int s2) { while (s2 <= len2) { if (str[s1] != a[s2]) return false; s1--, s2++; } return true; } bool rp2(int s1, int s2) { while (s2 <= len3) { if (str[s1] != b[s2]) return false; s1--, s2++; } return true; } int main() { printf( Even n ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long num, tmp, sum, mx, l, r, mid; cin >> num; mx = sum = 0; for (int i = 0; i < num; i++) { cin >> tmp; sum += tmp; mx = max(mx, tmp); } l = mx; r = sum; while (l < r) { mid = (l + r) / 2; if (mid * num - sum >= mid) r = mid; else l = mid + 1; } cout << l; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 505; const int maxm = 1e4 + 5; struct node { int pre[maxn]; void init() { for (int i = 0; i < maxn; ++i) { pre[i] = i; } } int Find(int x) { if (x != pre[x]) pre[x] = Find(pre[x]); return pre[x]; } void v(int x, int y) { int fx = Find(x), fy = Find(y); if (fx != fy) pre[fy] = fx; } }; struct node q[maxm], h[maxm]; int u[maxm], v[maxm]; int n, m; int solve(node a, node b) { int ans = 0; for (int i = 1; i <= n; ++i) { a.v(i, b.Find(i)); } for (int i = 1; i <= n; ++i) { if (a.Find(i) == i) ans++; } return ans; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; ++i) scanf( %d%d , &u[i], &v[i]); q[0].init(); h[m + 1].init(); for (int i = 1; i <= m; ++i) { q[i] = q[i - 1]; q[i].v(u[i], v[i]); } for (int i = m; i >= 1; --i) { h[i] = h[i + 1]; h[i].v(u[i], v[i]); } int tt; scanf( %d , &tt); while (tt--) { int x, y; scanf( %d%d , &x, &y); printf( %d n , solve(q[x - 1], h[y + 1])); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long long int> v, t; v.push_back(0), t.push_back(0); long long int sum = 0, tt = 1, x = 0; double result = 0; long long int ix, a, b; for (int i = 0; i < n; ++i) { cin >> ix; if (ix == 1) { cin >> a >> b; t[a - 1] += b; sum += a * b; } else if (ix == 2) { cin >> a; v.push_back(a), t.push_back(0); sum += a; ++tt; } else { t[t.size() - 2] += t.back(); sum -= (v.back() + t.back()); --tt; v.pop_back(), t.pop_back(); } result = (double)sum / (double)tt; cout << fixed << setprecision(6) << result << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e9 + 5; long long n, k; bool valid(long long x) { long long maxi = (x)*k - ((x - 1) * ((x + 2) / 2.0)); if (maxi >= n) return true; else return false; } long long binary() { long long lo = 0, mid, hi = k; while (hi - lo > 0) { mid = (hi + lo) / 2; if (valid(mid)) hi = mid; else lo = mid + 1; } if (hi == lo) return lo; else return -1; } int main() { scanf( %I64d %I64d , &n, &k); long long ans = binary(); long long maxi = k; maxi += (ans - 1) * k - ((ans - 1) * ((ans + 2) / 2)); if (ans & 1 && ans != 1) maxi--; if (maxi >= n) printf( %I64d , ans); else printf( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int cnt[3600]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int h, m; scanf( n%d:%d , &h, &m); cnt[h * 60 + m]++; } int ans = 0; for (int i = 0; i < 1440; i++) { if (cnt[i] == 0) { int cur = 1, j = (i + 1) % 1440; while (j != i && cnt[j] == 0) { j = (j + 1) % 1440; cur++; } ans = max(ans, cur); } } cout << (ans / 60) / 10 << (ans / 60) % 10 << : << (ans % 60) / 10 << ans % 10; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 10; int a[N], b[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } vector<int> ans; for (int i = 1; i <= n; i++) { b[i] = a[i] - a[i - 1]; } for (int i = 1; i <= n; i++) { int flag = 0; for (int j = 1; i + j <= n; j++) { if (b[j] != b[i + j]) { flag++; break; } } if (!flag) { ans.push_back(i); } } cout << ans.size() << endl; for (auto i : ans) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 6; bool flag = true; vector<int> v[N]; int a[N], p[N], h[N], g[N]; void dfs(int u, int temp = -1) { a[u] = p[u]; int sum = 0; for (auto x : v[u]) { if (x == temp) continue; dfs(x, u); sum += g[x]; a[u] += a[x]; } if ((a[u] + h[u]) % 2 != 0) flag = false; g[u] = (a[u] + h[u]) / 2; if (g[u] >= 0 and g[u] <= a[u]) { } else flag = false; if (sum > g[u]) flag = false; } int main() { long long int t; cin >> t; while (t--) { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> p[i]; ; for (int i = 0; i < n; i++) cin >> h[i]; ; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--; b--; v[a].push_back(b); v[b].push_back(a); } dfs(0); cout << (flag ? YES : NO ) << endl; flag = true; for (int i = 0; i < n; i++) v[i].clear(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int i = 0, j = 0, a; string s, t; cin >> s >> t; a = t.length(); while (a--) { if (t[j] == s[i]) { i++; } j++; } cout << i + 1; } |
#include <bits/stdc++.h> using namespace std; char inp[1005], ans[1005]; int n, p; bool possible(int pos, int ok) { if (pos == n) return ok; int start = ok ? 0 : inp[pos] - a ; int i; for (i = start; i < p; i++) { ans[pos] = i + a ; if (pos > 0 && ans[pos - 1] == ans[pos]) continue; if (pos > 1 && ans[pos - 2] == ans[pos]) continue; if (possible(pos + 1, ok | (i > start))) return true; } return false; } int main() { scanf( %d%d , &n, &p); scanf( %s , inp); bool ok = 0; int i; if (possible(0, 0)) { ans[n] = 0 ; printf( %s n , ans); } else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; long long C[1005][2005]; int main() { scanf( %d %d %d , &n, &m, &k); int M = max(n, m); for (int n = 0; n <= M; n++) for (int r = 0; r <= 2 * k; r++) { if (r == 0) C[n][r] = 1; else if (n == 0) C[n][r] = 0; else C[n][r] = (C[n - 1][r - 1] + C[n - 1][r]) % 1000000007; } printf( %d n , (int)((C[n - 1][2 * k] * C[m - 1][2 * k]) % 1000000007)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long lca(long long a, long long b) { while (a != b) { if (a < b) b /= 2; else a /= 2; } return a; } long long inf = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL; int main() { ios_base::sync_with_stdio(0); int t; cin >> t; map<long long, long long> M; while (t-- > 0) { int x; cin >> x; long long u, v, w; cin >> u >> v; if (x == 1) { cin >> w; long long y = lca(u, v); while (u != y) { M[u] += w; u /= 2; } while (v != y) { M[v] += w; v /= 2; } } else { long long y = lca(u, v); long long ans = 0; while (u != y) { ans += M[u]; u /= 2; } while (v != y) { ans += M[v]; v /= 2; } cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[100]; int main() { int x = 1; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); if (a[i] < a[x]) x = i; } if (n == 1 || (n == 2 && a[1] == a[2])) { puts( -1 ); } else { printf( 1 n%d n , x); } return 0; } |
#include <bits/stdc++.h> using namespace std; char comp[200005]; vector<pair<int, int> > edge[200005]; vector<int> father[200005]; vector<string> ans; int dis[200005], n, k; queue<pair<int, int> > q; void dfs(int u) { if (ans.size() >= k) return; if (u == n + 1) { ans.push_back(comp + 1); return; } for (int i = 0; i < father[u].size(); i++) { comp[father[u][i]] = 1 ; dfs(u + 1); comp[father[u][i]] = 0 ; } } int main() { char a[10]; int m; cin >> n >> m >> k; for (int i = 1; i <= m; i++) { int u, v; scanf( %d %d , &u, &v); edge[u].push_back(make_pair(v, i)); edge[v].push_back(make_pair(u, i)); } memset(dis, -1, sizeof(dis)); for (int i = 1; i <= m; i++) comp[i] = 0 ; q.push(make_pair(1, 0)); dis[1] = 0; while (!q.empty()) { pair<int, int> pa = q.front(); q.pop(); int u = pa.first, d = pa.second; for (int i = 0; i < edge[u].size(); i++) { int v = edge[u][i].first; if (dis[v] == -1) { dis[v] = d + 1; q.push(make_pair(v, d + 1)); } } } for (int i = 2; i <= n; i++) { for (int j = 0; j < edge[i].size(); j++) { if (dis[i] == dis[edge[i][j].first] + 1) father[i].push_back(edge[i][j].second); } } dfs(2); if (ans.size() >= k) { cout << k << endl; for (int i = 0; i < k; i++) cout << ans[i] << endl; } else { cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { int s, f, t; cin >> s >> f >> t; int x = t % (2 * (m - 1)); int y = t - x; int ans = 0; if (s == f) { ans = t; } else if (s < f) { if (x <= s - 1) { ans = y + f - 1; } else { ans = y + 2 * (m - 1) + f - 1; } } else { if (x <= (m - 1) + (m - s)) { ans = y + (m - 1) + m - f; } else { ans = y + 3 * (m - 1) + m - f; } } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, m, t; vector<int> e[maxn]; vector<int> ans; stack<int> s; bool vis[maxn]; int dep[maxn]; int N; bool v[maxn]; int dfs(int x, int fr) { vis[x] = true; s.push(x); for (auto y : e[x]) { if (y == fr) continue; if (!vis[y]) { dep[y] = dep[x] + 1; dfs(y, x); dep[y] = 0; } else if (dep[y]) { if (dep[x] - dep[y] + 1 >= N) { printf( 2 n ); printf( %d n , dep[x] - dep[y] + 1); while (s.top() != y) { printf( %d , s.top()); s.pop(); } printf( %d n , s.top()); exit(0); } } } if (!v[x]) { for (auto y : e[x]) { v[y] = true; } ans.push_back(x); } s.pop(); return 0; } int read() { int x; scanf( %d , &x); return x; } int main() { int i, j; int x, y; n = read(); m = read(); N = sqrt(n); while (N * N < n) N++; for (i = 1; i <= m; i++) { x = read(); y = read(); e[x].push_back(y); e[y].push_back(x); } for (i = 1; i <= n; i++) { if (!vis[i]) { dep[i] = 1; dfs(i, -1); dep[i] = 0; } } printf( 1 n ); for (i = 1; i <= n; i++) { if (v[i]) continue; N--; printf( %d , i); if (!N) break; } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[110], mx; const int N = 30; map<int, int> mem; int Penu(int now) { if (!now || mem.find(now) != mem.end()) return mem[now]; register int ans = 0; register set<int> mex; for (register int i = 1; i < 31; i++) if (now >> i) mex.insert(Penu(now & ((1 << i) - 1) | (now >> i))); while (mex.count(ans)) ans++; return mem[now] = ans; } int ans; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n; mem[0] = 0; map<int, int> ma; for (register int i = 1, j; i <= n; i++) { cin >> j; for (register int r = 2, c = 0; r * r <= j; r++, c = 0) { while (!(j % r)) { c++; j /= r; } if (c) ma[r] |= (1 << c); } if (j > 1) ma[j] |= 2; } for (auto u : ma) ans ^= Penu(u.second); cout << (!ans ? Arpa n : Mojtaba n ); return 0; } |
#include<bits/stdc++.h> #define ll long long int #define ld long double #define pb push_back #define fi first #define se second #define all(x) x.begin(),x.end() #define mem(x,y) memset(x,y,sizeof(x)) #define pii pair<int,int> #define pll pair<ll,ll> #define INF 1e9+10 #define INFL 1e18 #define mod 1000000007 //#define mod 998244353 #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; ll power(ll x,ll n){ll res =1;while(n>0){if(n%2==1){res=res*x;}x=x*x;n=n/2;}return res;} ll powm(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} //cout<< fixed << setprecision(10) //__builtin_popcountll(); //|_2.4_|=2 int vis[500005]; vector<int>g[500005]; int lev[500005]; int ans[500005]; void bfs(int s) { queue<int>q; q.push(s); vis[s]=1; lev[s]=0; while(!q.empty()) { int x=q.front(); q.pop(); for(int i=0;i<g[x].size();i++) { if(vis[g[x][i]]==0) { lev[g[x][i]]=lev[x]+1; vis[g[x][i]]=1; q.push(g[x][i]); } } } } void dfs(int s) { vis[s]=1; for(auto x:g[s]) { if(lev[s]>=lev[x]) continue; dfs(x); ans[s]=min(ans[s],ans[x]); } } int main(){ fast; int T=1; cin>>T; while(T--) { int n,i,j,m; cin>>n>>m; vector<pii>v; for(i=0;i<m;i++) { int r,c; cin>>r>>c; v.pb({c,r}); } sort(all(v)); int l=0,r; if(m%2==1) { cout<< NO n ; continue; } for(i=0;i+1<m;i+=2) { if(v[i].fi==v[i+1].fi) { continue; } else { if(i+2<m&&v[i+1].fi==v[i+2].fi) { l=1; break; } if((v[i].se==v[i+1].se&&(v[i+1].fi-v[i].fi-1)%2==0)||(v[i].se!=v[i+1].se&&(v[i+1].fi-v[i].fi-1)%2==1)) { continue; } else { l=1; break; } } } if(l) { cout<< NO n ; } else { cout<< YES n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; string s, t; cin >> n >> s >> t; string ss = s, tt = t; sort(ss.begin(), ss.end()); sort(tt.begin(), tt.end()); if (ss != tt) cout << -1 << n ; else { vector<int> ans; for (int j = (int)(n - 1); j >= int(0); j--) { char target = t[j]; ; int pos = n - j - 1; ; while (target != s[pos]) pos++; ; ; ans.push_back(n); reverse(s.begin(), s.end()); ; ans.push_back(pos); string temp(s.begin() + n - pos, s.end()); reverse(temp.begin(), temp.end()); s.erase(s.begin() + n - pos, s.end()); s.insert(s.begin(), temp.begin(), temp.end()); ; ans.push_back(1); char c = s[n - 1]; s.erase(s.begin() + n - 1); s.insert(s.begin(), c); ; } cout << int((ans).size()) << n ; for (int i = 0; i < int(int((ans).size())); i++) { if (i) cout << ; cout << ans[i]; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000000000 + 7; long long int arr[200005]; int main() { ios::sync_with_stdio(0); cin.tie(0); long long int t; cin >> t; while (t--) { long long int n, sum = 0; cin >> n; for (long long int i = 0; i < n; i++) cin >> arr[i]; long long int i = 0; vector<long long int> vec; while (1) { long long int maxp = INT_MIN; long long int maxn = INT_MIN; for (; i < n; i++) { if (arr[i] < 0) break; else { maxp = max(maxp, arr[i]); } } if (maxp != INT_MIN) vec.push_back(maxp); if (i == n) break; for (; i < n; i++) { if (arr[i] >= 0) break; else { maxn = max(maxn, arr[i]); } } if (maxn != INT_MIN) vec.push_back(maxn); if (i == n) break; } for (long long int i = 0; i < vec.size(); i++) sum += vec[i]; cout << sum << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 5; int n, k, a[maxn], ans[maxn], pos[maxn]; class Node { public: int l, r; }; Node lis[maxn]; int main() { scanf( %d%d , &n, &k); for (int(i) = 0; (i) < (n); (i)++) { cin >> a[i + 1]; pos[a[i + 1]] = i + 1; lis[i + 1].l = i; lis[i + 1].r = i + 2; } int team = 1; for (int i = n; i >= 1; i--) { int p = pos[i]; if (ans[p] != 0) continue; ans[p] = team; for (int(j) = 0; (j) < (k); (j)++) { int el = lis[p].r; if (el != n + 1) { ans[el] = team; lis[lis[el].l].r = lis[el].r; lis[lis[el].r].l = lis[el].l; } else break; } for (int(j) = 0; (j) < (k); (j)++) { int el = lis[p].l; if (el != 0) { ans[el] = team; lis[lis[el].l].r = lis[el].r; lis[lis[el].r].l = lis[el].l; } else break; } lis[lis[p].l].r = lis[p].r; lis[lis[p].r].l = lis[p].l; if (team == 1) team = 2; else team = 1; } for (int(i) = 0; (i) < (n); (i)++) cout << ans[i + 1]; cout << endl; } |
#include <bits/stdc++.h> using namespace std; inline bool isLow(char ch) { return (ch >= a && ch <= z ); } inline bool isUpp(char ch) { return (ch >= A && ch <= Z ); } inline bool isDig(char ch) { return (ch >= 0 && ch <= 9 ); } inline bool are_equal(double a, double b) { return fabs(a - b) < numeric_limits<double>::epsilon(); } inline bool less_than(double a, double b) { return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * numeric_limits<double>::epsilon()); } inline bool greater_than(double a, double b) { return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * numeric_limits<double>::epsilon()); } template <typename T, typename... args> inline string arrStr(T arr, int n) { stringstream s; s << [ ; for (int i = 0; i < n - 1; i++) s << arr[i] << , ; s << arr[n - 1] << ] ; return s.str(); } inline void __evars_begin(int line) { cout << # << line << : ; } template <typename T> inline void __evars_out_var(vector<T> val) { cout << arrStr(val, val.size()); } template <typename T> inline void __evars_out_var(T *val) { cout << arrStr(val, 10); } template <typename T> inline void __evars_out_var(T val) { cout << val; } inline void __evars(vector<string>::iterator it) { cout << endl; } template <typename T, typename... Args> inline void __evars(vector<string>::iterator it, T a, Args... args) { cout << it->substr((*it)[0] == , it->length()) << = ; __evars_out_var(a); cout << ; ; __evars(++it, args...); } void in(int &n, int a[]) { cin >> n; for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i]; } void in(int &n, vector<int> &a) { cin >> n; a.resize(n); for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i]; } void out(int n, int a[]) { for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cout << a[i] << n [i + 1 == n]; } void out(vector<int> &a) { for (__typeof(a.size() - 1) i = (0); i <= (a.size() - 1); i++) cout << a[i] << n [i + 1 == a.size()]; } template <typename T> T power(T val, T p, T mod) { val %= mod; T result = 1; while (p > 0) { if (p & 0x1) result = (result * val) % mod; val = (val * val) % mod; p >>= 1; } return result; } vector<string> split(const string &s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.emplace_back(x); return move(v); } template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } template <typename T> T lcm(T a, T b) { return (a * b) / gcd(a, b); } template <typename T> string toString(T x) { stringstream ss; ss << x; return ss.str(); } template <typename T> T stringToT(string s, T a) { T p; istringstream ss(s); ss >> p; return p; } template <typename T> T SOD(T n) { __typeof(n) sum = 0, i = 1; for (; i * i <= n; i++) sum += (n % i) ? 0 : ((((i) * (i)) == n) ? i : i + n / i); return sum; } template <typename T, typename S> ostream &operator<<(ostream &os, const pair<T, S> &v) { os << ( << v.first << , << v.second << ) ; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &v) { for (auto it : v) os << it.first << : << it.second << n ; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; for (auto it : v) { os << it; if (it != *v.rbegin()) os << , ; } os << ] ; return os; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << [ ; for (int i = 0; i < v.size(); i++) { os << v[i]; if (i != (int)v.size() - 1) os << , ; } os << ] ; return os; } const int fx[] = {+1, -1, +0, +0}; const int fy[] = {+0, +0, +1, -1}; const int fx8[] = {+0, +0, +1, -1, -1, +1, -1, +1}; const int fy8[] = {-1, +1, +0, +0, +1, +1, -1, -1}; const int kx[] = {-2, -2, -1, -1, 1, 1, 2, 2}; const int ky[] = {-1, 1, -2, 2, -2, 2, -1, 1}; int Set(int N, int pos) { return N = N | (1 << pos); } int reset(int N, int pos) { return N = N & ~(1 << pos); } bool check(int N, int pos) { return (bool)(N & (1 << pos)); } const int mod = 1e9 + 7; const int mx = 2 * 100001; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long x, y; int cases, tc; cin >> tc; for (cases = 1; cases <= tc; cases++) { cin >> x >> y; long long d = x - y; if (d == 1) cout << NO n ; else cout << YES n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; template <class T> using V = vector<T>; template <typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >; 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; } long long int pom(long long int a, long long int n, int m) { long long int x = 1; for (a %= m; n; n /= 2) n& 1 ? x = x * a % m : 0, a = a * a % m; return x; } int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, -1, 0, 1}; int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1}; int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1}; long long int cmp1(pair<pair<long long int, long long int>, long long int> a, pair<pair<long long int, long long int>, long long int> b) { return a.first.second > b.first.second; } long long int cmp2(pair<long long int, long long int> a, pair<long long int, long long int> b) { if (a.second != b.second) return a.second < b.second; else return a.first > b.first; } int main(int argc, char* argv[]) { cin.tie(0); ios::sync_with_stdio(false); long long int T; cin >> T; while (T--) { long long int n; cin >> n; V<long long int> a(n + 1); for (long long int i = 0; i < n; i++) { cin >> a[i]; } long long int ans = 0; bool abc = 0; long long int cnt = 0; for (long long int i = 1; i < n; i++) { if (a[i - 1] == 1 && a[i] == 0) { abc = 1; cnt = 1; } else if (abc == 1 && a[i] == 0) { cnt++; } if (abc == 1 && (a[i] == 0 && a[i + 1] == 1 && i < n - 1)) { ans += cnt; cnt = 0; abc = 0; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double eps = 1e-6; const double PI = acos(-1); const double R = 0.57721566490153286060651209; const int maxn = 1005; struct Edge { int from, to, cap, flow, cost; Edge(int u, int v, int c, int f, int cc) : from(u), to(v), cap(c), flow(f), cost(cc) {} }; struct MCMF { int n, m; vector<Edge> edges; vector<int> G[maxn]; int inq[maxn]; int d[maxn]; int p[maxn]; int a[maxn]; void init(int n) { this->n = n; for (int i = 0; i <= n; ++i) G[i].clear(); edges.clear(); } void add(int from, int to, int cap, int cost) { edges.emplace_back(Edge(from, to, cap, 0, cost)); edges.emplace_back(Edge(to, from, 0, 0, -cost)); m = int(edges.size()); G[from].emplace_back(m - 2); G[to].emplace_back(m - 1); } bool spfa(int s, int t, int &flow, int &cost) { for (int i = 1; i <= n; ++i) d[i] = INF; memset(inq, 0, sizeof(inq)); d[s] = 0; inq[s] = 1; p[s] = 0; queue<int> q; a[s] = INF; q.push(s); while (!q.empty()) { int u = q.front(); q.pop(); inq[u] = 0; for (int i = 0; i < int(G[u].size()); ++i) { Edge &e = edges[G[u][i]]; if (e.cap > e.flow && d[e.to] > d[u] + e.cost) { d[e.to] = d[u] + e.cost; p[e.to] = G[u][i]; a[e.to] = min(a[u], e.cap - e.flow); if (!inq[e.to]) { q.push(e.to); inq[e.to] = 1; } } } } if (d[t] == INF) return false; flow += a[t]; cost += d[t] * a[t]; for (int u = t; u != s; u = edges[p[u]].from) { edges[p[u]].flow += a[t]; edges[p[u] ^ 1].flow -= a[t]; } return true; } int MincostMaxflow(int s, int t, int &cost) { int flow = 0; cost = 0; while (spfa(s, t, flow, cost)) ; return flow; } } mcmf; int n, m, mincost; void solve() { string S; cin >> S; cin >> n; map<int, int> num, mp[n + 1]; vector<int> a(n + 1); for (int i = 0; i < S.length(); i++) { num[S[i] - a + 1]++; } for (int i = 1; i <= n; i++) { string T; cin >> T >> a[i]; for (int j = 0; j < T.length(); j++) { mp[i][T[j] - a + 1]++; } } int s = 0, t = n + 26 + 1; mcmf.init(t); for (int i = 1; i <= 26; i++) { if (!num[i]) continue; mcmf.add(s, i, num[i], 0); for (int j = 1; j <= n; j++) { if (!mp[j][i]) continue; mcmf.add(i, j + 26, mp[j][i], j); } } for (int i = 1; i <= n; i++) { mcmf.add(i + 26, t, a[i], 0); } int maxflow = mcmf.MincostMaxflow(s, t, mincost); if (maxflow == S.length()) cout << mincost << n ; else cout << -1 << n ; } signed main() { ios_base::sync_with_stdio(false); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int OO = 0x3f3f3f3f, NegOO = -1 * OO, N = 1e6 + 5, mod = 1e9 + 7; long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } int main() { int t; cin >> t; while (t--) { int n, x, y, d; cin >> n >> x >> y >> d; if (x == y) { cout << 0 << n ; continue; } else if (x < y) { int mx = 1e9 + 5; int ans1 = mx, ans2 = mx, ans3 = mx; if ((y - x) % d == 0) ans1 = (y - x) / d; if ((y - 1) % d == 0) ans2 = (x - 1) / d + ((x - 1) % d != 0) + (y - 1) / d; if ((n - y) % d == 0) ans3 = (n - x) / d + ((n - x) % d != 0) + (n - y) / d; int ans = min(min(ans1, ans2), ans3); cout << ((ans != mx) ? ans : -1) << n ; } else { int mx = 1e9 + 5; int ans1 = mx, ans2 = mx, ans3 = mx; if ((x - y) % d == 0) ans1 = (x - y) / d; if ((y - 1) % d == 0) ans2 = (x - 1) / d + ((x - 1) % d != 0) + (y - 1) / d; if ((n - y) % d == 0) ans3 = (n - x) / d + ((n - x) % d != 0) + (n - y) / d; int ans = min(min(ans1, ans2), ans3); cout << ((ans != mx) ? ans : -1) << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> g[200000]; long long c[200000]; long long cnt; void dfs(long long v, long long p = -1) { cnt++; long long cnt1 = cnt; for (long long to : g[v]) { if (to != p) { dfs(to, v); } } c[v] = cnt - cnt1 + 1; } signed main() { long long t; cin >> t; for (long long q = 0; q < t; q++) { long long k; cin >> k; k *= 2; vector<pair<long long, long long>> edge; long long t[k]; for (long long i = 0; i < k - 1; i++) { long long a, b; cin >> a >> b >> t[i]; a--; b--; g[a].push_back(b); g[b].push_back(a); edge.push_back({a, b}); } dfs(0); long long mnsum = 0, mxsum = 0; for (long long i = 0; i < k - 1; i++) { long long c1 = min(c[edge[i].first], c[edge[i].second]); mnsum += c1 % 2 * t[i]; mxsum += min(c1, k - c1) * t[i]; } cout << mnsum << << mxsum << n ; for (long long i = 0; i < k; i++) { g[i].clear(); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 410; const int inf = 0x7fffffff; int a[maxn]; int n; int main() { int ans = inf; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 2; i <= n; i++) for (int j = i; j <= n; j++) { int x = a[i - 1] - 1, y = 0; for (int k = i; k <= j; k++) { int t = x / a[k]; y += t; x -= t * a[k]; } x = a[i - 1] - 1 - x + a[j]; y++; if (x < ans) { int o = x; for (int k = 1; k <= n; k++) { int t = x / a[k]; y -= t; x -= t * a[k]; } if (y < 0) ans = o; } } if (ans == inf) puts( -1 ); else printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int prime[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47}; int main() { int n; cin >> n; vector<int> res; int limit = 2 * n * n; for (int i = 0; i < 15; i++) { res.clear(); res.push_back(1); for (int j = 0; j <= i; j++) { int p = prime[j]; int sz = res.size(); for (int k = 0; k < sz; k++) { int x = res[k]; while (x * p <= limit) { x *= p; res.push_back(x); } } } if (res.size() >= n) { break; } } sort(res.begin(), res.end(), greater<int>()); for (int i = 0; i < n; i++) { cout << res[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const long long nax = 1e5 + 7; const long long mod = 1e9 + 7; const long long inf = numeric_limits<long long>::max(); long long n, m; bool check(vector<long long> &vec) { vector<long long> freq(n + 1, 0); for (long long i = 0; i < n; i++) { if (vec[i] > n) return false; freq[vec[i]]++; if (freq[vec[i]] > 1) { return false; } } for (long long i = 0; i < n; i++) { if (freq[i + 1] != 1) return false; } return true; } void test() { cin >> n; vector<long long> vec; vec.push_back(0); long long first = 0; for (long long i = 1; i < n; i++) { long long t; cin >> t; vec.push_back(vec.back() + t); first = min(first, vec.back()); } first = 1 - first; for (long long &x : vec) x += first; if (check(vec)) for (long long x : vec) cout << x << ; else cout << -1; } signed main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); long long T = 1; while (T--) { test(); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int test; cin >> test; while (test--) { int n; cin >> n; vector<vector<int>> v(n, vector<int>(n, 0)); for (int i = 0; i < n; i++) { v[i][i] = 1; v[(i + 1) % n][i] = 1; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cout << v[i][j] << ; cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; const long long int inf = (long long int)1e18 + 19; const long long int mod = (long long int)1e9 + 7; void cazz() { long long int t = 1, i; long double j, n; cin >> t; while (t--) { cin >> n; i = 3, j = -1; while (j < n) { j = (((long double)180 * (i - 2)) / i); i++; } if (j == n) { cout << YES n ; continue; } cout << NO n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cazz(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 1000 + 10; vector<int> vec[N]; vector<int> d[2]; bool mark[N]; void dfs(int v, int hh) { mark[v] = true; d[hh].push_back(v); for (int u : vec[v]) if (!mark[u]) dfs(u, 1 - hh); } int main() { int o; cin >> o; while (o--) { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) vec[i].clear(), mark[i] = false; ; d[0].clear(); d[1].clear(); for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; a--, b--; vec[a].push_back(b); vec[b].push_back(a); } dfs(0, 0); if ((int)d[0].size() > (int)d[1].size()) swap(d[0], d[1]); cout << (int)d[0].size() << endl; for (int a : d[0]) cout << a + 1 << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> const int inf = 1000000007; const double pi = 2 * acos(0.0); using namespace std; int gcd(int a, int b) { a = abs(a); b = abs(b); while (b) { a = a % b; swap(a, b); } return a; } int main() { map<long long, int> m; long long n, k; scanf( %lld%lld , &n, &k); long long arr[n]; for (long long i = 0; i < n; i++) { scanf( %lld , &arr[i]); m.insert(make_pair(arr[i], 1)); } vector<long long> ans; long long sum = 0; for (int i = 1; i < 1e9; i++) { if (sum > k) { ans.pop_back(); break; } if (m[i] != 1) { sum += i; ans.push_back(i); } } printf( %d n , ans.size()); for (long long i : ans) { printf( %d , i); } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 500005; int ult; int cont; int prim; char cad[MAXN]; bool Solve(int a, int n, int T) { int c = 0, time = 0; queue<int> s; prim = -1; for (int i = 0; i < n && c < cont; i++, time++) { if (cad[i] == H && a > 0) { c++; a--; if (prim == -1) prim = i; } else if (cad[i] == H ) { s.push(i); if (prim == -1) prim = i; } else if (cad[i] == S ) { a++; if (a >= s.size()) { if (!s.empty()) { int aux = abs(s.front() - i); time += aux; s.pop(); a--; c++; while (!s.empty()) { c++; a--; s.pop(); } if (c < cont) time += aux; } } } if (c == cont) ult = i; } time = min(time, ult + 1 + (ult - prim)); return (time <= T && c == cont); } int main() { int n; long long int T; scanf( %d %lld , &n, &T); scanf( n%s , cad); for (int i = 0; i < n; i++) if (cad[i] == H ) cont++; int ini = 0, fin = cont; while (ini < fin) { int med = (ini + fin) / 2; if (!Solve(med, n, T)) ini = med + 1; else fin = med; } if (Solve(ini, n, T)) printf( %d n , ini); else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, m, n, a[100400], t, w, q, sum = 0; char s[105000]; long double x, y; cin >> q; for (j = 0; j < q; j++) { cin >> n; cin >> s; if (n > 2) { cout << YES << endl; cout << 2 << endl; cout << s[0] << ; for (i = 1; i < n; i++) cout << s[i]; cout << endl; } else { if (s[0] - 0 < s[1] - 0 ) { cout << YES << endl; cout << 2 << endl; cout << s[0] << << s[1] << endl; } else cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) long long fact(int i) { if (i <= 1) return 1; else return i * fact(i - 1); } using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int arr[4]; for (int i = 0; i < 4; i++) { cin >> arr[i]; } int minus = arr[0] + arr[1]; string final[4]; if (minus % 2 == 0) { final[0] = Tidak ; final[1] = Tidak ; if (arr[2] == 0) { if (arr[1] == 0) { final[2] = Tidak ; } else { final[2] = Ya ; } } else { final[2] = Ya ; } if (arr[3] == 0) { if (arr[0] == 0) { final[3] = Tidak ; } else { final[3] = Ya ; } } else { final[3] = Ya ; } } else { final[2] = Tidak ; final[3] = Tidak ; if (arr[0] == 0) { if (arr[3] == 0) { final[0] = Tidak ; } else { final[0] = Ya ; } } else { final[0] = Ya ; } if (arr[1] == 0) { if (arr[2] == 0) { final[1] = Tidak ; } else { final[1] = Ya ; } } else { final[1] = Ya ; } } for (int i = 0; i < 4; i++) { cout << final[i] << ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<int> a; void SieveOfEratosthenes(int n) { bool prime[n + 1]; memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } for (int p = 2; p <= n; p++) if (prime[p]) a.push_back(p); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; SieveOfEratosthenes(100000); for (int i = 2; i <= n; i++) { for (int j = 0; j < a.size(); j++) { if (i % a[j] == 0) { cout << j + 1 << ; break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void mini(T& a, T b) { a = min(a, b); } template <class T> void maxi(T& a, T b) { a = max(a, b); } template <class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { return out << a.first << << a.second; } template <class T> ostream& operator<<(ostream& out, vector<T> a) { for (auto& i : a) out << i << ; return out; } template <class T> ostream& operator<<(ostream& out, set<T> a) { for (auto& i : a) out << i << ; return out; } template <class T> ostream& operator<<(ostream& out, multiset<T> a) { for (auto& i : a) out << i << ; return out; } template <class T1, class T2> ostream& operator<<(ostream& out, map<T1, T2> a) { for (auto& i : a) out << i << n ; return out; } template <class T1, class T2> ostream& operator<<(ostream& out, unordered_map<T1, T2> a) { for (auto& i : a) out << i << n ; return out; } template <class T> ostream& operator<<(ostream& out, queue<T> a) { while (!a.empty()) { cout << a.front() << ; a.pop(); } return out; } template <class T> ostream& operator<<(ostream& out, deque<T> a) { while (!a.empty()) { cout << a.front() << ; a.pop_front(); } return out; } template <class T> ostream& operator<<(ostream& out, priority_queue<T> a) { while (!a.empty()) { cout << a.top() << n ; a.pop(); } return out; } template <class T> void out(T a) { cout << a << endl; } template <class T1, class T2> void out(T1 a, T2 b) { cout << a << << b << endl; } template <class T1, class T2, class T3> void out(T1 a, T2 b, T3 c) { cout << a << << b << << c << endl; } void out() { cout << OK << endl; } template <class T> void sort(vector<T>& a) { sort(a.begin(), a.end()); } template <class T> void uniq(vector<T>& a) { sort(a); a.erase(unique(a.begin(), a.end()), a.end()); } template <class T> vector<T> set_int(vector<T> a, vector<T> b) { sort(a); sort(b); vector<T> res; set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res)); return res; } istream& operator>>(istream& in, __int128& a) { int64_t b; cin >> b; a = b; return in; } ostream& operator<<(ostream& out, const __int128 a) { unsigned __int128 b = a < 0 ? -a : a; char buf[128]; char* c = end(buf); do { --c; *c = 0123456789 [b % 10]; b /= 10; } while (b); if (a < 0) { --c; *c = - ; } int len = end(buf) - c; out.rdbuf()->sputn(c, len); return out; } const int N = 1e5 + 5; const int inf = 1e9; vector<int> dp, pr; vector<bool> used; vector<int> a[N]; void Solve() { int n, k; cin >> n >> k; int h = 5 * sqrt(k); int ans = 0; for (int i = 1; i <= k; i++) { int r, c; cin >> r >> c; if (n - r < h) a[c - 1].push_back(n - r); else ans += 3; } dp.resize(h, 0); pr.resize(h, 0); used.resize(h, 0); for (int i = n - 1; i >= 0; i--) { for (int j = 0; j <= h - 1; j++) used[j] = 0; for (int j : a[i]) used[j] = 1; for (int& j : dp) j = inf; int suf = 0; for (int j = h - 1; j >= 0; j--) { if (used[j]) suf += 3; int cur = suf + pr[max(j - 1, 0)]; mini(dp[j], cur); if (j) cur += 2 + j * (j + 1) / 2; mini(dp[0], cur); } for (int j = 0; j <= h - 2; j++) mini(dp[j + 1], dp[j]); swap(dp, pr); } ans += pr[0]; out(ans); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool comp(int a, int b) { return (a > b); } int main() { int a, b, n, l, t, m, x, ans, r; long long cek; scanf( %d %d %d , &a, &b, &n); for (int i = 1; i <= n; i++) { scanf( %d %d %d , &l, &t, &m); if (t < a + (long long)(l - 1) * b) printf( -1 n ); else { x = 1; ans = l; while (x > 0) { r = ans + x; cek = ((a + (long long)(r - 1) * b + a + (long long)(l - 1) * b) * (r - l + 1)) / 2; cek = max(cek / m + (cek % m == 0 ? 0 : 1), a + (long long)(r - 1) * b); if (cek <= t) ans += x, x *= 2; else x /= 2; } printf( %d n , ans); } } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.