func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long int a[1001]; map<long long int, int> used; int ans = 0; map<pair<long long int, long long int>, bool> us; void rec(long long int x, long long int y, int kol) { ans = max(ans, kol); long long int z = x + y; if (z > 1000000000 || z < -1000000000) return; x = y; y = z; if (used[z] > 0) { used[z]--; rec(x, y, kol + 1); used[z]++; } } int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; used[a[i]]++; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (us[make_pair(a[i], a[j])] || i == j) continue; us[make_pair(a[i], a[j])] = true; used[a[i]]--; used[a[j]]--; rec(a[i], a[j], 2); used[a[i]]++; used[a[j]]++; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> long long int M = 1000000007; using namespace std; vector<int> cnt(1e6 + 1); void SieveOfEratosthenes(int n) { bool prime[n + 1]; memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } int c = 0; cnt[1] = c; cnt[0] = c; for (int p = 2; p <= n; p++) if (prime[p]) cnt[p] = ++c; else cnt[p] = c; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(25); ; SieveOfEratosthenes(1e6 + 1); int T; cin >> T; while (T--) { int n; cin >> n; int r = floor(sqrt(n)); cout << 1 + cnt[n] - cnt[r] << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3fll; const long long M = 1e9 + 7; const long long maxn = 1e6 + 107; const double pi = acos(-1.0); const double eps = 0.0000000001; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <typename T> inline void pr2(T x, int k = 64) { long long i; for (i = 0; i < k; i++) fprintf(stderr, %d , (x >> i) & 1); putchar( ); } template <typename T> inline void add_(T &A, int B, long long MOD = M) { A += B; (A >= MOD) && (A -= MOD); } template <typename T> inline void mul_(T &A, long long B, long long MOD = M) { A = (A * B) % MOD; } template <typename T> inline void mod_(T &A, long long MOD = M) { A %= MOD; A += MOD; A %= MOD; } template <typename T> inline void max_(T &A, T B) { (A < B) && (A = B); } template <typename T> inline void min_(T &A, T B) { (A > B) && (A = B); } template <typename T> inline T abs(T a) { return a > 0 ? a : -a; } inline long long powMM(long long a, long long b, long long mod = M) { long long ret = 1; for (; b; b >>= 1ll, a = a * a % mod) if (b & 1) ret = ret * a % mod; return ret; } int startTime; void startTimer() { startTime = clock(); } void printTimer() { fprintf(stderr, /--- Time: %ld milliseconds ---/ n , clock() - startTime); } const int mod = 1e9 + 7; struct mint { long long x; mint() : x(0) {} mint(long long x) : x((x % mod + mod) % mod) {} mint &fix() { x = (x % mod + mod) % mod; return *this; } mint operator-() const { return mint(0) - *this; } mint operator~() const { return mint(1) / *this; } mint &operator+=(const mint &a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint &operator-=(const mint &a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; } mint &operator*=(const mint &a) { (x *= a.x) %= mod; return *this; } mint &operator/=(const mint &a) { (x *= a.pow(mod - 2).x) %= mod; return *this; } mint operator+(const mint &a) const { return mint(*this) += a; } mint operator-(const mint &a) const { return mint(*this) -= a; } mint operator*(const mint &a) const { return mint(*this) *= a; } mint operator/(const mint &a) const { return mint(*this) /= a; } mint pow(long long t) const { if (!t) return 1; mint res = pow(t / 2); res *= res; return (t & 1) ? res * x : res; } bool operator<(const mint &a) const { return x < a.x; } bool operator==(const mint &a) const { return x == a.x; } }; int bruteforce(string s) { set<string> S, T; S.insert( ); for (auto c : s) { for (auto str : S) { if (str.length() == 0) T.insert(str + c); else { if (c == 0 ) { T.insert(str); T.insert(str + 0 ); } if (c == 1 ) { T.insert(str + 1 ); *str.rbegin() = 1 ; T.insert(str); } } } S.swap(T); set<string>().swap(T); } printf( %d n , (int)T.size()); return T.size(); } mint val_kzero[maxn], to_next[maxn]; mint dp[maxn]; char str[maxn]; int main() { scanf( %s , str + 1); int n = strlen(str + 1), i; for (i = 1; i <= n; i++) if (str[i] == 1 ) break; if (i == n + 1) return 0 * printf( %d , n); int noww = i - 1; n -= noww; for (i = 1; i <= n; i++) str[i] = str[i + noww]; int count = 0; to_next[0] = mint(1); for (i = 1; i <= n; i++) { if (str[i] == 1 ) { count = 0; dp[i] = to_next[count]; to_next[0] = dp[i]; to_next[1] += dp[i]; } else { count++; dp[i] = to_next[count]; to_next[count] = mint(0); to_next[count + 1] += dp[i]; to_next[0] += dp[i]; } val_kzero[count] += dp[i]; } mint ans(0); for (i = 0; i <= count; i++) ans += val_kzero[i]; printf( %lld n , ans.x * (noww + 1) % M); }
|
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, m, n, boys[105], girls[105]; while (cin >> n >> m) { memset(boys, 0, sizeof(boys)); memset(girls, 0, sizeof(girls)); cin >> k; while (k--) { cin >> j; boys[j] = 1; } cin >> k; while (k--) { cin >> j; girls[j] = 1; } int sqr = max(n, m); sqr = sqr * sqr; for (i = 0; i < sqr; i++) { j = (i % n); k = (i % m); boys[j] = (boys[j] || girls[k]); girls[k] = (boys[j] || girls[k]); } bool possible = true; for (i = 0; i < n; i++) { if (boys[i] == 0) possible = false; } for (i = 0; i < m; i++) { if (girls[i] == 0) possible = false; } if (possible) cout << Yes n ; else cout << No n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MN = 1e5 + 5; int T, N, arr[MN]; void solve() { scanf( %d , &N); for (int i = 0; i < N; i++) scanf( %d , arr + i); sort(arr, arr + N); printf( %d n , min(min(arr[N - 1], arr[N - 2]) - 1, N - 2)); } int main() { scanf( %d , &T); while (T--) solve(); }
|
#include <bits/stdc++.h> using namespace std; const int N = 1210, inf = 0x3f3f3f3f; int n, m, k, x, y, rd[N], s, t, cnt = 1, head[N], stk[N], col[N], tot, sum, vis[N]; struct edge { int to, nxt, c; } e[N * 10]; void Adde(int x, int y, int c) { e[++cnt].to = y; e[cnt].nxt = head[x]; head[x] = cnt; e[cnt].c = c; } void adde(int x, int y, int c) { Adde(x, y, c); Adde(y, x, 0); } void gg() { for (int i = (1); i <= (m); i++) printf( 0 ); puts( ); } bool bfs() { queue<int> q; q.push(s); for (int i = (1); i <= (t); i++) vis[i] = -1; vis[s] = 1; while (!q.empty()) { int u = q.front(); q.pop(); for (int i = head[u], v; i; i = e[i].nxt) if (v = e[i].to, e[i].c && vis[v] == -1) vis[v] = vis[u] + 1, q.push(v); } return vis[t] != -1; } int dfs(int u, int flow) { if (u == t) return flow; int used = 0, w; for (int i = head[u], v; i; i = e[i].nxt) if (v = e[i].to, e[i].c && vis[v] == vis[u] + 1) { w = dfs(v, min(e[i].c, flow - used)); e[i].c -= w; e[i ^ 1].c += w; used += w; if (used == flow) return flow; } if (!used) vis[u] = -1; return used; } int dinic() { int res = 0; while (bfs()) res += dfs(s, inf); return res; } int Main() { scanf( %d%d%d , &n, &m, &k); s = n + m + 1, t = s + 1; tot = sum = 0; for (int i = (1); i <= (m); i++) { scanf( %d%d , &x, &y), rd[x]++, rd[y]++; adde(i + n, x, 1), adde(i + n, y, 1), adde(s, i + n, 1); } for (int i = (1); i <= (n); i++) if (rd[i] > k) adde(i, t, 2 * (rd[i] - k)), sum += 2 * (rd[i] - k); if (dinic() == sum) { memset(col, 0, m + 1 << 2); for (int u = (1); u <= (n); u++) { int top = 0; for (int i = head[u]; i; i = e[i].nxt) if (e[i].c) stk[++top] = e[i].to - n; for (int i = 1; i <= top; i += 2) col[stk[i]] = col[stk[i + 1]] = ++tot; } for (int i = (1); i <= (m); i++) if (!col[i]) col[i] = ++tot; for (int i = (1); i <= (m); i++) printf( %d , col[i]); puts( ); } else gg(); cnt = 1; memset(head, 0, t + 1 << 2); memset(rd, 0, n + 1 << 2); return 0; } int main() { int T; scanf( %d , &T); while (T--) Main(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; vector<int> g[maxn + 1]; int father[maxn + 1], a[maxn + 1]; int f[maxn + 1], fup[maxn + 1]; int n, K; int result; int ge[maxn + 1], upge[maxn + 1]; int MIN; void init() { int i, x, y; scanf( %d%d , &n, &K); for (i = 1; i <= n; ++i) scanf( %d , &a[i]); for (i = 1; i < n; ++i) { scanf( %d%d , &x, &y); g[x].push_back(y); g[y].push_back(x); } } void calc_ge(int p, int fa) { int i, j; father[p] = fa; ge[p] = 1; for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != fa) { calc_ge(j, p); ge[p] += ge[j]; } } } void calc_f(int p) { int i, j, zd = 0, sum = 0; if ((g[p].size() == 1) && (father[p] == g[p][0])) { if (a[p] >= MIN) f[p] = 1; else f[p] = 0; return; } if (a[p] < MIN) { f[p] = 0; for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) calc_f(j); } return; } for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) { calc_f(j); if (f[j] == ge[j]) sum += f[j]; else { if (f[j] > zd) zd = f[j]; } } } f[p] = 1 + sum + zd; } void calc_fup(int p) { int i, j, zd = 0, zd2 = 0, sum = 0; if ((g[p].size() == 1) && (father[p] == g[p][0])) return; if (a[p] < MIN) { for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) { fup[j] = 0; calc_fup(j); } } return; } if (fup[p] == upge[p]) sum = fup[p]; else zd = fup[p]; for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) { if (f[j] == ge[j]) sum += f[j]; else { if (f[j] > zd) { zd2 = zd; zd = f[j]; } else if (f[j] > zd2) zd2 = f[j]; } } } for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) { if (f[j] == ge[j]) fup[j] = 1 + sum - f[j] + zd; else if (f[j] == zd) fup[j] = 1 + sum + zd2; else fup[j] = 1 + sum + zd; } } for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) calc_fup(j); } } bool ky(int now) { int p, i, j, sum, zd; MIN = now; calc_f(1); fup[1] = 0; calc_fup(1); for (p = 1; p <= n; ++p) { sum = zd = 0; if (fup[p] == upge[p]) sum = fup[p]; else zd = fup[p]; if (a[p] < MIN) continue; for (i = 0; i < g[p].size(); ++i) { j = g[p][i]; if (j != father[p]) { if (f[j] == ge[j]) sum += f[j]; else { if (f[j] > zd) zd = f[j]; } } } if (1 + sum + zd >= K) return true; } return false; } void work() { int i, start, stop, mid; father[1] = 0; calc_ge(1, 0); for (i = 1; i <= n; ++i) upge[i] = n - ge[i]; start = 1; stop = 1000010; while (start <= stop) { mid = (start + stop) / 2; if (ky(mid)) { result = mid; start = mid + 1; } else stop = mid - 1; } } void output() { printf( %d n , result); } int main() { init(); work(); output(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long double PI = 3.141592653589793238462643383; struct Rcompare { bool operator()(pair<int, int> lhs, pair<int, int> rhs) { return lhs.first > rhs.first; } }; struct compare { bool operator()(pair<int, int> lhs, pair<int, int> rhs) { return lhs.first < rhs.first; } }; long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } long long int lcm(long long int a, long long int b) { return a * (b / gcd(a, b)); } long long int Abs(long long int a) { if (a > 0) return a; return -a; } long long int Ceil(long long int a, long long int b) { if (a % b == 0) return a / b; else return a / b + 1; } double Abs(double a) { if (a > 0) return a; return -a; } long long int pow(long long int x, long long int y) { if (y == 0) return 1; long long int tmp = pow(x, y / 2); if (y % 2 == 1) return ((tmp * tmp) * x); return (tmp * tmp); } const int MAX = 100009; const int MOD = 1e9 + 7; const int inf = 1e9 + 10; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int a, b, c, m; cin >> c >> b >> a >> m; if (2 * a < m || a > 2 * m) { cout << -1 << n ; return 0; } else if (2 * m > 2 * b || 2 * m > 2 * c) { cout << -1 << n ; return 0; } else { for (int i = max(2 * m + 1, c); i <= (2 * c); ++i) for (int j = max(2 * m + 1, b); j <= (2 * b); ++j) for (int k = max(a, m); k <= (min(2 * a, 2 * m)); ++k) { if (k < j && j < i) { cout << i << n << j << n << k << n ; return 0; } } } cout << -1 << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int arr[100005]; int main() { long long int n, a, b, x, val, pos; cin >> n >> a >> b; for (long long int i = 0; i < n; i++) { cin >> x; long long int val = x * a; long long int t = val / b; long long int tb = t * b; long long int bad = ceil((long double)tb / a); cout << x - bad << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 99999997; const int mmax = 200010; const double eps = 1e-8; const double pi = acos(-1.0); const int inf = 0x3fffffff; int a[200010], b[200010]; int main() { int n, m, sa, sb; int cnt1, cnt2, df; while (cin >> n) { for (int i = 0; i < n; i++) scanf( %d , &a[i]); cin >> m; for (int i = 0; i < m; i++) scanf( %d , &b[i]); sort(a, a + n); sort(b, b + m); sa = 3 * n, sb = 3 * m; df = sa - sb; cnt1 = 0, cnt2 = 0; while (cnt1 < n && cnt2 < m) { if (a[cnt1] == b[cnt2]) cnt1++, cnt2++; else if (a[cnt1] < b[cnt2]) { df -= 1; cnt1++; } else { df += 1; if (df > sa - sb) { sa = 2 * cnt1 + 3 * (n - cnt1); sb = 2 * (cnt2 + 1) + 3 * (m - cnt2 - 1); } cnt2++; } } if (2 * n - 2 * m > sa - sb) sa = 2 * n, sb = 2 * m; cout << sa << : << sb << endl; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int lo = 0, hi = m; while (lo < hi) { int mid = (lo + hi) / 2; int last = 0; bool b = true; for (int i = 0; i < n; ++i) { int delta = (last - a[i] + m) % m; if (delta <= mid) continue; if (a[i] < last) { b = false; break; } last = a[i]; } if (b) { hi = mid; } else { lo = mid + 1; } } cout << lo << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int sieve[1000003 + 5]; long long int num_primes[1000005] = {0}; void calc_sieve() { for (long long int i = 0; i <= 1000003; i++) sieve[i] = 0; sieve[0] = sieve[1] = 1; for (long long int i = 2; i <= 1000003; i++) { num_primes[i] = num_primes[i - 1]; if (sieve[i] == 0) { num_primes[i]++; for (long long int j = i + i; j <= 1000003; j = j + i) sieve[j]++; } } } long long int ans = -1; bool check(long long int a, long long int b, long long int l, long long int k) { for (long long int i = a; i <= b - l + 1; i++) { if (num_primes[i + l - 1] - num_primes[i - 1] < k) return false; } ans = l; return true; } void binary_search_primes(long long int a, long long int b, long long int k, long long int start, long long int end) { if (end - start <= 1) { if (!check(a, b, start, k)) check(a, b, end, k); return; } long long int mid = (start + end) / 2; if (check(a, b, mid, k)) { binary_search_primes(a, b, k, start, mid - 1); } else { binary_search_primes(a, b, k, mid + 1, end); } } int main() { calc_sieve(); long long int a, b, k; cin >> a >> b >> k; binary_search_primes(a, b, k, 1, b - a + 1); cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int n1 = n; int k1; int k[n + 1]; int pri[n + 1]; for (int i = 1; i <= n; i++) { k[i] = 0; pri[i] = 0; } int f = 0; std::vector<int> nhi; for (int j = 1; j <= n; j++) { f = 0; cin >> k1; int pr[k1 + 1]; for (int i = 1; i <= k1; i++) { cin >> pr[i]; } for (int i = 1; i <= k1; i++) { if (k[pr[i]] == 0) { k[pr[i]] = 1; pri[j] = 1; break; } } if (pri[j] == 0) { nhi.push_back(j); } } if (nhi.empty()) cout << OPTIMAL << n ; else { int g; for (int i = 1; i <= n; i++) { if (k[i] == 0) { g = i; break; } } cout << IMPROVE << n ; cout << nhi[0] << << g << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; char buf[25]; const int maxn = 1000010; int a[maxn * 2], b[maxn * 2]; int n, m, x, y, t, mx; int read() { int x = 0, f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = 1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return f ? -x : x; } void write(int x) { if (!x) { putchar( 0 ); return; } if (x < 0) { putchar( - ); x = -x; } int cnt = 0; while (x) { buf[++cnt] = 0 + x % 10; x /= 10; } for (int i = cnt; i >= 1; --i) putchar(buf[i]); } int main() { t = read(); for (int i = 1; i <= t; ++i) { int v = read(); mx = max(mx, v); ++a[v]; } int x = 1; for (int i = 1; i <= mx; ++i) if (a[i] != i * 4) { x = i; break; } for (int i = x * 2 - 1; i <= t; ++i) if (t % i == 0) { n = i; m = t / i; y = n + m - x - mx; if (y <= 0 || y * 2 - 1 > m) continue; bool flag = true; int t1 = 0, t2 = 0; for (int j = 1; j <= n; ++j) { bool f = true; for (int k = 1; k <= m; ++k) { t1 = j; t2 = k; int tmp = abs(j - x) + abs(k - y); ++b[tmp]; if (b[tmp] > a[tmp]) { flag = false; f = false; break; } } if (!f) break; } for (int j = 1; j <= n; ++j) { bool f = true; for (int k = 1; k <= m; ++k) { int tmp = abs(j - x) + abs(k - y); --b[tmp]; if (j == t1 && k == t2) { f = false; break; } } if (!f) break; } if (flag) { write(n); putchar( ); write(m); putchar( n ); write(x); putchar( ); write(y); putchar( n ); return 0; } } write(-1); putchar( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int a[n], i, j, k, cnt = 1e9, tmp = 0; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < s.size() - 1; i++) { if (s[i] == R && s[i + 1] == L ) { tmp = (a[i + 1] - a[i]) / 2; if (tmp < cnt) cnt = tmp; } } if (cnt == 1e9) cout << -1 << endl; else cout << cnt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, q; const int max_w = 100; vector<pair<int, int>> cnt_sort(vector<pair<int, int>>& a) { vector<int> cnt(n * max_w + 5); for (int i = 0; i < a.size(); ++i) { ++cnt[a[i].first + 1]; } for (int i = 1; i < cnt.size(); ++i) { cnt[i] += cnt[i - 1]; } vector<pair<int, int>> res(a.size()); for (int i = 0; i < a.size(); ++i) { res[cnt[a[i].first]++] = a[i]; } return res; }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m >> q; vector<int> w(n); for (int i = 0; i < n; ++i) { cin >> w[i]; } reverse(w.begin(), w.end()); vector<int> cnt(1 << n, 0); string s; for (int i = 0; i < m; ++i) { cin >> s; int res = 0; for (int j = 0; j < n; ++j) { res <<= 1; res |= (s[j] == 1 ); } ++cnt[res]; } vector<vector<pair<int, int>>> ans(1 << n, vector<pair<int, int>>()); vector<vector<int>> sum(1 << n, vector<int>(1 << n)); for (int i = 0; i < ans.size(); ++i) { for (int j = 0; j < cnt.size(); ++j) { if (cnt[j] == 0) continue; int kok = i ^ j; int res = 0; for (int k = 0; k < n; ++k) { if (!((kok >> k) & 1)) { res += w[k]; } } ans[i].push_back({res, cnt[j]}); } ans[i] = cnt_sort(ans[i]); sum[i][0] = ans[i][0].second; for (int j = 1; j < ans[i].size(); ++j) { sum[i][j] = sum[i][j - 1] + ans[i][j].second; } } int k; while (q--) { cin >> s >> k; int res = 0; for (int j = 0; j < n; ++j) { res <<= 1; res |= (s[j] == 1 ); } int j = upper_bound(ans[res].begin(), ans[res].end(), make_pair(k, 100000000)) - ans[res].begin(); --j; if (j < 0) { cout << 0; } else { cout << sum[res][j]; } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; int p[1000006], n, k; int main() { ios::sync_with_stdio(false); cin >> n >> k; iota(p + 1, p + n + 1, 1); for (int i = 2; i <= n; i++) { if (p[i] == i) { p[i]--; for (int j = i + i; j <= n; j += i) p[j] = p[j] / i * (i - 1); } } sort(p + 1, p + n + 1); long long ans = 0; for (int i = 1; i <= k + 2; i++) { ans += p[i]; } if (k == 1) ans--; cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Query { int id, left, right, time, blockLeft, blockRight; Query() : id(-1), left(-1), right(-1), time(-1), blockLeft(-1), blockRight(-1) {} Query(int id, int left, int right, int time, int blockLeft, int blockRight) : id(id), left(left), right(right), time(time), blockLeft(blockLeft), blockRight(blockRight) {} bool operator<(const Query &otherQuery) const { if (blockLeft != otherQuery.blockLeft) { return blockLeft < otherQuery.blockLeft; } if (blockRight != otherQuery.blockRight) { return blockRight < otherQuery.blockRight; } return time < otherQuery.time; } }; struct Operation { int pos, oldValue, newValue; Operation() : pos(-1), oldValue(-1), newValue(-1) {} Operation(int pos, int oldValue, int newValue) : pos(pos), oldValue(oldValue), newValue(newValue) {} }; void del(int value, int *cnts, int *saveValues) { if (cnts[value] > 0) saveValues[cnts[value]]--; cnts[value]--; if (cnts[value] > 0) saveValues[cnts[value]]++; } void add(int value, int *cnts, int *saveValues) { if (cnts[value] > 0) saveValues[cnts[value]]--; cnts[value]++; if (cnts[value] > 0) saveValues[cnts[value]]++; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; int sqrtValue = pow(n, 2.0 / 3.0), *values = new int[n + 1], *tmpValues = new int[n + 1]; if (sqrtValue == 0) sqrtValue = 1; vector<int> disValues; for (int i = 1; i <= n; i++) { cin >> values[i]; tmpValues[i] = values[i]; disValues.push_back(values[i]); } Query *querys = new Query[q + 1]; Operation *opts = new Operation[q + 1]; int cntQuerys = 0, cntOpts = 0; for (int i = 1; i <= q; i++) { int opt; cin >> opt; if (opt == 1) { int left, right; cin >> left >> right; ++cntQuerys; querys[cntQuerys] = Query(cntQuerys, left, right, cntOpts, left / sqrtValue, right / sqrtValue); } else { int pos, value; cin >> pos >> value; ++cntOpts; opts[cntOpts] = Operation(pos, tmpValues[pos], value); tmpValues[pos] = value; disValues.push_back(value); } } sort(disValues.begin(), disValues.end()); disValues.resize(unique(disValues.begin(), disValues.end()) - disValues.begin()); for (int i = 1; i <= cntOpts; i++) { Operation &tmpOpt = opts[i]; tmpOpt.oldValue = lower_bound(disValues.begin(), disValues.end(), tmpOpt.oldValue) - disValues.begin(); tmpOpt.newValue = lower_bound(disValues.begin(), disValues.end(), tmpOpt.newValue) - disValues.begin(); } for (int i = 1; i <= n; i++) { values[i] = lower_bound(disValues.begin(), disValues.end(), values[i]) - disValues.begin(); } int valueSize = static_cast<int>(disValues.size()), *cnts = new int[valueSize + 3], *saveValues = new int[n + 2]; memset(cnts, 0, sizeof(int) * (valueSize + 3)); memset(saveValues, 0, sizeof(int) * (n + 2)); int *results = new int[cntQuerys + 1]; sort(querys + 1, querys + cntQuerys + 1); int l = 1, r = 0, time = 0; for (int i = 1; i <= cntQuerys; i++) { Query &tmpQuery = querys[i]; while (l > tmpQuery.left) { l--; add(values[l], cnts, saveValues); } while (l < tmpQuery.left) { del(values[l], cnts, saveValues); l++; } while (r > tmpQuery.right) { del(values[r], cnts, saveValues); r--; } while (r < tmpQuery.right) { r++; add(values[r], cnts, saveValues); } while (time < tmpQuery.time) { time++; Operation &tmpOpt = opts[time]; if (tmpOpt.pos >= l && tmpOpt.pos <= r) { del(tmpOpt.oldValue, cnts, saveValues); add(tmpOpt.newValue, cnts, saveValues); } values[tmpOpt.pos] = tmpOpt.newValue; } while (time > tmpQuery.time) { Operation &tmpOpt = opts[time]; if (tmpOpt.pos >= l && tmpOpt.pos <= r) { del(tmpOpt.newValue, cnts, saveValues); add(tmpOpt.oldValue, cnts, saveValues); } values[tmpOpt.pos] = tmpOpt.oldValue; time--; } for (int i = 1;; i++) { if (i > n) { results[tmpQuery.id] = 0; } if (saveValues[i] == 0) { results[tmpQuery.id] = i; break; } } } for (int i = 1; i <= cntQuerys; i++) { cout << results[i] << endl; } return 0; }
|
#include <bits/stdc++.h> const int N = 200005; const int M = 500005; using namespace std; pair<int, int> a[N]; int p[20][M]; int main() { int n, m; scanf( %d%d , &n, &m); int i, j; for (i = 0; i < n; i++) { scanf( %d%d , &a[i].first, &a[i].second); } sort(a, a + n); memset(p, -1, sizeof(p)); int maxe = -1; j = 0; for (i = 0; i < M; i++) { while (j < n && a[j].first <= i) { if (a[j].second > maxe) maxe = a[j].second; j++; } if (maxe >= i) p[0][i] = maxe; else p[0][i] = -1; } for (j = 0; j < 19; j++) for (i = 0; i < M; i++) if (p[j][i] == -1) p[j + 1][i] = -1; else p[j + 1][i] = p[j][p[j][i]]; int u, v; for (i = 0; i < m; i++) { scanf( %d%d , &u, &v); int ans = 0; for (j = 19; j >= 0; j--) if (p[j][u] < v) { u = p[j][u]; ans += 1 << j; } u = p[0][u]; ans++; if (u >= v) printf( %d n , ans); else printf( -1 n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, t; int main() { cin >> t; while (t--) { int s = 0, a; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a; s += 2 * a; } if (m < n || n < 3) { cout << -1 << endl; continue; } cout << s << endl; for (int i = 1; i < n; i++) cout << i << << i + 1 << endl; cout << n << << 1 << endl; } }
|
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios::sync_with_stdio(0); solve(); return 0; } list<pair<deque<int>, int> > basket; int N, bN; int p[100001]; void update(pair<deque<int>, int>& it) { it.second = it.first[0]; for (int i = 0; i < (int)((it.first).size()); i++) { it.second = max(it.second, it.first[i]); } } void solve() { cin >> N; bN = 250; basket.push_back(pair<deque<int>, int>(deque<int>(), 0)); for (int i = 0; i < N; i++) { int a, c; cin >> a >> c; p[a] = i + 1; int cc = c; list<pair<deque<int>, int> >::iterator it = basket.begin(); for (; it != basket.end(); it++) { if (it->second > a || (int)it->first.size() > cc) { break; } cc -= it->first.size(); } if (it == basket.end()) { it--; cc += it->first.size(); } deque<int>& b = it->first; b.push_front(a); for (int j = 0; j < (int)((b).size()) - 1 && cc > 0; j++, cc--) { if (b[j] < b[j + 1]) break; swap(b[j], b[j + 1]); } if ((int)((b).size()) >= 2 * bN) { pair<deque<int>, int> item(deque<int>(), 0); while ((int)((b).size()) > bN) { item.first.push_back(b.front()); b.pop_front(); } update(*it); update(item); basket.insert(it, item); } else { update(*it); } } vector<int> ans; for (list<pair<deque<int>, int> >::iterator it = basket.begin(); it != basket.end(); it++) { deque<int>& b = it->first; for (int i = 0; i < (int)((b).size()); i++) { ans.push_back(p[b[i]]); } } reverse(ans.begin(), ans.end()); for (int i = 0; i < (int)((ans).size()); i++) cout << ans[i] << ; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 5005; const int maxm = maxn * 2; const int maxe = 200005; const int mod = 1e9 + 7; int n, a, b; string str; int cc[26][maxn][26]; int exist[26]; int main() { cin >> str; n = str.length(); for (int i = 0; i < n; i++) { int idx = str[i] - a ; exist[idx]++; for (int j = 1; j < n; j++) { int pos = (i + j) % n; int idx2 = str[pos] - a ; cc[idx][j][idx2]++; } } double ans = 0; for (int i = 0; i < 26; i++) { double cccc = 0; for (int j = 1; j < n; j++) { double tp = 0; for (int ii = 0; ii <= n; ii++) { if (str[ii] - a != i) continue; int pos = (ii + j) % n; int idx2 = str[pos] - a ; if (cc[i][j][idx2] == 1) tp++; } cccc = max(cccc, tp); } ans += cccc; } printf( %.15lf n , ans / n); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k; scanf( %lld%lld%lld , &n, &m, &k); if (n % 2 == 0) { printf( Marsel n ); return 0; } if (n % 2 == 1) { if (k == 1 && m > 1) { printf( Timur n ); return 0; } for (long long a = 2; a <= sqrt(m); a++) if (m % a == 0) if ((m / a) >= k) { printf( Timur n ); return 0; } } printf( Marsel n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:33554432 ) int N, Q, cnt[3][100005]; char A[100005]; int main() { int i, j, k; scanf( %s , A + 1); N = strlen(A + 1); for (i = 1; i <= N; i++) { for (j = 0; j < 3; j++) cnt[j][i] += cnt[j][i - 1]; cnt[A[i] - x ][i]++; } for (scanf( %d , &Q); Q--;) { int c[3] = { 0, }, s, e; scanf( %d%d , &s, &e); for (i = 0; i < 3; i++) c[i] = cnt[i][e] - cnt[i][s - 1]; int mx = 0, mn = 1e9; for (i = 0; i < 3; i++) mx = max(mx, c[i]), mn = min(mn, c[i]); if (e - s + 1 < 3 || mx - mn < 2) puts( YES ); else puts( NO ); } }
|
#include <bits/stdc++.h> using namespace std; long long n, m, i, j, k, it, t; long long r[101], rr[101], c[101], cc[101]; long long a[101][101]; long long R, C, x; vector<long long> ans, ans2; int main() { cin >> n >> m; int k = 1; x = 3; while (n != 0) { if (n % 2 == 1) { k = k * x % m; } x = x * x % m; n = n / 2; } cout << (k - 1 + m) % m; return 0; }
|
#include <bits/stdc++.h> using namespace std; double pi = 3.1415926536; int main() { int n; cin >> n; int r[n]; for (int i = 0; i < n; i++) cin >> r[i]; double area = 0; sort(r, r + n); for (int i = n - 1; i >= 0; i -= 2) { if (i > 0) area += (r[i] * r[i] - r[i - 1] * r[i - 1]); else area += r[0] * r[0]; } area *= pi; printf( %0.10lf , area); return 0; }
|
#include <bits/stdc++.h> const bool DEBUG = false; using namespace std; const long long maxn = 1e5 + 2; const long long INF = 4e18; const long long M = 1e9 + 7; const int lg = 21; const int z = 256 * 256; int n, m, a[maxn], t[maxn], dp[maxn]; string s; vector<int> g[2], v[2]; bool f(vector<int>(&v), int l, int r) { if (lower_bound(v.begin(), v.end(), l) == v.end()) return 1; int l1 = lower_bound(v.begin(), v.end(), l) - v.begin(); if (lower_bound(v.begin(), v.end(), r + 1) == v.end()) return 0; int l2 = lower_bound(v.begin(), v.end(), r + 1) - v.begin(); if (l1 == l2) return 1; return 0; } bool check(int l, int r) { if (l % 2 == 0) if (f(v[1], l, r) and f(g[0], l, r)) return 1; if (l % 2 == 1) if (f(v[0], l, r) and f(g[1], l, r)) return 1; return 0; } int par(int l, int r) { if (l == 0) return a[r]; return a[r] - a[l - 1]; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> s >> m; a[0] = bool(s[0] == ? ); for (int i = 1; i < n; i++) a[i] = a[i - 1] + bool(s[i] == ? ); for (int i = 0; i < n; i++) if (s[i] == a ) v[(i % 2)].push_back(i); else if (s[i] == b ) g[(i % 2)].push_back(i); t[n - m] = check(n - m, n - 1); for (int i = n - m - 1; i >= 0; i--) { if (check(i, i + m - 1)) t[i] = 1 + t[i + m]; else t[i] = t[i + 1]; } int maxx = t[0]; if (t[n - m] == 1) dp[n - m] = par(n - m, n - 1); for (int i = n - m - 1; i >= 0; i--) { if (check(i, i + m - 1)) { dp[i] = par(i, i + m - 1) + dp[i + m]; if (t[i + 1] == t[i]) dp[i] = min(dp[i], dp[i + 1]); } else dp[i] = dp[i + 1]; } cout << dp[0] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); } const long long inf = 0x7f7f7f7f; const long long mod = 1e9 + 7; double pi = acos(-1.0); long long a[120]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m, q; cin >> n >> m >> q; long long t = GCD(n, m); n /= t; m /= t; long long x1, y1, x2, y2; for (int i = 1; i <= q; i++) { cin >> x1 >> y1 >> x2 >> y2; if (t == 1) { cout << YES << endl; continue; } long long p1, p2; if (x1 == 1) { p1 = y1 / n; if (y1 % n) p1++; } else { p1 = y1 / m; if (y1 % m) p1++; } if (x2 == 1) { p2 = y2 / n; if (y2 % n) p2++; } else { p2 = y2 / m; if (y2 % m) p2++; } if (p1 == p2) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9, maxn = 5e5 + 5, mod = 1e9 + 7; long long x[maxn], y[maxn], sz[maxn], n, m; set<long long> S; unordered_map<long long, long long> cnt, id; vector<long long> son[maxn]; long long gc(long long x) { long long ret = 0, j = 0; while (x <= n) { ret += min(x + (1 << j) - 1, n) - x + 1; x <<= 1; ++j; ret %= mod; } return ret; } void dfs(long long x) { if (S.count(x)) { cnt[x] = 1; if ((x << 1) <= n) dfs(x << 1); if ((x << 1 | 1) <= n) dfs(x << 1 | 1); } else cnt[x] = gc(x); } long long vis[maxn]; long long dfs2(long long x) { vis[x] = 1; long long ret = sz[x]; for (auto js : son[x]) if (!vis[js]) { (ret += dfs2(js)) %= mod; } vis[x] = 0; return ret; } signed main() { scanf( %lld%lld , &n, &m); if (m == 0) return printf( %lld n , 1ll * n * n % mod), 0; for (long long i = 1; i <= m; i++) { scanf( %lld%lld , &x[i], &y[i]); long long tmp = x[i]; while (tmp) { S.insert(tmp); tmp >>= 1; } tmp = y[i]; while (tmp) { S.insert(tmp); tmp >>= 1; } } S.insert(1); dfs(1); long long idc = 0; for (auto i : cnt) id[i.first] = ++idc; for (auto i : cnt) { long long u = id[i.first]; sz[u] = i.second; for (long long j = 0; j <= 1; j++) { long long v = i.first << 1 | j; if (!cnt.count(v)) continue; v = id[v]; son[u].push_back(v); son[v].push_back(u); } } for (long long i = 1; i <= m; i++) son[id[x[i]]].push_back(id[y[i]]), son[id[y[i]]].push_back(id[x[i]]); long long ans = 0; for (long long i = 1; i <= idc; i++) ans = (ans + 1ll * sz[i] * sz[i] % mod) % mod; for (long long i = 1; i <= idc; i++) { vis[i] = 1; long long cura = 0; for (auto js : son[i]) { cura = (cura + dfs2(js)) % mod; } ans = (ans + 1ll * cura * sz[i] % mod) % mod; vis[i] = 0; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> int main() { int n, a, b, c = 0; scanf( %d , &n); while (n--) { scanf( %d , &a); c += a != b; b = a; } printf( %d , c); }
|
#include <bits/stdc++.h> using namespace std; int main() { int x = 0; int n; string ch; cin >> n; for (int i = 0; i < n; i++) { cin >> ch; { if (ch[1] == + ) x++; if (ch[1] == - ) x--; } } cout << x << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 100; pair<int, int> khar[maxn]; bool mk[10 * maxn]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; mk[a] = true; khar[i] = pair<int, int>(a, b); } sort(khar, khar + n); int k = khar[n - 1].first; int x[k + 1]; fill(x, x + k + 1, 0); if (mk[0]) x[0] = 1; for (int i = 1; i <= k; i++) { if (mk[i]) x[i] += x[i - 1] + 1; else x[i] += x[i - 1]; } int h[n]; fill(h, h + n, 0); for (int i = 1; i < n; i++) { if (khar[i].first - khar[i].second <= 0) { h[i] = i; continue; } h[i] = x[khar[i].first - 1] - x[khar[i].first - khar[i].second - 1]; } int g[n]; fill(g, g + n, 0); for (int i = 1; i < n; i++) { if (khar[i].first - khar[i].second <= 0) { g[i] = i; continue; } if (h[i] == 0) g[i] = g[i - 1]; else g[i] = h[i] + g[i - h[i] - 1]; } for (int i = 0; i < n; i++) g[i] += n - i - 1; sort(g, g + n); cout << g[0] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1}; int dx[] = {-1, 1, 0, 0}; int dy[] = {0, 0, -1, 1}; class SorT { public: bool operator()(pair<int, int>& p1, pair<int, int>& p2) { return p1.second < p2.second; } }; int ans[1000010]; int main() { string s; cin >> s; int left = 0, right = s.size() - 1; for (int i = 0; i < s.size(); i++) { if (s[i] == l ) ans[right--] = i + 1; else ans[left++] = i + 1; } for (int i = 0; i < s.size(); i++) { printf( %d n , ans[i]); } }
|
#include <bits/stdc++.h> using namespace std; long long int mod = 1e9 + 7; void solve() { long long int n; cin >> n; long long int a[n]; long long int hi = 0; for (long long int i = 0; i < n; ++i) { cin >> a[i]; hi += a[i]; } sort(a, a + n); long long int ans = hi - n; if (n > 50) { cout << ans; return; } for (long long int i = 1; i < 1e9 + 1; ++i) { long long int c = i; long long int tmp = 0; long long int dig = 0; while (c > 0) { c = c / 10; dig++; } long long int no = 1; c = i; bool ex = true; for (long long int j = 0; j < n; ++j) { tmp += abs(a[j] - no); if ((no * c) > 1e14 || (no * c) < 0) { ex = false; break; } long long int digi = 0, yo = no; while (yo > 0) { yo = yo / 10; digi++; } if (digi + dig > 16) { ex = false; break; } no = no * c; } if (ex) ans = min(ans, tmp); else { break; } } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; while (t--) { solve(); } cerr << Time elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; }
|
#include <bits/stdc++.h> using namespace std; long long n, x, y; long long bs1(long long l, long long r, long long num) { long long mid = (l + r) / 2; if (r - l <= 0) { return -1; } long long time = mid * x; long long highnow = mid + ((mid * x + x - 1) / y); long long lownow = mid + ((time) / y); if (highnow >= num && lownow < num) { return mid; } if (highnow < num) { return bs1(mid + 1, r, num); } return bs1(l, mid, num); } long long bs2(long long l, long long r, long long num) { long long mid = (l + r) / 2; if (r - l <= 0) { return -1; } long long time = mid * y; long long highnow = mid + ((mid * y + y - 1) / x); long long lownow = mid + ((time) / x); if (highnow >= num && lownow < num) { return mid; } if (highnow < num) { return bs2(mid + 1, r, num); } return bs2(l, mid, num); } int main() { cin >> n >> x >> y; for (int i = 0; i < n; i++) { long long num; cin >> num; long long ansy = bs1(0, num + 1, num); long long ansx = bs2(0, num + 1, num); if (ansy == -1 && ansx == -1) { cout << Both << endl; continue; } if (ansx == -1) { cout << Vanya << endl; continue; } if (ansy == -1) { cout << Vova << endl; continue; } cout << Both << endl; } }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; const int mod = 1e9 + 7; int v[200005]; int n, k; bool guess(int x) { ll spent = x - v[n / 2]; for (int i = n / 2 + 1; i < n; i++) { spent += max(0, x - v[i]); if (spent > (ll)k) return false; } return spent <= (ll)k; } int solve() { int x = -1; for (int b = v[n - 1] + k; b >= 1; b /= 2) while (guess(x + b)) x += b; return x; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k; for (int i = 0; i < n; i++) cin >> v[i]; sort(v, v + n); cout << solve() << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 500010; const int MOD = 1000000007; int n, m, q; char s[14]; int f[(1 << 12) + 10][(1 << 12) + 10], w[13], freq[(1 << 12) + 10]; int v[(1 << 12) + 10][100 * 14]; int main() { cin >> n >> m >> q; for (int i = 0; i < n; ++i) { scanf( %d , &w[i]); } for (int i = 0; i < m; ++i) { scanf( %s , s); int val = 0; for (int j = 0; j < n; ++j) { val += (s[j] - 0 ) * (1 << j); } freq[val]++; } for (int msk = 0; msk < (1 << n); ++msk) { for (int go = 0; go < (1 << n); ++go) { for (int bit = 0; bit < n; ++bit) { f[msk][go] += (((go & (1 << bit)) == (msk & (1 << bit))) * w[bit]); } } } for (int msk = 0; msk < (1 << n); ++msk) { for (int go = 0; go < (1 << n); ++go) { v[msk][f[msk][go]] += freq[go]; } for (int j = 1; j <= 1300; ++j) { v[msk][j] += v[msk][j - 1]; } } for (int k, i = 0; i < q; ++i) { scanf( %s%d , s, &k); int cur = 0; for (int j = 0; j < n; ++j) { cur += (1 << j) * (s[j] - 0 ); } printf( %d n , v[cur][k]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100001; vector<pair<long long, int>> g[maxn]; vector<pair<long long, int>> _g[maxn]; int n, m, s, t; int u[maxn], v[maxn]; long long c[maxn]; void enter() { cin >> n >> m >> s >> t; for (int i = (0), _b = (m); i < _b; ++i) { cin >> u[i] >> v[i] >> c[i]; g[u[i]].push_back(pair<long long, int>(c[i], v[i])); _g[v[i]].push_back(pair<long long, int>(c[i], u[i])); } } const long long mod = 1000000321; long long f1[maxn]; long long c1[maxn]; long long c2[maxn]; long long f2[maxn]; bool d[maxn]; const long long oo = 1000000000000123; void dijkstra1() { for (int i = (1), _b = (n + 1); i < _b; ++i) f1[i] = oo; f1[s] = 0; c1[s] = 1; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> heap; heap.push(pair<long long, int>(0, s)); while (!heap.empty()) { pair<long long, int> q = heap.top(); heap.pop(); if (!d[q.second]) { d[q.second] = true; f1[q.second] = q.first; for (auto i : g[q.second]) if (!d[i.second]) { if (q.first + i.first < f1[i.second]) { f1[i.second] = q.first + i.first; c1[i.second] = c1[q.second]; heap.push(pair<long long, int>(f1[i.second], i.second)); } else if (q.first + i.first == f1[i.second]) { c1[i.second] += c1[q.second]; c1[i.second] = c1[i.second] % mod; } } } } } void dijkstra2() { for (int i = (1), _b = (n + 1); i < _b; ++i) { f2[i] = oo; d[i] = false; } f2[t] = 0; c2[t] = 1; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> heap; heap.push(pair<long long, int>(0, t)); while (!heap.empty()) { pair<long long, int> q = heap.top(); heap.pop(); if (!d[q.second]) { d[q.second] = true; f2[q.second] = q.first; for (auto i : _g[q.second]) if (!d[i.second]) { if (q.first + i.first < f2[i.second]) { f2[i.second] = q.first + i.first; c2[i.second] = c2[q.second]; heap.push(pair<long long, int>(f2[i.second], i.second)); } else if (q.first + i.first == f2[i.second]) { c2[i.second] += c2[q.second]; c2[i.second] = c2[i.second] % mod; } } } } } long long cnp(long long l, long long r, int i) { if (l == r) return l; else { long long mid = ((l + r) / 2) + 1; if (f1[u[i]] + f2[v[i]] + mid < f1[t]) return cnp(mid, r, i); else return cnp(l, mid - 1, i); } } void solve() { for (int i = (0), _b = (m); i < _b; ++i) { if (f1[u[i]] + c[i] + f2[v[i]] == f1[t] && (c1[u[i]] * c2[v[i]]) % mod == c1[t]) cout << YES n ; else { long long ans = cnp(0, c[i], i); if (ans == 0) cout << NO n ; else cout << CAN << c[i] - ans << n ; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(); cout.tie(); enter(); dijkstra1(); dijkstra2(); solve(); }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100, LEN = 21, M = 1 << LEN, inF = N * 30; int n, len, ps[N], dp0[N], dp1[N], mini[M][LEN]; string s[N]; void _min(int &a, int b) { a = min(a, b); } int same(string a, string b) { int A = 0, B = 0, res = 0; for (int i = 0; i < len; i++) { A |= (a[len - i - 1] - 0 ) << i; B = (B << 1) | (b[i] - 0 ); if (A == B) res = i + 1; } return res; } int dif(string a, string b) { return len - same(a, b); } void add(int dex) { _min(mini[0][0], dp1[dex] - ps[dex] + len - 0); int val = 0; for (int i = 1; i <= len; i++) val |= (s[dex - 1][len - i] - 0 ) << (i - 1), _min(mini[val][i], dp1[dex] - ps[dex] + len - i); } void find_dp() { dp0[0] = dp1[0] = len; for (int i = 1; i < n; i++) { dp0[i] = min(dp0[i - 1], dp1[i - 1]) + dif(s[i - 1], s[i]); dp1[i] = min((i == 1 ? len << 1 : dp1[i - 1] + dif(s[i - 2], s[i])), ps[i - 1] + len); int val = 0; _min(dp1[i], mini[val][0] + ps[i - 1]); for (int j = 1; j <= len; j++) val = (val << 1) | (s[i][j - 1] - 0 ), _min(dp1[i], mini[val][j] + ps[i - 1]); if (i != n - 1) add(i); } } int main() { for (int i = 0; i < M; i++) fill(mini[i], mini[i] + LEN, inF); cin >> n; for (int i = 0; i < n; i++) { cin >> s[i]; ps[i] = (i ? ps[i - 1] + dif(s[i - 1], s[i]) : len = s[i].length()); } find_dp(); cout << min(dp0[n - 1], dp1[n - 1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<int64_t>> board, vis, diag1, diag2; int main() { ios::sync_with_stdio(false), cin.tie(nullptr); int64_t n; cin >> n; for (int64_t i = 0; i < n; i++) { vector<int64_t> temp; vector<int64_t> zero; for (int64_t j = 0; j < n; j++) { int64_t t; cin >> t; temp.push_back(t); zero.push_back(0); } board.push_back(temp); vis.push_back(zero); diag1.push_back(zero); diag2.push_back(zero); } for (int64_t i = 0; i < n; i++) { for (int64_t j = 0; j < n; j++) { if (vis[i][j]) continue; int64_t t1 = i, t2 = j, s = 0; while (1) { vis[t1][t2] = 1; s += board[t1][t2]; t1 -= -1; t2 -= -1; if (t1 >= n || t2 >= n) break; } t1 = i, t2 = j; while (1) { diag1[t1][t2] = s; t1 -= -1; t2 -= -1; if (t1 >= n || t2 >= n) break; } } } for (int64_t i = 0; i < n; i++) for (int64_t j = 0; j < n; j++) vis[i][j] = 0; for (int64_t i = 0; i < n; i++) { for (int64_t j = 0; j < n; j++) { if (vis[i][j]) continue; int64_t t1 = i, t2 = j, s = 0; while (1) { vis[t1][t2] = 1; s += board[t1][t2]; t1 -= -1; t2 += -1; if (t1 >= n || t2 < 0) break; } t1 = i, t2 = j; while (1) { diag2[t1][t2] = s; t1 -= -1; t2 += -1; if (t1 >= n || t2 < 0) break; } } } int64_t m1 = 0, m2 = 0, x1 = 0, x2 = 0, y1 = 0, y2 = 0; for (int64_t i = 0; i < n; i++) { for (int64_t j = 0; j < n; j++) { int64_t tmp = diag1[i][j] + diag2[i][j] - board[i][j]; if ((i + j) % 2) { if (tmp >= m1) { m1 = tmp; x1 = i + 1; y1 = j + 1; } } else { if (tmp >= m2) { m2 = tmp; x2 = i + 1; y2 = j + 1; } } } } cout << m1 + m2 << endl; cout << x1 << << y1 << << x2 << << y2; }
|
#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void free() { freopen( A.in , r , stdin); freopen( A.out , w , stdout); } int a[100001]; int main() { boost(); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; long long ans = 1, h = a[0]; ans += h; for (int i = 1; i < n; i++) { if (a[i] >= h) ans += (a[i] - h + 1), h = a[i]; else if (a[i] < h) ans += (h - a[i] + 1), h = a[i]; ans++; } cout << ans, exit(0); }
|
#include <bits/stdc++.h> using namespace std; inline void read(long long &num) { num = 0; long long f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { num = num * 10 + c - 48; c = getchar(); } num *= f; } const long long maxn = 1e5 + 7; long long n, a[maxn], al, t; signed main() { read(n); al = 0; for (long long i = 1; i <= n; ++i) read(a[i]), al ^= a[i]; if (!(n & 1) && al) { puts( NO ); return 0; } if (!(n & 1)) --n; puts( YES ); cout << n - 1 << endl; for (long long i = 1; i <= n - 2; i += 2) cout << i << << i + 1 << << i + 2 << endl; for (long long i = 1; i <= n - 2; i += 2) cout << i << << i + 1 << << n << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int l = 1, h, i, n, x, t, q, y = -1, z = 0, a = 0, b = 0, c = 0, k, sum = 0, m, d = 0, r, w, j, ans, s, mini = INT_MAX, maxi = INT_MIN; bool cou; float kl; long long int count = 0; t = 1; vector<bool> sie(1000001, 0); char cg; string str, std; a = 1; while (t--) { cin >> n >> m; vector<int> vec(n); map<int, bool> mp; for (i = 0; i < n; ++i) cin >> vec[i]; for (i = 0; i < m; ++i) { cin >> x; mp[x] = 1; } for (i = 0; i < n; ++i) { if (mp[vec[i]]) cout << vec[i] << ; } } }
|
#include <bits/stdc++.h> #include<stdlib.h> using namespace std; #define pb push_back #define ll long long #define ff first #define ss second #define ppb pop_back #define mp make_pair #define vl vector<ll> #define vi vector<int> #define endl n #define all(x) x.begin(), x.end() #define deb(x) cout << #x << << x << endl; #define f(i, n) for(i=0; i<n; i++) #define F(i, k, n) for(i=k; i<n; i++) #define max(a,b) (a<b?b:a) #define min(a,b) (a>b?b:a) #define INF 1001001001 #define PI 3.1415926535897932384626 #define MOD 1000000007 void FAST() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } // template<typename... T> // void read(T&... args) { // FAST(); // ((cin >> args), ...); // } // template<typename... T> // void write(T&&... args) { // FAST(); // ((cout << args << ), ...); // } // template<typename T> // T gcd(T a, T b) { // if (b == 0) // return a; // return gcd(b, a % b); // } // template <typename T> // void printContainer(T &v){ // for(auto i : v){ // cout<<i<< ; // } // cout <<endl; // } int main() { FAST(); //code ll t; cin>>t; ll p; f(p,t){ string s; cin>>s; ll i, a1=0, x1=0, x2=0, a2=0,b1=0,b2=0; f(i,s.size()){ if(s[i]== ( ){ a1++; x1++; } else if(s[i]== ) && x1>0){ a2++; x1--; } else if(s[i]== [ ){ b1++; x2++; } else if(s[i]== ] && x2>0){ b2++; x2--; } } cout<<min(a1,a2)+min(b1,b2)<<endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long N = 1e5 + 5; map<long long, long long> freq, freq2; void func1(long long a[], long long n) { int i = 0, j = 0; while (i < n) { if (a[i] == 0) { i++; continue; } j = i; while (j < n && a[j] != 0) { j++; } for (int p = 1; p <= (j - i); p++) { freq[p] += (j - i) - p + 1; } i = j; } } void func2(long long a[], long long n) { int i = 0, j = 0; while (i < n) { if (a[i] == 0) { i++; continue; } j = i; while (j < n && a[j] != 0) { j++; } for (int p = 1; p <= (j - i); p++) { freq2[p] += (j - i) - p + 1; } i = j; } } int main() { long long n, a[N], b[N], r = 0, c = 0, ans = 0, cnt = 0, sum = 0, k, m; cin >> n >> m >> k; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> b[i]; func1(a, n); func2(b, m); for (int p = 1; p <= sqrt(k); p++) { if (k % p == 0) { ans += freq[p] * freq2[k / p]; if (p != (k / p)) ans += freq[k / p] * freq2[p]; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; const long long intmax = 2147483647; const long long intmin = -2147483648; const long long mod2 = 998244353; const long long mod = 1e9 + 7; const long long N = 3e5; long long fact[N]; long long add(long long a, long long b, long long p = mod) { long long res = (a % p + b % p) % p; return res; } long long sub(long long a, long long b, long long p = mod) { long long res = (a % p - b % p + p) % p; return res; } long long mul(long long a, long long b, long long p = mod) { long long res = ((a % p) * (b % p)) % p; return res; } void factorial(long long n, long long p = mod) { fact[0] = 1; for (long long i = 1; i < n; i++) { fact[i] = mul(i, fact[i - 1], p); } } long long binExp(long long x, long long y, long long p = mod) { 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 i, long long p = mod) { return binExp(i, p - 2, p); } long long ncr(long long n, long long r, long long p = mod) { if (n < r) return 0; if (r == 0) return 1; return (fact[n] * modInv(fact[r], p) % p * modInv(fact[n - r], p) % p) % p; } long long divi(long long a, long long b, long long p = mod) { long long binv = modInv(b, p); long long res = ((a % p) * (binv % p)) % p; return res; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &i : v) in >> i; return in; } template <typename T> ostream &operator<<(ostream &ost, vector<T> v) { if (&ost == &cerr) { cerr << { ; long long cnt = v.size(); for (auto x : v) { cerr << x; cnt--; if (cnt) cerr << , ; } cerr << } ; } else for (auto i : v) ost << i << ; return ost; } template <typename T> ostream &operator<<(ostream &ost, set<T> s) { if (&ost == &cerr) { cerr << { ; long long cnt = s.size(); for (auto x : s) { cerr << x; cnt--; if (cnt) cerr << , ; } cerr << } ; } else for (auto i : s) ost << i << ; return ost; } template <typename U, typename V> ostream &operator<<(ostream &ost, map<U, V> &m) { if (&ost == &cerr) { cerr << { ; long long cnt = m.size(); for (auto x : m) { cerr << x; cnt--; if (cnt) cerr << , ; } cerr << } ; } else for (auto i : m) ost << i; return ost; } template <typename U, typename V> istream &operator>>(istream &in, pair<U, V> &p) { in >> p.first >> p.second; return in; } template <typename U, typename V> ostream &operator<<(ostream &ost, pair<U, V> p) { if (&ost == &cerr) ost << { << p.first << : << p.second << } ; else ost << p.first << << p.second << ; return ost; } template <typename... T> void read(T &...args) { ((cin >> args), ...); } template <typename... T> void print(T... args) { ((cout << args << ), ...); cout << n ; } void solution() { long long ans = -1; long long n, m; read(n, m); ; vector<long long> x(n); cin >> x; vector<vector<long long> > a(n, vector<long long>(m)); for (long long i = 0; 0 <= n ? i < n : i >= n; 0 < n ? i += 1 : i -= 1) for (long long j = 0; 0 <= m ? j < m : j >= m; 0 < m ? j += 1 : j -= 1) { scanf( %1d , &a[i][j]); } vector<long long> best; for (long long mask = 0; 0 <= 1 << n ? mask < 1 << n : mask >= 1 << n; 0 < 1 << n ? mask += 1 : mask -= 1) { vector<long long> val(m); for (long long i = 0; 0 <= n ? i < n : i >= n; 0 < n ? i += 1 : i -= 1) { for (long long j = 0; 0 <= m ? j < m : j >= m; 0 < m ? j += 1 : j -= 1) { if (a[i][j]) { val[j] += ((mask >> i) & 1) ? +1 : -1; } } } vector<long long> p(m); iota(p.begin(), p.end(), 0LL); long long res = 0; for (long long i = 0; 0 <= n ? i < n : i >= n; 0 < n ? i += 1 : i -= 1) res += ((mask >> i) & 1) ? -x[i] : x[i]; sort(p.begin(), p.end(), [&](long long a, long long b) { return val[a] < val[b]; }); for (long long i = 0; 0 <= m ? i < m : i >= m; 0 < m ? i += 1 : i -= 1) { res += val[p[i]] * (i + 1); } if (res > ans) ans = res, best = p; } vector<long long> ansPerm(m); for (long long i = 0; 0 <= m ? i < m : i >= m; 0 < m ? i += 1 : i -= 1) ansPerm[best[i]] = i + 1; cout << ansPerm << n ; } signed main() { long long test = 1; cin >> test; for (long long t = 1; t <= test; t++) { solution(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, x, b, y; cin >> n >> a >> x >> b >> y; while (a != x && b != y) { if (a == b) break; a = (a % n) + 1; if (b == 1) b = n; else b--; } if (a == b) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } const int mod = 1e9 + 7; long long binpow(long long a, long long b) { long long res = 1; while (b > 0) if (b & 1) { res = (long long)(res * 1ll * a); --b; } else { a = (long long)(a * 1ll * a); b >>= 1; } return (long long)res; } vector<vector<int>> g; vector<bool> used; int pred = -1; int timer = 0; vector<int> tin, tout; void dfs(int v, int p = -1) { used[v] = true; tin[v] = timer; timer++; for (auto to : g[v]) { if (!used[to]) dfs(to); } tout[v] = timer; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int q; cin >> q; while (q--) { int n, a, b, da, db; cin >> n >> a >> b >> da >> db; vector<vector<int>> g; g.resize(n); for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; u--; v--; g[u].push_back(v); g[v].push_back(u); } if (da * 2 >= db) { cout << Alice << endl; continue; } int starta = a - 1; int startb = b - 1; vector<bool> used(n); queue<int> q; used[starta] = true; q.push(starta); vector<int> d(n); while (!q.empty()) { int v = q.front(); q.pop(); for (auto to : g[v]) { if (!used[to]) { used[to] = true; q.push(to); d[to] = d[v] + 1; } } } int ind_max = 0; int maxi = 0; for (int i = 0; i < n; i++) { if (d[i] > maxi) { maxi = d[i]; ind_max = i; } } if (abs(d[startb]) <= da) { cout << Alice << endl; continue; } used.clear(); used.resize(n); used[ind_max] = true; q.push(ind_max); d.clear(); d.resize(n); while (!q.empty()) { int v = q.front(); q.pop(); for (auto to : g[v]) { if (!used[to]) { used[to] = true; q.push(to); d[to] = d[v] + 1; } } } int ans = 0; for (int i = 0; i < n; i++) { ans = max(ans, d[i]); } if (double(ans) / da > 2.0) { cout << Bob << endl; } else { cout << Alice << endl; } } return 0; }
|
#include <bits/stdc++.h> template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans % m; } using namespace std; bool B[100], G[100]; int main() { int n, m; cin >> n >> m; int b; cin >> b; for (int(i) = (0); (i) < (b); (i)++) { int first; cin >> first; B[first] = 1; } int g; cin >> g; for (int(i) = (0); (i) < (g); (i)++) { int first; cin >> first; G[first] = 1; } for (int(i) = (0); (i) < (10000000); (i)++) B[i % n] = G[i % m] = B[i % n] | G[i % m]; bool boys = 1, girls = 1; for (int(i) = (0); (i) < (n); (i)++) boys &= B[i]; for (int(i) = (0); (i) < (m); (i)++) girls &= G[i]; if (boys && girls) cout << Yes << n ; else cout << No << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, lim; struct node { int to; int val; }; stack<int> ans; vector<node> g[5500]; int f[5500][5500]; int fa[5500][5500]; void dfs(int u, int dep) { for (int i = 0; i != g[u].size(); i++) { int& co = g[u][i].val; int& v = g[u][i].to; if (f[dep][u] + co <= lim && f[dep][u] + co < f[dep + 1][v]) { fa[v][dep] = u; f[dep + 1][v] = f[dep][u] + co; dfs(v, dep + 1); } } } int main() { scanf( %d%d%d , &n, &m, &lim); int t1, t2, t3; for (int i = 0; i != m; i++) { scanf( %d%d%d , &t1, &t2, &t3); g[t1].push_back(node{t2, t3}); } memset(f, 0x7f, sizeof(f)); f[1][1] = 0; dfs(1, 1); int i = n; while (!fa[n][i]) i--; cout << i + 1 << endl; ans.push(n); while (fa[n][i]) { ans.push(fa[n][i]); n = fa[n][i]; i--; } cout << ans.top(); ans.pop(); while (!ans.empty()) { cout << << ans.top(); ans.pop(); } cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long LINF = 334ll << 53; const int INF = 15 << 26; const long long MOD = 1E9 + 7; int main() { cin.tie(0); ios::sync_with_stdio(false); int n, q; cin >> n >> q; vector<int> t(n), s(n), d(n); priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> used; priority_queue<int, vector<int>, greater<int>> aval; for (int(i) = 0; (i) < (n); ++(i)) aval.push(i + 1); for (int(i) = 0; (i) < (q); ++(i)) { int now, s, t, ans = 0; cin >> now >> s >> t; while (!used.empty()) { if (used.top().first > now) break; aval.push(used.top().second); used.pop(); } if (aval.size() < s) { cout << -1 << endl; } else { for (int(j) = 0; (j) < (s); ++(j)) { ans += aval.top(); used.push(make_pair(now + t, aval.top())); aval.pop(); } cout << ans << endl; } } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; using ll = long long; using ld = long double; template <typename T> using mat = vector<vector<T> >; template <int mod> struct modint { int x; modint() : x(0) {} modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} modint &operator+=(const modint &p) { if ((x += p.x) >= mod) x -= mod; return *this; } modint &operator-=(const modint &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } modint &operator*=(const modint &p) { x = (int)(1LL * x * p.x % mod); return *this; } modint &operator/=(const modint &p) { *this *= p.inverse(); return *this; } modint operator-() const { return modint(-x); } modint operator+(const modint &p) const { return modint(*this) += p; } modint operator-(const modint &p) const { return modint(*this) -= p; } modint operator*(const modint &p) const { return modint(*this) *= p; } modint operator/(const modint &p) const { return modint(*this) /= p; } bool operator==(const modint &p) const { return x == p.x; } bool operator!=(const modint &p) const { return x != p.x; } modint inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return modint(u); } modint pow(int64_t n) const { modint ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; } friend istream &operator>>(istream &is, modint &a) { int64_t t; is >> t; a = modint<mod>(t); return (is); } static int get_mod() { return mod; } }; ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } template <typename T> T mypow(T x, ll n) { T ret = 1; while (n > 0) { if (n & 1) (ret *= x); (x *= x); n >>= 1; } return ret; } ll modpow(ll x, ll n, const ll mod) { ll ret = 1; while (n > 0) { if (n & 1) (ret *= x); (x *= x); n >>= 1; x %= mod; ret %= mod; } return ret; } uint64_t my_rand(void) { static uint64_t x = 88172645463325252ULL; x = x ^ (x << 13); x = x ^ (x >> 7); return x = x ^ (x << 17); } template <typename T> struct edge { int src, to; T cost; edge(int to, T cost) : src(-1), to(to), cost(cost) {} edge(int src, int to, T cost) : src(src), to(to), cost(cost) {} edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template <typename T> using Edges = vector<edge<T> >; template <typename T> using WeightedGraph = vector<Edges<T> >; using UnWeightedGraph = vector<vector<int> >; const long double eps = 0.001; const long double PI = 3.141592653589793; void solve() { ll x, y; cin >> x >> y; if (x > y) swap(x, y); ll a, b; cin >> a >> b; if (a * 2 > b) { cout << x * b + (y - x) * a << endl; } else { cout << (x + y) * a << endl; } } int main() { cin.tie(0); ios::sync_with_stdio(0); cout << setprecision(20); int t; cin >> t; for (int _ = (0), max_i = (t); _ < max_i; _++) { solve(); } }
|
#include <bits/stdc++.h> const int mod = 998244353; using namespace std; inline int read() { int f = 1, x = 0; char s = getchar(); while (!isdigit(s)) { if (s == - ) f = -1; s = getchar(); } while (isdigit(s)) { x = (x << 1) + (x << 3) + (s ^ 48), s = getchar(); } return x * f; } int n, a[500100], is[500100], prime[500100], tot, ans1[500100], ans2[500100]; inline void init(void) { for (int i = 2; i <= 4000; i++) { if (!is[i]) prime[++tot] = i; for (int j = 1; j <= tot && i * prime[j] <= 4000; j++) { is[i * prime[j]] = 1; if (i % prime[j] == 0) break; } } } inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } signed main(void) { n = read(); init(); for (int i = 1; i <= n; i++) { ans1[i] = ans2[i] = -1; a[i] = read(); int t = a[i]; for (int j = 1; j <= tot; j++) { int mul = 1; while (t % prime[j] == 0) t /= prime[j], mul *= prime[j]; if (mul != 1 && a[i] / mul != 1) ans1[i] = mul, ans2[i] = a[i] / mul; } if (t != 1 && a[i] / t != 1) ans1[i] = t, ans2[i] = a[i] / t; } for (int i = 1; i <= n; i++) printf( %d , ans1[i]); puts( ); for (int i = 1; i <= n; i++) printf( %d , ans2[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { string name; int version; }; int main(void) { int n; cin >> n; map<pair<string, int>, vector<pair<string, int> > > m; pair<string, int> init; for (int i = 0; i < n; i++) { pair<string, int> cur; cin >> cur.first >> cur.second; cur.second *= -1; if (i == 0) init = cur; int k; cin >> k; for (int j = 0; j < k; j++) { pair<string, int> node; cin >> node.first >> node.second; node.second *= -1; m[cur].push_back(node); } } set<string> names; set<pair<string, int> > ans; set<pair<string, int> > layer; names.insert(init.first); layer.insert(init); while (!layer.empty()) { set<pair<string, int> > new_layer; for (set<pair<string, int> >::iterator it = layer.begin(); it != layer.end(); it++) { for (int k = 0; k < m[*it].size(); k++) { new_layer.insert(m[*it][k]); } } layer.clear(); for (set<pair<string, int> >::iterator it = new_layer.begin(); it != new_layer.end(); it++) { if (names.find(it->first) != names.end()) continue; names.insert(it->first); ans.insert(*it); layer.insert(*it); } } cout << ans.size() << endl; for (set<pair<string, int> >::iterator it = ans.begin(); it != ans.end(); it++) { cout << it->first << << -it->second << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, l = -1, j, p, m; long k; cin >> n >> k; long long a[k]; for (long i = 0; i < k; i++) { cin >> a[i]; j = n / a[i]; if ((j * a[i]) > l) { l = j * a[i]; p = i + 1; m = j; } } cout << p << << m << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? : ); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << ( << p.first << , << p.second << ) ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << { ; for (auto itr = m.begin(); itr != m.end();) { os << ( << itr->first << , << itr->second << ) ; if (++itr != m.end()) os << , ; } os << } ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << { ; for (auto itr = m.begin(); itr != m.end();) { os << ( << itr->first << , << itr->second << ) ; if (++itr != m.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? : ); } return os; } template <int i, typename T> void print_tuple(ostream&, const T&) {} template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << , ; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << { ; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << } ; } void debug_out() { cerr << n ; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << , ; debug_out(move(tail)...); } template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(signed t) { return __builtin_popcount(t); } int popcount(long long t) { return __builtin_popcountll(t); } bool ispow2(int i) { return i && (i & -i) == i; } template <class T> T ceil(T x, T y) { assert(y >= 1); return (x > 0 ? (x + y - 1) / y : x / y); } template <class T> T floor(T x, T y) { assert(y >= 1); return (x > 0 ? x / y : (x - y + 1) / y); } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = { D , R , U , L }; const long long MOD = 1000000007; const int MAX_X = 2010; void solve() { int n; cin >> n; vector<int> dp(MAX_X, INF), ndp(MAX_X, INF); dp[0] = 0; for (; n--;) { int a; cin >> a; for (int i = 0; i < MAX_X; i++) { if (dp[i] == INF) continue; if (i + a < MAX_X) chmin(ndp[i + a], max(0, dp[i] - a)); chmin(ndp[max(0, i - a)], dp[i] + a); dp[i] = INF; } swap(dp, ndp); } int ans = INF; for (int i = 0; i < MAX_X; i++) chmin(ans, i + dp[i]); cout << ans << n ; } int main() { cin.tie(0); ios::sync_with_stdio(false); int t; cin >> t; for (; t--;) solve(); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; int n, m, ans, flag; bool vis[10]; string fac[7] = { 1869 , 1968 , 1689 , 6198 , 8691 , 8916 , 1896 }; string s, ss, anss, xx = 0000 ; int main() { int i, j, t, pos, x, y, u, v, w; while (cin >> s) { memset(vis, 0, sizeof(vis)); ss = ; for (i = 0; i < s.length(); i++) { if (s[i] == 1 ) { if (!vis[1]) vis[1] = 1; else ss += s[i]; } else if (s[i] == 6 ) { if (!vis[6]) vis[6] = 1; else ss += s[i]; } else if (s[i] == 8 ) { if (!vis[8]) vis[8] = 1; else ss += s[i]; } else if (s[i] == 9 ) { if (!vis[9]) vis[9] = 1; else ss += s[i]; } else ss += s[i]; } flag = 0; for (i = 0; i < ss.length(); i++) { if (ss[i] != 0 ) { flag = 1; char c = ss[i]; ss[i] = ss[0]; ss[0] = c; } } if (!flag) { cout << 1869 << ss << endl; } else { t = 0; for (i = 0; i < ss.length(); i++) { t = (t * 10 + ss[i] - 0 ) % 7; } for (i = 0; i < 4; i++) { t = (t * 10 + xx[i] - 0 ) % 7; } if (t) t = 7 - t; cout << ss << fac[t] << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int MN = 1 << 8; int exp(int x, int n) { int ret = 1; while (n) { if (n & 1) ret = 1LL * ret * x % mod; x = 1LL * x * x % mod; n >>= 1; } return ret; } int inv(int x) { return exp(x, mod - 2); } int fact[MN], invf[MN]; int comb(int n, int k) { return 1LL * fact[n] * invf[k] % mod * invf[n - k] % mod; } int fa[MN]; void init() { for (int i = 0; i < MN; i++) fa[i] = i; } int find(int u) { if (fa[u] == u) return u; else return fa[u] = find(fa[u]); } void mrg(int u, int v) { u = find(u); v = find(v); if (u == v) return; fa[v] = u; } int cc[MN][MN]; int dp(int n, int k) { int &ret = cc[n][k]; if (ret != -1) return ret; if (k == 0) return ret = n == 0; ret = 0; for (int i = 1; i <= n; i++) { ret += 1LL * comb(n - 1, i - 1) * fact[i - 1] % mod * dp(n - i, k - 1) % mod; ret %= mod; } return ret; } int N; int A[MN], B[MN], del[MN], chk[MN], tcnt[3], ans[MN]; int main() { fact[0] = 1; for (int i = 1; i < MN; i++) { fact[i] = 1LL * fact[i - 1] * i % mod; } for (int i = 0; i < MN; i++) { invf[i] = inv(fact[i]); } memset(cc, -1, sizeof(cc)); scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %d , &A[i]); A[i]--; } for (int i = 0; i < N; i++) { scanf( %d , &B[i]); B[i]--; } int ccnt = 0; init(); for (int i = 0; i < N; i++) { if (A[i] != -1 && B[i] != -1) { if (find(A[i]) == find(B[i])) { del[find(A[i])] = 1; ccnt++; } else mrg(A[i], B[i]); } } vector<int> V; for (int i = 0; i < N; i++) if (!del[i] && fa[i] == i) V.push_back(i); if (V.size() == 0) { for (int i = 0; i < N; i++) { printf( %d , (N - i == ccnt)); } return 0; } for (int i = 0; i < N; i++) { if (A[i] != -1 && B[i] == -1) { chk[find(A[i])] |= 1; } if (A[i] == -1 && B[i] != -1) { chk[find(B[i])] |= 2; } } for (int i = 0; i < V.size(); i++) { tcnt[chk[V[i]]]++; } for (int i = 1; i <= (int)V.size() - tcnt[3]; i++) { int tmp = 0; for (int j = 0; j <= min(tcnt[1], tcnt[2]); j++) { if (j % 2) tmp += mod - 1LL * comb(tcnt[1], j) * comb(tcnt[2], j) % mod * fact[j] % mod * dp((int)V.size() - tcnt[3] - j, i) % mod; else tmp += 1LL * comb(tcnt[1], j) * comb(tcnt[2], j) % mod * fact[j] % mod * dp((int)V.size() - tcnt[3] - j, i) % mod; tmp %= mod; } ans[ccnt + i] = tmp; } for (int i = 0; i < N; i++) { printf( %d , 1LL * ans[N - i] * fact[tcnt[0]] % mod); } }
|
#include <bits/stdc++.h> using namespace std; int zero(int n) { if (n == 0) return 0; if (n % 10 == 0) return zero(n / 10); return 10 * zero(n / 10) + (n % 10); } int main() { int a, b; cin >> a >> b; if (zero(a) + zero(b) == zero(a + b)) { cout << YES ; } else { cout << NO ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); } template <class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } struct MaxFlow { struct edge { int to, cap, rev; }; vector<int> dist, it; vector<vector<edge>> g; MaxFlow(int n) : g(n), dist(n), it(n) {} void add(int u, int v, int c) { g[u].push_back({v, c, (int)g[v].size()}); g[v].push_back({u, 0, (int)g[u].size() - 1}); } int calc(int s, int t) { int res = 0; while (bfs(s, t)) { fill(it.begin(), it.end(), 0); while (int f = dfs(s, t, 1e9)) res += f; } return res; } bool bfs(int s, int t) { fill(dist.begin(), dist.end(), -1); queue<int> q; q.push(s); dist[s] = 0; while (!q.empty()) { int v = q.front(); q.pop(); for (edge e : g[v]) if (e.cap > 0 && dist[e.to] < 0) { dist[e.to] = dist[v] + 1; q.push(e.to); } } return dist[t] >= 0; } int dfs(int v, int t, int f) { if (v == t) return f; for (int &i = it[v]; i < g[v].size(); i++) { edge &e = g[v][i]; if (e.cap > 0 && dist[v] < dist[e.to]) { if (int d = dfs(e.to, t, min(f, e.cap))) { e.cap -= d; g[e.to][e.rev].cap += d; return d; } } } return 0; } }; template <class T1, class T2> void sortPair(vector<T1> &v1, vector<T2> &v2) { vector<pair<T1, T2>> u(v1.size()); for (int i = 0; i < u.size(); i++) u[i] = make_pair(v1[i], v2[i]); sort(u.begin(), u.end()); for (int i = 0; i < u.size(); i++) tie(v1[i], v2[i]) = u[i]; } bool solve() { int n, b, q; cin >> n >> b >> q; vector<int> u(q), v(q); for (int i = 0; i < (q); i++) scanf( %d %d , &u[i], &v[i]); u.push_back(b); v.push_back(n); q++; sortPair(u, v); for (int i = 0; i < (q - 1); i++) if (v[i] > v[i + 1]) return false; static int sum[10101][5]; for (int i = 0; i < (10101); i++) sum[i][i % 5]++; for (int i = (1); i < (10101); i++) for (int j = 0; j < (5); j++) sum[i][j] += sum[i - 1][j]; int lowSum = 0, highSum = 0; MaxFlow mf(q + q * 5 + 5 + 2); int src = q + q * 5 + 5; int dst = src + 1; int prevU = 0; int prevV = 0; for (int mod = 0; mod < (5); mod++) mf.add(q + q * 5 + mod, dst, n / 5); for (int i = 0; i < (q); i++) { int mustUse = v[i] - prevV; int num = u[i] - prevU; mf.add(src, i, mustUse); for (int mod = 0; mod < (5); mod++) { int mm = sum[u[i]][mod] - sum[prevU][mod]; mf.add(i, q + i * 5 + mod, mm); mf.add(q + i * 5 + mod, q + q * 5 + mod, mm); } prevU = u[i]; prevV = v[i]; } return mf.calc(src, dst) == n; } int main() { cout << (solve() ? fair : unfair ) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char a[15], b[15]; while (cin >> a >> b) { int len_a = strlen(a); sort(a, a + len_a); int k = 0; for (int i = 0; i < len_a; i++) { if (a[i] != 0 ) { k = i; break; } } char tmp; tmp = a[0]; a[0] = a[k]; a[k] = tmp; if (strcmp(a, b) == 0) cout << OK << endl; else cout << WRONG_ANSWER << endl; } return 0; }
|
#include <bits/stdc++.h> const int oo = 0x3f3f3f3f, mod = 1e9 + 7; using namespace std; int dx[]{1, -1, 0, 0, 1, 1, -1, -1}; int dy[]{0, 0, 1, -1, 1, -1, 1, -1}; long long OO = (1LL * oo * oo); void K_K() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { K_K(); long long n, mx = 0, mxidx = 0; cin >> n; map<long long, long long> mp; vector<long long> v(n + 2); vector<pair<long long, pair<long long, long long>>> ans; for (int i = 1; i <= n; i++) { cin >> v[i], mp[v[i]]++; if (mp[v[i]] > mx) mxidx = i, mx = mp[v[i]]; } for (int i = mxidx - 1; i > 0; i--) { if (v[i] > v[i + 1]) { v[i] -= abs(v[i] - v[i + 1]); ans.push_back({2, {i, i + 1}}); } else if (v[i] < v[i + 1]) { ans.push_back({1, {i, i + 1}}); v[i] += abs(v[i] - v[i + 1]); } } for (int i = mxidx + 1; i <= n; i++) { if (v[i] > v[i - 1]) { v[i] -= abs(v[i] - v[i - 1]); ans.push_back({2, {i, i - 1}}); } else if (v[i] < v[i - 1]) { ans.push_back({1, {i, i - 1}}); v[i] += abs(v[i] - v[i - 1]); } } cout << (int)(ans.size()) << n ; for (int i = 0; i < (int)(ans.size()); i++) cout << ans[i].first << << ans[i].second.first << << ans[i].second.second << n ; }
|
#include <bits/stdc++.h> using namespace std; int a, b, c; unsigned long ans = 0; unordered_map<int, int> um; void eval(int x) { int t = 0; for (int i = 1; i <= sqrt(x); ++i) { if (i * i == x) t += 1; else if (x % i == 0) t += 2; } ans += t; um[x] = t; } int main() { cin >> a >> b >> c; for (int i = 1; i <= a; ++i) { for (int j = 1; j <= b; ++j) { for (int k = 1; k <= c; ++k) { if (um.find(i * j * k) != um.end()) ans = (ans + um[i * j * k]) % 1073741824LL; else eval(i * j * k); } } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int64_t M = 1000000007; const int64_t MM = 998244353; template <typename T, typename U> static inline void amin(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static inline void amax(T &x, U y) { if (x < y) x = y; } int64_t _runtimeTerror_() { int64_t n; cin >> n; string s; cin >> s; vector<long long> d_cnt(n + 1, 0), d_sum(n + 1), u_cnt(n + 1), u_sum(n + 1, 0); for (int64_t i = 1; i <= n; ++i) { u_cnt[i] = u_cnt[i - 1]; u_sum[i] = u_sum[i - 1]; d_cnt[i] = d_cnt[i - 1]; d_sum[i] = d_sum[i - 1]; if (s[i - 1] == D ) { d_cnt[i] += 1; d_sum[i] += i; } else { u_cnt[i] += 1; u_sum[i] += i; } } for (int64_t i = 1; i <= n; ++i) { int64_t ans = 0; if (s[i - 1] == U ) { int64_t r_d = d_cnt[n] - d_cnt[i]; int64_t l_u = u_cnt[i - 1]; if (r_d > l_u) { auto it = lower_bound(d_cnt.begin(), d_cnt.end(), d_cnt[i] + l_u + 1) - d_cnt.begin(); ans += (d_sum[it] - d_sum[i] - (i * (l_u + 1))) * 2; ans -= (u_sum[i - 1]) * 2; ans += l_u * i * 2; ans += i; } else { ans += (d_sum[n] - d_sum[i] - (d_cnt[n] - d_cnt[i]) * i) * 2; ans += (n - i + 1); auto it = lower_bound(u_cnt.begin(), u_cnt.end(), u_cnt[i - 1] - r_d + 1) - u_cnt.begin(); ans -= (u_sum[i - 1] - u_sum[it - 1]) * 2; ans += (r_d * i) * 2; } cout << ans << ; } else { int64_t r_d = d_cnt[n] - d_cnt[i]; int64_t l_u = u_cnt[i - 1]; if (r_d >= l_u) { auto it = lower_bound(d_cnt.begin(), d_cnt.end(), d_cnt[i] + l_u) - d_cnt.begin(); ans += (d_sum[it] - d_sum[i] - (i * (l_u))) * 2; ans -= (u_sum[i - 1]) * 2; ans += l_u * i * 2; ans += i; } else { ans += (d_sum[n] - d_sum[i] - (d_cnt[n] - d_cnt[i]) * i) * 2; ans += (n - i + 1); auto it = lower_bound(u_cnt.begin(), u_cnt.end(), u_cnt[i - 1] - r_d) - u_cnt.begin(); ans -= (u_sum[i - 1] - u_sum[it - 1]) * 2; ans += ((r_d + 1) * i) * 2; } cout << ans << ; } } return 0; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int64_t TESTS = 1; while (TESTS--) _runtimeTerror_(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; string s; int x; cin >> n >> m >> k; int a[n][m]; int b[n][m]; int c[n][m]; for (int i = 0; i < n; i++) { cin >> s; for (int j = 0; j < m; j++) { cin >> x; a[i][j] = x; cin >> x; b[i][j] = x; cin >> x; c[i][j] = x; } } int sum_max = 0; int sum; vector<pair<int, int> > abc; abc.reserve(m); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i == j) continue; sum = 0; abc.clear(); for (int ii = 0; ii < m; ii++) { abc.push_back(make_pair(b[j][ii] - a[i][ii], c[i][ii])); } sort(abc.begin(), abc.end()); int left = k; for (int ii = m - 1; ii >= 0 && left > 0; ii--) { int d = min(left, abc[ii].second); if (abc[ii].first > 0) { sum += d * abc[ii].first; left -= d; } } if (sum > sum_max) { sum_max = sum; } } } cout << sum_max << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 7; const int M = N * 3; const int inf = 1e9 + 7; const int base = 1e9 + 9; const double pi = acos(-1); const double ep = 1e-11; pair<pair<int, int>, int> p[N]; int n; int vp, vs; int sqr(int x) { return x * x; } double sqr(double x) { return x * x; } int dist(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { return sqr(a.first.first - b.first.first) + sqr(a.first.second - b.first.second) + sqr(a.second - b.second); } pair<pair<double, double>, double> curr(double t) { for (int i = 1; i <= n; i++) { double d = sqrt(dist(p[i - 1], p[i])) + ep; if (d >= t * vs) { pair<pair<double, double>, double> tmp; tmp.first.first = t * vs * (p[i].first.first - p[i - 1].first.first) / d + p[i - 1].first.first; tmp.first.second = t * vs * (p[i].first.second - p[i - 1].first.second) / d + p[i - 1].first.second; tmp.second = t * vs * (p[i].second - p[i - 1].second) / d + p[i - 1].second; return tmp; } else { t -= d / vs; } } return make_pair(make_pair(0, 0), 0); } int main() { cin >> n; double t = 0; for (int i = (int)0; i < (int)n + 1; i++) { int u, v, c; cin >> u >> v >> c; p[i] = make_pair(make_pair(u, v), c); } cin >> vp >> vs; { cin >> p[n + 1].first.first >> p[n + 1].first.second >> p[n + 1].second; } for (int i = (int)1; i < (int)n + 1; i++) t += sqrt(dist(p[i - 1], p[i])) / vs; if (dist(p[n], p[n + 1]) > t * t * vp * vp + ep) { cout << NO ; return 0; } cout << YES n ; double lo = 0, hi = t + ep, g, res = -1; pair<pair<double, double>, double> ans = curr(35); do { g = (lo + hi) / 2; pair<pair<double, double>, double> tmp = curr(g); double di = sqr(p[n + 1].first.first - tmp.first.first) + sqr(p[n + 1].first.second - tmp.first.second) + sqr(p[n + 1].second - tmp.second); ans = tmp; res = g; if (di <= sqr(g) * sqr(vp) + ep) { res = g; hi = g - ep; } else lo = g + ep; } while (lo + ep < hi); printf( %.9lf n , res); printf( %.9lf %.9lf %.9lf , ans.first.first, ans.first.second, ans.second); }
|
#include <bits/stdc++.h> using namespace std; const int N = 300010; int sufp[N], freq[N][2]; int mi = 0, ma = 0, par = 0; void add(int x) { if (x >= mi and x <= ma) { if (x % 2 == par) mi = 0; else mi = 1; } else if (x > ma) { mi = x - ma; } else { mi = mi - x; } if (x % 2) par = 1 - par; ma += x; } void reset() { mi = ma = par = 0; } int main() { int n; scanf( %d , &n); vector<int> v, p; for (int i = 0; i < n; i++) { long long x; scanf( %lld , &x); v.push_back(__builtin_popcountll(x)); p.push_back(v.back() % 2); } for (int i = n - 1; i >= 0; i--) { sufp[i] = p[i]; if (i + 1 < n) sufp[i] ^= sufp[i + 1]; } for (int i = 0; i < n; i++) { freq[i][0] += sufp[i] == 0; freq[i][1] += sufp[i] == 1; if (i) { freq[i][0] += freq[i - 1][0]; freq[i][1] += freq[i - 1][1]; } } long long ans = 0; for (int i = 0; i < n; i++) { int pos = i; reset(); while (pos >= 0 and (mi > 1 or ma < 60)) { add(v[pos]); if (mi == 0) ans++; pos--; } if (pos < 0) continue; int base = sufp[pos + 1]; ans += freq[pos][par ^ base]; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; set<string> ans; string a; int dp[1000010][5]; int main() { cin >> a; int len = a.size(); reverse(a.begin(), a.end()); for (int i = 1; i < len - 5; ++i) { if (i == 1) { string s1 = ; s1 += a[i]; s1 += a[i - 1]; ans.insert(s1); dp[1][0] = 1; } if (i == 2) { string s1 = ; s1 += a[i]; s1 += a[i - 1]; s1 += a[i - 2]; ans.insert(s1); dp[2][1] = 1; } if (i >= 3 && (a[i] != a[i - 2] || a[i - 1] != a[i - 3]) && dp[i - 2][0] == 1) { string s1 = ; s1 += a[i]; s1 += a[i - 1]; ans.insert(s1); dp[i][0] = 1; } if (i >= 2 && dp[i - 2][1] == 1) { string s1 = ; s1 += a[i]; s1 += a[i - 1]; ans.insert(s1); dp[i][0] = 1; } if (i - 3 >= 0 && dp[i - 3][0] == 1) { string s1 = ; s1 += a[i]; s1 += a[i - 1]; s1 += a[i - 2]; ans.insert(s1); dp[i][1] = 1; } if (i - 5 >= 0 && (a[i] != a[i - 3] || a[i - 1] != a[i - 4] || a[i - 2] != a[i - 5]) && dp[i - 3][1] == 1) { string s1 = ; s1 += a[i]; s1 += a[i - 1]; s1 += a[i - 2]; ans.insert(s1); dp[i][1] = 1; } } cout << ans.size() << endl; for (set<string>::iterator it = ans.begin(); it != ans.end(); ++it) { cout << *it << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k; string s; int main() { cin >> n >> k >> s; --k; if (k < n - 1 - k) { while (k) { cout << LEFT << endl; --k; } for (int i = 0; i < n; ++i) { if (i) cout << RIGHT << endl; cout << PRINT << s[i] << endl; } } else { while (k < n - 1) { cout << RIGHT << endl; ++k; } for (int i = 0; i < n; ++i) { if (i) cout << LEFT << endl; cout << PRINT << s[n - 1 - i] << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long upper_limit = 1e9; long long lower_limit = -1e9; int n; cin >> n; for (int i = 0; i < n; i++) { int c, d; cin >> c >> d; if (d == 2) { upper_limit = min(upper_limit, 1899LL); } else { lower_limit = max(lower_limit, 1900LL); } lower_limit += c; upper_limit += c; } if (upper_limit < lower_limit) { cout << Impossible ; } else if (upper_limit > 1e8) { cout << Infinity ; } else { cout << upper_limit; } }
|
#include <bits/stdc++.h> using namespace std; const int pi = 3.14159265; const int INF = 1 << 30; const int maxn = 1e5; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, k; string s; cin >> n >> k; cin >> s; int t = s.find( T ); int g = s.find( G ); if (g > t) swap(t, g); for (int i = g; i < n && i <= t; i += k) { if (s[i] == # ) { cout << NO << endl; return 0; } if (i == t) { cout << YES << endl; return 0; } } cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int n, x[5000 + 5], y[5000 + 5], tot; int color[5000 + 5]; bool flag; int ksm(int b, int k) { int s = 1; while (k > 0) { if (k & 1) s = (1ll * s * b) % mod; k >>= 1; b = (1ll * b * b) % mod; } return s % mod; } int dis(int id1, int id2) { return abs(x[id1] - x[id2]) + abs(y[id1] - y[id2]); } void clearall() { flag = true; tot = 0; memset(color, 0, sizeof(color)); } void dfs(int u, int lim) { if (flag) { for (int i = 1; i <= n; i++) { if (flag) { if (u == i || dis(u, i) <= lim) continue; if (!color[i]) { color[i] = color[u] ^ 1; dfs(i, lim); } else { if (color[i] != color[u]) continue; flag = false; return; } } } } } bool check(int lim) { int i, j; clearall(); for (i = 1; i <= n; i++) if (!color[i]) { tot++; color[i] = 2; dfs(i, lim); if (!flag) break; } return flag; } int main() { int i, ans = -1; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d%d , &x[i], &y[i]); int l = 0, r = 10000; while (l < r - 5) { int mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } for (i = l; i <= r; i++) if (check(i)) { ans = i; break; } printf( %d n , ans); printf( %d n , ksm(2, tot)); }
|
#include <bits/stdc++.h> using namespace std; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, -1, 1}; void arquivo() { freopen( , r , stdin); freopen( , w , stdout); } const int N = 5000100; int n; long long a, b; int v[N]; bool memo[N][3]; long long pd[N][3]; int atPrime; long long func(int pos, int op) { if (pos == n) return 0LL; if (memo[pos][op]) return pd[pos][op]; long long ret = 1000000000000000001LL; if (!op) { ret = func(pos + 1, 1) + a; if (v[pos] % atPrime == 0) ret = min(ret, func(pos + 1, 0)); if ((v[pos] + 1) % atPrime == 0) ret = min(ret, func(pos + 1, 0) + b); if ((v[pos] - 1) % atPrime == 0) ret = min(ret, func(pos + 1, 0) + b); } else if (op == 1) { ret = func(pos + 1, 1) + a; if (v[pos] % atPrime == 0) ret = min(ret, func(pos + 1, 2)); if ((v[pos] + 1) % atPrime == 0) ret = min(ret, func(pos + 1, 2) + b); if ((v[pos] - 1) % atPrime == 0) ret = min(ret, func(pos + 1, 2) + b); } else { if (v[pos] % atPrime == 0) ret = min(ret, func(pos + 1, 2)); if ((v[pos] + 1) % atPrime == 0) ret = min(ret, func(pos + 1, 2) + b); if ((v[pos] - 1) % atPrime == 0) ret = min(ret, func(pos + 1, 2) + b); } memo[pos][op] = 1; return pd[pos][op] = ret; } void fatora(long long x, set<int> &all) { for (long long i = 2; i * i <= x; ++i) { if (x % i == 0) { all.insert(i); while (x % i == 0) x /= i; } } if (x > 1) all.insert(x); } int main() { scanf( %d %lld %lld , &n, &a, &b); set<int> all; long long x; for (int i = 0; i < n; ++i) { scanf( %d , v + i); } for (int i = 0; i < 1; ++i) { x = v[i]; fatora(x, all); x = v[i] + 1; fatora(x, all); x = v[i] - 1; fatora(x, all); } for (int i = n - 1; i < n; ++i) { x = v[i]; fatora(x, all); x = v[i] + 1; fatora(x, all); x = v[i] - 1; fatora(x, all); } long long ans = (long long)(n - 1LL) * a; for (set<int>::iterator it = all.begin(); it != all.end(); it++) { atPrime = *it; if (atPrime == 1) continue; memset(memo, 0, sizeof memo); for (int j = n - 1; j >= 0; --j) { func(j, 0); func(j, 1); func(j, 2); } ans = min(ans, func(0, 0)); } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans % m; } int main() { string s; cin >> s; int n; cin >> n; int from[n]; char s1, s2; string to[n]; long long a[10], b[10]; for (int i = 0; i < n; i++) { cin >> from[i] >> to[i]; } for (int i = 0; i < n; i++) { to[i] = to[i].substr(2); } for (int i = 0; i < 10; i++) { a[i] = 10; b[i] = i; } for (int i = n - 1; i >= 0; i--) { long long p = 1, q = 0; for (int j = 0; j < to[i].length(); j++) { int c = to[i][j] - 0 ; long long p2 = (a[c] * p) % 1000000007; long long q2 = (a[c] * q + b[c]) % 1000000007; p = p2; q = q2; } a[from[i]] = p; b[from[i]] = q; } long long ans = 0; for (int i = 0; i < s.length(); i++) { int c = s[i] - 0 ; ans = (ans * a[c] + b[c]) % 1000000007; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int32_t M = 1e9 + 7; int32_t mod_inv(int32_t a, int32_t m) { int32_t g = m, r = a, x = 0, y = 1; while (r != 0) { int32_t q = g / r; g %= r; swap(g, r); x -= q * y; swap(x, y); } return x < 0 ? x + m : x; } int gcdi(int a, int b) { if (b == 0) { return a; } return gcdi(b, a % b); } long long gcdl(long long a, long long b) { if (b == 0) { return a; } return gcdl(b, a % b); } long long lcm(long long a, long long b) { return (a / gcdl(a, b)) * b; } int factorial(int n) { if (n == 0) return 1; return n * factorial(n - 1); } 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; } void FAST() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void swap_ll(long long *a, long long *b) { long long c; c = *a; *a = *b; *b = c; } void swap_int(int *a, int *b) { int c; c = *a; *a = *b; *b = c; } void swap_char(char *a, char *b) { char c; c = *a; *a = *b; *b = c; } bool mycomp(pair<int, int> &a, pair<int, int> &b) { if (a.first == b.first) return a.second < b.second; return a.first < b.first; } long long fast_pow(long long a, long long p) { long long res = 1; while (p) { if (p % 2 == 0) { a = a * 1ll * a % 000000007; p /= 2; } else { res = res * 1ll * a % 000000007; p--; } } return res; } long long fact(long long n) { long long res = 1; for (long long i = 1; i <= n; i++) { res = res * 1ll * i % 000000007; } return res; } long long nCk(long long n, long long k) { return fact(n) * 1ll * fast_pow(fact(k), 000000007 - 2) % 000000007 * 1ll * fast_pow(fact(n - k), 000000007 - 2) % 000000007; } long long firstDigit(long long n) { long long digits = (long long)log10(n); n = (long long)(n / pow(10, digits)); return n; } long long find(long long n, long long d) { while (n > 0) { if (n % 10 == d) return 1; n /= 10; } return 0; } struct node { int data; node *next; node(int d) { data = d; next = NULL; } }; void ffin() { FAST(); } long long add(vector<long long> a, long long b, long long e) { long long sum = 0; for (long long i = b; i < e; i++) { sum += a[i]; } return sum; } void decToBinary(int n) { int binaryNum[32]; int i = 0; while (n > 0) { binaryNum[i] = n % 2; n = n / 2; i++; } for (int j = i - 1; j >= 0; j--) cout << binaryNum[j]; } bool isInteger(double N) { int X = N; double temp2 = N - X; if (temp2 > 0) { return false; } return true; } bool check(vector<int> &v) { int n = (int)((v).size()); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { for (int k = j + 1; k < n; k++) { if ((v[i] >= v[j] && v[j] >= v[k]) || (v[i] <= v[j] && v[j] <= v[k])) { return true; } } } } return false; } bool digitscheck(long long n) { while (n != 0) { long long y = n % 10; if (y != 0 and y != 1) { return false; } n = n / 10; } return true; } const long long N = 5e+5; long long a[N][5]; long long better(long long i, long long j) { long long cnt = 0; for (int k = 0; k < 5; k++) { cnt += (a[i][k] < a[j][k]); } return (cnt >= 3); } void solve() { long long n; cin >> n; for (int i = 0; i < n; i++) for (int j = 0; j < 5; j++) cin >> a[i][j]; long long best = 0; for (int i = 1; i < n; i++) { if (better(i, best)) best = i; } bool ok = true; for (int i = 0; i < n; i++) { if (i == best) continue; ok &= better(best, i); } if (!ok) best = -2; cout << best + 1 << n ; } int main() { ffin(); long long tests = 1; cin >> tests; while (tests--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1E5 + 5; long long m, n, k, alice[MAXN], bob[MAXN]; bool cmp(int x, int y) { return x > y; } int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) cin >> alice[i]; for (int i = 0; i < m; i++) cin >> bob[i]; if (n > m) { cout << YES << endl; return 0; } sort(alice, alice + n, cmp); sort(bob, bob + m, cmp); for (int i = 0; i < n; i++) { if (alice[i] > bob[i]) { cout << YES << endl; return 0; } } cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i; scanf( %d , &n); long long int a[n]; set<long long int> x; map<long long int, set<int> > m; for (i = 0; i < n; i++) { scanf( %lld , &a[i]); x.insert(a[i]); m[a[i]].insert(i); } while (!x.empty()) { long long int j = *x.begin(); if (m[j].size() >= 2) { m[j].erase(m[j].begin()); int k = *(m[j].begin()); m[j].erase(m[j].begin()); m[2 * j].insert(k); x.insert(2 * j); } else { x.erase(x.begin()); } } vector<pair<int, long long int> > ans; map<long long int, set<int> >::iterator it; for (it = m.begin(); it != m.end(); it++) { if ((it->second).size() == 1) { ans.push_back(make_pair(*(it->second).begin(), it->first)); } } sort(ans.begin(), ans.end()); cout << ans.size() << endl; for (i = 0; i < ans.size(); i++) { printf( %lld , ans[i].second); } printf( n ); }
|
#include <bits/stdc++.h> using namespace std; template <typename T> using min_queue = priority_queue<T, vector<T>, greater<T>>; const long long MOD = 1e9 + 7; int N; int cnt[6]; int res[100100]; vector<int> v[6]; int main() { ios::sync_with_stdio(0); cin.tie(0); const vector<string> sizes = { S , M , L , XL , XXL , XXXL }; map<string, int> inv; { int k = 0; for (auto s : sizes) inv[s] = k++; } for (int i = 0; i < 6; i++) { cin >> cnt[i]; } cin >> N; for (int i = 0; i < N; i++) { string s; cin >> s; string t; for (char c : s) { if (c == , ) break; t += c; } int k = inv[t]; if (s == t) { cnt[k]--; res[i] = k; } else { v[k].push_back(i); } } bool good = 1; for (int i = 0; i < 5; i++) { if (cnt[i] < 0) { good = 0; break; } while (!v[i].empty() && cnt[i] > 0) { cnt[i]--; res[v[i].back()] = i; v[i].pop_back(); } while (!v[i].empty() && cnt[i + 1] > 0) { cnt[i + 1]--; res[v[i].back()] = i + 1; v[i].pop_back(); } if (!v[i].empty() || cnt[i + 1] < 0) { good = 0; break; } } if (!good) { cout << NO n ; return 0; } cout << YES n ; for (int i = 0; i < N; i++) cout << sizes[res[i]] << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; char a[n + 1][n + 1]; int ans[n + 1][n + 1]; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { cin >> a[i][j]; ans[i][j] = 0; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n - k + 1; j++) { bool x = true; for (int t = j; t < j + k; t++) { if (a[i][t] == # ) { x = false; break; } } if (x) { for (int t = j; t < j + k; t++) ans[i][t]++; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n - k + 1; j++) { bool x = true; for (int t = j; t < j + k; t++) { if (a[t][i] == # ) { x = false; break; } } if (x) { for (int t = j; t < j + k; t++) ans[t][i]++; } } } int mx = ans[1][1]; int p = 1, q = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (ans[i][j] > mx) { mx = ans[i][j]; p = i; q = j; } } cout << p << << q; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long ans, l; int n, m, N, i, j, k, s[3005], a[3005][3005], b[3005]; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d%d , &j, &k); a[j][++s[j]] = k; } for (i = 1; i <= m; i++) sort(a[i] + 1, a[i] + s[i] + 1, greater<int>()); ans = 1LL << 60; for (i = 1; i <= n; i++) { l = 0; N = 0; for (j = 2; j <= m; j++) { for (k = 1; k < i && k <= s[j]; k++) b[N++] = a[j][k]; for (; k <= s[j]; k++) l += a[j][k]; } sort(b, b + N); for (j = 0; j < i + N - n; j++) l += b[j]; ans = min(ans, l); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int n, m, a[maxn]; map<int, int> mp, rmp; int main() { scanf( %d%d , &n, &m); int id; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] == m) id = i; } int cnt = 0; for (int i = id; i >= 1; i--) { if (a[i] < m) cnt++; else if (a[i] > m) cnt--; mp[cnt]++; } long long ans = 0; cnt = 0; for (int i = id; i <= n; i++) { if (a[i] < m) cnt++; else if (a[i] > m) cnt--; ans += 1LL * mp[-cnt] + 1LL * mp[-cnt - 1]; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const unsigned long long O = 2e9; const double E = 1e-9; const double pi = 3.1415926536; int DX[] = {1, -1, 0, 0}; int DY[] = {0, 0, 1, -1}; int main() { int n, m; cin >> n >> m; int out = n * 2 + 1, in = 1; if (m > n * 2) { for (int i = 0; i < m; i++) { if (i % 2 == 0 && out <= m) cout << out++ << ; else cout << in++ << ; } } else for (int i = 1; i <= m; i++) cout << i << ; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; set<int> s; int x[maxn]; int n, k; int main() { while (~scanf( %d , &n)) { k = 0; if (!s.empty()) s.clear(); for (int i = 1; i <= n; i++) { int p; scanf( %d , &p); if (s.count(p) == 0) s.insert(p); else { x[k++] = i; s.clear(); } } if (k == 0) printf( -1 n ); else { if (x[k - 1] != n) x[k - 1] = n; printf( %d n , k); printf( 1 %d n , x[0]); for (int i = 0; i < k - 1; i++) printf( %d %d n , x[i] + 1, x[i + 1]); } } return 0; }
|
#include <bits/stdc++.h> const int MAXN = 100005; int n, val[MAXN], ch[MAXN][2], fa[MAXN], maxv[MAXN], size[MAXN], root; inline int max(int a, int b) { return a > b ? a : b; } inline int min(int a, int b) { return a > b ? b : a; } inline void maintain(int x) { size[x] = size[ch[x][0]] + size[ch[x][1]] + 1; maxv[x] = max(max(maxv[ch[x][0]], maxv[ch[x][1]]), val[x]); } void rotate(int x) { int y = fa[x], d = ch[y][1] == x; if (fa[x] = fa[y]) ch[fa[y]][ch[fa[y]][1] == y] = x; if (ch[y][d] = ch[x][d ^ 1]) fa[ch[y][d]] = y; fa[ch[x][d ^ 1] = y] = x; maintain(y), maintain(x); } void splay(int &rt, int x) { int f = fa[rt], y, z; while ((y = fa[x]) != f && (z = fa[y]) != f) { rotate((ch[z][1] == y) == (ch[y][1] == x) ? y : x); rotate(x); } if (y != f) rotate(x); rt = x; } void select(int &rt, int k) { int x = rt; while (size[ch[x][0]] + 1 != k) { if (k <= size[ch[x][0]]) x = ch[x][0]; else { k -= size[ch[x][0]] + 1; x = ch[x][1]; } } splay(rt, x); } void getPos(int &rt, int v) { int x = rt; while (true) { if (ch[x][1] && maxv[ch[x][1]] > v) x = ch[x][1]; else if (ch[x][0] && val[x] <= v) x = ch[x][0]; else break; } splay(rt, x); } void insert(int &rt, int p, int pos) { if (!pos) { select(rt, 1); fa[ch[rt][0] = p] = rt; rotate(p); rt = p; return; } select(rt, pos); int tmp = ch[rt][1]; if (!tmp) { fa[ch[rt][1] = p] = rt; rotate(p); rt = p; return; } fa[ch[rt][1] = p] = rt; fa[ch[p][1] = tmp] = p; splay(rt, tmp); } void traverse(int x) { if (!x) return; traverse(ch[x][0]); printf( %d , x); traverse(ch[x][1]); } int main() { int tmp, i; scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %d%d , &val[i], &tmp); if (i == 1) { size[root = 1] = 1; maxv[1] = val[1]; continue; } getPos(root, val[i]); if (val[root] < val[i]) insert(root, i, i - 1 - min(tmp, i - 1)); else insert(root, i, i - 1 - min(tmp, size[ch[root][1]])); } traverse(root); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int main() { int t; cin >> t; while (t--) { int c, s, v = 0, m, d, k, y; cin >> c >> s; m = (s / 2); d = (c / s); k = (c % s); if (m == 0) { v = c; } else { if (k >= m) { v = (c - k + m); } else { v = c; } } cout << v << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6; vector<long long> v[105]; map<long long, long long> mp; int vis[105]; long long cnt, cnt2; void dfs(int s) { vis[s] = 1; cnt += v[s].size(); cnt2++; for (int i = 0; i < v[s].size(); i++) { if (!vis[v[s][i]]) dfs(v[s][i]); } } int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, m, b, ans = 0, ans2, x, y, z, i, s; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= n; i++) { if (!vis[i]) { cnt = 0; cnt2 = 0; dfs(i); if (cnt2 * 2 == cnt) { if (cnt2 % 2) ans++; } } } if ((n - ans) % 2 == 0) cout << ans; else cout << ans + 1; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; vector<int> V; int solve() { V.clear(); cin >> n; for (int i = 0; i < n; ++i) { int a; cin >> a; V.emplace_back(a); } sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end()); return V.size(); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) cout << solve() << n ; }
|
#include <bits/stdc++.h> using namespace std; vector<long long> v[201]; long long arr[201]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i, j, c, max1, min1, temp, temp1, n1; cin >> n; for (i = 0; i < 2 * n; i++) { cin >> arr[i]; v[arr[i]].push_back(i); } for (i = 1; i <= n; i++) { if (abs(v[i][0] - v[i][1]) == 1) { continue; } else { break; } } if (i > n) { cout << 0 ; exit(0); } c = 0; while (1) { for (i = 0; i < 2 * n; i++) { if (abs(v[arr[i]][0] - v[arr[i]][1]) == 1) { continue; } else { max1 = max(v[arr[i]][0], v[arr[i]][1]); min1 = min(v[arr[i]][0], v[arr[i]][1]); c += max1 - min1 - 1; for (j = max1; j > min1 + 1; j--) { if (v[arr[j]][0] == j) { temp = 0; } else { temp = 1; } if (v[arr[j - 1]][0] == j - 1) { temp1 = 0; } else { temp1 = 1; } v[arr[j]][temp] = j - 1; v[arr[j - 1]][temp1] = j; swap(arr[j], arr[j - 1]); } } } for (i = 1; i <= n; i++) { if (abs(v[i][0] - v[i][1]) == 1) { continue; } else { break; } } if (i > n) { cout << c; exit(0); } } }
|
#include <bits/stdc++.h> using namespace std; long long n; const long long maxn = 2e5 + 100; const long long mod = 1e9 + 7; vector<long long> G[maxn]; long long dp[maxn]; long long oth[maxn]; long long fs[maxn], ts[maxn]; long long ans[maxn]; void myinit() { cin >> n; for (long long i = 2; i <= n; i++) { long long u; cin >> u; G[u].push_back(i); } memset(dp, 0, sizeof(dp)); memset(oth, 0, sizeof(oth)); } void dfs1(long long x) { long long s = 1; for (long long i = 0; i < G[x].size(); i++) { long long tmp = G[x][i]; dfs1(tmp); s = s * (dp[tmp] + 1); s %= mod; } dp[x] = s; } void dfs2(long long x) { fs[0] = 1; for (long long i = 0; i < G[x].size(); i++) { long long tmp = G[x][i]; fs[i + 1] = fs[i] * (dp[tmp] + 1); fs[i + 1] %= mod; } ts[G[x].size() + 1] = 1; for (long long i = (long long)G[x].size() - 1; i >= 0; i--) { long long tmp = G[x][i]; ts[i + 1] = (ts[i + 2] * (dp[tmp] + 1)) % mod; } for (long long i = 0; i < G[x].size(); i++) { oth[G[x][i]] = ((fs[i] * ts[i + 2] % mod) * oth[x] + 1) % mod; } for (long long i = 0; i < G[x].size(); i++) { dfs2(G[x][i]); } } void dfs3(long long x) { for (long long i = 0; i < G[x].size(); i++) { long long tmp = G[x][i]; ans[tmp] = (oth[tmp] * dp[tmp]) % mod; dfs3(tmp); } } void solve() { myinit(); dfs1(1); oth[1] = 1; dfs2(1); ans[1] = dp[1]; dfs3(1); for (long long i = 1; i <= n; i++) { cout << ans[i] << ; } } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void print2dvector(vector<vector<T> > v) { cout << A 2d vector: << endl; int a = v.size(); int b = v[0].size(); if (a <= 15 && b <= 15) { for (int i = 0; i < a; i++) { for (int j = 0; j < b; j++) { cout << setw(4) << v[i][j]; } cout << endl; } } if (a > 15 && b > 15) { for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { cout << setw(4) << v[i][j]; } cout << << . . . << setw(4) << v[i][b - 3] << setw(4) << v[i][b - 2] << setw(4) << v[i][b - 1] << endl; } for (int i = 0; i < 15; i++) { cout << setw(4) << . ; } cout << endl; for (int i = a - 3; i < a; i++) { for (int j = 0; j < 9; j++) { cout << setw(4) << v[i][j]; } cout << << . . . << setw(4) << v[i][b - 3] << setw(4) << v[i][b - 2] << setw(4) << v[i][b - 1] << endl; } } if (a > 15) { for (int i = 0; i < 9; i++) { for (int j = 0; j < b; j++) { cout << setw(4) << v[i][j]; } cout << endl; } for (int i = 0; i < b; i++) { cout << setw(4) << . ; } cout << endl; for (int i = a - 3; i < a; i++) { for (int j = 0; j < b; j++) { cout << setw(4) << v[i][j]; } cout << endl; } } if (b > 15) { for (int i = 0; i < a; i++) { for (int j = 0; j < 9; j++) { cout << setw(4) << v[i][j]; } cout << << . . . << setw(4) << v[i][b - 3] << setw(4) << v[i][b - 2] << setw(4) << v[i][b - 1] << endl; } } } template <typename T> void printvector(vector<T> v) { cout << A 1d vector: << endl; int a = v.size(); if (a <= 15) { for (int i = 0; i < a; i++) { cout << setw(4) << v[i]; } } else { for (int i = 0; i < 9; i++) { cout << setw(4) << v[i]; } cout << << . . . << setw(4) << v[a - 3] << setw(4) << v[a - 2] << setw(4) << v[a - 1]; } cout << endl; } int main() { int n, m; scanf( %d %d , &n, &m); vector<int> v(n, 0); for (int i = 0; i < n; i++) { scanf( %d , &v[i]); } double ans = 0; int a, b, c; for (int i = 0; i < m; i++) { scanf( %d %d %d , &a, &b, &c); ans = max(ans, 1.0 * (v[a - 1] + v[b - 1]) / c); } printf( %.12lf , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[200005], b[200005], vis[200005]; bool cmp(int a, int b) { return a > b; } int main() { int n; scanf( %d , &n); int numa = 0, numb = 0, flag = 0; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); if (vis[x]) a[numa++] = x, vis[x]++; else b[numb++] = x, vis[x]++; if (vis[x] > 2) flag = 1; } if (flag) printf( NO n ); else { printf( YES n ); sort(a, a + numa); sort(b, b + numb, cmp); printf( %d n , numa); int flag1 = 0; for (int i = 0; i < numa; i++) { if (flag1) printf( ); flag1 = 1; printf( %d , a[i]); } printf( n ); flag1 = 0; printf( %d n , numb); for (int i = 0; i < numb; i++) { if (flag1) printf( ); flag1 = 1; printf( %d , b[i]); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); const int N = 1005; int cnt[N]; bitset<N> dp; int n, m; int idx[N]; int par[N]; int xx[N]; bool vis[N]; int find(int x) { if (par[x] == x) return x; return par[x] = find(par[x]); } int main() { for (int i = 0; i <= 1000; i += 1) cnt[i] = 0; cin >> n >> m; int ix = 1; for (int i = 0; i <= n; i += 1) par[i] = i; int id = -1, tmp, x; bool flag = false; for (int i = 1; i <= n; i += 1) { cin >> xx[i]; if (xx[i] != 0) par[i] = find(par[xx[i]]); if (xx[i] == 0) { idx[i] = ix++; } } for (int i = 1; i <= n; i += 1) { if (find(par[i]) == find(par[m])) { continue; } cnt[idx[find(par[i])]]++; } int now = m; while (now != 0) { cnt[idx[par[m]]]++; now = xx[now]; } dp[cnt[idx[par[m]]]] = 1; for (int i = 1; i <= ix - 1; i += 1) { if (i != idx[par[m]]) { dp = (dp << cnt[i]) | dp; } } for (int i = 0; i <= n; i += 1) { if (dp[i] == 1) { cout << i << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MaxN = 33; template <class T> inline void relax(T &a, const T &b) { if (b > a) a = b; } int main() { int n; static int a[MaxN][MaxN]; cin >> n; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) scanf( %d , &a[i][j]); int l = (n + 1) / 2; int res = INT_MIN; for (int lastR = 0; lastR < (1 << l); lastR++) { int cur = 0; for (int r = 0; r < l; r++) { int resR = INT_MIN; for (int tv = 0; tv <= 1; tv++) { int curR = 0; for (int c = 0; c < l; c++) { int resRC = INT_MIN; for (int cv = 0; cv <= 1; cv++) { if (r == l - 1 && cv != (lastR >> c & 1)) continue; if (c == l - 1 && cv != tv) continue; int curRC = 0; curRC += cv == 0 ? a[r][c] : -a[r][c]; if (r + l < n) curRC += (cv ^ (lastR >> c & 1)) == 0 ? a[r + l][c] : -a[r + l][c]; if (c + l < n) curRC += (cv ^ tv) == 0 ? a[r][c + l] : -a[r][c + l]; if (r + l < n && c + l < n) curRC += (cv ^ (lastR >> c & 1) ^ tv ^ (lastR >> (l - 1) & 1)) == 0 ? a[r + l][c + l] : -a[r + l][c + l]; relax(resRC, curRC); } if (resRC == INT_MIN) { curR = INT_MIN; break; } curR += resRC; } relax(resR, curR); } cur += resR; } relax(res, cur); } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long gcd(long long n, long long m) { return m == 0 ? n : gcd(m, n % m); } inline long long Set(long long n, long long pos) { return n = n | (1LL << pos); } inline long long Reset(long long n, long long pos) { return n = n & ~(1LL << pos); } inline bool Check(long long n, long long pos) { return (bool)(n & (1LL << pos)); } inline long long Count(long long n) { return __builtin_popcountll(n); } long long const N = 3e5 + 5; long long const MOD = 998244353; long long color[N]; vector<long long> adj[N]; long long dp[N]; long long res[N]; long long dfs(long long node, long long p) { long long col = 0; for (auto c : adj[node]) { if (p == c) continue; long long temp = dfs(c, node); col += max(temp, 0LL); } col += color[node]; return dp[node] = col; } void adfs(long long node, long long p, long long up) { up = max(up, 0LL); res[node] = dp[node] + up; for (auto c : adj[node]) { if (p == c) continue; long long temp = dp[node] - max(dp[c], 0LL) + up; adfs(c, node, temp); } } void solve() { long long n; cin >> n; for (long long i = 1; i <= n; i++) { cin >> color[i]; if (color[i] == 0) color[i] = -1; } for (long long i = 1; i < n; i++) { long long u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } dfs(1, -1); adfs(1, -1, 0); for (long long i = 1; i <= n; i++) cout << res[i] << ; } int32_t main() { fast(); solve(); }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1LL << 60; const long long N = 2e5 + 5; long long a[N]; void solve() { long long n; cin >> n; vector<long long> vect; for (long long i = 1; i < n + 1; i++) { cin >> a[i]; if (a[i] != i) { vect.push_back(i); } } if ((long long)vect.size() == 0) { cout << 0; return; } bool fl = true; for (long long i = 1; i < (long long)vect.size(); i++) { if (vect[i] - vect[i - 1] > 1) fl = false; } if (fl) cout << 1; else cout << 2; } signed main() { std::ios::sync_with_stdio(false); cin.tie(NULL); long long t = 1; cin >> t; while (t--) { solve(); cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k, l, c, d, p, nl, np; cin >> n >> k >> l >> c >> d >> p >> nl >> np; int mls = k * l; int slices = c * d; int drinks = min(mls / nl, min(p / np, slices)) / n; cout << drinks << endl; }
|
#include <bits/stdc++.h> using namespace std; int a[500010]; char s[500010], temp[500010]; int n; long long Max = -1000, sum = 0; void init() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> s[i]; } } void work() { for (int i = 0; i < n; i++) { if (s[i] == B ) sum += a[i]; } Max = sum; long long temp = sum; for (int i = n - 1; i >= 0; i--) { if (s[i] == A ) { sum += a[i]; if (sum > Max) Max = sum; } else { sum -= a[i]; } } sum = temp; for (int i = 0; i < n; i++) { if (s[i] == A ) { sum += a[i]; if (sum > Max) Max = sum; } else { sum -= a[i]; } } } int main() { init(); work(); cout << Max << endl; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); int n, m, q, p; cin >> n >> m >> q >> p; queue<pair<pair<int, int>, int>> qu; vector<vector<int>> g(n, vector<int>(m, 0)); vector<vector<char>> d(n, vector<char>(m)); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> d[i][j]; if (d[i][j] == * ) g[i][j] = -1; } int si[4]{0, 0, -1, 1}; int sj[4]{1, -1, 0, 0}; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (d[i][j] != . && d[i][j] != * ) { int cur = (int(d[i][j]) - int( A ) + 1) * q; g[i][j] += cur; qu.push({{i, j}, cur}); vector<vector<bool>> used(n, vector<bool>(m, false)); used[i][j] = true; while (!qu.empty()) { int x = qu.front().first.first; int y = qu.front().first.second; int qq = qu.front().second; for (int c = 0; c < 4; c++) { int tx = x + si[c]; int ty = y + sj[c]; if (tx > -1 && tx < n && ty > -1 && ty < m) if (!used[tx][ty] && g[tx][ty] != -1) { g[tx][ty] += qq / 2; used[tx][ty] = true; if (qq > 1) qu.push({{tx, ty}, qq / 2}); } } qu.pop(); } } int ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (g[i][j] > p) ans++; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int r, g, b; cin >> r >> g >> b; if (r % 2 == 0) r = r / 2; else r = r / 2 + 1; if (g % 2 == 0) g = g / 2; else g = g / 2 + 1; if (b % 2 == 0) b = b / 2; else b = b / 2 + 1; int tmp1 = 3 * (r - 1); int tmp2 = 3 * (g - 1) + 1; int tmp3 = 3 * (b - 1) + 2; tmp1 = max(tmp1, tmp2); tmp1 = max(tmp1, tmp3); cout << tmp1 + 30; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 4e6 + 7; const int inf = INT_MAX; const long long inff = 1e18; const long long mod = 1e9 + 7; int d, s; pair<int, int> dp[maxn]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cin >> d >> s; for (int i = 0; i <= (d + 1) * (s + 1); i++) dp[i] = make_pair(-1, 0); queue<int> q; q.push(0); while (!q.empty()) { int now = q.front(); int sum = now / d, r = now % d; q.pop(); for (int i = 0; i < 10; i++) { if (sum + i <= s && (dp[(sum + i) * d + (r * 10 + i) % d].first == -1)) { dp[(sum + i) * d + (r * 10 + i) % d] = make_pair(now, i); q.push((sum + i) * d + (r * 10 + i) % d); } } } int now = s * d; if (dp[now].first == -1) return cout << -1 << n , 0; else { vector<int> v; while (now) { v.push_back(dp[now].second); now = dp[now].first; } reverse((v).begin(), (v).end()); for (int i : v) cout << i; cout << n ; } }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.