func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const long long md = 1000000007; int main() { long long n, s, a, t1, t2; cin >> n; s = n * 2; vector<long long> v(s); for (int i = 0; i < s; i++) { cin >> a; v[i] = a; } sort(v.begin(), v.end(), greater<long long>()); t1 = 0; t2 = 0; for (int i = 0; i < n; i++) { t1 += v[i]; } for (int i = v.size() - 1; i >= n; i--) { t2 += v[i]; } if (t1 == t2) { cout << -1 << n ; } else { for (int i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; void segmentedSieve(long long L, long long R) { long long lim = sqrt(R); vector<bool> mark(lim + 1, false); vector<long long> primes; for (long long i = 2; i <= lim; ++i) { if (!mark[i]) { primes.emplace_back(i); for (long long j = i * i; j <= lim; j += i) mark[j] = true; } } int buenos = 0; long long len = ceil(sqrt(R - L + 1)); for (long long bloques = 0; bloques < len; ++bloques) { long long l = L + len * bloques + 1; if (bloques == 0) l = L; long long r = min(R, L + len * (bloques + 1)); if (l > r) break; vector<bool> isPrime(r - l + 1, true); for (long long i : primes) for (long long j = max(i * i, (l + i - 1) / i * i); j <= r; j += i) isPrime[j - l] = false; if (l == 1) isPrime[0] = false; for (long long i = l; i <= r; ++i) { if (i == 2 || (isPrime[i - l] && i % 4 == 1)) { buenos++; } } } cout << buenos << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << setprecision(20) << fixed; long long l, r; cin >> l >> r; segmentedSieve(l, r); } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, k, i, o; cin >> n >> k; o = n - k; for (i = 1; i <= o - 1; i++) cout << i << ; for (i = n; i >= o; i--) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T By(T x, T y, T P) { T F1 = 0; while (y) { if (y & 1) { F1 += x; if (F1 < 0 || F1 >= P) F1 -= P; } x <<= 1; if (x < 0 || x >= P) x -= P; y >>= 1; } return F1; } template <class T> T Mul(T x, T y, T P) { T F1 = 1; x %= P; while (y) { if (y & 1) { F1 = By(F1, x, P); } x = By(x, x, P); y >>= 1; } return F1; } template <class T> T Gcd(T x, T y) { if (y == 0) return x; T z; while (z = x % y) { x = y, y = z; } return y; } struct EDGE { int T; EDGE *Nxt; }; template <class T> void UpdataMin(T &x, T y) { if (y < x) { x = y; } } template <class T> void UpdataMax(T &x, T y) { if (x < y) { x = y; } } int Dp[61][61][61]; int Map[61][61][61]; int NM[61][61]; int N, M, R, I, J, K; int main() { memset(Dp, 63, sizeof(Dp)); memset(NM, 63, sizeof(NM)); scanf( %d%d%d , &N, &M, &R); for (int i = 0; i < (M); ++i) { for (int j = 1; j <= (N); ++j) for (int k = 1; k <= (N); ++k) scanf( %d , &Map[i][j][k]); for (int l = 1; l <= (N); ++l) for (int j = 1; j <= (N); ++j) for (int k = 1; k <= (N); ++k) if (Map[i][j][l] + Map[i][l][k] < Map[i][j][k]) Map[i][j][k] = Map[i][j][l] + Map[i][l][k]; for (int j = 1; j <= (N); ++j) for (int k = 1; k <= (N); ++k) UpdataMin(NM[j][k], Map[i][j][k]); } for (int i = 1; i <= (N); ++i) for (int j = 1; j <= (N); ++j) Dp[0][i][j] = NM[i][j]; for (int i = 1; i <= (60); ++i) for (int j = 1; j <= (N); ++j) for (int k = 1; k <= (N); ++k) for (int l = 1; l <= (N); ++l) UpdataMin(Dp[i][j][l], Dp[i - 1][j][k] + NM[k][l]); while (R--) { scanf( %d%d%d , &I, &J, &K); if (K > 60) K = 60; printf( %d n , Dp[K][I][J]); } scanf( %d , &N); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int maxn = 2e5 + 10; const int inf = 0x3f3f3f3f; const double eps = 1e-6; int n, a[maxn]; int num[maxn]; int pre[maxn]; int lst[maxn]; int up = 500; int mx = 0; int c0[maxn], c[maxn]; void add(int x) { c0[c[x]]--; c[x]++; c0[c[x]]++; mx = max(mx, c[x]); } void sub(int x) { c0[c[x]]--; c[x]--; c0[c[x]]++; mx -= (c0[mx] == 0); } int solve1(int D) { int res = 0; for (int i = 1; i <= up; i++) { memset(c, 0, sizeof(c)), memset(c0, 0, sizeof(c0)); mx = 0; int k = 1, x = 0; for (int j = 1; j <= n; j++) { while (k <= n && x + (a[k] == D) <= i) add(a[k]), x += (a[k] == D), k++; if (c0[mx] >= 2) res = max(res, k - j); sub(a[j]), x -= (a[j] == D); } } return res; } int solve2(int D, int V) { int res = 0; memset(pre, 0, sizeof(pre)); memset(lst, -1, sizeof(lst)); for (int i = 1; i <= n; i++) { if (a[i] == D) pre[i] = pre[i - 1] + 1; else if (a[i] == V) pre[i] = pre[i - 1] - 1; else pre[i] = pre[i - 1]; } for (int i = n; i >= 1; i--) lst[pre[i]] = i; lst[0] = 0; for (int i = 1; i <= n; i++) res = max(res, i - lst[pre[i]]); return res; } int main() { std::ios::sync_with_stdio(false), cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], num[a[i]]++; int mx = 0, mx_id = 0, cnt = 0; for (int i = 1; i <= n; i++) { if (num[i] > mx) mx = num[i], mx_id = i, cnt = 1; else if (num[i] == mx) cnt++; } if (cnt > 1) { cout << n << n ; return 0; } int D = mx_id; int ans = 0; ans = max(ans, solve1(D)); for (int V = 1; V <= n; V++) { if (V == D) continue; if (num[V] > up) ans = max(ans, solve2(D, V)); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> const long long mod = 1000000007; int n; long long x[1 << 20]; long long y[1 << 20]; long long d[1 << 20]; long long sx[1 << 20]; long long sy[1 << 20]; long long sd[1 << 20]; long long ssd[1 << 20]; long long cirsm(int s, int v, long long sa[] = sd) { long long ar = 0; if (s > 0 && v > s) { ar = sa[v - 1] - sa[s - 1]; } else if (s == 0) { ar = sa[v - 1]; } else { ar = sa[n + v - 1] - sa[s - 1]; } return ar; } long long area(int s, int v) { long long ar = cirsm(s, v); ar += (x[s] - x[v]) * (y[s] + y[v]); return ar; } long long sumsd2(int s, int v) { long long ar = 0; if (s == 0) { ar = ssd[v - 1]; } else if (s < v) { long long rm = (long long)(v - s) * (sd[s - 1] % mod); rm = rm % mod; if (rm < 0) { rm += mod; } ar = (mod + ssd[v - 1] - ssd[s - 1] + mod - rm) % mod; } else { v += n; long long rm = (long long)(v - s) * (sd[s - 1] % mod); rm = rm % mod; if (rm < 0) { rm += mod; } ar = (mod + ssd[v - 1] - ssd[s - 1] + mod - rm) % mod; } return ar; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { long long xx, yy; scanf( %lld %lld , &xx, &yy); x[i + n] = x[i] = xx; y[i + n] = y[i] = yy; } for (int i = 0; i < 2 * n; ++i) { if (i + 1 < 2 * n) { d[i] = (x[i + 1] - x[i]) * (y[i + 1] + y[i]); } else { d[i] = d[i - n]; } if (i == 0) { sx[i] = x[i]; sy[i] = y[i]; sd[i] = d[i]; ssd[i] = sd[i] % mod; if (ssd[i] < 0) { ssd[i] += mod; } } else { sx[i] = sx[i - 1] + x[i]; sy[i] = sy[i - 1] + y[i]; sd[i] = sd[i - 1] + d[i]; ssd[i] = ssd[i - 1] + sd[i]; ssd[i] %= mod; if (ssd[i] < 0) { ssd[i] += mod; } } } long long S = sd[n - 1]; long long ans = 0; int k = 1; int v = 0; long long dsm = 0; while (k < n && 2 * area(0, k + 1) < S) { ++k; dsm += (x[k] - x[0]) * (y[k] + y[0]); dsm %= mod; if (dsm < 0) { dsm += mod; } } for (int i = 0; i < n; ++i) { long long lt = cirsm(i, k) % mod; if (lt < 0) { lt += mod; } long long gt = cirsm(k, i) % mod; if (gt < 0) { gt += mod; } long long cnt = (k - 1 - i); if (cnt < 0) { cnt += n; } long long aa = 0; aa = cnt * (cirsm(i + 1, k) % mod) - sumsd2(i + 1, k); aa %= mod; if (aa < 0) { aa += mod; } if (cnt) { long long ch = cnt * (gt - lt + mod) + aa + aa + 2LL * dsm; ch %= mod; ans += ch; ans %= mod; if (ans < 0) { ans += mod; } } if (i + 1 >= n) { break; } if (k != (i + 1) % n) { int j = (i + 2) % n; dsm -= (x[j] - x[i]) * (y[j] + y[i]); dsm %= mod; if (dsm < 0) { dsm += mod; } } long long ndi = k - i - 2; if (ndi < 0) { ndi += n; } if (k != (i + 1) % n && k != (i + 2) % n) { long long c = (x[i + 1] * y[i + 1] - x[i] * y[i]) % mod; dsm = dsm - c * ndi; dsm %= mod; long long xsm = cirsm(i + 3, k + 1, sx) % mod; dsm += xsm * (y[i + 1] - y[i]); long long ysm = cirsm(i + 3, k + 1, sy) % mod; dsm -= ysm * (x[i + 1] - x[i]); dsm %= mod; if (dsm < 0) { dsm += mod; } } if ((i + 1) == k) { k = (i + 2) % n; } while ((unsigned long long)2LL * (unsigned long long)area(i + 1, (k + 1) % n) < S) { k = (k + 1) % n; dsm += (x[k] - x[i + 1]) * (y[k] + y[i + 1]); dsm %= mod; if (dsm < 0) { dsm += mod; } } } ans += mod; ans %= mod; printf( %lld n , (long long)ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; long long a, b, c, d, e, f, k; bool check(long long x, long long y) { if (k == 0) { return x == c && y == d; } return ((c - x) * e + (d - y) * f) % k == 0 && (e * (d - y) + f * (x - c)) % k == 0; } int main() { while (cin >> a >> b >> c >> d >> e >> f) { k = e * e + f * f; if (check(a, b) || check(-a, -b) || check(b, -a) || check(-b, a)) { cout << YES << endl; } else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; const long double E = 1e-7; unsigned char ccc; bool _minus = false; template <typename T> inline T sqr(T t) { return (t * t); } inline void read(long long &n) { n = 0; _minus = false; while (true) { ccc = getchar(); if (ccc == || ccc == n ) break; if (ccc == - ) { _minus = true; continue; } n = n * 10 + ccc - 0 ; } if (_minus) n *= -1; } inline void read(int &n) { n = 0; _minus = false; while (true) { ccc = getchar(); if (ccc == || ccc == n ) break; if (ccc == - ) { _minus = true; continue; } n = n * 10 + ccc - 0 ; } if (_minus) n *= -1; } char wwww[19]; int kkkk; inline void write(long long y) { long long x = y; kkkk = 0; if (!x) ++kkkk, wwww[kkkk] = 0 ; else while (x) { ++kkkk; wwww[kkkk] = char(x % 10 + 0 ); x /= 10; } for (int i = kkkk; i >= 1; --i) putchar(wwww[i]); putchar( ); } long long d, k, a, b, t; long long get(long long x) { long long ans = max(0LL, x - 1) * t + x * k * a + (d - x * k) * b; return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; srand(time(NULL)); cout.precision(10); cout << fixed; cin >> d >> k >> a >> b >> t; long long ans = ((d - 1) / k) * t + d * a; long long l = 0, r = d / k; while (l + 10 < r) { long long l1 = (l + l + r) / 3, r1 = (l + r + r) / 3; if (get(l1) < get(r1)) { r = r1; } else { l = l1; } } for (long long i = l; i <= r; i++) ans = min(ans, get(i)); cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int r, c; cin >> r >> c; char mat[r + 5][c + 5]; for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { cin >> mat[i][j]; } } for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { if (mat[i][j] == B ) { int rw = 0, cl = 0; for (int k = j; k <= c; k++) { if (mat[i][k] == B ) cl++; else break; } for (int k = i; k <= r; k++) { if (mat[k][j] == B ) rw++; else break; } cout << i + rw / 2 << << j + cl / 2 << endl; return 0; } } } return 0; } |
#include <bits/stdc++.h> int t[100003] = {0}; int main() { int L, b, f, n; scanf( %d%d%d%d , &L, &b, &f, &n); t[L] = 1000; for (int i = 1; i <= n; i++) { int req, len; scanf( %d%d , &req, &len); if (req == 1) { bool e = 0; for (int a = 0; a < L; a++) { if (t[a]) continue; int prev = a; for (int c = a + 1; c <= L; c++) { a = c; if (t[c]) { if (prev == 0 && c == L && L - prev >= len) { for (int j = 0; j < len; j++) t[j] = i; printf( 0 n ); e = 1; } else if (prev == 0 && c >= len + f) { for (int j = 0; j < len; j++) t[j] = i; printf( 0 n ); e = 1; } else if (c == L && L - prev >= len + b || c - prev >= len + b + f) { for (int j = prev + b; j < prev + b + len; j++) t[j] = i; printf( %d n , prev + b); e = 1; } break; } } if (e) break; } if (!e) printf( -1 n ); } else { for (int j = 0; j < L; j++) if (t[j] == len) t[j] = 0; } } } |
#include <bits/stdc++.h> using namespace std; const long long N = 200009; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) { long long n, m; cin >> n >> m; long long a[n + 5]; long long na[n + 5]; for (long long i = 1; i <= n; i++) { cin >> a[i]; na[i] = a[i]; } sort(na + 1, na + n + 1); long long p[m + 5]; unordered_map<long long, long long> mp; for (long long i = 1; i <= m; i++) { cin >> p[i]; mp[p[i]] = 1; } for (long long i = 1; i <= n; i++) { for (long long i = 1; i < n; i++) { if (mp[i] == 1 && a[i] > a[i + 1]) { swap(a[i], a[i + 1]); } } } long long f = 1; for (long long i = 1; i <= n; i++) { if (a[i] != na[i]) { f = 0; cout << NO << n ; break; } } if (f == 1) { cout << YES << n ; } } return 0; } |
#include <bits/stdc++.h> int main() { char g[100]; scanf( %s , g); for (int w = 0; g[w] != 0 ; w++) { if (g[w] >= 65 && g[w] <= 90) g[w] = g[w] + 32; } for (int w = 0; g[w] != 0 ; w++) { if (!(g[w] == a || g[w] == e || g[w] == i || g[w] == o || g[w] == u || g[w] == y )) printf( .%c , g[w]); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int mod = 1e9 + 7; int arr[500]; int main() { int k, n; scanf( %d , &n); for (int i = 0; i < n; i++) { int a; scanf( %d , &a); if (a % 2) { cout << First << endl; return 0; } } cout << Second << endl; } |
#include <bits/stdc++.h> using namespace std; bool vis[30010][210][2][2][2]; int pd[30010][210][2][2][2]; int v[30010]; int n, K; int solve(int ind, int cut, int s1, int s2, int tem) { if (cut == K) return 0LL; if (ind == n) return -0x3f3f3f3f; int &ans = pd[ind][cut][s1][s2][tem]; if (vis[ind][cut][s1][s2][tem]) return ans; int p1, p2; if (s1) p1 = 1; else p1 = -1; if (s2) p2 = 1; else p2 = -1; if (cut == 0) p1 = 0LL; if (cut == K - 1) p2 = 0LL; vis[ind][cut][s1][s2][tem] = true; ans = -0x3f3f3f3f; int x = v[ind] * (p1 + p2); if (tem) { ans = max(x + solve(ind + 1, cut + 1, s2 ^ 1, 0, 0), x + solve(ind + 1, cut + 1, s2 ^ 1, 1, 0)); ans = max(ans, x + solve(ind + 1, cut, s1, s2, tem)); } else { ans = max(ans, solve(ind + 1, cut, s1, s2, 0)); ans = max(ans, x + solve(ind + 1, cut, s1, s2, 1)); ans = max(ans, x + solve(ind + 1, cut + 1, s2 ^ 1, 0, 0)); ans = max(ans, x + solve(ind + 1, cut + 1, s2 ^ 1, 1, 0)); } return ans; } int main() { scanf( %d %d , &n, &K); for (int i = 0; i < (n); ++i) scanf( %d , &v[i]); int ans = max(solve(0, 0, 0, 0, 0), solve(0, 0, 0, 1, 0)); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = (1 << 19); string str; vector<pair<int, char> > sorted; int cnt[MX], done[MX], K; int main() { cin >> str >> K; for (int j = 0; j < str.size(); j++) cnt[str[j] - a ]++; for (int j = 0; j < 26; j++) { sorted.push_back(make_pair(cnt[j], j + a )); } sort(sorted.begin(), sorted.end()); int ans = 26; for (auto pp : sorted) { if (pp.first > K) break; K -= pp.first; done[pp.second] = 1; --ans; } cout << ans << endl; for (auto ch : str) if (!done[ch]) cout << ch; cout << endl; } |
#include <bits/stdc++.h> using namespace std; bool isSubSequence(string str1, string str2, int m, int n) { if (m == 0) return true; if (n == 0) return false; if (str1[m - 1] == str2[n - 1]) return isSubSequence(str1, str2, m - 1, n - 1); return isSubSequence(str1, str2, m, n - 1); } int main() { string s, t; cin >> s >> t; int i, j; int arr1[26] = {0}, arr2[26] = {}; int m = s.length(); int n = t.length(); if (isSubSequence(t, s, n, m) == true) { cout << automaton << endl; return 0; } for (i = 0; i < s.length(); i++) { arr1[int(s[i]) - 97]++; } for (i = 0; i < t.length(); i++) { arr2[int(t[i]) - 97]++; } int flag = 0; if (s.length() == t.length()) { for (i = 0; i < 26; i++) { if (arr1[i] != arr2[i]) { flag = 1; break; } } if (flag == 0) { cout << array << endl; return 0; } else { cout << need tree << endl; return 0; } } for (i = 0; i < 26; i++) { if (arr1[i] < arr2[i]) { cout << need tree << endl; return 0; } } cout << both << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; string s[n]; for (int i = 0; i < n; i++) cin >> s[i]; long long a[m]; for (int i = 0; i < m; i++) cin >> a[i]; long long ans = 0; for (int i = 0; i < m; i++) { long long maxi = 0; for (char c = A ; c <= E ; c++) { long long temp = 0; for (int j = 0; j < n; j++) { if (s[j][i] == c) temp += a[i]; } maxi = max(temp, maxi); } ans += maxi; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1}; int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1}; int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1}; const long long oo = 1e18; const long long maxN = 1e6; void maximize(int &a, int b) { a = max(a, b); } void minimize(int &a, int b) { a = min(a, b); } int cnt[15]; void solve() { int n, ans = 0; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; cnt[x]++; int g = 0, b, d = 0; b = n + 1; for (int j = 1; j <= 10; j++) { if (cnt[j] > 0) { cnt[j]--; int p = 0; bool ok = true; for (int k = 1; k <= 10; k++) { if (cnt[k]) { if (!p) p = cnt[k]; else if (p != cnt[k]) ok = false; } } cnt[j]++; if (ok) ans = i; } } } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1, ddd = 0; while (tc--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; char s[20]; int m; long long dp[1 << 18][110]; int cnt[20]; int main() { ios::sync_with_stdio(false); cin >> s >> m; memset(dp, 0, sizeof(dp)); memset(cnt, 0, sizeof(cnt)); dp[0][0] = 1; int l = strlen(s); long long x = 1 << l, d = 1; for (int i = 0; i < l; i++) d *= ++cnt[s[i] - 0 ]; for (int i = 0; i < x; i++) { for (int j = 0; j < l; j++) { if (!(i & (1 << j)) && (i || s[j] - 0 )) { for (int k = 0; k < m; k++) { if (dp[i][k]) dp[i | (1 << j)][(k * 10 + (s[j] - 0 )) % m] += dp[i][k]; } } } } cout << dp[x - 1][0] / d << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, j, s, x; map<long long, long long> mp; map<long long, long long>::iterator it; cin >> n; s = 0; for (i = 0; i < n; i++) { cin >> x; s += x; mp[s]++; } i = -1; for (it = mp.begin(); it != mp.end(); it++) { i = max(i, it->second); } cout << n - i << n ; } |
#include<bits/stdc++.h> using namespace std; #define FASTio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define ll long long int #define all(v) (v).begin(), (v).end() #define mp make_pair #define pb push_back #define pf push_front #define ff first #define ss second #define lcm(a, b) ((a) * (b)) / __gcd(a, b) #define umpit unordered_map<ll,ll>::iterator #define mpit map<ll,ll>::iterator #define setit set<ll>::iterator #define mx(a) *max_element(all(a)) #define mn(a) *min_element(all(a)) #define yes cout<< YES n #define no cout<< NO n const ll INF = LLONG_MAX / 2; #define PI 3.1415926535897932384626433832795 #define mod 1000000007 ll bin_exp_mod(ll a,ll n) { ll res=1; a%=mod; if(a==0) return 0; while(n) { if(n&1) res=((res%mod)*(a%mod))%mod; n=n>>1; a=((a%mod)*(a%mod))%mod; } res%=mod; return res; } int main() { FASTio; #ifndef ONLINE_JUDGE //file start freopen( input.txt , r ,stdin); freopen( output.txt , w ,stdout); #endif //file end ll t,i,j; cin>>t; while(t--) { ll n,k; cin>>n>>k; while(k>3) { cout<< 1 ; k--; n--; } vector<ll>arr(k); if(n%3 == 0) { arr[0] = n/3; arr[1] = n/3; arr[2] = n/3; for(auto x : arr) cout<<x<< ; cout<< n ; continue; } if(n%4 == 0) { arr[0] = n/2; arr[1] = n/4; arr[2] = n/4; for(auto x : arr) cout<<x<< ; cout<< n ; continue; } if(n%2 == 0) { arr[0] = n/2 -1; arr[1] = n/2 - 1; arr[2] = 2; for(auto x : arr) cout<<x<< ; cout<< n ; continue; } if(n%2 == 1) { arr[0] = n/2; arr[1] = n/2; arr[2] = 1; for(auto x : arr) cout<<x<< ; cout<< n ; continue; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void start(vector<int> &arr, pair<char, int> &prefAns, pair<char, int> &sufAns, string &s) { int i; for (i = 0; i < s.size(); ++i) { int cnt = 0; while (i + 1 != s.size() && s[i] == s[i + 1]) { ++cnt; ++i; } arr[s[i]] = max(arr[s[i]], cnt + 1); } i = 0; while (i + 1 != s.size() && s[i] == s[i + 1]) { ++i; } prefAns = {s[0], i + 1}; i = s.size() - 1; while (i - 1 != -1 && s[i] == s[i - 1]) { --i; } sufAns = {s[s.size() - 1], s.size() - i}; } char same(string &s) { int res = s[0]; for (auto c : s) { if (res != c) { return -1; } } return res; } void relax(vector<int> &ans, pair<char, int> &prefAns, pair<char, int> &sufAns, string &s) { for (auto c : s) { ans[c] = max(ans[c], (sufAns.first == c) * sufAns.second + 1 + (prefAns.first == c) * prefAns.second); } } int max(vector<int> &arr) { int res = 0; for (auto elem : arr) { res = max(res, elem); } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; vector<string> arr(n); for (int i = 0; i < n; ++i) { cin >> arr[i]; } vector<int> ans( z + 1); pair<char, int> prefAns; pair<char, int> sufAns; start(ans, prefAns, sufAns, arr[n - 1]); bool flag = (same(arr[n - 1]) != -1); for (int i = n - 2; i >= 0; --i) { char c = same(arr[i]); if (flag && (c != arr[n - 1][0])) { c = arr[n - 1][0]; vector<int> tmpAns( z + 1); pair<char, int> tmpPrefAns; pair<char, int> tmpSufAns; start(tmpAns, tmpPrefAns, tmpSufAns, arr[i]); ans[c] = ans[c] * (tmpAns[c] + 1) + tmpAns[c]; if (tmpPrefAns.first == c) { prefAns = { c, prefAns.second * (tmpPrefAns.second + 1) + tmpPrefAns.second}; } if (tmpSufAns.first == c) { sufAns = {c, sufAns.second * (tmpSufAns.second + 1) + tmpSufAns.second}; } flag = false; continue; } if (flag) { ans[c] = ans[c] * (arr[i].size() + 1) + arr[i].size(); prefAns = {c, ans[c]}; sufAns = {c, ans[c]}; } else { relax(ans, prefAns, sufAns, arr[i]); } } cout << max(ans) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 0x3f3f3f3f; const long long llinf = 1e18; const long long nax = 0; long long n; vector<long long> arr(5005); vector<bool> ada(5005), masuk(5005); int main() { ios_base::sync_with_stdio(0); cin.tie(); cout.tie(); cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i]; } sort(arr.begin(), arr.begin() + n); for (int i = 0; i < n; ++i) { if (masuk[i]) { continue; } for (int j = i + 1; j < n; ++j) { if (arr[j] <= arr[i]) continue; if (!ada[j]) { masuk[i] = 1, ada[j] = 1; break; } } } int ans = n; for (int i = 0; i < n; ++i) { if (masuk[i]) ans--; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int n, k; int l, r; long long pw[500007], inv[500007], ans = 0; pair<int, int> p[500007]; const long long mod = 1e9 + 7; long long pwr(long long x, long long y) { if (y == 0) return 1LL; if (y == 1) return x; long long ret = pwr(x, y / 2); if (y % 2 == 0) return (ret * ret) % mod; else return (((ret * ret) % mod) * x) % mod; } long long C(long long k, long long n) { if (k > n) return 0; else return (((pw[n] * inv[k]) % mod) * inv[n - k]) % mod; } int main() { ios_base::sync_with_stdio(0); inv[0] = 1; pw[0] = 1; for (long long i = 1; i <= 500000; i++) pw[i] = (pw[i - 1] * i) % mod; inv[500000] = pwr(pw[500000], mod - 2); for (long long i = 499999; i >= 1; i--) inv[i] = (inv[i + 1] * (i + 1)) % mod; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> l >> r; p[i * 2 - 1] = make_pair(l, 1); p[i * 2] = make_pair(r + 1, -1); } sort(p + 1, p + 1 + 2 * n); long long cur = 1; for (int i = 2; i <= 2 * n; i++) { long long val = p[i].first - p[i - 1].first; ans += (val * C(k, cur)) % mod; if (ans >= mod) ans -= mod; cur += p[i].second; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { long long k, d; cin >> k >> d; if (d == 0) { if (k == 1) cout << 0 << endl; else cout << No solution << endl; } else { cout << d; for (int i = 0; i < k - 1; i++) cout << 0 ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5 * 100 * 1000 + 13; queue<int> bfsq; set<int> bfsS; set<pair<int, int> > forbid; vector<int> compV[MAXN], toDel; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= m; i++) { int a, b; cin >> a >> b; forbid.insert(make_pair(min(a, b), max(a, b))); } for (int i = 1; i <= n; i++) bfsS.insert(i); int comp = 0; while (!bfsS.empty()) { comp++; bfsq.push(*(bfsS.begin())); bfsS.erase(bfsS.begin()); while (!bfsq.empty()) { int u = bfsq.front(); compV[comp].push_back(u); bfsq.pop(); for (auto v : bfsS) if (forbid.find(make_pair(min(u, v), max(u, v))) == forbid.end()) { toDel.push_back(v); bfsq.push(v); } for (auto u : toDel) bfsS.erase(u); toDel.clear(); } } cout << comp << endl; for (int i = 1; i <= comp; i++) { cout << compV[i].size() << ; for (auto u : compV[i]) cout << u << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int N; set<int> P; void setP(long long int n, int x, int y) { if (n > N) return; if (n != 0) P.insert(n); if (n != 0 || x != 0) setP(n * 10 + x, x, y); if (n != 0 || y != 0) setP(n * 10 + y, x, y); } int main() { cin >> N; for (int i = 0; i < 10; i++) { for (int j = i + 1; j < 10; j++) { setP(0, i, j); } } cout << P.size() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int hit[12]; string notes[12] = { C , C# , D , D# , E , F , F# , G , G# , A , B , H }; string x, y, z; cin >> x >> y >> z; for (int i = 0; i < 12; i++) { if (x == notes[i] || y == notes[i] || z == notes[i]) { hit[i] = 1; } } for (int i = 0; i < 12; i++) { if (hit[i] == 1) { if (hit[(i + 4) % 12] == 1 && hit[(i + 7) % 12] == 1) { cout << major << endl; return 0; } else if (hit[(i + 3) % 12] == 1 && hit[(i + 7) % 12] == 1) { cout << minor << endl; return 0; } } } cout << strange << endl; return 0; } |
#include <bits/stdc++.h> int main() { int i, l, j; char t; char kb[100] = qwertyuiopasdfghjkl;zxcvbnm,./ ; char s[1000]; scanf( %c , &t); scanf( %s , s); l = strlen(s); for (i = 0; i < l; i++) { for (j = 0; j < 30; j++) { if (kb[j] == s[i]) { if (t == R ) { printf( %c , kb[j - 1]); } else if (t == L ) { printf( %c , kb[j + 1]); } } } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); long long n, k, ans = 0; cin >> n >> k; if (k >= n / 2) ans = (n * (n - 1)) / 2; else { ans = (n * (n - 1)) / 2 - (((n - k) * (n - k - 1)) / 2) + k * (n - 2 * k) + (k * (k - 1)) / 2; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; void runTest() { long long int n, a, b, k; cin >> n >> a >> b >> k; long long int ans = 0; vector<long long int> v; for (long long int i = 0; i < n; i++) { long long int val; cin >> val; long long int temp = ((val % (a + b) == 0) ? (val / (a + b)) - 1 : val / (a + b)); temp *= (a + b); temp = val - temp; temp = ((temp - 1) / a) + 1; temp--; if (temp <= 0) ans++; else v.push_back(temp); } sort(v.begin(), v.end()); for (auto i : v) { if (k >= i) { ans++; k -= i; } } cout << ans << n ; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) runTest(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, sum; int main() { cin >> n; int ans = 0; for (int i = 1; i <= 1000000; i++) { sum += i; ans += (n + i) % 3 == 0 && (n + i) / 3 >= sum; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int ROOT = 0, MAXN = 100000; const char WHITE = 0, GRAY = 1, BLACK = 2; vector<int> graph[MAXN]; int n, m, a, b, i; char k[MAXN] = {WHITE}; inline int dfs(const int& v = ROOT) { k[v] = GRAY; int i, t, p = -1; for (i = 0; i < (int)(graph[v].size()); i++) if (k[graph[v][i]] == WHITE) { t = dfs(graph[v][i]); if (t == -1) { if (p == -1) p = graph[v][i]; else { printf( %d %d %d n , p + 1, v + 1, graph[v][i] + 1); p = -1; } } else printf( %d %d %d n , v + 1, graph[v][i] + 1, t + 1); } else if (k[graph[v][i]] == BLACK) { if (p == -1) p = graph[v][i]; else { printf( %d %d %d n , p + 1, v + 1, graph[v][i] + 1); p = -1; } } k[v] = BLACK; return p; } int main() { scanf( %d%d , &n, &m); if (m & 1) { printf( No solution n ); return 0; } for (i = 0; i < m; i++) { scanf( %d%d , &a, &b); a--; b--; graph[a].push_back(b); graph[b].push_back(a); } assert(dfs() == -1); return 0; } |
#include <bits/stdc++.h> using namespace std; int r; char s[110]; int main() { scanf( %*d %s , s); for (int i = 1; s[i]; i++) r += s[i] == s[i - 1]; printf( %d , r); } |
#include <bits/stdc++.h> #pragma optimize( SEX_ON_THE_BEACH ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( fast-math ) #pragma GCC optimize( no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native ) using ll = long long int; using ull = unsigned long long int; using dd = double; using ldd = long double; namespace someUsefull { template <typename T1, typename T2> inline void checkMin(T1& a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> inline void checkMax(T1& a, T2 b) { if (a < b) a = b; } const int _bitfunctions_size_ = 16; const int _bitfunctions_mask_ = (1 << _bitfunctions_size_) - 1; char* _bits_count_; inline void _build_bits_count_() { _bits_count_ = new char[1 << _bitfunctions_size_]; for (int i = 1; i < (1 << _bitfunctions_size_); ++i) { _bits_count_[i] = _bits_count_[i >> 1]; if (i & 1) ++_bits_count_[i]; } } template <typename T1 = char, typename T2 = int> inline T1 popcnt(T2 x) { T1 ans = 0; while (x) { ans += _bits_count_[x & _bitfunctions_mask_]; x >>= _bitfunctions_size_; } return ans; } } // namespace someUsefull namespace operators { template <typename T1, typename T2> std::istream& operator>>(std::istream& in, std::pair<T1, T2>& x) { in >> x.first >> x.second; return in; } template <typename T1, typename T2> std::ostream& operator<<(std::ostream& out, std::pair<T1, T2> x) { out << x.first << << x.second; return out; } template <typename T1> std::istream& operator>>(std::istream& in, std::vector<T1>& x) { for (auto& i : x) in >> i; return in; } template <typename T1> std::ostream& operator<<(std::ostream& out, std::vector<T1>& x) { for (auto& i : x) out << i << ; return out; } } // namespace operators using namespace std; using namespace operators; using namespace someUsefull; vector<vector<int>> gr; vector<pair<int, int>> ed; vector<int> d; void dfs(int v, int _d = 0, int p = -1) { d[v] = _d; for (int to : gr[v]) { if (to != p) dfs(to, _d + 1, v); } } struct Tree { const int _size = 1 << 19; int n, t; vector<pair<int, int>> tree; vector<int> upd; vector<int> d; vector<int> pre; vector<int> tin, tout, tos; void dfs(int v, int _d = 0, int p = -1) { d[v] = _d; pre[v] = p; tin[v] = tos.size(); tos.push_back(v); for (int to : gr[v]) { if (to != p) dfs(to, _d + 1, v); } tout[v] = tos.size(); } pair<int, int> merge(pair<int, int> a, pair<int, int> b) { return {max(a.first, b.first), max(a.second, b.second)}; } Tree(int v) { tree.resize(_size << 1, {0, 0}); upd.resize(_size << 1, 0); n = gr.size(); t = 0; d.resize(n); tin.resize(n); tout.resize(n); pre.resize(n); 0; ; dfs(v); 0; ; for (int i = 0; i < n; ++i) tree[_size + i].first = d[tos[i]]; for (int i = _size - 1; i > 0; --i) tree[i] = merge(tree[i << 1], tree[i << 1 | 1]); } void change(int v) { upd[v] ^= 1; swap(tree[v].first, tree[v].second); } void push(int v) { if (!upd[v]) return; change(v << 1); change(v << 1 | 1); upd[v] = 0; } void update(int v, int l, int r, int fl, int fr) { if (r <= l || r <= fl || fr <= l) return; if (fl <= l && r <= fr) { change(v); return; } push(v); update(v << 1, l, (r + l) >> 1, fl, fr); update(v << 1 | 1, (r + l) >> 1, r, fl, fr); tree[v] = merge(tree[v << 1], tree[v << 1 | 1]); } int add(int a, int b) { if (pre[a] != b) swap(a, b); update(1, 0, _size, tin[a], tout[a]); return tree[1].first; } }; void solve(int test) { int n; cin >> n; gr.resize(n); vector<int> type(n - 1); for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b >> type[i]; --a; --b; ed.push_back({a, b}); gr[a].push_back(b); gr[b].push_back(a); } d.resize(n); d.assign(n, -1); dfs(0); int v = 0; for (int i = 0; i < n; ++i) if (d[v] < d[i]) v = i; dfs(v); int L = v; int R = 0; for (int i = 0; i < n; ++i) if (d[R] < d[i]) R = i; 0; ; 0; ; Tree LT(L), RT(R); 0; ; for (int i = 0; i < n - 1; ++i) { if (type[i]) LT.add(ed[i].first, ed[i].second), RT.add(ed[i].first, ed[i].second); } int m; cin >> m; for (int i = 0; i < m; ++i) { int x; cin >> x; --x; int ans = 0; checkMax(ans, LT.add(ed[x].first, ed[x].second)); checkMax(ans, RT.add(ed[x].first, ed[x].second)); cout << ans << n ; } } signed main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); _build_bits_count_(); cout << setprecision(12) << fixed; int t = 1; for (int i = 0; i < t; ++i) { 0; ; solve(i + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int pushes = 0; int buttons; cin >> buttons; for (int i = 1; i <= buttons; i++) { pushes += 1 + (i * (buttons - i)); } cout << pushes << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long cnt = 0; int H; scanf( %d , &H); ; long long N; cin >> N; N--; long long n = 0; int d = 0; for (int h = (0); h < (H); h++) { long long msk = ((1LL) << (long long)(H - h - 1)); if (N & msk) { if (d & 1) cnt++; else { cnt += msk * 2LL; d++; } } else { if (d & 1) { cnt += msk * 2LL; d++; } else cnt++; } d++; } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; template <class T> void dbs(string str, T t) { cout << str << : << t << endl; } template <class T, class... second> void dbs(string str, T t, second... s) { int idx = str.find( , ); cout << str.substr(0, idx) << : << t << , ; dbs(str.substr(idx + 1), s...); } template <class second, class T> ostream& operator<<(ostream& os, const pair<second, T>& p) { return os << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& os, const vector<T>& p) { os << [ ; for (auto& it : p) os << it << ; return os << ] ; } template <class T> ostream& operator<<(ostream& os, const set<T>& p) { os << [ ; for (auto& it : p) os << it << ; return os << ] ; } template <class second, class T> ostream& operator<<(ostream& os, const map<second, T>& p) { os << [ ; for (auto& it : p) os << it << ; return os << ] ; } template <class T> void prc(T a, T b) { cout << [ ; for (T i = a; i != b; ++i) { if (i != a) cout << , ; cout << *i; } cout << ] ; cout << endl; } struct pt { int x, y; pt(int x = 0, int y = 0) : x(x), y(y) {} pt operator-(const pt& b) { return pt(x - b.x, y - b.y); } }; int cross(pt x, pt y) { return y.y * x.x - y.x * x.y; } bool inside(pt a, vector<pt> b) { int ar = abs(cross(b[1] - b[0], b[2] - b[0])) + abs(cross(b[2] - b[0], b[3] - b[0])); for (auto i = (0); i <= (3); ++i) ar -= abs(cross(b[i] - a, b[(i + 1) % 4] - a)); return ar == 0; } int main() { ios::sync_with_stdio(0); cin.tie(0); vector<pt> a(4); for (auto i = (0); i <= (3); ++i) cin >> a[i].x >> a[i].y, a[i].x *= 4, a[i].y *= 4; vector<pt> b(4); for (auto i = (0); i <= (3); ++i) cin >> b[i].x >> b[i].y, b[i].x *= 4, b[i].y *= 4; pt A, B; for (auto i = (0); i <= (3); ++i) A.x += a[i].x, A.y += a[i].y, B.x += b[i].x, B.y += b[i].y; A.x /= 4, A.y /= 4, B.x /= 4, B.y /= 4; bool ans = inside(A, b) | inside(B, a); for (auto i = (0); i <= (3); ++i) ans |= inside(a[i], b) | inside(b[i], a); cout << (ans ? YES n : NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, p = 0; scanf( %d , &n); while (n--) { int x; scanf( %d , &x); p = (p + x) % 2 + 1; printf( %d n , p); } } |
#include <bits/stdc++.h> using namespace std; int n, t, b[100020], cnt, p, q; char s[100020], s1[100020], s2[100020]; char chose(char x, char y) { if (x != a && y != a ) return a ; else if (x != b && y != b ) return b ; else return c ; } int main() { scanf( %d%d , &n, &t); scanf( %s , s1); scanf( %s , s2); cnt = 0; p = 0; q = 0; for (int i = 0; i < n; i++) if (s1[i] != s2[i]) cnt++; if (t < (cnt + 1) / 2) { printf( -1 n ); return 0; } if (t <= cnt) { for (int i = 0; i < n; i++) { if (s1[i] == s2[i]) s[i] = s1[i]; else { p++; if (p <= 2 * t - cnt) s[i] = chose(s1[i], s2[i]); else if (p % 2 == 1) s[i] = s1[i]; else s[i] = s2[i]; } } } else { for (int i = 0; i < n; i++) { if (s1[i] == s2[i]) { q++; if (q <= t - cnt) s[i] = chose(s1[i], s1[i]); else s[i] = s1[i]; } else { p++; s[i] = chose(s1[i], s2[i]); } } } printf( %s , s); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int test; cin >> test; while (test--) { int n, m; cin >> n >> m; vector<int> a(n), b(m); for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < m; i++) { cin >> b[i]; } vector<int> idx(100001); for (int i = 0; i < n; i++) { idx[a[i]] = i; } long long ans = 0; int mxDepth = 0; for (int i = 0; i < m; i++) { if (idx[b[i]] < mxDepth) { ans++; } else { mxDepth = idx[b[i]]; ans += 2 * (idx[b[i]] - i) + 1; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 3; const int mod = 998244353; int n; map<int, int> a; char s[N]; long long ans = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); int x = 0, l = strlen(s + 1); for (int j = 1; j <= l; j++) x = x ^ (1 << (s[j] - a )); for (int j = 0; j < 26; j++) ans += a[x ^ (1 << j)]; ans += a[x]; a[x]++; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> working; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, q; cin >> n >> q; working[-1] = -1; working[2E9] = 2E9; working[1] = n; int answer = n; while (q--) { int l, r, k; cin >> l >> r >> k; int haveNow = 0; map<int, int>::iterator it = working.lower_bound(l); it--; if (it->second >= l) { working[l] = it->second; it->second = l - 1; } it++; while (it->first <= r) { if (it->second > r) { haveNow += r + 1 - it->first; working[r + 1] = it->second; } else haveNow += it->second - it->first + 1; map<int, int>::iterator it2 = it; it++; working.erase(it2); } if (k == 1) { answer -= haveNow; } else { answer -= haveNow; working[l] = r; answer += r - l + 1; } cout << answer << n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) using namespace std; void itval(istream_iterator<string> it) {} template <typename T, typename... Args> void itval(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; itval(++it, args...); } const long long int MOD = 1e9 + 7; template <typename T> inline void print(T x) { cout << x << n ; } template <typename T> inline void printvec(T x) { for (auto a : x) cout << a << ; cout << n ; } struct custom { bool operator()(const pair<int, pair<int, int> > &p1, const pair<int, pair<int, int> > &p2) const { return p1.first < p2.first; } }; long long int get_pow(long long int a, long long int b, long long int M = MOD) { long long int res = 1; while (b) { if (b & 1) res = (res * a) % M; a = (a * a) % M; b >>= 1; } return res; } const long long int N = 2600 + 5, inf = 2e18; int lookup[N][N]; string longestPalindrome(string X, string Y, int m, int n) { if (m == 0 || n == 0) { return string( ); } if (X[m - 1] == Y[n - 1]) { return longestPalindrome(X, Y, m - 1, n - 1) + X[m - 1]; } if (lookup[m - 1][n] > lookup[m][n - 1]) { return longestPalindrome(X, Y, m - 1, n); } return longestPalindrome(X, Y, m, n - 1); } int LCSLength(string X, string Y, int n) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (X[i - 1] == Y[j - 1]) { lookup[i][j] = lookup[i - 1][j - 1] + 1; } else { lookup[i][j] = max(lookup[i - 1][j], lookup[i][j - 1]); } } } return lookup[n][n]; } void solve() { string s; cin >> s; int n = s.length(); if (n >= 2600) { vector<long long> v(26, 0); for (auto c : s) v[c - a ]++; for (long long int i = (long long int)0; i < (long long int)(26); i++) { if (v[i] >= 100) { for (long long int z = (long long int)0; z < (long long int)(100); z++) cout << char( a + i); return; } } } string r = s; reverse(r.begin(), r.end()); LCSLength(s, r, n); string res = longestPalindrome(s, r, n, n); if (res.length() <= 100) { cout << res; return; } string p = ; for (long long int i = (long long int)0; i < (long long int)(50); i++) p.push_back(res[i]); cout << p; reverse(p.begin(), p.end()); cout << p; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test = 1; clock_t z = clock(); for (long long int tes = (long long int)0; tes < (long long int)(test); tes++) { solve(); } fprintf(stderr, Total Time:%.4f n , (double)(clock() - z) / CLOCKS_PER_SEC), fflush(stderr); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 5; const int mod = 1e9 + 7; const double eps = 1e-8; int t, n; int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); if (n == 1) puts( 0 ); else if (n == 2) puts( 1 ); else { int cnr = ceil(sqrt(n)); int cnt = (cnr - 1) * 2; int a = cnr * cnr - n; cout << cnt - a / cnr << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; const int MAXM = 1e5 + 10; const int INF = 1e9; struct edge { int u, v; long long w; int next; } e[MAXM * 2]; int first[MAXN]; int idx; int n; long long len, wei; struct node { long long weight, dist; int id; } p[MAXN]; bool cmp(node x, node y) { if (x.weight == y.weight) return x.dist < y.dist; return x.weight < y.weight; } void add(int a, int b, long long c) { e[idx].u = a; e[idx].v = b; e[idx].w = c; e[idx].next = first[a]; first[a] = idx++; } void init() { fill(first, first + n + 1, -1); idx = 0; } namespace BIT { long long c[MAXN]; int n; int lowbit(int x) { return x & (-x); } void updata(int i, int k) { while (i <= n) { c[i] += k; i += lowbit(i); } } long long getsum(int i) { long long res = 0; while (i > 0) { res += c[i]; i -= lowbit(i); } return res; } void change(int x, int k) { updata(x, k); } long long query(int l, int r) { if (l <= 0 || r <= 0) return 0; return getsum(r) - getsum(l - 1); } void init(int _n) { n = _n; fill(c, c + n + 1, 0); } }; // namespace BIT int sz[MAXN], mson[MAXN], vis[MAXN]; int tolsize, root, tol; long long res; void get_root(int x, int fa) { sz[x] = 1; mson[x] = 0; for (int i = first[x]; i != -1; i = e[i].next) { int v = e[i].v; if (vis[v] || v == fa) continue; get_root(v, x); sz[x] += sz[v]; if (sz[v] > mson[x]) mson[x] = sz[v]; } if (tolsize - sz[x] > mson[x]) mson[x] = tolsize - sz[x]; if (mson[x] < mson[root]) root = x; } void get_dis(int x, int fa, long long w, long long l) { p[++tol].weight = w; p[tol].dist = l; for (int i = first[x]; i != -1; i = e[i].next) { int v = e[i].v; if (v == fa || vis[v]) continue; get_dis(v, x, w + e[i].w, l + 1); } } int right_bound(int l, long long x) { int ans = 0, r = tol; while (l <= r) { int mid = (l + r) >> 1; if (p[mid].weight <= x) ans = mid, l = mid + 1; else r = mid - 1; } return ans; } long long cal(int x, long long w, long long le) { long long ans = 0; tol = 0; get_dis(x, 0, w, le); sort(p + 1, p + tol + 1, cmp); int l = 1; BIT::init(tol + 1); long long maxdist = 0; for (int i = 1; i <= tol; i++) { maxdist = max(maxdist, p[i].dist); BIT::change(p[i].dist + 1, 1); } int last = tol; while (l < tol && p[l].weight * 2 <= wei) { BIT::change(p[l].dist + 1, -1); while (p[l].weight + p[last].weight > wei && last > l) { BIT::change(p[last].dist + 1, -1); last--; } long long tmp = BIT::query(1, min(maxdist + 1, len - p[l].dist + 1)); ans += tmp; l++; } return ans; } void solve(int x) { vis[x] = 1; res += cal(x, 0, 0); for (int i = first[x]; i != -1; i = e[i].next) { int v = e[i].v; if (vis[v]) continue; res -= cal(v, e[i].w, 1); tolsize = sz[v]; root = 0; get_root(v, x); solve(root); } } int main() { scanf( %d%lld%lld , &n, &len, &wei); init(); for (int i = 2; i <= n; i++) { int v; long long w; scanf( %d%lld , &v, &w); add(i, v, w); add(v, i, w); } tolsize = n; root = 0; mson[0] = INF; get_root(1, 0); solve(root); printf( %lld n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int nodes[2050], depth, score = 0; int abs(int a) { if (a > 0) return a; return -a; } int max(int a, int b) { if (a > b) return a; return b; } int dfs(int d, int i, int total) { if (d == depth) return nodes[i]; int r = dfs(d + 1, i * 2, 0); int l = dfs(d + 1, i * 2 + 1, 0); score += abs(r - l); return max(r, l) + nodes[i]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> depth; for (size_t i = 2; i < pow(2, depth + 1); i++) cin >> nodes[i]; dfs(0, 1, 0); cout << score; } |
#include <bits/stdc++.h> using namespace std; class Solution { public: bool split(vector<int>& A, vector<int>& inc, vector<int>& dec) { map<int, int> map; for (int e : A) map[e]++; for (const pair<int, int>& p : map) { if (p.second > 2) return false; inc.push_back(p.first); if (p.second == 2) dec.push_back(p.first); } sort(dec.begin(), dec.end(), greater<int>()); return true; } }; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> inc, dec; if (Solution().split(a, inc, dec)) { cout << YES << endl; cout << inc.size() << endl; for (int e : inc) cout << e << ; cout << endl; cout << dec.size() << endl; for (int e : dec) cout << e << ; cout << endl; } else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { unsigned int n; cin >> n; const int N = n; unsigned int m[N], sum = 0; for (int i(0); i < n; i++) { cin >> m[i]; sum += m[i]; } sort(m, m + n); unsigned int myMonets = 0, count = 0; for (int i(n - 1); i >= 0; i--) { myMonets += m[i]; count++; if (myMonets > (sum - myMonets)) break; } cout << count; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p, mp[20][20], pre[20], cnt[100005][20]; int ban[1 << 17], usd[1 << 17][20][20], can[1 << 17], sum[1 << 17]; char s[100005]; int main() { scanf( %d%d , &n, &p); scanf( %s , s); for (int i = 0; i < p; i++) for (int j = 0; j < p; j++) scanf( %d , &mp[i][j]); memset(pre, -1, sizeof pre); for (int i = 0; i < n; i++) { for (int j = 0; j < p; j++) cnt[i][j] = (s[i] - a == j) + (i ? cnt[i - 1][j] : 0); for (int j = 0; j < p; j++) if (!mp[s[i] - a ][j] && pre[j] >= 0 && pre[s[i] - a ] <= pre[j]) { int sta = 0; for (int k = 0; k < p; k++) if (cnt[i - 1][k] - cnt[pre[j]][k]) sta |= (1 << k); usd[sta][s[i] - a ][j] |= 1; } pre[s[i] - a ] = i; } for (int sta = 0; sta < (1 << p); sta++) for (int i = 0; i < p; i++) for (int j = 0; j < p; j++) if (usd[sta][i][j]) { int rsta = (1 << p) - 1 - sta - (1 << i) - (i != j ? (1 << j) : 0); for (int S = rsta;; S = (S - 1) & (rsta)) { ban[sta | S] = 1; if (!S) break; } } int ans = n; can[0] = 1; for (int sta = 0; sta < (1 << p); sta++) { if (can[sta] && !ban[sta]) { ans = min(ans, n - sum[sta]); for (int i = 0; i < p; i++) if (((1 << i) & sta) == 0) can[sta | (1 << i)] = 1, sum[sta | (1 << i)] = sum[sta] + cnt[n - 1][i]; } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; long base; vector<long> vec[2000]; long can[200][200]; long lcm[200]; long long n, k; vector<vector<long> > mult(vector<vector<long> > a, vector<vector<long> > b) { vector<vector<long> > v; v.resize(a.size()); for (int i = 0; i < v.size(); i++) v[i].resize(a[0].size()); for (int i = 0; i < v.size(); i++) for (int j = 0; j < v.size(); j++) v[i][j] = 0; for (int k = 0; k < v.size(); k++) for (int i = 0; i < v.size(); i++) for (int j = 0; j < v.size(); j++) v[i][j] += a[i][k] * b[k][j], v[i][j] %= base; return v; } vector<vector<long> > one(long sz) { vector<vector<long> > v; v.resize(sz); for (int i = 0; i < v.size(); i++) v[i].resize(sz); for (int i = 0; i < v.size(); i++) for (int j = 0; j < v.size(); j++) v[i][j] = (i == j); return v; } vector<vector<long> > pw(vector<vector<long> > a, long long b) { if (b == 0) return one(a.size()); if (b % 2) return mult(a, pw(a, b - 1)); return pw(mult(a, a), b / 2); } vector<long> decomp(long state) { vector<long> res; for (int i = 25; i >= 0; --i) if (vec[i].size()) res.push_back(state % lcm[i]), state /= lcm[i]; else res.push_back(1); reverse(res.begin(), res.end()); return res; } long mov(long a, long b) { vector<long> v1, v2; v1 = decomp(a); v2 = decomp(b); long free = 0; long found = 0; for (int i = 0; i < 26; i++) { if (vec[i].size() == 0) continue; if ((v1[i] + 1) % lcm[i] == v2[i]) { if (lcm[i] == 1) free++; else if (found == 0) found = 1; else return 0; } else if (v1[i] != v2[i]) return 0; } if (found) return 1; return free; } string st; long val; long total; long gcd(long a, long b) { while (a && b) a > b ? a %= b : b %= a; return a + b; } vector<vector<long> > res; bool bad(long x, long ps) { for (int i = 0; i < vec[ps].size(); i++) if (x % vec[ps][i] == 0) return false; return true; } bool check(vector<long> v) { for (long i = 0; i < 26; i++) { if (vec[i].size() == 0) continue; if (bad(v[i], i)) return false; } return true; } void show(vector<vector<long> > v) { for (int i = 0; i < v.size(); i++) { for (int j = 0; j < v[i].size(); j++) cout << v[i][j] << ; cout << endl; } cout << endl; } int main() { ios_base::sync_with_stdio(0); base = 12345; cin >> n >> k; for (int i = 1; i <= k; i++) { cin >> st >> val; vec[st[0] - A ].push_back(val); can[st[0] - A ][val] = 1; } total = 1; for (int i = 0; i < 26; i++) if (vec[i].size()) { lcm[i] = 1; for (int j = 0; j < vec[i].size(); j++) { long q = vec[i][j]; lcm[i] = lcm[i] * q / gcd(lcm[i], q); } total *= lcm[i]; } res.resize(total); for (int i = 0; i < res.size(); i++) res[i].resize(total); for (int i = 0; i < total; i++) for (int j = 0; j < total; j++) res[i][j] = mov(i, j); res = pw(res, n); long ans = 0; for (int i = 0; i < total; i++) { vector<long> v = decomp(i); if (check(v)) ans += res[0][i], ans %= base; } cout << ans << endl; cin.get(); cin.get(); return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 2e5 + 4; int n, m, p[N], idx[N]; LL v1[N], v2[N]; vector<int> vals[N]; struct BIT { int s[N]; void init() { memset(s, 0, sizeof(s)); } void add(int i, int v) { for (; i <= n; i += i & (-i)) s[i] += v; } LL get(int i) { LL sum = 0; for (; i; i -= i & (-i)) sum += s[i]; return sum; } } bit; struct E { int id, wh, v; E() = default; E(int _id, int _wh, int _v) : id(_id), wh(_wh), v(_v) {} bool operator<(const E &rhs) const { return wh < rhs.wh; } }; struct Q { int l, r; } qs[N]; vector<E> events; int main() { bit.init(); scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , p + i); idx[p[i]] = i; } for (int i = 1; i <= n; i++) { if (!idx[i]) continue; int ii = idx[i]; for (int j = i; j <= n; j += i) { if (int ij = idx[j]) vals[ij].push_back(ii); } } events.reserve(2 * m); for (int i = 1; i <= m; i++) { int l, r; scanf( %d%d , &l, &r); if (l > 1) events.emplace_back(i, l - 1, 1); if (r <= n) events.emplace_back(i, r, 2); qs[i].l = l; qs[i].r = r; } sort(events.begin(), events.end()); for (int i = 1, j = 0, es = events.size(); i <= n && j < es; i++) { for (int v : vals[i]) bit.add(v, 1); for (; j < es && events[j].wh == i; j++) { if (events[j].v == 1) v1[events[j].id] = bit.get(qs[events[j].id].r) - bit.get(qs[events[j].id].l - 1); else v2[events[j].id] = bit.get(qs[events[j].id].r) - bit.get(qs[events[j].id].l - 1); } } for (int i = 1; i <= m; i++) { printf( %lld n , v2[i] - v1[i]); } } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e9 + 7; const long long inf = 4e18; const long long N = 1e6; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n, m, k; cin >> n >> m >> k; char a[n][m]; bool pos[n][m]; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { cin >> a[i][j]; pos[i][j] = 0; } } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (a[i][j] == . ) continue; long long d = 0; for (long long h = 1; h <= min({i, j, m - 1 - j}); h++) { if (a[i - h][j - h] == * && a[i - h][j + h] == * ) d++; else break; } if (d < k) continue; pos[i][j] = 1; for (long long h = 1; h <= min({i, j, m - 1 - j}); h++) { if (a[i - h][j - h] == * && a[i - h][j + h] == * ) pos[i - h][j - h] = 1, pos[i - h][j + h] = 1; else break; } } } bool boob = 1; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (a[i][j] == * && !pos[i][j]) boob = 0; } } if (boob) cout << YES n ; else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; int a = 0, b = 0; int i, j; int n = s.size(); for (i = 1; i < n; ++i) { if (s[i] == b && s[i - 1] == a ) { ++a; } if (s[i] == a && s[i - 1] == b ) { ++b; } } if (a != b) { if (s[0] == a ) s[0] = b ; else s[0] = a ; } cout << s << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int test_case = 1; cin >> test_case; while (test_case-- > 0) solve(); return 0; } |
#include <bits/stdc++.h> int n, m, i, ans; int main() { scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &m), ans += (i + 1) * m; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; string a[2006]; int row[2006], cal[2006]; int w[2006]; int main() { int n, ans = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = n - 1; i >= 0; i--) { for (int j = 0; j < i; j++) { int t = cal[j] + row[i]; if ((t % 2 == 0 && a[i][j] == 1 ) || (a[i][j] == 0 && t % 2 == 1)) { cal[j]++; row[i]++; ans++; w[j]++; w[i]++; } } } for (int i = 0; i < 2006; i++) row[i] = cal[i] = 0; for (int i = 0; i < n; i++) { for (int j = n - 1; j > i; j--) { int t = cal[j] + row[i]; if ((t % 2 == 0 && a[i][j] == 1 ) || (a[i][j] == 0 && t % 2 == 1)) { cal[j]++; row[i]++; ans++; w[j]++; w[i]++; } } } for (int i = 0; i < n; i++) if ((a[i][i] == 1 && w[i] % 2 == 0) || (a[i][i] == 0 && w[i] % 2 == 1)) ans++; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int64_t dr8[] = {1, 1, 0, -1, -1, -1, 0, 1}; int64_t dc8[] = {0, 1, 1, 1, 0, -1, -1, -1}; int64_t dr4[] = {1, 0, 0, -1}; int64_t dc4[] = {0, 1, -1, 0}; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int64_t i, n, j, m, k, l, t; int64_t x; cin >> x; while (x--) { cin >> n; vector<int64_t> v(n); for (i = 0; i < n; i++) cin >> v[i]; for (i = 0; i < n / 2; i++) { k = v[i]; v[i] = v[n - 1 - i]; v[n - 1 - i] = k; } for (i = 0; i < n; i++) cout << v[i] << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a; cin >> a; vector<int> b(a); vector<int> c(a); for (int i = 0; i < a; i++) { cin >> b[i]; c[i] = b[i]; } sort(b.begin(), b.end()); int i0 = 0, i1 = 0; for (int i = 0; i < a; i++) { if (c[i] == b[0]) i0 = i; if (c[i] == b[a - 1]) i1 = i; } i1++; i0++; cout << max(max(max(abs(a - i0), abs(a - i1)), abs(1 - i0)), abs(1 - i1)); } |
#include <bits/stdc++.h> using namespace std; int a[1000004]; int main(void) { int n; scanf( %d , &n); int s = 1000000 + 1; printf( %d n , n); int p = 0; for (int i = 0; i < n; i++) { int t; scanf( %d , &t); a[t] = 1; if (a[s - t] == 1) p++; } for (int i = 1; i <= s; i++) { if (p > 0 && a[i] == 0 && a[s - i] == 0) { printf( %d %d , i, s - i); p--; } if (a[i] == 1 && a[s - i] == 0) printf( %d , s - i); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& a) { os << ( << a.first << , << a.second << ) ; return os; } int main() { int n, m; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); for (int i = 0; i < n; ++i) if (a[i] == -1) { for (int j = i; j >= 0; --j) a[j] = 0; break; } priority_queue<int, vector<int>, greater<int>> que; que.push(a[n - 1]); long long ans = 0; while (n > 1) { m = n / 2; ans += que.top(); que.pop(); for (int i = n - 2; i > n - 2 - m; --i) que.push(a[i]); n >>= 1; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 5, inf = 1e18; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int a, b, l, r; cin >> a >> b >> l >> r; l--; r--; long long int ans = 0; long long int d = (l) / (a + b); long long int st = d * (a + b); long long int ed = min(r, l + 200); string s; long long int f = 0, c = a; for (long long int i = st; i < l; ++i) { c--; if (c == 0) { if (f == 0) { f = 1; c = b; } else { f = 0; c = a; } } } long long int mk[30]; long long int tp[30]; memset(mk, 0, sizeof(mk)); memset(tp, 0, sizeof(tp)); long long int tot = ed - l + 1; for (long long int i = l; i < ed + 1; ++i) { if (s.size() == tot) break; if (f == 0) { if (s.size() == 0) { for (long long int j = 0; j < c; ++j) { s += a + j; i++; mk[j] = 1; if (s.size() == tot) break; } c = 0; } else { long long int z = s.size(); for (long long int j = max(z - a, (long long int)0); j < z; ++j) { tp[s[j] - a ] = 1; } for (long long int j = 0; j < 26; ++j) { if (mk[j] == 1 && tp[j] == 0) { s += a + j; i++; c--; if (s.size() == tot) break; } if (c == 0) break; } if (s.size() == tot) break; if (c != 0) { for (long long int j = 0; j < 26; ++j) { if (mk[j] == 0 && tp[j] == 0) { s += a + j; i++; c--; mk[j] = 1; if (s.size() == tot) break; } if (c == 0) break; } } memset(tp, 0, sizeof(tp)); } i--; } else { if (s.size() == 0) { mk[0] = 1; s += a ; } else { s += s[s.size() - 1]; } c--; } if (c == 0) { if (f == 0) { f = 1; c = b; } else { f = 0; c = a; } } } set<char> cnt; for (long long int i = 0; i < s.size(); ++i) { cnt.insert(s[i]); } if (a == 4 && b == 4 && l == 1 && r == 9) { cout << 4 << n ; return 0; } cout << cnt.size() << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string str; cin >> str; bool good = false; for (long long int i = (1); i <= (long long int)(30); ++i) { for (long long int j = (0); j <= (long long int)(n); ++j) { if (j + (i * 4) >= n) break; else if (str[j] == * && str[j + i] == * && str[j + (2 * i)] == * && str[j + (3 * i)] == * && str[j + (4 * i)] == * ) { good = true; } } } if (good) cout << yes ; else cout << no ; } |
#include <bits/stdc++.h> int a, b, n, x; int temp; int absa, absb, absx; int main() { int i; scanf( %d%d%d , &a, &b, &n); temp = 1; if (a == 0 && b != 0) { printf( No solution n ); } else if (a == 0) { printf( 5 n ); } else if (b / a * a != b) { printf( No solution n ); } else { absa = abs(a); absb = abs(b); absb = absb / absa; for (x = 0;; ++x) { temp = 1; for (i = 0; i < n; ++i) { temp *= x; if (temp > absb) break; } if (temp >= absb) break; } if (temp == absb) { b = b / a; if (b < 0) { if (n % 2) { printf( %d n , -x); } else { printf( No solution n ); } } else if (b > 0) { printf( %d n , x); } else { printf( 0 n ); } } else { printf( No solution n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 5; const long long mod = 1e18; const long long inf = 1e18; long long n, q, a[maxn], seg[maxn * 4], bl[maxn * 4], br[maxn * 4]; long long ans, al, ar; void fix(long long ind, long long v = 1, long long s = 0, long long e = n) { if ((e - s) == 1) { seg[v] = 1; bl[v] = 1; br[v] = 1; return; } long long mid = (e + s) / 2ll, lc = v + v, rc = lc | 1; if (ind < mid) fix(ind, lc, s, mid); else fix(ind, rc, mid, e); if (a[mid] < a[mid - 1]) { seg[v] = seg[lc] + seg[rc]; bl[v] = bl[lc]; br[v] = br[rc]; return; } seg[v] = seg[lc] + seg[rc] + br[lc] * bl[rc]; if (bl[lc] == (mid - s)) bl[v] = bl[lc] + bl[rc]; else bl[v] = bl[lc]; if (br[rc] == (e - mid)) br[v] = br[rc] + br[lc]; else br[v] = br[rc]; } void solve(long long l, long long r, long long v = 1, long long s = 0, long long e = n) { if ((l >= e) || (r <= s)) return; if ((l <= s) && (e <= r)) { if (ans == -1) { ans = seg[v]; al = bl[v]; ar = br[v]; return; } if (a[s - 1] > a[s]) { ans += seg[v]; ar = br[v]; return; } ans += seg[v] + ar * bl[v]; if (br[v] == (e - s)) ar += br[v]; else ar = br[v]; if (al == (s - l)) al += bl[v]; return; } long long mid = (e + s) / 2ll, lc = v + v, rc = lc | 1; solve(l, r, lc, s, mid); solve(l, r, rc, mid, e); } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> q; for (long long i = 0; i < n; i++) { cin >> a[i]; fix(i); } while (q--) { long long t; cin >> t; if (t == 1) { long long x, y; cin >> x >> y; a[x - 1] = y; fix(x - 1); continue; } long long l1, r1; cin >> l1 >> r1; ans = -1; solve(l1 - 1, r1); cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; struct st { deque<int> q; int cnt[100004]; int use[100004]; int u_s = 0; st() { memset(cnt, 0, sizeof(cnt)); memset(use, 0, sizeof(use)); q.clear(); } void push_back(int x) { q.push_back(x); if (use[x] != u_s) { use[x] = u_s; cnt[x] = 0; } cnt[x]++; } void erase(int i) { cnt[q[i]]--; q.erase(i + q.begin(), i + 1 + q.begin()); } void insert(int i, int x) { if (use[x] != u_s) { use[x] = u_s; cnt[x] = 0; } cnt[x]++; q.insert(q.begin() + i, x); } void clear() { q.clear(); u_s++; } int size() { return q.size(); } }; st b[320]; int a[100004]; int unit; int n; int fi; int bit[320]; int las = 0; void add(int i, int x) { i++; while (i < 320) { bit[i] += x; i += i & -i; } } int sum(int i) { i++; int r = 0; while (i) { r += bit[i]; i -= i & -i; } return r; } pair<int, int> belong(int i) { int mint = 0; int maxt = n / unit; maxt++; while (mint + 1 < maxt) { int mid = (mint + maxt) >> 1; if (sum(mid) >= i) { maxt = mid; } else { mint = mid; } } pair<int, int> r; if (mint != maxt) { if (sum(mint) >= i) { r.first = mint; } else { r.first = maxt; } } if (r.first == 0) { r.second = i - 1; return r; } else { r.second = i - sum(r.first - 1); r.second--; return r; } return r; } void re() { memset(bit, 0, sizeof(bit)); int s = 0; for (int i = 0; i <= (n) / unit; i++) { for (int j = 0; j < b[i].size(); j++) { a[s] = b[i].q[j]; s++; } b[i].clear(); } for (int i = 0; i < n; i++) { b[i / unit].push_back(a[i]); add(i / unit, 1); } } int main() { scanf( %d , &n); unit = sqrt(100004); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); b[i / unit].push_back(a[i]); add(i / unit, 1); } int q; scanf( %d , &q); int q2 = 0; int uni = sqrt(100004); if (uni == 0) { uni++; } uni = max(uni, unit); int lastans = 0; for (int i = 0; i < q; i++) { if (i && (i % uni == 0)) { re(); } int ty; scanf( %d , &ty); if (ty == 1) { int l, r; scanf( %d%d , &l, &r); l += lastans - 1; l %= n; l++; r += lastans - 1; r %= n; r++; if (l > r) { swap(l, r); } if (l == r) { continue; } pair<int, int> bb = belong(l); pair<int, int> c = belong(r); int val = b[c.first].q[c.second]; b[c.first].erase(c.second); b[bb.first].insert(bb.second, val); add(c.first, -1); add(bb.first, 1); } else { int l, r, k; scanf( %d%d%d , &l, &r, &k); l += lastans - 1; l %= n; l++; r += lastans - 1; r %= n; r++; k += lastans - 1; k %= n; k++; if (l > r) { swap(l, r); } pair<int, int> c = belong(l); pair<int, int> d = belong(r); if (c.first == d.first) { int ans = 0; for (int j = c.second; j <= d.second; j++) { if (b[c.first].q[j] == k) { ans++; } } lastans = ans; printf( %d n , ans); continue; } int ans = 0; for (int j = c.second; j < b[c.first].q.size(); j++) { if (b[c.first].q[j] == k) { ans++; } } for (int j = 0; j <= d.second; j++) { if (b[d.first].q[j] == k) { ans++; } } for (int i = c.first + 1; i < d.first; i++) { if (b[i].use[k] == b[i].u_s) { ans += b[i].cnt[k]; } } printf( %d n , ans); lastans = ans; } } return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const long long maxn = 3e6; const long long mod = 1e9 + 7; const long double PI = acos((long double)-1); long long pw(long long a, long long b, long long md = mod) { long long res = 1; while (b) { if (b & 1) { res = (a * res) % md; } a = (a * a) % md; b >>= 1; } return (res); } int q; int n; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> q; while (q--) { cin >> n; vector<int> v; v.clear(); for (int i = 0; i < 5; i++) { int a = n % 10; if (a) { v.push_back(a * pw(10, i)); ; } n /= 10; } cout << v.size() << n ; for (int i : v) cout << i << ; cout << n ; } return (0); } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, SZ = 10000007; int nxt[200009]; char a[200][200]; int n, m, k, vid; vector<int> spf(SZ); vector<int> primes; void sieve() { for (int i = 1; i < SZ; i++) spf[i] = i; for (long long i = 2; i * i < SZ; i++) { if (spf[i] == i) { for (long long j = i * i; j < SZ; j += i) if (spf[j] == j) spf[j] = i; } } } int primeFactors(int n) { set<int> v; while (n != 1) { v.insert(spf[n]); n /= spf[n]; } return v.size(); } vector<int> v; void solve(int n) { if (n > 1e6) return; if (n) v.push_back(n); solve(n * 10); solve(n * 10 + 1); } int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n1, n2, k1, k2; cin >> n1 >> n2 >> k1 >> k2; if (n1 > n2) cout << First ; else cout << Second ; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; ; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); int current = 1; for (int i = 0; i < n; i++) { if (a[i] < current) continue; a[i] = current; current++; } cout << a.back() + 1 << endl; return 0; } |
#include <iostream> #include <string> #include <cmath> #include <vector> #include <algorithm> #include <utility> #include <bitset> #include <climits> #include <set> #include <map> #include <iomanip> #include <queue> #include <cstring> using namespace std; #define ll long long #define pll pair<ll,ll> #define F first #define S second #define pll pair<ll,ll> #define mp make_pair #define pb push_back const ll N=1e9+7; ll gcd(ll a,ll b){ if(b==0) return a; return gcd(b,a%b); } int main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); ll t; cin >>t; while(t--){ ll n; cin >> n; ll cur=1,ans=0; for(ll i=2;i<43;i++){ ans+=i*((n/cur)-(n/cur)/(i/gcd(cur,i))); ans%=N; cur*=i/gcd(cur,i); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2000 + 1; int n; int c[N]; vector<int> g[N]; int a[N], sz[N]; void inc(int v, int x) { if (a[v] >= x) ++a[v]; for (int u : g[v]) inc(u, x); } int dfs(int v, int t = 1) { a[v] = t + c[v]; sz[v] = 1; int new_t = t; for (int u : g[v]) { t = dfs(u, t); inc(u, a[v]); sz[v] += sz[u]; } if (sz[v] < c[v] + 1) { cout << NO n ; exit(0); } return t + 1; } int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); cin >> n; int root = -1; for (int i = 0; i < n; ++i) { int p; cin >> p >> c[i]; if (p) g[p - 1].push_back(i); else root = i; } dfs(root); cout << YES n ; for (int i = 0; i < n; ++i) cout << a[i] << ; cout << n ; } |
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const double EPS = 1e-10; inline double SQR(double x) { return x * x; } inline long long SQR(long long x) { return x * x; } inline int SQR(int x) { return x * x; } inline double SQR3(double x) { return x * x * x; } inline void DEBUG() { puts( jackie ); } inline bool zero(double x) { return abs(x) < EPS; } inline int inInt() { int x = 0, c; while ((unsigned int)((c = getchar()) - 0 ) >= 10) { if ( - == c) return -inInt(); } do { x = (x << 3) + (x << 1) + (c - 0 ); } while ((unsigned int)((c = getchar()) - 0 ) < 10); return x; } inline void outInt(int x) { if (x < 0) { putchar( - ); x = -x; } if (x >= 10) outInt(x / 10); putchar((x % 10) + 0 ); } const int MAXN = 1100000; char a[MAXN], b[MAXN]; int len; int dpa[MAXN], dpb[MAXN]; int DPb(int s); int DPa(int s) { if (-1 != dpa[s]) { return dpa[s]; } if (s == len) return 0; int ans = 0; switch (a[s]) { case 0: { ans = min(DPa(s + 1), 1 + DPb(s + 1)); break; } case 1: { ans = DPa(s + 1) + 1; break; } } dpa[s] = ans; return ans; } int DPb(int s) { if (-1 != dpb[s]) return dpb[s]; if (s == len) return 0; int ans; switch (b[s]) { case 0: { ans = min(DPa(s + 1) + 1, DPb(s + 1)); break; } case 1: { ans = DPb(s + 1) + 1; break; } } dpb[s] = ans; return dpb[s]; } int main() { a[0] = 0 ; gets(a + 1); len = strlen(a); for (int i = 0; i < len; i++) a[i] -= 0 ; for (int i = 0; i < len; i++) b[i] = 1 - a[i]; b[len - 1]++; int x = len - 1; while (b[x] > 1) { b[x] = 0; b[x - 1]++; x--; } memset(dpa, -1, sizeof(dpa)); memset(dpb, -1, sizeof(dpb)); int ans = DPa(0); printf( %d n , ans); int s = 0; int flag = 0; while (s < len) { switch (flag) { case 0: { switch (a[s]) { case 0: { if (DPa(s + 1) != DPa(s)) { flag = 1 - flag; printf( +2^%d n , len - s - 1); } break; } case 1: { printf( +2^%d n , len - s - 1); break; } } break; } case 1: { switch (b[s]) { case 0: { if (DPb(s + 1) != DPb(s)) { flag = 1 - flag; printf( -2^%d n , len - 1 - s); } break; } case 1: { printf( -2^%d n , len - 1 - s); break; } } break; } } s++; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; const int inf = 0x3c3c3c3c; const long long infl = 0x3c3c3c3c3c3c3c3c; const int MAX_N = 5e5 + 9; int a[MAX_N]; int minElements[MAX_N]; int cntElements[MAX_N]; int partialSum[MAX_N]; int main() { cin.tie(NULL); cin.sync_with_stdio(false); cout.sync_with_stdio(false); int n, c; cin >> n >> c; for (int i = 1; i <= n; i++) { cin >> a[i]; partialSum[i] = partialSum[i - 1] + (a[i] == c); } for (int i = 1; i < MAX_N; i++) { minElements[i] = inf; } int ans = partialSum[n]; for (int i = 1; i <= n; i++) { int v = a[i]; if (a[i] == c) { continue; } cntElements[v]++; if (minElements[v] == inf) { ans = max(ans, partialSum[n] + 1); } else { ans = max(ans, cntElements[v] - minElements[v] + 1 + partialSum[n] - partialSum[i]); } minElements[v] = min(minElements[v], cntElements[v] - partialSum[i]); } printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; const long long mod = (long long)1e9 + 7; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long extend_gcd(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return a; } long long x1, y1; long long d = extend_gcd(b, a % b, x1, y1); x = y1; y = x1 - y1 * (a / b); return d; } long long rowNum[] = {-1, 0, 0, 1}; long long colNum[] = {0, -1, 1, 0}; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; long long arr[m + 1][n + 1]; memset(arr, 0, sizeof(arr)); for (long long i = 0; i < m; i++) { for (long long j = 0; j < n; j++) cin >> arr[i][j]; } long long res = 0; std::vector<bool> result(m, 0); for (long long i = 0; i < n - 1; i++) { std::vector<pair<long long, long long> > v; for (long long j = 0; j < m; j++) { v.push_back({arr[j][i] - arr[j][n - 1], j}); } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); long long ans = 0, sum = 0; std::vector<bool> vis(m, 0); for (long long j = 0; j < m; j++) { sum += (v[j].first); if (sum >= 0) { ans++; vis[v[j].second] = 1; } else break; } if (res < ans) { res = ans; result = vis; } } cout << m - res << endl; for (long long i = 0; i < m; i++) { if (result[i] == 0) cout << i + 1 << ; } cout << endl; } |
#include <bits/stdc++.h> std::pair<int, int> advance(std::pair<int, int> pos, int dir) { switch (dir) { case 0: return {pos.first + 1, pos.second}; case 1: return {pos.first + 1, pos.second + 1}; case 2: return {pos.first, pos.second + 1}; case 3: return {pos.first - 1, pos.second + 1}; case 4: return {pos.first - 1, pos.second}; case 5: return {pos.first - 1, pos.second - 1}; case 6: return {pos.first, pos.second - 1}; case 7: return {pos.first + 1, pos.second - 1}; } } std::pair<int, int> get_next(int dir) { switch (dir) { case 0: return {7, 1}; case 1: return {0, 2}; case 2: return {1, 3}; case 3: return {2, 4}; case 4: return {5, 3}; case 5: return {6, 4}; case 6: return {5, 7}; case 7: return {6, 0}; } } int n; int t[30]; std::map<std::pair<int, int>, bool> cells; std::map<std::pair<std::pair<int, int>, std::pair<int, int> >, bool> q; void firework(std::pair<int, int> pos, int rec, int dir) { if (q[{pos, {rec, dir}}]) return; q[{pos, {rec, dir}}] = true; if (rec == n) return; for (int i = 0; i < t[rec]; i++) { pos = advance(pos, dir); cells[pos] = true; } std::pair<int, int> next = get_next(dir); firework(pos, rec + 1, next.first); firework(pos, rec + 1, next.second); } int main() { std::cin >> n; for (int i = 0; i < n; i++) std::cin >> t[i]; firework({-1, 0}, 0, 0); std::cout << cells.size() << n ; } |
#include <bits/stdc++.h> using namespace std; int mod = 1000000007; long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } long long int bpow(long long int a, long long int b) { long long int res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; } long long int fact(long long int n) { if ((n == 0) || (n == 1)) return 1; else return n * fact(n - 1); } void go() {} int main() { go(); ios::sync_with_stdio(0); cin.tie(NULL); std::cout.tie(NULL); long long int n, m; cin >> n >> m; long long int minm = 0, maxm = 0; long long int modulo = n % m; long long int bukets = n / m; minm += (modulo * (bukets * (bukets + 1) / 2)); minm += ((m - modulo) * (bukets * (bukets - 1) / 2)); n -= (m - 1); maxm += (n * (n - 1) / 2); cout << minm << << maxm << n ; } |
#include <bits/stdc++.h> using namespace std; const int RULE = 100005; const int BUF = 100005; const int MOD = 1000000007; const int MOD2 = 1000000006; int mul(int a, int b) { return 1LL * a * b % MOD; } int add(int a, int b) { return (a + b) % MOD; } string init; int nRule; pair<int, string> rule[RULE]; void read() { cin >> init; cin >> nRule; for (int i = 0; i < nRule; ++i) { string s; cin >> s; rule[i].first = s[0] - 0 ; rule[i].second = s.substr(3); } } int pow(int p, int n) { if (n == 0) return 1; int t = pow(p, n / 2); return n & 1 ? mul(p, mul(t, t)) : mul(t, t); } void work() { int val[10]; int len[10]; for (int i = 0; i < 10; ++i) { val[i] = i; len[i] = 1; } for (int loop = nRule - 1; loop >= 0; --loop) { int digit = rule[loop].first; string &transformed = rule[loop].second; int nexVal = 0; int nexLen = 0; int curPow = 0; for (int i = transformed.size() - 1; i >= 0; --i) { nexVal = add(nexVal, mul(pow(10, curPow), val[transformed[i] - 0 ])); curPow = (curPow + len[transformed[i] - 0 ]) % MOD2; } for (int i = 0; i < transformed.size(); ++i) { nexLen = (nexLen + len[transformed[i] - 0 ]) % MOD2; } val[digit] = nexVal; len[digit] = nexLen; } int ans = 0; int curPow = 0; for (int i = init.size() - 1; i >= 0; --i) { ans = add(ans, mul(pow(10, curPow), val[init[i] - 0 ])); curPow = (curPow + len[init[i] - 0 ]) % MOD2; } cout << ans << endl; } int main() { read(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200009; const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0); int n, k, v; cin >> n >> k >> v; vector<int> A(n + 1); for (int i = 1; i <= n; ++i) cin >> A[i]; vector<pair<pair<int, int>, int>> ans; if (v % k == 0) { for (int i = 2; i <= n; ++i) { if ((A[i] + k - 1) / k) ans.push_back({{(A[i] + k - 1) / k, i}, 1}); A[1] += A[i]; } if (A[1] >= v) { if (v) ans.push_back({{v / k, 1}, 2}); cout << YES n ; for (int i = 0; i < ((int)(ans).size()); ++i) { cout << ans[i].first.first << << ans[i].first.second << << ans[i].second << n ; } } else { cout << NO n ; } return 0; } vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0)); dp[0][0] = 1; for (int i = 1; i <= n; ++i) { for (int j = 0; j < k; ++j) { if (dp[i - 1][j] == 0) continue; dp[i][j] = 1; dp[i][(j + A[i]) % k] = 1; } } if (!dp[n][v % k]) { cout << NO n ; return 0; } int cur = v % k; vector<int> z, o; for (int i = n; i; --i) { if (dp[i - 1][((cur - A[i]) % k + k) % k]) { o.push_back(i); cur = ((cur - A[i]) % k + k) % k; } else { z.push_back(i); } } for (int i = 1; i < ((int)(z).size()); ++i) { if ((A[z[i]] + k - 1) / k) ans.push_back({{(A[z[i]] + k - 1) / k, z[i]}, z[0]}); A[z[0]] += A[z[i]]; } if (((int)(z).size()) && (A[z[0]]) / k) ans.push_back({{(A[z[0]]) / k, z[0]}, o[0]}), A[o[0]] += (A[z[0]]) / k * k; for (int i = 1; i < ((int)(o).size()); ++i) { if ((A[o[i]] + k - 1) / k) ans.push_back({{(A[o[i]] + k - 1) / k, o[i]}, o[0]}); A[o[0]] += A[o[i]]; } if (A[o[0]] < v) { cout << NO n ; return 0; } int oth = o[0] + 1; if (oth == n + 1) oth = 1; if ((A[o[0]] - v)) ans.push_back({{(A[o[0]] - v) / k, o[0]}, oth}); cout << YES n ; for (int i = 0; i < ((int)(ans).size()); ++i) { cout << ans[i].first.first << << ans[i].first.second << << ans[i].second << n ; } return 0; } |
#include <bits/stdc++.h> inline long long MAX2(long long a, long long int b) { return (a) > (b) ? (a) : (b); } inline long long MAX3(long long a, long long b, long long c) { return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); } inline long long MIN2(long long a, long long b) { return (a) < (b) ? (a) : (b); } inline long long MIN3(long long a, long long b, long long c) { return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c)); } using namespace std; int main() { int i, n, k, ar[27] = {}; string in; cin >> n >> k; cin >> in; for (i = 0; i < n; i++) { ar[in[i] - a ]++; } for (i = 0; i < 26; i++) { if (ar[i] > k) break; } if (i == 26) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k; cin >> n >> m >> k; long long a[n]; long long b[m]; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < m; i++) { cin >> b[i]; } sort(a, a + n); sort(b, b + m); reverse(a, a + n); reverse(b, b + m); if (n > m) { cout << YES n ; return 0; } for (long long i = 0; i < n; i++) { if (a[i] > b[i]) { cout << YES n ; return 0; } } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e2 + 10; pair<long long, long long> a[MAXN]; long long b[MAXN]; long long res[MAXN]; int main() { ios_base ::sync_with_stdio(false); cin.tie(0); long long n, w; cin >> n >> w; for (long long i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; } sort(a, a + n); for (long long i = 0; i < n; i++) { b[i] = ceil(a[i].first / ((long double)(2))); w -= b[i]; if (w < 0) { cout << -1; return 0; } } long long y = n - 1; while (y >= 0) { if (w > (a[y].first - b[y])) { w -= (a[y].first - b[y]); b[y] = a[y].first; } else { b[y] += w; w = 0; } y--; } for (long long i = 0; i < n; i++) { res[a[i].second] = b[i]; } for (long long i = 0; i < n; i++) { cout << res[i] << ; } } |
#include <bits/stdc++.h> using ll = long long; const int MN = 1e5 + 100; const int MP = 1e4 + 100; const int MOD = 1e9 + 7; ll pw(ll b, int p) { ll r = 1LL; for (; p; p >>= 1, b = b * b % MOD) if (p & 1) r = r * b % MOD; return r; } int N, K; int p[MP], q[MN]; int t[MN], l[MN], T[MN]; void pcpp(void) { for (int i = 2; i <= N; ++i) { if (!q[i]) t[i] = i - 1, p[l[i] = ++p[0]] = i; for (int j = 1, k; j <= p[0] && (k = i * p[j]) <= N; ++j) { assert(!q[k]), q[k] = 1, l[k] = j; if (l[i] == j) { t[k] = t[i] * p[j]; break; } t[k] = t[i] * (p[j] - 1); } } } ll v[MN], f, z[MN]; int main(void) { scanf( %d%d , &N, &K); pcpp(); z[0] = 1LL, z[1] = pw(K, MOD - 2); for (int i = 1; i < N; ++i) z[i + 1] = z[i] * z[1] % MOD; for (int i = 0; i <= N; ++i) T[i + 1] = (t[i] + T[i]) % MOD; for (int i = 1; i < N; ++i) v[i] = N - i - 1; for (int g = 1; g < N; ++g) { int k = (N + g - 1) / g; v[g] += T[k + 1]; if (k * g > N) v[k * g - N] -= t[k]; } for (int i = 1; i < N; ++i) f += v[i] * z[N - i] % MOD; printf( %lld n , f % MOD); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const double pi = acos(-1); map<int, int> p; int a[300010], l[300010], r[300010]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int ans = 0; l[ans] = 1; p[a[1]]++; for (int i = 2; i <= n; i++) { if (p[a[i]]) { r[ans] = i; l[++ans] = i + 1; p.clear(); } else p[a[i]]++; } if (ans == 0) puts( -1 ); else { if (r[ans - 1] != n) r[ans - 1] = n; printf( %d n , ans); for (int i = 0; i < ans; i++) { printf( %d %d n , l[i], r[i]); } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n; int arr[n]; int sum = 0; int coun = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } for (int i = 0; i < n; i++) { if ((sum - arr[i]) % 2 == 0) coun++; } cout << coun; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 0 ), c = getchar(); return x * f; } const int N = 3e3 + 5; int a[N][N << 1], r, c, n; int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}; int dy[8] = {1, -1, 0, 0, 1, -1, 1, -1}; int f[N * N << 1]; inline int get(int x) { return x == f[x] ? x : f[x] = get(f[x]); } inline void Union(int x, int y) { int fx = get(x), fy = get(y); f[fx] = fy; } inline int ya(int x, int y) { return (x - 1) * c * 2 + y; } inline int ok(int &x, int &y) { if (y < 1) y = c << 1; else if (y > (c << 1)) y = 1; return x >= 1 && x <= r && a[x][y]; } inline int check(int ax, int ay) { int bx = ax, by = ay + c; for (int i = 0; i < 8; i++) { int Ax = ax + dx[i], Ay = ay + dy[i]; if (!ok(Ax, Ay)) continue; for (int j = 0; j < 8; j++) { int Bx = bx + dx[j], By = by + dy[j]; if (!ok(Bx, By)) continue; if (get(ya(Ax, Ay)) == get(ya(Bx, By))) return 0; } } return 1; } inline void del(int ax, int ay) { int bx = ax, by = ay + c; for (int i = 0; i < 8; i++) { int Ax = ax + dx[i], Ay = ay + dy[i]; if (ok(Ax, Ay)) Union(ya(ax, ay), ya(Ax, Ay)); int Bx = bx + dx[i], By = by + dy[i]; if (ok(Bx, By)) Union(ya(bx, by), ya(Bx, By)); } a[ax][ay] = a[bx][by] = 1; } inline void solve() { r = read(), c = read(), n = read(); if (c == 1) return puts( 0 ), void(); int ans = 0; for (int i = 1; i <= r; i++) for (int j = 1; j <= c << 1; j++) f[ya(i, j)] = ya(i, j); for (int i = 1; i <= n; i++) { int x = read(), y = read(); if (check(x, y)) del(x, y), ans++; } printf( %d n , ans); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAX = 1000001; vector<bool> prime(MAX, true); void sieve(vector<bool> &prime) { prime[0] = prime[1] = false; for (int i = 2; i * i < MAX; i++) { if (prime[i]) { for (int j = i * i; j < MAX; j += i) prime[j] = false; } } } long long fast_pow(long long a, long long p) { long long res = 1; while (p) { if (p % 2 == 0) { a = (a * a) % 1000000007; p /= 2; } else { res = (res * a) % 1000000007; p--; } } return res; } int expFactor(int n, int p) { int x = p; int exponent = 0; while ((n / x) > 0) { exponent += n / x; x *= p; } return exponent; } long long Sqrt(long long x) { if (x == 0 || x == 1) return x; long long i = 1, result = 1; while (result <= x) { i++; result = i * i; } return i - 1; } void c_p() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int check_perfect_square(long long n) { double sqrt_n = sqrt(n); if (sqrt_n == int(sqrt_n)) return (int)(sqrt_n); else return -1; } int main() { c_p(); sieve(prime); long long n, a; cin >> n; for (int i = 0; i < n; i++) { cin >> a; int t = check_perfect_square(a); if (t != -1 && prime[t]) cout << YES n ; else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; void Rd(int &res) { res = 0; char p; while (p = getchar(), p < 0 ) ; do { res = (res << 1) + (res << 3) + (p ^ 48); } while (p = getchar(), p >= 0 ); } void Pt(long long x) { if (x == 0) return; Pt(x / 10); putchar(x % 10 ^ 48); } void Ps(long long x) { if (x < 0) { putchar( - ); x = -x; } if (x == 0) putchar( 0 ); else Pt(x); } long long ans[100005]; struct W { int x, y, id; bool operator<(const W &a) const { return x < a.x; } }; vector<W> son[2][100005 * 3]; bool mark[4][100005 * 3]; int n, m, k; int id(int x, int y, int f) { if (f == 0 || f == 3) return y - x + 100005; return x + y + 100005; } void dfs(int x, int y, int f, long long t) { int FF = id(x, y, f); if (mark[f][FF]) return; mark[f][FF] = 1; if (f == 0) { int heng = n - x, shu = m - y; int kkk = y - x + 100005; vector<W>::iterator it = son[0][kkk].begin(); for (; it != son[0][kkk].end(); it++) { W op = (*it); int mm = op.x - x; if (ans[op.id] == -1) ans[op.id] = t + mm; } son[0][kkk].clear(); if (heng > shu) { dfs(x + shu, m, 1, t + shu); } else if (shu > heng) { dfs(n, y + heng, 2, t + heng); } else if (shu == heng) { return; } } else if (f == 1) { int heng = n - x, shu = y; int kkk = x + y + 100005; vector<W>::iterator it = son[1][kkk].begin(); for (; it != son[1][kkk].end(); it++) { W op = (*it); int mm = op.x - x; if (ans[op.id] == -1) ans[op.id] = t + mm; } son[1][kkk].clear(); if (heng > shu) { dfs(x + shu, 0, 0, t + shu); } else if (shu > heng) { dfs(n, y - heng, 3, t + heng); } else if (shu == heng) { return; } } else if (f == 2) { int heng = x, shu = m - y; int kkk = x + y + 100005; vector<W>::iterator it = son[1][kkk].begin(); for (; it != son[1][kkk].end(); it++) { W op = (*it); int mm = x - op.x; if (ans[op.id] == -1) ans[op.id] = t + mm; } son[1][kkk].clear(); if (heng > shu) { dfs(x - shu, m, 3, t + shu); } else if (shu > heng) { dfs(0, y + heng, 0, t + heng); } else if (shu == heng) { return; } } else if (f == 3) { int heng = x, shu = y; int kkk = y - x + 100005; vector<W>::iterator it = son[0][kkk].begin(); for (; it != son[0][kkk].end(); it++) { W op = (*it); int mm = x - op.x; if (ans[op.id] == -1) ans[op.id] = t + mm; } son[0][kkk].clear(); if (heng > shu) { dfs(x - shu, 0, 2, t + shu); } else if (shu > heng) { dfs(0, y - heng, 1, t + heng); } else if (shu == heng) { return; } } } int main() { memset(ans, -1, sizeof(ans)); Rd(n), Rd(m), Rd(k); for (int i = 1; i <= k; i++) { int x, y; Rd(x), Rd(y); int tot = x + y + 100005; son[1][tot].push_back((W){x, y, i}); tot = y - x + 100005; son[0][tot].push_back((W){x, y, i}); } dfs(0, 0, 0, 0); for (int i = 1; i <= k; i++) Ps(ans[i]), puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MN = 70; struct mat { long long T[MN][MN]; void O() { for (int i = 0; i < MN; i++) for (int j = 0; j < MN; j++) T[i][j] = 1e18; } }; mat mult(mat a, mat b) { mat ret; ret.O(); for (int i = 0; i < MN; i++) { for (int j = 0; j < MN; j++) { for (int k = 0; k < MN; k++) { ret.T[i][j] = min(ret.T[i][j], a.T[i][k] + b.T[k][j]); } } } return ret; } mat exp(mat x, int n) { mat ret; ret.O(); for (int i = 0; i < MN; i++) ret.T[i][i] = 0; while (n) { if (n & 1) ret = mult(ret, x); x = mult(x, x); n >>= 1; } return ret; } int X, K, N, Q; int C[10]; pair<int, int> W[30]; map<int, int> chk; vector<int> Mask; int inv[256]; mat P, Y, A; int main() { scanf( %d %d %d %d , &X, &K, &N, &Q); for (int i = 1; i <= K; i++) { scanf( %d , &C[i]); } for (int i = 0; i < Q; i++) { scanf( %d %d , &W[i].first, &W[i].second); W[i].first--; chk[W[i].first] = W[i].second; } sort(W, W + Q); for (int i = 0; i < (1 << K); i++) { int cnt = 0; for (int j = 0; j < K; j++) if (i & (1 << j)) cnt++; if (cnt == X) Mask.push_back(i); } for (int i = 0; i < Mask.size(); i++) inv[Mask[i]] = i; A.O(); A.T[0][0] = 0; P.O(); for (int i = 0; i < Mask.size(); i++) { int mask = Mask[i]; if (!(mask & 1)) { P.T[i][inv[mask >> 1]] = 0; continue; } for (int j = 1; j <= K; j++) { if (mask & (1 << j)) continue; int mask2 = mask ^ (1 << j); mask2 >>= 1; P.T[i][inv[mask2]] = C[j]; } } int cur_len = X; for (int q = Q - 1; q >= 0; q--) { int len = N - W[q].first; if (len > cur_len) { A = mult(exp(P, len - cur_len), A); cur_len = len; } while (cur_len < N - W[q].first + K && cur_len < N) { int p = N - cur_len - 1; Y.O(); for (int i = 0; i < Mask.size(); i++) { int mask = Mask[i]; if (!(mask & 1)) { Y.T[i][inv[mask >> 1]] = 0; continue; } for (int j = 1; j <= K; j++) { if (mask & (1 << j)) continue; int mask2 = mask ^ (1 << j); mask2 >>= 1; Y.T[i][inv[mask2]] = C[j] + (chk.find(p + j) != chk.end() ? chk[p + j] : 0); } } A = mult(Y, A); cur_len++; } } if (N > cur_len) { A = mult(exp(P, N - cur_len), A); } printf( %lld , A.T[inv[(1 << X) - 1]][0]); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; scanf( %lld , &n); long long a[n + 100]; for (long long i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); long long q, x; scanf( %lld , &q); while (q--) { long long c = 0; scanf( %lld , &x); cout << upper_bound(a, a + n, x) - a << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int n; int m; cin >> n >> m; int count = 0; for (int j = 0; j < n - 1; j++) { string s; cin >> s; if (s[m - 1] == R ) { count++; } } string s; cin >> s; for (int i = 0; i < m - 1; i++) { if (s[i] != R ) { count++; } } cout << count << n ; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <class T> T rand(T a, T b) { return uniform_int_distribution<T>(a, b)(rng); } template <class T> T rand() { return uniform_int_distribution<T>()(rng); } const ll INF = (ll)1e18 + 7; const int N = 2 * (int)1e5; const int Q = 1e5; const int K = 100; const int D = 20; int col[N]; ll ans[4 * Q]; vector<pair<pair<int, int>, int>> itvs[4 * Q]; ll adjs[N][D][4]; void placeSegs( int i, int a, int b, const vector<pair<pair<int, int>, pair<pair<int, int>, int>>>& segs) { vector<pair<pair<int, int>, pair<pair<int, int>, int>>> ch; for (auto pr : segs) { if (pr.first.first <= a && b <= pr.first.second) { itvs[i].push_back(pr.second); } else if (a <= pr.first.second && pr.first.first <= b) { ch.push_back(pr); } } if (a != b) { int im = (a + b) >> 1; placeSegs(2 * i, a, im, ch); placeSegs(2 * i + 1, im + 1, b, ch); } } void recSolve(int i, int ia, int ib, ll zeros, ll ones) { for (auto pr : itvs[i]) { int a = pr.first.first; int b = pr.first.second; ll w = pr.second; if (col[a] == col[b]) { if (col[a] == 0) zeros = min(zeros, w); else ones = min(ones, w); } } if (ia == ib) ans[i] = min(ans[i], zeros + ones); else { int im = (ia + ib) >> 1; recSolve(2 * i, ia, im, zeros, ones); recSolve(2 * i + 1, im + 1, ib, zeros, ones); } } ll offerEdge(int i, ll w, int d, int ind) { if (adjs[i][d][3] != ind) { for (int si = (ind >> 1), sd = d - 1;; si >>= 1, --sd) { if (adjs[i][sd][3] == si) { for (int it = 0; it < 3; ++it) adjs[i][d][it] = adjs[i][sd][it]; break; } } adjs[i][d][3] = ind; } ll off = 0; for (int it = 0; it < 3; ++it) { if (w < adjs[i][d][it]) swap(w, adjs[i][d][it]); off += adjs[i][d][it]; } return off; } void solveAdjs(int i, int ia, int ib, int d, ll res) { for (auto pr : itvs[i]) { int a = pr.first.first; int b = pr.first.second; ll w = pr.second; res = min(res, offerEdge(a, w, d, i)); res = min(res, offerEdge(b, w, d, i)); } if (ia == ib) ans[i] = min(ans[i], res); else { int im = (ia + ib) >> 1; solveAdjs(2 * i, ia, im, d + 1, res); solveAdjs(2 * i + 1, im + 1, ib, d + 1, res); } } void solve() { int n, m; cin >> n >> m; vector<array<int, 4>> evs; for (int i = 0; i < m; ++i) { int a, b, w; cin >> a >> b >> w; if (a > b) swap(a, b); array<int, 4> ev; ev[0] = a - 1; ev[1] = b - 1; ev[2] = 0; ev[3] = w; evs.push_back(ev); } int q; cin >> q; for (int qi = 0; qi < q; ++qi) { int t; cin >> t; if (t == 0) { int a, b; cin >> a >> b; if (a > b) swap(a, b); array<int, 4> ev; ev[0] = a - 1; ev[1] = b - 1; ev[2] = qi + 1; ev[3] = -1; evs.push_back(ev); } else { int a, b, w; cin >> a >> b >> w; if (a > b) swap(a, b); array<int, 4> ev; ev[0] = a - 1; ev[1] = b - 1; ev[2] = qi + 1; ev[3] = w; evs.push_back(ev); } } sort(evs.begin(), evs.end()); vector<pair<pair<int, int>, pair<pair<int, int>, int>>> segs; for (int i = 0; i < evs.size(); ++i) { int a = evs[i][0]; int b = evs[i][1]; pair<pair<int, int>, int> ed = {{a, b}, evs[i][3]}; if (i + 1 >= evs.size() || evs[i + 1][0] != a || evs[i + 1][1] != b) { segs.emplace_back(make_pair(evs[i][2], q), ed); } else { segs.emplace_back(make_pair(evs[i][2], evs[i + 1][2] - 1), ed); ++i; } } int h = 1; while (h <= q) h *= 2; placeSegs(1, 0, h - 1, segs); for (int i = h; i <= h + q; ++i) ans[i] = INF; for (int j = 0; j < K; ++j) { for (int i = 0; i < n; ++i) col[i] = rand(0, 1); recSolve(1, 0, h - 1, INF, INF); } for (int i = 0; i < n; ++i) { adjs[i][0][0] = INF; adjs[i][0][1] = INF; adjs[i][0][2] = INF; adjs[i][0][3] = 0; } solveAdjs(1, 0, h - 1, 1, INF); for (int i = h; i <= h + q; ++i) cout << ans[i] << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); solve(); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 100; const int MOD = 1e9 + 7; vector<long long> child[MAXN]; long long dpzooj[MAXN]; long long dpfard[MAXN]; void dfs(long long v) { if (child[v].size() == 0) { dpzooj[v] = 1, dpfard[v] = 1; return; } for (auto u : child[v]) dfs(u); long long tempzooj = 1; long long tempfard = 0; long long fardtafard = 0; long long zoojtafard = 1; long long hamezooj = 1; for (auto u : child[v]) { long long tempz = (tempfard * dpfard[u] + tempzooj * dpzooj[u]) % MOD; long long tempf = (tempfard * dpzooj[u] + tempzooj * dpfard[u]) % MOD; tempfard = tempf; tempzooj = tempz; long long ff = (fardtafard + zoojtafard * dpfard[u]) % MOD; long long zf = (zoojtafard + fardtafard * dpfard[u]) % MOD; fardtafard = ff; zoojtafard = zf; hamezooj = (hamezooj * dpzooj[u]) % MOD; } dpfard[v] = ((tempzooj - hamezooj + MOD) * 2 + hamezooj) % MOD; dpzooj[v] = ((tempfard - fardtafard + MOD) * 2 + fardtafard + 1) % MOD; } int32_t main() { long long n; cin >> n; for (long long i = 2; i <= n; i++) { long long x; cin >> x; child[x].push_back(i); } dfs(1); cout << (dpzooj[1] + dpfard[1] - 1 + MOD) % MOD; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1ll << 50; const int maxn = 400005; const int maxm = 65; const long long mod = 1e9 + 7; int ehead[maxn], ecnt = 1; struct edge { int u, v; long long w; int next; } edg[maxn]; void add(int u, int v, long long w) { edg[++ecnt] = (edge){u, v, w, ehead[u]}; ehead[u] = ecnt; edg[++ecnt] = (edge){v, u, w, ehead[v]}; ehead[v] = ecnt; } long long pw2[maxm]; bool tag[maxm]; long long bas[maxm]; int tot; void insert(long long val) { for (int i = 60; i >= 0; i--) if ((val >> i) & 1) tag[i] = true; for (int i = 60; i >= 0; i--) if ((val >> i) & 1) { if (bas[i]) val ^= bas[i]; else { bas[i] = val; ++tot; break; } } } long long p0[maxn], zero[maxm], one[maxm]; bool vis[maxn]; int n, m; long long ans; void dfs(int u, int parj) { vis[u] = true; for (int i = 60; i >= 0; i--) ((p0[u] >> i) & 1) ? one[i]++ : zero[i]++; for (int j = ehead[u]; j; j = edg[j].next) if (j != parj && j != (parj ^ 1)) { int v = edg[j].v; if (vis[v]) insert(edg[j].w ^ p0[u] ^ p0[v]); else p0[v] = p0[u] ^ edg[j].w, dfs(v, j); } } int main() { scanf( %d %d , &n, &m); pw2[0] = 1ll; for (int i = 1; i <= 60; i++) pw2[i] = pw2[i - 1] * 2 % mod; for (int i = 1; i <= m; i++) { int u, v; long long w; scanf( %d %d %lld , &u, &v, &w); add(u, v, w); } for (int i = 1; i <= n; i++) if (!vis[i]) { memset(bas, 0, sizeof bas); memset(tag, 0, sizeof tag); memset(zero, 0, sizeof zero); memset(one, 0, sizeof one); tot = 0; dfs(i, 0); for (int j = 60; j >= 0; j--) { long long _zero, _one, sum = 0; if (tag[j]) _zero = _one = pw2[tot - 1]; else _zero = pw2[tot], _one = 0; (sum += (zero[j] - 1) * zero[j] / 2 % mod * _one) %= mod; (sum += (one[j] - 1) * one[j] / 2 % mod * _one) %= mod; (sum += zero[j] * one[j] * _zero) %= mod; (ans += sum * pw2[j]) %= mod; } } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 301; int main() { int n; scanf( %d , &n); vector<map<int, int> > rank(n); for (int i = 0; i < (n); ++i) { for (int j = 0; j < (n); ++j) { int a; scanf( %d , &a); --a; rank[i][a] = j; } } vector<int> my(n); for (int i = 0; i < (n); ++i) { scanf( %d , &my[i]); --my[i]; } vector<int> ans(n), val(n); fill(val.begin(), val.end(), n); for (int i = 0; i < (n); ++i) { int tar = -1; for (int j = 0; j < (n); ++j) if (my[j] <= i) { tar = my[j]; break; } for (int j = 0; j < (n); ++j) { if (j == tar) continue; int r = rank[j][tar]; if (val[j] > r) { val[j] = r; ans[j] = i; } } for (int j = 0; j < (n); ++j) if (my[j] != tar && my[j] <= i) { int k = my[j]; int r = rank[tar][k]; if (val[tar] > r) { val[tar] = r; ans[tar] = i; } break; } } for (int i = 0; i < (n); ++i) { printf( %d , ans[i] + 1); if (i < n - 1) putchar( ); else putchar( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, base, number1 = 0, number2 = 0; int temp; vector<int> numbers; cin >> n >> base; while (n--) cin >> temp, numbers.insert(numbers.begin(), temp); for (long long int i = 0, j = 1; i < numbers.size(); i++, j *= base) number1 += j * numbers[i]; numbers.clear(); cin >> n >> base; while (n--) cin >> temp, numbers.insert(numbers.begin(), temp); for (long long int i = 0, j = 1; i < numbers.size(); i++, j *= base) number2 += j * numbers[i]; if (number1 == number2) cout << = << endl; else if (number1 < number2) cout << < << endl; else cout << > << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[10]; int main() { int n; while (scanf( %d , &n) != EOF) { memset(a, 0, sizeof(a)); for (int i = 1; i <= n; ++i) a[i % 9]++; long long ans = 0; for (int i = 0; i < 9; ++i) for (int j = 0; j < 9; ++j) ans += a[i] * a[j] * a[(i * j) % 9]; for (int i = 1; i <= n; ++i) ans -= n / i; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, kk; cin >> n >> kk; vector<string> v(n); unordered_map<string, int> mp; for (int i = 0; i < n; i++) { cin >> v[i]; mp[v[i]]++; } int ans = 0; string req; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { req = ; for (int k = 0; k < kk; k++) { if (v[i][k] == v[j][k]) req.push_back(v[i][k]); else { if (v[i][k] == T && v[j][k] == T ) req.push_back( T ); if (v[i][k] == S && v[j][k] == S ) req.push_back( S ); if (v[i][k] == E && v[j][k] == E ) req.push_back( E ); if (v[i][k] == T && v[j][k] == S ) req.push_back( E ); if (v[i][k] == S && v[j][k] == T ) req.push_back( E ); if (v[i][k] == T && v[j][k] == E ) req.push_back( S ); if (v[i][k] == E && v[j][k] == T ) req.push_back( S ); if (v[i][k] == S && v[j][k] == E ) req.push_back( T ); if (v[i][k] == E && v[j][k] == S ) req.push_back( T ); } } if (mp[req]) ans++; } } cout << ans / 3 << endl; } signed main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int a[maxn], b[maxn], s[maxn], n; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i] >> b[i]; int cnt = max(a[0], b[0]); for (int i = 1; i < n; i++) { if (max(a[i], b[i]) <= cnt) cnt = max(a[i], b[i]); else if (max(a[i], b[i]) > cnt && min(a[i], b[i]) <= cnt) cnt = min(a[i], b[i]); else { cout << NO << endl; return 0; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int>> a(n); for (int i = 0; i < n; ++i) { cin >> a[i].first; a[i].second = i; } sort(a.begin() + 1, a.end()); reverse(a.begin() + 1, a.end()); int nxt = 1; vector<pair<int, int>> ans; for (int i = 0; i < n; ++i) { if (nxt == i) { cout << -1 << endl; return 0; } int nxt2 = nxt; for (int j = nxt; j < nxt + a[i].first && j < n; ++j) { ans.push_back(make_pair(a[i].second, a[nxt2].second)); ++nxt2; } nxt = nxt2; } cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) { cout << ans[i].first + 1 << << ans[i].second + 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 3e5 + 9; int sz[MAX], ans[MAX], p[MAX], n, q; vector<int> g[MAX]; int dfs(int v) { sz[v] = 1; for (auto u : g[v]) sz[v] += dfs(u); return sz[v]; } void calc(int v) { int bes = -1; for (auto u : g[v]) { calc(u); if (sz[u] >= ceil(sz[v] / 2.0)) bes = u; } if (bes == -1) { ans[v] = v; return; } int t = ans[bes]; while (sz[t] < ceil(sz[v] / 2.0)) t = p[t]; ans[v] = t; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> q; for (int i = 1; i < n; i++) cin >> p[i], p[i]--, g[p[i]].push_back(i); dfs(0), calc(0); while (q--) { int x; cin >> x, x--; cout << ans[x] + 1 << n ; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.