func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int ntest = 0, test = 0; inline void init(); inline void run(); inline void stop() { ntest = test - 1; } int main() { init(); while (++test <= ntest) { run(); } return 0; } const int INF = (int)1E9 + 5; const double EPS = 1E-11; const long long MOD = (long long)1E9 + 7; const int dx[] = {-1, 0, 0, 1}; const int dy[] = {0, -1, 1, 0}; inline void init() { ntest = 1; } long long mu(long long a, long long n) { long long rs = 1; for (; n; n >>= 1) { if (n & 1) rs = (rs * a) % MOD; a = (a * a) % MOD; } return rs; } vector<int> a; inline void run() { int n, k; cin >> n >> k; a.resize(n); for (int i = 0; i < (n); i++) cin >> a[i]; if (k == 0) { for (int i = 0; i < (n); i++) cout << a[i] << ; return; } for (int i = 0; i < (n); i++) { long long total = a[i]; long long cur = 1; for (int j = (1); j <= (i); j++) { cur = (cur * (k + j - 1)) % MOD; cur = (cur * mu(j, MOD - 2)) % MOD; total = (total + (cur * a[i - j]) % MOD) % MOD; } cout << total << ; } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const long long LL_INF = (long long)9.22e18; string s; int main() { cin >> s; bool isFirst = true; int cnt = 0; for (char ch : s) { if (ch == 1 && isFirst) { isFirst = false; continue; } if (ch == 0 && !isFirst) { cnt++; } } if (cnt >= 6 && !isFirst) { cout << yes << endl; } else { cout << no << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; int ans, pre, cnt; int main() { cin >> s; for (int i = 0; i < s.size(); i++) { pre += s[i] - 0 ; cnt++; if (cnt == 3 || (s[i] - 0 ) % 3 == 0 || pre % 3 == 0) ans++, pre = 0, cnt = 0; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using LL = long long; using pii = pair<int, int>; using UI = unsigned int; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; const double EPS = 1e-8; const double PI = acos(-1.0); const int N = 5e5 + 10; const int M = N + (1 << 20); int n, a[N][2]; int deg[1 << 20]; bool vis[N << 1]; vector<pii> G[M]; vector<int> ans; void dfs(int x, int idx) { pii p; while (G[x].size()) { p = G[x].back(); G[x].pop_back(); if (!vis[p.second]) { vis[p.second] = 1; dfs(p.first, p.second); } } if (idx != -1) { ans.emplace_back(idx); } } void add_edge(int x, int y, int idx) { G[x].emplace_back(y, idx); G[y].emplace_back(x, idx); } bool ok(int k) { int mask = (1 << k) - 1; for (int i = (0); i < ((1 << k)); ++i) { deg[i] = 0; } for (int i = (0); i < ((1 << k) + n); ++i) { G[i].clear(); } int x, y, z; int offset = 1 << k; for (int i = (0); i < (n); ++i) { x = a[i][0] & mask; y = a[i][1] & mask; deg[x] += 1; deg[y] += 1; add_edge(x, i + offset, i << 1); add_edge(y, i + offset, i << 1 | 1); } for (int i = (0); i < (1 << k); ++i) { if (deg[i] & 1) return 0; } for (int i = (0); i < (n << 1); ++i) { vis[i] = 0; } ans.clear(); for (int i = (0); i < (n + (1 << k)); ++i) { if (G[i].size()) { dfs(i, -1); break; } } if (ans.size() < n * 2) { return 0; } printf( %d n , k); for (int i = (0); i < (ans.size()); ++i) { printf( %d , ans[i] + 1); } puts( ); return 1; } int main() { scanf( %d , &n); for (int i = (0); i < (n); ++i) { scanf( %d %d , &a[i][0], &a[i][1]); } for (int i = (20); i > (0); --i) { if (ok(i)) { return 0; } } puts( 0 ); for (int i = (1); i < (n + 1); ++i) { printf( %d %d , i * 2 - 1, i * 2); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int tinf = (int)1e9 + 7; const long long inf = (long long)1e18 + 7; const int N = 1e5 + 5; long long n, x[10000], y[10000], ans; int main() { { ios ::sync_with_stdio(false); cin.tie(0); } cin >> n; for (int i = 0; i < n; i++) cin >> x[i] >> y[i]; for (int i = 1; i < n - 1; i++) if (y[i] > y[i - 1] && x[i + 1] < x[i]) ans++; else if (y[i] < y[i - 1] && x[i + 1] > x[i]) ans++; else if (x[i] > x[i - 1] && y[i + 1] > y[i]) ans++; else if (x[i] < x[i - 1] && y[i + 1] < y[i]) ans++; cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long second = 0; int r, m; cin >> m >> r; long long koef = 0, koef2 = 0; for (int i = 1; i <= m; ++i) { long long lef = i - 2, rig = m - i - 1; if (lef < 0) lef = 0; if (rig < 0) rig = 0; koef2 += i != 1; koef2 += i != m; koef += lef + rig; second += 2; if (i != 1) second += 2; if (i != m) second += 2; second += (lef + 1) * lef; second += (rig + 1) * rig; } long double ans = second + (2 * koef + koef2) * sqrt(2.0); printf( %.10f n , double(ans / (1LL * m * m) * r)); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long spf[100001]; long long fac[100001]; void sieve() { spf[1] = 1; for (long long i = 2; i < 100001; i++) spf[i] = i; for (long long i = 4; i < 100001; i += 2) spf[i] = 2; for (long long i = 3; i * i < 100001; i++) { if (spf[i] == i) { for (long long j = i * i; j < 100001; j += i) if (spf[j] == j) spf[j] = i; } } } map<long long, long long> getfactor(long long a) { map<long long, long long> m; while (a > 1) { m[spf[a]]++; a /= spf[a]; } return m; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long inverse(long long a, long long p) { return power(a, p - 2, p); } long long ncr(long long n, long long r, long long p) { if (r == 0) return 1; return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p; } void solve() { long long n; cin >> n; long long a[n]; long long hah[100001] = {0}, ans[100001] = {0}; for (long long i = 0; i < n; i++) { cin >> a[i]; hah[a[i]]++; } for (long long i = 100000; i >= 1; i--) { long long sum = 0; for (long long j = i; j <= 100000; j += i) { sum += hah[j]; ans[i] = (ans[i] - ans[j] + 1000000007) % 1000000007; if (ans[i] < 0) ans[i] = (ans[i] + 1000000007) % 1000000007; } ans[i] = (ans[i] % 1000000007 + power(2, sum, 1000000007) - 1 + 1000000007 + 1000000007) % 1000000007; } cout << ans[1] << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 100; const long long INF = 9 * (long long)(1e18); const long double PI = 3.14159265358979323846; long long int modexp(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (y == 0) return 1; else if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res % p; } vector<long long int> is_prime(N + 1, 1); void sieve(long long int n) { for (long long int i = 1; i <= n; i++) is_prime[i] = i; for (long long int i = 2; i * i <= n; i++) { if (is_prime[i] == i) { for (long long int j = i * i; j <= n; j += i) is_prime[j] = min(i, is_prime[j]); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int foo; cin >> foo; while (foo--) { long long int n; cin >> n; long long int x = (n + 3) / 4; string s = string(x, 8 ); n -= x; string s2 = string(n, 9 ); cout << s2 + s << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 50 + 10, dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; int main() { int n, m, x, y; while (~scanf( %d%d , &n, &m)) { getchar(); char a[N][N]; for (int i = 0; i < n; i++) { scanf( %s , a[i]); for (int j = 0; j < m; j++) { if (a[i][j] == S ) { x = i; y = j; } } } string str; cin >> str; int sum = 0, mmp[5], sz[5]; memset(sz, 0, sizeof(sz)); for (int i = 0; i < 4; i++) { mmp[0] = i; sz[i] = 1; for (int j = 0; j < 4; j++) { if (!sz[j]) { sz[j] = 1; mmp[1] = j; for (int k = 0; k < 4; k++) { if (!sz[k]) { mmp[2] = k; sz[k] = 1; for (int l = 0; l < 4; l++) { if (!sz[l]) { mmp[3] = l; int nx = x, ny = y; for (int zz = 0; zz < str.size(); zz++) { nx += dx[mmp[str[zz] - 0 ]]; ny += dy[mmp[str[zz] - 0 ]]; if (a[nx][ny] == # || !(nx >= 0 && nx < n && ny >= 0 && ny < m)) break; if (a[nx][ny] == E ) { sum++; break; } } } } sz[k] = 0; } } sz[j] = 0; } } sz[i] = 0; } printf( %d n , sum); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct MyStruct { long long val; long long under; long long scorev; long long scoreu; MyStruct(long long v, long long u, long long sv, long long su) : val(v), under(u), scorev(sv), scoreu(su) {} bool operator<(const MyStruct& m) const { return val < m.val; } }; int main() { ios_base::sync_with_stdio(false); long long n; cin >> n; long long a1[n], a2[n], b1[n], b2[n]; for (long long i = 0; i < n; ++i) cin >> a1[i] >> b1[i] >> a2[i] >> b2[i]; long long ans = 0; priority_queue<MyStruct> pq; for (long long i = 0; i < n; ++i) { long long cnum = a1[i] + b1[i], dnum = a2[i] + b2[i]; if (cnum < dnum) { if (a1[i] > b2[i]) { ans += a1[i] - b2[i]; } else if (b1[i] > a2[i]) { ans -= b1[i] - a2[i]; } continue; } if (cnum == dnum) { ans += (a1[i] - b2[i]); continue; } pq.push(MyStruct(cnum, dnum, a1[i], a2[i])); } bool first = true; while (!pq.empty()) { MyStruct top = pq.top(); pq.pop(); if (first) ans += top.scorev; else ans += (top.scorev - top.val); if (top.under != -1) pq.push(MyStruct(top.under, -1, top.scoreu, -1)); first = !first; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 9e18; const int mod = 4e4 + 7; vector<int> prime; bool p[100005]; void init() { p[1] = true; for (int i = 2; i <= 100005; i++) { if (!p[i]) { prime.push_back(i); for (int j = i + i; j < 100005; j += i) p[j] = true; } } } bool isp(int n) { for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } int main() { init(); int n; cin >> n; int s[100005]; int mx = 0; for (int i = 0; i < n; i++) scanf( %d , &s[i]), mx = max(mx, s[i]); sort(s, s + n); int ans = 1; int num[100005]; for (int i = 2; i <= mx; i++) num[i] = upper_bound(s, s + n, i) - lower_bound(s, s + n, i); for (int i = 0; i < prime.size(); i++) { int sum = 0; int x = prime[i]; for (int j = x; j <= mx; j++) { if (j % x == 0) sum += num[j]; } ans = max(ans, sum); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); int sum = 0; for (int i = 0; i < n; i++) { cin >> v[i]; sum += v[i]; } int req = sum / 2 - v[0] + 1; vector<pair<int, int> > v1; for (int i = 1; i < n; i++) { if (v[i] <= v[0] / 2) v1.push_back(make_pair(v[i], i)); } vector<int> v2; if (req > 0) for (int j = 0; j < v1.size(); j++) { req -= v1[j].first; v2.push_back(v1[j].second + 1); if (req <= 0) break; } if (req > 0) cout << 0 << endl; else { cout << v2.size() + 1 << endl; cout << 1 ; for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long int t, n, i, j, k, sum = 0, res = 0, maxi = -1, mini = 1000000100; cin >> n; long long int a[n + 1]; for (i = 0; i < n; i++) cin >> a[i]; long long int idx = 0; for (i = 31; i >= 0; i--) { long long int cnt = 0; for (j = 0; j < n; j++) { if ((a[j] >> i) & 1) { cnt++; idx = j; } if (cnt == 2) break; } if (cnt == 1) break; } swap(a[idx], a[0]); for (i = 0; i < n; i++) cout << a[i] << ; }
|
#include <bits/stdc++.h> const int MOD = 1E9 + 7; const int N = 150000 + 5; const int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1}; const int dy[] = {0, 0, -1, 1, -1, 1, -1, 1}; using namespace std; struct Edge { int nex, to; int w; Edge() {} Edge(int nex, int to, int w) : nex(nex), to(to), w(w) {} } edge[5151111]; int head[N]; int cnt; void addEdge(int from, int to, int w) { edge[++cnt].nex = head[from]; edge[cnt].to = to; edge[cnt].w = w; head[from] = cnt++; } vector<int> G[N]; vector<int> nex[N]; int dis[N]; bool vis[N]; int Find(int y, int w) { int left = 0, right = G[y].size() - 1; while (left <= right) { int mid = (left + right) / 2; if (G[y][mid] > w) right = mid - 1; else if (G[y][mid] < w) left = mid + 1; else return nex[y][mid]; } return w; } int SPFA(int s, int n) { memset(dis, 0x3f3f3f3f, sizeof(dis)); memset(vis, false, sizeof(vis)); vis[s] = true; dis[s] = Find(1, 0); queue<int> Q; Q.push(s); while (!Q.empty()) { int x = Q.front(); Q.pop(); vis[x] = false; for (int i = head[x]; i != -1; i = edge[i].nex) { int y = edge[i].to; int w = edge[i].w; int times = dis[x] + w; if (y != n) times = Find(y, times); if (dis[y] > times) { dis[y] = times; if (!vis[y]) { vis[y] = true; Q.push(y); } } } } return dis[n]; } int main() { int n, m; scanf( %d%d , &n, &m); memset(head, -1, sizeof(head)); for (int i = 1; i <= m; i++) { int x, y, w; scanf( %d%d%d , &x, &y, &w); addEdge(x, y, w); addEdge(y, x, w); } for (int i = 1; i <= n; i++) { int t; scanf( %d , &t); while (t--) { int x; scanf( %d , &x); G[i].push_back(x); } } for (int i = 1; i <= n; i++) { for (int j = G[i].size() - 1; j >= 0; j--) { int before; if (j == G[i].size() - 1 || G[i][j] != G[i][j + 1] - 1) before = G[i][j] + 1; nex[i].push_back(before); } reverse(nex[i].begin(), nex[i].end()); } int res = SPFA(1, n); if (res == 0x3f3f3f3f) res = -1; printf( %d n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int max_n = 100011, log_n = 32, max_m = 111, mod = 1000000007, inf = 1011111111, p = 997; long long n, pp[22], dp[max_n][22][2]; bool a[max_n][22]; long long ans; vector<int> v[max_n]; void dfs(int x, int p) { for (int i = 0; i < v[x].size(); ++i) { if (v[x][i] == p) continue; dfs(v[x][i], x); for (int q = 0; q < 22; ++q) { dp[x][q][a[x][q]] += dp[v[x][i]][q][0]; dp[x][q][1 - a[x][q]] += dp[v[x][i]][q][1]; } } long long ans1 = 0; for (int i = 0; i < v[x].size(); ++i) { if (v[x][i] == p) continue; for (int q = 0; q < 22; ++q) { dp[x][q][a[x][q]] -= dp[v[x][i]][q][0]; dp[x][q][1 - a[x][q]] -= dp[v[x][i]][q][1]; ans1 += pp[q] * dp[v[x][i]][q][0] * dp[x][q][1]; ans1 += pp[q] * dp[v[x][i]][q][1] * dp[x][q][0]; dp[x][q][a[x][q]] += dp[v[x][i]][q][0]; dp[x][q][1 - a[x][q]] += dp[v[x][i]][q][1]; } } ans1 /= 2; ans += ans1; for (int i = 0; i < 22; ++i) { dp[x][i][a[x][i]]++; ans += pp[i] * dp[x][i][1]; } } int main() { pp[0] = 1; for (int i = 1; i < 22; ++i) { pp[i] = pp[i - 1] * 2; } cin >> n; for (int i = 0; i < n; ++i) { int g; cin >> g; for (int q = 0; g; g /= 2, ++q) { a[i][q] = g % 2; } } for (int i = 1; i < n; ++i) { int g, h; cin >> g >> h; g--; h--; v[g].push_back(h); v[h].push_back(g); } dfs(0, -1); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 105; const int INF = 0x3f3f3f3f; const double pi = acos(-1.0); const double eps = 1e-9; int a[maxn]; int n; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; sort(a, a + n); int now = 10; int ans = 0; int anscnt = 0; bool flag = true; for (int i = 0; i < n; ++i) { if (flag) { now += a[i]; if (now == 360) { anscnt += i + 1; flag = false; } else if (now > 360) { anscnt += i; if (now <= 720) { flag = false; anscnt++; ans += now - 360; } else break; } } else { now += a[i]; if (now <= 720) { anscnt++; ans += now - 360; } else break; } } if (now <= 360) { anscnt = n; ans = 0; } cout << anscnt << << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long x, r, r1, s, s1, pos, pos1, nx = 0; int digits[19], index = 0; cin >> x; pos = 1; do { pos1 = pos; pos *= 10; r = x % pos; s = (x - r) / pos; r1 = r % pos1; s1 = (r - r1) / pos1; digits[index] = s1; index++; } while (s != 0); for (int i = index - 1; i >= 0; i--) { if (!(i == index - 1) || !(digits[i] == 9)) { if (digits[i] > 4) digits[i] = 9 - digits[i]; nx = nx + digits[i] * pos1; } else { nx = nx + digits[i] * pos1; } pos1 /= 10; } cout << nx << endl; return 0; }
|
#include <bits/stdc++.h> int main() { int val[105]; memset(val, 0, sizeof val); char arr[105]; scanf( %s , arr); int n = strlen(arr); for (int i = 0; i < n; i++) { if (arr[i] == A ) { if (i > 0) { val[i - 1] |= 1; } val[i] |= 1; if (i < n - 1) { val[i + 1] |= 1; } } else if (arr[i] == B ) { if (i > 0) { val[i - 1] |= (1 << 1); } val[i] |= (1 << 1); if (i < n - 1) { val[i + 1] |= (1 << 1); } } else if (arr[i] == C ) { if (i > 0) { val[i - 1] |= (1 << 2); } val[i] |= (1 << 2); if (i < n - 1) { val[i + 1] |= (1 << 2); } } } bool flag = false; for (int i = 0; i < n; i++) { if (val[i] == 7) { flag = true; break; } } if (flag) { printf( Yes n ); } else { printf( No n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool isPrime(long long n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { long long g = gcd(a, b); long long ans = (a * b) / g; return ans; } vector<long long> primes; bool prime[10005]; void seive() { memset(prime, 1, sizeof(prime)); prime[0] = 0; prime[1] = 0; for (long long i = 2; i <= 10000; i++) { if (prime[i] == 1) { for (long long j = i * i; j <= 10000; j += i) prime[j] = 0; } } } long long power(long long a, long long b) { long long ans = 1; while (b > 0) { if (b % 2 == 1) ans = (ans % 1000000007 * a % 1000000007) % 1000000007; a = (a * a) % 1000000007; b = b / 2; } return ans; } template <typename T> std::string NumberToString(T Number) { std::ostringstream ss; ss << Number; return ss.str(); } long long gcdExtended(long long a, long long b, long long *x, long long *y); long long modInverse(long long b, long long m) { long long x, y; long long g = gcdExtended(b, m, &x, &y); if (g != 1) return -1; return (x % m + m) % m; } long long modDivide(long long a, long long b, long long m) { a = a % m; long long inv = modInverse(b, m); return (inv * a) % m; } long long gcdExtended(long long a, long long b, long long *x, long long *y) { if (a == 0) { *x = 0, *y = 1; return b; } long long x1, y1; long long gcd = gcdExtended(b % a, a, &x1, &y1); *x = y1 - (b / a) * x1; *y = x1; return gcd; } long long n; vector<long long> v[100005]; vector<long long> ans; void dfs(long long u, long long p) { if (v[u].size() == 1 and p != 0) { ans.push_back(u); return; } for (auto x : v[u]) { if (x != p) { dfs(x, u); } } } void solve() { cin >> n; long long i, j; for (i = 0; i < n - 1; i++) { long long x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } long long ct = 0, root = 1; for (long long i = 1; i <= n; i++) { if (v[i].size() > 2) { root = i; ct++; } } if (ct > 1) { cout << No ; return; } cout << Yes << n ; dfs(root, 0); cout << ans.size() << n ; for (i = 0; i < ans.size(); i++) { cout << root << << ans[i] << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); bool codechef = 0; long long t = 1; if (codechef) { cin >> t; } while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } template <typename T> inline bool smin(T &a, const T &b) { return a > b ? a = b : a; } template <typename T> inline bool smax(T &a, const T &b) { return a < b ? a = b : a; } const int N = (int)1 << 15, mod = (int)998244353; int a[N], b[N], dp[N]; int pw(int a, int b) { return b != 0 ? (long long)pw((long long)a * a % mod, b >> 1) * (b & 1 ? a : 1) % mod : 1; } void NTT(int a[], int lg, bool inverse) { int N = 1 << lg; for (int i = 0; i < N; ++i) { int rev = 0; for (int j = 0; j < lg; ++j) if (i >> j & 1) rev |= 1 << (lg - j - 1); if (rev > i) swap(a[rev], a[i]); } for (int len = 2; len <= N; len <<= 1) { int wn = pw(3, (mod - 1) / len); if (inverse) wn = pw(wn, mod - 2); for (int j = 0; j < N; j += len) { int w = 1; for (int first = j, second = j + len / 2; second < j + len; ++first, ++second) { int u = a[first], v = (long long)a[second] * w % mod; a[first] = u + v; a[second] = u - v + mod; while (a[first] >= mod) a[first] -= mod; while (a[second] >= mod) a[second] -= mod; w = (long long)w * wn % mod; } } } if (inverse) { int div = pw(N, mod - 2); for (int i = 0; i < N; ++i) a[i] = (long long)a[i] * div % mod; } } int res[17][N], tmpa[17][N], tmpb[17][N]; void solve(int b, int e, int a[N], int d = 0) { if (b + 1 == e) { res[d][0] = 1; res[d][1] = a[b]; return; } int m = b + e >> 1; solve(b, m, a, d + 1); for (int j = 0; j <= (m - b); ++j) tmpa[d][j] = res[d + 1][j], res[d + 1][j] = 0; solve(m, e, a, d + 1); for (int j = 0; j <= (e - m); ++j) tmpb[d][j] = res[d + 1][j], res[d + 1][j] = 0; int lg = 0; while ((1 << lg) <= e - b) ++lg; NTT(tmpa[d], lg, false); NTT(tmpb[d], lg, false); for (int j = 0; j < (1 << lg); ++j) res[d][j] = (long long)tmpa[d][j] * tmpb[d][j] % mod, tmpa[d][j] = tmpb[d][j] = 0; NTT(res[d], lg, true); } int32_t main() { int n, k; cin >> n >> k; for (int j = 0; j < n; ++j) cin >> a[j]; int qm; cin >> qm; while (qm--) { int c; cin >> c; if (c == 1) { int q, p, d; cin >> q >> p >> d; --p; for (int j = 0; j < n; ++j) b[j] = q - a[j]; b[p] = q - d; } else { int q, l, r, d; cin >> q >> l >> r >> d; --l; for (int j = 0; j < n; ++j) b[j] = q - a[j]; for (int j = l; j < r; ++j) b[j] -= d; } for (int j = 0; j < n; ++j) b[j] = (b[j] % mod + mod) % mod; memset(res, 0, sizeof res); solve(0, n, b); cout << res[0][k] << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 25; int main() { int n, m, l, r, t, c; cin >> n >> m; pair<int, int> s[n + 1]; for (int i = (1), _b = (n + 1); i < (_b); ++i) s[i] = make_pair(0, 0); for (int i = (0), _b = (m); i < (_b); ++i) { cin >> l >> r >> t >> c; for (int j = (l), _b = (r + 1); j < (_b); ++j) { if (!s[j].second) s[j] = make_pair(t, c); else { if (t < s[j].first) { s[j] = make_pair(t, c); } } } } int ret = 0; for (int i = (1), _b = (n + 1); i < (_b); ++i) { ret += s[i].second; } cout << ret << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, A, B, scc[75], tot[75], fa[75], ans[75], f[75][1 << 16]; int c, To[405], nxt[405], cst[405], Head[75]; bool vis[75][1 << 16]; inline int Read() { int x = 0, f = 1; char ch = getchar(); while (ch < 48 || ch > 57) { if (ch == - ) f = -1; ch = getchar(); } while (ch > 47 && ch < 58) { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); } return x * f; } inline void Write(int x) { if (x < 0) putchar( - ), x = -x; if (x > 9) Write(x / 10); putchar(48 + x % 10); } void ad_ed(int u, int v, int ct) { nxt[++c] = Head[u]; To[c] = v; cst[c] = ct; Head[u] = c; } int Find(int x) { if (fa[x] != x) fa[x] = Find(fa[x]); return fa[x]; } void Merge(int x, int y) { int rx = Find(x), ry = Find(y); if (rx != ry) fa[ry] = rx, tot[rx] += tot[ry]; } struct info { int id, dis, st; friend bool operator<(info a, info b) { return a.dis > b.dis; } }; priority_queue<info> q; int main() { n = Read(); m = Read(); A = Read(); B = Read(); if (A > B) swap(A, B); for (int i = 1; i <= n; i++) fa[i] = i, tot[i] = 1, ans[i] = 0x3f3f3f3f; memset(f, 0x3f, sizeof(f)); for (int i = 1; i <= m; i++) { int u = Read(), v = Read(), ct = Read(); ad_ed(u, v, ct); ad_ed(v, u, ct); if (ct == A) Merge(u, v); } int idx = 0; for (int i = 1; i <= n; i++) if (!scc[i] && tot[Find(i)] > 3) { idx++; for (int j = 1; j <= n; j++) if (Find(j) == Find(i)) scc[j] = idx; } int beg_st = (!scc[1] ? 0 : 1 << scc[1]); f[1][beg_st] = 0; q.push(info{1, 0, beg_st}); while (!q.empty()) { info x = q.top(); q.pop(); if (vis[x.id][x.st]) continue; vis[x.id][x.st] = 1; ans[x.id] = min(ans[x.id], x.dis); for (int i = Head[x.id]; i; i = nxt[i]) { int v = To[i], ct = cst[i]; if (ct == A) { if (f[x.id][x.st] + ct < f[v][x.st]) { f[v][x.st] = f[x.id][x.st] + ct; q.push(info{v, f[v][x.st], x.st}); } } else if (ct == B) { if (Find(x.id) == Find(v)) continue; if (scc[v] && ((x.st >> scc[v]) & 1)) continue; int net = x.st | (1 << scc[v]); if (f[x.id][x.st] + ct < f[v][net]) { f[v][net] = f[x.id][x.st] + ct; q.push(info{v, f[v][net], net}); } } } } for (int i = 1; i <= n; i++) Write(ans[i]), putchar( ); return 0; }
|
#include <bits/stdc++.h> const long long INF = (1 << 30) - 1; const int MAXN = 100001; struct Node { int l, r; long long num; long long num2; long long delta; }; int n, m; long long t[MAXN]; int l[MAXN], r[MAXN]; long long q[MAXN]; Node tree[MAXN << 2]; void build(int cur, int l, int r) { tree[cur].l = l; tree[cur].r = r; tree[cur].delta = tree[cur].num = tree[cur].num2 = 0; if (l + 1 != r) { tree[cur].delta = 0; build((cur << 1) + 1, l, (l + r) >> 1); build((cur << 1) + 2, (l + r) >> 1, r); } } void update(int cur) { tree[(cur << 1) + 1].delta |= tree[cur].delta; tree[(cur << 1) + 2].delta |= tree[cur].delta; tree[(cur << 1) + 1].num |= tree[cur].delta; tree[(cur << 1) + 2].num |= tree[cur].delta; tree[(cur << 1) + 1].num2 |= tree[cur].delta; tree[(cur << 1) + 2].num2 |= tree[cur].delta; tree[cur].delta = 0; } void change(int cur, int l, int r, int delta) { if (l <= tree[cur].l && tree[cur].r <= r) { tree[cur].delta |= delta; tree[cur].num |= delta; tree[cur].num2 |= delta; } else { if (tree[cur].delta != 0) update(cur); int mid = (tree[cur].l + tree[cur].r) >> 1; if (l < mid) change((cur << 1) + 1, l, r, delta); if (r > mid) change((cur << 1) + 2, l, r, delta); tree[cur].num = tree[(cur << 1) + 1].num | tree[(cur << 1) + 2].num; tree[cur].num = tree[(cur << 1) + 1].num & tree[(cur << 1) + 2].num; } } long long query(int cur, int l, int r) { if (l <= tree[cur].l && tree[cur].r <= r) { return tree[cur].num2; } else { if (tree[cur].delta != 0) update(cur); int mid = (tree[cur].l + tree[cur].r) >> 1; long long ans = INF; if (l < mid) ans &= query((cur << 1) + 1, l, r); if (r > mid) ans &= query((cur << 1) + 2, l, r); return ans; } } int main() { scanf( %d%d , &n, &m); memset(t, 0LL, sizeof(t)); build(0, 1, n + 1); for (int i = 1; i <= m; i++) { scanf( %d%d%I64d , &l[i], &r[i], &q[i]); change(0, l[i], r[i] + 1, q[i]); } bool ok = true; for (int i = 1; i <= m; i++) { long long te = query(0, l[i], r[i] + 1); if (te != q[i]) { ok = false; break; } } if (ok) { printf( YES n ); for (int i = 1; i <= n; i++) { printf( %I64d , query(0, i, i + 1)); } printf( n ); } else { printf( NO n ); } return 0; }
|
#include <bits/stdc++.h> struct Node { Node(int v = 1, int pos = 1e9) { min = (v == 1 ? int(1e9) : pos); } Node(Node l, Node r) { min = std::min(l.min, r.min); } int min; }; template <class i_t, class e_t> class SegmentTree { public: void init(std::vector<e_t> base) { n = base.size(); tree.resize(2 * n); for (int i = 0; i < n; i++) { tree[i + n] = i_t(base[i], i); } for (int i = n - 1; i > 0; i--) { tree[i] = i_t(tree[i + i], tree[i + i + 1]); } } i_t qry(int l, int r) { i_t lp, rp; for (l += n, r += n; l < r; l /= 2, r /= 2) { if (l & 1) lp = i_t(lp, tree[l++]); if (r & 1) rp = i_t(tree[--r], rp); } return i_t(lp, rp); } void upd(int x, e_t v) { x += n; tree[x] = i_t(v, x - n); build(x); } private: int n; std::vector<i_t> tree; void build(int x) { for (x /= 2; x > 0; x /= 2) { tree[x] = i_t(tree[x + x + 1], tree[x + x]); } } }; struct Bucket { int n; SegmentTree<Node, int> tree; void init(int n) { this->n = n; tree.init(std::vector<int>(n, 0)); } void erase(int pos) { tree.upd(pos, 0); } int insert(int pos) { int x = tree.qry(pos, n).min; int ans = 0; if (x >= n) { x = tree.qry(0, pos).min; ans += n - pos + x; } else { ans += x - pos; } tree.upd(x, 1); return ans; } }; int main() { int h, m, n; std::cin >> h >> m >> n; int size = 1; for (int i = 2; i <= h; i++) { if (h % i == 0 && m % i == 0) { size = i; } } std::vector<Bucket> buckets(size); std::vector<int> hashBucket(h, 0); std::vector<int> posBucket(h, 0); std::map<int, std::pair<int, int> > idBucket; for (int i = 0; i < size; i++) { for (int j = 0, pos = i; j < h / size; j++, pos = (pos + m) % h) { posBucket[pos] = j; hashBucket[pos] = i; } buckets[i].init(h / size); } long long ans = 0; for (int i = 0; i < n; i++) { char t; int id; scanf( %c %d , &t, &id); if (t == + ) { int hash; scanf( %d , &hash); int got = buckets[hashBucket[hash]].insert(posBucket[hash]); idBucket[id] = std::pair<int, int>(hashBucket[hash], (posBucket[hash] + got) % (h / size)); ans += got; } else { auto it = idBucket.find(id); buckets[it->second.first].erase(it->second.second); idBucket.erase(it); } } std::cout << ans << std::endl; }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; vector<long long> fact(10005); long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long power(long long x, long long y) { long long temp; if (y == 0) return 1; temp = power(x, y / 2); if (y % 2 == 0) return temp * temp; else return x * temp * temp; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long modInv(long long n, long long p) { return power(n, p - 2, p); } long long ncr(long long n, long long r) { return (n >= r ? (fact[n] * modInv(fact[r], mod)) % mod * modInv(fact[n - r], mod) % mod : 0); } long long add(long long a, long long b) { long long z = a + b; if (z >= mod) z -= mod; return z; } long long mul(long long a, long long b) { return (a * b) % mod; } long long sub(long long a, long long b) { return (a - b + mod) % mod; } int main() { long long t = 1, n, i, j, m, cnt, f, ff; cin >> t; while (t--) { cin >> n >> mod; long long z = log2(n) - 1; long long ans = (n - (1 << (z + 1)) + 2) % mod; for (i = 0; i <= z; i++) { ans = mul(ans, (1 << i) + 1); } if (ans == 0) cout << mod - 1 << n ; else cout << ans - 1 << n ; } }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; vector<int> gr[(ll)(1e5 + 4)]; set<int> g[(ll)(1e5 + 4)]; bool vis[(ll)(1e5 + 4)]; int par[(ll)(1e5 + 4)], si[(ll)(1e5 + 4)]; int find(int no) { if (par[no] != no) { par[no] = find(par[no]); } return par[no]; } void join(int a, int b) { if (find(a) == find(b)) { return; } int pa = par[a], pb = par[b]; if (si[pa] < si[pb]) { swap(pa, pb); } si[pa] += si[pb]; si[pb] = 0; par[pb] = pa; } void dfs(int node) { cout << node << ; vis[node] = 1; for (int x : gr[node]) { if (!vis[x]) { dfs(x); } } } int main() { int t; cin >> t; while (t--) { int n; cin >> n; int ar[n][3]; for (int i = 0; i < n - 2; i++) { for (int j = 0; j < 3; j++) { cin >> ar[i][j]; int a = ar[i][j]; g[a].insert(i); } } set<pair<int, int>> sp; for (int i = 1; i <= n; i++) { par[i] = i, si[i] = 1; sp.insert(make_pair(g[i].size(), i)); } vector<int> qp; while (sp.size()) { auto p = *sp.begin(); sp.erase(sp.begin()); int ind = *g[p.second].begin(); qp.push_back(ind + 1); for (int j = 0; j < 3; j++) { int u = p.second; int v = ar[ind][j]; if (find(u) != find(v)) { gr[u].push_back(v); gr[v].push_back(u); } join(u, v); g[v].erase(ind); if (g[v].size()) { sp.insert(make_pair(g[v].size(), v)); } } while (sp.size() && sp.begin()->first > g[sp.begin()->second].size()) { sp.erase(sp.begin()); } } for (int i = 1; i <= n; i++) { if (gr[i].size() == 1 && vis[i] == 0) { dfs(i); cout << n ; } } for (int i = 0; i < qp.size(); i++) { cout << qp[i] << ; } cout << n ; for (int i = 0; i <= n; i++) { vis[i] = 0, gr[i].clear(), g[i].clear(); } } }
|
#include <bits/stdc++.h> using namespace std; int n, fwt[262144]; vector<int> a1, b1, c1, d1, e1, ans; void add(int x, int k) { for (; x < 262144; x += x & -x) { fwt[x] += k; } } int sum(int x) { int res = 0; for (; x; x -= x & -x) { res += fwt[x]; } return res; } int findSidx(int sum) { int x = 0; for (int j = 262144 / 2; j; j /= 2) { if (sum >= fwt[x + j]) { sum -= fwt[x + j]; x += j; } } return x; } vector<int> deB(vector<int>& a) { memset(fwt, 0, sizeof fwt); vector<int> res; for (int i = 0; i < n; ++i) { add(i + 1, 1); } for (int i = 0; i < n; ++i) { add(a[i] + 1, -1); res.push_back(sum(a[i] + 1)); } return res; } void makeA() { memset(fwt, 0, sizeof fwt); ans.resize(n, 0); for (int i = 0; i < n; ++i) { add(i + 1, 1); } for (int i = 0; i < n; ++i) { ans[i] = findSidx(e1[i]); add(ans[i] + 1, -1); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; a1.resize(n); b1.resize(n); e1.resize(n, 0); for (int i = 0; i < n; ++i) { cin >> a1[i]; } for (int j = 0; j < n; ++j) { cin >> b1[j]; } c1 = deB(a1), d1 = deB(b1); for (int i = n - 1; i >= 0; --i) { e1[i] += c1[i] + d1[i]; if (i) { e1[i - 1] += e1[i] / (n - i); } e1[i] %= (n - i); } makeA(); for (int i = 0; i < n; ++i) { cout << ans[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, temp, i, x = 0, arr[100] = {0}; map<long long, long long> inx; cin >> n; for (i = 0; i < n; i++) { cin >> temp; inx[temp] = i; } for (map<long long int, long long int>::iterator it = inx.begin(); it != inx.end(); ++it) { arr[it->second] = it->first; } cout << inx.size() << endl; for (i = 0; i < n; i++) { if (arr[i] != 0) cout << arr[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, ans; string str; long long solve() { cin >> n; long long v[1001]; for (long long i = 0; i <= n - 1; ++i) { long long t; cin >> t; v[i + 1] = t; } for (long long i = 1; i <= n; ++i) { long long a[n + 1]; for (long long i = 0; i <= n; ++i) a[i] = 0; a[i]++; long long t = i; while (1) { t = v[t]; a[t]++; if (a[t] == 2) { cout << t << ; break; } } } return 0; } signed main() { ios::sync_with_stdio(0); long long t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t, i; scanf( %d %d , &n, &t); if (n == 1 && t == 10) { printf( -1 n ); } else { if (t == 10) { t = 1; } printf( %d , t); for (i = 0; i < n - 1; i++) { printf( 0 ); } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n1, n2; int k1, k2; int main() { cin >> n1 >> n2 >> k1 >> k2; if (n1 > n2) cout << First << endl; else cout << Second << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[500001], t[500001]; long long nt[10000001], n, k, m; long long c[2]; void kmp(long long x, char a[]) { int i, j; for (nt[0] = j = -1, i = 1; i < x; nt[i++] = j) { while (~j && a[j + 1] != a[i]) j = nt[j]; if (a[j + 1] == a[i]) j++; } } int main() { scanf( %s , s); scanf( %s , t); n = strlen(t); kmp(n, t); k = nt[n - 1]; m = strlen(s); for (int i = 0; i < m; i++) c[s[i] - 0 ]++; for (int i = 0, j = 0; i < m; i++) { if (c[0] == 0) printf( 1 ); else if (c[1] == 0) printf( 0 ); else { printf( %c , t[j]); c[t[j] - 0 ]--; if (j == n - 1) j = nt[j]; j++; } } }
|
#include <bits/stdc++.h> using namespace std; int n, k, x, m, s; vector<int> f, t, f1; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 0; i < n; i++) { cin >> x >> m; f.push_back(x); t.push_back(m); } for (int i = 0; i < n; i++) { if (t[i] < k) { f1.push_back(f[i]); } else { s = f[i] - (t[i] - k); f1.push_back(s); } } sort(f1.begin(), f1.end()); cout << f1.back(); }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k, a[205], b[205]; cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; for (int j = 1; j <= k; j++) cin >> b[j]; if (k >= 2) { cout << Yes << endl; return 0; } if (a[1] == 0) a[1] = b[1]; for (int i = 2; i <= n; i++) { if (a[i] == 0) a[i] = b[1]; if (a[i] <= a[i - 1]) { cout << Yes << endl; return 0; } } cout << No << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void dbg(T a) {} template <typename T, typename... Arg> void dbg(T a, Arg... arg) {} const int maxn = (1e6) + 7; const int inf = (1e9) + 7; const long long LLinf = (1e18) + 7; const long double eps = 1e-9; const long long mod = 1e9 + 7; int ile(vector<int> V) { int res = 0; while (((int)(V).size()) && V.back() == 0) { V.pop_back(); res++; } if (((int)(V).size()) == 0) return 10000; return res; } int rob(vector<int> V, int a, int b) { int cnt = 0; for (int i = 0; i < ((int)(V).size()); i++) if (V[i] == a) { for (int j = i - 1; j >= 0; j--) { swap(V[j], V[j + 1]); cnt++; } break; } for (int i = 1; i < ((int)(V).size()); i++) if (V[i] == b) { for (int j = i - 1; j > 0; j--) { swap(V[j], V[j + 1]); cnt++; } break; } if (V[0] == a && V[1] == b) return cnt + ile(V); else return 1000; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<int> V; while (n > 0) { V.push_back(n % 10); n /= 10LL; } int res = 1000; res = min(res, rob(V, 0, 0)); res = min(res, rob(V, 5, 2)); res = min(res, rob(V, 0, 5)); res = min(res, rob(V, 5, 7)); if (res < 100) cout << res; else cout << -1 ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long i, j, k, l, r, m, s, t, n, a[11236], b[123456], z, c[168456], zam[17456], za[1234]; bool p[40000000]; long long xx, yy, x, y; int main() { cin >> n >> k; if (n == 2) { if (k == 1) cout << 01 ; else cout << -1; return 0; } if (n == 3) { if (k == 1) cout << 001 ; else if (k == 2) cout << 010 ; else cout << -1; return 0; } k++; if (n % 2 == 0) { m = n / 2; l = 1; for (i = 0; i < m; i++) l = l * 2; if (k > l / 2 * (l / 2 + 1)) { cout << -1; return 0; } x = l - 1; while (l < k) { k -= l; l -= 2; r = t; s = 0; for (i = 0; i < m; i++) { s = s * 2 + r % 2; r = r / 2; } p[x - s] = 1; p[s] = 1; t++; } j = t; for (i = 0; i < m; i++) { a[i] = t % 2; t /= 2; } for (i = m - 1; i >= 0; i--) cout << a[i]; t = 0; while (k > 0) { if (p[t] == 0) { k--; } if (k == 0) break; t++; } for (i = 0; i < m; i++) { a[i] = t % 2; t /= 2; } for (i = m - 1; i >= 0; i--) cout << a[i]; } else { long long ss = (1 << n) - 1; m = n / 2; l = 1; for (i = 0; i <= m; i++) l = l * 2; if (k > l * (l + 2) / 8) { cout << -1; return 0; } y = l / 2; z = y - 1; l--; x = l; t = 0; while (l < k) { k -= l; l -= 4; r = t; s = 0; for (i = 0; i < m; i++) { s = s * 2 + r % 2; r = r / 2; } p[z - s] = 1; p[s] = 1; p[z - s + y] = 1; p[s + y] = 1; t++; } j = t; r = t; s = 0; for (i = 0; i < m; i++) { s = s * 2 + r % 2; r = r / 2; } s = z - s; for (i = 0; i < m; i++) { a[i] = t % 2; t /= 2; } for (i = m - 1; i >= 0; i--) cout << a[i]; t = 0; while (k > 0) { if (p[t] == 0) { if (t == s) { p[t + y] = 1; } k--; } if (k == 0) break; t++; } for (i = 0; i <= m; i++) { a[i] = t % 2; t /= 2; } for (i = m; i >= 0; i--) cout << a[i]; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 5, inf = 1e9 + 7; long long n, k, cumm[N], m[26]; set<pair<long long, long long> > st; string s; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long i, j, a, b, ans = 1; cin >> n >> k >> s; s = # + s; for (i = 0; i < k; i++) st.insert(pair<long long, long long>(m[i], i)); for (i = 1; i < n + s.size(); i++) { if (i < s.size()) a = s[i] - a ; else a = st.begin()->second; st.erase(st.find(pair<long long, long long>(m[a], a))); if (m[a]) cumm[i] = cumm[i - 1] - cumm[m[a] - 1]; else cumm[i] = cumm[i - 1] + 1; m[a] = i; st.insert(pair<long long, long long>(m[a], a)); cumm[i] = (cumm[i] % inf + cumm[i - 1] + inf) % inf; } cout << (cumm[i - 1] + 1) % inf; }
|
#include <bits/stdc++.h> using namespace std; const int N = 3007; const int M = 998244353; int n, m, dp[N][N]; string s, t; bool matches(int i, char c) { if (i > m) return true; else return t[i - 1] == c; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> s >> t; n = s.size(); m = t.size(); for (int i = 1; i <= n + 1; i++) dp[i][i - 1] = 1; for (int d = 1; d <= n; d++) { char c = s[d - 1]; for (int i = 1, j = d; j <= n; i++, j++) { if (matches(i, c)) { dp[i][j] = (dp[i][j] + dp[i + 1][j]) % M; } if (matches(j, c)) { dp[i][j] = (dp[i][j] + dp[i][j - 1]) % M; } } } int ans = 0; for (int i = m; i <= n; i++) { ans = (ans + dp[1][i]) % M; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> char ans[100]; int n; int main() { scanf( %s%d , ans, &n); for (int i = 0; i < strlen(ans); i++) { if (ans[i] < a ) ans[i] += a - A ; if (ans[i] < 97 + n) ans[i] += A - a ; } printf( %s n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { int a[3]; cin >> a[0] >> a[1] >> a[2]; sort(a, a + 3); if (a[0] + a[1] >= a[2] - 1) { cout << Yes n ; } else cout << No n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void sf(T &res) { int f = 1; char c; res = 0; while (c = getchar(), !isdigit(c)) ; if (c == - ) f = -1, c = getchar(); do res = (res << 1) + (res << 3) + (c ^ 48); while (c = getchar(), isdigit(c)); res *= f; } long long h, q, L, R, pos, ANS; struct node { long long l, r; bool operator<(const node &a) const { if (l != a.l) return l < a.l; return r < a.r; } }; vector<node> v; int main() { sf(h), sf(q); L = 1ll << (h - 1); R = (1ll << h) - 1; while (q--) { long long l, r; int f, ans; sf(f), sf(l), sf(r), sf(ans); for (int j = f; j < h; j++) l *= 2, r = r * 2 + 1; if (ans) { if (L <= l - 1) v.push_back((node){L, l - 1}); if (r + 1 <= R) v.push_back((node){r + 1, R}); } else v.push_back((node){l, r}); } pos = L, ANS = -1; v.push_back((node){R + 1, R + 1}); sort(v.begin(), v.end()); for (int i = 0; i < v.size(); i++) { long long x = v[i].l, y = v[i].r; if (x > pos) { if (x - pos == 1) { if (ANS == -1) ANS = pos; else { puts( Data not sufficient! ); return 0; } } else { puts( Data not sufficient! ); return 0; } } pos = max(pos, y + 1); } if (ANS == -1) puts( Game cheated! ); else cout << ANS << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; set<pair<char, char> > V; char R[18][18], S[18][18]; int main(void) { int n, m; cin >> n >> m; bool test1 = (n >= 6 && m >= 3) || (n >= 3 && m >= 6); if (test1 == false) { cout << No solution. << endl; return 0; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { string w; cin >> w; R[i][j] = w[0]; S[i][j] = w[1]; V.insert(pair<char, char>(R[i][j], S[i][j])); } } set<pair<char, char> > Q; char TR[13] = { 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , T , J , Q , K , A }; char TS[4] = { C , D , H , S }; for (int i = 0; i < 4; i++) { for (int j = 0; j < 13; j++) { if (V.find(pair<char, char>(TR[j], TS[i])) == V.end()) { Q.insert(pair<char, char>(TR[j], TS[i])); } } } int jk1r, jk1c, jk2r, jk2c; jk1r = jk1c = jk2r = jk2c = -1; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (R[i][j] == J && S[i][j] == 1 ) { jk1r = i; jk1c = j; } else if (R[i][j] == J && S[i][j] == 2 ) { jk2r = i; jk2c = j; } } for (int r1 = 0; r1 + 2 < n; r1++) for (int c1 = 0; c1 + 2 < m; c1++) { for (int r2 = 0; r2 + 2 < n; r2++) for (int c2 = 0; c2 + 2 < m; c2++) { bool test2 = (r2 <= r1 + 2) && (r1 <= r2 + 2) && (c2 <= c1 + 2) && (c1 <= c2 + 2); if (test2) continue; for (int jr1 = 0; jr1 < 13; jr1++) for (int js1 = 0; js1 < 4; js1++) { for (int jr2 = 0; jr2 < 13; jr2++) for (int js2 = 0; js2 < 4; js2++) { char cr1 = TR[jr1], cr2 = TR[jr2], cs1 = TS[js1], cs2 = TS[js2]; if (jr1 == jr2 && js1 == js2) continue; if (Q.find(pair<char, char>(cr1, cs1)) == Q.end() || Q.find(pair<char, char>(cr2, cs2)) == Q.end()) continue; if (jk1r != -1) { R[jk1r][jk1c] = cr1; S[jk1r][jk1c] = cs1; } if (jk2r != -1) { R[jk2r][jk2c] = cr2; S[jk2r][jk2c] = cs2; } bool ok1 = true; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (S[r1][c1] != S[r1 + i][c1 + j]) { ok1 = false; break; } } bool ok2 = true; bool used2[256]; memset(used2, false, sizeof(used2)); for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (used2[(int)R[r1 + i][c1 + j]]) { ok2 = false; break; } used2[(int)R[r1 + i][c1 + j]] = true; } bool ok3 = true; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (S[r2][c2] != S[r2 + i][c2 + j]) { ok3 = false; break; } } bool ok4 = true; bool used4[256]; memset(used4, false, sizeof(used4)); for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (used4[(int)R[r2 + i][c2 + j]]) { ok4 = false; break; } used4[(int)R[r2 + i][c2 + j]] = true; } if ((ok1 || ok2) && (ok3 || ok4)) { cout << Solution exists. << endl; if (jk1r == -1 && jk2r == -1) { cout << There are no jokers. << endl; } else if (jk1r != -1 && jk2r != -1) { cout << Replace J1 with << R[jk1r][jk1c] << S[jk1r][jk1c] << and ; cout << J2 with << R[jk2r][jk2c] << S[jk2r][jk2c] << . << endl; } else if (jk1r != -1) { cout << Replace J1 with << R[jk1r][jk1c] << S[jk1r][jk1c] << . << endl; } else if (jk2r != -1) { cout << Replace J2 with << R[jk2r][jk2c] << S[jk2r][jk2c] << . << endl; } cout << Put the first square to ( << r1 + 1 << , << c1 + 1 << ). << endl; cout << Put the second square to ( << r2 + 1 << , << c2 + 1 << ). << endl; return 0; } } } } } cout << No solution. << endl; return 0; }
|
#include <bits/stdc++.h> char buf[1 << 21], *p1 = buf, *p2 = buf; using namespace std; template <class T> void rd(T &k) { char c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); int f = 1; k = 0; while (c < 0 || c > 9 ) { if (c == - ) f *= -1; c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); } while (c >= 0 && c <= 9 ) { k = k * 10 + c - 0 ; c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++); } k *= f; } const int N = 300005; int n, m, k, t, x, a[N], f[N]; int c[N], d[N]; long long ans; char p[N]; queue<int> q; int ok(int x) { if (a[x] > 0 && c[x - 1] + 1 <= 9 && c[x] + 1 <= 9) return 1; if (a[x] < 0 && c[x - 1] - 1 >= 0 && c[x] - 1 >= 0) return 1; return 0; } int main() { cin >> n; cin >> p + 1; for (int i = 1; i <= n; ++i) c[i] = p[i] - 48; cin >> p + 1; for (int i = 1; i <= n; ++i) d[i] = p[i] - 48; for (register int i = 1; i < n; ++i) { a[i + 1] = d[i] - (c[i] + a[i]); ans += abs(a[i + 1]); } if (c[n] + a[n] != d[n]) return cout << -1, 0; cout << ans << n ; int xx = min(ans, 100000ll); for (register int i = 2; i <= n; ++i) { if (a[i] > 0 && c[i - 1] + 1 <= 9 && c[i] + 1 <= 9) q.push(i), f[i] = 1; if (a[i] < 0 && c[i - 1] - 1 >= 0 && c[i] - 1 >= 0) q.push(i), f[i] = 1; } int x; while (xx--) { x = q.front(); q.pop(); while (f[x] == 0) { x = q.front(); q.pop(); } if (a[x] > 0) { cout << x - 1 << 1 n ; ++c[x - 1]; ++c[x]; --a[x]; } else { cout << x - 1 << -1 n ; --c[x - 1]; --c[x]; ++a[x]; } if (ok(x)) q.push(x); else f[x] = 0; if (x >= 3) { if (ok(x - 1)) { if (f[x - 1] == 0) q.push(x - 1); f[x - 1] = 1; } else f[x - 1] = 0; } if (x <= n - 1) { if (ok(x + 1)) { if (f[x + 1] == 0) q.push(x + 1); f[x + 1] = 1; } else f[x + 1] = 0; } } }
|
#include <bits/stdc++.h> using namespace std; string a, b; int main() { cin >> a >> b; if (a == b) { cout << a << endl; return 0; } else { cout << 1 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> bool gmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool gmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const long long N = 110; const long long K = 100010; const long long INF = 1e12; long long a[N], b[N], dp[N][2 * K]; long long n, k; long long Rec(long long idx, long long sum) { if (idx == n) { return sum ? -INF : 0; } long long& ans = dp[idx][sum + K]; if (ans + 1) return ans; ans = -INF; gmax(ans, Rec(idx + 1, sum)); gmax(ans, a[idx] + Rec(idx + 1, sum + a[idx] - b[idx])); return ans; } void solve() { cin >> n >> k; for (long long i = 0; i < (n); i++) cin >> a[i]; for (long long i = 0; i < (n); i++) cin >> b[i]; for (long long i = 0; i < (n); i++) b[i] *= k; memset(dp, (long long)(-1), sizeof(dp)); long long Ans = Rec(0, 0); cout << (Ans <= 0 ? -1 : Ans) << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; bool check(string a) { bool flag = true; for (int i = 1; i <= a.size(); i++) if (abs(a[i] - a[i - 1]) == 1) flag = false; return flag; } int main() { int T; cin >> T; while (T--) { string s, one, two; cin >> s; for (int i = 0; i < s.size(); i++) if (s[i] % 2) one += s[i]; else two += s[i]; sort(one.begin(), one.end()); sort(two.begin(), two.end()); if (check(one + two)) cout << one + two << n ; else if (check(two + one)) cout << two + one << n ; else cout << No answer n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, t, k, x; string s; int main() { cin >> s; n = s.size(); for (int k = 0;; k++) { if (s[k] == . ) { t = k; break; } } if (s[t - 1] == 9 + 0 ) cout << GOTO Vasilisa. ; else if (s[t + 1] < 5 + 0 ) { for (int i = 0; i < t; i++) cout << s[i]; } else if (s[t + 1] >= 5 + 0 ) { for (int i = 0; i < t - 1; i++) cout << s[i]; cout << s[t - 1] - 0 + 1; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int adj[8][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}, {-1, -1}, {-1, 1}, {1, 1}, {1, -1}}; const long long int LLINF = 9e18; const int INF = 2e9; const int MOD = 1e9 + 7; const double EPS = 1e-10; const double PI = acos(-1); const int SIZE = 200005; int N; long long int A[SIZE]; int cnt[SIZE], pos[SIZE]; vector<pair<int, pair<int, int> > > ans; int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %lld , &A[i]); cnt[A[i]]++; pos[A[i]] = i; } int num, Mx = 0, idx; for (int i = 0; i < SIZE; i++) { if (Mx < cnt[i]) { num = i; Mx = cnt[i]; idx = pos[i]; } } for (int i = idx; i <= N; i++) { if (num < A[i]) { ans.push_back(make_pair(2, make_pair(i, i - 1))); } else if (num > A[i]) { ans.push_back(make_pair(1, make_pair(i, i - 1))); } } for (int i = idx; i >= 1; i--) { if (num < A[i]) { ans.push_back(make_pair(2, make_pair(i, i + 1))); } else if (num > A[i]) { ans.push_back(make_pair(1, make_pair(i, i + 1))); } } int n = ans.size(); printf( %d n , n); for (int i = 0; i < n; i++) { printf( %d %d %d n , ans[i].first, ans[i].second.first, ans[i].second.second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, a, b, da, db; vector<long long> v[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { cin >> n >> a >> b >> da >> db; for (long long i = 0; i < n + 2; i++) v[i].clear(); for (long long i = 0; i < n - 1; i++) { long long x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } long long vis[n + 1]; memset(vis, 0, sizeof(vis)); vis[a] = 1; queue<long long> q; q.push(a); long long dis[n + 1]; dis[a] = 0; while (!q.empty()) { long long u = q.front(); q.pop(); for (auto it : v[u]) { if (!vis[it]) { dis[it] = dis[u] + 1; vis[it] = 1; q.push(it); } } } if (db <= 2 * da || dis[b] <= da) { cout << Alice n ; continue; } dis[b] = 0; memset(vis, 0, sizeof(vis)); vis[b] = 1; q.push(b); while (!q.empty()) { long long u = q.front(); q.pop(); for (auto it : v[u]) { if (!vis[it]) { dis[it] = dis[u] + 1; vis[it] = 1; q.push(it); } } } long long node, maxi = 0; for (long long i = 1; i <= n; i++) { if (dis[i] > maxi) { maxi = dis[i]; node = i; } } dis[node] = 0; memset(vis, 0, sizeof(vis)); vis[node] = 1; q.push(node); while (!q.empty()) { long long u = q.front(); q.pop(); for (auto it : v[u]) { if (!vis[it]) { dis[it] = dis[u] + 1; vis[it] = 1; q.push(it); } } } maxi = 0; for (long long i = 1; i <= n; i++) { if (dis[i] > maxi) { maxi = dis[i]; } } if (maxi > 2 * da) { cout << Bob n ; } else cout << Alice n ; } }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { long long r; while (b != 0) { r = a % b; a = b; b = r; } return a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } int const nmax = 1010; int k, n; vector<pair<int, int> > st, pe; vector<int> ans[nmax]; bool dc[nmax]; long double p[nmax]; void solve() { memset(dc, 0, sizeof(dc)); cin >> k >> n; for (int i = 0; i < k; i++) { int c, t; cin >> c >> t; p[i] = c; if (t == 1) st.push_back(pair<int, int>(c, i)); else pe.push_back(pair<int, int>(c, i)); } sort(st.begin(), st.end()); sort(pe.begin(), pe.end()); int k = 0; while (!st.empty()) { if (k >= n) k = n - 1; dc[k] = 1; ans[k].push_back(st.back().second); st.pop_back(); k++; } for (int i = n - 1; i >= 0; i--) { if (int((ans[i]).size()) > 0) break; ans[i].push_back(pe.front().second); pe.erase(pe.begin()); } while (!pe.empty()) { if (k >= n) k = n - 1; ans[k].push_back(pe.back().second); pe.pop_back(); k++; } long double sum = 0; for (int i = 0; i < n; i++) { long double m = INT_MAX; for (int j = 0; j < int((ans[i]).size()); j++) { int k = ans[i][j]; sum += p[k]; m = ((m) > (p[k]) ? (p[k]) : (m)); } if (dc[i]) sum -= m / 2; } cout << fixed << setprecision(1) << sum << n ; for (int i = 0; i < n; i++) { cout << int((ans[i]).size()) << ; for (int j = 0; j < int((ans[i]).size()); j++) cout << ans[i][j] + 1 << ; cout << n ; } } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 9; int n, q, c[N]; void modify(int x, int v) { if (x == 0) return; for (int i = x; i <= n; i += i & -i) c[i] += v; } int query(int x) { int s = 0; for (int i = x; i >= 1; i -= i & -i) s += c[i]; return s; } void work(int a, int b, bool le) { for (int i = a; i <= b; ++i) { int t = query(i) - query(i - 1); modify(i, -t); if (le) { modify(a - (i - a + 1), t); } else modify(b + (b - i + 1), t); } } int L, R; int get(int x) { if (L <= R) return x + L - 1; else return L + 1 - x; } int len() { return abs(L - R) + 1; } int main() { scanf( %d%d , &n, &q); L = 1, R = n; for (int i = 1; i <= n; ++i) modify(i, 1); while (q--) { int cmd, p, l, r; scanf( %d , &cmd); if (cmd == 1) { scanf( %d , &p); if (L <= R) { if (p > len() - p) { work(get(p + 1), R, 1); R = get(p); swap(L, R); } else { work(get(1), get(p), 0); L = get(p + 1); } } else { if (p > len() - p) { work(R, get(p + 1), 0); R = get(p); swap(L, R); } else { work(get(p), get(1), 1); L = get(p + 1); } } } else { scanf( %d%d , &l, &r); l++; l = get(l), r = get(r); if (l > r) swap(l, r); int s = query(r) - query(l - 1); printf( %d n , s); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; string aux = CODEFORCES ; int i = 0; cin >> s; if (s.length() < aux.length()) cout << NO << endl; else { while (aux[i] == s[i] && i < aux.length()) i++; if (i == aux.length()) cout << YES << endl; else { int j; for (j = i; j < aux.length(); j++) { if (aux[j] != s[s.length() - aux.length() + j]) break; } if (j == aux.length()) cout << YES << endl; else cout << NO << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; if (n < k) cout << k - n << endl; else { if ((n & 1) == (k & 1)) cout << 0 << endl; else cout << 1 << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, m; int a[maxn], b[maxn]; int main() { cin >> n >> m; m--; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; } if (a[0] == 0) { cout << NO ; return 0; } if (b[m] == 0 && a[m] == 0) { cout << NO ; return 0; } if (a[m] != 0) { cout << YES ; return 0; } for (int i = m; i < n; i++) { if (b[i] == 1 && a[i] == 1) { cout << YES ; return 0; } } cout << NO ; return 0; }
|
#include <bits/stdc++.h> int main() { char a[110], b[110]; scanf( %s%s , a, b); if (strcmp(a, b) == 0) printf( %s n , a); else printf( 1 n ); }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int dir[8][2] = {{0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}}; const int dir8x[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dir8y[8] = {-1, 0, 1, 1, -1, -1, 0, 1}; const long long mod = 1e9 + 7; const double PI = acos(-1.0); long long po(long long a, long long b, long long mod) { long long res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } long long gcd(long long a, long long b) { if (a == 0) { return b; } else { return gcd(b % a, a); } } int n; long long val[maxn], dp[maxn]; void solve() { scanf( %d , &(n)); for (int i = 1; i <= n; i++) { scanf( %lld , &val[i]); } int last = 1; for (int i = 2; i <= n; i++) { dp[i] = max(dp[last - 1] + labs(val[i] - val[last]), dp[last] + labs(val[i] - val[last + 1])); if (val[i] <= val[i + 1] && val[i] <= val[i - 1]) { last = i; } if (val[i] >= val[i + 1] && val[i] >= val[i - 1]) { last = i; } } long long res = dp[n]; printf( %lld , res); } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { unsigned long long int mino = LONG_MAX; unsigned long long int minc = LONG_MAX; unsigned long long int ans = 0; unsigned long long int n; cin >> n; unsigned long long int o[n], c[n]; for (unsigned long long int i = 0; i < n; i++) { unsigned long long int ora; cin >> ora; o[i] = ora; if (ora < mino) { mino = ora; } } for (unsigned long long int i = 0; i < n; i++) { unsigned long long int ca; cin >> ca; c[i] = ca; if (ca < minc) { minc = ca; } } for (unsigned long long int i = 0; i < n; i++) { unsigned long long int w = min(o[i] - mino, c[i] - minc); ans = ans + w; o[i] = o[i] - w; c[i] = c[i] - w; if (o[i] == mino) { ans = ans + c[i] - minc; } else { ans = ans + o[i] - mino; } } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> split(string s) { vector<int> xs; stringstream ss(s); string item; while (getline(ss, item, , )) { xs.push_back(stoi(item)); } return xs; } int main() { string s; getline(cin, s); vector<int> xxs = split(s); sort(xxs.begin(), xxs.end()); vector<pair<int, int>> sol; for (int i = 0; i < xxs.size(); i++) { int st = xxs[i]; int e = st; while (i < xxs.size() - 1 && (e + 1 == xxs[i + 1] || e == xxs[i + 1])) { e = xxs[i + 1]; i++; } sol.push_back(make_pair(st, e)); } for (int i = 0; i < sol.size(); i++) { if (sol[i].first != sol[i].second) { cout << sol[i].first << - << sol[i].second; } else { cout << sol[i].first; } if (i != sol.size() - 1) { cout << , ; } } return 0; }
|
#include <bits/stdc++.h> const int kMaxN = 5000; std::vector<int> way[kMaxN], cost[kMaxN]; int f[kMaxN], c[kMaxN]; short hash[kMaxN][kMaxN], father[kMaxN][2 * kMaxN]; int a[kMaxN], id[kMaxN], t[kMaxN]; inline bool cmp(int x, int y) { return a[x] < a[y]; } void BuildTree(int u, int ff) { f[u] = ff; for (size_t i = 0; i < way[u].size(); ++i) { int v = way[u][i]; if (v == ff) continue; c[v] = cost[u][i]; BuildTree(v, u); } } int Find(short *f, int x) { int y = x, z; while (f[y] != -1) y = f[y]; while (x != y) { z = x; x = f[x]; f[z] = y; } return y; } int Put(int x) { int t = 0; while (x != 0) { ++t; if (f[x] == 0) return t; int ff = f[x]; t = Find(father[ff], t); if (++hash[ff][t] == c[ff]) { father[ff][t] = t + 1; } x = ff; } return 0; } int main() { int n, x, y, cc; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , a + i); id[i] = i; } std::sort(id, id + n, cmp); for (int j = 1; j < n; ++j) { scanf( %d%d%d , &x, &y, &cc); --x; --y; way[x].push_back(y); way[y].push_back(x); cost[x].push_back(cc); cost[y].push_back(cc); } BuildTree(0, -1); memset(father, -1, sizeof(father)); for (int i = 0; i < n; ++i) { t[id[i]] = Put(id[i]); } for (int i = 0; i < n; ++i) { if (i != 0) printf( ); printf( %d , t[i]); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool isthere(string s1, string s2); int main() { int t; cin >> t; for (int i = 0; i < t; i++) { string s1, s2; cin >> s1 >> s2; if (s2.size() == s1.size()) { if (isthere(s1, s2)) { cout << YES << endl; } else { cout << NO << endl; } continue; } if (s2.size() < s1.size()) { cout << NO << endl; continue; } bool y = 0; for (int i = 0; i <= (s2.size() - s1.size()); i++) { string s = s2.substr(i, s1.size()); if (isthere(s1, s)) { cout << YES << endl; y = 1; break; } } if (y == 0) { cout << NO << endl; } } return 0; } bool isthere(string s1, string s2) { sort(s1.begin(), s1.end()); sort(s2.begin(), s2.end()); if (s1.compare(s2) == 0) { return true; } return false; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0); char lowestChar = z + 1; string s; cin >> s; vector<int> ans(s.size(), 0); for (int i = 0; i < s.size(); ++i) { char c = s[i]; if (c < lowestChar) { ans[i] = 1; lowestChar = c; } else if (c == lowestChar) { ans[i - 1] ^= 1; ans[i] = 1; } } for (auto& x : ans) cout << x << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> bomb[5005]; int n, m, st_time[5005], sol[5005], dist_min[5005]; int main() { cin >> n >> m; for (int i = 1; i <= n; ++i) dist_min[i] = 2 * 5005; int pos, val; for (int i = 1; i <= m; ++i) { cin >> pos >> val; bomb[pos].push_back(val); int comp = 0; if (val >= pos) comp = val - pos; else comp = n - (pos - val); if (val != pos) dist_min[pos] = min(dist_min[pos], comp); } for (int i = 1; i <= n; ++i) { int blen = bomb[i].size(); if (blen) st_time[i] = n * (blen - 1) + dist_min[i]; else st_time[i] = 0; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) if (!bomb[j].empty()) { if (j < i) sol[i] = max(sol[i], n - (i - j) + st_time[j]); else sol[i] = max(sol[i], j - i + st_time[j]); } cout << sol[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; string s; for (int i = 0; i < t; i++) { cin >> n; cin >> s; int k = 0; if (n % 2 == 0) { for (int i = 1; i < n; i += 2) if ((int(s[i]) - 48) % 2 == 0) { k = 1; cout << 2 << n ; break; } if (k == 0) cout << 1 << n ; } if (n % 2 == 1) { for (int i = 0; i < n; i += 2) if ((int(s[i]) - 48) % 2 == 1) { k = 1; cout << 1 << n ; break; } if (k == 0) cout << 2 << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, x, y, num[100005], res, a[100005], b[100005]; bool vis[100005]; vector<int> v[100005]; void dfs(long long now, long long pre) { for (long long i = 0; i < v[now].size(); i++) { int j = v[now][i]; if (j != pre) { dfs(j, now); a[now] = max(a[now], a[j]); b[now] = max(b[now], b[j]); } } num[now] += a[now]; num[now] -= b[now]; if (num[now] < 0) a[now] += -num[now]; else b[now] += num[now]; } int main() { cin >> n; for (long long i = 0; i < n - 1; i++) { cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } for (long long i = 1; i <= n; i++) cin >> num[i]; dfs(1, -1); res = a[1] + b[1]; cout << res << n ; return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( sse4,avx ) const int p = 1000000007; int mul32(int x, int y) { return int(int64_t(x) * y % p); } int add32(int x, int y) { int res = x + y; if (res >= p) res -= p; return res; } int sub32(int x, int y) { int res = x - y; if (res < 0) res += p; return res; } void run(std::istream &in, std::ostream &out) { int n; in >> n; std::vector<int> xs(n); for (int i = 0; i < n; i++) { in >> xs[i]; } std::sort(xs.begin(), xs.end()); std::vector<int> pow2(n + 1); pow2[0] = 1; for (int i = 1; i <= n; i++) { pow2[i] = (pow2[i - 1] * 2) % p; } int res = 0; for (int i = 0; i < n; i++) { res = add32(res, mul32(xs[i], pow2[i])); res = sub32(res, mul32(xs[i], pow2[n - i - 1])); } out << res << std::endl; } int main() { std::cin.sync_with_stdio(false); std::cin.tie(nullptr); run(std::cin, std::cout); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; long long n, d, b, a[N], f[N]; int main() { long long i, j, k, t = 0, ans; scanf( %I64d%I64d%I64d , &n, &d, &b); for (i = 1; i <= n; i++) scanf( %I64d , &a[i]), f[i] = f[i - 1] + a[i]; for (i = 1; i <= n / 2; i++) if (f[min(i * d + i, n)] >= (t + 1) * b) t++; ans = t; t = 0; for (i = 1; i <= n / 2; i++) swap(a[i], a[n - i + 1]); f[0] = 0; for (i = 1; i <= n; i++) f[i] = f[i - 1] + a[i]; for (i = 1; i <= n / 2; i++) if (f[min(i * d + i, n)] >= (t + 1) * b) t++; printf( %I64d , n / 2 - min(ans, t)); }
|
#include <bits/stdc++.h> using namespace std; int Get() { char c; while (c = getchar(), c < 0 || c > 9 ) ; int X = 0; while (c >= 0 && c <= 9 ) { X = X * 10 + c - 48; c = getchar(); } return X; } const int inf = 1000000000; int GCD(int a, int b) { return b ? GCD(b, a % b) : a; } int Solve(int a, int b, int c) { return a ? ((c - b * Solve(b % a, a, c % a)) / a) : 0; } int GetMin(int L, int R, int a, int b, int c) { if (L > R) return -1; int K = GCD(a, b); if (c % K) return -1; a /= K; b /= K; c /= K; int X = Solve(a, b, c); if (X < L) X += ((L - X - 1) / b + 1) * b; if (X > L) X -= (X - L) / b * b; return (X <= R) ? X : -1; } int GetMax(int L, int R, int a, int b, int c) { if (L > R) return -1; int K = GCD(a, b); if (c % K) return -1; a /= K; b /= K; c /= K; int X = Solve(a, b, c); if (X > R) X -= ((X - R - 1) / b + 1) * b; if (X < R) X += (R - X) / b * b; return (X >= L) ? X : -1; } int main() { int N = Get(), S = Get(), a = 0, b = 0, c = 0; while (N--) { int X = Get(); if (X == 3) a++; if (X == 4) b++; if (X == 5) c++; } int Ans = inf, Ans_x, Ans_y; for (int y = 0; b * y <= S; y++) { int B = b * y, _S = S - B, Max = min(y, (_S - c * y) / a), x; x = GetMin((_S - B - 1) / a + 1, min(Max, B / a), a, c, _S); if (x != -1 && 2 * B - _S < Ans) { Ans = 2 * B - _S; Ans_x = x; Ans_y = y; } x = GetMax(0, min(Max, min(B, _S - B) / a), a, c, _S); if (x != -1 && _S - 2 * a * x < Ans) { Ans = _S - 2 * a * x; Ans_x = x; Ans_y = y; } x = GetMin((max(B, _S - B) - 1) / a + 1, Max, a, c, _S); if (x != -1 && 2 * a * x - _S < Ans) { Ans = 2 * a * x - _S; Ans_x = x; Ans_y = y; } x = GetMin((B - 1) / a + 1, min(Max, (_S - B) / a), a, c, _S); if (x != -1 && _S - 2 * B < Ans) { Ans = _S - 2 * B; Ans_x = x; Ans_y = y; } } if (Ans == inf) printf( -1 n ); else printf( %d %d %d n , Ans_x, Ans_y, (S - a * Ans_x - b * Ans_y) / c); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long grundy[1234]; int main() { long long idx = 1, i, j; for (i = 1; i <= 15; i++) { for (j = 1; j <= (i + 1); j++) { grundy[idx] = i; idx++; } } long long n; cin >> n; long long ans = 0; while (n--) { long long va; cin >> va; ans = ans ^ grundy[va]; } cout << ((ans == 0) ? YES : NO ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e; scanf( %d%d%d%d%d , &a, &b, &c, &d, &e); if ((a + b + c + d + e) % 5 == 0 && a + b + c + d + e >= 5) printf( %d n , (a + b + c + d + e) / 5); else printf( -1 n ); }
|
#include <bits/stdc++.h> using namespace std; long long n, a[100005], b[100005], fa[100005], s[100005], q[100005], l, p = -2147483647; inline long long find(long long x) { if (x == fa[x]) return x; return fa[x] = find(fa[x]); } inline long long M(long long u, long long v) { return u > v ? u : v; } int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); for (long long i = 1; i <= n; i++) scanf( %lld , &b[i]); for (long long i = n; i >= 1; i--) { long long k = b[i]; if (!fa[k]) fa[k] = k, s[k] = a[k]; long long fk = find(k); if (fa[k - 1] && k - 1 > 0) { long long fl = find(k - 1); if (fk != fl) s[k] += s[fl], s[fl] = 0, fa[fl] = k; } if (fa[k + 1] && k + 1 <= n) { long long fr = find(k + 1); if (fk != fr) s[k] += s[fr], s[fr] = 0, fa[fr] = k; } p = M(p, s[k]), q[++l] = p; } for (long long i = n - 1; i >= 0; i--) printf( %lld n , q[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int h, w, i, j, mod = 1e9 + 7, r, c, ans = 1, a[1001][1001]; int main() { cin.tie(NULL); ios_base::sync_with_stdio(0); cin >> h >> w; for (i = 0; i < h; i++) { cin >> r; for (j = 0; j < r; j++) a[i][j] = 2; a[i][r] = 1; } for (i = 0; i < w; i++) { cin >> c; for (j = 0; j < c; j++) if (a[j][i] == 1) { cout << 0 << endl; return 0; } else a[j][i] = 2; if (a[c][i] == 2) { cout << 0 << endl; return 0; } a[c][i] = 1; } for (i = 0; i < h; i++) for (j = 0; j < w; j++) if (!a[i][j]) ans = (ans * 2) % mod; cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> v[200010], circle; int fa[200010], dep[200010], a[200010], b[200010], n, rt, vs, vt, h1, h2; bool vis[200010], bo[200010]; inline int rd() { int x = 0; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) ; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x; } inline void dfs(int x) { for (int i = 0, siz = v[x].size(); i < siz; i++) { int t = v[x][i]; if (t == fa[x]) continue; dep[t] = dep[x] + 1; fa[t] = x; dfs(t); } } inline bool gao() { int p = 0, q = 0; bool flag = true; for (int i = 1; i <= n; i++) if (a[i] != b[i] && dep[i] > dep[p]) p = i; if (!p) return true; for (int hh = p; a[hh] != b[hh]; hh = fa[hh]) bo[hh] = true, circle.push_back(hh); for (int i = 1; i <= n; i++) if (a[i] != b[i] && !bo[i] && dep[i] > dep[q]) q = i; if (q) { reverse(circle.begin(), circle.end()); flag = false; for (int hh = q; a[hh] != b[hh]; hh = fa[hh]) bo[hh] = true, circle.push_back(hh); } else q = fa[circle.back()]; for (int i = 1; i <= n; i++) if (a[i] != b[i] && !bo[i]) return false; int h1 = p, h2 = q; for (; h1 != h2; h1 = fa[h1]) if (dep[h1] < dep[h2]) swap(h1, h2); rt = h1; if (circle.size() != dep[p] + dep[q] - dep[rt] * 2) return false; vs = p; vt = q; if (flag) reverse(circle.begin(), circle.end()); return true; } int main() { n = rd(); for (int i = 1; i <= n; i++) if (!(a[i] = rd())) h1 = i; for (int i = 1; i <= n; i++) if (!(b[i] = rd())) h2 = i; for (int i = 1; i < n; i++) { int x = rd(), y = rd(); v[x].push_back(y); v[y].push_back(x); } dep[0] = -1; dfs(h2); for (int hh = h1; hh != h2; hh = fa[hh]) swap(a[hh], a[fa[hh]]); long long ans = dep[h1]; if (!gao()) { puts( -1 ); return 0; } if (!circle.size()) { printf( 0 %d n , ans); return 0; } for (int i = h1; i; i = fa[i]) vis[i] = true; if (vis[circle.back()] && !vis[circle[0]]) reverse(circle.begin(), circle.end()); int gap = 0, siz = circle.size(); for (int i = 0; i < siz; i++) if (b[circle[i]] == a[circle[0]]) gap = i; for (int i = 0; i < siz; i++) if (b[circle[(i + gap) % siz]] != a[circle[i]]) { puts( -1 ); return 0; } if (vis[circle[0]] || vis[circle.back()]) { int now = siz; for (int i = 0; i < siz; i++) if (!vis[circle[i]]) { now = i; break; } ans = ans - now + min((long long)gap * (siz + 1) + now, abs((long long)(siz - gap) * (siz + 1) - now)); } else ans = (ans + (long long)min(gap, siz - gap) * (siz + 1)); for (; !vis[rt]; rt = fa[rt]) ans += 2; if (vs > vt) swap(vs, vt); printf( %d %d %I64d n , vs, vt, ans); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; using i64 = long long; using i32 = int; using f64 = long double; template <class Key> using vec = vector<Key>; template <class Key> using heap = priority_queue<Key>; template <class Key> using hash_set = unordered_set<Key>; template <class Key, class Value> using hash_map = unordered_map<Key, Value>; using str = string; template <size_t Size1> using a64 = array<i64, Size1>; template <size_t Size1, size_t Size2> using aa64 = array<a64<Size2>, Size1>; template <size_t Size1, size_t Size2, size_t Size3> using aaa64 = array<aa64<Size2, Size3>, Size1>; using p64 = pair<i64, i64>; using v64 = vec<i64>; using vv64 = vec<v64>; using s64 = set<i64>; using m64 = map<i64, i64>; mt19937 gen(998244353); const i64 inf = numeric_limits<i64>::max() / 2; template <typename T> inline i64 sz(const T& a) { return (i64)(a.size()); } inline void fast() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); } template <typename T> inline bool check_min(T& a, T b) { if (a > b) return a = b, 1; return 0; } template <typename T> inline bool check_max(T& a, T b) { if (a < b) return a = b, 1; return 0; } struct Problem { Problem(bool multitest = 0) { read(); if (!multitest) solve(); } void solve(), read(); }; signed main() { fast(); Problem(); return 0; } i64 n, m; v64 a, b; vv64 c; i64 dist(i64 from, i64 to) { return (to - from + n) % n; } void Problem::solve() { c.resize(n); for (i64 i = 0; i < m; i++) { c[a[i]].push_back(dist(a[i], b[i])); } for (i64 i = 0; i < sz(c); i++) { sort((c[i]).begin(), (c[i]).end()); } for (i64 i = 0; i < n; i++) { i64 ans = 0; for (i64 j = 0; j < n; j++) { if (c[j].empty()) continue; i64 cur = dist(i, j) + (sz(c[j]) - 1) * n + c[j][0]; check_max(ans, cur); } cout << ans << ; } } void Problem::read() { cin >> n >> m; a.resize(m), b.resize(m); for (i64 i = 0; i < m; i++) { cin >> a[i] >> b[i]; --a[i], --b[i]; } }
|
#include <bits/stdc++.h> using std::max; int n, m, c, x[150000 + 1], a, b, i; long long p[150000 + 1], ans = 0; struct node { long long sum, mmax, lmax, rmax; void update(const node &l, const node &r) { sum = l.sum + r.sum; lmax = max(l.lmax, l.sum + r.lmax); rmax = max(l.rmax + r.sum, r.rmax); mmax = max(l.mmax, max(r.mmax, l.rmax + r.lmax)); } } tree[(150000 << 2) + 1]; void build(int x, int l, int r) { if (l == r) { tree[x].sum = tree[x].mmax = tree[x].lmax = tree[x].rmax = p[l]; return; } int mid = (l + r) >> 1; build(x << 1, l, mid); build((x << 1) + 1, mid + 1, r); tree[x].update(tree[x << 1], tree[(x << 1) + 1]); } node find(int x, int l, int r, int s, int t) { if (s == l && t == r) return tree[x]; int mid = (l + r) >> 1; if (t <= mid) return find(x << 1, l, mid, s, t); if (s > mid) return find((x << 1) + 1, mid + 1, r, s, t); node ret; ret.update(find(x << 1, l, mid, s, mid), find((x << 1) + 1, mid + 1, r, mid + 1, t)); return ret; } int main() { scanf( %d%d%d , &n, &m, &c); for (i = 1; i <= n; ++i) scanf( %d , x + i); for (i = 1; i < n; ++i) scanf( %d , p + i); for (i = 1; i < n; ++i) p[i] = 50 * (x[i + 1] - x[i]) - p[i] * c; --n; build(1, 1, n); for (i = 1; i <= m; ++i) { scanf( %d%d , &a, &b); ans += max(0LL, find(1, 1, n, a, b - 1).mmax); } printf( %0.9llf n , (double)ans / 100); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> bool isPrime(T x) { if (x <= 1) return false; T i; for (i = 2; i * i <= x; i++) if (x % i == 0) return false; return true; } template <class T> class Prime { public: vector<T> z; Prime() { z.resize(1e5 + 7); for (int i = (0); i < (((int)z.size())); i++) z[i] = 1; z[0] = 0; z[1] = 0; T j; for (int i = (2); i < (((int)z.size())); i++) { if (z[i]) { j = i + i; while (j < ((int)z.size())) { z[j] = 0; j += i; } } } } }; template <class T> double dist(T x1, T y1, T x2, T y2) { return sqrt(1. * (x2 - x1) * (x2 - x1) + 1. * (y2 - y1) * (y2 - y1)); } template <class T> class Point { public: T x, y; Point() {} Point(T a, T b) : x(a), y(b) {} bool operator==(const Point& tmp) const { return (x == tmp.x && y == tmp.y); } Point operator-(const Point& tmp) const { return Point<T>(x - tmp.x, y - tmp.y); } }; char toLowerCase(char x) { return (x + 32); } char toUpperCase(char x) { return (x - 32); } bool isUpperCase(char x) { return (65 <= x && x <= 90) ? 1 : 0; } bool isLowerCase(char x) { return (97 <= x && x <= 122) ? 1 : 0; } bool isAlpha(char x) { return (isUpperCase(x) || isLowerCase(x)) ? 1 : 0; } bool isDigit(char x) { return ( 0 <= x && x <= 9 ) ? 1 : 0; } template <class T> T toDec(string s) { stringstream is(s); T res; is >> res; return res; } template <class T> string toStr(T n) { string s; stringstream is; is << n; is >> s; return s; } template <class T> void checkmin(T& a, T b) { if (a > b) a = b; } template <class T> void checkmax(T& a, T b) { if (a < b) a = b; } vector<vector<int> > g, ans, ng; vector<int> visited, parent; bool bfs(int s, int t) { visited = vector<int>(s + 5, 0); parent = vector<int>(s + 5, -1); queue<int> q; q.push(s); visited[s] = 1; int u; while (!q.empty()) { u = q.front(); q.pop(); if (u == t) return true; for (int v = 0; v < s + 5; v++) { if (g[u][v] > 0 && !visited[v]) { q.push(v); parent[v] = u; visited[v] = 1; } } } return false; } int getMaxFlow(int n) { int max_flow = 0; int path_min = 1e9; int u, v; while (bfs(n, n + 1)) { for (v = n + 1; v != n; v = parent[v]) { u = parent[v]; path_min = min(path_min, g[u][v]); } for (v = n + 1; v != n; v = parent[v]) { u = parent[v]; g[u][v] -= path_min; g[v][u] += path_min; } max_flow += path_min; } return max_flow; } int main() { int n; cin >> n; g = vector<vector<int> >(n + 5, vector<int>(n + 5, 0)); vector<int> a(n + 5, 0); for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 0) g[n][i] = 2; else g[i][n + 1] = 2; } for (int i = 0; i < n; i++) { if (a[i] % 2 == 0) { for (int j = 0; j < n; j++) { if (isPrime<int>(a[i] + a[j])) { g[i][j] = 1; } } } } if (getMaxFlow(n) != n) cout << Impossible ; else { ng = vector<vector<int> >(n + 5); for (int i = 0; i < n; i++) { if (a[i] % 2) { for (int j = 0; j < n; j++) { if (g[i][j]) { ng[i].push_back(j); ng[j].push_back(i); } } } } visited = vector<int>(n + 5); int node, prev, tmp; for (int i = 0; i < n; i++) { if (visited[i]) continue; visited[i] = 1; prev = i; node = ng[i][0]; vector<int> res; res.push_back(i); while (node != i) { visited[node] = 1; res.push_back(node); tmp = node; node = (prev != ng[node][0] ? ng[node][0] : ng[node][1]); prev = tmp; } ans.push_back(res); } cout << ((int)ans.size()) << n ; for (int i = 0; i < ((int)ans.size()); i++) { cout << ((int)ans[i].size()) << ; for (int j = 0; j < ((int)ans[i].size()); j++) { if (j) cout << ; cout << ans[i][j] + 1; } cout << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> T sq(T x) { return x * x; } const long long inf = 2147383647; const double pi = 2 * acos(0.0); const double eps = 1e-9; const long long maxint = 2147483647; const long long minint = -2147483648; char grid[450][450]; int row, col, mx; int preRight[450][450], preDiag1[450][450], preDiag2[450][450], preDown[450][450]; void precalRight() { int i, j; for (i = 0; i < row; i++) { for (j = col - 1; j >= 0; j--) { if (grid[i][j] == 1 ) preRight[i][j] = 0; else { preRight[i][j] = 1; if (j < col - 1) preRight[i][j] += preRight[i][j + 1]; } } } } void precalDiag1() { int i, j; for (i = row - 1; i >= 0; i--) { for (j = col - 1; j >= 0; j--) { if (grid[i][j] == 1 ) preDiag1[i][j] = 0; else { preDiag1[i][j] = 1; if (i < row - 1 && j < col - 1) preDiag1[i][j] += preDiag1[i + 1][j + 1]; } } } } void precalDiag2() { int i, j; for (i = 0; i < row; i++) { for (j = col - 1; j >= 0; j--) { if (grid[i][j] == 1 ) preDiag2[i][j] = 0; else { preDiag2[i][j] = 1; if (i > 0 && j < col - 1) preDiag2[i][j] += preDiag2[i - 1][j + 1]; } } } } void precalDown() { int i, j; for (i = row; i >= 0; i--) { for (j = col - 1; j >= 0; j--) { if (grid[i][j] == 1 ) preDown[i][j] = 0; else { preDown[i][j] = 1; if (i < row - 1) preDown[i][j] += preDown[i + 1][j]; } } } } void precal() { precalRight(); precalDiag1(); precalDiag2(); precalDown(); } long long triangle(int r, int c) { long long res = 0; int i; for (i = 1; i <= mx + 1; i++) { if (preRight[r][c] - 1 >= i && preDown[r][c] - 1 >= i && preDiag2[r + i][c] - 1 >= i) res++; if (preRight[r][c] - 1 >= i && preDown[r][c + i] - 1 >= i && preDiag1[r][c] - 1 >= i) res++; if (preDown[r][c] - 1 >= i && preRight[r + i][c] - 1 >= i && preDiag1[r][c] - 1 >= i) res++; if (r + i < row && preDiag2[r + i][c] - 1 >= i && preRight[r + i][c] - 1 >= i && preDown[r][c + i] - 1 >= i) res++; if (i % 2 == 0) { int j = i / 2; if (preRight[r][c] - 1 >= i && preDiag1[r][c] - 1 >= j && preDiag2[r + j][c + j] - 1 >= j) res++; if (preDiag1[r][c] - 1 >= j && preDown[r][c] - 1 >= i && preDiag2[r + i][c] - 1 >= j) res++; if (r + j < row && preRight[r + j][c] - 1 >= i && preDiag2[r + j][c] - 1 >= j && preDiag1[r][c + j] - 1 >= j) res++; if (r + j < row && preDiag2[r + j][c] - 1 >= j && preDiag1[r + j][c] - 1 >= j && preDown[r][c + j] - 1 >= i) res++; } } return res; } int main() { scanf( %d %d , &row, &col); mx = max(row, col); int i, j, k; for (i = 0; i < row; i++) scanf( %s , grid[i]); precal(); long long res = 0; for (i = 0; i < row; i++) { for (j = 0; j < col; j++) { res += triangle(i, j); } } printf( %lld n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; #define ll long long #define pi pair<int, int> #define pll pair<long long, long long> #define vi vector<int> #define vll vector<long long> #define vpi vector<pair<int, int>> #define vvi vector<vector<int>> #define mii map<int, int> #define mmii multimap<int, int> #define umii unordered_map<int, int> #define umsii unordered_multimap<int, int> #define si set<int> #define msi multiset<int> #define usi unordered_set<int> #define umsi unordered_multiset<int> #define sc set<char> #define f(i, s, e) for (long long int i = s; i < e; i++) #define cf(i, s, e) for (long long int i = s; i <= e; i++) #define rf(i, e, s) for (long long int i = e - 1; i >= s; i--) #define pb push_back #define mp make_pair #define eb emplace_back #define F first #define S second #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() template <class T> void print_v(vector<T> &v) { cout << [ ; for (auto x : v) cout << x << , ; cout << b b] n ; } template <class T> long long int sum_v(vector<T> &v) { long long int ans = 0; for (auto a : v) ans += a; return ans; } #define MOD 1000000007 #define PI 3.1415926535897932384626433832795 ll min(ll a, int b) { if (a < b) return a; return b; } ll min(int a, ll b) { if (a < b) return a; return b; } ll max(ll a, int b) { if (a > b) return a; return b; } ll max(int a, ll b) { if (a > b) return a; return b; } ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } string to_upper(string a) { for (int i = 0; i < (int)a.size(); ++i) if (a[i] >= a && a[i] <= z ) a[i] -= a - A ; return a; } string to_lower(string a) { for (int i = 0; i < (int)a.size(); ++i) if (a[i] >= A && a[i] <= Z ) a[i] += a - A ; return a; } bool prime(ll a) { if (a == 1) return 0; for (int i = 2; i <= round(sqrt(a)); ++i) if (a % i == 0) return 0; return 1; } void yes() { cout << YES n ; } void no() { cout << NO n ; } typedef long int int32; typedef unsigned long int uint32; typedef long long int int64; typedef unsigned long long int uint64; void dfs(vvi &graph, vi &ans, si &visited, int node) { if (ans[node] == -1 || ans[node] == 2) return; if (visited.count(node)) { vi stack; vi tempvisited(graph.size()); stack.push_back(node); while (!stack.empty()) { int val = stack.back(); stack.pop_back(); ans[val] = -1; tempvisited[val] = 1; for (int i : graph[val]) { if (!tempvisited[i]) stack.push_back(i); } } return; } visited.insert(node); if (ans[node] != -1) ans[node] = min(ans[node] + 1, 2); for (int i : graph[node]) { dfs(graph, ans, visited, i); } visited.erase(node); } void solve() { int n, m; cin >> n >> m; vvi graph(n + 1); vi ans(n + 1); si visited; f(i, 0, m) { int a, b; cin >> a >> b; graph[a].push_back(b); } dfs(graph, ans, visited, 1); cf(i, 1, n) cout << ans[i] << ; cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> int pn, pr[2000050]; bool np[2000050] = {0}; int n; int ln, ls[2000050]; inline void gen() { pn = 0; for (int i = 2; i < 2000050; i++) { if (np[i]) continue; pr[pn++] = i; if (i > 2000) continue; for (int j = i * i; j < 2000050; j += i) np[j] = 1; } } inline int solve() { int i, j, p, c = 0; if (n == 2) return 0; std::sort(ls, ls + ln); if (ln && ls[0] == 1) return 1; j = 0; for (i = 0; i < pn && pr[i] < n; i++) { p = pr[i]; while (j < ln && ls[j] < p) j++; if (j >= ln || ls[j] != p) return -1; c++; } return c; } int main(void) { gen(); while (scanf( %d %d , &ln, &n) == 2) { for (int i = 0; i < ln; i++) scanf( %d , ls + i); printf( %d n , solve()); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { if (b == 0) return 1; if (b == 1) return a; if (b % 2 == 1) return (power(a, b - 1) * a); long long q = power(a, b / 2); return (q * q); } void solve() { long long n; cin >> n; for (long long i = 0; i < n; i++) { for (long long j = 0; j < n; j++) { if (i == j or i == j + 1 or i == j - 1) cout << 1 << ; else cout << 0 << ; } cout << endl; } } int32_t main() { ios_base::sync_with_stdio(false); cout.tie(NULL); cin.tie(NULL); long long t = 1; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int rev(int a) { int ans = 0; int shift = 0; while (shift <= 7) { ans |= (a & 1 << shift ? 1 : 0) << (7 - shift); shift++; } return ans; } int main() { string a; int prev = 0; getline(cin, a); for (int i = 0; i < a.length(); i++) { int val = rev(a[i]); int res = prev - val; if (res > 0) cout << ((res) % 256) << endl; else cout << (256 + res) % 256 << endl; prev = val; } return 0; }
|
#include<cstdio> #include<iostream> #include<algorithm> int main() { int n; char a[100000]; bool x = 1; while (~scanf( %d , &n)) { while (n--) { x = 1; scanf( %s , a); for (int i = 0; a[i] != 0 ; i++) { if (x) { if (a[i] != a ) a[i] = a ; else a[i] = b ; x = 0; } else { if (a[i] != z ) a[i] = z ; else a[i] = z - 1; x = 1; } } printf( %s n , a); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; typedef struct trie { char c; bool win, lose; struct trie *alphabet[26]; } trie; void addString(trie *T, char *s); trie *initTrie(char c); void dfs(trie *T); int main() { int i, n, k; char s[100005]; trie *T = initTrie( 0 ); scanf( %d%d , &n, &k); for (i = 0; i < n; i++) { scanf( %s , s); addString(T, s); } dfs(T); if (!(T->win)) printf( Second n ); else if (T->win && T->lose) printf( First n ); else if (T->win && !(T->lose)) { if (k % 2) printf( First n ); else printf( Second n ); } return 0; } void dfs(trie *T) { int i, flag = 1; for (i = 0; i < 26; i++) { if (T->alphabet[i]) { flag = 0; dfs(T->alphabet[i]); T->win |= !(T->alphabet[i]->win); T->lose |= !(T->alphabet[i]->lose); } } if (flag) { T->win = false; T->lose = true; } } trie *initTrie(char c) { int i; trie *T = (trie *)malloc(sizeof(trie)); T->win = T->lose = false; T->c = c; for (i = 0; i < 26; i++) T->alphabet[i] = NULL; return T; } void addString(trie *T, char *s) { int len = strlen(s), i; for (i = 0; i < len; i++) { if (T->alphabet[s[i] - a ] == NULL) T->alphabet[s[i] - a ] = initTrie(s[i]); T = T->alphabet[s[i] - a ]; } }
|
#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; if (str[0] > 4 && str[0] != 9 ) str[0] = (char)( 9 - str[0] + 0 ); for (int x = 1; x < (int)str.length(); x++) if (str[x] > 4 ) str[x] = (char)( 9 - str[x] + 0 ); cout << str << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int dp[N][3][2]; string a; int n; int solve(int x, int state, int start) { if (x >= n) return 0; if (dp[x][state][start] != -1) return dp[x][state][start]; int res = 0; if (state == 0) { if (start == a[x]) res = max(solve(x + 1, 0, 1 - start) + 1, solve(x + 1, 1, start)); else res = max(solve(x + 1, 1, 1 - start) + 1, solve(x + 1, 0, start)); } if (state == 1) { if (start == a[x]) res = max(solve(x + 1, 2, 1 - start) + 1, solve(x + 1, 1, start)); else res = max(solve(x + 1, 2, start), solve(x + 1, 1, 1 - start) + 1); } if (state == 2) { if (start == a[x]) res = solve(x + 1, 2, 1 - start) + 1; else res = solve(x + 1, 2, start); } dp[x][state][start] = res; return res; } int main() { std::ios::sync_with_stdio(false); ; cin >> n; memset((dp), (-1), sizeof(dp)); cin >> a; for (int i = 0; i < n; i++) a[i] -= 0 ; cout << solve(0, 0, a[0]) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int *a = new int[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { if (i > 0 && i < n - 1) { if (abs(a[i] - a[i + 1]) < abs(a[i] - a[i - 1])) cout << abs(a[i] - a[i + 1]); else cout << abs(a[i] - a[i - 1]); if (abs(a[i] - a[n - 1]) < abs(a[i] - a[0])) cout << << abs(a[i] - a[0]) << endl; else cout << << abs(a[i] - a[n - 1]) << endl; } else { if (i == 0) { cout << abs(a[i] - a[i + 1]); cout << << abs(a[i] - a[n - 1]) << endl; } else if (i == n - 1) { cout << abs(a[i] - a[i - 1]); cout << << abs(a[0] - a[n - 1]) << endl; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 5e4 + 5; int main() { int k, n, s, p; cin >> k >> n >> s >> p; int ans = k * (n % s == 0 ? n / s : n / s + 1); if (ans % p == 0) cout << ans / p << endl; else cout << ans / p + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; const int inf = ~0u >> 2; int numa[N], numb[N], pos[N]; struct node { int val, id; node(int _val, int _id) { val = _val, id = _id; } bool operator<(const node& A) const { return val > A.val; } }; int now[N], unuse[N]; priority_queue<node> A, B; int __ans[N]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { scanf( %d , &numa[i]); pos[numa[i]] = i; } for (int i = 0; i < n; i++) { scanf( %d , &numb[i]); int val = i - pos[numb[i]]; if (val < 0) B.push(node(abs(val), i)); else A.push(node(abs(val), i)); now[i] = val; } int tmp = 0, len = 0; for (int k = n - 1; k >= 0; k--) { int pa = A.empty() ? inf : A.top().val + tmp; int pb = B.empty() ? inf : B.top().val - tmp; __ans[len++] = min(pa, pb); while (pb == 0) { int id = B.top().id; A.push(node(-tmp, id)); B.pop(); if (B.empty()) break; pb = B.top().val - tmp; } unuse[k] = 1; int np = pos[numb[k]]; now[k] = -np - tmp - 1; while (!A.empty() && (A.top().val + tmp != abs(now[A.top().id] + tmp) && unuse[A.top().id])) { unuse[A.top().id] = 0; A.pop(); } tmp++; if (np == 0) A.push(node(-tmp, k)); else B.push(node(np + tmp, k)); } cout << __ans[0] << endl; for (int i = len - 1; i; i--) printf( %d n , __ans[i]); }
|
#pragma GCC optimize( Ofast ) #include<bits/stdc++.h> using namespace std; #define int long long int #define double long double #define all(x) begin(x), end(x) #define Done(x) cout<<x<<endl; return; #define endl n void solve(){ int q; cin>>q; for(int i=0;i<q;i++){ int u; cin>>u; int v; cin>>v; if(v<u){ cout<< NO <<endl; }else if(v==u){ cout<< YES <<endl; }else{ vector<int>cnt(31); for(int i=0;i<30;i++){ if(u&(1<<i)){ cnt[i]++; } } bool can=true; for(int i=0;i<30;i++){ int val=(1<<i); if(v&val){ if(cnt[i]==0){ can=false; break; }else{ cnt[i]-=1; cnt[i+1]+=cnt[i]; } }else{ cnt[i+1]+=cnt[i]; } } if(can){ cout<< YES <<endl; }else{ cout<< NO <<endl; } } } } int32_t main(){ // Remove for Interactive Problems ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); cerr<< Time : <<1000*((double)clock())/(double)CLOCKS_PER_SEC<< ms n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 400003, INF = 0x3f3f3f3f; int n, Q, sz[maxn], fa[maxn], son[maxn], dfn[maxn], cntdfn, rig[maxn], top[maxn], dep[maxn], z[maxn]; vector<int> g[maxn]; struct T { int mx, sum; T operator+(T x) const { return (T){max(x.mx, x.sum + mx), sum + x.sum}; } } t[maxn]; void init1(int u) { sz[u] = 1; int mxsz = -1; for (int v : g[u]) { dep[v] = dep[u] + 1; init1(v); if (sz[v] > mxsz) mxsz = sz[v], son[u] = v; sz[u] += sz[v]; } } void init2(int u, int tp) { top[u] = tp; dfn[u] = ++cntdfn; if (son[u]) init2(son[u], tp); for (int v : g[u]) { if (v == son[u]) continue; init2(v, v); } rig[u] = cntdfn; } void solve(int p, int len) { t[p] = (T){-1, -len}, z[p] = 1; } void pushdown(int p, int l, int r) { if (z[p]) { int mid = (l + r) >> 1; solve(p << 1, mid - l + 1), solve(p << 1 | 1, r - mid); z[p] = 0; } } void add(int p, int l, int r, int pos, int k) { if (l == r) { t[p].sum += k, t[p].mx += k; return; } pushdown(p, l, r); int mid = (l + r) >> 1; if (pos <= mid) add(p << 1, l, mid, pos, k); else add(p << 1 | 1, mid + 1, r, pos, k); t[p] = t[p << 1] + t[p << 1 | 1]; } void cover(int p, int l, int r, int seg_l, int seg_r) { if (seg_l <= l && r <= seg_r) { solve(p, r - l + 1); return; } pushdown(p, l, r); int mid = (l + r) >> 1; if (seg_l <= mid) cover(p << 1, l, mid, seg_l, seg_r); if (seg_r > mid) cover(p << 1 | 1, mid + 1, r, seg_l, seg_r); t[p] = t[p << 1] + t[p << 1 | 1]; } T query(int p, int l, int r, int seg_l, int seg_r) { if (seg_l <= l && r <= seg_r) return t[p]; pushdown(p, l, r); int mid = (l + r) >> 1; if (seg_l <= mid && seg_r > mid) return query(p << 1, l, mid, seg_l, seg_r) + query(p << 1 | 1, mid + 1, r, seg_l, seg_r); else if (seg_l <= mid) return query(p << 1, l, mid, seg_l, seg_r); else return query(p << 1 | 1, mid + 1, r, seg_l, seg_r); } T query(int x) { T ret = (T){-INF, 0}; while (x) { ret = query(1, 1, n, dfn[top[x]], dfn[x]) + ret; x = fa[top[x]]; } return ret; } int main() { scanf( %d%d , &n, &Q); for (int i = 2; i <= n; i++) scanf( %d , fa + i), g[fa[i]].push_back(i); init1(1), init2(1, 1), cover(1, 1, n, 1, n); while (Q--) { int mo, x; scanf( %d%d , &mo, &x); if (mo == 1) { add(1, 1, n, dfn[x], 1); } if (mo == 2) { cover(1, 1, n, dfn[x], rig[x]); int tmp = max(query(x).mx + 1, 0); add(1, 1, n, dfn[x], -tmp); } if (mo == 3) { puts(query(x).mx >= 0 ? black : white ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, x, y, fail; int G[305][305], v[305], u[305], l[305], z[305]; long long int A, B, C, a[305], b[305], d[305]; int rx[305 * 305 * 2], ry[305 * 305 * 2], rc[305 * 305 * 2], cnt; void dfs(int x) { v[x] = 1; A += a[x]; B += b[x]; for (int i = (0); i < (n); i++) if (!v[i] && G[x][i]) G[x][i] = G[i][x] = 2, dfs(i); l[m++] = x; } void add(int x, int y, long long int c) { rx[cnt] = x + 1, ry[cnt] = y + 1, rc[cnt++] = (int)c; } void pull(int x, long long int d) { z[x] = 1; for (int i = (0); i < (n); i++) if (G[x][i] == 2 && !u[i] && d && !z[i]) { if (a[i] >= d) { a[i] -= d; a[x] += d; add(i, x, d); d = 0; } else { pull(i, d - a[i]); long long int t = min(d, a[i]); a[x] += t; a[i] -= t; d -= t; add(i, x, t); } } } void push(int x, long long int d) { z[x] = 1; for (int i = (0); i < (n); i++) if (G[x][i] == 2 && !u[i] && d && !z[i]) { if (C - a[i] >= d) { a[x] -= d; a[i] += d; add(x, i, d); d = 0; } else { push(i, d - (C - a[i])); long long int t = min(d, C - a[i]); a[i] += t; a[x] -= t; d -= t; add(x, i, t); } } } int main() { scanf( %d%I64d%d , &n, &C, &m); for (int i = (0); i < (n); i++) scanf( %I64d , &a[i]); for (int i = (0); i < (n); i++) scanf( %I64d , &b[i]); while (m--) { scanf( %d%d , &x, &y), x--, y--; G[x][y] = G[y][x] = 1; } for (int i = (0); i < (n); i++) if (!v[i]) { A = B = 0; m = 0; dfs(i); if (A != B) { fail = 1; break; } for (int j = (0); j < (m); j++) { int r = l[j]; memset(z, 0, sizeof(z)); if (a[r] > b[r]) push(r, a[r] - b[r]); if (a[r] < b[r]) pull(r, b[r] - a[r]); u[r] = 1; } } if (fail) puts( NO ); else { printf( %d n , cnt); for (int i = (0); i < (cnt); i++) printf( %d %d %d n , rx[i], ry[i], rc[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const long long int N = 1e5 + 5; long long int a[N], b[N], n, d, x; long long int getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initAB() { for (long long int i = 0; i < n; i++) { a[i] = i + 1; } for (long long int i = 0; i < n; i++) { swap(a[i], a[getNextX() % (i + 1)]); } for (long long int i = 0; i < n; i++) { if (i < d) b[i] = 1; else b[i] = 0; } for (long long int i = 0; i < n; i++) { swap(b[i], b[getNextX() % (i + 1)]); } } long long int pos[N]; vector<long long int> bb; long long int c[N]; void solve() { cin >> n >> d >> x; initAB(); for (long long int i = 0; i <= n - 1; i++) { if (b[i]) bb.push_back(i); } for (long long int i = 0; i <= n - 1; i++) { pos[a[i]] = i; } if (bb.size() <= 500) { for (long long int i = 0; i <= n - 1; i++) { for (long long int j : bb) { if (j > i) break; c[i] = max(c[i], a[i - j]); } } } else { for (long long int i = 0; i <= n - 1; i++) for (long long int j = n; j >= 1; j--) { long long int p = pos[j]; if (p <= i && b[i - p]) { c[i] = j; break; } } } for (long long int i = 0; i <= n - 1; i++) cout << c[i] << ; } signed main() { ios ::sync_with_stdio(0), cin.tie(0), cout.tie(0); clock_t clk = clock(); long long int t; t = 1; while (t--) { solve(); } cerr << (double)(clock() - clk) / CLOCKS_PER_SEC; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n % 2 << endl; }
|
#include <bits/stdc++.h> char b[20]; using namespace std; int main() { char a[14]; for (int i = 1; i <= 2; i++) { scanf( %s , a); if (strcmp(a, monday ) == 0) b[i] = 1; if (strcmp(a, tuesday ) == 0) b[i] = 2; if (strcmp(a, wednesday ) == 0) b[i] = 3; if (strcmp(a, thursday ) == 0) b[i] = 4; if (strcmp(a, friday ) == 0) b[i] = 5; if (strcmp(a, saturday ) == 0) b[i] = 6; if (strcmp(a, sunday ) == 0) b[i] = 7; } int flag = 1; for (int j = 3; j <= 5; j++) { if (j * 7 - b[1] + b[2] == 31 || j * 7 - b[1] + b[2] == 30 || j * 7 - b[1] + b[2] == 28) { printf( YES n ); flag = 0; } } while (flag) { printf( NO n ); flag = 0; } }
|
#include <bits/stdc++.h> using namespace std; long long powmod(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = res * a % 2; a = a * a % 2; b >>= 1; } return res; } int main() { ios_base::sync_with_stdio(false); long long b, k, sum = 0; cin >> b >> k; long long a[k]; for (long long i = 1; i <= k; i++) { cin >> a[i]; long long p = powmod(b, k - i); sum += a[i] * p; } if (sum % 2) cout << odd ; else cout << even ; }
|
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { char ch; bool flag = false; for (ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) flag = true; for (x = 0; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; x = flag ? -x : x; } inline void write(int x) { static const int maxlen = 100; static char s[maxlen]; if (x < 0) { putchar( - ); x = -x; } if (!x) { putchar( 0 ); return; } int len = 0; for (; x; x /= 10) s[len++] = x % 10 + 0 ; for (int i = len - 1; i >= 0; --i) putchar(s[i]); } int n, m; int pre[11000], now[110], son[11000], v[11000], tot; int f[110][110][30]; char s[100]; void build(int a, int b, int c) { pre[++tot] = now[a]; now[a] = tot; son[tot] = b; v[tot] = c; } int dfs(int x, int y, int MAX) { if (f[x][y][MAX] != -1) return f[x][y][MAX]; set<int> S; for (int p = now[x]; p; p = pre[p]) if (v[p] >= MAX) S.insert(dfs(y, son[p], v[p])); int q = -1; for (auto t : S) { if (t != q + 1) break; q = t; } return f[x][y][MAX] = q + 1; } int main() { read(n); read(m); for (int i = 1; i <= m; i++) { int a, b; read(a); read(b); scanf( %s , s); build(a, b, s[0] - a + 1); } memset(f, -1, sizeof(f)); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dfs(i, j, 0); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (f[i][j][0]) printf( A ); else printf( B ); puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, cnt = 0, flag = 0, k = 0; string str; cin >> n >> str; for (i = 0; i < n; i++) { if (str[i] == ( ) { cnt++; if (cnt == 2) j = i; } else cnt--; if ((cnt == -2) && (!k)) k = i; if (cnt < -2) break; if (cnt < 0) flag = 1; } if ((!cnt) || (flag && cnt == 2) || (i != n) || ((cnt != 2) && (cnt != -2))) { cout << 0 n ; return 0; } if (cnt == 2) { cnt = 0; for (i = j; i < n; i++) { if (str[i] == ( ) cnt++; } } else { cnt = 0; for (i = 0; i < k; i++) { if (str[i] == ( ) cnt++; else cnt--; if (cnt == -1) break; } cnt = 0; k = i; for (i = 0; i <= k; i++) { if (str[i] == ) ) cnt++; } } cout << cnt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; pair<int, int> p[n]; int t = 0; for (int i = 0; i < n; i++) { cin >> p[i].first >> p[i].second; } sort(p, p + n); int start = 0, l = 0, r = 0, s = 0; for (int i = 0; i < 2 * n; i++) { if (i < n && p[i].first > 0) { start = 1; } if (start) { l = i - 1; r = i; while (1) { if (l < 0 && r == n) break; if (l < 0) { s += p[r].second; break; } else if (r == n) { s += p[l].second; break; } s += p[l--].second + p[r++].second; } return cout << s, 0; } } cout << p[n - 1].second << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int a[100100]; int dig[11]; int ans[11]; int main() { int sum = 0; bool pos = false; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; dig[a[i]]++; sum += a[i]; } if (dig[0] == 0) { cout << -1; return 0; } if (sum % 3 == 0) pos = true; if (sum % 3 == 1) { if (dig[1] > 0) { dig[1] -= 1; pos = true; } else if (dig[4] > 0) { pos = true; dig[4] -= 1; } else if (dig[7] > 0) { dig[7] -= 1; pos = true; } else { int a = 10, ai, aj; for (int i = 0; i <= 9; i++) for (int j = 0; j <= 9; j++) if (i != j) { if ((i + j) % 3 == 1 && dig[i] > 0 && dig[j] > 0 && max(i, j) < a) { a = max(i, j); ai = i; aj = j; pos = true; } } else { if ((i + j) % 3 == 1 && dig[i] > 1 && max(i, j) < a) { a = max(i, j); ai = i; aj = j; pos = true; } } dig[ai] -= 1; dig[aj] -= 1; } } else if (sum % 3 == 2) { if (dig[2] > 0) { dig[2] -= 1; pos = true; } else if (dig[5] > 0) { dig[5] -= 1; pos = true; } else if (dig[8] > 0) { dig[8] -= 1; pos = true; } else { int a = 10, ai, aj; for (int i = 0; i <= 9; i++) for (int j = 0; j <= 9; j++) if (i != j) { if ((i + j) % 3 == 2 && dig[i] > 0 && dig[j] > 0 && max(i, j) < a) { a = max(i, j); ai = i; aj = j; pos = true; } } else { if ((i + j) % 3 == 2 && dig[i] > 1 && max(i, j) < a) { a = max(i, j); ai = i; aj = j; pos = true; } } dig[ai] -= 1; dig[aj] -= 1; } } if (pos) { bool shown = false; for (int i = 9; i > 0; i--) for (int j = 0; j < dig[i]; j++) { cout << i; shown = true; } if (shown) for (int j = 0; j < dig[0]; j++) cout << 0; else cout << 0; } else cout << 0; }
|
#include <bits/stdc++.h> using namespace std; int getInt() { int ret; scanf( %d , &ret); return ret; } int main() { int n = getInt(); vector<pair<int, int> > pr(n); for (int i = 0; i < (int)(n); i++) { pr[i].first = getInt(); pr[i].second = getInt(); } sort(pr.begin(), pr.end()); int ans = 0; int mxp = 0; int mx = 0; for (int i = 0; i < (int)(pr.size()); i++) { if (i != 0) { if (pr[i].first != pr[i - 1].first) { mx = mxp; } } if (mx > pr[i].second) ans++; mxp = max(mxp, pr[i].second); } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int f[105][45], head[105], la[45]; int n, k, i, j, ans, u, v, cnt; struct ff { int to, nxt; } e[2 * 105]; void add(int u, int v) { e[++cnt] = (ff){v, head[u]}; head[u] = cnt; } void dfs(int now, int fa) { if (e[head[now]].nxt == 0 && fa) { f[now][0] = f[now][k + 1] = 1; return; } bool flag = 1; for (int i = head[now]; i; i = e[i].nxt) { int v = e[i].to; if (v == fa) continue; dfs(v, now); if (flag) { for (int j = 0; j <= 2 * k; j++) f[now][j + 1] = f[v][j]; flag = 0; } else { for (int j = 0; j <= 2 * k + 1; j++) la[j] = f[now][j], f[now][j] = 0; for (int j = 0; j <= 2 * k; j++) for (int h = 1; h <= 2 * k + 1; h++) if (j + h <= 2 * k) { int Min = min(j + 1, h); f[now][Min] = (f[now][Min] + 1ll * la[h] * f[v][j] % 1000000007) % 1000000007; } else { int Max = max(j + 1, h); f[now][Max] = (f[now][Max] + 1ll * la[h] * f[v][j] % 1000000007) % 1000000007; } } } for (int i = 1; i <= 2 * k + 1; i++) f[now][0] = (f[now][0] + f[now][i]) % 1000000007; } int main() { scanf( %d%d , &n, &k); for (i = 1; i < n; i++) { scanf( %d%d , &u, &v); add(u, v), add(v, u); } dfs(1, 0); for (i = 0; i <= k; i++) ans = (ans + f[1][i]) % 1000000007; if (ans == 0) ans = 1; printf( %d n , ans); return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.