func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; const double PI = acos(-1.0); const long long mod = 1e18; const int MAXN = 100000 + 5; const int INF = 0x3f3f3f3f; const int N = 100 + 10; int main() { ios::sync_with_stdio(false); int n, f[26], num = 0, ans = 0; char opr; bool flag = false; string s; cin >> n; memset(f, 0, sizeof f); for (int i = 0; i < n; i++) { cin >> opr >> s; if (opr == ! ) { if (flag) { ans++; } int tmp[26]; memset(tmp, 0, sizeof tmp); for (int k = 0; k < s.length(); k++) { tmp[s[k] - a ] = 1; } for (int k = 0; k < 26; k++) { if (tmp[k] == 0) f[k] = -1; } } else if (opr == . ) { for (int k = 0; k < s.length(); k++) { f[s[k] - a ] = -1; } } else { if (flag && f[s[0] - a ] == -1) ans++; f[s[0] - a ] = -1; } num = 0; for (int k = 0; k < 26; k++) { if (f[k] != -1) num++; } if (num == 1) flag = true; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int fh = 1, x = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) fh = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { x = (x << 3) + (x << 1) + ch - 0 ; ch = getchar(); } return fh * x; } inline void write(const int x) { if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } inline int _abs(const int x) { return x >= 0 ? x : -x; } inline int _max(const int x, const int y) { return x >= y ? x : y; } inline int _min(const int x, const int y) { return x <= y ? x : y; } inline int _gcd(const int x, const int y) { return y ? _gcd(y, x % y) : x; } inline int _lcm(const int x, const int y) { return x * y / _gcd(x, y); } char a[100005], b[100005], ans[100005]; int lena, lenb; signed main() { scanf( %s %s , a, b); ans[0] = a[0]; int i; for (i = 1; i < strlen(a); i++) if (a[i] < b[0]) ans[i] = a[i]; else break; ans[i] = b[0]; printf( %s n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct fastIO { inline fastIO operator>>(int& num) { num = 0; char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); bool foo = 0; if (c == - ) { foo = 1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } if (foo) num = -num; return *this; } inline fastIO operator>>(long long& num) { num = 0; char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); bool foo = 0; if (c == - ) { foo = 1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } if (foo) num = -num; return *this; } inline fastIO operator>>(float& num) { scanf( %f , &num); return *this; } inline fastIO operator>>(double& num) { scanf( %lf , &num); return *this; } inline fastIO operator>>(long double& num) { scanf( %Lf , &num); return *this; } inline fastIO operator>>(char& num) { num = getchar(); while (num == || num == n ) num = getchar(); return *this; } inline fastIO operator>>(char* num) { int cnt = 0; char c = getchar(); while (c == || c == n ) c = getchar(); while (c != && c != n ) { num[cnt++] = c; c = getchar(); } num[cnt] = 0; return *this; } inline fastIO operator>>(string& num) { cin >> num; return *this; } inline void printInt(const int& num) { if (num < 10) { putchar(num + 0 ); return; } printInt(num / 10); putchar((num % 10) + 0 ); } inline void printINT(const long long& num) { if (num < 10) { putchar(num + 0 ); return; } printINT(num / 10); putchar((num % 10) + 0 ); } inline fastIO operator<<(const int& num) { if (num < 0) putchar( - ), printInt(-num); else printInt(num); return *this; } inline fastIO operator<<(const long long& num) { if (num < 0) putchar( - ), printINT(-num); else printINT(num); return *this; } inline fastIO operator<<(const float& num) { printf( %.10f , num); return *this; } inline fastIO operator<<(const double& num) { printf( %.16lf , num); return *this; } inline fastIO operator<<(const long double& num) { printf( %.20Lf , num); return *this; } inline fastIO operator<<(const char& num) { putchar(num); return *this; } inline fastIO operator<<(const char* num) { for (int i = 0; num[i]; i++) putchar(num[i]); return *this; } inline fastIO operator<<(const string& num) { cout << num; return *this; } } fio; char s[1000005]; int fail[1000005]; int bz[1000005][25]; int n, k; int main() { fio >> n >> k; fio >> (s + 1); int fu = 0; fail[1] = 0; for (int i = 2; i <= n; i++) { while (fu && s[i] != s[fu + 1]) { fu = fail[fu]; } if (s[i] == s[fu + 1]) { fu++; } fail[i] = fu; } fail[0] = 0; for (int i = 0; i <= n; i++) { bz[i][0] = fail[i]; } for (int i = 1; i <= 20; i++) { for (int j = 0; j <= n; j++) { bz[j][i] = bz[bz[j][i - 1]][i - 1]; } } for (int i = 1; i <= n; i++) { int frm = (1LL * (k - 1) * i + k - 1) / k; int to = 1LL * k * i / (k + 1); int xx = i; for (int j = 20; j >= 0; j--) { if (bz[xx][j] > to) { xx = bz[xx][j]; } } xx = bz[xx][0]; if (frm <= xx && to >= xx) { fio << 1; } else { fio << 0; } } fio << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int word[4]; for (int i = 0; i < 4; i++) { cin >> word[i]; } int number = 0; sort(word, word + 4); for (int i = 0; i < 3; i++) { for (int j = i + 1; j < 4; j++) { if (word[i] == word[j]) { number++; i = j - 1; } else { i = j - 1; break; } } } cout << number; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[101], res; int b[101]; int main() { int n, i, k, t; cin >> n >> k; for (i = 0; i < n; i++) { cin >> t; a[t]++; } while (1) { for (i = 1; i <= k; i++) b[i] = 0; t = 0; for (i = 1; i < k; i++) if (a[i] > 0) { a[i]--; b[i + 1]++; t = 1; } res++; for (i = 1; i <= k; i++) a[i] += b[i]; if (!t) break; } cout << res - 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; while (~scanf( %d , &t)) { while (t--) { int n; scanf( %d , &n); char a[n + 1]; scanf( %s , a); int ans = 0; for (int i = 0; i < n; i++) { if (a[i] == > || a[n - i - 1] == < ) { break; } else { ans++; } } printf( %d n , ans); } } } |
#include <bits/stdc++.h> using namespace std; const int64_t INF = (1 << 30) - 1; const long long oo = (1ll << 62) - 1; const long double PI = 3.1415926535898; const int64_t N = 100000 + 5; int64_t n; vector<int64_t> a[N]; int64_t d[5][N]; int64_t mau[N]; int64_t c[5][5]; int64_t dfs(int64_t u, int64_t p, int64_t col, int64_t vt) { col %= 3; col += 1; int64_t ans = d[c[vt][col]][u]; for (int64_t v : a[u]) { if (v == p) continue; ans += dfs(v, u, col, vt); } return ans; } void dfs2(int64_t u, int64_t p, int64_t col, int64_t vt) { col %= 3; col += 1; mau[u] = c[vt][col]; for (int64_t v : a[u]) { if (v == p) continue; dfs2(v, u, col, vt); } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int64_t i = 1; i <= n; i++) cin >> d[1][i]; for (int64_t i = 1; i <= n; i++) cin >> d[2][i]; for (int64_t i = 1; i <= n; i++) cin >> d[3][i]; for (int64_t i = 1; i < n; i++) { int64_t u, v; cin >> u >> v; a[u].push_back(v); a[v].push_back(u); } for (int64_t i = 1; i <= n; i++) { if (a[i].size() >= 3) { cout << -1; return 0; } } c[1][1] = 1; c[1][2] = 2; c[1][3] = 3; c[2][1] = 1; c[2][2] = 3; c[2][3] = 2; int64_t s = 1; while (a[s].size() == 2) s++; int64_t res = oo, col, vt; for (int64_t i = 1; i <= 2; i++) { for (int64_t j = 1; j <= 3; j++) { int64_t ans = dfs(s, s, j - 1, i); if (ans < res) { res = ans; col = j; vt = i; } } } dfs2(s, s, col - 1, vt); cout << res << n ; for (int64_t i = 1; i <= n; i++) cout << mau[i] << ; } |
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b, long long m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } int binomial(int n, int k) { if (k == 0 || k == n) return 1; return binomial(n - 1, k - 1) + binomial(n - 1, k); } bool prime[10000]; void Sieve(long long int n) { memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } } vector<int> f; int print(int n) { for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i == i) f.push_back(i); else { f.push_back(i); f.push_back(n / i); } } } return f.size(); } pair<int, int> fib(int n) { if (n == 0) return {0, 1}; auto p = fib(n >> 1); int c = p.first * (2 * p.second - p.first); int d = p.first * p.first + p.second * p.second; if (n & 1) return {d, c + d}; else return {c, d}; } int main() { int n; cin >> n; int k = 0; vector<int> v; Sieve(n); for (int i = 2; i <= n; i++) { if (prime[i]) { int q = 1; while (q <= (n / i)) { q *= i; v.push_back(q); } } } cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int n; pair<int, int> a[2][100010]; bool used[100010]; int fat[100010]; int main() { int i, j, c, v; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d %d , &c, &v); a[c][++a[c][0].first] = make_pair(v, i); } sort(a[0] + 1, a[0] + a[0][0].first + 1); sort(a[1] + 1, a[1] + a[1][0].first + 1); i = j = 1; for (int t = 1; t < n; t++) { int tmp = min(a[0][i].first, a[1][j].first); printf( %d %d %d n , a[0][i].second, a[1][j].second, tmp); a[0][i].first -= tmp, a[1][j].first -= tmp; if (a[0][i].first) j++; else if (a[1][j].first) i++; else if (i < a[0][0].first) i++; else j++; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; long long modexp(long long a, long long n) { if (a == 0) return 0; if (n == 0) return 1; long long p = modexp(a, n / 2); p = p * p % MOD; if (n & 1) p = p * a % MOD; return p; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n, m, l, r; cin >> n >> m >> l >> r; long long k = r + 1 - l; long long e = n * m % (MOD - 1); long long ans = modexp((k % MOD + MOD) % MOD, e); if (n % 2 == 0 || m % 2 == 0) { long long k0 = 0, k1 = 0; if (l % 2 == 0 && r % 2 == 0) ++k0; if (l % 2 == 1 && r % 2 == 1) ++k1; ans = (ans + modexp((k0 + MOD - k1) % MOD, e)) % MOD; ans = (ans * modexp(2, MOD - 2)) % MOD; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << ; cout << endl; } template <class T> void chmin(T &t, T f) { if (t > f) t = f; } template <class T> void chmax(T &t, T f) { if (t < f) t = f; } int in() { int x; scanf( %d , &x); return x; } const int R = 3; const int S = R * R / 2; int uf[4000010]; int root(int x) { return (uf[x] < 0) ? x : (uf[x] = root(uf[x])); } bool conn(int x, int y) { x = root(x); y = root(y); if (x == y) return 0; if (uf[x] > uf[y]) swap(x, y); uf[x] += uf[y]; uf[y] = x; return 1; } int N; inline int _(int x, int y) { return x * N + y; } int A[2010][2010]; int B[2010][2010]; int C[2010][2010]; vector<pair<int, int> > ps[4000010]; int main() { int x, y; int r; for (; ~scanf( %d , &N);) { for (x = 0; x < N; ++x) for (y = 0; y < N; ++y) { A[x][y] = in(); } for (x = 0; x < N; ++x) for (y = 0; y < N; ++y) { B[x + 1][y + 1] = B[x + 1][y] + B[x][y + 1] - B[x][y] + A[x][y]; } for (x = 0; x + R <= N; ++x) for (y = 0; y + R <= N; ++y) { C[x][y] = B[x + R][y + R] - B[x + R][y] - B[x][y + R] + B[x][y]; } memset(uf, ~0, sizeof(uf)); for (x = 0; x + R <= N; ++x) for (y = 0; y + R <= N; ++y) if (C[x][y] > S) { if (x) if (C[x - 1][y] > S) conn(_(x - 1, y), _(x, y)); if (y) if (C[x][y - 1] > S) conn(_(x, y - 1), _(x, y)); } for (r = 0; r < N * N; ++r) { ps[r].clear(); } for (x = 0; x + R <= N; ++x) for (y = 0; y + R <= N; ++y) if (C[x][y] > S) { r = root(_(x, y)); ps[r].push_back(make_pair(x, y)); } int ansC = 0, ansS = 0; for (r = 0; r < N * N; ++r) if (!ps[r].empty()) { int sz = ps[r].size(), i, j; if (sz < 30) continue; double ox = 0, oy = 0; for (i = 0; i < sz; ++i) { x = ps[r][i].first; y = ps[r][i].second; ox += x; oy += y; } ox /= sz; oy /= sz; double rads[10] = {}; for (i = 0; i < sz; ++i) { x = ps[r][i].first; y = ps[r][i].second; double tmp = (x - ox) * (x - ox) + (y - oy) * (y - oy); for (j = 0; j < 10; ++j) { if (rads[j] < tmp) { swap(rads[j], tmp); } } } double rad = rads[0]; double ratio = sz / rad; (ratio > 2.7) ? ++ansC : ++ansS; } printf( %d %d n , ansC, ansS); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 30005; const int Maxk = 205; const int Inf = 1000000000; int n, k; int a[Maxn]; int dp[Maxn][Maxk][2]; int res = -Inf; int Add(int val, int sgn) { return sgn == 0 ? -val : val; } int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i <= n; i++) for (int j = 0; j <= k; j++) dp[i][j][0] = dp[i][j][1] = -Inf; for (int i = n - 1; i >= 0; i--) { for (int l = 0; l < 2; l++) { int sum = 0; for (int z = i; z < n; z++) { sum += Add(a[z], l); dp[i][1][l] = max(dp[i][1][l], sum); } } for (int j = k; j >= 0; j--) for (int l = 0; l < 2; l++) { dp[i][j][l] = max(dp[i][j][l], dp[i + 1][j][l]); if (j > 0) { dp[i][j][l] = max(dp[i][j][l], dp[i + 1][j - 1][l]); int sum = 0; for (int z = i; z < n; z++) { sum += Add(a[z], l); dp[i][j][l] = max(dp[i][j][l], dp[z + 1][j - 1][1 - l] + 2 * sum); } } } } for (int i = 0; i < n; i++) for (int l = 0; l < 2; l++) { int sum = 0; for (int z = i; z < n; z++) { sum += Add(a[z], l); res = max(res, sum + dp[z + 1][k - 1][1 - l]); } } printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long getint() { long long _x = 0, _tmp = 1; char _tc = getchar(); while ((_tc < 0 || _tc > 9 ) && _tc != - ) _tc = getchar(); if (_tc == - ) _tc = getchar(), _tmp = -1; while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); return _x * _tmp; } inline long long add(long long _x, long long _y, long long _mod = 1000000007ll) { long long _ = _x + _y; if (_ >= _mod) _ -= _mod; return _; } inline long long sub(long long _x, long long _y, long long _mod = 1000000007ll) { long long _ = _x - _y; if (_ < 0) _ += _mod; return _; } inline long long mul(long long _x, long long _y, long long _mod = 1000000007ll) { long long _ = _x * _y; if (_ >= _mod) _ %= _mod; return _; } long long mypow(long long _a, long long _x, long long _mod) { if (_x == 0) return 1ll; long long _tmp = mypow(_a, _x / 2, _mod); _tmp = mul(_tmp, _tmp, _mod); if (_x & 1) _tmp = mul(_tmp, _a, _mod); return _tmp; } long long mymul(long long _a, long long _x, long long _mod) { if (_x == 0) return 0ll; long long _tmp = mymul(_a, _x / 2, _mod); _tmp = add(_tmp, _tmp, _mod); if (_x & 1) _tmp = add(_tmp, _a, _mod); return _tmp; } inline bool equal(double _x, double _y) { return _x > _y - 1e-9 && _x < _y + 1e-9; } int __ = 1, _cs; void build() {} int n, q; void init() { n = getint(); q = getint(); } set<pair<int, int> > S; set<int> v[303030]; void solve() { int cnt = 0; while (q--) { int cmd = getint(); int xi = getint(); if (cmd == 1) { v[xi].insert(++cnt); S.insert({cnt, xi}); } else if (cmd == 2) { for (int ii : v[xi]) S.erase({ii, xi}); v[xi].clear(); } else { while (S.size() && S.begin()->first <= xi) { v[S.begin()->second].erase(S.begin()->first); S.erase(S.begin()); } } printf( %d n , (int)S.size()); } } int main() { build(); while (__--) { init(); solve(); } } |
#include <bits/stdc++.h> using namespace std; char str[50][30]; char p[30]; char t[30]; int n; int solve() { for (int i = 0; i < n; i++) { if (strstr(str[i], t) != NULL) { return 0; } } return 1; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , &str[i]); } p[0] = a - 1; p[1] = 0; int len = 1; for (int i = 1;; i++) { p[0]++; int j = 0; while (p[j] == z + 1) { p[j] = a ; j++; if (p[j] == 0) { p[j] = a ; p[j + 1] = 0; len = j + 1; } else { p[j]++; } } for (int k = 0; k < len; k++) { t[k] = p[len - k - 1]; } t[len] = 0; if (solve() == 1) { break; } } printf( %s n , t); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; int main() { ios_base::sync_with_stdio(0); long long cnt1, cnt2, cnt3, cnt4; cin >> cnt1 >> cnt2 >> cnt3 >> cnt4; cnt3 = (cnt3 != 0 ? 1 : 0); cnt1 -= cnt3; cnt4 -= cnt3; if (cnt1 >= 0 && cnt4 >= 0 && cnt1 == cnt4) { cout << 1; } else cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { long long int res = 1; while (y) { if (y & 1ll) { res *= x; } x *= x; y >>= 1ll; } return res; } int main() { long long int l, r, k; cin >> l >> r >> k; vector<long long int> v; for (long long int i = 0; i <= 64; i++) { long long int pw = power(k, i); if (pw >= l && pw <= r) { v.push_back(pw); } long long int rem = r / pw; if (rem < k || pw > r) { break; } } if (v.size() == 0) { cout << -1 << endl; } else { for (auto i : v) { cout << i << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; ++i) cin >> v[i]; bool notfine = true; for (int i = 0; i < n - 1; ++i) { if (v[i] <= v[i + 1]) { notfine = false; break; } } if (!notfine) cout << YES n ; else cout << NO n ; } return 0; } |
#include <unordered_set> #include <unordered_map> #include <algorithm> #include <iostream> #include <string> #include <vector> #include <stack> #include <queue> #include <deque> #include <cmath> #include <set> #include <map> using namespace std; typedef long long ll; const int Z = (int) 2e3 + 228; const int N = (int) 1e5 + 228; const int INF = (int) 1e9 + 228; const ll LLINF = (ll) 1e18 + 228; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tst; cin >> tst; while (tst--) { string s; cin >> s; int n = s.size(); if (n == 1) { cout << 0 << n ; continue; } if (n == 2) { if (s[0] != s[1]) { cout << 0 << n ; } else { cout << 1 << n ; } continue; } set<char> mn; for (char c = a ; c <= z ; ++c) { mn.insert(c); } int ans = 0; for (int i = 0; i + 2 < n; ++i) { set<char> kek = mn; for (int j = i - 1; j >= max(0, i - 8); --j) { kek.erase(s[j]); } for (int j = i; j < min(n, i + 8); ++j) { kek.erase(s[j]); } if (s[i] == s[i + 1] && s[i + 1] == s[i + 2]) { kek.erase(s[i]); s[i + 1] = *kek.begin(); s[i + 2] = *++kek.begin(); ans += 2; } else if (s[i] == s[i + 1]) { s[i + 1] = *kek.begin(); ++ans; } else if (s[i + 1] == s[i + 2]) { s[i + 2] = *kek.begin(); ++ans; } else if (s[i] == s[i + 2]) { s[i + 2] = *kek.begin(); ++ans; } } cout << ans << n ; } return 0; } /* 1 hthtqqqqmnmnososeaeaaa */ |
#include <bits/stdc++.h> using namespace std; long long ans[2]; int z[100], zn; int main() { int n; scanf( %d , &n); int m, x; for (int i = 1; i <= n; i++) { scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %d , &x); if (m % 2 && i == m / 2) { z[zn++] = x; continue; } if (i < m / 2) ans[1] += x; if (i >= m / 2) ans[0] += x; } } sort(z, z + zn); bool gamer = 1; while (--zn >= 0) { ans[gamer] += z[zn]; gamer ^= 1; } printf( %I64d %I64d , ans[1], ans[0]); return 0; } |
#include <bits/stdc++.h> using namespace std; bool pr(int x) { bool p = 0; if (x % 2 == 0) p = (x == 2); else { long long d = 3; while (d * d <= x && x % d != 0) { d += 2; } if (d * d > x) p = (x != 1); } return p; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); bool fl; int n, m; cin >> n >> m; fl = pr(m); for (int i = n + 1; i < m; ++i) { if (pr(i)) { fl = 0; } } if (fl) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> const int N = 1005; int size[N], to[N << 1], edge, Next[N << 1], last[N], G, siz, cnt, w[N << 1], n, x, y, tag[N]; void add(int x, int y) { to[++edge] = y; Next[edge] = last[x]; last[x] = edge; } void dfs(int x, int fa) { size[x] = 1; int mx = 0; for (int i = last[x]; i; i = Next[i]) { int u = to[i]; if (u == fa) continue; dfs(u, x); size[x] += size[u]; mx = std::max(mx, size[u]); } mx = std::max(mx, n - size[x]); if (mx <= n / 2) G = x; } void dfs2(int x, int fa) { size[x] = 1; for (int i = last[x]; i; i = Next[i]) if (to[i] != fa) dfs2(to[i], x), size[x] += size[to[i]]; } void dfs3(int x, int fa, int t, int lstdis) { for (int i = last[x]; i; i = Next[i]) { int u = to[i]; if (u == fa) continue; ++cnt; w[i] = cnt * t - lstdis; dfs3(u, x, t, lstdis + w[i]); } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); add(x, y), add(y, x); } dfs(1, 0); dfs2(G, 0); siz = 0, cnt = 0; for (int i = last[G]; i; i = Next[i]) if (siz < n / 3 && siz + size[to[i]] <= 2 * n / 3) { tag[to[i]] = 1; siz += size[to[i]]; } for (int i = last[G]; i; i = Next[i]) if (tag[to[i]]) w[i] = ++cnt, dfs3(to[i], G, 1, cnt); cnt = 0; for (int i = last[G]; i; i = Next[i]) if (!tag[to[i]]) ++cnt, w[i] = cnt * (siz + 1), dfs3(to[i], G, siz + 1, cnt * (siz + 1)); for (int i = 1; i <= edge; i += 2) printf( %d %d %d n , to[i], to[i + 1], w[i] | w[i + 1]); } |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long int q; cin >> q; vector<unsigned long long int> V; for (unsigned long long int i = 2; i * i <= q; i++) while (q % i == 0) { V.push_back(i); q /= i; } if (q != 1) V.push_back(q); if (V.size() <= 1) { cout << 1 << endl; cout << 0 ; return (0); } if (V.size() == 2) { cout << 2 ; return (0); } cout << 1 << endl; cout << V[0] * V[1]; return (0); } |
#include <bits/stdc++.h> using namespace std; template <typename elemType> inline void Read(elemType &T) { elemType X = 0, w = 0; char ch = 0; while (!isdigit(ch)) { w |= ch == - ; ch = getchar(); } while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar(); T = (w ? -X : X); } long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); } const int maxn = 100010; const long long MOD = 1000000007LL; struct Graph { struct edge { int Next, to; }; edge G[maxn << 1]; int head[maxn]; int cnt; Graph() : cnt(2) {} void clear(int node_num = 0) { cnt = 2; if (node_num == 0) memset(head, 0, sizeof(head)); else fill(head, head + node_num + 5, 0); } void add_edge(int u, int v) { G[cnt].to = v; G[cnt].Next = head[u]; head[u] = cnt++; } }; Graph G; long long Value[maxn]; map<long long, long long> Hash[maxn]; long long Ans = 0; int N; void DFS(int u, int fa) { ++Hash[u][Value[u]]; for (auto it : Hash[u]) Ans = (Ans + it.first * it.second % MOD) % MOD; for (int i = G.head[u]; i; i = G.G[i].Next) { int v = G.G[i].to; if (v == fa) continue; for (auto it : Hash[u]) { long long x = GCD(Value[v], it.first); Hash[v][x] += it.second; } DFS(v, u); } return; } int main() { Read(N); for (register int i = 1; i <= N; ++i) Read(Value[i]); for (register int i = 1; i <= N - 1; ++i) { int u, v; Read(u); Read(v); G.add_edge(u, v); G.add_edge(v, u); } DFS(1, 0); printf( %I64d n , Ans); return 0; } |
#include <bits/stdc++.h> inline long long read() { char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); long long k = 1, kk = 0; if (c == - ) c = getchar(), k = -1; while (c >= 0 && c <= 9 ) kk = kk * 10 + c - 0 , c = getchar(); return kk * k; } using namespace std; void write(long long x) { if (x < 0) putchar( - ), x = -x; if (x / 10) write(x / 10); putchar(x % 10 + 0 ); } void writeln(long long x) { write(x); puts( ); } long long n, rd[1000010], ans, sum, z[1000010], d, x, y; signed main() { n = read(); if (n == 2) { puts( Yes ); puts( 1 ); puts( 1 2 ); return 0; } for (long long i = 1; i < n; i++) x = read(), y = read(), rd[x]++, rd[y]++; for (long long i = 1; i <= n; i++) { if (rd[i] > 2) ans++; if (rd[i] == 1) z[++d] = i; if (rd[i] > rd[sum]) sum = i; } if (ans > 1) return puts( No ), 0; puts( Yes ); writeln(d); for (long long i = 1; i <= d; i++) write(z[i]), putchar( ), writeln(sum); } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 320; const int inf = 2147483647; const int mod = 1000000007; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar(); return x * f; } void upd(int &x, int y) { x += y; if (x >= mod) x -= mod; } int n, m, X, f[2][Maxn][Maxn]; int main() { n = read(), m = read(), X = read(); if (n > m) return puts( 0 ), 0; int now = 0; memset(f[now], 0, sizeof(f[now])); f[0][0][0] = 1; for (int i = 0; i < m; i++) { now ^= 1; for (int j = 0; j <= min(i, n) + 1; j++) for (int k = 0; k <= min(i, n) + 1; k++) f[now][j][k] = 0; for (int j = 0; j <= min(i, n); j++) for (int k = 0; k <= min(i, n); k++) if (f[now ^ 1][j][k]) { int t = f[now ^ 1][j][k]; if (i + 1 == X) { upd(f[now][j + 1][k], t); upd(f[now][j + 1][k + 1], t); } else { upd(f[now][j][k], t); upd(f[now][j + 1][k], t); if (j > k) upd(f[now][j][k + 1], t); upd(f[now][j + 1][k + 1], t); } } } int ans = f[now][n][n]; for (int i = 1; i <= n; i++) ans = (long long)ans * i % mod; printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; const int M = 1000005; const int P = 1e9 + 9; int Hash[2][M]; int base[M]; int getHash(int *h, int L, int R) { return (h[R] - 1LL * h[L - 1] * base[R - L + 1] % P + P) % P; } char A[M], B[M], C[M]; int main() { int n; cin >> n; n--; scanf( %s%s , A + 1, C + 1); for (int i = 1; i <= n; ++i) B[i] = C[n - i + 1]; for (int i = 1; i <= n; ++i) { char k = B[i]; if (k == N ) B[i] = S ; if (k == S ) B[i] = N ; if (k == W ) B[i] = E ; if (k == E ) B[i] = W ; } base[0] = 1; for (int i = 1; i <= n; ++i) base[i] = 1LL * base[i - 1] * 233 % P; for (int i = 1; i <= n; ++i) { Hash[0][i] = (1LL * Hash[0][i - 1] * 233 % P + A[i]) % P; Hash[1][i] = (1LL * Hash[1][i - 1] * 233 % P + B[i]) % P; } for (int i = 1; i <= n; ++i) { if (getHash(Hash[0], n - i + 1, n) == getHash(Hash[1], 1, i)) { puts( NO ); return 0; } } puts( YES ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); } f *= fu; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x < 10) putchar(x + 48); else print(x / 10), putchar(x % 10 + 48); } template <typename T> void print(T x, char t) { print(x); putchar(t); } template <typename T> struct hash_map_t { vector<T> v, val, nxt; vector<int> head; int mod, tot, lastv; T lastans; bool have_ans; hash_map_t(int md = 0) { head.clear(); v.clear(); val.clear(); nxt.clear(); tot = 0; mod = md; nxt.resize(1); v.resize(1); val.resize(1); head.resize(mod); have_ans = 0; } void clear() { *this = hash_map_t(mod); } bool count(int x) { int u = x % mod; for (register int i = head[u]; i; i = nxt[i]) { if (v[i] == x) { have_ans = 1; lastv = x; lastans = val[i]; return 1; } } return 0; } void ins(int x, int y) { int u = x % mod; nxt.push_back(head[u]); head[u] = ++tot; v.push_back(x); val.push_back(y); } int qry(int x) { if (have_ans && lastv == x) return lastans; count(x); return lastans; } }; const int N = 2505; int s[N][N], mx[N], mn[N]; char c[N][N]; int n, m, k; long long ans; inline int calc(int x, int y, int _x, int _y) { if (x > _x || y > _y) return 0; return s[_x][_y] - s[_x][y - 1] - s[x - 1][_y] + s[x - 1][y - 1]; } void solve(int x, int y, int _x, int _y) { if (x == _x || y == _y) return; if (_x - x == 1 && _y - y == 1) { if (calc(x + 1, y + 1, _x, _y) == k) ++ans; return; } if (_x - x >= _y - y) { int mid = (x + _x) >> 1; solve(x, y, mid, _y); solve(mid, y, _x, _y); for (register int i = y + 1; i <= _y; i++) { mn[0] = mx[0] = mid; for (register int j = 1; j <= k + 1; j++) mn[j] = x, mx[j] = _x; for (register int j = i; j <= _y; j++) { for (register int t = 1; t <= k + 1; t++) { while (calc(mn[t] + 1, i, mid, j) >= t) ++mn[t]; while (calc(mid + 1, i, mx[t], j) >= t) --mx[t]; } for (register int t = 0; t <= k; t++) { ans += (mn[t] - mn[t + 1]) * (mx[k - t + 1] - mx[k - t]); } } } } else { int mid = (y + _y) >> 1; solve(x, y, _x, mid); solve(x, mid, _x, _y); for (register int i = x + 1; i <= _x; i++) { mn[0] = mx[0] = mid; for (register int j = 1; j <= k + 1; j++) mn[j] = y, mx[j] = _y; for (register int j = i; j <= _x; j++) { for (register int t = 1; t <= k + 1; t++) { while (calc(i, mn[t] + 1, j, mid) >= t) ++mn[t]; while (calc(i, mid + 1, j, mx[t]) >= t) --mx[t]; } for (register int t = 0; t <= k; t++) { ans += (mn[t] - mn[t + 1]) * (mx[k - t + 1] - mx[k - t]); } } } } } int main() { read(n); read(m); read(k); for (register int i = 1; i <= n; i++) { scanf( %s , c[i] + 1); for (register int j = 1; j <= m; j++) { s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + c[i][j] - 0 ; } } solve(0, 0, n, m); print(ans, n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void main0(); int main() { clock_t start, end; ios::sync_with_stdio(false); cin.tie(0); main0(); return 0; } const int dx[8] = {0, 1, -1, 0, 1, 1, -1, -1}; const int dy[8] = {1, 0, 0, -1, 1, -1, -1, 1}; const int N = 2e5 + 5; const int M = 1e5; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3f; const int mod = 998244353; const double eps = 1e-6; mt19937 rnd( (unsigned int)chrono::steady_clock::now().time_since_epoch().count()); template <typename T> bool chkmin(T &x, T y) { return y < x ? x = y, 1 : 0; } template <typename T> bool chkmax(T &x, T y) { return y > x ? x = y, 1 : 0; } int n, k; string s; int lc[N], rc[N]; int ord[N]; int idx[N]; int p = 0; int flag[N]; void dfs1(int u) { if (lc[u]) dfs1(lc[u]); ord[++p] = u; idx[u] = p; if (rc[u]) dfs1(rc[u]); } int rep[N]; int dfs2(int u, int k) { if (k == 0) return 0; int cost = 0; if (lc[u]) cost += dfs2(lc[u], k - 1); if (flag[u] || cost) { rep[u] = 1, cost++; if (rc[u]) cost += dfs2(rc[u], k - cost); } return cost; } void main0() { cin >> n >> k >> s; s = $ + s; for (int i = 1; i <= n; ++i) { cin >> lc[i] >> rc[i]; } dfs1(1); flag[ord[n]] = 0; for (int i = n - 1; i >= 1; --i) { int cur = ord[i]; int nxt = ord[i + 1]; flag[cur] = (s[cur] == s[nxt] ? flag[nxt] : s[cur] < s[nxt]); } dfs2(1, k); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= rep[ord[i]] + 1; ++j) { cout << s[ord[i]]; } } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxx = 2e5 + 20, mod = 1e9 + 7; int main() { int t; cin >> t; while (t--) { string s; int n, sum = 0, ans = 0; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == ( ) sum++; else sum--; if (sum < 0) { while (s[i] == ) ) { ans++; i++; } sum = 1; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int res[2000000]; int main() { ios::sync_with_stdio(false); int n, q; scanf( %d%d , &n, &q); int re = 0, ro = 0; bool sw = 0; for (int i = 0; i < q; ++i) { int t; scanf( %d , &t); if (t == 1) { int x; scanf( %d , &x); re += x; ro += x; if (x % 2 != 0) { sw ^= 1; } } else { if (sw) { --ro; ++re; } else { ++ro; --re; } sw ^= 1; } re = (re % n + n) % n; ro = (ro % n + n) % n; } for (int i = 0; i < n; ++i) { res[(((i + ((i % 2 == 1) ? re : ro)) % n + n) % n)] = i; } for (int i = 0; i < n; ++i) { printf( %d , res[i] + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long t, a, b, ans = 0; int main() { scanf( %lld , &t); while (t--) { scanf( %lld%lld , &a, &b); ans = 0; if (b >= 9) ans++; if (b >= 99) ans++; if (b >= 999) ans++; if (b >= 9999) ans++; if (b >= 99999) ans++; if (b >= 999999) ans++; if (b >= 9999999) ans++; if (b >= 99999999) ans++; if (b >= 999999999) ans++; printf( %lld n , a * ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int s = 0, c = 0; int a[120]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; c += a[i]; } while (1) { s = 0; sort(a, a + n); if (a[n - 1] == a[0]) { break; } for (int j = n - 1; j > 0; j--) { if (a[j] != a[j - 1]) { a[j] = a[j] - a[j - 1]; } else { continue; } } for (int i = 0; i < n; i++) { s += a[i]; } c = s; } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > data; vector<bool> used; vector<int> cycle; void dfs(int vertex, int last, vector<int> &path) { used[vertex] = true; path.push_back(vertex); for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (to == last) continue; if (used[to]) { if (!cycle.size()) { int index = path.size() - 1; while (path[index] != to) { cycle.push_back(path[index--]); } cycle.push_back(path[index]); } continue; } dfs(to, vertex, path); } path.pop_back(); } vector<bool> if_cycle; vector<int> sz, tree_ans, ans, szs; int dfs2(int vertex, int last, int number) { sz[number]++; szs[vertex] = 1; int tut = 1; for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (if_cycle[to] || to == last) continue; tut += dfs2(to, vertex, number); szs[vertex] += szs[to]; } tree_ans[number] += tut; return tut; } int n; void dfs3(int vertex, int last, int number, int cur) { ans[number] = max(ans[number], cur); for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (if_cycle[to] || to == last) continue; dfs3(to, vertex, number, cur + n - 2 * szs[to]); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; data.assign(n, {}); for (int i = 0; i < n; ++i) { int u, v; cin >> u >> v; data[u].push_back(v), data[v].push_back(u); } used.assign(n, false); vector<int> p; dfs(0, -1, p); if_cycle.assign(n, false); for (int i = 0; i < cycle.size(); ++i) { if_cycle[cycle[i]] = true; } int S = cycle.size(); sz.assign(S, 0); tree_ans.assign(S, 0); szs.assign(n, 0); for (int i = 0; i < cycle.size(); ++i) { tree_ans[i] -= dfs2(cycle[i], -1, i); } ans.assign(S, 0); for (int i = 0; i < cycle.size(); ++i) { dfs3(cycle[i], -1, i, tree_ans[i] + n); } int dp[S], dp2[S], sums[S]; for (int i = 0; i < S; ++i) dp[i] = ans[i]; for (int len = 2; len <= S; len++) { sums[0] = 0; for (int i = 0; i < len - 1; ++i) sums[0] += sz[i]; int B = len - 1; for (int i = 1; i < S; ++i) { sums[i] = sums[i - 1] - sz[i - 1] + sz[B++]; if (B == S) B = 0; } int A = len - 1; for (int i = 0; i < S - 1; ++i) { dp2[i] = max(dp[i] + tree_ans[A++] + n - sums[i], tree_ans[i] + dp[i + 1] + n - sums[i + 1]); if (A == S) A = 0; } dp2[S - 1] = max(dp[S - 1] + tree_ans[A], tree_ans[S - 1] + dp[0] + n - sums[0]); for (int i = 0; i < S; ++i) { dp[i] = dp2[i]; } } int A = 0; for (int i = 0; i < S; ++i) A = max(A, dp[i]); cout << A; } |
#include <bits/stdc++.h> using namespace std; long long a[4]; vector<int> order, to; bool cmp(int x, int y) { return a[x] < a[y]; } int main() { cin >> a[1] >> a[2] >> a[3]; order = {1, 2, 3}; sort(order.begin(), order.end(), cmp); to = order; cout << First << endl; for (;;) { long long w = 2 * a[to[2]] - a[to[1]] - a[to[0]]; cout << w << endl; int ps; cin >> ps; if (ps == 0) return 0; a[ps] += w; if (ps == to[0]) { w = a[to[2]] - a[to[1]]; cout << w << endl; cin >> ps; if (ps == 0) return 0; a[ps] += w; } else if (ps == to[1]) { w = a[to[2]] - a[to[0]]; cout << w << endl; cin >> ps; if (ps == 0) return 0; a[ps] += w; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long double pi = 3.14159265359; template <typename T> T abs(T x) { return x > 0 ? x : -x; } template <typename T> T sqr(T x) { return x * x; } template <typename T> void chmin(T &x, T y) { x = min(x, y); } template <typename T> void chmax(T &x, T y) { x = max(x, y); } template <typename U, typename V> ostream &operator<<(ostream &s, const pair<U, V> &x) { s << ( << x.first << , << x.second << ) ; return s; } template <typename U> ostream &operator<<(ostream &s, const vector<U> &x) { s << [ ; bool was = false; for (auto it : x) { if (was) { s << , ; } was = true; s << it; } s << ] ; return s; } const int maxn = 1e5 + 5; const int inf = 1e9; char a[2][maxn]; int d[2][maxn]; int main() { srand(time(NULL)); retry: int n, k; scanf( %d %d n , &n, &k); scanf( %s n , a[0] + 1); scanf( %s n , a[1] + 1); queue<pair<int, int>> q; q.push(make_pair(0, 1)); fill(d[0], d[0] + maxn, inf); fill(d[1], d[1] + maxn, inf); d[0][1] = 0; auto yes = []() { cout << YES << endl; exit(0); }; while (!q.empty()) { int s = q.front().first; int v = q.front().second; q.pop(); if (v + k > n) { yes(); } if (a[s][v + 1] == - && d[s][v + 1] == inf) { d[s][v + 1] = d[s][v] + 1; q.push(make_pair(s, v + 1)); } if (v - 1 > 0 && a[s][v - 1] == - && v - 1 > d[s][v] + 1 && d[s][v - 1] == inf) { d[s][v - 1] = d[s][v] + 1; q.push(make_pair(s, v - 1)); } if (a[1 - s][v + k] == - && d[1 - s][v + k] == inf) { d[1 - s][v + k] = d[s][v] + 1; q.push(make_pair(1 - s, v + k)); } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int MOVX[2] = {0, 1}; const int MOVY[2] = {1, 0}; int n, m; string fore[501]; vector<pair<int, int> > dep[1001]; int pid[501][501]; long long tbl[2][501][501]; inline bool valid(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } void bfs() { int d[n][m]; memset(d, -1, sizeof d); d[0][0] = 0; queue<pair<int, int> > que; que.push({0, 0}); dep[0].push_back({0, 0}); pid[0][0] = 0; while (!que.empty()) { pair<int, int> p = que.front(); que.pop(); for (int i = 0; i < 2; ++i) { int x = p.first + MOVX[i]; int y = p.second + MOVY[i]; if (valid(x, y) && d[x][y] == -1) { d[x][y] = d[p.first][p.second] + 1; pid[x][y] = dep[d[x][y]].size(); dep[d[x][y]].push_back({x, y}); que.push({x, y}); } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n >> m; for (int i = 0; i < n; ++i) cin >> fore[i]; bfs(); int id = 0; int len = n + m - 2; int h = len >> 1; for (int i = 0; i < (int)dep[h].size(); ++i) for (int j = 0; j < (int)dep[len - h].size(); ++j) tbl[id][i][j] = tbl[!id][i][j] = 0; for (const pair<int, int> &p : dep[h]) { if (len & 1) { for (int i = 0; i < 2; ++i) { int x = p.first + MOVX[i]; int y = p.second + MOVY[i]; if (valid(x, y) && fore[p.first][p.second] == fore[x][y]) tbl[id][pid[p.first][p.second]][pid[x][y]] = 1; } } else { tbl[id][pid[p.first][p.second]][pid[p.first][p.second]] = 1; } } while (h > 0) { for (const pair<int, int> &p1 : dep[h]) for (const pair<int, int> &p2 : dep[len - h]) { long long &r = tbl[id][pid[p1.first][p1.second]][pid[p2.first][p2.second]]; if (r) { for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) { int x1 = p1.first - MOVX[i]; int y1 = p1.second - MOVY[i]; int x2 = p2.first + MOVX[j]; int y2 = p2.second + MOVY[j]; if (valid(x1, y1) && valid(x2, y2) && fore[x1][y1] == fore[x2][y2]) { long long &q = tbl[!id][pid[x1][y1]][pid[x2][y2]]; q = (q + r) % MOD; } } } } for (int i = 0; i < (int)dep[h].size(); ++i) for (int j = 0; j < (int)dep[len - h - 1].size(); ++j) tbl[id][i][j] = 0; id = !id; --h; } cout << tbl[id][0][0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void update(long long &x, long long y) { x += y; } struct Point { long long x, y; Point() {} Point(long long a, long long b) : x(a), y(b) {} Point operator-(Point b) { return Point(x - b.x, y - b.y); } bool operator<(const Point &b) const { return (x != b.x) ? x < b.x : y < b.y; } }; inline long long cross(Point x, Point y) { return x.x * y.y - x.y * y.x; } Point p[305]; int id1[305][305], id2[305][305], cur; inline bool cmp(int x, int y) { return cross(p[x] - p[cur], p[y] - p[cur]) > 0; } void pre(int n) { sort(p + 1, p + n + 1); for (int i = 1; i <= n; i++) { cur = i; for (int j = 1; j < i; j++) id1[i][++id1[i][0]] = j; for (int j = i + 1; j <= n; j++) id2[i][++id2[i][0]] = j; sort(id1[i] + 1, id1[i] + id1[i][0] + 1, cmp); sort(id2[i] + 1, id2[i] + id2[i][0] + 1, cmp); } } long long f[305][305][5], g[305][305][5]; long long dp(int n, int s) { memset(f, 0, sizeof(f)); memset(g, 0, sizeof(g)); for (int i = s + 1; i <= n; i++) f[i][s][1] = g[i][s][1] = 1; long long ans = 0; for (int i = s + 1; i <= n; i++) { long long s1[5], s2[5]; memset(s1, 0, sizeof(s1)); memset(s2, 0, sizeof(s2)); for (int j = s; j < i; j++) for (int k = 1; k < 5; k++) { update(s1[k], f[i][j][k]); update(s2[k], g[i][j][k]); } for (int j = 1; j < 5; j++) update(ans, s1[j] * s2[5 - j]); memset(s1, 0, sizeof(s1)); memset(s2, 0, sizeof(s2)); int r = 1; for (int j = 1; j <= id2[i][0]; j++) { int x = id2[i][j]; while (r <= id1[i][0] && cross(p[x] - p[i], p[id1[i][r]] - p[i]) > 0) { int u = id1[i][r++]; for (int k = 1; k < 4; k++) update(s1[k], f[i][u][k]); } for (int k = 1; k < 4; k++) update(f[x][i][k + 1], s1[k]); } r = id1[i][0]; for (int j = id2[i][0]; j > 0; j--) { int x = id2[i][j]; while (r && cross(p[x] - p[i], p[id1[i][r]] - p[i]) < 0) { int u = id1[i][r--]; for (int k = 1; k < 4; k++) update(s2[k], g[i][u][k]); } for (int k = 1; k < 4; k++) update(g[x][i][k + 1], s2[k]); } } return ans; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { int x, y; scanf( %d%d , &x, &y); p[i] = Point(x, y); } pre(n); long long ans = 0; for (int i = 1; i <= n; i++) update(ans, dp(n, i)); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, q, a[200010], b[200010], pos[200010], lst[200010]; int f[200010][30], G[200010][30], L[200010]; int amax(int a, int b) { return a > b ? a : b; } int main() { int i, j, cnt, poss, t, l, r; scanf( %d%d%d , &n, &m, &q); for (i = 1; i <= n; i++) { scanf( %d , &a[i]); pos[a[i]] = i; } for (i = 1; i <= m; i++) { scanf( %d , &b[i]); t = a[pos[b[i]] - 1]; if (!t) t = a[n]; f[i][0] = lst[t]; lst[b[i]] = i; } for (i = 1; 1 << i <= n; i++) { for (j = 1; j <= m; j++) { f[j][i] = f[f[j][i - 1]][i - 1]; } } for (i = 1; i <= m; i++) { poss = i; cnt = n - 1; for (j = 20; j >= 0; j--) { if (cnt - (1 << j) >= 0) { cnt -= 1 << j; poss = f[poss][j]; } } G[i][0] = poss; } for (j = 1; (1 << j) <= m; j++) { for (i = 1; i + (1 << j) - 1 <= m; i++) { G[i][j] = amax(G[i][j - 1], G[i + (1 << (j - 1))][j - 1]); } } L[0] = -1; for (i = 1; i <= m; i++) L[i] = L[i >> 1] + 1; for (i = 1; i <= q; i++) { scanf( %d%d , &l, &r); cnt = L[r - l + 1]; if (amax(G[l][cnt], G[r - (1 << cnt) + 1][cnt]) >= l) printf( 1 ); else printf( 0 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int k; cin >> k; string s; cin >> s; unordered_map<char, int> ourmap, ourmap1; int flag = 0; for (int i = 0; i < k; i++) { if (s[i] == 1 || s[i] == 4 || s[i] == 6 || s[i] == 8 || s[i] == 9 ) { flag = s[i] - 0 ; break; } else { ourmap[s[i]]++; if (ourmap[s[i]] == 1) ourmap1[s[i]] = i + 1; } } if (flag != 0) { cout << 1 n ; cout << flag << n ; continue; } cout << 2 n ; if (ourmap.count( 2 ) > 0 && ourmap[ 2 ] > 1) { cout << 22 n ; } else if (ourmap.count( 3 ) > 0 && ourmap[ 3 ] > 1) { cout << 33 n ; } else if (ourmap.count( 5 ) > 0 && ourmap[ 5 ] > 1) { cout << 55 n ; } else if (ourmap.count( 7 ) > 0 && ourmap[ 7 ] > 1) { cout << 77 n ; } else if (ourmap.count( 5 ) > 0 && ourmap.count( 2 ) > 0) { if (ourmap1[ 5 ] < ourmap1[ 2 ]) cout << 52 n ; else cout << 25 n ; } else if (ourmap.count( 5 ) > 0 && ourmap.count( 7 ) > 0) { if (ourmap1[ 5 ] < ourmap1[ 7 ]) cout << 57 n ; else cout << 75 n ; } else if (ourmap.count( 2 ) > 0 && ourmap.count( 7 ) > 0) { if (ourmap1[ 2 ] < ourmap1[ 7 ]) cout << 27 n ; else cout << 72 n ; } else if (ourmap.count( 5 ) > 0 && ourmap.count( 3 ) > 0 && ourmap1[ 3 ] < ourmap1[ 5 ]) { cout << 35 n ; } else { cout << 32 n ; } } } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000 * 1000 * 1000; vector<int> g[100100]; int deg[100100]; bool vis[100100]; void dfs(int v) { vis[v] = true; for (int to : g[v]) if (!vis[to]) { dfs(to); } } int main() { int N, M; scanf( %d%d , &N, &M); for (int i = 0; i < (M); ++i) { int u, v; scanf( %d%d , &u, &v); --u; --v; g[u].push_back(v); g[v].push_back(u); ++deg[u]; ++deg[v]; } int q = 0; for (int i = 0; i < (N); ++i) if (!vis[i]) { dfs(i); ++q; } if (q > 1) { puts( unknown topology ); return 0; } sort(deg, deg + N); if (deg[0] == 1 && deg[1] == 1) { bool check = true; for (int i = 2; i < N; ++i) if (deg[i] != 2) { check = false; break; } if (check) { puts( bus topology ); return 0; } } bool check = true; for (int i = 0; i < (N); ++i) if (deg[i] != 2) { check = false; break; } if (check) { puts( ring topology ); return 0; } check = true; if (deg[N - 1] == N - 1) { for (int i = 0; i < (N - 1); ++i) if (deg[i] != 1) { check = false; break; } if (check) { puts( star topology ); return 0; } } puts( unknown topology ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; cin >> a >> b >> c; long long x = a + b + c; long long y = 2 * (a + b); x = min(x, 2 * (a + c)); x = min(x, 2 * (b + c)); cout << min(x, y) << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; long long n, q, op, root = 1; long long a[maxn]; long long head[maxn], to[maxn << 1], nxt[maxn << 1], cnt; inline void add(long long u, long long v) { nxt[++cnt] = head[u]; to[cnt] = v; head[u] = cnt; } namespace Tree_chain_partition { long long fa[maxn], son[maxn], size[maxn], dep[maxn], top[maxn]; void dfs1(long long u, long long f) { size[u] = 1; fa[u] = f; dep[u] = dep[f] + 1; for (register long long i = head[u]; i; i = nxt[i]) { long long v = to[i]; if (v == f) continue; dfs1(v, u); size[u] += size[v]; if (size[v] > size[son[u]]) son[u] = v; } } long long id[maxn], w[maxn], tot; void dfs2(long long u, long long topf) { id[u] = ++tot; w[tot] = a[u]; top[u] = topf; if (!son[u]) return; dfs2(son[u], topf); for (register long long i = head[u]; i; i = nxt[i]) { long long v = to[i]; if (v == son[u] || v == fa[u]) continue; dfs2(v, v); } } inline long long lca(long long x, long long y) { while (top[x] != top[y]) { if (dep[top[x]] < dep[top[y]]) swap(x, y); x = fa[top[x]]; } return dep[x] < dep[y] ? x : y; } long long find(long long x, long long y) { while (top[x] != top[y]) { if (dep[top[x]] < dep[top[y]]) swap(x, y); if (fa[top[x]] == y) return top[x]; x = fa[top[x]]; } return dep[x] < dep[y] ? son[x] : son[y]; } inline long long LCA(long long x, long long y) { if (dep[x] > dep[y]) swap(x, y); if (lca(x, y) == x) { if (id[y] <= id[root] && id[root] <= id[y] + size[y] - 1) { return y; } if (lca(x, root) == x) return lca(root, y); return x; } if (id[root] >= id[x] && id[root] <= id[x] + size[x] - 1) return x; if (id[root] >= id[y] && id[root] <= id[y] + size[y] - 1) return y; if ((lca(x, root) == root && lca(x, y) == lca(root, y)) || (lca(y, root) == root && lca(x, y) == lca(root, x))) { return root; } if (lca(x, root) == lca(y, root)) return lca(x, y); if (lca(x, y) != lca(x, root)) return lca(x, root); if (lca(x, y) != lca(y, root)) return lca(y, root); } } // namespace Tree_chain_partition using namespace Tree_chain_partition; namespace SegmentTree { struct SegmentTree { long long v, tag; } st[maxn << 2]; inline void push_up(long long rt) { st[rt].v = st[rt << 1].v + st[rt << 1 | 1].v; } void build(long long rt, long long l, long long r) { st[rt].tag = 0; if (l == r) { st[rt].v = w[l]; return; } long long mid = (l + r) >> 1; build(rt << 1, l, mid); build(rt << 1 | 1, mid + 1, r); push_up(rt); } inline void push_down(long long rt, long long l, long long r) { long long mid = (l + r) >> 1; st[rt << 1].v += st[rt].tag * (mid - l + 1); st[rt << 1 | 1].v += st[rt].tag * (r - mid); st[rt << 1].tag += st[rt].tag; st[rt << 1 | 1].tag += st[rt].tag; st[rt].tag = 0; } void modify(long long rt, long long l, long long r, long long ql, long long qr, long long val) { if (ql > r || qr < l) return; if (ql <= l && qr >= r) { st[rt].v += (r - l + 1) * val; st[rt].tag += val; return; } push_down(rt, l, r); long long mid = (l + r) >> 1; modify(rt << 1, l, mid, ql, qr, val); modify(rt << 1 | 1, mid + 1, r, ql, qr, val); push_up(rt); } long long query(long long rt, long long l, long long r, long long ql, long long qr) { if (ql > r || qr < l) return 0; if (ql <= l && qr >= r) return st[rt].v; push_down(rt, l, r); long long mid = (l + r) >> 1; return query(rt << 1, l, mid, ql, qr) + query(rt << 1 | 1, mid + 1, r, ql, qr); } void update(long long pos, long long val) { if (root == pos) { modify(1, 1, n, 1, n, val); return; } long long tmp = lca(root, pos); if (tmp != pos) { modify(1, 1, n, id[pos], id[pos] + size[pos] - 1, val); } else { long long loc = find(root, pos); modify(1, 1, n, 1, n, val); modify(1, 1, n, id[loc], id[loc] + size[loc] - 1, -val); } } long long ask(long long pos) { if (pos == root) return query(1, 1, n, 1, n); long long tmp = lca(pos, root); if (tmp != pos) { return query(1, 1, n, id[pos], id[pos] + size[pos] - 1); } long long loc = find(root, pos); return query(1, 1, n, 1, n) - query(1, 1, n, id[loc], id[loc] + size[loc] - 1); } } // namespace SegmentTree using namespace SegmentTree; template <typename T> inline void read(T &x) { x = 0; T f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + (ch ^ 48); ch = getchar(); } x *= f; } signed main() { read(n); read(q); for (register long long i = 1; i <= n; i++) { read(a[i]); } for (register long long i = 1, u, v; i < n; i++) { read(u), read(v); add(u, v); add(v, u); } dfs1(1, 0); dfs2(1, 1); build(1, 1, n); while (q--) { read(op); if (op == 1) read(root); if (op == 2) { long long x, y, val; read(x), read(y), read(val); update(LCA(x, y), val); } if (op == 3) { long long x; read(x); printf( %lld n , ask(x)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long q = 1; while (q--) { long long n, k; cin >> n >> k; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; long long sum = 0, ans; for (long long i = 0; i < k; i++) sum += a[i]; ans = sum; long long ind = 1; long long j = k; while (j < n) { sum -= a[j - k]; sum += a[j]; if (sum < ans) { ans = sum; ind = j - k + 2; } j++; } cout << ind << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline bool read(T &ret) { char c; int sgn; if (c = getchar(), c == EOF) return false; while (c != - && (c < 0 || c > 9 )) c = getchar(); sgn = (c == - ) ? -1 : 1; ret = (c == - ) ? 0 : (c - 0 ); while (c = getchar(), c >= 0 && c <= 9 ) ret = ret * 10 + (c - 0 ); ret *= sgn; return true; } inline long long qmul(long long, long long, long long); inline long long qpow_qmul(long long, long long, long long); inline long long qpow(long long, long long, long long); inline long long gcd(long long, long long); const int N = 1e5 + 10; const long long INF = -0x3f3f3f3f; const long long mod = 1e9 + 7; const double PI = acos(-1.0); int boy[N], girl[N]; int main() { int n, m, num, idx, cnt, cnt1; memset(boy, 0, sizeof(boy)); memset(girl, 0, sizeof(girl)); scanf( %d%d , &n, &m); scanf( %d , &num); cnt = num; for (int i = 0; i < num; i++) scanf( %d , &idx), boy[idx] = 1; scanf( %d , &num); cnt1 = num; for (int i = 0; i < num; i++) scanf( %d , &idx), girl[idx] = 1; int x, y; for (int i = 0; i < n * m * max(n, m); i++) { x = i % n; y = i % m; if (boy[x] || girl[y]) { if (!boy[x]) cnt++; if (!girl[y]) cnt1++; boy[x] = 1; girl[y] = 1; } if (cnt == n && cnt1 == m) break; } if (cnt == n && cnt1 == m) { printf( Yes n ); } else { printf( No n ); } return 0; } inline long long qmul(long long a, long long b, long long mod) { long long ans = 0, x = a; while (b) { if (b & 1) { ans += x % mod; ans %= mod; } x *= 2; x %= mod; b >>= 1; } return ans % mod; } inline long long qpow_qmul(long long x, long long n, long long mod) { long long ans = 1, a = x % mod; while (n) { if (n & 1) { ans = qmul(ans, a, mod); ans %= mod; } a = qmul(a, a, mod); a %= mod; n >>= 1; } return ans; } inline long long qpow(long long x, long long n, long long mod) { long long ans = 1, a = x % mod; while (n) { if (n & 1) { ans *= a % mod; ans %= mod; } a *= a % mod; a %= mod; n >>= 1; } return ans; } inline long long gcd(long long m, long long n) { return n == 0 ? m : gcd(n, m % n); } |
#include <bits/stdc++.h> using namespace std; const int N = 4005; int n, a[N], sum[N], f[50000005]; int h(int l, int r, int k, int now) { return ((((l * 4000) + r) * 100 + k) * 2 + now) % 50000000; } int dfs(int l, int r, int k, int now) { if (r - l + 1 < k) return 0; if (r - l + 1 == k) { if (now == 0) return sum[r] - sum[l - 1]; else return sum[l - 1] - sum[r]; } if (f[h(l, r, k, now)] != -0x3f3f3f3f) { return f[h(l, r, k, now)]; } if (now == 0) { int count = dfs(l + k, r, k, 1) + sum[l + k - 1] - sum[l - 1]; if (l + k <= r) count = max(count, dfs(l + k + 1, r, k + 1, 1) + (sum[l + k] - sum[l - 1])); f[h(l, r, k, now)] = count; return count; } else if (now == 1) { int count = dfs(l, r - k, k, 0) - (sum[r] - sum[r - k]); if (l + k <= r) count = min(count, dfs(l, r - k - 1, k + 1, 0) - (sum[r] - sum[r - k - 1])); f[h(l, r, k, now)] = count; return count; } } signed main() { cin >> n; for (register int i = 1; i <= n; i++) cin >> a[i]; for (register int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; for (register int i = 1; i <= 50000000; i++) f[i] = -0x3f3f3f3f; cout << dfs(1, n, 1, 0); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a, b; vector<int> arr; vector<vector<int> > dp; void solve1(string x, int a, int b) { int n = x.length(); int l = n + 1; int r = -1; for (int i = 0; i < n; i++) { if (x[i] == 1 ) { l = min(l, i); r = max(r, i); } } if (l > r) { cout << 0 << endl; return; } int ans = a; int curr = 0; for (int i = l; i <= r; i++) { if (x[i] == 0 ) curr++; else { ans += min(a, curr * b); curr = 0; } } cout << ans << endl; } int solve(int idx, int prev, int sz) { if (idx == sz) { return prev == 1; } else if (idx > sz) { return 0; } if (dp[idx][prev] != -1) return dp[idx][prev]; int ans = INT_MAX; ans = min(ans, solve(idx + 1, 0, sz) + 2 * a); ans = min(ans, solve(idx + 2, 1, sz) + ((arr[idx] * b) + a) - (idx > 0 ? a * (1 - prev) : 0)); return dp[idx][prev] = ans; } void testcase(int tc) { cin >> a >> b; string x; cin >> x; solve1(x, a, b); return; n = x.length(); arr.clear(); int l = n + 1, r = -1; for (int i = 0; i < n; i++) { if (x[i] == 1 ) { l = i; break; } } for (int i = n - 1; i >= 0; i--) { if (x[i] == 1 ) { r = i; break; } } if (l > r || l == n + 1 || r == -1) { cout << 0 << endl; return; } int curr = 0; for (int i = l; i <= r; i++) { if (x[i] == 0 ) curr++; else { if (curr > 0) { arr.push_back(curr); } curr = 0; } } int sz = arr.size(); if (sz == 0) { cout << a << endl; return; } else { dp.clear(); dp.resize(sz + 9, vector<int>(4, -1)); cout << solve(0, 0, sz) << endl; return; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int T; cin >> T; for (int i = 1; i <= T; i++) { testcase(i); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a, b; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a >> b; if (a > b) { cout << b * (b + 1) / 2 << endl; } else { cout << a * (a - 1) / 2 + 1 << endl; } } } |
#include<bits/stdc++.h> using namespace std; #define ll long long #define mod (ll)1e9+7; #define test ll t;cin>>t;while(t--) #define endl n #define pb push_back #define vi vector<int> #define vvi vector<vi> #define vl vector<ll> #define vvl vector<vl> #define vp vector<pair<int,int>> #define pf push_front #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define scanint(x) int x;cin>>x; #define scanll(x) ll x;cin>>x; #define scanstr(str) string str;cin>>str; #define scanchr(chr) char chr;cin>>chr; #define all(c) (c).begin(), (c).end() #define vecread(vec) for(auto &x:vec){cin>>x;} #define calcTime cerr << time taken : << (float)clock() / CLOCKS_PER_SEC << secs << endl #define debug(a) cout<<a<<endl; #define debug2(a,b) cout<<a<< <<b<<endl; #define debug3(a,b,c) cout<<a<< <<b<< <<c<<endl; #define joker(V) for(auto X:V)cout<<X<< ;cout<<endl; #define papiya(Mp) for(auto X:Mp)cout<<X.first<< <<X.second<<endl; void solve(){ scanint(n) vi arr(n); vecread(arr); sort(all(arr)); vvl dp(n, vl(n)); for (size_t g = 0; g < n; g++) { for(int i = 0, j = g; j < n; i++, j++){ if(g == 0){ dp[i][j] = 0; } else if(g == 1){ dp[i][j] = abs(arr[i] - arr[j]); } else { dp[i][j] = arr[j] - arr[i] + min(dp[i + 1][j], dp[i][j - 1]); } } } cout << dp[0][n - 1] << endl; } int main() { fast #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); #endif // test // { solve(); // } calcTime; return 0; } |
#include <bits/stdc++.h> using namespace std; long long const INF = (long long)1e9; long long const INF64 = (long long)4e18; long long const v10e5 = (long long)100000; long long const v10e6 = (long long)1000000; long long const v10e9 = (long long)1000000000; long long const s10e5 = (long long)100000 + 10; long long const s10e6 = (long long)1000000 + 10; long long const s10e9 = (long long)1000000000 + 10; long long __dummy__; int main() { ios_base::sync_with_stdio(0); long long n, k; cin >> n >> k; vector<long long> a(n + 1, 1); a[n] = 0; long long max_ = 1; for (long long(i) = (1); (i) <= (k); ++i) { for (long long(i) = (1); (i) <= (n); ++i) { if ((n - i) - a[i] >= max_) { cout << n - max_ << ; a[i] += max_; } else { cout << i + a[i] << ; a[i] = n - i; } } cout << endl; max_ = a[1]; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { char c; int ret = 0, sgn = 1; do { c = getchar(); } while ((c < 0 || c > 9 ) && c != - ); if (c == - ) sgn = -1; else ret = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) ret = ret * 10 + (c - 0 ); return sgn * ret; } map<int, int> mp; set<int> s; int cnt, t, n, arr[120000 + 5], m, store[50]; inline long long fast_pow(int index) { if (store[index]) return store[index]; long long base = 2, ans = 1, t = index; while (index) { if (index & 1) ans *= base; base *= base; index /= 2; } return store[t] = ans; } int main(void) { n = read(); for (int i = 1; i <= n; i++) { arr[i] = t = read(); mp[t]++; } sort(arr + 1, arr + 1 + n); m = unique(arr + 1, arr + 1 + n) - arr - 1; for (int i = 1; i <= m; i++) { if (s.find(arr[i]) != s.end()) continue; bool flag = true; for (int index = 0, k = 0; k <= arr[m]; index++) { k = fast_pow(index) - arr[i]; if (mp.find(k) != mp.end() && (k != arr[i] || mp[k] >= 2)) { flag = false; s.insert(arr[i]); s.insert(k); break; } } if (flag) { cnt += mp[arr[i]]; mp.erase(arr[i]); } } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using u128 = __uint128_t; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { long long n; cin >> n; vector<long long> ans(n, 0); cout << ? << 1 << << n << endl; long long tot; cin >> tot; for (long long i = 2; i < n; i++) { cout << ? << i << << n << endl; long long q; cin >> q; ans[i - 2] = tot - q; tot = q; } cout << ? << n - 2 << << n - 1 << endl; long long q; cin >> q; ans[n - 2] = q - ans[n - 3]; ans[n - 1] = tot - ans[n - 2]; cout << ! ; for (long long i : ans) cout << i << ; exit(0); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 10100, M = 1001000, oo = 1000000000; int i, j, k, n, m, ch, Pn, Tn, En, x, y, fx, fy, rt, nm; int h[N * 2], p[N * 2], g[N * 2], tmp[N * 2]; struct edge { int s, n; } E[N * 4]; struct edge2 { int s, n, v; }; struct tree { int l, r; } T[N * 4]; struct point { int fa, sz, dp, sn, tp, fv; } P[N * 2]; int min(const int &x, const int &y) { if (x < y) return x; return y; } struct network { int i, j, k, S, T, En, ans; int z[N * 5], c[N * 5], d[N * 5], h[N * 5]; edge2 E[M]; void add(int x, int y, int v) { E[++En].s = y; E[En].v = v; E[En].n = h[x]; h[x] = En; E[++En].s = x; E[En].v = 0; E[En].n = h[y]; h[y] = En; } bool bfs() { for (i = 1; i <= T; i++) c[i] = 0; c[S] = 1; d[1] = S; i = 0; j = 1; while (i < j) { i++; for (k = h[d[i]]; k; k = E[k].n) if (E[k].v && !c[E[k].s]) { c[E[k].s] = c[d[i]] + 1; d[++j] = E[k].s; if (E[k].s == T) return 1; } } return c[T]; } void bfs2() { z[S] = 1; d[1] = S; i = 0; j = 1; while (i < j) { i++; for (k = h[d[i]]; k; k = E[k].n) if (E[k].v && !z[E[k].s]) { z[E[k].s] = 1; d[++j] = E[k].s; } } } int dfs(int x, int y) { if (x == T || !y) return y; int k, t, Y = y; for (k = h[x]; k; k = E[k].n) if (E[k].v && c[x] + 1 == c[E[k].s]) { t = dfs(E[k].s, min(y, E[k].v)); y -= t; E[k].v -= t; E[k ^ 1].v += t; if (!y) return Y; } if (y == Y) c[x] = -1; return Y - y; } int work() { ans = 0; while (bfs()) ans += dfs(S, oo); bfs2(); return ans; } } Net; void R(int &x) { x = 0; ch = getchar(); while (ch < 0 || 9 < ch) ch = getchar(); while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); } void dfs1(int x, int F) { P[x].sz = 1; P[x].dp = P[F].dp + 1; P[x].fa = F; for (int k = h[x]; k; k = E[k].n) if (E[k].s != F) { tmp[E[k].s] = (k + 1) / 2; dfs1(E[k].s, x); P[x].sz += P[E[k].s].sz; if (P[E[k].s].sz > P[P[x].sn].sz) P[x].sn = E[k].s; } } void dfs2(int x, int F, int tp) { P[x].fv = ++Pn; p[Pn] = x; P[x].tp = tp; if (P[x].sn) dfs2(P[x].sn, x, tp); for (int k = h[x]; k; k = E[k].n) if (E[k].s != F && E[k].s != P[x].sn) dfs2(E[k].s, x, E[k].s); } void T_build(int L, int R, int &k) { k = ++Tn; if (L == R) { Net.add(m + k, Net.T, 1); g[p[L]] = m + k; return; } int mid = (L + R) >> 1; T_build(L, mid, T[k].l); T_build(mid + 1, R, T[k].r); Net.add(m + k, m + T[k].l, oo); Net.add(m + k, m + T[k].r, oo); } void T_add(int L, int R, int l, int r, int x, int k) { if (L == l && R == r) { Net.add(x, m + k, oo); return; } int mid = (L + R) >> 1; if (r <= mid) T_add(L, mid, l, r, x, T[k].l); else { if (l > mid) T_add(mid + 1, R, l, r, x, T[k].r); else T_add(L, mid, l, mid, x, T[k].l), T_add(mid + 1, R, mid + 1, r, x, T[k].r); } } void E_add(int x, int y) { E[++En].s = y; E[En].n = h[x]; h[x] = En; E[++En].s = x; E[En].n = h[y]; h[y] = En; } int main() { R(n); R(m); Net.En = 1; Net.S = m + 2 * n; Net.T = Net.S + 1; for (i = 1; i < n; i++) { R(x); R(y); E_add(x, y); } dfs1(1, 0); dfs2(1, 0, 1); T_build(1, n, rt); for (i = 1; i <= m; i++) { Net.add(Net.S, i, 1); R(x); R(y); fx = P[x].tp; fy = P[y].tp; while (fx != fy) { if (P[fx].dp > P[fy].dp) { T_add(1, n, P[fx].fv, P[x].fv, i, rt); x = P[fx].fa; fx = P[x].tp; } else { T_add(1, n, P[fy].fv, P[y].fv, i, rt); y = P[fy].fa; fy = P[y].tp; } } if (x != y) { if (P[x].dp < P[y].dp) T_add(1, n, P[x].fv + 1, P[y].fv, i, rt); else T_add(1, n, P[y].fv + 1, P[x].fv, i, rt); } } printf( %d n , Net.work()); nm = 0; for (i = 1; i <= m; i++) if (!Net.z[i]) nm++; printf( %d , nm); for (i = 1; i <= m; i++) if (!Net.z[i]) printf( %d , i); puts( ); nm = 0; for (i = 2; i <= n; i++) if (Net.z[g[i]]) nm++; printf( %d , nm); for (i = 2; i <= n; i++) if (Net.z[g[i]]) printf( %d , tmp[i]); puts( ); } |
#include <bits/stdc++.h> using namespace std; const int N = 3 * 1e5 + 5; int main() { int t; cin >> t; double a[1005], b[1005]; for (int i = 1; i <= t; ++i) { int d; cin >> d; if (d < 4 && d > 0) { a[i] = -1; b[i] = -1; continue; } double discr = sqrt((d * d - 4 * d) * 1.0); a[i] = (d + discr) / 2; b[i] = (d - discr) / 2; } for (int i = 1; i <= t; ++i) { if (a[i] == -1) cout << N n ; else { cout << Y ; printf( %.9f %.9f n , a[i], b[i]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 6100, EMAX = 13000, VMAX = 6100; struct Edge { int x; int y; int next; }; int N, R[NMAX], ans; short f[NMAX][NMAX], g[NMAX][NMAX]; int V[VMAX], eid; Edge E[EMAX]; void insert(int x, int y) { E[++eid] = (Edge){x, y, V[x]}; V[x] = eid; } int calc(int x, int y) { int i, j, res = max(f[x][0], g[y][0]); for (i = 1, j = g[y][0]; i <= f[x][0]; i += 1) { while (j && R[f[x][i]] >= R[g[y][j]]) j -= 1; res = max(res, i + j); } return res; } void DFS(int pre, int x) { int i, j, y, l, r, m; f[x][0] = g[x][0] = 1; f[x][1] = g[x][1] = x; for (i = V[x]; i; i = E[i].next) { if ((y = E[i].y) == pre) continue; DFS(x, y); ans = max(ans, calc(x, y)); ans = max(ans, calc(y, x)); if (R[x] <= R[f[y][1]]) f[y][1] = x; else if (R[f[y][f[y][0]]] < R[x]) f[y][++f[y][0]] = x; else { for (l = 1, r = f[y][0]; l + 1 < r;) { m = (l + r) >> 1; if (R[f[y][m]] < R[x]) l = m; else r = m; } f[y][r] = x; } if (R[x] >= R[g[y][1]]) g[y][1] = x; else if (R[g[y][g[y][0]]] > R[x]) g[y][++g[y][0]] = x; else { for (l = 1, r = g[y][0]; l + 1 < r;) { m = (l + r) >> 1; if (R[g[y][m]] > R[x]) l = m; else r = m; } g[y][r] = x; } f[x][0] = max(f[x][0], f[y][0]); g[x][0] = max(g[x][0], g[y][0]); for (j = 1; j <= f[y][0]; j += 1) { f[x][j] = f[x][j] && R[f[x][j]] < R[f[y][j]] ? f[x][j] : f[y][j]; } for (j = 1; j <= g[y][0]; j += 1) { g[x][j] = g[x][j] && R[g[x][j]] > R[g[y][j]] ? g[x][j] : g[y][j]; } } } int main() { int i, x, y; scanf( %d , &N); for (i = 1; i <= N; i += 1) scanf( %d , &R[i]); for (i = 1; i < N; i += 1) { scanf( %d %d , &x, &y); insert(x, y); insert(y, x); } DFS(-1, 1); printf( %d n , ans); exit(0); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i; int a[3007]; while (~scanf( %d , &n)) { for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); for (i = 0; i < n; i++) if (a[i] != i + 1) break; printf( %d n , i + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; stringstream ss; long long p[1000010], h1[1000010], h2[1000010]; int main() { p[0] = 1; for (int i = 1; i < 1000010; i++) h1[i] = p[i] = p[i - 1] * 127LL; int n, m, a, b; cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> a >> b; h1[a] += p[b]; h2[a] += p[b]; h1[b] += p[a]; h2[b] += p[a]; } sort(h1 + 1, h1 + 1 + n); sort(h2 + 1, h2 + 1 + n); long long res = 0; for (int i = 1; i <= n; i++) { long long cnt = 1; while (i + 1 <= n && h1[i] == h1[i + 1]) cnt++, i++; res += (cnt) * (cnt - 1) / 2LL; } for (int i = 1; i <= n; i++) { long long cnt = 1; while (i + 1 <= n && h2[i] == h2[i + 1]) cnt++, i++; res += (cnt) * (cnt - 1) / 2LL; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int i = 0; while (a <= b) { a *= 3; b *= 2; i++; } cout << i; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 123; char res[maxn][maxn]; int a[maxn]; int n; int sumx, maxy, miny, nowy; int main() { scanf( %d , &n); sumx = maxy = miny = nowy = 0; int flag = 1; for (int i = 0; i < n; ++i) { scanf( %d , a + i); sumx += a[i]; nowy += flag * a[i]; flag = -flag; if (nowy > maxy) maxy = nowy; if (nowy < miny) miny = nowy; } for (int i = 0; i < maxy - miny; ++i) for (int j = 0; j < sumx; ++j) res[i][j] = ; int py = maxy - 1, px = 0; flag = 1; for (int i = 0; i < n; ++i) { for (int j = 0; j < a[i]; ++j) { if (flag == 1) res[py][px] = / ; else res[py][px] = ; px++; if (j != a[i] - 1) py -= flag; } flag = -flag; } for (int i = 0; i < maxy - miny; ++i, puts( )) for (int j = 0; j < sumx; ++j) putchar(res[i][j]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, N = 1010, P = 1e9 + 7; template <class T> inline bool chkmin(T &A, T B) { return B < A ? A = B, 1 : 0; } template <class T> inline bool chkmax(T &A, T B) { return A < B ? A = B, 1 : 0; } template <class T, class _> inline void Add(T &first, _ second) { first += second; if (first >= P) first -= P; if (first < 0) first += P; } int n, K; long long C[N][N], Fac[N], dp[N][N]; int main() { int cas; Fac[0] = 1; for (int i = (1), i_end = (N - 10); i <= i_end; ++i) Fac[i] = Fac[i - 1] * i % P; for (int i = (0), i_end = (N - 10); i <= i_end; ++i) { C[i][0] = 1; for (int j = (1), j_end = (i); j <= j_end; ++j) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % P; } dp[0][0] = 1; for (int i = (1), i_end = (N - 10); i <= i_end; ++i) for (int j = (1), j_end = (i); j <= j_end; ++j) dp[i][j] = (dp[i - j][j] + dp[i - j][j - 1]) % P; scanf( %d , &cas); while (cas--) { long long ans = 0; scanf( %d%d , &n, &K); for (int i = (K * (K + 1) / 2), i_end = (n); i <= i_end; ++i) Add(ans, dp[i][K] * C[n - i + K][K] % P); printf( %lld n , ans * Fac[K] % P); } return 0; } |
#include <bits/stdc++.h> using namespace std; int binarySearch(long long int arr[], long long int l, long long int r, long long int x) { if (r >= l) { long long int mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; } int main() { ios_base::sync_with_stdio(false); long long int t; cin >> t; while (t--) { long long int n, x; cin >> n >> x; long long int a[n]; for (long long int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long int ans = 0; if (binarySearch(a, 0, n - 1, x) != -1) { ans = 1; } else { if (x % a[n - 1] == 0) { ans = x / a[n - 1]; } else { if (x / a[n - 1] == 0) { ans++; } ans += x / a[n - 1] + 1; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; double u, v, w, x, y, l = 1e9, r = 0; cin >> n >> w >> v >> u; while (n--) { cin >> x >> y; l = min(l, x - y / u * v); r = max(r, x - y / u * v); } cout << fixed << setprecision(6) << w / u + r / v * (l < 0); return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long n, k, cnt = 0, flag = 0; cin >> n >> k; if (n > k * (k - 1)) { cout << NO ; return 0; } cout << YES n ; for (long long i = 1; i <= k; i++) { for (long long j = i + 1; j <= k; j++) { cout << i << << j << n ; cnt++; if (cnt >= n) { flag = 1; break; } cout << j << << i << n ; cnt++; if (cnt >= n) { flag = 1; break; } } if (flag) break; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> m >> n; cout << (m * n) / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; #define int long long //#define int unsigned int //#define pb push_back //#define mp make_pair #define mod 1000000007 #define double long double #define all(x) x.begin(), x.end() #define debug(x) cout << #x << = << x << n const int inf=1e18; const int maxu=200005; //int d; //vector <int> adj[maxu]; //vector <int> vis(maxu); //vector <vector <int>> v(maxu); /*int fun(int a,int b){ if(b==0)return 1; else if(a==1)return 1; int temp=fun(a,b/2)%mod; temp=(temp*temp)%mod; if(b%2==1)temp=(temp*a)%mod; return temp%mod; } int inv(int a,int b){ return (a*fun(b,mod-2))%mod; } void dfs(int s){ if(vis[s])return; vis[s]=1; for(auto u:adj[s]){ dfs(u); } }*/ signed main() { /* #ifndef ONLINE_JUDGE freopen( inputhsr.txt , r , stdin); freopen( outputhsr.txt , w , stdout); #endif */ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int i,j,k=0,n,t=1,m,l=0; //cin>>t; while(t--){ cin>>n; int a[n+1]; for(i=1;i<=n;i++)cin>>a[i]; vector <vector<int>> v; for(i=1;i<=n;i++){ for(j=i+1;j<=n;j++){ int val=abs(a[j]-a[i]); if(a[i]<a[j]){ vector <int> v1={val,j,i}; v.push_back(v1); } else{ vector <int> v1={val,i,j}; v.push_back(v1); } } } sort(all(v)); reverse(all(v)); int ans=false; for(auto u:v){ cout<< ? <<u[1]<< <<u[2]<<endl; string s; cin>>s; if(s== Yes ){ cout<< ! <<u[1]<< <<u[2]<<endl; ans=true;break; } } if(!ans){ cout<< ! <<0<< <<0<<endl; } /* for(i=0;i<=n;i++)vis[i]=0; for(i=0;i<=n;i++){ adj[i].clear(); } */ /*string s; cin>>s; n=s.length();*/ //memset(a,0,sizeof(a)); //cout<<fixed<<setprecision(10)<<ans<< n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long ccw(pair<int, int> a, pair<int, int> b, pair<int, int> c) { int dx1 = b.first - a.first; int dy1 = b.second - a.second; int dx2 = c.first - a.first; int dy2 = c.second - a.second; return 1ll * dx1 * dy2 - 1ll * dy1 * dx2; } long long dist(pair<int, int> a, pair<int, int> b) { int dx = b.first - a.first; int dy = b.second - a.second; return 1ll * dx * dx + 1ll * dy * dy; } pair<int, int> a[5005]; int n; vector<pair<int, int> > hull; long long mxarea = 0; int r1, r2, r3; void solve() { for (int i = 0; i + 2 < hull.size(); i++) { int p2 = i + 1, p3 = i + 2; while (p2 + 1 < hull.size()) { p3 = max(p3, p2 + 1); while (p3 + 1 < hull.size() && ccw(hull[i], hull[p2], hull[p3]) < ccw(hull[i], hull[p2], hull[p3 + 1])) { p3++; } if (mxarea < ccw(hull[i], hull[p2], hull[p3])) { mxarea = ccw(hull[i], hull[p2], hull[p3]); tie(r1, r2, r3) = make_tuple(i, p2, p3); } p2++; } } int x1 = hull[r1].first + hull[r2].first - hull[r3].first; int x2 = hull[r2].first + hull[r3].first - hull[r1].first; int x3 = hull[r3].first + hull[r1].first - hull[r2].first; int y1 = hull[r1].second + hull[r2].second - hull[r3].second; int y2 = hull[r2].second + hull[r3].second - hull[r1].second; int y3 = hull[r3].second + hull[r1].second - hull[r2].second; printf( %d %d n%d %d n%d %d , x1, y1, x2, y2, x3, y3); } int main() { long long x; cin >> n >> x; for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } swap(a[0], *min_element(a, a + n)); sort(a + 1, a + n, [&](const pair<int, int> &aa, const pair<int, int> &bb) { long long t = ccw(a[0], aa, bb); if (t != 0) return t > 0; return dist(a[0], aa) < dist(a[0], bb); }); for (int i = 0; i < n; i++) { while (hull.size() >= 2 && ccw(hull[hull.size() - 2], hull.back(), a[i]) <= 0) { hull.pop_back(); } hull.push_back(a[i]); } solve(); } |
#include <bits/stdc++.h> using namespace std; int n, a[100005]; int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { printf( ? %d %d n , i, n); fflush(stdout); scanf( %d , &a[i]); } for (int i = 1; i < n - 1; i++) a[i] -= a[i + 1]; printf( ? %d %d n , n - 2, n - 1); fflush(stdout); int v; scanf( %d , &v); v -= a[n - 2]; a[n] = a[n - 1] - v; a[n - 1] = v; printf( ! ); for (int i = 1; i <= n; i++) printf( %d , a[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int const nmax = 100000; int const domain = 1000000; struct Person { int x; int v; bool operator<(Person other) const { return (x < other.x); } }; int n, nl, nr; int s; Person pl[1 + nmax], pr[1 + nmax]; bitset<1 + domain> okl, okr; double timetodest(int distp, int vp, int distray) { double timep = 1.0L * distp / vp; double timehit = 1.0L * (distray - distp) / (s - vp); if (timep <= timehit) return timep; else { double disthit = distp - timehit * vp; return timehit + (disthit / (vp + s)); } } void checktime(double target, Person *p, int np, bitset<1 + domain> *ok) { for (int i = 1; i <= np; i++) { if (p[i].x <= p[i].v * target) { for (int j = 1; j < domain; j++) (*ok)[j] = 1; return; } } int i = 1; for (int j = 1; j < domain; j++) { bool flag = false; while (flag == false && i <= np && p[i].x <= j) { if (timetodest(p[i].x, p[i].v, j) <= target) flag = true; else i++; } (*ok)[j] = flag; } } int main() { cin >> n >> s; for (int i = 0; i < n; i++) { int x, v, dir; cin >> x >> v >> dir; if (dir == 1) { nl++; pl[nl] = {x, v}; } else { nr++; pr[nr] = {domain - x, v}; } } sort(pl + 1, pl + nl + 1); sort(pr + 1, pr + nr + 1); double t1 = 0, t2 = domain, tmid; double deltat = 1; double stop = 0.0000000001L; while (stop < deltat) { tmid = (t1 + t2) / 2; deltat = (tmid - t1) / 2; checktime(tmid, pl, nl, &okl); checktime(tmid, pr, nr, &okr); int flag = 0, j = 1; while (flag == 0 && j < domain) { if (okl[j] == 1 && okr[domain - j] == 1) flag = 1; j++; } if (flag == 1) t2 = tmid; else t1 = tmid; } cout << fixed << setprecision(12) << tmid << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, a[N], maxi[4 * N]; pair<int, int> p[N]; vector<int> v[3]; bool cmp(pair<int, int> p1, pair<int, int> p2) { if (p1.first == p2.first) return p1.second > p2.second; else return p1.first < p2.first; } void merge(int at) { maxi[at] = max(maxi[2 * at], maxi[2 * at + 1]); } void build(int at, int L, int R) { if (L == R) { maxi[at] = 0; return; } int mid = (L + R) / 2; build(2 * at, L, mid); build(2 * at + 1, mid + 1, R); merge(at); } void update(int at, int L, int R, int pos, int val) { if (L == R) { maxi[at] = val; return; } int mid = (L + R) / 2; if (pos <= mid) update(2 * at, L, mid, pos, val); else update(2 * at + 1, mid + 1, R, pos, val); merge(at); } int query(int at, int L, int R, int l, int r) { if (r < L || l > R) return 0; if (l <= L && r >= R) return maxi[at]; int mid = (L + R) / 2; int x = query(2 * at, L, mid, l, r); int y = query(2 * at + 1, mid + 1, R, l, r); return max(x, y); } int main() { int n, n1, n2, n3, q, x; scanf( %d %d %d , &n1, &n2, &n3); ; n = n1 + n2 + n3; for (int j = 0; j < n1; j++) { scanf( %d , &x); v[0].push_back(x); } for (int j = 0; j < n2; j++) { scanf( %d , &x); v[1].push_back(x); } for (int j = 0; j < n3; j++) { scanf( %d , &x); v[2].push_back(x); } for (int i = 0; i < 3; i++) sort(v[i].begin(), v[i].end()); int cnt = 0; for (int i = 0; i < 3; i++) { for (int u : v[i]) { p[cnt] = make_pair(u, cnt); cnt++; } } sort(p, p + n, cmp); build(1, 0, n - 1); int maxi = 0; for (int i = 0; i < n; i++) { int tmp = query(1, 0, n - 1, 0, p[i].second - 1); maxi = max(maxi, tmp + 1); update(1, 0, n - 1, p[i].second, tmp + 1); } printf( %d n , n - maxi); } |
#include <bits/stdc++.h> using namespace std; const long double EPS = 1e-9, PI = acos(-1.); const int INF = 0x3f3f3f3f, MOD = 1e9 + 7; const int N = 1e5 + 5; int n, x, v; long long sm; int main() { scanf( %d%d , &n, &x); for (int i = 0; i < n; ++i) scanf( %d , &v), sm += v; printf( %s n , sm + n - 1 == x ? YES : NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x[100], n, a, b, i, dem = 0; scanf( %d , &n); for (i = 0; i < n - 1; i++) scanf( %d , &x[i]); scanf( %d , &a); scanf( %d , &b); for (i = a - 1; i != b - 1; i++) dem = dem + x[i]; printf( %d , dem); return 0; } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 500 + 10; int data[SIZE]; map<int, int> all_nums; int n; bool used[SIZE * SIZE]; int gcd(int a, int b) { if (a % b == 0) return b; return gcd(b, a % b); } void make_data() { srand(time(0)); int n = 5; int data[SIZE]; for (int i = 0; i < n; i++) data[i] = (rand() % (10)); FILE* output = fopen( input.txt , w ); fprintf(output, %d n , n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) fprintf(output, %d , gcd(data[i], data[j])); fclose(output); } int main() { cin >> n; int val; for (int i = 0; i < n * n; i++) { cin >> val; all_nums[val]++; } auto iter = all_nums.rbegin(); data[n - 1] = iter->first; iter->second--; int curtop = n - 1; for (int i = 0; i < n - 1; i++) { while (all_nums.rbegin()->second == 0) { all_nums.erase(all_nums.find(all_nums.rbegin()->first)); } data[curtop - 1] = all_nums.rbegin()->first; all_nums.rbegin()->second--; for (int k = curtop; k < n; k++) all_nums[gcd(data[curtop - 1], data[k])] -= 2; curtop--; } for (int i = 0; i < n; i++) cout << data[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1}; const int N = 1e6 + 10; const int mod = 1e9 + 7; const double pi = acos(-1); const double eps = 1e-8; const long long INF = 2e10; template <class T> void _print(T arg) { cout << arg << ; } template <class... Args> void log(Args... args) { int arr[] = {(_print(args), 0)...}; cout << endl; } long long a[N], b[N]; int n, m, k; int main() { ios::sync_with_stdio(0); cin >> n >> k; for (int i = 0; i <= n; ++i) { cin >> a[i]; b[i] = a[i]; } for (int i = 0; i < n; ++i) { a[i + 1] += a[i] / 2; a[i] %= 2; } int pos; for (int i = 0; i <= n; ++i) { if (a[i]) { pos = i; break; } } int res = 0; long long tmp = 0; for (int i = n; i >= 0; --i) { tmp = tmp * 2 + a[i]; if (abs(tmp) > INF) break; if (i <= pos) { long long x = abs(tmp - b[i]); if (i == n & x == 0) continue; res += (x <= k); } } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename X> ostream& operator<<(ostream& x, const vector<X>& v) { for (long long i = 0; i < v.size(); ++i) x << v[i] << ; return x; } template <typename X> ostream& operator<<(ostream& x, const set<X>& v) { for (auto it : v) x << it << ; return x; } template <typename X, typename Y> ostream& operator<<(ostream& x, const pair<X, Y>& v) { x << v.ff << << v.ss; return x; } template <typename T, typename S> ostream& operator<<(ostream& os, const unordered_map<T, S>& v) { for (auto it : v) os << it.first << => << it.second << endl; return os; } struct pair_hash { inline std::size_t operator()( const std::pair<long long, long long>& v) const { return v.first * 31 + v.second; } }; #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC targett( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) const int N = 100005; ; int dis[N]; vector<pair<int, int>> dp[N]; bool vis[N]; int dpp[N]; int pth; int n; int xx; int f(int i, int j) { if (i == n - 1) { return 0; } if (dis[i] + j != pth) { return -1000000007; } if (dpp[i] != -1) { return dpp[i]; } dpp[i] = 0; for (pair<int, int> k : dp[i]) { dpp[i] = max(dpp[i], k.second + f(k.first, j + 1)); } return dpp[i]; } set<pair<pair<int, int>, int>> ans; void recover(int i, int j) { if (i == n - 1) { return; } int mx = -1; int vr = -1; int ff; for (pair<int, int> k : dp[i]) { if (mx <= f(k.first, j + 1) + k.second) { mx = f(k.first, j + 1) + k.second; vr = k.first; ff = k.second ^ 1; } } if (ff == 1) ans.insert({{min(i, vr), max(i, vr)}, ff}); else ans.erase({{min(i, vr), max(i, vr)}, ff}); recover(vr, j + 1); } int main() { int m; cin >> n >> m; int on = 0; pair<pair<int, int>, int> ed[m]; for (long long i = 0; i < m; i++) { int x, y, z; cin >> x >> y >> z; --x; --y; ed[i] = {{x, y}, z}; on += z; dp[x].push_back({y, z}); dp[y].push_back({x, z}); } queue<pair<int, int>> q; q.push({n - 1, 0}); vis[n - 1] = true; while (q.size()) { int dd = q.front().second; int curr = q.front().first; q.pop(); dis[curr] = dd; for (pair<int, int> i : dp[curr]) { if (!vis[i.first]) { vis[i.first] = true; q.push({i.first, dd + 1}); } } } pth = dis[0]; memset(dpp, -1, sizeof dpp); int xxp = f(0, 0); cout << on + pth - 2 * dpp[0] << endl; for (long long i = 0; i < m; i++) { if (ed[i].second == 1) { ans.insert({{min(ed[i].first.first, ed[i].first.second), max(ed[i].first.first, ed[i].first.second)}, ed[i].second ^ 1}); } } recover(0, 0); for (auto it = ans.begin(); it != ans.end(); ++it) { cout << (*it).first.first + 1 << << (*it).first.second + 1 << << (*it).second << endl; } } |
#include <bits/stdc++.h> using namespace std; long long int d[200060], cost[200060]; long long int m, tank; vector<pair<int, int>> temp; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int src; cin >> src >> tank >> m; d[0] = 0; cost[0] = 0; d[m + 1] = src; cost[m + 1] = 0; for (int i = 0; i < m; i++) { pair<int, int> t; cin >> t.first >> t.second; temp.push_back(t); } sort(temp.begin(), temp.end()); for (int i = 0; i < m; i++) { d[i + 1] = temp[i].first; cost[i + 1] = temp[i].second; } int current = 0; long long int fuel = tank; int toAdd = 1; auto srt = [](int i, int j) { pair<int, int> a = make_pair(cost[i], d[i]); pair<int, int> b = make_pair(cost[j], d[j]); return a < b; }; multiset<int, function<bool(int, int)>> stations(srt); long long int ans = 0; while (true) { while (!stations.empty() && d[*stations.begin()] < d[current]) { stations.erase(stations.begin()); } while (toAdd <= m + 1 && (d[current] + tank) >= d[toAdd]) { stations.insert(toAdd); toAdd++; } auto it = stations.begin(); if (it == stations.end()) { cout << -1; return 0; } int minPricy = *it; if (cost[minPricy] >= cost[current]) { long long int fuelNeeded = d[minPricy] - d[current]; ans += max(0ll, (tank - fuel) * cost[current]); fuel = tank - fuelNeeded; current = minPricy; stations.erase(it); } else { int check = current + 1; while (cost[current] <= cost[check]) { check++; } int minPricy = check; long long int fuelNeeded = d[minPricy] - d[current]; ans += max(0ll, (fuelNeeded - fuel) * cost[current]); fuel = max(fuel - fuelNeeded, 0ll); current = minPricy; } if (current == m + 1) break; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int solveA(vector<int> a, vector<int> b) { int n = (int)((a).size()); vector<int> m(n); for (int i = (0); i <= ((n)-1); i++) m[b[i]] = i; for (int i = (0); i <= ((n)-1); i++) a[i] = m[a[i]]; b[0] = a[0]; for (int i = (1); i <= ((n - 1)); i++) b[i] = max(b[i - 1], a[i]); int res = 0; for (int i = (0); i <= ((n)-1); i++) res += (a[i] != b[i]); return res; } int solveB(vector<int> a, vector<int> b) { int res = 0, n = (int)((a).size()); vector<int> used(n + 1, false); while (a.size() || b.size()) { if (a.size() && b.size() && a.back() == b.back()) b.pop_back(), a.pop_back(); else if (b.size() && used[b.back()]) b.pop_back(); else if (a.size() && a.back() != b.back()) { used[a.back()] = true; a.pop_back(); res++; } } return res; } int solve(vector<int> a, vector<int> b) { int n = (int)((a).size()); vector<int> m(n); for (int i = (0); i <= ((n)-1); i++) m[b[i]] = i; for (int i = (0); i <= ((n)-1); i++) a[i] = m[a[i]]; for (int i = (0); i <= ((n - 1) - 1); i++) if (a[i] > a[i + 1]) { return n - 1 - i; } return 0; } int main() { int n = 100; scanf( %d , &n); vector<int> a(n), b(n); for (int i = (0); i <= ((n)-1); i++) scanf( %d , &a[i]), a[i]--; for (int i = (0); i <= ((n)-1); i++) scanf( %d , &b[i]), b[i]--; cout << solve(a, b) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 10, inf = 1e18; struct SegTree { long long l[N << 2], r[N << 2]; long long mn[N << 2], tag[N << 2]; inline void push_up(long long i) { mn[i] = min(mn[i << 1], mn[i << 1 | 1]); } inline void push_down(long long i) { mn[i << 1] += tag[i]; mn[i << 1 | 1] += tag[i]; tag[i << 1] += tag[i]; tag[i << 1 | 1] += tag[i]; tag[i] = 0; } void build(long long i, long long x, long long y) { l[i] = x; r[i] = y; if (x == y) return; build(i << 1, x, (x + y) >> 1); build(i << 1 | 1, ((x + y) >> 1) + 1, y); } void update(long long i, long long x, long long y, long long k) { if (l[i] >= x && r[i] <= y) { mn[i] += k; tag[i] += k; return; } push_down(i); if (r[i << 1] >= x) update(i << 1, x, y, k); if (l[i << 1 | 1] <= y) update(i << 1 | 1, x, y, k); push_up(i); } long long query(long long i, long long x, long long y) { if (l[i] >= x && r[i] <= y) return mn[i]; push_down(i); long long ans = inf; if (r[i << 1] >= x) ans = min(ans, query(i << 1, x, y)); if (l[i << 1 | 1] <= y) ans = min(ans, query(i << 1 | 1, x, y)); push_up(i); return ans; } }; SegTree dis1, dis2; long long n, m, cnt, u[N << 2], v[N << 2], c[N << 2], f[N], dfn[N], siz[N], dep[N]; vector<pair<long long, long long> > edge[N]; long long dfs(long long u, long long sum, long long depth) { cnt++; dep[u] = depth; dfn[u] = cnt; siz[u] = 1; dis1.update(1, dfn[u], dfn[u], sum); dis2.update(1, dfn[u], dfn[u], sum + f[u]); for (long long i = 0; i < edge[u].size(); i++) siz[u] += dfs(edge[u][i].first, sum + edge[u][i].second, dep[u] + 1); return siz[u]; } int main() { scanf( %lld%lld , &n, &m); dis1.build(1, 1, n); dis2.build(1, 1, n); for (long long i = 1; i <= n - 1; i++) { scanf( %lld%lld%lld , &u[i], &v[i], &c[i]); edge[u[i]].push_back(make_pair(v[i], c[i])); } for (long long i = n; i <= 2 * n - 2; i++) { scanf( %lld%lld%lld , &u[i], &v[i], &c[i]); f[u[i]] = c[i]; } dfs(1ll, 0ll, 1ll); while (m--) { long long op, x, y; scanf( %lld%lld%lld , &op, &x, &y); if (op == 1) { if (x <= n - 1) { dis1.update(1ll, dfn[v[x]], dfn[v[x]] + siz[v[x]] - 1, y - c[x]); dis2.update(1ll, dfn[v[x]], dfn[v[x]] + siz[v[x]] - 1, y - c[x]); c[x] = y; } else { dis2.update(1ll, dfn[u[x]], dfn[u[x]], y - f[u[x]]); f[u[x]] = y; } } else { if (dfn[x] <= dfn[y] && dfn[x] + siz[x] - 1 >= dfn[y]) { printf( %lld n , dis1.query(1ll, dfn[y], dfn[y]) - dis1.query(1ll, dfn[x], dfn[x])); } else { printf( %lld n , dis2.query(1ll, dfn[x], dfn[x] + siz[x] - 1) - dis1.query(1ll, dfn[x], dfn[x]) + dis1.query(1ll, dfn[y], dfn[y])); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; const int MOD(1e9 + 7); const int MAXN(1e5 + 11); int n, first, z, a, l; int main() { scanf( %d%d%d%d%d , &n, &first, &z, &a, &l); int ans = 0; for (int ptr = 0; ptr < n;) { if (ptr) ptr += max(0, first - l); else ptr += first; first += a; first = min(first, z); ++ans; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; const int MX = 1111 * 1111 * 2; int n, m; const double pi = acos(-1.0); int len, res[MX], mx; struct Complex { double r, i; Complex(double r = 0, double i = 0) : r(r), i(i){}; Complex operator+(const Complex &rhs) { return Complex(r + rhs.r, i + rhs.i); } Complex operator-(const Complex &rhs) { return Complex(r - rhs.r, i - rhs.i); } Complex operator*(const Complex &rhs) { return Complex(r * rhs.r - i * rhs.i, i * rhs.r + r * rhs.i); } } va[MX], vb[MX], ve[MX], vc[MX]; void rader(Complex F[], int len) { int j = len >> 1; for (int i = 1; i < len - 1; ++i) { if (i < j) swap(F[i], F[j]); int k = len >> 1; while (j >= k) { j -= k; k >>= 1; } if (j < k) j += k; } } void FFT(Complex F[], int len, int t) { rader(F, len); for (int h = 2; h <= len; h <<= 1) { Complex wn(cos(-t * 2 * pi / h), sin(-t * 2 * pi / h)); for (int j = 0; j < len; j += h) { Complex E(1, 0); for (int k = j; k < j + h / 2; ++k) { Complex u = F[k]; Complex v = E * F[k + h / 2]; F[k] = u + v; F[k + h / 2] = u - v; E = E * wn; } } } if (t == -1) for (int i = 0; i < len; ++i) F[i].r /= len; } void Conv(Complex a[], Complex b[], int len) { FFT(a, len, 1); FFT(b, len, 1); for (int i = 0; i < len; ++i) a[i] = a[i] * b[i]; FFT(a, len, -1); for (int i = 0; i < len; ++i) a[i].r = (a[i].r > 0.5); } void init(Complex *a, Complex *b) { for (int i = 0; i < len; i++) a[i].i = 0, a[i].r = b[i].r; } void _init(Complex *a) { for (int i = 0; i < len; i++) a[i].i = 0; } void Out(int a) { if (a > 9) Out(a / 10); putchar(a % 10 + 0 ); } void print(Complex *a) { for (int i = 0; i < len; i++) printf( %d , (int)(a[i].r + 0.5)); cout << endl; } void gao() { len = 1; while (len < mx) len <<= 1; ve[0].r = 1; while (m) { if (m & 1) { init(vc, va); Conv(ve, va, len); _init(ve); init(va, vc); if (m == 1) break; } init(vb, va); Conv(va, vb, len); _init(va); m >>= 1; } for (int i = 0; i < len; ++i) res[i] = ve[i].r + 0.5; for (int i = 0; i < len; i++) if (res[i]) Out(i), putchar( ); cout << endl; } int main() { while (cin >> n >> m) { int maxn = 0; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); maxn = max(maxn, x); va[x].r = 1; va[x].i = 0; } mx = maxn * m + 1; gao(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 10009; const int D = 5001; int n; vector<vector<pair<int, int>>> hs(N, vector<pair<int, int>>()); vector<vector<pair<int, int>>> vs(N, vector<pair<int, int>>()); vector<vector<int>> ds(N, vector<int>()); class FenwickTree { public: FenwickTree(int n) { arr.assign(n + 1, 0); } int rsq(int a) { int res = 0; for (; a; a -= LSOne(a)) { res += arr[a]; } return res; } int rsq(int a, int b) { return rsq(b) - (a == 1 ? 0 : rsq(a - 1)); } void update(int a, int c) { for (; a < arr.size(); a += LSOne(a)) { arr[a] += c; } } private: vector<int> arr; int LSOne(int a) { return ((a) & (-a)); } }; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; ++i) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; x1 += D; x2 += D; y1 += D; y2 += D; if (x1 == x2) { vs[x1].emplace_back(min(y1, y2), max(y1, y2)); } else { hs[y1].emplace_back(min(x1, x2), max(x1, x2)); } } long long res = 0; for (int i = 1; i < N; ++i) for (auto h : hs[i]) { int l = h.first; int r = h.second; for (int j = 0; j < N; ++j) ds[j].clear(); FenwickTree ft(N); for (int x = l; x <= r; ++x) for (auto v : vs[x]) { if (v.first <= i && v.second > i) { ft.update(x, 1); ds[v.second].push_back(x); } } for (int y = i + 1; y < N; y++) { for (auto h : hs[y]) { int s = ft.rsq(h.first, h.second); res += (s * (s - 1)) / 2ll; } for (int v : ds[y]) { ft.update(v, -1); } } } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; stack<int> s; int a[(int)(1e+6) * 5]; bool b[(int)(1e+6) * 5]; int main() { ios_base::sync_with_stdio(0); int n, i, t, x; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; cin >> t; while (t > 0) cin >> x, b[x] = 1, t--; for (i = n; i > 0; i--) { x = -1; if (!s.empty()) x = s.top(); if (x != -1 && !b[i] && a[i] == a[x]) a[x] *= -1, s.pop(); else s.push(i); } if (!s.empty()) { cout << NO ; return 0; } cout << YES n ; for (i = 1; i <= n; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 0x3f3f3f3f; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long test; test = 1; while (test--) { int a, b, c, d; cin >> a >> b >> c >> d; int misha = max((3 * a) / 10.0, a - (a * c) / 250.0); int vasya = max((3 * b) / 10.0, b - (b * d) / 250.0); if (misha == vasya) { cout << Tie << endl; } else if (misha > vasya) { cout << Misha << endl; } else if (misha < vasya) { cout << Vasya << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); const int inf = 2147483647; int n, w; int a[1005]; bool first; int MIN; void output(int x) { if (first) first = false; else printf( ); if (x == MIN) x = 0; else if (x == 0) x = MIN; printf( %d , x + 1); } int main() { scanf( %d%d , &n, &w); int total = 0; MIN = 0; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); total += a[i]; if (a[MIN] > a[i]) MIN = i; } first = true; if (w >= a[MIN] && w <= total) { printf( Yes n ); swap(a[0], a[MIN]); output(0); total = total - w; for (int i = 1; i < n && total; i++) { while (total && a[i]) { total--; a[i]--; output(i); output(i); } } output(0); a[0]--; for (int i = 0; i < n; i++) { while (a[i]) { a[i]--; output(i); output(i); } } printf( n ); } else if (w > total || n == 1) { printf( No n ); } else if (w <= 1) { printf( No n ); } else { printf( Yes n ); swap(a[0], a[MIN]); output(0); total = total - w; for (int i = 1; i < n && total; i++) { int limit = (i == 1 ? 1 : 0); while (total && a[i] > limit) { total--; a[i]--; output(i); output(i); } } output(0); a[0]--; output(1); while (a[0] >= w - 1) { output(0); output(0); a[0]--; } output(1); while (a[0]) { output(0); output(0); a[0]--; } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], b[n], c = 0, d = 0, e = 0, i; for (i = 0; i < n; i++) { cin >> a[i] >> b[i]; if (a[i] > b[i]) c++; else if (b[i] > a[i]) d++; else e++; } if (c > d) cout << Mishka << endl; else if (d > c) cout << Chris << endl; else cout << Friendship is magic!^^ << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MM = 600005; const long long MOD = 1000000007; double a[MM], sum[MM]; char s[MM]; int main() { sum[0] = a[0] = 0; for (int i = 1; i < MM; i++) { a[i] = a[i - 1] + 1.0 / i; sum[i] = sum[i - 1] + a[i]; } scanf( %s , s + 1); int L = strlen(s + 1); double ans = 0; for (int j = 1; j <= L; j++) { if (s[j] == I || s[j] == E || s[j] == A || s[j] == O || s[j] == U || s[j] == Y ) ans += (sum[L] - sum[L - j]) - (sum[j - 1]); } printf( %.9lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p, out[1010]; struct node { int v, c; }; vector<node> e[1010]; int t1[1010], t2[1010], r[1010], k; void dfs(int i, int fa, int mi) { if (e[i].size() == 0) { t1[k] = fa; t2[k] = i; r[k] = mi; k++; return; } mi = min(e[i][0].c, mi); dfs(e[i][0].v, fa, mi); } int main() { while (cin >> n >> p) { int u; node a; memset(out, 0, sizeof(out)); for (int i = 0; i <= n; i++) e[i].clear(); for (int i = 0; i < p; i++) { scanf( %d%d%d , &u, &a.v, &a.c); e[u].push_back(a); out[u]++; out[a.v]--; } k = 0; for (int i = 1; i <= n; i++) if (out[i] == 1) dfs(i, i, 99999999); printf( %d n , k); for (int i = 0; i < k; i++) printf( %d %d %d n , t1[i], t2[i], r[i]); } } |
#include <bits/stdc++.h> using namespace std; int read() { int p = 0, q = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) ch == - ? q = -1 : 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) p = p * 10 + ch - 0 , ch = getchar(); return p * q; } long long readll() { long long p = 0, q = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) ch == - ? q = -1 : 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) p = p * 10 + ch - 0 , ch = getchar(); return p * q; } bool cmp(int x, int y) { return x > y; } int power(long long a, int b) { long long c = 1; while (b) { if (b & 1) c = c * a % 998244353; a = a * a % 998244353; b >>= 1; } return c; } int n, a[300005], pre[300005]; int main() { n = read(); for (int i = 1; i <= n; i++) a[i] = read(); sort(a + 1, a + 1 + n, cmp); for (int i = 1; i <= n; i++) pre[i] = (pre[i - 1] + a[i]) % 998244353; for (int k = 1; k <= n; k++) { int low = (n - k) / k; long long ans = 0; for (int j = 1; j <= low; j++) ans = (ans + 1ll * (pre[(j + 1) * k] - pre[j * k]) * j) % 998244353; ans = (ans + 1ll * (pre[n] - pre[low * k + k]) * (low + 1)) % 998244353; printf( %I64d%s , (ans * power(n, 998244353 - 2) % 998244353 + 998244353) % 998244353, k == n ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5; int n, m, head[N], cnt, dep[N], fa[N], pid[N]; long long c[N], val[N]; bool vis[N], use[N]; struct edge { int to, nxt, id; } e[N << 1]; void finish() { cout << YES n ; for (int i = 1; i <= m; ++i) cout << val[i] << n ; exit(0); } void dfs(int u) { vis[u] = 1; for (int i = head[u]; i; i = e[i].nxt) if (!vis[e[i].to]) { fa[e[i].to] = u; dep[e[i].to] = dep[u] + 1; pid[e[i].to] = e[i].id; use[e[i].id] = 1; dfs(e[i].to); } if (u != 1) { val[pid[u]] = c[u]; c[fa[u]] -= c[u]; c[u] = 0; } } void dfs2(int u) { for (int i = head[u]; i; i = e[i].nxt) if (!use[e[i].id] && (dep[e[i].to] - dep[u]) % 2 == 0) { assert(dep[e[i].to] > dep[u]); int fh = dep[u] % 2; long long dlt = c[1] / 2; if (fh == 1) dlt *= -1; val[e[i].id] = dlt; c[u] -= dlt, c[e[i].to] -= dlt; for (int v = e[i].to; v != 1; v = fa[v]) { val[pid[v]] += c[v]; c[fa[v]] -= c[v]; c[v] = 0; } assert(!c[1]); finish(); } for (int i = head[u]; i; i = e[i].nxt) if (use[e[i].id] && dep[e[i].to] > dep[u]) dfs2(e[i].to); } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> c[i]; for (int i = 1; i <= m; ++i) { int u, v; cin >> u >> v; e[++cnt] = (edge){v, head[u], i}, head[u] = cnt; e[++cnt] = (edge){u, head[v], i}, head[v] = cnt; } dfs(1); if (c[1] % 2 == 0) { if (c[1]) dfs2(1); else finish(); } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void readi(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = v * 10 + c - 0 ; while (isdigit(c = getchar())) v = v * 10 + c - 0 ; x = v * f; } void readll(long long &x) { long long v = 0ll, f = 1ll; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = v * 10 + c - 0 ; while (isdigit(c = getchar())) v = v * 10 + c - 0 ; x = v * f; } void readc(char &x) { char c; while ((c = getchar()) == ) ; x = c; } void writes(string s) { puts(s.c_str()); } void writeln() { writes( ); } void writei(int x) { if (!x) putchar( 0 ); char a[25]; int top = 0; while (x) { a[++top] = (x % 10) + 0 ; x /= 10; } while (top) { putchar(a[top]); top--; } } void writell(long long x) { if (!x) putchar( 0 ); char a[25]; int top = 0; while (x) { a[++top] = (x % 10) + 0 ; x /= 10; } while (top) { putchar(a[top]); top--; } } inline long long inc(int &x) { return ++x; } inline long long inc(long long &x) { return ++x; } inline long long inc(int &x, long long y) { return x += y; } inline long long inc(long long &x, long long y) { return x += y; } inline double inc(double &x, double y) { return x += y; } inline long long dec(int &x) { return --x; } inline long long dec(long long &x) { return --x; } inline long long dec(int &x, long long y) { return x -= y; } inline long long dec(long long &x, long long y) { return x -= y; } inline double dec(double &x, double y) { return x -= y; } inline long long mul(int &x) { return x = ((long long)x) * x; } inline long long mul(long long &x) { return x = x * x; } inline long long mul(int &x, long long y) { return x *= y; } inline long long mul(long long &x, long long y) { return x *= y; } inline double mul(double &x, double y) { return x *= y; } inline long long divi(int &x) { return x = sqrt(x); } inline long long divi(long long &x) { return x = sqrt(x); } inline long long divi(int &x, long long y) { return x /= y; } inline long long divi(long long &x, long long y) { return x /= y; } inline double divi(double &x, double y) { return x /= y; } inline long long mod(int &x, long long y) { return x %= y; } inline long long mod(long long &x, long long y) { return x %= y; } int dx[5] = {0, -1, 1, 0, 0}, dy[5] = {0, 0, 0, -1, 1}; string dc = ^v<> ; int n, m, i, j, k, dg[2222][2222]; queue<int> qx, qy; char mp[2222][2222]; vector<pair<int, int> > add(int x, int y, int z) { int i; vector<pair<int, int> > ans; if ((1) <= ((4))) for (((i)) = (1); ((i)) <= ((4)); ((i))++) { dg[x + dx[i]][y + dy[i]] += z; if (dg[x + dx[i]][y + dy[i]] == 1 && mp[x + dx[i]][y + dy[i]] == . ) ans.push_back(make_pair(x + dx[i], y + dy[i])); } return ans; } int main() { ios_base::sync_with_stdio(false); ; cin >> n >> m; if ((1) <= ((n))) for (((i)) = (1); ((i)) <= ((n)); ((i))++) if ((1) <= ((m))) for (((j)) = (1); ((j)) <= ((m)); ((j))++) cin >> mp[i][j]; if ((1) <= ((n))) for (((i)) = (1); ((i)) <= ((n)); ((i))++) if ((1) <= ((m))) for (((j)) = (1); ((j)) <= ((m)); ((j))++) if (mp[i][j] == . ) add(i, j, 1); if ((1) <= ((n))) for (((i)) = (1); ((i)) <= ((n)); ((i))++) if ((1) <= ((m))) for (((j)) = (1); ((j)) <= ((m)); ((j))++) if (mp[i][j] == . && dg[i][j] == 1) { qx.push(i); qy.push(j); } while (!qx.empty()) { int x = qx.front(), y = qy.front(); qx.pop(); qy.pop(); if (mp[x][y] != . ) continue; if ((1) <= ((4))) for (((k)) = (1); ((k)) <= ((4)); ((k))++) { if (mp[x + dx[k]][y + dy[k]] == . ) { mp[x][y] = dc[(k - 1) ^ 1]; mp[x + dx[k]][y + dy[k]] = dc[(k - 1)]; vector<pair<int, int> > nxt = add(x, y, -1); for (__typeof((nxt).begin()) it = (nxt).begin(); it != (nxt).end(); it++) { if (mp[it->first][it->second] == . ) { qx.push(it->first); qy.push(it->second); } } nxt = add(x + dx[k], y + dy[k], -1); for (__typeof((nxt).begin()) it = (nxt).begin(); it != (nxt).end(); it++) { if (mp[it->first][it->second] == . ) { qx.push(it->first); qy.push(it->second); } } break; } } } if ((1) <= ((n))) for (((i)) = (1); ((i)) <= ((n)); ((i))++) if ((1) <= ((m))) for (((j)) = (1); ((j)) <= ((m)); ((j))++) if (mp[i][j] == . ) { cout << Not unique ; return 0; }; if ((1) <= ((n))) for (((i)) = (1); ((i)) <= ((n)); ((i))++) { if ((1) <= ((m))) for (((j)) = (1); ((j)) <= ((m)); ((j))++) cout << mp[i][j]; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> split(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.push_back(move(x)); return move(v); } void err(vector<string>::iterator it) {} template <typename T, typename... Args> void err(vector<string>::iterator it, T a, Args... args) { cerr << it->substr((*it)[0] == , it->length()) << = << a << n ; err(++it, args...); } int N, M; int S[300013]; set<int> flv[300013]; vector<int> adj[300013]; int ans = 1; int color[300013]; void dfs(int n, int p = 0) { set<int> s; int cur = 1; for (int x : flv[n]) { if (color[x]) { s.insert(color[x]); } } for (int x : flv[n]) { if (!color[x]) { while (s.count(cur)) cur++; color[x] = cur++; } } for (int v : adj[n]) { if (v != p) { dfs(v, n); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> N >> M; for (int i = 1; i <= N; i++) { cin >> S[i]; ans = max(ans, S[i]); for (int j = 0; j < S[i]; j++) { int k; cin >> k; flv[i].insert(k); } } for (int i = 1; i < N; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } dfs(1); cout << ans << endl; for (int i = 1; i <= M; i++) { cout << (color[i] ? color[i] : 1) << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int q; unsigned long long int n; cin >> q; for (int i = 0; i < q; i++) { cin >> n; if (n < 4) { cout << 4 - n << endl; } else { if (n % 2 == 0) { cout << 0 << endl; } else { cout << 1 << endl; } } } } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T t) { return t < 0 ? -t : t; } const long long modn = 1000000007; inline long long mod(long long x) { return x % modn; } const int N = 1000009; int a[N], t[N]; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int A, B, n; long long memo[N][2][2]; long long solve(int i, bool on, bool first) { if (i == n) return (first && on) ? 100000000000000000ll : 0ll; if (!on && t[i] == 2) return 100000000000000000ll; long long &r = memo[i][on][first]; if (r != -1) return r; if (on) r = min(solve(i, false, first), solve(i + 1, true, first) + A); else r = solve(i + 1, false, first) + (t[i] == 1 ? B : 0ll); return r; } void add_ps(set<int> &p, int x) { for (int i = 2; i * i <= x; i++) { if (!(x % i)) p.insert(i); while (!(x % i)) x /= i; } if (x > 1) p.insert(x); } int main() { int i; scanf( %d %d %d , &n, &A, &B); for (i = 0; i < n; i++) scanf( %d , &a[i]); set<int> p; for (i = -1; i <= 1; i++) add_ps(p, a[0] + i), add_ps(p, a[n - 1] + i); long long ans = LLONG_MAX; for (int x : p) { for (i = 0; i < n; i++) if ((a[i] % x) == 0) t[i] = 0; else if (!((a[i] + 1) % x) || !((a[i] - 1) % x)) t[i] = 1; else t[i] = 2; memset(memo, -1, sizeof memo); long long cur = 0; for (i = 0; i < n; i++) { ans = min(ans, cur + solve(i, true, !i)); if (t[i] == 1) cur += B; else if (t[i] == 2) break; } } printf( %I64d n , ans); } |
#include <bits/stdc++.h> using namespace std; string solve(string s) { if (s.size() & 1) { return s; } string a = solve(s.substr(0, s.size() / 2)); string b = solve(s.substr(s.size() / 2)); if (a < b) { return a.append(b); } else { return b.append(a); } } int main() { string s, t; cin >> s >> t; cout << (solve(s) == solve(t) ? YES : NO ) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int c[500]; int main() { string s, t; int n, i, j, k; cin >> s >> t; bool ok = 1; vector<pair<char, char> > ans; n = s.length(); vector<char> v(500, 0 ); for (i = 0; i < n; i++) { if (s[i] == t[i]) { if (c[s[i]] == -2) ok = 0; c[s[i]] = -1; continue; } else if (c[s[i]] == -1 || c[t[i]] == -1) { ok = 0; } else if (!c[s[i]] && !c[t[i]]) { ans.push_back({s[i], t[i]}); c[s[i]] = -2; v[s[i]] = t[i]; c[t[i]] = -2; v[t[i]] = s[i]; } else if (c[s[i]] == -2 && c[t[i]] == -2) { if (v[s[i]] != t[i] || v[t[i]] != s[i]) ok = 0; } else ok = 0; } if (!ok) return cout << -1, 0; cout << ans.size() << endl; for (i = 0; i < ans.size(); i++) { cout << ans[i].first << << ans[i].second << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; string ans; cin >> s; int i = 0; int j = 0; while (i < s.size() & j < 3) { if (j == 0) { if (s[i] == f ) { ans = ftp:// ; i = 3; } else { ans = http:// ; i = 4; } j = 1; } if (j == 1) { int temp = i; while (s[i + 1] != r || s[i + 2] != u ) { i++; } ans += s.substr(temp, i + 1 - temp); ans += .ru ; i = i + 3; j = 2; } if (j == 2) { if (s.size() - i) { ans += / ; ans += s.substr(i, s.size() - i); i = s.size(); } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200100; const long long OO = 1e18; const int oo = 2e9; const int md = 998244353; set<int> st; set<int>::iterator ite; int sto, n, p[N], obr = 1, ans = 0, mul[N], q, psm[N]; bool mrk[N]; int mult(int x, int y) { return (1ll * x * y) % md; } int sum(int x, int y) { x += y; if (x >= md) x -= md; return x; } int sub(int x, int y) { x -= y; if (x < 0) x += md; return x; } int binpow(int x, int po) { int res = 1; while (po > 0) { if (po & 1) res = mult(res, x); x = mult(x, x); po >>= 1; } return res; } int calc(int l, int r) { int up = sub(psm[r - 1], (l - 2 < 0 ? 0 : psm[l - 2])); up = mult(up, binpow(mul[l - 1], md - 2)); int down = mult(mul[r], binpow(mul[l - 1], md - 2)); return mult(up, binpow(down, md - 2)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> q; sto = binpow(100, md - 2); mul[0] = 1; mrk[1] = 1; psm[0] = 1; for (int i = 1; i <= n; i++) { cin >> p[i]; p[i] = mult(p[i], sto); mul[i] = mult(mul[i - 1], p[i]); psm[i] = sum(psm[i - 1], mul[i]); } ans = calc(1, n); st.clear(); st.insert(1); st.insert(n + 1); for (; q; q--) { int ps; cin >> ps; if (!mrk[ps]) { st.insert(ps); ite = st.find(ps); int lf = *prev(ite); int rt = (*next(ite)) - 1; ans = sub(ans, calc(lf, rt)); ans = sum(ans, calc(lf, ps - 1)); ans = sum(ans, calc(ps, rt)); } else { ite = st.find(ps); int lf = *prev(ite); int rt = (*next(ite)) - 1; ans = sum(ans, calc(lf, rt)); ans = sub(ans, calc(lf, ps - 1)); ans = sub(ans, calc(ps, rt)); st.erase(ite); } mrk[ps] ^= 1; cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; vector<long long> v(n); for (long long i = 0; i < n; i++) cin >> v[i]; vector<long long> peaks(n, 0); for (long long i = 1; i < n - 1; i++) { if (v[i] > v[i - 1] && v[i] > v[i + 1]) { peaks[i] = 1; } } for (long long i = 1; i < n; i++) { peaks[i] = peaks[i] + peaks[i - 1]; } long long ans = 0; long long pos = 0; for (long long l = 0, r = k - 1; r < n; l++, r++) { if (peaks[r - 1] - peaks[l] > ans) { ans = peaks[r - 1] - peaks[l]; pos = l; } } cout << ans + 1 << << pos + 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int size = 508; int num[size]; int Abs(int x) { return x > 0 ? x : -x; } int main() { int n, sum, m, i, x, L, R, c, t, v, up; cin >> n; sum = m = 0; up = 1000000; for (i = 1; i <= 2 * n - 1; i++) { cin >> num[i]; if (num[i] < 0) m++; sum += Abs(num[i]); if (up > Abs(num[i])) up = Abs(num[i]); } if (n & 1) { cout << sum << endl; return 0; } if (m & 1) { cout << sum - 2 * up << endl; } else cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double a, d; int n; cin >> a >> d >> n; scanf( %lf%lf%d , &a, &d, &n); for (int i = 0; i < n; i++) { double temp = fmod((i + 1) * d, 4 * a); if (temp < a) printf( %lf %lf n , temp, 0.0); else if (temp < a * 2) printf( %lf %lf n , a, temp - a); else if (temp < a * 3) printf( %lf %lf n , 3 * a - temp, a); else printf( %lf %lf n , 0.0, 4 * a - temp); } return 0; } |
#include <bits/stdc++.h> const int mxn = 105; const int inf = 505; int n; int m; int ans; int row[mxn]; int col[mxn]; int mat[mxn][mxn]; inline void calcRow() { for (int i = 1; i <= n; ++i) { row[i] = inf; for (int j = 1; j <= m; ++j) if (row[i] > mat[i][j]) row[i] = mat[i][j]; for (int j = 1; j <= m; ++j) mat[i][j] -= row[i]; ans += row[i]; } } inline void calcCol() { for (int j = 1; j <= m; ++j) { col[j] = inf; for (int i = 1; i <= n; ++i) if (col[j] > mat[i][j]) col[j] = mat[i][j]; for (int i = 1; i <= n; ++i) mat[i][j] -= col[j]; ans += col[j]; } } signed main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) scanf( %d , &mat[i][j]); if (n <= m) calcRow(), calcCol(); else calcCol(), calcRow(); bool flag = true; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (mat[i][j]) flag = false; if (flag) { printf( %d n , ans); for (int i = 1; i <= n; ++i) for (int j = 1; j <= row[i]; ++j) printf( row %d n , i); for (int j = 1; j <= m; ++j) for (int i = 1; i <= col[j]; ++i) printf( col %d n , j); } else puts( -1 ); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1; const long long MOD = 1; long long _gcd(long long a, long long b) { if (b == 0) return a; return _gcd(b, a % b); } long long gcd(long long a, long long b) { a = abs(a), b = abs(b); if (a < b) swap(a, b); return _gcd(a, b); } long long qpow(long long a, long long n) { long long rt = 1; while (n) { if (n & 1) rt = (rt * a) % MOD; a = a * a % MOD; n >>= 1; } return rt; } long long factor[MAXN]; long long inv[MAXN]; void cal_factor() { factor[0] = 1; for (int u = 1; u < MAXN; u++) { factor[u] = (factor[u - 1] * u) % MOD; } } void cal_factor_inv() { inv[0] = 1; inv[MAXN - 1] = qpow(factor[MAXN - 1], MOD - 2); for (int u = MAXN - 2; u >= 1; u--) { inv[u] = inv[u + 1] * (u + 1) % MOD; } } void init_factor() { cal_factor(); cal_factor_inv(); } long long C(long long n, long long k) { if (n < k) return 0; return factor[n] * qpow(factor[n - k], MOD - 2) % MOD * qpow(factor[k], MOD - 2) % MOD; } void solve() { int a[6]; for (int u = 0; u < 6; u++) cin >> a[u]; int n; cin >> n; vector<pair<int, int>> b; for (int u = 0; u < n; u++) { int tb; cin >> tb; for (int k = 0; k < 6; k++) { b.push_back({tb - a[k], u}); } } sort(b.begin(), b.end()); int ptr1 = 0, ptr2 = 0; vector<int> vis(n, 0); int cnt = 0; int ans = 2e9; for (; ptr2 < n * 6; ptr2++) { if (vis[b[ptr2].second] == 0) cnt++; vis[b[ptr2].second]++; while (cnt == n && ptr1 <= ptr2 && vis[b[ptr1].second]) { ans = min(ans, b[ptr2].first - b[ptr1].first); vis[b[ptr1].second]--; if (vis[b[ptr1].second] == 0) cnt--; ptr1++; } } cout << ans << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); solve(); } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.