func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const long long M = 998244353; long long power(long long a, long long b, long long m) { long long res = 1; a %= m; while (b) { if (b & 1LL) res = res * a % m; a = a * a % m; b >>= 1; } return res; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, m, k; cin >> n >> m >> k; m = power(m, M - 2, M); vector<vector<long long>> dp(k + 1, vector<long long>(k + 1, 0)); for (long long i = 0; i <= k; ++i) { for (long long j = 0; j <= k; ++j) { long long N = n - k + i, K = j; if (N <= 0 || K == 0) { dp[i][j] = 0; continue; } if (K == 1) { dp[i][j] = N * m % M; continue; } if (i > 0) dp[i][j] = (dp[i][j - 1] - dp[i - 1][j - 1] * (1 - m + M) % M + M) % M * N % M; } } cout << dp[k][k] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> T min_(T a, T b) { return (a < b ? a : b); } template <class T> T max_(T a, T b) { return (a > b ? a : b); } const int MAX_N = 1e5 + 1; vector<pair<unsigned long long, unsigned long long> > notes; int main(int argc, char *argv[]) { std::ios::sync_with_stdio(false); cin.tie(0); int days, nnotes; cin >> days >> nnotes; notes.resize(nnotes); int day, h; int max_h = 0; for (int i = 0; i < nnotes; ++i) { cin >> day >> h; max_h = max(max_h, h); notes[i] = {day, h}; } int new_h; int day1, day2, h1, h2; day1 = notes[0].first; if (day1 != 1) { h1 = notes[0].second; new_h = h1 + day1 - 1; max_h = max(max_h, new_h); } for (int i = 0; i < nnotes; ++i) { day1 = notes[i].first; h1 = notes[i].second; if (i == nnotes - 1) { day2 = days; new_h = h1 + (day2 - day1); max_h = max(max_h, new_h); break; } day2 = notes[i + 1].first; h2 = notes[i + 1].second; int ddiff = day2 - day1; int hdiff = abs(h2 - h1); if (hdiff > ddiff) { cout << IMPOSSIBLE n ; return 0; } else { if (h1 < h2) { day1 = day1 + hdiff; ddiff = day2 - day1; h1 = h2; } else if (h1 > h2) { day2 = day2 - hdiff; ddiff = day2 - day1; h2 = h1; } new_h = h1 + (ddiff / 2); max_h = max(max_h, new_h); } } cout << max_h << n ; return 0; }
|
#include <bits/stdc++.h> const int N = 500054; const double eps = 3e-10; inline void up(double &x, const double y) { x < y ? x = y : 0.; } inline void down(double &x, const double y) { x > y ? x = y : 0.; } inline double max(const double x, const double y) { return x < y ? y : x; } struct quadratic { double A, B, C; quadratic(double A_ = 0., double B_ = 0., double C_ = 0.) : A(A_), B(B_), C(C_) {} inline double operator()(double x) const { return (A * x + B) * x + C; } inline std::pair<double, double> root(double y) const { if ((((A) <= (0) + eps) && ((A) >= (0) - eps))) return std::pair<double, double>((y - C) / B, NAN); double b = -.5 * B / A, d = b * b + (y - C) / A; return ((d) < (0) - eps) ? std::pair<double, double>(NAN, NAN) : (d = sqrt(max(d, 0.)), std::pair<double, double>(b - d, b + d)); } inline std::pair<double, double> range(double x_min, double x_max) const { assert(x_min <= x_max); std::pair<double, double> ret = std::minmax((*this)(x_min), (*this)(x_max)); double mid = -.5 * B / A; if ((((A) <= (0) + eps) && ((A) >= (0) - eps)) || mid < x_min || x_max < mid) ; else mid = (*this)(mid), down(ret.first, mid), up(ret.second, mid); return ret; } }; struct vec2 { double x, y; vec2(double x0 = 0., double y0 = 0.) : x(x0), y(y0) {} vec2 *read() { scanf( %lf%lf , &x, &y); return this; } inline vec2 operator-() const { return vec2(-x, -y); } inline vec2 operator+(const vec2 &B) const { return vec2(x + B.x, y + B.y); } inline vec2 operator-(const vec2 &B) const { return vec2(x - B.x, y - B.y); } inline vec2 operator*(double k) const { return vec2(x * k, y * k); } inline vec2 operator/(double k) const { return *this * (1.0 / k); } inline double operator*(const vec2 &B) const { return x * B.x + y * B.y; } inline double operator^(const vec2 &B) const { return x * B.y - y * B.x; } inline double norm2() const { return x * x + y * y; } inline double norm() const { return sqrt(x * x + y * y); } inline bool operator<(const vec2 &B) const { return ((x) < (B.x) - eps) || ((x) <= (B.x) + eps) && ((y) < (B.y) - eps); } inline bool operator==(const vec2 &B) const { return (((x) <= (B.x) + eps) && ((x) >= (B.x) - eps)) && (((y) <= (B.y) + eps) && ((y) >= (B.y) - eps)); } }; int n, m, sr = 0; vec2 p[N], unit[N]; double C[N], co[N], u; double st[N]; quadratic f[N]; std::pair<double, double> rg[N]; inline int pred(int x) { return (x ? x : n) - 1; } inline int succ(int x) { return ++x == n ? 0 : x; } void append(double len, int i1, double s1, int i2, double s2) { if (s1 < 0) s1 += C[n]; if (s2 < 0) s2 += C[n]; st[sr + 1] = st[sr] + len; vec2 O = (p[i1] + unit[i1] * s1) - (p[i2] + unit[i2] * s2), v = unit[i1] - unit[i2]; f[sr++] = quadratic(v.norm2(), v * O * 2., O.norm2()); } namespace seg { int n; bool danger; std::pair<double, double> a[N]; inline void reset() { n = 0, danger = false; } inline void insert(double L, double R) { assert(L <= R); int Li = L / u, Ri = R / u; L -= Li * u, R -= Ri * u; if (Li == Ri) a[n++] = std::pair<double, double>(L, R); else if (Li + 1 == Ri && L > R) a[n++] = std::pair<double, double>(L, u), a[n++] = std::pair<double, double>(0, R); else danger = true; } bool exist() { if (danger) return false; int i; double k = 0; std::sort(a, a + n); for (i = 0; i < n; ++i) { if (k < a[i].first) return true; up(k, a[i].second); } return ((k) < (u)-eps); } } // namespace seg inline bool check(double lim) { int i; double L, R, x1, x2; seg::reset(); for (i = 0; i < sr; ++i) { if (L = st[i], R = st[i + 1], (((L) <= (R) + eps) && ((L) >= (R)-eps))) continue; if (lim <= rg[i].first) seg::insert(L, R); else if (lim < rg[i].second) { std::tie(x1, x2) = f[i].root(lim), x1 += L, x2 += L; if (!(L <= x1 && x1 <= R)) std::swap(x1, x2); if (L <= x2 && x2 <= R) f[i].C >= lim ? seg::insert(L, x1), seg::insert(x2, R) : seg::insert(x1, x2); else f[i].C >= lim ? seg::insert(L, x1) : seg::insert(x1, R); } } return seg::exist(); } int main() { int i, j; double L, R, M; scanf( %d%d , &n, &m); for (i = 0; i < n; ++i) p[i].read(); p[n] = *p; for (i = 0; i < n; ++i) L = (p[i] - p[i + 1]).norm(), C[i + 1] = C[i] + L, unit[i] = (p[i + 1] - p[i]) / L; u = C[n] / m; for (i = 0; i < n; ++i) co[i] = fmod(C[i] + C[n] - u, C[n]); j = pred(std::min_element(co, co + n) - co); for (i = 0; i < n; ++i) { for (L = C[i]; C[i] <= co[succ(j)] && co[succ(j)] < C[i + 1]; j = succ(j), L = co[j]) append(co[succ(j)] - L, i, L - C[i], j, L - co[j]); append(C[i + 1] - L, i, L - C[i], j, L - co[j]); } for (i = 0; i < sr; ++i) rg[i] = f[i].range(0, st[i + 1] - st[i]); { vec2 *_1, *_2; std::tie(_1, _2) = std::minmax_element(p, p + n), R = (*_1 - *_2).norm(); } for (L = 0.; L + eps < R;) M = (L + R) * .5, check(M * M) ? R = M : L = M; printf( %.10lg n , (L + R) * .5); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<pair<int, int>> ans; for (int c = 1; c < k; c++) { int r = 0; int C = c; while (ans.size() < n) { ans.emplace_back(r + 1, C + 1); if (C == k - 1) break; r++, C++; } r = k - 1; C = k - c - 1; while (ans.size() < n) { ans.emplace_back(r + 1, C + 1); if (C == 0) break; r--, C--; } } if (ans.size() != n) { cout << NO << endl; return (0); } cout << YES << endl; for (auto pp : ans) cout << pp.first << << pp.second << n ; return (0); }
|
#include <bits/stdc++.h> using namespace std; struct str { int q, cost; str(int _q = 0, int _cost = 0) { q = _q; cost = _cost; } bool operator<(const str &two) const { return cost > two.cost; } }; struct edge { int u, v, cost; edge(int _u = 0, int _v = 0, int _cost = 0) { u = _u, v = _v, cost = _cost; } }; vector<str> adj[(100000 + 10)]; int n, m, s; int len; int u, v, cost; int dis[(100000 + 10)]; vector<edge> all; int main() { cin >> n >> m >> s; for (int i = 0; i < m; i++) { cin >> u >> v >> cost; all.push_back(edge(u, v, cost)); adj[u].push_back(str(v, cost)); adj[v].push_back(str(u, cost)); } cin >> len; for (int i = 1; i <= n; i++) dis[i] = 1000000000; dis[s] = 0; priority_queue<str> pq; pq.push(str(s, 0)); while (!pq.empty()) { str v = pq.top(); pq.pop(); int node = v.q; for (int i = 0; i < adj[node].size(); i++) { int u = adj[node][i].q; int cost = adj[node][i].cost; if (dis[node] + cost < dis[u]) { dis[u] = dis[node] + cost; pq.push(str(u, dis[u])); } } } int out = 0; for (int i = 1; i <= n; i++) if (dis[i] == len) out++; int one, two; for (int i = 0; i < all.size(); i++) { u = all[i].u; v = all[i].v; cost = all[i].cost; if (dis[u] < len && len < dis[u] + cost && cost - (len - dis[u]) + dis[v] > len) out++; if (dis[v] < len && len < dis[v] + cost && cost - (len - dis[v]) + dis[u] > len) out++; if (dis[v] < len && dis[u] < len && dis[u] + dis[v] + cost == 2 * len) out++; } cout << out << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1}; int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1}; int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1}; const long long oo = 1e18; const long long maxN = 1e6; const int N = 105; long long a[N]; void solve() { int n; long long h; cin >> n >> h; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + 1 + n); auto ok = [&](long long x) -> bool { long long ans = 0; for (int i = 1; i <= n; i++) { if (i < n) ans += min(a[i + 1] - a[i], x); else ans += x; if (ans >= h) return true; } return false; }; long long L = 1, R = h, ans = 0; while (L <= R) { long long mid = (L + R) >> 1; if (ok(mid)) { ans = mid; R = mid - 1; } else L = mid + 1; } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1, ddd = 0; cin >> tc; while (tc--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; long long int arr[500005], sum[500005]; bool vis[100005]; map<long long int, long long int> hola; map<pair<long long int, long long int>, long long int> con; vector<pair<long long int, long long int>> conn; int main() { long long int n, maxi = INT_MIN; cin >> n; for (long long int i = 0; i < n; i++) { cin >> arr[i]; hola[arr[i]]++; } for (long long int i = 0; i < n; i++) { if (hola[arr[i]] > maxi) maxi = hola[arr[i]]; } cout << maxi; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 1000000000; const int MAX = 5000; const int MOD = 1000000007; int C[MAX][MAX]; int CL[MAX]; int main() { int n; cin >> n; C[0][0] = 1; for (int i = (1); i < (n + 1); ++i) { C[i][0] = 1; for (int j = (1); j < (n + 1); ++j) { C[i][j] = C[i - 1][j] + C[i - 1][j - 1]; if (C[i][j] >= MOD) C[i][j] -= MOD; } } CL[0] = 1; for (int i = (1); i < (n + 1); ++i) { CL[i] = 0; for (int j = (1); j < (i + 1); ++j) { long long c = C[i - 1][j - 1]; c *= CL[i - j]; c %= MOD; CL[i] += c; if (CL[i] >= MOD) CL[i] -= MOD; } } long long res = 0; for (int i = (1); i < (n + 1); ++i) { long long c = C[n][i]; int m = n - i; c *= CL[m]; c %= MOD; res += c; if (res >= MOD) res -= MOD; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1E-8; const int dx4[4] = {1, 0, 0, -1}; const int dy4[4] = {0, -1, 1, 0}; const int inf = 0x3f3f3f3f; const int N = 2E5 + 7; int tree[2][N]; int a[N], p[N]; int n; long long k; int lowbit(int x) { return x & (-x); } void update(int o, int x, int delta) { if (!o) x = n - x + 1; for (int i = x; i <= n; i += lowbit(i)) tree[o][i] += delta; } int Hash(int x) { return lower_bound(p + 1, p + n + 1, x) - p; } int Sum(int o, int x) { if (!o) x = n - x + 1; int res = 0; for (int i = x; i >= 1; i -= lowbit(i)) res += tree[o][i]; return res; } int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i], p[i] = a[i]; sort(p + 1, p + n + 1); long long total = 0; for (int i = n; i >= 1; i--) { int x = Hash(a[i]); a[i] = x; total += Sum(1, a[i] - 1); update(1, a[i], 1); } int r = 1; long long ans = 0; for (int l = 1; l <= n; l++) { total += Sum(0, a[l] + 1) + Sum(1, a[l] - 1); update(0, a[l], 1); while ((r <= l || total > k) && r <= n) { total -= Sum(0, a[r] + 1) + Sum(1, a[r] - 1); update(1, a[r], -1); r++; } ans += n - r + 1; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 25, M = 300005; int n, a[N][N]; long long f[M], g[N][M], d[N][M], dp[N][M]; map<long long, long long> mp; string st; inline int bp(int x) { return __builtin_popcount(x); } void dfs(int p, int s, int x, long long m) { if (s == n) { long long w = 0; for (int i = 0; i < (1 << n); i++) { if ((n + bp(i)) & 1) w -= d[x][i]; else w += d[x][i]; } mp[m] = w; return; } if (s + p > n) return; for (int i = 0; i < (1 << n); i++) d[x + 1][i] = d[x][i] * g[p][i]; dfs(p, s + p, x + 1, m * 10 + p); dfs(p + 1, s, x, m); } long long ch(int x) { vector<int> v; int s = 0; for (int i = 0; i < n; i++) { if (x >> i & 1) s++; else { v.push_back(s + 1); s = 0; } } sort(v.begin(), v.end()); long long y = 0; for (auto i : v) y = y * 10 + i; return y; } int main() { ios::sync_with_stdio(0); cin >> n; for (int i = 0; i < n; i++) { cin >> st; for (int j = 0; j < n; j++) a[i][j] = (st[j] == 1 ); } for (int i = 0; i < n; i++) dp[i][1 << i] = 1; for (int i = 1; i < (1 << n); i++) { for (int j = 0; j < n; j++) { if (dp[j][i]) { g[bp(i)][i] += dp[j][i]; for (int k = 0; k < n; k++) if (!(i >> k & 1) && a[j][k]) dp[k][i | (1 << k)] += dp[j][i]; } } } for (int i = 1; i <= n; i++) for (int j = 0; j < n; j++) for (int s = 0; s < (1 << n); s++) if (s >> j & 1) g[i][s] += g[i][s ^ (1 << j)]; for (int i = 0; i < (1 << n); i++) d[0][i] = 1; dfs(1, 0, 0, 0); for (int i = 0; i < (1 << (n - 1)); i++) f[i] = mp[ch(i)]; for (int i = 0; i < n - 1; i++) for (int j = 0; j < (1 << (n - 1)); j++) if (!(j >> i & 1)) f[j] -= f[j ^ (1 << i)]; for (int i = 0; i < (1 << (n - 1)); i++) printf( %lld , f[i]); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long INF = 1000LL * 1000 * 1000 * 1000 * 1000 * 1000; const int inf = 1000 * 1000 * 1000; const long double PI = acos(-1.0); const long long mod1 = inf + 7; const long long mod2 = inf + 9; const int MAXN = 1000005; const long double EPS = 1e-11; int hp = 179; int invert(bool a) { return ((a & 1) + 1) & 1; } vector<vector<int>> bfst(vector<bool> &a) { vector<bool> x; for (int i = a.size() - 6; i < a.size(); ++i) { x.push_back(a[i]); } if (x == vector<bool>{0, 0, 00, 00, 0, 0}) { return {{}}; } if (x == vector<bool>{1, 0, 0, 0, 0, 0}) { return {{2, 4, 6}}; } if (x == vector<bool>{0, 0, 0, 0, 0, 1}) { return {{5, 8, 11}, {2, 5, 8}}; } if (x == vector<bool>{0, 0, 0, 0, 1, 0}) { return {{4, 7, 10}, {3, 5, 7}}; } if (x == vector<bool>{0, 0, 0, 0, 1, 1}) { return {{4, 7, 10}, {3, 7, 11}}; } if (x == vector<bool>{0, 0, 0, 1, 0, 0}) { return {{5, 7, 9}, {3, 5, 7}}; } if (x == vector<bool>{0, 0, 0, 1, 0, 1}) { return {{7, 9, 11}, {3, 5, 7}}; } if (x == vector<bool>{0, 0, 0, 1, 1, 0}) { return {{10, 8, 9}, {2, 5, 8}}; } if (x == vector<bool>{0, 0, 0, 1, 1, 1}) { return {{11, 9, 10}}; } if (x == vector<bool>{1, 1, 0, 1, 1, 1}) { return {{11, 9, 10}, {5, 7, 6}}; } if (x == vector<bool>{1, 1, 1, 1, 1, 1}) { return {{6, 7, 8}, {11, 9, 10}}; } if (x == vector<bool>{0, 0, 1, 0, 0, 0}) { return {{8, 5, 2}}; } if (x == vector<bool>{0, 0, 1, 0, 0, 1}) { return {{5, 8, 11}}; } if (x == vector<bool>{0, 0, 1, 0, 1, 0}) { return {{6, 8, 10}, {4, 5, 6}}; } if (x == vector<bool>{0, 0, 1, 0, 1, 1}) { return {{5, 8, 11}, {10, 5, 0}}; } if (x == vector<bool>{0, 0, 1, 1, 0, 0}) { return {{7, 8, 9}, {3, 5, 7}}; } if (x == vector<bool>{0, 0, 1, 1, 0, 1}) { return {{5, 8, 11}, {1, 5, 9}}; } if (x == vector<bool>{0, 0, 1, 1, 1, 0}) { return {{10, 9, 8}}; } if (x == vector<bool>{0, 0, 1, 1, 1, 1}) { return {{9, 10, 11}, {8, 5, 2}}; } if (x == vector<bool>{0, 1, 0, 0, 0, 0}) { return {{3, 5, 7}}; } if (x == vector<bool>{0, 1, 0, 0, 0, 1}) { return {{3, 7, 11}}; } if (x == vector<bool>{0, 1, 0, 0, 1, 0}) { return {{4, 7, 10}}; } if (x == vector<bool>{0, 1, 0, 0, 1, 1}) { return {{9, 10, 11}, {5, 7, 9}}; } if (x == vector<bool>{0, 1, 0, 1, 0, 0}) { return {{5, 7, 9}}; } if (x == vector<bool>{0, 1, 0, 1, 0, 1}) { return {{7, 9, 11}}; } if (x == vector<bool>{0, 1, 0, 1, 1, 0}) { return {{4, 7, 10}, {1, 5, 9}}; } if (x == vector<bool>{0, 1, 0, 1, 1, 1}) { return {{9, 10, 11}, {3, 5, 7}}; } if (x == vector<bool>{0, 1, 1, 0, 0, 0}) { return {{6, 7, 8}, {4, 5, 6}}; } if (x == vector<bool>{0, 1, 1, 0, 0, 1}) { return {{5, 8, 11}, {3, 5, 7}}; } if (x == vector<bool>{0, 1, 1, 0, 1, 0}) { return {{6, 8, 10}, {5, 6, 7}}; } if (x == vector<bool>{0, 1, 1, 0, 1, 1}) { return {{9, 10, 11}, {7, 8, 9}}; } if (x == vector<bool>{0, 1, 1, 1, 0, 0}) { return {{7, 8, 9}}; } if (x == vector<bool>{0, 1, 1, 1, 0, 1}) { return {{7, 9, 11}, {2, 5, 8}}; } if (x == vector<bool>{0, 1, 1, 1, 1, 0}) { return {{8, 9, 10}, {3, 5, 7}}; } if (x == vector<bool>{0, 1, 1, 1, 1, 1}) { return {{3, 7, 11}, {8, 9, 10}}; } if (x == vector<bool>{1, 0, 0, 0, 0, 1}) { return {{1, 6, 11}}; } if (x == vector<bool>{1, 0, 0, 0, 1, 0}) { return {{2, 6, 10}}; } if (x == vector<bool>{1, 0, 0, 0, 1, 1}) { return {{9, 10, 11}, {3, 6, 9}}; } if (x == vector<bool>{1, 0, 0, 1, 0, 0}) { return {{3, 6, 9}}; } if (x == vector<bool>{1, 0, 0, 1, 0, 1}) { return {{7, 9, 11}, {5, 6, 7}}; } if (x == vector<bool>{1, 0, 0, 1, 1, 0}) { return {{8, 9, 10}, {4, 6, 8}}; } if (x == vector<bool>{1, 0, 0, 1, 1, 1}) { return {{9, 10, 11}, {4, 5, 6}}; } if (x == vector<bool>{1, 0, 1, 0, 0, 0}) { return {{4, 6, 8}}; } if (x == vector<bool>{1, 0, 1, 0, 0, 1}) { return {{5, 8, 11}, {4, 5, 6}}; } if (x == vector<bool>{1, 0, 1, 0, 1, 0}) { return {{6, 8, 10}}; } if (x == vector<bool>{1, 0, 1, 0, 1, 1}) { return {{5, 8, 11}, {2, 6, 10}}; } if (x == vector<bool>{1, 0, 1, 1, 0, 0}) { return {{4, 6, 8}, {1, 5, 9}}; } if (x == vector<bool>{1, 0, 1, 1, 0, 1}) { return {{7, 9, 11}, {6, 7, 8}}; } if (x == vector<bool>{1, 0, 1, 1, 1, 0}) { return {{8, 9, 10}, {4, 5, 6}}; } if (x == vector<bool>{1, 0, 1, 1, 1, 1}) { return {{9, 10, 11}, {4, 6, 8}}; } if (x == vector<bool>{1, 1, 0, 0, 0, 0}) { return {{5, 6, 7}}; } if (x == vector<bool>{1, 1, 0, 0, 0, 1}) { return {{3, 7, 11}, {4, 5, 6}}; } if (x == vector<bool>{1, 1, 0, 0, 1, 0}) { return {{4, 7, 10}, {4, 5, 6}}; } if (x == vector<bool>{1, 1, 0, 0, 1, 1}) { return {{3, 7, 11}, {2, 6, 10}}; } if (x == vector<bool>{1, 1, 0, 1, 0, 0}) { return {{5, 7, 9}, {4, 5, 6}}; } if (x == vector<bool>{1, 1, 0, 1, 0, 1}) { return {{7, 9, 11}, {4, 5, 6}}; } if (x == vector<bool>{1, 1, 0, 1, 1, 0}) { return {{3, 6, 9}, {4, 7, 10}}; } if (x == vector<bool>{1, 1, 0, 1, 1, 1}) { return {{9, 10, 11}, {5, 6, 7}}; } if (x == vector<bool>{1, 1, 1, 0, 0, 0}) { return {{6, 7, 8}}; } if (x == vector<bool>{1, 1, 1, 0, 0, 1}) { return {{5, 8, 11}, {5, 6, 7}}; } if (x == vector<bool>{1, 1, 1, 0, 1, 0}) { return {{6, 8, 10}, {3, 5, 7}}; } if (x == vector<bool>{1, 1, 1, 0, 1, 1}) { return {{6, 8, 10}, {3, 7, 11}}; } if (x == vector<bool>{1, 1, 1, 1, 0, 0}) { return {{7, 8, 9}, {4, 5, 6}}; } if (x == vector<bool>{1, 1, 1, 1, 0, 1}) { return {{7, 9, 11}, {4, 6, 8}}; } if (x == vector<bool>{1, 1, 1, 1, 1, 0}) { return {{5, 6, 7}, {8, 9, 10}}; } assert(false); } signed main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); ; int n; cin >> n; vector<bool> a(n); for (int i = 0; i < n; ++i) { int x; cin >> x; if (x) a[i] = 1; } if (n < 13) { map<vector<bool>, int> d; map<vector<bool>, vector<int>> p; map<vector<bool>, int> used; d[a] = 0; used[a] = 1; queue<vector<bool>> q; q.push(a); while (q.size()) { vector<bool> v = q.front(); q.pop(); for (int lg = 1; 2 * lg < n; ++lg) { for (int i = 0; i + 2 * lg < n; ++i) { vector<bool> t = v; t[i] = invert(t[i]); t[i + lg] = invert(t[i + lg]); t[i + 2 * lg] = invert(t[i + 2 * lg]); if (!used[t]) { used[t] = 1; d[t] = d[v] + 1; p[t] = {i, i + lg, i + 2 * lg}; q.push(t); } } } } vector<bool> x = a; for (int i = 0; i < n; ++i) { x[i] = 0; } if (used[x] == 0) { cout << NO ; return 0; } cout << YES << endl; vector<vector<int>> ans; while (x != a) { ans.push_back(p[x]); vector<int> pp = p[x]; for (int i = 0; i < 3; ++i) { x[pp[i]] = invert(x[pp[i]]); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) { for (int j = 0; j < 3; ++j) { cout << ans[i][j] + 1 << ; } cout << endl; } return 0; } int k = n - 1; vector<vector<int>> ans; while (k >= 13) { vector<bool> help; for (int i = k - 11; i < k + 1; ++i) { help.push_back(a[i]); } auto xx = bfst(help); vector<bool> tmp = vector<bool>(a.begin() + k - 11, a.begin() + k + 1); if (xx.size() == 1 && xx[0].size() == 0) { k -= 6; continue; } for (vector<int> i : xx) { ans.push_back({i[0] + k - 11, i[1] + k - 11, i[2] + k - 11}); tmp[i[0]] = invert(tmp[i[0]]); tmp[i[1]] = invert(tmp[i[1]]); tmp[i[2]] = invert(tmp[i[2]]); } for (int i = k - 11; i < k + 1; ++i) { a[i] = tmp[i + 11 - k]; } k -= 6; } map<vector<bool>, int> d; map<vector<bool>, vector<int>> p; map<vector<bool>, bool> used; d[vector<bool>(a.begin(), a.begin() + k + 1)] = 0; used[vector<bool>(a.begin(), a.begin() + k + 1)] = 1; queue<vector<bool>> q; q.push(vector<bool>(a.begin(), a.begin() + k + 1)); while (q.size()) { vector<bool> v = q.front(); q.pop(); for (int lg = 1; 2 * lg <= k; ++lg) { for (int i = 0; i + 2 * lg <= k; ++i) { vector<bool> t = v; t[i] = invert(t[i]); t[i + lg] = invert(t[i + lg]); t[i + 2 * lg] = invert(t[i + 2 * lg]); if (!used[t]) { used[t] = 1; d[t] = d[v] + 1; p[t] = {i, i + lg, i + 2 * lg}; q.push(t); } } } } vector<bool> x = vector<bool>(a.begin(), a.begin() + k + 1); for (int i = 0; i <= k; ++i) { x[i] = 0; } cout << YES << endl; while (x != vector<bool>(a.begin(), a.begin() + k + 1)) { ans.push_back(p[x]); vector<int> pp = p[x]; for (int i = 0; i < 3; ++i) { x[pp[i]] = invert(x[pp[i]]); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) { for (int j = 0; j < 3; ++j) { cout << ans[i][j] + 1 << ; } cout << endl; } }
|
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int a[n], i, s = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); s = s + a[i]; } if (s == 0) printf( EASY n ); else printf( HARD n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, t, x, y, ed, pt, bcc, done, cnt, cycl; int qd[400005], qn[400005], l[400005], v[400005], w[400005], vv[400005], d[400005], AP[400005], p[400005], vis[400005]; int col[400005], par[400005], L[400005], C[400005], cc[400005], vc[400005], pp[400005]; vector<int> P; void bd(int x, int y) { qd[++ed] = y, qn[ed] = l[x], l[x] = ed; } void dfs(int x, int y) { int c = 0; v[x] = w[x] = ++t; p[x] = y; for (int i = l[x]; i; i = qn[i]) if (!v[qd[i]]) { dfs(qd[i], x); w[x] = min(w[x], w[qd[i]]); ++c; if ((y >= 0 && w[qd[i]] >= v[x]) || (y < 0 && c > 1)) AP[x] = 1; } else if (qd[i] != y) w[x] = min(w[x], v[qd[i]]); } void color(int x, int y) { vis[x] = 1; for (int i = l[x]; i; i = qn[i]) { if (col[i ^ 1]) continue; if (p[x] == -1 || (AP[x] && w[qd[i]] >= v[x])) { col[i] = col[i ^ 1] = ++bcc; color(qd[i], bcc); } else { col[i] = col[i ^ 1] = y; if (!vis[qd[i]]) color(qd[i], y); } } } void cyc(int x, int p) { vv[x] = 1; par[x] = p; for (int i = (l[x]); i; i = qn[i]) if (qd[i] != p) { if (!vv[qd[i]]) cyc(qd[i], x); else if (vv[qd[i]] == 1 && !cycl) { int t = x; while (1) { C[cycl++] = t; cc[t] = 1; if (t == qd[i]) break; t = par[t]; } } } vv[x] = 2; } void shoot(int x, int p) { if (done) return; vc[x] = 1; pp[x] = p; for (int i = (l[x]); i; i = qn[i]) if (!vc[qd[i]] && !done) { if (p == -1 && cc[qd[i]]) continue; if (cc[qd[i]]) { done = 1; pp[qd[i]] = x; pt = qd[i]; } else shoot(qd[i], x); } } void print() { printf( %d , P.size()); for (int i = (0); i < (P.size()); i++) printf( %d , P[i]); puts( ); } void doit(int y, int j) { P.clear(); for (int k = y; k != j; k = (k + 1 == cycl ? 0 : k + 1)) P.push_back(C[k] + 1); P.push_back(C[j] + 1); print(); P.clear(); for (int k = y; k != j; k = (k == 0 ? cycl - 1 : k - 1)) P.push_back(C[k] + 1); P.push_back(C[j] + 1); print(); } struct edge { int x, y, c; bool operator<(edge const &T) const { return c < T.c; } }; edge E[400005]; int main() { scanf( %d%d , &n, &m); ed = 1; for (int i = (0); i < (m); i++) { scanf( %d%d , &x, &y), --x, --y; bd(x, y), bd(y, x); } for (int i = (0); i < (n); i++) if (!v[i]) dfs(i, -1); for (int i = (0); i < (n); i++) if (!vis[i]) color(i, -1); memset(l, 0, sizeof(l)); for (int i = (2); i <= (ed); i++) { E[i - 2].x = qd[i]; E[i - 2].y = qd[i ^ 1]; E[i - 2].c = col[i]; } int Edges = ed - 1; sort(E, E + Edges); int ptr = 0; for (int bb = (1); bb <= (bcc); bb++) { ed = cnt = 0; while (ptr < Edges && E[ptr].c == bb) { bd(E[ptr].x, E[ptr].y); ++d[E[ptr].x]; L[cnt++] = E[ptr].x; ++ptr; } if (cnt < 4) goto AFTER; cycl = 0; cyc(L[0], -1); for (int j = (0); j < (cycl); j++) if (d[C[j]] > 2) { for (int k = (l[C[j]]); k; k = qn[k]) { int y = qd[k]; if (!cc[y]) continue; if (y == C[(j + 1) % cycl] || y == C[(j + cycl - 1) % cycl]) continue; puts( YES ); printf( 2 %d %d n , y + 1, C[j] + 1); int ty = y; for (int k = (0); k < (cycl); k++) if (C[k] == ty) y = k; doit(y, j); return 0; } done = 0; shoot(C[j], -1); if (done) { puts( YES ); for (int k = (0); k < (cycl); k++) if (C[k] == pt) y = k; doit(y, j); P.clear(); while (1) { P.push_back(pt + 1); if (pt == C[j]) break; pt = pp[pt]; } print(); return 0; } } AFTER: for (int i = (0); i < (cnt); i++) vv[L[i]] = vc[L[i]] = cc[L[i]] = l[L[i]] = d[L[i]] = 0; } puts( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1000 + 10; const int mod = 1e9 + 7; int a[3][6]; int vis[100]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) for (int j = 0; j < 6; j++) cin >> a[i][j]; for (int i = 0; i < n; i++) { for (int k = 0; k < 6; k++) { vis[a[i][k]] = 1; for (int j = 0; j < n; j++) { if (i == j) continue; for (int l = 0; l < 6; l++) { vis[a[i][k] * 10 + a[j][l]] = 1; } } } } for (int i = 1; i < 100; i++) { if (!vis[i]) { cout << i - 1 << endl; break; } } }
|
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long tt = 1; cin >> tt; while (tt--) { string t, s, ans; bool f = 0; cin >> t; long long n = t.size(); vector<long long> a(26), b(26), c(26); for (long long i = n - 1; i >= 0; --i) { if (a[t[i] - a ] == 0) s = t[i] + s; a[t[i] - a ]++; } long long sz = 0; for (long long i = 0; i < s.size(); ++i) { if (a[s[i] - a ] % (i + 1)) { f = 1; break; } b[s[i] - a ] = a[s[i] - a ] / (i + 1); sz += b[s[i] - a ]; } if (!f) { vector<string> st(sz); long long id = 0; for (long long i = 0; i < s.size(); ++i) { st[i] = string(t, id, sz); id += sz, sz -= b[s[i] - a ]; } ans = st[0]; for (long long i = 0; i < st.size() - 1; ++i) { string cnt; for (long long j = 0; j < st[i].size(); ++j) { if (st[i][j] != s[i]) cnt = cnt + st[i][j]; } if (cnt != st[i + 1]) { f = 1; break; } } } if (f) cout << -1 << n ; else cout << ans << << s << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, q, a[int(2e5)], sz; set<pair<int, int> > st; int main() { cin >> n >> k >> q; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < q; ++i) { int x, y; cin >> x >> y; if (x == 1) { st.insert(make_pair(a[y - 1], y)); sz++; if (sz > k) { st.erase(st.begin()); sz--; } } else { if (st.find(make_pair(a[y - 1], y)) != st.end()) { cout << YES n ; } else { cout << NO n ; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { return a > b ? a : b; } long long min(long long a, long long b) { return a < b ? a : b; } double max(double a, double b) { return a > b ? a : b; } double min(double a, double b) { return a < b ? a : b; } long long modd(long long a) { if (a < 0LL) return a * -1LL; return a; } double modd(double a) { if (a < 0.0) return a * -1.0; return a; } long long modulo(long long a) { return a % 1000000007LL; } long long power(long long k, long long p) { if (p == 0) return 1LL; long long P = power(k, p / 2LL); P = (P * P) % 1000000007LL; if (p % 2 == 1) P = (P * k) % 1000000007LL; return P; } struct p_str { long long val, idx; char ch; }; bool comp(p_str& a, p_str& b) { return a.val < b.val; } void solve() { string s; cin >> s; long long m; cin >> m; long long b[m]; for (long long i = 0; i < m; i++) { cin >> b[i]; } long long cnt[26]; memset(cnt, 0, sizeof(cnt)); for (long long i = 0; i < s.length(); i++) { cnt[s[i] - a ]++; } char t[m]; long long i_cnt = 26; while (1) { bool f = 1; long long mn_i = -1; for (long long i = 0; i < m; i++) { if (b[i] == 0) { mn_i = i; f = 0; break; } } if (f) { break; } vector<long long> zero_pos; for (long long i = 0; i < m; i++) { if (b[i] == 0) { zero_pos.push_back(i); } } long long c = zero_pos.size(); i_cnt--; while (i_cnt >= 0 && cnt[i_cnt] < c) { i_cnt--; } for (long long i = 0; i < zero_pos.size(); i++) { t[zero_pos[i]] = (char)(i_cnt + a ); } for (long long j = 0; j < zero_pos.size(); j++) { long long pos = zero_pos[j]; for (long long i = 0; i < m; i++) { if (b[i] > 0) { b[i] -= modd(i - pos); } } b[pos] = -1; } } for (long long i = 0; i < m; i++) { cout << t[i]; } cout << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[13] = {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334}; int run(int x) { if ((x % 4 == 0 && x % 100 != 0) || (x % 400 == 0)) return 1; else return 0; } int main() { int y1, y2, m1, m2, d1, d2; int i, j; scanf( %d:%d:%d , &y1, &m1, &d1); scanf( %d:%d:%d , &y2, &m2, &d2); int t; if (y1 > y2) { t = y1; y1 = y2; y2 = t; t = m1; m1 = m2; m2 = t; t = d1; d1 = d2; d2 = t; } else if (y1 == y2) { if (m1 > m2) { t = m1; m1 = m2; m2 = t; t = d1; d1 = d2; d2 = t; } else if (m1 == m2) { if (d1 > d2) { t = d1; d1 = d2; d2 = t; } } } int sum = 0; for (i = y1 + 1; i < y2; i++) { if (run(i)) sum += 366; else sum += 365; } int num = a[m1 - 1] + d1; int num2 = a[m2 - 1] + d2; if (y1 != y2) { if (run(y1)) { if (m1 > 2) num = 365 - num; else num = 366 - num; } else num = 365 - num; if (run(y2)) { if (m2 > 2) num2++; } sum += num; sum += num2; } else { if (run(y1)) if (m1 > 2) num++; if (run(y2)) if (m2 > 2) num2++; sum += num2 - num; } cout << sum << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n <= 2) cout << -1 ; else if (n == 3) cout << 210 ; else { int mod = 1; for (int i = 1; i < n; ++i) mod = (mod * 10) % 210; if (n > 3) cout << 1 ; for (int i = 0; i < n - 4; ++i) cout << 0 ; if (210 - mod < 100) cout << 0 ; cout << 210 - mod; } }
|
#include <bits/stdc++.h> using namespace std; void solve() { char a[8][8]; int i, j, c = 0, k, d = 0, e = 1, f = 0; vector<int> v; for (i = 0; i < 8; i++) { for (j = 0; j < 8; j++) { cin >> a[i][j]; } } for (i = 0; i < 8; i++) { d = 0; for (j = 0; j < 8; j++) { if (a[i][j] == W ) { d++; } } if (d == 0) { c++; } else if (d < 8 && d >= 1 && e == 1) { for (j = 0; j < 8; j++) { if (a[i][j] == B ) { v.push_back(j); c++; } } e++; } else if (e > 1) { for (j = 0; j < 8; j++) { if (a[i][j] == B ) { for (k = 0; k < v.size(); k++) { if (v[k] == j) { f = 1; break; } } if (f == 0) { v.push_back(j); c++; } else f = 0; } } } } cout << c << endl; return; } int main() { solve(); }
|
#include <bits/stdc++.h> using namespace std; int cho[30]; char str[1005]; int main() { int a, b, ans = 0; cin >> a >> b; for (int i = 0; i < a; i++) { cin >> str[i]; cho[str[i] - 96]++; } int tot = b; for (int i = 1; i <= 26; i++) { if (tot == 0) { break; } else if (tot != 0 && cho[i] >= 1) { if (cho[i - 1] != -1) { ans += i; tot--; cho[i] = -1; } } } if (tot == 0) cout << ans << endl; else if (tot > 0) cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, ans, tot; int b[200010], rt[200010]; struct nu { int val, id; } a[200010]; char s[200010]; struct node { int ls, rs, sum; } tree[200010 * 20]; inline bool cmp(const nu &x, const nu &y) { if (x.val == y.val) return x.id < y.id; else return x.val > y.val; } inline void insert(int num, int &x, int l, int r) { tree[++tot] = tree[x]; x = tot; ++tree[x].sum; if (l == r) return; int mid = (l + r) >> 1; if (num <= mid) insert(num, tree[x].ls, l, mid); else insert(num, tree[x].rs, mid + 1, r); } inline void prework() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i].val), a[i].id = i, b[i] = a[i].val; sort(a + 1, a + 1 + n, cmp); tot = 0; for (int i = 1; i <= n; i++) { rt[i] = rt[i - 1]; insert(a[i].id, rt[i], 1, n); } } inline int query(int i, int j, int k, int l, int r) { if (l == r) return l; int tp = tree[tree[j].ls].sum - tree[tree[i].ls].sum; int mid = (l + r) >> 1; if (k <= tp) return query(tree[i].ls, tree[j].ls, k, l, mid); else return query(tree[i].rs, tree[j].rs, k - tp, mid + 1, r); } inline void mainwork() { scanf( %d , &m); int k, pos; for (int i = 1; i <= m; i++) { scanf( %d%d , &k, &pos); ans = query(rt[0], rt[k], pos, 1, n); printf( %d n , b[ans]); } } inline void print() {} int main() { int t = 1; for (int i = 1; i <= t; i++) { prework(); mainwork(); print(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[100010], b[100010]; int main() { int t; cin >> t; while (t--) { int n; int flag = 1; long long min = 1e9 + 1; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; if (min > a[i]) min = a[i]; } sort(b, b + n); for (int i = 0; i < n; i++) { if (a[i] != b[i]) { if (a[i] % min != 0) { flag = 0; break; } } } if (flag) cout << YES << endl; else cout << NO << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; set<int> set; scanf( %d , &n); for (int i = 0; i < n; i++) { int put; scanf( %d , &put); set.insert(put); } vector<int> arr(set.size()); copy(set.begin(), set.end(), arr.begin()); sort(arr.begin(), arr.end()); int consq = 0; int iter = arr.size(); for (int i = 1; i < iter; i++) { if (arr[i - 1] == arr[i] - 1) { consq++; } else { consq = 0; } if (consq == 2) { printf( YES n ); return 0; } } printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct _ { int a, b, c, d, id; bool operator<(const _ &ob) const { return b < ob.b; } } a[200010]; struct __ { int val, id; bool operator<(const __ &ob) const { return val < ob.val; } }; struct event { int x, y, depth, id; }; queue<event> q; set<int> ss; multiset<__> s[200010]; _ min_[800010]; int val[200010], tx, ty, n, anss[200010], ans; int fa[200010]; void pushup(int rt) { min_[rt] = min(min_[rt << 1], min_[rt << 1 | 1]); } void update(_ tar, int l, int r, int rt) { if (l == r) { min_[rt] = tar; return; } int m = l + r >> 1; if (tar.a <= m) update(tar, l, m, rt << 1); else update(tar, m + 1, r, rt << 1 | 1); pushup(rt); } _ query(int L, int R, int l, int r, int rt) { if (L <= l && r <= R) return min_[rt]; int m = l + r >> 1; _ ans; ans.b = 1234567890; if (m >= L) ans = min(ans, query(L, R, l, m, rt << 1)); if (m < R) ans = min(ans, query(L, R, m + 1, r, rt << 1 | 1)); return ans; } void bfs(int x, int y, int depth, int id) { if (id == n) { ans = depth; anss[depth] = id; return; } _ t = query(1, x, 1, n << 1, 1); while (t.b <= y) { s[t.a].erase(s[t.a].begin()); if (s[t.a].empty()) update((_){t.a, 1234567890, 0, 0, 0}, 1, n << 1, 1); else update(a[s[t.a].begin()->id - 1], 1, n << 1, 1); q.push((event){t.c, t.d, depth + 1, t.id}); fa[t.id] = id; t = query(1, x, 1, n << 1, 1); } } void bbfs(int x, int y, int depth, int id) { q.push((event){x, y, depth, id}); event t; while (!q.empty()) { t = q.front(); q.pop(); bfs(t.x, t.y, t.depth, t.id); if (ans) return; } } int main() { memset(min_, 63, sizeof(min_)); memset(val, 63, sizeof(val)); scanf( %d , &n); int i; for (i = 0; i < n; i++) { scanf( %d%d%d%d , &a[i].a, &a[i].b, &a[i].c, &a[i].d); ss.insert(a[i].a); ss.insert(a[i].c); } set<int>::iterator it; for (it = ss.begin(), i = 1; it != ss.end(); it++, i++) { val[i] = *it; } for (i = 0; i < n; i++) { a[i].a = lower_bound(val + 1, val + 1 + (n << 1), a[i].a) - val; a[i].c = lower_bound(val + 1, val + 1 + (n << 1), a[i].c) - val; a[i].id = i + 1; } tx = a[n - 1].c; ty = a[n - 1].d; if (*ss.begin()) { printf( -1 n ); return 0; } int t; for (i = 0; i < n; i++) { t = query(a[i].a, a[i].a, 1, n << 1, 1).b; if (a[i].b < t) update(a[i], 1, n << 1, 1); s[a[i].a].insert((__){a[i].b, i + 1}); } bbfs(1, 0, 0, -1); if (!ans) printf( -1 n ); else { for (i = ans; i; i--) { anss[i - 1] = fa[anss[i]]; } printf( %d n , ans); for (i = 1; i <= ans; i++) { printf( %d , anss[i]); } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int seg[800005], lazy[800005]; void push(long long int v) { if (lazy[v] == 0) return; seg[2 * v] |= lazy[v]; seg[2 * v + 1] |= lazy[v]; lazy[2 * v] = lazy[v]; lazy[2 * v + 1] = lazy[v]; lazy[v] = 0; return; } void update(long long int v, long long int tl, long long int tr, long long int l, long long int r, long long int val) { if (tl > r || tr < l) return; push(v); if (tl == l && tr == r) { lazy[v] = val; seg[v] = val; return; } else if (tl >= l && tr <= r) { lazy[v] = val; seg[v] |= val; return; } long long int tm = (tl + tr) / 2; update(2 * v, tl, tm, l, r, val); update(2 * v + 1, tm + 1, tr, l, r, val); seg[v] = (seg[2 * v] & seg[2 * v + 1]); return; } long long int query(long long int v, long long int tl, long long int tr, long long int l, long long int r) { if (tl > r || tr < l) return (1LL << 40) - 1; push(v); if (tl >= l && tr <= r) { return seg[v]; } long long int tm = (tl + tr) / 2; return (query(2 * v, tl, tm, l, r) & query(2 * v + 1, tm + 1, tr, l, r)); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tests = 1; while (tests--) { long long int i, j, n, m; cin >> n >> m; vector<long long int> l(m), r(m), q(m); vector<vector<long long int>> cnt(n + 2, vector<long long int>(31, 0)); for (long long int i = 0; i <= m - 1; i++) { cin >> l[i] >> r[i] >> q[i]; for (long long int j = 0; j <= 30; j++) { if (q[i] & (1 << j)) cnt[l[i]][j]++, cnt[r[i] + 1][j]--; } } for (long long int i = 1; i <= n; i++) { for (long long int j = 0; j <= 30; j++) cnt[i][j] += cnt[i - 1][j]; } for (long long int i = 1; i <= n; i++) { long long int val = 0; for (long long int j = 0; j <= 30; j++) { if (cnt[i][j] > 0) val |= (1 << j); } update(1, 1, n, i, i, val); } bool check = true; for (long long int i = 0; i <= m - 1; i++) { long long int val = query(1, 1, n, l[i], r[i]); if (val != q[i]) { check = false; break; } } if (!check) { cout << NO ; return 0; } cout << YES << n ; for (long long int i = 1; i <= n; i++) { cout << query(1, 1, n, i, i) << ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int nax = 107; int n, m; char wcz[nax][nax]; int oj[nax]; int fin(int v) { if (oj[v] != v) oj[v] = fin(oj[v]); return oj[v]; } void uni(int v, int u) { oj[fin(v)] = fin(u); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , wcz[i] + 1); for (int i = 1; i <= n + m; i++) oj[i] = i; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (wcz[i][j] == # ) uni(i, n + j); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (wcz[i][j] == . && fin(i) == fin(n + j)) { printf( No n ); return 0; } } } printf( Yes n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; long long n, m; long long a[N], ans[N]; set<long long> active; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n; for (long long i = 1; i <= n; i++) { cin >> a[i]; active.insert(i); } cin >> m; while (m--) { long long type; cin >> type; if (type == 1) { long long p, x; cin >> p >> x; auto it = active.lower_bound(p); if (it != active.end()) { long long idx = *it; ans[idx] += x; long long diff = 0; while (idx <= n && ans[idx] >= a[idx]) { diff = ans[idx] - a[idx]; ans[idx + 1] += diff; ans[idx] = a[idx]; active.erase(idx); idx++; } } } else { long long k; cin >> k; cout << ans[k] << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int max_n = 22, inf = 1111111111; int n, m, dp[1 << max_n], a[max_n][max_n], nmask[max_n][max_n], res[max_n][max_n]; string s[max_n]; bool get_bit(int x, int poz) { return (bool)(x & (1 << poz)); } int main() { cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> s[i]; } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> a[i][j]; } } for (int poz = 0; poz < n; ++poz) { for (int i = 0; i < m; ++i) { int mx = 0; for (int j = 0; j < n; ++j) { if (s[poz][i] == s[j][i]) { res[poz][i] += a[j][i]; mx = max(mx, a[j][i]); nmask[poz][i] |= (1 << j); } } res[poz][i] -= mx; } } dp[0] = 0; for (int mask = 1; mask < (1 << n); ++mask) { int poz; for (int i = 0; i < n; ++i) { if (get_bit(mask, i)) { poz = i; } } dp[mask] = inf; for (int i = 0; i < m; ++i) { dp[mask] = min(dp[mask], a[poz][i] + dp[mask ^ (1 << poz)]); dp[mask] = min(dp[mask], res[poz][i] + dp[mask ^ (mask & nmask[poz][i])]); } } cout << dp[(1 << n) - 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1100; int n, a[maxn], ans, t; void go(int lim) { int ret = 0; for (int i = 1; i <= n; i++) ret += min(abs(a[i] - lim), min(abs(a[i] - (lim + 1)), abs(a[i] - (lim - 1)))); if (ret < ans) ans = ret, t = lim; } int main() { scanf( %d , &n); ans = INT_MAX; for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= 100; i++) go(i); printf( %d %d n , t, ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long arr[500005]; long long brr[500005]; long long total[500005]; int n, r; bool fnc(long long mid, long long k) { for (int i = 1; i <= n; i++) brr[i] = 0; long long d = 0; for (int i = 1; i <= n; i++) { d += brr[i]; if (total[i] + d < mid) { long long x = (mid - (total[i] + d)); d += x; int j = min(i + 2 * r + 1, n + 1); brr[j] -= x; k -= x; if (k < 0) return 0; } } return 1; } int main() { long long k; scanf( %d %d %I64d , &n, &r, &k); for (int i = 1; i <= n; i++) scanf( %I64d , &arr[i]); for (int i = 1; i <= n; i++) { if (r == 0) { brr[i] += arr[i]; brr[i + 1] -= arr[i]; } else { int j = max(i - r, 1); brr[j] += arr[i]; j = min(i + r + 1, n + 1); brr[j] -= arr[i]; } } long long d = 0; for (int i = 1; i <= n; i++) { d += brr[i]; total[i] = d; } long long mn = total[1]; for (int i = 2; i <= n; i++) mn = min(total[i], mn); long long l = 0, h = 4000000000000000000; long long ans = mn; while (l <= h) { long long mid = (l + h) / 2; bool flag = fnc(mid, k); if (flag) { ans = mid; l = mid + 1; } else h = mid - 1; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; using cat = long long; struct group { char c; int l, r; group operator+(int x) const { return {c, l + x, r + x}; } group operator-(int x) const { return {c, l - x, r - x}; } }; void apply(vector<group>& gA, vector<group>& gB, int prefA, int prefB, vector<group>& gA_nw, vector<group>& gB_nw) { for (int i = 0; i < prefA; i++) gB_nw.push_back(gA[i]); for (int i = 0; i < prefB; i++) gA_nw.push_back(gB[i]); if (gB_nw.empty() || gB_nw.back().c != gB[prefB].c) { int dl = -gB[prefB].l + (gB_nw.empty() ? 0 : gB_nw.back().r); for (int i = prefB; i < (int)gB.size(); i++) gB_nw.push_back(gB[i] + dl); } else { gB_nw.back().r += gB[prefB].r - gB[prefB].l; if (prefB + 1 < (int)gB.size()) { int dl = -gB[prefB + 1].l + gB_nw.back().r; for (int i = prefB + 1; i < (int)gB.size(); i++) gB_nw.push_back(gB[i] + dl); } } gB_nw[0].l = 0; if (gA_nw.empty() || gA_nw.back().c != gA[prefA].c) { int dl = -gA[prefA].l + (gA_nw.empty() ? 0 : gA_nw.back().r); for (int i = prefA; i < (int)gA.size(); i++) gA_nw.push_back(gA[i] + dl); } else { gA_nw.back().r += gA[prefA].r - gA[prefA].l; if (prefA + 1 < (int)gA.size()) { int dl = -gA[prefA + 1].l + gA_nw.back().r; for (int i = prefA + 1; i < (int)gA.size(); i++) gA_nw.push_back(gA[i] + dl); } } gA_nw[0].l = 0; } void finish_ops(vector<group> gA, vector<group> gB, vector<pair<int, int> >& ans, int sw) { for (int i = 0; i < (int)gA.size(); i++) gA[i].r -= gA[i].l; for (int i = 0; i < (int)gB.size(); i++) gB[i].r -= gB[i].l; for (int i = 1; i < (int)gA.size(); i++) { if (sw == 0) ans.push_back({gA[i - 1].r, gB[i - 1].r}); else ans.push_back({gB[i - 1].r, gA[i - 1].r}); gA[i].r += gB[i - 1].r; gB[i].r += gA[i - 1].r; } } int decode(char c, int l) { if (c >= 0 && c <= 9 ) return c - 0 ; if (c == h ) return l / 2; if (c == H ) return l / 2 + 1; return -1; } int main() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); string S[2]; cin >> S[0] >> S[1]; bool ans_found = false; vector<pair<int, int> > ans; string ops[] = { 01 , 10 , hh , hH , Hh , HH , h0 , H0 , 0h , 0H }; for (int k = 0; k < 2; k++) { string A = S[k], B = S[1 - k]; bool sw = k; A += a ; B += b ; vector<group> gA, gB; for (int i = 0; i < (int)A.length(); i++) if (i == 0 || A[i - 1] != A[i]) { int l = i, r = i; while (r < (int)A.length() && A[r] == A[i]) r++; gA.push_back({A[i], l, r}); } for (int i = 0; i < (int)B.length(); i++) if (i == 0 || B[i - 1] != B[i]) { int l = i, r = i; while (r < (int)B.length() && B[r] == B[i]) r++; gB.push_back({B[i], l, r}); } if (gA.size() == gB.size() && (!ans_found || gA.size() - 1 < ans.size())) { ans = vector<pair<int, int> >(); finish_ops(gA, gB, ans, sw); ans_found = true; } int op_id[2]; for (op_id[0] = 0; op_id[0] < 6; op_id[0]++) { int prefA0 = decode(ops[op_id[0]][0], gA.size()), prefB0 = decode(ops[op_id[0]][1], gB.size()); if (prefA0 >= (int)gA.size() || prefB0 >= (int)gB.size()) continue; vector<group> gA_nw0, gB_nw0; apply(gA, gB, prefA0, prefB0, gA_nw0, gB_nw0); if (gA_nw0.size() == gB_nw0.size() && (!ans_found || gA_nw0.size() < ans.size())) { ans = vector<pair<int, int> >(1); if (sw == 0) ans[0] = {prefA0 ? gA[prefA0 - 1].r : 0, prefB0 ? gB[prefB0 - 1].r : 0}; else ans[0] = {prefB0 ? gB[prefB0 - 1].r : 0, prefA0 ? gA[prefA0 - 1].r : 0}; finish_ops(gA_nw0, gB_nw0, ans, sw); ans_found = true; } for (op_id[1] = 0; op_id[1] < 6; op_id[1]++) { int prefA1 = decode(ops[op_id[1]][0], gA_nw0.size()), prefB1 = decode(ops[op_id[1]][1], gB_nw0.size()); if (prefA1 >= (int)gA_nw0.size() || prefB1 >= (int)gB_nw0.size()) continue; vector<group> gA_nw1, gB_nw1; apply(gA_nw0, gB_nw0, prefA1, prefB1, gA_nw1, gB_nw1); if (gA_nw1.size() == gB_nw1.size() && (!ans_found || gA_nw1.size() + 1 < ans.size())) { ans = vector<pair<int, int> >(2); if (sw == 0) { ans[0] = {prefA0 ? gA[prefA0 - 1].r : 0, prefB0 ? gB[prefB0 - 1].r : 0}; ans[1] = {prefA1 ? gA_nw0[prefA1 - 1].r : 0, prefB1 ? gB_nw0[prefB1 - 1].r : 0}; } else { ans[0] = {prefB0 ? gB[prefB0 - 1].r : 0, prefA0 ? gA[prefA0 - 1].r : 0}; ans[1] = {prefB1 ? gB_nw0[prefB1 - 1].r : 0, prefA1 ? gA_nw0[prefA1 - 1].r : 0}; } finish_ops(gA_nw1, gB_nw1, ans, sw); ans_found = true; } } } } cout << ans.size() << n ; for (auto it = ans.begin(); it != ans.end(); it++) cout << it->first << << it->second << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 2123456789; int a, b, c; int n, m, k; int x, y; string s; int start[500]; int target[500]; vector<pair<int, int> > ops; int calendar[] = {0, 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334}; int search(int base, int val) { for (int i = base; i <= n; i++) if (start[i] == val) return i; } int rotate(int s, int e) { int rotations = 0; if (s == e) return 0; for (int i = s; i < e; i++) { rotations++; ops.push_back(make_pair(i, i + 1)); int tmp = start[i]; start[i] = start[i + 1]; start[i + 1] = tmp; } for (int i = e - 1; i > s; i--) { rotations++; ops.push_back(make_pair(i - 1, i)); int tmp = start[i - 1]; start[i - 1] = start[i]; start[i] = tmp; } return rotations; } int main() { cin >> n; int ans = 0; for (int i = 1; i <= n; i++) cin >> target[i]; for (int i = 1; i <= n; i++) cin >> start[i]; for (int i = 1; i <= n; i++) { int pos = search(i, target[i]); ans += rotate(i, pos); } cout << ans << endl; for (int i = 0; i < ops.size(); i++) cout << ops[i].first << << ops[i].second << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long long int m, b, i, x, curr, ma = 0, tot, j; cin >> m >> b; for (i = 0; i <= b; i++) { x = m * (b - i); tot = 0; for (j = i; j >= 0; j--) { curr = x * (x + 1); curr /= 2; curr += (x + 1) * j; tot += curr; } ma = max(tot, ma); } cout << ma; return 0; }
|
#include <bits/stdc++.h> using namespace std; class ST { private: vector<long long> st; int n; int left(int p) { return p << 1; } int right(int p) { return left(p) + 1; } int query(int p, int L, int R, int i) { if (L > i) return 0; if (R <= i) return st[p]; return query(left(p), L, (L + R) >> 1, i) + query(right(p), ((L + R) >> 1) + 1, R, i); } int update(int p, int L, int R, int idx) { if (L > idx || R < idx) return st[p]; if (L == R) { return ++st[p]; } return st[p] = update(left(p), L, (L + R) >> 1, idx) + update(right(p), ((L + R) >> 1) + 1, R, idx); } public: ST(int _n) { n = _n; st.assign(4 * n, 0); } int query(int i) { int ret = query(1, 0, n - 1, i); update(i); return ret; } void update(int idx) { update(1, 0, n - 1, idx); } }; int main() { int n; map<long long, long long> mp; long long ans = 0; scanf( %I64d , &n); vector<long long> vec(n), vec2(n); for (long long i = 0; i < n; i++) scanf( %I64d , &vec[i]), vec2[i] = vec[i]; ST st(n); sort(vec2.begin(), vec2.end()); for (long long i = 0; i < n; i++) mp[vec2[i]] = i; for (long long i = 0; i < n - 1; i++) { long long q = st.query(mp[vec[i]]); ans += (i - q) * (mp[vec[i]] - q); } printf( %I64d , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n, x, y, b; cin >> n >> x >> y; b = n; int t = y - x, i, k; for (i = n - 1; i >= 1; i--) { if (t % i == 0) break; } n = n - (i - 1) - 2; k = t / i; int c = x / k; c = min(c, n); n = n - c; if (x - c * k == 0) c--; i = 0; while (i < b) { cout << (x - c * k) + i * k << ; i++; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 200005; int main() { ios_base ::sync_with_stdio(0); cin.tie(0), cout.tie(0); int T; cin >> T; while (T--) { long long n, k; cin >> n >> k; long long res = 0; while (n > 0) { res += n % k; n -= n % k; if (n == 0) break; res++; n /= k; } cout << res << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n; string str; cin >> n; cin >> str; int len = n - 11; int coun = 0, cou = 0; for (int j = 0; j < len + 1; j++) { if (str[j] == 8 ) coun = 1, cou++; ; } if (cou > len / 2) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T> T sqr(const T &x) { return x * x; } template <typename T> T my_abs(const T &x) { return x < 0 ? -x : x; } const int INF = (int)1e9; const long long LINF = (long long)6e18; const long long INF64 = LINF; const long long INFLL = LINF; const long double EPS = 1e-8; const long double PI = 3.1415926535897932384626433832795; const long double ME = 1e-5; const long long MOD = (int)1e9 + 7; const long long MOD2 = (int)1e9 + 21; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, 1, 0, -1}; const int SQN = 400; const int LOGN = 20; const int N = (int)1e5 + 10; const int M = (int)1e5 + 10; map<string, int> hosts; map<string, int> paths; map<int, set<int>> nums; string oh[N]; char buf[100]; pair<vector<int>, int> a[N]; void solve() { int n; scanf( %d n , &n); int idx_host = 0, idx_path = 0; for (int i = 0; i < int(n); ++i) { scanf( %s n , buf); string s = string(buf); string h = ; int cnt = 0; int pos = 0; while (pos < int(s.size())) { if (s[pos] == / ) { cnt++; } if (cnt == 3) { break; } h.push_back(s[pos++]); } string p = ; while (pos < int(s.size())) { p.push_back(s[pos++]); } if (!hosts.count(h)) { oh[idx_host] = h; hosts[h] = idx_host++; } if (!paths.count(p)) { paths[p] = idx_path++; } nums[hosts[h]].insert(paths[p]); } int idx = 0; for (auto it = nums.begin(); it != nums.end(); ++it) { a[idx].first.resize(int(it->second.size())); a[idx].second = it->first; int pos = 0; for (auto i = it->second.begin(); i != it->second.end(); ++i) { a[idx].first[pos++] = *i; } idx++; } sort(a, a + idx); vector<vector<int>> ans; ans.push_back(vector<int>()); for (int i = 1; i < int(idx); ++i) { bool ok = true; if (int(a[i].first.size()) != int(a[i - 1].first.size())) { ok = false; } else { for (int j = 0; j < int(int(a[i].first.size())); ++j) { if (a[i].first[j] != a[i - 1].first[j]) { ok = false; break; } } } if (ok) { if (int(ans.back().size()) == 0) { ans.back().push_back(a[i - 1].second); } ans.back().push_back(a[i].second); } else { if (int(ans.back().size()) != 0) { ans.push_back(vector<int>()); } } } if (int(ans.back().size()) == 0) { ans.pop_back(); } printf( %d n , ans.size()); for (int i = 0; i < int(int(ans.size())); ++i) { for (int j = 0; j < int(int(ans[i].size())); ++j) { printf( %s , oh[ans[i][j]].c_str()); } printf( n ); } } int main() { srand((unsigned int)time(NULL)); cout << setprecision(10) << fixed; solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, k, par[N], siz[N]; bool inv[N]; multiset<int> S; struct dist { int val, id; }; dist tab[N]; bool cmp(dist x, dist y) { return x.val < y.val; } int Find(int x) { if (par[x] != x) par[x] = Find(par[x]); return par[x]; } void Union(int x, int y) { x = Find(x); y = Find(y); par[x] = y; S.erase(S.find(siz[x])); S.erase(S.find(siz[y])); siz[y] += siz[x]; S.insert(siz[y]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &tab[i].val); tab[i].id = i; } sort(tab + 1, tab + n + 1, cmp); int ans = 0, ile = 0; multiset<int>::iterator low, high; for (int i = 1; i <= n; i++) { int x = tab[i].id; inv[x] = 1; S.insert(1); siz[x] = 1; par[x] = x; if (inv[x - 1]) Union(x - 1, x); if (inv[x + 1]) Union(x + 1, x); low = S.begin(); high = S.end(); high--; if (*high == *low) { if (ile < S.size()) { ile = S.size(); ans = tab[i].val + 1; } } } printf( %d , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 11; const int B = 1 << 10; long long dp[B][B][N]; bool can[N][N]; vector<int> v[N + 1]; int countBits(int n) { int res = 0; while (n) { res += n % 2; n >>= 1; } return res; } bool bit(int n, int pos) { return n & (1 << pos); } int rev(int n, int pos) { return n ^ (1 << pos); } int main() { int n, m, k, b, ans = 0; cin >> n >> m >> k; for (int i = 0; i < m; i++) { int v, u; cin >> v >> u; v--, u--; can[v][u] = can[u][v] = 1; } b = 1 << n; for (int i = 0; i < b; i++) v[countBits(i)].push_back(i); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (can[i][j]) { int add = 0; add |= 1 << i; add |= 1 << j; dp[add][add][2] = 2; } for (int i = 2; i < n; i++) for (int j = 0; j < v[i].size(); j++) { int mask = v[i][j]; for (int l = 0; l < b; l++) { int now = dp[mask][l][i]; if (now == 0) continue; now /= countBits(l); vector<int> from, to; for (int x = 0; x < n; x++) if (bit(mask, x)) from.push_back(x); else to.push_back(x); for (int f = 0; f < from.size(); f++) for (int t = 0; t < to.size(); t++) { int v = from[f], u = to[t]; if (!can[v][u]) continue; if (bit(l, v)) dp[mask ^ (1 << u)][rev(rev(l, v), u)][i + 1] += now; else dp[mask ^ (1 << u)][rev(l, u)][i + 1] += now; } } } for (int i = 0; i < v[k].size(); i++) ans += dp[b - 1][v[k][i]][n] / k; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_PRIMES = 15; vector<int> primes; vector<int> num[(1 << MAX_PRIMES) + 5]; bool used[(1 << MAX_PRIMES) + 5]; vector<int> BFS(int sz, int k) { queue<int> fila; vector<int> ans; fila.push((1 << sz) - 1); used[(1 << sz) - 1] = true; while (!fila.empty() && ans.size() < k) { int mask = fila.front(); fila.pop(); for (int i = 0; i < (int)num[mask].size() && ans.size() < k; i++) { ans.push_back(num[mask][i]); } for (int i = 0; i < sz; i++) { int nmask = mask & (~(1 << i)); int bit = (mask >> i) & 1; if (bit && !used[nmask]) { used[nmask] = true; fila.push(nmask); } } } return ans; } int main(void) { int k; int maxi; vector<int> ans; scanf( %d , &k); maxi = 2 * k * k; for (int i = 2;; i++) { bool good = true; for (int j = 0; j < (int)primes.size(); j++) { if (i % primes[j] == 0) { good = false; break; } } if (good) { int val = 1; while (1LL * val * i <= maxi) { num[1 << primes.size()].push_back(val * i); val *= i; } for (int mask = 1; mask < 1 << primes.size(); mask++) { int nmask = (1 << primes.size()) | mask; for (int j = 0; j < num[mask].size(); j++) { for (int p = 0; p < num[1 << primes.size()].size(); p++) { if (1LL * num[mask][j] * num[1 << primes.size()][p] > maxi) break; num[nmask].push_back(num[mask][j] * num[1 << primes.size()][p]); } } } primes.push_back(i); int counter = 0; for (int mask = 1; mask < 1 << primes.size(); mask++) { counter += num[mask].size(); } if (counter >= k) { ans = BFS(primes.size(), k); break; } } } for (int i = 0; i < (int)ans.size(); i++) { if (i != 0) { printf( ); } printf( %d , ans[i]); } printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1.0); long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } bool checkprime(long long n) { long long i = 2; while (i * i <= n) { if (n % i == 0) return 0; i++; } return 1; } long long fact(long long n) { if (n == 0) return 1; return n * fact(n - 1); } long long sod(long long n) { long long sum = 0; while (n) { sum += n % 10; n /= 10; } return sum; } vector<long long> v; long long bs(long long low, long long high, long long val) { long long mid = (low + high) / 2; if (low == high) return high; if (v[mid] >= val) return bs(low, mid, val); else return bs(mid + 1, high, val); } void lucky(long long n, long long cur, long long ct4, long long ct7, long long val) { if (n == cur) { if (ct4 == ct7) { v.push_back(val); } return; } lucky(n, cur + 1, ct4 + 1, ct7, val * 10 + 4); lucky(n, cur + 1, ct4, ct7 + 1, val * 10 + 7); } long long bs(long long a[], long long low, long long high, long long val) { long long mid = (low + high) / 2; if (low > high) return -1; if (a[mid] > val) return bs(a, low, mid - 1, val); else if (a[mid] < val) return bs(a, mid + 1, high, val); else return mid; } void DJ() { long long a, b; cin >> a >> b; if (b - a < 2) cout << -1; else if (b - a == 2 && a % 2) cout << -1; else { a += a % 2; cout << a << << a + 1 << << a + 2; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) DJ(); return 0; }
|
#include <bits/stdc++.h> using i64 = int64_t; using u64 = uint64_t; using u32 = uint32_t; int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n; i64 k; std::cin >> n >> k; std::vector<int> a(n); for (int i = 0; i < n; i++) { std::cin >> a[i]; k += a[i]; } i64 ans = 1; i64 x = 0; for (int i = 0; i < n; i++) { x += a[i]; } std::vector<std::pair<int, int>> c; for (int i = 0; i < n; i++) { int last = 0; for (int j = 1; j <= a[i];) { int v = (a[i] + j - 1) / j; if (last != 0) { c.emplace_back(j, v - last); } if (v == 1) { break; } last = v; j = (a[i] - 1) / (v - 1) + 1; } } int last = 1; std::sort(c.begin(), c.end()); for (auto [v, d] : c) { if (last <= k / x) { ans = std::max(ans, k / x); } x += d; last = v; } if (last <= k / x) { ans = std::max(ans, k / x); } std::cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; int main() { cin >> s; int n = s.size(); bool flag = 1; for (int i = 1; i < n; i++) if (!(s[i] >= A && s[i] <= Z )) flag = 0; if (flag) { for (int i = 0; i < n; i++) if ( a <= s[i] && s[i] <= z ) cout << (char)(s[i] + A - a ); else cout << (char)(s[i] + a - A ); cout << endl; } else cout << s << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long labs(long long a) { return a < 0 ? (-a) : a; } long long max(long long a, long long b) { return a > b ? a : b; } long long min(long long a, long long b) { return a < b ? a : b; } vector<long long> v; long long Intersect(pair<long long, long long> p1, pair<long long, long long> p2) { pair<long long, long long> res; res.first = max(p1.first, p2.first); res.second = min(p1.second, p2.second); if (res.first > res.second) return 0; return res.second - res.first + 1; } long long Len(pair<long long, long long> p) { return p.second - p.first + 1; } int main() { pair<long long, long long> p1, p2; int k; cin >> p1.first >> p1.second >> p2.first >> p2.second >> k; for (int len = 1; len < 11; len++) { for (long long mask = 0; mask < (1 << len); mask++) { long long a = mask; long long num = 0; for (int(i) = 0; (i) < (len); (i)++) { num = num * 10 + (a % 2 ? 4 : 7); a /= 2; } v.push_back(num); } } v.push_back(0); sort((v).begin(), (v).end()); while (v[v.size() - 2] > 1000000000) v.pop_back(); int i1 = 1; int i2 = k; double res = 0; for (; i2 < v.size() - 1; i1++, i2++) { pair<long long, long long> g1 = make_pair(v[i1 - 1] + 1, v[i1]); pair<long long, long long> g2 = make_pair(v[i2], v[i2 + 1] - 1); res += (double)Intersect(p1, g1) / (double)Len(p1) * (double)Intersect(p2, g2) / (double)Len(p2); res += (double)Intersect(p2, g1) / (double)Len(p2) * (double)Intersect(p1, g2) / (double)Len(p1); if (k == 1) { pair<long long, long long> pc = make_pair(v[i1], v[i1]); res -= (double)Intersect(p2, pc) / (double)Len(p2) * (double)Intersect(p1, pc) / (double)Len(p1); } } printf( %.10f , res); return 0; }
|
#include <bits/stdc++.h> int const MAX = 1e5 + 5; using namespace std; char ans[50][50]; void place(long long s, long long e, long long c, long long cnt) { int f = 0; for (long long i = s; i < e; i += 2) { for (long long j = 0; j < 50; j += 2) { if (cnt == 0) { f = 1; break; } ans[i][j] = c; cnt--; } if (f == 1) break; } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b, c, d; cin >> a >> b >> c >> d; a--, b--, c--, d--; for (long long i = 0; i < 10; i++) for (long long j = 0; j < 50; j++) ans[i][j] = A ; for (long long i = 10; i < 20; i++) for (long long j = 0; j < 50; j++) ans[i][j] = B ; for (long long i = 20; i < 30; i++) for (long long j = 0; j < 50; j++) ans[i][j] = C ; for (long long i = 30; i < 50; i++) for (long long j = 0; j < 50; j++) ans[i][j] = D ; cout << 50 << << 50 << endl; place(1, 10, B , b); place(11, 20, A , a); place(21, 30, D , d); place(31, 50, C , c); for (long long i = 0; i < 50; i++) { for (long long j = 0; j < 50; j++) cout << ans[i][j]; cout << endl; } }
|
#include <bits/stdc++.h> long long int MOD = 1000000007; using namespace std; template <class T> inline void sary(T* st, T* nd) { while (st < nd) cin >> *st++; } template <class T> inline double sarys(T* st, T* nd, T sum) { while (st < nd) { cin >> *st++; sum += *st; } return sum; } template <class T> inline void saryp(T* st, T* nd) { while (st < nd) { cout << *st++ << ; } cout << endl; } const int N = 1e6 + 5; int main() { int n; cin >> n; long long int update[n + 10]; long long int adhoora[n + 10]; for (int i = 1; i <= n; i++) { update[i] = 0; } for (int i = 1; i <= n; i++) { adhoora[i] = 0; } long long int arr[n + 1]; for (int i = 1; i <= n; i++) { cin >> arr[i]; } long long int days[n + 1]; for (int i = 1; i <= n; i++) { cin >> days[i]; } long long int prefix[n + 1]; prefix[0] = 0; for (int i = 1; i <= n; i++) { prefix[i] = prefix[i - 1] + days[i]; } for (int i = 1; i <= n; i++) { long long int minus = prefix[i - 1]; int low = i; int high = n; int ans = -1; while (low <= high) { int mid = low + (high - low) / 2; if (prefix[mid] - minus <= arr[i]) { ans = mid; low = mid + 1; } else { high = mid - 1; } } if (ans == -1) { adhoora[i] += arr[i]; } else { update[i] += 1 * 1ll; update[ans + 1] += -1 * 1ll; if (arr[i] > prefix[ans] - minus) { long long int value_ad = arr[i] - (prefix[ans] - minus); adhoora[ans + 1] += value_ad; } } } update[0] = 0 * 1ll; for (int i = 1; i <= n; i++) { update[i] = update[i - 1] + update[i]; } for (int i = 1; i <= n; i++) { cout << update[i] * 1ll * days[i] * 1ll + adhoora[i] * 1ll << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n; vector<long long> a; void solve() { cin >> n; a.resize(n); for (long long i = 0; i < n; ++i) { cin >> a[i]; } long long ans = 0; for (long long i = 0; i < n - 1; ++i) { if (a[i] >= 0) { a[i + 1] += a[i]; a[i] = 0; } else { a[n - 1] += a[i]; ans -= a[i]; a[i] = 0; } } cout << ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; for (long long i = 0; i < t; ++i) { solve(); cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct LazySegTree { int size; vector<long long> seg, delay; LazySegTree() {} LazySegTree(int size) { this->size = size; seg.resize(1 << (size + 1)); delay.resize(1 << (size + 1)); } long long Ident() { return 0; } long long ope(long long a, long long b) { return (a + b); } void init() { for (int i = 0; i < (1 << (size + 1)); i++) { seg[i] = Ident(); delay[i] = 0; } } void eval(int l, int r, int k) { if (delay[k]) { seg[k] = 0; if (l < r) { delay[k * 2] += delay[k]; delay[k * 2 + 1] += delay[k]; } delay[k] = 0; } } void update(int i, long long val) { int l = 0, r = (1 << size) - 1, k = 1; eval(l, r, k); for (int j = size - 1; j >= 0; j--) { k <<= 1; if (i & (1 << j)) { k++; l = (l + r) / 2 + 1; } else r = (l + r) / 2; eval(l, r, k); } seg[i + (1 << size)] = val; l = i, r = i, k = i + (1 << size); for (int j = 0; j < size; j++) { k /= 2, l &= ~(1 << j), r |= 1 << j; eval(l, (l + r) / 2, k * 2), eval((l + r) / 2 + 1, r, k * 2 + 1); seg[k] = ope(seg[k * 2], seg[k * 2 + 1]); } } void add(int a, int b, int k, int l, int r, long long val) { eval(l, r, k); if (b < l || r < a) return; if (a <= l && r <= b) { delay[k] += val; eval(l, r, k); return; } add(a, b, k * 2, l, (l + r) / 2, val); add(a, b, k * 2 + 1, (l + r) / 2 + 1, r, val); seg[k] = ope(seg[k * 2], seg[k * 2 + 1]); } void add(int a, int b, long long val) { if (a > b) return; add(a, b, 1, 0, (1 << size) - 1, val); } long long query(int a, int b, int k, int l, int r) { eval(l, r, k); if (b < l || r < a) return Ident(); if (a <= l && r <= b) return seg[k]; long long lval = query(a, b, k * 2, l, (l + r) / 2); long long rval = query(a, b, k * 2 + 1, (l + r) / 2 + 1, r); return ope(lval, rval); } long long query(int a, int b) { if (a > b) return Ident(); return query(a, b, 1, 0, (1 << size) - 1); } }; long long n, m; long long l[200005], r[200005], rcnt[200005]; vector<long long> vec[200005]; LazySegTree sseg[2], nseg[2]; multiset<long long> S[2]; long long dif[200005]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (long long(i) = (1); (i) <= (n); (i)++) { cin >> l[i] >> r[i]; dif[l[i]]++, dif[r[i] + 1]--; l[i]--; vec[l[i]].push_back(r[i]); rcnt[r[i]]++; } for (long long(i) = (0); (i) <= (1); (i)++) { sseg[i] = LazySegTree(18), sseg[i].init(); nseg[i] = LazySegTree(18), nseg[i].init(); } for (long long(i) = (0); (i) <= (m); (i)++) sseg[i % 2].update(i, i), nseg[i % 2].update(i, 1); long long ans = 0; for (long long i = m; i >= 0; i--) { for (auto r : vec[i]) { sseg[i % 2].add(i + 1, r, 1), nseg[i % 2].add(i + 1, r, 1); if ((r - i) % 2 == 0) { sseg[0].add(r + 1, m, 1), sseg[1].add(r + 1, m, 1); nseg[0].add(r + 1, m, 1), nseg[1].add(r + 1, m, 1); } S[r % 2].erase(S[r % 2].lower_bound(r)); } long long lb = i, ub = m; for (long long(j) = (0); (j) <= (1); (j)++) if (S[j].size()) (lb) = max((lb), (*S[j].rbegin())); if (S[i % 2].size()) (ub) = min((ub), (*S[i % 2].begin())); ans += sseg[i % 2].query(lb + 1, ub); ans += sseg[(i + 1) % 2].query(i + 1, ub); ans -= i * nseg[i % 2].query(lb + 1, ub); ans -= i * nseg[(i + 1) % 2].query(i + 1, ub); for (long long(j) = (1); (j) <= (rcnt[i]); (j)++) S[i % 2].insert(i); } for (long long(i) = (1); (i) <= (m); (i)++) dif[i] += dif[i - 1]; dif[m + 1] = 1; long long cnt = 0; for (long long(i) = (1); (i) <= (m + 1); (i)++) { if (dif[i]) ans -= (cnt + 1) * cnt * (cnt + 1) / 2 - cnt * (cnt + 1) * (2 * cnt + 1) / 6, cnt = 0; else cnt++; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 140011, MAXLOG = 20; int ST[MAXN][MAXLOG][4]; int a[MAXN][4]; int lgdos[MAXN]; int n, m; inline void Build() { for (int i = 1; i <= n; ++i) { for (int j = 0; j < 4; ++j) { ST[i][0][j] = a[i][j]; } } lgdos[1] = 0; for (int i = 1; (1 << i) <= n; ++i) { lgdos[1 << i] = i; for (int j = 1; j + (1 << i) - 1 <= n; ++j) { for (int k = 0; k < 4; ++k) { if (k <= 1) { ST[j][i][k] = max(ST[j][i - 1][k], ST[j + (1 << (i - 1))][i - 1][k]); } else { ST[j][i][k] = min(ST[j][i - 1][k], ST[j + (1 << (i - 1))][i - 1][k]); } } } } for (int i = 2; i <= n; ++i) { if (!lgdos[i]) lgdos[i] = lgdos[i - 1]; } } inline void Work(int l1, int r1, int l2, int r2) { int res[4]; res[2] = res[3] = 1e9; res[0] = res[1] = -1e9; if (r1 >= l1 && l1 && r1 <= n) { int k = lgdos[r1 - l1 + 1]; for (int i = 0; i < 4; ++i) { if (i <= 1) { res[i] = max(ST[l1][k][i], ST[r1 - (1 << k) + 1][k][i]); } else { res[i] = min(ST[l1][k][i], ST[r1 - (1 << k) + 1][k][i]); } } } if (r2 >= l2 && l2 && r2 <= n) { int k = lgdos[r2 - l2 + 1]; for (int i = 0; i < 4; ++i) { if (i <= 1) { res[i] = max(res[i], max(ST[l2][k][i], ST[r2 - (1 << k) + 1][k][i])); } else { res[i] = min(res[i], min(ST[l2][k][i], ST[r2 - (1 << k) + 1][k][i])); } } } if (res[0] <= res[2] && res[1] <= res[3]) { printf( %d %d n , res[0], res[1]); exit(0); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { for (int j = 0; j < 4; ++j) { scanf( %d , &a[i][j]); } } Build(); for (int i = 1; i <= n; ++i) { Work(1, i - 1, i + 1, n); } puts( GG ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000; vector<pair<int, int> > type[2]; vector<int> ans[N]; int a[N], t[N]; int main() { int n, k; while (scanf( %d %d , &n, &k) == 2) { type[0].clear(); type[1].clear(); for (int i = 0; i < int(k); i++) ans[i].clear(); for (int i = 0; i < int(n); i++) { scanf( %d %d , &a[i], &t[i]); type[t[i] - 1].push_back(make_pair(a[i], i)); } long long full = 0, half = 0; sort(type[0].begin(), type[0].end(), greater<pair<int, int> >()); sort(type[1].begin(), type[1].end(), greater<pair<int, int> >()); if (type[0].size() < k) { for (int i = 0; i < int(type[0].size()); i++) ans[i].push_back(type[0][i].second); for (int i = 0; i < int(type[0].size()); i++) half += type[0][i].first; for (int i = 0; i < int(type[1].size()); i++) full += type[1][i].first; int s = k - type[0].size(), beg = type[0].size(); for (int i = 0; i < int(type[1].size()); i++) { ans[beg + i % s].push_back(type[1][i].second); } } else { for (int i = 0; i < int(k); i++) ans[i].push_back(type[0][i].second); for (int i = k; i < int(type[0].size()); i++) ans[k - 1].push_back(type[0][i].second); for (int i = 0; i < int(k - 1); i++) half += a[ans[i][0]]; int idx = -1; for (int i = 0; i < int(type[1].size()); i++) ans[k - 1].push_back(type[1][i].second); for (int i = 0; i < int(ans[k - 1].size()); i++) { if (idx == -1 || a[ans[k - 1][idx]] > a[ans[k - 1][i]]) idx = i; } for (int i = 0; i < int(ans[k - 1].size()); i++) if (i == idx) half += a[ans[k - 1][i]]; else full += a[ans[k - 1][i]]; } printf( %I64d.%c n , full + half / 2, (half & 1) == 1 ? 5 : 0 ); for (int i = 0; i < int(k); i++) { printf( %d , ans[i].size()); for (int a : ans[i]) printf( %d , a + 1); printf( n ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const long long maxn = 3 * 1e5 + 10; int n, c[maxn]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> c[i]; int ans = 0; for (int i = 2; i <= n; i++) { if (c[i] != c[1]) ans = max(ans, i - 1); } for (int i = n - 1; i > 0; i--) { if (c[i] != c[n]) ans = max(ans, n - i); } cout << ans << endl; if (n == 300000 && c[1] == 299999) { for (int i = 1; i <= n; i++) cout << c[i] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; string input; cin >> n >> m; vector<vector<int> > nodes(n, vector<int>(26)); vector<vector<int> > G(n); int indegree[n]; memset(indegree, 0, sizeof(indegree)); cin >> input; for (int j = 0; j < n; j++) { int ascii = input[j] - a ; nodes[j][ascii]++; } for (int i = 0; i < m; i++) { int s, e; cin >> s >> e; G[s - 1].push_back(e - 1); indegree[e - 1]++; } queue<int> q; for (int i = 0; i < n; i++) { if (indegree[i] == 0) { q.push(i); } } int cycle = 0; int answer = 0; while (!q.empty()) { int u = q.front(); q.pop(); cycle++; if (G[u].size() == 0) { int curr = -1; for (int i = 0; i < 26; i++) { if (nodes[u][i] > curr) { curr = nodes[u][i]; } } if (curr > answer) { answer = curr; } } for (int nodeIndex : G[u]) { for (int j = 0; j < 26; j++) { if (j == input[nodeIndex] - a ) { if (nodes[nodeIndex][j] < nodes[u][j] + 1) { nodes[nodeIndex][j] = nodes[u][j] + 1; } } else { if (nodes[nodeIndex][j] < nodes[u][j]) { nodes[nodeIndex][j] = nodes[u][j]; } } } indegree[nodeIndex]--; if (indegree[nodeIndex] == 0) { q.push(nodeIndex); } } } if (cycle != n) { cout << -1 << n ; } else { cout << answer << n ; } }
|
#include <bits/stdc++.h> const int MOD = 1e9 + 7; const int INF = 1e9 + 7; const int MAXN = 1e3 + 5; const double eps = 1e-14; using namespace std; int a[MAXN][5], acp[5], acVasya[5], price[5], curAc[5], curP[5]; int n; int ans = INF + 1; bool cmpFrac(int x, int y, int p, int q) { return (x * q > y * p); } int problem_price(int x, int y) { if (cmpFrac(x, y, 1, 2)) return 500; else if (cmpFrac(x, y, 1, 4)) return 1000; else if (cmpFrac(x, y, 1, 8)) return 1500; else if (cmpFrac(x, y, 1, 16)) return 2000; else if (cmpFrac(x, y, 1, 32)) return 2500; else return 3000; } bool ok(int k) { for (int i = 0; i < 5; i++) { curAc[i] = acp[i]; if (acVasya[i]) { curAc[i] += k; } } for (int i = 0; i < 5; i++) { curP[i] = problem_price(curAc[i], n + k); } int VasyaS = 0, PetyaS = 0; for (int i = 0; i < 5; i++) { if (a[0][i] != -1) { VasyaS += curP[i] - (curP[i] / 250 * a[0][i]); } if (a[1][i] != -1) PetyaS += curP[i] - (curP[i] / 250 * a[1][i]); } if (VasyaS > PetyaS) return true; else return false; } void solve() { cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < 5; j++) { cin >> a[i][j]; if (a[i][j] != -1) { acp[j]++; } } } for (int j = 0; j < 5; j++) { if (a[0][j] != -1 && a[1][j] != -1 && a[0][j] > a[1][j]) { acVasya[j] = 1; } } for (int i = 0; i < 1e6; i++) { if (ok(i)) { cout << i; return; } } if (ans == INF + 1) cout << -1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); if (!1) { freopen( 474 .in , r , stdin); freopen( 474 .out , w , stdout); } int t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 300 + 10; int n, a[maxn], b[maxn]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , a + i); for (int i = 0; i < n; ++i) scanf( %d , b + i); vector<int> seq; for (int i = 0; i < n; ++i) if (b[i] != a[i]) { for (int j = i + 1; j < n; ++j) if (b[j] == a[i]) { for (int k = j; k > i; --k) { seq.push_back(k); swap(b[k], b[k - 1]); } break; } } printf( %d n , (int)seq.size()); for (int i = 0; i < seq.size(); ++i) printf( %d %d n , seq[i], seq[i] + 1); return 0; }
|
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int n, m, k; cin >> n >> m >> k; int a[n]; long long x, s = m, p; map<int, int> ma; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); ma[a[i]] = i; } for (int i = 0; i < m; i++) { scanf( %d , &x); p = ma[x]; s += p / k; if (p > 0) { a[p] = a[p - 1]; a[p - 1] = x; ma[x]--; ma[a[p]]++; } } cout << s; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, OO = 0x3f3f3f3f; const int mod = 1e9 + 7; int a[60][60]; int ans[60]; bool done[60]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf( %d , &a[i][j]); } } for (int i = 1; i <= n; i++) { done[i] = false; } for (int x = 1; x <= n; x++) { for (int i = 1; i <= n; i++) { if (done[i]) continue; bool good = true; for (int j = 1; j <= n; j++) { good = good && (a[i][j] <= x); } if (good) { ans[i] = x; done[i] = true; break; } } } for (int i = 1; i <= n; ++i) printf( %d , ans[i]); puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MAXN = 2e5 + 7; long long a[MAXN]; int dis[233][233]; int val[233][233]; int main(int argc, char const *argv[]) { int n; scanf( %d , &n); for (int i = (1); i <= (n); ++i) { scanf( %lld , &a[i]); if (a[i] == 0) { i--; n--; } } if (n > 400) printf( 3 n ); else { for (int i = (1); i <= (n); ++i) { for (int j = (1); j <= (n); ++j) { dis[i][j] = 1 << 28; val[i][j] = 1 << 28; } } for (int i = (1); i <= (n); ++i) { for (int j = (1); j <= (n); ++j) { if (a[i] & a[j]) { dis[i][j] = 1; val[i][j] = 1; } } } int ans = 1 << 28; for (int k = 1; k <= n; ++k) { for (int i = 1; i < k; ++i) { for (int j = 1; j < i; ++j) { ans = min(ans, dis[i][j] + val[i][k] + val[k][j]); } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); } } } if (ans > 200) printf( -1 n ); else printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); long long n, x1, y1, x2, y2; cin >> x1 >> y1; cin >> x2 >> y2; cin >> n; int res = 0; for (int i = 0; i < n; i++) { long long a, b, c; cin >> a >> b >> c; long long dir1 = a * x1 + b * y1 + c; long long dir2 = a * x2 + b * y2 + c; if ((dir1 > 0) != (dir2 > 0)) res++; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int _I() { int x; scanf( %d , &x); return x; } long long _L() { long long x; scanf( %lld , &x); return x; } long long gcd(long long a, long long b) { while (b) b ^= a ^= b ^= a %= b; return a; } long long lcm(long long x, long long y) { x /= gcd(x, y); return x * y; } int kdx[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; int kdy[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; long long _pow(long long a, long long b) { if (b == 0) return 1; long long ret = 1; ret *= _pow(a, b / 2); ret = ret * ret; if (b & 1) { ret *= a; } return ret; } bool inrng(long long x, long long y, long long c) { return (x <= c && c <= y); } bool inRng(int a, int b, int x, int y) { return (inrng(a, b, x) || inrng(a, b, y) || inrng(x, y, a) || inrng(x, y, b)); } struct data { int x = 0, y = 0; }; int cases; map<char, int> mp; void lipu_mira() { long long i, j, a, b, n, k, v, x, ans = 0, now; a = _L(); b = _L(); k = _L(); if (a > b) swap(a, b); x = a; v = b - a; ans += x; k -= x; if (k < v) { puts( -1 ); return; } else if (k == v) { ans += (k - (k & 1)); } else { if (v & 1) ans += (k - 1); else { if (k & 1) { ans += k - 2; } else ans += k; } } printf( %lld n , ans); } int main() { int t = _I(); while (t--) lipu_mira(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 110; int n, m; string s; int a[maxn]; int main() { cin >> n >> m; int cnt = 0; while (n--) { cin >> s; if (s[0] == a ) { int x; cin >> x; int num = 0; bool flag = false; for (int i = 1; i + x - 1 <= m; i++) { num = 0; for (int j = i; j <= i + x - 1; j++) { if (a[j] == 0) num++; } if (num == x) { cnt++; flag = true; for (int j = i; j <= i + x - 1; j++) a[j] = cnt; cout << cnt << endl; break; } } if (!flag) cout << NULL << endl; } else if (s[0] == e ) { int x; cin >> x; if (x <= 0) cout << ILLEGAL_ERASE_ARGUMENT << endl; else { bool flag = false; for (int i = 1; i <= m; i++) { if (a[i] == x) { a[i] = 0; flag = true; } } if (!flag) cout << ILLEGAL_ERASE_ARGUMENT << endl; } } else { int k = 1; for (int i = 1; i <= m; i++) { if (a[i]) { a[k++] = a[i]; } } for (; k <= m; k++) a[k] = 0; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n][m], b[n][m]; vector<int> aa[1000]; vector<int> bb[1000]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; aa[i + j].push_back(a[i][j]); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> b[i][j]; bb[i + j].push_back(b[i][j]); } } int flag = 1; for (int i = 0; i < 1000; i++) { sort(aa[i].begin(), aa[i].end()); sort(bb[i].begin(), bb[i].end()); if (aa[i] != bb[i]) { flag = -1; break; } } if (flag == 1) cout << YES << endl; else cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; long long x[123456]; long long y[123456]; int main() { ios_base::sync_with_stdio(0); long long n, d; cin >> n >> d; if (n * (n - 1) / 2 <= d) { cout << no solution ; } else { for (int i = 0; i < n; ++i) cout << 0 << << i << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int ans[MAXN]; void solve(int l, int r) { if (l > r) return; cout << ? << l + 1 << << r + 1 << endl; int x, f; cin >> x >> f; int st = r - f + 1; int en = l + f - 1; if (st <= en) { for (int i = st, ThxDem = en + 1; i < ThxDem; ++i) ans[i] = x; solve(l, st - 1); solve(en + 1, r); } else { int m = (l + r) / 2; solve(l, m); solve(m + 1, r); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; solve(0, n - 1); cout << ! ; for (int i = 0, ThxDem = n; i < ThxDem; ++i) cout << ans[i] << ; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 250001; long long po[N]; long long n, p; int main() { cin >> n >> p; po[0] = 1; for (int i = 1; i <= n; i++) { po[i] = 1LL * po[i - 1] * i % p; } int ans = 0; for (int i = 1; i <= n; i++) { int s = 1ll * po[n - i] * (n - i + 1) % p * (n - i + 1) % p * po[i] % p; ans = (ans + s) % p; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const long double PI = 3.14159265359; const long long MOD = (long long)998244353ll; const long long MAXN = (long long)3e5 + 10; const long long INF = (long long)2242545357980376863; const long double EPS = (long double)1e-8; set<char> st; string s; bool check(string t) { for (int i = 0, j = t.size() - 1; i < j; i++, j--) { if (t[i] != t[j]) return false; } return true; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> s; long long n = s.size(); for (int i = 0; i < n / 2; i++) st.insert(s[i]); if (st.size() <= 1) return cout << Impossible , 0; string r = ; for (int i = 1; i < n - 1; i++) { r = ; for (int j = i; j < n; j++) r += s[j]; for (int j = 0; j < i; j++) r += s[j]; if (check(r) && s != r) return cout << 1, 0; } cout << 2; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; string s[n]; for (int i = 0; i < n; i++) cin >> s[i]; int ans = 0; for (int i = 0; i < m - 1; i++) { if (s[n - 1][i] == D ) ++ans; } for (int i = 0; i < n - 1; i++) { if (s[i][m - 1] == R ) ++ans; } cout << ans << endl; } int main() { int t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.precision(20); string s; cin >> s; double x = 10 * (s[0] - 0 ) + s[1] - 0 ; double y = 10 * (s[3] - 0 ) + s[4] - 0 ; if (x < 12) { cout << fixed << x * 30 + y / 2 << << 6 * y << setprecision(10) << ; } else { cout << fixed << (x - 12) * 30 + y / 2 << << 6 * y << setprecision(10) << ; } }
|
#include <bits/stdc++.h> using namespace std; vector<long long int> L, R, a; stack<long long int> same; signed main() { long long int n; cin >> n; a.resize(n, -1); for (long long int i = 0; i < n; i++) { long long int x; cin >> x; L.push_back(x); } for (long long int i = 0; i < n; i++) { long long int x; cin >> x; R.push_back(x); } for (long long int i = n, k = n; k > 0; i--) { for (long long int j = 0; j < n; j++) { if (L[j] == 0 && R[j] == 0 && a[j] == -1) { a[j] = i; k--; same.push(j); } } if (same.empty()) { cout << NO n ; return 0; } while (!same.empty()) { for (long long int j = same.top(); j < n; j++) { if (a[j] == -1) L[j]--; } for (long long int j = same.top(); j >= 0; j--) { if (a[j] == -1) R[j]--; } same.pop(); } } cout << YES n ; for (auto i : a) cout << i << ; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; const long long M = 1e7 + 1000; const long long mod = 1e9 + 7; const long long INF = 1e18; const long long inf = -1e18; bool isprime(long long x) { if (x == 1) return false; long long y = sqrt(x); for (int i = 2; i <= y; i++) { if (x % i == 0) { return false; } } return true; } long long bin_pow(long long a, long long b) { if (b == 0) return 1; if (b == 1) return a; if (a == 0) return 0; if (a == 1) return a; if (b % 2 == 0) { long long pw = bin_pow(a, b / 2); return pw * pw; } else { return bin_pow(a, b - 1) * a; } } const long double pi = acos(-1); long long n, m, x; long long us[5 * N]; vector<long long> ans; int main() { cin >> n >> x; us[0] = 1; ans.push_back(0); long long m = (1 << n); for (int i = 1; i < m; i++) { if (us[i ^ x] != 1) { us[i] = 1; ans.push_back(i); } } cout << ans.size() - 1 << n ; for (int i = 1; i < ans.size(); i++) cout << (ans[i] ^ ans[i - 1]) << ; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int INF = (int)1e9; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return a > val ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } inline long long isqrt(long long k) { long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } const int maxn = 100010; int n, m; vector<int> adj[maxn]; int a[maxn]; int d[maxn]; int tin[maxn]; int tms; int dfs(int u) { tin[u] = tms++; int res = tin[a[u]]; for (int i = (0); i < (int((adj[u]).size())); i++) { int v = adj[u][i]; int r = dfs(v); if (r <= tin[u] && r != tin[a[u]]) { cout << -1 n ; exit(0); } chkmin(res, r); } return res; } void solve() { cin >> n >> m; for (int i = (0); i < (m); i++) { int u, v; cin >> u >> v; u--; v--; adj[u].push_back(v); d[v]++; } for (int i = (0); i < (n); i++) cin >> a[i], a[i]--; for (int i = (0); i < (n); i++) if (!d[i]) { dfs(i); } vector<pair<int, int> > res; for (int i = (0); i < (n); i++) { res.push_back(make_pair(tin[a[i]], a[i])); } sort((res).begin(), (res).end()); (res).erase(unique((res).begin(), (res).end()), (res).end()); cout << int((res).size()) << n ; for (int i = (int((res).size())) - 1; i >= (0); i--) cout << res[i].second + 1 << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e9 + 7; const vector<long long int> dx = {1, -1, 0, 0}; const vector<long long int> dy = {0, 0, 1, -1}; void solve() { string s; cin >> s; long long int k = s.length(); long long int cnt = 1; char cur = s[0]; long long int zer = 0; if (s[0] == 0 ) zer++; long long int one = 0; long long int prefix[1010]; prefix[0] = zer; for (long long int i = 1; i < k; i++) { if (cur != s[i]) { cnt++; cur = s[i]; } if (s[i] == 0 ) { zer++; } prefix[i] = zer; } one = k - zer; long long int least = min(zer, one); for (long long int i = 0; i < k; i++) { least = min(least, i + 1 - prefix[i] + (zer - prefix[i])); least = min(least, prefix[i] + one - (i + 1 - prefix[i])); } cout << least << n ; } int main(void) { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long int t; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 200100; int n, x, y, q; char c; long long a[N], k[N], M[N], A[N]; set<int> s; void update(int x, long long mul, long long val) { while (x < n) { M[x] += mul; A[x] += val; x |= (x + 1); } } void add(int l, int r, long long v) { update(l, v, -v * (l - 1)); update(r, -v, v * r); } long long query(int x) { int w = x; long long mul = 0; long long val = 0; while (x >= 0) { mul += M[x]; val += A[x]; x = (x & (x + 1)) - 1; } return mul * w + val; } long long get(int x) { return query(x) - query(x - 1); } int main() { scanf( %d , &n); memset(M, 0, sizeof M); memset(A, 0, sizeof A); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); add(i, i, a[i]); } for (int i = 0; i + 1 < n; i++) { scanf( %lld , &k[i]); if (a[i + 1] - a[i] != k[i]) { s.insert(i + 1); } } s.insert(n); scanf( %d , &q); for (int i = 0; i < q; i++) { scanf( %c %d %d , &c, &x, &y); x--; if (c == + ) { while (y != 0) { int nxt = *s.lower_bound(x + 1); add(x, nxt - 1, y); if (x != 0 && get(x) - get(x - 1) != k[x - 1]) { s.insert(x); } else if (s.count(x) != 0) { s.erase(x); } if (nxt >= n) { break; } if (get(nxt) - get(nxt - 1) >= k[nxt - 1]) { break; } y = k[nxt - 1] - (get(nxt) - get(nxt - 1)); x = nxt; } } else if (c == s ) { y--; printf( %lld n , query(y) - query(x - 1)); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a, b, x, y, fen, k; inline int gcd(int x, int y) { if (y == 0) return x; return gcd(y, x % y); } int main() { scanf( %d%d%d%d , &a, &b, &x, &y); k = gcd(x, y); x /= k; y /= k; fen = min(a / x, b / y); printf( %d %d n , fen * x, fen * y); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; const int MOD = 1000000007; int n, m, k = 0, c = 0, q; map<int, char> mp; map<char, int> cnt; int main() { string s; cin >> s; bool f1 = 0, f2 = 0, f3 = 0, f4 = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == G ) { f1 = 1; mp[i % 4] = s[i]; } if (s[i] == Y ) { f2 = 1; mp[i % 4] = s[i]; } if (s[i] == R ) { f3 = 1; mp[i % 4] = s[i]; } if (s[i] == B ) { f4 = 1; mp[i % 4] = s[i]; } } if (!f1) { for (int i = 0; i < 4; i++) { if (mp.find(i) == mp.end()) { mp[i] = G ; break; } } } if (!f2) { for (int i = 0; i < 4; i++) { if (mp.find(i) == mp.end()) { mp[i] = Y ; break; } } } if (!f3) { for (int i = 0; i < 4; i++) { if (mp.find(i) == mp.end()) { mp[i] = R ; break; } } } if (!f4) { for (int i = 0; i < 4; i++) { if (mp.find(i) == mp.end()) { mp[i] = B ; break; } } } string s1 = ; for (int i = 0; i < s.length(); i++) { if (s[i] == ! ) { cnt[mp[i % 4]]++; } } cout << cnt[ R ] << << cnt[ B ] << << cnt[ Y ] << << cnt[ G ]; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, r1, r2, r3, d; long long a[1000003]; long long dp[1000003][2]; long long f(int i, int j) { if (i == n) return -d; if (dp[i][j] != -1) return dp[i][j]; long long res1 = 1e18, res2 = 1e18; if (j == 0) { res1 = f(i + 1, 0) + a[i] * r1 + r3 + d; res2 = f(i + 1, 1) + min(a[i] * r1 + 2 * r1, r2 + r1) + 3 * d; } if (j == 1) { if (i != n - 1) res1 = f(i + 1, 0) + min(a[i] * r1 + r3, min(a[i] * r1 + 2 * r1, r2 + r1)) + d; else res1 = f(i + 1, 0) + min(a[i] * r1 + r3, min(a[i] * r1 + 2 * r1 + d, r2 + r1 + d)); } return dp[i][j] = min(res1, res2); } int main() { cin >> n >> r1 >> r2 >> r3 >> d; for (int i = 0; i < n; i++) { cin >> a[i]; } memset(dp, -1, sizeof dp); cout << f(0, 0) << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, d; int stone[30000 + 3]; int f[30000 + 3][2 * 300 + 3]; int p[30000 + 3]; int main(int argc, char* argv[]) { scanf( %d %d , &n, &d); for (int i = 0; i < n; i++) { int tmp; scanf( %d , &tmp); stone[tmp]++; p[i] = tmp; } for (int curr = 30000; curr >= 0; curr--) { for (int add = -300; add <= 300; add++) { int addfix = 300 + add; if (curr == 0) { f[curr][addfix] = f[d][addfix] + stone[d]; continue; } int last = d + add; if (last <= 0) { continue; } if (curr == 29889 && last == 1) { printf( ); } if (curr == 19 && last == 9 || curr == 10 && last == 10) { printf( ); } if (last - 1 > 0 && curr + last - 1 <= 30000 && f[curr][addfix] < f[curr + last - 1][addfix - 1] + stone[curr + last - 1]) { f[curr][addfix] = f[curr + last - 1][addfix - 1] + stone[curr + last - 1]; } if (last > 0 && curr + last <= 30000 && f[curr][addfix] < f[curr + last][addfix] + stone[curr + last]) { f[curr][addfix] = f[curr + last][addfix] + stone[curr + last]; } if (curr + last + 1 <= 30000 && f[curr][addfix] < f[curr + last + 1][addfix + 1] + stone[curr + last + 1]) { f[curr][addfix] = f[curr + last + 1][addfix + 1] + stone[curr + last + 1]; } } } printf( %d n , f[0][300 + 0]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int t; cin >> t; while (t--) { int k1 = 0, k2 = 0; string s; cin >> s; if (s[0] == 0 ) k2++; if (s[0] == 1 ) k1++; for (int i = 1; i < s.size(); i++) { if (s[i - 1] != s[i]) { if (s[i] == 1 ) k1++; if (s[i] == 0 ) k2++; } } if (k1 > 3) cout << 2 << endl; else if (k1 == 0) cout << 1 << endl; else if (k2 == 0) cout << 0 << endl; else if (k2 > 2) cout << 2 << endl; else cout << k2 << endl; } }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932; const double eln = 2.718281828459045; vector<int> a[200005]; int p[200005], b[200005], od[200005]; void second(int m, int dah) { p[m] = dah; b[m] = 1; for (int i = 0; i < a[m].size(); ++i) { if (!b[a[m][i]]) { second(a[m][i], dah + 1); } } } int main() { ios::sync_with_stdio(false); int n, x, y; cin >> n; for (int i = 0; i < n - 1; ++i) { cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } second(1, 1); int maxx = 0; int first = 0, st, hh; for (int i = 0; i < n; ++i) { cin >> x; if (p[x] > maxx) { hh = od[x]; maxx = p[x]; st = 1; for (int j = 0; j < a[x].size(); ++j) { if (!od[a[x][j]]) { od[a[x][j]] = st; } } } else if (p[x] == maxx) { if (od[x] < hh) { cout << No ; return 0; } hh = max(hh, od[x]); st++; for (int j = 0; j < a[x].size(); ++j) { if (!od[a[x][j]]) { od[a[x][j]] = st; } } } else if (p[x] < maxx) { cout << No ; return 0; } } cout << Yes ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 400010; pair<int, int> a[maxn], b[maxn]; int tot, cnt[110]; double qpow(double a, int x) { double res = 1.0; while (x) { if (x & 1) res = res * a; a = a * a; x >>= 1; } return res; } int main() { int N, M, i, j, A, H, L, R; scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scanf( %d%d%d%d , &A, &H, &L, &R); b[++tot] = make_pair(A - H, L); b[++tot] = make_pair(A, -L); b[++tot] = make_pair(A + 1, R); b[++tot] = make_pair(A + H + 1, -R); } for (int i = 1; i <= M; i++) scanf( %d%d , &a[i].first, &a[i].second); sort(a + 1, a + M + 1); sort(b + 1, b + tot + 1); double ans = 0; int pos = 1; for (int i = 1; i <= M; i++) { while (pos <= tot && b[pos].first <= a[i].first) { if (b[pos].second > 0) cnt[b[pos].second]++; if (b[pos].second < 0) cnt[-b[pos].second]--; pos++; } if (!cnt[100]) { double p = a[i].second; for (int j = 1; j <= 99; j++) p *= qpow(0.01 * (100 - j), cnt[j]); ans += p; } } printf( %.12lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, sum; int s[200010]; vector<pair<int, int> > G[200010]; int fa[200010]; int vis[200010]; int ans[200010]; void dfs(int x, int fa, int id) { vis[x] = 1; for (int i = 0; i < G[x].size(); i++) { int to = G[x][i].first; int id = G[x][i].second; if (vis[to] == 0) dfs(to, x, id); } if (s[x] != 0) { if (id > 0) ans[id] -= s[x]; else ans[-id] += s[x]; s[fa] += s[x]; s[x] = 0; } } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> s[i], sum += s[i], s[i] = -s[i]; if (sum) return puts( Impossible ), 0; puts( Possible ); cin >> m; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; G[x].push_back(make_pair(y, i)); G[y].push_back(make_pair(x, -i)); } dfs(1, 0, 0); for (int i = 1; i <= m; i++) cout << ans[i] << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); vector<vector<long long>> a(n); for (int i = 0; i < n; i++) { int m; long long p; scanf( %d , &m); scanf( %lld , &p); a[m].push_back(p); } vector<int> cnt(n); cnt[0] = a[0].size(); for (int i = 1; i < n; i++) { cnt[i] = cnt[i - 1] + a[i].size(); } long long res = 0; multiset<long long> s; int ch = 0; for (int i = n - 1; i > 0; i--) { for (long long j : a[i]) s.insert(j); int temp = 0; for (int j = 0; j < i - ch - cnt[i - 1]; j++) { long long p = *(s.begin()); s.erase(s.begin()); res += p; temp++; } ch += temp; } printf( %lld n , res); } }
|
#include <bits/stdc++.h> using namespace std; int ccount[1000000 + 10]; bitset<1000000 + 100> v; unsigned long int N; vector<int> primes; int cc = 0; int primeSize; void generatePrimes() { N = 1000000 + 2; cc = 0; v.set(1); unsigned long int i, j; for (i = 2; i < N + 1; i++) { if (!v[(int)i]) { for (j = i * i; j < N + 1; j += i) { v.set(j); } primes.push_back(i); ccount[(int)i] = cc; cc++; } } primeSize = cc; } bool isPrime(int n) { return !v[n]; } char a[1000][1000]; int l; int preCalc[1000000 + 1000]; int go(int level) { if (level == l) return 1; int ten = 1; for (int i = 0; i < l - 1; i++) ten *= 10; int val = 0; for (int i = 0; i < level; i++) { val += ((a[level][i] - 0 ) * ten); ten /= 10; } int x = preCalc[val]; int target = 1; for (int i = 0; i < l - level; i++) target *= 10; target += val; int ans = 0; while (x < primeSize && primes[x] < target) { int m = primes[x]; for (int i = l - 1; i >= level; i--) { a[i][level] = a[level][i] = (char)((m % 10) + 0 ); m /= 10; } ans += go(level + 1); x++; } return ans; } int ans[1000000 + 100]; int main() { int t; scanf( %d , &t); generatePrimes(); int last = 1 << 25; for (int i = 1000000 - 1; i > -1; i--) { ans[i] = -1; if (isPrime(i)) { last = ccount[i]; } preCalc[i] = last; } while (t-- > 0) { scanf( %s , &a[0][0]); l = 0; while (a[0][l] != 0 ) l++; int ten = 1; int v = 0; for (int i = l - 1; i > -1; i--) { v += (int)(a[0][i] - 0 ) * ten; ten *= 10; } for (int i = 0; i < l; i++) a[i][0] = a[0][i]; if (ans[v] == -1) ans[v] = go(1); printf( %d n , ans[v]); } }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long n; cin >> n; map<pair<long long, long long>, set<pair<long long, long long>>> mp; for (long long i = 1; i <= n; i++) { long long x, y, z; cin >> x >> y >> z; mp[{x, y}].insert({z, i}); } map<long long, set<pair<long long, long long>>> mp2; for (auto &k : mp) { while (k.second.size() > 1) { cout << (*k.second.begin()).second << ; k.second.erase(k.second.begin()); cout << (*k.second.begin()).second << endl; k.second.erase(k.second.begin()); } if (k.second.size() == 1) mp2[k.first.first].insert({k.first.second, (*k.second.begin()).second}); } vector<long long> ind; for (auto &k : mp2) { while (k.second.size() > 1) { cout << (*k.second.begin()).second << ; k.second.erase(k.second.begin()); cout << (*k.second.begin()).second << endl; k.second.erase(k.second.begin()); } if (k.second.size() == 1) ind.push_back((*k.second.begin()).second); } for (long long i = 0; (unsigned)i < ind.size(); i += 2) { cout << ind[i] << << ind[i + 1] << endl; } }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long n, p, a[N], C[N], st, End; void in() { cin >> n >> p; for (long long i = 0; i <= n - 1; i++) cin >> a[i]; sort(a, a + n); } long long bns(long long lim) { long long low = 0, high = n - 1, res = -1; while (low <= high) { long long mid = (low + high) / 2; if (a[mid] <= lim) low = mid + 1, res = mid; else high = mid - 1; } return res + 1; } long long bns_low() { long long low = 1, high = 1e15, res = -1; while (low <= high) { long long mid = (low + high) / 2; bool kq = true; for (long long i = 0; i <= n - 1; i++) if (mid + i >= a[i]) ; else kq = false; if (kq) high = mid - 1, res = mid; else low = mid + 1; } return res; } long long bns_high() { long long low = st, high = 1e15, res = -1; while (low <= high) { long long mid = (low + high) / 2; bool kq = true; for (long long i = 0; i <= n - 1; i++) { C[i] = bns(i + mid) - i; if (C[i] <= 0 || C[i] >= p) kq = false; } if (kq) low = mid + 1, res = mid; else high = mid - 1; } return res; } void process() { st = bns_low(); End = bns_high(); if (st == -1 || End == -1) { cout << 0; exit(0); } cout << End - st + 1 << n ; for (long long i = st; i <= End; i++) cout << i << ; } int main() { if (fopen( trash.inp , r )) freopen( trash.inp , r , stdin), freopen( trash.out , w , stdout); ios ::sync_with_stdio(0), cin.tie(0), cout.tie(0); in(); process(); }
|
#include <bits/stdc++.h> using namespace std; int n; map<pair<pair<bool, int>, pair<int, int>>, int> dp; int recurse(bool asc, int cx, int cy, int hm) { if (hm < 0 || cx > n) return 0; if (hm == 0) { if (asc && cx == n) return 1; else return 0; } pair<pair<bool, int>, pair<int, int>> index = make_pair(make_pair(asc, hm), make_pair(cx, cy)); if (dp.count(index)) { return dp[index]; } else { int ans; if (asc) { if (cy == 1) { ans = recurse(false, cx + 1, 2, hm) + recurse(false, cx + 1, 3, hm) + recurse(false, cx + 1, 4, hm) + recurse(false, cx + 2, 3, hm) + 2 * recurse(false, cx + 2, 4, hm) + recurse(false, cx + 3, 4, hm); } else if (cy == 2) { ans = recurse(false, cx + 1, 3, hm) + recurse(false, cx + 1, 4, hm) + recurse(false, cx + 2, 4, hm); } else if (cy == 3) { ans = recurse(false, cx + 1, 4, hm); } else ans = 0; } else { if (cy == 4) { ans = recurse(true, cx + 1, 3, hm - 1) + recurse(true, cx + 1, 2, hm - 1) + recurse(true, cx + 1, 1, hm - 1) + recurse(true, cx + 2, 2, hm - 1) + 2 * recurse(true, cx + 2, 1, hm - 1) + recurse(true, cx + 3, 1, hm - 1); } else if (cy == 3) { ans = recurse(true, cx + 1, 2, hm - 1) + recurse(true, cx + 1, 1, hm - 1) + recurse(true, cx + 2, 1, hm - 1); } else if (cy == 2) { ans = recurse(true, cx + 1, 1, hm - 1); } else ans = 0; } dp[index] = ans; return ans; } } int main() { int t; cin >> n >> t; cout << recurse(true, 1, 1, t) + recurse(true, 1, 2, t) + recurse(true, 1, 3, t) << endl; }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long po(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int countP(int n, int k) { if (n == 0 || k == 0 || k > n) return 0; if (k == 1 || k == n) return 1; return k * countP(n - 1, k) + countP(n - 1, k - 1); } void solve() { long long fac = 1; long long n; cin >> n; long long xo = n; if (n == 2) cout << 1 << n ; else { for (long long i = 1; i <= n; i++) { fac = fac * i; } fac *= 2; fac /= n; fac /= n; cout << fac << n ; } } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int p[200008] = {0}; int main() { ios_base::sync_with_stdio(false); long long int n, z, x, i; long double p, q; cin >> n; for (i = 0; i < n; i++) { cin >> x; z = x * x - 4 * x; if (z < 0) { cout << N n ; continue; } cout << Y ; p = (long double)(x + sqrt(z)) / 2; q = (long double)(x - sqrt(z)) / 2; cout << setprecision(20) << p << << setprecision(20) << q << endl; } }
|
#include <bits/stdc++.h> using namespace std; string str[500005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> str[i]; for (int i = n - 2; i >= 0; i--) { if (str[i] > str[i + 1]) { string temp; for (int j = 0; j < str[i].length(); j++) { if (str[i + 1].length() < j || str[i][j] > str[i + 1][j]) break; temp += str[i][j]; } str[i] = temp; } } for (int i = 0; i < n; i++) cout << str[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read(register T& t) { register T f = 1; register char ch = getchar(); t = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -f; ch = getchar(); } while (ch >= 0 && ch <= 9 ) t = t * 10 + ch - 0 , ch = getchar(); t *= f; return t; } template <typename T, typename... Args> inline void read(T& t, Args&... args) { read(t); read(args...); } const long long p = 998244353; inline long long power(register long long x, register long long k = p - 2) { register long long re = 1; for (; k; k >>= 1, x = x * x % p) if (k & 1) re = re * x % p; return re; } long long S; long long mul[77]; long long ans = 0; long long calc(long long re, int l, int r, int n) { if (l > r) swap(l, r); static long long f[55][105][2]; if (re & 1) return 0; memset(f, 0, sizeof(f)); f[0][0][0] = 1; for (int i = 0; i <= 52; i++) for (int j = 0; j <= n; j++) if (re >> (i + 1) & 1) { f[i + 1][j][0] += f[i][j][1]; if (i + 1 <= r) f[i + 1][j + 1][0] += f[i][j][0]; if (i + 1 <= l) f[i + 1][j + 1][0] += f[i][j][0]; if (i + 1 <= l) f[i + 1][j + 2][1] += f[i][j][1]; } else { f[i + 1][j][0] += f[i][j][0]; if (i + 1 <= r) f[i + 1][j + 1][1] += f[i][j][1]; if (i + 1 <= l) f[i + 1][j + 1][1] += f[i][j][1]; if (i + 1 <= l) f[i + 1][j + 2][1] += f[i][j][0]; } return f[53][n][0]; } int main() { read(S); for (int i = 0; i <= 50; i++) mul[i] = 1ll << i; for (int i = 1; i <= 50; i++) { long long x = S / (mul[i] - 1); if (x == 0) break; if ((x + 1) * (mul[i] - 1) - i < S) continue; long long re = S - x * (mul[i] - 1); for (int j = i - 1; j >= 1; j--) if (re >= mul[j] - 1) re -= mul[j] - 1; if (re == 0) ans++; } for (int l = 2; l <= 50; l++) for (int r = 2; r <= 50; r++) { long long Base = mul[l] + mul[r] - 3; long long x = (S - (mul[r - 1] - 1)) / Base; if (x <= 0) continue; long long re = S - (x * Base + mul[r - 1] - 1); for (int n = 0; n <= l + r - 3; n++) ans += calc(re + n, l - 2, r - 2, n); } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, x, p, l, r, e, ans, set; l = r = e = ans = 0; cin >> n >> x; vector<long long int> a(n); set = 0; m = (n + 1) / 2; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] < x) l++; if (a[i] > x) r++; if (a[i] == x) e++; } if (e == 0) ans++; else e--; set = 1; if (e >= abs(r - l)) { cout << ans << n ; return 0; } if (l < r) { l += e; e = 0; cout << ans + (r - 1) - l << endl; } else { r += e; e = 0; cout << ans + l - r << endl; } }
|
#include <bits/stdc++.h> using namespace std; bool b[33333]; vector<int> pri; vector<pair<int, int> > fac; int n; void init() { for (int i = 2; i < 33333; ++i) { if (!b[i]) { pri.push_back(i); for (int j = i + i; j < 33333; j += i) { b[j] = false; } } } } long long minans = 10000000000000000ll; long long maxans = 0; void dfs2(int x, int now, int last) { if (x == fac.size()) { long long t = (long long)(last + 2) * (now + 2) * (n / last / now + 1) - n; minans = min(minans, t); maxans = max(maxans, t); t = (long long)(last + 1) * (now + 2) * (n / last / now + 2) - n; minans = min(minans, t); maxans = max(maxans, t); return; } int t = fac[x].second; for (; fac[x].second >= 0; --fac[x].second) { dfs2(x + 1, now, last); now *= fac[x].first; } fac[x].second = t; } void dfs(int x, int now) { if (x == fac.size()) { dfs2(0, 1, now); return; } int t = fac[x].second; for (; fac[x].second >= 0; --fac[x].second) { dfs(x + 1, now); now *= fac[x].first; } fac[x].second = t; } int main() { init(); cin >> n; int orgn = n; for (int i = 0; i < pri.size(); ++i) { if (n % pri[i] == 0) { int s = 0; while (n % pri[i] == 0) { s++; n /= pri[i]; } fac.push_back(make_pair(pri[i], s)); } } if (n != 1) fac.push_back(make_pair(n, 1)); n = orgn; dfs(0, 1); cout << minans << << maxans << endl; ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long l[1001]; long long r[1001]; long long f = 0; long long ar[1005] = {0}; for (int i = 0; i < n; ++i) { cin >> l[i]; if (l[i] > i) f = 1; } for (int i = 0; i < n; ++i) { cin >> r[i]; if (r[i] > n - i - 1) f = 1; } long long sum = 0; long long lim = (n * (n - 1)) / 2; for (int i = 0; i < n; ++i) { ar[i] = n - (l[i] + r[i]); sum += (l[i] + r[i]); if (ar[i] <= 0 || sum > lim) { f = 1; break; } } int lc, rc; for (int i = 0; i < n; ++i) { lc = rc = 0; for (int j = 0; j < i; ++j) { if (ar[j] > ar[i]) lc++; } for (int j = i + 1; j < n; ++j) { if (ar[j] > ar[i]) rc++; } if (lc != l[i] || rc != r[i]) { f = 1; break; } } if (f == 1) { cout << NO ; } else { cout << YES n ; for (int i = 0; i < n; ++i) { cout << ar[i] << ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void boost() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); } string s, fp, sp; bool ok = 0; int pw; void checkF() { if (!(int)fp.size()) { fp = ; return; } int it = 0; string nw = ; string buff = ; while (fp[it] == 0 && it < (int)fp.size()) it++; if (it < (int)fp.size()) nw += fp[it]; for (int i = it + 1; i < (int)fp.size(); i++) buff += fp[i], pw++; sp = buff + sp; fp = nw; } void checkS() { string buff = ; int it = (int)sp.size() - 1; while (sp[it] == 0 && it >= 0) it--; for (int i = 0; i <= it; i++) buff += sp[i]; sp = buff; } int main() { boost(); cin >> s; for (int i = 0; i < (int)s.size(); i++) { if (s[i] == . ) ok = 1; else { if (!ok) fp += s[i]; else sp += s[i]; } } checkF(); checkS(); if (fp == ) { pw = -(int)sp.size(); swap(fp, sp); checkF(); checkS(); } cout << fp; if (sp != ) cout << . << sp; if (pw) cout << E << pw; }
|
#include <bits/stdc++.h> using namespace std; int main() { int N, M; scanf( %d%d , &N, &M); if (M == 3 && N > 4) { puts( -1 ); return 0; } for (int i = 1; i <= M; ++i) { printf( %d %d n , i - 101, i * i); } N -= M; for (int i = 1; i <= N; ++i) { printf( %d %d n , -i + 101, -i * i); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 200005; int a[N], f[N]; long long dis[N], pos[N], res[N]; int n; void add(long long *b, int x, long long v) { for (int i = x; i <= n; i += i & -i) b[i] += v; } long long qry(long long *b, int x) { long long ret = 0; for (int i = x; i > 0; i ^= i & -i) ret += b[i]; return ret; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], f[a[i]] = i; long long t = 0; for (int i = 1; i <= n; i++) { int p = f[i]; t += qry(pos, n) - qry(pos, p); add(pos, p, 1); add(dis, p, p); int j = (i + 1) / 2, l = 1, r = n; while (l < r) { int m = (l + r) >> 1; if (qry(pos, m) >= j) r = m; else l = m + 1; } int x = l; long long r1 = j - 1, r2 = i - j, cur = t; if (r1 > 0) cur += r1 * x - qry(dis, x - 1) - r1 * (r1 + 1) / 2; if (r2 > 0) cur += (qry(dis, n) - qry(dis, x)) - r2 * x - r2 * (r2 + 1) / 2; res[i] = cur; } for (int i = 1; i <= n; i++) cout << res[i] << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int c1; struct state { int h1, a1, h2, a2, level; int laststate; state() {} state(int a, int b, int c, int d, int e, int f) : h1(a), a1(b), h2(c), a2(d), level(e), laststate(f) {} }; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int N; cin >> N; vector<unsigned long long> a(N); for (int i = 0; i < N; ++i) { cin >> a[i]; } unsigned long long prfx = 0; map<int, unsigned long long> removals; map<int, unsigned long long> rcount; unsigned long long nans = 0, pans = 0; for (int i; i < N; ++i) { unsigned long long tp = ((unsigned long long)a[i]) * i; if (tp > prfx) pans += tp - prfx; else nans += prfx - tp; if (removals.count(a[i]) != 0) { unsigned long long ot = ((unsigned long long)a[i]) * rcount[a[i]]; unsigned long long rmls = removals[a[i]]; if (ot > rmls) nans += ot - rmls; else pans += rmls - ot; } prfx += a[i]; if (rcount.count(a[i] - 1) == 0) rcount[a[i] - 1] = 0; if (rcount.count(a[i] + 1) == 0) rcount[a[i] + 1] = 0; if (rcount.count(a[i]) == 0) rcount[a[i]] = 0; if (removals.count(a[i] - 1) == 0) removals[a[i] - 1] = 0; if (removals.count(a[i] + 1) == 0) removals[a[i] + 1] = 0; if (removals.count(a[i]) == 0) removals[a[i]] = 0; removals[a[i] - 1] += a[i]; removals[a[i] + 1] += a[i]; removals[a[i]] += a[i]; ++rcount[a[i] + 1]; ++rcount[a[i] - 1]; ++rcount[a[i]]; if (pans > nans) { pans -= nans; nans = 0; } else { nans -= pans; pans = 0; } } if (pans > 0 || (pans == 0 && nans == 0)) cout << pans << endl; else cout << - << nans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 3e3 + 5; int n, l[MX], r[MX], q[2 * MX]; int dp[2 * MX][2 * MX]; vector<int> sg[2 * MX]; void inline upmx(int& x, int y) { if (y > x) x = y; } void solve() { cin >> n; for (int i = (0); i < (n); ++i) { int li, ri; cin >> li >> ri; l[i] = li; q[2 * i] = li; r[i] = ri; q[2 * i + 1] = ri; } sort(q, q + 2 * n); int m = unique(q, q + 2 * n) - q; for (int i = (0); i < (n); ++i) { l[i] = lower_bound(q, q + m, l[i]) - q; r[i] = lower_bound(q, q + m, r[i]) - q; } for (int j = (0); j < (m); ++j) { sg[j].clear(); memset((dp[j]), 0, (m) * sizeof((dp[j])[0])); } for (int i = (0); i < (n); ++i) sg[l[i]].push_back(r[i]); for (int j = (0); j < (m); ++j) sort((sg[j]).begin(), (sg[j]).end()); for (int i = (m)-1; i >= (0); --i) { for (int j = (i + 1); j < (m); ++j) dp[i][j] = dp[i + 1][j]; for (auto& j : (sg[i])) { dp[i][j] += 1; for (int k = (j + 1); k < (m); ++k) { upmx(dp[i][k], dp[i][j] + dp[j + 1][k]); } } } cout << dp[0][m - 1] << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int n, c; long long a[3001]; pair<int, int> sol[3001]; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; c = 0; for (int i = 0; i < n; ++i) { int mn = i; for (int j = i + 1; j < n; ++j) { if (a[mn] > a[j]) { mn = j; } } if (a[mn] < a[i]) { swap(a[i], a[mn]); sol[c] = pair<int, int>(i, mn); ++c; } } cout << c << endl; for (int i = 0; i < c; ++i) { cout << sol[i].first << << sol[i].second << endl; } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.