func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int b[10][10]; char c[10][4][4]; int main() { char ch; int x = 1, y = 1, x1, y1, l, z, i, j, r; x1 = 3, y1 = 3; for (i = 1; i <= 9; ++i) { if (i > x1) ++x, x1 += 3; y1 = 3; y = 1; for (j = 1; j <= 9; ++j) { if (j % 3 == 0) r = 3; else r = j % 3; if (i % 3 == 0) l = 3; else l = i % 3; if (j > y1) ++y, y1 += 3; cin >> c[x * 3 - (3 - y)][l][r]; } } cin >> x >> y; if (x % 3 == 0) x = 3; else x %= 3; if (y % 3 == 0) y = 3; else y %= 3; bool nu = 1; for (i = 1; i <= 3 && nu; ++i) { for (j = 1; j < 3; ++j) { if (c[x * 3 - (3 - y)][i][j] == . ) nu = 0; } } if (nu) { x1 = 3, y1 = 3; x = y = 1; for (i = 1; i <= 9; ++i) { if (i > x1) ++x, x1 += 3, cout << n ; y1 = 3; y = 1; for (j = 1; j <= 9; ++j) { if (j % 3 == 0) r = 3; else r = j % 3; if (i % 3 == 0) l = 3; else l = i % 3; if (j > y1) ++y, y1 += 3, cout << ; if (c[x * 3 - (3 - y)][l][r] == . ) cout << ! ; else cout << c[x * 3 - (3 - y)][l][r]; } cout << n ; } } else { int x3 = x, y3 = y; x1 = 3, y1 = 3; x = y = 1; for (i = 1; i <= 9; ++i) { if (i > x1) ++x, x1 += 3, cout << n ; y1 = 3; y = 1; for (j = 1; j <= 9; ++j) { if (j % 3 == 0) r = 3; else r = j % 3; if (i % 3 == 0) l = 3; else l = i % 3; if (j > y1) ++y, y1 += 3, cout << ; if (x3 == x && y3 == y) { if (c[x * 3 - (3 - y)][l][r] == . ) cout << ! ; else cout << c[x * 3 - (3 - y)][l][r]; } else cout << c[x * 3 - (3 - y)][l][r]; } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long double x[2], y[2], r[2]; inline long double sqr(long double x) { return x * x; } inline long long sqrl(long long x) { return x * x; } inline long double fcos(long double a, long double b, long double c) { return acosl((a * a + b * b - c * c) / (2 * a * b)); } inline long double cut(long double ang, long double r) { long double s1 = ang * r * r; long double s2 = sinl(ang) * cosl(ang) * r * r; return s1 - s2; } const long double pi = acosl(-1); long double solve() { if (r[0] > r[1]) { swap(r[0], r[1]); swap(x[0], x[1]); swap(y[0], y[1]); } long long dx = x[0] - x[1], dy = y[0] - y[1]; long long ds = sqrl(dx) + sqrl(dy); if (ds >= sqrl(r[0] + r[1])) return 0; long double d = sqrtl(ds); if (d + r[0] <= r[1]) return sqr(r[0]) * pi; long double ang[2]; ang[0] = fcos(d, r[0], r[1]); ang[1] = fcos(d, r[1], r[0]); return cut(ang[0], r[0]) + cut(ang[1], r[1]); } int main() { cin >> x[0] >> y[0] >> r[0] >> x[1] >> y[1] >> r[1]; cout << setprecision(8) << solve() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, mini, maxi; cin >> n >> m; long long x = n / m; long long rem = n - (x * m); mini = rem * (x * (x + 1)) / 2 + (m - rem) * (x * (x - 1)) / 2; maxi = ((n - m + 1) * (n - m)) / 2; cout << mini << << maxi; } |
#include <bits/stdc++.h> using namespace std; bool p[5000020]; int prime[5000020]; void criba() { p[0] = false; p[1] = false; for (int i = 2; i <= 5000000; i++) p[i] = true; for (int i = 2; i <= 5000000; i++) { if (p[i]) { prime[i] = 1; for (int h = 2; i * h <= 5000000; h++) { p[i * h] = false; if (h >= i and h % i == 0) { int cnt = 0, x = i * h; while (x % i == 0) { cnt++; x = x / i; } prime[i * h] += cnt; } else prime[i * h]++; } } } int sum = 0; for (int i = 1; i <= 5000000; i++) prime[i] += prime[i - 1]; } int main() { int tc, a, b; cin >> tc; memset(prime, 0, sizeof(prime)); criba(); while (tc--) { scanf( %d%d , &a, &b); printf( %d n , prime[a] - prime[b]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k; int n, m; double H, L; cin >> H >> L; cout << fixed << setprecision(10) << ((L * L - H * H) / (2 * H)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000100; int dp[N][2]; int a[] = {1, 2}; int solve(int sum, int idx) { if (sum == 0) return 1; if (sum < 0 || idx == 2) return 0; if (dp[sum][idx] != -1) return dp[sum][idx]; return dp[sum][idx] = solve(sum - a[idx], idx) + solve(sum, idx + 1); } int main() { int n; scanf( %d , &n); memset(dp, -1, sizeof(dp)); for (int i = 1; i < N; ++i) { int ans = solve(i, 0); if (ans == n) { printf( %d 2 n1 2 , i); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 600009; const long long MOD = 1e9 + 7; class { public: int n, F[MAXN], G[MAXN]; string s; int Min; void solve() { cin >> n >> s; for (int i = 1; i <= n; ++i) { if (s[i - 1] == ( ) F[i] = F[i - 1] + 1; else F[i] = F[i - 1] - 1; Min = min(Min, F[i]); } for (int i = n + 1; i <= n + n; ++i) { if (s[i - n - 1] == ( ) F[i] = F[i - 1] + 1; else F[i] = F[i - 1] - 1; Min = min(Min, F[i]); } if (F[n] != 0) { cout << 0 << n << 1 << << 1 << n ; return; } int L, R; for (int i = 0; i <= n; ++i) { if (F[i] == Min) { L = i, R = i + n - 1; } } int tmp = 0; for (int i = L; i <= R; ++i) { if (F[i] == Min) tmp++; } int count = 0, nl = 0, nr, ans = tmp, ansl = 1, ansr = 0; for (int i = L; i <= R; ++i) { if (F[i] - 2 >= Min) { if (!nl) nl = nr = i; else nr = i; if (F[i] - 2 == Min) count++; } else { nl = 0; count = 0; } if (tmp + count > ans) { ans = tmp + count; ansl = nl; ansr = nr; } } count = 0; nl = 0; for (int i = L; i <= R; ++i) { if (F[i] - 2 >= Min - 1) { if (!nl) nl = nr = i; else nr = i; if (F[i] - 2 == Min - 1) count++; } else { nl = count = 0; } if (count > ans) { ans = count; ansl = nl; ansr = nr; } } ansr++; if (ansl > n) ansl -= n; if (ansr > n) ansr -= n; cout << ans << n << ansl << << ansr << n ; } } NSPACE; int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); NSPACE.solve(); } |
#include <bits/stdc++.h> using namespace std; const bool testcase = 0; const long long int mod1 = 1000000007; const long long int mod2 = 998244353; const long long int N = 1e5 + 5; std::vector<long long int> adj[N]; std::vector<long long int> vis(N, false); bool hasLoop(long long int i, long long int p) { vis[i] = true; bool ans = false; for (auto it : adj[i]) { if (!vis[it]) { ans |= hasLoop(it, i); } else if (it != p) { ans |= true; } } return ans; } void dfs(long long int i) { vis[i] = true; for (auto it : adj[i]) { if (!vis[it]) { dfs(it); } } } void solve() { long long int n, m; cin >> n >> m; for (int i = 0; i < m; ++i) { long long int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } bool ok = true; dfs(1); for (int i = 1; i <= n; ++i) { ok &= (vis[i] == 1); } if (ok && n == m) { cout << FHTAGN! n ; } else { cout << NO n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int T_T = 1; if (testcase) { cin >> T_T; } while (T_T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, e_min = INT_MAX, e_max = INT_MIN; list<int> l; cin >> n; for (int i = 1; i <= n; ++i) { cin >> x; if (x < e_min) e_min = x; if (x > e_max) e_max = x; l.push_back(x); } l.remove_if( [e_min, e_max](int it) { return (it == e_min) || (it == e_max); }); cout << l.size(); } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(0); long long n, m, k, x, y; cin >> n >> m >> k >> x >> y; long long ti = (n * m) + ((n - 2) * m); if (n == 1 || n == 2) ti = n * m; long long upd = 0, mid = 0; long long a[110][110]; long long num = k / ti; long long rem = k % ti; upd = num; mid = 2 * num; long long ma = mid, mi = upd, ans; if (n == 1 || n == 2) { ma = mi; } if (x - 1 == 0 || x - 1 == n - 1) ans = mi; else ans = ma; if (rem == 0) { cout << ma << << mi << << ans << endl; return 0; } long long flag = 0; if (rem != 0) { for (long long i = 0; i < n; ++i) for (long long j = 0; j < m; ++j) { if (i == 0 || i == n - 1) { a[i][j] = upd; } else { a[i][j] = mid; } } for (long long i = 0; i < n; ++i) { for (long long j = 0; j < m; ++j) { if (i == 0 || i == n - 1) { a[i][j]++; rem--; } else { a[i][j]++; rem--; } if (rem == 0) { flag = 1; break; } } if (flag) break; } } flag = 0; if (rem != 0) { for (long long i = n - 2; i > 0; i--) { for (long long j = 0; j < m; ++j) { a[i][j]++; rem--; if (rem == 0) { flag = 1; break; } } if (flag) break; } } ma = -INFINITY, mi = INFINITY; for (long long i = 0; i < n; ++i) for (long long j = 0; j < m; ++j) { ma = max(a[i][j], ma); mi = min(a[i][j], mi); if (i == x - 1 && j == y - 1) { ans = a[i][j]; } } cout << ma << << mi << << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1001]; int main() { int n, m, c, q = 0; cin >> n >> m >> c; while (m-- && q <= n) { int x; cin >> x; if (x > c / 2) for (q = n; a[q] >= x; --q) ; else for (q = 1; a[q] && a[q] <= x; ++q) ; cout << q << endl; fflush(stdout); a[q] = x; for (q = 1; q <= n && a[q]; ++q) ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, m, i; cin >> n; if (n < 4) { cout << NO << endl; return 0; } cout << YES << endl; if (n % 2) cout << 5 * 4 = 20 << endl << 20 + 3 = 23 << endl << 23 + 2 = 25 << endl << 25 - 1 = 24 << endl, m = 1; else cout << 1 * 2 = 2 << endl << 2 * 3 = 6 << endl << 4 * 6 = 24 << endl, m = 0; for (i = n; i >= 5 + m; i -= 2) cout << i << - << i - 1 << = 1 << endl << 24 * 1 = 24 << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, i, sum = 0; scanf( %d%d%d%d , &a, &b, &c, &d); string str; cin >> str; for (int i = 0; i < str.length(); i++) { if (str[i] == 1 ) sum += a; if (str[i] == 2 ) sum += b; if (str[i] == 3 ) sum += c; if (str[i] == 4 ) sum += d; } printf( %d , sum); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; bool isSquare(int r) { return int(sqrt((double)r)) * int(sqrt((double)r)) == r; } bool check(int a, int b, int c, int d, int N, int M) { int ans = 0; ans += isSquare(a * a * (M - 1) + b * b); ans += isSquare(a * a * (N - 1) + c * c); ans += isSquare(b * b * (N - 1) + d * d); ans += isSquare(c * c * (M - 1) + d * d); return ans == 4; } int _127 = 100; int main() { int N, M; cin >> N >> M; int a, b, c, d; do { a = 1 + (rand() % _127); b = 1 + (rand() % _127); c = 1 + (rand() % _127); d = 1 + (rand() % _127); } while (!check(a, b, c, d, N, M)); for (long long i = 0; i < (int)N - 1; i++) { for (long long j = 0; j < (int)M - 1; j++) { cout << a << ; } cout << b << endl; } for (long long j = 0; j < (int)M - 1; j++) { cout << c << ; } cout << d << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T, size_t... Is> struct arr_helper; template <class T, size_t... Is> using arr = typename arr_helper<T, Is...>::type; template <class T> struct arr_helper<T> { using type = T; }; template <class T, size_t I, size_t... Is> struct arr_helper<T, I, Is...> { using type = array<arr<T, Is...>, I>; }; using ll = int64_t; using u64 = uint64_t; using u32 = uint32_t; using vi = vector<int>; using vvi = vector<vi>; using pi = pair<int, int>; using vpi = vector<pi>; struct DSF { vi p; int c; DSF(int n) : p(n), c(n) { iota(begin(p), end(p), 0); } int repr(int i) { if (p[i] != i) p[i] = repr(p[i]); return p[i]; } bool join(int a, int b) { a = repr(a), b = repr(b); c -= a != b; p[a] = b; return a != b; } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vpi p(n); for (auto& [xi, yi] : p) cin >> xi >> yi; vi c(n), k(n); for (auto& ci : c) cin >> ci; for (auto& ki : k) cin >> ki; vector<tuple<ll, int, int>> e; for (int i = 0; i < n; ++i) e.emplace_back(c[i], i, n); for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { ll per_km = k[i] + k[j]; ll xdist = abs(p[i].first - p[j].first); ll ydist = abs(p[i].second - p[j].second); e.emplace_back(per_km * (xdist + ydist), i, j); } } sort(begin(e), end(e)); DSF dsf(n + 1); vi station; vpi conn; ll cost = 0; for (auto [c, a, b] : e) { if (dsf.join(a, b)) { if (b == n) station.push_back(a); else conn.emplace_back(a, b); cost += c; } } cout << cost << n << station.size() << n ; for (auto i : station) cout << (i + 1) << ; cout << n << conn.size() << n ; for (auto [a, b] : conn) cout << (a + 1) << << (b + 1) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; vector<long long> left; vector<long long> right; long long ok = 0; for (long long i = 0; i < n; i++) { string s; cin >> s; long long l = 0, r = 0; for (auto it : s) { if (it == ( ) { l++; } else if (it == ) && l != 0) { l--; } else { r++; } } if (r == 0 && l != 0) { left.push_back(l); } if (r != 0 && l == 0) { right.push_back(r); } if (r == 0 && l == 0) { ok++; } } sort(left.begin(), left.end()); sort(right.begin(), right.end()); long long r = 0; long long ans = 0; for (long long l = 0; l < left.size(); l++) { long long cur = left[l]; while (r < right.size() && right[r] < cur) { r++; } if (r < right.size() && right[r] == cur) { r++; ans++; } if (r == right.size()) break; } ans += ok / 2; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int t, n, l, r, pos; char in[1000], ans[1000][10]; bool back; int main() { scanf( %d , &t); while (t--) { back = false; scanf( %s , in); n = strlen(in); for (int i = 1; i <= 8; i++) for (int j = 0; j <= 3; j++) ans[i][j] = 0 ; pos = 1; l = r = 0; for (int i = 0; i < n;) { if (in[i] == : ) { if (in[i + 1] == : ) { l = i + 2; i += 2; back = true; pos = 8; } else { l = i + 1; i++; } continue; } while (i + 1 < n && in[i + 1] != : ) i++; r = i; int x = 4 - (r - l + 1); for (int j = r; j >= l; j--) { ans[pos][j - l + x] = in[j]; } if (!back) pos++; else pos--; i++; } if (!back) { for (int i = 1; i <= 8; i++) { if (i != 1) putchar( : ); for (int j = 0; j <= 3; j++) putchar(ans[i][j]); } } else { for (int i = 1; i <= pos; i++) { if (i != 1) putchar( : ); for (int j = 0; j <= 3; j++) putchar(ans[i][j]); } for (int i = 8; i >= pos + 1; i--) { putchar( : ); for (int j = 0; j <= 3; j++) putchar(ans[i][j]); } } puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; int pw = 1; for (int i = 2; i <= n + 10; i++) { pw *= 2; if (pw > n) { pw /= 2; break; } } int t = 0; for (int i = 1; i <= n - 1; i++) { if (a[i] <= 0) { cout << t << n ; continue; } while (i + pw > n) pw /= 2; t += a[i]; a[i + pw] += a[i]; a[i] = 0; cout << t << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; cout << s.size() * 25 + 26 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; if (s[0] == > ) { cout << 0; } else if (s[n - 1] == < ) cout << 0; else if (s[0] == < ) { int count1 = 0, count2 = 0; for (int i = 0; i < n; i++) { if (s[i] == > ) break; count1++; } for (int i = n - 1; i >= 0; i--) { if (s[i] == < ) break; count2++; } int ans = min(count1, count2); cout << ans; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : -x; } int n; int m; vector<pair<int, int> > w[5000]; pair<int, int> v[5000]; int p[5000], u[5000], pc[5000], px[5000], res[5000]; int go(int x, int p) { for (int i = 0; i < ((int)(w[x]).size()); i++) { int y = w[x][i].first; int z = w[x][i].second; if (y != p) { px[y] = x; pc[y] = z; go(y, x); } } return 0; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &v[i].first); v[i].second = i; } sort(v, v + n); for (int i = 1; i < n; i++) { int a, b, c; scanf( %d%d%d , &a, &b, &c); a--; b--; w[a].push_back(make_pair(b, c)); w[b].push_back(make_pair(a, c)); } go(0, 0); for (int i = 0; i < n; i++) { p[i] = i; res[i] = -1; } int it = 0; while (true) { int ok = 1; for (int i = 0; i < n; i++) u[i] = 0; for (int i = 0; i < n; i++) { int j = v[i].second; if (p[j] > 0 && u[p[j]] < pc[p[j]]) { ok = 0; u[p[j]]++; p[j] = px[p[j]]; } else if (p[j] == 0 && res[j] == -1) res[j] = it; } if (ok) break; it++; } for (int i = 0; i < n; i++) printf( %d , res[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long ll, tt, i, j, a[234567], b[211212], c[211456], d[213456]; long long x, m, n, r, s, t, k, l, y, z; vector<long long> p[12], q; pair<long long, long long> pp[345678]; int main() { cin >> n; for (i = 1; i <= n; i++) { cin >> x; if (x == 1) { a[i]++; } else { b[i]++; } a[i] += a[i - 1]; b[i] += b[i - 1]; } for (t = 1; t <= n; t++) { x = 0; y = 0; l = 0; r = 0; z = 0; do { x = lower_bound(a + z + 1, a + n + 1, a[z] + t) - a; y = lower_bound(b + z + 1, b + n + 1, b[z] + t) - b; if (x < y) { l++; z = x; } else { r++; z = y; } } while (x + y <= 2 * n); if (z == n && l != r) { if (x == n && l < r) continue; if (y == n && l > r) continue; pp[s].first = max(l, r); pp[s].second = t; s++; } } sort(pp, pp + s); cout << s << endl; for (i = 0; i < s; i++) cout << pp[i].first << << pp[i].second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long zero = 0; long long one = 1; 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 expo(long long x, long long y) { long long res = 1; x = x % 1000000007; while (y > 0) { if (y & 1) res = (1ll * res * x) % 1000000007; y = y >> 1; x = (1ll * x * x) % 1000000007; } return res; } long long ncr(long long n, long long r) { long long res = 1; if (r > n - r) r = n - r; for (long long i = 0; i < r; i++) { res *= n - i; res /= i + 1; } return res; } long long max(long long a, long long b) { return (a > b) ? a : b; } bool prime(long long n) { long long i; for (i = 2; i <= sqrt(n); i++) { if (n % i == 0) return false; } return true; } bool sortbysec(const pair<long long, long long> &a, const pair<long long, long long> &b) { if (a.second == b.second) return a.first < b.first; return (a.second < b.second); } long long rr[] = { 0, 1, 1, 1, 0, -1, -1, -1, }; long long cc[] = {1, 1, 0, -1, -1, -1, 0, 1}; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; string s; cin >> s; if (n == 1) return cout << 0, 0; long long dp[2][n]; memset(dp, 0, sizeof(dp)); dp[0][0] = (s[0] == 0 ); dp[1][0] = (s[0] == 1 ); for (long long i = 1; i < n; i++) { dp[1][i] = dp[0][i - 1] + (s[i] == 1 ); dp[0][i] = dp[1][i - 1] + (s[i] == 0 ); } cout << min(dp[0][n - 1], dp[1][n - 1]); } |
#include <bits/stdc++.h> using namespace std; const int N = 300005; struct Tree { int l, r, num1; long long num2; } T[N * 4]; struct Ask { int l, r, col; Ask(int _l = 0, int _r = 0, int _col = 0) { l = _l; r = _r; col = _col; } inline bool operator<(const Ask &b) const { return l < b.l || (b.l == l && r < b.r); } }; set<Ask> S; set<int> S2; vector<int> v1[N << 1], v2[N << 1]; vector<pair<int, int> > A[N], B[N]; int l[N], r[N], a[N << 1], tot, n, k, R[N], L[N]; long long now, ppp; inline int pd(int x) { long long now = 0, cnt = 0; for (int i = 1, j = 0; i <= n; i++) { if (i != 1) { for (pair<int, int> k : A[i - 1]) if (k.first > j) now -= k.second; } while (now < x) { j++; for (pair<int, int> k : B[j]) if (k.first < i) now += k.second; } cnt += n - j + 1; R[i] = j; } ppp = cnt - k; return cnt >= k; } inline int ef(int x) { int l = 1, r = tot; while (l < r) { int mid = (l + r) / 2; if (a[mid] < x) l = mid + 1; else r = mid; } return l; } inline void build(int x, int l, int r) { T[x].l = l; T[x].r = r; if (l == r) return; int mid = (l + r) / 2; build(x * 2, l, mid); build(x * 2 + 1, mid + 1, r); } inline void insert(int x, int y, int z) { T[x].num1++; T[x].num2 += z; if (T[x].l == T[x].r) return; int mid = (T[x].l + T[x].r) / 2; if (y <= mid) insert(x * 2, y, z); else insert(x * 2 + 1, y, z); } inline long long find(int x, int l, int r, long long z) { if (T[x].l > r || l > T[x].r) return 0; if (T[x].l >= l && T[x].r <= r) return T[x].num1 * z - T[x].num2; return find(x * 2, l, r, z) + find(x * 2 + 1, l, r, z); } inline long long solve(int l, int r) { l++; return find(1, l, L[r], r); } inline void Insert(int x) { set<int>::iterator iter = S2.upper_bound(x), iter2 = iter; iter2--; now -= solve(*iter2, *iter); now += solve(*iter2, x); now += solve(x, *iter); S2.insert(x); } inline void Del(int x) { set<int>::iterator iter = S2.find(x), iter2 = iter; iter2--; iter++; now += solve(*iter2, *iter); now -= solve(*iter2, x); now -= solve(x, *iter); S2.erase(x); } signed main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d%d , &l[i], &r[i]), r[i]--; l[n + 1] = 1; r[n + 1] = 1e9; S.insert(Ask(1, 1e9, 0)); for (int i = 1; i <= n + 1; i++) { set<Ask>::iterator iter = S.upper_bound(Ask(l[i], 1e9, 0)); iter--; vector<Ask> add; add.push_back(Ask(l[i], r[i], i)); for (; iter != S.end() && (*iter).l <= r[i];) { int len = min(r[i], (*iter).r) - max(l[i], (*iter).l) + 1; if ((*iter).col != 0) A[(*iter).col].push_back(make_pair(i, len)); B[i].push_back(make_pair((*iter).col, len)); if ((*iter).l < l[i]) add.push_back(Ask((*iter).l, l[i] - 1, (*iter).col)); if ((*iter).r > r[i]) add.push_back(Ask(r[i] + 1, (*iter).r, (*iter).col)); S.erase(iter++); } for (Ask j : add) S.insert(j); } int lll = 0, rrr = 1e9; while (lll < rrr) { int mid = (lll + rrr + 1) / 2; if (pd(mid)) lll = mid; else rrr = mid - 1; } pd(lll); for (int i = 1; i <= n; i++) L[R[i]] = i; for (int i = 1; i <= n + 1; i++) L[i] = max(L[i - 1], L[i]); for (int i = 1; i <= n; i++) { r[i]++; a[++tot] = l[i]; a[++tot] = r[i]; } sort(a + 1, a + tot + 1); int num = 1; for (int i = 2; i <= tot; i++) if (a[i] != a[num]) a[++num] = a[i]; tot = num; for (int i = 1; i <= n; i++) l[i] = ef(l[i]), r[i] = ef(r[i]), v1[l[i]].push_back(i), v2[r[i]].push_back(i); long long ans = 0; k = ppp; now = k; S2.insert(0); S2.insert(n + 1); build(1, 1, n); for (int i = 1; i <= n; i++) insert(1, i, R[i]); for (int i = 1; i < tot; i++) { for (int j : v1[i]) Insert(j); for (int j : v2[i]) Del(j); ans += (long long)(k - now) * (a[i + 1] - a[i]); } printf( %lld n , ans - ppp * lll); return 0; } |
#include <bits/stdc++.h> int main() { int i, sum = 0, n; for (i = 1; i <= 5; i++) { scanf( %d , &n); sum += n; } if (sum % 5 == 0 && sum != 0) printf( %d n , sum / 5); else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200001; long long int sz[N], dist[N], every[N]; vector<int> adj[N]; int n, k; void dfs(int start, int p = -1) { for (auto child : adj[start]) { if (child != p) { dfs(child, start); sz[start] += sz[child]; dist[start] += dist[child] + sz[child]; } } } void dfs1(int start, int p = -1) { for (auto child : adj[start]) { if (child != p) { every[child] = every[start] + (2 * k - 2 * sz[child]); dfs1(child, start); } } } int main() { scanf( %d%d , &n, &k); for (int i = 0; i < 2 * k; i++) { int x; scanf( %d , &x); sz[x]++; } for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d%d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } dfs(1); every[1] = dist[1]; dfs1(1); long long int ans = dist[1]; for (int i = 1; i <= n; i++) { ans = min(ans, every[i]); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e6 + 3; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) { long long int n, m; cin >> n; long long int a[n + 1]; long long int i = 0; for (i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long int flag = 0; for (i = 1; i < n; i++) { if (abs(a[i] - a[i - 1]) > 1) { flag = 1; break; } } if (flag == 1) cout << NO << endl; else cout << YES << endl; } } |
#include <bits/stdc++.h> int main() { int i, j, n, r = 0, c = 0, ans = 0; char str[107][107]; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %s , str[i]); r = 0; for (j = 0; j < n; ++j) { if (str[i][j] == C ) { ++r; } } ans += (r * (r - 1)) / 2; } for (j = 0; j < n; ++j) { c = 0; for (i = 0; i < n; ++i) { if (str[i][j] == C ) { ++c; } } ans += (c * (c - 1)) / 2; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int NAX = 2e5 + 5, MOD = 1000000007; struct Node { set<pair<int, int>> vals; Node() {} Node lazylazyMerge(const Node &rhs) {} Node seglazyMerge(const Node &rhs, const int &l, const int &r) {} Node segSegMerge(const Node &rhs) {} }; template <typename segNode> struct Segtree { vector<segNode> Seg, Lazy; vector<segNode> Base; vector<bool> isLazy; int n; Segtree(int _n = 2e5) { this->n = _n; Seg.resize(4 * _n + 10); Lazy.resize(4 * _n + 10); isLazy.resize(4 * _n + 10); } void merge(segNode &curr, segNode &l, segNode &r) { curr = l + r; } void propagate(int node, int L, int R) { if (isLazy[node]) { isLazy[node] = false; Seg[node] = Seg[node].seglazyMerge(Lazy[node], L, R); if (L != R) { Lazy[2 * node] = Lazy[2 * node].lazylazyMerge(Lazy[node]); Lazy[2 * node + 1] = Lazy[2 * node + 1].lazylazyMerge(Lazy[node]); isLazy[2 * node] = true; isLazy[2 * node + 1] = true; } Lazy[node] = segNode(); } } void build(int node, int start, int end) { if (start == end) { Seg[node] = Base[start]; return; } int mid = (start + end) / 2; build(2 * node, start, mid); build(2 * node + 1, mid + 1, end); Seg[node] = Seg[2 * node].segSegMerge(Seg[2 * node + 1]); } void build(vector<segNode> &Arr) { Base = Arr; n = Arr.size(); Seg.resize(4 * n + 10); Lazy.resize(4 * n + 10); isLazy.resize(4 * n + 10); build(1, 0, n - 1); } pair<int, int> Query(int node, int start, int end, int qstart, int qend) { propagate(node, start, end); if (qend < start || qstart > end || start > end) return pair<int, int>(MOD, MOD); if (qstart <= start && end <= qend) { if ((Seg[node].vals).empty()) return pair<int, int>(MOD, MOD); return *((Seg[node].vals).begin()); } int mid = (start + end) / 2; auto l = Query(2 * node, start, mid, qstart, qend); auto r = Query(2 * node + 1, mid + 1, end, qstart, qend); return min(l, r); } segNode qQuery(int node, int start, int end, int pos) { propagate(node, start, end); if (start == end) return Seg[node]; int mid = (start + end) / 2; if (pos <= mid) return qQuery(2 * node, start, mid, pos); return qQuery(2 * node + 1, mid + 1, end, pos); } void Update(int node, int start, int end, int qstart, int qend, segNode val) { propagate(node, start, end); if (qend < start || qstart > end || start > end) return; if (qstart <= start && end <= qend) { isLazy[node] = true; Lazy[node] = val; propagate(node, start, end); return; } int mid = (start + end) / 2; Update(2 * node, start, mid, qstart, qend, val); Update(2 * node + 1, mid + 1, end, qstart, qend, val); Seg[node] = Seg[2 * node].segSegMerge(Seg[2 * node + 1]); } void pUpdate(int node, int start, int end, int pos, pair<int, int> val) { Seg[node].vals.insert(val); if (start == end) { return; } int mid = (start + end) / 2; if (pos <= mid) pUpdate(2 * node, start, mid, pos, val); else pUpdate(2 * node + 1, mid + 1, end, pos, val); } void pdel(int node, int start, int end, int pos, pair<int, int> val) { Seg[node].vals.erase(val); if (start == end) { return; } int mid = (start + end) / 2; if (pos <= mid) pdel(2 * node, start, mid, pos, val); else pdel(2 * node + 1, mid + 1, end, pos, val); } segNode query(int pos) { return qQuery(1, 0, n - 1, pos); } pair<int, int> query(int left, int right) { return Query(1, 0, n - 1, left, right); } void update(int pos, pair<int, int> val) { pUpdate(1, 0, n - 1, pos, val); } void update(int start, int end, segNode val) { Update(1, 0, n - 1, start, end, val); } }; void solveCase() { int n; cin >> n; ; vector<pair<pair<int, int>, pair<int, pair<int, int>>>> a(n); vector<int> ranges; for (size_t i = 0; i < n; i++) { cin >> a[i].first.first >> a[i].first.second; cin >> a[i].second.first >> a[i].second.second.first; a[i].second.second.second = i; ranges.push_back(a[i].first.first); ranges.push_back(a[i].second.first); } sort(ranges.begin(), ranges.end()); ranges.erase(unique(ranges.begin(), ranges.end()), ranges.end()); for (size_t i = 0; i < n; i++) { a[i].first.first = lower_bound(ranges.begin(), ranges.end(), a[i].first.first) - ranges.begin(); a[i].second.first = lower_bound(ranges.begin(), ranges.end(), a[i].second.first) - ranges.begin(); } sort(a.begin(), a.end()); ; vector<int> prev(n, -1), dist(n, MOD); queue<int> Q; Segtree<Node> stree(n); for (size_t i = 0; i < n; i++) { if (a[i].first.first == 0 && a[i].first.second == 0) { Q.push(i); dist[i] = 0; } else stree.update(i, {a[i].first.second, i}); } while (Q.size()) { auto curr_idx = Q.front(); ; Q.pop(); int c = a[curr_idx].second.first; int d = a[curr_idx].second.second.first; int idx2 = lower_bound(a.begin(), a.end(), make_pair(make_pair(c + 1, 0), make_pair(0, make_pair(0, 0)))) - a.begin(); --idx2; ; while (true) { auto q = stree.query(0, idx2); ; if (q.first > d) break; int idx = q.second; Q.push(idx); dist[idx] = dist[curr_idx] + 1; prev[idx] = curr_idx; stree.pdel(1, 0, n - 1, idx, q); } }; for (size_t i = 0; i < n; i++) { if (a[i].second.second.second == (n - 1)) { if (dist[i] != MOD) { cout << dist[i] + 1 << n ; vector<int> path; int curr = i; while (curr >= 0) { path.push_back(curr); curr = prev[curr]; } for (int i = path.size() - 1; i >= 0; i--) { cout << a[path[i]].second.second.second + 1 << ; } cout << n ; return; } } } cout << -1 << n ; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; ; for (int i = 1; i <= t; ++i) solveCase(); return 0; } |
#include <bits/stdc++.h> using namespace std; int mn[200010 * 4], lazy_value[4 * 200010]; bool lazy[4 * 200010]; void update_node(int idx, int st, int ed, int val) { lazy[idx] = 1; lazy_value[idx] += val; mn[idx] += val; } void update_lazy(int idx, int st, int ed) { if (st == ed) return; int mid = (st + ed) / 2; update_node(2 * idx, st, mid, lazy_value[idx]); update_node(2 * idx + 1, mid + 1, ed, lazy_value[idx]); lazy[idx] = lazy_value[idx] = 0; } void insert(int idx, int st, int ed, int s, int e, int val) { if (st == s && ed == e) { update_node(idx, st, ed, val); return; } if (lazy[idx]) update_lazy(idx, st, ed); int mid = (st + ed) / 2; if (e <= mid) insert(idx * 2, st, mid, s, e, val); else if (s > mid) insert(idx * 2 + 1, mid + 1, ed, s, e, val); else { insert(idx * 2, st, mid, s, mid, val); insert(idx * 2 + 1, mid + 1, ed, mid + 1, e, val); } mn[idx] = min(mn[idx * 2], mn[idx * 2 + 1]); } int query(int idx, int st, int ed, int s, int e) { if (st == s && ed == e) return mn[idx]; if (lazy[idx]) update_lazy(idx, st, ed); int mid = (st + ed) / 2; if (mid >= e) return query(2 * idx, st, mid, s, e); else if (s > mid) return query(2 * idx + 1, mid + 1, ed, s, e); else return min(query(idx * 2, st, mid, s, mid), query(idx * 2 + 1, mid + 1, ed, mid + 1, e)); } int main() { int n, val, i, q, cnt, st, ed; string s_line; cin >> n; for (i = 0; i < n; i++) { cin >> val; insert(1, 0, n - 1, i, i, val); } cin >> q; getchar(); while (q--) { getline(cin, s_line); stringstream ss1; ss1 << s_line; ss1 >> st; ss1 >> ed; cnt = 0; while (ss1 >> val) cnt++; if (cnt) { if (st > ed) { insert(1, 0, n - 1, st, n - 1, val); insert(1, 0, n - 1, 0, ed, val); } else insert(1, 0, n - 1, st, ed, val); } else { if (st > ed) cout << min(query(1, 0, n - 1, st, n - 1), query(1, 0, n - 1, 0, ed)); else cout << query(1, 0, n - 1, st, ed); cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int mp[1010000], ans; int main() { int n, m, x; cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , &x); mp[x]++; } for (int i = 0; i <= 1e6 + 21; i++) { int num = i; int numcnt = mp[i]; if (numcnt % 2 == 1) ans++; mp[num + 1] += numcnt / 2; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long n, k; string s; int32_t main() { ios_base::sync_with_stdio(false); cin >> n >> k; long long left = 1; long long right = n; while (right - left > 1) { long long m1 = (right + left) / 2; long long m2 = m1 + 1; cout << 1 << << m1 << << m2 << endl; cout.flush(); cin >> s; if (s == TAK ) { right = m1; } else left = m2; } long long f; long long s1 = -1; long long s2 = -1; if (left == right) f = left; else { cout << 1 << << left << << right << endl; cout.flush(); cin >> s; if (s == TAK ) { f = left; } else f = right; } left = 1; right = f - 1; if (right >= left) { while (right - left > 1) { long long m1 = (right + left) / 2; long long m2 = m1 + 1; cout << 1 << << m1 << << m2 << endl; cout.flush(); cin >> s; if (s == TAK ) { right = m1; } else left = m2; } if (left == right) s1 = left; else { cout << 1 << << left << << right << endl; cout.flush(); cin >> s; if (s == TAK ) { s1 = left; } else s1 = right; } } left = f + 1; right = n; if (right >= left) { while (right - left > 1) { long long m1 = (right + left) / 2; long long m2 = m1 + 1; cout << 1 << << m1 << << m2 << endl; cout.flush(); cin >> s; if (s == TAK ) { right = m1; } else left = m2; } if (left == right) s2 = left; else { cout << 1 << << left << << right << endl; cout.flush(); cin >> s; if (s == TAK ) { s2 = left; } else s2 = right; } } if (s1 != -1) { cout << 1 << s1 << << f << endl; cout.flush(); cin >> s; if (s == TAK ) { cout << 2 << << f << << s1 << endl; cout.flush(); return 0; } } cout << 2 << << f << << s2 << endl; cout.flush(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int max(long long int a, long long int b) { if (a > b) { return a; } return b; } long long int gcd(long long int a, long long int b) { if (a == 0) { return b; } return gcd(b % a, a); } long long int min(long long int a, long long int b) { if (a < b) { return a; } return b; } long long int power(long long int x, long long int n) { long long int res = 1; while (n > 0) { if (n % 2 == 1) { res = (res * x); } x = (x * x); n = n / 2; } return res; } long long int factorialNumInverse[1000001]; long long int naturalNumInverse[1000001]; long long int fact[1000001]; void InverseofNumber(long long int n, long long int p) { naturalNumInverse[0] = naturalNumInverse[1] = 1; for (long long int i = 2; i <= n; i++) naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p; } void InverseofFactorial(long long int n, long long int p) { factorialNumInverse[0] = factorialNumInverse[1] = 1; for (long long int i = 2; i <= n; i++) factorialNumInverse[i] = (naturalNumInverse[i] * factorialNumInverse[i - 1]) % p; } void factorial(long long int n, long long int p) { fact[0] = 1; for (long long int i = 1; i <= n; i++) { fact[i] = (fact[i - 1] * i) % p; } } long long int nCrModp(long long int n, long long int r, long long int p) { long long int ans = ((fact[n] * factorialNumInverse[r]) % p * factorialNumInverse[n - r]) % p; return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int tc; cin >> tc; factorial(200005, 1000000007); InverseofNumber(200005, 1000000007); InverseofFactorial(200005, 1000000007); while (tc--) { long long int n; cin >> n; string s; cin >> s; long long int ans = 0; long long int i = 1; long long int len = 1; while (i < n) { if (s[i] == s[0]) { len++; } i++; } if (len == n) { cout << ceil((long double)n / (long double)3) << n ; continue; } len = 0; i = 0; int j = s.length() - 1; while (j >= 0 && s[j] == s[0]) { len++; j--; } while (i <= j && s[i] == s[0]) { len++; i++; } ans += (len) / 3; len = 1; i++; while (i <= j) { if (s[i] == s[i - 1]) { len++; } else { ans += (len) / 3; len = 1; } i++; } ans += (len) / 3; cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q, si = 1, leaf; long long ans[500010]; struct Q { int s, e, ind; }; vector<Q> query[500010]; vector<pair<int, int>> tree[500010]; int rs[500010]; struct seg { long long seg[2000010], lazy[2000010]; void prop(int x) { seg[x] += lazy[x]; if (x < si) { lazy[x * 2] += lazy[x]; lazy[x * 2 + 1] += lazy[x]; } lazy[x] = 0; return; } void add(int s, int e, long long v) { if (s > e) return; add(1, 1, si, s, e, v); } void add(int x, int l, int r, int s, int e, long long v) { prop(x); if (r < s || e < l) return; if (s <= l && r <= e) { lazy[x] += v; prop(x); return; } add(x * 2, l, (l + r) / 2, s, e, v); add(x * 2 + 1, (l + r) / 2 + 1, r, s, e, v); seg[x] = min(seg[x * 2], seg[x * 2 + 1]); } long long get(int s, int e) { return get(1, 1, si, s, e); } long long get(int x, int l, int r, int s, int e) { prop(x); if (r < s || e < l) return 1000000000000000LL; if (s <= l && r <= e) return seg[x]; return min(get(x * 2, l, (l + r) / 2, s, e), get(x * 2 + 1, (l + r) / 2 + 1, r, s, e)); } } S; void makeup(int x, long long dis) { rs[x] = x; if (tree[x].size() == 0) { S.add(x, x, dis); return; } else S.add(x, x, 1000000000000000LL); for (auto i : tree[x]) { makeup(i.first, dis + i.second); rs[x] = max(rs[x], rs[i.first]); } } void dfs(int x) { for (auto i : query[x]) ans[i.ind] = S.get(i.s, i.e); for (auto i : tree[x]) { S.add(i.first, rs[i.first], -i.second); S.add(1, i.first - 1, i.second); S.add(rs[i.first] + 1, n, i.second); dfs(i.first); S.add(i.first, rs[i.first], i.second); S.add(1, i.first - 1, -i.second); S.add(rs[i.first] + 1, n, -i.second); } } int main() { int i, a, b, c; scanf( %d %d , &n, &q); while (si < n) si <<= 1; for (i = 2; i <= n; i++) { scanf( %d %d , &a, &b); tree[a].push_back({i, b}); } for (i = 1; i <= q; i++) { scanf( %d %d %d , &a, &b, &c); query[a].push_back({b, c, i}); } makeup(1, 0); dfs(1); for (i = 1; i <= q; i++) printf( %lld n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; typedef vector <int> vi; typedef pair <int, int> pii; const int MAXN = 2e5 + 5; int N; int perm[MAXN]; bool bio[MAXN]; deque <pii> ans; void load() { scanf( %d , &N); for (int i = 1; i <= N; i++) { int coin; scanf( %d , &coin); perm[coin] = i; } } void add_front(int x, int y) { ans.push_front({x, y}); } void add_back(int x, int y) { ans.push_back({x, y}); } void one_cycle(const vi &cyc) { int len = cyc.size(); auto add_local = [&](int x, int y) { add_front(cyc[x % len], cyc[y % len]); }; add_local(1, 2); add_local(1, 3); for (int i = 3; i < len; i++) add_local(i, i + 1); add_local(1, 2); add_local(0, 1); } void two_cycles(vi cyc1, vi cyc2) { cyc2.insert(cyc2.begin(), cyc1.back()); cyc1.pop_back(); cyc1.insert(cyc1.begin(), cyc2.back()); cyc2.pop_back(); int len1 = cyc1.size(); for (int i = 0; i < len1 - 1; i++) add_front(cyc1[i], cyc1[i + 1]); int len2 = cyc2.size(); for (int i = 0; i < len2 - 1; i++) add_front(cyc2[i], cyc2[i + 1]); add_front(cyc1[0], cyc2[0]); add_front(cyc1.back(), cyc2.back()); } void fixed_and_transposition(int x, const vi &tau) { add_back(x, tau[0]); add_back(tau[0], tau[1]); add_back(x, tau[1]); } void solve() { int fixed = 0; vector <vi> other; for (int i = 1; i <= N; i++) if (!bio[i]) { vi tmp; for (int x = i; !bio[x]; x = perm[x]) { tmp.push_back(x); bio[x] = true; } if (tmp.size() > 1) other.push_back(tmp); else fixed = tmp[0]; } if (!other.empty()) { int largest = max_element(other.begin(), other.end(), [&](const vi &u, const vi &v) { return u.size() < v.size(); }) - other.begin(); swap(other[0], other[largest]); int parity = other.size() % 2; for (int i = parity; i < other.size(); i += 2) two_cycles(other[i], other[i + 1]); if (parity) { if (other[0].size() >= 3) one_cycle(other[0]); else fixed_and_transposition(fixed ? fixed : other[1][0], other[0]); } } printf( %d n , ans.size()); for (auto it : ans) { printf( %d %d n , perm[it.first], perm[it.second]); swap(perm[it.first], perm[it.second]); } } int main() { load(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int u, v, w; } arr[300010]; bool cmp(node a, node b) { return (a.w < b.w); } int n, m; int f[300010], f2[300010]; int main() { scanf( %d , &n); ; scanf( %d , &m); ; for (int i = 0; i < m; i++) { scanf( %d , &arr[i].u); ; scanf( %d , &arr[i].v); ; scanf( %d , &arr[i].w); ; } sort(arr, arr + m, cmp); int ans = 0; for (int i = 0, j = 0; i < m; i = j) { while (j < m && arr[i].w == arr[j].w) j++; for (int k = i; k < j; k++) f2[arr[k].v] = f[arr[k].v]; for (int k = i; k < j; k++) f2[arr[k].v] = max(f2[arr[k].v], 1 + f[arr[k].u]); for (int k = i; k < j; k++) f[arr[k].v] = f2[arr[k].v]; for (int k = i; k < j; k++) ans = max(ans, f[arr[k].v]); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void chkmin(T &x, T y) { x = x < y ? x : y; } template <typename T> void chkmax(T &x, T y) { x = x > y ? x : y; } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); x *= f; } int a[100010], s[100010], f[100010][105], b[100010][105]; void add(int &x, int y) { x += y; if (x >= 998244353) x -= 998244353; } int main() { int n, k, len; read(n), read(k), read(len); if (len == 1) return cout << 0 n , 0; s[0] = 1; for (int i = 1; i <= n; i++) read(a[i]); for (int i = 1; i <= n; i++) for (int j = 1; j <= k; j++) if (a[i] == j || a[i] == -1) b[i][j] = 1; for (int j = 1; j <= k; j++) for (int i = 1; i <= n; i++) b[i][j] += b[i - 1][j]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= k; j++) { if (~a[i] && a[i] != j) continue; f[i][j] = s[i - 1]; if (i >= len && b[i][j] - b[i - len][j] == len) add(f[i][j], (f[i - len][j] - s[i - len] + 998244353) % 998244353); add(s[i], f[i][j]); } } cout << s[n] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double x, y; while (cin >> x >> y) { double l; l = sqrt(x * x + y * y); if (l == (int)l) { cout << black << endl; continue; } int z = (int)l; if (z != l) z++; if (x * y >= 0) { if (z % 2) cout << black << endl; else cout << white << endl; } else { if (z % 2 == 0) cout << black << endl; else cout << white << endl; } } } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a == 0) { return b; } if (b == 0) { return a; } return gcd(b % a, a); } int main() { long long ra, la, ta, rb, lb, tb; cin >> la >> ra >> ta; cin >> lb >> rb >> tb; long long g = gcd(ta, tb); if (ta > tb) { long long j = la, k = ra, l = ta; la = lb; ra = rb; ta = tb; lb = j; rb = k; tb = l; } lb -= la; rb -= la; long long buff = ((lb + tb) % tb) - lb; lb += buff; rb += buff; ra -= la; la -= la; long long bdif = 0; long long nf = (lb % g) - lb; lb += nf; rb += nf; bdif = max(bdif, 1 + min(rb, ra) - max(lb, la)); long long nl = ((lb + g - 1) % g) - g + 1; long long df = nl - lb; lb += df; rb += df; bdif = max(bdif, 1 + min(rb, ra) - max(lb, la)); cout << bdif << endl; } |
#include <bits/stdc++.h> using namespace std; auto start = std::chrono::high_resolution_clock::now(); long double crrtime() { auto stop = std::chrono::high_resolution_clock::now(); auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(stop - start); return ((long double)duration.count()) / ((long double)1e9); } mt19937 rng(2); int inline randn(int L, int R) { uniform_int_distribution<int> uid(L, R); return uid(rng); } int inline randn(int N) { uniform_int_distribution<int> uid(0, N - 1); return uid(rng); } const long long mod = 998244353; long long n; long long p[30]; long long a[30][26]; long long g[10000001]; long long h[10000001]; long long F[10000001]; void solve() { cin >> n; p[0] = 1; for (long long i = 1; i < 30; i++) p[i] = 2 * p[i - 1]; for (long long i = 0; i < n; i++) { string s; cin >> s; for (long long j = 0; j < 26; j++) a[i][j] = 0; for (char c : s) a[i][c - a ]++; } g[0] = 0; for (long long x = 1; x < p[n]; x++) { vector<long long> tmp(26, 100000); long long k = 0; h[x] = 0; for (long long i = 0; i < n; i++) { if (p[i] & x) { for (long long j = 0; j < 26; j++) tmp[j] = min(tmp[j], a[i][j]); k++; h[x]++; h[x] += i; } } long long cnt = 1; for (long long i = 0; i < 26; i++) cnt = (cnt * (tmp[i] + 1)) % mod; h[x] *= k; g[x] = cnt; if ((k & 1) == 0) g[x] = -cnt; } for (long long i = 0; i < (1 << n); ++i) F[i] = g[i]; for (long long i = 0; i < n; ++i) for (long long mask = 0; mask < (1 << n); ++mask) { if (mask & (1 << i)) F[mask] += F[mask ^ (1 << i)]; } long long ans = 0; for (long long i = 0; i < p[n]; i++) { F[i] %= mod; if (F[i] < 0) F[i] += mod; ans ^= (F[i] * h[i]); } cout << (ans) << n ; } signed main() { start = std::chrono::high_resolution_clock::now(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long tt = 1; for (long long tc = 1; tc <= tt; ++tc) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int long long freq[100005], a[100005], final[100005]; int long long pow1(int long long a, int long long b) { if (a == 0) return 0; int long long x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y); if (x > 1000000007) x %= 1000000007; } y = (y * y); if (y > 1000000007) y %= 1000000007; b /= 2; } return x % 1000000007; } int main() { ios::sync_with_stdio(0), cin.tie(0); int long long n; cin >> n; for (int long long i = 0; i < n; i++) { cin >> a[i]; freq[a[i]]++; } for (int long long i = 100000; i >= 1; i--) { int long long c1 = 0; for (int long long j = i; j <= 100000; j = j + i) { c1 = (c1 + freq[j]) % 1000000007; } final[i] = (final[i] + pow1(2, c1) - 1) % 1000000007; for (int long long j = 2 * i; j <= 100000; j = j + i) { final[i] = (final[i] + 1000000007 - final[j]) % 1000000007; } } cout << final[1] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int xa, ya, xb, yb, n; cin >> xa >> ya >> xb >> yb >> n; vector<int> X(n), Y(n), R(n); for (int i = 0; i < n; ++i) cin >> X[i] >> Y[i] >> R[i]; if (xa > xb) swap(xa, xb); if (ya > yb) swap(ya, yb); int ans = 0; for (int i = xa; i <= xb; i++) { bool flag = false; for (int j = 0; j < n; ++j) { int d = (X[j] - i) * (X[j] - i) + (Y[j] - ya) * (Y[j] - ya); if (d <= R[j] * R[j]) flag = true; } ans += !flag; flag = false; for (int j = 0; j < n; ++j) { int d = (X[j] - i) * (X[j] - i) + (Y[j] - yb) * (Y[j] - yb); if (d <= R[j] * R[j]) flag = true; } ans += !flag; } for (int i = ya + 1; i < yb; ++i) { bool flag = false; for (int j = 0; j < n; ++j) { int d = (X[j] - xa) * (X[j] - xa) + (Y[j] - i) * (Y[j] - i); if (d <= R[j] * R[j]) flag = true; } ans += !flag; flag = false; for (int j = 0; j < n; ++j) { int d = (X[j] - xb) * (X[j] - xb) + (Y[j] - i) * (Y[j] - i); if (d <= R[j] * R[j]) flag = true; } ans += !flag; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; struct edge { int from; int to; int w; }; int comp(const edge& f, const edge& l) { if (f.from < l.from) return 1; else if (f.from > l.from) return 0; else { if (f.w > l.w) return 1; } return 0; } map<int, vector<edge> > d; int check_cnt(int sum) { sort(d[sum].begin(), d[sum].end(), comp); set<pair<int, int> > wait; int cnt = 0; for (edge it : d[sum]) { if (it.w == 1) wait.insert({it.from, it.to}); else { if (wait.count({it.to, it.from})) { cnt++; wait.clear(); } } } return cnt; } void make(int sum) { sort(d[sum].begin(), d[sum].end(), comp); set<pair<int, int> > wait; for (edge& it : d[sum]) { if (it.w == 1) wait.insert({it.from, it.to}); else { if (wait.count({it.to, it.from})) { cout << it.to + 1 << << it.from + 1 << n ; wait.clear(); } } } } int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int n; cin >> n; vector<int> a(n); vector<int> p(n + 1, 0); for (int i = 0; i < n; i++) { cin >> a[i]; p[i + 1] = p[i] + a[i]; } int sum = 0; for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { sum = p[j + 1] - p[i]; d[sum].push_back((edge){i, j, 1}); d[sum].push_back((edge){j, i, -1}); } } int max_val = 0, max_cnt = 0, cnt = 0; for (auto& it : d) { cnt = check_cnt(it.first); if (max_cnt < cnt) { max_cnt = cnt; max_val = it.first; } } cout << max_cnt << n ; make(max_val); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long fastexp(long long b, long long exp) { if (exp == 0) return 1; long long temp = fastexp(b, exp / 2); temp = (temp * temp) % 998244353; if (exp % 2 == 1) temp *= b; return temp % 998244353; } long long fact[100001], inv[100001]; void precompute() { fact[0] = 1; inv[0] = 1; for (int i = 1; i <= 100000; i++) { fact[i] = (fact[i - 1] * i) % 998244353; inv[i] = fastexp(fact[i], 998244353 - 2); } } long long choose(int n, int k) { if (n < 0 || k < 0 || k > n) return 0; long long ans = (fact[n] * inv[k]) % 998244353; ans = (ans * inv[n - k]) % 998244353; return ans; } bool row[3605], col[3605]; int H, W, N; long long dp1[3605][3605], dp2[3605][3605]; int emptyH, emptyW; int main() { ios_base::sync_with_stdio(0); cin.tie(0); precompute(); cin >> H >> W >> N; for (int i = 0; i < N; i++) { int r1, c1, r2, c2; cin >> r1 >> c1 >> r2 >> c2; row[r1] = true; row[r2] = true; col[c1] = true; col[c2] = true; } for (int i = 1; i <= H; i++) if (!row[i]) emptyH++; for (int i = 1; i <= W; i++) if (!col[i]) emptyW++; dp1[0][0] = true; for (int i = 1; i <= H; i++) { for (int j = 0; j <= i; j++) { if (row[i] || row[i - 1]) dp1[i][j] = dp1[i - 1][j]; else { dp1[i][j] = dp1[i - 1][j]; if (i - 2 >= 0 && j - 1 >= 0) dp1[i][j] += dp1[i - 2][j - 1]; dp1[i][j] %= 998244353; } } } dp2[0][0] = true; for (int i = 1; i <= W; i++) { for (int j = 0; j <= i; j++) { if (col[i] || col[i - 1]) dp2[i][j] = dp2[i - 1][j]; else { dp2[i][j] = dp2[i - 1][j]; if (i - 2 >= 0 && j - 1 >= 0) dp2[i][j] += dp2[i - 2][j - 1]; dp2[i][j] %= 998244353; } } } long long ans = 0; for (int i = 0; i <= H; i++) { for (int j = 0; j <= W; j++) { long long R = dp1[H][j] * choose(emptyH - 2 * j, i); R %= 998244353; long long C = dp2[W][i] * choose(emptyW - 2 * i, j); C %= 998244353; long long F = (fact[i] * fact[j]) % 998244353; ans += ((R * C) % 998244353 * F) % 998244353; ans %= 998244353; } } cout << ans << endl; return 0; } |
#include<bits/stdc++.h> /* #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/tree_policy.hpp> // Including */ using namespace std; //using namespace __gnu_pbds; //typedefs typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vi> vvi; typedef vector<vl> vvl; typedef pair<int,int> pii; typedef pair<double, double> pdd; typedef pair<ll, ll> pll; typedef vector<pii> vii; typedef vector<pll> vll; typedef vector<int>::iterator vit; typedef set<int>::iterator sit; /* template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename F, typename S> using ordered_map = tree<F, S, less<F>, rb_tree_tag, tree_order_statistics_node_update>; */ //#Defines #define rep(i,a,b) for(i=a;i<=b;i++) #define repR(i,a,b) for(i=a;i>=b;i--) //#define pb push_back #define pb emplace_back #define F first #define S second #define mp make_pair #define all(c) c.begin(),c.end() #define endl n #define pf printf #define sf scanf //#define left __left //#define right __right //#define tree __tree #define MOD 1000000007 //#define harmonic(n) 0.57721566490153286l+log(n) #define RESET(a,b) memset(a,b,sizeof(a)) #define gcd(a,b) __gcd(a,b) #define lcm(a,b) (a*(b/gcd(a,b))) #define sqr(a) ((a) * (a)) #define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield); const double PI = acos(-1); const double eps = 1e-9; const int inf = 2000000000; const ll infLL = 9000000000000000000; //Bit Operations inline bool checkBit(ll n, int i) { return n&(1LL<<i); } inline ll setBit(ll n, int i) { return n|(1LL<<i);; } inline ll resetBit(ll n, int i) { return n&(~(1LL<<i)); } int fx[] = {0, 0, +1, -1}; int fy[] = {+1, -1, 0, 0}; //int dx[] = {+1, 0, -1, 0, +1, +1, -1, -1}; //int dy[] = {0, +1, 0, -1, +1, -1, +1, -1}; //Inline functions inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; } inline bool isLeapYear(ll year) { return (year%400==0) || (year%4==0 && year%100!=0); } inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); } inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; } inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; } inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; } inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; } inline ll modInverse(ll a) { return modPow(a, MOD-2); } inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); } inline bool isInside(pii p,ll n,ll m) { return (p.first>=0&&p.first<n&&p.second>=0&&p.second<m); } inline bool isInside(pii p,ll n) { return (p.first>=0&&p.first<n&&p.second>=0&&p.second<n); } inline bool isSquare(ll x) { ll s = sqrt(x); return (s*s==x); } inline bool isFib(ll x) { return isSquare(5*x*x+4)|| isSquare(5*x*x-4); } inline bool isPowerOfTwo(ll x) { return ((1LL<<(ll)log2(x))==x); } struct func { //this is a sample overloading function for sorting stl bool operator()(pii const &a, pii const &b) { if(a.F==b.F) return (a.S<b.S); return (a.F<b.F); } }; //Prime Number Generator /* #define M 100000000 int marked[M/64 + 2]; #define on(x) (marked[x/64] & (1<<((x%64)/2))) #define mark(x) marked[x/64] |= (1<<((x%64)/2)) vl prime; bool isPrime(int num) { return num > 1 && (num == 2 || ((num & 1) && !on(num))); } void sieve(ll n) { for (ll i = 3; i * i < n; i += 2) { if (!on(i)) { for (ll j = i * i; j <= n; j += i + i) { mark(j); } } } prime.pb(2); for(ll i = 3; i <= n; i += 2) { if(!on(i)) prime.pb(i); } } */ // //debug #ifdef tajir template < typename F, typename S > ostream& operator << ( ostream& os, const pair< F, S > & p ) { return os << ( << p.first << , << p.second << ) ; } template < typename T > ostream &operator << ( ostream & os, const vector< T > &v ) { os << { ; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << , ; os << *it; } return os << } ; } template < typename T > ostream &operator << ( ostream & os, const set< T > &v ) { os << [ ; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << , ; os << *it; } return os << ] ; } template < typename T > ostream &operator << ( ostream & os, const multiset< T > &v ) { os << [ ; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << , ; os << *it; } return os << ] ; } template < typename F, typename S > ostream &operator << ( ostream & os, const map< F, S > &v ) { os << [ ; for(auto it = v.begin(); it != v.end(); ++it) { if( it != v.begin() ) os << , ; os << it -> first << = << it -> second ; } return os << ] ; } #define dbg(args...) do {cerr << #args << : ; faltu(args); } while(0) clock_t tStart = clock(); #define timeStamp dbg( Execution Time: , (double)(clock() - tStart)/CLOCKS_PER_SEC) void faltu () { cerr << endl; } template <typename T> void faltu( T a[], int n ) { for(int i = 0; i < n; ++i) cerr << a[i] << ; cerr << endl; } template <typename T, typename ... hello> void faltu( T arg, const hello &... rest) { cerr << arg << ; faltu(rest...); } #else #define dbg(args...) #endif // tajir int main() { #ifdef tajir freopen( input.txt , r , stdin); #else // online submission #endif optimize(); int n; int a[10001]; int x[10001]; cin >> n; a[0] = 0; for(int i = 1; i <= n; ++i) cin >> a[i]; for(int i = n; i > 0; --i) { x[i-1] = a[i] - a[i-1]; } dbg(x,n); vi res; for(int i = 1; i <= n; ++i) { vi v(i,-inf); dbg(i); bool flag = true; for(int j = 0; j < n; ++j) { if(v[j%i] == -inf) v[j%i] = x[j]; else { if(v[j%i] == x[j]) continue; else { dbg(j%i,v[j%i],x[j]); flag = false; break; } } dbg(v); } dbg(flag); if(flag) res.pb(i); } cout << res.size() << endl; for(auto x : res) cout << x << ; cout << endl; return 0; } //? |
#include <bits/stdc++.h> using namespace std; int a[100000], b[100000], c[100000][2]; int n, m; long long k, sum; int main() { cin >> n >> k; sum = 0; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); b[i] = a[i]; long long aa = a[i]; sum += aa; } if (sum <= k) { if (sum < k) { printf( -1 n ); } return 0; } sort(b, b + n); m = 0; c[0][0] = b[0]; c[0][1] = 0; for (int i = 1; i < n; i++) if (b[i] != b[i - 1]) { m++; c[m][0] = b[i]; c[m][1] = i; } int pre = 0; for (int i = 0; i <= m; i++) { long long u, v, duc; v = c[i][0] - pre; u = n - c[i][1]; duc = u * v; if (duc <= k) { k -= duc; } else { int h = -1; for (int j = 0; j < n; j++) if (a[j] >= c[i][0]) { h++; a[h] = a[j]; b[h] = j; } long long s, t; s = k / u; t = k % u; int tt, ss; tt = t; ss = s; for (int j = tt; j <= h; j++) { if (j != tt) { printf( ); } printf( %d , b[j] + 1); } for (int j = 0; j < tt; j++) if ((ss + 1 != v) || (a[j] != c[i][0])) { printf( %d , b[j] + 1); } printf( n ); break; } pre = c[i][0]; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, turn; cin >> n >> k; turn = n / k; if (turn % 2) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, b; int n; cin >> n >> a >> b; int ans = 0; for (int i = 0; i < n - 1; i++) { if (a[i] != b[i]) { if (a[i] == 1 ) { if (a[i + 1] == 0 && a[i + 1] != b[i + 1]) { a[i] = 0 ; a[i + 1] = 1 ; ans++; } else { a[i] = 0 ; ans++; } } else { if (a[i + 1] == 1 && a[i + 1] != b[i + 1]) { a[i] = 1 ; a[i + 1] = 0 ; ans++; } else { a[i] = 1 ; ans++; } } } } if (a[n - 1] != b[n - 1]) ans++; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> t, a, b; vector<pair<int, int>> p; void push(int v) { if (t[v] != -1) { t[v * 2] = t[v * 2 + 1] = t[v]; t[v] = -1; } } void update(int v, int l, int r, int vl, int vr, int color) { if (vl > vr) return; if (l == vl && r == vr) t[v] = color; else { push(v); int m = (l + r) / 2; update(v * 2, l, m, vl, min(vr, m), color); update(v * 2 + 1, m + 1, r, max(vl, m + 1), vr, color); } } int get(int v, int l, int r, int pos) { if (l == r) return t[v]; push(v); int m = (l + r) / 2; if (m >= pos) return get(v * 2, l, m, pos); else return get(v * 2 + 1, m + 1, r, pos); } int main() { cin >> n >> m; a.resize(n); b.resize(n); for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) cin >> b[i]; int bin = 1; while (bin < n) bin *= 2; n = bin; t.assign(n * 2, -1); for (int i = 0; i < m; ++i) { int type; cin >> type; if (type == 1) { int l, q, k; cin >> l >> q >> k; update(1, 0, n - 1, q - 1, q + k - 2, p.size()); p.push_back({l, q}); } else { int x, y = -1; cin >> x; y = get(1, 0, n - 1, x - 1); if (y == -1) cout << b[x - 1] << n ; else cout << a[p[y].first + x - p[y].second - 1] << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int f[11][11][4][100010]; int n; char s[100010]; char c[100010]; int ch(char s) { if (s == A ) return 0; else if (s == C ) return 1; else if (s == T ) return 2; else if (s == G ) return 3; return -1; } void Add(int *tr, int x, int d) { for (; x <= n; x += x & (-x)) { tr[x] += d; } } int Sum(int *tr, int x) { if (x == 0) return 0; int s = 0; while (x) { s += tr[x]; x -= x & (-x); } return s; } int main() { scanf( %s , s); n = strlen(s); for (int i = n - 1; i >= 0; i--) s[i + 1] = s[i]; s[0] = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= 10; j++) Add(f[j][i % j][ch(s[i])], i, 1); int q, x, d, l, r; scanf( %d , &q); while (q--) { scanf( %d , &x); if (x == 1) { scanf( %d%s , &d, c); for (int i = 1; i <= 10; i++) Add(f[i][d % i][ch(s[d])], d, -1); s[d] = c[0]; for (int i = 1; i <= 10; i++) Add(f[i][d % i][ch(s[d])], d, 1); } else { scanf( %d%d%s , &l, &r, c); int len = strlen(c); int ans = 0; for (int i = 0; i < len; i++) ans += Sum(f[len][(l + i) % len][ch(c[i])], r) - Sum(f[len][(l + i) % len][ch(c[i])], l - 1); printf( %d n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline void EnableFileIO(const string& fileName, bool local = 0) { if (fileName.empty()) return; if (local) { freopen((fileName + .in ).c_str(), r , stdin); freopen((fileName + .out ).c_str(), w , stdout); return; } freopen((fileName + .in ).c_str(), r , stdin); freopen((fileName + .out ).c_str(), w , stdout); } const int INF = (1 << 30) - 1; const long long LINF = (1LL << 61) - 1; const double EPS = 1e-10, PI = acos(-1); const int N = 5e4 + 100, L = 31, P = 1e9 + 7; int tot = 1; int trans[N * L][2]; short cnt[N * 30]; short sum[N * 30][L][2]; __attribute__((__optimize__( -O3 ))) void ins(int k) { int u = 1; for (int i = L - 1; i >= 0; i--) { int c = k >> i & 1; if (!trans[u][c]) trans[u][c] = ++tot; ++sum[u][i][c]; u = trans[u][c]; } ++cnt[u]; } __attribute__((__optimize__( -O3 ))) void dfs(int u, int d) { if (!u) return; dfs(trans[u][0], d - 1); dfs(trans[u][1], d - 1); cnt[u] = cnt[u] + cnt[trans[u][0]] + cnt[trans[u][1]]; for (int i = 0; i <= d; i++) { sum[u][i][0] += sum[trans[u][0]][i][0] + sum[trans[u][1]][i][0]; sum[u][i][1] += sum[trans[u][0]][i][1] + sum[trans[u][1]][i][1]; } } int n, m, a[N]; long long mid, num; __attribute__((__optimize__( -O3 ))) int dfs(int u, int d, int eq) { if (!u) return 0; if (d < 0 || !eq) return cnt[u]; int cb = mid >> d & 1, cn = num >> d & 1, res = 0; if (cb) { if (cn) { res += dfs(trans[u][0], d - 1, 1); } else { res += dfs(trans[u][1], d - 1, 1); } } else { if (cn) { res += dfs(trans[u][1], d - 1, 1); res += dfs(trans[u][0], d - 1, 0); } else { res += dfs(trans[u][0], d - 1, 1); res += dfs(trans[u][1], d - 1, 0); } } return res; } __attribute__((__optimize__( -O3 ))) inline int check() { long long res = 0; for (int i = 0; i < n; i++) { num = a[i]; res += dfs(1, L - 1, 1); } return int(res / 2); } __attribute__((__optimize__( -O3 ))) pair<long long, long long> dfsans(int u, int d, int eq) { if (!u) return make_pair(0, 0); long long res = 0, nodes = 0; if (d < 0 || !eq) { for (int i = 0; i <= d; ++i) { int c = num >> i & 1; if (c) { res += sum[u][i][0] * (1LL << i); } else { res += sum[u][i][1] * (1LL << i); } } return make_pair(cnt[u], res); } int cb = mid >> d & 1, cn = num >> d & 1; pair<long long, long long> p; if (cb) { if (cn) { p = dfsans(trans[u][0], d - 1, 1); res += p.first * (1LL << d) + p.second; nodes += p.first; } else { p = dfsans(trans[u][1], d - 1, 1); res += p.first * (1LL << d) + p.second; nodes += p.first; } } else { if (cn) { p = dfsans(trans[u][1], d - 1, 1); res += p.second; nodes += p.first; p = dfsans(trans[u][0], d - 1, 0); res += p.first * (1LL << d) + p.second; nodes += p.first; } else { p = dfsans(trans[u][0], d - 1, 1); res += p.second; nodes += p.first; p = dfsans(trans[u][1], d - 1, 0); res += p.first * (1LL << d) + p.second; nodes += p.first; } } return make_pair(nodes, res); } __attribute__((__optimize__( -O3 ))) long long calcans() { long long res = 0; for (int i = 0; i < n; i++) { num = a[i]; res += dfsans(1, L - 1, 1).second; } return res / 2; } __attribute__((__optimize__( -O3 ))) int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , a + i); } for (int i = 0; i < n; i++) { ins(a[i]); } dfs(1, L - 1); long long lb = 0, rb = 2147483647LL; while (rb - lb > 1) { mid = (lb + rb) >> 1; if (check() >= m) { lb = mid; } else { rb = mid; } } mid = lb + 1; long long ans = (m - check()) * 1LL * lb; mid = lb + 1; ans += calcans(); printf( %lld n , ans % P); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, ds[3001], sz[3001], ot[3001], a, b, c, no, ans, sum; vector<pair<int, pair<int, int> > > v; int get(int x) { if (ds[x] == x) return x; else return ds[x] = get(ds[x]); } void merge(int x, int y) { sz[x] += sz[y]; ds[y] = x; ot[x] += ot[y]; if (sz[x] > sum - ot[x]) no = 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n - 1; ++i) { cin >> a >> b >> c; v.push_back(make_pair(c, make_pair(a, b))); } sort(v.begin(), v.end()); for (int i = 1; i <= n; ++i) { cin >> ot[i]; sz[i] = 1; ds[i] = i; sum += ot[i]; } for (int i = 1; i <= n; ++i) if (sz[i] > sum - ot[i]) no = 1; if (!no && n > 1) ans = v[0].first; for (int i = 0; i < v.size();) { int j = i; while (j < v.size() && v[i].first == v[j].first) { merge(get(v[j].second.first), get(v[j].second.second)); ++j; } i = j; if (!no && i < v.size()) ans = v[i].first; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1}, n, m; const int N = 1505; char c[N][N]; pair<int, int> seen[N][N]; int mod(int a, int m) { while (a < 0) a += m; return a % m; } bool dfs2(int x, int y) { if (c[mod(x, n)][mod(y, m)] == # ) return false; if (seen[mod(x, n)][mod(y, m)] != make_pair(1 << 27, 1 << 27)) { if (seen[mod(x, n)][mod(y, m)] != make_pair(x, y)) return true; else return false; } seen[mod(x, n)][mod(y, m)] = make_pair(x, y); for (int k = 0; k < 4; k++) if (dfs2(x + dx[k], y + dy[k])) return true; return false; } int k, comp[N][N], start_comp, start_x, start_y; bool seen_edge; vector<pair<int, int> > edges; vector<int> edge_style; void dfs(int x, int y) { if (x < 0 || x >= n || y < 0 || y >= m) { seen_edge = true; return; } if (comp[x][y] || c[x][y] == # ) return; if (c[x][y] == S ) { start_x = x; start_y = y; start_comp = k; } comp[x][y] = k; for (int k = 0; k < 4; k++) dfs(x + dx[k], y + dy[k]); } int dist[10000]; const int inf = 1 << 27; bool relax(int a, int b, int w) { if (dist[b] < inf && dist[a] > dist[b] + w) { dist[a] = dist[b] + w; return true; } return false; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> c[i]; k = 1; start_comp = -1; memset(comp, 0, sizeof(comp)); start_x = -1; start_y = -1; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (!comp[i][j] && c[i][j] != # ) { seen_edge = false; dfs(i, j); if (seen_edge) k++; else if (start_x >= 0 && start_y >= 0 && comp[start_x][start_y] == k) { cout << No << endl; return 0; } } edges.clear(); edge_style.clear(); for (int i = 0; i < n; i++) { if (c[i][0] != # && c[i][m - 1] != # ) { edge_style.push_back(1); edges.push_back(make_pair(comp[i][m - 1], comp[i][0])); } } for (int j = 0; j < m; j++) { if (c[0][j] != # && c[n - 1][j] != # ) { edge_style.push_back(2); edges.push_back(make_pair(comp[n - 1][j], comp[0][j])); } } bool flag = false; for (int z = 0; z < 4; z++) { for (int i = 1; i < k; i++) dist[i] = inf; dist[start_comp] = 0; for (int i = 0; i < k; i++) for (int j = 0; j < edges.size(); j++) { int a = edges[j].first, b = edges[j].second; int dw = (edge_style[j] == 1) ? (z % 2 ? 1 : -1) : (z / 2 ? 1 : -1); bool u = relax(a, b, dw), v = relax(b, a, -dw); if (i == k - 1 && (u || v)) flag = true; } } cout << (flag ? Yes : No ) << endl; } |
#include <bits/stdc++.h> using namespace std; int vis[200010]; int addnum, vel[400010], head[400010], ne[400010]; int fath[200010][21]; int fa[200010], dep[200010]; pair<int, int> s[200010]; int tot, n, m; vector<int> o, o1, o2; int id[11]; int d[200010], f[200010][2]; int num; int p[200010]; inline int read() { int ans = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) ans = (ans << 1) + (ans << 3) + ch - 0 , ch = getchar(); return ans; } inline int find(int x) { if (fa[x] == x) return x; return fa[x] = find(fa[x]); } void dfs(int u, int fa) { vis[u] = 1; for (int e = head[u]; e; e = ne[e]) { int v = vel[e]; if (v == fa) continue; fath[v][0] = u; dep[v] = dep[u] + 1; dfs(v, u); } } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); int dt = dep[x] - dep[y]; for (int i = 19; i >= 0; i--) if (dt >> i & 1) x = fath[x][i]; for (int i = 19; i >= 0; i--) if (fath[x][i] != fath[y][i]) x = fath[x][i], y = fath[y][i]; if (x == y) return x; return fath[x][0]; } void calc(int num) { int x = s[num].first, y = s[num].second; int dt = lca(x, y); o1.clear(), o2.clear(); while (x != dt) o1.push_back(x), x = fath[x][0]; o1.push_back(dt); while (y != dt) o2.push_back(y), y = fath[y][0]; while (o1.size()) o2.push_back(o1.back()), o1.pop_back(); o.clear(); int pos = 0, cnt = o2.size(); for (int i = 0; i < cnt; i++) if (p[o2[i]] == 1 && !p[o2[(i + 1) % cnt]]) { pos = i; break; } o.push_back(id[0] == o2[pos] ? id[0] : id[1]); for (int i = pos + 1; i < cnt + pos; i++) if (p[o2[i % cnt]]) break; else o.push_back(o2[i % cnt]); o.push_back(id[0] == o2[pos] ? id[1] : id[0]); printf( %d , (int)o.size()); if (o.back() != id[0]) reverse(o.begin(), o.end()); while (o.size()) { int u = o.back(); o.pop_back(); printf( %d%c , u, !o.size() ? n : ); } } void add(int u, int v) { addnum++, vel[addnum] = v, ne[addnum] = head[u], head[u] = addnum; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= m; i++) { int x = read(), y = read(); if (find(x) != find(y)) fa[find(x)] = find(y), add(x, y), add(y, x); else s[++tot] = make_pair(x, y); } for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i, -1); for (int i = 1; i < 20; i++) for (int j = 1; j <= n; j++) fath[j][i] = fath[fath[j][i - 1]][i - 1]; for (int i = 1; i <= tot; i++) { int x = s[i].first, y = s[i].second; while (x != y) { if (dep[x] < dep[y]) swap(x, y); if (!d[x]) d[x] = i; else { num = d[x]; break; } x = fath[x][0]; } if (num) { printf( YES n ); x = s[i].first, y = s[i].second; while (x != y) { if (dep[x] < dep[y]) swap(x, y); f[x][0] = 1; x = fath[x][0]; } x = s[num].first, y = s[num].second; while (x != y) { if (dep[x] < dep[y]) swap(x, y); f[x][1] = 1; x = fath[x][0]; } for (int i = 1; i <= n; i++) if (f[i][0] && f[i][1]) p[fath[i][0]]++, p[i]++; int cnt = 0; for (int i = 1; i <= n; i++) if (p[i] == 1) id[cnt++] = i; x = id[0]; y = id[1]; while (p[x]) o1.push_back(x), x = fath[x][0]; while (p[y]) o2.push_back(y), y = fath[y][0]; printf( %d , (int)(o1.size() + o2.size() - 1)); for (int i = 0; i < (int)o1.size() - 1; i++) printf( %d , o1[i]); while (o2.size()) { int u = o2.back(); o2.pop_back(); printf( %d%c , u, !o2.size() ? n : ); } calc(i), calc(num); return 0; } } printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; long a[1000]; cin >> n; cin >> a[0]; long max = a[0], min = a[0]; for (int i = 1; i < n; i++) { cin >> a[i]; if (a[i] > max) { max = a[i]; } else if (a[i] < min) { min = a[i]; } } cout << max - min - (n - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int N; vector<int> graph[100010]; int deg[100010]; int sum[100010]; long long dpa[100010], dpb[100010]; long long power(long long x, long long n) { if (n == 0) return 1; long long y = power(x, n / 2); y = y * y % 1000000007ll; if (n % 2 == 1) y = y * x % 1000000007ll; return y; } void dfs(int p, int x) { int i; if (deg[x] == 1) { dpa[x] = dpb[x] = 0; return; } long long A = 0, B = 0; int K = 0; for ((i) = 0; (i) < (int)(graph[x].size()); (i)++) { int y = graph[x][i]; if (y == p) continue; K++; dfs(x, y); A = (A + dpa[y]) % 1000000007ll; B = (B + dpb[y]) % 1000000007ll; } int K2 = K + 1; if (x == 0) K2--; dpa[x] = power((K2 - A + 1000000007ll) % 1000000007ll, 1000000007ll - 2); dpb[x] = (B + sum[x]) * dpa[x] % 1000000007ll; } int main(void) { int i; cin >> N; for ((i) = 0; (i) < (int)(N - 1); (i)++) { int a, b, c; scanf( %d%d%d , &a, &b, &c); graph[a].push_back(b); graph[b].push_back(a); deg[a]++; deg[b]++; sum[a] += c; sum[b] += c; } dfs(-1, 0); cout << dpb[0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const int maxn = 1000; int n, m, val; char s[maxn][maxn]; int f[maxn][maxn]; int sum[maxn][maxn]; long long res; int main() { for (int i = 0; i < int(maxn); i++) for (int j = 0; j < int(maxn); j++) { s[i][j] = 0; f[i][j] = 0; sum[i][j] = 0; } cin >> n >> m >> val; for (int i = int(1); i < int(n + 1); i++) for (int j = int(1); j < int(m + 1); j++) cin >> s[i][j]; for (int i = int(1); i < int(n + 1); i++) for (int j = int(1); j < int(m + 1); j++) { if (s[i][j] == 1 && s[i - 1][j] == 1 && s[i + 1][j] == 1 && s[i][j - 1] == 1 && s[i][j + 1] == 1 ) f[i + 1][j + 1] = 1; } for (int i = int(1); i < int(n + 1); i++) for (int j = int(1); j < int(m + 1); j++) { sum[i][j] = (sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1]) + f[i][j]; } for (int i = int(1); i < int(n); i++) for (int j = int(1); j < int(m); j++) { for (int k = int(1); k < int(m - j + 2); k++) { int l = i + 1, r = n + 1, cur; while (l < r - 1) { cur = (l + r) >> 1; if (sum[cur][j + k - 1] - sum[cur][j + 1] - sum[i + 1][j + k - 1] + sum[i + 1][j + 1] < val) l = cur; else r = cur; } res += n - l; } } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; long long expo(long long n) { if (n == 0) return 1; if (n % 2) { long long x = expo(n / 2); return x * x * 2; } else { long long x = expo(n / 2); return x * x; } } int main() { ios_base::sync_with_stdio(false); long long x, y, z, i, j, k, f = 0, n, m; cin >> n >> m; x = m; while (x > 0) { f++; x /= 2; } if (f < n) { cout << m; } else { cout << m % expo(n); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 2e9; const long long INF = 8e18; const int maxn = 1e5 + 5; int n; int cnt[maxn], val[maxn]; long long S, SUM; vector<pair<int, int> > e[maxn]; inline void dfs(int u, int pre) { if (u != 1 && e[u].size() == 1) { cnt[u] = 1; } for (auto &x : e[u]) { int v = x.first, w = x.second; if (v == pre) { continue; } val[v] = w; dfs(v, u); cnt[u] += cnt[v]; } } inline void init() { for (int i = 0; i < n + 5; ++i) { e[i].clear(); cnt[i] = 0; } SUM = 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); int T; cin >> T; while (T--) { cin >> n >> S; for (int i = 1; i <= n - 1; ++i) { int u, v, w; cin >> u >> v >> w; e[u].push_back({v, w}); e[v].push_back({u, w}); } dfs(1, 1); priority_queue<pair<long long, int> > pq; for (int i = 2; i <= n; ++i) { SUM += 1ll * val[i] * cnt[i]; pq.push({1ll * (val[i] - (val[i] >> 1)) * cnt[i], i}); val[i] >>= 1; } int ans = 0; while (SUM > S) { ++ans; auto now = pq.top(); pq.pop(); long long w = now.first, id = now.second; SUM -= w; pq.push({1ll * (val[id] - (val[id] >> 1)) * cnt[id], id}); val[id] >>= 1; } cout << ans << n ; init(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline long long read() { long long 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(long long a) { if (a < 0) { a = -a; putchar( - ); } if (a >= 10) write(a / 10); putchar( 0 + a % 10); } inline void writeln(long long a) { write(a); puts( ); } inline void wri(long long a) { write(a); putchar( ); } inline unsigned long long rnd() { return ((unsigned long long)rand() << 30 ^ rand()) << 4 | rand() % 4; } const int N = 100005, ZT = 500, K = 5, mod = 1e9 + 7; struct data { int a[K]; bool ins(int x) { for (int i = (int)(K - 1); i >= (int)(0); i--) if (x >> i & 1) { if (a[i]) { x ^= a[i]; } else { for (int j = (int)(0); j <= (int)(i - 1); j++) if (x >> j & 1) x ^= a[j]; a[i] = x; for (int j = (int)(i + 1); j <= (int)(K - 1); j++) if (a[j] >> i & 1) a[j] ^= x; return 1; } } return 0; } int& operator[](int x) { return a[x]; } } A[ZT], ffff, qj; bool operator<(data a, data b) { for (int i = (int)(0); i <= (int)(K - 1); i++) if (a[i] != b[i]) return a[i] < b[i]; return 0; } map<data, int> M; vector<pair<int, int> > v[N]; bool vis[N], bj[N]; int dis[N], alb[N], fa[N], Q, QJ, QQ; void dfs(int p) { vis[p] = 1; for (auto i : v[p]) if (i.first != 1) { if (!vis[i.first]) { dis[i.first] = dis[p] ^ i.second; fa[i.first] = p; dfs(i.first); } else { if (bj[p] && bj[i.first]) { Q = 1; QQ = alb[p] ^ alb[i.first] ^ i.second; } else if (i.first != fa[p] && i.first < p) { QJ *= qj.ins(i.second ^ dis[p] ^ dis[i.first]); } } } } int dq, gg[ZT][ZT], zy[ZT][ZT]; long long ans, f[ZT], g[ZT]; inline void add(long long& a, long long b) { a = (a + b) % mod; } void dfs(data a) { if (!M.count(a)) { M[a] = ++dq; A[dq] = a; } else return; for (int j = (int)(0); j <= (int)((1 << K) - 1); j++) { data b = a; b.ins(j); dfs(b); } } int main() { dfs(ffff); for (int i = (int)(1); i <= (int)(dq); i++) for (int j = (int)(1); j <= (int)(dq); j++) { data a = A[i]; gg[i][j] = 1; for (int o = (int)(0); o <= (int)(K - 1); o++) if (A[j][o]) gg[i][j] &= a.ins(A[j][o]); zy[i][j] = M[a]; } int n = read(), m = read(); for (int i = (int)(1); i <= (int)(m); i++) { int a = read(), b = read(), w = read(); v[a].push_back(make_pair(b, w)); v[b].push_back(make_pair(a, w)); } for (auto i : v[1]) { bj[i.first] = 1; alb[i.first] = i.second; } vis[1] = 1; f[1] = 1; for (auto i : v[1]) if (!vis[i.first]) { Q = 0; QJ = 1; memset((qj.a), 0, sizeof(qj.a)); dfs(i.first); if (!QJ) continue; memcpy(g, f, sizeof(f)); if (Q) { int x = M[qj]; QJ *= qj.ins(QQ); int y = M[qj]; for (int j = (int)(1); j <= (int)(dq); j++) { if (gg[j][x]) add(g[zy[j][x]], f[j] * 2); if (gg[j][y]) add(g[zy[j][y]], f[j] * QJ); } } else { int x = M[qj]; for (int j = (int)(1); j <= (int)(dq); j++) if (gg[j][x]) add(g[zy[j][x]], f[j]); } swap(f, g); } for (int i = (int)(1); i <= (int)(dq); i++) add(ans, f[i]); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) { if (x > y) x = y; } template <typename T1, typename T2> inline void chkmax(T1 &x, const T2 &y) { if (x < y) x = y; } int n, m, k; vector<pair<int, int>> a[4]; set<pair<int, int>> L, R; int sumSet; void read() { cin >> n >> m >> k; for (int i = 0; i < n; i++) { int t, f1, f2; cin >> t >> f1 >> f2; a[f1 * 2 + f2].push_back({t, i}); } for (int i = 0; i <= 3; i++) sort(a[i].begin(), a[i].end()); } void relax(int sz) { sz = max(sz, 0); while (L.size() > sz) { auto x = *(--L.end()); L.erase(--L.end()); sumSet -= x.first; R.insert(x); } while (L.size() < sz) { if (R.empty()) break; auto x = *(R.begin()); R.erase(R.begin()); L.insert(x); sumSet += x.first; } } void add(pair<int, int> a) { if (R.empty()) { L.insert(a); sumSet += a.first; } else if (L.empty()) { R.insert(a); } else if (*(R.begin()) < a) { R.insert(a); } else { L.insert(a); sumSet += a.first; } } int ans; vector<int> fans; void run() { ans = 2e9 + 228 + 1337; for (int it = 0; it < 2; it++) { L.clear(); R.clear(); sumSet = 0; int sum = 0; int top1 = (int)a[1].size() - 1; int top2 = (int)a[2].size() - 1; for (auto i : a[0]) add(i); for (auto i : a[1]) sum += i.first; for (auto i : a[2]) sum += i.first; for (int i = 0; i <= min(m, (int)a[3].size()); i++) { if (i > 0) sum += a[3][i - 1].first; while (top1 >= 0 && top1 + 1 + i > k) { sum -= a[1][top1].first; add(a[1][top1--]); } while (top2 >= 0 && top2 + 1 + i > k) { sum -= a[2][top2].first; add(a[2][top2--]); } if (min(top1, top2) + 1 + i < k) continue; int sz = m - i - (top1 + 1) - (top2 + 1); if (sz < 0) continue; if (L.size() + R.size() < sz) continue; relax(sz); chkmin(ans, sum + sumSet); if (!it || sum + sumSet != ans) continue; for (auto j : L) { fans.push_back(j.second); } for (int j = 0; j <= top1; j++) { fans.push_back(a[1][j].second); } for (int j = 0; j <= top2; j++) { fans.push_back(a[2][j].second); } for (int j = 0; j < i; j++) { fans.push_back(a[3][j].second); } return; } } cout << -1 << endl; exit(0); } void write() { cout << ans << endl; sort(fans.begin(), fans.end()); for (auto i : fans) { cout << i + 1 << ; } cout << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); read(); run(); write(); return 0; } |
#include <bits/stdc++.h> int main() { int n, i; scanf( %d , &n); int array[n]; for (i = 0; i < n; i++) { scanf( %d , &array[i]); } int min = 9999999, max = 0, count; for (i = 0; i < n; i++) { if (array[i] < min) { min = array[i]; } if (array[i] > max) { max = array[i]; } } int maxIndex, minIndex; for (i = 0; i < n; i++) { if (array[i] == max) { maxIndex = i; break; } } for (i = n - 1; i >= 0; i--) { if (array[i] == min) { minIndex = i; break; } } int maxDistance, minDistance; int swapCount = 0; for (i = maxIndex; i > 0; i--) { swapCount++; int temp = array[i]; array[i] = array[i - 1]; array[i - 1] = temp; } for (i = 0; i < n; i++) { if (array[i] == max) { maxIndex = i; break; } } for (i = n - 1; i >= 0; i--) { if (array[i] == min) { minIndex = i; break; } } for (i = minIndex; i < n - 1; i++) { swapCount++; int temp = array[i]; array[i] = array[i + 1]; array[i + 1] = temp; } printf( %d , swapCount); } |
#include <bits/stdc++.h> using namespace std; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << ; cout << endl; } template <class T> void chmin(T &t, T f) { if (t > f) t = f; } template <class T> void chmax(T &t, T f) { if (t < f) t = f; } int in() { int x; scanf( %d , &x); return x; } int uf[110]; int root(int x) { return (uf[x] < 0) ? x : (uf[x] = root(uf[x])); } bool conn(int x, int y) { x = root(x); y = root(y); if (x == y) return 0; if (uf[x] > uf[y]) swap(x, y); uf[x] += uf[y]; uf[y] = x; return 1; } int N, M; int A[10010], B[10010]; int len; int usLens[110]; int us[110][110]; int main() { int i; int u, v; int j, k; for (; ~scanf( %d%d , &N, &M);) { for (i = 0; i < M; ++i) { A[i] = in() - 1; B[i] = in() - 1; } memset(uf, ~0, N << 2); for (i = 0; i < M; ++i) { conn(A[i], B[i]); } len = 0; memset(usLens, 0, sizeof(usLens)); for (u = 0; u < N; ++u) if (uf[u] < 0) { if (-uf[u] > 3) { goto failed; } if (-uf[u] < 2) { continue; } for (v = 0; v < N; ++v) if (root(v) == u) { us[len][usLens[len]++] = v; } ++len; } if (len > N / 3) { goto failed; } for (u = 0; u < N; ++u) if (uf[u] < 0) { if (-uf[u] < 2) { for (j = 0; j < N / 3; ++j) { if (usLens[j] < 3) { us[j][usLens[j]++] = u; break; } } } } for (j = 0; j < N / 3; ++j) { for (k = 0; k < 3; ++k) { if (k) printf( ); printf( %d , us[j][k] + 1); } puts( ); } continue; failed:; puts( -1 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int dir4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; int dir8[8][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, {-1, 1}, {1, -1}, {1, 1}, {-1, -1}}; int dir8h[8][2] = {{2, 1}, {-2, -1}, {-1, 2}, {1, -2}, {1, 2}, {-2, 1}, {2, -1}, {-1, -2}}; long double eps = 1e-7; const int N = 52; long long dp[N][N]; vector<string> v[N]; int main() { ios_base::sync_with_stdio(false); int n; string s; cin >> n; for (long long i = 0; i < n; i++) { cin >> s; v[i].push_back(s); for (long long j = 1; j <= s.size() - 1; j++) { string s1; for (long long k = 1; k <= s.size() - 1; k++) s1 += s[k]; s1 += s[0]; v[i].push_back(s1); s = s1; } } for (long long i = 0; i < n; i++) for (long long j = 0; j < v[0].size(); j++) dp[i][j] = 1e9; for (long long i = 0; i < v[0].size(); i++) dp[0][i] = i; for (long long i = 1; i <= n - 1; i++) { for (long long j = 0; j < v[i].size(); j++) { for (long long k = 0; k < v[i - 1].size(); k++) if (v[i][j] == v[i - 1][k]) dp[i][j] = min(dp[i][j], j + dp[i - 1][k]); } } long long mn = 1e9; for (long long i = 0; i < v[n - 1].size(); i++) mn = min(mn, dp[n - 1][i]); if (mn == 1e9) cout << -1; else cout << mn; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i = 1, j = 1, c1, c2; cin >> n; if (n % 2) cout << 9 << << (n - 9) << endl; else cout << 8 << << (n - 8) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t > 0) { long long int n, s; cin >> n >> s; long long int a[n]; long long int sum = 0; for (long long int i = (0); i < (n); i++) { cin >> a[i]; sum = sum + a[i]; } if (s >= sum) { cout << 0 << endl; t--; continue; } long long int flag = 0; long long int index; long long int count = 0; for (long long int i = (0); i < (n); i++) { count = count + a[i]; if (count > s) { index = i; flag = 1; break; } } long long int m = INT_MIN; long long int ans = 0; for (long long int i = (0); i < (index + 1); i++) { if (a[i] > m) { m = a[i]; ans = i; } } if (ans == index) { if (count - a[index] + a[index + 1] <= s) { cout << index + 1 << endl; } else { cout << 0 << endl; } t--; continue; } else { cout << ans + 1 << endl; t--; continue; } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T = 1; while (T--) { int n, u; cin >> n >> u; vector<int> v; for (int i = 0; i < n; i++) { int t; cin >> t; v.push_back(t); } int I, K, J; double ans = 0.0; for (int i = 0; i < n - 2; i++) { I = v[i]; J = v[i + 1]; K = lower_bound((v).begin(), (v).end(), u + I) - v.begin(); if (K == n) { K = n - 1; } else if (v[K] != u + I) { K--; } K = v[K]; double a = double(K - J) / (K - I); ans = max(a, ans); } if (ans == 0) { cout << -1; exit(0); } printf( %.20f , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, b, c; cin >> a >> b; sort(a.begin(), a.end()); if (a.length() < b.length()) { reverse(a.begin(), a.end()); cout << a << endl; } else { for (int i = 0; i < a.length(); i++) { for (int j = a.length() - 1; j > i; j--) { c = a; swap(a[i], a[j]); sort(a.begin() + i + 1, a.end()); if (a > b) { a = c; } else break; } } cout << a << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int N, M; cin >> N >> M; long long ans = 0; int step = 1; for (int i = 1; i <= M; ++i) { int T; cin >> T; if (T >= step) { ans += T - step; } else { ans += N - step + T; } step = T; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using i64 = long long; using f64 = double; using f80 = long double; using pii = pair<int, int>; using pll = pair<i64, i64>; using ptx = pair<f64, f64>; const int N = 3e5 + 5, LG = 20; int f[N], conv[N], tmp[N]; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int n; cin >> n; for (int t, i = 1; i <= n; ++i) { cin >> t; f[t] = conv[t] = 1; if (t == 1) { cout << 1 n ; return 0; } } for (int tid = 2; tid <= 7; ++tid) { i64 drop, st, dr; for (int i = N - 1; i >= 1; --i) { drop = st = dr = 0; for (int j = i; j < N; j += i) { drop += tmp[j]; st += conv[j]; dr += f[j]; } tmp[i] = st * dr - drop; } if (tmp[1]) { cout << tid << endl; return 0; } for (int i = 0; i < N; ++i) { conv[i] = int(tmp[i] > 0); tmp[i] = 0; } } cout << -1 n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long suf(long long a) { return (a * (a + 1)) / 2; } const long long OO = 1e6 + 10, MOD = 1e9 + 7; vector<vector<int> > adj, can; int dx[]{1, -1, 0, 0, 1, -1, 1, -1}; int dy[]{0, 0, 1, -1, 1, -1, -1, 1}; int main() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long n, m, k, a, b, c, d; string s, s1; char ch; while (cin >> n) { vector<vector<int> > v(1e5 + 5); vector<pair<int, int> > ans; for (int i = 0; i < n; i++) { cin >> a; v[a].push_back(i + 1); } for (int i = 0; i < v.size(); i++) { if (v[i].size() == 1) ans.push_back({i, 0}); else if (v[i].size() > 1) { int now = v[i][1] - v[i][0]; bool ok = true; for (int j = 2; j < v[i].size(); j++) { if (v[i][j] - v[i][j - 1] != now) { ok = false; break; } } if (ok) ans.push_back({i, now}); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i].first << << ans[i].second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2 * 1e5; inline 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 << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return x * f; } int a[N]; int n; int dfs(int h, int w, int s) { if (s > n) return h; int sum = 0; for (int i = s; i <= n; i++) { if (a[i] > a[i + 1]) sum++; if (sum == w) return dfs(h + 1, i - s + 1, i + 1); } return h + 1; } int main() { int T; T = read(); while (T--) { n = read(); for (int i = 1; i <= n; i++) a[i] = read(); printf( %d n , dfs(1, 1, 2) - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 200000; int n; int a[MAXN]; void run() { scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &a[i]); sort(a, a + n); int ndiff = unique(a, a + n) - a; int ret = n + 1 - ndiff; printf( %d n , ret); } int main() { run(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int l, r; } e[200010]; bool operator<(node t1, node t2) { return t1.r < t2.r; } int n, ans; int main() { scanf( %d , &n); int w, x; for (int i = 1; i <= n; i++) { scanf( %d%d , &x, &w); e[i].l = x - w; e[i].r = x + w; } sort(e + 1, e + n + 1); int L = -0x7fffffff; for (int i = 1; i <= n; i++) { if (e[i].l >= L) { ans++; L = e[i].r; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using cd = complex<double>; const double pi = acos(-1); const double EPS = 1e-5; void iter(vector<cd> &a, bool invert) { int n = a.size(); for (int i = 1, j = 0; i < n; i++) { int bit = n >> 1; for (; j & bit; bit >>= 1) j ^= bit; j ^= bit; if (i < j) swap(a[i], a[j]); } for (int len = 2; len <= n; len <<= 1) { double ang = 2 * pi / len * (invert ? -1 : 1); cd wlen(cos(ang), sin(ang)); for (int i = 0; i < n; i += len) { cd w(1); for (int j = 0; j < len / 2; j++) { cd u = a[i + j], v = a[i + j + len / 2] * w; a[i + j] = u + v; a[i + j + len / 2] = u - v; w *= wlen; } } } if (invert) for (cd &x : a) x /= n; } void iter2d(vector<vector<cd>> &a, bool invert) { for (auto &it : a) iter(it, invert); for (int j = 0; j < a[0].size(); j++) { vector<cd> col(a.size()); for (int i = 0; i < a.size(); i++) col[i] = a[i][j]; iter(col, invert); for (int i = 0; i < a.size(); i++) a[i][j] = col[i]; } } vector<vector<int>> mult(vector<vector<cd>> &a, vector<vector<cd>> &b) { int nr = 1; while (nr < a.size() + b.size()) nr <<= 1; a.resize(nr); b.resize(nr); int nc = 1; while (nc < a[0].size() + b[0].size()) nc <<= 1; for (auto &it : a) it.resize(nc, 0); for (auto &it : b) it.resize(nc, 0); iter2d(a, 0); iter2d(b, 0); for (int i = 0; i < nr; i++) for (int j = 0; j < nc; j++) a[i][j] *= b[i][j]; iter2d(a, 1); vector<vector<int>> ret(nr, vector<int>(nc)); for (int i = 0; i < nr; i++) for (int j = 0; j < nc; j++) ret[i][j] = (int)(a[i][j].real() + EPS); return ret; } const int N = 401; int n, m, r, c; string str[N]; string pat[N]; int main() { ios::sync_with_stdio(0), cin.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> str[i]; cin >> r >> c; for (int i = 0; i < r; i++) cin >> pat[i]; vector<vector<cd>> a(n + r, vector<cd>(m + c)), b(r, vector<cd>(c, 0)); for (int i = 0; i < n + r; i++) for (int j = 0; j < m + c; j++) { int cur = str[i % n][j % m] - a ; double ang = 2 * pi * cur / 26; a[i][j] = cd(cos(ang), sin(ang)); } int cnt = 0; for (int i = 0; i < r; i++) for (int j = 0; j < c; j++) { if (pat[i][j] == ? ) continue; cnt++; int cur = pat[i][j] - a ; double ang = 2 * pi * cur / 26; b[r - 1 - i][c - 1 - j] = cd(cos(ang), -sin(ang)); } vector<vector<int>> ret; ret = mult(a, b); for (int i = r - 1; i < n + r - 1; i++) { for (int j = c - 1; j < m + c - 1; j++) cout << (ret[i][j] == cnt); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 5; int boy[maxn], girl[maxn]; int n, m; int main() { int b, g; while (scanf( %d%d , &n, &m) != EOF) { memset(boy, 0, sizeof(boy)); memset(girl, 0, sizeof(girl)); int in; scanf( %d , &b); for (int i = 0; i < b; i++) { scanf( %d , &in); boy[in] = 1; } scanf( %d , &g); for (int i = 0; i < g; i++) { scanf( %d , &in); girl[in] = 1; } bool flag; int stb = 0, stg = 0; int cnt = maxn * maxn; while (cnt) { flag = true; stb %= n; stg %= m; if (boy[stb] || girl[stg]) { boy[stb] = 1; girl[stg] = 1; } for (int i = 0; i < n; i++) { if (!boy[i]) { flag = false; break; } } for (int i = 0; i < m; i++) { if (!girl[i]) { flag = false; break; } } if (flag) break; stb++; stg++; cnt--; } printf( %s n , flag ? Yes : No ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9; long double sqr(long double a) { return a * a; } long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); long long k; cin >> k; map<long long, pair<long long, long long> > sm; for (auto i = 0; i < k; ++i) { long long n, sum = 0; cin >> n; vector<long long> a(n); for (auto &it : a) { cin >> it; sum += it; } for (auto j = 0; j < n; ++j) { if (sm.find(sum - a[j]) != sm.end()) { cout << YES n << sm[sum - a[j]].first << << sm[sum - a[j]].second << n << i + 1 << << j + 1; return 0; } } for (auto j = 0; j < n; ++j) { sm[sum - a[j]] = {i + 1, j + 1}; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> int res[1100002]; int mark[1100002]; void set(int i, int L, int R, int l, int r, int x) { int LR, RL; if (L <= R && l <= r && L <= l && r <= R && res[i] <= 0 && mark[i] == 0) { if (L == l && R == r) mark[i] = 1; if (res[i] == 0 && L == l && R == r) res[i] = x; else { if (res[i] >= 0) { res[(i << 1) + 1] = res[i]; res[(i << 1) + 2] = res[i]; res[i] = -1; mark[(i << 1) + 1] = 0; mark[(i << 1) + 2] = 0; } LR = L + ((R - L) >> 1); RL = LR + 1; if (l <= LR) { if (r < LR) set((i << 1) + 1, L, LR, l, r, x); else set((i << 1) + 1, L, LR, l, LR, x); } if (r >= RL) { if (l > RL) set((i << 1) + 2, RL, R, l, r, x); else set((i << 1) + 2, RL, R, RL, r, x); } } } } void out(int i, int L, int R) { int j; if (res[i] >= 0) for (j = L; j <= R; j++) printf( %d , res[i]); else { out((i << 1) + 1, L, L + ((R - L) >> 1)); out((i << 1) + 2, L + ((R - L) >> 1) + 1, R); } } int main() { int i; int n; int m; int l, r, x; scanf( %d%d , &n, &m); res[0] = 0; mark[0] = 0; for (i = 0; i < m; i++) { scanf( %d%d%d , &l, &r, &x); if (x - 1 >= l) set(0, 1, n, l, x - 1, x); if (x + 1 <= r) set(0, 1, n, x + 1, r, x); } out(0, 1, n); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5; char s[maxn]; int a[maxn]; int n, l, r, i, x; int main() { scanf( %s , s + 1); n = strlen(s + 1); for (i = 1; i <= n; i++) a[i] = s[i] - 0 ; l = 1; r = n; if (a[l] != a[r]) { a[l]--; a[l + 1] += 10; if (!a[l]) l++; else if (a[l] != a[r]) { printf( 0 ); return 0; } } while (l <= r) { if (a[l] >= a[r] + 10 && a[r] < 10) a[r - 1]--, a[r] += 10; if (a[l] == a[r] + 1) a[l + 1] += 10, a[l]--; if (a[l] != a[r]) break; if (l != r) { a[l] = a[l] - a[l] / 2; a[r] -= a[l]; } else if ((a[l] & 1) == 0) a[l] >>= 1; else break; if (a[l] < 0 || a[l] > 9 || a[r] < 0 || a[r] > 9) break; l++; r--; } if (l <= r) { printf( 0 ); } else { l = 1; if (!a[l]) l++; while (l <= n) { printf( %d , a[l]); l++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Imx = 2147483647; const long long Lbig = 2e18; const int mod = 1e9 + 7; struct fastio { char s[100000]; int it, len; fastio() { it = len = 0; } inline char get() { if (it < len) return s[it++]; it = 0; len = fread(s, 1, 100000, stdin); if (len == 0) return EOF; else return s[it++]; } bool notend() { char c = get(); while (c == || c == n ) c = get(); if (it > 0) it--; return c != EOF; } } _buff; inline long long getnum() { long long r = 0; bool ng = 0; char c; c = _buff.get(); while (c != - && (c < 0 || c > 9 )) c = _buff.get(); if (c == - ) ng = 1, c = _buff.get(); while (c >= 0 && c <= 9 ) r = r * 10 + c - 0 , c = _buff.get(); return ng ? -r : r; } template <class T> inline void putnum(T x) { if (x < 0) putchar( - ), x = -x; register short a[20] = {}, sz = 0; while (x) a[sz++] = x % 10, x /= 10; if (sz == 0) putchar( 0 ); for (int i = sz - 1; i >= 0; i--) putchar( 0 + a[i]); } inline char getreal() { char c = _buff.get(); while (c == || c == n ) c = _buff.get(); return c; } int n; int head[500111], nxt[1000111], to[1000111], tot = 1; int head2[500111], nxt2[1000111], to2[1000111], tot2 = 1; int f[500111]; bool oc[500111], oc2[500111]; void adde(int x, int y) { nxt[++tot] = head[x]; head[x] = tot; to[tot] = y; } void adde2(int x, int y) { nxt2[++tot2] = head2[x]; head2[x] = tot2; to2[tot2] = y; } int gf(int x) { return f[x] == x ? x : f[x] = gf(f[x]); } map<pair<int, int>, int> mpid; int nid[500111]; void dfs(int x, int p = -1) { for (int i = head[x]; i; i = nxt[i]) { int u = to[i]; if (u == p) continue; dfs(u, x); if (oc[i >> 1]) continue; int tmp = nid[gf(u)]; if (!tmp) continue; putnum(u), putchar( ), putnum(x), putchar( ); putnum(to2[tmp]), putchar( ), putnum(to2[tmp ^ 1]), putchar( n ); } } void dfs2(int x, int p = -1) { for (int i = head2[x]; i; i = nxt2[i]) { int u = to2[i]; if (u == p) continue; if (!oc2[i >> 1]) nid[gf(u)] = i; dfs2(u, x); } } int main() { n = getnum(); for (int i = 1; i <= n; i++) f[i] = i; for (int i = 1; i < n; i++) { int x, y; x = getnum(), y = getnum(); if (x > y) swap(x, y); mpid[make_pair(x, y)] = i; adde(x, y); adde(y, x); } int cnt = n - 1; for (int i = 1; i < n; i++) { int x, y; x = getnum(), y = getnum(); if (x > y) swap(x, y); if (mpid.find(make_pair(x, y)) != mpid.end()) { oc[mpid[make_pair(x, y)]] = 1; oc2[i] = 1; cnt--; f[gf(x)] = gf(y); } adde2(x, y); adde2(y, x); } dfs2(1); putnum(cnt), putchar( n ); dfs(1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, y, c1 = 0, c2 = 0, i1 = 0, i2 = 0, t, cou = 0; cin >> x >> y; if (y < x) { t = x; x = y; y = t; } while (x != y) { if (c1 <= c2) { if (c1 == 0) c1 = 1; x++; i1++; c1 += i1; cou += i1; } else { if (c2 == 0) c2 = 1; y--; i2++; c2 += i2; cou += i2; } } cout << cou; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int q, w, e, r; cin >> q >> w >> e >> r; string s; cin >> s; unsigned long long int c = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { c += q; } if (s[i] == 2 ) { c += w; } if (s[i] == 3 ) { c += e; } if (s[i] == 4 ) { c += r; } } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; string s; cin >> s; char arr[26]; map<int, int> mmap; for (int i = 0; i < 26; i++) { mmap[i] = i; arr[i] = i; } for (int i = 0; i < m; i++) { char pr, nx; cin >> pr >> nx; arr[mmap[pr - a ]] = nx - a ; arr[mmap[nx - a ]] = pr - a ; int temp = mmap[nx - a ]; mmap[nx - a ] = mmap[pr - a ]; mmap[pr - a ] = temp; for (int i = 0; i < 26; i++) { if (false) cout << (char)( a + i) << -> << (char)(arr[i] + a ) << endl; } } string ans = ; for (int i = 0; i < s.length(); i++) { ans += (char)(arr[s[i] - a ] + a ); } cout << ans << endl; } int main() { solve(); } |
#include <bits/stdc++.h> using namespace std; int a[222]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; int ans = m; for (int i = 0; i < n - 1; i++) if (a[i] - a[i + 1] > ans) ans = a[i] - a[i + 1]; cout << ans - m << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; char str[2001000], g[2001000]; int a[2001000]; int main() { scanf( %s , str); int m; scanf( %d , &m); memset((a), (0), sizeof(a)); for (int(i) = (0); (i) < (m); ++(i)) { int x; scanf( %d , &x); x--; a[x] ^= 1; } int n = strlen(str); int k = 0; for (int(i) = (0); (i) < (n / 2); ++(i)) { k ^= a[i]; if (k) { g[i] = str[n - 1 - i]; g[n - 1 - i] = str[i]; } else { g[i] = str[i]; g[n - 1 - i] = str[n - 1 - i]; } } if (n & 1) g[n >> 1] = str[n >> 1]; g[n] = 0; printf( %s n , g); } |
#include <bits/stdc++.h> using namespace std; const int M = 1e5 + 10; char s[M]; map<char, int> mp; int main() { int n; scanf( %d , &n); scanf( %s , s); for (int i = 0; i < n; i++) { mp[s[i]]++; } int minn1 = M; if (mp[ o ] && mp[ n ] && mp[ e ]) { minn1 = min(minn1, mp[ o ]); minn1 = min(minn1, mp[ n ]); minn1 = min(minn1, mp[ e ]); mp[ o ] -= minn1; mp[ e ] -= minn1; } int minn2 = M; if (mp[ z ] && mp[ e ] && mp[ r ] && mp[ o ]) { minn2 = min(minn2, mp[ z ]); minn2 = min(minn2, mp[ e ]); minn2 = min(minn2, mp[ r ]); minn2 = min(minn2, mp[ o ]); } if (minn1 == M) minn1 = 0; if (minn2 == M) minn2 = 0; for (int i = 1; i <= minn1; i++) printf( 1 ); for (int i = 1; i <= minn2; i++) printf( 0 ); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(); int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) { solve(); cout << n ; } cerr << time taken : << (float)clock() / CLOCKS_PER_SEC << secs << endl; return 0; } long long num(long long x, long long n, long long m) { long long res = 0; --x; for (long long i = 1; i <= n; i++) res += min(x / i, m); return res; } void solve() { long long n, m; cin >> n >> m; long long k; cin >> k; long long l = 1; long long r = n * m + 1; while (l < r) { long long x = (l + r) >> 1; if (num(x, n, m) < k) l = x + 1; else r = x; } cout << l - 1; return; } |
#include <bits/stdc++.h> using namespace std; int n, a[210000], pos[210000], Log2[210000]; int f[210000][21]; void init() { for (int i = 1; i <= n; i++) f[i][0] = i; for (int j = 1; (1 << j) <= n; j++) for (int i = 1; i + (1 << j) - 1 <= n; i++) if (a[f[i][j - 1]] > a[f[i + (1 << (j - 1))][j - 1]]) f[i][j] = f[i][j - 1]; else f[i][j] = f[i + (1 << (j - 1))][j - 1]; } int query(int l, int r) { int k = Log2[r - l + 1]; if (a[f[l][k]] > a[f[r - (1 << k) + 1][k]]) return f[l][k]; else return f[r - (1 << k) + 1][k]; } int dfs(int l, int r) { if (l >= r) return 0; int k = query(l, r), ans = 0, v; if (k - l <= r - k) for (int i = l; i <= k; i++) { v = a[k] - a[i]; if (pos[v] > k && pos[v] <= r) ans++; } else for (int i = k + 1; i <= r; i++) { v = a[k] - a[i]; if (pos[v] >= l && pos[v] <= k) ans++; } return ans + dfs(l, k - 1) + dfs(k + 1, r); } int main() { scanf( %d , &n); Log2[0] = -1; for (int i = 1; i <= n; i++) Log2[i] = Log2[i >> 1] + 1; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); pos[a[i]] = i; } init(); printf( %d n , dfs(1, n)); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, f, k, ans, now; int main() { scanf( %d%d%d%d , &a, &b, &f, &k); if (b < f) { printf( -1 ); return 0; } now = b - f; for (int i = 1; i <= k; i++) { if (i % 2) { if (b < (a - f) + (a - f) * (i != k)) return printf( -1 ), 0; if (now < (a - f) + (a - f) * (i != k)) now = b, ans++; now -= 2 * (a - f); } else { if (b < f + f * (i != k)) return printf( -1 ), 0; if (now < f + f * (i != k)) now = b, ans++; now -= 2 * f; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(3) #pragma GCC optimize(2) using namespace std; set<int> st; set<pair<long long, int>> bus[200011]; map<long long, set<pair<int, int>>> q; int n, k, m; int main() { int i; scanf( %d%d%d , &n, &k, &m); for (i = 1; i <= k; ++i) { int xi; scanf( %d , &xi); st.insert(xi); bus[xi].insert(make_pair(0, i)); } while (m-- > 0) { long long ti; int a, b; scanf( %I64d%d%d , &ti, &a, &b); while (!q.empty()) { auto iter = q.begin(); if (iter->first > ti) break; for (auto p : iter->second) { st.insert(p.first); bus[p.first].insert(make_pair(iter->first, p.second)); } q.erase(iter->first); } if (!st.empty()) { auto iter = st.upper_bound(a); pair<int, pair<long long, int>> car = make_pair(1e6, make_pair(1e14, 1e6)); bool ok = false; if (iter != st.end()) { car.first = *iter; car.second = *bus[car.first].begin(); ok = true; } if (iter != st.begin()) { iter = prev(iter); if (ok) { int pos = *iter; if ((abs(pos - a) < abs(car.first - a)) || (abs(pos - a) == abs(car.first - a) && car.second > *bus[pos].begin())) { car.first = pos; car.second = *bus[pos].begin(); } } else { car.first = *iter; car.second = *bus[car.first].begin(); } } printf( %d %d n , car.second.second, abs(car.first - a)); bus[car.first].erase(car.second); if (bus[car.first].empty()) st.erase(car.first); long long finish = ti + abs(car.first - a) + abs(b - a); q[finish].insert(make_pair(b, car.second.second)); } else { long long t = q.begin()->first; auto iter = q[t].upper_bound(make_pair(a, 0)); pair<int, int> car = make_pair(0, 0); if (iter != q[t].end()) { car = *iter; } if (iter != q[t].begin()) { iter = prev(iter); iter = q[t].upper_bound(make_pair(iter->first, 0)); if (car.first != 0) { if ((abs(car.first - a) > abs(iter->first - a)) || ((abs(car.first - a) == abs(iter->first - a)) && car.second > iter->second)) { car = *iter; } } else { car = *iter; } } printf( %d %I64d n , car.second, abs(t - ti) + abs(car.first - a)); q[t].erase(car); if (q[t].empty()) q.erase(t); q[t + abs(car.first - a) + abs(b - a)].insert(make_pair(b, car.second)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 10; const long long mod = 1e9 + 7; long long ans; long long n, k; long long a[maxn]; long long z; long long inv[maxn]; long long fact[maxn]; long long pashm[maxn]; void in(); void solve(); long long pwr(long long, long long); long long oof(long long, long long); long long C(long long, long long); void out(); int main() { ios::sync_with_stdio(false); cout.tie(0); cin.tie(0); in(); solve(); out(); } void in() { cin >> n >> k; for (long long i = 0; i < n; i++) cin >> a[i]; } void solve() { fact[0] = 1; for (long long i = 1; i < maxn; i++) fact[i] = fact[i - 1] * i % mod; inv[maxn - 1] = pwr(fact[maxn - 1], -1); for (long long i = maxn - 2; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod; long long sum = 0; for (long long i = 0; i < n; i++) sum = (sum + a[i]) % mod; z = (oof(n, k) + oof(n - 1, k) * (n - 1) % mod) % mod; ans = (ans + sum * z % mod) % mod; } long long oof(long long a, long long b) { long long z = 0; for (long long i = b; i >= 0; i--) { long long Z = 1; if ((b - i) % 2) Z *= -1; z = (z + Z * pwr(i, a) % mod * C(b, i) % mod + mod) % mod; } z *= inv[b]; return z % mod; } long long pwr(long long a, long long b) { if (b < 0) return pwr(a, b + mod - 1); if (b == 0) return 1; long long c = pwr(a, b / 2); if (b % 2) return c * c % mod * a % mod; return c * c % mod; } long long C(long long n, long long k) { if (n == k) return 1; if (k > n) return 0; return fact[n] * inv[k] % mod * inv[n - k] % mod; } void out() { cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 1005; int main() { long long n; while (~scanf( %I64d , &n)) printf( 25 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr int maxn = 3e5 + 10, inf = 0x3f3f3f3f; int a[maxn], qtd[2 * maxn]; long long ans; void solve(int l, int r) { if (l == r) return (void)(++ans); int m = (l + r) >> 1; solve(l, m); solve(m + 1, r); int Mn = inf, Mx = 0; for (int i = m, ptr = m + 1; i >= l; i--) { bool trocou = 0; if (a[i] > Mx || a[i] < Mn) trocou = 1; Mx = max(Mx, a[i]); Mn = min(Mn, a[i]); for (; ptr <= r && a[ptr] < Mx && a[ptr] > Mn; ptr++) ; if (trocou && ptr > m + 1) ans += ptr - i >= Mx - Mn + 1; else if (ptr > m + 1) ans += ptr - i == Mx - Mn + 1; } Mn = inf, Mx = 0; for (int i = m + 1, ptr = m; i <= r; i++) { bool trocou = 0; if (a[i] > Mx || a[i] < Mn) trocou = 1; Mx = max(Mx, a[i]); Mn = min(Mn, a[i]); for (; ptr >= l && a[ptr] < Mx && a[ptr] > Mn; ptr--) ; if (trocou && ptr < m) ans += i - ptr >= Mx - Mn + 1; else if (ptr < m) ans += i - ptr == Mx - Mn + 1; } Mn = inf, Mx = 0; int MnR1 = inf, MnR2 = inf, ptr_mx = m + 1, ptr_mn = m + 1; for (int i = m; i >= l; i--) { Mx = max(Mx, a[i]); Mn = min(Mn, a[i]); for (; ptr_mn <= r && a[ptr_mn] > Mn; ptr_mn++) MnR1 = min(MnR1, a[ptr_mn]), qtd[MnR1 + ptr_mn]--; for (; ptr_mx <= r && a[ptr_mx] < Mx; ptr_mx++) MnR2 = min(MnR2, a[ptr_mx]), qtd[MnR2 + ptr_mx]++; ans += max(0, qtd[Mx + i]); } for (; ptr_mn < ptr_mx; ptr_mn++) MnR1 = min(MnR1, a[ptr_mn]), qtd[MnR1 + ptr_mn]--; for (; ptr_mx < ptr_mn; ptr_mx++) MnR2 = min(MnR2, a[ptr_mx]), qtd[MnR2 + ptr_mx]++; Mn = inf, Mx = 0, ptr_mx = m + 1, ptr_mn = m + 1; int MxR1 = 0, MxR2 = 0; for (int i = m; i >= l; i--) { Mx = max(Mx, a[i]); Mn = min(Mn, a[i]); for (; ptr_mn <= r && a[ptr_mn] > Mn; ptr_mn++) MxR1 = max(MxR1, a[ptr_mn]), qtd[ptr_mn - MxR1 + maxn]++; for (; ptr_mx <= r && a[ptr_mx] < Mx; ptr_mx++) MxR2 = max(MxR2, a[ptr_mx]), qtd[ptr_mx - MxR2 + maxn]--; ans += max(0, qtd[i - Mn + maxn]); } for (; ptr_mn < ptr_mx; ptr_mn++) MxR1 = max(MxR1, a[ptr_mn]), qtd[ptr_mn - MxR1 + maxn]++; for (; ptr_mx < ptr_mn; ptr_mx++) MxR2 = max(MxR2, a[ptr_mx]), qtd[ptr_mx - MxR2 + maxn]--; } int main() { int n; scanf( %d , &n); for (int i = 0, x, y; i < n; i++) scanf( %d %d , &x, &y), a[x] = y; solve(1, n); printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; int a[300005]; int b[300005]; int flag; int main() { int n, m; cin >> n >> m; int i = 0, j = 0; for (i = 0; i < m; i++) { cin >> a[i]; cin >> b[i]; j++; } int hh = a[0], ff = b[0]; int cc, fff; int temp = 0; for (int i = 0; i < m; i++) { if (a[i] == hh || b[i] == ff || a[i] == ff || b[i] == hh) continue; else { temp = 1; cc = a[i]; fff = b[i]; break; } } if (temp == 0) { printf( YES ); return 0; } int sum = 0; for (int i = 0; i < m; i++) { if ((a[i] != hh && b[i] != hh) && (a[i] != cc && b[i] != cc)) sum++; } if (sum == 0) { printf( YES ); return 0; } sum = 0; for (int i = 0; i < m; i++) { if ((a[i] != hh && b[i] != hh) && (a[i] != fff && b[i] != fff)) sum++; } if (sum == 0) { printf( YES ); return 0; } sum = 0; for (int i = 0; i < m; i++) { if ((a[i] != ff && b[i] != ff) && (a[i] != cc && b[i] != cc)) sum++; } if (sum == 0) { printf( YES ); return 0; } sum = 0; for (int i = 0; i < m; i++) { if ((a[i] != ff && b[i] != ff) && (a[i] != fff && b[i] != fff)) sum++; } if (sum == 0) { printf( YES ); return 0; } if (sum != 0) printf( NO ); } |
#include <bits/stdc++.h> using namespace std; bool SR(int &x) { return scanf( %d , &x) == 1; } bool SR(long long &x) { return scanf( %lld , &x) == 1; } bool SR(double &x) { return scanf( %lf , &x) == 1; } bool SR(char *s) { return scanf( %s , s) == 1; } bool RI() { return true; } template <typename I, typename... T> bool RI(I &x, T &...tail) { return SR(x) && RI(tail...); } void SP(const int x) { printf( %d , x); } void SP(const long long x) { printf( %lld , x); } void SP(const double x) { printf( %.16lf , x); } void SP(const char *s) { printf( %s , s); } void PL() { puts( ); } template <typename I, typename... T> void PL(const I x, const T... tail) { SP(x); if (sizeof...(tail)) putchar( ); PL(tail...); } const int maxn = 3e5 + 5; int n, m, k; vector<int> edge[maxn]; vector<int> vol; int src, tar; void read() { RI(n, m, k); vol.resize(k); for (int i = 0; i < int(k); i++) RI(vol[i]); for (int i = (1); i <= int(m); i++) { int a, b; RI(a, b); edge[a].push_back(n + i); edge[n + i].push_back(a); edge[b].push_back(n + i); edge[n + i].push_back(b); } RI(src, tar); } struct Dsu { int par[maxn]; void init() { for (int i = (1); i <= int(n); i++) par[i] = i; } int find(int x) { return x == par[x] ? x : par[x] = find(par[x]); } void merge(int a, int b) { par[find(a)] = find(b); } } dsu; void build() { n += m; dsu.init(); if (find((vol).begin(), (vol).end(), tar) == vol.end()) vol.push_back(tar), k++; } bitset<maxn> vis; void sol() { vector<int> prv, cur; cur = vol; for (int ans = (1); ans <= int(maxn); ans++) { prv.swap(cur); cur.clear(); for (auto u : prv) if (!vis[u]) { vis[u] = 1; for (auto v : edge[u]) dsu.merge(u, v); cur.insert(cur.end(), (edge[u]).begin(), (edge[u]).end()); } if (dsu.find(src) == dsu.find(tar)) { PL(ans); return; } } PL(-1); } int main() { read(); build(); sol(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { long long n, m; long long result = 0; cin >> n >> m; if (n > m) { swap(n, m); } for (long long i = 1; i <= n; i++) { if (i + m < 5) continue; int r = 5 - (i % 5); result++; result += (m - r) / 5; } cout << result << endl; } |
#include <bits/stdc++.h> using namespace std; double C[55][55], dp[55][55][55]; int a[55], n, m; double dfs(int i, int j, int k) { if (dp[i][j][k] != -1.0) return dp[i][j][k]; double ret = 0; for (int c = 0; c <= i; c++) { int maxq = max(k, int((c + a[j] - 1) / a[j])); ret += dfs(i - c, j - 1, maxq) * C[i][c] * pow(j - 1, i - c) / pow(j, i); } return dp[i][j][k] = ret; } int main() { int i, j, k, maxq; memset(C, 0, sizeof(C)); C[0][0] = 1; for (i = 1; i <= 50; i++) { C[i][0] = 1; for (j = 1; j <= i; j++) { C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; } } while (cin >> n >> m) { for (i = 1; i <= m; i++) scanf( %d , &a[i]); for (i = 0; i <= 50; i++) for (j = 0; j <= 50; j++) for (k = 0; k <= 50; k++) dp[i][j][k] = -1.0; for (i = 0; i <= n; i++) { dp[0][0][i] = i; for (k = 0; k <= 50; k++) dp[i][0][k] = 0; } printf( %.12f n , dfs(n, m, 0)); } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 200005; int visited[MAX]; int a[MAX], dis[MAX]; int n; void bfs() { queue<int> q; int b; visited[1] = 1; dis[1] = 0; q.push(1); while (!q.empty()) { b = q.front(); q.pop(); if (!visited[b + 1] && b + 1 <= n) { visited[b + 1] = 1; dis[b + 1] = dis[b] + 1; q.push(b + 1); } if (!visited[b - 1] && b - 1 > 0) { visited[b - 1] = 1; dis[b - 1] = dis[b] + 1; q.push(b - 1); } if (!visited[a[b]]) { visited[a[b]] = 1; dis[a[b]] = dis[b] + 1; q.push(a[b]); } } } int main() { while (cin >> n) { for (int i = 1; i <= n; i++) { cin >> a[i]; } memset(visited, 0, sizeof(visited)); bfs(); for (int i = 1; i <= n; i++) { if (i == 1) cout << dis[i]; else cout << << dis[i]; } cout << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long int gcd(long long int A, long long int B) { if (!B) return A; return gcd(B, A % B); } int main() { int n; string s; cin >> n >> s; vector<int> pbal(n + 2), sbal(n + 2); vector<bool> pref(n + 1, 1), suff(n + 1, 1); for (int i = 1; i <= n; i++) { if (s[i - 1] == ( ) pbal[i]++; else pbal[i]--; pbal[i] += pbal[i - 1]; if (pref[i - 1] && pbal[i] >= 0) pref[i] = 1; else pref[i] = 0; } for (int i = n; i > 0; i--) { if (s[i - 1] == ) ) sbal[i]--; else sbal[i]++; sbal[i] += sbal[i + 1]; if (suff[i + 1] && sbal[i] <= 0) suff[i] = 1; else suff[i] = 0; } int ans = 0; for (int i = 1; i <= n; i++) { if (!pref[i - 1] || !suff[i + 1]) continue; else { if (s[i - 1] == ( ) { if (pbal[i - 1] > 0 && pbal[i - 1] - 1 + sbal[i + 1] == 0) ans++; } else { if (sbal[i + 1] < 0 && pbal[i - 1] + 1 + sbal[i + 1] == 0) ans++; } } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int level[10]; int loyal[10]; int n, A; double calculate(int cur, int pass, int B, double rate) { double sum; if (cur == n) { if (pass > n / 2) { return rate; } else return rate * (double(A) / (double)(A + B)); } sum = 0; sum = sum + calculate(cur + 1, pass, B + level[cur], (rate * (double(100 - loyal[cur])) / 100.0)); sum = sum + calculate(cur + 1, pass + 1, B, (rate * double(loyal[cur])) / 100.0); return sum; } double dfs(int cur, int k) { if (k == 0) { return calculate(0, 0, 0, 1.0); } if (cur == n) return calculate(0, 0, 0, 1.0); double a = 0.0; double temp; int ori = loyal[cur]; while (loyal[cur] <= 100 && k >= 0) { temp = dfs(cur + 1, k); if (temp > a) a = temp; loyal[cur] = loyal[cur] + 10; k--; } loyal[cur] = ori; return a; } int main() { int k, i; scanf( %d%d%d , &n, &k, &A); for (i = 0; i < n; i++) { scanf( %d%d , &level[i], &loyal[i]); } printf( %.10lf n , dfs(0, k)); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.