func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x = 1; while (n > 0) { if (n == 3) { cout << x << << x << << 3 * x << ; break; } else { for (int i = 0; i < (n + 1) / 2; i++) { cout << x << ; } x *= 2; n = n - (n + 1) / 2; } } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-9; const int inf = 2000000000; const long long infLL = 9000000000000000000; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline bool checkBit(long long n, int i) { return n & (1LL << i); } inline long long setBit(long long n, int i) { return n | (1LL << i); } inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); } int dx[] = {0, 0, +1, -1, +1, +1, -1, -1}; int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1}; template <typename first, typename second> ostream &operator<<(ostream &os, const pair<first, second> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << *it; } return os << } ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) { os << [ ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename first, typename second> ostream &operator<<(ostream &os, const map<first, second> &v) { os << [ ; for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } void faltu() { cerr << n ; } template <typename T> void faltu(T a[], int n) { for (int i = 0; i < n; ++i) cerr << a[i] << ; cerr << n ; } template <typename T, typename... hello> void faltu(T arg, const hello &...rest) { cerr << arg << ; faltu(rest...); } inline int max(int a, int b) { return (a > b) ? a : b; } struct xorSpaces { int Rank, dim; array<int, 20> basis; xorSpaces() { Rank = 0, dim = 20; fill((basis).begin(), (basis).end(), 0); } void addBasis(int n) { for (int i = dim - 1; i >= 0; i--) { if (n & (1 << i)) { if (basis[i] == 0) { basis[i] = n; Rank++; break; } else { n ^= basis[i]; } } } } xorSpaces operator+=(xorSpaces other) { if (other.Rank == 0) return other; if (Rank == 0) { return *this = other; } for (int i = dim - 1; i >= 0; i--) { if (other.basis[i]) addBasis(other.basis[i]); } return *this; } int getMax() { int ans = 0; for (int i = dim - 1; i >= 0; i--) { if (basis[i] and (ans & (1 << i)) == 0) ans ^= basis[i]; } return ans; } }; const int mx = 5e5 + 123; xorSpaces table[(mx / 20) + 123][23], s[mx], p[mx]; int a[mx]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, l, r, q; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int d = (n) / 20; for (int i = 0; i < n; i++) { if (i % 20) p[i] = p[i - 1]; p[i].addBasis(a[i]); } for (int i = n - 1; i >= 0; i--) { if (i % 20 != 19) s[i] = s[i + 1]; s[i].addBasis(a[i]); } for (int i = 0; i <= d; i++) { table[i][0] = s[i * 20]; } for (int i = 1; i <= 15; i++) { for (int j = 0; j + (1 << (i - 1)) <= d; j++) { table[j][i] = table[j][i - 1]; table[j][i] += (table[j + (1 << (i - 1))][i - 1]); } } cin >> q; while (q--) { cin >> l >> r; l--, r--; int block_l = l / 20, block_r = r / 20; xorSpaces ans; if (block_l == block_r) { for (int i = l; i <= r; i++) { ans.addBasis(a[i]); } } else { ans += (s[l]); ans += (p[r]); block_l++, block_r--; if (block_l <= block_r) { r = block_r, l = block_l; int lg = log2(r - l + 1); ans += (table[l][lg]); ans += (table[r - (1 << lg) + 1][lg]); } } cout << ans.getMax() << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 123456789; template <class T> void scanint(T& x) { register int c = getchar(); x = 0; int m = 0; if (c == - ) { m = 1; } for (; (c < 48 || c > 57); c = getchar()) ; for (; c > 47 && c < 58; c = getchar()) { x = (x << 1) + (x << 3) + c - 48; } if (m == 1) { x *= -1; } } template <typename T> void cinall(T& t) { cin >> t; } template <typename T, typename... Args> void cinall(T& t, Args&... args) { cin >> t; cinall(args...); } int main() { ios_base::sync_with_stdio(false); int n; cinall(n); ; vector<int> v(n); vector<int> xv(n + 1); long long sol = 0; for (int i = 0; i < n; ++i) { cin >> v[i]; sol ^= v[i]; xv[i + 1] = xv[i] ^ i; } for (int i = 2; i <= n; ++i) { sol ^= xv[((n / i) % 2) * i] ^ xv[(n % i) + 1]; } cout << sol; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q, a[300005], ans[300005]; vector<pair<int, int> > queries[300005]; int tree[1200006]; void upd(int l, int r, int pos, int x) { if (l == r) { tree[pos]++; return; } int mid = l + r >> 1; if (x <= mid) upd(l, mid, pos << 1, x); else upd(mid + 1, r, pos << 1 | 1, x); tree[pos]++; } int query(int l, int r, int pos, int x) { if (l == r) return r; int mid = l + r >> 1; if (tree[pos << 1] >= x) return query(l, mid, pos << 1, x); else return query(mid + 1, r, pos << 1 | 1, x - tree[pos << 1]); } int query1(int l, int r, int pos, int ql, int qr) { if (l >= ql && r <= qr) return tree[pos]; if (l > qr || r < ql) return 0; int mid = l + r >> 1; return query1(l, mid, pos << 1, ql, qr) + query1(mid + 1, r, pos << 1 | 1, ql, qr); } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> q; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 0; i < q; i++) { int x, y; cin >> x >> y; queries[n - y].push_back({x, i}); } for (int i = 1; i <= n; i++) { if (a[i] > i) upd(0, n, 1, 0); else if (a[i] == i) upd(0, n, 1, i); else { int x = query(0, n, 1, a[i]); upd(0, n, 1, x); } for (auto p : queries[i]) { int x = query1(0, n, 1, 0, p.first); ans[p.second] = i - x; } } for (int i = 0; i < q; i++) cout << ans[i] << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tests; cin >> tests; for (int test = 0; test < (int)(tests); test++) { int n; cin >> n; map<int, int> m; for (int i = 0; i < (int)(n); i++) { int x; cin >> x; m[-x]++; } vector<int> v; for (auto i : m) { v.push_back(i.second); } int g, s, b; int j = 0; int k = 0; g = s = b = 0; vector<int> ans(3); g += v[0]; s -= v[0]; for (; j < n; j++) { s += v[j]; b -= v[j]; if (s > g) { break; } } for (; k < n; k++) { b += v[k]; if (b > g) { break; } } k++; while (g + s + b <= n / 2 && k < v.size()) { ans[0] = g; ans[1] = s; ans[2] = b; b += v[k]; k++; } cout << ans[0] << << ans[1] << << ans[2] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const long long inf64 = 1e18; const int N = 1e6 + 5; int n, m; vector<int> g[N], gr[N]; int ptr = 1; int del[N]; int mark[N]; void solve() { while (ptr <= n && del[ptr]) ptr++; if (ptr > n) return; int v = ptr++; for (int to : g[v]) del[to] = 1; solve(); int any = 0; for (int to : gr[v]) { if (mark[to]) { any = 1; break; } } if (!any) { mark[v] = 1; } } int main() { scanf( %d %d , &n, &m); for (int u, v, i = 0; i < m; i++) { scanf( %d %d , &u, &v); g[u].push_back(v); gr[v].push_back(u); } solve(); printf( %d n , count(mark + 1, mark + n + 1, 1)); for (int i = 1; i <= n; i++) { if (mark[i]) { printf( %d , i); } } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int pre[N][32], suf[N][32], mx[N][32]; int n, a[N]; long long ans; void init() { for (int i = 0; i < n; i++) mx[i][0] = i; for (int i = 1; (1 << i) < N; i++) { for (int j = 0; j < n; j++) { mx[j][i] = (a[mx[j][i - 1]] > a[mx[j + (1 << (i - 1))][i - 1]] ? mx[j][i - 1] : mx[j + (1 << (i - 1))][i - 1]); } } } int query(int l, int r) { int d = (int)(log((double)r - l + 1) / log(2.0)); return a[mx[l][d]] > a[mx[r - (1 << d) + 1][d]] ? mx[l][d] : mx[r - (1 << d) + 1][d]; } void dfs(int l, int r) { if (l > r) return; int x = query(l, r); int L = l, R = r; int fl = 0, fr = 0; for (int i = 0; i < 32; i++) { if (!((a[x] >> i) & 1) && pre[x][i] != -1 && pre[x][i] >= l) { fl = 1; L = max(L, pre[x][i]); } if (!((a[x] >> i) & 1) && suf[x][i] != -1 && suf[x][i] <= r) { fr = 1; R = min(R, suf[x][i]); } } L -= !fl; R += !fr; ans -= 1LL * (x - L) * (R - x); dfs(l, x - 1); dfs(x + 1, r); } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); for (int j = 0; j < 32; j++) { if (!((a[i] >> j) & 1)) { if (i) pre[i][j] = pre[i - 1][j]; else pre[i][j] = -1; } else pre[i][j] = i; } } for (int i = n - 1; i >= 0; i--) { for (int j = 0; j < 32; j++) { if (!((a[i] >> j) & 1)) { if (i < n - 1) suf[i][j] = suf[i + 1][j]; else suf[i][j] = -1; } else suf[i][j] = i; } } init(); ans = 1LL * n * (n + 1) / 2; dfs(0, n - 1); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, m, k, dp[2020][2020]; long long int getDp(long long int x, long long int y) { if (x == n) return y == k; if (~dp[x][y]) return dp[x][y]; long long int &ret = dp[x][y] = 0; ret = getDp(x + 1, y); ret = (ret + (getDp(x + 1, y + 1) * (m - 1)) % 998244353); ret %= 998244353; return ret; } int main() { ios::sync_with_stdio(false); cin >> n >> m >> k; memset(dp, -1, sizeof(dp)); cout << ((getDp(1, 0) * m) % 998244353) << endl; } |
#include <bits/stdc++.h> using namespace std; const int MX = 1 << 19; struct node { long long left, right, cnt, tot, length; }; struct segtree { node t[MX * 2]; node merge(node& l, node& r) { node ans; ans.left = l.left + r.left + l.length * r.cnt; ans.right = l.right + r.right + r.length * l.cnt; ans.cnt = l.cnt + r.cnt; ans.length = l.length + r.length; ans.tot = l.tot + r.tot + l.right * r.cnt + r.left * l.cnt; return ans; } void update(int wi, int su) { wi += MX; t[wi].cnt = su; while (wi > 1) { wi /= 2; t[wi] = merge(t[wi * 2], t[wi * 2 + 1]); } } long long read(int s, int e) { s += MX, e += MX; node l = {0}, r = {0}; while (s <= e) { if (s & 1) l = merge(l, t[s]), s = s / 2 + 1; else s /= 2; if (e & 1) e /= 2; else r = merge(t[e], r), e = e / 2 - 1; } return merge(l, r).tot; } } t; struct query { long long o, s, e; } Q[MX]; map<long long, long long> point; long long D[MX], tmp[MX]; int main() { int N, T; scanf( %d , &N); for (int i = 1; i <= N; i++) scanf( %lld , D + i), tmp[i] = D[i], point[D[i]] = 0; scanf( %d , &T); for (int i = 0; i < T; i++) scanf( %lld%lld%lld , &Q[i].o, &Q[i].s, &Q[i].e); for (int i = 0; i < T; i++) { if (Q[i].o == 2) continue; tmp[Q[i].s] += Q[i].e; point[tmp[Q[i].s]] = 0; } int wi = 0; for (auto it = point.begin(), it2 = point.begin(); it != point.end(); ++it, wi++) { it->second = wi * 2; ++it2; if (it2 != point.end()) t.t[MX + wi * 2 + 1].length = it2->first - it->first; } for (int i = MX - 1; i >= 1; i--) { t.t[i].length = t.t[i * 2].length + t.t[i * 2 + 1].length; } for (int i = 1; i <= N; i++) { t.update(point[D[i]], 1); } for (int i = 0; i < T; i++) { if (Q[i].o == 1) { t.update(point[D[Q[i].s]], 0); D[Q[i].s] += Q[i].e; t.update(point[D[Q[i].s]], 1); } else { auto l = point.lower_bound(Q[i].s), r = point.upper_bound(Q[i].e); if (r == l) printf( 0 n ); else --r, printf( %lld n , t.read(l->second, r->second)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 998244353; int n, p[N], c[N]; void add(int& x, int y) { x += y; if (x >= mod) { x -= mod; } } int mul(int x, int y) { return (long long)x * y % mod; } int qpow(int v, int p) { int result = 1; for (; p; p >>= 1, v = mul(v, v)) { if (p & 1) { result = mul(result, v); } } return result; } void modify(int p) { for (; p <= n; p += p & -p) { ++c[p]; } } int query(int p) { int result = 0; for (; p; p -= p & -p) { result += c[p]; } return result; } int query(int l, int r) { return query(r) - query(l - 1); } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &p[i]); } int answer = 0, t = 0, emp = 0; for (int i = 1; i <= n; ++i) { if (!~p[i]) { ++t; } } emp = t; add(answer, mul(mul(t, t - 1), qpow(4, mod - 2))); for (int i = 1; i <= n; ++i) { if (~p[i]) { add(answer, query(p[i], n)); modify(p[i]); } } t = 0; for (int i = 1; i <= n; ++i) { if (!~p[i]) { ++t; } else { int pos = mul(n - p[i] - query(p[i] + 1, n), qpow(emp, mod - 2)); add(answer, mul(pos, t)); } } t = 0; for (int i = n; i; --i) { if (!~p[i]) { ++t; } else { int pos = mul(p[i] - 1 - query(1, p[i] - 1), qpow(emp, mod - 2)); add(answer, mul(pos, t)); } } printf( %d n , answer); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100100; int n, q; long long int m; vector<long long int> mods; long long int w[N]; long long int phi(long long int x) { long long int ans = x; for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) { ans -= ans / i; while (x % i == 0) { x /= i; } } } if (x > 1) { ans -= ans / x; } return ans; } long long int magic(long long int x, long long int mod) { if (x < 50) { return x; } return 32 + (x - 32) % mod; } long long int fexp(long long int base, long long int e, long long int mod) { long long int ans = 1; while (e > 0) { if (e & 1) { ans = magic(ans * base, mod); } base = magic(base * base, mod); e >>= 1; } return ans; } long long int go(int l, int r, int on) { if (r == l) { return magic(w[l], mods[on]); } if (mods[on] == 1) { return magic(w[l], mods[on]); } long long int e = go(l + 1, r, on + 1); return fexp(w[l], e, mods[on]); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; mods.push_back(m); while (mods.back() != 1) { mods.push_back(phi(mods.back())); } for (int i = 0; i < n; i++) { cin >> w[i]; } cin >> q; while (q--) { int l, r; cin >> l >> r; l--; r--; cout << go(l, r, 0) % mods[0] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string s[1005]; long long int M[1005][1005], T[1005][1005]; queue<pair<long long int, long long int> > q; long long int xr[] = {0, 0, -1, 1}; long long int xc[] = {-1, 1, 0, 0}; int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); long long int p, t, n, m, i, j, k, x, y, z, a, b, c; cin >> n >> m >> t; for (i = 0; i < n; ++i) cin >> s[i]; for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) { a = 0; for (k = 0; k < 4; ++k) { x = i + xr[k]; y = j + xc[k]; if (x < 0 || x >= n || y < 0 || y >= m) continue; a += (s[x][y] == s[i][j]); } if (a) { q.push(make_pair(i, j)); M[i][j] = 1; } else T[i][j] = LLONG_MAX; } } while (!q.empty()) { auto it = q.front(); q.pop(); i = it.first; j = it.second; a = b = c = 0; for (k = 0; k < 4; ++k) { x = i + xr[k]; y = j + xc[k]; if (x < 0 || x >= n || y < 0 || y >= m || M[x][y]) continue; if (s[x][y] != s[i][j]) { q.push(make_pair(x, y)); M[x][y] = 1; T[x][y] = T[i][j] + 1; } } } while (t--) { cin >> i >> j >> p; i -= 1; j -= 1; if (T[i][j] > p) cout << s[i][j] << endl; else cout << (((p - T[i][j]) & 1) ^ (s[i][j] - 0 )) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, x, y, a, b, d[2010][2010], v[2010][2010]; bool solve(int x, int y, int k) { int l = max(1, x - k), r = min(x + k, n), t; for (int i = l; i < r + 1; i++) { t = k - abs(i - x); if (y - t > 0 && !v[i][y - t]) return a = i, b = y - t, 1; if (y + t <= m && !v[i][y + t]) return a = i, b = y + t, 1; } return 0; } int main() { cin >> n >> m >> k; for (int t = 0; t < k; t++) { cin >> x >> y; for (int i = -2; i < 3; i++) for (int j = -2; j < 3; j++) { if (x + i < 1 || x + i > n || y + j < 1 || y + j > m) continue; d[x][y] = max(d[x][y], d[x + i][y + j] - abs(i) - abs(j)); } while (!solve(x, y, d[x][y])) d[x][y]++; cout << a << << b << endl; v[a][b] = 1; } } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100100]; int a[100100], b[100100], s[100100]; int n, sa, sb; double ans; void dfs(int v, int p) { s[v] = 1; for (int i = 0; i < g[v].size(); i++) { int u = g[v][i]; if (u == p) continue; dfs(u, v); s[v] += s[u]; a[v] += a[u]; ans += 1.0 * b[v] * s[u] * a[u]; } ans += 1.0 * b[v] * (n - s[v]) * (sa - a[v]); } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } for (int i = 1; i <= n; i++) scanf( %d%d , a + i, b + i); for (int i = 1; i <= n; i++) { sa += a[i]; sb += b[i]; } dfs(1, 0); printf( %.12lf n , ans / sa / sb); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e9 + 7; const int P = 1e6 + 9; long long n, m; long long bin_pow(int a, int x) { if (x == 1) return a % N; if (x % 2 == 0) return (bin_pow(a, x / 2) * bin_pow(a, x / 2)) % N; if (x % 2 != 0) return (bin_pow(a, x - 1) * (a % N)) % N; } int main() { cin >> n >> m; cout << bin_pow(bin_pow(2, m) - 1, n); } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; const int MAX = 1e3 + 10; vector<int> g[MAX]; int qt[MAX]; int dfs(int i, int p = -1) { int ret = 1; for (int j : g[i]) if (j != p) ret += dfs(j, i); return qt[i] = ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n, x; cin >> n >> x; x--; for (int i = 0; i < n; i++) g[i].clear(); int deg = 0; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--, b--; if (a == x or b == x) deg++; g[a].push_back(b); g[b].push_back(a); } if (deg <= 1) { cout << Ayush << n ; continue; } dfs(x); vector<int> v; for (int i : g[x]) v.push_back(qt[i]); int par = 0; for (int i : v) par += (i % 2 == 0); if (par % 2 != deg % 2) cout << Ayush << n ; else cout << Ashish << n ; } exit(0); } |
#include <bits/stdc++.h> using namespace std; int a[100000]; int m[100001]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } m[n] = 1e9 + 1; for (int i = n - 1; i >= 0; i--) { m[i] = min(m[i + 1], a[i]); } for (int i = 0; i < n; i++) { cout << (lower_bound(m + i + 1, m + n, a[i]) - m - i - 2) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x, s = 0, t = 0, m, ans = 0, hp = 0; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; if (a[0] == 1) t++; else s++; for (int i = 1; i < n; i++) { if (a[i] != a[i - 1] && hp == 0) { hp = 1; } if (a[i] != a[i - 1] && hp == 1) { m = min(s, t); if (ans < m) ans = m; if (a[i] == 1) t = 0; else s = 0; } if (a[i] == 1) { t++; } else if (a[i] == 2) { s++; } } m = min(s, t); if (ans < m) ans = m; cout << ans * 2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[11][11] = {0}, n; cin >> n; for (int i = 0; i < n; i++) { a[0][i] = 1; a[i][0] = 1; } for (int i = 1; i < n; i++) { for (int j = 1; j < n; j++) { a[i][j] = a[i - 1][j] + a[i][j - 1]; } } cout << a[n - 1][n - 1] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline void boost() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const long long maxn = 2e6 + 123; const long long inf = 1e9 + 123; const long long linf = 1e18 + 123; const long long mod = 1e9 + 7; const double eps = 1e-9; const double pi = acos(-1); int dx[8] = {0, 1, -1, 0, 1, -1, 1, -1}; int dy[8] = {1, 0, 0, -1, 1, 1, -1, -1}; long long a[maxn], b[maxn]; vector<pair<long long, long long> > v[maxn]; int main() { boost(); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] += a[i - 1]; } for (int i = 1; i <= n; i++) { cin >> b[i]; b[i] += b[i - 1]; } bool WAS = 0; if (a[n] > b[n]) { swap(a, b); WAS = 1; } for (int i = 1; i <= n; i++) { int j = lower_bound(b + 1, b + 1 + n, a[i]) - b; if (a[i] != b[j]) { j--; } v[a[i] - b[j]].push_back({i, j}); } if (v[0].size() >= 1) { if (WAS == 0) { cout << v[0][0].first << n ; for (int i = 1; i <= v[0][0].first; i++) { cout << i << ; } cout << n ; cout << v[0][0].second << n ; for (int i = 1; i <= v[0][0].second; i++) { cout << i << ; } cout << n ; } else { cout << v[0][0].second << n ; for (int i = 1; i <= v[0][0].second; i++) { cout << i << ; } cout << n << v[0][0].first << n ; for (int i = 1; i <= v[0][0].first; i++) { cout << i << ; } cout << n ; } return 0; } for (int i = 1; i < n; i++) { if (v[i].size() >= 2) { if (WAS == 0) { cout << v[i][1].first - v[i][0].first << n ; for (int j = v[i][0].first + 1; j <= v[i][1].first; j++) { cout << j << ; } cout << n << v[i][1].second - v[i][0].second << n ; for (int j = v[i][0].second + 1; j <= v[i][1].second; j++) { cout << j << ; } return 0; } else { cout << v[i][1].second - v[i][0].second << n ; for (int j = v[i][0].second + 1; j <= v[i][1].second; j++) { cout << j << ; } cout << n << v[i][1].first - v[i][0].first << n ; for (int j = v[i][0].first + 1; j <= v[i][1].first; j++) { cout << j << ; } return 0; } } } exit(0); } |
#include <bits/stdc++.h> using namespace std; void mejor(int player, long long int k, int *arr, int n) { if (player == 0) { if (player + k >= n - 1) cout << n << endl; else { for (int i = 0; i < k; i++) { if (arr[player] < arr[player + 1 + i]) { mejor(player + 1 + i, k, arr, n); return; } } cout << arr[player] << endl; } } else { if (player + k > n - 1) cout << n << endl; else { for (int i = 0; i < k - 1; i++) { if (arr[player] < arr[player + 1 + i]) { mejor(player + 1 + i, k, arr, n); return; } } cout << arr[player] << endl; } } return; } int main() { int n; long long int k; cin >> n >> k; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; if (k >= n - 1) cout << n << endl; else mejor(0, k, arr, n); return 0; } |
#include <bits/stdc++.h> int main() { int len, i, l = 0, r = 0, u = 0, d = 0, dif1, dif2; scanf( %d , &len); char str[101]; scanf( %s , str); for (i = 0; i < len; i++) { if (str[i] == L ) l++; else if (str[i] == R ) r++; else if (str[i] == U ) u++; else if (str[i] == D ) d++; } dif1 = l - r; if (dif1 < 0) dif1 = -dif1; dif2 = u - d; if (dif2 < 0) dif2 = -dif2; printf( %d n , (len - (dif1 + dif2))); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)1e6 + 7; const int M = (int)-1; int a[N], cnt[100]; int main() { int T; cin >> T; while (T--) { long long n; int m; cin >> n >> m; for (int i = (0); i < (m); ++i) cin >> a[i]; long long sum = 0; for (int i = (0); i < (m); ++i) sum += a[i]; if (sum < n) { cout << -1 << endl; continue; } sort(a, a + m); memset(cnt, 0, sizeof(cnt)); for (int i = 0, j = 0; i < m; i++) { while (a[i] > (1ll << j)) j++; cnt[j]++; } long long res = 0; int ans = 0; for (int i = (0); i < (63); ++i) { if (n >> i & 1) { if (!cnt[i] && res < (1ll << i)) { int j = i + 1; cnt[i] = 2; while (!cnt[j]) { cnt[j]++; j++; ans++; } cnt[j]--; ans++; } if (cnt[i]) cnt[i]--; else res -= 1ll << i; } res += (1ll << i) * cnt[i]; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> const int mod = 1000000007; const int seed = 131; char s[100005], t[1000005]; int hshv[1000005]; int powm(int a, int b) { int ret = 1; while (b) { if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1; } return ret; } void gethash(char* s) { int len = strlen(s), now; now = 0; for (int i = 0; i < len; i++) { now = (1LL * now * seed + s[i]) % mod; hshv[i] = now; } } int get(int s, int t) { int a, b; if (s == 0) a = 0; else a = 1LL * hshv[s - 1] * powm(seed, t - s + 1) % mod; b = hshv[t]; return (b - a + mod) % mod; } int main() { int cnt0, cnt1, lens, lent, len0, len1, hsh0, hsh1, p, ans; bool f; scanf( %s , s); scanf( %s , t); lens = strlen(s); lent = strlen(t); if (s[0] == 1 ) for (int i = 0; i < lens; i++) s[i] = ((s[i] - 0 ) ^ 1) + 0 ; cnt0 = 0; cnt1 = 0; for (int i = 0; i < lens; i++) if (s[i] == 0 ) cnt0++; else cnt1++; ans = 0; gethash(t); for (int i = 1; cnt0 * i < lent; i++) { if ((lent - cnt0 * i) % cnt1 != 0) continue; len0 = i; len1 = (lent - cnt0 * len0) / cnt1; hsh0 = -1; hsh1 = -1; p = 0; f = true; for (int j = 0; j < lens; j++) { if (s[j] == 0 ) { if (hsh0 == -1) hsh0 = get(p, p + len0 - 1); else if (get(p, p + len0 - 1) != hsh0) { f = false; break; } p += len0; } else { if (hsh1 == -1) hsh1 = get(p, p + len1 - 1); else if (get(p, p + len1 - 1) != hsh1) { f = false; break; } p += len1; } } if (f && hsh0 != hsh1) ans++; } printf( %d n , ans); } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <typename T> void ckmn(T& a, T b) { a = min(a, b); } template <typename T> void ckmx(T& a, T b) { a = max(a, b); } void rd(int& x) { scanf( %i , &x); } void rd(long long& x) { scanf( %lld , &x); } void rd(char* x) { scanf( %s , x); } void rd(double& x) { scanf( %lf , &x); } void rd(string& x) { scanf( %s , &x); } template <typename T1, typename T2> void rd(pair<T1, T2>& x) { rd(x.first); rd(x.second); } template <typename T> void rd(vector<T>& x) { for (T& i : x) rd(i); } template <typename T, typename... A> void rd(T& x, A&... args) { rd(x); rd(args...); } template <typename T> void rd() { T x; rd(x); return x; } int ri() { int x; rd(x); return x; } template <typename T> vector<T> rv(int n) { vector<T> x(n); rd(x); return x; } template <typename T> void ra(T a[], int n, int st = 1) { for (int i = 0; i < n; ++i) rd(a[st + i]); } template <typename T1, typename T2> void ra(T1 a[], T2 b[], int n, int st = 1) { for (int i = 0; i < n; ++i) rd(a[st + i]), rd(b[st + i]); } template <typename T1, typename T2, typename T3> void ra(T1 a[], T2 b[], T3 c[], int n, int st = 1) { for (int i = 0; i < n; ++i) rd(a[st + i]), rd(b[st + i]), rd(c[st + i]); } void re(vector<int> E[], int m, bool dir = 0) { for (int i = 0, u, v; i < m; ++i) { rd(u, v); E[u].push_back(v); if (!dir) E[v].push_back(u); } } template <typename T> void re(vector<pair<int, T>> E[], int m, bool dir = 0) { for (int i = 0, u, v; i < m; ++i) { T w; rd(u, v, w); E[u].push_back({v, w}); if (!dir) E[v].push_back({u, w}); } } int main() { for (int t = ri(); t--;) { int n = ri(); vector<int> a(n + 1, 0); vector<vector<int>> ids(n + 1, vector<int>()); for (int i = 1; i <= n; i++) { rd(a[i]); ids[a[i]].push_back(i); } vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0)); vector<vector<bool>> was(n + 1, vector<bool>(n + 1, false)); function<int(int, int)> Solve = [&](int l, int r) { if (l > r) return 0; if (was[l][r]) return dp[l][r]; was[l][r] = 1; if (l == r) return dp[l][r] = 1; dp[l][r] = Solve(l + 1, r) + 1; for (int i : ids[a[l]]) if (i > l && i <= r) { ckmn(dp[l][r], Solve(l + 1, i - 1) + Solve(i, r)); } return dp[l][r]; }; printf( %i n , Solve(1, n) - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q; int p[100001]; int sz[100001]; int bc[100001]; int top[100001]; int newi[100001]; int sr[100001]; vector<int> c[100001]; pair<int, int> zero = {0, -1e9}; pair<int, int> f(pair<int, int> x, pair<int, int> y) { return {x.first + y.first, max(y.second, x.second + y.first)}; } pair<int, int> info[262144]; bool tag[262144]; int lazy[262144]; void put(int id, int l, int r, int v) { tag[id] = true; lazy[id] = v; info[id] = {v * (r - l + 1), max(v * (r - l + 1), v)}; } void push(int id, int l, int r) { if (!tag[id]) return; int mid = (l + r) / 2; put(id * 2, l, mid, lazy[id]); put(id * 2 + 1, mid + 1, r, lazy[id]); tag[id] = false; } void upd1(int id, int l, int r, int ql, int qr, int v) { if (ql > r || qr < l) return; if (ql <= l && r <= qr) { put(id, l, r, v); return; } push(id, l, r); int mid = (l + r) / 2; upd1(id * 2, l, mid, ql, qr, v); upd1(id * 2 + 1, mid + 1, r, ql, qr, v); info[id] = f(info[id * 2], info[id * 2 + 1]); } void upd2(int id, int l, int r, int pos, int v) { if (l == r) { info[id] = {info[id].first + v, info[id].second + v}; return; } push(id, l, r); int mid = (l + r) / 2; if (pos <= mid) upd2(id * 2, l, mid, pos, v); else upd2(id * 2 + 1, mid + 1, r, pos, v); info[id] = f(info[id * 2], info[id * 2 + 1]); } pair<int, int> qry(int id, int l, int r, int ql, int qr) { if (ql > r || qr < l) return zero; if (ql <= l && r <= qr) return info[id]; push(id, l, r); int mid = (l + r) / 2; return f(qry(id * 2, l, mid, ql, qr), qry(id * 2 + 1, mid + 1, r, ql, qr)); } int g(int id) { pair<int, int> res = zero; while (id != 0) { res = f(qry(1, 1, n, newi[top[id]], newi[id]), res); id = p[top[id]]; } return res.second; } void dfs(int id) { sz[id] = 1; for (auto cur : c[id]) { dfs(cur); sz[id] += sz[cur]; if (sz[bc[id]] < sz[cur]) bc[id] = cur; } } int ptr = 0; void dfs2(int id) { newi[id] = ++ptr; sr[id] = ptr; if (c[id].empty()) return; top[bc[id]] = top[id]; dfs2(bc[id]); sr[id] = sr[bc[id]]; for (auto cur : c[id]) { if (cur != bc[id]) { top[cur] = cur; dfs2(cur); sr[id] = sr[cur]; } } } int main() { ios::sync_with_stdio(false); cin >> n >> q; for (int i = 2; i <= n; i++) { cin >> p[i]; c[p[i]].push_back(i); } dfs(1); top[1] = 1; dfs2(1); upd1(1, 1, n, 1, n, -1); for (int i = 1; i <= q; i++) { int t, u; cin >> t >> u; if (t == 1) upd2(1, 1, n, newi[u], 1); else if (t == 2) { upd1(1, 1, n, newi[u], sr[u], -1); int num = g(u); if (num >= 0) upd2(1, 1, n, newi[u], -num - 1); } else { int num = g(u); if (num >= 0) cout << black n ; else cout << white n ; } } } |
#include <bits/stdc++.h> using namespace std; int ch[300010][26]; int ans[300010], maxdep = 0; int N; int merge(vector<int> now) { int res = now.size() - 1; vector<int> next; for (int i = 0; i < 26; i++) { next.clear(); for (int j = 0; j < now.size(); j++) if (ch[now[j]][i]) next.push_back(ch[now[j]][i]); if (next.size() <= 1) continue; res += merge(next); } return res; } void dfs(int x, int dep) { vector<int> now; now.clear(); maxdep = max(maxdep, dep); for (int i = 0; i < 26; i++) { if (!ch[x][i]) continue; now.push_back(ch[x][i]); } int res = merge(now) + 1; ans[dep] += res; for (int i = 0; i < 26; i++) { if (ch[x][i]) dfs(ch[x][i], dep + 1); } } int main() { scanf( %d , &N); for (int i = 1; i < N; i++) { int u, v; char s[5]; scanf( %d%d , &u, &v); scanf( %s , s); ch[u][s[0] - a ] = v; } memset(ans, 0, sizeof(ans)); dfs(1, 1); int maxres = 0, mp; for (int i = 1; i <= maxdep; i++) if (maxres < ans[i]) { maxres = ans[i]; mp = i; } printf( %d n%d n , N - maxres, mp); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; int par[maxn], sub[maxn], col[maxn]; vector<pair<int, int>> parHis, colHis, subHis; bool bad[maxn]; int c[maxn]; int root(int x) { while (x != par[x]) { x = par[x]; } return x; } int getCol(int x) { int res = 0; while (x != par[x]) { res ^= col[x]; x = par[x]; } return res; } void save(int x, int y) { parHis.emplace_back(x, par[x]); subHis.emplace_back(y, sub[y]); colHis.emplace_back(x, col[x]); } void join(int x, int y, bool rollback = false) { int rx = root(x); int ry = root(y); int dif = (getCol(x) == getCol(y)); if (sub[rx] > sub[ry]) swap(rx, ry); if (rollback) save(rx, ry); par[rx] = ry; sub[ry] += sub[rx]; col[rx] = dif; } bool check(int p, int q) { if (root(p) == root(q) && getCol(p) == getCol(q)) return false; return true; } int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) { scanf( %d , &c[i]); } map<pair<int, int>, vector<pair<int, int>>> cont; for (int i = 1; i <= m; i++) { int p, q; scanf( %d %d , &p, &q); if (c[p] > c[q]) swap(p, q); cont[make_pair(c[p], c[q])].emplace_back(p, q); } for (int i = 1; i <= n; i++) { par[i] = i; col[i] = 0; sub[i] = 1; } int active = k; for (int i = 1; i <= k; i++) { auto v = cont[make_pair(i, i)]; for (auto j : v) { int p = j.first; int q = j.second; if (check(p, q)) { join(p, q); } else { bad[i] = true; active -= 1; break; } } } long long ans = (1LL * active * (active - 1)) / 2; for (auto i : cont) { if (i.first.first == i.first.second) continue; if (bad[i.first.first] || bad[i.first.second]) continue; auto v = i.second; for (auto j : v) { int p = j.first; int q = j.second; if (check(p, q)) { join(p, q, true); } else { ans -= 1; break; } } while (not parHis.empty()) { auto ph = parHis.back(); auto ch = colHis.back(); auto sh = subHis.back(); parHis.pop_back(); colHis.pop_back(); subHis.pop_back(); par[ph.first] = ph.second; col[ch.first] = ch.second; sub[sh.first] = sh.second; } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using Int = long long; constexpr static int mod = 1e9 + 7; constexpr static int inf = (1 << 30) - 1; constexpr static Int infll = (1LL << 61) - 1; int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0); #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) int main() { Int N, D, M; cin >> N >> D >> M; vector<Int> a(N); vector<Int> low, high; for (int i = 0; i < N; i++) { cin >> a[i]; if (a[i] > M) high.push_back(a[i]); else low.push_back(a[i]); } sort(low.rbegin(), low.rend()); sort(high.rbegin(), high.rend()); vector<Int> lowsum(low.size() + 1), highsum(high.size() + 1); for (int i = 0; i < low.size(); i++) lowsum[i + 1] = lowsum[i] + low[i]; for (int i = 0; i < high.size(); i++) highsum[i + 1] = highsum[i] + high[i]; Int ans = 0, hsz = highsum.size(), lsz = lowsum.size(); for (int i = 0; i < lsz; i++) ans = max(ans, highsum[min(hsz - 1, (N - i + D) / (D + 1))] + lowsum[i]); cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 500001; const int sqN = 708; int ans[N]; int fre[N]; int v[N]; int block[sqN]; int answer = 0; struct query { int l; int r; int idx; } Q[N]; bool comp(query &q1, query &q2) { if (q1.l / sqN != q2.l / sqN) { return q1.l < q2.l; } if ((q1.l / sqN) & 1) { return q1.r < q2.r; } return q1.r > q2.r; } inline void add(int idx) { int val = v[idx]; fre[val]++; if (fre[val] == 1) { answer++; block[val / sqN]++; } if (fre[val] == 2) { answer--; block[val / sqN]--; } } inline void rem(int idx) { int val = v[idx]; fre[val]--; if (fre[val] == 1) { answer++; block[val / sqN]++; } if (fre[val] == 0) { answer--; block[val / sqN]--; } } inline int solve() { if (answer == 0) { return 0; } for (int i = 0; i < sqN; i++) { if (block[i] > 0) { for (int j = i * sqN; j < i * sqN + sqN; j++) { if (fre[j] == 1) { return j; } } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> v[i]; } int q, l, r; cin >> q; for (int i = 0; i < q; i++) { cin >> l >> r; l--; r--; Q[i].l = l; Q[i].r = r; Q[i].idx = i; } sort(Q, Q + q, comp); l = 0, r = -1; for (int i = 0; i < q; i++) { int L = Q[i].l; int R = Q[i].r; while (l < L) { rem(l); l++; } while (l > L) { l--; add(l); } while (r < R) { r++; add(r); } while (r > R) { rem(r); r--; } ans[Q[i].idx] = solve(); } for (int i = 0; i < q; i++) { cout << ans[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 5000; long long cumulative[N + 10], arr[N + 10][3]; signed main() { ios ::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, q; cin >> n >> q; vector<pair<long long, long long> > pi; for (long long i = 0; i < q; i++) { long long a, b; cin >> a >> b; cumulative[a] += 1; cumulative[b + 1] -= 1; pi.push_back({a, b}); } for (long long i = 1; i <= n; i++) { cumulative[i] += cumulative[i - 1]; } for (long long i = 1; i <= n; i++) { for (long long j = 0; j < 3; j++) { if (cumulative[i] == j) { arr[i][j] += (arr[i - 1][j] + 1); } else { arr[i][j] += arr[i - 1][j]; } } } long long sz = pi.size(); sort(pi.begin(), pi.end()); long long ans = 0; for (long long i = 0; i < sz - 1; i++) { long long x = pi[i].first; long long y = pi[i].second; for (long long j = i + 1; j < sz; j++) { long long two = 0; long long a = pi[j].first; long long b = pi[j].second; if (a <= y) { long long ax = max(x, a); long long by = min(y, b); two = (arr[by][2] - arr[ax - 1][2]); } long long zero = (arr[n][0] - arr[0][0]); long long one = (arr[y][1] - arr[x - 1][1]) + (arr[b][1] - arr[a - 1][1]); long long total = one + two + zero; long long res = n - total; ans = max(ans, res); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int test = 1; for (int loop = 0; loop < test; loop++) { long long int num, val; cin >> num >> val; vector<long long int> arr; long long int temp; for (int i = 0; i < num; i++) { cin >> temp; arr.push_back(temp); } long long int count = 0; for (int i = 0; i < num; i++) { for (int j = 0; j < num; j++) { if (abs(arr[i] - arr[j]) <= val && i != j) count++; } } cout << count << n ; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; const int dx[4] = {0, 0, -1, 1}; const int dy[4] = {-1, 1, 0, 0}; const int N = 101; int n, m, a[N][N], psum[N][N], T; bool Check_1() { if (psum[1][m] == 0) return true; if (psum[n][1] == 0) return true; if (psum[n][m] - psum[n - 1][m] == 0) return true; if (psum[n][m] - psum[n][m - 1] == 0) return true; return false; } bool Check_2() { if (a[1][1] == 0 || a[1][m] == 0 || a[n][1] == 0 || a[n][m] == 0) return true; for (int i = 2; i < n; i++) { if (psum[i][m] - psum[i - 1][m] == 0) return true; } for (int i = 2; i < m; i++) { if (psum[n][i] - psum[n][i - 1] == 0) return true; } return false; } bool Check_3() { for (int i = 2; i < n; i++) { if (a[i][1] == 0 || a[i][m] == 0) return true; } for (int i = 2; i < m; i++) { if (a[1][i] == 0 || a[n][i] == 0) return true; } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> T; while (T--) { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { char c; cin >> c; int x = 0; if (c == P ) x = 1; psum[i][j] = psum[i - 1][j] + psum[i][j - 1] - psum[i - 1][j - 1] + x; a[i][j] = x; } } if (psum[n][m] == n * m) { cout << MORTAL n ; continue; } if (psum[n][m] == 0) { cout << 0 << n ; continue; } if (Check_1()) cout << 1 << n ; else if (Check_2()) cout << 2 << n ; else if (Check_3()) cout << 3 << n ; else cout << 4 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct P { long long x, y; }; P rotate90(P a) { P b; b.x = -a.y, b.y = a.x; return b; } P ar[4], br[4], cr[4]; P add(P a, P b) { P c; c.x = a.x + b.x; c.y = a.y + b.y; return c; } long long dis(P a, P b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } int check(P eop[]) { long long l[16], tp = 0; for (int i = 0; i < 4; i++) for (int j = i + 1; j < 4; j++) l[tp++] = dis(eop[i], eop[j]); sort(l, l + tp); if (l[0] == l[1] && l[1] == l[2] && l[2] == l[3] && l[0] == l[3] && l[0] && l[4] == l[5] && l[0] * 2 == l[4]) return 1; else return 0; } int main() { int n; scanf( %d , &n); while (n--) { for (int i = 0; i < 4; i++) { scanf( %I64d%I64d%I64d%I64d , &ar[i].x, &ar[i].y, &br[i].x, &br[i].y); cr[i].x = ar[i].x - br[i].x; cr[i].y = ar[i].y - br[i].y; } int ans = 999; for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { for (int k = 0; k < 4; k++) { for (int l = 0; l < 4; l++) { P eop[4]; for (int z = 0; z < 4; z++) eop[z] = cr[z]; for (int z = 0; z < i; z++) eop[0] = rotate90(eop[0]); for (int z = 0; z < j; z++) eop[1] = rotate90(eop[1]); for (int z = 0; z < k; z++) eop[2] = rotate90(eop[2]); for (int z = 0; z < l; z++) eop[3] = rotate90(eop[3]); for (int z = 0; z < 4; z++) eop[z] = add(eop[z], br[z]); if (check(eop)) ans = min(ans, i + j + k + l); } } } } printf( %d n , ans == 999 ? -1 : ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long hit(long long n) { return ((1 + n) * n) / 2; } int main() { long long m, n; scanf( %lld%lld , &n, &m); long long hasilmin, hasilmax; hasilmin = hit(n / m) * (n % m) + hit(n / m - 1) * (m - n % m); hasilmax = hit(n - m); printf( %lld %lld n , hasilmin, hasilmax); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, m, sx, sy, vx, vy; inline long long int extgcd(long long int a, long long int b, long long int &x, long long int &y) { if (!b) { x = 1; y = 0; return a; } long long int d = extgcd(b, a % b, x, y); long long int _x = y; long long int _y = x - (a / b) * y; x = _x; y = _y; return d; } inline long long int crt(long long int a1, long long int m1, long long int a2, long long int m2) { a1 = (a1 + m1) % m1; a2 = (a2 + m2) % m2; if (a1 > a2) { swap(a1, a2); swap(m1, m2); } long long int x, y; long long int d = extgcd(m1, m2, x, y); if ((a2 - a1) % d) return -1; x *= (a2 - a1) / d; y *= -(a2 - a1) / d; x = (x - (x / (m2 / d)) * m2 / d + m2 / d) % (m2 / d); return m1 * x + a1; } signed main() { cin >> n >> m >> sx >> sy >> vx >> vy; if ((sx == 0 && sy == 0) || (sx == 0 && sy == m) || (sx == n && sy == 0) || (sx == n && sy == m)) { cout << sx << << sy << endl; return 0; } if (!vx) { if (sx == 0) { if (vy == 1) { cout << 0 << m << endl; } else { cout << 0 0 n << endl; } } else if (sx == n) { if (vy == 1) { cout << n << << m << endl; } else { cout << n << << 0 << endl; } } else { cout << -1 << endl; } return 0; } if (!vy) { if (sy == 0) { if (vx == 1) { cout << n << 0 << endl; } else { cout << 0 0 n << endl; } } else if (sy == m) { if (vx == 1) { cout << n << << m << endl; } else { cout << 0 << m << endl; } } else { cout << -1 << endl; } return 0; } long long int T = crt(n - vx * sx, n, m - vy * sy, m); if (T == -1) { cout << -1 << endl; return 0; } long long int X = sx + T * vx; long long int Y = sy + T * vy; X = (X < 0 ? -X : X); Y = (Y < 0 ? -Y : Y); cout << ((X / n) & 1) * n << << ((Y / m) & 1) * m << endl; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:500000000 ) using namespace std; bool isq[22 * 22 * 22 * 22]; bool isSquare(int n) { return isq[n]; } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= 22 * 22; i++) isq[i * i] = true; for (int columnLine = 0; columnLine <= m; columnLine++) { for (int rowLine = 0; rowLine <= n; rowLine++) { for (int aValue = 1; aValue <= 22; aValue++) for (int bValue = 1; bValue <= 22; bValue++) for (int cValue = 1; cValue <= 22; cValue++) for (int dValue = 1; dValue <= 22; dValue++) { int sqA = aValue * aValue; int sqB = bValue * bValue; int sqC = cValue * cValue; int sqD = dValue * dValue; if (isSquare(columnLine * sqA + (m - columnLine) * sqB) && isSquare(columnLine * sqC + (m - columnLine) * sqD) && isSquare(rowLine * sqA + (n - rowLine) * sqC) && isSquare(rowLine * sqB + (n - rowLine) * sqD)) { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (i < rowLine && j < columnLine) printf( %d , aValue); else if (i < rowLine && j >= columnLine) printf( %d , bValue); else if (i >= rowLine && j < columnLine) printf( %d , cValue); else printf( %d , dValue); } puts( ); } return 0; } } } } } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 5, M = 2e6 + 5, Mod = 1e9 + 7; int add(int a, int b) { return ((a += b) >= Mod) ? (a - Mod) : (a); } int gcd(int a, int b) { return (!b) ? (a) : (gcd(b, a % b)); } bool _pool[M << 1]; bool *_top = _pool; bool *alloc(int sz) { bool *top = _top; _top += sz; return top; } int n, a, b; char s[M]; int sz[N]; bool *own[N]; bool G[N][N]; stack<int> S; vector<int> SCC; bool ins[N], vis[M]; int dfs_clock, cnt_scc; int dfn[N], low[N], bel[N]; int sz_sc[N]; bool *own_sc[N]; void dispose() { int D = 0; for (auto p : SCC) { D = gcd(D, sz[p]); } sz_sc[cnt_scc] = D; own_sc[cnt_scc] = alloc(D); bool *app = own_sc[cnt_scc]; for (auto &p : SCC) { for (int i = 0; i < sz[p]; i++) { if (own[p][i]) { app[i % D] = true; } } } } void tarjan(int p) { dfn[p] = low[p] = ++dfs_clock; vis[p] = ins[p] = true; S.push(p); for (int e = 1; e <= n; e++) { if (G[p][e]) { if (!vis[e]) { tarjan(e); low[p] = min(low[p], low[e]); } else if (ins[e]) { low[p] = min(low[p], dfn[e]); } } } if (dfn[p] == low[p]) { int cur; SCC.clear(); ++cnt_scc; do { cur = S.top(); S.pop(); SCC.push_back(cur); bel[cur] = cnt_scc; ins[cur] = false; } while (cur != p); dispose(); } } int deg[N]; int order[N]; bool nG[N][N]; void rebuild() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (bel[i] != bel[j] && G[i][j]) { nG[bel[i]][bel[j]] = true; } } } for (int i = 1; i <= cnt_scc; i++) { for (int j = i + 1; j <= cnt_scc; j++) { if (nG[i][j]) { deg[j]++; } else { deg[i]++; } } } for (int i = 1; i <= cnt_scc; i++) { order[deg[i]] = i; } } pair<int, int> A[N]; int comb[N][N]; int main() { scanf( %d%d%d , &n, &a, &b); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= n; j++) { G[i][j] = s[j] - 0 ; } } for (int i = 1; i <= n; i++) { scanf( %d , sz + i); own[i] = alloc(sz[i]); scanf( %s , s); for (int j = 0; j < sz[i]; j++) { own[i][j] = s[j] - 0 ; } } for (int i = 1; i <= n; i++) { if (!vis[i]) { tarjan(i); } } rebuild(); for (int i = 1; i < cnt_scc; i++) { int x = order[i - 1], y = order[i]; int d = gcd(sz_sc[x], sz_sc[y]); memset(vis, false, d); for (int j = 0; j < sz_sc[x]; j++) { if (own_sc[x][j]) { vis[j % d] = true; } } for (int j = 0; j < sz_sc[y]; j++) { own_sc[y][j] = own_sc[y][j] || vis[j % d]; } } for (int i = 1; i <= n; i++) { bool *app = own_sc[bel[i]]; int D = sz_sc[bel[i]]; for (int j = 0; j < sz[i]; j++) { if (own[i][j]) { A[i].second++; } else if (app[j % D]) { A[i].first++; } } A[i].first += A[i].second; } sort(A + 1, A + n + 1); reverse(A + 1, A + n + 1); comb[0][0] = 1; for (int i = 1; i <= n; i++) { comb[i][0] = comb[i][i] = 1; for (int j = 1; j < i; j++) { comb[i][j] = add(comb[i - 1][j - 1], comb[i - 1][j]); } } int c = a - b, ans = 0; for (int i = b; i <= n; i++) { int x = 0, y; for (int j = 1; j < i; j++) { if (A[j].second > A[i].first) { x++; } } y = max(x - c, 0); for (int j = y; j < b; j++) { ans = (ans + comb[x][j] * 1ll * comb[i - x - 1][b - j - 1]) % Mod; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int n; string s; cin >> n >> s; map<long long int, vector<long long int>> mp; for (long long int i = 0; i < s.size(); i++) { mp[s[i] - 0 ].push_back(i); } vector<long long int> ans(n + 1, 0); long long int las = -1; for (auto x : mp) { vector<long long int> v = x.second; long long int cnt = 0; for (long long int i = 0; i < v.size(); i++) { if (v[i] > las) { ans[v[i]] = 1; cnt++; las = v[i]; } } if (cnt != v.size()) { break; } } vector<long long int> ck; for (long long int i = 0; i < n; i++) { if (ans[i] == 1) { ck.push_back(s[i] - 0 ); } } for (long long int i = 0; i < n; i++) { if (ans[i] != 1) { ck.push_back(s[i] - 0 ); } } long long int f = 0; for (long long int i = 1; i < n; i++) { if (ck[i] < ck[i - 1]) { f = 1; break; } } if (f == 1) { cout << - << endl; } else { string str; for (long long int i = 0; i < n; i++) { if (ans[i] == 0) { str += 2 ; } else { str += 1 ; } } cout << str << endl; } } return 0; } |
#include <bits/stdc++.h> int min(int a, int b) { return a < b ? a : b; } int n, m, t1, t2, val[1024]; long long ans; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &val[i]); } for (int i = 1; i <= m; i++) { scanf( %d%d , &t1, &t2); ans += min(val[t1], val[t2]); } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a; cin >> a; for (int i = a; i >= 1; i--) { if (a % i == 0) { cout << i << ; a = i; } } } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<long long> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } long long c = 0; for (int i = 0; i < n; i++) { c += arr[i] - 1; if (c % 2 == 0) cout << 2 << n ; else cout << 1 << n ; } } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); long long T; T = 1; for (int t = 0; t < T; t++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; char cross[101][101]; int main() { int n; while (cin >> n) { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> cross[i][j]; int ok = 0; for (int i = 1; i < n - 1; i++) { for (int j = 1; j < n - 1; j++) { if (cross[i][j] == # ) { if (cross[i][j] == # && cross[i - 1][j] == # && cross[i][j - 1] == # && cross[i][j + 1] == # && cross[i + 1][j] == # ) { cross[i][j] = a ; cross[i - 1][j] = a ; cross[i][j - 1] = a ; cross[i][j + 1] = a ; cross[i + 1][j] = a ; } } } } for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (cross[i][j] == # ) { ok = 1; break; break; } if (ok == 0) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> namespace std { template <typename...> using void_t = void; } template <typename T, typename _ = void> struct is_container : std::false_type {}; template <typename... Ts> struct is_container_helper {}; template <typename T> struct is_container< T, typename std::conditional< false, is_container_helper<decltype(std::declval<T>().size()), decltype(std::declval<T>().begin()), decltype(std::declval<T>().end()), decltype(std::declval<T>().cbegin()), decltype(std::declval<T>().cend())>, void>::type> : public std::true_type {}; class IO { static const int bufSize = 1 << 20; char inBuf[bufSize], outBuf[bufSize]; char *ip1 = inBuf, *ip2 = inBuf; int goodReadBit = 1, op1 = -1, op2 = bufSize - 1; __inline__ __attribute__((always_inline)) int gc() { return ip1 == ip2 && (ip2 = (ip1 = inBuf) + fread(inBuf, 1, bufSize, stdin), ip1 == ip2) ? (goodReadBit = 0, EOF) : *ip1++; } template <typename T> __inline__ __attribute__((always_inline)) void __RI(T &x) { int ch = gc(), neg = 1; x = 0; for (; !(isdigit(ch) || ch == - || ch == EOF); ch = gc()) { } if (ch == EOF) return; if (ch == - ) neg = -1, ch = gc(); for (; isdigit(ch); ch = gc()) x = x * 10 + (ch - 48) * neg; } template <typename T> __inline__ __attribute__((always_inline)) void __RC(T &x) { int ch; while (isspace(ch = gc())) { } if (ch == EOF) return; x = ch; } __inline__ __attribute__((always_inline)) void __RS(std::string &x) { char ch; x.clear(); for (ch = gc(); isspace(ch); ch = gc()) { } if (ch == EOF) return; for (; !isspace(ch) && ch != EOF; ch = gc()) x.push_back(ch); } public: __inline__ __attribute__((always_inline)) IO &R(char &x) { return __RC(x), (*this); } __inline__ __attribute__((always_inline)) IO &R(unsigned char &x) { return __RC(x), (*this); } __inline__ __attribute__((always_inline)) IO &R(std::string &x) { return __RS(x), (*this); } template <typename T1, typename T2> __inline__ __attribute__((always_inline)) IO &R(std::pair<T1, T2> &x) { return R(x.first), R(x.second), (*this); } template <typename T, typename... Args> __inline__ __attribute__((always_inline)) IO &RA(T *a, int n) { for (int i = 0; i < n; ++i) R(a[i]); return (*this); } template <typename T, typename... Args> __inline__ __attribute__((always_inline)) IO &R(T &x, Args &...args) { return R(x), R(args...), (*this); } template <typename T, typename... Args> __inline__ __attribute__((always_inline)) IO &RA(T *a, int n, Args... args) { for (int i = 0; i < n; ++i) RA(a[i], args...); return (*this); } template <typename T> __inline__ __attribute__((always_inline)) typename std::enable_if<std::is_integral<T>::value, IO>::type & R(T &x) { return __RI(x), (*this); } template <typename T> __inline__ __attribute__((always_inline)) typename std::enable_if<is_container<T>::value, IO>::type & R(T &x) { for (auto &i : x) R(i); return (*this); } template <typename T> __inline__ __attribute__((always_inline)) typename std::enable_if< std::is_void<std::void_t<decltype(std::declval<T>().read())>>::value, IO>::type & R(T &x) { return x.read(), (*this); } private: char space = ; __inline__ __attribute__((always_inline)) void pc(const char &x) { if (op1 == op2) flush(); outBuf[++op1] = x; } template <typename T> __inline__ __attribute__((always_inline)) void __WI(T x) { static char buf[sizeof(T) * 16 / 5]; static int len = -1; if (x >= 0) { do { buf[++len] = x % 10 + 48, x /= 10; } while (x); } else { pc( - ); do { buf[++len] = -(x % 10) + 48, x /= 10; } while (x); } while (len >= 0) { pc(buf[len]), --len; } } public: __inline__ __attribute__((always_inline)) void flush() { fwrite(outBuf, 1, op1 + 1, stdout), op1 = -1; } __inline__ __attribute__((always_inline)) IO &W(const char &x) { return pc(x), (*this); } __inline__ __attribute__((always_inline)) IO &W(const char *x) { while (*x != 0 ) pc(*(x++)); return (*this); } __inline__ __attribute__((always_inline)) IO &W(const std::string &x) { return W(x.c_str()), (*this); } template <typename T1, typename T2> __inline__ __attribute__((always_inline)) IO &W(const std::pair<T1, T2> &x) { WS(x.first); W(x.second); return (*this); } __inline__ __attribute__((always_inline)) IO &WL() { return W( n ), (*this); } template <typename T> __inline__ __attribute__((always_inline)) IO &WL(const T &x) { return W(x), W( n ), (*this); } __inline__ __attribute__((always_inline)) IO &WS() { return W(space), (*this); } template <typename T> __inline__ __attribute__((always_inline)) IO &WS(const T &x) { return W(x), W(space), (*this); } template <typename T> __inline__ __attribute__((always_inline)) IO &WA(T *a, int n) { for (int i = 0; i < n; i++) WS(a[i]); WL(); return (*this); } template <typename T, typename... Args> __inline__ __attribute__((always_inline)) IO &W(const T &x, const Args &...args) { W(x), W(space), W(args...); return (*this); } template <typename T, typename... Args> __inline__ __attribute__((always_inline)) IO &WS(const T &x, const Args &...args) { return W(x), W(space), W(args...), W(space), (*this); } template <typename... Args> __inline__ __attribute__((always_inline)) IO &WL(const Args &...args) { return W(args...), W( n ), (*this); } template <typename T, typename... Args> __inline__ __attribute__((always_inline)) IO &WA(T *a, int n, Args... args) { for (int i = 0; i < n; i++) WA(a[i], args...); return (*this); } template <typename T> __inline__ __attribute__((always_inline)) typename std::enable_if<std::is_integral<T>::value, IO>::type & W(const T &x) { return __WI(x), (*this); } template <typename T> __inline__ __attribute__((always_inline)) typename std::enable_if<is_container<T>::value, IO>::type & W(const T &x) { for (auto &i : x) WS(i); WL(); return (*this); } template <typename T> __inline__ __attribute__((always_inline)) typename std::enable_if< std::is_void<std::void_t<decltype(std::declval<T>().write())>>::value, IO>::type & W(const T &x) { return x.write(), (*this); } template <typename T> __inline__ __attribute__((always_inline)) IO &operator>>(T &x) { R(x); return (*this); } template <typename T> __inline__ __attribute__((always_inline)) IO &operator<<(const T &x) { W(x); return (*this); } int good() { return goodReadBit; } IO() {} ~IO() { flush(); } } io; const std::int32_t INF = 0x3f3f3f3f; const std::int64_t INFL = 0x3f3f3f3f3f3f3f3f; using namespace std; namespace Math { template <typename T, typename T2> T qpow(T a, T2 b, const int &MOD) { T ans = 1; for (; b; b >>= 1) { if (b & 1) ans = (a * ans) % MOD; a = (a * a) % MOD; } return ans; } template <typename T> T exgcd(T l, T r, T &x, T &y) { if (!r) { x = 1, y = 0; return l; } else { int d = exgcd(r, l % r, y, x); y -= l / r * x; return d; } } template <typename T> T inv(T a, const int &MOD) { return qpow(a, MOD - 2, MOD); } template <typename T> T exinv(T a, const int &MOD) { T x, y; exgcd(a, MOD, x, y); x %= MOD; return x + ((x >> (sizeof(T) * 8 - 1)) & MOD); } template <typename T, T MOD> struct ModInt { T x; ModInt(T x = 0) : x(x) { while (x < 0) x += MOD; } ModInt<T, MOD> operator+=(const ModInt<T, MOD> &y) { x += y.x - MOD; x += (x >> (sizeof(T) * 8 - 1)) & MOD; return (*this); } ModInt<T, MOD> operator-=(const ModInt<T, MOD> &y) { x = x - y.x; x += (x >> (sizeof(T) * 8 - 1)) & MOD; return (*this); } ModInt<T, MOD> operator*=(const ModInt<T, MOD> &y) { x = x * y.x % MOD; return (*this); } ModInt<T, MOD> operator/=(const ModInt<T, MOD> &y) { x = x * inv(y.x, MOD) % MOD; return (*this); } ModInt<T, MOD> pow(int64_t p) { return x = qpow(x, p, MOD), *this; } void write() const { io.W(x); } void read() { io.R(x); x %= MOD; if (x < 0) x += MOD; } }; template <typename T, T MOD> ModInt<T, MOD> operator+(ModInt<T, MOD> a, const ModInt<T, MOD> &b) { a += b; return a; } template <typename T, T MOD> ModInt<T, MOD> operator-(ModInt<T, MOD> a, const ModInt<T, MOD> &b) { a -= b; return a; } template <typename T, T MOD> ModInt<T, MOD> operator*(ModInt<T, MOD> a, const ModInt<T, MOD> &b) { a *= b; return a; } template <typename T, T MOD> ModInt<T, MOD> operator/(ModInt<T, MOD> a, const ModInt<T, MOD> &b) { a /= b; return a; } template <typename T, T MOD> bool operator==(const ModInt<T, MOD> &a, const ModInt<T, MOD> &b) { return a.x == b.x; } } // namespace Math using mint = Math::ModInt<int64_t, int(1e9 + 7)>; int main() { int n, q; io.R(n, q); vector<mint> a(n); io.R(a); a.insert(a.begin(), mint(0)); vector<mint> preSum(n + 1), preSquareSum(n + 1); partial_sum(a.begin(), a.end(), preSum.begin()); partial_sum(a.begin(), a.end(), preSquareSum.begin(), [](mint a, mint b) { return a + b * b; }); mint inv2 = mint(1) / mint(2); mint inv6 = mint(1) / mint(6); while (q--) { int l, r, d; io.R(l, r, d); mint len = r - l + 1; mint x = ((preSum[r] - preSum[l - 1]) * mint(2) / len - (len - mint(1)) * mint(d)) * inv2; mint y = x * x * len + x * (len - mint(1)) * len * mint(d) + len * (mint(2) * len * len - mint(3) * len + mint(1)) * mint(d) * mint(d) * inv6; mint z = (preSquareSum[r] - preSquareSum[l - 1]); io.WL(y == z ? Yes : No ); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct no { int r; int l; int p; }; int main() { int n; double v; double a[110]; double b[110]; cin >> n >> v; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; if (b[i] == 0) { cout << 0.0 << endl; return 0; } } double cu = a[0], ni = b[0]; double aa = 0; for (int i = 1; i < n; i++) { if (b[i] / a[i] < ni / cu) { cu = a[i]; ni = b[i]; } } aa = ni / cu; double ans = 0; for (int i = 0; i < n; i++) ans += aa * a[i]; if (ans > v) ans = v; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> typedef long long ll; #define f(i,a,b) for(i=a;i<b;i++) using namespace std; int main() { ll n,i,sum=0, count=0; cin>>n; vector<ll> a(n); f(i,0,n) cin>>a[i]; priority_queue <int, vector<int>, greater<int>> p; f(i,0,n){ if(a[i]>=0) sum+=a[i], count++; else{ if(sum+a[i]>=0){ sum+=a[i], count++; p.push(a[i]); } else{ if(!p.empty()&&p.top()<a[i]){ sum-=p.top(); p.pop(); sum+=a[i]; p.push(a[i]); } } } } cout<<count<<endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int ml, mr, wl, wr; int main() { cin >> ml >> mr >> wl >> wr; if ((ml * 2 + 3 > wr && wr >= ml - 1) || (mr * 2 + 3 > wl && wl >= mr - 1)) { cout << YES ; return 0; } else { cout << NO ; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct que { int l, r, y, val; bool operator<(const que &v) const { return y < v.y; } }; int n, k, x[100010], y[100010], cnt[100010 * 2], pre[100010 * 2]; long long ans[100010]; vector<que> q; vector<int> h; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d%d , &x[i], &y[i]); for (int i = 1; i <= 2 * n; i++) pre[i] = -0x3f3f3f3f; h.push_back(-0x3f3f3f3f); for (int i = 1; i <= n; i++) { h.push_back(x[i]); h.push_back(x[i] + k); } sort(h.begin(), h.end()); h.resize(unique(h.begin(), h.end()) - h.begin()); for (int i = 1, l, r; i <= n; i++) { l = upper_bound(h.begin(), h.end(), x[i]) - h.begin(); r = lower_bound(h.begin(), h.end(), x[i] + k) - h.begin(); q.push_back({l, r, y[i], 1}); q.push_back({l, r, y[i] + k, -1}); } sort(q.begin(), q.end()); for (auto i : q) for (int j = i.l; j <= i.r; j++) { ans[cnt[j]] += 1ll * (h[j] - h[j - 1]) * (i.y - pre[j]); cnt[j] += i.val; pre[j] = i.y; } for (int i = 1; i <= n; i++) printf( %lld , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; using vii = vector<ii>; const ll MOD = 998244353; const ll INF = 1e15 + 9; const int MAXN = 1000006; int n, m, a[MAXN], p[MAXN], b[MAXN]; int ind[MAXN], seen[MAXN]; ll dp[MAXN], sum[MAXN], negsum[MAXN]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; ++n; for (int i = 1; i < n; ++i) cin >> a[i]; for (int i = 1; i < n; ++i) cin >> p[i]; cin >> m; ++m; for (int i = 1; i < m; ++i) cin >> b[i]; a[n] = n; b[m] = n; ++n, ++m; for (int i = 0, j = 0; i < m; ++i) { while (j < b[i]) ind[j++] = 2 * i - 1; ind[j++] = 2 * i; } for (int i = 0; i < n; ++i) { a[i] = ind[a[i]]; sum[i] = sum[seen[a[i]]] + max(p[i], 0); negsum[i + 1] = negsum[i] + min(p[i], 0); seen[a[i]] = i; } memset(seen, -1, sizeof seen); seen[0] = 0; for (int i = 1; i < n; ++i) { dp[i] = INF; if ((a[i] & 1) == 0) { if (seen[a[i] - 2] != -1) { dp[i] = dp[seen[a[i] - 2]] + sum[seen[a[i] - 1]] + sum[seen[a[i]]] + negsum[i] - negsum[seen[a[i] - 2] + 1]; if (seen[a[i]] != -1) dp[i] = min(dp[i], dp[seen[a[i]]] + negsum[i + 1] - negsum[seen[a[i]] + 1]); } } seen[a[i]] = i; } if (dp[n - 1] >= INF / 2) cout << NO n ; else cout << YES n << dp[n - 1] << n ; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T checkmin(T &a, T b) { return (a < b) ? a : a = b; } template <class T> inline T checkmax(T &a, T b) { return (a > b) ? a : a = b; } template <class T> T GCD(T a, T b) { if (a < 0) return GCD(-a, b); if (b < 0) return GCD(a, -b); return (a == 0) ? b : GCD(b % a, a); } template <class T> T LCM(T a, T b) { if (a < 0) return LCM(-a, b); if (b < 0) return LCM(a, -b); return (a == 0 || b == 0) ? 0 : a / GCD(a, b) * b; } template <class T> T ExtGCD(T a, T b, T &x, T &y) { if (a < 0) { T c = ExtGCD(-a, b, x, y); x = -x; return c; } if (b < 0) { T c = ExtGCD(a, -b, x, y); y = -y; return c; } if (a == 0) { x = 0, y = 1; return b; } else { T c = ExtGCD(b % a, a, y, x); x -= b / a * y; return c; } } template <class T> inline T sqr(T X) { return X * X; } class TUFSet { private: vector<int> S; public: TUFSet() {} TUFSet(int N) { S = vector<int>(N, -1); } int Find(int X) { return S[X] < 0 ? X : (S[X] = Find(S[X])); } void Union(int X, int Y) { X = Find(X); Y = Find(Y); if (X == Y) return; if (S[X] < S[Y]) S[Y] = X; else { if (S[X] == S[Y]) --S[Y]; S[X] = Y; } } }; namespace Poor { int N, M, K; TUFSet UFS; vector<int> D; void Run() { scanf( %d%d%d , &N, &M, &K); UFS = TUFSet(N); for (int i = 0; i < M; ++i) { int U, V; scanf( %d%d , &U, &V); --U, --V; UFS.Union(U, V); } int Ans = 1 % K; int C = 0; D = vector<int>(N, 0); for (int i = 0; i < N; ++i) { ++D[UFS.Find(i)]; if (UFS.Find(i) == i) ++C; } if (C > 1) { for (int i = 0; i < C - 2; ++i) Ans = ((long long)Ans * N) % K; for (int i = 0; i < N; ++i) if (D[i] > 0) Ans = ((long long)Ans * D[i]) % K; } printf( %d n , Ans); } } // namespace Poor int main() { Poor::Run(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int a[1000005]; map<int, int> ht; map<int, int>::reverse_iterator its; long long mul(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) res = (res * a) % mod; a = (a * a) % mod; b /= 2; } return res; } int main() { int n; scanf( %d , &n); long long nf = 1; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); ht[a[i]]++; nf = (nf * i) % mod; } int add = 0; long long ans = 0; for (its = ht.rbegin(); its != ht.rend(); its++) { if (add != 0) ans = (ans + nf * its->second % mod * mul((its->second + add) % mod, mod - 2) % mod * its->first % mod) % mod; add += its->second; } printf( %lld n , ans); } |
#include <bits/stdc++.h> #pragma GCC optimize( unroll-loops ) using namespace std; const long long N = 2e5 + 36; const long long M = 1e3 + 36; const long long INF = 2e9 + 7; const long long MOD = 987654323; const int X[8] = {1, 1, -1, -1, 2, 2, -2, -2}; const int Y[8] = {2, -2, 2, -2, 1, -1, 1, -1}; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, ans = 0; cin >> n; string s, t; cin >> s >> t; for (int i(0); i < (n >> 1); ++i) { if (t[i] == t[n - i - 1]) { if (s[i] == s[n - i - 1]) { continue; } else { ans += 1; continue; } } else { if (s[i] == s[n - i - 1]) { if (t[i] == s[i] || t[n - i - 1] == s[i]) { ans += 1; continue; } else { ans += 2; continue; } } else { if (s[i] != t[i] && s[i] != t[n - i - 1] && s[n - i - 1] != t[i] && s[n - i - 1] != t[n - i - 1]) { ans += 2; continue; } if (min(t[i], t[n - i - 1]) == min(s[i], s[n - i - 1]) && max(t[i], t[n - i - 1]) == max(s[i], s[n - i - 1])) { continue; } else { ans += 1; continue; } } } } if (n % 2 == 1) { if (s[(n >> 1)] != t[(n >> 1)]) ans++; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); long long rand(long long l, long long r) { return uniform_int_distribution<long long>(l, r)(rd); } const int N = 49; int n, m, d[N][N]; int b[N]; signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int(i) = (1); (i) <= (m); ++(i)) { int a, b; cin >> a >> b; if (max(a, b) > 48) continue; d[a][b] = d[b][a] = 1; } n = min(n, 48); for (int(i) = (1); (i) <= (n); ++(i)) b[i] = i; shuffle(b + 1, b + 1 + n, rd); for (int(i) = (1); (i) <= (n); ++(i)) for (int(j) = (i + 1); (j) <= (n); ++(j)) for (int(z) = (j + 1); (z) <= (n); ++(z)) for (int(k) = (z + 1); (k) <= (n); ++(k)) for (int(x) = (k + 1); (x) <= (n); ++(x)) { int CNT = 0; vector<int> a; a.push_back(b[i]), a.push_back(b[j]), a.push_back(b[z]), a.push_back(b[k]), a.push_back(b[x]); for (int(i) = (0); (i) <= ((int)(a).size() - 1); ++(i)) for (int(j) = (0); (j) <= (i - 1); ++(j)) if (d[a[i]][a[j]]) ++CNT; if (CNT == 0 || CNT == 10) { cout << b[i] << << b[j] << << b[z] << << b[k] << << b[x] << n ; return 0; } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; const int N = 1e6, M = 1e6; pair<int, int> adj[M + 7]; long long val[N + 7]; long long sum[N + 7]; long long res = 0; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void addRes(int numb) { res += 1LL * numb * (numb - 1) / 2; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1, r1, r2; i <= m; i++) { cin >> r1 >> r2; adj[i] = {r1, r2}; } for (int i = 1; i <= n; i++) { val[i] = rng(); sum[i] = 0; } for (int i = 1; i <= m; i++) { sum[adj[i].first] += val[adj[i].second]; sum[adj[i].second] += val[adj[i].first]; } int u, v; for (int i = 1; i <= m; i++) { u = adj[i].first; v = adj[i].second; if (sum[u] - val[v] == sum[v] - val[u]) res++; } int start = 1, finish = 1; sort(sum + 1, sum + n + 1); for (int i = 2; i <= n; i++) if (sum[i] == sum[i - 1]) { finish = i; if (i == n) addRes(finish - start + 1); } else { addRes(finish - start + 1); start = finish = i; } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } long long pow2(long long n) { long long x = 1; for (long long i = 1; i <= n; i++) { x *= 2; } return x; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; cout << 2 * (n - 1) + 1 << 2 << endl; cout << 1 2 << endl; } |
#include <bits/stdc++.h> using namespace std; int inf = 1000000005; long long int llinf = 2000000000000000005LL; long long int mod = 1000000007; long long int mod9 = 1000000009; double pi = 3.1415926535897; double eps = 1e-15; int dx[] = {1, -1, 0, 0, 1, -1, 1, -1}, dy[] = {0, 0, 1, -1, 1, 1, -1, -1}; vector<bool> isprime; vector<int> primes; void seive(int n, bool wantlist = true) { isprime.resize(n + 1, true); isprime[0] = isprime[1] = false; int sq = sqrt(n + 1); for (int i = 2; i < sq + 1; i++) { if (isprime[i]) { for (int j = i * i; j <= n; j += i) isprime[j] = false; } } for (int i = 2; wantlist && i <= n; i++) { if (isprime[i]) primes.push_back(i); } } template <class T> inline T gcd(T a, T b) { while (b > 0) { a %= b; swap(a, b); } return a; } template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); } template <class T> inline vector<T> operator+(vector<T>& a, vector<T>& b) { assert(a.size() == b.size()); int n = a.size(); vector<T> c(n); for (int i = 0; i < n; i++) c[i] = a[i] + b[i]; return c; } int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } inline long long int bexp(long long int x, long long int n, long long int m = mod) { long long int res = 1; x %= m; while (n) { if (n & 1) res = res * x % m; x = x * x % m; n >>= 1; } return res; } inline bool ispalin(string& str) { int n = str.length(); for (int i = 0; i < n / 2; i++) if (str[i] != str[n - i - 1]) return false; return true; } inline void mapper(vector<int>& a, int idx = 0) { int cc = idx, n = a.size(); map<int, vector<int> > mapp; for (int i = 0; i < n; i++) mapp[a[i]].push_back(i); for (auto& p : mapp) { for (int i : p.second) a[i] = cc; cc++; } } template <class T> inline void ri(T& i) { char c; for (c = getchar(); c < 0 || c > 9 ; c = getchar()) ; for (i = 0; c >= 0 && c <= 9 ; c = getchar()) i = (i << 3) + (i << 1) + (c - 48); } long long int Euclid(long long int a, long long int b, long long int& x, long long int& y) { if (b == 0LL) { x = (a < 0LL ? -1LL : 1LL); y = 0LL; return a * x; } long long int q = a / b; long long int r = a % b; long long int d = Euclid(b, r, y, x); y -= q * x; return d; } long double calDistance(long long int x, long long int y) { long double tx = (long double)(x); long double ty = (long double)(y); long double res = tx * tx + ty * ty; res = sqrt(res); return res; } int main() { pair<long long int, long long int> a, b, t; cin >> a.first >> a.second >> b.first >> b.second >> t.first >> t.second; int n; cin >> n; vector<vector<long double> > dis(n, vector<long double>(3, 0.0)); for (int i = 0; i < n; i++) { pair<long long int, long long int> bottle; cin >> bottle.first >> bottle.second; long long int x, y; x = labs(bottle.first - t.first); y = labs(bottle.second - t.second); dis[i][0] = calDistance(x, y); x = labs(bottle.first - a.first); y = labs(bottle.second - a.second); dis[i][1] = calDistance(x, y); x = labs(bottle.first - b.first); y = labs(bottle.second - b.second); dis[i][2] = calDistance(x, y); } vector<vector<long double> > AL(n, vector<long double>(2, 0.0)); for (int i = 0; i < n; i++) { if (!i) { AL[i][0] = dis[i][0]; AL[i][1] = dis[i][1]; } else { AL[i][0] = dis[i][0] + AL[i - 1][0]; AL[i][1] = min(AL[i - 1][0] + dis[i][1], AL[i - 1][1] + dis[i][0]); } } vector<vector<long double> > AR(n, vector<long double>(2, 0.0)); for (int i = n - 1; i >= 0; i--) { if (i == n - 1) { AR[i][0] = dis[i][0]; AR[i][1] = dis[i][1]; } else { AR[i][0] = dis[i][0] + AR[i + 1][0]; AR[i][1] = min(AR[i + 1][0] + dis[i][1], AR[i + 1][1] + dis[i][0]); } } vector<vector<long double> > BL(n, vector<long double>(2, 0.0)); for (int i = 0; i < n; i++) { if (!i) { BL[i][0] = dis[i][0]; BL[i][1] = dis[i][2]; } else { BL[i][0] = dis[i][0] + BL[i - 1][0]; BL[i][1] = min(BL[i - 1][0] + dis[i][2], BL[i - 1][1] + dis[i][0]); } } vector<vector<long double> > BR(n, vector<long double>(2, 0.0)); for (int i = n - 1; i >= 0; i--) { if (i == n - 1) { BR[i][0] = dis[i][0]; BR[i][1] = dis[i][2]; } else { BR[i][0] = dis[i][0] + BR[i + 1][0]; BR[i][1] = min(BR[i + 1][0] + dis[i][2], BR[i + 1][1] + dis[i][0]); } } long double ans = min(AL[n - 1][1], BL[n - 1][1]); for (int i = 0; i < n - 1; i++) { long double val = min(AL[i][1] + BR[i + 1][1], BL[i][1] + AR[i + 1][1]); ans = min(val, ans); } for (int i = 0; i < n; i++) { ans += dis[i][0]; } cout << fixed << setprecision(12) << ans << n ; return 0; } |
#include <bits/stdc++.h> #define ll long long using namespace std; int main() { int t; cin>>t; int arra[10] = { 0, 3, 17, 151, 1117, 11941, 117653, 1219837, 12176537, 132176537 }; int arrb[10] = {0, 7, 23, 191, 1181, 12071, 129837, 1329837, 13298373, 143298373 }; while(t--) { int a, b, c, x=0, y=0, z = 0; cin>>a>>b>>c; if(a==c || b == c) { x = pow(10, a- 1); y = pow(10, b- 1); } else { z = arra[c]; x = z * arra[a- c+ 1]; y = z * arrb[b- c+ 1]; } cout<<x<< <<y<<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long oo = 1000000000000000000LL; const int N = 100005; vector<pair<int, int>> ds; long long data[2][100005]; int x[N], p[N], c[N], st[N]; long long val[N]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , x + i); ds.push_back({x[i], i}); } for (int i = 1; i <= m; i++) { scanf( %d%d , p + i, c + i); ds.push_back({p[i], -i}); } sort(ds.begin(), ds.end()); long long* f[2] = {data[0] + 10005, data[1] + 10005}; int flag = 0; for (int i = -n; i <= n; i++) f[flag][i] = oo; f[flag][0] = 0; long long last = ds[0].first; for (int i = 0; i < ds.size(); i++) { int old = flag; flag ^= 1; if (ds[i].second > 0) { f[flag][n] = oo; for (int j = -n; j < n; j++) { f[flag][j] = oo; if (f[old][j + 1] < oo) f[flag][j] = f[old][j + 1] + (ds[i].first - last) * abs(j + 1); } } else { int head = 0, tail = -1, cc = c[-ds[i].second]; for (int j = -n; j <= n; j++) { if (f[old][j] < oo) { long long tmp = f[old][j] + abs(j) * (ds[i].first - last); while (head <= tail && val[tail] > tmp) tail--; st[++tail] = j; val[tail] = tmp; } while (head <= tail && st[head] + cc < j) head++; f[flag][j] = oo; if (head <= tail) f[flag][j] = val[head]; } } last = ds[i].first; } if (f[flag][0] == oo) printf( -1 ); else printf( %lld , f[flag][0]); } |
#include <bits/stdc++.h> using namespace std; int n; double sv[500050]; struct info { int x, v; } A[500050]; int main() { scanf( %d , &n); int l = 0; for (int i = 0; i < n; i++) scanf( %d %d , &A[i].x, &A[i].v); int st = n, nd = -1; for (int i = 0; i < n; i++) if (A[i].v > 0) { st = i; break; } for (int i = n - 1; i >= 0; i--) if (A[i].v < 0) { nd = i; break; } if (st > nd) puts( -1.000000000000 ); else { int it = 100; double low = 0, high = 1e20, mid; while (it--) { mid = (low + high) / 2; double mx = -1e20, mn = 1e20; int i; for (i = 0; i < n; i++) if (A[i].v > 0) sv[i] = mx = max(mx, A[i].v * mid + A[i].x); for (i = n - 1; i >= 0; i--) { if (A[i].v < 0) mn = min(mn, A[i].v * mid + A[i].x); else if (sv[i] > mn) break; } if (i >= 0) high = mid; else low = mid; } printf( %.12lf n , mid); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long ex(long long a, long long b) { long long tmp = 1; for (int i = 0; i < b; i++) { tmp = tmp * a; } return tmp; } int main() { long long r, l, tmp, ans = -1; bool good = 1; cin >> l >> r; for (long long i = l; i <= r; i++) { for (long long k = 0; k <= 5; k++) { for (long long j = 0; j <= 5; j++) { if (i / (ex(10, j)) % 10 == (i / (ex(10, k))) % 10 && ex(10, k) <= i && ex(10, j) <= i && j != k) { good = 0; } } } if (good) { ans = i; } good = 1; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; long long n, m; long long ar[1000001], dp[1001][1001]; long long calc(long long idx, long long rem) { if (rem == 0 && idx != 0) return 1; if (idx >= n) return 0; long long &b = dp[idx][rem]; if (b != -1) return b; else b = 0; b |= calc(idx + 1, (rem + ar[idx]) % m); b |= calc(idx + 1, rem); return b; } void solve() { cin >> n >> m; for (long long i = 0; i < (n); ++i) { cin >> ar[i]; ar[i] %= m; if (ar[i] == 0) { cout << YES n ; return; } } if (n >= m) { cout << YES n ; return; } else { for (long long i = 0; i < (1001); ++i) for (long long j = 0; j < (1001); ++j) dp[i][j] = -1; if (calc(0, m)) { cout << YES n ; } else cout << NO n ; } } int32_t main() { ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long pow(long long a, long long 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 modInverse(long long a, long long m) { return pow(a, m - 2, m); } long long arr[(int)1e5 + 1 + 1], val[(int)1e5 + 1]; int main() { long long n; while (cin >> n) { for (int i = 0; i < n; i++) { cin >> arr[i]; val[i] = 1; } long long ans = 1; for (int i = 1; i < n; i++) { if (arr[i] >= arr[i - 1]) { val[i] = max(val[i], val[i - 1] + 1); } ans = max(ans, val[i]); } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n; cin >> n; vector<long long int> s(2 * n); for (int i = 0; i < 2 * n; i++) cin >> s[i]; sort(s.begin(), s.end()); if (s[0] == s[2 * n - 1]) { cout << -1 << n ; return; } for (int i = 0; i < 2 * n; i++) cout << s[i] << ; cout << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); long long int t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10, LG = 45; long long n, ts, Mx, B[N], S[N]; struct Node { int32_t l, r, c; Node() { l = r = c = 0; } }; vector<Node> A; inline long long Creat() { return (ts++); } inline void Add(long long val, long long tp) { long long id = 0; A[id].c += tp; for (long long i = LG - 1; ~i; i--) { bool b = (val >> i) & 1; if (!A[id].l) A[id].l = Creat(); if (!A[id].r) A[id].r = Creat(); if (!b) id = A[id].l; if (b) id = A[id].r; A[id].c += tp; } } inline long long Get(long long val) { long long id = 0, ret = 0; for (long long i = LG - 1; ~i; i--) { if (!A[id].l) A[id].l = Creat(); if (!A[id].r) A[id].r = Creat(); bool b = (val >> i) & 1, w = 0; if ((!b && A[A[id].r].c) || (b && !A[A[id].l].c)) id = A[id].r, ret |= (1ll << i), w = 1; if (!w) id = A[id].l; } return (val ^ ret); } int32_t main() { scanf( %lld , &n); A.resize(2e7, Node()); Creat(); Add(0, 2); for (long long i = 1; i <= n; i++) scanf( %lld , &B[i]); for (long long i = n; i; i--) S[i] = S[i + 1] ^ B[i], Add(S[i], 1); for (long long i = 0, r = 0; i <= n; i++, r ^= B[i]) Mx = max(Mx, Get(r)), Add(S[i + 1], -1); return !printf( %lld , Mx); } |
#include <bits/stdc++.h> using namespace std; int fuck[2010], de[2010], n; char mp[2010][2010]; int check() { sort(fuck + 1, fuck + 1 + n); int sum = 0; for (int i = 1; i < n; i++) { sum += fuck[i]; if (sum == i * (i - 1) / 2) return 0; } return 1; } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %s , mp[i] + 1); for (int j = 1; j <= n; j++) { if (mp[i][j] == 1 ) de[i]++, fuck[i] = de[i]; } } if (check()) { cout << 0 << << 1; return 0; } if (n <= 6) { int minn = 1e9, res = 0; for (int i = 1; i < (1 << n); i++) { int now = 0; for (int j = 1; j <= n; j++) { if ((1 << (j - 1)) & i) { now++; de[j] = n - 1 - de[j]; for (int k = 1; k <= n; k++) { if (k == j) continue; if (mp[j][k] == 1 ) { mp[j][k] = 0 ; mp[k][j] = 1 ; de[k]++; } else { mp[j][k] = 1 ; mp[k][j] = 0 ; de[k]--; } } } } for (int j = 1; j <= n; j++) fuck[j] = de[j]; for (int j = 1; j <= n; j++) { if ((1 << (j - 1)) & i) { de[j] = n - 1 - de[j]; for (int k = 1; k <= n; k++) { if (k == j) continue; if (mp[j][k] == 1 ) { mp[j][k] = 0 ; mp[k][j] = 1 ; de[k]++; } else { mp[j][k] = 1 ; mp[k][j] = 0 ; de[k]--; } } } } if (now > minn) continue; if (check()) { if (now < minn) minn = now, res = 1; else res++; } } if (minn == 1e9) cout << -1; else { for (int i = 1; i <= minn; i++) res *= i; cout << minn << << res; } } else { int res = 0; for (int j = 1; j <= n; j++) { de[j] = n - 1 - de[j]; for (int k = 1; k <= n; k++) { if (k == j) continue; if (mp[j][k] == 1 ) { mp[j][k] = 0 ; mp[k][j] = 1 ; de[k]++; } else { mp[j][k] = 1 ; mp[k][j] = 0 ; de[k]--; } } for (int j = 1; j <= n; j++) fuck[j] = de[j]; de[j] = n - 1 - de[j]; for (int k = 1; k <= n; k++) { if (k == j) continue; if (mp[j][k] == 1 ) { mp[j][k] = 0 ; mp[k][j] = 1 ; de[k]++; } else { mp[j][k] = 1 ; mp[k][j] = 0 ; de[k]--; } } if (check()) res++; } cout << 1 << << res << endl; } } |
#include <bits/stdc++.h> int n, a, b, p; char s[51]; int main(void) { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d %s , &a, s); b = 0; p = a / 2; for (int j = 0; j < a; j++) { if (s[j] == ( ) { b++; } else { if (b > 0) { b--; p--; } } } printf( %d n , p); } } |
#include <bits/stdc++.h> using std::cin; using std::cout; using std::pair; using std::set; using std::sort; using std::string; using std::vector; int main() { int n, m; cin >> n >> m; vector<vector<pair<string, int>>> byreg(m); for (int i = 0; i < n; i++) { string a; int b, c; cin >> a >> b >> c; byreg[b - 1].push_back(make_pair(a, c)); } for (int i = 0; i < m; i++) { sort(byreg[i].begin(), byreg[i].end(), [](pair<string, int> &l, pair<string, int> &r) { return l.second > r.second; }); } for (int i = 0; i < m; i++) { if (byreg[i].size() > 2) { if (byreg[i][0].second == byreg[i][2].second || byreg[i][1].second == byreg[i][2].second) { cout << ? n ; } else cout << byreg[i][0].first << << byreg[i][1].first << n ; } else cout << byreg[i][0].first << << byreg[i][1].first << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1010; const int INF = 100000000; string str[maxn]; int dp[maxn][maxn]; int n, m, ans; int flag[maxn][maxn]; int dir[4][2] = {0, -1, 0, 1, 1, 0, -1, 0}; char ch[5] = { D , I , M , A }; vector<pair<int, int> > q; bool Ok(int ki, int kj) { if (ki >= 0 && ki < n && kj >= 0 && kj < m) return true; return false; } int dfs(int ki, int kj, int d, int f) { int Ans = 1; for (int i = 0; i < 4; i++) { int ti = ki + dir[i][0]; int tj = kj + dir[i][1]; if (Ok(ti, tj) && str[ti][tj] == ch[d + 1 < 4 ? d + 1 : 0]) { if (flag[ti][tj] < f) { int k = flag[ti][tj]; flag[ti][tj] = f; if (dp[ti][tj] > 0) Ans = max(Ans, dp[ti][tj] + 1); else Ans = max(Ans, dfs(ti, tj, d + 1 < 4 ? d + 1 : 0, f) + 1); flag[ti][tj] = k; } else { Ans = INF; break; } } } dp[ki][kj] = Ans; return Ans; } void solve() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { cin >> str[i]; for (int j = 0; j < m; j++) { if (str[i][j] == D ) q.push_back(pair<int, int>(i, j)); } } for (int i = 0; i < q.size(); i++) { if (dp[q[i].first][q[i].second] == 0) ans = max(ans, dfs(q[i].first, q[i].second, 0, i + 1) / 4); } if (ans == 0) cout << Poor Dima! << endl; else if (ans >= 2500000) cout << Poor Inna! << endl; else cout << ans << endl; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> std::mt19937 rng( (int)std::chrono::steady_clock::now().time_since_epoch().count()); const int ms = 110000; const int bs = 1000; const int MOD = 998244353; void add(int &a, int b) { a = a + b < MOD ? a + b : a + b - MOD; } int *pivot; bool comp(int x1, int x2) { return pivot[x1] < pivot[x2]; } int tmp[2][bs]; struct Bucket { Bucket() { dirty = size = 0; } void push_back(int x) { p[size] = size; lazy[size] = 0; dp[size] = x; values[size++] = 0; } void clean() { for (int i = size - 2; i >= 0; i--) { add(lazy[i], lazy[i + 1]); } for (int i = 0; i < size; i++) { add(dp[p[i]], lazy[i]); lazy[i] = 0; } if (dirty) { for (int i = 0; i < size; i++) { values[i] += dirty; } dirty = 0; } } void sort() { clean(); pivot = values; std::sort(p, p + size, comp); } int getID(int x) { if (x < values[p[0]] + dirty) { return -1; } int l = 0, r = size - 1; while (l != r) { int mid = (l + r + 1) / 2; if (values[p[mid]] + dirty <= x) { l = mid; } else { r = mid - 1; } } return l; } void upd(int x, int l, int r, int val) { if (l == 0 && r == size) { int id = getID(x); if (id != -1) { add(lazy[id], val); } } else { for (int i = l; i < r; i++) { if (values[i] + dirty <= x) { add(dp[i], val); } else { } } } } void upd2(int l, int r, int val) { if (l == 0 && r == size) { dirty += val; } else { for (int i = l; i < r; i++) { values[i] += val; } clean(); pivot = values; int s0 = 0, s1 = 0; for (int i = 0; i < size; i++) { if (l <= p[i] && p[i] < r) { tmp[0][s0++] = p[i]; } else { tmp[1][s1++] = p[i]; } } std::merge(tmp[0], tmp[0] + s0, tmp[1], tmp[1] + s1, p, comp); } } int values[bs], p[bs], lazy[bs], dp[bs]; int dirty; int size; }; Bucket b[ms / bs + 2]; std::vector<int> pos[ms]; int a[ms]; int pt[ms]; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); int n, k; std::cin >> n >> k; for (int i = 1; i <= n; i++) { pos[i].push_back(-1); } for (int i = 0; i < n; i++) { std::cin >> a[i]; pos[a[i]].push_back(i); b[i / bs].push_back(i == 0 ? 1 : 0); } b[n / bs].push_back(0); for (int i = 1; i <= n; i++) { pos[i].push_back(n); pos[i].push_back(n); } auto upd2 = [&](int l, int r, int val) { if (l >= r) return; int bl = l / bs, br = (r - 1) / bs; if (bl == br) { b[bl].upd2(l - bl * bs, r - bl * bs, val); return; } b[bl].upd2(l - bl * bs, bs, val); for (int i = bl + 1; i < br; i++) { b[i].upd2(0, bs, val); } b[br].upd2(0, r - br * bs, val); }; auto upd = [&](int l, int r, int val) { if (l >= r) return; int bl = l / bs, br = (r - 1) / bs; if (bl == br) { b[bl].upd(k, l - bl * bs, r - bl * bs, val); return; } b[bl].upd(k, l - bl * bs, bs, val); for (int i = bl + 1; i < br; i++) { b[i].upd(k, 0, bs, val); } b[br].upd(k, 0, r - br * bs, val); }; for (int i = 1; i <= n; i++) { upd2(pos[i][1] + 1, pos[i][2] + 1, 1); } for (int i = 0; i < n; i++) { b[i / bs].clean(); int dp = b[i / bs].dp[i % bs]; upd(i + 1, n + 1, dp); { int v = a[i]; upd2(pos[v][pt[v] + 1] + 1, pos[v][pt[v] + 2] + 1, -1); pt[v]++; upd2(pos[v][pt[v] + 1] + 1, pos[v][pt[v] + 2] + 1, 1); } } b[n / bs].clean(); std::cout << b[n / bs].dp[n % bs] << n ; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long long int inverse(long long int i) { if (i == 1) return 1; return (MOD - ((MOD / i) * inverse(MOD % i)) % MOD + MOD) % MOD; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long m, n, x; cin >> m >> n; cout << flush; long long a[n]; for (int i = 0; i < n; i++) { cout << 1 << endl; cout << flush; cin >> x; if (x == 0) exit(0); else if (x == 1) a[i] = 1; else a[i] = 0; } long long l = 2, r = m, mid, j = 0; while (1) { mid = (l + r) / 2; cout << mid << endl; cout << flush; cin >> x; if (x == 0 || x == -2) exit(0); else { if (x == 1) { if (a[j] == 1) l = mid + 1; else r = mid - 1; } else if (x == -1) { if (a[j] == 1) r = mid - 1; else l = mid + 1; } } j++; j %= n; } } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-8; const int inf = 1 << 30; const int mod = int(1e9) + 7; const int base = 257; const int maxn = 2005; int n, m, d[maxn][maxn], ans = -1, sx = -1, sy = -1; char c[maxn][maxn]; int get(int xa, int ya, int xb, int yb) { int res = d[xb][yb]; res -= d[xa - 1][yb]; res -= d[xb][ya - 1]; res += d[xa - 1][ya - 1]; return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> c[i][j]; d[i][j] = d[i][j - 1] + (c[i][j] == X ); } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (c[i][j] == X && sx == -1) sx = i, sy = j; d[i][j] += d[i - 1][j]; } for (int x = 1; x <= n; x++) for (int y = 1; y <= m; y++) { if (get(sx, sy, sx + x - 1, sy + y - 1) == x * y) { int sxx = sx, syy = sy; vector<pair<int, int> > v; v.push_back(make_pair(sxx, syy)); go:; int sum1 = get(sxx + 1, syy, sxx + 1 + x - 1, syy + y - 1); int sum2 = get(sxx, syy + 1, sxx + x - 1, syy + 1 + y - 1); if (sum1 == x * y && sum2 == x * y) continue; if (sum1 == x * y) { sxx++; v.push_back(make_pair(sxx, syy)); goto go; } else if (sum2 == x * y) { syy++; v.push_back(make_pair(sxx, syy)); goto go; } else { int tot = 1ll * get(v[0].first, v[0].second, v[0].first + x - 1, v[0].second + y - 1); for (int i = 1; i < v.size(); i++) { tot += get(v[i].first, v[i].second, v[i].first + x - 1, v[i].second + y - 1); tot -= get(v[i].first, v[i].second, v[i - 1].first + x - 1, v[i - 1].second + y - 1); } if (d[n][m] == tot) { if (ans == -1) ans = x * y; else ans = min(ans, x * y); } else continue; } } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int dp[205][205][205]; long long int n, k; string s, t; char c1, c2; long long int solve(long long int pos, long long int k, long long int cnt) { if (pos >= n) { return 0; } if (dp[pos][k][cnt] != -1) return dp[pos][k][cnt]; long long int ans = 0; ans = max(solve(pos + 1, k, cnt), ans); if (c1 == s[pos] && k >= 0) { ans = max(solve(pos + 1, k, cnt + 1), ans); } else if (c1 != s[pos] && k >= 1) { ans = max(solve(pos + 1, k - 1, cnt + 1), ans); } if (c2 == s[pos] && k >= 0) { ans = max(cnt + solve(pos + 1, k, cnt), ans); } else if (c2 != s[pos] && k >= 1) { ans = max(cnt + solve(pos + 1, k - 1, cnt), ans); } return dp[pos][k][cnt] = ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n >> k; cin >> s >> t; c1 = t[0]; c2 = t[1]; for (int i = 0; i < 205; i++) for (int j = 0; j < 205; j++) for (int p = 0; p < 205; p++) dp[i][j][p] = -1; if (c1 != c2) { cout << solve(0, k, 0) << endl; } else { long long int cnt = 0; for (int i = 0; i < n; i++) { if (s[i] == c1) cnt++; } long long int ans = min(cnt + k, n); ans = ans * (ans - 1) / 2; cout << ans; } } |
#include <bits/stdc++.h> using namespace ::std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long add(long long a, long long b, long long m = 1000000007) { return (a % m + b % m + 2 * m) % m; } long long mul(long long a, long long b, long long m = 1000000007) { return ((a % m + m) * (b % m + m)) % m; } int main(void) { int n; scanf( %d , &(n)); if (n % 2 == 0) puts( Mahmoud ); else puts( Ehab ); return 0; } |
#include <bits/stdc++.h> using namespace std; void Rd(int &res) { res = 0; char p; while (p = getchar(), p < 0 ) ; do { res = (res * 10) + (p ^ 48); } while (p = getchar(), p >= 0 ); } void Max(int &x, int y) { if (x < y) x = y; } struct W { int to, nx, d; } Lis[100005 << 1]; int Head[100005], tot = 1; void Add(int x, int y, int d) { Lis[tot].to = y, Lis[tot].nx = Head[x], Lis[tot].d = d; Head[x] = tot++; } int n, P; long long ans; int q[100005], sz, cntson[100005], Mxson[100005], phi; int fast(int x, int p) { int re = 1; while (p) { if (p & 1) re = (long long)re * x % P; x = (long long)x * x % P, p >>= 1; } return re; } bool vis[100005]; void dfs_pre(int x, int f) { cntson[x] = 1, Mxson[x] = 0, q[sz++] = x; for (int i = Head[x], to; i && (to = Lis[i].to, 1); i = Lis[i].nx) if (to != f && !vis[to]) dfs_pre(to, x), cntson[x] += cntson[to], Max(Mxson[x], cntson[to]); } map<pair<int, int>, int> mp; map<int, int> pm; void dfs_pro(int x, int f, int v1, int c, int v2, int fac) { mp[pair<int, int>(v1, c)]++, pm[v2]++; for (int i = Head[x], to; i && (to = Lis[i].to, 1); i = Lis[i].nx) if (to != f && !vis[to]) dfs_pro(to, x, (v1 * 10LL + Lis[i].d) % P, c + 1, (v2 + (long long)fac * Lis[i].d) % P, fac * 10LL % P); } void dfs(int x) { sz = 0; dfs_pre(x, x); int pl = cntson[x], rt = x; for (int i = 0; i < sz; i++) { int p = q[i]; Max(Mxson[p], cntson[x] - cntson[p]); if (Mxson[p] < pl) pl = Mxson[p], rt = p; } mp.clear(), pm.clear(); dfs_pro(rt, rt, 0, 0, 0, 1); ans--; for (map<pair<int, int>, int>::iterator it = mp.begin(); it != mp.end(); it++) { int lp = (long long)(P - (it->first).first) * fast(fast(10, (it->first).second), phi) % P; map<int, int>::iterator it1 = pm.find(lp); if (it1 != pm.end()) ans += (long long)(it->second) * (it1->second); } for (int i = Head[rt], to; i && (to = Lis[i].to, 1); i = Lis[i].nx) if (!vis[to]) { mp.clear(), pm.clear(); dfs_pro(to, rt, Lis[i].d % P, 1, Lis[i].d % P, 10 % P); for (map<pair<int, int>, int>::iterator it = mp.begin(); it != mp.end(); it++) { int lp = (long long)(P - (it->first).first) * fast(fast(10, (it->first).second), phi) % P; map<int, int>::iterator it1 = pm.find(lp); if (it1 != pm.end()) ans -= (long long)(it->second) * (it1->second); } } vis[rt] = 1; for (int i = Head[rt], to; i && (to = Lis[i].to, 1); i = Lis[i].nx) if (!vis[to]) dfs(to); } int main() { Rd(n), Rd(P); if (P == 1) { cout << (long long)n * (n - 1) << endl; return 0; } phi = P; int t = P; for (int i = 2; (long long)i * i <= phi; i++) if (t % i == 0) { phi = phi / i * (i - 1); while (t % i == 0) t /= i; } if (t > 1) phi = phi / t * (t - 1); phi--; for (int i = 1, x, y, z; i < n; i++) Rd(x), Rd(y), Rd(z), x++, y++, Add(x, y, z), Add(y, x, z); dfs(1); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 70, M = 11, MA = 1030; long long int dp[M][N][M][MA], dps[M][N][MA], dpt[M][N], n, q, b, l, r, x; vector<long long int> v; long long int get(long long int a, long long int b) { long long int x = a, ans, mask = 0, l; v.resize(0); while (x > 0) { v.push_back(x % b); x /= b; } l = (long long int)v.size(); ans = dpt[b][l]; reverse(v.begin(), v.end()); for (auto y : v) { for (int j = b - 1; j > y; j--) ans -= dp[b][l][j][mask]; mask ^= (1 << y); l--; } return ans; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); for (long long int bi = 2; bi <= 10; bi++) { for (int l = 2; l <= 65; l++) { for (int c = 0; c < bi; c++) { dp[bi][1][c][(1ll << c)] = 1; for (int mask = 0; mask < (1ll << bi); mask++) dps[bi][1][mask] += dp[bi][1][c][mask]; } dpt[bi][1] = 0; } } for (long long int bi = 2; bi <= 10; bi++) { for (int l = 2; l <= 65; l++) { dpt[bi][l] = dpt[bi][l - 1]; for (int c = 0; c < bi; c++) { for (int i = 0; i < bi; i++) for (int mask = 0; mask < (1ll << bi); mask++) { x = mask, x ^= (1ll << c); dp[bi][l][c][mask] += dp[bi][l - 1][i][x]; } for (int mask = 0; mask < (1ll << bi); mask++) dps[bi][l][mask] += dp[bi][l][c][mask]; if (c != 0) dpt[bi][l] += dp[bi][l][c][0]; } } } cin >> q; for (int i = 1; i <= q; i++) { cin >> b >> l >> r; l--; cout << get(r, b) - get(l, b) << n ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx ) using namespace std; template <class U, class V> istream& operator>>(istream& is, pair<U, V>& p) { is >> p.first >> p.second; return is; } template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) { is >> x; } return is; } template <class T> ostream& operator<<(ostream& os, vector<T>& v) { for (auto& x : v) { os << x << ; } return os; } const int N = 1e5 + 5; int n, x, y; vector<int> b; int freq[N]; int match_indices[N]; set<pair<int, int>> cnt; vector<int> match_colors[N]; void init() { cnt.clear(); for (int i = 0; i < n + 3; ++i) { freq[i] = 0; match_indices[i] = 0; match_colors[i].clear(); } } void buildFreq() { for (int x : b) { ++freq[x]; } for (int i = 1; i <= n + 1; ++i) { if (freq[i] != 0) { cnt.emplace(freq[i], i); } } } int getMissingElement() { for (int i = 1; i <= n + 1; ++i) { if (freq[i] == 0) return i; } assert(false); return -1; } void buildMatchIndices() { for (int i = 0; i < x; ++i) { auto it = cnt.end(); --it; auto curr = *it; cnt.erase(it); --curr.first; ++match_indices[curr.second]; if (curr.first != 0) { cnt.emplace(curr); } } } bool buildMatchColors() { if (y == 0) return true; if (cnt.empty()) return false; int y = ::y; vector<int> v1; for (auto p : cnt) { while (p.first--) { v1.emplace_back(p.second); } } auto v2 = v1; rotate(begin(v2), begin(v2) + ((int)(v1.size())) - cnt.rbegin()->first, end(v2)); for (int i = 0; i < ((int)(v1.size())); ++i) { if (v1[i] == v2[i]) continue; if (y == 0) break; --y; match_colors[v1[i]].emplace_back(v2[i]); } return y == 0; } void check(const vector<int>& a) { int x = ::x; int y = ::y; y += x; for (int i = 0; i < n; ++i) { x -= (a[i] == b[i]); } assert(x == 0); multiset<int> ms(begin(a), end(a)); for (int i = 0; i < n; ++i) { auto it = ms.find(b[i]); if (it == end(ms)) continue; ms.erase(it); --y; } assert(y == 0); } void solve() { if (y < x) { cout << NO << endl; return; } y -= x; init(); buildFreq(); buildMatchIndices(); if (!buildMatchColors()) { cout << NO << endl; return; } int missing_element = getMissingElement(); vector<int> res(n, missing_element); for (int i = 0; i < n; ++i) { if (match_indices[b[i]] > 0) { --match_indices[b[i]]; res[i] = b[i]; continue; } if (!match_colors[b[i]].empty()) { res[i] = match_colors[b[i]].back(); match_colors[b[i]].pop_back(); } } check(res); cout << YES << endl; cout << res << endl; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { cin >> n >> x >> y; b.resize(n); cin >> b; solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int A[1 << 21], B[1 << 21]; long long level_index1[21]; long long level_index2[21]; long long mergesort(int begin, int end, int level) { if (begin == end) return 0; long long inv_index = 0; int middle = (begin + end) / 2; inv_index += mergesort(begin, middle, level + 1); inv_index += mergesort(middle + 1, end, level + 1); int left = begin; int right = middle + 1; long long ct = 0; long long ct2 = 0; for (int k = begin; k <= end; ++k) { if (right > end || (left <= middle && (A[left] <= A[right]))) { B[k] = A[left++]; } else { B[k] = A[right++]; ct += (middle - left + 1); } } left = begin, right = middle + 1; for (int k = begin; k <= end; ++k) { if (right > end || (left <= middle && (A[left] < A[right]))) { left++; ct2 += (end - right + 1); } else { right++; } } for (int k = begin; k <= end; ++k) A[k] = B[k]; level_index1[level] += ct; level_index2[level] += ct2; return inv_index + ct; } int main() { ios_base::sync_with_stdio(false); int n; cin >> n; int fim = 1 << n; for (int i = 0; i < fim; ++i) cin >> A[i]; for (int lvl = 0; lvl <= n; ++lvl) { level_index1[lvl] = level_index2[lvl] = 0; } mergesort(0, fim - 1, 0); int m; cin >> m; while (m--) { int q; cin >> q; long long ans = 0; q = n - q; for (int lvl = 0; lvl < q; ++lvl) { ans += level_index1[lvl]; } for (int lvl = q; lvl < n; ++lvl) { swap(level_index1[lvl], level_index2[lvl]); ans += level_index1[lvl]; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, minn = 1000000, indx; cin >> n; int arr[n + 1]; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i < n; i++) { if (abs(arr[i] - arr[i + 1]) < minn) { minn = abs(arr[i] - arr[i + 1]); indx = i; } } if (abs(arr[1] - arr[n]) < minn) cout << n << << 1 << endl; else cout << indx << << indx + 1 << endl; return 0; } |
#include <bits/stdc++.h> const int maxn = 300 + 10; char st[maxn][maxn]; int n, m, p; int main() { scanf( %d%d%d , &n, &m, &p); for (int i = 1; i <= n; i++) scanf( %s , st[i] + 1); for (int k = 1; k <= n; k++) { for (int i = 1 + k; i + k <= n; i++) for (int j = 1 + k; j + k <= m; j++) if (st[i][j] == * && st[i - k][j] == * && st[i + k][j] == * && st[i][j - k] == * && st[i][j + k] == * ) { p--; if (!p) { printf( %d %d n%d %d n%d %d n%d %d n%d %d n , i, j, i - k, j, i + k, j, i, j - k, i, j + k); return 0; } } } printf( -1 n ); } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { int temp; if (y == 0) return 1; temp = power(x, y / 2); if (y % 2 == 0) return temp * temp; else return x * temp * temp; } long long int fun(long long int n) { if (n == 0) return 0; else { return n % 10 + fun(n / 10); } } int main() { long long int t; cin >> t; for (int _ = 0; _ < t; _++) { long long int n, k, a, b; cin >> k >> n >> a >> b; if (k - (n * b) <= 0) cout << -1 n ; else { long long int ans = 0; if ((k - (n * b)) % (a - b) == 0) { ans = ((k - (n * b)) / (a - b)) - 1; } else { ans = (k - (n * b)) / (a - b); } ans = min(n, ans); cout << ans << n ; } } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; } template <typename T> int SIZE(const T &t) { return t.size(); } string to_string(const string s, int x1 = 0, int x2 = 1e9) { return + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : ) + ; } string to_string(const char *s) { return to_string((string)s); } string to_string(const bool b) { return (b ? true : false ); } string to_string(const char c) { return string({c}); } template <size_t N> string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) { string t = ; for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1); __iii__ <= __jjj__; ++__iii__) { t += b[__iii__] + 0 ; } return + t + ; } template <typename A, typename... C> string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = ( + to_string(p.first) + , + to_string(p.second) + ) ; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A(&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ); string res = ; bool first = true; if (l_v_l_v_l == 0) res += n ; res += tab + [ ; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2 - x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += , ; } first = false; l_v_l_v_l++; if (e != l) { if (rnk > 1) { res += n ; t_a_b_s = l_v_l_v_l; }; } else { t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += ] ; if (l_v_l_v_l == 0) res += n ; return res; } void dbgm() { ; } template <typename Heads, typename... Tails> void dbgm(Heads H, Tails... T) { cout << to_string(H) << | ; dbgm(T...); } const long long MOD = (int)1e9 + 7; string ascii_lowercase = abcdefghijklmnopqrstuvwxyz ; string ascii_uppercase = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; long long inv(long long a, long long b) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } const long long INF = 1e6; unordered_map<int, int, custom_hash> mp; long long gcd(long long a, long long b, long long &x, long long &y) { if (a == 0) { x = 0; y = 1; return b; } long long x1, y1; long long d = gcd(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } long long distsq(long long x1, long long y1, long long x2, long long y2) { return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); } long long n, m; double get(double x1, double y1, double x2, double y2, double x3, double y3) { if (x3 == x1) { return (x2 - x1) * (x2 - x1); } if (y3 == y1) { return (y2 - y1) * (y2 - y1); } double m = (y3 - y1) / (x3 - x1); double c = y1 - m * x1; double mm = -1 / m; double interx = (-m * c + m * y2 + x2) / (1 + m * m); double dx = interx - x2; double dy = mm * dx; return dx * dx + dy * dy; } double px[1005]; double py[1005]; double ans = -1; int main() { cin >> n; for (int i = 0; i < (n); i++) { cin >> px[i] >> py[i]; } double curr; for (int i = 0; i < (n); i++) { curr = get(px[i], py[i], px[(i + 1) % n], py[(i + 1) % n], px[(i + 2) % n], py[(i + 2) % n]); if (ans < 0) ans = curr; ans = min(ans, curr); } printf( %.12f n , sqrt(ans) / 2.0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 7; long long M = 1e9 + 7; long long dp[N]; long long g[N][30]; int n; vector<int> a; int ch[N][N]; int main() { ch[0][0] = 1; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 0; j <= i; j++) { if (j == 0) { ch[j][i] = 1; continue; } ch[j][i] = (ch[j - 1][i - 1] + ch[j][i - 1]) % M; } } for (int i = 1; i <= n; i++) { char c; cin >> c; if (!a.size()) a.push_back(c - a + 1); else if (a.back() != c - a + 1) a.push_back(c - a + 1); } dp[0] = 1; for (int i = 0; i < a.size(); i++) { for (int j = a.size(); j >= 2; j--) { dp[j] += -g[j][a[i]] - g[j - 1][a[i]] + dp[j - 1]; g[j][a[i]] = dp[j - 1] - g[j - 1][a[i]]; dp[j] %= M; g[j][a[i]] %= M; } if (g[1][a[i]] == 0) dp[1]++; g[1][a[i]] = 1; } long long res = 0; for (int i = 1; i <= n; i++) { dp[i] = (((dp[i] % M) + M) % M); res = (res + ch[i - 1][n - 1] * dp[i]) % M; } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; bool a[2001][2001], w[2001][2001]; int n, fi, fj, si, sj, dist, s, clr = 4; inline bool val(int x, int y) { return (x > 0 && y > 0 && x < n && y < n); } inline void clear(int x, int y) { s = 0; for (int i = 0; i < clr; i++) for (int j = 0; j < clr; j++) if (a[i + x][j + y]) s++; if (s <= clr) for (int i = 0; i < clr; i++) for (int j = 0; j < clr; j++) a[i + x][j + y] = 0; } void dfs(int x, int y) { w[x][y] = 1; s++; if (((x - fi) * (x - fi)) + ((y - fj) * (y - fj)) > dist) dist = ((x - fi) * (x - fi)) + ((y - fj) * (y - fj)); if (val(x - 1, y) && a[x - 1][y] && !w[x - 1][y]) dfs(x - 1, y); if (val(x + 1, y) && a[x + 1][y] && !w[x + 1][y]) dfs(x + 1, y); if (val(x, y - 1) && a[x][y - 1] && !w[x][y - 1]) dfs(x, y - 1); if (val(x, y + 1) && a[x][y + 1] && !w[x][y + 1]) dfs(x, y + 1); } int main() { ios_base::sync_with_stdio(0); int i, j, x, as = 0, ac = 0; cin >> n; for (i = 0; i < n; i++) for (j = 0; j < n; j++) cin >> a[i][j]; for (i = 0; i < n; i += clr) for (j = 0; j < n; j += clr) clear(i, j); for (i = 0; i < n; i++) for (j = 0; j < n; j++) if (!w[i][j] && a[i][j]) { dist = s = 0; fi = i, fj = j; dfs(i, j); if (dist < 200.0) { a[i][j] = 0; continue; } s *= 1.2; double d = sqrt(dist), sq = ((d / sqrt(2.0)) * (d / sqrt(2.0))), circ = ((d / 2.0) * (d / 2.0)) * M_PI; if (abs(s - sq) < abs(s - circ)) as++; else ac++; } cout << ac << << as; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 999999999; const long long INFL = 99999999999999999LL; const double EPSILON = 0.00000001; const long long MOD = 1000000007; long long a[100005]; int32_t main() { long long n, t; scanf( %I64d , &n); ; scanf( %I64d , &t); ; for (long long i = 0; i < n; i++) scanf( %I64d , &a[i]); ; long long ans = 0; long long l = 0, r = 0; long long cur = 0; long long s = 0; while (l < n) { while (r < n and s + a[r] <= t) { s += a[r]; r++; cur++; ans = ((ans) > (cur) ? (ans) : (cur)); } l++; if (l > r) r++; else { s -= a[l - 1]; cur--; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int fr[200004]; struct cmp { bool operator()(int a, int b) const { return a > b; } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; auto make = [](vector<int>& a, int pos) { swap(a[pos + 2], a[pos + 1]); swap(a[pos + 1], a[pos]); }; int t; cin >> t; while (t--) { int n, i, j, k, l; cin >> n; vector<int> v(n); vector<pair<int, int>> p(n); for (i = 0; i < n; i++) { cin >> v[i]; p[i] = {v[i], i}; } sort(p.begin(), p.end()); for (i = 0; i < n; i++) v[p[i].second] = i; int cnt = 0; for (i = 0; i < n - 1; i++) { for (j = i + 1; j < n; j++) if (v[j] < v[i]) cnt++; } if (cnt & 1) { for (i = 0; i < n - 1; i++) if (p[i].first == p[i + 1].first) { swap(v[p[i].second], v[p[i + 1].second]); break; } } vector<int> ans; for (i = 0; i < n - 2; i++) { int pos = min_element(v.begin() + i, v.end()) - v.begin(); while (pos > i + 1) { make(v, pos - 2); ans.push_back(pos - 2); pos = pos - 2; } if (pos != i) { make(v, i); make(v, i); ans.push_back(i); ans.push_back(i); pos = i; } } for (i = 0; i < 3; i++) { if (is_sorted(v.begin(), v.end())) { break; } make(v, n - 3); ans.push_back(n - 3); } if (!is_sorted(v.begin(), v.end())) { cout << -1 << n ; continue; } cout << ans.size() << n ; for (int x : ans) cout << x + 1 << ; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int x, y; cin >> x >> y; if (x == 1) { if (y <= 1) { cout << yes << endl; return; } else { cout << no << endl; return; } } else if (x == 2 || x == 3) { if (y <= 3) { cout << yes << endl; return; } else { cout << no << endl; return; } } else if (x > 3) { cout << yes << endl; return; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int q; cin >> q; while (q--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Bitset { int sz, len; vector<unsigned int> v; Bitset(int szz) { len = szz; sz = szz + 31 >> 5; v.clear(); v.resize(sz, 0); } Bitset operator<<=(int x) { int d = x >> 5, r = x & 31; for (int i = sz - 1; i >= d; i--) v[i] = v[i - d]; for (int i = d - 1; i >= 0; i--) v[i] = 0; if (r) { for (int i = sz - 1; i >= 1; i--) v[i] = ((v[i] & ((1u << 32 - r) - 1)) << r) | (v[i - 1] >> 32 - r); v[0] = (v[0] & ((1u << 32 - r) - 1)) << r; } } Bitset operator|(const Bitset &b) { Bitset rlt = Bitset(len); for (int i = 0; i < sz; i++) rlt.v[i] = v[i] | b.v[i]; return rlt; } Bitset operator^(const Bitset &b) { Bitset rlt = Bitset(len); for (int i = 0; i < sz; i++) rlt.v[i] = v[i] ^ b.v[i]; return rlt; } vector<int> get() { vector<int> rlt; for (int i = 0; i < sz; i++) if (v[i]) { for (int j = 0; j < 32; j++) if (v[i] & (1u << j)) rlt.push_back((i << 5) | j); } return rlt; } bool bit(int x) { return v[x >> 5] & (1u << (x & 31)); } }; int n, s, a[70707], id[70707], in[70707]; bool vis[70707]; set<int> st[70707]; bool cmp(int i, int j) { return a[i] != a[j] ? a[i] < a[j] : !vis[i] && vis[j]; } int main() { Bitset val = Bitset(70707), nwb = Bitset(70707), tmp = Bitset(70707); scanf( %d %d , &n, &s); int I = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] > s) return puts( -1 ), 0; if (a[i] > a[I]) I = i; } vis[I] = 1; s -= a[I]; val.v[0] = 1; for (int i = 1; i <= n && s; i++) if (!vis[i] && a[i] <= s) { tmp = val; tmp <<= a[i]; nwb = val ^ (val | tmp); val = val | tmp; vector<int> v = nwb.get(); for (int j = 0; j < v.size(); j++) { if (v[j] <= s) st[i].insert(v[j]); } } if (!val.bit(s)) return puts( -1 ), 0; for (int i = n; i >= 1; i--) { if (st[i].find(s) != st[i].end()) { s -= a[i]; vis[i] = 1; } } for (int i = 1; i <= n; i++) id[i] = i; sort(id + 1, id + n + 1, cmp); for (int i = 1; i <= n; i++) { if (!vis[id[i]]) { in[id[i + 1]] = id[i]; } } for (int i = 1; i <= n; i++) { printf( %d , a[i] - a[in[i]]); if (in[i]) printf( 1 %d n , in[i]); else puts( 0 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, t, i, j, k; long long a[2000005]; long long ans, sum; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= m * 2; i++) { scanf( %d , &t); a[t]++; } for (i = 1; i <= n; i++) ans += a[i] * (n - 1 - a[i]); printf( %lld n , (long long)n * (n - 1) * (n - 2) / 6 - ans / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int mat[1010][1010]; int main() { int n, a, b; cin >> n >> a >> b; if (a > 1 && b > 1) { puts( NO ); return (0); } if (n > 1 && n <= 3 && a == 1 && b == 1) { puts( NO ); return (0); } puts( YES ); if (a == 1 && b == 1) { for (int i = 1; i < n; i++) { mat[i][i + 1] = 1; mat[i + 1][i] = 1; } } else if (a == 1) { for (int i = 1; i < b; i++) { for (int j = 1; j <= n; j++) { if (i != j) { mat[i][j] = 1; mat[j][i] = 1; } } } } else if (b == 1) { for (int i = a; i < n; i++) { mat[i][i + 1] = 1; mat[i + 1][i] = 1; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) printf( %d , mat[i][j]); printf( n ); } return (0); } |
#include <bits/stdc++.h> using namespace std; int main() { long long T, n, k; cin >> T; while (T--) { cin >> n >> k; long long ans = 0; while (n) { if (n % k != 0) ans += n % k, n -= n % k; else ans++, n /= k; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[100][100]; int row[100]; vector<pair<pair<int, int>, pair<int, int> > > v; int pos[30000][2]; int main() { int n; int sum = 0; while (scanf( %d , &n) == 1) { v.clear(); sum = 0; for (int i = 1; i <= n; i++) scanf( %d , &row[i]); for (int i = 1; i <= n; i++) { for (int j = 1; j <= row[i]; j++) { scanf( %d , &arr[i][j]); pos[arr[i][j]][0] = i; pos[arr[i][j]][1] = j; } sum += row[i]; } int cnt = 1; int swcnt = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= row[i]; j++) { if (arr[i][j] != cnt) { swcnt++; int r = pos[cnt][0]; int c = pos[cnt][1]; int val = arr[i][j]; arr[i][j] = cnt; arr[r][c] = val; pos[val][0] = r; pos[val][1] = c; pos[cnt][0] = i; pos[cnt][1] = j; v.push_back(make_pair(make_pair(i, j), make_pair(r, c))); } cnt++; } } printf( %d n , swcnt); for (int i = 0; i < ((int)v.size()); i++) printf( %d %d %d %d n , v[i].first.first, v[i].first.second, v[i].second.first, v[i].second.second); } } |
#include <bits/stdc++.h> using namespace std; int n, a[3]; int dp[310][310]; string name[2] = { BitAryo , BitLGM }; int mem(int x, int y) { if (dp[x][y] != -1) return dp[x][y]; int mn = 1; for (int i = 1; i <= x; i++) mn = min(mn, mem(x - i, y)); for (int i = 1; i <= y; i++) mn = min(mn, mem(x, y - i)); for (int i = 1; i <= min(x, y); i++) mn = min(mn, mem(x - i, y - i)); return dp[x][y] = 1 - mn; } int main() { memset(dp, -1, sizeof dp); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; if (n == 1) cout << name[(a[0] == 0 ? 0 : 1)] << endl; if (n == 2) cout << name[mem(a[0], a[1])] << endl; if (n == 3) cout << name[((a[0] ^ a[1] ^ a[2]) == 0 ? 0 : 1)] << endl; return 0; } |
#include <bits/stdc++.h> struct Point { double x, y; }; struct Polygon { Point p[100000]; int n; inline double get(int i, double x) { if (i < 0) return p[0].y; if (i >= n - 1) return p[n - 1].y; return p[i].y + (x - p[i].x) * (p[i + 1].y - p[i].y) / (p[i + 1].x - p[i].x); } double area() { double sum = 0; for (int i = 0; i < n - 1; i++) sum += (p[i + 1].x - p[i].x) * (p[i + 1].y + p[i].y) / 2; return sum; } }; Polygon poly[2]; Polygon inp; Polygon ta; Polygon tb; void intersect(Polygon& res, Polygon& a, Polygon& b) { ta.n = tb.n = res.n = 0; int ai = 0, bi = 0; while (ai < a.n || bi < b.n) { if (ai < a.n && (bi >= b.n || a.p[ai].x < b.p[bi].x)) { tb.p[tb.n].x = a.p[ai].x; tb.p[tb.n++].y = b.get(bi - 1, a.p[ai].x); ta.p[ta.n++] = a.p[ai++]; } else { ta.p[ta.n].x = b.p[bi].x; ta.p[ta.n++].y = a.get(ai - 1, b.p[bi].x); tb.p[tb.n++] = b.p[bi++]; } } for (int i = 0, next = 0; i < ta.n; i = next) { while (next < ta.n && ta.p[next].x - ta.p[i].x < 1e-6) next++; res.p[res.n].x = ta.p[i].x; res.p[res.n++].y = (ta.p[i].y > tb.p[i].y ? ta.p[i].y : tb.p[i].y); if (next < ta.n && (ta.p[i].y - tb.p[i].y) * (ta.p[next].y - tb.p[next].y) < -1e-6) { double t = (tb.p[i].y - ta.p[i].y) / (ta.p[next].y - ta.p[i].y - tb.p[next].y + tb.p[i].y); res.p[res.n].x = ta.p[i].x + t * (ta.p[next].x - ta.p[i].x); res.p[res.n++].y = ta.p[i].y + t * (ta.p[next].y - ta.p[i].y); } } } int main() { int n; scanf( %d%d , &n, &inp.n); inp.n++; for (int i = 0; i < inp.n; i++) inp.p[i].x = i; int cur = 0; double prev = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < inp.n; j++) scanf( %lf , &inp.p[j].y); if (i == 0) memcpy(&poly[1 - cur], &inp, sizeof inp); else intersect(poly[1 - cur], poly[cur], inp); cur = 1 - cur; double area = poly[cur].area(); printf( %lf n , area - prev); prev = area; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct edge { int from, to, vis, next; } e[400020]; int top, head[200020]; vector<int> g[200020]; int in[200020], gg[200020]; int n, m, k; int ans[200020], cnt; void add_edge(int from, int to) { e[++top].to = to; e[top].from = from; e[top].next = head[from]; head[from] = top; } void add(int from, int to) { add_edge(from, to); add_edge(to, from); } queue<int> q; void del(int pos) { if (!gg[pos]) cnt--; q.push(pos); gg[pos] = 1; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = head[now]; ~i; i = e[i].next) { if (e[i].vis || gg[e[i].to]) continue; in[e[i].to]--; e[i].vis = 1; e[i ^ 1].vis = 1; if (in[e[i].to] < k) { cnt--; gg[e[i].to] = 1; q.push(e[i].to); } } } } int main() { scanf( %d%d%d , &n, &m, &k); cnt = n; top = -1; memset(head, -1, sizeof(head)); int from, to; for (int i = 1; i <= m; i++) { scanf( %d%d , &from, &to); in[from]++, in[to]++; add(from, to); } for (int i = 1; i <= n; i++) { if (head[i] == -1) cnt--, gg[i] = 1; } for (int i = 1; i <= n; i++) { if (in[i] < k && !gg[i]) del(i); } int ttt = m; for (int i = 2 * m - 1; i >= 1; i -= 2) { ans[ttt--] = cnt; if (e[i].vis) continue; in[e[i].from]--; in[e[i].to]--; e[i].vis = e[i ^ 1].vis = 1; if (!gg[e[i].from] && in[e[i].from] < k) del(e[i].from); if (!gg[e[i].to] && in[e[i].to] < k) del(e[i].to); } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; vector<long long> s; vector<long long>::iterator it; long long n, m, a; long long sum = 0; int main() { cin >> n >> m; for (long long i = 0; i < n; ++i) { cin >> a; s.push_back(a); sum += a; } if (m > sum) cout << -1 << endl; else { sort(s.begin(), s.end(), greater<long long>()); long long l = 1, r = n; while (l <= r) { long long mid = (l + r) / 2, ans = 0, temp = 0; it = s.begin(); while (it != s.end()) { long long cnt = 0; while (cnt < mid && it != s.end()) { ans += max((long long)0, *it - temp); ++it, ++cnt; } ++temp; } if (ans < m) l = mid + 1; else r = mid - 1; } cout << l << endl; } } |
#include <bits/stdc++.h> const double eps = (1e-9); using namespace std; int dcmp(long double a, long double b) { return fabsl(a - b) <= eps ? 0 : (a > b) ? 1 : -1; } int getBit(long long num, int idx) { return ((num >> idx) & 1ll) == 1; } int setBit1(int num, int idx) { return num | (1 << idx); } long long setBit0(long long num, int idx) { return num & ~(1ll << idx); } long long flipBit(long long num, int idx) { return num ^ (1ll << idx); } void M() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int countNumBit1(int mask) { int ret = 0; while (mask) { mask &= (mask - 1); ++ret; } return ret; } const int N = 300009; int arr[N], key[N], n, power[32], ans[N]; string ret; struct trie { trie* child[3]; int isleaf; trie() { isleaf = 0; memset(child, 0, sizeof(child)); } }; string to_bin(int n) { string ret = , ans = ; while (n) { ret += (char)((n % 2) + 0 ); n /= 2; } int rem = 30 - ((int)(ret).size()); while (rem--) { ret += 0 ; } for (int i = ((int)(ret).size()) - 1; i >= 0; i--) { ans += ret[i]; } return ans; } int to_dec(string s) { int ans = 0; for (int i = ((int)(s).size()) - 1; i >= 0; i--) { ans += power[((int)(s).size()) - 1 - i] * (s[i] - 0 ); } return ans; } void insertt(trie* cur, int id, string s) { if (id == ((int)(s).size())) { cur->isleaf++; return; } int ch = s[id] - 0 ; if (cur->child[ch] == 0) { cur->child[ch] = new trie(); } insertt(cur->child[ch], id + 1, s); } bool removee(trie* cur, int id, string s) { if (id == ((int)(s).size())) { cur->isleaf--; return (cur->isleaf == 0 && (cur->child[0] == 0 && cur->child[1] == 0)); } int ch = s[id] - 0 ; bool ret = removee(cur->child[ch], id + 1, s); if (ret) { cur->child[ch] = 0; return (cur->isleaf == 0 && cur->child[0] == 0 && cur->child[1] == 0); } return 0; } void findd(trie* cur, int id, string s) { if (id == ((int)(s).size())) { return; } int ch = s[id] - 0 ; int opch = (s[id] == 0 ? 1 : 0 ) - 0 ; if (cur->child[ch] != 0) { ret += (char)(ch + 0 ); findd(cur->child[ch], id + 1, s); } else if (cur->child[opch] != 0) { ret += (char)(opch + 0 ); findd(cur->child[opch], id + 1, s); } } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } power[0] = 1; for (int i = 1; i <= 30; i++) power[i] = power[i - 1] * 2; trie* root = new trie(); int no; for (int i = 0; i < n; i++) { cin >> no; string st = to_bin(no); insertt(root, 0, st); } for (int i = 0; i < n; i++) { string st = to_bin(arr[i]); ret = ; findd(root, 0, st); removee(root, 0, ret); ans[i] = arr[i] ^ (to_dec(ret)); } for (int i = 0; i < n; i++) { cout << ans[i] << ; } } |
#include <bits/stdc++.h> using namespace std; int log2(int x) { return 31 - __builtin_clz(x); } int main(void) { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); int n, q; cin >> n >> q; vector<long long> a(n); for (int i = 0; i < (int)(n); i++) { cin >> a[i]; } for (int i = 0; i < (int)(n); i++) { int b; cin >> b; a[i] = b - a[i]; if (i) { a[i] += a[i - 1]; } } vector<vector<long long> > mn(20, vector<long long>(n)), mx(20, vector<long long>(n)); copy(a.begin(), a.end(), mn[0].begin()); copy(a.begin(), a.end(), mx[0].begin()); for (int k = 1; k < 20; k++) { for (int i = 0; i + (1 << (k - 1)) < n; i++) { mn[k][i] = min(mn[k - 1][i], mn[k - 1][i + (1 << (k - 1))]); mx[k][i] = max(mx[k - 1][i], mx[k - 1][i + (1 << (k - 1))]); } } int l, r; while (q--) { cin >> l >> r; --l; int k = log2(r - l); long long _min = min(mn[k][l], mn[k][r - (1 << k)]); long long _max = max(mx[k][l], mx[k][r - (1 << k)]); long long start = l ? a[l - 1] : 0; if (start != a[r - 1] || _min < start) { cout << -1 n ; } else { cout << _max - start << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int weight[11]; int total = 0; int bd2 = 0; int mem[11][5001]; int m; bool wasal = false; int arr[1001]; int knapsack(int i, int prev, int totalPrev, int me, int all, int counter) { arr[counter - 1] = prev; if (i == m) { wasal = true; bd2 = all; return 0; } int choice2 = 0; if (!wasal) { for (int j = 0; j < total && !wasal; j++) { if (weight[j] != prev && me + weight[j] > totalPrev && !wasal) { if (totalPrev == -1) { totalPrev = 0; } choice2 += knapsack(i + 1, weight[j], me + weight[j], totalPrev, me + weight[j] + totalPrev, counter + 1) + 1; } } return choice2; } return 0; } int main() { string c; cin >> c; for (int i = 0; i < c.size(); i++) { if (c.at(i) == 1 ) { weight[total] = i + 1; total++; } } memset(arr, false, sizeof(arr)); cin >> m; int num = knapsack(0, 0, -1, 0, 0, 0); if (wasal) { cout << YES << endl; for (int i = 0; i < m; i++) { if (i != 0) { cout << << arr[i]; } else { cout << arr[i]; } } } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T cross(complex<T> a, complex<T> b) { return imag(conj(a) * b); } template <typename T> T dot(complex<T> a, complex<T> b) { return real(conj(a) * b); } struct __Query { static bool query; }; bool __Query::query = false; template <typename T> struct Point { complex<T> p; mutable function<const complex<T> *()> succ; bool operator<(const Point &rhs) const { const complex<T> &q = rhs.p; if (!__Query::query) { if (real(p) != real(q)) return real(p) < real(q); return imag(p) < imag(q); } const complex<T> *s = succ(); if (!s) return false; return dot(p - *s, q) < 0; } }; template <typename T, int turn> struct half_hull : public set<Point<T>> { using set<Point<T>>::begin; using set<Point<T>>::insert; using set<Point<T>>::end; using set<Point<T>>::lower_bound; using set<Point<T>>::empty; using set<Point<T>>::erase; using typename set<Point<T>>::iterator; complex<T> extreme(const complex<T> &p) const { assert(!empty() && turn * imag(p) >= 0); __Query::query = true; auto pos = lower_bound(Point<T>{p}); __Query::query = false; assert(pos != end()); return pos->p; } void insert(const complex<T> &p) { auto y = insert(Point<T>{p}).first; if (y == end()) return; y->succ = [=] { return next(y) == end() ? nullptr : &next(y)->p; }; if (bad(y)) { erase(y); return; } while (y != begin() && bad(prev(y))) erase(prev(y)); while (next(y) != end() && bad(next(y))) erase(next(y)); } private: bool bad(iterator y) { if (y == begin() || y == end()) return false; auto x = prev(y), z = next(y); if (z == end()) return false; return cross(y->p - x->p, z->p - x->p) * turn >= 0; } }; template <typename T> struct convex_hull_trick { void insert(const complex<T> &p) { lower_hull.insert(p); upper_hull.insert(p); } complex<T> extreme(const complex<T> &p) const { if (std::imag(p) < 0) return lower_hull.extreme(p); return upper_hull.extreme(p); } long long get(const complex<T> &p) const { if (upper_hull.empty()) return 0LL; return dot(p, extreme(p)); } private: half_hull<T, +1> upper_hull; half_hull<T, -1> lower_hull; }; long long solve(vector<vector<int>> &adj, int root = 0) { int n = adj.size(); vector<long long> sz(n), sz2(n), ssz(n); long long ans = 0; function<void(int, int)> dfs = [&](int u, int p) { sz[u] = 1; for (auto v : adj[u]) if (v != p) { dfs(v, u); sz[u] += sz[v]; } }; function<void(int, int)> dfs2 = [&](int u, int p) { sz2[u] += sz[u] * sz[u]; for (auto v : adj[u]) if (v != p) { sz2[v] += sz2[u]; ssz[v] += ssz[u] + sz[v] * sz[u]; dfs2(v, u); } }; function<long long(int, int)> dfs3 = [&](int u, int p) { convex_hull_trick<long long> cht; long long ret = -sz2[u] + ssz[u]; for (auto v : adj[u]) if (v != p) { long long temp = dfs3(v, u); ret = max(ret, temp); long long r = sz[v] * n + sz2[u] - ssz[v] + temp; ans = max(ans, r); ans = max(ans, r + cht.get({1LL, -sz[v]})); cht.insert({r, sz[v]}); } return ret; }; dfs(root, -1); dfs2(root, -1); dfs3(root, -1); return ans; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; vector<vector<int>> adj(n); for (int i = 1, u, v; i < n; ++i) { cin >> u >> v; --u, --v; adj[u].push_back(v); adj[v].push_back(u); } long long ans = n * (n - 1LL) / 2 + solve(adj); cout << ans << n ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.