func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; void solve() { int n, k; cin >> n >> k; if (k == 1) { cout << Yes << endl; return; } vector<int> divs; for (int i = 2; i < k; ++i) if (!(k % i)) { cerr << i << endl; divs.push_back(1); while (!(k % i)) k /= i, divs.back() *= i; } if (k > 1) divs.push_back(k); set<int> div(divs.begin(), divs.end()); int a; for (int i = 0; i < n; ++i) { cin >> a; set<int>::iterator it = div.begin(); while (it != div.end()) { if (a % (*it)) ++it; else it = div.erase(it); } } if (div.size()) cout << No << endl; else cout << Yes << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, color[510]; bool g[510][510]; vector<int> nbr[510]; bool dfs(int x, int c) { color[x] = c; for (int i = 0; i < nbr[x].size(); i++) { int y = nbr[x][i]; if (color[y] == c) return 0; if (color[y] == 0 && dfs(y, 3 - c) == 0) return 0; } return 1; } int main() { cin >> n >> m; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; g[x][y] = g[y][x] = 1; } for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) if (g[i][j] == 0) { nbr[i].push_back(j); nbr[j].push_back(i); } for (int i = 1; i <= n; i++) { if (color[i] || nbr[i].size() == 0) continue; if (dfs(i, 1) == 0) { puts( No ); return 0; } } for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) if (color[i] + color[j] == 3 && g[i][j]) { puts( No ); return 0; } puts( Yes ); for (int i = 1; i <= n; i++) { if (color[i] == 0) cout << b ; else if (color[i] == 1) cout << a ; else if (color[i] == 2) cout << c ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; int Deb = 0; int Fin = 9; int Tab[10]; for (int j = 0; j < 10; j++) Tab[j] = 0; char Cuck; for (int j = 0; j < T; j++) { cin >> Cuck; if (Cuck == L ) { Tab[Deb] = 1; int curDeb = Deb; while (Tab[curDeb] == 1 && curDeb < 10) curDeb++; Deb = curDeb; } else if (Cuck == R ) { Tab[Fin] = 1; int curFin = Fin; while (Tab[curFin] == 1 && curFin >= 0) curFin--; Fin = curFin; } else { int Ind = Cuck - 48; Tab[Ind] = 0; int curDeb = 0; while (Tab[curDeb] == 1 && curDeb < 10) curDeb++; Deb = curDeb; int curFin = 9; while (Tab[curFin] == 1 && curFin >= 0) curFin--; Fin = curFin; } } for (int j = 0; j < 10; j++) cout << Tab[j]; } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { char ch = getchar(); x = 0; while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar(); } int n, m, a[238][238], x[238], y[238]; signed main() { read(n), read(m); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) read(a[i][j]); if (n == 1) { puts( YES ); puts( 0 ); for (int i = 1; i <= m; ++i) a[1][i] ? putchar(48) : putchar(49); return 0; } if (m == 1) { puts( YES ); for (int i = 1; i <= n; ++i) a[i][1] ? putchar(48) : putchar(49); puts( ); return putchar(48), 0; } int ok = 1, cnt = 0, w, qwq; for (int i = 1; i <= m; ++i) y[i] = a[1][i]; for (int i = 2; i <= n; ++i) { int tmp = 0; for (int j = 2; j <= m; ++j) if ((a[i][j] ^ y[j]) != (a[i][j - 1] ^ y[j - 1])) ++tmp, qwq = (a[i][j] ^ y[j]); if (tmp) { cnt += tmp, w = i; if (cnt > 1) { ok = 0; break; } } } if (ok) { puts( YES ); if (cnt) { for (int i = 2; i < w; ++i) x[i] = a[i][1] ^ y[1]; x[w] = qwq ^ 1; for (int i = w + 1; i <= n; ++i) x[i] = a[i][1] ^ y[1] ^ 1; } else for (int i = 2; i <= n; ++i) x[i] = a[i][1] ^ y[1]; for (int i = 1; i <= n; ++i) putchar(x[i] + 48); puts( ); for (int i = 1; i <= m; ++i) putchar(y[i] + 48); return 0; } ok = 1, cnt = 0; for (int i = 1; i <= m; ++i) y[i] = a[n][i] ^ 1; for (int i = 1; i < n; ++i) { int tmp = 0; for (int j = 2; j <= m; ++j) if ((a[i][j] ^ y[j]) != (a[i][j - 1] ^ y[j - 1])) ++tmp, qwq = (a[i][j] ^ y[j]); if (tmp) { cnt += tmp, w = i; if (cnt > 1) { ok = 0; break; } } } if (ok) { puts( YES ); if (cnt) { for (int i = 1; i < w; ++i) x[i] = a[i][1] ^ y[1]; x[w] = qwq ^ 1; for (int i = w + 1; i < n; ++i) x[i] = a[i][1] ^ 1 ^ y[1]; } else for (int i = 1; i < n; ++i) x[i] = a[i][1] ^ y[1]; for (int i = 1; i <= n; ++i) putchar(x[i] + 48); puts( ); for (int i = 1; i <= m; ++i) putchar(y[i] + 48); return 0; } return puts( NO ), 0; } |
#include <bits/stdc++.h> using namespace std; const int PI = 3.1415926535; const int inf = 1000111222; const int mod = 1000000007; const int N = 100007; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> ar(n); for (int i = 0; i < n; i++) cin >> ar[i]; vector<int> entries; int ans = 0; for (int i = 30; i >= 0; i--) { entries.clear(); for (int j = 0; j < n; j++) { if ((1 << i) & ar[j]) { entries.push_back(j); } } if (entries.size() == 1) { ans = entries[0]; break; } } vector<int> order; order.push_back(ans); for (int i = 0; i < n; i++) { if (i != ans) order.push_back(i); } for (int i = 0; i < n; i++) { cout << ar[order[i]] << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int n, k; long long temp[55]; long long dp[105][55], ans; vector<int> g[105]; void dfs(int u, int fa) { dp[u][0] = 1; dp[u][1 + k] = 1; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i]; if (v != fa) { dfs(v, u); for (int j = 0; j <= 2 * k + 1; j++) temp[j] = 0; for (int dep1 = 0; dep1 <= 2 * k + 1; dep1++) { for (int dep2 = 0; dep2 <= 2 * k; dep2++) { if (dep1 + dep2 <= 2 * k) temp[min(dep1, dep2 + 1)] = (temp[min(dep1, dep2 + 1)] + dp[u][dep1] * dp[v][dep2] % mod) % mod; else temp[max(dep1, dep2 + 1)] = (temp[max(dep1, dep2 + 1)] + dp[u][dep1] * dp[v][dep2] % mod) % mod; } } for (int j = 0; j <= 2 * k + 1; j++) dp[u][j] = temp[j]; } } } int main() { ios::sync_with_stdio(false); cin >> n >> k; for (int i = 1, u, v; i < n; i++) { cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } dfs(1, 0); for (int i = 0; i <= k; i++) ans = (ans + dp[1][i]) % mod; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n, k, sum = 0; scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , a + i); sum += a[i]; } sort(a, a + n); int res = a[n - 1]; for (int t = n - k, i = n - k - 1; i >= 0; i--, t++) { if (res < a[i] + a[t]) { res = a[i] + a[t]; } } if (k == 1) printf( %d n , sum); else printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> struct seg_tree_lazy { int S, H; T zero; std::vector<T> value; U noop; std::vector<bool> dirty; std::vector<U> prop; seg_tree_lazy<T, U>(int _S, T _zero = T(), U _noop = U()); void set_leaves(std::vector<T> &leaves); void apply(int i, U &update); void rebuild(int i); void propagate(int i); void upd(int i, int j, U update); T query(int i, int j); }; int v[210000]; set<int> ss[33]; int clz(int x) { if (x == 0) return 32; return __builtin_clz(x); } struct node { long long s = 0; node(long long int _s = 0) : s(_s) {} node operator+(node ot) { return node(s + ot.s); } }; struct upd { int v; upd(int _v = 0) : v(_v) {} node operator()(node a) { a.s += v; return a; } upd operator+(upd ot) { return upd(v + ot.v); } }; int n, q; void solve() { scanf( %d %d , &n, &q); for (int i = 0; i < n; i++) scanf( %d , &v[i]); vector<node> leaves(n); for (int i = 0; i < n; i++) { leaves[i].s = v[i]; ss[clz(v[i])].insert(i); } seg_tree_lazy<node, upd> tree(n); tree.set_leaves(leaves); for (int i = 0; i < q; i++) { int p, val; scanf( %d %d , &p, &val); p--; int diff = val - v[p]; ss[clz(v[p])].erase(p); tree.upd(p, p, diff); v[p] = val; ss[clz(v[p])].insert(p); int f = -1; for (int i = 0; i < 33 && f == -1; i++) { auto it = ss[i].begin(); for (int j = 0; j < 2; j++) { if (it == ss[i].end()) break; if (tree.query(0, *it).s == 2 * (v[*it])) f = *it + 1; it++; } } printf( %d n , f != -1 ? f : -1); } } int main() { solve(); } template <typename T, typename U> seg_tree_lazy<T, U>::seg_tree_lazy(int _S, T _zero, U _noop) { zero = _zero, noop = _noop; for (S = 1, H = 1; S < _S;) S *= 2, H++; value.resize(2 * S, zero); dirty.resize(2 * S, false); prop.resize(2 * S, noop); } template <typename T, typename U> void seg_tree_lazy<T, U>::set_leaves(vector<T> &leaves) { copy(leaves.begin(), leaves.end(), value.begin() + S); for (int i = S - 1; i > 0; i--) value[i] = value[2 * i] + value[2 * i + 1]; } template <typename T, typename U> void seg_tree_lazy<T, U>::apply(int i, U &update) { value[i] = update(value[i]); if (i < S) { prop[i] = prop[i] + update; dirty[i] = true; } } template <typename T, typename U> void seg_tree_lazy<T, U>::rebuild(int i) { for (int l = i / 2; l; l /= 2) { T combined = value[2 * l] + value[2 * l + 1]; value[l] = prop[l](combined); } } template <typename T, typename U> void seg_tree_lazy<T, U>::propagate(int i) { for (int h = H; h > 0; h--) { int l = i >> h; if (dirty[l]) { apply(2 * l, prop[l]); apply(2 * l + 1, prop[l]); prop[l] = noop; dirty[l] = false; } } } template <typename T, typename U> void seg_tree_lazy<T, U>::upd(int i, int j, U update) { i += S, j += S; propagate(i), propagate(j); for (int l = i, r = j; l <= r; l /= 2, r /= 2) { if ((l & 1) == 1) apply(l++, update); if ((r & 1) == 0) apply(r--, update); } rebuild(i), rebuild(j); } template <typename T, typename U> T seg_tree_lazy<T, U>::query(int i, int j) { i += S, j += S; propagate(i), propagate(j); T res_left = zero, res_right = zero; for (; i <= j; i /= 2, j /= 2) { if ((i & 1) == 1) res_left = res_left + value[i++]; if ((j & 1) == 0) res_right = value[j--] + res_right; } return res_left + res_right; } |
#include <bits/stdc++.h> using namespace std; int main() { long long i, n, r, S, Z, s1, s2, s3, s4, s5, s6, s7, s8, x, y, z, m, j, l, k, t; long long a[500005]; long long b[300045]; long long c[300001]; long long d[100001]; long long e[101][101]; pair<long long, long long> aa[200001]; pair<long long, long long> bb[200001]; double h, w, u, v, uu, vv; string q1; string q2; string q3; string q4; string s; string q; string sq[50005]; string qs[3001]; map<string, long long> g; map<string, long long>::iterator it; cin >> n; for (i = 1; i <= 100; i++) { b[i] = 0; } for (l = 1; l <= n; l++) { cin >> m; for (i = 1; i <= m; i++) { cin >> x; b[x]++; } } for (i = 1; i <= 100; i++) { if (b[i] == n) cout << i << ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 50100; vector<int> v; int n, k, st, x; int nextchild[maxn], value[maxn]; void get_rand() { int arr[n + 1]; for (int i = 0; i < n; i++) { arr[i] = i + 1; } srand(time(0)); random_shuffle(arr, arr + n); for (int i = 0; i < k; i++) { v.push_back(arr[i]); } } int main() { cin >> n >> st >> x; k = min(n, 1000); get_rand(); memset(nextchild, 0, sizeof(nextchild)); memset(value, -1, sizeof(value)); cout << ? << st << n ; fflush(stdout); cin >> value[st] >> nextchild[st]; int maxind = st; int maxval = value[st]; for (int i : v) { cout << ? << i << n ; fflush(stdout); cin >> value[i] >> nextchild[i]; if (value[i] <= x && value[i] > maxval) { maxval = value[i]; maxind = i; } } int curr = maxind; int answ = maxind; while (true) { cout << ? << curr << n ; fflush(stdout); cin >> value[curr] >> nextchild[curr]; if (value[curr] >= x || nextchild[curr] == -1) break; else curr = nextchild[curr]; } if (value[curr] >= x) { cout << ! << value[curr] << n ; fflush(stdout); } else { cout << ! -1 n ; fflush(stdout); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int l, r, lc, rc; int dep_a, dep_a_2b, dep_2b_c, dep_2b, dep_a_2b_c, cover; }; const int N = 200000; const int root = 0; struct Segment_Tree { int num; node tr[2 * N]; void setRange(int l, int r, int now = root) { num = 0; build(l, r, now); } void build(int l, int r, int now) { tr[now].l = l; tr[now].r = r; tr[now].dep_2b_c = tr[now].dep_a = tr[now].dep_2b = tr[now].dep_a_2b = tr[now].dep_a_2b_c = 0; tr[now].cover = 0; if (l < r) { int mid = (l + r) >> 1; ++num; tr[now].lc = num; ++num; tr[now].rc = num; build(l, mid, tr[now].lc); build(mid + 1, r, tr[now].rc); } } void pushup(node &f, node &lc, node &rc) { f.dep_a = max(lc.dep_a, rc.dep_a); f.dep_2b = max(lc.dep_2b, rc.dep_2b); f.dep_a_2b = max(max(lc.dep_a_2b, rc.dep_a_2b), lc.dep_a + rc.dep_2b); f.dep_2b_c = max(max(lc.dep_2b_c, rc.dep_2b_c), lc.dep_2b + rc.dep_a); f.dep_a_2b_c = max(max(lc.dep_a_2b_c, rc.dep_a_2b_c), max(lc.dep_a + rc.dep_2b_c, lc.dep_a_2b + rc.dep_a)); } void lazyupdate(int now, int val) { tr[now].cover += val; tr[now].dep_a += val; tr[now].dep_a_2b -= val; tr[now].dep_2b_c -= val; tr[now].dep_2b -= 2 * val; } void pushdown(int now) { lazyupdate(tr[now].lc, tr[now].cover); lazyupdate(tr[now].rc, tr[now].cover); tr[now].cover = 0; } void update(int l, int r, int val, int now = root) { if (tr[now].l == l && tr[now].r == r) { lazyupdate(now, val); return; } else { if (tr[now].cover != 0) pushdown(now); int mid = (tr[now].l + tr[now].r) >> 1; if (r <= mid) update(l, r, val, tr[now].lc); else if (l > mid) update(l, r, val, tr[now].rc); else { update(l, mid, val, tr[now].lc); update(mid + 1, r, val, tr[now].rc); } pushup(tr[now], tr[tr[now].lc], tr[tr[now].rc]); } } node query(int l, int r, int now = root) { if (tr[now].l == l && tr[now].r == r) return tr[now]; else { if (tr[now].cover != 0) pushdown(now); int mid = (tr[now].l + tr[now].r) >> 1; if (r <= mid) return query(l, r, tr[now].lc); else if (l > mid) return query(l, r, tr[now].rc); else { node f, lc, rc; lc = query(l, mid, tr[now].lc); rc = query(mid + 1, r, tr[now].rc); pushup(f, lc, rc); return f; } } } }; Segment_Tree tr; bool p[200000]; int main() { int n, q; char ch[200000]; scanf( %d%d%s , &n, &q, ch); n = (n - 1) * 2; tr.setRange(1, n); for (int i = 0; i < n; ++i) { if (ch[i] == ( ) { p[i + 1] = true; tr.update(i + 1, n, 1); } else { p[i + 1] = false; tr.update(i + 1, n, -1); } } printf( %d n , tr.query(1, n).dep_a_2b_c); while (q--) { int s, t; scanf( %d%d , &s, &t); if (s > t) swap(s, t); if (p[s] != p[t]) { p[s] = !p[s]; p[t] = !p[t]; if (p[s]) { tr.update(s, t - 1, 2); } else { tr.update(s, t - 1, -2); } } printf( %d n , tr.query(1, n).dep_a_2b_c); } } |
#include <bits/stdc++.h> using namespace std; int a[200005], b[200005]; int main() { int n, m, i; cin >> n >> m; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < m; i++) cin >> b[i]; for (i = 0; i < m; i++) { if (i != m - 1) cout << upper_bound(a, a + n, b[i]) - a << ; else cout << upper_bound(a, a + n, b[i]) - a << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long K = 401, MAX = 1e18; int n, m, k, f; vector<pair<int, int>> adj[2 * K]; vector<pair<int, pair<int, int>>> E; vector<long long> sp; long long dist[2 * K]; bool vis[2 * K]; unordered_map<int, int> tb; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; void dijkstra(int s) { memset(vis, 0, sizeof(vis)); for (int i = 0; i < f; i++) dist[i] = MAX; dist[s] = 0; pq.push({0, s}); while (!pq.empty()) { int v = pq.top().second, d = pq.top().first; vis[v] = 1; pq.pop(); for (pair<int, int> p : adj[v]) { int u = p.second, w = p.first; if (vis[u]) continue; if (dist[v] + w < dist[u]) { dist[u] = dist[v] + w; pq.push({dist[u], u}); } } } for (int i = s + 1; i < f; i++) if (dist[i] < MAX) { sp.push_back(dist[i]); } } int main() { ios_base::sync_with_stdio(false); cin >> n >> m >> k; for (int i = 0; i < m; i++) { int x, y, w; cin >> x >> y >> w; E.push_back({w, {x, y}}); } sort(E.begin(), E.end()); for (int i = 0; i < min(k, m); i++) { int x = E[i].second.first, y = E[i].second.second, w = E[i].first; if (tb.find(x) == tb.end()) tb[x] = f++; if (tb.find(y) == tb.end()) tb[y] = f++; adj[tb[x]].push_back({w, tb[y]}); adj[tb[y]].push_back({w, tb[x]}); } for (int i = 0; i < f; i++) dijkstra(i); sort(sp.begin(), sp.end()); cout << sp[k - 1]; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, n, t, blow, head, d, h, mx, mxd; cin >> t; while (t--) { cin >> blow >> head; mx = -1; mxd = 0; while (blow > 0) { cin >> d >> h; mx = max(mx, d - h); mxd = max(mxd, d); blow--; } if (mx <= 0 && mxd < head) { cout << -1 << endl; continue; } int val = (head - mxd) / (mx); if ((head - mxd) % mx != 0) val++; val++; if (mxd >= head) val = 1; cout << val << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char tmp[120]; int n_t, n_v, n_p; map<string, string> lei; vector<string> voids[1005]; vector<string> call; inline bool cmp(vector<string>& v1, vector<string>& v2) { int i = 0, j = 0; while (v1[i] == && i < v1.size()) i++; while (v2[j] == && j < v2.size()) j++; if (v1[i] == v2[j]) { i++; j++; } else { return false; } while (i < v1.size() && j < v2.size()) { if (v1[i] == v2[j]) { i++; j++; } else if (v1[i] == T || v2[j] == T ) { i++; j++; } else { return false; } } return (v1.size() == i && v2.size() == j); } inline string readtype(string& t, int& p) { string s = ; while (islower(t[p]) || isupper(t[p]) || isdigit(t[p])) s += t[p++]; return s; } int main() { int i, j; string t; scanf( %d , &n_t); for (i = 0; i < n_t; i++) { scanf( %s , tmp); gets(tmp); t = tmp; int l = t.size(); int p = 0; while (t[p] == ) ++p; for (; p < l; p++) { if (t[p] == || t[p] == ( || t[p] == ) || t[p] == , ) continue; voids[i].push_back(readtype(t, p)); } } scanf( %d , &n_v); for (i = 0; i < n_v; i++) { string l, nam; scanf( %s , tmp), l = tmp; scanf( %s , tmp), nam = tmp; lei[nam] = l; } scanf( %d , &n_p); gets(tmp); for (i = 0; i < n_p; i++) { call.clear(); gets(tmp); t = tmp; int p = 0, l = t.size(); while (t[p] == ) ++p; for (; p < l; p++) { if (t[p] == || t[p] == ( || t[p] == ) || t[p] == , ) continue; string ss = readtype(t, p); if (!call.empty()) call.push_back(lei[ss]); else call.push_back(ss); } int cnt = 0; for (int j = 0; j < n_t; j++) if (cmp(call, voids[j])) cnt++; printf( %d n , cnt); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e8 + 5; long long MAX = 1e9; long long MOD = 1e9 + 7; long long Mod = 1e9 + 7; double EPS = 0.0001; long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); } const int dx[] = {1, -1, 0, 0, 0, 0}; const int dy[] = {0, 0, 1, -1, 0, 0}; int main() { int n; string s1; cin >> n; cin >> s1; if (n == 1 || n == 2) { cout << s1 << endl; return 0; } vector<char> ans(n, _ ); ans[(n - 1) / 2] = s1[0]; int indx1 = n % 2 == 0 ? n / 2 : n / 2 - 1; int indx2 = n % 2 == 0 ? n / 2 - 2 : n / 2 + 1; int dir1 = n % 2 == 0 ? 1 : -1; int dir2 = n % 2 == 0 ? -1 : 1; for (int i = 1; i <= n; i++) { if (i % 2 != 0 && indx1 >= 0 && indx1 < n) { ans[indx1] = s1[i]; indx1 += dir1; } if (i % 2 == 0 && indx2 >= 0 && indx2 < n) { ans[indx2] = s1[i]; indx2 += dir2; } } for (auto c : ans) cout << c; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long(n), (m); scanf( %lld%lld , &(n), &(m)); ; vector<map<long long, long long>> vals(n); long long maxi = 1; for (long long i = 0; i < (m); i++) { long long(a), (b), (c); scanf( %lld%lld%lld , &(a), &(b), &(c)); ; --a; --b; auto it = vals[a].lower_bound(c); long long l; if (!vals[a].size() || it == vals[a].begin()) l = 1; else { it--; l = (*it).second + 1; } maxi = max(maxi, l); auto it2 = vals[b].upper_bound(c); if (!vals[b].size()) vals[b][c] = l; else { if (it2 != vals[b].begin()) { it2--; if ((*it2).second >= l) continue; } vals[b][c] = l; it2 = vals[b].lower_bound(c); it2++; vector<long long> v; while (it2 != vals[b].end() && (it2->second) <= l) { v.push_back(it2->first); it2++; } for (auto j : v) vals[b].erase(j); } } printf( %lld n , maxi); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, l; cin >> n >> l; vector<int> a(n, 0), b(n, 0); for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) cin >> b[i]; if (n == 1) cout << YES n ; else { vector<int> a_diff, b_diff, result; int check_sum = 0; for (int i = 1; i < n; ++i) { a_diff.push_back(a[i] - a[i - 1]); b_diff.push_back(b[i] - b[i - 1]); } a_diff.push_back(l - a[n - 1] + a[0]); b_diff.push_back(l - b[n - 1] + b[0]); for (int i = 0; i < n; ++i) a_diff.push_back(a_diff[i]); int i = 0, j = 0, prev_i = 0; while (i < 2 * n && j < n) { while (i < 2 * n && b_diff[0] != a_diff[i]) ++i; j = 0; prev_i = i; while (i < 2 * n && j < n && b_diff[j] == a_diff[i]) ++i, ++j; i = prev_i + 1; if (j == n) { cout << YES n ; return 0; } } cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; long long n, m, ans, a, b, temp; int t; long long num[maxn]; long long mark[maxn]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> num[i]; num[i] = abs(num[i]); } sort(num, num + n); int l = 0, r = 0; while (l < n) { while (r < n && 2 * num[l] >= num[r]) { r++; } ans += r - l - 1; l++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; void dk_98() {} long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void solve() { int n; cin >> n; int arr[n][n]; for (long long i = 0; i < (int)(n); i++) { for (long long j = 0; j < (int)(n); j++) { cin >> arr[i][j]; } } if (n == 1) { cout << 0; return; } int ans[n]; memset(ans, 0, sizeof(ans)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (j != i) ans[i] = ans[i] | arr[i][j]; } } for (long long i = 0; i < (int)(n); i++) { cout << ans[i] << ; } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; dk_98(); int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000000 + 7; const long long int N = 1000000 + 6; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int tc; tc = 1; while (tc--) { long long int n, m; cin >> n >> m; string s[n]; for (long long int i = 0; i < n; i++) cin >> s[i]; long long int d[m]; for (long long int i = 0; i < m; i++) cin >> d[i]; long long int ans = 0; for (long long int j = 0; j < m; j++) { map<char, long long int> p; long long int t = 0; for (long long int i = 0; i < n; i++) { p[s[i][j]]++; t = max(t, p[s[i][j]]); } ans += t * d[j]; } cout << ans; } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:134217728 ) using namespace std; char buf[2]; vector<int> sign; int n; int main() { sign.push_back(1); scanf( %s , buf); while (1) { scanf( %s , buf); if (buf[0] == = ) break; sign.push_back(buf[0] == + ? 1 : -1); scanf( %s , buf); } scanf( %d , &n); int MIN = 0; int MAX = 0; vector<int> res; for (int i = 0; i < sign.size(); ++i) { if (sign[i] == 1) { MIN++; MAX += n; res.push_back(n); } else { MIN -= n; MAX--; res.push_back(1); } } if (MIN <= n && n <= MAX) { printf( Possible n ); int need = MAX - n; for (int i = 0; i < res.size(); ++i) { if (sign[i] == 1) { int d = min(need, res[i] - 1); res[i] -= d; need -= d; } else { int d = min(need, n - res[i]); res[i] += d; need -= d; } } printf( %d , res[0]); for (int i = 1; i < res.size(); ++i) { if (sign[i] == 1) printf( + ); else printf( - ); printf( %d , res[i]); } printf( = %d n , n); } else printf( Impossible n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 105; string name[MAXN], surname[MAXN]; bool u[MAXN]; int n; int x1[30], x2[30]; int Getn() { int res = 0; for (int i = 0; i < 26; i++) res += min(x1[i], x2[i]); return res; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> name[i]; for (int i = 1; i <= n; i++) cin >> surname[i]; sort(name + 1, name + n + 1); sort(surname + 1, surname + n + 1); for (int i = 1; i <= n; i++) x1[name[i][0] - A ]++; for (int i = 1; i <= n; i++) x2[surname[i][0] - A ]++; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (!u[j]) { int c = Getn(); x1[name[i][0] - A ]--; x2[surname[j][0] - A ]--; if (Getn() != c - (name[i][0] == surname[j][0])) { x1[name[i][0] - A ]++; x2[surname[j][0] - A ]++; continue; } u[j] = true; cout << name[i] << << surname[j]; if (i != n) cout << , ; else cout << endl; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 7; unordered_map<int, int> f[N]; int n, m, k, ans, p[N], sx[N], sy[N]; inline int sol(int x, int y) { if (f[x].count(y)) return f[x][y]; int t; printf( ? %d %d n , x, y), fflush(stdout), scanf( %d , &t); return f[x][y] = t; } inline vector<int> solve(int n, int m, vector<int>& x, vector<int>& y) { if (n >= m) { if (n == 1) { vector<int> z; z.resize(1), z[0] = 1; ans = min(ans, sol(x[0], y[0])); return z; } else { vector<int> a, b; for (int i = 0; i < n; i += 2) a.push_back(x[i]); for (int i = 0; i < m; i++) b.push_back(y[i]); vector<int> z = solve((n + 1) / 2, m, a, b), q; z.push_back(m); int k = 0; for (int i = 0; i < n; i++) { if (i % 2 == 0) q.push_back(z[k++]); else { int sum = 1000000001, pos = 0; for (int c = z[k - 1]; c <= z[k]; c++) { int g = sol(x[i], y[c - 1]); if (sum > g) sum = g, pos = c; } q.push_back(pos), ans = min(ans, sum); } } return q; } } else { int l = 1; sx[l] = 1, sy[l] = 1; for (int i = 2; i <= m; i++) { while (l > 0) { int a = sol(x[sx[l] - 1], y[sy[l] - 1]), b = sol(x[sx[l] - 1], y[i - 1]); if (a > b) l--; else break; } if (sx[l] != n) l++, sx[l] = sx[l - 1] + 1, sy[l] = i; } vector<int> a, b, w; for (int i = 0; i < n; i++) a.push_back(x[i]); for (int i = 1; i <= l; i++) b.push_back(y[sy[i] - 1]), w.push_back(sy[i]); vector<int> z = solve(n, l, a, b), q; for (int i = 0; i < w.size(); i++) p[i + 1] = w[i]; for (int i = 0; i < z.size(); i++) q.push_back(p[z[i]]); return q; } } int main() { cin >> n >> m; vector<int> a, b; a.resize(n), b.resize(m), ans = 1000000000; for (int i = 0; i < n; i++) a[i] = i + 1; for (int i = 0; i < m; i++) b[i] = i + 1; solve(n, m, a, b); printf( ! %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> s; s = ? + s + ? ; int c = 0; bool flag = true; for (int i = 1; i <= n; i++) { if (s[i] == ? ) { c++; if (s[i - 1] == s[i + 1] || s[i - 1] == ? || s[i + 1] == ? ) { flag = false; } } if (s[i] == s[i - 1] && s[i] != ? ) { flag = true; break; } } cout << (c == 0 || flag ? NO : YES ) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x[n], y[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; } if (n == 1) { cout << -1 << endl; } else if (n == 2) { if (x[0] != x[1] && y[0] != y[1]) { int a = fabs(x[0] - x[1]), b = fabs(y[0] - y[1]); cout << a * b << endl; } else { cout << -1 << endl; } } else if (n == 3 || n == 4) { sort(x, x + n); sort(y, y + n); int a = fabs(x[0] - x[n - 1]), b = fabs(y[0] - y[n - 1]); cout << a * b << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long t, n, i, j, k, l, r, minn, maxx, ans, x, y; cin >> t; while (t--) { cin >> n; cin >> maxx >> minn; for (i = 1; i < n; i++) { cin >> x >> y; maxx = max(maxx, x); minn = min(minn, y); } if (maxx <= minn) ans = 0; else ans = maxx - minn; cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int q; int main(void) { cin >> q; while (q--) { long long l, r, ans = 0, num = 0; cin >> l >> r; num = r - l + 1; if (r & 1) { ans -= num / 2; if (num & 1) ans -= l; } else { ans += num / 2; if (num & 1) ans += l; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> #define rep(i,a,b) for(int i = (a); i < (b); ++i) #define rrep(i,a,b) for(int i = (b); i --> (a);) #define sz(v) int(v.size()) using namespace std; string inf, zero; string add(string x, string y, int init){ string res(sz(x), ? ); int todo = init; rrep(i,0,sz(x)){ todo += x[i] + y[i] - 2 * 0 ; res[i] = todo % 2 + 0 ; todo /= 2; } if(todo) return inf; return res; } int main(){ int n, b; cin >> n >> b; inf = string(b, 1 ); zero = string(b, 0 ); vector<string> fibs = {zero, zero}; // fibonacci numbers minus one while(fibs.back() < inf) fibs.push_back(add(fibs.back(), fibs[sz(fibs)-2], 1)); int todo = sz(fibs)-1; deque<pair<int, bool>> ls; rep(i,0,n) ls.push_back({i+1, true}); string lb = zero; // current lower bound while(!ls.empty()){ string ans; if(add(lb, fibs[todo], 0) == inf) ans = no ; else { cout << ls.back().first << << add(lb, fibs[max(0, todo)], 0) << endl; cin >> ans; } if(ans == yes ){ lb = add(lb, fibs[todo], 1); while(!ls.empty() && ls[0].second){ ls.pop_front(); todo += 2; } if(ls.empty()) break; ls[0].second = true; } else { ls.push_front({ls.back().first, false}); ls.pop_back(); } if(--todo <= 0){ todo += ls[0].second ? 2 : 1; ls.pop_front(); } } cout << 0 << << lb << endl; } |
#include <bits/stdc++.h> using namespace std; char _; const long long maxN = 200 * 1000 + 5; const long long maxM = 5000 + 5; const long long mod = 1000 * 1000 * 1000 + 7; const long long base = 701; const long long SQ = 500; const long long maxL = 20; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); long long s, x; cin >> s >> x; if (s < x) { cout << 0 << endl; return 0; } long long ans = 1; for (long long i = 0; i < 40; i++) if (x >> i & 1) ans *= 2; long long carry = 0; for (long long i = 40; i >= 0; i--) { long long g = (s >> i & 1), f = (x >> i & 1); if (carry == 0 && f == 0 && g == 0) continue; if (carry == 0 && f == 0 && g == 1) { carry = 1; continue; } if (carry == 0 && f == 1 && g == 0) { cout << 0 << endl; return 0; } if (carry == 0 && f == 1 && g == 1) continue; if (carry == 1 && f == 0 && g == 0) { carry = 0; continue; } if (carry == 1 && f == 0 && g == 1) continue; if (carry == 1 && f == 1 && g == 0) continue; if (carry == 1 && f == 1 && g == 1) { cout << 0 << endl; return 0; } } if (s == x) ans -= 2; if (carry) cout << 0 << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int N; cin >> N; int c; cin >> c; int A[N]; A[0] = 0; int B[N]; B[0] = 0; for (int i = 1; i < N; i++) cin >> A[i]; for (int i = 1; i < N; i++) cin >> B[i]; int f[N][2]; f[0][0] = 0; f[0][1] = c; for (int j = 1; j < N; j++) { f[j][0] = min(f[j - 1][0], f[j - 1][1]) + A[j]; f[j][1] = min(f[j - 1][0] + c, f[j - 1][1]) + B[j]; } for (int i = 0; i < N - 1; i++) cout << min(f[i][0], f[i][1]) << ; cout << min(f[N - 1][0], f[N - 1][1]) << endl; return 0; } |
#include <bits/stdc++.h> using ul = std::uint32_t; using li = std::int32_t; using ull = std::uint64_t; using ll = std::int64_t; using llf = long double; ul n, m, k; const ul maxn = 2e5; const ul base = 998244353; ul plus(ul a, ul b) { return a + b < base ? a + b : a + b - base; } ul plus(ul a, ul b, ul c) { return plus(plus(a, b), c); } ul minus(ul a, ul b) { return a < b ? a + base - b : a - b; } ul mul(ul a, ul b) { return ull(a) * ull(b) % base; } ul mul(ul a, ul b, ul c) { return mul(mul(a, b), c); } ul mul(ul a, ul b, ul c, ul d) { return mul(mul(a, b, c), d); } void exgcd(li a, li b, li& x, li& y) { if (b) { exgcd(b, a % b, y, x); y -= a / b * x; } else { x = 1; y = 0; } } ul inverse(ul a) { li x, y; exgcd(a, base, x, y); return x < 0 ? x + li(base) : x; } ul pow(ul a, ul b) { ul ret = 1; while (b) { if (b & 1) { ret = mul(a, ret); } b >>= 1; a = mul(a, a); } return ret; } ul h[maxn + 1]; ul fac[maxn + 1]; ul fiv[maxn + 1]; ul twopow[maxn + 1]; ul bi(ul a, ul b) { return mul(fac[a], fiv[b], fiv[a - b]); } ul g(ul a) { ul ret = mul(base + 1 >> 1, twopow[a]); if (~a & 1) { ret = minus(ret, mul(base + 1 >> 1, bi(a, a >> 1))); } return ret; } int main() { fac[0] = 1; twopow[0] = 1; for (ul i = 1; i <= maxn; ++i) { fac[i] = mul(fac[i - 1], i); twopow[i] = plus(twopow[i - 1], twopow[i - 1]); } fiv[maxn] = inverse(fac[maxn]); for (ul i = maxn; i; --i) { fiv[i - 1] = mul(fiv[i], i); } std::scanf( %u%u , &n, &k); k %= base; for (ul i = 1; i <= n; ++i) { std::scanf( %u , &h[i]); } for (ul i = 1; i <= n; ++i) { m += h[i] != h[i % n + 1]; } ul ans = 0; for (ul a = 0; a <= m; ++a) { ans = plus(ans, mul(bi(m, a), pow(minus(k, 2), m - a), g(a))); } ans = mul(ans, pow(k, n - m)); std::printf( %u n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; set<int> s; map<int, int> mm; int a[500005]; int main() { int n, m, d; cin >> n >> m >> d; for (int i = 0; i < n; i++) { int k; cin >> k; s.insert(k); a[i] = k; } set<int>::iterator it1, it2, it3; int sum = 0; for (it1 = s.begin(); it1 != s.end(); it1++) { sum++; mm[*it1] = sum; it2 = it1; while (s.upper_bound((*it2) + d) != s.end()) { it3 = s.upper_bound((*it2) + d); mm[*it3] = sum; it2 = it3; s.erase(it3); } } cout << sum << endl; for (int i = 0; i < n; i++) { cout << mm[a[i]] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; const int MAXM = 1100; const int MAXK = 100100; int n, m, k, len[MAXK], max_len[MAXN][MAXM][4]; int mm[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; char mmap[MAXN][MAXM], dir[MAXK], direction[256]; vector<pair<int, int> > possible; vector<char> sol; int get_max_len(int r, int c, int d) { if (max_len[r][c][d] != -1) return max_len[r][c][d]; if (mmap[r][c] == # ) return -1; int &ml = max_len[r][c][d]; ml = 0; int nr = r + mm[d][0]; int nc = c + mm[d][1]; ml += 1 + get_max_len(nr, nc, d); return ml; } bool solve(int r, int c) { for (int i = 0; i < k; i++) { int d = direction[(int)dir[i]]; int maxd = get_max_len(r, c, d); if (maxd < len[i]) return false; r += mm[d][0] * len[i]; c += mm[d][1] * len[i]; } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); direction[ N ] = 1; direction[ S ] = 0; direction[ E ] = 2; direction[ W ] = 3; cin >> n >> m; for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) { if (i == 0 || i > n || j == 0 || j > m) mmap[i][j] = # ; else cin >> mmap[i][j]; if ( A <= mmap[i][j] && mmap[i][j] <= Z ) possible.push_back(make_pair(i, j)); max_len[i][j][0] = -1; max_len[i][j][1] = -1; max_len[i][j][2] = -1; max_len[i][j][3] = -1; } cin >> k; for (int i = 0; i < k; i++) cin >> dir[i] >> len[i]; for (int i = 0; i < (int)possible.size(); i++) { int r = possible[i].first; int c = possible[i].second; if (solve(r, c)) sol.push_back(mmap[r][c]); } if (sol.empty()) cout << no solution << endl; else { sort(sol.begin(), sol.end()); for (int i = 0; i < (int)sol.size(); i++) cout << sol[i]; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, num = 1, mul; cin >> n; string s = codeforces ; int ln = s.length(), a[12] = {0}; for (long long int i = 2; i <= 100; i++) { long long int curr = pow(i, 10ll); if (curr >= n) { for (int j = 0; j < 10; j++) { a[j] = i - 1; num *= (i - 1); } mul = i; break; } } int pos = 0; while (num < n) { num /= (mul - 1); num *= mul; a[pos] = mul; pos++; } for (int i = 0; i < 10; i++) { for (int j = 0; j < a[i]; j++) cout << s[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD9 = 1e9 + 7; const int MOD91 = 1e9 + 9; const long long MOD12 = 1e12 + 39LL; const long long MOD15 = 1e15 + 37LL; const int INF = 1e9; const int base = 1e9; const int MAX = 2e5; const long double EPS = 1e-10; int n; int a[200000]; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; } sort(a, a + n); if (a[0] == a[n - 1] && a[0] == 1) { for (int i = 0; i < n - 1; ++i) { cout << a[i] << ; } cout << 2; return 0; } cout << 1 << ; for (int i = 0; i < n - 1; ++i) { cout << a[i] << ; } return 0; } |
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <utility> #include <set> #include <queue> #include <deque> #include <stack> #include <map> #include <math.h> #include <iomanip> #include <fstream> #include <bitset> #include <sstream> using namespace std; //#define M_PI (ldb)3.14159265358979323846 // pi #define forr(i,a,b,c) for(int i=a;i<b;i+=c) #define forrb(i,a,b,c) for(int i=a;i>b;i-=c) #define fori(i,n) forr(i,0,n,1) #define forit(it,arr) for(auto it=arr.begin();it != arr.end();it++) #define forib(i,n) forrb(i,n-1,-1,1) #define forn(i,n) forr(i,1,n,1) #define fornb(i,n) forrb(i,n-1,0,1) #define fort(i,m,n) forr(i,m,n,1) #define fortb(i,m,n) forrb(i,n-1,m-1,1) #define forin(i,arr) fori(i,arr.size()) #define forinb(i,arr) forib(i,arr.size()) #define forrl(i,a,b,c) for(lol i=a;i<b;i+=c) #define forrbl(i,a,b,c) for(lol i=a;i>b;i-=c) #define foril(i,n) forrl(i,0,n,1) #define foribl(i,n) forrbl(i,n-1,-1,1) #define fornl(i,n) forrl(i,1,n,1) #define fornbl(i,n) forrbl(i,n-1,0,1) #define fortl(i,m,n) forrl(i,m,n,1) #define fortbl(i,m,n) forrbl(i,n-1,m-1,1) #define forinl(i,arr) foril(i,arr.size()) #define forinbl(i,arr) foribl(i,arr.size()) #define forpm(i) forr(i,-1,2,2) #define into(i) cin >> i; #define intov(arr,n) fori(kkkk,n){into(arr[kkkk])} #define def(i) lol i; into(i) #define deft(t,i) t i; into(i) #define defl(i) lol i; into(i) #define defs(i) string i; into(i) #define defn def(n) #define defp def(p) #define defm def(m) #define defk def(k) #define defa def(a) #define defb def(b) #define defc def(c) #define defd def(d) //#define vec(a) vector<a> #define co cout << #define out(a) cout << (a) << ; #define el << endl; #define ell << n ; #define outv(arr,n) fori(iii,n){out(arr[iii])} co el #define outvv(arr,n,m) fori(jjj,n){outv(arr[jjj],m)} #define cas(p) co Case # << p+1 << : ; #define ex return 0; #define qii queue<int> #define sti stack<int> #define dei deque<int> #define seti set<int> #define con continue; #define br break; #define maxi 1000000007 // 998244353 #define maxiu 4294967295 #define lmaxi 2000000000000000007 #define mod %maxi #define wne(arr) while(!arr.empty()) #define all(arr) arr.begin(),arr.end() #define getv(arr,n) fori(i,n) {into(arr[i])} #define defv(arr,n) veci arr(n); fori(i,n) {into(arr[i])} #define min2(a,b) a=min(a,b); #define max2(a,b) a=max(a,b); #define vec vector #define ff first #define ss second #define pow2(x) (x)*(x) #define pow3(x) (x)*(x)*(x) #define getgraph(m,cons) fori(i,m){defa defb a--; b--; cons[a].push_back(b);cons[b].push_back(a);} #define getdirectedgraph(m,cons) fori(i,m){defa defb a--; b--; cons[a].push_back(b);} #define getwightedgraph(m,cons) fori(i,m){defa defb defc a--; b--; cons[a].push_back({b,c});cons[b].push_back({a,c});} #define getwighteddirectedgraph(m,cons) fori(i,m){defa defb defc a--; b--; cons[a].push_back({b,c});} typedef vector<int> veci; typedef long long lol; typedef unsigned long long ulol; typedef unsigned int uint; typedef long double ldb; typedef vector<lol> vecl; typedef vector<uint> vecui; typedef vector<ulol> vecul; #define table(name,n,m) vector<veci> name(n,veci (m)); #define tablel(name,n,m) vector<vecl> name(n,vecl (m)); typedef pair<lol, lol> point; #define setp set<point> #define bmod %99999999999899999 typedef pair<point, point> poin; typedef pair<long double, long double> pointd; typedef pair<lol, point> poing; typedef pair<point, lol> poinf; typedef vector<point> vecp; #define poi(x,y) make_pair(x,y) struct BigNum { #define sizer (lol) 1e9 #define digss (lol) 9 vecl value; void set(lol x) { value = *(new vecl); value.push_back(x); } void duplicate(BigNum other) { value = other.value; } void add(BigNum other) { vecl o = other.value; if (o.size() > value.size()) { vecl t = value; value = o; o = t; } forin(i, o) { value[i] += o[i]; if (i < value.size() - 1 && value[i] >= sizer) { value[i + 1] += value[i] / sizer; value[i] = value[i] % sizer; } } if (value.back() >= sizer) { value.push_back(value.back() / sizer); value[value.size() - 2] = value[value.size() - 2] % sizer; } } void mul(lol mul) { forin(i, value) { value[i] *= mul; } fori(i, value.size() - 1) { if (value[i] >= sizer) { value[i + 1] += value[i] / sizer; value[i] = value[i] % sizer; } } if (value.back() >= sizer) { value.push_back(value.back() / sizer); value[value.size() - 2] = value[value.size() - 2] % sizer; } } long double div(BigNum other1, BigNum other2) { int s = value.size(); long double current = value.back(); if (s >= 2) { current += ((long double)value[s - 2]) / sizer; } if (s >= 3) { current += ((long double)value[s - 3]) / (sizer * sizer); } int s1 = other1.value.size(); int s2 = other2.value.size(); long double other = 0; if (s1 + s2 - 1 == s) { other += other1.value.back() * other2.value.back(); if (s1 >= 2) { other += ((long double)other1.value[s1 - 2] * other2.value.back()) / sizer; } if (s2 >= 2) { other += ((long double)other2.value[s2 - 2] * other1.value.back()) / sizer; } if (s1 >= 3) { other += ((long double)other1.value[s1 - 3] * other2.value.back()) / (sizer * sizer); } if (s2 >= 3) { other += ((long double)other2.value[s2 - 3] * other1.value.back()) / (sizer * sizer); } } if (s1 + s2 - 1 == s - 1) { other += other1.value.back() * other2.value.back(); if (s1 >= 2) { other += ((long double)other1.value[s1 - 2] * other2.value.back()) / sizer; } if (s2 >= 2) { other += ((long double)other2.value[s2 - 2] * other1.value.back()) / sizer; } other /= sizer; } if (s1 + s2 - 1 == s - 2) { other += other1.value.back() * other2.value.back(); other /= sizer * sizer; } return other / current; } string stringify() { string out = to_string(value.back()); forib(i, value.size() - 1) { string cur = to_string(value[i] + sizer); out += cur.substr(1); } return out; } }; lol gcd(lol a, lol b) { if (b == 0) { return a; } return gcd(b, a % b); } lol triangle(lol x) { return ((x - 1) * x) / 2; } lol antitriangle(lol x) { lol low = 0, high = 2 * maxi; while (low < high) { lol mid = (low + high + 1) / 2; if (triangle(mid) <= x) { low = mid; } else { high = mid - 1; } } return low; } lol modInverse(lol a) { lol m = maxi; lol y = 0, x = 1; while (a > 1) { lol q = a / m; lol t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) { x += maxi; } return x; } lol modInverse(lol a, lol b) { lol m = b; lol y = 0, x = 1; while (a > 1) { lol q = a / m; lol t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) { x += b; } return x; } lol poww(lol a, lol b) { if (b == 0) { return 1; } if (b % 2 == 0) { return poww((a * a)mod, b / 2)mod; } return (a * poww((a * a)mod, b / 2))mod; } lol pow(lol a, lol b, lol m) { if (b == 0) { return 1; } if (b % 2 == 0) { return pow((a * a) % m, b / 2, m) % m; } return (a * pow((a * a) % m, b / 2, m)) % m; } vecl dev(vecp divisors) { if (divisors.size() == 0) { vecl cur; cur.push_back(1); return cur; } lol x = divisors.back().first; lol n = divisors.back().second; divisors.pop_back(); vecl ans = dev(divisors); vecl cur; lol xi = 1; fori(i, n + 1) { forin(j, ans) { cur.push_back(ans[j] * xi); } xi *= x; } return cur; } bool isprime(lol a) { if (a == 1) { return false; } for (int i = 2; i * i <= a; i++) { if (a % i == 0) { return false; } } return true; } void add(veci & x, veci & y) { forin(i, x) { x[i] += y[i]; } } vecl mul(vecl x, lol a) { forin(i, x) { x[i] = (x[i] * a)mod; } return x; } vecl add(vecl x, vecl & y) { forin(i, x) { x[i] = (x[i] + y[i])mod; } return x; } #define logn 18 int lca(vector<veci> & f, veci & depth, int a, int b) { if (depth[a] < depth[b]) { swap(a, b); } fori(k, logn) { if ((depth[a] - depth[b]) & (1 << k)) { a = f[k][a]; } } if (a == b) { return a; } forib(k, logn) { if (f[k][a] != f[k][b]) { a = f[k][a]; b = f[k][b]; } } return f[0][a]; } int tredist(vector<veci>& f, veci& depth, int a, int b) { return depth[a]+ depth[b]- 2*depth[lca(f,depth,a,b)]; } struct pt { #define intopt(a) into(a.x) into(a.y) #define defpt(a) pt a;intopt(a) lol x, y; lol d() const // squared length { return x * x + y * y; } }; typedef vector<pt> vecpp; inline pt operator-(const pt & a) { return { -a.x, -a.y }; } inline pt operator+(const pt & a, const pt & b) { return { a.x + b.x, a.y + b.y }; } inline pt operator-(const pt & a, const pt & b) { return { a.x - b.x, a.y - b.y }; } inline lol operator*(const pt & a, const pt & b) { return a.x* b.y - a.y * b.x; } // cross product inline bool operator<(const pt& a, const pt& b) { if (a * b != 0) return a * b < 0; return a.d() < b.d(); } bool llll(const pt & a, const pt & b) { return a * b > 0; } inline bool operator<=(const pt & a, const pt & b) { return a * b <= 0; } inline lol operator/(const pt & a, const pt & b) { return a.x* b.x + a.y * b.y; } // dot product inline bool operator==(const pt & a, const pt & b) { return a.x == b.x && a.y == b.y; } // equal inline bool operator!=(const pt & a, const pt & b) { return a.x != b.x || a.y != b.y; } // not equal pt o = { 0 ,0 }; bool comp(pt a, pt b) { if ((a - o) * (b - o) != 0) return (a - o) * (b - o) < 0; return (a - o).d() < (b - o).d(); } bool decreasing(int a, int b) { return a > b; } #define digits 30 struct booleantree { booleantree* left = NULL; booleantree* right = NULL; void add(int val) { booleantree* cur = this; forib(i, digits) { if ((val & (1 << i))) { if (cur->right == NULL) { cur->right = new booleantree(); } cur = cur->right; } else { if (cur->left == NULL) { cur->left = new booleantree(); } cur = cur->left; } } } int find(int val) { booleantree* cur = this; int ans = 0; forib(i, digits) { if ((val & (1 << i))) { if (cur->left == NULL) { cur = cur->right; } else { cur = cur->left; ans += (1 << i); } } else { if (cur->right == NULL) { cur = cur->left; } else { cur = cur->right; ans += (1 << i); } } } return ans; } }; struct segtremin { vector<vecl> arr; int n; int curlogn; segtremin(int size, int logni) { n = size; curlogn = logni; arr.resize(curlogn); fori(i, curlogn) { arr[i].resize(size + 1); } } inline lol val(int start, int end) { if (end >= n) { end = n - 1; } if (start < 0) { start = 0; } lol mini = lmaxi; fori(i, curlogn) { if (start > end) { br } if ((end & 1) == 0) { min2(mini, arr[i][end]); end--; if (end < 0) { br } } if ((start & 1)) { min2(mini, arr[i][start]) start++; } start /= 2; end /= 2; } return mini; } inline void add(int start, lol num) { arr[0][start] = num; forn(i, curlogn) { arr[i][start >> i] = min(arr[i - 1][(start >> i) * 2], arr[i - 1][(start >> i) * 2 + 1]); } } }; struct segtreminplus { vecl arr; vector<vecl> arr2; vector<vecl> arr3; vector<vecl> arr4; int n; int curlogn; segtreminplus(int size, int logni) { n = size; curlogn = logni; arr.resize(size + 1); arr2.resize(curlogn); fori(i, curlogn) { arr2[i].resize(size + 1); } arr3.resize(curlogn); fori(i, curlogn) { arr3[i].resize(size + 1); } arr4.resize(curlogn); fori(i, curlogn) { arr4[i].resize(size + 1); } } inline void fixcate(int i, int j) { if (j < 0) { return; } if (i == 0) { arr2[i][j] = 1; arr3[i][j] = 1; arr4[i][j] = 1; return; } arr2[i][j] = max(arr2[i-1][2*j], arr2[i - 1][2 * j+1]); arr3[i][j] = arr3[i - 1][2 * j]; arr4[i][j] = arr4[i - 1][2 * j+1]; if (((2 * j + 1) << (i - 1)) < n && arr[((2 * j + 1) << (i - 1))] > arr[((2 * j + 1) << (i - 1)) - 1]) { arr2[i][j] = max(arr2[i][j], arr4[i - 1][2 * j]+ arr3[i - 1][2 * j+1]); if (arr2[i - 1][2 * j+1] == (1 << (i - 1))) { arr4[i][j] = arr4[i - 1][2 * j + 1] + arr4[i - 1][2 * j]; } if (arr2[i - 1][2 * j] == (1 << (i - 1))) { arr3[i][j] = arr3[i - 1][2 * j + 1] + arr3[i - 1][2 * j]; } } } inline lol val(int start) { if (start > 0) { return arr[start]; } return arr2[curlogn-1][0]; } inline void change(int start, lol num) { arr[start] = num; fori(i, curlogn) { fixcate(i, start >> i); } } }; struct segtresum { vector<vecl> arr; int n; int curlogn; segtresum(int size, int logni) { n = size; curlogn = logni; arr.resize(curlogn); fori(i, curlogn) { arr[i].resize(size + 1); } } inline lol val(int start, int end) { /*if (end >= n) { end = n - 1; } if (start < 0) { start = 0; }*/ lol mini = 0; fori(i, curlogn) { if (start > end) { br } if ((end & 1) == 0) { mini += arr[i][end]; end--; if (end < 0) { br } } if ((start & 1)) { mini += arr[i][start]; start++; } start /= 2; end /= 2; } return mini; } inline void add(int start, lol num) { arr[0][start] = num; forn(i, curlogn) { arr[i][start >> i] = arr[i - 1][(start >> i) * 2] + arr[i - 1][(start >> i) * 2 + 1]; } } inline void radd(int start, lol num) { arr[0][start] += num; forn(i, curlogn) { arr[i][start >> i] = arr[i - 1][(start >> i) * 2] + arr[i - 1][(start >> i) * 2 + 1]; } } }; struct segtresumplus { vector<vecl> arr; vector<vecl> arrplus; vector<vecl> truearrplus; int n; int curlogn; segtresumplus(int size, int logni) { n = size; curlogn = logni; arr.resize(curlogn); fori(i, curlogn) { arr[i].resize(size + 1); } arrplus.resize(curlogn); fori(i, curlogn) { arrplus[i].resize(size + 1); } truearrplus.resize(curlogn); fori(i, curlogn) { truearrplus[i].resize(size + 1); } } inline void fix(int h, int s) { /*if (arrplus[h][s] == 0) { return; } arr[h][s] += arrplus[h][s] << h; if (h > 0) { arrplus[h - 1][2 * s] += arrplus[h][s]; arrplus[h - 1][2 * s+ 1] += arrplus[h][s]; } arrplus[h][s] = 0;*/ } inline lol val(int start, int end) { /*if (end >= n) { end = n - 1; } if (start < 0) { start = 0; }*/ forib(i, curlogn) { fix(i, start >> i); fix(i, end >> i); } lol mini = 0; fori(i, curlogn) { if (start > end) { br } if ((end & 1) == 0) { fix(i, end); mini += arr[i][end]; mini += arrplus[i][end]; fort(j, i + 1, curlogn) { mini += truearrplus[j][end >> (j-i)]<< i; } end--; if (end < 0) { br } } if ((start & 1)) { fix(i, start); mini += arr[i][start]; mini += arrplus[i][start]; fort(j, i + 1, curlogn) { mini += truearrplus[j][start >> (j - i)] << i; } start++; } start /= 2; end /= 2; } return mini; } inline void add(int start, lol num) { arr[0][start] = num; forn(i, curlogn) { arr[i][start >> i] = arr[i - 1][(start >> i) * 2] + arr[i - 1][(start >> i) * 2 + 1]; } } inline void radd(int start,int end, lol num) { fori(i, curlogn) { if (start > end) { br } if ((end & 1) == 0) { truearrplus[i][end]+=num; fort(j,i, curlogn) { arrplus[j][end >> (j-i)] += num << i; } end--; if (end < 0) { br } } if ((start & 1)) { truearrplus[i][start] += num; fort(j, i, curlogn) { arrplus[j][start >> (j - i)] += num << i; } start++; } start /= 2; end /= 2; } } }; struct unionfind{ veci arr; veci arr2; int num; unionfind(int size) { arr.resize(size); arr2.resize(size); num = size; fori(i, size) { arr[i] = i; arr2[i] = 1; } } int find(int a) { if (arr[a] == a) { return a; } return arr[a] = find(arr[a]); } inline void unioner(int a, int b) { a = find(a), b = find(b); if (a != b) { num--; if (arr2[a] > arr2[b]) { swap(a, b); } arr[a] = b; arr2[b] += arr2[a]; } } }; string op(string s) { string ans; forinb(i, s) { ans.push_back(s[i]); } return ans; } void merge(veci& color, vector<veci>& allcolor, int l, int r) { if (color[l] == color[r]) { return; } l = color[l]; r = color[r]; if (allcolor[l].size() < allcolor[r].size()) { swap(l, r); } forin(j, allcolor[r]) { color[allcolor[r][j]] = l; allcolor[l].push_back(allcolor[r][j]); } allcolor[r].resize(0); } vecpp conv(vecpp a) { pt left = { 99999999999999,999999999999999 }; forin(i, a) { if (a[i].x < left.x || a[i].x == left.x && a[i].y > left.y) { left = a[i]; } } o = left; forin(i, a) { if (a[i] == left) { a[i] = a.back(); a.pop_back(); br } } sort(all(a), comp); vecpp conv(1, left); forin(i, a) { while (conv.size() > 1) { if ((a[i] - conv.back()) * (conv.back() - conv[conv.size() - 2]) <= 0) { conv.pop_back(); } else { br } } conv.push_back(a[i]); } while (conv.size() > 1) { if ((left - conv.back()) * (conv.back() - conv[conv.size() - 2]) <= 0) { conv.pop_back(); } else { br } } return conv; } int main() { ios::sync_with_stdio(0); cin.tie(0); defn defm veci a(n); intov(a,n) vector<veci> primer(100000); vector<veci> nekt(logn, veci(n+1, n)); fori(i, n) { fort(j,2, 400) { if (a[i] % j == 0) { primer[j].push_back(i); while (a[i] % j == 0) { a[i] /= j; } } } if (a[i] > 1) { primer[a[i]].push_back(i); } } forin(i, primer) { fori(j, ((int)primer[i].size())-1) { min2(nekt[0][primer[i][j]], primer[i][j + 1]); } } forib(i, n-1) { min2(nekt[0][i], nekt[0][i+1]); forn(j, logn) { nekt[j][i] = nekt[j - 1][nekt[j - 1][i]]; } } fori(i, m) { defa defb int ans = 1; a--; int k = logn - 1; while (k >= 0) { if (nekt[k][a] < b) { a = nekt[k][a]; ans += 1 << k; } else { k--; } } co ans el } ex } |
#include <bits/stdc++.h> using namespace std; int solve(); int main() { solve(); } int solve() { string s; vector<int> cnt(26); cin >> s; int ncnt = 0; for (int i = 0; i < s.size(); ++i) ++cnt[s[i] - a ]; for (int i = 0; i < 26; ++i) ncnt += (cnt[i] & 1); while (ncnt > 1) { for (int i = 25; i >= 0; --i) { for (int j = 0; j < i; ++j) { if ((cnt[i] & 1) && (cnt[j] & 1)) { ncnt -= 2; ++cnt[j]; --cnt[i]; break; } } } } for (int i = 0; i < 26; ++i) { for (int j = 0; j < cnt[i] / 2; ++j) { cout << (char)(i + a ); } } if (ncnt) { for (int i = 0; i < 26; ++i) { if (cnt[i] & 1) cout << (char)(i + a ); } } for (int i = 25; i >= 0; --i) { for (int j = 0; j < cnt[i] / 2; ++j) { cout << (char)(i + a ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 333333; const int INF = 2000000000; int n, m, k, a[M]; inline int read() { char c = getchar(); int ans = 0; while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) ans = (ans << 1) + (ans << 3) + (c ^ 48), c = getchar(); return ans; } int main() { n = read(), m = read(), k = read(); for (int i = 1; i <= m; i++) a[i] = INF; for (int i = 1, x, c; i <= n; i++) { x = read(), c = read(); a[x] = min(a[x], c); } int ans = 0; for (int i = 1; i <= m; i++) ans += a[i]; printf( %d , min(ans, k)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, ans; string a; int main() { cin >> a; ans = a.size(); long long t = 0; for (int i = 0; i < a.size(); i++) { if (a[i] == ) ) t--; else t++; if (t < 0) { t = 0; ans--; } } cout << ans - t << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int m, n; cin >> n >> m; if (n > 26) cout << m; else { int a = 2; for (int i = 2; i <= n; i++) a = a * 2; cout << m % a; } } |
#include <bits/stdc++.h> using namespace std; int ans[10000]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int n, k; string s; cin >> n >> k; cin >> s; int cnt = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == s[i - 1]) { cnt++; } else { ans[s[i - 1]] += cnt / k; cnt = 1; } } ans[s[s.size() - 1]] += cnt / k; int mx = -1; for (char i = a ; i <= z ; i++) { mx = max(ans[i], mx); } cout << mx; } |
#include <bits/stdc++.h> using namespace std; struct node { long k, na; }; const long maxn = 100001; node a[maxn]; long n, b[maxn]; int qsort(long low, long high) { long i = low, j = high, x = a[(i + j) / 2].k; while (i < j) { while (a[i].k < x) i++; while (a[j].k > x) j--; if (i <= j) { swap(a[i], a[j]); i++; j--; } } if (i < high) qsort(i, high); if (j > low) qsort(low, j); return 0; } void init() { cin >> n; for (long i = 1; i <= n; i++) { cin >> a[i].k; a[i].na = i; } qsort(1, n); } void work() { memset(b, 0, sizeof(b)); for (long i = 1; i <= n; i++) b[a[i].k] += 1; int bj = 1; for (long i = 2; i <= a[n].k; i++) if (b[i] > b[i - 1]) bj = 0; if (bj) { cout << b[1] << endl; long s = 0; for (long i = 1; i <= n; i++) { if ((i == 1) || (a[i].k == a[i - 1].k)) s++; else s = 1; b[a[i].na] = s; } for (long i = 1; i <= n; i++) { cout << b[i]; if (i != n) cout << ; } cout << endl; } else cout << -1 << endl; } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, w[1000999]; int arr[1009999]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &w[i]); arr[w[i]]++; } for (int i = 0; i < 1000099; i++) { arr[i + 1] += arr[i] / 2; arr[i] = arr[i] % 2; } int ans = 0; for (int i = 0; i < 1000099; i++) { if (arr[i] >= 1) { ans++; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 500 + 5; const int mod = 26; long long qp(long long a, long long n) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } template <class T> inline bool scan(T &ret) { char c; int sgn; if (c = getchar(), c == EOF) return 0; while (c != - && (c < 0 || c > 9 )) c = getchar(); sgn = (c == - ) ? -1 : 1; ret = (c == - ) ? 0 : (c - 0 ); while (c = getchar(), c >= 0 && c <= 9 ) ret = ret * 10 + (c - 0 ); ret *= sgn; return 1; } template <class T> inline void out(T x) { if (x > 9) out(x / 10); putchar(x % 10 + 0 ); } int n, m; vector<pair<int, int> > mp[maxn]; int flag[maxn]; int res[maxn]; int main() { scan(n), scan(m); int x; int flagt = 0, tmp = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { scan(x); mp[i].emplace_back(x, j); } sort(mp[i].begin(), mp[i].end()); mp[i].erase(unique(mp[i].begin(), mp[i].end(), [](pair<int, int> &x, pair<int, int> &y) { return x.first == y.first; }), mp[i].end()); res[i] = mp[i][0].second; if (mp[i].size() == 1) { flag[i] = 1; tmp ^= mp[i][0].first; } else { if (flagt == 0) flagt = i; else { tmp ^= mp[i][0].first, flag[i] = 1; } } } for (int i = 0; i < mp[flagt].size(); ++i) { if ((tmp ^ mp[flagt][i].first) != 0) { res[flagt] = mp[flagt][i].second; tmp ^= mp[flagt][i].first; flagt = -1; break; } } if (flagt == -1 || (flagt == 0 && tmp)) { puts( TAK ); for (int i = 1; i <= n; ++i) { printf( %d , res[i]); } } else { puts( NIE ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 1, -1, 0}; int dy[] = {1, 0, 0, -1}; long double PI = 3.14159265358979323846264338327950; pair<int, int> p[12000002]; int a[12000002], b[12000002]; int m, n, k; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> k; for (int i = 1, x; i <= n; i++) { cin >> x; a[x]++; if (a[x] > k) { cout << -1; return 0; } } for (int i = 1, x; i <= m; i++) { cin >> x; p[i] = {x, i}; } sort(p + 1, p + 1 + m); int ch = 0; int res = 0; for (int i = 1; i <= m; i++) { for (; a[ch] == k; ch++) ; if (ch > p[i].first) continue; else { res++; b[res] = p[i].second, a[ch]++; } } cout << res << n ; for (int i = 1; i <= res; i++) cout << b[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[111]; int id[111][111]; int vis[111]; int main() { int n, m, k, q; while (cin >> n >> k) { m = n / k; for (int i = 0; i < n; i++) { cin >> a[i]; vis[i] = 0; } scanf( %d , &q); double minv = 1 << 30, maxv = -1 << 30; for (int i = 0; i < q; i++) { int sum = 0; for (int j = 0; j < m; j++) { cin >> id[i][j]; vis[id[i][j] - 1] = 1; sum += a[id[i][j] - 1]; } if (double(sum) / m < minv) { minv = double(sum) / m; } if (double(sum) / m > maxv) { maxv = double(sum) / m; } } vector<int> v; for (int i = 0; i < n; i++) { if (!vis[i]) { v.push_back(a[i]); } } sort(v.begin(), v.end()); if (v.size() >= m && (n - v.size()) < k * m) { int sum = 0; for (int i = 0; i < m; i++) { sum += v[i]; } if (double(sum) / m < minv) { minv = double(sum) / m; } if (double(sum) / m > maxv) { maxv = double(sum) / m; } reverse(v.begin(), v.end()); sum = 0; for (int i = 0; i < m; i++) { sum += v[i]; } if (double(sum) / m < minv) { minv = double(sum) / m; } if (double(sum) / m > maxv) { maxv = double(sum) / m; } } printf( %.9lf %.9lf n , minv, maxv); } } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > vec1(312345), vec2(312346); int g[123456], p[123456], t[123456]; int cons; int h, w; int computeup(int i) { int val1, val; vector<int>::iterator it; val1 = t[i] - p[i] + cons; it = upper_bound(vec1[val1].begin(), vec1[val1].end(), p[i]); val = vec2[val1].size(); int siz = vec1[val1].end() - it; it--; if (val <= siz) { it += val; cout << *it << << h << endl; } else { cout << w << << vec2[val1][siz] << endl; } return 0; } int computehor(int i) { int val1, val; vector<int>::iterator it; val1 = t[i] - p[i] + cons; it = upper_bound(vec2[val1].begin(), vec2[val1].end(), p[i]); val = vec1[val1].size(); int siz = vec2[val1].end() - it; it--; if (val <= siz) { it += val; cout << w << << *it << endl; } else { cout << vec1[val1][siz] << << h << endl; } return 0; } int main() { std::ios::sync_with_stdio(false); int n; cin >> n >> w >> h; cons = 100010; int i; for (i = 0; i < n; i++) { cin >> g[i] >> p[i] >> t[i]; if (g[i] == 1) vec1[t[i] - p[i] + cons].push_back(p[i]); else vec2[t[i] - p[i] + cons].push_back(p[i]); } for (i = 0; i < 212345; i++) { sort(vec1[i].begin(), vec1[i].end()); sort(vec2[i].begin(), vec2[i].end()); } for (i = 0; i < n; i++) { if (g[i] == 1) computeup(i); else computehor(i); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool check(long long int mid, long long int r, vector<long long int>& a) { long long int d = 0; long long int cnt = 0; for (long long int i = a.size() - 1; i >= 0; i--) { if (a[i] - d <= 0) continue; else { if (cnt < mid) { d += r; cnt++; } else return false; } } return true; } void solve() { long long int n, r; cin >> n >> r; vector<long long int> a(n); for (long long int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); long long int tl = -1, tr = 1e9; while (tr - tl > 1) { long long int mid = (tl + tr) / 2; if (check(mid, r, a)) tr = mid; else tl = mid; } cout << tr << n ; } signed main() { long long int t; cin >> t; for (long long int i = 0; i < t; i++) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> a[10], b[10]; vector<int> p; bool square(int i, int j) { double len = sqrt((a[j].first - a[i].first) * (a[j].first - a[i].first) + (a[j].second - a[i].second) * (a[j].second - a[i].second)); for (int t = i + 1; t <= j; t++) { double tmp = sqrt((a[t].first - a[t - 1].first) * (a[t].first - a[t - 1].first) + (a[t].second - a[t - 1].second) * (a[t].second - a[t - 1].second)); if (abs(len - tmp) > 0.000000001) return 0; } if (len * len > 0.000000001) { int x1 = a[i + 3].first - a[i].first, x2 = a[i + 1].first - a[i].first; int y1 = a[i + 3].second - a[i].second, y2 = a[i + 1].second - a[i].second; if (x1 * x2 + y1 * y2 == 0) return 1; else return 0; } } bool rect(int i, int j) { double len1 = sqrt((a[i].first - a[i + 1].first) * (a[i].first - a[i + 1].first) + (a[i].second - a[i + 1].second) * (a[i].second - a[i + 1].second)); double len2 = sqrt((a[i + 2].first - a[i + 1].first) * (a[i + 2].first - a[i + 1].first) + (a[i + 2].second - a[i + 1].second) * (a[i + 2].second - a[i + 1].second)); double len3 = sqrt((a[i + 2].first - a[i + 3].first) * (a[i + 2].first - a[i + 3].first) + (a[i + 2].second - a[i + 3].second) * (a[i + 2].second - a[i + 3].second)); double len4 = sqrt((a[i + 3].first - a[i].first) * (a[i + 3].first - a[i].first) + (a[i + 3].second - a[i].second) * (a[i + 3].second - a[i].second)); if (abs(len1 - len3) > 0.000000001 || abs(len2 - len4) > 0.000000001) return 0; else { int x1 = a[i + 3].first - a[i].first, x2 = a[i + 1].first - a[i].first; int y1 = a[i + 3].second - a[i].second, y2 = a[i + 1].second - a[i].second; if (x1 * x2 + y1 * y2 == 0) return 1; else return 0; } } bool check() { if (!square(0, 3)) return 0; if (!rect(4, 7)) return 0; return 1; } int main() { for (int i = 0; i < 8; i++) { cin >> a[i].first >> a[i].second; b[i] = a[i]; p.push_back(i); } while (true) { if (check()) { cout << YES n ; for (int i = 0; i <= 3; i++) cout << p[i] + 1 << ; cout << endl; for (int i = 4; i <= 7; i++) cout << p[i] + 1 << ; return 0; } if (!next_permutation(p.begin(), p.end())) break; for (int i = 0; i <= 7; i++) a[i] = b[p[i]]; } cout << NO ; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long n, k; long long p[200005]; long long md = 998244353; long long binpow(long long a, long long b) { if (b == 1) { return a % md; } long long z = binpow(a, b / 2); if (b & 1) { return z * z % md * a % md; } return z * z % md; } long long C(long long n, long long m) { return p[n] * binpow(p[m] * p[n - m] % md, md - 2) % md; } int main() { p[0] = 1; for (long long i = 1; i <= 200000; i++) { p[i] = p[i - 1] * i % md; } cin >> n >> k; if (k >= n) { cout << 0; return 0; } long long c = n - k; long long ans = 0; long long x = 1; for (long long i = c; i >= 0; i--) { if (x == -1) { ans = (ans + md - C(c, i) * binpow(i, n) % md) % md; x = 1; } else { ans = (ans + C(c, i) * binpow(i, n) % md) % md; x = -1; } } ans = ans * C(n, c) % md; if (k > 0) ans = ans * 2 % md; cout << ans; } |
#include <bits/stdc++.h> using namespace std; int T; int a, b; int x[6], y[6]; bool check30(int a, int b) { a -= 75; x[1] = x[2] = x[3] = 25; y[1] = y[2] = y[3] = 0; if (a < 0) return 0; if (a > 0) { x[1] += a; y[1] = 23 + a; b -= 23 + a; } if (b < 0) return 0; for (int i = 1; i <= 3; i++) { if (y[i] != 0) continue; if (b < 24) { y[i] = b; b = 0; } else { y[i] = 23; b -= 23; } } if (b > 0) return 0; printf( 3:0 n ); for (int i = 1; i <= 3; i++) { printf( %d:%d , x[i], y[i]); if (i != 3) printf( ); else printf( n ); } return 1; } bool check31(int a, int b) { a -= 75; b -= 25; y[1] = x[2] = x[3] = x[4] = 25; if (a < 0 || b < 0) return 0; if (a < 24) { x[1] = a; a = 0; } else { x[1] = 23; a -= 23; } if (a > b) return 0; if (a) { b -= a; x[1] += a; y[1] += a; a = 0; } for (int i = 2; i <= 4; i++) if (b < 24) { y[i] = b; b = 0; } else { y[i] = 23; b -= 23; } if (b) { if (y[1] > 25) { int t = y[1] - 25; y[1] -= t; x[1] -= t; y[2] += t; x[2] += t; } if (b > x[1]) return 0; x[1] -= b; x[2] += b; y[2] += b; b = 0; } printf( 3:1 n ); for (int i = 1; i <= 4; i++) { printf( %d:%d , x[i], y[i]); if (i != 4) printf( ); else printf( n ); } return 1; } bool check32(int a, int b) { a -= 65; b -= 50; y[1] = y[2] = x[3] = x[4] = 25; x[5] = 15; if (a < 0 || b < 0) return 0; for (int i = 1; i <= 2; i++) if (a < 24) { x[i] = a; a = 0; } else { x[i] = 23; a -= 23; } for (int i = 3; i <= 4; i++) if (b < 24) { y[i] = b; b = 0; } else { y[i] = 23; b -= 23; } if (b < 14) { y[5] = b; b = 0; } else { y[5] = 13; b -= 13; } if (a > b) { x[1] += b; y[1] += b; a -= b; b = 0; for (int i = 3; i <= 5; i++) { if (y[i] > a) { y[i] -= a; x[1] += a; y[1] += a; a = 0; } else { x[1] += y[i]; y[1] += y[i]; a -= y[i]; y[i] = 0; } } if (a > 0) return 0; } else if (a < b) { x[5] += a; y[5] += a; b -= a; a = 0; for (int i = 1; i <= 2; i++) { if (x[i] > b) { x[i] -= b; x[5] += b; y[5] += b; b = 0; } else { x[5] += x[i]; y[5] += x[i]; b -= x[i]; x[i] = 0; } } if (b > 0) return 0; } printf( 3:2 n ); for (int i = 1; i <= 5; i++) { printf( %d:%d , x[i], y[i]); if (i != 5) printf( ); else printf( n ); } return 1; } bool check23(int a, int b) { swap(a, b); a -= 65; b -= 50; y[1] = y[2] = x[3] = x[4] = 25; x[5] = 15; if (a < 0 || b < 0) return 0; for (int i = 1; i <= 2; i++) if (a < 24) { x[i] = a; a = 0; } else { x[i] = 23; a -= 23; } for (int i = 3; i <= 4; i++) if (b < 24) { y[i] = b; b = 0; } else { y[i] = 23; b -= 23; } if (b < 14) { y[5] = b; b = 0; } else { y[5] = 13; b -= 13; } if (a > b) { x[1] += b; y[1] += b; a -= b; b = 0; for (int i = 3; i <= 5; i++) { if (y[i] > a) { y[i] -= a; x[1] += a; y[1] += a; a = 0; } else { x[1] += y[i]; y[1] += y[i]; a -= y[i]; y[i] = 0; } } if (a > 0) return 0; } else if (a < b) { x[5] += a; y[5] += a; b -= a; a = 0; for (int i = 1; i <= 2; i++) { if (x[i] > b) { x[i] -= b; x[5] += b; y[5] += b; b = 0; } else { x[5] += x[i]; y[5] += x[i]; b -= x[i]; x[i] = 0; } } if (b > 0) return 0; } printf( 2:3 n ); for (int i = 1; i <= 5; i++) { printf( %d:%d , y[i], x[i]); if (i != 5) printf( ); else printf( n ); } return 1; } bool check13(int a, int b) { swap(a, b); a -= 75; b -= 25; y[1] = x[2] = x[3] = x[4] = 25; if (a < 0 || b < 0) return 0; if (a < 24) { x[1] = a; a = 0; } else { x[1] = 23; a -= 23; } if (a > b) return 0; if (a) { b -= a; x[1] += a; y[1] += a; a = 0; } for (int i = 2; i <= 4; i++) if (b < 24) { y[i] = b; b = 0; } else { y[i] = 23; b -= 23; } if (b) { if (y[1] > 25) { int t = y[1] - 25; y[1] -= t; x[1] -= t; y[2] += t; x[2] += t; } if (b > x[1]) return 0; x[1] -= b; x[2] += b; y[2] += b; b = 0; } printf( 1:3 n ); for (int i = 1; i <= 4; i++) { printf( %d:%d , y[i], x[i]); if (i != 4) printf( ); else printf( n ); } return 1; } bool check03(int a, int b) { swap(a, b); a -= 75; x[1] = x[2] = x[3] = 25; y[1] = y[2] = y[3] = 0; if (a < 0) return 0; if (a > 0) { x[1] += a; y[1] = 23 + a; b -= 23 + a; } if (b < 0) return 0; for (int i = 1; i <= 3; i++) { if (y[i] != 0) continue; if (b < 24) { y[i] = b; b = 0; } else { y[i] = 23; b -= 23; } } if (b > 0) return 0; printf( 0:3 n ); for (int i = 1; i <= 3; i++) { printf( %d:%d , y[i], x[i]); if (i != 3) printf( ); else printf( n ); } return 1; } int main() { scanf( %d , &T); while (T--) { scanf( %d%d , &a, &b); if (check30(a, b)) continue; if (check31(a, b)) continue; if (check32(a, b)) continue; if (check23(a, b)) continue; if (check13(a, b)) continue; if (check03(a, b)) continue; printf( Impossible n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char a, b; int A, B; cin >> a >> A; cin >> b >> B; int chess[9][9] = {0}; for (int i = 1; i < 9; i++) { chess[i][A] = 1; } for (int i = 1; i < 9; i++) { chess[a - 96][i] = 1; } if (b - 98 > 0) { if (B - 1 > 0) { chess[b - 98][B - 1] = 1; } if (B + 1 < 9) { chess[b - 98][B + 1] = 1; } } if (b - 94 < 9) { if (B - 1 > 0) { chess[b - 94][B - 1] = 1; } if (B + 1 < 9) { chess[b - 94][B + 1] = 1; } } if (B - 2 > 0) { if (b - 97 > 0) { chess[b - 97][B - 2] = 1; } if (b - 95 < 9) { chess[b - 95][B - 2] = 1; } } if (B + 2 < 9) { if (b - 97 > 0) { chess[b - 97][B + 2] = 1; } if (b - 95 < 9) { chess[b - 95][B + 2] = 1; } } if (a - 97 > 0) { if (A + 2 < 9) { chess[a - 97][A + 2] = 1; } if (A - 2 > 0) { chess[a - 97][A - 2] = 1; } } if (a - 95 < 9) { if (A + 2 < 9) { chess[a - 95][A + 2] = 1; } if (A - 2 > 0) { chess[a - 95][A - 2] = 1; } } if (A - 1 > 0) { if (a - 94 < 9) { chess[a - 94][A - 1] = 1; } if (a - 98 > 0) { chess[a - 98][A - 1] = 1; } } if (A + 1 < 9) { if (a - 94 < 9) { chess[a - 94][A + 1] = 1; } if (a - 98 > 0) { chess[a - 98][A + 1] = 1; } } chess[b - 96][B] = 1; int w = 0; for (int i = 1; i < 9; i++) { for (int j = 1; j < 9; j++) { if (chess[i][j] == 0) { w++; } } } cout << w; return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[2][4004]; struct node { int st; int cost; } save[4004]; int n, k; void checkmin(int &a, int b) { if (a == -1 || a > b) a = b; } int main() { int i, j; int ans; while (~scanf( %d%d , &n, &k)) { memset(dp, -1, sizeof(dp)); for (i = 1; i <= n; i++) { scanf( %d%d , &save[i].st, &save[i].cost); save[i].cost; } dp[0][0] = 1; save[i].st = 86400 + 1; ans = save[1].st - 1; for (i = 1; i <= n; i++) for (j = 0; j <= k && j <= i; j++) { if (j == 0) { if (dp[(i - 1) & 1][0] != -1) { if (save[i].st > dp[(i - 1) & 1][0]) dp[i & 1][0] = save[i].st + save[i].cost; else dp[i & 1][0] = dp[(i - 1) & 1][0] + save[i].cost; } if (dp[i & 1][0] != -1) ans = max(ans, save[i + 1].st - dp[i & 1][0]); } else { if (dp[(i - 1) & 1][j - 1] != -1) dp[i & 1][j] = dp[(i - 1) & 1][j - 1]; if (dp[(i - 1) & 1][j] != -1) { if (save[i].st > dp[(i - 1) & 1][j]) checkmin(dp[i & 1][j], save[i].st + save[i].cost); else checkmin(dp[i & 1][j], dp[(i - 1) & 1][j] + save[i].cost); } if (dp[i & 1][j] != -1) ans = max(ans, save[i + 1].st - dp[i & 1][j]); } } printf( %d n , ans); } } |
#include <bits/stdc++.h> using namespace std; int n, m; char** mat; short ***sparse, ***rem; void build() { sparse = new short**[n + 1]; rem = new short**[n + 1]; for (int i = 0; i <= n; ++i) { sparse[i] = new short*[m + 1]; rem[i] = new short*[m + 1]; } for (int i = 0; i <= n; ++i) { for (int j = 0; j <= m; ++j) { sparse[i][j] = new short[4]; memset(sparse[i][j], 0, sizeof(short) * 4); rem[i][j] = new short[4]; memset(rem[i][j], 0, sizeof(short) * 4); } } for (int i = 1; i <= n; ++i) { int prev = 0; for (int j = 1; j <= m; ++j) { if (mat[i][j]) { sparse[i][j][0] = prev; prev = j; } } prev = 0; for (int j = m; j > 0; --j) { if (mat[i][j]) { sparse[i][j][1] = prev; prev = j; } } } for (int j = 1; j <= m; ++j) { int prev = 0; for (int i = 1; i <= n; ++i) { if (mat[i][j]) { sparse[i][j][2] = prev; prev = i; } } prev = 0; for (int i = n; i > 0; --i) { if (mat[i][j]) { sparse[i][j][3] = prev; prev = i; } } } } void remove(int p, int q) { int prox, prev; prox = sparse[p][q][0]; prev = sparse[p][q][1]; if (prev) sparse[p][prev][0] = prox; if (prox) sparse[p][prox][1] = prev; rem[p][q][0] = prox; prox = sparse[p][q][1]; prev = sparse[p][q][0]; if (prev) sparse[p][prev][1] = prox; if (prox) sparse[p][prox][0] = prev; rem[p][q][1] = prox; prox = sparse[p][q][2]; prev = sparse[p][q][3]; if (prev) sparse[prev][q][2] = prox; if (prox) sparse[prox][q][3] = prev; rem[p][q][2] = prox; prox = sparse[p][q][3]; prev = sparse[p][q][2]; if (prev) sparse[prev][q][3] = prox; if (prox) sparse[prox][q][2] = prev; rem[p][q][3] = prox; } void insert(int p, int q) { int x; x = rem[p][q][0]; if (x) sparse[p][x][1] = q; x = rem[p][q][1]; if (x) sparse[p][x][0] = q; x = rem[p][q][2]; if (x) sparse[x][q][3] = p; x = rem[p][q][3]; if (x) sparse[x][q][2] = p; for (int i = 0; i < 4; ++i) rem[p][q][i] = 0; } int solve(int p, int q) { int tot = 0; stack<pair<int, int> > s; while (p and q) { int prox, prev; if (mat[p][q] == L ) { prox = sparse[p][q][0]; if (p and q) remove(p, q); if (p and q) s.push(make_pair(p, q)); q = prox; } else if (mat[p][q] == R ) { prox = sparse[p][q][1]; if (p and q) remove(p, q); if (p and q) s.push(make_pair(p, q)); q = prox; } else if (mat[p][q] == U ) { prox = sparse[p][q][2]; if (p and q) remove(p, q); if (p and q) s.push(make_pair(p, q)); p = prox; } else { prox = sparse[p][q][3]; if (p and q) remove(p, q); if (p and q) s.push(make_pair(p, q)); p = prox; } tot++; } while (s.size()) { pair<int, int> p = s.top(); s.pop(); insert(p.first, p.second); } return tot; } int main(int argc, char* argv[]) { cin >> n >> m; mat = new char*[n + 1]; for (int i = 0; i <= n; ++i) mat[i] = new char[m + 1]; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> mat[i][j]; if (mat[i][j] == . ) mat[i][j] = 0; } } build(); int ans = 0, freq = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { int x = mat[i][j] ? solve(i, j) : 0; if (x > ans) { ans = x; freq = 1; } else if (x == ans) freq++; } } cout << ans << << freq << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int oriArr[2000001] = {0}; int arr[2000001]; int main() { int oriCnt; cin >> oriCnt; int maxOri = 0; for (int i = 0; i < oriCnt; i++) { int tmp; cin >> tmp; oriArr[tmp] = 1; if (maxOri < tmp) maxOri = tmp; } arr[0] = 0; int cnt = 0; for (int i = 1; i <= maxOri; i++) { if (oriArr[i] == 0) { arr[i] = arr[i - 1]; } else { arr[i] = i; cnt++; } } if (cnt == 1) { cout << 0 << endl; return 0; } int max = 0; for (int i = maxOri - 1; i >= 0; i--) { if (arr[i] < max) break; if (oriArr[i] == 0) continue; for (int j = 2; arr[i] * (j - 1) <= maxOri; j++) { int tmp = j * arr[i] - 1; if (tmp > maxOri) tmp = maxOri; if (arr[tmp] % arr[i] > max) max = arr[tmp] % arr[i]; } } cout << max << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 1 << 23; char s[55][55]; int p[55], r[55], d[55], h[55], ans = 0; int f[maxn], g[maxn], bit[maxn]; int ff(int x) { if (p[x] != x) p[x] = ff(p[x]); return p[x]; } void funion(int x, int y) { x = ff(x); y = ff(y); if (x != y) p[y] = x; } int main() { int n, m, i, j; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %s , s[i]); for (i = 0; i < n; i++) p[i] = i; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (i == j) continue; if (s[i][j] == A ) funion(i, j); } } for (i = 0; i < n; i++) d[ff(i)]++; memset(h, -1, sizeof(h)); for (i = m = 0; i < n; i++) { if (d[i] > 1) h[i] = m++; } for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (i == j) continue; if (s[i][j] == X ) { if (ff(i) == ff(j)) { return puts( -1 ), 0; } if (d[ff(i)] > 1 && d[ff(j)] > 1) { r[h[ff(i)]] |= 1 << h[ff(j)]; r[h[ff(j)]] |= 1 << h[ff(i)]; } } } } if (!m) { printf( %d n , n - 1); return 0; } for (i = 0; i < m; i++) r[i] ^= (1 << m) - 1; for (i = 0; i < (1 << m); i++) { if ((i & (-i)) == i) f[i] = 1; else { j = i ^ (1 << (__builtin_ffs(i) - 1)); if (f[j] && (r[__builtin_ffs(i) - 1] & j) == j) f[i] = 1; } g[i] = 1; bit[i] = (m - __builtin_popcount(i)) & 1; } for (i = 0; i < m; i++) { for (j = 0; j < (1 << m); j++) { if ((j >> i) & 1) f[j] += f[j ^ (1 << i)]; } } for (i = 0; i < m; i++) { for (j = 0; j < (1 << m); j++) g[j] *= f[j]; int x = 0; for (j = 0; j < (1 << m); j++) { if (bit[j]) x -= g[j]; else x += g[j]; } if (x) break; } printf( %d n , n + i); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; long long ans, res; int L[N], R[N]; int n, a[N]; long long dp[40][2]; void solve(int d, int l, int r) { if (l >= r) return; if (d == -1) return; int nl = 0, nr = 0; long long tmp1 = 0, tmp2 = 0; ; for (int i = l; i <= r; i++) { if (a[i] >> d & 1) L[++nl] = a[i], tmp1 += nr; else R[++nr] = a[i], tmp2 += nl; } dp[d][1] += tmp1; dp[d][0] += tmp2; int x = 1, y = 1; for (int i = l; i <= r; i++) { if (x <= nl) a[i] = L[x++]; else a[i] = R[y++]; } solve(d - 1, l, l + nl - 1); solve(d - 1, l + nl, r); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); solve(30, 1, n); for (int i = 0; i <= 30; i++) { if (dp[i][1] < dp[i][0]) ans += dp[i][1], res |= (1 << i); else ans += dp[i][0]; } printf( %lld %lld n , ans, res); } |
#include <bits/stdc++.h> using namespace std; signed main() { std::ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); ; long long CASE = 1; while (CASE--) { long long n; cin >> n; vector<std::pair<long long, long long> > c; for (long long i = 0; i < n; ++i) { long long x, y; cin >> x >> y; c.push_back({x, y}); } double ans = 0; for (long long i = 0; i < n; ++i) { for (long long j = i + 1; j < n; ++j) { double mx = INT_MIN, mn = INT_MAX; for (long long k = 0; k < n; ++k) { if (i == k || j == k) continue; double area = (c[k].first * (c[i].second - c[j].second) + c[i].first * (c[j].second - c[k].second) + c[j].first * (c[k].second - c[i].second)) * 0.5; mx = max(mx, area); mn = min(mn, area); } ans = max(ans, mx - mn); } } cout << setprecision(10) << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string a; cin >> a; string b; cin >> b; string c = a; int flag = 0; int count = 0; vector<int> ans; int s = 1; int e = n; for (int i = n - 1; i >= 0; --i) { char x; if (flag == 0) { x = a[s - 1]; ++s; } else { if (a[e - 1] == 0 ) x = 1 ; else x = 0 ; --e; } if (x != b[i]) { ++count; ans.push_back(i + 1); } else { count += 2; ans.push_back(1); ans.push_back(i + 1); } flag = 1 - flag; } cout << count << ; for (auto it : ans) cout << it << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[310]; long long fac[310], rev[310]; bool mmp[310][310]; long long mod = (long long)1e9 + 7; long long qmod(long long a, long long p) { long long ret = 1; while (p) { if (p & 1) ret = (ret * a) % mod; a = (a * a) % mod; p /= 2; } return ret; } void Init() { fac[0] = 1; for (int i = 1; i < 310; ++i) fac[i] = fac[i - 1] * i; rev[0] = 1; for (int i = 1; i < 310; ++i) rev[i] = qmod(fac[i], mod - 2); } long long C(int n, int m) { return fac[n] * rev[m] % mod * rev[n - m] % mod; } bool isSqure(long long q) { long long sq = (long long)sqrt(q); return sq * sq == q; } void input() { istream& in = cin; in >> n; for (int i = 1; i <= n; ++i) in >> a[i]; } bool vis[310]; int dfs(int p) { if (vis[p]) return 0; vis[p] = 1; int ret = 1; for (int i = 1; i <= n; ++i) { if (mmp[p][i]) { ret += dfs(i); } } return ret; } int num[310]; long long dp[310][310][310]; bool END[310]; void add(long long& a, long long b) { a %= mod; b %= mod; a = (a + b) % mod; } int main() { input(); Init(); for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) { if (isSqure(a[i] * a[j])) { mmp[i][j] = mmp[j][i] = 1; } } vector<int> block; for (int i = 1; i <= n; ++i) { int ret = dfs(i); if (ret) block.push_back(ret); } sort(block.begin(), block.end()); reverse(block.begin(), block.end()); int sum = 0; for (int p : block) { for (int i = 1; i <= p; ++i) num[sum + i] = i; sum += p; END[sum] = 1; } dp[0][0][0] = 1; for (int i = 1; i <= n; ++i) for (int j = 0; j <= n + 1; ++j) for (int k = 0; k <= n + 1; ++k) { long long& ref = dp[i - 1][j][k]; if (dp[i - 1][j][k] == 0) continue; int allslot = i; int prewa = j - k; int nowwa = k; int nookwaslot = (num[i] - 1) * 2 - 2 * nowwa; int okslot = allslot - j - nookwaslot; if (!END[i]) { if (j > 0) add(dp[i][j - 1][k], dp[i - 1][j][k] * prewa); add(dp[i][j + 1][k + 1], dp[i - 1][j][k] * nowwa); add(dp[i][j][k], dp[i - 1][j][k] * okslot); add(dp[i][j + 1][k + 1], dp[i - 1][j][k] * nookwaslot); } else { if (j > 0) add(dp[i][j - 1][0], dp[i - 1][j][k] * prewa); add(dp[i][j + 1][0], dp[i - 1][j][k] * nowwa); add(dp[i][j][0], dp[i - 1][j][k] * okslot); add(dp[i][j + 1][0], dp[i - 1][j][k] * nookwaslot); } } cout << dp[n][0][0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200010; struct par { int x, t; bool operator!=(par k) { return x != k.x || t != k.t; } } p[N], p2[N]; int flag, n, sa[N], ea[N], sb[N], eb[N], _[N], _lans, _rans, key1[N], key2[N]; bool cmp(par x, par y) { int kx = x.t == 1 ? sa[x.x] : ea[x.x]; int ky = y.t == 1 ? sa[y.x] : ea[y.x]; return kx * 2 + (1 ^ x.t) == ky * 2 + (1 ^ y.t) ? x.x < y.x : kx * 2 + (1 ^ x.t) < ky * 2 + (1 ^ y.t); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d%d%d , sa + i, ea + i, sb + i, eb + i); for (int i = 1; i <= n; i++) _[i] = rand(); for (int i = 1; i <= 2 * n; i++) p[i] = (par){(i - 1) / 2 + 1, i & 1}; sort(p + 1, p + 1 + n + n, cmp); _lans = _rans = 0; for (int i = 1; i <= n; i++) _lans ^= _[i]; for (int i = 1; i <= 2 * n; i++) { int x = p[i].x, t = p[i].t; if (t) { _lans ^= _[x]; key1[x] ^= _rans; } else { _rans ^= _[x]; key1[x] ^= _lans; } } memcpy(p2, p, sizeof(p)); for (int i = 1; i <= n; i++) swap(sa[i], sb[i]), swap(ea[i], eb[i]); for (int i = 1; i <= 2 * n; i++) p[i] = (par){(i - 1) / 2 + 1, i & 1}; sort(p + 1, p + 1 + n + n, cmp); _lans = _rans = 0; for (int i = 1; i <= n; i++) _lans ^= _[i]; for (int i = 1; i <= 2 * n; i++) { int x = p[i].x, t = p[i].t; if (t) { _lans ^= _[x]; key2[x] ^= _rans; } else { _rans ^= _[x]; key2[x] ^= _lans; } } for (int i = 1; i <= n; i++) if (key1[i] != key2[i]) flag = 1; puts(flag ? NO : YES ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream &operator<<(ostream &out, pair<T1, T2> a) { out << a.first << << a.second; return out; } template <typename T, typename T1> T amax(T &a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T amin(T &a, T1 b) { if (b < a) a = b; return a; } const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; const int N = 0; void solve() { unordered_map<char, int> m; string s; cin >> s; int n = s.length(); for (int i = 0; i < n; i++) { m[s[i]]++; } int left = 0; for (auto x : m) { if (x.second > 2) { left = left + x.second - 2; } } int j = n - left; cout << j / 2 << endl; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int l, r, a; int main() { cin >> l >> r >> a; if (l > r) swap(l, r); if (l == r) return cout << (l + a / 2) * 2, 0; if (l < r) { if (l + a >= r) { a -= abs(l - r), l = r; cout << l * 2 + (a / 2) * 2; } else cout << (l + a) * 2; } } |
#include <bits/stdc++.h> using namespace std; vector<int> v[2003]; int depth[2003], root[2003]; int ans = 0, n; void dfs(int x, int y) { depth[x] = y; for (int i = 0; i < v[x].size(); i++) { dfs(v[x][i], y + 1); } } int main() { int i, j, a; cin >> n; for (i = 1; i <= n; i++) { cin >> a; if (a == -1) root[i] = 1; else v[a].push_back(i); } for (i = 1; i <= n; i++) { if (root[i]) dfs(i, 1); } for (i = 1; i <= n; i++) { ans = max(ans, depth[i]); } cout << ans; return 0; } |
#include <map> #include <queue> #include <cmath> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> #define itt map<int,int>::iterator #define ll long long #define ull unsigned long long #define dd double using namespace std; const int maxn=5000,N1=maxn+5; const int inf=0x3f3f3f3f,p=998244353; template <typename _T> void read(_T &ret) { ret=0; _T fh=1; char c=getchar(); while(c< 0 ||c> 9 ){ if(c== - ) fh=-1; c=getchar(); } while(c>= 0 &&c<= 9 ){ ret=ret*10+c- 0 ; c=getchar(); } ret=ret*fh; } int T,n,q; int tag[N1]; ll f[2][N1] ,g[N1], s[N1]; int main() { scanf( %d ,&T); while(T--){ scanf( %d ,&n); for(int i=1;i<=n;i++) read(tag[i]);; for(int i=1;i<=n;i++) read(s[i]); for(int i=1;i<=n;i++) f[0][i]=f[1][i]=g[i]=0; int now=1, pst=0; f[pst][1]=0; for(int i=2;i<=n;i++) { for(int j=1;j<i;j++) f[now][j]=f[pst][j], g[j]=0; for(int j=1;j<i;j++) { if(tag[i]==tag[j]) continue; f[now][i]=max(f[now][i],f[pst][j]+abs(s[i]-s[j])); if(j>1) g[j-1]=f[pst][j]+abs(s[i]-s[j]); } for(int j=i-1;j>=1;j--) { g[j]=max(g[j],g[j+1]); if(tag[i]==tag[j]) continue; f[now][j]=max(f[pst][j],g[j]+abs(s[i]-s[j])); } // for(int j=1;j<=i;j++) printf( %d ,f[now][j]); puts( ); swap(now,pst); } ll ans=0; for(int i=1;i<=n;i++) ans=max(ans,f[pst][i]); printf( %lld n ,ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int i, j, a; int main() { for (i = 1; i <= 5; i++) { for (j = 1; j <= 5; j++) { cin >> a; if (a == 1) cout << (abs(3 - i) + abs(3 - j)) << endl; } } } |
#include <bits/stdc++.h> using namespace std; signed long long p[1000005] = {0}; void sieve() { p[0] = 1; p[1] = 1; for (signed long long i = 2; i * i <= 1000000; i++) { if (p[i] == 0) { for (signed long long j = 2 * i; j <= 1000000; j = j + i) p[j] = 1; } } } int main() { signed long long n, m, wt; cin >> n >> m; sieve(); for (signed long long i = n - 1; i <= 1000000; i++) { if (p[i] == 0) { wt = i; break; } } cout << wt << << wt << endl; ; for (signed long long i = 1; i < n - 1; i++) cout << i << << i + 1 << << 1 << endl; cout << n - 1 << << n << << wt - (n - 2) << endl; signed long long cnt = n - 1; for (signed long long i = 1; i <= n; i++) { for (signed long long j = i + 2; j <= n; j++) { if (cnt == m) return 0; cout << i << << j << << wt + 5 << endl; cnt++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long power(long long base, long long e) { long long answer = 1; while (e) { if (e % 2 == 1) { answer *= base; } base *= base; e /= 2; } return answer; } int main() { long long i, n, m, k, j; cin >> n >> m; string s[n]; for (i = 0; i < n; i++) { cin >> s[i]; } long long a[m]; for (i = 0; i < m; i++) { cin >> a[i]; } long long sum = 0; for (i = 0; i < m; i++) { long long f[5] = {0}; for (j = 0; j < n; j++) { f[s[j][i] - A ]++; } long long max = f[0]; for (j = 1; j < 5; j++) { if (max <= f[j]) max = f[j]; } sum += (max * a[i]); } cout << sum; } |
#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { if (n <= 1) { return false; } for (int i = 2; i < n; i++) { if (n % i == 0) { return false; } } return true; } vector<long long int> inisum; long long int binary(long long int target) { long long int end = inisum.size() - 1; long long int start = 0; long long int ans = -1; while (start <= end) { long long int mid = (start + end) / 2; if (inisum[mid] <= target) { start = mid + 1; } else { ans = mid; end = mid - 1; } } return ans; } bool isSum(long long int n) { long long int sum = 0; while (n != 0) { sum += n % 10; n /= 10; } if (sum == 10) { return true; } else { return false; } } int main(void) { long long int t; cin >> t; while (t--) { long long int x1, y1, z1; long long int x2, y2, z2; cin >> x1 >> y1 >> z1; cin >> x2 >> y2 >> z2; long long int count = 0; if (z1 > y2) { count += y2; z1 -= y2; y2 = 0; } else { count += z1; y2 -= z1; z1 = 0; } if (y1 > x2) { y1 -= x2; x2 = 0; } else { x2 -= y1; y1 = 0; } if (y1 > y2) { y1 -= y2; y2 = 0; } else { y2 -= y1; y1 = 0; } if (z1 > x2) { z1 -= x2; x2 = 0; } else { x2 -= z1; z1 = 0; } if (z1 > y2) { z1 -= y2; y2 = 0; } else { y2 -= z1; z1 = 0; } count -= min(y1, z2); cout << count * 2 << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int a, b; int c[4]; int minC = INT_MAX; for (int i = 0; i < 4; i++) { cin >> c[i]; if (minC > c[i]) minC = c[i]; } cin >> a >> b; int minXX = min(minC, b); int ans = minXX - a; bool baal = 0; if (minXX != minC) baal = 1; if (ans < 0) cout << 0 << endl; else if (a == b && minC > a) cout << 1 << endl; else if (baal == 1) cout << ans + 1 << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; string s[1111]; int c[1111]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; int ans = 0; for (int j = 0; j < m; j++) { bool ret = false; for (int i = 0; i < n - 1; i++) if (s[i][j] > s[i + 1][j] && c[i] == 0) ret = true; if (ret) ans++; else { for (int i = 0; i < n - 1; i++) if (s[i][j] < s[i + 1][j]) c[i] = 1; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; vector<pair<int, int> > dp(101); int cntr[101] = {0}; int getIndexes(int &a, int &b, int &c, int &i, int &m, int x, int &xc, int &k) { int res1 = 0; int res2 = 0; int f1 = 0, f2 = 0, j; if (cntr[x] == 0) { for (j = xc - m / 2; j <= xc + m / 2 + m % 2 - 1; j++) res1 = res1 + (j > xc ? j - xc : xc - j) + i; a = x; b = dp[x].first = xc - m / 2; c = dp[x].second = xc + m / 2 + m % 2 - 1; return res1; } else { if (dp[x].first <= m) { f1 = 1; res1 = (1000 * 1000 * 1000 + 5); } else { for (j = dp[x].first - 1; j >= dp[x].first - m && j >= 1; j--) res1 = res1 + (j > xc ? j - xc : xc - j) + i; } if (k - dp[x].second < m) { f2 = 1; res2 = (1000 * 1000 * 1000 + 5); } else { for (j = dp[x].second + 1; j <= dp[x].second + m && j <= k; j++) res2 = res2 + (j > xc ? j - xc : xc - j) + i; } if (f1 == 1 && f2 == 1) return (1000 * 1000 * 1000 + 5); if (res1 <= res2) { a = x; b = dp[x].first - m; c = dp[x].first - 1; return res1; } else { a = x; b = dp[x].second + 1; c = dp[x].second + m; return res2; } } } int main() { int n, k; cin >> n >> k; int xc = k / 2 + 1; int yc = xc; cntr[xc] = 0; while (n--) { int m, i; cin >> m; if (m > k) { cout << -1 << endl; } else { int x, yl, yr; int mfv = (1000 * 1000 * 1000 + 5); for (i = 0; i < xc; i++) { int a, b, c; int mfu = (1000 * 1000 * 1000 + 5); int mfd = (1000 * 1000 * 1000 + 5); mfu = getIndexes(a, b, c, i, m, xc - i, xc, k); if (mfv >= mfu) { mfv = mfu; x = a; yl = b; yr = c; } mfd = getIndexes(a, b, c, i, m, xc + i, xc, k); if (mfv > mfd) { mfv = mfd; x = a; yl = b; yr = c; } if (cntr[xc - i] == 0 || cntr[xc + i] == 0) break; } if (mfv < (1000 * 1000 * 1000 + 5)) { if (dp[x].first > yl || dp[x].first == 0) dp[x].first = yl; if (dp[x].second < yr || dp[x].second == 0) dp[x].second = yr; if (cntr[x] != 1) cntr[x] = 1; cout << x << << yl << << yr << endl; } else cout << -1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; string s; cin >> n >> s; int ans = 100; for (int i = 0; i < n; i++) { if (s[i] == > ) { ans = min(ans, i); break; } } for (int i = n - 1; i >= 0; i--) { if (s[i] == < ) { ans = min(ans, n - i - 1); break; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e4 + 7, M = 2e2 + 7; bool fl[N]; int n, k, tot, fs[N], sum[N], pos[M], f[M][N]; map<int, bool> s[N]; struct edge { int u, v; } ed[N * M]; struct node { int ch[M], num; } qt[N]; inline int read() { int num = 0; char g = getchar(); while (g < 48 || 57 < g) g = getchar(); while (47 < g && g < 58) num = (num << 1) + (num << 3) + g - 48, g = getchar(); return num; } inline int find(int u) { if (fs[u] == u) return u; return fs[u] = find(fs[u]); } inline bool equals(node a, node b) { for (int i = 1; i <= k; i++) if (a.ch[i] + 1 != b.ch[i]) return false; return true; } inline bool cmp(node a, node b) { for (int i = 1; i <= k; i++) { if (a.ch[i] < b.ch[i]) return false; if (a.ch[i] > b.ch[i]) return true; } return false; } int main() { n = read(), k = read(); for (int i = 1; i <= k; i++) for (int x = 1; x <= n; x++) f[i][x] = read(); for (int i = 1; i <= k; i++) for (int x = 1; x <= n; x++) if (!f[i][x]) pos[i] = x; for (int i = 2; i <= k; i++) { memset(sum, 0, sizeof(sum)); for (int c = 1; c <= n; c++) if (f[i][c] + f[1][c] == f[1][pos[i]]) sum[f[1][c]] = c; for (int c = 0; c <= f[1][pos[i]]; c++) if (!sum[c]) { puts( -1 ); return 0; } for (int c = 0; c < f[1][pos[i]]; c++) if (!s[sum[c]][sum[c + 1]]) s[sum[c]][sum[c + 1]] = s[sum[c + 1]][sum[c]] = 1, ed[++tot].u = sum[c], ed[tot].v = sum[c + 1]; } for (int i = 1; i <= n; i++) fs[i] = i; for (int i = 1; i <= tot; i++) { int a = ed[i].u, b = ed[i].v; fl[a] = fl[b] = 1, fs[a] = find(a), fs[b] = find(b); if (fs[a] == fs[b]) { puts( -1 ); return 0; } fs[fs[a]] = find(b); } int tp = 1; for (int x = 1; x <= n; x++) { qt[x].num = x; for (int i = 1; i <= k; i++) qt[x].ch[i] = f[i][x]; } for (int i = 1; i <= k; i++) fl[pos[i]] = 1; sort(qt + 1, qt + n + 1, cmp); for (int i = 1; i <= n; i++) { int c = qt[i].num; if (fl[c]) continue; while ((!equals(qt[tp], qt[i])) && tp <= n) tp++; if (tp > n) { puts( -1 ); return 0; } tot++, ed[tot].u = c, ed[tot].v = qt[tp].num; } for (int i = 1; i <= tot; i++) printf( %d %d n , ed[i].u, ed[i].v); return 0; } |
#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << H; debug_out(T...); } const int INF = 1e9; const long long MOD = 1e9 + 7; const int N = 1e5 + 5, MO = 320, SQ = 600; int n, q, A[N], QL[N], QR[N], P[N], T[N], C[N], K[N], Q[N]; vector<int> B, X, Y; bool CMP(int i, int j) { if (QL[i] / MO != QL[j] / MO) return QL[i] < QL[j]; return (QL[i] / MO) % 2 ? QR[i] < QR[j] : QR[i] > QR[j]; } void Update(int x, int y) { T[C[x]]--, C[x] += y, T[C[x]]++; } void Insert(int x, int y) { if (x >= SQ && !K[x]) Y.push_back(x); K[x] += y; } int Huf() { X.clear(), Y.clear(); for (int i : B) if (C[i] >= SQ) X.push_back(C[i]), K[C[i]]++; sort(X.begin(), X.end()); int huf = 0, c = 0, x = 0, y = 0; for (int i = 1; i < SQ; i++) if (K[i] + T[i]) { K[i] += T[i]; if (c) huf += i + c, K[i]--, Insert(i + c, 1), c = 0; if (K[i] & 1) c = i, K[i]--; if (K[i]) huf += i * K[i], Insert(i + i, K[i] >> 1), K[i] = 0; } while (x < (int)(X.size()) || y < (int)(Y.size())) { while (x + 1 < (int)(X.size()) && X[x + 1] == X[x]) x++; while (y + 1 < (int)(Y.size()) && Y[y + 1] == Y[y]) y++; int i = 0; if (x == (int)(X.size())) i = Y[y++]; else if (y == (int)(Y.size())) i = X[x++]; else if (X[x] < Y[y]) i = X[x++]; else i = Y[y++]; if (c) huf += i + c, K[i]--, Insert(i + c, 1), c = 0; if (K[i] & 1) c = i, K[i]--; if (K[i]) huf += i * K[i], Insert(i + i, K[i] >> 1), K[i] = 0; } return huf; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); mt19937 Rnd(time(0)); cin >> n; for (int i = 0; i < n; i++) cin >> A[i], C[A[i]]++; for (int i = 0; i < N; i++) if (C[i] >= SQ) B.push_back(i); for (int i = 0; i < n; i++) C[A[i]]--; cin >> q; for (int i = 0; i < q; i++) cin >> QL[i] >> QR[i], QL[i]--, P[i] = i; sort(P, P + q, CMP); int L = 0, R = 0; for (int i = 0; i < q; i++) { int l = QL[P[i]], r = QR[P[i]]; while (l < L) Update(A[--L], +1); while (R < r) Update(A[R++], +1); while (L < l) Update(A[L++], -1); while (r < R) Update(A[--R], -1); Q[P[i]] = Huf(); } for (int i = 0; i < q; i++) cout << Q[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int prime = 9241; const long double pi = acos(-1.); int in[100005]; int masks[1000005]; bool used[1 << 22]; int main() { int n, m, d; scanf( %d%d%d , &n, &m, &d); for (int i = 0; i < m; i++) { int s; scanf( %d , &s); for (int j = 0; j < s; j++) { int a; scanf( %d , &a); a--; in[a] = i; } } int cur[25] = {}; for (int i = 0; i < m; i++) cur[i] = 0; for (int i = 0; i < d; i++) cur[in[i]]++; int mcnt = 0; masks[0] = 0; for (int i = 0; i < m; i++) if (cur[i] > 0) masks[0] |= 1 << i; mcnt++; for (int i = d; i < n; i++) { cur[in[i - d]]--; cur[in[i]]++; masks[mcnt] = 0; for (int j = 0; j < m; j++) if (cur[j] > 0) masks[mcnt] |= 1 << j; mcnt++; } queue<int> q; for (int i = 0; i < (1 << m); i++) used[i] = 0; for (int i = 0; i < mcnt; i++) { q.push(masks[i]); used[masks[i]] = 1; } while (!q.empty()) { int cur = q.front(); q.pop(); for (int i = 0; i < m; i++) { if (cur & (1 << i)) continue; int nw = cur | (1 << i); if (!used[nw]) { used[nw] = 1; q.push(nw); } } } int ans = 1000; for (int i = 0; i < (1 << m); i++) if (!used[i]) ans = min(ans, m - __builtin_popcount(i)); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int len = s.size(); int cnt = 0; for (int i = 0; i < len; i++) { if (s[i] == a || s[i] == e || s[i] == i || s[i] == o || s[i] == u ) cnt++; if (s[i] == 1 || s[i] == 3 || s[i] == 5 || s[i] == 7 || s[i] == 9 ) cnt++; } cout << cnt << endl; } |
#include <bits/stdc++.h> using namespace std; long long Labs(long long first) { return first < 0 ? -first : first; } int main() { long long n, d; cin >> n >> d; long long a[n]; for (int i = (0); i < (int)(n); i++) cin >> a[i]; long long ans = 0; for (int i = (0); i < (int)(n); i++) for (int j = (0); j < (int)(n); j++) if (i != j && Labs(a[i] - a[j]) <= d) { ++ans; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long double inf = 1e18 + 7; const long double eps = 1e-18; long long gcd(long long a, long long b) { while (a || b) a %= b, swap(a, b); return a + b; } int main() { ios_base::sync_with_stdio(0); long long t; cin >> t; for (long long tt = 0; tt < t; ++tt) { long long x, y, p, q; cin >> x >> y >> p >> q; long long ok = y - x; long long wa = y - ok; long long nok = q - p; long long nwa = q - nok; if (nok == nwa) { cout << abs(ok - wa) << endl; continue; } if (nok == 0) { if (ok != 0) { cout << -1 << endl; continue; } else { cout << 0 << endl; continue; } } if (nwa == 0) { if (wa != 0) { cout << -1 << endl; continue; } else { cout << 0 << endl; continue; } } if (nok < nwa) { long long xx = ok + nok - 1; xx /= nok; xx *= nok; long long l = -1; long long r = 1e10; while (l != r - 1) { long long m = (l + r) / 2ll; long long lx = xx + nok * m; long long rx = lx / nok * nwa; if (rx >= wa) r = m; else l = m; } long long lx = xx + nok * r; long long rx = lx / nok * nwa; long long ans = lx - ok; ans += rx - wa; cout << ans << endl; } else { long long xx = wa + nwa - 1; xx /= nwa; xx *= nwa; long long l = -1; long long r = 1e10; while (l != r - 1) { long long m = (l + r) / 2; long long lx = xx + m * nwa; long long rx = lx / nwa * nok; if (rx >= ok) r = m; else l = m; } long long lx = xx + r * nwa; long long rx = lx / nwa * nok; long long ans = (lx - wa) + (rx - ok); cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int x[30000001]; int main() { int n, a; cin >> a >> n; long long sum = 0, limit = n + a + 1; memset((x), 0, sizeof(x)); for (long long i = 1; i * i < limit; i++) for (long long j = i * i; j < limit; j += i * i) x[j] = i * i; for (int i = a, j = 0; i < a + n; i++, j++) sum += (a + j) / x[i]; cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, a, b; cin >> n >> a >> b; string s, ans; for (long long i = 0; i < b; i++) { long long m = a ; char c = m + i; s += c; } for (long long i = 0; i < (n / b); i++) { ans += s; } long long m = ans.length(); for (long long i = 0; i < n - m; i++) { ans += s[i]; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long t, v; cin >> t >> v; long long a[t]; for (int i = 0; i < t; i++) cin >> a[i]; long long minx = 0; sort(a, a + t); for (int z = 0; z < t - 1; z++) { minx = max(a[z + 1] - a[z], minx); } long long diff = max(a[0] - 0, v - a[t - 1]); double re; re = max(double(diff), double(minx) / 2.0); cout << setprecision(10) << fixed << re; } |
//-->FIVAR_RoX #include <bits/stdc++.h> #include <vector> #include <set> #include <string> #include <queue> #define lli long long int #define ld long double //loops #define dfloop(count1,count2,count3) for(lli i=count1;i>count2;i+=count3) #define floop(count1,count2,count3) for(lli i=count1;i<count2;i+=count3) #define floop1(count1,count2,count3) for(lli j=count1;j<count2;j+=count3) #define vfloop(count1,count2,count3,i) for(lli i=count1;i<count2;i+=count3) #define dvfloop(count1,count2,count3,i) for(lli i=count1;i>count2;i+=count3) //outputs #define qwe(x) cout<<x<<endl; #define qw(x) cout<<x<< ; //for inputs #define in(x) lli x; cin>>x; #define make(a,x) lli a[x]; floop(0,x,1) cin>>a[i]; #define make1(a,x,y) lli a[x][y]; floop(0,x,1) floop1(0,y,1) cin>>a[i][j]; //for pairs #define mkp make_pair #define fst first #define scd second //vectors #define pb push_back //sets #define sloop(s,i) for(auto i=s.begin();i!=s.end();i++) using namespace std; lli sum(lli* a,lli n){ lli s=0; while(n--){ s+=a[n]; } return s; } void print_Vector(vector<lli> Vec) { for (lli i = 0; i < Vec.size(); i++) { cout << Vec[i] << ; } cout << endl; return; } lli min_array(lli* a,lli n){ lli maxi=INT_MAX; for (int i=0;i<n;i++){ if (maxi>a[i]) maxi=a[i]; } return maxi; } void print_array(lli* a,lli n) { for (int i=0;i<n;i++){ cout<<a[i]<< ; } cout<<endl; } void answer_fin(){ in(n) lli k=n/2,k1,m1; lli m=n-k; k1=k+1; m1=m+1; lli ans; if(n&1){ ans=k1*m1*2; } else ans=k1*m1; qwe(ans) } int main() { lli test=1; // cin>>test; while(test--) answer_fin(); } |
#include <bits/stdc++.h> using namespace std; bool sieve[100000 + 5]; vector<long long> primes; int inf[100000 + 5]; vector<vector<int> > g; vector<vector<int> > h; vector<int> rab; vector<int> rtb; vector<int> res; void rec(int id, int del) { if (id == rab.size()) { res.push_back(del); return; } int cum = 1; for (int i = 0; i <= rab[id]; i++) { rec(id + 1, del * cum); cum *= rtb[id]; } } void gen1(int i) { res.clear(); rab = g[i]; rtb = h[i]; rec(0, 1); } void fill() { int san; int cnt; for (int i = 2; i < 100000 + 1; i++) { san = i; for (int j = 0; primes[j] <= san; j++) { cnt = 0; while (san % primes[j] == 0) { san /= primes[j]; cnt++; } if (cnt > 0) { g[i].push_back(cnt); h[i].push_back(primes[j]); } if (san == 0) break; if (sieve[san]) { g[i].push_back(1); h[i].push_back(san); break; } } } } void oku() { memset(sieve, true, sizeof sieve); g.assign(100000 + 1, vector<int>(0)); h.assign(100000 + 1, vector<int>(0)); sieve[1] = sieve[0] = false; for (long long i = 2; i * i <= 100000; i++) if (sieve[i]) for (long long j = i * i; j <= 100000; j += i) sieve[j] = false; int cnt = 0; for (int i = 0; i < 100000; i++) if (sieve[i]) primes.push_back(i); fill(); int n, x, y, id; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , &x, &y); gen1(x); id = i + 1 - y; cnt = 0; for (int j = 0; j < int((res).size()); j++) { if (inf[res[j]] < id) cnt++; inf[res[j]] = i + 1; } printf( %d n , cnt); } } int main() { oku(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int INF = 1e9; const long long INF64 = 9e18; const long double EPS = 1e-9; const long double PI = 3.14159265358979310000; const long long MD = 1248742437; const long long T = 378531; const int N = 1200001; const int M = 501; int n, k, a[N]; int main() { cin >> n >> k; if (n / k < 3) { cout << -1; return 0; } int j = 1; for (int i = 1; i <= k * 2; i++) { a[i] = j; j++; if (j > k) j = 1; } j = k; for (int i = k * 2 + 1; i <= n; i++) { a[i] = j; j--; if (j == 0) j = k; } swap(a[k / 2], a[k / 2 + 1]); for (int i = 1; i <= n; i++) printf( %d , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; bool watched[1000001]; cin >> n; while (cin >> x) watched[x] = true; for (int i = 1; i <= n; i++) if (!watched[i]) cout << i; return 0; } |
#include <bits/stdc++.h> using namespace std; int tab[205]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> V; for (int i = 0; i < n; i++) { int x; cin >> x; tab[x] = 1; V.push_back(x); } vector<int> V2; bool b = 1; for (int i : V) { b = 0; for (int j = i + 1; j <= 2 * n; j++) { if (tab[j] == 0) { tab[j] = 1; b = 1; V2.push_back(j); break; } } if (!b) { break; } } if (!b) { cout << -1 n ; } else { for (int i = 0; i < n; i++) { cout << min(V[i], V2[i]) << << max(V[i], V2[i]) << ; } cout << n ; } for (int i = 0; i <= 2 * n; i++) { tab[i] = 0; } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; t = 1; while (t--) { long long int n, m; cin >> n >> m; long long int arr[n]; string arr2[m]; for (long long int i = 0; i < n; i++) { cin >> arr[i]; } map<string, int> mp; for (long long int i = 0; i < m; i++) { cin >> arr2[i]; if (mp.find(arr2[i]) != mp.end()) { std::map<string, int>::iterator it = mp.find(arr2[i]); it->second++; } else { mp.insert({arr2[i], 1}); } } sort(arr, arr + n); vector<long long int> freq; for (auto &it : mp) { freq.push_back(it.second); } sort(freq.begin(), freq.end(), greater<long long int>()); long long int ans = 0; long long int ans2 = 0; for (long long int i = 0; i < freq.size(); i++) { ans += freq[i] * arr[i]; ans2 += freq[i] * arr[n - i - 1]; } cout << ans << << ans2 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 10; const int maxn = 5e5 + 10; int N, M; struct edge { int v, u, l, r; edge() {} edge(int v_, int u_, int l_, int r_) : v(v_), u(u_), l(l_), r(r_) {} bool operator>(const edge& rhs) const { return l > rhs.l; } }; priority_queue<edge, vector<edge>, greater<edge>> q; vector<edge> adj[maxn][2]; int last[maxn][2]; void relax(int v, int start, int end) { last[v][start & 1] = max(last[v][start & 1], end); for (auto& e : adj[v][start & 1]) { edge t = e; t.l = start; q.push(t); } adj[v][start & 1].clear(); } int main() { scanf( %d %d , &N, &M); for (int i = 1; i <= M; ++i) { int v, u, l, r; scanf( %d %d %d %d , &v, &u, &l, &r); --r; q.push(edge(v, u, l, ((l & 1) == (r & 1) ? r : r - 1))); q.push(edge(u, v, l, ((l & 1) == (r & 1) ? r : r - 1))); q.push(edge(v, u, l + 1, (((l + 1) & 1) == (r & 1) ? r : r - 1))); q.push(edge(u, v, l + 1, (((l + 1) & 1) == (r & 1) ? r : r - 1))); } if (N == 1) { printf( 0 n ); return 0; } for (int i = 1; i <= N; ++i) for (int j = 0; j < 2; ++j) last[i][j] = -1; last[1][0] = 0; while (!q.empty()) { edge e = q.top(); q.pop(); if (e.l <= e.r) { if (last[e.v][e.l & 1] >= e.l) { if (e.u == N) { printf( %d n , e.l + 1); return 0; } relax(e.u, e.l + 1, e.r + 1); } else { adj[e.v][e.l & 1].push_back(e); } } } printf( -1 n ); } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, A, B, x, y; while (cin >> x >> y >> A >> B) { int Count = 0; for (i = A; i <= x; i++) { for (j = B; j <= y; j++) { if (i > j) { Count++; } } } cout << Count << endl; for (i = A; i <= x; i++) { for (j = B; j <= y; j++) { if (i > j) { cout << i << << j << endl; } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1000000]; pair<int, int> b[1000000]; int ord[1000000]; int main() { int n, k; cin >> n >> k; long long m; cin >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; b[i] = make_pair(a[i], i); } sort(b + 1, b + n, greater<pair<int, int> >()); b[n].first = 0; long long sum = 0; for (int i = 1; i < n; i++) { if (i < k) sum += b[i].first; ord[b[i].second] = i; } int num = k - 1; for (int i = 1; i < n; i++) { long long s = sum; if (ord[i] <= num) { s -= b[ord[i]].first; s += b[k].first; } if (m - s < a[i]) { cout << i << endl; return 0; } } cout << n << endl; } |
#include <bits/stdc++.h> using namespace std; void rom(long long W) { long long pot = 1LL; char val[20] = IVXLCDM ; long long w = 0LL, z, i; while (pot <= W) { pot *= 10LL; w++; } pot /= 10LL; w--; while (pot) { z = W / pot; if (z == 4) printf( %c%c , val[w * 2], val[w * 2 + 1]); else if (z == 9) printf( %c%c , val[w * 2], val[w * 2 + 2]); else { if (z >= 5) { printf( %c , val[w * 2 + 1]); z -= 5; } for (i = 0; i < z; i++) printf( %c , val[w * 2]); } W -= W / pot * pot; pot /= 10LL; w--; } printf( n ); } void nice(long long W, long long B) { if (W == 0LL) cout << 0; long long pot = 1LL; char val[300]; int i, j; for (i = 0, j = 0 ; j <= 9 ; i++, j++) val[i] = j; for (j = A ; j <= Z ; i++, j++) val[i] = j; while (pot <= W) { pot *= B; } pot /= B; while (pot) { printf( %c , val[W / pot]); W -= (W / pot) * pot; pot /= B; } printf( n ); } int main() { long long a; char b[10000], c[10000]; long long w, pot, i, j; long long val[300]; memset(val, 0, sizeof(val)); for (i = 0 , j = 0; i <= 9 ; i++, j++) { val[i] = j; } for (i = A ; i <= Z ; i++, j++) { val[i] = j; } cin >> a; scanf( %s%s , b, c); w = 0LL; pot = 1LL; for (i = strlen(c) - 1; i >= 0; i--, pot *= a) { w += (val[c[i]]) * pot; } if (b[0] == R ) rom(w); else { int q; sscanf(b, %d , &q); nice(w, 0LL + q); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a = 0; cin >> a; int z = 0, e = 0; char b; for (int i = 0; i < a; i++) { cin >> b; if (b == D ) z++; if (b == A ) e++; } if (e == z) cout << Friendship ; else if (e < z) cout << Danik ; else if (e > z) cout << Anton ; } |
#include <bits/stdc++.h> using namespace std; bool good(long long int a, long long int b) { while (a and b) { if (a % 2 == 0 and b % 2 == 1) return false; a /= 2; b /= 2; } return true; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<pair<long long int, long long int>> s(n); for (int i = 0; i < n; i++) cin >> s[i].first; for (int i = 0; i < n; i++) cin >> s[i].second; sort(s.rbegin(), s.rend()); vector<bool> used(n, false); int nb = 0; long long int knw = 0; long long int ans = 0; for (int i = 1; i < n; i++) { if (s[i].first == s[i - 1].first) { knw |= s[i].first; if (!used[i]) { nb++; ans += s[i].second; used[i] = true; } if (!used[i - 1]) { nb++; ans += s[i - 1].second; used[i - 1] = true; } } } for (int i = 0; i < n; i++) { if (used[i]) continue; for (int j = 0; j < n; j++) { if (used[j] and (s[i].first | s[j].first) == s[j].first) { ans += s[i].second; nb++; used[i] = true; break; } } } if (nb < 2) ans = 0; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; deque<int> q; int main() { int n; while (~scanf( %d , &n)) { q.clear(); for (int i = 1; i <= n; i++) q.push_back(i); for (int i = 2; i <= n; i++) { int k = ((n - 1) / i) * i; int tmp = q[k]; for (int j = k; j >= i; j -= i) q[j] = q[j - i]; q[0] = tmp; q.push_back(q.front()); q.pop_front(); } int sz = q.size(); for (int i = 0; i < sz; i++) if (i == 0) printf( %d , q[i]); else printf( %d , q[i]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void setIO(string str, bool dbg) { ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); if (!dbg) { freopen((str + .in ).c_str(), r , stdin); freopen((str + .out ).c_str(), w , stdout); } } const int MAX = 5e3 + 5; const int LEN = 2e3 + 5; const int LVL = 2e1 + 0; const long long int MOD = 1e9 + 7; const long long int INF = 2e9; int xyz = 1; int n, q; int pld[MAX][MAX]; int dps[MAX][MAX]; void fnc() { string str; cin >> str; n = str.length(); for (int i = 0; i < n; i++) pld[i][i] = 1; for (int i = 1; i < n; i++) { for (int j = 0; j + i < n; j++) { int l = j; int r = i + j; pld[l][r] = str[l] == str[r] ? pld[l + 1][r - 1] || r - l == 1 : 0; } } for (int i = 0; i < n; i++) { for (int j = 0; j + i < n; j++) { int l = j; int r = i + j; dps[l][r] = pld[l][r] + dps[l + 1][r] + dps[l][r - 1] - dps[l + 1][r - 1]; } } cin >> q; for (int i = 0; i < q; i++) { int l; int r; cin >> l >> r; cout << dps[l - 1][r - 1] << n ; } } int main() { setIO( , 1); while (xyz--) fnc(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t, i, j, k, n; cin >> t; while (t--) { cin >> n; long long int ans = 0; int i = 0; while (n) { ans += n; n = n / 2; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; long long MOD = 998244353; long long gcd(long long a, long long b) { long long c; while (a != 0) { c = a; a = b % a; b = c; } return b; } signed main() { cin.tie(0); ios::sync_with_stdio(false); long long N; cin >> N; vector<long long> A(N); long long res = 1; for (long long i = 0; i < N; i++) { cin >> A[i]; } map<long long, long long> mp; map<long long, long long> num; vector<long long> C; set<long long> st; for (long long i = 0; i < N; i++) { long long X = pow(A[i], 0.25); X = max((long long)0, X - 3); while (X * X * X * X < A[i]) X++; if (X * X * X * X == A[i]) { mp[X] += 4; st.insert(X); continue; } X = pow(A[i], 1.0 / 3); X = max((long long)0, X - 3); while (X * X * X < A[i]) X++; if (X * X * X == A[i]) { mp[X] += 3; st.insert(X); continue; } X = sqrt(A[i]); X = max((long long)0, X - 3); while (X * X < A[i]) X++; if (X * X == A[i]) { mp[X] += 2; st.insert(X); continue; } num[A[i]]++; if (num[A[i]] == 1) { C.push_back(A[i]); } } vector<long long> V(C.size(), 0); for (long long i = 0; i < C.size(); i++) { for (long long j = i + 1; j < C.size(); j++) { long long a = gcd(C[i], C[j]); if (a != 1) { st.insert(a); st.insert(C[i] / a); st.insert(C[j] / a); } } } vector<long long> sv; for (auto s : st) { sv.push_back(s); } for (long long i = 0; i < C.size(); i++) { bool ok = true; for (long long j = 0; j < sv.size(); j++) { if (C[i] % sv[j] == 0) { mp[sv[j]] += num[C[i]]; mp[C[i] / sv[j]] += num[C[i]]; ok = false; break; } } if (ok) { long long t = num[C[i]] + 1; res = (res * t * t) % MOD; } } for (auto m : mp) { res = (res * (m.second + 1)) % MOD; } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; int a, b; int main() { while (cin >> a >> b) { if (b % 2 == 0) cout << a * b / 2 << endl; else cout << a * (b / 2) + a / 2 << endl; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.