func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * f; } namespace Sa { struct Node { double x, y; Node() {} Node(double x, double y) : x(x), y(y) {} Node operator-(Node a) const { return Node(x - a.x, y - a.y); } double operator*(Node a) const { return x * a.y - y * a.x; } } a[1], b[1]; double l, r, Mid, Ans, Now, x, y, Ax, T, N2; int i, j, k, n, m; inline double Getrand() { return rand() % 1000 / 1000.0; } inline double Gety(double x) { for (int i = 1; i < n; i++) if (a[i + 1].x > x) return (a[i + 1].y - a[i].y) / (a[i + 1].x - a[i].x) * (x - a[i].x) + a[i].y; } inline bool Check(Node A) { for (int i = 1; i < n; i++) if ((A - a[i]) * (A - a[i + 1]) < 0) return 0; return 1; } inline double Calc(double x) { double l = 0, r = 0, Mid; while (r - l > 1) { Mid = (l + r) / 2.0; if (Check(Node(x, Mid))) r = Mid; else l = Mid; } l -= Gety(x); if (l < Ans) Ans = l, Ax = x; return l; } inline void SA(double T) { for (; T > 0.00001; T *= 0.99) { y = x + T * (Getrand() * 2 - 1); if (y < a[1].x || y > a[n].x) continue; N2 = Calc(x) - Calc(y); if (N2 > 0 || exp(N2 / T) > Getrand()) x = y; } for (int i = 1; i <= 1000; i++) { y = Ax + T * (Getrand() * 2 - 1); if (y < a[1].x || y > a[n].x) continue; Calc(y); } } } // namespace Sa int main() { int t = read(); while (t--) { int n = read(); double T = n; if (n * n < 4 * n) { printf( N n ); continue; } double a = (T + sqrt(T * T - 4.0 * T)) / 2.0; double b = (T - sqrt(T * T - 4.0 * T)) / 2.0; printf( Y %.10f %.10f n , a, b); } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long n, m; cin >> n >> m; long long sum = 0, cyl = 0; long long k = (n / m); for (int i = 1; i <= 10; ++i) { cyl += (m * i) % 10; } sum = (k / 10) * cyl; cyl = 0; for (int i = 1; i <= k % 10; ++i) { cyl += m * (i) % 10; } cout << sum + cyl << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); if (a < max(c, d) || b < max(c, d)) { printf( -1 n ); } else if (c == 0 && d == 0) { for (int i = 0; i < a; i++) printf( 4 ); for (int i = 0; i < b; i++) printf( 7 ); printf( n ); } else if (c == d) { if (a == b && a == c) { printf( -1 n ); } else if (a == c) { for (int i = 0; i < c; i++) printf( 74 ); for (int i = 0; i < b - c; i++) printf( 7 ); printf( n ); } else if (b == c) { for (int i = 0; i < a - c; i++) printf( 4 ); for (int i = 0; i < c; i++) printf( 74 ); printf( n ); } else { for (int i = 0; i < a - c - 1; i++) printf( 4 ); for (int i = 0; i < c; i++) printf( 47 ); for (int i = 0; i < b - c; i++) printf( 7 ); printf( 4 ); printf( n ); } } else if (c - d == 1) { for (int i = 0; i < a - c; i++) printf( 4 ); for (int i = 0; i < c; i++) printf( 47 ); for (int i = 0; i < b - c; i++) printf( 7 ); printf( n ); } else if (d - c == 1) { printf( 74 ); for (int i = 0; i < a - d; i++) printf( 4 ); for (int i = 0; i < d - 2; i++) printf( 74 ); for (int i = 0; i < b - d; i++) printf( 7 ); printf( 74 ); printf( n ); } else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 10e-12; int n, n1, n2; int dig[10] = { (1 << (1)) | (1 << (2)) | (1 << (3)) | (1 << (5)) | (1 << (6)) | (1 << (7)), (1 << (3)) | (1 << (6)), (1 << (1)) | (1 << (3)) | (1 << (4)) | (1 << (5)) | (1 << (7)), (1 << (1)) | (1 << (3)) | (1 << (4)) | (1 << (6)) | (1 << (7)), (1 << (2)) | (1 << (3)) | (1 << (4)) | (1 << (6)), (1 << (1)) | (1 << (2)) | (1 << (4)) | (1 << (6)) | (1 << (7)), (1 << (1)) | (1 << (2)) | (1 << (5)) | (1 << (4)) | (1 << (6)) | (1 << (7)), (1 << (1)) | (1 << (3)) | (1 << (6)), (1 << (1)) | (1 << (2)) | (1 << (3)) | (1 << (4)) | (1 << (5)) | (1 << (6)) | (1 << (7)), (1 << (1)) | (1 << (2)) | (1 << (3)) | (1 << (4)) | (1 << (6)) | (1 << (7)), }; int main() { ios::sync_with_stdio(false); cin >> n; n1 = n / 10; n2 = n % 10; int a, b; a = b = 0; for (int i = 0; i < 10; i++) { if (((dig[n1]) & dig[i]) == dig[n1]) { a++; } if (((dig[n2]) & dig[i]) == dig[n2]) { b++; } } cout << a * b << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, n, m; while (cin >> n >> k) { if (n * (n - 1) / 2 <= k) { puts( no solution ); } else { for (i = 0; i < n; i++) printf( 0 %d n , i); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, q; scanf( %d , &n); bool grid[n + 1][n + 1], ans = false; string s; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) scanf( %d , &grid[i][j]); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ans ^= (grid[j][i] && grid[i][j]); } } scanf( %d , &q); while (q--) { int t; scanf( %d , &t); if (t == 1 || t == 2) { scanf( %d , &t); ans ^= 1; } else s += (ans + 0 ); } printf( %s , s.c_str()); return 0; } |
#include <bits/stdc++.h> using namespace std; long long k, ans, a[501], i, g, n; long long check(long long x) { k = 0; if (x == 1) return 0; for (long long i = 1; i <= n; i++) if (a[i] / (x - 1) * x < a[i]) return 0; else k += (a[i] + x - 1) / x; if (k < ans) ans = k; } int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]), ans += a[i] / 2 + a[i] % 2; sort(a + 1, a + n + 1); for (i = 2; i <= sqrt(a[n]) + 2; i++) check(i); for (i = 1; i <= sqrt(a[n]); i++) { g = a[n] / i, check(g), check(g + 1), check(g + 2); } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; inline int nxt() { int x; scanf( %d , &x); return x; } const int N = 55; int a[N][N]; char skdjflfsdj[N][N]; int score[N]; void add(int u, int v, int x) { a[u][v] += x; score[u] += x; } vector<int> all_out(int v, int n) { vector<char> used(n); vector<int> st = {v}; used[v] = 1; vector<int> par(n, -1); while (!st.empty()) { int u = st.back(); st.pop_back(); for (int i = 0; i < n; ++i) { if (!skdjflfsdj[i][u] && a[u][i]) { if (!used[i]) { used[i] = 1; par[i] = u; st.push_back(i); } } } } return par; } int main() { mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n = nxt(), m = nxt(); for (int i = 0; i < m; ++i) { int u = nxt() - 1, v = nxt() - 1; add(u, v, 1); skdjflfsdj[u][v] = skdjflfsdj[v][u] = 1; } for (int i = 0; i < n; ++i) { for (int j = 0; j < i; ++j) { if (!skdjflfsdj[i][j]) { if (rng() % 2) { add(i, j, 1); } else { add(j, i, 1); } } } } while (true) { bool ok = false; for (int i = 0; i < n; ++i) { if (ok) { break; } auto par = all_out(i, n); for (int j = 0; j < n; ++j) { if (i != j && par[j] > -1 && score[j] < score[i] - 1) { for (int u = j; u != i; u = par[u]) { add(u, par[u], 1); add(par[u], u, -1); } ok = true; break; } } } if (!ok) { break; } } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cout << a[i][j]; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 256; int getNum(char tch) { int num = tch; char ch[10]; int cnt = 0; while (cnt < 8) { ch[cnt++] = num % 2 + 0 ; num /= 2; } num = 0; for (int i = 0; i < 8; i++) { num = num * 2 + (ch[i] - 0 ); } return num; } int main() { char ch[1000]; gets(ch); int len = strlen(ch); int pre = 0; for (int i = 0; i < len; i++) { int tmp = getNum(ch[i]); cout << (pre - tmp + 10 * 256) % mod << endl; pre = tmp; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[100001]; cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> a[i]; } sort(a + 1, a + 1 + m); int ans = 100000000; for (int i = 1; i <= m - n + 1; i++) { ans = min(ans, a[i + n - 1] - a[i]); } cout << ans; } |
#include <bits/stdc++.h> #pragma warning(disable : 6031) #pragma warning(disable : 4101) using namespace std; const int INF = 1e9; const long long LINF = 1e18; const double PI = acos(-1); const int MAXN = 1000006; int n, m, v1, v2, Deg[MAXN], visited[MAXN]; vector<unordered_set<int>> G; vector<int> C; set<pair<int, int>> erased; void find_component(int v) { visited[v] = true; C.push_back(v); for (int c : G[v]) { if (!visited[c]) { find_component(c); } } } void eulerian_cycle(int v) { stack<int> S; vector<int> ans; S.push(v); while (!S.empty()) { int s = S.top(); if (G[s].empty()) { ans.push_back(s); S.pop(); } else { int c = *G[s].begin(); G[s].erase(G[s].begin()); G[c].erase(s); S.push(c); } } int ans_size = ((int)(ans).size()); for (int i = 1; i < ((int)(ans).size()); i += 2) { if (ans[i] != 0 && ans[i + 1] != 0) { if (ans[i - 1] != 0 && ans[(i + 2) % ans_size] != 0) { if (ans[i] < ans[i + 1]) { erased.erase({ans[i], ans[i + 1]}); } else { erased.erase({ans[i + 1], ans[i]}); } } } } } int main() { scanf( %d%d , &n, &m); G.resize(n + 1); while (m--) { scanf( %d%d , &v1, &v2); G[v1].insert(v2); G[v2].insert(v1); if (v1 < v2) { erased.insert({v1, v2}); } else { erased.insert({v2, v1}); } Deg[v1]++; Deg[v2]++; } for (int i = 1; i <= n; i++) { if (!visited[i]) { assert(G[0].empty()); C.clear(); find_component(i); if (((int)(C).size()) == 1) { continue; } for (int v : C) { if (Deg[v] % 2 == 1) { G[0].insert(v); G[v].insert(0); } } eulerian_cycle(C.front()); } } printf( %d n , ((int)(erased).size())); for (pair<int, int> p : erased) { printf( %d %d n , p.first, p.second); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optmize( Ofast ) using namespace std; const int maxn = 20009; const int inf = 1e8; int n, m, K, T; int e[1 << 10][maxn << 1]; int head[maxn], cntedge = 1; int from[maxn], to[maxn], cap[maxn], flow[maxn], nex[maxn]; void Addedge(int x, int y, int z) { nex[++cntedge] = head[x]; from[cntedge] = x; to[cntedge] = y; cap[cntedge] = z; flow[cntedge] = 0; head[x] = cntedge; } int cur[maxn]; int d[maxn]; int vis[maxn]; int q[maxn], r; int Bfs() { for (int i = 1; i <= n; ++i) vis[i] = 0; vis[1] = 1; d[1] = 0; q[r = 1] = 1; for (int l = 1; l <= r; ++l) { int x = q[l]; for (int i = head[x]; i; i = nex[i]) { int v = to[i]; if ((cap[i] > flow[i]) && (!vis[v])) { vis[v] = 1; d[v] = d[x] + 1; q[++r] = v; } } } return vis[n]; } int Dfs(int x, int a) { if ((x == n) || (a == 0)) return a; int nowflow = 0, f = 0; for (int i = cur[x]; i; i = nex[i]) { cur[x] = i; int v = to[i]; if (d[x] + 1 == d[v]) { f = Dfs(v, min(a, cap[i] - flow[i])); nowflow += f; a -= f; flow[i] += f; flow[i ^ 1] -= f; if (a == 0) break; } } return nowflow; } int p[maxn], pf[maxn] = {0, 1000000}; int augment() { for (int i = 1; i <= n; ++i) vis[i] = 0; q[r = 1] = 1; int flag = 0; for (int l = 1; l <= r; ++l) { int x = q[l]; for (int i = head[x]; i; i = nex[i]) { int v = to[i]; if ((cap[i] > flow[i]) && (!vis[v])) { vis[v] = 1; p[v] = i; q[++r] = v; pf[v] = min(pf[x], cap[i] - flow[i]); if (v == n) { flag = 1; break; } } } if (flag) break; } if (!vis[n]) return 0; int f = pf[n], x = n; while (x != 1) { flow[p[x]] += f; flow[p[x] ^ 1] -= f; x = from[p[x]]; } return f; } int Maxflow() { int flow = 0; while (Bfs()) { for (int i = 1; i <= n; ++i) cur[i] = head[i]; flow += Dfs(1, inf); } return flow; } int f[1024]; int sum[1 << 10]; int lg2[1 << 11]; int w[maxn]; 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 r * k; } int main() { scanf( %d%d%d%d , &n, &m, &K, &T); for (int i = 1; i <= m; ++i) { int x, y, z; scanf( %d%d%d , &x, &y, &z); Addedge(x, y, z); Addedge(y, x, 0); } f[0] = Maxflow(); for (int i = 2; i <= cntedge; ++i) e[0][i] = flow[i]; for (int s = 1; s < (1 << K); ++s) { for (int i = 1; i <= K; ++i) { if (s & (1 << (i - 1))) { cap[i << 1] = 25; } else { cap[i << 1] = 0; } } int pre = s ^ (s & (-s)); for (int i = 2; i <= cntedge; ++i) flow[i] = e[pre][i]; f[s] = f[pre]; int tmp; while (tmp = augment()) f[s] += tmp; for (int i = 2; i <= cntedge; ++i) e[s][i] = flow[i]; } for (int s = 0; s < (1 << K); ++s) { int t = (~s) & ((1 << K) - 1); if (t < s) swap(f[s], f[t]); } for (int i = 1; i <= 10; ++i) lg2[1 << i] = i; while (T--) { for (int i = 1; i <= K; ++i) w[i] = read(); int ans = f[0]; for (int s = 1; s < (1 << K); ++s) { int l = s & (-s); sum[s] = sum[s ^ l] + w[lg2[l] + 1]; ans = min(ans, sum[s] + f[s]); } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void desperate_optimization(int precision) { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.setf(ios::showpoint); cout.precision(precision); } const int N = 2e5; int arr[N + 5]; int pre[N + 5]; int mark[N + 5]; vector<int> lis; void hora(int tc) { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; mark[i] = 1; if (lis.size() == 0 || arr[lis.back()] < arr[i]) { pre[i] = -1; if (lis.size() != 0) pre[i] = lis.back(); lis.push_back(i); } else { int lo = 0; int hi = lis.size() - 1; int res = -1; while (lo <= hi) { int mid = (lo + hi) / 2; if (arr[lis[mid]] >= arr[i]) { res = mid; hi = mid - 1; } else lo = mid + 1; } lis[res] = i; pre[i] = -1; if (res != 0) pre[i] = lis[res - 1]; } } int tmp = lis.back(); for (int i = 0; i < n; i++) { if (pre[tmp] == pre[i] && arr[tmp] < arr[i]) tmp = i; } while (tmp != -1) { mark[tmp] = 0; tmp = pre[tmp]; } int hi = 1e9; int lo = -1; bool ada = true; for (int i = 0; i < n; i++) { if (mark[i] == 0) { if (lo >= arr[i]) ada = false; lo = arr[i]; } else { if (hi <= arr[i]) ada = false; hi = arr[i]; } } if (ada == false) { lis.clear(); for (int i = 0; i < n; i++) { mark[i] = 0; if (lis.size() == 0 || arr[lis.back()] > arr[i]) { pre[i] = -1; if (lis.size() != 0) pre[i] = lis.back(); lis.push_back(i); } else { int lo = 0; int hi = lis.size() - 1; int res = -1; while (lo <= hi) { int mid = (lo + hi) / 2; if (arr[lis[mid]] <= arr[i]) { res = mid; hi = mid - 1; } else lo = mid + 1; } lis[res] = i; pre[i] = -1; if (res != 0) pre[i] = lis[res - 1]; } } int tmp = lis.back(); for (int i = 0; i < n; i++) { if (pre[tmp] == pre[i] && arr[tmp] > arr[i]) tmp = i; } while (tmp != -1) { mark[tmp] = 1; tmp = pre[tmp]; } int hi = 1e9; int lo = -1; bool ada = true; for (int i = 0; i < n; i++) { if (mark[i] == 0) { if (lo >= arr[i]) ada = false; lo = arr[i]; } else { if (hi <= arr[i]) ada = false; hi = arr[i]; } } if (ada == false) cout << NO << n ; else { cout << YES << n ; for (int i = 0; i < n; i++) cout << mark[i] << ; cout << n ; } } else { cout << YES << n ; for (int i = 0; i < n; i++) cout << mark[i] << ; cout << n ; } } int main() { desperate_optimization(10); int ntc = 1; for (int tc = 1; tc <= ntc; tc++) hora(tc); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> string to_str(T str) { stringstream stream; stream << str; return stream.str(); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, d, e; long long result = 1000000000; cin >> n >> d >> e; while (n >= 0) { result = min(n % (5 * e), result); n = n - d; } cout << result << endl; return 0; ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } |
#include <bits/stdc++.h> using namespace std; bool debug = 1; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; long long ln, lk, lm; int a[100005]; int main() { scanf( %d , &n); for (int(i) = 0; (i) < (int)(n); (i)++) { scanf( %d , a + i); } sort(a, a + n); vector<int> vp; for (int i = n - 1; i >= 1;) { if (a[i] == a[i - 1] || a[i] - 1 == a[i - 1]) { vp.push_back(a[i - 1]); i -= 2; } else i--; } long long ans = 0; for (int i = 0; i + 1 < vp.size(); i += 2) { ans += (long long)vp[i] * vp[i + 1]; } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; uint64_t rnd_data = 0xDEADBEEFDULL; inline void my_srand(int seed) { rnd_data = ((uint64_t)seed << 16) | 0x330E; } inline int my_rand() { rnd_data = rnd_data * 0x5DEECE66DULL + 0xB; return (rnd_data >> 17) & 0x7FFFFFFF; } template <typename T> void my_random_shuffle(T b, T e) { for (int i = (1); i <= (int)((int)(e - b) - 1); i++) { swap(b[i], b[my_rand() % (i + 1)]); } } template <class _T> inline _T sqr(const _T &x) { return x * x; } template <typename type_t, typename less_t = std::less<type_t>> inline bool uin(type_t &a, const type_t &b, const less_t &ls = less_t()) { return ls(b, a) ? a = b, true : false; } template <typename type_t, typename less_t = std::less<type_t>> inline bool uax(type_t &a, const type_t &b, const less_t &ls = less_t()) { return ls(a, b) ? a = b, true : false; } const long double PI = 3.1415926535897932384626433832795L; const long double EPS = 1e-9; const int MAXN = 1 << 17; int n, k; int a[MAXN]; bool g[MAXN]; int d[MAXN * 2][2][2]; int main() { scanf( %d%d , &n, &k); memset((g), 0, sizeof(g)); for (int i = 0; i < (int)(k); i++) { scanf( %d , &a[i]); g[a[i] - 1] = true; } memset(d, 0x80, sizeof(d)); int z = 1 << (n - 1); for (int i = 0; i < (int)(z); i++) { int x = i << 1; int y = x + 1; d[z + i][g[x]][g[y]] = g[x] || g[y]; d[z + i][g[y]][g[x]] = g[x] || g[y]; } for (int i = (z - 1); i >= (int)(1); i--) { int x = i * 2; int y = x + 1; for (int xw = 0; xw < (int)(2); xw++) { for (int xl = 0; xl < (int)(2); xl++) { if (d[x][xw][xl] < 0) continue; for (int yw = 0; yw < (int)(2); yw++) { for (int yl = 0; yl < (int)(2); yl++) { if (d[y][yw][yl] < 0) continue; int gw[2] = {xw, yw}; bool ggl = xl || yl; for (int t = 0; t < (int)(2); t++) { int cur = (xw || yw) + ggl; int nw = gw[t]; int nl0 = gw[t ^ 1]; int nl = nl0 || ggl; cur += nl; uax(d[i][nw][nl], d[x][xw][xl] + d[y][yw][yl] + cur); } } } } } } int ans = 0; for (int i = 0; i < (int)(2); i++) { for (int j = 0; j < (int)(2); j++) { int add = (i || j); uax(ans, d[1][i][j] + add); } } printf( %d n , ans); return 0; } |
#include<bits/stdc++.h> #define FOR(i,l,r) for(int i=l;i<=r;i++) #define ROF(i,l,r) for(int i=l;i>=r;i--) #define lson k<<1,l,mid #define rson k<<1|1,mid+1,r #define r(x) read(x) #define rr(x,y) read(x);read(y) #define rrr(x,y,z) read(x);read(y);read(z) #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y) #define fi first #define se second #define sss(str) scanf( %s ,str+1) using namespace std; typedef long long LL; typedef pair<int,int> pt; const int N=1e6+5; const int M=2e3+5; const int mod=1e9+7; const int INF=2e9; const double eps=1e-8; const double pi=acos(-1); template <class T> inline void read(T &x) { char c;x = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) x = -1; T res = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) res = res * 10 + c - 0 ; x *= res; } int n,m; char str[N]; int f[N]; void solve(int cas) { r(n); int cnt1=n/2,cnt2=n-cnt1; LL ans=0; set<pt> s; for(int i=cnt1;i>=-cnt1;i-=2){ for(int j=cnt2;j>=-cnt2;j-=2){ s.insert(mp(i,j)); s.insert(mp(j,i)); } } cout<<s.size()<<endl; } int main() { int t; // r(t); t=1; // init(); FOR(i,1,t){ solve(i); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } long long pwr(long long base, long long p) { long long ans = 1; while (p) { if (p & 1) ans = (ans * base) % (1000000007LL); base = (base * base) % (1000000007LL); p >>= 1; } return ans; } long long modInv(long long n, long long mod) { return pwr(n, mod - 2); } int bitCount(int n) { int c = 0; while (n) { c++; n &= n - 1; } return c; } int main() { double n, m, cost; ; int i, a, b; cin >> n >> m; int ver[100000]; for (i = 1; i < n + 1; i++) { scanf( %d , &ver[i]); } double ans = 0; for (i = 0; i < m; i++) { cin >> a >> b >> cost; ans = max(ans, (ver[a] + ver[b]) / cost); } printf( %.12lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int Inf = (1 << 30) - 1; const long long lInf = (1LL << 62) - 1; const long long Mod = 1000000007; long long fac[1000010]; long long inv[1000010]; long long powm[1000010]; long long pown[1000010]; int a, b; long long n, m; long long fpow(long long a, long long b, long long Mod) { a %= Mod; b %= Mod; long long mul = 1; while (b) { if (b & 1) (mul *= a) %= Mod; (a *= a) %= Mod; b >>= 1; } return mul; } void init() { int tmp = max(n, m); fac[0] = fac[1] = 1; for (int i = 2; i <= tmp; ++i) fac[i] = fac[i - 1] * i % Mod; inv[tmp] = fpow(fac[tmp], Mod - 2, Mod); for (int i = tmp; i >= 1; --i) inv[i - 1] = inv[i] * i % Mod; powm[0] = pown[0] = 1; for (int i = 1; i <= tmp; ++i) powm[i] = powm[i - 1] * m % Mod, pown[i] = pown[i - 1] * n % Mod; } long long A(int x, int y) { if (x - y < 0 || x < 0) return 0; return fac[x] * inv[x - y] % Mod; } long long C(int x, int y) { if (x - y < 0 || x < 0 || y < 0) return 0; return fac[x] * inv[y] % Mod * inv[x - y] % Mod; } int main() { ios::sync_with_stdio(false); cin >> n >> m >> a >> b; init(); long long ans = 0; for (long long i = 1; i <= n - 1; ++i) { long long mul = A(n - 2, i - 1) * C(m - 1, i - 1) % Mod * powm[n - i - 1] % Mod; if (n - i - 2 >= 0) (mul *= (i + 1) * pown[n - i - 2] % Mod) %= Mod; (ans += mul) %= Mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long A, B; struct node { long long vx, vy, w; } p[400005]; bool cmp(const node p1, const node p2) { if (p1.w == p2.w) return p1.vx < p2.vx; return p1.w < p2.w; } int main() { scanf( %d%I64d%I64d , &n, &A, &B); int i, j; long long gg; for (i = 1; i <= n; i++) scanf( %I64d%I64d%I64d , &gg, &p[i].vx, &p[i].vy); long long ans = 0; for (i = 1; i <= n; i++) { p[i].w = p[i].vy - p[i].vx * A; } sort(p + 1, p + n + 1, cmp); for (i = 1; i <= n; i++) { j = i; while (j + 1 <= n && p[j + 1].w == p[i].w) j = j + 1; long long num = j - i + 1; int k; for (int t = i; t <= j; t++) { k = t; while (k + 1 <= j && p[k + 1].vx == p[t].vx) k = k + 1; long long siz = k - t + 1; ans += siz * (num - siz); t = k; } i = j; } printf( %I64d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { string S; cin >> S; int M; cin >> M; for (int i = 0; i < M; i++) { int l, r, k; cin >> l >> r >> k; l--; rotate(S.begin() + l, S.begin() + r - k % (r - l), S.begin() + r); } cout << S << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int flag = 0; for (int i = 0; i < n - 1; i++) { if ((a[i + 1] - a[i]) > 1 || (a[i + 1] - a[i]) < -1) { flag = 1; } } if (flag == 1) { cout << NO << n ; } else { cout << YES << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long n, m; cin >> n >> m; if (m % 2 == 1) { bool f = true; long ptr = (m + 1) / 2; long p1 = ptr - 1, p2 = ptr; for (long i = 1; i <= n; i++) { if (f && p2 <= m) { cout << p2 << n ; p2++; f = false; } else if (p1 >= 1) { cout << p1 << n ; p1--; f = true; } else { i--; f = !f; p1 = ptr - 1; p2 = ptr; } } } else { bool f = true; long ptr = (m + 1) / 2; if (n >= 2) cout << ptr << n << ptr + 1 << n ; else cout << ptr; long p1 = ptr - 1; long p2 = ptr + 2; for (long i = 3; i <= n; i++) { if (f && p1 >= 1) { cout << p1 << n ; p1--; f = false; } else if (p2 <= m) { cout << p2 << n ; p2++; f = true; } else { i++; if (i < n) cout << ptr << n << ptr + 1 << n ; else cout << ptr << n ; p1 = ptr - 1; p2 = ptr + 2; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> mp; string s; long long n, m, k, ans; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); srand(time(0)); cin >> n; vector<long long> a(n + 1, 0); for (long long i = 1; i <= n; ++i) cin >> a[i]; for (long long i = n; i >= 1; --i) if (a[i] && !m) m = i; else if (!a[i] && !k) k = i; cout << min(m, k); } |
#include <bits/stdc++.h> using namespace std; int prime[1000005]; int ans[5]; int idx; set<int> s, s1; set<int>::iterator it; int main() { int i, j; for (i = 2; i <= 1000000; i++) { if (prime[i] == 1) continue; for (j = i + i; j <= 1000000; j += i) prime[j] = 1; } int n; scanf( %d , &n); if (n == 1) printf( 1 n ); else if (n == 2) printf( 2 n ); else { long long sum = n; for (i = 2; i < n; i++) { if (n % i == 0) s.insert(i); } int countt = 0; for (i = n - 1; i >= 1; i--) { bool no = 0; for (it = s.begin(); it != s.end(); it++) { if (i % (*it) == 0) { no = 1; break; } } if (!no) { sum *= (long long)i; countt++; } if (countt == 2) break; } long long sum1 = n - 1; for (i = 2; i < n - 1; i++) { if ((n - 1) % i == 0) s1.insert(i); } countt = 0; for (i = n - 2; i >= 1; i--) { bool no = 0; for (it = s1.begin(); it != s1.end(); it++) { if (i % (*it) == 0) { no = 1; break; } } if (!no) { sum1 *= (long long)i; countt++; } if (countt == 2) break; } printf( %I64d n , max(sum, sum1)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; pair<int, int> a[N]; int main() { int n; cin >> n; int mn = 1e9, mx = -1e9; for (int i = 0; i < n; ++i) { cin >> a[i].first >> a[i].second; mn = min(mn, a[i].first); mx = max(mx, a[i].second); } int ans = -1; for (int i = 0; i < n; ++i) { if (a[i].first <= mn && a[i].second >= mx) { ans = i + 1; break; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int dp[101][101][28]; vector<pair<int, int> > graph[101]; int fun(int x, int y, int val) { if (dp[x][y][val] != -1) return dp[x][y][val]; for (int i = 0; i < graph[x].size(); i++) { if (graph[x][i].second >= val) { bool mark = true; for (int j = 0; j < graph[y].size(); j++) { if (graph[y][j].second >= graph[x][i].second) { if (fun(graph[x][i].first, graph[y][j].first, graph[y][j].second) == 0) { mark = false; break; } } } if (mark == true) { dp[x][y][val] = 1; return 1; } } } dp[x][y][val] = 0; return 0; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int x, y; char d; cin >> x >> y >> d; graph[x - 1].push_back(make_pair(y - 1, d - 96)); } memset(dp, -1, sizeof(dp)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (fun(i, j, 0)) cout << A ; else cout << B ; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n, m; int volume[N]; int amount[N]; int parent[N]; int tofill[N]; int weight[N]; std::set<int> notFull; void reducePath(int index, int lead) { while (parent[index] != index) { int oldParent = parent[index]; parent[index] = lead; index = oldParent; } } int find(int index) { int lead = index; while (parent[lead] != lead) { lead = parent[lead]; } reducePath(index, lead); return lead; } bool merge(int l, int r) { int ll = find(l); int rl = find(r); if (ll == rl) { return false; } if (weight[ll] < weight[rl]) swap(ll, rl); parent[rl] = ll; weight[ll] += weight[rl]; if (tofill[ll] < tofill[rl]) tofill[ll] = tofill[rl]; return true; } void fill(int p, int x) { while (x > 0) { int lead = find(p); int f = tofill[lead]; int remainingVolume = volume[f] - amount[f]; int fillAmount = std::min(remainingVolume, x); amount[f] += fillAmount; x -= fillAmount; if (amount[f] == volume[f]) { if (f == n - 1) break; else ++f; merge(lead, f); } } } void fill2(int p, int x) { auto lb = notFull.lower_bound(p); while (x > 0 && lb != notFull.end()) { int remainingVolume = volume[*lb] - amount[*lb]; int fillAmount = std::min(remainingVolume, x); amount[*lb] += fillAmount; x -= fillAmount; if (amount[*lb] == volume[*lb]) lb = notFull.erase(lb); else lb++; } } void init() { for (int i = 0; i < n; ++i) { parent[i] = i; tofill[i] = i; weight[i] = 1; notFull.insert(i); } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for (int i = 0; i < n; ++i) { cin >> volume[i]; } init(); cin >> m; for (int i = 0; i < m; ++i) { int q; cin >> q; if (q == 1) { int p, x; cin >> p >> x; fill2(--p, x); } else { int k; cin >> k; cout << amount[--k] << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); vector<int> v(n + 1); for (int i = 1; i <= n; i++) scanf( %d , &v[i]); double ans = 0.0; int a, b, w; for (int i = 1; i <= m; i++) { scanf( %d %d %d , &a, &b, &w); ans = max(ans, 1.0 * (v[a] + v[b]) / w); } printf( %0.9lf n , ans); return 0; } |
#include <bits/stdc++.h> const int max_n = 150; const unsigned int lowest = 31; const int size = (max_n >> 5) + 1; struct row { unsigned int bits[size]; void set_bit(unsigned int j) { bits[j >> 5] |= (1 << (j & lowest)); } bool get_bit(unsigned int j) { return ((bits[j >> 5] >> (j & lowest)) & 1) == 1; } bool is_zero() { for (int i = 0; i < size; ++i) if (bits[i]) return false; return true; } }; row operator&(row a, row b) { row c; for (int i = 0; i < size; ++i) c.bits[i] = a.bits[i] & b.bits[i]; return c; } row operator|(row a, row b) { row c; for (int i = 0; i < size; ++i) c.bits[i] = a.bits[i] | b.bits[i]; return c; } row operator~(row a) { row c; for (int i = 0; i < size; ++i) c.bits[i] = ~a.bits[i]; return c; } row left(row a) { for (int i = 0; i < size - 1; ++i) { a.bits[i] >>= 1; if (a.bits[i + 1] & 1) a.bits[i] |= (1 << lowest); } a.bits[size - 1] >>= 1; return a; } row right(row a) { for (int i = size - 1; i > 0; --i) { a.bits[i] <<= 1; if (a.bits[i - 1] & (1 << lowest)) a.bits[i] |= 1; } a.bits[0] <<= 1; return a; } int ei, ej, n, m, k; row table[max_n], where[max_n]; bool check() { for (int i = 0; i < n; ++i) if ((i != ei) && !where[i].is_zero()) return false; for (int j = 0; j < m; ++j) if ((j != ej) && where[ei].get_bit(j)) return false; return true; } int main() { memset(table, 0, sizeof(table)); memset(where, 0, sizeof(where)); scanf( %d%d%d n , &n, &m, &k); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { char c; scanf( %c , &c); if (c == E ) ei = i, ej = j, c = . ; if (c == . ) table[i].set_bit(j), where[i].set_bit(j); } scanf( n ); } if (check()) { printf( 0 n ); return 0; } for (int i = 1; i <= k; ++i) { char c; scanf( %c , &c); switch (c) { case L : for (int r = 1; r <= n - 2; ++r) where[r] = (left(where[r]) & table[r]) | (where[r] & ~right(table[r])); break; case R : for (int r = 1; r <= n - 2; ++r) where[r] = (right(where[r]) & table[r]) | (where[r] & ~left(table[r])); break; case D : for (int r = n - 2; r >= 1; --r) where[r] = (where[r - 1] & table[r]) | (where[r] & ~table[r + 1]); break; case U : for (int r = 1; r <= n - 2; ++r) where[r] = (where[r + 1] & table[r]) | (where[r] & ~table[r - 1]); break; } if (check()) { printf( %d n , i); return 0; } } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<pair<int, int> > g[1001]; int obtenpadre(int u, int padre[1001]) { if (padre[u] == 0) return u; padre[u] = obtenpadre(padre[u], padre); return padre[u]; } void unir(int u, int v, int padre[1001], int llaves[1001][1001]) { padre[v] = u; for (int i = 1; i <= m; i++) if (llaves[v][i]) llaves[u][i] = 1; } void ejecuta(int padre[1001], int llaves[1001][1001]) { bool cambios = true; while (cambios) { cambios = false; for (int u = 1; u <= n; u++) { vector<pair<int, int> > &ar = g[u]; for (int i = 0; i < int(ar.size()); i++) { int v = ar[i].first; int l = ar[i].second; int pu = obtenpadre(u, padre); int pv = obtenpadre(v, padre); if (pu != pv and (llaves[pu][l] or llaves[pv][l])) { unir(pu, pv, padre, llaves); cambios = true; } } } } } map<string, int> posini[2]; int padre[2][1001]; int llaves[2][1001][1001]; int visto[2][1001]; int main() { cin >> n >> m >> k; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; g[u].push_back(pair<int, int>(v, i)); g[v].push_back(pair<int, int>(u, i)); } for (int p = 0; p < 2; p++) { for (int i = 1; i <= k; i++) { string s; int h, amount; cin >> s >> h >> amount; posini[p][s] = h; for (int j = 0; j < amount; j++) { int x; cin >> x; llaves[p][h][x] = 1; } } ejecuta(padre[p], llaves[p]); } for (map<string, int>::iterator it = posini[0].begin(); it != posini[0].end(); it++) { string s = it->first; int h0 = it->second; int h1 = posini[1][s]; if (obtenpadre(h0, padre[0]) != obtenpadre(h1, padre[0])) { cout << NO << endl; exit(0); } } for (int u = 1; u <= n; u++) { int h0 = obtenpadre(u, padre[0]); int h1 = obtenpadre(u, padre[1]); if (visto[0][h0] != visto[1][h1]) { cout << NO << endl; exit(0); } if (visto[0][h0] == 0) { visto[0][h0] = visto[1][h1] = 1; for (int j = 1; j <= m; j++) { if (llaves[0][h0][j] != llaves[1][h1][j]) { cout << NO << endl; exit(0); } } } } cout << YES << endl; } |
#include <bits/stdc++.h> const int inf = 0x3f3f3f3f; const long long int INF = 0x3f3f3f3f3f3f3f3f; using namespace std; inline void INP() {} long long int n, m; vector<pair<long long int, long long int> > v; void solve() { cin >> n >> m; long long int mn = INF; long long int mx = 0; for (long long int i = 0; i < m; i++) { long long int x, y; cin >> x >> y; v.push_back({-1 * y, x}); mn = min(mn, y); mx = max(mx, y); } sort(begin(v), end(v)); long long int ans = 0; for (long long int i = 0; i < m; i++) { if (v[i].second <= n) { ans += (-1 * v[i].first) * v[i].second; n -= v[i].second; } else { ans += (-1 * v[i].first) * n; n = 0; } if (n == 0) break; } cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long int ara[N]; int main() { long long int n, i, j, k, s = 0, ts; cin >> n; for (i = 1; i <= n; i++) cin >> ara[i]; for (i = 1; i < n; i++) { for (j = 30; ara[i] > 0 && j >= 0; j--) { if ((i + (1 << j)) > n) continue; s += ara[i]; ara[(i + (1 << j))] += ara[i]; ara[i] = 0; } cout << s << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int cha[1000100]; int num[1000100]; int a[5010]; int limit[] = {0, 1, 3, 6, 10}; int n, k; int che[1000100]; bool check(int mod) { int bad = 0; int mostI = -1; for (int i = 0; i < n; i++) { int t = a[i] % mod; che[t]++; if (che[t] > 1) bad++; if (bad > k) { mostI = i; break; } } for (int i = 0; i <= mostI; i++) { int t = a[i] % mod; che[t]--; } return (bad <= k); } int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); for (int i = 0; i <= a[n - 1]; i++) cha[i] = 0; int maxn = a[n - 1] - a[0]; for (int i = 0; i <= maxn; i++) che[i] = 0; for (int i = 0; i <= maxn; i++) num[i] = 0; for (int i = 0; i < n - 1; i++) for (int j = i + 1; j < n; j++) { int cc = a[j] - a[i]; num[cc]++; } if (n - k == 1) { printf( 1 n ); return 0; } for (int i = 1;; i++) { int ans = 0; for (int j = i; j <= maxn; j += i) { ans += num[j]; if (ans > k) break; } if (ans <= limit[k] && check(i)) { printf( %d n , i); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:16777216 ) const char DEBUG = 0; mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count()); struct pp { int pos, id; }; long long pos[200000]; int type[200000]; int res[100000]; vector<int> arr; int get_id1(int x) { int l = 0, r = arr.size(); while (r - l > 1) { int m = (l + r) / 2; if (arr[m] >= x) r = m; else l = m; } return l; } int get_id2(int x) { int l = -1, r = arr.size() - 1; while (r - l > 1) { int m = (l + r) / 2; if (arr[m] <= x) l = m; else r = m; } return r; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin.sync_with_stdio(0); cout.tie(0); cout.sync_with_stdio(0); int n, m; cin >> n >> m; for (int i = 0; i < n + m; i++) cin >> pos[i]; for (int i = 0; i < n + m; i++) cin >> type[i]; for (int i = 0; i < n + m; i++) if (type[i]) arr.push_back(pos[i]); for (int i = 0; i < n + m; i++) { if (type[i]) continue; long long d1 = 1000000000000000000LL, d2 = 1000000000000000000LL; int p1 = get_id1(pos[i]); int p2 = get_id2(pos[i]); d1 = abs(arr[p1] - pos[i]); d2 = abs(arr[p2] - pos[i]); if (d1 < d2) res[p1]++; else if (d2 < d1) res[p2]++; else { if (arr[p1] < arr[p2]) res[p1]++; else res[p2]++; } } for (int i = 0; i < m; i++) cout << res[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int base1 = 115019, mod1 = 1e9 + 13; vector<int> pos[100005]; int n, t[100005], a[100005]; long long p1[100005], sum1[100005]; struct node { int st, len; bool operator<(const node &A) const { if (len == A.len) return st < A.st; return len < A.len; } }; vector<node> S; bool check(int x, int y) { if (y + (y - x) - 1 > n) return false; long long sx1 = ((sum1[y - 1] - sum1[x - 1] * p1[y - x]) % mod1 + mod1) % mod1; long long sy1 = ((sum1[y + y - x - 1] - sum1[y - 1] * p1[y - x]) % mod1 + mod1) % mod1; return sx1 == sy1; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), t[i] = a[i]; sort(t + 1, t + n + 1); int m = unique(t + 1, t + n + 1) - t - 1; p1[0] = 1; for (int i = 1; i <= n; ++i) { a[i] = lower_bound(t + 1, t + m + 1, a[i]) - t; pos[a[i]].push_back(i); p1[i] = p1[i - 1] * base1 % mod1; sum1[i] = (sum1[i - 1] * base1 + a[i]) % mod1; } for (int i = 1; i <= m; ++i) for (int j = 0; j < pos[i].size(); ++j) for (int k = j + 1; k < pos[i].size(); ++k) { int x = pos[i][j], y = pos[i][k]; if (check(x, y)) S.push_back((node){x, y - x}); } sort(S.begin(), S.end()); int now = 1; for (int i = 0; i < S.size(); ++i) { node p = S[i]; if (p.st < now) continue; else now = p.st + p.len; } printf( %d n , n - now + 1); for (int i = now; i <= n; ++i) printf( %d , t[a[i]]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, p; string s, number; cin >> n; string name[n]; int taxi[n], pizza[n], cg[n], tax, pizz, cgc, taxmax = -1, pizzmax = -1, cgcmax = -1; int taxifinal[n], pizzafinal[n], cgcfinal[n], ct = 0, cp = 0, cc = 0; for (int i = 0; i < n; i++) { cin >> p >> name[i]; tax = 0; pizz = 0; cgc = 0; for (int j = 0; j < p; j++) { cin >> number; if (((number[0] == number[3]) && (number[3] == number[6])) && ((number[0] == number[1]) && (number[3] == number[4]) && (number[6] == number[7]))) { tax++; } else if ((int(number[0]) > int(number[1])) && (int(number[1]) > int(number[3])) && (int(number[3]) > int(number[4])) && (int(number[4]) > int(number[6])) && (int(number[6]) > int(number[7]))) { pizz++; } else { cgc++; } } taxi[i] = tax; pizza[i] = pizz; cg[i] = cgc; } for (int i = 0; i < n; i++) { taxmax = max(taxmax, taxi[i]); pizzmax = max(pizzmax, pizza[i]); cgcmax = max(cgcmax, cg[i]); } for (int i = 0; i < n; i++) { if (taxmax == taxi[i]) { taxifinal[ct] = i; ct++; } if (pizzmax == pizza[i]) { pizzafinal[cp] = i; cp++; } if (cgcmax == cg[i]) { cgcfinal[cc] = i; cc++; } } cout << If you want to call a taxi, you should call: ; if (ct > 1) { for (int j = 0; j < ct - 1; j++) { cout << << name[taxifinal[j]] << , ; } cout << << name[taxifinal[ct - 1]] << . << endl; } else { cout << << name[taxifinal[ct - 1]] << . << endl; } cout << If you want to order a pizza, you should call: ; if (cp > 1) { for (int j = 0; j < cp - 1; j++) { cout << << name[pizzafinal[j]] << , ; } cout << << name[pizzafinal[cp - 1]] << . << endl; } else { cout << << name[pizzafinal[cp - 1]] << . << endl; } cout << If you want to go to a cafe with a wonderful girl, you should call: ; if (cc > 1) { for (int j = 0; j < cc - 1; j++) { cout << << name[cgcfinal[j]] << , ; } cout << << name[cgcfinal[cc - 1]] << . << endl; } else { cout << << name[cgcfinal[cc - 1]] << . << endl; } 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[10]; for (int i = 0; i < 8; i++) { cin >> s[i]; } bool ans = 1; for (int i = 0; i < 8 && ans; i++) { for (int k = 1; k < 8; k++) { if (s[i][k - 1] == s[i][k]) { ans = 0; break; } } } if (ans) { cout << YES << endl; } else cout << NO << endl; return 0; } |
/* Clearink */ #include <queue> #include <cstdio> #include <algorithm> #define rep( i, l, r ) for ( int i = l, repEnd##i = r; i <= repEnd##i; ++i ) #define per( i, r, l ) for ( int i = r, repEnd##i = l; i >= repEnd##i; --i ) inline int rint() { int x = 0, f = 1, s = getchar(); for ( ; s < 0 || 9 < s; s = getchar() ) f = s == - ? -f : f; for ( ; 0 <= s && s <= 9 ; s = getchar() ) x = x * 10 + ( s ^ 0 ); return x * f; } template<typename Tp> inline void wint( Tp x ) { if ( x < 0 ) putchar( - ), x = -x; if ( 9 < x ) wint( x / 10 ); putchar( x % 10 ^ 0 ); } const int MAXN = 1.5e3; int n, m, a[MAXN + 5][MAXN + 5], b[MAXN + 5][MAXN + 5]; int d[MAXN + 5], ocnt, opt[MAXN + 5], p[MAXN + 5], q[MAXN + 5], tmp[MAXN + 5]; bool era[MAXN + 5]; std::queue<int> que; int main() { n = rint(), m = rint(); rep ( i, 1, n ) rep ( j, 1, m ) a[i][j] = rint(); rep ( i, 1, n ) rep ( j, 1, m ) b[i][j] = rint(); rep ( i, 2, n ) rep ( j, 1, m ) d[j] += b[i - 1][j] > b[i][j]; rep ( i, 1, m ) if ( !d[i] ) que.push( i ); while ( !que.empty() ) { int c = que.front(); que.pop(); opt[++ocnt] = c; rep ( i, 2, n ) if ( b[i - 1][c] < b[i][c] && !era[i] ) { era[i] = true; rep ( j, 1, m ) if ( b[i - 1][j] > b[i][j] && !--d[j] ) { que.push( j ); } } } rep ( i, 1, n ) q[i] = i; per ( k, ocnt, 1 ) { rep ( i, 1, n ) p[i] = i; std::sort( p + 1, p + n + 1, [=]( const int i, const int j ) { int u = a[q[i]][opt[k]], v = a[q[j]][opt[k]]; return u != v ? u < v : i < j; } ); rep ( i, 1, n ) tmp[i] = q[i]; rep ( i, 1, n ) q[i] = tmp[p[i]]; } rep ( i, 1, n ) rep ( j, 1, m ) if ( a[q[i]][j] != b[i][j] ) { return puts( -1 ), 0; } wint( ocnt ), putchar( n ); per ( i, ocnt, 1 ) wint( opt[i] ), putchar( i > 1 ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n; cin >> n; long long int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } map<long long int, long long int> m; m[0] = 0; long long int sum = 0, ans = 0, k = (-1); for (int i = 0; i < n; i++) { sum += a[i]; if (m.count(sum)) { if (m[sum] >= k) { ans++; k = (i - 1); } } m[sum] = i; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int loc[200000 + 10]; int n; int ans[4]; int fnext(int y) { int l = 1, r = n + 1, mid = (l + r) / 2; while (l < r) { if (loc[mid] <= y) l = mid + 1; else r = mid; mid = (l + r) / 2; } return mid; } int ok(int x) { int i, j; int z = 1; for (i = 1; i <= 3; i++) { z = fnext(loc[z] + x); ans[i] = z; if (z >= n + 1) return 1; } return 0; } int main() { while (scanf( %d , &n) != EOF) { int i, j, k; for (i = 1; i <= n; i++) { scanf( %d , &loc[i]); } sort(loc + 1, loc + n + 1); int r = (loc[n] - loc[1]); int l = 0, mid; while (l < r) { mid = (r + l) / 2; if (ok(mid)) r = mid; else l = mid + 1; } ok(l); double radius = l * 1.0 / 2.0; double radar1 = (loc[ans[1] - 1] + loc[1]) * 1.0 / 2.0; double radar2 = (loc[ans[2] - 1] + loc[ans[1]]) / 2.0; double radar3 = (loc[ans[3] - 1] + loc[ans[2]]) / 2.0; printf( %.6f n , radius); printf( %.6f , radar1); printf( %.6f , radar2); printf( %.6f n , radar3); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, y, x1, y1; cin >> x >> y >> x1 >> y1; int X = abs(x1 - x), Y = abs(y1 - y); cout << max(X, Y); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; using ii = long long; int main() { int n, k; scanf( %d%d , &n, &k); vector<int> v(n); vector<ii> s(n); for (int &x : v) { scanf( %d , &x); } for (int i = n - 2; i + 1; --i) { s[i] = v[i + 1] + s[i + 1]; } s.pop_back(); ii r = v[0] + (n > 1 ? s[0] : 0); sort(s.begin(), s.end(), greater<ii>()); r += accumulate(s.begin(), s.begin() + k - 1, 0ll); printf( %lld n , r); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 55, MAXM = 20020; int n, m, k, acc[MAXN][MAXM], dp[MAXN][MAXM], ans; struct no { int beg, end, mid, mx, lz; no *l, *r; no(int beg, int end) : beg(beg), end(end), mid((beg + end) >> 1), mx(0), lz(0) { if (beg != end) l = new no(beg, mid), r = new no(mid + 1, end); } void refresh() { if (!lz) return; mx += lz; if (beg != end) l->lz += lz, r->lz += lz; lz = 0; } void upd(int a, int b, int inc) { refresh(); if (end < a || b < beg) return; if (a <= beg && end <= b) return lz += inc, refresh(); l->upd(a, b, inc), r->upd(a, b, inc); mx = max(l->mx, r->mx); } void set(int pos, int val) { refresh(); if (beg == end) return void(mx = val); (pos <= mid ? l : r)->set(pos, val); mx = max(l->mx, r->mx); } int get(int a, int b) { refresh(); if (end < a || b < beg) return 0; if (a <= beg && end <= b) return mx; return max(l->get(a, b), r->get(a, b)); } void print() { refresh(); if (beg == end) return printf( %d , mx), void(); l->print(), r->print(); } }; int main() { scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) scanf( %d , &acc[i][j]), acc[i][j] += acc[i][j - 1]; no seg(1, m - k + 1); for (int i = n; i >= 1; --i) { for (int j = 1; j <= k; ++j) seg.upd(1, j, -(acc[i + 1][j] - acc[i + 1][j - 1])); for (int j = 1; j <= m - k + 1; ++j) { int aux = acc[i][j + k - 1] - acc[i][j - 1] + acc[i + 1][j + k - 1] - acc[i + 1][j - 1]; if (i == n) { dp[i][j] = aux; continue; } dp[i][j] = max(dp[i][j], seg.get(j - k + 1, j + k - 1)); if (j > k) dp[i][j] = max(dp[i][j], seg.get(1, j - k)); if (j + k <= m - k + 1) dp[i][j] = max(dp[i][j], seg.get(j + k, m - k + 1)); dp[i][j] += aux; seg.upd(max(1, j - k + 1), j, (acc[i + 1][j] - acc[i + 1][j - 1])); seg.upd(j + 1, j + k, -(acc[i + 1][j + k] - acc[i + 1][j + k - 1])); } for (int j = 1; j <= m - k + 1; ++j) seg.set(j, dp[i][j]); } printf( %d n , seg.get(1, m - k + 1)); } |
#include <bits/stdc++.h> using namespace std; int n; int d[262144][4]; map<int, int> comp; int r[262144], R, pr[262144]; vector<int> vec; bool cmp(int a, int b) { return d[a][1] > d[b][1]; } struct BIT { int m[262144 * 2]; vector<int> v[262144]; void init() { int i; for (i = 0; i < n; i++) v[comp[d[i][0]]].push_back(i); for (i = 0; i < 262144; i++) { if (v[i].size()) { sort(v[i].begin(), v[i].end(), cmp); m[262144 + i] = d[v[i].back()][1]; } else m[262144 + i] = 2147483647; } for (i = 262144 - 1; i >= 1; i--) m[i] = m[i * 2] < m[i * 2 + 1] ? m[i * 2] : m[i * 2 + 1]; } void gohelp(int p, int i) { if (m[p] > d[i][3]) return; if (p < 262144) { gohelp(p * 2, i); gohelp(p * 2 + 1, i); } else { while (v[p - 262144].size()) { int j = v[p - 262144].back(); if (d[j][1] <= d[i][3]) { vec.push_back(j); r[j] = R; pr[j] = i; v[p - 262144].pop_back(); } else break; } if (v[p - 262144].size()) m[p] = d[v[p - 262144].back()][1]; else m[p] = 2147483647; for (p /= 2; p; p /= 2) m[p] = m[p * 2] < m[p * 2 + 1] ? m[p * 2] : m[p * 2 + 1]; } } void go(int p, int i) { p += 262144; gohelp(p, i); for (; p > 1; p /= 2) { if (p & 1) gohelp(p - 1, i); } } } bit; int main() { int i; scanf( %d , &n); comp[0] = 1; for (i = 0; i < n; i++) { scanf( %d%d%d%d , &d[i][0], &d[i][1], &d[i][2], &d[i][3]); comp[d[i][0]] = comp[d[i][2]] = 1; } i = 0; for (auto& it : comp) it.second = i++; bit.init(); memset(r, -1, sizeof(r)); vector<int> vecpr; vecpr.push_back(n); while (vecpr.size()) { vec.clear(); R++; for (int i : vecpr) bit.go(comp[d[i][2]], i); vecpr = vec; } printf( %d n , r[n - 1]); if (r[n - 1] != -1) { vector<int> path; for (i = n - 1; r[i] > 1; i = pr[i]) path.push_back(i); path.push_back(i); for (i = path.size() - 1; i >= 0; i--) printf( %d , path[i] + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; bool mark[MAX_N]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 0; i < n - 1; i++) { int a; cin >> a; mark[a - 1] = true; } for (int i = 0; i < n; i++) if (!mark[i]) cout << i + 1; } |
#include <bits/stdc++.h> using namespace std; char a[100]; int main() { int i, l, c = 0; scanf( %s , a); l = strlen(a); for (i = 1; i < l; i++) { if (a[i] <= Z ) { c++; } } int t = 0; if (a[1] <= Z && c >= l - 1) t++; if (t != 0) { for (i = 0; i < l; i++) { if (a[i] >= a ) { a[i] = a[i] - a + A ; } else { a[i] = a[i] - A + a ; } } } printf( %s , a); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 105; const int mod = 998244353; const double Pi = acos(-1.0); const long long INF = 1e18; const int G = 3, Gi = 332748118; long long qpow(long long a, long long b) { long long res = 1; while (b) { if (b) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int T, n, m; long long dp[105][105], a[105][105]; int main() { scanf( %d , &T); while (T--) { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) scanf( %lld , &a[i][j]); } long long res = INF; for (int x = 1; x <= n; ++x) { for (int y = 1; y <= m; ++y) { for (int i = 0; i <= n; ++i) for (int j = 0; j <= m; ++j) dp[i][j] = INF; dp[1][0] = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { long long dis = abs(x - i) + abs(y - j); if (i <= x && j <= y && a[i][j] >= a[x][y] - dis) { dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + a[i][j] - (a[x][y] - dis); } if (i >= x && j >= y && a[i][j] >= a[x][y] + dis) { dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + a[i][j] - (a[x][y] + dis); } } } res = min(res, dp[n][m]); } } printf( %lld n , res); } return 0; } |
#include <bits/stdc++.h> const int MAXN = 100010, inf = 2147483233; using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, q, tot, nxt[MAXN << 1], to[MAXN << 1], fst[MAXN], cnt; int fa[MAXN], hsh[MAXN], dep[MAXN], f[MAXN][25], HSH[MAXN], size[MAXN]; int mx[MAXN << 2][2], mn[MAXN << 2][2], mx1, mx2, mn1, mn2; namespace hh { using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -f; for (; isdigit(ch); ch = getchar()) x = 10 * x + ch - 0 ; return x * f; } const int maxn = 500010; int n, m, lastans; int first[maxn], to[maxn << 1], nx[maxn << 1], cnt; inline void add(int u, int v) { to[++cnt] = v; nx[cnt] = first[u]; first[u] = cnt; } inline void ins(int u, int v) { add(u, v); add(v, u); } namespace LCA { int dep[maxn], bl[maxn], fa[maxn], size[maxn]; inline void dfs1(int x) { size[x] = 1; for (int i = first[x]; i; i = nx[i]) { if (to[i] == fa[x]) continue; fa[to[i]] = x; dep[to[i]] = dep[x] + 1; dfs1(to[i]); size[x] += size[to[i]]; } } inline void dfs2(int x, int col) { int k = 0; bl[x] = col; for (int i = first[x]; i; i = nx[i]) if (dep[to[i]] > dep[x] && size[to[i]] > size[k]) k = to[i]; if (!k) return; dfs2(k, col); for (int i = first[x]; i; i = nx[i]) if (dep[to[i]] > dep[x] && to[i] != k) dfs2(to[i], to[i]); } inline int lca(int x, int y) { while (bl[x] != bl[y]) { if (dep[bl[x]] < dep[bl[y]]) swap(x, y); x = fa[bl[x]]; } return dep[x] > dep[y] ? y : x; } } // namespace LCA namespace SEG { int root[maxn][2], ls[maxn << 4], rs[maxn << 4], val[maxn << 4], size; inline void Insert(int &x, int l, int r, int pos, int va) { if (!x) x = ++size; val[x] += va; if (l == r) return; int mid = (l + r) >> 1; if (pos <= mid) Insert(ls[x], l, mid, pos, va); else Insert(rs[x], mid + 1, r, pos, va); } inline int query(int x, int l, int r, int L, int R) { if (!x) return 0; if (L <= l && r <= R) return val[x]; int mid = (l + r) >> 1, ans = 0; if (L <= mid) ans += query(ls[x], l, mid, L, R); if (R > mid) ans += query(rs[x], mid + 1, r, L, R); return ans; } } // namespace SEG inline int q_dis(int x, int y) { return LCA::dep[x] + LCA::dep[y] - (LCA::dep[LCA::lca(x, y)] << 1); } int size[maxn], f[maxn], vis[maxn], d[maxn], v[maxn], son, root; int nfa[maxn]; inline void solve(int rt, int type, int x, int fa) { SEG::Insert(SEG::root[rt][type], 0, n, d[x], v[x]); for (int i = first[x]; i; i = nx[i]) { if (to[i] == fa || vis[to[i]]) continue; d[to[i]] = d[x] + 1; solve(rt, type, to[i], x); } } inline void getroot(int x, int fa) { size[x] = 1, f[x] = 0; for (int i = first[x]; i; i = nx[i]) { if (to[i] == fa || vis[to[i]]) continue; getroot(to[i], x); size[x] += size[to[i]]; f[x] = max(f[x], size[to[i]]); } f[x] = max(f[x], son - size[x]); if (f[x] < f[root]) root = x; } inline void work(int x) { vis[x] = 1; d[x] = 0; solve(x, 0, x, 0); for (int i = first[x]; i; i = nx[i]) { if (vis[to[i]]) continue; son = size[to[i]]; root = 0; d[to[i]] = 1; getroot(to[i], 0); solve(root, 1, to[i], x); nfa[root] = x; work(root); } } inline int query(int x, int k) { int ret = SEG::query(SEG::root[x][0], 0, n, 0, k); for (int i = x; nfa[i]; i = nfa[i]) { int du = q_dis(x, nfa[i]); ret += SEG::query(SEG::root[nfa[i]][0], 0, n, 0, k - du); ret -= SEG::query(SEG::root[i][1], 0, n, 0, k - du); } return ret; } inline void update(int x, int k) { int delt = k - SEG::query(SEG::root[x][0], 0, n, 0, 0); SEG::Insert(SEG::root[x][0], 0, n, 0, delt); for (int i = x; nfa[i]; i = nfa[i]) { int du = q_dis(x, nfa[i]); SEG::Insert(SEG::root[nfa[i]][0], 0, n, du, delt); SEG::Insert(SEG::root[i][1], 0, n, du, delt); } } int main() { n = read(), m = read(); for (int i = 1; i <= n; i++) v[i] = read(); for (int i = 2; i <= n; i++) { int u = read(), v = read(); ins(u, v); } LCA::dfs1(1); LCA::dfs2(1, 1); f[0] = son = n; getroot(1, 0); work(root); while (m--) { int opt = read(), x = read() ^ lastans, y = read() ^ lastans; if (opt) update(x, y); else printf( %d n , lastans = query(x, y)); } } } // namespace hh void dfs(int x) { hsh[x] = ++tot, HSH[tot] = x; dep[x] = dep[f[x][0]] + 1; for (int i = 1; i <= 23; i++) f[x][i] = f[f[x][i - 1]][i - 1]; for (int i = fst[x]; i; i = nxt[i]) dfs(to[i]); } int lca(int u, int v) { if (dep[u] < dep[v]) swap(u, v); int t = dep[u] - dep[v]; for (int i = 23; i >= 0; i--) if ((1 << i) & t) u = f[u][i]; if (u == v) return u; for (int i = 23; i >= 0; i--) if (f[u][i] != f[v][i]) u = f[u][i], v = f[v][i]; return f[u][0]; } void pushup(int x) { mx[x][0] = max(mx[(x << 1)][0], mx[((x << 1) | 1)][0]); mx[x][1] = max(min(mx[(x << 1)][0], mx[((x << 1) | 1)][0]), max(mx[(x << 1)][1], mx[((x << 1) | 1)][1])); mn[x][0] = min(mn[(x << 1)][0], mn[((x << 1) | 1)][0]); mn[x][1] = min(max(mn[(x << 1)][0], mn[((x << 1) | 1)][0]), min(mn[(x << 1)][1], mn[((x << 1) | 1)][1])); } void build(int x, int l, int r) { if (l == r) { mx[x][1] = 0; mn[x][1] = inf; mx[x][0] = mn[x][0] = hsh[l]; return; } int mid = l + r >> 1; build((x << 1), l, mid); build(((x << 1) | 1), mid + 1, r); pushup(x); } void query(int x, int l, int r, int a, int b) { if (a <= l && r <= b) { if (mx[x][0] > mx1) mx2 = mx1, mx1 = mx[x][0]; else if (mx[x][0] > mx2) mx2 = mx[x][0]; if (mx[x][1] > mx2) mx2 = mx[x][1]; if (mn[x][0] < mn1) mn2 = mn1, mn1 = mn[x][0]; else if (mn[x][0] < mn2) mn2 = mn[x][0]; if (mn[x][1] < mn2) mn2 = mn[x][1]; return; } int mid = l + r >> 1; if (a <= mid) query((x << 1), l, mid, a, b); if (b > mid) query(((x << 1) | 1), mid + 1, r, a, b); } void init() { cin >> n >> q; for (int i = 2; i <= n; i++) { f[i][0] = read(); to[++cnt] = i, nxt[cnt] = fst[f[i][0]], fst[f[i][0]] = cnt; } } void work() { dfs(1); build(1, 1, n); } int a, b; void gogo() { mx1 = mx2 = 0; mn1 = mn2 = inf; query(1, 1, n, a, b); } void print() { while (q--) { int l1, l2; cin >> a >> b; gogo(); l1 = lca(HSH[mx1], HSH[mn2]); l2 = lca(HSH[mx2], HSH[mn1]); if (dep[l1] > dep[l2]) printf( %d %d n , HSH[mn1], dep[l1] - 1); else printf( %d %d n , HSH[mx1], dep[l2] - 1); } } int main() { init(); work(); print(); } |
#include <bits/stdc++.h> using namespace std; struct node { int from, to, next, w, dir, id; } e[1500000]; int head[350000]; int in[350000]; int out[350000]; int ans[350000]; int n, m, cont; void add(int from, int to, int w, int dir, int id) { e[cont].from = from; e[cont].to = to; e[cont].w = w; e[cont].dir = dir; e[cont].id = id; e[cont].next = head[from]; head[from] = cont++; } void Top() { queue<int> s; s.push(1); in[1] = out[1] = 0; while (!s.empty()) { int u = s.front(); s.pop(); for (int i = head[u]; i != -1; i = e[i].next) { int v = e[i].to; int w = e[i].w; int dir = e[i].dir; if (v == 1 || (in[v] == out[v] && v != n)) continue; if (u == 1 || v == n) { if (u == 1) { ans[e[i].id] = dir; in[v] += w; } else { ans[e[i].id] = dir; } } else { if (in[v] != out[v]) { in[v] += w; ans[e[i].id] = dir; } else ans[e[i].id] = 1 - dir; } if (in[v] == out[v] && v != n) { s.push(v); } } } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); } int main() { while (~scanf( %d%d , &n, &m)) { cont = 0; memset(in, 0, sizeof(in)); memset(out, 0, sizeof(out)); memset(head, -1, sizeof(head)); for (int i = 1; i <= m; i++) { int x, y, w; scanf( %d%d%d , &x, &y, &w); add(x, y, w, 0, i); add(y, x, w, 1, i); out[y] += w; out[x] += w; } for (int i = 1; i <= n; i++) out[i] = out[i] / 2; Top(); } } |
#include <bits/stdc++.h> using namespace std; void solution() { int n, k; cin >> n >> k; vector<long long> v(n * k + 1, 0), brr(n * k + 1, 0); long long sum = 0; for (int i = 1; i <= n * k; i++) { cin >> v[i]; brr[i] = v[i]; } brr[0] = INT_MAX; sort(brr.rbegin(), brr.rend()); if (n % 2 == 0) { int right = n / 2 + 1; int i = right; int j = 0; while (j < k) { sum = sum + brr[i]; i = i + right; j++; } } else { int right = n / 2 + n % 2; int i = right; int j = 0; while (j < k) { sum = sum + brr[i]; i = i + right; j++; } } cout << sum << endl; } int main() { int t; cin >> t; while (t--) { solution(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MXN = 80 + 10; const long long MX5 = 4e5 + 10; const long long MX6 = 1e6 + 10; const long long LOG = 20; const long long INF = 8e18; const double eps = 1e-9; const long long MOD = 1e9 + 7; long long power(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md)); } long long bmm(long long a, long long b) { return (a % b == 0 ? b : bmm(b, a % b)); } string base2(long long n) { string a = ; while (n >= 2) { a += (char)(n % 2 + 0 ); n /= 2; } a += (char)(n + 0 ); reverse((a).begin(), (a).end()); return a; } long long n; long long PS[MX5], Ans[MX5], ex[MX5]; vector<long long> second, T; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) { long long x; cin >> x; second.push_back(x); } for (int i = 0; i < n; i++) { long long x; cin >> x; T.push_back(x); } PS[0] = T[0]; for (int i = 1; i < n; i++) PS[i] = PS[i - 1] + T[i]; PS[n] = INF; for (int i = 0; i < n; i++) { long long men = (i - 1 < 0 ? 0 : PS[i - 1]); if (second[i] <= T[i]) { ex[i] += second[i]; continue; } long long l = i, r = n; while (r - l > 1) { long long mid = (l + r) / 2; if (PS[mid] - men <= second[i]) { l = mid; } else { r = mid; } } Ans[l + 1]--, Ans[i]++; if (PS[l] - men < second[i]) { ex[l + 1] += second[i] - PS[l] + men; } } for (int i = 1; i < n; i++) Ans[i] += Ans[i - 1]; for (int i = 0; i < n; i++) { cout << Ans[i] * T[i] + ex[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int points(int p, int t) { int first = 75 * p; int second = 250 * p - p * t; return max(first, second); } int main() { int a, b, c, d; scanf( %d %d %d %d , &a, &b, &c, &d); int misha = points(a, c); int vasia = points(b, d); if (misha > vasia) { cout << Misha << endl; } else if (vasia > misha) { cout << Vasya << endl; } else { cout << Tie << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int maxn = 50; int k, w, h; int read() { int x = 0, y = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) y = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar(); return x * y; } int pw[5]; inline int add(int x) { return x >= mod ? x - mod : x; } inline int sub(int x) { return x < 0 ? x + mod : x; } inline int power(int x, int b) { int res = 1; while (b) { if (b & 1) res = 1ll * res * x % mod; x = 1ll * x * x % mod; b >>= 1; } return res; } vector<int> p[6]; int pos[maxn]; void dfs1(int d, int v, int S) { if (!d) { v = add(v + 1ll * p[d][0] * w % mod); pos[p[d][0]] = 1; if (v == S) { for (int i = 1; i <= (1 << k); i++) printf( %d , pos[i]); puts( ); exit(0); } return; } int len = (1 << (d - 1)); p[d - 1].resize(len); for (int s = 0; s < (1 << len); s++) { int val = 0; for (int i = 0; i < len; i++) { int u = p[d][2 * i], v = p[d][2 * i + 1]; if (s & (1 << i)) p[d - 1][i] = v, pos[u] = len + 1, val = add(val + 1ll * u * pw[d - 1] % mod); else p[d - 1][i] = u, pos[v] = len + 1, val = add(val + 1ll * v * pw[d - 1] % mod); } dfs1(d - 1, add(v + val), S); } return; } unordered_map<int, bool> mp[(1 << 16) + 5]; void dfs2(int S, int d, int v) { if (!d) { v = add(v + 1ll * w * p[d][0] % mod); mp[S][v] = 1; return; } int len = (1 << (d - 1)); p[d - 1].resize(len); for (int s = 0; s < (1 << len); s++) { int val = 0; for (int i = 0; i < len; i++) { int u = p[d][2 * i], v = p[d][2 * i + 1]; if (s & (1 << i)) p[d - 1][i] = v, val = add(val + 1ll * u * pw[d - 1] % mod); else p[d - 1][i] = u, val = add(val + 1ll * v * pw[d - 1] % mod); } dfs2(S, d - 1, add(v + val)); } return; } void dfs3(int d, int v) { if (d == 3) { int s = 0; for (int i = 7; i >= 0; i--) s <<= 2, s |= (p[d][i] - 4 * i - 1); if (mp[s][sub(h - v)]) { dfs1(d, v, h); exit(0); } return; } int len = (1 << (d - 1)); p[d - 1].resize(len); for (int s = 0; s < (1 << len); s++) { int val = 0; for (int i = 0; i < len; i++) { int u = p[d][2 * i], v = p[d][2 * i + 1]; if (s & (1 << i)) p[d - 1][i] = v, pos[u] = len + 1, val = add(val + 1ll * u * pw[d - 1] % mod); else p[d - 1][i] = u, pos[v] = len + 1, val = add(val + 1ll * v * pw[d - 1] % mod); } dfs3(d - 1, add(v + val)); } return; } int main() { k = read(); w = read(); h = read(); for (int i = 0; i <= 4; i++) pw[i] = power(w, (1 << i) + 1); if (k <= 4) { p[k].resize(1 << k); for (int i = 0; i < p[k].size(); i++) p[k][i] = i + 1; dfs1(k, 0, h); puts( -1 ); return 0; } for (int s = 0; s < (1 << 16); s++) { p[3].resize(8); for (int i = 0; i < 8; i++) { int op = (s >> (2 * i)) & 3; p[3][i] = 4 * i + op + 1; } dfs2(s, 3, 0); } p[5].resize(32); for (int i = 0; i < p[5].size(); i++) p[5][i] = i + 1; dfs3(k, 0); puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 6000 + 10; int n, t, arr[MAXN][MAXN]; void dfs(int i, int j, int val) { arr[i][j] += val; if (arr[i][j] < 4) return; int me = arr[i][j] / 4; arr[i][j] %= 4; dfs(i + 1, j, me); dfs(i - 1, j, me); dfs(i, j + 1, me); dfs(i, j - 1, me); return; } int main() { ios::sync_with_stdio(0); cin >> n >> t; dfs(MAXN / 2, MAXN / 2, n); for (int i = 0; i < t; i++) { int l, r; cin >> l >> r; l += MAXN / 2; r += MAXN / 2; if (l < 0 || r < 0 || l > MAXN || r > MAXN) { cout << 0 << endl; continue; } cout << arr[l][r] << endl; } cin >> n; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; struct edge { int x, y, w, p; edge() {} void input() { scanf( %d%d%d%d , &x, &y, &w, &p); } } E[N], EE[N]; int n; vector<int> G[N]; long long W[N], WW[N]; void dfs(int x, int y, int id, int mi) { if (id) { int tmp = EE[id].p - E[id].p; tmp = min(mi, tmp); E[id].p += tmp; E[id].w += tmp; mi = min(mi - tmp, E[id].p - (int)W[y]); WW[id] = tmp; } for (int i = 0; i < G[y].size(); i++) { int ID = G[y][i]; if (id == 0) mi = 2e9; dfs(E[ID].x, E[ID].y, ID, mi); mi -= WW[ID]; WW[id] += WW[ID]; } } void dfs(int x, int y, int id) { for (int i = 0; i < G[y].size(); i++) { int ID = G[y][i]; dfs(E[ID].x, E[ID].y, ID); } if (id == 0) return; if (E[id].p < W[y]) { puts( -1 ); exit(0); } long long tmp = min(E[id].p - W[y], (long long)E[id].w - 1); E[id].p -= tmp; E[id].w -= tmp; W[x] += W[y]; W[x] += E[id].w; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { E[i].input(); EE[i] = E[i]; G[E[i].x].push_back(i); } dfs(0, 1, 0); dfs(0, 1, 0, 2e9); cout << n << endl; for (int i = 1; i < n; i++) { printf( %d %d %d %d n , E[i].x, E[i].y, E[i].w, E[i].p); } } |
#include <bits/stdc++.h> using namespace std; long long unsigned int n; long long unsigned int val(long long unsigned int x, long long unsigned int k) { if (x >= 1e10) return n + 1; long long unsigned int ans = x * (x - 1); ans /= 2; long long unsigned int kt = k; if (ans > n) return n + 1; while (k--) { x *= 2; if (x > 1e19) return n + 1; } for (int i = 1; i <= kt; i++) { ans = ans + x / 2; if (ans > n) return n + 1; x /= 2; } if (ans > n) return n + 1; return ans; } long long unsigned int calc(long long unsigned int k) { long long unsigned int lo = 0; long long unsigned int hi = 1e10; long long unsigned int mid; while (hi - lo > 1) { mid = (hi + lo) / 2; if (val(2 * mid - 1, k) >= n) hi = mid; else lo = mid; } if (val(2 * hi - 1, k) == n) { return (2 * hi - 1) * (1LL << k); } return 0; } int main() { cin >> n; long long unsigned int g; vector<long long unsigned int> ans; for (int i = 0; i <= 60; i++) { g = calc(i); if (g != 0) ans.push_back(g); } sort(ans.begin(), ans.end()); for (auto x : ans) { cout << x << ; } if (ans.size() == 0) cout << -1; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, t; int n; int a[100005]; int b[100005]; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(a, a + n); int cnt = 0; for (i = 0; i < n; i++) { if (a[i] != b[i]) cnt++; } if (cnt == 0 || cnt == 2) printf( YES n ); else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int st[200005]; int main() { int tam1, tam2, i; string s, t; cin >> s >> t; long long r = 0; tam1 = s.size(); tam2 = t.size(); st[0] = 0; for (i = 0; i < tam2; i++) { st[i + 1] = st[i] + (t[i] - 0 ); } for (i = 0; i < tam1; i++) { if (s[i] == 0 ) { r += (st[tam2 - tam1 + i + 1] - st[i]); } else { r += (tam2 - tam1 + 1 - (st[tam2 - tam1 + i + 1] - st[i])); } } cout << r << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[10]; char c[100007]; int main() { scanf( %d , &n); scanf( %s , &c); for (int i = 0; i < n; i++) { if (c[i] == L ) { for (int j = 0; j < 10; j++) { if (a[j] == 0) { a[j] = 1; break; } } } else if (c[i] == R ) { for (int j = 9; j >= 0; j--) { if (a[j] == 0) { a[j] = 1; break; } } } else { a[c[i] - 0 ] = 0; } } for (int i = 0; i <= 9; i++) { printf( %d , a[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int T; cin >> T; for (int t = 0; t < T; ++t) { long long int n; long long int a, b; cin >> n >> a >> b; string s; cin >> s; long long int bc = n * (a + b) + b; bool ftram = true; bool ztram = true; long long int fzero = -1; long long int nc = 0; for (int i = 0; i < n; ++i) { if (s[i] == 0 ) { if (!ztram) { fzero = i; ztram = true; } } else { if (ztram) { if (ftram) { nc += a; ftram = false; } else { nc += min(2 * a, (i - fzero - 1) * b); } ztram = false; nc += b; } nc += b; } } if (!ftram) nc += a; cout << bc + nc << endl; } } |
#include <bits/stdc++.h> using namespace std; inline bool isPowerOfTwo(int x) { return (x != 0 && (x & (x - 1)) == 0); } double pi = 3.141592653589793238462643; int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; inline int add(int a, int b, int m = 1000000007) { a += b; if (a >= m) a -= m; return a; } inline int mul(int a, int b, int m = 1000000007) { return (int)(((long long)a * (long long)b) % m); } inline bool ispalin(string &str) { int n = str.length(); for (int i = 0; i < n / 2; i++) if (str[i] != str[n - i - 1]) return false; return true; } long long expo(long long base, long long pow) { long long ans = 1; while (pow != 0) { if (pow & 1 == 1) { ans = ans * base; ans = ans % 1000000007; } base *= base; base %= 1000000007; pow /= 2; } return ans; } void swapp(int *a, int *b) { int temp = *a; *a = *b; *b = temp; } long long invt(long long x) { return expo(x, 1000000007 - 2); } int expFactor(int n, int p) { int x = p; int exponent = 0; while ((n / x) > 0) { exponent += n / x; x *= p; } return exponent; } inline int countsetbit(int n) { unsigned int count = 0; while (n) { n &= (n - 1); count++; } return count; } inline int abs(int x) { if (x < 0) return -x; return x; } bool isPal(string ss) { int len = ss.length(); for (int i = 0; i < len / 2; i++) { int comp = len - i - 1; if (ss[i] != ss[comp]) return false; } return true; } vector<long long> fact, inv; void calfal(int maxn) { fact.resize(maxn); inv.resize(maxn); fact[0] = inv[0] = inv[1] = 1; for (int i = (1); i <= (maxn - 1); ++i) fact[i] = i * fact[i - 1] % 1000000007; for (int i = (2); i <= (maxn - 1); ++i) inv[i] = (1000000007 - 1000000007 / i) * inv[1000000007 % i] % 1000000007; for (int i = (1); i <= (maxn - 1); ++i) inv[i] = inv[i] * inv[i - 1] % 1000000007; } long long ncr(int n, int r) { if (r > n) return 0; return (fact[n] * inv[r] % 1000000007) * inv[n - r] % 1000000007; } long long _sieve_size; bitset<10000010> bs; vector<int> primes; void sieve(long long upperbound) { _sieve_size = upperbound + 1; bs.set(); bs[0] = bs[1] = 0; for (long long i = 2; i <= _sieve_size; i++) if (bs[i]) { for (long long j = i * i; j <= _sieve_size; j += i) bs[j] = 0; primes.push_back((int)i); } } bool isPrime(long long N) { if (N <= _sieve_size) return bs[N]; for (int i = 0; i < (int)primes.size(); i++) if (N % primes[i] == 0) return false; return true; } map<int, int> v, p; int main() { int n, m; cin >> n >> m; int d = 0; for (int i = (0); i <= (m - 1); ++i) { int k; cin >> k; int f = 0; for (int j = (0); j <= (k - 1); ++j) { int x; cin >> x; if (x > 0) { v[x] = 1; if (p[x]) { f = 1; } } else { x = -x; p[x] = 1; if (v[x]) { f = 1; } } } if (f == 0) { d = 1; } else { v.clear(); p.clear(); } } if (d) { cout << YES << endl; } else { cout << NO << endl; } } |
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { return (a.second < b.second); } int main() { vector<pair<long long int, long long int>> v; long long int n, m, k; cin >> n >> m >> k; long long int a[n]; for (long long int i = 0; i < n; i++) { cin >> a[i]; v.push_back(make_pair(a[i], i)); } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); long long int beauty = 0; for (long long int i = 0; i < m * k; i++) { beauty += v[i].first; } cout << beauty << n ; long long int j = 0, q = 0; int pos[999999]; for (int i = 0; i < n; i++) { pos[v[i].second] = i; } for (int i = 0; i < n; i++) { if (pos[i] < m * k) { j++; if (j == m) { q++; if (q < k) { cout << i + 1 << ; j = 0; } } } } } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { long long c; while (a != 0) { c = a; a = b % a; b = c; } return b; } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } long long triple(long long x) { long long ans = x * max(1LL, x - 1LL) * max(1LL, x - 2LL); if (x % 2 == 0) { return x * max(1LL, x - 1LL) * max(1LL, x - 3LL); } if (x >= 4 && x % 2 == 0) { ans /= 2; } return ans; } int main() { std::ios::sync_with_stdio(false); int N; cin >> N; long long ans; switch (N) { case 1: { ans = 1; break; } case 2: { ans = 2; break; } default: { if (N % 2 != 0) { ans = N * (N - 1LL) * (N - 2LL); } else { ans = (N - 1LL) * (N - 2LL) * (N - 3LL); long long tmp = N * (N - 1LL); for (int i = N - 2; i >= 1; i--) { long long val = lcm(tmp, i); if (val > ans) { ans = val; break; } } } break; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool comp(int a, int b) { return a > b; } int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } bool isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) { if (n % i == 0 || n % (i + 2) == 0) { return false; } } return true; } void primeFactors(int n) { while (n % 2 == 0) { cout << 2 << ; n = n / 2; } for (int i = 3; i <= sqrt(n); i = i + 2) { while (n % i == 0) { cout << i << ; n = n / i; } } if (n > 2) { cout << n << ; } } int dayofweek(int d, int m, int y) { static int t[] = {0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4}; y -= m < 3; return (y + y / 4 - y / 100 + y / 400 + t[m - 1] + d) % 7; } void BellmanFord(int graph[][3], int V, int E, int src) { int dis[V]; for (int i = 0; i < V; i++) dis[i] = INT_MAX; dis[src] = 0; for (int i = 0; i < V - 1; i++) { for (int j = 0; j < E; j++) { if (dis[graph[j][0]] + graph[j][2] < dis[graph[j][1]]) dis[graph[j][1]] = dis[graph[j][0]] + graph[j][2]; } } bool flag = true; for (int i = 0; i < E; i++) { int x = graph[i][0], y = graph[i][1], weight = graph[i][2]; if (dis[x] != INT_MAX && dis[x] + weight < dis[y]) { flag = false; break; } } } void topoSort(int n, int m, vector<vector<bool>> &e, vector<bool> &visited, int x) { visited[x] = true; for (int i = n - 1; i >= 0; i--) { if (e[x][i] and !visited[i]) { topoSort(n, m, e, visited, i); } } return; } void convertGraphToTree(int x, vector<vector<int>> &v, vector<bool> &visited, vector<vector<int>> &newedges) { visited[x] = true; for (int i = 0; i < v[x].size(); i++) { if (!visited[v[x][i]]) { newedges[x].push_back(v[x][i]); convertGraphToTree(v[x][i], v, visited, newedges); } } return; } int subtreeCount(int x, vector<vector<int>> &v, vector<bool> &visited, vector<int> &count) { visited[x] = true; int ans = 1; for (int i = 0; i < v[x].size(); i++) { if (!visited[v[x][i]]) { ans += subtreeCount(v[x][i], v, visited, count); } } count[x] = ans; return ans; } void helper(int n) { double ans = 0.0; for (int i = n; i >= 1; i--) { double temp = 1.0 / double(i); ans += temp; } cout << ans << endl; return; } int main() { int n; cin >> n; helper(n); return 0; } |
#include <bits/stdc++.h> using namespace std; const int ALF_SIZE = 26; int val[200], sizeB = 1; struct bor { char q; int a[ALF_SIZE]; int val, par; int go[ALF_SIZE]; int link; bool updated; void init(int q) { this->q = q; val = par = 0; link = -1; updated = 0; for (int w = 0; w < ALF_SIZE; w++) { a[w] = -1; go[w] = -1; } } }; bor a[201]; int go(int c, char v); int get_link(int c) { if (a[c].link < 0) { if ((c == 0) || (a[c].par == 0)) { a[c].link = 0; } else { a[c].link = go(get_link(a[c].par), a[c].q); } } return a[c].link; } int go(int c, char v) { if (a[c].go[v] < 0) { if (a[c].a[v] >= 0) { a[c].go[v] = a[c].a[v]; } else { if (c == 0) { a[c].go[v] = 0; } else { a[c].go[v] = go(get_link(c), v); } } } return a[c].go[v]; } char h[201]; int calc_val(int c) { if (a[c].updated == 0) { a[c].updated = 1; a[c].val += calc_val(get_link(c)); } return a[c].val; } long long d[201][201]; void mult(long long **a, long long **s, long long **f) { int w, e, r; for (e = 0; e < sizeB; e++) { for (r = 0; r < sizeB; r++) { d[e][r] = -1; } } for (w = 0; w < sizeB; w++) { for (e = 0; e < sizeB; e++) { for (r = 0; r < sizeB; r++) { if ((a[w][e] >= 0) && (s[e][r] >= 0)) { d[w][r] = max(d[w][r], a[w][e] + s[e][r]); } } } } for (e = 0; e < sizeB; e++) { for (r = 0; r < sizeB; r++) { f[e][r] = d[e][r]; } } } int main() { int q, w, e, r, t, c, v; long long len; a[0].init(0); cin >> q >> len; for (w = 0; w < q; w++) { scanf( %d , &val[w]); } for (w = 0; w < q; w++) { scanf( %s , h); c = 0; for (e = 0; h[e]; e++) { h[e] -= a ; if (a[c].a[h[e]] == -1) { a[sizeB].init(h[e]); a[sizeB].par = c; a[c].a[h[e]] = sizeB; sizeB++; } c = a[c].a[h[e]]; } a[c].val += val[w]; } for (w = 0; w < sizeB; w++) { calc_val(w); } long long **s = new long long *[sizeB]; long long **d = new long long *[sizeB]; for (e = 0; e < sizeB; e++) { s[e] = new long long[sizeB]; d[e] = new long long[sizeB]; for (r = 0; r < sizeB; r++) { s[e][r] = -1; d[e][r] = -1; } } d[0][0] = 0; for (e = 0; e < sizeB; e++) { for (c = 0; c < 26; c++) { if (a[e].a[c] >= 0) { v = a[e].a[c]; s[e][v] = max(s[e][v], (long long)(a[v].val)); } else { v = go(get_link(e), c); s[e][v] = max(s[e][v], (long long)a[v].val); } } } for (; len; len /= 2) { if (len % 2 == 1) { mult(d, s, d); } mult(s, s, s); } long long ans = 0; for (w = 0; w < sizeB; w++) { ans = max(ans, d[0][w]); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; double s = 10000000, a, b, m; int n; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a >> b; s = min(s, a / b); } printf( %.8f , s * m); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(0); cin.sync_with_stdio(0); cin.tie(0); long long t; cin >> t; while (t--) { long long a, b; cin >> a >> b; if (a > b) swap(a, b); long long ans = 0; while (a * 8 <= b) { a *= 8; ans++; } while (a * 4 <= b) { a *= 4; ans++; } while (a * 2 <= b) { a *= 2; ans++; } if (a == b) { cout << ans << n ; } else { cout << -1 << n ; } } } |
#include <bits/stdc++.h> using namespace std; template <class T> int getbit(T s, int i) { return (s >> i) & 1; } template <class T> T onbit(T s, int i) { return s | (T(1) << i); } template <class T> T offbit(T s, int i) { return s & (~(T(1) << i)); } template <class T> int cntbit(T s) { return __builtin_popcount(s); } template <class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; } template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; } int n, m; vector<int> V[200005]; int res[200005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = (1); i <= (n); ++i) { int x; cin >> x; V[x].push_back(i); } int RR = 1; for (int i = (1); i <= (m); ++i) { int x; cin >> x; if (V[x].size() > 1 && RR == 1) { RR = 2; } else if (V[x].size() == 0) { RR = 0; } if (RR == 1) { res[i] = V[x][0]; } } if (!RR) { cout << Impossible << endl; } else if (RR == 1) { cout << Possible << endl; for (int i = (1); i <= (m); ++i) cout << res[i] << ; } else { cout << Ambiguity << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 7; char s[maxn]; int sa[maxn], str[maxn], _rank[maxn], height[maxn]; int t1[maxn], t2[maxn], c[maxn]; int RMQ[maxn], mm[maxn], best[20][maxn], len; bool cmp(int *r, int a, int b, int l) { return r[a] == r[b] && r[a + l] == r[b + l]; } void da(int n, int m) { int i, j, p, *x = t1, *y = t2; for (i = 0; i < m; i++) c[i] = 0; for (i = 0; i < n; i++) c[x[i] = str[i]]++; for (i = 1; i < m; i++) c[i] += c[i - 1]; for (i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i; for (j = 1; j <= n; j <<= 1) { p = 0; for (i = n - j; i < n; i++) y[p++] = i; for (i = 0; i < n; i++) if (sa[i] >= j) y[p++] = sa[i] - j; for (i = 0; i < m; i++) c[i] = 0; for (i = 0; i < n; i++) c[x[y[i]]]++; for (i = 1; i < m; i++) c[i] += c[i - 1]; for (i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i]; swap(x, y); p = 1; x[sa[0]] = 0; for (i = 1; i < n; i++) x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++; if (p >= n) break; m = p; } int k = 0; n--; for (i = 0; i <= n; i++) _rank[sa[i]] = i; for (i = 0; i < n; i++) { if (k) k--; j = sa[_rank[i] - 1]; while (str[i + k] == str[j + k]) k++; height[_rank[i]] = k; } } void initRMQ(int n) { mm[0] = -1; for (int i = 1; i <= n; i++) mm[i] = ((i & (i - 1)) == 0) ? mm[i - 1] + 1 : mm[i - 1]; for (int i = 1; i <= n; i++) best[0][i] = i; for (int i = 1; i <= mm[n]; i++) for (int j = 1; j + (1 << i) - 1 <= n; j++) { int a = best[i - 1][j]; int b = best[i - 1][j + (1 << (i - 1))]; if (RMQ[a] < RMQ[b]) best[i][j] = a; else best[i][j] = b; } } int askRMQ(int a, int b) { int t = mm[b - a + 1]; b -= (1 << t) - 1; a = best[t][a]; b = best[t][b]; return RMQ[a] < RMQ[b] ? a : b; } int lcp(int a, int b) { if (a == b) return len - a; a = _rank[a]; b = _rank[b]; if (a > b) swap(a, b); return height[askRMQ(a + 1, b)]; } int _stack[maxn][2]; int main() { int q, lim, x; scanf( %d%d , &len, &q); scanf( %s , s); for (int i = 0; i < len; i++) str[i] = s[i]; str[len] = 0; da(len + 1, 256); for (int i = 1; i <= len; i++) RMQ[i] = height[i]; initRMQ(len); while (q--) { int n, m; long long ans = 0; vector<pair<int, int> > Q; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &x), Q.emplace_back(x - 1, 1); for (int i = 1; i <= m; i++) scanf( %d , &x), Q.emplace_back(x - 1, 0); sort(Q.begin(), Q.end(), [](const pair<int, int> &L, const pair<int, int> &R) { if (L.first == R.first) return L.second < R.second; int l = lcp(L.first, R.first); return s[L.first + l] < s[R.first + l]; }); int sz = Q.size(); for (int ss = 0; ss < 2; ss++) { long long tot = 0; map<int, int> W; for (int i = 0; i < sz; i++) { int id = Q[i].first; int state = Q[i].second; if (state == 0) ans += tot; else W[len - id]++, tot += len - id; if (i < sz - 1) { int LCP = lcp(Q[i].first, Q[i + 1].first); while (!W.empty()) { auto it = --W.end(); if (it->first <= LCP) break; tot -= 1LL * (it->first - LCP) * it->second; W[LCP] += it->second; W.erase(it); } } } reverse(Q.begin(), Q.end()); } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q, s, e, cc, sz, t, l, r; long long tt[150000]; void inc(int i, long long w) { for (; i <= n; i |= i + 1) tt[i] += w; } long long sum(int i) { long long sum = 0; for (; i >= 0; i = (i & (i + 1)) - 1) sum += tt[i]; return sum; } long long que(int l, int r) { if (l > r) swap(l, r); return sum(r) - sum(l - 1); } int conv(int i) { if (!cc) return i + s; else return e - i; } int main() { cin >> n >> q; e = n - 1; for (int i = 0; i < n; i++) inc(i, 1); while (q--) { sz = e - s + 1; cin >> t >> l; if (t == 1) { if (!(sz / 2 >= l)) { l = sz - l; cc ^= 1; } for (int i = 1; i <= l; i++) inc(conv(2 * l - i), que(conv(i - 1), conv(i - 1))); if (!cc) s += l; else e -= l; } else { cin >> r; cout << que(conv(l), conv(r - 1)) << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, curr; vector<long long int> v; void start() { cin >> n; int times = 0; bool flag = false; for (int i = 0; i < n; i++) { cin >> a; if (i == 0) { curr = a; times++; if (i == n - 1) v.push_back(times); continue; } else if (curr != a) { v.push_back(times); times = 1; if (i == n - 1) v.push_back(times); curr = a; } else { times++; if (i == n - 1) v.push_back(times); } } long long int sol = 0; for (int i = 0; i < v.size(); i++) { long long int t = v[i]; sol += (t * (t + 1)) / 2; } cout << sol << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); start(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T x, T y) { if (x < y) swap(x, y); while (y > 0) { T f = x % y; x = y; y = f; } return x; } template <typename T> pair<T, T> exgcd(T x, T y) { int sw = 0; if (x < y) sw = true, swap(x, y); pair<T, T> r = make_pair(1, 0); while (y > 0) { T f = x % y; r = make_pair(r.second, r.first - (x / y) * r.second); x = y; y = f; }; if (sw) swap(r.first, r.second); return r; } int rot[][12] = { { 1, 2, 4, 3, 13, 14, 5, 6, 17, 18, 21, 22, }, { 9, 10, 11, 12, 15, 16, 7, 8, 19, 20, 23, 24, }, {13, 14, 16, 15, 1, 3, 5, 7, 9, 11, 24, 22}, {17, 18, 20, 19, 2, 4, 6, 8, 10, 12, 23, 21}, {5, 6, 8, 7, 3, 4, 17, 19, 10, 9, 16, 14}, {21, 22, 24, 23, 18, 20, 12, 11, 15, 13, 1, 2}, }; bool solved(int s[25]) { for (int i = 1; i < 24; i += 4) { if (s[i] != s[i + 1] || s[i] != s[i + 2] || s[i] != s[i + 3]) return false; } return true; } int main(int argc, char *argv[]) { std::cin.sync_with_stdio(false); std::cin.tie(nullptr); int s[25]; cin >> s[1]; { for (int i = 2; i <= 24; i++) cin >> s[i]; int t[25]; bool ok = false; for (int i = 0; i < 6; i++) { memcpy(t, s, sizeof(t)); for (int j = 0; j < 4; j++) t[rot[i][(j + 1) % 4]] = s[rot[i][j]]; for (int j = 0; j < 8; j++) t[rot[i][4 + ((j + 2) % 8)]] = s[rot[i][4 + j]]; if (solved(t)) { ok = true; break; } memcpy(t, s, sizeof(t)); for (int j = 0; j < 4; j++) t[rot[i][(j + 3) % 4]] = s[rot[i][j]]; for (int j = 0; j < 8; j++) t[rot[i][4 + ((j + 6) % 8)]] = s[rot[i][4 + j]]; if (solved(t)) { ok = true; break; } } cout << (ok ? YES : NO ) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, T; const int mn = 5009; double p[mn]; double p2[102][mn]; int pi[mn]; int t[mn]; double dp[2][mn]; int main() { scanf( %d , &(n)); scanf( %d , &(T)); int pk; for (int i = 0; i < n; i++) { scanf( %d %d , &pi[i], &t[i]); p[i] = pi[i] / 100.0; } for (int i = 0; i <= 100; i++) { p2[i][0] = 1; for (int j = 1; j <= T; j++) { p2[i][j] = (i / 100.0) * p2[i][j - 1]; } } int la = 0; double r1 = 0; double r2 = 0; int i2; int i12; for (int i = n - 1; i >= 0; i--) { la = 0; r1 = 0; r2 = 0; i2 = i % 2; i12 = (i + 1) % 2; for (int w = 1; w <= T; w++) { r1 = (r1) * (1 - p[i]) + dp[i12][w - 1] + 1; while (w - la >= t[i]) { r1 = r1 - (1 + dp[i12][la]) * p2[100 - pi[i]][t[i] - 1]; la++; } r2 = r1 * p[i]; if (w - t[i] >= 0) { r2 = r2 + (dp[i12][w - t[i]] + 1) * p2[100 - pi[i]][t[i] - 1]; } dp[i2][w] = r2; } } printf( %.10lf n , dp[0][T]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int minx, maxx, miny, maxy, sumofarea = 0; int n; cin >> n; for (int i = 0; i < n; i++) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if (i == 0) { minx = x1; maxx = x2; miny = y1; maxy = y2; } else { minx = min(minx, x1); maxx = max(maxx, x2); miny = min(miny, y1); maxy = max(maxy, y2); } sumofarea += ((x2 - x1) * (y2 - y1)); } int final_square_area = (maxx - minx) * (maxy - miny); int lengthofside1 = maxx - minx; int lengthofside2 = maxy - miny; if (sumofarea == final_square_area && (lengthofside1 == lengthofside2)) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <typename T, typename TT> inline ostream &operator<<(ostream &os, const pair<T, TT> &t) { return os << t.first << << t.second; } template <typename T> inline ostream &operator<<(ostream &os, const vector<T> &t) { for (auto i : t) os << i << ; return os; } template <typename T> inline istream &operator>>(istream &is, vector<T> &v) { for (T &t : v) is >> t; return is; } template <typename T1, typename T2> inline istream &operator>>(istream &is, pair<T1, T2> &t) { is >> t.first >> t.second; return is; } const long long mod = 1e9 + 7; void solve() { int a, b, c, d; cin >> a >> b >> c >> d; vector<string> s(50, string(50, D )); for (int i = 0; i < 36; i++) { for (int j = 0; j < 50; j++) { s[i][j] = char( A + (i / 12)); } } a--, b--, c--, d--; for (int i = 1; i < 11; i += 2) { for (int j = 0; j < 50 and b; j += 2, b--) s[i][j] = B ; } for (int i = 13; i < 23; i += 2) { for (int j = 0; j < 50 and c; j += 2, c--) s[i][j] = C ; } for (int i = 25; i < 35; i += 2) { for (int j = 0; j < 50 and d; j += 2, d--) s[i][j] = D ; } for (int i = 37; i < 50; i += 2) { for (int j = 0; j < 50 and a; j += 2, a--) s[i][j] = A ; } cout << 50 << << 50 << n ; for (auto x : s) cout << x << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); ; int T = 1; while (T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int a; int b; cin >> a; cin >> b; if (a != b) { cout << Happy Alex ; return 0; } } cout << Poor Alex ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int T, n, i, j, k; cin >> T; while (T--) { cin >> n; string str[51]; for (i = 0; i < n; i++) { cin >> str[i]; } if (n == 1) { cout << YES << endl; continue; } for (i = n - 1; i >= 0; i--) { for (j = n - 1; j >= 0; j--) { if (str[i][j] == 1 ) { if (i == n - 1 || j == n - 1) str[i][j] = * ; k = n - 1; int c = 0; while (k >= 0) { if (str[k][j] == * ) { c = 1; } else if (str[k][j] == 1 && c == 1) { str[k][j] = * ; } else if (str[k][j] == 0 ) c = 0; k--; } k = n - 1; c = 0; while (k >= 0) { if (str[i][k] == * ) { c = 1; } else if (str[i][k] == 1 && c == 1) { str[i][k] = * ; } else if (str[i][k] == 0 ) c = 0; k--; } } } } for (i = n - 1; i >= 0; i--) { for (j = n - 1; j >= 0; j--) { if (str[i][j] == 1 ) { if (i == n - 1 || j == n - 1) str[i][j] = * ; k = n - 1; int c = 0; while (k >= 0) { if (str[i][k] == * ) { c = 1; } else if (str[i][k] == 1 && c == 1) { str[i][k] = * ; } else if (str[i][k] == 0 ) c = 0; k--; } k = n - 1; c = 0; while (k >= 0) { if (str[k][j] == * ) { c = 1; } else if (str[k][j] == 1 && c == 1) { str[k][j] = * ; } else if (str[k][j] == 0 ) c = 0; k--; } } } } int cnt = 0; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (str[i][j] == 1 ) { cnt++; } } } if (cnt == 0) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long int mod = 1e9 + 7; const long long int mod1 = 998244353; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long int rand(long long int l, long long int r) { uniform_int_distribution<long long int> uid(l, r); return uid(rng); } const long long int N = 2e5 + 5; long long int lazy[4 * N], tr[4 * N]; long long int a[N], b[N], c[N]; void build(long long int nd, long long int s, long long int e) { if (s == e) { tr[nd] = b[s]; return; } long long int m = (s + e) >> 1; build(nd << 1, s, m); build(nd << 1 | 1, m + 1, e); tr[nd] = min(tr[nd << 1], tr[nd << 1 | 1]); } void push_down(long long int nd, long long int s, long long int e) { if (lazy[nd]) { tr[nd] += lazy[nd]; if (s != e) { lazy[nd << 1] += lazy[nd]; lazy[nd << 1 | 1] += lazy[nd]; } lazy[nd] = 0; } } void update(long long int nd, long long int s, long long int e, long long int l, long long int r, long long int x) { push_down(nd, s, e); if (s > r || e < l) return; if (l <= s && e <= r) { lazy[nd] += x; push_down(nd, s, e); return; } long long int m = (s + e) >> 1; update(nd << 1, s, m, l, r, x); update(nd << 1 | 1, m + 1, e, l, r, x); tr[nd] = min(tr[nd << 1], tr[nd << 1 | 1]); } vector<pair<long long int, long long int> > g[N]; void build1(long long int nd, long long int s, long long int e) { if (s == e) { tr[nd] = a[s] + c[s]; return; } long long int m = (s + e) >> 1; build1(nd << 1, s, m); build1(nd << 1 | 1, m + 1, e); tr[nd] = min(tr[nd << 1], tr[nd << 1 | 1]); } void update1(long long int nd, long long int s, long long int e, long long int idx, long long int x) { if (s == e) { a[s] = x; tr[nd] = x + c[s]; return; } long long int m = (s + e) >> 1; if (idx <= m) update1(nd << 1, s, m, idx, x); else update1(nd << 1 | 1, m + 1, e, idx, x); tr[nd] = min(tr[nd << 1], tr[nd << 1 | 1]); } void solve() { long long int n, m, q; cin >> n >> m >> q; for (long long int i = 1; i <= n - 1; i++) { cin >> a[i] >> b[i]; } build(1, 0, n - 1); for (long long int i = 1; i <= m; i++) { long long int x, y, z; cin >> x >> y >> z; g[x].push_back({y, z}); } for (long long int i = 1; i <= n; i++) { for (pair<long long int, long long int> x : g[i]) { update(1, 0, n - 1, 0, x.first - 1, x.second); } c[i] = tr[1]; } build1(1, 1, n); cout << tr[1] << n ; for (long long int i = 1; i <= q; i++) { long long int v, x; cin >> v >> x; update1(1, 1, n, v, x); cout << tr[1] << n ; } } signed main() { ios ::sync_with_stdio(0), cin.tie(0), cout.tie(0); clock_t clk = clock(); long long int t; t = 1; for (long long int i = 1; i <= t; i++) { solve(); } cerr << n << setprecision(10) << fixed << (double)(clock() - clk) / CLOCKS_PER_SEC; return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int a; int b; int idx; int k; int actor; node() {} node(int a, int b, int idx, int k, int actor) : a(a), b(b), idx(idx), k(k), actor(actor) {} }; const int MAXN = (int)1e5 + 5; set<node> s; vector<node> v; int res[MAXN]; bool operator<(const node &x, const node &y) { return x.b < y.b || (x.b == y.b && x.idx < y.idx); } bool comp(const node &x, const node &y) { return x.a < y.a || (x.a == y.a && x.actor > y.actor); } int main(void) { int n, m; int a, b; int c, d, k; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d %d , &a, &b); v.push_back(node(a, b, i, 0, 0)); } scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d %d %d , &c, &d, &k); v.push_back(node(c, d, i, k, 1)); } sort(v.begin(), v.end(), comp); int ok = 1; for (int i = 0; i < (int)v.size(); i++) { a = v[i].a; b = v[i].b; k = v[i].k; int idx = v[i].idx; int actor = v[i].actor; if (actor) { s.insert(v[i]); } else { v[i].idx = 0; set<node>::iterator it = s.lower_bound(v[i]); if (it == s.end()) { ok = 0; } else { node aux = *it; res[idx] = aux.idx; s.erase(it); aux.k--; if (aux.k > 0) { s.insert(aux); } } } } if (ok) { printf( YES n ); for (int i = 0; i < n; i++) { if (i != 0) { printf( ); } printf( %d , res[i]); } } else { printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2005; const int INF = 0x3f3f3f3f; int n, s; int a[maxn << 1], vis[maxn], nxt[maxn << 1][maxn], prv[maxn << 1][maxn], lst[maxn]; int f[maxn][maxn], h[maxn][maxn]; vector<int> g[maxn][maxn]; vector<int> vec; vector<int> pos[maxn]; inline void disC(int p1, int p2, int &nf, vector<int> &ng) { if (p1 > p2) p2 += n; nf += p2 - p1; ng.push_back(p2 - p1); return; } inline void disR(int p1, int p2, int &nf, vector<int> &ng) { if (p1 < p2) p1 += n; nf += p1 - p2; ng.push_back(p2 - p1); return; } inline bool between(int x, int y, int z) { x %= n; y %= n; z %= n; if (z <= x) z += n; if (y < x) y += n; return y > x && y < z; } inline void calcCGB(int p1, int p2, int &nf, vector<int> &ng) { int resf = 0; vector<int> resg; resg.clear(); int to = prv[p1 + n][a[p2]] % n; if (between(p2, to, p1)) { disC(p1, p2, resf, resg); disC(p2, to, resf, resg); disR(to, p2, resf, resg); } else disC(p1, p2, resf, resg); if (resf < nf) nf = resf, ng = resg; return; } inline void calcCBG(int p1, int p2, int &nf, vector<int> &ng) { int resf = 0; vector<int> resg; resg.clear(); int to = nxt[p2][a[p2]] % n; if (between(p2, to, p1)) { disR(p1, to, resf, resg); disC(to, p2, resf, resg); } else disC(p1, p2, resf, resg); if (resf < nf) nf = resf, ng = resg; return; } inline void calcRGB(int p1, int p2, int &nf, vector<int> &ng) { int resf = 0; vector<int> resg; resg.clear(); int to = nxt[p1][a[p2]] % n; if (between(p1, to, p2)) { disR(p1, to, resf, resg); disC(to, p2, resf, resg); } else disR(p1, p2, resf, resg); if (resf < nf) nf = resf, ng = resg; return; } inline void calcRBG(int p1, int p2, int &nf, vector<int> &ng) { int resf = 0; vector<int> resg; resg.clear(); int to = prv[p2 + n][a[p2]] % n; if (between(p1, to, p2)) { disC(p1, to, resf, resg); disR(to, p2, resf, resg); } else disR(p1, p2, resf, resg); if (resf < nf) nf = resf, ng = resg; } inline void calc(int p1, int p2, int &nf, vector<int> &ng) { nf = INF; calcCGB(p1, p2, nf, ng); calcCBG(p1, p2, nf, ng); calcRGB(p1, p2, nf, ng); calcRBG(p1, p2, nf, ng); return; } inline void print(int x) { printf( %c%d n , x < 0 ? - : + , abs(x)); return; } int x, dlt; inline void go(int i, int j) { if (i > 0) go(i - 1, h[i][j]); for (int k = (0); k < (g[i][j].size()); ++k) { int d = (g[i][j][k] < 0 ? -1 : 1), len = abs(g[i][j][k]); for (int l = (0); l <= (len); ++l) { if (a[x] == i && !vis[x]) print(dlt), dlt = 0, vis[x] = true; ((x += d) += n) %= n; dlt += d; } ((x -= d) += n) %= n; (dlt -= d); } return; } int main() { scanf( %d%d , &n, &s); --s; for (int i = (0); i < (n); ++i) { scanf( %d , a + i); vec.push_back(a[i]); } sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end()); int mx = 0; for (int i = (0); i < (n); ++i) { a[i] = lower_bound(vec.begin(), vec.end(), a[i]) - vec.begin(), mx = max(mx, a[i]); pos[a[i]].push_back(i); } for (int i = (0); i < (n); ++i) a[n + i] = a[i]; memset(lst, -1, sizeof(lst)); for (int i = (n << 1) - 1; i >= 0; --i) { for (int j = (0); j <= (mx); ++j) nxt[i][j] = lst[j]; lst[a[i]] = i; } memset(lst, -1, sizeof(lst)); for (int i = (0); i < (n << 1); ++i) { for (int j = (0); j <= (mx); ++j) prv[i][j] = lst[j]; lst[a[i]] = i; } memset(f, 0x3f, sizeof(f)); for (int i = (0); i < (pos[0].size()); ++i) calc(s, pos[0][i], f[0][i], g[0][i]); for (int i = (1); i <= (mx); ++i) for (int j = (0); j < (pos[i].size()); ++j) for (int k = (0); k < (pos[i - 1].size()); ++k) if (f[i - 1][k] != INF) { int nf = 0; vector<int> ng; calc(pos[i - 1][k], pos[i][j], nf, ng); nf += f[i - 1][k]; if (nf < f[i][j]) f[i][j] = nf, g[i][j] = ng, h[i][j] = k; } int best = -1; for (int i = (0); i < (pos[mx].size()); ++i) if (!~best || f[mx][i] < f[mx][best]) best = i; printf( %d n , f[mx][best]); x = s, dlt = 0; go(mx, best); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000005; int a[N], sum[N], f[N], ans[N]; int n, r, c; char ch[N * 6]; int main() { scanf( %d%d%d , &n, &r, &c); for (int i = 1; i <= n; i++) { scanf( %s , ch + sum[i - 1] + 2); a[i] = strlen(ch + sum[i - 1] + 2); sum[i] = sum[i - 1] + 1 + a[i]; } for (int i = 1; i <= n; i++) for (f[i] = max(f[i - 1], i); f[i] <= n && sum[f[i]] - sum[i - 1] - 1 <= c; f[i]++) ; f[n + 1] = n + 1; for (int i = 1; i <= n; i++) ans[i] = i; for (; r; r >>= 1) for (int i = 1; i <= n; i++) { if (r & 1) ans[i] = f[ans[i]]; f[i] = f[f[i]]; } int pos = 1; for (int i = 2; i <= n; i++) if (ans[i] - i > ans[pos] - pos) pos = i; int last = 0; for (int i = pos; i <= ans[pos] - 1; i++) { if (last + a[i] > c) { last = 0; puts( ); } if (last) putchar( ); last += a[i] + 1; printf( %s , ch + sum[i - 1] + 2); } return 0; } |
#include <bits/stdc++.h> inline void in(int &MAGNUS) { scanf( %d , &MAGNUS); } inline void out(int MAGNUS) { printf( %d n , MAGNUS); } inline void in(int &MAGNUS, int &CLAR) { scanf( %d%d , &MAGNUS, &CLAR); } inline void out(int MAGNUS, int CLAR) { printf( %d %d n , MAGNUS, CLAR); } inline void inl(long long &LIV) { scanf( %lld , &LIV); } inline void inl(long long &LIV, long long &MART) { scanf( %lld%lld , &LIV, &MART); } inline void outl(long long LIV) { printf( %lld n , LIV); } inline void outl(long long LIV, long long MART) { printf( %lld %lld n , LIV, MART); } using namespace std; int R; string s, res; vector<string> kata; bool ok(int C) { int r = 1, c = 0; for (int i = 0; i <= (int)kata.size() - 1; i++) { if (kata[i].size() > C) return 0; if (c + (int)kata[i].size() <= C) { c += (int)kata[i].size(); } else { r++; c = 0; c += (int)kata[i].size(); } } return r <= R; } int main() { in(R); getchar(); getline(cin, s); res = ; for (int i = 0; i <= (int)s.size() - 1; i++) { if (s[i] == ) s[i] = . ; res += (char)s[i]; if (!isalpha(s[i])) { kata.push_back(res); res = ; } } kata.push_back(res); int lo = 1, hi = (int)s.size(), ans = 1 << 30; while (lo <= hi) { int mid = (lo + hi) / 2; if (ok(mid)) { hi = mid - 1; ans = mid; } else lo = mid + 1; } out(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; long long int mn, mx, noob; cin >> t; while (t--) { long long int flag = 0; cin >> mn >> mx >> noob; if (mn > mx) swap(mx, mn); if (noob >= mn) { cout << mn << endl; flag = 1; continue; } long long int ans = 0; ans = noob; mn -= noob; mx -= noob; long long int p = (mx - mn); if (p > mn) ans += mn; else { ans += p; mx -= p * 2; mn -= p; ans += (mn + mx) / 3; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 15; const int maxt = 235; const int MOD = 1e9 + 7; inline void upd(int &a, int b) { a += b; if (a >= MOD) a -= MOD; } int n, T; int dp[maxt][1 << maxn][3], t[maxn], g[maxn]; int main() { scanf( %d%d , &n, &T); for (int(i) = (0); (i) <= ((n)-1); (i)++) { scanf( %d%d , t + i, g + i); g[i]--; } for (int(i) = (0); (i) <= ((n)-1); (i)++) dp[t[i]][1 << i][g[i]] = 1; for (int(i) = (1); (i) <= (T - 1); (i)++) for (int(mask) = (0); (mask) <= ((1 << n) - 1); (mask)++) for (int(k) = (0); (k) <= ((n)-1); (k)++) if ((mask & (1 << k)) == 0 && t[k] + i <= T) for (int(j) = (0); (j) <= ((3) - 1); (j)++) if (j != g[k]) upd(dp[i + t[k]][mask | (1 << k)][g[k]], dp[i][mask][j]); int ans = 0; for (int(mask) = (0); (mask) <= ((1 << n) - 1); (mask)++) for (int(i) = (0); (i) <= ((3) - 1); (i)++) upd(ans, dp[T][mask][i]); printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; long long DP[100005][25]; long long arr[100005]; long long l = 1, r, ans; long long freq[100005]; void alter_range(long long l1, long long r1) { while (l1 < l) { ans += freq[arr[l - 1]]; freq[arr[l - 1]]++; l--; } while (r < r1) { ans += freq[arr[r + 1]]; freq[arr[r + 1]]++; r++; } while (l < l1) { ans -= freq[arr[l]] - 1; freq[arr[l]]--; l++; } while (r1 < r) { ans -= freq[arr[r]] - 1; freq[arr[r]]--; r--; } } void make_layer(long long layer, long long l1, long long r1, long long a, long long b) { if (l1 > r1) return; long long i, j, mid = (l1 + r1) >> 1, &curr = DP[mid][layer], best = mid; for (i = a; i <= min(b, mid); i++) { alter_range(i, mid); if (curr > DP[i - 1][layer - 1] + ans) { curr = DP[i - 1][layer - 1] + ans; best = i; } } make_layer(layer, l1, mid - 1, a, best); make_layer(layer, mid + 1, r1, best, b); } int main() { long long i, j, n, k; scanf( %lld %lld , &n, &k); for (i = 1; i <= n; i++) scanf( %lld , &arr[i]); for (i = 0; i <= n; i++) for (j = 0; j <= k; j++) DP[i][j] = 1e18; DP[0][0] = 0; for (i = 1; i <= k; i++) { make_layer(i, 1, n, 1, n); } printf( %lld n , DP[n][k]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e5; long long aa[N + 2], bb[N + 2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long k1, k2, k3; cin >> k1 >> k2 >> k3; long long t1, t2, t3; cin >> t1 >> t2 >> t3; long long n; cin >> n; for (long long i = 1; i <= n; i++) cin >> aa[i], bb[i] = aa[i]; multiset<long long> st; vector<long long> v; for (long long i = 1; i <= n; i++) { while (true) { if (st.size() == 0) break; long long x = *st.begin(); if (x < aa[i]) st.erase(st.find(x)); else break; } if (st.size() < k1) { st.insert(aa[i] + t1 - 1); v.push_back(aa[i] + t1); } else { long long x = *st.begin(); st.erase(st.find(x)); st.insert(x + t1); v.push_back(x + t1 + 1); } } for (long long i = 1; i <= n; i++) aa[i] = v[i - 1]; v.clear(); st.clear(); for (long long i = 1; i <= n; i++) { while (true) { if (st.size() == 0) break; long long x = *st.begin(); if (x < aa[i]) st.erase(st.find(x)); else break; } if (st.size() < k2) { st.insert(aa[i] + t2 - 1); v.push_back(aa[i] + t2); } else { long long x = *st.begin(); st.erase(st.find(x)); st.insert(x + t2); v.push_back(x + t2 + 1); } } for (long long i = 1; i <= n; i++) aa[i] = v[i - 1]; v.clear(); st.clear(); for (long long i = 1; i <= n; i++) { while (true) { if (st.size() == 0) break; long long x = *st.begin(); if (x < aa[i]) st.erase(st.find(x)); else break; } if (st.size() < k3) { st.insert(aa[i] + t3 - 1); v.push_back(aa[i] + t3); } else { long long x = *st.begin(); st.erase(st.find(x)); st.insert(x + t3); v.push_back(x + t3 + 1); } } for (long long i = 1; i <= n; i++) aa[i] = v[i - 1]; v.clear(); st.clear(); long long mx = 0; for (long long i = 1; i <= n; i++) mx = max(mx, aa[n] - bb[n]); cout << mx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int main() { int n; scanf( %d , &n); int q = n / 3; int r = n % 3; if (r > 0) { printf( %d , 2 * q + 1); } else { printf( %d , 2 * q); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[31] = {4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645}; int main() { scanf( %d , &n); printf( %d , a[n - 1]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long T, n; long long getFirst(long long n) { long long cur = 4; while (n > cur) { n -= cur; cur *= 4; } return cur + n - 1; } long long getSecond(long long n) { long long cur = 4; while (n > cur) { n -= cur; cur *= 4; } n--; vector<long long> d; while (n) { d.push_back(n % 4); n /= 4; } long long f[4] = {0, 2, 3, 1}; reverse(d.begin(), d.end()); for (auto i : d) n = n * 4ll + f[i]; return 2ll * cur + n; } long long getThird(long long n) { return getFirst(n) ^ getSecond(n); } int init() { scanf( %lld , &n); if (n <= 3) return printf( %lld n , n), 0; if (n % 3 == 1) return printf( %lld n , getFirst(n / 3)); if (n % 3 == 2) return printf( %lld n , getSecond(n / 3)); return printf( %lld n , getThird(n / 3 - 1)); } int main() { scanf( %lld , &T); while (T--) init(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long k, a[1200000]; int n; int main() { cin >> a[0] >> k; n = 0; while ((a[n] >= k) || (a[n] < 0)) { if (a[n] >= k) { long long x = a[n] / k; a[n] -= k * x; a[++n] = -x; } else { long long x = (-a[n] + k - 1) / k; a[n] += k * x; a[++n] = x; } } cout << n + 1 << endl; for (int i = 0; i <= n; i++) cout << a[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0, ans1 = 0, ans2 = 0, tar; cin >> n; tar = n / 3; string s; cin >> s; for (int i = 0; i < n; i++) { int val = s[i] - 0 ; if (val == 0) ans++; else if (val == 1) ans1++; else ans2++; } for (int i = 0; tar > ans; i++) { if (i == n) break; if (s[i] == 1 and tar < ans1) { s[i] = 0 ; ans++; ans1--; continue; } if (s[i] == 2 and tar < ans2) { s[i] = 0 ; ans++; ans2--; continue; } } for (int i = n - 1; (tar < ans1) and ans2 < tar; i--) { if (i < 0) break; if (s[i] == 1 ) { s[i] = 2 ; ans2++; ans1--; } } for (int i = n - 1; (tar < ans) and ans2 < tar; i--) { if (i < 0) break; if (s[i] == 0 ) { s[i] = 2 ; ans2++; ans--; } } for (int i = 0; (tar < ans2) and ans1 < tar; i++) { if (i == n) break; if (s[i] == 2 ) { s[i] = 1 ; ans1++; ans2--; } } for (int i = n - 1; (tar < ans) and ans1 < tar; i--) { if (i < 0) break; if (s[i] == 0 ) { s[i] = 1 ; ans1++; ans--; } } cout << s << endl; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-8; inline int sign(double x) { if (x < -eps) return -1; return x > eps; } struct Tpoint { double x, y; Tpoint() {} Tpoint(double x, double y) : x(x), y(y) {} inline double norm() { return sqrt(x * x + y * y); } inline void rotate(double ang) { double co = cos(ang), si = sin(ang); double tx = x, ty = y; x = tx * co - ty * si; y = tx * si + ty * co; } }; inline Tpoint operator+(const Tpoint &a, const Tpoint &b) { return Tpoint(a.x + b.x, a.y + b.y); } inline Tpoint operator-(const Tpoint &a, const Tpoint &b) { return Tpoint(a.x - b.x, a.y - b.y); } inline Tpoint operator*(const Tpoint &a, const double &b) { return Tpoint(a.x * b, a.y * b); } inline Tpoint operator/(const Tpoint &a, const double &b) { return Tpoint(a.x / b, a.y / b); } inline double det(const Tpoint &a, const Tpoint &b) { return a.x * b.y - a.y * b.x; } inline double dot(const Tpoint &a, const Tpoint &b) { return a.x * b.x + a.y * b.y; } const int dx[] = {-1, -1, 1, 1}; const int dy[] = {-1, 1, -1, 1}; int main() { int n, m, x, y; scanf( %d%d , &n, &m); char sdir[100]; scanf( %d%d%s , &x, &y, sdir); int dir = 0; if (sdir[0] == D ) { dir |= 2; } if (sdir[1] == R ) { dir |= 1; } int target = 0; for (int i = 1; i <= n; ++i) { if ((i + 1) % 2 == (x + y) % 2) { ++target; } if ((i + m) % 2 == (x + y) % 2) { ++target; } } for (int i = 2; i < m; ++i) { if ((i + 1) % 2 == (x + y) % 2) { ++target; } if ((i + n) % 2 == (x + y) % 2) { ++target; } } set<pair<int, int> > visit; long long total_time = 1; for (int t = 0; t < (n + m) * 4; ++t) { visit.insert(make_pair(x, y)); if ((int)visit.size() == target) { printf( %I64d n , total_time); return 0; } int l = 0, r = max(n, m) + 1; while (l + 1 < r) { int mid = (l + r) / 2; int xx = x + dx[dir] * mid; int yy = y + dy[dir] * mid; if (xx >= 1 && xx <= n && yy >= 1 && yy <= m) { l = mid; } else { r = mid; } } total_time += l; x += dx[dir] * l; y += dy[dir] * l; if (x == 1 || x == n) { dir ^= 2; } if (y == 1 || y == m) { dir ^= 1; } if (x == 1 && y == 1) { dir = 3; } else if (x == 1 && y == m) { dir = 2; } else if (x == n && y == 1) { dir = 1; } else if (x == n && y == m) { dir = 0; } } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int fs[43][2], d[20], dp[20][10], r[20][10], from[20][10]; vector<int> pos; int main() { memset((fs), -1, sizeof((fs))); for (int i = 0; i <= 6; i++) for (int j = 0; i + j <= 6; j++) { fs[i * 7 + j * 4][0] = i; fs[i * 7 + j * 4][1] = j; } for (int i = 0; i <= 42; i++) { if (fs[i][0] != -1) pos.push_back(i); } int ___T, case_n = 1; scanf( %d , &___T); while (___T-- > 0) { long long n; cin >> n; for (int i = 0; i < 20; i++) { d[i] = n % 10; n /= 10; } memset((dp), -1, sizeof((dp))); memset((r), 0, sizeof((r))); dp[0][0] = 0; for (int i = 0; i < 19; i++) { for (int j = 0; j < 10; j++) { if (dp[i][j] != -1) { for (int k = 0; k < ((int)(pos).size()); k++) { if (pos[k] % 10 == (d[i] - j + 100) % 10) { dp[i + 1][(j + pos[k]) / 10] = k; from[i + 1][(j + pos[k]) / 10] = j; } } } } } if (dp[19][0] != -1) { int x = 19, y = 0; while (x) { int v = pos[dp[x][y]]; int cnt = 0; for (int i = 0; i < fs[v][0]; i++) r[x - 1][cnt++] = 7; for (int i = 0; i < fs[v][1]; i++) r[x - 1][cnt++] = 4; y = from[x][y]; x--; } for (int i = 0; i < 6; i++) { long long tmp = 0; for (int j = 18; j >= 0; j--) tmp = tmp * 10 + r[j][i]; if (i) printf( ); cout << tmp; } puts( ); } else puts( -1 ); } return 0; } |
#include <bits/stdc++.h> int main(void) { int i, j, n, k, c = 0; int a[100]; scanf( %d%d , &n, &k); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { if (a[i] <= k) { c++; } else break; } for (i = n - 1; i >= 0; i--) { if (a[i] <= k) { c++; } else break; } if (c > n) c = n; printf( %d n , c); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long b; while (cin >> b) { long long ans = 0; long long i; for (i = 1; i * i < b; i++) { if (b % i == 0) ans += 2; } if (i * i == b) ans++; cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, ans = 0, sum = 0, sum2 = 0; cin >> n; int a[n + 1]; a[0] = 0; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a, a + (n + 1)); for (int i = 1; i <= n; i++) { sum = (sum, a[i]); sum2++; if ((ans + sum2) >= sum) { ans += sum2; sum2 = 0; } } cout << ans + 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; int a[100000]; int n, k; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); int l = 0, r = n; while (r - l > 1) { int m = (l + r) / 2; if ((long long)k > (long long)m * (m + 1) / 2) l = m; else r = m; } printf( %d , a[k - l * (l + 1) / 2 - 1]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, i, j, v, bor[100005][27], a[100005], b[100005]; string s; void dfs(int v) { int q = 0; int u = 0; int t = 0; for (int i = 1; i < 27; i++) { if (bor[v][i] > 0) { q = 1; dfs(bor[v][i]); if (a[bor[v][i]] == 0) u = 1; if (b[bor[v][i]] == 0) t = 1; } } if (q == 0) { a[v] = 0; b[v] = 1; } if (u == 1) a[v] = 1; if (t == 1) b[v] = 1; } int main() { cin >> n >> m; k = 1; for (i = 1; i <= n; i++) { cin >> s; v = 1; for (j = 0; j < s.length(); j++) { int to = s[j] - 96; if (bor[v][to] > 0) v = bor[v][to]; else { k++; bor[v][to] = k; v = k; } } } dfs(1); if (a[1] == 1 && b[1] == 1) cout << First ; else if (a[1] == 1 && b[1] == 0 && (m % 2 == 1)) cout << First ; else cout << Second ; } |
#include <bits/stdc++.h> using namespace std; int ls[2005], rs[2005], fa[2005], sz[2005], z[2005]; int id, n, m, rt, mn, Sz; char s[10]; void getrt(int x, int F) { sz[x] = 1; int mx = 0; if (ls[x] && ls[x] != F && !z[ls[x]]) { getrt(ls[x], x); sz[x] += sz[ls[x]]; if (sz[ls[x]] > mx) mx = sz[ls[x]]; } if (rs[x] && rs[x] != F && !z[rs[x]]) { getrt(rs[x], x); sz[x] += sz[rs[x]]; if (sz[rs[x]] > mx) mx = sz[rs[x]]; } if (fa[x] && fa[x] != F && !z[fa[x]]) { getrt(fa[x], x); sz[x] += sz[fa[x]]; if (sz[fa[x]] > mx) mx = sz[fa[x]]; } if (Sz - sz[x] > mx) mx = Sz - sz[x]; if (mx < mn || (mx == mn && x > rt)) mn = mx, rt = x; } int getsz(int x, int F) { sz[x] = 1; if (ls[x] && ls[x] != F && !z[ls[x]]) sz[x] += getsz(ls[x], x); if (rs[x] && rs[x] != F && !z[rs[x]]) sz[x] += getsz(rs[x], x); if (fa[x] && fa[x] != F && !z[fa[x]]) sz[x] += getsz(fa[x], x); return sz[x]; } int getleaf(int x) { return x <= n ? x : getleaf(ls[x]); } void dfs(int x) { z[x] = 1; if (x <= n) { m++; if (ls[fa[x]] == x) ls[fa[x]] = m; else rs[fa[x]] = m; fa[m] = fa[x]; fa[x] = m; fa[id] = m; ls[m] = x; rs[m] = id; return; } int a1 = getleaf(ls[x]); int a2 = getleaf(rs[x]); printf( %d %d %d n , a1, a2, id); fflush(stdout); scanf( %s , s); char ch = s[0]; if (ch == X ) { if (z[fa[x]] || !fa[x]) { m++; if (fa[x]) { if (ls[fa[x]] == x) ls[fa[x]] = m; else rs[fa[x]] = m; fa[m] = fa[x]; } fa[x] = m; fa[id] = m; ls[m] = x; rs[m] = id; return; } Sz = getsz(fa[x], 0); mn = 1e9; getrt(fa[x], 0); dfs(rt); } if (ch == Y ) { if (z[rs[x]]) { m++; fa[rs[x]] = fa[id] = m; ls[m] = rs[x]; rs[m] = id; rs[x] = m; fa[m] = x; return; } Sz = getsz(rs[x], 0); mn = 1e9; getrt(rs[x], 0); dfs(rt); } if (ch == Z ) { if (z[ls[x]]) { m++; fa[ls[x]] = fa[id] = m; ls[m] = ls[x]; rs[m] = id; ls[x] = m; fa[m] = x; return; } Sz = getsz(ls[x], 0); mn = 1e9; getrt(ls[x], 0); dfs(rt); } } int main() { scanf( %d , &n); m = n; m++; ls[m] = 1; rs[m] = 2; fa[1] = fa[2] = m; for (id = 3; id <= n; id++) { memset(z, 0, sizeof(z)); Sz = 2 * id - 3; mn = 1e9; getrt(1, 0); dfs(rt); } puts( -1 ); for (int i = 1; i <= m; i++) printf( %d , fa[i] ? fa[i] : -1); } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.