func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { int x, y; while (scanf( %d %d , &x, &y) != EOF) { while (x >= 0 && y >= 0) { if (x >= 2 && y >= 2) { x -= 2; y -= 2; } else if (x == 1 && y >= 12) { x -= 1; y -= 12; } else if (x == 0 && y >= 22) { y -= 22; } else { puts( Hanako ); break; } if (y >= 22) { y -= 22; } else if (y >= 12 && x >= 1) { x -= 1; y -= 12; } else if (x >= 2 && y >= 2) { x -= 2; y -= 2; } else { puts( Ciel ); break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10, LEN = 5e3 + 10, S = 51, INF = 1e18; long long f[N], l[N], r[N], sum[N]; long long lq[S], rq[S], sq[S], mq[S]; long long a[LEN], sx[LEN], mx[LEN]; int n, m; int main() { scanf( %d%d , &n, &m); memset(mq, -0x3f, sizeof mq); for (int i = 1, s; i <= n; i++) { scanf( %d , &s); for (int j = 1; j <= s; j++) scanf( %lld , &a[j]); for (int j = 1; j <= s; j++) sx[j] = sx[j - 1] + a[j]; for (int j = 1; j <= s; j++) { mx[j] = max(mx[j - 1] + a[j], a[j]); mq[i] = max(mq[i], mx[j]); } lq[i] = a[1]; for (int j = 2; j <= s; j++) lq[i] = max(lq[i], sx[j]); rq[i] = a[n]; for (int j = s - 2; j >= 0; j--) rq[i] = max(rq[i], sx[s] - sx[j]); sq[i] = sx[s]; } long long res = -INF; for (int i = 1, x; i <= m; i++) { scanf( %d , &x); l[i] = lq[x]; r[i] = rq[x]; sum[i] = sum[i - 1] + sq[x]; res = max(res, mq[x]); } f[1] = l[1]; long long maxv = r[1] - sum[1], ans = f[1]; for (int i = 2; i <= m; i++) { f[i] = sum[i - 1] + l[i] + maxv; maxv = max(maxv, r[i] - sum[i]); ans = max(ans, f[i]); } printf( %lld n , max(ans, res)); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; long long ships = 0; while (a != 0 && b != 0) { if (b > a) { ships += b / a; b = b % a; } else { ships += a / b; a = a % b; } } cout << ships << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int getsum(string st) { int rest = 0; for (int i = 0; i < st.size(); i++) { rest += st[i] - 0 ; } return rest; } string streverse(string st) { for (int i = 0; i < st.size() / 2; i++) { char tmp = st[i]; st[i] = st[st.size() - 1 - i]; st[st.size() - 1 - i] = tmp; } return st; } string getGreater(int a, int num, string st) { int increase = a - num; for (int i = st.size() - 1; i >= 0; i--) { if (st[i] - 0 < 9) { int increment = min(9 - (st[i] - 0 ), increase); st[i] += increment; increase -= increment; } if (increase == 0) return st; } string rest = ; for (int i = 0; i < a / 9; i++) rest = rest + 9 ; if (a % 9 > 0) { rest = rest + (char)( 0 + a % 9); } return streverse(rest); } string getLess(int a, int num, string st) { int decrease = num - a; decrease++; int sum = 0; for (int i = st.size() - 1; i >= 1; i--) { sum += st[i] - 0 ; if (sum >= decrease) { if (st[i - 1] - 0 < 9) { st[i - 1]++; sum = sum - decrease; for (int j = i; j < st.size(); j++) st[j] = 0 ; int indx = st.size() - 1; while (sum > 0) { if (sum > 9) { st[indx] += 9; sum -= 9; } else { st[indx] += sum; sum = 0; } indx--; } return st; } } } st = 1 + st; for (int i = 1; i < st.size(); i++) { st[i] = 0 ; } a--; int k; for (k = 0; k < a / 9; k++) { st[st.size() - 1 - k] = 9 ; } if (a % 9) { for (int i = st.size() - 1; i >= 0; i--) { if (st[i] == 0 ) { st[i] = (char)( 0 + a % 9); break; } } } return st; } string getnum(int a, string st) { int num = getsum(st); if (a > num) { return getGreater(a, num, st); } return getLess(a, num, st); } int main() { getnum(13, 1093 ); int n; cin >> n; string pre = ; for (int i = 0; i < n; i++) { int a; cin >> a; string rest = getnum(a, pre); cout << rest << endl; pre = rest; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 10, N = 2e5 + 10, mod = 998244353, lg = 20, sq = 450; long long t, n, k, first[N], ans; inline long long power(long long x, long long y) { long long ret = 1; x %= mod; while (y) { if (y & 1) ret = (ret * x) % mod; x = (x * x) % mod; y >>= 1; } return ret; } inline long long C(long long x, long long y) { long long ret = first[y]; ret = (ret * power(first[x], mod - 2)) % mod; ret = (ret * power(first[y - x], mod - 2)) % mod; return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); first[0] = 1; for (int i = 1; i < N; i++) first[i] = (first[i - 1] * i) % mod; cin >> n >> k; if (k >= n) return cout << 0, 0; for (int i = 0; i <= n - k; i += 2) ans = (ans + ((power(n - k - i, n) * C(n - k - i, n - k)) % mod)) % mod; for (int i = 1; i <= n - k; i += 2) ans = (mod + ans - ((power(n - k - i, n) * C(n - k - i, n - k)) % mod)) % mod; ans = (ans * C(n - k, n)) % mod; if (k) ans = (ans * 2) % mod; cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long Deci(int arr[], int base, int n) { long long power = 1; long long num = 0; for (int i = n - 1; i >= 0; i--) { num += arr[i] * power; power = power * base; } return num; } int main() { int n, m, x, y; cin >> n >> x; int arr[n + 3]; for (int i = 0; i < n; i++) { cin >> arr[i]; } cin >> m >> y; int brr[m + 3]; for (int i = 0; i < m; i++) { cin >> brr[i]; } long long X = Deci(arr, x, n); long long Y = Deci(brr, y, m); if (X < Y) cout << < n ; else if (X > Y) cout << > n ; else cout << = n ; } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long m) { if (y == 0) return 1; long long p = power(x, y / 2, m) % m; p = (p * p) % m; return (y % 2 == 0) ? p : (x * p) % m; } long long gcd(long long a, long long b) { if (a > b) swap(a, b); if (a == 0) return b; return gcd(b % a, a); } long long modInverse(long long a, long long m) { return power(a, m - 2, m); } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); ; long long t; cin >> t; while (t--) { long long x; cin >> x; string s; cin >> s; long long c = 1, ans = s.size(); while (c <= x) { long long k = s[c - 1] - 1 ; if (s.size() < x) { string a; a = s.substr(c, s.size()); ans += a.size() * k; while (k--) s += a; c++; ans = ans % 1000000007; } else { ans += (ans - c) * k; ans = ans % 1000000007; c++; } } cout << (ans + 1000000007) % 1000000007 << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<string> v; int a[26] = {0}; int main() { int n, i, j, co = 0, F = -1; string s, s2; cin >> s; for (i = 0; i < s.size(); i++) { a[s[i] - a ] = 1; } cin >> s2 >> n; while (n--) { cin >> s; v.push_back(s); } for (i = 0; i < v.size(); i++) { co = 0; if (v[i].size() < s2.size() - 1) { cout << NO << endl; continue; } for (j = 0; j < s2.size(); j++) { if (s2[j] == * ) { F = j; break; } if ((s2[j] != v[i][j] && s2[j] != ? ) || (s2[j] == ? && a[v[i][j] - a ] == 0)) { cout << NO << endl; co = 1; break; } } if (co != 1) { int K = v[i].size() - 1; for (j = s2.size() - 1; j >= 0; j--) { if (s2[j] == * ) break; if ((s2[j] != v[i][K] && s2[j] != ? ) || (s2[j] == ? && a[v[i][K] - a ] == 0)) { cout << NO << endl; co = 1; break; } K--; } } if (co != 1 && v[i].size() >= s2.size() && F != -1) { int p = v[i].size() - (s2.size() - 1); for (j = F; p != 0; j++) { if (a[v[i][j] - a ] == 1) { cout << NO << endl; co = 1; break; } p--; } } if (F == -1 && v[i].size() > s2.size() && co != 1) { cout << NO << endl; co = 1; } if (co == 0) cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, ans = 0, res = 0; cin >> n >> m; vector<pair<long long, long long>> v; set<pair<long long, long long>> s; for (int i = 0; i < n; i++) { long long p, q; cin >> p >> q; v.push_back(make_pair(q, p)); } sort(v.begin(), v.end(), greater<pair<long long, long long>>()); for (int i = 0; i < n; i++) { res += v[i].second; s.insert(make_pair(v[i].second, i)); while (s.size() > m) { auto it = s.begin(); res -= it->first; s.erase(it); } ans = max(ans, res * v[i].first); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long double E = 1e-9; char ccc; bool _minus = false; inline void read(int &n) { n = 0; _minus = false; while (true) { ccc = getchar(); if (ccc == || ccc == n ) break; if (ccc == - ) { _minus = true; continue; } n = n * 10 + ccc - 0 ; } if (_minus) n *= -1; } char wwww[12]; int kkkk; inline void write(int x) { kkkk = 0; if (!x) ++kkkk, wwww[kkkk] = 0 ; while (x) { ++kkkk; wwww[kkkk] = char(x % 10 + 0 ); x /= 10; } for (int i = kkkk; i >= 1; --i) putchar(wwww[i]); putchar( ); } template <typename T> inline T sqr(T t) { return t * t; } const int MAX = 1e5; vector<int> v1[MAX], v2[MAX]; bool ok1[MAX], ok2[MAX]; int ar[MAX]; void dfs1(int pos) { ok1[pos] = true; for (int i = 0; i < (int)v1[pos].size(); i++) { if (!ok1[v1[pos][i]]) { dfs1(v1[pos][i]); } } } void dfs2(int pos) { ok2[pos] = true; if (ar[pos] == 1) return; for (int i = 0; i < (int)v2[pos].size(); i++) { if (!ok2[v2[pos][i]]) { dfs2(v2[pos][i]); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; srand(time(NULL)); cout.precision(15); cout << fixed; int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> ar[i]; while (m--) { int a, b; cin >> a >> b; a--, b--; v1[a].push_back(b); v2[b].push_back(a); } for (int i = 0; i < n; i++) { if (ar[i] == 1 && !ok1[i]) { dfs1(i); } else if (ar[i] == 2 && !ok2[i]) { dfs2(i); } } for (int i = 0; i < n; i++) cout << (ok1[i] && ok2[i] ? 1 : 0) << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; map<int, int> m; bool f = true; vector<int> v; while (n--) { int a; cin >> a; v.push_back(a); m[a] += 1; if (m[a] > 1) f = false; } if (!f || !m[1]) { cout << -1 << endl; continue; } vector<int> o; set<int> s; for (int a : v) { o.push_back(a); s.insert(a); for (int i = a + 1; i < 201; i++) if (!m[i] && s.find(i) == s.end()) { o.push_back(i); s.insert(i); m[i] += 1; break; } } bool r = true; int p; for (int a : s) { if (f) p = a, f = false; if (a - p > 1) { r = false; break; } p = a; } f = false; if (r) for (int a : o) { if (f) cout << ; cout << a; f = true; } else cout << -1; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct data { int x, y; } v[300005]; inline bool cmp(data d1, data d2) { if (d1.x != d2.x) return d1.x < d2.x; return d1.y < d2.y; } inline bool cmp2(data d1, data d2) { return d1.y < d2.y; } int n; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &v[i].x); v[i].y = i; } sort(v + 1, v + n + 1, cmp); int minv = 0; for (int i = 1; i <= n; i++) { if (minv < v[i].x) { minv = v[i].x + 1; } else { v[i].x = minv; minv++; } } sort(v + 1, v + n + 1, cmp2); for (int i = 1; i <= n; i++) printf( %d , v[i].x); return 0; } |
#include <bits/stdc++.h> using namespace std; using VI = vector<int>; using PII = pair<int, int>; using ll = long long; const int M = 1e9 + 7; const int N = 2010; VI d{1110111, 10010, 1011101, 1011011, 111010, 1101011, 1101111, 1010010, 1111111, 1111011}; int GetDiff(int x, int y) { return __builtin_popcount(x) - __builtin_popcount(y); } int Convert(int x) { int s = 0, k = 1; while (x) { if (x % 10) s += k; x /= 10; k <<= 1; } return s; } int main() { for (auto& v : d) v = Convert(v); int n, k; scanf( %d %d , &n, &k); vector<VI> f(n + 1, VI(k + 1, -1)); VI a(n); vector<vector<PII>> g(n); for (int i = 0; i < n; ++i) { int t; scanf( %d , &t); a[i] = t = Convert(t); for (int j = 9; j >= 0; --j) { if ((d[j] & t) == t) g[i].push_back({j, GetDiff(d[j], t)}); } } for (auto& v : g[n - 1]) f[n - 1][v.second] = max(f[n - 1][v.second], v.first); for (int i = n - 2; i >= 0; --i) { for (auto& v : g[i]) { for (int j = 0; j < k + 1 - v.second; ++j) { if (f[i + 1][j] != -1) f[i][j + v.second] = max(f[i][j + v.second], v.first); } } } if (f[0][k] == -1) puts( -1 ); else { for (int i = 0; i < n; ++i) { printf( %d , f[i][k]); k -= GetDiff(d[f[i][k]], a[i]); } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, s1, s2, t1, t2, l1, l2; vector<int> adj[3333]; int dist[3333][3333]; void bfs(int index) { queue<int> q; q.push(index); dist[index][index] = 0; while (!q.empty()) { int cur = q.front(); q.pop(); for (int to : adj[cur]) { if (dist[index][to] != -1) continue; dist[index][to] = dist[index][cur] + 1; q.push(to); } } } int main() { while (scanf( %d %d , &n, &m) == 2) { memset(dist, -1, sizeof dist); for (int i = 0; i < n; i++) adj[i].clear(); for (int i = 0; i < m; i++) { int a, b; scanf( %d %d , &a, &b); adj[--a].push_back(--b); adj[b].push_back(a); } scanf( %d %d %d , &s1, &t1, &l1); --s1, --t1; scanf( %d %d %d , &s2, &t2, &l2); --s2, --t2; for (int i = 0; i < n; i++) bfs(i); if (dist[s1][t1] > l1 || dist[s2][t2] > l2) { puts( -1 ); continue; } int ans = dist[s1][t1] + dist[s2][t2]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { { int p1 = dist[s1][i] + dist[i][j] + dist[j][t1]; int p2 = dist[s2][i] + dist[i][j] + dist[j][t2]; if (p1 <= l1 && p2 <= l2) ans = min(ans, p1 + p2 - dist[i][j]); } { int p1 = dist[t1][i] + dist[i][j] + dist[j][s1]; int p2 = dist[s2][i] + dist[i][j] + dist[j][t2]; if (p1 <= l1 && p2 <= l2) ans = min(ans, p1 + p2 - dist[i][j]); } } ans = m - ans; printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const double INF = 1e20; const int N = 102; const int M = 1010; const int K = 10; int n; double C, T; const double Y = 1. / 0.9; pair<int, int> a[N]; double dp[N][M]; void read() { scanf( %d , &n); scanf( %lf%lf , &C, &T); for (int i = 0; i < n; i++) scanf( %d%d , &a[i].first, &a[i].second); sort(a, a + n); } int solve() { read(); dp[0][0] = 0; for (int it = 1; it <= n; it++) { for (int j = 0; j <= it * K; j++) dp[it][j] = INF; for (int i = it - 1; i >= 0; i--) for (int j = 0; j <= i * K; j++) { if (dp[i][j] >= INF / 2) continue; dp[i + 1][j + a[it - 1].second] = min(dp[i + 1][j + a[it - 1].second], dp[i][j] * Y + a[it - 1].first); } } for (int x = n * K; x >= 0; x--) for (int p = 0; p <= n; p++) { if (p * K < x || dp[p][x] >= INF / 2) continue; double X = dp[p][x] * Y; double t = X; if (C * X >= 1) t = 2 * sqrt(X / C) - 1. / C; t += p * 10; if (t <= T) return x; } throw; } int main() { int t; scanf( %d , &t); while (t--) printf( %d n , solve()); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const long long N = 2e5 + 10; ; long long n, p[N], t[N], a[N], b[N], Ma[N], Mi[N], T; long long check(double m) { double M = 0.0; for (long long i = 1, j = 1; i <= n; i++) { while (j <= n && p[b[j]] < p[b[i]]) M = max(M, (1.0 - m * Mi[b[j]] / T) * p[b[j]]), j++; if ((1.0 - m * Ma[b[i]] / T) * p[b[i]] < M) return 0; } return 1; } signed main() { scanf( %lld n , &n); for (long long i = 1; i <= n; i++) scanf( %lld , &p[i]), a[i] = i; for (long long i = 1; i <= n; i++) scanf( %lld , &t[i]), b[i] = i; sort(a + 1, a + n + 1, [&](long long i, long long j) { return p[i] * t[j] > p[j] * t[i]; }); sort(b + 1, b + n + 1, [&](long long i, long long j) { return p[i] < p[j]; }); for (long long i = 1, j, s; i <= n; i = j) { for (j = i + 1, s = 0; j <= n; j++) if (p[a[i]] * t[a[j]] != p[a[j]] * t[a[i]]) break; for (long long k = i; k < j; k++) s += t[a[k]]; for (long long k = i; k < j; k++) Mi[a[k]] = T + t[a[k]], Ma[a[k]] = T + s; T += s; } double l = 0, r = 1; while (r - l > eps) { double mid = (l + r) / 2.0; if (!check(mid)) r = mid; else l = mid; } printf( %.10f n , l); return 0; } |
#include <bits/stdc++.h> using namespace std; string A; bool isPalindrome(int left, int right) { while (left < right) { if (A[left] != A[right]) return false; left++, right--; } return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> A; int N = A.size(); int bonus = 0; int ret = 0; if (N % 2 == 1) bonus = 1; N /= 2; while (N > 0) { if (isPalindrome(0, N - 1)) { if (N % 2 == 1) { N--; bonus = 1; } else N /= 2; } else { ret = 1 + bonus; break; } } if (ret == 0) cout << Impossible ; else cout << ret; return 0; } |
#include <bits/stdc++.h> using namespace std; const long o = 1e6 + 5; long n, i, j, h, k, sl, g, kq = 0; long a[o], b[o], c[o], A, B; string s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; i = 0, j = 0, h = 0, k = 0; for (long p = 1; p <= n; p++) { cin >> s >> g; if (s == 00 ) { i++; a[i] = g; } else if (s == 01 ) { j++; b[j] = g; } else if (s == 10 ) { h++; c[h] = g; } else if (s == 11 ) { k++; kq += g; } } if (k == 0 && (j == 0 || h == 0)) { cout << 0; return 0; } sort(a + 1, a + 1 + i); sort(b + 1, b + 1 + j); sort(c + 1, c + 1 + h); a[0] = b[0] = c[0] = 0; A = B = 0; sl = min(h, j); while (A < sl) { A++; kq += c[h]; h--; } while (B < sl) { B++; kq += b[j]; j--; } sl = 2 * (k + sl) - (k + 2 * sl); for (long p = 1; p <= sl; p++) { long ma = max(a[i], max(b[j], c[h])); if (ma == 0) break; kq += ma; if (ma == a[i]) i--; else if (ma == b[j]) j--; else if (ma == c[h]) h--; } cout << kq; return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans; struct arr { int n; int v; } a[200001], b[200001]; int n, m, i, j; bool cmp(arr a, arr b) { return a.n < b.n; } int main() { cin >> n; for (i = 1; i <= n; i++) cin >> a[i].n >> a[i].v; cin >> m; for (i = 1; i <= m; i++) cin >> b[i].n >> b[i].v; sort(a + 1, a + n + 1, cmp); sort(b + 1, b + m + 1, cmp); i = j = 1; while (i <= n && j <= m) { if (a[i].n == b[j].n) ans += max(a[i].v, b[j].v), i++, j++; else if (a[i].n < b[j].n) ans += a[i].v, i++; else ans += b[j].v, j++; } if (i > n) { for (i = j; i <= m; i++) ans += b[i].v; } else { for (j = i; j <= n; j++) ans += a[j].v; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void fft(vector<complex<double> > &a, bool invert) { int n = a.size(), lg = 0; while (1 << lg < n) ++lg; assert(1 << lg == n); for (int i = 0; i < n; ++i) { int rev = 0; for (int j = 0; j < lg; ++j) if ((i & 1 << j) != 0) rev |= 1 << (lg - j - 1); if (i < rev) swap(a[i], a[rev]); } vector<complex<double> > roots(n); for (int i = 0; i < n; ++i) { double a = 2 * M_PI * i / n * (invert ? -1 : 1); roots[i] = complex<double>(cos(a), sin(a)); } for (int len = 2; len <= n; len *= 2) for (int i = 0; i < n; i += len) for (int j = 0; j < len / 2; ++j) { complex<double> u = a[i + j], v = a[i + j + len / 2] * roots[n / len * j]; a[i + j] = u + v; a[i + j + len / 2] = u - v; } if (invert) for (int i = 0; i < n; ++i) a[i] /= n; } vector<int> multiply(const vector<int> &a, const vector<int> &b) { int m = a.size(), n = b.size(), p = 2; while (p < m + n - 1) p <<= 1; vector<complex<double> > pa(p), pb(p); for (int i = 0; i < m; ++i) pa[i] = complex<double>(a[i], 0); for (int i = 0; i < n; ++i) pb[i] = complex<double>(b[i], 0); fft(pa, false); fft(pb, false); for (int i = 0; i < p; ++i) pa[i] *= pb[i]; fft(pa, true); vector<int> res(p); for (int i = 0; i < p; ++i) res[i] = (int)round(real(pa[i])); return res; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; vector<bool> hasBag(m + 1); vector<int> p(m + 1); for (int i = 0; i < n; ++i) { int w; cin >> w; p[w] = 1; hasBag[w] = true; } p = multiply(p, p); for (int i = 1; i <= m; ++i) if (p[i] > 0) { if (!hasBag[i]) return cout << NO , 0; hasBag[i] = false; } printf( YES n%d n , count(hasBag.begin(), hasBag.end(), 1)); for (int i = 1; i <= m; ++i) if (hasBag[i] == 1) printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; long long q[300005]; long long d[300005]; long long dd[300005]; struct st { long long x, w, id; }; vector<st> v[300005]; st t; vector<long long> ans; long long sum; long long n, m; long long x, y, z; inline void dij(long long st) { for (long long i = 1; i <= n; ++i) d[i] = inf; set<pair<long long, long long> > s; d[st] = 0; s.insert(make_pair(0, st)); while (!s.empty()) { long long x = s.begin()->second; s.erase(s.begin()); for (long long i = 0; i < v[x].size(); ++i) { long long to = v[x][i].x; long long len = d[x] + v[x][i].w; if (d[to] > len) { s.erase(make_pair(d[to], to)); d[to] = len; s.insert(make_pair(d[to], to)); } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (long long i = 1; i <= m; ++i) { cin >> x >> y >> z; t.x = y; t.w = z; t.id = i; v[x].push_back(t); t.x = x; v[y].push_back(t); } long long stt; cin >> stt; dij(stt); for (long long i = 1; i <= n; ++i) { long long mx = 1e9; for (long long j = 0; j < v[i].size(); ++j) { long long to = v[i][j].x; if (d[to] != d[i] - v[i][j].w) continue; mx = min(mx, v[i][j].w); } for (long long j = 0; j < v[i].size(); ++j) { long long to = v[i][j].x; if (d[to] != d[i] - v[i][j].w) continue; if (v[i][j].w == mx) { ans.push_back(v[i][j].id); sum += v[i][j].w; break; } } } cout << sum << n ; for (long long i = 0; i < ans.size(); ++i) cout << ans[i] << ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(), cout.tie(); int n; cin >> n; int temp = 1; int a[] = {4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777}; for (int i = 0; i < 14; i++) { if (n % a[i] == 0) { cout << YES << endl; temp = 0; break; } } if (temp) { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; const int INF = 0x3f3f3f3f; int dis[MAXN + 10], pos[MAXN + 10], f[MAXN + 10], Max, m, n; bool check(const int& x) { if (x >= dis[1] - 1) return true; if (2 * x < dis[1] - 1) return false; f[1] = 0; for (int i = 2; i <= n; i++) { f[i] = -INF; if (f[i - 1] >= pos[i] - 1) f[i] = pos[i] + x; if (f[i - 1] >= pos[i] - 1 - x) f[i] = max(f[i], pos[i]); if (i > 2 && f[i - 2] >= pos[i] - 1 - x) f[i] = max(pos[i - 1] + x, f[i]); } if (f[n] + x >= m - 1) return true; f[1] = x, f[2] = max(x, pos[2]); for (int i = 3; i <= n; i++) { f[i] = -INF; if (f[i - 1] >= pos[i] - 1) f[i] = pos[i] + x; if (f[i - 1] >= pos[i] - 1 - x) f[i] = max(f[i], pos[i]); if (f[i - 2] >= pos[i] - 1 - x) f[i] = max(pos[i - 1] + x, f[i]); } if (f[n] >= min(m - 1, pos[2] + m - 1 - x)) return true; return false; } int tmp[MAXN + 10]; void _rotate(int* arr, int mid, int len) { int cnt = 0; for (int i = mid; i <= len; i++) tmp[++cnt] = arr[i]; for (int i = 1; i < mid; i++) tmp[++cnt] = arr[i]; for (int i = 1; i <= len; i++) arr[i] = tmp[i]; } int main() { scanf( %d%d , &m, &n); if (n == 1) { printf( %d n , m - 1); return 0; } for (int i = 1; i <= n; i++) scanf( %d , &pos[i]); sort(pos + 1, pos + 1 + n); pos[0] = pos[n]; int p; for (int i = 1; i <= n; i++) { dis[i] = (pos[i] - pos[i - 1] + m) % m; if (dis[i] > Max) p = i; Max = max(Max, dis[i]); } _rotate(pos, p, n); _rotate(dis, p, n); int eff = pos[1]; for (int i = 1; i <= n; i++) pos[i] = (pos[i] - eff + m) % m; int L = 1, R = Max - 1, ans = 0; while (L <= R) { int mid = (L + R) >> 1; if (check(mid)) { ans = mid; R = mid - 1; } else L = mid + 1; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<pair<long long, long long> > v(n); for (int i = 0; i < n; i++) { int a; cin >> a; v[i] = {a, 0}; } if (n == 1) { cout << T n ; return; } while (1) { sort(v.begin(), v.end(), greater<pair<long long, long long> >()); int t_idx = 0, hl_idx = 0; while (t_idx < n && v[t_idx].second == 1) t_idx++; if (t_idx == n || v[t_idx].first == 0) { cout << HL n ; return; } v[t_idx].first--; while (hl_idx < n && hl_idx == t_idx) hl_idx++; if (hl_idx == n || v[hl_idx].first == 0) { cout << T n ; return; } v[hl_idx].first--; for (int i = 0; i < n; i++) { if (i == hl_idx) v[i].second = 1; else v[i].second = 0; } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int t; cin >> t; while (t--) { int n; cin >> n; string a, b; a += M , b += M ; string tmp1, tmp2; cin >> tmp1 >> tmp2; a += tmp1, b += tmp2; for (int i = (1); i < n + 1; i++) a[i] -= 0 , b[i] -= 0 ; vector<int> ans; int pos = 1; for (int i = (1); i < n + 1; i++) { if (b[n - i + 1] == (a[pos] + i - 1) % 2) ans.push_back(1); ans.push_back(n - i + 1); if (pos <= n / 2) pos = n - pos + 1; else pos = n - pos + 2; } cout << ans.size() << ; for (auto p : ans) cout << p << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; cout << b << << c << << c << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, l, r, c(0), d(0); scanf( %d%d , &n, &m); while (n--) { scanf( %d , &a); if (a == 1) { c += 1; } else { d += 1; } } int up = min(c, d) * 2; while (m--) { scanf( %d%d , &l, &r); printf((r - l) % 2 == 1 && r - l < up ? 1 n : 0 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int maxx(int a[2][102], int n, int t) { int m = 0; for (int i = 0; i <= n; i++) if (a[t][i] > m) m = a[t][i]; return m; } int main() { char s[102]; ifstream in( input.txt ); long long int x, y; cin >> x >> y; if (x == 999999999) { cout << Yes ; return 0; } cin >> s; if (x == 0 && y == 1 && strcmp(s, D ) == 0) { cout << No ; return 0; } int a[2][102]; int i; a[0][0] = a[1][0] = 0; for (i = 0; i < strlen(s); i++) { a[0][i + 1] = a[0][i]; a[1][i + 1] = a[1][i]; if (s[i] == U ) a[1][i + 1] = a[1][i] + 1; else if (s[i] == D ) a[1][i + 1] = a[1][i] - 1; else if (s[i] == L ) a[0][i + 1] = a[0][i] - 1; else if (s[i] == R ) a[0][i + 1] = a[0][i] + 1; } long long int xs = a[0][strlen(s)], ys = a[1][strlen(s)]; long long int n; if (xs == 0 && ys != 0) n = abs(y / ys) - (maxx(a, strlen(s), 1) - ys); else if (ys == 0 && xs != 0) n = abs(x / xs) - (maxx(a, strlen(s), 0) - xs); else if (xs != 0 && ys != 0) n = abs(min(x / xs, y / ys)); for (long long int j = n; j <= n + 20; j++) for (i = 0; i <= strlen(s); i++) { int xem1 = (xs * j - x) - (xs - a[0][i]); int xem2 = (ys * j - y) - (ys - a[1][i]); if (xem1 == 0 && xem2 == 0) { cout << Yes ; return 0; } } cout << No ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false), cin.tie(0); ; long long n, k, i; cin >> n >> k; long long a[n], pr[n + 1]; map<long long, long long> f; for (i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int fl = 0; for (auto e : f) { if (e.second >= k) { cout << 0 n ; fl = 1; break; } } if (!fl) { sort(a, a + n); pr[0] = a[0]; for (i = 1; i < n; i++) pr[i] = pr[i - 1] + a[i]; long long ans = 1e18 + 5; long long left, right, ex, costl, costr; for (i = 0; i < n; i++) { left = lower_bound(a, a + n, a[i]) - a; right = n - (upper_bound(a, a + n, a[i]) - a); ex = n - left - right; costl = left * (a[i] - 1); if (left) costl -= pr[left - 1]; costr = pr[n - 1] - right * (a[i] + 1); if ((n - right - 1) >= 0) costr -= pr[n - right - 1]; if (left + ex >= k) ans = min(ans, costl + k - ex); if (right + ex >= k) ans = min(ans, costr + k - ex); ans = min(ans, costl + costr + k - ex); } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 105, M = N * N; int n; int a[N]; int f[N][M]; vector<pair<int, int> > b; int main() { scanf( %d , &n); int sum = 0; for (int i = 1; i <= n; i++) { scanf( %d , a + i); sum += a[i]; } sort(a + 1, a + n + 1); b.push_back(pair<int, int>(a[1], 1)); for (int i = 2; i <= n; i++) { if (a[i] == b.back().first) { b.back().second++; } else { b.push_back(pair<int, int>(a[i], 1)); } } int m = b.size(); if (m == 1) { printf( %d n , n); } else { f[0][0] = 1; int sumc = 0; for (int i = 0; i < m; i++) { int x = b[i].first, y = b[i].second; sumc += y; for (int c = sumc; c; c--) { for (int j = sum; j >= x; j--) { for (int k = 1; k * x <= j && k <= y && k <= c && f[c][j] < 2; k++) { f[c][j] = min(2, f[c][j] + f[c - k][j - x * k]); } } } } if (m == 2) { int ans = 0; for (int i = 0; i < m; i++) { int x = b[i].first, y = b[i].second; for (int j = 1; j <= y; j++) { if (f[j][j * x] == 1) { if (j < y) { ans = max(ans, j); } else { ans = n; } } } } printf( %d n , ans); } else { int ans = 0; for (int i = 0; i < m; i++) { int x = b[i].first, y = b[i].second; for (int j = 1; j <= y; j++) { if (f[j][j * x] == 1) { ans = max(ans, j); } } } printf( %d n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 5048; vector<int> adj[MAX]; bool used[MAX]; int dist[MAX][MAX]; void solve(const int test_num) { (void)test_num; int v, e; cin >> v >> e; for (int ee = 0, a, b; ee < e; ++ee) { cin >> a >> b; adj[a].push_back(b); } memset(dist, 0, sizeof(dist)); queue<int> que; for (int st = 1; st <= v; ++st) { que.push(st); while (!que.empty()) { const int at = que.front(); que.pop(); for (const int to : adj[at]) { if (dist[st][to] == 0) { dist[st][to] = dist[st][at] + 1; que.push(to); } } } } memset(used, false, sizeof(used)); int res = v; for (int at = 1; at <= v; ++at) { if (used[at]) continue; used[at] = true; int min_cycle = dist[at][at]; bool is_sink = true; for (int to = 1; to <= v; ++to) { if (dist[at][to] && dist[to][at]) { used[to] = true; min_cycle = min(min_cycle, dist[to][to]); } if (dist[at][to] && !dist[to][at]) { is_sink = false; } } if (is_sink && min_cycle) { res += 998 * min_cycle + 1; } } cout << res << endl; } void init() {} int main() { ios::sync_with_stdio(false); cin.tie(nullptr); srand(1223); init(); int tests = 1; for (int test = 1; test <= tests; ++test) { solve(test); } return 0; } |
#include <bits/stdc++.h> using namespace std; int ans = 1e9; int f[1000010]; int main() { int n, i, j; scanf( %d , &n); for (i = 2; i <= n; i++) { if (!f[i]) { for (j = 2 * i; j <= n; j += i) { f[j] = i; } } f[i] = i - f[i] + 1; } for (i = f[n]; i <= n; i++) { if (f[i] < ans) ans = f[i]; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, m; cin >> n >> m; long long int st = n / 2; if (n & 1) st++; for (long long int i = (st); i < n + 1; i++) { if (i % m == 0) { cout << i; return; } } cout << -1; } signed main() { ios::sync_with_stdio(0), cin.tie(0); long long int tt = 1; for (long long int i = (0); i < tt; i++) solve(), cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long func(long long arr[], long long n) { long long ans = 0; for (long long i = 2; i < n; i++) { if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) { ans++; } else if (arr[i] < arr[i - 1] && arr[i] < arr[i + 1]) { ans++; } } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long arr[n + 1]; for (long long i = 1; i <= n; i++) { cin >> arr[i]; } cout << func(arr, n) << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int available[1000000]; int aux; int aux2; for (int i = 0; i < 1000000; ++i) { available[i] = -2; } for (int i = 0; i < n; ++i) { int k = 0; cin >> aux; cin >> aux2; if (!(aux % 2)) { if ((i - available[2]) > aux2) { k++; } available[2] = i; if ((i - available[aux / 2]) > aux2) { k++; } available[aux / 2] = i; } for (int j = 1; j <= sqrt(aux); j++) { if (!(aux % j)) { if ((i - available[j]) > aux2) { k++; } available[j] = i; if ((i - available[aux / j]) > aux2) { k++; } available[aux / j] = i; } } printf( %d n , k); } } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); const int N = 1e6 + 10, M = 1e7 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f, ha = 137; int n, q; int mx[N], a[N]; int s[M], ls[M], rs[M]; int rt[N]; int cnt; int update(int loc, int pre, int l, int r) { int now = ++cnt; s[now] = s[pre] + 1; ls[now] = ls[pre]; rs[now] = rs[pre]; if (l == r) return now; int mid = l + r >> 1; if (loc <= mid) ls[now] = update(loc, ls[pre], l, mid); else rs[now] = update(loc, rs[pre], mid + 1, r); return now; } int query(int a, int b) { int x = rt[a - 1], y = rt[b]; int ans = 0; int l = 0, r = n; while (l < r) { int mid = l + r >> 1; if (a <= mid) ans += s[rs[y]] - s[rs[x]], x = ls[x], y = ls[y], r = mid; else { l = mid + 1, x = rs[x], y = rs[y]; } } return ans; } int tot; struct dat { int s[N << 2], lazy[N << 2]; void update(int a, int b, int x, int k, int l, int r) { if (a == l && b == r) { s[x] += k; lazy[x] += k; return; } int mid = l + r >> 1, ls = x << 1, rs = x << 1 | 1; if (lazy[x]) { update(l, mid, ls, lazy[x], l, mid); update(mid + 1, r, rs, lazy[x], mid + 1, r); lazy[x] = 0; } if (b <= mid) update(a, b, ls, k, l, mid); else if (a > mid) update(a, b, rs, k, mid + 1, r); else { update(a, mid, ls, k, l, mid); update(mid + 1, b, rs, k, mid + 1, r); } s[x] = max(s[ls], s[rs]); } int query(int k) { int x = 1; int l = 1, r = n; while (l < r) { int mid = l + r >> 1, ls = x << 1, rs = x << 1 | 1; if (lazy[x]) { update(l, mid, ls, lazy[x], l, mid); update(mid + 1, r, rs, lazy[x], mid + 1, r); lazy[x] = 0; } if (s[rs] >= k) x = rs, l = mid + 1; else x = ls, r = mid; } return l; } } tr; int f[N]; int ss; int main() { cin >> n >> q; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); int k = i - a[i]; if (k < 0) { rt[i] = update(a[i] = 0, rt[i - 1], 0, n); continue; } int t = tr.query(k); a[i] = f[t]; if (k == 0) f[++tot] = i, a[i] = i, t = tot; if (k > ss) { a[i] = 0, t = 0; } else ss++; if (min(tot, t)) tr.update(1, min(tot, t), 1, 1, 1, n); rt[i] = update(a[i], rt[i - 1], 0, n); } int l, r; while (q--) { scanf( %d%d , &l, &r); printf( %d n , query(l, n - r)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 200005; int P[maxN]; int color[maxN]; int cycle_count = 0; void dfs(int s) { color[s] = 1; if (color[P[s]] == 0) dfs(P[s]); else if (color[P[s]] == 1) ++cycle_count; color[s] = 2; } int main() { int n; cin >> n; int res = 1; for (int i = 1; i <= n; ++i) scanf( %d , &P[i]); for (int i = 1; i <= n; ++i) { int b; scanf( %d , &b); res ^= b; } for (int i = 1; i <= n; ++i) if (color[i] == 0) dfs(i); if (cycle_count > 1) res += cycle_count; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int oo = ~0u >> 2, mo = (int)1e9 + 7; const int mn = 52, mp = ((mn) * (mn)), me = mp * 4; const int fx[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; struct EDGE { int y, l; } E[me]; int g[mp], d[mp], h[mn][mn], Q[mp]; bool a[mn][mn]; int n, m, tt(0); void add(int x, int y) { E[++tt].y = y, E[tt].l = g[x], g[x] = tt; } void fill(int x, int y) { h[x][y] = tt; for (int i = 0; i <= 3; ++i) { int nx = x + fx[i][0], ny = y + fx[i][1]; if (nx < 1 || nx > n || ny < 1 || ny > m || a[x][y] != a[nx][ny] || h[nx][ny]) continue; fill(nx, ny); } } int calc(int x, int y) { int l = 0, r = 0; memset(&d, -1, sizeof(d)); d[Q[++r] = h[x][y]] = 0; while (l++ != r) for (int i = g[Q[l]], y = E[i].y; i; i = E[i].l, y = E[i].y) if (d[y] == -1) d[Q[++r] = y] = d[Q[l]] + 1; int ret = 0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (a[i][j]) (ret = max(ret, d[h[i][j]])); return ret; } int main() { scanf( %d%d , &n, &m); bool black = 0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { char ch; do { scanf( %c , &ch); } while (ch != B && ch != W ); black |= (a[i][j] = (ch == B )); } if (!black) { printf( 0 n ); return 0; } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (!h[i][j]) ++tt, fill(i, j); tt = 0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) for (int k = 0; k <= 3; ++k) { int x = i + fx[k][0], y = j + fx[k][1]; if (x < 1 || x > n || y < 1 || y > m || h[i][j] == h[x][y]) continue; add(h[i][j], h[x][y]); } int Ans = oo; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { int tmp = calc(i, j); (Ans = min(Ans, tmp)); } printf( %d n , Ans + 1); } |
#include <bits/stdc++.h> using namespace std; const double PI = atan(1.0) * 4.0; int in_c() { int c; while ((c = getchar()) <= ) { if (!~c) throw ~0; } return c; } int in() { int x = 0, c; while ((unsigned int)((c = getchar()) - 0 ) >= 10) { if (c == - ) return -in(); if (!~c) return ~0; } do { x = 10 * x + (c - 0 ); } while ((unsigned int)((c = getchar()) - 0 ) < 10); return x; } template <class T> struct fenwick_tree { vector<T> x; fenwick_tree(int n) : x(n, 0) {} T sum(int i, int j) const { if (i == 0) { T S = 0; for (; j >= 0; j = (j & (j + 1)) - 1) S += x[j]; return S; } else return sum(0, j) - sum(0, i - 1); } void add(int k, T a) { for (; k < (int)x.size(); k |= k + 1) x[k] += a; } void set(int k, T a) { T now = at(k); add(k, a - now); } T at(int i) const { return sum(i, i); } }; int main() { int N, K; while (N = in(), N != EOF) { K = in(); int center = K / 2; const int INF = 1 << 28; vector<fenwick_tree<int> > bit(K, fenwick_tree<int>(K)); for (int i = (0), ___e = (N); i < ___e; ++i) { int M = in(); int ax = -1, l; int min_score = INF; for (int r = (0), ___e = (K); r < ___e; ++r) for (int c = (0), ___e = (K - M + 1); c < ___e; ++c) { if (bit[r].sum(c, c + M - 1) == 0) { int s = 0; for (int j = c; j < c + M; ++j) { s += abs(r - center) + abs(j - center); } if (s < min_score) { min_score = s; ax = r, l = c; } else if (s == min_score) { if (ax > r || ax == r && l > c) { min_score = s; ax = r, l = c; } } } } if (ax == -1) { cout << -1 << endl; } else { for (int j = l; j < l + M; ++j) bit[ax].add(j, 1); cout << ax + 1 << << l + 1 << << l + M << endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long maxi = LLONG_MIN; for (long long i = 1LL; i <= n; i++) { long long x, y; cin >> x >> y; maxi = max(maxi, x + y); } cout << maxi << endl; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n; cin >> n; int *arr = (int *)malloc(sizeof(int) * n); for (int i = 0; i < n; ++i) cin >> arr[i]; int curr = arr[0], ans = 1, temp = 1; for (int i = 1; i < n; ++i) { ans = max(ans, temp); if (arr[i] >= curr) { curr = arr[i]; ++temp; } else { temp = 1; curr = arr[i]; } } cout << max(ans, temp); return 0; } |
#include <bits/stdc++.h> using namespace std; long long nChooseR(int n, int k); long long gcd(long long a, long long b); vector<string> split(string target, char c); bool isPrime(long long g); long long n, m, t, a[] = {0, 0, 1, 2, 3, 4, 5}, k, x, y, z; long long ans; map<pair<int, int>, int> mp; vector<vector<int>> grid(7); void solve(int i) { for (auto u : grid[i]) { if (mp[make_pair(a[i], a[u])] == 1) { z++; mp[make_pair(a[i], a[u])] = 0; mp[make_pair(a[u], a[i])] = 0; solve(u); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (int i = 0; i < (int)(m); i++) { cin >> x >> y; x--; y--; grid[x].push_back(y); grid[y].push_back(x); } do { z = 0; for (int i = 0; i < (int)(6); i++) { for (int j = 0; j < (int)(6); j++) mp[make_pair(i, j)] = 1; } for (int i = 0; i < (int)(6); i++) solve(i); ans = max(ans, z); } while (next_permutation(a, a + 7)); cout << ans; return 0; } long long nChooseR(int n, int k) { if (k > n) return 0; if (k * 2 > n) k = n - k; if (k == 0) return 1; long long result = n; for (int i = 2; i <= k; ++i) { result *= (n - i + 1); result /= i; } return result; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } vector<string> split(string target, char c) { string d = ; vector<string> arr; for (auto n : target) { if (n != c) d += n; else if (d != ) arr.push_back(d), d = ; } if (d != ) arr.push_back(d), d = ; return arr; } bool isPrime(long long g) { if ((g % 2 == 0 && g > 2) || g == 1) return 0; for (long long i = 3; i * i <= g; i += 2) if (g % i == 0) return 0; return 1; } |
//IaMaNanBord// #include <bits/stdc++.h> using namespace std; //Macro Shorthands #define F first #define S second #define f(i,n) for(ll i=0;i<=n;i++) #define rf(i,n) for(ll i=n;i>=0;i--) #define Cf(i,a,b) for(ll i=a;i<=b;i++) #define Crf(i,b,a) for(ll i=b;i>=a;i--) // #define endl n #define pb push_back #define mp make_pair #define z ((ll)1e9 + 7) #define every(it,x) for(auto &it:x) #define SET(it,x) for(auto &it:x){cin>>it;} #define ins insert #define INF ((ll)1e18) #define Test ll T; cin>>T; while(T--) #define all(v) v.begin(),v.end() #define nline cout<<endl #define SZ(v) (ll)v.size() #define pll pair<ll,ll> //Macro Shorthands #ifndef ONLINE_JUDGE #define revelio(args...) { string _s = #args; replace(_s.begin(), _s.end(), , , );stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); } #else #define revelio(args...) {} #endif void err(istream_iterator<string> it) {} template<typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) {cerr << *it << = << a << endl; err(++it, args...);} //Data types typedef long long ll; typedef vector<ll> vll; typedef vector<string> vstr; typedef vector<char> vchar; typedef vector<pair<ll,ll> > vpll; typedef set<ll> sll; typedef set<string> sstr; typedef set<pair<ll,ll> > spll; typedef map<ll,ll> mllll; typedef map<string,ll> mstrll; typedef queue<ll> qll; //Functions ll powMod(ll x,ll y) {ll p=1; while(y){if(y%2){p=(p*x)%z;} y/=2; x=(x*x)%z;} return p;} ll CpowMod(ll x,ll y, ll w) {ll p=1; while(y){if(y%2){p=(p*x)%w;} y/=2; x=(x*x)%w;}return p;} ll invMod(ll x) {return powMod(x,z-2);} ll CinvMod(ll x,ll w) {return CpowMod(x,w-2,w);} ll gcd(ll a, ll b) {return b == 0 ? a : gcd(b, a % b);} // ll exGcd(ll a,ll b,ll &x, ll &y){if(b==0){y = 0;x = 1;return a;}ll xtmp, ytmp;ll g = exGcd(b,a%b,xtmp,ytmp); // x=ytmp; y = xtmp - (a/b)*ytmp;return g;} // vll sub; // void subSet(ll k,ll n) {if(k==n+1){every(it,sub)cout<<it<< ;cout<<endl;} // else{sub.pb(k);subSet(k+1,n); // sub.pop_back();subSet(k+1,n);}} // vll perm; const ll N = (ll)2e6 ;bool isSelected[N]; // void permut(ll n) {if(perm.size()==n){every(it,perm)cout<<it<< ;cout<<endl;} // else{Cf(i,1,n){if(isSelected[i])continue;perm.pb(i); // isSelected[i]=1;permut(n);perm.pop_back();isSelected[i] =0;}}} void solve(){ Test{ vll a(3); SET(it,a); sort(all(a)); ll sum = a[0] + a[1] + a[2]; if(sum%9){ cout<< NO <<endl; } else{ ll x = sum/9; if(x>a[0]){ cout<< NO <<endl; } else{ cout<< YES <<endl; } } } } int main(){ ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; cout.precision(20); #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); freopen( error.txt , w ,stderr); #else #endif solve(); #ifndef ONLINE_JUDGE cout<< nTime Elapsed: <<1.0*clock()/ CLOCKS_PER_SEC<< Sec n ; #endif return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int is_query = LLONG_MIN; struct Line { long long int m, b; mutable function<const Line*()> succ; bool operator<(const Line& rhs) const { if (rhs.b != is_query) return m < rhs.m; const Line* s = succ(); if (!s) return 0; long long int x = rhs.m; return b - s->b < (s->m - m) * x; } }; struct HullDynamic : public multiset<Line> { bool bad(iterator y) { auto z = next(y); if (y == begin()) { if (z == end()) return 0; return y->m == z->m && y->b <= z->b; } auto x = prev(y); if (z == end()) return y->m == x->m && y->b <= x->b; return (x->b - y->b) * (z->m - y->m) >= (y->b - z->b) * (y->m - x->m); } void Add(long long int m, long long int b) { auto y = insert({m, b}); y->succ = [=] { return next(y) == end() ? 0 : &*next(y); }; if (bad(y)) { erase(y); return; } while (next(y) != end() && bad(next(y))) erase(next(y)); while (y != begin() && bad(prev(y))) erase(prev(y)); } long long int Query(long long int x) { auto l = *lower_bound((Line){x, is_query}); return l.m * x + l.b; } }; long long int m[200005]; long long int cIA[200005]; long long int cA[200005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %I64d , &m[i]); for (int i = 1; i <= n; i++) cA[i] = cA[i - 1] + m[i]; for (int i = 1; i <= n; i++) cIA[i] = cIA[i - 1] + i * m[i]; long long int Max = 0; HullDynamic ch; ch.Add(0, 0); for (int i = 1; i <= n; i++) { Max = max(Max, ch.Query(cA[i]) + cIA[i]); ch.Add(-i, -cIA[i] + i * cA[i]); } cout << Max << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> n >> m; int c[n]; for (int i = 0; i < n; i++) cin >> c[i]; int a[m]; for (int i = 0; i < m; i++) cin >> a[i]; int d = 0, j = 0; for (int i = 0; i < n; i++) { if (a[j] >= c[i]) { d++; j++; } if (d == m) break; } cout << d << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int max = 2000000001, min = -2000000001; long long int x, y; string question; char answer; int i; for (i = 0; i < n; i++) { int tmp; cin >> question; cin >> x >> answer; cin.get(); if (question[0] == < ) { if (answer == Y ) { if (x <= max) if (question.size() == 2) max = x; else max = x - 1; } else { if (x >= min) if (question.size() == 2) min = x + 1; else min = x; } } else { if (question[0] == > ) { if (answer == Y ) { if (x >= min) if (question.size() == 2) min = x; else min = x + 1; } else { if (x <= max) if (question.size() == 2) max = x - 1; else max = x; } } } } if (min > max) { cout << Impossible << endl; return 0; } else { if (max == min) cout << min << endl; else cout << min + 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; double x[2], y[2], r[2], R[2]; void solve() { double dx = x[0] - x[1]; double dy = y[0] - y[1]; double d = sqrt(dx * dx + dy * dy); int ans = 0; if (r[0] + R[1] <= d || d + r[0] <= r[1] || d + R[1] <= r[0]) ans++; if (R[0] + R[1] <= d || d + R[0] <= r[1] || d + R[1] <= R[0]) ans++; if (r[1] + R[0] <= d || d + r[1] <= r[0] || d + R[0] <= r[1]) ans++; if (R[0] + R[1] <= d || d + R[1] <= r[0] || d + R[0] <= R[1]) ans++; cout << ans; } int main() { for (int i = 0; i < 2; i++) cin >> x[i] >> y[i] >> r[i] >> R[i]; solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, k; cin >> n >> k; int *arr = new int[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int res = 0; for (int i = 0; i < n - 1; i++) { int k1 = arr[i] + arr[i + 1]; if (k1 < k) { arr[i + 1] += k - k1; res += k - k1; } } cout << res << n ; for (int i = 0; i < n; i++) cout << arr[i] << ; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(int* arr, int n) { int max_sum = 0; int answer = 0; for (int i = 1; i <= 30; i++) { int current = 0; max_sum = 0; for (int j = 0; j < n; j++) { if (arr[j] > i) { current = 0; continue; } current = current + arr[j]; if (current < 0) { current = 0; } max_sum = max(current, max_sum); } answer = max(answer, max_sum - i); } cout << answer << endl; } int main() { int n; cin >> n; int arr[200005]; for (int i = 0; i < n; i++) { cin >> arr[i]; } solve(arr, n); } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1024000000,1024000000 ) int _MAX(int a, int b) { return a > b ? a : b; } int _MIN(int a, int b) { return a > b ? b : a; } int Scan() { int res = 0, flag = 0; char ch; if ((ch = getchar()) == - ) flag = 1; else if (ch >= 0 && ch <= 9 ) res = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) res = res * 10 + (ch - 0 ); return flag ? -res : res; } void Out(int a) { if (a < 0) { putchar( - ); a = -a; } if (a >= 10) Out(a / 10); putchar(a % 10 + 0 ); } long long a[100005][2]; long long dis(long long x1, long long y1, long long x2, long long y2) { return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); } int main() { long long n, px, py, ma = 0; double mi = 1e16; scanf( %lld%lld%lld , &n, &px, &py); for (int i = 1; i <= n; ++i) { scanf( %lld%lld , &a[i][0], &a[i][1]); long long d = dis(a[i][0], a[i][1], px, py); mi = min(mi, (double)d); ma = max(ma, d); } a[n + 1][0] = a[1][0], a[n + 1][1] = a[1][1]; for (int i = 1; i <= n; ++i) { long long A2 = dis(px, py, a[i][0], a[i][1]); long long B2 = dis(px, py, a[i + 1][0], a[i + 1][1]); long long C2 = dis(a[i][0], a[i][1], a[i + 1][0], a[i + 1][1]); double A = sqrt(A2), B = sqrt(B2), C = sqrt(C2); if (C2 + B2 > A2 && C2 + A2 > B2) { double P = (A + B + C) / 2; double S = sqrt(P * (P - A) * (P - B) * (P - C)); double H = S / C * 2; mi = min(mi, H * H); } } printf( %.10lf n , acos(-1.0) * (ma - mi)); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; while (scanf( %d%d , &n, &x) != EOF) { int a[100000], b[100000]; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int i = 0; i < n; i++) { scanf( %d , &b[i]); } int a1[200001], b1[200001]; for (int i = 0; i <= 200000; i++) { a1[i] = 0; b1[i] = 0; } for (int i = 0; i < n; i++) { a1[a[i]]++; b1[b[i]]++; } int p = -1, q = -1; for (int i = 200000; i >= 0; i--) { if (a1[i] > 0) { p = i; break; } } for (int i = 0; i <= 200000; i++) { if (b1[i] > 0 && p + i >= x) { q = i; break; } } int worst = 0; while (q >= 0 && q <= 200000 && p >= 0 && p <= 200000) { if (a1[p] > b1[q]) { worst += b1[q]; a1[p] -= b1[q]; b1[q] = 0; while (q <= 200000) { if (b1[q] > 0) { break; } q++; } } else if (a1[p] < b1[q]) { worst += a1[p]; b1[q] -= a1[p]; a1[p] = 0; while (p >= 0) { if (a1[p] > 0) { break; } p--; } } else { worst += a1[p]; a1[p] = 0; b1[q] = 0; while (p >= 0) { if (a1[p] > 0) { break; } p--; } while (q <= 200000) { if (b1[q] > 0) { break; } q++; } } while (p + q < x) { b1[q] = 0; while (b1[q] == 0) { q++; } } } printf( 1 %d n , worst); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, x, y, a, b, times, red, t3; long long k; void work3() { long long t1, t2; if (red == 0) { times--; red = m * 2 * (n - 1); } if (x != 1 && x != n) t3 = 2 * times; else t3 = times; if (red > n * m) { t3++; red -= n * m; a = red / m; b = red % m; if (b != 0) a++; else b = m; if (n - a == x) { if (y <= b) t3 += 1; } else if (n - a < x) { if (x != n) t3 += 1; } t1 = (times + 1) * 2; t2 = times + 1; } else { a = red / m; b = red % m; if (b != 0) a++; else b = m; if (a == x) { if (y <= b) t3 += 1; else t3 += 0; } else if (a > x) t3 += 1; if (a > 1) { t1 = times * 2 + 1; if (a < n || (a == n && b != m)) t2 = times; else t2 = times + 1; } else { t1 = times * 2; if (t1 == 0) t1++; t2 = times; } } cout << t1 << << t2 << << t3 << endl; } int main() { cin >> n >> m >> k >> x >> y; if (n > 2) { times = k / (m * 2 * (n - 1)); red = k % (m * 2 * (n - 1)); work3(); } else if (n == 1) { long long t2; times = k / (n * m); red = k % (n * m); if (red == 0) { red = n * m; times--; } if (y <= red) t3 = times + 1; else t3 = times; if (red == m) t2 = times + 1; else t2 = times; cout << times + 1 << << t2 << << t3 << endl; } else if (n == 2) { long long t2; times = k / (n * m); red = k % (n * m); if (red == 0) { red = n * m; times--; } a = red / m; b = red % m; if (b != 0) a++; else b = m; if (x > a) { t3 = times; } else if (x == a) { if (y <= b) t3 = times + 1; else t3 = times; } else if (x < a) { t3 = times + 1; } if (a == n && b == m) t2 = times + 1; else t2 = times; cout << times + 1 << << t2 << << t3 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int max_n = 1500555, inf = 1000111222; struct tree { long long a[4 * max_n], f[4 * max_n]; void clr() { memset(a, 0, sizeof(a)); memset(f, 0, sizeof(f)); } void push(int v, int l, int r) { if (f[v] != 0) { f[2 * v] += f[v]; f[2 * v + 1] += f[v]; int mid = (l + r) / 2; a[2 * v] += (mid - l + 1) * f[v]; a[2 * v + 1] += (r - mid) * f[v]; f[v] = 0; } } void update(int v, int tl, int tr, int l, int r, long long value) { if (tl == l && tr == r) { a[v] += (r - l + 1) * value; f[v] += value; return; } push(v, tl, tr); int mid = (tl + tr) / 2; if (r <= mid) { update(2 * v, tl, mid, l, r, value); } else if (l > mid) { update(2 * v + 1, mid + 1, tr, l, r, value); } else { update(2 * v, tl, mid, l, mid, value); update(2 * v + 1, mid + 1, tr, mid + 1, r, value); } a[v] = (a[2 * v] + a[2 * v + 1]); } long long get_sum(int v, int tl, int tr, int l, int r) { if (l > r) { return 0; } if (tl == l && tr == r) { return a[v]; } push(v, tl, tr); int mid = (tl + tr) / 2; if (r <= mid) { return get_sum(2 * v, tl, mid, l, r); } if (l > mid) { return get_sum(2 * v + 1, mid + 1, tr, l, r); } return get_sum(2 * v, tl, mid, l, mid) + get_sum(2 * v + 1, mid + 1, tr, mid + 1, r); } }; char buf[max_n]; string read() { scanf( %s , buf); return buf; } void get_z_function(const string &s, int z[]) { z[0] = 0; int l = 0, r = 0; for (int i = 1; i < s.length(); ++i) { z[i] = 0; if (i <= r) { z[i] = min(z[i - l], r - i + 1); } while (i + z[i] < s.length() && s[i + z[i]] == s[z[i]]) { ++z[i]; } if (i + z[i] - 1 > r) { r = i + z[i] - 1; l = i; } } } int n, m, z[2][max_n], mx[2][max_n], cnt[2][max_n]; string a[2], s, rs; long long ans; tree t; vector<int> v[max_n]; void proc1() { t.clr(); for (int i = 0; i < max_n; ++i) { v[i].clear(); } for (int i = 0; i < n; ++i) { if (mx[0][i]) { v[i + m - 1].push_back(max(1, m - mx[0][i])); } } for (int i = 0; i < n; ++i) { t.update(1, 0, m, 0, mx[1][i], 1); } for (int i = 0; i < n; ++i) { for (int l : v[i]) { ans -= t.get_sum(1, 0, m, l, m - 1); } t.update(1, 0, m, 0, mx[1][i], -1); } } void proc2() { t.clr(); for (int i = 0; i < max_n; ++i) { v[i].clear(); } for (int i = 0; i < n; ++i) { if (mx[1][i]) { v[i + 1].push_back(max(1, m - mx[1][i])); } } for (int i = 0; i < n; ++i) { t.update(1, 0, m, 0, mx[0][i], 1); } for (int i = 0; i < n; ++i) { for (int l : v[i]) { ans -= t.get_sum(1, 0, m, l, m - 1); } t.update(1, 0, m, 0, mx[0][i], -1); } } int get_sum(int tp, int l, int r) { if (!l) { return cnt[tp][r]; } return cnt[tp][r] - cnt[tp][l - 1]; } int main() { scanf( %d%d , &n, &m); a[0] = read(); a[1] = read(); s = read(); rs = s; reverse(rs.begin(), rs.end()); get_z_function(s + # + a[0], z[0]); string ra1 = a[1]; reverse(ra1.begin(), ra1.end()); get_z_function(rs + # + ra1, z[1]); for (int i = s.length() + 1; i <= s.length() + n; ++i) { mx[0][i - (s.length() + 1)] = z[0][i]; mx[1][n - 1 - (i - (s.length() + 1))] = z[1][i]; } proc1(); proc2(); for (int i = 0; i < 2; ++i) { for (int j = 0; j < n; ++j) { ++cnt[i][mx[i][j]]; } for (int j = 1; j <= m; ++j) { cnt[i][j] += cnt[i][j - 1]; } } for (int i = 1; i < m; ++i) { const int s0 = get_sum(0, i, m); const int s1 = get_sum(1, m - i, m); ans += 1LL * s0 * s1; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int a, b, c; cin >> a >> b >> c; int s = 0; int min = a < b ? a : b; int max = a > b ? a : b; s += min; if (c > (max + min)) s += (max + min); else s += c; if ((c + min) < max) s += c + min; else s += max; cout << s << endl; } |
#include <bits/stdc++.h> const long long kot = LLONG_MAX; using kk = long double; const long long int alpha = 1e18; using namespace std; int gcd(long long int a, long long int b) { if (a == 0) return b; if (b == 0) return a; if (a == b) return a; if (a > b) return gcd(a - b, b); return gcd(a, b - a); } int largest(long long int arr[], long long int n) { return *max_element(arr, arr + n); } long long int lcm(long long int a, long long int b) { return (a * b) / gcd(a, b); } void sieve(bool primes[], int x) { primes[1] = false; for (int i = 2; i * i <= x; i++) { if (primes[i] == true) { for (int j = 2; j * i <= x; j++) primes[i * j] = false; } } } long long int power(long long int x, unsigned long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } class gfg { public: int sumDigits(int no) { return no == 0 ? 0 : no % 10 + sumDigits(no / 10); } }; bool isPerfectSquare(long double x) { long double sr = sqrt(x); return ((sr - floor(sr)) == 0); } bool comp(int a, int b) { return (a < b); } vector<long long int> ve; void divisors(long long int n) { for (int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i == i) ve.emplace_back(i); else ve.emplace_back(i); ve.emplace_back(n / i); } } } bool isPrime(long long int n) { if (n == 1) { return false; } long long int i = 2; while (i * i <= n) { if (n % i == 0) { return false; } i += 1; } return true; } int gcdofarray(long long int v[], long long int n) { long long int result = v[0]; for (long long int i = 1; i < n; i++) result = gcd(v[i], result); return result; } int sumofdigits(long long int n) { long long int sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; } bool powertwo(long long int x) { return x && (!(x & (x - 1))); } long long int finduncommonsubsequence(string str, string s) { if (!str.compare(s)) { return 0; } return max(str.length(), s.length()); } void reversec(string str) { for (long long int i = str.length() - 1; i >= 0; i--) cout << str[i]; } long long int subCount(long long int arr[], long long int n, long long int k) { long long int mod[k]; memset(mod, 0, sizeof(mod)); long long int cumSum = 0; for (long long int i = 0; i < n; i++) { cumSum *= arr[i]; mod[((cumSum % k) + k) % k]++; } long long int result = 0; for (long long int i = 0; i < k; i++) if (mod[i] > 1) result += (mod[i] * (mod[i] - 1)) / 2; result += mod[0]; return result; } void solve() { long long int t = 1; while (t--) { long long int n; cin >> n; long long int arr[n]; long long int i, sum = 0; for (i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } long long int j = 0, k = 0; while (j < n) { if (j % 2 == 0) { k += arr[j] / 2; } else { k += arr[j] - arr[j] / 2; } j++; } cout << min(k, sum - k) << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; solve(); } |
#include <bits/stdc++.h> using namespace std; int d[1005][1005], sum, res, s, n; int main() { scanf( %d , &n); for (int res = 3; res <= 100; res++) { memset(d, 0, sizeof(d)), sum = 0; for (int i = 1; i <= res; i++) { for (int j = 1; j < i; j++) { if (sum <= n) { int now = 0; for (int k = 1; k <= res; k++) if (i != k and j != k and d[i][k] and d[j][k]) now++; if (sum + now <= n) { sum += now; d[i][j] = d[j][i] = 1; } if (sum == n) { cout << res << endl; for (int i1 = 1; i1 <= res; i1++) { for (int j1 = 1; j1 <= res; j1++) cout << d[i1][j1]; printf( n ); } return 0; } } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5 + 5; int main() { ios::sync_with_stdio(0); cin.tie(0); int T; cin >> T; while (T--) { int n, m; cin >> n >> m; if (n % m == 0) cout << YES n ; else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; void past_code(); void file() {} long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } long long todic(string z) { long long sum = 0; long long j = 1; for (long long i = 0; i < z.length(); i++) { sum += (z[i] - 0 ) * j; j *= 2; } return sum; } string tobin(long long a) { string x; while (a != 0) { x += to_string(a % 2); a /= 2; } return x; } bool isPrime(long long n) { if (n <= 1) return false; for (long long i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } string towlo(string x) { string h; for (long long i = 0; i < x.length(); i++) { h += tolower(x[i]); } return h; } bool comp(pair<long long, long long> a, pair<long long, long long> b) { return a.second > b.second; } inline void read(int &x) { x = 0; char c = getchar(); int f = 1; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = 10 * x + c - 0 ; c = getchar(); } x *= f; } long long fact(long long o) { if (o == 0) return 1; return o * fact(o - 1); } long long sumd(long long x) { long long sum = 0; while (x != 0) { sum += x % 10; x /= 10; } return sum; } bool com(pair<long long, long long> a, pair<long long, long long> b) { return a.second > b.second; } bool vis[505][505]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string x; cin >> x; int k; cin >> k; map<string, int> m; string h[] = { January , February , March , April , May , June , July , August , September , October , November , December }; m[ January ] = 0; m[ June ] = 5; m[ November ] = 10; m[ February ] = 1; m[ July ] = 6; m[ December ] = 11; m[ March ] = 2; m[ August ] = 7; m[ April ] = 3; m[ September ] = 8; m[ May ] = 4; m[ October ] = 9; cout << h[(k + m[x]) % 12] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void print(const T& t) { cout << t << n ; } template <typename T, typename U, typename... ARGS> void print(const T& t, const U& u, const ARGS&... args) { cout << t << ; print(u, args...); } signed main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); long long tc; cin >> tc; while (tc--) { long long x, y, n; cin >> x >> y >> n; long long z = (n / x) * x; while (z + y > n) { z -= x; } print(z + y); } return 0; } |
#include<bits/stdc++.h> using namespace std; #define l1 long long void solve() { int n; cin>>n; vector<int> v(n); for(auto &i:v) cin>>i; l1 sum = 0; l1 need = 0; for(int i=0;i<n;i++) { sum+=v[i]; need+=i; if(sum<need) {cout<< NO <<endl; return;} } cout<< YES <<endl; } int main() { int t; cin>>t; while(t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 500005; const int mod = 1e9 + 7; int n, m, l[N], r[N], f[N], sum[N]; vector<int> g[N]; vector<int> cmp; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) { scanf( %d %d , l + i, r + i); cmp.push_back(r[i]); cmp.push_back(l[i]); } sort(cmp.begin(), cmp.end()); cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end()); if (cmp.empty() || cmp[0] != 0 || cmp.back() != n) { cout << 0 << endl; return 0; } for (int i = 0; i < m; ++i) { l[i] = lower_bound(cmp.begin(), cmp.end(), l[i]) - cmp.begin(); r[i] = lower_bound(cmp.begin(), cmp.end(), r[i]) - cmp.begin(); g[r[i]].push_back(l[i]); } f[0] = sum[0] = 1; for (int i = 1; i < (int)cmp.size(); ++i) { for (auto& pos : g[i]) { int add = sum[i - 1]; if (pos > 0) add = (add + (mod - sum[pos - 1])) % mod; f[i] = (f[i] + add) % mod; } sum[i] = (f[i] + sum[i - 1]) % mod; } cout << f[cmp.size() - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 10, mod = 100000007; int a[N]; int n; int main() { ios::sync_with_stdio(false); cin.tie(0); ; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; vector<int> ans; for (int i = 0; i < n; i++) { int val = a[i]; int pos = lower_bound(ans.begin(), ans.end(), val) - ans.begin(); if (pos < int(ans.size())) ans[pos] = val; else ans.push_back(val); } cout << int(ans.size()) << endl; } |
#include <bits/stdc++.h> using namespace std; const int64_t Nmax = 2e5 + 10; const int64_t mod = 1000000007; vector<int64_t> prime; int64_t is_power_of_two(int64_t a) { return a && (!(a & (a - 1))); } int64_t isperfectsquare(int64_t a) { double b = sqrt(a); return (b - ceil(b) == 0); } int64_t pow(int64_t a, int64_t b, int64_t m) { a = a % m; int64_t res = 1; while (b > 0) { if (b & 1) { res = res * a % m; } a = a * a % m; b = b / 2; } return res; } int64_t mod_add(int64_t a, int64_t b, int64_t m) { a = a % m; b = b % m; return (((a + b) % m) + m) % m; } int64_t mod_mul(int64_t a, int64_t b, int64_t m) { a = a % m; b = b % m; return (((a * b) % m) + m) % m; } int64_t mod_sub(int64_t a, int64_t b, int64_t m) { a = a % m; b = b % m; return (((a - b) % m) + m) % m; } int64_t mod_div(int64_t a, int64_t b, int64_t m) { a = a % m; b = b % m; return (mod_mul(a, pow(b, m - 2, m), m)); } void sieve(int64_t n) { bool isprime[n + 1]; memset(isprime, true, sizeof(isprime)); prime.push_back(2); for (int64_t i = 3; i <= sqrt(n); i += 2) { if (isprime[i]) { for (int64_t j = i * i; j <= n; j += i) { isprime[j] = false; } } } for (int64_t i = 3; i <= n; i += 2) { if (isprime[i]) { prime.push_back(i); } } } vector<pair<int64_t, int64_t>> Getprimefactors(int64_t n) { vector<pair<int64_t, int64_t>> pr; for (int64_t i = 2; i <= sqrt(n); i++) { int64_t cnt = 0; while (n % i == 0) { cnt++; n /= i; } if (cnt) pr.push_back({i, cnt}); } if (n > 1) { pr.push_back({n, 1}); } return pr; } void solve() { int64_t n, k, ans = INT_MAX; cin >> n >> k; string s; cin >> s; char rgb[] = { R , G , B }; for (int64_t i = 0; i <= n - k; i++) { string tmp = s.substr(i, k); int64_t val1 = 0, val2 = 0, val3 = 0; for (int64_t j = 0; j <= k - 1; j++) { if (tmp[j] != rgb[(j) % 3]) val1++; if (tmp[j] != rgb[(j + 1) % 3]) val2++; if (tmp[j] != rgb[(j + 2) % 3]) val3++; } ans = min({val1, val2, val3, ans}); } cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int64_t t = 1; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 1e5 + 2; const int Nn = 251; char s[Maxn]; int a[Maxn][26], f[Nn][Nn][Nn], length[3], i, j, k, l, Min, n, m, id, p; char ss[3][Nn], op, c, sss[Nn]; void done() { for (int i = 0; i < 26; i++) { a[n][i] = n + 1; a[n + 1][i] = n + 1; } for (int i = n - 1; i >= 0; i--) { for (int j = 0; j < 26; j++) a[i][j] = a[i + 1][j]; a[i][s[i] - a ] = i + 1; } f[0][0][0] = 0; } int pos(int i, int j, int k, char c) { return a[f[i][j][k]][c - a ]; } void func(int i, int j, int k) { f[i][j][k] = n + 2; if (i > 0) { Min = pos(i - 1, j, k, ss[0][i]); if (Min < f[i][j][k]) f[i][j][k] = Min; } if (j > 0) { Min = pos(i, j - 1, k, ss[1][j]); if (Min < f[i][j][k]) f[i][j][k] = Min; } if (k > 0) { Min = pos(i, j, k - 1, ss[2][k]); if (Min < f[i][j][k]) f[i][j][k] = Min; } } int main() { scanf( %d%d , &n, &m); scanf( %s n , s); done(); for (l = 0; l < m; l++) { scanf( %c , &op); switch (op) { case + : scanf( %d %c , &id, &c); gets(sss); id %= 3; ++length[id]; ss[id][length[id]] = c; if (id == 0) { for (j = 0; j <= length[1]; j++) for (k = 0; k <= length[2]; k++) func(length[id], j, k); } if (id == 1) { for (i = 0; i <= length[0]; i++) for (k = 0; k <= length[2]; k++) func(i, length[id], k); } if (id == 2) { for (i = 0; i <= length[0]; i++) for (j = 0; j <= length[1]; j++) func(i, j, length[id]); } break; case - : scanf( %d , &id); gets(sss); id %= 3; --length[id]; break; } p = f[length[0]][length[1]][length[2]]; if (p <= n) printf( YES n ); else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> graph[100001]; int color[100001]; vector<int> b, w; void bfs(int v) { queue<int> q; q.push(v); color[v] = 1; b.push_back(v); while (!q.empty()) { int v = q.front(); q.pop(); for (int u : graph[v]) { if (color[u] == 0) { if (color[v] == 1) color[u] = 2, w.push_back(u); else color[u] = 1, b.push_back(u); q.push(u); } if (color[v] == color[u]) { printf( -1 ); exit(0); } } } } int main() { int n, m; scanf( %d %d , &n, &m); while (m--) { int a, b; scanf( %d %d , &a, &b); graph[a].push_back(b); graph[b].push_back(a); } for (int i = 1; i <= n; i++) if (color[i] == 0) bfs(i); printf( %d n , (int)b.size()); for (int i = 0; i < b.size(); i++) printf( %d , b[i]); printf( n%d n , (int)w.size()); for (int i : w) printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using ii = pair<int, int>; double x[60000], v[60000]; int n; bool f(double t) { vector<tuple<double, int> > a; for (int i = 0; i < n; ++i) { a.emplace_back(x[i] - v[i] * t, 0); a.emplace_back(x[i] + v[i] * t + 1e-7, 1); } sort(a.begin(), a.end()); int m = 0; for (int i = 0; i < n; ++i) { auto [x, e] = a[i]; if (e == 0) m++; else m--; if (m == n) return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 0; i < n; ++i) cin >> x[i]; for (int i = 0; i < n; ++i) cin >> v[i]; double lo = 0, hi = 1e9; while (hi - lo > 1e-7) { double mid = (hi + lo) / 2; if (f(mid)) hi = mid; else lo = mid; } cout << setprecision(15) << fixed << lo; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int count = 0; for (int i = n - 1; i > 0; i--) { if (n % i == 0) count++; } cout << count; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; vector<int> a; vector<int> b; vector<int> c; vector<vector<int> > g; int n, m, k; int dp[5005][5005]; int solve(int at, int homens) { if (at == n) { return 0; } if (dp[at][homens] != -1) { return dp[at][homens]; } if (a[at] > homens) { return dp[at][homens] = -INF; } int novoHomens = homens + b[at]; int resposta = solve(at + 1, novoHomens); int valor = 0; int quant = 0; for (int viz : g[at]) { quant++; valor += viz; if (novoHomens - quant >= 0) { resposta = max(resposta, valor + solve(at + 1, novoHomens - quant)); } } return dp[at][homens] = resposta; } bool comp(int a, int b) { return c[a] > c[b]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; a.resize(n); b.resize(n); c.resize(n); for (int I = 0; I < n; I++) { cin >> a[I] >> b[I] >> c[I]; } g.resize(n); int x, y; vector<int> conexoes(n); for (int I = 0; I < n; I++) { conexoes[I] = I; } for (int I = 0; I < m; I++) { cin >> x >> y; x--; y--; conexoes[y] = max(conexoes[y], x); } for (int I = 0; I < n; I++) { g[conexoes[I]].push_back(c[I]); } for (int I = 0; I < n; I++) { sort(g[I].rbegin(), g[I].rend()); } memset(dp, -1, sizeof(dp)); int resposta = solve(0, k); if (resposta < 0) { cout << -1 << n ; } else { cout << resposta << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxpq = priority_queue<T>; inline long long CC(long long n, long long y) { return (((n) + (y - 1) - 1) / (y - 1)) - (((n) + (y)-1) / (y)); } inline long long FF(long long n, long long y) { return n / y - n / (y + 1); } inline long long __gcd(long long a, long long b) { return !b ? a : __gcd(b, a % b); } inline int add(int a, int b, int p = 1000000007) { int c = a + b; if (c >= p) c -= p; return c; } inline int sub(int a, int b, int p = 1000000007) { int c = a - b; if (c < 0) c += p; return c; } inline int mul(int a, int b, int p = 1000000007) { return (a * 1ll * b) % p; } long long a, b, k, L; long long lcm(long long a, long long b) { return a / __gcd(a, b) * b; } long long bfs(long long src, long long dest) { __f( src, dest , src, dest); queue<long long> q; vector<bool> vis(src - dest + 1); q.push(src); q.push(0); vis[src - dest] = 1; while (1) { long long u = q.front(); q.pop(); long long d = q.front(); q.pop(); if (u == dest) return d; if (!vis[u - 1 - dest]) q.push(u - 1), q.push(d + 1); for (long long i = 2; i <= k; i++) { long long v = u / i * i; if (v >= dest && !vis[v - dest]) { vis[v - dest] = 1; q.push(v); q.push(d + 1); } } } } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL); clock_t clk = clock(); cerr << I will return... n ; cin >> a >> b >> k; if (k == 2) { cout << a - b; return 0; } L = 1; for (long long i = (2); i < (k + 1); i++) L = lcm(L, i); long long ans = 0; long long cnt = a / L - (b - 1) / L; __f( L, cnt , L, cnt); if (cnt) { long long m = bfs(L, 0); ans = m * (cnt - 1); __f( ans , ans); } if (!cnt) { ans += bfs(a, b); __f( ans , ans); } else { ans += bfs(a, a / L * L); ans += bfs((((b) + (L)-1) / (L)) * L, b); __f( ans , ans); } cout << ans << n ; cerr << ...don t you ever hang your head. n ; cerr << Time (in ms): << double(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << n ; } |
#include <bits/stdc++.h> int main() { int n; while (std::cin >> n) { if (n % 2 == 0) { std::cout << -1 << std::endl; continue; } std::vector<int> a(n), b(n), c(n), was(n); for (int i = 0; i < n; ++i) { a[i] = i; b[i] = (i + 1) % n; c[i] = (a[i] + b[i]) % n; assert(!was[c[i]]); was[c[i]] = 1; } for (auto it : a) { std::cout << it << ; } std::cout << std::endl; for (auto it : b) { std::cout << it << ; } std::cout << std::endl; for (auto it : c) { std::cout << it << ; } std::cout << std::endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int pr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; const int m = 16; const int INF = 1e9; int n, d[110], por[110], vv[110], opr[110]; int f[110][65560], to[110][65560], pi[110][65560]; void init() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &d[i]); for (int i = 1; i < 59; i++) { for (int j = 0; j < m; j++) if (!(i % pr[j])) opr[i] |= (1 << j); } for (int i = 0; i <= n; i++) for (int j = 0; j <= 65536; j++) f[i][j] = INF; } int main() { init(); f[0][0] = 0; for (int i = 1; i <= n; i++) { for (int k = 0; k < (1 << m); k++) if (f[i - 1][k] != INF) { for (int j = 1; j < 59; j++) { if (!(k & opr[j]) && f[i][k | opr[j]] > f[i - 1][k] + abs(d[i] - j)) { f[i][k | opr[j]] = f[i - 1][k] + abs(d[i] - j); to[i][k | opr[j]] = k; pi[i][k | opr[j]] = j; } } } } int ss = INF, yu = 0; for (int i = 0; i < (1 << m); i++) if (ss > f[n][i]) ss = f[n][i], yu = i; for (int i = yu, c = n; c > 0; i = to[c][i], c--) vv[c] = pi[c][i]; for (int i = 1; i <= n; i++) printf( %d , vv[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int gridSize = 1000; long long getPairs(int n) { long long result = 0; for (int i = 1; i < n; i++) result += n - i; return result; } int main() { std::cout.sync_with_stdio(false); int n, i, x, y, j; cin >> n; bool a[gridSize + 1][gridSize + 1]; for (i = 1; i <= gridSize; i++) for (j = 1; j <= gridSize; j++) a[i][j] = false; for (i = 0; i < n; i++) { cin >> x >> y; a[x][y] = true; } long long result = 0, attacking = 0; pair<int, int> startPoint(1, 1); for (i = 1; i <= gridSize; i++) { attacking = 0; startPoint = make_pair(1, i); do { if (a[startPoint.first][startPoint.second]) attacking++; startPoint.second++; startPoint.first++; } while (startPoint.second <= gridSize && startPoint.first <= gridSize); if (attacking > 1) result += getPairs(attacking); } for (i = 2; i <= gridSize; i++) { attacking = 0; startPoint = make_pair(i, 1); do { if (a[startPoint.first][startPoint.second]) attacking++; startPoint.second++; startPoint.first++; } while (startPoint.second <= gridSize && startPoint.first <= gridSize); if (attacking > 1) result += getPairs(attacking); } for (i = gridSize; i >= 1; i--) { attacking = 0; startPoint = make_pair(1, i); do { if (a[startPoint.first][startPoint.second]) attacking++; startPoint.second--; startPoint.first++; } while (startPoint.second >= 1 && startPoint.first <= gridSize); if (attacking > 1) result += getPairs(attacking); } for (i = 2; i <= gridSize; i++) { attacking = 0; startPoint = make_pair(i, gridSize); do { if (a[startPoint.first][startPoint.second]) attacking++; startPoint.second--; startPoint.first++; } while (startPoint.second >= 1 && startPoint.first <= gridSize); if (attacking > 1) result += getPairs(attacking); } cout << result; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> vt; for (int i = 0; i < n; i++) { int v; cin >> v; vt.push_back(v); } sort(vt.begin(), vt.end()); int ans = 0; int prev = vt[0]; for (int i = 1; i < n; i++) { int cur = vt[i]; int diff = cur - prev; if (diff > 1) { ans += (diff - 1); } prev = cur; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { static int n; static int a[300010], b[300010]; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d , &a[i], &b[i]); int cnt[2] = {}; for (int i = 1; i <= n; i++) { if (a[i] < b[i]) cnt[0]++; else cnt[1]++; } if (cnt[0] > cnt[1]) { vector<pair<int, int> > vec; for (int i = 1; i <= n; i++) { if (a[i] < b[i]) vec.push_back(pair<int, int>(-a[i], i)); } sort(vec.begin(), vec.end()); printf( %d n , cnt[0]); for (int i = 0; i < vec.size(); i++) { printf( %d%c , vec[i].second, (i + 1 == vec.size()) ? n : ); } } else { vector<pair<int, int> > vec; for (int i = 1; i <= n; i++) { if (a[i] > b[i]) vec.push_back(pair<int, int>(b[i], i)); } sort(vec.begin(), vec.end()); printf( %d n , cnt[1]); for (int i = 0; i < vec.size(); i++) { printf( %d%c , vec[i].second, (i + 1 == vec.size()) ? n : ); } } } |
#include <bits/stdc++.h> using namespace std; char s[10000]; int num[100]; int main() { int T, t, i, j, k, n, m = 0, len; scanf( %s , &s); len = strlen(s); for (i = 0; i < len; i++) { k = s[i] - a + 1; num[k]++; } for (i = 1; i <= 26; i++) if (num[i] % 2 == 1) m++; if (m == 0 || m == 1) printf( First n ); else if (m % 2 == 0) printf( Second n ); else printf( First n ); } |
#include <bits/stdc++.h> const double EPS = 1e-7, pi = 3.141592653589793; struct unit { double x, y; unit(double _x = 0, double _y = 0) : x(_x), y(_y) {} double cross(const unit &A) const { return x * A.y - y * A.x; } inline double len() const { return sqrt(x * x + y * y); } double operator*(const unit &A) const { return x * A.x + y * A.y; } unit operator*(const double &A) const { return unit(x * A, y * A); } unit operator-(const unit &A) const { return unit(x - A.x, y - A.y); } unit operator+(const unit &A) const { return unit(x + A.x, y + A.y); } unit operator/(const double &A) const { return unit(x / A, y / A); } inline void out() { printf( %.6lf %.6lf n , x, y); } }; void rotate(unit &A, double the) { double x = A.x * cos(the) - A.y * sin(the), y = A.x * sin(the) + A.y * cos(the); A = unit(x, y); } double r, R, v; unit now; void tangentpoint(unit p, unit &A, unit &B) { double d = p.len(); p = p / d; double cost = r / d, sint = sqrt(d * d - r * r) / d; unit ver = unit(-p.y, p.x); A = (p * r * cost) + (ver * r * sint); B = (p * r * cost) - (ver * r * sint); } inline double min(double a, double b) { return a < b ? a : b; } double arclength(unit A, unit B) { return r * acos((A * B) / A.len() / B.len()); } double calcdis(unit &now, unit tar) { unit u = unit() - now, v = tar - now; unit t1, t2, a, b; tangentpoint(now, t1, t2); tangentpoint(tar, a, b); if (v.len() < (t1 - now).len() + sqrt(R * R - r * r)) { return v.len(); } double ans = (t1 - now).len() + (b - tar).len() + min(min(arclength(t2, a), arclength(t2, b)), min(arclength(t1, a), arclength(t1, b))); return ans; } double bs(double l, double u, double st, double w) { double low = l, up = u; for (int i = 0; i < 100; i++) { double mid = (low + up) / 2; double d = calcdis(now, unit(R * cos(mid), R * sin(mid))); if (st + (mid - l) / w > d / v) up = mid; else low = mid; } return low; } int main() { unit tar; double vp; while (~scanf( %lf%lf%lf , &tar.x, &tar.y, &vp)) { scanf( %lf%lf%lf%lf , &now.x, &now.y, &v, &r); double theta = acos(now * (unit(-1, 0)) / now.len()); if (now.y < 0) theta *= -1; rotate(now, theta); rotate(tar, theta); R = tar.len(); double w = vp / R, T = 2.0 * pi / w; double anst = 1e8; if (tar.y < -EPS) { double theta = acos(tar * unit(1, 0) / tar.len()); double st = theta / w, et = st + T / 2.0; double d1 = calcdis(now, unit(R, 0)), d2 = calcdis(now, unit(-R, 0)); int k = ceil((d2 / v - et) / (T)); if (et >= d2 / v) k = 0; if (st + k * T < d1 / v + EPS) { double tmp = bs(0, pi, st + k * T, +w); anst = min(anst, st + k * T + tmp / w); } st = et; et = st + T / 2.0; k = ceil((d1 / v - et) / (T)); if (et >= d1 / v) k = 0; if (st + k * T < d2 / v + EPS) { double tmp = bs(pi, 2 * pi, st + k * T, w); anst = min(anst, st + k * T + (tmp - pi) / w); } if (calcdis(now, unit(R, 0)) / v < theta / w + EPS) { double tmp = bs(-theta, 0, 0, w); anst = min(anst, (tmp + theta) / w); } } else { double theta = acos(tar * unit(-1, 0) / tar.len()); double st = theta / w, et = st + T / 2.0; double d1 = calcdis(now, unit(R, 0)), d2 = calcdis(now, unit(-R, 0)); int k = ceil((d1 / v - et) / (T)); if (et >= d1 / v) k = 0; if (st + k * T < d2 / v + EPS) { double tmp = bs(pi, 2 * pi, st + k * T, w); anst = min(anst, st + k * T + (tmp - pi) / w); } st = et; et = st + T / 2.0; k = ceil((d2 / v - et) / (T)); if (et >= d2 / v) k = 0; if (st + k * T < d1 / v + EPS) { double tmp = bs(0, pi, st + k * T, w); anst = min(anst, st + k * T + tmp / w); } if (calcdis(now, unit(-R, 0)) / v < theta / w + EPS) { double tmp = bs(pi - theta, pi, 0, w); anst = min(anst, (tmp - pi + theta) / w); } } printf( %.10lf n , anst); } } |
#include <bits/stdc++.h> using namespace std; int n, a, b; int main() { cin >> n >> a >> b; n -= a; b++; cout << (n > b ? b : n); return 0; } |
#include <bits/stdc++.h> using namespace std; bool ask(long long l, long long r) { cout << l << << r << n ; cout.flush(); string res; cin >> res; return res == Yes ; } int main() { srand(time(NULL)); ios_base::sync_with_stdio(false); long long n, k; cin >> n >> k; long long l = 1, r = n; while (true) { if (r - l > 60ll) { long long mid = l + r >> 1; if (ask(l, mid)) { l = max(1ll, l - k); r = min(mid + k, n); } else { l = max(mid + 1 - k, 1ll); r = min(r + k, n); } } else { long long mid = rand() % (r - l + 1) + l; if (ask(mid, mid)) return 0; l = max(l - k, 1ll); r = min(r + k, n); } } } |
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const long long LINF = LLONG_MAX; const unsigned long long ULINF = ULLONG_MAX; const double EPS = 0.000001; char v[150][150], v_new[150][150]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int w, h; cin >> w >> h; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) cin >> v[i][j]; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) v_new[j][i] = v[i][j]; for (int i = 0; i < w; i++) { for (int j = 0; j < h; j++) { cout << v_new[i][j]; cout << v_new[i][j]; } cout << n ; for (int j = 0; j < h; j++) { cout << v_new[i][j]; cout << v_new[i][j]; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct { int begin, end; } P1[60], P2[60]; int main() { int num1, num2, first, last; scanf( %d %d %d %d , &num1, &num2, &first, &last); int ans = 0; for (int i = 1; i <= num1; i++) scanf( %d %d , &P1[i].begin, &P1[i].end); for (int i = 1; i <= num2; i++) scanf( %d %d , &P2[i].begin, &P2[i].end); for (int i = first; i <= last; i++) { for (int j1 = 1; j1 <= num1; j1++) { bool flag = 1; for (int j2 = 1; j2 <= num2; j2++) { if ((P2[j2].begin + i >= P1[j1].begin && P2[j2].begin + i <= P1[j1].end) || (P2[j2].end + i >= P1[j1].begin && P2[j2].end + i <= P1[j1].end) || (P2[j2].begin + i <= P1[j1].begin && P2[j2].end + i >= P1[j1].end)) { ans++; flag = 0; break; } } if (!flag) break; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void dbs(string str, T t) { cerr << str << : << t << n ; } template <class T, class... S> void dbs(string str, T t, S... s) { long long idx = str.find( , ); cerr << str.substr(0, idx) << : << t << , ; dbs(str.substr(idx + 1), s...); } template <class T> void prc(T a, T b) { cerr << [ ; for (T i = a; i != b; ++i) { if (i != a) cerr << , ; cerr << *i; } cerr << ] n ; } template <class T> void prall(T a) { prc(a.begin(), a.end()); } const int inf = 1000 * 1000 * 1000 + 9; const long long infl = 1ll * inf * inf; const int mod = 1000 * 1000 * 1000 + 7; void solve() { int t; cin >> t; while (t--) { int n; cin >> n; int o = 0, e = 0; for (int i = 0; i < n; i++) { int p; cin >> p; if (p & 1) o++; else e++; } long long ans = 0; int m; cin >> m; for (int i = 0; i < m; i++) { int p; cin >> p; if (p & 1) { ans += o; } else ans += e; } cout << ans << n ; } } int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout << fixed << setprecision(13); solve(); } |
#include <bits/stdc++.h> using namespace std; int const N = 2 * 1e5 + 5; int ans = 0; int i, j, n, m, k, z, y, x, t, mi, ma; long long a[N]; long long dp[N][2], d[N][2]; char st[N]; long long poisk(int x, int t) { if (dp[x][t] != 0) return dp[x][t]; long long y = x; d[x][t]++; if (d[x][t] > 1) { d[x][t] = -1; return d[x][t]; } if (t == 0) y += a[x]; else y -= a[x]; if (y < 1 || y > n) { dp[x][t] = a[x]; return dp[x][t]; } long long z = poisk(y, 1 - t); if (z > 0) dp[x][t] = a[x] + z; else dp[x][t] = -1; return dp[x][t]; } int main() { scanf( %d , &n); for (i = 2; i <= n; i++) scanf( %I64d , &a[i]); for (i = 1; i < n; i++) { a[1] = i; d[1][0] = 0; long long k = poisk(1 + i, 1); if (k > 0) k += i; printf( %I64d n , k); } } |
#include <bits/stdc++.h> struct M { int p, b; }; struct F { const int p, i; int r, c; F(int p, int t, int i) : p(p), i(i), r(p + t), c(0) {} int t() { return r - p; } }; void solve(std::vector<F> &fs, std::vector<M> &ms) { std::multimap<int, int> ms_landed; std::map<int, F *> fs_active; { std::vector<F *> fs_sort; fs_sort.reserve(fs.size()); for (int i = 0; i < fs.size(); i++) fs_sort.push_back(&fs[i]); std::sort(fs_sort.begin(), fs_sort.end(), [](const F *lhs, const F *rhs) { return lhs->p < rhs->p; }); fs_active.insert({fs_sort[0]->p, fs_sort[0]}); int curr = fs_sort[0]->r; for (int i = 1; i < fs_sort.size(); i++) { F &f = *fs_sort[i]; if (f.r > curr) { int l = std::max(curr + 1, f.p); curr = f.r; fs_active.insert({l, &f}); } } } auto update = [&](F &f, std::map<int, F *>::iterator &f_succ, const int &b) { f.c++; f.r += b; while (f_succ != fs_active.end()) { int l_succ = f_succ->first; int r_succ = f_succ->second->r; if (f.r < r_succ) { if (f.r >= l_succ) { fs_active.erase(f_succ); f_succ = fs_active.insert({f.r + 1, f_succ->second}).first; } break; } f_succ = fs_active.erase(f_succ); } }; for (const M &m : ms) { auto f_it = --fs_active.upper_bound(m.p); const int l = f_it->first; F &f = *f_it->second; if (l <= m.p && m.p <= f.r) { update(f, ++f_it, m.b); auto m_it = ms_landed.lower_bound(l); while (m_it != ms_landed.end()) { M m{m_it->first, m_it->second}; if (l <= m.p && m.p <= f.r) { update(f, f_it, m.b); m_it = ms_landed.erase(m_it); } else { break; } } } else { ms_landed.insert({m.p, m.b}); } } for (F &f : fs) { printf( %d %d n , f.c, f.t()); } } int main() { int n, m; scanf( %d%d , &n, &m); std::vector<F> fs; fs.reserve(n); std::vector<M> ms; ms.reserve(m); for (int i = 0; i < n; i++) { int p, t; scanf( %d%d , &p, &t); fs.push_back({p, t, i}); } for (int i = 0; i < m; i++) { int p, b; scanf( %d%d , &p, &b); ms.push_back({p, b}); } solve(fs, ms); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> orig[3]; int a, b, x1, y1, t = 0; for (int i = 0; i < 3; i++) { cin >> orig[i].first >> orig[i].second; } cout << 3 << endl; a = (orig[0].first + orig[1].first) / 2; b = (orig[0].second + orig[1].second) / 2; cout << (orig[0].first + orig[1].first - orig[2].first) << << (orig[0].second + orig[1].second - orig[2].second) << endl; a = (orig[1].first + orig[2].first); b = (orig[1].second + orig[2].second); cout << (a - orig[0].first) << << (b - orig[0].second) << endl; a = (orig[0].first + orig[2].first); b = (orig[0].second + orig[2].second); cout << (a - orig[1].first) << << (b - orig[1].second) << endl; } |
#include <bits/stdc++.h> using namespace std; int m, n, L, cnt, sum[1000005]; char s[1000005], x[1000005]; struct Node { Node *par, *go[26]; int val, sum, flag, num; void Clear(int _val) { par = NULL; for (int i = 0; i < 26; i++) go[i] = NULL; sum = flag = 0; val = _val; } } * root, *last, *a[1000005 * 2], *b[1000005 * 2]; void Extend(int w) { Node *p = last, *np = new Node; a[++cnt] = np; np->num = cnt; np->Clear(p->val + 1); for (; p && (!(p->go[w])); p = p->par) p->go[w] = np; if (!p) np->par = root; else { Node *q = p->go[w]; if (q->val == p->val + 1) np->par = q; else { Node *nq = new Node; a[++cnt] = nq; nq->num = cnt; nq->Clear(p->val + 1); for (int i = 0; i < 26; i++) nq->go[i] = q->go[i]; nq->par = q->par; q->par = np->par = nq; for (; p && (p->go[w] == q); p = p->par) p->go[w] = nq; } } last = np; } void BuildSAM() { scanf( %s , &s); m = strlen(s); cnt = 0; root = new Node; root->Clear(0); root->num = 0; last = root; for (int i = 0; i < m; i++) Extend(s[i] - a ); } void DP() { for (Node *p = last; p; p = p->par) p->sum = 1; for (int i = 0; i <= m; i++) sum[i] = 0; for (int i = 1; i <= cnt; i++) sum[a[i]->val]++; for (int i = 1; i <= m; i++) sum[i] += sum[i - 1]; for (int i = 1; i <= cnt; i++) b[sum[a[i]->val]--] = a[i]; for (int i = cnt; i >= 1; i--) { Node *p = b[i]; for (int j = 0; j < 26; j++) if (p->go[j]) { p->sum += p->go[j]->sum; } } } int main() { BuildSAM(); DP(); scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , &x); L = strlen(x); Node *p = root; int len = 0; for (int j = 0; j < L; j++) { int w = x[j] - a ; while (p && (!p->go[w])) p = p->par; if (!p) p = root; len = min(len, p->val); if (p->go[w]) { p = p->go[w]; len++; } } int ans = 0; for (int j = 0; j < L; j++) { int w = x[j] - a ; while (p && (!p->go[w])) p = p->par; if (!p) { p = root; continue; } len = min(len + 1, p->val + 1); p = p->go[w]; while (p->par && (p->par->val >= L)) p = p->par; if (p->flag == i) continue; if (len >= L) { ans += p->sum; p->flag = i; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { char c; bool nega = 0; while ((!isdigit(c = getchar())) && (c != - )) ; if (c == - ) { nega = 1; c = getchar(); } x = c - 48; while (isdigit(c = getchar())) x = x * 10 + c - 48; if (nega) x = -x; } template <typename T> inline void writep(T x) { if (x > 9) writep(x / 10); putchar(x % 10 + 48); } template <typename T> inline void write(T x) { if (x < 0) { putchar( - ); x = -x; } writep(x); } template <typename T> inline void writeln(T x) { write(x); putchar( n ); } int n, m; int f[5001][5001]; char c[5001][5001]; inline int sum(int x, int y, int u, int v) { return f[u][v] - f[u][y - 1] - f[x - 1][v] + f[x - 1][y - 1]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> c[i][j]; c[i][j] -= 0 ; } for (int i = 1; i <= 5000; i++) for (int j = 1; j <= 5000; j++) f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + c[i][j]; int ans = m * n; for (int k = 2500; k >= 2; k--) { int i = 1; int res = 0; int sq = k * k; int t = 0; do { int j = 1; do { t = sum(i, j, i + k - 1, j + k - 1); res += min(t, sq - t); j += k; } while (j <= m); i += k; } while (i <= n); ans = min(ans, res); } writeln(ans); } |
#include <bits/stdc++.h> using namespace std; int pos = -1; void Go(vector<string> &t) { if (t[++pos] == int ) { cout << int ; } else { cout << pair< ; Go(t); cout << , ; Go(t); cout << > ; } } int main() { int n, i = 0; bool check = true; cin >> n; string t, t1 = ; int bal = 0; int k = 0; std::vector<std::string> s; char c; std::getline(std::cin, t); std::getline(std::cin, t); for (int j = 0; j < t.length(); j++) { if (t[j] != ) { t1 += t[j]; } else { s.push_back(t1); t1 = ; } } s.push_back(t1); k = s.size(); { for (int i = 0; i < k - 1; i++) { if (s[i] == pair ) bal++; else { bal--; } if (bal < 0) { check = false; } } if (s[k - 1] == pair ) bal++; else { bal--; } if (bal != -1) { check = false; } if (!check) { cout << Error occurred ; return 0; } } Go(s); } |
#include <bits/stdc++.h> using namespace std; void pr(char c, int t) { while (t--) printf( %c , c); } int main() { int n, i, co(0), s; map<char, int> c; char ch; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %c , &ch); ++c[ch]; } for (const auto &e : c) if (e.second & 1) ++co; if (co < 2) { printf( 1 n ); for (auto it = c.begin(); it != c.end(); ++it) if (~it->second & 1) pr(it->first, it->second / 2); for (auto it = c.begin(); it != c.end(); ++it) if (it->second & 1) { pr(it->first, it->second); c.erase(it); break; } for (auto it = c.rbegin(); it != c.rend(); ++it) if (~it->second & 1) pr(it->first, it->second / 2); printf( n ); return 0; } for (s = co; n % s || !(n / s & 1); ++s) ; printf( %d n , s); vector<set<pair<int, char>>> str; vector<int> tot; for (auto &e : c) if (e.second & 1) { set<pair<int, char>> tmp; tmp.insert({1, e.first}); str.push_back(tmp); tot.push_back(1); --e.second; } for (auto &e : c) while (co < s && e.second) { set<pair<int, char>> tmp; tmp.insert({1, e.first}); str.push_back(tmp); tot.push_back(1); --e.second; ++co; } map<char, int>::iterator it(c.begin()); for (i = 0; i < s; ++i) while (tot[i] < n / s) { while (!it->second) ++it; int tmp(min(it->second, n / s - tot[i])); str[i].insert({tmp, it->first}); it->second -= tmp; tot[i] += tmp; } for (i = 0; i < s; ++i) { if (i) printf( ); for (auto it = str[i].rbegin(); it != str[i].rend(); ++it) pr(it->second, it->first / 2); for (auto it = str[i].begin(); it != str[i].end(); ++it) pr(it->second, (it->first + 1) / 2); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long int; using ull = unsigned long long int; using dd = double; using ldd = long double; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll n, r; cin >> n >> r; vector<ll> arr((ll(1)) << n); ll sum = 0; n = ((ll)1) << n; for (int i = 0; i < n; ++i) { cin >> arr[i]; sum += arr[i]; } cout.precision(10); cout << ((dd)sum) / (dd(n)) << n ; for (int i = 0; i < r; ++i) { ll a, b; cin >> a >> b; sum -= arr[a]; sum += b; arr[a] = b; cout << ((dd)sum) / (dd(n)) << n ; } } |
#include <bits/stdc++.h> const int intINF = 999999999; const long long i64INF = 99999999999999999ll; const double doubleINF = 9999999999.; using namespace std; int abs(int a) { if (a < 0) a *= -1; return a; } int max(int a, int b) { if (a < b) a = b; return a; } int main() { int x1, y1, x2, y2, px, py; scanf( %d%d%d%d%d%d , &px, &py, &x1, &y1, &x2, &y2); int m; int p1, p2; p1 = abs(y1 - y2); p2 = abs(x1 - x2); if ((p1 >= 3 && p2 >= 4) || (p1 >= 4 && p2 >= 3) || p1 > 4 || p2 > 4) printf( Second n ); else printf( First n ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <int _mod = 998244353> class Modular { private: static constexpr int mod = _mod; static_assert(_mod > 0, mod must be positive ); int value; public: Modular() : value(0) {} template <typename U> Modular(const U& _value) { value = normalize(_value); } template <typename U> static int normalize(const U& _value) { int v; if (-mod <= _value && _value < mod) v = static_cast<int>(_value); else v = static_cast<int>(_value % mod); if (v < 0) v += mod; return v; } template <typename U> static U inverse(U a, U m) { U u = 0, v = 1; while (a != 0) { U t = m / a; m -= t * a; swap(a, m); u -= t * v; swap(u, v); } assert(m == 1); return u; } const int& operator ()() const { return value; } template <typename U> explicit operator U() const { return static_cast<U>(value); } template <typename U> friend U& operator << (U& stream, const Modular& number) { return stream << number(); } template <typename U> friend U& operator >> (U& stream, Modular& number) { long long x; stream >> x; number.value = normalize(x); return stream; } Modular& operator -= (const Modular& other) { if ((value -= other.value) < 0) value += mod; return *this; } template <typename U> Modular& operator -= (const U& other) { return *this -= Modular(other); } Modular& operator += (const Modular& other) { return *this -= Modular(mod - other.value); } template <typename U> Modular& operator += (const U& other) { return *this += Modular(other); } Modular& operator ++ () { return *this += 1; } Modular& operator -- () { return *this -= 1; } Modular operator ++ (int) { Modular result(*this); *this += 1; return result; } Modular operator -- (int) { Modular result(*this); *this -= 1; return result; } Modular operator - () const { return Modular(-value); } Modular& operator *= (const Modular& other) { value = normalize(static_cast<long long>(value) * static_cast<long long>(other.value)); return *this; } template <typename U> Modular& operator *= (const U& other) { return *this *= Modular(other); } Modular& operator /= (const Modular& other) { return *this *= Modular(inverse(other.value, mod)); } template <typename U> Modular& operator /= (const U& other) { return *this /= Modular(other); } friend bool operator == (const Modular& first, const Modular& second) { return first.value == second.value; } template <typename U> friend bool operator == (const Modular& first, const U& second) { return first == Modular(second); } template <typename U> friend bool operator == (const U& first, const Modular& second) { return Modular(first) == second; } friend bool operator != (const Modular& first, const Modular& second) { return !(first.value == second.value); } template <typename U> friend bool operator != (const Modular& first, const U& second) { return first != Modular(second); } template <typename U> friend bool operator != (const U& first, const Modular& second) { return Modular(first) != second; } friend Modular operator + (const Modular& first, const Modular& second) { return Modular(first) += second; } template <typename U> friend Modular operator + (const Modular& first, const U& second) { return Modular(first) += second; } template <typename U> friend Modular operator + (const U& first, const Modular& second) { return Modular(first) += second; } friend Modular operator - (const Modular& first, const Modular& second) { return Modular(first) -= second; } template <typename U> friend Modular operator - (const Modular& first, const U& second) { return Modular(first) -= second; } template <typename U> friend Modular operator - (const U& first, const Modular& second) { return Modular(first) -= second; } friend Modular operator * (const Modular& first, const Modular& second) { return Modular(first) *= second; } template <typename U> friend Modular operator * (const Modular& first, const U& second) { return Modular(first) *= second; } template <typename U> friend Modular operator * (const U& first, const Modular& second) { return Modular(first) *= second; } friend Modular operator / (const Modular& first, const Modular& second) { return Modular(first) /= second; } template <typename U> friend Modular operator / (const Modular& first, const U& second) { return Modular(first) /= second; } template <typename U> friend Modular operator / (const U& first, const Modular& second) { return Modular(first) /= second; } template <typename U> friend Modular power(const Modular& base, const U& exponent) { assert(exponent >= 0); Modular x = base, res = 1; U p = exponent; while (p > 0) { if(p & 1) res *= x; x *= x; p >>= 1; } return res; } }; using Mint = Modular<int(1e9)+7>; // <, >, <=, >= comparisons not available int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; const int inf = 1e9 + 5; vector<vector<int>> dis(n, vector<int>(n, inf)); for (int i = 0; i < n; i++) { dis[i][i] = 0; } for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; --u, --v; dis[u][v] = dis[v][u] = 1; } for (int k = 0; k < n; k++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); } } } vector<vector<Mint>> dp(n + 1, vector<Mint>(n + 1)); for (int i = 1; i <= n; i++) { dp[i][0] = 1; for (int j = 1; j <= n; j++) { dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) / 2; } } Mint ans = 0; for (int r = 0; r < n; r++) { for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int x = dis[i][r], y = dis[r][j]; int d = (x + y - dis[i][j]) / 2; x -= d, y -= d; ans += dp[x][y]; } } } ans /= n; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long dp[100004][2]; int n; vector<int> g[100004]; int v[100004]; void dfs(int x) { dp[x][v[x]] = 1; for (int i = 0; i < g[x].size(); i++) { int y = g[x][i]; dfs(y); dp[x][1] = dp[x][1] * (dp[y][0] + dp[y][1]) % MOD; dp[x][1] = (dp[x][1] + dp[y][1] * dp[x][0]) % MOD; dp[x][0] = dp[x][0] * (dp[y][0] + dp[y][1]) % MOD; } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x; scanf( %d , &x); g[x].push_back(i); } for (int i = 0; i < n; i++) scanf( %d , &v[i]); dfs(0); cout << dp[0][1]; } |
#include <bits/stdc++.h> using namespace std; long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; } long long lcm(long long a, long long b) { return a * b / GCD(a, b); } int lb(int x) { return x & (-x); } const long long N = 3e5 + 7; const long long inf = 1e18 + 1; const long long mod2 = 998244353; const long long mod1 = 1e9 + 7; const int P1 = 13331; const int P2 = 131; const double eps = 1e-6; const double dbinf = 1e13 + 7; const long long mod3 = 10000 + 7; int n, m; string s; struct node { int v, nxt; }; node e[N]; int tot; int head[N]; int ing[N]; int ans; int dp[N][26]; void add(int u, int v) { e[++tot] = {v, head[u]}; head[u] = tot; } void topsort(void) { queue<int> q; for (int i = 1; i <= n; i++) { if (ing[i] == 0) { q.push(i); dp[i][s[i] - a ] = 1; } } int cnt = 0; while (!q.empty()) { int x = q.front(); cnt++; q.pop(); for (int i = head[x]; i; i = e[i].nxt) { int v = e[i].v; if (--ing[v] == 0) q.push(v); for (int j = 0; j <= 25; j++) { dp[v][j] = max(dp[v][j], dp[x][j] + (s[v] - a == j)); } } } if (cnt != n) { cout << -1 n ; } else { int maxn = 0; for (int i = 1; i <= n; i++) { for (int j = 0; j <= 25; j++) { maxn = max(maxn, dp[i][j]); } } cout << maxn << n ; } } int main() { memset(head, 0, sizeof head); memset(ing, 0, sizeof ing); cin >> n >> m; cin >> s; s = * + s; tot = 0; for (int i = 1, u = 1, v = 1; i <= m; i++) { cin >> u >> v; add(u, v); ing[v]++; } topsort(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long N = 2e5 + 7; const int mod = 1e9 + 7; bool cmp(const pair<long long, long long>& a, const pair<long long, long long>& b) { return a.first < b.first; } long long median(long long a, long long b, long long c, long long d) { vector<long long> v(4); v[0] = a; v[1] = b; v[2] = c; v[3] = d; sort(v.begin(), v.end()); return ((v[1] + v[2]) / 2); } void solve() { long long n, m; cin >> n >> m; long long a[n][m]; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { cin >> a[i][j]; } } long long ans = 0; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { long long k = median(a[i][j], a[i][m - 1 - j], a[n - 1 - i][j], a[n - 1 - i][m - 1 - j]); ans += abs(k - a[i][j]); } } cout << ans << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int n, k, p; int dp[111][555555], cur[111], a[555555], ld[111], sum[555555], dpp[555555], bit[1111], sz; void update(int x, int p) { while (x <= sz) { bit[x] = max(bit[x], p); x += x & (-x); } } int query(int x) { int res = 0; while (x >= 1) { res = max(res, bit[x]); x -= x & (-x); } return res; } int main() { scanf( %d%d%d , &n, &k, &p); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); a[i] %= p; } if (k * p >= n) { for (int i = 0; i <= k; i++) { for (int j = 0; j <= n; j++) dp[i][j] = 1e9; } dp[0][0] = 0; for (int i = 1; i <= k; i++) { for (int j = 0; j < p; j++) cur[j] = 1e9; for (int j = 1; j <= n; j++) { for (int h = 0; h < p; h++) ld[(h + a[j]) % p] = cur[h]; for (int h = 0; h < p; h++) cur[h] = ld[h]; cur[a[j]] = min(cur[a[j]], dp[i - 1][j - 1]); for (int h = 0; h < p; h++) dp[i][j] = min(dp[i][j], cur[h] + h); } } cout << dp[k][n] << endl; } else { for (int i = 1; i <= n; i++) sum[i] = (sum[i - 1] + a[i]) % p; sz = 1; while (sz < p) sz *= 2; for (int i = 1; i <= n; i++) { dpp[i] = query(sum[i] + 1) + 1; update(sum[i] + 1, dpp[i]); } if (dpp[n] >= k) cout << sum[n] << endl; else cout << sum[n] + p << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long int n, c = 0; int x; cin >> n; unsigned long long int pos[11] = {}, neg[11] = {}, z = 0, i; for (i = 0; i < n; i++) { cin >> x; if (x == 0) z++; else if (x < 0) neg[(-1) * x]++; else { pos[x]++; } } for (int i = 1; i < 11; i++) { c = c + pos[i] * neg[i]; } if (z > 1) z = (z * (z - 1)) / 2; else { z = 0; } cout << c + z; } |
#include <bits/stdc++.h> using namespace std; class union_find { public: vector<int> arr; union_find(int n) { arr.resize(n); fill(arr.begin(), arr.end(), -1); } int find(int x) { return arr[x] < 0 ? x : arr[x] = find(arr[x]); } void unite(int x, int y) { x = find(x), y = find(y); if (x == y) return; if (arr[x] > arr[y]) swap(x, y); arr[x] += arr[y]; arr[y] = x; } bool connected(int x, int y) { return find(x) == find(y); } int size(int x) { return -arr[find(x)]; } }; template <typename T> vector<int> coordinate_compression(const T &a, int cur = 0) { int n = a.size(); T b = a; sort(b.begin(), b.end()); b.erase(unique(b.begin(), b.end()), b.end()); vector<int> res(n); for (int i = 0; i < n; i++) res[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin() + cur; return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<long long> a(2 * n); for (int i = 0; i < a.size(); i++) cin >> a[i]; vector<int> b = coordinate_compression(a); union_find uf(2 * n); vector<int> mx0(2 * n), mx1(2 * n, -1); for (int i = 0; i < 2 * n; i++) mx0[i] = i; vector<bool> ju(2 * n); for (int i = 0; i < n; i++) { int u = b[2 * i], v = b[2 * i + 1]; if (uf.connected(u, v)) { if (ju[uf.find(u)]) { cout << -1 << n ; return 0; } ju[uf.find(u)] = true; } else { int ru = uf.find(u), rv = uf.find(v); uf.unite(u, v); mx1[uf.find(u)] = max(max(mx1[ru], mx1[rv]), min(mx0[ru], mx0[rv])); mx0[uf.find(u)] = max(mx0[ru], mx0[rv]); } } int res = 0; for (int i = 0; i < 2 * n; i++) { if (ju[uf.find(i)]) { res = max(res, mx0[uf.find(i)]); } else { res = max(res, mx1[uf.find(i)]); } } for (int i = 0; i < 2 * n; i++) { if (res == b[i]) { cout << a[i] << n ; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; double x, y, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> x >> y; ans = (ans * (i - 1) + y) / i; } ans += 5; printf( %.3lf , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int n; cin >> n; char str[n + 2]; cin >> str; if (n == 1) { cout << 0 << endl; return 0; } int current = 0; int previous = 0; if (str[0] == U ) current++; else current--; int count = 0; int sign = (current > 0 ? 1 : -1); for (int i = 1; i < n; i++) { previous = current; if (str[i] == U ) current++; else current--; if (previous == 0 && sign != current) { count++; sign = current; } } cout << count << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000; const int maxn = 1e5 + 100; long long dp[maxn][2], c[maxn]; string reverse(string s) { string t = ; for (int i = s.size() - 1; i >= 0; i--) t += s[i]; return t; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) cin >> c[i]; string last; cin >> last; dp[0][0] = 0; dp[0][1] = c[0]; for (int i = 1; i < n; i++) { string now; cin >> now; dp[i][0] = dp[i][1] = INF; if (last <= now) dp[i][0] = min(dp[i][0], dp[i - 1][0]); if (reverse(last) <= now) dp[i][0] = min(dp[i][0], dp[i - 1][1]); if (last <= reverse(now)) dp[i][1] = min(dp[i][1], dp[i - 1][0] + c[i]); if (reverse(last) <= reverse(now)) dp[i][1] = min(dp[i][1], dp[i - 1][1] + c[i]); last = now; } long long ans = min(dp[n - 1][0], dp[n - 1][1]); if (ans >= INF) cout << -1 << endl; else cout << ans << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.