func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int>> arr; vector<int> t; for (int i = 0; i < n; i++) { int a; cin >> a; t.push_back(a); arr.push_back({a, i}); } sort(arr.begin(), arr.end()); int i, j; for (i = 0; i < arr.size(); i++) { if (arr[i].second != i) break; } for (j = arr.size() - 1; j >= 0; j--) { if (arr[j].second != j) break; } if (i == arr.size() || j < 0) cout << 0 << << 0 << endl; else { vector<int> res; for (int k = 0; k < i; k++) res.push_back(t[k]); for (int k = j; k >= i; k--) res.push_back(t[k]); for (int k = j + 1; k < n; k++) res.push_back(t[k]); bool flag = false; for (int k = 0; k < n - 1; k++) { if (res[k] >= res[k + 1]) { flag = true; break; } } if (!flag) cout << arr[j].second + 1 << << arr[i].second + 1 << endl; else cout << 0 << << 0 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; struct point { long double x, y; }; point a1, a2, a3, a4, b1, b2, b3, b4, c; int l, r, u, d; bool corner(point b) { if (b.x <= r && b.x >= l && b.y <= u && b.y >= d) return true; else return false; } pair<long double, long double> line(point a, point b) { long double m, c; m = ((long double)b.y - a.y) / ((long double)b.x - a.x); c = a.y - m * a.x; return {m, c}; } point foot(pair<long double, long double> line) { point p; p.x = (line.first * (c.y + line.second) + c.x) / (1 + line.first * line.first); p.y = line.first * p.x + line.second; return p; } bool inside(point p, pair<long double, long double> l1, pair<long double, long double> l2) { int k = l1.first / l2.first; if (k == -1) { l1.first *= -1; l1.second *= -1; } if ((p.x * l1.first + l1.second - p.y) * (p.x * l2.first + l2.second - p.y) <= 0) return true; return false; } int main() { ios::sync_with_stdio(0); cin >> a1.x >> a1.y >> a2.x >> a2.y >> a3.x >> a3.y >> a4.x >> a4.y; c.x = (a1.x + a2.x + a3.x + a4.x) / 4; c.y = (a1.y + a2.y + a3.y + a4.y) / 4; l = min(min(a1.x, a2.x), a3.x); r = max(max(a1.x, a2.x), a3.x); d = min(min(a1.y, a2.y), a3.y); u = max(max(a1.y, a2.y), a3.y); cin >> b1.x >> b1.y >> b2.x >> b2.y >> b3.x >> b3.y >> b4.x >> b4.y; int flag = 0; if (corner(b1) || corner(b2) || corner(b3) || corner(b4)) flag = 1; pair<long double, long double> l1, l2, l3, l4; l1 = line(b1, b2); l2 = line(b2, b3); l3 = line(b3, b4); l4 = line(b4, b1); long double d = (r - l) / 2 * sqrt((long double)2); if ((inside(a1, l1, l3) && inside(a1, l2, l4)) || (inside(a2, l1, l3) && inside(a2, l2, l4)) || (inside(a3, l1, l3) && inside(a3, l2, l4)) || (inside(a4, l1, l3) && inside(a4, l2, l4)) || (inside(c, l1, l3) && inside(c, l2, l4))) flag = 1; if (flag) cout << YES << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); srand(time(NULL)); ; int T = 1; cin >> T; while (T--) { int n; cin >> n; cout << setprecision(10) << cos(3.141592653589793238 / (4 * n)) / sin(3.141592653589793238 / (2 * n)); cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; long long int get(long long int x) { long long int y = 1, ans = 0; while (y < x) { y = y * 2; if (y <= x) ans++; else break; } return ans; } int main() { int t = 1; cin >> t; while (t--) { long long int n, m, k, a = 0, b = 0, ans = 1, x = 0, y = 0; cin >> a >> b >> m; if (a == b) { cout << 1 << a << n ; continue; } n = get(b / (a + 1)); long long int arr[51] = {}; long long int rem = b - (1ll << n) * (a + 1); long long int cur = a + 1, sum = a; vector<long long int> sol; sol.push_back(n + 2); sol.push_back(a); for (int i = 0; i < n; i++) { x = (1ll << (n - i - 1)); if (rem >= x) { k = min(m - 1, rem / x); rem -= k * x; cur += k; } sol.push_back(cur); sum += cur; cur = sum + 1; } if (rem >= 0 && rem < m) { sol.push_back(cur + rem); for (auto i : sol) cout << i << ; } else { cout << -1 ; } cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int debug_ = 0; const int maxn = 200000; const long long inf = 998244353; int unum[33], dnum[33]; long long dp[33][2][2][2]; long long dfs(int pos, int u, int e, int d) { if (pos == -1) { return 2 - e; } if (dp[pos][u][e][d] != -1) { return dp[pos][u][e][d]; } long long& ret = dp[pos][u][e][d]; ret = 0; for (int i = 0; i < 3; ++i) { int x = i / 2, y = i % 2; if (x == 1 && u && unum[pos] == 0) { continue; } if (y == 1 && e) { continue; } if (y == 0 && d && dnum[pos] == 1) { continue; } int nu = (u && x == unum[pos]); int ne = (e && y == x); int nd = (d && y == dnum[pos]); ret += dfs(pos - 1, nu, ne, nd); } return ret; } int main() { int tes, u, d; cin >> tes; while (tes--) { cin >> d >> u; for (int i = 0; i < 31; ++i) { dnum[i] = (d >> i) & 1; unum[i] = (u >> i) & 1; } memset(dp, -1, sizeof(dp)); cout << dfs(32, 1, 1, 1) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 205, P = 1e9 + 7ll; struct node { long long x, y; node operator-(const node &t) const { node c; c.x = x - t.x; c.y = y - t.y; return c; } long long operator*(const node &t) const { return x * t.y - y * t.x; } } p[N]; long long n, dp[N][N]; long long search(long long x, long long y) { long long ans = 0; if (dp[x][y] != -1) return dp[x][y]; if (x + 1 == y) return dp[x][y] = 1; for (int i = x + 1; i < y; i++) if ((p[x] - p[i]) * (p[y] - p[i]) > 0) ans = (ans + search(x, i) * search(i, y) % P) % P; return dp[x][y] = ans; } int main() { memset(dp, -1, sizeof dp); scanf( %dll , &n); for (int i = 1; i <= n; i++) scanf( %lld%lld , &p[i].x, &p[i].y); p[n + 1] = p[1]; long long s = 0; for (int i = 1; i <= n; i++) s += p[i + 1] * p[i]; if (s < 0) for (int i = 1, j = n; i < j; swap(p[i++], p[j--])) ; printf( %lld , search(1, n)); return 0; }
#include <bits/stdc++.h> using namespace std; long long quick_pow(long long a, long long b, long long mod) { long long ans = 1, base = a; while (b) { if (b & 1) (ans *= base) %= mod; b >>= 1; (base *= base) %= mod; } return ans; } struct node { int pos, len; bool operator<(const node& k) const { return pos < k.pos; } }; const int N = 1e5 + 5; int X[N], Y[N]; int A[N], B[N]; int main() { int n, m; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d %d , &X[i], &Y[i]); A[i] = X[i]; B[i] = Y[i]; } sort(X + 1, X + n + 1); sort(Y + 1, Y + n + 1); m = (n + 1) >> 1; int mid_x = X[m], mid_y = Y[m]; int dif_x = X[m + 1] - X[m], dif_y = Y[m + 1] - Y[m]; if (n & 1) { dif_x = min(dif_x, X[m] - X[m - 1]); dif_y = min(dif_y, Y[m] - Y[m - 1]); } long long ans = 0; bool F0 = false, F1 = false, Tag = false; for (int i = 1; i <= n; ++i) { ans += abs(X[i] - X[m]) + abs(Y[i] - Y[m]); F0 |= A[i] > mid_x && B[i] > mid_y; F1 |= A[i] > mid_x && B[i] <= mid_y; Tag |= A[i] == mid_x && B[i] == mid_y; } if (F0 && F1 && (~n & 1 || Tag)) ans -= min(dif_x, dif_y); printf( %I64d n , ans << 1); return 0; }
#include <bits/stdc++.h> using namespace std; long long parent[200001]; long long urank[200001]; void create(long long x) { parent[x] = x; urank[x] = 1; } long long find(long long x) { if (parent[x] != x) { parent[x] = find(parent[x]); } return parent[x]; } void merge(long long x, long long y) { long long xroot = find(x); long long yroot = find(y); if (urank[xroot] <= urank[yroot]) { parent[xroot] = yroot; urank[yroot] = urank[yroot] + urank[xroot]; } else { parent[yroot] = xroot; urank[xroot] = urank[xroot] + urank[yroot]; } } int main() { std::ios::sync_with_stdio(false); int T; T = 1; while (T--) { int n, i, j, m; cin >> n >> m; long long ar[n + 1], a, b, c; vector<pair<long long, int> > v; vector<pair<long long, pair<int, int> > > v2; for (i = 1; i <= n; ++i) { create(i); cin >> ar[i]; v.push_back({ar[i], i}); } sort(v.begin(), v.end()); long long ans = 0; for (i = 1; i < n; ++i) { v2.push_back({v[0].first + v[i].first, {v[0].second, v[i].second}}); } while (m--) { cin >> a >> b >> c; v2.push_back({c, {a, b}}); } sort(v2.begin(), v2.end()); for (i = 0; i < v2.size(); ++i) { a = find(v2[i].second.first); b = find(v2[i].second.second); if (a == b) continue; ans = ans + v2[i].first; merge(a, b); } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const long double pi = acos(-1.0); const long long inf = 1e+9; const long long inf64 = inf * inf; #pragma comment(linker, /STACK:36777216 ) template <typename T> istream &operator>>(istream &, vector<T> &); template <typename T> ostream &operator<<(ostream &, const vector<T> &); void solve() { int m; cin >> m; string s; cin >> s; int n = s.size(); vector<int> cnt(26); for (int i = 0; i < n; i++) cnt[s[i] - a ]++; for (char t = a ; t <= z ; t++) { int last = -1; bool fl = 1; int count = 0; for (int i = 0; i < n; i++) { if (s[i] < t) { if (i - last > m) { fl = 0; break; } last = i; } if (s[i] == t) { int pos = -1; int pos2 = -1; for (int j = last + 1; j < n && j < last + 1 + m; j++) { if (s[j] < t) pos = j; if (s[j] == t) pos2 = j; } if (pos > i) { last = pos; i = pos; continue; } if (pos2 != -1) { i = pos2; last = pos2; count++; } else { fl = 0; break; } } if (n - last <= m) break; } if (fl && n - last <= m) { string ans = ; for (char z = a ; z < t; z++) ans += string(cnt[z - a ], z); ans += string(count, t); cout << ans << endl; return; } } } int main() { solve(); return 0; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (int i = 0; i < v.size(); ++i) is >> v[i]; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (int i = 0; i < v.size(); ++i) os << v[i]; return os; }
#include <bits/stdc++.h> using namespace std; int a[11], n; long long dp[11][111], c[111][111]; int main() { memset(c, 0, sizeof(c)); for (int i = (0); i < (111); i++) c[i][0] = 1; for (int i = (1); i < (111); i++) for (int j = (1); j <= (i); j++) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % 1000000007LL; cin >> n; for (int i = (0); i < (10); i++) cin >> a[i]; memset(dp, 0, sizeof(dp)); int len = 0; for (int i = a[1]; i <= n; i++) dp[1][i] = 1; len = a[1]; for (int i = (2); i < (10); i++) { for (int l = len + a[i]; l <= n; l++) { for (int j = a[i]; j <= l - len; j++) { dp[i][l] += dp[i - 1][l - j] * c[l][j] % 1000000007LL; dp[i][l] %= 1000000007LL; } } len += a[i]; } long long ans = 0; for (int l = a[0] + len; l <= n; l++) { if (l == 0) continue; for (int i = a[0]; i <= l - len; i++) { int k = l - i; ans += dp[9][k] * c[l - 1][i] % 1000000007LL; ans %= 1000000007LL; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x7f7f7f7f; int main() { string s; cin >> s; int ans = 0; stack<char> S; for (int i = 0; i < s.length(); i++) { if (S.empty()) { S.push(s[i]); } else if (S.top() == s[i]) { ans++; S.pop(); } else { S.push(s[i]); } } if (ans % 2 == 0) cout << No << endl; else cout << Yes << endl; return 0; }
#include <bits/stdc++.h> long long int x, y, z, i, flag, flag2, top; long long int A[200010]; int main() { scanf( %lld , &x); for (i = 1; i <= x; i++) { scanf( %lld , &A[i]); if (A[i] == 1 && flag == 0) { y = i + 1; flag = 1; } } for (i = y; i <= x; i++) { if (A[i] == 0) z++; } for (i = 1; i <= x; i++) { if (A[i] == 1) { top += z; flag2 = 1; } else if (A[i] == 0 && flag2 == 1) z--; } printf( %lld , top); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005, INF = 1 << 31; struct A { int x, w; } a[MAXN]; int b[MAXN], c[MAXN], n, d[MAXN], f[MAXN]; bool cmp(const A &x, const A &y) { return x.x < y.x; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d%d , &a[i].x, &a[i].w); sort(a, a + n, cmp); memset(f, 0, sizeof f); memset(d, 0x7f, sizeof d); for (int i = 0; i < n; ++i) { b[i] = a[i].x - a[i].w; c[i] = a[i].x + a[i].w; } int ans = 0; for (int i = 0; i < n; ++i) { int t = upper_bound(d + 1, d + ans + 1, b[i]) - d - 1; d[t + 1] = min(c[i], d[t + 1]); if (ans == t) ans = t + 1; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, mod = 1e9 + 7; const long long inf = 1e18; long long tn[20], fv[20]; long long Mul(long long a, long long b, long long md) { long long ans = 0; while (b) { if (b & 1) ans = (ans + a) % md; a = (a + a) % md; b >>= 1; } return ans; } long long Pow(long long a, long long b, long long md) { long long ans = 1; while (b) { if (b & 1) ans = Mul(ans, a, md); a = Mul(a, a, md); b >>= 1; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); tn[0] = fv[0] = 1; for (int i = 1; i < 19; i++) tn[i] = tn[i - 1] * 10, fv[i] = fv[i - 1] * 5; int q; cin >> q; while (q--) { long long x; cin >> x; long long xx = x; int n = 0; while (xx > 0) n++, xx /= 10; long long y = (-tn[17 - n] * x) % (1ll << 17); if (y < 0) y += (1ll << 17); if (y % 5 == 0) y += (1ll << 17); x = tn[17 - n] * x + y; long long ans = 0; if (x % 5 == 2) ans = 1; if (x % 5 == 4) ans = 2; if (x % 5 == 3) ans = 3; for (int i = 2; i <= 17; i++) while (Pow(2, ans, fv[i]) != (x % fv[i])) ans = (ans + 4ll * fv[i - 2]) % (4ll * fv[i - 1]); ans += 4ll * fv[16]; cout << ans << n ; } }
#include <bits/stdc++.h> template <typename T> inline bool MIN(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool MAX(T &a, const T &b) { return a < b ? a = b, 1 : 0; } inline int plu(int a, int b) { return a + b >= 1000000007 ? a + b - 1000000007 : a + b; } inline int sub(int a, int b) { return a - b < 0 ? a - b + 1000000007 : a - b; } inline int mul(int a, int b) { return (long long)a * b % 1000000007; } inline int inc(int &a, int b) { a += b; if (a >= 1000000007) a -= 1000000007; } inline int dec(int &a, int b) { a -= b; if (a < 0) a += 1000000007; } using namespace std; int n, A[200010], m; char s1[200010], s2[200010]; int ok(int L) { int p = 1; for (int i = 1; i <= n; ++i) if (A[i] <= L) { if (s1[i] == s2[p]) ++p; if (p > m) return 1; } return 0; } int main() { scanf( %s%s , s1 + 1, s2 + 1); n = strlen(s1 + 1); m = strlen(s2 + 1); for (int i = 1, a; i <= n; ++i) scanf( %d , &a), A[a] = n - i + 1; int l = 1, r = n + 1; while (l < r) { int mid = l + r >> 1; if (ok(mid)) r = mid; else l = mid + 1; } printf( %d n , n - l); return 0; }
#include <bits/stdc++.h> using namespace std; unsigned int inet4[100010]; int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { char* str; int inet[4]; scanf( %d.%d.%d.%d , &inet[0], &inet[1], &inet[2], &inet[3]); inet4[i] = 0; for (int j = 0; j < 4; j++) inet4[i] = inet4[i] * 256 + inet[j]; } unsigned int mask = 0x80000000; bool flag = false; for (int i = 1; i < 32; i++) { set<int> hh; for (int j = 0; j < n; j++) { hh.insert(inet4[j] & mask); } if (hh.size() == m) { int ans[4]; for (int j = 3; j >= 0; j--) { ans[j] = mask % 256; mask /= 256; } printf( %d.%d.%d.%d n , ans[0], ans[1], ans[2], ans[3]); flag = true; break; } mask = mask | (mask >> 1); } if (!flag) printf( -1 n ); return 0; }
#include <bits/stdc++.h> using namespace std; int a[114514]; int l[114514], r[114514]; bool solve(int n) { int curr = a[1]; l[1] = a[1]; for (int i = 2; i <= n; i++) { if (a[i] < a[i - 1]) curr -= a[i - 1] - a[i]; if (curr < 0) return false; l[i] = curr; } return true; } int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; if (solve(n)) cout << YES << endl; else cout << NO << endl; } }
#include <bits/stdc++.h> using namespace std; int t[95]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> t[i]; } t[0] = 0; int langkah; langkah = 0; for (int i = 1; i <= n; i++) { int a; a = t[i] - t[i - 1]; if (a <= 15) langkah++; else { break; } } if (t[langkah] + 15 >= 90) cout << 90 << endl; else { cout << t[langkah] + 15 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, nn = 0, pp = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); if (x < 0) nn++; else if (x > 0) pp++; } if (nn >= n / 2 + n % 2) printf( -1 ); else if (pp >= n / 2 + n % 2) printf( 1 ); else printf( 0 ); return 0; }
#include <bits/stdc++.h> using namespace std; int N, M, K, R; char arr[102][102]; int best[102][102][1002]; int solve(int r, int c, int p) { if (r < 0) { if (p % K == 0) return p; return -1 << 30; } if (best[r][c][p] != -1) return best[r][c][p]; int ret = -1 << 30; if (c - 1 >= 0) ret = max(ret, solve(r - 1, c - 1, p + (arr[r][c] - 0 ))); if (c + 1 < M) ret = max(ret, solve(r - 1, c + 1, p + (arr[r][c] - 0 ))); return best[r][c][p] = ret; } void solve2(int r, int c, int p) { if (r == 0) { printf( n ); return; } int ret = -1 << 30; if (c - 1 >= 0 && best[r - 1][c - 1][p + (arr[r][c] - 0 )] == R) printf( L ), solve2(r - 1, c - 1, p + (arr[r][c] - 0 )); else if (c + 1 < M && best[r - 1][c + 1][p + (arr[r][c] - 0 )] == R) printf( R ), solve2(r - 1, c + 1, p + (arr[r][c] - 0 )); return; } int main() { scanf( %d %d %d , &N, &M, &K); K++; for (int i = 0; i < N; i++) scanf( %s , arr[i]); int ret = -1 << 30, ind; memset(best, -1, sizeof(best)); for (int i = 0; i < M; i++) { int x = solve(N - 1, i, 0); if (x > ret) ret = x, ind = i; } if (ret == -1 << 30) printf( -1 n ); else printf( %d n , ret); R = ret; if (ret != -1 << 30) { printf( %d n , ind + 1); solve2(N - 1, ind, 0); } }
#include <bits/stdc++.h> using namespace std; const int inf = 1000000000; char ch; bool v[111][111]; struct data { int x1, y1, s1, x2, y2, s2; void sv(int a, int b, int c, int d, int e, int f) { x1 = a; y1 = b; s1 = c; x2 = d; y2 = e; s2 = f; } } p[111][111][260]; int i, j, k, n, m, f[111][111][260], a[111][111], lim, c[111][111], ans, t, q[2000001][2], l, r, x, y, num, ax, ay; inline void update(int tx, int ty) { if (tx < 1 || tx > n || ty < 1 || ty > m) return; if (f[tx][ty][i | a[tx][ty]] > f[x][y][i] + c[x][y]) { f[tx][ty][i | a[tx][ty]] = f[x][y][i] + c[x][y]; p[tx][ty][i | a[tx][ty]].sv(x, y, i, 0, 0, 0); if (!v[tx][ty]) v[tx][ty] = 1, q[++r][0] = tx, q[r][1] = ty; } } void dfs(int x, int y, int s) { if (!x) return; data w = p[x][y][s]; v[x][y] = 1; dfs(w.x1, w.y1, w.s1); dfs(w.x2, w.y2, w.s2); } int main() { scanf( %d%d%d , &n, &m, &num); lim = (1 << num); l = r = 0; memset(v, 0, sizeof(v)); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { scanf( %d , &c[i][j]); a[i][j] = 0; for (k = 0; k < lim; k++) f[i][j][k] = inf; } for (i = 1; i <= num; i++) { scanf( %d%d , &j, &k); a[j][k] = (1 << (i - 1)); q[++r][0] = j; q[r][1] = k; v[j][k] = 1; f[j][k][a[j][k]] = 0; p[j][k][a[j][k]].sv(0, 0, 0, 0, 0, 0); } while (l < r) { x = q[++l][0]; y = q[l][1]; v[x][y] = 0; for (i = 0; i < lim; i++) for (j = 0; j < lim; j++) if (f[x][y][i | j] > f[x][y][i] + f[x][y][j]) { f[x][y][i | j] = f[x][y][i] + f[x][y][j]; p[x][y][i | j].sv(x, y, i, x, y, j); } for (i = 0; i < lim; i++) { if (f[x][y][i] >= inf) continue; update(x - 1, y); update(x + 1, y); update(x, y - 1); update(x, y + 1); } } for (i = 1, ans = inf; i <= n; i++) for (j = 1; j <= m; j++) if (ans > f[i][j][lim - 1] + c[i][j]) ans = f[i][j][lim - 1] + c[i][j], ax = i, ay = j; memset(v, 0, sizeof(v)); dfs(ax, ay, lim - 1); printf( %d n , ans); for (i = 1; i <= n; i++, puts( )) for (j = 1; j <= m; j++) putchar(v[i][j] ? X : . ); return 0; }
#include <bits/stdc++.h> using namespace std; int N, M, i, X, A[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> M; for (i = 0; i < 2 * M; i++) { cin >> X; A[X]++; } if (N == M) { for (i = 1; 1; i++) { if (A[i] != 2) { break; } if (i == N) { cout << ring topology n ; return 0; } } } if (N - 1 == M) { for (i = 1; i <= N; i++) { if (A[i] == N - 1) { cout << star topology n ; return 0; } } for (i = 1; 1; i++) { if (A[i] > 2 || A[i] == 0) { break; } if (i == N) { cout << bus topology n ; return 0; } } } cout << unknown topology n ; }
#include <bits/stdc++.h> using namespace std; int main() { int hour, minute, sleeph, sleepm; char temp; scanf( %d%c%d , &hour, &temp, &minute); scanf( %d%c%d , &sleeph, &temp, &sleepm); int shour, smin; smin = minute - sleepm; if (smin < 0) { smin += 60; hour--; } shour = hour - sleeph; while (shour < 0) { shour += 24; } if (shour < 10) cout << 0 ; cout << shour << : ; if (smin < 10) cout << 0 ; cout << smin << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> x, y, z; inline int sqr(int x) { return x * x; } inline double dist(int i, int j) { return sqrt(sqr(x[i] - x[j]) + sqr(y[i] - y[j]) + sqr(z[i] - z[j])); } int main() { int n; cin >> n; x.resize(n), y.resize(n), z.resize(n); for (int i = 0; i < n; ++i) cin >> x[i] >> y[i] >> z[i]; double shortestTime = 1e9; for (int i = 1; i < n; ++i) { for (int j = i + 1; j < n; ++j) { double d = dist(0, i) + dist(i, j) + dist(j, 0); shortestTime = min(shortestTime, d / 2); } } cout << setprecision(10) << shortestTime << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long modpow(long long b, long long e, long long mod) { long long ans = 1; for (; e; b = b * b % mod, e /= 2) if (e & 1) ans = ans * b % mod; return ans; } const int N = 5050; int dp[N][N][2], c[N], n; bool vis[N][N][2]; int solve(int x, int y, int z) { if (x < 0 || y > n || x > y) return (int)1e9; if (x == 1 && y == n) return 0; if (vis[x][y][z]) return dp[x][y][z]; vis[x][y][z] = true; return dp[x][y][z] = min(solve(x - 1, y, 0) + (c[z ? y : x] == c[x - 1] ? 0 : 1), solve(x, y + 1, 1) + (c[z ? y : x] == c[y + 1] ? 0 : 1)); } int32_t main() { cin >> n; for (int i = 0; i < (n); ++i) cin >> c[i + 1]; int ans = (int)1e9; for (int i = 0; i < (n); ++i) ans = min(ans, solve(i + 1, i + 1, 0)); cout << ans << endl; }
#include<bits/stdc++.h> using namespace std; #define endl n #define ll long long int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll t; cin>>t; while(t--) { ll n; cin>>n; if(n<=3) cout<<n-1<<endl; else { if(n%2==0) cout<<2<<endl; else { cout<<3<<endl; } } } }
#include <bits/stdc++.h> using namespace std; #define rep(i, a) for(int i=0;i<a;i++) #define repA(i,a,b)for(int i=a;i<b;i++) #define l list #define v vector #define u_m unordered_map typedef long long ll; const int mxN=101,MOD=1e9+7; void solve(){ int n,m,count=1,r=0; cin>>n>>m; string s; cin>>s; while(count>0&&r<m){ string cop=s; count=0; rep(i,n){ if(s[i]== 0 ){ int cr=0; if(i-1>=0&&s[i-1]== 1 )cr++; if(i+1<n&&s[i+1]== 1 )cr++; if(cr==1){ cop[i]= 1 ; count++; } } } s=cop; r++; } cout<<s<<endl; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin>>t; while(t--){ solve(); } }
#include <bits/stdc++.h> using namespace std; const long long INF = 1e13; void solve() { long long n; cin >> n; vector<pair<long long, long long> > a(n); for (long long i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; } sort(a.begin(), a.end()); long long cnt = 1, ans = 1, w = 1; for (long long i = 1; i < n; i++) { if (a[i].first == a[i - 1].first) continue; w++; if (a[i].second > a[i - 1].second) cnt++; else { ans = max(ans, cnt); cnt = 1; } } ans = max(ans, cnt); cout << w - ans << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long q; cin >> q; while (q--) solve(); }
#include <bits/stdc++.h> using namespace std; int main() { int tosub = 0; int pls = 1; int mins = 0; string s; char a; cin >> a; while (a != = ) { if (a == + ) { s.push_back(a); pls++; } else if (a == - ) { mins++; s.push_back(a); } cin >> a; } int tmp; cin >> tmp; int mn = pls - mins * tmp; int mx = pls * tmp - mins; if (tmp < mn || tmp > mx) { cout << Impossible n ; return 0; } cout << Possible n ; int curr = 0; for (int i = (-1); i < (int)s.size(); ++i) { if (!(~i) || s[i] == + ) { if (i >= 0) { cout << s[i] << ; } for (int j = 1; j <= tmp; ++j) { int mn = (pls - 1) - mins * tmp; int mx = (pls - 1) * tmp - mins; if (mn <= tmp - (curr + j) && mx >= tmp - (curr + j)) { cout << j << ; pls--; curr += j; break; } } } else { cout << s[i] << ; for (int j = 1; j <= tmp; ++j) { int mn = pls - (mins - 1) * tmp; int mx = pls * tmp - (mins - 1); if (mn <= tmp - (curr - j) && mx >= tmp - (curr - j)) { cout << j << ; mins--; curr -= j; break; } } } } cout << = << tmp << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 100; int head[maxn], cnt; vector<int> pos[maxn]; int len[maxn]; int val[maxn], pre[maxn], vis[maxn]; char str[1100]; char pat[1100]; struct edge { int from, to, flow, next, cost; } e[2 * maxn]; void addedge(int from, int to, int flow, int cost) { e[cnt].from = from; e[cnt].to = to; e[cnt].flow = flow; e[cnt].cost = cost; e[cnt].next = head[from]; head[from] = cnt++; } void line(int from, int to, int flow, int cost) { addedge(from, to, flow, cost); addedge(to, from, 0, -cost); } int dis[maxn]; queue<int> q; int spfa(int s, int t, int st) { while (!q.empty()) q.pop(); memset(vis, 0, sizeof(vis)); memset(pre, 0, sizeof(pre)); for (int i = 0; i <= st; i++) dis[i] = 1; q.push(s); vis[s] = 1, dis[s] = 0; while (!q.empty()) { int now = q.front(); vis[now] = 0; q.pop(); for (int i = head[now]; i != -1; i = e[i].next) { if (!e[i].flow) continue; if (dis[now] + e[i].cost < dis[e[i].to]) { dis[e[i].to] = dis[now] + e[i].cost; pre[e[i].to] = i; if (!vis[e[i].to]) { vis[e[i].to] = 1; q.push(e[i].to); } } } } if (dis[t] >= 0) return 1; int u = t; while (u != s) { int xy = pre[u]; e[xy].flow -= 1; e[xy ^ 1].flow += 1; u = e[xy].from; } return dis[t]; } int MFMC(int s, int t, int ct) { int sum = 0; int a; while ((a = spfa(s, t, ct)) < 0) { sum += a; } return sum; } struct Ac { int next[maxn][26], fail[maxn]; int size; queue<int> q; void insert(char *S, int xi) { int len = strlen(S); int now = 0; for (int i = 0; i < len; i++) { char c = S[i]; if (next[now][c - a ] == 0) { next[now][c - a ] = ++size; now = size; } else { now = next[now][c - a ]; } } pos[now].push_back(xi); } void build() { for (int i = 0; i < 26; i++) { if (next[0][i]) q.push(next[0][i]); } while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i < 26; i++) { if (next[now][i]) { fail[next[now][i]] = next[fail[now]][i]; q.push(next[now][i]); } else next[now][i] = next[fail[now]][i]; } } } void match(char *S) { int le = strlen(S); int now = 0; for (int i = 0; i < le; i++) { int x = S[i] - a ; now = next[now][x]; int temp = now; while (temp) { for (int j = 0; j < pos[temp].size(); j++) { int k = pos[temp][j]; line(i - len[k] + 1, i + 1, 1, -val[k]); } temp = fail[temp]; } } } } ac; int main() { memset(head, -1, sizeof(head)); cnt = 0; int n; scanf( %d , &n); scanf( %s , pat); int m; scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %s %d , str, &val[i]); len[i] = strlen(str); ac.insert(str, i); } int x; scanf( %d , &x); int s = n + 1, t = n + 2; line(s, 0, x, 0); line(n, t, x, 0); for (int i = 0; i < n; i++) { line(i, i + 1, x, 0); } ac.build(); ac.match(pat); int ans = -MFMC(s, t, n + 2); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; inline const int read() { int r = 0, k = 1; char c = getchar(); for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) k = -1; for (; c >= 0 && c <= 9 ; c = getchar()) r = r * 10 + c - 0 ; return k * r; } long long n; int k, a[110]; bool vis[1000010]; long long dp[110][100000]; long long dfs(int pos, long long n) { if (pos == k + 1) return n; if (n <= 0) return 0; if (n < 100000 && dp[pos][n] != -1) return dp[pos][n]; long long ans = dfs(pos + 1, n) - dfs(pos + 1, n / a[pos]); if (n < 100000) dp[pos][n] = ans; return ans; } void input() { memset(dp, -1, sizeof(dp)); cin >> n >> k; for (int i = (1), _ = (k); i <= _; i++) a[i] = read(); sort(a + 1, a + k + 1, greater<int>()); } void solve() { cout << dfs(1, n) << endl; } int main() { input(), solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int k; string s, t; int dp[100005][2], cnt[2]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> s >> t; cin >> k; int n = s.length(); for (int i = 1; i < n; i++) { int l = n - i; string tmp = s.substr(i, l) + s.substr(0, i); if (tmp == t) cnt[0]++; else cnt[1]++; } if (s == t) dp[0][0]++, cnt[0]++; else dp[0][1]++, cnt[1]++; for (int i = 1; i <= k; i++) { dp[i][0] = (dp[i - 1][0] * 1ll * (cnt[0] - 1) + dp[i - 1][1] * 1ll * cnt[0]) % mod; dp[i][1] = (dp[i - 1][0] * 1ll * cnt[1] + dp[i - 1][1] * 1ll * (cnt[1] - 1)) % mod; } printf( %d n , dp[k][0]); }
#include <bits/stdc++.h> using namespace std; long long ar[1000000 + 9]; long long POW1[1000000 + 9]; long long POW2[1000000 + 9]; pair<long long, long long> KEEP[1000000 + 9]; map<pair<long long, long long>, long long> mymap; struct data { long long a, b, val; }; vector<data> vec; long long query(int beg, int end) { if (beg == end) return 0; int mid = (beg + end) >> 1; long long ans, i, val, a, b, len; ans = query(beg, mid) + query(mid + 1, end); vec.clear(); mymap.clear(); for (i = mid; i >= beg; i--) { if (vec.size() && vec[vec.size() - 1].val == ar[i]) { vec.pop_back(); a = 0; b = 0; if (vec.size()) a = vec[vec.size() - 1].a; if (vec.size()) b = vec[vec.size() - 1].b; } else { a = 0; b = 0; if (vec.size()) a = vec[vec.size() - 1].a; if (vec.size()) b = vec[vec.size() - 1].b; len = vec.size() + 1; a += ar[i] * POW1[len]; b += ar[i] * POW2[len]; a %= 1000000007; b %= 1000000007; data curr; curr.a = a; curr.b = b; curr.val = ar[i]; vec.push_back(curr); } val = mymap[make_pair(a, b)]; mymap[make_pair(a, b)] = val + 1; } vec.clear(); for (i = mid + 1; i <= end; i++) { if (vec.size() && vec[vec.size() - 1].val == ar[i]) { vec.pop_back(); a = 0; b = 0; if (vec.size()) a = vec[vec.size() - 1].a; if (vec.size()) b = vec[vec.size() - 1].b; } else { a = 0; b = 0; if (vec.size()) a = vec[vec.size() - 1].a; if (vec.size()) b = vec[vec.size() - 1].b; len = vec.size() + 1; a += ar[i] * POW1[len]; b += ar[i] * POW2[len]; a %= 1000000007; b %= 1000000007; data curr; curr.a = a; curr.b = b; curr.val = ar[i]; vec.push_back(curr); } val = mymap[make_pair(a, b)]; ans += val; } return ans; } int main() { long long i, j, k, l, n, m = 0, tot, temp, curr, val, prev, a, b, c, t, ans, expon, flag, x, y, siz, w, h, d, ii, jj, xx, yy, ind, len, max_n, q, s, f, g; POW1[0] = POW2[0] = 1; for (i = 1; i <= 1000000; i++) POW1[i] = (POW1[i - 1] * 31) % 1000000007; for (i = 1; i <= 1000000; i++) POW2[i] = (POW2[i - 1] * 37) % 1000000007; cin >> q; while (q--) { scanf( %lld , &n); for (i = 1; i <= n; i++) scanf( %lld , &ar[i]); ans = query(1, n); printf( %lld n , ans); } }
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 23, maxm = 30000; int n, K, a[maxn], w[maxn], F[maxn][maxm + 10000]; int main() { scanf( %d%d , &n, &K); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) scanf( %d , &w[i]), w[i] = a[i] - w[i] * K; memset(F, -1, sizeof(F)); F[0][15000] = 0; for (int i = 1; i <= n; i++) { for (int j = 0; j <= maxm; j++) { if (F[i - 1][j] >= 0) F[i][j] = max(F[i][j], F[i - 1][j]); if (F[i - 1][j - w[i]] >= 0) F[i][j] = max(F[i][j], F[i - 1][j - w[i]] + a[i]); } } printf( %d n , (F[n][15000] <= 0) ? (-1) : (F[n][15000])); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const long long INF = (long long)1e17 + 10; int n, m, s, t; int a[N], b[N], l[N]; struct edge { int to, cost; edge(int to, int cost) : to(to), cost(cost) {} }; vector<edge> e; vector<int> g[N]; vector<int> g2[N]; long long diss[N], dist[N]; long long len; bool vis[N], ans[N]; map<int, long long> mp; set<pair<pair<long long, long long>, int> > st; void dijkstra(int sc, vector<int> g[N], long long *dis) { fill(dis + 1, dis + n + 1, INF); priority_queue<pair<long long, int> > pq; pq.push(make_pair(0, sc)); memset(vis, 0, sizeof(vis)); while (!pq.empty()) { pair<long long, int> tmp = pq.top(); pq.pop(); if (vis[tmp.second]) continue; vis[tmp.second] = 1; dis[tmp.second] = -tmp.first; for (auto j : g[tmp.second]) { int u = e[j].to; int c = e[j].cost; if (vis[u]) continue; pair<long long, int> nxt = make_pair(-dis[tmp.second] - c, u); pq.push(nxt); } } } int main() { scanf( %d%d%d%d , &n, &m, &s, &t); for (int i = 0; i < m; ++i) { scanf( %d%d%d , a + i, b + i, l + i); g[a[i]].push_back(e.size()); e.push_back(edge(b[i], l[i])); g2[b[i]].push_back(e.size()); e.push_back(edge(a[i], l[i])); } dijkstra(s, g, diss); dijkstra(t, g2, dist); len = diss[t]; for (int i = 0; i < m; ++i) { if (diss[a[i]] + dist[b[i]] + l[i] == len) { st.insert(make_pair(make_pair(diss[a[i]], diss[b[i]]), i)); ans[i] = 1; } } long long mx = 0; for (auto k : st) { mp[k.second] = mx; mx = max(k.first.second, mx); } for (int i = 0; i < m; ++i) { if (diss[a[i]] + dist[b[i]] + l[i] == len) { st.erase(make_pair(make_pair(diss[a[i]], diss[b[i]]), i)); auto it = st.lower_bound(make_pair(make_pair(diss[a[i]], -1), -1)); if (!(it == st.end() || it->first.first == diss[b[i]])) { ans[i] = 0; } if (mp[i] > diss[a[i]]) { ans[i] = 0; } st.insert(make_pair(make_pair(diss[a[i]], diss[b[i]]), i)); } } for (int i = 0; i < m; ++i) { if (ans[i]) { puts( YES ); } else { long long mn = diss[a[i]] + dist[b[i]]; if (len - 1 > mn) { printf( CAN %d n , l[i] - (len - 1 - mn)); } else { puts( NO ); } } } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const long long INFL = LLONG_MAX; int N, M, X[1000], a, b, c; int main() { ios_base::sync_with_stdio(0); cout.precision(15); cin >> N >> M; for (int(i) = 1; (i) <= (N); (i)++) cin >> X[i]; long double answer = 0; for (int(i) = 1; (i) <= (M); (i)++) { cin >> a >> b >> c; answer = max(answer, (long double)(X[a] + X[b]) / c); } cout << answer << endl; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, l = 1, a; cin >> n; for (int i = 0; i < n; i++) { cin >> a; if (l == 1) { if (a % 2 == 1) { cout << 2 << endl; l = 1; } else { l = 2; cout << 1 << endl; } continue; } if (l == 2) { if (a % 2 == 1) { l = 2; cout << 1 << endl; } else { l = 1; cout << 2 << endl; } } } }
#include <bits/stdc++.h> using namespace std; const int MAXQ = 2e5; vector<int> solve(int K, vector<tuple<uint32_t, uint32_t, int> > V) { uint32_t mask = (((uint32_t)1) << K) - 1; vector<int> HT(1 << K), LT(1 << K); for (auto [l, r, v] : V) if (v) { uint32_t lhi = l >> K, llo = l & mask; uint32_t rhi = r >> K, rlo = r & mask; if (lhi == rhi) { LT[llo]++; if (rlo != ((1 << K) - 1)) LT[rlo + 1]--; } else { LT[llo]++; LT[0]++; if (rlo != ((1 << K) - 1)) LT[rlo + 1]--; } HT[lhi]++; if (rhi != ((1 << K) - 1)) HT[rhi + 1]--; } for (int i = 0; i < (1 << K) - 1; ++i) HT[i + 1] += HT[i]; for (int i = 0; i < (1 << K); ++i) if (HT[i]) HT[i] = 1; for (int i = 0; i < (1 << K) - 1; ++i) LT[i + 1] += LT[i]; for (int i = 0; i < (1 << K); ++i) if (LT[i]) LT[i] = 1; auto ans = LT; copy(HT.begin(), HT.end(), back_inserter(ans)); for (int i = 0; i < (1 << K) - 1; ++i) HT[i + 1] += HT[i]; for (int i = 0; i < (1 << K) - 1; ++i) LT[i + 1] += LT[i]; auto SH = [&](int L, int R) { int ans = HT[R]; if (L) ans -= HT[L - 1]; return ans; }; auto SL = [&](int L, int R) { int ans = LT[R]; if (L) ans -= LT[L - 1]; return ans; }; for (auto [l, r, v] : V) if (!v) { uint32_t lhi = l >> K, llo = l & mask; uint32_t rhi = r >> K, rlo = r & mask; if (lhi == rhi) { if (SH(lhi, lhi) != 0 && SL(llo, rlo) != 0) return {}; } else { if (SH(lhi, lhi) != 0 && SL(llo, (1 << K) - 1) != 0) return {}; if (SH(lhi + 1, rhi - 1) != 0 && SL(0, (1 << K) - 1) != 0) return {}; if (SH(rhi, rhi) != 0 && SL(0, rlo) != 0) return {}; } } return ans; } int K, Q; uint32_t L[MAXQ], R[MAXQ], V[MAXQ]; int main() { scanf( %d%d , &K, &Q); for (int i = 0; i < Q; ++i) { scanf( % SCNu32 % SCNu32 % SCNu32, L + i, R + i, V + i); } vector<vector<int> > ans(16); for (int i = 0; i < 16; ++i) { vector<tuple<uint32_t, uint32_t, int> > P; for (int j = 0; j < Q; ++j) P.emplace_back(L[j], R[j], (V[j] >> i) & 1); ans[i] = solve(K, P); if (ans[i].size() == 0) { puts( impossible ); return 0; } } puts( possible ); for (int i = 0; i < (2 << K); ++i) { int r = 0; for (int j = 0; j < 16; ++j) if (ans[j][i]) r |= 1 << j; printf( %d n , r); } return 0; }
#include <bits/stdc++.h> using namespace std; const int rmax = 15; const int nmax = 100500; struct DP { int x; int y; int z; int i; int j; int k; }; bool operator<(const DP& l, const DP& r) { return l.x < r.x || (l.x == r.x && l.y < r.y) || (l.x == r.x && l.y == r.y && l.z < r.z); } class SparseTable { public: SparseTable(vector<pair<int, int> >& vals) { N = vals.size(); sparse.assign(N, vector<pair<int, int> >(rmax)); init(); build(vals); } void build(vector<pair<int, int> >& vals) { for (int i = 0; i < vals.size(); ++i) { sparse[i][0] = vals[i]; } for (int r = 1; r < rmax; ++r) { for (int i = 0; i < N; ++i) { int t = min(N - 1, i + (1 << (r - 1))); sparse[i][r] = max(sparse[i][r - 1], sparse[t][r - 1]); } } } pair<int, int> getMax(int l, int r) { int len = r - l + 1; int k = deg[len]; return max(sparse[l][k], sparse[l + len - (1 << k)][k]); } void init() { deg.assign(nmax, 0); deg[0] = -1; for (int i = 1; i < nmax; ++i) { deg[i] = deg[i - 1]; if (!(i & (i - 1))) { ++deg[i]; } } } private: vector<vector<pair<int, int> > > sparse; int N = 0; vector<int> deg; }; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> vec(n); vector<pair<int, int> > a; for (int i = 0; i < n; ++i) { cin >> vec[i]; a.push_back({vec[i], i}); } sort((a).begin(), (a).end()); vector<pair<int, int> > vals; vals.push_back({a[0].first, 0}); for (int i = 1; i < n; ++i) { vals.push_back({a[i].first - a[i - 1].first, i}); } SparseTable st(vals); DP ret; ret.x = -1; ret.y = -1; ret.z = -1; ret.i = 0; ret.j = 0; ret.k = 0; for (int i = n - 1; i >= 0; --i) { for (int j = i - 1; j >= 0; --j) { int len_a = n - 1 - i + 1; int len_b = i - 1 - j + 1; if (len_a > 2 * len_b || len_b > 2 * len_a) { continue; } int max_len_c = min({j, 2 * len_a, 2 * len_b}); int min_len_c = max({1, (len_a + 1) / 2, (len_b + 1) / 2}); if (max_len_c < min_len_c) { continue; } pair<int, int> p = st.getMax(j - max_len_c, j - min_len_c); DP temp; temp.x = a[i].first - a[i - 1].first; temp.y = a[j].first - a[j - 1].first; temp.z = p.first; temp.i = i; temp.j = j; temp.k = p.second; if (ret < temp) { ret = temp; } } } vector<int> ans(n); for (int i = 0; i < ret.k; ++i) { ans[a[i].second] = -1; } for (int i = ret.k; i < ret.j; ++i) { ans[a[i].second] = 3; } for (int i = ret.j; i < ret.i; ++i) { ans[a[i].second] = 2; } for (int i = ret.i; i < n; ++i) { ans[a[i].second] = 1; } for (int i = 0; i < n; ++i) { cout << ans[i] << ; } cout << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC target( sse4,avx ) const int inf = 100000; int rec(size_t gl, std::vector<int>& odd, std::vector<bool>& flags, std::vector<std::vector<int>>& graph) { if (gl == odd.size()) { return 0; } if (flags[gl]) { return rec(gl + 1, odd, flags, graph); } int res = 1000000000; for (size_t i = gl + 1; i < odd.size(); i++) { if (!flags[i]) { flags[i] = true; res = std::min(res, graph[odd[gl]][odd[i]] + rec(gl + 1, odd, flags, graph)); flags[i] = false; } } return res; } void run(std::istream& in, std::ostream& out) { int n, m; in >> n >> m; std::vector<std::vector<int>> graph(n, std::vector<int>(n, inf)); for (int i = 0; i < n; i++) graph[i][i] = 0; std::vector<int> degs(n); int64_t sum = 0; for (int i = 0; i < m; i++) { int x, y, w; in >> x >> y >> w; x--; y--; degs[x]++; degs[y]++; sum += w; graph[x][y] = std::min(graph[x][y], w); graph[y][x] = std::min(graph[y][x], w); } for (size_t i = 0; i < n; i++) { for (size_t j = 0; j < n; j++) { for (size_t k = 0; k < n; k++) { if (graph[j][k] > graph[j][i] + graph[i][k]) { graph[j][k] = graph[j][i] + graph[i][k]; } } } } for (size_t i = 0; i < n; i++) { if (graph[0][i] == inf && degs[i] != 0) { out << -1 << std::endl; return; } } std::vector<int> odd; for (size_t i = 0; i < n; i++) { if ((degs[i] % 2) != 0) { odd.push_back(i); } } std::vector<bool> flags(odd.size()); sum += rec(0, odd, flags, graph); out << sum << std::endl; } int main() { std::cin.sync_with_stdio(false); std::cin.tie(nullptr); run(std::cin, std::cout); return 0; }
#include <bits/stdc++.h> using namespace std; void Oli() { int a; cin >> a; vector<pair<int, int>> pr(a); for (int i = 0; i < a; i++) { cin >> pr[i].first >> pr[i].second; } int s = 0; int k = 1; for (int i = 0; i < pr.size(); i++) { if (pr[i].second >= 1) { k--; k += pr[i].second; s += pr[i].first; pr.erase(pr.begin() + i); i--; } } sort(pr.rbegin(), pr.rend()); int i = 0; while (k > 0 && i < pr.size()) { s += pr[i].first; i++; k--; } cout << s << endl; } int main() { int t = 1; while (t--) { Oli(); } return 0; }
#include <bits/stdc++.h> int loya[8]; int tloyal[8]; int level[8]; double pb[1 << 8]; int N, K, A; void init_search(int state, int B, int deepth, int cnt) { if (deepth == N) { pb[state] = cnt > (N >> 1) ? 1.0 : A / (double)(A + B); } else { init_search(state | (1 << deepth), B, deepth + 1, cnt + 1); init_search(state, B + level[deepth], deepth + 1, cnt); } } double calcu(double prb, int state, int deepth) { return (deepth == N) ? prb * pb[state] : calcu(prb * (tloyal[deepth] / 10.0), state | (1 << deepth), deepth + 1) + calcu(prb * (1 - tloyal[deepth] / 10.0), state, deepth + 1); } double search(int candy, int deepth) { double ans = 0.0; if (deepth == N) { ans = calcu(1.0, 0, 0); } else { int i; for (i = 0; i <= candy && loya[deepth] + i <= 10; i++) { tloyal[deepth] = loya[deepth] + i; double tmp = search(candy - i, deepth + 1); ans = tmp > ans ? tmp : ans; } } return ans; } int main() { while (scanf( %d %d %d , &N, &K, &A) == 3) { int i; for (i = 0; i < N; i++) { scanf( %d %d , level + i, loya + i); loya[i] /= 10; } init_search(0, 0, 0, 0); printf( %.10f n , search(K, 0)); } return 0; }
#include <bits/stdc++.h> using namespace std; long long h, n; long long ret = 0LL; int a[60]; long long two(int x) { if (x == 0) return 1LL; long long half = two(x / 2); half *= half; return x % 2 ? half * 2 : half; } void solve() { int c = 0; --n; while (n) { a[c++] = n % 2; n >>= 1; } for (int i = c; i < h; ++i) a[i] = 0; int e = 0; for (int i = h - 1; i >= 0; --i) { if (a[i] != e) { ret += two(i + 1); } if (a[i] == e) { ret += 1; e = !e; } } cout << ret << endl; } int main() { cin >> h >> n; solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, a[101], m, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> k; if (k % 2) a[++m] = k; ans += k; } if (m == 0) { cout << 0 << endl; return 0; } if (m % 2 == 0) { sort(a + 1, a + m + 1); ans -= a[1]; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k; int a[100010]; struct node { int x, id; } p[100010]; int main() { while (scanf( %d%d , &n, &k) != EOF) { for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } int ans = 99999999; int pos = 1; for (int i = 1; i <= n; i++) { bool flag = false; int cnt = 0; for (int j = i; j >= 1; j--) { if (a[i] - (i - j) * k == a[j]) continue; cnt++; if (a[i] - (i - j) * k <= 0) { flag = true; break; } } if (flag) continue; int cnt1 = 0; for (int j = i; j <= n; j++) { if (a[i] + (j - i) * k == a[j]) continue; cnt1++; } if (cnt1 + cnt < ans) { ans = cnt1 + cnt; pos = i; } } printf( %d n , ans); for (int j = 1; j <= pos; j++) { if (a[j] + (pos - j) * k == a[pos]) continue; if (a[j] < a[pos] - (pos - j) * k) { printf( + %d %d n , j, a[pos] - (pos - j) * k - a[j]); } else { printf( - %d %d n , j, a[j] - (a[pos] - (pos - j) * k)); } } for (int j = pos; j <= n; j++) { if (a[pos] + (j - pos) * k == a[j]) continue; if (a[j] < a[pos] + (j - pos) * k) { printf( + %d %d n , j, a[pos] + (j - pos) * k - a[j]); } else { printf( - %d %d n , j, a[j] - (a[pos] + (j - pos) * k)); } } } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> inline void upd_min(T& dest, const T& src) { if (src < dest) dest = src; } template <typename T> inline void upd_max(T& dest, const T& src) { if (dest < src) dest = src; } template <typename T, int n> struct Queue { T q[n]; int qf, qr; Queue() : qf(0), qr(0) {} inline void clear() { qf = qr = 0; } inline bool empty() { return qf == qr; } inline void push(const T& data) { q[qr] = data; if (++qr == n) qr = 0; } inline void pop() { if (++qf == n) qf = 0; } inline T& front() { return q[qf]; } }; template <int maxN> struct Disjoint { int N; int p[maxN]; inline void init(int n) { N = n; for (int i = 0; i < N; ++i) p[i] = i; } inline int root(int i) { for (; i != p[i]; i = p[i]) p[i] = p[p[i]]; return i; } inline void unite(int a, int b) { p[root(b)] = root(a); } inline bool query(int a, int b) { return root(a) == root(b); } }; template <typename T, int N> struct Stack { T s[N]; int index; Stack() : index(0) {} inline void clear() { index = 0; } inline T& top() { return s[index]; } inline void pop() { --index; } inline bool empty() { return index == 0; } inline void push(T data) { s[++index] = data; } }; int nextInt() { int ret; char c; while (c = getchar(), c < 0 || c > 9 ) ; ret = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) ret = ret * 10 + c - 0 ; return ret; } const int inf = 0x7f7f7f7f; int N; char c[255]; int main() { N = nextInt(); for (int t = 1; t <= N; t++) { scanf( %s , c); int ll = strlen(c); int sf(0); for (int i = 0; i < ll; i++) if (c[i] == : ) sf++; if (sf == 2 && ll == 2) { printf( 0000:0000:0000:0000:0000:0000:0000:0000 n ); } else { int ind(1), k(1); for (int i = 1; i < ll; i++) { if (c[i] != : ) ind++; else { if (c[i - 1] == : ) { if (i == 1) sf--; for (int j = 1; j <= 8 - sf; j++) { if (k != 1) printf( : ); printf( 0000 ); k++; } } else { if (k != 1) printf( : ); k++; for (int j = 1; j <= 4 - ind; j++) printf( 0 ); for (int j = 1; j <= ind; j++) printf( %c , c[i - ind - 1 + j]); } ind = 0; } } if (k == 8) { printf( : ); for (int j = 1; j <= 4 - ind; j++) printf( 0 ); for (int j = 1; j <= ind; j++) printf( %c , c[ll - ind - 1 + j]); } printf( n ); } } return 0; }
#include <bits/stdc++.h> using namespace std; const int Max = 2e5 + 10; int n, k; int v, u; vector<int> stl[Max]; struct node { long long cou; long long huo; node() { cou = huo = 0; } } point[Max]; int vis[Max]; long long tot = 0; void dfs(int idex, int cou) { vis[idex] = 1; point[idex].cou = cou; int flag = 0; for (int i = 0; i < stl[idex].size(); i++) { if (vis[stl[idex][i]] == 0) { dfs(stl[idex][i], cou + 1); flag = 1; } } if (!flag) { point[idex].huo = 1; return; } for (int i = 0; i < stl[idex].size(); i++) point[idex].huo += point[stl[idex][i]].huo; point[idex].huo++; } long long ans[Max]; int main() { cin >> n >> k; int flag = 1; for (int i = 1; i <= n - 1; i++) { cin >> v >> u; stl[v].push_back(u); stl[u].push_back(v); } dfs(1, 1); for (int i = 1; i <= n; i++) { ans[i] = point[i].cou - point[i].huo; } sort(ans + 1, ans + n + 1); for (int i = n; i > n - k; i--) { tot += ans[i]; } cout << tot << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, k; string s; int a[4][100]; vector<int> seq; vector<pair<int, int> > poseq; bool check() { for (int i = 0; i < n; i++) { if (a[1][i] != 0 || a[2][i] != 0) { return true; } } return false; } pair<int, int> next(pair<int, int> pos) { if (pos.first == 1) { if (pos.second != 0) { pos.second -= 1; } else { pos.first = 2; } } else { if (pos.second < n - 1) { pos.second += 1; } else { pos.first = 1; } } return pos; } void rotate() { int r, c; for (int i = 0; i < n; i++) { if (a[1][i] == 0) { r = 1; c = i; } if (a[2][i] == 0) { r = 2; c = i; } } pair<int, int> init = make_pair(r, c), prev = init, curr = next(init); while (init != curr) { if (a[curr.first][curr.second] != 0) { a[prev.first][prev.second] = a[curr.first][curr.second]; seq.push_back(a[curr.first][curr.second]); a[curr.first][curr.second] = 0; poseq.push_back(prev); } prev = curr; curr = next(prev); } } void park() { for (int i = 0; i < n; i++) { if (a[1][i] > 0 && a[1][i] == a[0][i]) { seq.push_back(a[1][i]); poseq.push_back(make_pair(0, i)); a[1][i] = 0; } if (a[2][i] > 0 && a[2][i] == a[3][i]) { seq.push_back(a[2][i]); poseq.push_back(make_pair(3, i)); a[2][i] = 0; } } } void run() { cin >> n >> k; for (int i = 0; i < 4; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; } } if (k == 2 * n) { bool allfull = true; for (int i = 0; i < n; i++) { if (a[1][i] == a[0][i] || a[2][i] == a[3][i]) { allfull = false; break; } } if (allfull) { cout << setprecision(30) << -1 << endl; return; ; } } park(); while (check()) { rotate(); park(); } cout << setprecision(30) << seq.size() << endl; ; for (int i = 0; i < (int)seq.size(); i++) { cout << setprecision(30) << seq[i] << ; ; cout << setprecision(30) << poseq[i].first + 1 << ; ; cout << setprecision(30) << poseq[i].second + 1 << endl; ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int tests = 1; for (int i = 1; i <= tests; i++) run(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k, l, r, m; cin >> n >> k; deque<pair<int, int>> bfs; vector<int> lines; vector<int> ans(n); --k; bfs.push_back({0, n}); while (!bfs.empty()) { l = bfs[0].first; r = bfs[0].second; m = (l + r) / 2; bfs.pop_front(); if (k > 0 && r - l > 1) { k -= 2; lines.push_back(m); bfs.push_back({l, m}); bfs.push_back({m, r}); } } if (k != 0) { cout << -1; return 0; } else { int num = 1; lines.push_back(0); lines.push_back(n); sort(lines.begin(), lines.end()); for (int i = lines.size() - 2; i >= 0; --i) { for (int j = lines[i]; j != lines[i + 1]; ++j) { ans[j] = num; ++num; } } } for (int i = 0; i != n; ++i) { cout << ans[i] << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1000010, mod = 1e9 + 7, INF = 0x3f3f3f3f; const double eps = 1e-6; int n, m; int id[N]; vector<int> v[N]; bool st[N]; bool check() { int cnt = 0; for (int i = 1; i <= n; i++) if (!id[i]) { cnt++; id[i] = cnt; int s = 0; if (cnt > 3) return false; for (auto x : v[i]) st[x] = 1, s++; st[i] = 1; for (int j = 1; j <= n; j++) if (!st[j]) { if (id[j]) return false; id[j] = cnt; int sum = 0; for (auto x : v[j]) { if (!st[x]) return false; sum++; } if (sum != s) return false; } for (auto x : v[i]) st[x] = 0; st[i] = 0; } if (cnt < 3) return false; for (int i = 1; i <= n; i++) printf( %d , id[i]); puts( ); return true; } int main() { scanf( %d%d , &n, &m); while (m--) { int a, b; scanf( %d%d , &a, &b); v[a].push_back(b); v[b].push_back(a); } if (!check()) puts( -1 ); return 0; }
#include <bits/stdc++.h> using namespace std; const int Maxn = 1010; const int inf = 1 << 23; int ch[Maxn << 1][3], siz[Maxn << 1], maxs[Maxn << 1], alls, core; bool vis[Maxn << 1]; int n, tot, T; void dfs(int x, int fa) { siz[x] = 1; maxs[x] = 0; for (int i = 0; i < 3; i++) { int y = ch[x][i]; if (y == fa || !y || vis[y]) continue; dfs(y, x); if (maxs[x] < siz[y]) maxs[x] = siz[y]; siz[x] += siz[y]; } if (maxs[x] < alls - siz[x]) maxs[x] = alls - siz[x]; if (maxs[x] < maxs[core] || (maxs[x] == maxs[core] && x > core)) core = x; } void dfs2(int x, int fa) { siz[x] = 1; for (int i = 0; i < 3; i++) { int y = ch[x][i]; if (y == fa || !y || vis[y]) continue; dfs(y, x); siz[x] += siz[y]; } } int getl(int x) { return x <= n ? x : getl(ch[x][1]); } void solve(int x) { vis[x] = true; if (x <= n) { tot++; int fa = ch[x][0]; if (ch[fa][1] == x) ch[fa][1] = tot; else ch[fa][2] = tot; ch[tot][0] = fa; ch[x][0] = tot; ch[tot][1] = x; ch[tot][2] = T; ch[T][0] = tot; return; } int l1 = getl(ch[x][1]), l2 = getl(ch[x][2]); cout << l1 << << l2 << << T << endl; char c; cin >> c; if (c == X ) { if (vis[ch[x][0]] || !ch[x][0]) { tot++; int fa = ch[x][0]; if (fa) { if (ch[fa][1] == x) ch[fa][1] = tot; else ch[fa][2] = tot; } ch[tot][0] = fa; ch[x][0] = tot; ch[tot][1] = x; ch[tot][2] = T; ch[T][0] = tot; return; } dfs2(ch[x][0], x); alls = siz[ch[x][0]]; core = 0; dfs(ch[x][0], x); solve(core); } else if (c == Y ) { if (vis[ch[x][2]]) { tot++; ch[tot][0] = x; ch[tot][1] = ch[x][2]; ch[tot][2] = T; ch[ch[x][2]][0] = tot; ch[x][2] = tot; ch[T][0] = tot; return; } dfs2(ch[x][2], x); alls = siz[ch[x][2]]; core = 0; dfs(ch[x][2], x); solve(core); } else { if (vis[ch[x][1]]) { tot++; ch[tot][0] = x; ch[tot][1] = ch[x][1]; ch[tot][2] = T; ch[ch[x][1]][0] = tot; ch[x][1] = tot; ch[T][0] = tot; return; } dfs2(ch[x][1], x); alls = siz[ch[x][1]]; core = 0; dfs(ch[x][1], x); solve(core); } } int main() { int i, j, k; cin >> n; tot = n; ch[1][0] = ch[2][0] = ++tot; ch[tot][1] = 1; ch[tot][2] = 2; maxs[0] = inf; for (T = 3; T <= n; T++) { memset(vis, false, sizeof(vis)); alls = 2 * T - 3; core = 0; dfs(1, 0); solve(core); } cout << -1 << endl; for (i = 1; i <= tot; i++) { if (!ch[i][0]) cout << -1 ; else cout << ch[i][0] << ; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int to[2000]; char used[2000]; int a[2000]; int s; char res[3000]; int calc(int x, char &f) { f = 0; int cnt = 1; if (x == s) f = 1; while (to[x] != -1) { ++cnt; x = to[x]; if (x == s) { f = 1; cnt = 1; } } return cnt; } int main() { int n, x; cin >> n >> x; --x; s = x; for (int i = 0; i < n; ++i) to[i] = -1; for (int i = 0; i < n; ++i) { cin >> to[i]; --to[i]; if (to[i] >= 0) used[to[i]] = 1; } int sl = -1; int q = 0; for (int i = 0; i < n; ++i) if (!used[i]) { char f; int len = calc(i, f); if (f) sl = len; else a[q++] = len; } assert(sl != -1); res[sl] = 1; for (int i = 0; i < q; ++i) { for (int j = n; j >= 0; --j) if (res[j]) res[j + a[i]] = 1; } for (int i = 0; i <= n; ++i) if (res[i]) cout << i << ; }
#include <bits/stdc++.h> using namespace std; const int SIZE = 1000005; char sa[SIZE], sb[SIZE]; char rab[SIZE * 2], ba[SIZE * 2]; int f1[SIZE * 2]; int f2[SIZE * 2]; int main() { while (gets(sa) && gets(sb)) { int l1 = strlen(sa); int l2 = strlen(sb); if (l1 != l2) { printf( -1 -1 n ); continue; } strcpy(rab, sa); reverse(rab, rab + l1); strcat(rab, # ); strcat(rab, sb); rab[l1] = 0 ; strcpy(ba, sb); strcat(ba, # ); strcat(ba, sa); ba[l1] = 0 ; int n = l1; f1[0] = 0; for (int i = 1; i <= 2 * n; i++) { f1[i] = f1[i - 1]; while (f1[i] > 0 && rab[f1[i]] != rab[i]) f1[i] = f1[f1[i] - 1]; if (rab[f1[i]] == rab[i]) f1[i]++; } f2[0] = 0; for (int i = 1, l = 0, r = 0; i <= 2 * n; i++) { f2[i] = 0; if (i <= r) f2[i] = min(f2[i - l], r - i + 1); while (i + f2[i] <= 2 * n && ba[f2[i]] == ba[i + f2[i]]) f2[i]++; if (i + f2[i] - 1 > r) { l = i; r = i + f2[i] - 1; } } int r1 = -1, r2 = -1; for (int i = 0; i < n - 1; i++) { if (sa[i] != sb[n - i - 1]) break; int len = f1[2 * n - i - 1]; if (f2[n + 1 + i + 1] >= n - i - len - 1) { r1 = i; r2 = n - len; } } printf( %d %d n , r1, r2); } }
#include <bits/stdc++.h> using namespace std; int CeilIndex(int A[], int l, int r, int key) { int m; while (r - l > 1) { m = l + (r - l) / 2; (A[m] <= key ? l : r) = m; } return r; } int LongestIncreasingSubsequenceLength(int A[], int size) { int *tailTable = new int[size]; int len; memset(tailTable, 0, sizeof(tailTable[0]) * size); tailTable[0] = A[0]; len = 1; for (int i = 1; i < size; i++) { if (A[i] < tailTable[0]) tailTable[0] = A[i]; else if (A[i] >= tailTable[len - 1]) tailTable[len++] = A[i]; else tailTable[CeilIndex(tailTable, -1, len - 1, A[i])] = A[i]; } delete[] tailTable; return len; } int main() { int n, a[100009], c[100009]; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); c[i] = 0; } int ans = 0; ans = LongestIncreasingSubsequenceLength(a, n); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; int weight(char c) { if (c == Q || c == q ) return 9; if (c == R || c == r ) return 5; if (c == B || c == b ) return 3; if (c == N || c == n ) return 3; if (c == P || c == p ) return 1; return 0; } int main() { int white = 0, black = 0; string board[8]; for (int i = 0; i < 8; i++) { cin >> board[i]; for (int j = 0; j < 8; j++) { if (board[i][j] >= A && board[i][j] <= Z ) white += weight(board[i][j]); else if (board[i][j] >= a && board[i][j] <= z ) black += weight(board[i][j]); } } if (white > black) cout << White ; else if (white < black) cout << Black ; else cout << Draw ; }
#include <bits/stdc++.h> using namespace std; const int N = 200 * 1000 + 10; struct edge { int u, v, w; edge() {} edge(int u, int v, int w) : u(u), v(v), w(w) {} } e[N]; vector<int> vec[N]; int n, m, root[N], mx[35][N], par[35][N], h[N], ans[N]; bool mst[N], mark[N]; multiset<int> add[N], rem[N]; bool cmp(int i, int j) { return e[i].w < e[j].w; } int dfs(int v) { mark[v] = true; for (int ind : vec[v]) { int u = e[ind].u + e[ind].v - v; if (mst[ind]) { if (!mark[u]) { h[u] = h[v] + 1; par[0][u] = v; mx[0][u] = e[ind].w; ans[ind] = dfs(u); if ((int)add[u].size() > (int)add[v].size()) swap(add[u], add[v]); for (int x : add[u]) add[v].insert(x); } } } for (int x : rem[v]) add[v].erase(add[v].find(x)); if (add[v].empty()) return -1; return *add[v].begin() - 1; } void fill_par() { for (int i = 0; i < n; i++) mark[i] = false; for (int i = 0; i < 31; i++) for (int j = 0; j < n; j++) par[i][j] = -1; dfs(0); for (int i = 1; i < 31; i++) for (int j = 0; j < n; j++) if (par[i - 1][j] != -1) { mx[i][j] = max(mx[i - 1][j], mx[i - 1][par[i - 1][j]]); par[i][j] = par[i - 1][par[i - 1][j]]; } } int get_root(int v) { if (v == root[v]) return v; return root[v] = get_root(root[v]); } pair<int, int> get_lca(int u, int v) { if (h[u] < h[v]) swap(u, v); int mxe = 0; for (int i = 30; i >= 0; i--) if ((h[u] - h[v]) & (1 << i)) { mxe = max(mxe, mx[i][u]); u = par[i][u]; } for (int i = 30; i >= 0; i--) if (par[i][u] != par[i][v]) { mxe = max(mxe, mx[i][v]), mxe = max(mxe, mx[i][u]); u = par[i][u], v = par[i][v]; } if (u != v) { mxe = max(mxe, mx[0][v]), mxe = max(mxe, mx[0][u]); u = par[0][u]; } return {u, mxe}; } void merge(int ind, int ty) { int u = e[ind].u, v = e[ind].v; int pu = get_root(u), pv = get_root(v); if (pu != pv) { mst[ind] = true; root[pu] = pv; } if (pu != pv || !ty) return; ans[ind] = (get_lca(u, v)).second - 1; } void merge() { for (int i = 0; i < n; i++) root[i] = i; vector<int> temp(m); iota(temp.begin(), temp.end(), 0); sort(temp.begin(), temp.end(), cmp); for (int i = 0; i < m; i++) merge(temp[i], 0); fill_par(); for (int i = 0; i < m; i++) if (!mst[i]) { int u = e[i].u, v = e[i].v; int lca = get_lca(u, v).first; add[u].insert(e[i].w); add[v].insert(e[i].w); rem[lca].insert(e[i].w); rem[lca].insert(e[i].w); } fill_par(); for (int i = 0; i < n; i++) root[i] = i; for (int i = 0; i < m; i++) merge(temp[i], 1); } int main() { cin >> n >> m; for (int i = 0; i < m; i++) { int u, v, w; cin >> u >> v >> w; u--, v--; e[i] = edge(u, v, w); vec[u].push_back(i); vec[v].push_back(i); } merge(); for (int i = 0; i < m; i++) cout << ans[i] << n [i == m - 1]; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { double a, b, m, vx, vy, vz; cin >> a >> b >> m >> vx >> vy >> vz; double X = a / 2 - m / vy * vx; double Z = -m / vy * vz; while (X < 0 || X > a) if (X > a) X = 2 * a - X; else X = -X; while (Z < 0 || Z > b) if (Z > b) Z = 2 * b - Z; else Z = -Z; printf( %.9lf %.9lf , X, Z); return 0; }
#include <bits/stdc++.h> using namespace std; char table[500 + 10][500 + 10]; int vis[500 + 10][500 + 10]; int n, m; int dirr[4] = {1, -1, 0, 0}; int dirc[4] = {0, 0, 1, -1}; vector<tuple<int, int, int> > ans; int dfs(int i, int j, int depth) { if (i < 0 || i >= n || j < 0 || j >= m) return 0; if (vis[i][j] || table[i][j] == # ) return 0; vis[i][j] = 1; ans.push_back(make_tuple(0, i + 1, j + 1)); for (int d = 0; d < 4; d++) { dfs(i + dirr[d], j + dirc[d], depth + 1); } if (depth > 0) { ans.push_back(make_tuple(1, i + 1, j + 1)); ans.push_back(make_tuple(2, i + 1, j + 1)); } return 0; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> table[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (table[i][j] == # ) continue; if (vis[i][j] == 0) { dfs(i, j, 0); } } } printf( %d n , ans.size()); int a, b, c; for (tuple<int, int, int> t : ans) { tie(a, b, c) = t; if (a == 0) { printf( B %d %d n , b, c); } else if (a == 1) { printf( D %d %d n , b, c); } else { printf( R %d %d n , b, c); } } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { int b[8]; for (int i = 1; i <= 7; ++i) cin >> b[i]; int first = b[7] - b[6]; int last = b[7] - b[5]; cout << first << << b[7] - (first + last) << << last << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { x = 0; int 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(); } x *= f; } inline void judge() { freopen( in.txt , r , stdin); freopen( out.txt , w , stdout); } const int maxn = 100005; int fac[maxn], facinv[maxn]; const int mod = 1e9 + 7; inline int powmod(int a, int b) { int res = 1; for (; b; b >>= 1) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; } return res; } inline void prprpr() { fac[0] = 1; for (int i = (1); i <= (100000); i++) fac[i] = 1ll * fac[i - 1] * i % mod; for (int i = (0); i <= (100000); i++) facinv[i] = powmod(fac[i], mod - 2); } inline int C(int n, int m) { return 1ll * fac[n] * facinv[m] % mod * facinv[n - m] % mod; } inline int Gans(int x, int n, int *a) { if (n < x) return 0; return a[n - x + 1] * 1ll * powmod(26, n) % mod; } inline void calc(int x, int *&a) { a = (int *)malloc(140005 * sizeof(int)); int inv = powmod(26, mod - 2); int v1 = powmod(inv, x), v2 = 1; for (int i = (x); i <= (100000); i++) { a[i - x + 1] = 1ll * C(i - 1, x - 1) * v2 % mod * v1 % mod; v1 = 1ll * v1 * inv % mod; v2 = 1ll * v2 * (26 - 1) % mod; a[i - x + 1] = (a[i - x + 1] + a[i - x]) % mod; } } char s[maxn]; int nowlen; map<int, int *> zball; int main() { prprpr(); int m; read(m); scanf( %s , s + 1); nowlen = strlen(s + 1); calc(nowlen, zball[nowlen]); for (int i = (1); i <= (m); i++) { int x; read(x); if (x == 2) { int v; read(v); printf( %d n , Gans(nowlen, v, zball[nowlen])); } else { scanf( %s , s + 1); nowlen = strlen(s + 1); if (!zball.count(nowlen)) calc(nowlen, zball[nowlen]); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string arr[11] = { ABSINTH , BEER , BRANDY , CHAMPAGNE , GIN , RUM , SAKE , TEQUILA , VODKA , WHISKEY , WINE }; int n; cin >> n; int counter = 0; string str; int num_convert; for (int i = 0; i < n; i++) { str = ; cin >> str; if (isdigit(str.at(0))) { num_convert = stoi(str, nullptr, 10); if (num_convert < 18) { counter++; } } else { for (int i = 0; i < 11; i++) { if (str == arr[i]) { counter++; } } } } cout << counter; }
#include <bits/stdc++.h> const int LIM = 1e5 + 5; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> x(n), y(n); for (int i = 0; i < n; i++) cin >> x[i] >> y[i]; if (n % 2) { cout << NO ; return 0; } else { int mid = n / 2; for (int i = 0; i < mid - 1; i++) { if (x[i] - x[i + 1] == x[i + mid + 1] - x[i + mid] && y[i] - y[i + 1] == y[i + mid + 1] - y[i + mid]) { continue; } else { cout << NO ; return 0; } } cout << YES ; } return 0; }
#include <bits/stdc++.h> using namespace std; bool isp(const int x) { if (x <= 1) return false; for (int i = 2; i * i <= x; ++i) if (x % i == 0) return false; return true; } int pow(int x, int e, const int MOD) { int r = 1; for (; e; e >>= 1, x = (long long)x * x % MOD) if (e & 1) r = (long long)r * x % MOD; return r; } bool isr(int n, int p) { for (int i = 2, q = p - 1; i * i <= q; ++i) if (q % i == 0) { if (pow(n, i, p) == 1 || pow(n, q / i, p) == 1) return false; } return true; } int main() { int n, x; scanf( %d%d , &n, &x); if (!isp(n + 1)) return puts( -1 ), 0; for (--x; x > 1; --x) if (isr(x, n + 1)) return printf( %d n , x), 0; return puts( -1 ), 0; }
#include <bits/stdc++.h> using namespace std; long long read() { long long 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 << 3) + (x << 1) + (ch ^ 48); ch = getchar(); } return x * f; } long long n, w, b, x, c[1005], cost[1005], f[1005][10005], C, a[10005], tot; long long cmp(long long x, long long y) { return x > y; } signed main() { n = read(); w = read(); b = read(); x = read(); for (long long i = 1; i <= n; i++) c[i] = read(), C += c[i]; for (long long i = 1; i <= n; i++) cost[i] = read(); memset(f, -0x3f, sizeof(f)); f[0][0] = w; for (long long i = 1; i <= n; i++) { if (i != 1) for (long long j = 0; j <= C; j++) f[i][j] = min(f[i - 1][j] + x, w + b * j); else for (long long j = 0; j <= C; j++) f[i][j] = f[i - 1][j]; tot = 0; for (long long k = 1; k <= c[i]; k *= 2) { a[++tot] = k; c[i] -= k; } if (c[i]) a[++tot] = c[i]; sort(a + 1, a + tot + 1, cmp); for (long long k = 1; k <= tot; k++) { for (long long j = C; j >= a[k]; j--) { if (f[i][j - a[k]] >= cost[i] * a[k]) f[i][j] = max(f[i][j], f[i][j - a[k]] - cost[i] * a[k]); } } } long long ans = 0; for (long long i = C; i >= 0; i--) { if (f[n][i] >= 0) { ans = i; break; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void no() { cout << NO << endl; } void yes() { cout << YES << endl; } int main() { int q, n, wyn; cin >> q; for (int i = 0; i < q; i++) { cin >> n; char a; string s; cin >> a; cin >> s; if (s.length() == 1 && a >= s[0]) no(); else { yes(); cout << 2 << endl; cout << a << n << s << endl; } } }
#include <bits/stdc++.h> using namespace std; const int maxn = 10000; int degree[maxn + 5]; int Cn_i(int n, int i) { int up = 1; int down = 1; for (int t = n; t >= n - i + 1; t--) { up = up * t; } for (int t = i; t >= 1; t--) { down = down * t; } return up / down; } int main() { int n; while (scanf( %d , &n) != EOF) { for (int i = 0; i < n; i++) degree[i] = 0; for (int i = 0; i < n - 1; i++) { int a, b; scanf( %d%d , &a, &b); degree[a]++; degree[b]++; } int ans = 0; for (int i = 0; i <= n; i++) { if (degree[i] >= 2) { ans += Cn_i(degree[i], 2); } } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; if (n * m % 2 == 1) cout << n * m / 2 + 1 << endl; else cout << n * m / 2 << endl; } }
#include <bits/stdc++.h> using namespace std; int F[60][60], f[60][60], g[60][60], h[60][60], dp[60][60], fac[60], inv[60], mod = 1000000007; int fpow(int a, int b) { int ans = 1, t = a; while (b) { if (b & 1) ans = 1ll * ans * t % mod; t = 1ll * t * t % mod; b >>= 1; } return ans; } int calc(int n, int m, int a, int b) { int ans = 0; int cur = 1; for (int i = 0; i * a <= n && i * b <= m; i++) { ans = (ans + 1ll * dp[n - i * a][m - i * b] * cur % mod * inv[i]) % mod; cur = 1ll * cur * (g[a][b] + i) % mod; } return ans; } int main() { fac[0] = inv[0] = 1; for (int i = 1; i <= 51; i++) { fac[i] = 1ll * fac[i - 1] * i % mod; inv[i] = fpow(fac[i], mod - 2); } int n, m; scanf( %d%d , &n, &m); f[0][1] = 1; dp[0][0] = 1; for (int i = 1; i <= n; i++) { for (int j = n + 1; j >= 1; j--) { F[i - 1][j] = (F[i - 1][j + 1] + f[i - 1][j]) % mod; } for (int j = n + 1; j >= 1; j--) { h[i][j] = 0; for (int k = 0; k < i; k++) { h[i][j] = (h[i][j] + 1ll * F[k][j] * F[i - k - 1][j]) % mod; } g[i][j] = (h[i][j] - h[i][j + 1] + mod) % mod; } for (int j = 1; j <= n + 1; j++) { for (int x = n; x >= 0; x--) { for (int y = n + 1; y >= 0; y--) { dp[x][y] = calc(x, y, i, j); } } } for (int j = 1; j <= n + 1; j++) { f[i][j] = dp[i][j - 1]; } } printf( %d n , f[n][m]); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; char s[maxn]; int size[maxn], last[200]; bool isover[maxn]; string ans[maxn], now; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> s; int len = strlen(s); bool hasdel = false; now = ; for (int no = len - 1; ~no; no--) { now = s[no] + now; if (now.size() > 1) { if (now[0] != now[1]) last[now[0]] = now[1]; } if (now.size() > 1 && !hasdel) { if (now[0] == now[1] && now[1] > last[now[1]]) { now = now.substr(2); hasdel = true; } } else hasdel = false; size[no] = now.size(); if (now.size() > 10) ans[no] = now.substr(0, 5) + ... + now.substr(now.size() - 2); else ans[no] = now; } for (int i = 0; i < len; i++) { cout << size[i] << << ans[i] << n ; } }
#include <bits/stdc++.h> using namespace std; vector<int> children[1000005]; int r_1[1000005], r_2[1000005], timer, n, k, p[1000005], mx[1000005 << 2], inc[1000005 << 2]; stack<int> seq; vector<int> ans; void dfs(int node) { timer++; r_1[node] = timer; for (int i = 0; i < children[node].size(); i++) { int neb = children[node][i]; dfs(neb); } r_2[node] = timer; } int rt(int r1, int r2, int q1, int q2, int ind, int typ) { if (q1 > q2) return 0; if (q1 > r2 || q2 < r1) return 0; if (q1 <= r1 && q2 >= r2) { inc[ind] += typ; return inc[ind] + mx[ind]; } else { inc[ind * 2] += inc[ind]; inc[ind * 2 + 1] += inc[ind]; inc[ind] = 0; int mid = (r1 + r2) / 2; int left = 0, right = 0; left = rt(r1, mid, q1, q2, ind * 2, typ); right = rt(mid + 1, r2, q1, q2, ind * 2 + 1, typ); mx[ind] = max(mx[ind * 2] + inc[ind * 2], mx[ind * 2 + 1] + inc[ind * 2 + 1]); return max(left, right); } } int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &p[i]); p[n] = n + 1; for (int i = 0; i <= n; i++) { while (seq.size()) { int top = seq.top(); if (p[top] >= p[i]) break; children[i].push_back(top); seq.pop(); } seq.push(i); } dfs(n); for (int i = n - 1; i >= 0; i--) { if (i + k <= n) { ans.push_back(rt(1, timer, r_1[i + k - 1], r_1[i], 1, 0) + 1); rt(1, timer, r_1[i + k - 1] + 1, r_2[i + k - 1], 1, -1); } rt(1, timer, r_1[i] + 1, r_2[i], 1, 1); } reverse(ans.begin(), ans.end()); for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i]); } printf( n ); }
#include <bits/stdc++.h> using namespace std; vector<int> gph[500005]; int n, par[500005], dep[500005], msk[500005]; int dp[500005], sz[500005]; int mx[1 << 22]; int l[23] = {}; void dfs2(int x, vector<pair<int, int> > &v) { v.push_back(pair<int, int>(dep[x], msk[x])); for (auto &i : gph[x]) dfs2(i, v); } void dfs(int x) { if (gph[x].empty()) { mx[msk[x]] = dep[x]; return; } for (int i = 1; i < gph[x].size(); i++) { dfs(gph[x][i]); vector<pair<int, int> > w; dfs2(gph[x][i], w); for (auto &j : w) mx[j.second] = -1; } dfs(gph[x][0]); for (int i = 1; i < gph[x].size(); i++) { vector<pair<int, int> > w; dfs2(gph[x][i], w); for (auto &j : w) { for (int k = 0; k < 23; k++) { int val = mx[j.second ^ l[k]]; if (~val) dp[x] = max(dp[x], j.first + val - 2 * dep[x]); } } for (auto &j : w) mx[j.second] = max(mx[j.second], j.first); } for (int k = 0; k < 23; k++) { if (mx[msk[x] ^ l[k]] != -1) { dp[x] = max(dp[x], mx[msk[x] ^ l[k]] - dep[x]); } } mx[msk[x]] = max(mx[msk[x]], dep[x]); } int main() { scanf( %d , &n); char ch[6]; for (int i = 0; i < 22; i++) l[i] = (1 << i); for (int i = 2; i <= n; i++) { scanf( %d %s , &par[i], ch); gph[par[i]].push_back(i); dep[i] = dep[par[i]] + 1; msk[i] = msk[par[i]] ^ (1 << (*ch - a )); } for (int i = n; i; i--) { sz[i] = 1; for (auto &j : gph[i]) sz[i] += sz[j]; sort(gph[i].begin(), gph[i].end(), [&](const int &a, const int &b) { return sz[a] > sz[b]; }); } memset(mx, -1, sizeof(mx)); dfs(1); for (int i = n; i; i--) { for (auto &j : gph[i]) dp[i] = max(dp[i], dp[j]); } for (int i = 1; i <= n; i++) printf( %d , dp[i]); }
#include <vector> #include <array> #include <stack> #include <queue> #include <list> #include <bitset> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <algorithm> #include <numeric> #include <iostream> #include <iomanip> #include <string> #include <chrono> #include <random> #include <cmath> #include <cassert> #include <climits> #include <cstring> #include <cstdlib> #include <functional> #include <sstream> using namespace std; const long long MOD = 998244353; vector<vector<int>> matXmat(const vector<vector<int>>& A, const vector<vector<int>>& B, long long M = MOD) { int n = A.size(); assert(n != 0); assert(A[0].size() == B.size()); int l = B.size(); assert(l != 0); int m = B[0].size(); assert(m != 0); vector<vector<int>> res(n, vector<int>(m, 0)); long long MOD2 = M * 1LL * M; for (int i = 0; i < n; ++i) { for (int j = 0; j < l; ++j) { for (int k = 0; k < m; ++k) { res[i][k] += A[i][j] * 1LL * B[j][k] % M; if (res[i][k] >= M) { res[i][k] -= M; } if (res[i][k] < 0) { res[i][k] += M; } } } } return res; } vector<long long> __tmpA(500, 0); vector<vector<int>> matXmat2(const vector<vector<int>>& A, const vector<vector<int>>& B, long long M = MOD) { int n = A.size(); assert(n != 0); assert(A[0].size() == B.size()); int l = B.size(); assert(l != 0); int m = B[0].size(); assert(m != 0); vector<vector<int>> res(n, vector<int>(m, 0)); long long MOD2 = M * 1LL * M; for (int i = 0; i < n; ++i) { for (int k = 0; k < m; ++k) { __tmpA[k] = 0; } for (int j = 0; j < l; ++j) { for (int k = 0; k < m; ++k) { __tmpA[k] += A[i][j] * 1LL * B[j][k]; if (__tmpA[k] >= MOD2) { __tmpA[k] -= MOD2; } } } for (int k = 0; k < m; ++k) { if (__tmpA[k] >= MOD) { res[i][k] = __tmpA[k] % MOD; } else { res[i][k] = __tmpA[k]; } } } return res; } vector<int> matXvec(const vector<vector<int>>& A, const vector<int>& B, long long M = MOD) { int n = A.size(); assert(n != 0); int m = A[0].size(); assert(m == B.size()); vector<int> res(n, 0); long long MOD2 = M * 1LL * M; for (int i = 0; i < n; ++i) { long long ans = 0; for (int j = 0; j < m; ++j) { ans += A[i][j] * 1LL * B[j]; if (ans >= MOD2) { ans -= MOD2; } if (ans < 0) { ans += MOD2; } } ans %= M; if (ans < 0) { ans += M; } res[i] = ans; } return res; } vector<vector<int>> matPow(vector<vector<int>> A, long long n, long long M = MOD) { int m = A.size(); assert(m != 0 && A[0].size() == m); vector<vector<int>> res(m, vector<int>(m, 0)); for (int i = 0; i < m; ++i) { res[i][i] = 1; } while (n > 0) { if (n & 1) { res = matXmat2(res, A, M); } A = matXmat2(A, A, M); n >>= 1; } return res; } class Trie{ public: Trie(int n = 110000) : N(n), nodes(n), rt(-1), idx(-1) { rt = newNode(); } void reset() { for (int i = 0; i <= idx; ++i) { nodes[i].reset(); } idx = -1; rt = newNode(); } int root() { return rt; } int index(char ch) { return ch - a ; } void insert(string& s) { int cur = rt; for (auto c : s) { c = index(c); if (nodes[cur].nexts[c] == -1) { nodes[cur].nexts[c] = newNode(); } cur = nodes[cur].nexts[c]; nodes[cur].cnt += 1; } nodes[cur].isEnd = true; } bool query(string& s) { int cur = rt; for (auto c : s) { c = index(c); if (nodes[cur].nexts[c] == -1) { return false; } cur = nodes[cur].nexts[c]; } return nodes[cur].isEnd; } int next(int r, char ch) { ch = index(ch); return nodes[r].nexts[ch]; } bool isEnd(int u) { return nodes[u].isEnd; } private: const static int A = 26; struct Node { Node() : cnt(0), isEnd(false) { fill(begin(nexts), end(nexts), -1); } void reset() { cnt = 0; isEnd = false; fill(begin(nexts), end(nexts), -1); } int nexts[A]; int cnt; bool isEnd; }; int N; int rt; int idx; vector<Node> nodes; int newNode() { return ++idx; } }; class Solution { public: long long solve(vector<string>& S, int m) { int n = S.size(); Trie tr(2000); for (auto s : S) { tr.insert(s); } const int N = 100; vector<vector<vector<pair<int,int>>>> nexts(N, vector<vector<pair<int,int>>>(N)); int rt = tr.root(); vector<pair<int,int>> que; que.emplace_back(rt, rt); vector<vector<bool>> ok(N, vector<bool>(N, false)); ok[rt][rt] = true; vector<vector<bool>> visited(N, vector<bool>(N, false)); visited[rt][rt] = true; for (int i = 0; i < que.size(); ++i) { int u = que[i].first, v = que[i].second; for (int j = a ; j <= z ; ++j) { int nu = tr.next(u, j); int nv = tr.next(v, j); if (nu < 0 || nv < 0) { continue; } if (tr.isEnd(nu) && tr.isEnd(nv)) { nexts[u][v].emplace_back(rt, rt); } if (tr.isEnd(nu)) { nexts[u][v].emplace_back(rt, nv); if (!visited[rt][nv]) { visited[rt][nv] = true; que.emplace_back(rt, nv); } } if (tr.isEnd(nv)) { nexts[u][v].emplace_back(nu, rt); if (!visited[nu][rt]) { visited[nu][rt] = true; que.emplace_back(nu, rt); } } { nexts[u][v].emplace_back(nu, nv); if (!visited[nu][nv]) { visited[nu][nv] = true; que.emplace_back(nu, nv); } } } } while (true) { int chg = 0; for (auto& p : que) { int u = p.first, v = p.second; if (ok[u][v]) { continue; } for (auto& p2 : nexts[u][v]) { int nu = p2.first, nv = p2.second; if (ok[nu][nv]) { ok[u][v] = true; ++chg; break; } } } if (chg == 0) { break; } } map<pair<int,int>,int> indices; for (auto& p : que) { int u = p.first, v = p.second; if (ok[u][v]) { int idx = indices.size(); indices[p] = idx; } } int sz = indices.size(); // cout << sz << sz << endl; vector<vector<int>> mat(sz, vector<int>(sz, 0)); for (auto& p : que) { int u = p.first, v = p.second; if (ok[u][v]) { for (auto& p2 : nexts[u][v]) { int nu = p2.first, nv = p2.second; if (ok[nu][nv]) { // cout << indices[p] << << indices[p2] << << u << << v << endl; mat[indices[p2]][indices[p]] += 1; } } } } auto M = matPow(mat, m); return M[0][0]; } }; int main(int argc, char** argv) { ios::sync_with_stdio(false); cin.tie(0); Solution sol; int n, m; cin >> n >> m; vector<string> S(n); for (int i = 0; i < n; ++i) { cin >> S[i]; } cout << sol.solve(S, m) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int inf = 0x3f3f3f, maxn = 5e5 + 500; long long gcd(long long x, long long y) { if (y == 0) return x; else return gcd(y, x % y); } long long ksm(long long a, long long b) { long long r = 1; while (b) { if (b & 1) r = (r * a) % mod; a = a * a % mod; b >>= 1; } return r; } int n, m, f[maxn][25] = {0}; int query(int l, int r) { int sum = 0; for (int i = 23; i >= 0; i--) { if (f[l][i] < r && f[l][i] != 0) { l = f[l][i]; sum += (1 << i); } } if (f[l][0] < r) return -1; return sum + 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> m; int max1 = 0; for (int i = 1; i <= n; i++) { int l, r; cin >> l >> r; f[l][0] = max(f[l][0], r); max1 = max(r, max1); } for (int l = 0; l <= max1; l++) if (l != 0) f[l][0] = max(f[l][0], max(l, f[l - 1][0])); for (int j = 1; j <= 23; j++) for (int l = 0; l <= max1; l++) f[l][j] = f[f[l][j - 1]][j - 1]; for (int i = 1; i <= m; i++) { int l, r; cin >> l >> r; int ans = query(l, r); cout << ans << endl; } }
/** * Author: N.Nafi1211 || <[email protected]> #~# **/ #include <bits/stdc++.h> using namespace std; clock_t startTime; double getCurrentTime(){ return (double) (clock() - startTime) / CLOCKS_PER_SEC; } #define PB push_back typedef long long ll; typedef vector<char> vc; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<double> vd; void solve() { string a, b; cin >> a >> b; int n = a.length(), m = b.length(); int res = 0; for(int len=1; len<=min(n, m); ++len) { for(int i=0; i+len<=n; ++i) { for(int j=0; j+len<=m; ++j) { if(a.substr(i, len) == b.substr(j, len)) { res = max(res, len); } } } } int ans = n-res + m-res; cout << ans << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); //startTime = clock(); int t; cin >> t; while(t--) solve(); //printf( %.3lf n , getCurrentTime()); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int test; cin >> test; while (test--) { int n; cin >> n; for (int i = 0; i < n; i++) { cout << 8 << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int> > > adj; vector<int> in; vector<int> out; vector<pair<int, int> > visit; pair<int, int> cal(int son) { if (visit[son].first > 0) return visit[son]; if (visit[son].first == -2) return {-1, -1}; visit[son] = {-2, 0}; pair<int, int> temp, ans = {0, 0}; for (int i = 0; i < adj[son].size(); ++i) { temp = cal(adj[son][i].first); if (temp.first == -1) return temp; if (temp.first > ans.first) { ans.first = temp.first; ans.second = max(temp.second, adj[son][i].second); } } ++ans.first; visit[son] = ans; return visit[son]; } int main() { int n, m; cin >> n >> m; adj.resize(n + 1); out.resize(n + 1); in.resize(n + 1); visit.resize(n + 1, {-1, 0}); int num1, num2; for (int i = 0; i < m; ++i) { cin >> num1 >> num2; out[num1]++; in[num2]++; adj[num1].push_back({num2, i}); } int node = 0, cnt = 0; for (int i = 1; i <= n; ++i) { if (in[i] == 0) { node = i; ++cnt; } } if (cnt != 1) { cout << -1 << endl; return 0; } pair<int, int> temp = cal(node); if (temp.second == -1 || temp.first != n) cout << -1 << endl; else cout << temp.second + 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 5; pair<long long, long long> a[maxn]; long long n; long long cnt[maxn][2]; void solve() { cin >> n; for (long long i = 1; i <= n; i++) cnt[i][0] = cnt[i][1] = 0, cin >> a[i].first >> a[i].second; long long ans = n * (n - 1) * (n - 2) / 6; for (long long i = 1; i <= n; i++) { cnt[a[i].first][0]++; cnt[a[i].second][1]++; } for (long long i = 1; i <= n; i++) { ans -= (cnt[a[i].first][0] - 1) * (cnt[a[i].second][1] - 1); } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; using namespace std; const long long int mod = 1e9 + 7; const long long int MAX = LLONG_MAX; const long long int MIN = LLONG_MIN; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n, k; cin >> n >> k; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; map<long long int, long long int> mp; long long int c = 0; deque<long long int> d; for (long long int i = 0; i < n; i++) { if (c < k) { if (mp[a[i]] == 0) { d.push_front(a[i]); mp[a[i]]++; c++; } else { } } else { long long int x = d.back(); if (mp[a[i]] != 0) { } else { mp[x] = mp[x] - 1; d.pop_back(); d.push_front(a[i]); mp[a[i]]++; } } } cout << d.size() << n ; for (auto i = d.begin(); i != d.end(); i++) { cout << *i << ; } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, a[100005]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; long i; for (i = 0; i <= n - 1; i++) cin >> a[i]; sort(a, a + n); long long pc = 1, qc = 1, rc = 1; long long b[3]; long long p = a[0], q = a[1], r = a[2]; if (p == q && q == r) { long long c = 3; for (i = 3; i <= n - 1; i++) if (a[i] == p) c++; cout << c * (c - 1) * (c - 2) / 6; } else if (p == q) { long long pc = 2, rc = 1; for (i = 3; i <= n - 1; i++) if (a[i] == p) pc++; else if (a[i] == r) rc++; cout << pc * (pc - 1) * rc / 2; } else if (q == r) { long long pc = 1, rc = 2; for (i = 3; i <= n - 1; i++) if (a[i] == p) pc++; else if (a[i] == r) rc++; cout << rc * (rc - 1) * pc / 2; } else { long long rc = 1; for (i = 3; i <= n - 1; i++) if (a[i] == r) rc++; cout << rc; } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; signed main() { long long int t; cin >> t; vector<long long int> nums = {6, 10, 14, 15}; long long int minS = nums[0] + nums[1] + nums[2]; long long int maxS = nums[0] + nums[1] + nums[3]; while (t--) { long long int n; cin >> n; if (n <= minS) cout << NO n ; else { long long int d = n - minS; if (d == nums[0] || d == nums[1] || d == nums[2]) { if (n <= maxS) cout << NO n ; else cout << YES n << 6 << << 10 << << 15 << << n - maxS << n ; } else cout << YES n << 6 << << 10 << << 14 << << d << n ; } } return 0; }
#include<cstdio> const int N=100005; int n,a[100005]; inline int ask2(int x){ if(a[x]) return a[x]; printf( ? %d n ,x); fflush(stdout); scanf( %d ,a+x); return a[x]; } inline int ask(int x){ if(ask2(x)>ask2(x+1)) return 1; else return 0; } int main(){ scanf( %d ,&n); a[0]=a[n+1]=1e9; int l=1,r=n; int mid=(l+r)/2; while(r-l>20){ mid=(l+r)/2; if(ask(mid)) l=mid+1; else r=mid; } for(int i=l-1;i<=r+1;i++) ask2(i); for(int i=l;i<=r;i++){ if(a[i]<a[i+1]&&a[i]<a[i-1]){ printf( ! %d n ,i); return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e3, MOD = (1e9) + 7; int n, m, k, A[N + 9][N + 9], row[N + 9], col[N + 9], x, y; char c; void init() { for (int i = 0; i < N + 5; ++i) row[i] = col[i] = i; } int main() { scanf( %d%d%d , &n, &m, &k); init(); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) scanf( %d , &A[i][j]); } for (int i = 0; i < k; ++i) { cin.ignore(); scanf( %c %d %d , &c, &x, &y); switch (c) { case c : swap(col[x], col[y]); break; case r : swap(row[x], row[y]); break; case g : printf( %d n , A[row[x]][col[y]]); } } return 0; }
#include <bits/stdc++.h> using namespace std; void my_dbg() { cout << endl; } template <typename Arg, typename... Args> void my_dbg(Arg A, Args... B) { cout << << A; my_dbg(B...); } using ll = long long; using vi = vector<int>; using vl = vector<ll>; using pii = pair<int, int>; const int inf = INT_MAX; const int ninf = INT_MIN; const int mod = 1e9 + 7; const int maxN = 2e5 + 2; void solve() { int n, m; scanf( %d , &n); scanf( %d , &m); vector<pii> a(m); for (int i = (int)(0); i < (int)(m); i++) { scanf( %d , &a[i].first); scanf( %d , &a[i].second); } sort(a.begin(), a.end(), [&](pii a, pii b) { return a.second < b.second; }); ll sum = 0, ans = 0; multiset<int> ms; for (int i = (int)(0); i < (int)(m); i++) { while ((int)ms.size() and (*ms.begin() < a[i].second or (int) ms.size() >= n)) { sum -= *ms.begin(); ms.erase(ms.begin()); } sum += a[i].first; ll cur = sum; ll rem = n - (int)ms.size() - 1; cur += rem * a[i].second; ans = max(ans, cur); ms.insert(a[i].first); } printf( %lld n , ans); } int main() { int t = 1; scanf( %d , &t); while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; long long int a = 0, b = 0, c = 0; for (int i = 0; i < s.length(); i++) { if (i > 0 && s[i - 1] == v && s[i] == v ) { a++; c += b; } else if (s[i] == o ) { b += a; } } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, x, nr; bool kgood(int N, int K) { int i, ap[10] = {0}; while (N) { ++ap[N % 10]; N /= 10; } for (i = 0; i <= K; ++i) if (!ap[i]) return false; return true; } int main() { int i; scanf( %d%d , &n, &k); for (i = 0; i < n; ++i) { scanf( %d , &x); if (kgood(x, k)) ++nr; } printf( %d n , nr); return 0; }
#include <bits/stdc++.h> using namespace std; long long add(long long a, long long b) { a += b; if (a >= 1000000007) { a -= 1000000007; } return a; } long long sub(long long a, long long b) { a -= b; if (a < 0) { a += 1000000007; } return a; } long long mul(long long a, long long b) { return (a * b) % 1000000007; } void add_self(long long& a, long long b) { a = add(a, b); } void sub_self(long long& a, long long b) { a = sub(a, b); } void mul_self(long long& a, long long b) { a = mul(a, b); } const long long MAXN = 200010; long long get(long long val, long long tot) { long long ans = 0; long long L = val, R = val + 1 - (val % 2); while (R <= tot) { ans += R - L + 1; L = 2 * L; R = 2 * R + 1; } ans += max(0LL, tot - L + 1); return ans; } int main() { long long x, k; cin >> x >> k; long long lo = 0, hi = 1e18, ans = 0; while (lo <= hi) { long long mid = (lo + hi) / 2; if (get(2 * mid + 1, x) >= k) { ans = 2 * mid + 1; lo = mid + 1; } else { hi = mid - 1; } } lo = 0; hi = 1e18; while (lo <= hi) { long long mid = (lo + hi) / 2; if (get(2 * mid, x) >= k) { ans = max(ans, 2 * mid); lo = mid + 1; } else { hi = mid - 1; } } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int flag = 0; if (s.length() < 7) { cout << NO n ; return 0; } for (int i = 0; i <= s.length() - 7; i++) { flag = 0; for (int j = i; j < i + 7; j++) { if (s[i] == s[j]) continue; else { flag = 1; break; } } if (flag == 0) { cout << YES n ; return 0; } } cout << NO n ; return 0; }
#include <bits/stdc++.h> using namespace std; long long d[61]; int ans; int n, a[200005]; void insert() { for (int i = 1; i <= n; i++) { long long x = a[i]; for (int j = 60; j >= 0; j--) if (x & (1LL << j)) { if (d[j] == 0) { d[j] = x; ans++; break; } else x ^= d[j]; } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), a[i] ^= a[i - 1]; if (a[n] == 0) { printf( -1 n ); return 0; } insert(); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; const long long MX = 100; long long A[MX][MX]; long long acum[MX][MX]; long long n, m; long long getAns(long long a, long long b) { long long ans = n * m; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (i + a - 1 < n && j + b - 1 < m) { long long cur = 0; for (long long l = i; l <= i + a - 1; l++) { cur += acum[l][j + b] - acum[l][j]; } ans = min(ans, cur); } } } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { cin >> A[i][j]; } } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { acum[i][j + 1] = acum[i][j] + A[i][j]; } } long long a, b; cin >> a >> b; long long ans = min(getAns(a, b), getAns(b, a)); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; int const nmax = 100; int v[1 + nmax]; map<int, int> dp; int mex(vector<int> v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); for (int i = 0; i < v.size(); i++) if (v[i] != i) return i; return v.size(); } int computedp(int mask) { map<int, int>::iterator it = dp.find(mask); if (it != dp.end()) return it->second; vector<int> v; for (int i = 1; (1 << i) <= mask; i++) { int newmask = ((mask & ((1 << i) - 1)) | (mask >> i)); v.push_back(computedp(newmask)); } dp[mask] = mex(v); return dp[mask]; } map<int, int> frec; void decompose(int number) { for (int i = 2; i * i <= number; i++) { if (number % i == 0) { int p = 0; while (number % i == 0) { number /= i; p++; } frec[i] |= (1 << p); } } if (1 < number) frec[number] |= 2; } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> v[i]; for (int i = 1; i <= n; i++) decompose(v[i]); int result = 0; for (map<int, int>::iterator it = frec.begin(); it != frec.end(); it++) { result ^= computedp(it->second | 1); } if (result == 0) cout << Arpa ; else cout << Mojtaba ; return 0; }
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } long long cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; } int main() { int n, m; cin >> n >> m; char a[n + 1][m + 1]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } long long ans = 0; long long x[n + 1][m + 1]; long long y[n + 1][m + 1]; for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { x[i][j] = 0; y[i][j] = 0; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (a[i][j] == 0 ) { x[i][j] = x[i][j - 1] + 1; y[i][j] = y[i - 1][j] + 1; long long ymin = y[i][j]; long long xmin = x[i][j]; for (int k = j - x[i][j] + 1; k <= j; k++) { ymin = min(ymin, y[i][k]); } for (int k = i - y[i][j] + 1; k <= i; k++) { xmin = min(xmin, x[k][j]); } long long p1 = ymin + x[i][j]; long long p2 = xmin + y[i][j]; long long p = (max(p1, p2)) * 2; ans = max(p, ans); } } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 10101; const int BIT = 30; int N; int arr[MAXN], brr[MAXN]; int real_arr[MAXN]; bool isb[MAXN], risb[MAXN]; vector<pair<int, int> > vans; void action(int a, int b) { arr[b] ^= arr[a]; vans.push_back(make_pair(b + 1, a + 1)); } void aswap(int a, int b) { if (a == b) return; action(a, b); action(b, a); action(a, b); } void fail() { cout << -1 << endl; exit(0); } void calc() { int basis[BIT]; memset((basis), -1, sizeof(basis)); memset((isb), 0, sizeof(isb)); for (int i = 0; i < BIT; i++) { for (int j = 0; j < N; j++) { if (isb[j]) continue; if (arr[j] & (1 << i)) { basis[i] = j; isb[j] = true; break; } } if (basis[i] == -1) continue; for (int j = 0; j < N; j++) { if (j == basis[i]) continue; if (arr[j] & (1 << i)) { action(basis[i], j); } } } bool bused[BIT]; int rbasis[BIT]; memset((bused), 0, sizeof(bused)); memset((risb), 0, sizeof(risb)); for (int i = 0; i < N; i++) { int x = brr[i]; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (x & (1 << j)) { x ^= arr[basis[j]]; if (!bused[j]) { bused[j] = true; if (!risb[i]) { rbasis[j] = i; risb[i] = true; } } } } if (x) fail(); } for (int i = 0; i < N; i++) { if (arr[i]) continue; int x = brr[i]; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (x & (1 << j)) { x ^= arr[basis[j]]; action(basis[j], i); } } } if (0) { cout << B ; for (int i = 0; i < BIT; i++) cout << basis[i] << ; cout << endl; cout << -A ; for (int i = 0; i < N; i++) cout << arr[i] << ; cout << endl; } int mat[BIT], mat2[BIT]; bool oked[BIT]; memset((mat), 0, sizeof(mat)); memset((mat2), 0, sizeof(mat2)); memset((oked), 0, sizeof(oked)); memset((rbasis), -1, sizeof(rbasis)); memset((bused), 0, sizeof(bused)); for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; mat2[i] = 1 << i; rbasis[i] = i; int x = brr[basis[i]]; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (x & (1 << j)) { x ^= arr[basis[j]]; mat[i] ^= 1 << j; } } } if (0) for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; cout << !!(mat[i] & (1 << j)) << ; } cout << endl; } for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; int pv = -1; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (bused[j]) continue; if (mat[j] & 1 << i) { pv = j; bused[j] = true; break; } } if (pv == -1) continue; swap(bused[i], bused[pv]); swap(mat[i], mat[pv]); swap(mat2[i], mat2[pv]); for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (j == i) continue; if (mat[j] & 1 << i) { mat[j] ^= mat[i]; mat2[j] ^= mat2[i]; } } } for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; if (!(mat[i] & 1 << i)) { for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (j == i) continue; if (mat[j] & 1 << i) action(basis[i], basis[j]); } action(basis[i], basis[i]); } } for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; int pv = -1; for (int j = i; j < BIT; j++) { if (basis[j] == -1) continue; if (mat2[j] & 1 << i) { pv = j; break; } } swap(mat2[i], mat2[pv]); aswap(basis[i], basis[pv]); for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (j == i) continue; if (mat2[j] & 1 << i) { mat2[j] ^= mat2[i]; action(basis[i], basis[j]); } } } if (0) for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; cout << !!(mat[i] & (1 << j)) << ; } cout << endl; } return; for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; int pv = -1; int ii = rbasis[i]; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (oked[j]) continue; if (mat[j] & (1 << i)) { pv = j; break; } } if (pv == -1) { continue; } if (0) cout << II << ii << PV << pv << endl; oked[pv] = true; swap(mat2[ii], mat2[pv]); int lb = -1; for (int j = 0; j < BIT; j++) if (basis[j] != -1 && rbasis[j] == pv) lb = j; swap(rbasis[i], rbasis[lb]); if (0) cout << SWAP RB << i << << lb << endl; aswap(basis[ii], basis[pv]); vector<pair<int, int> > vb; int b = basis[pv]; int orig_arr = arr[b]; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (j == i) continue; if (1) { int rj = rbasis[j]; if ((mat2[pv] ^ mat[pv]) & (1 << j)) { mat2[pv] ^= mat2[rj]; arr[basis[pv]] ^= arr[basis[rj]]; vb.push_back(make_pair(basis[pv] + 1, basis[rj] + 1)); } } } if (!(mat2[pv] & (1 << i))) { mat2[pv] ^= 1 << i; arr[b] ^= orig_arr; vans.push_back(make_pair(b + 1, b + 1)); } for (__typeof(vb.begin()) it = vb.begin(); it != vb.end(); it++) vans.push_back(*it); } vector<pair<int, int> > vi; for (int q = 0; q < BIT; q++) { int i = rbasis[q]; if (i == -1 || basis[i] == -1) continue; if (oked[i]) continue; vi.push_back(make_pair(basis[q] + 1, basis[q] + 1)); for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; if (j == q) continue; if ((mat2[i] ^ mat[i]) & (1 << j)) { mat2[i] ^= 1 << j; vi.push_back(make_pair(basis[q] + 1, basis[j] + 1)); cout << VIPB << q << << j << endl; cout << NOW << rbasis[q] << endl; } } } if (0) for (int i = 0; i < BIT; i++) { if (basis[i] == -1) continue; for (int j = 0; j < BIT; j++) { if (basis[j] == -1) continue; cout << !!(mat2[i] & (1 << j)) << ; } cout << endl; } if (0) { cout << A ; for (int i = 0; i < N; i++) cout << arr[i] << ; cout << endl; } } int main() { ios_base::sync_with_stdio(0); cin >> N; for (int i = 0; i < N; i++) cin >> arr[i]; for (int i = 0; i < N; i++) cin >> brr[i]; for (int i = 0; i < N; i++) real_arr[i] = arr[i]; calc(); for (__typeof(vans.begin()) it = vans.begin(); it != vans.end(); it++) { real_arr[it->first - 1] ^= real_arr[it->second - 1]; } if (0) { cout << R ; for (int i = 0; i < N; i++) cout << real_arr[i] << ; cout << endl; } int A = vans.size(); cout << A << n ; for (__typeof(vans.begin()) it = vans.begin(); it != vans.end(); it++) { cout << it->first << << it->second << n ; } cout << flush; for (int i = 0; i < N; i++) assert(real_arr[i] == brr[i]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, a, b, s1, s2; cin >> n >> m >> a >> b; if (n % m == 0) cout << 0 << endl; else { s1 = (n - ((n / m) * m)) * b; s2 = (((n / m) + 1) * m - n) * a; if (s1 > s2) printf( %I64d , s2); else printf( %I64d , s1); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long cnt = 0.5 * n / (k + 1); cout << cnt << << cnt * k << << n - cnt - cnt * k << endl; }
#include <bits/stdc++.h> using namespace std; void solution() { int n, m; cin >> n >> m; int rows[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> rows[i][j]; } } int cols[m][n]; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cin >> cols[i][j]; } } int el = cols[0][0]; for (int i = 0; i < n; i++) { if (find(rows[i], rows[i] + m, el) != rows[i] + m) { int l = find(rows[i], rows[i] + m, el) - rows[i]; int arrangement[n]; for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (cols[0][j] == rows[k][l]) { arrangement[j] = k; break; } } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << rows[arrangement[i]][j] << ; } cout << endl; } return; } } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int count, counter = 0; cin >> count; while (counter++ < count) { solution(); } return 0; }
#include<bits/stdc++.h> using namespace std; #define task sol #define lb lower_bound #define ub upper_bound #define fi first #define se second #define pb push_back #define mp make_pair #define zs(v) ((int)(v).size()) #define BIT(x, i) (((x) >> (i)) & 1) #define CNTBIT __builtin_popcountll #define ALL(v) (v).begin(),(v).end() #define endl n typedef long double ld; typedef long long ll; typedef pair<int, int> pii; const ll base=331; const int dx[8]={0,-1,0,1,1,-1,-1,1}; const int dy[8]={-1,0,1,0,-1,-1,1,1}; int c[55][55]; int mod; ll dp[55][55*55]; ll fact[55]; int f[4005]; int n; void gogo() { cin>>n>>mod; dp[0][0]=1; for (int i=1;i<=n;++i) { for (int num=0;num<=n*n;++num) { for (int k=1;k<=i;++k) if (num+i-k<=n*n) (dp[i][num+i-k]+=dp[i-1][num])%=mod; } } for (int i=0;i<=n;++i) { c[i][0]=1; for (int j=1;j<=i;++j) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod; } fact[0]=1; for (int i=1;i<=n;++i) fact[i]=fact[i-1]*i%mod; int ans=0; for (int i=0;i<n;++i) { ll val=c[n][i]*fact[i]%mod; int len=n-i-1; int m=len*(len-1)/2; for (int i=0;i<=m;++i) f[i]=0; for (int inv1=0;inv1<=m;++inv1) { for (int inv2=0;inv2<=inv1;++inv2) { (f[inv1-inv2]+=dp[len][inv1]*dp[len][inv2]%mod)%=mod; } } for (int i=1;i<=m;++i) (f[i]+=f[i-1])%=mod; int value=0; for (int x=1;x<=len+1;++x) { for (int y=x+1;y<=len+1;++y) { assert(y-x>=0); if (m>y-x) (value+=(f[m]-f[y-x]+mod)%mod)%=mod; } } // cout<<value<<endl; ans=(ans+val*value%mod)%mod; } cout<<ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); if (fopen(task .inp , r )) { freopen(task .inp , r , stdin); freopen(task .out , w , stdout); } gogo(); }
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k, x = 0; cin >> n >> m >> k; if (n + m - 2 < k) { cout << -1; return 0; } if (m > n) swap(m, n); if (k < m) x = n * (m / (k + 1)); if (k < n) x = max(x, m * (n / (k + 1))); if (k >= n) x = m / (k - n + 2); cout << x; return 0; }
#include <bits/stdc++.h> using namespace std; using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } long long int gcd(long long int a, long long int b) { if (a < b) return gcd(b, a); else if (b == 0) return a; else return gcd(b, a % b); } long long int isPrime(long long int n) { long long int p = (long long int)sqrt(n); for (int i = (2); i <= (p); i += (1)) if (n % i == 0) return 0; return 1; } long long int pow(long long int b, long long int e) { if (e == 0) return 1; else if (e % 2 == 0) { long long int a = pow(b, e / 2); return a * a; } else { long long int a = pow(b, e / 2); return b * a * a; } } long long int powm(long long int x, long long int y, long long int m = 1000000007) { x = x % m; long long int res = 1; while (y) { if (y & 1) res = res * x; res %= m; y = y >> 1; x = x * x; x %= m; } return res; } long long int modInverse(long long int a, long long int m) { return powm(a, m - 2, m); } void solve() { long long int n; cin >> n; vector<long long int> arr(n); for (int i = (0); i <= (n - 1); i += (1)) cin >> arr[i]; if (n == 1) { cout << 1 1 << n << (-arr[0]) << n << 1 1 << n0 << n << 1 1 n << 0 << n ; return; } vector<vector<long long int>> ans; ans.push_back({1, 1, -arr[0]}); arr[0] = 0; vector<long long int> temp; temp.push_back(2); temp.push_back(n); for (int i = (1); i <= (n - 1); i += (1)) { long long int x = arr[i] % n; arr[i] += x * (n - 1); temp.push_back(x * (n - 1)); } ans.push_back(temp); temp.clear(); temp.push_back(1); temp.push_back(n); for (int i = (0); i <= (n - 1); i += (1)) { temp.push_back(-arr[i]); } ans.push_back(temp); for (int i = (0); i <= (2); i += (1)) { cout << ans[i][0] << << ans[i][1] << n ; for (int j = (2); j <= ((int)ans[i].size() - 1); j += (1)) cout << ans[i][j] << ; cout << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int T = 1; while (T--) { solve(); } return 0; }
#include <iostream> #include <cstdio> #include <algorithm> #include <bits/stdc++.h> #define ALL(x) (x).begin(), (x).end() #define sz(a) int(a.size()) #define rep(i,x,n) for(int i=x;i<n;i++) #define repd(i,x,n) for(int i=x;i<=n;i++) #define pii pair<int,int> #define pll pair<long long ,long long> #define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0) #define MS0(X) memset((X), 0, sizeof((X))) #define MSC0(X) memset((X), 0 , sizeof((X))) #define pb push_back #define mp make_pair #define fi first #define se second #define eps 1e-6 #define chu(x) if(DEBUG_Switch) cout<< [ <<#x<< <<(x)<< ] <<endl #define du3(a,b,c) scanf( %d %d %d ,&(a),&(b),&(c)) #define du2(a,b) scanf( %d %d ,&(a),&(b)) #define du1(a) scanf( %d ,&(a)); using namespace std; typedef long long ll; ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;} ll lcm(ll a, ll b) {return a / gcd(a, b) * b;} ll powmod(ll a, ll b, ll MOD) { if (a == 0ll) {return 0ll;} a %= MOD; ll ans = 1; while (b) {if (b & 1) {ans = ans * a % MOD;} a = a * a % MOD; b >>= 1;} return ans;} ll poww(ll a, ll b) { if (a == 0ll) {return 0ll;} ll ans = 1; while (b) {if (b & 1) {ans = ans * a ;} a = a * a ; b >>= 1;} return ans;} void Pv(const vector<int> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf( %d , V[i] ); if (i != Len - 1) {printf( );} else {printf( n );}}} void Pvl(const vector<ll> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf( %lld , V[i] ); if (i != Len - 1) {printf( );} else {printf( n );}}} inline long long readll() {long long tmp = 0, fh = 1; char c = getchar(); while (c < 0 || c > 9 ) {if (c == - ) { fh = -1; } c = getchar();} while (c >= 0 && c <= 9 ) { tmp = tmp * 10 + c - 48, c = getchar(); } return tmp * fh;} inline int readint() {int tmp = 0, fh = 1; char c = getchar(); while (c < 0 || c > 9 ) {if (c == - ) { fh = -1; } c = getchar();} while (c >= 0 && c <= 9 ) { tmp = tmp * 10 + c - 48, c = getchar(); } return tmp * fh;} void pvarr_int(int *arr, int n, int strat = 1) {if (strat == 0) {n--;} repd(i, strat, n) {printf( %d%c , arr[i], i == n ? n : );}} void pvarr_LL(ll *arr, int n, int strat = 1) {if (strat == 0) {n--;} repd(i, strat, n) {printf( %lld%c , arr[i], i == n ? n : );}} const int maxn = 1000010; const int inf = 0x3f3f3f3f; /*** TEMPLATE CODE * * STARTS HERE ***/ #define DEBUG_Switch 0 pll a[5]; int b[5]; int main() { #if DEBUG_Switch freopen( D: code input.txt , r , stdin); #endif //freopen( D: code output.txt , w ,stdout); int t; t = readint(); while (t--) { repd(i, 1, 4) { a[i].fi = readint(); a[i].se = readint(); b[i] = i; } ll ans = 1e18; do { ll x1 = min(a[b[1]].fi, a[b[3]].fi), x2 = max(a[b[1]].fi, a[b[3]].fi), x3 = min(a[b[2]].fi, a[b[4]].fi), x4 = max(a[b[2]].fi, a[b[4]].fi); ll y1 = min(a[b[1]].se, a[b[2]].se), y2 = max(a[b[1]].se, a[b[2]].se), y3 = min(a[b[3]].se, a[b[4]].se), y4 = max(a[b[3]].se, a[b[4]].se); ll x_l, x_r, y_l, y_r; ll cost_x, cost_y; if (x4 < x1) { x_l = x_r = 0; cost_x = x2 - x3 + x1 - x4; } else { x_l = max(x3 - x2, 0ll); x_r = x4 - x1; cost_x = x2 - x1 + x4 - x3; } if (y4 < y1) { y_l = y_r = 0; cost_y = y2 - y3 + y1 - y4; } else { y_l = max(y3 - y2, 0ll); y_r = y4 - y1; cost_y = y2 - y1 + y4 - y3; } ll temp = cost_x + cost_y; if (y_l > x_r) { temp += 2ll * (y_l - x_r); } else if (x_l > y_r) { temp += 2ll * (x_l - y_r); } ans = min(ans, temp); } while (next_permutation(b + 1, b + 1 + 4)); printf( %lld n , ans ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int T, l, r; cin >> T; for (int i = 1; i <= T; i++) { cin >> l >> r; cout << l << << 2 * l << endl; } }