func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; double eps = 1e-7; int n, m, A, B, a[6010]; int cmp(double x) { if (x > eps) return 1; if (x < -eps) return -1; return 0; } struct line { double k, b; line(double _k, double _b) { k = _k, b = _b; } line(double __x) { k = 2, b = -2 * __x; } friend line operator+(const line& u, const line& v) { return line(u.k + v.k, u.b + v.b); } void operator+=(const line& v) { k += v.k, b += v.b; } void shift(double x) { b -= k * x; } double f(double x) { return k * x + b; } double rt() { return -b / k; } }; vector<line> v; vector<double> u; void SHIFT() { int tur = -1; for (int i = 0; i < v.size(); i++) if (cmp(v[i].f(u[i + 1])) != -1 && cmp(v[i].f(u[i])) != 1) tur = i; if (tur == -1) { if (cmp(v[0].f(u[0])) == 1) tur = -1; if (cmp(v.back().f(u.back())) == -1) tur = v.size(); } for (int i = 0; i < v.size(); i++) { double x = v[i].rt(); if (tur == -1 && i == 0) { x = u[0], tur++; u[i] += A, u[i + 1] += B; v.insert(v.begin() + i, line(0, 0)); u.insert(u.begin() + i + 1, x + B); v[i + 1].shift(B); i += 1; continue; } if (tur == v.size() && i == v.size() - 1) { x = u.back(), tur--; u[i] += A, u[i + 1] += B; u.insert(u.begin() + i, x + A); v.insert(v.begin() + i, line(0, 0)); v[i].shift(A); i += 1; continue; } if (i < tur) u[i] += A, v[i].shift(A); else if (i > tur) u[i + 1] += B, v[i].shift(B); else { u[i] += A, u[i + 1] += B; u.insert(u.begin() + i + 1, x + A); u.insert(u.begin() + i + 2, x + B); v.insert(v.begin() + i + 1, line(0, 0)); v.insert(v.begin() + i + 2, v[i]); v[i].shift(A); v[i + 2].shift(B); i += 2; } } int i = 0; while (i < u.size() && cmp(u[u.size() - i - 1] - m) == 1) i++; u[u.size() - i] = m; u.erase(u.end() - i + 1, u.end()), v.erase(v.end() - i + 1, v.end()); } void ADD(line p) { for (auto& i : v) i += p; } double pos() { if (cmp(v[0].f(u[0])) == 1) return u[0]; if (cmp(v.back().f(u.back())) == -1) return u.back(); for (int i = 0; i < v.size(); i++) if (cmp(v[i].f(u[i + 1])) != -1 && cmp(v[i].f(u[i])) != 1) return v[i].rt(); for (int i = 1; i + 1 < u.size(); i++) if (cmp(v[i - 1].f(u[i])) == -1 && cmp(v[i].f(u[i])) == 1) return u[i]; } double b[6010], res; int main() { scanf( %d%d%d%d , &n, &m, &A, &B); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); v.emplace_back(a[1]); u.push_back(1), u.push_back(m); for (int i = 2; i <= n; i++) b[i - 1] = pos(), SHIFT(), ADD(line(a[i])); b[n] = pos(); for (int i = n; i >= 2; i--) { if (cmp(max(b[i] - B, 1.0) - b[i - 1]) == 1) b[i - 1] = max(b[i] - B, 1.0); else if (cmp(b[i - 1] - max(b[i] - A, 1.0)) == 1) b[i - 1] = max(b[i] - A, 1.0); } for (int i = 1; i <= n; i++) printf( %lf , b[i]), res += (b[i] - a[i]) * (b[i] - a[i]); puts( ); printf( %lf n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N(1e5 + 5), M(1e5 + 5); struct edge { int u, v, nt, type, flag; } E[M << 1]; int head[N]; int d[N]; queue<int> que; void bfs(int s, int *d) { memset(d, -1, sizeof(int[N])); que.push(s), d[s] = 0; while (!que.empty()) { int u = que.front(); que.pop(); for (int i = head[u]; ~i; i = E[i].nt) { int &v = E[i].v; if (~d[v]) continue; d[v] = d[u] + 1, que.push(v); } } } int ans; void find_path(int u, int t, int cnt) { if (u == t) { ans = min(ans, cnt); return; } for (int i = head[u]; ~i; i = E[i].nt) { int &v = E[i].v; if (d[v] != d[u] + 1) continue; find_path(v, t, cnt + !E[i].type); } } bool label_path(int u, int t, int cnt) { if (u == t) return ans == cnt; for (int i = head[u]; ~i; i = E[i].nt) { int &v = E[i].v; if (d[v] != d[u] + 1) continue; if (label_path(v, t, cnt + !E[i].type)) { E[i].flag = E[i ^ 1].flag = 1; return true; } } return false; } int main() { int n, m, good = 0; scanf( %d%d , &n, &m); memset(head, -1, sizeof(head)); for (int u, v, type, id = 0, _ = m; _--;) { scanf( %d%d%d , &u, &v, &type); E[id] = {u, v, head[u], type, 0}, head[u] = id++; E[id] = {v, u, head[v], type, 0}, head[v] = id++; good += type; } bfs(1, d); ans = INT_MAX; find_path(1, n, 0); label_path(1, n, 0); printf( %d n , 2 * ans + good - d[n]); for (int i = 0; i < 2 * m; i += 2) { if (E[i].type ^ E[i].flag) printf( %d %d %d n , E[i].u, E[i].v, !E[i].type); } }
|
#include <bits/stdc++.h> using namespace std; char s1[200100], s2[200100]; vector<int> pos[26]; long long sum1[27][200100]; long long sum2[27][200100]; int main() { int n; scanf( %d , &n); long long res2 = 0; for (int i = (1); i < (n + 1); ++i) res2 += (n - i + 1) * 1ll * (n - i + 1); scanf( %s%s , &s1, &s2); for (int i = (0); i < (n); ++i) pos[s2[i] - A ].push_back(i); for (int i = (0); i < (26); ++i) { for (int j = (0); j < (pos[i].size()); ++j) { sum1[i][j] += pos[i][j] + 1; if (j) sum1[i][j] += sum1[i][j - 1]; } for (int j = (int)pos[i].size() - 1; j >= 0; --j) { sum2[i][j] += n - pos[i][j]; if (j != (int)pos[i].size() - 1) sum2[i][j] += sum2[i][j + 1]; } } double res1 = 0; for (int i = (0); i < (n); ++i) { int v = s1[i] - A ; int l = 0; int r = (int)pos[v].size() - 1; int best = -1; while (l <= r) { int m = (l + r) / 2; if (pos[v][m] <= i) { best = m; l = m + 1; } else r = m - 1; } if (best != -1) res1 += (sum1[v][best]) * 1ll * (n - i); if (res1 < 0) cout << FAIL << endl; best++; if (best != pos[v].size()) res1 += (sum2[v][best]) * 1ll * (i + 1); if (res1 < 0) cout << FAIL << endl; } double res = res1 / (double)res2; printf( %.15lf n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, i, j; pair<pair<int, int>, int> a[100002]; bool lav(int i) { int x1, u1, x2, u2, x3, u3; x1 = a[i].first.first; u1 = a[i].first.second; x2 = a[i + 1].first.first; u2 = a[i + 1].first.second; x3 = a[i + 2].first.first; u3 = a[i + 2].first.second; long long dx1, dx2, du1, du2; dx1 = x2 - x1; du1 = u2 - u1; dx2 = x3 - x2; du2 = u3 - u2; if ((dx1 == 0 && dx2 == 0) || (du1 == 0 && du2 == 0) || dx1 * du2 == dx2 * du1) return false; return true; } int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d%d , &a[i].first.first, &a[i].first.second); a[i].second = i; } sort(a + 1, a + 1 + n); int x = a[1].second, u = a[2].second, p = a[3].second; for (i = 1; i <= n; i++) { if (lav(i)) { x = a[i].second; u = a[i + 1].second; p = a[i + 2].second; break; } } if (x > u) swap(x, u); if (x > p) swap(x, p); if (u > p) swap(u, p); cout << x << << u << << p << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void print1d(vector<T> &a) { for (long long int i = 0; i < a.size(); i++) { cout << a[i] << ; } cout << endl; } vector<long long int> divisor(long long int n) { vector<long long int> a; for (long long int i = 1; i * i <= n; i++) { if (n % i == 0) { if (n / i == i) a.push_back(i); else { a.push_back(i); a.push_back(n / i); } } } return a; } bool sortsecond(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { return a.second < b.second; } bool isPrime(long long int n) { for (long long int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } vector<string> split_string(const string &s, const string &delimiter) { vector<string> token; string ans; size_t end_point, start_point = 0, delim_length = delimiter.length(); while ((end_point = s.find(delimiter, start_point)) != string::npos) { ans = s.substr(start_point, end_point - start_point); start_point = end_point + delim_length; token.push_back(ans); } token.push_back(s.substr(start_point)); return token; } bool is_vowel(const char &a) { switch (a) { case a : case e : case i : case o : case u : case y : case A : case E : case I : case O : case U : return true; break; default: return false; break; } } void solve() { string delimiter = , ; string s; cin >> s; vector<string> e = split_string(s, delimiter); vector<long long int> a(e.size(), 0); for (long long int i = 0; i < e.size(); i++) { a[i] = stoi(e[i]); } sort(a.begin(), a.end()); auto it = std::unique(a.begin(), a.end()); a.resize(std::distance(a.begin(), it)); long long int c = a[0], k = a[0] + 1; for (long long int i = 1; i < a.size(); i++) { if (a[i] == k) k++; else { if (c + 1 == k) cout << c << , ; else cout << c << - << k - 1 << , ; c = a[i]; k = a[i] + 1; } } if (c + 1 == k) cout << c << endl; else cout << c << - << k - 1 << endl; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); ; solve(); return 0; }
|
#include <bits/stdc++.h> const int N = 1010; int sit[N], a[N]; int n, m, c; void ask(int x, int pos) { printf( %d n , pos); a[pos] = x; fflush(stdout); bool flag = true; for (int i = 1; i <= n; ++i) { if (!a[i]) { flag = false; break; } } for (int i = 1; i < n; ++i) { if (a[i] > a[i + 1]) { flag = false; break; } } if (flag) { exit(0); } if (x <= (c + 1) >> 1) { for (int i = x; i <= (c + 1) >> 1; ++i) { sit[i] = std::max(sit[i], pos + 1); } } else { for (int i = x; i > (c + 1) >> 1; --i) { sit[i] = std::min(sit[i], pos - 1); } } } int main() { scanf( %d%d%d , &n, &m, &c); for (int i = 1; i <= (c + 1) >> 1; ++i) { sit[i] = 1; } for (int i = c; i > (c + 1) >> 1; --i) { sit[i] = n; } while (true) { int x; scanf( %d , &x); ask(x, sit[x]); } }
|
#include <bits/stdc++.h> inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } inline void sub(long long &a, long long b) { a -= b; if (a < 0) a += 1000000007; } inline void add(long long &a, long long b) { a += b; if (a >= 1000000007) a -= 1000000007; } template <typename T> inline T const &MAX(T const &a, T const &b) { return a > b ? a : b; } template <typename T> inline T const &MIN(T const &a, T const &b) { return a < b ? a : b; } inline long long qp(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % 1000000007; a = a * a % 1000000007, b >>= 1; } return ans; } inline long long qp(long long a, long long b, long long c) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % c; a = a * a % c, b >>= 1; } return ans; } using namespace std; const unsigned long long ba = 233; const double eps = 1e-5; const long long INF = 0x3f3f3f3f3f3f3f3f; const int N = 300000 + 10, maxn = 2000000 + 10, inf = 0x3f3f3f3f; map<long long, int> ma; int main() { int n, k, p; scanf( %d%d%d , &n, &p, &k); long long ans = 0; for (int i = 1; i <= n; i++) { long long x; scanf( %lld , &x); long long y = x * x % p * x % p * x % p; y -= k * x % p; if (y < 0) y += p; ans += ma[y]; ma[y]++; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int x, y, z; cin >> x >> y >> z; cout << (x + y) / z << ; if (x / z + y / z < (x + y) / z) { cout << min(z - (x % z), z - (y % z)); } else { cout << 0 ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long t, n, m, s, a, b, w, c; cin >> t; while (t--) { cin >> n >> s; vector<vector<pair<long long, pair<long long, long long>>>> ady(n + 1); for (int i = 1; i < n; ++i) { cin >> a >> b >> w >> c; ady[a].push_back({b, {w, c}}); ady[b].push_back({a, {w, c}}); } int id = 0; long long sum = 0; vector<long long> cost(n + 1), sons(n + 1), color(n + 1); vector<bool> visited(n + 1); priority_queue<pair<long long, long long>> q; auto val = [&](long long c, long long v) { return v * c; }; auto par = [&](long long idx) { return pair<long long, long long>( val(sons[idx], cost[idx]) - val(sons[idx], cost[idx] / 2), idx); }; function<void(long long)> dfs = [&](long long v) { visited[v] = true; long long hojas = (ady[v].size() == 1 && v != 1); for (auto &x : ady[v]) { if (!visited[x.first]) { dfs(x.first); cost[id] = x.second.first; color[id] = x.second.second - 1; hojas += sons[id]; sum += val(sons[id], cost[id]); q.push(par(id)); ++id; } } sons[id] = hojas; }; dfs(1); vector<vector<long long>> values(2); while (q.top().first != 0) { auto x = q.top(); q.pop(); values[color[x.second]].push_back(x.first); cost[x.second] = cost[x.second] / 2; q.push(par(x.second)); } partial_sum(values[0].begin(), values[0].end(), values[0].begin()); partial_sum(values[1].begin(), values[1].end(), values[1].begin()); long long oo = (values[1].size() + values[0].size()) * 2ll; auto find = [&](long long val) { int idx = lower_bound(values[1].begin(), values[1].end(), val) - values[1].begin(); if (idx == values[1].size()) return oo; return (idx + 1) * 2ll; }; long long best = find(sum - s) * (sum > s); for (int i = 0; i < values[0].size(); ++i) { long long temp = (i + 1); long long d = sum - values[0][i]; if (d > s) temp += find(d - s); best = min(best, temp); } cout << best << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; double e[1010][510]; double c[510], b[510]; int main() { int n, m, in, im; scanf( %d%d%d%d , &n, &m, &in, &im); if (m == 1) { e[n][1] = 0.0; for (int i = n - 1; i >= in; --i) { e[i][1] = 2 + e[i + 1][1]; } printf( %.9lf n , e[in][1]); return 0; } if (im > m / 2) im = m + 1 - im; int g = (m + 1) / 2; for (int i = 1; i <= g; ++i) e[n][i] = 0.0; for (int r = n - 1; r >= in; --r) { c[1] = 1.5 + e[r + 1][1] * 0.5; b[1] = 0.5; for (int i = 2; i <= g; ++i) { double w = 1.0 - 0.25 - b[i - 1] * 0.25; c[i] = (1.0 + 0.25 * e[r + 1][i] + 0.25 * c[i - 1]) / w; b[i] = (0.25) / w; } if (m % 2 == 0) { e[r][g] = c[g] / (1.0 - b[g]); } else { e[r][g] = (c[g] + b[g] * c[g - 1]) / (1.0 - b[g] * b[g - 1]); } for (int i = g - 1; i >= 1; --i) e[r][i] = c[i] + b[i] * e[r][i + 1]; } printf( %.9lf n , e[in][im]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 105; const int mod = 1e9 + 7; long long n, m, x; long long dp[2][320][320][2]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); if (fopen( A.inp , r )) { freopen( test.inp , r , stdin); freopen( test.out , w , stdout); } cin >> n >> m >> x; if (n > m) return cout << 0, 0; dp[0][0][0][0] = 1; for (int i = 1; i <= m; i++) { for (int j = 0; j <= min(1ll * i, n); j++) { for (int k = 0; k <= j; k++) { if (i == x) { if (j > 0) dp[i & 1][j][k][1] = (dp[i & 1][j][k][1] + dp[(i + 1) & 1][j - 1][k][0]) % mod; if (j > 0 && k > 0) dp[i & 1][j][k][1] = (dp[i & 1][j][k][1] + dp[(i + 1) & 1][j - 1][k - 1][0]) % mod; } else { if (j > 0) dp[i & 1][j][k][i > x] = (dp[i & 1][j][k][i > x] + dp[(i + 1) & 1][j - 1][k][i > x]) % mod; if (j > 0 && k > 0) dp[i & 1][j][k][i > x] = (dp[i & 1][j][k][i > x] + dp[(i + 1) & 1][j - 1][k - 1][i > x]) % mod; dp[i & 1][j][k][i > x] = (dp[i & 1][j][k][i > x] + dp[(i + 1) & 1][j][k][i > x]) % mod; if (k > 0) dp[i & 1][j][k][i > x] = (dp[i & 1][j][k][i > x] + dp[(i + 1) & 1][j][k - 1][i > x]) % mod; } } } for (int j = 0; j <= min(1ll * i, n); j++) { for (int k = 0; k <= j; k++) { dp[(i + 1) & 1][j][k][0] = 0; dp[(i + 1) & 1][j][k][1] = 0; } } } long long res = dp[m & 1][n][n][1]; for (int i = 1; i <= n; i++) { res = res * i % mod; } cout << res; }
|
#include <bits/stdc++.h> using namespace std; typedef long double real; string Pair[26][26]; int cost[26][26][501], dp[26][26][501]; pair<int, int> parent[26][26][501]; int n, m; char flag[501][501]; pair<int, pair<int, int> > buffer[26 * 26]; bool used[26][26]; int main() { ios_base::sync_with_stdio(false); string s; for (char c1 = a ; c1 < z + 1; ++c1) { for (char c2 = a ; c2 < z + 1; ++c2) { s = ; s += c1; s += c2; Pair[c1 - a ][c2 - a ] = s; } } cin >> n >> m; cin.get(); for (int i = 0; i < n; ++i) { cin.read(flag[i], m + 1); flag[i][m] = 0 ; } for (int i = 0; i < n; ++i) { for (int c1 = 0; c1 < 26; ++c1) { for (int c2 = 0; c2 < 26; ++c2) { cost[c1][c2][i] = m; } } for (int j = 0; j < m; ++j) { int c0 = flag[i][j] - a ; for (int c = 0; c < 26; ++c) { if (j % 2 == 0) { --cost[c0][c][i]; } else { --cost[c][c0][i]; } } } } for (int c1 = 0; c1 < 26; ++c1) { for (int c2 = 0; c2 < 26; ++c2) { dp[c1][c2][0] = cost[c1][c2][0]; } } for (int i = 1; i < n; ++i) { int ptr = 0; int cnt = 0; for (int c1 = 0; c1 < 26; ++c1) { for (int c2 = 0; c2 < 26; ++c2) { if (c1 == c2) { continue; } ++cnt; buffer[ptr++] = make_pair((dp[c1][c2][i - 1]), (make_pair((c1), (c2)))); used[c1][c2] = false; } } sort(buffer, buffer + cnt); ptr = 0; while (cnt) { for (int c1 = 0; c1 < 26; ++c1) { for (int c2 = 0; c2 < 26; ++c2) { pair<int, int> p = buffer[ptr].second; if (c1 == c2 || used[c1][c2] || p.first == c1 || p.second == c2) { continue; } dp[c1][c2][i] = dp[p.first][p.second][i - 1] + cost[c1][c2][i]; parent[c1][c2][i] = p; used[c1][c2] = true; --cnt; } } ++ptr; } } pair<int, int> p(0, 1); for (int c1 = 0; c1 < 26; ++c1) { for (int c2 = 0; c2 < 26; ++c2) { if (c1 == c2) { continue; } if (dp[c1][c2][n - 1] < dp[p.first][p.second][n - 1]) { p = make_pair((c1), (c2)); } } } cout << dp[p.first][p.second][n - 1] << n ; vector<pair<int, int> > ans; ans.reserve(n); int row = n - 1; while (row != -1) { ans.push_back(p); p = parent[p.first][p.second][row]; --row; } reverse((ans).begin(), (ans).end()); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { flag[i][j] = Pair[ans[i].first][ans[i].second][j % 2]; } cout << flag[i] << n ; } }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long a[300010], cnt[300010]; long long n, k, maxx; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; ++i) { cin >> a[i]; maxx = max(maxx, a[i]); } int pos = 1, cnt = 0; while (a[pos] != maxx) { for (int i = pos + 1; i <= n; ++i) { if (a[pos] > a[i]) { cnt++; if (cnt >= k) { cout << a[pos]; return 0; } } else { cnt = 1; pos = i; break; } } } cout << maxx; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; bool t = false; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) t = true, ch = getchar(); while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 48, ch = getchar(); return t ? -x : x; } int s[1010000], a[1010000], b[1010000], n, k; char ch[1010000]; bool vis[1010000]; int eql[1010000]; void output() { for (int i = 1; i <= k; ++i) if (!eql[i]) for (int j = 1; j <= k; ++j) if (!vis[j]) { eql[i] = j; vis[j] = true; break; } for (int i = 1; i <= k; ++i) putchar(eql[i] + 96); puts( ); } void clear() { for (int i = 1; i <= k; ++i) eql[i] = 0, vis[i] = false; } int main() { int T = read(); while (T--) { k = read(); scanf( %s , ch + 1); n = strlen(ch + 1); for (int i = 1; i <= n; ++i) s[i] = ch[i] - 96; scanf( %s , ch + 1); for (int i = 1; i <= n; ++i) a[i] = ch[i] - 96 - (i == n); scanf( %s , ch + 1); for (int i = 1; i <= n; ++i) b[i] = ch[i] - 96; clear(); int p = -1; for (int i = 1; i <= n; ++i) { if (i > 1) { if (eql[s[i - 1]] && eql[s[i - 1]] != a[i - 1]) break; if (!eql[s[i - 1]] && vis[a[i - 1]]) break; eql[s[i - 1]] = a[i - 1]; vis[a[i - 1]] = true; } if (eql[s[i]]) if (eql[s[i]] > a[i]) p = i; if (!eql[s[i]]) for (int j = a[i] + 1; j <= k; ++j) if (!vis[j]) { p = i; break; } } if (p == -1) puts( NO ); else { clear(); for (int i = 1; i < p; ++i) eql[s[i]] = a[i], vis[a[i]] = true; if (!eql[s[p]]) for (int i = a[p] + 1; i <= k; ++i) if (!vis[i]) { eql[s[p]] = i, vis[i] = true; break; } for (int i = p + 1; i <= n; ++i) if (!eql[s[i]]) for (int j = 1; j <= k; ++j) if (!vis[j]) { eql[s[i]] = j; vis[j] = true; break; } for (int i = 1; i <= n; ++i) s[i] = eql[s[i]]; bool chk = true; for (int i = 1; i <= n; ++i) if (s[i] > b[i]) { puts( NO ); chk = false; break; } else if (s[i] < b[i]) { puts( YES ); output(); chk = false; break; } if (chk) puts( YES ), output(); } } }
|
#include <bits/stdc++.h> using namespace std; int n; pair<int, int> a[1000]; double findarea(pair<int, int> a, pair<int, int> b, pair<int, int> c) { return ((double)a.first * (b.second - c.second) + (double)b.first * (c.second - a.second) + (double)c.first * (a.second - b.second)) / 2.0; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d %d , &a[i].first, &a[i].second); double ans = 0; for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) { double maxright = -1, maxleft = -1; for (int k = 0; k < n; k++) { if (k != i && k != j) { double area = findarea(a[i], a[j], a[k]); if (area < 0) maxleft = max(maxleft, -area); else maxright = max(maxright, area); } } if (maxright >= 0 && maxleft >= 0) ans = max(ans, maxleft + maxright); } printf( %.6lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 100000 + 5; const long long inf = 9e17; long long ans = inf, l, r, mid1, mid2; vector<long long> g[maxn], v; long long n, m; inline long long cost(long long mid) { long long cnt = mid - g[0].size(), tmp = 0; v.clear(); for (int i = 1; i <= m; i++) { for (int j = 0; j < g[i].size(); j++) { if (g[i].size() - j >= mid) { --cnt; tmp += g[i][j]; } else v.push_back(g[i][j]); } } sort(v.begin(), v.end()); for (int i = 0; i < cnt; i++) tmp += v[i]; return tmp; } int main() { long long a, b; cin >> n; for (int i = 0; i < n; i++) { cin >> a >> b; m = max(m, a); g[a].push_back(b); } for (int i = 0; i <= m; i++) sort(g[i].begin(), g[i].end()); l = g[0].size(), r = n; while (l < r) { mid1 = (l + l + r) / 3; mid2 = (l + r + r) / 3; if (cost(mid1) > cost(mid2)) { if (l == mid1) break; else l = mid1; } else { if (r == mid2) break; else r = mid2; } } ans = inf; for (int i = l; i <= r; i++) ans = min(ans, cost(i)); cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; string s, a, b, c; long long f[120001], n, i, q, x, y, l, r, nom; bool abcde; int main() { ios::sync_with_stdio(0); cin.tie(0); s = What are you doing at the end of the world? Are you busy? Will you save us? ; a = What are you doing while sending ; b = ? Are you busy? Will you send ; c = ? ; f[0] = s.size(); for (i = 1; i <= 100000; i++) { f[i] = f[i - 1] * 2 + a.size() + b.size() + c.size(); if (f[i - 1] > 1000000000000000000LL) break; } cin >> q; while (q--) { cin >> x >> y; l = 1; r = 9000000000000000000LL; if (f[x] != 0) r = f[x]; if (f[x] != 0 && y > f[x]) { cout << . ; continue; } abcde = false; for (i = x - 1; i >= 0; i--) { if (l <= y && y <= l + a.size() - 1) { abcde = true; cout << a[y - l]; break; } if (f[i] == 0) { l += a.size(); if (f[i - 1] != 0) r = l + f[i - 1] * 2 + a.size() + b.size() + c.size() - 1; continue; } if (l + a.size() + f[i] <= y && y <= r - c.size() - f[i]) { abcde = true; cout << b[y - (l + a.size() + f[i])]; break; } if (r - c.size() + 1 <= y && y <= r) { abcde = true; cout << c[y - (r - c.size() + 1)]; break; } if (l + a.size() <= y && y <= r - c.size() - f[i] - b.size()) { l += a.size(); r -= c.size() + f[i] + b.size(); } else { l += a.size() + f[i] + b.size(); r -= c.size(); } } if (!abcde) cout << s[y - l]; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 7; int sg[N]; int main() { int T, n, k; scanf( %d , &T); while (T--) { scanf( %d %d , &n, &k); bool flag = true; if (k % 3 == 0) { int t = (k / 3 - 1) * 3 + 4; int s = n % t; if (s == t - 4) flag = false; else if (s < t - 4 && s % 3 == 0) flag = false; } else { if (n % 3 == 0) flag = false; } if (flag) printf( Alice n ); else printf( Bob n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int x) : val(x), left(NULL), right(NULL) {} }; struct ListNode { int val; ListNode* next; ListNode(int x) : val(x), next(NULL) {} }; int nxt() { int x; cin >> x; return x; } long long nxtLong() { long long x; cin >> x; return x; } string nxtStr() { string x; cin >> x; return x; } char nxtChar() { char x; cin >> x; return x; } double nxtDouble() { double x; cin >> x; return x; } long double nxtLDouble() { long double x; cin >> x; return x; } TreeNode* makeTree(int n) { queue<TreeNode*> tree_nodes; TreeNode* root; if (n) { root = new TreeNode(nxt()); tree_nodes.push(root); } else { return NULL; } while (!tree_nodes.empty()) { TreeNode* node = tree_nodes.front(); tree_nodes.pop(); bool left; cin >> left; if (left) { node->left = new TreeNode(nxt()); tree_nodes.push(node->left); } bool right; cin >> right; if (right) { node->right = new TreeNode(nxt()); tree_nodes.push(node->right); } } return root; } ListNode* makeLinkedList(int n) { ListNode* list = new ListNode(0); ListNode* dummy = list; for (int i = 0; i < n; ++i) { list->next = new ListNode(nxt()); list = list->next; } return dummy->next; } char ans[2000001]; void solve() { int n = nxt(); int len = 0; while (n--) { string s = nxtStr(); int m = nxt(); int l = s.length(); int y = 0; while (m--) { int x = nxt(); x--; len = max(len, x + l); for (int i = max(x, y); i < x + l; ++i) { ans[i] = s[i - x]; } y = x + l; } } for (int i = 0; i < len; ++i) { if (!ans[i]) { cout << a ; } else { cout << ans[i]; } } cout << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(9); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; class Solver { public: void solve() { cin >> n; long long sign = 1; long long C = n; long long three_to_i = 1; for (long long i = 1; i <= n; i++) { long long term = 2LL * (sign < 0 ? sign + mod : sign) * C; term %= mod; term *= powmod(3, n * n - n * i + i); term %= mod; ans += term; ans %= mod; sign = -sign; C = next_C(n, i + 1LL, C); } C = 1; sign = -1; for (long long i = 0; i < n; i++) { long long term = C; term *= 3 * (sign < 0 ? sign + mod : sign); term %= mod; term *= calc_term(i, three_to_i); term %= mod; ans += term; ans %= mod; three_to_i *= 3LL; three_to_i %= mod; C = next_C(n, i + 1LL, C); sign = -sign; } cout << ans << endl; } long long calc_term(long long i, long long three_to_i) { long long k1 = 1 - three_to_i; if (k1 < 0) k1 += mod; long long ans = powmod(k1, n); long long a2 = powmod(mod - three_to_i, n); ans = ans - a2; if (ans < 0) ans += mod; return ans; } long long powmod(long long x, long long n) { n %= (mod - 1LL); long long base = x; long long ans = 1; while (n) { if (1LL & n) { ans *= base; ans %= mod; } base *= base; base %= mod; n >>= 1; } return ans; } long long next_C(long long n, long long k, long long cnk_1) { if (k == 0 || k == n) return 1LL; cnk_1 *= n - k + 1LL; cnk_1 %= mod; cnk_1 *= powmod(k, mod - 2); return cnk_1 % mod; } long long mod = 998244353; long long n; long long ans = 0; }; int main() { Solver sol; sol.solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 300000 + 10; const int mod = 1e9 + 7; int n, q; char s[N]; long long sum[N]; long long pw[N], fibo[N], pw2[N], pw3[N]; int main() { scanf( %d%d , &n, &q); scanf( %s , s + 1); for (int i = 1; i <= n; ++i) { sum[i] = sum[i - 1] + (s[i] == 1 ); } for (int i = 1; i <= 2e5; ++i) { if (i == 1) fibo[i] = 1; else fibo[i] = fibo[i - 1] * 2; fibo[i] %= mod; pw[i] = pw[i - 1] + fibo[i]; pw[i] %= mod; } while (q--) { int l, r; scanf( %d%d , &l, &r); long long num1 = sum[r] - sum[l - 1]; long long num0 = (r - l + 1) - num1; long long ans = pw[num1]; ans %= mod; if (num0) ans += pw[num1] * pw[num0] % mod; ans %= mod; printf( %lld n , ans); } }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long int INF = 1e12; long long int mod(long long int a) { if (a >= 0) return a; else return (-1 * a); } void swap(long long int a, long long int b) { long long int temp = a; a = b; b = temp; } long long int power(long long int a, long long int b) { long long int result = 1; while (b) { if (b % 2) result = (result % MOD) * (a % MOD); a = ((a % MOD) * (a % MOD)) % MOD; b = b / 2; } return result; } bool power_check(long long int a) { bool ans = true; while (a > 1) { if (a % 2 == 0) { a = a / 2; } else { ans = false; break; } } return ans; } void solve() { int n; cin >> n; string s; cin >> s; int c = 0; for (int i = 0; i < n; ++i) { if (s[i] == 0 ) c++; } if (c != n - c) { cout << 1 << n ; cout << s << n ; return; } cout << 2 << n ; cout << s[0] << ; for (int i = 1; i < n; ++i) { cout << s[i]; } cout << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int qqq; qqq = 1; while (qqq--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int> > data; vector<vector<int> > sticks; vector<int> h; int dfs(int vertex, int last) { int longest = 0; for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (to == last) continue; int len = dfs(to, vertex) + 1; sticks[vertex].push_back(len); longest = max(longest, len); } h[vertex] = longest; return longest; } void dfs2(int vertex, int last, int fup) { if (vertex != 0) { sticks[vertex].push_back(fup); } fup++; int mx1 = -100, mx2 = -100; for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (to == last) continue; if (h[to] + 1 > mx1) { mx2 = mx1; mx1 = h[to] + 1; } else mx2 = max(mx2, h[to] + 1); } for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (to == last) continue; if (h[to] + 1 != mx1) { dfs2(to, vertex, max(fup, mx1 + 1)); } else dfs2(to, vertex, max(fup, mx2 + 1)); } } int dfslong, dfslen; void dfs3(int vertex, int last, int d) { if (d > dfslen) { dfslen = d, dfslong = vertex; } for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (to == last) continue; dfs3(to, vertex, d + 1); } } int find_diameter() { dfslong = 0, dfslen = 0; dfs3(0, -1, 0); int Q = dfslong; dfs3(dfslong, -1, 0); return dfslen; } vector<bool> deleted; void dlt(int first) { deleted[first] = true; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; data.assign(n, {}); sticks.assign(n, {}); h.assign(n, {}); deleted.assign(n, false); vector<pair<int, int> > edges; for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; if (u > v) swap(u, v); u--, v--; data[u].push_back(v), data[v].push_back(u); edges.push_back({u, v}); } dfs(0, -1); dfs2(0, -1, 0); for (int i = 0; i < n; ++i) { sort(sticks[i].begin(), sticks[i].end(), greater<int>()); } vector<pair<int, int> > kek; for (int i = 0; i < n; ++i) { for (int j = 0; j < sticks[i].size(); ++j) { kek.push_back({sticks[i][j], i}); } } sort(kek.begin(), kek.end()); int d = find_diameter(); for (int i = 0; i < n; ++i) { if (data[i].size() <= 2) dlt(i); } set<pair<int, int> > W; for (int i = 0; i < n; ++i) { W.insert({-sticks[i].size(), i}); } auto thtol = W.begin(); cout << -(*thtol).first + 1 << ; int u = 0; vector<int> stake; for (int k = 2; k <= n; ++k) { if (k > d) { cout << 1 << ; continue; } if (k % 2 == 0) { while (u < kek.size() && kek[u].first < k / 2) { stake.push_back(kek[u++].second); } for (int i = 0; i < stake.size(); ++i) { int T = stake[i]; W.erase(W.find({-sticks[T].size(), T})); while (sticks[T].size() && sticks[T].back() < k / 2) sticks[T].pop_back(); if (sticks[T].size() <= 2) dlt(T); W.insert({-sticks[T].size(), T}); } auto aaa = W.begin(); int tut = max(2, -(*aaa).first); int st = 0; while (st < edges.size()) { int A = edges[st].first, B = edges[st].second; if (deleted[A] || deleted[B]) { swap(edges[st], edges.back()); edges.pop_back(); continue; } tut = max(tut, (int)(sticks[A].size() + sticks[B].size() - 2)); st++; } cout << tut << ; stake.clear(); } else { while (u < kek.size() && kek[u].first < (k + 1) / 2) { stake.push_back(kek[u++].second); } for (int i = 0; i < stake.size(); ++i) { int T = stake[i]; W.erase(W.find({-sticks[T].size(), T})); while (sticks[T].size() > 1 && sticks[T][sticks[T].size() - 2] < (k + 1) / 2) sticks[T].pop_back(); if (sticks[T].size() <= 2) dlt(T); W.insert({-sticks[T].size(), T}); } auto aaa = W.begin(); int tut = max(2, -(*aaa).first); cout << tut << ; } } }
|
#include <bits/stdc++.h> const int MAXN = 3e5 + 10; const double eps = 1e-8; using namespace std; struct edge { int t, v; edge *next; } e[MAXN << 1], *h[MAXN], *o = e; void add(int x, int y, int vul) { o->t = y; o->v = vul; o->next = h[x]; h[x] = o++; } long long read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * f; } int n, m, q; int dirx[] = {-1, 1, 0, 0}; int diry[] = {0, 0, -1, 1}; int del[2000005], pos[2000006]; int a[305][305]; vector<pair<int, int> > q1[2000006], q2[2000005]; int f[MAXN]; int find1(int x) { if (x == f[x]) return x; else return f[x] = find1(f[x]); } void cal_add(int x) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) a[i][j] = 0, f[(i - 1) * m + j] = (i - 1) * m + j; for (int i = 0; i < q1[x].size(); i++) { int x1 = (q1[x][i].first - 1) / m + 1; int x2 = q1[x][i].first - (x1 - 1) * m; a[x1][x2] = 1; int num = 1; for (int j = 0; j < 4; j++) { int xx = x1 + dirx[j]; int yy = x2 + diry[j]; if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && a[xx][yy] == 1) { int y = (xx - 1) * m + yy; int t1 = find1(q1[x][i].first); int t2 = find1(y); if (t1 == t2) continue; f[t1] = t2; num--; } } del[q1[x][i].second] += num; } } void cal_del(int x) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) a[i][j] = 0, f[(i - 1) * m + j] = (i - 1) * m + j; for (int i = 0; i < q2[x].size(); i++) { int x1 = (q2[x][i].first - 1) / m + 1; int x2 = q2[x][i].first - (x1 - 1) * m; a[x1][x2] = 1; int num = 1; for (int j = 0; j < 4; j++) { int xx = x1 + dirx[j]; int yy = x2 + diry[j]; if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && a[xx][yy] == 1) { int y = (xx - 1) * m + yy; int t1 = find1(q2[x][i].first); int t2 = find1(y); if (t1 == t2) continue; f[t1] = t2; num--; } } del[q2[x][i].second] -= num; } } int main() { n = read(); m = read(); q = read(); int num = 0; int x, y, c; for (int i = 1; i <= q; i++) { x = read(); y = read(); c = read(); pos[i] = (x - 1) * m + y; num = c; if (a[x][y] == c) continue; q1[c].push_back(make_pair(pos[i], i)); q2[a[x][y]].push_back(make_pair(pos[i], i)); a[x][y] = c; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) q2[a[i][j]].push_back(make_pair((i - 1) * m + j, q + 1)); for (int i = 0; i <= num; i++) reverse(q2[i].begin(), q2[i].end()); for (int i = 0; i <= num; i++) cal_add(i); for (int i = 0; i <= num; i++) cal_del(i); int ans = 1; for (int i = 1; i <= q; i++) ans += del[i], printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { string s; cin >> s; set<int> ans; for (int i = 1; i < s.size() - 1; i++) { if (s[i] == w && s[i - 1] == t && s[i + 1] == o ) { if (i + 3 < s.size() && s[i + 2] == n && s[i + 3] == e ) { ans.insert(i + 1); i = i + 2; } else ans.insert(i); } else if (s[i] == n && s[i - 1] == o && s[i + 1] == e ) ans.insert(i); } cout << ans.size() << endl; set<int>::iterator it; for (it = ans.begin(); it != ans.end(); it++) cout << *it + 1 << ; cout << endl; } }
|
#include <bits/stdc++.h> int adjL[201][210]; int visited[201]; int broken[201][201]; int edge[200][2]; int R[200][2]; int fine[201]; int dfs(int v, int c) { int i; int a; visited[v] = c; for (i = 1; i <= adjL[v][0]; i++) { a = adjL[v][i]; if (visited[a] != 0 || broken[v][a]) continue; dfs(a, c); } return 0; } int dfs_loop(int n) { int i, j; int c; for (i = 1; i <= n; i++) visited[i] = 0; c = 1; for (i = 1; i <= n; i++) if (visited[i] == 0) { dfs(i, c); c++; } return 0; } int main() { int n, m, k; int i, j; int a, b; scanf( %d%d , &n, &m); for (i = 0; i < m; i++) { scanf( %d%d , &a, &b); adjL[a][++adjL[a][0]] = b; adjL[b][++adjL[b][0]] = a; edge[i][0] = a; edge[i][1] = b; } scanf( %d , &k); for (i = 0; i < k; i++) scanf( %d%d , &R[i][0], &R[i][1]); for (i = 1; i <= n; i++) fine[i] = 0; for (i = 0; i < m; i++) { a = edge[i][0]; b = edge[i][1]; broken[a][b] = broken[b][a] = 1; dfs_loop(n); broken[a][b] = broken[b][a] = 0; for (j = 0; j < k; j++) if (visited[R[j][0]] != visited[R[j][1]]) fine[j + 1]++; } for (i = 1; i <= k; i++) printf( %d n , fine[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[300100]; int main() { int n, m; while (~scanf( %d %d n , &n, &m)) { gets(s); int len = strlen(s); int ans = 0; for (int i = 1; i < len; i++) { if (s[i] == . && s[i - 1] == . ) ans++; } char op[3]; int t; while (m--) { scanf( %d %s , &t, op); t--; if (op[0] == . ) { if (s[t] == . ) { printf( %d n , ans); continue; } if ((t - 1 >= 0 && s[t - 1] == . ) && (t + 1 < len && s[t + 1] == . )) ans += 2; else if ((t - 1 >= 0 && s[t - 1] == . ) || (t + 1 < len && s[t + 1] == . )) ans++; } else if (s[t] == . ) { if ((t - 1 >= 0 && s[t - 1] == . ) && (t + 1 < len && s[t + 1] == . )) ans -= 2; else if ((t - 1 >= 0 && s[t - 1] == . ) || (t + 1 < len && s[t + 1] == . )) ans -= 1; } s[t] = op[0]; printf( %d n , ans); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { vector<vector<int> > grid; int h, w; cin >> h >> w; grid.assign(h, vector<int>(w, 0)); for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { scanf( %d , &grid[i][j]); } } int diff1 = 0; int diff2 = 0; for (int j = 0; j < w; j++) { diff1 += grid[h / 2 - 1][j] - grid[h / 2][j]; diff2 += grid[0][j] - grid[h - 1][j]; } if (abs(diff1) > abs(diff2)) cout << YES << endl; else cout << NO << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; vector<int> fa; int n, m, q, g[300][300], x, y, c; int id(int x, int y) { return x * m + y; } int in(int x, int y) { return x >= 0 && y >= 0 && x < n && y < m; } int find(int x) { return fa[x] == x ? x : (fa[x] = find(fa[x])); } int merge(int x, int y) { int xx = find(x), yy = find(y); if (xx == yy) { return 0; } else { fa[xx] = yy; return 1; } } int ADD(int x, int y) { int p = id(x, y); if (fa[p] != INF) return 0; fa[p] = p; static int dx[] = {0, 0, 1, -1}; static int dy[] = {1, -1, 0, 0}; int r = 1; for (int i = (int)0; i < (int)4; ++i) { int nx = x + dx[i], ny = y + dy[i]; int pp = id(nx, ny); if (in(nx, ny) && fa[pp] != INF) { r -= merge(p, pp); } } return r; } struct P { int x, y, p; P(int x_, int y_, int p_) : x(x_), y(y_), p(p_) {} }; int main() { scanf( %d%d%d , &n, &m, &q); fa.resize(n * m); memset(g, 0, sizeof(g)); vector<vector<P>> add(1), del(1); int pc = 0, cc = 0; for (int i = (int)0; i < (int)q; ++i) { scanf( %d%d%d , &x, &y, &c); --x, --y; if (c != pc) { pc = c; ++cc; add.emplace_back(vector<P>{}), del.emplace_back(vector<P>{}); } c = cc; if (g[x][y] != c) { del[g[x][y]].emplace_back(x, y, i); add[c].emplace_back(x, y, i); g[x][y] = c; } } vector<int> df(q, 0); for (int i = (int)0; i < (int)n; ++i) for (int j = (int)0; j < (int)m; ++j) add[0].emplace_back(i, j, 0); for (int c = (int)1; c < (int)cc + 1; ++c) { if (add[c].empty()) continue; fill(fa.begin(), fa.end(), INF); for (auto &p : add[c]) { df[p.p] = ADD(p.x, p.y); } } df[0] += 1; for (int c = (int)0; c < (int)cc + 1; ++c) { fill(fa.begin(), fa.end(), INF); unordered_set<int> xx; for (auto &p : del[c]) { xx.insert(id(p.x, p.y)); } for (auto &p : add[c]) { if (!xx.count(id(p.x, p.y))) ADD(p.x, p.y); } int n = del[c].size(); for (int i = (int)n - 1; i >= (int)0; --i) { auto &p = del[c][i]; df[p.p] -= ADD(p.x, p.y); } } int cnt = 0; for (int i = (int)0; i < (int)q; ++i) { cnt += df[i]; printf( %d n , cnt); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; string inst; cin >> inst; int total = 0; for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) { int ct_u = 0; int ct_l = 0; for (int k = i; k <= j; k++) { if (inst[k] == U ) { ct_u++; } else if (inst[k] == D ) { ct_u--; } else if (inst[k] == L ) { ct_l--; } else if (inst[k] == R ) { ct_l++; } } if (ct_u == 0 && ct_l == 0) total++; } } cout << total << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e6 + 7; struct Data { long long min, max, resl, resr; }; struct TNode { long long L, R; TNode *left, *right; Data d; long long val; }; TNode *new_node(long long L, long long R) { return new TNode({L, R, nullptr, nullptr, {INF, -1, -1, -1}, 0}); } Data safe(TNode *root) { if (!root) { return {INF, -1, -1, -1}; } return root->d; } Data upd(Data a, Data b) { Data c; c.min = min(a.min, b.min); c.max = max(a.max, b.max); c.resl = max({a.resl, b.resl, a.max - 2 * b.min}); c.resr = max({a.resr, b.resr, b.max - 2 * a.min}); return c; } void relax(TNode *root) { if (!root) return; root->d = upd(safe(root->left), safe(root->right)); } void add_val(TNode *root, long long val) { if (!root) return; root->val += val; (root->d).min += val; (root->d).max += val; (root->d).resl -= val; (root->d).resr -= val; } void push(TNode *root) { if (!root) return; add_val(root->left, root->val); add_val(root->right, root->val); root->val = 0; } vector<long long> pref; TNode *build_tree(long long L, long long R) { TNode *root = new_node(L, R); if (R - L == 1) { root->d = {pref[L], pref[L], -pref[L], -pref[L]}; } else { long long M = (L + R) / 2; root->left = build_tree(L, M); root->right = build_tree(M, R); relax(root); } return root; } void add_seg(TNode *root, long long L, long long R, long long val) { if (L >= root->R || root->L >= R) { return; } if (L <= root->L && root->R <= R) { add_val(root, val); return; } push(root); add_seg(root->left, L, R, val); add_seg(root->right, L, R, val); relax(root); } Data get_res(TNode *root, long long L, long long R) { if (L >= root->R || root->L >= R) { return {INF, -1, -1, -1}; } if (L <= root->L && root->R <= R) { return root->d; } push(root); Data res = upd(get_res(root->left, L, R), get_res(root->right, L, R)); relax(root); return res; } long long m; pair<long long, long long> get_max(TNode *root) { if (root->R - root->L == 1) { return {(root->d).max, root->L}; } push(root); pair<long long, long long> ret; if (safe(root->left).max > safe(root->right).max) { ret = get_max(root->left); } else { ret = get_max(root->right); } relax(root); return ret; } void print(TNode *root) { if (root->R - root->L == 1) { cout << (root->d).max << ; return; } push(root); print(root->left); print(root->right); relax(root); } long long query(TNode *root) { auto t = get_max(root); long long pos = t.second, val = t.first; Data a = get_res(root, 0, pos); Data b = get_res(root, pos + 1, m); return max(max(a.resl, b.resr) + val, 0LL); } int main() { ios_base::sync_with_stdio(false); long long n, q; cin >> n >> q; string s; cin >> s; pref.push_back(0); for (long long i = 0; i < 2 * (n - 1); i++) { pref.push_back(pref.back() + (s[i] == ( ? 1 : -1)); } m = 2 * n - 1; TNode *root = build_tree(0, m); cout << query(root) << n ; for (long long i = 0; i < q; i++) { long long a, b; cin >> a >> b; a--, b--; if (a > b) swap(a, b); if (s[a] != s[b]) { if (s[a] == ( ) { add_seg(root, a + 1, b + 1, -2); } else { add_seg(root, a + 1, b + 1, 2); } swap(s[a], s[b]); } cout << query(root) << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 1000 + 20; const int N5 = 300 * 1000 + 10; const int N3 = 3000 + 20; const long long mod = 1000 * 1000 * 1000 + 9; const long long inf = LLONG_MAX / 2; long long dp[2][N], par[N], rnk[N]; long long __pow(long long x, int y) { if (y == 0) return 1; return __pow(x * x % mod, y / 2) % mod * (y & 1 ? x : 1) % mod; } int find_root(int v) { if (par[v] == v) { return v; } return par[v] = find_root(par[v]); } void _merge(int a, int b) { int r_a = find_root(a); int r_b = find_root(b); if (rnk[r_a] > rnk[r_b]) { swap(r_a, r_b); } par[r_a] = r_b; if (rnk[r_a] == rnk[r_b]) { rnk[r_b]++; } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; int t = 0; for (int i = 1; i <= n; i++) par[i] = i; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; if (find_root(x) != find_root(y)) { t++; _merge(x, y); } cout << ((__pow(2, i - t) + mod) - 1) % mod << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { string a, b, c; cin >> a >> b >> c; if (a[0] == c[2] && a[1] == c[1] && a[2] == c[0] && b[0] == b[2]) cout << YES << endl; else cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long I1 = 1e9; const long long I2 = 1e18; const int32_t M1 = 1e9 + 7; const int32_t M2 = 998244353; template <typename T, typename T1> T maxn(T &a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T minn(T &a, T1 b) { if (b < a) a = b; return a; } const int M = 3005; bool cc[M][M]; long long int dis[M][M]; set<pair<pair<long long int, long long int>, long long int> > s; vector<long long int> a[M]; void solve() { int n, m, k; cin >> n >> m >> k; for (long long int i = 0; i < m; i++) { int x, y; cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } for (long long int i = 0; i < k; i++) { int x, y, z; cin >> x >> y >> z; s.insert({{x, y}, z}); } queue<pair<long long int, long long int> > q; q.push({1, 1}); while (!q.empty()) { pair<long long int, long long int> cur = q.front(); int x = cur.first, y = cur.second; q.pop(); cc[cur.first][cur.second] = true; for (auto u : a[y]) { if (s.count({{x, y}, u})) continue; if (cc[y][u] == true) continue; cc[y][u] = true; dis[y][u] = dis[x][y] + 1; q.push({y, u}); } } long long int d = I1, i = n, prev = n; for (long long int i = 1; i <= n; i++) { if (dis[i][n] != 0) minn(d, dis[i][n]); } if (d == I1) { cout << -1 << endl; return; } cout << d << endl; vector<long long int> ans; ans.push_back(n); while (i != 1) { long long int ind = -1; for (long long int j = 1; j <= n; j++) { if (dis[j][i] == d) { ind = j; break; } } ans.push_back(ind); prev = i; i = ind; d--; } reverse(ans.begin(), ans.end()); for (auto u : ans) cout << u << ; cout << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int testcase = 1; while (testcase--) solve(); return 0; }
|
#include <bits/stdc++.h> const long long MOD = 1000 * 1000 * 1000 + 7; const long long MOD1 = 998244353; const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7; using namespace std; long long power(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = (long long)(res * x); y = y >> 1; if (x <= 100000000) x = (long long)(x * x); } return res; } long long val[5001][5001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; long long a[n + 1]; for (int(i) = (1); (i) < (n + 1); ++(i)) { cin >> a[i]; val[i][i] = a[i]; } for (int i = 2; i <= n; i++) { for (int j = 1; j <= n - i + 1; j++) { val[j][j + i - 1] = val[j][j + i - 2] ^ val[j + 1][j + i - 1]; } } for (int i = 2; i <= n; i++) { for (int j = 1; j <= n - i + 1; j++) { val[j][j + i - 1] = max(val[j][j + i - 1], max(val[j][j + i - 2], val[j + 1][j + i - 1])); } } long long q; cin >> q; while (q--) { long long x, y; cin >> x >> y; cout << val[x][y] << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T, typename TT> ostream& operator<<(ostream& out, pair<T, TT> t) { return out << ( << t.first << , << t.second << ) ; } template <typename T> ostream& operator<<(ostream& out, vector<T> t) { for (int i = 0; i < ((int)(t).size()); i++) out << t[i] << ; return out; } template <typename T> inline bool cmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool cmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template <typename T> void read(T& x) { int f = 1; char ch; x = 0; while (!isdigit(ch = getchar())) ; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); x *= f; } const int NX = 201234; int n, m, p[NX]; map<int, int> e[NX]; int main() { read(n); read(m); for (int i = 1, u, v; i <= m; i++) { read(u); read(v); e[u][v] = e[v][u] = true; } for (int i = 1; i <= n; i++) p[i] = i; for (int T = 200; T--;) { random_shuffle(p + 1, p + n + 1); int cnt = 0; for (int i = 1; i <= n; i++) { int l = p[i], r = p[i % n + 1]; cnt += !e[l].count(r); } if (cnt >= m) { for (int i = 1; i <= n; i++) { int l = p[i], r = p[i % n + 1]; if (!e[l].count(r)) { printf( %d %d n , l, r); if (!--m) return 0; } } } } puts( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int p = 1e9 + 7, len = 1 << 16; char ch[100012]; int n, m, dp[502][100012], js, s[100012], tot, f[100012], val[100012]; inline void fwt_or(int x[], int mde) { for (int i = 2; i <= len; i <<= 1) for (int j = 0, stp = i >> 1; j < len; j += i) for (int k = j; k < j + stp; k++) (x[k + stp] += 1ll * mde * x[k] % p) %= p; } inline void fwt_and(int x[], int mde) { for (int i = 2; i <= len; i <<= 1) for (int j = 0, stp = i >> 1; j < len; j += i) for (int k = j; k < j + stp; k++) (x[k] += 1ll * mde * x[k + stp] % p) %= p; } int solve(int l, int r) { int ret = ++js, mid; if (l == r) { if (ch[l] == ? ) { for (int i = 0; i < 4; i++) { int va = 0; for (int j = 0; j < 16; j++) if (j & (1 << i)) va |= 1 << j; dp[ret][va]++; va = 0; for (int j = 0; j < 16; j++) if (!(j & (1 << i))) va |= 1 << j; dp[ret][va]++; } } else if (ch[l] >= A && ch[l] <= D ) { int va = 0; for (int j = 0; j < 16; j++) if (j & (1 << (ch[l] - A ))) va |= 1 << j; dp[ret][va]++; } else { int va = 0; for (int j = 0; j < 16; j++) if (!(j & (1 << (ch[l] - a )))) va |= 1 << j; dp[ret][va]++; } return ret; } tot = 0; for (int i = l; i <= r; i++) { if (ch[i] == ( ) s[++tot] = i; else if (ch[i] == ) ) tot--; else { if (!tot) { mid = i; break; } } } int ls = solve(l + 1, mid - 2), rs = solve(mid + 2, r - 1); if (ch[mid] == ? ) { fwt_or(dp[ls], 1); fwt_or(dp[rs], 1); for (int i = 0; i < len; i++) dp[ret][i] = 1ll * dp[ls][i] * dp[rs][i] % p; fwt_or(dp[ret], p - 1); fwt_or(dp[ls], p - 1); fwt_or(dp[rs], p - 1); fwt_and(dp[ls], 1); fwt_and(dp[rs], 1); for (int i = 0; i < len; i++) f[i] = 1ll * dp[ls][i] * dp[rs][i] % p; fwt_and(f, p - 1); fwt_and(dp[ls], p - 1); fwt_and(dp[rs], p - 1); for (int i = 0; i < len; i++) (dp[ret][i] += f[i]) %= p; } else if (ch[mid] == | ) { fwt_or(dp[ls], 1); fwt_or(dp[rs], 1); for (int i = 0; i < len; i++) dp[ret][i] = 1ll * dp[ls][i] * dp[rs][i] % p; fwt_or(dp[ret], p - 1); fwt_or(dp[ls], p - 1); fwt_or(dp[rs], p - 1); } else { fwt_and(dp[ls], 1); fwt_and(dp[rs], 1); for (int i = 0; i < len; i++) dp[ret][i] = 1ll * dp[ls][i] * dp[rs][i] % p; fwt_and(dp[ret], p - 1); fwt_and(dp[ls], p - 1); fwt_and(dp[rs], p - 1); } return ret; } int main() { scanf( %s , ch + 1); n = strlen(ch + 1); int rt = solve(1, n); memset(val, -1, sizeof(val)); scanf( %d , &m); for (int i = 1; i <= m; i++) { int a, b, c, d, w; scanf( %d%d%d%d%d , &a, &b, &c, &d, &w); val[a | (b << 1) | (c << 2) | (d << 3)] = w; } int ans = 0; for (int i = 0; i < len; i++) { bool flag = true; for (int j = 0; j < 16; j++) if (val[j] != -1) { if (((i >> j) & 1) != val[j]) { flag = false; break; } } if (flag) ans = (ans + dp[rt][i]) % p; } printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; int func(int n) { int sum = 1; if (n == 3) return 4; if (n == 2) return 2; if (n == 1) return 1; if (n % 2 == 0) { sum += 2 * (n / 2 - 1) + 1 + func(n - 2); } else { sum += 2 * (n - 1) / 2 + func(n - 2); } return sum; } int main() { { int n; int r = 1; int i = 0; cin >> n; cout << func(n); return 0; } }
|
#include <bits/stdc++.h> using namespace std; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> s; long long n = s.size(); long long a = 0, b = 0; for (auto f : s) { a += (f == 1 ); b += (f == 0 ); } long long z = n - a - b; if (a < b + z) { cout << 00 << endl; } if (n % 2 == 0 && s[n - 1] != 0 ) { long long a1 = a, b1 = b; if (s[n - 1] == ? ) { a1++; } if (a1 <= n / 2 && b1 <= n / 2) { cout << 01 << endl; } } else if (s[n - 1] != 0 ) { long long a1 = a, b1 = b; if (s[n - 1] == ? ) { a1++; } if (a1 <= n / 2 + 1 && b1 <= n / 2) { cout << 01 << endl; } } if (n % 2 == 0 && s[n - 1] != 1 ) { long long a1 = a, b1 = b; if (s[n - 1] == ? ) { b1++; } if (a1 <= n / 2 && b1 <= n / 2) { cout << 10 << endl; } } else if (s[n - 1] != 1 ) { long long a1 = a, b1 = b; if (s[n - 1] == ? ) { b1++; } if (a1 <= n / 2 + 1 && b1 <= n / 2) { cout << 10 << endl; } } if (a + z > b + 1) { cout << 11 << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 5; int a[N], n; int dp[N][N / 2][2][2]; int solve(int idx, int lft, bool b4, bool b44) { if (lft < 0) return 1e9; if (idx == n) { if (lft) return 1e9; return 0; } int &ret = dp[idx][lft][b4][b44]; if (~ret) return ret; ret = solve(idx + 1, lft, 0, b4); if (!b4) { int x; int cost1 = 0, cost2 = 0; if (b44) { x = min(a[idx - 1], a[idx - 2] - 1); } else x = a[idx - 1]; if (idx) cost1 = max(0, x - (a[idx] - 1)); if (idx != n - 1) { cost2 = max(0, a[idx + 1] - (a[idx] - 1)); } ret = min(ret, solve(idx + 1, lft - 1, 1, 0) + cost1 + cost2); } return ret; } int main() { memset(dp, -1, sizeof dp); scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 1; i <= (n + 1) / 2; i++) { printf( %d , solve(0, i, 0, 0)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int mod = 1e9 + 7; const int sz = 1e5 + 10; int main() { int n, x; set<int> ans, st, ha; while (cin >> n) { ans.clear(); st.clear(); for (int i = 0; i < n; i++) { ha.clear(); cin >> x; ha.insert(x); ans.insert(x); for (int xx : st) { ha.insert(x | xx); ans.insert(x | xx); } st = ha; } cout << ans.size() << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> arr(n + 1, -1); for (int i = 1; i <= n; i++) { int temp; cin >> temp; arr[i] = temp; } int ans = 0; vector<int> mini(n + 1, -1); vector<int> maxi(n + 1, -1); vector<int> equal(n + 1, -1); equal[1] = 1; mini[1] = 1; maxi[1] = 1; for (int i = 2; i <= n; i++) { if (arr[i] != arr[i - 1]) equal[i] = 1; else { equal[i] = equal[i - 1] + 1; mini[i] = mini[i - 1] + 1; maxi[i] = maxi[i - 1] + 1; } if (arr[i] > arr[i - 1]) { maxi[i] = max(mini[i - 1] + 1, equal[i - 1] + 1); mini[i] = 1; } if (arr[i] < arr[i - 1]) { mini[i] = max(maxi[i - 1] + 1, equal[i - 1] + 1); maxi[i] = 1; } int temp = max(mini[i], max(maxi[i], equal[i])); if (temp > ans) ans = temp; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 51123987; string s; int n; long long d[50 + 10][50 + 10][150 + 10][3]; int NEXT[150 + 10][5]; inline int nex(int MIN, int c) { return NEXT[MIN][c]; } int main() { ios_base::sync_with_stdio(false); cin >> n >> s; for (int i = 1; i <= n; ++i) for (int j = 1; j <= 3; ++j) { NEXT[i][j] = n + 1; for (int l = i - 1; l < s.size(); ++l) if (s[l] == char(j + a - 1)) { NEXT[i][j] = l + 1; break; } } { int ind = nex(1, 1); if (ind <= n) d[1][0][ind][1] = 1; ind = nex(1, 2); if (ind <= n) d[0][1][ind][1] = 1; ind = nex(1, 3); if (ind <= n) d[0][0][ind][1] = 1; } for (int i = 2; i <= n; ++i) { for (int j = 0; j <= 50; ++j) for (int l = 0; l <= 50; ++l) for (int k = 1; k <= n; ++k) { int ind = nex(k, 1); if (ind <= n) { d[j + 1][l][ind][0] += d[j][l][k][1]; if (d[j + 1][l][ind][0] > mod) d[j + 1][l][ind][0] -= mod; } ind = nex(k, 2); if (ind <= n) { d[j][l + 1][ind][0] += d[j][l][k][1]; if (d[j][l + 1][ind][0] > mod) d[j][l + 1][ind][0] -= mod; } ind = nex(k, 3); if (ind <= n) { d[j][l][ind][0] += d[j][l][k][1]; if (d[j][l][ind][0] > mod) d[j][l][ind][0] -= mod; } } for (int j = 0; j <= 50; ++j) for (int l = 0; l <= 50; ++l) for (int k = 1; k <= n; ++k) { d[j][l][k][1] = d[j][l][k][0]; d[j][l][k][0] = 0; } } long long ans = 0; for (int j = 0; j <= 50; ++j) for (int l = 0; l <= 50; ++l) for (int k = 1; k <= n; ++k) { int a = j; int b = l; int c = n - j - l; if (a >= 0 && b >= 0 && c >= 0) if (abs(a - b) <= 1 && abs(b - c) <= 1 && abs(a - c) <= 1) { ans += d[j][l][k][1]; ans %= mod; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int val, l, r; } a[100010]; int rt, n; bool to[100010]; map<int, bool> ma; vector<int> v; void dfs(int u, int maxx, int minn) { if (u == -1) return; if (a[u].val > maxx && a[u].val < minn) ma[a[u].val] = true; dfs(a[u].l, maxx, min(a[u].val, minn)); dfs(a[u].r, max(a[u].val, maxx), minn); return; } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d%d%d , &a[i].val, &a[i].l, &a[i].r); if (a[i].l != -1) to[a[i].l] = true; if (a[i].r != -1) to[a[i].r] = true; } for (int i = 1; i <= n; i++) if (to[i] == false) rt = i; dfs(rt, -1, 1e9 + 1); int ans = 0; for (int i = 1; i <= n; i++) if (ma[a[i].val] == false) ans++; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; struct node { int sig; int bz; char s[11]; int get() { int len = strlen(s); int x = 0; if (s[0] == 0 ) return 0; for (int i = 0; i < len; i++) if (s[i] < 0 || s[i] > 9 ) return 0; else x = x * 10 + s[i] - 0 ; return x; } } f[200000], g[200000], c[200000], d[200000]; int a[200000 * 4], b[200000 * 4]; int tot, m, calc, totc, totd; int ans[200000][2]; void ins(int* f, int l, int r, int s, int ll, int v) { if (l == r) { f[s] = v; return; } if ((l + r) / 2 >= ll) ins(f, l, (l + r) / 2, s + s, ll, v); else ins(f, (l + r) / 2 + 1, r, s + s + 1, ll, v); f[s] = min(f[s + s], f[s + s + 1]); } int get(int* f, int l, int r, int s) { if (l == r) { f[s] = 1; return l; } if (!f[s + s]) { int x = get(f, l, (l + r) / 2, s + s); f[s] = min(f[s + s], f[s + s + 1]); return x; } else { int x = get(f, (l + r) / 2 + 1, r, s + s + 1); f[s] = min(f[s + s], f[s + s + 1]); return x; } } void clear(int* f, int l, int r, int s, int ll) { if (l == r) { f[s] = 0; return; } if ((l + r) / 2 >= ll) clear(f, l, (l + r) / 2, s + s, ll); else clear(f, (l + r) / 2 + 1, r, s + s + 1, ll); f[s] = min(f[s + s], f[s + s + 1]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s %d , f[i].s, &f[i].sig); f[i].bz = i; m += f[i].sig; } for (int i = 1; i <= n; i++) { int x = f[i].get(); if (x && x <= m) { ins(a, 1, m, 1, x, i); if (!f[i].sig) c[++totc] = f[i]; } else if (x && x <= n) { ins(b, 1, n - m, 1, x - m, i); if (f[i].sig) d[++totd] = f[i]; } else g[++tot] = f[i]; } int lc = 1, ld = 1, extra = n; int tot1 = tot; while (lc <= totc || ld <= totd) { if (!b[1] && lc <= totc) { ans[++calc][0] = c[lc].bz; ans[calc][1] = get(b, 1, n - m, 1) + m; clear(a, 1, m, 1, c[lc].get()); lc++; } else if (!a[1] && ld <= totd) { ans[++calc][0] = d[ld].bz; ans[calc][1] = get(a, 1, m, 1); clear(b, 1, n - m, 1, d[ld].get() - m); ld++; } else if (lc <= totc) { ans[++calc][0] = c[lc].bz; ans[calc][1] = ++extra; clear(a, 1, m, 1, c[lc].get()); g[++tot] = c[lc]; lc++; } else { ans[++calc][0] = d[ld].bz; ans[calc][1] = ++extra; clear(b, 1, n - m, 1, d[ld].get() - m); g[++tot] = d[ld]; ld++; } } for (int i = 1; i <= tot1; i++) if (g[i].sig) { ans[++calc][0] = g[i].bz; ans[calc][1] = get(a, 1, m, 1); } else { ans[++calc][0] = g[i].bz; ans[calc][1] = get(b, 1, n - m, 1) + m; } for (int i = tot; i > tot1; i--) if (g[i].sig) { ans[++calc][0] = -(extra); extra--; ans[calc][1] = get(a, 1, m, 1); } else { ans[++calc][0] = -(extra); extra--; ans[calc][1] = get(b, 1, n - m, 1) + m; } printf( %d n , calc); for (int i = 1; i <= calc; i++) if (ans[i][0] < 0) printf( move %d %d n , -ans[i][0], ans[i][1]); else printf( move %s %d n , f[ans[i][0]].s, ans[i][1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; bool used[n]; for (int i = 0; i <= n - 1; i++) used[i] = false; int a = 0, b = n - 1; for (int i = 0; i <= k - 1; i++) { if (i & 1) used[b] = true; else used[a] = true; if (i & 1) cout << (1 + (b--)); else cout << (1 + (a++)); cout << ; } if (k & 1) { for (int i = 0; i <= n - 1; i++) { if (!used[i]) { cout << i + 1 << ; } } } else { for (int i = n - 1; i >= 0; --i) { if (!used[i]) { cout << i + 1 << ; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[26]; char s[100001]; int gcd(int a, int b) { if (a % b == 0) { return b; } else { return gcd(b, a % b); } } int main() { int n, ans, sum = 0, c = 0, i, j, k, l; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; if (a[i] % 2 == 1) c++; } if (c >= 2) { ans = 0; for (i = 0, j = 0; i < n; i++) { while (a[i] > 0) { s[j++] = a + i; a[i]--; } } } else { ans = a[0]; for (i = 1; i < n; i++) ans = gcd(ans, a[i]); if (c == 1) { int p; for (i = 0; i < n; i++) { if (a[i] % 2 == 1) { p = i; a[i] -= ans; } } for (i = 0, l = 0; i < ans * 2; i++) { if (i % 2 == 0) { for (j = 0; j < n; j++) { for (k = 0; k < a[j] / ans / 2; k++) s[l++] = a + j; } s[l++] = a + p; } else { for (j = n - 1; j >= 0; j--) { for (k = 0; k < a[j] / ans / 2; k++) s[l++] = a + j; } } } } else { for (i = 0, l = 0; i < ans; i++) { if (i % 2 == 0) { for (j = 0; j < n; j++) { for (k = 0; k < a[j] / ans; k++) s[l++] = a + j; } } else { for (j = n - 1; j >= 0; j--) { for (k = 0; k < a[j] / ans; k++) s[l++] = a + j; } } } } } printf( %d n , ans); printf( %s n , s); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int d, n, a, s = 0, k; scanf( %d , &d); scanf( %d , &n); scanf( %d , &a); for (k = 1; k < n; k++) { s += d - a; scanf( %d , &a); } printf( %d n , s); return 0; }
|
#include <bits/stdc++.h> int main(void) { int n, m; scanf( %d %d , &n, &m); long long a[1000 + 1]; long long t[1000 + 1 + 1][1000 + 1]; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); } for (int j = 0; j <= n; j++) t[n + 1][j] = 0; for (int i = n; i >= 1; i--) { for (int j = 0; j <= n; j++) { t[i][j] = std::min(t[i + 1][j] - a[i], (j > 0) ? t[i + 1][j - 1] : 1LL << 60LL); t[i][j] = std::max(t[i][j], 0LL); } } std::vector<std::pair<long long, int>> values; for (int j = 0; j <= n; j++) { if (j == 0 || t[1][j] != t[1][j - 1]) values.push_back(std::make_pair(t[1][j], j)); } std::sort(values.begin(), values.end()); for (int i = 0; i < m; i++) { long long b; scanf( %lld , &b); auto it = std::lower_bound(values.begin(), values.end(), std::make_pair(b, -1)); if (it == values.end() || it->first > b) it--; printf( %d n , it->second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18 + 7; long long f[53], fac[53]; long long add(long long a, long long b) { return min(INF, a + b); } long long mul(long long a, long long b) { if (INF / a < b) return INF; return a * b; } const int N = 50; long long g(int n) { if (n == 1) return 1; return fac[n - 2]; } void init() { fac[0] = 1; for (int i = 1; i <= N; i++) fac[i] = mul(fac[i - 1], i); f[0] = 1; for (int i = 1; i <= N; i++) for (int j = 1; j <= i; j++) f[i] = add(f[i], mul(f[i - j], g(j))); return; } int p[53]; int q[53]; bool vis[53]; int find(int x) { while (q[x]) x = q[x]; return x; } void getq(int n, long long k) { if (n == 1) { q[1] = 1; return; } for (int i = 1; i <= n; i++) q[i] = vis[i] = 0; q[1] = n; vis[n] = 1; for (int i = 2; i < n; i++) { long long num = fac[n - i - 1]; for (int j = 1; j <= n; j++) if (j != i && !vis[j] && find(j) != i) { if (k <= num) { q[i] = j; vis[j] = true; break; } k -= num; } } for (int i = 1; i <= n; i++) if (!vis[i]) q[n] = i; return; } void getp(int n, long long k) { if (!n) return; int len = 0; for (int i = 1; i <= n; i++) { long long num = mul(g(i), f[n - i]); if (k <= num) { len = i; break; } k -= num; } long long num = f[n - len]; long long need = (k - 1) / num + 1; getp(n - len, k - (need - 1) * num); for (int i = n; i > len; i--) p[i] = p[i - len] + len; getq(len, need); for (int i = 1; i <= len; i++) p[i] = q[i]; return; } int main() { init(); int t; scanf( %d , &t); while (t--) { int n; long long k; scanf( %d %lld , &n, &k); if (f[n] < k) printf( -1 n ); else { getp(n, k); for (int i = 1; i <= n; i++) printf( %d , p[i]); printf( n ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; bitset<100005> m[70], tmp, tmpp; int f[100], ftop = 60; int ans[100010]; void swap(int x, int y) { tmp = m[x]; m[x] = m[y]; m[y] = tmp; } int main() { int i, j, k, d = 60; long long x, s = 0; scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %I64d , &x); s ^= x; for (j = 0; j < 60; ++j) if (x & (1ll << j)) m[j][i] = 1; } for (i = 59; ~i; --i) if (!(s & (1ll << i))) { --d; tmpp = m[i]; for (j = i; j < d; ++j) m[j] = m[j + 1]; m[d] = tmpp; } for (i = 59; ~i; --i) { if (i >= d) m[i][0] = 1; for (j = 59; j >= ftop; --j) if (m[i][f[j]]) m[i] ^= m[j]; for (k = 1; k <= n && m[i][k] == 0; ++k) ; if (n < k) m[i][0] = 0; else { for (j = 59; j >= ftop; --j) if (m[j][k]) m[j] ^= m[i]; --ftop; f[ftop] = k; swap(ftop, i); } } for (i = 59; i >= ftop; --i) if (m[i][0]) ans[f[i]] = 1; for (i = 1; i <= n; ++i) printf( %d , ans[i] ? 1 : 2); puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int max_n = 300011, log_n = 32, max_m = 111, mod = 1000000007, inf = 1011111111; const long double eps = 1e-7; struct bor { stack<pair<int, int> > st; int t[max_n][27], res[max_n], sz[max_n], n; bor() { for (int i = 0; i < max_n; ++i) { for (int q = 0; q < 27; ++q) { t[i][q] = -1; } } } void add(int x, int y, char c) { t[x][c - a ] = y; } int get_sz(int v) { int ans = 1; for (int i = 0; i < 26; ++i) { if (t[v][i] != -1) { ans += get_sz(t[v][i]); } } return sz[v] = ans; } int mrg(int v, int v1) { int ans = 1; for (int i = 0; i < 27; ++i) { if (t[v][i] != -1 && t[v1][i] != -1) { ans += mrg(t[v][i], t[v1][i]); } else if (t[v][i] != -1) { t[v1][i] = t[v][i]; st.push(make_pair(v1, i)); } } return ans; } void get(int v, int p) { int mx = 0, mxx = -1; for (int i = 0; i < 26; ++i) { if (t[v][i] != -1 && mx < sz[t[v][i]]) { mx = sz[t[v][i]]; mxx = i; } } if (mxx == -1) { return; } res[p]++; for (int i = 0; i < 26; ++i) { if (i == mxx) continue; if (t[v][i] != -1) { res[p] += mrg(t[v][i], t[v][mxx]); } } while (st.size()) { t[st.top().first][st.top().second] = -1; st.pop(); } } void get_all(int v, int p) { get(v, p); for (int i = 0; i < 26; ++i) { if (t[v][i] != -1) { get_all(t[v][i], p + 1); } } } }; bor br; int n; int main() { cin >> n; for (int i = 0; i < n - 1; ++i) { int a, b; char c; cin >> a >> b >> c; br.add(a - 1, b - 1, c); } br.get_sz(0); br.get_all(0, 0); int mx = 0, mxx = 0; for (int i = 0; i < n; ++i) { if (mx < br.res[i]) { mx = br.res[i]; mxx = i; } } cout << n - mx << endl << mxx + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { double a, b, c, d; cin >> a >> b >> c >> d; double mx; mx = (a / b) * (1 / (1 - (1 - a / b) * (1 - c / d))); std::cout << std::setprecision(9) << mx << n ; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline void Read(T &x) { int f = 1; char t = getchar(); while (t < 0 || t > 9 ) { if (t == - ) f = -1; t = getchar(); } x = 0; while (t >= 0 && t <= 9 ) { x = x * 10 + t - 0 ; t = getchar(); } x *= f; } template <class T> inline void chkmin(T &x, T y) { if (x > y) x = y; } template <class T> inline void chkmax(T &x, T y) { if (x < y) x = y; } const int maxn = 200005; const double inf = 2e18; const double pi = acos(-1.0); struct point { long double x, y; point() {} point(long double x, long double y) : x(x), y(y) {} void read() { cin >> x >> y; } }; point operator+(const point &a, const point &b) { return point(a.x + b.x, a.y + b.y); } point operator-(const point &a, const point &b) { return point(a.x - b.x, a.y - b.y); } point operator*(const point &a, long double v) { return point(a.x * v, a.y * v); } point operator/(const point &a, long double v) { return point(a.x / v, a.y / v); } long double operator^(const point &a, const point &b) { return a.x * b.y - a.y * b.x; } int n; point P, g[maxn]; long double dis(point &a, point &b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } long double maxr = -inf, minr = inf; void calc(point &a, point &b) { long double A = dis(a, P), B = dis(b, P), C = dis(a, b); long double area = (a - P) ^ (b - P); long double Height = area * area / C; if (A < B) swap(A, B); if (A > B + C) return; chkmax(maxr, Height); chkmin(minr, Height); } void input() { Read(n); P.read(); for (register int i = 1; i <= n; i++) g[i].read(); g[0] = g[n]; for (register int i = 1; i <= n; i++) calc(g[i], g[i - 1]); } void solve() { for (register int i = 1; i <= n; i++) { chkmax(maxr, dis(g[i], P)); chkmin(minr, dis(g[i], P)); } printf( %.18lf n , (double)(maxr - minr) * pi); } int main() { input(); solve(); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) #pragma GCC optimize( unroll-loops ) using namespace std; long long power(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md)); } const int xn = 1e3 + 10; const int xm = 2e4 + 10; const int sq = 300; const int inf = 1e9 + 10; const long long INF = 1e18 + 10; const int mod = 1e6 + 7; const int base = 257; const int SIG = 26; int n, k, tb[1 << 20], dp[xn][xm], ptr, a[xm], C[xm][SIG], ans = inf; string S; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> S >> k, n = int(S.size()); if (k == 1) { ans = 0; for (int i = 0; i < n; ++i) ans += (S[i] == 1 ); return cout << ans << n , 0; } for (int mask = 0; mask < (1 << k); ++mask) { bool flag = true; for (int i = 0; i < k; ++i) flag &= (!((mask & (1 << i))) | !(mask & (1 << (i + 1)))); flag &= !(mask & 1), flag &= !(mask & 2); if (flag) tb[mask] = ptr, a[ptr++] = mask; } for (int t = 0; t < ptr; ++t) { int mask = a[t] + 1; for (int i = 2; i < 10; ++i) { for (int bit = i; bit <= k; ++bit) if ((mask & (1 << (bit - i)))) C[t][i] += (1 << bit); bool flag = !(C[t][i] & (1 << k)); for (int j = 1; j < k; ++j) if (k % j == 0) flag |= (C[t][i] & (1 << j)); for (int b1 = 2; b1 < k; ++b1) for (int b2 = b1 + 1; b2 <= k; ++b2) if ((C[t][i] & (1 << b1)) && (C[t][i] & (1 << b2))) flag |= (k % (b2 - b1) == 0); C[t][i] = (C[t][i] & (C[t][i] ^ (1 << k))); if (!flag) C[t][i] = -1; } } for (int i = 0; i < xn; ++i) for (int j = 0; j < ptr; ++j) dp[i][j] = inf; dp[0][0] = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < ptr; ++j) { int mask = a[j]; if (S[i] == 1 ) dp[i + 1][0] = min(dp[i + 1][0], dp[i][j]); else { dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1); int x = C[j][S[i] - 0 ]; if (x != -1) dp[i + 1][tb[x]] = min(dp[i + 1][tb[x]], dp[i][j]); } } } for (int i = 0; i < ptr; ++i) ans = min(ans, dp[n][i]); cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 109; int a[MAX], n, k, t = 1e9, s; int main() { cin >> n; for (int i = 0; i < 2 * n - 1; i++) { cin >> a[i], s += abs(a[i]), t = min(t, abs(a[i])); if (a[i] < 0) k++; } if (k % 2 && n % 2 == 0) s -= 2 * t; cout << s; }
|
#include <bits/stdc++.h> using namespace std; int nor[200100 * 2], n, t, m, a[200100], b[200100], sola, solb, sol, pcta, pctb; int main() { cin >> n; nor[++t] = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; nor[++t] = a[i]; } cin >> m; for (int i = 1; i <= m; ++i) { cin >> b[i]; nor[++t] = b[i]; } sort(nor + 1, nor + t + 1); sort(a + 1, a + n + 1); sort(b + 1, b + m + 1); nor[++t] = max(a[n], b[n]) + 1; sol = -(1 << 30); for (int i = 1; i <= t; ++i) { int mij; int st = 1, dr = n; while (st <= dr) { mij = (st + dr) >> 1; if (a[mij] <= nor[i]) st = mij + 1; else dr = mij - 1; } pcta = (st - 1) * 2 + (n - (st - 1)) * 3; st = 1, dr = m; while (st <= dr) { mij = (st + dr) >> 1; if (b[mij] <= nor[i]) st = mij + 1; else dr = mij - 1; } pctb = (st - 1) * 2 + (m - (st - 1)) * 3; if (pcta - pctb > sol) { sol = pcta - pctb; sola = pcta; solb = pctb; } else if (pcta - pctb == sol && pcta > sola) { sola = pcta; solb = pctb; } } cout << sola << : << solb; return 0; }
|
#include <bits/stdc++.h> using namespace std; std::vector<int> Edge[510]; std::vector<int> Current[510]; int Right[510]; int Left[510]; int Vis[510]; int N, M; bool dfs(int idx) { if (Vis[idx]) return false; Vis[idx] = 1; for (int i = 0; i < Current[idx].size(); i++) { int v = Current[idx][i]; if (Left[v] == -1 || dfs(Left[v])) { Left[v] = idx; Right[idx] = v; return true; } } return false; } int bpm() { int Ans = 0; memset(Left, -1, sizeof(Left)); memset(Right, -1, sizeof(Right)); for (int i = 0; i < N; i++) { memset(Vis, false, sizeof(Vis)); Ans += dfs(i); } return Ans; } int main() { cin >> N >> M; int u, v; for (int i = 0; i < M; i++) { cin >> u >> v; u -= 1, v -= 1; Edge[u].push_back(v); } int Ans = 1e9; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) Current[j].clear(); int cnt = 0, other = 0; for (int j = 0; j < N; j++) { for (int k = 0; k < Edge[j].size(); k++) { if (j == i || Edge[j][k] == i) { cnt += 1; continue; } other += 1; Current[j].push_back(Edge[j][k]); } } int max_match = bpm(); Ans = min(Ans, 2 * N - 1 + other - cnt - 2 * max_match + N - 1); } cout << Ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cin.sync_with_stdio(0); int n, t1, t2; double k; cin >> n >> t1 >> t2 >> k; k /= 100; k = 1 - k; double c[n + 1]; for (int i = 1; i <= n; i++) { int a, b; cin >> a >> b; int tema = a; int temb = b; a = max(a, temb); b = min(tema, b); if (t1 * k >= t2) { c[i] = t1 * a * k + t2 * b; } else { c[i] = t1 * b * k + t2 * a; } } int g[n + 1]; for (int i = 1; i <= n; i++) { g[i] = i; } for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { if (c[j] > c[i] || (c[j] == c[i] && g[j] < g[i])) { double temb = c[i]; c[i] = c[j]; c[j] = temb; int temb2 = g[i]; g[i] = g[j]; g[j] = temb2; } } } for (int i = 1; i <= n; i++) { cout << g[i] << << fixed << setprecision(2) << c[i] << ; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000 + 10; vector<int> u[N], v[N], v2[N]; vector<pair<int, int> > q[N]; int t, st[N], fi[N], di[N], g[N], par[N]; int root(int u) { return (par[u] == u) ? u : par[u] = root(par[u]); } void merge1(int x, int y) { int dx = root(x), dy = root(y); if (dx == dy) return; par[dy] = dx; } bool mark[N], ans[N]; void dfs(int u) { mark[u] = true; st[u] = t++; for (int i = 0; i < v[u].size(); i++) { if (!mark[v[u][i]]) dfs(v[u][i]); } fi[u] = t++; } int main() { int n, m, p = 1, j = 1; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b, c; cin >> a; u[i].push_back(a); if (a == 1) { cin >> b >> c; u[i].push_back(b); u[i].push_back(c); v[c].push_back(b); di[b]++; } if (a == 2) { cin >> b; u[i].push_back(b); u[i].push_back(p); p++; } if (a == 3) { cin >> b >> c; u[i].push_back(b); u[i].push_back(c); q[c].push_back({b, j++}); } } for (int i = 1; i <= n; i++) par[i] = i; for (int i = 1; i <= n; i++) { if (di[i] == 0) dfs(i); } for (int i = 1; i <= n; i++) { } for (int i = 0; i < m; i++) { int a = u[i][0], b = u[i][1], c = u[i][2]; if (u[i][0] == 1) merge1(b, c); if (u[i][0] == 2) { for (int i = 0; i < q[c].size(); i++) { int qu = q[c][i].first, kj = q[c][i].second; if (st[qu] <= st[b] && fi[qu] >= fi[b] && root(qu) == root(b)) ans[kj] = true; else ans[kj] = false; } } } for (int i = 1; i < j; i++) { if (ans[i]) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int a; int b; cin >> a >> b; cout.precision(13); if (b > a) { cout << -1; } else if ((a % b == 0) && ((a / b) % 2 == 1)) { cout << b; } else { int k = a / b; if (k % 2 == 0) { k--; } int dist = a - k * b; double x1 = b; double x2 = (double)dist / (double)k + (double)b; double x = x1; double ang; double x_old; for (int i = 0; i < 50; i++) { ang = (x - b) / (k * x - a); x_old = x; if (ang > -1) { x = (x + x2) / 2.0; x1 = x_old; } else if (ang < -1) { x = (x + x1) / 2.0; x2 = x_old; } else { cout << x; return 0; } } cout << x; } return 0; }
|
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const long long maxn = 3e6; const long long mod = 1e9 + 7; const long double PI = acos((long double)-1); long long pw(long long a, long long b, long long md = mod) { long long res = 1; while (b) { if (b & 1) { res = (a * res) % md; } a = (a * a) % md; b >>= 1; } return (res); } string s[4]; bool hor(int x, int y) { if (x < 1 or x > 2) return (0); int cnt = 0; if (s[x][y] == o ) return (0); if (s[x][y] == . ) cnt++; if (s[x - 1][y] == o ) return (0); if (s[x - 1][y] == . ) cnt++; if (s[x + 1][y] == o ) return (0); if (s[x + 1][y] == . ) cnt++; return (cnt < 2); } bool ver(int x, int y) { if (y < 1 or y > 2) return (0); int cnt = 0; if (s[x][y] == o ) return (0); if (s[x][y] == . ) cnt++; if (s[x][y - 1] == o ) return (0); if (s[x][y - 1] == . ) cnt++; if (s[x][y + 1] == o ) return (0); if (s[x][y + 1] == . ) cnt++; return (cnt < 2); } bool dia(int x, int y) { int cnt = 0; if (x < 1 or x > 2) return (0); if (y < 1 or y > 2) return (0); if (s[x][y] == o ) return (0); if (s[x][y] == . ) cnt++; if (s[x - 1][y - 1] == o ) return (0); if (s[x - 1][y - 1] == . ) cnt++; if (s[x + 1][y + 1] == o ) return (0); if (s[x + 1][y + 1] == . ) cnt++; return (cnt < 2); } bool diag(int x, int y) { int cnt = 0; if (x < 1 or x > 2) return (0); if (y < 1 or y > 2) return (0); if (s[x][y] == o ) return (0); if (s[x][y] == . ) cnt++; if (s[x - 1][y + 1] == o ) return (0); if (s[x - 1][y + 1] == . ) cnt++; if (s[x + 1][y - 1] == o ) return (0); if (s[x + 1][y - 1] == . ) cnt++; return (cnt < 2); } bool chk(int x, int y) { if (ver(x, y)) return (1); if (hor(x, y)) return (1); if (dia(x, y)) return (1); if (diag(x, y)) return (1); return (0); } int32_t main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); for (int i = 0; i < 4; i++) cin >> s[i]; for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) if (chk(i, j)) cout << YES , exit(0); cout << NO ; return (0); }
|
#include <bits/stdc++.h> using namespace std; int main() { puts( INTERCAL ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, sy, sx; cin >> n >> m >> sy >> sx; int up = sy; int down = sy + 1; int l = sx; int r = sx + 1; int k = 2; while (up >= 1) { while (l >= 1) { cout << up << << l << endl; l--; } while (r <= m) { cout << up << << r << endl; r++; } up--; if (k % 2 == 0) l = m; else r = 1; k++; } while (down <= n) { while (l >= 1) { cout << down << << l << endl; l--; } while (r <= m) { cout << down << << r << endl; r++; } down++; if (k % 2 == 0) l = m; else r = 1; k++; } }
|
#include <bits/stdc++.h> using namespace std; int n, m; vector<pair<int, int> > a_sent; vector<pair<int, int> > b_sent; set<pair<int, int> > a_possible; set<pair<int, int> > b_possible; int vis[10]; bool certain(pair<int, int> a, vector<pair<int, int> > sent) { bool can_x = false; bool can_y = false; for (pair<int, int> b : sent) { if (0) { printf( has: [%d, %d], try: [%d, %d] n , a.first, a.second, b.first, b.second); } if (a.first == b.first && a.second == b.second) continue; if (a.first == b.second && a.second == b.first) continue; if (a.first != b.first && a.second != b.second && a.first != b.second && a.second != b.first) continue; if (a.first == b.first || a.first == b.second) can_x = true; if (a.second == b.first || a.second == b.second) can_y = true; } if (0) printf( can_x: %d, can_y: %d n , can_x, can_y); return (can_x && !can_y) || (can_y && !can_x); } int main() { cin >> n >> m; while (n--) { pair<int, int> pair; cin >> pair.first >> pair.second; if (pair.first < pair.second) swap(pair.first, pair.second); a_sent.push_back(pair); } while (m--) { pair<int, int> pair; cin >> pair.first >> pair.second; if (pair.first < pair.second) swap(pair.first, pair.second); b_sent.push_back(pair); } for (pair<int, int> a : a_sent) { for (pair<int, int> b : b_sent) { if (a.first == b.first && a.second == b.second) continue; if (a.first == b.second && a.second == b.first) continue; if (a.first != b.first && a.second != b.second && a.first != b.second && a.second != b.first) continue; if (a.first == b.first) vis[a.first]++; if (a.second == b.second) vis[a.second]++; if (a.first == b.second) vis[a.first]++; if (a.second == b.first) vis[a.second]++; a_possible.insert(a); b_possible.insert(b); } } int cnt = 0; for (int i = 1; i <= 9; ++i) { cnt += vis[i] >= 1; if (0) printf( vis[%d] = %d n , i, vis[i]); } if (0) cout << cnt << endl; if (cnt == 1) { for (int i = 1; i <= 9; ++i) { if (vis[i] >= 1) { cout << i << endl; return 0; } } } for (pair<int, int> a : a_possible) { if (!certain(a, b_sent)) { cout << -1 << endl; return 0; } } for (pair<int, int> b : b_possible) { if (!certain(b, a_sent)) { cout << -1 << endl; return 0; } } cout << 0 << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, x, y, z, e, s, max1, max2, max3, max4; cin >> a >> b >> c; x = a + b * c; y = a * (b + c); z = a * b * c; e = (a + b) * c; s = a + b + c; max1 = (x + y + abs(x - y)) / 2; max2 = (max1 + z + abs(max1 - z)) / 2; max3 = (max2 + e + abs(max2 - e)) / 2; max4 = (max3 + s + abs(max3 - s)) / 2; cout << max4 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 10; const int SZ = 2e5 + 10; const int mod = 1e9 + 7; long long read() { long long n = 0; char a = getchar(); bool flag = 0; while (a > 9 || a < 0 ) { if (a == - ) flag = 1; a = getchar(); } while (a <= 9 && a >= 0 ) { n = n * 10 + a - 0 , a = getchar(); } if (flag) n = -n; return n; } int a[SZ], b[SZ], p[SZ], pri[SZ], vis[SZ]; int main() { int n = read(), x = read(); for (int i = 1, j = 0; i < (1 << n); i++) { if (i == x) continue; else { if (x < (1 << n)) { int ii = x ^ i; if (ii < i) a[++a[0]] = i; } else a[++a[0]] = i; } } for (int i = a[0]; i >= 2; i--) a[i] ^= a[i - 1]; printf( %d n , a[0]); for (int i = 1; i <= a[0]; i++) printf( %d , a[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while(t--){ int n; cin >> n; if((n / 2020 > 0) && ((n % 2020) <= (n / 2020))){ cout << YES n ; }else{ cout << NO n ; } } }
|
#include <bits/stdc++.h> using namespace std; const int N = 100; long long f[N + 5][N + 5][N + 5]; long long fac[N + 5], C[N + 5][N + 5]; long long mod; long long dfs(int n, int m, int k) { if (n == 0) return k == 0; if (m == 1) return k == 1 ? fac[n] : 0; if (n == 1) return k == 0; if (2 * k > n + 1) return 0; if (m > n) return k == 0 ? fac[n] : 0; if (f[n][m][k] != -1) return f[n][m][k]; long long ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j <= k; j++) ans = (ans + C[n - 1][i] * dfs(i, m - 1, j) % mod * dfs(n - i - 1, m - 1, k - j) % mod) % mod; return f[n][m][k] = ans; } int main() { memset(f, 0xff, sizeof(f)); int n, m, k; scanf( %d%d%d%lld , &n, &m, &k, &mod); for (int i = 0; i <= N; i++) C[i][0] = C[i][i] = 1; for (int i = 1; i <= N; i++) for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; fac[0] = fac[1] = 1; for (int i = 1; i <= N; i++) fac[i] = fac[i - 1] * i % mod; printf( %lld , dfs(n, m, k)); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 5; int P[N], I[N]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &P[i]); } int id = 1; for (int i = 1; i <= n; i++) { int cur = i; while (I[cur] != id) { I[cur] = id; cur = P[cur]; } id++; printf( %d , cur); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long maxu = 200005; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long i, j, k = 0, n, t = 1, m, l = 0; cin >> t; while (t--) { cin >> n; long long a[n]; long long b[n + 2]; long long cnt = 0; long long idx = -1; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] != i + 1) { if (idx == -1) { idx = i; } b[i] = 0; cnt++; } else b[i] = 1; } if (cnt == 0) { cout << 0 << n ; continue; } if (cnt == n) { cout << 1 << n ; continue; } long long ans = 0; for (i = idx; i <= idx + cnt - 1; i++) { if (b[i] == 0) ans++; } if (ans == cnt) { cout << 1 << n ; } else cout << 2 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, k, op, val1, val2; while (cin >> x >> k) { int mini = 0, maxi = 0; maxi = x - 1; vector<int> T(4005); for (int i = 0; i < k; ++i) { cin >> op; if (op == 2) { cin >> val1; T[val1] = 1; } else { cin >> val1 >> val2; T[val1] = T[val2] = 1; } if (op == 2) maxi--; else maxi -= 2; } T[x] = 1; for (int i = 1; i <= x; ++i) if (T[i] == 0) { int ind; for (int j = i; j <= x; ++j) if (T[j] == 0) ind = j; else break; mini += ((ind - i + 1) - 1) / 2 + 1; i = ind; } cout << mini << << maxi << endl; } }
|
#include <bits/stdc++.h> using namespace std; void file() {} using lli = long long int; using pii = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; void solve() { string s; cin >> s; string res = ; int z = 0, ones = 0, two = s.size(); for (int i = 0; i < s.size(); i++) { int x = s[i] - 0 ; if (x == 1) ones++; if (x == 2 && two == s.size()) two = i; if (x == 0 && two == s.size()) z++; } res += string(z, 0 ); res += string(ones, 1 ); for (int i = two; i < s.size(); i++) { int x = s[i] - 0 ; if (x == 1) continue; res += s[i]; } cout << res << endl; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, ans, m, j, k; string s; cin >> n >> s; ans = 0; char ch; for (i = 25; i >= 0; i--) { ch = i + a ; for (j = 1; j < (long long)s.size(); j++) { if (s[j] == ch and s[j - 1] + 1 == ch) { s.erase(s.begin() + j); ans++; j--; } } for (j = 0; j < (long long)s.size() - 1; j++) { if (s[j] == ch and s[j + 1] + 1 == ch) { s.erase(s.begin() + j); ans++; j -= 2; } } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long ara[20], ara1[20]; for (long long i = 1; i <= 14; i++) { scanf( %I64d , &ara[i]); } long long maxi = 0; long long sum, c; for (long long i = 1; i <= 14; i++) { if (ara[i] == 0) { continue; } long long d = ara[i] / 14; long long e = ara[i] % 14; memset(ara1, 0, sizeof(ara1)); sum = 0, c = 0; if (d > 0) { for (long long j = i + 1;; j++) { if (j > 14) { j = j % 14; if (j == 0) { j = 14; } } if (i == j) { ara1[j] = d; break; } ara1[j] = ara[j] + d; } } for (long long j = i + 1;; j++) { if (j > 14) { j = j % 14; if (j == 0) { j = 14; } } if (d == 0) { ara1[j] = ara[j] + 1; } else { ara1[j] = ara1[j] + 1; } c++; if (c >= e) { break; } } for (int j = 1; j <= 14; j++) { if (ara1[j] % 2 == 0) { sum = sum + ara1[j]; } } if (sum > maxi) { maxi = sum; } } printf( %I64d n , maxi); }
|
#include <bits/stdc++.h> using namespace std; map<int, int> mp; int main() { vector<int> v, v1; long long a, b, c, d, e; cin >> a >> b >> c; for (int i = 0; i < b; i++) { cin >> d; v.push_back(d); } for (int i = 0; i < c; i++) { cin >> e; v1.push_back(e); } for (int i = 1; i <= a; i++) { long long n = 0; for (int j = 0; j < v.size(); j++) { if (mp[v[j]] != 5 and i == v[j]) { cout << 1 << ; n++; mp[v[j]] = 5; break; } } if (n == 0) { for (int j = 0; j < v1.size(); j++) { if (mp[v1[j]] != 5 and i == v1[j]) { cout << 2 << ; mp[v1[j]] = 5; break; } } } } }
|
#include <bits/stdc++.h> using namespace std; const int inf = 2e9; const long long INF = 4e17; const int mod = 1e9 + 7; const double eps = 1e-9; const int N = 2e5 + 10; long long n, arr[N], tree[N << 2], lazy[N << 2]; void build(int node = 1, int L = 1, int R = n) { if (L == R) { tree[node] = arr[L]; lazy[node] = 0; return; } int mid = (L + R) >> 1, lc = node << 1, rc = lc | 1; build(lc, L, mid), build(rc, mid + 1, R); tree[node] = tree[lc] + tree[rc]; } void set0(int l, int r, int node = 1, int L = 1, int R = n) { if (r < L || R < l || r < l) return; if (l <= L && R <= r) { tree[node] = 0; lazy[node] = 1; return; } int mid = (L + R) >> 1, lc = node << 1, rc = lc | 1; if (lazy[node]) return; set0(l, r, lc, L, mid), set0(l, r, rc, mid + 1, R); tree[node] = tree[lc] + tree[rc]; } void upd(int pos, int v, int node = 1, int L = 1, int R = n) { if (L == R) { tree[node] += v; return; } int mid = (L + R) >> 1, lc = node << 1, rc = lc | 1; if (pos <= mid) upd(pos, v, lc, L, mid); else upd(pos, v, rc, mid + 1, R); tree[node] = tree[lc] + tree[rc]; } long long getsum(int l, int r, int node = 1, int L = 1, int R = n) { if (r < L || R < l) return 0; if (l <= L && R <= r) return tree[node]; if (lazy[node]) return 0; int mid = (L + R) >> 1, lc = node << 1, rc = lc | 1; return getsum(l, r, lc, L, mid) + getsum(l, r, rc, mid + 1, R); } long long getcap(int pos, int node = 1, int L = 1, int R = n) { if (L == R) return tree[node]; if (lazy[node]) return 0; int mid = (L + R) >> 1, lc = node << 1, rc = lc | 1; if (pos <= mid) return getcap(pos, lc, L, mid); return getcap(pos, rc, mid + 1, R); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &arr[i]); int m; scanf( %d , &m); build(); while (m--) { long long t, x, p, k; scanf( %lld , &t); if (t == 1) { scanf( %lld %lld , &p, &x); long long cap = getcap(p); if (cap > x) { if (!1) cout << no overflow decrease << x << from cap n ; upd(p, -x); if (!1) cout << at << p << now << getcap(p) << n ; } else { long long got = 0; int lo = p, hi = n, pos = n + 1; while (lo <= hi) { int mid = (lo + hi) >> 1; got = getsum(p, mid); if (!1) cout << from << p << -> << mid << sum << got << n ; if (got >= x) hi = mid - 1, pos = mid; else lo = mid + 1; } long long usedup = getsum(p, pos - 1); if (!1) cout << overflow ends at << pos << and used up << usedup << out of << x << n ; upd(pos, usedup - x); if (!1) cout << set 0 to all in << p << -> << pos - 1 << n ; set0(p, pos - 1); } } else { scanf( %lld , &k); if (!1) cout << found << getcap(k) << amount left n ; printf( %lld n , arr[k] - getcap(k)); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; string strA, strB, strAux; char aux; int main() { cin >> strA; cin >> strAux; aux = strAux[1]; strAux[1] = strAux[0]; strAux[0] = aux; strA += strAux; cin >> strB; cin >> strAux; aux = strAux[1]; strAux[1] = strAux[0]; strAux[0] = aux; strB += strAux; strA.erase(strA.find( X ), 1); strB.erase(strB.find( X ), 1); int posA = strA.find( A ); int posB = strB.find( A ); bool flag = true; for (int i = 0; i < 3; i++) { if (strA[posA] != strB[posB]) { flag = false; break; } posA++; if (posA == 3) { posA = 0; } posB++; if (posB == 3) { posB = 0; } } if (flag) { cout << YES ; } else { cout << NO ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; constexpr static int MAXN = 1e6; int main() { int k, a, b; cin >> k >> a >> b; if (a > b) swap(a, b); int x = a / k; int y = b / k; if (x == 0 && y == 0) { cout << -1 << endl; return 0; } if (x == 0 && b % k > 0) { cout << -1 << endl; return 0; } cout << x + y << endl; }
|
#include <bits/stdc++.h> using namespace std; int t; long long l, r; inline void solve() { cin >> t; while (t--) { cin >> l >> r; long long ans = l; for (int i = 0; i <= 62; ++i) { if (ans + (1ll << i) <= r && (ans & (1ll << i)) == 0) { ans += (1ll << i); } } cout << ans << endl; } } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); set<int> a; int n, t; cin >> n; while (n--) { cin >> t; a.insert(t); } cout << ((a.count(0) == 1) ? a.size() - 1 : a.size()); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n; long long a[1005]; long long fac[1000005]; long long ppow(long long a, long long b) { long long c = 1; while (b) { if (b & 1) c = c * a % 1000000007; a = a * a % 1000000007; b >>= 1; } return c; } long long work(long long m, long long i) { return ((fac[m] % 1000000007) * (ppow((fac[i] * fac[m - i]) % 1000000007, 1000000007 - 2) % 1000000007)) % 1000000007; } int main() { long long i, j, k; fac[0] = 1; for (int i = 1; i < 1000005; i++) { fac[i] = (fac[i - 1] * i) % 1000000007; } long long ans = 1, sum = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; } for (int i = n; i >= 1; i--) { ans *= work(sum - 1, a[i] - 1); ans %= 1000000007; sum -= a[i]; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; struct city { int x, y, p; double dis; } t[1010]; int cmp(city a, city b) { return a.dis < b.dis; } int main() { int s, n, i; while (scanf( %d%d , &n, &s) > 0) { for (i = 0; i < n; i++) { scanf( %d%d%d , &t[i].x, &t[i].y, &t[i].p); t[i].dis = sqrt(t[i].x * t[i].x + t[i].y * t[i].y); } sort(t, t + n, cmp); double ans; for (i = 0; i < n; i++) { s += t[i].p; if (s >= 1e6) { ans = t[i].dis; break; } } if (i == n) { printf( -1 n ); continue; } printf( %lf n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007LL; int n, m; int a[100005]; int main() { unordered_map<int, long long> cnt1; unordered_map<int, long long> cnt2; cnt1.clear(); cnt2.clear(); cin >> n >> m; bool isone = false; for (int i = 1; i <= m; ++i) { cin >> a[i]; if (a[i] == 1) isone = true; } if (n == 1) { if (isone) cout << 0 << endl; else cout << 1 << endl; return 0; } for (int i = m; i >= 1; --i) { cnt1[a[i] - i] = cnt1[a[i] - i - 1] + 1; cnt2[a[i] + i] = cnt2[a[i] + i + 1] + 1; } long long tot = 0LL; for (int i = 1; i <= n; ++i) { long long rn = min((long long)(n - i), max((long long)m + 1 - cnt1[i], 0LL)); long long ln = min((long long)(i - 1), max((long long)m + 1 - cnt2[i], 0LL)); tot += ln + rn + 1; } cout << tot << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, x, y; cin >> n; cin >> x >> y; if (x + y <= n + 1) { cout << white ; } else { cout << black ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; string Decod, s; cin >> n >> s; int i = 0; while (n) { if (n % 2 != 0) { Decod += s[i]; } else { Decod = s[i] + Decod; } n = n - 1; i++; } cout << Decod << endl; }
|
#include <bits/stdc++.h> using namespace std; void rwFile() { freopen( INP.inp , r , stdin); freopen( OUT.out , w , stdout); } void solveB_MakeThemOdd() { int t; cin >> t; while (t--) { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n, greater<int>()); map<int, int> M; for (int i = 0; i < n; i++) { while (arr[i] % 2 == 0) { if (M[arr[i]] == 1) break; if (M[arr[i]] == 0) M[arr[i]] = 1; arr[i] /= 2; } } int res = 0; for (auto i : M) res++; cout << res << n ; } } void solveC_EveryoneIsAWinner() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> res; int i = 1; while (i <= n) { int x = n / i; res.push_back(x); i = n / x + 1; } cout << res.size() + 1 << n ; cout << 0 ; for (int j = res.size() - 1; j >= 0; j--) cout << res[j] << ; cout << n ; } } void solveA_TilePainting() { long long n; cin >> n; long long res = n; for (int i = 2; i <= 1e6 + 5; i++) { if (n % i == 0) { while (n % i == 0) n /= i; res = i; break; } } if (res == n) { cout << res; return; } if (n == 1) cout << res; else cout << 1; } void solveA_BearAndPoker() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; while (arr[i] % 2 == 0) arr[i] /= 2; while (arr[i] % 3 == 0) arr[i] /= 3; } int able = 1; for (int i = 1; i < n; i++) { if (arr[i] != arr[i - 1]) { able = 0; break; } } if (able) cout << Yes ; else cout << No ; } void solveC_NewYearAndTheSphereTransmission() { long long n; cin >> n; vector<long long> res; for (int i = 1; i * i <= n; i++) { if (n % i == 0) { long long tmp = (n / i + 1) * (n + 2) / 2 - n - 1; res.push_back(tmp); if (i * i != n) { int j = n / i; tmp = (n / j + 1) * (n + 2) / 2 - n - 1; res.push_back(tmp); } } } sort(res.begin(), res.end()); for (long long i : res) cout << i << ; } int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); solveC_NewYearAndTheSphereTransmission(); }
|
#include <bits/stdc++.h> using namespace std; template <typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S>& p) { return os << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& os, vector<T> const& x) { os << { ; for (auto& y : x) os << y << ; return os << } ; } template <class T> ostream& operator<<(ostream& os, set<T> const& x) { os << { ; for (auto& y : x) os << y << ; return os << } ; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& v) { os << [ ; typename multiset<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename F, typename S> ostream& operator<<(ostream& os, const map<F, S>& v) { os << [ ; typename map<F, S>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } string s[200]; vector<pair<int, int> > ans; void cng(int x1, int y1, int x2, int y2, int x3, int y3) { s[x1][y1] = s[x1][y1] == 1 ? 0 : 1 ; s[x2][y2] = s[x2][y2] == 1 ? 0 : 1 ; s[x3][y3] = s[x3][y3] == 1 ? 0 : 1 ; ans.push_back({x1, y1}); ans.push_back({x2, y2}); ans.push_back({x3, y3}); } void _main_main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; ans.clear(); for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m - 1; j++) { if (s[i][j] == 1 ) cng(i, j, i, j + 1, i + 1, j); } if (s[i][m - 1] == 1 ) cng(i, m - 1, i + 1, m - 1, i + 1, m - 2); } for (int j = 0; j < m - 2; j++) { if (s[n - 2][j] == 1 ) cng(n - 2, j, n - 2, j + 1, n - 1, j + 1); if (s[n - 1][j] == 1 ) cng(n - 1, j, n - 2, j + 1, n - 1, j + 1); } int j = m - 2; while (1) { int cnt = 0; if (s[n - 2][j] == 1 ) cnt++; if (s[n - 2][j + 1] == 1 ) cnt++; if (s[n - 1][j] == 1 ) cnt++; if (s[n - 1][j + 1] == 1 ) cnt++; if (cnt == 0) break; else if (cnt == 1) { if (s[n - 2][j] == 1 ) cng(n - 2, j, n - 2, j + 1, n - 1, j); else if (s[n - 2][j + 1] == 1 ) cng(n - 2, j, n - 2, j + 1, n - 1, j); else if (s[n - 1][j] == 1 ) cng(n - 2, j, n - 2, j + 1, n - 1, j); else if (s[n - 1][j + 1] == 1 ) cng(n - 1, j + 1, n - 2, j + 1, n - 1, j); } else if (cnt == 2) { if (s[n - 2][j] == 1 ) cng(n - 1, j + 1, n - 2, j + 1, n - 1, j); else if (s[n - 2][j + 1] == 1 ) cng(n - 2, j, n - 1, j + 1, n - 1, j); else if (s[n - 1][j] == 1 ) cng(n - 2, j, n - 2, j + 1, n - 1, j + 1); else if (s[n - 1][j + 1] == 1 ) cng(n - 2, j, n - 2, j + 1, n - 1, j); } else if (cnt == 3) { if (s[n - 2][j] == 0 ) cng(n - 1, j + 1, n - 2, j + 1, n - 1, j); else if (s[n - 2][j + 1] == 0 ) cng(n - 2, j, n - 1, j + 1, n - 1, j); else if (s[n - 1][j] == 0 ) cng(n - 2, j, n - 2, j + 1, n - 1, j + 1); else if (s[n - 1][j + 1] == 0 ) cng(n - 2, j, n - 2, j + 1, n - 1, j); } else { cng(n - 2, j, n - 2, j + 1, n - 1, j); } } cout << ans.size() / 3 << endl; int cnt = 0; for (auto i : ans) { cnt++; cout << i.first + 1 << << i.second + 1 << ; if (cnt == 3) { cnt = 0; cout << endl; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int testCase = 1; cin >> testCase; for (int i = 0; i < testCase; i++) { _main_main(); } }
|
#include <bits/stdc++.h> using namespace std; int c[100001], l[100001], r[100001], vis[100001], a[100001]; int f(int o, int ll, int rr) { if (!~o) return rr - ll + 1; int x = lower_bound(a + ll, a + rr + 1, c[o]) - a, y = x - 1; while (y < rr && a[y + 1] == c[o]) y++; return f(l[o], ll, x - 1) + f(r[o], y + 1, rr); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d%d , c + i, l + i, r + i), vis[l[i]] = vis[r[i]] = 1, a[++a[0]] = c[i]; int o; for (int i = 1; i <= n; i++) if (!vis[i]) o = i; sort(a + 1, a + n + 1); printf( %d , f(o, 1, n)); }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> A[105]; vector<int> ans; int main() { int n, days; cin >> n >> days; for (int i = 0; i < n; i++) scanf( %d , &A[i].first), A[i].second = i; sort(A, A + n); for (int i = 0; i < n; i++) { if (days < A[i].first) break; ans.push_back(A[i].second + 1); days -= A[i].first; } sort(ans.begin(), ans.end()); cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { if (i) printf( ); printf( %d , ans[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 200000; int ans[MAX_N + 5]; int main() { int tc; cin >> tc; while (tc--) { int n, i, j; string s; cin >> n >> s; int num = n, last = 0; for (i = 0; i < n; i++) { if (i == n - 1 || s[i] == > ) { for (j = i; j >= last; j--) ans[j] = num--; last = i + 1; } } for (i = 0; i < n; i++) cout << ans[i] << (i == n - 1 ? n : ); num = 1, last = 0; for (i = 0; i < n; i++) { if (i == n - 1 || s[i] == < ) { for (j = i; j >= last; j--) ans[j] = num++; last = i + 1; } } for (i = 0; i < n; i++) cout << ans[i] << (i == n - 1 ? n : ); } }
|
#include <bits/stdc++.h> using namespace std; int ar[50][50]; int n; int check(int r, int c) { int v = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ar[r][i] + ar[j][c] == ar[r][c]) { return 1; } } } return 0; } int main() { cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cin >> ar[i][j]; } int flag = 1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ar[i][j] != 1) { flag = flag && check(i, j); } if (!flag) { break; } } if (!flag) { break; } } if (flag) { cout << Yes << endl; } else { cout << No << endl; } }
|
#include <bits/stdc++.h> using namespace std; int A[110]; int main() { int n, k, x; cin >> n >> k >> x; for (int i = 0; i < n; i++) { cin >> A[i]; } int ans = 0; for (int i = 0; i < n - k; i++) { ans += A[i]; } ans += (k * x); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 5005; long long n, m, dp[N]; char s[N]; inline long long read() { long long ret = 0, f = 0; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = 1; c = getchar(); } while (isdigit(c)) { ret = ret * 10 + c - 48; c = getchar(); } if (f) return -ret; return ret; } long long lowbit(long long x) { return x & -x; } signed main() { scanf( %s , s + 1); n = strlen(s + 1); m = log2(n); for (long long i = 0; i < (1 << m); i++) dp[i] = 1; for (long long i = 1; i <= n - (1 << m) + 1; i++) { char mi = z ; for (long long j = 0; j < (1 << m); j++) if (dp[j]) mi = min(mi, s[i + j]); for (long long j = 0; j < (1 << m); j++) dp[j] &= (s[i + j] == mi); for (long long j = 0; j < (1 << m); j++) if (dp[j]) for (long long k = 0; k < m; k++) dp[j | (1 << k)] = 1; putchar(mi); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool comp(long long x, long long y) { if (x >= y) return true; return false; } bool compare(const pair<long long, long long> &i, const pair<long long, long long> &j) { return i.first <= j.first; } bool compare1(const pair<long long, long long> &i, const pair<long long, long long> &j) { return i.first > j.first; } string decitobinary(long long n, long long bit) { char c[bit]; memset(c, 0 , sizeof(c)); long long i = 0; while (n > 0) { c[i] = n % 2 + 48; n = n / 2; i++; } string s = ; for (long long j = bit - 1; j >= 0; j--) s += c[j]; return s; } long long binarytodeci(string n) { string num = n; long long dec_value = 0; long long base = 1; long long len = num.length(); for (long long i = len - 1; i >= 0; i--) { if (num[i] == 1 ) dec_value += base; base = base * 2; } return dec_value; } double intlog(double base, double x) { return (log(x) / log(base)); } long long fact(long long n) { long long res = 1; for (long long i = 2; i <= n; i++) res = res * i; return res; } long long ncr(long long n, long long k) { long long res = 1; if (k > n - k) k = n - k; for (long long i = 0; i < k; ++i) { res *= (n - i); res /= (i + 1); } return res; } bool ispalindrome(string str, long long l, long long h) { while (h > l) { if (str[l++] != str[h--]) return 0; } return 1; } long long compute_hash(string s) { long long p = 31, hash = 0, po = 1; for (char c : s) { hash += (c - a + 1) * po % 1000000007; po = (po * p) % 1000000007; } return hash; } vector<vector<long long>> group_identical_strings(vector<string> const &s) { long long n = s.size(); vector<pair<long long, long long>> hashes(n); for (long long i = 0; i < n; i++) hashes[i] = {compute_hash(s[i]), i}; sort(hashes.begin(), hashes.end()); vector<vector<long long>> groups; for (long long i = 0; i < n; i++) { if (i == 0 || hashes[i].first != hashes[i - 1].first) groups.emplace_back(); groups.back().push_back(hashes[i].second); } return groups; } bool isarraysort(long long a[], long long i, long long j) { if (j == i) return 1; if (a[j] < a[j - 1]) return 0; return isarraysort(a, i, j - 1); } void sieve(long long n, long long prime[]) { for (long long i = 1; i <= n; i++) prime[i] = 1; for (long long p = 2; p * p <= n; p++) { if (prime[p] == 1) { for (long long i = p * p; i <= n; i += p) prime[i] = 0; } } } bool isprime(long long n) { for (long long i = 2; i * i <= n; i++) { if (n % i == 0) return 0; } return 1; } long long pow_mod(long long base, long long exp) { long long res = 1; while (exp > 0) { if (exp % 2 == 1) res = (res * base) % 1000000007; exp = exp >> 1; base = (base * base) % 1000000007; } return res; } const long long N = 1e6 + 3; vector<vector<long long>> adj; bool visited[N]; long long depth[N] = {0}; long long size[N] = {0}; long long parent[N]; void dfs(long long v) { visited[v] = true; for (long long u : adj[v]) { if (!visited[u]) { dfs(u); } } } long long time_in[N], time_out[N]; long long dfs_timer = 0; long long color[N]; void dfs_time(long long v) { time_in[v] = ++dfs_timer; color[v] = 1; for (long long u : adj[v]) { if (color[u] == 0) { dfs_time(u); } } color[v] = 2; time_out[v] = ++dfs_timer; } long long count1[N]; void numberOfNodes(long long s) { count1[s] = 1; for (long long u : adj[s]) { if (u == parent[s]) continue; numberOfNodes(u); count1[s] += count1[u]; } } long long call(long long a[], long long x, long long y) { long long mxi = x; long long mx = a[x]; for (long long i = x + 1; i <= y; i++) { if (a[i] > mx) { mx = a[i]; mxi = i; } } return mxi; } void solve(long long countu) { long long n; cin >> n; long long x[n], y[n]; long long cnt[100001] = {0}; for (long long i = 0; i < n; i++) { cin >> x[i] >> y[i]; cnt[x[i]]++; } for (long long i = 0; i < n; i++) cout << n - 1 + cnt[y[i]] << << n - 1 - cnt[y[i]] << n ; } int32_t main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1, countu = 1; while (t--) { solve(countu); countu++; } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; vector<int> sosedi[maxn]; int parent[maxn], shagi[maxn], start[maxn], finish[maxn], n; void dfs(int v, int predok) { parent[v] = predok; shagi[v] = shagi[predok] + 1; for (auto p : sosedi[v]) if (p != predok) dfs(p, v); } vector<int> circles; int rt, lp, lq; bool find_circle() { circles.clear(); static bool visit_vertex[maxn]; int p = 0; for (int i = 1; i <= n; i++) if (start[i] != finish[i] && shagi[i] > shagi[p]) p = i; if (!p) return 1; for (int u = p; visit_vertex[u] = 1, circles.push_back(u), start[parent[u]] != finish[parent[u]]; u = parent[u]) ; int q = 0; for (int i = 1; i <= n; i++) if (start[i] != finish[i] && !visit_vertex[i] && shagi[i] > shagi[q]) q = i; if (q) { reverse(circles.begin(), circles.end()); for (int u = q; visit_vertex[u] = 1, circles.push_back(u), start[parent[u]] != finish[parent[u]]; u = parent[u]) ; } else q = parent[circles.back()]; for (int i = 1; i <= n; i++) if (start[i] != finish[i] && !visit_vertex[i]) return 0; int u, v; for (u = p, v = q; u != v; u = parent[u]) if (shagi[u] < shagi[v]) swap(u, v); rt = u; if (circles.size() != shagi[p] + shagi[q] - 2 * shagi[rt]) return 0; lp = p, lq = q; return 1; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> start[i]; } for (int i = 1; i <= n; i++) { cin >> finish[i]; } for (int i = 1, u, v; i < n; i++) { cin >> u >> v; sosedi[u].push_back(v), sosedi[v].push_back(u); } int pa = find(start + 1, start + n + 1, 0) - start, pb = find(finish + 1, finish + n + 1, 0) - finish; shagi[0] = -1; dfs(pb, 0); for (int u = pa; u != pb; u = parent[u]) swap(start[u], start[parent[u]]); long long ans = shagi[pa]; if (!find_circle()) { printf( -1 n ); return 0; } if (!circles.size()) { printf( 0 %d n , ans); return 0; } int gap = 0, len = circles.size(); for (int i = 0; i < len; i++) if (finish[circles[i]] == start[circles[0]]) gap = i; for (int i = 1; i < len; i++) if (finish[circles[(i + gap) % len]] != start[circles[i]]) { printf( -1 n ); return 0; } static bool visit_vertex[maxn]; for (int i = pa; i; i = parent[i]) visit_vertex[i] = 1; if (visit_vertex[circles[0]] || visit_vertex[circles.back()]) { int po = circles.size(); for (int i = 0; i < circles.size(); i++) if (!visit_vertex[circles[i]]) { po = i; break; } ans = ans - po + min(po + gap * 1ll * (len + 1), abs((len - gap) * 1ll * (len + 1) - po)); } else ans = (ans + min(gap, len - gap) * 1ll * (len + 1)); for (; !visit_vertex[rt]; rt = parent[rt]) ans += 2; if (lp > lq) swap(lq, lp); printf( %d %d %lld n , lp, lq, ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool home = 1; signed realMain(); signed main() { home = 0; if (home) { freopen( tony_stark , r , stdin); } else { ios::sync_with_stdio(0); cin.tie(0); } realMain(); } const int N = 100000 + 7; int n, k; long long sol[N]; vector<int> co; struct pt { int x, y; } a[N]; bool operator<(pt a, pt b) { return a.y < b.y; } struct upd { int rw; int l, r; int sgn; }; bool operator<(upd a, upd b) { return a.rw < b.rw; } int fnd(int x) { int l = 0, r = (int)co.size() - 1; while (l <= r) { int m = (l + r) / 2; if (co[m] == x) return m; if (co[m] < x) l = m + 1; else r = m - 1; } assert(0); } signed realMain() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { int go = a[i].y - k + 1; if (!co.empty() && go <= co.back()) go = co.back() + 1; for (int j = go; j <= a[i].y; j++) co.push_back(j); } vector<upd> evs; for (int i = 1; i <= n; i++) { int lft = a[i].y - k + 1, rgh = a[i].y; int l = fnd(lft), r = fnd(rgh); evs.push_back({a[i].x - k + 1, l, r, +1}); evs.push_back({a[i].x + 1, l, r, -1}); } vector<int> cnt((int)co.size()), utime; swap(utime, co); sort(evs.begin(), evs.end()); int ret = 0; for (auto &it : evs) { int rw = it.rw; int l = it.l; int r = it.r; int sgn = it.sgn; for (int j = l; j <= r; j++) { sol[cnt[j]] += (rw - utime[j]); cnt[j] += sgn; utime[j] = rw; } } for (int j = 1; j <= n; j++) { cout << sol[j] << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } void pre() {} void solve() {} const long long mod = 998244353; long long pw[1000009], a[1000009]; int main() { cin.sync_with_stdio(0); cin.tie(0); cin.exceptions(cin.failbit); pre(); pw[0] = 1; for (int i = 1; i <= (1000000); ++i) pw[i] = pw[i - 1] * 2 % mod; int n; cin >> n; for (int i = 0; i < (n); ++i) cin >> a[i + 1]; long long ans = a[n]; for (int i = 1; i <= (n - 1); ++i) { ans += 1ll * pw[n - i] * a[i] % mod; ans += 1ll * (n - i) * a[i] % mod * pw[n - 1 - i] % mod; } cout << ans % mod; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { char c; bool nega = 0; while ((!isdigit(c = getchar())) && (c != - )) ; if (c == - ) { nega = 1; c = getchar(); } x = c - 48; while (isdigit(c = getchar())) x = x * 10 + c - 48; if (nega) x = -x; } template <typename T> inline void writep(T x) { if (x > 9) writep(x / 10); putchar(x % 10 + 48); } template <typename T> inline void write(T x) { if (x < 0) { putchar( - ); x = -x; } writep(x); putchar( ); } template <typename T> inline void writeln(T x) { write(x); putchar( n ); } template <typename R, typename D> inline void Min(R &a, D b) { if (a > b) a = b; } template <typename D, typename R> inline void Max(D &a, R b) { if (a < b) a = b; } const int N = 10005, M = 300005; bool dd[10]; int T, n; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); cin >> T; while (T--) { cin >> n; if ((n / 2) & 1) { cout << NO n ; continue; } cout << YES n ; for (int i = 1; i <= n / 2; ++i) cout << i * 2 << ; for (int i = 1; i <= n / 2 - 1; ++i) cout << i * 2 - 1 << ; cout << n + n / 2 - 1; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool options(long a, long b) { return a > b; } int main() { long n, i, *arr, *arrSort, *index; map<long, long> res; cin >> n; arr = new long[n]; arrSort = new long[n]; index = new long[n]; for (i = 0; i < n; i++) { cin >> arr[i]; arrSort[i] = arr[i]; } sort(arrSort, arrSort + n, options); for (i = 0; i < n; i++) { index[i] = i + 1; } for (i = 1; i < n; i++) { if (arrSort[i] == arrSort[i - 1]) { index[i] = index[i - 1]; } } for (i = 0; i < n; i++) { res[arrSort[i]] = index[i]; } for (i = 0; i < n; i++) { cout << res[arr[i]] << ; } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.