func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const int MAXN = 2000; const int MAXE = 30001; const int INF = 2000000002; struct edge { int to; int w; int id; edge() {} edge(int to, int w, int id) : to(to), w(w), id(id) {} bool operator==(const edge& e) const { return to == e.to && w == e.w && id == e.id; } }; int cost[MAXE]; int conn[MAXN][MAXN]; int find_path(int s, int t, const vector<vector<edge> >& g, vector<edge>& path, vector<int>& used) { used[s] = 1; if (s == t) { return 1; } for (auto& val : g[s]) { int to = val.to; if (!used[to]) { path.push_back(val); int res = find_path(to, t, g, path, used); if (res) { return res; } path.pop_back(); } } return 0; } int timer, tin[MAXN], fup[MAXN]; void dfs(int v, const vector<vector<edge> >& g, vector<int>& bridges, vector<int>& used, int p = -1) { used[v] = true; tin[v] = fup[v] = timer++; for (auto& val : g[v]) { int to = val.to; if (to == p) continue; if (used[to]) fup[v] = min(fup[v], tin[to]); else { dfs(to, g, bridges, used, v); fup[v] = min(fup[v], fup[to]); if (fup[to] > tin[v] && conn[v][to] == 1) { int id = val.id; bridges[id] = 1; } } } } void find_bridges(const vector<vector<edge> >& g, vector<int>& bridges) { timer = 0; vector<int> used(MAXN, 0); for (int i = 1; i < g.size(); ++i) if (!used[i]) dfs(i, g, bridges, used); } pair<int, int> find_best(int s, int t, const vector<vector<edge> >& g) { vector<edge> path; vector<int> used(MAXN, 0); int res = find_path(s, t, g, path, used); if (!res) { return make_pair(0, -1); } vector<int> bridges(MAXE, 0); find_bridges(g, bridges); int min_price = INF; int best_id = -1; for (auto& val : path) { int id = val.id; if (bridges[id] && cost[id] < min_price) { best_id = id; min_price = cost[id]; } } return make_pair(min_price, best_id); } void remove(vector<vector<edge> >& g, int cur, edge val) { int to = val.to; auto it = find(g[cur].begin(), g[cur].end(), val); g[cur].erase(it); val.to = cur; it = find(g[to].begin(), g[to].end(), val); g[to].erase(it); conn[cur][to]--; conn[to][cur]--; } void restore(vector<vector<edge> >& g, int cur, edge val) { int to = val.to; g[cur].push_back(val); val.to = cur; g[to].push_back(val); conn[cur][to]++; conn[to][cur]++; } int main(int argc, char const* argv[]) { vector<vector<edge> > g(MAXN); int n, m; cin >> n >> m; int s, t; cin >> s >> t; for (int i = 0; i < m; i++) { int x, y, w; cin >> x >> y >> w; g[x].push_back(edge(y, w, i)); g[y].push_back(edge(x, w, i)); conn[x][y]++; conn[y][x]++; cost[i] = w; } vector<edge> path; vector<int> used(MAXN, 0); int res = find_path(s, t, g, path, used); if (!res) { cout << 0 << n ; cout << 0; return 0; } int best_price = INF; int cur = s; int id1, id2; for (auto val : path) { int id = val.id; int to = val.to; remove(g, cur, val); pair<int, int> best = find_best(s, t, g); if (best.first < INF) { int cur_price = val.w + best.first; if (cur_price < best_price) { id1 = val.id; id2 = best.second; best_price = cur_price; } } restore(g, cur, val); cur = to; } if (best_price >= INF) { cout << -1; return 0; } cout << best_price << n ; if (id2 == -1) { cout << 1 << n ; cout << id1 + 1; } else { cout << 2 << n ; cout << id1 + 1 << << id2 + 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 4e5 + 1; struct dak { long long val, pos; }; long long l[maxn], r[maxn]; long long pre[maxn], pre2[maxn]; vector<dak> p; vector<pair<long long, long long> > v; vector<pair<long long, long long> > qr; long long n, m, q; long long cur = 0; long long res[maxn]; inline long long get(long long r, long long x) { return pre[r] - pre[r - x]; } inline long long cnt(long long x) { return pre2[x] - pre2[l[x] - 1]; } void join(long long pos) { cur -= get(pos - 1, cnt(pos - 1)) + get(r[pos], cnt(r[pos])) - get(r[pos], cnt(r[pos]) + cnt(pos - 1)); r[l[pos - 1]] = r[pos]; l[r[pos]] = l[pos - 1]; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> q; for (long long i = 1; i <= n; i++) { long long x; cin >> x; v.push_back({x, 1}); cur += x; } for (long long i = 1; i <= m; i++) { long long x; cin >> x; v.push_back({x, 0}); } sort(v.begin(), v.end()); for (long long i = 1; i <= n + m; i++) { l[i] = r[i] = i; pre[i] = pre[i - 1] + v[i - 1].first; pre2[i] = pre2[i - 1] + v[i - 1].second; } for (long long i = 1; i < n + m; i++) { p.push_back({v[i].first - v[i - 1].first, i + 1}); } sort(p.begin(), p.end(), [](const dak &a, const dak &b) { return a.val < b.val; }); for (long long i = 1, x; i <= q; i++) { cin >> x; qr.push_back({x, i}); } sort(qr.begin(), qr.end()); long long pos = 0; for (pair<long long, long long> &query : qr) { while (pos < p.size() && p[pos].val <= query.first) { join(p[pos].pos); pos++; } res[query.second] = cur; } for (long long i = 1; i <= q; i++) cout << res[i] << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) if (n == i * (i + 1) / 2) { cout << YES ; return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 2; int n, m, a[N], cnt[N], nxt[N]; bool vis[N]; int main() { int test; cin >> test; while (test--) { cin >> n >> m; for (int i = 0; i <= n; ++i) cnt[i] = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; int t1 = i + n - a[i], t2 = i - a[i] + 1; int k1 = -1, k2 = -1; if (t1 < n) { k1 = t1; } if (t2 > 0) { k2 = t2 - 1; } if (k1 >= 0) ++cnt[k1]; if (k2 >= 0) cnt[k2] += k1 != k2; } vector<int> ans; ans.clear(); for (int i = 0; i < n; ++i) { if (n - cnt[i] > m * 2) continue; for (int j = 1; j <= n; ++j) { vis[j] = false; if (a[j] <= n - i) { nxt[j] = i + a[j]; } else { nxt[j] = a[j] - (n - i); } } int cycles = 0; for (int j = 1; j <= n; ++j) if (nxt[j] != j && !vis[j]) { int u = j; ++cycles; vis[j] = true; while (nxt[u] != j) { u = nxt[u]; vis[u] = true; } } if (n - cnt[i] - cycles <= m) { ans.push_back(i); } } cout << (int)ans.size() << ; for (int i : ans) cout << i << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long K = 10000000000LL; vector<long long> L; void init(long long crr) { if (crr > K) return; if (crr != 0) L.push_back(crr); init(crr * 10 + 4); init(crr * 10 + 7); } bool is_lucky(long long x) { if (x == 0) return false; while (x > 0) { if (x % 10 != 4 && x % 10 != 7) return false; x /= 10; } return true; } const int MAX_M = 20; long long fact(long long k) { long long res = 1; for (int i = 1; i <= k; ++i) res *= i; return res; } vector<int> kth_permutation(int n, long long k) { vector<int> res(n), num(n); for (int i = 0; i < (int)(n); i++) num[i] = i; if (k >= fact(n)) return vector<int>(); for (int i = 0; i < (int)(n); i++) { long long f = fact(n - i - 1); res[i] = num[k / f]; num.erase(num.begin() + (k / f)); k %= f; } return res; } long long perm_n, perm_m; vector<int> perm_last; bool init_permutation(long long n, long long k) { perm_n = n; perm_last = kth_permutation(min(n, 20LL), k); if (perm_last.empty()) return false; perm_m = perm_n - perm_last.size(); return true; } long long get_permutation(long long i) { if (i < perm_m) return i; else return perm_m + perm_last[i - perm_m]; } int bruteforce(int N, int K) { vector<int> A(N); for (int i = 0; i < (int)(N); i++) A[i] = i + 1; for (int i = 0; i < (int)(K - 1); i++) next_permutation((A).begin(), (A).end()); int ans = 0; for (int i = 0; i < (int)(N); i++) if (is_lucky(i + 1) && is_lucky(A[i])) ++ans; return ans; } int main() { init(0); long long N, K; while (cin >> N >> K) { --K; if (!init_permutation(N, K)) { puts( -1 ); continue; } long long ans = 0; for (int i = 0; i < (int)(L.size()); i++) { long long l = L[i]; if (1 <= l && l <= N && is_lucky(1 + get_permutation(l - 1))) ++ans; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace my_template { const long double PI = 3.14159265358979323846264338327950288419716939937510582097494L; template <typename T> pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.first + b.first, a.second + b.second); } template <typename T> pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.first - b.first, a.second - b.second); } template <typename T> T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.first * b.first + a.second * b.second); } template <typename T> T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.first * b.second - a.second * b.first); } template <typename T> void print(vector<T> vec, string name = ) { cout << name; for (auto u : vec) cout << u << ; cout << n ; } } // namespace my_template using namespace my_template; const int MOD = 1000000007; const long long INF = std::numeric_limits<long long>::max(); const int MX = 500101; int N; vector<pair<int, int>> sk; vector<int> color; struct node { int l, r; int did; int lazy; int dp, seg; node *left = nullptr; node *right = nullptr; node(int a, int b) : l(a), r(b), did(0), lazy(0), dp(0), seg(0) { if (l != r) { left = new node(l, (l + r) / 2); right = new node((l + r) / 2 + 1, r); } } inline void push() { if (!lazy) return; did += lazy; if (l != r) { left->lazy += lazy; right->lazy += lazy; } else { seg += lazy; assert(did == dp + seg); } lazy = 0; } void upd(int pos, int val) { push(); if (l == r) { dp = max(dp, val); did = dp + seg; return; } else if (pos <= (l + r) / 2) left->upd(pos, val); else right->upd(pos, val); left->push(); right->push(); did = max(left->did, right->did); } void add(int a, int b, int val) { push(); if (r < a or b < l) return; else if (a <= l and r <= b) { lazy += val; push(); return; } else { left->add(a, b, val); right->add(a, b, val); left->push(); right->push(); did = max(left->did, right->did); } } int get(int a, int b) { push(); if (r < a or b < l) return 0; else if (a <= l and r <= b) { return did; } else { return max(left->get(a, b), right->get(a, b)); } } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; { vector<pair<pair<int, int>, int>> temp(N); for (int i = 0; i < N; ++i) { cin >> temp[i].first.first >> temp[i].first.second >> temp[i].second; } sort(temp.begin(), temp.end(), [](const pair<pair<int, int>, int> &a, const pair<pair<int, int>, int> &b) { return a.first.second < b.first.second or (a.first.second == b.first.second and a.first.first > b.first.first); }); sk.resize(N); color.resize(N); for (int i = 0; i < N; ++i) { sk[i] = temp[i].first; color[i] = temp[i].second - 1; } } int big = 0; { map<int, int> rem; for (int i = 0; i < N; ++i) { rem[sk[i].first] = 1; rem[sk[i].second] = 1; } int piv = 1; for (auto &&u : rem) u.second = piv++; for (int i = 0; i < N; ++i) { sk[i].first = rem[sk[i].first]; sk[i].second = rem[sk[i].second]; big = max(big, sk[i].second); } } node *dp[2]; dp[0] = new node(0, big + 10); dp[1] = new node(0, big + 10); int ats = 0; for (int i = 0; i < N; ++i) { int c = color[i]; int first = sk[i].first; int second = sk[i].second; int curr = dp[1 - c]->get(0, first - 1) + 1; dp[1 - c]->add(0, first - 1, 1); dp[c]->upd(second, curr); ats = max(ats, curr); } printf( %d n , ats); } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n, m; cin >> n >> m; vector<vector<long long> > a(m, vector<long long>(n)); for (long long i = 0; i <= n - 1; i++) { for (long long j = 0; j <= m - 1; j++) { cin >> a[j][i]; a[j][i]--; } } long long ans = 0; for (long long i = 0; i <= m - 1; i++) { vector<long long> temp(n, 0); for (long long j = 0; j <= n - 1; j++) { if (a[i][j] % m == i) { long long x = a[i][j] / m; if (x < n) { temp[(j - x + n) % n]++; } } } long long lol = INT_MAX; for (long long j = 0; j <= n - 1; j++) { lol = min(lol, (n - temp[j] + j)); } ans += lol; } cout << ans << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; for (long long i = 1; i <= t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long SIZE = 1e5; long long n, a[SIZE], dp[SIZE][2][2]; void Max(long long &a, long long b) { a = max(a, b); } signed main() { cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < 2; j++) { for (long long k = 0; k < 2; k++) { dp[i][j][k] = 1; } } } for (long long i = 0; i < (n - 1); i++) { if (a[i] < a[i + 1]) { Max(dp[i + 1][0][0], dp[i][0][0] + 1); Max(dp[i + 1][1][0], dp[i][1][0] + 1); } Max(dp[i + 1][1][1], dp[i][0][0] + 1); if (i && (a[i + 1] - a[i - 1] > 1)) { Max(dp[i + 1][1][0], dp[i][1][1] + 1); } } long long ans = 1; for (long long i = 0; i < n; i++) { Max(ans, min(dp[i][0][0] + 1, n)); for (long long j = 0; j < 2; j++) { Max(ans, dp[i][1][j]); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; typedef struct { int op, l, r, x, y; } query; int n, m, seed, vmax, a[100000]; query qs[100000]; int rnd() { int ret = seed; seed = (1LL * seed * 7LL + 13LL) % 1000000007LL; return ret; } long long get_num(map<int, long long>& mp, int i) { auto it = mp.lower_bound(i); if (it == mp.end() || it->first > i) it--; return it->second; } long long pow(long long a, int b, int mod) { if (b == 0) return 1LL; if (b == 1) return a % mod; long long c = pow(a, b / 2, mod) % mod; if (b & 1) return (((c * c) % mod) * (a % mod)) % mod; return (c * c) % mod; } void debug_range(map<int, long long>& mp) { for (auto i = mp.begin(); i != mp.end(); i++) printf( (%d %lld) , i->first, i->second); printf( n ); } int main() { scanf( %d%d%d%d , &n, &m, &seed, &vmax); for (int i = 0; i < n; i++) a[i] = (rnd() % vmax) + 1; for (int i = 0; i < m; i++) { qs[i].op = (rnd() % 4) + 1; qs[i].l = (rnd() % n) + 1 - 1; qs[i].r = (rnd() % n) + 1 - 1; if (qs[i].l > qs[i].r) swap(qs[i].l, qs[i].r); if (qs[i].op == 3) qs[i].x = (rnd() % (qs[i].r - qs[i].l + 1)) + 1; else qs[i].x = (rnd() % vmax) + 1; if (qs[i].op == 4) qs[i].y = (rnd() % vmax) + 1; } map<int, long long> mp; mp[0] = a[0]; for (int i = 1; i < n; i++) if (a[i] != a[i - 1]) mp[i] = a[i]; for (int i = 0; i < m; i++) { if (qs[i].op == 1) { long long tmp = get_num(mp, qs[i].r + 1); mp[qs[i].r + 1] = tmp; tmp = qs[i].x + get_num(mp, qs[i].l); mp[qs[i].l] = tmp; for (auto it = mp.lower_bound(qs[i].l + 1); it != mp.end() && it->first <= qs[i].r; it++) it->second += qs[i].x; } else if (qs[i].op == 2) { long long tmp = get_num(mp, qs[i].r + 1); mp[qs[i].r + 1] = tmp; vector<int> era; for (auto it = mp.lower_bound(qs[i].l); it != mp.end() && it->first <= qs[i].r; it++) era.push_back(it->first); for (int x : era) mp.erase(x); mp[qs[i].l] = qs[i].x; } else if (qs[i].op == 3) { map<long long, int> smp; int r = mp.lower_bound(qs[i].l) != mp.end() ? min(qs[i].r + 1, mp.lower_bound(qs[i].l)->first) : qs[i].r + 1; smp[get_num(mp, qs[i].l)] = r - qs[i].l; for (auto it = mp.lower_bound(qs[i].l); it != mp.end() && it->first <= qs[i].r; it++) { auto it2 = it; it2++; int r = it2 != mp.end() ? min(it2->first, qs[i].r + 1) : qs[i].r + 1; smp[it->second] += r - it->first; } for (auto it = smp.begin(); it != smp.end(); it++) { if (it->second >= qs[i].x) { printf( %lld n , it->first); break; } qs[i].x -= it->second; } } else { int r = mp.lower_bound(qs[i].l) != mp.end() ? min(qs[i].r + 1, mp.lower_bound(qs[i].l)->first) : qs[i].r + 1; long long sum = (pow(get_num(mp, qs[i].l), qs[i].x, qs[i].y) * ((r - qs[i].l) % qs[i].y)) % qs[i].y; for (auto it = mp.lower_bound(qs[i].l); it != mp.end() && it->first <= qs[i].r; it++) { auto it2 = it; it2++; int r = it2 != mp.end() ? min(it2->first, qs[i].r + 1) : qs[i].r + 1; sum = (sum + (pow(it->second, qs[i].x, qs[i].y) * (r - it->first)) % qs[i].y) % qs[i].y; } printf( %lld n , sum % qs[i].y); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long leader[110000], p[110000]; long long n, m, i, j, k; bool can(long long cost) { for (i = 0, j = 0; i < n && j < m; ++i) { long long summ = cost; if (leader[i] == p[j] && j < m) ++j; if (j >= m) break; summ -= abs(leader[i] - p[j]); long long temp = leader[i] - p[j]; if (summ < 0) continue; if (temp > 0) { int t = j; while (p[j] <= leader[i] && j < m) ++j; while (cost >= p[j] - p[t] + min(p[j] - leader[i], leader[i] - p[t]) && j < m) ++j; if (j >= m) break; } else { while (p[j] <= leader[i] + cost && j < m) ++j; if (j >= m) break; } } if (j >= m) return 1; else return 0; } int main() { long long cost = 0; scanf( %I64d%I64d , &n, &m); for (i = 0; i < n; ++i) scanf( %I64d , &leader[i]); for (i = 0; i < m; ++i) scanf( %I64d , &p[i]); i = 0, j = 0; long long l = -1, r = max(p[m - 1] * 2, leader[n - 1] * 2); if (n != 1) while (r - l > 1) { long long mid = l + (r - l) / 2; if (can(mid)) r = mid; else l = mid; } if (n != 1) printf( %I64d , r); else { if (leader[0] < p[0]) printf( %I64d , p[m - 1] - leader[0]); else if (leader[0] > p[m - 1]) printf( %I64d , leader[0] - p[0]); else { printf( %I64d , p[m - 1] - p[0] + min(leader[0] - p[0], p[m - 1] - leader[0])); } } return 0; } |
#include <iostream> using namespace std; int main() { ios::sync_with_stdio(0); int t; cin >> t; while(t--) { int x,y; cin >> x >> y; cout << 2*max(x,y) - (min(x,y) != max(x,y)) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int mod = (int)1e9 + 7; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } void solve() { int n; cin >> n; if (n % 2 == 0) { cout << -1 n ; return; } for (int i = 0; i < n; i++) { cout << i << ; } cout << n ; for (int i = 0; i < n; i++) { cout << (i + 1) % n << ; } cout << n ; for (int i = 0; i < n; i++) { cout << (i + i + 1) % n << ; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; solve(); } |
#include <bits/stdc++.h> using namespace std; void build(int ss, int se, int si); long long query(int ss, int se, int si, int qs, int qe); set<pair<long long, int> > s; set<pair<long long, int> >::iterator it, last; long long A[100001], st[400005], dp[100001]; int main(void) { int i, n, c; long long sum, ans = 0, min_i; cin >> n >> c; if (c == 1) { cout << 0 << endl; return 0; } for (i = 0; i < n; i++) { cin >> A[i]; ans = ans + A[i]; } build(0, n - 1, 0); for (i = c - 1; i < n; i++) dp[i] = max(dp[i - 1], ((i - c >= 0) ? dp[i - c] : 0) + query(0, n - 1, 0, i - c + 1, i)); cout << ans - dp[n - 1] << endl; } void build(int ss, int se, int si) { if (ss == se) { st[si] = A[ss]; return; } int mid = (ss + se) / 2; build(ss, mid, 2 * si + 1); build(mid + 1, se, 2 * si + 2); st[si] = min(st[2 * si + 1], st[2 * si + 2]); } long long query(int ss, int se, int si, int qs, int qe) { if (ss >= qs && se <= qe) return st[si]; if (ss > qe || se < qs) return INT_MAX; int mid = (ss + se) / 2; return min(query(ss, mid, 2 * si + 1, qs, qe), query(mid + 1, se, 2 * si + 2, qs, qe)); } |
#include <bits/stdc++.h> using namespace std; int main() { int i, N, bitl, bitr; long long l, r; scanf( %d , &N); while (N--) { scanf( %lld%lld , &l, &r); bitl = bitr = 0; if (l == r) { printf( %lld n , l); continue; } while ((1LL << bitl) <= l) ++bitl; while ((1LL << bitr) <= r) ++bitr; --bitl; --bitr; if (bitl < bitr) { if ((1LL << (bitr + 1)) - 1 == r) printf( %lld n , r); else printf( %lld n , (1LL << bitr) - 1); continue; } for (i = bitr; i >= 0; --i) { if (((l >> i) % 2) != ((r >> i) % 2)) break; } if ((((1LL << (i + 1)) - 1) & r) == (1LL << (i + 1)) - 1) printf( %lld n , r); else { r |= (1LL << i) - 1; r &= ~(1LL << i); printf( %lld n , r); } } return 0; } |
#include <bits/stdc++.h> using namespace std; void cmax(long long int &a, long long int b) { if (a < b) a = b; } const int mod = 1000000007; bool comp(int x, int y) { return x > y; } void printarr(int arr[], int n) { for (int i = 0; i < n; ++i) std::cout << arr[i] << (i < n - 1 ? : n ); } template <typename T> void printv(T &a) { for (auto it = a.begin(); it != a.end(); ++it) std::cerr << *it << ; std::cerr << n ; } int gint() { int n; cin >> n; return n; } const int maxn = 200009; long long int ans; int arr[maxn]; void solve() { ans = 0; bool ok = false; int m = gint(); int n = gint(); long long int sum = 0; for (int i = 0; i < n; ++i) { arr[i] = i + 1; sum += arr[i]; if (sum > m) ok = 1; } if (!ok) { for (int i = 0; i < n; ++i) { arr[i] += (m - sum) / n; } int res = (m - sum) % n; for (int i = n - 2; i >= 0; --i) { int temp; arr[i + 1] += temp = min(arr[i] * 2 - arr[i + 1], res); res -= temp; } sum = arr[0]; for (int i = 1; !ok && i < n; ++i) { ok = (arr[i] > arr[i - 1] * 2); sum += arr[i]; } ok = !(sum == m); } std::cout << (!ok ? YES : NO ); std::cout << n ; if (!ok) printarr(arr, n); std::cout << n ; } void sol() {} int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int testcases = 1; for (int t = 0; t < testcases; ++t) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 4e18; const long long N = 2e5 + 10; void testCase() { long long n; cin >> n; long long a[n + 1]; for (long long i = 1; i <= n; i++) cin >> a[i]; vector<long long> sma(n + 2), suf(n + 2); for (long long i = n; i >= 1; i--) { sma[i] = max(a[i], sma[i + 1] + 1); suf[i] = suf[i + 1] + sma[i] - a[i]; } long long ans = inf; long long pma = 0, pref = 0; for (long long i = 1; i <= n; i++) { pma = max(pma + 1, a[i]); long long cur = pref + suf[i + 1] + max(pma, sma[i]) - a[i]; ans = min(ans, cur); pref += pma - a[i]; } cout << ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); long long t_c = 1; while (t_c--) testCase(); } |
#include <bits/stdc++.h> using namespace std; int const N = 200001; int main() { int t; scanf( %d , &t); while (t--) { int n; string s, t; scanf( %d , &n); cin >> s >> t; set<int> msA[200], msB[200]; map<char, int> f; for (int i = 0; i < n; ++i) { msA[s[i]].insert(i); msB[t[i]].insert(i); ++f[s[i]], ++f[t[i]]; } bool ok = true; for (char i = a ; i <= z ; ++i) if (f[i] & 1) { ok = false; break; } vector<pair<int, int> > an; if (!ok) { puts( NO ); continue; } for (int i = 0; i < n; ++i) { if (s[i] == t[i]) continue; int sp = -1; for (int j = i + 1; j < n; ++j) { if (s[j] == s[i]) sp = j; if (s[j] != t[j] && s[j] == s[i]) { sp = j; break; } } if (~sp) { an.push_back({sp, i}); swap(s[sp], t[i]); continue; } for (int j = i + 1; j < n; ++j) { if (t[j] == s[i]) sp = j; if (s[j] != t[j] && t[j] == s[i]) { sp = j; break; } } if (~sp) { an.push_back({sp, sp}); swap(s[sp], t[sp]); an.push_back({sp, i}); swap(s[sp], t[i]); continue; } break; } if (s != t || an.size() > 2 * n) puts( NO ); else { printf( YES n%d n , an.size()); for (auto i : an) printf( %d %d n , i.first + 1, i.second + 1); } } } |
#include <bits/stdc++.h> using namespace std; const int n = 5000; const long long mod = 998244353; long long f[n + 10][n + 10]; int main() { int a, b, c; for (int i = 1; i < n + 10; i++) { for (int j = 1; j < n + 10; j++) { if (i == 1) f[i][j] = j + 1; else if (j < i) f[i][j] = f[j][i]; else { (f[i][j] += j * f[i - 1][j - 1] % mod) %= mod; (f[i][j] += f[i - 1][j]) %= mod; } } } while (scanf( %d%d%d , &a, &b, &c) != EOF) { long long ans = ((f[a][b] * f[b][c]) % mod) * f[c][a] % mod; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000055; const int inf = 0x3f3f3f3f; const double pi = acos(-1.0); const int mod = 1e9 + 7; long long pow_mod(long long a, long long b) { long long ans = 1 % mod; for (; b; b >>= 1) { if (b & 1) ans = (long long)ans * a % mod; a = (long long)a * a % mod; } return ans; } long long x, n; long long p[MAXN], c[MAXN]; int cnt; void divide(long long n) { cnt = 0; int lim = sqrt(n); for (int i = 2; i <= lim; ++i) { if (n % i == 0) { p[++cnt] = i, c[cnt] = 0; while (n % i == 0) n /= i, c[cnt]++; } } if (n > 1) p[++cnt] = n, c[cnt] = 1; } int main() { cin >> x >> n; divide(x); long long ans = 1; for (int i = 1; i <= cnt; ++i) { long long k = 1, tmp = 0; while ((long long)(n / (long long)pow(p[i], k))) { tmp += (long long)(n / (long long)pow(p[i], k)); k++; } ans = ans * pow_mod(p[i], tmp) % mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; if (k == 2) puts( 1 1 ); if (k == 3) puts( 1 0 1 ); if (k == 4) puts( 0 0 1 1 ); if (k == 5) puts( 1 1 1 0 1 ); if (k == 6) puts( 1 0 0 1 1 1 ); if (k == 7) puts( 1 1 1 0 1 1 1 ); if (k == 8) puts( 1 0 0 0 1 1 0 1 ); if (k == 9) puts( 1 0 1 1 0 1 1 0 1 ); if (k == 10) puts( 0 0 0 0 0 0 1 0 0 1 ); if (k == 11) puts( 0 0 1 1 0 1 0 1 1 0 1 ); if (k == 12) puts( 0 1 0 0 0 1 0 1 1 1 0 1 ); if (k == 13) puts( 1 1 1 1 0 0 0 0 1 1 0 1 1 ); if (k == 14) puts( 0 1 1 1 1 0 0 0 0 0 1 1 1 1 ); if (k == 15) puts( 1 1 1 1 0 1 0 1 1 0 1 1 0 0 1 ); if (k == 16) puts( 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 ); if (k == 17) puts( 0 1 1 1 0 1 0 1 0 0 0 1 0 1 1 1 1 ); if (k == 18) puts( 1 1 1 0 1 0 0 1 0 0 0 0 0 0 1 0 1 1 ); if (k == 19) puts( 0 1 0 1 0 0 0 0 1 0 1 1 1 0 1 1 1 0 1 ); if (k == 20) puts( 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 ); if (k == 21) puts( 1 1 0 1 1 0 1 1 0 1 0 0 1 0 1 0 0 1 0 1 1 ); if (k == 22) puts( 0 0 0 1 1 0 1 0 0 1 0 0 0 0 0 1 1 0 1 1 1 1 ); if (k == 23) puts( 1 1 1 0 0 0 0 0 0 1 1 0 1 0 0 1 1 0 0 0 0 1 1 ); if (k == 24) puts( 1 1 1 0 0 1 0 1 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 1 ); if (k == 25) puts( 1 1 1 1 1 0 0 0 1 0 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 ); if (k == 26) puts( 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 1 0 1 ); if (k == 27) puts( 0 0 1 0 1 0 1 0 1 1 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 ); if (k == 28) puts( 0 0 1 1 1 0 1 1 0 1 0 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 ); if (k == 29) puts( 1 1 1 0 1 1 1 0 0 0 0 0 0 1 1 1 1 0 0 1 0 0 0 1 0 0 1 0 1 ); if (k == 30) puts( 1 1 1 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 1 0 1 0 0 0 1 0 1 1 1 ); if (k == 31) puts( 0 0 1 0 1 0 1 0 0 1 1 0 1 1 1 1 0 0 0 0 0 0 1 1 0 0 0 1 0 1 1 ); if (k == 32) puts( 0 1 1 1 0 1 0 1 0 1 0 0 0 1 1 1 0 1 1 1 0 1 1 0 0 0 1 1 0 1 0 1 ); if (k == 33) puts( 0 1 0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 0 1 ); if (k == 34) puts( 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 1 0 1 0 0 0 1 1 1 1 1 1 1 ); if (k == 35) puts( 0 0 1 1 0 0 0 1 1 0 0 1 1 1 1 1 1 1 0 1 0 1 1 0 0 0 1 0 0 1 1 0 0 0 1 ); if (k == 36) puts( 0 0 1 1 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 ); if (k == 37) puts( 1 0 0 1 1 0 1 1 1 0 0 0 0 1 1 1 1 1 0 0 1 1 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 ); if (k == 38) puts( 1 0 0 0 1 1 1 1 1 0 1 0 0 1 1 0 1 1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 1 1 0 1 0 1 ); if (k == 39) puts( 0 0 0 0 1 0 1 0 0 0 0 1 1 1 1 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 1 1 ); if (k == 40) puts( 1 0 1 1 0 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 0 1 1 1 0 1 1 0 1 0 1 1 1 1 0 1 1 0 1 1 ); if (k == 41) puts( 1 1 1 0 1 1 1 1 0 0 1 0 0 1 0 1 1 0 0 1 0 0 0 1 1 0 1 1 0 0 1 0 0 0 1 1 1 1 1 1 1 ); if (k == 42) puts( 0 0 0 0 1 1 0 0 0 1 1 1 1 1 1 1 0 1 0 1 0 1 1 0 1 1 1 1 0 0 0 1 1 0 1 1 1 0 1 0 0 1 ); if (k == 43) puts( 0 0 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 0 0 1 1 1 1 0 1 1 1 1 ); if (k == 44) puts( 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 0 0 1 0 0 1 0 1 0 1 1 0 0 0 1 0 1 1 1 1 0 1 1 1 0 1 ); if (k == 45) puts( 0 0 1 0 1 1 0 0 0 0 0 0 1 1 0 1 1 0 0 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0 1 1 0 0 1 1 0 1 0 0 1 ); if (k == 46) puts( 1 1 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 1 1 0 1 1 1 0 1 1 0 0 0 1 0 1 1 1 1 0 1 1 1 0 1 0 1 0 1 1 ); if (k == 47) puts( 0 0 0 0 1 1 1 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 1 1 1 1 0 0 0 0 0 0 1 ); if (k == 48) puts( 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0 0 0 1 1 0 1 0 0 0 0 1 1 0 1 1 ); if (k == 49) puts( 0 0 0 0 1 0 1 1 1 0 1 1 1 0 0 1 0 0 0 0 1 0 1 1 0 1 1 1 1 0 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 0 1 0 1 ); if (k == 50) puts( 1 0 0 0 0 1 0 0 1 1 0 0 1 1 1 0 1 0 0 1 1 1 1 0 1 0 0 1 0 1 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 ); for (int i = 1; i <= k; ++i) printf((i > 1) ? 1 : 1 ); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } int read() { char c; while ((c = getchar()) < - ) ; if (c == - ) { int x = (c = getchar()) - 0 ; while ((c = getchar()) >= 0 ) x = x * 10 + c - 0 ; return -x; } int x = c - 0 ; while ((c = getchar()) >= 0 ) x = x * 10 + c - 0 ; return x; } const int N = 2e5 + 5, D = 998244353; int64_t mi(int64_t x, int y = D - 2) { int64_t ans = 1; while (y) { if (y & 1) ans = ans * x % D; x = x * x % D; y >>= 1; } return ans; } void operator+=(pair<int64_t, int64_t> &a, const pair<int64_t, int64_t> &b) { (a.first += b.first) %= D; (a.second += b.second) %= D; } void mul(int64_t &a0, int64_t &a1, int64_t m[2][2]) { int64_t b0 = (m[0][0] * a0 + m[0][1] * a1) % D, b1 = (m[1][0] * a0 + m[1][1] * a1) % D; a0 = b0; a1 = b1; } int64_t m[2][2], m1[2][2]; namespace SEG { const int64_t T = N * 4; int64_t tag[T][2][2], sum[T][2]; int n; void mul(int k, int64_t m[2][2]) { for (int i = 0; i <= 1; ++i) { ::mul(tag[k][0][i], tag[k][1][i], m); } ::mul(sum[k][0], sum[k][1], m); } void push_down(int k) { if ((tag[k][0][0] - 1) % D || tag[k][0][1] || tag[k][1][0] || (tag[k][1][1] - 1) % D) { mul((k * 2), tag[k]); mul(((k * 2) + 1), tag[k]); for (int i = 0; i <= 1; ++i) for (int j = 0; j <= 1; ++j) tag[k][i][j] = i == j; } } void push_up(int k) { for (int i = 0; i <= 1; ++i) sum[k][i] = (sum[(k * 2)][i] + sum[((k * 2) + 1)][i]) % D; } void add(int x, const pair<int64_t, int64_t> &a) { int k = 1, l = 1, r = n; while (1) { (sum[k][0] += a.first) %= D; (sum[k][1] += a.second) %= D; if (l == r) break; push_down(k); if (x <= ((l + r) / 2)) { k = (k * 2); r = ((l + r) / 2); } else { k = ((k * 2) + 1); l = ((l + r) / 2) + 1; } } } pair<int64_t, int64_t> query(int x) { int k = 1, l = 1, r = n; pair<int64_t, int64_t> ans = pair<int64_t, int64_t>(0, 0); while (l != r) { push_down(k); if (x <= ((l + r) / 2)) { ans += pair<int64_t, int64_t>(sum[((k * 2) + 1)][0], sum[((k * 2) + 1)][1]); k = (k * 2); r = ((l + r) / 2); } else { k = ((k * 2) + 1); l = ((l + r) / 2) + 1; } } ans += pair<int64_t, int64_t>(sum[k][0], sum[k][1]); return ans; } int ql, qr; void modify(int k, int l, int r) { if (ql > r || qr < l) return; if (ql <= l && qr >= r) { mul(k, m); return; } push_down(k); modify((k * 2), l, ((l + r) / 2)); modify(((k * 2) + 1), ((l + r) / 2) + 1, r); push_up(k); } void modify(int l, int r) { ql = l; qr = r; modify(1, 1, n); } }; // namespace SEG bool cmp(const pair<int, int> &a, const pair<int, int> &b) { return 1LL * a.first * b.second < 1LL * a.second * b.first; } pair<int, int> q[N]; int t; int main() { int n = read(); static int x[N], v[N], p[N]; for (int i = 1; i <= n; ++i) { x[i] = read(); v[i] = read(); p[i] = read() * mi(100) % D; } t = 1; q[1] = pair<int, int>(1, 0); for (int i = 2; i <= n; ++i) { q[++t] = pair<int, int>(x[i] - x[i - 1], v[i] + v[i - 1]); if (v[i] != v[i - 1]) q[++t] = pair<int, int>(x[i] - x[i - 1], abs(v[i] - v[i - 1])); } sort(q + 1, q + t + 1, cmp); SEG::n = t; SEG::add(t, pair<int64_t, int64_t>(1 - p[1], p[1])); for (int i = 2; i <= n; ++i) { int j0 = lower_bound(q + 1, q + t, pair<int, int>(x[i] - x[i - 1], v[i] + v[i - 1]), cmp) - q; int j1 = lower_bound(q + 1, q + t, pair<int, int>(x[i] - x[i - 1], abs(v[i] - v[i - 1])), cmp) - q; pair<int64_t, int64_t> s0 = SEG::query(j0), s1 = SEG::query(j1); int64_t np = p[i]; for (int i = 0; i <= 1; ++i) for (int j = 0; j <= 1; ++j) m[i][j] = (i == 0) ? 1 - np : np; SEG::modify(1, j0 - 1); for (int i = 0; i <= 1; ++i) for (int j = 0; j <= 1; ++j) if (j == 1 && i == 0) { m1[i][j] = m[i][j]; m[i][j] = 0; } else m1[i][j] = 0; mul(s0.first, s0.second, m1); SEG::modify(j0, j1 - 1); SEG::add(j0, s0); int ni = v[i] > v[i - 1] ? 0 : 1; for (int i = 0; i <= 1; ++i) for (int j = 0; j <= 1; ++j) if (i == j && (i == ni)) { m1[i][j] = m[i][j]; m[i][j] = 0; } else m1[i][j] = 0; mul(s1.first, s1.second, m1); SEG::modify(j1, t); SEG::add(j1, s1); } auto S = [&](const pair<int64_t, int64_t> &a) -> int64_t { return (a.first + a.second) % D; }; int64_t ans = 0; for (int i = 1; i <= t - 1; ++i) (ans += (S(SEG::query(i)) - S(SEG::query(i + 1))) * q[i].first % D * mi(q[i].second)) %= D; cout << (ans + D) % D << endl; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const long long SZ = 1010, SSZ = 100010, APB = 26, one = 93, INF = 0x3f3f3f3f3f3f3f3f, mod = 1000000007; long long n, m, bg, fn, cnt; long long to[SSZ], wt[SSZ], head[SZ]; long long nex[SSZ], mk[SSZ]; long long dfn[SZ], low[SZ], tot; bool vst[SZ]; void add(long long u, long long v, long long w) { ++cnt; nex[cnt] = head[u]; head[u] = cnt; to[cnt] = v, wt[cnt] = w; } bool dfs(long long x) { vst[x] = 1; if (x == fn) return 1; for (long long i = head[x]; i != -1; i = nex[i]) { long long t = to[i]; if (!vst[t]) { mk[i] = 1; if (dfs(t)) return 1; mk[i] = 0; } } return 0; } stack<long long> stk; void tar(long long x, long long p, long long &res2, long long &eg2) { dfn[x] = low[x] = ++tot; vst[x] = 1; for (long long i = head[x]; i != -1; i = nex[i]) { if (i != (p ^ 1) && mk[i] != 2 && mk[i ^ 1] != 2) { long long t = to[i], w = wt[i]; if (!dfn[t]) { tar(t, i, res2, eg2); low[x] = min(low[x], low[t]); } else low[x] = min(low[x], low[t]); if (dfn[x] < low[t] && dfn[fn] >= dfn[t]) { if (w < res2) { res2 = w, eg2 = i; } } } } } void init() { cin >> n >> m >> bg >> fn; cnt = -1; memset(head, -1, sizeof(head)); for (long long i = 1; i <= m; ++i) { long long a, b, c; cin >> a >> b >> c; add(a, b, c); add(b, a, c); } dfs(bg); if (vst[fn] == 0) { cout << 0 << endl << 0; return; } long long res = INF, vt1 = -1, vt2; for (long long i = 0; i <= cnt; ++i) { if (mk[i]) { mk[i] = 2; memset(vst, 0, sizeof(vst)); tot = 0; memset(dfn, 0, sizeof(dfn)); memset(low, 0, sizeof(low)); long long res1 = wt[i], res2 = INF, eg1 = i, eg2; tar(bg, -1, res2, eg2); if (!vst[fn]) res2 = 0, eg2 = -5; if (res1 + res2 < res) { res = res1 + res2; vt1 = eg1 / 2 + 1, vt2 = eg2 / 2 + 1; } mk[i] = 1; } } if (vt1 == -1) { cout << -1 << endl; return; } cout << res << endl; cout << (vt2 == -1 ? 1 : 2) << endl; cout << vt1 << ; if (vt2 != -1) cout << vt2 << endl; } void work() {} int main() { std::ios::sync_with_stdio(0); long long casenum; { init(); work(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int x; cin >> x; vector<int> first(x); vector<int> second(x); int sum_f = 0; for (int i = 0; i < x; i++) { cin >> first[i]; sum_f += first[i]; } int sum_s = 0; for (int i = 0; i < x; i++) { cin >> second[i]; sum_s += second[i]; } if (sum_s > sum_f) { cout << No ; } else cout << Yes ; return 0; } |
#include <bits/stdc++.h> using namespace std; int tavan(int a, int n, int mod) { int res = 1; while (n) res *= (n & 1) ? a : 1, res %= mod, n /= 2, a *= a, a %= mod; return res; } const int MOD = ((int)81671); const int N = ((int)40); const int M = ((int)12); const int X = ((int)2e6); int n, m, p[M]; string s[M], now; bool mark[X]; vector<string> v; void solve(int pos, int x) { if (x < 0) return; if (pos == (int)s[0].size() && x != 0) return; if (x == 0) { for (int i = pos; i < s[0].size(); i++) now[i] = (s[0][i] == 0 ) ? 1 : 0 ; v.push_back(now); return; } now[pos] = s[0][pos]; solve(pos + 1, x - 1); now[pos] = (s[0][pos] == 0 ) ? 1 : 0 ; solve(pos + 1, x); now[pos] = s[0][pos]; } int main() { cin >> n >> m >> s[0] >> p[0]; now = s[0]; solve(0, p[0]); int ans = v.size(); for (int i = 1; i < m; i++) { cin >> s[i] >> p[i]; for (int j = 0; j < v.size(); j++) if (!mark[j]) { int num = 0; for (int k = 0; k < v[j].size(); k++) if (v[j][k] == s[i][k]) num++; if (num != p[i]) mark[j] = 1, ans--; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int main() { int T, t1 = 0, t2, maxn = 0, flag = 1, sum = 0, sum1 = 0; scanf( %d , &T); while (T--) { scanf( %d , &t2); if (flag && t2 == 0) { maxn = max(maxn, sum); sum1 = sum; sum = 0; flag = 0; continue; } if (t2 == 0) { maxn = max(maxn, sum); sum = 0; continue; } sum++; if (T == 0) { maxn = max(sum + sum1, maxn); } } printf( %d n , maxn); } |
#include <bits/stdc++.h> using namespace std; int n, k, a[(int)2e5]; long long sum; double d, res; int main() { cin >> n >> k; for (int i = 0; i < n; ++i) { cin >> a[i]; if (i < k) sum += a[i]; } d = n - k + 1; res += sum / d; for (int i = k; i < n; ++i) { sum -= a[i - k]; sum += a[i]; res += sum / d; } cout << fixed << setprecision(6) << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == a ) a++; } for (int i = s.size(); i >= a; i--) { if (a > (i / 2)) { cout << i << endl; exit(0); } } } |
#include <bits/stdc++.h> using namespace std; int ABS(int a) { if (a < 0) return (-a); return a; } vector<int> v[50005]; int main() { int n, r1, r2, i; scanf( %d , &n); scanf( %d , &r1); scanf( %d , &r2); for (i = (1); i < (n + 1); ++i) { if (r1 == i) continue; int x; scanf( %d , &x); v[x].push_back(i); v[i].push_back(x); } int parent[50005] = {0}; bool vis[50005] = {0}; queue<int> q; q.push(r2); parent[r2] = -1; vis[r2] = 1; while (!q.empty()) { int x = q.front(); q.pop(); for (i = (0); i < (v[x].size()); ++i) { int next = v[x][i]; if (!vis[next]) { q.push(next); parent[next] = x; vis[next] = 1; } } } for (i = (1); i < (n + 1); ++i) { if (i == r2) continue; printf( %d , parent[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; function<void(void)> ____ = []() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; const int MAXN = 555; int n, m, match[MAXN]; bool mp[MAXN][MAXN], vis[MAXN]; vector<int> G[MAXN]; bool dfs(int u, int c) { vis[u] = true; for (int v : G[u]) { if (v == c) continue; if (match[v] == -1 or (!vis[match[v]] and dfs(match[v], c))) { match[v] = u; return true; } } return false; } int hungary(int c) { memset(match, 255, sizeof(match)); int mt = 0; for (int i = 1; i <= n; i++) { if (i == c) continue; memset(vis, 0, sizeof(vis)); if (dfs(i, c)) mt++; } return mt; } int main() { ____(); cin >> n >> m; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; G[u].push_back(v); mp[u][v] = true; } int ret = MAXN * MAXN * MAXN; for (int i = 1; i <= n; i++) { int centeredge = 0; for (int j = 1; j <= n; j++) { if (i == j and mp[i][j]) centeredge++; else if (i != j) { if (mp[i][j]) centeredge++; if (mp[j][i]) centeredge++; } } int mt = hungary(i); ret = min(ret, 3 * n + m - 2 - 2 * centeredge - 2 * mt); } cout << ret << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 110; const double EPS = 1E-10; struct TTriangle { double x[3], y[3]; } a[MaxN]; struct TSeg { double x[2], y[2]; } Seg[MaxN * 3]; int n, Total; double Ans; pair<double, int> s[MaxN * 3 * 2]; inline double Cross(const double x1, const double y1, const double x2, const double y2) { return x1 * y2 - x2 * y1; } inline bool Equal(const TTriangle &a, const TTriangle &b) { return a.x[0] == b.x[0] && a.y[0] == b.y[0] && a.x[1] == b.x[1] && a.y[1] == b.y[1] && a.x[2] == b.x[2] && a.y[2] == b.y[2] || a.x[0] == b.x[1] && a.y[0] == b.y[1] && a.x[1] == b.x[2] && a.y[1] == b.y[2] && a.x[2] == b.x[0] && a.y[2] == b.y[0] || a.x[0] == b.x[2] && a.y[0] == b.y[2] && a.x[1] == b.x[0] && a.y[1] == b.y[0] && a.x[2] == b.x[1] && a.y[2] == b.y[1]; } void Init() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %lf%lf%lf%lf%lf%lf , &a[i].x[0], &a[i].y[0], &a[i].x[1], &a[i].y[1], &a[i].x[2], &a[i].y[2]); if (Cross(a[i].x[1] - a[i].x[0], a[i].y[1] - a[i].y[0], a[i].x[2] - a[i].x[0], a[i].y[2] - a[i].y[0]) < -EPS) { swap(a[i].x[1], a[i].x[2]); swap(a[i].y[1], a[i].y[2]); } for (int j = 1; j < i; ++j) if (Equal(a[i], a[j])) { --i, --n; break; } } for (int i = 1; i <= n; ++i) { Seg[i * 3 - 2].x[0] = a[i].x[0], Seg[i * 3 - 2].y[0] = a[i].y[0], Seg[i * 3 - 2].x[1] = a[i].x[1], Seg[i * 3 - 2].y[1] = a[i].y[1]; Seg[i * 3 - 1].x[0] = a[i].x[1], Seg[i * 3 - 1].y[0] = a[i].y[1], Seg[i * 3 - 1].x[1] = a[i].x[2], Seg[i * 3 - 1].y[1] = a[i].y[2]; Seg[i * 3].x[0] = a[i].x[2], Seg[i * 3].y[0] = a[i].y[2], Seg[i * 3].x[1] = a[i].x[0], Seg[i * 3].y[1] = a[i].y[0]; } } inline bool Check(const TSeg &a, const TSeg &b) { return Cross(b.x[0] - a.x[0], b.y[0] - a.y[0], b.x[1] - a.x[0], b.y[1] - a.y[0]) * Cross(b.x[0] - a.x[1], b.y[0] - a.y[1], b.x[1] - a.x[1], b.y[1] - a.y[1]) < EPS; } inline double GetRatio(const TSeg &a, const TSeg &b) { const double u = Cross(a.x[1] - a.x[0], a.y[1] - a.y[0], b.x[0] - a.x[0], b.y[0] - a.y[0]), v = u + Cross(b.x[1] - a.x[0], b.y[1] - a.y[0], a.x[1] - a.x[0], a.y[1] - a.y[0]); return u / v; } inline void Calc(const TSeg &a, const TSeg &b, const TSeg &c) { if (Check(a, c) && Check(b, c)) { double l = GetRatio(a, c), r = GetRatio(b, c); if (l > r) swap(l, r); l = (l > (double)0 ? l : (double)0); l = (l < (double)1 ? l : (double)1); r = (r > (double)0 ? r : (double)0); r = (r < (double)1 ? r : (double)1); if (fabs(l - r) < EPS) return; s[++Total] = make_pair(l, -1); s[++Total] = make_pair(r, 1); } } inline pair<double, double> RatioToVertex(const TSeg &a, const double &k) { return make_pair(a.x[0] + (a.x[1] - a.x[0]) * k, a.y[0] + (a.y[1] - a.y[0]) * k); } int main() { Init(); double l; pair<double, double> p1, p2; for (int i = 1, j, k; i <= n * 3; ++i) { for (j = 1, Total = 0; j <= n; ++j) if ((i - 1) / 3 + 1 != j) { Calc(Seg[j * 3 - 2], Seg[j * 3 - 1], Seg[i]); Calc(Seg[j * 3 - 1], Seg[j * 3], Seg[i]); Calc(Seg[j * 3], Seg[j * 3 - 2], Seg[i]); } sort(s + 1, s + Total + 1); s[++Total] = make_pair((double)1, 0); for (j = 1, k = 0; j <= Total; ++j) { if (!k) { p1 = RatioToVertex(Seg[i], s[j - 1].first); p2 = RatioToVertex(Seg[i], s[j].first); Ans += sqrt(((p1.first - p2.first) * (p1.first - p2.first)) + ((p1.second - p2.second) * (p1.second - p2.second))); } k -= s[j].second; } } cout << setprecision(10) << fixed << Ans << endl; return 0; } |
#include <bits/stdc++.h> const int maxn = 1e6 + 10; using namespace std; int pre[maxn]; int main() { string a, b; cin >> a; cin >> b; int LA = a.size(); int LB = b.size(); int flag = 0, ans = 0; for (int i = 0; i < LB; i++) { if (b[i] == 1 ) flag++; } flag %= 2; if (a[0] == 1 ) pre[1] = 1; for (int i = 1; i < LA; i++) { if (a[i] == 1 ) pre[i + 1] = pre[i] + 1; else pre[i + 1] = pre[i]; } int T = LA - LB; for (int i = 0; i <= T; i++) { if ((pre[i + LB] - pre[i]) % 2 == flag) { ans++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b, sum = 0, sum1 = 0; cin >> n >> m >> a >> b; sum = n / m; sum1 = n - (sum * m); if (sum * b < n * a) { cout << min((sum * b + sum1 * a), ((sum + 1) * b)); } if (sum * b >= n * a) { cout << n * a; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; unordered_map<long long, long long> m1, mp; long long m, k, n, s; bool check() { for (auto it : mp) { if (it.second > m1[it.first]) return false; } return true; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { cin >> m >> k >> n >> s; long long a[m]; long long i, j; for (int i = 0; i <= m - 1; i++) { cin >> a[i]; } long long b[s]; for (int i = 0; i <= s - 1; i++) { cin >> b[i]; mp[b[i]]++; } long long del = m - n * k; long long req = del + k; for (i = 0; i < m; i += k) { m1.clear(); for (j = i; j < min(m, i + req); j++) { m1[a[j]]++; } if (check()) { cout << del << n ; for (j = i; j < min(i + req, m); j++) { if (del > 0 && m1[a[j]] > mp[a[j]]) { cout << j + 1 << ; del--; m1[a[j]]--; } } return 0; } } cout << -1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, s, a[100005], p, w[100005], ans; multiset<long long> st; int main() { cin >> n >> s; for (int k = 1; k <= n; k++) cin >> a[k]; cin >> p; for (int k = 1; k <= n; k++) cin >> w[k]; for (int k = 1; k <= n; k++) { st.insert(w[k]); while (s < a[k]) { if (st.size() == 0) { cout << -1; return 0; } ans += *st.begin(); st.erase(st.begin()); s += p; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int limite = 1000000; int n; long long int a[limite]; long long int suma[limite]; map<long long int, int> cuantos; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i + n] = a[i]; } for (int i = 1; i <= 2 * n; i++) suma[i] = suma[i - 1] + a[i]; for (int i = 1; i <= n; i++) cuantos[suma[i]]++; int sol = n; for (int i = 1; i <= n; i++) { sol = min(sol, n - cuantos[suma[i - 1]]); cuantos[suma[i]]--; cuantos[suma[i + n]]++; } cout << sol << endl; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int n, m, k; vector<double> r1, p1, p2; cin >> n; while (n--) { int hlp; cin >> hlp; r1.push_back(hlp); } cin >> m; while (m--) { int hlp; cin >> hlp; p1.push_back(hlp); } cin >> k; while (k--) { int hlp; cin >> hlp; p2.push_back(hlp); } double A, B; cin >> A >> B; double maxr2 = 0; sort(r1.begin(), r1.end()); sort(p1.begin(), p1.end()); sort(p2.begin(), p2.end()); { maxr2 = r1[r1.size() - 1] * sqrt(p1[p1.size() - 1] / p2[0] / (A / B + p1[p1.size() - 1] / p2[0])); } char buf[256]; cout << gcvt(maxr2, 50, buf); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000; const int INF = 1000000001; vector<int> G[MAXN + 1]; bool vis[MAXN + 1]; vector<int> CC; int n, m, k; int dfs(int v) { vis[v] = true; int ret = 1; for (__typeof((G[v]).begin()) u = (G[v]).begin(); u != (G[v]).end(); ++u) if (!vis[*u]) ret += dfs(*u); return ret; } int main(int argc, char *argv[]) { scanf( %d %d %d , &n, &m, &k); while (m--) { int a, b; scanf( %d %d , &a, &b); G[a].push_back(b); G[b].push_back(a); } int t = 0; int s = 0; for (int i = 1; i <= n; ++i) if (!vis[i]) CC.push_back(min(k, dfs(i))), t += CC.back() == 1 ? 0 : CC.back(), s += CC.back() != 1; t = t - 2 * s + 2; if (k == 1) printf( %d n , max(0, (int)CC.size() - 2)); else printf( %d n , (max(0, ((int)CC.size() - s) - t + 1)) / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, x, y, n, ans, t; cin >> t; while (t--) { ans = LLONG_MAX; cin >> a >> b >> x >> y >> n; if (n >= (a - x + b - y)) cout << x * y << n ; else { if ((a - n) >= x) ans = (a - n) * b; else { if (b - (x - a + n) >= y) ans = min(ans, x * (b - (x - a + n))); } if ((b - n) >= y) ans = min(ans, (b - n) * a); else { if (a - (y - b + n) >= x) ans = min(ans, y * (a - (y - b + n))); } cout << ans << n ; } } } |
#include <bits/stdc++.h> using namespace std; int n, m, l[2001], s[2001], c[4001]; int f[4001][2001]; int main() { scanf( %d%d , &n, &m); m += n; for (int i = n; i >= 1; i -= 1) scanf( %d , &l[i]); for (int i = n; i >= 1; i -= 1) scanf( %d , &s[i]); for (int i = 1; i <= m; i += 1) scanf( %d , &c[i]); for (int i = 1; i <= m; i += 1) { for (int j = 1; j <= n; j += 1) f[i][j] = -1e9; } for (int i = 1; i <= n; i += 1) { for (int j = n; j >= 1; j -= 1) { f[l[i]][j] = max(f[l[i]][j], f[l[i]][j - 1] - s[i] + c[l[i]]); } for (int j = l[i]; j < m; j += 1) { for (int k = 0; k <= (n >> j - l[i]); k += 1) { f[j + 1][k >> 1] = max(f[j + 1][k >> 1], f[j][k] + c[j + 1] * (k >> 1)); } } } printf( %d n , f[m][0]); return 0; } |
#include <bits/stdc++.h> int main() { long long int a, b = 1, i; scanf( %I64d , &a); for (i = 1; i <= a; i++) { b += 12 * (1 + i - 2); } if (a == 1) printf( 1 ); else printf( %I64d , b); return 0; } |
#include <bits/stdc++.h> using namespace std; pair<long long int, long long int> rec(long long int n) { long long int mini = 1e18, maxi = -1; while (n) { mini = min(mini, n % 10); maxi = max(maxi, n % 10); n /= 10; } return {mini, maxi}; } int main() { long long int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; k--; while (k--) { pair<long long int, long long int> x = rec(n); if (x.first == 0) break; n += (x.first * x.second); } cout << n << endl; } } |
#include <bits/stdc++.h> using namespace std; int const maxn = 1e6 + 5; int a[maxn], b[maxn]; pair<int, int> c[maxn]; int all_elem[2 * maxn]; int cur, inf = 1e9 + 7; int f[2 * maxn]; int psh[8 * maxn]; pair<int, int> imin[4 * maxn]; inline pair<int, int> unions(pair<int, int> c, pair<int, int> d) { if (c.first < d.first || (c.first == d.first && c.second > d.second)) return c; return d; } void build(int i, int l, int r) { psh[i] = 0; if (r - l == 1) imin[i] = {0, l}; else { int m = (r + l) / 2; build(2 * i + 1, l, m); build(2 * i + 2, m, r); imin[i] = unions(imin[2 * i + 1], imin[2 * i + 2]); } } inline void push(int i) { imin[i].first += psh[i]; psh[2 * i + 1] += psh[i]; psh[2 * i + 2] += psh[i]; psh[i] = 0; } void adds(int i, int l, int r, int lq, int rq, int x) { push(i); if (lq >= r || l >= rq) return; if (lq <= l && r <= rq) { psh[i] += x; push(i); return; } int m = (r + l) / 2; adds(2 * i + 1, l, m, lq, rq, x); adds(2 * i + 2, m, r, lq, rq, x); imin[i] = unions(imin[2 * i + 1], imin[2 * i + 2]); } pair<int, int> get(int i, int l, int r, int lq, int rq) { push(i); if (lq >= r || l >= rq) return {inf, inf}; if (lq <= l && r <= rq) return imin[i]; int m = (r + l) / 2; return unions(get(2 * i + 1, l, m, lq, rq), get(2 * i + 2, m, r, lq, rq)); } inline void add(int i) { while (i <= cur) { f[i]++; i = (i | (i + 1)); } } inline int get(int i) { int ans = 0; while (i > 0) { ans += f[i]; i = (i & (i + 1)) - 1; } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cur = 0; cin >> n >> m; build(0, 0, n + 1); for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= m; ++i) cin >> b[i]; sort(b + 1, b + m + 1); for (int i = 1; i <= n; ++i) { all_elem[++cur] = a[i]; } for (int i = 1; i <= m; ++i) { all_elem[++cur] = b[i]; } sort(all_elem + 1, all_elem + cur + 1); for (int i = 1; i <= n; ++i) { a[i] = lower_bound(all_elem + 1, all_elem + cur + 1, a[i]) - all_elem; } for (int i = 1; i <= m; ++i) { b[i] = lower_bound(all_elem + 1, all_elem + cur + 1, b[i]) - all_elem; } long long ans = 0; for (int i = 0; i <= cur; ++i) f[i] = 0; for (int i = n; i >= 1; --i) { ans += get(a[i]); add(a[i] + 1); } for (int i = 1; i <= n; ++i) c[i] = {a[i], i}; sort(c + 1, c + n + 1); int pos = n; for (int i = 1; i <= n; ++i) { adds(0, 0, n + 1, 0, i, 1); } int lptr = n, rptr = n; for (int i = m; i >= 1; --i) { if (b[i] != b[i + 1]) { while (rptr > lptr) { adds(0, 0, n + 1, c[rptr].second, n + 1, 1); rptr--; } } while (rptr > 0 && b[i] < c[rptr].first) { adds(0, 0, n + 1, 0, c[rptr].second, -1); adds(0, 0, n + 1, c[rptr].second, n + 1, 1); rptr--; } lptr = min(lptr, rptr); while (lptr > 0 && b[i] == c[lptr].first) { adds(0, 0, n + 1, 0, c[lptr].second, -1); lptr--; } pair<int, int> best = get(0, 0, n + 1, 0, pos + 1); ans += best.first; pos = best.second; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, m, same; string s; int main() { cin >> n >> m >> s; long long ans = 1LL * n * (m - 1); for (int i = 1; i < n; i++) { if (s[i] == s[i - 2]) { same++; } else { same = 0; } if (s[i] != s[i - 1]) { ans += 1LL * n * (m - 1) - same - 1; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> int main() { int i, m, j; char a[1000], b[1000]; scanf( %s %s , &a, &b); if (strlen(a) != strlen(b)) { printf( NO ); return 0; } j = strlen(b) - 1; for (i = 0; i < strlen(a); i++) { if (a[i] != b[j]) { printf( NO ); return 0; } j--; } printf( YES ); } |
#include <bits/stdc++.h> using namespace std; const long long MAX = 105; const long long MAXV = 2e5 + 1; const long long INF = 1e9; bool prime[MAXV]; void sieve() { memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for (long long i = 2; i * i < MAXV; i++) { if (prime[i]) { for (long long j = i * i; j < MAXV; j += i) prime[j] = false; } } } long long n, k, p[MAX], c[MAX], l[MAX]; struct edge { int from, to, flow, index; long long cap; edge(int from, int to, long long cap, int flow, int index) : from(from), to(to), cap(cap), flow(flow), index(index) {} }; struct PushRelabel { int n; vector<vector<edge>> g; vector<long long> excess; vector<int> height, active, count; queue<int> Q; PushRelabel(int n) : n(n), g(n), excess(n), height(n), active(n), count(2 * n) {} void addEdge(int from, int to, long long cap) { g[from].push_back(edge(from, to, cap, 0, g[to].size())); if (from == to) g[from].back().index++; g[to].push_back(edge(to, from, 0, 0, g[from].size() - 1)); } void enqueue(int v) { if (!active[v] && excess[v] > 0) { active[v] = true; Q.push(v); } } void push(edge &e) { int amt = (int)min(excess[e.from], (long long)e.cap - e.flow); if (height[e.from] <= height[e.to] || amt == 0) return; e.flow += amt; g[e.to][e.index].flow -= amt; excess[e.to] += amt; excess[e.from] -= amt; enqueue(e.to); } void relabel(int v) { count[height[v]]--; int d = 2 * n; for (auto &it : g[v]) { if (it.cap - it.flow > 0) d = min(d, height[it.to] + 1); } height[v] = d; count[height[v]]++; enqueue(v); } void gap(int k) { for (int v = 0; v < n; v++) { if (height[v] < k) continue; count[height[v]]--; height[v] = max(height[v], n + 1); count[height[v]]++; enqueue(v); } } void discharge(int v) { for (int i = 0; excess[v] > 0 && i < g[v].size(); i++) push(g[v][i]); if (excess[v] > 0) { if (count[height[v]] == 1) gap(height[v]); else relabel(v); } } long long max_flow(int source, int dest) { count[0] = n - 1, count[n] = 1, height[source] = n, active[source] = active[dest] = 1; for (auto &it : g[source]) { excess[source] += it.cap; push(it); } while (!Q.empty()) { int v = Q.front(); Q.pop(); active[v] = false; discharge(v); } long long max_flow = 0; for (auto &e : g[source]) max_flow += e.flow; return max_flow; } }; bool f(long long lvl) { vector<long long> v = {0}; long long sm = 0, mx = -1, id = 0; for (long long i = 1; i <= n; i++) { if (l[i] <= lvl) { if (c[i] != 1) { sm += p[i]; v.push_back(i); } else { if (p[i] > mx) { mx = p[i]; id = i; } } } } if (mx != -1) { v.push_back(id); sm += p[id]; } long long cnt = v.size() - 1; PushRelabel Network(cnt + 2); long long s = 0, t = cnt + 1; vector<int> odd, even; odd.push_back(0), even.push_back(0); for (int i = 1; i <= cnt; i++) { if (c[v[i]] & 1) odd.push_back(v[i]); else even.push_back(v[i]); } int os = odd.size() - 1, es = even.size() - 1; for (int i = 1; i <= os; i++) Network.addEdge(s, i, p[odd[i]]); for (int i = 1; i <= es; i++) Network.addEdge(os + i, t, p[even[i]]); for (int i = 1; i <= os; i++) { for (int j = 1; j <= es; j++) { int idx1 = odd[i], idx2 = even[j]; if (prime[c[idx1] + c[idx2]]) Network.addEdge(i, os + j, INF); } } long long flow = Network.max_flow(s, t); long long mxpow = sm - flow; return mxpow >= k; } void solve() { long long l = 0, r = n + 1; while (r - l > 1) { long long mid = (l + r) / 2; if (f(mid)) r = mid; else l = mid; } if (f(r)) cout << r; else cout << -1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); sieve(); cin >> n >> k; for (long long i = 1; i <= n; i++) cin >> p[i] >> c[i] >> l[i]; solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T fetch() { T ret; cin >> ret; return ret; } template <typename T> inline vector<T> fetch_vec(long long sz) { vector<T> ret(sz); for (auto& it : ret) cin >> it; return ret; } template <typename T> inline void makeUnique(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } template <typename T> inline T max_(T a, T b) { if (a > b) return a; return b; } template <typename T> inline T min_(T a, T b) { if (a < b) return a; return b; } void file() {} void Match() {} const long long N = 2e5 + 5; long long son[N * 32][2], pos = 0, cnt[N * 32]; long long dfs(long long p, long long digit) { long long p0 = son[p][0]; long long p1 = son[p][1]; if (digit == 0) return max(cnt[p0], cnt[p1]) + (cnt[p0] & cnt[p1]); long long num0 = 0, num1 = 0; if (p0) num0 = dfs(p0, digit - 1); if (p1) num1 = dfs(p1, digit - 1); return max(num0, num1) + (num0 && num1); } signed main() { ios::sync_with_stdio(false); cin.tie(0); ; file(); long long n; cin >> n; for (long long i = 0; i < n; i++) { long long num, p = 0; cin >> num; for (long long i = 30; i >= 0; i--) { long long& t = son[p][num >> i & 1]; if (!t) t = ++pos; cnt[t]++; p = t; } } cout << n - dfs(0, 30) << n ; Match(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, cnt, x, y, mx, tot; int head[200005], bin[200005], V[200005 * 5], T[200005 * 5]; struct pl { int v, nex; } e[2 * 200005]; void add(int a, int b) { cnt++; e[cnt].v = b; e[cnt].nex = head[a]; head[a] = cnt; bin[a]++; } void dfs(int a, int fa, int ti) { int fl = ti; V[++tot] = a; T[tot] = ti; if (ti == mx && a != 1) { ti -= bin[a]; V[++tot] = a; T[tot] = ti; } int i = head[a]; while (i != 0) { if (e[i].v != fa) { dfs(e[i].v, a, ti + 1); ti++; V[++tot] = a; T[tot] = ti; if (ti == mx && a != 1) { ti -= bin[a]; V[++tot] = a; T[tot] = ti; } } i = e[i].nex; } if (ti != fl - 1 && a != 1) { ti = fl - 1; V[++tot] = a; T[tot] = ti; } } int main() { scanf( %d , &n); if (n == 1) { puts( 1 ); puts( 1 0 ); return 0; } for (int i = 1; i < n; i++) scanf( %d%d , &x, &y), add(x, y), add(y, x); for (int i = 1; i <= n; i++) mx = max(mx, bin[i]); dfs(1, 0, 0); printf( %d n , tot); for (int i = 1; i <= tot; i++) printf( %d %d n , V[i], T[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, t; char a[3][200]; bool vis[3][200]; bool check(int x, int y) { return (x >= 0 && y >= 0 && x < 3 && y < 200); } void solve(int cx, int cy) { if (vis[cx][cy]) { return; } vis[cx][cy] = true; if (check(cx, cy + 3) && a[cx][cy + 1] == . && a[cx][cy + 2] == . ) { solve(cx, cy + 3); } if (check(cx + 1, cy + 3) && a[cx][cy + 1] == . && a[cx + 1][cy + 1] == . && a[cx + 1][cy + 2] == . ) { solve(cx + 1, cy + 3); } if (check(cx - 1, cy + 3) && a[cx][cy + 1] == . && a[cx - 1][cy + 1] == . && a[cx - 1][cy + 2] == . ) { solve(cx - 1, cy + 3); } } int main() { cin >> t; while (t--) { memset(vis, 0, sizeof(vis)); for (int i = 0; i < 3; i++) { for (int j = 0; j < 200; j++) { a[i][j] = . ; } } cin >> n >> k; int x, y; for (int i = 0; i < 3; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; if (a[i][j] == s ) { x = i, y = j; } } } solve(x, y); bool ans = false; for (int i = 0; i < 3; i++) { for (int j = n - 1; j < 200; j++) { ans |= vis[i][j]; } } if (ans) { cout << YES n ; } else { cout << NO n ; } } 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 / gcd(a, b) * b); } bool sorta(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } bool sortd(const pair<int, int> &a, const pair<int, int> &b) { return (a.second > b.second); } void printarr(long long arr[], long long n) { for (int i = 0; i < n; i++) cout << arr[i] << ; cout << n ; } string decToBinary(int n) { string s = ; int i = 0; while (n > 0) { s = to_string(n % 2) + s; n = n / 2; i++; } return s; } long long binaryToDecimal(string n) { string num = n; long long dec_value = 0; int base = 1; int len = num.length(); for (int i = len - 1; i >= 0; i--) { if (num[i] == 1 ) dec_value += base; base = base * 2; } return dec_value; } bool isPrime(long long n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; long long i = 1; while (t--) { long long w, h; cin >> w >> h; long long arr1[4]; for (int i = 0; i < 4; i++) { int k; cin >> k; long long arr[k]; for (int j = 0; j < k; j++) cin >> arr[j]; arr1[i] = arr[k - 1] - arr[0]; } arr1[0] *= h, arr1[1] *= h; arr1[2] *= w, arr1[3] *= w; long long maxan = max({arr1[0], arr1[1], arr1[2], arr1[3]}); cout << maxan << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3 + 2e5; int root[N], ls[N << 5], rs[N << 5], id; int sum[N << 5]; int n, q, p[N]; void update(int &u, int v, int l, int r, int p) { sum[u = ++id] = sum[v] + 1; if (l == r) return; int mid = l + r >> 1; if (p <= mid) rs[u] = rs[v], update(ls[u], ls[v], l, mid, p); else ls[u] = ls[v], update(rs[u], rs[v], mid + 1, r, p); } int query(int u, int v, int l, int r, int L, int R) { if (L <= l && r <= R) return sum[v] - sum[u]; int ans = 0, mid = l + r >> 1; if (L <= mid) ans = query(ls[u], ls[v], l, mid, L, R); if (R > mid) ans += query(rs[u], rs[v], mid + 1, r, L, R); return ans; } int query(int d, int u, int l, int r) { if (l > r || u < d) return 0; return query(root[l - 1], root[r], 1, n, d, u); } int main() { int l, d, r, u; scanf( %d%d , &n, &q); for (int i = 1; i <= n; ++i) { scanf( %d , p + i); update(root[i], root[i - 1], 1, n, p[i]); } while (q--) { scanf( %d%d%d%d , &l, &d, &r, &u); long long a1 = query(u + 1, n, 1, l - 1); long long a2 = query(u + 1, n, l, r); long long a3 = query(u + 1, n, r + 1, n); long long a4 = query(d, u, 1, l - 1); long long a5 = query(d, u, l, r); long long a6 = query(d, u, r + 1, n); long long a7 = query(1, d - 1, 1, l - 1); long long a8 = query(1, d - 1, l, r); long long a9 = query(1, d - 1, r + 1, n); long long ans = 0; ans = a1 * (a5 + a6 + a8 + a9); ans += a2 * (a4 + a5 + a6 + a7 + a8 + a9); ans += a3 * (a4 + a5 + a7 + a8); ans += a4 * (a5 + a6 + a8 + a9); ans += a5 * (a6 + a7 + a8 + a9); ans += a6 * (a7 + a8); ans += a5 * (a5 - 1) / 2; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, p; cin >> n >> k; int l = log2(n) + 1; for (long int i = 1; i <= 30; i++) { if (n - i * k > 0) { p = n - i * k; bitset<30> b(p); if (i > b.count() && p != 1 && p >= i) { cout << i; break; } else if (i == b.count()) { cout << i; break; } } else { cout << -1 ; break; } } } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > sol[1 << 9]; vector<pair<int, int> > gs(int t, int x) { static int fm[1 << 19]; static pair<int, int> fs[1 << 19]; queue<int> q; vector<pair<pair<int, int>, int> > sb; for (int i = 0; i < (1 << t); ++i) fm[i] = -1; for (int i = 0; i < t; ++i) for (int k = 1; i + k + k < t; ++k) sb.push_back(make_pair(pair<int, int>(i, k), (1 << i) ^ (1 << (i + k)) ^ (1 << (i + k + k)))); q.push(x); fm[x] = -2; while (!q.empty()) { int w = q.front(); q.pop(); for (auto p : sb) { if (fm[w ^ p.second] != -1) continue; fm[w ^ p.second] = w; fs[w ^ p.second] = p.first; q.push(w ^ p.second); } } if (fm[0] == -1) throw GG ; int tt = 0; vector<pair<int, int> > vp; while (tt != x) vp.push_back(fs[tt]), tt = fm[tt]; return vp; } int n; int a[233333]; int main() { int mx = 0; for (int i = 0; i < (1 << 9); ++i) { vector<pair<int, int> > sb; for (int j = 0; j < 12; ++j) for (int k = 1; j + k + k < 12; ++k) sb.push_back(pair<int, int>(j, k)); random_shuffle(sb.begin(), sb.end()); int u = sb.size(); for (int x = -1; x < u; ++x) for (int y = x; y < u; ++y) for (int z = y; z < u; ++z) { vector<pair<int, int> > p; if (x >= 0) p.push_back(sb[x]); if (y >= 0) p.push_back(sb[y]); if (z >= 0) p.push_back(sb[z]); int w = i; for (auto h : p) { int a = h.first, b = h.second; if (a >= 0 && a < 9) w ^= 1 << a; if (a + b >= 0 && a + b < 9) w ^= 1 << (a + b); if (a + b + b >= 0 && a + b + b < 9) w ^= 1 << (a + b + b); } if (!w) { sol[i] = p; goto GG; } } cout << NMSL. n ; GG:; } scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , a + i); vector<pair<pair<int, int>, int> > vp; int l = 1; while (n - l + 1 >= 18) { int h = 0; for (int p = 0; p < 9; ++p) if (a[l + p]) h ^= 1 << p; vector<pair<int, int> > w = sol[h]; for (auto& t : w) { t.first += l; vp.push_back(make_pair(make_pair(t.first, t.first + t.second), t.first + t.second + t.second)); a[t.first] ^= 1; a[t.first + t.second] ^= 1; a[t.first + t.second + t.second] ^= 1; } l += 9; } try { int g = 0; for (int i = l; i <= n; ++i) if (a[i]) g ^= 1 << (i - l); vector<pair<int, int> > w = gs(n - l + 1, g); for (auto& t : w) { t.first += l; vp.push_back(make_pair(make_pair(t.first, t.first + t.second), t.first + t.second + t.second)); a[t.first] ^= 1; a[t.first + t.second] ^= 1; a[t.first + t.second + t.second] ^= 1; } } catch (...) { puts( NO ); return 0; } for (int i = 0; i <= n + 1; ++i) if (a[i]) throw GG ; puts( YES ); printf( %d n , int(vp.size())); for (auto t : vp) printf( %d %d %d n , t.first.first, t.first.second, t.second); } |
#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = s * 10 + ch - 0 ; ch = getchar(); } return s * w; } pair<int, int> p[200005]; set<pair<int, int> > s; void solve(int l, int r) { if (l >= r) return; int mid = (l + r) >> 1; for (int i = l; i <= r; i++) s.insert(pair<int, int>(p[mid].first, p[i].second)); solve(l, mid); solve(mid + 1, r); return; } int n; void init() { n = read(); for (int i = 1; i <= n; i++) { p[i].first = read(); p[i].second = read(); s.insert(p[i]); } sort(p + 1, p + n + 1); return; } void solv() { solve(1, n); printf( %d n , (int)s.size()); for (auto i = s.begin(); i != s.end(); i++) { printf( %d %d n , i->first, i->second); } return; } int main() { init(); solv(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, m, n, k, x, y, sum = 0; cin >> n >> k; vector<long long> sura; vector<pair<long long, long long> > dada; vector<pair<long long, long long> > dada2; vector<long long> su; long long arr[n]; priority_queue<long long, vector<long long>, greater<long long> > pq; for (i = 0; i < n; i++) { cin >> x; sura.push_back(x); } for (i = 0; i < n; i++) { cin >> x; dada.push_back(make_pair(sura[i], x)); dada2.push_back(make_pair(sura[i], i)); } sort(dada.begin(), dada.end()); sort(dada2.begin(), dada2.end()); for (i = 0; i < n; i++) { if (k == 0) { su.push_back(sum + dada[i].second); } else if (k > 0) { su.push_back(sum + dada[i].second); if (i < k) { sum += dada[i].second; pq.push(dada[i].second); } else { if (dada[i].second > pq.top()) { sum -= pq.top(); pq.pop(); sum += dada[i].second; pq.push(dada[i].second); } } } } for (i = 0; i < n; i++) { arr[dada2[i].second] = su[i]; } for (i = 0; i < n; i++) { cout << arr[i] << ; } } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> void chkmax(T1 &x, T2 y) { if (x < y) x = y; } inline void debug(int x) { fprintf(stderr, ycx has aked ioi %d times n , x); } namespace fastio { char rbuf[1 << 23], *p1 = rbuf, *p2 = rbuf, wbuf[1 << 23], *p3 = wbuf; inline char getc() { return p1 == p2 && (p2 = (p1 = rbuf) + fread(rbuf, 1, 1 << 23, stdin), p1 == p2) ? -1 : *p1++; } inline void putc(char x) { (*p3++ = x); } template <typename T> void read(T &x) { x = 0; char c = getchar(); T neg = 0; while (!isdigit(c)) neg |= !(c ^ - ), c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); if (neg) x = (~x) + 1; } template <typename T> void recursive_print(T x) { if (!x) return; recursive_print(x / 10); putc(x % 10 ^ 48); } template <typename T> void print(T x) { if (!x) putc( 0 ); if (x < 0) putc( - ), x = ~x + 1; recursive_print(x); } void print_final() { fwrite(wbuf, 1, p3 - wbuf, stdout); } } // namespace fastio const int MAXN = 2e5; const int LOG_N = 19; const int MOD = 1e9 + 7; int qpow(int x, int e = MOD - 2) { int ret = 1; for (; e; e >>= 1, x = 1ll * x * x % MOD) if (e & 1) ret = 1ll * ret * x % MOD; return ret; } int pr[MAXN / 5 + 5], vis[MAXN + 5], phi[MAXN + 5], mu[MAXN + 5], prcnt = 0; void sieve(int n) { phi[1] = mu[1] = 1; for (int i = 2; i <= n; i++) { if (!vis[i]) { pr[++prcnt] = i; phi[i] = i - 1; mu[i] = -1; } for (int j = 1; j <= prcnt && i * pr[j] <= n; j++) { vis[i * pr[j]] = 1; if (i % pr[j] == 0) { phi[i * pr[j]] = phi[i] * pr[j]; break; } else phi[i * pr[j]] = phi[i] * phi[pr[j]], mu[i * pr[j]] = -mu[i]; } } } int n, a[MAXN + 5], pos[MAXN + 5], f[MAXN + 5], res[MAXN + 5]; int hd[MAXN + 5], to[MAXN * 2 + 5], nxt[MAXN * 2 + 5], ec = 0; void adde(int u, int v) { to[++ec] = v; nxt[ec] = hd[u]; hd[u] = ec; } int seq[MAXN * 2 + 5], dfn[MAXN + 5], tim = 0, tim_dfn = 0, dep[MAXN + 5], bgt[MAXN + 5]; pair<int, int> st[MAXN * 2 + 5][LOG_N + 2]; void dfs(int x, int f) { bgt[x] = ++tim_dfn; for (int e = hd[x]; e; e = nxt[e]) { int y = to[e]; if (y == f) continue; dep[y] = dep[x] + 1; dfs(y, x); seq[++tim] = x; } seq[++tim] = x; dfn[x] = tim; } pair<int, int> querymn(int l, int r) { int k = 31 - __builtin_clz(r - l + 1); return min(st[l][k], st[r - (1 << k) + 1][k]); } int getlca(int x, int y) { if (dfn[x] > dfn[y]) x ^= y ^= x ^= y; return querymn(dfn[x], dfn[y]).second; } int pt[MAXN + 5], pcnt = 0, stk[MAXN + 5], tp = 0; bool in[MAXN + 5]; vector<pair<int, int> > g[MAXN + 5]; void adde_vir(int u, int v) { g[u].push_back(make_pair(v, dep[v] - dep[u])); } void insert(int x) { if (!tp) { stk[++tp] = x; return; } int lca = getlca(x, stk[tp]); while (tp >= 2 && dep[lca] < dep[stk[tp - 1]]) { adde_vir(stk[tp - 1], stk[tp]); tp--; } if (tp && dep[lca] < dep[stk[tp]]) adde_vir(lca, stk[tp--]); if (!tp || stk[tp] != lca) stk[++tp] = lca; stk[++tp] = x; } void fin() { while (tp >= 2) adde_vir(stk[tp - 1], stk[tp]), tp--; tp = 0; } int ret = 0, dp[MAXN + 5], dis[MAXN + 5]; void dfs_vir(int x) { dp[x] = 0; for (int i = 0; i < g[x].size(); i++) { int y = g[x][i].first, z = g[x][i].second; dis[y] = dis[x] + z; dfs_vir(y); ret = (ret - 2ll * dp[x] * dp[y] % MOD * dis[x] % MOD + MOD) % MOD; dp[x] = (dp[x] + dp[y]) % MOD; } if (in[x]) { ret = (ret - 1ll * dp[x] * phi[a[x]] % MOD * dis[x] % MOD + MOD) % MOD; dp[x] = (dp[x] + phi[a[x]]) % MOD; ret = (ret - 1ll * dp[x] * phi[a[x]] % MOD * dis[x] % MOD + MOD) % MOD; } } void clear(int x) { dp[x] = dis[x] = 0; for (int i = 0; i < g[x].size(); i++) clear(g[x][i].first); while (g[x].size()) g[x].pop_back(); } int solve(int x) { pcnt = 0; for (int i = x; i <= n; i += x) pt[++pcnt] = pos[i], in[pos[i]] = 1; sort(pt + 1, pt + pcnt + 1, [](int x, int y) { return bgt[x] < bgt[y]; }); if (!in[1]) insert(1); for (int i = 1; i <= pcnt; i++) insert(pt[i]); fin(); ret = 0; dfs_vir(1); int s1 = 0, s2 = 0; for (int i = 1; i <= pcnt; i++) { s1 = (s1 + 1ll * phi[a[pt[i]]] * dis[pt[i]]) % MOD; s2 = (s2 + phi[a[pt[i]]]) % MOD; } ret = (ret + 1ll * s1 * s2) % MOD; ret = ret * 2 % MOD; clear(1); for (int i = x; i <= n; i += x) in[pos[i]] = 0; return ret; } int main() { scanf( %d , &n); sieve(n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), pos[a[i]] = i; for (int i = 1, u, v; i < n; i++) scanf( %d%d , &u, &v), adde(u, v), adde(v, u); dfs(1, 0); for (int i = 1; i <= n << 1; i++) st[i][0] = make_pair(dep[seq[i]], seq[i]); for (int i = 1; i <= LOG_N; i++) for (int j = 1; j + (1 << i) - 1 <= n << 1; j++) st[j][i] = min(st[j][i - 1], st[j + (1 << i - 1)][i - 1]); for (int i = 1; i <= n; i++) f[i] = solve(i); for (int i = 1; i <= n; i++) for (int j = i; j <= n; j += i) { if (mu[j / i] == 1) res[i] = (res[i] + f[j]) % MOD; else if (mu[j / i] == -1) res[i] = (res[i] - f[j] + MOD) % MOD; } int ans = 0; for (int i = 1; i <= n; i++) ans = (ans + 1ll * res[i] * i % MOD * qpow(phi[i])) % MOD; ans = 1ll * ans * qpow(n) % MOD; ans = 1ll * ans * qpow(n - 1) % MOD; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; bool neg = false; cin >> s; int n = s.length(); if (s[0] == - ) { neg = true; n--; } int cur = 0; if (n < 3) cur = 1; else if (n == 3) if ((!neg && s <= 127 ) || (neg && s <= -128 )) cur = 1; else cur = 2; else if (n < 5) cur = 2; else if (n == 5) if ((!neg && s <= 32767 ) || (neg && s <= -32768 )) cur = 2; else cur = 3; else if (n < 10) cur = 3; else if (n == 10) if ((!neg && s <= 2147483647 ) || (neg && s <= -2147483648 )) cur = 3; else cur = 4; else if (n < 19) cur = 4; else if (n == 19) if ((!neg && s <= 9223372036854775807 ) || (neg && s <= -9223372036854775808 )) cur = 4; else cur = 5; else cur = 5; if (cur == 1) cout << byte << endl; else if (cur == 2) cout << short << endl; else if (cur == 3) cout << int << endl; else if (cur == 4) cout << long << endl; else cout << BigInteger << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long mp[2005]; int main() { memset(mp, 0, sizeof mp); long long key[2001], a[2001], n, k, p, i, j; cin >> n >> k >> p; for (i = 0; i < n; i++) { scanf( %lld , a + i); } for (i = 0; i < k; i++) { scanf( %lld , key + i); } sort(a, a + n); sort(key, key + k); long long mn = 1e18; for (i = 0; i < k - n + 1; i++) { long long x = -1; for (int j = i, l = 0; l < n; l++, j++) { long long y = abs(a[l] - key[j]) + abs(p - key[j]); x = max(y, x); } mn = min(x, mn); } cout << mn; } |
#include <bits/stdc++.h> using namespace std; long long n, N, m, op, w, ax, ay, bx, by, cx, cy, ix, iy, bit[4][505][505]; long long v(long long x) { if (x & 1) return (x >> 1) + 1; else return x >> 1; } long long P(long long x, long long y) { if ((x & 1) && (y & 1)) return 0; if ((x & 1) && !(y & 1)) return 1; if (!(x & 1) && (y & 1)) return 2; if (!(x & 1) && !(y & 1)) return 3; } long long lowbit(long long x) { return x & (-x); } void add(long long x, long long y, long long w) { long long i, j, k = P(x, y); ix = v(x); iy = v(y); for (i = ix; i <= N; i += lowbit(i)) for (j = iy; j <= N; j += lowbit(j)) bit[k][i][j] ^= w; } long long get(long long x, long long y) { if (x == 0 || y == 0) return 0; long long i, j, k = P(x, y), ret = 0; ix = v(x); iy = v(y); for (i = ix; i; i -= lowbit(i)) for (j = iy; j; j -= lowbit(j)) ret ^= bit[k][i][j]; return ret; } signed main() { long long i, j; scanf( %lld%lld , &n, &m); N = v(n); while (m--) { scanf( %lld%lld%lld%lld%lld , &op, &ax, &ay, &bx, &by); if (op == 1) printf( %lld n , get(bx, by) ^ get(ax - 1, by) ^ get(bx, ay - 1) ^ get(ax - 1, ay - 1)); else { scanf( %lld , &w); add(ax, ay, w); add(bx + 1, ay, w); add(ax, by + 1, w); add(bx + 1, by + 1, w); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long poww(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md)); } const long long MAXN = 1e5 + 10; const long long INF = 8e18; const long long MOD = 1e9 + 7; set<pair<long long, long long> > st; set<long long> lst[MAXN], rst[MAXN], ust[MAXN], dst[MAXN]; long long n, m, k; int main() { cin >> n >> m >> k; long long u = 0, d = n + 1, l = 0, r = m + 1; for (int i = 0; i < k; i++) { long long x, y; cin >> x >> y; st.insert({x, y}); dst[y].insert(x); ust[y].insert(-x); rst[x].insert(y); lst[x].insert(-y); } long long dir = 0, cnt = 0; while (u + 1 < d && l + 1 < r) { if (dir == 0) { u++; auto it = rst[u].lower_bound(l + 1); if (it != rst[u].end()) r = min(*it, r); cnt += r - l - 1; } else if (dir == 1) { r--; auto it = dst[r].lower_bound(u + 1); if (it != dst[r].end()) d = min(*it, d); cnt += d - u - 1; } else if (dir == 2) { d--; auto it = lst[d].lower_bound(-1 * (r - 1)); if (it != lst[d].end()) l = max(-1 * (*it), l); cnt += r - l - 1; } else if (dir == 3) { l++; auto it = ust[l].lower_bound(-1 * (d - 1)); if (it != ust[l].end()) u = max(-1 * (*it), u); cnt += d - u - 1; } dir++; dir %= 4; } if (cnt == n * m - k) return cout << Yes << n , 0; cout << No << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long i, a[3333]; int t, n; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x; x = a[0] * a[n - 1]; int flag = 1, ans = 0; for (i = 0; i < n; i++) { if (x % a[i] != 0) flag = 0; } if (flag) { for (i = 2; i <= sqrt(x); i++) { if (x % i == 0) { if (x == i * i) ans++; else ans += 2; } } } if (flag && ans == n) cout << x << endl; else cout << -1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> cost[111111]; bool okay[111111]; int main(void) { int n = 0; int k = 0; scanf( %d %d , &n, &k); long long b = 0; scanf( %I64d , &b); for (int i = 0; i < n; i++) { scanf( %d , &cost[i].first); cost[i].second = i; } cost[n - 1].first = 0; sort(cost, cost + n); reverse(cost, cost + n); long long sum = 0; for (int i = 0; i < k; i++) { sum += cost[i].first; okay[cost[i].second] = true; } int last = cost[k - 1].first; for (int i = 0; i < n; i++) swap(cost[i].first, cost[i].second); sort(cost, cost + n); int ans = -1; if (sum <= b) { ans = n - 1; } else { sum -= last; for (int i = 0; i < n; i++) { if (okay[i] || sum + cost[i].second > b) { ans = i; break; } } } printf( %d n , ans + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXSZ = 100000; int req[MAXSZ]; int prob[MAXSZ]; int main(int argc, const char* argv[]) { int n, m, k; scanf( %d%d , &n, &m); int count = 1; for (int i = 0; i < m; i++) { scanf( %d , &k); prob[k]++; req[prob[k]]++; if (req[count] == n) { cout << 1; count++; } else { cout << 0; } } } |
#include <bits/stdc++.h> using namespace std; map<long long int, long long int> m; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long int x = 0, y = n - 1, iff = 1; vector<long long int> v; for (long long int i = 0; i < n; i++) { if (iff) { v.push_back(a[y]); y--; iff = 0; } else { v.push_back(a[x]); x++; iff = 1; } } for (long long int i = n - 1; i >= 0; i--) cout << v[i] << ; cout << endl; } } |
#include<iostream> #include<bits/stdc++.h> using namespace std; typedef long long int ll; ll max(ll a,ll b){ if(a>b)return a; return b; } int main(){ int T; cin>>T; while(T--){ int n,k; cin>>n>>k; string s1,s2; cin>>s1; cin>>s2; vector<int>c1(26,0),c2(26,0); for(int i=0;i<s1.length();i++){ c1[s1[i]- a ]++; } for(int i=0;i<s2.length();i++){ c2[s2[i]- a ]++; } for(int i=0;i<26;i++){ if(c1[i]==c2[i]){ c1[i]=0; c2[i]=0; } else if(c1[i]<c2[i]){ c2[i]-=c1[i]; c1[i]=0; } else{ c1[i]-=c2[i]; c2[i]=0; } } int f=0; int j=25;int i=25; while(j>=0 && i>=0){ if(c1[i]==0){ i--; continue; } if(c2[j]==0){ j--; continue; } if(i>j){ f=1; break; } if(c1[i]%k!=0){ f=1; break; } if(c2[j]%k!=0){ f=1; break; } if(c1[i]==c2[j]){ c1[i]=0; c2[j]=0; i--; j--; } else if(c1[i]>c2[j]){ c1[i]-=c2[j]; j--; } else{ c2[j]-=c1[i]; i--; } } if(f==1) cout<< NO <<endl; else cout<< YES <<endl; } } |
#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); int d = 0, f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; d = d * 10 + c - 48, c = getchar()) ; return d * f; } const int mod = 1e9 + 7; const int N = 3000010; int n, q, ft[N + 1], Ft[N + 1], ans[N + 1]; int mi(int a, int b) { int s = 1; for (; b; b >>= 1, a = (long long)a * a % mod) if (b & 1) s = (long long)s * a % mod; return s; } int main() { n = read(), q = read(); int maxn = n * 3 + 1; ft[0] = 1; for (int i = 1; i <= maxn; ++i) ft[i] = 1LL * ft[i - 1] * i % mod; Ft[maxn] = mi(ft[maxn], mod - 2); for (int i = maxn; i >= 1; --i) Ft[i - 1] = 1LL * Ft[i] * i % mod; long long y0 = (3LL * (n + 1) * n / 2) % mod, y1 = (y0 + mod - n * 2) % mod, y2 = (y0 + mod - n) % mod, ni3 = mi(3, mod - 2); ans[1] = y0; for (int i = 2; i <= n * 3; ++i) { long long sum = 1LL * ft[maxn] * Ft[i + 1] % mod * Ft[maxn - 1 - i] % mod; long long x1 = (sum - y1 - y1 - y2) * ni3 % mod; if (x1 < 0) x1 += mod; long long x2 = (x1 + y1); if (x2 >= mod) x2 -= mod; long long x0 = (x2 + y2); if (x0 >= mod) x0 -= mod; y0 = x0, y1 = x1, y2 = x2; ans[i] = x0; } for (int i = 1; i <= q; ++i) { int x = read(); printf( %d n , ans[x]); } } |
#include <bits/stdc++.h> using namespace std; inline int mini(int a, int b) { return a < b ? a : b; } inline int maxi(int a, int b) { return a > b ? a : b; } int main() { int n; scanf( %d , &n); int *a = new int[n]; int najm = 1000000010; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); najm = mini(najm, a[i]); } vector<int> vec; for (int i = 0; i < n; i++) { if (a[i] == najm) { vec.push_back(i); } } int najv = 0; for (int i = 0; i < vec.size() - 1; i++) { najv = maxi(najv, vec[i + 1] - vec[i] - 1); } najv = maxi(najv, n - 1 - vec[vec.size() - 1] + vec[0]); long long res = ((long long)najm) * (long long)n + (long long)najv; cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); void setIO(string name) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin.exceptions(istream::failbit); } const int inf = 0x3f3f3f3f, mod = 1e9 + 7; int main() { setIO( 1 ); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int sol = 0, j = 0, used = 0; pair<int, int> inter; for (int i = 0; i < n; ++i, j = max(j, i)) { if (used < 0) { used = 0; } while (j < n) { if (used + !a[j] > k) { break; } if (a[j++] == 0) { ++used; } } if (j - i > sol) { sol = j - i; inter = {i, j}; } if (a[i] == 0) { --used; } } cout << sol << n ; for (int i = 0; i < inter.first; ++i) { cout << a[i] << ; } for (int i = inter.first; i < inter.second; ++i) { cout << 1 << ; } for (int i = inter.second; i < n; ++i) { cout << a[i] << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> int main() { int i, j, l = 0, a, A[6], n[6], m = 0; for (i = 0; i < 6; i++) { scanf( %d , &a); for (j = 0; j < l; j++) { if (A[j] == a) break; } if (j == l) { n[l] = 1; A[l++] = a; } else n[j]++; } for (i = 0; i < l; i++) { if (n[i] > m) m = n[i]; } if (l == 1 || (l == 2 && m == 4)) printf( Elephant ); else if ((l == 2 && m == 5) || (l == 3 && m == 4)) printf( Bear ); else printf( Alien ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i; cin >> n; long a[n + 1], b[n + 1]; for (i = 0; i < n; i++) cin >> a[i]; a[n] = 1; b[0] = 1; for (i = 1; i <= n; i++) { b[i] = (2 * b[i - 1] - b[a[i - 1] - 1] + 2) % 1000000007; if (b[i] < 0) b[i] += 1000000007; } cout << (b[n] - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 80009; unsigned long long n; vector<int> adj[inf]; unsigned long long low[inf]; unsigned long long sl[inf]; unsigned long long sz[inf]; unsigned long long als; unsigned long long ans = 0; void dfs(int x, int p) { unsigned long long s = 0; int k; unsigned long long tr = 0, fr = 0; for (int i = 0; i < adj[x].size(); ++i) { k = adj[x][i]; if (k == p) continue; dfs(k, x); sl[x] += sl[k]; fr += sz[k] * tr; tr += sz[k] * low[x]; low[x] += sz[k] * sz[x]; sz[x] += sz[k]; } fr += (n - sz[x] - 1) * tr; tr += (n - sz[x] - 1) * low[x]; ans += (fr + tr) * 6 + ((n - sz[x] - 1) * sz[x] + low[x]) * 2; low[x] += sz[x]; low[x] += low[x] + 1; sl[x] += low[x]; sz[x]++; } void solve(int x, int p) { ans += (als - sl[x]) * low[x]; als -= low[x]; unsigned long long g = low[x] / 2 + (n - sz[x]) * sz[x]; int k; for (int i = 0; i < adj[x].size(); ++i) { k = adj[x][i]; if (k == p) continue; ans += sl[k] * ((g - sz[k] * (n - sz[k])) * 2 + 1); solve(k, x); } } int main() { int a, b; scanf( %d , &n); for (int i = 0; i < n - 1; ++i) { scanf( %d%d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); } dfs(1, 1); als = sl[1]; solve(1, 1); unsigned long long all = (n * (n - 1)) / 2; all = all * all; printf( %I64d n , all - ans); } |
#include <bits/stdc++.h> using namespace std; vector<int> graph[200000]; int color[200000], black, white, maxDist, farNode; void solve(int node, int par, int dis) { if (dis > maxDist) farNode = node, maxDist = dis; for (auto &v : graph[node]) { if (v == par) continue; solve(v, node, dis + (color[node] != color[v])); } } int main() { ios ::sync_with_stdio(false); cin.tie(); int n, a, b, firstNode; cin >> n; for (int i = 0; i < n; i++) cin >> color[i]; for (int i = 0; i < n - 1; i++) { cin >> a >> b; a--, b--; graph[a].push_back(b); graph[b].push_back(a); } solve(0, -1, 1); maxDist = 1; solve(farNode, -1, 1); cout << (maxDist) / 2; return 0; } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 3e3 + 50; const int Mod = 1000000007; const double PI = acos(-1); using namespace std; struct Ans { int id, x; string ret; }; Ans ans[maxn]; string v[maxn]; int cnt; bool full; int n; inline bool cmpById(const Ans &a, const Ans &b) { return a.id < b.id; } inline bool cmpByX(const Ans &a, const Ans &b) { return a.x < b.x; } bool cmpByLen(const string &a, const string &b) { return a.size() > b.size(); } void expend(int dem, int len) { if (full) return; while (1) { int sz = cnt; for (int i = sz - 1; i >= 0; i--) { v[cnt++] = v[i] + 0 ; v[i] = v[i] + 1 ; } if (cnt >= dem) full = true; sort(v, v + cnt, cmpByLen); if (full || v[cnt - 1].size() == len) return; } } bool solve() { v[cnt++] = 0 ; v[cnt++] = 1 ; for (int i = 0; i < n; i++) { int tar = ans[i].x; if (cnt == 0) return false; if (v[cnt - 1].size() < tar) expend(n - i, tar); if (full) { v[cnt - 1] = v[cnt - 1] + string(tar - v[cnt - 1].size(), 1 ); } ans[i].ret = v[cnt - 1]; cnt--; } return true; } int main() { while (scanf( %d , &n) != EOF) { for (int i = 0; i < n; i++) { ans[i].id = i; scanf( %d , &ans[i].x); } cnt = 0; full = false; sort(ans, ans + n, cmpByX); if (solve()) { puts( YES ); sort(ans, ans + n, cmpById); for (int i = 0; i < n; i++) puts(ans[i].ret.c_str()); } else puts( NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[100010]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int ans = 0; int re = 0; for (int i = 0; i < n; i++) { int t = 1; while (a[i + 1] == a[i] && (i < n - 1)) { t += 1; i += 1; } if (i == n - 1) { cout << ans; return 0; } else if (i == n - 2) { cout << ans + 1; return 0; } re = max(re, i + 1); if (t < (n - re)) { re += t; ans += t; } else if (t == n - re) { ans += t; cout << ans; return 0; } else { ans += (n - re); cout << ans; return 0; } } return 0; } |
#include <bits/stdc++.h> int main() { int n, m, z; std::cin >> n >> m >> z; int counter = 0; for (int i = 1; i * n <= z; i++) { if ((i * n) % m == 0) counter++; } std::cout << counter; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 105; const double eps = 1e-6; int n, k, q, m; int a[N], b[N], used[N]; double MinAns = 100.0, MaxAns = 0.0; double max(double x, double y) { return x - eps >= y ? x : y; } double min(double x, double y) { return x + eps <= y ? x : y; } void init() { scanf( %d %d , &n, &k); m = n / k; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); } void work() { int x, sum, cnt; scanf( %d , &q); for (int i = 1; i <= q; i++) { sum = 0; for (int j = 1; j <= m; j++) { scanf( %d , &x); used[x] = 1; sum += a[x]; } MinAns = min(MinAns, 1.0 * sum / m); MaxAns = max(MaxAns, 1.0 * sum / m); } cnt = 0; for (int i = 1; i <= n; i++) if (!used[i]) b[++cnt] = a[i]; sort(b + 1, b + 1 + cnt); if (cnt >= m && n - cnt < k * m) { sum = 0; for (int i = 1; i <= m; i++) sum += b[i]; MinAns = min(MinAns, 1.0 * sum / m); sum = 0; for (int i = cnt; i > cnt - m; i--) sum += b[i]; MaxAns = max(MaxAns, 1.0 * sum / m); } printf( %.10lf %.10lf n , MinAns, MaxAns); } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> int i, n, k, a, s, j; int main() { for (std::cin >> n >> k; i < k; i++) std::cin >> a, a % 2 ? a++, j++ : 0, s += a; std::cout << (s > 8 * n || s == 8 * n && k == 4 * n && j < n ? NO : YES ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, i; cin >> n; string s; cin >> s; int k = 1; for (i = 0; i < n; i++) { if (s[i] == 1 && k == 1) { sum++; } else if (s[i] == 0 && k == 1) { sum++; k = 0; } } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { short negative = 1; x = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) negative = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); x *= negative; } inline void write(long long x) { static long long sta[35]; long long top = 0; do { sta[top++] = x % 10, x /= 10; } while (x); while (top) putchar(sta[--top] + 48); puts( ); } const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, -1, 0, 1}; vector<long long> v; int n; void w(string s) { v.push_back(0); for (int i = 0; i < s.size(); i++) { if (s[i] == || s[i] == - ) v.push_back(i + 1); } v.push_back(s.size()); } bool check(int mid) { int len = 0, g = 1; for (int i = 1; i < v.size(); i++) { if (v[i] - v[i - 1] > mid) return 0; if (len + (v[i] - v[i - 1]) <= mid) len += (v[i] - v[i - 1]); else { g++; len = v[i] - v[i - 1]; } } return g <= n; } int main() { read(n); char s[1000010]; gets(s); w(s); int l = 1, r = 1e6, res = 1e5; while (l <= r) { long long mid = (l + r) / 2; if (check(mid)) r = mid - 1; else { l = mid + 1; } } cout << l << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, a, b, signo, dist, centro; vector<pair<long long int, long long int> > distancias; vector<long long int> izq, der; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; a = 1; b = 2; for (int i = (3); i <= (n); i++) { cout << 2 << a << << b << << i << endl; cin >> signo; if (signo > 0) b = i; } for (int i = (1); i <= (n); i++) { if (i == a || i == b) continue; cout << 1 << a << << b << << i << endl; cin >> dist; distancias.push_back({-dist, i}); } sort(distancias.begin(), distancias.end()); centro = 0; for (auto d : distancias) { if (centro == 0) { centro = d.second; continue; } cout << 2 << a << << centro << << d.second << endl; cin >> signo; if (signo > 0) izq.push_back(d.second); else der.push_back(d.second); } reverse(der.begin(), der.end()); cout << 0 << a << ; for (auto n : der) cout << n << ; cout << centro << ; for (auto n : izq) cout << n << ; cout << b << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { char x = 0 ; int fh = 1, sum = 0; for (x = getchar(); x < 0 || x > 9 ; x = getchar()) if (x == - ) fh = -1; for (; x >= 0 && x <= 9 ; x = getchar()) sum = sum * 10 + x - 0 ; return fh * sum; } const int N = 1e5 + 9; int fa[N], ch[N][2], sz[N]; long long A[N], B[N], val[N]; int n, a, rt, cnt; inline long long pd(int x) { return ch[fa[x]][1] == x; } inline void pushup(int x) { int ls = ch[x][0], rs = ch[x][1]; sz[x] = sz[ls] + sz[rs] + 1; } inline void modify(int x, long long a, long long b) { val[x] += a * (sz[ch[x][0]] + 1) + b; A[x] += a, B[x] += b; } inline void pushdown(int x) { if (A[x] || B[x]) { if (ch[x][0]) modify(ch[x][0], A[x], B[x]); if (ch[x][1]) modify(ch[x][1], A[x], B[x] + A[x] * (sz[ch[x][0]] + 1)); A[x] = B[x] = 0; } } inline void rotate(int x) { int y = fa[x], z = fa[y], kx = pd(x), ky = pd(y); if (z) ch[z][ky] = x; fa[x] = z, fa[y] = x, fa[ch[x][kx ^ 1]] = y; ch[y][kx] = ch[x][kx ^ 1]; ch[x][kx ^ 1] = y; pushup(y), pushup(x); if (z) pushup(z); } inline void splay(int x) { static int sta[N], tp; sta[tp = 1] = x; for (int y = x; fa[y]; y = fa[y]) sta[++tp] = fa[y]; while (tp) pushdown(sta[tp--]); for (; fa[x]; rotate(x)) if (fa[fa[x]]) rotate((pd(x) ^ pd(fa[x])) ? x : fa[x]); pushup(rt = x); } inline long long getv(int k) { int x = rt; while (1) { if (sz[ch[x][0]] + 1 == k) { splay(x); return val[x]; } if (sz[ch[x][0]] >= k) x = ch[x][0]; else k -= sz[ch[x][0]] + 1, x = ch[x][1]; } } inline long long getmx(int x) { if (!x) return -1e18; pushdown(x); return std::max(val[x], std::max(getmx(ch[x][0]), getmx(ch[x][1]))); } int main() { n = read(); sz[1] = rt = cnt = 1; for (register int i = 1, endi = n; i <= endi; ++i) { int a = read(); int lp = 0, rp = i - 2, ans = i - 1; while (lp <= rp) { int mid = (lp + rp) >> 1; if (getv(mid + 1) + (mid + 1LL) * a > getv(mid + 2)) rp = (ans = mid) - 1; else lp = mid + 1; } getv(ans + 1); fa[++cnt] = rt, val[cnt] = val[rt], ch[cnt][1] = ch[rt][1]; fa[ch[rt][1]] = cnt; ch[rt][1] = cnt; modify(cnt, a, 1LL * a * ans); } printf( %lld n , getmx(rt)); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k, a; scanf( %d , &n); vector<int> nums; unordered_map<int, int> hashmap, sizes, parent, inp; for (int i = 0; i < n; i++) { scanf( %d , &a); nums.push_back(a); } sort(nums.begin(), nums.end()); int smin = -1, smin_pos = 0, res = 1; for (int i = 0; i < n; i++) { a = nums[i]; if (smin == -1) { smin = a; smin_pos = i; } else { if (a - smin <= 5) { continue; } else { res = max(res, i - smin_pos); while (a - nums[smin_pos] > 5 && smin_pos < i) smin_pos++; smin = nums[smin_pos]; } } } if (nums[n - 1] - smin <= 5) { res = max(res, n - smin_pos); } printf( %d , res); return 0; } |
#include <bits/stdc++.h> int main() { char str[100][100] = { January , February , March , April , May , June , July , August , September , October , November , December }; char month[100]; scanf( %[^ n] , month); int n; scanf( %d , &n); int index; int i; for (i = 0; i < 12; i++) { if (strcmp(str[i], month) == 0) { index = i; break; } } index = ((index) % 12 + n % 12) % 12; printf( %s n , str[index]); } |
#include <bits/stdc++.h> inline int read() { char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); int k = 0, kk = 1; if (c == - ) c = getchar(), kk = -1; while (c >= 0 && c <= 9 ) k = k * 10 + c - 0 , c = getchar(); return kk * k; } using namespace std; void write(int x) { if (x < 0) x = -x, putchar( - ); if (x / 10) write(x / 10); putchar(x % 10 + 0 ); } void writeln(int x) { write(x); puts( ); } int n, m, k, x[1000000], y[1000000], l[1000000], r[1000000], f[1000000]; struct lsg { int x, y, d, bj; } a[1000000], ff[1000000]; bool cmp1(lsg x, lsg y) { return x.d < y.d; } bool cmp2(lsg x, lsg y) { return x.x < y.x; } bool cmp3(lsg x, lsg y) { return x.y > y.y; } bool pd(int kkk) { int d = 0, dd = 0, ddd = 0; memset(a, 0, sizeof(a)); for (int i = 1; i <= k; i++) { a[++d].d = x[i] - kkk; a[d].x = y[i] - kkk; a[d].y = y[i] + kkk; a[d].bj = i; a[++d].d = x[i] + kkk + 1; a[d].bj = -i; } a[++d].d = 1; a[++d].d = n; sort(a + 1, a + 1 + d, cmp1); a[d + 1].d = -1e9; for (int i = 1; i <= d; i++) { if (a[i].bj > 0) { ff[++dd].x = a[i].x; ff[dd].y = a[i].y; ff[dd].bj = a[i].bj; } else if (a[i].bj < 0) { int kk = 0; for (int j = 1; j <= dd; j++) if (ff[j].bj != -a[i].bj) ff[++kk] = ff[j]; dd = kk; } if (a[i].d != a[i + 1].d && a[i].d >= 1 && a[i].d <= n) { sort(ff + 1, ff + 1 + dd, cmp2); l[++ddd] = 1; r[ddd] = m; f[ddd] = a[i].d; for (int j = 1; j <= dd; j++) { if (l[ddd] >= ff[j].x) l[ddd] = max(l[ddd], ff[j].y + 1); } sort(ff + 1, ff + 1 + dd, cmp3); for (int j = 1; j <= dd; j++) { if (r[ddd] <= ff[j].y) r[ddd] = min(r[ddd], ff[j].x - 1); } } } int ll = 1, rr = ddd, lll = m, rrr = 1; f[ddd + 1] = n; f[ddd + 2] = n + 1; while (l[ll] > r[ll] && ll <= rr) ll++; while (l[rr] > r[rr] && ll <= rr) rr--; if (f[rr + 1] - 1 - f[ll] > kkk * 2) return 0; for (int i = ll; i <= rr; i++) lll = min(lll, l[i]), rrr = max(rrr, r[i]); if (rrr - lll > kkk * 2) return 0; return 1; } signed main() { n = read(); m = read(); k = read(); for (int i = 1; i <= k; i++) x[i] = read(), y[i] = read(); int l = 0, r = max(n, m); while (l < r) { int m = (l + r) / 2; if (pd(m)) r = m; else l = m + 1; } cout << l << endl; } |
#include <bits/stdc++.h> using namespace std; priority_queue<int> Q[200]; int main() { int n, k; cin >> n >> k; unsigned long long pr[200000]; for (int i = 0; i < n; i++) { cin >> pr[i]; } string str; vector<unsigned long> vec[200]; unsigned long long sum = 0; cin >> str; for (int i = 0; i < n; i++) { Q[str[i]].push(pr[i]); if (str[i] != str[i - 1] && i > 0) { int j = 0; while (!Q[str[i - 1]].empty()) { if (j <= k - 1) sum += Q[str[i - 1]].top(); Q[str[i - 1]].pop(); j++; } } } for (int i = 97; i <= 122; i++) { int j = 0; while (!Q[i].empty()) { if (j > k - 1) break; sum += Q[i].top(); Q[i].pop(); j++; } } cout << sum << endl; } |
#include <bits/stdc++.h> using namespace std; int a[10][10], b[10][10]; struct per { int x, y; }; int k; queue<per> q, q2; void bf2() { while (!q2.empty()) { per aux; aux = q2.front(); q2.pop(); int xx = aux.x - 1, yy = aux.y - 1; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x - 1, yy = aux.y; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x - 1, yy = aux.y + 1; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x, yy = aux.y - 1; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x, yy = aux.y + 1; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x + 1, yy = aux.y - 1; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x + 1, yy = aux.y + 1; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } xx = aux.x + 1, yy = aux.y; if (b[xx][yy] == 0) { b[xx][yy] = b[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; q2.push(nou); } } } void bf1() { while (!q.empty()) { per aux; aux = q.front(); q.pop(); int xx = aux.x - 1, yy = aux.y - 1; while (a[xx][yy] == 0) { a[xx][yy] = a[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; xx--; yy--; q.push(nou); } xx = aux.x - 1, yy = aux.y + 1; while (a[xx][yy] == 0) { a[xx][yy] = a[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; xx--; yy++; q.push(nou); } xx = aux.x + 1, yy = aux.y + 1; while (a[xx][yy] == 0) { a[xx][yy] = a[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; xx++; yy++; q.push(nou); } xx = aux.x + 1, yy = aux.y - 1; while (a[xx][yy] == 0) { a[xx][yy] = a[aux.x][aux.y] + 1; per nou; nou.x = xx; nou.y = yy; xx++; yy--; q.push(nou); } } } int main() { int x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2 || y1 == y2) cout << 1 << ; else cout << 2 << ; int i; for (i = 0; i <= 9; i++) { a[i][0] = -1; a[i][9] = -1; a[0][i] = -1; a[9][i] = -1; b[i][0] = -1; b[i][9] = -1; b[0][i] = -1; b[9][i] = -1; } per st; st.x = x1; st.y = y1; q.push(st); a[x1][y1] = 1; bf1(); if (a[x2][y2]) cout << a[x2][y2] - 1; else cout << 0; cout << ; int j; b[x1][y1] = 1; q2.push(st); bf2(); if (b[x2][y2]) cout << b[x2][y2] - 1; else cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1005; int N, K, D[MAX], S[MAX]; int main() { scanf( %d%d , &N, &K); for (int i = 0; i < (int)N; i++) scanf( %d , &D[i]); for (int i = 0; i < (int)N; i++) scanf( %d , &S[i]); int res = 0; int lho = S[0]; int pos = 0; int fuel = 0; while (pos != N) { if (lho < S[pos]) lho = S[pos]; fuel += S[pos]; int rem = max(0, D[pos] - fuel); int add = (rem + lho - 1) / lho; res += add * K; fuel += add * lho; fuel -= D[pos]; res += D[pos]; pos++; } printf( %d n , res); } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const int MAX = 5e3 + 10; const int MOD = 998244353; long long fat[MAX], ifat[MAX]; long long choose(int a, int b) { if (a < b) return 0; return fat[a] * ifat[b] % MOD * ifat[a - b] % MOD; } long long fexp(long long a, long long e) { long long ans = 1; while (e) { if (e & 1) ans = ans * a % MOD; a = a * a % MOD; e /= 2; } return ans; } void compute() { fat[0] = 1; ifat[0] = 1; for (int i = 1; i < MAX; i++) { fat[i] = i * fat[i - 1] % MOD; ifat[i] = fexp(fat[i], MOD - 2); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; compute(); int n, k; cin >> n >> k; string s; cin >> s; if (k == 0 || count(s.begin(), s.end(), 1 ) < k) { cout << 1 << n ; return 0; } long long ans = 1; for (int l = 0; l < n; l++) { int cnt = 0, r = l; while (r < n && cnt + (s[r] == 1 ) <= k) cnt += s[r++] == 1 ; long long add = 0; if (s[l] == 0 && cnt > 0) add = choose((r - l) - 1, cnt - 1); if (s[l] == 1 && ((r - l) - cnt) > 0) add = choose((r - l) - 1, cnt); ans = (ans + add) % MOD; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int get() { int f = 0, v = 0; char ch; while (!isdigit(ch = getchar())) if (ch == - ) break; if (ch == - ) f = 1; else v = ch - 0 ; while (isdigit(ch = getchar())) v = v * 10 + ch - 0 ; if (f) return -v; else return v; } const int maxn = 1003; long long a[maxn][maxn], b[maxn][maxn], c[maxn][maxn]; int n, m, k; int main() { n = get(), m = get(); k = get(); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) a[i][j] = a[i - 1][j] + a[i][j - 1] + get() - a[i - 1][j - 1], b[i][j] = b[i - 1][j + 1] + a[i][j] - (i > k && j + k <= m ? a[i - k][j + k] : 0), c[i][j] = c[i - 1][j - 1] + a[i][j] - (i > k && j > k ? a[i - k][j - k] : 0); b[i][0] = b[i - 1][1] - (i > k ? a[i - k][k] : 0); } long long v = -1, t; int x, y; for (int i = k; i <= n - k + 1; i++) for (int j = k; j <= m - k + 1; j++) if ((t = b[i + k - 1][j] + b[i - 1][j - k] - c[i + k - 1][j - 1] - c[i - 1][j + k - 1]) > v) v = t, x = i, y = j; printf( %d %d n , x, y); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1153][1153]; int n, m; unsigned long long int b[1153][1153]; bool pos(int minval) { memset(b, 0, sizeof(b)); int i, j, k; for (i = 0; i < n; i++) { int ccnt = 0; for (j = 0; j < 1024; j += 63) { unsigned long long int blk = 0; for (k = j; k < j + 63; k++) { blk <<= 1; if (a[i][k] >= minval) { blk |= 1; } } b[i][j] = blk; } for (j = 0; j < i; j++) { ccnt = 0; for (k = 0; k < 1024; k += 63) { unsigned long long int ret = (b[i][k] & b[j][k]); if (ret != 0) { if ((ret & (ret - 1)) == 0) ccnt++; else return true; } } if (ccnt >= 2) return true; } } return false; } int main() { int i, j; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { scanf( %d , &a[i][j]); } } int lb = 0, ub = 1000000004, mid, ans; while (lb <= ub) { mid = (lb + ub) / 2; if (pos(mid)) { lb = mid + 1; ans = mid; } else ub = mid - 1; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100500; int n, q; int len[N]; vector<pair<int, int>> g[N]; double prob[N]; double sum; int dfs(int v, int p) { int size = 1; for (auto e : g[v]) { int to = e.first; int ind = e.second; int w = len[ind]; if (to == p) continue; int A = dfs(to, v); size += A; int B = n - A; double prob_nom = (long long)A * B * (B - 1) / 2; prob_nom += (long long)B * A * (A - 1) / 2; double prob_denom = (long long)n * (n - 1) * (n - 2) / 6; prob[ind] = prob_nom / prob_denom; sum += w * prob[ind]; } return size; } void solve() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); u--; v--; len[i] = w; g[u].push_back(make_pair(v, i)); g[v].push_back(make_pair(u, i)); } dfs(0, -1); 0; scanf( %d , &q); for (int i = 0; i < q; i++) { int r, w; scanf( %d%d , &r, &w); r--; double delta = w - len[r]; sum += delta * prob[r]; len[r] = w; printf( %.10lf n , 2 * sum); } } int main() { solve(); 0; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int ts; cin >> ts; while (ts--) { int n; cin >> n; vector<int> v(n); vector<int> pos[2]; for (int i = 0; i < n; i++) { cin >> v[i]; pos[v[i]].push_back(i); } int x = 0; if (pos[0].size() >= n / 2) { x = 0; } else x = 1; if (x) { if (pos[x].size() % 2 != 0) { int k = pos[x].size() - 1; if (k < n / 2) { vector<int> vv; for (int i = 0; i < k; i++) vv.push_back(pos[x][i]); int f = lower_bound(pos[0].begin(), pos[0].end(), vv[vv.size() - 1]) - pos[0].begin(); int d = lower_bound(pos[0].begin(), pos[0].end(), vv[0]) - pos[0].begin(); if (pos[0].size() - f >= 2) { vv.push_back(pos[0][f]); vv.push_back(pos[0][f + 1]); cout << vv.size() << n ; for (int i = 0; i < vv.size(); i++) cout << v[vv[i]] << ; cout << endl; } else if (d >= 1) { vv.push_back(pos[0][d]); vv.push_back(pos[0][d - 1]); cout << vv.size() << n ; for (int i = vv.size() - 1; i >= 0; i--) { cout << v[vv[i]] << ; } cout << endl; } } else { cout << k << n ; for (int i = 0; i < k; i++) { cout << 1 << ; } cout << n ; } } else { cout << pos[x].size() << n ; for (int i = 0; i < pos[x].size(); i++) cout << 1 ; cout << endl; } } else { cout << pos[x].size() << n ; for (int i = 0; i < pos[x].size(); i++) cout << 0 ; cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[200007], b[200007]; bool check[200007]; int main() { string s; getline(cin, s); int res = 0; for (auto i = (0); i <= ((int)s.size() - 1); ++i) { int tmp = s[i]; int ans = 0; for (auto i = (1); i <= (8); ++i) { ans = 2 * ans + tmp % 2; tmp /= 2; } printf( %d n , (res - ans + 256) % 256); res = ans; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1 << 20; int pos[maxn]; int n, m; long long k, ans[maxn]; int val[maxn]; struct query { int l, r, id; } Q[maxn]; long long now = 0; long long M[maxn]; bool cmp(query a, query b) { if (pos[a.l] == pos[b.l]) return a.r < b.r; return pos[a.l] < pos[b.l]; } void add(int x) { now += M[val[x] ^ k]; M[val[x]]++; } void del(int x) { M[val[x]]--; now -= M[val[x] ^ k]; } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) { long long temp; scanf( %I64d , &temp); val[i] = val[i - 1] ^ temp; } int block = sqrt(n); for (int i = 1; i <= n; i++) pos[i] = i / block; for (int i = 1; i <= m; i++) { scanf( %d%d , &Q[i].l, &Q[i].r); Q[i].id = i; } sort(Q + 1, Q + m + 1, cmp); M[0] = 1; for (int i = 1, L = 1, R = 0; i <= m; i++) { for (; R < Q[i].r; R++) add(R + 1); for (; R > Q[i].r; R--) del(R); for (; L < Q[i].l; L++) del(L - 1); for (; L > Q[i].l; L--) add(L - 2); ans[Q[i].id] = now; } for (int i = 1; i <= m; i++) printf( %I64d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int mod = 998244353; int n; long long a[N]; long long p[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); long long m = 1; p[0] = 1; p[1] = 3; for (int i = 2; i < n; i++) { m = (m << 1) % mod; p[i] = m * (i + 2) % mod; } long long ans = 0; for (int i = 0; i < n; i++) ans = (ans + p[n - i - 1] * a[i]) % mod; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 400010; const int P = 1000000007; int m, n, mi[N], l[N], r[N]; char a[N], ans[N]; bool Check(int t, int x) { if (++t < x) return 0; return ((r[t] - r[t - x] * mi[x]) * mi[t - x] == l[t] - l[t - x]); } bool Dfs(int k, bool has) { if (k == n) { puts(ans); return true; } for (ans[k] = (has ? a[k] : a ); ans[k] <= z ; ++ans[k]) { l[k + 1] = l[k] + ans[k] * mi[k]; r[k + 1] = r[k] * P + ans[k]; if (!Check(k, m) && !Check(k, m + 1) && Dfs(k + 1, has && (a[k] == ans[k]))) return true; } return false; } int main() { scanf( %d%s , &m, a); int i; for (i = (n = strlen(a)) - 1; i >= 0 && a[i] == z ; --i) a[i] = a ; if (i < 0) { puts( Impossible ); return 0; } ++a[i]; mi[0] = 1; for (int i = 1; i <= n; ++i) mi[i] = mi[i - 1] * P; if (!Dfs(0, 1)) puts( Impossible ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int S = (int)1e6; int dp[S]; string txt, pat; vector<int> ans; void kmp() { int i = 0, j = -1, n = ((int)(txt.size())), m = ((int)(pat.size())); dp[0] = -1; while (i < m) { while (j >= 0 and pat[i] != pat[j]) j = dp[j]; i++, j++; dp[i] = j; } } int main() { ios::sync_with_stdio(0); a: string s, s2; cin >> s >> s2; int ones = 0, zeros = 0, ones2 = 0, zeros2 = 0, ones3 = 0, zeros3 = 0; for (char c : s) (c == 0 ) ? zeros++ : ones++; pat = s2; kmp(); string res = s2, r = s2.substr(dp[((int)(s2.size()))], ((int)(s2.size())) - dp[((int)(s2.size()))]); for (char c : res) (c == 0 ) ? zeros2++ : ones2++; for (char c : r) (c == 0 ) ? zeros3++ : ones3++; if (zeros2 > zeros or ones2 > ones) cout << s << n ; else { while (1) { if (zeros2 + zeros3 > zeros or ones2 + ones3 > ones) break; res += r; zeros2 += zeros3; ones2 += ones3; } for (int i = 0; i < zeros - zeros2; i++) res += 0 ; for (int i = 0; i < ones - ones2; i++) res += 1 ; cout << res << n ; } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1100100; long long N, l, r; long long L[MAX], R[MAX], d, sol; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> N; for (int I = 0; I < N; I++) { cin >> L[I] >> R[I]; l += L[I]; r += R[I]; } d = abs(l - r); for (int I = 0; I < N; I++) { l += +R[I] - L[I]; r += -R[I] + L[I]; if (abs(l - r) > d) { d = abs(l - r); sol = I + 1; } l -= +R[I] - L[I]; r -= -R[I] + L[I]; } cout << sol << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long p = 1234567, q = 123456, r = 1234, n; cin >> n; long long x = n; for (int a = 0; a <= n; a += 1234567) for (int b = 0; b <= n - a; b += 123456) { if ((n - a - b) % 1234 == 0) { cout << YES ; return 0; } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (n > m) swap(n, m); if (n == 2) { if (m % 4 == 0) cout << m; else if (m % 4 == 1) cout << m + 1; else cout << (m / 4) * 4 + 4; } else if ((m < 2) || (n < 2) || ((m == 2) && (n == 2))) cout << n * m << endl; else cout << (n * m + 1) / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int size; cin >> size; while (size--) { int nums; cin >> nums; while (nums--) cout << 1 << ; cout << n ; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.