Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 100; int dp[N]; int b[N]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; int Max = 0; vector<int> v; for (int i = 0; i < n; i++) { while (!v.empty()) { int ind = v.back(); if (b[ind] < b[i]) { dp[i] = max(dp[i], dp[ind] + 1); v.pop_back(); } else { dp[i] = max(dp[i], 1); break; } } if (v.empty()) dp[i] = 0; Max = max(Max, dp[i]); v.push_back(i); } cout << Max; cin >> n; }
#include <bits/stdc++.h> using namespace std; const int dx[9] = {0, 1, -1, 0, 0, -1, -1, 1, 1}; const int dy[9] = {0, 0, 0, -1, 1, -1, 1, -1, 1}; const double pi = acos(-1.0); const int N = 110; long long n, m, ans; void input_data() { cin >> n >> m; } void get_ans() { if (n <= m) { ans = n; return; } n -= (m + 1); if (n <= 0) { ans = m + 1; return; } long long l = 0, r = 2e9 + 2, t = 0; ans = m; while (l <= r) { long long mid = (l + r) >> 1; long long temp = (mid + 2) * (mid - 1) / 2; if (temp >= n) { t = mid; r = mid - 1; } else l = mid + 1; } ans += t; } void o() { cout << ans << endl; } int main() { input_data(); get_ans(); o(); return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> void solve() { int n, x; cin >> n >> x; vector<int> cs(n); for (auto& c : cs) { cin >> c; } int c_sum = accumulate(cs.begin(), cs.end(), 0); vector<vector<T>> mass(n + 1, vector<T>(c_sum + 1, 0)); mass[0][0] = T(1); for (int c : cs) { for (int k = n - 1; k >= 0; --k) { for (int s = c_sum - c; s >= 0; --s) { mass[k + 1][s + c] += T(k + 1) / T(n - k) * mass[k][s]; } } } T answer(0); for (int k = 1; k <= n; ++k) { for (int s = 0; s <= c_sum; ++s) { answer += min(T(s) / T(k), T(x) / T(2) * (T(1) + T(n) / T(k))) * mass[k][s]; } } printf( %.17f n , (double)answer); } int main() { ios::sync_with_stdio(false); cin.tie(0); solve<double>(); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 210; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long LCM = 1, limit, X; int n, a[MAXN]; bool inCir[MAXN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { int x = i, Len = 0; for (int j = 1; j <= n; j++) x = a[x]; while (!inCir[x]) inCir[x] = true, x = a[x], Len++; if (Len) LCM = lcm(LCM, Len); } for (int i = 1; i <= n; i++) { int x = i, Len = 0; while (!inCir[x]) x = a[x], Len++; limit = max(limit, (long long)Len); } X = LCM; while (X < limit) X += LCM; printf( %I64d n , X); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, aa[8] = {-1, 0, 1, -1, 2, -1, -1, -1}, bb[8] = {-1, -1, -1, 2, -1, 1, 0, -1}; int T, n, i, j; long long l, r, m, a[N], b[N], c[N], x, y, z, mn[8], u[4], d[4]; inline bool ckk(long long p, long long q, long long r) { for (x = q + r - 4 >> 1; x <= q + r + 4 >> 1; ++x) for (y = r + p - 4 >> 1; y <= r + p + 4 >> 1; ++y) for (z = p + q - 4 >> 1; z <= p + q + 4 >> 1; ++z) if (d[0] <= -x + y + z && -x + y + z <= u[0] && d[1] <= x - y + z && x - y + z <= u[1] && d[2] <= x + y - z && x + y - z <= u[2] && d[3] <= x + y + z && x + y + z <= u[3]) return 1; return 0; } inline bool ck(long long D) { for (i = 0; i < 8; ++i) mn[i] = 8e18; for (i = 1; i <= n; ++i) for (j = 0; j < 8; ++j) mn[j] = min(mn[j], D + (j & 1 ? -a[i] : a[i]) + (j & 2 ? -b[i] : b[i]) + (j & 4 ? -c[i] : c[i])); u[3] = mn[0]; d[3] = -mn[7]; for (i = 1; i < 7; ++i) { if (aa[i] != -1) u[aa[i]] = mn[i]; if (bb[i] != -1) d[bb[i]] = -mn[i]; } for (i = 0; i < 4; ++i) if (u[i] < d[i]) return 0; x = 27; y = 26; z = 59; if (53 <= D && D < 70) ++D, --D; for (i = 0; i < 16; ++i) { long long p, q, r, s; p = i & 1 ? u[0] : d[0]; q = i & 2 ? u[1] : d[1]; r = i & 4 ? u[2] : d[2]; s = i & 8 ? u[3] : d[3]; s = p + q + r; if (d[3] <= s && s <= u[3] && ckk(p, q, r)) return 1; p = i & 1 ? u[0] : d[0]; q = i & 2 ? u[1] : d[1]; r = i & 4 ? u[2] : d[2]; s = i & 8 ? u[3] : d[3]; r = s - p - q; if (d[2] <= r && r <= u[2] && ckk(p, q, r)) return 1; if (i == 0) ++i, --i; p = i & 1 ? u[0] : d[0]; q = i & 2 ? u[1] : d[1]; r = i & 4 ? u[2] : d[2]; s = i & 8 ? u[3] : d[3]; q = s - p - r; if (d[1] <= q && q <= u[1] && ckk(p, q, r)) return 1; p = i & 1 ? u[0] : d[0]; q = i & 2 ? u[1] : d[1]; r = i & 4 ? u[2] : d[2]; s = i & 8 ? u[3] : d[3]; p = s - q - r; if (d[0] <= p && p <= u[0] && ckk(p, q, r)) return 1; } return 0; } int main() { scanf( %d , &T); for (; T--;) { l = r = 0; scanf( %d , &n); for (i = 1; i <= n; ++i) scanf( %lld%lld%lld , a + i, b + i, c + i), r = max(r, abs(a[i]) + abs(b[i]) + abs(c[i])); for (; l < r;) { m = l + r >> 1; if (ck(m)) r = m; else l = m + 1; } ck(l); printf( %lld %lld %lld n , x, y, z); } return 0; }
#include <bits/stdc++.h> using namespace std; struct SegmentTree { int n; struct node { long long add, mn; node() {} node(long long v) : mn(v), add(0) {} }; vector<node> tree; void push(int id, int l, int r) { if (tree[id].add != 0) { int m = (l + r) >> 1; apply(id << 1, l, m, tree[id].add); apply(id << 1 | 1, m + 1, r, tree[id].add); tree[id].add = 0; } } void apply(int id, int l, int r, long long add) { tree[id].mn += add; tree[id].add += add; } void pull(int id) { tree[id].mn = min(tree[id << 1].mn, tree[id << 1 | 1].mn); } SegmentTree(int n) : n(n), tree(4 * n) {} SegmentTree(const vector<long long> &v) { n = (int)v.size(); tree.resize(4 * n); function<void(int, int, int)> build = [&](int id, int l, int r) { if (l == r) { tree[id] = v[l]; return; } push(id, l, r); int m = (l + r) >> 1; build(id << 1, l, m); build(id << 1 | 1, m + 1, r); pull(id); }; build(1, 0, n - 1); } void rangeadd(int id, int l, int r, int ql, int qr, long long add) { if (l > qr || r < ql) { return; } if (ql <= l && r <= qr) { apply(id, l, r, add); return; } push(id, l, r); int m = (l + r) >> 1; rangeadd(id << 1, l, m, ql, qr, add); rangeadd(id << 1 | 1, m + 1, r, ql, qr, add); pull(id); } void rangeadd(int ql, int qr, long long add) { rangeadd(1, 0, n - 1, ql, qr, add); } }; void solve() { int N; cin >> N; vector<int> P(N), pos(N); for (int i = 0; i < N; i++) { cin >> P[i]; P[i]--; pos[P[i]] = i; } vector<int> A(N); for (int i = 0; i < N; i++) { cin >> A[i]; } vector<long long> init(N - 1); for (int i = 0; i < N - 1; i++) { init[i] = (i == 0 ? 0 : init[i - 1]) + A[i]; } SegmentTree st(init); long long ans = A[0]; for (int i = 0; i < N; i++) { st.rangeadd(0, pos[i] - 1, A[pos[i]]); st.rangeadd(pos[i], N - 2, -A[pos[i]]); ans = min(ans, st.tree[1].mn); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; if (n < 6) { cout << 0 << << 0 << << 0 << endl; continue; } int index = (n / 2) - 1; while (index >= 0 && arr[index] == arr[index + 1]) index--; vector<int> count; int sum = 0; for (int i = index; i >= 0; i--) { int temp = 1; int j = i - 1; while (j >= 0 && arr[j] == arr[i]) { j--; temp++; } count.push_back(temp); sum += temp; i = j + 1; } if (count.size() < 3) { cout << 0 << << 0 << << 0 << endl; continue; } sum -= count[count.size() - 1]; int g = count[count.size() - 1], s = 0, b = 0; bool ans = 0; for (int i = 0; i < count.size() - 1; i++) { b += count[i]; s = sum - b; if (g < b && g < s) { ans = 1; break; } } if (ans == 1) cout << g << << s << << b << endl; else cout << 0 << << 0 << << 0 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long cal(long long x, long long a) { long long y = a, ans = 0, cnt = 1; while (x / (long long)(pow(a, cnt)) != 0) { ans += x / (long long)(pow(a, cnt)); cnt++; } return ans; } signed main() { long long n, b, mx = LLONG_MAX; vector<long long> v, k; cin >> n >> b; for (long long i = 2; i * i <= b; i++) { if (b % i == 0) { long long cnt = 0; v.push_back(i); while (b % i == 0) { b = b / i; cnt++; } k.push_back(cnt); } } if (b != 1) v.push_back(b), k.push_back(1); for (long long i = 0; i < v.size(); i++) { mx = min(cal(n, v[i]) / k[i], mx); } cout << mx; }
#include <bits/stdc++.h> const double PI = 2.0 * acos(0.0); const double EPS = 1e-9; using namespace std; int dr[] = {-1, 0, 1, 0, 1, 1, -1, -1}; int dc[] = {0, 1, 0, -1, -1, 1, -1, 1}; int V, E; int T; int N, M, K; string S; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N >> K; int ans[5010]; int i, j; map<int, vector<int>> m; for (i = 0; i <= N - 1; i++) cin >> j, m[j].push_back(i); int col = 0; for (auto x : m) { if (x.second.size() > K) { cout << NO << endl; return 0; } else { for (j = 0; j <= x.second.size() - 1; j++) { ans[x.second[j]] = col % K + 1; col++; } } } cout << YES << endl; for (i = 0; i <= N - 1; i++) cout << ans[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 50; const long long MAXN = 1e18 + 10; const int MAX = 1e5 + 10; const long long mod = 1e9 + 7; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const double eps = 1e-7; inline void solve() { int n, w; scanf( %d , &n); scanf( %d , &w); int minn = 0, maxn = w; bool flag = false; for (int i = 0; i < n; ++i) { int temp; scanf( %d , &temp); if (temp < 0) { minn += (-temp); if (minn > w) flag = true; maxn = min(w, maxn - temp); } else if (temp > 0) { maxn -= temp; if (maxn < 0) flag = true; minn = max(0, minn - temp); } if (maxn < minn) flag = true; } if (flag) printf( 0 n ); else printf( %d n , maxn - minn + 1); return; } int main() { int casen = 1; while (casen--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; cin.get(); string s; getline(cin, s); vector<int> pref(n); for (int i = 0; i < n; ++i) { if (i != 0) pref[i] = pref[i - 1]; pref[i] += s[i] == ( ? +1 : -1; } if (pref[n - 1] != 0) { cout << 0 n1 1 n ; return 0; } int min_pos = min_element(pref.begin(), pref.end()) - pref.begin() + 1; if (min_pos == n) min_pos = 0; rotate(s.begin(), s.begin() + min_pos, s.end()); for (int i = 0; i < n; ++i) { pref[i] = 0; if (i != 0) pref[i] = pref[i - 1]; pref[i] += s[i] == ( ? +1 : -1; assert(pref[i] >= 0); } vector<int> merged; vector<vector<int>> pos(2); vector<vector<int>> cnt(n, vector<int>(3)); pos[0].emplace_back(-1); merged.emplace_back(-1); for (int i = 0; i < n; ++i) { if (i != 0) cnt[i] = cnt[i - 1]; if (pref[i] < 3) { cnt[i][pref[i]] += 1; if (pref[i] < 2) { merged.emplace_back(i); pos[pref[i]].emplace_back(i); } } } tuple<int, int, int> ans((int)pos[0].size() - 1, 0, 0); for (int i = 0; i + 1 < (int)pos[0].size(); ++i) { int l = pos[0][i], r = pos[0][i + 1]; int cnt_1 = cnt[r][1] - (l >= 0 ? cnt[l][1] : 0); ans = max(ans, make_tuple(cnt_1, l + 1, r)); } for (int i = 0; i + 1 < (int)merged.size(); ++i) { int l = merged[i], r = merged[i + 1]; if (s[l + 1] == s[r]) continue; int cnt_2 = cnt[r][2] - (l >= 0 ? cnt[l][2] : 0); ans = max(ans, make_tuple(cnt_2 + (int)pos[0].size() - 1, l + 1, r)); } int res, l, r; tie(res, l, r) = ans; (l += min_pos) %= n; (r += min_pos) %= n; cout << res << endl; cout << 1 + l << << 1 + r << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); ; long long i, j, k, l, r, m, n, o, t; cin >> n; cin >> l >> r; char str[100001]; cin >> str; long long len = strlen(str); l--; r--; if (str[l] == str[r]) { cout << 0 << endl; return 0; } cout << 1 << endl; }
#include <bits/stdc++.h> using namespace std; vector<int> vec; int result[50000]; int MIN(int i, int j) { int ans = 1e9; for (int a = i; a <= j; a++) { ans = min(ans, vec[a]); } return ans; } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < (n); i++) vec.push_back(i + 1); int limit = 1; for (int i = 0; i < (n); i++) limit *= (i + 1); int sum, mx = 0, realsum = 0; for (int z = 0; z < (limit); z++) { for (int i = 0; i < (n); i++) { sum = 0; for (int j = i; j < n; j++) sum += MIN(i, j); ; realsum += sum; } if (realsum > mx) mx = realsum; result[z] = realsum; realsum = 0; next_permutation(vec.begin(), vec.end()); } vector<int> sol; for (int i = 0; i < (n); i++) sol.push_back(i + 1); int cnt = 0; for (int z = 0; z < (limit); z++) { if (result[z] == mx) { cnt++; if (cnt == m) { printf( %d , sol[0]); for (int i = 1; i < n; i++) printf( %d , sol[i]); printf( n ); break; } } next_permutation(sol.begin(), sol.end()); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int N = 1e5 + 9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int x; cin >> x; long long ans = 0, c = 0; int y[x]; for (int i = 0; i < x; i++) cin >> y[i]; for (int i = x - 1; i >= 0; i--) { if (!y[i]) c++; else ans += c; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; string s[6]; vector<string> res; void draw(vector<string> &w, int x, int y, int dx, int dy, string s) { for (int k = 0; k < s.size(); k++, x += dx, y += dy) { w[x][y] = s[k]; } return; } int main() { for (int i = 0; i < 6; i++) cin >> s[i]; sort(s, s + 6); res.clear(); do { if (s[0].size() + s[2].size() == s[1].size() + 1 && s[3].size() + s[5].size() == s[4].size() + 1) { int l[6]; for (int i = 0; i < 6; i++) l[i] = s[i].size() - 1; if (s[0][0] == s[3][0] && s[0][l[0]] == s[4][0] && s[1][0] == s[3][l[3]] && s[1][l[0]] == s[4][l[3]] && s[1][l[1]] == s[5][0] && s[2][0] == s[4][l[4]] && s[2][l[2]] == s[5][l[5]]) { int n = l[4] + 1, m = l[1] + 1; vector<string> w(n, string(m, . )); draw(w, 0, 0, 0, 1, s[0]); draw(w, l[3], 0, 0, 1, s[1]); draw(w, n - 1, l[0], 0, 1, s[2]); draw(w, 0, 0, 1, 0, s[3]); draw(w, 0, l[0], 1, 0, s[4]); draw(w, l[3], l[1], 1, 0, s[5]); if (res.size() == 0 || res > w) res = w; } } } while (next_permutation(s, s + 6)); if (res.size() == 0) cout << Impossible << endl; for (int i = 0; i < res.size(); i++) cout << res[i] << endl; }
#include <bits/stdc++.h> using namespace std; const int MX = 102, md = 1000000007; int n, k, i, j, e, c[MX][MX], f[MX][MX * MX]; long long m, p[MX], q[MX]; bool ifq; long long pw(long long a, long long b) { if (b == 0) return 1LL; if (b & 1) return (a * pw(a, b - 1)) % md; long long x = pw(a, b / 2); return (x * x) % md; } int main() { cin >> n >> m >> k; for (i = 0; i <= n; i++) { c[i][0] = 1; for (j = 1; j <= i; j++) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % md; } for (i = 0; i <= n; i++) { p[i] = pw(c[n][i], m / n); q[i] = (p[i] * c[n][i]) % md; } f[0][0] = 1; for (i = 0; i < n; i++) { ifq = (i < (m % n)); for (j = 0; j <= k; j++) if (f[i][j]) for (e = 0; e <= n && j + e <= k; e++) f[i + 1][j + e] = (f[i + 1][j + e] + f[i][j] * (ifq ? q[e] : p[e])) % md; } cout << f[n][k] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3f; const double pi = acos(-1.0); const double eps = 1e-9; const long long mod = 1e9 + 7; int read() { int x = 0, f = 1; char ch = getchar(); while (ch< 0 | ch> 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } void Out(int aa) { if (aa > 9) Out(aa / 10); putchar(aa % 10 + 0 ); } int x[505], y[505]; int dp[1010][1010]; int n, m, k; bool check(int t) { vector<int> X, Y; X.push_back(1), X.push_back(n + 1); Y.push_back(1), Y.push_back(m + 1); for (int i = 1; i <= k; i++) { X.push_back(max(x[i] - t, 1)), X.push_back(min(n + 1, x[i] + t + 1)); Y.push_back(max(1, y[i] - t)), Y.push_back(min(m + 1, y[i] + t + 1)); } sort(X.begin(), X.end()); X.erase(unique(X.begin(), X.end()), X.end()); sort(Y.begin(), Y.end()); Y.erase(unique(Y.begin(), Y.end()), Y.end()); memset(dp, 0, sizeof(dp)); for (int i = 1; i <= k; i++) { int l1 = lower_bound(X.begin(), X.end(), max(x[i] - t, 1)) - X.begin(); int l2 = lower_bound(X.begin(), X.end(), min(x[i] + t + 1, n + 1)) - X.begin(); int r1 = lower_bound(Y.begin(), Y.end(), max(y[i] - t, 1)) - Y.begin(); int r2 = lower_bound(Y.begin(), Y.end(), min(y[i] + t + 1, m + 1)) - Y.begin(); dp[l1][r1]++, dp[l2][r2]++; dp[l1][r2]--; dp[l2][r1]--; } int l = n + 1, r = 0; int u = m + 1, d = 0; for (int i = 0; i < X.size() - 1; i++) for (int j = 0; j < Y.size() - 1; j++) { if (i && j) dp[i][j] += -dp[i - 1][j - 1] + dp[i][j - 1] + dp[i - 1][j]; else if (i) dp[i][j] += dp[i - 1][j]; else if (j) dp[i][j] += dp[i][j - 1]; if (dp[i][j]) continue; l = min(l, X[i]); r = max(r, X[i + 1] - 1); u = min(u, Y[j]); d = max(d, Y[j + 1] - 1); } return max(r - l, d - u) <= 2 * t; } int main() { n = read(), m = read(), k = read(); for (int i = 1; i <= k; i++) x[i] = read(), y[i] = read(); int l = 0, r = max(n, m); int ans = r; while (r >= l) { int mid = (l + r) / 2; if (check(mid)) ans = mid, r = mid - 1; else l = mid + 1; } Out(ans); return 0; }
#include <bits/stdc++.h> using namespace std; int tr[400], ar[400]; vector<pair<int, int> > vv; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> ar[i]; for (int i = 0; i < n; i++) cin >> tr[i]; for (int i = 0; i < n; i++) { if (tr[i] == ar[i]) continue; int j; for (j = i + 1; j < n; j++) if (tr[j] == ar[i]) break; for (j = j - 1; j >= i; j--) { int tmp = tr[j]; tr[j] = tr[j + 1]; tr[j + 1] = tmp; vv.push_back(make_pair(j, j + 1)); } } if (vv.size() >= 1000000) return -1; cout << vv.size() << endl; for (int i = 0; i < vv.size(); i++) { cout << vv[i].first + 1 << << vv[i].second + 1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = 1e15 + 9; const long long N = 1e5 + 5; long long A[N], n, k, B[N]; map<long long, long long> mm; void solve() { long long i, j, x = 0, y = 1, m; cin >> n; for (i = 0; i < n; i++) { cin >> x >> y; mm[x] = max(mm[x], y); } cin >> m; for (i = 0; i < m; i++) { cin >> x >> y; mm[x] = max(mm[x], y); } x = 0; for (auto i : mm) x += i.second; cout << x; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1, i; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; struct ji { int nex, to; } edge[100005 << 1]; set<pair<int, int> > s[100005]; set<pair<int, int> >::iterator it; priority_queue<pair<int, int> > q; pair<int, int> ans[100005]; int E, n, r, x, y, z, cnt, head[100005], sz[100005], mx[100005], f[100005], d[100005]; long long m; void add(int x, int y) { edge[E].nex = head[x]; edge[E].to = y; head[x] = E++; } void dfs(int k, int fa) { sz[k] = 1; mx[k] = 0; for (int i = head[k]; i != -1; i = edge[i].nex) if (edge[i].to != fa) { dfs(edge[i].to, k); sz[k] += sz[edge[i].to]; mx[k] = max(mx[k], sz[edge[i].to]); } if (max(n - sz[k], mx[k]) <= n / 2) r = k; } void dfs(int k, int fa, int sh) { f[k] = fa; d[k] = sh; m -= sh; s[x].insert(make_pair(sh, k)); sz[k] = 1; for (int i = head[k]; i != -1; i = edge[i].nex) if (edge[i].to != fa) { dfs(edge[i].to, k, sh + 1); sz[k] += sz[edge[i].to]; } } int main() { scanf( %d%lld , &n, &m); memset(head, -1, sizeof(head)); for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); add(x, y); add(y, x); } dfs(1, 0); for (int i = head[r]; i != -1; i = edge[i].nex) { x = edge[i].to; dfs(x, r, 1); q.push(make_pair(sz[x], x)); } if ((m > 0) || (m % 2)) { printf( NO ); return 0; } m /= -2; while (m) { x = q.top().second; q.pop(); if (sz[x] < 2) { printf( NO ); return 0; } sz[x] -= 2; if (sz[x]) q.push(make_pair(sz[x], x)); if ((*--s[x].end()).first - 1 <= m) { y = (*--s[x].end()).second; s[x].erase(--s[x].end()); m -= d[y] - 1; z = f[y]; bool flag = 0; for (int i = head[z]; i != -1; i = edge[i].nex) if ((edge[i].to != f[z]) && (edge[i].to != y) && (s[x].find(make_pair(d[edge[i].to], edge[i].to)) != s[x].end())) { ans[++cnt] = make_pair(edge[i].to, y); s[x].erase(make_pair(d[edge[i].to], edge[i].to)); flag = 1; break; } if (!flag) { ans[++cnt] = make_pair(z, y); s[x].erase(make_pair(d[z], z)); } } else { it = lower_bound(s[x].begin(), s[x].end(), make_pair((int)m, 0)); while ((*it).first == m) { bool flag = 0; y = (*it).second; for (int i = head[y]; i != -1; i = edge[i].nex) if ((edge[i].to != f[y]) && (s[x].find(make_pair(d[edge[i].to], edge[i].to)) != s[x].end())) { ans[++cnt] = make_pair(y, edge[i].to); s[x].erase(make_pair(d[y], y)); s[x].erase(make_pair(d[edge[i].to], edge[i].to)); flag = 1; break; } if (flag) break; it++; } m = 0; } } while (!q.empty()) { x = q.top().second; q.pop(); if (q.empty()) { ans[++cnt] = make_pair((*s[x].begin()).second, r); break; } y = q.top().second; q.pop(); if (sz[x] > 1) q.push(make_pair(--sz[x], x)); if (sz[y] > 1) q.push(make_pair(--sz[y], y)); ans[++cnt] = make_pair((*s[x].begin()).second, (*s[y].begin()).second); s[x].erase(s[x].begin()); s[y].erase(s[y].begin()); } printf( YES n ); for (int i = 1; i <= cnt; i++) printf( %d %d n , ans[i].first, ans[i].second); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; vector<long long int> v; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; v.push_back(x); } long long int z; long long int count = 1; for (long long int i = 0;; i++) { if (n == count) { z = i; break; } else count *= 4; } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); long long int prev = 0; long long int end = 1; vector<long long int> ans; while (prev < n) { long long int sum = 0; for (long long int j = prev; j < end; j++) sum += v[j]; ans.push_back(sum); sum = 0; prev = end; end *= 4; } long long int fin = 0; long long int calc = z + 1; for (long long int j = 0; j < ans.size(); j++) { fin += ans[j] * calc; calc--; } cout << fin; return 0; }
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { while (b) { a %= b; swap(a, b); } return a; } long long lcm(const long long &a, const long long &b) { return (a / gcd(a, b)) * b; } bool check(long long a) { int k = 0; while (a > 0) { if (!(a & 1)) { k++; } a >>= 1; } return k == 1; } int bits(long long a) { int k = 0; if (a == 0) { return 1; } while (a > 0) { k++; a >>= 1; } return k; } int main() { int h, w; cin >> h >> w; char c; vector<vector<int>> a(h + 2, vector<int>(w + 2, 1)); for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { cin >> c; if (c == . ) { a[i][j] = 0; } else a[i][j] = 1; } } vector<vector<pair<int, int>>> v(h + 2, vector<pair<int, int>>(w + 2)); for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { v[i][j].first = v[i][j - 1].first + (a[i][j - 1] + a[i][j] == 0 ? 1 : 0); } } for (int j = 1; j <= w; j++) { for (int i = 1; i <= h; i++) { v[i][j].second = v[i - 1][j].second + (a[i - 1][j] + a[i][j] == 0 ? 1 : 0); } } int q; cin >> q; int l1, r1, l2, r2; int ans = 0, s1, s2; for (int i = 0; i < q; i++) { cin >> l1 >> r1 >> l2 >> r2; ans = 0; s1 = 0; s2 = 0; for (int j = l1; j <= l2; j++) { s1 = v[j][r2].first - v[j][r1].first; ans += s1; } for (int j = r1; j <= r2; j++) { s2 = v[l2][j].second - v[l1][j].second; ans += s2; } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, m; cin >> n >> m; vector<int> v[n + 1]; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; v[a].push_back(b); } int cnt[n + 1]; for (int o = 1; o <= n; o++) { for (int i = 0; i < (int)v[o].size(); i++) { if (o < v[o][i]) v[o][i] -= o; else v[o][i] = n - (o - v[o][i]); } sort(v[o].begin(), v[o].end()); if (!v[o].empty()) cnt[o] = ((v[o].size() - 1) * n + v[o][0]); else cnt[o] = 0; } for (int o = 1; o <= n; o++) { int res = cnt[o]; int mv = 0; for (int i = o + 1;; i++) { mv++; if (i == n + 1) i = 1; if (i == o) break; res = max(res, (cnt[i] != 0) * (cnt[i] + mv)); } cout << res << ; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } struct SegTree { long long tree[4 * 200005]; long long lazy[4 * 200005]; void push(long long node) { tree[2 * node + 1] += lazy[node]; tree[2 * node + 2] += lazy[node]; lazy[2 * node + 1] += lazy[node]; lazy[2 * node + 2] += lazy[node]; lazy[node] = 0; } void build(vector<long long> &a, long long node, long long start, long long end) { if (start == end) { tree[node] = a[start]; return; } long long mid = (start + end) >> 1; build(a, 2 * node + 1, start, mid); build(a, 2 * node + 2, mid + 1, end); tree[node] = min(tree[2 * node + 1], tree[2 * node + 2]); } void rupd(long long node, long long start, long long end, long long l, long long r, long long val) { if (r < start || l > end) return; if (l <= start && end <= r) { tree[node] += val; lazy[node] += val; return; } push(node); long long mid = (start + end) >> 1; rupd(2 * node + 1, start, mid, l, r, val); rupd(2 * node + 2, mid + 1, end, l, r, val); tree[node] = min(tree[2 * node + 1], tree[2 * node + 2]); } long long rquery(long long node, long long start, long long end, long long l, long long r) { if (r < start || l > end) return 1000000000000005; if (l <= start && end <= r) return tree[node]; push(node); long long mid = (start + end) >> 1; long long p1 = rquery(2 * node + 1, start, mid, l, r); long long p2 = rquery(2 * node + 2, mid + 1, end, l, r); return min(p1, p2); } } st; void solve() { long long n; cin >> n; vector<long long> p(n); vector<long long> rp(n); for (long long i = 0; i < n; i++) { cin >> p[i]; p[i]--; rp[p[i]] = i; } vector<long long> a(n); for (long long i = 0; i < n; i++) cin >> a[i]; vector<long long> b(n); b[0] = a[0]; for (long long i = 1; i < n; i++) { b[i] = b[i - 1] + a[i]; } st.build(b, 0, 0, n - 1); long long ans = st.rquery(0, 0, n - 1, 0, n - 1); for (long long i = 0; i < (n); i++) { long long pos = rp[i]; st.rupd(0, 0, n - 1, pos, n - 1, -a[pos]); if (pos) st.rupd(0, 0, n - 1, 0, pos - 1, a[pos]); ans = min(ans, st.rquery(0, 0, n - 1, 0, n - 2)); } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long tests; tests = 1; for (long long i = 0; i < tests; i++) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e4 + 10; int b[MAXN], n, a[MAXN]; int ID(int x) { x = x % n; if (x < 0) x += n; return x; } int main(void) { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , a + i); vector<pair<int, int> > foo; for (int i = 0; i < n; ++i) foo.push_back(make_pair(a[i] + a[ID(i + 1)], i)); sort(foo.begin(), foo.end()); for (int i = 0; i < n; ++i) b[foo[i].second] = i; printf( %d , b[0]); for (int i = 1; i < n; ++i) printf( %d , b[i]); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ex[n], e[n]; int temp = n; int i = 0; while (temp--) { cin >> ex[i] >> e[i]; i++; } int sum = e[0], m = e[0]; for (int j = 1; j < n; j++) { sum = sum - ex[j] + e[j]; if (sum > m) { m = sum; } } cout << m << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 300050; const int L = 19; const long long inf = 1e15; vector<int> E[N]; int par[N][L], dep[N]; void DFS(int u, int p) { dep[u] = dep[p] + 1; par[u][0] = p; for (int i = 1; i < L; i++) par[u][i] = par[par[u][i - 1]][i - 1]; for (int v : E[u]) if (v != p) DFS(v, u); } int LCA(int u, int v) { if (dep[u] < dep[v]) return LCA(v, u); for (int i = L - 1; ~i; i--) if (dep[par[u][i]] >= dep[v]) u = par[u][i]; for (int i = L - 1; ~i; i--) if (par[u][i] != par[v][i]) u = par[u][i], v = par[v][i]; return u == v ? v : par[v][0]; } vector<pair<int, int> > up[N]; bool ok[N]; long long dp[N]; int hi[N]; set<pair<long long, int> > st[N]; pair<long long, int> operator+(pair<long long, int> a, long long b) { a.first += b; return a; } long long st_add[N], ans; void Solve(int u, int p) { int nok = 0; long long sum = 0; hi[u] = dep[u]; for (int v : E[u]) if (v != p) Solve(v, u), nok += !ok[v], sum += ok[v] ? dp[v] : 0, hi[u] = min(hi[u], hi[v]); if (nok) { ok[u] = 0; } else { for (int v : E[u]) if (v != p) { if (st[u].size() < st[v].size()) st[u].swap(st[v]), swap(st_add[u], st_add[v]); for (auto p : st[v]) st[u].insert(p + (st_add[v] - st_add[u])); } dp[u] = sum; for (auto p : up[u]) st[u].insert(make_pair(p.second, dep[p.first]) + (-st_add[u])); if (hi[u] == dep[u]) { while (st[u].size() && st[u].begin()->second >= dep[u]) st[u].erase(st[u].begin()); if (st[u].empty()) ok[u] = 0; else { ok[u] = 1; dp[u] += st[u].begin()->first + st_add[u]; hi[u] = st[u].begin()->second; st_add[u] -= st[u].begin()->first + st_add[u]; st[u].erase(st[u].begin()); } } else ok[u] = 1; } if (u == 1) ans = nok == 0 ? sum : -1; } int main() { int n, m, i, u, v, c; scanf( %i %i , &n, &m); for (i = 1; i < n; i++) scanf( %i %i , &u, &v), E[u].push_back(v), E[v].push_back(u); DFS(1, 0); for (i = 1; i <= m; i++) scanf( %i %i %i , &u, &v, &c), up[u].push_back(make_pair(LCA(u, v), c)); Solve(1, 0); printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const int MAXB = 10; const int MAXN = 1025; vector<int> distGroup[MAXN]; int hasDist[MAXN]; int predecessor[MAXN]; vector<int> output; set<int> centers; string result, resultm; int maxDist[MAXN]; int minDist[MAXN]; vector<string> strangeresults; int main() { int N; cin >> N; for (int i = (0); i < (N); i++) minDist[i] = 1; for (int i = (0); i < (N); i++) maxDist[i] = (1 << MAXB) - 1; for (int i = (0); i < (N); i++) hasDist[i] = -1; for (int i = (0); i < (N); i++) distGroup[i].clear(); distGroup[0].push_back(0); maxDist[0] = minDist[0] = hasDist[0] = 0; int largest = 0; for (int p = int(MAXB) - 1; p >= (0); p--) { for (int s = (0); s < (2); s++) { output = vector<int>(N, 0); centers.clear(); for (int i = (s << (p + 1)); true; i += (4 << p)) { if (i > N || int((distGroup[i]).size()) == 0) break; for (auto n : distGroup[i]) { assert(output[n] == 0); output[n] = (1 << p); } centers.insert(i); } if (int((centers).size()) > 0) { cout << ? ; for (auto v : output) cout << << min(N - 1, v); cout << endl << flush; cin >> result; cout << ? ; for (auto v : output) cout << << max(0, min(N - 1, v - 1)); cout << endl << flush; cin >> resultm; while (int((result).size()) != N || int((resultm).size()) != N) { cerr << VERY STRANGE!! got << result << and << resultm << as results << endl << flush; strangeresults.push_back(result); strangeresults.push_back(resultm); if (int((strangeresults).size()) == (N - 1) * 2) { cout << ! << endl; for (int i = (0); i < (N - 1); i++) cout << strangeresults[i * 2] << << strangeresults[i * 2 + 1] << endl; return 0; } cout << ? ; for (auto v : output) cout << << min(N - 1, v); cout << endl << flush; cin >> result; cout << ? ; for (auto v : output) cout << << max(0, min(N - 1, v - 1)); cout << endl << flush; cin >> resultm; } for (int i = (0); i < (N); i++) { if (minDist[i] == maxDist[i]) continue; if (centers.find(minDist[i] - 1) != centers.end()) { if (result[i] == 1 ) { if (resultm[i] == 1 ) { maxDist[i] -= (1 << p); } else { minDist[i] = maxDist[i] = minDist[i] - 1 + (1 << p); } } else minDist[i] += (1 << p); } if (minDist[i] == maxDist[i]) { hasDist[i] = minDist[i]; largest = max(largest, minDist[i]); distGroup[minDist[i]].push_back(i); } } } } } for (int i = (0); i < (N); i++) predecessor[i] = -1; for (int i = (0); i < (N); i++) assert(minDist[i] == maxDist[i] && maxDist[i] == hasDist[i]); for (int a = (0); a < (2); a++) { vector<string> results; for (int b = (0); b < (MAXB); b++) { for (int xo = (0); xo < (2); xo++) { cout << ? ; for (int n = (0); n < (N); n++) { if (((hasDist[n] >> 1) ^ a) & 1) cout << << (((n >> b) ^ xo) & 1); else cout << 0 ; } cout << endl << flush; string tmp; cin >> tmp; results.push_back(tmp); } } for (int d = (0); d < (largest); d++) { if (((d >> 1) ^ a ^ 1) & 1) continue; for (auto n1 : distGroup[d]) for (auto n2 : distGroup[d + 1]) { bool ok = true; for (int b = (0); b < (MAXB); b++) { if (results[b * 2 + (1 ^ ((n1 >> b) & 1))][n2] == 0 ) ok = false; } if (ok) { if (predecessor[n2] != -1) { cerr << prev predecessor[ << n2 << ]= << predecessor[n2] << endl; cerr << predecessor[n2] << endl; } assert(predecessor[n2] == -1); predecessor[n2] = n1; } } } } assert(predecessor[0] == -1); for (int i = (1); i < (N); i++) assert(predecessor[i] != -1); cout << ! << endl << flush; for (int i = (1); i < (N); i++) cout << predecessor[i] + 1 << << i + 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long ans = 0; string s; int main() { ios_base::sync_with_stdio(false); cin >> s; int id = -1; for (int i = 0; i < (int)s.length(); i++) { for (int j = 1; j <= 4 && i - 2 * j >= 0; j++) if (s[i] == s[i - j] && s[i - j] == s[i - 2 * j]) id = max(id, i - 2 * j); ans += id + 1; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { char ch; int state = 0; while ((ch = cin.get()) != EOF) switch (state) { case 0: if (isdigit(ch)) { cout << ch; state = 1; } if (ch == , ) { cout << ch; state = 2; } if (ch == ) { state = 0; } if (ch == . ) { cout << ch; state = 3; } break; case 1: if (isdigit(ch)) { cout << ch; state = 1; } if (ch == , ) { cout << ch; state = 2; } if (ch == ) { state = 6; } if (ch == . ) { cout << ; cout << ch; state = 3; } break; case 2: if (isdigit(ch)) { cout << ; cout << ch; state = 1; } if (ch == , ) { cout << ; cout << ch; state = 2; } if (ch == ) { state = 2; } if (ch == . ) { cout << ; cout << ch; state = 3; } break; case 3: if (ch == . ) { cout << ch; state = 4; } break; case 4: if (ch == . ) { cout << ch; state = 5; } break; case 5: if (isdigit(ch)) { cout << ch; state = 1; } if (ch == , ) { cout << ch; state = 2; } if (ch == ) { state = 5; } if (ch == . ) { cout << ; cout << ch; state = 3; } break; case 6: if (isdigit(ch)) { cout << ; cout << ch; state = 1; } if (ch == , ) { cout << ch; state = 2; } if (ch == ) { state = 6; } if (ch == . ) { cout << ; cout << ch; state = 3; } break; } exit: return (0); }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MN = 105; bool mark[500][500]; char s[MN]; int dis[500][500]; int ask(pair<int, int> now) { int res = INF; if (mark[now.first][now.second]) res = min(res, dis[now.first][now.second]); if (mark[now.first - 1][now.second]) res = min(res, dis[now.first - 1][now.second] + 1); if (mark[now.first + 1][now.second]) res = min(res, dis[now.first + 1][now.second] + 1); if (mark[now.first][now.second - 1]) res = min(res, dis[now.first][now.second - 1] + 1); if (mark[now.first][now.second + 1]) res = min(res, dis[now.first][now.second + 1] + 1); return res; } int main() { scanf( %s , s); int l = strlen(s); pair<int, int> now = make_pair(105, 105); mark[105][105] = 1; dis[105][105] = 0; int len = 0; for (int i = 0; i < l; ++i) { ++len; if (s[i] == U ) now.second += 1; if (s[i] == D ) now.second -= 1; if (s[i] == L ) now.first -= 1; if (s[i] == R ) now.first += 1; if (ask(now) < len) { printf( BUG n ); return 0; } mark[now.first][now.second] = 1; dis[now.first][now.second] = len; } printf( OK n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 5; const int inf = 1e9 + 7; vector<pair<int, int> > adj[MAXN]; int dp[MAXN][MAXN], tr[MAXN][MAXN]; int n, m, t; int solve(int u, int len) { if (u == n and !len) return 0; if (!len) return inf; if (dp[u][len] != -1) return dp[u][len]; int ret = inf; for (int i = 0; i < ((int)adj[u].size()); i++) { int v = adj[u][i].first; int c = adj[u][i].second; long long x = solve(v, len - 1) + c; if (x < ret) ret = x, tr[u][len] = v; } return dp[u][len] = ret; } void process() { memset(dp, -1, sizeof(dp)); for (int i = 5000; i >= 0; i--) { int ans = solve(1, i); if (ans <= t) { printf( %d n%d , i + 1, 1); int x = 1; while (i--) { x = tr[x][i + 1]; printf( %d , x); } } } } int main(void) { scanf( %d%d%d , &n, &m, &t); for (int u, v, c, i = 1; i <= m; i++) { scanf( %d%d%d , &u, &v, &c); adj[u].push_back(make_pair(v, c)); } process(); }
#include <bits/stdc++.h> int main() { int i, n, x = 2; scanf( %d , &n); for (i = 0; i < n - 1; i++) { printf( %d , x); x += (2 + i); if (x > n) x -= n; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long N, x, y, input, r_code = 0; cin >> N >> x >> y; vector<unsigned long long> days; for (unsigned long long i = 0; i < N; i++) { cin >> input; days.push_back(input); } unsigned long long temp1; for (unsigned long long i = 0; i < N; i++) { r_code = 0; if (i < x) { temp1 = 0; } else temp1 = x; for (unsigned long long j = 1; j <= temp1; j++) { if (days[i - j] <= days[i]) { r_code = 1; break; } } if (r_code == 0) { unsigned long long temp; if (i + y >= N) { temp = N - 1; } else temp = i + y; for (unsigned long long j = i + 1; j <= temp; j++) { if (days[j] <= days[i]) { r_code = 1; break; } } } if (r_code == 0) { cout << (i + 1); break; } } }
#include <bits/stdc++.h> using namespace std; int lim = 1e6; int inf = 1e8; void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << t ; err(++it, args...); } template <typename T1, typename T2> ostream& operator<<(ostream& c, pair<T1, T2>& v) { c << ( << v.first << , << v.second << ) ; return c; } template <template <class...> class TT, class... T> ostream& operator<<(ostream& out, TT<T...>& c) { out << { ; for (auto& x : c) out << x << ; out << } ; return out; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int ans = 0; for (int i = 6; i >= 0; i--) { int k = pow(2, i); int j = 0; vector<int> a, b; for (int r = 1; r <= n; r++) { if ((r / k) % 2 == 0) { a.push_back(r); } else { b.push_back(r); } } if (a.size() == 0 or b.size() == 0) continue; cout << a.size() << << b.size() << ; for (int j = 0; j < a.size(); j++) { cout << a[j] << ; } for (int j = 0; j < b.size(); j++) { cout << b[j] << ; } cout << endl; int tmpans; cin >> tmpans; ans = max(ans, tmpans); } cout << -1 << << ans << endl; } }
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; map<char, long long> mp; for (long long i = 0; i < s.size(); i++) mp[s[i]]++; long long c = 0; for (auto it = mp.begin(); it != mp.end(); it++) { if (it->second & 1) c++; } if (c <= 1) cout << First ; else { if (c % 2 == 0) cout << Second ; else cout << First ; } } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 300001; set<pair<long long int, long long int> >* T[N]; int A[N]; int S[N]; char s[N]; vector<int> adj[N]; long long int MOD1 = 1000000007LL; long long int MOD2 = 1000000009LL; void dfs(int st, int p = -1, long long int hash1 = 0LL, long long int hash2 = 0LL) { hash1 = (hash1 * 257LL + s[st] - a + 1) % MOD1; hash2 = (hash2 * 43LL + s[st] - a + 1) % MOD2; S[st] = 1; int mx = -1; for (auto c : adj[st]) { if (c != p) { dfs(c, st, hash1, hash2); S[st] += S[c]; if (mx == -1 || S[mx] < S[c]) mx = c; } } set<pair<long long int, long long int> >* root; if (mx == -1) root = new set<pair<long long int, long long int> >; else { root = T[mx]; for (auto c : adj[st]) { if (c != p && c != mx) root->insert(T[c]->begin(), T[c]->end()); } } root->insert({hash1, hash2}); T[st] = root; A[st] += T[st]->size(); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , A + i); } scanf( %s , s + 1); for (int i = 1; i <= n - 1; i++) { int u, v; scanf( %d%d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } dfs(1); int mxc = 0, mx = 1; for (int i = 1; i <= n; i++) { if (mx == A[i]) mxc++; else if (mx < A[i]) mx = A[i], mxc = 1; } printf( %d n%d n , mx, mxc); return 0; }
#include <bits/stdc++.h> using namespace std; long long int solve(string &s, vector<vector<long long int> > &pre, vector<vector<long long int> > &dp, long long int st, long long int en, long long int a, long long int b) { if (st > en) { return 0; } if (dp[st][en] != -1) { return dp[st][en]; } long long int val = solve(s, pre, dp, st + 1, en, a, b) + a; for (long long int i = st; i < pre[st][0] + st; i++) { val = min(val, solve(s, pre, dp, i + 1, en, a, b) + b); } dp[st][en] = val; return val; } void getZarr(string str, int Z[]); long long int get_len(string &text, string &pattern) { string concat = pattern + $ + text; int l = concat.length(); int Z[l]; getZarr(concat, Z); long long int ans = 0; for (int i = pattern.length() + 1; i < l; ++i) { ans = max(ans, (long long int)Z[i]); } return ans; } void getZarr(string str, int Z[]) { int n = str.length(); int L, R, k; L = R = 0; for (int i = 1; i < n; ++i) { if (i > R) { L = R = i; while (R < n && str[R - L] == str[R]) R++; Z[i] = R - L; R--; } else { k = i - L; if (Z[k] < R - i + 1) Z[i] = Z[k]; else { L = i; while (R < n && str[R - L] == str[R]) R++; Z[i] = R - L; R--; } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, a, b; cin >> n >> a >> b; string s; cin >> s; vector<vector<long long int> > pre(n + 1, vector<long long int>(1, -1)), dp(n + 1, vector<long long int>(n + 1, -1)); string s1 = ; for (long long int l = 1; l < n; l++) { long long int min1 = min(l, n - l); s1 += s[l - 1]; string s2 = ; for (long long int idx = l; idx < (l + min1); idx++) { s2 += s[idx]; } long long int len = get_len(s1, s2); pre[l][0] = len; } cout << solve(s, pre, dp, 0, n - 1, a, b) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e5 + 1; const long long INF = 1e9 + 1; const long long MOD = 1e9; const long long BITS = 64; const long double EPS = 1e-12; void bye() { cout << n ; exit(0); } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; vector<int> cnt(k); for (int i = 0; i < (long long)(s).size(); i++) { cnt[s[i] - A ]++; } cout << *min_element((cnt).begin(), cnt.end()) * k; bye(); }
#include <bits/stdc++.h> using namespace std; const int nmax = 110; int x[nmax]; char g[nmax][nmax]; int pos[nmax * nmax][2]; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); int q; scanf( %d , &q); for (int i = 0; i < q; ++i) { scanf( %d , &x[i]); } bool swapped = false; if (b < d) { swap(b, d); swap(a, c); swapped = true; } int n = b; int m = a + c; memset(g, . , sizeof(g)); int k = 0; for (int j = 0; j < m; ++j) { if (((j ^ a) & 1) == 0) { for (int i = 0; i < (j < a ? b : d); ++i) { pos[k][0] = i; pos[k][1] = j; ++k; } } else { for (int i = (j < a ? b : d) - 1; i >= 0; --i) { pos[k][0] = i; pos[k][1] = j; ++k; } } } int cnt = 0; for (int i = 0; i < q; ++i) { for (int j = 0; j < x[i]; ++j) { g[pos[cnt][0]][pos[cnt][1]] = a + (char)i; ++cnt; } } if (swapped) { for (int i = 0; i < n; ++i) { reverse(g[i], g[i] + m); } } puts( YES ); for (int i = 0; i < n; ++i) { g[i][m] = 0; puts(g[i]); } return 0; }
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + c - 0 ; c = getchar(); } return f ? -ret : ret; } using namespace std; const int MAXN = 100; long long int f[MAXN + 10][2]; char s[MAXN + 10]; int main() { scanf( %s , s + 1); int n = strlen(s + 1); f[1][0] = 1; for (int i = 2; i <= n; ++i) { if (s[i - 1] == A ) f[i][0] += f[i - 1][0]; if (s[i - 1] == B && s[i] == A ) f[i][1] += f[i - 1][0]; if (s[i] == B ) f[i][1] += f[i - 1][1]; f[i][0] += f[i - 1][1]; } long long int ans = f[n][1]; if (s[n] == A ) ans += f[n][0]; memset(f, 0, sizeof f); f[1][1] = 1; for (int i = 2; i <= n; ++i) { if (s[i - 1] == A ) f[i][0] += f[i - 1][0]; if (s[i - 1] == B && s[i] == A ) f[i][1] += f[i - 1][0]; if (s[i] == B ) f[i][1] += f[i - 1][1]; f[i][0] += f[i - 1][1]; } if (s[1] == B ) ans += f[n][1]; else if (s[n] == B ) ans += f[n][0]; printf( %I64d n , ans); }
#include <bits/stdc++.h> using namespace std; const int N = 109; const int INF = 1e9; char zbs[5] = { R , G , B , Y , W }; pair<int, int> a[N]; int main() { int n, ans = 11; cin >> n; for (int i = 0; i < int(n); ++i) { char t1, t2; cin >> t1 >> t2; a[i].second = int(t2 - 1 ); for (int j = 0; j < int(5); ++j) if (zbs[j] == t1) a[i].first = j; } for (int mask1 = 0; mask1 < int(1 << 5); ++mask1) { for (int mask2 = 0; mask2 < int(1 << 5); ++mask2) { int m[5][5], na = 0, ok = 1; memset(m, 0, sizeof(m)); for (int i = 0; i < int(5); ++i) { if (mask1 & (1 << i)) ++na; if (mask2 & (1 << i)) ++na; } for (int i = 0; i < int(n); ++i) m[a[i].first][a[i].second] = 1; for (int i1 = 0; i1 < int(5); ++i1) for (int j1 = 0; j1 < int(5); ++j1) for (int i2 = 0; i2 < int(5); ++i2) for (int j2 = 0; j2 < int(5); ++j2) { bool ok1 = 0; if (m[i1][j1] * m[i2][j2] == 0) continue; if (i1 == i2 && j1 == j2) continue; if (i1 != i2 && ((mask1 & (1 << i1)) || (mask1 & (1 << i2)))) ok1 = 1; if (j1 != j2 && ((mask2 & (1 << j1)) || (mask2 & (1 << j2)))) ok1 = 1; if (ok) ok = ok1; } if (ok) ans = min(na, ans); } } cout << ans; }
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> g[100001]; bool is_centroid[100001]; int centroid_parent[100001]; int mn[100001]; int sz[100001]; int level[100001]; int centroid_root; map<pair<int, int>, int> dist; void dfs(int nd, int p, int c) { sz[nd] = 1; if (p == c) { level[nd] = 0; } else { level[nd] = level[p] + 1; } dist[make_pair(nd, c)] = level[nd] + 1; for (int i = 0; i < g[nd].size(); i++) { int z = g[nd][i]; if (z != p && !is_centroid[z]) { dfs(z, nd, c); sz[nd] += sz[z]; } } } int pd; int find_centroid(int u, int ts) { for (int i = 0; i < g[u].size(); i++) { int z = g[u][i]; if (is_centroid[z] || sz[z] > sz[u]) continue; if (sz[z] > ts / 2) return find_centroid(z, ts); } return u; } int get_centroid(int nd, int p) { dfs(nd, p, p); int u = find_centroid(nd, sz[nd]); is_centroid[u] = true; centroid_parent[u] = p; for (int i = 0; i < g[u].size(); i++) { int z = g[u][i]; if (!is_centroid[z]) { get_centroid(z, u); } } return u; } void centroid_decompose() { fill(is_centroid, is_centroid + 100001, false); centroid_root = get_centroid(1, -1); } void debug() { for (int i = 1; i <= n; i++) { cout << i << << centroid_parent[i] << << mn[i] << endl; } } void redify(int u) { int x = u; while (u != -1) { mn[u] = min(dist[make_pair(x, u)], mn[u]); u = centroid_parent[u]; } } int solve(int u) { int res = INT_MAX / 3; int x = u; while (u != -1) { res = min(res, dist[make_pair(x, u)] + mn[u]); u = centroid_parent[u]; } return res; } int main() { int u, v; scanf( %d %d , &n, &m); for (int i = 0; i < n - 1; i++) { scanf( %d %d , &u, &v); g[u].push_back(v); g[v].push_back(u); } fill(mn, mn + 100001, INT_MAX / 3); centroid_decompose(); redify(1); while (m--) { scanf( %d %d , &u, &v); if (u == 1) { redify(v); } else { printf( %d n , solve(v)); } } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; vector<int> v[5 * maxn]; int t[5 * maxn]; int comp[5 * maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n = 0, m = 0, x = 0, y = 0; cin >> n >> m; for (int i = 0; i < m; ++i) { cin >> x >> y; --x; --y; v[x].push_back(y); v[y].push_back(x); } vector<int> aux; for (int i = 0; i < n; ++i) { cin >> t[i]; comp[i] = 1; if (t[i] == comp[i]) aux.push_back(i); } bool flag = false; for (int i = 0; i < (int)aux.size(); ++i) { int node = aux[i]; if (comp[node] != t[node]) flag = true; for (auto j : v[node]) { if (comp[j] == t[node]) { ++comp[j]; if (comp[j] == t[j]) aux.push_back(j); } } } if ((int)aux.size() < n) flag = true; if (flag) cout << -1 ; else { for (auto i : aux) { cout << (i + 1) << ; } } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 3005, MAXM = 55; const double inf = 1e9 + 5; vector<int> graph[MAXN]; double c[MAXN][MAXN]; int f[MAXN][MAXN]; priority_queue<pair<double, int> > q; double dist[MAXN]; int last[MAXN]; int n, Q; int upperBound[MAXM], lowerBound[MAXM]; int arrayNode[MAXM]; int dispenserNode[MAXM][MAXM]; int startNode[MAXM], endNode[MAXM]; int S = 3001, T = 3002; void addEdge(int u, int v, int flow, double cost) { graph[u].push_back(v); graph[v].push_back(u); f[u][v] = flow; c[u][v] = cost; c[v][u] = cost; } double Dijkstra(int s, int t) { for (int i = 0; i < MAXN; i++) { dist[i] = inf; } dist[s] = 0; int u; q.push({0, s}); while (q.empty() == false) { u = q.top().second; q.pop(); for (int i = 0; i < graph[u].size(); i++) { if (f[u][graph[u][i]] != 0 && dist[graph[u][i]] > dist[u] + c[u][graph[u][i]]) { dist[graph[u][i]] = dist[u] + c[u][graph[u][i]]; last[graph[u][i]] = u; q.push({-dist[graph[u][i]], graph[u][i]}); } } } return dist[t]; } pair<int, double> minCostMaxFlow(int s, int t) { int maxFlow = 0; double minCost = 0; while (true) { double cost = Dijkstra(s, t); if (cost == inf) break; int u = t; int flow = inf; while (u != s) { flow = min(flow, f[last[u]][u]); u = last[u]; } u = t; while (u != s) { f[last[u]][u] -= flow; f[u][last[u]] += flow; u = last[u]; } maxFlow += flow; minCost += cost * flow; } return {maxFlow, minCost}; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> Q; for (int i = 1; i <= n; i++) { lowerBound[i] = 1; upperBound[i] = n; } while (Q--) { int type; int l, r, v; cin >> type; cin >> l >> r >> v; if (type == 1) { for (int i = l; i <= r; i++) { lowerBound[i] = max(lowerBound[i], v); } } else { for (int i = l; i <= r; i++) { upperBound[i] = min(upperBound[i], v); } } } for (int i = 1; i <= n; i++) { if (lowerBound[i] > upperBound[i]) { cout << -1 << n ; return 0; } } int node = 1; for (int i = 1; i <= n; i++) { startNode[i] = node; node++; } for (int i = 1; i <= n; i++) { endNode[i] = node; node++; } for (int i = 1; i <= n; i++) { arrayNode[i] = node; node++; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { dispenserNode[i][j] = node; node++; } } for (int i = 1; i <= n; i++) { addEdge(S, startNode[i], n, 0); } for (int i = 1; i <= n; i++) { int value = 1, sum = 0; for (int j = 1; j <= n; j++) { addEdge(startNode[i], dispenserNode[i][j], 1, j * j - sum); addEdge(dispenserNode[i][j], endNode[i], 1, 0); sum += j * j - sum; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i >= lowerBound[j] && i <= upperBound[j]) { addEdge(endNode[i], arrayNode[j], 1, 0); } } } for (int i = 1; i <= n; i++) { addEdge(arrayNode[i], T, 1, 0); } cout << minCostMaxFlow(S, T).second << n ; }
#include <bits/stdc++.h> using namespace std; int dp[513]; int n, m; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , &dp[i + 1]); } double best = 0; for (int i = 0; i < m; ++i) { int x, y, z; scanf( %d %d %d , &x, &y, &z); best = max(best, ((double)dp[x] + dp[y]) / z); } printf( %.9lf , best); return 0; }
/* ⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠸⣿⣿⣆⠹⣿⣿⢾⣟⣯⣿⣿⣿⣿⣿⣿⣽⣻⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣻⣽⡿⣿⣎⠙⣿⣞⣷⡌⢻⣟⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣿⣿⡄⠹⣿⣿⡆⠻⣿⣟⣯⡿⣽⡿⣿⣿⣿⣿⣽⡷⣯⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣟⣷⣿⣿⣿⡀⠹⣟⣾⣟⣆⠹⣯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢠⡘⣿⣿⡄⠉⢿⣿⣽⡷⣿⣻⣿⣿⣿⣿⡝⣷⣯⢿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣯⢿⣾⢿⣿⡄⢄⠘⢿⣞⡿⣧⡈⢷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢸⣧⠘⣿⣷⠈⣦⠙⢿⣽⣷⣻⣽⣿⣿⣿⣿⣌⢿⣯⢿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣟⣯⣿⢿⣿⡆⢸⡷⡈⢻⡽⣷⡷⡄⠻⣽⣿⣿⡿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣏⢰⣯⢷⠈⣿⡆⢹⢷⡌⠻⡾⢋⣱⣯⣿⣿⣿⣿⡆⢻⡿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⡎⣿⢾⡿⣿⡆⢸⣽⢻⣄⠹⣷⣟⣿⣄⠹⣟⣿⣿⣟⣿⣿⣿⣿⣿⣿⣽⣿⣿⣿⡇⢸⣯⣟⣧⠘⣷⠈⡯⠛⢀⡐⢾⣟⣷⣻⣿⣿⣿⡿⡌⢿⣻⣿⣿ ⣿⣿⣿⣿⣿⣿⣧⢸⡿⣟⣿⡇⢸⣯⣟⣮⢧⡈⢿⣞⡿⣦⠘⠏⣹⣿⣽⢿⣿⣿⣿⣿⣯⣿⣿⣿⡇⢸⣿⣿⣾⡆⠹⢀⣠⣾⣟⣷⡈⢿⣞⣯⢿⣿⣿⣿⢷⠘⣯⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⡈⣿⢿⣽⡇⠘⠛⠛⠛⠓⠓⠈⠛⠛⠟⠇⢀⢿⣻⣿⣯⢿⣿⣿⣿⣷⢿⣿⣿⠁⣾⣿⣿⣿⣧⡄⠇⣹⣿⣾⣯⣿⡄⠻⣽⣯⢿⣻⣿⣿⡇⢹⣾⣿ ⣿⣿⣿⣿⣿⣿⣿⡇⢹⣿⡽⡇⢸⣿⣿⣿⣿⣿⣞⣆⠰⣶⣶⡄⢀⢻⡿⣯⣿⡽⣿⣿⣿⢯⣟⡿⢀⣿⣿⣿⣿⣿⣧⠐⣸⣿⣿⣷⣿⣿⣆⠹⣯⣿⣻⣿⣿⣿⢀⣿⢿ ⣿⣿⣿⣿⣿⣿⣿⣿⠘⣯⡿⡇⢸⣿⣿⣿⣿⣿⣿⣿⣧⡈⢿⣳⠘⡄⠻⣿⢾⣽⣟⡿⣿⢯⣿⡇⢸⣿⣿⣿⣿⣿⣿⡀⢾⣿⣿⣿⣿⣿⣿⣆⠹⣾⣷⣻⣿⡿⡇⢸⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⡇⢹⣿⠇⢸⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄⠻⡇⢹⣆⠹⣟⣾⣽⣻⣟⣿⣽⠁⣾⣿⣿⣿⣿⣿⣿⣇⣿⣿⠿⠛⠛⠉⠙⠋⢀⠁⢘⣯⣿⣿⣧⠘⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⡈⣿⡃⢼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⡙⠌⣿⣆⠘⣿⣞⡿⣞⡿⡞⢠⣿⣿⣿⣿⣿⡿⠛⠉⠁⢀⣀⣠⣤⣤⣶⣶⣶⡆⢻⣽⣞⡿⣷⠈⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠘⠁⠉⠉⠉⠉⠉⠉⠉⠉⠉⠙⠛⠛⢿⣄⢻⣿⣧⠘⢯⣟⡿⣽⠁⣾⣿⣿⣿⣿⣿⡃⢀⢀⠘⠛⠿⢿⣻⣟⣯⣽⣻⣵⡀⢿⣯⣟⣿⢀⣿ ⣿⣿⣿⣟⣿⣿⣿⣿⣶⣶⡆⢀⣿⣾⣿⣾⣷⣿⣶⠿⠚⠉⢀⢀⣤⣿⣷⣿⣿⣷⡈⢿⣻⢃⣼⣿⣿⣿⣿⣻⣿⣿⣿⡶⣦⣤⣄⣀⡀⠉⠛⠛⠷⣯⣳⠈⣾⡽⣾⢀⣿ ⣿⢿⣿⣿⣻⣿⣿⣿⣿⣿⡿⠐⣿⣿⣿⣿⠿⠋⠁⢀⢀⣤⣾⣿⣿⣿⣿⣿⣿⣿⣿⣌⣥⣾⡿⣿⣿⣷⣿⣿⢿⣷⣿⣿⣟⣾⣽⣳⢯⣟⣶⣦⣤⡾⣟⣦⠘⣿⢾⡁⢺ ⣿⣻⣿⣿⡷⣿⣿⣿⣿⣿⡗⣦⠸⡿⠋⠁⢀⢀⣠⣴⢿⣿⣽⣻⢽⣾⣟⣷⣿⣟⣿⣿⣿⣳⠿⣵⣧⣼⣿⣿⣿⣿⣿⣾⣿⣿⣿⣿⣿⣽⣳⣯⣿⣿⣿⣽⢀⢷⣻⠄⠘ ⣿⢷⣻⣿⣿⣷⣻⣿⣿⣿⡷⠛⣁⢀⣀⣤⣶⣿⣛⡿⣿⣮⣽⡻⣿⣮⣽⣻⢯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣯⢀⢸⣿⢀⡆ ⠸⣟⣯⣿⣿⣷⢿⣽⣿⣿⣷⣿⣷⣆⠹⣿⣶⣯⠿⣿⣶⣟⣻⢿⣷⣽⣻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢀⣯⣟⢀⡇ ⣇⠹⣟⣾⣻⣿⣿⢾⡽⣿⣿⣿⣿⣿⣆⢹⣶⣿⣻⣷⣯⣟⣿⣿⣽⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⢀⡿⡇⢸⡇ ⣿⣆⠹⣷⡻⣽⣿⣯⢿⣽⣻⣿⣿⣿⣿⣆⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠇⢸⣿⠇⣼⡇ ⡙⠾⣆⠹⣿⣦⠛⣿⢯⣷⢿⡽⣿⣿⣿⣿⣆⠻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠃⠎⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠏⢀⣿⣾⣣⡿⡇ ⣿⣷⡌⢦⠙⣿⣿⣌⠻⣽⢯⣿⣽⣻⣿⣿⣿⣧⠩⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⢰⢣⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⢀⢀⢿⣞⣷⢿⡇ ⣿⣽⣆⠹⣧⠘⣿⣿⡷⣌⠙⢷⣯⡷⣟⣿⣿⣿⣷⡀⡹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣈⠃⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢀⣴⡧⢀⠸⣿⡽⣿⢀ ⢻⣽⣿⡄⢻⣷⡈⢿⣿⣿⢧⢀⠙⢿⣻⡾⣽⣻⣿⣿⣄⠌⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⢁⣰⣾⣟⡿⢀⡄⢿⣟⣿⢀ ⡄⢿⣿⣷⢀⠹⣟⣆⠻⣿⣿⣆⢀⣀⠉⠻⣿⡽⣯⣿⣿⣷⣈⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⢀⣠⠘⣯⣷⣿⡟⢀⢆⠸⣿⡟⢸ ⣷⡈⢿⣿⣇⢱⡘⢿⣷⣬⣙⠿⣧⠘⣆⢀⠈⠻⣷⣟⣾⢿⣿⣆⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⣠⡞⢡⣿⢀⣿⣿⣿⠇⡄⢸⡄⢻⡇⣼ ⣿⣷⡈⢿⣿⡆⢣⡀⠙⢾⣟⣿⣿⣷⡈⠂⠘⣦⡈⠿⣯⣿⢾⣿⣆⠙⠻⠿⠿⠿⠿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠛⢋⣠⣾⡟⢠⣿⣿⢀⣿⣿⡟⢠⣿⢈⣧⠘⢠⣿ ⣿⣿⣿⣄⠻⣿⡄⢳⡄⢆⡙⠾⣽⣿⣿⣆⡀⢹⡷⣄⠙⢿⣿⡾⣿⣆⢀⡀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⣀⣠⣴⡿⣯⠏⣠⣿⣿⡏⢸⣿⡿⢁⣿⣿⢀⣿⠆⢸⣿ ⣿⣿⣿⣿⣦⡙⣿⣆⢻⡌⢿⣶⢤⣉⣙⣿⣷⡀⠙⠽⠷⠄⠹⣿⣟⣿⣆⢙⣋⣤⣤⣤⣄⣀⢀⢀⢀⢀⣾⣿⣟⡷⣯⡿⢃⣼⣿⣿⣿⠇⣼⡟⣡⣿⣿⣿⢀⡿⢠⠈⣿ ⣿⣿⣿⣿⣿⣷⣮⣿⣿⣿⡌⠁⢤⣤⣤⣤⣬⣭⣴⣶⣶⣶⣆⠈⢻⣿⣿⣆⢻⣿⣿⣿⣿⣿⣿⣷⣶⣤⣌⣉⡘⠛⠻⠶⣿⣿⣿⣿⡟⣰⣫⣴⣿⣿⣿⣿⠄⣷⣿⣿⣿ */ #include <bits/stdc++.h> using namespace std; //#define MULTITEST #define x first #define y second #define mp make_pair #define pb push_back #define sqr(a) ((a) * (a)) #define sz(a) int(a.size()) #define all(a) a.begin(), a.end() #define forn(i, n) for(int i = 0; i < int(n); i++) #define fore(i, l, r) for(int i = int(l); i < int(r); i++) typedef long long li; typedef long double ld; typedef pair<int, int> pt; template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) { return out << ( << a.x << , << a.y << ) ; } template <class A> ostream& operator << (ostream& out, const vector<A> &v) { out << [ ; forn(i, sz(v)) { if(i) out << , ; out << v[i]; } return out << ] ; } mt19937 rnd(time(NULL)); const int INF = int(1e9); const li INF64 = li(1e18); const int MOD = int(1e9) + 7; const ld EPS = 1e-9; const ld PI = acos(-1.0); const int N = 200 * 1000 + 13; int n; vector<int> g[N]; bool read () { if (scanf( %d , &n) != 1) return false; forn(i, n) g[i].clear(); forn(i, n - 1){ int v, u; scanf( %d%d , &v, &u); --v, --u; g[v].pb(u); g[u].pb(v); } return true; } int fib[N]; int fibnum[N]; int siz[N]; void init(int v, int p){ siz[v] = 1; for (int u : g[v]) if (u != p){ init(u, v); siz[v] += siz[u]; } } int dfs(int v, int p, int siz1, int siz2){ for (int u : g[v]) if (u != p){ if (siz[u] == siz1 || siz[u] == siz2){ g[v].erase(find(all(g[v]), u)); g[u].erase(find(all(g[u]), v)); return u; } int res = dfs(u, v, siz1, siz2); if (res != -1) return res; } return -1; } bool calc(int v){ init(v, -1); int cnt = siz[v]; if (fibnum[cnt] == -1) return false; if (cnt <= 2) return true; int nrt = dfs(v, -1, fib[fibnum[cnt] - 1], fib[fibnum[cnt] - 2]); if (nrt == -1) return false; return calc(v) && calc(nrt); } void solve() { forn(i, n) if (sz(g[i]) > 30){ puts( NO ); return; } fib[0] = 1; fib[1] = 2; fore(i, 2, 26) fib[i] = fib[i - 1] + fib[i - 2]; memset(fibnum, -1, sizeof(fibnum)); forn(i, 26) fibnum[fib[i]] = i; puts(calc(0) ? YES : NO ); } int main() { #ifdef _DEBUG freopen( input.txt , r , stdin); // freopen( output.txt , w , stdout); int tt = clock(); #endif cerr.precision(15); cout.precision(15); cerr << fixed; cout << fixed; #ifdef MULTITEST int tc; scanf( %d , &tc); while(tc--){ read(); #else while(read()) { #endif solve(); #ifdef _DEBUG cerr << TIME = << clock() - tt << endl; tt = clock(); #endif } }
#include <bits/stdc++.h> const int N = int(1e5 + 3); using namespace std; bool is_prime(int n) { if (n == 2) return true; if (n % 2 == 0) return false; for (int i = 2; i * i <= n; ++i) if (n % i == 0) return false; return true; } void solve() { long long n; cin >> n; long long t = n / 3; long long t1 = (t - 1) + t * 2; long long t2 = (t) + (t + 1) * 2; long long t3 = (t) + t * 2; if (t1 == n) { cout << (t - 1) << << t << n ; ; } else if (t2 == n) { cout << t << << t + 1 << n ; ; } else if (t3 == n) { cout << t << << t << n ; ; } else { cout << t + 1 << << t << n ; ; } return; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> adj[1005]; int w[1005]; int main() { int n, k; cin >> n >> k; if (n - k - 1 < k) return cout << -1, 0; cout << n * k << endl; for (int i = 1; i <= n; i++) { int t = w[i]; for (int j = i + 1; j <= n; j++) { if (w[i] < k) printf( %d %d n , i, j), w[i]++; else if (w[j] < k) printf( %d %d n , j, i), w[j]++; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; int main() { int n, d, l; vector<int> a; cin >> n >> d >> l; int a1 = 0; for (int i = 0; i < n - 1; i++) { if (d < 1) a1 = 1; else if (d >= l) a1 = l; else a1 = d + 1; a.push_back(a1); d = a1 - d; } a.push_back(d); if (a.back() < 1 || a.back() > l) { cout << -1; return 0; } for (int i = 0; i < n; i++) cout << a[i] << ; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<int> v(n), rank(n + 1), v1(m); for (int i = 0; i < n; i++) { cin >> v[i]; rank[v[i]] = i + 1; } for (int i = 0; i < m; i++) cin >> v1[i]; long long cnt = 0; long long pre = 0; for (int i = 0; i < m; i++) { if (rank[v1[i]] < pre) { cnt += 1; } else { int k = rank[v1[i]] - 1; k -= i; cnt += (2 * k + 1); pre = rank[v1[i]]; } } cout << cnt << endl; } }
#include <bits/stdc++.h> using namespace std; long long int maxi = 0; long long int nc2(long long int n) { return (n * (n - 1)) / 2; } int m[367]; int f[367]; int main() { int n, g; cin >> n; while (n--) { char c; int l, r; cin >> c >> l >> r; if (c == M ) { for (int i = l; i <= r; i++) { m[i]++; } } else { for (int i = l; i <= r; i++) { f[i]++; } } } for (int i = 1; i < 367; i++) { g = min(m[i], f[i]); if (maxi < g) { maxi = g; } } cout << 2 * maxi << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } long long int f[n + 1]; f[0] = 0; for (int i = 1; i < n; i++) { f[i] = f[i - 1] ^ i; } long long sum = 0; for (int i = 1; i <= n; i++) { if ((n / (i)) % 2 == 1) { sum = sum ^ (a[i] ^ f[i - 1]) ^ (f[n % i]); } else { sum = sum ^ a[i] ^ f[n % i]; } } cout << sum; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long res = 0; for (size_t i = 0; i < s.size(); ++i) { int c = s[i] - 0 ; int pc = (i > 0 ? s[i - 1] - 0 : 0); if (c % 4 == 0) { ++res; } if ((pc * 10 + c) % 4 == 0) { res += i; } } cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int nxt() { int res; scanf( %d , &res); return res; } inline void solve() { int n = nxt(); int k = nxt(); int d = nxt(); vector<vector<int> > ans; ans.push_back(vector<int>(d, 0)); while (int(ans.size()) < n) { vector<int> q = ans.back(); int add = 1; for (int i = 0; i < d && add; ++i) { q[i] += add; add = 0; if (q[i] >= k) { q[i] -= k; add = 1; } } if (add) { break; } ans.push_back(q); } if (int(ans.size()) != n) { cout << -1 n ; return; } for (int i = 0; i < d; ++i) { for (int j = 0; j < n; ++j) { cout << ans[j][i] + 1 << ; } cout << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long dp[5005][5005]; long long solve(long long x, long long y) { if (x == 0 || y == 0) return 1; if (dp[x][y] == 0) dp[x][y] = (solve(x - 1, y - 1) * y + solve(x - 1, y)) % 998244353; return dp[x][y]; } int main() { long long n, m, k; while (scanf( %lld%lld%lld , &n, &m, &k) != EOF) { memset(dp, 0, sizeof(0)); printf( %lld n , (solve(n, m) * solve(m, k) % 998244353) * solve(k, n) % 998244353); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const double PI = 3.141592653528; const long long INF = 10000000000000000; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<pair<pair<int, int>, int> > v; long long sum = 0; for (int i = 0; i < 2 * n - 1; ++i) { int a, b; cin >> a >> b; v.push_back(make_pair(make_pair(a, b), i)); sum += b; } cout << YES n ; sort(v.rbegin(), v.rend()); long long sum1 = v[0].first.second; int k = 1; for (int i = 0; i < n - 1; ++i) sum1 += v[k + 2 * i].first.second; if (2 * sum1 < sum) ++k; cout << v[0].second + 1 << ; for (int i = 0; i < n - 1; ++i) cout << v[k + 2 * i].second + 1 << ; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, x1, y1, x2, y2, x, y; scanf( %d%d%d%d%d%d , &n, &m, &x1, &y1, &x2, &y2); x = abs(x1 - x2); y = abs(y1 - y2); if (x + y >= 7 || y >= 5 || x >= 5) printf( Second n ); else printf( First n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { vector<int> num; int n; cin >> n; int k = -1, tmp; while (n > 0) { tmp = n % 10; num.push_back(tmp); if (tmp > k) k = tmp; n /= 10; } cout << k << endl; bool flag = true; bool main = true; while (true) { flag = false; main = false; for (int i = num.size() - 1; i > -1; i--) { if (num[i] > 0) { cout << 1; flag = true; main = true; num[i]--; } else if ((num[i] == 0) && (main)) cout << 0; } if (flag == false) break; cout << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const double eps = 1e-6; const double pi = acos(-1.0); int T[100005 << 2]; void update(int n, int L, int R, int p, int a) { if (L == R) { T[n] = a; return; } if (p > (L + R) / 2) update(n * 2 + 1, (L + R) / 2 + 1, R, p, a); else update(n * 2, L, (L + R) / 2, p, a); T[n] = max(T[n * 2], T[n * 2 + 1]); } int query(int n, int L, int R, int l, int r) { if (L == l && R == r) return T[n]; int M = (L + R) / 2; if (l > M) return query(n * 2 + 1, M + 1, R, l, r); else if (r <= M) return query(n * 2, L, M, l, r); else return max(query(n * 2, L, M, l, M), query(n * 2 + 1, M + 1, R, M + 1, r)); } struct node { node(){}; node(int L, int R, int M, double P) : l(L), r(R), mx(M), p(P){}; int l, r, mx; double p; vector<int> c; bool operator<(const node& n) const { return l == n.l ? r > n.r : l < n.l; }; } N[5005]; int q; double dp[5005][5005]; double dfs(int n) { for (auto i : N[n].c) dfs(i); double a, b; dp[n][0] = 1.0 - N[n].p; for (auto i : N[n].c) if (N[n].mx - N[i].mx <= q) dp[n][0] *= dp[i][N[n].mx - N[i].mx]; for (int j = 1; j <= q; ++j) { a = b = 1; for (auto i : N[n].c) { if (N[n].mx - N[i].mx + j - 1 <= q) a *= dp[i][N[n].mx - N[i].mx + j - 1]; if (N[n].mx - N[i].mx + j <= q) b *= dp[i][N[n].mx - N[i].mx + j]; } dp[n][j] = a * N[n].p + b * (1.0 - N[n].p); } if (n == 0) { double ans = dp[n][0] * N[n].mx; for (int j = 1; j <= q; ++j) if (dp[n][j] > dp[n][j - 1]) ans += (dp[n][j] - dp[n][j - 1]) * (N[n].mx + j); return ans; } else return 0; } int main() { int n, a, l, r; double p; stack<int> s; cin >> n >> q; for (int i = 1; i <= n; ++i) { cin >> a; update(1, 1, n, i, a); } for (int i = 1; i <= q; ++i) { cin >> l >> r >> p; N[i] = node(l, r, query(1, 1, n, l, r), p); } N[0] = node(1, n, T[1], 0); sort(N + 1, N + 1 + q); s.push(0); for (int i = 1; i <= q; ++i) { while (!s.empty()) { l = N[s.top()].l; r = N[s.top()].r; if (l <= N[i].l && N[i].r <= r) { N[s.top()].c.push_back(i); s.push(i); break; } else s.pop(); } } memset(dp, 0, sizeof(dp)); printf( %.8lf n , dfs(0)); }
#include <bits/stdc++.h> using namespace std; template <class T> void _R(T &x) { cin >> x; } void _R(int &x) { scanf( %d , &x); } void _R(int64_t &x) { scanf( %lld , &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R() {} template <class T, class... U> void R(T &head, U &...tail) { _R(head); R(tail...); } template <class T> void _W(const T &x) { cout << x; } void _W(const int &x) { printf( %d , x); } void _W(const int64_t &x) { printf( %lld , x); } void _W(const double &x) { printf( %.16f , x); } void _W(const char &x) { putchar(x); } void _W(const char *x) { printf( %s , x); } template <class T, class U> void _W(const pair<T, U> &x) { _W(x.first); putchar( ); _W(x.second); } template <class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar( ); } void W() {} template <class T, class... U> void W(const T &head, const U &...tail) { _W(head); putchar(sizeof...(tail) ? : n ); W(tail...); } int MOD = 1e9 + 7; void ADD(long long &x, long long v) { x = (x + v) % MOD; if (x < 0) x += MOD; } const int SIZE = 1e6 + 10; const int MATRIX_SIZE = 500; long long mypow(long long x, long long y) { x %= MOD; long long res = 1 % MOD; while (y) { if (y & 1) res = res * x % MOD; y >>= 1; x = x * x % MOD; } return res; } struct Matrix_Power { long long AA[60][MATRIX_SIZE][MATRIX_SIZE], aa[62][MATRIX_SIZE]; int N; void set(long long _A[][MATRIX_SIZE], int _N, long long bb = (long long)1e18) { N = _N; for (int i = 0; i < (N); ++i) for (int j = 0; j < (N); ++j) AA[0][i][j] = _A[i][j]; for (int round = (1); round < (60); ++round) { if ((1LL << round) > bb) break; for (int i = 0; i < (N); ++i) for (int j = 0; j < (N); ++j) AA[round][i][j] = 0; for (int i = 0; i < (N); ++i) for (int j = 0; j < (N); ++j) for (int k = 0; k < (N); ++k) { AA[round][i][k] += AA[round - 1][i][j] * AA[round - 1][j][k]; AA[round][i][k] %= MOD; } } } long long get(long long _a[], long long v) { memset((aa), 0, sizeof((aa))); for (int i = 0; i < (N); ++i) aa[0][i] = _a[i]; for (int i = 0; i < (61); ++i) { if ((1LL << i) > v) return aa[i][N - 1]; if ((v >> i) & 1) { for (int j = 0; j < (N); ++j) for (int k = 0; k < (N); ++k) { aa[i + 1][j] += AA[i][j][k] * aa[i][k]; aa[i + 1][j] %= MOD; } } else for (int j = 0; j < (N); ++j) aa[i + 1][j] = aa[i][j]; } return -1; } } mat; long long A[1000][MATRIX_SIZE]; long long a[SIZE]; int main() { MOD = 1000003; int c, w, h; R(c, w, h); for (int i = 0; i < (w + 1); ++i) { if (i < w) A[i][i + 1] = 1; else { for (int j = 0; j < (w + 1); ++j) A[i][i - j] = mypow(h, j); } } a[w - 1] = a[w] = 1; mat.set(A, w + 1, c * 2); W(mat.get(a, c)); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int arr[2 * MAXN]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= 2 * n; i++) scanf( %d , arr + i); sort(arr + 1, arr + 2 * n + 1); long long best = LONG_LONG_MAX; for (int start_x = 1; start_x <= n + 1; start_x++) { int r_x = arr[start_x + n - 1] - arr[start_x]; int y_max = ((start_x == n + 1) ? arr[n] : arr[2 * n]); int y_min = ((start_x == 1) ? arr[n + 1] : arr[1]); int r_y = y_max - y_min; best = min(best, 1ll * r_x * r_y); } printf( %lld n , best); return 0; }
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; template <class T> inline T biton(T n, T pos) { return n | ((T)1 << pos); } template <class T> inline T bitoff(T n, T pos) { return n & ~((T)1 << pos); } template <class T> inline T ison(T n, T pos) { return (bool)(n & ((T)1 << pos)); } template <class T> inline T gcd(T a, T b) { while (b) { a %= b; swap(a, b); } return a; } inline int nxt() { int aaa; scanf( %d , &aaa); return aaa; } inline long long lxt() { long long aaa; scanf( %lld , &aaa); return aaa; } inline double dxt() { double aaa; scanf( %lf , &aaa); return aaa; } template <class T> inline T bigmod(T p, T e, T m) { T ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % m; p = (p * p) % m; } return (T)ret; } template <class T> istream& operator>>(istream& is, vector<T>& input) { for (T& in : input) is >> in; return is; } template <class T> ostream& operator<<(ostream& os, const vector<T>& input) { bool isFirst = true; for (T out : input) { if (isFirst) { os << out; isFirst = false; } else os << << out; } return os; } void solve() { int r = nxt(), g = nxt(), b = nxt(), w = nxt(); if (r == 0 || g == 0 || b == 0) { int cnt = 0; if (r & 1) cnt++; if (g & 1) cnt++; if (b & 1) cnt++; if (w & 1) cnt++; if (cnt > 1) { cout << No n ; return; } cout << Yes n ; return; } int mn = min({r, g, b}); r -= mn, g -= mn, b -= mn; w += (mn * 3); for (int i = 0; i < min(mn, 5); i++) { r += i; g += i; b += i; w -= (i * 3); int cnt = 0; if (r & 1) cnt++; if (g & 1) cnt++; if (b & 1) cnt++; if (w & 1) cnt++; if (cnt <= 1) { cout << Yes n ; return; } } cout << No n ; } int main() { cout.setf(ios::fixed); cout.precision(10); int tc = nxt(); while (tc--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const int INF = 1000000000; int s(int first) { int r = 0; while (first) { r += first % 10; first /= 10; } return r; } int main() { long long m; cin >> m; long long b = 1000 * 1000 * 1000; long long r = b * b; r = 9 * r % m; r = 9 * r % m; r = (m - (r + 1) % m) % m; cout << 1 + r << << b * b + r << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int x[2000], y[2000], c[2000]; vector<int> poss; multiset<int> xx[2000]; vector<pair<int, int> > events; map<pair<int, int>, int> M; long long int sum = 0, ans = 0; int update(int e, int m) { if (e < 0) return 0; auto it = M.upper_bound(make_pair(e, 2e9)); it--; if (it->first.second != e) { pair<int, int> p = it->first; int v = it->second; M.erase(it); M[make_pair(p.first, e)] = v; M[make_pair(e + 1, p.second)] = v; } it = M.upper_bound(make_pair(e, 2e9)); it--; if (it->second < m) return 0; pair<int, int> p = make_pair(e, e); while (it->second >= m) { p.first = it->first.first; sum -= (long long int)(it->first.second - it->first.first + 1) * it->second; it = M.erase(it); if (it == M.begin()) break; else it--; } M[p] = m; sum += (long long int)(p.second - p.first + 1) * m; return 0; } int main() { int i; int n, k, L; scanf( %d %d %d , &n, &k, &L); poss.push_back(-1), poss.push_back(L); for (i = 0; i < n; i++) { scanf( %d %d %d , &x[i], &y[i], &c[i]), c[i]--; poss.push_back(y[i]); } sort(poss.begin(), poss.end()); poss.resize(unique(poss.begin(), poss.end()) - poss.begin()); int j; for (i = 1; i < poss.size(); i++) { int yy = poss[i] - poss[i - 1]; for (j = 0; j < n; j++) { if (y[j] > poss[i - 1]) { events.push_back(make_pair(y[j], j)); xx[c[j]].insert(x[j]); } } M.clear(); M[make_pair(0, L - 1)] = L, sum = (long long int)L * L; for (j = 0; j < k; j++) { if (xx[j].empty()) break; int p = -1; for (auto it = xx[j].begin(); it != xx[j].end(); it++) update(*it - 1, p + 1), p = *it; update(L - 1, p + 1); } if (j < k) break; sort(events.begin(), events.end(), greater<pair<int, int> >()); int l = L; for (j = 0; j < events.size(); j++) { int u = events[j].second; long long int nn = (long long int)yy * (l - events[j].first); nn %= 1000000007; ans += nn * (sum % 1000000007), ans %= 1000000007; auto it = xx[c[u]].lower_bound(x[u]); it = xx[c[u]].erase(it); int a = (it == xx[c[u]].end()) ? L - 1 : *it - 1; int b = (it == xx[c[u]].begin()) ? 0 : *(--it) + 1; update(a, b); if (xx[c[u]].empty()) break; l = events[j].first; } for (j = 0; j < k; j++) xx[j].clear(); events.clear(); } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long xpow(long long a, long long b) { if (!b) return 1; if (b == 1) return a; if (b & 1) { return ((a * xpow(a, b - 1))); } else { long long p = xpow(a, b / 2); return ((p * p)); } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long w, m; cin >> w >> m; vector<long long> v(102, 0); long long x = m, k = 0; while (x) { v[k] = x % w; x /= w; k++; } bool f = 0; for (long long i = 0; i < 102; i++) { if (v[i] == 1 || !v[i]) { continue; } else { if (v[i] == w - 1 || v[i] == w) { v[i + 1]++; } else { cout << NO ; f = 1; break; } } } if (!f) cout << YES ; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; long long a[5111], y, yy; int lmax[5111], cnt[5111], llmax; int N, i, j, k; int main() { scanf( %d , &N); for (i = 1; i <= N; i++) scanf( %I64d , &a[i]); for (llmax = 0, i = 1; i <= N; i++) { lmax[i] = 0; cnt[i] = 0; y = a[i]; while ((y & 1) == 0) { y >>= 1; cnt[i]++; } for (j = i - 1; j >= 1; j--) { k = i - j; if (k > cnt[i]) { if (a[j] % y == 0 && lmax[j] > lmax[i]) lmax[i] = lmax[j]; } else { yy = y << (cnt[i] - k); if (a[j] % yy == 0 && ((a[j] / yy) & 1 == 1) && lmax[j] > lmax[i]) lmax[i] = lmax[j]; } } lmax[i]++; if (lmax[i] > llmax) llmax = lmax[i]; } printf( %d n , N - llmax); return 0; }
#include <bits/stdc++.h> using namespace std; int v[200001], i, n, poz; bool cmp(int a, int b) { return a < b; } int main() { cin >> n; for (i = 1; i <= n; i++) cin >> v[i]; sort(v + 1, v + n + 1, cmp); poz = 1; for (i = 1; i <= n; i++) { if (v[i] >= poz) poz++; } cout << poz - 1; }
#include <bits/stdc++.h> using namespace std; void dropAny(const vector<int> &a, int offset, vector<bool> &used) { vector<int> next(used.size(), a.size()); for (int i = int(a.size()) - 1; i >= offset; --i) { next[a[i]] = i; } int best = -1; for (int i = 0; i < (int)used.size(); ++i) { if (!used[i]) { continue; } if (best == -1 || next[best] < next[i]) { best = i; } } used[best] = false; ; } struct RangeTree { int kk; vector<pair<int, int> > b; RangeTree(int n) { kk = 1; while (kk < n) { kk *= 2; } b.assign(2 * kk + 10, pair<int, int>(-1, -1)); } int getMaxPos() { return b[1].second; } int get(int pos) { return b[pos + kk].first; } void set(int pos, int val) { ; int t = pos + kk; b[t] = pair<int, int>(val, pos); while (t > 1) { t /= 2; b[t] = max(b[2 * t], b[2 * t + 1]); } } }; int main() { int n, k; scanf( %d%d , &n, &k); int maxA = 0; vector<int> a(n); vector<pair<int, int> > z(n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); z[i] = pair<int, int>(a[i], i); maxA = max(maxA, a[i] + 1); } sort(z.begin(), z.end()); vector<int> next(n, n); for (int i = 1; i < int(z.size()); ++i) { if (z[i - 1].first == z[i].first) { next[z[i - 1].second] = z[i].second; } } for (int i = 0; i < n; ++i) { ; }; RangeTree tree(maxA); int cnt = 0; int ans = 0; for (int i = 0; i < n; ++i) { if (tree.get(a[i]) == -1) { ; if (cnt == k) { int pos = tree.getMaxPos(); ; tree.set(pos, -1); cnt--; } tree.set(a[i], next[i]); ans++; cnt++; } else { tree.set(a[i], next[i]); } } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int MAX = 1e3 + 5; const int MOD = 1e9 + 7; const int64_t INF = INT_MAX; const int64_t _INF = INT_MIN; int k, n; int h[MAX]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> k; while (k--) { cin >> n; for (int i = 1; i <= n; i++) cin >> h[i]; int ans = 0; sort(h + 1, h + n + 1); for (int i = 1; i <= n; i++) ans = max(ans, min(h[n - i + 1], i)); cout << ans << n ; } }
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long fac[200001]; long long inv[200001]; long long modexp(long long b, long long e) { long long ans = 1; while (e > 0) { if (e & 1) { ans = (ans * b) % mod; } b = (b * b) % mod; e >>= 1; } return ans; } long long comb(long long n, long long k) { long long ans = (fac[n] * inv[k]) % mod; ans = (ans * inv[n - k]) % mod; return ans; } int main() { fac[0] = fac[1] = 1; inv[0] = inv[1] = 1; for (int i = 2; i <= 200000; i++) { fac[i] = (fac[i - 1] * i) % mod; inv[i] = modexp(fac[i], mod - 2); } int n, k; cin >> n >> k; vector<pair<int, int> > list; for (int i = 1; i <= n; i++) { int a, b; cin >> a >> b; list.push_back(make_pair(a, 1)); list.push_back(make_pair(b + 1, -1)); } sort(list.begin(), list.end()); int maintain = 0; long long ans = 0; int selisih; for (int i = 0; i < list.size(); i++) { if (i > 0 && list[i].first != list[i - 1].first) { if (maintain >= k) { ans += comb(maintain, k) * (list[i].first - selisih); ans %= mod; } } maintain += list[i].second; selisih = list[i].first; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; long long n, i, a, b, x, y, o, z, p, q, sum, c; int main() { cin >> n; vector<long long> v; for (i = 0; i < n; i++) { cin >> x; if (x == 0) o++; else v.push_back(x); } sort(v.begin(), v.end()); a = 0; b = v.size() - 1; sum += o * (o - 1) / 2; if (v.size() > 1) { while (a < b) { if (v[a] > 0 || v[b] < 0) break; else { if (v[a] + v[b] < 0) a++; else if (v[a] + v[b] > 0) b--; else { p = 1; q = 1; x = v[a]; a++; y = v[b]; b--; while (1) { if (v[a] == x) { p++; a++; } else break; } while (1) { if (v[b] == y) { q++; b--; } else break; } sum += p * q; } } } } cout << sum; }
#include <bits/stdc++.h> using namespace std; const int N = 4 * 1000 * 100 + 10; int n, c[N], st[N], en[N], who[N], TM; vector<int> adj[N]; void dfs(int root, int par = 0) { st[root] = TM++; who[st[root]] = root; for (auto u : adj[root]) if (u ^ par) dfs(u, root); en[root] = TM; } struct Node { int lazy = -1; long long lol = 0; void merge(Node L, Node R) { lol = L.lol | R.lol; } void add(int x) { if (x == -1) return; lazy = x; lol = 1LL << x; } } seg[N << 2]; void push(int root) { seg[root << 1].add(seg[root].lazy), seg[root << 1 | 1].add(seg[root].lazy); seg[root].lazy = -1; } void build(int l = 0, int r = n, int root = 1) { if (l + 1 == r) { seg[root].add(c[who[l]]); return; } int mid = l + r >> 1; build(l, mid, root << 1), build(mid, r, root << 1 | 1); seg[root].merge(seg[root << 1], seg[root << 1 | 1]); } void upd(int s, int e, int w, int l = 0, int r = n, int root = 1) { if (s <= l && e >= r) { seg[root].add(w); return; } if (s >= r || e <= l) return; push(root); int mid = l + r >> 1; upd(s, e, w, l, mid, root << 1), upd(s, e, w, mid, r, root << 1 | 1); seg[root].merge(seg[root << 1], seg[root << 1 | 1]); } Node get(int s, int e, int l = 0, int r = n, int root = 1) { if (s <= l && e >= r) return seg[root]; if (s >= r || e <= l) return seg[0]; push(root); int mid = l + r >> 1; Node res; res.merge(get(s, e, l, mid, root << 1), get(s, e, mid, r, root << 1 | 1)); return res; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int Q; cin >> n >> Q; for (int i = 1; i <= n; i++) cin >> c[i]; for (int i = 1, v, u; i < n; i++) { cin >> v >> u; adj[v].push_back(u); adj[u].push_back(v); } dfs(1); build(); while (Q--) { int t, v, c; cin >> t; if (t == 1) { cin >> v >> c; upd(st[v], en[v], c); } else { cin >> v; cout << __builtin_popcountll(get(st[v], en[v]).lol) << n ; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int num = 0, num1, num2; for (int i = 0; i < s.size(); i++) { if (s[i] == A ) { num1 = 0; for (int j = 0; j < i; j++) if (s[j] == Q ) num1++; num2 = 0; for (int j = i + 1; j < s.size(); j++) if (s[j] == Q ) num2++; num += (num1 * num2); } } cout << num; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; const ll llinf = (1ll << 61) - 1; const double eps = 1e-6, ldeps = 1e-9; template <class C, size_t Y> struct tp { void operator()(ostream &os, const C &t) { tp<C, Y - 1>()(os, t); os << , << get<Y - 1>(t); } }; template <class C> struct tp<C, 1> { void operator()(ostream &os, const C &t) { os << get<0>(t); } }; template <class... C> ostream &operator<<(ostream &os, const tuple<C...> &t) { os << { , tp<decltype(t), sizeof...(C)>()(os, t); return os << } ; } struct Dbg { static constexpr auto &os = cout; template <class C> static auto dud(C *x) -> decltype(os << *x, 0); template <class C> static char dud(...); template <class C> typename enable_if<sizeof dud<C>(0) != 1, Dbg &>::type operator<<( const C &x) { os << x; return *this; } template <class C> Dbg &dump(C b, C e) { *this << n[ ; int cur = 0; for (C i = b; i != e and cur < 20; i++, cur++) *this << , + 2 * (i == b) << *i; return *this << ] ; } template <class C> typename enable_if<sizeof dud<C>(0) == 1, Dbg &>::type operator<<( const C &x) { return dump(begin(x), end(x)); } template <class C, size_t X> typename enable_if<sizeof(C) != 1, Dbg &>::type operator<<(C (&x)[X]) { return dump(begin(x), end(x)); } template <class B, class C> Dbg &operator<<(const pair<B, C> &x) { return *this << { << x.first << , << x.second << } ; } Dbg &operator<<(ostream &(*x)(std::ostream &)) { os << x; return *this; } } dbg; void err(istringstream *iss) { delete iss; } template <class C, class... Args> void err(istringstream *iss, const C &val, const Args &...args) { string name; *iss >> name; if (name.back() == , ) name.pop_back(); dbg << name << = << val << ; , err(iss, args...); } int n, m, K, T, Q, cn; const int inf = 1000000007, mxn = 53; char s1[mxn], s2[mxn]; int s1l, s2l, rp[30][30], dp1[mxn][mxn], dp2[mxn][mxn]; int memo[mxn][mxn]; bitset<mxn> vstd[mxn]; int dp(int at1, int at2) { if (at1 == s1l or at2 == s2l) return at1 == s1l and at2 == s2l ? 0 : inf; int &ret = memo[at1][at2]; if (vstd[at1][at2]) return ret; vstd[at1][at2] = 1; ret = inf; for (int i = at1; i <= s1l - 1; i++) { for (int j = at2; j <= s2l - 1; j++) { if ((dp1[at1][i] & dp2[at2][j])) ret = min(ret, 1 + dp(i + 1, j + 1)); } } return ret; } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.precision(11); cin >> s1 >> s2 >> n; for (int i = 0; i < n; i++) { string tmp; cin >> tmp; rp[tmp[3] - a ][tmp[4] - a ] |= 1 << (tmp[0] - a ); } s1l = int(strlen(s1)), s2l = int(strlen(s2)); for (int L = 1; L <= s1l; L += 1) { for (int i = 0, j = i + L - 1; j < s1l; i++, j++) { if (L == 1) { dp1[i][j] |= 1 << (s1[i] - a ); continue; } for (int k = i; k <= j - 1; k++) { for (int l = 0; l < 26; l++) { if ((dp1[i][k] >> l) & 1) for (m = 0; m < 26; m++) { if ((dp1[k + 1][j] >> m) & 1) dp1[i][j] |= rp[l][m]; } } } } } for (int L = 1; L <= s2l; L += 1) { for (int i = 0, j = i + L - 1; j < s2l; i++, j++) { if (L == 1) { dp2[i][j] |= 1 << (s2[i] - a ); continue; } for (int k = i; k <= j - 1; k++) { for (int l = 0; l < 26; l++) { if ((dp2[i][k] >> l) & 1) for (m = 0; m < 26; m++) { if ((dp2[k + 1][j] >> m) & 1) dp2[i][j] |= rp[l][m]; } } } } } int ans = dp(0, 0); cout << (ans == inf ? -1 : ans) << n ; }
#include <bits/stdc++.h> using namespace std; long long int o[100001]; long long int sum[100001]; long long int dp[100001][2]; long long int dp1[100001][2]; long long int on[100001]; long long int a[100001]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n - 1; i++) { scanf( %lld , &a[i]); } long long int max1 = 0; memset(dp, 0, sizeof dp); dp[0][0] = 0; dp[0][1] = 0; for (int i = 1; i < n; i++) { if (a[i - 1] == 1) dp[i][1] = 0; else { dp[i][1] = dp[i - 1][1] + a[i - 1] - (a[i - 1] & 1); } dp[i][0] = max(dp[i][1], a[i - 1] + (a[i - 1] & 1) - 1 + dp[i - 1][0]); max1 = max(dp[i][1], max(max1, dp[i][0])); } memset(dp1, 0, sizeof dp1); dp1[n - 1][0] = 0; dp1[n - 1][1] = 0; for (int i = n - 2; i >= 0; i--) { if (a[i] == 1) { dp1[i][1] = 0; } else { dp1[i][1] = dp1[i + 1][1] + a[i] - (a[i] & 1); } dp1[i][0] = max(dp1[i][1], a[i] + (a[i] & 1) - 1 + dp1[i - 1][0]); max1 = max(dp1[i][1], max(max1, dp1[i][0])); } for (int i = 0; i < n; i++) { max1 = max(max1, max(dp[i][0] + dp1[i][1], dp1[i][0] + dp[i][1])); } cout << max1 << endl; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int a[maxn]; int n, x, k; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> x >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long ans = 0; for (int i = 0; i < n; i++) { long long l = (a[i] - 1) / x; long long r = l + k; ans += (long long)(lower_bound(a, a + n, (r + 1) * x) - lower_bound(a, a + n, max(r * x, (long long)a[i]))); } cout << ans << endl; return 0; }
#include<bits/stdc++.h> using namespace std; int t,f,i,j,p,q,x,y,dx[128],dy[128]; char s[5008]; int main() { for(dx[ L ]=-(dx[ R ]=1),dy[ D ]=-(dy[ U ]=1),scanf( %d ,&t); t--; f?0:printf( 0 0 n )) for(scanf( %s ,s),f=i=p=q=0; s[i]; x||y?++i: (printf( %d %d n ,p,q),f=i=strlen(s))) for(p+=dx[s[i]],q+=dy[s[j=i]],j=x=y=0; s[j]; x+=dx[s[j]], y+=dy[s[j]],x==p&&y==q?(x-=dx[s[j]],y-=dy[s[j]]):0,++j); exit(0); }
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed; int a1, a2; cin >> a1 >> a2; int minutes = 0; while (a1 > 0 && a2 > 0) { if (a1 == 1 && a2 == 1) { break; } if (a1 <= 2) { a1 += 1; a2 -= 2; } else if (a2 <= 2) { a2 += 1; a1 -= 2; } else { a1 += 1; a2 -= 2; } minutes++; } cout << minutes; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 300 * 1000 + 100; const long long mod = 1e9 + 7; const long long inf = 2 * 1e18; int n, m, k; int ans = -1; char c[maxn]; vector<int> adj[maxn]; int cnt[30][maxn]; int d_in[maxn]; bool mark[maxn], mark1[maxn]; void dfs(int v) { if (mark[v]) { cout << -1; exit(0); } else mark[v] = true; if (mark1[v]) { mark[v] = false; return; } else mark1[v] = true; for (auto x : adj[v]) { dfs(x); for (int j = 0; j <= 26; j++) { cnt[j][v] = max(cnt[j][v], cnt[j][x]); ans = max(ans, cnt[j][v]); } } cnt[c[v] - a ][v]++; ans = max(ans, cnt[c[v] - a ][v]); mark[v] = false; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; string s; cin >> s; for (int i = 1; i <= n; i++) c[i] = s[i - 1]; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); d_in[v]++; } for (int i = 1; i <= n; i++) { dfs(i); } cout << ans; return 0; }
#include <bits/stdc++.h> bool is_prime(int n) { if (n < 2) { return false; } for (int d = 2; d * d <= n; d++) { if (n % d == 0) { return false; } } return true; } int main() { int n; std::cin >> n; int m = n, cross = 0; while (!is_prime(m + cross)) { cross++; } assert(2 * cross <= n); std::cout << m + cross << std::endl; for (int i = 1; i <= n; i++) { std::cout << i << << i % n + 1 << std::endl; } int jump = std::max(2, cross); for (int i = 1; i <= cross; i++) { assert(i < 1 + jump); assert(i + jump <= n); std::cout << i << << i + jump << std::endl; } }
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const long long OO = 1LL << 61; const long long MOD = 10007; const int maxn = 100000 + 5; long long dp[(1 << (16)) + 6]; int ans[20], g[20], mark[20], full; int main() { int n, m, a, b, f; long long y; while (scanf( %d %I64d %d , &n, &y, &m) != EOF) { memset(g, 0, sizeof g); memset(ans, -1, sizeof ans); memset(mark, 0, sizeof mark); for (int i = 0; i < m; i++) { scanf( %d %d , &a, &b); g[--b] |= (1 << (--a)); } f = 1; y -= 2001; full = (1 << (n)) - 1; for (int i = 0; i < n && f; i++) { for (ans[i] = 0;; ans[i]++) if (!mark[ans[i]]) { if (ans[i] >= n) { f = 0; puts( The times have changed ); break; } memset(dp, 0, sizeof dp); dp[0] = 1; for (int s = 0; s <= full; s++) if (dp[s]) { int cnt = __builtin_popcount(s); for (int k = 0; k < n; k++) if (!(s & (1 << (k)))) if ((ans[k] == -1 || ans[k] == cnt) && ((s & g[k]) == g[k])) dp[s | (1 << (k))] += dp[s]; } if (y >= dp[full]) y -= dp[full]; else { mark[ans[i]] = 1; break; } } } if (!f) continue; for (int i = 0; i < n; i++) printf( %d%c , ans[i] + 1, i + 1 == n ? n : ); } return 0; }
#include <bits/stdc++.h> using namespace std; int s[105]; int main() { int n, x; while (cin >> n >> x) { for (int i = 0; i < n; i++) { cin >> s[i]; } sort(s, s + n); int index = lower_bound(s, s + n, x) - s; if (s[index] == x) { cout << 1 + x - index << endl; } else { cout << x - index << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int a[111111]; int b[111111]; int main() { int n, i, j; vector<pair<int, int> > v; scanf( %d , &n); a[0] = a[1] = 1; for (i = 2; i <= n; i++) { if (a[i] == 0) { for (j = i * 2; j <= n; j += i) a[j] = 1; } } for (i = n / 2; i > 0; i--) { if (a[i] == 0) { vector<int> w; for (j = i; j <= n; j += i) { if (b[j] == 0) w.push_back(j); } if (w.size() % 2 == 0) { for (j = 0; j < w.size(); j += 2) { v.push_back(make_pair(w[j], w[j + 1])); b[w[j]] = b[w[j + 1]] = 1; } } else { for (j = 0; j < w.size(); j++) { if (w[j] % 2 == 0) { swap(w[j], w.back()); break; } } for (j = 0; j < w.size() - 1; j += 2) { v.push_back(make_pair(w[j], w[j + 1])); b[w[j]] = b[w[j + 1]] = 1; } } } } printf( %d n , v.size()); for (i = 0; i < v.size(); i++) printf( %d %d n , v[i].first, v[i].second); return 0; }
#include <bits/stdc++.h> using namespace std; const double pi = acos((double)(-1)); const int maxn = 100010; const int mod = 1e9 + 7; int moven2[10][5] = {{1, 0, 0}, {-1, 0, 0}, {0, 1, 0}, {0, -1, 0}, {0, 0, 1}, {0, 0, -1}}; int moven1[10][5] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int n, m, q, f[2 * maxn]; map<string, int> mp; string a, b; int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); } void Union(int x, int y) { int fx = find(x); int fy = find(y); f[fx] = fy; } int main() { cin >> n >> m >> q; for (int i = 1; i <= n; i++) { cin >> a; mp[a] = i; } for (int i = 1; i <= 2 * n; i++) f[i] = i; for (int i = 1, t; i <= m; i++) { cin >> t >> a >> b; int x = mp[a]; int y = mp[b]; if (t == 1) { if (find(x) == find(y + n) || find(y) == find(x + n)) cout << NO << n ; else { cout << YES << n ; Union(x, y); Union(x + n, y + n); } } else { if (find(x) == find(y) || find(x + n) == find(y + n)) cout << NO << n ; else { cout << YES << n ; Union(x + n, y); Union(x, y + n); } } } for (int i = 1; i <= q; i++) { cin >> a >> b; int x = mp[a]; int y = mp[b]; if (find(x) == find(y) || find(x + n) == find(y + n)) cout << 1 << n ; else if (find(x + n) == find(y) || find(x) == find(y + n)) cout << 2 << n ; else cout << 3 << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; int res = 0, cur = 0, tmp; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> tmp; res = (cur + tmp) / m; cur = (cur + tmp) % m; cout << res << ; } }
#include <bits/stdc++.h> int main() { int n, count = 0, i = 0, ans, flag = 1; char s[201]; scanf( %d %s , &n, s); while (s[i] != 0 ) { if (s[i] == x ) count++; i++; } if (n / 2 > count) { ans = n / 2 - count; flag = 0; } else ans = count - n / 2; printf( %d n , ans); i = 0; while (n-- && ans) { if (s[i] == x && flag) { s[i] = X ; ans--; } else if (s[i] == X && !flag) { s[i] = x ; ans--; } i++; } printf( %s n , s); return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 7; const int maxn = 5e1 + 10; const int maxq = 1e3 + 10; const int alf = 26; const long long dlm = 1e9 + 7; const int del = 998244353; const int eps = 1e-7; char t[maxn][maxn]; char g[maxn][maxn]; char t2[maxn][maxn]; int n; void rot() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { t2[j][n + 1 - i] = t[i][j]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { t[i][j] = t2[i][j]; } } } int flh() { for (int i1 = 1, i2 = n; i1 < i2; i1++, i2--) { for (int j = 1; j <= n; j++) { swap(t[i1][j], t[i2][j]); } } } int flv() { for (int i = 1; i <= n; i++) { for (int j1 = 1, j2 = n; j1 < j2; j1++, j2--) { swap(t[i][j1], t[i][j2]); } } } int same() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (t[i][j] != g[i][j]) return 0; } } return 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { string st; cin >> st; for (int j = 1; j <= n; j++) { t[i][j] = st[j - 1]; } } for (int i = 1; i <= n; i++) { string st; cin >> st; for (int j = 1; j <= n; j++) { g[i][j] = st[j - 1]; } } for (int vaf = 0; vaf < 2; vaf++) { for (int haf = 0; haf < 2; haf++) { for (int r = 0; r < 4; r++) { if (same() == 1) { return cout << Yes , 0; } rot(); } flh(); } flv(); } cout << No ; }
#include <bits/stdc++.h> using namespace std; int ntest = 0, test = 0; inline void init(); inline void run(); inline void stop() { ntest = test - 1; } int main() { init(); while (++test <= ntest) { run(); } return 0; } const int INF = (int)1E9 + 5; const double EPS = 1E-11; const long long MOD = (long long)1E9 + 7; const int dx[] = {-1, 0, 0, 1}; const int dy[] = {0, -1, 1, 0}; inline void init() { ntest = 1; } int cnt[(int)(1e6 + 5)]; inline void run() { int n, m, a, b; cin >> n >> m; for (int i = 0; i < (m); i++) { scanf( %d%d , &a, &b); cnt[a]++; cnt[b]++; } long long x = 0; for (int i = (1); i <= (n); i++) x += (n - 1 - cnt[i]) * cnt[i]; x /= 2; cout << (n - 1ll) * n * (n - 2ll) / 6 - x; }
#include <bits/stdc++.h> using namespace std; int n, qc; int a[100005]; int freq[100005], ord[100005], inv[100005]; int cnt[100005] = {}, small[100005] = {}; int from[100005], to[100005]; const int ROOT = 320; const int BIG_COUNT = 100; const int SMALL = (100000 + BIG_COUNT - 1) / BIG_COUNT; inline bool cmp(const int &lhs, const int &rhs) { return freq[lhs] > freq[rhs]; } inline bool qcmp(const int &lhs, const int &rhs) { if (from[lhs] / ROOT != from[rhs] / ROOT) return from[lhs] < from[rhs]; return to[lhs] < to[rhs]; } int l = 0, r = -1; void extendRight() { ++r; if (a[r] >= BIG_COUNT) { --small[cnt[a[r]]]; ++small[cnt[a[r]] + 1]; } ++cnt[a[r]]; } void extendLeft() { --l; if (a[l] >= BIG_COUNT) { --small[cnt[a[l]]]; ++small[cnt[a[l]] + 1]; } ++cnt[a[l]]; } void shrinkRight() { if (a[r] >= BIG_COUNT) { --small[cnt[a[r]]]; ++small[cnt[a[r]] - 1]; } --cnt[a[r]]; --r; } void shrinkLeft() { if (a[l] >= BIG_COUNT) { --small[cnt[a[l]]]; ++small[cnt[a[l]] - 1]; } --cnt[a[l]]; ++l; } priority_queue<int, vector<int>, greater<int> > q; int c[SMALL + 1]; int res[100005]; int main() { scanf( %d , &n); for (int i = 0; i < (int)(n); ++i) scanf( %d , a + i), --a[i]; for (int i = 0; i < (int)(n); ++i) ++freq[a[i]]; for (int i = 0; i < (int)(100000); ++i) ord[i] = i; sort(ord, ord + 100000, cmp); for (int i = 0; i < (int)(100000); ++i) inv[ord[i]] = i; for (int i = 0; i < (int)(n); ++i) a[i] = inv[a[i]]; scanf( %d , &qc); for (int i = 0; i < (int)(qc); ++i) scanf( %d%d , from + i, to + i), --from[i], --to[i]; for (int i = 0; i < (int)(qc); ++i) ord[i] = i; sort(ord, ord + qc, qcmp); for (int ii = 0; ii < (int)(qc); ++ii) { int i = ord[ii]; while (r < to[i]) extendRight(); while (l > from[i]) extendLeft(); while (r > to[i]) shrinkRight(); while (l < from[i]) shrinkLeft(); for (int j = 1; j <= SMALL; ++j) { c[j] = small[j]; } int ans = 0; int rem = -1; for (int i = 0; i < (int)(BIG_COUNT); ++i) if (cnt[i] <= SMALL) { ++c[cnt[i]]; } else { q.push(cnt[i]); } for (int j = 1; j <= SMALL; ++j) if (c[j]) { if (rem != -1) { --c[j]; ans += j + rem; if (j + rem <= SMALL) { ++c[j + rem]; } else { q.push(j + rem); } } ans += j * (c[j] & ~1); int nj = j << 1; if (nj <= SMALL) { c[nj] += c[j] >> 1; } else { for (int times = 0; times < (int)(c[j] >> 1); ++times) { q.push(nj); } } if (c[j] & 1) { rem = j; } else { rem = -1; } } if (rem != -1) { q.push(rem); } while ((int)q.size() > 1) { int a = q.top(); q.pop(); int b = q.top(); q.pop(); ans += a + b; q.push(a + b); } assert(!q.empty()); q.pop(); res[i] = ans; } for (int i = 0; i < (int)(qc); ++i) { printf( %d n , res[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; struct ring { int c1; int c2; int r1; int r2; }; int contour(struct ring a, struct ring b, double dist) { int cnt = 0; if (dist >= a.r2 + b.r2 || dist <= b.r1 - a.r2 || dist <= a.r2 - b.r2) cnt++; if (dist >= a.r1 + b.r2 || dist <= b.r1 - a.r1 || dist <= a.r1 - b.r2) cnt++; return cnt; } int main() { struct ring a, b; cin >> a.c1 >> a.c2 >> a.r1 >> a.r2; cin >> b.c1 >> b.c2 >> b.r1 >> b.r2; double dist = sqrt((a.c1 - b.c1) * (a.c1 - b.c1) + (a.c2 - b.c2) * (a.c2 - b.c2)); int ans = contour(a, b, dist) + contour(b, a, dist); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } inline void write(int a) { if (a >= 10) write(a / 10); putchar( 0 + a % 10); } inline void writeln(int a) { write(a); puts( ); } int n, ans; struct data { int bo; string first; }; map<string, data> M; const int N = 1005; string a[N], b[N], t; map<string, bool> MM; int main() { n = read(); for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (M[a[i]].bo) t = M[a[i]].first; else t = a[i]; M[a[i]] = (data){0, a[i]}; M[b[i]] = (data){1, t}; } for (int i = 1; i <= n; i++) { if (MM[b[i]]) continue; else MM[b[i]] = 1; if (M[b[i]].bo) ans++; } MM.clear(); writeln(ans); for (int i = 1; i <= n; i++) if (M[b[i]].bo && MM[b[i]] == 0) { MM[b[i]] = 1; cout << M[b[i]].first << << b[i] << endl; } }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; int n, m; double dp_mai[155], dp_cul[155]; int d_mai[155], d_cul[155]; bool adj[155][155], used[155]; void dijk(int source, int *d, double *dp) { fill(d + 1, d + n + 1, INF); memset(used, 0, sizeof(used)); d[source] = 0; dp[source] = 1.; for (int(i) = 0; (i) < (n); i++) { int id, low = INF; for (int(j) = (1); (j) <= (n); j++) { if (used[j]) continue; if (low > d[j]) { low = d[j]; id = j; } } used[id] = true; for (int(j) = (1); (j) <= (n); j++) { if (used[j] || !adj[id][j]) continue; if (d[j] > d[id] + 1) { d[j] = d[id] + 1; dp[j] = dp[id]; } else if (d[j] == d[id] + 1) { dp[j] += dp[id]; } } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; int x, y; for (int(i) = 0; (i) < (m); i++) { cin >> x >> y; adj[x][y] = adj[y][x] = true; } dijk(n, d_mai, dp_mai); dijk(1, d_cul, dp_cul); double res = 0.; for (int(i) = (1); (i) <= (n); i++) { double temp = 0.; for (int(j) = (1); (j) <= (n); j++) { if (!adj[i][j]) continue; if (d_mai[i] + d_cul[j] + 1 == d_mai[1]) temp += dp_mai[i] * dp_cul[j]; if (d_cul[i] + d_mai[j] + 1 == d_cul[n]) temp += dp_cul[i] * dp_mai[j]; } res = max(res, temp); } cout << fixed << setprecision(10) << res / dp_mai[1] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; using ll = long long; using pll = pair<ll, ll>; template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (const T &t : v) os << t << t; return os << endl; } template <class T> istream &operator>>(istream &is, vector<T> &v) { for (T &a : v) is >> a; return is; } template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &v) { return os << < << v.first << << v.second << > ; } bool solve() { int q; cin >> q; map<pll, ll> cost; for (int i = 0; i < (int)(q); i++) { int t; cin >> t; if (t == 1) { ll v, u, w; cin >> v >> u >> w; set<ll> visited; { ll vv = v; while (vv) { visited.insert(vv); vv /= 2; } } ll lca = -1; { ll uu = u; while (!visited.count(uu)) uu /= 2; lca = uu; } assert(lca > 0); while (v > lca) { cost[make_pair(v / 2, v)] += w; v /= 2; } while (u > lca) { cost[make_pair(u / 2, u)] += w; u /= 2; } } else if (t == 2) { ll v, u; cin >> v >> u; ll sum = 0; set<ll> visited; { ll vv = v; while (vv) { visited.insert(vv); vv /= 2; } } ll lca = -1; { ll uu = u; while (!visited.count(uu)) uu /= 2; lca = uu; } assert(lca > 0); while (v > lca) { sum += cost[make_pair(v / 2, v)]; v /= 2; } while (u > lca) { sum += cost[make_pair(u / 2, u)]; u /= 2; } cout << sum << endl; } else assert(0); } return false; } int main() { cin.tie(0); ios::sync_with_stdio(false); while (solve()) ; return 0; }
#include <bits/stdc++.h> using namespace std; bool cmp(const pair<int, int>& p1, const pair<int, int>& p2) { return p1.first < p2.first; } struct node { int a; int b; }; bool operator<(const node& x, const node& y) { return x.a > y.a; } int sol(int x) { int ans = 0; if (x == 0) return 10; if (x == 100) return 0; if (x % 10 == 0) return 10; while (x > ans) ans += 10; return ans - x; } int main() { int n, k; scanf( %d , &n); scanf( %d , &k); priority_queue<node> q; for (int i = 0; i < n; i++) { int x; node xx; scanf( %d , &x); int z; z = sol(x); xx.a = z; xx.b = x; q.push(xx); } int ans = 0; while (k > 0 && !q.empty()) { int xx = q.top().a; int yy = q.top().b; if (xx > k) break; if (xx == 0) { ans += (yy / 10); q.pop(); continue; } node my; my.b = yy + xx; my.a = sol(my.b); q.pop(); q.push(my); k -= xx; } while (!q.empty()) { ans += (q.top().b) / 10; q.pop(); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> inline int min(const int &first, const int &second) { return (((second - first) >> (32 - 1)) & (first ^ second)) ^ first; } inline int max(const int &first, const int &second) { return (((second - first) >> (32 - 1)) & (first ^ second)) ^ second; } inline long long min(const long long &first, const long long &second) { return (((second - first) >> (64 - 1)) & (first ^ second)) ^ first; } inline long long max(const long long &first, const long long &second) { return (((second - first) >> (64 - 1)) & (first ^ second)) ^ second; } using namespace std; char string_in_buffer[(int)260]; void fast_scan(int &first) { scanf( %d , &first); } void fast_scan(long long &first) { scanf( %lld , &first); } void fast_scan(unsigned long long &first) { scanf( %llu , &first); } void fast_scan(double &first) { scanf( %lf , &first); } void fast_scan(long double &first) { scanf( %Lf , &first); } void fast_scan(char &first) { scanf( %c , &first); if (first == n ) { fast_scan(first); } } void fast_scan(string &first) { scanf( %s , string_in_buffer); first = string(string_in_buffer); } template <class TFirst, class TSecond> void fast_scan(pair<TFirst, TSecond> &p) { fast_scan(p.first); fast_scan(p.second); } template <class T> void fast_scan(vector<T> &v) { for (auto &first : v) fast_scan(first); } void fast_print(const int &first) { printf( %d , first); } void fast_print(const unsigned int &first) { printf( %u , first); } void fast_print(const long long &first) { printf( %lld , first); } void fast_print(const unsigned long long &first) { printf( %llu , first); } void fast_print(const double &first) { printf( %.15lf , first); } void fast_print(const long double &first) { printf( %.15Lf , first); } void fast_print(const char &first) { printf( %c , first); }; void fast_print(const string &first) { printf( %s , first.c_str()); } void fast_print(const char v[]) { fast_print((string)v); } template <class TFirst, class TSecond> void fast_print(const pair<TFirst, TSecond> &p) { fast_print(p.first); fast_print( ); fast_print(p.second); } template <class T> void fast_print(const vector<T> &v) { if (v.empty()) return; fast_print(v[0]); for (int i = 1; i < v.size(); i++) { fast_print( ); fast_print(v[i]); } } template <class T> void fast_print(const vector<vector<T>> &v) { if (v.empty()) return; fast_print(v[0]); for (int i = 1; i < v.size(); i++) { fast_print( n ); fast_print(v[i]); } } template <class T> void fast_print(const T &v) { for (const auto &first : v) { fast_print(first); fast_print( ); } } using namespace std; namespace smart_io { string print_start = ; string sep = ; bool first_print = false; void precall_print() { fast_print(print_start); print_start = n ; first_print = true; } void _print(deque<string>) {} template <class T, class... Args> void _print(deque<string> names, T elem, Args... args) { if (!first_print) { fast_print( n ); } else { first_print = false; } fast_print(names.front()); fast_print( = ); fast_print(elem); names.pop_front(); _print(names, args...); } } // namespace smart_io template <class T> ostream &operator,(ostream &os, const T &object) { if (!smart_io::first_print) { fast_print(smart_io::sep); } else { smart_io::first_print = false; } fast_print(object); return os; } template <class T> istream &operator,(istream &is, T &object) { fast_scan(object); return is; } namespace escape__from__random__aetuhoetnuhshe { using namespace std::chrono; mt19937 rng(duration_cast<milliseconds>(system_clock::now().time_since_epoch()) .count()); uniform_real_distribution<> prob_dist(0.0, 1.0); }; // namespace escape__from__random__aetuhoetnuhshe namespace typedefs {} namespace numbers_operation { template <class T> T floor_mod(T a, T b) { if (a >= 0 && b >= 0) return a % b; if (a <= 0 && b <= 0) return a % b; return abs(b) - (abs(a) % abs(b)); } } // namespace numbers_operation using namespace numbers_operation; using namespace typedefs; using namespace escape__from__random__aetuhoetnuhshe; const int N = (1 << 18); int T[2 * N + 1], M[2 * N + 1]; void push(int i, int tl, int tr) { if (tl + 1 != tr) { M[i * 2 + 1] = max(M[i * 2 + 1], M[i]); M[i * 2 + 2] = max(M[i * 2 + 2], M[i]); } else { T[i] = max(T[i], M[i]); } M[i] = -1; } void change(int i, int tl, int tr, int j, int value) { push(i, tl, tr); if (tl + 1 == tr) { T[i] = value; } else { int m = (tl + tr) / 2; if (j < m) change(i * 2 + 1, tl, m, j, value); else change(i * 2 + 2, m, tr, j, value); } } int get(int i, int tl, int tr, int j) { push(i, tl, tr); if (tl + 1 == tr) return T[i]; int m = (tl + tr) / 2; if (j < m) return get(i * 2 + 1, tl, m, j); else return get(i * 2 + 2, m, tr, j); } signed main(signed argc, char *argv[]) { int n; cin, n; vector<int> v(n); cin, v; for (int i = 0; i < n; i++) change(0, 0, N, i, v[i]); int q; cin, q; for (int i = 0; i < q; i++) { int type; cin, type; if (type == 1) { int p, first; cin, p, first; p--; change(0, 0, N, p, first); } else { int first; cin, first; M[0] = max(M[0], first); } } for (int i = 0; i < n; i++) { smart_io::precall_print(); cout, get(0, 0, N, i); smart_io::print_start = ; } }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; using ll = long long; using ull = unsigned long long; using db = double; using ld = long double; template <typename T> using V = vector<T>; template <typename T> using VV = vector<vector<T>>; constexpr ll mod = 1000000007; constexpr ll INF = 1000000099; constexpr ll LINF = (ll)(1e18 + 99); const ld PI = acos((ld)-1); const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1}; template <typename T, typename U> inline bool chmin(T& t, const U& u) { if (t > u) { t = u; return 1; } return 0; } template <typename T, typename U> inline bool chmax(T& t, const U& u) { if (t < u) { t = u; return 1; } return 0; } template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } inline void yes() { cout << YES << n ; } inline void no() { cout << NO << n ; } template <typename T, typename Y> inline T mpow(T a, Y n) { T res = 1; for (; n; n >>= 1) { if (n & 1) res = res * a; a = a * a; } return res; } template <typename T> V<T> prefix_sum(const V<T>& v) { int n = v.size(); V<T> ret(n + 1); for (ll i = 0; i < (ll)(n); ++i) ret[i + 1] = ret[i] + v[i]; return ret; } template <typename T> istream& operator>>(istream& is, vector<T>& vec) { for (auto&& x : vec) is >> x; return is; } template <typename T, typename Y> ostream& operator<<(ostream& os, const pair<T, Y>& p) { return os << { << p.first << , << p.second << } ; } template <typename T> ostream& operator<<(ostream& os, const V<T>& v) { os << { ; for (auto e : v) os << e << , ; return os << } ; } template <typename... Args> void debug(Args&... args) { for (auto const& x : {args...}) { cerr << x << ; } cerr << n ; } template <typename T, typename Y, T(F_up)(T, T), Y(F_gt)(T, Y)> struct BUPSegTree { int sz, ex; T ini_d; vector<T> dat; BUPSegTree(vector<T> init, T _ini_d) : ini_d(_ini_d) { int n = (int)(init.size()); ex = 1; while ((1 << ex) < n) ex++; sz = (1 << ex); dat = vector<T>(2 * sz, ini_d); for (int i = 0; i < n; ++i) dat[sz + i] = init[i]; for (int i = sz - 1; i > 0; --i) dat[i] = F_up(dat[2 * i], dat[2 * i + 1]); } void up_q(int p, T x) { for (dat[p += sz] = x; p > 1; p >>= 1) { dat[p >> 1] = F_up(dat[p], dat[p ^ 1]); } } T get_q(int l, int r) { T res = ini_d; for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) { if (l & 1) { res = F_gt(res, dat[l]); ++l; } if (r & 1) { --r; res = F_gt(res, dat[r]); } } return res; } }; ll my_max(ll a, ll b) { return max(a, b); } signed main() { cin.tie(0); cerr.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); ll n; cin >> n; set<int> addse; V<int> buyt(n); V<int> addt(n); BUPSegTree<ll, ll, my_max, my_max> buymx(V<ll>(n * 2, -1), -1); for (ll i = 0; i < (ll)(n * 2); ++i) { char c; cin >> c; if (c == + ) addse.insert(i); else { int x; cin >> x; --x; buyt[x] = i; buymx.up_q(i, x); } } for (ll i = 0; i < (ll)(n); ++i) { ll b = buyt[i]; auto itr = addse.lower_bound(b); if (itr == addse.begin()) { no(); return 0; } --itr; ll a = *itr; if (buymx.get_q(a, b) > i) { no(); return 0; } addt[i] = a; addse.erase(itr); } yes(); V<pair<int, int>> ans(0); for (ll i = 0; i < (ll)(n); ++i) ans.emplace_back(addt[i], i); sort((ans).begin(), (ans).end()); for (ll i = 0; i < (ll)(n); ++i) cout << ans[i].second + 1 << ; cout << n ; }
#include <bits/stdc++.h> using namespace std; int p[100009], a[100009], pos[100009], m, n, ri[100009], le[100009]; set<pair<int, int>> st; inline bool cmp(const int& A, const int& B) { return p[A] < p[B]; } int getdis(int x, int y) { if (x == y) return 1000000000; int d = (p[y] - p[x] + m) % m; if (y < x) d = (d + a[y]) % m; if (d <= a[x]) return 1; if (a[x] <= a[y]) return 1000000000; return (d - a[y] - 1) / (a[x] - a[y]) + 1; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d%d , p + i, a + i), pos[i] = i, p[i]--; sort(pos + 1, pos + n + 1, cmp); for (int i = 1; i <= n; i++) ri[pos[i]] = pos[i + 1], le[pos[i]] = pos[i - 1]; ri[pos[n]] = pos[1], le[pos[1]] = pos[n]; for (int i = 1; i <= n; i++) st.insert(make_pair(getdis(i, ri[i]), i)); while (1) { if (st.begin()->first == 1000000000) break; int u = st.begin()->second; st.erase(st.begin()); st.erase(make_pair(getdis(ri[u], ri[ri[u]]), ri[u])); if (!st.empty()) st.erase(make_pair(getdis(le[u], u), le[u])); p[u] += getdis(u, ri[u]), p[u] %= m, a[u]--; ri[u] = ri[ri[u]], le[ri[u]] = u; st.insert(make_pair(getdis(le[u], u), le[u])), st.insert(make_pair(getdis(u, ri[u]), u)); } printf( %lu n , st.size()); for (set<pair<int, int>>::iterator it = st.begin(); it != st.end(); it++) printf( %d , it->second); return 0; }
#include <bits/stdc++.h> using namespace std; double A[200009]; double B[200009]; int main() { int N, i; cin >> N; for (i = 0; i < N; i++) { cin >> A[i]; } B[0] = A[0]; for (i = 1; i < N; i++) { B[i] = (B[i - 1] + 1) * A[i]; } double sum = 0; for (i = 0; i < N; i++) { sum += 2 * B[i]; sum -= A[i]; } printf( %0.15lf n , sum); return 0; }
#include <bits/stdc++.h> using namespace std; long long int powm(long long int a, int b, int n) { long long int rm = 1; while (b) { if (b % 2) { rm = (rm * a) % n; } a = (a * a) % n; b /= 2; } return rm; } int nxt[int(1e5 + 1000)] = {0}, g, r, tq[int(1e5 + 1000)]; long long int timedp[int(1e5 + 1000)], l[int(1e5 + 1000)], layer; int seg[4 * int(1e5 + 1000)]; pair<int, int> diff[int(1e5 + 1000)]; int rev[int(1e5 + 1000)]; const long long int ninf = -10000000000000000L; int mod; void update(int node, int it, int f, int q, int val) { if (it == f) { seg[node] = val; return; } int m = (it + f) / 2; if (q <= m) update(node * 2, it, m, q, val); else update(node * 2 + 1, m + 1, f, q, val); seg[node] = min(seg[node * 2], seg[node * 2 + 1]); } int get(int node, int it, int f, int q1, int q2) { if (it == q1 && f == q2) return seg[node]; int m = (it + f) / 2; if (q2 <= m) return get(node * 2, it, m, q1, q2); else if (q1 > m) return get(node * 2 + 1, m + 1, f, q1, q2); else { int val = get(node * 2, it, m, q1, m); return min(val, get(node * 2 + 1, m + 1, f, m + 1, q2)); } } pair<int, int> go(int n, int l1, int r1) { int it = 1, f = n + 1, m; while (it != f) { m = (it + f) / 2; if (diff[m].first >= l1) f = m; else it = m + 1; } int l1v = f; it = 1, f = n + 1; while (it != f) { m = (it + f) / 2; if (diff[m + 1].first <= r1) it = m + 1; else f = m; } int r1v = f; if (r1v < l1v) return make_pair(-1, -1); return make_pair(l1v, r1v); } void insert(int node, int it, int f) { if (it == f) { seg[node] = diff[f].second; return; } int m = (it + f) / 2; insert(node * 2, it, m); insert(node * 2 + 1, m + 1, f); seg[node] = min(seg[node * 2], seg[node * 2 + 1]); } int main() { int n, Q; scanf( %d , &n); ; scanf( %d , &g); ; scanf( %d , &r); ; mod = g + r; l[0] = 0; int val; for (int i = int(1); i <= (int)n + 1; i++) { scanf( %d , &val); ; l[i] = val; l[i] += l[i - 1]; } layer = 0; diff[n + 1] = make_pair(0, n + 1); for (int i = n; i >= 1; --i) { layer += l[i + 1] - l[i]; layer %= mod; long long int l2 = -layer; l2 = (l2 % mod + mod) % mod; diff[i] = make_pair((int)l2, i); } sort(diff + 1, diff + n + 2); for (int i = int(1); i <= (int)4 * int(1e5 + 1000) - 1; i++) seg[i] = 1e9; for (int i = int(1); i <= (int)n + 1; i++) rev[diff[i].second] = i; update(1, 1, n + 1, rev[n + 1], n + 1); layer = 0; int it, f, m; nxt[n + 1] = n + 1; timedp[n + 1] = 0; for (int i = n; i >= 1; --i) { layer += l[i + 1] - l[i]; layer %= mod; update(1, 1, n + 1, rev[i], i); int l1 = g + r + (g - layer), r1 = g + r - 1; nxt[i] = 1e9; if (r1 >= l1) { pair<int, int> qu = go(n, l1, r1); int l1v = qu.first, r1v = qu.second; if (l1v != -1 && diff[l1v].first >= l1 && diff[r1v].first <= r1) { nxt[i] = get(1, 1, n + 1, l1v, r1v); } } int l2 = max(0, g - (int)layer), r2 = g + r - 1 - layer; pair<int, int> qu = go(n, l2, r2); int l2v = qu.first, r2v = qu.second; if (l2v != -1 && diff[l2v].first >= l2 && diff[r2v].first <= r2) nxt[i] = min(nxt[i], get(1, 1, n + 1, l2v, r2v)); if (nxt[i] > 2 * n) nxt[i] = n + 1; timedp[i] = l[nxt[i]] - l[i]; if (nxt[i] < n + 1) timedp[i] += (r + g - (l[nxt[i]] - l[i]) % mod) + timedp[nxt[i]]; } scanf( %d , &Q); ; for (int i = int(1); i <= (int)Q; i++) scanf( %d , &tq[i]); ; layer = 0; for (int i = 1; i <= n + 1; ++i) { layer += l[i] - l[i - 1]; diff[i] = make_pair(layer % mod, i); } sort(diff + 1, diff + n + 2); for (int i = int(1); i <= (int)n + 1; i++) rev[diff[i].second] = i; insert(1, 1, n + 1); int l1v, r1v; for (int i = int(1); i <= (int)Q; i++) { layer = tq[i] % mod; int l1 = g + r + (g - layer), r1 = g + r - 1; int nxt2 = 1e9; l1v = r1v = 1e9; if (r1 >= l1) { pair<int, int> qu = go(n, l1, r1); l1v = qu.first, r1v = qu.second; if (l1v != -1 && diff[l1v].first >= l1 && diff[r1v].first <= r1) { nxt2 = get(1, 1, n + 1, l1v, r1v); } } int l2 = max(0, g - (int)layer), r2 = g + r - 1 - layer; pair<int, int> qu = go(n, l2, r2); int l2v = qu.first, r2v = qu.second; if (l2v != -1 && diff[l2v].first >= l2 && diff[r2v].first <= r2) nxt2 = min(nxt2, get(1, 1, n + 1, l2v, r2v)); if (nxt2 > 2 * n) nxt2 = n + 1; long long int actual_time = tq[i] + l[nxt2]; if (nxt2 < n + 1) actual_time += (g + r - (l[nxt2] + tq[i]) % mod) + timedp[nxt2]; printf( %lld n , actual_time); } return 0; }