func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> const long long MAX_N = 450 + 100; const long long MOD = 1e9 + 7; using namespace std; int main() { int n, k; cin >> n >> k; cout << 3 * n + min(k - 1, n - k); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int m, q; int a[3]; string dday; int days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; string tostring(int x) { string temp = ; for (int i = 0; i < 2; i++) { temp = (char)( 0 + x % 10) + temp; x /= 10; } return temp; } bool solve() { sort(a, a + 3); do { if (a[1] > 12) continue; if (a[2] % 4 == 0) { if (a[1] == 2 && a[0] > 29) continue; } else if (a[1] == 2 && a[0] > 28) continue; if (a[1] != 2 && a[0] > days[a[1] - 1]) continue; a[2] += 18; if (a[2] > 100) continue; string temp = tostring(a[2]); temp.push_back( . ); temp += tostring(a[1]); temp.push_back( . ); temp += tostring(a[0]); if (temp <= dday) { return true; } a[2] -= 18; } while (next_permutation(a, a + 3)); return false; } int main() { scanf( %d.%d.%d , &a[0], &a[1], &a[2]); dday = tostring(a[2]); dday.push_back( . ); dday += tostring(a[1]); dday.push_back( . ); dday += tostring(a[0]); scanf( %d.%d.%d , &a[0], &a[1], &a[2]); if (solve()) cout << YES n ; else cout << NO n ; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); if (n == 0) { printf( 1 ); } else if (n % 2 == 0) { if (n % 4 == 0) { printf( 6 ); } else { printf( 4 ); } } else if (n % 2 != 0) { if (n % 4 == 1) { printf( 8 ); } else { printf( 2 ); } } return 0; } |
#include <bits/stdc++.h> #define fi first #define se second #define mp make_pair using namespace std; using ll = long long; using pii = pair<int, int>; constexpr double eps = 1e-8; constexpr int NINF = 0xc0c0c0c0; constexpr int INF = 0x3f3f3f3f; constexpr ll mod = 1e9 + 7; constexpr ll N = 1e6 + 5; int n, a[N], f[N], l[N], r[N], cnt[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (!l[a[i]]) l[a[i]] = i; } for (int i = n; i; i--) { if (!r[a[i]]) r[a[i]] = i; } for (int i = n; i; i--) { cnt[a[i]]++; if (i == l[a[i]]) { f[i] = max(cnt[a[i]] + f[r[a[i]] + 1], f[i + 1]); } else { f[i] = max(cnt[a[i]], f[i + 1]); } } cout << n - f[1] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int ans = 1e9, n, a[2000 + 5], b[2000 + 5], cnt, num[720 + 5], A[6], c[720 + 5][5]; int id[10][10][10][10], f[15000005], q[15000005], top; void dfs(int x, int v) { ++cnt; num[cnt] = x - 1; id[A[1]][A[2]][A[3]][A[4]] = cnt; for (int j = 1; j < x; ++j) c[cnt][j] = A[j]; if (x > 4) return; for (int i = v; i <= 9; ++i) A[x] = i, dfs(x + 1, i); A[x] = 0; } inline int ID(int x, int y, int z) { return x * 720 * 10 + y * 10 + z; } void Try(int x, int y, int z, int v) { int d = ID(x, y, z); if (v < f[d]) f[q[++top] = d] = v; } int main() { dfs(1, 1); memset(f, 40, sizeof(f)); n = read(); for (int i = 1; i <= n; ++i) a[i] = read(), b[i] = read(); f[q[top = 1] = ID(0, id[0][0][0][0], 1)] = 0; for (int i = 1; i <= top; ++i) { int x = q[i] / 720 / 10, y = (q[i] / 10) % 720, z = q[i] % 10, v = f[q[i]]; if (z < 9) Try(x, y, z + 1, v + 1); if (z > 1) Try(x, y, z - 1, v + 1); int nn = 0; for (int j = 1; j <= num[y]; ++j) if (c[y][j] != z) A[++nn] = c[y][j]; for (int j = nn + 1; j <= 4; ++j) A[j] = 0; Try(x, id[A[1]][A[2]][A[3]][A[4]], z, v + (num[y] - nn)); if (x < n && a[x + 1] == z && num[y] < 4) { int nn = 0, k = 1; for (; k <= num[y]; ++k) if (c[y][k] <= b[x + 1]) A[++nn] = c[y][k]; else break; A[++nn] = b[x + 1]; for (; k <= num[y]; ++k) A[++nn] = c[y][k]; while (nn < 4) A[++nn] = 0; Try(x + 1, id[A[1]][A[2]][A[3]][A[4]], z, v + 1); } } for (int i = 1; i <= 9; ++i) ans = min(ans, f[ID(n, id[0][0][0][0], i)]); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int oo = 1e9 + 5; const int N = 1e6 + 5; long long ans = 0; int main() { int n; cin >> n; int a[n + 1]; for (int(i) = (0); (i) < (n); i++) { cin >> a[i]; } sort(a, a + n); int x; x = (n - 1) / 2; cout << a[x]; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int n; cin >> n; int a[n]; bool ok = true; bool f = true; for (int i = 0; i < n; i++) { cin >> a[i]; if (!ok) continue; if (f && a[i] < i) { f = false; } if (!f && a[i] < n - i - 1) ok = false; } if (n % 2 == 0 && a[n / 2] == (n / 2 - 1) && a[n / 2 - 1] == (n / 2 - 1)) ok = false; if (ok) cout << Yes n ; else cout << No n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<char, int> mp1; int main() { ios_base::sync_with_stdio(0); string s, p, q; long long int a, b, c, d, i, j, k, u, v, w = 0, x, y, z; cin >> p; for (i = 0; i < p.length(); i++) mp1[p[i]] = 1; cin >> s; cin >> k; while (k--) { w = 0; cin >> q; if (s.length() > q.length() + 1) { cout << NO << endl; continue; } for (i = 0; i < q.length() && i < s.length(); i++) { if (q[i] == s[i]) continue; if (s[i] == ? && mp1[q[i]] == 1) continue; if (s[i] == * ) { w = 1; v = s.length() - 1; for (u = q.length() - 1; v > i && u >= i; u--, v--) { if (q[u] == s[v]) continue; if (s[v] == ? && mp1[q[u]] == 1) continue; break; } } else { cout << NO << endl; w = -1; break; } if (v != i) { w = -1; cout << NO << endl; break; } for (j = u; j >= i; j--) { if (mp1[q[j]] == 0) continue; break; } if (j >= i) { w = -1; cout << NO << endl; break; } i = q.length() - 1; } if (w == -1) continue; if (i != q.length()) { cout << NO << endl; continue; } if (s.length() == q.length() + 1 && w == 0 && s[q.length()] != * ) { cout << NO << endl; continue; } cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 7; const long long MOD = 1e9 + 7; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool umod(T& a, T b) { a += b; while (a < 0) a += MOD; a %= MOD; return 1; } int las, n, cur, cost[N], m, cst; vector<int> v[N]; vector<long long> par[N]; long long ans; void merge(int x) { v[x].push_back(0); int l = x * 2, r = x * 2 + 1; int a = 0, b = 0; while (a < int(v[l].size()) && b < int(v[r].size())) { if (v[l][a] + cost[l] <= v[r][b] + cost[r]) v[x].push_back(v[l][a] + cost[l]), a++; else v[x].push_back(v[r][b] + cost[r]), b++; } while (a < int(v[l].size())) v[x].push_back(v[l][a] + cost[l]), a++; while (b < int(v[r].size())) v[x].push_back(v[r][b] + cost[r]), b++; par[x].push_back(0LL); for (int i = 1; i < int(v[x].size()); i++) par[x].push_back(par[x][i - 1] + v[x][i]); } void dfs(int x) { if (x > n) return; dfs(x * 2); dfs(x * 2 + 1); merge(x); } long long get(int x, int y) { if (x > n || y <= 0) return 0; int ind = upper_bound(v[x].begin(), v[x].end(), y) - v[x].begin(); return 0LL + (1LL * ind * y) - par[x][ind - 1]; } int main() { scanf( %d%d , &n, &m); for (int i = 2; i <= n; i++) scanf( %d , &cost[i]); dfs(1); while (m--) { int aa, bb; scanf( %d%d , &aa, &bb); las = -1, cur = aa, ans = 0, cst = bb; while (las != 1 && cst > 0) { if (las != cur * 2) ans += get(cur * 2, cst - cost[cur * 2]); if (las != cur * 2 + 1) ans += get(cur * 2 + 1, cst - cost[cur * 2 + 1]); ans += cst; cst -= cost[cur]; las = cur; cur /= 2; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int a[maxn], x[maxn], y[maxn], sk[maxn], top, cnt; int main() { int n, P, ly = -1, fl = 0; scanf( %d , &n), P = n; for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = n; i >= 1; i--) { if (a[i] == 1) { sk[++top] = x[++cnt] = P--; y[cnt] = i; if (!fl) ly = i; } else if (a[i] == 2) { if (top <= 0) return puts( -1 ), 0; x[++cnt] = sk[top--]; y[cnt] = i; if (!fl) ly = i; P = min(P, x[cnt] - 1); } else if (a[i] == 3) { if (ly == -1) return puts( -1 ), 0; x[++cnt] = P; y[cnt] = ly; x[++cnt] = P; y[cnt] = ly = i; if (!fl) top--; fl = 1; P--; } } printf( %d n , cnt); for (int i = 1; i <= cnt; i++) printf( %d %d n , x[i], y[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { double x, y; }; int main() { point p; double a, b, c, d; point v; scanf( %lf%lf%lf%lf%lf%lf%lf%lf , &p.x, &p.y, &v.x, &v.y, &a, &b, &c, &d); double lenth = sqrt(v.x * v.x + v.y * v.y); v.x /= lenth; v.y /= lenth; a /= 2; c /= 2; point q; q.x = p.x + v.x * b; q.y = p.y + v.y * b; printf( %.10f %.10f n , q.x, q.y); q.x = p.x - v.y * a; q.y = p.y + v.x * a; printf( %.10f %.10f n , q.x, q.y); q.x = p.x - v.y * c; q.y = p.y + v.x * c; printf( %.10f %.10f n , q.x, q.y); point w; w.x = q.x - v.x * d; w.y = q.y - v.y * d; printf( %.10f %.10f n , w.x, w.y); q.x = w.x + v.y * c * 2; q.y = w.y - v.x * c * 2; printf( %.10f %.10f n , q.x, q.y); q.x = p.x + v.y * c; q.y = p.y - v.x * c; printf( %.10f %.10f n , q.x, q.y); q.x = p.x + v.y * a; q.y = p.y - v.x * a; printf( %.10f %.10f n , q.x, q.y); return 0; } |
#include <bits/stdc++.h> using namespace std; long long N, M, K, R, l, r, A, B, X, Y, Z, C, D, Q, a, b, c, d, i, j, k, first, mx, ans, cnt, T, P; void solve() { cin >> N >> K; long long A[N]; long long lar = INT_MIN, sma = INT_MAX; for (long long int i = 0; i < N; i++) { cin >> A[i]; lar = max(lar, A[i]); sma = min(sma, A[i]); } for (long long int i = 0; i < N; i++) { A[i] = lar - A[i]; } if (K % 2 == 0) { for (long long int i = 0; i < N; i++) { A[i] = lar - sma - A[i]; } } for (long long int i = 0; i < N; i++) { cout << A[i] << ; } cout << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mini(long long a, long long b) { if (a < b) return a; return b; } int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); reverse(a.begin(), a.end()); for (int i = 1; i < n; ++i) a[i] += a[i - 1]; vector<long long> odp(n, 0); for (int i = 1; i <= n - 1; ++i) { for (long long il = 1, pos = 0, w = 0; pos < n; pos += il, il *= i, ++w) { odp[i] += w * a[mini(n - 1, pos + il - 1)]; if (pos != 0) odp[i] -= w * a[pos - 1]; } } int q; cin >> q; for (int i = 0; i < q; ++i) { int k; cin >> k; k = mini(k, n - 1); cout << odp[k] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const long long INFLL = 2e18; const int MOD = 1e8 + 7; const int N = 4e5 + 10; int fx[8] = {+0, +0, +1, -1, +1, +1, -1, -1}; int fy[8] = {+1, -1, +0, +0, +1, -1, +1, -1}; int timer; int used[N]; int tin[N], low[N]; char bridge; vector<int> g[N]; void dfsAP(int v, int p = -1) { if (bridge) return; used[v] = 1; tin[v] = low[v] = ++timer; for (int to : g[v]) { if (p == to) continue; if (!used[to]) { dfsAP(to, v); low[v] = min(low[v], low[to]); if (tin[v] < low[to]) bridge = 1; } else { low[v] = min(low[v], tin[to]); } } used[v] = 2; } void dfsCC(int v, int p = -1) { used[v] = 1; for (int to : g[v]) { if (p == to) continue; if (!used[to]) { dfsCC(to, v); printf( %d %d n , v, to); } else if (used[to] == 1) { printf( %d %d n , v, to); } } used[v] = 2; } void solve(int n) { dfsAP(1); if (bridge) { puts( 0 ); return; } fill(used, used + n + 1, 0); dfsCC(1); } int main() { int n, m, u, v; scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) { scanf( %d %d , &u, &v); g[u].push_back(v); g[v].push_back(u); } solve(n); } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int a, b, c; cin >> a >> b >> c; int sum1 = a + b; int cnt = 0; while (sum1 <= c) { if (a > b) swap(a, b); a += b; cnt++; sum1 += b; } cout << cnt + 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int g[100000]; int res[100000]; int main() { int N; scanf( %d , &N); ; g[0] = 0; g[1] = 0; res[0] = res[1] = -1; for (int(n) = 2; n < (int)N + 1; n++) { set<int> s; vector<int> v; for (int i = 2; i * i <= 2 * n; i++) { if ((2 * n) % i == 0) { v.push_back(i); v.push_back((2 * n) / i); } } res[n] = -1; for (__typeof(v).begin() it = v.begin(); it != v.end(); it++) { int help = 2 * n / (*it) + *it - 1; if (help % 2 == 0 && help / 2 >= *it && help / 2 < n) { int num = 0; for (int m = 0; m < *it; m++) { num = num ^ g[help / 2 - m]; } if (num == 0) { res[n] = res[n] == -1 ? *it : min(res[n], *it); } s.insert(num); } } int sol = 0; while (s.find(sol) != s.end()) { sol++; } g[n] = sol; } if (g[N] == 0) { puts( -1 ); } else { printf( %d n , res[N]); } } |
// // main.cpp // D - Epic Transformation // // Created by LiZnB on 2021/3/25. // #include <cstdio> #include <cstring> #include <algorithm> #define ls tree[pos].l #define rs tree[pos].r using namespace std; const int INF = 0x3f3f3f3f; const int N = 200000 + 10; int arr[N]; struct Node { int l, r; long long val; int real; }; Node max(Node a, Node b) { if (a.val > b.val) return a; return b; } struct Tree { Node tree[N * 4]; void Built(int L, int R, int pos) { ls = L; rs = R; if (L == R) { tree[pos].val = arr[L]; tree[pos].real = L; return; } int m = L + (R - L) / 2; Built(L, m, pos << 1); Built(m + 1, R, pos << 1 | 1); if (tree[pos << 1].val > tree[pos << 1 | 1].val) { tree[pos].val = tree[pos << 1].val; tree[pos].real = tree[pos << 1].real; } else { tree[pos].val = tree[pos << 1 | 1].val; tree[pos].real = tree[pos << 1 | 1].real; } } void Modify(int pos, int p, long long val) { if (rs == p && ls == p) { tree[pos].val += val; return; } int m = ls + (rs - ls) / 2; if (p <= m) Modify(pos << 1, p, val); if (p > m) Modify(pos << 1 | 1, p, val); if (tree[pos << 1].val > tree[pos << 1 | 1].val) { tree[pos].val = tree[pos << 1].val; tree[pos].real = tree[pos << 1].real; } else { tree[pos].val = tree[pos << 1 | 1].val; tree[pos].real = tree[pos << 1 | 1].real; } } Node Query(int pos, int L, int R) { if (ls >= L && rs <= R) { return tree[pos]; }; int m = ls + (rs - ls) / 2; Node ans; ans.val = -INF; if (m >= L) { ans = max(Query(pos << 1, L, R), ans); } if (m < R) { ans = max(Query(pos << 1 | 1, L, R), ans); } if (tree[pos << 1].val > tree[pos << 1 | 1].val) { tree[pos].val = tree[pos << 1].val; tree[pos].real = tree[pos << 1].real; } else { tree[pos].val = tree[pos << 1 | 1].val; tree[pos].real = tree[pos << 1 | 1].real; } return ans; } } T; int d[N]; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &d[i]); } sort(d + 1, d + n + 1); int p = 1; arr[1] = 1; for (int i = 2; i <= n; i++) { if (d[i - 1] != d[i]) { p++; arr[p] = 1; } else { arr[p]++; } } T.Built(1, p, 1); int ans = n; for (int i = 1; i <= n; i++) { Node f1 = T.Query(1, 1, p); T.Modify(1, f1.real, -f1.val); Node f2 = T.Query(1, 1, p); T.Modify(1, f1.real, f1.val); if (f1.val == 0 || f2.val == 0) break; T.Modify(1, f1.real, -1); T.Modify(1, f2.real, -1); ans -= 2; } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, type[100001], a[100001], lead[100001], cur[100001]; bool vs[100001]; void input() { scanf( %d , &n); for (int i = 1, _b = n; i <= _b; i++) scanf( %d , &type[i]); int x; memset(lead, 0, sizeof(lead)); memset(a, 0, sizeof(a)); for (int i = 1, _b = n; i <= _b; i++) { scanf( %d , &x); a[x] = i; lead[x]++; } } void dfs(int i) { vs[i] = true; if (type[i]) { cur[i] = 1; return; } if (lead[a[i]] != 1 && !type[a[i]]) return; if (!vs[a[i]]) dfs(a[i]); if (cur[a[i]]) cur[i] = cur[a[i]] + 1; } void process() { memset(vs, false, sizeof(vs)); memset(cur, 0, sizeof(cur)); for (int i = 0, _b = n; i <= _b; i++) if (lead[i] != 1 && !type[i]) vs[i] = true; for (int i = 1, _b = n; i <= _b; i++) { if (!vs[i]) dfs(i); } int ans = 0; int st = 0; for (int i = 1, _b = n; i <= _b; i++) { if (ans < cur[i]) { ans = cur[i]; st = i; } } cout << ans << endl; while (!type[st]) { printf( %d , st); st = a[st]; } cout << st; } int main() { input(); process(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct stra { int x, y, z; } arr[100000]; bool cmp(stra a, stra b) { return a.x > b.x; } bool cmp1(stra a, stra b) { return a.y < b.y; } int n, k = 1, g = 1; int main() { std::ios::sync_with_stdio(false); cin >> n; for (int i = 0; i <= n - 1; i++) { cin >> arr[i].x; arr[i].y = i; } sort(arr, arr + n, cmp); arr[0].z = 1; for (int i = 1; i <= n - 1; i++) { if (arr[i - 1].x != arr[i].x) { k = i + 1; arr[i].z = k; } else { arr[i].z = k; } } sort(arr, arr + n, cmp1); for (int i = 0; i <= n - 1; i++) { cout << arr[i].z << ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long N = 1e6 + 10; const long double eps = 1e-9; const long long inf = 1e18; long long a[N], b[N], c[N], d[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; long long m; cin >> n >> m >> k; long long a[m]; for (long long i = 0; i < m; ++i) cin >> a[i]; long long s = 0, i = 0, j = 0, k1 = k; while (j < m) { while (a[j] <= k1 + i) j++; if (i == j) { s--; k1 = ((a[j] - i) / k) * k; if ((a[j] - i) % k) k1 += k; } i = j; s++; } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; double b[10], a[10], c[10] = {500, 1000, 1500, 2000, 2500}; double Max(double x, double y) { return x > y ? x : y; } int main() { int n, m1, m2, m3, m4, m5, i, j, k; while (~scanf( %lf , &a[0])) { for (i = 1; i < 5; i++) scanf( %lf , &a[i]); for (i = 0; i < 5; i++) scanf( %lf , &b[i]); double ans = 0; for (i = 0; i < 5; i++) { ans += Max(0.3 * c[i], (1 - (a[i] * 1.0 / (250 * 1.0))) * c[i] - 50 * b[i]); } int x, y; scanf( %d %d , &x, &y); ans += x * 100; ans -= y * 50; printf( %.0lf n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void s() { puts( Stannis ); } void d() { puts( Daenerys ); } int main() { int n, k; scanf( %d %d , &n, &k); int odd = 0; int even = 0; long long tot = 0; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); if (x % 2 == 0) even++; else odd++; tot += (long long)x; } int move = n - k; if (n == k) { if (tot % 2LL == 0) { d(); } else { s(); } } else { if (move % 2 == 1) { if (move < odd && move < even) { s(); } else { if (move / 2 >= odd) { d(); } else { if (move / 2 >= even && ((move - even) + odd) % 2 == 0) { d(); } else { s(); } } } } else { if (move < odd && move < even) { d(); } else { if (move / 2 >= even && ((move - even) + odd) % 2 == 1) { s(); } else { d(); } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 201110; int lab[N], val[N]; vector<int> gr[N]; map<string, int> mp; int n, m, q; int root(int u) { if (lab[u] < 0) return u; else return lab[u] = root(lab[u]); } void join(int type, int u, int v) { if (lab[u] < lab[v]) { lab[u] += lab[v]; lab[v] = u; for (int i = 0; i < gr[v].size(); i++) { gr[u].push_back(gr[v][i]); val[gr[v][i]] *= type; } gr[v].clear(); } else { lab[v] += lab[u]; lab[u] = v; for (int i = 0; i < gr[u].size(); i++) { gr[v].push_back(gr[u][i]); val[gr[u][i]] *= type; } gr[u].clear(); } } string read() { char ch; string ans = ; while (ch = getchar()) { if ( a <= ch && ch <= z ) break; } ans = ans + ch; while (ch = getchar()) { if (ch < a || ch > z ) break; ans = ans + ch; } return ans; } int main() { scanf( %d%d%d , &n, &m, &q); int k = 0; string st; int type, u, v; for (int i = 1; i <= n; i++) { val[i] = 1; gr[i].push_back(i); st = read(); mp[st] = i; } memset(lab, 255, sizeof(lab)); for (int i = 1; i <= m; i++) { scanf( %d , &type); st = read(); u = mp[st]; st = read(); v = mp[st]; if (root(u) != root(v)) { if ((val[u] == val[v] && type == 1) || (val[u] != val[v] && type == 2)) join(1, root(u), root(v)); else join(-1, root(u), root(v)); puts( YES ); } else { if ((val[u] != val[v] && type == 1) || (val[u] == val[v] && type == 2)) puts( NO ); else puts( YES ); } } for (int i = 1; i <= q; i++) { st = read(); u = mp[st]; st = read(); v = mp[st]; if (root(u) != root(v)) printf( 3 n ); else { if (val[u] == val[v]) printf( 1 n ); else printf( 2 n ); } } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 50; deque<int> dq; bool is[N], can[N]; vector<vector<int> > adj(N); int n, m, d, cur, mx, ans[N], x; void dfs(int u, int p) { ans[u] = ans[p] + 1; can[u] &= (ans[u] <= d); if (ans[u] > mx && is[u]) mx = ans[u], x = u; for (auto v : adj[u]) if (v != p) dfs(v, u); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> d; ans[0] = -1; memset(can, 1, sizeof can); for (int i = 0; i < m; i++) cin >> x, is[x] = 1; for (int i = 1, u, v; i < n; i++) { cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } dq.push_front(x); while (dq.size()) { int now = dq.front(); dfs(now, 0); dq.pop_front(); if (now != x) dq.push_front(x); } int s = 0; for (int i = 1; i <= n; i++) s += can[i]; cout << s; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 100000; int n; int x[MAXN]; int ret[MAXN]; bool used[MAXN + 1]; void run() { scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &x[i]); memset(ret, -1, sizeof(ret)); memset(used, false, sizeof(used)); for (int i = (0); i < (n); ++i) if (1 <= x[i] && x[i] <= n && !used[x[i]]) ret[i] = x[i], used[x[i]] = true; int at = 1; for (int i = (0); i < (n); ++i) if (ret[i] == -1) { while (used[at]) ++at; ret[i] = at++; } for (int i = (0); i < (n); ++i) { if (i != 0) printf( ); printf( %d , ret[i]); } puts( ); } int main() { run(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, -b); return a * (b / gcd(a, b)); } template <class T> inline T sqr(T x) { return x * x; } template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } long long toInt64(string s) { long long r = 0; istringstream sin(s); sin >> r; return r; } double LOG(long long N, long long B) { return (log10l(N)) / (log10l(B)); } string itoa(long long a) { if (a == 0) return 0 ; string ret; for (long long i = a; i > 0; i = i / 10) ret.push_back((i % 10) + 48); reverse(ret.begin(), ret.end()); return ret; } vector<string> token(string a, string b) { const char *q = a.c_str(); while (count(b.begin(), b.end(), *q)) q++; vector<string> oot; while (*q) { const char *e = q; while (*e && !count(b.begin(), b.end(), *e)) e++; oot.push_back(string(q, e)); q = e; while (count(b.begin(), b.end(), *q)) q++; } return oot; } template <class T> inline T __cin() { T ret; cin >> ret; return ret; } int isvowel(char s) { s = tolower(s); if (s == a || s == e || s == i || s == o || s == u ) return 1; return 0; } int isupper(char s) { if (s >= A and s <= Z ) return 1; return 0; } int Set(int N, int pos) { return N = N | (1 << pos); } int reset(int N, int pos) { return N = N & ~(1 << pos); } int check(int N, int pos) { return (N & (1 << pos)); } int toggle(int N, int pos) { if (check(N, pos)) return N = reset(N, pos); return N = Set(N, pos); } void pbit(int N) { printf( ( ); for (int i = 10; i >= 0; i--) { bool x = check(N, i); cout << x; } puts( ) ); } int main() { int n = 9; cin >> n; long long ans = -1; for (int i = max(n - 100, 1); i <= n; i++) { for (int j = max(n - 100, 1); j <= n; j++) { for (int k = max(n - 100, 1); k <= n; k++) { long long lc = lcm((long long)i, lcm((long long)j, (long long)k)); ans = max(ans, lc); } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, line[35], column[35], var, count; cin >> n; for (i = 1; i <= n; ++i) line[i] = column[i] = 0; for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) { cin >> var; line[i] += var; column[j] += var; } count = 0; for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) { if (column[i] > line[j]) count++; } cout << count; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int N = 1020; int main() { int n; cin >> n; if (n % 2 == 0) { cout << -1 << endl; } else { cout << 0; for (int i = 1; i < n; i++) { cout << << i; } cout << endl; cout << 0; for (int i = 1; i < n; i++) { cout << << i; } cout << endl; cout << 0; for (int i = 1; i < n; i++) { cout << << (i + i) % n; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int min(int a, int b) { if (a <= b) { return a; } else { return b; } } int max(int a, int b) { if (a >= b) { return a; } else { return b; } } int main() { int l, r, a; cin >> l >> r >> a; int MAX, MIN; int count; MAX = max(l, r); MIN = min(l, r); MIN += a; if (MIN > MAX) { count = (2 * MAX) + ((MIN - MAX) / 2) * 2; } else { count = MIN * 2; } cout << count << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int dp[1002][20002]; int main() { ios_base::sync_with_stdio; int n, m, x, y, i, j, a; cin >> n; long long ans = 0; for (i = 1; i <= n; i++) { cin >> a; dp[i][10000 + a]++; dp[i][10000 - a]++; for (j = 0; j < a; j++) { dp[i][j] = dp[i - 1][j + a]; } for (j = 20000; j > 20000 - a; j--) { dp[i][j] = dp[i - 1][j - a]; } for (j = a; j <= 20000 - a; j++) { dp[i][j] = (dp[i - 1][j - a] + dp[i - 1][j + a]) % 1000000007; } dp[i][10000 + a] = (dp[i][10000 + a] + 1) % 1000000007; ; dp[i][10000 - a] = (dp[i][10000 - a] + 1) % 1000000007; ans = (ans + dp[i][10000]) % 1000000007; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 3; int n; vector<int> G[N]; int h[N], cnt[N]; int res = 0; void dfs(int u, int p) { cnt[h[u]]++; for (int v : G[u]) if (v != p) { h[v] = h[u] + 1; dfs(v, u); } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n - 1; ++i) { int x; cin >> x; G[x].push_back(i + 1); } h[1] = 1; dfs(1, 0); for (int i = 1; i <= n; ++i) res += (cnt[i] % 2); cout << res; } |
#include <bits/stdc++.h> using namespace std; inline int Max(int x, int y, int z) { return max(max(x, y), z); } const int N = 100005; int n, m; char s[N]; long long f[N][10]; int st[3], to[3]; long long ans; inline int R(int b, int a[3]) { if (a[1] != b && a[1] != b - 1) return 8; int x = (a[1] < b ? 0 : 1); int y = a[1] - a[0]; if (y != 0 && y != 1) return 8; int z = a[2] - a[1]; if (z != 0 && z != 1) return 8; return x + (y << 1) + (z << 2); } inline void T(int b, int S, int a[3]) { int x = S & 1; int y = S >> 1 & 1; int z = S >> 2 & 1; a[1] = (!x ? b - 1 : b); a[0] = a[1] - y; a[2] = a[1] + z; } inline void G(int b, char c) { to[0] = max(st[1], st[0] + (c == s[b])); to[1] = Max(to[0], st[2], st[1] + (c == s[b + 1])); to[2] = max(to[1], st[2] + (c == s[b + 2])); } int main(void) { scanf( %d %d , &n, &m); scanf( %s , s + 1); if (n <= 1) return printf( %d n , m - 1), 0; if (s[1] == s[2]) { st[0] = 0, st[1] = 0, st[2] = 0, f[1][R(1, st)] = m - 1; st[0] = 0, st[1] = 1, st[2] = 1, f[1][R(1, st)] = 1; } else { st[0] = 0, st[1] = 0, st[2] = 0, f[1][R(1, st)] = m - 2; st[0] = 0, st[1] = 1, st[2] = 1, f[1][R(1, st)] = 1; st[0] = 0, st[1] = 0, st[2] = 1, f[1][R(1, st)] = 1; } for (register int i = (1), _b = (n - 1); i <= _b; i++) for (register int S = (0), _b = (7); S <= _b; S++) if (f[i][S] != 0) { T(i, S, st); for (register int j = (1), _b = (m); j <= _b; j++) { G(i, a + j - 1); f[i + 1][R(i + 1, to)] += f[i][S]; } } for (register int S = (0), _b = (7); S <= _b; S++) if (f[n][S] != 0) { T(n, S, st); if (st[1] == n - 1) ans += f[n][S]; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void frepn() { freopen( .in , r , stdin); freopen( .out , w , stdout); } const int N = 50500; const long long INF = (1e17) + 777; const int mod = (1e9) + 7; int n, a[N], k, t; int ans, ans2, ans3, ans4; int main() { ios_base::sync_with_stdio(0); ; cin >> n >> k >> t; ans = k * t; for (int i = 1; i <= n; i++) { cin >> a[i]; ans4 += a[i]; } sort(a + 1, a + 1 + n); for (int i = n - k; i <= n; i++) { ans2 += a[i]; } for (int i = 1; i <= n - k; i++) { ans3 += a[i]; } if (ans2 < ans) cout << ans4; else cout << ans3 + ans; return 0; } |
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN=1e9+1; const ll mod=1e9+7; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n,m,k; cin>>n>>m>>k; int hori[n][m-1]; for(int i=0;i<n;i++){ for(int j=0;j<m-1;j++){ cin>>hori[i][j]; } } int verti[n-1][m]; for(int i=0;i<n-1;i++){ for(int j=0;j<m;j++){ cin>>verti[i][j]; } } if(k%2!=0){ for(int i=0;i<n;i++){ for(int j=0;j<m;j++)cout<< -1 ; cout<<endl; } return 0; } k/=2; int dp[n][m][k+1]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ for(int step=0;step<=k;step++)dp[i][j][step]=MAXN; } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++)dp[i][j][0]=0; } for (int step = 0; step < k; step++) { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (i > 0) dp[i - 1][j][step + 1] = min(dp[i - 1][j][step + 1], dp[i][j][step] + verti[i-1][j]); if (i < n - 1) dp[i + 1][j][step + 1] = min(dp[i + 1][j][step + 1], dp[i][j][step] + verti[i][j]); if (j > 0) dp[i][j - 1][step + 1] = min(dp[i][j - 1][step + 1], dp[i][j][step] + hori[i][j-1]); if (j < m - 1) dp[i][j + 1][step + 1] = min(dp[i][j + 1][step + 1], dp[i][j][step] + hori[i][j]); } } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cout<<(2*dp[i][j][k])<< ; } cout<<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void rd(T &x) { x = 0; char c = getchar(); int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = x * 10 - 0 + c, c = getchar(); x *= f; } const int N = 110; int Sqr(int x) { return x * x; } int sum[N][N][N]; int n, m; int vis[N][N], f[N][N]; int dp(int l, int r) { if (l + 1 >= r) return 0; if (vis[l][r]) return f[l][r]; vis[l][r] = 1; int res = 0; for (int k = l + 1; k < r; ++k) { res = max(res, Sqr(sum[k][l][r]) + dp(l, k) + dp(k, r)); } return f[l][r] = res; } int main() { rd(n), rd(m); for (int i = 1; i <= n; ++i) { int t, l, r; rd(t); while (t--) { rd(l), rd(r); for (int j = l; j <= r; ++j) sum[j][l - 1][r + 1]++; } } for (int i = 1; i <= m; ++i) { for (int j = i - 1; j >= 0; --j) for (int k = i + 1; k <= m + 1; ++k) sum[i][j][k] += sum[i][j + 1][k] + sum[i][j][k - 1] - sum[i][j + 1][k - 1]; } printf( %d , dp(0, m + 1)); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) long long int power(long long int x, long long int n) { long long int result = 1; while (n) { if (n % 2 == 1) result = result * x; n = n / 2; x = x * x; } return result; } long long int gcd(long long int a, long long int b) { if (!b) return a; return gcd(b, a % b); } long long int lcm(long long int a, long long int b) { return (a * b) / gcd(a, b); } long long int BS(long long int a[], long long int s, long long int n, long long int val) { long long int mid, beg = s, end = n - 1; while (beg <= end) { mid = (beg + end) / 2; if (val == a[mid]) { break; } else if (val > a[mid]) { beg = mid + 1; } else { end = mid - 1; } } return mid; } inline long long int mul(long long int x, long long int y, long long int m) { long long int z = 1LL * x * y; if (z >= m) { z %= m; } return z; } long long int powmod(long long int x, long long int y, long long int m) { long long int r = 1; while (y) { if (y & 1) { r = mul(r, x, m); } y >>= 1; x = mul(x, x, m); } return r; } using namespace std; void start() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; } int main() { start(); long long int n; cin >> n; long long int a[n], b[n]; for (long long int i = 0; i < n; i++) cin >> a[i] >> b[i]; long long int khatam = 0; for (long long int i = 0; i < n; i++) { if (a[i] != b[i]) { khatam = 1; break; } } if (khatam) { cout << rated n ; return 0; } long long int khatam1 = 0; for (long long int i = 1; i < n; i++) { if (b[i] > b[i - 1]) { khatam1 = 1; break; } } if (khatam1) cout << unrated ; else cout << maybe ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, s = 0; bool kt; cin >> n >> m; char a[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { kt = true; for (int j = 0; j < m; j++) { if (a[i][j] == S ) { kt = false; break; } } if (kt == true) for (int j = 0; j < m; j++) a[i][j] = 1 ; } for (int j = 0; j < m; j++) { kt = true; for (int i = 0; i < n; i++) { if (a[i][j] == S ) { kt = false; break; } } if (kt == true) for (int i = 0; i < n; i++) a[i][j] = 1 ; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == 1 ) s++; } } cout << s; } |
#include <bits/stdc++.h> using namespace std; int n, ans, len; int a[2333]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); a[0] = 0; a[n + 1] = 1001; for (int i = 1; i <= n + 1; i++) { if (a[i] == a[i - 1] + 1) len++; else { ans = max(ans, len - 1); len = 0; } } ans = max(ans, len - 1); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[8][8], n, m, u, v, k = INT_MAX; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; cin >> n >> m; for (long long i = 0; i < m; i++) { cin >> u >> v; a[u][v] = 1; a[v][u] = 1; } if (n <= 6) cout << m << n ; else { for (long long i = 1; i <= 7; i++) { for (long long j = i + 1; j <= 7; j++) { long long c = 0; for (long long l = 1; l <= 7; l++) if (a[i][l] == 1 && a[j][l] == 1) ++c; k = min(k, c); } } cout << m - k << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 9; int n, p, q; string s, t, a, b; int c[2005], d[2005], h[2005], invH[2005], k[2005], invK[2005]; vector<pair<int, int>> memo; int mul(int aa, int bb) { return ((long long)aa * bb) % MOD; } int add(int aa, int bb) { return (aa + bb) % MOD; } int sub(int aa, int bb) { return (aa - bb + MOD) % MOD; } int modpow(int num, int pi) { int res = 1; while (pi > 0) { if (pi & 1) res = mul(res, num); num = mul(num, num); pi >>= 1; } return res; } pair<int, int> getHash(int lo, int hi) { return make_pair(mul(sub(c[hi], c[lo]), invH[lo]), mul(sub(d[hi], d[lo]), invK[lo])); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> s >> a >> b; n = s.size(); p = a.size(); q = b.size(); h[0] = invH[0] = 1; k[0] = invK[0] = 1; for (int i = 1; i <= n; i++) { h[i] = mul(h[i - 1], 31); invH[i] = modpow(h[i], MOD - 2); k[i] = mul(k[i - 1], 53); invK[i] = modpow(k[i], MOD - 2); } for (int i = 0; i < n; i++) { c[i + 1] = add(c[i], mul(h[i], s[i])); d[i + 1] = add(d[i], mul(k[i], s[i])); } pair<int, int> x = make_pair(0, 0); for (int i = 0; i < p; i++) { x.first = add(x.first, mul(h[i], a[i])); x.second = add(x.second, mul(k[i], a[i])); } pair<int, int> y = make_pair(0, 0); for (int i = 0; i < q; i++) { y.first = add(y.first, mul(h[i], b[i])); y.second = add(y.second, mul(k[i], b[i])); } for (int i = 0; i < n - p + 1; i++) { for (int j = i + max(0, p - q); j < n - q + 1; j++) { if (x == getHash(i, i + p) && y == getHash(j, j + q)) { memo.push_back(getHash(i, j + q)); } } } sort(memo.begin(), memo.end()); int ans = unique(memo.begin(), memo.end()) - memo.begin(); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long a, b, x, vx, vy; map<long long, long long> mo; map<long long, long long>::iterator it; map<pair<long long, long long>, long long> ex; map<pair<long long, long long>, long long>::iterator ti; int main() { scanf( %d%I64d%I64d , &n, &a, &b); for (int i = 0; i < n; i++) { scanf( %I64d%I64d%I64d , &x, &vx, &vy); mo[vy - a * vx]++; ex[make_pair(vx, vy)]++; } long long ans = 0; for (it = mo.begin(); it != mo.end(); it++) { long long tmp = it->second; ans += tmp * (tmp - 1); } for (ti = ex.begin(); ti != ex.end(); ti++) { long long tmp = ti->second; ans -= tmp * (tmp - 1); } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int N = 5005; int n, m; double ans, F[N][N]; bool vis[N][N]; double cal(double b, double x, double y, double ps) { return (1 - b) * ps * x + min(1 - ps, ps * b + (1 - ps) * (1 - y)); } double f(int a, int b, int fl) { if (!b) return 1; if (!a) return 1 / (double)(b + 1); if (vis[a][b]) return F[a][b]; double res = 1 / (double)(b + 1); vis[a][b] = 1; double y = f(b, a - 1, 0), x = 1 - f(b - 1, a, 0); return F[a][b] = max(res, cal(1 / (double)(b + 1), x, y, y * (double)(b + 1) / (1 + y * (double)(b + 1)))); } int main() { int i, j; cin >> n >> m, ans = f(n, m, 0); printf( %.9lf %.9lf , ans, 1 - ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; vector<long long int> v(n), vv; for (int i = 0; i < n; i++) cin >> v[i]; long long int mx = *max_element(v.begin(), v.end()); int len = 0, fg = 0; for (long long int i = 0; i < n; i++) { if (v[i] == mx) { long long int j = i; while (v[j] == mx && j <= n - 1) j++; vv.push_back(j - i); i = j; } } sort(vv.begin(), vv.end()); cout << vv[vv.size() - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; int powmod(int a, int b) { int tmp = 1; a %= (1000000007); for (; b; b >>= 1) { if (b & 1) tmp = tmp * a % (1000000007); a = a * a % (1000000007); } return tmp; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <class T> inline void R(T &xx) { xx = 0; char ch = getchar(); bool F = 0; while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) F = 1, ch = getchar(); while (ch >= 0 && ch <= 9 ) xx = xx + xx + (xx << 3) + ch - 48, ch = getchar(); if (F) xx = -xx; } template <class T> inline void add(int &x, T y) { for (x += y; x >= (1000000007); x -= (1000000007)) ; } int n, k, a[5011], f[5011][2222][2], ans; int main() { R(n); R(k); for (int i = 1; i <= n; i++) R(a[i]); f[0][0][0] = 1; for (int i = 1; i <= n; i++) { if (a[i] == 0 || a[i] == 2) for (int j = 0; j < (int)2049; j++) { int p = min(j + 2, 2048); add(f[i][p][1], f[i - 1][j][1]); add(f[i][p][0], f[i - 1][j][0]); } if (a[i] == 0 || a[i] == 4) for (int j = 0; j < (int)2049; j++) { int p = min(j + 4, 2048); if (j % 4) add(f[i][4][j >= (1 << k)], f[i - 1][j][0]), add(f[i][4][1], f[i - 1][j][1]); else add(f[i][p][0], f[i - 1][j][0]), add(f[i][p][1], f[i - 1][j][1]); } } for (int i = 0; i < (int)2049; i++) { add(ans, f[n][i][1]); if (i >= (1 << k)) add(ans, f[n][i][0]); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100000 + 2; const int MAX_M = 100000 + 2; int weight[MAX_N]; struct Edge { int v, x; } E[MAX_M * 10]; int tot; template <int N> struct AdjList { int l[N]; inline void addEdge(int u, int v) { E[tot] = (Edge){v, l[u]}; l[u] = tot++; } void init() { memset(l, -1, sizeof l); } }; AdjList<MAX_N> adj; namespace BCC { const int N = MAX_N; const int M = MAX_M; set<int> p2c[N]; set<pair<int, int> > c2e[N]; map<pair<int, int>, int> e2c; pair<int, int> S[M], tmp; int cut[N], dep[N], low[N], ori[N + N]; int *l; Edge *E; int n, bcc_cnt, top; void dfs(int u, int D, int ind); void Pop(pair<int, int> y); int rebuild(AdjList<N + N> &adj); void init(int _n, int *_l, Edge *_E) { n = _n; l = _l; E = _E; for (int i = 0; i < n; i++) dep[i] = cut[i] = -1; for (int i = 0; i < n; i++) p2c[i].clear(), c2e[i].clear(); e2c.clear(); bcc_cnt = top = 0; for (int i = 0; i < n; i++) if (dep[i] == -1) { dfs(i, 0, -1); } } void dfs(int u, int D, int ind) { dep[u] = low[u] = D; int child = 0; for (int i = l[u]; ~i; i = E[i].x) { if (ind == (i ^ 1)) continue; int v = E[i].v; S[top++] = {u, v}; if (dep[v] >= 0) { if (dep[v] > dep[u]) top--; low[u] = min(low[u], dep[v]); continue; } child++; dfs(v, D + 1, i); low[u] = min(low[u], low[v]); if (low[v] >= dep[u]) { cut[u] = 1; Pop(pair<int, int>(u, v)); } } if (child == 1 && ind < 0) cut[u] = -1; } void Pop(pair<int, int> y) { do { tmp = S[--top]; p2c[tmp.first].insert(bcc_cnt); p2c[tmp.second].insert(bcc_cnt); if (tmp.first > tmp.second) swap(tmp.first, tmp.second); c2e[bcc_cnt].insert(tmp); e2c[tmp] = bcc_cnt; } while (top && S[top] != y); bcc_cnt++; } int rebuild(AdjList<N + N> &adj) { int c = bcc_cnt; for (int i = 0; i < n; i++) if (cut[i] != -1) { cut[i] = c++; ori[c - 1] = i; } adj.init(); set<int>::iterator it; for (int u = 0; u < n; u++) { if (cut[u] == -1) continue; for (it = p2c[u].begin(); it != p2c[u].end(); it++) { adj.addEdge(cut[u], *it); adj.addEdge(*it, cut[u]); } } return c; } }; // namespace BCC namespace Solve { const int N = MAX_N + MAX_N; const int inf = 1e9; AdjList<N> adj2; multiset<int> value[N]; int n, m; int dep[N], top[N], fa[N], heavy[N], siz[N]; int ID[N]; int *l; Edge *E; void Label(int u, int anc); void dfs(int u); int query(int a, int b); struct segTree { int Min[N << 1]; inline int getID(int l, int r) { return l + r | l != r; } void up(int l, int r) { int mid = l + r >> 1; Min[getID(l, r)] = min(Min[getID(l, mid)], Min[getID(mid + 1, r)]); } void build(int l, int r) { int o = getID(l, r); if (l == r) { if (value[l].empty()) { puts( empty bug ); Min[o] = inf; } else { Min[o] = *value[l].begin(); } } else { int mid = l + r >> 1; build(l, mid); build(mid + 1, r); up(l, r); } } void update(int l, int r, int ql, int preValue, int nowValue) { if (l == r) { auto it = value[l].lower_bound(preValue); if (it == value[l].end()) { puts( delete bug ); return; } value[l].erase(it); value[l].insert(nowValue); Min[getID(l, r)] = *value[l].begin(); } else { int mid = l + r >> 1; if (ql <= mid) update(l, mid, ql, preValue, nowValue); else update(mid + 1, r, ql, preValue, nowValue); up(l, r); } } int getMin(int l, int r, int ql, int qr) { if (ql <= l && r <= qr) { return Min[getID(l, r)]; } int mid = l + r >> 1; if (qr <= mid) return getMin(l, mid, ql, qr); if (ql > mid) return getMin(mid + 1, r, ql, qr); return min(getMin(l, mid, ql, qr), getMin(mid + 1, r, ql, qr)); } } segs; void dfs(int u) { siz[u] = 1; heavy[u] = -1; for (int i = l[u], v; ~i; i = E[i].x) { v = E[i].v; if (fa[u] != v) { dep[v] = dep[u] + 1; fa[v] = u; dfs(v); siz[u] += siz[v]; if (heavy[u] == -1 || siz[heavy[u]] < siz[v]) { heavy[u] = v; } } } } void Label(int u, int anc) { ID[u] = m++; top[u] = anc; if (~heavy[u]) Label(heavy[u], anc); for (int i = l[u], v; ~i; i = E[i].x) { v = E[i].v; if (v != fa[u] && v != heavy[u]) { Label(v, v); } } } int query(int a, int b) { int ret = inf; while (top[a] != top[b]) { if (dep[top[a]] < dep[top[b]]) { swap(a, b); } ret = min(ret, segs.getMin(0, m - 1, ID[top[a]], ID[a])); a = fa[top[a]]; } if (dep[a] < dep[b]) { swap(a, b); } ret = min(ret, segs.getMin(0, m - 1, ID[b], ID[a])); if (b < BCC::bcc_cnt && fa[b] != -1) { ret = min(ret, weight[BCC::ori[fa[b]]]); } return ret; } void init(int _n, Edge *_E, int _m) { n = _n; for (int u = 0; u < n; u++) value[u].clear(); l = adj2.l; E = _E; dep[0] = -1; fa[0] = -1; m = 0; dfs(0); Label(0, 0); for (int u = 0; u < _m; u++) { if (BCC::cut[u] == -1) { value[ID[*BCC::p2c[u].begin()]].insert(weight[u]); } else { value[ID[BCC::cut[u]]].insert(weight[u]); value[ID[fa[BCC::cut[u]]]].insert(weight[u]); } } segs.build(0, m - 1); } void modify(int u, int pre, int now) { if (u >= BCC::bcc_cnt && fa[u] != -1) { modify(fa[u], pre, now); } segs.update(0, m - 1, ID[u], pre, now); } void gao(int q) { char op; int a, b, w, x, y; while (q--) { scanf( %c %d %d , &op, &a, &b); if (op == C ) { a--; x = BCC::cut[a]; if (x == -1) { if (BCC::p2c[a].size() != 1) { puts( build bug ); } x = *BCC::p2c[a].begin(); } modify(x, weight[a], b); weight[a] = b; } else { a--; b--; if (a == b) { printf( %d n , weight[a]); continue; } x = BCC::cut[a]; y = BCC::cut[b]; if (x == -1) { if (BCC::p2c[a].size() != 1) { puts( build bug ); } x = *BCC::p2c[a].begin(); } if (y == -1) { if (BCC::p2c[b].size() != 1) { puts( build bug ); } y = *BCC::p2c[b].begin(); } printf( %d n , query(x, y)); } } } }; // namespace Solve int main() { int n, m, q, u, v, w; scanf( %d%d%d , &n, &m, &q); for (int i = 0; i < n; i++) { scanf( %d , weight + i); } tot = 0; adj.init(); for (int i = 0; i < m; i++) { scanf( %d%d , &u, &v); u--; v--; adj.addEdge(u, v); adj.addEdge(v, u); } BCC::init(n, adj.l, E); int bcc_cnt = BCC::rebuild(Solve::adj2); Solve::init(bcc_cnt, E, n); Solve::gao(q); return 0; } |
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; const int MOD = 1e9 + 7; int n; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout << fixed; cin >> n; int dp[] = {1, 0}; for (int i = 1; i < n; i++) dp[i % 2] = (dp[i % 2] + dp[1 - i % 2] + 1) % MOD; cout << (dp[0] + dp[1]) % MOD << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i = 0, j, k = 0, l = 0, m = 10e9, a = 0, b = 0, c, sum = 0, x = 0, y = 0, z = 0; cin >> n; long long arr[n + 1]; for (i = 1; i <= n; i++) { cin >> arr[i]; arr[i] = arr[i] / max(i - 1, n - i); } for (i = 1; i <= n; i++) { l = arr[i]; m = min(m, l); } cout << m; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, m, i, j, q = 0; string s, k, p = go ; cin >> n >> s; vector<string> st(100); st[0] = ogo ; for (i = 1; i < 100; i++) { st[i] = st[i - 1] + p; } for (i = 0; i < n; i++) { j = n - i; q = 0; for (j = n - i; j >= 3; j--) { k = s.substr(i, j); if (binary_search(st.begin(), st.end(), k)) { i = i + j - 1; cout << *** ; q = 1; break; } } if (q == 0) cout << s[i]; } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 60; const int A = 26; const int INF = 1000000001; char G[MAX + 2][MAX + 3]; int D[MAX + 2][MAX + 2]; bool ok[A + 1]; pair<int, int> S, T; vector<char> ans; vector<int> K; int n, m, k; inline int con(char c) { return a <= c && c <= z ? c - a : A; } vector<pair<int, int> > Q; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; bool vis[A + 1][A + 1][A + 1][A + 1]; void bfs() { sort((K).begin(), (K).end()); K.erase(unique((K).begin(), (K).end()), K.end()); if (K.back() == A) K.pop_back(); if (K.size() > k || K.empty()) return; if (vis[K[0]][K.size() > 1 ? K[1] : A][K.size() > 2 ? K[2] : A] [K.size() > 3 ? K[3] : A]) return; vis[K[0]][K.size() > 1 ? K[1] : A][K.size() > 2 ? K[2] : A] [K.size() > 3 ? K[3] : A] = true; for (int i = 0; i < K.size(); ++i) ok[K[i]] = true; for (int i = 0; i <= n + 1; ++i) memset(D[i], -1, sizeof(int) * (m + 2)); Q.clear(); Q.push_back(T); D[T.first][T.second] = 0; for (int foo = 0; foo < Q.size(); ++foo) { pair<int, int> v = Q[foo]; if (v == S) break; for (int foo = 0; foo < 4; ++foo) { int i = v.first + dx[foo]; int j = v.second + dy[foo]; if (ok[con(G[i][j])] && D[i][j] == -1) { D[i][j] = D[v.first][v.second] + 1; Q.push_back(make_pair(i, j)); } } } for (int i = 0; i < K.size(); ++i) ok[K[i]] = false; int d = INF; for (int foo = 0; foo < 4; ++foo) { int i = S.first + dx[foo]; int j = S.second + dy[foo]; if (D[i][j] != -1) d = min(d, D[i][j]); } if (d > ans.size()) return; int com = 0; int index = 0; vector<char> tmp; tmp.reserve(d); vector<pair<int, int> > V[2]; bool now = false; V[0].push_back(S); while (d) { int best = 200; for (int i = 0; i < K.size(); ++i) for (__typeof((V[now]).begin()) u = (V[now]).begin(); u != (V[now]).end(); ++u) for (int foo = 0; foo < 4; ++foo) { int x = u->first + dx[foo]; int y = u->second + dy[foo]; if (G[x][y] == K[i] + a && D[x][y] == d) { best = K[i]; goto out; } } out: tmp.push_back(best + a ); if (!com) { if (tmp.back() < ans[index]) com = -1; else if (tmp.back() > ans[index]) com = 1; } ++index; V[!now].clear(); for (__typeof((V[now]).begin()) u = (V[now]).begin(); u != (V[now]).end(); ++u) for (int foo = 0; foo < 4; ++foo) { int x = u->first + dx[foo]; int y = u->second + dy[foo]; if (G[x][y] == best + a && D[x][y] == d) { V[!now].push_back(make_pair(x, y)); D[x][y] = -1; } } --d; now = !now; } if (tmp.size() < ans.size() || com == -1) ans = tmp; } void solve(int x, int i) { if (x >= k) { vector<int> tmpK = K; bfs(); K = tmpK; return; } if (i == A) return; solve(x, i + 1); for (; i < A; ++i) { K.push_back(i); solve(x + 1, i + 1); K.pop_back(); } } int main(int argc, char *argv[]) { scanf( %d %d %d , &n, &m, &k); ans.resize(n * m + 10); for (int i = 0; i <= n + 1; ++i) memset(G[i], $ , m + 2); for (int i = 1; i <= n; ++i) scanf( %s , G[i] + 1); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (G[i][j] == S ) S = make_pair(i, j); else if (G[i][j] == T ) T = make_pair(i, j); if (abs(S.first - T.first) + abs(S.second - T.second) == 1) return 0; for (int xs = S.first - 1; xs <= S.first + 1; ++xs) for (int ys = S.second - 1; ys <= S.second + 1; ++ys) if (abs(xs - S.first) + abs(ys - S.second) == 1) for (int xt = T.first - 1; xt <= T.first + 1; ++xt) for (int yt = T.second - 1; yt <= T.second + 1; ++yt) if (abs(xt - T.first) + abs(yt - T.second) == 1) { K.clear(); K.push_back(con(G[xs][ys])); K.push_back(con(G[xt][yt])); if (K[0] == K[1]) K.pop_back(); solve(K.size(), 0); } if (ans.size() == n * m + 10) { printf( -1 n ); return 0; } for (__typeof((ans).begin()) i = (ans).begin(); i != (ans).end(); ++i) printf( %c , *i); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; char inp[2000]; int toNum(char x) { if (x >= 0 && x <= 9 ) return x - 0 ; return 10 + x - A ; } char toChar(int x) { if (x < 10) return 0 + x; return A + (x - 10); } long long ato10(int a) { int len = strlen(inp); int lw = 0; while (lw < len && inp[lw] == 0 ) lw++; if (lw >= len) return 0; long long ret = 0; for (int i = lw; i < len; i++) { ret = ret * a + toNum(inp[i]); } return ret; } char pI[] = { I , X , C , M }; char pV[] = { V , L , D }; int main() { int a, b; gets(inp); bool iR = false; int len = strlen(inp); for (int i = 0; i < len; i++) { if (inp[i] == R ) iR = true; } if (!iR) sscanf(inp, %d%d , &a, &b); else sscanf(inp, %d , &a); gets(inp); long long number = ato10(a); if (!iR) { string ret = ; if (number == 0) ret = 0 ; else { while (number) { ret = toChar(number % b) + ret; number /= b; } } printf( %s n , ret.c_str()); } else { int idx = 0; string ret = ; while (number) { int tdec = number % 10; number /= 10; if (tdec <= 3) for (int t = 0; t < tdec; t++) ret = pI[idx] + ret; else if (tdec == 4) { ret = pV[idx] + ret; ret = pI[idx] + ret; } else if (tdec == 5) ret = pV[idx] + ret; else if (tdec <= 8) { tdec -= 5; for (int t = 0; t < tdec; t++) ret = pI[idx] + ret; ret = pV[idx] + ret; } else { ret = pI[idx + 1] + ret; ret = pI[idx] + ret; } idx++; } printf( %s n , ret.c_str()); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int k; long long int ways(long long int n) { long long int calc, ways = 0; for (int k = 2; k <= 10000000; k++) { calc = n / (1ll * k * k * k); ways += calc; if (calc == 0) { break; } } return ways; } long long int binarysearch(long long int low, long long int high) { long long int temp = high; while (low <= high) { long long int mid = low + (high - low) / 2; long long int x = ways(mid); if (x > k) high = mid - 1; else if (x < k) low = mid + 1; else if (x == k) { temp = min(temp, mid); high = mid - 1; } } return temp; } int main() { scanf( %lld , &k); long long int MAX = 10 * k; long long int ans = binarysearch(8, MAX); if (ans == MAX) ans = -1; printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; namespace whatever { const long long inf = 1000000000000000001ll; template <typename type> type read() { char ch = getchar(); while (!isdigit(ch)) ch = getchar(); type value = ch - 0 ; ch = getchar(); while (isdigit(ch)) { value = value * 10 + ch - 0 ; ch = getchar(); } return value; } int n; string f[201]; char result[202]; int fail[201]; int match(const string &str, int l) { int cnt = 0; int cur = 0; for (char ch : str) { while (cur && ch != result[cur + 1]) cur = fail[cur]; if (ch == result[cur + 1]) ++cur; if (cur == l) { ++cnt; cur = fail[cur]; } } return cnt; } long long count(int l) { static long long cnt[201]; int i; for (i = 0; i <= n && (i < 2 || int(f[i - 2].size()) <= l); ++i) cnt[i] = match(f[i], l); if (i <= n) { long long span_cnt[2]; span_cnt[i % 2] = match( f[i - 2].substr(f[i - 2].size() - l + 1) + f[i - 1].substr(0, l - 1), l); span_cnt[1 - i % 2] = match( f[i - 2].substr(f[i - 2].size() - l + 1) + f[i - 2].substr(0, l - 1), l); do { cnt[i] = cnt[i - 2] + cnt[i - 1] + span_cnt[i % 2]; if (cnt[i] >= inf) return inf; } while (++i <= n); } return cnt[n]; } void insert(int l, char ch) { result[l] = ch; if (l == 1) return; int cur = fail[l - 1]; while (cur && ch != result[cur + 1]) cur = fail[cur]; if (ch == result[cur + 1]) ++cur; fail[l] = cur; } void run() { n = read<int>(); long long k = read<long long>() + 1; int m = read<int>(); f[0] = 0 ; f[1] = 1 ; int last = n; for (int i = 2; i <= n; ++i) if (int(f[i - 2].size()) <= m) f[i] = f[i - 2] + f[i - 1]; else { last = i - 1; break; } cerr << last: << last << endl; fail[1] = 0; for (int i = 1; i <= m; ++i) { if (f[last].substr(f[last].size() - i + 1) == string(result + 1, result + i)) { if (--k == 0) break; } insert(i, 0 ); long long cnt = count(i); if (cnt >= k) putchar( 0 ); else { k -= cnt; insert(i, 1 ); putchar( 1 ); } } putchar( n ); } } // namespace whatever int main() { whatever::run(); } |
#include <bits/stdc++.h> const long long N = 2e5 + 17; using namespace std; long long i, mn, ans = 0, als = 0, v, ii, r4 = 0, r1, r2, r3, mx, p, q, d, l, r, m, n, k, j; string d1, d3, d2, s; char kl, km, mk, lk; double fg; int inout() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n >> q; map<long long, long long> mp; while (q--) { cin >> r1 >> r2 >> r3; als = 0; ii = 0; for (i = 1; i <= n; i++) { if (r1 >= mp[i]) als++; if (als == r2) break; } if (als == r2) { for (i = 1; i <= n && r2; i++) { if (r1 >= mp[i]) { mp[i] = r1 + r3; ii += i; r2--; } } cout << ii << n ; } else cout << -1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 51; int n, x; int res[MAXN]; inline int read() { register int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar(); } if (ch == - ) { neg = -1; ch = getchar(); } while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch - 0 ); ch = getchar(); } return num * neg; } inline void calc1(int n) { if (n <= 0) { return; } int x = 31 - __builtin_clz(n); reverse(res + (1 << x + 1) - n - 1, res + n + 1); calc1((1 << x + 1) - n - 2); } inline void solve1() { if (n & 1) { return (void)puts( NO ); } puts( YES ); for (register int i = 1; i <= n; i++) { res[i] = i; } calc1(n); for (register int i = 1; i <= n; i++) { printf( %d , res[i]); } puts( ); } inline void solve2() { if (n == 3 || n == 5 || n == (n & -n)) { return (void)puts( NO ); } puts( YES ); for (register int i = 1; i <= n; i++) { res[i] = i; } if (n & 1) { printf( 3 6 1 5 7 2 4 ); for (register int i = 8; i <= n; i += 2) { swap(res[i], res[i ^ 1]); } for (register int i = 8; i <= n; i++) { printf( %d , res[i]); } } else { for (register int i = 2; i <= n - 3; i += 2) { swap(res[i], res[i + 1]); } swap(res[1], res[n - 1]), swap(res[n], res[n - 2]); for (register int i = 1; i <= n; i++) { printf( %d , res[i]); } } puts( ); } int main() { n = read(), solve1(), solve2(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; long long sum = 0, sum2 = 0; scanf( %d , &n); int nav[200005]; for (int i = 0; i < n; i++) scanf( %d , &nav[i]), sum += nav[i]; for (int i = 0; i < n; i++) { sum2 += nav[i]; if (sum2 >= (sum + 1) / 2) { printf( %d , i + 1); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353, N = 3e5 + 6; long long n, k, t; void solve() { cin >> n >> k; long long t = 1; while (t * 10 <= n) t *= 10; while (k > 1) { t = 1; while (t * 10 <= n) t *= 10; while (n - t < k - 1) t /= 10; cout << t << ; n -= t; k--; } cout << n; } int main() { long long tt = 1; cin >> tt; while (tt--) { solve(); cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int sa = 0, sb = 0; int ca, cb; char* c; int i = 0; scanf( %d , &n); c = (char*)malloc(sizeof(char) * n); while (n--) { scanf( %d %d , &ca, &cb); if (sb + cb > sa + 500) { sa = sa + ca; c[i++] = A ; } else { sb += cb; c[i++] = G ; } } c[i] = 0 ; if (abs(sb - sa) <= 500) printf( %s n , c); else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void pause() {} bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) { return a.second > b.second; } int rec(int n, int i, int a[], int c) { c++; if (n == i) return c; rec(a[n - 1], i, a, c); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, a[1005], c = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); for (int i = n - 1; i >= 0; i--) { c++; if (c == a[i]) { cout << c; break; } else if (c > a[i]) { cout << c - 1; break; } } cout << n ; } pause(); } |
#include <bits/stdc++.h> using namespace std; int xx[8] = {0, 0, 1, -1, 1, -1, 1, -1}; int yy[8] = {-1, 1, 0, 0, 1, -1, -1, 1}; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; bool flag = true; vector<long long int> v(n); for (long long int i = 0; i < n; i++) cin >> v[i]; long long int pos1 = -1, pos2 = -1; for (long long int i = 0; i < n; i++) { if (v[i] == 1) { pos1 = i; break; } } if (pos1 == -1) { cout << 0 ; return 0; } for (int j = n - 1; j >= 0; j--) { if (v[j] == 1) { pos2 = j; break; } } long long int c = 1, ans = 1; if (pos1 == pos2) { cout << 1 << n ; return 0; } else { for (long long int i = pos1; i < pos2 + 1; i++) { if (v[i] == 0) { c++; } else { ans *= c; c = 1; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int c, v0, v1, a, l; cin >> c >> v0 >> v1 >> a >> l; int d = 1; int r = v0; int tmp = v0; while (1) { if (r >= c) break; tmp = tmp + a; if (tmp > v1) tmp = v1; r += (tmp - l); d++; } cout << d << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2010; int n, a[N], m; double f[N][N], p, ans; inline int read() { int x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = (x << 3) + (x << 1) + ch - 48, ch = getchar(); return x; } int main() { scanf( %d%lf%d , &n, &p, &m); f[0][0] = 1; for (int i = 1; i <= m; i++) { f[i][0] = (1 - p) * f[i - 1][0]; for (int j = 1; j <= n - 1; j++) f[i][j] = f[i - 1][j] * (1 - p) + f[i - 1][j - 1] * p; f[i][n] = f[i - 1][n] + f[i - 1][n - 1] * p; } for (int i = 1; i <= n; i++) ans += f[m][i] * i; printf( %lf , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2200; char s[MAXN], t[MAXN]; int l[MAXN], r[MAXN]; int main() { int T; scanf( %d , &T); while (T--) { int n, k, m = 0; scanf( %d%d%s , &n, &k, s + 1); for (int i = 1; i < k; i++) t[2 * i - 1] = ( , t[2 * i] = ) ; for (int i = 2 * k - 1; i < k + n / 2; i++) t[i] = ( ; for (int i = k + n / 2; i <= n; i++) t[i] = ) ; for (int i = 1; i <= n; i++) if (s[i] != t[i]) { int k; for (int j = i + 1; j <= n; j++) if (s[j] == t[i]) { k = j; break; } l[++m] = i; r[m] = k; reverse(s + i, s + k + 1); } printf( %d n , m); for (int i = 1; i <= m; i++) printf( %d %d n , l[i], r[i]); } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; long long mulmod(long long a, long long b, long long MOD) { if (b == 0) return 0; long long res = mulmod(a, b >> 1, MOD); res += res; res %= MOD; return (b & 1) ? (a + res) % MOD : res; } int main() { ios::sync_with_stdio(0); long long t1, t2, x1, x2, t0; cin >> t1 >> t2 >> x1 >> x2 >> t0; long long ans1 = 3000000000000ll, ans2 = 1, ii = 0, jj = 0; if (t1 == t0) { if (t2 == t0) { cout << x1 << << x2 << endl; return 0; } else { cout << x1 << << 0 << endl; return 0; } } if (t2 == t0) { cout << 0 << << x2 << endl; return 0; } if (t0 <= t1) { ii = x1; jj = 0; ans1 = x1 * t1; ans2 = x1; } if (t0 <= t2 && (ans1 == 3000000000000ll || (t2 < t1 || (t2 == t1 && x2 > x1)))) { ii = 0; jj = x2; ans1 = x2 * t2; ans2 = x2; } for (long long i = 0; i <= x1; i++) { long long j = (i * (t0 - t1)) / (t2 - t0); if ((i * (t0 - t1)) % (t2 - t0) != 0) { j++; } if (i == 0 && j == 0) continue; if (j < 0 || j > x2) { continue; } if (ans1 * (i + j) > (i * t1 + j * t2) * ans2) { ans1 = (i * t1 + j * t2); ans2 = (i + j); ii = i; jj = j; } else { if (ans1 * (i + j) == (i * t1 + j * t2) * ans2 && ans2 < (i + j)) { ans1 = (i * t1 + j * t2); ans2 = (i + j); ii = i; jj = j; } } } cout << ii << << jj << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; map<long long, long long> row, col; row.clear(); col.clear(); long long aRow = 0, aCol = 0, res = n * n; while (k--) { long long x, y; cin >> x >> y; if (!row[x] && !col[y]) { row[x] = 1; col[y] = 1; res -= (2 * n - 1 - aRow - aCol); aRow++; aCol++; cout << res; } else if (row[x] && col[y]) { cout << res; } else if (row[x]) { res -= (n - aRow); col[y] = 1; aCol++; cout << res; } else if (col[y]) { res -= (n - aCol); row[x] = 1; aRow++; cout << res; } if (k) cout << ; else cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int l, r; cin >> l >> r; int a{r}, b{max(r / 2 + 1, l)}; cout << a % b << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t{1}; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, d, start = 0; cin >> n >> d; vector<string> s(d); for (string &e : s) cin >> e; vector<int> win(d); for (int i = 0; i < s.size(); i++) { string q = s[i]; if (q.find( 0 ) <= q.length()) { win[start]++; } else { start++; } } sort(win.begin(), win.end(), greater<int>()); cout << win[0] << endl; } |
#include <bits/stdc++.h> using namespace std; struct arra { long long int d = 0, idx; } arr[200008]; bool comp(struct arra a, struct arra b) { return a.d > b.d; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, k, a, temp, ans; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a; arr[a].d++; arr[a].idx = a; } sort(arr, arr + 200005, comp); long long int l = 1, r = 200008, mid; while (l <= r) { mid = (l + r) / 2; temp = 0; for (int i = 0; i < n; i++) { temp += arr[i].d / mid; } if (temp >= k) { ans = mid; l = mid + 1; } else r = mid - 1; } vector<long long> v; for (int i = 0; i < n; i++) { for (int j = 0; j < arr[i].d / ans; j++) { v.push_back(arr[i].idx); } } for (int i = 0; i < k; i++) cout << v[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool solve(int cn) { int n, k; cin >> n >> k; vector<int> soldiers(n); for (int i = (0); i < (n); i++) cin >> soldiers[i]; soldiers.push_back(1 << 30); int coins = 0; while (soldiers[0] < k) { coins++; for (int i = (0); i < (n); i++) { while (soldiers[i] == soldiers[i + 1]) i++; soldiers[i]++; } } cout << coins << endl; return 0; } int main() { int cases = 1 << 30; if (!cases) cin >> cases; for (int cn = 1; cn <= cases && solve(cn); ++cn) ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x; cin >> x; if (x == 1) cout << -1 << endl; else cout << x << << x << endl; return 0; } |
#include <iostream> #include <vector> #include <set> #include <algorithm> using namespace std; typedef long long ll; typedef pair<ll, ll> P; const int maxn = 105; int n, m, k; vector<set<int>> mp(maxn); vector<int> g, ans; int vis[maxn], pre[maxn], pres[maxn][maxn*maxn]; ll dp[maxn][maxn*maxn]; P query[maxn]; int c = 0; bool found(int u, int t){ vis[u] = t; for(set<int>::iterator i = mp[u].begin(); i != mp[u].end(); i++){ int v = *i; if(vis[v] == t) continue; vis[v] = t; if(pre[v] == 0 || found(pre[v], t)){ pre[v] = u; return true; } } return false; } int main(){ scanf( %d%d%d , &n, &m, &k); for(int i = 1; i <= m; i++){ int u, v; scanf( %d%d , &u, &v); mp[u].insert(v+n); } for(int i = 1; i <= k; i++){ scanf( %lld%lld , &query[i].first, &query[i].second); } for(int i = 1; i <= n; i++){ if(found(i, i)) c++; } for(int i = c; i >= 1; i--){ if(i == 1) int a = 1; int now; static vector<set<int>> _mp; _mp = mp; for(int j = 1; j <= n; j++){ int cnt = 0; mp = _mp; mp[j].clear(); if(i == 1 && j == 1){ int a = 1; } for(int i = 1; i <= 2*n; i++) vis[i] = pre[i] = 0; for(int k = 1; k <= n; k++){ if(found(k, k)) cnt++; } if(cnt < i) now = j; mp = _mp, cnt = 0; for(int k = 1; k <= n; k++){ mp[k].erase(j+n); } for(int i = 1; i <= 2*n; i++) vis[i] = pre[n+i] = 0; for(int k = 1; k <= n; k++){ if(found(k, k)) cnt++; } if(cnt < i) now = -j; } mp = _mp; if(now < 0){ for(int k = 1; k <= n; k++){ mp[k].erase(-now+n); } }else{ mp[now].clear(); } g.push_back(now); } reverse(g.begin(), g.end()); for(int i = 0; i <= c; i++) dp[0][i] = -1e9-7; dp[0][c] = 0; for(int i = 0; i < k; i++){ for(int j = 0; j <= c; j++) dp[i+1][j] = -1e9-7; for(int j = 0; j <= c; j++){ if(dp[i][j] == -1e18-7) continue; for(int h = 0; h <= j; h++){ if(i + 1 + h >= n) break; int t = j - h; ll add = max(0ll, query[i+1].first - t * query[i+1].second); if(dp[i+1][h] < dp[i][j] + add){ dp[i+1][h] = dp[i][j] + add; pres[i+1][h] = j; } } } } int index = max_element(dp[k], dp[k]+c+1) - dp[k]; for(int i = k; i >= 1; i--){ int cnt = pres[i][index]; ans.push_back(0); for(int j = index; j < cnt; j++){ ans.push_back(g.back()); g.pop_back(); } index = cnt; } printf( %d n , ans.size()); for(int i = ans.size() - 1; i >= 0; i--){ printf( %d , ans[i]); } return 0; } |
#include <bits/stdc++.h> int CH, NEG; template <typename TP> inline void read(TP& ret) { ret = NEG = 0; while (CH = getchar(), CH < ! ) ; if (CH == - ) NEG = true, CH = getchar(); while (ret = ret * 10 + CH - 0 , CH = getchar(), CH > ! ) ; if (NEG) ret = -ret; } int n, data[200010LL], id[200010LL], rank[200010LL], val[200010LL]; inline bool cmp(const int& a, const int& b) { return data[a] < data[b]; } int main() { int m, i, p, q, l, d, r; bool unord; read(n), read(m); unord = false, data[0] = -2000000001LL; for (i = (1); i <= (n); i++) if (read(data[i]), id[i] = i, data[i - 1] > data[i]) unord = true; if (unord) std::sort(id + 1, id + n + 1, cmp); for (i = (1); i <= (n); i++) rank[id[i]] = i, val[i] = data[id[i]]; val[n + 1] = 2000000001LL; while (m-- > 0) { read(p), read(l), p = rank[p]; q = std::upper_bound(val, val + n + 2, val[p] + l) - val - 1; l -= val[q] - val[p], p = q, d = -1; while (true) { if (d == 1) q = std::upper_bound(val + 1, val + n + 2, val[p] + l * d) - val - 1; else q = std::lower_bound(val + 1, val + n + 2, val[p] + l * d) - val; if (p == q) break; if (r = std::abs(val[p] - val[q]), (l / r) & 1) p = q, d = -d; l %= r; } printf( %d n , id[p]); } getchar(), getchar(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long s[100001]; int main() { int n, c = 1; long long sum = 0; cin >> n; for (int i = 0; i < n; i++) cin >> s[i]; sort(s, s + n); sum += s[0]; for (int i = 1; i < n; i++) { if (sum <= s[i]) { c++; sum += s[i]; } } cout << c; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k, tlen = 0, dir, i; string temp; cin >> n >> m >> k; cin >> temp >> temp; if (temp == head ) dir = -1; else dir = 1; cin >> temp; if (m < k) m = 1; else m = n; for (i = 0; i < temp.size(); ++i) { if (k == 1) dir = 1; else if (k == n) dir = -1; k += dir; if (temp[i] != 1 ) { if (k == m) { cout << Controller << i + 1; return 0; } } else { if (dir == -1) m = n; else m = 1; } } cout << Stowaway ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> factors(long long n) { vector<long long> first; long long tem = 1; for (long long x = 2; x * x <= n; x++) { while (n % x == 0) { first.push_back(x); n /= x; } } if (n > 1) first.push_back(n); return first; } long long stringToint(string str) { int num = stoi(str); return num; } int hamming(int a, int b) { return __builtin_popcount(a ^ b); } bool cmp(int a, int b) { return a > b; } void reset() { for (int i = 0; i < 200000 + 100; i++) { } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, d; while (cin >> n >> d) { int m; cin >> m; for (int i = 0, x, y; i < m; i++) { cin >> x >> y; if (abs(x - y) >= 0 && abs(x - y) <= d && x + y <= n + n - d && x + y >= d && (x + y != 0 || x - y != 0)) cout << YES n ; else cout << NO n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } long long int lcm(long long int a, long long int b) { return a * b / gcd(a, b); } int n, cnt[100010]; int main() { scanf( %d , &n); set<int> s; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); s.insert(x); auto itr = s.find(x); itr++; if (itr == s.end()) cnt[x]--; else { x = *itr; itr++; if (itr == s.end()) cnt[x]++; } } int ans = 1; for (int i = 1; i <= n; i++) if (cnt[i] > cnt[ans]) ans = i; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[200200]; int main() { int i, j; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (i = 1; i < n; i++) { if (a[i] % 2) { a[i] = 1; if (a[i + 1] == 0) { cout << NO ; return 0; } else { a[i + 1]--; } } } if (a[n] % 2) { cout << NO ; return 0; } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 10; const int M = 1000000007; const double PI = atan(1) * 4; const int oo = 1000000000; long long A, B, n, x; long long pw(long long x, long long p) { if (!p) return 1; long long d = pw(x, p / 2); d = (d * d) % M; if (p % 2) d = (d * x) % M; assert(x <= M); assert(d <= M); return d; } int main() { cin >> A >> B >> n >> x; if (A == 1) return cout << (n % M * B % M + x) % M, 0; long long one = x * pw(A, n) % M; long long dom = pw(A, n) - 1; long long den = pw(A - 1, M - 2); cout << (one + B * ((dom * den) % M) % M) % M << endl; } |
#include <bits/stdc++.h> using namespace std; const double PI = M_PI; const int INF = -1 * 1e9; const long long limit = 1 * 1e12; const int MOD1 = 1e9 + 711; const int MOD2 = 1e9 + 933; const int MOD3 = 1e9 + 993; const int maxn = 1e6 + 100; int main() { cout.tie(0); cin.tie(0); ios_base::sync_with_stdio(0); int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) { cin >> a[i]; b[i] = a[i]; } sort(b.begin(), b.end()); int cnt = 0; for (int i = 0; i < n; ++i) { if (a[i] != b[i]) { ++cnt; } } if (cnt <= 2) { cout << YES ; } else { cout << NO ; } cerr << n nTime elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long ax, ay, bx, by, cx, cy; int solve(long long x2, long long y2) { if (cx == 0 && cy == 0) { if (x2 == 0 && y2 == 0) return 1; return 0; } else if (cx == 0) { long long g, h; g = x2 / cy; h = y2 / cy; if (g * cy == x2 && h * cy == y2) return 1; return 0; } else if (cy == 0) { long long g, h; g = x2 / cx; h = y2 / cx; if (g * cx == x2 && h * cx == y2) return 1; return 0; } else { long long a, b; if ((cx * cy + cx * cx) == 0) return 0; b = (x2 * cy - y2 * cx) / (cy * cy + cx * cx); a = (x2 - b * cy) / cx; if (b * (cy * cy + cx * cx) == (x2 * cy - y2 * cx) && (a * cx == x2 - b * cy)) { return 1; } return 0; } return 0; } int main() { scanf( %lld%lld , &ax, &ay); scanf( %lld%lld , &bx, &by); scanf( %lld%lld , &cx, &cy); if (solve(bx - ax, by - ay)) { puts( YES ); return 0; } if (solve(bx + ax, by + ay)) { puts( YES ); return 0; } if (solve(bx - ay, by + ax)) { puts( YES ); return 0; } if (solve(bx + ay, by - ax)) { puts( YES ); return 0; } puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int g[100100]; int suff[100100]; char S[1024]; set<int> crim; char T[100100]; int R[100100], neg[100100]; int main() { int n, m, tot = 0; scanf( %d , &n); scanf( %d , &m); for (int i = 0; i < n; i++) { scanf( %s , S); int l = strlen(S); char sign = S[0]; int pos = 1, num = 0; while (pos < l) { num = num * 10 + S[pos] - 0 ; pos++; } num--; if (S[0] == + ) g[num]++; else { tot++; neg[num]++; } T[i] = S[0]; R[i] = num; } for (int i = 0; i < n; i++) { g[i] += tot; g[i] -= neg[i]; } for (int i = 0; i < n; i++) { if (g[i] == m) crim.insert(i); } int prob = crim.size(); for (int i = 0; i < n; i++) { if (T[i] == + ) { if (crim.find(R[i]) == crim.end()) { puts( Lie ); } else { if (prob == 1) puts( Truth ); else puts( Not defined ); } } else { if (crim.find(R[i]) == crim.end()) { puts( Truth ); } else { if (prob == 1) puts( Lie ); else puts( Not defined ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int su[3000000]; vector<int> vec; int vv[3000010]; int main() { memset(su, 0, sizeof(su)); memset(vv, 0, sizeof(vv)); vec.push_back(2); for (int i = 3; i <= 2750131; i++) { for (int j = 0; j < vec.size(); j++) { if (vec[j] * vec[j] > i) break; if (i % vec[j] == 0) { su[i] = i / vec[j]; break; } } if (su[i] == 0) vec.push_back(i); } int n; scanf( %d , &n); int h_sum = 2 * n; for (int i = 1; i <= 2 * n; i++) { int x; scanf( %d , &x); vv[x]++; } for (int i = 2750131; i >= 2; i--) { while (su[i] && vv[i]) { printf( %d , i); vv[i]--; vv[su[i]]--; h_sum -= 2; } } for (int i = 2750131; i >= 2; i--) { if (h_sum == 0) break; while (vv[i]) { int k = lower_bound(vec.begin(), vec.end(), i) - vec.begin() + 1; printf( %d , k); vv[i]--; vv[k]--; h_sum -= 2; if (h_sum == 0) break; } } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; vector<pair<int, int>> d(n); for (auto &i : d) cin >> i.first, i.second = &i - &d[0] + 1; sort(d.begin(), d.end()); vector<pair<int, int>> e; vector<int> a; a.push_back(2 * d.back().second - 1); for (int i = 1; i < d.back().first; ++i) a.push_back(-1); a.push_back(2 * d.back().second); int l = 0, r = a.size() - 1; d.pop_back(); while (!d.empty()) { auto p = d.back(); d.pop_back(); if (a[l + 1] == -1) { ++l; a[l] = 2 * p.second - 1; if (p.first == r - l + 1) { ++r; a.push_back(2 * p.second); } else { e.push_back({l + p.first - 1, 2 * p.second}); } } else { ++r; a.push_back(2 * p.second); e.push_back({r - p.first + 1, 2 * p.second - 1}); } } for (size_t i = 1; i < a.size(); ++i) cout << a[i - 1] << << a[i] << n ; for (auto &i : e) cout << a[i.first] << << i.second << n ; return 0; } |
#include <bits/stdc++.h> int main() { int count, i, a, x, max, tc; scanf( %d , &tc); for (int j = 0; j < tc; j++) { count = 0, max = 0; scanf( %d , &x); char s[x]; scanf( %s , s); for (i = x - 1; i >= 0; i--) { if (s[i] == P ) { count += 1; } else { if (count > max) { max = count; } count = 0; } } printf( %d n , max); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 23e4 + 5; int sum[M], n, fen[M]; int Get(int p) { int u = p; int ans = 0; for (; p > 0; p -= p & -p) ans += fen[p]; for (u++; u < M; u += u & -u) fen[u]++; return ans; } int get(int p) { int cur = 0; for (int i = 17; ~i; i--) { int d = cur + (1 << i); if (fen[d] <= p) p -= fen[d], cur = d; } int u = cur; for (u++; u < M; u += u & -u) fen[u]--; return cur; } int32_t main() { scanf( %d , &n); int t = 2; while (t--) { memset(fen, 0, sizeof fen); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); sum[i] += x - Get(x); } } int sb = 0; for (int i = n - 1; ~i; i--) { sum[i] += sb; int k = sum[i] % (n - i); sb = (sum[i] - k) / (n - i); sum[i] = k; } for (int i = 1; i < M; i++) fen[i] = i & -i; for (int i = 0; i < n; i++) printf( %d , get(sum[i])); return printf( n ), 0; } |
#include <bits/stdc++.h> using namespace std; string s; long long pos = -1; const long long N = 5005; long long gundy[N]; long long mex[N]; void game() { long long len = s.length(); long long totXo = 0; gundy[0] = 0; for (long long i = 1; i < N; i++) { for (long long j = 0; j < N; j++) mex[j] = 0; for (long long j = 0; j < i; j++) { long long l = max(0LL, j - 1); long long r = max(0LL, i - j - 2); long long xo = gundy[l] ^ gundy[r]; if (xo < N) mex[xo] = 1; } long long gv = 0; while (gv < N && mex[gv] == 1) gv++; gundy[i] = gv; } for (long long i = 1; i < len - 1; i++) { if (s[i - 1] == s[i + 1]) { long long j = i; while (j + 2 < len && s[j] == s[j + 2]) j++; totXo ^= gundy[j - i + 1]; i = j + 1; } } if (totXo == 0) cout << Second << n ; else { cout << First << n ; for (long long i = 1; i < len - 1; i++) { if (s[i - 1] == s[i + 1]) { long long j = i; while (j + 2 < len && s[j] == s[j + 2]) j++; long long span = j - i + 1; long long remXo = totXo ^ gundy[span]; for (long long k = 0; k < span; k++) { long long l = max(0LL, k - 1LL); long long r = max(0LL, span - k - 2LL); long long xo = gundy[l] ^ gundy[r] ^ remXo; if (xo == 0) { pos = i + k + 1; cout << pos << n ; return; } } i = j + 1; } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> s; game(); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; long long a = 0; long long ret = 0; long long x = n; while (x >= 10) { a = a * 10 + 9; ret += 9; x /= 10; } long long y = n - a; while (y) { ret += y % 10; y /= 10; } cout << ret << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { long long int n, z = 0, o = 0; cin >> n; string s; cin >> s; if (n == 1) { cout << s << endl; continue; } for (long long int i = 0; i < n; i++) { if (s[i] == 0 ) z++; else break; } z++; for (long long int i = n - 1; i >= 0; i--) { if (s[i] == 1 ) o++; else break; } if (o + z == n + 1) { cout << s << endl; continue; } while (z) { cout << 0 ; z--; } while (o) { cout << 1 ; o--; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int S = 100003; const int MOD = 1e9 + 7; const double pi = 2 * acos(0.0); inline int _Int() { int x; scanf( %d , &x); return x; } inline long long _LLi() { long long x; scanf( %lld , &x); return x; } void pruts() { puts( NO ); exit(EXIT_SUCCESS); } int dirX[] = {1, 0, -1, 0, 1, -1, 1, -1}; int dirY[] = {0, 1, 0, -1, 1, -1, -1, 1}; int rX[] = {1, 1, 2, 2, -1, -1, -2, -2}; int rY[] = {2, -2, 1, -1, 2, -2, 1, -1}; template <class T> T tri_Area(T x1, T y1, T x2, T y2, T x3, T y3) { return abs(x1 * (y2 - y3) - y1 * (x2 - x3) + (x2 * y3 - x3 * y2)); }; template <class T> T Distance(T x1, T y1, T x2, T y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }; template <class T> T bigMod(T n, T p, T m) { if (p == 0) return 1; if (p & 1) return (n * bigMod(n, p - 1, m)) % m; T x = bigMod(n, p / 2, m); return (x * x) % m; }; int sset(int N, int pos) { return N = N | (1 << pos); } bool check(int N, int pos) { return (bool)(N & (1 << pos)); } int reset(int N, int pos) { return N = N & ~(1 << pos); } void Hunger() { int a = _Int(); int b = _Int(); if (!a && !b) pruts(); puts((abs(a - b) <= 1) ? YES : NO ); } int main() { Hunger(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, A, B, ans = 0; long long fmin() { long long pros = (n - (n / k)) * A; if (B < pros) { n = n / k; return B; } else { n = n / k; return pros; } } int main() { cin >> n; cin >> k; cin >> A; cin >> B; if (k == 1) { cout << (n - 1) * A; return 0; } while (n != 1) { if (n >= k) { if (n % k == 0) { ans += fmin(); } else { long long t = (n % k); n = n - t; ans += (A * t); } } else { ans = ans + (n - 1) * A; n = 1; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long s = 0, t = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) t = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar(); return s * t; } const int N = 1e5 + 5; const long long inf = 0x3f3f3f3f3f3f3f3f; int n, top, Len = 1, s[N], nxt[N]; long long K, w[N], g[N], pre[N], suf[N]; vector<int> G[N]; long long a[N << 2], b[N << 2], d[N << 2], res[N << 2]; void Init(int x, long long t) { b[x] += t, res[x] -= t, d[x] += t; } void Pushdown(int x) { if (!d[x]) return; Init(x << 1, d[x]), Init(x << 1 | 1, d[x]), d[x] = 0; } long long Calc(int x, int l, int r, long long t) { if (l == r) return a[x] - t; int mid = (l + r) >> 1; Pushdown(x); if (b[x << 1] < t) return min(Calc(x << 1, l, mid, t), res[x]); return min(a[x << 1] - t, Calc(x << 1 | 1, mid + 1, r, t)); } void Build(int x, int l, int r) { if (l == r) { a[x] = b[x] = suf[l]; return; } int mid = (l + r) >> 1; Build(x << 1, l, mid), Build(x << 1 | 1, mid + 1, r); a[x] = min(a[x << 1], a[x << 1 | 1]), b[x] = min(b[x << 1], b[x << 1 | 1]); res[x] = Calc(x << 1 | 1, mid + 1, r, b[x << 1]); } void Upd(int x, int l, int r, int ql, int qr, long long t) { if (ql <= l && r <= qr) { Init(x, t); return; } int mid = (l + r) >> 1; Pushdown(x); if (ql <= mid) Upd(x << 1, l, mid, ql, qr, t); if (qr > mid) Upd(x << 1 | 1, mid + 1, r, ql, qr, t); b[x] = min(b[x << 1], b[x << 1 | 1]), res[x] = Calc(x << 1 | 1, mid + 1, r, b[x << 1]); } int Find(int x, int l, int r, long long t) { if (l == r) return l; int mid = (l + r) >> 1; Pushdown(x); return a[x << 1 | 1] <= t ? Find(x << 1 | 1, mid + 1, r, t) : Find(x << 1, l, mid, t); } int Solve(int x, int l, int r, long long &t) { if (l == r) { int tp = a[x] - t <= K ? l : 0; return t = min(t, b[x]), tp; } int mid = (l + r) >> 1; Pushdown(x); if (b[x << 1] < t) { if (res[x] <= K) return Solve(x << 1 | 1, mid + 1, r, t = b[x << 1]); int tp = Solve(x << 1, l, mid, t); return t = min(t, b[x]), tp; } else { int tp = a[x << 1] <= K + t ? Find(x << 1, l, mid, K + t) : 0; return max(tp, Solve(x << 1 | 1, mid + 1, r, t)); } } void DFS(int x) { s[++top] = x; if (nxt[x] <= n) Upd(1, 1, n, nxt[x] - 1, n, pre[x] - pre[nxt[x]]); if (x <= n) { int l = 2, r = top - 1, res = 1; while (l <= r) { int mid = (l + r) >> 1; if (pre[s[mid]] - pre[x] > K) res = mid, l = mid + 1; else r = mid - 1; } int lim = s[res] - 1; if (x > 1) Upd(1, 1, n, 1, x - 1, inf); Upd(1, 1, n, lim, n, -inf); long long tp = inf; int pos = Solve(1, 1, n, tp); if (x > 1) Upd(1, 1, n, 1, x - 1, -inf); Upd(1, 1, n, lim, n, inf); Len = max(Len, pos - x + 1); } for (auto y : G[x]) DFS(y); if (nxt[x] <= n) Upd(1, 1, n, nxt[x] - 1, n, pre[nxt[x]] - pre[x]); top--; } int main() { n = read(), K = read(); for (int i = 1; i < n; i++) w[i] = read(); for (int i = 1; i <= n; i++) g[i] = read(); for (int i = 2; i <= n; i++) { pre[i] = pre[i - 1] + w[i - 1] - g[i - 1]; suf[i] = suf[i - 1] + w[i - 1] - g[i]; } for (int i = n; i >= 1; i--) { while (top && pre[s[top]] <= pre[i]) top--; nxt[i] = top ? s[top] : n + 1, s[++top] = i; G[nxt[i]].push_back(i); } nxt[n + 1] = n + 1, top = 0; Build(1, 1, n), DFS(n + 1), printf( %d , Len); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const double EPS = 1e-9; const int INF = 1 << 29; int main() { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; int x, y; cin >> x >> y; int dx = abs(x1 - x2), dy = abs(y1 - y2); if (dx % x || dy % y) { puts( NO ); return 0; } int t = dx / x - dy / y; if (t & 1) { puts( NO ); } else { puts( YES ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a, s, d[100002], f, g, h, j, k, l, i, n, m; string x; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> d[i]; } for (i = 0; i < n; i++) { scanf( n ); getline(cin, x); for (a = 0; a < x.size(); a++) { if (x[a] == a ) d[i]--; if (x[a] == e ) d[i]--; if (x[a] == i ) d[i]--; if (x[a] == o ) d[i]--; if (x[a] == u ) d[i]--; if (x[a] == y ) d[i]--; } if (d[i] != 0) { cout << NO ; return 0; } } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; bool v[1005][1005][4][3]; char grid[1005][1005]; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; int n, m; int xx, yy; bool dfs(int x, int y, int dir, int turns) { if (x < 0 || x == n || y < 0 || y == m || turns > 2 || grid[x][y] == * ) return false; if (v[x][y][dir][turns]) return false; v[x][y][dir][turns] = true; if (x == xx && y == yy) return true; bool can = false; for (int i = 0; i < 4; i++) can |= dfs(x + dx[i], y + dy[i], i, turns + (i != dir)); return can; } int main() { cin >> n >> m; pair<int, int> second, t; for (int i = 0; i < n; i++) { scanf( %s , grid[i]); for (int j = 0; j < m; j++) { if (grid[i][j] == S ) second = make_pair(i, j); else if (grid[i][j] == T ) t = make_pair(i, j); } } xx = t.first, yy = t.second; if (dfs(second.first, second.second, 0, 0) || dfs(second.first, second.second, 1, 0) || dfs(second.first, second.second, 2, 0) || dfs(second.first, second.second, 3, 0)) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 300000; vector<long long> st; void add(vector<long long>& st, int x, long long inc) { while (x < st.size()) { st[x] += inc; x |= x + 1; } } long long sum(const vector<long long>& st, int x) { long long s = 0; while (x >= 0) { s += st[x]; x = (x & (x + 1)) - 1; } return s; } void insert(int l, int r, long long p) { add(st, r + 1, -p); add(st, l, p); } int n, m, k; int l[maxn], r[maxn]; long long d[maxn]; pair<int, int> a[maxn]; long long p[maxn]; int main() { cin >> n >> m >> k; st.resize(n + 3); for (int i = 1; i <= n; i++) scanf( %I64d , &p[i]); for (int i = 1; i <= m; i++) { scanf( %d%d%I64d , &l[i], &r[i], &d[i]); } for (int i = 1; i <= k; i++) { int x, y; scanf( %d%d , &x, &y); a[i] = make_pair(x, -1); a[i + k] = make_pair(y + 1, 1); } sort(a + 1, a + 1 + 2 * k); int sta = 1, tot = 0; for (int i = 1; i <= m; i++) { while (sta <= 2 * k && a[sta].first == i) tot -= a[sta++].second; insert(l[i], r[i], d[i] * tot); } for (int i = 1; i <= n; i++) printf( %I64d , sum(st, i) + p[i]); } |
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; void dfs(long long int par, long long int node, vector<pair<long long int, string>> adj[], vector<long long int> &nodes, vector<bool> &visited) { visited[node] = true; nodes.push_back(node); for (auto child : adj[node]) { if (!visited[abs(child.first)]) { dfs(node, abs(child.first), adj, nodes, visited); } } } void dfs2(long long int par, long long int node, string role, vector<pair<long long int, string>> adj[], bool &ok, vector<bool> &visited2, long long int &cnt, vector<string> &cr) { for (auto child : adj[node]) { if (child.first > 0) { if (visited2[node] && (!visited2[child.first])) { visited2[child.first] = true; if (cr[node] == imposter ) { string childRole = child.second == imposter ? crewmate : imposter ; cr[child.first] = childRole; dfs2(node, child.first, childRole, adj, ok, visited2, cnt, cr); } else { string childRole = child.second == imposter ? imposter : crewmate ; cr[child.first] = childRole; dfs2(node, child.first, childRole, adj, ok, visited2, cnt, cr); } } else if ((!visited2[node]) && visited2[child.first]) { visited2[node] = true; if (cr[child.first] == imposter ) { string childRole = child.second == imposter ? crewmate : imposter ; cr[node] = childRole; } else { string childRole = child.second == imposter ? imposter : crewmate ; cr[node] = childRole; } } else if (visited2[child.first] && visited2[node]) { if (cr[child.first] == imposter ) { if (cr[node] == imposter && child.second == imposter ) { ok = false; return; } else if (cr[node] == crewmate && child.second == crewmate ) { ok = false; return; } } else { if (cr[node] == imposter && child.second == crewmate ) { ok = false; return; } else if (cr[node] == crewmate && child.second == imposter ) { ok = false; return; } } } if (!ok) { return; } } } for (auto child : adj[node]) { if (child.first < 0) { if ((!visited2[abs(child.first)]) && visited2[node] == true) { dfs2(node, abs(child.first), imposter , adj, ok, visited2, cnt, cr); } } if (!ok) { return; } } for (auto child : adj[node]) { if (child.first > 0) { if (visited2[node] && (!visited2[child.first])) { visited2[child.first] = true; if (cr[node] == imposter ) { string childRole = child.second == imposter ? crewmate : imposter ; cr[child.first] = childRole; dfs2(node, child.first, childRole, adj, ok, visited2, cnt, cr); } else { string childRole = child.second == imposter ? imposter : crewmate ; cr[child.first] = childRole; dfs2(node, child.first, childRole, adj, ok, visited2, cnt, cr); } } else if (visited2[child.first] && visited2[node]) { if (cr[child.first] == imposter ) { if (cr[node] == imposter && child.second == imposter ) { ok = false; return; } else if (cr[node] == crewmate && child.second == crewmate ) { ok = false; return; } } else { if (cr[node] == imposter && child.second == crewmate ) { ok = false; return; } else if (cr[node] == crewmate && child.second == imposter ) { ok = false; return; } } } } if (!ok) { return; } } } void answerNikalBc(long long int t1) { long long int n, m; cin >> n >> m; map<pair<long long int, long long int>, string> mp; vector<pair<long long int, string>> adj[n + 1]; bool ok = true; for (long long int i = 1; i <= m; i++) { long long int u, v; string s; cin >> u >> v >> s; if (mp.find({u, v}) == mp.end()) { adj[u].push_back({v, s}); adj[v].push_back({-1 * u, s}); mp[{u, v}] = s; } else { if (mp[{u, v}] == s) { continue; } else { ok = false; } } } if (!ok) { cout << -1 << n ; return; } long long int ans = 0; vector<bool> visited(n + 1, false); vector<bool> visited2(n + 1, false); vector<string> childRole(n + 1, imposter ); for (long long int i = 1; i <= n; i++) { if (!visited[i]) { vector<long long int> nodes; dfs(-1, i, adj, nodes, visited); bool init = false; long long int cnt1 = 0, cnt2 = 0; for (long long int j = 0; j < nodes.size(); j++) { if (!visited2[nodes[j]]) { if (!init) { visited2[nodes[j]] = true; childRole[nodes[j]] = imposter ; dfs2(-1, nodes[j], imposter , adj, ok, visited2, cnt1, childRole); init = true; } else { dfs2(-1, nodes[j], imposter , adj, ok, visited2, cnt1, childRole); } } } for (auto a : nodes) { visited2[a] = false; } for (auto a : nodes) { if (childRole[a] == imposter ) { cnt1++; } } init = false; for (long long int j = 0; j < nodes.size(); j++) { if (!visited2[nodes[j]]) { if (!init) { visited2[nodes[j]] = true; childRole[nodes[j]] = crewmate ; dfs2(-1, nodes[j], crewmate , adj, ok, visited2, cnt2, childRole); init = true; } else { dfs2(-1, nodes[j], crewmate , adj, ok, visited2, cnt2, childRole); } } } for (auto a : nodes) { if (childRole[a] == imposter ) { cnt2++; } } if (!ok) { cout << -1 << n ; return; } ans += (max(cnt1, cnt2)); } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; t = 1; cin >> t; for (long long int i = 1; i <= t; i++) { answerNikalBc(t); } cerr << time taken : << (float)clock() / CLOCKS_PER_SEC << secs << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 * 100 + 10; int a[MAXN], b[MAXN]; int dp[MAXN][310]; vector<int> vec1[MAXN], vec[MAXN]; long long n, m, second, E; bool ok(int k) { long long need = second; for (int i = k - 1; i < n; i++) if (dp[i][k] < m) need = min(need, (long long)(i + 1 + dp[i][k] + 1)); need += k * E; if (need <= second) return true; return false; } int bs(int s, int e) { if (e - s <= 1) return s; int m = (s + e) / 2; return ok(m) ? bs(m, e) : bs(s, m); } int main() { cin >> n >> m >> second >> E; for (int i = 0; i < n; i++) cin >> a[i], vec1[a[i]].push_back(i); for (int i = 0; i < m; i++) cin >> b[i], vec[b[i]].push_back(i); for (int i = 0; i < MAXN; i++) vec[i].push_back(m); for (int i = 0; i < n; i++) for (int j = 0; j < 301; j++) dp[i][j] = m; for (int i = 0; i < n; i++) for (int j = 0; j < min(min((int)m, i + 1), 300) + 1; j++) { if (j == 0) dp[i][j] = -1; else if (i == 0) dp[i][j] = vec[a[i]][lower_bound(vec[a[i]].begin(), vec[a[i]].end(), 0) - vec[a[i]].begin()]; else dp[i][j] = min(dp[i - 1][j], (dp[i - 1][j - 1] >= m) ? (int)m : vec[a[i]] [(int)(lower_bound(vec[a[i]].begin(), vec[a[i]].end(), dp[i - 1][j - 1] + 1) - vec[a[i]].begin())]); } cout << bs(0, min({(int)m, (int)n, 300}) + 1) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int readInt() { char c; int tmp = 0, x = 1; c = getchar(); while (c > 9 || c < 0 ) { if (c == - ) x = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { tmp = tmp * 10 + c - 0 ; c = getchar(); } return tmp * x; } const int maxN = 2000 + 10; const int maxM = 100000 + 10; int Head[maxN], eg[maxM << 1], nxt[maxM << 1], tot = 1; void addEdge(int u, int v) { eg[++tot] = v; nxt[tot] = Head[u]; Head[u] = tot; eg[++tot] = u; nxt[tot] = Head[v]; Head[v] = tot; } bool isbri[maxM << 2]; int dfn[maxN], low[maxN], dfsclock = 0; void tarjan(int v, int InEdge) { dfn[v] = low[v] = ++dfsclock; for (int i = Head[v]; i; i = nxt[i]) { int u = eg[i]; if (!dfn[u]) { tarjan(u, i); low[v] = min(low[v], low[u]); if (low[u] > dfn[v]) isbri[i] = isbri[i ^ 1] = true; } else if (i != (InEdge ^ 1)) low[v] = min(low[v], dfn[u]); } } int bccno[maxN], num = 0, bccsiz[maxN]; void dfs(int v) { bccno[v] = num; bccsiz[num]++; for (int i = Head[v]; i; i = nxt[i]) { int u = eg[i]; if (!bccno[u] && !isbri[i]) dfs(u); } } vector<int> g[maxN]; void new_addEdge(int u, int v) { g[u].push_back(v); g[v].push_back(u); } bool vis[maxN], isLeaf[maxN]; int tmp = 0, tmpmax = -1, tmpleaf = 0, Leaf[maxN], siz[maxN], rot[maxN], cnt = 0, Fa[maxN], Belong[maxN]; void predfs(int v, int fa) { siz[v] = 1; Fa[v] = fa; Belong[v] = cnt; if ((int)g[v].size() == 0 || (int)g[v].size() == 1) Leaf[cnt]++, isLeaf[v] = true; for (int i = 0; i < (int)g[v].size(); i++) { int u = g[v][i]; if (u != fa) predfs(u, v), siz[v] += siz[u]; } } void FindLongest(int v, int fa, int D, int lev) { if (tmp < D) tmp = D, tmpmax = v, tmpleaf = lev; for (int i = 0; i < (int)g[v].size(); i++) { int u = g[v][i]; if (u != fa) FindLongest(u, v, D + (!isLeaf[u]), lev + isLeaf[u]); } } int FindDiameter(int v) { tmp = 0, tmpmax = -1; for (int i = 0; i < (int)g[v].size(); i++) { int u = g[v][i]; FindLongest(u, v, 1, 0); } if (!(~tmpmax)) return 0; int vv = tmpmax; tmp = 0, tmpmax = -1, tmpleaf = 0; FindLongest(vv, -1, 1, isLeaf[vv]); return tmp - tmpleaf; } int n, m; int main() { n = readInt(), m = readInt(); int u, v; for (int i = 1; i <= m; i++) { u = readInt(), v = readInt(); addEdge(u, v); } for (int i = 1; i <= n; i++) { if (!dfn[i]) tarjan(i, 0); } for (int i = 1; i <= n; i++) { if (!bccno[i]) { num++; dfs(i); } } for (int i = 2; i <= tot; i += 2) { if (bccno[eg[i]] != bccno[eg[i ^ 1]]) { new_addEdge(bccno[eg[i]], bccno[eg[i ^ 1]]); } } int ans = 0; for (int i = 1; i <= num; i++) ans += bccsiz[i] - 1; cnt = 0; for (int i = 1; i <= num; i++) { if (!Belong[i]) cnt++, rot[cnt] = i, predfs(i, -1); } ans += cnt - 1; for (int i = 1; i <= cnt; i++) { int d = FindDiameter(rot[i]); ans += siz[rot[i]] - d - Leaf[i]; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000010; int pre[N], rak[N]; int find(int first) { if (pre[first] == -1) return first; return pre[first] = find(pre[first]); } void unions(int first, int second) { first = find(first); second = find(second); if (first == second) return; if (rak[first] < rak[second]) swap(first, second); rak[first] += rak[second]; pre[second] = first; } vector<pair<int, int> > rows[N], col[N]; void scc(int n, int m) { memset(pre, -1, sizeof(pre)); fill(rak, rak + N, 1); for (int i = 1; i <= n; i++) { sort(rows[i].begin(), rows[i].end()); for (int j = 1; j < m; j++) { if (rows[i][j - 1].first == rows[i][j].first) unions((i - 1) * m + rows[i][j - 1].second, (i - 1) * m + rows[i][j].second); } } for (int j = 1; j <= m; j++) { sort(col[j].begin(), col[j].end()); for (int i = 1; i < n; i++) { if (col[j][i - 1].first == col[j][i].first) unions((col[j][i - 1].second - 1) * m + j, (col[j][i].second - 1) * m + j); } } } vector<int> edges[N]; int deg[N], ans[N]; stack<int> stk; void topo(int n, int m) { for (int i = 1; i <= n; i++) { for (int j = 1; j < m; j++) { if (rows[i][j - 1].first < rows[i][j].first) { int first = find((i - 1) * m + rows[i][j - 1].second); int second = find((i - 1) * m + rows[i][j].second); edges[first].push_back(second); deg[second]++; } } } for (int j = 1; j <= m; j++) { for (int i = 1; i < n; i++) { if (col[j][i - 1].first < col[j][i].first) { int first = find((col[j][i - 1].second - 1) * m + j); int second = find((col[j][i].second - 1) * m + j); edges[first].push_back(second); deg[second]++; } } } n = n * m; for (int i = 1; i <= n; i++) if (!deg[i] && pre[i] == -1) stk.push(i), ans[i] = 1; while (!stk.empty()) { int u = stk.top(); stk.pop(); for (int i = 0; i < edges[u].size(); i++) { int first = edges[u][i]; ans[first] = max(ans[first], ans[u] + 1); deg[first]--; if (!deg[first]) stk.push(first); } } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1, first; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &first); rows[i].push_back(make_pair(first, j)); col[j].push_back(make_pair(first, i)); } } scc(n, m); topo(n, m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { printf( %d%c , ans[find((i - 1) * m + j)], (j == m) ? n : ); } } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; int t; void solve(); struct Node { long long q, w, e, r, t; }; int n; vector<Node> a; vector<bool> ans; int res = 0; int main() { ios_base::sync_with_stdio(false); cin.tie(0); t = 1; for (int i = 0; i < t; ++i) { solve(); } } void solve() { cin >> n; a.resize(n); ans.resize(n); for (int i = 0; i < int(n); ++i) { cin >> a[i].q >> a[i].w >> a[i].e >> a[i].r >> a[i].t; } if (n > 66) { cout << 0; return; } for (int i = 0; i < int(n); ++i) { for (int j = (0); j <= int(n - 1); ++j) { for (int k = (j + 1); k <= int(n - 1); ++k) { if (j == i || k == i) { continue; } if ((a[j].q - a[i].q) * (a[k].q - a[i].q) + (a[j].w - a[i].w) * (a[k].w - a[i].w) + (a[j].e - a[i].e) * (a[k].e - a[i].e) + (a[j].r - a[i].r) * (a[k].r - a[i].r) + (a[j].t - a[i].t) * (a[k].t - a[i].t) > 0) { ans[i] = true; break; } } if (ans[i]) break; } if (!ans[i]) res++; } cout << res << endl; for (int i = 0; i < int(n); ++i) { if (!ans[i]) { cout << i + 1 << endl; } } } |
#include <bits/stdc++.h> int main(void) { int w = 1; int h = 1; int n = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { char op[10] = {0}; scanf( %s , op); if (strcmp(op, UL ) == 0 || strcmp(op, DR ) == 0) w++; else if (strcmp(op, UR ) == 0 || strcmp(op, DL ) == 0) h++; else { w++; h++; } } printf( %I64d n , (long long)w * h); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.