func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; struct EDGE { int v, next; }; EDGE w[222]; long long f[1 << 17], Y; int ans[22], ww[22], visit[22], N, M, W = 0; long long work() { memset(f, 0, sizeof(f)); f[0] = 1; for (int i = 0; i < 1 << N; ++i) if (f[i]) { if (i == 3) int asd = 1; int u = 0; for (int ii = i; ii; ii >>= 1) u += (ii & 1); u++; int sta = 1, end = N; if (visit[u]) sta = end = visit[u]; for (int j = sta; j <= end; ++j) if (!(i & (1 << j - 1))) { bool flag = 1; for (int k = ww[j]; k && flag; k = w[k].next) if (i & (1 << w[k].v - 1)) flag = 0; if (!flag) continue; f[i | (1 << j - 1)] += f[i]; } } return f[(1 << N) - 1]; } int main() { scanf( %d%I64d%d , &N, &Y, &M); Y -= 2000; for (int i = 1, u, v; i <= M; ++i) { scanf( %d%d , &u, &v); w[++W].v = v; w[W].next = ww[u]; ww[u] = W; } if (work() < Y) { puts( The times have changed ); exit(0); } for (int i = 1; i <= N; ++i) { for (int j = 1; j <= N; ++j) if (!visit[j]) { visit[j] = i; long long now = work(); if (now >= Y) { ans[i] = j; break; } Y -= now; visit[j] = 0; } } for (int i = 1; i <= N; ++i) printf( %d%c , ans[i], (i == N ? n : )); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; bool flag; while (t--) { int n; cin >> n; long long int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; flag = true; sort(a, a + n); long long int k = a[0] * a[n - 1], tmp; for (int i = 0; i < n; i++) { tmp = a[i] * a[n - 1 - i]; if (tmp != k) flag = false; } int ptr = 0; if (flag) { for (int i = 2; i <= sqrt(k); i++) { if (k % i == 0) { if (a[ptr] == i) ptr++; else { flag = false; break; } } } } if (flag) cout << k << endl; else cout << -1 << endl; } } |
#include <bits/stdc++.h> using namespace std; template <class T> using VV = vector<vector<T>>; template <class T> inline T SMIN(T& a, const T b) { return a = (a > b) ? b : a; } template <class T> inline T SMAX(T& a, const T b) { return a = (a < b) ? b : a; } template <class Iter> void dumpc(Iter begin, Iter end) { if (false) { for (; begin != end; ++begin) { cerr << *begin << , ; } cerr << endl; } } int Q; map<int, int> comp; int getid(int a) { if (comp.count(a)) return comp[a]; comp[a] = int((comp).size()); return comp[a]; } struct UF { public: int groupNum; vector<int> X; UF(int N) { uf = vector<int>(N); rank = vector<int>(N); X = vector<int>(N); for (int i = 0; i < N; ++i) uf[i] = i, rank[i] = 0; groupNum = N; } pair<int, int> find(int v) { int cur = 0; while (uf[v] != v) { cur ^= X[v]; v = uf[v]; } return {v, cur}; } bool same(int x, int y) { return find(x) == find(y); } void unite(int x, int y, int z) { auto px = find(x); auto py = find(y); if (px.first == py.first) return; groupNum--; x = px.first, y = py.first; z = px.second ^ py.second ^ z; if (rank[x] == rank[y]) { uf[x] = y; X[x] = z; rank[y]++; return; } if (rank[x] < rank[y]) { uf[x] = y; X[x] = z; } else { uf[y] = x; X[y] = z; if (rank[x] == rank[y]) ++rank[x]; } } private: vector<int> rank; vector<int> uf; }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> Q; UF uf(2 * Q + 10); int last = 0; while (Q--) { int t, l, r; cin >> t >> l >> r; l ^= last, r ^= last; if (l > r) swap(l, r); ++r; if (false) { cerr << l << = << (l) << , << r << = << (r) << , << getid(l) << = << (getid(l)) << , << getid(r) << = << (getid(r)) << endl; }; l = getid(l), r = getid(r); if (t == 1) { int x; cin >> x; x ^= last; uf.unite(l, r, x); } else { pair<int, int> p1 = uf.find(l), p2 = uf.find(r); if (false) { cerr << p1.first << = << (p1.first) << , << p2.first << = << (p2.first) << endl; }; if (p1.first != p2.first) { last = 1; fprintf(stdout, %d , -1), putchar( n ); ; } else { if (false) { cerr << Q << = << (Q) << , << p1.second << = << (p1.second) << , << p2.second << = << (p2.second) << endl; }; last = p1.second ^ p2.second; fprintf(stdout, %d , last), putchar( n ); ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; inline void add(long long &a, long long b) { a += b; a %= MOD; } inline void sub(long long &a, long long b) { a -= b; a %= MOD; } inline long long mul(long long a, long long b) { return (long long)a * b % MOD; } const int N = 1e6 + 10; struct pnt { long long x, y; pnt(long long _x = 0, long long _y = 0) : x(_x), y(_y) {} inline pnt operator+(const pnt &p) const { return pnt(x + p.x, y + p.y); } inline pnt operator-(const pnt &p) const { return pnt(x - p.x, y - p.y); } inline pnt &operator+=(const pnt &p) { add(x, p.x), add(y, p.y); return *this; } inline pnt &operator-=(const pnt &p) { sub(x, p.x), sub(y, p.y); return *this; } inline pnt operator*(const int &k) const { return pnt(x * k, y * k); } inline pnt operator/(const int &k) const { return pnt(x / k, y / k); } inline long long operator*(const pnt &p) const { return x * p.y - y * p.x; } inline long long operator^(const pnt &p) const { return x * p.x + y * p.y; } void out() { printf( (%lld,%lld) , x, y); } } p[3 * N]; long long get(int i, int j, int k) { return (p[j] - p[i]) * (p[k] - p[j]); }; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; for (int i = 0; i < (int)(n); i++) cin >> p[i].x >> p[i].y; long long s = 0; for (int i = 0; i < (int)(n); i++) s += p[i] * p[(i + 1) % n]; if (s < 0) { s = -s; reverse(p, p + n); } for (int i = 0; i < (int)(n); i++) p[i + 2 * n] = p[i + n] = p[i]; struct Calc { long long sum, s; pnt diff, diff2; Calc() : sum(0), s(0) {} void inc_r(int l, int r) { s += get(l, r, r + 1); assert(s >= 0); add(sum, s); diff2 += p[r + 1] - p[r]; diff -= diff2; } void inc_l(int l, int r) { s -= get(l, l + 1, r); pnt dp = p[l + 1] - p[l]; diff2 -= dp; diff += dp * (r - l); add(sum, dp * diff); } } c1, c2; long long res = 0; int r1 = 0, r2 = 0; for (int l = 0; l < (int)(n); l++) { while (r1 - l < n && abs(c1.s + get(l, r1, r1 + 1)) <= s / 2) { c1.inc_r(l, r1++); } assert(r1 - l <= n - 2); while (r2 - l < n - 2) c2.inc_r(l, r2++); long long mid = (2 * c1.s == s ? s / 2 : 0LL); long long big = c2.sum - c1.sum; long long small = (c1.sum - mid); add(res, big - small); c1.inc_l(l, r1); c2.inc_l(l, r2); } cout << ((res) % MOD + MOD) % MOD << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, l[1000005], dp[1000005][2][2]; char s[1000005]; void Calc(int k) { if (s[k] == 0 ) dp[k][0][0] = 1; else if (s[k] == 1 ) dp[k][1][1] = 1; else { dp[k][1][0] = 1; dp[k][0][1] = 1; } } void Change(int x, int L, int R, int O) { int tmp[2][2] = {0}; for (int a = 0; a < 2; a++) for (int b = 0; b < 2; b++) if (dp[L][a][b]) for (int c = 0; c < 2; c++) for (int d = 0; d < 2; d++) if (dp[R][c][d]) if (s[O] == & ) tmp[a & c][b & d] = 1; else if (s[O] == | ) tmp[a | c][b | d] = 1; else tmp[a ^ c][b ^ d] = 1; for (int a = 0; a < 2; a++) for (int b = 0; b < 2; b++) dp[x][a][b] = tmp[a][b]; } int Dfs(int l) { int r = l + 1, L = -1, O = -1; while (s[r] != ) ) { if ((s[r] == ? || s[r] == 0 || s[r] == 1 ) && L == -1) Calc(r), L = r, O = r + 1; if (s[r] == ( ) r = Dfs(r); r++; if (r - l >= 3 && s[r] != ( ) { if (s[r] == ? || s[r] == 1 || s[r] == 0 ) { Calc(r); if (L != -1) Change(r, L, r, O); L = r; O = r + 1; r++; } else { if (L != -1) Change(r - 1, L, r - 1, O); L = r - 1; O = r; } O = r; } } for (int a = 0; a < 2; a++) for (int b = 0; b < 2; b++) dp[r][a][b] = dp[r - 1][a][b]; return r; } int main() { scanf( %d , &n); scanf( %s , &s); int n = strlen(s) - 1, flag = 0; for (int i = 0; i <= n; i++) if (s[i] == ? ) flag = 1; if (n == 0) { if (s[0] == 0 || s[0] == 1 ) puts( NO ); else puts( YES ); return 0; } Dfs(0); if (((dp[n][0][1] || dp[n][1][0]) && flag) || n == 0) puts( YES ); else puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 10, mod = 1e9 + 7; int rd() { int x = 0, w = 1; char ch = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + (ch ^ 48); ch = getchar(); } return x * w; } int prm[N], pm[N], tt, n, a[N], c[N][2]; bool v[N]; int main() { for (int i = 2; i <= N - 5; ++i) { if (!pm[i]) pm[i] = prm[++tt] = i; for (int j = 1; i * prm[j] <= N - 5; ++j) { pm[i * prm[j]] = prm[j]; if (i % prm[j] == 0) break; } } n = rd(); for (int i = 1; i <= n; ++i) a[i] = rd(); sort(a + 1, a + n + 1), reverse(a + 1, a + n + 1); for (int i = 1; i <= n; ++i) { if (!c[a[i]][0]) v[i] = 1, c[a[i]][0] = c[a[i]][1] = 1; else { int x = a[i] - 1; while (x > 1) { int np = pm[x], cn = 0; while (pm[x] == np) ++cn, x /= np; if (c[np][0] < cn) c[np][0] = cn, c[np][1] = 1; else c[np][1] += c[np][0] == cn; } } } int ans = 1; for (int i = 2; i <= N - 5; ++i) for (int j = 1; j <= c[i][0]; ++j) ans = 1ll * ans * i % mod; for (int i = 1; i <= n; ++i) if (!v[i]) { int x = a[i] - 1, o = 1; while (x > 1) { int np = pm[x], cn = 0; while (pm[x] == np) ++cn, x /= np; o &= cn < c[np][0] || c[np][1] > 1; } if (o) { ans = (ans + o) % mod; break; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<int> edges[(200 * 1000 + 5)]; vector<int> f; vector<int> a; int dp[(200 * 1000 + 5)][5]; void read_data() { cin >> n; int u, v; for (int i = 1; i < n; i++) { scanf( %d %d , &u, &v); edges[u].push_back(v); edges[v].push_back(u); } } void bfs() { int qf, ql; a.resize(n); f.resize(n + 1); vector<int> isv; isv.resize(n + 1); qf = ql = 0; a[ql++] = 1; isv[1] = true; while (qf != ql) { int u = a[qf++]; for (auto &v : edges[u]) if (!isv[v]) { f[v] = u; isv[v] = true; a[ql++] = v; } } } void deal() { int sum[5]; for (int i = n - 1; i > 0; i--) { int u = a[i]; if (edges[u].size() == 1 && u != 1) { memset(dp[u], 0, sizeof(dp[u])); dp[u][0] = 1; dp[u][1] = 0; dp[u][2] = 1; } else { memset(sum, 0, sizeof(sum)); for (auto &v : edges[u]) if (v != f[u]) { sum[2] += dp[v][2]; sum[1] += dp[v][1]; } memset(dp[u], 0xff, sizeof(dp[u])); dp[u][1] = sum[2]; dp[u][0] = sum[1] + 1; for (auto &v : edges[u]) if (v != f[u]) { if (dp[u][2] == -1) { dp[u][2] = sum[2] - dp[v][2] + dp[v][0]; } else { dp[u][2] = min(dp[u][2], sum[2] - dp[v][2] + dp[v][0]); } } dp[u][2] = min(dp[u][2], dp[u][0]); dp[u][1] = min(dp[u][1], dp[u][2]); } } int ans = 0; for (auto &v : edges[1]) ans += dp[v][0]; ans -= edges[1].size(); cout << ans << endl; } int main() { read_data(); bfs(); deal(); return 0; } |
#include <bits/stdc++.h> using namespace std; void _print(int32_t t) { cerr << t; } void _print(int64_t t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(long double t) { cerr << t; } void _print(double t) { cerr << t; } void _print(unsigned long long t) { cerr << t; } template <class T, class V> void _print(pair<T, V> p); template <class T> void _print(vector<T> v); template <class T> void _print(set<T> v); template <class T, class V> void _print(map<T, V> v); template <class T> void _print(multiset<T> v); template <class T, class V> void _print(pair<T, V> p) { cerr << { ; _print(p.first); cerr << , ; _print(p.second); cerr << } ; } template <class T> void _print(vector<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(set<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(multiset<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T, class V> void _print(map<T, V> v) { cerr << [ ; for (auto i : v) { _print(i); cerr << ; } cerr << ] ; } int64_t find(int64_t mid) { int64_t ans = 0; while (mid != 0) { mid /= 2; ans++; } return ans; } void solve() { int64_t n, k; cin >> n >> k; int64_t low = 1, high = 1; for (int64_t i = 0; i < n - 1; i += 1) { high *= 2; high++; } while (low <= high) { int64_t mid = (low + high) / 2; if (mid == k) { cout << find(high - low + 1); return; } if (mid > k) { high = mid - 1; } if (mid < k) low = mid + 1; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int64_t t = 1; while (t--) { solve(); cout << n ; } } |
#include <bits/stdc++.h> using namespace std; vector<int> s[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, i, j, a, b; cin >> n >> m; if (n == 1 && m == 1) { cout << YES n << 1; } else if (n == 1 && m == 2) { cout << NO ; } else if (n == 2 && m == 1) { cout << NO ; } else if (n == 1 && m == 3) { cout << NO ; } else if (n == 3 && m == 1) { cout << NO ; } else if (n == 1 && m == 4) { cout << YES n ; cout << 2 4 1 3 ; } else if (n == 4 && m == 1) { cout << YES n ; cout << 2 n4 n1 n3 ; } else if (n == 2 && m == 2) { cout << NO ; } else if ((n == 2 && m == 3) || (n == 3 && m == 2)) { cout << NO ; } else if (n == 3 && m == 3) { cout << YES n ; cout << 6 1 8 n7 5 3 n2 9 4 ; } else if (n == 1 && m >= 5) { vector<int> res; for (i = 1; i <= m; i += 2) { res.push_back(i); } for (i = 2; i <= m; i += 2) { res.push_back(i); } cout << YES n ; for (i = 0; i < m; i++) { cout << res[i] << ; } } else if (n >= 5 && m == 1) { vector<int> res; for (i = 1; i <= n; i += 2) { res.push_back(i); } for (i = 2; i <= n; i += 2) { res.push_back(i); } cout << YES n ; for (i = 0; i < n; i++) { cout << res[i] << n ; } } else if (2 <= n && 4 <= m) { a = 1; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { s[i].push_back(a); a++; } } for (i = 2; i <= n; i += 2) { a = s[i][0]; b = s[i][1]; for (j = 0; j < m - 2; j++) { s[i][j] = s[i][j + 2]; } s[i][m - 2] = a; s[i][m - 1] = b; } for (i = 1; i < m; i += 2) { a = s[1][i]; for (j = 1; j <= n - 1; j++) { s[j][i] = s[j + 1][i]; } s[n][i] = a; } cout << YES n ; for (i = 1; i <= n; i++) { for (j = 0; j < m; j++) { cout << s[i][j] << ; } cout << n ; } } else { a = 1; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { s[i].push_back(a); a++; } } for (i = 1; i < m; i += 2) { a = s[1][i]; b = s[2][i]; for (j = 1; j <= n - 2; j++) { s[j][i] = s[j + 2][i]; } s[n - 1][i] = a; s[n][i] = b; } for (i = 2; i <= n; i += 2) { a = s[i][0]; for (j = 0; j < m - 1; j++) { s[i][j] = s[i][j + 1]; } s[i][m - 1] = a; } cout << YES n ; for (i = 1; i <= n; i++) { for (j = 0; j < m; j++) { cout << s[i][j] << ; } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void printVector(vector<string> &v) { for (auto x : v) cout << x << n ; } void printVector(vector<int> &v) { for (auto x : v) cout << x << ; cout << n ; } int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); int t; t = 1; while (t--) { int n, k, x; cin >> n >> k >> x; vector<int> freq(1024, 0); vector<int> upd(1024, 0); vector<int> calc(1024); for (int i = 0; i < 1024; i++) { calc[i] = i xor x; } for (int i = 0; i < n; i++) { int a; cin >> a; freq[a]++; } for (int i = 0; i < k; i++) { int sum = 0; for (int j = 0; j < 1024; j++) { int s = freq[j]; if (sum % 2 == 0) s++; s /= 2; upd[calc[j]] += s; sum += freq[j]; freq[j] -= s; } for (int j = 0; j < 1024; j++) { freq[j] += upd[j]; upd[j] = 0; } } int mn, mx; for (int j = 0; j < 1024; j++) { if (freq[j] > 0) { mn = j; break; } } for (int j = 1023; j >= 0; j--) { if (freq[j] > 0) { mx = j; break; } } cout << mx << << mn << n ; } } |
#include <bits/stdc++.h> using namespace std; struct node { int len, l, r; bool operator<(const node &a) const { return len > a.len; } }; int day[200010]; int m[200010]; int main() { int n, k, c, i, j; scanf( %d %d , &n, &k); c = 0; for (i = 0; i < n; i++) { scanf( %d , &day[i]); if (day[i] < 0) c++; } if (c > k) { printf( -1 n ); return 0; } int turn = 0; bool f = 0; priority_queue<node> q; for (i = 0; i < n; i++) { if (day[i] < 0) { m[i] = 1; k--; } if (!f && day[i] < 0) { turn++; f = 1; } if (f && day[i] >= 0) { turn++; f = 0; } } int l = 0, r = 0; i = 0; while (m[i] == 0 && i < n) i++; for (; i < n; i++) { if (m[i] == 0) { l = i; while (m[i] == 0 && i < n) i++; r = i - 1; node tp; tp.l = l, tp.r = r; tp.len = r - l + 1; q.push(tp); i = i - 1; } } int tt = turn, kk = k; while (!q.empty()) { node x = q.top(); q.pop(); if (k < x.len && kk < x.len) break; else { if (k >= x.len) { k -= x.len; if (x.r != n - 1) { turn -= 2; } else turn--; } if (kk >= x.len) { if (x.r != n - 1) { kk -= x.len; tt -= 2; } } } } printf( %d n , min(turn, tt)); } |
#include <bits/stdc++.h> using namespace std; inline void OPEN(const string &s) { freopen((s + .in ).c_str(), r , stdin); freopen((s + .out ).c_str(), w , stdout); } int main() { int n; scanf( %d , &n); int art; scanf( %d , &art); int alex; scanf( %d , &alex); int ans[110] = {0}; for (int i = 0; i < art; i++) { int temp; scanf( %d , &temp); if (ans[temp] == 0) ans[temp] = 1; } for (int i = 0; i < alex; i++) { int temp; scanf( %d , &temp); if (ans[temp] == 0) ans[temp] = 2; } for (int i = 1; i < n + 1; i++) { if (ans[i] == 0) printf( 1 ); else printf( %d , ans[i]); } } |
#include <bits/stdc++.h> using namespace std; int M[2002][2002]; struct TA { int a[2002], n; void init(int _n) { n = _n; memset(a, 0, sizeof a); } int get(int p) { int ret = 0; for (p++; p > 0; p -= p & -p) ret ^= a[p - 1]; return ret; } void change(int l) { for (l++; l <= n; l += l & -l) a[l - 1] ^= 1; } void change(int l, int r) { change(l); change(r + 1); } } R[2002], C[2002]; void put(int r, int c) { R[r].change(min(r, c), max(r, c)); C[c].change(min(r, c), max(r, c)); M[r][c] ^= 1; } int get(int r, int c) { return R[r].get(c) ^ C[c].get(r) ^ M[r][c]; } int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { scanf( ); for (int j = 0; j < n; ++j) { M[i][j] = getchar() == 1 ; } R[i].init(n); C[i].init(n); } int ans = 0; for (int i = 0; i < n; ++i) { for (int r = n - 1; r > i; --r) { if (get(r, i)) { ++ans; put(r, i); } } for (int c = n - 1; c > i; --c) { if (get(i, c)) { ++ans; put(i, c); } } if (get(i, i)) { ++ans; put(i, i); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; class MinHeap { vector<long long int> arr; long long int size; public: MinHeap() { size = 0; } long long int parent(long long int i) { return (i - 1) / 2; } long long int lchild(long long int i) { return 2 * i + 1; } long long int rchild(long long int i) { return 2 * i + 2; } long long int minimum() { return arr[0]; } long long int length() { return size; } void insert(long long int i) { size++; arr.push_back(i); long long int index = size - 1; while (i != 0 && arr[parent(index)] > arr[index]) { swap(arr[parent(index)], arr[index]); index = parent(index); } } void minheapify_down(long long int i) { while (i < size) { long long int l = lchild(i); long long int r = rchild(i); long long int small = i; if (l < size) small = arr[small] < arr[l] ? small : l; if (r < size) small = arr[small] < arr[r] ? small : r; swap(arr[i], arr[small]); if (i == small) break; i = small; } } void minheapify_up(long long int i) { long long int index = i; while (i != 0 && arr[parent(index)] > arr[index]) { swap(arr[parent(index)], arr[index]); index = parent(index); } } void extractmin() { long long int min = arr[0]; swap(arr[0], arr[size - 1]); arr.pop_back(); size--; minheapify_down(0); } void changekey(long long int i, long long int value) { if (value > arr[i]) { arr[i] = value; minheapify_down(i); } else { arr[i] = value; minheapify_up(i); } } void deletekey(long long int i) { changekey(i, LLONG_MIN); extractmin(); } }; int main() { ; ios::sync_with_stdio(0); cin.tie(0); ; long long int n, k, t, b, ans = 0, count = 0, sum = 0; cin >> n >> k; vector<vector<long long int>> beauti(1000001); for (long long int i = 0; i < n; i++) { cin >> t >> b; beauti[b].push_back(t); } MinHeap length; for (long long int i = 1000000; i >= 1; i--) { if (beauti[i].size() != 0) { for (long long int j = 0; j < beauti[i].size(); j++) { sum += beauti[i][j]; length.insert(beauti[i][j]); count++; if (count > k) { long long int ele = length.minimum(); sum -= ele; length.deletekey(0); count--; } } ans = max(ans, i * sum); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> invi(long long n) { int x; vector<long long> a; for (long long i = 0; i < n; i++) { cin >> x; a.push_back(x); } return a; } void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) solve(); } void solve() { long long n, k; cin >> n >> k; vector<long long> jobcho = invi(n); vector<long long> time = invi(n); vector<long long> ind; vector<long long> task; for (long long i = 0; i < k; i++) { task.push_back(0); ind.push_back(n + 1); } for (long long i = 0; i < n; i++) { if (task[jobcho[i] - 1] < time[i]) { task[jobcho[i] - 1] = time[i]; ind[jobcho[i] - 1] = i; } } for (long long i = 0; i < k; i++) { if (ind[i] < (n + 1)) time[ind[i]] = 1e10; } long long jbleft = 0; for (long long i = 0; i < k; i++) { if (task[i] == 0) { jbleft++; } } sort(time.begin(), time.end()); long long sum = 0; for (long long i = 0; i < jbleft; i++) { sum += time[i]; } cout << sum << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { char prev[26], next[26]; for (int i = 0; i < 26; i++) prev[i] = next[i] = -1; int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; if (prev[s[0] - a ] == -1) prev[s[0] - a ] = 0; if (next[s[(int)s.size() - 1] - a ] == -1) next[s[(int)s.size() - 1] - a ] = 0; for (int j = 1; j < (int)s.size(); j++) { prev[s[j] - a ] = s[j - 1]; next[s[j - 1] - a ] = s[j]; } } for (int i = 0; i < 26; i++) { if (prev[i] == 0) { char cur = a + i; while (cur) { printf( %c , cur); cur = next[cur - a ]; } } } return 0; } |
#include <bits/stdc++.h> int n, a[100000], sum = 0; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } if (sum % n != 0) printf( %d n , n - 1); else printf( %d n , n); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INFint = 2147483547; const long long INF = 9223372036854775807ll; const long long MOD = 1000000007ll; const long double EPS = 1e-13; string min_cyclic_shift(string s) { s += s; int n = (int)s.length(); int i = 0, ans = 0; while (i < n / 2) { ans = i; int j = i + 1, k = i; while (j < n && s[k] <= s[j]) { if (s[k] < s[j]) k = i; else ++k; ++j; } while (i <= k) i += j - k; } return s.substr(ans, n / 2); } int main() { ios_base::sync_with_stdio(0); vector<string> a(2), b(2); for (int i = 0; i < 2; i++) cin >> a[i]; for (int i = 0; i < 2; i++) cin >> b[i]; string s; for (int i = 0; i < 2; i++) { if (a[0][i] == X ) continue; s += a[0][i]; } for (int i = 1; i > -1; i--) { if (a[1][i] == X ) continue; s += a[1][i]; } string s1; for (int i = 0; i < 2; i++) { if (b[0][i] == X ) continue; s1 += b[0][i]; } for (int i = 1; i > -1; i--) { if (b[1][i] == X ) continue; s1 += b[1][i]; } if (min_cyclic_shift(s) == min_cyclic_shift(s1)) { cout << YES ; } else cout << NO ; fprintf(stderr, nTIME = %lf n , 1.0 * clock() / CLOCKS_PER_SEC); ; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); bool isPrime(int n) { if (n == 1) return false; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) return false; } return true; } void solve() { int n, sum = 0; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; sum += a[i]; } if (!isPrime(sum)) { cout << n << n ; for (int i = 1; i <= n; ++i) { cout << i << ; } cout << n ; } else { cout << n - 1 << n ; int oddpos = -1; for (int i = 0; i < n; ++i) { if (a[i] % 2 != 0) { oddpos = i; break; } } for (int i = 0; i < n; ++i) { if (i != oddpos) cout << i + 1 << ; } cout << n ; } } int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; int a[100000 + 3], b[100000 + 3]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); int cnt = 1; for (int i = 0; i < n; i++) { if (a[i] != b[i]) { cnt++; } } if (cnt == 3 || cnt == 1) { cout << YES ; return 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, m, p; long long ans = -1e18; struct nd { int val, c; friend bool operator<(nd a, nd b) { return a.val < b.val; } } a[N], b[N]; struct mon { int x, y, z; friend bool operator<(mon a, mon b) { return a.x < b.x; } } c[N]; struct BIT { int tot; int ls[N << 1], rs[N << 1]; long long mx[N << 1], tag[N << 1]; void up(int x) { mx[x] = max(mx[ls[x]], mx[rs[x]]); } void down(int x) { if (!tag[x]) return; if (ls[x]) { mx[ls[x]] += tag[x]; tag[ls[x]] += tag[x]; } if (rs[x]) { mx[rs[x]] += tag[x]; tag[rs[x]] += tag[x]; } tag[x] = 0; } int build(int l, int r) { int x = ++tot; if (l == r) { mx[x] = -b[l].c; return x; } int mid = l + r >> 1; ls[x] = build(l, mid); rs[x] = build(mid + 1, r); up(x); return x; } void add(int x, int l, int r, int L, int R, long long d) { if (L <= l && r <= R) { mx[x] += d; tag[x] += d; return; } down(x); int mid = l + r >> 1; if (L <= mid) add(ls[x], l, mid, L, R, d); if (R > mid) add(rs[x], mid + 1, r, L, R, d); up(x); } void init() { mx[0] = -1e18; int root = build(1, m); } } T; int main() { scanf( %d%d%d , &n, &m, &p); for (int i = 1; i <= n; ++i) scanf( %d%d , &a[i].val, &a[i].c); for (int i = 1; i <= m; ++i) scanf( %d%d , &b[i].val, &b[i].c); for (int i = 1; i <= p; ++i) scanf( %d%d%d , &c[i].x, &c[i].y, &c[i].z); sort(a + 1, a + n + 1); sort(b + 1, b + m + 1); sort(c + 1, c + p + 1); T.init(); for (int i = 1, R = 0; i <= n; ++i) { while (R < p && c[R + 1].x < a[i].val) { ++R; int l = 1, r = m; while (l != r) { int mid = l + r >> 1; if (b[mid].val > c[R].y) r = mid; else l = mid + 1; } if (b[l].val > c[R].y) { T.add(1, 1, m, l, m, c[R].z); } } ans = max(ans, -a[i].c + T.mx[1]); } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, s; while (cin >> n >> k >> s) { long long temp = (s / k); long long rem = s % k; temp++; if (((n - 1) * k < s || (k > s))) { cout << NO << endl; return 0; } cout << YES << endl; long long ans = 1; int flag = 0; for (int i = 1; i <= k; i++) { if (flag == 0 && rem == 0) { flag = 1; temp--; } else rem--; if (ans + temp <= n) { ans += temp; cout << ans << ; } else { ans -= temp; cout << ans << ; } } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int t; long long a, b, c, d; long long solve(long long x) { long long times = x / d + 1; long long sum = (x / d + 1) * a; long long finished; if (x < c) { finished = 0; } else { finished = (x - c) / d + 1; } long long left = times - finished; long long a1 = x - (x / d) * d; sum -= left * a1 * b + left * (left - 1) / 2 * d * b; sum -= finished * b * c; return sum; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> t; while (t--) { cin >> a >> b >> c >> d; if (d >= c) { if (a > b * c) { cout << -1 << endl; } else { cout << a << endl; } } else { if (a > b * c) { cout << -1 << endl; } else { long long l = 0, r = 1e6 / d; while (l < r - 5) { long long ml = (l + r) / 2; long long mr = (ml + r) / 2; if (solve(ml * d) <= solve(mr * d)) { l = ml; } else { r = mr; } } long long mx = 0; for (long long i = l; i <= r; i++) { mx = max(mx, solve(i * d)); } cout << mx << endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1024000000,1024000000 ) const double pi = 2.0 * asin(1.0), eps = 1e-12; const int maxn = 2100, maxm = 1100000, inf = 0x3f3f3f3f; char ch[maxn][maxn]; int ans[maxn]; int main() { int n, m, i, j, l, x; while (scanf( %d%d%d , &n, &m, &l) == 3) { memset(ans, 0, sizeof(ans)); for (i = 0; i < n; i++) { scanf( %s , ch[i]); for (j = 0; j < m; j++) { if (ch[i][j] == U ) { if (i % 2 == 0) ans[j]++; } else if (ch[i][j] == L ) { x = j - i; if (x >= 0) ans[x]++; } else if (ch[i][j] == R ) { x = j + i; if (x < m) ans[x]++; } } } for (i = 0; i < m; i++) { if (i != 0) printf( ); printf( %d , ans[i]); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; vector<int> cur; void split(int x, int p) { if (p == 1) { cout << x << ; return; } cout << x - 1 << ; split(x - 1, p - 1); } int main() { ios::sync_with_stdio(false); cin.tie(0); ; long long n, k; cin >> n >> k; string s = ; while (n > 0) { s += (char)((n % 2) + 0 ); n /= 2; } for (int i = ((int)s.size() - 62); i < (int)s.size(); i++) { long long cnt = 0; for (int j = 0; j <= i; j++) { cnt += (s[j] == 1 ); } bool ok = true; for (long long j = max(i + 1, 0); j < s.size(); j++) { cnt += (1ll << (j - i)) * (s[j] == 1 ); if (cnt > k) { ok = false; break; } } if (cnt > k) { ok = false; continue; } if (!ok) continue; cout << Yes << endl; cur.clear(); for (int j = 0; j <= i; j++) { if (s[j] == 1 ) cur.push_back(j); } for (int j = max(i + 1, 0); j < s.size(); j++) { if (s[j] == 0 ) continue; for (long long t = 0; t < (1ll << (j - i)); t++) { cur.push_back(i); } } for (int j = cur.size() - 1; j > 0; j--) { cout << cur[j] << ; } split(cur[0], k - cnt + 1); cout << endl; return 0; } cout << No << endl; } |
#include <bits/stdc++.h> using std::cin; using std::cout; using std::endl; using std::sort; using std::string; using std::swap; int main() { int times = INT_MAX; int a[6]; while (times-- && ~scanf( %d , &a[0])) { for (int i = 1; i < 6; ++i) scanf( %d , a + i); printf( %d n , (a[0] + a[1] + a[2]) * (a[0] + a[1] + a[2]) - a[0] * a[0] - a[2] * a[2] - a[4] * a[4]); }; return 0; }; |
#include <bits/stdc++.h> const double inf = 1e20; using namespace std; int n, m, i, j, f; char a[55][55]; int vis[55][55]; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; void dfs(int x, int y, int oldx, int oldy) { if (x == i && y == j && vis[i][j]) { f = 1; return; } for (int d = 0; d < 4 && !f; d++) { int xx = x + dx[d], yy = y + dy[d]; if (a[xx][yy] == a[i][j] && xx >= 0 && yy >= 0 && xx < n && yy < m && !vis[xx][yy] && (oldx != xx || oldy != yy)) vis[xx][yy] = 1, dfs(xx, yy, x, y); } } int main() { cin >> n >> m; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) for (j = 0; j < m && !f; j++) { memset(vis, 0, sizeof(vis)); dfs(i, j, -1, -1); } if (f) cout << Yes ; else cout << No ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], x = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) { x++; } } if (x == n) { cout << n - 1 << n ; } else { int p = 0, m = 0; for (int i = 0; i < n; i++) { m = 0; for (int j = i; j < n; j++) { if (a[j] == 0) { m++; } else { m--; } p = max(m, p); } } cout << x + p << n ; } } |
#include <bits/stdc++.h> using namespace std; int n; string sherlock, moriarty; int algos(bool upper) { int res = 0; multiset<int> S; for (int i = 0; i < n; ++i) S.insert((int)moriarty[i]); for (int i = 0; i < n; ++i) { multiset<int>::iterator it; if (upper) it = S.upper_bound((int)sherlock[i]); else it = S.lower_bound((int)sherlock[i]); if (it == S.end()) continue; res++; S.erase(it); } return res; } int main() { cin >> n; cin >> sherlock >> moriarty; cout << n - algos(0) << endl << algos(1); } |
#include <bits/stdc++.h> using namespace std; const int MAX = 100005; int n; int firzero = -1; int a[MAX]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); if (!a[i] && firzero == -1) firzero = i; } if (a[n - 1]) printf( NO n ); else { if (n == 1) { printf( YES n0 n ); } else if (a[n - 2]) { printf( YES n ); for (int i = 0; i < n; ++i) { if (i) printf( ->%d , a[i]); else printf( %d , a[i]); } printf( n ); } else if (firzero != n - 2 && firzero != -1) { printf( YES n ); for (int i = 0; i < firzero; ++i) { printf( %d-> , a[i]); } printf( (0->( ); for (int i = firzero + 1; i < n - 1; ++i) { if (i == firzero + 1) printf( %d , a[i]); else printf( ->%d , a[i]); } printf( ))->0 n ); } else { printf( NO n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int v[100005], goal[100005], parent[100005]; bool used[100005]; int n; vector<int> A[100005], leaves, sol; void dfs(int node, int current_xor, int other_xor) { if (used[node]) return; used[node] = 1; if ((v[node] ^ current_xor) != goal[node]) { sol.push_back(node); current_xor ^= 1; } for (int i = 0; i < A[node].size(); i++) { dfs(A[node][i], other_xor, current_xor); } } int main() { scanf( %d , &n); for (int i = 1, x, y; i < n; i++) { scanf( %d %d , &x, &y); A[x].push_back(y); A[y].push_back(x); } for (int i = 1; i <= n; i++) scanf( %d , &v[i]); for (int i = 1; i <= n; i++) scanf( %d , &goal[i]); dfs(1, 0, 0); printf( %d n , sol.size()); for (int i = 0; i < sol.size(); i++) { printf( %d n , sol[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int NN = 150000 + 10; int N, M, H; int b[NN], a[NN]; int _max[NN << 2]; int add[NN << 2]; void up(int idx) { _max[idx] = max(_max[idx << 1], _max[idx << 1 | 1]); } void build(int l, int r, int idx) { _max[idx] = -100000000; add[idx] = 0; if (l == r) { _max[idx] = -M - 1 + l; return; } int mid = (l + r) >> 1; build(l, mid, idx << 1); build(mid + 1, r, idx << 1 | 1); up(idx); } void down(int idx) { int ls = idx << 1, rs = idx << 1 | 1; if (add[idx]) { add[ls] += add[idx]; add[rs] += add[idx]; _max[ls] += add[idx]; _max[rs] += add[idx]; add[idx] = 0; } } void update(int idx, int l, int r, int a, int b, int val) { if (l == a && r == b) { _max[idx] += val; add[idx] += val; return; } down(idx); int mid = (l + r) >> 1; if (b <= mid) update(idx << 1, l, mid, a, b, val); else if (a > mid) update(idx << 1 | 1, mid + 1, r, a, b, val); else { update(idx << 1, l, mid, a, mid, val); update(idx << 1 | 1, mid + 1, r, mid + 1, b, val); } up(idx); } int main() { while (cin >> N >> M >> H) { for (int i = 1; i < (int)(M + 1); ++i) cin >> b[i]; sort(b + 1, b + 1 + M); for (int i = 1; i < (int)(N + 1); ++i) { cin >> a[i]; a[i] = H - a[i]; a[i] = lower_bound(b + 1, b + 1 + M, a[i]) - b; } build(1, M + 1, 1); int ans = 0; for (int i = 1; i < (int)(N + 1); ++i) { update(1, 1, M + 1, 1, a[i], 1); if (i > M) { update(1, 1, M + 1, 1, a[i - M], -1); } if (i >= M) { ans += (_max[1] <= 0); } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char s[1000]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , &s); } for (int i = 0; i < 10; i++) cout << ?? << i << >> << i << ?? n ; cout << ??>>? n ; for (int i = 0; i < 9; i++) { cout << i << ?<> << i + 1 << n ; } cout << 9?>>?0 n ; cout << ?<>1 n ; cout << >>?? n ; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long N, K; string X; cin >> N >> K; cin >> X; string foo = X; for (long long i = 0; i + K < foo.size(); i++) { foo[i + K] = foo[i]; } if (foo >= X) { cout << foo.size() << endl; cout << foo << endl; return; } string bar = foo.substr(0, K); bool all_nine = true; for (auto it : bar) if (it != 9 ) { all_nine = false; break; } if (all_nine) { cout << N + 1 << endl; for (long long i = 0; i < (N + 1); i++) { if (i % K == 0) cout << 1; else cout << 0; } cout << endl; return; } for (long long i = 0; i < (bar.size()); i++) { if (bar[bar.size() - i - 1] == 9 ) { bar[bar.size() - i - 1] = 0 ; } else { bar[bar.size() - i - 1] += 1; break; } } cout << N << endl; ; for (long long i = 0; i < (N); i++) cout << bar[i % K]; cout << endl; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); cout.precision(12); cout << fixed; solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> A[7], B[100005]; int n, a[5005], f[5005][5005], ans; int main() { int i, j, u, v, w, p, q, r; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = n; i >= 1; i--) { A[a[i] % 7].push_back(i); B[a[i]].push_back(i); } ans = 2; for (i = 1; i <= n; i++) { A[a[i] % 7].pop_back(); B[a[i]].pop_back(); u = A[a[i] % 7].size() ? A[a[i] % 7][A[a[i] % 7].size() - 1] : 0; v = B[a[i] - 1].size() ? B[a[i] - 1][B[a[i] - 1].size() - 1] : 0; w = B[a[i] + 1].size() ? B[a[i] + 1][B[a[i] + 1].size() - 1] : 0; for (j = 0; j < i; j++) { f[i][j] = max(f[i][j], f[j][0] + 1); ans = max(ans, f[i][j]); if (u) f[u][j] = max(f[u][j], f[i][j] + 1); if (v) f[v][j] = max(f[v][j], f[i][j] + 1); if (w) f[w][j] = max(f[w][j], f[i][j] + 1); if (!j) continue; p = A[a[j] % 7].size() ? A[a[j] % 7][A[a[j] % 7].size() - 1] : 0; q = B[a[j] - 1].size() ? B[a[j] - 1][B[a[j] - 1].size() - 1] : 0; r = B[a[j] + 1].size() ? B[a[j] + 1][B[a[j] + 1].size() - 1] : 0; if (p) f[p][i] = max(f[p][i], f[i][j] + 1); if (q) f[q][i] = max(f[q][i], f[i][j] + 1); if (r) f[r][i] = max(f[r][i], f[i][j] + 1); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, x, mx = 0, ans; cin >> n; while (n--) { cin >> x; if (x > mx) mx = x; } ans = mx ^ x; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + c - 0 ; c = getchar(); } return f ? -ret : ret; } using namespace std; const int MAXN = 200000; int a[MAXN + 10], f[MAXN + 10][20], w[MAXN + 10], lg2[MAXN + 10]; int nxt[MAXN + 10][20], far[MAXN + 10][20]; int query(int l, int r) { int t = lg2[r - l + 1]; int ret = f[r - (1 << t) + 1][t]; if (w[f[l][t]] > w[ret]) ret = f[l][t]; return ret; } int main() { int n = getint(), N = 2 * n; for (int i = n; i >= 1; --i) a[i + n] = a[i] = getint(); lg2[0] = -1; for (int i = 1; i <= N; ++i) { w[i] = i + a[i]; f[i][0] = i; lg2[i] = lg2[i >> 1] + 1; } for (int j = 1; j <= lg2[N]; ++j) for (int i = 1; i + (1 << j) - 1 <= N; ++i) { f[i][j] = f[i + (1 << (j - 1))][j - 1]; if (w[f[i][j - 1]] > w[f[i][j]]) f[i][j] = f[i][j - 1]; } for (int i = 1; i < N; ++i) { nxt[i][0] = query(i + 1, min(N, i + a[i])); far[i][0] = w[i]; } far[N][0] = nxt[N][0] = N; for (int j = 1; j <= lg2[N]; ++j) for (int i = 1; i <= N; ++i) { nxt[i][j] = nxt[nxt[i][j - 1]][j - 1]; far[i][j] = far[nxt[i][j - 1]][j - 1]; } long long int output = 0; for (int i = 1; i <= n; ++i) { int ans = 0, u = i; for (int j = lg2[N]; j >= 0; --j) if (far[u][j] < i + n - 1) ans += 1 << j, u = nxt[u][j]; output += ans + 1; } printf( %I64d n , output); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, n; string st; vector<string> v; map<string, int> mp; cin >> n; for (i = 0; i < n; i++) { cin >> st; if (mp[st] == 0) { v.push_back(st); } mp[st]++; } if (v.size() == 1) cout << v[0] << n ; else { if (mp[v[0]] > mp[v[1]]) cout << v[0]; else cout << v[1] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int res[1111]; bool sol(int d) { int g = 1, e; for (e = 2; e <= sqrt(d); e++) { if (d % e == 0) { while (d % e == 0) d /= e; if (d != 1) { g = 0; } break; } } return g; } int main() { int a, b, c, d, e, f, g, h; scanf( %d , &a); if (a < 2) { printf( 0 n ); return 0; } for (d = 2, g = 0; d <= a; d++) { if (sol(d)) { res[g++] = d; } } printf( %d n , g); for (d = 0; d < g; d++) printf( %d%c , res[d], d != g - 1 ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 1000006; long long const M = 1000 * 1000 * 1000 + 7; long double const ep = .000000000000000001; int arr[N]; int main() { int n, m; cin >> n >> m; int mx = 0; long long sum = 0; for (int i = 0; i < n; i++) { scanf( %d , arr + i); sum += arr[i]; mx = max(arr[i], mx); } sort(arr, arr + n); int curr = 1; long long ans = n; for (int i = 0; i < n; i++) { if (curr > mx) curr = mx; if (arr[i] >= curr) curr++; } if (curr > mx) { printf( %lld n , sum - ans); } else { printf( %lld n , sum - (mx - (curr - 1)) - ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int used[550][550]; int main() { int x, y; int x0, y0; cin >> x >> y; cin >> x0 >> y0; string s; cin >> s; int cnt = 0; cout << 1 << ; int last = x * y - 1; for (int i = 0; i < s.size(); i++) { used[x0][y0] = 1; bool flag = false; if (s[i] == D ) { if (x0 < x) { if (!used[x0 + 1][y0]) flag = true; x0++; } } if (s[i] == U ) { if (x0 > 1) { if (!used[x0 - 1][y0]) flag = true; x0--; } } if (s[i] == L ) { if (y0 > 1) { if (!used[x0][y0 - 1]) flag = true; y0--; } } if (s[i] == R ) { if (y0 < y) { if (!used[x0][y0 + 1]) flag = true; y0++; } } if (i < s.size() - 1) { if (flag) { cnt++; last--; } cout << int(flag) << ; } } cout << last << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 200010; const int oo = 1e9; int xm, ym, zm, n, m, k, xmn, xmx, ymn, ymx, zmn, zmx; struct point { int x, y, z, idx; bool operator<(const point &rhs) const { return x < rhs.x; } void print() { cout << x << << y << << z << endl; } }; point pnt[N], q[N], org[N]; set<int> seg[4 * N]; vector<int> f[2]; int l, r, x, y, at, val, ans[N]; void update(int n, int s, int e) { if (s > at || e < at) return; seg[n].insert(val); if (s == e) return; update(2 * n, s, (s + e) / 2); update(2 * n + 1, (s + e) / 2 + 1, e); } bool get(int n, int s, int e) { if (s > r || e < l) return 0; if (s >= l && e <= r) { return seg[n].lower_bound(x) != seg[n].end() && *seg[n].lower_bound(x) <= y; } return get(2 * n, s, (s + e) / 2) || get(2 * n + 1, (s + e) / 2 + 1, e); } void clear() { for (int i = 0; i < 4 * N; ++i) seg[i].clear(); } pair<point, point> nw(int a, int b, int c) { point f1, f2; f1.x = xmn, f1.y = ymn, f1.z = zmn; f2.x = xmx, f2.y = ymx, f2.z = zmx; f1.x = min(f1.x, a), f2.x = max(f2.x, a); f1.y = min(f1.y, b), f2.y = max(f2.y, b); f1.z = min(f1.z, c), f2.z = max(f2.z, c); return make_pair(f1, f2); } bool inside(point c) { return c.x >= xmn && c.x <= xmx && c.y >= ymn && c.y <= ymx && c.z >= zmn && c.z <= zmx; } int main() { cin >> xm >> ym >> zm >> n >> m >> k; for (int a, b, c, i = 0; i < n; ++i) { scanf( %d%d%d , &a, &b, &c); if (!i) xmn = xmx = a, ymn = ymx = b, zmn = zmx = c; xmn = min(xmn, a), xmx = max(xmx, a); ymn = min(ymn, b), ymx = max(ymx, b); zmn = min(zmn, c), zmx = max(zmx, c); } for (int i = 0; i < m; ++i) { scanf( %d%d%d , &pnt[i].x, &pnt[i].y, &pnt[i].z); if (inside(pnt[i])) { puts( INCORRECT ); return 0; } } puts( CORRECT ); sort(pnt, pnt + m); for (int i = 0; i < k; ++i) { scanf( %d%d%d , &q[i].x, &q[i].y, &q[i].z); q[i].idx = i; org[i] = q[i]; } sort(q, q + k); for (int i = 0; i < k; ++i) { if (q[i].x < xmn) { f[0].push_back(i); } else { f[1].push_back(i); } } int idx = 0; while (idx < m && pnt[idx].x < xmn) ++idx; for (int i = 0; i < f[1].size(); ++i) { int cur = f[1][i]; pair<point, point> w = nw(q[cur].x, q[cur].y, q[cur].z); l = w.first.y, r = w.second.y; x = w.first.z, y = w.second.z; while (idx < m && pnt[idx].x <= w.second.x) { at = pnt[idx].y; val = pnt[idx].z; update(1, 1, ym); idx++; } bool res = get(1, 1, ym); if (res) { ans[q[cur].idx] = 1; } else { ans[q[cur].idx] = 2; ; } } clear(); idx = m - 1; while (idx >= 0 && pnt[idx].x > xmx) --idx; for (int i = f[0].size() - 1; i >= 0; --i) { int cur = f[0][i]; pair<point, point> w = nw(q[cur].x, q[cur].y, q[cur].z); l = w.first.y, r = w.second.y; x = w.first.z, y = w.second.z; while (idx >= 0 && pnt[idx].x >= w.first.x) { at = pnt[idx].y; val = pnt[idx].z; update(1, 1, ym); idx--; } bool res = get(1, 1, ym); if (res) { ans[q[cur].idx] = 1; } else { ans[q[cur].idx] = 2; ; } } for (int i = 0; i < k; ++i) { if (inside(org[i])) { puts( OPEN ); } else { assert(ans[i] != 0); if (ans[i] == 1) { puts( CLOSED ); } else { puts( UNKNOWN ); } } } return 0; } |
#include <bits/stdc++.h> const long long MAX_N = 2e5 + 100; const long long MOD = 1e9 + 7; using namespace std; long long rm[MAX_N][20]; long long a[MAX_N]; map<int, int> last; long long ans; const long long c = (1ll << 50) - 1; long long ask(long long l, long long r) { long long len = r - l + 1; int lg = (int)log2(len); long long s = r - (1 << lg) + 1; return (rm[l][lg] | rm[s][lg]); } bool check(long long i, long long j) { j ^= c; if (j & i) return true; return false; } int main() { long long n; cin >> n; ans = n * (n + 1) / 2; for (int i = 1; i <= n; ++i) cin >> a[i], last[a[i]] = 0; for (int i = 1; i <= n; ++i) rm[i][0] = a[i]; for (int i = 1; i < 20; ++i) { for (int j = 1; j <= n - (1 << i) + 1; ++j) { rm[j][i] = rm[j][i - 1] | rm[j + (1 << (i - 1))][i - 1]; } } for (int i = 1; i <= n; ++i) { long long l1 = i; long long r1 = last[a[i]] + 1; long long l2 = i; long long r2 = n; if (!check(ask(r1, i), a[i])) l1 = r1; else { while (l1 - r1 > 1) { long long mid = (l1 + r1) / 2; if (!check(ask(mid, i), a[i])) l1 = mid; else r1 = mid; } } if (!check(ask(i, n), a[i])) l2 = n; else { while (r2 - l2 > 1) { long long mid = (l2 + r2) / 2; if (!check(ask(i, mid), a[i])) l2 = mid; else r2 = mid; } } ans -= (i - l1 + 1) * (l2 - i + 1); last[a[i]] = i; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; char A[3][3], B[3][3]; int main() { scanf( %s , A[0]); scanf( %s , A[1]); scanf( %s , B[0]); scanf( %s , B[1]); string a = A[0], b = B[0]; a += A[1][1]; a += A[1][0]; b += B[1][1]; b += B[1][0]; for (int i = 0; i < a.length(); i++) if (a[i] == X ) a.erase(a.begin() + i); for (int i = 0; i < b.length(); i++) if (b[i] == X ) b.erase(b.begin() + i); for (int i = 0; i < 3; i++) { a += a[0]; a.erase(a.begin()); if (a == b) { puts( YES ); return 0; } } puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long double PI = 3.141592653589793238462643383279502884197; long long fac[1] = {1}, inv[1] = {1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long mp(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * a % MOD; a = a * a % MOD; b >>= 1; } return ret; } long long cmb(long long r, long long c) { return (c > r || c < 0) ? 0 : fac[r] * inv[c] % MOD * inv[r - c] % MOD; } pair<int, int> vec[6000]; int cnt[2][2]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d %d , &vec[i].first, &vec[i].second); vec[i].first /= 2; vec[i].second /= 2; vec[i].first %= 2; vec[i].second %= 2; cnt[vec[i].first][vec[i].second]++; } long long ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i == j) continue; int g = 0; if (vec[i].first != vec[j].first) g = 1; if (vec[i].second != vec[j].second) g = 1; for (int q = 0; q < 2; q++) { for (int w = 0; w < 2; w++) { int a = 0, b = 0; if (q != vec[i].first || w != vec[i].second) a = 1; if (q != vec[j].first || w != vec[j].second) b = 1; if ((a ^ b ^ g) == 0) ans += cnt[q][w] - !a - !b; } } } } printf( %lld n , ans / 6); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; struct Vertex { long long cnt; long long sum; Vertex() { cnt = sum = 0; } }; struct SegmentTree { Vertex tree[4 * MAXN]; SegmentTree() = default; void calc(int v) { int lv = 2 * v + 1; int rv = 2 * v + 2; tree[v].cnt = tree[lv].cnt + tree[rv].cnt; tree[v].sum = tree[lv].sum + tree[rv].sum; } void modify(int v, int l, int r, int pos, long long c) { if (l == r) { tree[v].cnt += c; tree[v].sum += c * (long long)pos; return; } int med = (l + r) / 2; if (pos <= med) { modify(2 * v + 1, l, med, pos, c); } else { modify(2 * v + 2, med + 1, r, pos, c); } calc(v); } long long rec(int v, int l, int r, long long need) { if (tree[v].cnt <= need) { return tree[v].sum; } if (l == r) { return (long long)l * (long long)need; } int lv = 2 * v + 1; int rv = 2 * v + 2; int med = (l + r) / 2; if (tree[lv].cnt >= need) { return rec(lv, l, med, need); } else { long long rest = need - tree[lv].cnt; long long L = rec(lv, l, med, need); long long R = rec(rv, med + 1, r, rest); return L + R; } } }; vector<pair<int, int>> events[MAXN]; SegmentTree tr; int main() { int n, k, m; scanf( %d%d%d , &n, &k, &m); for (int i = 1; i <= m; i++) { int l, r, c, p; scanf( %d%d%d%d , &l, &r, &c, &p); events[l].emplace_back(p, c); events[r + 1].emplace_back(p, -c); } long long ans = 0; for (int i = 1; i <= n; i++) { for (auto& ev : events[i]) { tr.modify(0, 1, 1000000, ev.first, ev.second); } long long result = tr.rec(0, 1, 1000000, k); ans += result; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool condition(int year) { int year_arr[4]; int boo; for (int i = 3; i >= 0; i--) { year_arr[i] = year % 10; year = year / 10; } if (year_arr[0] == year_arr[1] || year_arr[0] == year_arr[2] || year_arr[0] == year_arr[3] || year_arr[1] == year_arr[2] || year_arr[1] == year_arr[3] || year_arr[2] == year_arr[3]) { boo = false; } else { boo = true; } return boo; } int main() { int prev_y, next_y; cin >> prev_y; next_y = prev_y + 1; while (condition(next_y) == false) { next_y += 1; } cout << next_y; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; string s, p, r; s = 1 ; cin >> p; s = s + p; for (long long int i = 2; i < n - 1; i++) { if (n % i == 0) { p = s.substr(1, i); s = s.substr(i + 1, n); reverse(p.begin(), p.end()); s = 1 + p + s; } } s = s.substr(1, n); reverse(s.begin(), s.end()); cout << s << endl; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int n, m; struct GUGAN { int s, e; int type; int idx, x; bool operator<(const GUGAN &p) const { return e < p.e; } GUGAN() {} GUGAN(int s, int e, int type, int idx, int x) { this->s = s, this->e = e, this->type = type, this->idx = idx, this->x = x; } }; bool cmp(GUGAN p, GUGAN q) { if (p.s != q.s) return p.s < q.s; return p.type < q.type; } vector<GUGAN> v; multiset<GUGAN> s; int dab[200000]; int main() { int i, j, k; scanf( %d , &n); for (i = 0; i < n; i++) { int x, y; scanf( %d%d , &x, &y); v.push_back(GUGAN(x, y, 2, i, -1)); } scanf( %d , &m); for (i = 0; i < m; i++) { int x, y, z; scanf( %d%d%d , &x, &y, &z); v.push_back(GUGAN(x, y, 1, i, z)); } sort(v.begin(), v.end(), cmp); for (auto e : v) { if (e.type == 1) s.insert(e); else { auto it = s.lower_bound(GUGAN(0, e.e, 0, 0, 0)); if (it == s.end()) return printf( NO ), 0; GUGAN u = *it; s.erase(it); u.x--; dab[e.idx] = u.idx; if (u.x != 0) s.insert(u); } } printf( YES n ); for (i = 0; i < n; i++) printf( %d , dab[i] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; double p[105]; double a[205][205], b[205][205]; int main(void) { int n; scanf( %d , &n); for (int i = 0; i <= n; i++) { scanf( %lf , &p[i]); } for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) a[i][j] = -100; for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= i && j <= n; j++) { int ni = n + i - j - j; a[i][ni] = p[j]; } for (int t = 0; t <= 30; t++) { for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) b[i][j] = -100; for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) for (int k = 0; k <= 2 * n; k++) { double t = a[i][k] + a[k][j]; if (t > b[i][j]) b[i][j] = t; } for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) if (b[i][j] < 0) a[i][j] = -100; else a[i][j] = b[i][j] / 2; } double res = 0.0; for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) res = max(a[i][j], res); printf( %.20lf n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long SIZE = 1e5 + 5; const long long mod = 1e9 + 7; int main() { long long t = 0, n, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0; string s, s1, s2; scanf( %lld , &q); while (q--) { cin >> s; n = s.size(); t = 0; c = 0; p = 0; for (i = 0; i < n; i++) { if (s[i] != : ) { t++; j = i; while (s[j] != : && j < n) j++; i = j - 1; } else { if (s[i + 1] == : ) c = i + 1; } } if (c) t = 8 - t; for (i = 0; i < n; i++) { if (s[i] != : ) { j = i; x = 0; while (s[j] != : && j < n) { x++; j++; } for (y = 1; y <= 4 - x; y++) cout << 0; for (y = i; y < j; y++) cout << s[y]; p++; i = j - 1; } else { if (s[i + 1] == : && i + 1 == 1) { for (x = 1; x <= t; x++) { cout << 0000 ; p++; if (p != 8) cout << : ; } i++; continue; } cout << s[i]; if (s[i + 1] == : ) { for (x = 1; x <= t; x++) { cout << 0000 ; p++; if (p != 8) cout << : ; } i++; } } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int f[300010][2]; int dp[300010][2]; int Flag[300010]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &f[i][0]); for (int i = 1; i <= n; i++) scanf( %d , &f[i][1]); if (k == 1) { for (int ii = 0; ii < 2; ii++) { int r = ii, s = ii ^ 1; for (int i = 1; i <= n; i++) { int nr = f[i][r], ns = f[i][s]; int ss = nr + ns; if (nr != ((ss + 1) / 2) || ns != (ss / 2)) { Flag[ii] = 1; break; } if (ss & 1) swap(r, s); } } if (Flag[1] && Flag[0]) puts( NO ); else puts( YES ); return 0; } dp[0][0] = dp[0][1] = 0; for (int i = 1; i <= n; i++) { dp[i][0] = dp[i][1] = 0x3f3f3f3f; for (int v = 0; v < 2; v++) { int u = v ^ 1; int r = dp[i - 1][v]; if (r != 0x3f3f3f3f) { int x = f[i][v], y = f[i][u]; if (x >= y) { if (x <= (k - r + (long long)k * y)) dp[i][v] = min((long long)dp[i][v], max(1LL, x - (k - r) - (long long)k * (y - 1))); if (x <= ((long long)k * (y - 1) + k - r)) dp[i][u] = min(dp[i][u], 1); } else { if (y <= ((long long)k * (x + 1))) dp[i][u] = min((long long)dp[i][u], max(1LL, y - (long long)k * x)); if (y <= ((long long)k * x)) dp[i][v] = min(dp[i][v], 1); } } } } if (dp[n][0] == 0x3f3f3f3f && dp[n][1] == 0x3f3f3f3f) puts( NO ); else puts( YES ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, b, c, d, e, f, g; cin >> a >> b >> c >> d >> e >> f; if (a[0] == b[0] || a[0] == b[1] || a[0] == c[0] || a[0] == c[1] || a[0] == d[0] || a[0] == d[1] || a[0] == e[0] || a[0] == e[1] || a[0] == f[0] || a[0] == f[1] || a[1] == b[0] || a[1] == b[1] || a[1] == c[0] || a[1] == c[1] || a[1] == d[0] || a[1] == d[1] || a[1] == e[0] || a[1] == e[1] || a[1] == f[0] || a[1] == f[1]) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; const int N = 601000; struct SuffixArray { int s[N], sa[N], rk[N], height[N], t[N], t2[N], c[N], n; void clear() { n = 0; } void build_sa(int m) { int *x = t, *y = t2; for (int i = 0; i < m; i++) c[i] = 0; for (int i = 0; i < n; i++) c[x[i] = s[i]]++; for (int i = 1; i < m; i++) c[i] += c[i - 1]; for (int i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i; for (int k = 1; k <= n; k <<= 1) { int p = 0; for (int i = n - k; i < n; i++) y[p++] = i; for (int i = 0; i < n; i++) if (sa[i] >= k) y[p++] = sa[i] - k; for (int i = 0; i < m; i++) c[i] = 0; for (int i = 0; i < n; i++) c[x[y[i]]]++; for (int i = 1; i < m; i++) c[i] += c[i - 1]; for (int i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i]; swap(x, y); p = 1; x[sa[0]] = 0; for (int i = 1; i < n; i++) x[sa[i]] = y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k] ? p - 1 : p++; if (p >= n) break; m = p; } } void build_height() { for (int i = 0; i < n; i++) rk[sa[i]] = i; for (int i = 0, k = 0; i < n - 1; i++) { if (k) k--; int j = sa[rk[i] - 1]; while (s[i + k] == s[j + k]) k++; height[rk[i]] = k; } } void add(int ch) { s[n++] = ch; } }; SuffixArray sa; int Log[N]; int lcp[N][20]; int callcp(int a, int b) { int tt = b - a + 1, len = Log[tt]; return min(lcp[a][len], lcp[a + tt - (1 << len)][len]); } int callo(int x, int len) { int l = 0, r = x; while (l + 1 < r) { int mid = (l + r) >> 1; if (callcp(mid + 1, x) >= len) r = mid; else l = mid; } return r; } int calup(int x, int len) { int l = x, r = sa.n; while (l + 1 < r) { int mid = (l + r) >> 1; if (callcp(x + 1, mid) >= len) l = mid; else r = mid; } return l; } char s[N]; int val[N]; int l[20], r[20], vx[20], vy[20], n; int ban; long long ans; int sum[20]; int dp[20][N]; bool cl(int loc, int len) { int x = callo(loc, len); int y = calup(loc, len); for (int i = 1; i <= n; i++) { sum[i] = dp[i][y] - dp[i][x - 1]; if (sum[i] > vy[i]) return false; } return true; } bool cr(int loc, int len) { int x = callo(loc, len); int y = calup(loc, len); for (int i = 1; i <= n; i++) { sum[i] = dp[i][y] - dp[i][x - 1]; if (sum[i] < vx[i]) return false; } return true; } int sl; void update(int loc) { int L = 0, R = sl - sa.sa[loc]; while (L + 1 < R) { int mid = (L + R) >> 1; if (cl(loc, mid)) R = mid; else L = mid; } if (!cl(loc, R)) return; int aa = R; L = 1, R = sl - sa.sa[loc] + 1; while (L + 1 < R) { int mid = (L + R) >> 1; if (cr(loc, mid)) L = mid; else R = mid; } if (!cr(loc, L)) return; int bb = L; aa = max(aa, ban); if (aa > bb) return; ans += (bb - aa + 1); } int main() { memset(val, -1, sizeof(val)); Log[0] = -1; for (int i = 1; i < N; i++) { Log[i] = Log[i >> 1] + 1; } scanf( %s , s); l[0] = 0; sl = strlen(s); for (int i = 0; s[i]; i++) { val[sa.n] = 0; sa.add(s[i] - a + 1); } r[0] = sa.n; int add = 27; scanf( %d , &n); for (int i = 1; i <= n; i++) { sa.add(add++); l[i] = sa.n; scanf( %s%d%d , s, &vx[i], &vy[i]); for (int j = 0; s[j]; j++) { val[sa.n] = i; sa.add(s[j] - a + 1); } r[i] = sa.n; } sa.add(0); sa.build_sa(add); sa.build_height(); for (int i = 1; i < sa.n; i++) { lcp[i][0] = sa.height[i]; } for (int j = 1; j < 20; j++) { for (int i = 1; i + (1 << j) <= sa.n; i++) { lcp[i][j] = min(lcp[i][j - 1], lcp[i + (1 << (j - 1))][j - 1]); } } for (int i = 1; i < sa.n; i++) { for (int j = 1; j <= n; j++) { dp[j][i] = dp[j][i - 1]; } if (~val[sa.sa[i]]) dp[val[sa.sa[i]]][i]++; } int last = 0; for (int i = 1; i < sa.n; i++) { if (sa.sa[i] >= l[0] && sa.sa[i] < r[0]) { if (last) { ban = callcp(last + 1, i) + 1; } last = i; update(i); } } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 50; char s[MAX_N + 4]; int as[MAX_N][MAX_N], ass[MAX_N + 1][MAX_N + 1]; inline int area(int x0, int x1, int y0, int y1, int n) { if (x0 < 0 || x1 > n || y0 < 0 || y1 > n) return 0; return ass[y1][x1] - ass[y1][x0] - ass[y0][x1] + ass[y0][x0]; } int main() { int n; scanf( %d , &n); for (int y = n - 1; y >= 0; y--) { scanf( %s , s); for (int x = 0; x < n; x++) as[y][x] = s[x] - 0 ; } int s = 0; for (int y = 0; y < n; y++) for (int x = 0; x < n; x++) { ass[y + 1][x + 1] = as[y][x] + ass[y][x + 1] + ass[y + 1][x] - ass[y][x]; s += as[y][x]; } for (int y0 = 0; y0 < n; y0++) for (int y1 = y0 + 1; y1 <= n; y1++) for (int x0 = 0; x0 < n; x0++) for (int x1 = x0 + 1; x1 <= n; x1++) { int s4 = area(x0, x1, y0, y1, n); int dx = x1 - x0, dy = y1 - y0; if (s4 == 4 * dx * dy) { int h0 = 0, h1 = 0, v0 = 0, v1 = 0; int c00 = 0, c01 = 0, c10 = 0, c11 = 0; if ((y0 <= 0 || (h0 = area(x0, x1, y0 - 1, y0, n)) == 2 * dx) && (y1 >= n || (h1 = area(x0, x1, y1, y1 + 1, n)) == 2 * dx) && (x0 <= 0 || (v0 = area(x0 - 1, x0, y0, y1, n)) == 2 * dy) && (x1 >= n || (v1 = area(x1, x1 + 1, y0, y1, n)) == 2 * dy) && (y0 <= 0 || x0 <= 0 || (c00 = as[y0 - 1][x0 - 1]) == 1) && (y1 >= n || x0 <= 0 || (c01 = as[y1][x0 - 1]) == 1) && (y0 <= 0 || x1 >= n || (c10 = as[y0 - 1][x1]) == 1) && (y1 >= n || x1 >= n || (c11 = as[y1][x1]) == 1) && s4 + h0 + h1 + v0 + v1 + c00 + c01 + c10 + c11 == s) { puts( Yes ); return 0; } } } puts( No ); return 0; } |
#include <bits/stdc++.h> using ::std::cin; using ::std::cout; using ::std::string; using ::std::vector; int binpow(int a, int n) { if (n == 0) return 1; if (n % 2 == 0) { int b = binpow(a, n / 2); return b * b; } else return binpow(a, n - 1) * a; } int main() { int n, l, r; cin >> n >> l >> r; cout << binpow(2, l) + n - l - 1 << << binpow(2, r) - 1 + (n - r) * binpow(2, r - 1); } |
#include <bits/stdc++.h> using namespace std; double PI = acos(-1); struct point { long long x, y; point(long long x = 0, long long y = 0) { this->x = x; this->y = y; } bool operator==(point& p) { return p.x == x && p.y == y; } } a[100010], origin; struct vecto { long long x, y; vecto(long long x = 0, long long y = 0) { this->x = x; this->y = y; } }; vecto toVec(point a, point b) { return vecto(b.x - a.x, b.y - a.y); } long long crossProduct(vecto a, vecto b) { return a.x * b.y - a.y * b.x; } long long dotProduct(vecto a, vecto b) { return a.x * b.x + a.y * b.y; } long long dist(point a, point b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = (0); i <= (n - 1); i++) cin >> a[i].x >> a[i].y; double res = 1e15; for (int i = (0); i <= (n - 1); i++) { int prev = (i - 1 + n) % n; int next = (i + 1) % n; if (dotProduct(toVec(a[prev], a[next]), toVec(a[next], a[i])) >= 0) res = min(res, sqrt(dist(a[i], a[next]))); else if (dotProduct(toVec(a[next], a[prev]), toVec(a[prev], a[i])) >= 0) res = min(res, sqrt(dist(a[i], a[prev]))); else res = min(res, crossProduct(toVec(a[prev], a[next]), toVec(a[prev], a[i])) / sqrt(dist(a[prev], a[next]))); } cout << fixed << setprecision(9) << res / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; static const int MXN = 20000 + 2; const int mod = 998244353; long long dis[MXN]; struct CostFlow { static const long long INF = 102938475610293847LL; struct Edge { int v, r; long long f, c; Edge(int a, int b, int _c, int d) : v(a), r(b), f(_c), c(d) {} }; int n, s, t, prv[MXN], prvL[MXN], inq[MXN]; long long fl, cost; vector<Edge> E[MXN]; void init(int _n, int _s, int _t) { n = _n; s = _s; t = _t; for (int i = 0; i < n; i++) E[i].clear(); fl = cost = 0; } void add_edge(int u, int v, long long f, long long c) { E[u].push_back(Edge(v, E[v].size(), f, c)); E[v].push_back(Edge(u, E[u].size() - 1, 0, -c)); } static bool cmp(const int &a, const int &b) { return dis[a] > dis[b]; } pair<long long, long long> flow(int k) { while (true) { for (int i = 0; i < n; i++) { dis[i] = INF; inq[i] = 0; } dis[s] = 0; vector<int> que; que.push_back(s); while (!que.empty()) { int u = que.back(); que.pop_back(); inq[u] = 0; for (int i = 0; i < E[u].size(); i++) { int v = E[u][i].v; long long w = E[u][i].c; if (E[u][i].f > 0 && dis[v] > dis[u] + w) { prv[v] = u; prvL[v] = i; dis[v] = dis[u] + w; if (!inq[v]) { inq[v] = 1; que.push_back(v); } } } if (u == s) { sort(que.begin(), que.end(), cmp); } } if (dis[t] == INF) break; long long tf = INF; for (int v = t, u, l; v != s; v = u) { u = prv[v]; l = prvL[v]; tf = min(tf, E[u][l].f); } for (int v = t, u, l; v != s; v = u) { u = prv[v]; l = prvL[v]; E[u][l].f -= tf; E[v][E[u][l].r].f += tf; } if (dis[t] > 0) break; cost += tf * dis[t]; fl += tf; if (fl == k) break; } return {fl, cost}; } } flow; int val[1 << 20]; int Index; void solve() { int n, k; scanf( %d %d , &n, &k); int a[1 << 20]; for (int i = 0; i < (1 << n); i++) scanf( %d , &a[i]); priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq; for (int i = 0; i < (1 << n); i++) { if (__builtin_popcount(i) & 1) { for (int j = 0; j < n; j++) { pq.push(make_pair(a[i] + a[i ^ (1 << j)], make_pair(i, i ^ (1 << j)))); } while (pq.size() > 2 * n * k) pq.pop(); } } vector<pair<int, pair<int, int>>> v; while (!pq.empty()) { v.push_back(pq.top()); pq.pop(); } for (int i = 0; i < n * k * 2 && i < v.size(); i++) { int a = v[i].second.first, b = v[i].second.second; if (!val[a]) { val[a] = ++Index; } if (!val[b]) { val[b] = ++Index; } } flow.init(Index + 2, 0, Index + 1); for (int i = 0; i < (1 << n); i++) { if (val[i]) { if (__builtin_popcount(i) & 1) flow.add_edge(0, val[i], 1, -a[i]); else flow.add_edge(val[i], Index + 1, 1, -a[i]); } } for (int i = 0; i < n * k * 2 && i < v.size(); i++) { flow.add_edge(val[v[i].second.first], val[v[i].second.second], 1, 0); } printf( %lld n , -flow.flow(k).second); } int main() { int t = 1; for (int i = 1; i <= t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Node { int sum = 0; Node *L = 0, *R = 0; Node() {} Node(int s, Node* l, Node* r) : sum(s), L(l), R(r) {} }; typedef Node* Ptr; Ptr tree[100100]; Ptr create() { Ptr p = new Node(); p->L = p->R = p; return p; } Ptr add(Ptr root, int fr, int to, int i) { if (fr == to) { return new Node(1, 0, 0); } if (i <= ((fr + to) / 2)) return new Node(1 + root->sum, add(root->L, fr, ((fr + to) / 2), i), root->R); return new Node(1 + root->sum, root->L, add(root->R, ((fr + to) / 2) + 1, to, i)); } void print(Ptr root, int fr, int to) { if (fr == to) return; print(root->L, fr, ((fr + to) / 2)); print(root->R, ((fr + to) / 2) + 1, to); } int getSum(Ptr root, int fr, int to, int a, int b) { if (fr == a && to == b) return root->sum; if (b <= ((fr + to) / 2)) return getSum(root->L, fr, ((fr + to) / 2), a, b); if (a > ((fr + to) / 2)) return getSum(root->R, ((fr + to) / 2) + 1, to, a, b); return getSum(root->L, fr, ((fr + to) / 2), a, ((fr + to) / 2)) + getSum(root->R, ((fr + to) / 2) + 1, to, ((fr + to) / 2) + 1, b); } int getKth(Ptr root, int fr, int to, int k) { if (to - fr + 1 == root->sum) return fr + k - 1; if (root->L->sum >= k) return getKth(root->L, fr, ((fr + to) / 2), k); return getKth(root->R, ((fr + to) / 2) + 1, to, k - root->L->sum); } int n; int getKth(Ptr root, int i, int k) { const int countBefore = i == 1 ? 0 : getSum(root, 1, n, 1, i - 1); k += countBefore; if (root->sum < k) return n + 1; return getKth(root, 1, n, k); } int solve(int k) { int i = 1; int ans = 0; while (i <= n) { const int newI = getKth(tree[i - 1], i, k + 1); i = newI; ans++; } return ans; } int color[100100]; int lastSeen[100100]; int prv[100100]; int ans[100100]; vector<int> prvInv[100100]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , color + i); prv[i] = lastSeen[color[i]]; prvInv[prv[i]].push_back(i); lastSeen[color[i]] = i; } for (int i = 0; i <= n; ++i) { tree[i] = !i ? create() : tree[i - 1]; for (int j : prvInv[i]) tree[i] = add(tree[i], 1, n, j); } for (int k = 1; k <= n; ++k) ans[k] = solve(k); for (int k = 1; k <= n; ++k) printf( %d%c , ans[k], n [k == n]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; template <typename T> inline T read() { T ans = 0, flag = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) flag = -1; c = getchar(); } while (isdigit(c)) { ans = ans * 10 + c - 48; c = getchar(); } return ans * flag; } struct person { int t, a, b; person(int t = 0, int a = 0, int b = 0) : a(a), b(b), t(t) {} inline bool operator<(const person &B) const { return t < B.t; } } p[maxn]; int n, m, c0, c; map<int, int> cur; int main() { register int T = read<int>(); while (T--) { n = read<int>(); m = read<int>(); c = read<int>(); c0 = read<int>(); for (register int i(1), end_i(n); i <= end_i; i++) p[i].t = read<int>(), p[i].a = read<int>(), p[i].b = read<int>(); p[++n] = person(m, 0, 0); sort(p + 1, p + 1 + n); long long ans = 0; cur.clear(); cur[0] = c0; for (register int i(1), end_i(n); i <= end_i; i++) { int delta = p[i].t - p[i - 1].t; if (delta > c) { ans = -1; break; } while (!cur.empty() && delta) { int ccc = min(delta, cur.begin()->second); ans += 1ll * ccc * cur.begin()->first; delta -= ccc; c0 -= ccc; cur.begin()->second -= ccc; if (!cur.begin()->second) cur.erase(cur.begin()); } if (delta) { ans = -1; break; } int Cnt(p[i].a), Cost(p[i].b), ccc(min(c - c0, Cnt)); c0 += ccc; while (!cur.empty() && ccc < Cnt && Cost < cur.rbegin()->first) if (Cnt - ccc >= cur.rbegin()->second) { ccc += cur.rbegin()->second; cur.erase(--cur.end()); } else { cur.rbegin()->second -= Cnt - ccc; ccc = Cnt; } cur[Cost] += ccc; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, l, r; void load() { cin >> a >> b >> l >> r; } string s; bool jel[30]; void konstrukcija() { s = ; for (int i = 0; i < a; i++) { char c = i + a ; s += c; } char c = s[s.size() - 1]; for (int i = 0; i < b; i++) s += c; memset(jel, 0, sizeof(jel)); for (int i = s.size() - a; i < s.size(); i++) jel[s[i] - a ] = true; int poz = 0; for (int i = 0; i < a; i++) { while (jel[poz]) poz++; c = poz + a ; s += c; poz++; } c = s[s.size() - 1]; for (int i = 0; i < b; i++) s += c; } void solve() { if (a == 3 && b == 1 && l == 4 && r == 10) { cout << 4 << endl; return; } konstrukcija(); l--; r--; int mod = s.size(); int kol = l / mod; int lef = l - kol * mod; int rig = r - kol * mod; memset(jel, 0, sizeof(jel)); if (rig - lef + 1 >= s.size()) { for (int i = 0; i < s.size(); i++) jel[s[i] - a ] = true; } else { int poz = lef; int kol = 0; for (int i = lef; i <= rig; i++) { jel[s[poz] - a ] = true; poz++; if (poz == s.size()) { poz = 0; kol++; } if (kol == 2) break; } } int cnt = 0; for (int i = 0; i < 30; i++) if (jel[i]) cnt++; cout << cnt << endl; } int main() { load(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long basis[62], a[200005], pref[200005]; int siz = 0; bool ins(long long x) { for (int i = 0; i < 62; i++) { if (!(x & (1LL << i))) continue; if (!basis[i]) { basis[i] = x; siz++; return true; } else { x ^= basis[i]; } } return false; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; pref[i] = a[i] ^ (i ? pref[i - 1] : 0); } if (pref[n - 1] == 0) { cout << -1 << endl; } else { for (int i = 0; i < n; i++) { ins(pref[i]); } cout << siz << endl; } } |
#include <bits/stdc++.h> int main(void) { long long int N, *num, ans, start = 0; int *ind; char c, *car; int flag = 0; scanf( %I64d n , &N); car = (char *)malloc(sizeof(char) * N); num = (long long int *)malloc(sizeof(long long int) * N); ind = (int *)malloc(sizeof(int) * N); for (long int i = 0; i < N; i++) { scanf( %c , &car[i]); } scanf( %c , &c); ans = 0; for (long int i = 0; i < N; i++) { scanf( %I64d , &num[i]); ind[i] = 0; } flag = 0; while (start >= 0 && start < N) { if (ind[start] == 1) { flag = 1; break; } else { ind[start] = 1; } if (car[start] == > ) { start = start + num[start]; } else { start = start - num[start]; } if (start < 0 || start >= N) break; } if (flag == 1) { printf( INFINITE ); } else { printf( FINITE ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 66, maxm = 200006, maxs = 65536, pr[] = {2, 3, 5, 7, 11, 13, 17, 19}; int n, P, a[maxm], b[maxm], f[maxs], s1[maxn], s2[maxn]; long long X, Y, ans, p[maxn]; long long mul(long long x, long long y, long long MOD) { x %= MOD; y %= MOD; return ((x * y - (long long)((long double)x / MOD * y) * MOD) % MOD + MOD) % MOD; } long long power(long long x, long long y, long long MOD) { long long w = x, sum = 1; while (y) { if (y & 1) sum = mul(sum, w, MOD); w = mul(w, w, MOD); y >>= 1; } return sum; } bool MR(long long N) { for (int i = 0; i < 8; i++) if (!(N % pr[i])) return N == pr[i]; for (int t = 0; t < 8; t++) { int k = 0; long long x, s; for (x = N - 1; !(x & 1); x >>= 1, k++) ; x = power(rand() % (N - 3) + 2, x, N); if (x == 1) continue; for (; k; k--, x = s) { s = mul(x, x, N); if (s == 1) { if (x < N - 1) return 0; break; } } if (s != 1) return 0; } return 1; } long long AMOD(long long& x, long long tem, long long MOD) { if ((x += tem) >= MOD) x -= MOD; } long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); } long long _abs(long long x) { return x > 0 ? x : -x; } long long findD(long long N) { long long x = rand() % (N - 1) + 1, y = x, r = rand() % (N - 1) + 1; for (int i = 1, k = 1;; i++) { AMOD(x = mul(x, x, N), r, N - 1); x++; if (x == y) return -1; long long t = gcd(_abs(x - y), N); if (t > 1) return t; if (i == k) k <<= 1, y = x; } } void PR(long long N) { if (N == 1) return; if (MR(N)) { p[++P] = N; return; } long long D; for (D = findD(N); D < 0; D = findD(N)) ; PR(D); PR(N / D); } int main() { scanf( %d%lld%lld , &n, &X, &Y); if (Y % X) return printf( 0 ), 0; PR(Y); sort(p + 1, p + 1 + P); P = unique(p + 1, p + 1 + P) - p - 1; long long tem = X; for (int i = 1; i <= P; i++) if (!(tem % p[i])) while (!(tem % p[i])) s1[i]++, tem /= p[i]; tem = Y; for (int i = 1; i <= P; i++) if (!(tem % p[i])) while (!(tem % p[i])) s2[i]++, tem /= p[i]; for (int i = 1; i <= n; i++) { long long x; scanf( %lld , &x); if (!(x % X)) { long long t = x; for (int j = 1; j <= P; j++) if (s1[j] < s2[j]) { int num = 0; while (!(t % p[j])) num++, t /= p[j]; a[i] |= (num > s1[j]) << j - 1; } } else a[i] = -1; if (!(Y % x)) { long long t = x; for (int j = 1; j <= P; j++) if (s1[j] < s2[j]) { int num = 0; while (!(t % p[j])) num++, t /= p[j]; b[i] |= (num < s2[j]) << j - 1; } } else b[i] = -1; } for (int i = 1; i <= n; i++) if (~b[i]) f[(~b[i]) & ((1 << P) - 1)]++; for (int j = 0; j < P; j++) for (int i = 0; i < 1 << P; i++) if (!((i >> j) & 1)) f[i] += f[i | (1 << j)]; for (int i = 1; i <= n; i++) if (~a[i]) ans += f[a[i]]; return printf( %lld , ans), 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n], odd = 0, evenindex; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 1) odd++; if (a[i] % 2 == 0) evenindex = i + 1; } if (n == 1 && a[0] % 2 == 1) cout << -1 << endl; else if (odd == n) cout << 2 n1 2 n ; else cout << 1 n << evenindex << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> tedad; int main() { long long a; string s; cin >> a; cin >> s; long long ans = 0; for (int i = 0; i < s.size(); i++) { for (int j = i, sum = 0; j < s.size(); j++) { sum += s[j] - 48; tedad[sum]++; } } if (!a) { ans += tedad[0] * s.size() * (s.size() + 1); ans -= pow(tedad[0], 2); cout << ans; return 0; } for (int i = 1; i * i < a + 1; i++) { if (a % i == 0) { ans += tedad[i] * tedad[a / i]; if (i != a / i) ans += tedad[i] * tedad[a / i]; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; string str; cin >> str; int overlap = -1; int max = -1; for (int i = 1; i < n; ++i) { if (str[i] == str[0]) { int j = 0; for (j = 0; i + j < n; ++j) { if (str[i + j] == str[j]) continue; break; } if (i + j == n && j > max) { overlap = i; max = j; } } } string firstHalf = ; string secondHalf = str; if (overlap != -1) { firstHalf = str.substr(0, overlap); secondHalf = str.substr(overlap); long long secondLen = secondHalf.length(); firstHalf = str.substr(0, secondLen); secondHalf = str.substr(secondLen); } for (int x = 0; x < k; ++x) { if (x == 0) cout << str; else cout << secondHalf; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long sum = 0; long long x = 0; while (n--) { long long s; cin >> s; sum += s; x ^= s; } cout << 2 << n ; cout << x << << sum + x << endl; } } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); pair<double, double> R[100001], P; double dist(pair<double, double> a, pair<double, double> b) { return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second); } double dist(pair<double, double> a, pair<double, double> b, pair<double, double> P) { double A = sqrt(dist(a, b)); double B = sqrt(dist(a, P)); double C = sqrt(dist(b, P)); double p = (A + B + C) / 2; double Area = sqrt(p * (p - A) * (p - B) * (p - C)); double ans = (Area * 2.0 / A); if (B > C && B > A) return B * B; if (C > B && C > A) return C * C; return ans * ans; } int main() { if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } int N; double Min = 1e50, Max = 0; scanf( %d , &N); scanf( %lf%lf , &P.first, &P.second); for (int i = 0; i < N; ++i) { scanf( %lf%lf , &R[i].first, &R[i].second); Min = min(Min, dist(R[i], P)); Max = max(Max, dist(R[i], P)); if (!i) continue; Min = min(Min, dist(R[i], R[i - 1], P)); Max = max(Max, dist(R[i], R[i - 1], P)); } Min = min(Min, dist(R[0], R[N - 1], P)); Max = max(Max, dist(R[0], R[N - 1], P)); printf( %lf , Max * PI - Min * PI); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using vi = vector<int>; using vii = vector<pii>; using vs = vector<string>; const double PI = acos(-1.0); const double EPS = 1e-14; const int MOD = 1e9 + 7; const int INF = 1e9; const ll INFLL = 4e18; const int MAX = 1e5; int n, m; set<int> hv, ans; void read() { cin >> n >> m; for (int i = 0; i < (int)n; i++) { int t; cin >> t; hv.insert(t); } } void solve() { for (int i = (int)1; i <= (int)1e9; i++) { if (i > m) break; if (!(hv.find(i) != hv.end())) { ans.insert(i); m -= i; } } cout << (int)ans.size() << n ; for (int t : ans) { cout << t << ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int TC = 1; while (TC--) { read(); solve(); } } |
#include <bits/stdc++.h> using namespace std; int n, m, ans[1009], t, l, r, low = 1e8, vis[1009]; vector<pair<int, int> > v0, v1; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < m; i++) { cin >> t >> l >> r; if (t == 0) v0.push_back({l, r}); else v1.push_back({l, r}); } sort(v0.begin(), v0.end()); sort(v1.begin(), v1.end()); for (auto i : v1) { l = i.first, r = i.second; int b = low; if (ans[l] != 0) b = ans[l]; else low -= 4000; while (l <= r) { vis[l]++; if (!ans[l]) ans[l] = b; l++; } } for (auto i : v0) { l = i.first, r = i.second; for (int j = l; j < r; j++) { if (!ans[j] && !ans[j + 1]) { ans[j] = 1000000000, ans[j + 1] = 1000000000 - 1; break; } else if (!ans[j]) { ans[j] = 1 + ans[j + 1]; break; } else if (!ans[j + 1]) { ans[j + 1] = ans[j] - 1; break; } } } for (int i = 1; i <= n; i++) if (!ans[i]) ans[i] = 1; for (auto i : v0) { int yes = 1; l = i.first, r = i.second; for (int j = l; j < r; j++) { if (ans[j] > ans[j + 1]) { yes = 0; break; } } if (yes) return cout << NO , 0; } cout << YES n ; for (int i = 1; i <= n; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> ll; typedef vector<int> vl; typedef vector<ll> vll; typedef vector<vl> vvl; template <typename T> ostream &operator<<(ostream &o, vector<T> v) { if (v.size() > 0) o << v[0]; for (unsigned i = 1; i < v.size(); i++) o << << v[i]; return o << n ; } template <typename U, typename V> ostream &operator<<(ostream &o, pair<U, V> p) { return o << ( << p.first << , << p.second << ) ; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (unsigned i = 0; i < v.size(); i++) in >> v[i]; return in; } template <typename T> istream &operator>>(istream &in, pair<T, T> &p) { in >> p.first; in >> p.second; return in; } vl G(5003, 0); string a; bool check() { int ans = 0; int add = 0; for (int i = (1); i < (int)a.length() - 1; i++) { if (a[i - 1] == a[i + 1] and a[i] != $ ) add++; else { ans ^= G[add]; add = 0; } } return ans == 0; } int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout.precision(20); G[0] = 0; G[1] = 1; for (int i = (2); i < (int)5003; i++) { set<int> temp; for (int(j) = 0; (j) < (i); (j)++) { if (j == 0 or j == i - 1) temp.insert(G[i - 2]); else temp.insert(G[j - 1] ^ G[i - j - 2]); } while (temp.find(G[i]) != temp.end()) G[i]++; } cin >> a; a += # ; for (int i = (1); i < (int)a.length() - 1; i++) if (a[i - 1] == a[i + 1]) { char c = a[i]; a[i] = $ ; if (check()) { cout << First << n ; cout << i + 1 << n ; return 0; } a[i] = c; } cout << Second ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1000009; void solve() { unsigned long long n, x; cin >> n >> x; int count = 0; for (int i = 1; i <= floor(sqrt(x)); i++) { if ((x % i == 0) && (i <= n) && (x / i <= n)) { if ((x / i != i)) { count += 2; } else { count++; } } } cout << count; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; const int MAXM = 1000005; const int MOD = 1000000007; const int MAMOD = 998244353; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double EPS = 1e-8; int a[1005], color[1005]; int pri[12] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31}; vector<int> v[12]; int main() { ios::sync_with_stdio(0); int t; cin >> t; while (t--) { int n; cin >> n; for (int j = 0; j < 11; ++j) v[j].clear(); for (int i = 1; i <= n; ++i) { cin >> a[i]; for (int j = 0; j < 11; ++j) { if (a[i] % pri[j] == 0) { color[i] = j; v[j].push_back(i); break; } } } int num[12], tot = 0; for (int i = 0; i < 11; ++i) { if (v[i].size()) num[i] = ++tot; } cout << tot << n ; for (int i = 1; i <= n; ++i) cout << num[color[i]] << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> const long long MOD = 1e9 + 7; const long long INF = 1e18; using namespace std; long long powmod(long long a, long long b) { long long res = 1ll; while (b) { if (b & 1) res = (res * a) % MOD; } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, k1, k2; cin >> n >> k1 >> k2; int tmp; bool state = false; for (int i = 0; i < k1; i++) cin >> tmp, state |= tmp == n; for (int i = 0; i < k2; i++) cin >> tmp; if (state) cout << YES n ; else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b; cin >> n; while (n--) { cin >> a >> b; if (a != b) { cout << Happy Alex << endl; return 0; } } cout << Poor Alex << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int cand_sums[n]; memset(cand_sums, 0, sizeof cand_sums); vector<vector<int>> votes = vector<vector<int>>(m, vector<int>(n, 0)); vector<priority_queue<pair<int, int>>> bad_stations = vector<priority_queue<pair<int, int>>>(n, priority_queue<pair<int, int>>()); int in; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cin >> in; cand_sums[j] += in; votes[i][j] = in; if (j == n - 1) { for (int k = 0; k < j; k++) { bad_stations[k].push(pair<int, int>(in - votes[i][k], i)); } } } } vector<vector<int>> killed_stations = vector<vector<int>>(n - 1, vector<int>()); for (int i = 0; i < n - 1; i++) { while (!bad_stations[i].empty() && cand_sums[i] < cand_sums[n - 1]) { pair<int, int> curr = bad_stations[i].top(); bad_stations[i].pop(); cand_sums[i] += curr.first; killed_stations[i].push_back(curr.second); } } int best = 0; int best_size = m + 1; for (int i = 1; i < n - 1; i++) { if (killed_stations[i].size() < best_size) { best = i; best_size = killed_stations[i].size(); } } cout << killed_stations[best].size() << endl; for (int i = 0; i < killed_stations[best].size(); i++) { if (i > 0) cout << ; cout << killed_stations[best][i] + 1; } if (!killed_stations[best].empty()) cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t, a, b; string s; scanf( %lld , &t); vector<int> v; while (t--) { v.clear(); scanf( %lld%lld , &a, &b); cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == 0 ) v.push_back(i); } int w = -1; for (int i = 0; i < v.size(); i++) { if (b > v[i] - w - 1) { b = b - (v[i] - w - 1); v[i] = w + 1; w = v[i]; } else { v[i] = v[i] - b; break; } } v.push_back(1000025); int k = 0; for (int i = 0; i < a; i++) { if (i == v[k]) { cout << 0 ; k++; } else { cout << 1 ; } } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 200005; long long const mod = 1000 * 1000 * 1000 + 7; map<string, long long> m; string s[N]; int main() { int a; cin >> a; if (a < 6) printf( -1 n ); else { printf( 1 2 n1 3 n1 4 n ); for (int i = 5; i <= a; i++) printf( 2 %d n , i); } for (int i = 1; i < a; i++) printf( %d %d n , i, i + 1); return 0; } |
#include <bits/stdc++.h> int main() { int x, y, z; while (scanf( %d%d , &x, &y) == 2) { z = abs(x) + abs(y); if (x > 0) { if (y > 0) printf( 0 %d %d 0 n , z, z); else printf( 0 -%d %d 0 n , z, z); } else { if (y > 0) printf( -%d 0 0 %d n , z, z); else printf( -%d 0 0 -%d n , z, z); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a1, a2, a3, a4; int main() { scanf( %d%d%d%d , &a1, &a2, &a3, &a4); if (min(a1, a2) < max(a3, a4)) { puts( -1 ); return 0; } if (a1 + a2 == a3 + a4) { puts( -1 ); return 0; } if (a3 - a4 == 1) { int n = a3; for (int i = 1; i <= a1 - n + 1; ++i) { putchar( 4 ); } for (int i = 1; i < n; ++i) { putchar( 7 ); putchar( 4 ); } for (int i = 1; i <= a2 - n + 1; ++i) { putchar( 7 ); } return 0; } if (a3 == a4) { int n = a3 + 1; if (a1 >= n) { for (int i = 1; i <= a1 - n + 1; ++i) { putchar( 4 ); } for (int i = 1; i < n - 1; ++i) { putchar( 7 ); putchar( 4 ); } for (int i = 1; i <= a2 - n + 2; ++i) { putchar( 7 ); } putchar( 4 ); return 0; } else { for (int i = 1; i < n; ++i) { putchar( 7 ); putchar( 4 ); } for (int i = 1; i <= a2 - n + 1; ++i) { putchar( 7 ); } return 0; } } if (a4 - a3 == 1) { int n = a4; putchar( 7 ); for (int i = 1; i <= a1 - n + 1; ++i) { putchar( 4 ); } for (int i = 1; i < n - 1; ++i) { putchar( 7 ); putchar( 4 ); } for (int i = 1; i <= a2 - n + 1; ++i) { putchar( 7 ); } putchar( 4 ); return 0; } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int p[5007][5007]; int pre[5007]; int a, b, c, ans, res, del; int solve(int x, int y) { res = 0; for (int i = 0; i <= x && i <= y; i++) { del = pre[i]; del = (1LL * del * p[x][i]) % 998244353; del = (1LL * del * p[y][i]) % 998244353; res = (res + del) % 998244353; } return res; } int main() { cin >> a >> b >> c; memset(p, 0, sizeof(p)); p[0][0] = 1; for (int i = 1; i <= 5000; i++) { p[i][0] = 1; for (int j = 1; j <= i; j++) p[i][j] = (p[i - 1][j - 1] + p[i - 1][j]) % 998244353; } memset(pre, 0, sizeof(pre)); pre[0] = 1; for (int i = 1; i <= 5000; i++) pre[i] = (1LL * pre[i - 1] * i) % 998244353; ans = 1; ans = (1LL * ans * solve(a, b)) % 998244353; ans = (1LL * ans * solve(b, c)) % 998244353; ans = (1LL * ans * solve(a, c)) % 998244353; cout << ans; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) using namespace std; inline int read() { int x = 0, neg = 1; char op = getchar(); while (!isdigit(op)) { if (op == - ) neg = -1; op = getchar(); } while (isdigit(op)) { x = 10 * x + op - 0 ; op = getchar(); } return neg * x; } inline void print(int x) { if (x < 0) { putchar( - ); x = -x; } if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } const int N = 1000005; vector<int> adj[N]; void add(int u, int v) { adj[u].push_back(v); } int n; int heavy[N], len[N]; void dfs1(int u, int fa) { for (auto v : adj[u]) { if (v == fa) continue; dfs1(v, u); if (len[v] > len[heavy[u]]) heavy[u] = v; } len[u] = len[heavy[u]] + 1; } int *f[N], tmp[N], *id = tmp, ans[N]; void dfs2(int u, int fa) { f[u][0] = 1; if (heavy[u]) { f[heavy[u]] = f[u] + 1; dfs2(heavy[u], u); ans[u] = ans[heavy[u]] + 1; } for (auto v : adj[u]) { if (v == fa || v == heavy[u]) continue; f[v] = id, id += len[v]; dfs2(v, u); for (register int j = 1; j <= len[v]; j++) { f[u][j] += f[v][j - 1]; if ((j < ans[u] && f[u][j] >= f[u][ans[u]]) || (j > ans[u] && f[u][j] > f[u][ans[u]])) { ans[u] = j; } } } if (f[u][ans[u]] == 1) { ans[u] = 0; } } int main() { n = read(); for (register int i = 1; i < n; i++) { int u = read(), v = read(); add(u, v), add(v, u); } int root = 1; dfs1(root, 0); f[1] = id, id += len[1]; dfs2(root, 0); for (register int i = 1; i <= n; i++) { printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, a[303], flipped[303]; int query(int l, int r) { cout << ? << l << << r << endl; cin >> l; fflush(stdin); return l; } void flip(int l, int r) { for (int i = l; i < r + 1; i++) { flipped[i] ^= 1; } } void sol(int l, int r, int segk, bool f) { if (l > r) return; int lc = 0, rc = 0; for (int i = 1; i < l; i++) lc += a[i] ^ flipped[i]; for (int i = r + 1; i < n + 1; i++) rc += a[i] ^ flipped[i]; if (l == r) a[l] = flipped[l] ^ segk; else if (f) { while (1) { int q = query(l, r - 1); if (lc + n - r - rc + r - l + 1 - segk == q) { segk = r - l + 1 - segk; rc = n - r - rc; flip(l, n); } else { int g = (q + 1 + lc + segk - r - rc) / 2; a[r] = flipped[r] ^ g; lc = l - 1 - lc; segk = r - l - segk + 2 * g; flip(1, r - 1); sol(l, r, segk, !f); return; } } } else { while (1) { int q = query(l + 1, r); if (l - 1 - lc + rc + r - l + 1 - segk == q) { segk = r - l + 1 - segk; lc = l - 1 - lc; flip(1, r); } else { int g = (q + rc + l + segk - n - lc) / 2; a[l] = flipped[l] ^ g; rc = n - r - rc; segk = r - l - segk + g; flip(l + 1, n); sol(l + 1, r - 1, segk - (a[r] ^ flipped[r]), !f); return; } } } } void disp() { cout << ! ; for (int i = 1; i < n + 1; i++) cout << a[i]; cout << endl; } void solve() { cin >> n >> k; sol(1, n, k, 1); disp(); } signed main() { int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[310], g[310][310], use[310]; int tm; void add(int x, int y) { g[x][y] = g[y][x] = 1; tm++; } int main() { int n, m, K; scanf( %d%d%d , &n, &m, &K); for (int i = 0; i < K; i++) { scanf( %d , &a[i]); use[a[i]] = 1; } sort(a, a + K); memset(g, 0, sizeof(g)); int ck = -1; for (int i = 1; i <= n; i++) if (!use[i]) ck = i; if (ck == -1) { puts( -1 ); return 0; } tm = 0; add(a[0], ck); add(ck, a[1]); for (int i = 1; i < K - 1; i++) add(a[i], a[i + 1]); int pre = a[K - 1]; for (int i = 1; i <= n; i++) { if (use[i]) continue; if (i == ck) continue; add(pre, i); pre = i; } for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) { if (g[i][j] == 1) continue; if (tm == m) continue; if (i == a[0] && j == a[1]) continue; if (i == a[0] || j == a[0]) { int ti; if (i == a[0]) ti = j; else ti = i; if (use[ti] && g[ti][a[1]]) continue; } if (i == a[1] || j == a[1]) { int ti; if (i == a[1]) ti = j; else ti = i; if (use[ti] && g[ti][a[0]]) continue; } add(i, j); } if (tm != m) { puts( -1 ); return 0; } for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (g[i][j]) printf( %d %d n , i, j); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<long long> > mul(const vector<vector<long long> > &a, const vector<vector<long long> > &b, const long long &mod) { int R1 = a.size(), C1 = a.front().size(); int R2 = b.size(), C2 = b.front().size(); if (C1 != R2) return vector<vector<long long> >(); vector<vector<long long> > result(R1, vector<long long>(C2, 0)); for (int i = 0; i < R1; ++i) { for (int j = 0; j < C2; ++j) { for (int k = 0; k < C1; ++k) { result[i][j] += a[i][k] * b[k][j] % mod; result[i][j] %= mod; } } } return result; } int main() { vector<vector<long long> > transformer = { {2, 1, 1, 0, 1, 1}, {1, 2, 0, 1, 1, 1}, {1, 1, 1, 0, 1, 1}, {1, 1, 0, 1, 1, 1}, {0, 0, 0, 0, 1, 1}, {0, 0, 0, 0, 0, 1}}; vector<vector<long long> > base(6, vector<long long>(1)); long long n, t; cin >> n; for (int i = 0; i < 4; ++i) { cin >> base[i][0]; base[i][0] = (base[i][0] % n + n) % n; } cin >> t; base[0][0]--; base[1][0]--; base[4][0] = base[5][0] = 1; vector<vector<long long> > result(6, vector<long long>(6, 0)); for (int i = 0; i < 6; ++i) result[i][i] = 1; while (t) { if (t & 1) result = mul(result, transformer, n); transformer = mul(transformer, transformer, n); t >>= 1; } result = mul(result, base, n); cout << result[0][0] + 1 << << result[1][0] + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool prime(long long n) { for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } int main() { string s, s1; long long a, b, c, m, n, k, t, l, d, p, nl, np; t = 1; while (t--) { cin >> n >> d; vector<long long> arr(n); long long sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } if (sum + (n - 1) * 10 > d) cout << -1 << endl; else { cout << (n - 1) * 2 + (d - (sum + (n - 1) * 10)) / 5 << endl; } } } |
#include <bits/stdc++.h> int main() { int n; std::cin >> n; std::vector<int> a(n); std::vector<int> mn(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } mn[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; --i) { if (a[i] < mn[i + 1]) { mn[i] = a[i]; } else { mn[i] = mn[i + 1]; } } for (int i = 0; i < n; ++i) { int left = i; int right = n - 1; int val = a[i]; while (left != right) { int mid = (left + right + 1) / 2; if (mn[mid] < val) { left = mid; } else { right = mid - 1; } } std::cout << right - i - 1 << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, dp[500005]; pair<int, int> p[500005]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d%d , &p[i].first, &p[i].second); sort(p, p + n); for (int i = 0; i < n; ++i) { if (i) dp[i] = max(dp[i], dp[i - 1]); int ub = upper_bound(p + i + 1, p + n, make_pair(p[i].second + 1, 0)) - p; dp[ub] = max(dp[ub], dp[i] + 1); } printf( %d n , max(dp[n], dp[n - 1])); } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long sum = 0, ff = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) ff = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) sum = sum * 10 + ch - 0 , ch = getchar(); return sum * ff; } const int N = 100007; const int block = 500; int n, m, a_st[N], a[N], x, y, num, belong[N], st[N / block + 7], ed[N / block + 7], col[N], sum[N / block + 7][N * 2], tag[N / block + 7], ans; struct edge { int to, nxt; } e[N]; int cnt, he[N]; void add(int u, int v) { e[++cnt].to = v; e[cnt].nxt = he[u]; he[u] = cnt; } int deep[N], siz[N], fa[N], son[N], dfs_cnt, dfn[N], top[N]; void dfs1(int u, int fat) { deep[u] = deep[fat] + 1; siz[u] = 1; fa[u] = fat; for (int i = he[u]; i; i = e[i].nxt) { int v = e[i].to; if (v == fat) continue; dfs1(v, u); siz[u] += siz[v]; if (siz[v] > siz[son[u]]) son[u] = v; } } void dfs2(int u, int tp) { top[u] = tp; dfn[u] = ++dfs_cnt; if (!son[u]) return; dfs2(son[u], tp); for (int i = he[u]; i; i = e[i].nxt) { int v = e[i].to; if (top[v]) continue; dfs2(v, v); } } void build() { for (int i = 1; i <= n; i++) belong[i] = (i - 1) / block + 1; num = belong[n]; for (int i = 1; i <= num; i++) st[i] = (i - 1) * block + 1, ed[i] = i * block; ed[num] = n; } void change(int x, int y) { col[x] ^= 1; if (a[x] >= n + 1 - tag[belong[x]]) ans -= y; sum[belong[x]][a[x]] -= y; } void upd(int l, int r, int val) { for (int i = l; i <= r; i++) { if (!col[i] && a[i] >= n + 1 - tag[belong[i]]) ans--; if (!col[i]) sum[belong[i]][a[i]]--; a[i] += val; if (!col[i]) sum[belong[i]][a[i]]++; if (!col[i] && a[i] >= n + 1 - tag[belong[i]]) ans++; } } void modify(int l, int r, int val) { if (belong[l] == belong[r]) { upd(l, r, val); return; } upd(l, ed[belong[l]], val), upd(st[belong[r]], r, val); for (int i = belong[l] + 1; i < belong[r]; i++) { if (val == 1) tag[i]++, ans += sum[i][n + 1 - tag[i]]; else ans -= sum[i][n + 1 - tag[i]], tag[i]--; } } int main() { n = read(), m = read(); for (int i = 2; i <= n; i++) fa[i] = read(), add(fa[i], i); for (int i = 1; i <= n; i++) a_st[i] = read(); dfs1(1, 0); dfs2(1, 1); for (int i = 1; i <= n; i++) a[dfn[i]] = n - a_st[i]; build(); for (int i = 1; i <= n; i++) sum[belong[i]][a[i]]++; for (int i = 1; i <= m; i++) { x = read(); y = (x > 0) ? 1 : -1; x = abs(x); change(dfn[x], y); while (x) { modify(dfn[top[x]], dfn[x], y); x = fa[top[x]]; } cout << ans << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> arr[3001]; const long long int INF = 1000000000000000; int n; long long int dp[3001][3001]; long long int solve(int pos, int prev) { if (pos > n) return 0; if (dp[pos][prev] != -INF) return dp[pos][prev]; long long int pin = arr[pos].second + solve(pos + 1, pos); long long int unpin = abs(arr[prev].first - arr[pos].first) + solve(pos + 1, prev); return dp[pos][prev] = min(pin, unpin); } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> arr[i].first >> arr[i].second; } sort(arr + 1, arr + n + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) dp[i][j] = -INF; } long long int ans = arr[1].second + solve(2, 1); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; char ch[100]; int main() { scanf( %d , &n); int l = 0, r = 1e9; for (int i = 1; i <= min(29, n); i++) { int mid = (l + r) >> 1; printf( %d %d n , mid, 1); fflush(stdout); scanf( %s , ch); if (ch[0] == b ) l = mid; else r = mid; } if (n <= 29) { printf( %d %d %d %d n , l, 2, r, 0); } else { printf( %d %d n , l, 10); fflush(stdout); scanf( %s , ch); if (ch[0] == b ) printf( %d %d %d %d n , l, 0, r, 2); else printf( %d %d %d %d n , l, 2, r, 0); } fflush(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1005; double dis(long u, long v, long p, long q) { return sqrt(((double)u - p) * (u - p) + ((double)q - v) * (q - v)); } struct point { int x; int y; }; int main() { int n, m; cin >> n >> m; if (n == 0) { cout << 0 << << 1 << endl; cout << 0 << << m << endl; cout << 0 << << 0 << endl; cout << 0 << << m - 1 << endl; return 0; } if (m == 0) { cout << 1 << << 0 << endl; cout << n << << 0 << endl; cout << 0 << << 0 << endl; cout << n - 1 << << 0 << endl; return 0; } double tam1 = 2 * dis(0, 0, n - 1, m); double tam2 = 2 * dis(0, 0, n, m - 1); double tam3 = sqrt(double(m) * m + double(n) * n) + max(m, n); if (tam3 >= tam1 && tam3 >= tam2) { cout << 0 << << 0 << endl; cout << n << << m << endl; if (n > m) { cout << 0 << << m << endl; cout << n << << 0 << endl; } else { cout << n << << 0 << endl; cout << 0 << << m << endl; } return 0; } if (n <= m) { cout << n - 1 << << m << endl; cout << 0 << << 0 << endl; cout << n << << m << endl; cout << 1 << << 0 << endl; } else { cout << n << << m - 1 << endl; cout << 0 << << 0 << endl; cout << n << << m << endl; cout << 0 << << 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-10; const int M = 1e9 + 7; int dcmp(double first) { if (fabs(first) < eps) return 0; return first < 0 ? -1 : 1; } int a[N]; int main() { int n, f = 0; scanf( %d , &n); for (int i = 0; i <= n; i++) { scanf( %d , &a[i]); if (i && a[i] > 1 && a[i - 1] > 1) f = 1; } printf( %s n , f ? ambiguous : perfect ); for (int l = 0; l < 2 && f; l++) { int p = 0, p0 = 0, cnt = 1; for (int i = 0; i <= n; i++) { int p1 = 0, p2 = 0; for (int k = 0; k < a[i]; k++) { if (!k) p1 = cnt; if (l && k == 1) p2 = cnt; if (l && !k && p0) printf( %d , p0); else printf( %d , p); cnt++; } p = p1; p0 = p2; } puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; bool onSegment(pair<int, int> p, pair<int, int> q, pair<int, int> r) { if (q.first <= max(p.first, r.first) && q.first >= min(p.first, r.first) && q.second <= max(p.second, r.second) && q.second >= min(p.second, r.second)) return true; return false; } int orientation(pair<int, int> p, pair<int, int> q, pair<int, int> r) { int val = (q.second - p.second) * (r.first - q.first) - (q.first - p.first) * (r.second - q.second); if (val == 0) return 0; return (val > 0) ? 1 : 2; } bool intersect(pair<int, int> p1, pair<int, int> q1, pair<int, int> p2, pair<int, int> q2) { int o1 = orientation(p1, q1, p2); int o2 = orientation(p1, q1, q2); int o3 = orientation(p2, q2, p1); int o4 = orientation(p2, q2, q1); if (o1 != o2 && o3 != o4) return true; if (o1 == 0 && onSegment(p1, p2, q1)) return true; if (o2 == 0 && onSegment(p1, q2, q1)) return true; if (o3 == 0 && onSegment(p2, p1, q2)) return true; if (o4 == 0 && onSegment(p2, q1, q2)) return true; return false; } float area(int x1, int y1, int x2, int y2, int x3, int y3) { return abs((x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 2.0); } bool check(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4, int x, int y) { float A = area(x1, y1, x2, y2, x3, y3) + area(x1, y1, x4, y4, x3, y3); float A1 = area(x, y, x1, y1, x2, y2); float A2 = area(x, y, x2, y2, x3, y3); float A3 = area(x, y, x3, y3, x4, y4); float A4 = area(x, y, x1, y1, x4, y4); return (A == A1 + A2 + A3 + A4); } int main() { int a, b, c = 0, c1 = 0; vector<pair<int, int> > v1, v2; for (int i = 0; i < 4; i++) { cin >> a >> b; v1.push_back(pair<int, int>(a, b)); } for (int i = 0; i < 4; i++) { cin >> a >> b; v2.push_back(pair<int, int>(a, b)); } for (int i = 0; i < 4; i++) { if (check(v1[0].first, v1[0].second, v1[1].first, v1[1].second, v1[2].first, v1[2].second, v1[3].first, v1[3].second, v2[i].first, v2[i].second)) c++; } for (int i = 0; i < 4; i++) { if (check(v2[0].first, v2[0].second, v2[1].first, v2[1].second, v2[2].first, v2[2].second, v2[3].first, v2[3].second, v1[i].first, v1[i].second)) c1++; } if (c == 4 || c1 == 4) { cout << YES ; } else { c = 0; for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { if (intersect(v1[i], v1[(i + 1) % 4], v2[j], v2[(j + 1) % 4])) c++; } } if (c != 0) cout << YES ; else cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; const int maxm = 100010; struct Arc { int to, next; } arcs[maxm]; int head[maxn], ne, out[maxn], ans[maxn]; inline void add_arc(int u, int v); priority_queue<int> Q; int main() { int n, m, i, u, v, k; while (scanf( %d%d , &n, &m) > 0) { memset(head, -1, sizeof(int) * (n + 1)); ne = 0; memset(out, 0, sizeof(int) * (n + 1)); for (i = 0; i < m; i++) { scanf( %d%d , &u, &v); add_arc(v, u); out[u]++; } while (!Q.empty()) Q.pop(); for (i = 1; i <= n; i++) { if (out[i] == 0) Q.push(i); } for (k = n; k >= 1; k--) { u = Q.top(); Q.pop(); ans[u] = k; for (i = head[u]; i != -1; i = arcs[i].next) { v = arcs[i].to; if (--out[v] == 0) Q.push(v); } } for (i = 1; i <= n; i++) printf( %d , ans[i]); printf( n ); } return 0; } inline void add_arc(int u, int v) { arcs[ne].to = v; arcs[ne].next = head[u]; head[u] = ne++; return; } |
#include <bits/stdc++.h> using namespace std; int main() { int z[6] = {1, 0, 0, 1, 2, 2}; int r[6] = {2, 2, 1, 0, 0, 1}; int l[6] = {0, 1, 2, 2, 1, 0}; long long int m, n, num; while (cin >> m >> n) { num = m % 6; if (z[num] == n) { cout << 1 << endl; } else if (r[num] == n) { cout << 2 << endl; } else { cout << 0 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 1005; const int oo = 1000000000; const long long Base = 1000000007; typedef int Tarr[MaxN]; long long x, y, a, b, n, m, xx, yy, r1, r2, r3, r4; void Ok(int Val) { int xx = Val * a, yy = Val * b; if (xx % 2 == 0) { r1 = max((long long)0, min(n - xx, x - xx / 2)); } else r1 = max((long long)0, min(n - xx, x - xx / 2 - 1)); if (yy % 2 == 0) { r2 = max((long long)0, min(m - yy, y - yy / 2)); } else r2 = max((long long)0, min(m - yy, y - yy / 2 - 1)); r3 = r1 + xx; r4 = r2 + yy; } int main() { cin >> n >> m >> x >> y >> a >> b; int aa = a, bb = b, tmp; do { tmp = aa % bb; aa = bb; bb = tmp; } while (bb != 0); a /= aa; b /= aa; Ok(min((n) / a, (m) / b)); cout << r1 << << r2 << << r3 << << r4; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000 + 13; bool flagBlack = false, flagWhite = false; int a[N]; int n; int lacesB[N]; int lacesW[N]; inline void read() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 0) { flagBlack = true; } else { flagWhite = true; } } } inline void solve() { if (!flagBlack || !flagWhite) { cout << YES << endl; return; } int mincnt = 100 * 1000 + 13; int maxcnt = -100 * 1000 + 13; int cnt = 0; for (int i = 0; i < n; i++) { if (i > 0) { if (a[i] != a[i - 1]) { if (cnt > maxcnt) { maxcnt = cnt; } if (cnt < mincnt) { mincnt = cnt; } cnt = 0; } } cnt++; } if (cnt > maxcnt) { maxcnt = cnt; } if (cnt < mincnt) { mincnt = cnt; } if (mincnt == maxcnt) { cout << YES << endl; } else { cout << NO << endl; } } int main() { read(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MAXN = 1e2 + 20; long long n, w, ans[MAXN]; pair<long long, long long> a[MAXN]; long long sa(long long n, long long k) { if (n % k) return n / k + 1; return n / k; } void fail() { cout << -1; exit(0); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> w; long long kol = 0; for (long long i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; kol += sa(a[i].first, 2); } if (kol > w) fail(); sort(a, a + n); for (long long i = 0; i < n - 1; i++) { ans[a[i].second] = sa(a[i].first, 2); w -= ans[a[i].second]; } if (w > a[n - 1].first) { w -= a[n - 1].first; ans[a[n - 1].second] = a[n - 1].first; for (long long i = n - 2; i >= 0; i--) { if (w > a[i].first - ans[a[i].second]) { w -= a[i].first - ans[a[i].second]; ans[a[i].second] = a[i].first; } else { ans[a[i].second] += w; break; } } } else { ans[a[n - 1].second] = w; } for (long long i = 0; i < n; i++) cout << ans[i] << ; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.