func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int n; pair<pair<int, int>, int> p[200005]; int t[200005], ans[2000005], a[200005]; void san() { for (int i = 1; i <= n; ++i) t[i] = p[i].first.first; sort(t + 1, t + 1 + n); for (int i = 1; i <= n; ++i) p[i].first.first = lower_bound(t + 1, t + 1 + n, p[i].first.first) - t; } bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { return a.first.second < b.first.second; } void add(int x) { while (x <= n) { a[x]++; x += x & (-x); } } int getSum(int x) { int res = 0; while (x >= 1) { res += a[x]; x -= x & (-x); } return res; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , &p[i].first.first, &p[i].first.second); p[i].second = i; } san(); sort(p + 1, p + 1 + n, cmp); for (int i = 1; i <= n; ++i) { ans[p[i].second] = i - 1 - getSum(p[i].first.first); add(p[i].first.first); } for (int i = 1; i <= n; ++i) printf( %d n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string x, y, z; cin >> x; cin >> y; cin >> z; x += y; sort(x.begin(), x.end()); sort(z.begin(), z.end()); if (x.length() != z.length()) cout << NO << n ; else { for (int i = 0; i < x.length(); i++) { if (x[i] != z[i]) { cout << NO << n ; return 0; } } cout << YES << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 510; int n, k; int a[MAX], b[MAX]; void init() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; cin >> k; for (int i = 1; i <= k; i++) cin >> b[i]; } bool valid(int i, int l, int r) { int x = i, y = i, sum = a[i]; while (true) { int old_x = x, old_y = y; while (x - 1 >= l && sum > a[x - 1]) { x--; sum += a[x]; } while (y + 1 <= r && sum > a[y + 1]) { y++; sum += a[y]; } if (old_x == x && old_y == y) break; } return x == l && y == r; } void print(int i, int l, int r) { int x = i, y = i, sum = a[i]; while (true) { int old_x = x, old_y = y; while (x - 1 >= l && sum > a[x - 1]) { cout << x << L << n ; x--; sum += a[x]; } while (y + 1 <= r && sum > a[y + 1]) { cout << x << R << n ; y++; sum += a[y]; } if (old_x == x && old_y == y) break; } } void process() { vector<pair<int, pair<int, int> > > p; bool found = true; int l, r = n, pb = k; while (r >= 1 && pb >= 1) { l = r; int sum = a[r]; while (l - 1 >= 1 && a[l - 1] + sum <= b[pb]) { l--; sum += a[l]; } if (sum == b[pb]) { bool exist = false; for (int i = l; i <= r; i++) if (valid(i, l, r)) { exist = true; p.push_back(make_pair(i, make_pair(l, r))); break; } if (exist) { sum = 0; pb--; } else { found = false; break; } } else { found = false; break; } r = l - 1; } if (r != 0 || pb != 0) found = false; if (!found) cout << NO ; else { cout << YES << n ; for (int i = 0; i < (int)p.size(); i++) print(p[i].first, p[i].second.first, p[i].second.second); } } int main() { ios_base::sync_with_stdio(false); init(); process(); }
|
#include <bits/stdc++.h> using namespace std; template <class T> void debug(T a, T b) { ; } template <class T> void chmin(T& a, const T& b) { if (a > b) a = b; } template <class T> void chmax(T& a, const T& b) { if (a < b) a = b; } namespace std { template <class S, class T> ostream& operator<<(ostream& out, const pair<S, T>& a) { out << ( << a.first << , << a.second << ) ; return out; } } // namespace std long long int readL() { long long int res; scanf( %I64d , &res); return res; } void printL(long long int res) { printf( %I64d , res); } int n, m, n2; int g[2005][2005]; int order[2005], low[2005], cnt; stack<int> cur; int group[2005], gcnt; int dfs(int v, int p) { order[v] = cnt++; low[v] = order[v]; cur.push(v); for (int i = 0; i < (n); ++i) if (g[v][i]) { int to = i; if (to == p) continue; if (order[to] != -1) { low[v] = min(low[v], order[to]); } else { low[v] = min(low[v], dfs(to, v)); } } if (low[v] < order[v]) return low[v]; while (!cur.empty() && cur.top() != v) { group[cur.top()] = gcnt; cur.pop(); } group[cur.top()] = gcnt; cur.pop(); ++gcnt; return low[v]; } vector<int> g2[2005]; int size[2005]; int subsize[2005]; void prep(int v, int p) { subsize[v] = size[v]; for (auto to : g2[v]) { if (to == p) continue; prep(to, v); subsize[v] += subsize[to]; } } bool tmp[4005]; int dfs2(int v, int p) { int res = 0; for (auto to : g2[v]) { if (to == p) continue; res += dfs2(to, v); } if (p != -1) { res += size[v] * (subsize[v] - size[v]); } else { res += size[v] * (subsize[v] - size[v]); int sub = subsize[v] - size[v]; memset((tmp), 0, sizeof(tmp)); tmp[0] = true; for (auto to : g2[v]) { for (int j = n2; j >= 0; --j) if (tmp[j]) tmp[j + subsize[to]] = true; } int maxi = -1; for (int i = 0; i < (n2 + 1); ++i) if (tmp[i]) chmax(maxi, i * (sub - i)); res += maxi; } return res; } int main() { cin >> n >> m; for (int i = 0; i < (m); ++i) { int a, b; scanf( %d%d , &a, &b); --a; --b; g[a][b] = g[b][a] = 1; } memset(order, -1, sizeof(order)); dfs(0, -1); n2 = n; ; ; debug(group, group + n); for (int i = 0; i < (n); ++i) { size[group[i]]++; for (int j = 0; j < (n); ++j) if (g[i][j] && group[i] != group[j] && i > j) { g2[group[i]].push_back(group[j]); g2[group[j]].push_back(group[i]); } }; ; n = gcnt; for (int i = 0; i < (n); ++i) debug((g2[i]).begin(), (g2[i]).end()); int res = 0; for (int i = 0; i < (n); ++i) { prep(i, -1); bool fail = 0; for (auto to : g2[i]) if (subsize[to] * 2 > n2) { fail = 1; } if (!fail) { int tmp = dfs2(i, -1); chmax(res, tmp); } } for (int i = 0; i < (n); ++i) res += size[i] * size[i]; cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[2 * 50004]; int main(void) { int n, k; cin >> n >> k; for (int i = 1; i <= 2 * n; i++) { a[i] = i; } for (int i = 1; i <= k; i++) { swap(a[2 * i], a[2 * i - 1]); } for (int i = 1; i <= 2 * n; i++) { cout << a[i] << ; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int dx[5] = {0, -1, 1, 0, 0}, dy[5] = {0, 0, 0, -1, 1}; int n, m, k, i, j, dis[2005][2005], vis[2005][2005], s1, s2; bool check(int x, int y, int d, bool f = 0) { int i, l = max(1, x - d), r = min(n, x + d); if (f) l = s1; for (i = l; i <= r; i++) { int t = d - abs(x - i); if (i >= 1 && i <= n && y - t >= 1 && y - t <= m && !vis[i][y - t]) { s1 = i; s2 = y - t; return 1; } if (i >= 1 && i <= n && y + t >= 1 && y + t <= m && !vis[i][y + t]) { s1 = i; s2 = y + t; return 1; } } return 0; } int main() { scanf( %d%d%d , &n, &m, &k); int lx = -1, ly = -1; while (k--) { int x, y; scanf( %d%d , &x, &y); for (i = max(1, x - 5); i <= min(n, x + 5); i++) { for (j = max(1, y - 5); j <= min(m, y + 5); j++) { dis[x][y] = max(dis[x][y], dis[i][j] - abs(i - x) - abs(j - y)); } } if (x == lx && y == ly) { if (!check(x, y, dis[x][y], 1)) while (!check(x, y, dis[x][y])) dis[x][y]++; } else while (!check(x, y, dis[x][y])) dis[x][y]++; vis[s1][s2] = 1; printf( %d %d n , s1, s2); lx = x; ly = y; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int n, m; cin >> n >> m; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } cout << 0 ; vector<int> cnt(110, 0); cnt[a[0]]++; for (int w = 1; w < n; ++w) { int s = a[w]; int k = 0; for (int i = 1; i <= 100; ++i) { if (s + i * cnt[i] <= m) { s += i * cnt[i]; k += cnt[i]; } else { int l = -1, r = cnt[i] + 1; while (r - l > 1) { int mid = (l + r) / 2; if (s + i * mid <= m) { l = mid; } else { r = mid; } } k += l; break; } } cout << w - k << ; cnt[a[w]]++; } }
|
#include <bits/stdc++.h> const int N = 100010; using namespace std; namespace YKY { inline int rnd() { int res = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { res = res * 10 + ch - 0 ; ch = getchar(); } return res * f; } inline void wr(int x) { if (x < 0) { putchar( - ); x = -x; } if (x > 9) wr(x / 10); putchar(x % 10 + 0 ); } char s[N]; int n, m, k; int Main() { n = rnd(); m = rnd(); k = rnd(); scanf( %s , s + 1); m = m + k; for (int i = 1, opt, l, r, c; i <= m; i++) { opt = rnd(); l = rnd(); r = rnd(); c = rnd(); if (opt == 1) memset(s + l, c + 0 , r - l + 1); else puts(memcmp(s + l, s + l + c, r - l - c + 1) ? NO : YES ); } return 0; } } // namespace YKY int main() { return YKY ::Main(); }
|
#include <bits/stdc++.h> using namespace std; struct point { int x, y; bool operator<(const point &other) const { return x <= other.x && y <= other.y; } }; map<int, set<point> > m; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { point p; scanf( %d %d , &p.x, &p.y); m[p.y - p.x].insert(p); } vector<point> v; bool ok = true; for (int i = 0; i < n; i++) { int d; scanf( %d , &d); if (m.find(d) == m.end()) ok = false; else if (m[d].size() == 0) ok = false; else { v.push_back(*m[d].begin()); m[d].erase(m[d].begin()); } } if ((int)v.size() != n || !ok) { printf( NO ); return 0; } for (int i = 1; i < v.size(); i++) { if (v[i] < v[i - 1]) { printf( NO n ); return 0; } } printf( YES n ); for (int i = 0; i < v.size(); i++) { printf( %d %d n , v[i].x, v[i].y); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int a[maxn]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); if (n > min(m, k)) printf( No n ); else printf( Yes n ); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = (x << 1) + (x << 3) + ch - 0 ; return x * f; } const int N = 250025; const int M = 1e6 + 10; int n, m, k, w0, w1, tot; int u[M], nex[M], a[5]; int h[N], b[N], deep[N], fa[N]; void addedge(int w0, int w1) { u[++tot] = w1; nex[tot] = h[w0]; h[w0] = tot; } void dfs(int w, int depth) { if (depth > w1) w0 = w; deep[w] = depth; bool leaf = true; for (int i = h[w]; i; i = nex[i]) if (!deep[u[i]]) { fa[u[i]] = w; dfs(u[i], depth + 1); leaf = false; } if (leaf) b[tot++] = w; } int main() { n = read(); m = read(); k = read(); while (m--) { w0 = read(); w1 = read(); addedge(w0, w1); addedge(w1, w0); } w1 = n / k; w0 = tot = 0; fa[1] = 1; dfs(1, 1); if (w0) { printf( PATH n%d n , deep[w0]); for (; w0 != 1; w0 = fa[w0]) printf( %d , w0); printf( 1 n ); } else { printf( CYCLES n ); for (int i = 0; i < k; i++) { int j = h[w0 = b[i]]; tot = 0; for (int cnt = 3; cnt; j = nex[j], cnt--) if (u[j] != fa[w0]) a[tot++] = u[j]; if ((deep[w0] - deep[a[0]] + 1) % 3 != 0) { printf( %d n , deep[w0] - deep[a[0]] + 1); for (; w0 != a[0]; w0 = fa[w0]) printf( %d , w0); printf( %d n , a[0]); } else if ((deep[w0] - deep[a[1]] + 1) % 3 != 0) { printf( %d n , deep[w0] - deep[a[1]] + 1); for (; w0 != a[1]; w0 = fa[w0]) printf( %d , w0); printf( %d n , a[1]); } else { if (deep[a[0]] < deep[a[1]]) swap(a[0], a[1]); printf( %d n , deep[a[0]] - deep[a[1]] + 2); printf( %d , w0); for (w0 = a[0]; w0 != a[1]; w0 = fa[w0]) printf( %d , w0); printf( %d n , a[1]); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int cur; bool c[1011][1011]; int x[33], y[33], z[33]; void connect(int target, int between) { for (int i = (1), _b = (between); i <= _b; i++) z[i] = ++cur; z[between + 1] = target; z[0] = 1; for (int i = (0), _b = (between); i <= _b; i++) c[z[i]][z[i + 1]] = true; } int main() { int n; while (cin >> n) { memset(c, 0, sizeof c); cur = 2; for (int i = (1), _b = (30); i <= _b; i++) x[i] = ++cur; for (int i = (1), _b = (30); i <= _b; i++) y[i] = ++cur; c[x[30]][2] = c[y[30]][2] = true; for (int i = (1), _b = (29); i <= _b; i++) { c[x[i]][x[i + 1]] = true; c[y[i]][y[i + 1]] = true; c[y[i]][x[i + 1]] = true; c[x[i]][y[i + 1]] = true; } for (int i = (29), _b = (0); i >= _b; i--) if ((1 << i) <= n) { n -= 1 << i; connect(x[30 - i], 30 - i - 1); } cout << cur << endl; for (int i = (1), _b = (cur); i <= _b; i++) { for (int j = (1), _b = (cur); j <= _b; j++) if (c[i][j] || c[j][i]) putchar( Y ); else putchar( N ); puts( ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int t; cin >> t; bool even; bool odd; for (int i = 1; i <= t; i++) { int size; even = false; odd = false; cin >> size; int arr[size]; for (int j = 0; j < size; j++) cin >> arr[j]; for (int j = 0; j < size; j++) if (arr[j] % 2 == 0) even = true; else odd = true; if (even == true && odd == true) cout << YES << endl; else if (even == false && size % 2 != 0) cout << YES << endl; else cout << NO << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using vint = vector<int>; using pint = pair<int, int>; using vpint = vector<pint>; template <typename A, typename B> inline void chmin(A& a, B b) { if (a > b) a = b; } template <typename A, typename B> inline void chmax(A& a, B b) { if (a < b) a = b; } template <class A, class B> ostream& operator<<(ostream& ost, const pair<A, B>& p) { ost << { << p.first << , << p.second << } ; return ost; } template <class T> ostream& operator<<(ostream& ost, const vector<T>& v) { ost << { ; for (int i = 0; i < v.size(); i++) { if (i) ost << , ; ost << v[i]; } ost << } ; return ost; } struct Cactus { vector<vector<int>> G; vector<vector<int>> cs; vector<int> vis, par, dep; void dfs(int v) { vis[v] = 1; for (auto u : G[v]) { if (!vis[u]) { par[u] = v; dep[u] = dep[v] + 1; dfs(u); } else if (dep[u] < dep[v]) { int w = v; vector<int> c{w}; while (true) { w = par[w]; c.push_back(w); if (w == u) break; } cs.push_back(c); } } } Cactus(const vector<vector<int>>& G) : G(G) { vis.resize(G.size()); par.resize(G.size()); dep.resize(G.size()); dfs(0); } }; int N, M; int A[555555], B[555555]; int info[555555]; int dp[555555]; int memA[555555], memB[555555]; signed main() { scanf( %d%d , &N, &M); vint lis; vector<vint> G(N); map<pint, int> edgeID; for (int i = 0; i < (M); i++) { scanf( %d%d , &A[i], &B[i]); A[i]--; B[i]--; G[A[i]].push_back(B[i]); G[B[i]].push_back(A[i]); edgeID[{A[i], B[i]}] = i; edgeID[{B[i], A[i]}] = i; } Cactus cac(G); fill_n(info, M, -1); for (auto c : cac.cs) { if (c.size() == 2) continue; vint id; for (int i = 0; i < (c.size()); i++) { int a = c[i]; int b = c[(i + 1) % c.size()]; id.push_back(edgeID[{a, b}]); } rotate(id.begin(), min_element((id).begin(), (id).end()), id.end()); int m = max_element((id).begin(), (id).end()) - id.begin(); bool ok = true; for (int i = 0; i < m; i++) if (id[i] > id[i + 1]) ok = false; for (int i = m; i + 1 < id.size(); i++) if (id[i] < id[i + 1]) ok = false; if (!ok) continue; info[id[0]] = id[m]; } for (int i = 0; i < (N); i++) dp[i] = 1; for (int i = M - 1; i >= 0; i--) { int addA = dp[B[i]]; int addB = dp[A[i]]; if (info[i] != -1) { int k = info[i]; int tmp = memA[k] + memB[k]; addA -= tmp; addB -= tmp; } memA[i] = dp[A[i]]; memB[i] = dp[B[i]]; dp[A[i]] += addA; dp[B[i]] += addB; } for (int i = 0; i < (N); i++) dp[i]--; for (int i = 0; i < (N); i++) { if (i) printf( ); printf( %d , dp[i]); } puts( ); return 0; }
|
#include <bits/stdc++.h> const int mod = 1000000007; using namespace std; pair<int, int> a[12345]; vector<int> ans[3]; map<pair<int, int>, bool> used; map<int, int> cnts; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { scanf( %d , &a[i].first); a[i].second = i + 1; cnts[a[i].first]++; } int x = 0, y = 0; for (map<int, int>::iterator it = cnts.begin(); it != cnts.end(); ++it) { if (it->second >= 3) y++; else { if (it->second == 2) { x++; } } } if (x >= 2 || y >= 1) { puts( YES ); sort(a, a + n); for (int i = 0; i < n; ++i) { ans[0].push_back(a[i].second); if (i != n) { used[make_pair(i, i + 1)] = false; used[make_pair(i + 1, i)] = false; } } int temp; for (int i = 0; i < n - 1; ++i) { if (!used[make_pair(i, i + 1)] && a[i].first == a[i + 1].first) { temp = a[i].second; a[i].second = a[i + 1].second; a[i + 1].second = temp; used[make_pair(i, i + 1)] = true; used[make_pair(i + 1, i)] = true; break; } } for (int i = 0; i < n; ++i) { ans[1].push_back(a[i].second); } for (int i = 0; i < n - 1; ++i) { if (!used[make_pair(i, i + 1)] && a[i].first == a[i + 1].first) { temp = a[i].second; a[i].second = a[i + 1].second; a[i + 1].second = temp; used[make_pair(i, i + 1)] = true; used[make_pair(i + 1, i)] = true; break; } } for (int i = 0; i < n; ++i) { ans[2].push_back(a[i].second); } for (int i = 0; i < 3; ++i) { for (int j = 0; j < ans[i].size(); ++j) { printf( %d , ans[i][j]); } printf( n ); } } else { cout << NO << endl; return 0; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void max_swap(T& a, const T& b) { a = max(a, b); } template <class T> void min_swap(T& a, const T& b) { a = min(a, b); } const double EPS = 1e-8; const double PI = acos(-1.0); const int dx[] = {0, 1, 0, -1}; const int dy[] = {1, 0, -1, 0}; bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; } int main() { ios::sync_with_stdio(false); string s, t; cin >> s >> t; int n = s.size(), m = t.size(); static int dp[5555][5555]; const int mod = 1000000007; for (int i = 0; i < n; ++i) { int sum = 0; for (int j = 0; j < m; ++j) { if (s[i] == t[j]) { (dp[i + 1][j + 1] += sum + 1) %= mod; } (sum += dp[i][j + 1]) %= mod; } } int res = 0; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) (res += dp[i + 1][j + 1]) %= mod; cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, m; char block[][3][4] = {{ ### , .#. , .#. }, { #.. , ### , #.. }, { .#. , .#. , ### }, { ..# , ### , ..# }}; int cell[10][10], anscell[10][10]; int bcnt, ans; bool isPlacable(int i, int j, int k) { for (int p = 0; p < 3; ++p) for (int q = 0; q < 3; ++q) { if (cell[i + p][j + q] != -1 && block[k][p][q] == # ) return false; } return true; } void setBlock(int i, int j, int k) { for (int p = 0; p < 3; ++p) for (int q = 0; q < 3; ++q) { if (block[k][p][q] == # ) cell[i + p][j + q] = bcnt; } ++bcnt; } void removeBlock(int i, int j, int k) { for (int p = 0; p < 3; ++p) for (int q = 0; q < 3; ++q) { if (block[k][p][q] == # ) cell[i + p][j + q] = -1; } --bcnt; } void go(int i, int j) { if (j >= m - 2) { go(i + 1, 0); return; } if (i == n - 2) { if (ans < bcnt) { ans = bcnt; memcpy(anscell, cell, sizeof(cell)); } return; } if (bcnt + (n * m - (i * m + j)) / 6 <= ans) { return; } for (int k = 0; k < 4; ++k) { if (isPlacable(i, j, k)) { setBlock(i, j, k); go(i, j + (k == 3 ? 3 : 2)); removeBlock(i, j, k); } } go(i, j + 1); } int main() { memset(cell, -1, sizeof(cell)); memset(anscell, -1, sizeof(anscell)); scanf( %d %d , &n, &m); if (n >= 3 && m >= 3) go(0, 0); printf( %d n , ans); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { putchar(anscell[i][j] == -1 ? . : ( A + anscell[i][j])); } putchar( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, o = 0, e = 0; cin >> n; for (i = 0; i < n; i = i + 1) { long long int x; cin >> x; if (x % 2 == 0) e = e + 1; else o = o + 1; } long long int res = min(o, e); o = o - res; res = res + (o / 3); cout << res << endl; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); 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; } }; const long long N = 1e5 + 5; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; string s; cin >> s; vector<long long> pref(n + 2), suff(n + 2); for (long long i = 1; i <= n; i++) { if (s[i - 1] == G ) { pref[i] = 1; pref[i] += pref[i - 1]; } } for (long long i = n; i >= 1; i--) { if (s[i - 1] == G ) { suff[i] = 1; suff[i] += suff[i + 1]; } } long long ans = 0; long long cnt = 0; for (long long i = 1; i <= n; i++) { if (s[i - 1] == G ) cnt++; ans = max(ans, pref[i]); } for (long long i = 1; i <= n; i++) { if (s[i - 1] == S ) { if (i == 4) { debug() << [ << pref[i - 1] : << (pref[i - 1]) << ] [ << suff[i + 1] : << (suff[i + 1]) << ] ; } if (pref[i - 1] + suff[i + 1] < cnt) ans = max(ans, pref[i - 1] + suff[i + 1] + 1); else if (pref[i - 1] + suff[i + 1] == cnt) { ans = max(ans, pref[i - 1] + suff[i + 1]); } } } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using cd = complex<ld>; int query(int l, int r) { cout << ? << l << << r << endl; cin >> l; return l; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> sums; for (int i = 1; i < n; i++) { sums.push_back(query(i, i + 1)); } int sum123 = query(1, 3); vector<int> a(n); int a2 = sums[0] + sums[1] - sum123; a[0] = sums[0] - a2; a[1] = a2; for (int i = 2; i < n; i++) { a[i] = sums[i - 1] - a[i - 1]; } cout << ! ; for (int x : a) { cout << x << ; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long ar[100009], f[100009], b[100009], fl = 1; map<long long, long long> mb, mf; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; for (long long i = 1; i <= n; i++) { cin >> f[i]; mf[f[i]]++; ar[f[i]] = i; } for (long long i = 1; i <= m; i++) { cin >> b[i]; mb[b[i]]++; } for (auto pp : mb) { long long x = pp.first; if (mf[x] == 0) { cout << Impossible << endl; return 0; } if (mf[x] != 1) fl = 0; } if (!fl) cout << Ambiguity << endl; else { cout << Possible << endl; for (long long i = 1; i <= m; i++) { long long x = b[i]; cout << ar[x] << ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i, x = 0; scanf( %d , &n); for (i = 2; i <= n / 2; i += 2) { if ((n - i) % 2 == 0 && i / 2 != (n - i) / 2) x++; } printf( %d n , x); }
|
#include <bits/stdc++.h> using namespace std; vector<long long> foo; long long add = 0; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { int k; cin >> k; foo.push_back(k); } cout << n + 1 << n ; for (int i = foo.size() - 1; i >= 0; i--) { foo[i] += add; foo[i] %= n; int q = i - foo[i] + n; add += q; cout << 1 << << i + 1 << << q << n ; } cout << 2 << << n << << n; return 0; }
|
#include <bits/stdc++.h> int main() { int a, b, c, d, num, e; int flag = 1; scanf( %d , &num); num++; while (1) { e = num; a = num % 10; num = num / 10; b = num % 10; num = num / 10; c = num % 10; d = num / 10; if (a != b && a != c && a != d && b != c && b != d && c != d) { break; } else { e++; num = e; } } printf( %d , e); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int MMAX = 1e4 + 7; const int MAXDEG = 55; long long v[MAXDEG][MMAX]; vector<long long int> revs = {0}; void rev_begin() { vector<long long int> y; long long t = MOD - 2; while (t > 0) { y.push_back(t % 2); t /= 2; } for (int i = 1; i < MAXDEG; i++) { vector<long long int> a; long long s = i; for (int j = 0; j < 100; j++) { a.push_back(s % MOD); s = s * s; s %= MOD; } long long ansy = 1; for (int j = 0; j < y.size(); j++) { if (y[j] == 1) { ansy *= a[j]; ansy %= MOD; } } revs.push_back(ansy); } } void clr() { for (int i = 0; i < MMAX; i++) for (int j = 0; j < MAXDEG; j++) v[j][i] = 0; } void show() { for (int i = 0; i < 10; i++) { for (int j = 0; j < 5; j++) { cout << v[i][j] << ; } cout << endl; } } void doit(long long int u, int alpha) { clr(); long long p = 1; for (int j = 0; j < alpha + 1; j++) { v[j][0] = p % MOD; p *= u; p %= MOD; } for (int i = 1; i < MMAX; i++) { for (int j = 0; j < alpha + 1; j++) { for (int l = 0; l <= j; l++) { v[j][i] += (v[l][i - 1] * revs[j + 1]) % MOD; v[j][i] %= MOD; } } } } int main() { long long n, k; rev_begin(); cin >> n >> k; long long ans = 1; long long t = 2; while (t * t <= n) { while (t * t <= n && n % t != 0) t++; if (n % t == 0) { int alpha = 0; while (n % t == 0) { alpha++; n /= t; } doit(t, alpha); ans *= v[alpha][k]; ans %= MOD; } } if (n > 1) { t = n; doit(t, 1); ans *= v[1][k]; ans %= MOD; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long ans = 0; int n; cin >> n; char str[65000]; cin >> str; for (int i = 0; i < n; i++) { if ((str[i] - 0 ) % 2 == 0) { ans += i + 1; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> a[2000007]; vector<int> deg(2000007, 0); vector<pair<int, int>> ans; int n, m; void bfs(int node) { vector<bool> used(n); used[node] = true; queue<int> q; q.push(node); while (!q.empty()) { int currnode = q.front(); q.pop(); for (auto x : a[currnode]) { if (used[x]) continue; ans.push_back({x, currnode}); used[x] = true; q.push(x); } } } void solve() { cin >> n >> m; int u, v; for (int i = 0; i < m; i++) { cin >> u >> v; u--; v--; a[u].push_back(v); a[v].push_back(u); deg[u]++; deg[v]++; } int maxnode = 0; for (int i = 0; i < n; i++) { if (deg[maxnode] < deg[i]) maxnode = i; } bfs(maxnode); for (auto x : ans) { cout << x.first + 1 << << x.second + 1 << endl; } } int main() { int t; t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; set<pair<int, int> > s0, s; int K; long long xx[200010], yy[200010]; void func(long long x, long long y) { while (K > 0 && yy[K - 1] < y) K--; while (K >= 2) { long long tmp = (x - xx[K - 2]) * (yy[K - 1] - yy[K - 2]) - (xx[K - 1] - xx[K - 2]) * (y - yy[K - 2]); if (tmp < 0) K--; else break; } xx[K] = x; yy[K] = y; K++; } int main(void) { int N, M, x, y, i; cin >> N >> M >> x >> y; for ((i) = 0; (i) < (int)(N); (i)++) { scanf( %d%d , &x, &y); s0.insert(make_pair(x, y)); s.insert(make_pair(x, -y)); } for ((i) = 0; (i) < (int)(M); (i)++) { scanf( %d%d , &x, &y); s.insert(make_pair(x, -y)); } for (__typeof((s).begin()) itr = (s).begin(); itr != (s).end(); itr++) { x = (*itr).first; y = (*itr).second; func(x, -y); } int tp; string ans = Min ; for ((i) = 0; (i) < (int)(K); (i)++) { if (s0.find(make_pair(xx[i], yy[i])) != s0.end()) ans = Max ; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 5005, M = 95; int n, T[N][5], fl[N][5]; int PP[5], GG[5], ans; int f[M][M][M]; int g[M][M][M]; void UPD(int &x, int y) { x < y ? x = y : 233; } int main() { scanf( %d , &n); for (int i = (int)(1); i <= (int)(n); i++) for (int j = (int)(1); j <= (int)(3); j++) { scanf( %d , &T[i][j]); if (T[i][j] == 0) T[i][j] = 250; else { ++PP[j]; if (T[i][j] < 0) { ++GG[j]; fl[i][j] = 1; T[i][j] *= -1; } } T[i][j] = 250 - T[i][j]; } if (GG[1] + GG[2] + GG[3] >= 90) return puts( 1 ), 0; const int P[] = {0, 3000, 2500, 2000, 1500, 1000, 500}; const int lim[] = {-1, n / 32, n / 16, n / 8, n / 4, n / 2, n}; for (int a = (int)(1); a <= (int)(6); a++) if (PP[1] > lim[a - 1] && PP[1] - GG[1] <= lim[a]) for (int b = (int)(1); b <= (int)(6); b++) if (PP[2] > lim[b - 1] && PP[2] - GG[2] <= lim[b]) for (int c = (int)(1); c <= (int)(6); c++) if (PP[3] > lim[c - 1] && PP[3] - GG[3] <= lim[c]) { int p = P[a] * T[1][1] + P[b] * T[1][2] + P[c] * T[1][3]; int la = min(GG[1], PP[1] - lim[a - 1] - 1), sa = 0; int lb = min(GG[2], PP[2] - lim[b - 1] - 1), sb = 0; int lc = min(GG[3], PP[3] - lim[c - 1] - 1), sc = 0; p += (la + lb + lc) * 250 * 100; int stk = 0; memset(f, 0, sizeof(f)); memset(g, 0, sizeof(g)); for (int i = (int)(2); i <= (int)(n); i++) { int va = P[a] * T[i][1]; int vb = P[b] * T[i][2]; int vc = P[c] * T[i][3]; if (!fl[i][1] && !fl[i][2] && !fl[i][3]) { stk += (p >= (va + vb + vc)); continue; } for (int Sa = (int)(0); Sa <= (int)(sa); Sa++) for (int Sb = (int)(0); Sb <= (int)(sb); Sb++) for (int Sc = (int)(0); Sc <= (int)(sc); Sc++) { UPD(g[Sa][Sb][Sc], f[Sa][Sb][Sc] + (p >= (va + vb + vc))); if (fl[i][1]) UPD(g[Sa + 1][Sb][Sc], f[Sa][Sb][Sc] + (p >= (vb + vc))); if (fl[i][2]) UPD(g[Sa][Sb + 1][Sc], f[Sa][Sb][Sc] + (p >= (va + vc))); if (fl[i][3]) UPD(g[Sa][Sb][Sc + 1], f[Sa][Sb][Sc] + (p >= (va + vb))); if (fl[i][1] && fl[i][2]) UPD(g[Sa + 1][Sb + 1][Sc], f[Sa][Sb][Sc] + (p >= vc)); if (fl[i][1] && fl[i][3]) UPD(g[Sa + 1][Sb][Sc + 1], f[Sa][Sb][Sc] + (p >= vb)); if (fl[i][2] && fl[i][3]) UPD(g[Sa][Sb + 1][Sc + 1], f[Sa][Sb][Sc] + (p >= va)); if (fl[i][1] && fl[i][2] && fl[i][3]) UPD(g[Sa + 1][Sb + 1][Sc + 1], f[Sa][Sb][Sc] + (p >= 0)); } sa = min(sa + fl[i][1], la); sb = min(sb + fl[i][2], lb); sc = min(sc + fl[i][3], lc); for (int Sa = (int)(0); Sa <= (int)(sa); Sa++) for (int Sb = (int)(0); Sb <= (int)(sb); Sb++) for (int Sc = (int)(0); Sc <= (int)(sc); Sc++) { f[Sa][Sb][Sc] = g[Sa][Sb][Sc]; g[Sa][Sb][Sc] = 0; } } ans = max(ans, f[la][lb][lc] + stk); } printf( %d n , n - ans); }
|
#include <bits/stdc++.h> int main(void) { char s[1001]; char t[1001]; scanf( %s %s , s, t); int idx = 0; while (s[idx] != 0 ) { if (t[idx] == 0 ) { puts( No ); return 0; } char cs = s[idx]; char ct = t[idx]; int cvowel = 0; int tvowel = 0; if (cs == a || cs == e || cs == i || cs == o || cs == u ) cvowel = 1; if (ct == a || ct == e || ct == i || ct == o || ct == u ) tvowel = 1; if (cvowel != tvowel) { puts( No ); return 0; } idx++; } if (t[idx] != 0 && s[idx] == 0 ) { puts( No ); return 0; } puts( Yes ); 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]; } int kolvo = 0; int kolvo1 = 0; for (int i = 0; i < n; i++) { if (a[i] == 5) { kolvo++; } if (a[i] == 0) { kolvo1++; } } sort(a.rbegin(), a.rend()); if ((kolvo / 9) > 0 and kolvo1 > 0) { for (int i = 0; i < (kolvo / 9) * 9; i++) { cout << a[i]; } sort(a.begin(), a.end()); for (int i = 0; i < kolvo1; i++) { cout << a[i]; } } else { if (kolvo1 > 0) { cout << 0; } else { cout << -1; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 200200; vector<long long int> g[N], e[N]; set<pair<long long int, long long int> > S; int n, m; long long int d[N]; int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= m; i++) { long long int x, y, z; cin >> x >> y >> z; g[x].push_back(y); e[x].push_back(z); g[y].push_back(x); e[y].push_back(z); } for (int i = 1; i <= n; i++) { cin >> d[i]; S.insert(make_pair(d[i], i)); } while (S.size() != 0) { int u = S.begin()->second; S.erase(S.begin()); for (int i = 0; i < g[u].size(); i++) { long long int v = g[u][i]; long long int cost = e[u][i]; if (cost * 2 + d[u] < d[v]) { S.erase(make_pair(d[v], v)); d[v] = cost * 2 + d[u]; S.insert(make_pair(d[v], v)); } } } for (int i = 1; i <= n; i++) { cout << d[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long mod = 1000000007; const double e = 2.718281828459; long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } long long gcd1(int a, int b) { if (!b) return a; return gcd(b, a % b); } long long pow_mod(long long a, long long b, long long c) { long long ans = 1; a = a % c; while (b > 0) { if (b % 2 == 1) ans = (ans * a) % c; b = b / 2; a = (a * a) % c; } return ans; } int pow_int(int a, int b) { int ans = 1; while (b > 0) { if (b % 2 == 1) ans = ans * a; b = b / 2; a = a * a; } return ans; } long long pow_llong(long long a, long long b) { long long ans = 1; while (b > 0) { if (b % 2 == 1) ans = ans * a; b = b / 2; a = a * a; } return ans; } const int dx[9] = {0, 1, 1, 1, 0, -1, -1, -1, 0}; const int dy[9] = {0, 1, 0, -1, -1, -1, 0, 1, 1}; int Scan() { int res = 0, flag = 0; char ch; if ((ch = getchar()) == - ) { flag = 1; } else if (ch >= 0 && ch <= 9 ) { res = ch - 0 ; } while ((ch = getchar()) >= 0 && ch <= 9 ) { res = res * 10 + (ch - 0 ); } return flag ? -res : res; } void Out(int a) { if (a < 0) { putchar( - ); a = -a; } if (a >= 10) { Out(a / 10); } putchar(a % 10 + 0 ); } long long jc_mod(long long a, long long b, long long mod) { long long ans = 1; b = max(b, a - b); for (long long i = a; i > b; i--) { ans *= i; ans %= mod; } return ans; } double lg(double a) { return (log(a) / log(10.0)); } int lowbit(int x) { return x & -x; } inline int read() { int f = 1, x = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } void lisan(int *x, int n) { int data[100010]; for (int i = 1; i <= n; i++) data[i] = x[i]; sort(data + 1, data + 1 + n); int o = unique(data + 1, data + 1 + n) - data - 1; for (int i = 1; i <= n; i++) x[i] = lower_bound(data + 1, data + 1 + o, x[i]) - data; } long long calc(int M) { return 1; } int sanfen(int L, int R) { int M, RM; while (L + 1 < R) { M = (L + R) / 2; RM = (M + R) / 2; if (calc(M) < calc(RM)) R = RM; else L = M; } return L; } int CaculateWeekDay(int y, int m, int d) { if (m == 1 || m == 2) { m += 12; y--; } int iWeek = (d + 2 * m + 3 * (m + 1) / 5 + y + y / 4 - y / 100 + y / 400) % 7; return iWeek; } map<string, int> mm; map<char, int> cc; string a; char t[100]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { cin >> a; int q = 0; cc.clear(); int len = a.length(); for (int i = 0; i < len; i++) { if (!cc[a[i]]) { cc[a[i]] = 1; t[q++] = a[i]; } } t[q] = 0; sort(t, t + q); string y = t; mm[y] = 1; } printf( %d n , mm.size()); return 0; }
|
#include <bits/stdc++.h> int main() { int n, h, m, h0, m0, c(1), cash(1); scanf( %d , &n); scanf( %d%d , &h0, &m0); while (--n) { scanf( %d%d , &h, &m); if (h == h0 && m == m0) { c += 1; if (c > cash) { cash = c; } } else { c = 1; } h0 = h; m0 = m; } printf( %d n , cash); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int count = 0; vector<long long> ans; int k = 0; for (int i = 0; i < n; i++) { int u; scanf( %d , &u); if (count > 0 && u != 0) { if (k != 0) ans.push_back(count + 1); else { ans.push_back(1); k = 1; } count = 0; } else if (count > 0 && u == 0) { count++; } else if (u == 0) { count++; } else { k = 1; } } if (count > 0 && k != 0) { ans.push_back(1); } else if (count > 0 && k == 0) { ans.push_back(0); } long long ans1 = 1; for (int i = 0; i < ans.size(); i++) { ans1 = ans1 * (ans[i]); } printf( %lld n , ans1); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; for (; ~scanf( %d%d , &n, &m);) { if (n == 1) { if (m == 1) puts( 0 ); else { for (int i = 1; i <= m; ++i) printf( %d , i + 1); puts( ); } } else { if (m == 1) for (int i = 1; i <= n; ++i) printf( %d n , i + 1); else for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) printf( %d , i * (j + n)); puts( ); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > V1, V2; int n, s; int main() { while (~scanf( %d%d , &n, &s)) { V1.clear(); V2.clear(); long long sum1 = 0; long long sum2 = 0; long long ans = 0; for (int i = 0; i < n; i++) { long long a, b, c; scanf( %lld%lld%lld , &c, &a, &b); if (a > b) { sum1 += c; ans += c * a; V1.push_back(make_pair(a - b, c)); } else { sum2 += c; ans += c * b; V2.push_back(make_pair(b - a, c)); } } sum1 %= s; sum2 %= s; if (sum1 + sum2 > s) { cout << ans << endl; continue; } else { sort(V1.begin(), V1.end()); sort(V2.begin(), V2.end()); long long tmp1 = 0; long long tmp2 = 0; int len = V1.size(); for (int i = 0; i < len; i++) { tmp1 += min(sum1, V1[i].second) * V1[i].first; sum1 -= min(sum1, V1[i].second); } len = V2.size(); for (int i = 0; i < len; i++) { tmp2 += min(sum2, V2[i].second) * V2[i].first; sum2 -= min(sum2, V2[i].second); } cout << ans - min(tmp1, tmp2) << endl; } } }
|
#include <bits/stdc++.h> using namespace std; void solve() { long long n, k; cin >> n >> k; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } vector<long long> step(100, 0); for (long long i = 0; i < n; i++) { long long x = 0; while (a[i] > 0) { step[x] += a[i] % k; a[i] /= k; x++; } } for (long long i = 0; i < 100; i++) { if (step[i] > 1) { cout << NO << endl; return; } } cout << YES << endl; } signed main() { long long n; cin >> n; for (long long i = 0; i < n; i++) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; map<int, int> m; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; m[a[i]] = i; } long long int b[n]; map<int, int> freq; for (int i = 0; i < n; i++) { cin >> b[i]; int shift = m[b[i]] - i; if (m[b[i]] - i < 0) shift = (n - i + m[b[i]]); freq[shift]++; } int ans = 0; for (auto i : freq) { ans = max(ans, i.second); } cout << ans << n ; cerr << time taken : << (float)clock() / CLOCKS_PER_SEC << secs << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int size[3010], fa[3010], sum[3010], head[10010]; struct node { int x, y, next; } e[3010]; int find(int x) { if (x != fa[x]) fa[x] = find(fa[x]); return fa[x]; } int main() { int n; scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y, w; scanf( %d%d%d , &x, &y, &w); e[i].x = x; e[i].y = y; e[i].next = head[w]; head[w] = i; } int s = 0; for (int i = 1; i <= n; i++) { fa[i] = i; size[i] = 1; scanf( %d , &sum[i]); s += sum[i]; } for (int i = 1; i <= 10000; i++) { int p = head[i]; while (p) { int x = find(e[p].x), y = find(e[p].y); fa[y] = x; size[x] += size[y]; sum[x] += sum[y]; if (size[x] + sum[x] > s) { printf( %d n , i); return 0; } p = e[p].next; } } puts( 0 ); return 0; }
|
#include <bits/stdc++.h> const int maxx = 2e6 + 5; using namespace std; long long a[maxx]; long long biaoji[maxx] = {0}; int main() { long long t, i, j, m, n; cin >> n; long long maxl = 0; for (i = 1; i <= n; i++) { scanf( %lld , &a[i]); maxl = max(maxl, a[i]); biaoji[a[i]]++; } long long sum1 = 0, sum2 = 0; long long cishu = 0; long long weizhi = 0; for (i = 1; i <= maxl + 1; i++) { if (biaoji[i] > 0) { if (biaoji[i + 1] > 0 && biaoji[i + 2] > 0) { sum1++; i += 2; } else if (biaoji[i + 1] > 0) { sum1++; i++; } else if (biaoji[i + 2] > 0) { sum1++; i += 2; } else { sum1++; i += 2; } } } for (i = 0; i <= maxl + 1; i++) { if (i >= 1 && biaoji[i - 1] >= 1) { sum2++; } else if (biaoji[i] == 0) { if (biaoji[i + 1] >= 1) { biaoji[i + 1]--; sum2++; } } else if (biaoji[i] >= 1) { biaoji[i]--; sum2++; } } printf( %lld %lld n , sum1, sum2); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); long long val, sum = 0, minOdd = 1000000001; for (int i = 0; i < n; i++) { scanf( %lld , &val); if (val & 1) minOdd = min(minOdd, val); sum += val; } printf( %lld n , (sum & 1) ? sum - minOdd : sum); return 0; }
|
#include <bits/stdc++.h> namespace pb_ds { namespace io { const int MaxBuff = 1 << 15; const int Output = 1 << 23; char B[MaxBuff], *S = B, *T = B; char Out[Output], *iter = Out; inline void flush() { fwrite(Out, 1, iter - Out, stdout); iter = Out; } } // namespace io template <class Type> inline Type Read() { using namespace io; register char ch; register Type ans = 0; register bool neg = 0; while (ch = ((S == T) && (T = (S = B) + fread(B, 1, MaxBuff, stdin), S == T) ? 0 : *S++), (ch < 0 || ch > 9 ) && ch != - ) ; ch == - ? neg = 1 : ans = ch - 0 ; while (ch = ((S == T) && (T = (S = B) + fread(B, 1, MaxBuff, stdin), S == T) ? 0 : *S++), 0 <= ch && ch <= 9 ) ans = ans * 10 + ch - 0 ; return neg ? -ans : ans; } template <class Type> inline void Print(register Type x, register char ch = n ) { using namespace io; if (!x) *iter++ = 0 ; else { if (x < 0) *iter++ = - , x = -x; static int s[100]; register int t = 0; while (x) s[++t] = x % 10, x /= 10; while (t) *iter++ = 0 + s[t--]; } *iter++ = ch; } } // namespace pb_ds using namespace pb_ds; using namespace std; const int N = 55; const int inf = 2e9; struct edge { int next, to; } a[N << 1]; int head[N], cnt; inline void add(int u, int v) { a[++cnt].to = v; a[cnt].next = head[u]; head[u] = cnt; } int n, m, st, now, ans = inf; int w[N][N], c[N], deg[N]; int dp[N][N][N][N], f[2][N]; void dfs(int x, int fa) { for (int i = head[x]; i; i = a[i].next) { int y = a[i].to; if (y == fa) continue; dfs(y, x), c[x] += c[y]; } } int solve(int u, int v, int s1, int s2) { if (!s1) return s2 ? inf : 0; if (~dp[u][v][s1][s2]) return dp[u][v][s1][s2]; if (deg[v] == 1) return dp[u][v][s1][s2] = (solve(v, u, s2, 0) + w[u][v]); for (int i = head[v]; i; i = a[i].next) { int y = a[i].to; if (y == u) continue; for (int j = 0; j <= s1; ++j) solve(v, y, j, s1 + s2 - j); } memset(f[0], 0, sizeof(f[0])), f[now = 0][0] = inf; for (int i = head[v]; i; i = a[i].next) { int y = a[i].to; if (y == u) continue; now ^= 1; memset(f[now], 0, sizeof(f[now])); for (int j = 0; j <= s1; ++j) { for (int k = 0; j + k <= s1; ++k) { f[now][j + k] = max(f[now][j + k], min(f[now ^ 1][j], solve(v, y, k, s1 + s2 - k))); } } } return (dp[u][v][s1][s2] = (f[now][s1] + w[u][v])); } int main() { n = Read<int>(); for (int i = 1; i < n; ++i) { int u = Read<int>(), v = Read<int>(); w[u][v] = w[v][u] = Read<int>(); add(u, v), add(v, u); ++deg[u], ++deg[v]; } st = Read<int>(), m = Read<int>(); for (int i = 1; i <= m; ++i) ++c[Read<int>()]; dfs(st, 0), memset(dp, -1, sizeof(dp)); for (int i = head[st]; i; i = a[i].next) ans = min(ans, solve(st, a[i].to, c[a[i].to], m - c[a[i].to])); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> const double pi = std::acos(-1); using namespace std; const long long int mod = 1000000000 + 7; long long int power(long long int x, long long int y, long long int md) { long long int res = 1; x = x % md; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % md; y = y >> 1; x = (x * x) % md; } return res; } long long int m_mul(long long int a, long long int b) { a = a % mod; b = b % mod; return (a * b + mod) % mod; } long long int m_add(long long int a, long long int b) { a = a % mod; b = b % mod; return (a + b + mod) % mod; } int main() { long long int tc; cin >> tc; while (tc--) { long long int n, x; cin >> n >> x; long long int arr[n]; for (long long int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n, greater<long long int>()); long long int a1 = 1; long long int k = 0; for (long long int i = 0; i < n; i++) { if (arr[i] * a1 >= x) { a1 = 1; k++; } else { a1++; } } cout << k << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { long long int result = 1; while (b > 0) { int lastbit = (b & 1); if (lastbit) { result = (result * a); } a = (a * a); b = b >> 1; } return result; } long long int power2(long long int a, long long int b, long long int p) { long long int result = 1; while (b > 0) { int lastbit = (b & 1); if (lastbit) { result = (result * a) % p; } a = (a * a) % p; b = b >> 1; } return result % p; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } vector<int> SieveOfEratosthenes(int n) { bool prime[n + 1]; memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } vector<int> v; v.push_back(0); for (int p = 2; p <= n; p++) if (prime[p]) v.push_back(p); return v; } void InverseofNumber(long long int p) { long long int n[1000001]; n[0] = n[1] = 1; for (int i = 2; i <= 1000000; i++) n[i] = n[p % i] * (p - p / i) % p; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int xxx; cin >> xxx; for (int tt = 1; tt <= xxx; tt++) { long long int n; cin >> n; long long int t = ceil(sqrt(n)); long long int x = n / t; if (n % t == 0) { x--; } cout << t + x - 1; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; string s, t; cin >> n; vector<vector<int> > DP(26, vector<int>(26, -10000000)); for (int i = 0; i < n; i++) { t = s; cin >> s; if (i > 0) DP[t[0] - a ][t[t.length() - 1] - a ] = max(DP[t[0] - a ][t[t.length() - 1] - a ], (int)t.length()); for (int j = 0; j < 26; j++) DP[j][s[s.length() - 1] - a ] = max(DP[j][s[s.length() - 1] - a ], DP[j][s[0] - a ] + (int)s.length()); } t = s; DP[t[0] - a ][t[t.length() - 1] - a ] = max(DP[t[0] - a ][t[t.length() - 1] - a ], (int)t.length()); int Ans = 0; for (int i = 0; i < 26; i++) Ans = max(Ans, DP[i][i]); cout << Ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; long long int w, x[200005]; int main() { cin >> n >> w; for (int i = 0; i < n * 2; i++) cin >> x[i]; sort(x, x + n * 2); double mid; mid = min((double)x[n] / 2, (double)x[0]); mid = (mid + mid * 2) * n; mid = min(mid, (double)w); printf( %.6f n , mid); }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, t, f, k, y = 0, w, j = 0, x = 0; cin >> a >> t >> f >> k; w = t; for (;;) { if (x == 0) { if (j % 2 == 1) j++; if (j == k) break; if (w >= f) { x = f; w -= f; } else { cout << -1; return 0; } } else if (x == f) { if (j % 2 == 0) { if (w >= (a - f) * 2) { x = a; w -= (a - f); } else if (w >= a - f) { if (j == k - 1) { x = a; w -= (a - f); } else { w = t; x = a; w -= (a - f); y++; } } else { if (t >= a - f) { w = t; x = a; w -= (a - f); y++; } else { cout << -1; return 0; } } } else { if (w >= f * 2) { x = 0; w -= f; } else if (w >= f) { if (j == k - 1) { x = 0; w -= f; } else { w = t; x = 0; w -= f; y++; } } else { if (t >= f) { w = t; x = 0; w -= f; y++; } else { cout << -1; return 0; } } } } else if (x == a) { if (j % 2 == 0) j++; if (j == k) break; if (w >= a - f) { x = f; w -= (a - f); } else { cout << -1; return 0; } } if (j == k) break; } cout << y; }
|
#include <bits/stdc++.h> using namespace std; void cp() { ios ::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { cp(); { string s, t; cin >> s >> t; if (s.length() == t.length() + 1) { long long m = 0; long long in = -1; char f; long long j = 0; for (long long i = 0; i < s.length(); i += 1) { if (s[i] != t[j]) { f = s.at(i); in = i; m++; j--; } j++; } vector<long long> ans; if (m == 1) { while (in > -1) { if (s[in] == f) { in--; } else { break; } } in++; while (in < s.length()) { if (s[in] == f) { ans.push_back(in + 1); in++; } else { break; } } cout << ans.size(); cout << endl; ; for (long long i = 0; i < ans.size(); i += 1) cout << ans[i] << ; } else { cout << 0 n ; } } else { cout << 0 n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 100 * 1000 + 7; int a[MX]; int hup[MX], hdown[MX]; long long cup[MX], cdown[MX]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { int cost = 0; if (a[i] <= hup[i - 1]) cost = (hup[i - 1] + 1 - a[i]); hup[i] = a[i] + cost; cup[i] = cup[i - 1] + cost; } for (int i = n; i >= 1; i--) { int cost = 0; if (a[i] <= hdown[i + 1]) cost = (hdown[i + 1] + 1 - a[i]); hdown[i] = a[i] + cost; cdown[i] = cdown[i + 1] + cost; } long long res = (long long)1e18; for (int i = 1; i <= n; i++) { int need = max(hup[i - 1] + 1, hdown[i + 1] + 1); int cost = 0; if (a[i] < need) cost = need - a[i]; res = min(res, cup[i - 1] + cdown[i + 1] + cost); } printf( %lld n , res); }
|
#include <bits/stdc++.h> using namespace std; struct ww { long long x, y; } c[400][400]; int i, j, k, n, m, ma, ren, C, kuai; int cov[400], zhi[400]; long long b[400][400], s[400][400]; vector<int> a[100010]; inline void gao(int x) { int i, n = kuai - 1, g[400], r = 0; long long jum[400]; for (i = 0; i <= n; i++) b[x][i] += cov[x]; cov[x] = 0; s[x][0] = b[x][0]; for (i = 1; i <= n; i++) s[x][i] = s[x][i - 1] + b[x][i]; for (i = 0; i <= n; i++) { long long A = s[x][i], F = 0; for (; r; r--) { int wei = g[r]; long long B = s[x][wei]; int cha = i - wei; if (A >= B) continue; long long ci = (B - A) / cha + ((B - A) % cha > 0); if (jum[r] >= ci) continue; else { F = ci; break; } } g[++r] = i, jum[r] = F; } jum[r + 1] = 100010; for (i = 1; i <= r; i++) c[x][i] = (ww){g[i], jum[i + 1]}; zhi[x] = 1; } inline void jian(int x) { int A = x / kuai, B = x % kuai; b[A][B] -= x; gao(A); } inline void jia(int x) { if (x < 0) return; int A = x / kuai, B = x % kuai, i; for (i = 0; i <= A - 1; i++) { cov[i]++; if (c[i][zhi[i]].y == cov[i]) zhi[i]++; } for (i = 0; i <= B; i++) b[A][i]++; gao(A); } inline long long suan(int x) { ww A = c[x][zhi[x]]; return s[x][A.x] + 1ll * cov[x] * (A.x + 1); } inline ww cal() { int i, id; long long ma, sum; ma = -1, sum = 0; for (i = 0; i <= 400 - 1; i++) { long long re = sum + suan(i); if (re > ma) ma = re, id = i * kuai + c[i][zhi[i]].x; sum += s[i][kuai - 1] + 1ll * cov[i] * kuai; } return (ww){ma, id}; } int main() { kuai = 300; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { int x, y; scanf( %d%d , &x, &y); a[y].push_back(x - 1); ma = max(ma, y); } for (i = 0; i <= 400 - 1; i++) gao(i); ren = n; for (C = 0; C <= ma + 1; C++) { ww re = cal(); printf( %I64d %I64d n , 1ll * ren * C * m + re.x, re.y + 1); for (j = 0; j < a[C].size(); j++) { int A = a[C][j]; ren--; jia(A); jian(A + 1); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, ans; int a[200][10]; int p[10]; struct Node { double l, r; int w; } c[10]; struct Point { int S, T; } u[10], v[10]; void Op() { c[1].l = -(1e-7); c[1].r = 1.00 / 32.00; c[1].w = 3000; c[2].l = 1.00 / 32.00; c[2].r = 1.00 / 16.00; c[2].w = 2500; c[3].l = 1.00 / 16.00; c[3].r = 1.00 / 8.00; c[3].w = 2000; c[4].l = 1.00 / 8.00; c[4].r = 1.00 / 4.00; c[4].w = 1500; c[5].l = 1.00 / 4.00; c[5].r = 1.00 / 2.00; c[5].w = 1000; c[6].l = 1.00 / 2.00; c[6].r = 1.00 / 1.00; c[6].w = 500; } bool Judge(Point R, int t) { double p = (double)R.T / (double)R.S; if (p <= c[t].l) return 0; if (p > c[t].r) return 0; return 1; } void Check() { int ans1 = 0, ans2 = 0; for (int i = 1; i <= 5; i++) { if (a[1][i] != -1) ans1 += c[p[i]].w / 250 * (250 - a[1][i]); if (a[2][i] != -1) ans2 += c[p[i]].w / 250 * (250 - a[2][i]); v[i] = u[i]; } if (ans1 <= ans2) return; bool ok = 1; for (int i = 1; i <= 5; i++) if (!Judge(v[i], p[i])) ok = 0; if (ok) { ans = 0; return; } for (int i = 1; i <= 5000; i++) { for (int j = 1; j <= 5; j++) { v[j].S++; if ((double)v[j].T / (double)v[j].S <= c[p[j]].l && a[1][j] != -1) v[j].T++; } bool ok = 1; for (int j = 1; j <= 5; j++) if (!Judge(v[j], p[j])) ok = 0; if (ok) { ans = min(ans, i); return; } } } void Solve(int x) { if (x > 5) { Check(); return; } for (int i = 1; i <= 6; i++) { p[x] = i; Solve(x + 1); } } int main() { Op(); scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= 5; j++) scanf( %d , &a[i][j]); for (int j = 1; j <= 5; j++) { u[j].S = u[j].T = 0; for (int i = 1; i <= n; i++) { if (a[i][j] != -1) u[j].T++; u[j].S++; } } ans = 1 << 30; Solve(1); if (ans == 1 << 30) printf( -1 n ); else printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t, x, y, arr1[2] = {0, 0}, arr2[2] = {0, 0}; cin >> n; for (int i = 0; i < n; i++) { cin >> t >> x >> y; if (t == 1) { arr1[0] += x; arr1[1] += y; } if (t == 2) { arr2[0] += x; arr2[1] += y; } } if (arr1[0] >= arr1[1]) { cout << LIVE << endl; } if (arr1[0] < arr1[1]) { cout << DEAD << endl; } if (arr2[0] >= arr2[1]) { cout << LIVE << endl; } if (arr2[0] < arr2[1]) { cout << DEAD << endl; } }
|
#include <bits/stdc++.h> using namespace std; vector<long long> v; bitset<101> usado; long long dfs(long long nodo) { if (usado[nodo]) return 0; usado.set(nodo); return 1 + dfs(v[nodo]); } long long calcmcd(long long a, long long b) { if (a % b == 0) return b; return calcmcd(b, a % b); } int main() { ios::sync_with_stdio(false); bool puede = true; long long n, aux, resp, mcd, mcm; vector<long long> pararesp; cin >> n; v.resize(n + 1); for (long long i = 1; i <= n; i++) { cin >> v[i]; if (usado[v[i]]) puede = false; else usado.set(v[i]); } if (puede) { usado.reset(); for (long long i = 1; i <= n; i++) { while (i <= n && (usado[i] || v[i] == i)) i++; if (i <= n) { aux = dfs(i); if (aux % 2 == 0) aux /= 2; pararesp.push_back(aux); } } if (pararesp.empty()) resp = 1; else { if (pararesp.size() == 1) resp = pararesp[0]; else { mcm = pararesp[pararesp.size() - 1]; for (int i = pararesp.size() - 2; i >= 0; i--) { if (pararesp[i] > mcm) mcd = calcmcd(pararesp[i], mcm); else mcd = calcmcd(mcm, pararesp[i]); mcm = mcm * pararesp[i] / mcd; } resp = mcm; pararesp.clear(); } } cout << resp << n ; } else cout << -1 n ; v.clear(); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << n ; err(++it, args...); } function<void(void)> ____ = []() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; template <typename T> vector<T> &operator<<(vector<T> &__container, T x) { __container.push_back(x); return __container; } template <typename T> ostream &operator<<(ostream &out, vector<T> &__container) { for (T _ : __container) out << _ << ; return out; } void sci() {} template <typename... Args> void sci(int &x, Args &...args) { scanf( %d , &x); sci(args...); } void scl() {} template <typename... Args> void scl(long long int &x, Args &...args) { scanf( %lld , &x); scl(args...); } const int MAXN = 1e6 + 7; int n, m; struct SegmentTree { int w[MAXN << 2], l[MAXN << 2], r[MAXN << 2]; void build(int L, int R, int rt = 1) { l[rt] = L; r[rt] = R; w[rt] = 0; if (L + 1 == R) return; int mid = (L + R) >> 1; build(L, mid, rt << 1); build(mid, R, rt << 1 | 1); } void down(int rt) { if (w[rt]) w[rt << 1] = w[rt << 1 | 1] = w[rt], w[rt] = 0; } void modify(int L, int R, int x, int rt = 1) { if (L >= r[rt] or l[rt] >= R) return; if (L <= l[rt] and r[rt] <= R) { w[rt] = x; return; } down(x); modify(L, R, x, rt << 1); modify(L, R, x, rt << 1 | 1); } int query(int pos, int rt = 1) { if (l[rt] + 1 == r[rt]) return w[rt]; down(rt); int mid = (l[rt] + r[rt]) >> 1; if (pos < mid) return query(pos, rt << 1); else return query(pos, rt << 1 | 1); } } seg; struct FenwickTree { long long int sum[MAXN]; void modify(int pos, int x) { while (pos < MAXN) sum[pos] += x, pos += (pos & (-pos)); } long long int qsum(int pos) { long long int ret = 0; while (pos) ret += sum[pos], pos -= (pos & (-pos)); return ret; } } bit; struct Query { char op; int x, y, id, qid; } Q[MAXN]; struct Disjoint_Set_Union { int fa[MAXN]; Disjoint_Set_Union() { for (int i = 0; i < MAXN; i++) fa[i] = i; } int findx(int x) { return x == fa[x] ? x : fa[x] = findx(fa[x]); } void merge(int x, int y) { if (findx(x) != findx(y)) fa[findx(x)] = findx(y); } } dsu[2]; struct Graph { vector<int> g[MAXN]; int tot, dfn[MAXN], idx, sz[MAXN], ed[MAXN]; Graph() { tot = idx = 0; } void dfs(int u) { dfn[u] = ++idx; sz[u] = u <= n ? 1 : 0; for (int v : g[u]) dfs(v), sz[u] += sz[v]; ed[u] = idx; } } G[2]; long long int ret[MAXN]; void solve() { static char buf[233]; sci(n, m); G[0].tot = G[1].tot = n; for (int i = 1; i <= m; i++) { scanf( %s , buf); Q[i].id = i; Q[i].op = buf[0]; if (buf[0] == U ) { sci(Q[i].x, Q[i].y); G[1].tot++; G[1].g[G[1].tot] << dsu[1].findx(Q[i].x) << dsu[1].findx(Q[i].y); dsu[1].merge(Q[i].x, G[1].tot); dsu[1].merge(Q[i].y, G[1].tot); } else if (buf[0] == M ) { sci(Q[i].x, Q[i].y); G[0].tot++; G[0].g[G[0].tot] << dsu[0].findx(Q[i].x) << dsu[0].findx(Q[i].y); dsu[0].merge(Q[i].x, G[0].tot); dsu[0].merge(Q[i].y, G[0].tot); } else if (buf[0] == A ) sci(Q[i].x), Q[i].x = dsu[1].findx(Q[i].x); else if (buf[0] == Z ) sci(Q[i].x), Q[i].x = dsu[0].findx(Q[i].x); else if (buf[0] == Q ) sci(Q[i].x); } G[0].tot++; for (int i = 1; i < G[0].tot; i++) if (dsu[0].findx(i) == i) G[0].g[G[0].tot] << i; G[0].dfs(G[0].tot); G[1].tot++; for (int i = 1; i < G[1].tot; i++) if (dsu[1].findx(i) == i) G[1].g[G[1].tot] << i; G[1].dfs(G[1].tot); vector<Query> vec; seg.build(1, MAXN); int queryid = 0; for (int i = 1; i <= m; i++) { if (Q[i].op == A ) vec << Q[i]; else if (Q[i].op == Z ) { int st = G[0].dfn[Q[i].x], ed = G[0].ed[Q[i].x]; seg.modify(st, ed + 1, i); } else if (Q[i].op == Q ) { Q[i].y = 1; Q[i].qid = ++queryid; vec << Q[i]; int p = seg.query(G[0].dfn[Q[i].x]); if (p != 0) { Q[i].y = -1; Q[i].id = p; vec << Q[i]; } } } sort(vec.begin(), vec.end(), [&](const Query &A, const Query &B) { return A.id < B.id; }); for (Query &qs : vec) { if (qs.op == A ) { int sz = G[1].sz[qs.x], st = G[1].dfn[qs.x], ed = G[1].ed[qs.x]; bit.modify(st, sz); bit.modify(ed + 1, -sz); } else if (qs.op == Q ) ret[qs.qid] += qs.y * bit.qsum(G[1].dfn[qs.x]); } for (int i = 1; i <= queryid; i++) cout << ret[i] << n ; } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using std::vector; const long double EPS = 1e-10; int n; int x[5], y[5], r[5]; inline int sqr(int x) { return x * x; } namespace solver2 { bool get(int a, int b) { int dist2 = sqr(x[a] - x[b]) + sqr(y[a] - y[b]); return dist2 < sqr(r[a] + r[b]) && dist2 > sqr(r[a] - r[b]); } bool in(int x0, int y0, int a) { return (sqr(x0 - x[a]) + sqr(y0 - y[a])) < sqr(r[a]); } bool sta[10]; void main() { int p = 240; for (int i = 1; i <= n; i++) x[i] *= p, y[i] *= p, r[i] *= p; for (int i = 1, x = -20 * p; i <= p * 40; i++, x++) { for (int j = 1, y = -20 * p; j <= p * 40; j++, y++) { int tmp = 0; for (int k = 1; k <= n; k++) { tmp += in(x, y, k) << (k - 1); } sta[tmp] = 1; } } int ans = 1; for (int i = 1; i < (1 << n); i++) ans += sta[i]; printf( %d n , ans); } } // namespace solver2 namespace geometry { inline long double sqr(long double x) { return x * x; } inline int sgn(long double x) { return x < -EPS ? -1 : x > EPS; } struct Vector { long double x, y; Vector(long double x = 0, long double y = 0) : x(x), y(y) {} long double len() { return sqrt(sqr(x) + sqr(y)); } long double norm() { return sqr(x) + sqr(y); } Vector unit() { return *this / len(); } long double angle() { return atan2(y, x); } bool operator==(const Vector &rhs) const { return sgn(x - rhs.x) == 0 && sgn(y - rhs.y) == 0; } bool operator<(const Vector &rhs) const { return sgn(x - rhs.x) < 0 || (sgn(x - rhs.x) == 0 && sgn(y - rhs.y) < 0); } Vector operator+(const Vector &__rhs) const { return Vector(x + __rhs.x, y + __rhs.y); } Vector operator-(const Vector &__rhs) const { return Vector(x - __rhs.x, y - __rhs.y); } Vector operator*(const long double __rhs) const { return Vector(x * __rhs, y * __rhs); } Vector operator/(const long double __rhs) const { return Vector(x / __rhs, y / __rhs); } }; long double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; } long double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; } Vector rotate(Vector a, Vector b) { b = b.unit(); return Vector(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x); } struct Line { Vector u; Vector v; Line() {} Line(Vector a, Vector b) : u(a), v((b - a).unit()) {} }; struct Circle { Vector o; long double r; Circle() {} Circle(Vector o, long double r) : o(o), r(r) {} }; Vector mid_point(Vector a, Vector b) { return Vector((a.x + b.x) / 2, (a.y + b.y) / 2); } Line divide_angle(Vector u, Vector v1, Vector v2) { return Line(u, v1.unit() + v2.unit()); } long double distance_to_line(Vector u, Line l) { return fabs(cross(u - l.u, l.v)) / l.v.len(); } Vector perpendicular_foot(Vector u, Line l) { return l.u + l.v * dot(l.v, u - l.u); } Line move(Line l, long double d) { return Line(l.u + rotate(l.v, Vector(0, 1)).unit() * d, l.v); } Vector intersection(Line l1, Line l2) { return l1.u + l1.v * (cross(l2.v, l1.u - l2.u) / cross(l1.v, l2.v)); } vector<Vector> intersection(Circle c1, Circle c2) { if (sgn(c1.r - c2.r) < 0) std::swap(c1, c2); long double d = (c1.o - c2.o).len(); if (sgn(c1.r + c2.r - d) < 0 || sgn(fabs(c1.r - c2.r) - d) > 0) { return {}; } else if (sgn(c1.r + c2.r - d) == 0 || sgn(fabs(c1.r - c2.r) - d) == 0) { return {c1.o + (c2.o - c1.o).unit() * c1.r}; } else { long double cos_alpha = (sqr(d) + sqr(c1.r) - sqr(c2.r)) / (2 * d * c1.r); long double sin_alpha = sqrt(1 - sqr(cos_alpha)); Vector delta1 = rotate(c2.o - c1.o, Vector(cos_alpha, sin_alpha)), delta2 = rotate(c2.o - c1.o, Vector(cos_alpha, -sin_alpha)); return {c1.o + delta1.unit() * c1.r, c1.o + delta2.unit() * c1.r}; } } vector<Vector> intersection(Line l, Circle c) { long double d = distance_to_line(c.o, l); if (sgn(d - c.r) > 0) { return {}; } else if (sgn(d - c.r) == 0) { return {perpendicular_foot(c.o, l)}; } else { Vector p = perpendicular_foot(c.o, l); long double delta = sqrt(sqr(c.r) - sqr(d)); return {p + l.v * delta, p - l.v * delta}; } } } // namespace geometry using namespace geometry; namespace solver1 { bool get(int a, int b) { int dist2 = sqr(x[a] - x[b]) + sqr(y[a] - y[b]); return dist2 < sqr(r[a] + r[b]) && dist2 > sqr(r[a] - r[b]); } bool in(int x0, int y0, int a) { return (sqr(x0 - x[a]) + sqr(y0 - y[a])) < sqr(r[a]); } bool sta[10]; void main() { if (n == 1) { puts( 2 ); return; } else if (n == 2) { if (get(1, 2)) { puts( 4 ); } else puts( 3 ); return; } else { Circle c[5]; for (int i = 1; i <= n; i++) c[i] = Circle(Vector(x[i], y[i]), r[i]); vector<Vector> i12 = intersection(c[1], c[2]), i13 = intersection(c[1], c[3]), i23 = intersection(c[2], c[3]); vector<Vector> p; for (auto i : i12) p.push_back(i); for (auto i : i13) p.push_back(i); for (auto i : i23) p.push_back(i); std::sort(p.begin(), p.end()); p.erase(std::unique(p.begin(), p.end()), p.end()); int cnt[5]; memset(cnt, 0, sizeof cnt); for (auto i : p) { for (int j = 1; j <= 3; j++) { if (sgn((i - c[j].o).len() - r[j]) == 0) cnt[j]++; } } int tot = 0; for (int i = 1; i <= 3; i++) tot += cnt[i] ? cnt[i] : 1; printf( %d , tot + 2 - std::max((int)p.size(), 1)); } } } // namespace solver1 int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d%d , &x[i], &y[i], &r[i]); solver1::main(); }
|
#include <bits/stdc++.h> using namespace std; int t[1000009][11]; int main() { int n, i, j, x, y, ans; cin >> ans; for (i = 0; i <= 10; i++) { t[0][i] = 1; } for (i = 1; i < 1000009; i++) { for (j = 1; j <= 10; j++) { x = (i - j >= 0) ? t[i - j][j] : 0; y = (j > 1) ? t[i][j - 1] : 0; t[i][j] = x + y; if (t[i][j] == ans) { break; } } if (j < 11) break; } cout << i << << j << n ; for (i = 1; i <= j; i++) cout << i << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; void fun() {} long long mod = 1000000000 + 7; long long powe(long long x, long long y) { x = x % mod, y = y % (mod - 1); long long ans = 1; while (y > 0) { if (y & 1) { ans = (1ll * x * ans) % mod; } y >>= 1; x = (1ll * x * x) % mod; } return ans; } map<pair<long long, long long>, long long> m; long long ncr(long long n, long long r) { return n * (n - 1) * (n - 2) / 6; } int32_t main() { fun(); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t, temp; long long n, s, k; cin >> t; while (t--) { cin >> n >> s >> k; long long a[k]; long long i; long long num; for (i = 0; i < k; i++) { cin >> num; a[i] = num; } sort(a, a + k); long long num1 = INT_MAX, num2 = INT_MAX; for (i = s; i >= 1; i--) { if (!binary_search(a, a + k, i)) { num1 = i; break; } } for (i = s; i <= n; i++) { if (!binary_search(a, a + k, i)) { num2 = i; break; } } if (num1 == INT_MAX) cout << num2 - s << n ; else if (num2 == INT_MAX) cout << s - num1 << n ; else cout << min(s - num1, num2 - s) << n ; } }
|
#include <bits/stdc++.h> using namespace std; double x[100010], y[100010], X, Y, mem[100010]; int id[100010], len; int cmp(int i, int j) { if (fabs(x[i] - x[j]) > 1e-8) return x[i] < x[j]; return y[i] > y[j]; } int main() { int n, i, j, k, A, B, C, D; scanf( %d %d/%d %d/%d , &n, &A, &B, &C, &D); for (i = 0; i < n; i++) { scanf( %lf %lf , &X, &Y); x[i] = X; y[i] = Y; if (C && D) x[i] -= Y / C * D; if (A && B) y[i] -= X / B * A; id[i] = i; } sort(id, id + n, cmp); len = 0; for (i = 0; i < n; i++) if (x[id[i]] > 0 && y[id[i]] > 0) { k = lower_bound(mem, mem + len, y[id[i]] - 1e-8) - mem; if (k == len) len++; mem[k] = y[id[i]]; } printf( %d n , len); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } const long long L = 1e5 + 5; long long arr[L]; long long bo[L]; long long gi[L]; long long bg[L]; priority_queue<long long> val; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long i, b, g; cin >> b >> g; long long ans = 0; long long x = -1e18, y = 1e18; for (i = 0; i < b; i++) { bg[i] = 1; cin >> bo[i]; arr[i] = g - 1; ans += bo[i]; x = max(bo[i], x); } for (i = 0; i < g; i++) { cin >> gi[i]; ans += gi[i]; val.push(gi[i]); y = min(gi[i], y); } if (y < x) { cout << -1 << endl; return 0; } sort(bo, bo + b); i = b - 1; while (!val.empty() && i >= 0) { if (val.top() >= bo[i]) { if (arr[i] == 0) { if (bo[i] == val.top()) { ans -= bo[i]; val.pop(); } i--; continue; } arr[i]--; val.pop(); } else i--; } for (i = 0; i < b; i++) ans += arr[i] * bo[i]; cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 111; int a[maxn]; int getid[maxn]; int b[maxn]; int lpos[maxn]; vector<int> savepos[maxn]; vector<int> G[maxn]; vector<int> v; int n, m, q; int vis[maxn]; void dfs(int pos, int fa) { v.push_back(pos); vis[pos] = 1; if (v.size() >= n) { int id = v.size() - n; lpos[pos] = v[id]; } for (int d : G[pos]) { if (d == fa) continue; dfs(d, pos); } v.pop_back(); } int main() { cin >> n >> m >> q; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); getid[a[i]] = i; } for (int i = 1; i <= m; i++) { scanf( %d , &b[i]); savepos[b[i]].push_back(i); } for (int i = 1; i <= m; i++) { int nowval = b[i]; int preid = getid[nowval] - 1; if (!preid) preid = n; int preval = a[preid]; int id = lower_bound(savepos[preval].begin(), savepos[preval].end(), i) - savepos[preval].begin() - 1; if (id >= 0) { G[savepos[preval][id]].push_back(i); } savepos[nowval].push_back(i); } for (int i = 1; i <= m; i++) { if (!vis[i]) { v.clear(); dfs(i, -1); } } int p = 0; for (int i = 1; i <= m; i++) { lpos[i] = max(lpos[i - 1], lpos[i]); } while (q--) { int l, r; scanf( %d %d , &l, &r); if (l <= lpos[r]) { cout << 1; } else { cout << 0; } } }
|
#include <bits/stdc++.h> using namespace std; int flag[100005]; int ok, a[100005], b[100005], vis[100005]; vector<int> G[100005]; void Sech(int u, int p) { int i, v; vis[u] = 1; if (flag[u] == 1) ok = -1; flag[u] = -1; for (i = 0; i < G[u].size(); i++) { v = G[u][i]; if (v == p || vis[v]) continue; Sech(v, u); } } int main(void) { ok = 1; int n, m, i, j, len2, len1, ans; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { if (i == 1) { scanf( %d , &len2); for (j = 1; j <= len2; j++) scanf( %d , &b[j]); continue; } for (j = 1; j <= len2; j++) a[j] = b[j]; len1 = len2; scanf( %d , &len2); for (j = 1; j <= len2; j++) scanf( %d , &b[j]); for (j = 1; j <= min(len1, len2); j++) { if (a[j] < b[j]) { G[b[j]].push_back(a[j]); break; } else if (a[j] > b[j]) { if (flag[a[j]] == 1 || flag[b[j]] == -1) ok = -1; flag[a[j]] = -1, flag[b[j]] = 1; break; } } if (len1 > len2 && j == len2 + 1) { printf( No n ); return 0; } } if (ok == -1) { printf( No n ); return 0; } for (i = 1; i <= m; i++) { if (vis[i] == 0 && flag[i] == -1) Sech(i, -1); if (ok == -1) break; } if (ok == -1) { printf( No n ); return 0; } printf( Yes n ); ans = 0; for (i = 1; i <= m; i++) { if (flag[i] == -1) ans++; } printf( %d n , ans); for (i = 1; i <= m; i++) { if (flag[i] == -1) printf( %d , i); } if (ans != 0) printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int toint(char a) { return (a - 0 ); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tst; cin >> tst; while (tst--) { string a, s; cin >> a >> s; long long int num = stoll(a); long long int sum = stoll(s); if (s.length() < a.length()) { cout << -1 n ; } else if (a.length() == s.length()) { bool no = false; for (int i = s.length() - 1; i >= 0; i--) { if ((toint(s[i]) - toint(a[i])) < 0) { cout << -1 n ; no = true; break; } } if (!no) { cout << stoll(s) - stoll(a) << n ; } } else if (a.length() < s.length()) { int lastdigit; int lastsub; string ans; bool no = 0; int strlen = s.length(); while (strlen > 0) { lastsub = num % 10; if (sum % 10 - num % 10 < 0) { lastdigit = (sum % 10) + ((sum % 100) - (sum % 10)); sum /= 100; num /= 10; strlen -= 2; } else { lastdigit = sum % 10; sum /= 10; num /= 10; strlen--; } if (lastdigit - lastsub >= 0 && lastdigit - lastsub <= 9) { if (strlen != 0) { ans = to_string(lastdigit - lastsub) + ans; } else { if (lastdigit - lastsub != 0) { ans = to_string(lastdigit - lastsub) + ans; } } } else { cout << -1 n ; no = true; break; } } if (!no) { cout << ans << n ; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[100001], i, l, r, n, j, c44, c1, c4, c, x, ans, h, y, m, step[101], v, b[100500], d[100500]; string s; int main() { cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b + 1, b + n + 1); for (i = 1; i <= n; i++) { if (l <= b[i]) { c++; l += b[i]; } } cout << c; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000030; int num[MAXN]; int a[MAXN], b[MAXN]; int dex[MAXN]; int res[MAXN]; int bsch(int le, int ri, int key) { int l = le, r = ri; while (l <= r) { int m = (l + r) / 2; if (res[m] == key) return m; else if (res[m] > key) r = m - 1; else l = m + 1; } return l; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { scanf( %d , &b[i]); dex[b[i]] = i; } for (int i = 1; i <= n; i++) { num[i] = dex[a[i]]; } for (int i = 1; i <= n / 2; i++) { swap(num[i], num[n - i + 1]); } for (int i = 1; i <= n; i++) { res[i] = 1 << 30; } int maxv = 1; res[1] = num[1]; for (int i = 2; i <= n; i++) { int s = bsch(1, n, num[i]); res[s] = num[i]; if (maxv < s) maxv = s; } printf( %d n , maxv); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int n, m, num[40][40], len = 0, stat[20], sv[20], ans = 0; bool vis[10][10], vis2[10][10], usedr[10], have = false; string s[40]; vector<pair<int, int> > coo[400]; vector<int> pr[20]; bool stane = false; bool check(int pos) { map<pair<int, int>, int> mp; mp.clear(); for (int i = 0; i < pr[pos].size(); ++i) { int x = stat[pos], y = stat[pr[pos][i]]; if (vis[x][y] || mp[make_pair(x, y)]) return false; mp[make_pair(x, y)] = mp[make_pair(y, x)] = true; } return true; } void add(int pos, bool val) { for (int i = 0; i < pr[pos].size(); ++i) { int x = stat[pos], y = stat[pr[pos][i]]; vis[x][y] = vis[y][x] = val; } } void dfs(int pos, int curc) { if (pos == 14) { ++ans; if (!have) { have = true; for (int i = 0; i < 14; ++i) sv[i] = stat[i]; } return; } if (curc < 7) { stat[pos] = curc; if (check(pos)) { add(pos, true); dfs(pos + 1, curc + 1); add(pos, false); } } for (int i = 0; i < curc; ++i) { if (usedr[i]) continue; stat[pos] = i; if (check(pos)) { usedr[i] = true; add(pos, true); dfs(pos + 1, curc); usedr[i] = false; add(pos, false); } } } int main() { cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> s[i]; for (int j = 0; j < m; ++j) if (s[i][j] == A ) s[i][j] = z + 1; else if (s[i][j] == B ) s[i][j] = z + 2; } for (int i = 0; i < n + 5; ++i) for (int j = 0; j < m + 5; ++j) num[i][j] = -1; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if ( a <= s[i][j] && s[i][j] <= z + 2) { coo[s[i][j]].push_back(make_pair(i, j)); if (num[i][j] == -1) { for (int k = i; k < i + 2; ++k) for (int p = j; p < j + 2; ++p) num[k][p] = len; ++len; } } for (int i = a ; i <= z + 2; ++i) { int x = coo[i][0].first, y = coo[i][0].second, xx = coo[i][1].first, yy = coo[i][1].second; pr[max(num[x][y], num[xx][yy])].push_back(min(num[x][y], num[xx][yy])); } dfs(0, 0); cout << ans * 5040 << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (!( a <= s[i][j] && s[i][j] <= z + 2)) cout << . ; else cout << sv[num[i][j]]; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int m, k; cin >> m >> k; if (m % 2 == 0) { printf( %d n , m + k * 2); } else { int t; for (int i = 3; i <= m; i += 2) { if (m % i == 0) { t = i; break; } } k--; m += t; printf( %d n , m + k * 2); } } int main() { int n; cin >> n; while (n--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long m = 1e9 + 7; double eps = 1e-6; bool good[256]; long long n, spos = -1; int main(int argc, char *argv[]) { ios::sync_with_stdio(0); string g, pat; cin >> g; cin >> pat; cin >> n; for (int i = 0; (i) < (256); ++i) good[i] = false; for (int i = 0; (i) < (((int)(pat).size())); ++i) if (pat[i] == * ) spos = i; for (int i = 0; (i) < (((int)(g).size())); ++i) { good[int(g[i])] = true; } for (int i = 0; (i) < (n); ++i) { string s; bool pass = true; cin >> s; if (spos == -1) { if (((int)(pat).size()) != ((int)(s).size())) cout << NO << endl; else { for (int j = 0; (j) < (((int)(pat).size())); ++j) { if (pat[j] != ? && pat[j] != s[j]) pass = false; else if (pat[j] == ? && !good[int(s[j])]) pass = false; } if (pass) cout << YES << endl; else cout << NO << endl; } } else { if (((int)(s).size()) - ((int)(pat).size()) < -1) cout << NO << endl; else { long long offset = ((int)(s).size()) - ((int)(pat).size()); for (int j = 0; (j) < (spos); ++j) { if (pat[j] != ? && pat[j] != s[j]) pass = false; else if (pat[j] == ? && !good[int(s[j])]) pass = false; } for (long long j = spos + 1 + offset; j < ((int)(s).size()); j++) { if (pat[j - offset] != ? && pat[j - offset] != s[j]) pass = false; else if (pat[j - offset] == ? && !good[int(s[j])]) pass = false; } for (long long j = spos; j <= spos + offset; j++) if (good[int(s[j])]) pass = false; if (pass) cout << YES << endl; else cout << NO << endl; } } } 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]; vector<int> s(n, 0); s[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; i--) s[i] = max(a[i], s[i + 1]); for (int i = 0; i < n - 1; i++) cout << max(0, s[i + 1] - a[i] + 1) << ; cout << 0; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct pr { int a, b, n, x; pr(int a, int b, int n) : a(a), b(b), n(n) {} pr() : a(0), b(0), n(-1) {} }; int n, m; vector<pr> a, b; void connect(int x1, int& x2, int& y2) { if ((x2 != -1 && x2 != x1) || (y2 != -1 && y2 != x1)) { cout << -1; exit(0); } x2 = y2 = x1; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; a.push_back(pr(x, y, -1)); } for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; b.push_back(pr(x, y, -1)); } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i].a == b[j].a && a[i].b != b[j].b) connect(a[i].a, a[i].n, b[j].n); else if (a[i].b == b[j].b && a[i].a != b[j].a) connect(a[i].b, a[i].n, b[j].n); else if (a[i].a == b[j].b && a[i].b != b[j].a) connect(a[i].a, a[i].n, b[j].n); else if (a[i].b == b[j].a && a[i].a != b[j].b) connect(a[i].b, a[i].n, b[j].n); } } int ans = -1; for (int i = 0; i < n; i++) { if (a[i].n != -1) { if (ans == -1 || ans == a[i].n) ans = a[i].n; else { cout << 0; return 0; } } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 70, MAXM = 100, MOD = 1e9 + 7, INF = 1e9; char c[] = { c , o , d , e , f , o , r , c , e , s }; void solve() { long long n; cin >> n; long long x = 0, x1 = 0; while (pow(x + 1, 10) <= n) x++; while (pow(x, 10 - x1) * pow(x + 1, x1) < n) x1++; for (int i = 0; i < 10; i++) { if (i < x1) for (int j = 0; j <= x; j++) cout << c[i]; else for (int j = 0; j < x; j++) cout << c[i]; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
|
#include <bits/stdc++.h> using namespace std; const double SUCK = 999999999999999999.99; const int MX = 51 * 101; int n; int r; int f[55]; int s[55]; int p[55]; double cp[55]; double dp[55][MX]; bool isOk(double det) { for (int i = 0; i <= r; i++) { dp[n][i] = 0; } for (int i = n - 1; i >= 0; i--) { for (int j = 0; j <= r; j++) { dp[i][j] = det; double togo = 0; if (j + f[i] > r) { togo = det; } else { togo += cp[i] * (f[i] + dp[i + 1][j + f[i]]); if (j + s[i] > r) togo += (1 - cp[i]) * (s[i] + det); else togo += (1 - cp[i]) * (s[i] + dp[i + 1][j + s[i]]); } dp[i][j] = min(det, togo); } } if (dp[0][0] >= det) return false; return true; } const double eps = 0.000000001; time_t bg; double getTime() { time_t en = clock(); double ret = (double)(en - bg) / CLOCKS_PER_SEC; return ret; } double bsearch(double l, double r) { double m = (l + r) / 2; if (r - l < eps) return m; if (getTime() >= 1.95) return m; if (isOk(m)) return bsearch(l, m); else return bsearch(m, r); } int main() { bg = clock(); scanf( %d%d , &n, &r); for (int i = 0; i < n; i++) scanf( %d%d%d , &f[i], &s[i], &p[i]); for (int i = 0; i < n; i++) cp[i] = 0.010000 * p[i]; double ans = bsearch(n, 50000000); printf( %.12f , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 400010, inf = 1 << 30; int N, M, father[maxn], nxt[maxn], toit[maxn], len[maxn], side[maxn], id[maxn], seq[maxn], D[maxn], cnt; int DFN, dfn[maxn], top[maxn], size[maxn], con[maxn], ans[maxn], tree[maxn << 2], cover[maxn << 2]; bool exist[maxn]; inline int find(int a) { if (father[a] != a) father[a] = find(father[a]); return father[a]; } inline void add(int a, int b, int c, int d) { nxt[++cnt] = side[a]; side[a] = cnt; toit[cnt] = b; len[cnt] = c; id[cnt] = d; } inline void ins(int a, int b, int c, int d) { add(a, b, c, d); add(b, a, c, d); } inline int gi() { char ch; int ret = 0, f = 1; do ch = getchar(); while (!(ch >= 0 && ch <= 9 ) && ch != - ); if (ch == - ) f = -1, ch = getchar(); do ret = ret * 10 + ch - 0 , ch = getchar(); while (ch >= 0 && ch <= 9 ); return ret * f; } struct Edge { int u, v, c, id; inline void read(int i) { id = i; u = gi(), v = gi(), c = gi(); } inline void bind() { int a = find(u), b = find(v); if (a != b) { father[a] = b; exist[id] = true; ins(u, v, c, id); } } friend inline bool operator<(const Edge &a, const Edge &b) { return a.c < b.c; } } edge[maxn]; inline void Div(int now, int Top) { dfn[now] = ++DFN; seq[DFN] = now; top[now] = Top; int heavy = 0; for (int i = side[now]; i; i = nxt[i]) if (toit[i] != father[now] && size[toit[i]] > size[heavy]) heavy = toit[i]; if (!heavy) return; Div(heavy, Top); for (int i = side[now]; i; i = nxt[i]) if (toit[i] != father[now] && toit[i] != heavy) Div(toit[i], toit[i]); } inline void dfs(int now) { size[now] = 1; for (int i = side[now]; i; i = nxt[i]) if (toit[i] != father[now]) { father[toit[i]] = now, con[toit[i]] = i; D[toit[i]] = D[now] + 1, dfs(toit[i]); size[now] += size[toit[i]]; } } inline void mst() { sort(edge + 1, edge + M + 1); cnt = 1; for (int i = 1; i <= N; ++i) father[i] = i; for (int i = 1; i <= M; ++i) edge[i].bind(); father[1] = 0; dfs(1); Div(1, 1); } inline int ask(int now, int l, int r, int ql, int qr) { if (l == ql && r == qr) return tree[now]; int mid = (l + r) >> 1; if (qr <= mid) return ask(now << 1, l, mid, ql, qr); else if (ql > mid) return ask(now << 1 | 1, mid + 1, r, ql, qr); else return max(ask(now << 1, l, mid, ql, mid), ask(now << 1 | 1, mid + 1, r, mid + 1, qr)); } inline void modify(int now, int l, int r, int ql, int qr, int c) { if (l == ql && r == qr) { cover[now] = min(cover[now], c); return; } int mid = (l + r) >> 1; if (qr <= mid) modify(now << 1, l, mid, ql, qr, c); else if (ql > mid) modify(now << 1 | 1, mid + 1, r, ql, qr, c); else { modify(now << 1, l, mid, ql, mid, c); modify(now << 1 | 1, mid + 1, r, mid + 1, qr, c); } } inline int Query(int a, int b, int c) { int ret = -inf; while (top[a] != top[b]) { if (D[top[a]] < D[top[b]]) swap(a, b); ret = max(ret, ask(1, 1, N, dfn[top[a]], dfn[a])); modify(1, 1, N, dfn[top[a]], dfn[a], c); a = father[top[a]]; } if (D[a] < D[b]) swap(a, b); if (a != b) { ret = max(ret, ask(1, 1, N, dfn[b] + 1, dfn[a])); modify(1, 1, N, dfn[b] + 1, dfn[a], c); } return ret; } inline void build(int now, int l, int r) { cover[now] = inf; if (l == r) { tree[now] = len[con[seq[l]]]; return; } int mid = (l + r) >> 1; build(now << 1, l, mid); build(now << 1 | 1, mid + 1, r); tree[now] = max(tree[now << 1], tree[now << 1 | 1]); } inline int query(int now, int l, int r, int pos) { if (l == r) return cover[now]; int mid = (l + r) >> 1; if (pos <= mid) return min(cover[now], query(now << 1, l, mid, pos)); else return min(cover[now], query(now << 1 | 1, mid + 1, r, pos)); } inline void work() { build(1, 1, N); for (int i = 1; i <= M; ++i) if (!exist[edge[i].id]) ans[edge[i].id] = Query(edge[i].u, edge[i].v, edge[i].c); for (int i = 2; i <= N; ++i) ans[id[con[i]]] = query(1, 1, N, dfn[i]); for (int i = 1; i <= M; ++i) { if (ans[i] == inf) ans[i] = -1; else --ans[i]; printf( %d , ans[i]); } } int main() { N = gi(); M = gi(); for (int i = 1; i <= M; ++i) edge[i].read(i), ans[i] = inf; mst(); work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char a = getchar(); for (; !isdigit(a); a = getchar()) if (a == - ) f = -1; for (; isdigit(a); a = getchar()) x = x * 10 + a - 0 ; return x * f; } const unsigned long long INF = 1ULL << 63; const int N = 200 + 5; const int M = 50 + 5; int IG, IN, IM, n, ipt[N]; int issuf[N]; int vis[N][M][M]; unsigned long long f[N][M][M]; vector<pair<int, int> > ed[N]; int ch[M][2], fail[M * 2], ok[M * 2], tot = 1; void ins(int *A, int len) { int x = 1; for (int i = 1; i <= len; i++) { if (!ch[x][A[i]]) ch[x][A[i]] = ++tot; x = ch[x][A[i]]; } ok[x] = 1; } void buildfail() { queue<int> q; for (int i = 0; i <= 1; i++) if (ch[1][i]) fail[ch[1][i]] = 1, q.push(ch[1][i]); else ch[1][i] = 1; while (q.size()) { int x = q.front(); q.pop(); for (int i = 0; i <= 1; i++) if (ch[x][i]) { fail[ch[x][i]] = ch[fail[x]][i]; ok[ch[x][i]] |= ok[fail[ch[x][i]]]; q.push(ch[x][i]); } else ch[x][i] = ch[fail[x]][i]; } } int id[M * 2], loc[M * 2]; struct Node { int x, fr, to; unsigned long long val; Node(int X = 0, int F = 0, int T = 0, unsigned long long V = 0) : x(X), fr(F), to(T), val(V) {} inline friend bool operator<(const Node &a, const Node &b) { return a.val > b.val; } }; priority_queue<Node> hp; int main() { IG = read() - 1; IN = read(); IM = read(); n = IG; for (int i = 1; i <= IN; i++) { int a = read(), k = read(); for (int j = 1; j <= k; j++) ipt[j] = read(), issuf[j + n] = 1; for (int j = 2; j <= k; j++) { ed[n + j].push_back({n + j - 1, ipt[j - 1]}); ed[ipt[j - 1]].push_back({n + j - 1, n + j}); } ed[ipt[k]].push_back({n + k, -1}); ed[n + 1].push_back({a, -1}); n += k; } for (int i = 1; i <= IM; i++) { int len = read(); for (int j = 1; j <= len; j++) ipt[j] = read(); ins(ipt, len); } buildfail(); int cnt = 0; for (int i = 1; i <= tot; i++) if (ok[i] == 0) id[i] = ++cnt, loc[cnt] = i; for (int i = 0; i <= n; i++) for (int j = 1; j <= cnt; j++) for (int k = 1; k <= cnt; k++) f[i][j][k] = INF; for (int i = 1; i <= cnt; i++) { int x = loc[i]; if (id[ch[x][0]]) { f[0][i][id[ch[x][0]]] = 1; hp.push(Node(0, i, id[ch[x][0]], 1)); } if (id[ch[x][1]]) { f[1][i][id[ch[x][1]]] = 1; hp.push(Node(1, i, id[ch[x][1]], 1)); } } while (hp.size()) { Node tmp = hp.top(); hp.pop(); int x = tmp.x, fr = tmp.fr, to = tmp.to; unsigned long long val = tmp.val; if (vis[x][fr][to]) continue; vis[x][fr][to] = 1; for (auto e : ed[x]) { int y = e.first, w = e.second; if (w == -1) { if (f[y][fr][to] > val) { f[y][fr][to] = val; hp.push(Node(y, fr, to, f[y][fr][to])); } } else { if (issuf[x] == 0) { for (int j = 1; j <= cnt; j++) if (f[y][fr][j] > val + f[w][to][j]) { f[y][fr][j] = val + f[w][to][j]; hp.push(Node(y, fr, j, f[y][fr][j])); } } else { for (int j = 1; j <= cnt; j++) if (f[y][j][to] > f[w][j][fr] + val) { f[y][j][to] = f[w][j][fr] + val; hp.push(Node(y, j, to, f[y][j][to])); } } } } } for (int i = 2; i <= IG; i++) { unsigned long long ans = INF; for (int j = 1; j <= cnt; j++) ans = min(ans, f[i][1][j]); if (ans == INF) printf( YES n ); else printf( NO %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const std::string str = ATGC ; int main() { int n, m; std::vector<std::string> s; std::vector<std::string> tmp; std::vector<std::string> ans; int min_ans = INF, pos; std::cin >> n >> m; for (int i = 0; i < n; ++i) { std::string st; std::cin >> st; s.push_back(st); } for (int c1 = 0; c1 < 4; ++c1) for (int c2 = c1 + 1; c2 < 4; ++c2) { std::string stri; std::set<int> st; for (int i = 0; i < 4; ++i) st.insert(i); st.erase(c1); st.erase(c2); auto it = st.begin(); stri.push_back(str[c1]); stri.push_back(str[c2]); stri.push_back(str[*(it++)]); stri.push_back(str[*it]); pos = 0; tmp.clear(); for (int i = 0; i < n; ++i) { tmp.push_back( ); int bit = (i & 1) << 1; int cnt1 = 0, cnt2 = 0; for (int j = 0; j < m; ++j) { if (s[i][j] != stri[bit + (j & 1)]) ++cnt1; if (s[i][j] != stri[bit + ((j & 1) ^ 1)]) ++cnt2; } if (cnt1 < cnt2) for (int j = 0; j < m; ++j) tmp[i].push_back(stri[bit + (j & 1)]); else for (int j = 0; j < m; ++j) tmp[i].push_back(stri[bit + ((j & 1) ^ 1)]); pos += std::min(cnt1, cnt2); } if (pos < min_ans) { ans = tmp; min_ans = pos; } pos = 0; tmp.clear(); for (int i = 0; i < n; ++i) tmp.push_back( ); for (int j = 0; j < m; ++j) { int bit = (j & 1) << 1; int cnt1 = 0, cnt2 = 0; for (int i = 0; i < n; ++i) { if (s[i][j] != stri[bit + (i & 1)]) ++cnt1; if (s[i][j] != stri[bit + ((i & 1) ^ 1)]) ++cnt2; } if (cnt1 < cnt2) for (int i = 0; i < n; ++i) tmp[i].push_back(stri[bit + (i & 1)]); else for (int i = 0; i < n; ++i) tmp[i].push_back(stri[bit + ((i & 1) ^ 1)]); pos += std::min(cnt1, cnt2); } if (pos < min_ans) { ans = tmp; min_ans = pos; } } for (int i = 0; i < n; ++i) std::cout << ans[i] << std::endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long base = 233; const long long ff = 4e5 + 1; const long long mod = 1e9 + 7; const long long inf = 1e17 + 1; long long read() { long long x; scanf( %lld , &x); return x; } inline long long Read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 3) + (x << 1) + ch - 0 ; ch = getchar(); } return x * f; } long long a, b, c, d; long long my_max(long long x, long long y) { return (x > y) ? x : y; } void init() { long long ans = 0; a = Read(), b = Read(), c = Read(), d = Read(); for (long long i = a; i <= b; ++i) { long long st = my_max(min(i + b - c, d), 0LL); long long ed = my_max(min(i + c - 1, d) - c + 1, 0LL); long long q = max(ed - st + 1, 0LL); ans += (st + ed) * q / 2; if (i + c - 1 > d) ans += my_max(min((i + c - 1) - d, c - b + 1), 0LL) * (d - c + 1); } cout << ans; } signed main() { init(); }
|
#include <bits/stdc++.h> int main() { int n, m; scanf( %d%d , &n, &m); if (n % 2 != 0) { printf( %d , n); } else { int a[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , &a[i][j]); } } bool isSymmetric = true; while (isSymmetric == true && n % 2 == 0) { for (int i = 0; i < n / 2; i++) { for (int j = 0; j < m; j++) { if (a[i][j] != a[n - 1 - i][j]) { isSymmetric = false; break; } } } if (isSymmetric) { n = n / 2; } } printf( %d , n); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> questions(k); vector<int> previsited(n + 1, 0); vector<int> posvisited(n + 1, 0); vector<int> vis; int tot_non = n; for (int i = 0; i < k; i++) { cin >> questions[i]; if (!previsited[questions[i]]) { tot_non--; vis.push_back(questions[i]); previsited[questions[i]] = i + 1; } posvisited[questions[i]] = i + 1; } int ans = tot_non * 3; if (previsited[1] == 0) ans--; if (previsited[n] == 0) ans--; for (int i = 0; i < vis.size(); i++) { if (vis[i] <= n - 1 && previsited[vis[i]] > posvisited[vis[i] + 1]) { ans++; } if (vis[i] >= 2 && previsited[vis[i]] > posvisited[vis[i] - 1]) { ans++; } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long int MOD = (pow(10, 9) + 7); void vec_p(vector<long long int> &a) { for (long long int i = 0; i < a.size(); i++) { cout << a[i] << ; } cout << n ; } long long int vec_sum(vector<long long int> a) { long long int s = 0; for (long long int i = 0; i < a.size(); i++) { s += a[i]; } return s; } void pfx(vector<long long int> &a, vector<long long int> &prefix_sum) { prefix_sum[0] = a[0]; for (long long int i = 1; i < a.size(); i++) { prefix_sum[i] += (prefix_sum[i - 1] + a[i]); } } void sorting_p(vector<pair<long long int, long long int> > &a) { sort(a.begin(), a.end()); } void sorting(vector<long long int> &a) { sort(a.begin(), a.end(), greater<long long int>()); } void vec_in(vector<long long int> &a, long long int n) { for (long long int i = 0; i < n; i++) { long long int x; cin >> x; a.push_back(x); } } void Graph_in(vector<vector<long long int> > &G, long long int n) { long long int x, y; for (long long int i = 0; i < n; i++) { cin >> x >> y; G[x].push_back(y); G[y].push_back(x); } } void lps_table(string &s, vector<long long int> &lps) { long long int n = s.size(); long long int len = 0; for (long long int i = 1; i < n; i++) { while (s[i] != s[len] && len > 0) { len = lps[len - 1]; if (len == 0 && s[len] != s[i]) { lps[i] = 0; len = 0; break; } } if (s[len] == s[i]) { lps[i] = len + 1; len++; } if (len == 0 && s[len] != s[i]) { lps[i] = 0; len = 0; } } } void traversal(long long int &x, long long int &y, vector<vector<long long int> > &a, long long int r, long long int c) { if (x + 2 < r) { if (y + 1 < c) { if (a[x + 2][y + 1] == -1) { long long int i = x + 2; long long int j = y + 1; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } if (y - 1 < c && y - 1 >= 0) { if (a[x + 2][y - 1] == -1) { long long int i = x + 2; long long int j = y - 1; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } } if (x + 1 < r) { if (y + 2 < c) { if (a[x + 1][y + 2] == -1) { long long int i = x + 1; long long int j = y + 2; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } if (y - 2 < c && y - 2 >= 0) { if (a[x + 1][y - 2] == -1) { long long int i = x + 1; long long int j = y - 2; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } } if (x - 2 < r && x - 2 >= 0) { if (y + 1 < c) { if (a[x - 2][y + 1] == -1) { long long int i = x - 2; long long int j = y + 1; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } if (y - 1 < c && y - 1 >= 0) { if (a[x - 2][y - 1] == -1) { long long int i = x - 2; long long int j = y - 1; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } } if (x - 1 < r && x - 1 >= 0) { if (y + 2 < c) { if (a[x - 1][y + 2] == -1) { long long int i = x - 1; long long int j = y + 2; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } if (y - 2 < c && y - 2 >= 0) { if (a[x - 1][y - 2] == -1) { long long int i = x - 1; long long int j = y - 2; a[i][j] = a[x][y] ^ 1; traversal(i, j, a, r, c); } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int r, c; cin >> r >> c; if (r < c) { swap(r, c); } vector<vector<long long int> > a(r, vector<long long int>(c, -1)); for (long long int i = 0; i < r; i++) { for (long long int j = 0; j < c; j++) { if (a[i][j] == -1) { a[i][j] = 1; traversal(i, j, a, r, c); } } } long long int one = 0; for (long long int i = 0; i < r; i++) { for (long long int j = 0; j < c; j++) { if (a[i][j] == 1) { one++; } } } cout << one << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; int a[n + 1]; for (int i = 1; i <= n; ++i) cin >> a[i]; int ans = 0; for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; ans += min(a[u], a[v]); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a[101], b[101] = {0}, c[101] = {0}, n, m, i, j, k; scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { for (j = 1; j <= n; j++) { scanf( %d , &a[j]); c[j] += a[j]; } k = 0; for (j = 1; j <= n; j++) if (k < a[j]) k = a[j]; for (j = 1; j <= n; j++) if (a[j] == k) { b[j]++; break; } } j = 1; k = b[1]; for (i = 2; i <= n; i++) if (k < b[i]) { k = b[i]; j = i; } printf( %d n , j); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const double INF = 1e12, EPS = 1e-9; int n; pair<int, int> p[5000]; int main() { cin >> n; for (int i = 0; i < (int)n; i++) { int a, b; cin >> a >> b; p[i] = pair<int, int>(a, b); } sort(p, p + n); int mn = 0; for (int i = 0; i < (int)n; i++) { if (p[i].second >= mn) mn = p[i].second; else mn = p[i].first; } cout << mn << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; stack<char> s; map<char, char> type = {{ ( , ) }, { { , } }, { < , > }, { [ , ] }}; int ans = 0; for (auto it : str) { if (it == { || it == ( || it == < || it == [ ) { s.push(it); } else { if (s.empty()) { cout << Impossible n ; return 0; } else { if (type[s.top()] != it) { ans += 1; } s.pop(); } } } if (s.empty()) { cout << ans << n ; return 0; } cout << Impossible n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = (int)1e5 + 10; bool isp[maxn]; int _prime[maxn], lp = 0; int _minCost[maxn]; void InitPrime() { isp[0] = isp[1] = true; for (int i = 4; i < maxn; i += 2) isp[i] = true; for (int i = 3; i * i < maxn; i += 2) if (!isp[i]) for (int j = i * i; j < maxn; j += i) isp[j] = true; _prime[lp++] = 2; for (int i = 3; i < maxn; i += 2) if (!isp[i]) _prime[lp++] = i; } bool IsPrime(long long n) { if (n < maxn) return !isp[n]; for (int i = 0; i < lp && (long long)_prime[i] * _prime[i] <= n; ++i) { if (n % _prime[i] == 0) return false; } return true; } int minCost(long long n) { if (IsPrime(n)) return 1; for (int i = 0; i < lp && _prime[i] + 2 <= n; ++i) { if (n - _prime[i] >= 2 && IsPrime(n - _prime[i])) return 2; } return 3; } int main() { InitPrime(); long long n; cin >> n; cout << minCost(n) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const long long INFL = LLONG_MAX; const long double pi = acos(-1); int N; int A[300100]; long long S[300100]; int shouldCut[300100]; map<int, vector<int> > mymap; vector<int> v; int main() { ios_base::sync_with_stdio(0); cout.precision(15); cout << fixed; cout.tie(0); cin.tie(0); cin >> N; for (int(i) = 1, j123 = N; (i) <= j123; (i)++) { cin >> A[i]; S[i] = max(0, A[i]); S[i] += S[i - 1]; mymap[A[i]].push_back(i); v.push_back(A[i]); } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); int mx = -2e9; long long bestTot = -2e10; int bestFirst = -1; int bestLast = -1; for (int(i) = 0, j123 = int(v.size()); (i) < j123; (i)++) { if (int(mymap[v[i]].size()) > 1) { sort(mymap[v[i]].begin(), mymap[v[i]].end()); int curfirst = mymap[v[i]].front(); int curlast = mymap[v[i]].back(); long long score = S[curlast - 1] - S[curfirst]; score += A[curfirst]; score += A[curlast]; if (score > bestTot) { bestTot = score; bestFirst = curfirst; bestLast = curlast; } } } for (int i = 1; i < bestFirst; i++) shouldCut[i] = 1; for (int i = N; i > bestLast; i--) shouldCut[i] = 1; for (int i = bestFirst + 1; i <= bestLast - 1; i++) if (A[i] < 0) shouldCut[i] = 1; long long toteth = 0; vector<int> vec; for (int(i) = 1, j123 = N; (i) <= j123; (i)++) { if (shouldCut[i]) vec.push_back(i); else toteth += A[i]; } cout << toteth << << int(vec.size()) << n ; for (int(i) = 0, j123 = int(vec.size()); (i) < j123; (i)++) cout << vec[i] << (i + 1 < int(vec.size()) ? : n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1999999999; const double pi = acos(-1.0); const double eps = 1e-9; char gc() { char c; while (isspace(c = getchar())) ; return c; } int gs(char* s) { if (!fgets(s, 9999999, stdin)) return -1; int l = strlen(s); while (l && isspace(s[l - 1])) s[--l] = 0; return l; } int main() { ios::sync_with_stdio(false); cout << fixed << setprecision(15); int n; cin >> n; vector<int> v; for (int i = 0, _i = (n); i < (_i); i++) { int t; cin >> t; v.push_back(t); } sort((v).begin(), (v).end()); v.erase(unique((v).begin(), (v).end()), v.end()); for (int i = 0, _i = (((int)(v).size()) - 1); i < (_i); i++) { if (v[i] * 2 > v[i + 1]) { cout << YES ; return 0; } } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 24; int n, m, a[N][N], f[1 << 20]; char str[N][N]; void work() { int i, j, k, x; scanf( %d%d , &n, &m); for (i = 0; i < n; ++i) scanf( %s , str[i]); for (i = 0; i < n; ++i) for (j = 0; j < m; ++j) scanf( %d , &a[i][j]); for (i = 1; i < 1 << n; ++i) { x = __builtin_ctz(i & -i); f[i] = 1 << 30; for (j = 0; j < m; ++j) { f[i] = min(f[i], f[i ^ (1 << x)] + a[x][j]); int sum = 0, mx = 0, mask = 0; for (k = 0; k < n; ++k) { if (str[k][j] == str[x][j]) { sum += a[k][j]; mx = max(mx, a[k][j]); mask |= 1 << k; } } f[i] = min(f[i], f[i & (i ^ mask)] + sum - mx); } } cout << f[(1 << n) - 1] << endl; } int main() { work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int pw(long long int a, long long int b, long long int mod) { if (!b) return 1; if (b & 1) return a * pw(a * a % mod, b / 2, mod) % mod; return pw(a * a % mod, b / 2, mod) % mod; } const long long int MAXN = 1e5 + 10; const long long int MAXK = 1e4 + 10; const long long int INF = 8e18; const long long int MOD = 1e9 + 7; long long int h, n, m, k, dist[MAXK], mark[MAXK], seen[MAXN]; pair<long long int, long long int> A[MAXN]; vector<pair<long long int, long long int>> adj[MAXK]; set<pair<long long int, long long int>> st; priority_queue<pair<long long int, long long int>, vector<pair<long long int, long long int>>, greater<pair<long long int, long long int>>> pq; void Dijk() { fill(dist, dist + MAXK, INF); fill(mark, mark + MAXK, 0); dist[0] = 0; pq.push({0, 0}); while (!pq.empty()) { long long int u = pq.top().second; pq.pop(); if (mark[u]) continue; mark[u] = 1; for (pair<long long int, long long int>& e : adj[u]) { if (dist[e.first] <= dist[u] + e.second) continue; dist[e.first] = dist[u] + e.second; pq.push({dist[e.first], e.first}); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> h >> n >> m >> k; for (long long int i = 1; i <= n; i++) { cin >> A[i].first >> A[i].second; A[i].first--; if (A[i].first % k == 0) { st.insert({A[i].second, -i}); seen[i] = 1; } } Dijk(); while (m--) { long long int type; cin >> type; if (type == 1) { long long int x; cin >> x; for (long long int i = 0; i < k; i++) { adj[i].push_back({(i + x) % k, x}); } Dijk(); for (long long int i = 1; i <= n; i++) { if (!seen[i] && dist[A[i].first % k] <= A[i].first) { seen[i] = 1; st.insert({A[i].second, -i}); } } } if (type == 2) { long long int x, val; cin >> x >> val; if (seen[x]) st.erase({A[x].second, -x}); A[x].second -= val; if (seen[x]) st.insert({A[x].second, -x}); } if (type == 3) { if (st.empty()) { cout << 0 << n ; continue; } auto it = st.end(); it--; cout << (*it).first << n ; st.erase(it); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { cin >> x; } template <typename T, typename T0> void read(T &x, T0 &y) { cin >> x >> y; } template <typename T, typename T0, typename T1> void read(T &x, T0 &y, T1 &z) { cin >> x >> y >> z; } bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); } int digits(int n) { int x = floor(log10(n)) + 1; return x; } long long int fact(long long int n) { if (n == 0) return 1; return n * fact(n - 1); } bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } vector<bool> sieve(1000000, true); void sieve_er() { sieve[0] = false; sieve[1] = false; for (long long int i = 2; i * i <= 1000000; i++) { if (sieve[i] == true) { for (long long int j = i * i; j < 1000000; j += i) sieve[j] = false; } } } vector<long long int> vec; void divisors(long long int n) { for (long long int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i == i) vec.push_back(i); else { vec.push_back(i); vec.push_back(n / i); } } } } long long int total_divisors(long long int n) { long long int c = 0; for (long long int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i == i) c = c + 1; else c = c + 2; } } return c; } long long int nCr(long long int n, long long int r) { long long int ans = 1; for (long long int i = 0; i < r; i++) { ans *= n - i; ans /= i + 1; } return ans; } long long int power_m(long long int a, long long int b, long long int m = 1000000007) { a %= m; long long int res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } long long int power(long long int a, long long int b) { long long int res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; } long long int strTo(string s) { stringstream tmp(s); long long int x = 0; tmp >> x; return x; } string NoTo(long long int n) { ostringstream str1; str1 << n; string ans = str1.str(); return ans; } void start() {} int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; int ans = 0; if (x1 == x2) ans = abs(y1 - y2); else if (y1 == y2) ans = abs(x1 - x2); else { ans += abs(x1 - x2); ans += 2; ans += abs(y1 - y2); } cout << ans << endl; } cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, p, k; long long a, ans = 0; map<long long, long long> mp; scanf( %d %d %d , &n, &p, &k); for (int i = 0; i < n; i++) { scanf( %lld , &a); ans += mp[((((a * a) % p) * ((a * a) % p)) % p - (k * a) % p + p) % p]++; } printf( %lld , ans); }
|
#include <bits/stdc++.h> int abss(int a); int main() { int size; scanf( %d , &size); int colunm[size + 10][2]; int i; int left = 0, right = 0; for (i = 1; i <= size; i++) { scanf( %d %d , &colunm[i][0], &colunm[i][1]); left += colunm[i][0]; right += colunm[i][1]; } int abs = abss(left - right); int max = 0, temp, flag = 0; for (i = 1; i <= size; i++) { int tLeft = left; int tRight = right; tLeft = tLeft - colunm[i][0] + colunm[i][1]; tRight = tRight - colunm[i][1] + colunm[i][0]; int tAbs = abss(tLeft - tRight); temp = tAbs - abs; if (temp > max) { max = temp; flag = i; } } printf( %d , flag); return 0; } int abss(int a) { if (a > 0) return a; else return -a; }
|
#include <bits/stdc++.h> using namespace std; int n, k; int num[500005]; long long dp[500005]; int cnt[500005]; bool ok(int cost) { dp[0] = dp[1] = cnt[0] = cnt[1] = 0; for (int i = (2); i <= (n); i += (1)) { dp[i] = dp[i - 1]; cnt[i] = cnt[i - 1]; long long v = dp[i - 2] + num[i] - num[i - 1] - cost; int c = cnt[i - 2] + 1; if (v < dp[i] || v == dp[i] && c > cnt[i]) dp[i] = v, cnt[i] = c; } return (cnt[n] >= k); } int main() { scanf( %d %d , &k, &n); for (int i = (1); i <= (n); i += (1)) scanf( %d , &num[i]); sort(num + 1, num + n + 1); int l = 0, r = 1000000000; while (l <= r) { int m = (l + r) >> 1; if (ok(m)) r = m - 1; else l = m + 1; } ok(l); printf( %lld n , dp[n] + 1LL * l * k); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int ans = 0; long long p = 1, q = 2, r, n; cin >> n; while (q <= n) { ans++; r = q; q = p + q; p = r; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 8; const int dx[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1}; const int dy[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1}; string a[N]; int v[105][N][N], f[105][N][N]; int main() { for (int i = 0; i < N; ++i) cin >> a[i]; memset(v, 0, sizeof(v)); for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (a[i][j] == S ) for (int k = i + 1; k <= N; ++k) v[k - i][k][j] = v[k - i][k - 1][j] = 1; memset(f, 0, sizeof(f)); f[0][7][0] = 1; for (int t = 1; t <= 100; ++t) for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (f[t - 1][x][y]) for (int dire = 0; dire < 9; ++dire) { int xx = x + dx[dire]; int yy = y + dy[dire]; if (xx < 0 || xx >= N) continue; if (yy < 0 || yy >= N) continue; if (v[t][xx][yy]) continue; f[t][xx][yy] = 1; } bool flag = 0; for (int t = 1; t <= 100; ++t) flag |= f[t][0][7]; if (flag) cout << WIN ; else cout << LOSE ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> p(n); for (int i = 0; i < n; ++i) { cin >> p[i]; } vector<int> f(n + 1, 0); for (int& x : p) { f[x] = f[x - 1] + 1; } cout << n - *max_element(f.begin(), f.end()); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, h, l = 0, c = 0, a = 0, b = 0, d; cin >> n >> h; while (n--) { cin >> d; c += d; if (c > a) a = c; else if (c < b) b = c; } l -= b; h -= a; d = h - l + 1; if (d < 0) d = 0; cout << d; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const double PI = acos(-1.0); const long long int mod = 1e9 + 9; const int MAXN = 1e6 + 5; long long int fpow(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = (res % mod * x % mod) % mod; x = (x % mod * x % mod) % mod; y = y / 2; } return res; } void cp() { int n, m; cin >> n >> m; long long int total = (fpow(2, m) - 1 + mod) % mod; long long int ans = 1; for (int i = 0; i < n; i++) { long long int me = me = (total - i + mod) % mod; ans = (ans % mod * me % mod) % mod; } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t; t = 1; while (t--) { cp(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int i, m, x = 0, n, a[1000], j; int main() { cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) { m = 1; for (j = i - 1; j >= 0; j--) if (a[j] <= a[j + 1]) ++m; else break; for (j = i + 1; j < n; j++) if (a[j] <= a[j - 1]) ++m; else break; x = max(x, m); } cout << x; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; double ans = 0; void calc(vector<int> arr, int d, double p) { if (d == 0) { int tmp = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < i; ++j) { if (arr[j] > arr[i]) { tmp++; } } } ans += double(tmp) * p; return; } for (int i = 0; i < n; ++i) { for (int j = i; j < n; ++j) { vector<int> xxx = arr; reverse(xxx.begin() + min(i, j), xxx.begin() + max(i, j) + 1); calc(xxx, d - 1, p / (n * (n + 1) / 2)); } } } int main() { int dep; cin >> n >> dep; vector<int> vec(n); for (int i = 0; i < n; ++i) { scanf( %d , &vec[i]); } calc(vec, dep, 1); printf( %.10lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, p, i, j, val, sum = 0, ans = 0; scanf( %lld %lld , &n, &p); long long int a[n]; for (i = 0; i < n; i++) { scanf( %lld , &a[i]); sum += a[i]; } sum %= p; val = 0; for (i = 0; i < n - 1; i++) { val += a[i]; val %= p; if (sum - val >= 0) { if (sum > ans) ans = sum; } else { ans = sum + p; break; } } printf( %lld , ans); return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.