func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int prime[MAXN + 1]; void getPrime() { memset(prime, 0, sizeof(prime)); for (int i = 2; i <= MAXN; i++) { if (!prime[i]) prime[++prime[0]] = i; for (int j = 1; j <= prime[0] && prime[j] <= MAXN / i; j++) { prime[prime[j] * i] = 1; if (i % prime[j] == 0) break; } } } unordered_map<int, bool> Mcnt; unordered_map<int, int> M; const int maxn = 105; int a[maxn]; int getsg(int S) { if (S == 0) return 0; if (M.count(S)) return M[S]; vector<int> V; V.clear(); for (int i = 0; i < 29; i++) if (S & (1 << i)) V.push_back(i + 1); int ma = 0; for (int i = 0; i < V.size(); i++) ma = max(ma, V[i]); int x[30]; set<int> pre; pre.clear(); for (int i = 1; i <= ma; i++) { for (int j = 0; j < V.size(); j++) { if (V[j] >= i) x[j] = V[j] - i; else x[j] = V[j]; } int SS = 0; for (int j = 0; j < V.size(); j++) { if (x[j]) SS |= (1 << (x[j] - 1)); } pre.insert(getsg(SS)); } int now = 0; while (pre.count(now)) now++; M[S] = now; return now; } int cnt[maxn]; int main() { getPrime(); int ans = 0; int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= prime[0]; i++) { memset(cnt, 0, sizeof(cnt)); for (int j = 1; j <= n; j++) { while (a[j] % prime[i] == 0) { a[j] /= prime[i]; cnt[j]++; } } int S = 0; for (int j = 1; j <= n; j++) if (cnt[j]) S |= (1 << (cnt[j] - 1)); ans ^= getsg(S); } for (int i = 1; i <= n; i++) if (a[i] != 1) { if (!Mcnt.count(a[i])) { ans ^= 1; Mcnt[a[i]] = true; } } if (ans == 0) printf( Arpa ); else printf( Mojtaba ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; vector<vector<int>> v; vector<int> cur; if ((n * m) % k == 0) { int div = (n * m) / k; for (int i = 0; i < n; i++) { if (!(i & 1)) { for (int j = 0; j < m; j++) { cur.push_back(i + 1); cur.push_back(j + 1); if (cur.size() >= div * 2) { vector<int> add = cur; v.push_back(add); cur.clear(); } } } else { for (int j = m - 1; j >= 0; j--) { if (cur.size() <= div * 2) { cur.push_back(i + 1); cur.push_back(j + 1); } if (cur.size() >= div * 2) { vector<int> add = cur; v.push_back(add); cur.clear(); } } } } } else { int div = ((n * m) - 2) / (k - 1); int count = 0; int flag = 0; for (int i = 0; i < n; i++) { if (!(i & 1)) { for (int j = 0; j < m; j++) { if (count == k - 1 && flag == 0) { div = (n * m - (k - 1) * (div)); flag = 1; } cur.push_back(i + 1); cur.push_back(j + 1); if (cur.size() >= div * 2) { vector<int> add = cur; v.push_back(add); cur.clear(); count++; } } } else { for (int j = m - 1; j >= 0; j--) { if (count == k - 1 && flag == 0) { div = (n * m - (k - 1) * (div)); flag = 1; } if (cur.size() <= div * 2) { cur.push_back(i + 1); cur.push_back(j + 1); } if (cur.size() >= div * 2) { vector<int> add = cur; v.push_back(add); cur.clear(); count++; } } } } } for (int i = 0; i < v.size(); i++) { int s = v[i].size(); s /= 2; cout << s << ; for (int j = 0; j < v[i].size(); j++) { cout << v[i][j] << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 7; int n; int v[N], f[N]; bool e[N]; int st, dr; bool ok(int l, int r) { for (int i = 1; i <= n; i++) { e[i] = 0; f[i] = 0; } for (int i = l; i <= r; i++) { e[i] = 1; f[v[i]]++; } for (int i = 1; i < n + 1 - i; i++) { if (e[i] == 1 && e[n + 1 - i] == 0) { if (f[v[n + 1 - i]] > 0) { f[v[n + 1 - i]]--; } else { return 0; } } if (e[i] == 0 && e[n + 1 - i] == 1) { if (f[v[i]] > 0) { f[v[i]]--; } else { return 0; } } if (e[i] == 0 && e[n + 1 - i] == 0 && v[i] != v[n + 1 - i]) { return 0; } } int cntimp = 0; for (int i = 1; i <= n; i++) { if (f[i] % 2 == 1) { cntimp++; } } return (cntimp <= 1); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> v[i]; f[v[i]]++; } int imp = 0; for (int i = 1; i <= n; i++) { if (f[i] % 2 == 1) { imp++; } } if (imp >= 2) { cout << 0 n ; return 0; } bool pali = 1; for (int i = 1; i < n + 1 - i; i++) { if (v[i] != v[n + 1 - i]) { pali = 0; } } if (pali) { long long res = n * (long long)(n + 1) >> 1; cout << res << n ; return 0; } st = 1; dr = n; while (v[st] == v[dr]) { st++; dr--; } int lo = st; int hi = dr; int prf = -1, suf = -1; while (lo <= hi) { int mid = (lo + hi) >> 1; if (ok(st, mid)) { prf = mid; hi = mid - 1; } else { lo = mid + 1; } } lo = 1; hi = n; while (lo <= hi) { int mid = (lo + hi) >> 1; if (ok(mid, dr)) { suf = mid; lo = mid + 1; } else { hi = mid - 1; } } int cntgood = 0; if (prf != -1) { cntgood += (dr - prf + 1); } if (suf != -1) { cntgood += (suf - st + 1); } long long res = cntgood * (long long)st - 1 + (st - 1LL) * (long long)(st - 1LL); cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a1, a2, b1, b2, c1, c2; void rec(long long p, long long q) { long long mod = c1 * c1 + c2 * c2; if ((p * c1 + q * c2) % mod == 0 && (q * c1 - p * c2) % mod == 0) { puts( YES ); exit(0); } } int main() { scanf( %I64d%I64d%I64d%I64d%I64d%I64d , &a1, &a2, &b1, &b2, &c1, &c2); if (c1 == 0 && c2 == 0) { if ((a1 == b1 && a2 == b2) || (a1 == -b1 && a2 == -b2) || (a1 == b2 && a2 == -b1) || (a1 == -b2 && a2 == b1)) puts( YES ); else puts( NO ); return 0; } rec(b1 - a1, b2 - a2); rec(b1 + a1, b2 + a2); rec(b1 + a2, b2 - a1); rec(b1 - a2, b2 + a1); puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int l, r, x, y; double k; cin >> l >> r >> x >> y >> k; bool flag = false; double value; while (x <= y) { value = (double)x * k; if (value >= l && value <= r) { flag = true; break; } x++; } if (flag) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 500005; const int inf = 1000 * 1000 * 1000; const int mod = 998244353; int n; vector<int> g[N]; int dp[N][3]; int sz[N][3]; void dfs(int v, int p) { dp[v][0] = dp[v][1] = 0; sz[v][0] = 1; sz[v][1] = 0; for (int i = 0; i < (int)g[v].size(); i++) { int to = g[v][i]; if (to == p) continue; dfs(to, v); int d0 = dp[v][0] * 1ll * (sz[to][0] + sz[to][1]) % mod + (dp[to][0] + dp[to][1]) * 1ll * sz[v][0] % mod; d0 %= mod; int s0 = sz[v][0] * 1ll * (sz[to][0] + sz[to][1]) % mod; int d1 = dp[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod + (dp[to][0] + dp[to][1]) * 1ll * sz[v][1] % mod; d1 %= mod; int s1 = sz[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod; int dd0 = dp[v][0] * 1ll * sz[to][1] % mod + dp[to][1] * 1ll * sz[v][0] % mod; dd0 %= mod; int ss0 = sz[v][0] * 1ll * sz[to][1] % mod; int dd1 = dp[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod + (dp[to][0] + dp[to][1]) * 1ll * sz[v][1] % mod; dd1 %= mod; dd1 += dp[v][0] * 1ll * sz[to][0] % mod; dd1 %= mod; dd1 += sz[v][0] * 1ll * dp[to][0] % mod; dd1 %= mod; int ss1 = sz[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod + sz[v][0] * 1ll * sz[to][0] % mod; ss1 %= mod; dd1 += sz[v][0] * 1ll * sz[to][0] % mod; dd1 %= mod; dp[v][0] = (d0 + dd0) % mod; sz[v][0] = (s0 + ss0) % mod; dp[v][1] = (d1 + dd1) % mod; sz[v][1] = (s1 + ss1) % mod; } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int a, b; scanf( %d%d , &a, &b); g[a].push_back(b); g[b].push_back(a); } dfs(1, -1); int answ = (dp[1][0] + dp[1][1]) % mod; answ *= 2; answ %= mod; cout << answ << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct Tpoint { double x, y; } v[200], pg[200]; struct Tline { Tpoint a, b; } ls[200]; int n, tot, q[200], ord[200]; double at2[200]; double getdouble() { double d = 0, d2, d3; char ch = ; bool flag = false; while (!isdigit(ch = getchar())) if (ch == - ) break; if (ch == - ) flag = 1; else d = ch - 48; while (isdigit(ch = getchar())) d = d * 10 + ch - 48; if (ch == - ) { d2 = 0; d3 = 1; while (isdigit(ch = getchar())) d2 = d2 * 10 + ch - 48, d3 /= 10; d += d2 * d3; } if (flag) return -d; else return d; } void init() { int i, w, h; double angle; n = 4; scanf( %d%d%lf , &w, &h, &angle); v[1].x = (double)w / 2; v[1].y = -(double)h / 2; v[2].x = (double)w / 2; v[2].y = (double)h / 2; v[3].x = -(double)w / 2; v[3].y = (double)h / 2; v[4].x = -(double)w / 2; v[4].y = -(double)h / 2; for (int i = 1; i < n; i++) ls[i].a = v[i], ls[i].b = v[i + 1]; ls[n].a = v[n]; ls[n].b = v[1]; angle = angle * 3.1415926535897932384626433832795 / 180; for (i = 1; i <= 4; i++) { v[i + n].x = v[i].x * cos(angle) - v[i].y * sin(angle); v[i + n].y = v[i].x * sin(angle) + v[i].y * cos(angle); } for (int i = 1; i < n; i++) ls[n + i].a = v[n + i], ls[n + i].b = v[n + i + 1]; ls[n + n].a = v[n + n]; ls[n + n].b = v[n + 1]; n = n + n; } int sig(double d) { return d < -1e-8 ? -1 : d > 1e-8; } double multi(Tpoint p0, Tpoint p1, Tpoint p2) { return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y); } int cmp(const void *a, const void *b) { int p1 = *(int *)a, p2 = *(int *)b; if (sig(at2[p1] - at2[p2]) == 0) { return -sig(multi(ls[p2].a, ls[p2].b, ls[p1].b)); } else return sig(at2[p2] - at2[p1]); } Tpoint ispoint(Tline l1, Tline l2) { double dot1, dot2; Tpoint I; dot1 = multi(l2.a, l1.b, l1.a); dot2 = multi(l1.b, l2.b, l1.a); I.x = (l2.a.x * dot2 + l2.b.x * dot1) / (dot1 + dot2); I.y = (l2.a.y * dot2 + l2.b.y * dot1) / (dot1 + dot2); return I; } bool judgein(int x, int y, int z) { Tpoint pnt = ispoint(ls[x], ls[y]); return sig(multi(ls[z].a, ls[z].b, pnt)) < 0; } void halfplane() { int i, tmp, front, rear; for (i = 1; i <= n; i++) { at2[i] = atan2(ls[i].b.y - ls[i].a.y, ls[i].b.x - ls[i].a.x); ord[i] = i; } qsort(ord + 1, n, sizeof(int), cmp); for (i = 2, tmp = 1; i <= n; i++) { if (sig(at2[ord[i]] - at2[ord[i - 1]]) != 0) ord[++tmp] = ord[i]; } front = 1; rear = 2; q[1] = ord[1]; q[2] = ord[2]; for (i = 3; i <= tmp; i++) { while (front < rear && judgein(q[rear - 1], q[rear], ord[i])) rear--; while (front < rear && judgein(q[front + 1], q[front], ord[i])) front++; q[++rear] = ord[i]; } while (front < rear && judgein(q[rear - 1], q[rear], q[front])) rear--; while (front < rear && judgein(q[front + 1], q[front], q[rear])) front++; q[--front] = q[rear]; tot = 0; for (i = front + 1; i <= rear; i++) { pg[++tot] = ispoint(ls[q[i - 1]], ls[q[i]]); } } void work() { halfplane(); int i; double ans = 0; for (i = 1; i < tot; i++) { ans += multi(pg[1], pg[i], pg[i + 1]); } ans += multi(pg[1], pg[tot], pg[1]); ans /= 2; if (fabs(ans) > 0) printf( %.8lf , fabs(ans)); else printf( 0.0 ); } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[200005]; int b[200005]; int c[200005]; char str1[200005]; char str2[200005]; int main() { int n; while (scanf( %d , &n) != EOF) { cin >> str1 >> str2; int i; for (i = 0; i < n; i++) { a[i] = str1[i] - a ; b[i] = str2[i] - a ; } for (i = n - 1; i >= 0; i--) { if (b[i] >= a[i]) { c[i] = b[i] - a[i]; } else { c[i] = b[i] - a[i] + 26; b[i - 1]--; } } for (i = 0; i < n; i++) { if (c[i] % 2 == 0) { c[i] = c[i] / 2; } else { c[i] = c[i] / 2; c[i + 1] += 26; } } for (i = n - 1; i >= 0; i--) { a[i] = a[i] + c[i]; while (a[i] >= 26) { a[i] -= 26; a[i - 1]++; } } for (i = 0; i < n; i++) { printf( %c , (char)(a[i] + a )); } printf( n ); } return 0; } |
#include <iostream> #include <string> #include <algorithm> #include <map> #include <vector> #include <cmath> #include <queue> #include <set> #include <bitset> using namespace std; typedef long long ll; ll MOD = 1000000007; void solve(int testCase) { ll n; cin >> n; for (int i = 0; i * 2020 <= n; i++) { if ((n - i * 2020) % 2021 == 0) { cout << YES << endl; return; } } cout << NO << endl; } int main() { int t; cin >> t; //t = 1; int i = 1; while (t--) { solve(i++); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void chkmin(T &a, const T &b) { a = a < b ? a : b; } template <typename T> inline void chkmax(T &a, const T &b) { a = a > b ? a : b; } const int MAXN = 150005, MAXT = 300005; int sz[MAXN], val[MAXN], vis[MAXN], n, tot; vector<int> gra[MAXN]; struct Tree { long long k, b; Tree *ls, *rs; bool did; } nd[MAXT], *rt; vector<Tree *> cls; long long ans; Tree *build(int l, int r) { Tree *cur = nd + (tot++); cur->did = false; if (l == r) return cur; int mid = (l + r) >> 1; cur->ls = build(l, mid); cur->rs = build(mid + 1, r); return cur; } void modify(long long k, long long b, int l = 1, int r = n, Tree *p = rt) { if (p->did) { long long f1 = p->k * l + p->b, f2 = p->k * r + p->b, g1 = k * l + b, g2 = k * r + b; if (g1 >= f1 && g2 >= f2) { p->k = k, p->b = b; return; } else if (g1 <= f1 && g2 <= f2) return; double in = 1.0 * (b - p->b) / (k - p->k); int mid = (l + r) >> 1; if (in <= mid) { if (f1 >= g1 && f2 <= g2) { modify(p->k, p->b, l, mid, p->ls); p->k = k, p->b = b; } else modify(k, b, l, mid, p->ls); } else { if (f1 <= g1 && f2 >= g2) { modify(p->k, p->b, mid + 1, r, p->rs); p->k = k, p->b = b; } else modify(k, b, mid + 1, r, p->rs); } } else p->k = k, p->b = b, p->did = true, cls.push_back(p); } long long query(int x, int l = 1, int r = n, Tree *p = rt) { if (!p->did) return -1e18; int mid = (l + r) >> 1; long long res = p->k * x + p->b; if (x <= mid) chkmax(res, query(x, l, mid, p->ls)); else chkmax(res, query(x, mid + 1, r, p->rs)); return res; } void get_sz(int u, int fa) { sz[u] = 1; for (int v : gra[u]) if (v != fa && !vis[v]) { get_sz(v, u); sz[u] += sz[v]; } } pair<int, int> get_rt(int u, int fa, int s) { auto res = make_pair(MAXN, MAXN); int mn = s; for (int v : gra[u]) if (v != fa && !vis[v]) { res = min(res, get_rt(v, u, s + sz[u] - sz[v])); chkmax(mn, sz[v]); } return min(res, make_pair(mn, u)); } void dfs1(int u, int fa, int dep, long long sum, long long cur, long long tmp) { sum += val[u], cur += sum, ++dep, tmp += (long long)dep * val[u]; chkmax(ans, cur), chkmax(ans, tmp); chkmax(ans, query(dep) + cur); for (int v : gra[u]) if (v != fa && !vis[v]) dfs1(v, u, dep, sum, cur, tmp); } void dfs2(int u, int fa, int dep, long long sum, long long cur) { ++dep, sum += val[u], cur += (long long)dep * val[u]; modify(sum, cur); for (int v : gra[u]) if (v != fa && !vis[v]) dfs2(v, u, dep, sum, cur); } void divide(int u) { get_sz(u, 0); u = get_rt(u, 0, 0).second; vis[u] = 1; for (int v : gra[u]) if (!vis[v]) { dfs1(v, u, 1, val[u], val[u], val[u]); dfs2(v, u, 0, 0, 0); } for (Tree *p : cls) p->did = false; cls.clear(); reverse(gra[u].begin(), gra[u].end()); for (int v : gra[u]) if (!vis[v]) { dfs1(v, u, 1, val[u], val[u], val[u]); dfs2(v, u, 0, 0, 0); } for (Tree *p : cls) p->did = false; cls.clear(); for (int v : gra[u]) if (!vis[v]) divide(v); vis[u] = 0; } int main() { scanf( %d , &n); rt = build(1, n); for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); gra[u].push_back(v); gra[v].push_back(u); } for (int i = 1; i <= n; i++) scanf( %d , val + i); divide(1); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[200007]; int brr[200007]; int main() { int t; cin >> t; while (t--) { int n, x; cin >> n >> x; map<int, int> mpp; for (int i = 0; i < n; i++) { cin >> arr[i]; mpp[arr[i]]++; } int cnt = 0; for (int i = 1;; i++) { if (x == 0) break; if (mpp[i] == 0) { mpp[i]++; x--; } } for (int i = 1;; i++) { if (mpp[i] == 0) break; else cnt++; } cout << cnt << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; int mark[N], t[N], n; long long res; int main() { ios::sync_with_stdio(0); cin.tie(0); ; cin >> n; for (int i = (1); i <= (n); i += (1)) cin >> mark[i]; int cur = 0; for (int i = (n); i >= (1); i -= (1)) { cur = max(0, cur - 1); cur = max(cur, mark[i] + 1); t[i] = cur; } cur = 0; for (int i = (1); i <= (n); i += (1)) { cur = max(cur, t[i]); res += cur; } for (int i = (1); i <= (n); i += (1)) res -= (mark[i] + 1); cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); int ans = 1; for (int i = 1; i < n; i++) { if (arr[i] > arr[i - 1]) ans++; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace Base { const int inf = 0x3f3f3f3f, INF = 0x7fffffff; const long long infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll; template <typename T> void read(T &x) { x = 0; int fh = 1; double num = 1.0; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) fh = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } if (ch == . ) { ch = getchar(); while (isdigit(ch)) { num /= 10; x = x + num * (ch - 0 ); ch = getchar(); } } x = x * fh; } template <typename T> void chmax(T &x, T y) { x = x < y ? y : x; } template <typename T> void chmin(T &x, T y) { x = x > y ? y : x; } } // namespace Base using namespace Base; const int N = 510; bool tag[N]; int nxt[N], n, m, len[N], pre[N][N], bak[N][N], now[N], ch[N]; long long k, cnt[N]; void kmp(int *a, int lena, int *b, int lenb) { memset(tag, 0, sizeof(tag)); for (int i = 1; i <= lenb; i++) { int p = i - 1; while (p != 0 && b[nxt[p] + 1] != b[i]) p = nxt[p]; if (b[nxt[p] + 1] != b[i] || i == 1) nxt[i] = 0; else nxt[i] = nxt[p] + 1; } for (int i = 1, j = 1; i <= lena; i++) { while (j != 1 && a[i] != b[j]) j = nxt[j - 1] + 1; if (a[i] == b[j]) j++; if (j > lenb) { tag[i] = true, j = nxt[j - 1] + 1; } } } int main() { read(n); read(k); read(m); k = k + 1; len[0] = len[1] = 1; pre[0][1] = 0; pre[1][1] = 1; bak[0][1] = 0; bak[1][1] = 1; for (int j = 2; j <= n; j++) { for (int k = 1; k <= len[j - 2]; k++) pre[j][k] = pre[j - 2][k]; if (len[j - 2] < m) { for (int k = len[j - 2] + 1; k <= min(len[j - 2] + len[j - 1], m); k++) pre[j][k] = pre[j - 1][k - len[j - 2]]; } int tmp = 0; if (len[j - 1] < m) { tmp = min(len[j - 2], m - len[j - 1]); for (int k = 1; k <= tmp; k++) bak[j][k] = bak[j - 2][len[j - 2] - tmp + k]; } for (int k = 1; k <= len[j - 1]; k++) bak[j][k + tmp] = bak[j - 1][k]; len[j] = min(m, len[j - 1] + len[j - 2]); } for (int i = 1; i <= m; i++) { bool flag = false; for (int j = 1; j <= i - 1; j++) if (bak[n][len[n] - i + j + 1] != ch[j]) { flag = true; break; } if (flag == false) { k--; if (k == 0) { for (int j = 1; j <= i - 1; j++) printf( %d , ch[j]); printf( n ); exit(0); } } flag = false; ch[i] = 0; memset(cnt, 0, sizeof(cnt)); if (i == 1) cnt[0] = 1; for (int j = 2; j <= n; j++) { cnt[j] = cnt[j - 1] + cnt[j - 2]; if (cnt[j] >= k) { flag = true; break; } int id = 0, cut = 0; for (int k = 1; k <= len[j - 2]; k++) now[++id] = bak[j - 2][k]; cut = id; for (int k = 1; k <= len[j - 1]; k++) now[++id] = pre[j - 1][k]; kmp(now, id, ch, i); for (int k = cut + 1; k <= min(cut + i - 1, id); k++) if (tag[k] == true) cnt[j]++; } if (cnt[n] >= k || flag == true) ch[i] = 0; else ch[i] = 1, k -= cnt[n]; } for (int i = 1; i <= m; i++) printf( %d , ch[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], p[100000]; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i] >> p[i]; for (int i = 1; i < n; ++i) p[i] = min(p[i], p[i - 1]); int ans = 0; for (int i = 0; i < n; ++i) ans += p[i] * a[i]; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace ::std; const long long maxn = 52; const long long mod = 1e9 + 7; const long long inf = 1e9 + 500; long long dp[2][maxn][maxn][maxn][maxn]; long long d[maxn]; bool bit; long long kv; void add(long long a, long long b, long long c, long long d, long long z) { if (0 <= a && 0 <= b && 0 <= c && 0 <= d && a < maxn && b < maxn && c < maxn && d < maxn) { dp[bit][a][b][c][d] += z * kv; dp[bit][a][b][c][d] %= mod; } } int main() { long long n; cin >> n; for (long long i = 0; i < n; i++) { cin >> d[i]; } long long a1 = 0, a2 = 0, b1 = 0, b2 = 0; if (d[0] == 2) { b1++; } else { b2++; } if (d[1] == 2) { a1++; } else { a2++; } dp[1][a1][a2][b1][b2] = 1; for (long long i = 2; i < n; i++) { bit = (i & 1); long long k = i; for (long long a1 = 0; a1 <= k; a1++) { for (long long a2 = 0; a2 + a1 <= k; a2++) { for (long long b1 = 0; b1 + a1 + a2 <= k; b1++) { for (long long b2 = 0; b2 + a1 + a2 + b1 <= k; b2++) { dp[bit][a1][a2][b1][b2] = 0; } } } } for (long long a1 = 0; a1 <= k; a1++) { for (long long a2 = 0; a2 + a1 <= k; a2++) { for (long long b1 = 0; b1 + a1 + a2 <= k; b1++) { for (long long b2 = 0; b2 + a1 + a2 + b1 <= k; b2++) { kv = dp[!bit][a1][a2][b1][b2]; if (d[i] == 2) { add(a1 - 1, a2, b1 - 1, b2, a1 * b1); add(a1 + 1, a2 - 1, b1 - 1, b2, a2 * b1); add(a1 + 1, a2, b1 - 1, b2, b1); add(a1 - 1, a2, b1 + 1, b2 - 1, a1 * b2); add(a1 + 1, a2 - 1, b1 + 1, b2 - 1, a2 * b2); add(a1 + 1, a2, b1 + 1, b2 - 1, b2); if (b1 == 0 && b2 == 0) { add(1, 0, a1 - 1, a2, a1); add(1, 0, a1 + 1, a2 - 1, a2); } } else { if (b1 == 0 && b2 == 0) { add(0, 1, a1 - 1, a2, a1); add(0, 1, a1 + 1, a2 - 1, a2); } add(a1, a2 + 1, b1 - 1, b2, b1); add(a1 + 1 + 1, a2 - 1, b1 - 1, b2, b1 * a2); add(a1 + 1 - 1, a2, b1 - 1, b2, b1 * a1); add(a1 - 2, a2, b1 - 1, b2, b1 * (a1 * (a1 - 1)) / 2); add(a1 + 2, a2 - 2, b1 - 1, b2, b1 * (a2 * (a2 - 1)) / 2); add(a1 + 1 - 1, a2 - 1, b1 - 1, b2, b1 * a1 * a2); add(a1, a2 + 1, b1 + 1, b2 - 1, b2); add(a1 + 1 + 1, a2 - 1, b1 + 1, b2 - 1, b2 * a2); add(a1 + 1 - 1, a2, b1 + 1, b2 - 1, b2 * a1); add(a1 - 2, a2, b1 + 1, b2 - 1, b2 * (a1 * (a1 - 1)) / 2); add(a1 + 2, a2 - 2, b1 + 1, b2 - 1, b2 * (a2 * (a2 - 1)) / 2); add(a1 + 1 - 1, a2 - 1, b1 + 1, b2 - 1, b2 * a1 * a2); } } } } } k++; for (long long a1 = 0; a1 <= k; a1++) { for (long long a2 = 0; a2 + a1 <= k; a2++) { for (long long b1 = 0; b1 + a1 + a2 <= k; b1++) { for (long long b2 = 0; b2 + a1 + a2 + b1 <= k; b2++) { dp[bit][a1][a2][b1][b2] %= mod; } } } } } long long ans = 0; bool bb = (n - 1) & 1; ans = dp[bb][0][0][0][0]; cout << ans % mod; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, m = 1e9 + 7; cin >> n >> k; int a[100005]; a[0] = 1; for (int i = 1; i < 100005; ++i) { if (i >= k) { a[i] = (a[i - k] + a[i - 1]) % m; } else { a[i] = a[i - 1]; } } for (int i = 1; i < 100005; ++i) { a[i] = (a[i] + a[i - 1]) % m; } while (n--) { int x, y; scanf( %d %d , &x, &y); printf( %d n , (a[y] - a[x - 1] + m) % m); } } |
#include <bits/stdc++.h> using namespace std; void write(vector<int> &v) { for (auto i : v) cout << i << ; cout << n ; } void read(vector<int> &v) { for (auto &i : v) cin >> i; } const int INF = 1e9; const int64_t INFF = 1e18; const int N = 1e6 + 69; void solve() { int n; cin >> n; string s1, s2; cin >> s1 >> s2; int ans = 0; vector<int> pos(n, 1); for (int i = 0; i < n; i++) { if (s2[i] == 1 ) { if (s1[i] == 0 ) { ans++; pos[i] = 0; } else if (i > 0 && s1[i - 1] == 1 && pos[i - 1]) { ans++; pos[i - 1] = 0; } else if (i < n - 1 && s1[i + 1] == 1 && pos[i + 1]) { ans++; pos[i + 1] = 0; } } } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin >> t; for (int i = 1; i <= t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; inline long long read() { long long neg = 1, num = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) neg = -1; for (; isdigit(c); c = getchar()) num = (num << 1) + (num << 3) + c - 0 ; return neg * num; } long long n, k, tot, f[200010], g[200010], fac[200010], inv[200010], pri[200010], mu[200010], mul[200010]; bool vis[200010]; inline long long Pow(long long x, long long y) { long long res = 1; for (; y; y >>= 1, x = x * x % p) if (y & 1) res = res * x % p; return res; } inline long long C(long long x, long long y) { return fac[x] * inv[y] % p * inv[x - y] % p; } inline long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; } inline void sieve() { vis[1] = mu[1] = 1; for (long long i = 2; i <= n; i++) { if (!vis[i]) pri[++tot] = i, mu[i] = -1; for (long long j = 1; j <= tot && pri[j] * i <= n; j++) { vis[i * pri[j]] = 1; if (i % pri[j] == 0) break; mu[i * pri[j]] = -mu[i]; } } fac[0] = inv[0] = mul[0] = 1; for (long long i = 1; i <= 2 * n; i++) fac[i] = fac[i - 1] * i % p, mul[i] = mul[i - 1] * k % p; inv[2 * n] = Pow(fac[2 * n], p - 2); for (long long i = 2 * n - 1; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % p; for (long long i = 2; i <= n; i++) f[i] = (f[i - 1] + (i - 1) * mul[i] % p) % p; for (long long i = 1; i <= n; i++) g[i] = Pow(f[n / i], i) % p; } signed main() { n = read(); k = read(); sieve(); long long ans = 0, sub = 0; for (long long i = 2; i <= 2 * n; i++) { if (i <= n) ans = (ans + (i - 1) * mul[i] % p) % p; else ans = (ans + (2 * n - i + 1) * mul[i] % p) % p; } ans = ans * Pow(mul[n], p - 2) % p; for (long long d = 1; d <= n; d++) { for (long long T = d; T <= n; T += d) { long long s1 = (n / T) * (n / T - 1) / 2 % p, s2 = g[T]; if ((n + d - 1) / T != n / T) s1 = (s1 + (n + d - 1) / T - 1) % p, s2 = (s2 + ((n + d - 1) / T - 1) * mul[(n + d - 1) / T * T] % p) % p; ans = (ans + s1 * mul[d] * mu[T / d] % p) % p; sub = (sub + s2 * mu[T / d]) % p; } } sub = sub * Pow(mul[n], p - 2) % p; ans = (ans - sub) % p; for (long long i = 1; i <= n; i++) ans = (ans - (1 + (i != n)) * mul[max(gcd(i, n), i)]) % p; ans = ans * Pow(mul[n], p - 2) % p; ans = (ans % p + p) % p; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int num[100020], nxt[100020]; struct point { int st, en, num; } pnt[100020 * 4]; int max1(int a, int b) { if (a > b) return a; return b; } int main() { int n, sum = 0, cnt = 0, besti, min1 = 1 << 25, tmp, i; scanf( %d , &n); num[n + 1] = nxt[0] = num[0] = 0; for (i = 1; i <= n; i++) { scanf( %d , &num[i]), nxt[i] = i; } for (i = 0; i < 100020 * 3; i++) pnt[i].st = pnt[i].en = pnt[i].num = 0; for (i = 1; i <= n + 1; i++) { if (num[i] >= num[i - 1]) { sum += num[i] - num[i - 1]; } else { besti = i - 1; while (num[besti] > num[i]) { tmp = max1(num[nxt[besti] - 1], num[i]); pnt[cnt].en = i - 1; pnt[cnt].st = nxt[besti], pnt[cnt++].num = num[besti] - tmp; nxt[i] = nxt[besti]; besti = nxt[besti] - 1; } if (num[besti] >= num[i]) nxt[i] = nxt[besti]; } } printf( %d n , sum); for (i = 0; i < cnt; i++) { for (int j = 0; j < pnt[i].num; j++) printf( %d %d n , pnt[i].st, pnt[i].en); } return 0; } |
#include <bits/stdc++.h> using namespace std; map<string, int> mp; map<int, string> g; int n, k, cnt; char name1[10100][30], name2[10100][30]; int mark[1010][1010]; int x[10100], y[10100], tt[10100]; int ans[10100], num; struct Node { int l, r; } node[10100]; struct Mark { int l, r; Mark() {} Mark(int a, int b) { if (a > b) swap(a, b); l = a; r = b; } bool operator<(const Mark a) const { if (l == a.l) return r < a.r; return l < a.l; } }; map<Mark, int> vis; int vv; int main() { string s1, s2; int u, v, t; while (scanf( %d%d , &n, &k) == 2) { cnt = 0; num = 0; vv = 0; vis.clear(); mp.clear(); for (int i = 0; i < n; i++) { scanf( %s%s%d , name1[i], name2[i], &t); s1 = name1[i]; s2 = name2[i]; if (!mp.count(s1)) { mp[s1] = ++cnt; g[cnt] = s1; } u = mp[s1]; if (!mp.count(s2)) { mp[s2] = ++cnt; g[cnt] = s2; } v = mp[s2]; x[i] = u; y[i] = v; tt[i] = t; for (int j = 0; j < n; j++) { if (tt[i] != tt[j] && tt[i] - tt[j] <= k) { if (x[i] == y[j] && x[j] == y[i]) { if (!vis.count(Mark(x[i], y[i]))) { node[num].l = x[i]; node[num++].r = y[i]; vis[Mark(x[i], y[i])] = vv++; } } } } } printf( %d n , num); for (int i = 0; i < num; i++) cout << g[node[i].l] << << g[node[i].r] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int LG_N = 20; struct node { int l, r, cnt; node *left, *right; node(int _l, int _r, int _c = 0) : l(_l), r(_r), cnt(_c) {} }; node *init(int l, int r) { node *p = new node(l, r); if (l < r) { int mid = (l + r) / 2; p->left = init(l, mid); p->right = init(mid + 1, r); } return p; } node *update(node *p, int idx) { node *q = new node(p->l, p->r, p->cnt + 1); if (p->l < p->r) { int mid = (p->l + p->r) / 2; q->left = (idx <= mid ? update(p->left, idx) : p->left); q->right = (idx > mid ? update(p->right, idx) : p->right); } return q; } int seg_query(node *p, int l, int r) { if (p->r < l or r < p->l) return 0; if (l <= p->l and p->r <= r) return p->cnt; return seg_query(p->left, l, r) + seg_query(p->right, l, r); } struct Query { int type, u, v, k, y; void read(void) { scanf( %d , &type); if (type == 1) { scanf( %d , &u); } else { scanf( %d%d%d%d , &u, &v, &k, &y); } } } query[N]; node *head[N]; vector<int> adj[N]; int P[N][LG_N], H[N]; int attack_year[N]; int n, m; int root = 1; int count(int u, int v, int l, int r) { int ans = 0; if (l > 0) { ans += seg_query(head[u], 1, l - 1); ans -= seg_query(head[v], 1, l - 1); } if (r < m + 1) { ans += seg_query(head[u], r + 1, m + 1); ans -= seg_query(head[v], r + 1, m + 1); } return ans; } int my_advance(int u, int l) { for (int i = LG_N - 1; i >= 0; i--) { if ((1 << i) <= l) { l -= 1 << i; u = P[u][i]; } } return u; } int lca(int u, int v) { if (H[u] < H[v]) swap(u, v); for (int i = LG_N - 1; i >= 0; i--) { if (H[P[u][i]] >= H[v]) { u = P[u][i]; } } if (u == v) return u; for (int i = LG_N - 1; i >= 0; i--) { if (P[u][i] != P[v][i]) { u = P[u][i]; v = P[v][i]; } } return P[u][0]; } void dfsInit(int u, int h) { H[u] = h; for (int i = 1; i < LG_N; i++) { P[u][i] = P[P[u][i - 1]][i - 1]; } head[u] = update(u == root ? (head[0] = init(0, m + 1)) : head[P[u][0]], attack_year[u]); for (int v : adj[u]) { dfsInit(v, h + 1); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int u; scanf( %d , &u); if (u == 0) { root = i; } adj[u].push_back(i); P[i][0] = u; } scanf( %d , &m); for (int i = 1; i <= n; i++) { attack_year[i] = m + 1; } for (int i = 1; i <= m; i++) { query[i].read(); if (query[i].type == 1) { attack_year[query[i].u] = i; } } H[0] = 0; dfsInit(root, 1); for (int i = 1; i <= m; i++) { if (query[i].type == 1) continue; int u = query[i].u, v = query[i].v, k = query[i].k, y = query[i].y; int l = lca(u, v); k += (attack_year[u] < y + 1 or attack_year[u] > i); int lo = 0, hi = H[u] - H[l]; while (lo < hi) { int mid = (lo + hi) / 2; if (count(u, my_advance(u, mid + 1), y + 1, i) >= k) { hi = mid; } else { lo = mid + 1; } } k -= count(u, my_advance(u, lo + 1), y + 1, i); u = my_advance(u, lo); if (k == 0) { printf( %d n , (u == v ? -1 : u)); continue; } k = count(v, l, y + 1, i) - k + 1; if (k >= 0) { lo = 0, hi = H[v] - H[l]; while (lo < hi) { int mid = (lo + hi) / 2; if (count(v, my_advance(v, mid + 1), y + 1, i) >= k) { hi = mid; } else { lo = mid + 1; } } k -= count(v, my_advance(v, lo + 1), y + 1, i); v = my_advance(v, lo); if (lo == 0) { k = -1; } } if (k == 0) { printf( %d n , v); } else { printf( -1 n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int a[maxn], n, s, b[maxn], num[maxn], len; int ufs[maxn], meme[maxn]; inline int find(int u) { if (ufs[u] == u) return u; else return ufs[u] = find(ufs[u]); } inline void join(int u, int v, int e) { u = find(u), v = find(v); if (u == v) return; ufs[v] = u; meme[u] = e; } vector<vector<int> > mema; vector<pair<int, int> > adj[maxn]; vector<int> curm; inline void dfs(int u) { while (adj[u].size()) { int v = adj[u].back().first, id = adj[u].back().second; adj[u].pop_back(); dfs(v); curm.push_back(id); } } int main() { cin >> n >> s; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); num[++len] = a[i]; } sort(num + 1, num + len + 1); len = unique(num + 1, num + len + 1) - num - 1; for (int i = 1; i <= n; i++) { a[i] = lower_bound(num + 1, num + len + 1, a[i]) - num; b[i] = a[i]; ufs[i] = i; } sort(b + 1, b + n + 1); int cnt = 0; for (int i = 1; i <= n; i++) { if (a[i] != b[i]) { cnt++; join(a[i], b[i], i); } } if (cnt > s) { cout << -1 << endl; return 0; } if (cnt == 0) { cout << 0 << endl; return 0; } if (s - cnt > 1) { for (int i = 1; i <= len; i++) { if (ufs[i] == i && meme[i] != 0) { curm.push_back(meme[i]); if (curm.size() == s - cnt) break; } } if (curm.size() > 1) { mema.push_back(curm); int lstv = a[curm.back()]; for (int i = curm.size() - 1; i >= 1; i--) { a[curm[i]] = a[curm[i - 1]]; } a[curm[0]] = lstv; } } for (int i = 1; i <= n; i++) { if (a[i] != b[i]) { adj[a[i]].push_back(make_pair(b[i], i)); } } for (int i = 1; i <= len; i++) { if (adj[i].size() != 0) { curm.clear(); dfs(i); mema.push_back(curm); } } cout << mema.size() << endl; for (int i = 0; i < mema.size(); i++) { cout << mema[i].size() << endl; for (int j = 0; j < mema[i].size(); j++) { printf( %d , mema[i][j]); } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; struct poke { double p, q; } srt[N]; inline bool cmp1(poke a, poke b) { return a.p > b.p || a.p == b.p && a.q > b.q; } inline bool cmp2(poke a, poke b) { return a.p - a.p * a.q > b.p - b.p * b.q; } double f[N]; int n, a, b; double ans, sum; multiset<double> heap; void calc() { ans = 0., sort(srt + 1, srt + 1 + n, cmp1); for (int i = a; i <= n; ++i) { if (i - a > b) break; sort(srt + 1, srt + 1 + i, cmp2), heap.clear(); double cur = sum = f[i + 1] = 0.; for (int j = i; j >= 1; --j) { heap.insert(srt[j].q - srt[j].p), sum += srt[j].q - srt[j].p; if ((int)heap.size() > i - a) sum -= *heap.begin(), heap.erase(heap.begin()); f[j] = sum, cur += srt[j].p; } heap.clear(); for (int j = i + 1; j <= n; ++j) { heap.insert(srt[j].q), cur += srt[j].q; if ((int)heap.size() > b - (i - a)) cur -= *heap.begin(), heap.erase(heap.begin()); } for (int j = 0; j <= i; ++j) { if (j > a) break; if (j) heap.insert(srt[j].q - srt[j].p * srt[j].q), cur += srt[j].q - srt[j].p * srt[j].q; if ((int)heap.size() > b - (i - a)) cur -= *heap.begin(), heap.erase(heap.begin()); if ((int)heap.size() == b - (i - a)) ans = max(ans, cur + f[j + 1]); } } } int main() { scanf( %d%d%d , &n, &a, &b); for (int i = 1; i <= n; ++i) scanf( %lf , &srt[i].p); for (int i = 1; i <= n; ++i) scanf( %lf , &srt[i].q); calc(), printf( %.6lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long n; cin >> n; char c; cin >> c; string str; cin >> str; long long ctr = 0; long long k = 0; for (long long i = 0; i < n; i++) { if (str[i] != c) { ctr++; k = i; } } if (ctr == 0) { cout << 0; } else if (ctr == 1) { if (k == n - 1) { cout << 1 << n ; cout << k; } else { cout << 1 << n ; cout << k + 2; } } else { long long flag = 0; for (long long i = n - 1; i >= n / 2; i--) { if (str[i] == c) { flag = i; break; } } if (flag) { cout << 1 << n ; cout << flag + 1; } else { cout << 2 << n ; cout << n << << n - 1; } } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[105], b[105]; long long tinh(long long x, int n, int nc) { long long i, cnt = 0; for ((i) = (1); (i) <= (n); (i)++) { cnt += (((long long)a[i] * x) / b[i]) + 1; if (cnt > nc) return 1001001001; } return cnt; } void input() { int i, n, nc; int dau, giua, cuoi; int l, r; scanf( %d %d , &n, &nc); for ((i) = (1); (i) <= (n); (i)++) scanf( %d %d , &a[i], &b[i]); dau = 1, cuoi = 1001001001; while (dau <= cuoi) { giua = (dau + cuoi) >> 1; long long val = tinh(giua, n, nc); if (val > nc) cuoi = giua - 1; else dau = giua + 1; } r = cuoi; dau = 1, cuoi = 1001001001; while (dau <= cuoi) { giua = (dau + cuoi) >> 1; long long val = tinh(giua, n, nc); if (val < nc) dau = giua + 1; else cuoi = giua - 1; } l = dau; if (r < l) printf( 0 n ); else if (r == 1001001001) printf( -1 n ); else printf( %d n , r - l + 1); } int main() { input(); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) using namespace std; const bool db = false; int n, m, x, y; int a[1010][1010], b[1010][1010]; long long s[1010][1010], cs[1010][1010]; vector<pair<int, int> > ans; char mark[1010][1010]; pair<long long, pair<int, int> > st[1010 * 1010]; int sz = 0; long long sum(int lx, int ly, int rx, int ry) { return s[rx][ry] + s[lx - 1][ly - 1] - s[rx][ly - 1] - s[lx - 1][ry]; } int main() { scanf( %d%d%d%d , &n, &m, &x, &y); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { scanf( %d , &a[i][j]); s[i][j] = a[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1]; } } for (int i = 1; i <= n; ++i) { deque<int> dq; for (int j = 1; j < y; ++j) { while (!dq.empty() && dq.back() > a[i][j]) dq.pop_back(); dq.push_back(a[i][j]); } for (int j = 1; j + y - 1 <= m; ++j) { if (j != 1) { if (a[i][j - 1] == dq.front()) dq.pop_front(); } while (!dq.empty() && dq.back() > a[i][j + y - 1]) dq.pop_back(); dq.push_back(a[i][j + y - 1]); b[i][j] = dq.front(); } } for (int i = 1; i + y - 1 <= m; ++i) { deque<int> dq; for (int j = 1; j < x; ++j) { while (!dq.empty() && dq.back() > b[j][i]) dq.pop_back(); dq.push_back(b[j][i]); } for (int j = 1; j + x - 1 <= n; ++j) { if (j != 1) { if (b[j - 1][i] == dq.front()) dq.pop_front(); } while (!dq.empty() && dq.back() > b[j + x - 1][i]) dq.pop_back(); dq.push_back(b[j + x - 1][i]); cs[j][i] = dq.front(); } } long long tot = 1LL << 60; for (int i = 1; i + x - 1 <= n; ++i) { for (int j = 1; j + y - 1 <= m; ++j) { st[sz].first = cs[i][j] = sum(i, j, i + x - 1, j + y - 1) - 1LL * x * y * cs[i][j]; st[sz].second.first = i; st[sz++].second.second = j; } } sort(st, st + sz); ans.reserve(n * m); for (int it = 0; it < sz; ++it) { int i = st[it].second.first, j = st[it].second.second; if (mark[i][j] || mark[i + x - 1][j] || mark[i][j + y - 1] || mark[i + x - 1][j + y - 1]) { continue; } ans.emplace_back(make_pair(i, j)); for (int di = 0; di < x; ++di) { for (int dj = 0; dj < y; ++dj) { mark[i + di][j + dj] = 1; } } } cout << ans.size() << n ; for (int i = 0; i < ans.size(); ++i) printf( %d %d %lld n , ans[i].first, ans[i].second, cs[ans[i].first][ans[i].second]); getchar(); getchar(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void _p(T a) { cout << a << n ; } template <class T> void _pa(T a) { cout << a << ; } template <class T1, class T2> void _p(T1 a, T2 b) { cout << a << << b << n ; } template <class T1, class T2, class T3> void _p(T1 a, T2 b, T3 c) { cout << a << << b << << c << n ; } template <class T1, class T2, class T3, class T4> void _p(T1 a, T2 b, T3 c, T4 d) { cout << a << << b << << c << << d << << n ; } template <class T1, class T2, class T3, class T4, class T5> void _p(T1 a, T2 b, T3 c, T4 d, T5 e) { cout << a << << b << << c << << d << << e << << n ; } template <class T> void _pa(T a[], long long n) { long long i; for (i = 0; i < n; i++) cout << a[i] << ; cout << n ; } template <class T> void _p(vector<T> v) { for (auto x : v) cout << x << ; cout << n ; } template <class T> void _p(list<T> l) { for (auto x : l) cout << x << ; cout << n ; } template <class T> void _p(set<T> s) { for (auto x : s) cout << x << ; cout << n ; } template <class T> void _p(multiset<T> s) { for (auto x : s) cout << x << ; cout << n ; } template <class T> void _p(unordered_set<T> s) { for (auto x : s) cout << x << ; cout << n ; } template <class T1, class T2> void _p(map<T1, T2> m) { for (auto x : m) cout << x.first << -> << x.second << n ; cout << n ; } template <class T1, class T2> void _p(unordered_map<T1, T2> m) { for (auto x : m) cout << x.first << -> << x.second << n ; cout << n ; } template <class T1, class T2> void _p(map<T1, vector<T2>> m) { for (auto x : m) { cout << x.first << -> ; _p(x.second); } cout << n ; } template <class T1, class T2> void _p(unordered_map<T1, vector<T2>> m) { for (auto x : m) { cout << x.first << -> ; _p(x.second); } cout << n ; } void solution() { string a, b; int i, n, c = 0; cin >> a >> b; map<char, int> mp; n = b.length(); for (i = 0; i < 26; i++) mp[a[i]] = i; for (i = 1; i < n; i++) c += abs(mp[b[i]] - mp[b[i - 1]]); _p(c); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tcse; cin >> tcse; while (tcse--) solution(); } |
#include <bits/stdc++.h> using namespace std; bool pd[5005][5005]; char str[5005]; int n; bool vis[5050]; bool dfs(int u, int lst) { vis[u] = 1; for (int i = 1; i <= n; ++i) { if (!pd[u][i]) continue; if (lst != -1 && pd[i][lst]) { printf( %d %d %d n , lst, u, i); return 1; } if (!vis[i] && dfs(i, u)) return 1; } return 0; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %s , str + 1); for (int j = 1; j <= n; ++j) if (str[j] == 1 ) pd[i][j] = 1; } for (int i = 1; i <= n; ++i) if (!vis[i] && dfs(i, -1)) { return 0; } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> int main() { int i, n, m, count = 0; scanf( %d%d , &n, &m); while (n > 0 && m > 0) { if (n > m && n >= 2) { n -= 2; m--; count++; } else if (m > n && m >= 2) { m -= 2; n--; count++; } else if (n == m && m >= 2) { m -= 2; n--; count++; } else break; } printf( %d , count); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, m, k; cin >> n >> m >> k; long long s = 2 * n * m; if (s % k != 0) { cout << NO ; return 0; } s /= k; long long x2, x3, y2, y3; x2 = n; if (s % n == 0) y3 = s / n; else y3 = s / n + 1; long long r = y3 * n - s; y2 = 1, x3 = r; cout << YES n ; cout << 0 0 n ; cout << x2 << << y2 << n ; cout << x3 << << y3 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void prepare() {} void solve() { string s; cin >> s; set<int> ss[26]; for (int i = 0; i < s.size(); ++i) ss[s[i] - a ].insert(i); int i = 25; int cur = -1; while (i != -1) { if (ss[i].empty()) { --i; continue; } while (!ss[i].empty() && *ss[i].begin() < cur) ss[i].erase(ss[i].begin()); if (ss[i].empty()) { --i; continue; } for (int j = 0; j < ss[i].size(); ++j) printf( %c , i + a ); cur = *(--ss[i].end()); --i; } } int main() { prepare(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 200005; const int N = 900005; struct node { int son[27]; int fa; } a[N]; int sz; char s[N]; int mat[M]; vector<int> over[N]; inline int new_id() { ++sz; over[sz].clear(); for (int i = (1); i <= (26); i++) a[sz].son[i] = -1; return sz; } int np, ans; void ins(int pos, int x, int y) { over[pos].push_back(np); if (x == y) return; int cur = s[x] - a + 1; if (a[pos].son[cur] == -1) { a[pos].son[cur] = new_id(); a[a[pos].son[cur]].fa = pos; } ins(a[pos].son[cur], ++x, y); return; } int u[M], n; void dfs(int x, int dep) { for (int i = (1); i <= (26); i++) if (a[x].son[i] != -1) dfs(a[x].son[i], dep + 1); vector<int> g1, g2; g1.clear(); g2.clear(); for (int i = 0; i < over[x].size(); i++) { int j = over[x][i]; if (u[j]) continue; if (j <= n) g1.push_back(j); else g2.push_back(j); } for (int i = 0; i < min(g1.size(), g2.size()); i++) { ans += dep; u[g1[i]] = u[g2[i]] = 1; mat[g1[i]] = g2[i] - n; } } int main() { scanf( %d , &n); sz = -1; new_id(); for (int i = (1); i <= (n * 2); i++) { np = i; scanf( %s , &s); int len = strlen(s); ins(0, 0, len); } dfs(0, 0); printf( %d n , ans); for (int i = (1); i <= (n); i++) printf( %d %d n , i, mat[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); double s, x, y, z; cin >> s >> x >> y >> z; if ((x == y) && (y == z) && (z == 0.0)) { cout << 0 0 << s << endl; return 0; } double k = x + y + z, x0 = x * s / k, y0 = y * s / k, z0 = z * s / k; if (x0 + y0 + z0 >= s) z0 -= (x0 + y0 + z0 - s); cout << setprecision(14) << x0 << << y0 << << z0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; double xx[10], yy[10]; int main() { double px, py, vx, vy, a, b, c, d; cin >> px >> py >> vx >> vy >> a >> b >> c >> d; double x = vx / sqrt(vx * vx + vy * vy); double y = vy / sqrt(vx * vx + vy * vy); xx[1] = b * x + px; yy[1] = b * y + py; xx[2] = px - (y * a / 2); yy[2] = py + (x * a / 2); xx[3] = px - (y * c / 2); yy[3] = py + (x * c / 2); xx[4] = xx[3] - (d * x); yy[4] = yy[3] - (d * y); xx[6] = px + (y * c / 2); yy[6] = py - (x * c / 2); xx[5] = xx[6] - (x * d); yy[5] = yy[6] - (d * y); xx[7] = px + (y * a / 2); yy[7] = py - (x * a / 2); cout.precision(20); for (int i = 1; i <= 7; i++) cout << xx[i] << << yy[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int b, l, k = 0, p, m; cin >> b >> l; int n[l]; for (int i = 0; i < l; i++) { n[i] = 0; } for (int i = 0; i < b; i++) { cin >> p; for (int j = 0; j < p; j++) { cin >> m; n[m - 1]++; } } for (int i = 0; i < l; i++) { if (n[i] == 0) { k++; } } if (k > 0) { cout << NO ; } else { cout << YES ; } } |
#include <bits/stdc++.h> using namespace std; long long int pwr(long long int base, long long int p, long long int mod) { long long int ans = 1; while (p) { if (p & 1) ans = (ans * base) % mod; base = (base * base) % mod; p /= 2; } return ans; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { long long int k, a, b; scanf( %lld , &k); scanf( %lld , &a); scanf( %lld , &b); long long int ans = (a / k) + (b / k); if ((a < k && b % k != 0) || (b < k && a % k != 0)) { printf( -1 n ); return 0; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 22; int d, p, q; int c[N][N], s[5555]; int a[N][N], b[N][N], f[N]; int fpow(int x, int y = p - 2) { if (!y) return 1; long long z = fpow(x, y >> 1); z = z * z % p; if (y & 1) z = z * x % p; return z; } int w; void pr(int x, int y, int z = 0) { if (z) printf( + %d %d %d n , x, y, z); else printf( ^ %d %d n , x, y); } void mul(int r, int x) { int t = 100, i; if (x % 2 == 0) x += p; pr(r, r, t); x--; for (i = 2; x; i = i + i) { if (x & i) pr(r, t, r), x -= i; pr(t, t, t); } } void go(int r) { int t = 10, i; mul(9, 0); for (i = t; i <= t + d; i = i + 1) { pr(8, 9, i); mul(i, i - t); pr(i, r, i); pr(i, i); mul(i, b[q][i - t]); } pr(9, 9, r); for (i = t; i <= t + d; i = i + 1) pr(r, i, r); } int main() { int i, j, k, e, x; cin >> d >> p; for (i = 0; i < N; i = i + 1) { c[i][0] = 1; for (j = 1; j <= i; j = j + 1) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % p; } for (i = 0; i <= d; i = i + 1) { for (j = 0; j <= d; j = j + 1) a[i][j] = (long long)fpow(i, d - j) * c[d][j] % p; b[i][i] = 1; } for (i = 0; i <= d; i = i + 1) { for (j = 0; j <= d; j = j + 1) if (!f[j] && a[j][i]) break; e = j; f[e] = 1; if (i == 2) q = j; x = fpow(a[j][i]); for (k = 0; k <= d; k = k + 1) { a[e][k] = (long long)a[e][k] * x % p; b[e][k] = (long long)b[e][k] * x % p; } for (j = 0; j <= d; j = j + 1) { if (j == e || !a[j][i]) continue; x = a[j][i]; for (k = i; k <= d; k = k + 1) a[j][k] = (a[j][k] - (long long)a[e][k] * x % p + p) % p; for (k = 0; k <= d; k = k + 1) b[j][k] = (b[j][k] - (long long)b[e][k] * x % p + p) % p; } } pr(1, 2, 3); go(1); go(2); go(3); mul(1, p - 1); mul(2, p - 1); pr(1, 2, 1); pr(1, 3, 1); mul(1, fpow(2)); printf( f 1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1ll << 18; long long a, b, top, now; queue<long long> q; map<long long, int> mp; long long rev(long long x) { long long y = 0; while (x != 0) { y = (y << 1) | (x & 1); x >>= 1; } return y; } void push(long long &x) { if (x > b && rev(x) > b) return; if (mp.find(x) == mp.end()) { q.push(x); mp[x] = 1; } } string solve() { if (a == b) return YES ; q.push(a); mp[a] = 1; while (!q.empty()) { top = q.front(); q.pop(); now = rev(top << 1); if (now == b) return YES ; push(now); now = rev((top << 1) | 1); if (now == b) return YES ; push(now); } return NO ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> a >> b; cout << solve() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& v) { os << ( << v.first << << v.second << ) ; return os; } template <typename T, typename U = typename T::value_type, typename = typename enable_if<!is_same<T, string>::value>::type> ostream& operator<<(ostream& os, const T& v) { os << [ ; for (const auto& it : v) os << it << ; if (!v.empty()) os << b ; os << ] ; return os; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int n, x; cin >> n; int cnt[6] = {0, 0, 0, 0, 0, 0}; for (int i = 0; i < (n); i++) { cin >> x; if (x == 4) { cnt[0]++; continue; } if (x == 8 && cnt[0]) { cnt[0]--; cnt[1]++; continue; } if (x == 15 && cnt[1]) { cnt[1]--; cnt[2]++; continue; } if (x == 16 && cnt[2]) { cnt[2]--; cnt[3]++; continue; } if (x == 23 && cnt[3]) { cnt[3]--; cnt[4]++; continue; } if (x == 42 && cnt[4]) { cnt[4]--; cnt[5]++; continue; } } cout << n - 6 * cnt[5] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct par { int x, y, label; par(int _x, int _y, int _label) { x = _x; y = _y; label = _label; } par() {} }; bool operator<(par p1, par p2) { if (p1.x != p2.x) return p1.x < p2.x; return p1.y < p2.y; } int main() { int n; while (cin >> n) { vector<par> V; int x, y; for (int i = 0; i < n; i++) { cin >> x >> y; V.push_back(par(x, y, i + 1)); } sort((V).begin(), (V).end()); vector<int> sol; for (int i = 0; i < n; i++) { bool ok = 1; vector<par> aux; for (int j = 0; j < n; j++) if (j != i) aux.push_back(V[j]); for (int j = 1; j < aux.size(); j++) { if (aux[j - 1].y > aux[j].x) { ok = 0; break; } } if (ok) sol.push_back(V[i].label); } sort((sol).begin(), (sol).end()); cout << sol.size() << endl; for (int i = 0; i < sol.size(); i++) { if (i == 0) printf( %d , sol[i]); else printf( %d , sol[i]); } } } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; inline int read() { int w = 1, s = 0; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) w = -1; ch = getchar(); } while (isdigit(ch)) { s = s * 10 + ch - 0 ; ch = getchar(); } return w * s; } int n, k, fac[1001000], Ifac[1001000], f[1000010], Sum[1010010]; inline long long ksm(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; } return res; } inline int add(int a, int b) { a += b; return a >= mod ? a - mod : a; } inline int A(int a, int b) { return 1ll * fac[a] * Ifac[a - b] % mod; } inline void Init() { fac[0] = Ifac[0] = 1; for (register int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod; Ifac[n] = ksm(fac[n], mod - 2); for (register int i = n - 1; i; --i) Ifac[i] = 1ll * Ifac[i + 1] * (i + 1) % mod; } int main() { n = read(), k = read(); Init(); for (register int i = k + 1; i <= n; ++i) { int tmp = 1ll * max(i - k - 1, 0) * fac[i - 2] % mod; f[i] = add(f[i], tmp); int l = max(i - k, 1); f[i] = add(f[i], 1ll * fac[i - 2] * add(Sum[i - 1], mod - Sum[l - 1]) % mod); Sum[i] = add(Sum[i - 1], 1ll * f[i] * Ifac[i - 1] % mod); } cout << 1ll * Sum[n] * fac[n - 1] % mod; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 4e5 + 10; int n, m, k, t; bool vis[MAXN], ans[MAXN]; int v[MAXN]; set<int> p[MAXN]; priority_queue<pair<int, int> > pq; int main() { cin >> n >> m; memset(vis, false, sizeof(vis)); memset(ans, false, sizeof(ans)); for (int i = 0; i <= 2 * m + 2; i++) v[i] = -1; for (int i = 1; i <= n; i++) { cin >> k; for (int j = 0; j < k; j++) { cin >> t; v[t + m] = i; p[i].insert(t + m); } pq.push({-p[i].size(), i}); } bool flag = true; while (!pq.empty()) { int top = pq.top().second; pq.pop(); if (vis[top]) continue; if (p[top].empty()) { flag = false; break; } int x = *p[top].begin(); vis[top] = true; ans[x] = true; int y = m + m - x; if (v[y] != -1 && !vis[v[y]]) { p[v[y]].erase(y); pq.push({-p[v[y]].size(), v[y]}); } } if (flag) { cout << YES << endl; for (int i = m + 1; i < m + 1 + m; i++) { if (!ans[i]) cout << 0; else cout << 1; } cout << endl; } else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int gi() { int w = 0, q = 0; char c = getchar(); while ((c < 0 || c > 9 ) && (c != - )) c = getchar(); if (c == - ) q = 1, c = getchar(); while (c >= 0 && c <= 9 ) w = w * 10 + c - 0 , c = getchar(); return q ? -w : w; } int n, k; long long a[500000], d[500000]; int main() { n = gi(), k = gi(); long long ans = 0, sum = 0; for (int i = 1; i <= n; ++i) a[i] = gi(); for (int i = 1; i <= n; ++i) d[i] = gi(); for (int i = n; i; --i) { sum += 1ll * a[i]; if ((i == 1) && (k == 1)) continue; ans = max(ans, sum - d[i]); } if (!k) printf( %I64d n , ans), exit(0); sum -= d[1]; for (int i = 2; i < n; ++i) ans = max(ans, sum - a[i] + max(0ll, a[i] - d[i])); long long mn = 5000000, mn1 = 5000000; sum = 0; for (int i = 1; i < n; ++i) { sum += 1ll * a[i]; if (d[i] < mn) mn1 = mn, mn = d[i]; else if (d[i] == mn) mn1 = d[i]; else mn1 = min(mn1, d[i]); } ans = max(ans, sum + 1ll * (max(0ll, a[n] - d[n]) - mn)); if (k == 1) ans = max(ans, sum + 1ll * (a[n] - mn - mn1)); else ans = max(ans, sum + 1ll * (a[n] - mn)); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> b[5001]; for (int i = 0; i < n; i++) { string s; int a, b1, c; cin >> s >> a >> b1; if (s[0] == M ) c = 0; else c = 1; b[i].push_back(c); b[i].push_back(a); b[i].push_back(b1); } int ans = 0; for (int i = 1; i <= 366; i++) { int m[2] = {}; for (int j = 0; j < n; j++) { if (b[j][1] <= i && b[j][2] >= i) m[b[j][0]]++; } ans = max(ans, 2 * min(m[0], m[1])); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, m, ar[1000005], sum, t, ar2[1000005]; vector<int> ans; vector<pair<int, char> > res; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin >> n; for (long long int i = 1; i <= n; i++) cin >> ar[i]; cin >> m; for (long long int i = 1; i <= m; i++) cin >> ar2[i]; long long int top = 0; long long int l = 1; for (long long int i = 1; i <= n + 1; i++) { if (l > m) return cout << NO , 0; if (top < ar2[l]) { top += ar[i]; continue; } if (top > ar2[l]) return cout << NO , 0; ans.push_back(i - 1); l++; top = ar[i]; } if (top || l <= m) return cout << NO , 0; cout << n ; int last = 1; long long int cnt = 0; for (int h = 0; h < ans.size(); h++) { long long int y = ans[h]; long long int mk = 0, mn = INT_MAX; for (int i = last; i <= y; i++) { mk = max(mk, ar[i]); mn = min(mn, ar[i]); } if (last == y) { last++; cnt = y - h - 1; continue; } if (mn == mk) { return cout << NO , 0; } long long int mki = 0; char mki2; long long int z = y - last + 1; for (long long int i = last; i <= y; i++) { if (ar[i] != mk) continue; if (i != last && ar[i - 1] != ar[i]) { mki = i; mki2 = L ; res.push_back({mki - cnt, mki2}); mki--; break; } if (i != y && ar[i] != ar[i + 1]) { mki = i; mki2 = R ; res.push_back({mki - cnt, mki2}); break; } } z--; z--; while (mki > last) { res.push_back({mki - cnt, L }); mki--; z--; } while (z--) { res.push_back({mki - cnt, R }); } cnt = y - h - 1; last = y + 1; } cout << YES << n ; for (int i = 0; i < res.size(); i++) cout << res[i].first << << res[i].second << n ; } |
#include <bits/stdc++.h> const int N = 100010; const long long INF = 1ll << 60; const int inf = 0x3f3f3f3f; int t; int n, m, k; int a[N]; int b[N]; std::vector<int> row[N]; std::vector<int> col[N]; int cur; int r, c; long long ans; int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= k; ++i) { scanf( %d%d , &a[i], &b[i]); row[a[i]].push_back(b[i]); col[b[i]].push_back(a[i]); } for (int i = 1; i <= n; ++i) { row[i].push_back(m + 1); row[i].push_back(0); std::sort(row[i].begin(), row[i].end()); } for (int j = 1; j <= m; ++j) { col[j].push_back(n + 1); col[j].push_back(0); std::sort(col[j].begin(), col[j].end()); } r = 1; c = 1; ans = 1ll; int r_max = inf; int c_max = inf; int r_min = 2; int c_min = -inf; for (int i = 1; i <= 2 * (n + m) + 1; ++i) { if (!cur) { auto x = std::lower_bound(row[r].begin(), row[r].end(), c); int c_nxt = (*x) - 1; c_nxt = std::min(c_nxt, c_max); assert(c_nxt >= c); ans += c_nxt - c; if (c == c_nxt && i != 1) { break; } c = c_nxt; c_max = c - 1; } else if (cur == 1) { auto x = std::lower_bound(col[c].begin(), col[c].end(), r); int r_nxt = (*x) - 1; r_nxt = std::min(r_nxt, r_max); assert(r_nxt >= r); ans += r_nxt - r; if (r == r_nxt && i != 1) { break; } r = r_nxt; r_max = r - 1; } else if (cur == 2) { auto x = std::lower_bound(row[r].begin(), row[r].end(), c); --x; int c_nxt = (*x) + 1; c_nxt = std::max(c_nxt, c_min); assert(c_nxt <= c); ans += c - c_nxt; if (c == c_nxt && i != 1) { break; } c = c_nxt; c_min = c + 1; } else if (cur == 3) { auto x = std::lower_bound(col[c].begin(), col[c].end(), r); --x; int r_nxt = (*x) + 1; r_nxt = std::max(r_nxt, r_min); assert(r_nxt <= r); ans += r - r_nxt; if (r == r_nxt && i != 1) { break; } r = r_nxt; r_min = r + 1; } cur = (cur + 1) % 4; } if (ans + k != 1ll * n * m) { printf( NO n ); } else { printf( YES n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; cout << n / 2 + 1 << n ; } int main() { int tc, cse = 0; cin >> tc; while (tc--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int ans[maxn]; int lowbit(int x) { return x & -x; } bool is_two(int x) { return x == lowbit(x); } bool dfs(int n, int k, int id) { if (k == 1) { printf( %d %d %d n , n, k, id); if (is_two(n)) { return false; } ans[id] = max(id - 2, 0); for (int i = 2; i <= n; ++i) { ans[id + i - 1] = id + i / 2 - 1; } return true; } else if (k == 0) { if (is_two(n)) { ans[1] = 0; for (int i = 2; i <= n; ++i) { ans[i] = i / 2; } return true; } else return false; } else { while (k >= 2) { ans[id] = max(id - 2, 0); ans[id + 1] = id; n -= 2; k -= 1; id += 2; } return dfs(n, k, id); } } int main() { int n, k; scanf( %d%d , &n, &k); int lim = max(0, (n - 3) / 2); if (n % 2 == 0 || k > lim || (n == 9 && k == 2) || (!is_two(n + 1) && k == 0) || (is_two(n + 1) && k == 1)) { printf( NO n ); } else { int id = 1; while (k >= 2) { ans[id] = max(id - 2, 0); ans[id + 1] = id; n -= 2; k -= 1; id += 2; } ans[id] = max(id - 2, 0); for (int i = 2; i <= n - 2; ++i) { ans[id + i - 1] = id + i / 2 - 1; } if (is_two(n + 1)) { if (k == 0) ans[id + n - 2] = id + (n - 1) / 2 - 1, ans[id + n - 1] = id + n / 2 - 1; else ans[id + n - 2] = 2, ans[id + n - 1] = 2; } else { if (k == 0) return printf( NO n ), 0; else ans[id + n - 2] = id + (n - 1) / 2 - 1, ans[id + n - 1] = id + n / 2 - 1; } printf( YES n ); for (int i = 1; i < id + n - 1; ++i) { printf( %d , ans[i]); } printf( %d n , ans[id + n - 1]); } } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1, inf = 1e18; vector<pair<long long, long long> > a, b; vector<pair<pair<long long, long long>, long long> > z; long long add[4 * N], t[4 * N]; void push(long long v, long long l, long long r) { t[v] += add[v]; if (l != r - 1) { add[2 * v] += add[v]; add[2 * v + 1] += add[v]; } add[v] = 0; } void update(long long v, long long l, long long r, long long vl, long long vr, long long val) { push(v, l, r); if (l >= vr || vl >= r) return; if (l >= vl && r <= vr) { add[v] += val; push(v, l, r); return; } long long m = (l + r) / 2; update(2 * v, l, m, vl, vr, val); update(2 * v + 1, m, r, vl, vr, val); t[v] = max(t[2 * v + 1], t[2 * v]); } long long get(long long v, long long l, long long r, long long vl, long long vr) { push(v, l, r); if (l >= vr || vl >= r) return -inf; if (l >= vl && r <= vr) { return t[v]; } long long m = (l + r) / 2; return max(get(2 * v, l, m, vl, vr), get(2 * v + 1, m, r, vl, vr)); } void fuckyou(long long v, long long l, long long r, long long pos, long long val) { if (l > pos || r <= pos) return; if (l == r - 1) { t[v] = max(t[v], val); return; } long long m = (l + r) / 2; fuckyou(2 * v, l, m, pos, val); fuckyou(2 * v + 1, m, r, pos, val); t[v] = max(t[2 * v], t[2 * v + 1]); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (long long i = 0; i < 4 * N; i++) t[i] = -inf; long long n, m, p, ans = -inf; cin >> n >> m >> p; a.resize(n); b.resize(m); z.resize(p); for (long long i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } for (long long i = 0; i < m; i++) { cin >> b[i].first >> b[i].second; fuckyou(1, 0, N, b[i].first, -b[i].second); } for (long long i = 0; i < p; i++) { cin >> z[i].first.first >> z[i].first.second >> z[i].second; } sort((z).begin(), (z).end()); sort((a).begin(), (a).end()); cout << endl; long long j = 0; for (long long i = 0; i < n; i++) { while (j < z.size() && a[i].first > z[j].first.first) { update(1, 0, N, z[j].first.second + 1, N, z[j].second); j++; } ans = max(ans, -a[i].second + get(1, 0, N, 0, N)); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; string s; string rev(string s) { string p; for (auto i : s) p.insert(0, 1, i); return p; } int main() { cin >> s; int n = s.size(); for (int i = 0; i <= s.size(); i++) for (int j = 0; j < 26; j++) { string p = s; p.insert(i, 1, j + a ); if (p == rev(p)) return cout << p, 0; } cout << NA ; } |
#include <bits/stdc++.h> struct PP { int l, r, sum, lv, rv, cover; int mid() { return (l + r) >> 1; } void doit() { sum = lv = rv = cover ? 0 : dis(); } int dis() { return r - l; } } q[100005 * 3]; int max(int a, int b) { return a > b ? a : b; } void Build(int l, int r, int x) { q[x].l = l; q[x].r = r; q[x].sum = q[x].lv = q[x].rv = q[x].dis(); q[x].cover = -1; if (l == r - 1) return; int mid = q[x].mid(); Build(l, mid, (x << 1)); Build(mid, r, ((x << 1) | 1)); } void pushdown(int x) { q[(x << 1)].cover = q[((x << 1) | 1)].cover = q[x].cover; q[(x << 1)].doit(); q[((x << 1) | 1)].doit(); q[x].cover = -1; } void Pushup(int x) { q[x].sum = max(q[(x << 1)].rv + q[((x << 1) | 1)].lv, max(q[(x << 1)].sum, q[((x << 1) | 1)].sum)); q[x].lv = q[(x << 1)].lv; q[x].rv = q[((x << 1) | 1)].rv; if (q[(x << 1)].sum == q[(x << 1)].dis()) q[x].lv += q[((x << 1) | 1)].lv; if (q[((x << 1) | 1)].sum == q[((x << 1) | 1)].dis()) q[x].rv += q[(x << 1)].rv; } void update(int l, int r, int c, int x) { if (l <= q[x].l && q[x].r <= r) { q[x].cover = c; q[x].doit(); return; } if (q[x].cover != -1) pushdown(x); int mid = q[x].mid(); if (l < mid) update(l, r, c, (x << 1)); if (mid < r) update(l, r, c, ((x << 1) | 1)); Pushup(x); } int query(int w, int x) { if (q[x].sum >= w && q[x].cover == 0) return q[x].l; if (q[x].cover != -1) pushdown(x); if (q[(x << 1)].sum >= w) return query(w, (x << 1)); else if (q[(x << 1)].rv + q[((x << 1) | 1)].lv >= w) return q[(x << 1)].r - q[(x << 1)].rv; else if (q[((x << 1) | 1)].sum >= w) return query(w, ((x << 1) | 1)); else return -1; } struct SS { int l, r; } cnt[100005]; int main() { int i, m, op, a; int L, B, F; while (scanf( %d%d%d , &L, &B, &F) != EOF) { scanf( %d , &m); Build(0, B + L + F, 1); for (i = 1; i <= m; i++) { scanf( %d%d , &op, &a); if (op == 1) { int pos = query(B + a + F, 1); if (pos == -1) { printf( -1 n ); continue; } printf( %d n , pos); update(pos + B, pos + B + a, 1, 1); cnt[i].l = pos + B; cnt[i].r = pos + B + a; } else update(cnt[a].l, cnt[a].r, 0, 1); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxN = 200000; int n, m, t, tin[mxN]; vector<int> adj[mxN], e[mxN]; vector<array<int, 3>> ans; void dfs(int u, int p = -1) { tin[u] = ++t; if (p ^ -1) e[u].push_back(p); for (int v : adj[u]) { if (v == p) continue; if (!tin[v]) { dfs(v, u); } else if (tin[v] < tin[u]) { e[u].push_back(v); } } while (e[u].size() >= 2) { int v = e[u].back(); e[u].pop_back(); int w = e[u].back(); e[u].pop_back(); ans.push_back({v, u, w}); } if (e[u].size() == 1 && p ^ -1) e[p].push_back(u); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v, --u, --v; adj[u].push_back(v); adj[v].push_back(u); } for (int i = 0; i < n; ++i) if (!tin[i]) dfs(i); cout << ans.size() << n ; for (array<int, 3> x : ans) cout << x[0] + 1 << << x[1] + 1 << << x[2] + 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } const int N = int(2e5) + 10; const int M = int(1e5) + 5; const int INF = int(1e9); int U[N], V[N], W[N], vis[N], D[N], comp[N], val[N], ans[N], parent; vector<int> g[N], rg[N], G[N], nodes; int n, m; int adj(int u, int e) { return U[e] ^ V[e] ^ u; } void get(int u) { nodes.push_back(u); nodes.push_back(u + M); vis[u] = 1; for (auto e : G[u]) { int w = adj(u, e); if (vis[w]) continue; get(w); } } int NOT(int u) { if (u < M) return u + M; else return u - M; } void addEdge(int u, int v) { u = NOT(u); g[u].push_back(v); rg[v].push_back(u); u = NOT(u); v = NOT(v); swap(u, v); g[u].push_back(v); rg[v].push_back(u); } void clear(int u) { g[u].clear(), rg[u].clear(), vis[u] = 0, val[u] = 0, comp[u] = 0; for (auto e : G[u]) D[e] = 0; } vector<int> order, component; void dfs1(int u) { vis[u] = 1; for (auto w : g[u]) if (!vis[w]) dfs1(w); order.push_back(u); } void dfs2(int u) { vis[u] = 1; comp[u] = parent; for (auto w : rg[u]) if (!vis[w]) dfs2(w); } int go(int t) { for (auto u : nodes) clear(u); for (auto u : nodes) for (auto e : G[u]) if (!D[e]) { D[e] = 1; if (W[e] == t) addEdge(U[e], V[e]), addEdge(NOT(U[e]), NOT(V[e])); else addEdge(U[e], NOT(V[e])), addEdge(NOT(U[e]), V[e]); } order.clear(); for (auto i : nodes) if (!vis[i]) dfs1(i); for (auto u : nodes) vis[u] = 0; reverse(order.begin(), order.end()); vector<int> Cmp; for (auto i : order) { if (!vis[i]) parent = i, Cmp.push_back(i), dfs2(i); } for (auto u : nodes) { if (comp[u] == comp[NOT(u)]) return INF; } reverse(Cmp.begin(), Cmp.end()); int a = 0, b = 0; for (auto u : Cmp) { if (!val[u]) { val[u] = 1; val[comp[NOT(u)]] = -1; } } for (auto u : nodes) if (u < M) (val[comp[u]] == 1) ? a++ : b++; int V = (a > b ? 0 : 1); for (auto u : nodes) if (u < M && val[comp[u]] == 1) ans[u] = V; else if (u < M) ans[u] = 1 - V; return min(a, b); } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { char x; scanf( %d %d %c , U + i, V + i, &x); G[U[i]].push_back(i); G[V[i]].push_back(i); W[i] = (x == R ? 1 : 0); } long long int Ans1 = 0, Ans2 = 0; for (int i = 1; i <= n; i++) if (!vis[i]) { nodes.clear(); get(i); Ans1 += go(0); Ans2 += go(1); } long long int Ans = min(Ans1, Ans2); if (Ans >= INF) puts( -1 ); else { printf( %lld n , Ans); int t = (Ans == Ans1 ? 0 : 1); memset(vis, 0, sizeof(vis)); for (int i = 1; i <= n; i++) if (!vis[i]) { nodes.clear(); get(i); go(t); } for (int i = 1; i <= n; i++) if (ans[i]) printf( %d , i); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; if (n == 47 || n == 74 || n == 477 || n == 477) cout << YES ; else if (n % 4 == 0 || n % 7 == 0 || n % 47 == 0) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n, arr[105]; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; int ans = arr[0]; for (int i = 1; i < n; i++) { ans = gcd(ans, arr[i]); } cout << ans * n << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, r; cin >> n >> m >> r; vector<int> v(n); vector<int> v1(m); for (int i = 0; i < n; i++) { cin >> v[i]; } for (int i = 0; i < m; i++) { cin >> v1[i]; } sort(v.begin(), v.end()); sort(v1.rbegin(), v1.rend()); if (v[0] > v1[0]) { cout << r << endl; return 0; } int cnt = 0; cnt += r % v[0]; cnt += (r / v[0]) * v1[0]; cout << cnt; } |
#include <bits/stdc++.h> using namespace std; int ured() { int re = 0, ch; do { ch = getchar(); } while ( 9 < ch || ch < 0 ); do { re = re * 10 + (ch ^ 0 ); } while ( 0 <= (ch = getchar()) && ch <= 9 ); return re; } void uwit(int da) { int cn = 0, ch[21]; do { ch[++cn] = da - da / 10 * 10; } while (da /= 10); do { putchar( 0 ^ ch[cn]); } while (--cn); } inline void dmax(int& fr, int to) { if (fr < to) { fr = to; } } inline void dmin(int& fr, int to) { if (fr > to) { fr = to; } } inline int mabs(int da) { return da >= 0 ? da : -da; } const int _maxn = 200011, _mods = 1000000007; int t, n, m, pdif; char s[_maxn]; int main() { t = ured(); while (t--) { n = ured(); m = ured(); if (m >= 2 * n) { uwit((m + 1) / 2 - 1); } else { uwit(m - n); } putchar( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, res = 1; long long a[100005]; long long b[100005]; long long d = 1, ans; int main() { cin >> n >> k; for (int i = 0; i < k; i++) d *= 10; for (int i = 0; i < n / k; i++) cin >> a[i]; for (int i = 0; i < n / k; i++) cin >> b[i]; for (int i = 0; i < n / k; i++) { ans = (d - 1) / a[i] + 1; if (b[i] == 0) ans -= ((d / 10) - 1) / a[i] + 1; else ans -= ((b[i] + 1) * (d / 10) - 1) / a[i] - ((b[i]) * (d / 10) - 1) / a[i]; res = (res * ans) % (1000000007); } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long X = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); return X * w; } const long long _ = 1e18; signed main() { long long a = read(), q = (_ % a * 9 % a * 9 % a + 1) % a; printf( %lld %lld n , a - q + 1, a - q + _); return 0; } |
#include <bits/stdc++.h> using namespace std; long double PI = acosl(-1); bool compare_int(int a, int b) { return (a > b); } bool compare_string(string a, string b) { return a.size() < b.size(); } bool compare_pair(const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) return a.first < b.first; else return (a.second > b.second); } bool cmp(pair<string, int> x, pair<string, int> y) { return (x.second < y.second); } long long int bigmod(long long int a, long long int b, long long int m) { if (b == 0) return 1 % m; long long int x = bigmod(a, b / 2, m); x = (x * x) % m; if (b % 2 == 1) x = (x * a) % m; return x; } void NA() { printf( NO n ); exit(0); } void YA() { printf( YES n ); exit(0); } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; long long int mx = 0LL, mn = 0LL; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { mx = (mx + bigmod(2, i, 1000000007) * a[i]) % 1000000007; mn = (mn + bigmod(2, n - i - 1, 1000000007) * a[i]) % 1000000007; } cout << (mx - mn + 1000000007) % 1000000007 << endl; } |
#include <bits/stdc++.h> using namespace std; void abc() { cout << endl; } template <typename T, typename... U> void abc(T a, U... b) { cout << a << , abc(b...); } template <typename T> void printv(T l, T r) { while (l != r) cout << *l << n [++l == r]; } template <typename A, typename B> istream& operator>>(istream& o, pair<A, B>& a) { return o >> a.first >> a.second; } template <typename A, typename B> ostream& operator<<(ostream& o, pair<A, B> a) { return o << ( << a.first << , << a.second << ) ; } template <typename T> ostream& operator<<(ostream& o, vector<T> a) { bool is = false; for (T i : a) { o << (is ? : { ), is = true, o << i; } return o << } ; } template <typename T> struct vv : vector<vector<T>> { vv(int n, int m, T v) : vector<vector<T>>(n, vector<T>(m, v)) {} vv() {} }; template <typename T> struct vvv : vector<vv<T>> { vvv(int n, int m, int k, T v) : vector<vv<T>>(n, vv<T>(m, k, v)) {} vvv() {} }; const int mod = 1e9 + 7, N = 200001, logN = 20, K = 80000; long long int modpow(long long int a, int b) { long long int ans = 1; for (; b; b >>= 1, a = a * a % mod) { if (b & 1) ans = ans * a % mod; } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); vv<long long int> inv(n, n, 0); for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) { inv[i][j] = modpow((a[i] + a[j]) % mod, mod - 2); } vv<long long int> pre(1 << n, n, 1); vv<long long int> pw(n, n + 1, 1); for (int i = 0; i < n; ++i) { for (int j = 1; j <= n; ++j) { pw[i][j] = pw[i][j - 1] * a[i] % mod; } } for (int i = 0; i < n; ++i) { for (int s = 0; s < 1 << n; ++s) { for (int j = 0; j < n; ++j) if (s >> j & 1) { pre[s][i] = pre[s][i] * inv[i][j] % mod; } } } vector<long long int> dp(1 << n, 1); for (int s = 0; s < 1 << n; ++s) { for (int t = s ^ (s & (-s)); t > 0; t = (t - 1) & s) { long long int res = dp[t]; for (int j = 0; j < n; ++j) if (t >> j & 1) { res = res * pre[t ^ s][j] % mod * pw[j][__builtin_popcount(t ^ s)] % mod; } dp[s] -= res; if (dp[s] < 0) dp[s] += mod; } } long long int ans = 0; for (int s = 0; s < 1 << n; ++s) { int k = __builtin_popcount(s); long long int res = dp[s]; for (int i = 0; i < n; ++i) if (s >> i & 1) { for (int j = 0; j < n; ++j) if (~s >> j & 1) { res = res * a[i] % mod * inv[i][j] % mod; } } ans += res * k % mod; if (ans >= mod) ans -= mod; } cout << ans << endl; } |
#include <bits/stdc++.h> int main() { int t, res = 0; long x, y, n; std::cin >> t; for (int i = 0; i < t; i++) { std::cin >> x >> y >> n; if (n > 0) { res = (n - y) % x; std::cout << n - res << n ; } else { std::cout << 0 << n ; } } } |
#include <bits/stdc++.h> using namespace std; int N, i, j; string S, R; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> S; for (i = N - 2; i >= 0; i -= 2) { R = R + S[i]; } if (N % 2 == 0) i = 1; else i = 0; for (i = i; i < N; i += 2) { R = R + S[i]; } cout << R << endl; } |
#include <bits/stdc++.h> template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar(); if (flag) x = -x; } using namespace std; int n, q, nn; bitset<2011> bt[1011][2], h[2011]; int htot; int ans[2011], pos[2011]; inline void Gauss() { int nw = 1; for (int i = 1; i < nn; ++i) { int id = -1; for (int hang = nw; hang <= htot; ++hang) if (h[hang][i]) { id = hang; break; } if (id == -1) continue; swap(h[id], h[nw]); pos[i] = nw; for (int hang = 1; hang <= htot; ++hang) if (hang != nw && h[hang][i]) { h[hang] = h[hang] ^ h[nw]; } ++nw; if (nw > htot) break; } for (int i = 1; i <= htot; ++i) if (h[i][nn]) { bool flag = false; for (int j = 1; j < nn; ++j) if (h[i][j]) { flag = true; break; } if (!flag) { puts( NO ); exit(0); } } for (int i = 1; i < nn; ++i) { ans[i] = h[pos[i]][nn]; } puts( YES ); for (int i = 1; i <= n; ++i) { if (ans[i] == 0 && ans[i + n] == 0) putchar( . ); else if (ans[i] == 1 && ans[i + n] == 0) putchar( R ); else if (ans[i] == 0 && ans[i + n] == 1) putchar( B ); else putchar( Y ); } putchar( n ); } int main() { read(n), read(q); nn = n + n + 1; for (int i = 1; i <= n; ++i) bt[i][0][i] = bt[i][1][i + n] = 1; for (int i = 1; i <= q; ++i) { char opt[6]; scanf( %s , opt); if (opt[0] == m ) { int k; read(k); htot += 2; for (int j = 1; j <= k; ++j) { int p; read(p); h[htot - 1] ^= bt[p][0]; h[htot] ^= bt[p][1]; } char res[3]; scanf( %s , res); if (res[0] == W ) h[htot - 1][nn] = 0, h[htot][nn] = 0; else if (res[0] == R ) h[htot - 1][nn] = 1, h[htot][nn] = 0; else if (res[0] == B ) h[htot - 1][nn] = 0, h[htot][nn] = 1; else h[htot - 1][nn] = 1, h[htot][nn] = 1; } else if (opt[0] == R && opt[1] == Y ) { int k; read(k); for (int j = 1; j <= k; ++j) { int p; read(p); bt[p][1] = bt[p][1] ^ bt[p][0]; } } else if (opt[0] == R && opt[1] == B ) { int k; read(k); for (int j = 1; j <= k; ++j) { int p; read(p); swap(bt[p][0], bt[p][1]); } } else if (opt[0] == Y && opt[1] == B ) { int k; read(k); for (int j = 1; j <= k; ++j) { int p; read(p); bt[p][0] = bt[p][0] ^ bt[p][1]; } } } Gauss(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, j, t, n, k, a, b; double v; string line; char s[4]; int main() { while (cin >> n >> a >> b) { if (b < 0) b = n + b; a = a + b; a = a % n; if (a == 0) a = n; else if (a < 0) a = n + a; cout << a; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300005; pair<int, int> p[N]; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int i = 0, j = 0; while (j < n) { if (a[i] < a[j]) i++; j++; } cout << i << endl; return 0; } |
#include <bits/stdc++.h> const int INF = (int)1e9; using namespace std; const int MAX = 1e3 + 5; int n, xa, ya, xb, yb; pair<pair<int, int>, int> arr[MAX]; vector<pair<int, int> > vec; bool covered(int x1, int y1, int x2, int y2, int R) { double dist = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); return dist <= (double)R; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> xa >> ya >> xb >> yb >> n; for (int i = 0; i < n; i++) { cin >> arr[i].first.first >> arr[i].first.second >> arr[i].second; } if (xa > xb) swap(xa, xb); if (ya > yb) swap(ya, yb); for (int i = ya; i <= yb; i++) { vec.push_back(make_pair(xa, i)); vec.push_back(make_pair(xb, i)); } for (int i = xa + 1; i < xb; i++) { vec.push_back(make_pair(i, ya)); vec.push_back(make_pair(i, yb)); } int res = 0; for (int i = 0; i < vec.size(); i++) { bool flag = false; for (int j = 0; j < n; j++) { if (covered(vec[i].first, vec[i].second, arr[j].first.first, arr[j].first.second, arr[j].second)) { flag = true; break; } } if (!flag) res++; } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, m, fa[N], f[N], d[N], head[N], xx, yy, ww, fr[N]; int ans; bool in[N], c[N]; struct nd { int x, y, w, id; } a[N]; bool operator<(nd a, nd b) { return a.w < b.w || (a.w == b.w && a.id < b.id); } struct ndd { int ne, to, w; } e[N]; void ins(int x, int y, int w) { static int cnt; e[++cnt].to = y; e[cnt].ne = head[x]; head[x] = cnt; e[cnt].w = w; } int gf(int x) { return fa[x] == x ? x : fa[x] = gf(fa[x]); } void dfs(int x) { for (int i = head[x]; i; i = e[i].ne) if (e[i].to != f[x]) { int y = e[i].to; f[y] = x; d[y] = d[x] + 1; fr[y] = e[i].w; dfs(y); } } void col(int x, int b) { c[x] = 1; for (int i = head[x]; i; i = e[i].ne) if (e[i].to != b) { int y = e[i].to; col(y, x); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; ++i) { scanf( %d%d%d , &a[i].x, &a[i].y, &a[i].w); a[i].id = i; } xx = a[1].x, yy = a[1].y, ww = a[1].w; sort(a + 1, a + m + 1); for (int i = 1; i <= n; ++i) fa[i] = i; for (int i = 1; i <= m; ++i) { int fx = gf(a[i].x), fy = gf(a[i].y); if (fx != fy) { fa[fx] = fy; in[a[i].id] = 1; ins(a[i].x, a[i].y, a[i].w); ins(a[i].y, a[i].x, a[i].w); } } d[1] = 1; dfs(1); if (!in[1]) { while (xx != yy) { if (d[xx] < d[yy]) swap(xx, yy); ans = max(ans, fr[xx]); xx = f[xx]; } } else { ans = 1e9; col(yy, xx); for (int i = 1; i <= m; ++i) if (!in[a[i].id]) { if (c[a[i].x] ^ c[a[i].y]) ans = min(ans, a[i].w); } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; struct point { long long x, y, z; point() {} point(long long a, long long b, long long c) : x(a), y(b), z(c) {} double operator()(point y) { return sqrt((this->x - y.x) * (this->x - y.x) + (this->y - y.y) * (this->y - y.y) + (this->z - y.z) * (this->z - y.z)); } }; vector<pair<int, int>> ans; int taken[10005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; long long a, b, c; point arr[n]; for (int i = 0; i < n; i++) { cin >> a >> b >> c; point p(a, b, c); arr[i] = p; } for (int i = 0; i < n; i++) { double minimum = 1e11; int correct; if (taken[i]) continue; for (int j = 0; j < n; j++) { if (i == j || taken[j]) continue; double x = arr[i](arr[j]); if (x < minimum) { minimum = x; correct = j; } } taken[correct] = 1; taken[i] = 1; ans.push_back({i, correct}); } for (int i = 0; i < n / 2; i++) cout << ans[i].first + 1 << << ans[i].second + 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M; int d[300010]; int h[300010]; pair<long long, int> L[8 * 300010]; pair<long long, int> R[8 * 300010]; void aggL(int nodo, int left, int right, int pos, long long val) { if (left == right) { L[nodo] = pair<long long, int>(val, pos); return; } int mid = (left + right) / 2; if (pos <= mid) aggL(nodo * 2, left, mid, pos, val); else aggL(nodo * 2 + 1, mid + 1, right, pos, val); L[nodo] = max(L[nodo * 2], L[nodo * 2 + 1]); } void aggR(int nodo, int left, int right, int pos, long long val) { if (left == right) { R[nodo] = pair<long long, int>(val, pos); return; } int mid = (left + right) / 2; if (pos <= mid) aggR(nodo * 2, left, mid, pos, val); else aggR(nodo * 2 + 1, mid + 1, right, pos, val); R[nodo] = max(R[nodo * 2], R[nodo * 2 + 1]); } pair<long long, int> qL(int nodo, int left, int right, int l, int r) { if (left == l && right == r) return L[nodo]; int mid = (left + right) / 2; if (r <= mid) return qL(nodo * 2, left, mid, l, r); if (l >= mid + 1) return qL(nodo * 2 + 1, mid + 1, right, l, r); if (l <= mid && r >= mid + 1) return max(qL(nodo * 2, left, mid, l, mid), qL(nodo * 2 + 1, mid + 1, right, mid + 1, r)); } pair<long long, int> qR(int nodo, int left, int right, int l, int r) { if (left == l && right == r) return R[nodo]; int mid = (left + right) / 2; if (r <= mid) return qR(nodo * 2, left, mid, l, r); if (l >= mid + 1) return qR(nodo * 2 + 1, mid + 1, right, l, r); if (l <= mid && r >= mid + 1) return max(qR(nodo * 2, left, mid, l, mid), qR(nodo * 2 + 1, mid + 1, right, mid + 1, r)); } int main() { ifstream in( input.txt ); cin >> N >> M; for (int i = 0; i < N; i++) cin >> d[i]; for (int i = 0; i < N; i++) cin >> h[i]; for (int i = 0; i < 8 * 300010; i++) L[i].first = R[i].first = LLONG_MIN; long long temp = 0; for (int i = 0; i < N; i++) { aggR(1, 0, 2 * 300010 - 1, i, temp + h[i] * 2); aggL(1, 0, 2 * 300010 - 1, i, h[i] * 2 - temp); temp += d[i]; } for (int i = 0; i < N; i++) { aggR(1, 0, 2 * 300010 - 1, i + N, temp + h[i] * 2); aggL(1, 0, 2 * 300010 - 1, i + N, h[i] * 2 - temp); temp += d[i]; } for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--; b--; if (a <= b) { temp = qR(1, 0, 2 * 300010 - 1, b + 2, N + a - 1).first; int pos = qR(1, 0, 2 * 300010 - 1, b + 2, N + a - 1).second; temp += qL(1, 0, 2 * 300010 - 1, b + 1, pos - 1).first; long long res = temp; temp = qL(1, 0, 2 * 300010 - 1, b + 1, N + a - 2).first; pos = qL(1, 0, 2 * 300010 - 1, b + 1, N + a - 2).second; temp += qR(1, 0, 2 * 300010 - 1, pos + 1, N + a - 1).first; res = max(res, temp); cout << res << endl; } else { temp = qR(1, 0, 2 * 300010 - 1, b + 2, a - 1).first; int pos = qR(1, 0, 2 * 300010 - 1, b + 2, a - 1).second; temp += qL(1, 0, 2 * 300010 - 1, b + 1, pos - 1).first; long long res = temp; temp = qL(1, 0, 2 * 300010 - 1, b + 1, a - 2).first; pos = qL(1, 0, 2 * 300010 - 1, b + 1, a - 2).second; temp += qR(1, 0, 2 * 300010 - 1, pos + 1, a - 1).first; res = max(res, temp); cout << res << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 200005, INF = 2000000000000000000; long double pi = 3.1415926535897932; long long powere(long long a, long long b, long long p) { if (a == 0) return 0; long long res = 1; a %= p; while (b > 0) { if (b & 1) res = (res * a) % p; b >>= 1; a = (a * a) % p; } return res; } void copy(long long a[2][2], long long b[2][2]) { for (long long i = 0; i < 2; i++) { for (long long j = 0; j < 2; j++) b[i][j] = a[i][j]; } } void matmult(long long m1[2][2], long long m2[2][2], long long m3[2][2]) { for (long long i = 0; i < 2; i++) { for (long long j = 0; j < 2; j++) { m3[i][j] = 0; for (long long k = 0; k < 2; k++) { m3[i][j] += (m1[i][k] % 1000000007 * m2[k][j] % 1000000007) % 1000000007; m3[i][j] %= 1000000007; } } } } void power(long long mat[2][2], long long b, long long p, long long finres[2][2]) { long long res[2][2] = {{0}}, cc[2][2]; res[0][0] = res[1][1] = 1; while (b > 0) { copy(res, cc); if (b & 1) matmult(mat, cc, res); copy(mat, cc); b >>= 1; matmult(cc, cc, mat); } copy(res, finres); } int32_t main() { std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout.precision(std::numeric_limits<double>::max_digits10); ; long long t; cin >> t; while (t--) { long long x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; long long x = abs(x1 - x2), y = abs(y1 - y2); if (y < x) swap(x, y); long long ans = (x * (x + 1)); ans += ((y - x - 1) * x); cout << ans + 1 << n ; } } |
#include <bits/stdc++.h> using namespace std; void fun(long long int a, long long int b, long long int u, vector<long long int> &t) { long long int i, j, k, n; for (i = 1; i < b; i++) { if (u) t[i]++; } u = 1 - u; i = b; while (i < 1000) { for (j = 0; j < a; j++) { if (i >= 1000) return; if (u) t[i]++; i++; } u = 1 - u; } } void solve() { long long int i, j, k, n; cin >> n; string s; cin >> s; vector<pair<long long int, long long int> > v(n); vector<long long int> t(1000, 0); for (i = 0; i < n; i++) { if (s[i] == 1 ) t[0]++; } for (i = 0; i < n; i++) { cin >> v[i].first >> v[i].second; } for (i = 0; i < n; i++) { fun(v[i].first, v[i].second, s[i] - 0 , t); } long long int mx = t[0]; for (i = 1; i < (int)t.size(); i++) mx = max(mx, t[i]); cout << mx; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q, x, y; char type; map<int, pair<char, int> > Data; int solve() { auto fi = Data.lower_bound(x); if (fi->first == x) return 0; if (type == L ) fi--; int ans = abs(x - fi->first); if (fi->second.first == type) ans += fi->second.second; Data[x] = make_pair(type, ans); return ans; } int main() { scanf( %d %d , &n, &q); Data[0] = make_pair( U , 0); Data[n + 1] = make_pair( L , 0); while (q--) { cin >> x >> y >> type; printf( %d n , solve()); } } |
#include <bits/stdc++.h> using namespace std; const int M = 15, N = 15; int m, n; pair<int, int> a[M], b[N]; vector<int> tot, cur; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> m >> n; for (int i = 1; i <= m; i++) { cin >> a[i].first >> a[i].second; } for (int i = 1; i <= n; i++) { cin >> b[i].first >> b[i].second; } for (int i = 1; i <= m; i++) { cur.clear(); for (int j = 1; j <= n; j++) { int cnt = 0; if (a[i].first == b[j].first || a[i].first == b[j].second) { cnt++; } if (a[i].second == b[j].first || a[i].second == b[j].second) { cnt++; } if (cnt == 1) { if (a[i].first == b[j].first || a[i].first == b[j].second) { cur.push_back(a[i].first); } else { cur.push_back(a[i].second); } } } sort(cur.begin(), cur.end()); cur.erase(unique(cur.begin(), cur.end()), cur.end()); if (cur.size() >= 2) { return cout << -1, 0; } else if (cur.size() == 1) { tot.push_back(cur[0]); } } for (int i = 1; i <= n; i++) { cur.clear(); for (int j = 1; j <= m; j++) { int cnt = 0; if (b[i].first == a[j].first || b[i].first == a[j].second) { cnt++; } if (b[i].second == a[j].first || b[i].second == a[j].second) { cnt++; } if (cnt == 1) { if (b[i].first == a[j].first || b[i].first == a[j].second) { cur.push_back(b[i].first); } else { cur.push_back(b[i].second); } } } sort(cur.begin(), cur.end()); cur.erase(unique(cur.begin(), cur.end()), cur.end()); if (cur.size() >= 2) { return cout << -1, 0; } else if (cur.size() == 1) { tot.push_back(cur[0]); } } sort(tot.begin(), tot.end()); tot.erase(unique(tot.begin(), tot.end()), tot.end()); if (tot.size() >= 2) { cout << 0; } else { cout << tot[0]; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, t, i; cin >> t; for (i = 0; i < t; i++) { cin >> a >> b; cout << a + b; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long k, b, n, t, ans, cur; int main() { ios_base::sync_with_stdio(0); cin >> k >> b >> n >> t; ans = n; cur = k + b; while (cur <= t) { cur = cur * k + b; --ans; } if (ans < 0) ans = 0; cout << ans << endl; cin.get(); cin.get(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int n, q, L[maxn << 2], R[maxn << 2]; double sum[maxn << 2], add[maxn << 2], mul[maxn << 2]; void pushup(int o) { sum[o] = sum[o * 2] + sum[o * 2 + 1]; } void pushdown(int o) { sum[o * 2] = sum[o * 2] * mul[o] + add[o] * (R[o * 2] - L[o * 2] + 1); sum[o * 2 + 1] = sum[o * 2 + 1] * mul[o] + add[o] * (R[o * 2 + 1] - L[o * 2 + 1] + 1); add[o * 2] = add[o * 2] * mul[o] + add[o]; add[o * 2 + 1] = add[o * 2 + 1] * mul[o] + add[o]; mul[o * 2] = mul[o * 2] * mul[o]; mul[o * 2 + 1] = mul[o * 2 + 1] * mul[o]; mul[o] = 1; add[o] = 0; } void build(int o, int l, int r) { L[o] = l; R[o] = r; add[o] = 0; mul[o] = 1; if (l == r) { cin >> sum[o]; return; } int mid = (l + r) >> 1; build(o * 2, l, mid); build(o * 2 + 1, mid + 1, r); pushup(o); } double query(int o, int l, int r, int x, int y) { if (x <= l && r <= y) { return sum[o]; } pushdown(o); int mid = (l + r) >> 1; double res = 0.0; if (x <= mid) res += query(o * 2, l, mid, x, y); if (y > mid) res += query(o * 2 + 1, mid + 1, r, x, y); return res; } void update1(int o, int l, int r, int x, int y, double v) { if (x <= l && r <= y) { sum[o] += v * (r - l + 1); add[o] += v; return; } pushdown(o); int mid = (l + r) >> 1; if (x <= mid) update1(o * 2, l, mid, x, y, v); if (y > mid) update1(o * 2 + 1, mid + 1, r, x, y, v); pushup(o); } void update2(int o, int l, int r, int x, int y, double v) { if (x <= l && r <= y) { add[o] *= v; sum[o] *= v; mul[o] *= v; return; } pushdown(o); int mid = (l + r) >> 1; if (x <= mid) update2(o * 2, l, mid, x, y, v); if (y > mid) update2(o * 2 + 1, mid + 1, r, x, y, v); pushup(o); } int main() { scanf( %d%d , &n, &q); build(1, 1, n); while (q--) { int l1, r1, l2, r2; int id; scanf( %d , &id); if (id == 1) { scanf( %d%d%d%d , &l1, &r1, &l2, &r2); double sum1 = query(1, 1, n, l1, r1), sum2 = query(1, 1, n, l2, r2); double len1 = r1 - l1 + 1, len2 = r2 - l2 + 1; update2(1, 1, n, l1, r1, (len1 - 1) / len1); update2(1, 1, n, l2, r2, (len2 - 1) / len2); update1(1, 1, n, l1, r1, 1.0 / len1 * (sum2 / len2)); update1(1, 1, n, l2, r2, 1.0 / len2 * (sum1 / len1)); } else { scanf( %d%d , &l1, &r1); printf( %.7lf n , query(1, 1, n, l1, r1)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; void connected(vector<vector<bool> > chu, vector<bool>& v, int s) { v[s] = 1; for (int i = 0; i < chu.size(); i++) { if (chu[s][i] && !v[i]) { connected(chu, v, i); } } } int main() { int n, m; while (cin >> n >> m) { if (n != m) { cout << NO << endl; break; } vector<vector<bool> > chu(n, vector<bool>(n, 0)); for (int i = 0; i < m; i++) { int e1, e2; cin >> e1 >> e2; chu[e1 - 1][e2 - 1] = 1; chu[e2 - 1][e1 - 1] = 1; } vector<bool> visisted(n, 0); connected(chu, visisted, 0); bool allseen = true; for (int i = 0; i < visisted.size(); i++) { if (!visisted[i]) allseen = false; } if (allseen) { cout << FHTAGN! << endl; } else { cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> int n, m, op, det; int dir[2]; long long mv[2]; int ans[1111111]; int main() { scanf( %d%d , &n, &m); dir[1] = 1; dir[0] = -1; mv[1] = mv[0] = 0LL; for (int i = 0; i < m; i++) { scanf( %d , &op); if (op == 1) { scanf( %d , &det); mv[1] += det; mv[0] += det; if (det % 2) { dir[1] = -dir[1]; dir[0] = -dir[0]; } } else { mv[1] += dir[1]; mv[0] += dir[0]; dir[1] = -dir[1]; dir[0] = -dir[0]; } } mv[1] %= n; if (mv[1] < 0) mv[1] += n; mv[0] %= n; if (mv[0] < 0) mv[0] += n; for (int i = 1; i <= n; i++) { int id = i % 2; int p = i + mv[id]; if (p > n) p -= n; ans[p] = i; } for (int i = 1; i <= n; i++) printf( %d%c , ans[i], i < n ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 Rand(time(0)); const int maxn = 1e5 + 5; const long long maxc = 1e9 + 7; int n, m, d, a[maxn]; long long sum[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> d >> m; for (int i = (1); i <= (n); ++i) cin >> a[i]; sort(a + 1, a + n + 1); for (int i = (1); i <= (n); ++i) sum[i] = sum[i - 1] + a[i]; if (a[n] <= m) return cout << sum[n], 0; int id = upper_bound(a + 1, a + n + 1, m) - a; long long res = a[n] + sum[id - 1]; long long ans = res; for (int i = (n - 1); i >= (id); --i) { if (1LL * (n - i) * d > n) continue; int r = (n - i) * d; if (r - (i - id) < id) { ans = max(ans, res + sum[n - 1] - sum[i - 1] - sum[max(0, r - (i - id))]); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 0x3f3f3f3f; const long long llinf = 1e18; const long long nax = 0; int n, m, batas; vector<pair<int, int>> shift; set<char> simpen; map<char, bool> sabi; int main() { ios_base::sync_with_stdio(0); cin.tie(); cout.tie(); cin >> n >> m >> batas; char arr[n + 5][m + 5]; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> arr[i][j]; if (arr[i][j] == S ) { shift.push_back({i, j}); } else { simpen.insert(arr[i][j]); } } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { for (auto x : shift) { int x1 = i, x2 = x.first, y1 = j, y2 = x.second; int hitung = ceil(sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1))); if (hitung <= batas) { sabi[arr[i][j]] = 1; } } } } int q, ans = 0; cin >> q; string s; cin >> s; for (int k = 0; k < q; ++k) { if (s[k] >= 97) { if (!simpen.count(s[k])) { cout << -1 << n ; return 0; } else continue; } else { if (shift.empty()) { cout << -1 << n ; return 0; } bool ok = 0, ada = 0; if (!simpen.count(s[k] + 32)) { cout << -1 << n ; return 0; } else { if (sabi[s[k] + 32]) continue; else ans++; } } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 55, mod = 1LL * 1000 * 1000 * 1000 + 7; int dp[N][N][2], ans[N][N][2], n, cnt50, cnt100, W, c[N][N], seen[N][N]; bool vis[N][N][2], vis2[N][N][2]; int C(int r, int n) { if (r == 0 || r == n) return 1; if (r > n) return 0; if (seen[r][n]) return c[r][n]; seen[r][n] = true; return c[r][n] = (C(r - 1, n - 1) + C(r, n - 1)) % mod; } int dfs(int x, int y, int tp) { if (vis2[x][y][tp]) return ans[x][y][tp]; vis2[x][y][tp] = true; if (tp) { for (int i = 0; i <= cnt50 - x; i++) for (int j = 0; j <= cnt100 - y; j++) if (i * 50 + j * 100 <= W && (i || j) && dp[x][y][tp] == dp[x + i][y + j][!tp] + 1) (ans[x][y][tp] += 1LL * dfs(x + i, y + j, !tp) * C(i, cnt50 - x) % mod * C(j, cnt100 - y) % mod) %= mod; } else { for (int i = 0; i <= x; i++) for (int j = 0; j <= y; j++) if ((i || j) && i * 50 + j * 100 <= W && dp[x][y][tp] == dp[x - i][y - j][!tp] + 1) (ans[x][y][tp] += 1LL * dfs(x - i, y - j, !tp) * C(i, x) % mod * C(j, y) % mod) %= mod; } return ans[x][y][tp]; } struct Node { int x = 0, y = 0, tp = 0; Node(int a = 0, int b = 0, int c = 0) { x = a, y = b, tp = c; } }; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < 2; k++) dp[i][j][k] = 1 << 29; cin >> n >> W; for (int i = 0, a; i < n; i++) { cin >> a; cnt50 += (a == 50); cnt100 += (a == 100); } dp[0][0][0] = dp[0][0][1] = 0; vis[0][0][0] = vis[0][0][1] = true; ans[0][0][0] = ans[0][0][1] = 1; queue<Node> q; q.push(Node(0, 0, 0)), q.push(Node(0, 0, 1)); while (q.size()) { Node tmp = q.front(); q.pop(); int x = tmp.x, y = tmp.y, tp = tmp.tp; if (tp) { for (int i = 0; i <= cnt50 - x; i++) for (int j = 0; j <= cnt100 - y; j++) if (i * 50 + j * 100 <= W && (i || j) && !vis[x + i][y + j][!tp]) { q.push(Node(x + i, y + j, !tp)); dp[x + i][y + j][!tp] = dp[x][y][tp] + 1; vis[x + i][y + j][!tp] = true; } } else { for (int i = 0; i <= x; i++) for (int j = 0; j <= y; j++) if ((i || j) && i * 50 + 100 * j <= W && !vis[x - i][y - j][!tp]) { q.push(Node(x - i, y - j, !tp)); dp[x - i][y - j][!tp] = dp[x][y][tp] + 1; vis[x - i][y - j][!tp] = true; } } } dfs(cnt50, cnt100, 0); if (dp[cnt50][cnt100][0] >= (1 << 29)) dp[cnt50][cnt100][0] = -1; cout << dp[cnt50][cnt100][0] << n << ans[cnt50][cnt100][0] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 100005; const int inf = 2147483647; long long f[maxN], s[maxN], ans[maxN]; int n, m, c, g, r, l[maxN], a[maxN], sa[maxN]; int t[maxN * 8], b[maxN], h, mm; int query(int l, int r) { l = lower_bound(b + 1, b + 1 + c, l) - b; r = upper_bound(b + 1, b + 1 + c, r) - b - 1; l += mm - 1; r += mm + 1; int k = inf; for (; l != r - 1; l >>= 1, r >>= 1) { if ((l & 1) == 0) k = ((k) < (t[l + 1]) ? (k) : (t[l + 1])); if ((r & 1) == 1) k = ((k) < (t[r - 1]) ? (k) : (t[r - 1])); } return k; } int ask(int x, int y) { if (x < 0) x += g + r; if (y < 0) y += g + r; if (x <= y) return query(x, y); int k = query(x, g + r - 1), t = query(0, y); return ((k) < (t) ? (k) : (t)); } void chg(int x, int d) { x = lower_bound(b + 1, b + 1 + c, x) - b; x += mm; t[x] = d; for (x >>= 1; x; x >>= 1) t[x] = ((t[x + x]) < (t[x + x + 1]) ? (t[x + x]) : (t[x + x + 1])); } void Init() { scanf( %d%d%d , &n, &g, &r); for (int i = 0; i <= n; ++i) scanf( %d , l + i); for (int i = n; i; --i) { s[i] = s[i + 1] + l[i]; b[i] = s[i] % (g + r); } sort(b + 1, b + 1 + n); c = unique(b + 1, b + 1 + n) - b - 1; for (; (c + 1) >> h; ++h) ; mm = 1 << h; for (int i = 1; i <= mm + 1 + c; ++i) t[i] = inf; for (int i = n; i; --i) { int k = ask((s[i] - (g + r - 1)) % (g + r), (s[i] - g) % (g + r)); if (k > n) f[i] = s[i]; else f[i] = (s[i] - s[k] + g + r - 1) / (g + r) * (g + r) + f[k]; chg(s[i] % (g + r), i); } } void Work() { long long p; scanf( %d , &m); for (int i = 1; i <= m; ++i) { scanf( %d , a + i); p = a[i] + l[0] + s[1]; int k = ask((p - (g + r - 1)) % (g + r), (p - g) % (g + r)); if (k > n) printf( %I64d n , p); else printf( %I64d n , (p - s[k] + g + r - 1) / (g + r) * (g + r) + f[k]); } } int main() { Init(); Work(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, k; int main() { cin >> n >> m >> k; if (k > n + m - 2) { cout << -1 << endl; return 0; } long long ans1, ans2; if (k >= m) { ans1 = n / (k - m + 2); } else { ans1 = (m / (k + 1)) * n; } if (k >= n) { ans2 = m / (k - n + 2); } else { ans2 = (n / (k + 1)) * m; } cout << max(ans1, ans2) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M, dbg[100005]; pair<int, int> A[100005]; map<int, int> mp; int main() { scanf( %d , &N); for (int i = 0; i < N; i++) { int a; scanf( %d , &a); mp[a]++; } for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) A[M++] = *it; for (int i = 1; i < M; i++) if (A[i].first != A[i - 1].first + 1) { puts( NO ); return 0; } int p = 0; for (int i = 0; i < M; i++) { A[i].second--; dbg[p++] = A[i].first; } for (int i = M - 1; i > 1; i--) { while (A[i].second) { if (!A[i - 1].second) { puts( NO ); return 0; } A[i - 1].second--; A[i].second--; dbg[p++] = A[i - 1].first; dbg[p++] = A[i].first; } if (!A[i - 1].second) { puts( NO ); return 0; } A[i - 1].second--; dbg[p++] = A[i - 1].first; } while (A[1].second) { if (!A[0].second) { puts( NO ); return 0; } A[0].second--; A[1].second--; dbg[p++] = A[0].first; dbg[p++] = A[1].first; } if (A[0].second) { puts( NO ); return 0; } puts( YES ); return 0; } |
#include <bits/stdc++.h> int aa[120][5], kk[5]; int solve(int *bb, int n) { int k, sum1, sum2, j, bad; sum1 = sum2 = 0; for (j = 0; j < 5; j++) { if (aa[0][j] != -1) sum1 += (bb[j] + 1) * (250 - aa[0][j]) * 2; if (aa[1][j] != -1) sum2 += (bb[j] + 1) * (250 - aa[1][j]) * 2; } if (sum1 <= sum2) return n * 32 + 1; for (k = 0; k <= n * 32; k++) { bad = 0; for (j = 0; j < 5; j++) if (aa[0][j] != -1) { int lower = bb[j] == 5 ? 0 : (n + k) / (1 << (bb[j] + 1)) + 1 - kk[j]; int upper = (n + k) / (1 << bb[j]) - kk[j]; if (upper < 0 || lower > upper || lower > k) { bad = 1; break; } } else if ((bb[j] != 5 && kk[j] << (bb[j] + 1) <= (n + k)) || (kk[j] << bb[j] > (n + k))) { bad = 1; break; } if (!bad) return k; } return n * 32 + 1; } int main() { static int bb[5]; int n, i, j, b, b_, min, k; scanf( %d , &n); for (i = 0; i < n; i++) for (j = 0; j < 5; j++) { scanf( %d , &aa[i][j]); if (aa[i][j] != -1) kk[j]++; } min = n * 32 + 1; for (b = 0; b < 7776; b++) { for (j = 0, b_ = b; j < 5; j++, b_ /= 6) bb[j] = b_ % 6; k = solve(bb, n); if (min > k) min = k; } printf( %d n , min == n * 32 + 1 ? -1 : min); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[1000010]; int n; bool check(int len) { int now = 0, lft = 0; bool flag = 1; for (int i = 0; i < n; i++) { if (s[i] == R ) { flag = 0; if (now + 1 != len) now++; } else now--; if (now < lft) { lft = now; flag = 1; } } return flag; } int main() { scanf( %s , s); n = strlen(s); if (s[n - 1] == R ) { for (int i = 0; i < n; i++) { if (s[i] == R ) s[i] = L ; else s[i] = R ; } } if (check(n + 5)) { puts( 1 ); return 0; } int l = 0, r = n + 5, ret = 0; while (l <= r) { int mid = (l + r) >> 1; if (check(mid)) ret = mid, l = mid + 1; else r = mid - 1; } printf( %d n , ret); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, cnt, flag; vector<int> graph[100005]; bool vis[100005]; void dfs(int node, int parent) { vis[node] = 1; int x, u, v, i; cnt++; for (i = 0; i < graph[node].size(); i++) { v = graph[node][i]; if (v == parent) continue; if (vis[v] == 1) flag = 1; else dfs(v, node); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; int i, j, k, u, v, x, sum = 0; for (i = 0; i < m; i++) { cin >> u >> v; graph[u].push_back(v); graph[v].push_back(u); } for (i = 1; i <= n; i++) { if (vis[i] == 0) { cnt = 0; flag = 0; dfs(i, 0); if (flag == 1) sum += cnt; else sum += (cnt - 1); } } cout << n - sum << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> g(n); int mm = 99999; for (int i = 0; i < n; i++) { cin >> g[i]; mm = min(mm, abs(g[i])); } sort(g.begin(), g.end()); int rest = k; for (int i = 0; i < k; i++) { if (i < g.size() && g[i] < 0) { g[i] = -g[i]; rest--; } } int ans = 0; for (int i = 0; i < g.size(); i++) { ans += g[i]; } if (rest % 2) { ans -= 2 * mm; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> g[500010]; int rad[2][500010], tata[500010], niv[500010]; char in[500010], vaz[500010], tip[500010]; struct edge { int x, y, c; }; edge v[500010]; int radacina(int x, int t) { int y = x; while (y != rad[t][y]) y = rad[t][y]; while (rad[t][x] != y) { int aux = rad[t][x]; rad[t][x] = y; x = aux; } return y; } void unite(int x, int y) { x = radacina(x, 0); y = radacina(y, 0); rad[0][x] = y; } void dfs(int nod) { vaz[nod] = 1; for (int i = 0; i < g[nod].size(); i++) { int vec = g[nod][i].first; if (vaz[vec] == 1) continue; niv[vec] = niv[nod] + 1; tata[vec] = nod; tip[vec] = g[nod][i].second; dfs(vec); } } int main() { int n, k, m, x, y; long long sol = 0; scanf( %d%d%d , &n, &k, &m); for (int i = 1; i <= n; i++) rad[0][i] = rad[1][i] = i; for (int i = 1; i <= k; i++) { scanf( %d%d , &x, &y); unite(x, y); g[x].push_back({y, 1}); g[y].push_back({x, 1}); } for (int i = 1; i <= m; i++) { scanf( %d%d%d , &v[i].x, &v[i].y, &v[i].c); if (radacina(v[i].x, 0) != radacina(v[i].y, 0)) { unite(v[i].x, v[i].y); in[i] = 1; g[v[i].x].push_back({v[i].y, 0}); g[v[i].y].push_back({v[i].x, 0}); } } dfs(1); tata[1] = 1; int nr = 0; for (int i = 1; i <= m; i++) { if (in[i] == 1) continue; x = v[i].x; y = v[i].y; x = radacina(x, 1); y = radacina(y, 1); while (x != y) { if (niv[x] < niv[y]) swap(x, y); sol += tip[x] * v[i].c; nr += tip[x]; rad[1][x] = tata[x]; x = radacina(x, 1); } } if (nr < k) printf( -1 ); else printf( %I64d , sol); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long rot = 0; long long last = 0; long long ans; for (int i = 0; i < m; i++) { long long t; cin >> t; if (last > t) { rot++; } last = t; } ans = rot * n + last - 1; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int f(int y) { return y % 400 == 0 ? 2 : y % 100 == 0 ? 1 : y % 4 == 0 ? 2 : 1; } int main() { int n, r = 0, t; scanf( %d , &n); t = f(n); while (r % 7 != 0 || r == 0 || t != f(n)) { r += f(n); n++; } printf( %d n , n); return 0; } |
#include <bits/stdc++.h> using namespace std; long long binSearch(long long n, long long pow2) { long long L = 0, R = (n / pow2) + 10, M; while (R - L > 1) { M = (L + R) / 2; double dM = M + 0.0; if ((2.0 * dM + 1.0) * (pow2 + dM - 1.0) < n + 0.0) L = M; else R = M; } if ((2 * L + 1) * (pow2 + L - 1) == n) return L; else if ((2 * R + 1) * (pow2 + R - 1) == n) return R; else return -1; } int main() { long long n; cin >> n; vector<long long> result; for (long long pow2 = 1; pow2 - 1 <= n; pow2 *= 2) { long long v = binSearch(n, pow2); if (v != -1) result.push_back((2 * v + 1) * pow2); } sort(result.begin(), result.end()); if (result.size() == 0) cout << -1; else { for (int i = 0; i < result.size(); i++) cout << result[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int max(int a, int b) { return a > b ? a : b; } pair<int, int> a[100], ans[1000], p; vector<pair<int, int>> v; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + n); int i = 0; while (i < k) { if (a[0].first - a[n - 1].first >= -1) break; a[0].first++; a[n - 1].first--; p.first = a[0].second; p.second = a[n - 1].second; v.push_back(p); sort(a, a + n); i++; } cout << a[n - 1].first - a[0].first << << i << endl; for (int k = 0; k < i; k++) { cout << v[k].second << << v[k].first << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<double> E[100010]; int color[100010]; int seen[100010]; set<int> sets[100010]; void dfs(int u) { for (int i = 0; i < E[u].size(); ++i) { int v = E[u][i]; if (color[u] != color[v]) sets[color[u]].insert(color[v]); if (!seen[v]) { seen[v] = true; dfs(v); } } } int main() { int n, m, u, v; cin >> n >> m; set<int> colorids; for (int i = 0; i < n; ++i) { cin >> color[i]; colorids.insert(color[i]); } for (int i = 0; i < m; ++i) { cin >> u >> v; --u; --v; E[u].push_back(v); E[v].push_back(u); } memset(seen, 0, sizeof(seen)); for (int i = 0; i < n; ++i) if (!seen[i]) { seen[i] = true; dfs(i); } int maxcolor = -1; int maxn = -(1 << 30); for (typeof(colorids.begin()) it = colorids.begin(); it != colorids.end(); ++it) { int color = *it; int ncolors = sets[*it].size(); if (maxn < ncolors) { maxn = ncolors; maxcolor = *it; } } cout << maxcolor << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; cout << (a + b + c) * (a + b + c) - (a * a + c * c + e * e); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll N = 1e6 + 100; ll n; ll m; ll **arr() { ll **res = new ll *[n + 2]; for (ll i = 0; i < n + 2; ++i) { res[i] = new ll[m + 2]; fill_n(res[i], m + 2, 0); } return res; } ll **inp; ll **ans; void pref(ll **a) { for (ll i = 1; i <= n + 1; ++i) { for (ll j = 1; j <= m + 1; ++j) { a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1]; } } } ll sum(ll **a, ll il, ll ir, ll jl, ll jr) { il = max(il, 1ll); ir = min(ir, n); jl = max(jl, 1ll); jr = min(jr, m); --il; --jl; return a[ir][jr] - a[ir][jl] - a[il][jr] + a[il][jl]; } ll sq(ll first) { return first * first; } bool check(ll t) { for (ll i = 1; i <= n; ++i) { for (ll j = 1; j <= m; ++j) { ans[i][j] = sum(inp, i - t, i + t, j - t, j + t) == sq(2 * t + 1); } } pref(ans); for (ll i = 1; i <= n; ++i) { for (ll j = 1; j <= m; ++j) { if (sum(inp, i, i, j, j) && sum(ans, i - t, i + t, j - t, j + t) == 0) { return false; } } } return true; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; inp = arr(); ans = arr(); for (ll i = 1; i <= n; ++i) { string s; cin >> s; for (ll j = 1; j <= m; ++j) { inp[i][j] = s[j - 1] == X ; } } pref(inp); ll lef = 0, rig = N; while (rig - lef > 1) { ll mid = (lef + rig) / 2; if (check(mid)) { lef = mid; } else { rig = mid; } } assert(check(lef)); cout << lef << n ; for (ll i = 1; i <= n; ++i) { for (ll j = 1; j <= m; ++j) { cout << .X [sum(ans, i, i, j, j)]; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return x * f; } const int N = 1e3 + 5; int f[N][N]; struct node { long long x, y; } a[N], b[N]; bool cmp(node x, node y) { return x.y < y.y; } long long area(node a, node b, node c) { return a.x * b.y - a.y * b.x + b.x * c.y - b.y * c.x + c.x * a.y - c.y * a.x; } bool toleft(node a, node b, node c) { if (c.y <= a.y || c.y > b.y) return 0; return area(a, b, c) > 0; } int n, m; int main() { cin >> n >> m; for (int i = 1; i <= n; ++i) scanf( %lld%lld , &a[i].x, &a[i].y); for (int i = 1; i <= m; ++i) scanf( %lld%lld , &b[i].x, &b[i].y); sort(a + 1, a + n + 1, cmp); int ans = 0; for (int i = 1; i < n; ++i) for (int j = i + 1; j <= n; ++j) for (int k = 1; k <= m; ++k) if (toleft(a[i], a[j], b[k])) f[i][j]++; for (int i = 1; i < n; ++i) for (int j = i + 1; j < n; ++j) for (int k = j + 1; k <= n; ++k) if (f[i][j] + f[j][k] == f[i][k]) ans++; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; const int INF = 2000000000; const long long BIG = 1446803456761533460LL; const int maxn = 5010; int n, m, k, dp[maxn][maxn]; int poww(int a, int b) { int r = 1; while (b) { if (b & 1) r = (1LL * (r) * (a)) % MOD; a = (1LL * (a) * (a)) % MOD; b >>= 1; } return r; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m >> k; int mi = poww(m, MOD - 2); dp[0][0] = 1; for (int i = 0; i < k; ++i) { for (int j = 0; j < k + 1; ++j) { dp[i + 1][j] = ((dp[i + 1][j]) + (1LL * dp[i][j] * j % MOD)) % MOD; dp[i + 1][j + 1] = ((dp[i + 1][j + 1]) + (1LL * dp[i][j] * (n - j) % MOD * mi % MOD)) % MOD; } } int ans = 0; for (int i = 0; i < k + 1; ++i) ans = ((ans) + (dp[k][i])) % MOD; cout << ans << n ; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.