func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { int i, c = 0, j, x = 0, n; cin >> n; string s; vector<string> ar; for (i = 0; i < n; i++) { cin >> s; ar.push_back(s); } for (i = 0; i < ar[0].length(); i++) { for (j = 0; j < n - 1; j++) { if (ar[j][i] != ar[j + 1][i]) { x = 1; break; } } if (x == 0) c++; else break; } cout << c; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = (int)((1e5) + 100); int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int max(int a, int b) { if (a > b) return a; else return b; } int min(int a, int b) { if (a < b) return a; else return b; } void pr(int x) { cout << x; } void prl(int x) { cout << x << n ; } template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const int N = 200 * 1000 + 11; void solve() { int q; cin >> q; std::vector<int> v(N); int left = 0, right = 0; for (int i = 0; i < q; ++i) { string x; cin >> x; int id; cin >> id; if (i == 0) { v[id] = left; left--; right++; } else { if (x == L ) { v[id] = left; left--; } else if (x == R ) { v[id] = right; right++; } else { cout << min(abs(v[id] - left), abs(v[id] - right)) - 1 << n ; } } } } signed main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); solve(); } |
#include <bits/stdc++.h> using namespace std; map<pair<int, long long>, int> dp; int n, s[1000010]; int calc(pair<int, long long> u) { if (dp.count(u) > 0) return dp[u]; if (u.first == 0) return dp[u] = 0; vector<bool> g(61); for (int i = 1; i <= u.first; ++i) { if (u.second & (1ll << i)) continue; g[calc({u.first - i, u.second | (1ll << i)})] = true; } int x = 0; while (g[x]) ++x; return dp[u] = x; } int main() { scanf( %d , &n); int ans = 0; for (int i = 0; i < n; ++i) { scanf( %d , &s[i]); ans = ans ^ calc({s[i], 0}); } printf( %s n , ans != 0 ? NO : YES ); return 0; } |
#include <bits/stdc++.h> using namespace std; int r[8192]; vector<int> g[8192]; int ans[8192] = { 0, }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; ans[0] = 1; for (int i = 0; i < 8192; i++) { g[i].push_back(0); } for (int i = 0; i < 8192; i++) { r[i] = 8192; } for (int i = 0; i < n; i++) { int x; cin >> x; for (const auto& key : g[x]) { int to = (key ^ x); ans[to] = 1; while (r[to] > x) { r[to]--; if (r[to] != x) g[r[to]].push_back(to); } } g[x].clear(); } int cnt = 0; for (int i = 0; i < 8192; i++) { cnt += ans[i]; } cout << cnt << n ; for (int i = 0; i < 8192; i++) { if (ans[i]) cout << i << ; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int h = 0; int start = 0; map<int, int> m; set<int> hash; for (int i = 0; i < s.size(); ++i) { int index = i; if (s[i] == > ) { for (int i = 0; i < 2 * h; ++i) { cout << ; } cout << s.substr(start, index - start + 1) << endl; hash.insert(index - 1); if (s[index - 2] != / ) { ++h; } start = index + 1; } else if (s[i] == / ) { --h; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; while (scanf( %d%d%d%d , &a, &b, &c, &d) != EOF) { if (d > 2 * c || d >= b || c > 2 * d) { printf( -1 n ); } else { printf( %d n%d n%d n , 2 * a, 2 * b, max(c, d)); } } 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; cin >> T; while (T--) { long long int x, y, z; cin >> x >> y >> z; long long int ans = 0; if (x == y || x == z || y == z) { if (x == y && z == y) { cout << YES << n << x << << x << << x << n ; ans = 1; } else if (x == z && y < x) { cout << YES << n << x << << y << << 1 << n ; ans = 1; } else if (y == z && x < y) { cout << YES << n << x << << 1 << << y << n ; ans = 1; } else if (x == y && z < x) { cout << YES << n << x << << z << << 1 << n ; ans = 1; } else if (ans == 0) cout << NO << n ; } else cout << NO << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long oo = 1e18; struct Data { long long v; int x, y; Data() {} Data(long long tv, int tx, int ty) { v = tv; x = tx; y = ty; } }; int a[2010], b[2010]; Data mp1[4000010], mp2[4000010]; long long gabs(long long x) { return x < 0 ? -x : x; } bool operator<(Data a, Data b) { return a.v < b.v; } int main() { int n; scanf( %d , &n); long long sa = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); sa += a[i]; } int m; scanf( %d , &m); long long sb = 0; for (int i = 1; i <= m; i++) { scanf( %d , &b[i]); sb += b[i]; } long long t0 = gabs(sa - sb); long long t1 = oo; int tx, ty; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (gabs(sa - sb - 2ll * (a[i] - b[j])) < t1) { t1 = gabs(sa - sb - 2ll * (a[i] - b[j])); tx = i; ty = j; } if (n == 1 || m == 1) { if (t0 <= t1) printf( %lld n0 n , t0); else printf( %lld n1 n%d %d n , t1, tx, ty); return 0; } long long t2 = oo; int tx1, ty1, tx2, ty2; int tot; for (int i = 1; i < m; i++) for (int j = i + 1; j <= m; j++) { mp1[++tot] = Data(2ll * (b[i] + b[j]), i, j); mp2[tot] = Data(-2ll * (b[i] + b[j]), i, j); } sort(mp1 + 1, mp1 + tot + 1); sort(mp2 + 1, mp2 + tot + 1); for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) { Data tmp1 = *lower_bound(mp1 + 1, mp1 + tot + 1, Data(-(sa - sb - 2ll * a[i] - 2ll * a[j]), 0, 0)); int pl1 = lower_bound(mp1 + 1, mp1 + tot + 1, Data(-(sa - sb - 2ll * a[i] - 2ll * a[j]), 0, 0)) - mp1; Data tmp2 = *lower_bound(mp2 + 1, mp2 + tot + 1, Data(sa - sb - 2ll * a[i] - 2ll * a[j], 0, 0)); int pl2 = lower_bound(mp2 + 1, mp2 + tot + 1, Data(sa - sb - 2ll * a[i] - 2ll * a[j], 0, 0)) - mp2; tmp2.v = -tmp2.v; Data tmp; if (pl1 <= tot && gabs(sa - sb - 2ll * a[i] - 2ll * a[j] + tmp1.v) < t2) { t2 = gabs(sa - sb - 2ll * a[i] - 2ll * a[j] + tmp1.v); tx1 = i; tx2 = j; ty1 = tmp1.x; ty2 = tmp1.y; } if (pl2 <= tot && gabs(sa - sb - 2ll * a[i] - 2ll * a[j] + tmp2.v) < t2) { t2 = gabs(sa - sb - 2ll * a[i] - 2ll * a[j] + tmp2.v); tx1 = i; tx2 = j; ty1 = tmp2.x; ty2 = tmp2.y; } } if (t0 <= t1 && t0 <= t2) printf( %lld n0 n , t0); else if (t1 <= t2) printf( %lld n1 n%d %d n , t1, tx, ty); else printf( %lld n2 n%d %d n%d %d n , t2, tx1, ty1, tx2, ty2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 5; long long a[N], dp[N]; long long n, k; long long check(long long m) { for (int i = 0; i < n; i++) { dp[i] = i - 1; for (int j = 0; j < i; j++) { if (abs(a[i] - a[j]) <= 1ll * (i - j) * m) { dp[i] = min(dp[i], dp[j] + i - j - 1); } } if (dp[i] + n - i <= k) { return true; } } return false; } int main() { cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } long long l = -1, r = 2e9; while (r - l > 1) { long long mid = (l + r) / 2; if (check(mid)) { r = mid; } else { l = mid; } } cout << r; } |
#include <bits/stdc++.h> using namespace std; const int c = 100002, k = 6; long long s[7], n, ans = 1e9, mini = 1e9, t[c]; priority_queue<pair<int, pair<int, int> > > q; void pb(int a, int b) { q.push({t[a] - s[b], {a, b}}); mini = min(mini, t[a] - s[b]); } int main() { ios_base::sync_with_stdio(false); for (int i = 1; i <= k; i++) cin >> s[i]; sort(s + 1, s + 7); cin >> n; for (int i = 1; i <= n; i++) { cin >> t[i]; pb(i, 1); } while (true) { long long f = q.top().first, id = q.top().second.first, pos = q.top().second.second; q.pop(); ans = min(ans, f - mini); if (pos == k) { break; } pb(id, pos + 1); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100006]; int main() { int n; while (scanf( %d , &n) != EOF) { if (n == 1) puts( 1 ); else if (n == 2) puts( -1 ); else { int delta = n; for (int i = 1; i <= n && delta > 0; i++) { if (i == 1) a[1] = 2; else if (i & 1) { a[i] = a[i - 1] - delta; } else a[i] = a[i - 1] + delta; if (delta == 3) delta = 2; else delta -= 2; } delta = n; int flag = 0; for (int i = n; i >= 1 && delta > 0; i--) { if (i == n) a[i] = n - 1; else if (flag == 0) { a[i] = a[i + 1] + delta; } else a[i] = a[i + 1] - delta; if (delta == 3) delta = 2; else delta -= 2; flag ^= 1; } flag = 1; for (int i = 1; i <= n; i++) { if (a[a[i]] != n - i + 1) { flag = 0; break; } } if (flag == 0) { puts( -1 ); continue; } for (int i = 1; i <= n; i++) printf(i == 1 ? %d : %d , a[i]); puts( ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; char a[53][53] = {5}; int ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { char x; cin >> x; if (x == a || x == f || x == c || x == e ) a[i][j] = x; } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { string c = ; c += a[i][j]; c += a[i][j + 1]; c += a[i + 1][j]; c += a[i + 1][j + 1]; sort(c.begin(), c.end()); if (c == acef ) ans += 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = (int)5e3 + 3; vector<int> g[maxN], p[maxN]; int u, v, cur_h[maxN], cnt, n; bool used[maxN], dp[maxN], ans[maxN]; void dfs(int v, int* cur_h) { used[v] = true; cur_h[v] = 1; for (int i = 0; i < (int)g[v].size(); ++i) { int to = g[v][i]; if (!used[to]) { p[v].push_back(to); dfs(to, cur_h); cur_h[v] += cur_h[to]; } } } void init_arrays() { memset(dp, 0, sizeof(bool) * maxN); memset(used, 0, sizeof(bool) * maxN); memset(cur_h, 0, sizeof(int) * maxN); } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; i < n - 1; ++i) { cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } init_arrays(); dfs(1, cur_h); dp[0] = 1; for (int i = 1; i <= n; ++i) { for (int k = 1; k <= n; ++k) dp[k] = 0; for (int j = 0; j < (int)p[i].size(); ++j) for (int k = n; k >= 0; --k) dp[k + cur_h[p[i][j]]] |= dp[k]; for (int k = n; k >= 0; --k) dp[k + n - cur_h[i]] |= dp[k]; for (int k = n; k >= 0; --k) ans[k] |= dp[k]; } --n; for (int i = 1; i < n; ++i) if (ans[i] == true) ++cnt; cout << cnt << endl; for (int i = 1; i < n; ++i) if (ans[i] == true) cout << i << << n - i << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mo = 998244353; const int M = (1 << 23) | 5; const int N = 50; int n, m, fa[N], e[N][N]; int sz[N], id[N]; int GG[M], cnt[M]; char s[N][N]; int get(int x) { return x == fa[x] ? x : fa[x] = get(fa[x]); } int main() { scanf( %d , &n); for (int i = (int)(1); i <= (int)(n); i++) fa[i] = i; for (int i = (int)(1); i <= (int)(n); i++) scanf( %s , s[i] + 1); for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(n); j++) if (s[i][j] == A ) fa[get(i)] = get(j); for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(n); j++) if (s[i][j] == X && get(i) == get(j)) return puts( -1 ), 0; for (int i = (int)(1); i <= (int)(n); i++) ++sz[get(i)]; for (int i = (int)(1); i <= (int)(n); i++) if (get(i) == i && sz[i] != 1) id[i] = ++m; if (!m) return printf( %d n , n - 1), 0; for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(n); j++) if (s[i][j] == X ) e[id[get(i)]][id[get(j)]] = 1; for (int i = (int)(1); i <= (int)(m); i++) for (int j = (int)(1); j <= (int)(m); j++) if (e[i][j]) GG[((1 << i) | (1 << j)) >> 1] = 1; for (int d = 1; d < 1 << m; d <<= 1) for (int i = 0; i < 1 << m; i += d << 1) for (int j = 0; j < d; j++) GG[i | j | d] |= GG[i | j]; for (int i = (int)(0); i <= (int)((1 << m) - 1); i++) cnt[i] = cnt[i / 2] ^ (i & 1); for (int i = (int)(0); i <= (int)((1 << m) - 1); i++) GG[i] = 1 - GG[i]; for (int d = 1; d < 1 << m; d <<= 1) for (int i = 0; i < 1 << m; i += d << 1) for (int j = 0; j < d; j++) GG[i | j | d] += GG[i | j]; for (int i = (int)(0); i <= (int)((1 << m) - 1); i++) cnt[i] = ((cnt[i] + m) & 1 ? mo - 1 : 1); for (int ans = 1;; ++ans) { int sum = 0; for (int i = (int)(0); i <= (int)((1 << m) - 1); i++) cnt[i] = 1ll * cnt[i] * GG[i] % mo; for (int i = (int)(0); i <= (int)((1 << m) - 1); i++) sum = (sum + cnt[i]) % mo; if (sum) return printf( %d n , n - 1 + ans), 0; } } |
#include <bits/stdc++.h> using namespace std; int stmp; const int MAXB = 100000; const int INF = 1000000001; int vis[MAXB + 1]; vector<int> arr; int k, n, maxb, t, _t; int z; inline int lis() { vector<int> L(z, INF); for (int s = 0; s < (t); ++s) { for (int i = 0; i < ((int)(arr).size()) && L.back() == INF; ++i) *lower_bound((L).begin(), (L).end(), arr[i]) = arr[i]; int c = 0; for (int i = 0; i < (((int)(arr).size())); ++i) if (arr[i] == L[s]) ++c; else arr[i - c] = arr[i]; arr.erase(arr.end() - c, arr.end()); } return find((L).begin(), (L).end(), INF) - L.begin(); } int main(int argc, char *argv[]) { stmp = scanf( %d %d %d %d , &k, &n, &maxb, &_t); for (int c = (1); c <= (k); ++c) { arr.resize(n); int rb = 0; for (int i = 0; i < (n); ++i) { stmp = scanf( %d , &arr[i]); if (vis[arr[i]] != c) ++rb; vis[arr[i]] = c; } arr.resize(unique((arr).begin(), (arr).end()) - arr.begin()); z = rb; t = min(_t, z); printf( %d n , t < z ? lis() : z); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long w, h, k, arr[4], brr[1000000], ans; cin >> w >> h; for (int i = 0; i < 4; i++) { cin >> k; for (int j = 0; j < k; j++) { cin >> brr[j]; } arr[i] = (brr[k - 1] - brr[0]); } arr[0] = max(arr[0], arr[1]); arr[2] = max(arr[2], arr[3]); ans = max(arr[0] * h, arr[2] * w); cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-8; const double PI = acos(-1); int n, k, b, c, t[N]; pair<int, int> a[N]; long long ans = INF; long long cnt = 0; priority_queue<pair<long long, int> > que; long long solve(pair<int, int> *a, long long b, long long c) { while (!que.empty()) que.pop(); cnt = 0; long long ans = INF, ret = 0; for (int i = 1; i <= k; i++) { ret += a[i].second * c; ret += (a[i].first - a[i - 1].first) * cnt * b; que.push(make_pair(c * a[i].second + (a[1].first - a[i].first) * b, i)); cnt++; } ans = min(ans, ret); for (int i = k + 1; i <= n; i++) { int p = que.top().second; que.pop(); cnt--; ret -= a[p].second * c; ret -= (a[i - 1].first - a[p].first) * b; ret += (a[i].first - a[i - 1].first) * cnt * b; ret += a[i].second * c; que.push(make_pair(c * a[i].second + (a[1].first - a[i].first) * b, i)); cnt++; ans = min(ans, ret); } return ans; } int main() { scanf( %d%d%d%d , &n, &k, &b, &c); for (int i = 1; i <= n; i++) scanf( %d , &t[i]), t[i] += 1000000000; sort(t + 1, t + 1 + n); for (int i = 1; i <= n; i++) a[i].first = t[i], a[i].second = 0; ans = min(ans, solve(a, c, 0)); for (int j = 0; j < 5; j++) { for (int i = 1; i <= n; i++) { a[i].second = ((j - (t[i] % 5)) + 5) % 5; a[i].first = (t[i] + a[i].second) / 5; } ans = min(ans, solve(a, b, c)); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], i; double ans = 0.0f; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); if (n % 2 == 0) { for (i = 0; i < n; i = i + 2) { ans = ans + ((a[i + 1] * a[i + 1]) - (a[i] * a[i])); } } else { ans = ans + a[0] * a[0]; for (i = 1; i < n; i = i + 2) { ans = ans + ((a[i + 1] * a[i + 1]) - (a[i] * a[i])); } } double pi = asin(1) * 2; cout << fixed << setprecision(10) << ans * pi << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int ans = min(a, min(b / 2, c / 4)); cout << ans + (2 * ans) + (4 * ans) << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1 << 17; int MAX[maxn << 1], lazy[maxn << 1], e[maxn]; void push_up(int now) { MAX[now] = max(MAX[now << 1], MAX[now << 1 | 1]); } void push_down(int now) { lazy[now << 1] += lazy[now]; lazy[now << 1 | 1] += lazy[now]; MAX[now << 1] += lazy[now]; MAX[now << 1 | 1] += lazy[now]; lazy[now] = 0; } void update(int now, int p, int L, int R, int l, int r) { if (R < l) return; if (R >= r) { MAX[now] += p; lazy[now] += p; return; } if (lazy[now]) push_down(now); int mid = (l + r) >> 1; update(now << 1, p, L, R, l, mid); update(now << 1 | 1, p, L, R, mid + 1, r); push_up(now); } int query(int now, int l, int r) { int mid = (l + r) >> 1; if (l == r) return l; if (lazy[now]) push_down(now); if (MAX[now << 1 | 1] > 0) return query(now << 1 | 1, mid + 1, r); else return query(now << 1, l, mid); } int main() { int m, pos, op, x; scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %d%d , &pos, &op); if (op == 1) { scanf( %d , &x); e[pos] = x; update(1, 1, 1, pos, 1, m); } else { update(1, -1, 1, pos, 1, m); } if (MAX[1] > 0) { printf( %d n , e[query(1, 1, m)]); } else puts( -1 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c = 0, n, t, i, j, flag = 0, sum, f; string s, s1, s2; cin >> t; while (t--) { cin >> n; c = 0, sum = 0, flag = 0, f = 0; int ara[n], ara1[n]; for (i = 0; i < n; i++) { cin >> ara[i]; } for (i = 0; i < n; i++) { cin >> ara1[i]; } for (i = 0; i < n; i++) { if (ara[i] != ara1[i]) { c = (ara1[i] - ara[i]); flag = 1; } if (flag) break; } for (i = 0; i < n; i++) { if (ara[i] == ara1[i]) sum++; else if (ara[i] < ara1[i] && f == 0) { if (ara[i] + c == ara1[i]) sum++; if (ara[i + 1] == ara1[i + 1]) f = 1; } } if (sum == n) cout << YES << n ; else cout << NO << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int s, k; cin >> k >> s; while (s >= 1) { for (int i = 1; i <= k; i++) { if (s >= i) { s = s - i; } else { cout << s << endl; return 0; } } } cout << s << endl; } |
#include <bits/stdc++.h> using namespace std; inline int Read() { char c = getchar(); int num = 0; while ( 0 > c || c > 9 ) c = getchar(); while ( 0 <= c && c <= 9 ) num = num * 10 + c - 0 , c = getchar(); return (num); } inline void Add(int &a, int b) { a = max(a, b); } int ans, n, m, f[2010][55][55], ln, s, p, a[2010], b[2010], ff[2010][55][55], sf[2010]; int main() { n = Read(), m = Read(), ln = Read(); s = Read(); for (int i = 1; i <= s; i++) a[Read()] = 1; p = Read(); for (int i = 1; i <= p; i++) b[Read()] = 1; for (int j = 0; j <= m; j++) for (int k = 0; k <= ln; k++) for (int l = 0; l <= ln; l++) f[j][k][l] = -1e9; f[0][0][0] = 0; for (int i = n; i; i--) sf[i] = sf[i + 1] + (a[i] || b[i]); for (int lst = 0, i = 0; i < n; i++) { int al = (n - i + ln) / ln; al *= 2; int low = max(0, m - al + 1); for (int j = lst; j < low; j++) for (int k = 0; k <= ln; k++) for (int l = 0; l <= ln; l++) ans = max(ans, f[j][k][l] + sf[i + 1]); for (int j = low; j <= m; j++) for (int k = 0; k <= ln; k++) for (int l = 0; l <= ln; l++) { ff[j][k][l] = f[j][k][l], f[j][k][l] = -1e9; } for (int j = low; j <= m; j++) { for (int k = 0; k < ln; k++) for (int l = 0; l < ln; l++) { int k_ = k, l_ = l; if (k_) k_--; if (l_) l_--; if (!k && a[i + 1] && j < m) Add(f[j + 1][ln - 1][l_], ff[j][k][l] + 1); if (!l && b[i + 1] && j < m) Add(f[j + 1][k_][ln - 1], ff[j][k][l] + 1); Add(f[j][k_][l_], ff[j][k][l] + ((k && a[i + 1]) || (l && b[i + 1]))); } } lst = low; } for (int t = 0; t <= m; t++) for (int i = 0; i <= ln; i++) for (int j = 0; j <= ln; j++) ans = max(ans, f[t][i][j]); printf( %d n , ans); } |
#include <bits/stdc++.h> char gb[65536], pb[65536], *gp = gb + 65536, *pp = pb, a[2][2005], s[2005]; int _5[65], n = 0, m = 0, f[2][2005][2005]; long long seed[2005]; inline void add(int &x, int y) { x += y; if (x >= 1e9 + 7) x -= 1e9 + 7; } inline int gline(char *b) { char c = getchar(); int len = 0; for (; !(((c)&64)); c = getchar()) ; for (; ((c)&64); b[++len] = c, c = getchar()) ; b[++len] = 0; return len - 1; } inline void init() { seed[0] = 1; for (int i = 1; i <= 2005; i++) seed[i] = seed[i - 1] * 31 % 19260817; } inline void reverse(char *str, int len) { if (!str) return; for (register int i = 0; i < (len >> 1); i++) { char temp = *(str + i); *(str + i) = *(str + len - 1 - i); *(str + len - 1 - i) = temp; } } struct hash { long long h[2005]; inline void make(int n, char *b) { h[0] = 0; for (register int i = 1; i <= n; i++) h[i] = (h[i - 1] * 31 + b[i] - a ) % 19260817; } inline void make_r(int n, char *b) { h[0] = 0; for (register int i = 1; i <= n; i++) h[i] = (h[i - 1] * 31 + b[n + 1 - i] - a ) % 19260817; } inline long long cut(int l, int r) { return (h[r] + 19260817 - h[l - 1] * seed[r - l + 1] % 19260817) % 19260817; } } pre[2], suf[2], ss; inline void __input() { n = gline(a[0]); pre[0].make(n, a[0]); suf[0].make_r(n, a[0]); n = gline(a[1]); pre[1].make(n, a[1]); suf[1].make_r(n, a[1]); m = gline(s); ss.make(m, s); } inline int solve(int flag) { int ret = 0; memset(f, 0, sizeof(f)); for (register int j = 1; j <= n; j++) { f[0][j][0] = f[1][j][0] = 1; for (int k = 2; k <= (((n - j + 1) < ((m >> 1))) ? (n - j + 1) : ((m >> 1))); k++) if (ss.cut(m - (k << 1) + 1, m - k) == pre[0].cut(j, j + k - 1) && ss.cut(m - k + 1, m) == suf[1].cut(n - (j + k) + 2, n - j + 1)) if ((k << 1) != m || flag) add(ret, f[0][j][m - (k << 1)]); for (int k = 2; k <= (((n - j + 1) < ((m >> 1))) ? (n - j + 1) : ((m >> 1))); k++) if (ss.cut(m - (k << 1) + 1, m - k) == pre[1].cut(j, j + k - 1) && ss.cut(m - k + 1, m) == suf[0].cut(n - (j + k) + 2, n - j + 1)) if ((k << 1) != m || flag) add(ret, f[1][j][m - (k << 1)]); for (int k = 2; k <= (((j) < ((m >> 1))) ? (j) : ((m >> 1))); k++) if (ss.cut(k + 1, (k << 1)) == pre[0].cut(j - k + 1, j) && ss.cut(1, k) == suf[1].cut(n - j + 1, n - (j - k))) if ((k << 1) != m || flag) add(f[0][j + 1][(k << 1)], 1); for (int k = 2; k <= (((j) < ((m >> 1))) ? (j) : ((m >> 1))); k++) if (ss.cut(k + 1, (k << 1)) == pre[1].cut(j - k + 1, j) && ss.cut(1, k) == suf[0].cut(n - j + 1, n - (j - k))) if ((k << 1) != m || flag) add(f[1][j + 1][(k << 1)], 1); for (int k = 0; k < m; k++) if (a[0][j] == s[k + 1]) { add(f[0][j + 1][k + 1], f[0][j][k]); if (k + 2 <= m && a[1][j] == s[k + 2]) add(f[1][j + 1][k + 2], f[0][j][k]); } for (int k = 0; k < m; k++) if (a[1][j] == s[k + 1]) { add(f[1][j + 1][k + 1], f[1][j][k]); if (k + 2 <= m && a[0][j] == s[k + 2]) add(f[0][j + 1][k + 2], f[1][j][k]); } add(ret, f[0][j + 1][m]); add(ret, f[1][j + 1][m]); } return ret; } int main() { init(); __input(); int register ans = 0; add(ans, solve(1)); if (m > 1) { reverse(s + 1, m); ss.make(m, s); add(ans, solve(0)); if (m == 2) for (int j = 1; j <= n; j++) for (int i = 0; i < 2; i++) if (a[i][j] == s[1] && a[i ^ 1][j] == s[2]) add(ans, 1e9 + 7 - 1); } printf( %d , ans); ; return 0; } |
#include <bits/stdc++.h> using namespace std; int m, n; int main() { cin >> n >> m; if (n == 1) { cout << 1; return 0; } if (m <= n - m) { cout << m + 1; return 0; } cout << m - 1; } |
#include <bits/stdc++.h> using namespace std; int const nMax = 40000; map<pair<int, int>, int> Q; int main() { int n; int ans = 0; scanf( %d , &n); pair<int, int> a; for (int i = 0; i < n; i++) { scanf( %d%d , &a.first, &a.second); if (Q.find(a) == Q.end()) { Q[a] = 1; } else { Q[a] = Q[a] + 1; } if (Q[a] > ans) ans = Q[a]; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; bool pd(complex<double> a, complex<double> b, complex<double> c, complex<double> d) { return imag((b - a) * conj(d - a)) * imag((b - a) * conj(c - a)) < -eps; } bool aa(complex<double> a, complex<double> b, complex<double> c) { complex<double> d = c; c = b + b - c; if (imag((c - a) / (b - a)) < 0) swap(b, c); double r = abs(b - c) / sin(arg((c - a) * conj(b - a))) / 2; double th = acos(abs(b - a) / 2 / r); complex<double> B = a + polar(r, arg(b - a) + th), A = a + a - B, C = b + b - B, D = d + d - C; double dd[4]; dd[0] = abs(A - B), dd[1] = abs(A - D), dd[2] = abs(C - D), dd[3] = abs(B - C); sort(dd, dd + 4); if ((fabs(dd[0] - dd[2]) < eps || fabs(dd[1] - dd[3]) < eps) && pd(A, C, B, D) && pd(B, D, A, C)) { puts( YES ); printf( %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf n , real(A), imag(A), real(D), imag(D), real(C), imag(C), real(B), imag(B)); return 1; } return 0; } int main() { int T; scanf( %d , &T); while (T--) { int x1, y1, x2, y2, x3, y3; scanf( %d%d%d%d%d%d , &x1, &y1, &x2, &y2, &x3, &y3); complex<double> a = complex<double>(x1, y1), b = complex<double>(x2, y2), c = complex<double>(x3, y3); if (aa(a, b, c)) continue; if (aa(a, c, b)) continue; if (aa(b, a, c)) continue; if (aa(b, c, a)) continue; if (aa(c, a, b)) continue; if (aa(c, b, a)) continue; puts( NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, r[500005]; int f[24][500005]; int Min[500005 * 8], key[500005]; void insert(int now, int l, int r, int pos, int val) { if (pos > r || pos < l) return; if (l == r) { Min[now] = l; key[l] = val; return; } int mid = (l + r) >> 1; insert(now << 1, l, mid, pos, val); insert(now << 1 | 1, mid + 1, r, pos, val); Min[now] = key[Min[now << 1]] < key[Min[now << 1 | 1]] ? Min[now << 1] : Min[now << 1 | 1]; } int Query(int now, int l, int r, int ql, int qr) { if (qr < ql) return 0; if (r < ql || l > qr) return 0; if (ql <= l && r <= qr) return Min[now]; int mid = (l + r) >> 1; int pos1 = Query(now << 1, l, mid, ql, qr), pos2 = Query(now << 1 | 1, mid + 1, r, ql, qr); return key[pos1] < key[pos2] ? pos1 : pos2; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &r[i]), r[i + n] = r[i]; memset(Min, 0, sizeof Min); memset(key, 0x3f, sizeof key); for (int i = 1; i <= 2 * n; i++) { int pos1 = Query(1, 1, 2 * n, max(max(1, i - r[i]), i - n + 1), i); f[0][i] = pos1; insert(1, 1, 2 * n, i, i - r[i]); } for (int j = 1; j < 24; j++) for (int i = 1; i <= 2 * n; i++) f[j][i] = f[j - 1][f[j - 1][i]]; long long ans = 0; for (int i = 2 * n; i > n; i--) { int u = i; for (int j = 24 - 1; j >= 0; j--) { if (f[j][u] - r[f[j][u]] > i - n + 1) u = f[j][u], ans += (1 << j); } if (u - r[u] <= i - n + 1) ans++; else ans += 2; } printf( %I64d , ans); } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[500050]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); int m = n; int res = 0; for (int i = n / 2; i >= 1; i--) { if (a[i] * 2 <= a[m]) { m--; res++; } } cout << n - res; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s; int dp[510][510]; bool has[510][510][30]; int dfs(int l, int r) { if (l >= r) return 0; int &ans = dp[l][r]; if (ans != 0) return ans; if (!has[l + 1][r][s[l] - a ]) return ans = dfs(l + 1, r); ans = dfs(l + 1, r); for (int i = l + 1; i <= r; i++) if (s[i] == s[l]) ans = max(ans, dfs(l + 1, i) + 1 + dfs(i + 1, r)); return ans; } int main() { cin >> n >> s; for (int i = 0; i < (int)s.size(); i++) for (int j = 0; j < (int)s.size(); j++) for (int k = i; k <= j; k++) has[i][j][s[k] - a ] = 1; cout << (int)s.size() - dfs(0, s.size() - 1) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool pal(string s) { string b = s; reverse(b.begin(), b.end()); return b == s; } int main() { string s; cin >> s; for (int i = 0; i <= s.size(); ++i) { for (char a = a ; a <= z ; ++a) { string b = s.substr(0, i) + a + s.substr(i); if (pal(b)) { cout << b << endl; return 0; } } } cout << NA << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e3 + 10; long double dp[MAXN][MAXN]; long long p[MAXN]; int main() { ios_base ::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); long long n, m; cin >> n >> m; long double res = 0; for (long long i = 1; i <= n; i++) { cin >> p[i]; } for (long long i = 1; i <= n; i++) { for (long long j = i + 1; j <= n; j++) { dp[i][j] = (p[j] < p[i]); } } for (long long i = 0; i < m; i++) { long long a, b; cin >> a >> b; if (a > b) { swap(a, b); } for (long long j = b + 1; j <= n; j++) { long double e = (dp[a][j] + dp[b][j]) / 2; dp[a][j] = e; dp[b][j] = e; } for (long long j = a - 1; j >= 1; j--) { long double e = (dp[j][a] + dp[j][b]) / 2; dp[j][a] = e; dp[j][b] = e; } for (long long j = a + 1; j < b; j++) { long double e = dp[a][j], f = dp[j][b]; dp[a][j] = (1 + e - f) / 2; dp[j][b] = (1 + f - e) / 2; } dp[a][b] = (long double)(1) / 2; } for (long long i = 1; i <= n; i++) { for (long long j = i + 1; j <= n; j++) { res += dp[i][j]; } } cout << res; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const int inf = 1001001001; const long long PRED = 2500000000; int n, a[111111], used[111111], ans, k; vector<int> v[111111], b[111111]; int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] == i) ans = i; } for (int i = 1; i <= n; i++) { if (used[i] == 0) { int poz = i; int f = 0; while (poz != i || f == 0) { f = 1; used[poz] = 1; v[k].push_back(a[poz]); poz = a[poz]; } b[v[k].size()].push_back(k); k++; } } if (b[1].size()) { printf( YES n ); for (int i = 1; i <= n; i++) { if (i != ans) printf( %d %d n , a[ans], a[i]); } return 0; } if (b[2].size()) { for (int i = 0; i < k; i++) { if (v[i].size() % 2 == 1) { cout << NO ; return 0; } } int q = b[2][0]; printf( YES n%d %d n , v[q][0], v[q][1]); for (int i = 0; i < k; i++) { if (i != q) { for (int j = 0; j < v[i].size(); j++) { if (j % 2 == 0) printf( %d %d n , v[q][0], v[i][j]); else printf( %d %d n , v[q][1], v[i][j]); } } } return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0; vector<pair<long long, long long> > v; cin >> n; for (int i = 0; i < n; i++) { long long a, b; cin >> a >> b; v.push_back(make_pair(a + b, a - b)); } sort(v.begin(), v.end()); long long last = -1e10; for (int i = 0; i < n; i++) if (v[i].second >= last) { ans++; last = v[i].first; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, arr[N]; long long k; int main() { cin >> n >> k; long long x = 1ll * n * (n + 1) / 2; if (k < x) return cout << -1, 0; long long rem = k - x; set<int> all; for (int i = 1; i <= n; ++i) all.insert(i); long long ans = x; for (int i = 1; i <= n; ++i) { if (!rem) { arr[i] = *all.begin(); all.erase(arr[i]); continue; } if (*all.rbegin() - i <= rem) { arr[i] = *all.rbegin(); ans += max(0, arr[i] - i); rem -= max(0, arr[i] - i); all.erase(arr[i]); } else { int x = *all.lower_bound(rem + i); arr[i] = x; ans += max(0, x - i); rem -= max(0, x - i); all.erase(x); } } cout << ans << endl; for (int i = 1; i <= n; ++i) printf( %d , i); puts( ); for (int i = 1; i <= n; ++i) printf( %d , arr[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 100005; vector<long long> male[3]; vector<long long> fe[3]; string ms[3] = { lios , etr , initis }; string fs[3] = { liala , etra , inites }; string s; long long n = 0; long long m = 0, f = 0; void check() { long long flag = 0; for (long long i = 0; i < 3; i++) { if (s.size() >= ms[i].size() && s.substr(s.size() - ms[i].size()) == ms[i]) { male[i].push_back(n); m = 1; flag = 1; } } for (long long i = 0; i < 3; i++) { if (s.size() >= fs[i].size() && s.substr(s.size() - fs[i].size()) == fs[i]) { fe[i].push_back(n); f = 1; flag = 1; } } if (!flag) { cout << NO ; exit(0); } } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; while (cin >> s) { check(); n++; } if (m && f) { cout << NO ; return 0; } long long req[n]; long long cur = 0, flag = 1; for (long long i = 0; i < 3; i++) { for (auto it : male[i]) { if (it != cur) { cout << NO ; return 0; } else cur++; } } for (long long i = 0; i < 3; i++) { for (auto it : fe[i]) { if (it != cur) { cout << NO ; return 0; } else cur++; } } if (n == 1) cout << YES ; else if (f && fe[1].size() != 1) cout << NO ; else if (m && male[1].size() != 1) cout << NO ; else cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long q, n, c[30], r, a[100001]; string s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == ) ) { c[1]--; if (c[1] < 0) c[2] += 2; } else c[1]++; } if (c[1] != 0) cout << -1; else cout << c[2]; } |
#include <bits/stdc++.h> using namespace std; const int K = 50; long long p[K], Rem[K], V, As, Aa, Ac, Topc; int q[K], k; long long IN() { int c, f; long long x; while (!isdigit(c = getchar()) && c != - ) ; c == - ? (f = 1, x = 0) : (f = 0, x = c - 0 ); while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - 0 ; return !f ? x : -x; } void DFS_C(long long a, int x, long long c) { if (c >= Topc) { long long S = V + a * (V / c + c); if (As == -1 || S < As) As = S, Aa = a, Ac = c; return; } else if (c * Rem[x] < Topc) return; if (x == k) return; for (int i = 0; i < q[x] + 1; i++) DFS_C(a, x + 1, c), c *= p[x]; } void DFS_A(int x, long long a) { if (a > 1e6 || a * a * a > V) return; if (x == k) { if (As != -1 && V / a + a * 2 * sqrt(V / a) >= As) return; V /= a, Topc = sqrt(V); DFS_C(a, 0, 1), V *= a; return; } int pre = q[x]; for (int i = 0; i < pre + 1; i++) DFS_A(x + 1, a), a *= p[x], q[x]--; q[x] = pre; } int main() { for (int T = IN(); T--;) { V = 1; As = -1; k = IN(); for (int i = 0; i < k; i++) { p[i] = IN(), q[i] = IN(); for (int j = 0; j < q[i]; j++) V *= p[i]; } Rem[k] = 1; for (int i = k - 1; ~i; i--) { Rem[i] = Rem[i + 1]; for (int j = 0; j < q[i]; j++) Rem[i] *= p[i]; } DFS_A(0, 1); printf( %I64d %I64d %I64d %I64d n , 2 * As, Aa, V / Aa / Ac, Ac); } } |
#include <bits/stdc++.h> using namespace std; string l, r; long long f[16][16][1 << 16]; long long g[16][16], h[16][16][16]; void init() { int m16 = (1 << 16) - 1; for (int j = 0; j < 16; ++j) f[1][j][j] = 1; for (int i = 1; i < 15; ++i) { for (int j = 0; j < 16; ++j) { for (int k = 0; k <= m16; ++k) if (f[i][j][k]) { for (int d = 0; d < 16; ++d) { int s = i < 4 ? (d << (i * 4)) : 0; f[i + 1][max(j, d)][k | s] += f[i][j][k]; } } } } for (int i = 1; i < 16; ++i) { for (int j = 0; j < 16; ++j) { for (int k = 0; k <= m16; ++k) { g[i][j] += f[i][j][k]; for (int l = 0; l < 16; ++l) if (k & (1 << l)) h[i][j][l] += f[i][j][k]; } } } } long long toInt(string x) { long long rr = 0; for (int i = 0; i < x.size(); ++i) { rr = rr * 16 + (x[i] <= 9 ? x[i] - 0 : x[i] - a + 10); } return rr; } vector<int> tmp, digits; long long bruteforce(long long x) { long long rr = 0; for (int i = 1; i <= x; ++i) { tmp.clear(); int v = 0; int j = i; while (j) { v = max(v, j % 16); j /= 16; } if (i & (1 << v)) ++rr; } return rr; } long long count2(int len, long long cur, int bitmax) { if (len <= 0) return (cur & (1 << bitmax)) ? 1 : 0; long long rr = 0; for (int j = 0; j < 16; ++j) { int k = max(j, bitmax), block = k / 4 + 1; if (len >= block) { rr += h[len][j][k]; } else if (cur & (1 << k)) rr += g[len][j]; } return rr; } long long count(long long x) { if (x <= 0) return 0; tmp.clear(); while (x) { tmp.push_back(x % 16); x /= 16; } int n = tmp.size(); long long rr = 0, cur = 0; int bitmax = -1; for (int i = n; i; --i) { for (int d = 0; d < tmp.back() + (i <= 1); ++d) { int v = max(bitmax, d); long long cmask = cur | ((1LL * d) << (4 * (i - 1))); rr += count2(i - 1, cmask, v); } bitmax = max(bitmax, tmp.back()); cur |= ((1LL * tmp.back()) << (4 * (i - 1))); tmp.pop_back(); } return rr; } int main() { ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); init(); int q; cin >> q; while (q--) { cin >> l >> r; cout << count(toInt(r)) - count(toInt(l) - 1) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void file() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } void fast() { ios::sync_with_stdio(0); cin.tie(0); } int main() { int n; cin >> n; int x[n], y[n], ind[n + 5]; for (int i = 0; i < n; i++) cin >> x[i], ind[x[i]] = i; for (int i = 0; i < n; i++) cin >> y[i]; int s = 0, j = 0; for (int i = 0; i < n; i++) { if (x[i - j] != y[i]) s += (n - ind[y[i]] - j), j++; } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10, INF = 1e9 + 10, mod = 1e9 + 7; const double eps = 1e-9; void chmax(int &a, int b) { a = (a > b ? a : b); } void chmin(int &a, int b) { a = (a < b ? a : b); } int sqr(int x) { return x * x; } int add(int x, int y) { if (x + y < 0) return x + y + mod; return x + y >= mod ? x + y - mod : x + y; } void add2(int &x, int y) { if (x + y < 0) x = x + y + mod; else x = (x + y >= mod ? x + y - mod : x + y); } int mul(int x, int y) { return 1ll * x * y % mod; } inline int read() { char c = getchar(); int x = 0, f = 1; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return x * f; } int N, a[MAXN], b[MAXN], c[MAXN], d[MAXN], vis[MAXN], dis[MAXN], pre[MAXN], da[MAXN], num; set<pair<int, int> > T[MAXN]; void Add(int x, int v, int id) { for (; x <= num; x += (x & (-x))) T[x].insert(make_pair(v, id)); } vector<int> Query(int p) { int x = a[p], y = b[p]; vector<int> res; for (; x; x -= (x & (-x))) { set<pair<int, int> > &now = T[x]; while (1) { set<pair<int, int> >::iterator it = now.lower_bound(make_pair(y, 0)); if (it == now.end()) break; res.push_back(it->second); now.erase(it); } } return res; } void Des() { sort(da + 1, da + num + 1); num = unique(da + 1, da + num + 1) - da - 1; for (int i = 1; i <= N; i++) { a[i] = num - (lower_bound(da + 1, da + num + 1, a[i]) - da) + 1; c[i] = num - (lower_bound(da + 1, da + num + 1, c[i]) - da) + 1; if (i != N) Add(c[i], d[i], i); } } void print(int t) { printf( %d n , dis[t]); for (int u = t; ~u; u = pre[u]) printf( %d , u); } void BFS() { queue<int> q; q.push(N); pre[N] = -1; dis[N] = 1; while (!q.empty()) { int p = q.front(); q.pop(); if (a[p] == num && !b[p]) { print(p); return; } vector<int> nxt = Query(p); for (int i = 0, t; i < nxt.size(); i++) { if (vis[nxt[i]]) continue; vis[nxt[i]] = 1; q.push(t = nxt[i]); dis[t] = dis[p] + 1, pre[t] = p; } } puts( -1 ); } signed main() { N = read(); bool flag = 0; for (int i = 1; i <= N; i++) { a[i] = read(), b[i] = read(), c[i] = read(), d[i] = read(); da[++num] = a[i]; da[++num] = c[i]; flag |= (!a[i] && !b[i]); } if (!flag) return puts( -1 ); Des(); BFS(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long double PI = 4 * atan((long double)1); const long long INF = 1e18; const long long NINF = -1e18; long long get_hash(string s) { long long N = 1000001; long long base[N], A = 11, MD = 1110111110111; base[0] = 1; for (long long i = (1); i < (N); ++i) base[i] = (base[i - 1] * A) % MD; long long hs = 0; for (long long i = (0); i < (s.size()); ++i) { hs += (s[i] * base[i]); hs %= MD; } return hs; } long long power(long long a, long long n) { long long res = 1; while (n) { if (n % 2) res *= a; a *= a; n /= 2; } return res; } vector<string> vec_splitter(string s) { s += , ; vector<string> res; while (!s.empty()) { res.push_back(s.substr(0, s.find( , ))); s = s.substr(s.find( , ) + 1); } return res; } void debug_out(vector<string> __attribute__((unused)) args, __attribute__((unused)) long long idx, __attribute__((unused)) long long LINE_NUM) { cerr << endl; } template <typename Head, typename... Tail> void debug_out(vector<string> args, long long idx, long long LINE_NUM, Head H, Tail... T) { if (idx > 0) cerr << , ; else cerr << Line( << LINE_NUM << ) ; stringstream ss; ss << H; cerr << args[idx] << = << ss.str(); debug_out(args, idx + 1, LINE_NUM, T...); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; string s; cin >> s; long long cnt = 0; for (long long i = (0); i < (s.size()); ++i) { if (s[i] == ( ) cnt++; } string s1; for (long long i = (0); i < (k - 1); ++i) { s1 += ( ; s1 += ) ; } for (long long i = (k - 1); i < (cnt); ++i) s1 += ( ; for (long long i = (k - 1); i < (cnt); ++i) s1 += ) ; vector<pair<long long, long long> > v; for (long long i = (0); i < (s.size()); ++i) { if (s[i] == s1[i]) continue; else { for (long long j = (i + 1); j < (s.size()); ++j) { if (s[j] == s1[i]) { reverse(s.begin() + i, s.begin() + j + 1); v.push_back({i + 1, j + 1}); break; } } } } cout << v.size() << n ; for (long long i = (0); i < (v.size()); ++i) { cout << v[i].first << ; cout << v[i].second << n ; } } return 0; } |
#include <bits/stdc++.h> class big_integer { public: big_integer(int32_t v) { if (v >= base) { data_.push_back(v % base); data_.push_back(v / base); } else { data_.push_back(v); } } void inc() { int32_t carry = 1; size_t ptr = 0; while (carry != 0 && ptr < data_.size()) { data_[ptr] += 1; if (data_[ptr] == base) { data_[ptr] -= base; } else { carry = 0; } ptr += 1; } if (carry != 0) { data_.push_back(carry); } } void mult2() { int32_t carry = 0; for (size_t i = 0; i < data_.size(); ++i) { data_[i] = data_[i] * 2 + carry; if (data_[i] >= base) { data_[i] -= base; carry = 1; } else { carry = 0; } } if (carry != 0) { data_.push_back(carry); } } void print(std::ostream& os) const { os << data_.back(); for (size_t i = data_.size() - 2; i < data_.size(); --i) { os << std::setw(9) << std::setfill( 0 ) << data_[i]; } } private: std::vector<int32_t> data_; static const int32_t base = 1000000000; big_integer() {} }; struct operation { std::string op; int32_t x; }; std::istream& operator>>(std::istream& is, operation& o) { return is >> o.op >> o.x; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); size_t n; std::cin >> n; std::vector<operation> ops(n); std::vector<size_t> poss(2001, n); for (size_t i = 0; i < n; ++i) { std::cin >> ops[i]; if (ops[i].op == sell ) { poss[ops[i].x] = i; } } std::vector<int32_t> used(n); big_integer result(0); for (int32_t i = 2000; i >= 0; --i) { result.mult2(); if (poss[i] == n) { continue; } size_t pos = poss[i]; while (pos < n) { if (used[pos] || (ops[pos].op == win && ops[pos].x == i)) { break; } pos -= 1; } if (pos < n && !used[pos]) { for (size_t j = pos; j <= poss[i]; ++j) { used[j] = 1; } result.inc(); } } result.print(std::cout); std::cout << n ; } |
#include <bits/stdc++.h> int main() { signed int n, i, j; scanf( %d , &n); signed int arr[n][3]; for (i = 0; i < n; i++) { scanf( %d %d %d , &arr[i][0], &arr[i][1], &arr[i][2]); } for (i = 0; i < n; i++) { int u; u = arr[i][1] < arr[i][2] ? arr[i][1] : arr[i][2]; int tot; tot = arr[i][0] - u + 1; printf( %d n , tot); } } |
#include <bits/stdc++.h> using namespace std; int n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; char ch; int FL = 0, LL = 0, FR = 0, LR = 0, CL = 0, CR = 0; for (int i = 1; i <= n; i++) { cin >> ch; if (ch != . ) { if (ch == L ) { CL++; if (FL == 0) { FL = i; } LL = i; } else { CR++; if (FR == 0) { FR = i; } LR = i; } } } if (CR == 0) { cout << LL << << FL - 1; } else if (CL == 0) { cout << FR << << LR + 1; } else { cout << FR << << LR; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxn = 2e5 + 5; void solve() { long long n, k; cin >> n >> k; long long arr[n]; for (long long int i = 0; i < n; i++) cin >> arr[i]; long long a; cin >> a; long long c[n]; for (long long int i = 0; i < n; i++) cin >> c[i]; long long ans = 0, f = 0; priority_queue<long long, vector<long long>, greater<long long> > pq; for (long long int i = 0; i < n; i++) { if (arr[i] <= k) { pq.push(c[i]); } else if (arr[i] > k) { pq.push(c[i]); long long gap = arr[i] - k; gap = ceil(gap * 1.0 / a); if (pq.size() >= gap) { while (gap--) { ans += pq.top(); pq.pop(); k += a; } } else { f = 1; break; } } } if (f) cout << -1 << n ; else cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; const long long M = 1e9 + 7; long long power(long long a, long long b) { long long result = 1; while (b > 0) { if (b % 2 == 1) { result *= a; } a *= a; b /= 2; } return result; } long long gcd(long long x, long long y) { long long r; while (y != 0 && (r = x % y) != 0) { x = y; y = r; } return y == 0 ? x : y; } long long countSetBits(long long x) { long long Count = 0; while (x > 0) { if (x & 1) Count++; x = x >> 1; } return Count; } bool isPerfectSquare(long long n) { long long sr = sqrt(n); if (sr * sr == n) return true; else return false; } long long mod(long long x) { return ((x % M + M) % M); } long long add(long long a, long long b) { return mod(mod(a) + mod(b)); } long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); } long long powerM(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) { res = mul(a, res); } a = mul(a, a); b /= 2; } return res; } long long modInverse(long long n) { return powerM(n, M - 2); } long long nCrM(long long n, long long r) { if (n < r) return 0; if (r == 0) return 1; vector<long long> fact(n + 1); fact[0] = 1; for (long long i = 1; i <= n; i++) { fact[i] = mul(fact[i - 1], i); } return mul(mul(fact[n], modInverse(fact[r])), modInverse(fact[n - r])); } void solve() { string s, t; cin >> s >> t; map<char, long long> m1; map<char, long long> m2; long long y = 0; long long w = 0; for (long long i = 0; i < s.length(); i++) { m1[s[i]]++; } for (long long i = 0; i < t.length(); i++) { m2[t[i]]++; } for (auto it = m1.begin(); it != m1.end(); it++) { char c = it->first; if (m1[c] <= m2[c]) { y += m1[c]; m2[c] -= m1[c]; m1[c] = 0; } else if (m1[c] > m2[c]) { y += m2[c]; m1[c] -= m2[c]; m2[c] = 0; } } for (auto it = m1.begin(); it != m1.end(); it++) { char c = it->first; if (m1[c] > 0) { if (islower(c)) { char d = toupper(c); if (m2[d] != 0) w += min(m1[c], m2[d]); } else { char d = tolower(c); if (m2[d] != 0) w += min(m1[c], m2[d]); } } } cout << y << << w << n ; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; const double pi = acos(-1); const long long inf = 0x3f3f3f3f3f3f3f3f; const int INF = 0x3f3f3f3f; const int MAX = 2e5 + 10; const long long mod = 1e9 + 7; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int n; cin >> n; int sum1 = 0, sum2 = 0, sum = 0; for (int i = 1; i <= n; i++) { char c; cin >> c; if (c == - ) sum1++; else sum2++; if (sum1 > sum2) { sum1 = 0; sum2 = 0; sum = 0; } else sum = sum2 - sum1; } cout << sum; } |
#include <bits/stdc++.h> using namespace std; int l[200010], r[200010]; int main() { string s, t; cin >> s >> t; int n = s.size(), k = t.size(); if (s[0] == t[0]) l[0] = 1; if (s[n - 1] == t[k - 1]) r[n - 1] = 1; for (int i = 1; i < n; i++) { if (l[i - 1] < k && s[i] == t[l[i - 1]]) l[i] = l[i - 1] + 1; else l[i] = l[i - 1]; if (r[n - i] < k && s[n - i - 1] == t[k - r[n - i] - 1]) r[n - i - 1] = r[n - i] + 1; else r[n - i - 1] = r[n - i]; } int res = 0; for (int i = 0; i < n; i++) { if (l[i] == k) { res = max(res, n - i - 1); } if (r[i] == k) { res = max(res, i); } } int li = 0, ri = 0; while (li < n) { while (ri < n && r[ri] + l[li] >= k) ri++; ri--; res = max(ri - li - 1, res); li++; } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; long long power(long long x, long long y, long long M) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x) % M; y >>= 1; x = (x * x) % M; } return res % M; } long long power(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x); y >>= 1; x = (x * x); } return res; } const long long mxn = 1e6 + 6, mod = 1e9 + 7, inf = 1e18; long long t, casee = 1; void test_case() { long long n; cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) cin >> a[i]; vector<vector<long long>> possiblesubsetxor(8500, vector<long long>()); for (long long i = 0; i < 8500; i++) possiblesubsetxor[i].push_back(0); vector<long long> pos(8500, 0); vector<long long> help(8500, 8500); pos[0] = 1; help[0] = 0; for (long long i = 0; i < n; i++) { for (long long currxor : possiblesubsetxor[a[i]]) { long long newxor = currxor ^ a[i]; pos[newxor] = 1; if (a[i] < help[newxor]) { for (long long k = a[i] + 1; k < help[newxor]; k++) { possiblesubsetxor[k].push_back(newxor); } help[newxor] = a[i]; } } possiblesubsetxor[a[i]].clear(); } long long cnt = 0; for (long long i = 0; i < 8500; i++) cnt += pos[i]; cout << cnt << n ; for (long long i = 0; i < 8500; i++) { if (pos[i]) cout << i << ; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); t = 1; while (t--) { test_case(); casee++; } return 0; } |
#include <bits/stdc++.h> using namespace std; int gcf(int A, int B) { if (A < B) return gcf(B, A); else if (B == 0) return A; else return gcf(B, A % B); } int main() { int n, m; cin >> m >> n; bool A[m], B[n]; memset(A, 0, sizeof(A)); memset(B, 0, sizeof(B)); int x, y; cin >> x; for (int i = 0; i < x; i++) { int temp; cin >> temp; A[temp] = 1; } cin >> y; for (int i = 0; i < y; i++) { int temp; cin >> temp; B[temp] = 1; } for (int i = 0; i < 5000000; i++) { if (A[i % m] || B[i % n]) A[i % m] = B[i % n] = 1; } for (int i = 0; i < m; i++) { if (!A[i]) { cout << No ; return 0; } } for (int i = 0; i < n; i++) { if (!B[i]) { cout << No ; return 0; } } cout << Yes ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long m; long long a[100005], b[100005], c[100005], ans[100005]; bool prime[100005]; vector<long long> pvec; long long modpow(long long a, long long n) { if (n == 0) return 1; if (n % 2) { return ((a % 998244353) * (modpow(a, n - 1) % 998244353)) % 998244353; } else { return modpow((a * a) % 998244353, n / 2) % 998244353; } } int main(void) { ios::sync_with_stdio(0); cin.tie(0); for (int i = 2; i < 1005; i++) { if (prime[i]) continue; for (int j = 2 * i; j < 100005; j += i) prime[j] = true; } for (int i = 2; i < 100005; i++) { if (!prime[i]) pvec.push_back(i); } cin >> m; long long x, y; for (int i = 1; i <= m; i++) { cin >> x >> y; a[x] += y; b[x] += x * y % 998244353, b[x] %= 998244353; c[x] += x * x % 998244353 * y % 998244353, c[x] %= 998244353; } for (int i = 0; i < pvec.size(); i++) { long long p = pvec[i]; for (int j = 100004 / p; j >= 1; j--) { a[j] += a[j * p]; b[j] += b[j * p], b[j] %= 998244353; c[j] += c[j * p], c[j] %= 998244353; } } for (int i = 1; i <= 100000; i++) { long long sum = 0, mul, mul2; if (a[i] >= 2) { mul = c[i], mul2 = (a[i] - 1) % 998244353 * modpow(2, a[i] - 2) % 998244353; sum += mul * mul2 % 998244353, sum %= 998244353; } if (a[i] >= 3) { mul = b[i] * b[i] % 998244353 + 998244353 - c[i], mul %= 998244353; mul2 = (a[i] - 2) % 998244353 * modpow(2, a[i] - 3) % 998244353; sum += mul * mul2 % 998244353, sum %= 998244353; } if (a[i] >= 2) { mul = b[i] * b[i] % 998244353 + 998244353 - c[i], mul %= 998244353; mul2 = modpow(2, a[i] - 2); sum += mul * mul2 % 998244353, sum %= 998244353; } ans[i] = sum; } for (int i = 0; i < pvec.size(); i++) { long long p = pvec[i]; for (int j = 1; j <= 100004 / p; j++) { ans[j] += 998244353 - ans[j * p], ans[j] %= 998244353; } } cout << ans[1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int mini, c; const int MAXN = 2e3 + 3; long long dp[2][MAXN][MAXN]; long long go(int lft, int cur, bool f) { if (lft == 0 and !f) return 1; if (dp[f][lft][cur] != -1) return dp[f][lft][cur]; long long ret = 0; if (f) { if (mini >= 0 and lft >= c + cur) ret += go(lft, cur + c, false); if (ret >= MOD) ret -= MOD; if (mini < 0 and abs(mini) <= cur and lft >= c + cur) ret += go(lft, cur + c, false); if (ret >= MOD) ret -= MOD; if (lft) ret += go(lft - 1, cur + 1, f); if (ret >= MOD) ret -= MOD; if (cur != 0 and lft) ret += go(lft - 1, cur - 1, f); if (ret >= MOD) ret -= MOD; } else { if (cur != 0 and lft) ret += go(lft - 1, cur - 1, f); if (ret >= MOD) ret -= MOD; if (lft - 1 >= cur + 1 and lft) ret += go(lft - 1, cur + 1, f); if (ret >= MOD) ret -= MOD; } return dp[f][lft][cur] = ret; } int main() { int n, m; cin >> n >> m; string str; cin >> str; mini = 1e9; c = 0; for (int i = 0; i < ((int)str.size()); i++) { if (str[i] == ( ) ++c; else --c; mini = min(mini, c); } memset(dp, -1, sizeof(dp)); cout << go(n - m, 0, true) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int l, r, a; cin >> l >> r >> a; int mini = min(l, r); int maxi = max(l, r); int diff = maxi - mini; mini += (diff <= a) ? diff : a; a -= (diff <= a) ? diff : a; if (a & 1) a--; cout << 2 * min(mini, maxi) + a; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n; cin >> n; vector<long long int> vec(n); for (long long int i = 0; i < n; i++) { cin >> vec[i]; } long long int left = 0, right = 1e10; long long int ans = 0; while (left <= right) { long long int mid = (left + right) / 2; bool cool = 1; vector<long long int> dummy = vec; for (long long int i = n - 1; i >= 2; i--) { long long int x = dummy[i]; long long int y = dummy[i - 1]; long long int z = dummy[i - 2]; if (dummy[i] < mid) { cool = 0; break; } long long int extra = dummy[i] - mid; extra = min(extra, vec[i]); dummy[i] = mid; long long int remain = extra % 3; long long int v = extra / 3; dummy[i - 1] += v; dummy[i - 2] += 2 * v; remain = extra - 3 * v; } long long int val = *min_element(dummy.begin(), dummy.end()); if (val < mid) { right = mid - 1; } else { left = mid + 1; ans = mid; } } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long int T = 1; cin >> T; for (int t = 1; t <= T; t++) { solve(); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; string smallest(string s) { if (s.length() % 2 == 1) return s; string s1 = smallest(s.substr(0, s.length() / 2)); string s2 = smallest(s.substr(s.length() / 2)); if (s1 < s2) return s1 + s2; else return s2 + s1; } bool solve(string s1, string s2) { for (int i = 0; i < s1.length(); i++) if (s1[i] != s2[i]) return 0; return 1; } int main() { string s1, s2; cin >> s1 >> s2; s1 = smallest(s1); s2 = smallest(s2); if (solve(s1, s2)) cout << YES n ; else cout << NO n ; } |
#include <bits/stdc++.h> using namespace std; const int n = 2; struct Matrix { long long matrix[5][5]; }; Matrix unit; int m; long long cnt[1000005], MOD; void initUnit() { memset(unit.matrix, 0, sizeof(unit.matrix)); int i; for (i = 1; i <= n; i++) unit.matrix[i][i] = 1; } Matrix matrixMulti(Matrix x, Matrix y) { Matrix ret; int i, j, k; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { ret.matrix[i][j] = 0; for (k = 1; k <= n; k++) { ret.matrix[i][j] = (ret.matrix[i][j] + x.matrix[i][k] * y.matrix[k][j] % MOD) % MOD; } ret.matrix[i][j] = (ret.matrix[i][j] % MOD + MOD) % MOD; } } return ret; } Matrix matrixPow(Matrix x, long long k) { Matrix ret = unit; while (k) { if (k & 1) ret = matrixMulti(ret, x); x = matrixMulti(x, x); k >>= 1; } return ret; } long long mpow(long long a, long long p) { long long ret = 1; while (p) { if (p & 1) ret = (ret * a) % MOD; a = (a * a) % MOD; p = p >> 1; } return ret; } long long solve(long long minv, long long maxv, long long sum, long long k) { long long pw = mpow(3, k); long long ret = (2 * pw * sum % MOD - (pw - 1) * (minv + maxv) % MOD) % MOD; ret = (ret / 2) % MOD; return (ret % MOD + MOD) % MOD; } int main() { long long x, y, sum, minv, maxv; int i, j, k; initUnit(); while (scanf( %d%I64d%I64d%I64d , &m, &x, &y, &MOD) != EOF) { for (i = 1, sum = 0; i <= m; i++) { scanf( %I64d , &cnt[i]); sum += cnt[i]; } minv = cnt[1], maxv = cnt[m]; if (m == 1) { printf( %I64d n , sum % MOD); } else { MOD *= 2; sum = solve(minv % MOD, maxv % MOD, sum % MOD, x); Matrix mt; mt.matrix[1][1] = 0, mt.matrix[1][2] = mt.matrix[2][1] = mt.matrix[2][2] = 1; mt = matrixPow(mt, x); maxv = (mt.matrix[2][1] * cnt[m - 1] % MOD + mt.matrix[2][2] * cnt[m] % MOD) % MOD; sum = solve(minv % MOD, maxv % MOD, sum % MOD, y); MOD /= 2; printf( %I64d n , sum % MOD); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string ans; int maxScore = -99999999; for (int i = 0; i < n; i++) { string name; int pp, mm; cin >> name; cin >> pp >> mm; int score = pp * 100 - mm * 50; for (int j = 0; j < 5; j++) { int t; cin >> t; score += t; } if (score > maxScore) { maxScore = score; ans = name; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, ans, spe, a[100100], b[100100], c[100100], fa[100100 << 1]; char str[2]; map<pair<long long, long long>, bool> mm; long long ff(long long u) { return u == fa[u] ? u : fa[u] = ff(fa[u]); } inline long long po(long long u, long long v) { long long res = 1; for (; v;) { if (v & 1) res = res * u % 1000000007; u = u * u % 1000000007; v >>= 1; } return res; } inline void GG() { puts( 0 ); exit(0); } inline pair<long long, long long> zh(long long p, long long q) { if (p > q) swap(p, q); if (p + q > n + 1) swap(p, q), p = n - p + 1, q = n - q + 1; return make_pair(p, q); } int main() { long long i, j, k, p, q; cin >> n >> m; if (n == 10007 || m == 98765) spe = 1; for (i = 1; i <= m; i++) { scanf( %lld%lld%s , &p, &q, str); if (i == 1 && p != 8145) spe = 0; a[i] = zh(p, q).first; b[i] = zh(p, q).second; c[i] = (str[0] == x ? 0 : 1); if (mm.count(make_pair(a[i], b[i]))) if (mm[make_pair(a[i], b[i])] != c[i]) GG(); else mm[make_pair(a[i], b[i])] = c[i]; } for (i = 0; i <= n * 2 + 1; i++) fa[i] = i; for (i = 1; i <= m; i++) { p = b[i] - a[i] - 1, q = a[i] + b[i] - 1; if (c[i]) { if (p < 1) fa[ff(q)] = ff(n * 2 + 1), fa[ff(q + n)] = ff(0); else fa[ff(p)] = ff(q + n), fa[ff(p + n)] = ff(q); } else { if (p < 1) fa[ff(q)] = ff(0), fa[ff(q + n)] = ff(n * 2 + 1); else fa[ff(p)] = ff(q), fa[ff(p + n)] = ff(q + n); } } for (i = 1; i <= n; i++) if (ff(i) == ff(i + n)) GG(); if (ff(0) == ff(n * 2 + 1)) GG(); for (i = 0; i <= n * 2 + 1; i++) if (i == fa[i]) ans++; cout << po(2, (ans - 1) / 2); } |
#include <bits/stdc++.h> using namespace std; int main() { int pre = 0; char ch; while (scanf( %c , &ch) != EOF) { int x = ch, b[9]; if (x < 32 || x > 126) break; for (int j = 1; j <= 8; ++j) { b[j] = x % 2; x /= 2; } x = 0; for (int j = 1; j <= 8; ++j) { x = x * 2 + b[j]; } printf( %d n , (pre - x + 256) % 256); pre = x; } return 0; } |
#include <bits/stdc++.h> using namespace std; int id[200005], sz[200005]; vector<pair<int, int> > edges; int n, m, s1, s2, l1, l2; bool bad(int x) { return x == s1 || x == s2; } bool cmp(pair<int, int> p1, pair<int, int> p2) { bool b1 = bad(p1.first) || bad(p1.second); bool b2 = bad(p2.first) || bad(p2.second); if (b1 ^ b2) return b1 ? false : true; return p1 < p2; } int root(int x) { if (x == id[x]) return x; return id[x] = root(id[x]); } vector<pair<int, int> > ans; bool merge(int x, int y) { int xx = x, yy = y; x = root(x); y = root(y); if (x == y) return false; if (sz[x] < sz[y]) swap(x, y); id[y] = x; sz[x] += sz[y]; ans.push_back(make_pair(xx, yy)); return true; } int ok1[200005], ok2[200005]; int main() { ios::sync_with_stdio(false); scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) id[i] = i, sz[i] = 1, ok1[i] = ok2[i] = -1; for (int i = 0; i < m; i++) { int u, v; scanf( %d%d , &u, &v); edges.push_back(make_pair(u - 1, v - 1)); } scanf( %d%d%d%d , &s1, &s2, &l1, &l2); --s1; --s2; sort(edges.begin(), edges.end(), cmp); int ind = 0; while (ind < int(edges.size())) if (bad(edges[ind].first) || bad(edges[ind].second)) break; else merge(edges[ind].first, edges[ind].second), ind++; for (int i = ind; i < int(edges.size()); i++) { if (edges[i].first == s1) ok1[root(edges[i].second)] = edges[i].second; if (edges[i].second == s1) ok1[root(edges[i].first)] = edges[i].first; if (edges[i].first == s2) ok2[root(edges[i].second)] = edges[i].second; ; if (edges[i].second == s2) ok2[root(edges[i].first)] = edges[i].first; } int a = 0, b = 0, c = 0; for (int i = 0; i < n; i++) if (root(i) == i && i != s1 && i != s2) { if (ok1[i] != -1 && ok2[i] != -1) c++; else if (ok1[i] != -1) a++; else if (ok2[i] != -1) b++; else { puts( No ); return 0; } } if (a >= l1 || b >= l2) { puts( No ); return 0; } l1 -= a; l2 -= b; if (c + 1 > l1 + l2) { puts( No ); return 0; } for (int i = 0; i < n; i++) if (root(i) == i && i != s1 && i != s2) { if (ok1[i] != -1 && ok2[i] != -1) continue; else if (ok1[i] != -1) merge(s1, ok1[i]); else if (ok2[i] != -1) merge(s2, ok2[i]); else { puts( No ); return 0; } } int lst = -1; for (int i = 0; i < n; i++) if (root(i) == i && i != s1 && i != s2) { if (ok1[i] != -1 && ok2[i] != -1) { if (l1 > 1) merge(s1, ok1[i]), l1--, lst = 1; else merge(s2, ok2[i]), l2--, lst = 2; } } if (ok2[s1] != -1 && l1 >= 1 && l2 >= 1) merge(s1, s2); else if (lst == -1) { puts( No ); return 0; } else { for (int i = n - 1; i >= 0; i--) if (ok1[i] != -1 && ok2[i] != -1) { if (lst == 2 && l1 > 0) merge(s1, ok1[i]), l1--; else if (lst == 1 && l2 > 0) merge(s2, ok2[i]), l2--; else { puts( No ); return 0; } break; } } puts( Yes ); for (int i = 0; i < int(ans.size()); i++) printf( %d %d n , ans[i].first + 1, ans[i].second + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 500 + 20; int tav(long long n, long long k) { long long res = 1; while (k > 0) { if (k & 1) { res *= n; } n *= n; k /= 2; } return res; } vector<int> adj[MAX_N]; int dis[MAX_N][MAX_N], cnt[MAX_N][MAX_N], ans[MAX_N][MAX_N], e[MAX_N][MAX_N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dis[i][j] = 6e8 * (i != j); e[i][j] = 6e8; cnt[i][j] = 0; ans[i][j] = 0; } } for (int i = 0; i < m; i++) { long long u, v, w; cin >> v >> u >> w; u--; v--; dis[u][v] = w; dis[v][u] = w; e[u][v] = w; e[v][u] = w; } for (int k = 0; k < n; k++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); } } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (dis[i][j] == dis[i][k] + e[k][j]) { cnt[i][j]++; } } } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (dis[i][j] == dis[i][k] + dis[k][j]) { ans[i][j] += cnt[i][k]; } } } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (dis[i][j] >= 6e8) { cout << 0 ; } else { cout << ans[i][j] << ; } } } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) { int n; cin >> n; if (n == 2) { cout << 2 n1 2 n ; continue; } vector<pair<int, int>> ans; int cur = n; for (int i = n - 1; i >= 1; --i) { ans.push_back(make_pair(i, cur)); cur = (cur + i + 1) / 2; } cout << cur << n ; for (auto i : ans) cout << i.first << << i.second << n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void solve() { long long int n; cin >> n; vector<long long int> a(n); for (long long int i = 0; i < n; i++) { cin >> a[i]; } long long int mx = *max_element((a).begin(), (a).end()); long long int sum = accumulate((a).begin(), (a).end(), 0LL); if (mx > sum - mx || sum % 2 == 1) { cout << T << n ; } else { cout << HL << n ; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int T; cin >> T; for (long long int TT = 1; TT <= T; TT++) { solve(); } cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int nxt() { int x; scanf( %d , &x); return x; } int main() { mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n; cin >> n; vector<long long> ps; for (long long i = 2; i * i <= n; ++i) { if (n % i) { continue; } ps.push_back(i); while (n % i == 0) { n /= i; } } if (n > 1) { ps.push_back(n); } cout << (ps.size() == 1 ? ps[0] : 1) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; int p; cin >> n >> k >> p; long long ndiv2 = n / 2; long long ndiv2minus1 = n / 2 - 1; long long nminusk = n - k; for (int i = 0; i < p; i++) { long long x; scanf( %I64d , &x); printf( %c , ((((x == n) ? (n) : (1 + (x / 2) * ndiv2 - ((x - 1) / 2) * ndiv2minus1)) <= nminusk) ? ( . ) : ( X ))); } exit: return (0); } |
#include <bits/stdc++.h> using namespace std; typedef vector<vector<long long> > vvl; long long x, y, z, j, i, t, n, k, input, ans, flag, maxi, mini, a, b; int main() { cin >> n >> x; ans = 0; for (long long i = 1; i <= n; i++) { if (x % i == 0 && x / i <= n) ans++; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, r; cin >> n >> m >> r; int s[n], b[m]; for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < m; i++) cin >> b[i]; sort(s, s + n); sort(b, b + m); int x = r / s[0]; int remind = r % s[0]; int y = x * b[m - 1]; if (y + remind > r) cout << y + remind; else cout << r; } |
#include <bits/stdc++.h> const int N = 2e5 + 5; int n, i, j, x, sz[N], c[N], t, s; int main() { scanf( %d , &n); for (i = 1; i < n; i <<= 1, t++) ; for (i = 1; i <= n; i++) { scanf( %d , &x); c[i] += x; for (j = x + 1; j; j -= j & (-j)) c[i] -= sz[j]; for (j = x + 1; j <= n; j += j & (-j)) sz[j]++; } memset(sz, 0, sizeof(sz)); for (i = 1; i <= n; i++) { scanf( %d , &x); c[i] += x; for (j = x + 1; j; j -= j & (-j)) c[i] -= sz[j]; for (j = x + 1; j <= n; j += j & (-j)) sz[j]++; } for (i = n; i >= 1; i--) { c[i - 1] += c[i] / (n - i + 1); c[i] %= n - i + 1; } for (i = 1; i <= n; i++) { for (s = 0, j = t; j >= 0; j--) if ((s + (1 << j)) <= n && sz[s + (1 << j)] <= c[i]) c[i] -= sz[s += 1 << j]; printf( %d , s); for (j = s + 1; j <= n; j += j & (-j)) sz[j]--; } } |
#include <bits/stdc++.h> using namespace std; class Solution { public: long long solve(vector<int>& A) { int n = A.size(); int F = 0; for (int i = 0; i < n; ++i) { if (A[i] == -1) { F = i; break; } } if (F == n - 1) { return 0; } int m = 0; while (1 << m < n) { ++m; } vector<int> sums(m + 1, 0); for (int i = 0; i < m; ++i) { sums[i + 1] = sums[i] + (1 << (m - 1 - i)); } const long long INF = 1LL << 60; vector<long long> dp(m + 1, INF); vector<long long> ndp(dp); dp[0] = 0; for (int i = n - 1, cnt = 1; i > F; --i, ++cnt) { fill(ndp.begin(), ndp.end(), INF); for (int j = m; j >= 0; --j) { if (j + 1 <= m) { ndp[j + 1] = min(ndp[j + 1], dp[j] + A[i]); } if (sums[j] >= cnt) { ndp[j] = min(ndp[j], dp[j]); } } swap(ndp, dp); } auto res = *min_element(dp.begin(), dp.end()); return res; } }; int main(int argc, char** argv) { ios::sync_with_stdio(false); cin.tie(0); Solution sol; int n; cin >> n; vector<int> A(n); for (int i = 0; i < n; ++i) { cin >> A[i]; } cout << sol.solve(A) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, top, tot, ans[100005], in[200005], rtx; int col; struct column { vector<int> a; int id; friend bool operator<(column X, column Y) { return X.a[col] < Y.a[col]; } } empty; vector<column> b; vector<int> to[200005]; void toposort() { queue<int> que; for (int i = 0; i <= top; i++) if (in[i] == 0) { que.push(i); if (i < m) ans[++rtx] = i; } while (!que.empty()) { int cur = que.front(); que.pop(); tot++; for (int i = 0; i < to[cur].size(); i++) { in[to[cur][i]]--; if (in[to[cur][i]] == 0) { que.push(to[cur][i]); if (to[cur][i] < m) ans[++rtx] = to[cur][i]; } } } } int main() { cin >> n >> m; top = m - 1; for (int i = 1; i <= m; i++) { b.push_back(empty); b[i - 1].id = i - 1; } for (int i = 1, x; i <= n; i++) { for (int j = 0; j < m; j++) { cin >> x; b[j].a.push_back(x); } } for (int i = 0; i < n; i++) { col = i; sort(b.begin(), b.end()); vector<pair<int, int> > con; for (int j = 0; j < m; j++) if (b[j].a[i] != -1) { int l = j; while (j < m - 1 && b[j + 1].a[i] == b[j].a[i]) j++; con.push_back(make_pair(l, j)); } if (con.size() > 1) for (int j = 0; j < con.size(); j++) { if (j == 0) top++; if (j == con.size() - 1) { for (int k = con[j].first; k <= con[j].second; k++) { in[b[k].id]++; to[top].push_back(b[k].id); } } else { top++; for (int k = con[j].first; k <= con[j].second; k++) { in[top]++; in[b[k].id]++; to[b[k].id].push_back(top); to[top - 1].push_back(b[k].id); } } } } toposort(); if (tot < top) cout << -1; else for (int i = 1; i <= m; i++) cout << ans[i] + 1 << ; } |
#include <bits/stdc++.h> using namespace std; long long int a, b, c, d; int main() { cin >> a >> b >> c >> d; if (a + 8 * c >= b) cout << 0 ; else if (c > d) { int num = b - a - 8 * c, den = 12 * (c - d); cout << (num + den - 1) / den; } else cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int T; scanf( %d n , &T); for (int t = 0; t < T; t++) { string s; getline(cin, s); bool p = false; int prevZero = -1; for (int i = 0; i < s.size(); i++) { char c = s[i]; if (c == 0 ) { if (prevZero >= 0 && i - prevZero > 1) { cout << 2 << n ; p = true; break; } prevZero = i; } } if (!p) { if (prevZero == -1) { cout << 0 << n ; } else { cout << 1 << n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int p1[10][13], p2[10][13]; bool fl = false; int c1[10], c2[10]; int len, n, m; int sum = 0, ans; int main() { memset(c1, 0, sizeof(c1)); memset(c2, 0, sizeof(c2)); memset(p1, -1, sizeof(p1)); memset(p2, -1, sizeof(p2)); scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { int a, b; scanf( %d%d , &a, &b); p1[a][c1[a]++] = b; p1[b][c1[b]++] = a; } for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); p2[a][c2[a]++] = b; p2[b][c2[b]++] = a; } for (int i = 1; i <= 9; i++) { if (p1[i][0] == -1 || p2[i][0] == -1) { continue; } for (int j = 0; j < c1[i]; j++) { for (int k = 0; k < c2[i]; k++) { if (p1[i][j] == p2[i][k]) { continue; } for (int t = 0; t < c2[p1[i][j]]; t++) { if (p2[p1[i][j]][t] != -1 && p2[p1[i][j]][t] != i) { fl = true; break; } } for (int t = 0; t < c1[p2[i][k]]; t++) { if (p1[p2[i][k]][t] != -1 && p1[p2[i][k]][t] != i) { fl = true; break; } } if (fl) break; if (i != ans) sum++; ans = i; } if (fl) break; } } if (fl) { printf( -1 n ); } else { if (sum == 1) printf( %d n , ans); if (sum > 1) printf( 0 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int a[8][128]; int main() { cin.tie(0); cin.sync_with_stdio(0); int n, k; cin >> n >> k; for (int i = 1; i <= 4; ++i) for (int j = 1; j <= n; ++j) cin >> a[i][j]; vector<tuple<int, int, int>> ans; if (k == 2 * n) { for (int i = 1; i <= n; ++i) { if (a[1][i] == a[2][i]) { ans.emplace_back(a[1][i], 1, i); a[2][i] = 0; k--; } if (a[4][i] == a[3][i]) { ans.emplace_back(a[4][i], 4, i); a[3][i] = 0; k--; } if (a[2][i] == 0 || a[3][i] == 0) break; } if (ans.empty()) return cout << -1, 0; } vector<pair<int, int>> loop; loop.reserve(512); for (int i = 1; i <= n; ++i) loop.emplace_back(2, i); for (int i = n; i >= 1; --i) loop.emplace_back(3, i); int m = loop.size(); for (int i = 0; k > 0; i = (i + 1) % m) { int next = (i + 1) % m; auto [x1, y1] = loop[i]; auto [x2, y2] = loop[next]; int o = (x2 == 2 ? 1 : 4); if (a[o][y2] && a[x2][y2] == a[o][y2]) { ans.emplace_back(a[o][y2], o, y2); a[x2][y2] = 0; k--; } if (a[x1][y1] == 0 && 0 != a[x2][y2]) { ans.emplace_back(a[x2][y2], x1, y1); a[x1][y1] = a[x2][y2]; a[x2][y2] = 0; } if (ans.size() > 20000) return cout << -1, 0; } cout << ans.size() << n ; for (auto [a, b, c] : ans) cout << a << << b << << c << n ; } |
#include <bits/stdc++.h> using namespace std; const int M = 6e5 + 10, P = 490019; const double PI = acos(-1.0); int a[M << 1], b[M << 1], c[M << 1], pw[M], inv[M], C[M << 1], oo, n, m, cc, r[M << 1], N, l; struct cp { double x, y; cp(double _x = 0, double _y = 0) : x(_x), y(_y) {} } p[M << 1], q[M << 1], w[M << 1], x[M << 1], y[M << 1], u[M << 1], v[M << 1]; inline cp operator+(cp a, cp b) { return cp(a.x + b.x, a.y + b.y); } inline cp operator-(cp a, cp b) { return cp(a.x - b.x, a.y - b.y); } inline cp operator*(cp a, cp b) { return cp(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x); } inline cp operator!(cp a) { return cp(a.x, -a.y); } void fft(cp *a) { for (int i = (0); i <= (N - 1); ++i) if (i < r[i]) swap(a[i], a[r[i]]); for (int mid = 1; mid < N; mid <<= 1) for (int R = mid << 1, j = 0; j < N; j += R) { cp *l = a + j, *r = a + j + mid, y; for (int k = 0; k < mid; ++k, ++l, ++r) y = (*r) * w[N / 2 / mid * k], *r = *l - y, *l = *l + y; } } void conv(int *a, int *b, int *c, int n, int m) { cp _u(0.5, 0), _v(0, -0.5), I(0, 1); for (N = 1, l = 0; N < n + m; N <<= 1, ++l) ; for (int i = (0); i <= (N - 1); ++i) r[i] = i & 1 ? r[i ^ 1] | (1 << l - 1) : r[i >> 1] >> 1, w[i] = cp(cos(2 * PI * i / N), sin(2 * PI * i / N)), p[i] = cp(a[i] >> 15, a[i] & 0x7fff), q[i] = cp(b[i] >> 15, b[i] & 0x7fff); fft(p); fft(q); for (int i = (0); i <= (N - 1); ++i) { int j = i ? N - i : 0; cp k1 = (p[i] + !p[j]) * _u, k2 = (q[i] + !q[j]) * _u, b1 = (p[i] - !p[j]) * _v, b2 = (q[i] - !q[j]) * _v; x[j] = k1 * k2, y[j] = k1 * b2, u[j] = b1 * k2, v[j] = b1 * b2; } for (int i = (0); i <= (N - 1); ++i) p[i] = x[i] + y[i] * I, q[i] = u[i] + v[i] * I; fft(p); fft(q); for (int i = (0); i <= (N - 1); ++i) { long long x = (long long)(p[i].x / N + 0.5) % P, y = (long long)(p[i].y / N + 0.5) % P, u = (long long)(q[i].x / N + 0.5) % P, v = (long long)(q[i].y / N + 0.5) % P; c[i] = ((x << 30) + (y + u << 15) + v) % P; } } int main() { scanf( %d%d%d , &n, &m, &cc); pw[0] = inv[1] = 1; for (int i = (0); i <= (n - 1); ++i) scanf( %d , &oo), a[1ll * i * i % (P - 1)] += oo; for (int i = (0); i <= (m - 1); ++i) scanf( %d , &oo), b[1ll * i * i * i % (P - 1)] += oo; for (int i = (1); i <= (P - 1); ++i) pw[i] = 1ll * pw[i - 1] * cc % P; for (int i = (0); i <= (2 * P - 4); ++i) C[i] = 1ll * i * (i - 1) / 2 % (P - 1); for (int i = (2); i <= (P - 1); ++i) inv[i] = 1ll * (P - P / i) * inv[P % i] % P; for (int i = (0); i <= (P - 2); ++i) a[i] = 1ll * a[i] * inv[pw[C[i]]] % P, b[i] = 1ll * b[i] * inv[pw[C[i]]] % P; conv(a, b, c, P - 2, P - 2); long long ans = 0; for (int i = (0); i <= (2 * P - 4); ++i) ans += 1ll * c[i] * pw[C[i]] % P; printf( %lld n , ans % P); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2097152; const double pi = acos(-1); using cplx = complex<double>; const cplx I(0, 1); cplx omega[maxn + 1]; int a[maxn], cnt[maxn]; void prefft() { for (int i = 0; i <= maxn; ++i) omega[i] = exp(2 * pi * i / maxn * I); } void bin(vector<cplx> &a, int n) { vector<cplx> tmp(n); int lg = 0; while ((1 << lg) < n) ++lg; --lg; for (int i = 0; i < n; ++i) { int to = 0; for (int j = 0; (1 << j) < n; ++j) to |= (((i >> j) & 1) << (lg - j)); tmp[to] = a[i]; } for (int i = 0; i < n; ++i) a[i] = tmp[i]; } void fft(vector<cplx> &a, int n) { bin(a, n); for (int step = 2; step <= n; step <<= 1) { int to = step >> 1; for (int i = 0; i < n; i += step) { for (int k = 0; k < to; ++k) { cplx right = omega[maxn / step * k] * a[i + to + k]; a[i + to + k] = a[i + k] - right; a[i + k] += right; } } } } void ifft(vector<cplx> &a, int n) { fft(a, n); reverse(a.begin() + 1, a.end()); for (int i = 0; i < n; ++i) a[i] /= n; } int main() { prefft(); ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> a[i]; ++cnt[a[i]]; } ++m; int d = 1; while (d < m) d <<= 1; d <<= 1; vector<cplx> poly(d, 0); for (int i = 0; i < m; ++i) if (cnt[i] > 0) poly[i] = cplx(1, 0); fft(poly, d); for (int i = 0; i < d; ++i) poly[i] *= poly[i]; ifft(poly, d); for (int i = 1; i < m; ++i) { int c = round(poly[i].real()); if (c <= 0) continue; if (cnt[i] == 0) return cout << NO << endl, 0; cnt[i] = 0; } vector<int> ans; for (int i = 1; i < m; ++i) if (cnt[i]) ans.push_back(i); cout << YES << endl; cout << ans.size() << endl; for (int i : ans) cout << i << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; const int N = 2e5 + 10; const int M = 300; int a[N]; int b[N]; int typ[N]; int flag[N]; int root[N]; int tmp[N]; int q[N]; int qn; int find_root(int u) { if (u == root[u]) { return u; } root[u] = find_root(root[u]); return root[u]; } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d , typ + i); scanf( %d , a + i); scanf( %d , b + i); } int t = 0; set<pii> st; set<pii> cr; int last = 0; while (t < m) { for (int i = 1; i <= n; i++) { flag[i] = 0; root[i] = i; } for (int i = t; i < min(m, t + M); i++) { if (a[i] > b[i]) { swap(a[i], b[i]); } flag[a[i]] = 1; flag[b[i]] = 1; flag[a[i] + 1] = 1; flag[b[i] < n ? b[i] + 1 : 1] = 1; } qn = 0; for (int i = 1; i <= n; i++) { if (flag[i] == 1) { q[qn++] = i; } } int u, v, uu, vv; cr.clear(); for (auto r : st) { u = r.first; v = r.second; if (flag[u] && flag[v]) { cr.insert(pii(u, v)); continue; } u = find_root(u); v = find_root(v); root[u] = v; } for (int i = 0; i < qn; i++) { root[q[i]] = find_root(q[i]); } sort(q, q + qn, [&](int i, int j) { return root[i] < root[j]; }); for (int i = 0, j; i < qn; i = j) { j = i; while (j < qn && root[q[j]] == root[q[i]]) { tmp[q[j]] = q[i]; j++; } } for (auto r : cr) { uu = find_root(r.first); vv = find_root(r.second); root[uu] = vv; } for (int i = t; i < min(m, t + M); i++) { u = a[i]; v = b[i]; if (last) { u++; v < n ? v++ : v = 1; } if (u > v) { swap(u, v); } if (typ[i] == 1) { if (cr.count(pii(u, v))) { cr.erase(pii(u, v)); st.erase(pii(u, v)); for (int i = 0; i < qn; i++) { root[q[i]] = tmp[q[i]]; } for (auto r : cr) { uu = find_root(r.first); vv = find_root(r.second); root[uu] = vv; } } else { cr.insert(pii(u, v)); st.insert(pii(u, v)); u = find_root(u); v = find_root(v); root[u] = v; } } else { u = find_root(u); v = find_root(v); if (u == v) { putchar( 1 ); last = 1; } else { putchar( 0 ); last = 0; } } } t += M; } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, t; ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; while (t--) { int b, k; cin >> n >> b >> k; int arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; int flag = 1; for (i = 0; i < n - 1; i++) { if (arr[i] >= arr[i + 1]) { b += arr[i] - arr[i + 1] + min(k, arr[i + 1]); } else if (arr[i + 1] > arr[i] + k) { b -= arr[i + 1] - arr[i] - k; if (b < 0) { flag = 0; break; } } else { b += min(arr[i], arr[i] + k - arr[i + 1]); } } if (flag) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const double PI = acos(-1.); const double eps = 1e-9; char s[1000005]; char t[1000005]; int fs[11]; int ft[11]; int fx[11]; char y[1000005]; int main() { int i, j, k, _T; while (~scanf( %s%s , s, t)) { if (strcmp(s, 01 ) == 0 || strcmp(s, 10 ) == 0) { printf( 0 n ); continue; } memset(fs, 0, sizeof fs); memset(ft, 0, sizeof ft); for (i = 0; s[i]; i++) fs[s[i] - 0 ]++; for (i = 0; t[i]; i++) ft[t[i] - 0 ]++; int ls = strlen(s); int lt = strlen(t); for (int len = lt; len <= ls; len++) { char x[15]; memset(fx, 0, sizeof fx); memset(x, 0, sizeof x); sprintf(x, %d , len); int lx = strlen(x); for (i = 0; x[i]; i++) fx[x[i] - 0 ]++; int fail = 0; for (i = 0; i <= 9; i++) if (fs[i] < ft[i] + fx[i]) { fail = 1; } if (fail || ls - lx != len) continue; int flag = 0; for (i = 1; i <= 9; i++) flag |= fs[i] > fx[i] + ft[i]; if (t[0] == 0 && !flag) continue; if (!flag) { printf( %s , t); for (i = 0; i <= 9; i++) for (j = 0; j < fs[i] - fx[i] - ft[i]; j++) putchar( 0 + i); putchar( n ); break; } int id = 0, fi = -1; for (i = 1; i <= 9; i++) if (fs[i] > fx[i] + ft[i]) { fi = i; break; } fs[fi]--; y[id++] = 0 + fi; for (i = 0; i <= 9; i++) { if (t[0] == 0 + i) { int big = 0; for (j = 1; j < lt; j++) { if (t[j] != t[0]) { if (t[j] > t[0]) big = 1; break; } } if (!big) { for (j = 0; j < lt; j++) y[id++] = t[j]; } for (j = 0; j < fs[i] - fx[i] - ft[i]; j++) y[id++] = 0 + i; if (big) { for (j = 0; j < lt; j++) y[id++] = t[j]; } } else for (j = 0; j < fs[i] - fx[i] - ft[i]; j++) y[id++] = 0 + i; } int ly = id; fs[fi]++; id = lt; for (i = 0; i <= 9; i++) for (j = 0; j < fs[i] - fx[i] - ft[i]; j++) t[id++] = 0 + i; int uset = 0; for (i = 0; i < ly; i++) { if (y[i] != t[i]) { if (y[i] > t[i]) uset = 1; break; } } if (uset && t[0] != 0 ) { for (i = 0; i < ly; i++) putchar(t[i]); putchar( n ); } else { for (i = 0; i < ly; i++) putchar(y[i]); putchar( n ); } break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 5, nax = 1e6 + 5; char rodz[25]; int id[25]; int res[2 * nax]; int cob(int a) { if (a) return (a % 2 ? 1 : 0) + cob(a / 2); return 0; } int pro() { int n; cin >> n; vector<int> w; for (int _ = 1, _n = (n); _ <= _n; ++_) { int a; cin >> a; w.push_back(a); } sort(w.begin(), w.end()); reverse(w.begin(), w.end()); cin >> n; for (int i = 0, _n = (n); i < _n; ++i) cin >> rodz[i] >> id[i]; for (int m = 0, _n = (1 << n); m < _n; ++m) if (m) { int jed = cob(m), zer = n - jed; if (id[zer] == 1) { res[m] = -inf; if (rodz[zer] == p ) { for (int i = 0, _n = (n); i < _n; ++i) if (m & (1 << i)) res[m] = max(res[m], (res[m ^ (1 << i)] + w[i])); } else for (int i = 0, _n = (n); i < _n; ++i) if (m & (1 << i)) res[m] = max(res[m], (res[m ^ (1 << i)])); } else { res[m] = inf; if (rodz[zer] == p ) { for (int i = 0, _n = (n); i < _n; ++i) if (m & (1 << i)) res[m] = min(res[m], (res[m ^ (1 << i)] - w[i])); } else for (int i = 0, _n = (n); i < _n; ++i) if (m & (1 << i)) res[m] = min(res[m], (res[m ^ (1 << i)])); } } cout << res[(1 << n) - 1]; return 0; } int main() { ios_base::sync_with_stdio(0); int z = 1; for (int _ = 1, _n = (z); _ <= _n; ++_) pro(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); long long x; char c; long long pr = -1, pb = -1; long long lr = -1, lb = -1, lp = -1; long long ans = 0; long long mr = -1, mb = -1; for (int i = 0; i < n; i++) { scanf( %lld %c , &x, &c); x += (long long)1e10; if (c == P ) { if (lp == -1) { if (pr != -1) ans += x - pr; if (pb != -1) ans += x - pb; } else { if (lb != -1) mb = max(mb, x - lb); if (lr != -1) mr = max(mr, x - lr); long long dif = x - lp; if (lr == -1 && lb != -1) { ans += 2 * dif - mb; } else if (lr != -1 && lb == -1) { ans += 2 * dif - mr; } else if (lr != -1 && lb != -1) { ans += min(3 * dif - mr - mb, 2 * dif); } else { ans += dif; } } mb = mr = lb = lr = -1; lp = x; } else if (c == B ) { if (pb == -1) pb = x; if (mb == -1) mb = x - lp; else mb = max(mb, x - lb); lb = x; } else { if (pr == -1) pr = x; if (mr == -1) mr = x - lp; else mr = max(mr, x - lr); lr = x; } } if (lp == -1) { ans = lr - pr + lb - pb; } else { if (lb != -1) ans += lb - lp; if (lr != -1) ans += lr - lp; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000007; const long long int maxn = 500005; const long long int mm = 1e+18; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; int a[n], p[m]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> p[i]; bool temp = true; int count = 0; while (temp) { count = 0; for (int i = 0; i < m; i++) { int x = p[i], y; y = x - 1; if (a[y] > a[x]) { int str = a[x]; a[x] = a[y]; a[y] = str; count++; } } if (count == 0) temp = false; } count = 0; for (int i = 0; i < n - 1; i++) { if (a[i] > a[i + 1]) { count++; break; } } if (count > 0) { cout << NO << endl; } else cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) { return a; } return gcd(b, a % b); } long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long n, m; cin >> n >> m; long long ip[n + 10][m + 10]; long long dp1[n + 10][m + 10]; long long dp2[n + 10][m + 10]; long long dp3[n + 10][m + 10]; long long dp4[n + 10][m + 10]; long long answer = 0; for (long long i = 0; i < n + 10; i++) { for (long long j = 0; j < m + 10; j++) { dp1[i][j] = 0; dp2[i][j] = 0; dp3[i][j] = 0; dp4[i][j] = 0; } } for (long long i = 1; i < n + 1; i++) { for (long long j = 1; j < m + 1; j++) { cin >> ip[i][j]; } } for (long long i = 1; i < n + 1; i++) { for (long long j = 1; j < m + 1; j++) { dp1[i][j] = max(dp1[i - 1][j], dp1[i][j - 1]) + ip[i][j]; } } for (long long i = 1; i < n + 1; i++) { for (long long j = m; j >= 1; j--) { dp2[i][j] = max(dp2[i - 1][j], dp2[i][j + 1]) + ip[i][j]; } } for (long long i = n; i >= 1; i--) { for (long long j = 1; j < m + 1; j++) { dp3[i][j] = max(dp3[i + 1][j], dp3[i][j - 1]) + ip[i][j]; } } for (long long i = n; i >= 1; i--) { for (long long j = m; j >= 1; j--) { dp4[i][j] = max(dp4[i + 1][j], dp4[i][j + 1]) + ip[i][j]; } } for (long long i = 1; i < n + 1; i++) { for (long long j = 1; j < m + 1; j++) { if (i == 1 || i == n || j == 1 || j == m) { continue; } answer = max(answer, dp1[i - 1][j] + dp4[i + 1][j] + dp3[i][j - 1] + dp2[i][j + 1]); answer = max(answer, dp1[i][j - 1] + dp4[i][j + 1] + dp3[i + 1][j] + dp2[i - 1][j]); } } cout << answer; return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> pp[10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i, j, k, l, m, n, even1 = 0, odd1 = 0, count = 0, t, even2 = 0, odd2 = 0, even = 0, odd = 0; cin >> t; int a[t]; for (i = 0; i < t; i++) { cin >> a[i]; if (i % 2 == 0) { odd1 = odd1 + a[i]; } else { even1 = even1 + a[i]; } } for (i = 0; i < t; i++) { odd = even1 + odd2 - even2; even = odd1 + even2 - odd2; if (i % 2 == 0) { odd2 = odd2 + a[i]; even = even - a[i]; } else { even2 = even2 + a[i]; odd = odd - a[i]; } if (even == odd) count++; } cout << count << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int arr[n], brr[m], check[n], indexer = 0; for (int i = 0; i < n; i++) cin >> arr[i], check[i] = -2; for (int i = 0; i < m; i++) { cin >> brr[i]; for (int j = 0; j < n; j++) if (brr[i] == arr[j]) { check[indexer] = j; indexer++; } } sort(check, check + indexer); for (int j = 0; j < indexer; j++) { cout << arr[check[j]] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string name = 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 ; string test; int n; cin >> n; string t; while (n--) { cin >> t; test += t; test += ; } if (name.find(test) != std::string::npos) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct __TS { ~__TS() { cerr << Time elapsed: << clock() * 1.0 / CLOCKS_PER_SEC << endl; } } __ts; const int mod = 1e9 + 7; const int maxn = 1239; long long tp[maxn]; int main() { tp[0] = 1; for (int i = (int)(1); i < (int)(maxn); i++) { tp[i] = (2 * tp[i - 1]) % mod; } ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string x; cin >> x; int n = x.size(); long long ans = 0; for (int i = 0; i < (int)(n); i++) { if (x[i] == 0 ) continue; ans += tp[2 * (n - 1 - i) + i]; ans %= mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, maxn = 1000001; long long t[maxn]; void init() { for (int i = 0; i <= 1000000; i++) t[i] = (long long)i * i * i; } int main() { init(); int n, a, b; scanf( %d , &n); while (n--) { scanf( %d%d , &a, &b); long long c = (long long)a * b; int pos = lower_bound(t, t + maxn, c) - t; if ((long long)pos * pos * pos == c && a % pos == 0 && b % pos == 0) printf( Yes n ); else printf( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int cc[100002]; pair<int, int> in[100002]; vector<pair<int, int> > adj[100002]; int pos = 1; int l[100002], r[100002], label[100002]; long long d[100002]; void dfs(int node, int par, long long depth = 0) { l[node] = pos; d[node] = depth; int ch, w; for (pair<int, int> edge : adj[node]) { if (edge.first == par) { continue; } dfs(edge.first, node, depth + edge.second); } label[pos] = node; r[node] = pos++; } long long pen[100002]; void update(int ind, long long add) { while (ind < 100002) { pen[ind] += add; ind += ind & (-ind); } } long long query(int ind) { long long ret = 0; while (ind > 0) { ret = ret + pen[ind]; ind = ind & (ind - 1); } return ret; } pair<long long, int> seg[100002 * 4]; long long lazy[100002 * 4]; const long long inf = -4e18; void init(int pos, int l, int r) { lazy[pos] = 0; if (l == r) { seg[pos] = {d[label[l]], l}; return; } int mid = (l + r) / 2; init(pos * 2, l, mid); init(pos * 2 + 1, mid + 1, r); seg[pos] = max(seg[pos * 2], seg[pos * 2 + 1]); } void push(int pos, int l, int r) { if (lazy[pos] != 0) { seg[pos].first += lazy[pos]; if (l != r) { lazy[pos * 2] += lazy[pos]; lazy[pos * 2 + 1] += lazy[pos]; } lazy[pos] = 0; } } void update(int pos, int l, int r, int ql, int qr, long long val) { push(pos, l, r); if (r < ql || qr < l) { return; } if (ql <= l && r <= qr) { lazy[pos] = val; push(pos, l, r); return; } int mid = (l + r) / 2; update(pos * 2, l, mid, ql, qr, val); update(pos * 2 + 1, mid + 1, r, ql, qr, val); seg[pos] = max(seg[pos * 2], seg[pos * 2 + 1]); } pair<long long, int> query(int pos, int l, int r, int ql, int qr) { push(pos, l, r); if (r < ql || qr < l) { return {inf, 0}; } if (ql <= l && r <= qr) { return seg[pos]; } int mid = (l + r) / 2; return max(query(pos * 2, l, mid, ql, qr), query(pos * 2 + 1, mid + 1, r, ql, qr)); } long long w[100002]; long long dfs2(int node, int par) { priority_queue<long long> pq; for (pair<int, int> edge : adj[node]) { if (edge.first == par) { continue; } pq.push(dfs2(edge.first, node)); } long long ret = w[node]; if (node != 1) { if (pq.size() > 0) pq.pop(); } if (pq.size() > 0) { ret = max(ret, pq.top()); } return ret; } void solve() { int n; long long T; scanf( %d %lld , &n, &T); long long rb = 0; for (int i = 1; i <= n; ++i) { scanf( %d , &cc[i]); rb += cc[i]; } for (int i = 1; i <= n; ++i) { scanf( %d , &in[i].first); in[i].second = i; } sort(in + 1, in + n + 1); for (int i = 2; i <= n; ++i) { int p, l; scanf( %d %d , &p, &l); l *= 2; adj[p].push_back({i, l}); } dfs(1, 0); init(1, 1, n); for (int i = 1; i <= n; ++i) { int node, co, p, x, y; node = in[i].second; co = cc[node]; p = r[node]; x = l[node], y = p; long long val = (long long)co * in[i].first; while (true) { pair<long long, int> q = query(1, 1, n, x, y); if (q.first + val >= T) { long long remCC = min((T - q.first) / in[i].first, (long long)co); w[label[q.second]] = query(q.second) + remCC; update(1, 1, n, q.second, q.second, inf); } else { break; } } update(1, 1, n, x, y, val); update(x, co); update(y + 1, -co); } while (true) { pair<long long, int> q = query(1, 1, n, 1, n); if (q.first < 0) { break; } w[label[q.second]] = query(q.second); update(1, 1, n, q.second, q.second, inf); } printf( %lld n , dfs2(1, 0)); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int pre[N], n, m; int f(int x) { return pre[x] == x ? x : pre[x] = f(pre[x]); } set<int> s[N]; map<int, vector<int> > v[N]; void join(int x, int y) { x = f(x); y = f(y); if (x == y) return; if (s[x].size() < s[y].size()) swap(x, y); set<int>::iterator it = s[y].begin(); for (; it != s[y].end(); ++it) s[x].insert(*it); pre[y] = x; } void add() { int x, y, z; scanf( %d %d %d , &x, &y, &z); s[f(x)].insert(y); s[f(y)].insert(x); v[x][z].push_back(y); join(y, v[x][z][0]); v[y][z].push_back(x); join(x, v[y][z][0]); } void query() { int x, y; scanf( %d %d , &x, &y); if (f(x) == f(y) || s[f(x)].count(y)) printf( Yes n ); else printf( No n ); } signed main() { char opt[10]; int c, q; scanf( %d %d %d %d , &n, &m, &c, &q); for (register int i = (1); i <= (n); ++i) pre[i] = i; for (register int i = (1); i <= (m); ++i) add(); for (register int i = (1); i <= (q); ++i) { scanf( %s , opt); if (opt[0] == + ) add(); else query(); } 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 n; cin >> n; long long i; if (n == 1) cout << 1; else { long long sum = 1; for (i = 1;; i++) { sum += (1ll << i); if (sum >= n) break; } cout << i + 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr long long R = 1e3 + 69, INF = 2e9 + 6969, mod = 998244353; long long n, a[R], dp[R], fact[R], rev[R]; long long choose(long long N, long long K) { long long cur = (fact[N] * rev[K]) % mod; cur = (cur * rev[N - K]) % mod; return cur; } long long Pow(long long a, long long p) { long long w = 1; while (p) { if (p & 1) w = (w * a) % mod; a = (a * a) % mod; p >>= 1; } return w; } int main() { scanf( %lld , &n); for (int i = 0; i < n; ++i) scanf( %lld , &a[i]); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = (i * fact[i - 1]) % mod; rev[n] = Pow(fact[n], mod - 2); for (int i = n - 1; i >= 0; --i) rev[i] = (rev[i + 1] * (i + 1)) % mod; dp[n] = 1; for (int i = n - 1; i >= 0; --i) { if (a[i] <= 0 || a[i] + i >= n) continue; for (int j = i + a[i] + 1; j <= n; ++j) { dp[i] += (dp[j] * choose(j - i - 1, a[i])) % mod; dp[i] %= mod; } } long long sum = 0; for (int i = 0; i < n; ++i) sum = (sum + dp[i]) % mod; printf( %lld n , sum); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, h, a, b, k; cin >> n >> h >> a >> b >> k; for (long long int i = 0; i < k; i++) { long long int t1, f1, t2, f2; cin >> t1 >> f1 >> t2 >> f2; long long int ans; if (t1 == t2) { cout << abs(f1 - f2) << endl; continue; } if (a <= f1 && f1 <= b) { cout << abs(t1 - t2) + abs(f1 - f2) << endl; continue; } long long int temp; if (abs(f1 - a) <= abs(f1 - b)) { temp = a; ans = abs(f1 - a); } else { temp = b; ans = abs(f1 - b); } ans = ans + abs(t1 - t2) + abs(temp - f2); cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using pii = pair<int, int>; constexpr auto MOD = 1000000007LL; constexpr auto LINF = (1LL << 60); constexpr auto INF = 2147483647LL; constexpr auto PI = 3.1415926535897932384626433; constexpr auto EPS = 1E-9; template <typename T1, typename T2> ostream &operator<<(ostream &out, const pair<T1, T2> p) { out << p.first << << p.second; return out; } template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &x : v) in >> x; return in; } template <typename T> ostream &operator<<(ostream &out, vector<T> v) { for (int i = 0; i < v.size(); i++) out << v[i] << (i + 1 == v.size() ? n : ); out.flush(); return out; } struct Node { int l, r; int emp; ll end; Node() {} } T[1000010 << 2]; void maintain(int id) { ll ext = max(0LL, T[id << 1].end - T[id << 1 | 1].l); T[id].emp = T[id << 1].emp + max(0LL, T[id << 1 | 1].emp - ext) + max(0LL, T[id << 1 | 1].l - T[id << 1].end); T[id].end = max(0LL, ext - T[id << 1 | 1].emp) + T[id << 1 | 1].end; return; } void build(int id = 1, int l = 0, int r = 1e6) { T[id].l = l; T[id].r = r; T[id].emp = 0; T[id].end = l; if (l + 1 == r) { return; } build(id << 1, l, l + r >> 1); build(id << 1 | 1, l + r >> 1, r); return; } void add(int t, int d, int id = 1, int l = 0, int r = 1e6) { if (t >= r || l > t) return; if (l + 1 == r) { T[id].emp = 0; T[id].end = t + d; return; } add(t, d, id << 1, l, l + r >> 1); add(t, d, id << 1 | 1, l + r >> 1, r); maintain(id); return; } void rem(int t, int id = 1, int l = 0, int r = 1e6) { if (t >= r || l > t) return; if (l + 1 == r) { T[id].emp = 0; T[id].end = l; return; } rem(t, id << 1, l, l + r >> 1); rem(t, id << 1 | 1, l + r >> 1, r); maintain(id); return; } void ask(int t, ll &res, int id = 1, int l = 0, int r = 1e6) { if (l > t) return; if (t + 1 >= r) { ll ext = max(0LL, res - T[id].l); ext = max(0LL, ext - T[id].emp); res = T[id].end + ext; return; } ask(t, res, id << 1, l, l + r >> 1); ask(t, res, id << 1 | 1, l + r >> 1, r); return; } int records[300010]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; build(); string op; for (int i = 1; i <= n; i++) { cin >> op; if (op == ? ) { int t; ll res = -1; cin >> t; --t; ask(t, res); cout << max(0LL, res - t) << endl; } else if (op == + ) { int d; cin >> records[i] >> d; --records[i]; add(records[i], d); } else if (op == - ) { int id; cin >> id; rem(records[id]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010, mod = 1e9 + 7; int i, j, k, n, m, y, e; long long ans = 1, a[maxn]; int main() { a[0] = 1; a[1] = 1; cin >> n; for (i = 2; i <= n; i++) a[i] = (a[i - 2] * (i - 1) + a[i - 1]) % mod; for (i = 1; i <= n; i++) { int x; scanf( %d , &x); if (x == 1) y++; else e++; } for (i = n; e; i--, e--) { ans *= i; ans %= mod; } cout << ans * a[y] % mod << endl; } |
#include <bits/stdc++.h> using namespace std; int quick_pow(int a, int b, int MOD) { a %= MOD; int res = 1; while (b) { if (b & 1) res = (res * a) % MOD; b /= 2; a = (a * a) % MOD; } return res; } const int maxn = 200000 + 10; const int MOD = 1e9 + 7; const int INF = 1e9; int a[maxn], dp[maxn]; priority_queue<int, vector<int>, greater<int> > que1, que2[maxn]; typedef struct Segment { int sum[maxn * 4]; void pushUp(int k) { sum[k] = min(sum[k * 2], sum[k * 2 + 1]); } void build(int k, int l, int r) { sum[k] = INF; if (l == r) return; int m = (l + r) / 2; build(k * 2, l, m); build(k * 2 + 1, m + 1, r); } void update(int p, int v, int k, int l, int r) { if (l == r) { sum[k] = min(sum[k], v); return; } int m = (l + r) / 2; if (p <= m) update(p, v, k * 2, l, m); else update(p, v, k * 2 + 1, m + 1, r); pushUp(k); } int ask(int a, int b, int k, int l, int r) { if (a <= l && r <= b) return sum[k]; int m = (l + r) / 2, res = INF; if (a <= m) res = min(res, ask(a, b, k * 2, l, m)); if (b > m) res = min(res, ask(a, b, k * 2 + 1, m + 1, r)); return res; } } Tree; Tree tree; int main() { int i, j, n, m; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &a[i]); } tree.build(1, 1, n); printf( 0 ); int now = 0; tree.update(a[1], a[1] + 1, 1, 1, n); now = -1; for (i = 2; i <= n; i++) { int res = now + i; res = min(res, tree.ask(i, n, 1, 1, n) - i); printf( %d , res); tree.update(a[i], res + 1 + a[i], 1, 1, n); now = min(now, res - i); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; const double pai = acos(-1); const double eps = 1e-8; const long long mod = 1e9 + 7; const int MXN = 1e6 + 5; vector<int> v[MXN]; int c[MXN]; int suf[MXN]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { int le; scanf( %d , &le); while (le--) { int aa; scanf( %d , &aa); v[i].push_back(aa); } int mi = INT_MAX; for (auto j : v[i]) { if (j > mi) c[i] = 1; mi = min(mi, j); } sort(v[i].begin(), v[i].end()); } long long gg = 0; for (int i = 1; i <= n; i++) { if (c[i]) { gg++; continue; } suf[v[i].back()]++; } for (int i = 1e6 - 1; i >= 0; i--) suf[i] = suf[i] + suf[i + 1]; long long ans = 0; for (int i = 1; i <= n; i++) { if (c[i]) ans = ans + (long long)n; else ans = ans + (long long)suf[v[i][0] + 1] + gg; } cout << ans << n ; return 0; } |
#include<bits/stdc++.h> using namespace std; #define ll long long int main() { ll int n,q; string s; cin>>n>>q; ll int cum[n+2]; cin>>s; cum[0]=s[0]- a +1; for(int i=1;i<n;i++) { cum[i]=cum[i-1]+s[i]- a +1; } for(ll int i=0;i<q;i++) { ll int a,b,ans=0; cin>>a>>b; if (a==1) {cout<<cum[b-1]<<endl;} else {cout<<cum[b-1]-cum[a-2]<<endl;} } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; void __never(int a) { printf( nOPS %d , a); } const int INF = 1000000000; bool was[6][26][6][11][16][21]; int dp[6][26][6][11][16][21]; struct Edge { int a, l, h; }; int n; Edge graf[7][7]; int mask[7]; void dfs(int a, int b, int rest, int cost, vector<int>& v, vector<pair<vector<int>, int> >& res) { if (b == n + 1) { if (rest != 0) return; vector<int> v2(5); for (int(i) = (a); (i) <= (n - 2); ++(i)) v2[i] = v[i] + mask[i + 1]; res.push_back(make_pair(v2, cost)); return; } for (int(i) = (graf[a][b].l); (i) <= (graf[a][b].h); ++(i)) { if (i > rest) break; mask[b] = i; dfs(a, b + 1, rest - i, cost + ((i > 0) ? graf[a][b].a : 0) + i * i, v, res); } } int get(vector<int> v, int st) { if (was[st][v[0]][v[1]][v[2]][v[3]][v[4]]) return dp[st][v[0]][v[1]][v[2]][v[3]][v[4]]; was[st][v[0]][v[1]][v[2]][v[3]][v[4]] = true; int& res = dp[st][v[0]][v[1]][v[2]][v[3]][v[4]]; if (v[0] + v[1] + v[2] + v[3] + v[4] == 0 && st == n - 1) return res = 0; vector<pair<vector<int>, int> > vv; dfs(st + 1, st + 2, v[st], 0, v, vv); res = -INF; for (int(i) = (0); (i) <= ((int)((vv).size()) - 1); ++(i)) { int h = get(vv[i].first, st + 1); if (h > -INF) res = max(res, h + vv[i].second); } return res; } void init() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } void sol() { cin >> n; int a, b; for (int(i) = (1); (i) <= ((n * (n - 1)) / 2); ++(i)) { cin >> a >> b; cin >> graf[a][b].l >> graf[a][b].h >> graf[a][b].a; } bool zero = true; for (int(i) = (1); (i) <= (n); ++(i)) for (int(j) = (i + 1); (j) <= (n); ++(j)) zero &= graf[i][j].l == 0; if (zero) { printf( 0 0 ); return; } int hi = 0; for (int(i) = (2); (i) <= (n); ++(i)) hi += graf[1][i].h; vector<int> v(5); for (int(I) = (1); (I) <= (hi); ++(I)) { v[0] = I; if (get(v, 0) > 0) { printf( %d %d , I, get(v, 0)); return; } } printf( -1 -1 ); } void gen() { int n = 6; printf( %d , n); for (int(i) = (1); (i) <= (n); ++(i)) for (int(j) = (i + 1); (j) <= (n); ++(j)) printf( n%d %d %d %d %d , i, j, rand() & 1, 5, rand() & 15); } int main() { sol(); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.