func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long int dp[101000]; int main(int argc, char const *argv[]) { int t, a, b, k; scanf( %d%d , &t, &k); dp[0] = 1; for (int i = 1; i <= 100000; i++) { dp[i] = (dp[i] + dp[i - 1]) % 1000000007; if (i >= k) dp[i] = (dp[i] + dp[i - k]) % 1000000007; } dp[0] = 0; for (int i = 2; i <= 100000; i++) { dp[i] = (dp[i] + dp[i - 1]) % 1000000007; } while (t--) { scanf( %d%d , &a, &b); long long int ans = (dp[b] - dp[a - 1] + 1000000007) % 1000000007; cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; struct SegTree { int L, R, P, DELTA; struct node { int d; bool zero; } v[212345 * 4]; inline void set_zero(int x) { v[x].zero = 1; v[x].d = 0; } inline void fix(int x, int d) { v[x].zero = 0; v[x].d += d; } inline void rep(int x) { if (v[x].zero) { set_zero(x * 2); set_zero(x * 2 + 1); v[x].zero = 0; } else { fix(x * 2, v[x].d); fix(x * 2 + 1, v[x].d); v[x].d = 0; } } void update(int x, int l, int r) { if (l > R || r < L) return; if (L <= l && r <= R) { if (l < r) rep(x); else v[x].zero = 0; v[x].d += DELTA; return; } int m = (l + r) / 2; rep(x); update(x * 2, l, m); update(x * 2 + 1, m + 1, r); } void gao_zero(int x, int l, int r) { if (l > R || r < L) return; if (L <= l && r <= R) { set_zero(x); return; } int m = (l + r) / 2; rep(x); gao_zero(x * 2, l, m); gao_zero(x * 2 + 1, m + 1, r); } int add(int x, int y) { if (~y) return x + y; return -1; } int query(int x, int l, int r) { if (v[x].zero) return -1; if (l == r) return v[x].d; int m = (l + r) / 2; if (P <= m) return add(v[x].d, query(x * 2, l, m)); else return add(v[x].d, query(x * 2 + 1, m + 1, r)); } void up(int l, int r, int d) { L = l, R = r, DELTA = d; update(1, 1, n); } void zero(int l, int r) { L = l, R = r; gao_zero(1, 1, n); } int qr(int p) { P = p; return query(1, 1, n); } } tree; int x[212345], len[212345]; vector<pair<int, int> > qu[212345]; int ans[212345], nxt[212345]; int L[212345], D[212345], id[212345], top = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d%d , x + i, len + i); int q; scanf( %d , &q); for (int i = 0; i < int(q); i++) { int u, v; scanf( %d%d , &u, &v); qu[u].push_back(make_pair(v, i)); } nxt[n] = -1; for (int i = n - 1; i >= 1; --i) { int j = i + 1; while (~j && x[j] + len[j] <= x[i] + len[i]) j = nxt[j]; nxt[i] = j; } for (int i = n; i >= 1; --i) { if (nxt[i] == -1) { } else { while (top > 0 && id[top] < nxt[i]) { tree.up(L[top], n, -D[top]); --top; } if (x[i] + len[i] >= x[nxt[i]]) { } else { tree.up(nxt[i], n, x[nxt[i]] - x[i] - len[i]); ++top; L[top] = nxt[i]; D[top] = x[nxt[i]] - x[i] - len[i]; id[top] = i; } } for (auto x : qu[i]) ans[x.second] = tree.qr(x.first); } for (int i = 0; i < int(q); i++) printf( %d n , ~ans[i] ? ans[i] : 0); } |
#include <bits/stdc++.h> using namespace std; const int N = 510; struct node { int x, y; } d[2]; int n, m, T, g[N][N]; int f, len, root, fa[N], size[N], son[N][2], t[4]; int a[N][N][2], b[N][N][2], dt[N], tmp, tmp2, ans; int Abs(int x) { return x > 0 ? x : -x; } void init() { int i, j; for (i = 1; i <= n; i++) for (j = 2; j <= m; j++) if (g[i][j] > g[i][j - 1]) a[i][j][0] = a[i][j - 1][0] + t[1]; else if (g[i][j] < g[i][j - 1]) a[i][j][0] = a[i][j - 1][0] + t[2]; else if (g[i][j] == g[i][j - 1]) a[i][j][0] = a[i][j - 1][0] + t[0]; for (i = 1; i <= n; i++) for (j = m - 1; j; j--) if (g[i][j] > g[i][j + 1]) a[i][j][1] = a[i][j + 1][1] + t[1]; else if (g[i][j] < g[i][j + 1]) a[i][j][1] = a[i][j + 1][1] + t[2]; else if (g[i][j] == g[i][j + 1]) a[i][j][1] = a[i][j + 1][1] + t[0]; for (j = 1; j <= m; j++) for (i = 2; i <= n; i++) if (g[i][j] > g[i - 1][j]) b[i][j][0] = b[i - 1][j][0] + t[1]; else if (g[i][j] < g[i - 1][j]) b[i][j][0] = b[i - 1][j][0] + t[2]; else if (g[i][j] == g[i - 1][j]) b[i][j][0] = b[i - 1][j][0] + t[0]; for (j = 1; j <= m; j++) for (i = n - 1; i; i--) if (g[i][j] > g[i + 1][j]) b[i][j][1] = b[i + 1][j][1] + t[1]; else if (g[i][j] < g[i + 1][j]) b[i][j][1] = b[i + 1][j][1] + t[2]; else if (g[i][j] == g[i + 1][j]) b[i][j][1] = b[i + 1][j][1] + t[0]; } int area(int x1, int y1, int x2, int y2) { int tmp = 0; tmp += a[x1][y2][0] - a[x1][y1][0]; tmp += a[x2][y1][1] - a[x2][y2][1]; tmp += b[x2][y2][0] - b[x1][y2][0]; tmp += b[x1][y1][1] - b[x2][y1][1]; return tmp; } void rotate(int x) { int y = fa[x], w = (son[y][0] == x); if (!fa[y]) root = x; else son[fa[y]][son[fa[y]][1] == y] = x; fa[x] = fa[y]; fa[y] = x; if (son[x][w]) fa[son[x][w]] = y; son[y][1 ^ w] = son[x][w]; son[x][w] = y; size[y] = size[son[y][0]] + size[son[y][1]] + 1; size[x] = size[son[x][0]] + size[son[x][1]] + 1; } void ins(int i, int x) { if (!root) { dt[root = ++len] = x; son[root][0] = son[root][1] = 0; fa[root] = 0; size[root] = 1; return; } size[i]++; if (x <= dt[i]) if (son[i][0]) ins(son[i][0], x); else { son[i][0] = ++len; dt[len] = x; son[len][0] = son[len][1] = 0; fa[len] = i; size[len] = 1; } else if (son[i][1]) ins(son[i][1], x); else { son[i][1] = ++len; dt[len] = x; son[len][0] = son[len][1] = 0; fa[len] = i; size[len] = 1; } if (size[son[i][0]] > size[son[i][1]]) rotate(son[i][0]); else if (size[son[i][1]] > size[son[i][0]]) rotate(son[i][1]); } void getans(int i, int x) { if (!i) return; if (Abs(x - dt[i]) < tmp2) f = i, tmp2 = Abs(x - dt[i]); if (dt[i] >= x) getans(son[i][0], x); else getans(son[i][1], x); } int calc(int i, int j, int l) { return a[i][l][0] + a[j][1][1] - a[j][l][1] - b[i][l][1] + b[j][l][1]; } int calc2(int i, int j, int r) { return a[i][r][0] + a[j][1][1] - a[j][r][1] - b[i][r][0] + b[j][r][0]; } void read(int &a) { char ch; while (!((ch = getchar()) >= 0 && ch <= 9 )) ; a = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) (a *= 10) += ch - 0 ; } int main() { int i, j, l, r; ans = 1000000000; read(n); read(m); read(T); read(t[0]); read(t[1]); read(t[2]); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) read(g[i][j]); init(); for (i = 1; i < n - 1; i++) for (j = i + 2; j <= n; j++) { len = root = 0; for (r = 3; r <= m; r++) { f = 0; tmp = calc2(i, j, r) - T; tmp2 = ans; ins(root, calc(i, j, r - 2)); getans(root, tmp); if (f == -1) continue; if (tmp2 < ans) { d[0].x = i; d[0].y = f; d[1].x = j; d[1].y = r; ans = tmp2; } } } printf( %d %d %d %d n , d[0].x, d[0].y, d[1].x, d[1].y); return 0; } |
#include <bits/stdc++.h> using namespace std; struct car { int c, v; }; bool operator<(car a, car b) { return a.v < b.v; } int main() { ios::sync_with_stdio(false); int n, k, s, t; cin >> n >> k >> s >> t; vector<car> arr(n); for (int i = 0; i < n; i++) cin >> arr[i].c >> arr[i].v; vector<int> g(k + 2); g[0] = 0; for (int i(1); i <= k; i++) cin >> g[i]; k += 2; g[k - 1] = s; sort(arr.begin(), arr.end()); sort(g.begin(), g.end()); int l = -1, r = n; int cnt = 0; while (r - l > 1) { cnt++; int m = (r + l) / 2; int time = 0; for (int i(1); i < k; i++) { int d = g[i] - g[i - 1]; int a = min(arr[m].v - d, d); int norm = d - a; if (arr[m].v < d) { time = 2000000007; break; } time += a + 2 * norm; } if (time > t) l = m; else r = m; } if (r == n) cout << -1 << endl; else { int ans = 1000000007; for (int i = r; i < n; ++i) ans = min(ans, arr[i].c); cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char t[200003], p[200003]; int a, pos[200003], nt, np; bool check(int mid) { int it = 0; for (int ip = 0; ip < np; ip++) { while (it < nt && (t[it] != p[ip] || pos[it + 1] <= mid)) it++; if (it == nt) return false; it++; } return true; } int main() { scanf( %s , t); scanf( %s , p); nt = strlen(t); np = strlen(p); for (int i = 1; i <= nt; i++) { scanf( %d , &a); pos[a] = i; } int lo = 1, mid, hi = nt; while (hi >= lo) { mid = (lo + hi) / 2; if (check(mid)) lo = mid + 1; else hi = mid - 1; } printf( %d n , hi); } |
#include <bits/stdc++.h> using namespace std; const int N = 1000 + 10; char ch[N]; int a[N][N]; int h[N], l[N]; int n, m; int main() { cin >> n >> m; int tot = 0; for (int i = 1; i <= n; i++) { scanf( %s , ch + 1); for (int j = 1; j <= m; j++) { a[i][j] = ch[j] == * ? 1 : 0; h[i] += a[i][j]; l[j] += a[i][j]; tot += a[i][j]; } } int x = -1, y = -1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (h[i] + l[j] - a[i][j] == tot) { x = i; y = j; break; } if (x == -1) { puts( NO ); } else { puts( YES ); cout << x << << y << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); string to_string(const string& s) { return + s + ; } string to_string(const char* s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } string to_string(vector<bool> v) { bool f = true; string res = { ; for (long long i = (0); i <= (static_cast<long long>(v.size()) - 1); i++) { if (!f) res += , ; res += to_string(v[i]); f = false; } res += } ; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ; for (auto& a : v) { res += (char)( 0 + a); } return res; } template <typename A> string to_string(A v) { bool f = true; string res = { ; for (auto& x : v) { if (!f) res += , ; res += to_string(x); f = false; } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> t) { return ( + to_string(get<0>(t)) + , + to_string(get<1>(t)) + , + to_string(get<2>(t)) + ) ; } void DBG() { cerr << endl; } template <typename H, typename... T> void DBG(H h, T... t) { cerr << << to_string(h); DBG(t...); } template <typename T> void re(T& x) { cin >> x; }; template <typename H, typename... T> void re(H& h, T&... t) { re(h); re(t...); } template <typename T> void pr(T x) { cout << x; }; template <typename H, typename... T> void pr(H h, T... t) { pr(h); pr(t...); } int main() { ios::sync_with_stdio(false); cin.tie(0); long long tt; re(tt); while (tt--) { string s; re(s); long long n = (long long)s.size(); long long a, b, c; a = b = c = -1; long long inf = (long long)9e18; long long ans = inf; for (long long i = (0); i <= (n - 1); i++) { if (s[i] == 1 ) { a = i; if (b == -1 || c == -1) continue; ans = min(ans, i - min(b, c) + 1); } if (s[i] == 2 ) { b = i; if (a == -1 || c == -1) continue; ans = min(ans, i - min(a, c) + 1); } if (s[i] == 3 ) { c = i; if (b == -1 || a == -1) continue; ans = min(ans, i - min(b, a) + 1); } } pr((ans == inf ? 0 : ans), n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[200015], n, k, b[100015]; int cmp(int x, int y) { return x < y; } int main() { while (scanf( %d%d , &n, &k) != EOF) { memset(a, 0, sizeof(a)); int ans = 0, flag = 1, t = 0; int m = k; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] < 0) t++; if (flag == 1 && a[i] < 0) { flag = 0; ans++; } else if (flag == 0 && a[i] >= 0) { flag = 1; ans++; } } if (t == 0) { printf( 0 n ); } else if (t > k) { printf( -1 n ); } else if (t == k) { printf( %d n , ans); } else { k = k - t; int sum = 0, c = -1; for (int i = n - 1; i >= 0; i--) { if (a[i] < 0) { if (c == -1) { t = sum; c++; } else if (sum) { b[c] = sum; c++; } sum = 0; } else sum++; } sort(b, b + c, cmp); int ans1 = ans, ans2 = ans, kk = k; if (kk > 0) { for (int i = 0; i < c; i++) { if (kk - b[i] >= 0) { kk -= b[i]; ans1 -= 2; } else break; } } kk = k - t; if (kk >= 0 && t) { ans2 = ans - 1; for (int i = 0; i < c; i++) { if (kk - b[i] >= 0) { kk -= b[i]; ans2 -= 2; } else break; } } printf( %d n , min(ans1, ans2)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2 == 1) { cout << (n - 1) / 2 << endl; } else { long long x = 1; while (2 * x <= n) { x *= 2; } cout << (n - x) / 2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int mark[(10000000 >> 5) + 1]; void sieve() { register int i, j, k; (mark[1 >> 5] |= 1 << (1 & 31)); int n = 10000000; for (i = 2; i <= n; i++) { if (!(mark[i >> 5] >> (i & 31) & 1)) { for (k = n / i, j = i * k; k >= i; k--, j -= i) (mark[j >> 5] |= 1 << (j & 31)); } } } long long C(long long n, long long k) { if (k == 0) return 1; return (n * C(n - 1, k - 1)) / k; } long long modular_pow(long long budgetase, long long exponent, int modulus) { long long result = 1; while (exponent > 0) { if (exponent % 2 == 1) result = (result * budgetase) % modulus; exponent = exponent >> 1; budgetase = (budgetase * budgetase) % modulus; } return result; } long long binaryToDec(string number) { long long result = 0, pow = 1; for (int i = number.length() - 1; i >= 0; --i, pow <<= 1) result = (result + (number[i] - 0 ) * pow) % 1000003; return result; } long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); } int main() { double d, h, v, e; cin >> d >> h >> v >> e; double r = d / 2; double area = 3.1415926535897932384626433832795 * r * r; if (e * area > v || fabs(e * area - v) < 0.0000000001) { cout << NO << endl; return 0; } double vol = 3.1415926535897932384626433832795 * r * r * h; double p = e * 3.1415926535897932384626433832795 * r * r; double dif = fabs(p - v); cout << YES << endl; cout << setprecision(12) << fixed << (double)vol / dif << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n, 0); vector<int> p(n, 0); for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; } int x; for (int i = 0; i < n; i++) { cin >> x; p[x - 1] = i; } int ii = 1; while (ii < n && p[a[ii - 1]] < p[a[ii]]) { ii++; } cout << n - ii << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int s, t, n; string str; bool flag = true, flag1 = true; int main() { scanf( %d , &n); cin >> str; for (int i = 0; i < n; i++) { if (str[i] == R && flag) { s = i; flag = false; } if (str[i] == L && flag1) { t = i; flag1 = false; } } if (flag1) { for (int i = 0; i < n; i++) if (str[i] == R ) t = i; printf( %d %d , s + 1, t + 2); return 0; } if (flag) { for (int i = 0; i < n; i++) if (str[i] == L ) s = i; printf( %d %d , s + 1, t); return 0; } printf( %d %d , s + 1, t); return 0; } |
#include <bits/stdc++.h> using namespace std; long long INF = -10000000; int main() { long long da, db; cin >> da >> db; if (da == db) { cout << da * 10 << << db * 10 + 1; } else if (da == 9 && db == 1) { cout << da * 10 + 9 << << db * 100; } else if (da == 0 && db == 1) { cout << da << << db; } else if (da + 1 == db) { cout << da * 10 + 9 << << db * 10; } else { cout << -1; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; } return i; } template <typename T, typename U> std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) { o << p.first << << p.second; return o; } template <typename T> std::ostream& operator<<(std::ostream& o, const vector<T>& t) { if (t.empty()) o << n ; for (size_t i = 0; i < t.size(); ++i) { o << t[i] << n [i == t.size() - 1]; } return o; } template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T, vector<T>, less<T>>; template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; } unsigned int logceil(long long first) { return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0; } namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.first) ^ (u(p.second) << 7); } }; } // namespace std template <typename T, typename F> T bsh(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { l = m + 1; r = m; } else { h = m - 1; } } return r; } template <typename F> double bshd(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { l = m; } else { h = m; } } return (l + h) / 2; } template <typename T, typename F> T bsl(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { h = m - 1; r = m; } else { l = m + 1; } } return r; } template <typename F> double bsld(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { h = m; } else { l = m; } } return (l + h) / 2; } template <typename T> T gcd(T a, T b) { if (a < b) swap(a, b); return b ? gcd(b, a % b) : a; } template <typename T> class vector2 : public vector<vector<T>> { public: vector2() {} vector2(size_t a, size_t b, T t = T()) : vector<vector<T>>(a, vector<T>(b, t)) {} }; template <typename T> class vector3 : public vector<vector2<T>> { public: vector3() {} vector3(size_t a, size_t b, size_t c, T t = T()) : vector<vector2<T>>(a, vector2<T>(b, c, t)) {} }; template <typename T> class vector4 : public vector<vector3<T>> { public: vector4() {} vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {} }; template <typename T> class vector5 : public vector<vector4<T>> { public: vector5() {} vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {} }; int Prev[int(1e5) + 3]; class EEgorAndAnRPGGame { public: void solve(istream& cin, ostream& cout) { int T; cin >> T; for (int t = 0; t < T; ++t) { int N; cin >> N; vector<int> A(N); cin >> A; vector<vector<int>> Ans; while (!A.empty()) { int M = A.size(); vector<vector<int>> B{{0}}; for (int i = 0; i < M; ++i) { int s = bsh(0, int(B.size() - 1), [&](int first) { return B[first].back() < A[i]; }); if (s == B.size() - 1) B.emplace_back(); B[s + 1].push_back(A[i]); Prev[A[i]] = B[s].back(); } vector<int> Cur, Left; int idx = B.back().back(); while (idx != 0) { Cur.push_back(idx); idx = Prev[idx]; } reverse(Cur.begin(), Cur.end()); int j = 0; for (int i = 0; i < M; ++i) { if (j != Cur.size() && Cur[j] == A[i]) ++j; else Left.push_back(A[i]); } int K = Cur.size(); if (K * (K + 1) / 2 >= A.size()) { swap(A, Left); Ans.push_back(Cur); } else { for (auto& b : B) { if (b.front() == 0) continue; Ans.emplace_back(); for (auto& bb : b) { Ans.back().push_back(bb); } } break; } } cout << Ans.size() << endl; for (auto& ans : Ans) { cout << ans.size() << << ans; } } } }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); EEgorAndAnRPGGame solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int c1, c2, c3, c4; cin >> c1 >> c2 >> c3 >> c4; int n, m; cin >> n >> m; int a[n], b[m]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> b[i]; int sb = 0, st = 0; for (int i = 0; i < n; i++) sb += min(a[i] * c1, c2); sb = min(sb, c3); for (int i = 0; i < m; i++) st += min(b[i] * c1, c2); st = min(st, c3); cout << min(st + sb, c4); } |
#include <bits/stdc++.h> using namespace std; char ans[1000000]; int main() { int n, c, k = 1, u = 0, w = 1, h = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int m = 0; while (w) { u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) break; c = 0; for (int i = h; i < n; i++) { if (a[i] != 0) { ans[m] = P ; a[i]--; m++; u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) { break; w = 0; } if ((i + 1) != n) { ans[m] = R ; m++; } u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) { break; w = 0; } } else if (a[i] == 0) { u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) { break; w = 0; } if ((i + 1) != n) { ans[m] = R ; m++; } } } u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) break; ans[m] = L ; m++; for (int i = (n - 2); i >= 0; i--) { if (a[i] != 0) { ans[m] = P ; a[i]--; m++; u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) { break; w = 0; } if ((i - 1) != -1) { ans[m] = L ; m++; } u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) { break; w = 0; } } else if (a[i] == 0) { u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) { break; w = 0; } if ((i - 1) != -1) { ans[m] = L ; m++; } } if (i == 0) { ans[m] = R ; m++; } } u = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) u++; } if (u == n) break; h = 1; } for (int i = 0; i < m; i++) cout << ans[i]; cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int fact(int a) { int res = 1; while (a > 0) { res *= a--; } return res; } int main() { int a, b; cin >> a >> b; cout << fact(min(a, b)); return 0; } |
#include <bits/stdc++.h> using namespace std; namespace mine { long long qread() { long long ans = 0, f = 1; char c = getchar(); while (c < 0 or c > 9 ) { if (c == - ) f = -1; c = getchar(); } while ( 0 <= c and c <= 9 ) ans = ans * 10 + c - 0 , c = getchar(); return ans * f; } void write(long long num) { if (num < 0) putchar( - ), num = -num; if (num >= 10) write(num / 10); putchar( 0 + num % 10); } void write1(long long num) { write(num); putchar( ); } void write2(long long num) { write(num); putchar( n ); } template <typename T> void chmax(T &x, const T y) { x = (x > y ? x : y); } template <typename T> void chmin(T &x, const T y) { x = (x < y ? x : y); } long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; } const int INF = 0x3f3f3f3f; const int MOD = 998244353; inline int mm(const int x) { return x >= MOD ? x - MOD : x; } template <typename T> inline void add(T &x, const T y) { x = mm(x + y); } inline long long qpower(long long x, long long e, int mod = MOD) { long long ans = 1; if (e < 0) { puts( error ); exit(666); } while (e) { if (e & 1) ans = ans * x % mod; x = x * x % mod; e >>= 1; } return ans; } long long invm(long long x) { return qpower(x, MOD - 2); } const int N = 2e5 + 10; int n; namespace SGT { int mxc[N * 4]; void change_cnt(int x, int l, int r, int pos, int num) { if (l == r) { mxc[x] = num; return; } if (pos <= (l + r) / 2) change_cnt(x << 1, l, (l + r) / 2, pos, num); else change_cnt(x << 1 | 1, (l + r) / 2 + 1, r, pos, num); mxc[x] = max(mxc[x << 1], mxc[x << 1 | 1]); } int ask_cnt(int x, int l, int r, int fl, int fr) { if (fl > fr) return 0; if (l == fl and r == fr) return mxc[x]; if (fr <= (l + r) / 2) return ask_cnt(x << 1, l, (l + r) / 2, fl, fr); if (fl > (l + r) / 2) return ask_cnt(x << 1 | 1, (l + r) / 2 + 1, r, fl, fr); return max(ask_cnt(x << 1, l, (l + r) / 2, fl, (l + r) / 2), ask_cnt(x << 1 | 1, (l + r) / 2 + 1, r, (l + r) / 2 + 1, fr)); } int mif[N * 4], tag[N * 4], mifl[N * 4], mifr[N * 4], sum[N * 4]; void init(int x, int l, int r) { mifl[x] = l; mifr[x] = r; if (l < r) init(x << 1, l, (l + r) / 2), init(x << 1 | 1, (l + r) / 2 + 1, r); } void pushdown(int x) { if (tag[x] != 0) mif[x << 1] += tag[x], mif[x << 1 | 1] += tag[x], tag[x << 1] += tag[x], tag[x << 1 | 1] += tag[x], tag[x] = 0; } void pushup(int x, int l, int r) { if (l == r) { sum[x] = ask_cnt(x, l, r, l, l); return; } pushdown(x); if (mif[x << 1] == mif[x << 1 | 1]) { mif[x] = mif[x << 1]; mifl[x] = mifl[x << 1]; mifr[x] = mifr[x << 1 | 1]; sum[x] = sum[x << 1] + sum[x << 1 | 1] - ask_cnt(x, l, r, mifr[x << 1] + 1, (l + r) / 2) - ask_cnt(x, l, r, (l + r) / 2 + 1, mifl[x << 1 | 1]) + ask_cnt(x, l, r, mifr[x << 1] + 1, mifl[x << 1 | 1]); } else if (mif[x << 1] < mif[x << 1 | 1]) { mif[x] = mif[x << 1]; mifl[x] = mifl[x << 1]; mifr[x] = mifr[x << 1]; sum[x] = sum[x << 1] - ask_cnt(x, l, r, mifr[x << 1] + 1, (l + r) / 2) + ask_cnt(x, l, r, mifr[x << 1] + 1, r); } else { mif[x] = mif[x << 1 | 1]; mifl[x] = mifl[x << 1 | 1]; mifr[x] = mifr[x << 1 | 1]; sum[x] = sum[x << 1 | 1] - ask_cnt(x, l, r, (l + r) / 2 + 1, mifl[x << 1 | 1]) + ask_cnt(x, l, r, l, mifl[x << 1 | 1]); } } void add_f(int x, int l, int r, int fl, int fr, int val) { if (l == fl and r == fr) { mif[x] += val; tag[x] += val; pushup(x, l, r); return; } pushdown(x); if (fr <= (l + r) / 2) add_f(x << 1, l, (l + r) / 2, fl, fr, val); else if (fl > (l + r) / 2) add_f(x << 1 | 1, (l + r) / 2 + 1, r, fl, fr, val); else add_f(x << 1, l, (l + r) / 2, fl, (l + r) / 2, val), add_f(x << 1 | 1, (l + r) / 2 + 1, r, (l + r) / 2 + 1, fr, val); pushup(x, l, r); } void add_f(int l, int r, int val) { if (l <= r) add_f(1, 1, n, l, r, val); } void change_cnt(int pos, int num) { change_cnt(1, 1, n, pos, num); add_f(pos, pos, 0); } }; // namespace SGT int a[N]; set<int> pos[N]; void main() { n = qread(); int q = qread(); SGT::init(1, 1, n); for (int i = (1), I = (n); i <= I; i++) a[i] = qread(), pos[a[i]].insert(i); for (int num = (1), I = (N - 1); num <= I; num++) if (((int)(pos[num]).size())) SGT::change_cnt(*pos[num].begin(), ((int)(pos[num]).size())), SGT::add_f(*pos[num].begin(), *(--pos[num].end()) - 1, 1); write2(n - SGT::sum[1]); while (q--) { int x = qread(), val = qread(); set<int>::iterator now = pos[a[x]].find(x); SGT::change_cnt(*pos[a[x]].begin(), 0); if (((int)(pos[a[x]]).size()) > 1) { if (now == pos[a[x]].begin()) SGT::add_f(x, *(++now) - 1, -1); else if (now == --pos[a[x]].end()) SGT::add_f(*(--now), x - 1, -1); } pos[a[x]].erase(x); if (((int)(pos[a[x]]).size())) SGT::change_cnt(*pos[a[x]].begin(), ((int)(pos[a[x]]).size())); a[x] = val; pos[a[x]].insert(x); SGT::change_cnt(*pos[a[x]].begin(), ((int)(pos[a[x]]).size())); now = pos[a[x]].find(x); if (((int)(pos[a[x]]).size()) > 1) { if (now == pos[a[x]].begin()) { now++; SGT::add_f(x, *now - 1, 1); SGT::change_cnt(*now, 0); } else if (now == --pos[a[x]].end()) SGT::add_f(*(--now), x - 1, 1); } write2(n - SGT::sum[1]); } } }; // namespace mine signed main() { srand(time(0)); mine::main(); } |
#include <bits/stdc++.h> using namespace std; const int MAX = 105; vector<int> adj[MAX]; string s[MAX]; int mark[MAX]; bool cycle; string ans = ; void dfs(int v) { mark[v] = 1; for (int i = 0; i < adj[v].size(); i++) { int u = adj[v][i]; if (mark[u] == 1) cycle = true; if (!mark[u]) dfs(u); } mark[v] = 2; } void print(int v) { mark[v] = 1; for (int i = 0; i < adj[v].size(); i++) { int u = adj[v][i]; if (!mark[u]) print(u); } ans += a + v; } int main() { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < n - 1; i++) { int j = 0; while (j < s[i].size() && j < s[i + 1].size() && s[i][j] == s[i + 1][j]) j++; if (j == s[i + 1].size() && s[i].size() > s[i + 1].size()) { cout << Impossible << endl; return 0; } if (j < s[i].size() && j < s[i + 1].size()) adj[s[i][j] - a ].push_back(s[i + 1][j] - a ); } for (int i = 0; i < 26; i++) if (!mark[i]) dfs(i); if (cycle) { cout << Impossible << endl; return 0; } memset(mark, 0, sizeof(mark)); for (int i = 0; i < 26; i++) if (!mark[i]) print(i); reverse(ans.begin(), ans.end()); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& out, const tuple<T>& a) { out << [ << get<0>(a) << ] ; return out; } template <class T, class U> ostream& operator<<(ostream& out, const tuple<T, U>& a) { out << [ << get<0>(a) << << get<1>(a) << ] ; return out; } template <class T, class U, class V> ostream& operator<<(ostream& out, const tuple<T, U, V>& a) { out << [ << get<0>(a) << << get<1>(a) << << get<2>(a) << ] ; return out; } template <class T, class U, class V, class W> ostream& operator<<(ostream& out, const tuple<T, U, V, W>& a) { out << [ << get<0>(a) << << get<1>(a) << << get<2>(a) << << get<3>(a) << ] ; return out; } template <class T, class U> ostream& operator<<(ostream& out, const pair<T, U>& a) { out << [ << a.first << << a.second << ] ; return out; } template <class T> ostream& operator<<(ostream& out, const vector<T>& a) { out << [ ; for (auto& it : a) out << it << ; out << ] ; return out; } template <class T> ostream& operator<<(ostream& out, const set<T>& a) { out << [ ; for (auto& it : a) out << it << ; out << ] ; return out; } template <class T> ostream& operator<<(ostream& out, const multiset<T>& a) { out << [ ; for (auto& it : a) out << it << ; out << ] ; return out; } template <class T, class U> ostream& operator<<(ostream& out, const map<T, U>& a) { for (auto& it : a) out << it.first << -> << it.second << | ; return out; } template <class T, class U> ostream& operator<<(ostream& out, const multimap<T, U>& a) { for (auto& it : a) out << it.first << -> << it.second << | ; return out; } template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } void r(){}; template <typename T, typename... Args> void r(T& a, Args&... args) { cin >> a; r(args...); } void p() { cout << n ; }; template <typename T, typename... Args> void p(T& a, Args&... args) { cout << a << ; p(args...); } template <class T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; } template <class T> T lcm(T a, T b) { return ((a * b) / gcd(b % a, a)); } template <class T1, class T2> T1 binpow(T1 number, T2 power) { T1 result = number; while (power) { if (power & 1) result = result * number; number = number * number; power /= 2; } return result; } long long n; class Segtree { public: long long *tree, *lazy, *array, *color, *is_single; Segtree(long long* arr, long long sz) { array = new long long[sz]; lazy = new long long[4 * sz]; tree = new long long[4 * sz]; color = new long long[4 * sz]; is_single = new long long[4 * sz]; n = sz; for (auto i = (0) - ((0) > (n)); i != (n) - ((0) > (n)); i += 1 - 2 * ((0) > (n))) array[i] = arr[i]; for (auto i = (0) - ((0) > (4 * sz)); i != (4 * sz) - ((0) > (4 * sz)); i += 1 - 2 * ((0) > (4 * sz))) tree[i] = 0; for (auto i = (0) - ((0) > (4 * sz)); i != (4 * sz) - ((0) > (4 * sz)); i += 1 - 2 * ((0) > (4 * sz))) lazy[i] = 0; for (auto i = (0) - ((0) > (4 * sz)); i != (4 * sz) - ((0) > (4 * sz)); i += 1 - 2 * ((0) > (4 * sz))) color[i] = 0; for (auto i = (0) - ((0) > (4 * sz)); i != (4 * sz) - ((0) > (4 * sz)); i += 1 - 2 * ((0) > (4 * sz))) is_single[i] = 0; build(); } void build(long long id = 1, long long l = 0, long long r = n) { if (r - l < 2) { tree[id] = 0; color[id] = array[l]; is_single[id] = 1; return; } auto mid = (l + r) / 2; build(2 * id, l, mid); build(2 * id + 1, mid, r); tree[id] = tree[2 * id] + tree[2 * id + 1]; if (color[2 * id] == color[2 * id + 1] and color[2 * id] != 0) is_single[id] = 1, color[id] = color[2 * id]; else is_single[id] = 0, color[id] = 0; } void upd(long long id, long long l, long long r, long long x, long long coloring) { lazy[id] += x; tree[id] += (r - l) * x; if (coloring != 0) color[id] = coloring; } void shift(long long id, long long l, long long r) { long long mid = (l + r) / 2; upd(id * 2, l, mid, lazy[id], color[id]); upd(id * 2 + 1, mid, r, lazy[id], color[id]); lazy[id] = 0; } long long sum(long long x, long long y, long long id = 1, long long l = 0, long long r = n) { if (l >= y or r <= x) return 0; if (l >= x and r <= y) return tree[id]; shift(id, l, r); auto mid = (l + r) / 2; return sum(x, y, 2 * id, l, mid) + sum(x, y, 2 * id + 1, mid, r); } void range_update(long long x, long long y, long long coloring, long long id = 1, long long l = 0, long long r = n) { auto mid = (l + r) / 2; if (l >= y or r <= x) return; if (x <= l and r <= y) { if (is_single[id]) { upd(id, l, r, abs(color[id] - coloring), coloring); } else { shift(id, l, r); range_update(x, y, coloring, 2 * id, l, mid); range_update(x, y, coloring, 2 * id + 1, mid, r); tree[id] = tree[2 * id] + tree[2 * id + 1]; } is_single[id] = 1; color[id] = coloring; return; } shift(id, l, r); range_update(x, y, coloring, 2 * id, l, mid); range_update(x, y, coloring, 2 * id + 1, mid, r); tree[id] = tree[2 * id] + tree[2 * id + 1]; if (color[2 * id] == color[2 * id + 1] and color[2 * id] != 0) is_single[id] = 1, color[id] = color[2 * id]; else is_single[id] = 0, color[id] = 0; } }; long long m, arr[112345], types, lef, ri, x; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); r(n, m); for (auto i = (0) - ((0) > (n)); i != (n) - ((0) > (n)); i += 1 - 2 * ((0) > (n))) arr[i] = i + 1; Segtree tree(arr, n); for (auto i = (0) - ((0) > (m)); i != (m) - ((0) > (m)); i += 1 - 2 * ((0) > (m))) { r(types); if (types == 1) { r(lef, ri, x); tree.range_update(lef - 1, ri, x); } else { r(lef, ri); auto sum = tree.sum(lef - 1, ri); p(sum); } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios ::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen( main.in , r )) freopen( main.in , r , stdin); else if (fopen( something .inp , r )) freopen( something .inp , r , stdin), freopen( something .out , w , stdout); int n, m; cin >> n >> m; int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0; for (int i = 1; i <= n; i++) { int a; cin >> a; cnt1 += (a % 2 == 1); cnt2 += (a % 2 == 0); } for (int i = 1; i <= m; i++) { int a; cin >> a; cnt3 += (a % 2 == 1); cnt4 += (a % 2 == 0); } cout << min(cnt1, cnt4) + min(cnt2, cnt3) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int d[1234678], a[1234678], ans; int main() { int n, cnt = 0; char c; scanf( %d n , &n); for (int i = 1; i <= n; i++) { scanf( %c , &c); d[i] = (c == R ); } for (int i = 1; i <= n; i++) scanf( %d , &a[i]); ans = 1047483647; for (int i = 2; i <= n; i++) if (d[i - 1] == 1 && d[i] == 0) ans = min(ans, (a[i] - a[i - 1]) / 2); if (ans == 1047483647) puts( -1 ); else printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { char a; int b; scanf( %c%d , &a, &b); if ((a == a || a == h ) && (b == 1 || b == 8)) printf( 3 n ); else if (a == a || a == h || b == 1 || b == 8) printf( 5 n ); else printf( 8 n ); } |
#include <bits/stdc++.h> using namespace std; const long long NMAX = 1000001; vector<int> v[NMAX]; int tobehappy[NMAX]; void DFS(int node) { if (v[node].size() == 0) tobehappy[node] = 1; for (auto x : v[node]) { DFS(x); tobehappy[node] += tobehappy[x]; } } int main() { int n, i; cin >> n; for (i = 2; i <= n; i++) { int x, y; cin >> y; v[y].push_back(i); } DFS(1); sort(tobehappy + 1, tobehappy + n + 1); for (i = 1; i <= n; i++) cout << tobehappy[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 7; int n, u, v, cnt, head[maxn], to[maxn << 1], nex[maxn << 1], deep[maxn], len[maxn], son[maxn], *f[maxn], tmp[maxn], *id = tmp, ans[maxn]; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } return x * f; } inline void add(int u, int v) { to[++cnt] = v; nex[cnt] = head[u]; head[u] = cnt; } void dfs1(int x, int pre, int deep) { int maxson = 0; ::deep[x] = deep; for (int i = head[x]; i; i = nex[i]) { if (to[i] == pre) continue; dfs1(to[i], x, deep + 1); if (len[to[i]] > maxson) son[x] = to[i], maxson = len[to[i]]; } len[x] = maxson + 1; } void dfs2(int x, int pre) { f[x][0] = 1; if (son[x]) { f[son[x]] = f[x] + 1; dfs2(son[x], x); ans[x] = ans[son[x]] + 1; } for (int i = head[x]; i; i = nex[i]) { int v = to[i]; if (v == pre || v == son[x]) continue; f[v] = id, id += len[v], dfs2(v, x); for (int j = 1; j <= len[v]; ++j) { f[x][j] += f[v][j - 1]; if (f[x][j] > f[x][ans[x]] || (f[x][j] == f[x][ans[x]] && j < ans[x])) ans[x] = j; } } if (f[x][ans[x]] == 1) ans[x] = 0; } int main() { n = read(); for (int i = 1; i < n; ++i) { u = read(), v = read(); add(u, v); add(v, u); } dfs1(1, 0, 1); f[1] = id, id += len[1], dfs2(1, 0); for (int i = 1; i <= n; ++i) printf( %d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; for (int i = 0; i < n - 1; i++) { int t = 0; while (i + int(pow(2, t)) < n) t++; t = t - 1; a[i + int(pow(2, t))] += a[i]; ans += a[i]; a[i] = 0; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -fdelete-null-pointer-checks,inline-functions-called-once,-funsafe-loop-optimizations,-fexpensive-optimizations,-foptimize-sibling-calls,-ftree-switch-conversion,-finline-small-functions,inline-small-functions,-frerun-cse-after-loop,-fhoist-adjacent-loads,-findirect-inlining,-freorder-functions,no-stack-protector,-fpartial-inlining,-fsched-interblock,-fcse-follow-jumps,-fcse-skip-blocks,-falign-functions,-fstrict-overflow,-fstrict-aliasing,-fschedule-insns2,-ftree-tail-merge,inline-functions,-fschedule-insns,-freorder-blocks,-fwhole-program,-funroll-loops,-fthread-jumps,-fcrossjumping,-fcaller-saves,-fdevirtualize,-falign-labels,-falign-loops,-falign-jumps,unroll-loops,-fsched-spec,-ffast-math,Ofast,inline,-fgcse,-fgcse-lm,-fipa-sra,-ftree-pre,-ftree-vrp,-fpeephole2 , 3) #pragma GCC target( avx , sse2 ) const double esp = 1e-6; const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const int inf = 1e9; using namespace std; long long read() { char ch = getchar(); long long x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } const int N = 6e5 + 10; const int diff = 3e5; int Q; struct node { int pos, to, h; long long cntx, cnty; node(int pos, int to, int h, long long cntx, long long cnty) { this->pos = pos, this->to = to, this->h = h, this->cntx = cntx, this->cnty = cnty; } }; struct DSU { int par[N], height[N]; long long cntx[N], cnty[N]; long long sum = 0; DSU() { for (int i = 1; i <= 6e5 + 1; i++) { par[i] = i, height[i] = 1; if (i <= 3e5) cntx[i] = 1; else cnty[i] = 1; } } int find(int x) { return x == par[x] ? x : find(par[x]); } int unit(int x, int y, stack<node> &st) { x = find(x), y = find(y); if (x == y) return 0; if (height[x] < height[y]) swap(x, y); node sttemp(y, x, height[y], cntx[y], cnty[y]); st.push(sttemp); sum -= cntx[x] * cnty[x]; sum -= cntx[y] * cnty[y]; cntx[x] += cntx[y]; cnty[x] += cnty[y]; sum += cntx[x] * cnty[x]; par[y] = x; height[x] += height[y]; return 1; } void del(stack<node> &st) { while (st.size()) { node temp = st.top(); st.pop(); par[temp.pos] = temp.pos; height[temp.to] -= temp.h; sum -= cntx[temp.to] * cnty[temp.to]; cntx[temp.to] -= temp.cntx; cnty[temp.to] -= temp.cnty; sum += cntx[temp.to] * cnty[temp.to]; sum += temp.cntx * temp.cnty; } } } dsu; struct SEG { vector<pair<int, int> > tr[N << 2]; void update(int l, int r, int root, int lf, int rt, pair<int, int> val) { if (lf <= l && r <= rt) { tr[root].push_back(val); return; } int mid = (l + r) >> 1; if (lf <= mid) update(l, mid, root << 1, lf, rt, val); if (rt > mid) update(mid + 1, r, root << 1 | 1, lf, rt, val); } void query(int l, int r, int root) { stack<node> st; for (auto k : tr[root]) { dsu.unit(k.first, k.second + diff, st); } if (l == r) { printf( %lld , dsu.sum); dsu.del(st); return; } int mid = (l + r) >> 1; query(l, mid, root << 1); query(mid + 1, r, root << 1 | 1); dsu.del(st); } } sgt; map<pair<int, int>, pair<int, int> > mp; struct nd { int x, y, st, ed; }; vector<nd> query; int main() { Q = read(); int x, y; for (int i = 1; i <= Q; i++) { x = read(), y = read(); if (mp[{x, y}].first) { query.push_back(nd{x, y, mp[{x, y}].first, i - 1}); mp[{x, y}].first = 0; } else { mp[{x, y}].first = i; } } for (auto k : mp) { if (k.second.first) query.push_back(nd{k.first.first, k.first.second, k.second.first, Q}); } for (auto k : query) { sgt.update(1, Q, 1, k.st, k.ed, make_pair(k.x, k.y)); } sgt.query(1, Q, 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string mat[n + 5]; int dp[n + 5][n + 5]; for (int i = 0; i < (n); i++) cin >> mat[i]; memset(dp, 0, sizeof(dp)); if (mat[0][0] == a ) dp[0][0] = 1; for (int i = 1; i < (n); i++) { dp[i][0] = dp[i - 1][0]; if (mat[i][0] == a ) dp[i][0]++; dp[0][i] = dp[0][i - 1]; if (mat[0][i] == a ) dp[0][i]++; } for (int i = 1; i < (n); i++) { for (int j = 1; j < (n); j++) { dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); if (mat[i][j] == a ) dp[i][j]++; } } int maxi = -1; for (int i = 0; i < (n); i++) { for (int j = 0; j < (n); j++) { if (i + j + 1 - dp[i][j] - k <= 0) maxi = max(maxi, i + j); } } set<pair<int, int>> pts; if (maxi == -1) pts.insert(make_pair(0, 0)); else { for (int i = 0; i < (n); i++) { for (int j = 0; j < (n); j++) { if (i + j == maxi && (i + j + 1 - dp[i][j] - k) == 0) { pts.insert(make_pair(i, j)); } } } } string ans, cont; for (int i = 0; i < (maxi + 1); i++) ans.push_back( a ); if (maxi == -1) ans.push_back(mat[0][0]), maxi++; for (int i = maxi; i < (2 * n - 2); i++) { char mini = z + 1; for (auto x : pts) { int r = x.first, c = x.second; if (r < n - 1) mini = min(mini, mat[r + 1][c]); if (c < n - 1) mini = min(mini, mat[r][c + 1]); } ans.push_back(mini); set<pair<int, int>> temp; for (auto x : pts) { int r = x.first, c = x.second; if (r < n - 1) { if (mat[r + 1][c] == mini) temp.insert(make_pair(r + 1, c)); } if (c < n - 1) { if (mat[r][c + 1] == mini) temp.insert(make_pair(r, c + 1)); } } pts = temp; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; map<int, vector<int> > ps; set<int> xs; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; ps[y].push_back(x); xs.insert(x); } map<int, int> rk; const int INF = 1 << 30; for (int x : xs) { int i = rk.size(); rk[x] = i + 1; } rk[INF] = xs.size() + 1; int bit[200100] = {}; long long ans = 0; xs.clear(); for (auto it = ps.rbegin(); it != ps.rend(); it++) { int y = it->first; sort(it->second.begin(), it->second.end()); for (int i = 0; i < it->second.size(); i++) { int l = it->second[i], r = (i + 1 == it->second.size() ? INF : it->second[i + 1]); long long sum1 = 0, sum2 = 0; if (xs.find(l) == xs.end()) { xs.insert(l); for (int j = rk[l]; j <= rk.size() + 1; j += j & -j) bit[j]++; } for (int j = rk[l]; j > 0; j -= j & -j) sum1 += bit[j]; for (int j = rk[r] - 1; j > 0; j -= j & -j) sum2 += bit[j]; ans += sum1 * (sum2 - sum1 + 1); } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; bool x = false, y = false; cin >> s; if (n == 1) { s[0] % 2 ? cout << 1 n : cout << 2 n ; continue; } for (int i = 0; i < n; i++) { if ((i + 1) % 2 == 1) x |= ((s[i] - 0 ) % 2 == 1); else if ((i + 1) % 2 == 0) y |= ((s[i] - 0 ) % 2 == 0); } if (n % 2 == 1) { x ? cout << 1 : cout << 2; } else { y ? cout << 2 : cout << 1; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long INF = 4e18; const int inf = 2e9; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } int a[3005], pos[3005]; int main(void) { int n, i, j, naik = 0; scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %d , a + i); pos[a[i]] = i; } int ans = 0; for (i = 1; i <= n; ++i) { while (pos[i] > i) { swap(a[pos[i]], a[pos[i] - 1]); swap(pos[a[pos[i]]], pos[a[pos[i] - 1]]); ans++; } } ans = ((ans >> 1) << 2) + (ans & 1); printf( %.9f n , (double)ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int n; char s[105][105]; while (~scanf( %d , &n)) { for (int i = 1; i <= n; ++i) scanf( %s , s[i] + 1); vector<pair<int, int> > r; bool rc = true; for (int i = 1; i <= n; ++i) { int j; for (j = 1; j <= n; ++j) if (s[i][j] == . ) { r.push_back(pair<int, int>(i, j)); break; } if (j > n) { rc = false; break; } } vector<pair<int, int> > c; bool cc = true; for (int j = 1; j <= n; ++j) { int i; for (i = 1; i <= n; ++i) if (s[i][j] == . ) { c.push_back(pair<int, int>(i, j)); break; } if (i > n) { cc = false; break; } } if (rc) { for (int i = 0; i < n; ++i) printf( %d %d n , r[i].first, r[i].second); } else if (cc) { for (int i = 0; i < n; ++i) printf( %d %d n , c[i].first, c[i].second); } else { puts( -1 ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 1e5 + 10; vector<string> tot[MaxN]; int cnt; char s[MaxN]; bool check[MaxN], flag; set<string> ans; int main() { scanf( %s , s); int len = strlen(s); check[len] = 1; for (int i = len - 2; i >= 5; i--) { if (check[i + 2]) { string t; t += s[i]; t += s[i + 1]; if (tot[i + 2].size() == 0) { check[i] = 1; tot[i].push_back(t); ans.insert(t); } else { flag = 1; for (int j = 0; j < tot[i + 2].size(); j++) { if (tot[i + 2][j] != t) { flag = 0; break; } } if (!flag) { tot[i].push_back(t); ans.insert(t), check[i] = 1; } } } if (check[i + 3]) { string t; t += s[i]; t += s[i + 1]; t += s[i + 2]; if (tot[i + 3].size() == 0) { check[i] = 1; tot[i].push_back(t); ans.insert(t); } else { flag = 1; for (int j = 0; j < tot[i + 3].size(); j++) { if (tot[i + 3][j] != t) { flag = 0; break; } } if (!flag) { tot[i].push_back(t); ans.insert(t), check[i] = 1; } } } } printf( %d n , ans.size()); for (set<string>::iterator ite = ans.begin(); ite != ans.end(); ite++) { cout << *ite << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int r, g, b, w; cin >> r >> g >> b >> w; int evens = (r % 2 == 0) + (g % 2 == 0) + (b % 2 == 0) + (w % 2 == 0); int odds = (r % 2 == 1) + (g % 2 == 1) + (b % 2 == 1) + (w % 2 == 1); if (evens == 4 || evens == 3 || odds == 4 || (odds == 3 && r && g && b)) cout << Yes n ; else cout << No n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string name; cin >> name; string right = , left = ; int i = 0; for (; true; i++) { if (name[i] == | ) { break; } left += name[i]; } i++; for (; i < name.length(); i++) { right += name[i]; } int ll = left.length(); int rl = right.length(); string toAdd; cin >> toAdd; if (abs(rl - ll) == 0) { if (toAdd.length() % 2 == 0) { for (int i = 0; i < toAdd.length(); i += 2) { right += toAdd[i]; left += toAdd[i + 1]; } cout << left << | << right; } else { cout << Impossible ; } } else if (abs(rl - ll) == toAdd.length()) { if (rl > ll) { for (int i = 0; i < (rl - ll); i++) { left += toAdd[i]; } cout << left << | << right; } else { for (int i = 0; i < (ll - rl); i++) { right += toAdd[i]; } cout << left << | << right; } } else if (abs(ll - rl) < toAdd.length()) { if ((rl + ll + toAdd.length()) % 2 == 0) { if (rl > ll) { for (int i = 0; i < (rl - ll); i++) { left += toAdd[i]; } for (int i = abs(ll - rl); i < toAdd.length(); i += 2) { right += toAdd[i]; left += toAdd[i + 1]; } cout << left << | << right; } else { for (int i = 0; i < (ll - rl); i++) { right += toAdd[i]; } for (int i = abs(ll - rl); i < toAdd.length(); i += 2) { right += toAdd[i]; left += toAdd[i + 1]; } cout << left << | << right; } } else { cout << Impossible ; } } else { cout << Impossible ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 7; pair<double, double> a[MAXN]; double F[MAXN], S[MAXN]; int n, p; bool cmp(pair<double, double> x, pair<double, double> y) { return x.first * y.second > x.second * y.first; } int vt = -1; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> p; for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second; if (n == 1) { if (p >= a[1].first) { cout << -1; return 0; } double res = a[1].second / (a[1].first - p); cout << res; return 0; } sort(a + 1, a + n + 1, cmp); for (int i = 1; i <= n; i++) S[i] = S[i - 1] + a[i].second; for (int i = 1; i <= n; i++) F[i] = F[i - 1] + a[i].first; for (int i = 2; i <= n; i++) { double value = a[i].second / a[i].first; double res = value * F[i - 1] - S[i - 1]; if (res > p * value) { vt = i; break; } } if (vt == -1) { double res = S[n] / (F[n] - p); if (F[n] <= p) cout << -1; else cout << res; return 0; } double kq = S[vt - 1] / (F[vt - 1] - p); cout << fixed; cout << setprecision(10) << kq; return 0; } |
#include <bits/stdc++.h> #include <string> #include <cstdint> #include <iterator> #include <algorithm> #include <fstream> #include <vector> #include <set> using namespace std; using ll = long long; using ld = long double; #define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define Int int_fast64_t #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second #define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll)) #define mine(a) (*min_element((a).begin(), (a).end())) #define maxe(a) (*max_element((a).begin(), (a).end())) typedef vector<Int> vi; typedef pair<Int, Int> pii; typedef pair<Int, bool> pib; typedef pair<string, Int> psi; typedef pair<string, string> pss; typedef vector<pii> vpii; typedef vector<psi> vpsi; typedef vector<pss> vpss; using namespace std; // Vector template<typename T> istream& operator>>(istream& is, vector<T> &v){for (auto& i : v) is >> i; return is;} template<typename T> ostream& operator<<(ostream& os, vector<T> v){for (auto& i : v) os << i << ; return os;} template <typename T> pair<T, bool> getNthElement(set<T>& searchSet,int index) { pair<T, bool> result; // Check if index is valid or not if (searchSet.size() > index) { result.first = *(std::next( searchSet.begin(), index)); result.second = true; } else result.second = false; // Return the pair return result; } const Int N=7+1e10; Int gcd(Int a, Int b) { // Everything divides 0 if (a == 0) return b; if (b == 0) return a; // base case if (a == b) return a; // a is greater if (a > b) return gcd(a-b, b); return gcd(a, b-a); } int main() { FAST_IO; Int t; cin >> t; while(t--){ Int n; cin >> n; vi arr(n); cin >> arr; Int ans=0; Int Min=mine(arr); auto it=find(all(arr), Min); Int a=it-arr.begin(); if(arr[0]==Min){ cout << n-1 << endl; } else{ cout << n << endl; cout << 1 << a+1 << << Min << << Min+1 << n ; } for(Int i=1;i<n;++i){ cout << 1 << i+1 << << Min << << Min+i << n ; } } return 0; } |
#include <bits/stdc++.h> const long long P = 1000000000039LL; inline long long mul(long long a, long long b) { long long ans = 0; for (; b; b >>= 1) { if (b & 1) { ans = (ans + a) % P; } a = (a << 1) % P; } return ans; } int k = 0, t = 0; long long fac[10], ifac[10]; void init() { fac[0] = 1; ifac[0] = 1; fac[1] = 1; ifac[1] = 1; for (int i = 2; i < 10; i++) { ifac[i] = (P - mul(P / i, ifac[P % i])) % P; } for (int i = 2; i < 10; i++) { ifac[i] = mul(ifac[i - 1], ifac[i]); fac[i] = mul(fac[i - 1], i); } } int cnt[16]; long long f[10], g[10]; long long c[10]; void calc(int len) { std::fill(f, f + len + 1, 0); for (int i = 0; i < 16; i++) { if (cnt[i] < 0) { return; } } f[0] = 1; for (int i = 0; i < 16; i++) { std::fill(g, g + len + 1, 0); for (int j = 0; j <= cnt[i]; j++) { for (int u = 0; u <= len - j; u++) { g[u + j] = (g[u + j] + mul(ifac[j], f[u])) % P; } } std::copy(g, g + len + 1, f); } } void preDP() { std::fill(cnt, cnt + 16, t); c[0] = 0; cnt[1]--; calc(9); for (int i = 1; i < 10; i++) { c[i] = c[i - 1] + 15 * mul(f[i - 1], fac[i - 1]); } } long long solve(long long x) { long long l = 0, ans = 0; int d[10]; std::fill(cnt, cnt + 16, t); for (; x; d[l++] = x % 16, x /= 16) ; if (l > 0) { ans += c[l - 1]; } for (int i = l - 1; i >= 0; i--) { for (int u = ((i == l - 1) ? 1 : 0); u < d[i]; u++) { cnt[u]--; calc(i); ans += mul(f[i], fac[i]); cnt[u]++; } cnt[d[i]]--; } for (int i = 0; i < 16; i++) { if (cnt[i] < 0) { return ans; } } return ans + 1; } int main() { scanf( %d%d , &k, &t); init(); preDP(); long long l = 0, r = 0xFFFFFFFFFLL; for (long long mid = 0; l + 1 < r; solve(mid = (l + r) >> 1) >= k ? r = mid : l = mid) ; printf( %I64x n , r); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n; double r; cin >> n >> r; double X[n]; for (int i = 0; i < n; i++) { cin >> X[i]; } double Y[n]; Y[0] = r; for (int i = 1; i < n; i++) { Y[i] = r; for (int j = 0; j < i; j++) { if (abs(X[i] - X[j]) <= 2 * r) Y[i] = max(Y[i], Y[j] + sqrt(4 * r * r + 2 * X[i] * X[j] - X[i] * X[i] - X[j] * X[j])); } } for (int i = 0; i < n; i++) { cout << fixed << setprecision(9) << Y[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> grundies; grundies.push_back(0); for (int i = 1; i <= 60; i++) { long long accum = 0; long long add = 0; while (accum < i) { accum += add; add++; } if (accum > i) { add--; accum -= add; } add--; grundies.push_back(add); } long long numPiles; cin >> numPiles; long long finalState = 0; for (long long i = 0; i < numPiles; i++) { long long pile; cin >> pile; finalState = finalState ^ grundies[pile]; } if (!finalState) cout << YES << endl; if (finalState) cout << NO << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:225450978 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long Mod = 1000000007LL, INF = 1e9, LINF = 1e18; const long double Pi = 3.141592653589793116, EPS = 1e-9, Gold = ((1 + sqrt(5)) / 2); long long keymod[] = {1000000007LL, 1000000009LL, 1000000021LL, 1000000033LL}; long long keyCount = sizeof(keymod) / sizeof(long long); template <class T> int getbit(T s, int i) { return (s >> i) & 1; } template <class T> T onbit(T s, int i) { return s | (T(1) << i); } template <class T> T offbit(T s, int i) { return s & (~(T(1) << i)); } template <class T> int cntbit(T s) { return __builtin_popcountll(s); } auto TimeStart = chrono::steady_clock::now(); auto TimeEnd = chrono::steady_clock::now(); void ControlIO(int argc, char* argv[]); void TimerStart(); void TimerStop(); void Exit(); long long n, k, d1, d2; void Input() { cin >> n >> k >> d1 >> d2; } void Solve() { long long A = LINF, B = 0, C = 0; for (long long i = 0; i < 2; i++) { for (long long j = 0; j < 2; j++) { if (i) B = A - d1; else B = A + d1; if (j) C = B - d2; else C = B + d2; if ((k - A - B - C + min(A, min(B, C)) * 3) % 3 != 0 || k - A - B - C + min(A, min(B, C)) * 3 < 0) continue; if ((A + B + C + n - k) % 3 == 0 && (A + B + C + n - k) / 3 >= max(A, max(B, C))) { cout << yes n ; return; } } } cout << no n ; } int main(int argc, char* argv[]) { ControlIO(argc, argv); ios_base::sync_with_stdio(0); cin.tie(NULL); int T; cin >> T; TimerStart(); while (T--) { Input(); Solve(); } TimerStop(); return 0; } void ControlIO(int argc, char* argv[]) {} void TimerStart() {} void TimerStop() {} void Exit() { TimerStop(); exit(0); } |
#include <bits/stdc++.h> using namespace std; string to_string(string s) { return + s + ; } string to_string(const char *s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> t) { return ( + to_string(get<0>(t)) + , + to_string(get<1>(t)) + , + to_string(get<2>(t)) + ) ; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } void _debug() { cerr << n ; } template <typename Head, typename... Tail> void _debug(Head H, Tail... T) { cerr << << to_string(H); _debug(T...); } using ll = long long; using ld = long double; using ii = pair<int, int>; using vi = vector<int>; using vii = vector<ii>; using vc = vector<char>; using vb = vector<bool>; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(9); int n, k; cin >> n >> k; int lo = 1, hi = n; while (lo < hi) { int mid = lo + (hi - lo) / 2; int total = 0; int cur = mid; while (cur) { total += cur; cur /= k; } if (total >= n) { hi = mid; } else { lo = mid + 1; } } cout << hi; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename S> ostream &operator<<(ostream &os, const pair<T, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type * = nullptr> ostream &operator<<(ostream &os, const C &c) { bool f = true; os << [ ; for (const auto &x : c) { if (!f) os << , ; f = false; os << x; } return os << ] ; } template <typename T> void debug(string s, T x) { cerr << 033[1;35m << s << 033[0;32m = 033[33m << x << 033[0m n ; } template <typename T, typename... Args> void debug(string s, T x, Args... args) { for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == ( || s[i] == { ) b++; else if (s[i] == ) || s[i] == } ) b--; else if (s[i] == , && b == 0) { cerr << 033[1;35m << s.substr(0, i) << 033[0;32m = 033[33m << x << 033[31m | ; debug(s.substr(s.find_first_not_of( , i + 1)), args...); break; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, d; cin >> n >> d; vector<array<int, 3>> x(n); for (int i = 0; i < n; i++) { int s, a; cin >> s >> a; x[i] = {max(s, a), s, a}; } int ret = 0; sort(x.begin(), x.end()); for (auto [_, s, a] : x) if (s >= d) { ret++; d = max(d, a); } cout << ret << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using lli = long long; using lld = long double; using ulli = unsigned long long int; using pll = pair<lli, lli>; using ttt = pair<lli, pll>; using vttt = vector<ttt>; using vll = vector<pll>; using vl = vector<lli>; using vi = vector<int>; using vvi = vector<vector<int>>; using cd = complex<lld>; void sanjeev(int kkkk) { int t; cin >> t; while (t > 0) { t--; long long int a, b, x, y; cin >> a >> b >> x >> y; long long int n; cin >> n; long long int sa = min(n, a - x); long long int sb = min(n, b - y); if (a - sa < b - sb) { a -= sa; n -= sa; sb = min(n, b - y); b -= sb; cout << a * b << n ; } else { b -= sb; n -= sb; sa = min(n, a - x); a -= sa; cout << a * b << n ; } } } int main() { if (!0) ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed << setprecision(10); int t = 1; for (int i = 0; i < t; i++) { sanjeev(i + 1); } if (0) system( pause ); } |
#include <bits/stdc++.h> using namespace std; vector<int> x[100000], G[100000]; int n, a[100000], col[100000], cnt, p[2001][1000]; long long ret = 1, ret2 = 0; long long gcd(long long r, long long s) { if (s == 0) return r; return gcd(s, r % s); } void dfs(int pos) { if (col[pos] >= 1) return; col[pos] = cnt; G[cnt].push_back(pos); for (int i = 0; i < x[pos].size(); i++) dfs(x[pos][i]); } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; x[i].push_back(a[i]); x[a[i]].push_back(i); } for (int i = 0; i < n; i++) { if (col[i] >= 1) continue; cnt++; dfs(i); } for (int i = 1; i <= cnt; i++) { for (int j = 0; j <= 2000; j++) { for (int k = 0; k < 1000; k++) p[j][k] = 0; } for (int j : G[i]) p[0][j] = j; for (int j = 0; j < 2000; j++) { for (int k : G[i]) { p[j + 1][k] = a[p[j][k]]; } } long long cnt2 = 0, cnt3 = 0; for (int j = 1; j <= 1000; j++) { bool OK = true; for (int k = 0; k < n; k++) { if (p[j][k] != p[2 * j][k]) OK = false; } if (OK == true) { if (cnt2 == 0) cnt2 = j; else { cnt3 = j; break; } } } ret = ret / gcd(ret, cnt3 - cnt2) * (cnt3 - cnt2); ret2 = max(ret2, cnt2); } long long B = ret; while (ret2 > B) B += ret; cout << B << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int MAXN = 50 + 10; template <typename T> inline void add(T& a, T b) { a += b; if (a >= MOD) a -= MOD; } int main() { static long long g[MAXN][MAXN]; static long long f[MAXN][MAXN]; static long long F[MAXN][MAXN]; static long long inv[MAXN]; ios::sync_with_stdio(0); int n, m; cin >> n >> m; inv[0] = inv[1] = 1; for (int i = 2; i <= n; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD; f[0][1] = 1; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= i + 1; ++j) { for (int p = 0; p <= i - 1; ++p) { for (int q = j; q <= p + 1; ++q) add(g[i][j], f[p][q] * f[i - 1 - p][j] % MOD); for (int q = j + 1; q <= i - p; ++q) add(g[i][j], f[p][j] * f[i - 1 - p][q] % MOD); } memset(F, 0, sizeof(F)); for (int k = 0; k <= n; ++k) { for (int p = 1; p <= k + 1; ++p) { long long c = 1; for (int q = 1; k + q * i <= n; ++q) { c = c * (g[i][j] + q - 1) % MOD * inv[q] % MOD; add(F[k + q * i][p + q * j], f[k][p] * c % MOD); } } } for (int k = 0; k <= n; ++k) for (int p = 1; p <= k + 1; ++p) add(f[k][p], F[k][p]); } } cout << f[n][m] << endl; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n; cin >> n; string s1, s2; cin >> s1 >> s2; long long a = 0, b = 0, c = 0, d = 0; vector<long long> a1, b1, c1, d1; for (long long i = 0; i < n; ++i) { if (s1[i] == 1 && s2[i] == 1 ) { d++; d1.push_back(i + 1); } if (s1[i] == 1 && s2[i] == 0 ) { c++; c1.push_back(i + 1); } if (s1[i] == 0 && s2[i] == 1 ) { b++; b1.push_back(i + 1); } if (s1[i] == 0 && s2[i] == 0 ) { a++; a1.push_back(i + 1); } } long long x; for (long long i = 0; i <= min(b, n / 2); ++i) { for (long long j = 0; j <= min(c, n / 2 - i); ++j) { if (j < b - i) { x = b - i - j; if (x > d || (d - x) % 2) continue; x = x + (d - x) / 2; if (x + i + j > n / 2 || (n / 2 - (x + i + j)) > a) continue; } else { x = j - b + i; if (x > d || (d - x) % 2) continue; x = (d - x) / 2; if (x + i + j > n / 2 || (n / 2 - (x + i + j)) > a) continue; } for (long long u = 0; u < i; ++u) { cout << b1[u] << ; } for (long long u = 0; u < j; ++u) { cout << c1[u] << ; } for (long long u = 0; u < x; ++u) { cout << d1[u] << ; } for (long long u = 0; u < n / 2 - i - j - x; ++u) { cout << a1[u] << ; } return 0; } } cout << -1; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int n, m; map<int, bool> ma, mb; int a[maxn], b[maxn]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (ma[a[i]] == true) { printf( 0 n ); return 0; } ma[a[i]] = true; } int ans = 3; for (int i = 1; i <= n; i++) { b[i] = (a[i] & m); if (ma[b[i]] == true && a[i] != b[i]) { ans = min(ans, 1); break; } if (mb[b[i]] == true) { ans = min(ans, 2); } mb[b[i]] = true; } if (ans == 3) ans = -1; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1600 + 5; const int dr[] = {0, 0, 1, -1, 1, -1, 1, -1}; const int dc[] = {1, -1, 0, 0, 1, 1, -1, -1}; int n, m, nr, nc, cnt, ct; bool grid[MAX][MAX], x[MAX][MAX], y[MAX][MAX], z[MAX][MAX], val; vector<int> ans; pair<int, int> cur; bool inside(int r, int c) { if (r > 0 && r <= n && c > 0 && c <= m) return 1; return 0; } void dfs(int r, int c) { grid[r][c] = 0; x[r][c] = 1; for (int i = 0; i <= 3; i++) { nr = r + dr[i], nc = c + dc[i]; if (!grid[nr][nc]) continue; dfs(nr, nc); } } void cs() { for (int r = 1; r <= n; r++) for (int c = 1; c <= m; c++) { if (!x[r][c]) continue; if (!inside(r - 1, c - 1)) continue; if (!inside(r + 1, c + 1)) continue; val = 1; for (int k = 0; k <= 7; k++) if (!x[r + dr[k]][c + dc[k]]) { val = 0; break; } if (val) { y[r][c] = 1; for (int k = 0; k <= 7; k++) y[r + dr[k]][c + dc[k]] = 1; } } } void cas() { for (int r = 1; r <= n; r++) for (int c = 1; c <= m; c++) { if (!x[r][c]) continue; if (!inside(r - 2, c - 2)) continue; if (!inside(r + 2, c + 2)) continue; val = 1; for (int i = r - 2; i <= r + 2; i++) for (int j = c - 2; j <= c + 2; j++) if (!x[i][j]) { val = 0; break; } if (val) for (int i = r - 2; i <= r + 2; i++) for (int j = c - 2; j <= c + 2; j++) z[i][j] = 1; } for (int r = 1; r <= n; r++) for (int c = 1; c <= m; c++) z[r][c] ^= y[r][c]; } void cast() { for (int r = 1; r <= n; r++) for (int c = 1; c <= m; c++) { if (!z[r][c]) continue; if (!inside(r - 1, c - 1)) continue; if (!inside(r + 1, c + 1)) continue; val = 1; for (int k = 0; k <= 7; k++) if (!z[r + dr[k]][c + dc[k]]) { val = 0; break; } y[r][c] = val; } } void df(int r, int c) { ct++; y[r][c] = 0; for (int i = 0; i <= 7; i++) { nr = r + dr[i], nc = c + dc[i]; if (!y[nr][nc]) continue; df(nr, nc); } } void hit() { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (!y[i][j]) continue; df(i, j); cnt++; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> grid[i][j]; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (!grid[i][j]) continue; memset(x, 0, sizeof x); memset(y, 0, sizeof y); memset(z, 0, sizeof z); dfs(i, j); cs(); cas(); memset(y, 0, sizeof y); cast(); cnt = 0; hit(); ans.push_back(cnt); } sort(ans.begin(), ans.end()); cout << ans.size() << endl; for (auto i : ans) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200200], b[200200]; set<pair<long long, long long> > s; set<pair<long long, long long> >::iterator it, it2; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, i; cin >> n; for (i = 0; i < n; i++) cin >> a[i], s.insert({a[i], i}); for (it = s.begin(); it != s.end();) { it2 = it; it2++; if (it2 == s.end()) break; if ((*it).first == (*it2).first) { s.insert({(*it).first * 2, (*it2).second}); s.erase(it2); it2 = it; it++; s.erase(it2); } else it++; } for (auto x : s) { b[x.second] = x.first; } cout << s.size() << endl; for (i = 0; i < n; i++) { if (b[i]) cout << b[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 101010 * 2; int a[maxn], n, m; int b[maxn]; int p[maxn]; int query(int poin, long long l, bool dir) { int tv; int cir; int las; if (dir) { tv = upper_bound(b + 1, b + 1 + n, b[poin] + l) - b - 1; if (tv == poin) return p[poin]; cir = l / (b[tv] - b[poin]); las = l % (b[tv] - b[poin]); if (cir & 1) return query(tv, las, !dir); else return query(poin, las, dir); } else { tv = lower_bound(b + 1, b + 1 + n, b[poin] - l) - b; if (tv == poin) return p[poin]; cir = l / (b[poin] - b[tv]); las = l % (b[poin] - b[tv]); if (cir & 1) return query(tv, las, !dir); else return query(poin, las, dir); } return 0; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = a[i]; } sort(b + 1, b + 1 + n); for (int i = 1; i <= n; i++) { p[lower_bound(b + 1, b + 1 + n, a[i]) - b] = i; } while (m--) { int poin, l; scanf( %d%d , &poin, &l); poin = lower_bound(b + 1, b + 1 + n, a[poin]) - b; int tv = upper_bound(b + 1, b + 1 + n, b[poin] + l) - b - 1; printf( %d n , query(tv, l - (b[tv] - b[poin]), 0)); } } |
#include <bits/stdc++.h> using namespace std; int64_t nearest_power_of_2(int64_t a) { int cnt = 0; while (a / 2 != 0) { a = a / 2; cnt++; } return cnt; } int main() { int64_t t; cin >> t; for (int i = 0; i < t; i++) { int64_t n; cin >> n; vector<int64_t> v; for (int j = 0; j < n; j++) { int64_t k; cin >> k; v.push_back(k); } int64_t max = 0; int64_t b = 0; for (int j = 0; j < n - 1; j++) { if (v[j + 1] < v[j]) { b++; int64_t d = v[j] - v[j + 1]; if (max < nearest_power_of_2(d)) { max = nearest_power_of_2(d); } v[j + 1] = v[j]; } } if (max == 0 && b == 0) { cout << 0 << endl; } else { cout << max + 1 << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 2000; const int maxm = 1000 * 10; struct edge { int v, w, next; } e[maxm * 2]; struct node { int d, u; bool operator<(const node &b) const { return d > b.d; } }; int head[maxn], d[maxn], d2[maxn]; int tot; bool vis[maxn]; int g[maxn][maxn]; void add(int u, int v, int w) { e[tot].v = v; e[tot].w = w; e[tot].next = head[u]; head[u] = tot++; } void dijkstra(int s, int t, int n, bool dir) { for (int i = 1; i <= n; i++) { if (dir) d[i] = INF; else d2[i] = INF; } if (dir) d[s] = 0; else d2[s] = 0; memset(vis, 0, sizeof(vis)); priority_queue<node> q; q.push(node{0, s}); while (!q.empty()) { node temp = q.top(); q.pop(); int u = temp.u; if (vis[u]) continue; vis[u] = 1; for (int i = head[u]; i != -1; i = e[i].next) { int v = e[i].v; int w = e[i].w; if (dir) { if (d[v] > d[u] + w) { d[v] = d[u] + w; q.push(node{d[v], v}); } } else { if (d2[v] > d2[u] + w) { d2[v] = d2[u] + w; q.push(node{d2[v], v}); } } } } } int main() { int n, m, s, t, u, v; cin >> n >> m >> s >> t; memset(head, -1, sizeof(head)); for (int i = 0; i < m; i++) { cin >> u >> v; g[u][v] = 1; g[v][u] = 1; add(u, v, 1); add(v, u, 1); } dijkstra(s, t, n, true); dijkstra(t, s, n, false); long long ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (!g[i][j] && i != j) { if (d[i] + d2[j] + 1 >= d[t] && d2[i] + d[j] + 1 >= d[t]) { ans++; g[i][j] = g[j][i] = true; } } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; long long n, h, f[100], g[100][100]; long long fun(long long x) { int i; if (f[x] > -1) return 0; f[x] = 0; for (i = 0; i < x; ++i) { fun(i); fun(x - i - 1); f[x] += f[i] * f[x - i - 1]; } return 0; } long long rec(long long x, long long d) { int i; if (g[x][d] > -1) return 0; g[x][d] = 0; if (d > x) return 0; if (d == 1) { g[x][d] = f[x]; return 0; } for (i = 0; i < x; ++i) { rec(i, d - 1); rec(x - i - 1, d - 1); g[x][d] += g[i][d - 1] * f[x - i - 1] + g[x - i - 1][d - 1] * f[i] - g[i][d - 1] * g[x - i - 1][d - 1]; } return 0; } int main() { int i, j; cin >> n >> h; for (i = 0; i <= n; ++i) f[i] = -1; f[0] = 1; for (i = 0; i <= n; ++i) for (j = 0; j <= n; ++j) g[i][j] = -1; g[0][0] = 1; fun(n); rec(n, h); cout << g[n][h] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long r; cin >> r; if (r % 2 == 0 || r == 1 || r == 3) cout << NO ; else { long long x, y; long long up = (r - 1); for (int i = 1; i < 100000; i++) { if ((up / i - i - 1) % 2 == 0) { x = i; y = (up / i - i - 1) / 2; break; } } cout << x << << y; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; const long long N = 100011; void solve() { long long n, ans = 0; cin >> n; pair<long long, long long> a[n + 17]; multiset<long long> s; for (long long i = 1; i <= n; i++) cin >> a[i].first; for (long long i = 1; i <= n; i++) cin >> a[i].second; sort(a + 1, a + n + 1); long long sum = 0; long long mn = 0; a[n + 1].first = -1; for (long long ind = 1; ind <= n; ind++) { mn += 1; if (s.empty()) mn = a[ind].first; long long j = ind; while (a[j].first == mn) { s.insert(a[j].second); sum += a[j].second; j += 1; } long long mx = *(--s.end()); sum -= mx; s.erase(s.find(mx)); ans += sum; ind = j - 1; } while (s.size()) { int mx = *(--s.end()); sum -= mx; s.erase(s.find(mx)); ans += sum; } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c = 0; string s; cin >> n >> a >> b >> s; bool turnA; if (a > b) turnA = true; else turnA = false; for (int i = 0; i < s.size(); ++i) { if (s[i] == . ) { if ((i == 0 || s[i - 1] == * ) && a > b) { s[i] = a ; c++; a--; turnA = false; } else if ((i == 0 || s[i - 1] == * ) && a < b) { s[i] = b ; c++; b--; turnA = true; } else if (turnA && a > 0) { s[i] = a ; c++; a--; turnA = false; } else if (!turnA && b > 0) { c++; b--; s[i] = b ; turnA = true; } else turnA = !turnA; } } cout << c << endl; return 0; } |
#include<bits/stdc++.h> using namespace std; int main(){ long long int t,a1,b1,f1,a2,b2,f2,x; cin>>t; while(t--){ x=0; cin>>a1>>a2>>b1>>b2>>f1>>f2; if((a1==f1 && a2==f2) || (b1==f1 && b2==f2)){ // cout<< a ; cout<<0; continue; } if(a1<b1)swap(a1,b1); if(a2<b2)swap(a2,b2); if(a1==b1 && b1==f1 ){ if(a2>f2 && f2>b2)x+=2; x+=a2-b2; // cout<< b ; } else if(a2==b2 && b2==f2){ if(a1>f1 && f1>b1)x+=2; x+=a1-b1; // cout<< c ; } else { x=a1+a2-b1-b2; // cout<< d ; } cout<<x<<endl; } return 0; } |
#include <bits/stdc++.h> const int maxn = 5e5 + 5; int fa[maxn], t[maxn], n, m, k, v, u, ev, eu; int find(int n) { return n == fa[n] ? n : (fa[n] = find(fa[n])); } void merge(int u, int v) { ev = find(v); eu = find(u); if (ev != eu) { fa[ev] = eu; t[eu] += t[ev]; } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) fa[i] = i, t[i] = 1; for (int i = 0; i < m; ++i) { scanf( %d , &k); if (k) scanf( %d , &u); for (int j = 0; j < k - 1; ++j) { scanf( %d , &v); merge(u, v); } } for (int i = 1; i <= n; ++i) printf( %d , t[find(i)]); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const int inf = 0x3f3f3f3f, N = 2e5 + 10; const double pi = acos(-1); using namespace std; char s[N]; int num[N]; int main() { int n, k; while (cin >> n >> k) { scanf( %s , s + 1); memset(num, 0, sizeof(num)); for (int i = 1; s[i]; i++) { if (s[i] == 0 ) num[i] = num[i - 1] + 1; else num[i] = num[i - 1]; } int ans = inf; int last = 0; if (k == 1) { for (int i = 1; i <= n; i++) { if (!last && s[i] == 0 ) last = i; else if (last && s[i] == 0 ) { ans = i - last; break; } } } for (int i = 1; i <= n; i++) { if (s[i] == 1 ) continue; int l = 1, r = n; while (l <= r) { int mid = (l + r) >> 1; int st = max(1, i - mid); int en = min(n, i + mid); if (num[en] - num[st - 1] >= k + 1) r = mid - 1; else l = mid + 1; } ans = min(ans, l); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; long long a[MAXN]; long long b[MAXN]; int n, m; long long c2(long long x) { return (x * (x - 1)) / 2; } long long f(int l) { if (m < l * n) { return -1; } for (int i = 1; i <= n; i++) { if (a[i] < i * l + n * c2(l)) { return -1; } b[i] = a[i] - (i * l + n * c2(l)); } long long res = 0, f = m; for (int i = l; i >= 1; i--) { for (int j = n; j >= 1; j--) { b[j] += j + (i - 1) * n; if (b[j] >= f) { res += f; b[j] -= f; f--; } else { res += b[j]; f = b[j] - 1; b[j] = 0; } } } return res; } int main() { ios_base ::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; } int L = 1, R = (m / n) + 1; while (R - L > 5) { int mid = (L + R) / 2; if (f(mid) < f(mid + 1)) { L = mid; } else { R = mid; } } long long res = 0; for (int i = L; i <= R; i++) { res = max(res, f(i)); } cout << res; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long n, r; cin >> n >> r; long long int sum = 0; if (n == 1) { sum = 1; } else if (n <= r) { sum = ((n - 1) * (n)) / 2 + 1; } else { sum = (r * (r + 1)) / 2; } cout << sum << endl; } } |
#include <bits/stdc++.h> using namespace std; long long n, q, x, y, ans; int main() { cin >> n >> q; while (q--) { cin >> x >> y; ans = 0; if ((x & 1) == (y & 1)) { ans += (x - 1) / 2 * n; x = x % 2; if (x) ans += (y + 1) / 2; else ans += (y / 2) + (n / 2) + (n & 1); } else { ans += (n * n / 2) + (n & 1) + (x - 1) / 2 * n; x = x % 2; if (x) ans += y / 2; else ans += (n / 2) + (y + 1) / 2; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, p, q, r; cin >> n >> p >> q >> r; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } long long dp[n][3]; dp[0][0] = 1ll * p * a[0]; for (int i = 1; i < n; i++) { dp[i][0] = max(dp[i - 1][0], 1ll * p * a[i]); } dp[0][1] = dp[0][0] + 1ll * q * a[0]; for (int i = 1; i < n; i++) { dp[i][1] = max(dp[i - 1][1], dp[i][0] + 1ll * q * a[i]); } dp[0][2] = dp[0][1] + 1ll * r * a[0]; for (int i = 1; i < n; i++) { dp[i][2] = max(dp[i - 1][2], dp[i][1] + 1ll * r * a[i]); } cout << dp[n - 1][2] << n ; } |
#include <bits/stdc++.h> using namespace std; template <typename T> bool chkmax(T &x, T y) { return x < y ? x = y, true : false; } template <typename T> bool chkmin(T &x, T y) { return x > y ? x = y, true : false; } int readint() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } struct node { int val, id; node(int val = 0, int id = 0) : val(val), id(id) {} bool operator<(const node c) const { return val < c.val; } }; int n, m, g, r; int a[10005]; int d[10005][1005]; bool vis[10005][1005]; priority_queue<node> q; int id(int x, int y) { return (x - 1) * g + y - 1; } void dij() { memset(d, 0x3f, sizeof(d)); q.push(node(0, id(1, g))); d[1][g] = 0; while (!q.empty()) { int tid = q.top().id; q.pop(); pair<int, int> t = make_pair(tid / g + 1, tid % g + 1); if (vis[t.first][t.second]) continue; if (t.first == m) { if (t.second == g) printf( %d n , d[t.first][t.second] - r); else printf( %d n , d[t.first][t.second]); return; } vis[t.first][t.second] = 1; if (t.first > 1) { int tx = t.first - 1, ty = t.second - a[t.first] + a[t.first - 1]; if (ty > 0) { if (chkmin(d[tx][ty], d[t.first][t.second] + a[t.first] - a[t.first - 1])) q.push(node(-d[tx][ty], id(tx, ty))); } if (t.second == a[t.first] - a[t.first - 1]) { ty = g; if (chkmin(d[tx][ty], d[t.first][t.second] + a[t.first] - a[t.first - 1] + r)) q.push(node(-d[tx][ty], id(tx, ty))); } } if (t.first < m) { int tx = t.first + 1, ty = t.second - a[t.first + 1] + a[t.first]; if (ty > 0) { if (chkmin(d[tx][ty], d[t.first][t.second] + a[t.first + 1] - a[t.first])) q.push(node(-d[tx][ty], id(tx, ty))); } if (t.second == a[t.first + 1] - a[t.first]) { ty = g; if (chkmin(d[tx][ty], d[t.first][t.second] + a[t.first + 1] - a[t.first] + r)) q.push(node(-d[tx][ty], id(tx, ty))); } } } printf( -1 n ); } int main() { n = readint(); m = readint(); for (int i = 1; i <= m; i++) a[i] = readint(); sort(a + 1, a + m + 1); g = readint(); r = readint(); dij(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; bool vis[N]; pair<int, int> pt[N]; int dp[N]; int main() { memset(dp, 0x3f, sizeof(dp)); int a, m, n; cin >> a >> n >> m; for (int i = 1; i <= n; i++) { int l, r; scanf( %d %d , &l, &r); for (int j = l + 1; j <= r; j++) { vis[j] = true; } } for (int i = 1; i <= m; i++) { scanf( %d %d , &pt[i].first, &pt[i].second); } sort(pt + 1, pt + 1 + m); for (int i = 1; i <= pt[1].first; i++) { if (vis[i] == true) { puts( -1 ); return 0; } } dp[0] = 0; int cnt = 1; for (int i = 1; i <= a; i++) { while (cnt <= m && pt[cnt].first < i) cnt++; if (vis[i] == false) dp[i] = dp[i - 1]; else { for (int j = 1; j < cnt; j++) { dp[i] = min(dp[i], dp[pt[j].first] + pt[j].second * (i - pt[j].first)); } } } printf( %d n , dp[a]); return 0; } |
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << ( << p.first << , << p.second << ) ; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; for (int i = 0; i < (int)v.size(); i++) { if (i) { os << , ; } os << v[i]; } os << } ; return os; } ostream &operator<<(ostream &os, const set<int> &se) { os << { ; int now = 0; for (auto x : se) { if (now) { os << , ; } os << x; now++; } os << } ; return os; } void debugg() { cerr << endl; } template <class T, class... Args> void debugg(const T &x, const Args &...args) { cerr << << x; debugg(args...); } using namespace std; const int inf = (1 << 30) - 1; const long long linf = 1LL << 61; const int MAX = 510000; int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1}; int dx[8] = {-1, 0, 1, 0, 1, -1, 1, -1}; const double pi = acos(-1); const double eps = 1e-8; template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true; } else return false; } template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true; } else return false; } template <typename T> inline void print(T &a) { int sz = a.size(); for (auto itr = a.begin(); itr != a.end(); itr++) { cout << *itr; sz--; if (sz) cout << ; } cout << n ; } template <typename T1, typename T2> inline void print2(T1 a, T2 b) { cout << a << << b << n ; } template <typename T1, typename T2, typename T3> inline void print3(T1 a, T2 b, T3 c) { cout << a << << b << << c << n ; } void mark() { cout << # << n ; } long long pcount(long long x) { return __builtin_popcountll(x); } const int mod = 998244353; template <typename T> struct BIT { vector<T> dat; long long sz; BIT(long long sz) : sz(sz) { dat.assign(++sz, 0); } T sum(long long k) { T ret = 0; for (++k; k > 0; k -= k & -k) ret += dat[k]; return (ret); } void add(long long k, T x) { for (++k; k < dat.size(); k += k & -k) dat[k] += x; } long long get(T k) { if (k <= 0) return 0; long long ret = 0; int n = 1; while (n < sz) n *= 2; for (int i = n / 2; i > 0; i /= 2) { if (ret + i < sz && dat[ret + i] < k) { k -= dat[ret + i]; ret += i; } } return ret; } }; void solve() { int n, m; cin >> n >> m; vector<pair<long long, long long>> a(n * m); vector<long long> b(n * m); for (int i = 0; i < (n * m); i++) { cin >> a[i].first; a[i].second = i; b[i] = a[i].first; } sort((a).begin(), (a).end()); vector<vector<long long>> c(n, vector<long long>(m)); for (int i = 0; i < (n); i++) for (int j = 0; j < (m); j++) { c[i][j] = a[i * m + j].second; } for (int i = 0; i < (n); i++) for (int j = 0; j < (m); j++) { int k = j + 1; while (k < m && b[c[i][k]] == b[c[i][j]]) k++; reverse(c[i].begin() + j, c[i].begin() + k); j = k - 1; } vector<pair<long long, long long>> pos(n * m); for (int i = 0; i < (n); i++) for (int j = 0; j < (m); j++) { pos[c[i][j]] = {i, j}; } long long ans = 0; vector<BIT<long long>> bit(n, BIT<long long>(m)); for (int i = 0; i < (n * m); i++) { ans += bit[pos[i].first].sum(pos[i].second); bit[pos[i].first].add(pos[i].second, 1); } cout << ans << n ; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int t = 1; cin >> t; while (t--) { solve(); } } |
#include<bits/stdc++.h> #define ll long long #define R return #define pb push_back #define SI size() using namespace std; long long t,n,a[100030],ans,w[5030]; int main(){ cin >> t; while(t--){ ans = 0; memset(w,0,sizeof w); cin >> n; for(int i=0;i<n;i++) cin >> a[i]; for(int i=0;i<n;i++){ if(a[i] - w[i] > 1) ans += a[i] - w[i] - 1; if(a[i] - w[i] < 1) w[i+1] += 1 - a[i] + w[i]; if(a[i] > 1) for(int j=i+2;j<=min(i+a[i],n);j++) w[j]++; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void _R(T &x) { cin >> x; } void _R(int &x) { scanf( %d , &x); } void _R(int64_t &x) { scanf( %lld , &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R() {} template <class T, class... U> void R(T &head, U &...tail) { _R(head); R(tail...); } template <class T> void _W(const T &x) { cout << x; } void _W(const int &x) { printf( %d , x); } void _W(const int64_t &x) { printf( %lld , x); } void _W(const double &x) { printf( %.16f , x); } void _W(const char &x) { putchar(x); } void _W(const char *x) { printf( %s , x); } template <class T, class U> void _W(const pair<T, U> &x) { _W(x.first); putchar( ); _W(x.second); } template <class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar( ); } void W() {} template <class T, class... U> void W(const T &head, const U &...tail) { _W(head); putchar(sizeof...(tail) ? : n ); W(tail...); } template <class T, class... U> void DEBUG(const T &head, const U &...tail) {} int MOD = 1e9 + 7; void ADD(long long &x, long long v) { x = (x + v) % MOD; if (x < 0) x += MOD; } const int SIZE = 5e5 + 10; long long mypow(long long x, long long y) { x %= MOD; long long res = 1 % MOD; while (y) { if (y & 1) res = res * x % MOD; y >>= 1; x = x * x % MOD; } return res; } int ll[2][SIZE]; int d[SIZE], dn; vector<pair<int, int> > seg[2]; template <class T> void maa(T &x, T y) { if (x < y) x = y; } template <class T> void mii(T &x, T y) { if (x > y) x = y; } int get_v(int x) { return lower_bound(d, d + dn, x) - d; } int get_len(int x) { return d[x] - d[x - 1]; } struct BIT { int _n; long long _d[SIZE]; void init(int __n) { _n = __n; memset(_d, 0, sizeof(long long) * (_n + 1)); } void ins(int x, long long v) { x++; for (; x <= _n; x += x & -x) ADD(_d[x], v); } long long qq(int x) { x++; long long res = 0; for (; x; x -= x & -x) ADD(res, _d[x]); return res; } long long qq_range(int x, int y) { long long ret = qq(y); if (x) ADD(ret, -qq(x - 1)); return ret; } } bit[2]; int main() { int K, N, M; R(K, N, M); if (N + M == 0) { W(mypow(2, K)); return 0; } d[dn++] = 0; for (int i = 0; i < (N); ++i) { int x, y; R(x, y); d[dn++] = x - 1; d[dn++] = y; seg[0].push_back(make_pair(x - 1, y)); } for (int i = 0; i < (M); ++i) { int x, y; R(x, y); d[dn++] = x - 1; d[dn++] = y; seg[1].push_back(make_pair(x - 1, y)); } sort(d, d + dn); dn = unique(d, d + dn) - d; for (int j = 0; j < (2); ++j) { for (int i = 0; i < (((int)(seg[j]).size())); ++i) { maa(ll[j][get_v(seg[j][i].second)], get_v(seg[j][i].first) + 1); } } for (int i = 0; i < (2); ++i) bit[i].init(dn + 2); bit[0].ins(1, mypow(2, get_len(1)) - 2); if (ll[0][1] == 0) { bit[1].ins(0, 1); } if (ll[1][1] == 0) { bit[0].ins(0, 1); } int bb[2] = {}; for (int i = (2); i < (dn); ++i) { long long both[2] = {}; int len = get_len(i); for (int j = 0; j < (2); ++j) ADD(both[j], bit[j].qq(i - 1)); while (bb[0] < ll[1][i]) { long long v = bit[0].qq_range(bb[0], bb[0]); bit[0].ins(bb[0], -v); bb[0]++; } if (ll[1][i] != i) bit[0].ins(i - 1, both[1]); while (bb[1] < ll[0][i]) { long long v = bit[1].qq_range(bb[1], bb[1]); bit[1].ins(bb[1], -v); bb[1]++; } if (ll[0][i] != i) bit[1].ins(i - 1, both[0]); bit[0].ins(i, (both[0] + both[1]) * (mypow(2, len) - 2) % MOD); } long long ans = 0; for (int i = 0; i < (2); ++i) ADD(ans, bit[i].qq(dn)); W(ans * mypow(2, (K - d[dn - 1])) % MOD); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:60000000 ) using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = 3.1415926535897932384626433832795; const string task = ; template <class T> T sqr(T x) { return x * x; } int n, m; int a[100500]; int last[100500]; char ans[100500]; int x[100500], y[100500]; void solve() { scanf( %d%d , &n, &m); for (int i = 0; i < (int)(m); i++) { scanf( %d , &a[i]); ans[i] = N ; last[i] = -1; } for (int i = 0; i < (int)(n - 1); i++) { scanf( %d%d , &x[i], &y[i]); x[i]--; if (x[i] >= 0) last[x[i]] = i; } int s = 0; bool first = 1; for (int i = 0; i < (int)(n - 1); i++) { if (first && y[i] == 1) { first = 0; int mn = inf; for (int j = 0; j < (int)(m); j++) if (a[j] <= s && last[j] < i) { ans[j] = Y ; mn = min(mn, a[j]); } s -= mn; } if (x[i] != -1) { a[x[i]]--; } else { s++; } } cerr << s << endl; for (int i = 0; i < (int)(m); i++) if (a[i] <= s) ans[i] = Y ; for (int i = 0; i < (int)(m); i++) { printf( %c , ans[i]); } printf( n ); } int main() { int tt; scanf( %d , &tt); for (int ii = 0; ii < (int)(tt); ii++) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5, oo = 0x3f3f3f3f; pair<int, int> stop[maxn]; int nxt[maxn]; int main(void) { int d, n, m; scanf( %d%d%d , &d, &n, &m); int x, y; for (int i = 1; i <= m; i++) { scanf( %d%d , &x, &y); stop[i] = pair<int, int>(x, y); } stop[0] = pair<int, int>(0, 0); stop[m + 1] = pair<int, int>(d, 0); sort(stop, stop + m + 1); stack<int> s; memset(nxt, -1, sizeof(nxt)); for (int i = m; i >= 1; i--) { while (!s.empty() && stop[i].second <= stop[s.top()].second) s.pop(); if (s.empty()) nxt[i] = m + 1; else nxt[i] = s.top(); s.push(i); } nxt[0] = s.top(); int after; long long ans = 0; int now = n; int dist; for (int i = 0; i <= m + 1; i++) { if (now < 0) return puts( -1 ), 0; dist = stop[nxt[i]].first - stop[i].first; if (dist > now) after = dist; else after = now; if (after > n) after = n; ans += (after - now) * 1ll * stop[i].second; after -= stop[i + 1].first - stop[i].first; now = after; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; bool cmp(int a, int b) { return a > b; } int h[2005]; int main() { int i, n, a, b, ans = 0; scanf( %d %d %d , &n, &a, &b); for (i = 0; i < n; ++i) scanf( %d , &h[i]); sort(h, h + n, cmp); if (h[a - 1] > h[a]) ans = h[a - 1] - h[a]; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200100; int t, n; int MOD; vector<pair<long long int, long long int> > v[N]; long long int kol[N]; long long int gotov[N], sad, a, b; long long int c; long long int sol; vector<long long int> p; long long int FI; long long int inv[N], inv1[N]; long long int powmod(long long int a, long long int x) { long long int rez = 1; while (x) { if (x % 2) { rez = ((rez % MOD) * (a % MOD)) % MOD; } a = ((a % MOD) * (a % MOD)) % MOD; x /= 2; } return rez % MOD; } long long int divide(long long int a, long long int dub) { return a * inv[dub] % MOD; } int djeca(int node, int par) { kol[node] = 0; for (int i = 0; i < v[node].size(); i++) { if (v[node][i].first != par && !gotov[v[node][i].first]) kol[node] += djeca(v[node][i].first, node); } kol[node]++; return kol[node]; } int centr(int node, int par, int sz) { for (int i = 0; i < v[node].size(); i++) { if (v[node][i].first != par && !gotov[v[node][i].first] && kol[v[node][i].first] > sz / 2) { return centr(v[node][i].first, node, sz); } } return node; } map<long long int, long long int> m; map<long long int, long long int> pom[N]; void dfs(int node, int par, long long int x, long long int y, int d, int turn) { int di = ((-y) % MOD + MOD) % MOD; di = divide(di, d) % MOD; if (par != -1) sol += (m[di] - pom[turn][di]); if (!x && par != -1) sol++; if (!y && par != -1) sol++; for (int i = 0; i < v[node].size(); i++) { if (v[node][i].first != par && !gotov[v[node][i].first]) { int kamo; if (par == -1) kamo = i; else kamo = turn; long long int novix = ((v[node][i].second * inv1[d]) % MOD + x) % MOD; long long int noviy = ((y * 10) % MOD + v[node][i].second) % MOD; dfs(v[node][i].first, node, novix, noviy, d + 1, kamo); if (par == -1) pom[i].clear(); } } return; } void broji(int node, int par, long long int x, int d, int turn) { if (par != -1) { m[x % MOD]++; pom[turn][x % MOD]++; } for (int i = 0; i < v[node].size(); i++) { if (v[node][i].first != par && !gotov[v[node][i].first]) { int kamo; if (par == -1) kamo = i; else kamo = turn; long long int novix = ((v[node][i].second * inv1[d]) % MOD + x) % MOD; broji(v[node][i].first, node, novix, d + 1, kamo); } } return; } void decomp(int node, int par) { kol[node] = djeca(node, par); int sad = centr(node, par, kol[node]); broji(sad, -1, 0, 0, 0); dfs(sad, -1, 0, 0, 0, 0); m.clear(); gotov[sad] = 1; for (int i = 0; i < v[sad].size(); i++) { if (!gotov[v[sad][i].first]) decomp(v[sad][i].first, node); } return; } void solve() { cin >> n >> MOD; for (int i = 0; i < n - 1; i++) { cin >> a >> b >> c; v[a].push_back(make_pair(b, c)); v[b].push_back(make_pair(a, c)); } long long int k = MOD; long long int result = MOD; for (int p = 2; p * p <= k; ++p) { if (k % p == 0) { while (k % p == 0) k /= p; result -= result / p; } } if (k > 1) result -= result / k; FI = result; for (int i = 0; i <= n; i++) { inv1[i] = powmod(10, i); } for (int i = 0; i <= n; i++) { inv[i] = powmod(inv1[i], FI - 1); } decomp(0, -1); cout << sol << endl; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool debug = 0; long long a[26], dp[26][26]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tc = 1; while (tc--) { string s; cin >> s; int n = s.length(); long long mx = 0; for (int i = 0; i < n; i++) { int x = s[i] - a ; for (int j = 0; j < 26; j++) { dp[j][x] += a[j]; mx = mx > dp[j][x] ? mx : dp[j][x]; } a[x]++; mx = mx > a[x] ? mx : a[x]; } cout << mx; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool pal(string& s) { int j = s.size() - 1; int i = 0; while (i < j) { if (s[i++] != s[j--]) return false; } return true; } int main() { string s; cin >> s; int n = s.size(); for (int len = n; len >= 0; len--) { for (int start = 0; start + len - 1 < n; start++) { string sub = s.substr(start, len); if (pal(sub)) continue; else { cout << len << endl; return 0; } } } cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e9 + 7; bool isPoTwo(long long int x) { return x && (!(x & (x - 1))); } long long int power(long long int x, unsigned long long int y, long long int p) { long long int 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; } void solve() { long long int n, x, y, d; cin >> n >> x >> y >> d; long long int ans = INT_MAX, ans1 = INT_MAX, ans2 = INT_MAX; if ((y - x) % d == 0) ans = (abs(y - x) / d); if ((y - 1) % d == 0 || (n - y) % d == 0) { if ((y - 1) % d == 0) { ans1 = (y - 1) / d; ans1 += ((x - 1) / d) + 1; } if ((n - y) % d == 0) { ans2 = (n - y) / d; ans2 += ((n - x) / d) + 1; } ans = min(ans, ans2); ans = min(ans, ans1); } if (ans == INT_MAX) ans = -1; cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, mn = INT_MAX, ans = INT_MAX; cin >> n; map<int, int> mp; map<int, int> mp_ans; for (int i = 1; i <= n; i++) { cin >> a; if (mp[a] == 0) mp[a] = i; else { if (a <= mn) { mn = a; if (mp_ans[a] != 0) { ans = min(mp_ans[a], i - mp[a]); mp_ans[a] = ans; } else { mp_ans[a] = i - mp[a]; } } mp[a] = i; } } cout << mp_ans[mn]; } |
#include <bits/stdc++.h> using namespace std; long long pow(int a, int b, long long MOD) { long long x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y); if (x > MOD) x %= MOD; } y = (y * y); if (y > MOD) y %= MOD; b /= 2; } return x; } long long InverseEuler(int n, long long MOD) { return pow(n, MOD - 2, MOD); } int hcf(int n1, int n2) { if (n2 != 0) return hcf(n2, n1 % n2); else return n1; } int p[100090] = {}; void prime() { for (int i = 2; i * i <= 100009; i++) if (p[i] == 0) for (int j = i + i; j <= 100009; j += i) p[j] = 1; p[0] = 1; p[1] = 1; } int main() { int a[100002]; int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int b[100002], c[100002], f = -1; for (int i = 1; i < n; i++) { b[i] = abs(a[i] - a[i - 1]) * f; f *= -1; } f = -1; for (int i = 1; i < n; i++) { c[i] = b[i] * -1; } long long sum = 0, mx = INT_MIN, k = 1; for (int i = 1; i < n; i++) { sum += b[i]; if (sum < 0) sum = 0; mx = max(mx, sum); } sum = 0; long long mx1 = INT_MIN, j = 1; for (int i = 1; i < n; i++) { sum += c[i]; if (sum < 0) sum = 0; mx1 = max(mx1, sum); } cout << max(mx, mx1); } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; int n, m; int f[55][405][405], s[405]; void DP() { int i, j, k, mx, my, ans = 0; memset(f, 0, sizeof(f)); for (i = 1, s[0] = 0; i <= n; i++) { scanf( %d , &s[i]); s[i] += s[i - 1]; } for (k = 2; k <= m; k++) { mx = my = -INF; for (i = 1; i <= n; i++) { for (j = i; j <= n; j++) f[k][i][j] = mx + s[j] - s[i - 1] > my - (s[j] - s[i - 1]) ? mx + s[j] - s[i - 1] : my - (s[j] - s[i - 1]); for (j = 1; j <= i; j++) { mx = mx > f[k - 1][j][i] - (s[i] - s[j - 1]) ? mx : f[k - 1][j][i] - (s[i] - s[j - 1]); my = my > f[k - 1][j][i] + (s[i] - s[j - 1]) ? my : f[k - 1][j][i] + (s[i] - s[j - 1]); } } } for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) ans = ans > f[m][i][j] ? ans : f[m][i][j]; printf( %d n , ans); } int main() { while (~scanf( %d%d , &n, &m)) DP(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int fact(int n) { long long ans = n; for (int i = n - 1; i > 0; --i) { ans = (ans * i) % MOD; } return ans; } int pow2(int n) { long long ans = 1, b = 2; while (n > 0) { if (n % 2) { ans = (ans * b) % MOD; } b = (b * b) % MOD; n /= 2; } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; cout << (fact(n) - pow2(n - 1) + MOD) % MOD; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; vector<int> v[maxn]; int dp[maxn]; int a[10][maxn]; int main() { int n, K; cin >> n >> K; for (int i = 0; i < K; i++) { for (int j = 0; j < n; j++) scanf( %d , &a[i][j]), v[a[i][j]].push_back(j); } memset(dp, 0, sizeof(dp)); int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { int p = 0; for (int k = 0; k < K; k++) if (v[a[0][j]][k] > v[a[0][i]][k]) { p = 1; break; } if (p == 0) dp[i] = max(dp[i], dp[j]); } dp[i]++; ans = max(ans, dp[i]); } printf( %d n , ans); return 0; } |
#include <iostream> #include <cmath> #include <vector> #include <algorithm> #include <set> #include <cstdio> #include <map> #include <queue> #include <ctime> #include <iomanip> #include <stack> #include <assert.h> #include <unordered_map> using namespace std; #define F first #define ll long long #define S second #define ld long double #define all(x) x.begin(), x.end() #define rep(i, n) for (int i = 0; i < (int)n; ++i) #define PI acos(-1) ll a, b, c, d, e, fl, maxn, cnt, k, s; vector <ll> ar; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll t = 1; cin >> t; while(t--) { cin >> a; ll last_time = -1; ll last_pos = 0; ll nap = 0; ll pos = 0; ll ans = 0; ll lst = 0, lsp = 0; queue <pair <ll, ll> > q; rep(i, a + 1) { ll p, p1; if (i != a) cin >> p >> p1; else p = (ll)1e15; if (!q.empty()) { pair <ll, ll> pp = q.front(); q.pop(); ll st = last_pos + nap * (pp.F - last_time); ll fin = last_pos + nap * (min(p, lst) - last_time); //cout << i << << st << << fin << << pp.S << n ; if (min(st, fin) <= pp.S && max(st, fin) >= pp.S) ++ans; } if (i == a) continue; if (p >= lst) { last_time = p; last_pos = lsp; lsp = p1; lst = abs(last_pos - p1) + p; if (last_pos > p1) nap = -1; else nap = 1; } q.push({p, p1}); } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; long long a[1005], b[1005]; int main() { int n, l, r; cin >> n; long long bans = 1, aans = 1, mx = 0; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; for (int l = 0; l < n; l++) { for (int r = l; r < n; r++) { aans = 0; bans = 0; for (int i = l; i <= r; i++) { aans |= a[i]; bans |= b[i]; mx = max(mx, aans + bans); } } } cout << mx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, x, y, col[111111], used[111111], size; vector<int> g[111111], L, R, mat[111111]; void paint(int id, int c) { col[id] = c; c == 1 ? L.push_back(id) : R.push_back(id); for (vector<int>::iterator ii = g[id].begin(); ii != g[id].end(); ii++) if (!col[*ii]) paint(*ii, c ^ 3); } void construct() { int now = ++size, cnt = 0; for (vector<int>::iterator ii = L.begin(); ii != L.end(); ii++) { if (used[*ii]) continue; used[*ii] = now; cnt++; if (cnt == 3) { cnt = 0; now = ++size; } } for (vector<int>::iterator ii = R.begin(); ii != R.end(); ii++) { if (used[*ii]) continue; used[*ii] = now; cnt++; if (cnt == 3) { cnt = 0; now = ++size; } } } void print() { printf( YES n ); for (int i = 1; i <= n; i++) printf( %d , used[i]); } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); g[x].push_back(y); g[y].push_back(x); } for (int i = 1; i <= n; i++) if (!col[i]) paint(i, 1); if (L.size() % 3 == 0 && R.size() % 3 == 0) { construct(); print(); return 0; } else { if (L.size() % 3 == 2 && R.size() % 3 == 1) L.swap(R); sort(L.begin(), L.end()); sort(R.begin(), R.end()); for (int i = 1; i <= n; i++) sort(g[i].begin(), g[i].end()); for (vector<int>::iterator ii = L.begin(); ii != L.end(); ii++) if (R.size() - g[*ii].size() > 1) { int cnt = 0; used[*ii] = 1; vector<int>::iterator pp = g[*ii].begin(); for (vector<int>::iterator jj = R.begin(); jj != R.end() && cnt < 2; jj++) { while (pp != g[*ii].end() && *jj > *pp) pp++; if (pp != g[*ii].end() && *pp == *jj) continue; used[*jj] = 1; cnt++; } size = 1; construct(); print(); return 0; } for (vector<int>::iterator ii = R.begin(); ii != R.end(); ii++) if (L.size() - g[*ii].size() > 1) { int cnt = 0; vector<int>::iterator pp = g[*ii].begin(); for (vector<int>::iterator jj = L.begin(); jj != L.end() && cnt < 2; jj++) { while (pp != g[*ii].end() && *jj > *pp) pp++; if (pp != g[*ii].end() && *pp == *jj) continue; cnt++; mat[*ii].push_back(*jj); } } for (vector<int>::iterator ii = R.begin(); ii != R.end(); ii++) if (mat[*ii].size() > 1) for (vector<int>::iterator jj = ii + 1; jj != R.end(); jj++) if (mat[*jj].size() > 1) { used[*ii] = used[mat[*ii][0]] = used[mat[*ii][1]] = 1; used[*jj] = used[mat[*jj][0]] = used[mat[*jj][1]] = 2; size = 2; construct(); print(); return 0; } } printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long m, sum, p; cin >> m; for (int i = 5; i < 400006; i++) { p = 5, sum = 0; while (i / p) sum += i / p, p *= 5; if (sum == m) { cout << 5 n << i << << i + 1 << << i + 2 << << i + 3 << << i + 4; return 0; } } cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; using lint = long long; using ulint = unsigned long long; const int N = 1500 + 1; int a[N]; int bit[N]; int back[N]; int lsb(int x) { return x & -x; } int query(int r) { int res = 0; for (; r > 0; r -= lsb(r)) { res = max(res, bit[r]); } return res; } void update(int r, int k, int id) { for (; r < N; r += lsb(r)) { if (k > bit[r]) { bit[r] = k; back[r] = id; } } } int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] += a[i - 1]; } map<int, vector<pair<int, int>>> sums; for (int l = 1; l <= n; l++) { for (int r = l; r <= n; r++) { sums[a[r] - a[l - 1]].emplace_back(l, r); } } int best = -1, best_sum = -1; for (auto &sum : sums) { fill(begin(bit), end(bit), 0); auto &vec = sum.second; for (int i = 0; i < vec.size(); i++) { auto [l, r] = vec[i]; update(r, query(l - 1) + 1, i); } if (query(n) > best) { best = query(n); best_sum = sum.first; } } cout << best << n ; fill(begin(bit), end(bit), 0); fill(begin(back), end(back), -1); auto &vec = sums[best_sum]; for (int i = 0; i < vec.size(); i++) { auto [l, r] = vec[i]; int k = query(l - 1) + 1; update(r, k, i); if (k == best) { l = n + 1; for (int j = r; j >= 0; j--) { if (best > 0 && bit[j] == best && vec[back[j]].second < l) { cout << vec[back[j]].first << << vec[back[j]].second << n ; best--; l = vec[back[j]].first; } } break; } } } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int ma[10][10]; bool vis[20]; int isok[20][20], tmp[20][20]; int n, m, ok = 0; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; void solve() { puts( YES ); if (n > 4) { for (int i = 1; i <= m; i++) { if (i % 2) { for (int j = 1; j <= n; j += 2) printf( %d , (i - 1) * n + j); for (int j = 2; j <= n; j += 2) printf( %d , (i - 1) * n + j); } else { for (int j = 2; j <= n; j += 2) printf( %d , (i - 1) * n + j); for (int j = 1; j <= n; j += 2) printf( %d , (i - 1) * n + j); } puts( ); } } else { int s1 = 1; int s2 = 2; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { if (j % 2) { if (s1 > m) s1 = 2; printf( %d , (s1 - 1) * n + j); } else { if (s2 > m) s2 = 1; printf( %d , (s2 - 1) * n + j); } } s1 += 2; s2 += 2; puts( ); } } } void init() { for (int i = 1; i < (m + 1); ++i) for (int j = 1; j < (n + 1); ++j) tmp[i][j] = (i - 1) * n + j; for (int i = 1; i < (n * m + 1); ++i) for (int j = 1; j < (m * n + 1); ++j) isok[i][j] = 1; for (int i = 1; i < (m + 1); ++i) for (int j = 1; j < (n + 1); ++j) { for (int k = 0; k < (4); ++k) { int xx = i + dx[k]; int yy = j + dy[k]; if (xx < 1 || xx > m || yy < 1 || yy > n) continue; else isok[tmp[xx][yy]][tmp[i][j]] = isok[tmp[i][j]][tmp[xx][yy]] = 0; } } } void dfs(int dep) { if (dep == n * m || ok) { ok = 1; return; } else { for (int i = 1; i < (n * m + 1); ++i) { int flag = 1; if (vis[i]) continue; else { int flag = 1; ++dep; int row = (dep - 1) / n + 1; int col = (dep - 1) % n + 1; if (row > 1) { int nxt1 = ma[row - 1][col]; if (!isok[nxt1][i]) flag = 0; } if (col > 1) { int nxt2 = ma[row][col - 1]; if (!isok[nxt2][i]) flag = 0; } if (flag == 0) { dep--; continue; } ma[row][col] = i; vis[i] = 1; dfs(dep); if (ok) return; ma[row][col] = 0; vis[i] = 0; --dep; } } } } int main() { scanf( %d%d , &m, &n); if (max(n, m) > 4) solve(); else { init(); for (int i = 1; i < (n * m + 1); ++i) if (!ok) { memset(vis, 0, sizeof(vis)); memset(ma, 0, sizeof(ma)); vis[i] = 1; ma[1][1] = i; dfs(1); } if (!ok) printf( NO ); else { puts( YES ); for (int i = 1; i < (m + 1); ++i) { for (int j = 1; j < (n + 1); ++j) printf( %d , ma[i][j]); puts( ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; for (int i = 0; i < 10; i++) { cout << i << endl; getline(cin, s); if (s == great || s == cool || s == not bad || s == don t touch me || s == don t think so ) { cout << normal n ; return 0; } else if (s == don t even || s == are you serious || s == no way || s == worse || s == terrible || s == go die in a hole ) { cout << grumpy n ; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, pair<long long, long long> > mp; pair<long long, long long> dfs(long long x) { if (x == 0) return make_pair(0, 0); if (mp.count(x)) return mp[x]; long long t = pow(x + 0.5, 1.0 / 3); pair<long long, long long> res = dfs(t * t * t - 1); pair<long long, long long> tmp = dfs(x - t * t * t); res = max(res, make_pair(tmp.first + 1, tmp.second + t * t * t)); mp[x] = res; return res; } int main() { long long m; scanf( %lld , &m); pair<long long, long long> ans = dfs(m); printf( %lld %lld n , ans.first, ans.second); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, m, t; long long sum(int l, int r) { long long sl = a + (l - 1) * b; long long sr = a + (r - 1) * b; return (sl + sr) * (r - l + 1) / 2; } bool chk(int l, int x) { return a + 1LL * (x - 1) * b <= 1LL * t && sum(l, x) <= 1LL * m * t; } int main(void) { int q; cin >> a >> b >> q; while (q--) { int l; cin >> l >> t >> m; int lo = l - 1, hi = 1000000000; while (lo != hi) { int mi = (lo + hi + 1) / 2; if (chk(l, mi)) lo = mi; else hi = mi - 1; } if (lo < l) cout << -1 n ; else cout << lo << n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) using namespace std; template <typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { cout << ( << p.first << , << p.second << ) ; return os; } template <typename T> ostream& operator<<(ostream& os, vector<T>& vec) { os << { ; for (int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? : , ); os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, set<T>& st) { cout << { ; for (auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr) != st.end() ? , : ); cout << } ; return os; } template <typename T1, typename T2> ostream& operator<<(ostream& os, map<T1, T2> mp) { cout << { ; for (auto itr = mp.begin(); itr != mp.end(); itr++) cout << ( << (itr->first) << , << (itr->second) << ) << (next(itr) != mp.end() ? , : ); cout << } ; return os; } void dump_func() { cout << endl; } template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(Tail) == 0) { cout << ; } else { cout << , ; } dump_func(std::move(tail)...); } template <class T> inline bool chmax(T& a, T const& b) { if (a >= b) return false; a = b; return true; } template <class T> inline bool chmin(T& a, T const& b) { if (a <= b) return false; a = b; return true; } void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); return 0; } using ll = long long; using P = pair<int, int>; using Pl = pair<ll, ll>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; const int mod = 1e9 + 7, INF = 1 << 29; const double EPS = 1e-5, PI = 3.1415926535897932384626; const ll lmod = 1e9 + 7, LINF = 1LL << 59; template <int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) {} ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt& operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt& operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt& operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt& operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template <int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; }; template <int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) { ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } template <typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac; Comb() { fac.resize(FAC_MAX, 1); ifac.resize(FAC_MAX, 1); for (int i = 1; i < FAC_MAX; i++) fac[i] = fac[i - 1] * i; ifac[FAC_MAX - 1] = T(1) / fac[FAC_MAX - 1]; for (int i = FAC_MAX - 2; i >= 1; i--) ifac[i] = ifac[i + 1] * T(i + 1); } T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; } T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; } T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0; return aCb(n + k - 1, k); } }; using mint = ModInt<998244353>; using vm = vector<mint>; void _main() { int N; cin >> N; int M; cin >> M; vvl g(N); for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--; b--; g[a].push_back(b); } vl dist(N, LINF); for (int i = 0; i < N; i++) { for (auto u : g[i]) chmin(dist[i], (u - i + N) % N); if (g[i].size() != 0) dist[i] += ll(g[i].size() - 1) * ll(N); if (dist[i] == LINF) dist[i] = 0; } for (int i = 0; i < N; i++) { ll ans = 0; for (int j = 0; j < N; j++) if (g[j].size() != 0) chmax(ans, dist[j] + ll((j - i + N) % N)); cout << ans << (i == N - 1 ? n : ); } } |
#include <bits/stdc++.h> using namespace std; inline void PAUSE() { char tmp; cin >> tmp; } int M[100001]; int f[100001]; int main() { int n; scanf( %d , &n); for (int i = 0; i <= 100000; i++) { M[i] = -1; } int x, k; for (int i = 0; i < n; i++) { scanf( %d %d , &x, &k); if (x - M[k] > 1) { cout << NO ; return 0; } M[k] = x > M[k] ? x : M[k]; f[k] = 1; } cout << YES ; PAUSE(); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long ans = 0; long long a, b, c, s; cin >> s >> a >> b >> c; ans = s / c + (s / c / a) * b; cout << ans << endl; } int main() { int T; cin >> T; while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[256], n, k, p; cin >> n >> k; memset(a, -1, sizeof(a)); for (int i = 0; i < n; i++) { cin >> p; if (a[p] == -1) { for (int j = max(0, p - k + 1); j <= p; j++) if (a[j] == -1 || a[j] == j) { for (int x = j; x <= p; x++) a[x] = j; break; } } cout << a[p] << ; } } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const int mod = inf + 7; const double eps = 1e-9; int a[100][100]; int n, x, y; bool u[400], u1[400]; vector<int> v; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 1; i <= n * n; i++) { cin >> x >> y; if (!u[x] && !u1[y]) { u[x] = 1; u1[y] = 1; v.push_back(i); } } for (int i = 0; i < v.size(); i++) { cout << v[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, k; cin >> n >> k; long long int a[n + 2]; a[0] = 0; pair<long long int, long long int> min; min.first = INT_MAX; for (long long int i = 1; i <= n; i++) { cin >> a[i]; a[i] += a[i - 1]; if (i >= k) { a[i] -= a[i - k]; if (a[i] < min.first) min.first = a[i], min.second = i - k + 1; a[i] += a[i - k]; } } cout << min.second; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1.01e9; const double eps = 1e-9; const int N = 22; double RES = 0; double rf, re, rs; double df, de; int cnt = 0; int a[N]; int ac = 0; int b[N]; int bc = 0; int nf, ne, ns; double e[N]; double FI[200]; double EN[200]; double FIRE(int p) { double res = rf * 2; for (int i = 0; (i) < (bc); ++i) res += FI[abs(b[i] - p)]; res *= df; return res; } double ENERGY(int p) { double res = re * 2; for (int i = 0; (i) < (bc); ++i) res += EN[abs(b[i] - p)]; res *= de; return res; } void solve() { double val = 0; for (int i = 0; (i) < (ac); ++i) { double x = FIRE(a[i]); double y = ENERGY(a[i]); e[i] = x - y; val += y; } sort(e, e + ac); reverse(e, e + ac); for (int i = 0; (i) < (nf); ++i) val += e[i]; RES = max(RES, val); } void go(int x, int y, int pos, int cnt1 = 0, int cnt2 = 0) { if (x == 0 && y == 0) { cnt++; solve(); return; } if (x >= 1 && cnt1 < 2) { a[ac++] = pos; go(x - 1, y, pos + 1, cnt1 + 1, cnt2); ac--; } if (x >= 2) { a[ac++] = pos; a[ac++] = pos; go(x - 2, y, pos + 1, cnt1, cnt2); ac--; ac--; } if (y >= 1 && cnt2 < 1) { b[bc++] = pos; go(x, y - 1, pos + 1, cnt1, cnt2 + 1); bc--; } if (y >= 2) { b[bc++] = pos; b[bc++] = pos; go(x, y - 2, pos + 1, cnt1, cnt2); bc--; bc--; } if (x >= 1 && y >= 1) { a[ac++] = pos; b[bc++] = pos; go(x - 1, y - 1, pos + 1, cnt1, cnt2); ac--; bc--; } } int main() { scanf( %d%d%d , &nf, &ne, &ns); scanf( %lf%lf%lf , &rf, &re, &rs); scanf( %lf%lf , &df, &de); rf = sqrt(max(0., rf * rf - 1)); re = sqrt(max(0., re * re - 1)); rs = sqrt(max(0., rs * rs - 1)); for (int i = 0; i < 100; ++i) { double l1 = -rf; double r1 = rf; double l2 = i - rs; double r2 = i + rs; FI[i] = max(0., min(r1, r2) - max(l1, l2)); } for (int i = 0; i < 100; ++i) { double l1 = -re; double r1 = re; double l2 = i - rs; double r2 = i + rs; EN[i] = max(0., min(r1, r2) - max(l1, l2)); } go(nf + ne, ns, 0); fprintf(stderr, %d n , cnt), fflush(stderr); printf( %.10f n , RES); return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, j, k, l, n, m, last, res; long long a[100009]; queue<long long> q; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + 1 + n); q.push(1); for (i = 2; i <= n; i++) { if (!q.empty() && a[q.front()] < a[i]) { res++; q.pop(); } q.push(i); } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; set<pair<int, int> > s; std::vector<int> vv; std::vector<std::vector<int> > gr; std::vector<int> vis; int k; pair<int, int> dfs(int u, int l) { vis[u] = l; vv.emplace_back(u); for (int v : gr[u]) { if ((vis[v]) && (vis[u] - vis[v]) >= k) { return {vis[v], vis[u]}; } else if (!vis[v]) { return dfs(v, l + 1); } } return {-1, -1}; } int32_t main() { int n; cin >> n; int m; cin >> m; cin >> k; gr.resize(n); for (int i = 0; i < m; ++i) { int u; cin >> u; u--; int v; cin >> v; v--; gr[u].emplace_back(v); gr[v].emplace_back(u); } vis.resize(n, 0); auto pp = dfs(0, 1); cout << pp.second - pp.first + 1 << n ; for (int i = pp.first - 1; i < pp.second; ++i) { cout << vv[i] + 1 << ; } } |
#include <bits/stdc++.h> using namespace std; inline void pisz(int n) { printf( %d n , n); } template <typename T, typename TT> ostream &operator<<(ostream &s, pair<T, TT> t) { return s << ( << t.first << , << t.second << ) ; } template <typename T> ostream &operator<<(ostream &s, vector<T> t) { for (int(i) = 0; (i) < (((int)(t.size()))); ++(i)) s << t[i] << ; return s; } template <typename T, typename Aug> struct AugTreap { struct Node { T v; int pr; Node *le, *ri; Aug al, ag; }; Node *root; AugTreap() : root(0) {} inline static void recalc(Node *&n) { Aug left = n->le ? n->le->ag + n->al : n->al; n->ag = n->ri ? left + n->ri->ag : left; } inline void rotle(Node *&n) { Node *syn = n->le; n->le = syn->ri; syn->ri = n; n = syn; recalc(n->ri); recalc(n); } inline void rotri(Node *&n) { Node *syn = n->ri; n->ri = syn->le; syn->le = n; n = syn; recalc(n->le); recalc(n); } void insert_aux(Node *&n, const T &x, const Aug &aug) { if (!n) { n = new Node; n->v = x; n->pr = rand(); n->le = n->ri = 0; n->al = n->ag = aug; } else if (x < n->v) { insert_aux(n->le, x, aug); if (n->pr > n->le->pr) rotle(n); else recalc(n); } else if (x > n->v) { insert_aux(n->ri, x, aug); if (n->pr > n->ri->pr) rotri(n); else recalc(n); } else { n->al = n->al + aug; recalc(n); } } void insert(const T &x, const Aug &aug) { insert_aux(root, x, aug); } Aug sumgeq_aux(const T &x, Node *n) { if (!n) return Aug(); if (x > n->v) return sumgeq_aux(x, n->ri); if (x < n->v) { Aug left = sumgeq_aux(x, n->le) + n->al; return n->ri ? left + n->ri->ag : left; } return n->ri ? n->al + n->ri->ag : n->al; } Aug sumgeq(const T &x) { return sumgeq_aux(x, root); } }; long long a[100007], prefsum[100007]; int main() { long long n, k; cin >> n >> k; for (int(i) = 1; (i) <= (n); ++(i)) cin >> a[i]; prefsum[0] = 0; for (int(i) = 1; (i) <= (n); ++(i)) prefsum[i] = prefsum[i - 1] + a[i]; long long best = -1000000000; best *= 100000; long long from = best + 1, to = -best; while (from <= to) { long long x = (from + to) / 2; long long dobrychsum = 0, zab = 0; AugTreap<long long, int> tr; for (int(i) = 1; (i) <= (n); ++(i)) tr.insert(prefsum[i], 1); for (int(st) = 1; (st) <= (n); ++(st)) { dobrychsum += tr.sumgeq(x + zab); zab += a[st]; tr.insert(zab, -1); } if (dobrychsum >= k) { best = x; from = x + 1; } else { to = x - 1; } } cout << best; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.