func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long int MOD = 1000000007; void solve() { int p, f; cin >> p >> f; if (f > p) swap(p, f); int cs, cw; cin >> cs >> cw; int s, w; cin >> s >> w; if (w > s) { swap(w, s); swap(cs, cw); } int maxv = 0; for (int x = 0; x <= min(cw, f / w); x++) { int curr = x; int fr = f - x * w; int pr = p; int csr = cs; int cwr = cw - x; int t = min(csr, fr / s); curr += t; csr -= t; curr += min(cwr, pr / w); pr -= min(cwr, pr / w) * w; curr += min(csr, pr / s); maxv = max(maxv, curr); } cout << maxv << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt = 1; cin >> tt; for (int ttt = 1; ttt <= tt; ttt++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int t, n, m, l, a[100001], i, check, p, d; bool b[100001]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> l; t = 0; fill(b + 1, b + 1 + n, false); for (i = 1; i <= n; i++) { cin >> a[i]; if (a[i] > l) { if (i - 1 == 0 || (i - 1 > 0 && b[i - 1] == false)) t++; b[i] = true; } } for (i = 1; i <= m; i++) { cin >> check; if (check == 0) cout << t << n ; else { cin >> p >> d; a[p] += d; if (a[p] > l && b[p] == false) { if (p > 1 && p < n) { if (b[p - 1] == true && b[p + 1] == true) { if (t > 1) t--; } else if (b[p - 1] == false && b[p + 1] == false) { if (t < n) t++; } } else if (p == 1) { if (b[p + 1] == false) { if (t < n) t++; } } else if (p == n) { if (b[p - 1] == false) { if (t < n) t++; } } b[p] = true; } } } } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-6; vector<int> mp[105], ans; char s[105][105]; int len[105], tmp[30]; queue<int> q; bool solve(int x, int y) { for (int i = 0; i < len[x] && i < len[y]; i++) { if (s[x][i] != s[y][i]) { mp[s[x][i] - a ].push_back(s[y][i] - a ); tmp[s[y][i] - a ]++; return true; } } if (len[x] > len[y]) return false; } bool ok() { for (int i = 0; i < 26; i++) if (tmp[i] == 0) { ans.push_back(i); q.push(i); } while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 0; i < mp[u].size(); i++) { int v = mp[u][i]; tmp[v]--; if (tmp[v] == 0) { q.push(v); ans.push_back(v); } } } return ans.size() == 26; } int main() { int n; while (~scanf( %d , &n)) { for (int i = 1; i <= n; i++) { scanf( %s , s[i]); len[i] = strlen(s[i]); } bool flag = 0; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (!solve(i, j)) flag = 1; if ((!flag) && ok()) { for (int i = 0; i < 26; i++) printf( %c , ans[i] + a ); printf( n ); } else printf( Impossible n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double a, b, c, delta, x1, x2; cin >> a >> b >> c; delta = b * b - 4.0 * a * c; delta = sqrt(delta); x1 = (-b + delta) / (2.0 * a); x2 = (-b - delta) / (2.0 * a); if (x1 < x2) swap(x1, x2); cout << fixed << setprecision(8) << x1 << endl << fixed << setprecision(8) << x2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long gcd(unsigned long long a, unsigned long long b) { if (b == 0) { return a; } return gcd(b, a % b); } int main() { unsigned long long n, m, k; cin >> n >> m >> k; unsigned long long h = 2 * n * m; if (h % k == 0) { cout << YES << endl; bool isKEven = false; if (k % 2 == 0) { isKEven = true; k /= 2; } int y1 = 0, x2 = 0, x3 = 0, y3 = 0; unsigned long long gx = gcd(n, k); k /= gx; unsigned long long x1 = n / gx; unsigned long long gy = gcd(m, k); k /= gy; unsigned long long y2 = m / gy; if (!isKEven) { if (x1 < n) { x1 *= 2; } else { y2 *= 2; } } cout << x1 << << y1 << endl; cout << x2 << << y2 << endl; cout << x3 << << y3 << endl; } else { cout << NO ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); int c[n]; memset(c, 0, sizeof(c)); while (m--) { int x, y = 0, p = 0; for (int i = 0; i < n; i++) { scanf( %d , &x); if (x > y) { y = x; p = i; } } c[p]++; } int y = 0, p; for (int i = 0; i < n; i++) { if (c[i] > y) { y = c[i]; p = i; } } printf( %d , p + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int dp(int a, int b, int row) { if (row == 1 && a < 3 && b >= 3) { return -1; } if (row == 0 && a < 3 && b >= 3) { return 0; } if (row == 1 && a < 3 && b < 3) { return 1; } if (row == 0 && a < 3 && b < 3) { return 0; } if (row == 1 && a >= 3 && b >= 3) { return 0; } if (row == 0 && a >= 3 && b >= 3) { return 1; } if (row == 1 && a >= 3 && b < 3) { return 1; } if (row == 0 && a >= 3 && b < 3) { return -1; } else { return -1; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; string arr, brr; cin >> arr; cin >> brr; int x = dp(arr[0] - 0 , brr[0] - 0 , 0); for (int i = 1; i < n; i++) { x = dp(arr[i] - 0 , brr[i] - 0 , x); if (x == -1) { break; } } if (x != 1) { cout << NO << n ; } else { cout << YES << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const long long linf = 1LL << 62; const int mod = 1e9 + 7; const int MAX = 510000; const int V = 100005; struct UnionFind { vector<long long> p; vector<long long> rank; vector<long long> cnt; UnionFind(long long n) { rank.resize(n, 0); p.resize(n, 0); cnt.resize(n, 1); for (long long i = 0; i < (n); i++) { p[i] = i; rank[i] = 0; cnt[i] = 1; } } long long find(long long x) { if (x != p[x]) p[x] = find(p[x]); return p[x]; } bool same(long long x, long long y) { return find(x) == find(y); } void unite(long long x, long long y) { x = find(x); y = find(y); if (x == y) return; if (rank[x] > rank[y]) { p[y] = x; cnt[x] += cnt[y]; } else { p[x] = y; cnt[y] += cnt[x]; if (rank[x] == rank[y]) rank[y]++; } } long long getcnt(long long x) { return cnt[find(x)]; } }; int main() { long long q; cin >> q; while (q--) { long long n; cin >> n; UnionFind uf(n); for (long long i = 0; i < (n); i++) { long long a; cin >> a; a--; uf.unite(i, a); } for (long long i = 0; i < (n); i++) cout << uf.getcnt(i) << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int fx[] = {+1, -1, +0, +0}, fy[] = {+0, +0, +1, -1}; const long long mod = 1e9 + 7, INF = 1e18, mx = 1e6; int Case = 1, cas = 0; string S; struct exo { int Open, Close, SubLen; exo() {} exo(int a, int b, int c) { Open = a, Close = b, SubLen = c; } } tree[3 * mx + 5]; exo Combine(exo p, exo q) { int mn = min(p.Open, q.Close); int a = p.Open + q.Open - mn; int b = p.Close + q.Close - mn; int c = p.SubLen + q.SubLen + 2 * mn; return exo(a, b, c); } void build(int node, int L, int R) { if (L > R) return; if (L == R) { if (S[L] == ( ) tree[node] = exo(1, 0, 0); else tree[node] = exo(0, 1, 0); return; } int mid = (L + R) >> 1; int Left = node << 1; int Right = Left | 1; build(Left, L, mid); build(Right, mid + 1, R); tree[node] = Combine(tree[Left], tree[Right]); } exo query(int node, int L, int R, int i, int j) { if (i > R || j < L) return exo(0, 0, 0); if (i <= L && R <= j) return tree[node]; int mid = (L + R) >> 1; int Left = node << 1; int Right = Left | 1; exo p = query(Left, L, mid, i, j); exo q = query(Right, mid + 1, R, i, j); return Combine(p, q); } int main() { ios_base ::sync_with_stdio(0), cin.tie(0); ; cin >> S; int n = S.size(); build(1, 0, n - 1); int Q; cin >> Q; while (Q--) { int L, R; cin >> L >> R; L--, R--; cout << query(1, 0, n - 1, L, R).SubLen << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, ans; vector<int> v[100010]; int main() { cin >> n >> m; for (int i = 1; i <= m; ++i) { int x, y; scanf( %d%d , &x, &y); v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= n; ++i) ans += v[i].size() % 2; ans /= 2; for (int i = 1; i <= n; ++i) { if (v[i].size() != 2) continue; int x = v[i][0], y = v[i][1]; if (x == y) { v[x].clear(); ++ans; continue; } v[x][v[x][1] == i] = y; v[y][v[y][1] == i] = x; } cout << ans << << m << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s = , s1 = , tmp; cin >> tmp; s += tmp; cin >> tmp; reverse(tmp.begin(), tmp.end()); s += tmp; cin >> tmp; s1 += tmp; cin >> tmp; reverse(tmp.begin(), tmp.end()); s1 += tmp; s.erase(s.find( X ), 1); s1.erase(s1.find( X ), 1); s += s; int i = 0; while (s[i] != s1[0]) i++; if (s.substr(i, 3) == s1) { cout << YES << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 150001; int t[MAX_N]; int main() { int n, k, q; cin >> n >> k >> q; for (int i = 0; i < n; ++i) { cin >> t[i]; } set<int> s; for (int i = 0; i < q; ++i) { int x, y; cin >> x >> y; if (x == 1) { s.insert(-t[y - 1]); if (s.size() > k) { auto it = s.begin(); for (int j = 0; j < k; ++j) it++; s.erase(it); } } else { cout << (s.find(-t[y - 1]) == s.end() ? NO : YES ) << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int v, w; } a[100005]; bool cmp(node a, node b) { return a.v > b.v; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d%d , &a[i].v, &a[i].w); sort(a, a + n, cmp); int ma = a[0].w; for (int i = 1; i < n; i++) { if (a[i].w > ma) { printf( Happy Alex n ); return 0; } ma = min(ma, a[i].w); } printf( Poor Alex n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long ll(long double x) { return x; } int main() { int n; cin >> n; while (n--) { long long a, b; cin >> a >> b; if (ceil((2 * a - b) / 3.0) == floor((2 * a - b) / 3.0) and ceil((2 * b - a) / 3.0) == floor((2 * b - a) / 3.0) and ceil((2 * b - a) / 3.0) >= 0 and ((2 * a - b) / 3.0) >= 0) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; bool SR(int &x) { return scanf( %d , &x) == 1; } bool SR(long long &x) { return scanf( %lld , &x) == 1; } bool SR(double &x) { return scanf( %lf , &x) == 1; } bool SR(char *s) { return scanf( %s , s) == 1; } bool RI() { return true; } template <typename I, typename... T> bool RI(I &x, T &...tail) { return SR(x) && RI(tail...); } void SP(const int x) { printf( %d , x); } void SP(const long long x) { printf( %lld , x); } void SP(const double x) { printf( %.16lf , x); } void SP(const char *s) { printf( %s , s); } void PL() { puts( ); } template <typename I, typename... T> void PL(const I x, const T... tail) { SP(x); if (sizeof...(tail)) putchar( ); PL(tail...); } const int maxn = 1e2 + 2; vector<bool> a[maxn]; int n, m, k; void read() { RI(n, m, k); for (int i = 0; i < int(n); i++) a[i].resize(m); for (int i = 0; i < int(n); i++) for (int j = 0; j < int(m); j++) { int x; RI(x); a[i][j] = (x == 1); } } void build() {} int doo(const vector<bool> &v) { int ans = 0; for (int i = 0; i < int(n); i++) { int c[2] = {0, 0}; for (int j = 0; j < int(m); j++) c[v[j] ^ a[i][j]]++; ans += min(c[0], c[1]); } return ans; } void sol() { int ans = k + 1; if (n > 10) { for (int i = 0; i < int(n); i++) ans = min(ans, doo(a[i])); } else { vector<bool> c[maxn]; for (int i = 0; i < int(m); i++) c[i].resize(n); for (int i = 0; i < int(n); i++) for (int j = 0; j < int(m); j++) c[j][i] = a[i][j]; swap(n, m); for (int i = 0; i < int(n); i++) a[i] = c[i]; vector<bool> v(m); for (int i = 0; i < int((1 << m)); i++) { for (int j = 0; j < int(m); j++) v[j] = ((i >> j) & 1); ans = min(ans, doo(v)); } } if (ans <= k) PL(ans); else PL(-1); } int main() { read(); build(); sol(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[] = {0, 0, 1, -1}; const int dy[] = {1, -1, 0, 0}; int s[505][505]; queue<pair<int, int> > q; char c[505][505]; bitset<505> b[505]; int main(void) { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> (c[i] + 1); int x1, y1, first, second; cin >> first >> second >> x1 >> y1; s[first][second] = 1; q.push(make_pair(first, second)); while (q.size()) { int k = q.front().first, l = q.front().second; q.pop(); for (int p = 0; p < 4; ++p) { int f = k + dx[p]; int g = l + dy[p]; if ((c[f][g] == . ) && !s[f][g]) s[f][g] = s[k][l] + 1, q.push(make_pair(f, g)); } } int p = 0, g = 0; for (int l = 0; l < 4; ++l) p += c[x1 + dx[l]][y1 + dy[l]] == . , g |= s[x1 + dx[l]][y1 + dy[l]]; if (c[x1][y1] == X ) return cout << (g ? YES : NO ) << n , 0; if (!s[x1][y1]) return cout << NO n , 0; if (p > 1 || (abs(first - x1) + abs(second - y1) == 1 && p >= 1)) return cout << YES n , 0; return cout << NO n , 0; } |
#include <bits/stdc++.h> using ll = long long; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t, n, x; cin >> t; int sum = 0; int cnt = 0; int item = 0; int s = 0; while (t--) { cin >> n >> x; cnt = 0; s = 0; for (int i = 0; i < n; ++i) { cin >> item; if (item == x) { ++cnt; } s += item; sum += (x - item); } if (cnt == n) { cout << 0 << n ; } else if (cnt > 0 or s == n * x or sum == 0) { cout << 1 << n ; } else { cout << 2 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[9], aa[9]; int c[9], cc[9]; int n; int ans; void dfs(int u, int cnt, int self) { if (u == n) { ans = min(ans, cnt + (self > 1)); return; } dfs(u + 1, cnt + cc[u] + (c[u] != 1), self + 1); for (int i = u + 1; i < n; i++) if (aa[i] % a[u] == 0) { aa[i] /= a[u]; cc[i] -= c[u]; dfs(u + 1, cnt + cc[u] + (c[u] != 1), self); aa[i] *= a[u]; cc[i] += c[u]; } } int main() { int i, j; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %I64d , &a[i]); sort(a, a + n); for (i = 0; i < n; i++) { long long x = a[i]; long long m = sqrt(x + 0.5); for (j = 2; j <= m; j++) while (x % j == 0) { c[i]++; x /= j; } if (x > 1) c[i]++; aa[i] = a[i]; cc[i] = c[i]; } ans = 1e9; dfs(0, 0, 0); printf( %d n , ans); return 0; } |
#include<bits/stdc++.h> #define pii pair<int,int> #define fi first #define sc second #define pb push_back #define ll long long #define trav(v,x) for(auto v:x) using namespace std; const int N = 1e6 + 100; const ll mod = 998244353; int n, m, need; int sa[N], rnk[N]; ll fac[N], ifac[N]; ll C(ll x, ll y) {return 1LL * fac[x] * ifac[y] % mod * ifac[x - y] % mod;} ll qpow(ll x, ll y = mod - 2) { ll res = 1; while(y) { if(y & 1)res = res * x % mod; x = x * x % mod, y >>= 1; } return res; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for(int i = 1; i <= n; i++) cin >> sa[i], ++sa[i], rnk[sa[i]] = i; need = 1; sa[n + 1] = 0; for(int i = 2; i <= n; i++) { int bf_ps = sa[i - 1], nw_ps = sa[i]; if(rnk[bf_ps + 1] < rnk[nw_ps + 1]); else ++need; } m -= need; // cerr << !! << m << n ; ll ans = 0; fac[0] = 1; for(int i = 1; i < N; i++)fac[i] = fac[i - 1] * i % mod; ifac[N - 1] = qpow(fac[N - 1]); for(int i = N - 2; i >= 0; i--)ifac[i] = ifac[i + 1] * (i + 1) % mod; for(ll x = 0; x <= m; x++) ans = (ans + C(x + n - 1, n - 1)) % mod; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long g(long long n, long long m) { long long ans = 0; for (long long x = 1; x <= n; x++) { long long minY = 5 - (x % 5); if (minY <= m) ans += (m - minY) / 5 + 1; } return ans; } long long gs(long long n, long long m) { long long ans = 0; for (long long x = 1; x <= n; x++) { for (long long y = 1; y <= m; y++) { if ((x + y) % 5 == 0) ans++; } } return ans; } int main() { ios_base::sync_with_stdio(false); long long n, m; cin >> n >> m; cout << g(n, m) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 101; int N, Q, freq[11]; char commands[MAXN], commands2[MAXN]; void solve(int l, int r) { l--; r--; for (int i = 0; i < N; i++) commands2[i] = commands[i]; for (int i = 0; i < 10; i++) freq[i] = 0; int cur = l; int dir = 1; int prev; while (cur >= l && cur <= r) { if (commands2[cur] == 0) cur += dir; else if (commands2[cur] == > ) { prev = cur; dir = 1; cur += dir; while (cur >= l && cur <= r && commands2[cur] == 0) cur += dir; if (cur < l || cur > r) break; if (commands2[cur] == < || commands2[cur] == > ) commands2[prev] = 0; } else if (commands2[cur] == < ) { prev = cur; dir = -1; cur += dir; while (cur >= l && cur <= r && commands2[cur] == 0) cur += dir; if (cur < l || cur > r) break; if (commands2[cur] == < || commands2[cur] == > ) commands2[prev] = 0; } else { freq[commands2[cur] - 0 ]++; commands2[cur]--; if (commands2[cur] < 0 ) commands2[cur] = 0; cur += dir; } } for (int i = 0; i < 10; i++) { printf( %d , freq[i]); if (i == 9) printf( n ); else printf( ); } } int main() { scanf( %d %d , &N, &Q); scanf( %s , commands); for (int i = 0; i < Q; i++) { int L, R; scanf( %d %d , &L, &R); solve(L, R); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100; int n, x, a; int f[MAXN + 1]; int main() { cin >> n >> x; memset(f, 0, sizeof f); for (int i = 0; i < n; i++) { cin >> a; f[a] = 1; } int ans = 0; for (int i = 0; i < x; i++) { if (f[i] == 0) ans++; } if (f[x] == 1) ans++; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> const int maxx = 2e5 + 7; const int maxn = 1e9 + 7; using namespace std; inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 , ch = getchar(); return s * w; } long long n, h, l, r; int dp[2005][2005], a[2006]; int check(int op) { if (op <= r && op >= l) return 1; else return 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> h >> l >> r; memset(dp, -1, sizeof dp); dp[0][0] = 0; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { for (int j = 0; j < h; j++) { if (dp[i - 1][(j - a[i] + h) % h] < 0 && dp[i - 1][(j - a[i] + 1 + h) % h] < 0) continue; dp[i][j] = max(dp[i - 1][(j - a[i] + h) % h], dp[i - 1][(j - a[i] + 1 + h) % h]) + check(j); } } int ans = 0; for (int i = 0; i < h; i++) { ans = max(ans, dp[n][i]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int ma = 35; int n, m, mat[ma][ma]; int main() { int t; scanf( %d , &t); int ans, one, zero; int sum, temp; int l, r; while (t--) { scanf( %d%d , &n, &m); one = zero = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { scanf( %d , &mat[i][j]); if (mat[i][j]) one++; else zero++; } ans = min(zero, one); zero = one = sum = 0; if (m > n) { l = 1, r = m; while (1) { temp = one = zero = 0; while ((1 + temp <= n) && (l - temp >= 1)) { if (mat[1 + temp][l - temp]) one++; else zero++; temp++; } temp--; if ((1 + temp == n) && (l - temp == r)) break; temp = 0; while ((n - temp >= 1) && (r + temp <= m)) { if (mat[n - temp][r + temp]) one++; else zero++; temp++; } sum += min(zero, one); if ((l + 1) == r + temp - 1) break; l++, r--; } } else { l = 1, r = n; while (1) { temp = one = zero = 0; while (l - temp >= 1 && 1 + temp <= m) { if (mat[l - temp][1 + temp]) one++; else zero++; temp++; } temp--; if (l - temp == r && 1 + temp == m) break; temp = 0; while (r + temp <= n && m - temp >= 1) { if (mat[r + temp][m - temp]) one++; else zero++; temp++; } sum += min(zero, one); if (l + 1 == r + temp - 1) break; l++, r--; } } printf( %d n , min(ans, sum)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int freq[26]; int main() { string s; cin >> s; int mx = -1; char g = s[0]; for (int i = 0; i < s.size(); i++) { freq[s[i] - a ]++; if (s[i] >= g) { mx = max(mx, freq[s[i] - a ]); g = s[i]; } } string d(freq[g - a ], g); cout << d << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1); const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int N = 2e5 + 5; int n, m; char a[N], b[N]; void solve() { scanf( %d , &n); scanf( %s , a + 1); scanf( %s , b + 1); int res = 0; for (int i = 1; i <= n; ++i) { if (b[i] == 1 ) { if (a[i] == 0 || a[i - 1] == 1 ) ++res; else if (a[i + 1] == 1 ) { a[i + 1] = * ; ++res; } } } printf( %d n , res); } int main() { int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int p, x, y; queue<int> q; int mmap[100000]; bool check(int s) { int i = s / 50 % 475; for (int j = 0; j < 25; ++j) { i = (i * 96 + 42) % 475; if (26 + i == p) return true; } mmap[s] = 1; return false; } int main() { cin >> p >> x >> y; q.push(0); while (!q.empty()) { int n = q.front(); q.pop(); int s = x + n * 100; while (s >= y) { if (mmap[s]) { s -= 50; continue; } if (check(s)) { cout << n << endl; return 0; } s -= 50; } q.push(n + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; int left0 = 0; for (int i = 0; i < n; i++) { if (s[i] == 0 ) { left0 = i + 1; } else { break; } } int right1 = 0; for (int i = n - 1; i >= 0; i--) { if (s[i] == 1 ) { right1 = right1 + 1; } else { break; } } for (int i = 0; i < left0; i++) { cout << 0; } if (left0 + right1 == n - 1 && (left0 != 0 || right1 != 0)) { cout << s[left0]; } else if (left0 + right1 != n) { cout << 0; } for (int i = 0; i < right1; i++) { cout << 1; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct no { long long i, h, m; }; long long dp[40][40][40]; char str[40]; no pre[40][40][40]; long long pw[19]; vector<char> ans; int main() { long long n; scanf( %lld , &n); scanf( %s , str + 1); pw[0] = 1; for (long long i = 1; i < 19; i++) pw[i] = pw[i - 1] * 10LL; for (long long i = 0; i < 40; i++) for (long long j = 0; j < 40; j++) for (long long k = 0; k < 40; k++) dp[i][j][k] = -9999999999999LL; dp[0][0][0] = 0; pre[0][0][0] = {-1, -1, -1}; for (long long i = 1; i <= 2 * n; i++) { for (long long h = 0; h <= n; h++) { for (long long m = 0; m <= n; m++) { if (h) { if (dp[i - 1][h - 1][m] + pw[n - h] * (str[i] - 0 ) > dp[i][h][m]) { dp[i][h][m] = dp[i - 1][h - 1][m] + pw[n - h] * (str[i] - 0 ); pre[i][h][m] = {i - 1, h - 1, m}; } } if (m) { if (dp[i - 1][h][m - 1] + pw[n - m] * (str[i] - 0 ) > dp[i][h][m]) { dp[i][h][m] = dp[i - 1][h][m - 1] + pw[n - m] * (str[i] - 0 ); pre[i][h][m] = {i - 1, h, m - 1}; } } } } } no check = {-1, -1, -1}; no tren = {2 * n, n, n}; no pred = pre[tren.i][tren.h][tren.m]; while (pred.i != -1) { if (tren.h == pred.h) ans.push_back( M ); else ans.push_back( H ); tren = pred; pred = pre[tren.i][tren.h][tren.m]; } reverse(ans.begin(), ans.end()); for (long long i = 0; i < ans.size(); i++) printf( %c , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long a[5005]; void input() { scanf( %d , &n); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); a[i + 1] = a[i] + x; } } void solve() { long long outx, outy, outz, ans; ans = outx = outy = outz = 0; for (int i = 0; i <= n; i++) { long long z = a[i], lft = i; for (int j = i; j <= n; j++) { if (a[j] < z) { lft = j, z = a[j]; } if (a[i] - a[lft] + a[j] > ans) { ans = a[i] - a[lft] + a[j]; outx = i, outz = j, outy = lft; } } } printf( %lld %lld %lld , outx, outy, outz); } int main() { input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char s[18]; for (int i = 1; i <= 8; i++) { cin >> s; bool p = false; for (int j = 1; j < 8; j++) if (s[j] == s[j - 1]) { p = true; break; } if (p) { cout << NO ; return 0; } } cout << YES ; return 0; } |
#include<bits/stdc++.h> using namespace std; #define inf 1999999999999999999 #define mod 1000000007 #define lb lower_bound #define ub upper_bound #define pb push_back #define pf push_front #define bn binary_search #define pq priority_queue #define int long long #define pii pair<int,int> #define mii map<int,int> #define umii unordered_map<int,int> #define um unordered_map #define vi vector<int> #define mii map<int,int> #define si set<int> #define ft first #define sc second #define gcd(a,b) __gcd(a,b) #define lcm(a,b) a*(b/gcd(a,b)) #define bp(a) __builtin_popcountll(a) #define mmst(a,b) memset(a,b,sizeof(a)) #define ld long double void lc(){cout<<endl;} int md(int n){return n%mod;} void solve() { int n; ld k; cin>>n>>k; //k=k*((ld)(sqrt(2))); pii p[n]; for(int i=0;i<n;i++) cin>>p[i].ft>>p[i].sc; for(int i=0;i<n;i++) { int mind=0; for(int j=0;j<n;j++) { if(i==j)continue; int dis=abs(p[i].ft-p[j].ft)+abs(p[i].sc-p[j].sc); mind=max(mind,dis); } if(mind<=k) { cout<< 1 ; return; } } cout<< -1 ; } signed main() { ios::sync_with_stdio(0); cin.tie(0); int t=1; cin>>t; while(t--) { solve(); lc(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 3; const long long OO = 0x3f3f3f3f3f3f3f3f; long long n, a, b; vector<int> primes, v; long long mem[N][3]; void fact(int num) { if (num % 2 == 0) primes.push_back(2); while (num % 2 == 0) num /= 2; for (int i = 3; i * i <= num; ++i) { if (num % i == 0) primes.push_back(i); while (num % i == 0) num /= i; } if (num > 1) primes.push_back(num); } long long solve(int idx, int typ, const int& gcd) { if (idx == n) return 0; long long& ret = mem[idx][typ]; if (~ret) return ret; ret = OO; if (typ < 2) { ret = min(ret, a + solve(idx + 1, 1, gcd)); } if (typ == 1) typ = 2; for (int i = -1; i <= 1; ++i) { if (((v[idx] + i) % gcd) == 0) ret = min(ret, (i == 0 ? 0 : b) + solve(idx + 1, typ, gcd)); } return ret; } int main() { cin >> n >> a >> b; v = vector<int>(n); for (auto& it : v) cin >> it; for (int i = -1; i <= 1; ++i) { fact(v[0] + i); fact(v[n - 1] + i); } set<int> st(primes.begin(), primes.end()); primes = vector<int>(st.begin(), st.end()); long long ans = OO; for (auto it : primes) { memset(mem, -1, sizeof mem); long long rt = solve(0, 0, it); ans = min(ans, rt); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; int mx = (int)1e9; char an; void ask_query(int i, int j) { cout << ? << i << << j << endl; cin >> an; if (an == e ) exit(0); } int solbin(int l, int r) { if (r == l + 1) return r; int mid = (l + r) / 2; ask_query(l, mid); if (an == x ) { return solbin(l, mid); } else { return solbin(mid, r); } } int sol(int shift, int en) { if (en == 2) { ask_query(shift, shift + 1); if (an == y ) { return shift + 2; } else { return shift + 1; } } an = y ; int i = 0, j = 2; int it = 0; while (an != x && 2 * j < en) { if (it != 0) { i = j; j = min(2 * j, en); } ask_query(shift + i, shift + j); it++; } if (2 * j >= en && an != x ) { i = j; j = en; } return solbin(shift + i, shift + j); } void solve() { string s; cin >> s; while (s == start ) { int ans = sol(0, mx); cout << ! << ans << endl; cin >> s; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; class Piece { public: int up[600]; int down[600]; vector<int> pcs; Piece() {} } pieces[20]; int x[600][600], w, h, p, u; void readPhoto() { cin >> h >> w >> p; for (int i = 0; i < h; ++i) for (int j = 0; j < w; ++j) cin >> x[i][j]; h /= p; } void setPieces() { int st = 0; for (int i = 0; i < p; ++i) { pieces[i].pcs.push_back(i + 1); for (int j = 0; j < w; j++) { pieces[i].up[j] = x[st][j] + x[st + 1][j]; pieces[i].down[j] = x[st + h - 2][j] + x[st + h - 1][j]; } st += h; } u = p; } bool comp(pair<int, pair<int, int> > a, pair<int, pair<int, int> > b) { return a.first < b.first; } int calcDiff(int a, int b) { int diff = 0; for (int i = 0; i < w; ++i) diff += ((pieces[a].down[i] - pieces[b].up[i]) * (pieces[a].down[i] - pieces[b].up[i])); return diff; } void mrgPieces(int a, int b) { pieces[a].pcs.insert(pieces[a].pcs.end(), pieces[b].pcs.begin(), pieces[b].pcs.end()); swap(pieces[a].down, pieces[b].down); swap(pieces[b], pieces[--u]); } void cmpPieces() { vector<pair<int, pair<int, int> > > v; for (int i = 0; i < u; ++i) for (int j = 0; j < u; ++j) if (i != j) { int diff = calcDiff(i, j); v.push_back(make_pair(diff, make_pair(i, j))); } sort(v.begin(), v.end(), comp); mrgPieces(v[0].second.first, v[0].second.second); v.clear(); } void cleanPieces() { for (int i = 0; i < 20; ++i) pieces[i].pcs.clear(); } int main() { ios_base::sync_with_stdio(false); int c; cin >> c; while (c--) { readPhoto(); setPieces(); while (u > 1) cmpPieces(); int tmpPrint[20]; int spx = 1; for (__typeof(pieces[0].pcs.begin()) it = pieces[0].pcs.begin(); it != pieces[0].pcs.end(); ++it) tmpPrint[*it - 1] = spx++; for (int i = 0; i < p; ++i) cout << tmpPrint[i] << ; cout << endl; cleanPieces(); } } |
#include <bits/stdc++.h> using namespace std; bool dp[5001][5001]; vector<int> bits[10001]; vector<pair<int, int> > cur; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s, ans; cin >> s; int n = s.size(); dp[0][0] = 1; cur.push_back(make_pair(0, 0)); int cnt = 0; while ((1 << cnt) < n) cnt++; cnt--; ans = ; for (int i = 0; i < (1 << cnt); i++) for (int j = 0; j < cnt; j++) if ((i & (1 << j)) == 0) bits[i].push_back(j); int l = 1; int m = n; while (m > l) { m -= l; l *= 2; } while (ans.size() < m) { char min_chr = z ; for (int i = 0; i < cur.size(); i++) { auto x = cur[i]; for (auto j : bits[x.second]) { if (dp[x.first + (1 << j)][x.second | (1 << j)] == 0) { cur.push_back(make_pair(x.first + (1 << j), x.second | (1 << j))); dp[x.first + (1 << j)][x.second | (1 << j)] = 1; } } min_chr = min(min_chr, s[x.first]); } ans.push_back(min_chr); vector<pair<int, int> > tmp; for (auto x : cur) { if (s[x.first] == min_chr) { dp[x.first + 1][x.second] = 1; tmp.push_back(make_pair(x.first + 1, x.second)); } } cur = tmp; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } int n, m; vector<int> me, a, nme; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; int num; for (int i = 1; i <= n; i++) { cin >> num; me.push_back(num); } for (int i = 1; i <= m; i++) { cin >> num; a.push_back(num); } for (int i = 0; i < 30; i++) { for (int j = 0; j < me.size(); j++) { if (me[j] & (1 << i)) { nme.push_back((1 << i)); } } } sort(a.begin(), a.end()); int ans = 0; int cm = 0; for (int i = 0; i < nme.size(); i++) { while (cm < a.size() and nme[i] >= (1 << a[cm])) { nme[i] -= (1 << a[cm]); cm += 1; ans += 1; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x; bool isp(int n) { if (n == 1) return false; for (long long i = 2; i * i <= n; ++i) if (n % i == 0) return false; return true; } int mpow(long long x, int k) { long long ans = 1; while (k > 0) { if (k & 1) ans = (ans * x) % n; x = (x * x) % n; k /= 2; } return ans; } int main() { cin >> n >> x; ++n; if (!isp(n)) { cout << -1 ; return 0; } int m = n - 1; vector<int> p; for (int i = 2; i <= m; ++i) { if (m % i == 0) { p.push_back(i); while (m % i == 0) m /= i; } } if (m > 1) p.push_back(m); for (int y = x - 1; y > 0; --y) { bool ok = true; for (int i = 0; i < p.size(); ++i) { int k = (n - 1) / p[i]; if (mpow(y % n, k) == 1) { ok = false; break; } } if (ok) { cout << y; return 0; } } cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 100; const int oo = 1e9 + 7; int N; int H[MAXN]; deque<int> dq; int L[MAXN], R[MAXN], l[MAXN], r[MAXN]; int d[MAXN]; vector<int> G[MAXN]; void Dijkstra(int u) { for (int i = (1), _b = (N + 1); i <= _b; ++i) d[i] = +oo; d[u] = 0; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; pq.push(pair<int, int>(0, u)); while (pq.size()) { int du = pq.top().first; int u = pq.top().second; pq.pop(); if (du != d[u]) continue; for (auto &v : G[u]) { if (d[v] > du + 1) { d[v] = du + 1; pq.push(pair<int, int>(d[v], v)); } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for (int i = (1), _b = (N); i <= _b; ++i) cin >> H[i]; dq.clear(); for (int i = (N), _a = (1); i >= _a; --i) { while (dq.size() && H[dq.front()] <= H[i]) dq.pop_front(); if (dq.size()) R[i] = dq.front() - 1; else R[i] = i; dq.push_front(i); } dq.clear(); for (int i = (1), _b = (N); i <= _b; ++i) { while (dq.size() && H[dq.front()] <= H[i]) dq.pop_front(); if (dq.size()) L[i] = dq.front() + 1; else L[i] = i; dq.push_front(i); } dq.clear(); for (int i = (1), _b = (N); i <= _b; ++i) { while (dq.size() && H[dq.front()] >= H[i]) dq.pop_front(); if (dq.size()) l[i] = dq.front() + 1; else l[i] = i; dq.push_front(i); } dq.clear(); for (int i = (N), _a = (1); i >= _a; --i) { while (dq.size() && H[dq.front()] >= H[i]) dq.pop_front(); if (dq.size()) r[i] = dq.front() - 1; else r[i] = i; dq.push_front(i); } for (int i = (1), _b = (N); i <= _b; ++i) G[i].push_back(i + 1); for (int i = (1), _b = (N); i <= _b; ++i) { if (H[i] < min(H[L[i] - 1], H[R[i] + 1])) { G[L[i] - 1].push_back(R[i] + 1); } } for (int i = (1), _b = (N); i <= _b; ++i) { if (max(H[l[i] - 1], H[r[i] + 1]) < H[i]) { G[l[i] - 1].push_back(r[i] + 1); } } Dijkstra(1); cout << d[N] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long MOD = 1000000007; const long long INF = 1e12; const long long N = 1e6 + 10; vector<long long> G[100001]; long long n, m, match[100001], dist[100001]; bool bfs() { long long i, u, v, len; queue<long long> Q; for (i = 1; i <= n; i++) { if (match[i] == 0) { dist[i] = 0; Q.push(i); } else dist[i] = (1 << 28); } dist[0] = (1 << 28); while (!Q.empty()) { u = Q.front(); Q.pop(); if (u != 0) { len = G[u].size(); for (i = 0; i < len; i++) { v = G[u][i]; if (dist[match[v]] == (1 << 28)) { dist[match[v]] = dist[u] + 1; Q.push(match[v]); } } } } return (dist[0] != (1 << 28)); } bool dfs(long long u) { long long i, v, len; if (u != 0) { len = G[u].size(); for (i = 0; i < len; i++) { v = G[u][i]; if (dist[match[v]] == dist[u] + 1) { if (dfs(match[v])) { match[v] = u; match[u] = v; return true; } } } dist[u] = (1 << 28); return false; } return true; } long long hopcroft_karp() { long long matching = 0, i; while (bfs()) for (i = 1; i <= n; i++) if (match[i] == 0 && dfs(i)) matching++; return matching; } vector<pair<long long, pair<long long, long long>>> edges; long long check(long long x) { for (long long i = 0; i <= 2 * n + 1; i++) { G[i].clear(); match[i] = 0; dist[i] = (1 << 28); } for (long long i = 0; i < (long long)edges.size() && edges[i].first <= x; i++) { long long u = edges[i].second.first, v = edges[i].second.second; G[u].push_back(v); G[v].push_back(u); } long long res = hopcroft_karp(); return n == res; } void solve() { long long V; cin >> n >> V; m = n; for (long long i = 0; i < V; i++) { long long d, u, v; cin >> u >> v >> d; edges.push_back({d, {u, v + n}}); } sort(edges.begin(), edges.end()); long long l = 1, h = 1e9 + 1; long long ans = h; while (l <= h) { long long mid = (l + h) / 2; if (check(mid)) { h = mid - 1; ans = mid; } else { l = mid + 1; } } if (ans == 1e9 + 1) cout << -1 << n ; else cout << ans; } signed main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; struct node { double x, y; } g[500]; int main() { int i, j, k, n, m; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %lf%lf , &g[i].x, &g[i].y); } double maxx = 0; double m1, m2; for (i = 0; i < n - 1; ++i) for (j = i + 1; j < n; ++j) { m1 = m2 = 0; for (k = 0; k < n; ++k) { if (i == k || j == k) continue; double temp = (g[i].x - g[k].x) * (g[j].y - g[k].y) - (g[j].x - g[k].x) * (g[i].y - g[k].y); if (temp > 0) { if (temp > m1) m1 = temp; } else { if (temp < m2) m2 = temp; } } if (m1 != 0 && m2 != 0) if (maxx < m1 + abs(m2)) maxx = m1 + abs(m2); } printf( %lf , maxx / 2); } |
#include <bits/stdc++.h> using namespace std; int mb[3], cd[3]; int mn[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; bool chk() { if (mb[1] > 12) return 0; int i, j, k, tm; tm = mn[mb[1]]; if (mb[1] == 2 && !(mb[2] & 3)) tm++; if (tm < mb[0]) return 0; for (i = mb[2]; i < cd[2]; i++) ; i -= (mb[2] + 1); int dy, m; if (mb[0] == 29 && mb[1] == 2 && (cd[2] & 3)) { dy = 1; m = 3; } else { dy = mb[0]; m = mb[1]; } if (cd[1] > m || (cd[1] == m && cd[0] >= dy)) i++; return i >= 18; } int main() { bool f = 0; scanf( %d.%d.%d %d.%d.%d , &cd[0], &cd[1], &cd[2], &mb[0], &mb[1], &mb[2]); sort(mb, mb + 3); do { if (chk()) { f = 1; break; } } while (next_permutation(mb, mb + 3)); if (f) puts( YES ); else puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3000000 + 11; const int mod = 1e9 + 7; const int MAXN = 3000000 + 5; int n, m; int c[MAXN]; struct Node { int l, r; } a[MAXN]; int lowbit(int i) { return i & (-i); } long long sum(int x) { long long sum = 0; while (x) { sum += c[x]; x -= lowbit(x); } return sum; } void add(int x, long long val) { while (x <= n) { c[x] += val; x += lowbit(x); } } int two_query(int x) { int l = 1, r = n; while (l < r) { int mid = (l + r) >> 1; if (sum(mid) >= x) { r = mid; } else l = mid + 1; } return l; } long long p[100]; int lim; void bz_init() { p[0] = 1; for (int i = 1; i < 30; i++) p[i] = p[i - 1] << 1; lim = log(n) / log(2) + 1; } int bz_query(int x) { int ans = 0, sum = 0; for (int j = lim; j >= 0; j--) { if (ans + p[j] <= n && sum + c[ans + p[j]] < x) { sum += c[ans + p[j]]; ans += p[j]; } } return ans + 1; } int f[N]; char ans[N], s[N]; int main() { scanf( %s , s + 1); scanf( %d%d , &n, &m); memset(c, 0, sizeof(c)); for (int i = 1; i <= n; i++) { add(i, 1); } for (int i = 1; i <= m; i++) { scanf( %d%d , &a[i].l, &a[i].r); } bz_init(); for (int now = n, i = m; i >= 1; i--) { for (int x = a[i].l + 1, j = 1; a[i].r < now && j <= a[i].r - a[i].l + 1; x += 2, j++, now--) { if (x > a[i].r) x = a[i].l; int pos = bz_query(a[i].r + 1); add(pos, -1); f[pos] = bz_query(x); } } for (int i = 1, j = 0; i <= n; i++) { if (f[i] != 0) ans[i] = ans[f[i]]; else ans[i] = s[++j]; } printf( %s , ans + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { char c = getchar(); int x = 0, f = 1; for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * f; } inline void chkmax(int &x, int y) { x = x > y ? x : y; } const int MAXN = 1e5 + 5; const int INF = 1e9; int ch[MAXN][26], fail[MAXN]; int N, M, cnt; bool nd[MAXN]; char s[MAXN], t[MAXN]; vector<int> dp[MAXN]; inline void build() { int p = 0; for (int i = 1; i <= M; i++) { int x = t[i] - a ; ch[p][x] = ++cnt; p = ch[p][x]; } nd[p] = true; queue<int> Q; for (int i = 0; i < 26; i++) if (ch[0][i]) Q.push(ch[0][i]); while (!Q.empty()) { int x = Q.front(); Q.pop(); for (int i = 0; i < 26; i++) if (!ch[x][i]) ch[x][i] = ch[fail[x]][i]; else { int y = ch[x][i]; fail[y] = ch[fail[x]][i]; Q.push(y); } } } int main() { scanf( %s , s + 1); scanf( %s , t + 1); N = strlen(s + 1); M = strlen(t + 1); build(); for (int i = 0; i <= N; i++) { dp[i].resize(M + 1); for (int j = 0; j <= M; j++) dp[i][j] = -INF; } dp[0][0] = 0; for (int i = 0; i < N; i++) if (s[i + 1] != ? ) { int t = s[i + 1] - a ; for (int j = 0; j <= M; j++) { int p = ch[j][t]; chkmax(dp[i + 1][p], dp[i][j] + nd[p]); } } else { for (int t = 0; t < 26; t++) for (int j = 0; j <= M; j++) { int p = ch[j][t]; chkmax(dp[i + 1][p], dp[i][j] + nd[p]); } } int ans = 0; for (int i = 0; i <= M; i++) chkmax(ans, dp[N][i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[4], i, n, x; int main() { for (cin >> n, i = 0; i < n; ++i) cin >> x, --x, a[0] += !x, a[1] = max(a[0], a[1] + x), a[2] = max(a[1], a[2] + !x), a[3] = max(a[2], a[3] + x); cout << a[3] << endl; } |
#include <bits/stdc++.h> using namespace std; int maxn, n, t, x; int main() { cin >> n; for (int i = 1; i <= n; i++) { int in1, in2; cin >> in1 >> in2; x -= in1 - t; if (x < 0) x = 0; x += in2; maxn = max(maxn, x); t = in1; } cout << t + x << << maxn; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; pair<int, long long> operator+(const pair<int, long long> &A, const pair<int, long long> &B) { return {A.first + B.first, A.second + B.second}; } pair<int, long long> operator-(const pair<int, long long> &A, const pair<int, long long> &B) { return {A.first - B.first, A.second - B.second}; } struct FenwickTree { pair<int, long long> fw[N]; void Update(int i, pair<int, long long> v) { for (i; i < N; i += i & -i) fw[i] = fw[i] + v; } pair<int, long long> Query(int i) { pair<int, long long> ans = {0, 0}; for (i; i > 0; i -= i & -i) ans = ans + fw[i]; return ans; } pair<int, long long> Query(int l, int r) { if (l > r) return {0, 0}; return Query(r) - Query(l - 1); } } active_task; int n, m; int a[N], b[N]; long long t; vector<int> val[N]; int find_index(int x, int r) { int l = 1, f = 0; while (l <= r) { int m = (l + r) >> 1; pair<int, long long> ret = active_task.Query(m); if (ret.first <= x) { f = m; l = m + 1; } else r = m - 1; } return f; } void Solve() { cin >> n >> m >> t; int number = m; pair<int, long long> ans = {t, 0}; for (int i = 1; i <= n; ++i) { cin >> a[i]; b[i] = a[i]; } sort(b + 1, b + n + 1); int bSize = unique(b + 1, b + n + 1) - (b + 1); for (int i = 1; i <= n; ++i) val[a[i]].push_back(i); for (int i = 1; i <= bSize; ++i) { int value = b[i]; for (int idx : val[value]) { active_task.Update(idx, {1, a[idx]}); } int l = 1, r = n, f = -1; while (l <= r) { int m = (l + r) >> 1; pair<int, long long> ret1 = active_task.Query(m); int idx = find_index((ret1.first - 1) / number * number, m); pair<int, long long> ret2 = active_task.Query(idx); long long sum = ret2.second * 2LL + active_task.Query(idx + 1, m).second; if (sum <= t) { l = m + 1; f = m; } else r = m - 1; } if (f != -1) { pair<int, long long> ret = active_task.Query(f); if (ret.first > ans.second) ans = {value, ret.first}; } } cout << ans.second << << ans.first << n ; for (int i = 1; i <= n; ++i) active_task.Update(i, {-1, -a[i]}), val[a[i]].clear(); } int main() { int TC; cin >> TC; while (TC--) { Solve(); } } |
#include <bits/stdc++.h> using namespace std; int compareAscending(const void *a, const void *b) { return (*(int *)a - *(int *)b); } int compareDecending(const void *a, const void *b) { return (*(int *)b - *(int *)a); } int compareFirst(const void *a, const void *b) { if (((pair<int, int> *)a)->first == ((pair<int, int> *)b)->first) return ((pair<int, int> *)a)->second - ((pair<int, int> *)b)->second; else return ((pair<int, int> *)a)->first - ((pair<int, int> *)b)->first; } int compareSecond(const void *a, const void *b) { if (((pair<int, int> *)a)->second == ((pair<int, int> *)b)->second) return ((pair<int, int> *)a)->first - ((pair<int, int> *)b)->first; else return ((pair<int, int> *)a)->second - ((pair<int, int> *)b)->second; } bool isPrime(int a) { if (a < 2) return false; if (a < 4) return true; if (a % 2 == 0) return false; int s = (int)sqrt(a); for (int i = 3; i <= s; i += 2) { if (a % i == 0) return false; } return true; } int bsearch(int *a, int value, int l, int r) { if (l == r) return l; if (l + 1 == r) return a[l] >= value ? l : r; int m = (l + r) / 2; if (a[m] >= value) return bsearch(a, value, l, m); else return bsearch(a, value, m + 1, r); } int main() { long long a, b, res = 0, t; scanf( %lld %lld , &a, &b); while (a != 0 && b != 0) { res += a / b; t = a % b; a = b; b = t; } printf( %lld , res); return 0; } |
#include <bits/stdc++.h> using namespace std; multimap<long long int, long long int> par; char en = n ; long long int inf = pow(10, 14); long long int mod = 1e9 + 7; long long int parent[2][500005]; long long int findRoot(long long int a, long long int which) { if (parent[which][a] == a) return a; parent[which][a] = findRoot(parent[which][a], which); return parent[which][a]; } void union1(long long int a, long long int b) { long long int root1 = findRoot(a, 0); long long int root2 = findRoot(b, 0); if (root1 == root2) return; long long int root11 = findRoot(a, 1); long long int root21 = findRoot(b, 1); if (root1 < root2) { parent[0][root1] = root2; } else { parent[0][root2] = root1; } if (root11 > root21) { parent[1][root11] = root21; } else { parent[1][root21] = root11; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, m, p; cin >> n >> m >> p; string s; cin >> s; char arr[500005]; for (long long int i = 1; i < n + 1; i += 1) { arr[i] = s[i - 1]; parent[0][i] = parent[1][i] = i; } bool visited[500005]; memset(visited, (false), sizeof(visited)); string s1; cin >> s1; long long int curr = p; for (long long int i = 0; i < s1.length(); i += 1) { if (s1[i] == R ) { if (visited[curr + 1]) curr = findRoot(curr + 1, 0) + 1; else curr++; } else if (s1[i] == L ) { if (visited[curr - 1]) curr = findRoot(curr - 1, 1) - 1; else curr--; } else { if (arr[curr] == ( ) { stack<char> st; while (curr <= n) { visited[curr] = true; if (visited[curr - 1]) union1(curr - 1, curr); if (visited[curr + 1]) union1(curr + 1, curr); if (arr[curr] == ( ) { st.push( ( ); } else { st.pop(); } if (st.empty()) { long long int temp; temp = findRoot(curr, 0) + 1; if (temp > n) { temp = findRoot(curr, 1) - 1; } curr = temp; break; } curr = findRoot(curr, 0) + 1; } } else { stack<char> st; while (curr >= 1) { visited[curr] = true; if (visited[curr - 1]) union1(curr - 1, curr); if (visited[curr + 1]) union1(curr + 1, curr); if (arr[curr] == ) ) { st.push( ) ); } else { st.pop(); } if (st.empty()) { long long int temp; temp = findRoot(curr, 0) + 1; if (temp > n) { temp = findRoot(curr, 1) - 1; } curr = temp; break; } curr = findRoot(curr, 1) - 1; } } } } for (long long int i = 1; i < n + 1; i += 1) { if (!visited[i]) cout << arr[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t, i = 0, j, k, x, y, z, count = 0, p, flag = 0, ans = 0, sum = 0, l, n, m, max1, min1, pos, tmp, q; t = 1; while (t--) { long long n, r; scanf( %lld%lld , &n, &r); long double x[1005], y[1005]; for (i = 0; i < n; i++) { scanf( %Lf , &x[i]); } for (i = 0; i < n; i++) { y[i] = -1.0 * 1000000000; for (j = 0; j < i; j++) { double p = abs(x[i] - x[j]); if (p <= 2 * r) { double q = y[j] + sqrtl(4 * r * r - p * p); if (q > y[i]) y[i] = q; } } if (y[i] == -1.0 * 1000000000) y[i] = 1.0 * r; printf( %.15Lf , y[i]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; const long double ep = 1e-10; struct pnt { long double x, y; pnt() { x = y = 0; } pnt(long double xx, long double yy) { x = xx, y = yy; } pnt operator+(pnt a) { return pnt(x + a.x, y + a.y); } void in() { int xx, yy; cin >> xx >> yy; x = xx, y = yy; } long double operator^(const pnt &a) const { return x * a.y - y * a.x; } bool operator<(const pnt &a) const { return x != a.x ? x < a.x : y < a.y; } bool int_pnt(pnt &a) { int xx = x + (x > 0 ? 0.5 : -0.5), yy = y + (y > 0 ? 0.5 : -0.5); if (abs(x - xx) < ep && abs(y - yy) < ep) { a = pnt(xx, yy); return 1; } return 0; } } p[N], M, MM; vector<pnt> P; int n; map<pnt, int> h; bool opp[N]; int main() { cin >> n; for (int i = 1; i <= n; i++) { p[i].in(); M = M + p[i]; h[p[i]] = i; } M.x /= n, M.y /= n; MM.x = M.x * 2, MM.y = M.y * 2; for (int i = 1; i <= n; i++) if (!opp[i]) { pnt pp = pnt(MM.x - p[i].x, MM.y - p[i].y), qq; if (pp.int_pnt(qq) && h.count(qq)) { int t = h[qq]; opp[t] = 1; opp[i] = 1; } } for (int i = 1; i <= n; i++) if (!opp[i]) P.push_back(p[i]); if (P.empty()) puts( -1 ); else { pnt A = P[0]; int ans = 0; vector<pnt> D; for (auto x : P) { pnt AM = A + x; AM.x /= 2, AM.y /= 2; pnt d = pnt(M.x - AM.x, M.y - AM.y); vector<long double> pos, neg; for (auto y : P) { long double l = d ^ pnt(y.x - AM.x, y.y - AM.y); if (abs(l) < ep) continue; if (l < 0) neg.push_back(-l); else pos.push_back(l); } if (neg.size() != pos.size()) continue; sort(neg.begin(), neg.end()); sort(pos.begin(), pos.end()); bool flag = 0; for (int i = 0; i < pos.size(); i++) if (abs(pos[i] - neg[i]) > ep) flag = 1; if (!flag) D.push_back(d); } for (auto &x : D) { if (x.y < 0) x.y = -x.y, x.x = -x.x; if (x.y == 0 && x.x < 0) x.x = -x.x; } sort(D.begin(), D.end(), [](const pnt &x, const pnt &y) { return (x ^ y) > 0; }); int sz = D.size(); for (int i = 0, j; i < sz; i = j) { for (j = i; j < sz && (D[i] ^ D[j]) == 0; j++) ; ans++; } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; std::pair<long long, long long> go(long long m) { long long cur = 1; long long cur3 = 1; long long cur13 = 8; long long h = 0; long long num = 0; std::vector<long long> what; while (1) { while (h + cur3 >= cur13) { if (cur3 > m) break; cur++; cur3 = cur13; cur13 = (cur + 1) * (cur + 1) * (cur + 1); } if (h + cur3 > m) break; h += cur3; what.push_back(cur3); num++; } std::vector<long long> ch(num + 1, 0); long long sum = 0; for (int i = 0; i < num; i++) { sum += what[i]; ch[i + 1] = sum; } cur = 1; while (cur * cur * cur <= m) cur++; long long left = m; long long ans = 0; deque<long long> revans; for (int step = num - 1; step >= 0; step--) { cur++; while (1) { cur--; if (ch[step] + cur * cur * cur > left) continue; long long cum = ch[step] + cur * cur * cur; bool f = false; for (int i = 0; i < revans.size(); i++) { cum += revans[i] * revans[i] * revans[i]; long long ra3 = (revans[i] + 1) * (revans[i] + 1) * (revans[i] + 1); if (cum >= ra3) { f = true; break; } } if (!f) break; } revans.push_front(cur); cur3 = cur * cur * cur; left -= cur3; ans += cur3; } return make_pair(num, ans); } int main() { long long m; cin >> m; std::pair<long long, long long> x = go(m); cout << x.first << << x.second; } |
#include<bits/stdc++.h> using namespace std; typedef long long int ll; typedef unsigned long long int ull; #define pii acos(-1) #define sc(n) scanf( %d ,&n) #define sc2(n,x) scanf( %d%d ,&n,&x) #define pr(n) printf( %d ,n) #define scl(n) scanf( %I64d ,&n) #define scl2(n,m) scanf( %I64d%I64d ,&n,&m) #define prl(n) printf( %I64d ,n) #define loop(x,n) for(int i=x;i<n;i++) #define mp make_pair #define pb push_back #define nl printf( n ) #define mod 998244353 #define lv -100000000 typedef pair<int,int> pi; #define fastio ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr) using namespace std; int a[300005],c[300005]; int main() { int t,n,k; cin>>t; while(t--) { cin>>n>>k; for(int i=0;i<n;i++) { cin>>a[i]; } for(int i=0;i<k;i++) { cin>>c[i]; } sort(a,a+n); ll ans=0; int l=0,flag=0; for(int i=n-1;i>=0;i--) { if(flag==0 && c[l]<=c[a[i]-1]&&l<k) { ans+=c[l]; l++; //cout<< YES <<endl; } else { flag++; ans+=c[a[i]-1]; } } cout<<ans<<endl; } } |
#include <bits/stdc++.h> using namespace std; vector<long long int> v(26, 0); long long int n, m; bool myFun(string &a, string &s, long long int i, long long int j) { if (i >= n && j >= m) { return true; } if (j >= m) { return false; } if (i >= n) { while (j < m) { if (s[j] != * ) { return false; } j++; } return true; } if (a[i] == s[j]) { return myFun(a, s, i + 1, j + 1); } if (s[j] == ? ) { long long int temp = a[i] - a ; if (v[temp]) { return myFun(a, s, i + 1, j + 1); } return false; } if (s[j] == * ) { long long int temp = a[i] - a ; if (v[temp]) { return myFun(a, s, i, j + 1); } else { return (myFun(a, s, i + 1, j + 1) || myFun(a, s, i, j + 1)) || myFun(a, s, i + 1, j); } } return false; } int main() { string s; cin >> s; for (long long int i = 0; i < s.length(); i++) { long long int temp = s[i] - a ; v[temp] = 1; } cin >> s; long long int k; cin >> k; for (long long int i = 0; i < k; i++) { string a; cin >> a; n = a.length(); m = s.length(); if (myFun(a, s, 0, 0)) { cout << YES << endl; } else { cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> int main() { int a, b, c, d, e, f; scanf( %d , &a); e = 0; for (b = 1; b <= a; b++) { for (c = b; c <= a; c++) { f = b ^ c; d = 0 ^ f; if (b + c > d && d <= a && d >= c) { e++; } } } printf( %d n , e); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int *xi, *di, n; cin >> n; xi = new int[n]; di = new int[n]; for (int i = 0; i < n; i++) cin >> xi[i] >> di[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (xi[i] + di[i] == xi[j] && xi[j] + di[j] == xi[i] && j != i) { cout << YES ; return 0; } } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long fact[200005]; long long extgcd(long long a, long long b, long long& x, long long& y) { long long d = a; if (b != 0LL) { d = extgcd(b, a % b, y, x); y -= (a / b) * x; } else { x = 1; y = 0; } return d; } long long mod_inverse(long long a, long long m) { long long x, y; extgcd(a, m, x, y); return (m + x % m) % m; } long long mod_fact(long long n, long long p, long long& e) { e = 0; if (n == 0) return 1; long long res = mod_fact(n / p, p, e); e += n / p; if (n / p % 2 != 0) { return res * (p - fact[n % p]) % p; } return res * fact[n % p] % p; } long long mod_comb(long long n, long long k, long long p) { if (n < 0 || k < 0 || n < k) return 0; long long e1, e2, e3; long long a1 = mod_fact(n, p, e1), a2 = mod_fact(k, p, e2), a3 = mod_fact(n - k, p, e3); if (e1 > e2 + e3) return 0; return a1 * mod_inverse(a2 * a3 % p, p) % p; } long long mod_pow(long long x, long long n) { long long ans = 1; while (n > 0) { if (n & 1) { ans = ans * x % 998244353LL; } x = x * x % 998244353LL; n >>= 1; } return ans; } int n; long long k; int h[200005]; int main(void) { fact[0] = 1; for (long long i = 1; i <= 200000; i++) { fact[i] = fact[i - 1] * i % 998244353LL; } scanf( %d%lld , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , &h[i]); } int cur = 0, nxt = 1; long long po = 1; int cnt = 0; for (int i = 0; i < n; i++) { int ans = h[i]; int cans = h[(i + 1) % n]; if (ans == cans) { po = po * k % 998244353LL; } else { cnt++; } } long long ans = 0; long long v1 = 1; for (int i = 0; i < cnt; i++) { int rest = cnt - i; long long v4 = mod_comb(cnt, i, 998244353LL); long long sum = 0; if (rest % 2 == 1) { if (i == cnt) { sum += v1 * mod_pow(2, rest - 1) % 998244353LL; sum %= 998244353LL; } else { sum += v1 * mod_pow(2, rest - 1) % 998244353LL; sum %= 998244353LL; } } else if (rest > 0) { long long v3 = mod_pow(2, rest - 1); long long v5 = mod_comb(rest - 1, rest / 2, 998244353LL); v3 = (v3 - v5 + 998244353LL) % 998244353LL; sum += v1 * v3 % 998244353LL; sum %= 998244353LL; } sum = sum * v4 % 998244353LL; ans += sum; ans %= 998244353LL; v1 = v1 * (k - 2LL) % 998244353LL; } ans = ans * po % 998244353LL; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k = 0, cl[105 * 35], link[105 * 35]; vector<int> g[105 * 35]; vector<pair<int, int> > has[105]; bool dfs(int u) { for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; if (!cl[v]) { cl[v] = 1; if (link[v] == 0 || dfs(link[v]) == true) { link[v] = u; return true; } } } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; ++i) { int x; cin >> x; for (int j = 2; j <= sqrt(x); ++j) { if (x % j == 0) { while (x % j == 0) { x = x / j; has[i].push_back({j, ++k}); } } } if (x > 1) has[i].push_back({x, ++k}); } for (int i = 1; i <= m; ++i) { int u, v; cin >> u >> v; if (u % 2 == 0) swap(u, v); for (int j = 0; j < has[u].size(); ++j) for (int q = 0; q < has[v].size(); ++q) { if (has[u][j].first == has[v][q].first) { g[has[u][j].second].push_back(has[v][q].second); } } } int rs = 0; for (int j = 1; j <= k; ++j) { for (int i = 1; i <= k; ++i) cl[i] = 0; if (dfs(j)) ++rs; } cout << rs; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100005]; int l[100005]; int r[100005]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { l[i] = min(l[i - 1] + 1, a[i]); } for (int i = n; i >= 1; i--) { r[i] = min(r[i + 1] + 1, a[i]); } int ma = 0; for (int i = 1; i <= n; i++) { ma = max(ma, min(l[i], r[i])); } cout << ma << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a, b; for (a = 0; a <= n / 1234567; a++) { for (b = 0; b * 123456 <= n - a * 1234567; b++) if ((n - (a * 1234567 + b * 123456)) % 1234 == 0) { cout << YES ; return 0; } } cout << NO ; } |
#include <bits/stdc++.h> using namespace std; long long rdtsc() { long long tmp; asm( rdtsc : =A (tmp)); return tmp; } inline int myrand() { return abs((rand() << 15) ^ rand()); } inline int rnd(int x) { return myrand() % x; } void precalc() {} const int maxn = 1e4 + 10; int n; char s[maxn]; bool read() { if (scanf( %s , s) < 1) { return false; } n = strlen(s); return true; } set<string> ans; int dp[maxn][2]; void solve() { ans.clear(); memset(dp, 0, sizeof(dp)); if (n >= 7) { dp[n - 2][0] = 1; } if (n >= 8) { dp[n - 3][1] = 1; } for (int i = n - 2; i >= 5; --i) { for (int it = 0; it < 2; ++it) { int len = it + 2; if (!dp[i][it]) { continue; } string cur = string(s + i, len); ans.insert(cur); for (int nit = 0; nit < 2; ++nit) { int nlen = nit + 2; if (i - nlen < 5) { break; } string t = string(s + (i - nlen), nlen); if (t != cur) { dp[i - nlen][nit] = 1; } } } } printf( %d n , ((int)(ans).size())); for (auto t : ans) { printf( %s n , t.c_str()); } } int main() { srand(rdtsc()); precalc(); while (true) { if (!read()) { break; } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int L(int i) { return i << 1; } inline int R(int i) { return (i << 1) | 1; } inline long long max(long long a, long long b) { return a < b ? b : a; } inline long long min(long long a, long long b) { return a < b ? a : b; } inline int abs(int x) { return x < 0 ? -x : x; } struct data { long long l, r; } A[2][10100], tmp; int top[2]; long long B[33]; void init() { int i; B[0] = 1; for (i = 1; i < 33; i++) B[i] = B[i - 1] << 1; } void dfs(long long l, long long r, int id, int n) { l = max(1, l); r = min(B[n] - 1, r); if (l <= r) { tmp.l = l, tmp.r = r; A[id][top[id]++] = tmp; if (!((l <= 1) && (r >= B[n - 1] - 1))) { dfs(l, r, id, n - 1); dfs(l - B[n - 1], r - B[n - 1], id, n - 1); } } } int main() { long long l1, r1, l2, r2, ret; int i, j; init(); while (cin >> l1 >> r1 >> l2 >> r2) { top[0] = top[1] = 0; dfs(l1, r1, 0, 30); dfs(l2, r2, 1, 30); ret = 0; for (i = 0; i < top[0]; i++) for (j = 0; j < top[1]; j++) ret = max(min(A[0][i].r, A[1][j].r) - max(A[0][i].l, A[1][j].l) + 1, ret); cout << ret << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, n, i, j; int f[5001]; int dp[5001][5001]; char s[5003]; int main() { while (~scanf( %d%d%d , &n, &a, &b)) { scanf( %s , &s[1]); for (i = 1; i <= n; i++) f[i] = f[i - 1] + a; for (i = 1; i <= n; i++) { f[i] = min(f[i], f[i - 1] + a); for (j = 1; j < i; j++) { if (s[i] == s[j]) { dp[i][j] = dp[i - 1][j - 1] + 1; } else dp[i][j] = 0; if (j <= i - dp[i][j]) { f[i] = min(f[i], f[i - dp[i][j]] + b); } else { f[i] = min(f[i], f[j] + b); } } } printf( %d n , f[n]); } } |
#include <bits/stdc++.h> using namespace std; int n; int t[60], v[60]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &t[i]); for (int i = 1; i <= n; i++) scanf( %d , &v[i]); int nrOfStonesTakenAway = 0; for (int i = 1; i <= n; i++) { if (t[i] > v[i]) nrOfStonesTakenAway += (t[i] - v[i]); } for (int i = 1; i <= n; i++) if (t[i] < v[i]) { nrOfStonesTakenAway -= (v[i] - t[i]); } if (nrOfStonesTakenAway < 0) puts( No ); else puts( Yes ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, i, j, k, l; cin >> n >> a; long long arr[n + 2]; for (i = 1; i <= n; i++) { cin >> arr[i]; } long long pos; arr[n + 1] = a; sort(arr + 1, arr + n + 2); for (i = 1; i <= n + 1; i++) { if (arr[i] == a) { pos = i; break; } } long long dist, d1, d2, d3, d4; if (pos == 1 || pos == n + 1) { if (pos == 1) { cout << arr[n] - arr[pos] << endl; return 0; } if (pos == n + 1) { cout << arr[pos] - arr[2] << endl; return 0; } } else { d1 = 2 * (arr[pos] - arr[1]) + arr[n] - arr[pos]; d2 = arr[pos] - arr[1] + 2 * (arr[n] - arr[pos]); d3 = 2 * (arr[pos] - arr[2]) + arr[n + 1] - arr[pos]; d4 = arr[pos] - arr[2] + 2 * (arr[n + 1] - arr[pos]); } dist = min(min(d1, d2), min(d3, d4)); cout << dist << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); int main() { int n, s; cin >> n >> s; int res = -1; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; if (y == 0) { if (s >= x) { res = max(res, 0); } } else { if (s > x) { res = max(res, 100 - y); } } } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1003; int n, k; bitset<N * 3> A, dp, dpt; int main() { scanf( %d%d , &n, &k); for (int a; k; k--) scanf( %d , &a), A[a] = 1; dp[1500] = 1; for (int __ = 1; __ <= 1009; __++) { dpt = 0; for (int i = 0; i < 3000; i++) if (dp[i] == 1) dpt |= A << (i - n); dp = dpt; if (dp[1500] == 1) return !printf( %d n , __); } return !printf( -1 n ); } |
#include <bits/stdc++.h> using namespace std; long long n, fir; int main() { scanf( %lld , &n); fir = n; for (int i = 2; 1ll * i * i <= n; i++) if (n % i == 0) { fir = i; break; } for (; n != 1 && n % fir == 0; n /= fir) ; printf( %lld n , n == 1 ? fir : 1); } |
#include <bits/stdc++.h> using namespace std; int n, k; int a[110]; int b[110]; int dp[121000]; int main(int argc, char *argv[]) { cin >> n >> k; for (int i = 0; i < n; i += 1) { cin >> a[i]; } for (int i = 0; i < n; i += 1) { cin >> b[i]; } for (int i = 0; i < 121000; i += 1) { dp[i] = -1; } dp[100000] = 0; for (int i = 0; i < n; i += 1) { int x = a[i] - k * b[i]; if (x > 0) { for (int j = 121000 - 1; j >= x; j -= 1) { if (dp[j - x] != -1) { if (dp[j] == -1 || dp[j - x] + a[i] > dp[j]) { dp[j] = dp[j - x] + a[i]; } } } } else { for (int j = 0; j - x < 121000; j += 1) { if (dp[j - x] != -1) { if (dp[j] == -1 || dp[j - x] + a[i] > dp[j]) { dp[j] = dp[j - x] + a[i]; } } } } } if (dp[100000] == 0) { dp[100000] = -1; } cout << dp[100000] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> m; long long f(string s) { long long ff[27] = {0}, ans = 0, i, j; for (i = 0; i < s.size(); i++) { ff[s[i] - a ]++; } for (i = 0; i < 26; i++) { if (ff[i] % 2) { ans |= (1LL << i); } } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, i, j; cin >> n; string s[n + 1]; vector<long long> v; for (i = 0; i < n; i++) { cin >> s[i]; v.push_back(f(s[i])); } for (i = 0; i < v.size(); i++) m[v[i]]++; long long ans = 0; for (auto i : m) { ans += (i.second * (i.second - 1)) / 2; } for (i = 0; i < 26; i++) { map<long long, long long> mm; for (j = 0; j < n; j++) if (v[j] & (1 << i)) mm[v[j] ^ (1LL << i)]++; for (auto j : mm) { ans += m[j.first] * j.second; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, m, k; cin >> n >> m >> k; int result = n - m; if (k >= abs(result) && k != 0) { cout << ? << n ; } else { if (result > 0) cout << + n ; else if (result < 0) cout << - n ; else if (result == 0) cout << 0 n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; stack<char> st; char s[100005]; int main() { scanf( %s , s); int len = strlen(s); for (int i = 0; i < len; ++i) { if (st.empty() || st.top() != s[i]) st.push(s[i]); else st.pop(); } if (st.empty()) puts( Yes ); else puts( No ); } |
#include <bits/stdc++.h> using namespace std; #define ll long long int n,m; char a[6][6]; bool used[6][6]; int ans; void dfs(int x,int y) { if(a[x][y]== * ) { ans++; } if(x==n&&y==m) { cout << ans; exit(0); } if(x+1<=n&&a[x+1][y]== * ) { dfs(x+1,y); } if(y+1<=m&&a[x][y+1]== * ) { dfs(x,y+1); } if(y+1<=m) { dfs(x,y+1); } if(x+1<=n) { dfs(x+1,y); } } int main() { cin >> n >> m; for(int i = 1;i<=n;i++) { for(int j = 1;j<=m;j++) { cin >> a[i][j]; } } dfs(1,1); } |
#include <bits/stdc++.h> using namespace std; int main() { iostream::sync_with_stdio(0); int a, b, c, d; cin >> a >> b >> c >> d; for (int i = a; i <= 200; i++) { for (int j = b; j <= 200; j++) { for (int k = 1; k <= 200; k++) { if (a * 2 >= i && b * 2 >= j && c <= k && c * 2 >= k && i > d * 2 && j > d * 2 && d <= k && d * 2 >= k && i > j && j > k) { cout << i << endl << j << endl << k << endl; return 0; } } } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int visit[100005]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; char a[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (i == 0 && j == 0) { a[i][j] = W ; } else { a[i][j] = B ; } } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << a[i][j]; } cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; struct Edge { int from, to; Edge(int f, int t) : from(f), to(t) {} }; vector<Edge> edges; vector<int> G[100005]; int h[100005]; void add_edge(int from, int to) { edges.push_back(Edge(from, to)); int m = edges.size(); G[from].push_back(m - 1); return; } void bfs(int x) { queue<int> Q; Q.push(x); int cnt = 1, first = 1; h[x] = cnt; while (!Q.empty()) { int u = Q.front(); Q.pop(); if (h[u] == cnt && first) { cnt++; first = 0; } for (int i = 0; i < G[u].size(); i++) { Edge &e = edges[G[u][i]]; if (!h[e.to]) { h[e.to] = cnt; Q.push(e.to); } } first = 1; } } int main() { int n; while (scanf( %d , &n) != EOF) { for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d %d , &u, &v); add_edge(u, v); add_edge(v, u); } memset(h, 0, sizeof(h)); bfs(1); double sum = 0.0; for (int i = 1; i <= n; i++) { if (h[i] != 0) sum += (double)1 / h[i]; } printf( %lf n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; int pot(int x, int y) { if (y == 0) { return 1; } else { return x * pot(x, y - 1); } } int bin(int x, int y) { if ((x == 0 && y != 0) || (y == 0 && x != 0)) { return 1; } else { return bin(x, y - 1) + bin(x - 1, y); } } void strlwr(string& s) { for (int i = 0; (unsigned)i < s.size(); i++) { if (s[i] >= A && s[i] <= Z ) { s[i] += 32; } } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int a[26] = {}; int n; string s; cin >> s; n = s.size(); for (int i = 0; i < n; i++) { a[s[i] - a ]++; } int k = 25; for (int i = 0; i < n; i++) { while (a[k] == 0 && k > 0) { k--; } if (s[i] - a < k) { a[s[i] - a ]--; } if (s[i] - a == k) { a[s[i] - a ]--; cout << s[i]; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int i; long n, m; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; map<string, int> mp; string s; while (n--) { cin >> s; mp[s]++; if (mp[s] > 1) { cout << YES << endl; } else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans[52]; memset(ans, 0, sizeof(ans)); int flag = 0; for (int i = 0; i < n; ++i) { int arr[52]; memset(arr, 0, sizeof(arr)); for (int j = 0; j < n; ++j) { int k; cin >> k; arr[k]++; } for (int j = 0; j < n; ++j) { if (arr[j] == n - j) { ans[i] = j; if (j == n - 1) { ans[i] += flag; flag++; } break; } } } for (int i = 0; i < n; ++i) { if (ans[i] == 0) ans[i] = n; cout << ans[i] << ; } } |
#include <bits/stdc++.h> int const MOD = 998244353; int main() { std::ios::sync_with_stdio(0); std::cin.tie(0); int n, nopt; std::cin >> n >> nopt; std::vector<int> h; h.reserve(n + 1); h.resize(n); for (int& hi : h) std::cin >> hi; h.push_back(h[0]); std::vector<int> f{1}; f.reserve(n * 2 + 1); std::vector<int> g; g.reserve(n * 2 + 1); for (int i = 0; i < n; ++i) { if (h[i] == h[i + 1]) { for (auto& fi : f) fi = int(fi * (int64_t)nopt % MOD); f.insert(begin(f), 0); f.push_back(0); } else { g.assign(begin(f), end(f)); g.push_back(0); g.push_back(0); assert(nopt - 2 >= 0); std::transform(begin(f), end(f), ++begin(g), ++begin(g), [nopt](int fi, int gi) { return int((gi + fi * int64_t(nopt - 2)) % MOD); }); std::transform(begin(f), end(f), ++ ++begin(g), ++ ++begin(g), [](int fi, int gi) { return gi + fi >= MOD ? gi + fi - MOD : gi + fi; }); std::swap(f, g); } } std::cout << std::accumulate(begin(f) + n + 1, end(f), 0LL) % MOD << n ; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; int arr[maxn]; int main() { int T; cin >> T; while (T--) { int n; cin >> n; for (int i = 0; i < n; ++i) cin >> arr[i]; for (int i = 0; i < n; ++i) { if (i % 2) { if (arr[i] > 0) arr[i] = -arr[i]; } else { if (arr[i] < 0) arr[i] = -arr[i]; } } for (int i = 0; i < n; ++i) cout << arr[i] << ; cout << endl; } return 0; } |
/* https://codeforces.com/blog/entry/87523 */ #include <stdio.h> #include <stdlib.h> #include <string.h> #define N 100000 int *ej[N], eo[N]; void append(int i, int j) { int o = eo[i]++; if (o >= 2 && (o & o - 1) == 0) ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]); ej[i][o] = j; } int main() { static int dd[N], ll[N + 1], qu[N], *qq[N], kk[N], dp[N + 1], dq[N + 1]; static char ans[N + 1]; int n, x, y, h, i, d, d_, k, s, cnt; scanf( %d%d , &n, &x); for (i = 0; i < n; i++) ej[i] = (int *) malloc(2 * sizeof *ej[i]); for (i = 1; i < n; i++) { int p; scanf( %d , &p), p--; append(p, i); } for (i = 1; i < n; i++) dd[i] = n; cnt = 0, qu[cnt++] = 0; for (d = 0; d < n && cnt; d++) { qq[d] = (int *) malloc(cnt * sizeof *qq[d]), memcpy(qq[d], qu, (kk[d] = cnt) * sizeof *qu); cnt = 0; for (h = 0; h < kk[d]; h++) { int o; i = qq[d][h]; for (o = eo[i]; o--; ) { int j = ej[i][o]; qu[cnt++] = j; } } } d_ = d; for (d = 0; d < d_; d++) ll[kk[d]]++; dp[0] = -1; for (k = 1; k <= n; k++) { if (ll[k] == 0) continue; for (s = 0; s <= n; s++) dq[s] = dp[s] ? 0 : (s >= k && dq[s - k] < ll[k] ? dq[s - k] : ll[k]) + 1; for (s = 0; s <= n; s++) if (!dp[s] && dq[s] <= ll[k]) dp[s] = k; } if (dp[x]) { printf( %d n , d_); memset(ll, 0, (n + 1) * sizeof *ll); for (k = n, s = x; k >= 1; k--) while (dp[s] == k) s -= k, ll[k]++; for (d = 0; d < d_; d++) if (ll[kk[d]]) { ll[kk[d]]--; for (h = 0; h < kk[d]; h++) ans[qq[d][h]] = a ; } else for (h = 0; h < kk[d]; h++) ans[qq[d][h]] = b ; } else { printf( %d n , d_ + 1); y = n - x; for (d = 0; d < d_; d++) if (x >= kk[d]) for (h = 0; h < kk[d]; h++) ans[qq[d][h]] = a , x--; else if (y >= kk[d]) for (h = 0; h < kk[d]; h++) ans[qq[d][h]] = b , y--; else { for (h = 0; h < kk[d]; h++) { i = qq[d][h]; if (eo[i]) ans[i] = a , x--; } for (h = 0; h < kk[d]; h++) { i = qq[d][h]; if (!eo[i]) { if (x > 0) ans[i] = a , x--; else ans[i] = b , y--; } } } } printf( %s n , ans); return 0; } |
#include <bits/stdc++.h> #ifdef ALGO #include el_psy_congroo.hpp #else #define DUMP(...) 1145141919810 #define CHECK(...) (__VA_ARGS__) #endif struct Dsu { std::vector<int> dsu; explicit Dsu(int size) : dsu(size) { std::iota(dsu.begin(), dsu.end(), 0); } int find(int x) { return dsu[x] == x ? x : dsu[x] = find(dsu[x]); } }; using LL = long long; LL binom2(int x) { if (x < 2) return 0; return x * 1LL * (x - 1) / 2; } struct Solver { int n; std::vector<std::vector<int>> edges; std::vector<int> sz; std::vector<int> parent; Solver(int n, std::vector<std::vector<int>> edges) : n(n), edges(edges), sz(n), parent(n, -1) {} void dfs(int u, int fa) { parent[u] = fa; sz[u] = 1; for (int v : edges[u]) if (v != fa) { dfs(v, u); sz[u] += sz[v]; } } void solve() { dfs(0, -1); std::vector<LL> result(n + 1); for (int v : edges[0]) result[0] += binom2(sz[v]); std::set<int> eds; Dsu dsu(n); std::vector<bool> mark(n); mark[0] = true; std::set<int> r1; for (int u = 1; u < n; ++u) { if (!mark[u]) { eds.emplace(u); for (int v = u; ; v = dsu.find(v)) { mark[v] = true; int w = parent[v]; if (w == 0) break; if (eds.count(w)) { eds.erase(w); } dsu.dsu[v] = w; } } r1.emplace(dsu.find(u)); if (r1.size() != eds.size()) { break; } if (eds.size() == 2) { LL val = 1; for (int v : eds) val *= sz[v]; result[u + 1] += val; } else if (eds.size() == 1) { LL val = sz[*eds.begin()]; val *= n - sz[dsu.find(u)]; result[u + 1] += val; } if (u > 1) result[u] -= result[u + 1]; } result[1] = binom2(n) - std::accumulate(result.begin(), result.end(), 0LL); for (int i = 0; i <= n; ++i) printf( %lld%c , result[i], n [i == n]); } }; int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::istream& reader = std::cin; int cas; reader >> cas; while (cas--) { int n; reader >> n; std::vector<std::vector<int>> edges(n); for (int i = 0; i < n - 1; ++i) { int x, y; reader >> x >> y; edges[x].emplace_back(y); edges[y].emplace_back(x); } Solver(n, edges).solve(); } } |
#include <bits/stdc++.h> using namespace std; const long long maxm = 1e+18; vector<long long> prime; long long power(long long x, long long y) { long long res = 1; x = x % 1000000007; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res; } void primeFactors(long long n) { prime.clear(); while (n % 2 == 0) { prime.push_back(2); n = n / 2; } for (int i = 3; i <= sqrt(n); i = i + 2) { while (n % i == 0) { prime.push_back(i); n = n / i; } } if (n > 2) prime.push_back(n); } long long getRes(long long n, long long p) { long long res = 1; long long x[101]; long long i = 1; long long j = 0; long long z = p; while (true) { if (z > n) break; x[j++] = n / z; if (maxm / z < p) break; z *= p; i++; } for (int i = 0; i < j - 1; i++) { x[i] -= x[i + 1]; } long long mul = 1; for (int i = 0; i < j; i++) { long long val = power(power(p, mul), x[i]); res = (res * (val) % 1000000007) % 1000000007; mul += 1; } return res; } int main() { long long x, n; cin >> x >> n; primeFactors(x); vector<long long>::iterator ip; ip = std::unique(prime.begin(), prime.end()); prime.resize(std::distance(prime.begin(), ip)); long long ans = 1; for (int i = 0; i < prime.size(); i++) { long long res = getRes(n, prime[i]); ans = (ans * res) % 1000000007; } cout << ans << n ; } |
#include <bits/stdc++.h> int g[(1 << 22)][4], f[23], n, m, a, b; void output(int v, int u) { if (u == 0) return; if (v == 0) return; output(g[v][1], u - 1); printf( %d , g[v][2]); } int cnt(int v) { int ret = 0; for (; v; v >>= 1) if (v & 1) ret++; return ret; } int main(void) { memset(g, 127, sizeof(g)); scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d%d , &a, &b), f[a] |= 1 << (b - 1), f[b] |= 1 << (a - 1); for (int i = 1; i <= n; i++) f[i] |= 1 << (i - 1), g[f[i]][1] = 0, g[f[i]][2] = i, g[f[i]][3] = 0; for (int i = 1; i <= n; i++) g[f[i]][3]++; for (int i = 1; i <= n; i++) if (g[f[i]][3] == cnt(f[i])) g[f[i]][0] = 0; else g[f[i]][0] = 1; for (int i = 1; i <= (1 << n) - 1; i++) if (g[i][0]) for (int j = 1; j <= n; j++) if ((i | (1 << (j - 1))) == i) { int gf = i | f[j]; if (g[gf][0] > g[i][0] + 1) g[gf][0] = g[i][0] + 1, g[gf][1] = i, g[gf][2] = j; } printf( %d n , g[(1 << n) - 1][0]); output((1 << n) - 1, g[(1 << n) - 1][0]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } const int N = 3e5 + 5; long long a[N]; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; string open = ([{< ; string close = )]}> ; map<char, char> closeMp; for (int i = 0; i < 4; i++) closeMp[close[i]] = open[i]; stack<char> st; int ans = 0; for (auto i : s) { if (closeMp.count(i) == 0) { st.push(i); } else { if (st.empty()) return cout << Impossible , 0; else { if (st.top() != closeMp[i]) ans++; st.pop(); } } } if (st.empty()) cout << ans; else cout << Impossible ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long find_smallest_number_with_cumulative_sum_greater_or_equal_than_sum( long long sum) { long long lower = 0, upper = (long long)15E8, mid; while (lower < upper) { mid = (lower + upper) / 2; if (mid * (mid + 1) / 2 >= sum) upper = mid; else lower = mid + 1; } return lower; } long long find_answer(long long n, long long H) { long long lower = H - 1, upper = (long long)15E8, mid; while (lower < upper) { mid = (lower + upper) / 2; long long current_sum = mid * (mid + 1) / 2 - H * (H - 1) / 2; long long remaining_sum = n - current_sum; if (find_smallest_number_with_cumulative_sum_greater_or_equal_than_sum( remaining_sum) <= mid + 1) upper = mid; else lower = mid + 1; } long long current_sum = lower * (lower + 1) / 2 - H * (H - 1) / 2; long long remaining_sum = n - current_sum; long long total_blocks_till_now = lower - (H - 1); return total_blocks_till_now + find_smallest_number_with_cumulative_sum_greater_or_equal_than_sum( remaining_sum); } int main() { long long n, H; cin >> n >> H; cout << find_answer(n, H) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int A, int B) { if (B == 0) return A; else return gcd(B, A % B); } long long int mod_exponentiation(long long int base, long long int exponent, int modulus) { long long int result = 1; while (exponent > 0) { if (exponent % 2 == 1) result = (result * base) % modulus; exponent = exponent >> 1; base = (base * base) % modulus; } return result; } int fermat(long long int n, long long int m) { return mod_exponentiation(n, m - 2, m); } struct node { int a; int cnt; }; struct Compare { bool operator()(node &a, node &b) { return a.cnt > b.cnt; } }; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template <class T> inline T sqr(T x) { return x * x; } int main() { int n; cin >> n; int a[8]; for (int i = 0; i < 7; i++) { cin >> a[i + 1]; } int sum = 0; for (int i = 1; i <= 7;) { sum += a[i]; if (sum >= n) { cout << i; return 0; } i++; if (i > 7) { i %= 7; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 200006; vector<vector<int> > edges(N); vector<int> color; bool bipartite; vector<pair<int, int> > e; int n, m; void dfs(int node, int c) { color[node] = c; for (auto to : edges[node]) { if (color[to] == -1) { dfs(to, c ^ 1); } else { if (color[to] == color[node]) { bipartite = false; } } } return; } int main() { cin >> n >> m; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; x--; y--; edges[x].push_back(y); edges[y].push_back(x); e.push_back(make_pair(x, y)); } bipartite = true; color = vector<int>(n, -1); dfs(0, 0); if (!bipartite) { cout << NO n ; return 0; } cout << YES n ; for (int i = 0; i < m; i++) { cout << (color[e[i].first] < color[e[i].second]); } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int ask(string q, int x) { cout << q << << x << endl; int ret; cin >> ret; return ret; } int getclosestnode(vector<vector<int>> &adj, set<int> &me, int node) { bool visited[1001]; memset(visited, 0, sizeof visited); queue<int> q; q.push(node); while (!q.empty()) { int u = q.front(); q.pop(); if (me.count(u) != 0) return u; else for (auto x : adj[u]) if (!visited[x]) { q.push(x); visited[x] = 1; } } return -1; } void solve() { int n; vector<vector<int>> adj(1001); cin >> n; for (int i = 0; i < (int)(n - 1); i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } set<int> me, li; int k; cin >> k; for (int i = 0; i < (int)(k); i++) { int a; cin >> a; me.insert(a); } cin >> k; for (int i = 0; i < (int)(k); i++) { int a; cin >> a; li.insert(a); } int node = ask( B , *li.begin()); if (me.count(node) != 0) cout << C << node << endl; else { int closest = getclosestnode(adj, me, node); int liclose = ask( A , closest); if (li.count(liclose) != 0) { cout << C << closest << endl; } else cout << C << -1 << endl; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int tc; cin >> tc; for (int i = 0; i < (int)(tc); i++) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct arc_t { int u, v, c; arc_t(int _u, int _v, int _c) : u(_u), v(_v), c(_c) {} bool operator<(const arc_t& rhs) const { return c < rhs.c; } }; int pa[2001]; void set_init(int n) { for (int i = 1; i <= n; i++) pa[i] = i; } int set_find(int x) { return pa[x] == x ? x : pa[x] = set_find(pa[x]); } int set_union(int x, int y) { x = set_find(x); y = set_find(y); if (x == y) { return -1; } pa[y] = x; return 0; } int f[2001][2001]; vector<pair<int, int> > G[2001]; long long d[2001][2001]; int root; vector<bool> mark; int dfs(int u) { mark[u] = true; for (vector<pair<int, int> >::iterator i = G[u].begin(); i != G[u].end(); i++) { int v = i->first; if (!mark[v]) { d[root][v] = d[root][u] + i->second; dfs(v); } } } int getd(int _r) { root = _r; mark.clear(); mark.resize(2001, false); d[_r][_r] = 0; dfs(_r); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf( %d , &f[i][j]); vector<arc_t> arc; arc.reserve(n * n / 2 + 1); for (int i = 1; i <= n; i++) { if (f[i][i]) { puts( NO ); return 0; } for (int j = i + 1; j <= n; j++) { if (!f[i][j] || f[i][j] != f[j][i]) { puts( NO ); return 0; } arc.push_back(arc_t(i, j, f[i][j])); } } sort(arc.begin(), arc.end()); set_init(n); for (vector<arc_t>::iterator it = arc.begin(); it != arc.end(); it++) { if (!set_union(it->u, it->v)) { G[it->u].push_back(make_pair(it->v, it->c)); G[it->v].push_back(make_pair(it->u, it->c)); } } for (int i = 1; i <= n; i++) { getd(i); } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (d[i][j] != f[i][j]) { puts( NO ); return 0; } puts( YES ); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3, Ofast , inline ) using namespace std; const long long mod = 1e9 + 7; const long long M = 1e8 + 5; const long long N = 6e5 + 5; char s[N]; bool check() { map<char, long long> mp; long long len = strlen(s + 1); long long l = 1; while (s[l] == a ) l++; if (l == 1) return 0; long long pos = l; while (s[l] == b ) l++; if (l == pos) return 0; while (s[l] == c ) l++; if (l != len + 1) return 0; for (register long long i = 1; i <= len; i++) mp[s[i]]++; if (mp[ c ] == mp[ a ] || mp[ c ] == mp[ b ]) return 1; return 0; } inline void solve() { scanf( %s , s + 1); puts(check() ? YES : NO ); } signed main() { long long T = 1; for (long long index = 1; index <= T; index++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxx = 1e2 + 10; int a[maxx], b[maxx]; int n; inline bool check(int m) { int max1 = 0, max2 = 0; for (int i = 1; i <= n; i++) { if (a[i] && !b[i]) max1 += m; else if (a[i] && b[i]) max1 += 1, max2 += 1; else if (!a[i] && b[i]) max2 += 1; else ; } return max1 > max2; } int main() { while (cin >> n && n) { for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; int l = 1, r = 1e7, mid; int ans = -1; while (l <= r) { mid = l + r >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s, ans; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; cin.ignore(numeric_limits<streamsize>::max(), n ); cin >> s; bool flag = true; int cnt = 0, max_cnt = 0; for (int i = 0; i < n - 1; ++i) { string sub = s.substr(i, 2); cnt = 0; for (int j = 0; j < n - 1; ++j) { flag = true; for (int k = 0; k < 2; ++k) { if (sub[k] != s[j + k]) flag = false; } if (flag) ++cnt; if (cnt > max_cnt) { max_cnt = cnt; ans = sub; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int FFTMOD = 1007681537; const int INF = (int)1e9; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return val < a ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } inline long long isqrt(long long k) { long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; } inline int sign(long double x, long double y) { return sign(x - y); } const int maxn = 2e5 + 5; int n; vector<int> adj[maxn]; int par[maxn]; int size[maxn]; int f[maxn]; void dfs(int u, int p) { size[u] = 1; par[u] = p; for (int v : adj[u]) { if (v != p) { dfs(v, u); size[u] += size[v]; } } } void chemthan() { cin >> n; for (int i = (0); i < (n); ++i) { int u; cin >> u; u--; if (u != -1) { adj[u].push_back(i); adj[i].push_back(u); } } if (!(n & 1)) { cout << NO n ; return; } dfs(0, -1); for (int u = (0); u < (n); ++u) { int tot = 0; for (int v : adj[u]) { if (v != par[u]) { if (!(size[v] & 1)) { f[u]++; } tot += size[v]; } } tot = n - tot - 1; if (!(tot & 1) && tot) { f[u]++; } } static int deg[maxn]; static int rem[maxn]; for (int u = (0); u < (n); ++u) deg[u] = int((adj[u]).size()); set<int> st; for (int u = (0); u < (n); ++u) { if (!f[u] && !(deg[u] & 1)) { st.insert(u); } } vector<int> res; while (int((st).size())) { int u = *st.begin(); st.erase(u); if (deg[u] & 1) { continue; } res.push_back(u); rem[u] = 1; for (int v : adj[u]) { deg[v]--; f[v]--; if (!f[v] && !rem[v] && !(deg[v] & 1)) { st.insert(v); } } } if (int((res).size()) != n) { cout << NO n ; return; } cout << YES n ; for (int u : res) { cout << u + 1 << n ; } } int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0), cin.tie(0); if (argc > 1) { assert(freopen(argv[1], r , stdin)); } if (argc > 2) { assert(freopen(argv[2], wb , stdout)); } chemthan(); cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000010; int n, k; int C[MAXN]; void load() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , C + i); } bool A[MAXN]; int previ[MAXN]; int nexti[MAXN]; int last[MAXN]; void sito() { int x = 2; for (int i = 0; i < MAXN; i++) A[i] = true; while (x * x <= MAXN) { int y = MAXN - 1; while (y != x) { y = previ[y]; long long z = (long long)x * y; if (z >= MAXN) continue; last[z] = x; nexti[previ[z]] = nexti[z]; previ[nexti[z]] = previ[z]; A[z] = false; } x = nexti[x]; } } int CFactors[MAXN]; bool solve() { for (int i = 1; i < MAXN; i++) { previ[i] = i - 1; nexti[i] = i + 1; } sito(); for (int i = 0; i < MAXN; i++) if (A[i]) last[i] = i; for (int i = 0; i < n; i++) { int c = C[i]; while (c > 1) { int l = last[c]; int br = 0; while (c % l == 0) { br++; c /= l; } CFactors[l] = max(CFactors[l], br); } } while (k > 1) { int l = last[k]; int br = 0; while (k % l == 0) { br++; k /= l; } if (br > CFactors[l]) return false; } return true; } int main() { load(); if (solve()) printf( Yes n ); else printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; int n; cin >> n; if (n == 1 || n == 4 || n == 6 || n == 8 || n == 9 || n == 10 || n == 13 || n == 15) cout << 1 << endl; else cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int p[100]; long long u, v; int MOD; void addmod(int &x, int y) { x = (x + y) % MOD; } int dfs(long long minx, long long maxx, long long left, long long right, long long state, int step) { if (left <= minx && maxx <= right) { int ret = 0; long long r = (v >= state) ? ((v - state) >> step) : -1; long long l = (u - 1 >= state) ? ((u - 1 - state) >> step) : -1; if (r < 0LL) return 0; long long a = l + r + 1, b = r - l; if (a & 1) b >>= 1; else a >>= 1; ret = a % MOD * (b % MOD) % MOD; ret = (long long)ret * p[step] % MOD; addmod(ret, (r - l) % MOD * (state % MOD) % MOD); addmod(ret, (r - l) % MOD); return ret; } long long mid = (minx + maxx) / 2; int ret = 0; if (left <= mid) addmod(ret, dfs(minx, mid, left, right, state, step + 1)); if (right > mid) addmod(ret, dfs(mid + 1, maxx, left, right, state | (1LL << step), step + 1)); return ret; } int main() { long long n, l, r; int m; scanf( %I64d%d%d , &n, &m, &MOD); p[0] = 1 % MOD; for (int i = 1; i <= 90; ++i) { p[i] = (p[i - 1] * 2) % MOD; } for (int i = 0; i < m; ++i) { scanf( %I64d%I64d%I64d%I64d , &l, &r, &u, &v); u = max(0LL, u - 1); v = min(n - 1, v - 1); if (u > v) puts( 0 ); else printf( %d n , dfs(0, n - 1, l - 1, r - 1, 0, 0)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long MAX = 105; long long n, m, x, y, z, k; struct Matrix { long long row, col; long long m[MAX][MAX]; }; Matrix Multiply(Matrix A, Matrix B) { Matrix ans; ans.row = A.row; ans.col = B.col; for (long long i = 1; i <= A.row; i++) { for (long long j = 1; j <= B.col; j++) { ans.m[i][j] = 0; for (long long k = 1; k <= A.col; k++) { ans.m[i][j] += (A.m[i][k] * B.m[k][j]) % mod; if (ans.m[i][j] >= mod) ans.m[i][j] -= mod; } } } return ans; } Matrix Power(Matrix mat, long long p) { Matrix res; Matrix ans; ans.row = res.row = mat.row; ans.col = res.col = mat.col; long long n = ans.row; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { ans.m[i][j] = 0; res.m[i][j] = mat.m[i][j]; } ans.m[i][i] = 1; } while (p) { if (p % 2 == 1) ans = Multiply(ans, res); res = Multiply(res, res); p = p / 2; } return ans; } Matrix power(Matrix mat, long long p) { if (p == 1) return mat; if (p & 1) return Multiply(mat, power(mat, p - 1)); Matrix re = power(mat, (p / 2)); return Multiply(re, re); } Matrix mat; long long ara[MAX]; int main() { cin >> n >> k; for (long long i = 1; i <= n; i++) { scanf( %lld , &ara[i]); } if (k == 1) { cout << n << endl; return 0; } mat.row = mat.col = n; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { long long val = ara[i] ^ ara[j]; if (__builtin_popcountll(val) % 3 == 0) mat.m[i][j] = 1; else mat.m[i][j] = 0; } } mat = power(mat, k - 1); long long ans = 0; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { ans = (ans + mat.m[i][j]); if (ans >= mod) ans -= mod; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : (-x); } template <class T> T sqr(T x) { return x * x; } const int maxn = 1000 * 1000 * 2; const int BUBEN = 40; long long fib[BUBEN]; int a[maxn]; int n; long long X, Y; long long P; struct M { long long a[2][2]; M() { memset(a, 0, sizeof(a)); } long long* operator[](int x) { return a[x]; } M operator*(M m) { M res; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) for (int k = 0; k < 2; ++k) res[i][j] = (res[i][j] + a[i][k] * m[k][j]) % P; return res; } }; M pw(M x, long long y) { M res; res[0][0] = res[1][1] = 1; while (y) { if (y % 2LL == 1LL) res = res * x, --y; else x = x * x, y /= 2LL; } return res; } const double alpha = (1. + sqrt(5.)) * 0.5; bool cmp(pair<long long, long long> p, pair<long long, long long> q) { if (X >= BUBEN - 2) return p.first * alpha + p.second > q.first * alpha + q.second; return p.first * fib[X + 1] + p.second * fib[X] > q.first * fib[X + 1] + q.second * fib[X]; } int main() { fib[0] = 0; fib[1] = 1; for (int i = 2; i < BUBEN; ++i) fib[i] = fib[i - 1] + fib[i - 2]; cin >> n >> X >> Y >> P; long long sum = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); sum += a[i]; sum %= P; } sort(a, a + n); if (0) { vector<int> v; for (int i = 0; i < n; ++i) v.push_back(a[i]); for (int i = 0; i < X; ++i) { vector<int> w; w.push_back(v[0]); for (int j = 1; j < ((int)(v).size()); ++j) w.push_back(v[j - 1] + v[j]), w.push_back(v[j]); v = w; } sort((v).begin(), (v).end()); for (int i = 0; i < Y; ++i) { vector<int> w; w.push_back(v[0]); for (int j = 1; j < ((int)(v).size()); ++j) w.push_back(v[j - 1] + v[j]), w.push_back(v[j]); v = w; } long long res = 0; for (int i = 0; i < ((int)(v).size()); ++i) res += v[i]; res %= P; cerr << res << n ; } if (n == 1) { cout << (a[0] % P) << n ; return 0; } long long l1 = a[0], r1 = a[n - 1]; long long l2 = a[0]; pair<long long, long long> _r2(-1, -1); for (int i = 0; i < n - 1; ++i) { long long x = a[i], y = a[i + 1]; if (x < y) swap(x, y); pair<long long, long long> cur(x, y); if (cmp(cur, _r2)) _r2 = cur; } M mf; mf[0][0] = mf[0][1] = mf[1][0] = 1; M F = pw(mf, X); long long r2 = F[0][0] * (_r2.first % P) + F[0][1] * (_r2.second % P); r2 %= P; M m1; m1[0][0] = 3; m1[0][1] = (P - 1) % P; m1[1][1] = 1; M m2 = pw(m1, X); long long T1 = l1 + r1; long long T2 = l2 + r2; T1 %= P; T2 %= P; long long s0 = m2[0][0] * sum + m2[0][1] * (T1); s0 %= P; M m3 = pw(m1, Y); long long res = m3[0][0] * s0 + m3[0][1] * (T2); res %= P; res += P; res %= P; cout << res << n ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.