func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int n, h; pair<int, int> arr[100010]; int res[100010]; int ptr = -1; int cnt, bits; int main() { cin >> n >> h; for (int i = 0; i < n; i++) { scanf( %d , &arr[i].first); arr[i].second = i; res[i] = 1; } sort(arr, arr + n); int ans = arr[n - 1].first + arr[n - 2].first - arr[0].first - arr[1].first; for (int i = n - 2; i >= 0; i--) { int mx = arr[i].first + arr[n - 1].first + h; if (i < n - 2) mx = max(mx, arr[n - 1].first + arr[n - 2].first); int init = min(7, i); int col[7]; if (i <= 6) { col[i] = 2; for (int j = i + 1; j < min(n, 7); j++) col[j] = 1; } for (int j = 0; j < (1 << init); j++) { for (int k = 0; k < init; k++) { col[k] = ((j & (1 << k)) ? 1 : 2); } int mn = 1000000000; for (int k = 0; k < min(n, 7); k++) { for (int l = k + 1; l < min(n, 7); l++) { int val = arr[k].first + arr[l].first; if (col[k] != col[l]) val += h; mn = min(mn, val); } } int dif = mx - mn; if (dif < ans) { ans = dif; ptr = i; cnt = init; bits = j; } } } if (ptr != -1) { for (int i = 0; i < cnt; i++) { res[arr[i].second] = ((bits & (1 << i)) ? 1 : 2); } res[arr[ptr].second] = 2; for (int i = ptr + 1; i < n; i++) res[arr[i].second] = 1; } cout << ans << endl; for (int i = 0; i < n; i++) { if (i) printf( ); printf( %d , res[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long add(long long a, long long b) { return (a % 1000000007 + b % 1000000007) % 1000000007; } inline long long mul(long long a, long long b) { return (a % 1000000007 * b % 1000000007) % 1000000007; } long long pwr(long long a, long long b) { if (!b) return 1ll; long long t = pwr(a, b / 2); t = mul(t, t); if (b & 1) t = mul(t, a); return t; } long long modinv(long long a, long long b = 1000000007) { return pwr(a, b - 2); } long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, a, b, c, d; cin >> n >> a >> b >> c >> d; int x = a - b, y = a + b; int p = c - d, q = c + d; int mn = x * n, flag = 1; for (int i = 1; i <= n; i++) { if (mn <= q && mn >= p) { flag = 0; break; } if (mn < p) { int diff = p - mn; mn += min(diff, 2 * b); } } if (mn <= q && mn >= p) { flag = 0; } if (flag) cout << No n ; else cout << Yes n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, i, a1, b1, y, y1, ans, ans1, ans2, x; cin >> n >> a >> b; for (i = 1; i <= n; i++) { cin >> x; y = x * a; ans = y % b; if (a != 0) cout << ans / a << ; else cout << x << ; } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int dp[100005][30] = {0}; int A[40][40] = {0}; int main() { string s, b; cin >> s; int k; cin >> k; for (int i = 0; i < k; i++) { cin >> b; int x, y; x = b[0] - a ; y = b[1] - a ; A[x][y] = A[y][x] = 1; } int n = s.length(); for (int i = 1; i <= n; i++) for (int k = 0; k < 26; k++) { dp[i][k] = dp[i - 1][k]; for (int j = 0; j < 26; j++) if (!A[k][j] && s[i - 1] - a == k) dp[i][k] = max(dp[i][k], dp[i - 1][j] + 1); } int res = 0; for (int i = 0; i < 26; i++) { res = max(res, dp[n][i]); } cout << n - res; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; const long long oo = ((long long)1e18) + 7; int N, M, T, K, Q; vector<int> G[MAXN]; int num[MAXN]; int dep[MAXN]; int pa[MAXN][25]; int LOG = 20; int cnt = 0; int child[MAXN]; int DFS(int u, int par, int depth) { num[u] = ++cnt; dep[num[u]] = depth; pa[num[u]][0] = num[par]; for (auto v : G[u]) if (v != par) { child[num[u]] += DFS(v, u, dep[num[u]] + 1); } return child[num[u]]; } int LCA(int u, int v) { if (u == v) return u; if (dep[u] < dep[v]) swap(u, v); for (int i = LOG; i >= 0; i--) if (dep[pa[u][i]] >= dep[v]) u = pa[u][i]; if (u == v) return u; for (int i = LOG; i >= 0; i--) if (pa[u][i] != pa[v][i]) { u = pa[u][i]; v = pa[v][i]; } return pa[u][0]; } int findParent(int u, int k) { if (k == 0) return u; int i = 0; while (k > 0) { if (k & 1) u = pa[u][i]; i++; k >>= 1; } return u; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen( 519E .inp , r )) { freopen( 519E .inp , r , stdin); freopen( 519E .out , w , stdout); } cin >> N; for (int i = 1; i < N; i++) { int u, v; cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } for (int i = 1; i <= N; i++) child[i] = 1; dep[0] = -1; DFS(1, 0, 0); for (int k = 1; k <= LOG; k++) for (int i = 1; i <= N; i++) pa[i][k] = pa[pa[i][k - 1]][k - 1]; cin >> Q; while (Q--) { int u, v; cin >> u >> v; u = num[u]; v = num[v]; if (dep[u] < dep[v]) swap(u, v); int p = LCA(u, v); if (u == v) { cout << N << n ; continue; } int diff1 = dep[u] - dep[p]; int diff2 = dep[v] - dep[p]; if ((diff1 + diff2) & 1) { cout << 0 << n ; continue; } int avg = (diff1 + diff2) >> 1; int mid = findParent(u, avg); if (mid == p) { int fakeParent1 = findParent(u, diff1 - 1); int fakeParent2 = findParent(v, diff2 - 1); cout << (child[mid] - child[fakeParent1] - child[fakeParent2]) + N - child[mid] << n ; continue; } diff1 = dep[u] - dep[mid]; int fakeParent1 = findParent(u, diff1 - 1); cout << child[mid] - child[fakeParent1] << n ; } } |
#include <bits/stdc++.h> using namespace std; bool checkPal(string s) { for (int i = 0, j = s.size() - 1; i <= j; i++, j--) { if (s[i] != s[j]) { return false; } } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; for (int i = 0; i < t; i++) { string s; cin >> s; map<char, int> m; for (int j = 0; j < s.size(); j++) { m[s[j]]++; } string ch = ; for (auto it = m.rbegin(); it != m.rend(); it++) { pair<int, int> p = *it; char c = p.first; int cnt = p.second; for (int j = 0; j < cnt; j++) { ch += c; } } if (!checkPal(ch)) { cout << ch << endl; } else { cout << -1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[1000010]; pair<long long, long long> st[1000010]; bool check(pair<long long, long long> a, pair<long long, long long> b, pair<long long, long long> c) { double k1 = 1.0 * (b.second - a.second) / (b.first - a.first); double k2 = 1.0 * (c.second - b.second) / (c.first - b.first); if (k1 > k2) return 1; return 0; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); a[i] += a[i - 1]; } int top = 0; st[top++] = make_pair(0, 0); for (int i = 1; i <= n; i++) { pair<long long, long long> tmp = make_pair(i, a[i]); while (top > 1 && check(st[top - 2], st[top - 1], tmp)) top--; st[top++] = tmp; } for (int i = 0; i < top - 1; i++) { long long l = st[i].first, r = st[i + 1].first, tot = st[i + 1].second - st[i].second; for (int j = l + 1; j <= r; j++) { printf( %.9f n , 1.0 * tot / (r - l)); } } return 0; } |
#include <bits/stdc++.h> int A[50], B[50]; int main() { int N, M, i, j, Max, now, Cnt; while (scanf( %d , &N) != EOF) { for (i = 0; i < N; ++i) { scanf( %d , &A[i]); } scanf( %d , &M); for (i = 0; i < M; ++i) { scanf( %d , &B[i]); } for (Max = i = 0; i < N; ++i) { for (j = 0; j < M; ++j) { now = B[j] / A[i]; if (now * A[i] == B[j] && Max < now) { Max = now; } } } for (Cnt = i = 0; i < N; ++i) { for (j = 0; j < M; ++j) { now = B[j] / A[i]; if (now * A[i] == B[j] && Max == now) { ++Cnt; } } } printf( %d n , Cnt); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n = 5; int arr[5], sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } if (sum == 0) cout << -1 << endl; else if (sum % 5 != 0) cout << -1 << endl; else { int s = sum / 5; int a = 0, b = 0; for (int i = 0; i < n; i++) { if (arr[i] > s) a += s - arr[i]; else b += arr[i] - s; } if (a == b) cout << s << endl; else cout << -1 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 840; long long cnt[10]; long long f[10][N]; int main() { long long w; cin >> w; for (int i = 1; i <= 8; i++) cin >> cnt[i]; memset(f, 0xcf, sizeof f); f[0][0] = 0; long long res = 0; for (int i = 1; i <= 8; i++) { for (int j = 0; j < 840 / i && j <= cnt[i]; j++) { for (int k = 0; k < 840; k++) { int a = (k + j * i) / 840; int b = (k + j * i) % 840; f[i][b] = max(f[i][b], f[i - 1][k] + a + (cnt[i] - j) * i / 840); if (b <= w) res = max(res, min(f[i][b], (w - b) / 840) * 840 + b); } } } cout << res << endl; 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--) { long long int n, a, b; cin >> n >> a >> b; string s; cin >> s; long long int ans = n * (a + 2 * b) + 2 * a; int st = 0, en = 0; while (en < n and s[en] == 0 ) en++; if (en == n) { ans = n * a + (n + 1) * b; cout << ans << n ; continue; } ans -= (en - 1) * b; while (en != n) { st = en; while (s[st] != 0 ) st++; en = st; while (en < n and s[en] == 0 ) en++; if (en == n) { ans -= (en - st - 1) * b; break; } if (en - st != 1 and 2 * a < (en - st - 1) * b) ans += 2 * a - (en - st - 1) * b; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> const int kN = 18; const int kT = 1 << kN; const int kInf = 0x3f3f3f3f; int a[kT]; bool fan_of[kT]; std::map<std::pair<int, int>, int> cal[4]; int Cal(int l, int r, int st) { if (r == l + 2) { int cnt_fan = (int)fan_of[l] + fan_of[l + 1], cnt_st = (st & 1) + (st >> 1); return cnt_fan == cnt_st ? std::min(cnt_st, 1) : -kInf; } std::pair<int, int> tmp = std::make_pair(l, r); if (cal[st].count(tmp)) return cal[st][tmp]; int mid = (l + r) >> 1, ret = -kInf; for (int i = 0; i < 4; ++i) for (int j = 0; j < 4; ++j) { int v1 = ((i << 1) | (i & 2) | j) & 3, v2 = ((j << 1) | (j & 2) | i) & 3; if (v1 == st || v2 == st) { ret = std::max(ret, Cal(l, mid, i) + Cal(mid, r, j)); } } return cal[st][tmp] = ret + st; } int main() { int n, k, t, ans = 0; scanf( %d%d , &n, &k); t = 1 << n; for (int i = 1; i <= k; ++i) scanf( %d , a + i), fan_of[--a[i]] = true; for (int i = 0; i < 4; ++i) ans = std::max(ans, Cal(0, t, i)); printf( %d , ans + !(!k)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long d[111111]; long long sum[111111]; int q[111111]; long long cat[111111]; long long dp[101][100001]; long long getDP(int i, int j, int k) { return (long long)j * cat[j] + dp[i - 1][k] - j * cat[k]; } long long getUP(int i, int j, int k) { return (long long)dp[i - 1][j] - dp[i - 1][k]; } long long getDOWN(int j, int k) { return (long long)cat[j] - cat[k]; } int main() { int i, j, k, n, m, p, h; cin >> n >> m >> p; for (i = 2; i <= n; i++) { cin >> d[i]; d[i] += d[i - 1]; } for (i = 1; i <= m; i++) { cin >> h >> cat[i]; cat[i] -= d[h]; } sort(cat + 1, cat + 1 + m); for (i = 1; i <= m; i++) sum[i] = sum[i - 1] + cat[i]; for (i = 1; i <= p; i++) for (j = 1; j <= m; j++) dp[i][j] = 999999999999999; dp[1][m] = (long long)m * cat[m] - sum[m]; for (i = 2; i <= p; i++) { int head, tail; head = tail = 0; q[tail++] = m; for (j = m; j >= 1; j--) { while (head + 1 < tail && (getUP(i, q[head + 1], q[head]) <= j * getDOWN(q[head + 1], q[head]))) head++; dp[i][j] = min(dp[i][j], getDP(i, j, q[head])); while (head + 1 < tail && getUP(i, j, q[tail - 1]) * getDOWN(q[tail - 1], q[tail - 2]) > getUP(i, q[tail - 1], q[tail - 2]) * getDOWN(j, q[tail - 1])) tail--; q[tail++] = j; } } long long ans = dp[p][1]; for (i = 1; i <= m; i++) ans = min(ans, dp[p][i]); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 5; struct BIT { int a[N], n; void Init(int n) { this->n = n; } void add(int p, int v) { for (p = p + 1; p <= n; p += p & -p) a[p] += v; return; } int query(int p) { int res = 0; for (p = p + 1; p >= 1; p -= p & -p) res += a[p]; return res; } } * TA; struct Node { int val, idx; Node(int v, int i) { val = v; idx = i; } }; void update(Node &des, Node src) { des.val += src.val; TA->add(des.idx, src.val); } int main() { int n, q; cin >> n >> q; TA = new BIT(); TA->Init(n); deque<Node> Q; for (int i = 0; i < n; i++) TA->add(i, 1), Q.push_back(Node(1, i)); int s = 0; for (int i = 0; i < q; i++) { int f; scanf( %d , &f); if (f == 1) { int p; scanf( %d , &p); if (2 * p <= Q.size()) { if (s == 0) { for (int i = 0; i < p; i++) { update(Q[2 * p - 1 - i], Q[i]); } for (int i = 0; i < p; i++) Q.pop_front(); } else { for (int i = (int)Q.size() - 1; i >= Q.size() - p; i--) { update(Q[2 * (Q.size() - p) - 1 - i], Q[i]); } for (int i = 0; i < p; i++) Q.pop_back(); } } else { if (s == 0) { for (int i = (int)Q.size() - 1; i >= p; i--) { update(Q[2 * p - 1 - i], Q[i]); } int d = (int)Q.size() - p; for (int i = 0; i < d; i++) Q.pop_back(); } else { for (int i = 0; i < Q.size() - p; i++) { update(Q[2 * (Q.size() - p) - 1 - i], Q[i]); } int d = (int)Q.size() - p; for (int i = 0; i < d; i++) Q.pop_front(); } s = s ^ 1; } } else { int L, R; scanf( %d %d , &L, &R); --R; if (s == 1) { int ll = L, rr = R; L = Q[Q.size() - rr - 1].idx; R = Q[Q.size() - ll - 1].idx; } else { L = Q[L].idx, R = Q[R].idx; } printf( %d n , TA->query(R) - TA->query(L - 1)); } } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; while (cin >> s) { string integer; string decimal; bool isnegative = false; bool isdecimal = false; int pos = 0; if (s[0] == - ) { isnegative = true; pos++; } for (; pos < s.size(); pos++) { if (s[pos] == . ) { isdecimal = true; } else if (!isdecimal) { integer += s[pos]; } else { decimal += s[pos]; } } reverse(integer.begin(), integer.end()); string integerWithComma; for (int i = 0; i < integer.size(); i++) { integerWithComma += integer[i]; if (i != integer.size() - 1 && i % 3 == 2) { integerWithComma += , ; } } reverse(integerWithComma.begin(), integerWithComma.end()); string decimalProcess; if (decimal.size() == 0) { decimalProcess = .00 ; } else if (decimal.size() == 1) { decimalProcess = . + decimal + 0 ; } else { decimalProcess = . + decimal.substr(0, 2); } if (isnegative) { cout << ( ; } cout << $ ; cout << integerWithComma; cout << decimalProcess; if (isnegative) { cout << ) ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string op, s1, s2; map<string, int> mp; int solve(string s) { int ast, amp; ast = count(s.begin(), s.end(), * ); amp = count(s.begin(), s.end(), & ); return ast - amp; } string remove(string s) { s.erase(remove(s.begin(), s.end(), * ), s.end()); s.erase(remove(s.begin(), s.end(), & ), s.end()); return s; } int main() { int N; cin >> N; mp[ void ] = 0; while (N--) { cin >> op; if (op == typedef ) { cin >> s1 >> s2; int d = solve(s1); s1 = remove(s1); if (mp.find(s1) != mp.end() && mp[s1] >= 0) mp[s2] = mp[s1] + d; else mp[s2] = -1; } else { cin >> s1; int d = solve(s1); s1 = remove(s1); if (mp.find(s1) != mp.end() && mp[s1] >= 0) { d += mp[s1]; if (d >= 0) { cout << void ; for (int i = 0; i < d; i++) cout << * ; cout << endl; } else cout << errtype << endl; } else cout << errtype << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long power(unsigned long long x, unsigned long long y) { if (y == 0) return 1; unsigned long long tmp = power(x, y / 2); tmp *= tmp; if (y % 2) tmp *= x; return tmp; } unsigned long long get(unsigned long long n) { if (n <= 9) return n; unsigned long long cnt, temp, d = 0; unsigned long long tmp = n; while (tmp / 10) { tmp /= 10; d++; } stringstream s; s << n; string str = s.str(); unsigned long long x = str[0] - 0 ; temp = power(10, d); n -= (str[0] - 0 ) * temp; n /= 10; if (str[0] <= str[str.size() - 1]) cnt = n + 1; else cnt = n; cnt += ((power(10, d - 1)) * (x - 1)); return cnt + get(power(10, d) - 1); } int main() { unsigned long long l, r; cin >> l >> r; cout << get(r) - get(l - 1) << endl; } |
#include <bits/stdc++.h> int main() { int n, m; while (scanf( %d %d , &n, &m) != EOF) { if (n * m < 2) { printf( 0 n ); } else { printf( %d n , n * m / 2); } } } |
#include <bits/stdc++.h> using namespace std; template <class A, class B> A cvt(B x) { stringstream s; s << x; A r; s >> r; return r; } typedef vector<int> VI; typedef vector<pair<int, int> > VII; typedef vector<string> VS; struct Treap { int val, priority; int maxVal, size; Treap *left; Treap *right; Treap() { val = priority = maxVal = size = 0; left = right = 0; } Treap(int _val, int _priority, int _maxVal, int _size) { val = _val; maxVal = _maxVal; size = _size; priority = _priority; left = right = 0; } }; int SZ(Treap *&t) { return t ? t->size : 0; } int MAX(Treap *&t) { return t ? t->maxVal : 0; } void Adjust(Treap *&T) { T->size = 1 + SZ(T->left) + SZ(T->right); T->maxVal = max(T->val, max(MAX(T->left), MAX(T->right))); } void rotateLeft(Treap *&T) { Treap *t = T->left; T->left = t->right; Adjust(T); t->right = T; Adjust(t); T = t; } void rotateRight(Treap *&T) { Treap *t = T->right; T->right = t->left; Adjust(T); t->left = T; Adjust(t); T = t; } void Balance(Treap *&T) { if (T->left) { if (T->left->priority > T->priority) rotateLeft(T); } if (T->right) { if (T->right->priority > T->priority) rotateRight(T); } } void insert(Treap *&T, int val, int where, int pri) { if (!T) T = new Treap(val, pri, val, 1); else { if (SZ(T->right) >= where) { insert(T->right, val, where, pri); } else if (max(T->val, MAX(T->right)) > val) { insert(T->right, val, where, pri); } else insert(T->left, val, where - SZ(T->right) - 1, pri); Adjust(T); Balance(T); } } int idx[101010]; void print(Treap *&T) { if (T) { print(T->left); printf( %d , idx[T->val]); print(T->right); } } int main() { int n, a, c; scanf( %d , &n); Treap *T = NULL; for (int i = (int)0; i < (int)n; ++i) { scanf( %d%d , &a, &c); idx[a] = i + 1; insert(T, a, c, rand() % 101010); } print(T); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Dinic { struct Edge { int to, flow, next; }; vector<Edge> edges; vector<int> head, act, h; int S, D; void AddEdge(int from, int to, int f, int rev_f = 0) { edges.push_back({to, f, (int)edges.size()}); swap(edges.back().next, head[from]); edges.push_back({from, rev_f, (int)edges.size()}); swap(edges.back().next, head[to]); } bool bfs() { fill(h.begin(), h.end(), -1); h[S] = 0; vector<int> q = {S}; for (int it = 0; it < q.size() && h[D] == -1; it++) { int nod = q[it]; for (int i = head[nod]; i != -1; i = edges[i].next) if (edges[i].flow && h[edges[i].to] == -1) h[edges[i].to] = 1 + h[nod], q.push_back(edges[i].to); } return h[D] != -1; } int dfs(int nod, int flow) { if (flow == 0 || nod == D) return flow; while (act[nod] != -1) { Edge& e = edges[act[nod]]; int d; if (e.flow && h[e.to] == 1 + h[nod] && (d = dfs(e.to, min(flow, e.flow))) != 0) { e.flow -= d; edges[act[nod] ^ 1].flow += d; return d; } act[nod] = edges[act[nod]].next; } return 0; } int GetFlow() { int f = 0; while (bfs()) { act = head; int d; while ((d = dfs(S, 1e9)) != 0) f += d; } return f; } Dinic(int dim = 0, int s = 0, int d = 0) : head(dim + 1, -1), h(dim + 1), S(s), D(d) {} }; struct FlowWithMinRestrictions { struct Edge { int from, to, flowmin, flowmax, id; }; vector<Edge> edges; int S, D, n; void AddEdge(int from, int to, int flowmin, int flowmax) { edges.push_back({from, to, flowmin, flowmax, 0}); } vector<int> Solve(bool& feasible, int& flow) { feasible = 1; flow = 0; int news = n + 1, newd = n + 2; Dinic first_flow(n + 2, news, newd); first_flow.AddEdge(D, S, 1e9); int s_minime = 0; for (auto& i : edges) { if (i.flowmax < i.flowmin) { feasible = 0; return vector<int>(); } s_minime += i.flowmin; i.id = first_flow.edges.size(); first_flow.AddEdge(i.from, i.to, i.flowmax - i.flowmin); first_flow.AddEdge(news, i.to, i.flowmin); first_flow.AddEdge(i.from, newd, i.flowmin); } if (first_flow.GetFlow() != s_minime) { feasible = 0; return vector<int>(); } Dinic curent_flow(n, S, D); for (auto& i : edges) { int dif = i.flowmax - i.flowmin; int passed = dif - first_flow.edges[i.id].flow; int nid = curent_flow.edges.size(); curent_flow.AddEdge(i.from, i.to, first_flow.edges[i.id].flow, passed); i.id = nid; } curent_flow.GetFlow(); vector<int> ans(edges.size()); for (int i = 0; i < edges.size(); i++) { int cntflow = curent_flow.edges[edges[i].id ^ 1].flow + edges[i].flowmin; ans[i] = cntflow; if (edges[i].from == S) flow += cntflow; if (edges[i].to == S) flow -= cntflow; } return ans; } FlowWithMinRestrictions(int n = 0, int s = 0, int d = 0) : n(n), S(s), D(d) {} }; namespace ProbD { const int NMAX = 200010; map<int, int> nrmx, nrmy; FlowWithMinRestrictions flow; pair<int, int> shields[NMAX]; int idshield[NMAX]; int n, S, D; int difmax[NMAX]; int nr_on_poz[NMAX]; int cnt = 0; void normalize() { for (int i = 0; i < n; i++) nrmx[shields[i].first] = nrmy[shields[i].second] = 0; for (auto& i : nrmx) i.second = cnt++; for (auto& i : nrmy) i.second = cnt++; S = cnt++; D = cnt; fill(difmax, difmax + cnt + 1, 1e9); } void solve() { int r, b; int nrc; cin >> n >> nrc >> r >> b; for (int i = 0; i < n; i++) cin >> shields[i].first >> shields[i].second; normalize(); flow = FlowWithMinRestrictions(cnt, S, D); for (int i = 0; i < n; i++) { shields[i].first = nrmx[shields[i].first], shields[i].second = nrmy[shields[i].second]; idshield[i] = flow.edges.size(); nr_on_poz[shields[i].first]++, nr_on_poz[shields[i].second]++; flow.AddEdge(shields[i].first, shields[i].second, 0, 1); } while (nrc--) { int t, p, val; cin >> t >> p >> val; if (t == 1 && nrmx.find(p) != nrmx.end()) difmax[nrmx[p]] = min(difmax[nrmx[p]], val); else if (t == 2 && nrmy.find(p) != nrmy.end()) difmax[nrmy[p]] = min(difmax[nrmy[p]], val); } vector<pair<int, pair<int, int>>> verif; for (auto i : nrmx) { int nr = nr_on_poz[i.second]; int dmax = difmax[i.second]; int vmax = (dmax + nr) / 2; int vmin = max(0, (nr - dmax + 1) / 2); verif.push_back({(int)flow.edges.size(), {vmin, vmax}}); flow.AddEdge(S, i.second, vmin, vmax); } for (auto i : nrmy) { int nr = nr_on_poz[i.second]; int dmax = difmax[i.second]; int vmax = (dmax + nr) / 2; int vmin = max(0, (nr - dmax + 1) / 2); verif.push_back({(int)flow.edges.size(), {vmin, vmax}}); flow.AddEdge(i.second, D, vmin, vmax); } int f; bool posibil; auto ans = flow.Solve(posibil, f); if (!posibil) { cout << -1 n ; return; } for (auto i : verif) assert(ans[i.first] >= i.second.first && ans[i.first] <= i.second.second); cout << 1LL * f * min(r, b) + 1LL * (n - f) * max(r, b) << n ; string s = rb ; if (r < b) s = br ; for (int i = 0; i < n; i++) cout << s[ans[idshield[i]]]; cout << n ; } } // namespace ProbD int main() { ios_base::sync_with_stdio(0); ProbD::solve(); return 0; FILE* in = fopen( cuplaj.in , r ); int n, m; fscanf(in, %d%d , &n, &m); FlowWithMinRestrictions flow(n, 1, n); while (m--) { int a, b, c, d; fscanf(in, %d%d%d%d , &a, &b, &c, &d); flow.AddEdge(a, b, c, d); } bool feasible; int f; auto ans = flow.Solve(feasible, f); ofstream out( flux.out ); out << feasible << n << f << n ; for (auto i : ans) out << i << ; return 0; } |
#include <bits/stdc++.h> bool g[1111][1111]; int main() { int n, m; memset(g, false, sizeof(g)); scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int u, v; scanf( %d%d , &u, &v); g[u][v] = true; } int count = 0; for (int i = 2; i < n; i++) { bool flag = false; for (int j = 1; j <= n; j++) if (g[i][j] == true) { flag = true; break; } if (flag) continue; count++; } for (int j = 2; j < n; j++) { bool flag = false; for (int i = 1; i <= n; i++) if (g[i][j]) { flag = true; break; } if (flag) continue; count++; } if (n & 1) { int i, j; for (i = 1; i <= n; i++) if (g[i][n / 2 + 1]) break; for (j = 1; j <= n; j++) if (g[n / 2 + 1][j]) break; if (i > n && j > n) if (count) count--; } printf( %d n , count); return 0; } |
#include <bits/stdc++.h> char s1[100100], s2[100100], s3[100100]; bool dist[100100]; int pos[100100]; int main() { int n, t, i; int num = 0, po = 0; memset(dist, false, sizeof(dist)); scanf( %d%d , &n, &t); scanf( %s%s , s1, s2); for (i = 0; i < n; i++) s3[i] = 1 ; for (i = 0; i < n; i++) { if (s1[i] == s2[i]) { dist[i] = true; pos[po++] = i; num += 2; } else num++; } if (num < 2 * (n - t)) printf( -1 n ); else { int j = 0; int l = n - t; while (l > 0 && j < po) { s3[pos[j]] = s1[pos[j]]; j++; l--; } for (i = 0; i < n; i++) { if (l > 0) { while (s3[i] != 1 ) i++; s3[i] = s1[i]; while (s3[i] != 1 ) i++; s3[i] = s2[i]; l--; i--; } else if (s3[i] == 1 ) { char ch = a ; while (ch == s1[i] || ch == s2[i]) ch++; s3[i] = ch; } } s3[n] = 0 ; printf( %s n , s3); return 0; } } |
#include <bits/stdc++.h> const int N = 517; const int mod = 998244353; using namespace std; inline int read() { int x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - 0 , ch = getchar(); return x; } int n, k; long long dp[N][N], ans; int main() { n = read(), k = read(); dp[0][0] = 1; for (int i = 1, I = (n) + 1; i < I; ++i) for (int j = 1, I = (i) + 1; j < I; ++j) for (int k = i - j, I = (i - 1) + 1; k < I; ++k) dp[i][j] = (dp[i][j] + dp[k][min(j, k)]) % mod; for (int i = n, I = (1) - 1; i > I; --i) dp[n][i] = (dp[n][i] - dp[n][i - 1] + mod) % mod; for (int i = 1, I = (n) + 1; i < I; ++i) for (int j = 1, I = (n) + 1; j < I; ++j) if (i * j < k) ans = (ans + dp[n][i] * dp[n][j]) % mod; printf( %lld n , (ans << 1) % mod); return 0; } |
#include <bits/stdc++.h> using namespace std; int t; long long sx, sy, ex, ey; int main(void) { cin >> t >> sx >> sy >> ex >> ey; int ans = 0; for (int i = 0; i < t; i++) { char c; cin >> c; if (sx == ex && sy == ey) { cout << ans << n ; return 0; } if (c == N && sy < ey) sy++; if (c == W && sx > ex) sx--; if (c == S && sy > ey) sy--; if (c == E && sx < ex) sx++; ans++; } if (sx == ex && sy == ey) { cout << ans << n ; return 0; } cout << -1 n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100010]; int t[100010], p[18][100010], L[100010], d[100010]; vector<int> a[18][100010], c[100010]; void dfs(int u) { for (int i = 0; i < (int)g[u].size(); i++) { int v = g[u][i]; if (t[v] == -1) { t[v] = u; d[v] = d[u] + 1; dfs(v); } } } void Merge(const vector<int>& A, const vector<int>& B, vector<int>& C, int L = 10) { int i = 0, j = 0, k = 0, n = (int)A.size(), m = (int)B.size(); while (i < n && j < m && k < L) { if (A[i] < B[j]) { C.push_back(A[i]); i++, k++; } else if (B[j] < A[i]) { C.push_back(B[j]); j++, k++; } else { C.push_back(A[i]); i++; j++; } } while (i < n && k < L) { C.push_back(A[i]); i++, k++; } while (j < m && k < L) { C.push_back(B[j]); j++, k++; } } int scan() { int ret = 0; int ip = getchar(); for (; ip < 0 || ip > 9 ; ip = getchar()) ; for (; ip >= 0 && ip <= 9 ; ip = getchar()) ret = ret * 10 + ip - 0 ; return ret; } int main() { int n, m, q, i, j, u, v, l, x, y; vector<int> ans, temp, temp1; L[1] = 0; for (i = 2; i < 100010; i++) L[i] = L[i >> 1] + 1; n = scan(); m = scan(); q = scan(); for (i = 0; i < n - 1; i++) { u = scan(); v = scan(); --u, --v; g[u].push_back(v); g[v].push_back(u); } for (i = 0; i < m; i++) { u = scan(); --u; c[u].push_back(i + 1); } for (i = 0; i < n; i++) t[i] = -1; t[0] = 0; d[0] = 0; dfs(0); t[0] = -1; for (i = 0; i < n; i++) for (j = 0; (1 << j) < n; j++) p[j][i] = -1; for (i = 0; i < n; i++) { p[0][i] = t[i]; if (t[i] != -1 && (int)c[t[i]].size() > 0) for (j = 0; j < (int)c[t[i]].size() && j < 10; j++) a[0][i].push_back(c[t[i]][j]); } for (j = 1; (1 << j) < n; j++) { for (i = 0; i < n; i++) { if (p[j - 1][i] != -1) { p[j][i] = p[j - 1][p[j - 1][i]]; Merge(a[j - 1][i], a[j - 1][p[j - 1][i]], a[j][i]); } } } while (q--) { u = scan(); v = scan(); m = scan(); --u, --v; if (u == v) { if (!c[u].empty()) { m = min(m, (int)c[u].size()); printf( %d , m); for (i = 0; i < m; i++) printf( %d , c[u][i]); printf( n ); } else printf( 0 n ); continue; } x = u; y = v; temp.clear(); temp1.clear(); ans.clear(); if (d[u] < d[v]) swap(u, v); temp = c[u]; temp1 = c[v]; Merge(temp, temp1, ans); l = L[d[u]]; for (i = l; i >= 0; i--) if (d[u] - (1 << i) >= d[v]) { temp = ans; ans.clear(); Merge(temp, a[i][u], ans, m); u = p[i][u]; } if (u != v) { for (i = l; i >= 0; i--) if (p[i][u] != -1 && p[i][u] != p[i][v]) { temp.clear(); Merge(a[i][u], a[i][v], temp, m); temp1 = ans; ans.clear(); Merge(temp, temp1, ans, m); u = p[i][u]; v = p[i][v]; } temp = ans; ans.clear(); Merge(temp, a[0][u], ans, m); } m = min(m, (int)ans.size()); printf( %d , m); for (i = 0; i < m; i++) printf( %d , ans[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0, c; cin >> n; for (long long i = 1; i <= n; i++) { cin >> c; ans += c; } c = (n == 1 ? 1 : n - 1); if (ans == c) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INT_INF = 1e9; const long long LL_INF = 1e18; const int MAXN = 200003; int n, m; int A[MAXN]; long long calc(int m) { long long ret = 0; map<int, int> dp; int sum = 0; dp[sum] = 1; long long add = 0; for (int i = 1; i <= n; i++) { if (A[i] < m) { sum--; add -= dp[sum]; } else if (A[i] >= m) { add += dp[sum]; sum++; } ret += add; dp[sum]++; } return ret; } int main() { scanf( %d %d , &n, &m); for (int i = 1, x; i <= n; i++) { scanf( %d , &x); A[i] = x; } long long ret1 = calc(m); long long ret2 = calc(m + 1); printf( %lld , ret1 - ret2); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-12; const int INF = 1 << 30; const long long LINF = 1ll << 61; const int BUFFER_SZ = 1 << 20; const int MOD = 1000 * 1000 * 1000 + 7; char BUFFER[BUFFER_SZ]; int gi() { int x; scanf( %d , &x); return x; } double gd() { double x; scanf( %lf , &x); return x; } long long gll() { long long x; scanf( %lld , &x); return x; } vector<int> gvi(int n) { vector<int> a; while (n-- > 0) a.push_back(gi()); return a; } string gs() { scanf( %s , BUFFER); return string(BUFFER); } template <class T> void print(vector<T> &x, string format) { format += %c ; for (int i = 0; i < x.size(); ++i) printf(format.c_str(), x[i], i + 1 == x.size() ? n : ); } void solve() { int n = gi(); vector<int> a = gvi(n); for (int i = 0; i < a.size(); ++i) { for (int j = i + 1; j < a.size(); ++j) { for (int k = j + 1; k < a.size(); ++k) { if (a[i] == a[j] + a[k]) { printf( %d %d %d n , i + 1, j + 1, k + 1); return; } if (a[j] == a[i] + a[k]) { printf( %d %d %d n , j + 1, i + 1, k + 1); return; } if (a[k] == a[i] + a[j]) { printf( %d %d %d n , k + 1, i + 1, j + 1); return; } } } } printf( -1 n ); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); long long n, m, i, ans = 0, z, j; pair<long long, long long> a[105]; vector<pair<long long, long long> > q; cin >> n >> m; for (i = 1; i <= n; i++) a[i].second = 0; for (i = 1; i <= n; i++) cin >> a[i].first; for (j = 1; j <= m; j++) { cin >> z; a[z].second = 1; } for (i = 1; i <= n; i++) q.push_back(a[i]); sort(q.begin(), q.end()); for (i = 0; i < n; i++) if (q[i].second == 0) ans += q[i].first; for (i = n - 1; i >= 0; i--) if (q[i].second == 1) ans = ans + max(ans, q[i].first); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long M = 998244353; long long p[400001]; long long n; vector<long long> a(100001); bool check(long long x) { long long cnt[n + 1]; for (int i = 1; i < n + 1; i++) cnt[i] = 0; for (int i = 0; i < n; i++) cnt[a[i]]++; set<pair<long long, long long>, greater<pair<long long, long long> > > ss; for (int i = 1; i < n + 1; i++) { if (cnt[i] > 0) ss.insert({cnt[i], i}); } vector<long long> b; for (int i = 0; i < n; i++) { if (i >= x && cnt[b[i - x]] >= 1) { ss.insert({cnt[b[i - x]], b[i - x]}); } if (ss.empty()) return false; b.push_back(ss.begin()->second); cnt[ss.begin()->second]--; ss.erase(ss.begin()); } return true; } int main() { long long t; cin >> t; while (t-- > 0) { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; long long l = 0, h = n; long long ans; while (l + 1 < h) { long long mid = (l + h) / 2; if (check(mid)) { ans = mid; l = mid; } else h = mid; } cout << ans - 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; char x[5][105]; int main() { cin >> n >> m; for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { x[i][j] = . ; } } if (m % 2 == 0) { printf( YES n ); for (int i = 1; i <= m / 2; i++) { x[1][i] = # ; x[2][i] = # ; } for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { printf( %c , x[i][j]); } printf( n ); } } else { if (m >= n - 2) { printf( YES n ); for (int i = 1; i <= n - 2; i++) { x[1][i] = # ; } if (m - n + 2 >= 2) { x[2][1] = # ; x[2][n - 2] = # ; for (int i = 0; i < m - n; i++) { x[2][i + 2] = # ; } } for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { printf( %c , x[i][j]); } printf( n ); } } else { printf( YES n ); x[1][n / 2] = # ; for (int i = 1; i <= m / 2; i++) { x[1][(n / 2) + i] = # ; x[1][(n / 2) - i] = # ; } for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { printf( %c , x[i][j]); } printf( n ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> m; long long n, p; int main() { cin >> n; while (cin >> n) m[n]++; for (n = 1; n < 11; n++) p += m[n] * m[n * -1]; cout << p + m[0] * (m[0] - 1) / 2; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100], s, sum = 0; cin >> n >> s; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n - 1; i++) sum += a[i]; if (sum <= s) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int ar[1000]; int i; for (i = 0; i < n; scanf( %d , &ar[i++])) ; int b = 0, e = n - 1; int s = 0, d = 0; i = 1; while (b <= e) { if (ar[b] > ar[e]) { if (i == 1) s = s + ar[b]; else d = d + ar[b]; b++; } else { if (i == 1) s = s + ar[e]; else d = d + ar[e]; e--; } i = i * -1; } printf( %d %d , s, d); exit(0); } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 5; const long long infll = 1e18 + 5ll; const long double eps = 1e-9; const int maxn = 1e5 + 100; const long long maxlog = 21; const int P = 97; const int mod = 1e9 + 9; int n, m, lvl[maxn], up[maxlog][maxn], sub[maxn], par[maxn], ans[maxn]; std::vector<int> g[maxn]; bool ban[maxn]; void dfs1(int v = 1, int pr = 0) { lvl[v] = lvl[pr] + 1; up[0][v] = pr; for (int i = 1; i < 20; ++i) up[i][v] = up[i - 1][up[i - 1][v]]; for (auto to : g[v]) if (pr != to) { dfs1(to, v); } } int nn; void dfs2(int v, int pr) { sub[v] = 1; ++nn; for (auto to : g[v]) { if (to != pr && !ban[to]) { dfs2(to, v); sub[v] += sub[to]; } } } int getCentroid(int v, int pr) { for (auto to : g[v]) { if (to != pr && !ban[to] && sub[to] * 2 > nn) { return getCentroid(to, v); } } return v; } void decompose(int v, int pr) { nn = 0; dfs2(v, pr); int centroid = getCentroid(v, pr); par[centroid] = pr; ban[centroid] = 1; for (auto to : g[centroid]) { if (to == pr || ban[to]) continue; decompose(to, centroid); } } int lca(int a, int b) { if (lvl[a] > lvl[b]) swap(a, b); int d = lvl[b] - lvl[a]; for (int i = 0; i < maxlog; ++i) if (d & (1 << i)) b = up[i][b]; if (a == b) return b; for (int i = maxlog - 1; i >= 0; --i) if (up[i][a] != up[i][b]) a = up[i][a], b = up[i][b]; return up[0][a]; } int dist(int u, int v) { return lvl[u] + lvl[v] - 2 * lvl[lca(u, v)]; } void upd(int v) { int x = v; while (x != 0) { ans[x] = min(ans[x], dist(x, v)); x = par[x]; } } int query(int v) { int x = v, res = inf; while (x != 0) { res = min(res, ans[x] + dist(x, v)); x = par[x]; } return res; } int main() { ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); if (fopen( sorting .in , r )) freopen( sorting .in , r , stdin), freopen( sorting .out , w , stdout); ; cin >> n >> m; for (int i = 1, u, v; i < n; ++i) { cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } dfs1(); decompose(1, 0); memset(ans, inf, sizeof ans); upd(1); for (int i = 1, t, v; i <= m; ++i) { cin >> t >> v; if (t == 1) { upd(v); } else { cout << query(v) << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, ed, x, y; int l[200005], qd[200005], qn[200005], p[200005]; void bd(int x, int y) { qd[++ed] = y, qn[ed] = l[x], l[x] = ed; } int notinE(int x, int y) { for (int i = (l[x]); i; i = qn[i]) if (qd[i] == y) return 0; return 1; } int main() { scanf( %d%d , &n, &m); for (int i = (0); i < (m); i++) scanf( %d%d , &x, &y), bd(x - 1, y - 1), bd(y - 1, x - 1); for (int i = (0); i < (n); i++) p[i] = i; for (int i = (0); i < (75); i++) { random_shuffle(p, p + n); p[n] = p[0]; int ok = 1; for (int j = (1); j <= (m); j++) if (!notinE(p[j - 1], p[j])) { ok = 0; break; } if (ok) { for (int j = (1); j <= (m); j++) printf( %d %d n , p[j - 1] + 1, p[j] + 1); return 0; } } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int cmpfunc(const void *a, const void *b) { return (*(int *)a - *(int *)b); } long long int gcd(long long int m, long long int n) { if (n == 0) return m; return gcd(n, m % n); } long long int fastpow(long long int a, long long int b, long long int m) { long long int r = 1; while (b > 0) { if (b % 2 == 1) r = (r * a) % m; b = b >> 1; a = (a * a) % m; } return r; } int prime(long long int x) { if (x == 1) return 0; if (x <= 3) return 1; if (x % 6 == 1 || x % 6 == 5) { long long int y = sqrt(x), i; for (i = 2; i <= y; i++) if (x % i == 0) return 0; return 1; } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); long long int n, t; cin >> n >> t; if (n == 1 && t == 10) cout << -1 << endl; else if (t <= 9) { for (long long int i = 0; i < n; i++) cout << t; cout << endl; } else { cout << 1; for (long long int i = 1; i < n; i++) cout << 0; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long blockSize; long long cnt[100005]; long long ans[100005]; struct Query { long long L, R, idx; }; bool compare(Query x, Query y) { if (x.L / blockSize != y.L / blockSize) return x.L / blockSize < y.L / blockSize; return x.R < y.R; } void queryResults(long long a[], long long n, Query q[], long long m) { blockSize = (long long)sqrt(n); sort(q, q + m, compare); long long currL = 0, currR = 0; long long currCnt = 0; for (long long i = 0; i < m; i++) { long long L = q[i].L, R = q[i].R; while (currL < L) { if (a[currL] > 100000) { currL++; continue; } if (cnt[a[currL]] == a[currL]) currCnt--; cnt[a[currL]]--; if (cnt[a[currL]] == a[currL]) currCnt++; currL++; } while (currL > L) { if (a[currL - 1] > 100000) { currL--; continue; } if (cnt[a[currL - 1]] == a[currL - 1]) currCnt--; cnt[a[currL - 1]]++; if (cnt[a[currL - 1]] == a[currL - 1]) currCnt++; currL--; } while (currR <= R) { if (a[currR] > 100000) { currR++; continue; } if (cnt[a[currR]] == a[currR]) currCnt--; cnt[a[currR]]++; if (cnt[a[currR]] == a[currR]) currCnt++; currR++; } while (currR > R + 1) { if (a[currR - 1] > 100000) { currR--; continue; } if (cnt[a[currR - 1]] == a[currR - 1]) currCnt--; cnt[a[currR - 1]]--; if (cnt[a[currR - 1]] == a[currR - 1]) currCnt++; currR--; } ans[q[i].idx] = currCnt; } for (long long i = 0; i < m; i++) cout << ans[i] << endl; } int main() { long long n, m; cin >> n >> m; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; Query q[m]; for (long long i = 0; i < m; i++) { cin >> q[i].L >> q[i].R; q[i].L--; q[i].R--; q[i].idx = i; } queryResults(a, n, q, m); return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4101) using namespace std; const double pi = acos(-1.0); const int INF = 1000000000; const int MAX = 100007; const int MAX2 = 2000000; const int inf = (int)1e9 + 5; const long long mod = 1e9 + 7; const int BASE = 10; const int ST = 1000003; const int CNT = 100; const double eps = 1e-6; const long long base = 2204234849; const long long l_inf = (long long)4e18; const int logn = 30; int main() { long long n, a, b, c, d, maxim1, maxim2; cin >> n >> a >> b >> c >> d; long long sum1 = a + b, sum2 = b + d, sum3 = c + a, sum4 = d + c; int minim = min(sum1, min(sum2, min(sum3, sum4))); int kol = 0; maxim1 = minim + n; int maxim = max(sum1, max(sum2, max(sum3, sum4))); if (maxim > maxim1) { cout << 0; return 0; } cout << n * (maxim1 - maxim); return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } long long fun(long long n) { for (long long i = 2; i * i <= n; i++) { if (n % i == 0) return i; } return n; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, c = 0; cin >> n; if (n % 2 != 0) { n = n - fun(n); c++; } cout << c + n / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 5009; string s[MAX]; int n, m, b[MAX], ans, a[MAX]; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < m; i++) { memset(a, 0, sizeof a); for (int j = 0; j < n; j++) if (s[j][i] == 1 ) b[j]++, a[b[j]]++; else b[j] = 0; for (int i = m; i >= 0; i--) a[i] += a[i + 1], ans = max(ans, a[i] * i); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 200 * 1000 + 10; pair<int, int> a[maxN]; int nx[maxN]; stack<int> curr; int main() { ios::sync_with_stdio(false); cin.tie(0); int d, n, m; cin >> d >> n >> m; for (int i = 0; i < m; i++) cin >> a[i].first >> a[i].second; sort(a, a + m); a[m].first = d; curr.push(m); for (int i = m - 1; i >= 0; i--) { while (curr.size() > 1 && a[curr.top()].second >= a[i].second) curr.pop(); nx[i] = curr.top(); curr.push(i); } int fuel = n; long long cost = 0; for (int i = 0; i <= m; i++) { fuel -= a[i].first - (i ? a[i - 1].first : 0); if (fuel < 0) { cout << -1 << endl; return 0; } if (i == m) break; int x = min(n - fuel, max(0, a[nx[i]].first - a[i].first - fuel)); fuel += x; cost += a[i].second * 1ll * x; } cout << cost << endl; } |
#include <bits/stdc++.h> using namespace std; int ar[300005]; char ch[300005]; int n, m, ii, k; int pre[300005]; vector<pair<int, int>> v; void solve() { v.clear(); scanf( %d%d%s , &n, &m, ch); for (int i = 1; i <= n; i++) { pre[i] = pre[i - 1]; if (i & 1) { if (ch[i - 1] == + ) pre[i]++; else pre[i]--; } else { if (ch[i - 1] == - ) pre[i]++; else pre[i]--; } v.push_back({pre[i] + n, i}); } sort(v.begin(), v.end()); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); int len = y - x + 1; if (pre[y] - pre[x - 1] == 0) { printf( 0 n ); continue; } if (len & 1) printf( 1 n ); else printf( 2 n%d , x), x++; int val = pre[y] - pre[x - 1]; if (x % 2 == 0) val *= -1; int extra = val - (val / 2); if (x % 2 == 0) extra *= -1; val = pre[x - 1] + extra + n; auto it = lower_bound(v.begin(), v.end(), make_pair(val, x)); printf( %d n , it->second); } } int main() { int t = 1; scanf( %d , &t); while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; namespace math { int inc(int x, int y) { return x + y >= mod ? x + y - mod : x + y; } int qpow(int a, int x, int mo) { int res = 1; while (x) { if (x & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; x >>= 1; } return res; } vector<int> Fac, invFac; void Finit(int n) { Fac.resize(n + 1); invFac.resize(n + 1); Fac[0] = 1; invFac[0] = 1; for (int i = 1; i <= n; i++) Fac[i] = 1ll * Fac[i - 1] * i % mod; invFac[n] = qpow(Fac[n], mod - 2, mod); for (int i = n - 1; i >= 1; i--) invFac[i] = 1ll * invFac[i + 1] * (i + 1) % mod; } int C(int n, int m) { if (m == 0) return 1; if (n < m || m < 0) return 0; return (int)(1ll * Fac[n] * invFac[m] % mod * invFac[n - m] % mod); } int A(int n, int m) { if (n < m || m < 0) return 0; return (int)(1ll * Fac[n] * invFac[n - m] % mod); } } using namespace math; void solve() { int n, l, r; cin >> n >> l >> r; Finit(n); int ans = 0; int up = r - n, dn = 1 - l; if (dn < up) { if (n & 1) { ans = inc(ans, 2ll * dn * C(n, n / 2) % mod); } else { ans = inc(ans, 1ll * dn * C(n, n / 2) % mod); } for (int i = 1; i <= n; i++) { int need_add = i; int need_del = max(0, dn - up + i); if (n - need_del - need_add < 0) break; ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 - need_add) % mod); if (n & 1) ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 + 1 - need_add) % mod); } } else { if (n & 1) { ans = inc(ans, 2ll * up * C(n, n / 2) % mod); } else { ans = inc(ans, 1ll * up * C(n, n / 2) % mod); } for (int i = 1; i <= n; i++) { int need_del = i; int need_add = max(0, up - dn + i); if (n - need_del - need_add < 0) break; ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 - need_add) % mod); if (n & 1) ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 + 1 - need_add) % mod); //cout << ans << endl; } } cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int T = 1; cin >> T; while (T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; long long read() { long long s = 0; char c = getchar(), lc = + ; while (c < 0 || 9 < c) lc = c, c = getchar(); while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = getchar(); return lc == - ? -s : s; } void write(long long x) { if (x < 0) { putchar( - ); x = -x; } if (x < 10) putchar(x + 0 ); else { write(x / 10); putchar(x % 10 + 0 ); } } void print(long long x, char c = n ) { write(x); putchar(c); } inline void add(long long &x, long long y) { x += y; if (x >= p) x -= p; } inline long long lowbit(long long x) { return x & -x; } inline long long calc(long long x1, long long x2, long long y1, long long y2, long long k) { if (x2 - x1 < y2 - y1) swap(x1, y1), swap(x2, y2); long long tmp = x2 - x1; x2 = (x1 = (x1 ^ y1) & ~(tmp - 1)) + tmp; x1++; x2 = min(x2, k); if (x1 > x2 || y1 > y2) return 0; return (x1 + x2) * (x2 - x1 + 1) / 2 % p * (y2 - y1) % p; } inline long long solve(long long x, long long y, long long k) { long long ret = 0; for (long long i = x; i; i &= i - 1) for (long long j = y; j; j &= j - 1) add(ret, calc(i - lowbit(i), i, j - lowbit(j), j, k)); return ret; } signed main() { long long q = read(); while (q--) { long long x1 = read(), y1 = read(), x2 = read(), y2 = read(), k = read(); print((solve(x2, y2, k) - solve(x1 - 1, y2, k) - solve(x2, y1 - 1, k) + solve(x1 - 1, y1 - 1, k) + p + p) % p); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Nmax = 100000 + 10; int n; int nr[Nmax]; char s[Nmax], ans[Nmax]; bool ok(int L, int R) { int i, sum; if (L > R) return 0; for (i = 1; i <= n; ++i) nr[i] = s[i] - 0 ; if (L == 1 && nr[R] == 0) return 0; if (L == 2 && nr[1] != 1) return 0; for (nr[L] += nr[L - 1] * 10; true; L++, R--) { if (L == R) { ans[L] = nr[L] / 2 + 0 ; return nr[L] % 2 == 0; } if (L + 1 == R) { sum = nr[L]; if (nr[L] == nr[R] + 11) sum--; ans[L] = ans[R] = sum / 2 + 0 ; if (sum & 1) ans[L]++; return (nr[L] == nr[R] || nr[L] == nr[R] + 11); } if (nr[L] - nr[R] != 0 && nr[L] - nr[R] != 1 && nr[L] - nr[R] != 10 && nr[L] - nr[R] != 11) return 0; sum = nr[L]; if (nr[L] == nr[R]) ; if (nr[L] == nr[R] + 1 || nr[L] == nr[R] + 11) sum--, nr[L + 1] += 10; if (nr[L] == nr[R] + 10 || nr[L] == nr[R] + 11) { if (nr[R] == 9) return 0; for (i = R - 1; i >= L && nr[i] == 0; --i) nr[i] = 9; if (i == L) return 0; nr[i]--; } ans[L] = ans[R] = sum / 2 + 0 ; if (sum & 1) ans[L]++; int mata = 5; } return 1; } int main() { gets(s + 1); n = strlen(s + 1); if (ok(1, n)) puts(ans + 1); else if (ok(2, n)) puts(ans + 2); else puts( 0 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; set<int> ab[MAXN][2]; int N, M, Q; struct segTree { int f, t, mini, maxi; bool ans; segTree *L, *R; segTree(int _f, int _t) : f(_f), t(_t) { ans = false; mini = INT_MAX; maxi = INT_MIN; if (f != t) { L = new segTree(f, (f + t) / 2); R = new segTree((f + t) / 2 + 1, t); } } void update(int x, int v, bool flag) { if (f == t && t == x) { if (flag) maxi = v; else mini = v; ans = maxi >= mini; return; } if (x < R->f) L->update(x, v, flag); else R->update(x, v, flag); mini = min(R->mini, L->mini); maxi = max(R->maxi, L->maxi); ans = R->ans | L->ans | (R->maxi >= L->mini); } }; int main() { scanf( %d %d %d , &N, &M, &Q); segTree *tree = new segTree(0, N + 1); for (int i = 0; i < Q; i++) { int x, y; scanf( %d %d , &x, &y); x--, y--; bool flag = (x & 1); int mult = (flag ? -1 : 1); if (ab[x / 2][flag].count((y / 2) * mult)) ab[x / 2][flag].erase((y / 2) * mult); else ab[x / 2][flag].insert((y / 2) * mult); int val = INT_MAX; if (flag) val = INT_MIN; if (ab[x / 2][flag].size() > 0) val = abs(*ab[x / 2][flag].begin()); tree->update(x / 2, val, flag); puts((!tree->ans ? YES : NO )); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, sum, m[17], r[17]; double ans; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> m[i]; for (int i = 1; i <= n; i++) cin >> r[i]; for (int i = 1; i <= 999999; i++) for (int j = 1; j <= n; j++) if (i % m[j] == r[j]) { sum++; break; } ans = 1.0 * sum / 999999; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int o; long long w, s, t; cin >> o; for (int i = 0; i < o; i++) { cin >> w >> s >> t; long long minnn = min(s, t); cout << (w - minnn) + 1 << n ; } } |
#include<bits/stdc++.h> using namespace std; #define ll long long #define mtv(kit) cout<<#kit<< - <<kit<< n ; #define ff first #define ss second #define pb push_back #define rep(i,a,b) for(ll i=a;i<b;i++) #define pii pair<ll , ll> #define all(x) x.begin(),x.end() #define nl n #define ump unordered_map void doit(){ ll b, g, k; cin >> b >> g >> k; vector<pii>p(k); vector<ll>B(b + 2), G(g + 2); for(ll i = 0; i < k; i++){ cin >> p[i].ff; B[p[i].ff]++; } for(ll i = 0; i < k; i++){ cin >> p[i].ss; G[p[i].ss]++; } ll ans = 0; for(ll i = 0; i < k ; i++){ ans += (k - i - 1) - (B[p[i].ff] + G[p[i].ss] - 2); B[p[i].ff]--; G[p[i].ss]--; } cout << ans << nl; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); ll t = 1; cin >> t; for(ll i = 1; i <= t; i++){ doit(); } } |
#include <bits/stdc++.h> using namespace std; int cnt[5]; int main() { int n, t; cin >> n; memset(cnt, 0, sizeof(0)); for (int i = 0; i < n; i++) { cin >> t; cnt[t]++; } bool flag = true; int ret = 0; int minN = min(cnt[1], cnt[2]); cnt[3] += minN; cnt[1] -= minN; cnt[2] -= minN; ret += minN; if (cnt[1] != 0) { while (cnt[1] >= 3) { cnt[3]++; ret += 2; cnt[1] -= 3; } if (cnt[1] == 1) { if (cnt[3] > 0) { cnt[4] + 1; cnt[3]--; cnt[1] = 0; ret += 1; } else if (cnt[4] >= 2) { cnt[4] -= 2; cnt[3] += 3; cnt[1] = 0; ret += 2; } else flag = false; } else if (cnt[1] == 2) { if (cnt[4] > 0) { cnt[4] -= 1; cnt[3] += 2; ret += 2; cnt[1] = 0; } else if (cnt[3] >= 2) { cnt[3] -= 2; cnt[4] += 2; cnt[1] = 0; ret += 2; } else flag = false; } } else { while (cnt[2] >= 3) { cnt[2] -= 3; ret += 2; cnt[3] += 2; } if (cnt[2] == 1) { if (cnt[4] > 0) { cnt[4]--; cnt[3] += 1; cnt[2] = 0; ret++; } else if (cnt[3] > 1) { cnt[4] += 2; cnt[3] -= 2; cnt[2] = 0; ret += 2; } else flag = false; } else if (cnt[2] == 2) { cnt[2] = 0; cnt[4]++; ret += 2; } } if (flag) cout << ret << endl; else cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int m, n, t, k; int main() { while (scanf( %d%d , &n, &k) == 2) { if (k > n || (n >= 2 && k == 1)) printf( -1 n ); else if (k == 1) printf( %c n , a ); else { int m = n - (k - 2); for (int i = 0; i < m; i++) printf( %c , i % 2 == 0 ? a : b ); for (int i = 0; i < k - 2; i++) printf( %c , a + 2 + i); printf( 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 * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long dx[4] = {0, 0, -1, 1}; long long dy[4] = {1, -1, 0, 0}; int n, m, q; char s[11]; long long bz[100010 << 1][52]; int pos[100010 << 1][52]; int head[100010 << 1], nex[100010 << 1], val[100010 << 1], op[100010 << 1], tot; int T[100010 << 2]; void pushdown(int rt) { if (T[rt]) { T[rt << 1] = T[rt << 1 | 1] = T[rt]; T[rt] = 0; } } void insert(int l, int r, int rt, int x, int y, int v) { if (x <= l && r <= y) { T[rt] = v; return; } int mid = l + r >> 1; pushdown(rt); if (mid >= x) insert(l, mid, rt << 1, x, y, v); if (mid < y) insert(mid + 1, r, rt << 1 | 1, x, y, v); } int query(int l, int r, int rt, int v) { if (l == r) return T[rt]; int mid = l + r >> 1; pushdown(rt); if (mid >= v) return query(l, mid, rt << 1, v); else return query(mid + 1, r, rt << 1 | 1, v); } void add(long long x, long long y, int tp) { tot++; nex[tot] = head[x]; head[x] = tot; val[tot] = y; op[tot] = tp; } struct vec { long long x1, x2, y1, y2; int op; void read() { scanf( %I64d%I64d%I64d%I64d , &x1, &y1, &x2, &y2); if (y1 < y2) op = 0; if (y1 > y2) op = 1; if (x1 > x2) op = 2; if (x1 < x2) op = 3; } } a[100010]; struct node { int op; long long len, x, y; void read() { scanf( %I64d%I64d%s%I64d , &x, &y, s, &len); if (s[0] == U ) op = 0; if (s[0] == D ) op = 1; if (s[0] == L ) op = 2; if (s[0] == R ) op = 3; } } b[100010]; pair<long long, long long> cal(long long x, long long y, int p) { if (a[p].x1 == a[p].x2) { if (a[p].x1 == x) { if (min(a[p].y1, a[p].y2) <= y && y <= max(a[p].y1, a[p].y2)) return make_pair(x, y); if (y < min(a[p].y1, a[p].y2)) return make_pair(x, min(a[p].y1, a[p].y2)); else return make_pair(x, max(a[p].y1, a[p].y2)); } else return make_pair(a[p].x1, y); } else { if (a[p].y1 == y) { if (min(a[p].x1, a[p].x2) <= x && x <= max(a[p].x1, a[p].x2)) return make_pair(x, y); if (x < min(a[p].x1, a[p].x2)) return make_pair(min(a[p].x1, a[p].x2), y); else return make_pair(max(a[p].x1, a[p].x2), y); } else return make_pair(x, a[p].y1); } } int dis(long long x1, long long y1, long long x2, long long y2) { return abs(x1 - x2) + abs(y1 - y2); } pair<long long, long long> find(long long x, long long y, int tp, long long step) { return make_pair(x + step * dx[tp], y + step * dy[tp]); } void print(pair<long long, long long> p) { long long x = p.first, y = p.second; x = max(x, 0ll); x = min(x, (long long)m); y = max(y, 0ll); y = min(y, (long long)m); printf( %I64d %I64d n , x, y); } int main() { n = read(); m = read(); for (int i = 1; i <= n; i++) a[i].read(); q = read(); for (int i = 1; i <= q; i++) b[i].read(); for (int i = 0; i <= 3; i++) { tot = 0; memset(head, 0, sizeof(head)); memset(T, 0, sizeof(T)); for (int j = 1; j <= q; j++) if (b[j].op == i) { if (i < 2) add(b[j].y, j + n, 1); else add(b[j].x, j + n, 1); } for (int j = 1; j <= n; j++) { if (i == 0) add(max(a[j].y1, a[j].y2), j, 0); if (i == 1) add(min(a[j].y1, a[j].y2), j, 0); if (i == 2) add(min(a[j].x1, a[j].x2), j, 0); if (i == 3) add(max(a[j].x1, a[j].x2), j, 0); } for (int j = 1; j <= n; j++) if (a[j].op == i) { if (i < 2) add(a[j].y2, j, 1); else add(a[j].x2, j, 1); } int now = (i == 0 || i == 3) ? m : 0; while (now != -1 && now != m + 1) { for (int j = head[now]; j; j = nex[j]) { if (!op[j]) { if (i < 2) insert(0, m, 1, min(a[val[j]].x1, a[val[j]].x2), max(a[val[j]].x1, a[val[j]].x2), val[j]); else insert(0, m, 1, min(a[val[j]].y1, a[val[j]].y2), max(a[val[j]].y1, a[val[j]].y2), val[j]); } else { int tmp; if (val[j] <= n) { if (i < 2) tmp = query(0, m, 1, a[val[j]].x1); else tmp = query(0, m, 1, a[val[j]].y1); } else { if (i < 2) tmp = query(0, m, 1, b[val[j] - n].x); else tmp = query(0, m, 1, b[val[j] - n].y); } pos[val[j]][0] = tmp; if (tmp) { if (val[j] <= n) bz[val[j]][0] = abs(a[tmp].x2 - a[val[j]].x2) + abs(a[tmp].y2 - a[val[j]].y2); else bz[val[j]][0] = abs(a[tmp].x2 - b[val[j] - n].x) + abs(a[tmp].y2 - b[val[j] - n].y); } else bz[val[j]][0] = 1ll << 50; } } if (i == 0 || i == 3) now--; else now++; } } for (int i = 1; i <= 50; i++) bz[0][i] = 1ll << 50; for (int i = 1; i <= 50; i++) for (int j = 1; j <= n + q; j++) { pos[j][i] = pos[pos[j][i - 1]][i - 1]; bz[j][i] = bz[j][i - 1] + bz[pos[j][i - 1]][i - 1]; bz[j][i] = min(bz[j][i], 1ll << 50); } for (int i = 1; i <= q; i++) { int tmp = i + n; long long t = b[i].len; for (int j = 50; j >= 0; j--) if (bz[tmp][j] <= t) { t -= bz[tmp][j]; tmp = pos[tmp][j]; } if (tmp == i + n) { if (pos[tmp][0]) { pair<long long, long long> tq = cal(b[i].x, b[i].y, pos[tmp][0]); int tw = dis(tq.first, tq.second, b[i].x, b[i].y); if (tw >= t) print(find(b[i].x, b[i].y, b[i].op, t)); else print(find(tq.first, tq.second, a[pos[tmp][0]].op, t - tw)); } else print(find(b[i].x, b[i].y, b[i].op, t)); } else { if (!pos[tmp][0]) print(find(a[tmp].x2, a[tmp].y2, a[tmp].op, t)); else { pair<long long, long long> tq = cal(a[tmp].x2, a[tmp].y2, pos[tmp][0]); int tw = dis(tq.first, tq.second, a[tmp].x2, a[tmp].y2); if (tw >= t) print(find(a[tmp].x2, a[tmp].y2, a[tmp].op, t)); else print(find(tq.first, tq.second, a[pos[tmp][0]].op, t - tw)); } } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long long INF = (long long)1e18 + 100; long long safe_sum(long long a, long long b) { long long s = (a + b); s = min(s, INF); return s; } long long safe_mult(long long a, long long b) { if (a == 0 || b == 0) return 0; if (a >= ((INF + b - 1) / b)) return INF; return (a * b); } const int maxN = 1005; long long c[maxN][maxN]; long long gcd(long long x, long long y) { while (x > 0 && y > 0) { if (x < y) swap(x, y); x %= y; } return (x + y); } long long cnk(long long x, int a) { vector<long long> cur; for (int i = 0; i < a; i++) { cur.push_back(x - i); } for (int j = 1; j <= a; j++) { int now = j; for (auto& it : cur) { if (now == 1) break; int d = (int)(gcd(it, now)); it /= d; now /= d; } } long long ans = 1; for (auto& it : cur) ans = safe_mult(ans, it); return ans; } int n; long long k; const int maxT = 2 * (int)1e5 + 100; const int BUBEN = 10; long long a[maxT]; long long get_cnk(long long x, long long y) { if (x - y < y) return get_cnk(x, x - y); if (x < y) return 0; if (x < maxN) { return c[x][y]; } if (y >= BUBEN) return INF; else return cnk(x, (int)y); } bool ok(long long who) { long long f = 0; for (int i = 0; i < n; i++) { f = safe_sum(f, safe_mult(a[i], get_cnk(n - i - 1 + who - 1, who - 1))); if (f >= k) return true; } return (f >= k); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); c[0][0] = 1; for (int i = 1; i < maxN; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) { c[i][j] = safe_sum(c[i - 1][j], c[i - 1][j - 1]); } } cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] >= k) { cout << 0; return 0; } } long long l = 0; long long r = (long long)(1e18) + 100; while (r - l > 1) { long long mid = (l + r) / 2; if (ok(mid)) r = mid; else l = mid; } cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1005; int a[N][N]; int dp1[N][N] = {0}, dp2[N][N] = {0}, dp3[N][N] = {0}, dp4[N][N] = {0}; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { dp1[i][j] = max(dp1[i - 1][j], dp1[i][j - 1]) + a[i][j]; } for (int i = n; i >= 1; i--) for (int j = m; j >= 1; j--) { dp2[i][j] = max(dp2[i + 1][j], dp2[i][j + 1]) + a[i][j]; } for (int i = n; i >= 1; i--) for (int j = 1; j <= m; j++) { dp3[i][j] = max(dp3[i + 1][j], dp3[i][j - 1]) + a[i][j]; } for (int i = 1; i <= n; i++) for (int j = m; j >= 1; j--) { dp4[i][j] = max(dp4[i - 1][j], dp4[i][j + 1]) + a[i][j]; } int ans = 0; for (int i = 2; i < n; i++) for (int j = 2; j < m; j++) { ans = max(dp1[i - 1][j] + dp2[i + 1][j] + dp3[i][j - 1] + dp4[i][j + 1], ans); ans = max(dp1[i][j - 1] + dp2[i][j + 1] + dp3[i + 1][j] + dp4[i - 1][j], ans); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct pvec { long long int x, y; pvec(long long int x = 0, long long int y = 0) : x(x), y(y) {} pvec operator-(pvec p) { return pvec(x - p.x, y - p.y); } bool operator==(pvec p) { return x == p.x and y == p.y; } long long int dot(pvec p) { return x * p.x + y * p.y; } long long int abs2() { return x * x + y * y; } }; pvec v[12], Q[12], R[12]; long long int Qi[12], Ri[12]; long long int perm[][3] = {{1, 2, 3}, {1, 3, 2}, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1}}; inline bool quadrado() { for (long long int i = 0; i < 6; i++) { pvec p0 = Q[0]; pvec p1 = Q[perm[i][0]]; pvec p2 = Q[perm[i][1]]; pvec p3 = Q[perm[i][2]]; pvec v1 = p1 - p0, v2 = p2 - p1, v3 = (p2 - p3), v4 = (p3 - p0); if (!(v1 == v3 and v2 == v4)) continue; if (v1.abs2() != v2.abs2()) continue; if (v1.dot(v2) != 0) continue; return true; } return false; } inline bool retangulo() { for (long long int i = 0; i < 6; i++) { pvec p0 = R[0]; pvec p1 = R[perm[i][0]]; pvec p2 = R[perm[i][1]]; pvec p3 = R[perm[i][2]]; pvec v1 = p1 - p0, v2 = p2 - p1, v3 = (p2 - p3), v4 = (p3 - p0); if (!(v1 == v3 and v2 == v4)) continue; if (v1.dot(v2) != 0) continue; return true; } return false; } bool da(long long int u, long long int quad, long long int ret) { if (quad > 4 or ret > 4) return false; if (u == 8) { if (quadrado() and retangulo()) return true; return false; } Q[quad] = v[u]; Qi[quad] = u; if (da(u + 1, quad + 1, ret)) return true; R[ret] = v[u]; Ri[ret] = u; if (da(u + 1, quad, ret + 1)) return true; return false; } int main() { for (long long int i = 0; i < 8; i++) { long long int x, y; cin >> x >> y; v[i] = pvec(x, y); } if (!da(0, 0, 0)) { cout << NO << endl; } else { cout << YES << endl; for (long long int i = 0; i < 4; i++) { if (i) printf( ); cout << Qi[i] + 1; } cout << endl; for (long long int i = 0; i < 4; i++) { if (i) printf( ); cout << Ri[i] + 1; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a = 1, n; cin >> n; for (int i = 0; i < n; i++) { a *= i + 1; } cout << a * 2 / n / n; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long l, r, b, c, a; long long m; cin >> l >> r >> m; for (long long i = l; i <= r; i++) { a = i; long long n = m / a, temp = a * n, diff = m - temp; if (n > 0 && abs(m - temp) <= r - l) { if (diff >= 0) { b = r; c = r - m + temp; } else { b = l; c = l + temp - m; } cout << a << << b << << c << n ; break; } n = m / a + 1, temp = a * n, diff = m - temp; if (abs(m - temp) <= r - l) { if (diff >= 0) { b = r; c = r - m + temp; } else { b = l; c = l + temp - m; } cout << a << << b << << c << n ; break; } } } } |
#include <bits/stdc++.h> using namespace std; double a, v, d, w, l, ans, mid, t2, t; bool check(double maxv) { return d - ((maxv + w) / 2) * (((maxv - w) * 2) / a) > 1e-8; } int main() { scanf( %lf %lf %lf %lf %lf , &a, &v, &l, &d, &w); w = min(min(w, v), sqrt(2 * a * d)); if (2 * a * d + w * w > 2 * v * v) { t = (d - v * v / a + w * w / a / 2) / v + (2 * v - w) / a; } else { t = (2 * sqrt(a * d + w * w / 2) - w) / a; } l = l - d; t2 = (v - w) / a; if (l - w * t2 - 0.5 * a * t2 * t2 > 0) { t2 = t2 + (l - w * t2 - 0.5 * a * t2 * t2) / v; } else { t2 = (-w + sqrt(w * w + 2.0 * a * l)) / a; } printf( %.10f n , t + t2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 200020; int n, a[Maxn]; long long sum[Maxn]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 0; i < n - 1; i++) { int cur; for (cur = 1; cur <= i;) { int val = i / cur; int ncur = i / val + 1; if (a[i + 2] < a[val + 1]) { sum[cur]++; sum[ncur]--; } cur = ncur; } if (a[i + 2] < a[1]) sum[cur]++, sum[n]--; } for (int i = 1; i < n; i++) sum[i] += sum[i - 1], printf( %I64d n , sum[i]); ; } |
#include <bits/stdc++.h> int main() { int n, i; int maximum, maxIndex, target; int A[1000]; scanf( %d , &n); maximum = -1; for (i = 0; i < n; ++i) { scanf( %d , &A[i]); if (A[i] > maximum) { maximum = A[i]; maxIndex = i; } } A[maxIndex] = -2; target = -1; for (i = 0; i < n; ++i) { if (A[i] > target) { target = A[i]; } } printf( %d %d , maxIndex + 1, target); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; } vector<int> v(n), d(n); queue<int> q; q.push(0); v[0] = 1; int l = 0; while (!q.empty()) { int nn = q.size(); while (nn-- > 0) { int t = q.front(); q.pop(); d[t] = l; if (t > 0 && v[t - 1] == 0) { q.push(t - 1); v[t - 1] = 1; } if (t < n - 1 && v[t + 1] == 0) { q.push(t + 1); v[t + 1] = 1; } if (v[a[t]] == 0) { q.push(a[t]); v[a[t]] = 1; } } l++; } for (int i : d) cout << i << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; int n, k; int a[2011]; long long pre[1 << 11 + 1]; long long cur[1 << 11 + 1]; void solve() { memset(pre, 0, sizeof(pre)); pre[0] = 1; for (int i = 0; i < n; i++) { memset(cur, 0, sizeof(cur)); for (int j = 0; j < (1 << k) + 1; j++) { if (a[i] == 2 || a[i] == 0) { int nj = min(j + 2, 1 << k); cur[nj] = (cur[nj] + pre[j]) % mod; } if (a[i] == 4 || a[i] == 0) { int nj = min(j + 4, 1 << k); if ((j & 2) != 0) { nj = 4; } cur[nj] = (cur[nj] + pre[j]) % mod; } } memcpy(pre, cur, sizeof(cur)); } cout << pre[1 << k] << endl; } void coding() { while (cin >> n >> k) { for (int i = 0; i < n; i++) cin >> a[i]; solve(); } } int main() { coding(); } |
#include <bits/stdc++.h> using namespace std; const long long dp = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n, a; cin >> n >> a; vector<int> vec(n); int cnt = 0; for (int i = 0; i < n; i++) { cin >> vec[i]; if (vec[i]) cnt++; } for (int i = 0; i < a; i++) { if (vec[a - 1 - i] + vec[a - 1 + i] == 1) cnt--; if (i >= n - a) break; } cout << cnt << n ; return 0; } |
#include <bits/stdc++.h> const int maxn = 2005; const int inf = 1e9; using namespace std; vector<pair<int, int>> G[maxn]; vector<int> C[maxn], v; bool critical[maxn * maxn]; vector<int> seen, sum, col, depth, up; void dfs(int node, int ind) { seen[node] = 1; int minFromSons = inf; up[node] = depth[node]; for (auto tmp : G[node]) { if (seen[tmp.first] && tmp.second != ind) up[node] = min(up[node], depth[tmp.first]); else if (!seen[tmp.first]) { depth[tmp.first] = depth[node] + 1; dfs(tmp.first, tmp.second); minFromSons = min(minFromSons, up[tmp.first]); } } up[node] = min(up[node], minFromSons); if (minFromSons >= depth[node] && ind != -1) { critical[ind] = 1; } } void dfsColor(int node, int color) { col[node] = color; v[color]++; for (auto tmp : G[node]) { if (critical[tmp.second] == 1 && col[tmp.first] == 0) continue; if (critical[tmp.second] == 1 && col[tmp.first]) { C[col[tmp.first]].push_back(color); C[color].push_back(col[tmp.first]); continue; } else if (col[tmp.first] == 0) dfsColor(tmp.first, color); } } void dfsSub(int node) { seen[node] = 1; sum[node] = v[node]; for (auto tmp : C[node]) if (!seen[tmp]) { dfsSub(tmp); sum[node] += sum[tmp]; } } int main() { ios_base ::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; G[a].push_back(make_pair(b, i)); G[b].push_back(make_pair(a, i)); } seen = vector<int>(n + 1, 0); depth = vector<int>(n + 1, 0); up = vector<int>(n + 1, 0); dfs(1, -1); int c = 0; col = vector<int>(n + 1, 0); v = vector<int>(n + 1, 0); int all = 0; for (int i = 1; i <= n; ++i) if (col[i] == 0) { ++c; dfsColor(i, c); all += v[c] * v[c]; } int ans = 0; for (int i = 1; i <= c; ++i) { seen = vector<int>(c + 1, 0); sum = vector<int>(c + 1, 0); dfsSub(i); int tmp = 0; for (int j = 1; j <= c; ++j) tmp += sum[j] * v[j]; vector<int> can(n + 1, 0); can[0] = 1; for (auto tmp : C[i]) { for (int j = n; j >= 0; --j) if (can[j] && j + sum[tmp] <= n) can[j + sum[tmp]] = 1; } int res = -1; for (int j = (n - v[i]) / 2; j >= 0; --j) if (can[j]) { res = j; break; } tmp += res * (n - v[i] - res); ans = max(ans, tmp); } cerr << all << n ; cout << ans << n ; } |
#include <bits/stdc++.h> int main() { int x, count = 0, i; char ar[50]; for (i = 0; i < 9; i++) scanf( %c , &ar[i]); for (i = 0; i < 9; i++) { if (ar[i] == ar[8 - i]) count++; } if (count == 9) printf( YES ); else printf( NO ); } |
#include <bits/stdc++.h> using namespace std; const int shape[4][4][2] = {{{1, 0}, {2, 0}, {1, 1}, {1, 2}}, {{1, 0}, {2, 0}, {2, -1}, {2, 1}}, {{0, 1}, {0, 2}, {-1, 2}, {1, 2}}, {{0, 1}, {0, 2}, {1, 1}, {2, 1}}}; int x, y; struct node { char g[9][9]; int num; int sx, sy; int layer; node() { layer = 0; sx = sy = 0; memset(g, 0, sizeof(g)); num = 0; } void printNode() { for (int i = 0; i < y; i++) { for (int j = 0; j < x; j++) printf( %c , g[i][j] ? g[i][j] : . ); cout << << endl; } } }; stack<node> q; int ans; node ansNode; int maxG[9][9][4]; void bfs() { while (!q.empty()) { node now = q.top(); q.pop(); if (now.num > ans) { ans = now.num; ansNode = now; } now.num++; char ch = A + now.num - 1; for (int i = now.sy; i < y; i++) { for (int j = 0; j < x; j++) { if (!now.g[i][j]) { for (int k = 0; k < 4; k++) { if (maxG[i][j][k] > now.num + 1) continue; bool flag = true; for (int l = 0; l < 4 && flag; l++) { int tx = j + shape[k][l][1]; int ty = i + shape[k][l][0]; if (tx < 0 || tx >= x || ty < 0 || ty >= y || now.g[ty][tx]) { flag = false; } } if (flag) { node tNode = now; tNode.g[i][j] = ch; for (int l = 0; l < 4; l++) { int tx = j + shape[k][l][1]; int ty = i + shape[k][l][0]; tNode.g[ty][tx] = ch; } tNode.sx = j + 1; tNode.sy = i; tNode.layer++; q.push(tNode); maxG[i][j][k] = max(maxG[i][j][k], now.num); } } } } } } } int main() { ans = -1; cin >> y >> x; while (!q.empty()) q.pop(); q.push(node()); bfs(); cout << ans << endl; ansNode.printNode(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100009; int sol, qs[N], qe[N], sorted[N], ans[N], a[N], s, e; unordered_map<int, int> freq; void add(int el) { sol -= !(freq[el] ^ el); freq[el]++; sol += !(freq[el] ^ el); } void remove(int el) { sol -= !(freq[el] ^ el); freq[el]--; sol += !(freq[el] ^ el); } void mo(int idx) { while (s > qs[idx]) add(a[--s]); while (e <= qe[idx]) add(a[e++]); while (s < qs[idx]) remove(a[s++]); while (e > qe[idx] + 1) remove(a[--e]); ans[idx] = sol; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) { cin >> qs[i] >> qe[i]; qs[i]--, qe[i]--; sorted[i] = i; } int sq = sqrt(n); sort(sorted, sorted + m, [sq](int i, int j) { return make_pair(qs[i] / sq, qe[i]) < make_pair(qs[j] / sq, qe[j]); }); for (int i = 0; i < m; i++) mo(sorted[i]); for (int i = 0; i < m; i++) cout << ans[i] << n ; } |
#include <bits/stdc++.h> using namespace std; template <class T> using min_pq = priority_queue<T, vector<T>, greater<T>>; const int MAXN = 1e5 + 10, MAXQ = 3e5 + 10, MAXL = 20, ALP = 26, MOD = 1e9 + 7, MAXK = 17, INF = 1e9 + 10, MAXA = 30, MAXB = 24, MAXBB = (1 << MAXB); const string no = NO n , yes = YES n ; const int hA[4] = {1, 0, -1, 0}, kA[4] = {0, 1, 0, -1}; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int a; cin >> a; if ((a & 1) != ((i + j) & 1)) a++; cout << a << ; } cout << n ; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int t = 1; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, sum1 = 0, res1 = 0, last = 0; bool flag = true; cin >> n; unordered_map<long long int, long long int> m; vector<pair<long long int, long long int>> v; for (long long int i = 0; i < n; i++) { long long int element; cin >> element; m[element]++; v.emplace_back(make_pair(element, i)); } if (n == 1) { cout << 1 << n ; cout << v[0].first << << 0 n ; return 0; } sort(v.begin(), v.end()); vector<pair<long long int, long long int>> v1; for (long long int i = 0; i < v.size() - 1; i++) { flag = true; if (i < v.size() - 1 && v[i].first == v[i + 1].first) sum1 = v[i + 1].second - v[i].second; else if (i < v.size() - 1) sum1 = 0; while (i < v.size() - 1 && v[i].first == v[i + 1].first) { res1 = v[i + 1].second - v[i].second; if (res1 != sum1) { flag = false; break; } i++; } if (flag == true) { v1.push_back(make_pair(v[i].first, sum1)); } while (i < v.size() - 1 && v[i].first == v[i + 1].first) { i++; } } if (v[v.size() - 1].first != v[v.size() - 2].first) { v1.emplace_back(make_pair(v[v.size() - 1].first, 0)); } cout << v1.size() << n ; for (long long int i = 0; i < v1.size(); i++) { cout << v1[i].first << << v1[i].second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); long long int t, temp, i, ans = 0, n, m, index, j; cin >> n >> m; vector<pair<long long int, long long int> > pa; vector<long long int> v(n), finger(m); for (i = 0; i < n; i++) { cin >> v[i]; } for (i = 0; i < m; i++) { cin >> finger[i]; for (j = 0; j < n; j++) { if (v[j] == finger[i]) { pa.push_back(make_pair(j, finger[i])); } } } sort(pa.begin(), pa.end()); if (pa.size() == 0) cout << n ; else { for (auto it = pa.begin(); it != pa.end(); it++) { cout << it->second << ; } } } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long inf2 = 0x3f3f3f3f3f3f3f3f; const double eps = 1e-6; const int mod = 1000000007; namespace fastio { char in[100000]; int itr = 0, llen = 0; char get() { if (itr == llen) llen = fread(in, 1, 100000, stdin), itr = 0; if (llen == 0) return EOF; return in[itr++]; } char out[100000]; int itr2 = 0; void put(char c) { out[itr2++] = c; if (itr2 == 100000) { fwrite(out, 1, 100000, stdout); itr2 = 0; } } int clear() { fwrite(out, 1, itr2, stdout); itr2 = 0; return 0; } int getint() { int r = 0; bool ng = 0; char c; c = get(); while (c != - && (c < 0 || c > 9 )) c = get(); if (c == - ) ng = 1, c = get(); while (c >= 0 && c <= 9 ) r = r * 10 + c - 0 , c = get(); return ng ? -r : r; } string getstr() { string ret = ; char ch = get(); while (ch == || ch == n ) ch = get(); while (ch != && ch != n ) ret.push_back(ch), ch = get(); return ret; } void putstr(string s) { for (int i = 0; i < s.size(); i++) put(s[i]); } void putint(int x) { if (x < 0) { put( - ); x = -x; } if (x == 0) { put( 0 ); return; } char c[20]; int pos = 0; while (x) { c[pos++] = 0 + x % 10; x /= 10; } for (int i = pos - 1; i >= 0; i--) put(c[i]); } void getarr(int arrname[], int size) { for (int i = 0; i < size; i++) arrname[i] = getint(); } } // namespace fastio using namespace fastio; int number[1000005], BITN = 1e6; void modify(int x, int y) { while (x <= BITN) { number[x] += y; x += x & -x; } } int sum(int x) { int ret = 0; while (x) { ret += number[x]; x &= x - 1; } return ret; } void add(int l, int r, int v) { modify(l, v); modify(r, -v); } int qry(int x) { return sum(x); } int n, k; vector<int> g[1000005]; vector<int> ord; int pos[1000005]; bool used[1000005]; int par[1000005]; int sz[1000005], depth[1000005]; void dfs(int x, int pr) { depth[x] = x == n ? 0 : depth[pr] + 1; pos[x] = ord.size() + 1; ord.push_back(x); sz[x] = 1; for (auto to : g[x]) if (to != pr) par[to] = x, dfs(to, x), sz[x] += sz[to]; } int main() { n = getint(); k = getint(); for (int i = 1; i < n; i++) { int a = getint(), b = getint(); g[a].push_back(b); g[b].push_back(a); } dfs(n, 0); for (int i = 0; i < ord.size(); i++) { modify(i + 1, depth[ord[i]] - (i == 0 ? 0 : depth[ord[i - 1]])); } used[n] = true; int rest = n - k - 1; for (int v = n - 1; v > 0 && rest; v--) { if (used[v]) continue; int len = qry(pos[v]); if (len <= rest) { int cur = v; while (!used[cur]) { used[cur] = true; add(pos[cur], pos[cur] + sz[cur], -1); cur = par[cur]; rest--; } } } vector<int> ans; for (int i = 1; i <= n; i++) if (!used[i]) ans.push_back(i); for (int i = 0; i < ans.size(); i++) putint(ans[i]), put( ); clear(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5555; int hackable[N]; int sols[N]; int pts[N][13]; int score[N]; int z[N]; int bound[N]; int cnt_hack[N]; int rgt[N]; int task[N][13]; int guys[N]; int main() { int n; scanf( %d , &n); for (int j = 0; j < 3; j++) { hackable[j] = 0; sols[j] = 0; } for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) { scanf( %d , task[i] + j); if (task[i][j] < 0) { hackable[j]++; } if (task[i][j] > 0) { sols[j]++; } } } int cost[3]; int ans = n; for (cost[0] = 500; cost[0] <= 3000; cost[0] += 500) { for (cost[1] = 500; cost[1] <= 3000; cost[1] += 500) { for (cost[2] = 500; cost[2] <= 3000; cost[2] += 500) { bool err = false; for (int j = 0; j < 3; j++) { cnt_hack[j] = -1; for (int u = hackable[j]; u >= 0; u--) { int k = sols[j] + (hackable[j] - u); int real_cost = 500; int coeff = 2; while (coeff * k <= n && real_cost < 3000) { coeff *= 2; real_cost += 500; } if (real_cost == cost[j]) { cnt_hack[j] = u; break; } } if (cnt_hack[j] == -1) { err = true; break; } } if (err) { continue; } for (int i = 0; i < n; i++) { score[i] = 0; for (int j = 0; j < 3; j++) { int a = abs(task[i][j]); pts[i][j] = (a > 0 ? (cost[j] * (250 - a) / 250) : 0); score[i] += pts[i][j]; } } score[0] += 100 * (cnt_hack[0] + cnt_hack[1] + cnt_hack[2]); int cnt = 0; for (int type = 0; type < 128; type++) { guys[type] = 0; } for (int i = 1; i < n; i++) { if (score[i] > score[0]) { int type = 0; for (int t = 1; t < 8; t++) { int dec = 0; for (int j = 0; j < 3; j++) { if (t & (1 << j)) { if (task[i][j] < 0) { dec += pts[i][j]; } } } if (score[i] - dec <= score[0]) { type |= (1 << (t - 1)); } } guys[type]++; cnt++; } } for (int mask = 1; mask < (1 << 7); mask++) { rgt[mask] = 0; for (int type = 0; type < 128; type++) { if (type & mask) { rgt[mask] += guys[type]; } } } for (int j = 0; j < 3; j++) { cnt_hack[j] = min(cnt_hack[j], cnt); } for (int AB = 0; AB <= cnt_hack[0]; AB++) { for (int AC = 0; AB + AC <= cnt_hack[0]; AC++) { for (int BC = 0; AB + BC <= cnt_hack[1] && AC + BC <= cnt_hack[2]; BC++) { for (int ABC = 0; AB + AC + ABC <= cnt_hack[0] && AB + BC + ABC <= cnt_hack[1] && AC + BC + ABC <= cnt_hack[2]; ABC++) { int A = cnt_hack[0] - AB - AC - ABC; int B = cnt_hack[1] - AB - BC - ABC; int C = cnt_hack[2] - AC - BC - ABC; z[1] = 0; z[2] = 0; z[3] = AB; z[4] = 0; z[5] = AC; z[6] = BC; z[7] = ABC; bound[0] = 0; bound[1] = A; bound[2] = B; bound[3] = A + B; bound[4] = C; bound[5] = A + C; bound[6] = B + C; bound[7] = A + B + C; for (int mask = 1; mask < (1 << 7); mask++) { int lft = 0; for (int t = 1; t < 8; t++) { if (mask & (1 << (t - 1))) { lft += z[t]; } } bound[mask & 7] = min(bound[mask & 7], rgt[mask] - lft); } if (bound[0] < 0) { continue; } for (int realA = 0; realA <= bound[1]; realA++) { int boundB = min(bound[2], bound[3] - realA); int boundC = min(bound[4], bound[5] - realA); int boundBC = min(bound[6], bound[7] - realA); if (boundB >= 0 && boundC >= 0 && boundBC >= 0) { int realBplusC = min(boundB + boundC, boundBC); ans = min(ans, 1 + (cnt - realA - realBplusC - AB - AC - BC - ABC)); } } } } } } } } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long m, l, r, k; struct Matrix { long long W[2][2]; }; Matrix operator*(const Matrix& A, const Matrix& B) { Matrix S; memset(S.W, 0, sizeof(S.W)); for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) for (int l = 0; l < 2; ++l) S.W[i][j] = (S.W[i][j] + A.W[i][l] * B.W[l][j]) % m; return S; } Matrix operator^(Matrix A, long long e) { Matrix S; S.W[0][0] = S.W[1][1] = 1; S.W[0][1] = S.W[1][0] = 0; while (e) { if (e & 1) S = S * A; A = A * A; e >>= 1; } return S; } long long gcd() { long long s = 1; for (long long i = 1; i * i <= r; ++i) { if (r / i - (l - 1) / i >= k && i > s) s = i; long long e = r / i; if (i - (l - 1) / e >= k && e > s) s = e; } return s; } int main() { cin >> m >> l >> r >> k; long long n = gcd(); if (n <= 2) cout << 1 % m << endl; else { Matrix D, S; D.W[0][0] = 0; D.W[0][1] = D.W[1][0] = D.W[1][1] = 1; S = D ^ (n - 2); cout << (S.W[0][1] + S.W[1][1]) % m << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int N; vector<int> a, b, c; multiset<int> m; int main(void) { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cin >> N; a.resize(N); b.resize(N); c.resize(N); for (int i = 0; i < N; i++) { cin >> a[i]; } for (int i = 0; i < N; i++) { cin >> b[i]; m.insert(b[i]); } for (int i = 0; i < N; i++) { int cur = N - a[i]; multiset<int>::iterator iter = m.lower_bound(cur); if (iter == m.end()) { iter = m.begin(); } c[i] = (a[i] + (*iter)) % N; m.erase(iter); } for (int i = 0; i < N; i++) { cout << c[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int h, w, r; } edge[110]; bool vis[11]; int x[5000000]; int n, k, t; void init() { cin >> n >> k >> t; for (int i = 1; i <= k; i++) cin >> edge[i].h >> edge[i].w >> edge[i].r; } void solve() { int l = 0; for (int j = 1; j <= (1 << k) - 1; j++) { int t = 0; for (int i = 1; i <= k; i++) if ((j & (1 << (i - 1))) != 0) t++; if (t > n) continue; memset(vis, 0, sizeof(vis)); int s = 0; bool flag = true; for (int i = 1; i <= k; i++) if ((j & (1 << (i - 1))) != 0) { if (vis[edge[i].h] || vis[edge[i].w + n]) { flag = false; break; } vis[edge[i].h] = vis[edge[i].w + n] = true; s += edge[i].r; } if (flag) x[++l] = s; } sort(x, x + l + 1); cout << x[t - 1] << endl; } int main() { ios::sync_with_stdio(false); init(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int TAM = 100000 + 15; const long long MOD = 1000000007LL; const double PI = 3.14159265359; long long add(long long x, long long y) { return (x + y + 2 * MOD) % MOD; } long long mult(long long x, long long y) { return (add(x, 0) * add(y, 0)) % MOD; } long long fast_expo(long long x, long long y) { if (x == 0) return 0; if (y == 0) return 1; long long res = 1; long long mid = fast_expo(x, y / 2); if (y % 2 != 0) res = x; return mult(mult(mid, mid), res); } long long inver(long long x) { return fast_expo(x, MOD - 2); } long long gcd(long long e1, long long e2) { if (e2 == 0) return e1; return gcd(e2, e1 % e2); } int n; map<int, int> mapa[TAM]; int color[TAM]; vector<int> G[TAM]; long long dom[TAM]; int tam[TAM]; int cant[TAM]; void dfs_tam(int u, int pd = -1) { tam[u] = 1; for (int v : G[u]) { if (v != pd) { dfs_tam(v, u); tam[u] += tam[v]; } } } void dfs(int u, int pd = -1) { int m = -1, val = -1; for (int v : G[u]) { if (v != pd) { if (tam[v] > val) { m = v; val = tam[v]; } } } if (m == -1) { mapa[u][color[u]]++; dom[u] = color[u]; cant[u] = 1; return; } for (int v : G[u]) { if (v != pd) { dfs(v, u); } } swap(mapa[u], mapa[m]); dom[u] = dom[m]; cant[u] = cant[m]; mapa[u][color[u]]++; if (mapa[u][color[u]] > cant[u]) { cant[u] = mapa[u][color[u]]; dom[u] = 1LL * color[u]; } else if (mapa[u][color[u]] == cant[u]) { dom[u] += 1LL * color[u]; } for (int v : G[u]) { if (v != pd && v != m) { int k, t; for (map<int, int>::iterator it = mapa[v].begin(); it != mapa[v].end(); it++) { k = it->first; t = it->second; mapa[u][k] += t; if (mapa[u][k] > cant[u]) { cant[u] = mapa[u][k]; dom[u] = 1LL * k; } else if (mapa[u][k] == cant[u]) { dom[u] += 1LL * k; } } } } } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &color[i]); int u, v; for (int i = 0; i < n - 1; i++) { scanf( %d%d , &u, &v); G[u - 1].push_back(v - 1); G[v - 1].push_back(u - 1); } dfs_tam(0); dfs(0); for (int i = 0; i < n; i++) cout << 1LL * dom[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool compare(pair<int, int> p1, pair<int, int> p2) { return p1.first > p2.first; } long long int power(int a, int b) { if (b == 0) return 1; return a * power(a, b - 1); } int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { int n, m; cin >> n >> m; int a[n + 1], b[m + 1]; for (int i = 0; i < n + 1; i++) { cin >> a[i]; } for (int i = 0; i < m + 1; i++) { cin >> b[i]; } if (n > m) { if (a[0] * b[0] > 0) cout << Infinity ; else cout << -Infinity ; } else if (n < m) { cout << 0/1 ; } else { if (a[0] * b[0] < 0) { cout << - ; } cout << abs(a[0]) / gcd(abs(a[0]), abs(b[0])) << / << abs(b[0]) / gcd(abs(a[0]), abs(b[0])); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans, i, N, H, alive, last1, last2, last3, a, b, c; long long A[2][32][32][32], B[2][32][32][32]; int main() { cin >> N >> H; A[1][0][0][0] = 4; for (i = 1; i < N; i++) { for (alive = 0; alive < 2; alive++) for (last1 = 0; i - last1 > 0 && last1 < H; last1++) for (last2 = 0; i - last2 > 0 && last2 < H; last2++) for (last3 = 0; i - last3 > 0 && last3 < H; last3++) { if (last1 == 0 || last1 == H - 1) a = 0; else a = last1 + 1; if (last2 == 0 || last2 == H - 1) b = 0; else b = last2 + 1; if (last3 == 0 || last3 == H - 1) c = 0; else c = last3 + 1; B[alive][a][b][c] += A[alive][last1][last2][last3]; B[alive][a][b][c] %= 1000000009; B[last1 > 0 || i < H][alive][b][c] += A[alive][last1][last2][last3]; B[last1 > 0 || i < H][alive][b][c] %= 1000000009; B[last2 > 0 || i < H][a][alive][c] += A[alive][last1][last2][last3]; B[last2 > 0 || i < H][a][alive][c] %= 1000000009; B[last3 > 0 || i < H][a][b][alive] += A[alive][last1][last2][last3]; B[last3 > 0 || i < H][a][b][alive] %= 1000000009; } for (alive = 0; alive < 2; alive++) for (last1 = 0; last1 < H; last1++) for (last2 = 0; last2 < H; last2++) for (last3 = 0; last3 < H; last3++) { A[alive][last1][last2][last3] = B[alive][last1][last2][last3]; B[alive][last1][last2][last3] = 0; } } for (a = 0; a < H; a++) for (b = 0; b < H; b++) for (c = 0; c < H; c++) ans = (ans + A[1][a][b][c]) % 1000000009; for (a = 0; a < H; a++) for (b = 0; b < H; b++) for (c = 0; c < H; c++) if (a > 0 || b > 0 || c > 0) ans = (ans + A[0][a][b][c]) % 1000000009; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 2 * 1e5 + 10; long long t[2][4 * N], a, b; void update(int l, int r, int j, int pos, int val) { if (r < pos || pos < l) return; if (pos <= l && r <= pos) { t[0][j] = min(a, t[0][j] + val); t[1][j] = min(b, t[1][j] + val); return; } int mid = (l + r) >> 1; update(l, mid, 2 * j, pos, val); update(mid + 1, r, 2 * j + 1, pos, val); if (l != r) { t[0][j] = t[0][2 * j] + t[0][2 * j + 1]; t[1][j] = t[1][2 * j] + t[1][2 * j + 1]; } } long long getSum(int l, int r, int j, int x, int y, int wh) { if (r < x || y < l) return 0LL; if (x <= l && r <= y) { return t[wh][j]; } int mid = (l + r) >> 1; long long X = getSum(l, mid, (j << 1), x, y, wh); long long Y = getSum(mid + 1, r, ((j << 1) | 1), x, y, wh); return X + Y; } int n, k, q; int main() { ios_base::sync_with_stdio(0); cin >> n >> k >> a >> b >> q; for (int i = 0; i < q; i++) { int type; cin >> type; if (type == 1) { int di, ai; cin >> di >> ai; update(1, n, 1, di, ai); } else { int p; cin >> p; long long res = getSum(1, n, 1, 1, p - 1, 1); res += getSum(1, n, 1, p + k, n, 0); cout << res << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int a[N], b[N]; bool p[N]; vector<int> P; pair<bool, int> c[N]; int num(string s) { int x = 0; for (int i = 1; i < s.size(); i++) x = x * 10 + (s[i] - 0 ); return x; } int main() { int n, m, t = 0, T = 0; string s; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> s; if (s[0] == + ) { a[num(s)]++; c[i + 1] = {0, num(s)}; } else { b[num(s)]++; t++; c[i + 1] = {1, num(s)}; } } for (int i = 1; i <= n; i++) { if (a[i] + t - b[i] == m) { p[i] = 1; P.push_back(i); T++; } } if (T == 1) { for (int i = 1; i <= n; i++) { if (c[i].first == 0) { if (c[i].second == P[0]) { cout << Truth n ; } else { cout << Lie n ; } } else { if (c[i].second == P[0]) { cout << Lie n ; } else { cout << Truth n ; } } } return 0; } for (int i = 1; i <= n; i++) { if (c[i].first == 0) { if (p[c[i].second]) { cout << Not defined n ; } else { cout << Lie n ; } } else { if (p[c[i].second]) { cout << Not defined n ; } else { cout << Truth n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, w, m; double a[100]; int kol[100]; vector<pair<int, double> > v[100]; int main() { cin >> n >> w >> m; double q = n * w * 1.0 / m; memset(kol, 0, sizeof(kol)); for (int i = 0; i < 100; ++i) a[i] = w; for (int i = 0; i < m; ++i) { double p = q; int z = 0; for (int j = 0; j < n; ++j) { if (a[j] > 1e-9) { double temp = min(p, a[j]); v[i].push_back(make_pair(j + 1, temp)); p -= temp; a[j] -= temp; ++z; ++kol[j]; if (kol[j] > 2) { cout << NO n ; return 0; } if (p < 1e-9) break; } } if (z == 0 || p > 1e-9) { cout << NO n ; return 0; } } cout << YES n ; for (int i = 0; i < m; ++i) { for (int j = 0; j < v[i].size(); ++j) { if (j) cout << ; cout << v[i][j].first << << fixed << setprecision(10) << v[i][j].second; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Antenna { int iniLeft, iniRight; }; int main() { ios::sync_with_stdio(false); cin.tie(0); int nbAntennas, totLen; cin >> nbAntennas >> totLen; vector<Antenna> ants(nbAntennas); for (int iAnt = 0; iAnt < nbAntennas; ++iAnt) { int center, iniScope; cin >> center >> iniScope; ants[iAnt].iniLeft = max(0, center - iniScope); ants[iAnt].iniRight = min(totLen, center + iniScope); } vector<int> minCost(totLen + 1); minCost[totLen] = 0; for (int pos = totLen - 1; pos >= 0; --pos) { minCost[pos] = (totLen - pos); for (int iAnt = 0; iAnt < nbAntennas; ++iAnt) { int left = ants[iAnt].iniLeft, right = ants[iAnt].iniRight; if (left <= pos + 1 && pos + 1 <= right) { minCost[pos] = minCost[pos + 1]; break; } if (pos < left) { int accessCost = (left - pos - 1); int nextPos = min(totLen, right + accessCost); minCost[pos] = min(minCost[pos], accessCost + minCost[nextPos]); } } } cout << minCost[0] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(0); ll n, m, k; cin >> n >> m >> k; vector<ll> vec(m); for (ll &v : vec) cin >> v; ll ans = 0, i = 0; while (i < m) { ll t = (vec[i] - i - 1) / k, j = i + 1; while (j < m && (vec[j] - i - 1) / k == t) j++; ans++, i = j; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int p[2222], n; int D[2222]; int Find(int x) { if (D[x] != 0) return D[x]; if (p[x] == -1) return D[x] = 1; else return D[x] = Find(p[x]) + 1; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); int ans = 0, tmp; for (int i = 1; i <= n; i++) { tmp = Find(i); if (tmp > ans) ans = tmp; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int64_t INF = 4e18, MOD = 998244353; template <int64_t maxn> struct NTT { constexpr static int lg2(int n) { return 32 - __builtin_clz(n - 1); } const static int MAXN = 1 << lg2(maxn), MOD = 998244353, root = 3; int rev[MAXN], rt[MAXN]; int mul(int a, int b) { return (long long)a * b % MOD; } int sub(int a, int b) { return b > a ? a - b + MOD : a - b; } int add(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; } int binExp(int base, long long exp) { if (exp == 0) return 1; return mul(binExp(mul(base, base), exp / 2), exp & 1 ? base : 1); } NTT() { rt[1] = 1; for (int k = 1; k < lg2(MAXN); k++) { int z[] = {1, binExp(root, (MOD - 1) >> (k + 1))}; for (int i = (1 << k); i < 2 << k; i++) rt[i] = mul(rt[i / 2], z[i & 1]); } } void ntt(int *a, int n) { for (int i = 0; i < n; i++) rev[i] = (rev[i / 2] | (i & 1) << lg2(n)) / 2; for (int i = 0; i < n; i++) if (i < rev[i]) swap(a[i], a[rev[i]]); for (int k = 1; k < n; k *= 2) for (int i = 0; i < n; i += 2 * k) for (int j = 0; j < k; j++) { int z = mul(rt[j + k], a[i + j + k]); a[i + j + k] = sub(a[i + j], z); a[i + j] = add(a[i + j], z); } } int in[2][MAXN]; vector<int> multiply(const vector<int> &a, const vector<int> &b) { if (a.empty() || b.empty()) return {}; int sz = a.size() + b.size() - 1, n = 1 << lg2(sz); fill(in[0], in[0] + n, 0), fill(in[1], in[1] + n, 0); copy(a.begin(), a.end(), in[0]), copy(b.begin(), b.end(), in[1]); ntt(in[0], n), ntt(in[1], n); int invN = binExp(n, MOD - 2); for (int i = 0; i < n; i++) in[0][i] = mul(mul(in[0][i], in[1][i]), invN); reverse(in[0] + 1, in[0] + n); ntt(in[0], n); return vector<int>(in[0], in[0] + sz); } }; struct DSU { int64_t n; vector<int64_t> p, sz, cnt; vector<bool> good; vector<vector<int64_t>> g; DSU(int64_t n) : n(n), p(n, -1), sz(n, 1), cnt(n, 0), good(n, 1), g(n) {} int64_t find(int64_t c) { if (p[c] == -1) return c; return p[c] = find(p[c]); } void check(int64_t a) { good.resize(p.size()); good[a] = (cnt[a] == (sz[a] * (sz[a] - 1)) / 2); } void uni(int64_t a, int64_t b) { a = find(a), b = find(b); if (a == b) { cnt[a]++; check(a); return; } p[a] = p[b] = p.size(); p.push_back(-1); sz.push_back(sz[a] + sz[b]); cnt.push_back(cnt[a] + cnt[b] + 1); g.resize(p.size()); g.back() = {a, b}; check(p.size() - 1); } }; void add(int32_t &a, int64_t b) { a = (a + b) % MOD; } int64_t n, k; vector<vector<int64_t>> g; vector<vector<int32_t>> ans; vector<int64_t> sz; vector<bool> good; NTT<2 * 1505> ntt; void dfs(int64_t cur) { for (auto nei : g[cur]) { dfs(nei); } if (g[cur].size()) { int64_t a = g[cur][0], b = g[cur][1]; ans[cur] = ntt.multiply(ans[a], ans[b]); } if (good[cur]) add(ans[cur][1], 1); ans[cur].resize(sz[cur] + 1); } int32_t main() { ios_base::sync_with_stdio(false); cin >> n; vector<vector<int64_t>> mat(n, vector<int64_t>(n)); vector<pair<int64_t, pair<int64_t, int64_t>>> edges; for (int64_t i = 0; i < n; i++) { for (int64_t j = 0; j < n; j++) { cin >> mat[i][j]; if (j < i) edges.push_back({mat[i][j], {j, i}}); } } sort(edges.begin(), edges.end()); DSU dsu(n); for (auto e : edges) { dsu.uni(e.second.first, e.second.second); } g = dsu.g, good = dsu.good, sz = dsu.sz; good.resize(g.size()); int64_t root = dsu.find(0); k = n, n = g.size(); ans.resize(n, vector<int32_t>(k + 1)); dfs(root); for (int64_t i = 1; i < k + 1; i++) cout << ans[root][i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; #define f(i,q,n) for(int i=(int)q;i<n;i++) #define pb push_back #define debug(x) cout<<#x<< <<x<<endl; int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t=1; cin>>t; while(t--){ int n,m; cin>>n>>m; string s; cin>>s; while(m--){ string ans=s; f(i,0,n){ if(i==0 and ans[i]== 0 and ans[i+1]== 1 ){s[i]= 1 ;} else if(i==n-1 and ans[i]== 0 and ans[i-1]== 1 ){s[i]= 1 ;} else{ if(i<n-1 and i>0 and ans[i]== 0 and ans[i+1]!=ans[i-1]){ s[i]= 1 ; } } } if(s==ans){ break; } } cout<<s<<endl; } return 0; } //check constraints, testcases, ll vs int |
#include <bits/stdc++.h> using namespace std; using namespace std; long long a[200005]; struct poi { long long val; int pos; } tp; bool operator<(const poi &a, const poi &b) { return (a.val > b.val) || (a.val == b.val and a.pos > b.pos); } priority_queue<poi> q; int main() { int n; int cnt = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); tp.val = a[i]; tp.pos = i; q.push(tp); } while (!q.empty()) { poi a1 = q.top(); q.pop(); poi b1 = q.top(); q.pop(); while (!q.empty() && a1.val != b1.val) { a1 = b1; b1 = q.top(); q.pop(); } if (a1.val == b1.val and a1.pos != b1.pos) { a[b1.pos] = b1.val * 2; b1.val = b1.val * 2; a[a1.pos] = -1; cnt++; if (q.empty()) break; q.push(b1); } } printf( %d n , n - cnt); for (int i = 0; i < n; i++) { if (a[i] != -1) printf( %lld , a[i]); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; string str; const long long MOD = 1e9 + 7; template <class T> inline void amin(T &x, const T &y) { if (y < x) x = y; } template <class T> inline void amax(T &x, const T &y) { if (x < y) x = y; } int read() { long long s = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { s = s * 10 + c - 0 ; c = getchar(); } return s * f; } long long Pow(long long a, long long b) { if (a == 1 || b == 1) return a; if (b % 2 == 1) return (a * Pow(a, b - 1)) % MOD; return (Pow(a, b / 2) * Pow(a, b / 2)) % MOD; } long long factorial(long long n) { long long ans = 1; while (--n) ans = (ans * (n + 1)) % MOD; return ans; } vector<bool> b(12, 0); bool binod(int k) { bool arr[13][13]; memset(arr, 0, sizeof(arr)); int a = 0; for (int i = 0; i < k; i++) for (int j = 0; j < 12 / k; j++) { arr[i][j] = b[a]; a++; } a = 0; bool d; for (int j = 0; j < 12 / k; j++) { d = 1; for (int i = 0; i < k; i++) { if (!arr[i][j]) d = 0; } if (d) return 1; } return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { for (int i = 0; i < 12; i++) { char sign; cin >> sign; if (sign == X ) b[i] = 1; else b[i] = 0; } vector<int> v; if (binod(1)) v.push_back(1); if (binod(2)) v.push_back(2); if (binod(3)) v.push_back(3); if (binod(4)) v.push_back(4); if (binod(6)) v.push_back(6); if (binod(12)) v.push_back(12); cout << v.size() << ; for (int i = 0; i < v.size(); i++) { cout << v[i] << x << 12 / v[i] << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; string str; int make(int star, int en) { if (en - star >= 7) return -1e7; if (en - star >= 1 && str[star] == 0 ) return -1e7; if (str[star] == 0 && str[en] != 0 ) return -1e7; int sum = 0; for (int i = star; i <= en; i++) { sum = sum * 10 + (str[i] - 0 ); } if (sum > 1e6) return -1e7; return sum; } int main() { int m = -1, i, j, len, a, b, c; cin >> str; len = str.length(); for (i = 0; i < len - 2; i++) { for (j = i + 1; j < len - 1; j++) { a = make(0, i); b = make(i + 1, j); c = make(j + 1, len - 1); m = max(m, a + b + c); } } if (m < 0) printf( -1 ); else printf( %d , m); return 0; } |
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-9; static const double PI = acos(-1.0); char ans[4][110]; int main() { int n; while (scanf( %d , &n) > 0) { if (n == 1) { printf( a na nb nb n ); continue; } ans[0][0] = a ; ans[1][0] = a ; ans[2][0] = b ; ans[3][0] = c ; int ud = 2; char p = b ; for (int i = 1; i < n; i++) { ans[ud][i] = p; ans[ud + 1][i] = p + 1; p += 2; if (p >= x ) { p = a ; } ud ^= 2; if (i == n - 1) { ans[ud][i] = p; ans[ud + 1][i] = p; } else { ans[ud][i] = p; ans[ud + 1][i] = p + 1; } } for (int y = 0; y < (int)(4); y++) { for (int x = 0; x < (int)(n); x++) { putchar(ans[y][x]); } puts( ); } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, a; vector<pair<int, int> > v; cin >> n; for (i = 0; i < n; ++i) { cin >> a; v.push_back(make_pair(a, i + 1)); } for (i = 0; i < n; ++i) { cin >> a; v.push_back(make_pair(a, i + 1)); } long long m; cin >> m; m *= 2; sort(v.begin(), v.end()); long long r = 1; int c = 0, c1 = 0; for (i = 1; i < n + n; ++i) { if (v[i].first == v[i - 1].first) { ++c; if (v[i].second == v[i - 1].second) { ++c1; } else c1 = 0; } else { c1 = c = 0; } r = (r * (c + 1) / (c1 + 1)) % m; c1 = 0; } cout << r % (m / 2); return 0; } int cpp4cf_main() { freopen( B.cpp , r , stdin); char s[99]; bool f; while (true) { cin >> s; if (cin.eof()) break; if (strstr(s, /* )) { cin >> s; if (strstr(s, Test )) { cin >> s; if (strstr(s, on )) { cout << Output: ; cpp4cf_main(); cout << nAnswer: ; f = false; while (true) { cin >> s; if (strstr(s, */ )) break; if (strstr(s, // )) { if (f) cout << endl; else f = true; } else cout << s << ; } cout << n n ; } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; map<long long, long long> mp; long long ans = 0; long long prev = 0; long long sum = 0; for (long long i = 0; i < n; i++) { sum += a[i]; if (sum == 0) prev = max(prev, mp[0] + 1); else if (mp.find(sum) != mp.end()) prev = max(prev, mp[sum] + 1); ans += i + 1 - prev; mp[sum] = i + 1; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const bool debug = 0; struct mout { int i, j; long long first; mout(){}; mout(int i, int j, long long first) : i(i), j(j), first(first) {} }; int main() { if (!debug) { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); } int t; cin >> t; while (t--) { int n; cin >> n; vector<long long> a(n); vector<mout> out; for (int i = 0; i < n; i++) cin >> a[i]; long long s = 0; for (int i = 0; i < n; i++) s += a[i]; if (s != (s / n) * n) { cout << -1 n ; continue; } s /= n; for (int i = 1; i < n; i++) { if (a[i] % (i + 1) != 0) { out.push_back({1, i + 1, i + 1 - a[i] % (i + 1)}); a[1] -= i + 1 - a[i] % (i + 1); a[i] += i + 1 - a[i] % (i + 1); } out.push_back({i + 1, 1, a[i] / (i + 1)}); a[1] += a[i]; a[i] = 0; } for (int i = 1; i < n; i++) { out.push_back({1, i + 1, s}); } cout << out.size() << n ; for (int i = 0; i < out.size(); i++) cout << out[i].i << << out[i].j << << out[i].first << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e14; const long long TE3 = 1005; const long long TE5 = 300005; const string YN[2] = { NO , YES }; using namespace std; long long f(long long n, vector<long long>& q1, vector<long long>& q2) { unordered_map<long long, long long> e; long long c = 0; e[0] = -1; long long i = 0, j = 0; long long ans = 0; while (i < q1.size() || j < q2.size()) { long long g; long long q1t = (i >= q1.size()) ? INF : q1[i]; long long q2t = (j >= q2.size()) ? INF : q2[j]; if (q1t < q2t) { g = q1t; ++c; ++i; } else { g = q2t; --c; ++j; } if (e.find(c) == e.end()) { e[c] = g; } else { q2t = (j >= q2.size()) ? INF : q2[j]; q1t = (i >= q1.size()) ? INF : q1[i]; long long tmp = min(q1t, q2t); long long cur = (tmp == INF ? n : tmp) - e[c] - 1; ans = max(ans, cur); } } return ans; } int main() { ios::sync_with_stdio(false); long long n; cin >> n; long long x; unordered_map<long long, vector<long long> > mpq; for (long long i = (0); i < (n); ++i) { cin >> x; mpq[x].push_back(i); } if (mpq.size() == 1) { cout << 0 << endl; return 0; } unordered_map<long long, long long> rev; long long ma = -INF, mo = 0; for (auto it : mpq) { rev[it.second.size()]++; if (it.second.size() > mo) { ma = it.first; mo = it.second.size(); } } if (rev[mo] >= 2) { cout << n << endl; return 0; } long long ans = 0; for (auto it : mpq) { if (it.first == ma) continue; ans = max(ans, f(n, mpq[ma], it.second)); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long oo = 1e18; struct dta { int u, id; dta(int _u = 0, int _id = 0) { u = _u; id = _id; } }; struct TDij { long long val; int x; TDij(long long _val = 0, int _x = 0) { x = _x; val = _val; } }; inline bool operator<(const TDij &a, const TDij &b) { return (a.val > b.val); } int n, m, k, cost[300010], trace[300010], delneed; bool flag[300010]; long long F[300010]; vector<dta> A[300010]; priority_queue<TDij> Q; void dijks() { memset(flag, true, sizeof(flag)); memset(trace, 0, sizeof(trace)); for (int i = 2; i <= n; ++i) F[i] = oo; F[1] = 0; Q.push(TDij(0, 1)); while (!Q.empty()) { TDij topx = Q.top(); Q.pop(); if (topx.val != F[topx.x]) continue; int u = topx.x; for (int i = 0; i <= A[u].size() - 1; ++i) { if (F[A[u][i].u] > F[u] + cost[A[u][i].id]) { F[A[u][i].u] = F[u] + cost[A[u][i].id]; flag[trace[A[u][i].u]] = true; trace[A[u][i].u] = A[u][i].id; flag[A[u][i].id] = false; Q.push(TDij(F[A[u][i].u], A[u][i].u)); } } } } void dfs(int x, int par, int pared) { for (int i = 0; i <= A[x].size() - 1; ++i) if (A[x][i].u != par && !flag[A[x][i].id]) { dfs(A[x][i].u, x, A[x][i].id); if (delneed == 0) return; } if (delneed > 0) { (--delneed); flag[pared] = true; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> k; for (int i = 1; i <= m; ++i) { int u, v; cin >> u >> v >> cost[i]; A[u].push_back(dta(v, i)); A[v].push_back(dta(u, i)); } dijks(); delneed = m - k; if (!delneed) { for (int i = 1; i <= m; ++i) delneed += (!flag[i]); cout << delneed << n ; for (int i = 1; i <= m; ++i) if (!flag[i]) cout << i << ; return 0; } for (int i = 1; i <= m; ++i) if (flag[i]) { if ((--delneed) == 0) { cout << k << n ; for (int j = 1; j <= i; ++j) if (!flag[j]) cout << j << ; for (int j = i + 1; j <= m; ++j) cout << j << ; return 0; } } dfs(1, 0, 0); cout << k << n ; for (int i = 1; i <= m; ++i) if (!flag[i]) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> solve(int k) { vector<string> s; if (k == 0) { s.push_back( + ); return s; } vector<string> prev = solve(k - 1), rev; for (int i = 0; i < prev.size(); i++) { string temp; for (int j = 0; j < prev.size(); j++) { if (prev[i][j] == + ) temp += * ; else temp += + ; } rev.push_back(temp); } for (int i = 0; i < prev.size(); i++) { s.push_back(prev[i] + prev[i]); s.push_back(prev[i] + rev[i]); } return s; } int main() { int k; cin >> k; vector<string> s; s = solve(k); for (int i = 0; i < s.size(); i++) { cout << s[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0; char c; while ((c = getchar()) < 0 || c > 9 ) ; do { s = s * 10 + c - 0 ; } while ((c = getchar()) >= 0 && c <= 9 ); return s; } const int N = 3010, M = 310; int n, m, rp[M]; double f[M][2][N], tp[N][M]; priority_queue<pair<double, int> > h; double nxdp(int i) { int p = (++rp[i]) & 1; if (rp[i] > n) return -1e9; f[i][p][0] = 0; for (int k = 1; k <= n; k++) f[i][p][k] = tp[k][i] * f[i][p ^ 1][k - 1] + (1 - tp[k][i]) * f[i][p][k - 1]; return f[i][p][n]; } double work() { int i, k; double ans = 0; for (i = 1; i <= m; i++) for (k = 0; k <= n; k++) f[i][0][k] = 1; for (i = 1; i <= m; i++) h.push(make_pair(nxdp(i), i)); for (i = 1; i <= n; i++) { pair<double, int> t = h.top(); h.pop(); ans += t.first; h.push(make_pair(nxdp(t.second), t.second)); } return ans; } int main() { int i, j; n = read(), m = read(); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) tp[i][j] = read() * 0.001; printf( %.11lf n , work()); return 0; } |
#include <bits/stdc++.h> using namespace std; const int siz = 1e5 + 10; const long long modu = 1e9 + 7; int pre[13] = {1, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341}; int main() { int n; scanf( %d , &n); if (n < 13) { cout << pre[n] << endl; return 0; } long long n1 = n; long long ans = pre[12]; ans += (n1 - 12ll) * 49ll; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> mp; int main() { int n, num, flag = 1, f; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &num); ++mp[num]; } map<int, int>::iterator it = mp.begin(); int ln = it->first; int lm = it->second; int l = ln, r = ln; ++it; for (; it != mp.end(); ++it) { if (it->first > r + 1) { flag = 0; break; } else { if (lm == it->second) { lm = 1; r = it->first; } else if (lm > it->second) { lm -= it->second; if (lm > 1) { flag = 0; break; } } else if (lm < it->second) { if (l + 1 != it->first) { lm = it->second - lm + 1; r = it->first; continue; } l = it->first; r = it->first; lm = it->second - lm; } } } if (l + 1 != r) flag = 0; if (flag && lm < 2) { printf( YES ); } else printf( NO ); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.