func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long int n, ar[100001], max_s[100001], max_e[100001], pre_s[100001], pre_e[100001], ans = INT_MIN; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> ar[i]; for (int i = 1; i < n; i++) pre_s[i] = pre_s[i - 1] + ar[i - 1]; for (int i = n - 2; i >= 0; i--) pre_e[i] = pre_e[i + 1] + ar[i + 1]; max_e[n - 1] = abs(ar[n - 1]); max_s[0] = abs(ar[0]); for (int i = n - 2; i >= 0; i--) max_e[i] = max(ar[i] + max_e[i + 1], -(ar[i] + pre_e[i])); for (int i = 1; i < n; i++) max_s[i] = max(ar[i] + max_s[i - 1], -(ar[i] + pre_s[i])); ans = max(ans, max_e[0]); ans = max(ans, max_s[n - 1]); for (int i = 0; i < n - 1; i++) ans = max(ans, max_s[i] + max_e[i + 1]); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996); long long int n, h[1000007], d[1000007][2], mod = 1e9 + 7; void solve() { long long int i, j; cin >> n; for (i = 0; i < n; i++) { cin >> h[i]; h[i] -= 1; } h[n] = 0; d[0][0] = max((long long int)0, h[0] - h[1]); d[0][1] = min(h[0], h[1]); for (i = 1; i < n; i++) { long long int k = min(h[i - 1], h[i]); d[i][0] = d[i - 1][1] * max((long long int)0, k - h[i + 1]); d[i][0] %= mod; d[i][0] = (d[i][0] + max((long long int)0, h[i] - h[i + 1])) % mod; d[i][1] = d[i - 1][1] * min(h[i + 1], k); d[i][1] %= mod; d[i][1] = (d[i][1] + min(h[i], h[i + 1])) % mod; } long long int ans = 0; for (i = 0; i < n; i++) { ans = (ans + d[i][0] + d[i][1]) % mod; } cout << ans; } int main() { #pragma comment(linker, /STACK:1073741824 solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int setBit(int n, int pos) { return n | (1 << pos); } int resetBit(int n, int pos) { return n & ~(1 << pos); } bool checkBit(int n, int pos) { return n & (1 << pos); } inline long long bigmod(long long p, long long e, long long M) { long long ret = 1; while (e > 0) { if (e % 2) ret = (ret * p) % M; p = (p * p) % M; e /= 2; } return ret; } inline long long power(long long x, long long y) { long long ans = 1; while (y > 0) { if (y % 2) ans *= x; x *= x; y /= 2; } return ans; } template <class T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); } int n, k, a, b, c, d; int vis[1003]; int main() { cin >> n >> k >> a >> b >> c >> d; if (k < n + 1 || n == 4) { cout << -1; return 0; } vis[a] = vis[b] = vis[c] = vis[d] = 1; printf( %d %d , a, c); for (int i = 1; i <= n; i++) { if (vis[i] == 0) { printf( %d , i); } } printf( %d %d n , d, b); printf( %d %d , c, a); for (int i = 1; i <= n; i++) { if (vis[i] == 0) { printf( %d , i); } } printf( %d %d , b, d); } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,avx ) using namespace std; int n, q, fa[66666], aa[66666], kh[66666], a[66666], p[66666], fp[66666], siz[66666], ck, pa[66666]; vector<int> edge[66666]; int dd[66666]; void dfs(int u) { siz[u] = 1; p[++ck] = u; fp[u] = ck; pa[ck] = fp[fa[u]]; dd[ck] = dd[pa[ck]] + 1; for (auto v : edge[u]) { dfs(v); siz[u] += siz[v]; } } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; ++i) { scanf( %d , aa + i); } for (int i = 2; i <= n; ++i) { scanf( %d , fa + i); edge[fa[i]].push_back(i); } dfs(1); for (int i = 1; i <= n; ++i) { a[fp[i]] = aa[i]; } for (int i = 1; i <= q; ++i) { int x; scanf( %d , &x); int y = siz[x]; x = fp[x]; int pp = i + 1, gg = y >> 3, *jj = kh + x, *diao = dd + x, *aa = a + x; int ans = 0, cnt = 0; for (int j = 0; j ^ gg; ++j, jj += 8, diao += 8, aa += 8) { if (jj[0] < pp) ans += diao[0], jj[0] = i + aa[0], ++cnt; if (jj[1] < pp) ans += diao[1], jj[1] = i + aa[1], ++cnt; if (jj[2] < pp) ans += diao[2], jj[2] = i + aa[2], ++cnt; if (jj[3] < pp) ans += diao[3], jj[3] = i + aa[3], ++cnt; if (jj[4] < pp) ans += diao[4], jj[4] = i + aa[4], ++cnt; if (jj[5] < pp) ans += diao[5], jj[5] = i + aa[5], ++cnt; if (jj[6] < pp) ans += diao[6], jj[6] = i + aa[6], ++cnt; if (jj[7] < pp) ans += diao[7], jj[7] = i + aa[7], ++cnt; } gg <<= 3; for (int j = gg; j < y; ++j) { if (jj[j - gg] < pp) ans += diao[j - gg], jj[j - gg] = i + aa[j - gg], ++cnt; ; } ans = ans - cnt * dd[x]; printf( %d %d n , ans, cnt); } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; for (int i = 1; i <= 1000000000; i++) { if (i % 2 == 1) { if (a >= i) { a -= i; } else { cout << Vladik ; return 0; } } else { if (b >= i) { b -= i; } else { cout << Valera ; return 0; } } } } |
#include <bits/stdc++.h> using namespace std; int f[4005][4005]; int a[4005]; int main() { int i, j, k, n, m = 0; memset(f, 0, sizeof(f)); cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; k = 0; for (j = 0; j < i; j++) { f[i][j] = f[j][k] + 1; if (a[j] == a[i]) { k = j; } m = max(m, f[i][j]); } } cout << m << endl; } |
#include <bits/stdc++.h> using namespace std; inline long long isqrt(long long k) { long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline long long mnz(long long& a, long long b) { return a = (a > b ? b : a); } inline long long mxz(long long& a, long long b) { return a = (a < b ? b : a); } inline string toString(long long n) { stringstream ss; ss << n; return ss.str(); } double const eps = 1e-6; long long const Base = 1e9 + 7, oo = 1e17, MAXN = 1e6; long long A[MAXN + 5]; vector<long long> dske[MAXN + 5]; bitset<MAXN + 5> bi; long long Solves() { long long n, m, k, cnt = 0, ans = 0, x = -1, y = -1, q, c, sum = 0, v, t = -1; cin >> n; for (long long i = 1; i <= n; i++) dske[i].clear(), bi[i] = 0; for (long long i = 1; i <= n; i++) { cin >> k; c = 0; while (k--) { cin >> x; if (!bi[x] and !c) c = x; } if (c) bi[c] = 1; else y = i; } if (y == -1) return cout << OPTIMAL << endl, 0; vector<long long> vec; for (long long i = 1; i <= n; i++) if (!bi[i]) vec.push_back(i); map<long long, long long> mm; for (long long i = 0; i < dske[y].size(); i++) mm[dske[y][i]] = 1; for (long long i = 0; i < vec.size(); i++) { if (!mm[vec[i]]) { cout << IMPROVE << endl; cout << y << << vec[i] << endl; return 0; } } assert(0); return 0; } int main() { if (fopen( locin.txt , r )) freopen( locin.txt , r , stdin); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long test = 1; cin >> test; for (long long T = 1; T <= test; T++) { Solves(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; vector<string> res; for (int i = 0; i < t; ++i) { long long int a, b; cin >> a >> b; if (a > b) swap(a, b); if ((a + b) % 3 == 0 && 2 * a >= b) res.push_back( YES ); else res.push_back( NO ); } for (int i = 0; i < t; ++i) { cout << res[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 + 10; map<char, int> d, t; string s; string know[MAXN]; int pd[MAXN]; int n, m, ans, q, x; int main() { cin >> n; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] != * ) x++; } if (x == s.size()) { cout << 0 << endl; return 0; } for (int i = 0; i < s.size(); i++) d[s[i]]++; cin >> m; for (int i = 1; i <= m; i++) cin >> know[i]; for (int i = 1; i <= m; i++) { int cnt = 0, z = 0; memset(pd, 0, sizeof(pd)); for (int j = 0; j < know[i].size(); j++) { if (s[j] != * && s[j] != know[i][j]) { z = 1; break; } } if (z) { q++; continue; } for (int j = 0; j < know[i].size(); j++) { if (d[know[i][j]] && s[j] == * ) { z = 1; break; } } if (z) { q++; continue; } for (int j = 0; j < know[i].size(); j++) { if (!pd[know[i][j] - a ] && !d[know[i][j]]) { pd[know[i][j] - a ] = 1; t[know[i][j]]++; z = 1; } } if (!z) q++; } for (int i = 0; i <= 25; i++) { char k = a + i; if (!d[k] && t[k] == m - q && t[k]) ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { int c; while (a != 0) { c = a; a = b % a; b = c; } return b; } int main() { ios_base::sync_with_stdio(0); int n, m, b = 0; cin >> n >> m; vector<vector<int> > arr(n, vector<int>(4, 0)); for (int i = 0; i < n; i++) { if (b < m) { b++; arr[i][0] = b; } if (b < m) { b++; arr[i][3] = b; } } for (int i = 0; i < n; i++) { if (b < m) { b++; arr[i][1] = b; } if (b < m) { b++; arr[i][2] = b; } } for (int i = 0; i < n; i++) { if (arr[i][1] != 0) cout << arr[i][1] << ; if (arr[i][0] != 0) cout << arr[i][0] << ; if (arr[i][2] != 0) cout << arr[i][2] << ; if (arr[i][3] != 0) cout << arr[i][3] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1001], b[1001], c[1001], d[1001]; int ans[2][1001]; int main() { int n, m, c0, d0; cin >> n >> m >> c0 >> d0; for (int i = 0; i < m; ++i) cin >> a[i] >> b[i] >> c[i] >> d[i]; ans[0][0] = 0; for (int i = 1; i <= n; ++i) { ans[0][i] = ans[0][i - 1]; if (i >= c0) ans[0][i] = max(ans[0][i - 1], ans[0][i - c0] + d0); } for (int j = 0; j < m; ++j) { ans[1][0] = ans[0][0]; for (int i = 1; i <= n; ++i) { ans[1][i] = max(ans[1][i - 1], ans[0][i]); for (int t = 0; t <= a[j] / b[j] && t * c[j] <= i; ++t) ans[1][i] = max(ans[1][i], ans[0][i - t * c[j]] + t * d[j]); } for (int i = 0; i <= n; ++i) { ans[0][i] = ans[1][i]; } } cout << ans[0][n] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ld = long double; using ll = long long; using ull = unsigned long long; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int SZ = 1 << 13; char buff[SZ], *pos = buff + SZ - 1; inline ll read() { ll x = 0; int f = 1, c = (++pos == buff + SZ ? fread(pos = buff, 1, SZ, stdin), *pos : *pos); for (; !isdigit(c); c = (++pos == buff + SZ ? fread(pos = buff, 1, SZ, stdin), *pos : *pos)) if (c == - ) f = -f; for (; isdigit(c); c = (++pos == buff + SZ ? fread(pos = buff, 1, SZ, stdin), *pos : *pos)) x = (x << 3) + (x << 1) + (c ^ 48); return x * f; } const int N = 5005; int n; int T; int t[N]; ld p[N], pw[N]; ld dp[2][N]; int main() { cout << fixed << setprecision(9); n = read(), T = read(); for (int i = 1; i <= n; ++i) p[i] = read() / 100.0, t[i] = read(), pw[i] = pow(1 - p[i], t[i] - 1); ld ans = 0; dp[0][0] = 1; int pp = 0, qq = 1; for (int i = 1; i <= n; ++i) { ld sum = 0; for (int j = 1; j <= T; ++j) { sum = sum * (1 - p[i]) + dp[pp][j - 1]; if (j >= t[i]) sum -= dp[pp][j - t[i]] * pw[i]; dp[qq][j] = sum * p[i]; if (j >= t[i]) dp[qq][j] += dp[pp][j - t[i]] * pw[i]; ans += dp[qq][j]; } swap(pp, qq); memset(dp[qq], 0, sizeof dp[qq]); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200002; vector<vector<pair<int, int> > > ans; vector<vector<int> > cs, twoCs, threeCs; int n, p[N]; int main() { ios::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) cin >> p[i]; bool mark[N] = {}; for (int i = 1; i <= n; i++) if (!mark[i] && p[i] != i) { vector<int> newC; int v = i; while (!mark[v]) { mark[v] = 1; newC.push_back(v); v = p[v]; } cs.push_back(newC); } for (int i = 0; i < cs.size(); i++) while (cs[i].size() >= 4) { vector<pair<int, int> > move; for (int j = max(0, (int)cs[i].size() - 5); j + 1 < cs[i].size(); j++) move.push_back(make_pair(cs[i][j], cs[i][j + 1])); move.push_back( make_pair(cs[i].back(), cs[i][max((int)cs[i].size() - 5, 0)])); ans.push_back(move); for (int j = 0; j < 4; j++) cs[i].pop_back(); } for (int i = 0; i < cs.size(); i++) if (cs[i].size() == 2) twoCs.push_back(cs[i]); else if (cs[i].size() == 3) threeCs.push_back(cs[i]); while (threeCs.size()) { vector<pair<int, int> > move; vector<int> &tt = threeCs.back(); move.push_back(make_pair(tt[0], tt[1])); move.push_back(make_pair(tt[1], tt[2])); move.push_back(make_pair(tt[2], tt[0])); threeCs.pop_back(); if (twoCs.size()) { tt = twoCs.back(); move.push_back(make_pair(tt[0], tt[1])); move.push_back(make_pair(tt[1], tt[0])); twoCs.pop_back(); } else if (threeCs.size()) { tt = threeCs.back(); move.push_back(make_pair(tt[0], tt[1])); move.push_back(make_pair(tt[1], tt[0])); vector<int> newC; newC.push_back(tt[0]); newC.push_back(tt[2]); twoCs.push_back(newC); threeCs.pop_back(); } ans.push_back(move); } while (twoCs.size()) { vector<pair<int, int> > move; vector<int> &tt = twoCs.back(); move.push_back(make_pair(tt[0], tt[1])); move.push_back(make_pair(tt[1], tt[0])); twoCs.pop_back(); if (twoCs.size()) { tt = twoCs.back(); move.push_back(make_pair(tt[0], tt[1])); move.push_back(make_pair(tt[1], tt[0])); twoCs.pop_back(); } ans.push_back(move); } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { cout << ans[i].size() << endl; for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j].first << ; cout << endl; for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j].second << ; cout << endl; } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) const int N = 550; using namespace std; int n; int m; int k; long long d[N][N][2]; long long cost[N][N]; vector<pair<int, long long> > R[N][N]; vector<pair<int, long long> > D[N][N]; vector<pair<int, long long> > nv; void normal(vector<pair<int, long long> > &v) { sort(v.begin(), v.end()); reverse(v.begin(), v.end()); for (int i = 1; i < v.size(); i++) { v[i].second += v[i - 1].second; } } void upd(long long &x, long long y) { x = min(x, y); } bool good(vector<pair<int, int> > &g, int i, int t) { int cur = g[i].first + g[i].second; if (cur >= t && (cur - t) % 4 == i) { return true; } return false; } int main() { ios_base::sync_with_stdio(0); scanf( %d%d%d , &n, &m, &k); vector<pair<int, int> > g; for (int i = 1, x, y, d, t, e; i <= k; i++) { scanf( %d%d%d%d%d , &x, &y, &d, &t, &e); g.clear(); g.push_back({x, y}); g.push_back({x + d, y - d}); g.push_back({x + d, y}); g.push_back({x, y + d}); for (int i = 0; i < 4; i++) { if (good(g, i, t)) { cost[g[i].first][g[i].second] += e; } } if (good(g, 0, t) && good(g, 3, t)) { R[g[3].first][g[3].second].push_back({g[0].second, e}); } if (good(g, 0, t) && good(g, 2, t)) { D[g[2].first][g[2].second].push_back({g[0].first, e}); } if (good(g, 1, t) && good(g, 2, t)) { R[g[2].first][g[2].second].push_back({g[1].second, e}); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { normal(R[i][j]); normal(D[i][j]); } } for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { d[i][j][0] = 1e18; d[i][j][1] = 1e18; } } d[0][0][0] = 0; d[0][0][1] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { long long cnt = d[i][j][1]; for (int h = j + 1; h < m; h++) { while (!R[i][h].empty() && R[i][h].back().first < j) { R[i][h].pop_back(); } if (!R[i][h].empty()) { cnt -= R[i][h].back().second; } cnt += cost[i][h]; upd(d[i][h][0], cnt); } cnt = d[i][j][0]; for (int h = i + 1; h < n; h++) { while (!D[h][j].empty() && D[h][j].back().first < i) { D[h][j].pop_back(); } if (!D[h][j].empty()) { cnt -= D[h][j].back().second; } cnt += cost[h][j]; upd(d[h][j][1], cnt); } } } printf( %lld n , min(d[n - 1][m - 1][0], d[n - 1][m - 1][1]) + cost[0][0]); } |
#include <bits/stdc++.h> using namespace std; long long n, _C; long long lo, hi; set<long long> S; vector<long long> vec; int actual; long long offset; void ask(long long x) { S.insert(x); vec.emplace_back(x); if (actual) cout << ? << x << n ; if (actual) cin >> x; else x = abs(vec[(int)vec.size() - 2] - vec.back()) >= _C; if ((int)vec.size() > 1) { long long d = abs(vec[(int)vec.size() - 2] - vec.back()); if (x) hi = min(hi, d); else lo = max(lo, d + 1); } } long long solve() { vec.clear(); S.clear(); lo = 1; hi = n; long long cur = offset; ask(cur); while (lo < hi) { long long mid = (lo + hi) / 2; int p1 = (lo & 1); int p2 = (hi & 1); if ((lo & 1) == (hi & 1)) mid--; if ((int)S.size() & 1) ask(vec.back() - mid); else ask(vec.back() + mid); } if (actual) cout << = << lo << n ; return *S.begin(); } int main() { ios_base::sync_with_stdio(0); int itest; cin >> itest; while (itest--) { cin >> n; offset = 0; _C = n; actual = 0; offset = 1 - solve(); actual = 1; solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t, n; cin >> t; while (t--) { long long x; double sum = 0; cin >> n >> x; vector<long long> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; sum += v[i]; } sort(v.begin(), v.end()); int ans = sum / n >= x ? n : 0; double subSum = 0; for (int i = 0; i < n and !ans; i++) { subSum += v[i]; if ((sum - subSum) / (n - (i + 1)) >= x) { ans = n - (i + 1); break; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 5e5 + 5; int n, m; ll c[N]; vector<int> adj[N]; map<vector<int>, ll> mp; ll custom_gcd(ll a, ll b) { ll c; while (b > 0) { c = a % b; a = b; b = c; } return a; } void solve() { mp.clear(); cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> c[i]; adj[i].clear(); } for (int i = 1, u, v; i <= m; ++i) { cin >> u >> v; adj[v].emplace_back(u); } for (int i = 1; i <= n; ++i) { sort(adj[i].begin(), adj[i].end()); if (!adj[i].empty()) mp[adj[i]] += c[i]; } ll ans = 0; for (auto &p : mp) { ans = custom_gcd(ans, p.second); } cout << ans << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000 + 1; char a[N][N]; int f[N * 2], head[1000001], vis[2 * N], d[N * 2], d1[N * 2], bj[N * 2]; int ask(int x) { return x == f[x] ? x : f[x] = ask(f[x]); } struct node { int next, to; } e[N * N]; int tot; void add(int x, int y) { e[++tot].to = y; e[tot].next = head[x]; head[x] = tot; } int cnt; int solve() { queue<int> q; for (int i = 1; i <= cnt; i++) { if (d[i] == 0) q.push(i); } while (!q.empty()) { int p = q.front(); q.pop(); for (int i = head[p]; i; i = e[i].next) { int u = e[i].to; d[u]--; if (d[u] == 0) q.push(u); } } for (int i = 1; i <= cnt; i++) if (d[i]) return 1; return 0; } void dfs(int u, int w) { bj[u] = w; for (int i = head[u]; i; i = e[i].next) { int v = e[i].to; if (bj[v] < w + 1) dfs(v, w + 1); } } void solve1() { queue<int> q; for (int i = 1; i <= cnt; i++) if (!d1[i]) q.push(i), bj[i] = 1; while (!q.empty()) { int p = q.front(); q.pop(); for (int i = head[p]; i; i = e[i].next) { int u = e[i].to; d1[u]--; bj[u] = max(bj[u], bj[p] + 1); if (!d1[u]) q.push(u); } } } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n + m; i++) f[i] = i; for (int i = 1; i <= n; i++) { cin >> a[i] + 1; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { int f1 = ask(i), f2 = ask(n + j); if (a[i][j] != = ) { if (f1 == f2) { cout << No n ; return 0; } } else { f[f1] = f2; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { int f1 = ask(i), f2 = ask(n + j); if (!vis[f1]) vis[f1] = ++cnt; if (!vis[f2]) vis[f2] = ++cnt; if (a[i][j] != = ) { if (f1 == f2) { cout << No n ; return 0; } if (a[i][j] == < ) add(vis[f1], vis[f2]), d[vis[f2]]++, d1[vis[f2]]++; else add(vis[f2], vis[f1]), d[vis[f1]]++, d1[vis[f1]]++; } } } if (solve()) { cout << No n ; return 0; } solve1(); cout << Yes n ; for (int i = 1; i <= n + m; i++) { cout << bj[vis[ask(i)]] << ; if (i == n) cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; typedef long double ld; const long long inf = 1100000000000000000; #define maxn 1000005 #define mod 1000000007 //998244353 #define int long long #define PB push_back #define eb emplace_back #define all(c) (c).begin(),(c).end() #define pii pair <int,int> #define vi vector<int> #define F first #define S second #define rep(i,a,b) for(int i=a;i<b;i++) #define rep1(i,a,b) for(int i=a;i<=b;i++) #define repd(i,a,b) for(int i=a;i>=b;--i) #define sz(x) (int)((x).size()) #define mem(a,x) memset(a,x,sizeof(a)) const long double PI=3.141592653589793238462643383279502884197169399375105820974944; void solve(){ int n, m; cin>>n>>m; int z = 720720; //lcm{1..16} int a[n][m]; rep(i, 0, n) rep(j, 0, m) cin>>a[i][j]; rep(i, 0, n){ rep(j, 0, m){ int k = z-pow(a[i][j], 4); if((i+j)%2) cout<<z<< ; else cout<<k<< ; }cout<< n ; } } signed main(){ ios_base::sync_with_stdio(false), cin.tie(nullptr); int T=1;// cin>>T; while(T--){ solve();cout<< n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long n, ps[1000], tp, q, ar[1000], ans, x, y, a, b; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> ar[i]; ps[ar[i]] = i; } cin >> q; for (; q; --q) { cin >> tp; if (tp == 2) { cin >> a >> b; swap(ar[a], ar[b]); ps[ar[a]] = a; ps[ar[b]] = b; } else { cin >> x >> y; ans = 1; while (x < y) { if (ps[x + 1] < ps[x]) ++ans; ++x; } cout << ans << endl; } } cin.get(); cin.get(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a = 0; int main() { cin >> n; n = abs(n); while ((a * (a + 1)) / 2 < n || ((a * (a + 1)) / 2) % 2 != n % 2) a++; cout << a; return 0; } |
#include <bits/stdc++.h> void solve() { int n; std::cin >> n; int a = 0; std::string s; std::cin >> s; bool flag = false; int x, y; x = y = 0; if (s[0] == U ) { ++y; } else { ++x; } if (x > y) flag = true; for (size_t i = 1; i < s.size(); ++i) { if (s[i] == U ) { ++y; } else { ++x; } if (x > y && !flag) { flag = true; ++a; } else if (x < y && flag) { flag = false; ++a; } } std::cout << a; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long d = 0, n, i; cin >> n; int a[n]; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < n; i++) { if (a[i] > d) d++; } cout << d << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int pos[N]; int main() { ios::sync_with_stdio(false); int n, a; while (cin >> n) { for (int i = 1; i <= n; ++i) { cin >> a; pos[a] = i; } int last = 0; for (int i = 1; i <= n; ++i) { cin >> a; cout << max(pos[a] - last, 0) << ; last = max(last, pos[a]); } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<long long> a(n + 1, 0); long long s1 = 0, s2 = 0, s3 = 0; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); a[i] += a[i - 1]; } if (a[n] % 3) { cout << 0 n ; return; } vector<int> a0, a1; for (int i = 1; i < n; i++) { if (a[i] == a[n] / 3) a0.push_back(i); if (a[i] == 2 * a[n] / 3) a1.push_back(i); } long long ret = 0; while (a0.size() && a1.size()) { while (a0.size() && a0.back() >= a1.back()) { a0.pop_back(); } if (!a0.size()) break; ret += a0.size(); a1.pop_back(); } cout << ret << endl; } int main() { solve(); return 0; } |
#include <iostream> #include <vector> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <algorithm> #include <numeric> #include <queue> #include <iomanip> #include <numeric> #include <cmath> using namespace std; int main() { int t; cin >> t; for (int tt = 0; tt < t; tt++) { int n, m; cin >> n >> m; vector<int> va(n, 0), vb(n, 0); unordered_map<int, vector<int>> tofix; unordered_map<int, int> fixed; for (int i = 0; i < n; i++) { cin >> va[i]; } for (int i = 0; i < n; i++) { cin >> vb[i]; if (va[i] == vb[i]) { fixed[va[i]] = i; } else { tofix[vb[i]].push_back(i); } } vector<int> res(m, 0); vector<pair<int, int>> redundant; for (int i = 0; i < m; i++) { int x; cin >> x; if (tofix.count(x) > 0 and tofix[x].size() > 0) { res[i] = tofix[x].back(); fixed[x] = tofix[x].back(); tofix[x].pop_back(); if (tofix[x].size() == 0) { tofix.erase(x); } if (redundant.size() > 0) { for (auto p : redundant) { res[p.first] = fixed[x]; } redundant.clear(); } } else { if (fixed.count(x) > 0) { if (redundant.size() > 0) { for (auto p : redundant) { res[p.first] = fixed[x]; } redundant.clear(); res[i] = fixed[x]; } else { res[i] = fixed[x]; } } else { redundant.emplace_back(i, x); } } } if (redundant.empty() and tofix.size() == 0) { cout << YES << endl; for (auto r : res) { cout << r + 1 << ; } cout << endl; } else { cout << NO << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 2.5 * 1e5 + 5; int n, m, k; int d[N]; struct Edge { int num; int next; } edge[4 * N]; int tot, last[N]; vector<int> q; vector<int> ans[N]; vector<int> path; int anss; bool flag; void Add(int i, int j) { tot++; edge[tot].num = j; edge[tot].next = last[i]; last[i] = tot; } void dfs(int i, int deep) { if (flag) return; d[i] = deep; q.push_back(i); if (deep > n / k) { flag = 1; for (int j = q.size() - 1; j >= 0; j--) path.push_back(q[j]); return; } bool flag = 0; for (int k = last[i]; k != 0; k = edge[k].next) { int v = edge[k].num; if (d[v] == 0) { dfs(v, deep + 1); flag = 1; } } if (flag == 0) { anss++; int sign1 = 0, sign2 = 0; bool sign = 0; for (int k = last[i]; k != 0; k = edge[k].next) { int v = edge[k].num; if (d[v] + 1 == d[i]) continue; if ((d[i] - d[v]) % 3 == 2) { if (sign1 == 0) sign1 = v; else sign2 = v; } else { for (int k = q.size() - 1; k >= 0; k--) { ans[anss].push_back(q[k]); if (q[k] == v) break; } sign = 1; break; } } if (sign == 0) { bool en = 0; ans[anss].push_back(i); for (int k = q.size() - 1; k >= 0; k--) { if ((q[k] == sign1 || q[k] == sign2) && en == 0) { en = 1; ans[anss].push_back(q[k]); continue; } if (en) ans[anss].push_back(q[k]); if ((q[k] == sign1 || q[k] == sign2) && en == 1) { en = 0; break; } } } } q.pop_back(); } int main() { std::ios::sync_with_stdio(0); cin >> n >> m >> k; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; Add(u, v); Add(v, u); } dfs(1, 1); if (flag) { cout << PATH n << path.size() << endl; for (int j = path.size() - 1; j >= 0; j--) cout << path[j] << ; } else { cout << CYCLES n ; for (int i = 1; i <= k; i++) { cout << ans[i].size() << endl; ; for (int j = 0; j <= ans[i].size() - 1; j++) cout << ans[i][j] << ; cout << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int test_case; cin >> test_case; while (test_case--) { int a, b, x, y; vector<int> akash; cin >> a >> b >> x >> y; int temp1 = 0, temp2 = 0, temp3 = 0, temp4 = 0; temp1 = ((b - y) - 1) * a; temp2 = ((a - x) - 1) * b; temp3 = (y - 0) * a; temp4 = (x - 0) * b; akash.push_back(temp1); akash.push_back(temp2); akash.push_back(temp3); akash.push_back(temp4); int max = akash[0]; for (int i = 1; i < 4; i++) { if (max < akash[i]) { max = akash[i]; } } cout << max << endl; akash.clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[20000]; int main() { ios_base::sync_with_stdio(NULL); int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; if (x == 1) { cout << HARD ; return 0; } } cout << EASY ; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, a[105]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = n - 1; i >= 0; i--) cout << a[i] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> const int N = 1000000; int n; char str[N + 10]; int cdog = 0, fdog = 0, ldog = 0, cbone = 0, fbone = 0, lbone = 0; int cntd[N + 10], cntb[N + 10]; int nxtd[N + 10], nxtb[N + 10]; int lstd[N + 10], lstb[N + 10]; int tp1[N + 10], tp2[N + 10][2]; bool dp[N + 10]; bool chk(int x) { memset(dp, 0, sizeof(dp)); dp[0] = true; for (int i = n; i >= 0; --i) { if (str[i] != P ) continue; int nd = lstd[std::min(i + x, n)]; if (nd > i) tp1[i] = tp1[nd]; else tp1[i] = i + x; } for (int i = n; i >= 0; --i) { if (str[i] != P ) continue; int nd = lstd[std::min(i + x, n)], bd = nxtd[i + 1]; if (!bd) tp2[i][0] = n + 1, tp2[i][1] = 0; else if (nd == bd) tp2[i][0] = bd - x, tp2[i][1] = i + x; else tp2[i][0] = bd - x, tp2[i][1] = tp1[nd]; } for (int i = 0; i < n; ++i) { if (!dp[i]) continue; int nd = nxtd[i + 1]; int nb = nxtb[i + 1]; if (nd == 0 || nb == 0) break; if (nb < nd) { if (nb >= nd - x) { dp[nd] = true; } if (nb >= tp2[nd][0]) { dp[std::min(tp2[nd][1], n)] = true; } } else { dp[std::min(tp1[nd], n)] = true; } } int lst = 0; for (int i = n; i >= 0; --i) if (dp[i]) { lst = i; break; } return lst >= lbone; } int main() { scanf( %d , &n); scanf( %s , str + 1); for (int i = 1; i <= n; ++i) if (str[i] == P ) { ++cdog; if (fdog == 0) fdog = i; ldog = i; cntd[i] = cntd[i - 1] + 1; cntb[i] = cntb[i - 1]; } else if (str[i] == * ) { ++cbone; if (fbone == 0) fbone = i; lbone = i; cntd[i] = cntd[i - 1]; cntb[i] = cntb[i - 1] + 1; } else { cntd[i] = cntd[i - 1]; cntb[i] = cntb[i - 1]; } if (cdog == 1) { if (cntb[ldog] > cbone - cntb[ldog]) { printf( %d %d n , cntb[ldog], ldog - fbone); } else { printf( %d %d n , cbone - cntb[ldog], lbone - ldog); } return 0; } printf( %d , cbone); for (int i = n; i >= 0; --i) { if (str[i] == P ) nxtd[i] = i; else nxtd[i] = nxtd[i + 1]; if (str[i] == * ) nxtb[i] = i; else nxtb[i] = nxtb[i + 1]; } for (int i = 1; i <= n; ++i) { if (str[i] == P ) lstd[i] = i; else lstd[i] = lstd[i - 1]; if (str[i] == * ) lstb[i] = i; else lstb[i] = lstb[i - 1]; } int l = 1, r = n, ans = 0; while (l <= r) { int mid = (l + r) >> 1; if (chk(mid)) { ans = mid, r = mid - 1; } else { l = mid + 1; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005, MAXM = 1000005, MAXT = 1 << 18; struct Edge { int to, val, next, id; } edge[MAXM]; struct MST { int u, v, w, id; } mst[MAXM]; int ppar[MAXN], head[MAXN], ist[MAXM], dep[MAXN], n, m, tot; void addedge(int u, int v, int w, int id) { edge[++tot] = (Edge){v, w, head[u], id}; head[u] = tot; } int find(int x) { return x == ppar[x] ? x : ppar[x] = find(ppar[x]); } void merge(int x, int y) { x = find(x), y = find(y); if (x != y) ppar[x] = y; } int mmn[MAXT], beg[MAXN], ed[MAXN], ans[MAXM], par[20][MAXN], mx[20][MAXN], dcnt; struct Que { int l, r, id; }; struct Mod { int p, w; }; vector<Que> qr1[MAXN], qr2[MAXN]; vector<Mod> md1[MAXN], md2[MAXN]; void dfs(int u, int fa) { beg[u] = ++dcnt; dep[u] = dep[fa] + 1; for (int i = head[u]; i; i = edge[i].next) { int v = edge[i].to; if (v == fa) continue; dfs(v, u); qr1[beg[v]].push_back((Que){beg[v], ed[v], edge[i].id}); qr2[ed[v]].push_back((Que){beg[v], ed[v], edge[i].id}); par[0][v] = u; mx[0][v] = edge[i].val; } ed[u] = dcnt; } void chk(int &x, int y) { x = x < y ? x : y; } void cxk(int &x, int y) { x = x > y ? x : y; } void upd(int x, int w, int l = 1, int r = n, int k = 1) { if (l == r) { chk(mmn[k], w); return; } int mid = (l + r) >> 1; if (x <= mid) upd(x, w, l, mid, k << 1); else upd(x, w, mid + 1, r, k << 1 | 1); chk(mmn[k], w); } int ask(int a, int b, int l = 1, int r = n, int k = 1) { if (a > r || b < l) return 1E9; if (a <= l && b >= r) return mmn[k]; int mid = (l + r) >> 1; return min(ask(a, b, l, mid, k << 1), ask(a, b, mid + 1, r, k << 1 | 1)); } int calc(int x, int y) { if (dep[x] > dep[y]) swap(x, y); int res = 0; for (int i = 19; ~i; i--) if (dep[par[i][y]] >= dep[x]) cxk(res, mx[i][y]), y = par[i][y]; if (x == y) return res; for (int i = 19; ~i; i--) if (par[i][x] != par[i][y]) cxk(res, mx[i][x]), cxk(res, mx[i][y]), x = par[i][x], y = par[i][y]; return max(res, max(mx[0][x], mx[0][y])); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); mst[i] = (MST){u, v, w, i}; ans[i] = 1E9; } sort(mst + 1, mst + 1 + m, [&](const MST &a, const MST &b) { return a.w < b.w; }); for (int i = 1; i <= n; i++) ppar[i] = i; for (int i = 1; i <= m; i++) { int u = mst[i].u, v = mst[i].v; if (find(u) != find(v)) { merge(u, v); ist[mst[i].id] = 1; addedge(u, v, mst[i].w, mst[i].id); addedge(v, u, mst[i].w, mst[i].id); } } for (int i = 0; i < MAXT; i++) mmn[i] = 1E9; dfs(1, 0); for (int i = 1; i < 20; i++) for (int j = 1; j <= n; j++) { par[i][j] = par[i - 1][par[i - 1][j]]; mx[i][j] = max(mx[i - 1][j], mx[i - 1][par[i - 1][j]]); } for (int i = 1; i <= m; i++) if (!ist[mst[i].id]) { int u = mst[i].u, v = mst[i].v; if (beg[u] > beg[v]) swap(u, v); md1[beg[u]].push_back((Mod){beg[v], mst[i].w}); md2[beg[v]].push_back((Mod){beg[u], mst[i].w}); ans[mst[i].id] = calc(u, v); } for (int i = 1; i <= n; i++) { for (Que q : qr1[i]) chk(ans[q.id], ask(q.l, q.r)); for (Mod d : md1[i]) upd(d.p, d.w); } for (int i = 0; i < MAXT; i++) mmn[i] = 1E9; for (int i = n; i > 0; i--) { for (Que q : qr2[i]) chk(ans[q.id], ask(q.l, q.r)); for (Mod d : md2[i]) upd(d.p, d.w); } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[17][17]; int main() { int n, m, k, need; scanf( %d%d%d%d , &n, &m, &k, &need); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { int x, y; scanf( %d%d , &x, &y); a[x][y] = 1; } } int ans = 0; for (int x1 = 1; x1 <= n; x1++) { for (int y1 = 1; y1 <= m; y1++) { for (int x2 = x1; x2 <= n; x2++) { for (int y2 = 1; y2 <= m; y2++) { int tot = 0; for (int x = x1; x <= x2; x++) { for (int y = y1; y <= y2; y++) { tot += a[x][y]; } } if (tot >= need) ans++; } } } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int M = 2e5 + 5; vector<int> G[M]; int n, A[M], num, ok, res, ans[2][M], C; bool mark[M]; void ma(int a, int b) { if (a == b || mark[a] && mark[b]) return; printf( %d %d n , a, b); ans[0][C] = a; ans[1][C] = b; C++; mark[a] = mark[b] = 1; ma(A[a], A[b]); } int main() { scanf( %d , &n); res = -1; for (int i = 1; i <= n; i++) scanf( %d , A + i); for (int i = 1; i <= n; i++) { int nw = A[i], has = 0; while (!mark[nw]) { has = 1; mark[nw] = 1; G[num].push_back(nw); nw = A[nw]; } if (G[num].size() == 1) ok = A[i]; if (G[num].size() == 2) res = num; if (has) num++; } memset(mark, 0, sizeof(mark)); if (ok) { puts( YES ); for (int i = 1; i <= n; i++) if (i != ok) printf( %d %d n , ok, i); } else if (~res) { for (int i = 0; i < num; i++) if (G[i].size() & 1) { puts( NO ); return 0; } puts( YES ); printf( %d %d n , G[res][0], A[G[res][0]]); for (int i = 0; i < num; i++) if (res != i) ma(G[res][0], G[i][0]); } else puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int INF = 1e9 + 10; const int N = 1e2 + 5; int mark[N]; int ans; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { int x; cin >> x; mark[x] = i + 1; } for (int i = 0; i < N; i++) { if (mark[i] != 0) ans++; } if (ans >= k) { cout << YES << n ; int cnt = 0; for (int i = 0; i < N; i++) { if (cnt < k and mark[i] != 0) { cout << mark[i] << ; cnt++; } } } else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, len; char s[105]; cin >> s; len = strlen(s); for (i = 0; i < len; i++) { for (j = 0; j < len - i - 2; j += 2) { if (s[j] > s[j + 2]) { swap(s[j], s[j + 2]); } } } printf( %s , s); return 0; } |
#include <bits/stdc++.h> int c[100]; int main() { int n, s, max = 0, i, j; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &s); c[s] += 1; if (s > max) max = s; } for (i = 0; i <= max; i++) for (j = 0; j < c[i]; j++) printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, m, d, i = 0, b = 1, ans = 0; int main(void) { cin >> n >> k >> m >> d; for (i = 1; i <= d && b <= n; i++, b += k) { ans = max(ans, min(m, n / b) * i); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { long long x; bool s; node(long long a, bool b) { x = a, s = b; } }; bool operator<(node a, node b) { return a.x > b.x; } priority_queue<node> pq; int main() { int n; long long temp; cin >> n; long long ans = 0; for (int i = 1; i <= n; i++) { cin >> temp; if (pq.empty() || pq.top().x > temp) { pq.push(node(temp, 0)); } else { long long now = pq.top().x; bool se = pq.top().s; pq.pop(); if (se) pq.push(node(now, 0)); ans += temp - now, pq.push(node(temp, 1)); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; long long ar[n + 1]; for (long long i = 1; i <= n; i++) { cin >> ar[i]; } for (long long i = 1; i <= n; i++) { long long f = ar[i]; long long t = ar[f]; if (ar[t] == i) { return cout << YES , 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9 + 7, MAX = 1e6 + 5; const long long INF = 1e18 + 5; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, q; cin >> n >> q; vector<int> A(n + 2); for (int in = 1; in < 1 + n; in++) cin >> A[in]; A[0] = -n - 1; A[n + 1] = -n - 1; long long ans = 0; set<int> Pos; set<int> Neg; for (int i = 1; i <= n; i++) { if (A[i] > A[i - 1] && A[i] > A[i + 1]) { ans += A[i]; Pos.insert(A[i]); } if (A[i] < A[i - 1] && A[i] < A[i + 1]) { ans -= A[i]; Neg.insert(A[i]); } } cout << ans << n ; while (q--) { int u, v; cin >> u >> v; swap(A[u], A[v]); long long diff = 0; for (int i = u - 1; i <= u + 1; i++) { if (i <= 0) continue; if (i > n) continue; if (A[i] > A[i - 1] && A[i] > A[i + 1]) { if (Neg.count(A[i])) { Neg.erase(A[i]); Pos.insert(A[i]); diff += 2 * A[i]; } else if (!Pos.count(A[i])) { Pos.insert(A[i]); diff += A[i]; } } else if (A[i] < A[i - 1] && A[i] < A[i + 1]) { if (Pos.count(A[i])) { Pos.erase(A[i]); Neg.insert(A[i]); diff -= 2 * A[i]; } else if (!Neg.count(A[i])) { Neg.insert(A[i]); diff -= A[i]; } } else { if (Pos.count(A[i])) { Pos.erase(A[i]); diff -= A[i]; } else if (Neg.count(A[i])) { Neg.erase(A[i]); diff += A[i]; } } } for (int i = v - 1; i <= v + 1; i++) { if (i <= u + 1) continue; if (i <= 0) continue; if (i > n) continue; if (A[i] > A[i - 1] && A[i] > A[i + 1]) { if (Neg.count(A[i])) { Neg.erase(A[i]); Pos.insert(A[i]); diff += 2 * A[i]; } else if (!Pos.count(A[i])) { Pos.insert(A[i]); diff += A[i]; } } else if (A[i] < A[i - 1] && A[i] < A[i + 1]) { if (Pos.count(A[i])) { Pos.erase(A[i]); Neg.insert(A[i]); diff -= 2 * A[i]; } else if (!Neg.count(A[i])) { Neg.insert(A[i]); diff -= A[i]; } } else { if (Pos.count(A[i])) { Pos.erase(A[i]); diff -= A[i]; } else if (Neg.count(A[i])) { Neg.erase(A[i]); diff += A[i]; } } } ans += diff; cout << ans << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main(void) { int a[10] = {0}; int n; string d; cin >> n; cin >> d; for (int i = 0; i < d.size(); i++) { if (d[i] == L ) { for (int j = 0; j < 10; j++) { if (a[j] == 0) { a[j] = 1; break; } } } else if (d[i] == R ) { for (int j = 9; j >= 0; j--) { if (a[j] == 0) { a[j] = 1; break; } } } else { a[d[i] - 0 ] = 0; } } for (int i = 0; i < 10; i++) printf( %d , a[i]); } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 1e9 + 7; int n, K, ans, cnt; char s[5]; struct DSU { int fa[N]; bool mark[N]; int getfa(int x) { return fa[x] == x ? x : fa[x] = getfa(fa[x]); } bool merge(int x, int y) { int fx = getfa(x), fy = getfa(y); if (getfa(x ^ 1) == fy || getfa(y ^ 1) == fx) return 0; if (fx != fy) fa[fx] = fy; return 1; } bool Set(int l, int r, int c) { if (!c) return merge(l * 2, r * 2) && merge(l * 2 + 1, r * 2 + 1); else return merge(l * 2 + 1, r * 2) && merge(l * 2, r * 2 + 1); } } T; int qpow(int a, int b) { int ret = 1; for (; b; b >>= 1) { if (b & 1) ret = 1ll * ret * a % mod; a = 1ll * a * a % mod; } return ret; } int main() { cin >> n >> K; for (int i = 0; i <= (n + 2) * 2; i++) T.fa[i] = i; for (int i = 1; i <= K; i++) { int x, y; scanf( %d%d%s , &x, &y, s + 1); --x, --y; int l = x - y, r = x + y; if (l < 0) l = -l; if (r > n - 1) r = (n - 1) * 2 - r; if (!T.Set(l, r + 2, s[1] == o )) { return puts( 0 ), 0; } } for (int i = 0; i <= (n + 1) * 2 + 1; i++) ans += (T.getfa(i) == i); printf( %d n , qpow(2, ans / 2 - 2)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; const double eps = 1e-9; const double pi = acos(-1); struct P { int x, y; } a[N]; int n, vi[N], t[N]; double l[N], r[N], q[N]; long long k; void change(int k, int v) { for (; k; k -= k & (-k)) t[k] += v; } int ask(int k) { int s = 0; for (; k < N; k += k & (-k)) s += t[k]; return s; } struct node { double p1, p2; int v; } op[N * 2]; bool cmp(node a, node b) { return a.p1 < b.p1; } long long count(double R) { int top = 0, op_top = 0; memset(t, 0, sizeof(t)); for (int i = (int)(1); i <= (int)(n); i++) { l[i] = r[i] = -1; double d = sqrt(a[i].x * a[i].x + a[i].y * a[i].y); if (d < R + eps) continue; double theta = atan2(a[i].y, a[i].x); double delta = acos(R / d); l[i] = theta - delta; r[i] = theta + delta; for (; l[i] < 0; l[i] += 2 * pi) ; for (; r[i] < 0; r[i] += 2 * pi) ; for (; l[i] >= 2 * pi; l[i] -= 2 * pi) ; for (; r[i] >= 2 * pi; r[i] -= 2 * pi) ; if (l[i] > r[i]) swap(l[i], r[i]); q[++top] = l[i]; op[++op_top] = (node){l[i], l[i], 1}; op[++op_top] = (node){r[i], l[i], -1}; } sort(q + 1, q + top + 1); sort(op + 1, op + op_top + 1, cmp); long long sum = 0; for (int i = (int)(1); i <= (int)(op_top); i++) { int p = lower_bound(q + 1, q + top + 1, op[i].p2) - q; change(p, op[i].v); if (op[i].v == -1) sum += ask(p); } return sum; } int main() { scanf( %d%lld , &n, &k); for (int i = (int)(1); i <= (int)(n); i++) scanf( %d%d , &a[i].x, &a[i].y); double l = 0, r = 15000; for (int T = (int)(1); T <= (int)(50); T++) { double mid = (l + r) / 2; if (1ll * n * (n - 1) / 2 - count(mid) < k) l = mid; else r = mid; } printf( %.10lf n , (l + r) / 2); } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int n; long long a[1005][2]; long long mi = ((1ll << 62) - 1); void calc(long long x) { int i; long long sum = 0; int cnt = 0; vector<pair<int, int> > v; for (i = 0; i < n; i++) { if (a[i][0] <= x && a[i][1] <= x) { if (a[i][0] <= a[i][1]) sum += a[i][0]; else v.push_back(pair<int, int>(a[i][1] - a[i][0], i)); } else if (a[i][0] <= x) sum += a[i][1], cnt++; else if (a[i][1] <= x) sum += a[i][0]; else return; } if (cnt > n / 2) return; sort(v.begin(), v.end()); for (auto e : v) { if (cnt < n / 2) sum += a[e.second][1], cnt++; else sum += a[e.second][0]; } mi = min(mi, x * sum); } int main() { int i, j, k; cin >> n; for (i = 0; i < n; i++) for (j = 0; j < 2; j++) cin >> a[i][j]; for (i = 0; i < n; i++) for (j = 0; j < 2; j++) calc(a[i][j]); cout << mi; return 0; } |
#include <bits/stdc++.h> using namespace std; void reverse_(vector<int> num) { vector<int> a; for (int i = num.size() - 1; i > -1; i--) a.push_back(num[i]); num = a; } int main() { int n, x; cin >> n >> x; vector<int> num(n), used(1e5 + 7, 0), step(1e5 + 7, 1e9); set<int> all; for (int i = 0; i < n; i++) { cin >> num[i]; used[num[i]] = 1; all.insert(num[i]); } if (all.size() < n) { cout << 0 n ; return 0; } int ans = 1e9; sort(num.begin(), num.end()); reverse_(num); for (int i = 0; i < n; i++) { int now = num[i]; int prev = -1; int shag = 0; while (now >= 0 && prev != now) { if (now != num[i]) { if (used[now]) { ans = min(ans, shag); } } if (step[now] != 1e9) { ans = min(step[now] + shag, ans); } step[now] = min(step[now], shag); prev = now; now = now & x; shag++; } } if (ans == 1e9) { cout << -1 n ; return 0; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n; long long p[n], y; set<long long> c[4]; set<long long>::iterator it; c[1].insert(-1); c[2].insert(-1); c[3].insert(-1); int temp; for (int i = 0; i < n; i++) cin >> p[i]; for (int i = 0; i < n; i++) { cin >> temp; c[temp].insert(p[i]); } for (int i = 0; i < n; i++) { cin >> temp; c[temp].insert(p[i]); } cin >> m; for (int i = 0; i < m; i++) { cin >> temp; it = c[temp].begin(); it++; if (it == c[temp].end()) { cout << -1 ; continue; } else { y = *it; cout << y << ; } c[1].erase(y); c[2].erase(y); c[3].erase(y); } return 0; } |
#include <bits/stdc++.h> using namespace std; int edge[510][510], vis[510], con, N, M, f, t; void dfs(int x) { vis[x] = 1; for (int i = 1; i <= N; i++) if (edge[x][i]) { if (!vis[i]) dfs(i); else if (vis[i] == 1) con++; if (con >= 2) break; } vis[x] = 2; } int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= M; i++) { scanf( %d%d , &f, &t); edge[f][t] = 1; } for (int i = 1; i <= N; i++) { con = 0; memset(vis, 0, sizeof vis); dfs(i); for (int j = 1; j <= N; j++) if (j != i) { if (!vis[j]) dfs(j); if (con >= 2) break; } if (con <= 1) return puts( YES ), 0; } return puts( NO ), 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, g, a[100001], p[100001], maxi; vector<long long> v; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; p[a[i]] = i + 1; } g = 1; for (i = 1; i < n; i++) { if (p[i] <= p[i + 1]) { g++; } else { v.push_back(g); g = 1; } } v.push_back(g); maxi = 0; for (i = 0; i < v.size(); i++) { maxi = max(maxi, v[i]); } cout << n - maxi; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int n, i, j, k, cnt, tot, f[maxn]; char s[maxn]; int main() { scanf( %d%s , &n, s + 1); if (n & 1) return puts( 0 ), 0; tot = n >> 1; f[0] = 1; for (i = 1; i <= n; i++) { if (s[i] == ? ) for (j = i >> 1, k = max(1, tot - (n - i)); j >= k; j--) f[j] = f[j] + f[j - 1]; else cnt++; } if (cnt > tot) return puts( 0 ), 0; int ans = f[tot]; for (i = tot - cnt; i; i--) ans *= 25; printf( %u , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int count = 0; int groups = 0; for (int i = 0; i < n; i++) { if (++count == a[i]) { count = 0; groups++; } } cout << groups << endl; } } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T checkmin(T &a, T b) { return (a < b) ? a : a = b; } template <class T> inline T checkmax(T &a, T b) { return (a > b) ? a : a = b; } template <class T> T GCD(T a, T b) { if (a < 0) return GCD(-a, b); if (b < 0) return GCD(a, -b); return (a == 0) ? b : GCD(b % a, a); } template <class T> T LCM(T a, T b) { if (a < 0) return LCM(-a, b); if (b < 0) return LCM(a, -b); return (a == 0 || b == 0) ? 0 : a / GCD(a, b) * b; } template <class T> inline T sqr(T X) { return X * X; } namespace Poor { const int MaxiN = 105; const long long Infinity = 2000000000000000000LL; int N, M; long long K; int C[MaxiN][MaxiN]; int Weight[MaxiN + MaxiN]; pair<int, int> List[MaxiN + MaxiN]; char St[MaxiN + MaxiN]; inline void Inc(long long &a, long long b) { a += b; if (a > Infinity) a = Infinity; } long long DP() { map<int, long long> Now, Suc; Now.clear(); Now[0] = 1; for (int i = 0; i < N + M - 1; ++i) { for (typeof(Now.begin()) it = Now.begin(); it != Now.end(); ++it) { if (St[i] != ) ) Inc(Suc[it->first + 1], it->second); if (St[i] != ( && it->first > 0) Inc(Suc[it->first - 1], it->second); } Now = Suc; Suc.clear(); } return Now[0]; } void Run() { cin >> N >> M >> K; for (int i = 0; i < N; ++i) for (int j = 0; j < M; ++j) cin >> C[i][j]; fill(Weight, Weight + N + M - 1, INT_MAX); for (int i = 0; i < N; ++i) for (int j = 0; j < M; ++j) checkmin(Weight[i + j], C[i][j]); for (int i = 0; i < N + M - 1; ++i) List[i] = make_pair(Weight[i], i); sort(List, List + N + M - 1); fill(St, St + N + M - 1, ? ); for (int i = 0; i < N + M - 1; ++i) { int p = List[i].second; St[p] = ( ; long long dp = DP(); if (dp < K) { K -= dp; St[p] = ) ; } } for (int i = 0; i < N; ++i) { for (int j = 0; j < M; ++j) putchar(St[i + j]); puts( ); } } } // namespace Poor int main() { Poor::Run(); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[7][7][101]; int d[101], t[7]; char cd[101]; bool dfs(int now, int saw, int n) { if (saw == n) return true; for (int i = 0; i < 7; i++) if (a[now][i][0] > 0) { d[saw] = a[now][i][a[now][i][0]]; cd[saw] = + ; a[now][i][0]--; if (dfs(i, saw + 1, n)) return true; a[now][i][0]++; } for (int i = 0; i < 7; i++) if (a[i][now][0] > 0) { d[saw] = a[i][now][a[i][now][0]]; cd[saw] = - ; a[i][now][0]--; if (dfs(i, saw + 1, n)) return true; a[i][now][0]++; } return false; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int v1, v2; cin >> v1 >> v2; a[v1][v2][0]++; a[v1][v2][a[v1][v2][0]] = i + 1; t[v1]++; t[v2]++; } int odd1 = -1, odd2 = -1; for (int i = 0; i < 7; i++) if (t[i] % 2 == 1) { if (odd2 != -1) { cout << No solution n ; return 0; } else if (odd1 == -1) odd1 = i; else odd2 = i; } if (odd1 != -1 && odd2 == -1) { cout << No solution n ; return 0; } if (odd1 != -1) { if (dfs(odd1, 0, n)) { for (int i = 0; i < n; i++) cout << d[i] << << cd[i] << endl; return 0; } else { cout << No solution n ; return 0; } } else { for (int i = 0; i < 7; i++) if (t[i] > 0) { if (dfs(i, 0, n)) { for (int j = 0; j < n; j++) cout << d[j] << << cd[j] << endl; return 0; } else { cout << No solution n ; return 0; } } cout << No solution n ; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000009; int n, m, k; class Mat { public: long long e[2][2]; Mat mul(Mat u) { Mat s; for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { s.e[i][j] = 0; for (int k = 0; k < 2; k++) { s.e[i][j] += e[i][k] * u.e[k][j]; s.e[i][j] %= mod; } } } return s; } Mat powMat(Mat u, int k) { Mat mat; memset(mat.e, 0, sizeof(mat.e)); mat.e[0][0] = 1; mat.e[1][1] = 1; while (k) { if (k & 1) { mat = mat.mul(u); } u = u.mul(u); k = (k >> 1); } return mat; } }; bool good(int mid) { int n1 = n - mid * k; int m1 = m - mid * k; int ans = n1 / k * (k - 1) + n1 % k; if (ans >= m1) return true; return false; } int main() { scanf( %d%d%d , &n, &m, &k); int l = 0, r = m / k; int mid; while (l < r) { mid = (l + r) / 2; if (good(mid)) r = mid; else l = mid + 1; } Mat u; u.e[0][0] = (long long)k; u.e[0][1] = 1L; u.e[1][0] = 0; u.e[1][1] = 0; Mat v; v.e[0][0] = 2L; v.e[0][1] = 0; v.e[1][0] = (long long)k; v.e[1][1] = 1L; u = u.mul(v.powMat(v, l)); long long ans = (u.e[0][0] - k + (m - l * k) + mod) % mod; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &out, const vector<T> &data) { out << [ ; for (int i = 0; i < data.size(); ++i) out << data[i] << (i == data.size() - 1 ? : , ); out << ] ; return out; } template <class T> ostream &operator<<(ostream &out, const set<T> &s) { out << { ; for (typename set<T>::iterator itr = s.begin(); itr != s.end(); ++itr) out << *itr << ; out << } ; return out; } template <class T> ostream &operator<<(ostream &out, const multiset<T> &s) { out << { ; for (typename multiset<T>::iterator itr = s.begin(); itr != s.end(); ++itr) out << *itr << ; out << } ; return out; } template <class T1, class T2> ostream &operator<<(ostream &out, const pair<T1, T2> &p) { out << ( << p.first << , << p.second << ) ; return out; } template <class T1, class T2> ostream &operator<<(ostream &out, const map<T1, T2> &m) { for (typename map<T1, T2>::const_iterator itr = m.begin(); itr != m.end(); ++itr) out << itr->first << -> << itr->second << ; return out; } const double eps = 1e-6; const double pi = acos(-1.0); const double INF = 1e20; inline int sign(double d) { return d < -eps ? -1 : d > eps; } inline double sqr(double x) { return x * x; } struct Point { int id; double x, y; Point() { x = 0.0; y = 0.0; } Point(double nx, double ny) : x(nx), y(ny) {} Point turnLeft() const { return Point(-y, x); } Point turnRight() const { return Point(y, -x); } Point rotate(double ang) const { return Point(x * cos(ang) - y * sin(ang), x * sin(ang) + y * cos(ang)); } inline double length() { return sqrt(x * x + y * y); } void normalize() { double r = length(); if (sign(r) != 0) x /= r, y /= r; } inline bool equal(const Point &other) const { return sign(x - other.x) == 0 && sign(y - other.y) == 0; } friend ostream &operator<<(ostream &out, const Point &point) { out << ( << point.x << , << point.y << ) ; return out; } friend istream &operator>>(istream &in, Point &point) { in >> point.x >> point.y; return in; } }; bool comPointByX(const Point &a, const Point &b) { return a.x < b.x; } bool comPointEqual(const Point &a, const Point &b) { return a.equal(b); } inline Point operator+(const Point &a, const Point &b) { return Point(a.x + b.x, a.y + b.y); } inline Point operator-(const Point &a, const Point &b) { return Point(a.x - b.x, a.y - b.y); } inline Point operator*(const Point &a, double d) { return Point(a.x * d, a.y * d); } inline Point operator/(const Point &a, double d) { if (sign(d) == 0) return Point(); return Point(a.x / d, a.y / d); } inline bool operator==(const Point &a, const Point &b) { return a.x == b.x && a.y == b.y; } inline bool operator!=(const Point &a, const Point &b) { return a.x != b.x || a.y != b.y; } inline double dist(const Point &a, const Point &b) { return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y)); } inline double sqrdist(const Point &a, const Point &b) { return sqr(a.x - b.x) + sqr(a.y - b.y); } inline double operator^(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; } inline double cross(const Point &p, const Point &a, const Point &b) { return (a - p) ^ (b - p); } inline double operator*(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; } inline double dot(const Point &p, const Point &a, const Point &b) { return (a - p) * (b - p); } inline double segDegree(const Point &p, const Point &a, const Point &b) { double d = dot(p, a, b); double cosd = d / dist(a, p) / dist(b, p); if (cosd > 1.0) cosd = 1.0; if (cosd < -1.0) cosd = -1.0; return acos(cosd); } inline double segDegree(double a, double b, double c) { double ret = a * a + b * b - c * c; ret = ret / a / b / 2; if (ret > 1.0) ret = 1.0; if (ret < -1.0) ret = -1.0; return acos(ret); } inline double triangleArea(double a, double b, double c) { double p = (a + b + c) / 2; return sqrt(p * (p - a) * (p - b) * (p - c)); } inline bool onSeg(const Point &p, const Point &a, const Point &b) { return (sign(cross(p, a, b)) == 0 && sign(dot(p, a, b)) <= 0); } inline bool onRay(const Point &p, const Point &a, const Point &b) { return (sign(cross(p, a, b)) == 0 && sign(dot(a, p, b)) >= 0); } inline bool onLine(const Point &p, const Point &a, const Point &b) { return sign(cross(p, a, b)) == 0; } pair<Point, Point> onLine(double A, double B, double C) { if (sign(A) == 0) return make_pair(Point(0, -C / B), Point(1, -C / B)); if (sign(B) == 0) return make_pair(Point(-C / A, 0), Point(-C / A, 1)); if (fabs(A + B + C) < eps) return make_pair(Point(-(C + B) / A, 1), Point(2, -(C + A * 2) / B)); return make_pair(Point(-(C + B) / A, 1), Point(1, -(C + A) / B)); } vector<Point> interLine(const Point &a, const Point &b, const Point &c, const Point &d) { vector<Point> inters; double u = cross(a, c, b), v = cross(a, b, d); if (sign(u + v) == 0) return inters; Point p = (c * v + d * u) / (u + v); inters.push_back(p); return inters; } vector<Point> interSeg(const Point &a, const Point &b, const Point &c, const Point &d) { vector<Point> inters = interLine(a, b, c, d); if (inters.size() == 0) return inters; const Point &p = inters[0]; if (onSeg(p, a, b) && onSeg(p, c, d)) return inters; else { inters.clear(); return inters; } } pair<Point, Point> getVerticalEquallySegment(const Point &a, const Point &b) { Point mid = (a + b) / 2; Point dir = mid - a; dir = dir.turnLeft(); Point begin = mid - dir; Point end = mid + dir; return make_pair(begin, end); } Point getMinimumDistPointOnLine(const Point &a, const Point &b, const Point &p) { if (onLine(p, a, b)) return p; pair<Point, Point> vertical = getVerticalEquallySegment(a, b); const Point &q = p + (vertical.second - vertical.first); vector<Point> inter = interLine(a, b, p, q); return inter[0]; } Point getMinimumDistPointOnSeg(const Point &a, const Point &b, const Point &p) { Point q = getMinimumDistPointOnLine(a, b, p); if (onSeg(q, a, b)) return q; if (dist(a, p) < dist(b, p)) return a; else return b; } Point getMinimumDistPointOnRay(const Point &a, const Point &b, const Point &p) { Point q = getMinimumDistPointOnLine(a, b, p); if (onRay(q, a, b)) return q; if (dist(a, p) < dist(b, p)) return a; else return b; } Point getReflectionPointByLine(const Point &a, const Point &b, const Point &p) { Point q = getMinimumDistPointOnLine(a, b, p); return q * 2 - p; } vector<Point> interCir(const Point &a, const Point &b, double r1, double r2) { vector<Point> ret; double d = dist(a, b), d1 = ((sqr(r1) - sqr(r2)) / d + d) / 2; if (sign(r1 + r2 - d) < 0 || sign(abs(r1 - r2) - d) > 0) return ret; Point mid = a + ((b - a) / d) * d1; if (sign(r1 + r2 - d) == 0) { ret.push_back(mid); return ret; } Point incr = (b - a).turnLeft() / d * sqrt(sqr(r1) - sqr(d1)); ret.push_back(mid - incr); ret.push_back(mid + incr); return ret; } double interCirArea(Point a, Point b, double ra, double rb) { double d, dA, dB; d = dist(a, b); if ((d < eps) || (d + ra <= rb) || (d + rb <= ra)) return sqr((rb < ra) ? rb : ra) * pi; if (d >= ra + rb) return 0; dA = (sqr(d) + sqr(ra) - sqr(rb)) / d / 2; dB = d - dA; return sqr(ra) * acos(dA / ra) - dA * sqrt(sqr(ra) - sqr(dA)) + sqr(rb) * acos(dB / rb) - dB * sqrt(sqr(rb) - sqr(dB)); } vector<Point> interLineCir(const Point &o, double r, const Point &a, const Point &b) { vector<Point> ret; double d = dist(a, b), h = fabs(cross(a, b, o)) / d; if (sign(r - h) < 0) return ret; double d1 = ((sqr(dist(o, a)) - sqr(dist(o, b))) / d + d) / 2; Point mid = a + (b - a) / d * d1; if (sign(r - h) == 0) { ret.push_back(mid); return ret; } Point incr = (b - a) / d * sqrt(sqr(r) - sqr(h)); ret.push_back(mid - incr); ret.push_back(mid + incr); return ret; } vector<Point> interSegCir(const Point &o, double r, const Point &a, const Point &b) { vector<Point> temp = interLineCir(o, r, a, b); vector<Point> ret; for (int i = 0; i < temp.size(); ++i) if (onSeg(temp[i], a, b)) ret.push_back(temp[i]); return ret; } vector<Point> tangentCirPoint(const Point &o, double r, const Point &a) { vector<Point> ret; double d = dist(a, o); if (sign(d - r) < 0) return ret; if (sign(r - d) == 0) { ret.push_back(a); return ret; } return interCir(o, a, r, sqrt(sqr(d) - sqr(r))); } inline bool inCircle(const Point &p, const pair<Point, double> &circle) { double dis = dist(p, circle.first); return sign(dis - circle.second) <= 0; } double distOnCircle(const Point &a, const Point &b, const Point &o, double r) { double costheta = (a - o) * (b - o) / r / r; double theta = acos(costheta); return r * theta; } pair<Point, double> minCoverCircle(const Point &a, const Point &b, const Point &c) { if (a.equal(b)) return make_pair((b + c) / 2, dist(b, c) / 2); if (b.equal(c)) return make_pair((c + a) / 2, dist(c, a) / 2); if (c.equal(a)) return make_pair((a + b) / 2, dist(a, b) / 2); if (onLine(a, b, c)) { if (onSeg(a, b, c)) return make_pair((b + c) / 2, dist(b, c) / 2); if (onSeg(b, a, c)) return make_pair((a + c) / 2, dist(a, c) / 2); return make_pair((a + b) / 2, dist(a, b) / 2); } pair<Point, double> minCircle; minCircle.second = INF; pair<Point, double> cir1 = make_pair((a + b) / 2, dist(a, b) / 2); pair<Point, double> cir2 = make_pair((b + c) / 2, dist(b, c) / 2); pair<Point, double> cir3 = make_pair((a + c) / 2, dist(a, c) / 2); if (inCircle(c, cir1) && cir1.second < minCircle.second) minCircle = cir1; if (inCircle(a, cir2) && cir2.second < minCircle.second) minCircle = cir2; if (inCircle(b, cir3) && cir3.second < minCircle.second) minCircle = cir3; Point mid1 = (a + b) / 2; Point mid2 = (b + c) / 2; Point turn1 = (b - a).turnLeft(); Point turn2 = (c - b).turnLeft(); turn1 = mid1 + turn1; turn2 = mid2 + turn2; vector<Point> inters = interLine(mid1, turn1, mid2, turn2); pair<Point, double> cir4 = make_pair(inters[0], dist(inters[0], a)); if (cir4.second < minCircle.second) minCircle = cir4; return minCircle; } double getCircleTriangleInterArea(const Point &o, double r, const Point &a, const Point &b) { vector<Point> abcir = interSegCir(o, r, a, b); if (abcir.size() == 2 && dist(a, abcir[0]) > dist(a, abcir[1])) swap(abcir[0], abcir[1]); abcir.insert(abcir.begin(), a); abcir.push_back(b); double ret = 0; for (int i = 0; i < abcir.size() - 1; ++i) { Point &t1 = abcir[i]; Point &t2 = abcir[i + 1]; if (inCircle((t1 + t2) / 2, make_pair(o, r))) ret += fabs(cross(o, t1, t2) / 2); else ret += segDegree(o, t1, t2) * r * r * 0.5; } return ret; } class Polygon { public: vector<Point> pt; inline void clear() { pt.clear(); } inline int size() const { return (int)pt.size(); } inline void addPoint(Point a) { pt.push_back(a); } inline void removePoint() { pt.pop_back(); } inline Point &operator[](int offset) { return pt[offset]; } inline void getSeg(int offset, Point &a, Point &b) { a = pt[offset]; b = pt[(offset + 1) % pt.size()]; } int inside(const Point &p) { int N = (int)pt.size(); bool positiveSign = false; bool negativeSign = false; for (int i = 0; i < N; ++i) { Point &now = pt[i]; Point &next = pt[(i + 1) % N]; Point t1 = next - now; Point t2 = p - next; int s = sign(t1 ^ t2); if (s == 0) { if (onSeg(p, now, next)) return 0; else return -1; } if (s > 0) positiveSign = true; if (s < 0) negativeSign = true; } if (positiveSign && negativeSign) return -1; else return 1; } double interCirArea(const Point &o, double r) { int N = (int)pt.size(); double ret = 0; for (int i = 0; i < N; ++i) { Point &now = pt[i]; Point &next = pt[(i + 1) % N]; double area = getCircleTriangleInterArea(o, r, now, next); if (cross(now, next, o) >= 0) ret += area; else ret -= area; } return ret; } int interCircle(const Point &o, double r, vector<Point> &inters) { inters.clear(); bool ok = true; for (int i = 0; i < pt.size(); ++i) if (!inCircle(pt[i], make_pair(o, r))) ok = false; if (ok) return 1; if (inside(o) == 1) { double mindis = 1e20; for (int i = 0; i < pt.size(); ++i) { Point a = pt[i]; Point b = pt[(i + 1) % pt.size()]; Point p = getMinimumDistPointOnSeg(a, b, o); mindis = min(mindis, dist(p, o)); } if (mindis >= r) return 2; } for (int i = 0; i < pt.size(); ++i) { Point a = pt[i]; Point b = pt[(i + 1) % pt.size()]; vector<Point> ps = interSegCir(o, r, a, b); inters.insert(inters.end(), ps.begin(), ps.end()); } return inters.size() > 0 ? 3 : 4; } Point getMinDistPointInPolygon(const Point &p) { if (inside(p) >= 0) return p; int N = (int)pt.size(); double minDis = INF; Point ret; for (int i = 0; i < N; ++i) { Point &a = pt[i]; Point &b = pt[(i + 1) % N]; Point nowMin = getMinimumDistPointOnSeg(a, b, p); double nowDis = dist(nowMin, p); if (nowDis < minDis) minDis = nowDis, ret = nowMin; } return ret; } Polygon cut(const Point &a, const Point &b) { Polygon newPoly; Point temp; for (unsigned int i = 0; i < pt.size(); i++) { Point &nowP = pt[i]; Point &nextP = pt[(i + 1) % pt.size()]; if (sign(cross(a, b, nowP)) <= 0) newPoly.addPoint(nowP); if (sign(cross(a, b, nowP)) * sign(cross(a, b, nextP)) < 0) { vector<Point> inters = interLine(nowP, nextP, a, b); if (inters.size() > 0) newPoly.addPoint(inters[0]); } } return newPoly; } vector<Point> polyInterLine(const Point &a, const Point &b) { int N = (int)pt.size(); vector<Point> ret; Point temp; for (int i = 0; i < N; ++i) { Point &now = pt[i]; Point &next = pt[(i + 1) % N]; if (sign(cross(a, b, now)) * sign(cross(a, b, next)) <= 0) { vector<Point> inters = interLine(a, b, now, next); if (inters.size() > 0) ret.push_back(inters[0]); } } return ret; } double area() { int size = this->size(); if (size <= 2) return 0.0; addPoint(this->pt[0]); double ans = 0; for (int i = 0; i < size; ++i) ans += (pt[i] ^ pt[i + 1]); removePoint(); return fabs(ans / 2); } double length() { int size = this->size(); addPoint(pt[0]); double ans = 0; for (int i = 0; i < size; ++i) ans += dist(pt[i], pt[i + 1]); removePoint(); return ans; } pair<Point, Point> getDiameter() { if (this->size() == 0) return make_pair(Point(0, 0), Point(0, 0)); if (this->size() == 1) return make_pair(pt[0], pt[0]); if (this->size() == 2) return make_pair(pt[0], pt[1]); pair<Point, Point> answer; double diameter = 0.0; for (unsigned int i = 0; i < pt.size(); ++i) for (unsigned int j = i + 1; j < pt.size(); ++j) { double now = sqrdist(pt[i], pt[j]); if (now > diameter) { diameter = now; answer = make_pair(pt[i], pt[j]); } } return answer; } pair<Point, double> getMinCoverCircle() { vector<Point> &points = pt; if (points.size() == 0) return make_pair(Point(0, 0), 0); if (points.size() == 1) return make_pair(points[0], 0); if (points.size() == 2) return make_pair((points[0] + points[1]) / 2, dist(points[0], points[1]) / 2); Point a = points[0]; Point b = points[1]; Point c = points[2]; pair<Point, double> nowCircle = minCoverCircle(a, b, c); while (true) { bool found = false; double maxDis = nowCircle.second; Point maxDisPoint; for (unsigned int i = 0; i < points.size(); ++i) { double dis = dist(points[i], nowCircle.first); if (sign(dis - maxDis) > 0) { maxDis = dis; maxDisPoint = points[i]; found = true; } } if (!found) break; Point d = maxDisPoint; Point newa, newb, newc; pair<Point, double> cir1 = minCoverCircle(a, b, d); pair<Point, double> cir2 = minCoverCircle(a, c, d); pair<Point, double> cir3 = minCoverCircle(b, c, d); pair<Point, double> minCircle; minCircle.second = INF; if (inCircle(c, cir1) && cir1.second < minCircle.second) { minCircle = cir1; c = d; } else { if (inCircle(b, cir2) && cir2.second < minCircle.second) { minCircle = cir2; b = d; } else { if (inCircle(a, cir3) && cir3.second < minCircle.second) { minCircle = cir3; a = d; } } } nowCircle = minCircle; } return nowCircle; } friend ostream &operator<<(ostream &out, const Polygon &poly) { int size = poly.size(); for (int i = 0; i < size; ++i) out << poly.pt[i] << t ; return out; } }; bool comPs(const pair<Point, int> &a, const pair<Point, int> &b) { int s = sign(a.first.x - b.first.x); if (s < 0) return true; if (s > 0) return false; return a.second < b.second; } double unionArea(vector<Polygon> &polys) { double ans = 0; int N = (int)polys.size(); if (N == 0) return ans; vector<pair<double, double> > lines; for (int i = 0; i < N; ++i) for (int j = 0; j < polys[i].size(); ++j) { Point a, b; polys[i].getSeg(j, a, b); if (fabs(a.x - b.x) < eps) continue; double deg = atan2(b.y - a.y, b.x - a.x); double bb = a.y - (b.y - a.y) * a.x / (b.x - a.x); bool close = false; for (int k = 0; k < lines.size(); ++k) if (fabs(lines[k].first - deg) < eps && fabs(lines[k].second - bb) < eps) close = true; if (close) continue; lines.push_back(make_pair(deg, bb)); vector<pair<Point, int> > ps; for (int k = 0; k < N; ++k) { bool isPar = false; for (int l = 0; l < polys[k].size(); ++l) { Point c, d; polys[k].getSeg(l, c, d); if (fabs(c.x - d.x) < eps) continue; if (onLine(c, a, b) && onLine(d, a, b)) { int dir = (c.x < d.x) ? 2 : 1; if (c.x > d.x) swap(c, d); ps.push_back(make_pair(c, dir * 2)); ps.push_back(make_pair(d, dir * 2 + 1)); isPar = true; break; } } if (isPar) continue; vector<Point> inters; for (int l = 0; l < polys[k].size(); ++l) { Point c, d; polys[k].getSeg(l, c, d); vector<Point> t = interLine(a, b, c, d); for (int z = 0; z < t.size(); ++z) if (onSeg(t[z], c, d)) inters.push_back(t[z]); } sort(inters.begin(), inters.end(), comPointByX); inters.resize(unique(inters.begin(), inters.end(), comPointEqual) - inters.begin()); if (inters.size() >= 2) { ps.push_back(make_pair(inters.front(), 0)); ps.push_back(make_pair(inters.back(), 1)); } } sort(ps.begin(), ps.end(), comPs); int cntPosi = 0, cntNega = 0; int cntIn = 0; for (int k = 0; k < ps.size(); ++k) { double x2 = ps[k].first.x; double y2 = ps[k].first.y; double x1 = 0, y1 = 0; if (k > 0) { x1 = ps[k - 1].first.x; y1 = ps[k - 1].first.y; } double area = (x2 - x1) * (y2 + y1) / 2; if (cntPosi > 0 && cntNega == 0 && x2 - x1 > eps && cntIn == 0) ans += area; if (cntPosi == 0 && cntNega > 0 && x2 - x1 > eps && cntIn == 0) ans -= area; int id = ps[k].second; if (id == 2) cntPosi++; if (id == 4) cntNega++; if (id == 0) cntIn++; if (id == 3) cntPosi--; if (id == 5) cntNega--; if (id == 1) cntIn--; } } return ans; } struct ConvexHull { static inline bool cmp(const Point &a, const Point &b) { return a.y < b.y || (a.y == b.y && a.x < b.x); } static Polygon convexHull(const vector<Point> &points, bool needInnerEdgePoint = false) { vector<Point> p(points.begin(), points.end()); vector<int> stack(p.size() + 1); Polygon poly; poly.clear(); if (p.size() == 0) return poly; if (p.size() == 1) { poly.addPoint(points[0]); return poly; } sort(p.begin(), p.end(), ConvexHull::cmp); int threshold = 0; if (needInnerEdgePoint) threshold = 1; int N = (int)p.size(); int top = -1; stack[++top] = 0; stack[++top] = 1; for (int i = 2; i < N; i++) { while (top >= 1 && sign(cross(p[stack[top - 1]], p[i], p[stack[top]])) >= threshold) top--; stack[++top] = i; } int temp_top = top; stack[++top] = N - 2; for (int i = N - 3; i >= 0; i--) { while (top >= temp_top + 1 && sign(cross(p[stack[top - 1]], p[i], p[stack[top]])) >= threshold) top--; stack[++top] = i; } for (int i = 0; i < top; ++i) poly.addPoint(p[stack[i]]); return poly; } }; class HalfPlanes { public: Polygon poly; HalfPlanes(double maxRange) { poly.addPoint(Point(-maxRange, -maxRange)); poly.addPoint(Point(maxRange, -maxRange)); poly.addPoint(Point(maxRange, maxRange)); poly.addPoint(Point(-maxRange, maxRange)); } void intersect(const Point &a, const Point &b) { poly = poly.cut(a, b); } void intersect(double A, double B, double C) { pair<Point, Point> ab = onLine(A, B, C); pair<Point, Point> cd = getVerticalEquallySegment(ab.first, ab.second); Point a = ab.first, b = ab.second, c = cd.first, d = cd.second; double vc = A * c.x + B * c.y + C; if (vc > 0) { if (sign(cross(a, b, c)) > 0) swap(a, b); } else { if (sign(cross(a, b, d)) > 0) swap(a, b); } poly = poly.cut(a, b); } void intersect(const Point &a, const Point &b, const Point &c) { if (sign(cross(a, b, c)) <= 0) poly = poly.cut(a, b); else poly = poly.cut(b, a); } }; class Voronoy { public: vector<Point> ps; vector<HalfPlanes> planes; Voronoy(vector<Point> &points, double maxRange) { int N = (int)points.size(); ps = points; planes.resize(N, HalfPlanes(maxRange)); for (int i = 0; i < N; ++i) for (int j = i + 1; j < N; ++j) { pair<Point, Point> v = getVerticalEquallySegment(ps[i], ps[j]); planes[i].intersect(v.first, v.second, ps[i]); planes[j].intersect(v.first, v.second, ps[j]); } } }; struct Point3D { double x, y, z; Point3D() {} Point3D(double xx, double yy, double zz) { x = xx; y = yy; z = zz; } double len() { return sqrt(x * x + y * y + z * z); } }; Point3D operator+(const Point3D &a, const Point3D &b) { return Point3D(a.x + b.x, a.y + b.y, a.z + b.z); } Point3D operator-(const Point3D &a, const Point3D &b) { return Point3D(a.x - b.x, a.y - b.y, a.z - b.z); } double dist(const Point3D &a, const Point3D &b) { return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y) + sqr(a.z - b.z)); } double dot(const Point3D &a, const Point3D &b) { return a.x * b.x + a.y * b.y + a.z * b.z; } Point3D cross(const Point3D &u, const Point3D &v) { Point3D ret; ret.x = u.y * v.z - v.y * u.z; ret.y = u.z * v.x - u.x * v.z; ret.z = u.x * v.y - u.y * v.x; return ret; } Point3D planeVector(const Point3D &a, const Point3D &b, const Point3D &c) { return cross(a - b, b - c); } double distToPlane(const Point3D &p, const Point3D &s1, const Point3D &s2, const Point3D &s3) { Point3D plane = planeVector(s1, s2, s3); return dot(plane, p - s1) / plane.len(); } Point ps[4]; Point a, b, c, d; class State { public: double x, y, z; State operator+(const State &other) { State ret; ret.x = x + other.x; ret.y = y + other.y; ret.z = z + other.z; return ret; } State operator-(const State &other) { State ret; ret.x = x - other.x; ret.y = y - other.y; ret.z = z - other.z; return ret; } State operator*(double k) { State ret; ret.x = x * k; ret.y = y * k; ret.z = z * k; return ret; } friend ostream &operator<<(ostream &out, const State &state) { out << state.x << << state.y << << state.z; return out; } }; double func(const State &s) { Point p(s.x, s.y); double ret = dist(Point(0, 0), p); ret += dist(getMinimumDistPointOnLine(c, d, p), p); return ret; } class GoldSplitSearch { public: static State findMinimum(State &begin, State &end, double (*func)(const State &s)) { const double tou = (sqrt(5.0) - 1) / 2; State a = begin; State b = end; for (int k = 0; k < 200; ++k) { State x1 = a + (b - a) * (1 - tou); State x2 = a + (b - a) * tou; double f1 = func(x1); double f2 = func(x2); if (f1 > f2) a = x1; else b = x2; } return a; } }; double getAns(Point aa, Point bb, Point cc, Point dd) { c = cc; d = dd; double scale = 100000 / (bb - aa).length(); Point na = (aa - bb) * scale + bb; Point nb = (bb - aa) * scale + aa; State begin; begin.x = na.x; begin.y = na.y; State end; end.x = nb.x; end.y = nb.y; State s = GoldSplitSearch::findMinimum(begin, end, func); return func(s); } int N; vector<Polygon> polys; void init() { double ans = 0; cin >> N; polys.clear(); for (int i = 0; i < N; ++i) { vector<Point> ps(4); for (int j = 0; j < 4; ++j) cin >> ps[j]; Polygon poly = ConvexHull::convexHull(ps); polys.push_back(poly); ans += poly.area(); } ans = ans / (unionArea(polys)); printf( %.10f n , ans); } void york() {} int main() { init(); york(); return 0; } |
#include <bits/stdc++.h> const double eps = 1e-10; int n, a, b, cnta[100010], cntb[100010]; double p[100010], q[100010], f[100010]; void check2(double costa, double costb) { for (int i = 1; i <= n; i++) { f[i] = 0; cnta[i] = 0; cntb[i] = 0; f[i] = f[i - 1]; cnta[i] = cnta[i - 1]; cntb[i] = cntb[i - 1]; if (f[i] < f[i - 1] + p[i] - costa - eps) { f[i] = f[i - 1] + p[i] - costa; cnta[i] = cnta[i - 1] + 1; cntb[i] = cntb[i - 1]; } if (f[i] < f[i - 1] + q[i] - costb - eps) { f[i] = f[i - 1] + q[i] - costb; cnta[i] = cnta[i - 1]; cntb[i] = cntb[i - 1] + 1; } if (f[i] < f[i - 1] + p[i] - costa + q[i] - costb - p[i] * q[i] - eps) { f[i] = f[i - 1] + p[i] - costa + q[i] - costb - p[i] * q[i]; cnta[i] = cnta[i - 1] + 1; cntb[i] = cntb[i - 1] + 1; } } } double check1(double cost) { double l = 0, r = 1, mid; for (int i = 1; i <= 50; i++) { mid = (l + r) / 2; check2(cost, mid); if (cntb[n] > b) l = mid; else r = mid; } return l; } double l, r, mid, v, ans; int main() { scanf( %d %d %d , &n, &a, &b); for (int i = 1; i <= n; i++) scanf( %lf , p + i); for (int i = 1; i <= n; i++) scanf( %lf , q + i); l = 0; r = 1; while (r - l > eps) { mid = (l + r) / 2.0; v = check1(mid); if (cnta[n] > a) l = mid; else r = mid; } check2(l, v); printf( %.10lf n , f[n] + l * a + v * b); return 0; } |
#include <bits/stdc++.h> using namespace std; using s64 = long long; const int M = 1000000007; int add(int a, const int &b) { a += b; return a >= M ? a - M : a; } int sub(int a, const int &b) { a -= b; return a < 0 ? a + M : a; } int mul(const int &a, const int &b) { return (s64)a * b % M; } int main() { int n, k; cin >> n >> k; vector<int> fac(n), ifac(n); fac[0] = fac[1] = ifac[0] = ifac[1] = 1; for (int i = 2; i < n; ++i) { fac[i] = mul(fac[i - 1], i); ifac[i] = mul(M - M / i, ifac[M % i]); } for (int i = 2; i < n; ++i) { ifac[i] = mul(ifac[i], ifac[i - 1]); } vector<int> f(n + 1), sum(n + 1); for (int i = k + 1; i <= n; ++i) { f[i] = mul(add(i - k - 1, sub(sum[i - 1], sum[i - k - 1])), fac[i - 2]); sum[i] = mul(f[i], ifac[i - 1]); sum[i] = add(sum[i], sum[i - 1]); } int answer = 0; for (int i = 1; i <= n; ++i) { answer = add(answer, mul(f[i], mul(fac[n - 1], ifac[i - 1]))); } cout << answer << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e9 + 7; map<long long, long long> factorize(long long n) { map<long long, long long> ans; for (long long i = 2; i * i <= n; i++) { while (n % i == 0) { ans[i]++; n /= i; } } if (n > 1) { ans[n]++; n = 1; } return ans; } void FAST() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long binpow(long long a, long long b, long long m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } int main() { FAST(); long long t; cin >> t; while (t--) { long long x; cin >> x; long long y; cin >> y; long long k; cin >> k; long long reqy = y * k; if ((k * (y + 1) - 1) % (x - 1)) { cout << (k * (y + 1) - 1) / (x - 1) + k + 1 << n ; } else cout << (k * (y + 1) - 1) / (x - 1) + k << n ; } } |
#include <bits/stdc++.h> using namespace std; const int infi = 1e9 + 7; const long long infl = (long long)1e18 + (long long)7; const long long mod = 998244353; long long sum[300500]; long long get_sum(int l, int r) { if (l > r) { return 0; } if (l) { return sum[r] - sum[l - 1]; } return sum[r]; } long long ar[300500]; long long pow(long long a, long long p) { long long ans = 1; while (p) { if (p & 1LL) { ans *= a; ans %= mod; } a *= a; a %= mod; p >>= 1; } return ans; } long long norm(long long a, long long n) { return (a * pow(n, mod - 2)) % mod; } int32_t main() { cin.sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 0; i < (n); ++i) { cin >> ar[i]; } sort(ar, ar + n); reverse(ar, ar + n); for (int i = 0; i < (n); ++i) { if (i) sum[i] = sum[i - 1]; sum[i] += ar[i]; sum[i] %= mod; } for (int len = 1; len < n; ++len) { long long ans = 0; for (long long w = 1, l = len; l < n; l += len, ++w) { long long r = min(l + len - 1, n - 1LL); ans += get_sum(l, r) * w; ans %= mod; } if (ans < 0) ans += mod; cout << norm(ans, n) << ; } cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long a[1000000], m, n, i, j, k, l, ma, mi; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; if (n <= 2) { cout << -1 << endl; return 0; } for (i = 1; i <= n - 2; i++) if (a[i] != a[i + 2]) { if (a[i] == a[i + 1]) { cout << i + 1 << << i + 2 << endl; return 0; } else if (a[i + 1] == a[i + 2]) { cout << i << << i + 1 << endl; return 0; } else { if (a[i] > a[i + 1] && a[i] > a[i + 2]) ma = i; else if (a[i + 1] > a[i] && a[i + 1] > a[i + 2]) ma = i + 1; else ma = i + 2; if (a[i] < a[i + 1] && a[i] < a[i + 2]) mi = i; else if (a[i + 1] < a[i] && a[i + 1] < a[i + 2]) mi = i + 1; else mi = i + 2; if (ma != i + 1) { if (ma != i + 2) cout << i << << i + 1 << endl; else cout << i + 2 << << i + 1 << endl; return 0; } if (mi != i + 1) { if (mi != i + 2) cout << i << << i + 1 << endl; else cout << i + 2 << << i + 1 << endl; return 0; } } } if (n == 3 && a[1] == a[3]) { cout << -1 << endl; return 0; } else if (a[1] != a[2]) cout << 1 << << 2 << endl; else cout << -1 << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { bitset<30> a; bitset<30> b; a.reset(); b.reset(); bool bigger = 0; cout << ? 0 0 << endl; fflush(stdout); int aa; cin >> aa; if (aa == -1) { bigger = 1; } bitset<30> adda; bitset<30> addb; for (int i = 29; i >= 0; i--) { adda[i] = 1; addb[i] = 1; cout << ? << adda.to_ulong() << << addb.to_ulong() << endl; fflush(stdout); int aa; cin >> aa; if (aa == -1 && bigger == 0) { a[i] = 1; b[i] = 0; adda[i] = 0; addb[i] = 1; cout << ? << adda.to_ulong() << << addb.to_ulong() << endl; fflush(stdout); int aa; cin >> aa; if (aa == -1) { bigger = 1; } } else if (aa == 1 && bigger == 1) { a[i] = 0; b[i] = 1; adda[i] = 1; addb[i] = 0; cout << ? << adda.to_ulong() << << addb.to_ulong() << endl; fflush(stdout); int aa; cin >> aa; if (aa == 1) { bigger = 0; } } else if (aa == 1 && bigger == 0) { adda[i] = 1; addb[i] = 0; cout << ? << adda.to_ulong() << << addb.to_ulong() << endl; fflush(stdout); int aa; cin >> aa; if (aa == 1) { a[i] = 0; b[i] = 0; adda[i] = 0; addb[i] = 0; } else if (aa == -1) { a[i] = 1; b[i] = 1; adda[i] = 1; addb[i] = 1; } } else if (aa == -1 && bigger == 1) { adda[i] = 0; addb[i] = 1; cout << ? << adda.to_ulong() << << addb.to_ulong() << endl; fflush(stdout); int aa; cin >> aa; if (aa == -1) { a[i] = 0; b[i] = 0; adda[i] = 0; addb[i] = 0; } else if (aa == 1) { a[i] = 1; b[i] = 1; adda[i] = 1; addb[i] = 1; } } else if (aa == 0) { adda[i] = 0; addb[i] = 1; cout << ? << adda.to_ulong() << << addb.to_ulong() << endl; fflush(stdout); int aa; cin >> aa; if (aa == -1) { a[i] = 0; b[i] = 0; adda[i] = 0; addb[i] = 0; } else if (aa == 1) { a[i] = 1; b[i] = 1; adda[i] = 1; addb[i] = 1; } } } cout << ! << a.to_ulong() << << b.to_ulong() << endl; fflush(stdout); } |
#include <bits/stdc++.h> using namespace std; int n, m, q; int arr[26]; string s; long long dp[1001][1001]; int mn = 1 << 20, mx = 0; long long solve(int idx, int sz, int mn) { if (sz > mn) return 0; mx = max(mx, sz); if (idx == n) return 1; if (dp[idx][sz] != -1) return dp[idx][sz] % 1000000007; if (sz < mn) { long long a = solve(idx + 1, 1, arr[s[idx] - a ]); return dp[idx][sz] = (a + solve(idx + 1, sz + 1, min(mn, arr[s[idx] - a ]))) % 1000000007; } else return dp[idx][sz] = solve(idx + 1, 1, arr[s[idx] - a ]) % 1000000007; } long long solve2(int idx, int sz, int mn) { if (sz > mn) return 1 << 20; if (idx == n) { return 0; } if (dp[idx][sz] != -1) return dp[idx][sz]; if (sz < mn) { long long a = solve2(idx + 1, 1, arr[s[idx] - a ]) + 1; return dp[idx][sz] = min(a, solve2(idx + 1, sz + 1, min(mn, arr[s[idx] - a ]))); } else return dp[idx][sz] = solve2(idx + 1, 1, arr[s[idx] - a ]) + 1; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; memset(dp, -1, sizeof dp); cin >> n; cin >> s; for (int i = 0; i < 26; i++) { cin >> arr[i]; } cout << solve(1, 1, arr[s[0] - a ]) % 1000000007 << endl; ; cout << mx << endl; memset(dp, -1, sizeof dp); cout << solve2(1, 1, arr[s[0] - a ]) + 1 << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; string a[12]; int b[12], vis[40]; vector<string> v; void solve(int i, int rem) { if (i == k + 1) { if (rem == 0) { string s = ; for (int j = 1; j <= k; j++) { if (vis[j]) s += a[0][j]; else s += (a[0][j] == 0 ? 1 : 0 ); } v.push_back(s); } return; } if (rem > 0) { vis[i] = 1; solve(i + 1, rem - 1); vis[i] = 0; } if (k - i + 1 > rem) solve(i + 1, rem); } bool ok(string s) { for (int i = 0; i < m; i++) { int k = 0; for (int j = 0; j < n; j++) { if (s[j] == a[i][j]) k++; } if (k != b[i]) { return 0; } } return 1; } int main() { cin >> n >> m; for (int i = 0; i < m; i++) cin >> a[i] >> b[i]; k = b[0]; string g = a[0]; a[0] = x + a[0]; swap(k, n); solve(1, n); swap(k, n); int ans = 0; a[0] = g; for (auto s : v) { if (ok(s)) ans++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; void MAIN(); int main() { MAIN(); return 0; } const int N = (int)1e5 + 32; char s[N]; int n; void MAIN() { scanf( %d , &n); scanf( %s , s); vector<int> cnt(26, 0); for (int i = 0; i < int(n); i++) cnt[s[i] - A ]++; int ma = 0, nma = 0; for (int i = 0; i < int(26); i++) { if (cnt[i] > ma) { ma = cnt[i]; nma = 1; } else if (cnt[i] == ma) nma++; } int res = 1; for (int i = 0; i < int(n); i++) res = 1LL * res * nma % MOD; printf( %d n , res); } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, x, i, j; cin >> n >> x; long long int mm = 0; long long int mx = 0; for (i = 0; i < n; i++) { long long int a, b; cin >> a >> b; mm = max(mm, a - b); mx = max(mx, a); } if (x <= mx) { cout << 1 n ; return; } if (mm <= 0) { cout << -1 n ; return; } long long int p = x - mx; long long int q = p / mm; if (p % mm != 0) { q++; } x -= (q * mm); if (x > 0) { q++; } cout << q << n ; } int main() { ios_base ::sync_with_stdio(0); cin.tie(NULL); int t; cin >> t; while (t > 0) { t--; solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 5010 + 10; const int mod = 1e9 + 7; char s[N]; char t[N]; int d[N][N]; int main() { int n, m; cin >> n >> m; scanf( %s%s , s + 1, t + 1); int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { d[i][j] = max(d[i - 1][j], d[i][j - 1]) - 1; if (s[i] == t[j]) { d[i][j] = d[i - 1][j - 1] + 2; d[i][j] = max(d[i][j], 2); } ans = max(ans, d[i][j]); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, k; cin >> n >> k; long long ans[6][3] = {0, 1, 2, 1, 0, 2, 1, 2, 0, 2, 1, 0, 2, 0, 1, 0, 2, 1}; cout << ans[n % 6][k] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T BigMod(T b, T p, T m) { if (p == 0) return 1; if (p % 2 == 0) { T s = BigMod(b, p / 2, m); return ((s % m) * (s % m)) % m; } return ((b % m) * (BigMod(b, p - 1, m) % m)) % m; } template <typename T> T ModInv(T b, T m) { return BigMod(b, m - 2, m); } template <typename T> T in() { char ch; T n = 0; bool ng = false; while (1) { ch = getchar(); if (ch == - ) { ng = true; ch = getchar(); break; } if (ch >= 0 && ch <= 9 ) break; } while (1) { n = n * 10 + (ch - 0 ); ch = getchar(); if (ch < 0 || ch > 9 ) break; } return (ng ? -n : n); } template <typename T> T POW(T B, T printf) { if (printf == 0) return 1; if (printf & 1) return B * POW(B, printf - 1); else return (POW(B, printf / 2) * POW(B, printf / 2)); } template <typename T> T Bigmod(T b, T p, T m) { if (p == 0) return 1; else if (!(p & 1)) return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m; else return ((b % m) * Bigmod(b, p - 1, m)) % m; } template <typename T> T Dis(T x1, T y1, T x2, T y2) { return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2)); } template <typename T> T Angle(T x1, T y1, T x2, T y2) { return atan(double(y1 - y2) / double(x1 - x2)); } template <typename T> T DIFF(T a, T b) { T d = a - b; if (d < 0) return -d; else return d; } template <typename T> T ABS(T a) { if (a < 0) return -a; else return a; } template <typename T> T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <typename T> T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, -b); return a * (b / gcd(a, b)); } template <typename T> T euclide(T a, T b, T &x, T &y) { if (a < 0) { T d = euclide(-a, b, x, y); x = -x; return d; } if (b < 0) { T d = euclide(a, -b, x, y); y = -y; return d; } if (b == 0) { x = 1; y = 0; return a; } else { T d = euclide(b, a % b, x, y); T t = x; x = y; y = t - (a / b) * y; return d; } } template <typename T> void ia(T a[], int n) { for (int i = 0; i < n; i++) cin >> a[i]; } template <typename T> void pa(T a[], int n) { for (int i = 0; i < n - 1; i++) cout << a[i] << ; cout << a[n - 1] << endl; } template <typename T> long long int isLeft(T a, T b, T c) { return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y); } int Set(int N, int pos) { return N = N | (1 << pos); } int Reset(int N, int pos) { return N = N & ~(1 << pos); } bool Check(int N, int pos) { return (bool)(N & (1 << pos)); } template <class T, class first> inline T togglebit(T a, first i) { T t = 1; return (a ^ (t << i)); } int toInt(string s) { int sm; stringstream ss(s); ss >> sm; return sm; } int toLlint(string s) { long long int sm; stringstream ss(s); ss >> sm; return sm; } int cdigittoint(char ch) { return ch - 0 ; } bool isVowel(char ch) { ch = toupper(ch); if (ch == A || ch == U || ch == I || ch == O || ch == E ) return true; return false; } bool isConst(char ch) { if (isalpha(ch) && !isVowel(ch)) return true; return false; } double DEG(double x) { return (180.0 * x) / (2.0 * acos(0.0)); } double RAD(double x) { return (x * (double)2.0 * acos(0.0)) / (180.0); } int vis[5000007]; long long int sum[5000007]; void Sieve() { vis[2] = 2; for (int i = 3; i < 5000007; i += 2) { if (!vis[i]) { vis[i] = i; for (int j = 3 * i; j < 5000007; j += i + i) vis[j] = i; } vis[i + 1] = 2; } } void Factor(int n) { int x = n; while (n != 1) { int p = vis[n]; while (n % p == 0) { sum[x]++; n /= p; } } } int main() { Sieve(); for (int i = 2; i < 5000007; i++) Factor(i), sum[i] += sum[i - 1]; int(t); scanf( %d , &t); while (t--) { int x, y; scanf( %d%d , &x, &y); printf( %lld n , sum[x] - sum[y]); } return 0; } |
#include <bits/stdc++.h> using namespace std; char str[10000 + 1]; int M; char tmp[10000 + 1]; int main() { scanf( %s , str); scanf( %d , &M); for (int t = 0; t < M; t++) { int l, r, k; scanf( %d %d %d , &l, &r, &k); int s_len = (r - l + 1); k = k % s_len; --l, --r; for (int i = s_len - 1; i >= 0; i--) { int d = (i - k); if (d < 0) { tmp[i] = str[l + d + s_len]; } else { tmp[i] = str[l + d]; } } for (int i = l; i <= r; i++) { str[i] = tmp[i - l]; } } printf( %s n , str); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, h, t, r, x, y, dis[210][210], h1[210], t1[210], h2[210], t2[210], bfs[210 * 210][2], L, R; void renew(int x, int y, int v) { if (x + y > r) return; if (dis[x][y] == -1) { dis[x][y] = v; bfs[++R][0] = x; bfs[R][1] = y; } } int dfs(int x, int y) { if (x + y > r) return 0; int i, p = 1; if (dis[x][y] == -1) { printf( Draw n ); exit(0); } if (dis[x][y]) return dis[x][y]; dis[x][y] = -1; for (i = 1; i <= n && i <= x; ++i) p = max(p, dfs(x - i + h1[i], y + t1[i]) + 1); for (i = 1; i <= m && i <= y; ++i) p = max(p, dfs(x + h2[i], y - i + t2[i]) + 1); dis[x][y] = p; return p; } int main() { int i; scanf( %d%d%d , &h, &t, &r); scanf( %d , &n); for (i = 1; i <= n; ++i) scanf( %d%d , &h1[i], &t1[i]); scanf( %d , &m); for (i = 1; i <= m; ++i) scanf( %d%d , &h2[i], &t2[i]); memset(dis, -1, sizeof(dis)); dis[h][t] = 0; bfs[L = R = 1][0] = h; bfs[1][1] = t; while (L <= R) { x = bfs[L][0]; y = bfs[L++][1]; for (i = 1; i <= n && i <= x; ++i) renew(x - i + h1[i], y + t1[i], dis[x][y] + 1); for (i = 1; i <= m && i <= y; ++i) renew(x + h2[i], y - i + t2[i], dis[x][y] + 1); } if (dis[0][0] != -1) return printf( Ivan n%d n , dis[0][0]), 0; memset(dis, 0, sizeof(dis)); printf( Zmey n%d n , dfs(h, t)); } |
#include <bits/stdc++.h> using namespace std; const int maxN = 200011; long long n, i, j, cntx, cnty, x, y, z; long long vx[maxN]; map<long long, long long> Mx, My; map<pair<long long, long long>, long long> M; pair<long long, pair<long long, long long> > low; vector<vector<long long> > data; vector<long long> le, ri; vector<long long> vals; long long gcd(long long a, long long b) { if (a < b) swap(a, b); while (b > 0) { a %= b; swap(a, b); } return a; } bool check_rat() { int i, j; for (i = 1; i + 1 <= cntx; i++) { for (j = 1; j + 1 <= cnty; j++) { if (data[i][j] * data[i + 1][j + 1] != data[i + 1][j] * data[i][j + 1]) return false; } } return true; } void check(long long d) { long long i, j; le[low.second.first] = d; for (i = 1; i <= cnty; i++) { if (data[low.second.first][i] % d) return; ri[i] = data[low.second.first][i] / d; } for (i = 1; i <= cntx; i++) { if (data[i][1] % ri[1]) return; le[i] = data[i][1] / ri[1]; } long long aux = 0; for (i = 1; i <= cntx; i++) aux += le[i] * vx[i]; vals.push_back(aux); } int main() { low = make_pair(1LL << 60, make_pair(0, 0)); scanf( %lld , &n); for (i = 1; i <= n; i++) { scanf( %lld%lld%lld , &x, &y, &z); if (Mx[x] == 0) Mx[x] = ++cntx, vx[cntx] = x; if (My[y] == 0) My[y] = ++cnty; M[make_pair(Mx[x], My[y])] = z; low = min(low, make_pair(z, make_pair(Mx[x], My[y]))); } if (cntx * cnty != n) { printf( 0 ); return 0; } le.resize(cntx + 1); ri.resize(cnty + 1); data = vector<vector<long long> >(cntx + 1, vector<long long>(cnty + 1, 0)); for (i = 1; i <= cntx; i++) for (j = 1; j <= cnty; j++) data[i][j] = M[make_pair(i, j)]; if (!check_rat()) { printf( 0 ); return 0; } for (i = 1; i <= cnty; i++) low.first = gcd(low.first, data[low.second.first][i]); for (long long d = 1; d * d <= low.first; d++) { if (low.first % d) continue; check(d); if (d * d != low.first) check(low.first / d); } sort(vals.begin(), vals.end()); vals.resize(unique(vals.begin(), vals.end()) - vals.begin()); printf( %d , vals.size()); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, mod = 1000000007; bool ok[1005]; char a[1005], b[1005]; int cnt[2][1005], tp, tn; int solve() { scanf( %s , a); scanf( %s , b); n = strlen(a); scanf( %d , &k); int cg = 0; for (int i = 0; i < n; i++) { ok[i] = true; for (int j = 0; j < n && ok[i]; j++) if (a[j] != b[(i + j) % n]) ok[i] = false; cg += ok[i]; } if (!cg) return 0; cnt[1][0] = 1; tp = 1; for (int s = 0; s < k; s++) { tn = 0; int p = (s + 1) % 2, c = s % 2; for (int i = 0; i < n; i++) { cnt[c][i] = (tp + mod - cnt[p][i]) % mod; tn = (tn + cnt[c][i]) % mod; } tp = tn; } int re = 0; for (int i = 0; i < n; i++) if (ok[i]) { re = (re + cnt[(k + 1) % 2][i]) % mod; } return re; } int main() { printf( %d n , solve()); } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 1e5; int v[NMAX + 5], ans[NMAX + 5]; inline void GenerateAnswer(int n) { int i, state = 1, st = 1, dr = n, dim = 0; sort(v + 1, v + n + 1); while (st <= dr) { if (st != dr) { if (state == 1) ans[++dim] = v[st], ans[++dim] = v[dr]; else ans[++dim] = v[dr], ans[++dim] = v[st]; } else ans[++dim] = v[st]; ++st; --dr; } } int main() { int t, n, i, j; scanf( %d , &t); for (j = 1; j <= t; ++j) { scanf( %d , &n); for (i = 1; i <= n; ++i) scanf( %d , &v[i]); GenerateAnswer(n); for (i = n; i >= 1; --i) printf( %d , ans[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; string s; cin >> s; if (s[0] == @ || s.back() == @ || (s.find( @ ) == -1)) { cout << No solution ; return 0; } vector<int> v; for (int i = 0; i < s.size(); i++) { if (s[i] == @ ) v.push_back(i); } for (int i = 1; i < v.size(); i++) { if (v[i] - v[i - 1] < 3) { cout << No solution ; return 0; } } int pre = 0; for (int i = 0; i < v.size(); i++) { for (int j = pre; j <= v[i] + 1; j++) { cout << s[j]; } if (i + 1 != v.size()) cout << , ; pre = v[i] + 2; } for (int i = pre; i < s.size(); i++) cout << s[i]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 4010; int N; long long V[MAXN], D[MAXN], P[MAXN]; set<int> st; int main() { if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); } ios::sync_with_stdio(false); cin >> N; for (int i = 1; i <= N; i++) { cin >> V[i] >> D[i] >> P[i]; st.insert(i); } vector<int> ans; while (!st.empty()) { int b = *st.begin(); ans.push_back(b); st.erase(st.begin()); long long val = V[b]; for (int i : st) { P[i] -= val; val--; if (val == 0) { break; } } for (auto it = st.begin(); it != st.end();) { int i = *it; if (P[i] >= 0) { it++; continue; } st.erase(it++); for (auto jt = it; jt != st.end(); jt++) { P[*jt] -= D[i]; } } } cout << ans.size() << endl; for (int i : ans) { cout << i << ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e7 + 10; const int INF = 0x3f3f3f3f; const double EPS = 1e-10; inline int read() { int ret = 0, f = 0; char ch = getchar(); while (ch > 9 || ch < 0 ) f ^= ch == - , ch = getchar(); while (ch <= 9 && ch >= 0 ) ret = ret * 10 + ch - 0 , ch = getchar(); return f ? -ret : ret; } int n, m; char s[1005]; int main() { scanf( %d%d , &n, &m); int x = 0, y = 0; int cnt = 0; for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) if (s[j] == B ) cnt++, x += i, y += j; } x /= cnt; y /= cnt; printf( %d %d n , x, y); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; constexpr long long mod = 998244353; const long long INF = mod * mod; const long double eps = 1e-12; const long double pi = acosl(-1.0); long long mod_pow(long long x, long long n, long long m = mod) { if (n < 0) { long long res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m) x %= m; if (x < 0) x += m; long long res = 1; while (n) { if (n & 1) res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { long long n; modint() : n(0) { ; } modint(long long m) : n(m) { if (n >= mod) n %= mod; else if (n < 0) n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod) a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0) a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((long long)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, long long n) { if (n == 0) return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2) res = res * a; return res; } long long inv(long long a, long long p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 10; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b) return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b) return 0; return fact[a] * factinv[a - b]; } void solve() { int n, m; cin >> n >> m; vector<vector<int>> v(m); for (int i = 0; i < m; i++) { int len; cin >> len; v[i].resize(len); for (int j = 0; j < len; j++) { cin >> v[i][j]; v[i][j]--; } } vector<vector<int>> ids(n); for (int i = 0; i < m; i++) for (int j = 0; j < v[i].size(); j++) ids[v[i][j]].push_back(i); vector<bool> used(m); modint pro = 1; int cnt = 0; vector<pair<int, int>> vv; for (int i = 0; i < m; i++) { vv.push_back({v[i].size(), i}); } sort((vv).begin(), (vv).end(), greater<pair<int, int>>()); function<int(vector<int>)> dfs = [&](vector<int> vid) { int cnt = 0; for (int _ = 0; _ < vid.size(); _++) { int i = vid[_]; if (used[i]) continue; used[i] = true; vector<vector<int>> vals; vals.push_back(v[i]); priority_queue<pair<int, int>> q; for (int id : v[i]) for (int iid : ids[id]) { if (!used[iid]) { q.push({v[iid].size(), iid}); used[iid] = true; } } cnt++; if (q.empty()) { pro *= fact[v[i].size()]; continue; } bool exiz = false; auto merge = [&](int x) -> bool { int l = mod, r = -mod; bool exi = false; vector<int> cnt(vals.size()); vector<int> trans(n, -1); for (int i = 0; i < vals.size(); i++) for (int j = 0; j < vals[i].size(); j++) trans[vals[i][j]] = i; vector<bool> isin(n); for (int id : v[x]) isin[id] = true; for (int id : v[x]) { if (trans[id] < 0) { exi = true; continue; } cnt[trans[id]]++; l = min(l, trans[id]); r = max(r, trans[id]); } if (r - l > 1) { for (int j = l + 1; j < r; j++) { if (cnt[j] != vals[j].size()) { cout << 0 << n ; exit(0); } } } if (exi) { bool isleft = false; bool isright = false; if (l == 0) { isleft = true; if (r > 0 && vals[0].size() != cnt[0]) isleft = false; } if (r == vals.size() - 1) { isright = true; if (l < r && vals[r].size() != cnt[r]) isright = false; } if (!isleft && !isright) { cout << 0 << n ; exit(0); } if (isleft) { if (vals[r].size() != cnt[r]) { vector<int> cl, cr; for (int id : vals[r]) { if (isin[id]) cl.push_back(id); else cr.push_back(id); } vals.erase(vals.begin() + r); vals.insert(vals.begin() + r, cr); vals.insert(vals.begin() + r, cl); } vector<int> cl; for (int id : v[x]) if (trans[id] < 0) cl.push_back(id); vals.insert(vals.begin(), cl); } else { if (vals[l].size() != cnt[l]) { vector<int> cl, cr; for (int id : vals[l]) { if (isin[id]) cr.push_back(id); else cl.push_back(id); } vals.erase(vals.begin() + l); vals.insert(vals.begin() + l, cr); vals.insert(vals.begin() + l, cl); } vector<int> cr; for (int id : v[x]) if (trans[id] < 0) cr.push_back(id); vals.push_back(cr); } } else { if (l < r) { if (vals[r].size() != cnt[r]) { vector<int> cl, cr; for (int id : vals[r]) { if (isin[id]) cl.push_back(id); else cr.push_back(id); } vals.erase(vals.begin() + r); vals.insert(vals.begin() + r, cr); vals.insert(vals.begin() + r, cl); } if (vals[l].size() != cnt[l]) { vector<int> cl, cr; for (int id : vals[l]) { if (isin[id]) cr.push_back(id); else cl.push_back(id); } vals.erase(vals.begin() + l); vals.insert(vals.begin() + l, cr); vals.insert(vals.begin() + l, cl); } } else { return false; } } exiz = true; return true; }; vector<int> zr; while (!q.empty()) { int x = q.top().second; q.pop(); for (int id : v[x]) for (int iid : ids[id]) { if (!used[iid]) { q.push({v[iid].size(), iid}); used[iid] = true; } } if (!merge(x)) { zr.push_back(x); } } while (zr.size()) { bool fin = false; for (int j = 0; j < zr.size(); j++) { if (merge(zr[j])) { zr.erase(zr.begin() + j); fin = true; break; } } if (!fin) break; } for (int id : zr) { used[id] = false; } vector<vector<int>> zid(vals.size()); vector<int> trans(n); for (int i = 0; i < vals.size(); i++) for (int j = 0; j < vals[i].size(); j++) trans[vals[i][j]] = i; for (int id : zr) { zid[trans[v[id][0]]].push_back(id); } vector<bool> aft(n); for (int id : zr) for (int iid : v[id]) aft[iid] = true; for (int i = 0; i < vals.size(); i++) { vector<pair<int, int>> nv; for (int id : zid[i]) nv.push_back({v[id].size(), id}); sort((nv).begin(), (nv).end(), greater<pair<int, int>>()); for (int j = 0; j < nv.size(); j++) { zid[i][j] = nv[j].second; } int c = dfs(zid[i]); for (int id : vals[i]) if (!aft[id]) { pro *= c + 1; c++; } } if (exiz) pro *= 2; } pro *= fact[cnt]; return cnt; }; vector<int> ori(m); for (int i = 0; i < m; i++) { ori[i] = vv[i].second; } int c = dfs(ori); vector<int> exi(n); for (int i = 0; i < m; i++) for (int j = 0; j < v[i].size(); j++) exi[v[i][j]] = true; for (int i = 0; i < n; i++) if (!exi[i]) { pro *= c + 1; c++; } cout << pro << n ; } signed main() { ios::sync_with_stdio(false); cin.tie(0); init_f(); solve(); return 0; } |
#include <bits/stdc++.h> const int N = 1000001; using namespace std; vector<int> a[N]; bool st[N], vis1[N]; void f(int u) { st[u] = true; vis1[u] = true; for (int v : a[u]) { if (st[v]) { cout << Draw ; exit(0); } if (!vis1[v]) { f(v); } } st[u] = false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; for (int i = 1; i < n + 1; i++) { int x, v; cin >> x; while (x--) { cin >> v; a[i].push_back(v); } } int x; cin >> x; queue<pair<int, int>> q; bool vis[n + 1][2]; int par[n + 1][2]; memset(vis, false, sizeof vis); q.push(make_pair(x, 0)); vis[x][0] = true; while (!q.empty()) { auto f = q.front(); q.pop(); if (a[f.first].empty() && f.second) { cout << Win n ; vector<int> ans; int v = f.first, typ = f.second; while (v != x || typ) { ans.push_back(v); v = par[v][typ]; typ = 1 - typ; } cout << x << ; for (int i = (int)ans.size() - 1; i >= 0; i--) cout << ans[i] << ; return 0; } for (int v : a[f.first]) { if (!vis[v][1 - f.second]) { vis[v][1 - f.second] = true; q.push(make_pair(v, 1 - f.second)); par[v][1 - f.second] = f.first; } } } memset(st, false, sizeof st); memset(vis1, false, sizeof vis1); f(x); cout << Lose ; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; bool a[2501][2501]; int sum[2501][2501]; long long ans = 0; int get(int x1, int x2, int y1, int y2) { return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1]; } void solve(int x1, int y1, int x2, int y2) { if (x1 == x2 && y1 == y2) { ans += a[x1][y1] == k; return; } if (y2 - y1 > x2 - x1) { int yy = (y2 + y1) >> 1; for (int c = 0; c <= k; c++) { int c1 = c, c2 = k - c; for (int i = x1; i <= x2; i++) { int l1 = y1, r1 = y1; int l2 = y2, r2 = y2; for (int j = i; j <= x2; j++) { while (l1 <= yy && get(i, j, l1, yy) >= c1) l1++; while (r1 <= yy && get(i, j, r1, yy) > c1) r1++; if (r1 > yy) break; while (l2 > yy && get(i, j, yy + 1, l2) >= c2) l2--; while (r2 > yy && get(i, j, yy + 1, r2) > c2) r2--; if (r2 <= yy) break; long long w1 = 0, w2 = 0; if (get(i, j, r1, yy) == c1) w1 = l1 - r1; if (get(i, j, yy + 1, r2) == c2) w2 = r2 - l2; ans += w1 * w2; } } } solve(x1, y1, x2, yy); solve(x1, yy + 1, x2, y2); } else { int xx = (x1 + x2) >> 1; for (int c = 0; c <= k; c++) { int c1 = c, c2 = k - c; for (int i = y1; i <= y2; i++) { int l1 = x1, r1 = x1; int l2 = x2, r2 = x2; for (int j = i; j <= y2; j++) { while (l1 <= xx && get(l1, xx, i, j) >= c1) l1++; while (r1 <= xx && get(r1, xx, i, j) > c1) r1++; if (r1 > xx) break; while (l2 > xx && get(xx + 1, l2, i, j) >= c2) l2--; while (r2 > xx && get(xx + 1, r2, i, j) > c2) r2--; if (r2 <= xx) break; long long w1 = 0, w2 = 0; if (get(r1, xx, i, j) == c1) w1 = l1 - r1; if (get(xx + 1, r2, i, j) == c2) w2 = r2 - l2; ans += w1 * w2; } } } solve(x1, y1, xx, y2); solve(xx + 1, y1, x2, y2); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { char c; cin >> c; a[i][j] = c - 0 ; sum[i][j] = a[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1]; } } solve(1, 1, n, m); cout << ans; } |
#include <bits/stdc++.h> using namespace std; int nf, ne, ns, rf, re, rs, df, de; double disf, dise, diss; int num[22]; double f[22][22][22]; double ans; double valf[22], vale[22]; inline double cover(double l1, double r1, double l2, double r2) { return max(0.0, min(r1, r2) - max(l1, l2)); } void calc(int n) { double ss = sqrt(1.0 * rs * rs - 1.0); double ff = sqrt(1.0 * rf * rf - 1.0); double ee = sqrt(1.0 * re * re - 1.0); memset(valf, 0, sizeof(valf)); memset(vale, 0, sizeof(vale)); for (int i = (0); i < (int)(n); ++i) { if (num[i] == 2) continue; valf[i] = (ff + ff) * 1.0 * df; if (ff && ss) { for (int j = i; j >= 0; j--) { if (ss + ff < i - j) break; if (!num[j]) continue; valf[i] += cover(1.0 * i - ff, 1.0 * i + ff, 1.0 * j - ss, 1.0 * j + ss) * 1.0 * df * num[j]; } for (int j = i + 1; j < n; j++) { if (ss + ff < j - i) break; if (!num[j]) continue; valf[i] += cover(1.0 * i - ff, 1.0 * i + ff, 1.0 * j - ss, 1.0 * j + ss) * 1.0 * df * num[j]; } } vale[i] = (ee + ee) * 1.0 * de; if (ee && ss) { for (int j = i; j >= 0; j--) { if (ss + ee < i - j) break; if (!num[j]) continue; vale[i] += cover(1.0 * i - ee, 1.0 * i + ee, 1.0 * j - ss, 1.0 * j + ss) * 1.0 * de * num[j]; } for (int j = i + 1; j < n; j++) { if (ss + ee < j - i) break; if (!num[j]) continue; vale[i] += cover(1.0 * i - ee, 1.0 * i + ee, 1.0 * j - ss, 1.0 * j + ss) * 1.0 * de * num[j]; } } } } void dp(int n) { memset(f, 0.0, sizeof(f)); int presum = 0; for (int i = (0); i < (int)(n); ++i) { presum += num[i]; if (!i) { f[i][nf][ne] = 0; if (num[i] <= 1) { if (nf) f[i][nf - 1][ne] = valf[i]; if (ne) f[i][nf][ne - 1] = vale[i]; } if (num[i] == 0) { if (nf > 1) f[i][nf - 2][ne] = valf[i] * 2; if (ne > 1) f[i][nf][ne - 2] = vale[i] * 2; if (nf && ne) f[i][nf - 1][ne - 1] = valf[i] + vale[i]; } continue; } for (int j = nf; nf - j <= (i * 2 - presum + num[i]) && j >= 0; j--) { for (int k = ne; ne - k + nf - j <= (i * 2 - presum + num[i]) && k >= 0; k--) { f[i][j][k] = max(f[i][j][k], f[i - 1][j][k]); if (num[i] <= 1) { if (j) f[i][j - 1][k] = max(f[i][j - 1][k], f[i - 1][j][k] + valf[i]); if (k) f[i][j][k - 1] = max(f[i][j][k - 1], f[i - 1][j][k] + vale[i]); } if (num[i] == 0) { if (j > 1) f[i][j - 2][k] = max(f[i][j - 2][k], f[i - 1][j][k] + valf[i] * 2); if (k > 1) f[i][j][k - 2] = max(f[i][j][k - 2], f[i - 1][j][k] + vale[i] * 2); if (j && k) f[i][j - 1][k - 1] = max(f[i][j - 1][k - 1], f[i - 1][j][k] + valf[i] + vale[i]); } } } } ans = max(ans, f[n - 1][0][0]); } void dfs(int pos, int lft) { if (lft < 0) return; if (pos * 2 >= (nf + ne + ns)) { if (lft == 0) { calc(pos); dp(pos); } return; } num[pos] = 0; dfs(pos + 1, lft); num[pos] = 1; dfs(pos + 1, lft - 1); num[pos] = 2; dfs(pos + 1, lft - 2); num[pos] = 0; } int main() { scanf( %d%d%d%d%d%d%d%d , &nf, &ne, &ns, &rf, &re, &rs, &df, &de); dfs(0, ns); printf( %.8lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int mod(int x, int m) { if (x < 0) x += m; return x % m; } int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> v(n); int mx = -1; for (int i = 0; i < n; ++i) { cin >> v[i]; mx = max(v[i], mx); } int ans = -1; for (int i = 0; i < n; ++i) { if (v[i] == mx) { if (i != 0 && v[i - 1] < v[i]) { ans = i; break; } else if (i != (n - 1) && v[i] > v[i + 1]) { ans = i; break; } } } cout << ans + (ans != -1) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char now[1 << 16], *S, *T; if (T == S) { T = (S = now) + fread(now, 1, 1 << 16, stdin); if (T == S) return EOF; } return *S++; } inline long long read() { register long long x = 0, f = 1; char ch = gc(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = gc(); } while (isdigit(ch)) { x = (x << 3) + (x << 1) + ch - 0 ; ch = gc(); } return (f == 1) ? x : -x; } long long a[1010101], b[1010101], m, n, ida[1010101], idb[1010101]; long long A[1010101], B[1010101], ans[1010101]; inline bool cmpa(long long i, long long j) { return a[i] < a[j]; } inline bool cmpb(long long i, long long j) { return b[i] < b[j]; } signed main() { m = read(), n = read(); for (int i = 1; i <= n; i++) a[i] = read(), ida[i] = i; for (int i = 1; i <= n; i++) b[i] = read(), idb[i] = i; sort(ida + 1, ida + 1 + n, cmpa); sort(idb + 1, idb + 1 + n, cmpb); sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + n); for (int i = 1; i <= n; i++) { b[i + n] = b[i]; b[i + 2 * n] = b[i] + m; b[i] -= m; } for (int i = 1, j = 0; i <= n; i++) { for (; b[j + 1] <= a[i] && j + 1 <= 3 * n; j++) ; if (j - i + 1 >= 1) A[1] += a[i], A[j - i + 2] -= a[i]; if (j - i + 2 <= 2 * n + 1) A[max(1, j - i + 2)] -= a[i], A[2 * n + 2] += a[i]; } for (int j = 1, i = 0; j <= 3 * n; j++) { for (; b[j] > a[i + 1] && i + 1 <= n; i++) ; if (j - i + 1 <= j) B[max(1, j - i + 1)] += b[j], B[j + 1] -= b[j]; if (max(1ll, j - n + 1) <= j - i + 1 && j - i + 1 > 0) B[max(1ll, j - n + 1)] -= b[j], B[j - i + 1] += b[j]; } for (int i = 1; i <= 2 * n + 1; i++) { A[i] += A[i - 1]; B[i] += B[i - 1]; } long long ansid = 0; A[ansid] = B[ansid] = 99999999999999; for (int i = 1; i <= 2 * n + 1; i++) { if (A[ansid] + B[ansid] > A[i] + B[i]) ansid = i; } cout << A[ansid] + B[ansid] << n ; for (int i = 1; i <= n; i++) { ans[ida[i]] = idb[(ansid + i - 2) % n + 1]; } for (int i = 1; i <= n; i++) { printf( %lld , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; long long a[n]; for (int i = 0, ggdem = n; i < ggdem; ++i) cin >> a[i]; long long yo = -1; for (int i = 0, ggdem = n; i < ggdem; ++i) { if (a[i] == -1) { yo = i; } } for (int i = 0, ggdem = yo + 1; i < ggdem; ++i) { a[i] = 0; } long long res = 0; for (long long i = 20; i >= 0; i--) { if ((1 << i) > n) continue; long long mini = 1e18, minid = -1; for (int j = (1 << i) - 1, ggdem = n; j < ggdem; ++j) { if (a[j] <= mini) { mini = a[j]; minid = j; } } res += mini; a[minid] = 1e18; } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(); int main() { int t = 1; cin >> t; while (t--) solve(); return 0; } int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } void solve() { int n; cin >> n; vector<int> a(n); int maxEle = -1; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > maxEle) maxEle = a[i]; } int gcdTillNow = maxEle; for (int i = 0; i < n; i++) { int currMaxGcd = -1, maxGcdPos = -1; for (int j = i; j < n; j++) { if (gcd(a[j], gcdTillNow) > currMaxGcd) { currMaxGcd = gcd(a[j], gcdTillNow); maxGcdPos = j; } } swap(a[i], a[maxGcdPos]); cout << a[i] << ; gcdTillNow = currMaxGcd; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int sum = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) { sum = (sum << 1) + (sum << 3) + (c ^ 48); c = getchar(); } return sum; } int n, k, a, m; set<int> s; set<int>::iterator it; int main() { n = read(), k = read(), a = read(); s.insert(0), s.insert(n + 1); m = read(); int rest = (n + 1) / (a + 1); if (rest < k) { printf( 0 n ); return 0; } for (int i = 1; i <= m; i++) { int x = read(); it = s.lower_bound(x); int a1 = *it; it--; int a2 = *it; int dist = a1 - a2 - 1, dist1 = x - a2 - 1, dist2 = a1 - x - 1; int b = (dist + 1) / (a + 1), b1 = (dist1 + 1) / (a + 1), b2 = (dist2 + 1) / (a + 1); rest -= (b - (b1 + b2)); if (rest < k) { printf( %d n , i); return 0; } s.insert(x); } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long int n; cin >> n; int flag = 0; while (flag == 0 && n != 0) { if ((n % 10) == 1) n = n / 10; else if ((n % 10) == 4) { if (((n / 10) % 10) == 1) n = n / 100; else if (((n / 10) % 10) == 4) { if (((n / 100) % 10) == 1) n = n / 1000; else flag = 1; } else flag = 1; } else flag = 1; } if (flag == 1) cout << NO ; else cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; int mx[8] = {-1, 0, 1, -1, 1, -1, 0, 1}, my[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; int main() { ios::sync_with_stdio(false); int n, m; cin >> n >> m; char a[n + 2][m + 2]; memset(a, 0, sizeof a); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> a[i][j]; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (a[i][j] != * ) { int cnt = 0; for (int k = 0; k <= 7; k++) { if (a[i + mx[k]][j + my[k]] == * ) cnt++; } if (!(cnt == 0 && a[i][j] == . || cnt > 0 && a[i][j] - 0 == cnt)) { cout << NO << endl; return 0; } } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) const long long maxn = 1e5 + 10, LG = 30, mod = 1e9 + 7, inf = 1e18; long long n, m, f[maxn]; vector<long long> in[maxn], out[maxn]; bool mk[maxn], km[maxn]; void dfs(long long v) { mk[v] = 1; for (auto u : out[v]) if (!mk[u] && f[u] != 1) dfs(u); } void sfd(long long v) { km[v] = 1; if (f[v] == 1) return; for (auto u : in[v]) if (!km[u] && f[u] != 2) sfd(u); } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> f[i]; while (m--) { long long v, u; cin >> v >> u; out[v].push_back(u); in[u].push_back(v); } for (int i = 1; i <= n; i++) if (f[i] == 1) dfs(i); for (int i = 1; i <= n; i++) if (f[i] == 2) sfd(i); for (int i = 1; i <= n; i++) cout << (mk[i] && km[i]) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, x; scanf( %d%d , &n, &x); if (n < 2) n = 2; int ans = ((n - 2) + x - 1) / x + 1; printf( %d n , ans); } int main() { int t; scanf( %d , &t); while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; string a, b; int main() { cin >> a >> b; int l1 = a.size(); int l2 = b.size(); int maxx = 0; for (int i = 0; i < l1; ++i) { for (int j = i; j < l1; ++j) { int p = 0; for (int k = 0; k < i; ++k) { if (p < l2) { if (a[k] == b[p]) { p++; } } } for (int k = j + 1; k < l1; ++k) { if (p < l2) { if (a[k] == b[p]) { p++; } } } if (p == l2) { maxx = max(maxx, j - i + 1); } } } cout << maxx; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long n; cin >> n; array<long, 2> a[n], b[n]; long i; for (i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; } for (i = 0; i < n; i++) { if (a[i][0] != a[i][1]) { cout << rated ; return 0; } } for (i = 0; i < n - 1; i++) { if (a[i][0] < a[i + 1][0]) { cout << unrated ; return 0; } } cout << maybe ; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n, m, k, t; cin >> n >> m >> k >> t; pair<long long, long long> p[k]; string s[3] = { Carrots , Kiwis , Grapes }; for (int i = 0; i < k; i++) { cin >> p[i].first >> p[i].second; } sort(p, p + k); for (int i = 0; i < t; i++) { long long a, b; cin >> a >> b; bool f = 1; long long x = (a - 1) * m + b - 1; long long y = 0; for (int j = 0; j < k; j++) { if (p[j].first == a && p[j].second == b) { cout << Waste << endl; f = 0; break; } if (p[j].first < a) { y++; } else if (p[j].first == a) { if (p[j].second < b) { y++; } } } if (f) { cout << s[(x - y) % 3] << endl; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.precision(8); long long t(1); while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<pair<pair<int, int>, int> > v; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; v.push_back(pair<pair<int, int>, int>(pair<int, int>(x / 2012, y), i)); } sort(v.begin(), v.end()); for (int i = 0; i < v.size(); i++) cout << v[i].second << ; } |
#include <bits/stdc++.h> using namespace std; int m[200001], k, cd; int val[2000001]; void inp() { cin >> cd >> k; for (int i = 1; i <= cd; i++) { cin >> m[i]; val[m[i]]++; } sort(m + 1, m + 1 + cd); } bool check(int i) { if (m[i] <= m[i - 1] + k && m[i] > m[i - 1]) return true; return false; } void calc() { int kq = cd; for (int i = 2; i <= cd; i++) { if (check(i)) kq -= val[m[i - 1]]; } cout << kq << endl; } int main() { inp(); calc(); } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; long long gcd(long long x, long long y) { if (y == 0) return x; else return gcd(y, x % y); } long long ksm(long long a, long long b) { long long r = 1; while (b) { if (b & 1) r = (r * a) % mod; a = a * a % mod; b >>= 1; } return r; } void exgcd(long long a, long long b, long long& d, long long& x, long long& y) { if (!b) { d = a; x = 1; y = 0; } else { exgcd(b, a % b, d, y, x); y -= x * (a / b); } } long long inv(long long a, long long p) { long long d, x, y; exgcd(a, p, d, x, y); return d == 1 ? (x + p) % p : -1; } inline int read() { char c = getchar(); int x = 0, f = 1; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x * f; } const int maxn = 1e5 + 100; int n, m, k, t, a[1005][1005]; int r[1005], c[1005]; int main() { int x, y; cin >> x >> y; for (int i = 1; i <= x; i++) cin >> r[i]; for (int i = 1; i <= y; i++) cin >> c[i]; memset(a, 0, sizeof(a)); for (int i = 1; i <= x; i++) { if (r[i] == 0) a[i][1] = -1; else { for (int j = 1; j <= r[i]; j++) a[i][j] = 1; a[i][r[i] + 1] = -1; } } int flag = 1; for (int i = 1; i <= y; i++) { if (c[i] == 0) { if (a[1][i] == 1) flag = 0; a[1][i] = -1; } else { for (int j = 1; j <= c[i]; j++) { if (a[j][i] == -1) flag = 0; a[j][i] = 1; } if (a[c[i] + 1][i] == 1) flag = 0; a[c[i] + 1][i] = -1; } } if (!flag) { cout << 0 n ; return 0; } long long ans = 1; for (int i = 1; i <= x; i++) for (int j = 1; j <= y; j++) { if (a[i][j] == 0) ans = ans * 2ll % mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)(1e9 + 7); const long long INF = (long long)(1e9 + 10); const int MAXN = (int)(2e5 + 5); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); string caso; cin >> caso; while (caso == start ) { int a = 0, b = 1; cout << ? << a << << b << endl; char aux; cin >> aux; while (aux == y ) { a = b; b = a * 2; cout << ? << a << << b << endl; cin >> aux; } int x = a, y = b; while (y - x > 1) { int med = (x + y) / 2; cout << ? << med << << b << endl; cin >> aux; if (aux == y ) y = med; else x = med; } cout << ! << y << endl; cin >> caso; } return 0; } |
#include <bits/stdc++.h> using namespace std; int t, n, freq[201][212345]; int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); vector<int> pos[201]; for (int i = 0; i < 201; ++i) for (int j = 0; j <= n; ++j) freq[i][j] = 0; for (int x, i = 1; i <= n; ++i) scanf( %d , &x), freq[x][i] = 1, pos[x].push_back(i); map<pair<int, int>, int> mp; for (int i = 1; i < 201; ++i) { int ctr = 0; for (int j = n; j > 0; --j) if (freq[i][j]) mp[{i, ++ctr}] = j; for (int j = 1; j <= n; ++j) freq[i][j] += freq[i][j - 1]; } int ans = 1; for (int i = 1; i < 201; ++i) for (int j = 1; j < 201; ++j) if (i == j) ans = max(ans, freq[i][n]); else if (freq[i][n] > 1) { for (int idx1, idx2, p = 0; p < pos[i].size(); ++p) { idx1 = pos[i][p]; idx2 = mp[{i, freq[i][idx1]}]; if (idx1 >= idx2) break; ans = max(ans, 2 * freq[i][idx1] + freq[j][idx2 - 1] - freq[j][idx1]); } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double INF = 1e100; int N, T, P[200000], L[200000], S[200000]; struct AddChange { int id; double dif; AddChange(const int i) : id(i) { if (S[i] == L[i]) dif = -INF; else dif = P[i] * ((double)(S[i] + 1) / (S[i] + 1 + L[i]) - (double)S[i] / (S[i] + L[i])); } bool operator<(const AddChange &c) const { return dif != c.dif ? dif > c.dif : id < c.id; } }; struct RevChange { int id; double dif; RevChange(const int i) : id(i) { if (S[i] == 0) dif = -INF; else dif = P[i] * ((double)(S[i] - 1) / (S[i] - 1 + L[i]) - (double)S[i] / (S[i] + L[i])); } bool operator<(const RevChange &c) const { return dif != c.dif ? dif > c.dif : id < c.id; } }; set<AddChange> AC; set<RevChange> RC; double ANS; double ExpEarn(const int id) { return P[id] * (double)S[id] / (S[id] + L[id]); } void ModifyS(const int id, const int val) { AC.erase(AddChange(id)), RC.erase(RevChange(id)), ANS -= ExpEarn(id); S[id] += val, T -= val; AC.insert(AddChange(id)), RC.insert(RevChange(id)), ANS += ExpEarn(id); } void ModifyL(const int id, const int val) { AC.erase(AddChange(id)), RC.erase(RevChange(id)), ANS -= ExpEarn(id); L[id] += val; AC.insert(AddChange(id)), RC.insert(RevChange(id)), ANS += ExpEarn(id); } int main() { for (int querycount; scanf( %d%d%d , &N, &T, &querycount) == 3;) { for (int i = 0; i < N; i++) scanf( %d , &P[i]); for (int i = 0; i < N; i++) scanf( %d , &L[i]); for (int i = 0; i < N; i++) S[i] = 0; AC.clear(), RC.clear(); for (int i = 0; i < N; i++) AC.insert(AddChange(i)), RC.insert(RevChange(i)); ANS = 0.0; while (T > 0 && AC.begin()->dif > 0.0) ModifyS(AC.begin()->id, 1); for (int t, r; querycount--;) { scanf( %d%d , &t, &r), r--; if (t == 1) ModifyL(r, 1); else if (t == 2) { if (S[r] > L[r] - 1) ModifyS(r, -1); ModifyL(r, -1); } else assert(0); for (bool changed = true; changed;) { changed = false; if (T > 0 && AC.begin()->dif > 0.0) ModifyS(AC.begin()->id, 1), changed = true; if (AC.begin()->dif + RC.begin()->dif > 0.0) { const int a = RC.begin()->id, b = AC.begin()->id; ModifyS(a, -1), ModifyS(b, 1); changed = true; } } printf( %.9f n , ANS); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int n, m, q; cin >> n >> m >> q; int grid[n][m]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) grid[i][j] = 0; vector<vector<int>> instr(q); for (int i = 0; i < q; i++) { int t; cin >> t; instr[q - 1 - i].push_back(t); int u = 1; if (t == 3) u = 3; for (int j = 0; j < u; j++) { int x; cin >> x; instr[q - 1 - i].push_back(x); } } for (int i = 0; i < q; i++) { auto cur = instr[i]; if (cur[0] == 1) { int r = cur[1] - 1; vector<int> v(m); for (int j = 0; j < m; j++) v[j] = grid[r][(j + m - 1) % m]; for (int j = 0; j < m; j++) grid[r][j] = v[j]; } else if (cur[0] == 2) { int c = cur[1] - 1; vector<int> v(n); for (int j = 0; j < n; j++) v[j] = grid[(j + n - 1) % n][c]; for (int j = 0; j < n; j++) grid[j][c] = v[j]; } else grid[cur[1] - 1][cur[2] - 1] = cur[3]; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (j) cout << ; cout << grid[i][j]; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300001; int n, a, b, c, d, start, len; vector<int> T; long long dp[2][N + 2], seg[4 * N]; void build(int p, int s, int e) { if (s == e) { seg[p] = dp[1][s]; return; } build(2 * p, s, (s + e) / 2); build(2 * p + 1, (s + e) / 2 + 1, e); seg[p] = min(seg[2 * p], seg[2 * p + 1]); } long long get(int p, int s, int e, int a, int b) { if (s >= a && e <= b) return seg[p]; if (s > b || e < a) return 1e15; return min(get(2 * p, s, (s + e) / 2, a, b), get(2 * p + 1, (s + e) / 2 + 1, e, a, b)); } int main() { scanf( %d%d%d%d%d%d%d , &n, &a, &b, &c, &d, &start, &len); dp[0][0] = start; dp[1][0] = start; T.push_back(0); for (int i = 1, t, q; i <= n; i++) { scanf( %d%d , &t, &q); dp[0][i] = dp[0][i - 1], dp[1][i] = dp[1][i - 1]; if (q) dp[0][i] += a, dp[1][i] += c; else dp[0][i] -= b, dp[1][i] -= d; T.push_back(t); } build(1, 0, n); int j = n, c = 0; auto it = lower_bound(T.begin(), T.end(), c + len); if (it != T.end()) j = *it - 1; if (get(1, 0, n, 0, j) >= 0) { printf( %d n , c); return 0; } for (int i = 0; i < T.size(); i++) { if (dp[0][i] < 0) break; c = T[i] + 1; j = lower_bound(T.begin(), T.end(), c + len) - T.begin() - 1; if (i == n || j < i + 1 || get(1, 0, n, i + 1, j) - dp[1][i] + dp[0][i] >= 0) { printf( %d n , c); return 0; } } puts( -1 ); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.