func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int n, P, a[150005], lazy_tag[600005], m; int read() { char x = getchar(); int ans = 0; while (!isdigit(x)) x = getchar(); while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); return ans; } struct node { vector<pair<int, int> > V; void clear() { V.clear(); } int size() { return (int)V.size(); } void push_back(pair<int, int> x) { V.push_back(x); } node operator+(node x) { if (V.empty()) return x; node ans = *this; for (int i = 0; i < x.size(); i++) { bool flag = 0; for (int j = 0; j < ans.V.size(); j++) if (ans.V[j].first == x.V[i].first) { flag = 1, ans.V[j].second += x.V[i].second; break; } if (flag) continue; ans.V.push_back(x.V[i]); if (ans.V.size() <= P) continue; int minn = 1e9; for (int j = 0; j < ans.V.size(); j++) minn = min(minn, ans.V[j].second); vector<pair<int, int> > tmp; for (int j = 0; j < ans.V.size(); j++) if (ans.V[j].second - minn) tmp.push_back(make_pair(ans.V[j].first, ans.V[j].second - minn)); ans.V = tmp; } return ans; } } tree[600005]; int ls(int p) { return p << 1; } int rs(int p) { return p << 1 | 1; } void pushup(int p) { tree[p] = tree[ls(p)] + tree[rs(p)]; } void build(int l, int r, int p) { if (l == r) { tree[p].push_back(make_pair(a[l], 1)); return; } int mid = (l + r) >> 1; build(l, mid, ls(p)); build(mid + 1, r, rs(p)); pushup(p); } void pushdown(int p, int l, int r) { if (!lazy_tag[p]) return; lazy_tag[ls(p)] = lazy_tag[rs(p)] = lazy_tag[p]; tree[ls(p)].clear(), tree[rs(p)].clear(); int mid = (l + r) >> 1; tree[ls(p)].push_back(make_pair(lazy_tag[p], mid - l + 1)); tree[rs(p)].push_back(make_pair(lazy_tag[p], r - mid)); lazy_tag[p] = 0; } void update(int l, int r, int ll, int rr, int p, int val) { if (ll <= l && r <= rr) { tree[p].clear(); lazy_tag[p] = val; tree[p].push_back(make_pair(val, r - l + 1)); return; } int mid = (l + r) >> 1; pushdown(p, l, r); if (ll <= mid) update(l, mid, ll, rr, ls(p), val); if (rr > mid) update(mid + 1, r, ll, rr, rs(p), val); pushup(p); } node query(int l, int r, int ll, int rr, int p) { if (ll <= l && r <= rr) return tree[p]; node ans; int mid = (l + r) >> 1; pushdown(p, l, r); if (ll <= mid) ans = ans + query(l, mid, ll, rr, ls(p)); if (rr > mid) ans = ans + query(mid + 1, r, ll, rr, rs(p)); return ans; } int main() { n = read(), m = read(), P = read(); P = 100 / P; for (int i = 1; i <= n; i++) a[i] = read(); build(1, n, 1); for (int i = 1; i <= m; i++) { int opt; opt = read(); if (opt == 1) { int l, r, id; l = read(), r = read(), id = read(); update(1, n, l, r, 1, id); } else { int l, r; l = read(), r = read(); node ans = query(1, n, l, r, 1); printf( %d , (int)ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d , ans.V[i]); puts( ); } } } |
#include <bits/stdc++.h> using namespace std; typedef vector<long long int> vi; typedef vector<vi> vvi; typedef vector<pair<long long int, long long int> > vii; typedef vector<vii> vvii; typedef vector<bool> vb; const long long int dx4[] = {1, 0, -1, 0}, dy4[] = {0, -1, 0, 1}; const long long int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1}, dy8[] = {1, -1, 1, 0, -1, 1, -0, -1}; long double dist(long long int a1, long long int b1, long long int a2, long long int b2) { return sqrt(((a2 - a1) * (a2 - a1)) + ((b2 - b1) * (b2 - b1))); } signed main() { long double r, x1, y1, x2, y2, rap, xap, yap, d, cosine, sine; cin >> r >> x1 >> y1 >> x2 >> y2; d = dist(x1, y1, x2, y2); if (d > r) { rap = r; xap = x1; yap = y1; } else { rap = (r + d) / (long double)(2); if (d == 0) { xap = x1 + r / (long double)(2); yap = y1; } else { cosine = (x1 - x2) / d; sine = (y1 - y2) / d; xap = x2 + (rap * cosine); yap = y2 + (rap * sine); } } cout << setprecision(100) << xap << << yap << << rap << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { pair<long long, long long> a[1001]; a[0].second = 1; for (long long i = 1; i < 1001; i++) { a[i].first = i; if (i < 10) a[i].second = 1; else if (i < 100) a[i].second = 2; else if (i < 1000) a[i].second = 3; } long long n; cin >> n; long long count = 1; long long i = 1; while (count < n) { count += a[i].second; i++; } if (count == n) { long long temp = i; long long ans; while (temp != 0) { ans = temp % 10; temp = temp / 10; } cout << ans << endl; } else if (count > n) { i--; long long temp = a[i].first; long long flag = count - n - 1; while (flag > 0) { temp = temp / 10; flag--; } cout << temp % 10 << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; string s[t]; for (int i = 0; i < t; i++) { cin >> s[i]; } map<string, int> m; for (int j = 0; j < t; j++) { for (int l = 1; l <= 9; l++) { for (int i = 0; i < 10 - l; i++) { string p = s[j].substr(i, l); if (m.find(p) != m.end()) { if (m[p] != j) { m[p] = -1; } } else { m[p] = j; } } } } string ans[t]; for (int i = 0; i < t; i++) { ans[i] = a ; } for (auto it = m.begin(); it != m.end(); it++) { int x = it->second; string y = it->first; if (x == -1) { continue; } if (ans[x] == a || ans[x].size() > y.size()) { ans[x] = y; } } for (int i = 0; i < t; i++) { cout << ans[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; long long ceil(long long a, long long b) { long long res = a / b; if (a % b != 0) res++; return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m, q; cin >> n >> m >> q; vector<int> a(n), b(m); long long total = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (i % 2 == 0) { total += a[i]; } else { total -= a[i]; } } for (int i = 0; i < m; i++) { cin >> b[i]; } set<long long> pos_sum; long long sum_even = 0, sum_odd = 0; for (int i = 0; i < n; i++) { if (i % 2 == 0) { sum_even += b[i]; } else { sum_odd += b[i]; } } for (int j = 0; j < m - n + 1; j++) { if (j != 0) { if ((j - 1) % 2 == 0) { sum_even -= b[j - 1]; } else { sum_odd -= b[j - 1]; } if ((j + n - 1) % 2 == 0) { sum_even += b[j + n - 1]; } else { sum_odd += b[j + n - 1]; } } if (j % 2 == 0) { pos_sum.insert(-sum_odd + sum_even); } else { pos_sum.insert(-sum_even + sum_odd); } } auto find = [&]() { auto ub = pos_sum.upper_bound(total); long long res = LONG_LONG_MAX; if (ub != pos_sum.end()) { res = min(res, abs(total - *ub)); } if (ub != pos_sum.begin()) { ub--; res = min(res, abs(total - *ub)); } return res; }; cout << find() << n ; while (q--) { int l, r, x; cin >> l >> r >> x; l--, r--; long long len = r - l + 1; if (l % 2 == 0) { total += ceil(len, 2) * x; total -= (len / 2) * x; } else { total -= ceil(len, 2) * x; total += (len / 2) * x; } cout << find() << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string k; cin >> k; int st = 0; while (st < (int)k.length() && k[st] == a && 1) { st++; } if (st == (int)k.length()) { k[k.length() - 1] = z ; cout << k << endl; return 0; } int se = st + 1; while (se < (int)k.length() && k[se] != a && 1) { se++; } se--; for (int i = st; i <= se; i++) { k[i]--; } cout << k << endl; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, x, y; cin >> n >> x >> y; vector<int> nums(n); vector<int> a(n); vector<vector<int>> freq(n + 1); vector<vector<int>> ind(n + 1 + 1); vector<bool> mis(n); for (int i = 0; i < n; i++) { cin >> nums[i]; mis[i] = false; ind[nums[i]].push_back(i); } for (int i = 1; i <= n + 1; i++) { freq[ind[i].size()].push_back(i); } int f = n; for (int k = 0; k < x; k++) { while (freq[f].empty()) { f--; } int col = freq[f].back(); int idx = ind[col].back(); a[idx] = col; ind[col].pop_back(); freq[f].pop_back(); freq[f - 1].push_back(col); } while (f > 0 && freq[f].empty()) f--; if (2 * f > 2 * n - x - y) { cout << NO n ; return; } vector<int> ve; for (int i = 1; i <= f; i++) { for (int color : freq[i]) { ve.insert(ve.end(), ind[color].begin(), ind[color].end()); } } int mismatch = n - y; auto makemismatch = [&](int i) { a[i] = freq[0][0]; mismatch--; mis[i] = true; }; for (int i = 0; i < n - x; i++) { a[ve[i]] = nums[ve[(i + (n - x) / 2) % (n - x)]]; if (a[ve[i]] == nums[ve[i]]) { makemismatch(ve[i]); } } for (int i = 0; mismatch > 0; i++) { if (!mis[ve[i]]) makemismatch(ve[i]); } cout << YES n ; for (int i = 0; i < n; i++) { cout << a[i] << ; } cout << n ; } int main() { int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; n--; int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; if (a[i] == 0) --i; } int principi; int b[n]; for (int i = 0; i < n; ++i) { cin >> b[i]; if (b[i] == 0) --i; if (b[i] == a[0]) principi = i; } bool bo = true; for (int i = 1; bo and i < n; ++i) { if (a[i] != b[(principi + i) % n]) bo = false; } if (bo) cout << YES << endl; else cout << NO << endl; } |
#include <bits/stdc++.h> using namespace std; struct edge { int x, y, z, id; } e[200005]; vector<int> to[200005]; int fa[200005], f[200005][18], deep[200005], g[200005][18], id[200005], ans[200005]; bool flag[200005]; int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } void dfs(int x, int fa) { f[x][0] = fa, deep[x] = deep[fa] + 1; for (auto tar : to[x]) if (tar != fa) dfs(tar, x); } pair<int, int> lca(int x, int y) { int res = 0; if (deep[x] < deep[y]) swap(x, y); for (int k = 17; k >= 0; k--) if (deep[f[x][k]] >= deep[y]) res = max(res, g[x][k]), x = f[x][k]; if (x == y) return {x, res}; for (int k = 17; k >= 0; k--) if (f[x][k] != f[y][k]) res = max(res, max(g[x][k], g[y][k])), x = f[x][k], y = f[y][k]; res = max(res, max(g[x][0], g[y][0])); return {f[x][0], res}; } void merge(int from, int to, int v) { from = find(from); while (deep[from] > deep[to]) { ans[id[from]] = v; fa[from] = find(f[from][0]); from = find(from); } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d%d%d , &e[i].x, &e[i].y, &e[i].z), e[i].id = i; sort(e + 1, e + m + 1, [&](edge a, edge b) { return a.z < b.z; }); for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= m; i++) { int fx = find(e[i].x), fy = find(e[i].y); if (fx != fy) to[e[i].x].push_back(e[i].y), to[e[i].y].push_back(e[i].x), fa[fx] = fy; else flag[i] = 1; } dfs(1, 0); for (int i = 1; i <= m; i++) if (!flag[i]) g[deep[e[i].x] < deep[e[i].y] ? e[i].y : e[i].x] [0] = e[i].z, id[deep[e[i].x] < deep[e[i].y] ? e[i].y : e[i].x] = e[i].id; for (int k = 1; k <= 17; k++) for (int i = 1; i <= n; i++) f[i][k] = f[f[i][k - 1]][k - 1], g[i][k] = max(g[i][k - 1], g[f[i][k - 1]][k - 1]); for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= m; i++) if (flag[i]) { auto g = lca(e[i].x, e[i].y); ans[e[i].id] = g.second; merge(e[i].x, g.first, e[i].z), merge(e[i].y, g.first, e[i].z); } for (int i = 1; i <= m; i++) printf( %d , ans[i] ? ans[i] - 1 : -1); return 0; } |
#include <bits/stdc++.h> using namespace std; struct edge { int to, next; } e[400005]; int n, k, num, head[200005], a[200005], f[200005], g[200005], h[200005], g_node[200005], ans, maxa, size[200005]; bool ok[200005]; inline void insert(int u, int v) { e[++num].to = v; e[num].next = head[u]; head[u] = num; e[++num].to = u; e[num].next = head[v]; head[v] = num; } void dfs(int now, int fa) { size[now] = 1; int s = 0, maxc = 0, secc = 0, id = 0; for (int i = head[now]; i; i = e[i].next) if (e[i].to != fa) { dfs(e[i].to, now); size[now] += size[e[i].to]; if (ok[e[i].to]) { int ch = f[e[i].to] + g[e[i].to] + 1; if (ch == size[e[i].to]) s += ch; else if (ch > maxc) secc = maxc, maxc = ch, id = e[i].to; else if (ch > secc) secc = ch; } } if (ok[now]) { f[now] = s; g[now] = maxc; h[now] = secc; g_node[now] = id; } } void work(int now, int fa, int out) { if (ok[now]) { if (out == n - size[now]) f[now] += out; else { if (out > g[now]) h[now] = g[now], g[now] = out, g_node[now] = fa; else if (out > h[now]) h[now] = out; } num = max(num, f[now] + g[now] + 1); if (num >= k) return; } for (int i = head[now]; i; i = e[i].next) if (e[i].to != fa) { if (!ok[now]) work(e[i].to, now, 0); else { if (ok[e[i].to] && f[e[i].to] + g[e[i].to] + 1 == size[e[i].to]) work(e[i].to, now, f[now] - size[e[i].to] + g[now] + 1); else if (e[i].to == g_node[now]) work(e[i].to, now, f[now] + h[now] + 1); else work(e[i].to, now, f[now] + g[now] + 1); } } } inline bool check(int x) { for (int i = 1; i <= n; i++) ok[i] = a[i] >= x; memset(f, 0, sizeof(f)); memset(g, 0, sizeof(g)); memset(h, 0, sizeof(h)); dfs(1, 0); num = 0; work(1, 0, 0); return num >= k; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); maxa = max(maxa, a[i]); } for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); insert(u, v); } int l = 1, r = maxa; while (l <= r) { int mid = (l + r) >> 1; if (check(mid)) ans = mid, l = mid + 1; else r = mid - 1; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const double Pi = acos(-1.0); void DEBUG(string name, int* begin, int* end) { printf( DEBUG: %s = { , name.c_str()); for (; begin != end; begin++) { printf( %5d, , *begin); } printf( %c} n , (char)8); } void DEBUG(string name, long long* begin, long long* end) { printf( DEBUG: %s = { , name.c_str()); for (; begin != end; begin++) { printf( %5lld, , *begin); } printf( %c} n , (char)8); } void DEBUG(string name, double* begin, double* end) { printf( DEBUG: %s = { , name.c_str()); for (; begin != end; begin++) { printf( %5lf, , *begin); } printf( %c} n , (char)8); } void DEBUG(string name, vector<int> nums) { printf( DEBUG: %s = { , name.c_str()); for (int i : nums) { printf( %5d, , i); } printf( %c} n , (char)8); } void DEBUG(string name, set<int> nums) { printf( DEBUG: %s = { , name.c_str()); for (int i : nums) { printf( %5d, , i); } printf( %c} n , (char)8); } void DEBUG(string name, vector<long long> nums) { printf( DEBUG: %s = { , name.c_str()); for (int i : nums) { printf( %5lld, , i); } printf( %c} n , (char)8); } void DEBUG(string name, set<long long> nums) { printf( DEBUG: %s = { , name.c_str()); for (int i : nums) { printf( %5lld, , i); } printf( %c} n , (char)8); } void DEBUG(string name, map<int, int> nums) { printf( DEBUG: %s = { , name.c_str()); for (auto i : nums) { printf( (%d -> %d), , i.first, i.second); } printf( %c} n , (char)8); } void DEBUG(string name, queue<int> nums) { if (nums.size() == 0) { printf( DEBUG: %s = [] n , name.c_str()); return; } printf( DEBUG: %s = [ , name.c_str()); while (!nums.empty()) { printf( %5d, , nums.front()); nums.pop(); } printf( %c] n , (char)8); } void DEBUG(string name, int num) { printf( DEBUG: %s = %d n , name.c_str(), num); } void DEBUG(string name, long long num) { printf( DEBUG: %s = %lld n , name.c_str(), num); } void DEBUG(string name, double num) { printf( DEBUG: %s = %lf n , name.c_str(), num); } int cross(int a1, int b1, int a2, int b2) { return (a1 * b2 - a2 * b1); } int ccw(pair<int, int> a, pair<int, int> b, pair<int, int> c) { return cross(b.first - a.first, b.second - a.second, c.first - a.first, c.second - a.second); } void hi() { printf( hi n ); } long long n; long long times[100010]; long long t[100010], k[100010]; vector<pair<int, int> > adj[100010]; bool visited[100010]; void dfs(int node) { k[node] = 1; for (pair<int, int> i : adj[node]) { if (!visited[i.first]) { visited[i.first] = true; dfs(i.first); k[node] += k[i.first]; t[node] += t[i.first] + 2 * i.second; } } } bool comp(pair<int, int> a, pair<int, int> b) { return (t[a.first] + 2 * a.second) * (k[b.first]) < (t[b.first] + 2 * b.second) * (k[a.first]); } long long curr_time; void dfs2(int node) { times[node] = curr_time; for (pair<int, int> i : adj[node]) { if (!visited[i.first]) { visited[i.first] = true; curr_time += i.second; dfs2(i.first); curr_time += i.second; } } } int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int a, b, c; cin >> a >> b >> c; a--; b--; adj[a].push_back(pair<int, int>(b, c)); adj[b].push_back(pair<int, int>(a, c)); } visited[0] = true; dfs(0); for (int i = 0; i < n; i++) { sort(adj[i].begin(), adj[i].end(), comp); } memset(visited, 0, sizeof(visited)); visited[0] = true; dfs2(0); double sum = 0; for (int i = 0; i < n; i++) { sum += times[i]; } printf( %.41lf , sum / (n - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 6; int n, k; int Pow10[10], F[10]; long long f[N]; long long cal(int n) { int t = 0; long long s = 0; while (n > 0) { int x = n % 10; if (x % 3 == 0) s += 1LL * F[t] * x / 3; n /= 10; t++; } return s; } int main() { ios ::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen( main.in , r )) freopen( main.in , r , stdin); cin >> k; Pow10[0] = 1; for (int i = 0; i < 6; i++) { cin >> F[i]; if (i) Pow10[i] = Pow10[i - 1] * 10; } int _, n; cin >> _ >> n; for (int i = 0; i <= n; i++) f[i] = -1e15; f[0] = 0; for (int t = 0; t < 6; t++) { int s = 0, p = 1; while (s + p <= 3 * (k - 1)) { s += p; for (int i = n; i >= 3LL * p * Pow10[t]; i--) f[i] = max(f[i], f[i - 3 * p * Pow10[t]] + 1LL * p * F[t]); p *= 2; } s = 3 * (k - 1) - s; for (int i = n; i >= 3LL * s * Pow10[t]; i--) f[i] = max(f[i], f[i - 3 * s * Pow10[t]] + 1LL * s * F[t]); } long long res = 0; for (int i = 0; i <= n; i++) { res = max(res, cal(n - i) + f[i]); } cout << res << n ; return 0; } |
#include <bits/stdc++.h> int a, b, c; int t, x = 0; int ans = 0; void find(int x) { for (t = x; t <= c + x; t++) if (b * x + (b - a) * (t - x) < 0) { x++; ans++; find(x); break; } } int main() { scanf( %d%d%d , &a, &b, &c); find(x); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } sort(a.begin(), a.end()); bool ok = true; int cur = -1; int q = 0; for (int i = 0; i < n; ++i) { if (q == 0) { if (cur != -1 && a[i] != a[i - 1]) { ok = false; break; } q = 1; cur = a[i]; } else { if (cur == a[i]) { ++q; } else { if (cur == a[i] - 1) { --q; } else { ok = false; break; } } } } ok &= q == 0; if (ok) { cout << YES n ; } else { cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, f, m, k, l, g, i, h, a, b, j, a1, b1, c1, c, x, y, q, w, e, r, t, d[15]; int main() { cin >> n; d[0] = 2; d[1] = 7; d[2] = 2; d[3] = 3; d[4] = 3; d[5] = 4; d[6] = 2; d[7] = 5; d[8] = 1; d[9] = 2; a = n / 10; b = n % 10; cout << d[a] * d[b]; } |
#include <bits/stdc++.h> using namespace std; int main() { int x; cin >> x; x = abs(x); int pos = 0; int i; for (i = 1; pos < x; i++) pos += i; int diff = pos - x; if (diff % 2 == 0) cout << (i - 1) << endl; else { if (i % 2 != 0) cout << i << endl; else cout << i + 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; int n; int node[101], h[101], perm[101], fav[101]; int getP(int c) { int p = node[c]; if (p < 0) return c; while (node[p] > 0) p = node[p]; return node[c] = p; } void join(int a, int b) { if (0) printf( join %d %d n , a, b); int pa = getP(a), pb = getP(b); if (pa == pb) { return; } if (h[pa] < h[pb]) { node[pa] = pb; h[pb] += h[pa]; } else { node[pb] = pa; h[pa] += h[pb]; } } void getNum() { int i; for (i = 0; i <= n; i++) { node[i] = -1; h[i] = 1; } for (i = 1; i <= n; i++) { if (i + fav[i] <= n) join(i, i + fav[i]); if (i - fav[i] > 0) join(i, i - fav[i]); } for (i = 1; i <= n; i++) if (getP(i) != getP(perm[i])) { if (0) printf( %d != %d n , i, perm[i]); printf( NO ); return; } printf( YES ); return; } int main() { int a, b, c; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &perm[i]); } for (int i = 1; i <= n; i++) scanf( %d , &fav[i]); getNum(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int k = 0; string a, b, c; cin >> a >> b >> c; for (int i = 0; i < a.size(); i++) { if (a[i] == c[i] || b[i] == c[i]) k++; else { k = -1; break; } } if (k == a.size()) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100, mod = 998244353, inf = 2e9; int n, p[N], v[N], x[N], cnt, ans; int qpow(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = 1ll * ret * x % mod; x = 1ll * x * x % mod, y >>= 1; } return ret; } struct node { int x, y, p, q, tp; bool operator<(const node &tp) const { return 1ll * p * tp.q < 1ll * q * tp.p; } } res[N * 3]; struct matrix { int s[2][2]; void init(int o) { if (o == 1) for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) s[i][j] = (i == j); else { for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) s[i][j] = 0; s[0][0] = 1; } } matrix operator*(matrix b) { matrix ret; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) { ret.s[i][j] = 0; for (int k = 0; k < 2; ++k) ret.s[i][j] = (ret.s[i][j] + 1ll * s[i][k] * b.s[k][j]) % mod; } return ret; } } trans[N], I, H; struct SegmentTree { int L[N << 2], R[N << 2]; matrix F[N << 2]; void build(int k, int l, int r) { L[k] = l, R[k] = r; if (l == r) { F[k] = trans[l]; return; } int mid = l + r >> 1; build(k << 1, l, mid); build(k << 1 | 1, mid + 1, r); F[k] = F[k << 1] * F[k << 1 | 1]; } matrix Query(int k, int l, int r) { if (r < l) return I; if (l <= L[k] && R[k] <= r) { return F[k]; } int mid = L[k] + R[k] >> 1; matrix ret = I; if (l <= mid) ret = Query(k << 1, l, r); if (r > mid) ret = ret * Query(k << 1 | 1, l, r); return ret; } void Modify(int k, int x) { if (L[k] == R[k]) { F[k] = trans[x]; return; } int mid = L[k] + R[k] >> 1; if (x <= mid) Modify(k << 1, x); else Modify(k << 1 | 1, x); F[k] = F[k << 1] * F[k << 1 | 1]; } } Tr; int main() { scanf( %d , &n); for (int i = 1, c = qpow(100, mod - 2); i <= n; ++i) scanf( %d%d%d , &x[i], &v[i], &p[i]), p[i] = mod + 1 - 1ll * c * p[i] % mod, p[i] %= mod; if (n == 1) { puts( 0 ); return 0; } for (int i = 2; i <= n; ++i) { if (v[i] > v[i - 1]) res[++cnt] = (node){i - 1, i, x[i] - x[i - 1], v[i] - v[i - 1], 0}; res[++cnt] = (node){i - 1, i, x[i] - x[i - 1], v[i] + v[i - 1], 1}; if (v[i - 1] > v[i]) res[++cnt] = (node){i - 1, i, x[i] - x[i - 1], v[i - 1] - v[i], 2}; } sort(res + 1, res + cnt + 1); I.init(1); H.init(2); for (int i = 1; i <= n; ++i) trans[i].s[0][0] = trans[i].s[1][0] = p[i], trans[i].s[0][1] = trans[i].s[1][1] = (mod + 1 - p[i]) % mod; Tr.build(1, 1, n); for (int i = 1; i <= cnt; ++i) { int x = res[i].x, y = res[i].y; matrix pre = Tr.Query(1, 1, x), suf = Tr.Query(1, y + 1, n), Y; Y.init(2); Y.s[0][0] = 0; if (res[i].tp == 0) Y.s[0][0] = p[y]; if (res[i].tp == 1) Y.s[1][0] = p[y]; if (res[i].tp == 2) Y.s[1][1] = (1 + mod - p[y]) % mod; matrix tmp = pre * Y * suf; ans = (ans + 1ll * (tmp.s[0][1] + tmp.s[0][0]) * res[i].p % mod * qpow(res[i].q, mod - 2) % mod) % mod; if (res[i].tp == 0) trans[y].s[0][0] = 0; if (res[i].tp == 1) trans[y].s[1][0] = 0; if (res[i].tp == 2) trans[y].s[1][1] = 0; Tr.Modify(1, y); } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; long long x, q, b; for (int i = k - 1; i >= 1; i--) { x = n / i * k + i; q = x % k; b = x / k; if (q * b == n) return cout << x, 0; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << (n - 1) * 2 + 1 << << 2 << endl; cout << 1 << << 2 << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> vec(n); for (int i = 0; i < n; ++i) cin >> vec[i]; int sum = accumulate(vec.begin(), vec.end(), 0); if ((sum / 100) % 2 != 0) { cout << NO n ; return 0; } sum /= 2; int num_one = count(vec.begin(), vec.end(), 100); int num_two = count(vec.begin(), vec.end(), 200); int curr = 0; while (curr <= sum && num_two > 0) { curr += 200; num_two--; } if (curr == sum) { cout << YES n ; return 0; } if (curr > sum) curr -= 200; while (curr != sum && num_one > 0) { curr += 100; num_one--; } if (curr == sum) cout << YES n ; else cout << NO n ; } |
#include <bits/stdc++.h> using namespace std; const int size = 3111; long long mod = 200000007; double p; int x, k, tmpx, a, m, b; double dp[2][1 << 9][2][255]; int main() { cin >> x >> k >> p; tmpx = x; p /= 100; int cur, nxt; m = (1 << 9) - 1; int res = (x & m); x >>= 9; if (x & 1) { a = 0; while (x & 1) { a++; x >>= 1; } dp[0][res][1][a] = 1; } else { a = 0; while (x > 0 && !(x & 1)) { a++; x >>= 1; } dp[0][res][0][a] = 1; } x = tmpx; for (int i = 0; i < k; i++) { cur = i % 2; nxt = (i + 1) % 2; for (int i = 0; i < (1 << 9); i++) { if (i + 1 <= m) { for (int k = 0; k < 250; k++) { dp[nxt][i + 1][0][k] += (1 - p) * dp[cur][i][0][k]; dp[nxt][i + 1][1][k] += (1 - p) * dp[cur][i][1][k]; } } else { for (int k = 0; k < 250; k++) { dp[nxt][0][1][1] += (1 - p) * dp[cur][i][0][k]; dp[nxt][0][0][k] += (1 - p) * dp[cur][i][1][k]; } } if (i * 2 <= m) { for (int k = 0; k < 250; k++) { dp[nxt][i * 2][0][1] += p * dp[cur][i][1][k]; dp[nxt][i * 2][0][k + 1] += p * dp[cur][i][0][k]; } } else { a = i * 2; a &= m; for (int k = 0; k < 250; k++) { dp[nxt][a][1][1] += p * dp[cur][i][0][k]; dp[nxt][a][1][k + 1] += p * dp[cur][i][1][k]; } } } for (int i = 0; i <= m; i++) for (int k = 0; k < 250; k++) dp[cur][i][0][k] = dp[cur][i][1][k] = 0; } double ans = 0; for (int i = 1; i <= m; i++) { a = 0; b = i; while (!(b & 1)) { b >>= 1; a++; } for (int k = 0; k < 250; k++) ans += (dp[nxt][i][0][k] + dp[nxt][i][1][k]) * a; } for (int k = 0; k < 250; k++) { ans += dp[nxt][0][0][k] * (k + 9); ans += dp[nxt][0][1][k] * 9; } printf( %.8lf n , ans); } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; template <typename T> inline void umax(T &a, T b) { a = max(a, b); } template <typename T> inline void umin(T &a, T b) { a = min(a, b); } const long long N = 1e5 + 10; const long long INF = 1e16 + 10; const pair<long long, long long> NINF = make_pair(INF, INF); const long double EPS = 1e-6; const long long II = 1e9; const long long MOD = 1e9 + 7; long long dp[1 << 22]; long long cnt[50][50]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; string second; cin >> second; for (long long i = 0; i < (n - 1); i++) { cnt[second[i] - a ][second[i + 1] - a ]++; cnt[second[i + 1] - a ][second[i] - a ]++; } for (long long i = 0; i < (1 << m); i++) dp[i] = INF; for (long long i = 0; i < (m); i++) dp[1 << i] = 0; for (long long msk = 0; msk < (1 << m); msk++) { long long cur = dp[msk]; for (long long i = 0; i < (m); i++) if (msk & (1 << i)) for (long long j = 0; j < (m); j++) if ((msk & (1 << j)) == 0) cur += cnt[i][j]; for (long long j = 0; j < (m); j++) if ((msk & (1 << j)) == 0) umin(dp[msk | (1 << j)], cur); } cout << dp[(1 << m) - 1]; } |
#include <bits/stdc++.h> using namespace std; bool myfunction(int i, int j) { return (i < j); } istream &in = cin; int n; bool adj[1501][1501]; int vtx[1501]; vector<bool> chk; vector<pair<pair<int, int>, int> > points; vector<pair<int, int> > res; int dfs(int node) { int cnt = 0; chk[node] = true; for (int i = 1; i <= n; ++i) if (!chk[i] && adj[node][i]) cnt += dfs(i); vtx[node] = cnt + 1; return vtx[node]; } void go(int root, vector<pair<pair<int, int>, int> > ps) { int min_y = INT_MAX, min_i = -1; for (int i = 1; i <= ps.size() - 1; ++i) if (ps[i].first.second < min_y) { min_y = ps[i].first.second; min_i = i; } res.push_back(make_pair(ps[min_i].second, root)); vector<pair<long double, int> > tps(1); for (int i = 1; i <= ps.size() - 1; ++i) if (i != min_i) tps.push_back( make_pair(atan2l(ps[i].first.first - ps[min_i].first.first, ps[i].first.second - ps[min_i].first.second), i)); sort(tps.begin() + 1, tps.end()); int s = 1; for (int i = 1; i <= n; ++i) if (adj[root][i]) { vector<pair<pair<int, int>, int> > nps(1); while (nps.size() < vtx[i] + 1) { nps.push_back(ps[tps[s].second]); ++s; } adj[i][root] = false; go(i, nps); } } int main() { in >> n; for (int i = (0); i < (n + 1); ++i) for (int j = (0); j < (n + 1); ++j) adj[i][j] = false; points.resize(n + 1); chk.resize(n + 1, false); memset(vtx, 0, sizeof(vtx)); for (int i = (0); i < (n - 1); ++i) { int a, b; in >> a >> b; adj[a][b] = adj[b][a] = true; } for (int i = (0); i < (n); ++i) { int x, y; in >> x >> y; points[i + 1] = make_pair(make_pair(x, y), i + 1); } dfs(1); sort(points.begin() + 1, points.end()); for (int i = (0); i < (n + 1); ++i) chk[i] = false; go(1, points); sort(res.begin(), res.end()); for (int i = 0; i < res.size(); ++i) cout << res[i].second << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e3 + 500; const double eps = 1e-8; int sgn(double x) { if (fabs(x) < eps) return 0; if (x < 0) return -1; else return 1; } struct Point { double x, y; Point() {} Point(double _x, double _y) : x(_x), y(_y) {} void input() { scanf( %lf%lf , &x, &y); } void output() { printf( %.0lf %.0lf n , x, y); } Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); } bool operator==(const Point &b) const { return sgn(x - b.x) == 0 && sgn(y - b.y) == 0; } bool operator<(const Point &b) const { return sgn(x - b.x) == 0 ? sgn(y - b.y) < 0 : x < b.x; } double operator^(const Point &b) const { return x * b.y - y * b.x; } double operator*(const Point &b) const { return x * b.x + y * b.y; } double distance(Point b) { return hypot(x - b.x, y - b.y); } }; struct polygon { int n; Point p[maxn], p1, p2, p3; void input(int _n) { n = _n; for (int i = 0; i < n; ++i) p[i].input(); } struct cmp { Point p; cmp(const Point &p0) { p = p0; } bool operator()(const Point &aa, const Point &bb) { Point a = aa, b = bb; int d = sgn((a - p) ^ (b - p)); if (d == 0) return sgn(a.distance(p) - b.distance(p)) < 0; return d > 0; } }; void norm() { Point mi = p[0]; for (int i = 1; i < n; ++i) mi = min(mi, p[i]); sort(p, p + n, cmp(mi)); } void Graham(polygon &convex) { norm(); int &top = convex.n; top = 0; if (n == 1) { top = 1; convex.p[0] = p[0]; return; } if (n == 2) { top = 2; convex.p[0] = p[0]; convex.p[1] = p[1]; if (convex.p[0] == convex.p[1]) top--; return; } convex.p[0] = p[0]; convex.p[1] = p[1]; top = 2; for (int i = 2; i < n; ++i) { while (top > 1 && sgn((convex.p[top - 1] - convex.p[top - 2]) ^ (p[i] - convex.p[top - 2])) <= 0) top--; convex.p[top++] = p[i]; } if (convex.n == 2 && (convex.p[0] == convex.p[1])) convex.n--; } void rotating_calipers() { double ans = 0; for (int i = 0; i < n; ++i) { int k = i + 1; for (int j = i + 1; j < n; ++j) { while (sgn(fabs((p[j] - p[i]) ^ (p[(k + 1) % n] - p[i])) - fabs((p[j] - p[i]) ^ (p[k] - p[i]))) > 0) k = (k + 1) % n; if (ans < 0.5 * fabs((p[j] - p[i]) ^ (p[k] - p[i]))) { p1 = p[i]; p2 = p[j]; p3 = p[k]; ans = 0.5 * fabs((p[j] - p[i]) ^ (p[k] - p[i])); } } } } } A, B; int n; long long s; int main() { scanf( %d%lld , &n, &s); A.input(n); A.Graham(B); B.rotating_calipers(); printf( %.0lf %.0lf n , B.p1.x + B.p2.x - B.p3.x, B.p1.y + B.p2.y - B.p3.y); printf( %.0lf %.0lf n , B.p1.x + B.p3.x - B.p2.x, B.p1.y + B.p3.y - B.p2.y); printf( %.0lf %.0lf n , B.p3.x + B.p2.x - B.p1.x, B.p3.y + B.p2.y - B.p1.y); return 0; } |
#include <bits/stdc++.h> using namespace std; int A[(1 << 17)]; int A0[(1 << 17)]; int A1[(1 << 17)]; int C[(1 << 17)]; int RMQ[2 << 20]; int I[32]; void Add(int a, int b) { int i; for (i = (0); i < (20); ++i) RMQ[I[i] + (a >> i)] += b; } int Sum(int a) { int res = 0; int i; for (i = (0); i < (20); ++i) { if (a & 1) res += RMQ[I[i] + a - 1]; a >>= 1; } return res; } int main() { int N, M; scanf( %d%d , &N, &M); vector<int> v; int i; for (i = (0); i < (M); ++i) { scanf( %d , &A[i]); if (A[i] == 0) scanf( %d%d , &A0[i], &A1[i]); else v.push_back(A[i]); } sort((v).begin(), (v).end()); v.resize(unique((v).begin(), (v).end()) - v.begin()); for (i = (0); i < (M); ++i) if (A[i] != 0) A[i] = int(lower_bound((v).begin(), (v).end(), A[i]) - v.begin()) + 1; set<pair<int, int> > bl, lb; bl.insert(pair<int, int>(-1, -N)); lb.insert(pair<int, int>(-N, -1)); v.clear(); memset(C, -1, sizeof(C)); for (i = (0); i < (M); ++i) if (A[i] != 0) if (C[A[i]] == -1) { pair<int, int> t = *lb.begin(); lb.erase(lb.begin()); bl.erase(pair<int, int>(t.second, t.first)); int l = -t.second; int r = -t.second - t.first; int m = (l + r) / 2; bl.insert(pair<int, int>(-l, l - m)); lb.insert(pair<int, int>(l - m, -l)); bl.insert(pair<int, int>(-(m + 1), (m + 1) - r)); lb.insert(pair<int, int>((m + 1) - r, -(m + 1))); A0[i] = m; C[A[i]] = m; v.push_back(m); } else { pair<int, int> t(-C[A[i]], 0); set<pair<int, int> >::iterator it0 = bl.lower_bound(t); set<pair<int, int> >::iterator it1 = it0; --it1; pair<int, int> r = *it1; pair<int, int> l = *it0; bl.erase(l); bl.erase(r); lb.erase(pair<int, int>(l.second, l.first)); lb.erase(pair<int, int>(r.second, r.first)); l.second += r.second - 1; bl.insert(l); lb.insert(pair<int, int>(l.second, l.first)); A0[i] = -C[A[i]]; C[A[i]] = -1; } for (i = (0); i < (M); ++i) if (A[i] == 0) { ++A1[i]; v.push_back(A0[i]); v.push_back(A1[i]); } sort((v).begin(), (v).end()); v.resize(unique((v).begin(), (v).end()) - v.begin()); memset(RMQ, 0, sizeof(RMQ)); I[0] = 0; for (i = (1); i < (20); ++i) I[i] = I[i - 1] + (1 << (21 - i)); for (i = (0); i < (M); ++i) if (A[i] == 0) { A0[i] = lower_bound((v).begin(), (v).end(), A0[i]) - v.begin(); A1[i] = lower_bound((v).begin(), (v).end(), A1[i]) - v.begin(); printf( %d n , Sum(A1[i]) - Sum(A0[i])); } else if (A0[i] < 0) { A0[i] = lower_bound((v).begin(), (v).end(), -A0[i]) - v.begin(); Add(A0[i], -1); } else { A0[i] = lower_bound((v).begin(), (v).end(), A0[i]) - v.begin(); Add(A0[i], 1); } return 0; }; |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int INF = 213456789; const double eps = 1e-7; int flag1 = 2, flag2 = 2, n, m; template <class T> T gcd(T a, T b) { if (!b) return a; return gcd(b, a % b); } int a[110][110]; int dy[] = {1, -1, 0, 0}; int dx[] = {0, 0, -1, 1}; int prex[110][110]; int prey[110][110]; int cost[110][110]; int dd[110][110]; bool over; int edx, edy; void print(int nx, int ny) { if (nx == edx && ny == edy) return; print(prex[nx][ny], prey[nx][ny]); if (flag1 && dd[nx][ny] == 0) printf( L n ); if (!flag1 && dd[nx][ny] == 0) printf( R n ); if (flag1 && dd[nx][ny] == 1) printf( R n ); if (!flag1 && dd[nx][ny] == 1) printf( L n ); if (flag2 && dd[nx][ny] == 2) printf( D n ); if (!flag2 && dd[nx][ny] == 2) printf( U n ); if (flag2 && dd[nx][ny] == 3) printf( U n ); if (!flag2 && dd[nx][ny] == 3) printf( D n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); } void bfs(int x, int y) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cost[i][j] = INF; } } edx = x, edy = y; cost[x][y] = 0; queue<pair<int, int> > q; q.push(make_pair(x, y)); while (!q.empty()) { pair<int, int> tmp = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int nx = dx[i] + tmp.first, ny = dy[i] + tmp.second; if (nx > 0 && nx <= n && ny > 0 && ny <= m && cost[nx][ny] == INF && a[nx][ny] != 3) { if (a[nx][ny] == 2) { dd[nx][ny] = i; prex[nx][ny] = tmp.first; prey[nx][ny] = tmp.second; cost[nx][ny] = cost[tmp.first][tmp.second] + 1; print(nx, ny); over = 1; return; } dd[nx][ny] = i; prex[nx][ny] = tmp.first; prey[nx][ny] = tmp.second; cost[nx][ny] = cost[tmp.first][tmp.second] + 1; q.push(make_pair(nx, ny)); } } } } void check1() { int i = 1; while (a[i][2] == 3) { if (flag2) printf( U n ); else printf( D n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); if (a[l][r] == 2) { over = 1; return; } i++; } printf( L n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); if (a[l][r] == 2) { over = 1; return; } if (l == i && r == 2) { flag1 = 1; printf( R n ); fflush(stdout); scanf( %d%d , &l, &r); if (a[l][r] == 2) { over = 1; return; } bfs(l, r); } else { flag1 = 0; bfs(l, r); } } void check2() { int i = 1; while (a[2][i] == 3) { if (flag1) printf( L n ); else printf( R n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); if (a[l][r] == 2) { over = 1; return; } i++; } printf( U n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); if (a[l][r] == 2) { over = 1; return; } if (l == 2 && r == i) { flag2 = 1; printf( D n ); fflush(stdout); scanf( %d%d , &l, &r); if (a[l][r] == 2) { over = 1; return; } bfs(l, r); } else { flag2 = 0; bfs(l, r); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { char c; cin >> c; if (c == . ) a[i][j] = 1; else if (c == F ) a[i][j] = 2; else if (c == * ) a[i][j] = 3; } } if (a[1][2] == 1 || a[1][2] == 2) { printf( L n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); if (a[l][r] == 2) return 0; if (l == 1 && r == 1) { flag1 = 0; } else { flag1 = 1; printf( R n ); fflush(stdout); scanf( %d%d , &l, &r); if (a[l][r] == 2) return 0; } } if (a[2][1] == 1 || a[2][1] == 2) { printf( U n ); fflush(stdout); int l, r; scanf( %d%d , &l, &r); if (a[l][r] == 2) return 0; if (l == 1 && r == 1) { flag2 = 0; } else { flag2 = 1; printf( D n ); fflush(stdout); scanf( %d%d , &l, &r); if (a[l][r] == 2) return 0; } } if (flag1 == 2) check1(); if (over) return 0; if (flag2 == 2) check2(); if (over) return 0; if (flag1 != 2 && flag2 != 2) bfs(1, 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; queue<int> q; vector<int> v[1999]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 2; i <= n; i++) { int a; cin >> a; v[a].push_back(i); } q.push(1); int ok = 1; while (!q.empty()) { int cou = 0, sep = 0; int k = q.front(); q.pop(); for (auto x : v[k]) { sep = 1; if (v[x].empty()) { cou++; } q.push(x); } if (sep) { if (cou < 3) { ok = 0; break; } } } if (ok) { cout << YES ; } else { cout << NO ; } } |
#include <bits/stdc++.h> using namespace std; int ans = -1; map<pair<int, int>, bool> visited, mp; void bfs(int x1, int y1, int x2, int y2) { queue<pair<pair<int, int>, int>> q; q.push({{x1, y1}, 0}); while (!q.empty()) { auto z = q.front(); q.pop(); visited[z.first] = 1; if (z.first.first == x2 && z.first.second == y2) { ans = z.second; break; } int x = z.first.first, y = z.first.second; if (x - 1 >= 1 && !visited[{x - 1, y}] && mp[{x - 1, y}]) { visited[{x - 1, y}] = true; q.push({{x - 1, y}, z.second + 1}); } if (x + 1 <= 1e9 && !visited[{x + 1, y}] && mp[{x + 1, y}]) { visited[{x + 1, y}] = true; q.push({{x + 1, y}, z.second + 1}); } if (y - 1 >= 1 && !visited[{x, y - 1}] && mp[{x, y - 1}]) { visited[{x, y - 1}] = true; q.push({{x, y - 1}, z.second + 1}); } if (y + 1 <= 1e9 && !visited[{x, y + 1}] && mp[{x, y + 1}]) { visited[{x, y + 1}] = true; q.push({{x, y + 1}, z.second + 1}); } if (x + 1 <= 1e9 && y + 1 <= 1e9 && !visited[{x + 1, y + 1}] && mp[{x + 1, y + 1}]) { visited[{x + 1, y + 1}] = true; q.push({{x + 1, y + 1}, z.second + 1}); } if (x + 1 <= 1e9 && y - 1 >= 1 && !visited[{x + 1, y - 1}] && mp[{x + 1, y - 1}]) { visited[{x + 1, y - 1}] = true; q.push({{x + 1, y - 1}, z.second + 1}); } if (x - 1 >= 1 && y + 1 <= 1e9 && !visited[{x - 1, y + 1}] && mp[{x - 1, y + 1}]) { visited[{x - 1, y + 1}] = true; q.push({{x - 1, y + 1}, z.second + 1}); } if (x - 1 >= 1 && y - 1 >= 1 && !visited[{x - 1, y - 1}] && mp[{x - 1, y - 1}]) { visited[{x - 1, y - 1}] = true; q.push({{x - 1, y - 1}, z.second + 1}); } } } int main() { ; ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; int n; cin >> n; set<pair<int, pair<int, int>>> s; for (int i = 0; i < n; i++) { int r, a, b; cin >> r >> a >> b; s.insert({r, {a, b}}); } for (auto it : s) { for (int i = it.second.first; i <= it.second.second; i++) { mp[{it.first, i}] = true; } } mp[{x1, y1}] = true; mp[{x2, y2}] = true; bfs(x1, y1, x2, y2); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; void Solve() { long long n; cin >> n; vector<int> arr(n); for (int i = 0; i < n; i++) cin >> arr[i]; reverse(arr.begin(), arr.end()); for (int i = 0; i < n; i++) cout << arr[i] << ; cout << n ; } int main() { long long t; cin >> t; while (t--) Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[1 << 16], *S, *T; if (S == T) { T = (S = buf) + fread(buf, 1, 1 << 16, stdin); if (T == S) return EOF; } return *S++; } inline int read() { int x = 0, f = 1; char ch = gc(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = gc(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = gc(); return x * f; } int n, w, mxb, mxa, bel[100010], nn, cnt[350], q[350][350], qh[350], qt[350]; long long d[100010]; struct data { int a, b; friend bool operator<(data a, data b) { return a.b < b.b; } } A[100010]; inline double slope(int i, int j) { return (d[i] - d[j]) * 1.0 / (j - i); } inline void gao(int i, int x) { while (qh[i] < qt[i] && slope(q[i][qh[i]], q[i][qh[i] + 1]) <= x) ++qh[i]; } inline void rebuild(int id, int l, int r) { qh[id] = 1; qt[id] = 0; for (int i = l; i <= r; ++i) { while (qh[id] < qt[id] && slope(q[id][qt[id]], i) < slope(q[id][qt[id] - 1], q[id][qt[id]])) --qt[id]; q[id][++qt[id]] = i; } gao(id, 0); } inline void add(int x) { if (!x) return; for (int i = 1; i < bel[x]; ++i) gao(i, ++cnt[i]); int l = (bel[x] - 1) * nn + 1, r = min(bel[x] * nn, mxa), id = bel[x]; for (int i = l; i <= r; ++i) d[i] += (long long)cnt[id] * i; for (int i = l; i <= x; ++i) d[i] += i; cnt[id] = 0; rebuild(id, l, r); } int main() { n = read(); w = read(); for (int i = 1; i <= n; ++i) A[i].a = read(), A[i].b = read(), mxb = max(mxb, A[i].b), mxa = max(mxa, A[i].a); sort(A + 1, A + n + 1); int now = 1; nn = sqrt(mxa); for (int i = 1; i <= mxa; ++i) bel[i] = (i - 1) / nn + 1; int tot = bel[mxa]; for (int i = 1; i <= tot; ++i) qh[i] = 1, q[i][++qt[i]] = min(i * nn, mxa); int flag = 0; for (int c = 0; c <= mxb + 1; ++c) { while (now <= n && A[now].b < c) add(A[now].a), ++now; long long ans = 0; int ans1 = 0; for (int i = 1; i <= tot; ++i) { int x = q[i][qh[i]]; if (d[x] + (long long)x * cnt[i] > ans) ans = d[x] + (long long)x * cnt[i], ans1 = x; } printf( %I64d %d n , ans + (long long)w * c * (n - now + 1), ans1); if (c == 1) flag = ans + (long long)w * c * (n - now + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[2000][2000], k, p[2000], Index; void add(int x, int y) { a[x][y] = a[y][x] = 1; } int main() { scanf( %d , &k); int maxbit = 0; for (int i = (1); i <= (30); ++i) if ((1 << i) & k) maxbit = i; Index = 2; int cur = ++Index; add(1, cur); for (int i = (1); i <= (maxbit); ++i) { add(cur, Index + 1); add(cur, Index + 2); add(Index + 1, Index + 3); add(Index + 2, Index + 3); cur = Index += 3; p[maxbit - i] = cur; } add(cur, 2); add(1, ++Index); cur = Index; for (int i = (maxbit - 1); i >= (0); --i) { add(cur, ++Index), cur = Index; if ((1 << i) & k) add(cur, p[i]); add(cur, ++Index), cur = Index; } printf( %d n , Index); for (int i = (1); i <= (Index); ++i) { for (int j = (1); j <= (Index); ++j) if (a[i][j]) printf( Y ); else printf( N ); puts( ); } assert(Index <= 150); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; const int MAXN = 200100; int win = 0, ti = 0; int vis[MAXN][2] = {0}; int vs[MAXN] = {0}; int path[MAXN], cnt; vector<int> g[MAXN]; bool dfsloop(int u) { vs[u] = 1; bool f = false; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i]; if (vs[v] == 1) f = true; else if (vs[v] == 0) f = dfsloop(v); if (f) return true; } vs[u] = 2; return false; } void dfs(int u, int ly) { vis[u][ly % 2] = 1; int sz = g[u].size(); cnt = ly; path[ly] = u; if (!sz) { if (ly % 2 == 0) { win = 1; return; } else ; } for (int i = 0; i < sz; i++) { int v = g[u][i]; if (vis[v][(ly + 1) % 2] == 0) { dfs(v, ly + 1); if (win) return; } } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { int ci; scanf( %d , &ci); while (ci--) { int v; scanf( %d , &v); g[i].push_back(v); } } int s; scanf( %d , &s); dfs(s, 1); if (win) { printf( Win n ); for (int i = 1; i <= cnt; i++) printf( %d , path[i]); } else { bool res = dfsloop(s); if (res) printf( Draw ); else printf( Lose ); } return 0; } |
#include <bits/stdc++.h> using namespace std; set<int> s; int t, n, a[200020], cnt, d[200020], e[200020]; int main() { for (scanf( %d , &t); t--; s.clear(), cnt = 0) { scanf( %d , &n); for (int i = 0; i < n; i++) d[i] = e[i] = 0; for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < n; i++) { if (s.count(a[i])) break; s.insert(a[i]); while (s.count(cnt + 1)) cnt++; if (s.size() == cnt) d[i] = 1; } s.clear(), cnt = 0; for (int i = n - 1; i >= 0; i--) { if (s.count(a[i])) break; s.insert(a[i]); while (s.count(cnt + 1)) cnt++; if (s.size() == cnt) e[i] = 1; } vector<int> v; for (int i = 0; i < n - 1; i++) { if (d[i] && e[i + 1]) v.push_back(i + 1); } printf( %d n , v.size()); for (int x : v) printf( %d %d n , x, n - x); } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 10; const double eps = 1e-6; const double mod = 1e9 + 7; struct num { int v, i; } b[MAX]; bool cmp(const num &x, const num &y) { return x.v > y.v; } bool cmp1(const num &x, const num &y) { return x.i < y.i; } int main() { int m, a[MAX]; cin >> m; for (int i = 1; i <= m; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i].v, b[i].i = i; sort(a + 1, a + m + 1); sort(b + 1, b + m + 1, cmp); for (int i = 1; i <= m; i++) b[i].v = a[i]; sort(b + 1, b + m + 1, cmp1); for (int i = 1; i <= m; i++) cout << b[i].v << ; putchar( n ); } |
#include <bits/stdc++.h> int main() { unsigned long long n; unsigned long long answer; scanf( %I64u , &n); if (n < 3) { printf( %lu , n); return 0; } if (n % 2 == 1) { answer = (n) * (n - 1) * (n - 2); } else if (n % 3 != 0) { answer = n * (n - 1) * (n - 3); } else { answer = (n - 1) * (n - 2) * (n - 3); } printf( %I64u n , answer); return 0; } |
#include <bits/stdc++.h> using namespace std; int Int() { int x; scanf( %d , &x); return x; } long long Long() { long long x; scanf( %lld , &x); return x; } void err(istream_iterator<string> it) { cout << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << ; err(++it, args...); } const int N = (int)2e5 + 5; const int maxN = (int)1e6 + 6; const long long Mod = (long long)1e9 + 7; const int inf = (int)2e9; const long long Inf = (long long)1e18; long long dp[20][5][5][11][11]; int n, k; long long call(int pos, int prior, int last, int hump, int uhump) { if (pos == n) { return hump == k and uhump == k - 1; } long long &ret = dp[pos][prior][last][hump][uhump]; if (~ret) return ret; ret = 0; for (int i = 1; i <= 4; ++i) { if (i == last) continue; int f = hump; int first = uhump; if (prior and last) { f += (prior < last and last > i); first += (prior > last and last < i); } ret += call(pos + 1, last, i, f, first); } return ret; } int main() { int test = 1, tc = 0; while (test--) { n = Int(), k = Int(); memset(dp, -1, sizeof dp); long long res = 0; for (int i = 1; i <= 4; ++i) { res += call(1, 0, i, 0, 0); } cout << res << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, k; int a[200005]; int main() { int t; scanf( %d , &t); while (t--) { scanf( %d%d , &n, &k); int pos = 0, mn = 1000000000; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (i > k && a[i] - a[i - k] < mn) { mn = a[i] - a[i - k]; pos = i; } } printf( %d n , (a[pos] + a[pos - k]) / 2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x; cin >> x; for (int a = 1; a <= x; ++a) for (int b = 1; b <= x; ++b) if (a % b == 0 && a * b > x && a / b < x) { cout << a << << b << endl; return 0; } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, l, r, sz, i, len, q, p, mid, anspos, ans[1000001]; long long mxl, mxr; long long pos[1000001], t[1000001], pr[100001]; struct Pair { long long pos; long long x; long long d; }; Pair a[100001], b[100001]; bool cmp(Pair p1, Pair p2) { return p1.x < p2.x; } bool cmd(Pair p1, Pair p2) { return p1.pos < p2.pos; } long long binl(long long L, long long R, long long height) { long long otv = -1; while (L <= R) { mid = L + R; mid /= 2; if (b[mid].x > height) R = mid - 1; else otv = mid, L = mid + 1; } return otv; } long long binr(long long L, long long R, long long height) { long long otv = -1; while (L <= R) { mid = L + R; mid /= 2; if (b[mid].x < height) L = mid + 1; else otv = mid, R = mid - 1; } return otv; } long long tree(long long L, long long R) { long long nn = 0; while (L <= R) { if (L % 2 == 1) nn = max(nn, t[L]); if (R % 2 == 0) nn = max(nn, t[R]); L = (L + 1) / 2; R = (R - 1) / 2; } return nn; } void update(long long x) { x /= 2; while (x) { t[x] = max(t[x * 2], t[x * 2 + 1]); x /= 2; } } int main() { cin >> n >> k; sz = 1; while (sz < n) sz *= 2; for (i = 1; i <= n; i++) { cin >> a[i].x; a[i].pos = i; b[i] = a[i]; } sort(b + 1, b + n + 1, cmp); for (int i = 1; i <= n; i++) pos[b[i].pos] = i, pr[i] = b[i].pos; for (int i = 1; i <= n; i++) { int l = binl(1, pos[i] - 1, a[i].x - k); int r = binr(pos[i] + 1, n, a[i].x + k); int mxl = 0, mxr = 0; if (l > 0) mxl = tree(sz, l + sz - 1); if (r > 0) mxr = tree(r + sz - 1, n + sz - 1); t[pos[i] + sz - 1] = max(mxl, mxr) + 1; update(pos[i] + sz - 1); a[pr[pos[i]]].d = t[pos[i] + sz - 1]; } sort(b + 1, b + n + 1, cmd); cout << t[1] << endl; for (int i = 1; i <= n; i++) { if (a[i].d == t[1]) { p = i; break; } } ans[++q] = p; for (int j = p; j >= 1; j--) { if (a[j].d == a[p].d - 1 && abs(a[j].x - a[p].x) >= k) { ans[++q] = j; p = j; } } for (int i = q; i >= 1; i--) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int helper(long long int edges, long long int nodes) { if (edges == nodes - 1) return nodes - 1; edges -= nodes - 1; return nodes - 1 - ceil((1.0 + sqrt(1.0 + 8.0 * edges)) / 2.0); } int main() { ios::sync_with_stdio(false); ; cin.tie(0); ; long long int i, j, q, n, lo, mid, hi; cin >> q; while (q--) { cin >> n; lo = n - 1; hi = (n * (n - 1)) / 2 + 1; while (hi - lo > 1) { mid = (lo + hi) / 2; if (helper(mid, n) >= (mid + 1) / 2) lo = mid; else hi = mid; } cout << lo << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, less<pair<long long, long long>>> q; priority_queue<long long, vector<long long>, greater<long long>> p; long long n, k, t, b, temp, res; int main() { cin >> n >> k; for (int i = 0; i < n; i++) { cin >> t >> b; q.push({b, t}); } for (int i = 0; i < n; i++) { pair<long long, long long> tt = q.top(); if (p.size() < k) { p.push(tt.second); temp += tt.second; } else { if (tt.second > p.top()) { temp += (tt.second - p.top()); p.pop(); p.push(tt.second); } } q.pop(); res = max(res, tt.first * temp); } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 1e9; for (int i = 0; i < n - 1; i++) if (s[i] == R && s[i + 1] == L ) ans = min(ans, (a[i + 1] - a[i]) / 2); if (ans == 1e9) cout << -1 << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long linf = 1001002003004005006ll; const int inf = 1001001001; const int mod = 1000000007; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; string ans1, ans2; bool elf = false; for (int i = 0; i < (n); ++i) { if (elf) { if (s[i] == 2 ) ans1 += 0 , ans2 += 2 ; if (s[i] == 0 ) ans1 += 0 , ans2 += 0 ; if (s[i] == 1 ) ans1 += 0 , ans2 += 1 ; } else { if (s[i] == 2 ) ans1 += 1 , ans2 += 1 ; if (s[i] == 0 ) ans1 += 0 , ans2 += 0 ; if (s[i] == 1 ) { ans1 += 1 , ans2 += 0 ; elf = true; } } } cout << ans1 << endl << ans2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long rd() { register long long x = 0; register bool f = 0; register char c = getchar(); while (!isdigit(c)) { if (c == - ) f = 1; c = getchar(); } while (isdigit(c)) { x = x * 10 + (c ^ 48); c = getchar(); } return f ? -x : x; } int n, a[200010], bit[31]; inline int insert(int x) { for (register int i = 30; ~i; --i) { if (x & (1 << i)) { if (!bit[i]) { bit[i] = x; return 1; } x ^= bit[i]; } } return 0; } int main() { n = rd(); for (register int i = 1; i <= n; ++i) a[i] = rd() ^ a[i - 1]; if (!a[n]) { puts( -1 ); return 0; } int ans = insert(a[n]); for (register int i = n - 1; i; --i) ans += insert(a[i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> Castle[100010]; int Index[100010]; int main() { int N; scanf( %d , &N); int Temp; for (int i = 1; i <= N; i++) { scanf( %d , &Temp); Castle[i] = make_pair(Temp, i); } sort(Castle + 1, Castle + N + 1); int Max = 1; int Ans = 0; for (int i = 1; i <= N; i++) Index[Castle[i].second] = i; for (int i = 1; i <= N; i++) { Max = max(Max, Index[i]); if (Max == i) Ans++; } printf( %d n , Ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int num = 0; bool f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { f = (ch == - ); ch = getchar(); } while (ch >= 0 && ch <= 9 ) { num = (num << 1) + (num << 3) + ch - 0 ; ch = getchar(); } return f ? -num : num; } int main() { int num[111]; int n = read(), cnt = 0, t = 0, ans = 0; memset(num, 0, sizeof(num)); while (n) { num[cnt++] = n % 2; n >>= 1; } swap(num[0], num[4]); swap(num[2], num[3]); for (int i = 0; i <= 5; i++) if (num[i]) ans += pow(2, i); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) using namespace std; const int MX = 1e9 + 1; const int Imp = -1; const int N = 1e6 + 5; const int M = 1e6 + 5; const long long INF = 1e18 + 1; int n, k; string s; set<char> st; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); string s; cin >> s; int k; cin >> k; int n = s.size(); if (n < k) { cout << impossible ; } else { for (int i = 0; i < n; ++i) st.insert(s[i]); int x = st.size(); if (x > k) cout << 0; else cout << abs(x - k); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, x; vector<int> a; cin >> n >> k; vector<int> w(k); for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } for (int i = 0; i < k; i++) { for (int j = i; j < n; j += k) { w[i] += a[j]; } } int menor = w[0]; int z = 0; for (int i = 0; i < k; i++) if (menor > w[i]) { menor = w[i]; z = i; } cout << z + 1 << endl; } |
#include <bits/stdc++.h> using namespace std; const long long N = 5000700; template <typename T> pair<T, T> operator-(pair<T, T> a, pair<T, T> b) { return make_pair(a.first - b.first, a.second - b.second); } template <typename T> pair<T, T> operator+(pair<T, T> a, pair<T, T> b) { return make_pair(a.first + b.first, a.second + b.second); } long long ans[N]; long long qx[N]; long long qy[N]; vector<long long> qrs; bool to_left(const pair<long long, long long> &a, const pair<long long, long long> &b) { return a.second * b.first > a.first * b.second; } bool to_left_equal(const pair<long long, long long> &a, const pair<long long, long long> &b) { return a.second * b.first >= a.first * b.second; } bool in_triangle(const pair<long long, long long> &x, const pair<long long, long long> &a, const pair<long long, long long> &b, const pair<long long, long long> &c) { bool b1 = to_left_equal(x - a, b - a), b2 = to_left_equal(x - b, c - b), b3 = to_left_equal(x - c, a - c), b4 = to_left_equal(x - a, c - a), b5 = to_left_equal(x - b, a - b), b6 = to_left_equal(x - c, b - c); return ((b1 && b2 && b3) || (b4 && b5 && b6)); } long long quadrant(const pair<long long, long long> &a) { if (a.second < 0) { if (a.first < 0) return 0; else return 1; } else { if (a.first > 0) return 2; else return 3; } } bool f(const long long &a, const long long &b) { if (qx[a] == qx[b] && qy[a] == qy[b]) return false; if (qx[a] == 0 && qy[a] == 0) return true; if (qx[b] == 0 && qy[b] == 0) return false; long long n1 = quadrant(make_pair(qx[a], qy[a])), n2 = quadrant(make_pair(qx[b], qy[b])); if (n1 != n2) return n1 < n2; return to_left(make_pair(qx[b], qy[b]), make_pair(qx[a], qy[a])); } bool f2(const pair<long long, long long> &a, const pair<long long, long long> &b) { if (a == b) return false; if (a.first == 0 && a.second == 0) return true; if (b.first == 0 && b.second == 0) return false; long long n1 = quadrant(a), n2 = quadrant(b); if (n1 != n2) return n1 < n2; return to_left(b, a); } vector<pair<long long, long long>> w[5]; vector<pair<long long, long long>> points; vector<pair<long long, long long>> allPoints; vector<pair<long long, long long>> half[2]; void sum(vector<pair<long long, long long>> w1, vector<pair<long long, long long>> w2, long long id) { points.clear(); allPoints.clear(); half[0].clear(); half[1].clear(); pair<long long, long long> mini1 = w1[0], mini2 = w2[0]; long long mini1it, mini2it; for (long long i = 0; i < w1.size(); i++) { if (w1[i].second > mini1.second || (w1[i].second == mini1.second && w1[i].first < mini1.first)) { mini1it = i; mini1 = w1[i]; } } for (long long i = 0; i < w2.size(); i++) { if (w2[i].second > mini2.second || (w2[i].second == mini2.second && w2[i].first < mini2.first)) { mini2it = i; mini2 = w2[i]; } } for (long long i = 0; i + 1 < w1.size(); i++) { allPoints.push_back(w1[i + 1] - w1[i]); } allPoints.push_back(w1[0] - w1[w1.size() - 1]); for (long long i = 0; i + 1 < w2.size(); i++) { allPoints.push_back(w2[i + 1] - w2[i]); } allPoints.push_back(w2[0] - w2[w2.size() - 1]); sort(allPoints.begin(), allPoints.end(), f2); pair<long long, long long> cp = mini1 + mini2; for (auto it : allPoints) { cp = cp + it; points.push_back(cp); } sort(points.begin(), points.end()); vector<pair<long long, long long>> half[2]; for (long long i = 0; i < 2; i++) { for (auto it : points) { while (half[i].size() >= 2 && to_left_equal(it - half[i][half[i].size() - 2], half[i].back() - half[i][half[i].size() - 2])) half[i].pop_back(); half[i].push_back(it); } reverse(points.begin(), points.end()); } for (auto x : half[0]) { w[id].push_back(x); } for (long long i = 1; i + 1 < half[1].size(); i++) w[id].push_back(half[1][i]); reverse(w[id].begin(), w[id].end()); } void solve() { for (long long i = 0; i < 3; i++) { long long n; cin >> n; for (long long j = 0; j < n; j++) { long long x, y; cin >> x >> y; w[i].push_back(make_pair(x, y)); } } sum(w[0], w[1], 3); sum(w[2], w[3], 4); auto mini = w[4][0]; for (auto it : w[4]) { if (it.second < mini.second || (it.second == mini.second && it.first < mini.first)) mini = it; } for (auto &it : w[4]) it = it - mini; sort(w[4].begin(), w[4].end(), f2); long long q; cin >> q; for (long long i = 0; i < q; i++) { cin >> qx[i] >> qy[i]; qx[i] = 3 * qx[i] - mini.first; qy[i] = 3 * qy[i] - mini.second; qrs.push_back(i); } long long ptr = 1; sort(qrs.begin(), qrs.end(), f); for (long long i = 0; i < q; i++) { long long query = qrs[i]; if (qy[query] < 0) { continue; } if (qy[query] == 0 && qx[query] == 0) { ans[query] = 1; continue; } while (ptr + 1 < w[4].size() && to_left(make_pair(qx[query], qy[query]), w[4][ptr + 1])) { ptr++; } if (ptr + 1 < w[4].size() && in_triangle(make_pair(qx[query], qy[query]), make_pair(0, 0), w[4][ptr], w[4][ptr + 1])) ans[query] = 1; } for (long long i = 0; i < q; i++) { if (ans[i]) { cout << YES n ; } else { cout << NO n ; } } } int32_t main() { long long t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long k; cin >> k; long long res[4][4]; for (long long i = 0; i < 4; ++i) { for (long long j = 0; j < 4; ++j) { if (i == 1 && j == 2) { res[i][j] = (1 << 17); } else if (i == 2 && j == 1) { res[i][j] = (1 << 17); } else if ((i + j) == 3) { res[i][j] = k; } else if (i == 3 && j == 3) { res[i][j] = k; } else { res[i][j] = (k + (1 << 17)); } } } cout << 4 << << 4 << endl; for (long long i = 0; i < 4; ++i) { for (long long j = 0; j < 4; ++j) { cout << res[i][j] << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { long long tmp; while (b) { a %= b; tmp = a; a = b; b = tmp; } return a; } int main() { int n; cin >> n; vector<int> a(n + 1, 0); for (int i = 0; i < n; i++) { cin >> a[i + 1]; } sort(a.begin(), a.end()); long long sum1 = 0, sum2 = 0; vector<long long> sum(n + 1, 0); for (int i = 1; i <= n; i++) { sum[i] += sum[i - 1] + (long long)i * (a[i] - a[i - 1]); sum1 += sum[i]; sum2 += a[i]; } long long num = 2 * sum1 - sum2; long long den = n; long long g = gcd(num, den); cout << num / g << << den / g << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, root, m; int a[100100]; int h[100100]; vector<int> g[100100]; int arr[200100]; int N, tin[100100], tout[100100]; vector<pair<int, int> > t[200100 * 4]; void dfs(int v, int par = -1, int len = 0) { h[v] = len; tin[v] = ++N; arr[N] = v; for (int to : g[v]) { if (to != par) { dfs(to, v, len + 1); } } tout[v] = ++N; arr[N] = v; } void build(int v, int l, int r) { if (l == r) { int node = arr[l]; t[v].push_back(make_pair(h[node], a[node])); return; } int mid = (l + r) >> 1; build(v + v, l, mid), build(v + v + 1, mid + 1, r); merge((t[v + v]).begin(), (t[v + v]).end(), (t[v + v + 1]).begin(), (t[v + v + 1]).end(), back_inserter(t[v])); for (int i = 1; i < ((int)(t[v]).size()); ++i) { t[v][i].second = min(t[v][i - 1].second, t[v][i].second); } } int get(int v, int l, int r, int L, int R, int k) { if (r < L || R < l) return 2e9; if (L <= l && r <= R) { int lf = 0, rg = ((int)(t[v]).size()) - 1, i = -1; while (lf <= rg) { int avg = (lf + rg) >> 1; if (t[v][avg].first <= k) i = avg, lf = avg + 1; else rg = avg - 1; } return i == -1 ? 2e9 : t[v][i].second; } int mid = (l + r) >> 1; return min(get(v + v, l, mid, L, R, k), get(v + v + 1, mid + 1, r, L, R, k)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> n >> root; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i < n; ++i) { int x, y; cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } dfs(root); build(1, 1, N); cin >> m; int ans = 0; for (int i = 1; i <= m; ++i) { int p, q; cin >> p >> q; int x = (p + ans) % n + 1; int k = (q + ans) % n; ans = get(1, 1, N, tin[x], tout[x], h[x] + k); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { node *next[26]; node() { for (int i = 0; i < 26; i++) next[i] = NULL; } }; void insert(node *root, string &str) { node *current = root; for (char ch : str) { if (current->next[ch - a ] == NULL) { current->next[ch - a ] = new node(); } current = current->next[ch - a ]; } } int canLose(node *root) { int was = 1, leaf = 0; for (int i = 0; i < 26; i++) { if (root->next[i]) { was = min(was, 1 ^ canLose(root->next[i])); leaf = 1; } } return was & leaf; } int canWin(node *root) { int was = 0; for (int i = 0; i < 26; i++) { if (root->next[i]) { was = max(was, 1 ^ canWin(root->next[i])); } } return was; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); node *root = new node(); int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { string str; cin >> str; insert(root, str); } if (canWin(root) && !canLose(root)) { cout << First << endl; } else if (canWin(root)) { if (k & 1) { cout << First << endl; } else { cout << Second << endl; } } else { cout << Second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100500]; vector<long long> pfx[100500], vtx[100500]; long long proc(long long x, long long sum) { int n = vtx[x].size(); int mid = n / 2; long long res = sum; for (int i = mid, _n = n; i < _n; i++) res += vtx[x][i] - vtx[x][mid]; for (int i = 0, _n = mid; i < _n; i++) res += vtx[x][mid] - vtx[x][i]; for (int i = 0, _n = n; i < _n; i++) res -= abs(x - vtx[x][i]); return res; } int main() { int n, m; long long sum = 0LL; scanf( %d %d , &n, &m); for (int i = 0, _n = m; i < _n; i++) scanf( %I64d , a + i); for (int i = 1, _n = m; i < _n; i++) { if (a[i] == a[i - 1]) continue; vtx[a[i]].push_back(a[i - 1]); vtx[a[i - 1]].push_back(a[i]); sum += abs(a[i] - a[i - 1]); } for (int i = 1, _n = n + 1; i < _n; i++) sort(vtx[i].begin(), vtx[i].end()); long long ans = sum; for (int i = 1, _n = n + 1; i < _n; i++) ans = min(ans, proc(i, sum)); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; long long l = s.length(); long long ans = 0; for (long long i = l - 1; i >= 1; i--) { ans = ans + pow(2, i); } for (long long i = 0; i < l; i++) { if (s[i] == 7 ) { ans = ans + pow(2, l - i - 1); } } cout << ans + 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; class Timer { clock_t start; string name; public: Timer() { name = ; start = clock(); } Timer(string s) { name = s; start = clock(); } ~Timer() { fprintf(stderr, %s: %.3gs n , name.c_str(), 1.0 * (clock() - start) / CLOCKS_PER_SEC); } }; const double EPS = 1e-9; const long double PI = acos(-1.0L); template <typename dtype> inline dtype sq(dtype a) { return a * a; } template <typename dtype1, typename dtype2> inline pair<dtype1, dtype2> mp(dtype1 a, dtype2 b) { return make_pair(a, b); } template <typename dtype1, typename dtype2> inline dtype1 safeMod(dtype1 a, dtype2 m) { return (a % m + m) % m; } template <typename dtype1, typename dtype2> inline bool isEq(dtype1 a, dtype2 b) { return abs(a - b) < EPS; } template <typename dtype1, typename dtype2, typename dtype3> inline bool isEq(dtype1 a, dtype2 b, dtype3 eps) { return abs(a - b) < eps; } template <typename dtype> inline dtype toRad(dtype deg) { return deg * PI / 180.0; } template <typename dtype> inline dtype toDeg(dtype rad) { return rad * 180.0 / PI; } template <typename dtype> inline bool isKthBitOn(dtype n, int k) { assert(n <= numeric_limits<dtype>::max()); assert(k <= numeric_limits<dtype>::digits); dtype ONE = 1; return bool((n & (ONE << k))); } template <typename dtype> inline void setKthBit(dtype& n, int k) { assert(n <= numeric_limits<dtype>::max()); assert(k <= numeric_limits<dtype>::digits); dtype ONE = 1; n = (n | (ONE << k)); } const int oo = 0x3f3f3f3f; const int MAX = 200010; const int MOD = 1000000007; const int precision = 10; int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, s, sum = 0; long long ara[MAX]; cin >> n >> s; long long mini = INT_MAX; for (int i = 0; i < n; i++) { cin >> ara[i]; sum += ara[i]; mini = min(mini, ara[i]); } if (sum < s) cout << -1; else { sum = 0; for (int i = 0; i < n; i++) { sum += ara[i] - mini; } s -= sum; s = max(s, 0LL); mini -= s / n + (s % n != 0); cout << mini << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<int> g[n]; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--, v--; g[v].push_back(u); } int l[n]; for (int i = 0; i < n; i++) l[i] = 0; vector<int> a; for (int i = 0; i < n; i++) { for (auto j : g[i]) l[i] = max(l[i], l[j] + 1); if (l[i] == 2) { l[i] = -1; a.push_back(i); } } cout << a.size() << n ; for (auto i : a) cout << i + 1 << ; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 10005; const int Inf = 1000000000; int n; int a[Maxn]; set<pair<int, int> > S; long long res; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) S.insert(pair<int, int>(i - a[i], i)); for (int i = 0; i < n; i++) { int add = 0, j = 0; set<pair<int, int> >::iterator it = S.begin(); while (j < n - 1) { int nxt = j; while (it != S.end() && j >= it->first - i) { nxt = max(nxt, it->second - i); it++; } j = nxt; add++; } res += add; S.erase(pair<int, int>(-a[i] + i, i)); S.insert(pair<int, int>(n - 1 - a[i] + i + 1, n - 1 + i + 1)); } printf( %I64d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n; long long arr[1005]; long long dp[1005][3 * 10000]; long long add(long long a, long long b) { return ((a % 1000000007) + (b % 1000000007)) % 1000000007; } long long f(long long idx, long long sum) { if (idx == n + 1) { return 0; } if (dp[idx][sum] != -1) return dp[idx][sum]; long long res1 = sum + arr[idx]; long long res2 = sum - arr[idx]; long long val = 0; if (res1 == 10001 || res2 == 10001) val++; long long res = add(f(1 + idx, res1), f(1 + idx, res2)); res = add(res, val); return dp[idx][sum] = res; } int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) scanf( %lld , &arr[i]); memset(dp, -1, sizeof dp); long long ans = 0; for (int i = 1; i <= n; i++) { ans = add(ans, f(i, 10001)); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long md = 998244353; int main() { long long n; cin >> n; vector<long long> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; a[i] *= (n - i) * (i + 1); } for (int i = 0; i < n; i++) cin >> b[i]; sort(a.begin(), a.end()); sort(b.rbegin(), b.rend()); long long ans = 0; for (int i = 0; i < n; i++) (ans += (a[i] % md * b[i] % md) % md) %= md; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; int a[N], c[N]; int ans[N]; struct qq { int x, y, id; } s[N]; int n, Q; bool cmp(qq x, qq y) { return x.y < y.y; } int q[N]; int st, ed, now; double Y(int x) { return a[x] * x - c[x]; } double X(int x) { return -a[x]; } double get_k(int x, int y) { return (double)(Y(x) - Y(y)) / (double)(X(x) - X(y)); } int calc(int xx, int x, int y) { return c[y] - c[xx] + a[xx] * (x - y + xx); } void solve() { st = 1; ed = 0; now = 1; for (int u = 1; u <= n; u++) { while (st <= ed && a[q[ed]] >= a[u]) ed--; while (st < ed && get_k(q[ed - 1], q[ed]) < get_k(q[ed], u)) ed--; q[++ed] = u; while (now <= Q && s[now].y == u) { int l = st, r = ed, lalal; while (l <= r) { int mid = (l + r) >> 1; if (mid == ed || calc(q[mid], s[now].x, s[now].y) < calc(q[mid + 1], s[now].x, s[now].y)) { lalal = mid; r = mid - 1; } else l = mid + 1; } ans[s[now].id] = calc(q[lalal], s[now].x, s[now].y); now++; } } } int read() { char ch = getchar(); int x = 0; while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x; } int main() { n = read(); for (int u = 1; u <= n; u++) { a[u] = read(); c[u] = c[u - 1] + a[u]; } Q = read(); for (int u = 1; u <= Q; u++) { s[u].x = read(); s[u].y = read(); s[u].id = u; } sort(s + 1, s + 1 + Q, cmp); solve(); for (int u = 1; u <= Q; u++) printf( %d n , ans[u]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long MOD = 1000000007; signed main() { cin.tie(0); ios::sync_with_stdio(false); long long N, a, b; cin >> N >> a >> b; vector<long long> A; A.push_back(a); A.push_back(a); A.push_back(a); A.push_back(a); A.push_back(b); A.push_back(b); sort(A.begin(), A.end()); long long res = 100000; long long k = 0; long long tres; do { k = 0; tres = 1; for (long long i = 0; i < A.size(); i++) { k += A[i]; if (k > N) { k = A[i]; tres++; } } res = min(res, tres); } while (next_permutation(A.begin(), A.end())); cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005, S = 100; int L[N], R[N], bel[N], to[N]; long long a[N], b[N], taga[N], tagb[N]; long double slope(int x, int y) { if (a[x] == a[y]) { if (b[x] == b[y]) return 1; return b[x] < b[y] ? 1e18 : -1e18; } return (long double)(b[y] - b[x]) / (a[y] - a[x]); } vector<int> s[N / S + 5]; int pos[N / S + 5]; void build(int x) { for (int i = L[x]; i <= R[x]; i++) b[to[i]] += a[to[i]] * taga[x] + tagb[x]; taga[x] = tagb[x] = 0; s[x].clear(); int top = 0; for (int i = L[x]; i <= R[x]; i++) { while (top > 1 && slope(s[x][top - 2], s[x][top - 1]) <= slope(s[x][top - 1], to[i])) --top, s[x].pop_back(); ++top, s[x].push_back(to[i]); } pos[x] = 0; } inline long long calc(int x) { return a[x] * taga[bel[x]] + b[x] + tagb[bel[x]]; } long long querymax(int x) { while (pos[x] < s[x].size() - 1) { if (calc(s[x][pos[x]]) > calc(s[x][pos[x] + 1])) break; pos[x]++; } return calc(s[x][pos[x]]); } bool cmp(const int& x, const int& y) { return a[x] < a[y]; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]), b[i] = a[i], to[i] = i; for (int i = 1; i <= n; i++) bel[i] = (i - 1) / S + 1; for (int i = 1; i <= bel[n]; i++) L[i] = S * (i - 1) + 1, R[i] = min(S * i, n), sort(to + L[i], to + R[i] + 1, cmp); for (int i = 1; i <= bel[n]; i++) build(i); long long ans = 0; for (int i = 1; i <= n; i++) { long long mx = -1ll << 60ll; int p; for (int j = 1; j <= bel[n]; j++) if (querymax(j) > mx) mx = querymax(j), p = s[j][pos[j]]; if (mx > 0 && p != 0) ans += mx; else break; b[p] = -1ll << 60ll; for (int j = 1; j < bel[p]; j++) tagb[j] += a[p]; for (int j = bel[p] + 1; j <= bel[n]; j++) taga[j]++; for (int j = L[bel[p]]; j < p; j++) b[j] += a[p]; for (int j = p + 1; j <= R[bel[p]]; j++) b[j] += a[j]; build(bel[p]); } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long MOD2 = 998244353; const long long MOD3 = 1812447359; const long long INF = 1ll << 62; const double PI = 2 * asin(1); void yes() { printf( yes n ); } void no() { printf( no n ); } void Yes() { printf( Yes n ); } void No() { printf( No n ); } void YES() { printf( YES n ); } void NO() { printf( NO n ); } struct SegmentTree { vector<int> Tree[21]; void Make() { for (int i = 0; i < 21; i++) { Tree[i].resize(1 << i); } } void Add(int num, int val) { for (int i = 20; i >= 0; i--) { Tree[i][num] += val; num /= 2; } } int Search(int num) { int now = 0, sum = 0; for (int i = 1; i < 21; i++) { now *= 2; if (sum + Tree[i][now] < num) { sum += Tree[i][now]; now++; } } return now; } }; int main() { int N, Q; scanf( %d%d , &N, &Q); SegmentTree T; T.Make(); for (int i = 0; i < N; i++) { int A; scanf( %d , &A); T.Add(A, 1); } for (int i = 0; i < Q; i++) { int K; scanf( %d , &K); if (K > 0) { T.Add(K, 1); } else { int num = T.Search(-1 * K); T.Add(num, -1); } } for (int i = 0; i <= 1e6; i++) { if (T.Tree[20][i] > 0) { cout << i << endl; return 0; } } cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n, m, f[N]; bool vis[2][N]; vector<int> edges[2][N]; void dfs0(int x) { if (vis[0][x]) return; vis[0][x] = 1; for (int to : edges[0][x]) { if (f[to] != 1) dfs0(to); } } void dfs1(int x) { if (vis[1][x]) return; vis[1][x] = 1; if (f[x] == 1) return; for (int to : edges[1][x]) { dfs1(to); } } void solve() { cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> f[i]; } for (int i = 1; i <= m; ++i) { int u, v; cin >> u >> v; edges[0][u].push_back(v); edges[1][v].push_back(u); } for (int i = 1; i <= n; ++i) { if (f[i] == 1) { dfs0(i); } if (f[i] == 2) { dfs1(i); } } for (int i = 1; i <= n; ++i) { cout << (vis[0][i] && vis[1][i]) << ; } } int main() { ios::sync_with_stdio(0); int T = 1; while (T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; int main(); void file() {} void time() {} const int INF = 1e9 + 99; using ll = long long int; using pii = pair<int, int>; using vec = vector<int>; int main() { ios_base::sync_with_stdio(0); ; ll n; cin >> n; vector<ll> v(n); for (ll& x : v) { cin >> x; } sort(v.begin(), v.end()); ll i = 0, j = n - 1; ll x = 0, y = 0; bool ok = false; while (i <= j) { if (ok) { x += v[i]; i++; } else { y += v[j]; j--; } ok ^= 1; } ll ans = x * x + y * y; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const double eps = 1e-8; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const int seed = 131; int n, a[maxn], q; struct node { int l, r, sum, lazy; } Q[maxn << 2]; void build(int rt, int l, int r) { Q[rt].l = l, Q[rt].r = r; if (l == r) { Q[rt].sum = a[l]; return; } int mid = (l + r) / 2; build((rt << 1), l, mid); build(((rt << 1) | 1), mid + 1, r); } inline void pushdown(int rt) { if (Q[(rt << 1)].l == Q[(rt << 1)].r) Q[(rt << 1)].sum = max(Q[(rt << 1)].sum, Q[rt].lazy); else Q[(rt << 1)].lazy = max(Q[(rt << 1)].lazy, Q[rt].lazy); if (Q[((rt << 1) | 1)].l == Q[((rt << 1) | 1)].r) Q[((rt << 1) | 1)].sum = max(Q[((rt << 1) | 1)].sum, Q[rt].lazy); else Q[((rt << 1) | 1)].lazy = max(Q[((rt << 1) | 1)].lazy, Q[rt].lazy); Q[rt].lazy = 0; } void update(int rt, int p, int x) { if (Q[rt].l == Q[rt].r) { Q[rt].sum = x; return; } pushdown(rt); int mid = (Q[rt].l + Q[rt].r) / 2; if (p <= mid) update((rt << 1), p, x); else update(((rt << 1) | 1), p, x); } void show(int rt) { cout << Q[rt].l << << Q[rt].r << n ; } void query(int rt) { if (Q[rt].l == Q[rt].r) { cout << Q[rt].sum; if (Q[rt].l != n) cout << ; else cout << n ; return; } pushdown(rt); query((rt << 1)); query(((rt << 1) | 1)); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); build(1, 1, n); scanf( %d , &q); int op, x, y; for (int i = 1; i <= q; i++) { scanf( %d , &op); if (op == 1) { scanf( %d %d , &x, &y); update(1, x, y); } else { scanf( %d , &x); if (n == 1) Q[1].sum = max(Q[1].sum, x); else if (n > 1 && Q[1].lazy < x) Q[1].lazy = x; } } query(1); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, arr[100], res, maxi, mini, g; int gcd(int a, int b) { for (; b != 0; b = b % a) swap(a, b); return a; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &arr[i]); maxi = g = arr[0]; for (int i = 0; i < n; i++) { maxi = max(maxi, arr[i]); mini = min(mini, arr[i]); g = gcd(g, arr[i]); } res = (maxi / g) - n; if (res & 1) printf( Alice ); else printf( Bob ); } |
#include <bits/stdc++.h> using namespace std; long long fS(long long x) { long long lo = 1, hi = x - 1, cn = 0, ans = -1, out = 1; while (cn <= 80) { if (cn & 1) ans -= (lo + hi) / 2; else ans += (lo + hi) / 2; lo = (lo + hi) / 2 + 1; out = min(out, ans); cn++; } return out; } int main() { int t; cin >> t; while (t--) { long long n; cin >> n; long long start = -fS(n); cout << ? << start << endl; long long tr; cin >> tr; long long lo = 1LL, hi = n - 1LL, cn = 0LL, best = n, ans = start, x; while (lo <= hi) { long long mid = (lo + hi) / 2LL; if (cn & 1) ans -= mid; else ans += mid; cout << ? << ans << endl; cin >> x; if (x) { hi = mid - 1LL; best = mid; } else { lo = mid + 1LL; } cn++; } cout << = << best << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, i, j; cin >> n; long long ans = 0; for (i = 1; i <= n; i++) { for (j = i; j <= n; j++) { k = sqrt(i * i + j * j); if (k * k == i * i + j * j && j <= k && k <= n) { ans++; } } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 2e5 + 5; vector<long long> adj[MAXN]; long long a[MAXN], cnt0[MAXN], cnt1[MAXN]; bool t0[MAXN], t1[MAXN]; bool b[MAXN], c[MAXN]; long long n; void input(); void dfs(long long, long long); void solve(); int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); input(); solve(); return 0; } void input() { cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i] >> b[i] >> c[i]; t1[i] = (b[i] == 0 && c[i] == 1); t0[i] = (b[i] == 1 && c[i] == 0); } for (long long i = 1; i < n; i++) { long long u, v; cin >> u >> v; u--, v--; adj[u].push_back(v); adj[v].push_back(u); } } void dfs(long long u, long long par) { for (auto v : adj[u]) { if (v == par) continue; a[v] = min(a[v], a[u]); dfs(v, u); cnt0[u] += max(0ll, cnt0[v] - cnt1[v]); cnt1[u] += max(0ll, cnt1[v] - cnt0[v]); } cnt0[u] += t0[u]; cnt1[u] += t1[u]; } void solve() { dfs(0, -1); if (cnt0[0] != cnt1[0]) { cout << -1; return; } long long ans = 0; for (long long i = 0; i < n; i++) ans += 2 * min(cnt0[i], cnt1[i]) * a[i]; cout << ans << endl; } |
#include<bits/stdc++.h> using namespace std; struct _field { bool white = false; }; int mod = 998244353; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); //freopen( a.out , w ,stdout); // console output is better (in most cases) #else // add i/o method of specific testing system #endif int n, m; cin >> n >> m; vector<vector<_field>> field(m + 1, vector<_field>(n + 1)); for(int y = 1; y <= n; ++y) { for(int x = 1; x <= m; ++x) { char temp; cin >> temp; if(temp == * ) { field[x][y].white = false; } if(temp == o ) { field[x][y].white = true; } } } long long sol = 0; // value long long v = 0; // value long long h = 0; // combinations that have a half to the left long long e = 0; // combinations that are ended on the left long long c = 1; // #combinations for(int y = 0; y <= n; ++y) { for(int x = 0; x <= m; ++x) { long long nh = 0; long long ne = 0; // count if we match the color nh = (c + e) % mod; ne = h; c = ((c + e) % mod + h) % mod; if(field[x][y].white) { v = ((v * 2) % mod + ne) % mod; } else { nh = 0; ne = 0; } h = nh; e = ne; } } sol = v; int sol1 = v; v = 0; h = 0; // combinations that have a half to the left e = 0; // combinations that are ended on the left c = 1; // black ones for(int x = 0; x <= m; ++x) { for(int y = 0; y <= n; ++y) { long long nh = 0; long long ne = 0; // count if we match the color nh = (c + e) % mod; ne = h; c = ((c + e) % mod + h) % mod; if(field[x][y].white) { v = ((v * 2) % mod + ne) % mod; } else { nh = 0; ne = 0; } h = nh; e = ne; } } int sol2 = v; sol = (sol + v) % mod; //cout << sol1 << n ; //cout << sol2 << n ; cout << sol << n ; return 0; } |
#include <bits/stdc++.h> int fr[182], ne[362], v[362], bs = 0; void addb(int a, int b) { v[bs] = b; ne[bs] = fr[a]; fr[a] = bs++; } int dp[182][182], wz[182], sz[182], cd[182][182], n, k; int fa[182], sd[182], ans[182], zy[362][182]; void dfs0(int u, int f) { fa[u] = f; sd[u] = sd[f] + 1; for (int i = fr[u]; i != -1; i = ne[i]) { if (v[i] != f) dfs0(v[i], u); } } int dfscd(int a, int b) { if (a == b) return 0; if (cd[a][b]) return cd[a][b]; if (sd[a] > sd[b]) cd[a][b] = dfscd(fa[a], b) + 1; else cd[a][b] = dfscd(a, fa[b]) + 1; return cd[a][b]; } void dfs(int u, int f) { for (int i = fr[u]; i != -1; i = ne[i]) { if (v[i] != f) dfs(v[i], u); } for (int a = 1; a <= n; a++) { dp[u][a] = sz[cd[u][a]] + k; for (int i = fr[u]; i != -1; i = ne[i]) { if (v[i] == f) continue; int t = dp[v[i]][wz[v[i]]]; if (dp[v[i]][a] - k < t) { t = dp[v[i]][a] - k; zy[i][a] = a; } else zy[i][a] = wz[v[i]]; dp[u][a] += t; } if (a == 1 || dp[u][a] < dp[u][wz[u]]) wz[u] = a; } } void dfs1(int u, int f, int a) { ans[u] = a; for (int i = fr[u]; i != -1; i = ne[i]) { if (v[i] != f) dfs1(v[i], u, zy[i][a]); } } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) fr[i] = -1; for (int i = 1; i < n; i++) scanf( %d , &sz[i]); for (int i = 0; i < n - 1; i++) { int a, b; scanf( %d%d , &a, &b); addb(a, b); addb(b, a); } dfs0(1, 0); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i != j && cd[i][j] == 0) dfscd(i, j); } } dfs(1, 0); int z = 1; for (int i = 2; i <= n; i++) { if (dp[1][i] < dp[1][z]) z = i; } printf( %d n , dp[1][z]); dfs1(1, 0, z); for (int i = 1; i <= n; i++) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long double EPS = 1e-9; long long cel(long long a, int b) { return ((a - 1) / b + 1); } long long gcd(long long a, long long b) { if (a < b) swap(a, b); return (b == 0) ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } long long po(long long x, long long y) { long long ans = 1; while (y) { if (y & 1) { ans = (ans * x) % 1000000007; } y >>= 1; x = (x * x) % 1000000007; } return ans; } vector<int> v(3000); long long m = 0, n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, x, y, ans = 0; cin >> n; for (int i = 2; i < 1 << (n + 1); i++) cin >> v[i]; for (int i = (1 << n) - 1; i >= 1; i--) { ans += abs(v[i * 2] - v[i * 2 + 1]); v[i] += max(v[i * 2], v[i * 2 + 1]); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; long long l; cin >> n >> l; long double arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); long double ans = arr[0] - 0; for (int i = 1; i < n; i++) { ans = max(ans, (arr[i] - arr[i - 1]) / 2.0); } ans = max(ans, l - arr[n - 1]); cout << fixed << setprecision(10) << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long flag, cnt, j, i, k, powe, count1, count2; long long int n, a, b, c, x, y, m, ans; long long maxy, miny, sum, ann[1000010]; string s, s2; long long mod = 1000000007; int main() { cin >> n; n--; long long arr1[n], arr2[n]; for (i = 0; i < n; i++) { cin >> arr1[i]; if (arr1[i] == 0) i--; } for (i = 0; i < n; i++) { cin >> arr2[i]; if (arr2[i] == 0) i--; } for (i = 0; i < n; i++) { if (arr2[i] == arr1[0]) break; } for (j = 0; j < n; j++) { if (arr1[j] != arr2[(i + j) % n]) { flag = 1; break; } } if (flag == 1) cout << No ; else cout << Yes ; } |
#include <bits/stdc++.h> using namespace std; map<string, string> m; string a = ......... ; inline int judge() { for (int i = 0; i < 3; i++) { if (a[3 * i] != . ) if (a[3 * i] == a[3 * i + 1] && a[3 * i] == a[3 * i + 2]) return 3 * i; if (a[i] != . ) if (a[i] == a[i + 3] && a[i] == a[i + 6]) return i; } if (a[4] == . ) return -1; else if ((a[0] == a[4] && a[4] == a[8]) || (a[2] == a[4] && a[4] == a[6])) return 4; return -1; } void search(int n) { int s; s = judge(); if (s != -1) { m[a] = (a[s] == X ? the first player won : the second player won ); return; } else if (n == 9) { m[a] = draw ; return; } else { m[a] = (n % 2 == 0 ? first : second ); for (int i = 0; i < 9; i++) if (a[i] == . ) { a[i] = (n % 2 == 0 ? X : 0 ); search(n + 1); a[i] = . ; } } } int main() { search(0); string str1, str2, str3; cin >> str1 >> str2 >> str3; a = str1 + str2 + str3; if (m[a] != ) cout << m[a] << endl; else cout << illegal << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int c[100001], s[100001]; int mx, ans, n, nc, ns; int i, j; void checkAns(int k) { if (ns <= 2) { if ((mx - 1) * nc == (i - 1) || mx * (nc - 1) == (i - 1)) { if (s[1] == 1 || s[1] == i || 1 == nc || s[mx] == 1) { ans = i; } } } } int main() { int k; cin >> n; for (i = 1; i <= n; ++i) { cin >> j; k = c[j]; if (k) { s[k]--; if (!s[k]) { ns--; } } else { nc++; } c[j]++; k++; if (!s[k]) { ns++; } s[k]++; if (k > mx) { mx = k; } checkAns(k); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define vi vector<int> #define pi pair<int,int> #define F first #define S second #define pb push_back #define mp make_pair #define FOR for(int i=a;i<b;++i) #define sq(a) (a)*(a) #define vll vector<long long> const int inf=INT_MAX; const ll INF=LLONG_MAX; const int MOD=1000000007; //char-48 int dp[100000]; int main(){ ios::sync_with_stdio(0); cin.tie(0); ll t; cin >> t; while(t--){ ll n, ans=0; cin >> n; vector<ll> v; for(ll i=0;i<n;++i){ ll u; cin >> u; v.pb(u); ans=max(ans,u); } sort(v.begin(), v.end()); ll b=v.size()-1; ll g=b; for(ll i=0; i<b; ++i){ ans+=(v[i]-v[i+1])*(g*(i+1)); --g; } cout << ans << n ; } } //Erase reps // sort(v.begin(), v.end() ); // v.erase(unique(v.begin(), v.end() ), v.end()); //Find something to eliminate // auto i = find(begin(s), end(s), { ); // s.erase(i); |
#include <bits/stdc++.h> using namespace std; int i, t, n, ciel, jiro, aux, a[10005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); for (cin >> t; t; --t) { cin >> n; for (i = 1; i <= n; ++i) { cin >> aux; if (n & 1) if (i == n / 2 + 1) a[++a[0]] = aux; else if (i <= n / 2) ciel += aux; else jiro += aux; else if (i <= n / 2) ciel += aux; else jiro += aux; } } sort(a + 1, a + a[0] + 1); for (i = a[0]; i; --i) if ((a[0] - i) & 1) jiro += a[i]; else ciel += a[i]; cout << ciel << << jiro << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long n, a[10], C[110][110], dp[110][10], ans; inline long long add(long long x, long long y) { x += y; if (x > MOD) x -= MOD; return x; } inline long long mul(long long x, long long y) { x *= y; if (x > MOD) x %= MOD; return x; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios::fixed); cout.precision(20); cin >> n; for (int i = 0; i < 10; ++i) cin >> a[i]; C[0][0] = 1; for (int i = 1; i <= 100; ++i) { C[i][0] = 1; for (int j = 1; j <= i; ++j) C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]); } for (int i = a[9]; i <= n; ++i) dp[i][9] = 1; for (int i = 0; i <= n; ++i) { for (int j = 8; j > 0; --j) for (int k = a[j]; k <= i; ++k) dp[i][j] = add(dp[i][j], mul(dp[i - k][j + 1], C[i][k])); for (int j = a[0]; j < i; ++j) dp[i][0] = add(dp[i][0], mul(dp[i - j][1], C[i - 1][j])); } for (int i = 0; i <= n; ++i) ans = add(ans, dp[i][0]); cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ans, num; scanf( %d , &n); for (int i = 17; i >= 1; i--) { num = (pow(2, i) - 1) * pow(2, i - 1); if (n % num == 0) { ans = num; break; } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int n, a[100000]; long long cost, mn; int main() { cin >> n; for (int i = 0; i < n; ++i) scanf( %d , a + i); sort(a, a + n); for (int i = 0; i < n; ++i) mn += a[i] - 1; if (n > 40) return cout << mn, 0; for (int i = 2; i <= 1e5; ++i) { int k = 0; cost = 0; for (long long j = 1; j <= 1e10 && k < n; j *= i) { cost += abs(a[k++] - j); } if (k == n) mn = min(mn, cost); } cout << mn; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 1e3; long long all[MAXN]; struct node { node *child[2]; node() { child[0] = child[1] = NULL; } }; node *root; deque<short> binary(long long x) { deque<short> ans; while (x) { ans.push_front(x % 2); x /= 2; } while (ans.size() < 50) ans.push_front(0); return ans; } void add(long long x) { deque<short> a = binary(x); node *C = root; while (a.size()) { if (C->child[a[0]] == NULL) C->child[a[0]] = new node; C = C->child[a[0]]; a.pop_front(); } } long long query(long long x) { deque<short> a = binary(x); long long ans = 0; node *C = root; while (a.size()) { if (C->child[1 - a[0]] != NULL) { C = C->child[1 - a[0]]; ans *= 2; ans += 1; } else { C = C->child[a[0]]; ans *= 2; } a.pop_front(); } return ans; } int main() { root = new node; int n; cin >> n; long long xorall = 0; for (int i = 1; i <= n; ++i) { cin >> all[i]; xorall ^= all[i]; } long long maxgot = 0; int ai = 0, bi = 0; long long total = 0; add(total); for (int i = 1; i <= n; ++i) { total ^= all[i]; add(total); maxgot = max(maxgot, query(total ^ xorall)); } cout << fixed << maxgot << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e9 + 7; const long long int INF = 1e10; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; cin >> s; char c = s[0]; long long int a = s[1] - 0 ; long long int ans = 0; for (long long int i = -1; i <= 1; i++) { for (long long int j = -1; j <= 1; j++) { if (i == j && i == 0) continue; if ((char)(c + i) <= h && (char)(c + i) >= a ) { if (a + j >= 1 && a + j <= 8) ans++; } } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; struct UnionFind { vector<int> par; vector<int> rank; vector<int> sz; UnionFind(int n = 0) { if (n > 0) initialize(n); } void initialize(int n) { par.resize(n); rank.resize(n); sz.resize(n); for (int i = 0; i < n; i++) { par[i] = i; rank[i] = 0; sz[i] = 1; } } int find(int x) { if (par[x] == x) { return x; } else { return par[x] = find(par[x]); } } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; if (rank[x] < rank[y]) { par[x] = y; sz[y] += sz[x]; } else { par[y] = x; sz[x] += sz[y]; if (rank[x] == rank[y]) rank[x]++; } } bool same(int x, int y) { return find(x) == find(y); } }; int main() { int N, M; cin >> N >> M; static pair<int64_t, int> A[200000]; for (int i = 0; i < N; i++) { int64_t a; scanf( %lld , &a); A[i] = {a, i}; } vector<vector<int64_t>> edges; for (int i = 0; i < M; i++) { int64_t x, y, w; scanf( %lld %lld %lld , &x, &y, &w); edges.push_back({w, x - 1, y - 1}); } sort(A, A + N); int64_t first = A[0].second; for (int i = 1; i < N; i++) { int64_t j = A[i].second; int64_t cost = A[0].first + A[i].first; edges.push_back({cost, first, j}); } sort(edges.begin(), edges.end()); int64_t ans = 0; UnionFind uf(N); for (auto& v : edges) { int i = v[1], j = v[2]; if (!uf.same(i, j)) { ans += v[0]; uf.unite(i, j); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, k; int n; cin >> n; if (n % 2 == 0) { k = n / 2; cout << k << n ; for (i = 0; i < k; i++) cout << 2 << ; } else { k = (n - 1) / 2; cout << k << n ; for (i = 0; i < k - 1; i++) { cout << 2 << ; } cout << 3 << ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 100 + 5; int n, m, ord[N << 1], nord = 0; vector<int> adj[N << 1], radj[N << 1]; bool vis[N << 1]; int ncmp = 0, cmp[N << 1]; vector<int> ans; inline void addedge(int u, int v) { adj[u].push_back((v > n ? v - n : v + n)); ; radj[(v > n ? v - n : v + n)].push_back(u); ; adj[(u > n ? u - n : u + n)].push_back(v); ; radj[v].push_back((u > n ? u - n : u + n)); ; } inline void dfs(int v) { vis[v] = 1; for (int i = 0; i < (int)adj[v].size(); i++) if (!vis[adj[v][i]]) dfs(adj[v][i]); ord[++nord] = v; } inline void rdfs(int v) { cmp[v] = ncmp; vis[v] = 1; for (int i = 0; i < (int)radj[v].size(); i++) if (!vis[radj[v][i]]) rdfs(radj[v][i]); } int main() { scanf( %d%d , &n, &m); int u, v, c; for (int i = 1; i <= m; i++) { scanf( %d%d%d , &u, &v, &c); if (!c) { addedge(u, v); addedge(v, u); } else { addedge(u, (v > n ? v - n : v + n)); addedge((v > n ? v - n : v + n), u); } } memset(vis, 0, sizeof vis); for (int i = 1; i <= 2 * n; i++) if (!vis[i]) dfs(i); memset(vis, 0, sizeof vis); for (; nord--;) { u = ord[nord]; if (!vis[u]) { ncmp++; rdfs(u); } } for (int i = 1; i <= n; i++) { if (cmp[i] == cmp[i + n]) { printf( Impossible n ); return 0; } if (cmp[i + n] < cmp[i]) ans.push_back(i); ; } printf( %d n , (int)ans.size()); for (int i = 0; i < (int)ans.size(); i++) printf( %d , ans[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long t, n; int main() { cin >> t; vector<int> a; for (int i = 1; i <= 10000; i++) { n = i; vector<int> v; while (n > 0) { v.push_back(n % 10); n = n / 10; } reverse(v.begin(), v.end()); for (int j = 0; j < v.size(); j++) { a.push_back(v[j]); } } for (int i = 0; i < a.size(); i++) { if (i + 1 == t) { cout << a[i]; return 0; } } return 0; } |
#include <bits/stdc++.h> int main() { int i, j = 1, x, k = 0; int c, y; int ar[1000]; char str[500]; scanf( %s , str); for (i = 0; str[i] != 0 ; i++) { x = isdigit(str[i]); if (x != 0) { ar[j] = str[i]; j++; k++; } } int pass; for (pass = 1; pass <= k; pass++) { for (j = 1; j <= k - 1; j++) { if (ar[j] > ar[j + 1]) { c = ar[j]; ar[j] = ar[j + 1]; ar[j + 1] = c; } } } j = 1; for (i = 0; str[i] != 0 ; i++) { y = isdigit(str[i]); { if (y != 0) { str[i] = ar[j]; j++; } } } printf( %s , str); } |
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; int dirx[] = {0, 0, -1, 1}; int diry[] = {-1, 1, 0, 0}; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int test; cin >> test; while (test--) { int len; string path; cin >> len >> path; std::map<pair<long long, long long>, int> visit; long long mn = INF; pair<long long, long long> mnpath{-1, -1}, pos{0, 0}; visit[{0, 0}] = 0; for (int i = 0; i < len; i++) { if (path[i] == L ) pos.first += dirx[0], pos.second += diry[0]; else if (path[i] == R ) pos.first += dirx[1], pos.second += diry[1]; else if (path[i] == U ) pos.first += dirx[2], pos.second += diry[2]; else if (path[i] == D ) pos.first += dirx[3], pos.second += diry[3]; if (visit.find(pos) != visit.end()) { int dis = i - visit[pos] + 1; if (mn >= dis) { mn = dis; mnpath = {visit[pos] + 1, i + 1}; } } visit[pos] = i + 1; } if (mn != INF) cout << mnpath.first << << mnpath.second << endl; else cout << -1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; char s[maxn], t[maxn]; int p[maxn], q[maxn], r[maxn]; int main() { int n, m, k, d; scanf( %s%d , s, &m); n = strlen(s); while (m--) { scanf( %d%d , &k, &d); for (int i = 0; i < n; i++) p[i] = q[i] = i; int id = 0; for (int i = 0; i < d; i++) { for (int j = i; j < k; j += d) p[id++] = j; } int last = p[0]; for (int i = 0; i < n - 1; i++) p[i] = p[i + 1]; p[n - 1] = last; int pw = n - k + 1; while (pw > 0) { if (pw & 1) { for (int i = 0; i < n; i++) r[i] = q[p[i]]; for (int i = 0; i < n; i++) q[i] = r[i]; } for (int i = 0; i < n; i++) r[i] = p[p[i]]; for (int i = 0; i < n; i++) p[i] = r[i]; pw >>= 1; } for (int i = 0; i < n; i++) t[i] = s[q[(k + i - 1) % n]]; for (int i = 0; i < n; i++) s[i] = t[i]; puts(s); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = INT_MAX; const long long int INF = LLONG_MAX; const long long int mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int dp[151][10]; dp[1][0] = 1; dp[2][0] = 2; dp[3][0] = 3; dp[4][0] = 4; dp[5][0] = 5; dp[6][0] = 6; dp[7][0] = 7; dp[8][0] = 8; dp[9][0] = 9; dp[10][0] = 19; dp[11][0] = 29; dp[12][0] = 39; dp[13][0] = 49; dp[14][0] = 59; dp[15][0] = 69; dp[16][0] = 79; dp[17][0] = 89; dp[18][0] = 99; dp[19][0] = 199; dp[20][0] = 299; dp[21][0] = 399; dp[22][0] = 499; dp[23][0] = 599; dp[24][0] = 699; dp[25][0] = 799; dp[26][0] = 899; dp[27][0] = 999; dp[28][0] = 1999; dp[29][0] = 2999; dp[30][0] = 3999; dp[31][0] = 4999; dp[32][0] = 5999; dp[33][0] = 6999; dp[34][0] = 7999; dp[35][0] = 8999; dp[36][0] = 9999; dp[37][0] = 19999; dp[38][0] = 29999; dp[39][0] = 39999; dp[40][0] = 49999; dp[41][0] = 59999; dp[42][0] = 69999; dp[43][0] = 79999; dp[44][0] = 89999; dp[45][0] = 99999; dp[46][0] = 199999; dp[47][0] = 299999; dp[48][0] = 399999; dp[49][0] = 499999; dp[50][0] = 599999; dp[51][0] = 699999; dp[52][0] = 799999; dp[53][0] = 899999; dp[54][0] = 999999; dp[55][0] = 1999999; dp[56][0] = 2999999; dp[57][0] = 3999999; dp[58][0] = 4999999; dp[59][0] = 5999999; dp[60][0] = 6999999; dp[61][0] = 7999999; dp[62][0] = 8999999; dp[63][0] = 9999999; dp[64][0] = 19999999; dp[65][0] = 29999999; dp[66][0] = 39999999; dp[67][0] = 49999999; dp[68][0] = 59999999; dp[69][0] = 69999999; dp[70][0] = 79999999; dp[71][0] = 89999999; dp[72][0] = 99999999; dp[73][0] = 199999999; dp[74][0] = 299999999; dp[75][0] = 399999999; dp[76][0] = 499999999; dp[77][0] = 599999999; dp[78][0] = 699999999; dp[79][0] = 799999999; dp[80][0] = 899999999; dp[81][0] = 999999999; dp[82][0] = 1999999999; dp[83][0] = 2999999999; dp[84][0] = 3999999999; dp[85][0] = 4999999999; dp[86][0] = 5999999999; dp[87][0] = 6999999999; dp[88][0] = 7999999999; dp[89][0] = 8999999999; dp[90][0] = 9999999999; dp[91][0] = 19999999999; dp[92][0] = 29999999999; dp[93][0] = 39999999999; dp[94][0] = 49999999999; dp[95][0] = 59999999999; dp[96][0] = 69999999999; dp[97][0] = 79999999999; dp[98][0] = 89999999999; dp[99][0] = 99999999999; dp[100][0] = 199999999999; dp[101][0] = 299999999999; dp[102][0] = 399999999999; dp[103][0] = 499999999999; dp[104][0] = 599999999999; dp[105][0] = 699999999999; dp[106][0] = 799999999999; dp[107][0] = 899999999999; dp[108][0] = 999999999999; dp[109][0] = 1999999999999; dp[110][0] = 2999999999999; dp[111][0] = 3999999999999; dp[112][0] = 4999999999999; dp[113][0] = 5999999999999; dp[114][0] = 6999999999999; dp[115][0] = 7999999999999; dp[116][0] = 8999999999999; dp[117][0] = 9999999999999; dp[118][0] = 19999999999999; dp[119][0] = 29999999999999; dp[120][0] = 39999999999999; dp[121][0] = 49999999999999; dp[122][0] = 59999999999999; dp[123][0] = 69999999999999; dp[124][0] = 79999999999999; dp[125][0] = 89999999999999; dp[126][0] = 99999999999999; dp[127][0] = 199999999999999; dp[128][0] = 299999999999999; dp[129][0] = 399999999999999; dp[130][0] = 499999999999999; dp[131][0] = 599999999999999; dp[132][0] = 699999999999999; dp[133][0] = 799999999999999; dp[134][0] = 899999999999999; dp[135][0] = 999999999999999; dp[136][0] = 1999999999999999; dp[137][0] = 2999999999999999; dp[138][0] = 3999999999999999; dp[139][0] = 4999999999999999; dp[140][0] = 5999999999999999; dp[141][0] = 6999999999999999; dp[142][0] = 7999999999999999; dp[143][0] = 8999999999999999; dp[144][0] = 9999999999999999; dp[145][0] = 19999999999999999; dp[146][0] = 29999999999999999; dp[147][0] = 39999999999999999; dp[148][0] = 49999999999999999; dp[149][0] = 59999999999999999; dp[150][0] = 69999999999999999; dp[1][1] = 0; dp[2][1] = -1; dp[3][1] = 1; dp[4][1] = -1; dp[5][1] = 2; dp[6][1] = -1; dp[7][1] = 3; dp[8][1] = -1; dp[9][1] = 4; dp[10][1] = 9; dp[11][1] = 5; dp[12][1] = 19; dp[13][1] = 6; dp[14][1] = 29; dp[15][1] = 7; dp[16][1] = 39; dp[17][1] = 8; dp[18][1] = 49; dp[19][1] = 18; dp[20][1] = 59; dp[21][1] = 28; dp[22][1] = 69; dp[23][1] = 38; dp[24][1] = 79; dp[25][1] = 48; dp[26][1] = 89; dp[27][1] = 58; dp[28][1] = 189; dp[29][1] = 68; dp[30][1] = 289; dp[31][1] = 78; dp[32][1] = 389; dp[33][1] = 88; dp[34][1] = 489; dp[35][1] = 98; dp[36][1] = 589; dp[37][1] = 198; dp[38][1] = 689; dp[39][1] = 298; dp[40][1] = 789; dp[41][1] = 398; dp[42][1] = 889; dp[43][1] = 498; dp[44][1] = 989; dp[45][1] = 598; dp[46][1] = 1989; dp[47][1] = 698; dp[48][1] = 2989; dp[49][1] = 798; dp[50][1] = 3989; dp[51][1] = 898; dp[52][1] = 4989; dp[53][1] = 998; dp[54][1] = 5989; dp[55][1] = 1998; dp[56][1] = 6989; dp[57][1] = 2998; dp[58][1] = 7989; dp[59][1] = 3998; dp[60][1] = 8989; dp[61][1] = 4998; dp[62][1] = 9989; dp[63][1] = 5998; dp[64][1] = 19989; dp[65][1] = 6998; dp[66][1] = 29989; dp[67][1] = 7998; dp[68][1] = 39989; dp[69][1] = 8998; dp[70][1] = 49989; dp[71][1] = 9998; dp[72][1] = 59989; dp[73][1] = 19998; dp[74][1] = 69989; dp[75][1] = 29998; dp[76][1] = 79989; dp[77][1] = 39998; dp[78][1] = 89989; dp[79][1] = 49998; dp[80][1] = 99989; dp[81][1] = 59998; dp[82][1] = 199989; dp[83][1] = 69998; dp[84][1] = 299989; dp[85][1] = 79998; dp[86][1] = 399989; dp[87][1] = 89998; dp[88][1] = 499989; dp[89][1] = 99998; dp[90][1] = 599989; dp[91][1] = 199998; dp[92][1] = 699989; dp[93][1] = 299998; dp[94][1] = 799989; dp[95][1] = 399998; dp[96][1] = 899989; dp[97][1] = 499998; dp[98][1] = 999989; dp[99][1] = 599998; dp[100][1] = 1999989; dp[101][1] = 699998; dp[102][1] = 2999989; dp[103][1] = 799998; dp[104][1] = 3999989; dp[105][1] = 899998; dp[106][1] = 4999989; dp[107][1] = 999998; dp[108][1] = 5999989; dp[109][1] = 1999998; dp[110][1] = 6999989; dp[111][1] = 2999998; dp[112][1] = 7999989; dp[113][1] = 3999998; dp[114][1] = 8999989; dp[115][1] = 4999998; dp[116][1] = 9999989; dp[117][1] = 5999998; dp[118][1] = 19999989; dp[119][1] = 6999998; dp[120][1] = 29999989; dp[121][1] = 7999998; dp[122][1] = 39999989; dp[123][1] = 8999998; dp[124][1] = 49999989; dp[125][1] = 9999998; dp[126][1] = 59999989; dp[127][1] = 19999998; dp[128][1] = 69999989; dp[129][1] = 29999998; dp[130][1] = 79999989; dp[131][1] = 39999998; dp[132][1] = 89999989; dp[133][1] = 49999998; dp[134][1] = 99999989; dp[135][1] = 59999998; dp[136][1] = 199999989; dp[137][1] = 69999998; dp[138][1] = 299999989; dp[139][1] = 79999998; dp[140][1] = 399999989; dp[141][1] = 89999998; dp[142][1] = 499999989; dp[143][1] = 99999998; dp[144][1] = 599999989; dp[145][1] = 199999998; dp[146][1] = 699999989; dp[147][1] = 299999998; dp[148][1] = 799999989; dp[149][1] = 399999998; dp[150][1] = 899999989; dp[1][2] = -1; dp[2][2] = -1; dp[3][2] = 0; dp[4][2] = -1; dp[5][2] = -1; dp[6][2] = 1; dp[7][2] = -1; dp[8][2] = -1; dp[9][2] = 2; dp[10][2] = -1; dp[11][2] = -1; dp[12][2] = 3; dp[13][2] = -1; dp[14][2] = -1; dp[15][2] = 4; dp[16][2] = -1; dp[17][2] = -1; dp[18][2] = 5; dp[19][2] = -1; dp[20][2] = -1; dp[21][2] = 6; dp[22][2] = -1; dp[23][2] = -1; dp[24][2] = 7; dp[25][2] = -1; dp[26][2] = -1; dp[27][2] = 17; dp[28][2] = -1; dp[29][2] = -1; dp[30][2] = 27; dp[31][2] = -1; dp[32][2] = -1; dp[33][2] = 37; dp[34][2] = -1; dp[35][2] = -1; dp[36][2] = 47; dp[37][2] = -1; dp[38][2] = -1; dp[39][2] = 57; dp[40][2] = -1; dp[41][2] = -1; dp[42][2] = 67; dp[43][2] = -1; dp[44][2] = -1; dp[45][2] = 77; dp[46][2] = -1; dp[47][2] = -1; dp[48][2] = 87; dp[49][2] = -1; dp[50][2] = -1; dp[51][2] = 97; dp[52][2] = -1; dp[53][2] = -1; dp[54][2] = 197; dp[55][2] = -1; dp[56][2] = -1; dp[57][2] = 297; dp[58][2] = -1; dp[59][2] = -1; dp[60][2] = 397; dp[61][2] = -1; dp[62][2] = -1; dp[63][2] = 497; dp[64][2] = -1; dp[65][2] = -1; dp[66][2] = 597; dp[67][2] = -1; dp[68][2] = -1; dp[69][2] = 697; dp[70][2] = -1; dp[71][2] = -1; dp[72][2] = 797; dp[73][2] = -1; dp[74][2] = -1; dp[75][2] = 897; dp[76][2] = -1; dp[77][2] = -1; dp[78][2] = 997; dp[79][2] = -1; dp[80][2] = -1; dp[81][2] = 1997; dp[82][2] = -1; dp[83][2] = -1; dp[84][2] = 2997; dp[85][2] = -1; dp[86][2] = -1; dp[87][2] = 3997; dp[88][2] = -1; dp[89][2] = -1; dp[90][2] = 4997; dp[91][2] = -1; dp[92][2] = -1; dp[93][2] = 5997; dp[94][2] = -1; dp[95][2] = -1; dp[96][2] = 6997; dp[97][2] = -1; dp[98][2] = -1; dp[99][2] = 7997; dp[100][2] = -1; dp[101][2] = -1; dp[102][2] = 8997; dp[103][2] = -1; dp[104][2] = -1; dp[105][2] = 9997; dp[106][2] = -1; dp[107][2] = -1; dp[108][2] = 19997; dp[109][2] = -1; dp[110][2] = -1; dp[111][2] = 29997; dp[112][2] = -1; dp[113][2] = -1; dp[114][2] = 39997; dp[115][2] = -1; dp[116][2] = -1; dp[117][2] = 49997; dp[118][2] = -1; dp[119][2] = -1; dp[120][2] = 59997; dp[121][2] = -1; dp[122][2] = -1; dp[123][2] = 69997; dp[124][2] = -1; dp[125][2] = -1; dp[126][2] = 79997; dp[127][2] = -1; dp[128][2] = -1; dp[129][2] = 89997; dp[130][2] = -1; dp[131][2] = -1; dp[132][2] = 99997; dp[133][2] = -1; dp[134][2] = -1; dp[135][2] = 199997; dp[136][2] = -1; dp[137][2] = -1; dp[138][2] = 299997; dp[139][2] = -1; dp[140][2] = -1; dp[141][2] = 399997; dp[142][2] = -1; dp[143][2] = -1; dp[144][2] = 499997; dp[145][2] = -1; dp[146][2] = -1; dp[147][2] = 599997; dp[148][2] = -1; dp[149][2] = -1; dp[150][2] = 699997; dp[1][3] = -1; dp[2][3] = -1; dp[3][3] = -1; dp[4][3] = -1; dp[5][3] = -1; dp[6][3] = 0; dp[7][3] = -1; dp[8][3] = -1; dp[9][3] = -1; dp[10][3] = 1; dp[11][3] = -1; dp[12][3] = -1; dp[13][3] = -1; dp[14][3] = 2; dp[15][3] = 9; dp[16][3] = -1; dp[17][3] = -1; dp[18][3] = 3; dp[19][3] = 19; dp[20][3] = 8; dp[21][3] = -1; dp[22][3] = 4; dp[23][3] = 29; dp[24][3] = 18; dp[25][3] = 7; dp[26][3] = 5; dp[27][3] = 39; dp[28][3] = 28; dp[29][3] = 17; dp[30][3] = 6; dp[31][3] = 49; dp[32][3] = 38; dp[33][3] = 27; dp[34][3] = 16; dp[35][3] = 59; dp[36][3] = 48; dp[37][3] = 37; dp[38][3] = 26; dp[39][3] = 69; dp[40][3] = 58; dp[41][3] = 47; dp[42][3] = 36; dp[43][3] = 79; dp[44][3] = 68; dp[45][3] = 57; dp[46][3] = 46; dp[47][3] = 89; dp[48][3] = 78; dp[49][3] = 67; dp[50][3] = 56; dp[51][3] = 189; dp[52][3] = 88; dp[53][3] = 77; dp[54][3] = 66; dp[55][3] = 289; dp[56][3] = 188; dp[57][3] = 87; dp[58][3] = 76; dp[59][3] = 389; dp[60][3] = 288; dp[61][3] = 187; dp[62][3] = 86; dp[63][3] = 489; dp[64][3] = 388; dp[65][3] = 287; dp[66][3] = 96; dp[67][3] = 589; dp[68][3] = 488; dp[69][3] = 387; dp[70][3] = 196; dp[71][3] = 689; dp[72][3] = 588; dp[73][3] = 487; dp[74][3] = 296; dp[75][3] = 789; dp[76][3] = 688; dp[77][3] = 587; dp[78][3] = 396; dp[79][3] = 889; dp[80][3] = 788; dp[81][3] = 687; dp[82][3] = 496; dp[83][3] = 989; dp[84][3] = 888; dp[85][3] = 787; dp[86][3] = 596; dp[87][3] = 1989; dp[88][3] = 988; dp[89][3] = 887; dp[90][3] = 696; dp[91][3] = 2989; dp[92][3] = 1988; dp[93][3] = 987; dp[94][3] = 796; dp[95][3] = 3989; dp[96][3] = 2988; dp[97][3] = 1987; dp[98][3] = 896; dp[99][3] = 4989; dp[100][3] = 3988; dp[101][3] = 2987; dp[102][3] = 996; dp[103][3] = 5989; dp[104][3] = 4988; dp[105][3] = 3987; dp[106][3] = 1996; dp[107][3] = 6989; dp[108][3] = 5988; dp[109][3] = 4987; dp[110][3] = 2996; dp[111][3] = 7989; dp[112][3] = 6988; dp[113][3] = 5987; dp[114][3] = 3996; dp[115][3] = 8989; dp[116][3] = 7988; dp[117][3] = 6987; dp[118][3] = 4996; dp[119][3] = 9989; dp[120][3] = 8988; dp[121][3] = 7987; dp[122][3] = 5996; dp[123][3] = 19989; dp[124][3] = 9988; dp[125][3] = 8987; dp[126][3] = 6996; dp[127][3] = 29989; dp[128][3] = 19988; dp[129][3] = 9987; dp[130][3] = 7996; dp[131][3] = 39989; dp[132][3] = 29988; dp[133][3] = 19987; dp[134][3] = 8996; dp[135][3] = 49989; dp[136][3] = 39988; dp[137][3] = 29987; dp[138][3] = 9996; dp[139][3] = 59989; dp[140][3] = 49988; dp[141][3] = 39987; dp[142][3] = 19996; dp[143][3] = 69989; dp[144][3] = 59988; dp[145][3] = 49987; dp[146][3] = 29996; dp[147][3] = 79989; dp[148][3] = 69988; dp[149][3] = 59987; dp[150][3] = 39996; dp[1][4] = -1; dp[2][4] = -1; dp[3][4] = -1; dp[4][4] = -1; dp[5][4] = -1; dp[6][4] = -1; dp[7][4] = -1; dp[8][4] = -1; dp[9][4] = -1; dp[10][4] = 0; dp[11][4] = -1; dp[12][4] = -1; dp[13][4] = -1; dp[14][4] = -1; dp[15][4] = 1; dp[16][4] = -1; dp[17][4] = -1; dp[18][4] = -1; dp[19][4] = 9; dp[20][4] = 2; dp[21][4] = -1; dp[22][4] = -1; dp[23][4] = 8; dp[24][4] = 19; dp[25][4] = 3; dp[26][4] = -1; dp[27][4] = 7; dp[28][4] = 18; dp[29][4] = 29; dp[30][4] = 4; dp[31][4] = 6; dp[32][4] = 17; dp[33][4] = 28; dp[34][4] = 39; dp[35][4] = 5; dp[36][4] = 16; dp[37][4] = 27; dp[38][4] = 38; dp[39][4] = 49; dp[40][4] = 15; dp[41][4] = 26; dp[42][4] = 37; dp[43][4] = 48; dp[44][4] = 59; dp[45][4] = 25; dp[46][4] = 36; dp[47][4] = 47; dp[48][4] = 58; dp[49][4] = 69; dp[50][4] = 35; dp[51][4] = 46; dp[52][4] = 57; dp[53][4] = 68; dp[54][4] = 79; dp[55][4] = 45; dp[56][4] = 56; dp[57][4] = 67; dp[58][4] = 78; dp[59][4] = 89; dp[60][4] = 55; dp[61][4] = 66; dp[62][4] = 77; dp[63][4] = 88; dp[64][4] = 189; dp[65][4] = 65; dp[66][4] = 76; dp[67][4] = 87; dp[68][4] = 188; dp[69][4] = 289; dp[70][4] = 75; dp[71][4] = 86; dp[72][4] = 187; dp[73][4] = 288; dp[74][4] = 389; dp[75][4] = 85; dp[76][4] = 186; dp[77][4] = 287; dp[78][4] = 388; dp[79][4] = 489; dp[80][4] = 95; dp[81][4] = 286; dp[82][4] = 387; dp[83][4] = 488; dp[84][4] = 589; dp[85][4] = 195; dp[86][4] = 386; dp[87][4] = 487; dp[88][4] = 588; dp[89][4] = 689; dp[90][4] = 295; dp[91][4] = 486; dp[92][4] = 587; dp[93][4] = 688; dp[94][4] = 789; dp[95][4] = 395; dp[96][4] = 586; dp[97][4] = 687; dp[98][4] = 788; dp[99][4] = 889; dp[100][4] = 495; dp[101][4] = 686; dp[102][4] = 787; dp[103][4] = 888; dp[104][4] = 989; dp[105][4] = 595; dp[106][4] = 786; dp[107][4] = 887; dp[108][4] = 988; dp[109][4] = 1989; dp[110][4] = 695; dp[111][4] = 886; dp[112][4] = 987; dp[113][4] = 1988; dp[114][4] = 2989; dp[115][4] = 795; dp[116][4] = 986; dp[117][4] = 1987; dp[118][4] = 2988; dp[119][4] = 3989; dp[120][4] = 895; dp[121][4] = 1986; dp[122][4] = 2987; dp[123][4] = 3988; dp[124][4] = 4989; dp[125][4] = 995; dp[126][4] = 2986; dp[127][4] = 3987; dp[128][4] = 4988; dp[129][4] = 5989; dp[130][4] = 1995; dp[131][4] = 3986; dp[132][4] = 4987; dp[133][4] = 5988; dp[134][4] = 6989; dp[135][4] = 2995; dp[136][4] = 4986; dp[137][4] = 5987; dp[138][4] = 6988; dp[139][4] = 7989; dp[140][4] = 3995; dp[141][4] = 5986; dp[142][4] = 6987; dp[143][4] = 7988; dp[144][4] = 8989; dp[145][4] = 4995; dp[146][4] = 6986; dp[147][4] = 7987; dp[148][4] = 8988; dp[149][4] = 9989; dp[150][4] = 5995; dp[1][5] = -1; dp[2][5] = -1; dp[3][5] = -1; dp[4][5] = -1; dp[5][5] = -1; dp[6][5] = -1; dp[7][5] = -1; dp[8][5] = -1; dp[9][5] = -1; dp[10][5] = -1; dp[11][5] = -1; dp[12][5] = -1; dp[13][5] = -1; dp[14][5] = -1; dp[15][5] = 0; dp[16][5] = -1; dp[17][5] = -1; dp[18][5] = -1; dp[19][5] = -1; dp[20][5] = -1; dp[21][5] = 1; dp[22][5] = -1; dp[23][5] = -1; dp[24][5] = 9; dp[25][5] = -1; dp[26][5] = -1; dp[27][5] = 2; dp[28][5] = -1; dp[29][5] = -1; dp[30][5] = 7; dp[31][5] = -1; dp[32][5] = -1; dp[33][5] = 3; dp[34][5] = -1; dp[35][5] = -1; dp[36][5] = 5; dp[37][5] = -1; dp[38][5] = -1; dp[39][5] = 4; dp[40][5] = -1; dp[41][5] = -1; dp[42][5] = 15; dp[43][5] = -1; dp[44][5] = -1; dp[45][5] = 14; dp[46][5] = -1; dp[47][5] = -1; dp[48][5] = 25; dp[49][5] = -1; dp[50][5] = -1; dp[51][5] = 24; dp[52][5] = -1; dp[53][5] = -1; dp[54][5] = 35; dp[55][5] = -1; dp[56][5] = -1; dp[57][5] = 34; dp[58][5] = -1; dp[59][5] = -1; dp[60][5] = 45; dp[61][5] = -1; dp[62][5] = -1; dp[63][5] = 44; dp[64][5] = -1; dp[65][5] = -1; dp[66][5] = 55; dp[67][5] = -1; dp[68][5] = -1; dp[69][5] = 54; dp[70][5] = -1; dp[71][5] = -1; dp[72][5] = 65; dp[73][5] = -1; dp[74][5] = -1; dp[75][5] = 64; dp[76][5] = -1; dp[77][5] = -1; dp[78][5] = 75; dp[79][5] = -1; dp[80][5] = -1; dp[81][5] = 74; dp[82][5] = -1; dp[83][5] = -1; dp[84][5] = 85; dp[85][5] = -1; dp[86][5] = -1; dp[87][5] = 84; dp[88][5] = -1; dp[89][5] = -1; dp[90][5] = 185; dp[91][5] = -1; dp[92][5] = -1; dp[93][5] = 94; dp[94][5] = -1; dp[95][5] = -1; dp[96][5] = 285; dp[97][5] = -1; dp[98][5] = -1; dp[99][5] = 194; dp[100][5] = -1; dp[101][5] = -1; dp[102][5] = 385; dp[103][5] = -1; dp[104][5] = -1; dp[105][5] = 294; dp[106][5] = -1; dp[107][5] = -1; dp[108][5] = 485; dp[109][5] = -1; dp[110][5] = -1; dp[111][5] = 394; dp[112][5] = -1; dp[113][5] = -1; dp[114][5] = 585; dp[115][5] = -1; dp[116][5] = -1; dp[117][5] = 494; dp[118][5] = -1; dp[119][5] = -1; dp[120][5] = 685; dp[121][5] = -1; dp[122][5] = -1; dp[123][5] = 594; dp[124][5] = -1; dp[125][5] = -1; dp[126][5] = 785; dp[127][5] = -1; dp[128][5] = -1; dp[129][5] = 694; dp[130][5] = -1; dp[131][5] = -1; dp[132][5] = 885; dp[133][5] = -1; dp[134][5] = -1; dp[135][5] = 794; dp[136][5] = -1; dp[137][5] = -1; dp[138][5] = 985; dp[139][5] = -1; dp[140][5] = -1; dp[141][5] = 894; dp[142][5] = -1; dp[143][5] = -1; dp[144][5] = 1985; dp[145][5] = -1; dp[146][5] = -1; dp[147][5] = 994; dp[148][5] = -1; dp[149][5] = -1; dp[150][5] = 2985; dp[1][6] = -1; dp[2][6] = -1; dp[3][6] = -1; dp[4][6] = -1; dp[5][6] = -1; dp[6][6] = -1; dp[7][6] = -1; dp[8][6] = -1; dp[9][6] = -1; dp[10][6] = -1; dp[11][6] = -1; dp[12][6] = -1; dp[13][6] = -1; dp[14][6] = -1; dp[15][6] = -1; dp[16][6] = -1; dp[17][6] = -1; dp[18][6] = -1; dp[19][6] = -1; dp[20][6] = -1; dp[21][6] = 0; dp[22][6] = -1; dp[23][6] = -1; dp[24][6] = -1; dp[25][6] = -1; dp[26][6] = -1; dp[27][6] = -1; dp[28][6] = 1; dp[29][6] = -1; dp[30][6] = 9; dp[31][6] = -1; dp[32][6] = 8; dp[33][6] = -1; dp[34][6] = 7; dp[35][6] = 2; dp[36][6] = 6; dp[37][6] = 19; dp[38][6] = 5; dp[39][6] = 18; dp[40][6] = 4; dp[41][6] = 17; dp[42][6] = 3; dp[43][6] = 16; dp[44][6] = 29; dp[45][6] = 15; dp[46][6] = 28; dp[47][6] = 14; dp[48][6] = 27; dp[49][6] = 13; dp[50][6] = 26; dp[51][6] = 39; dp[52][6] = 25; dp[53][6] = 38; dp[54][6] = 24; dp[55][6] = 37; dp[56][6] = 23; dp[57][6] = 36; dp[58][6] = 49; dp[59][6] = 35; dp[60][6] = 48; dp[61][6] = 34; dp[62][6] = 47; dp[63][6] = 33; dp[64][6] = 46; dp[65][6] = 59; dp[66][6] = 45; dp[67][6] = 58; dp[68][6] = 44; dp[69][6] = 57; dp[70][6] = 43; dp[71][6] = 56; dp[72][6] = 69; dp[73][6] = 55; dp[74][6] = 68; dp[75][6] = 54; dp[76][6] = 67; dp[77][6] = 53; dp[78][6] = 66; dp[79][6] = 79; dp[80][6] = 65; dp[81][6] = 78; dp[82][6] = 64; dp[83][6] = 77; dp[84][6] = 63; dp[85][6] = 76; dp[86][6] = 89; dp[87][6] = 75; dp[88][6] = 88; dp[89][6] = 74; dp[90][6] = 87; dp[91][6] = 73; dp[92][6] = 86; dp[93][6] = 189; dp[94][6] = 85; dp[95][6] = 188; dp[96][6] = 84; dp[97][6] = 187; dp[98][6] = 83; dp[99][6] = 186; dp[100][6] = 289; dp[101][6] = 185; dp[102][6] = 288; dp[103][6] = 184; dp[104][6] = 287; dp[105][6] = 93; dp[106][6] = 286; dp[107][6] = 389; dp[108][6] = 285; dp[109][6] = 388; dp[110][6] = 284; dp[111][6] = 387; dp[112][6] = 193; dp[113][6] = 386; dp[114][6] = 489; dp[115][6] = 385; dp[116][6] = 488; dp[117][6] = 384; dp[118][6] = 487; dp[119][6] = 293; dp[120][6] = 486; dp[121][6] = 589; dp[122][6] = 485; dp[123][6] = 588; dp[124][6] = 484; dp[125][6] = 587; dp[126][6] = 393; dp[127][6] = 586; dp[128][6] = 689; dp[129][6] = 585; dp[130][6] = 688; dp[131][6] = 584; dp[132][6] = 687; dp[133][6] = 493; dp[134][6] = 686; dp[135][6] = 789; dp[136][6] = 685; dp[137][6] = 788; dp[138][6] = 684; dp[139][6] = 787; dp[140][6] = 593; dp[141][6] = 786; dp[142][6] = 889; dp[143][6] = 785; dp[144][6] = 888; dp[145][6] = 784; dp[146][6] = 887; dp[147][6] = 693; dp[148][6] = 886; dp[149][6] = 989; dp[150][6] = 885; dp[1][7] = -1; dp[2][7] = -1; dp[3][7] = -1; dp[4][7] = -1; dp[5][7] = -1; dp[6][7] = -1; dp[7][7] = -1; dp[8][7] = -1; dp[9][7] = -1; dp[10][7] = -1; dp[11][7] = -1; dp[12][7] = -1; dp[13][7] = -1; dp[14][7] = -1; dp[15][7] = -1; dp[16][7] = -1; dp[17][7] = -1; dp[18][7] = -1; dp[19][7] = -1; dp[20][7] = -1; dp[21][7] = -1; dp[22][7] = -1; dp[23][7] = -1; dp[24][7] = -1; dp[25][7] = -1; dp[26][7] = -1; dp[27][7] = -1; dp[28][7] = 0; dp[29][7] = -1; dp[30][7] = -1; dp[31][7] = -1; dp[32][7] = -1; dp[33][7] = -1; dp[34][7] = -1; dp[35][7] = -1; dp[36][7] = 1; dp[37][7] = 9; dp[38][7] = 8; dp[39][7] = 7; dp[40][7] = 6; dp[41][7] = 5; dp[42][7] = 4; dp[43][7] = 3; dp[44][7] = 2; dp[45][7] = 19; dp[46][7] = 18; dp[47][7] = 17; dp[48][7] = 16; dp[49][7] = 15; dp[50][7] = 14; dp[51][7] = 13; dp[52][7] = 12; dp[53][7] = 29; dp[54][7] = 28; dp[55][7] = 27; dp[56][7] = 26; dp[57][7] = 25; dp[58][7] = 24; dp[59][7] = 23; dp[60][7] = 22; dp[61][7] = 39; dp[62][7] = 38; dp[63][7] = 37; dp[64][7] = 36; dp[65][7] = 35; dp[66][7] = 34; dp[67][7] = 33; dp[68][7] = 32; dp[69][7] = 49; dp[70][7] = 48; dp[71][7] = 47; dp[72][7] = 46; dp[73][7] = 45; dp[74][7] = 44; dp[75][7] = 43; dp[76][7] = 42; dp[77][7] = 59; dp[78][7] = 58; dp[79][7] = 57; dp[80][7] = 56; dp[81][7] = 55; dp[82][7] = 54; dp[83][7] = 53; dp[84][7] = 52; dp[85][7] = 69; dp[86][7] = 68; dp[87][7] = 67; dp[88][7] = 66; dp[89][7] = 65; dp[90][7] = 64; dp[91][7] = 63; dp[92][7] = 62; dp[93][7] = 79; dp[94][7] = 78; dp[95][7] = 77; dp[96][7] = 76; dp[97][7] = 75; dp[98][7] = 74; dp[99][7] = 73; dp[100][7] = 72; dp[101][7] = 89; dp[102][7] = 88; dp[103][7] = 87; dp[104][7] = 86; dp[105][7] = 85; dp[106][7] = 84; dp[107][7] = 83; dp[108][7] = 82; dp[109][7] = 189; dp[110][7] = 188; dp[111][7] = 187; dp[112][7] = 186; dp[113][7] = 185; dp[114][7] = 184; dp[115][7] = 183; dp[116][7] = 92; dp[117][7] = 289; dp[118][7] = 288; dp[119][7] = 287; dp[120][7] = 286; dp[121][7] = 285; dp[122][7] = 284; dp[123][7] = 283; dp[124][7] = 192; dp[125][7] = 389; dp[126][7] = 388; dp[127][7] = 387; dp[128][7] = 386; dp[129][7] = 385; dp[130][7] = 384; dp[131][7] = 383; dp[132][7] = 292; dp[133][7] = 489; dp[134][7] = 488; dp[135][7] = 487; dp[136][7] = 486; dp[137][7] = 485; dp[138][7] = 484; dp[139][7] = 483; dp[140][7] = 392; dp[141][7] = 589; dp[142][7] = 588; dp[143][7] = 587; dp[144][7] = 586; dp[145][7] = 585; dp[146][7] = 584; dp[147][7] = 583; dp[148][7] = 492; dp[149][7] = 689; dp[150][7] = 688; dp[1][8] = -1; dp[2][8] = -1; dp[3][8] = -1; dp[4][8] = -1; dp[5][8] = -1; dp[6][8] = -1; dp[7][8] = -1; dp[8][8] = -1; dp[9][8] = -1; dp[10][8] = -1; dp[11][8] = -1; dp[12][8] = -1; dp[13][8] = -1; dp[14][8] = -1; dp[15][8] = -1; dp[16][8] = -1; dp[17][8] = -1; dp[18][8] = -1; dp[19][8] = -1; dp[20][8] = -1; dp[21][8] = -1; dp[22][8] = -1; dp[23][8] = -1; dp[24][8] = -1; dp[25][8] = -1; dp[26][8] = -1; dp[27][8] = -1; dp[28][8] = -1; dp[29][8] = -1; dp[30][8] = -1; dp[31][8] = -1; dp[32][8] = -1; dp[33][8] = -1; dp[34][8] = -1; dp[35][8] = -1; dp[36][8] = 0; dp[37][8] = -1; dp[38][8] = -1; dp[39][8] = -1; dp[40][8] = -1; dp[41][8] = -1; dp[42][8] = -1; dp[43][8] = -1; dp[44][8] = -1; dp[45][8] = 1; dp[46][8] = -1; dp[47][8] = -1; dp[48][8] = -1; dp[49][8] = -1; dp[50][8] = -1; dp[51][8] = -1; dp[52][8] = -1; dp[53][8] = -1; dp[54][8] = 11; dp[55][8] = -1; dp[56][8] = -1; dp[57][8] = -1; dp[58][8] = -1; dp[59][8] = -1; dp[60][8] = -1; dp[61][8] = -1; dp[62][8] = -1; dp[63][8] = 21; dp[64][8] = -1; dp[65][8] = -1; dp[66][8] = -1; dp[67][8] = -1; dp[68][8] = -1; dp[69][8] = -1; dp[70][8] = -1; dp[71][8] = -1; dp[72][8] = 31; dp[73][8] = -1; dp[74][8] = -1; dp[75][8] = -1; dp[76][8] = -1; dp[77][8] = -1; dp[78][8] = -1; dp[79][8] = -1; dp[80][8] = -1; dp[81][8] = 41; dp[82][8] = -1; dp[83][8] = -1; dp[84][8] = -1; dp[85][8] = -1; dp[86][8] = -1; dp[87][8] = -1; dp[88][8] = -1; dp[89][8] = -1; dp[90][8] = 51; dp[91][8] = -1; dp[92][8] = -1; dp[93][8] = -1; dp[94][8] = -1; dp[95][8] = -1; dp[96][8] = -1; dp[97][8] = -1; dp[98][8] = -1; dp[99][8] = 61; dp[100][8] = -1; dp[101][8] = -1; dp[102][8] = -1; dp[103][8] = -1; dp[104][8] = -1; dp[105][8] = -1; dp[106][8] = -1; dp[107][8] = -1; dp[108][8] = 71; dp[109][8] = -1; dp[110][8] = -1; dp[111][8] = -1; dp[112][8] = -1; dp[113][8] = -1; dp[114][8] = -1; dp[115][8] = -1; dp[116][8] = -1; dp[117][8] = 81; dp[118][8] = -1; dp[119][8] = -1; dp[120][8] = -1; dp[121][8] = -1; dp[122][8] = -1; dp[123][8] = -1; dp[124][8] = -1; dp[125][8] = -1; dp[126][8] = 91; dp[127][8] = -1; dp[128][8] = -1; dp[129][8] = -1; dp[130][8] = -1; dp[131][8] = -1; dp[132][8] = -1; dp[133][8] = -1; dp[134][8] = -1; dp[135][8] = 191; dp[136][8] = -1; dp[137][8] = -1; dp[138][8] = -1; dp[139][8] = -1; dp[140][8] = -1; dp[141][8] = -1; dp[142][8] = -1; dp[143][8] = -1; dp[144][8] = 291; dp[145][8] = -1; dp[146][8] = -1; dp[147][8] = -1; dp[148][8] = -1; dp[149][8] = -1; dp[150][8] = -1; dp[1][9] = -1; dp[2][9] = -1; dp[3][9] = -1; dp[4][9] = -1; dp[5][9] = -1; dp[6][9] = -1; dp[7][9] = -1; dp[8][9] = -1; dp[9][9] = -1; dp[10][9] = -1; dp[11][9] = -1; dp[12][9] = -1; dp[13][9] = -1; dp[14][9] = -1; dp[15][9] = -1; dp[16][9] = -1; dp[17][9] = -1; dp[18][9] = -1; dp[19][9] = -1; dp[20][9] = -1; dp[21][9] = -1; dp[22][9] = -1; dp[23][9] = -1; dp[24][9] = -1; dp[25][9] = -1; dp[26][9] = -1; dp[27][9] = -1; dp[28][9] = -1; dp[29][9] = -1; dp[30][9] = -1; dp[31][9] = -1; dp[32][9] = -1; dp[33][9] = -1; dp[34][9] = -1; dp[35][9] = -1; dp[36][9] = -1; dp[37][9] = -1; dp[38][9] = -1; dp[39][9] = -1; dp[40][9] = -1; dp[41][9] = -1; dp[42][9] = -1; dp[43][9] = -1; dp[44][9] = -1; dp[45][9] = 0; dp[46][9] = 1; dp[47][9] = 2; dp[48][9] = 3; dp[49][9] = 4; dp[50][9] = 5; dp[51][9] = 6; dp[52][9] = 7; dp[53][9] = 8; dp[54][9] = 9; dp[55][9] = 10; dp[56][9] = 11; dp[57][9] = 12; dp[58][9] = 13; dp[59][9] = 14; dp[60][9] = 15; dp[61][9] = 16; dp[62][9] = 17; dp[63][9] = 18; dp[64][9] = 19; dp[65][9] = 20; dp[66][9] = 21; dp[67][9] = 22; dp[68][9] = 23; dp[69][9] = 24; dp[70][9] = 25; dp[71][9] = 26; dp[72][9] = 27; dp[73][9] = 28; dp[74][9] = 29; dp[75][9] = 30; dp[76][9] = 31; dp[77][9] = 32; dp[78][9] = 33; dp[79][9] = 34; dp[80][9] = 35; dp[81][9] = 36; dp[82][9] = 37; dp[83][9] = 38; dp[84][9] = 39; dp[85][9] = 40; dp[86][9] = 41; dp[87][9] = 42; dp[88][9] = 43; dp[89][9] = 44; dp[90][9] = 45; dp[91][9] = 46; dp[92][9] = 47; dp[93][9] = 48; dp[94][9] = 49; dp[95][9] = 50; dp[96][9] = 51; dp[97][9] = 52; dp[98][9] = 53; dp[99][9] = 54; dp[100][9] = 55; dp[101][9] = 56; dp[102][9] = 57; dp[103][9] = 58; dp[104][9] = 59; dp[105][9] = 60; dp[106][9] = 61; dp[107][9] = 62; dp[108][9] = 63; dp[109][9] = 64; dp[110][9] = 65; dp[111][9] = 66; dp[112][9] = 67; dp[113][9] = 68; dp[114][9] = 69; dp[115][9] = 70; dp[116][9] = 71; dp[117][9] = 72; dp[118][9] = 73; dp[119][9] = 74; dp[120][9] = 75; dp[121][9] = 76; dp[122][9] = 77; dp[123][9] = 78; dp[124][9] = 79; dp[125][9] = 80; dp[126][9] = 81; dp[127][9] = 82; dp[128][9] = 83; dp[129][9] = 84; dp[130][9] = 85; dp[131][9] = 86; dp[132][9] = 87; dp[133][9] = 88; dp[134][9] = 89; dp[135][9] = 90; dp[136][9] = 181; dp[137][9] = 182; dp[138][9] = 183; dp[139][9] = 184; dp[140][9] = 185; dp[141][9] = 186; dp[142][9] = 187; dp[143][9] = 188; dp[144][9] = 189; dp[145][9] = 190; dp[146][9] = 281; dp[147][9] = 282; dp[148][9] = 283; dp[149][9] = 284; dp[150][9] = 285; int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; cout << dp[n][k] << endl; } cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int b[n]; int ans[2 * n]; for (long long i = 0; i < n; i++) cin >> b[i]; set<int> a; for (long long i = 0; i < 2 * n; i++) a.insert(i + 1); for (long long i = 0; i < n; i++) { ans[2 * i] = b[i]; a.erase(b[i]); } bool poss = true; for (long long i = 0; i < n; i++) { set<int>::iterator up = upper_bound(a.begin(), a.end(), b[i]); if (up != a.end()) { ans[2 * i + 1] = *up; a.erase(up); } else { cout << -1 << n ; poss = false; break; } } if (poss) { for (long long i = 0; i < 2 * n - 1; i++) cout << ans[i] << ; cout << ans[2 * n - 1] << n ; } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops,no-stack-protector ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 3005; map<int, vector<int> > dif; vector<int> mod[8]; int a[N]; int n; template <class C, class F> struct Mcmf { static constexpr F eps = (F)1e-9; struct Edge { int u, v, inv; F cap, flow; C cost; Edge(int u, int v, C cost, F cap, int inv) : u(u), v(v), cost(cost), cap(cap), flow(0), inv(inv) {} }; int second, t, tm, n, m = 0; vector<vector<Edge> > g; vector<Edge*> prev; vector<C> cost; vector<int> state; Mcmf(int n, int ss = -1, int tt = -1) : n(n), g(n + 5), cost(n + 5), state(n + 5), prev(n + 5) { second = n + 1; tm = n + 2; t = n + 3; } void add(int u, int v, C cost, F cap) { g[u].push_back(Edge(u, v, cost, cap, int(g[v].size()))); g[v].push_back(Edge(v, u, -cost, 0, int(g[u].size()) - 1)); m += 2; } bool bfs() { fill(begin(state), end(state), 2); fill(begin(cost), end(cost), numeric_limits<C>::max()); fill(begin(prev), end(prev), nullptr); deque<int> qu; qu.push_back(second); state[second] = 1, cost[second] = 0; while (int(qu.size())) { int u = qu.front(); qu.pop_front(); state[u] = 0; for (Edge& e : g[u]) if (e.cap - e.flow > eps) if (cost[u] + e.cost < cost[e.v]) { cost[e.v] = cost[u] + e.cost; prev[e.v] = &e; if (state[e.v] == 0 || (int(qu.size()) && cost[qu.front()] > cost[e.v])) qu.push_front(e.v); else if (state[e.v] == 2) qu.push_back(e.v); state[e.v] = 1; } } return cost[t] != numeric_limits<C>::max(); } pair<C, F> minCostFlow() { C cost = 0; F flow = 0; while (bfs()) { F nflow = numeric_limits<F>::max(); for (Edge* e = prev[t]; e != nullptr; e = prev[e->u]) nflow = min(nflow, e->cap - e->flow); for (Edge* e = prev[t]; e != nullptr; e = prev[e->u]) { e->flow += nflow; g[e->v][e->inv].flow -= nflow; cost += e->cost * nflow; } flow += nflow; } return make_pair(cost, flow); } }; int main() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); cin >> n; for (auto i = (0) - ((0) > (n)); i != n - ((0) > (n)); i += 1 - 2 * ((0) > (n))) cin >> a[i]; Mcmf<int, int> mcmf(2 * n); for (auto i = (0) - ((0) > (n)); i != n - ((0) > (n)); i += 1 - 2 * ((0) > (n))) { mcmf.add(mcmf.second, (i), 0, 1); mcmf.add((i), (n + (i)), -1, 1); mcmf.add((n + (i)), mcmf.tm, 0, 1); for (auto j = (i + 1) - ((i + 1) > (n)); j != n - ((i + 1) > (n)); j += 1 - 2 * ((i + 1) > (n))) if (a[i] % 7 == a[j] % 7 || abs(a[i] - a[j]) <= 1) mcmf.add((n + (i)), (j), 0, 1); } mcmf.add(mcmf.tm, mcmf.t, 0, 4); auto best = mcmf.minCostFlow(); ; cout << -best.first << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int max_length = 1e6; int a_cnt[max_length]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; cin >> s; long long b = 0; long long ans = 0; int n = s.size(); for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == a && b != 0) { ans += b; ans %= mod; b = b * 2; b %= mod; } else if (s[i] == b ) b++; } cout << ans % mod; } |
#include <bits/stdc++.h> using namespace std; int main() { int no_of_cards; scanf( %d , &no_of_cards); vector<int> card(no_of_cards); for (int i = 0; i < no_of_cards; i++) scanf( %d , &card[i]); if (no_of_cards == 1) { printf( -1 n ); return 0; } vector<int> new_cards; if (no_of_cards == 2 && (card[0] != card[1]) && (card[0] + card[1]) % 2 == 0) { new_cards.push_back((card[0] + card[1]) / 2); } sort((card).begin(), (card).end()); int min_difference = card[1] - card[0]; for (int i = 2; i < no_of_cards; i++) min_difference = min(min_difference, card[i] - card[i - 1]); int ap_possible = true, new_middle_cards = 0; for (int i = 1; i < no_of_cards; i++) { if (card[i] - card[i - 1] != min_difference) { if (card[i] - card[i - 1] == 2 * min_difference) { new_middle_cards++; } else { ap_possible = false; } } } if (ap_possible) { if (min_difference == 0) { new_cards.push_back(card[0]); } else if (new_middle_cards == 0) { new_cards.push_back(card[0] - min_difference); new_cards.push_back(card[no_of_cards - 1] + min_difference); } else if (new_middle_cards == 1) { for (int i = 1; i < no_of_cards; i++) if (card[i] - card[i - 1] == 2 * min_difference) new_cards.push_back(card[i - 1] + min_difference); } } sort((new_cards).begin(), (new_cards).end()); printf( %d n , new_cards.size()); for (int i = 0; i < new_cards.size(); i++) printf( %d , new_cards[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int dmap[45][45]; int ans[45]; int dans[45]; int nans, zans; void dfs(int dn) { if (dn == n + 1) { if (nans > zans) { zans = nans; } return; } int mark = 0; for (int i = 1; i < dn; i++) if (ans[i] == 1 && dmap[i][dn] == 0) mark = 1; if (mark == 0) { ans[dn] = 1; nans++; dfs(dn + 1); nans--; } if (nans + n - dn > zans) { ans[dn] = 0; dfs(dn + 1); } return; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf( %d , &dmap[i][j]); nans = 0; zans = 0; dfs(1); double zzans = zans; printf( %lf n , (zzans - 1) / zzans / 2 * m * m); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.