func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string rat[100], cw[100], man[100], c; int a = 0, b = 0, d = 0; for (int i = 0; i < n; i++) { string name, s; cin >> name >> s; if (s == captain ) c = name; else if (s == woman || s == child ) { cw[a] = name; a++; } else if (s == rat ) { rat[b] = name; b++; } else if (s == man ) { man[d] = name; d++; } else if (s == captain ) c = name; } for (int i = 0; i <= b; i++) { if (i == b) cout << rat[i]; else cout << rat[i] << endl; } for (int i = 0; i <= a; i++) { if (i == a) cout << cw[i]; else cout << cw[i] << endl; } for (int i = 0; i <= d; i++) { if (i == d) cout << man[i]; else cout << man[i] << endl; } cout << c << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; int p[2010] = {0}; int cnt = 0; int sum[2010]; int dp[2010]; int a[200010]; int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); sort(a + 1, a + n + 1); n = min(n, k); for (int i = 1, x, y; i <= m; ++i) { scanf( %d%d , &x, &y); if (x > k) continue; p[x] = max(p[x], y); } sum[0] = 0; for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + a[i]; memset(dp, 0x3f3f3f3f, sizeof dp); dp[0] = 0; for (int i = 1; i <= k; ++i) { for (int j = 0; j < i; ++j) { dp[i] = min(dp[i], dp[j] + sum[i] - sum[j + p[i - j]]); } } printf( %d n , dp[k]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, min = INT_MAX, count = 0; int arr[1000001]; int j; cin >> n; for (j = 0; j < n; j++) cin >> arr[j]; sort(arr, arr + n); int i, diff; for (i = 0; i < n - 1; i++) { j = i + 1; diff = arr[j] - arr[i]; if (diff < 0) diff = -diff; if (diff < min) { min = diff; count = 1; } else if (diff == min) count++; } cout << min << << count; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; using namespace std; int num[1001]; long long n; long long check(long long k) { long long p = 0, v = 0; long long t = n; while (t) { if (t >= k) { p += k; t -= k; } else { p += t; t = 0; } v += t / 10; t -= t / 10; } if (v <= p) return 1; else return 0; } int main() { cin >> n; long long l = 1; long long r = 1e18; long long ans = 0; while (l <= r) { long long mid = (l + r) / 2; if (check(mid)) { ans = mid; r = mid - 1; } else { l = mid + 1; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; const int mod = 1e9 + 7; int n, m, d, k, x, ans, pos[N], a[30]; bool f[1 << 20]; int cal(int x) { int res = 0; for (int i = (0); i < (m); i++) if (x & (1 << i)) res++; return res; } int main() { scanf( %d%d%d , &n, &m, &d); for (int i = (0); i < (m); i++) { scanf( %d , &k); for (int j = (0); j < (k); j++) { scanf( %d , &x); pos[x] = i; } } for (int i = (1); i < (d + 1); i++) a[pos[i]]++; for (int i = (d); i < (n + 1); i++) { if (i > d) a[pos[i]]++, a[pos[i - d]]--; ; x = 0; for (int j = (0); j < (m); j++) if (!a[j]) x += (1 << j); f[x] = 1; } ans = m; for (int i = (1 << m) - 1; i >= 1; i--) { if (f[i]) { for (int j = (0); j < (m); j++) if ((1 << j) & i) { f[i - (1 << j)] = 1; } } else ans = min(ans, cal(i)); } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const int MOD = 1e9 + 7; int add(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; } int mul(int a, int b) { return 1ll * a * b % MOD; } int n, x[N], y[N]; vector<int> g[N]; map<int, int> px, py; int far[N], cnt, cir; void dfs(int u, int fa) { if (!px.count(x[u])) cnt++; px[x[u]] = u; if (!py.count(y[u])) cnt++; py[y[u]] = u; for (auto v : g[u]) { if (v == fa) continue; if (~far[v]) { cir = 1; continue; } far[v] = u; dfs(v, u); } } int pw2[N * 2]; void solve() { for (int i = (0); i < (n); ++i) g[i].clear(); px.clear(); py.clear(); for (int i = (0); i < (n); ++i) { int &x = ::x[i], &y = ::y[i]; scanf( %d%d , &x, &y); if (px.count(x)) { int j = px[x]; g[i].push_back(j); g[j].push_back(i); } px[x] = i; if (py.count(y)) { int j = py[y]; g[i].push_back(j); g[j].push_back(i); } py[y] = i; } int ans = 1; fill_n(far, n, -1); pw2[0] = 1; for (int i = (1); i < (2 * n + 1); ++i) pw2[i] = add(pw2[i - 1], pw2[i - 1]); for (int i = (0); i < (n); ++i) if (!~far[i]) { px.clear(); py.clear(); far[i] = cnt = cir = 0; dfs(i, -1); ans = mul(ans, pw2[cnt] - !cir); } printf( %d n , ans); } int main() { while (~scanf( %d , &n)) solve(); return 0; } |
#include <bits/stdc++.h> int a, b, yue[100000], l[10100], h[10100], p[10100], ans[10100], gs, c, n; void qsort(int x, int y) { int i, j, t, mid; i = x; j = y; mid = yue[(i + j) / 2]; do { while (yue[i] < mid) i++; while (yue[j] > mid) j--; if (i <= j) { t = yue[i]; yue[i] = yue[j]; yue[j] = t; i++; j--; } } while (i <= j); if (i < y) qsort(i, y); if (x < j) qsort(x, j); } void qsort1(int x, int y) { int i, j, t, mid; i = x; j = y; mid = h[(i + j) / 2]; do { while (h[i] > mid) i++; while (h[j] < mid) j--; if (i <= j) { t = h[i]; h[i] = h[j]; h[j] = t; t = l[i]; l[i] = l[j]; l[j] = t; t = p[i]; p[i] = p[j]; p[j] = t; i++; j--; } } while (i <= j); if (i < y) qsort1(i, y); if (x < j) qsort1(x, j); } int gcd(int a, int b) { if (a > b) { int t; t = a; a = b; b = t; } if (a == 0) return b; else return gcd(b % a, a); } int main() { int i, j; while (scanf( %d %d , &a, &b) != EOF) { c = gcd(a, b); for (i = 1; i * i <= c; i++) if (c % i == 0) { gs++; yue[gs] = i; gs++; yue[gs] = c / i; } qsort(1, gs); scanf( %d , &n); for (i = 0; i < n; i++) { p[i] = i; scanf( %d %d , &l[i], &h[i]); } qsort1(0, n - 1); j = gs; for (i = 0; i < n; i++) { while (yue[j] > h[i]) j--; if (yue[j] < l[i]) ans[p[i]] = -1; else ans[p[i]] = yue[j]; } for (i = 0; i < n; i++) printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; string s; cin >> s; map<char, int> mp; for (auto it : s) { mp[it]++; } int ans = 1; for (int i = 1; i * i <= k; i++) { if (k % i == 0) { int fact1 = i, fact2 = k / i; for (int j = fact1; j <= n; j += fact1) { int x = 0; for (auto it : mp) x += (it.second / (j / fact1)); if (x >= fact1) ans = max(ans, j); } for (int j = fact2; j <= n; j += fact2) { int x = 0; for (auto it : mp) x += (it.second / (j / fact2)); if (x >= fact2) ans = max(ans, j); } } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long nxt[45][3], lnk[45], pre[45][3]; string s; long long n; pair<long long, long long> sh[45][45][2]; long long dp[41][41][41][41][2]; long long sol(long long i, long long pre, long long l, long long r, long long f = 0) { if (pre == s.size()) f = 1; if (r - l + 1 == s.size()) f = 1; if (i == n) { if (f) return 1; string final; if (pre) final = s.substr(0, pre); if (r - l + 1) final += s.substr(l, r - l + 1); if (final.find(s) != string::npos) { return 1; } return 0; } if (~dp[i][pre][l][r][f]) return dp[i][pre][l][r][f]; if (r - l + 1 == i) dp[i][pre][l][r][f] = sol(i + 1, nxt[pre][0], sh[l][r][0].first, sh[l][r][0].second, f) + sol(i + 1, nxt[pre][1], sh[l][r][1].first, sh[l][r][1].second, f); else dp[i][pre][l][r][f] = sol(i + 1, nxt[pre][0], l, r, f) + sol(i + 1, nxt[pre][1], l, r, f); return dp[i][pre][l][r][f]; } void solve() { cin >> n; cin >> s; for (long long i = 0; i < s.size(); i++) { if (i > 1) { lnk[i] = nxt[lnk[i - 1]][s[i - 1] - 0 ]; } for (long long j = 0; j < 2; j++) { if (s[i] == j + 0 ) nxt[i][j] = i + 1; else if (i > 0) { nxt[i][j] = nxt[lnk[i]][j]; } } } for (long long i = 0; i < s.size(); i++) { for (long long j = 0; j < s.size(); j++) { for (long long k = 0; k < 2; k++) { string pt; if (j >= i) pt += s.substr(i, j - i + 1); pt.push_back(k + 0 ); long long x = s.find(pt); if (x != string::npos) sh[i][j][k] = {x, x + j - i + 1}; else sh[i][j][k] = {i, j}; } } } if (s.size() == 1) { long long x = s.back() - 0 ; sh[1][0][x] = {0, 0}; sh[1][0][!x] = {1, 0}; } memset(dp, -1, sizeof dp); cout << sol(0, 0, 1, 0, 0) << endl; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1010]; int main() { int n, m; cin >> n >> m; int tmp; int ans = 0; memset(a, 0, sizeof(a)); for (int i = 1; i <= m; i++) { cin >> tmp; a[tmp]++; int b = 1; for (int i = 1; i <= n; i++) if (!a[i]) b = 0; if (b) { ans++; for (int i = 1; i <= m; i++) a[i]--; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, q, x, y, cnt = 0; cin >> n >> q; vector<vector<long long int>> dp(3, vector<long long int>(n + 2, 0)); while (q--) { cin >> x >> y; if (dp[x][y] == 0) { cnt += (dp[3 - x][y] == 1); cnt += (dp[3 - x][y - 1] == 1); cnt += (dp[3 - x][y + 1] == 1); dp[x][y] = 1; } else { cnt -= (dp[3 - x][y] == 1); cnt -= (dp[3 - x][y - 1] == 1); cnt -= (dp[3 - x][y + 1] == 1); dp[x][y] = 0; } if (cnt == 0) cout << Yes << n ; else cout << No << n ; } } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; long long ans = 0; priority_queue<int, vector<int>, greater<int>> pq; while (n--) { int x; cin >> x; if (pq.size() && x > pq.top()) { ans += x - pq.top(); pq.pop(); pq.push(x); } pq.push(x); } cout << ans; return 0; } |
#include <bits/stdc++.h> int main() { int n, k; int h[1001] = {0}; scanf( %d%d , &n, &k); int i, j; for (i = 1; i <= n; i++) scanf( %d , &h[i]); int min = 9999999, nn = 1; for (i = 1; i <= n; i++) { if (h[i] < 1 + k * (i - 1)) continue; int ans = 0; for (j = 1; j <= n; j++) if (h[j] != h[i] + k * (j - i)) ans++; if (ans < min) { min = ans; nn = i; } if (min == 0) break; } printf( %d n , min); for (i = 1; i <= n; i++) { if (h[i] > h[nn] + k * (i - nn)) printf( - %d %d n , i, h[i] - h[nn] - k * (i - nn)); else if (h[i] < h[nn] + k * (i - nn)) printf( + %d %d n , i, h[nn] + k * (i - nn) - h[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; vector<int> v(2 * n); for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < 2 * n; i++) { if (i >= n) { v[i] = a[i - n]; } else v[i] = a[i]; } int ans = 0, cnt = 0; for (int i = 0; i < 2 * n; i++) if (v[i] == 1) { cnt++; ans = max(ans, cnt); } else cnt = 0; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); int m; scanf( %d , &m); string s; int val, ans = 0; vector<int> u, p; for (int i = 0; i < int(m); i++) { cin >> val >> s; if (s[0] == U ) u.push_back(val); else p.push_back(val); } long long sum = 0; sort(u.begin(), u.end()); sort(p.begin(), p.end()); int i = 0; while (i < int(u.size()) && a) { sum += u[i]; i++; a--; ans++; } int j = 0; while (j < int(p.size()) && b) { sum += p[j]; j++; b--; ans++; } while (i < int(u.size()) || j < int(p.size())) { if (!c) break; c--; ans++; if (i == int(u.size())) sum += p[j++]; else if (j == int(p.size())) sum += u[i++]; else { if (u[i] < p[j]) sum += u[i++]; else sum += p[j++]; } } cout << ans << << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5, maxm = 1e5 + 5; int first[maxn], n, k; struct edge { int to; int next; } E[maxm]; int vis[maxn]; int order[maxn], p; int a[maxn]; bool dfs(int u) { vis[u] = -1; for (int e = first[u]; e != -1; e = E[e].next) { int v = E[e].to; if (vis[v] == -1) return false; else if (!vis[v] && !dfs(v)) return false; } vis[u] = 1; order[p++] = u; return true; } bool topo() { p = 0; memset(vis, 0, sizeof(vis)); for (int i = 0; i < k; i++) if (!vis[a[i]] && !dfs(a[i])) return false; return true; } int main() { while (scanf( %d%d , &n, &k) != EOF) { memset(first, -1, sizeof(first)); for (int i = 0; i < k; i++) scanf( %d , &a[i]); int t, x, ecnt = 0; for (int i = 1; i <= n; i++) { scanf( %d , &t); for (int j = 0; j < t; j++) { scanf( %d , &x); E[ecnt].to = x; E[ecnt].next = first[i]; first[i] = ecnt++; } } if (!topo()) cout << -1 n ; else { cout << p << n ; for (int i = 0; i < p; i++) cout << order[i] << n [i == p - 1]; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, q, cnt, f[400005]; int fnd(int x) { return f[x] == 0 ? x : f[x] = fnd(f[x]); } int main() { scanf( %d%d%d , &n, &m, &q); cnt = n + m - 1; for (int i = 1, x, y; i <= q; i++) { scanf( %d%d , &x, &y); y += n; x = fnd(x); y = fnd(y); if (x != y) { cnt--; f[x] = y; } } printf( %d n , cnt); return 0; } |
#include <bits/stdc++.h> int main() { int n, m, a; scanf( %d%d%d , &n, &m, &a); printf( %I64d n , ((n - 1LL) / a + 1) * ((m - 1) / a + 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 2e5 + 10; const int INF = 0x3f3f3f3f; const int mod = 998244353; struct node { int dif; long long need; bool operator<(const node &f) const { if (f.need != need) return f.need > need; else return f.dif > dif; } } pro[M]; long long ans[M]; int main() { int t; scanf( %d , &t); while (t--) { memset(ans, 0, sizeof(ans)); long long n, t, a, b; scanf( %lld%lld%lld%lld , &n, &t, &a, &b); long long simple = 0; for (int i = 1; i <= n; i++) { scanf( %d , &pro[i].dif); if (!pro[i].dif) simple++; } for (int i = 1; i <= n; i++) scanf( %lld , &pro[i].need); sort(pro + 1, pro + n + 1); long long time = 0; if (pro[1].need) ans[0] = min(simple, (pro[1].need - 1) / a); for (int i = 1; i <= n; i++) { if (pro[i].dif) time += b; else simple--, time += a; if (simple == 0 || i == n) break; ans[i] = min(simple, (pro[i + 1].need - time - 1) / a); } time = 0; long long cnt = ans[0]; for (int i = 1; i <= n; i++) { time += pro[i].dif == 0 ? a : b; if (time > t) break; else { if (time < pro[i + 1].need || i == n) { cnt = max(cnt, i + ans[i]); } } } printf( %lld n , cnt); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m, k; cin >> n >> m >> k; map<int, bool> mp; for (int i = 0; i < m; i++) { int x; cin >> x; mp[x] = 1; } int pos = 1; int ans = -1; if (mp[pos]) { cout << 1; return 0; } for (int i = 0; i < k; i++) { int x, y; cin >> x >> y; if (pos == x or pos == y) { if (pos != x) pos = x; else pos = y; if (mp[pos]) { cout << pos; return 0; } } } cout << pos; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010, maxm = maxn * 2; int h[maxn], ne[maxm], e[maxm], cnt; int d[maxn], dp[maxn][3], w[maxn], root; int a[maxn]; int vis[maxn]; void solve() { int T; scanf( %d , &T); while (T--) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i < n; i += 2) { cout << -a[i + 1] << << a[i] << ; } cout << endl; } return; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFLL = 1e18; const int MOD = 1e9 + 7; const int MAXN = 2e5 + 5; vector<int> G[MAXN]; int n; long long s[MAXN]; long long a[MAXN]; void dfs(int v, int p) { if (s[v] == -1) { long long aux = INF; for (auto u : G[v]) if (u != p) { aux = min(aux, s[u]); } if (aux == -1 || aux - s[p] < 0) { a[v] = -1; return; } if (aux == INF) { a[v] = 0; return; } a[v] = aux - s[p]; s[v] = a[v] + s[p]; } else { if (p == v) a[v] = s[v]; else a[v] = s[v] - s[p]; } for (auto u : G[v]) if (u != p) dfs(u, v); } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x; scanf( %d , &x); x--; G[x].push_back(i); G[i].push_back(x); } for (int i = 0; i < n; i++) scanf( %lld , &s[i]); dfs(0, 0); long long ans = 0; for (int i = 0; i < n; i++) { if (a[i] < 0) { printf( -1 n ); return 0; } ans += a[i]; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-6; const int INF = 0x3fffffff; const long long LINF = INF * 1ll * INF; const double PI = acos(-1.0); using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long d[400005]; long long a, b, k, lcm; long long bfs(long long a, long long target) { queue<int> q; memset(d, -1, sizeof(d)); q.push(a); d[a] = 0; while (!q.empty()) { int st = q.front(); q.pop(); for (int i = 2; i <= k; i++) { if (st % i == 0) continue; int tmp = st - st % i; if (tmp < 0) tmp += lcm; if (d[tmp] <= 0) { d[tmp] = d[st] + 1; q.push(tmp); } } int tmp = st - 1; if (tmp < 0) tmp += lcm; if (d[tmp] <= 0) { d[tmp] = d[st] + 1; q.push(tmp); } } return d[target]; } int main(void) { cin >> a >> b >> k; lcm = 1; for (int i = 2; i <= k; i++) lcm = lcm / gcd(lcm, i) * i; long long ans = 0; if (a / lcm == b / lcm) { if (a % lcm != b % lcm) ans = bfs(a % lcm, b % lcm); } else { if (a % lcm) ans += bfs(a % lcm, 0); if (b % lcm) ans += bfs(0, b % lcm); ans += (a / lcm - b / lcm - 1) * bfs(0, 0); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; t = 1; while (t--) { int n, k, mx = 0, mn = 101, j; cin >> n >> k; int a[n]; for (int i = 0; i < n; i += 1) { cin >> a[i]; mx = max(mx, a[i]); mn = min(mn, a[i]); } if (mx - mn > k) cout << NO ; else { cout << YES << n ; for (int i = 0; i < n; i += 1) { for (j = 0; j < a[i] - 1; j++) { cout << (j % k) + 1 << ; } cout << (j % k) + 1 << n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string a[100]; int m[100][26]; bool s1[100]; string makestr(string s1, string s2) { char w = * ; string make = ; int s[26]; for (int i = 0; i < 26; ++i) s[i] = 0; for (int i = 0; i < s1.length(); ++i) s[int(s1[i]) - 97] = 1; for (int i = 0; i < s2.length(); ++i) { if (s[int(s2[i]) - 97] == 1) { w = s2[i]; break; } } if (w == * ) return s1 + s2; else { int pref1 = 0; int pref2 = 0; while (s1[pref1] != w) ++pref1; while (s2[pref2] != w) ++pref2; if (pref1 < pref2) { swap(s1, s2); swap(pref1, pref2); } for (int i = 0; i < s1.length(); ++i) { make += s1[i]; } if (s2.length() - pref2 > s1.length() - pref1) { for (int i = pref2 + s1.length() - pref1; i < s2.length(); ++i) make += s2[i]; } return make; } } string dfs(string st) { int u[26]; for (int i = 0; i < 26; ++i) u[i] = 0; for (int i = 0; i < st.length(); ++i) u[int(st[i]) - 97] = 1; for (int i = 1; i < n; ++i) { if (s1[i]) { for (int j = 0; j < 26; ++j) if (m[i][j] && u[j]) { st = makestr(st, a[i]); s1[i] = false; st = dfs(st); } } } return st; } int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; s1[i] = true; } for (int i = 0; i < n; ++i) { string st = a[i]; for (int j = 0; j < st.length(); ++j) { m[i][int(st[j] - 97)] = 1; } } string st = dfs(a[0]); for (int i = 1; i < n; ++i) { if (s1[i]) { st = makestr(st, dfs(a[i])); } } cout << st; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; vector<int> v[1000]; map<vector<int>, int> mp; const int N = 495; int dp[N * N]; int ns[10][10]; vector<int> from[N * N]; int deg[N * N]; void solve(int i, int j) { vector<int>& v1 = v[i]; vector<int>& v2 = v[j]; for (int a = 1; a <= 4; ++a) if (v1[a]) { for (int b = 1; b <= 4; ++b) if (v2[b]) { v1[a] -= 1; v1[ns[a][b]] += 1; int s = mp[v1]; v1[a] += 1; v1[ns[a][b]] -= 1; from[j * N + s].push_back(i * N + j); deg[i * N + j] += 1; } } } int get(int i, int j) { switch (dp[i * N + j]) { case 0: return 2; case 1: return 0; default: return 1; } } int q[1000000]; int main() { for (int i = 0; i < (10); ++i) for (int j = 0; j < (10); ++j) ns[i][j] = (i + j) % 5; int c = 0; for (int i0 = 0; i0 < (9); ++i0) for (int i1 = 0; i1 < (9); ++i1) for (int i2 = 0; i2 < (9); ++i2) for (int i3 = 0; i3 < (9); ++i3) for (int i4 = 0; i4 < (9); ++i4) { if (i0 + i1 + i2 + i3 + i4 == 8) { v[c++] = {i0, i1, i2, i3, i4}; mp[v[c - 1]] = c - 1; } } for (int i = 0; i < (N); ++i) for (int j = 0; j < (N); ++j) solve(i, j); int f = 0, e = 0; int z = mp[{8, 0, 0, 0, 0}]; for (int i = 0; i < N; ++i) { dp[i * N + z] = -1; q[e++] = i * N + z; dp[z * N + i] = 1; q[e++] = z * N + i; } while (f < e) { int c = q[f++]; for (int u : from[c]) if (!dp[u]) { if (dp[c] == -1) { dp[u] = 1; q[e++] = u; } else { deg[u] -= 1; if (!deg[u]) { dp[u] = -1; q[e++] = u; } } } } int T; scanf( %d , &T); while (T--) { int f, x; scanf( %d , &f); vector<int> v1(5), v2(5); for (int i = 0; i < (8); ++i) { scanf( %d , &x); v1[x] += 1; } for (int i = 0; i < (8); ++i) { scanf( %d , &x); v2[x] += 1; } if (f) swap(v1, v2); int ans = get(mp[v1], mp[v2]); if (ans == 2) puts( Deal ); else puts(f ^ ans ? Bob : Alice ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int A[1 << 18], vis[1 << 20], n, k, d, t; int main() { scanf( %d , &t); while (t--) { scanf( %d%d%d , &n, &k, &d); int ans = k, cnt = 0; for (int i = 1; i <= n; i++) { scanf( %d , &A[i]); if (!vis[A[i]]) cnt++; vis[A[i]]++; if (i >= d) { if (i > d) { vis[A[i - d]]--; if (!vis[A[i - d]]) cnt--; } ans = min(ans, cnt); } } printf( %d n , ans); for (int i = 1; i <= n; i++) vis[A[i]] = 0; } return 0; } |
#include <bits/stdc++.h> const int N = 1123; const double eps = 1e-6; const int inf = (int)1e9 + 123; using namespace std; int n, m; char a[N][N]; int mini = inf; int d[N][N]; int sum(int x, int y, int x2, int y2) { return d[x2][y2] - d[x - 1][y2] - d[x2][y - 1] + d[x - 1][y - 1]; } bool check(int x, int y, int sx, int sy) { if (sum(sx, sy, sx + x - 1, sy + y - 1) != x * y) return 0; int sz = sum(sx, sy, sx + x - 1, sy + y - 1); while (1) { if (sx + x <= n && sum(sx + x, sy, sx + x, sy + y - 1) == y) { sx++; sz += y; continue; } if (sy + y <= m && sum(sx, sy + y, sx + x - 1, sy + y) == x) { if (sum(sx, sy + y, sx + x - 1, sy + y) != x) return 0; sy++; sz += x; continue; } break; } if (d[n][m] != sz) return 0; return 1; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> a[i][j]; d[i][j] = d[i - 1][j] + d[i][j - 1] - d[i - 1][j - 1] + (a[i][j] == X ? 1 : 0); } int x = -1, y = -1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) if (a[i][j] == X ) { x = i; y = j; break; } if (x != -1) break; } if (x == -1) { cout << -1; return 0; } int cnt = 0; for (int i = x; i <= n; i++) { if (a[i][y] == X ) cnt++; else break; } for (int i = 1; i <= m; i++) if (y + i - 1 <= m && check(cnt, i, x, y) && mini > cnt * i) mini = cnt * i; cnt = 0; for (int i = y; i <= m; i++) { if (a[x][i] == X ) cnt++; else break; } for (int i = 1; i <= n; i++) if (x + i - 1 <= m && check(i, cnt, x, y) && mini > i * cnt) mini = i * cnt; if (mini == inf) mini = -1; cout << mini; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << ( << p.first << , << p.second << ) ; return os; } template <typename T1, typename T2, typename T3> ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& t) { os << ( << get<0>(t) << , << get<1>(t) << , << get<2>(t) << ) ; return os; } template <typename T1, typename T2, typename T3, typename T4> ostream& operator<<(ostream& os, const tuple<T1, T2, T3, T4>& t) { os << ( << get<0>(t) << , << get<1>(t) << , << get<2>(t) << , << get<3>(t) << ) ; return os; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << [ ; for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } os << ] ; return os; } template <typename T, typename C> ostream& operator<<(ostream& os, const set<T, C>& v) { os << { ; for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } os << } ; return os; } template <typename T, typename C> ostream& operator<<(ostream& os, const unordered_set<T, C>& v) { os << { ; for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } os << } ; return os; } template <typename T, typename C> ostream& operator<<(ostream& os, const multiset<T, C>& v) { os << { ; for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } os << } ; return os; } template <typename T1, typename T2, typename C> ostream& operator<<(ostream& os, const map<T1, T2, C>& mp) { os << [ ; for (auto it = mp.begin(); it != mp.end(); it++) { if (it != mp.begin()) os << , ; os << it->first << : << it->second; } os << ] ; return os; } template <typename T1, typename T2, typename C> ostream& operator<<(ostream& os, const unordered_map<T1, T2, C>& mp) { os << [ ; for (auto it = mp.begin(); it != mp.end(); it++) { if (it != mp.begin()) os << , ; os << it->first << : << it->second; } os << ] ; return os; } template <typename T, typename T2> ostream& operator<<(ostream& os, const queue<T, T2>& orig) { queue<T, T2> que(orig); bool first = true; os << [ ; while (!que.empty()) { T x = que.front(); que.pop(); if (!first) os << , ; os << x; first = false; } return os << ] ; } template <typename T, typename T2> ostream& operator<<(ostream& os, const deque<T, T2>& orig) { deque<T, T2> que(orig); bool first = true; os << [ ; while (!que.empty()) { T x = que.front(); que.pop_front(); if (!first) os << , ; os << x; first = false; } return os << ] ; } template <typename T, typename T2, typename T3> ostream& operator<<(ostream& os, const priority_queue<T, T2, T3>& orig) { priority_queue<T, T2, T3> pq(orig); bool first = true; os << [ ; while (!pq.empty()) { T x = pq.top(); pq.pop(); if (!first) os << , ; os << x; first = false; } return os << ] ; } template <typename T> ostream& operator<<(ostream& os, const stack<T>& st) { stack<T> tmp(st); os << [ ; bool first = true; while (!tmp.empty()) { T& t = tmp.top(); if (first) first = false; else os << , ; os << t; tmp.pop(); } os << ] ; return os; } ostream& operator<<(ostream& os, int8_t x) { os << (int32_t)x; return os; } template <class... Args> string dbgFormat(const char* fmt, Args... args) { size_t len = snprintf(nullptr, 0, fmt, args...); char buf[len + 1]; snprintf(buf, len + 1, fmt, args...); return string(buf); } template <class Head> void dbgLog(Head&& head) { cerr << head << endl; } template <class Head, class... Tail> void dbgLog(Head&& head, Tail&&... tail) { cerr << head << ; dbgLog(forward<Tail>(tail)...); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << setprecision(20); long long int n; cin >> n; const long long int big = 1e10; vector<long long int> ans(n + 1, big); long long int lim = 10; for (long long int t = 0; t < lim; t++) { ; auto doit = [&](long long int bit) -> void { vector<long long int> vec; for (long long int i = 1; i <= n; i++) { if (((i >> t) & 1) == bit) vec.push_back(i); }; long long int sz = vec.size(); if (sz == 0) return; cout << sz << endl; for (long long int i = 0; i < sz; i++) { if (i > 0) cout << ; cout << vec[i]; } cout << endl; for (long long int i = 1; i <= n; i++) { long long int v; cin >> v; if (((i >> t) & 1) != bit) { ans[i] = min(ans[i], v); ; } } }; doit(0); doit(1); } cout << -1 << endl; for (long long int i = 1; i <= n; i++) { if (i > 0) cout << ; cout << ans[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 7; const int inf = INT_MAX; const long long inff = 1e18; const int mod = 1e9 + 7; long long a[50]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); a[0] = 0; for (long long i = 1; i <= 31; i++) { a[i] = 4 * a[i - 1] + 1; } long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; if (n <= 30 && k > a[n]) cout << NO << endl; else if (k < 5) { if (k == 3 && n == 2) cout << NO << endl; else if (n == 2) { if (k == 1 || k == 2) cout << YES 1 << endl; else cout << YES 0 << endl; } else { cout << YES << n - 1 << endl; } } else { cout << YES ; long long now; for (long long i = 1; i <= 31; i++) { if (a[i] >= k) { now = i; break; } } now--; if (a[now + 1] - k <= (((1ll << now) - 1) * ((1ll << now) - 1))) cout << n - now - 1 << endl; else cout << n - now << endl; } } } |
#include <bits/stdc++.h> using namespace std; long long int computeXOR(long long int n) { if (n % 4 == 0) return n; if (n % 4 == 1) return 1; if (n % 4 == 2) return n + 1; return 0; } void solve() { vector<long long int> v; map<long long int, long long int> mp; long long int e, i, j, l, m, x, y, z, r, k, n; cin >> n >> m; x = computeXOR(n - 1); r = x ^ n; if (x == m) cout << n << endl; else if (r == m) cout << n + 2 << endl; else cout << n + 1 << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T = 1; cin >> T; while (T--) solve(); return 0; } |
#include <bits/stdc++.h> void putin(char s[]); int main() { int i, total = 0; char c, ori1[120], ori2[120], ori3[120], a[6][400], temp[700]; putin(ori1); putin(ori2); putin(ori3); strcpy(a[0], ori1); strcat(a[0], ori2); strcat(a[0], ori3); strcpy(a[1], ori2); strcat(a[1], ori1); strcat(a[1], ori3); strcpy(a[2], ori3); strcat(a[2], ori2); strcat(a[2], ori1); strcpy(a[3], ori1); strcat(a[3], ori3); strcat(a[3], ori2); strcpy(a[4], ori2); strcat(a[4], ori3); strcat(a[4], ori1); strcpy(a[5], ori3); strcat(a[5], ori1); strcat(a[5], ori2); scanf( %d , &total); getchar(); while (total) { --total; putin(temp); for (i = 0; i < 6; ++i) if (strcmp(temp, a[i]) == 0) { printf( ACC ); break; } if (i == 6) printf( WA ); printf( n ); } return 0; } void putin(char s[]) { char c; int i = 0; c = getchar(); while (c != n ) { if (c >= A && c <= Z ) s[i] = c + 32; else if (c >= a && c <= z ) s[i] = c; else --i; ++i; c = getchar(); } s[i] = 0 ; return; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const long long inf = (((long long)1) << 61) + 5; const int N = 200005; int a[N]; int b[N]; int f1[N]; int f2[N]; int bit[N]; int n; int sum(int i) { int s = 0; while (i > 0) { s += bit[i]; i -= i & -i; } return s; } void add(int i, int x) { while (i <= n + 1) { bit[i] += x; i += i & -i; } } int get(int x) { int ans = n, l = 1, r = n; while (l <= r) { int mid = (l + r) >> 1; if (sum(mid) >= x) { ans = mid; r = mid - 1; } else l = mid + 1; } return ans; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); int x = sum(a[i]); int tmp = a[i] - x; f1[n - i - 1] = tmp; add(a[i] + 1, 1); } memset(bit, 0, sizeof bit); for (int i = 0; i < n; i++) { scanf( %d , &b[i]); int x = sum(b[i]); int tmp = b[i] - x; f2[n - i - 1] = tmp; add(b[i] + 1, 1); } for (int i = 0; i < n; i++) { f1[i] += f2[i]; f1[i + 1] += f1[i] / (i + 1); f1[i] %= (i + 1); } memset(bit, 0, sizeof bit); for (int i = 1; i <= n; i++) add(i, 1); for (int i = n - 1; i >= 0; i--) { int ans = get(f1[i] + 1); printf( %d , ans - 1); add(ans, -1); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int next, to; } e[500020 * 2]; int head[500020], cnt, fa[500020], n, sz[500020]; long long f[500020][2][2][4], g[2][2][4]; inline void adde(int x, int y) { e[++cnt].to = y; e[cnt].next = head[x]; head[x] = cnt; } void dfs(int x) { sz[x] = 1; f[x][0][0][0] = 1; for (register int i = head[x]; i; i = e[i].next) { if (e[i].to == fa[x]) continue; fa[e[i].to] = x; dfs(e[i].to); memcpy(g, f[x], sizeof(f[x])); memset(f[x], 0, sizeof(f[x])); f[x][1][0][0] += g[1][0][0] * f[e[i].to][1][0][0] + g[0][0][0] * f[e[i].to][0][0][0]; f[x][1][1][0] += g[1][1][0] * f[e[i].to][1][0][0] + g[1][0][0] * (f[e[i].to][1][1][0] + f[e[i].to][0][0][0]) + g[0][1][0] * f[e[i].to][0][0][0] + g[0][0][0] * f[e[i].to][0][1][0]; f[x][0][1][0] += g[0][1][0] * f[e[i].to][1][0][0] + g[0][0][0] * (f[e[i].to][0][0][0] + f[e[i].to][1][1][0]); f[x][0][0][0] += g[0][0][0] * f[e[i].to][1][0][0]; f[x][0][0][3] += g[0][0][3] * f[e[i].to][1][0][0]; f[x][1][0][3] += g[0][0][3] * f[e[i].to][0][0][0] + g[1][0][3] * f[e[i].to][1][0][0]; f[x][0][0][3] += g[0][0][0] * f[e[i].to][1][0][3]; f[x][1][0][3] += g[0][0][0] * f[e[i].to][0][0][3] + g[1][0][0] * f[e[i].to][1][0][3]; for (register int t = 1; t <= 2; t++) { f[x][0][0][t] += g[0][0][t] * f[e[i].to][1][0][0]; f[x][1][0][t] += g[0][0][t] * f[e[i].to][0][0][0] + g[1][0][t] * f[e[i].to][1][0][0]; } for (register int t = 1; t <= 2; t++) { f[x][0][0][t] += g[0][0][0] * f[e[i].to][1][0][t]; f[x][1][0][t] += g[0][0][0] * f[e[i].to][0][0][t] + g[1][0][0] * f[e[i].to][1][0][t]; } f[x][0][0][3] += g[0][0][1] * f[e[i].to][0][0][0]; f[x][1][0][3] += g[1][0][1] * f[e[i].to][0][0][0]; f[x][0][0][3] += g[0][0][1] * f[e[i].to][1][1][0]; f[x][1][0][3] += g[1][0][1] * f[e[i].to][1][1][0] + g[0][0][1] * f[e[i].to][0][1][0]; f[x][0][0][3] += g[0][0][2] * f[e[i].to][1][0][0] * sz[e[i].to]; f[x][1][0][3] += (g[0][0][2] * f[e[i].to][0][0][0] + g[1][0][2] * f[e[i].to][1][0][0]) * sz[e[i].to]; f[x][1][0][3] += g[0][0][0] * f[e[i].to][1][0][1]; f[x][0][0][3] += g[0][1][0] * f[e[i].to][1][0][1]; f[x][1][0][3] += g[1][1][0] * f[e[i].to][1][0][1] + g[0][1][0] * f[e[i].to][0][0][1]; f[x][0][0][3] += g[0][0][0] * f[e[i].to][1][0][2] * sz[x]; f[x][1][0][3] += (g[0][0][0] * f[e[i].to][0][0][2] + g[1][0][0] * f[e[i].to][1][0][2]) * sz[x]; f[x][0][0][3] += g[0][1][0] * (f[e[i].to][1][1][0] + f[e[i].to][0][0][0]) + g[0][0][0] * f[e[i].to][1][0][0] * sz[e[i].to] * sz[x]; f[x][1][0][3] += g[0][0][0] * (f[e[i].to][1][1][0] + f[e[i].to][0][0][0]) + g[1][1][0] * (f[e[i].to][1][1][0] + f[e[i].to][0][0][0]) + g[1][0][0] * f[e[i].to][1][0][0] * sz[e[i].to] * sz[x]; f[x][0][0][1] += g[0][0][0] * (f[e[i].to][1][1][0] + f[e[i].to][0][0][0]); f[x][1][0][1] += g[1][0][0] * (f[e[i].to][1][1][0] + f[e[i].to][0][0][0]); f[x][0][0][2] += g[0][0][0] * f[e[i].to][1][0][0] * sz[e[i].to]; f[x][1][0][2] += g[1][0][0] * f[e[i].to][1][0][0] * sz[e[i].to]; sz[x] += sz[e[i].to]; } } int main() { scanf( %d , &n); for (register int i = 1; i <= n - 1; i++) { int x, y; scanf( %d %d , &x, &y); adde(x, y), adde(y, x); } dfs(1); long long ans = f[1][1][0][3]; printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; const int max_n = 1e5 + 5; vector<int> g[max_n], path; bool vis[max_n], x[max_n]; int s; void dfs(int u) { vis[u] = 1; x[u] ^= 1; path.push_back(u); bool leaf = 1; for (int v : g[u]) { if (!vis[v]) { if (!leaf) leaf = 0; dfs(v); x[u] ^= 1; path.push_back(u); if (x[v]) { x[v] ^= 1; path.push_back(v); x[u] ^= 1; path.push_back(u); } } } if (u == s && x[u]) { x[u] ^= 1; path.pop_back(); } } int main() { int n, m; scanf( %d%d , &n, &m); while (m--) { int u, v; scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } s = -1; for (int i = 1; i <= n; i++) { scanf( %d , &x[i]); if (s == -1 && x[i]) s = i; } if (s != -1) dfs(s); bool ok = 1; for (int i = 1; i <= n; i++) { if (x[i]) { ok = 0; break; } } if (!ok) { puts( -1 ); exit(0); } int sz = path.size(); printf( %d n , sz); for (int i = 0; i < sz; i++) { if (i != sz - 1) printf( %d , path[i]); else printf( %d n , path[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int OO = 0x3f3f3f3f, N = 1e2 + 5, mod = 1e9 + 7; int ans, lst = OO, gt[26]; string s1, s2; vector<int> idx[26]; int main() { cin >> s1 >> s2; for (int i = 0; i < s1.size(); ++i) idx[s1[i] - a ].push_back(i); for (int i = 0; i < s2.size(); ++i) { int ch = s2[i] - a ; if (!idx[ch].size()) exit(puts( -1 )); if (idx[ch].back() > lst && idx[ch][gt[ch]] <= lst) gt[ch] = lower_bound(idx[ch].begin(), idx[ch].end(), lst) - idx[ch].begin(); if (idx[ch].size() <= gt[ch] || idx[ch].back() <= lst) { ++ans, memset(gt, 0, sizeof gt); gt[ch] = 1, lst = idx[ch][0]; } else lst = (idx[ch][gt[ch]++]); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int dfs(long long int n, int i, long long int b[]) { int ans = i * (n / b[i]); n = n % b[i]; if (n == 0) return ans; else return (ans + min(i + dfs(b[i] - n, i - 1, b), dfs(n, i - 1, b))); } int main() { long long int a[17], i, n; a[1] = 1; for (i = 2; i < 17; i++) a[i] = 10 * a[i - 1] + 1; cin >> n; int j = dfs(n, 16, a); cout << j; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const double eps = 1e-6; int modpow(int x, int y, int md) { if (y == 0) return 1; int ret = modpow(x, y >> 1, md); ret = (long long)ret * ret % md; if (y & 1) ret = (long long)ret * x % md; return ret; } int n, q, mod; int pws[10][2000001]; long long euclid(long long x, long long y, long long &k, long long &l) { if (y == 0) { k = 1; l = 0; return x; } long long g = euclid(y, x % y, l, k); l -= k * (x / y); return g; } long long rev(long long x) { long long k, l; if (euclid(x, mod, k, l) != 1) throw; k %= mod; if (k < 0) k += mod; return k; } int pr[10], cnt = 0; struct Num { int a[10] = {}; int val = 0; Num operator*(Num b) { Num ret; ret.val = (long long)val * b.val % mod; for (int i = 0; i < cnt; i++) ret.a[i] = a[i] + b.a[i]; return ret; } Num operator+(Num b) { if (val == -1) return b; if (b.val == -1) return *this; Num ret; ret.val = 0; int v2 = val, v1 = b.val; for (int i = 0; i < cnt; i++) { ret.a[i] = min(a[i], b.a[i]); v2 = (long long)v2 * pws[i][a[i] - ret.a[i]] % mod; v1 = (long long)v1 * pws[i][b.a[i] - ret.a[i]] % mod; } ret.val = (v1 + v2) % mod; return ret; } Num inv() { Num ret; ret.val = rev(val); for (int i = 0; i < cnt; i++) { ret.a[i] = -a[i]; } return ret; } int getreallyvalue() { int ret = val; for (int i = 0; i < cnt; i++) ret = (long long)ret * pws[i][a[i]] % mod; return ret; } }; Num sjctxdy(int x) { Num ret; if (x == 0) { ret.val = 0; return ret; } for (int i = 0; i < 10; i++) ret.a[i] = 0; for (int i = 0; i < cnt; i++) { if (x % pr[i] == 0) { while (x % pr[i] == 0) { ret.a[i]++; x /= pr[i]; } } } ret.val = x; return ret; } struct mod_sjc { Num v, mul; void print() { printf( v: %d , v.val); printf( array: ); for (int i = 0; i < cnt; i++) printf( %d%c , v.a[i], i == cnt - 1 ? n : ); printf( mul: %d , mul.val); printf( array: ); for (int i = 0; i < cnt; i++) printf( %d%c , mul.a[i], i == cnt - 1 ? n : ); } } node[131072 * 2]; int sjctql[131072]; struct sjcakioi { void build() { for (int i = 131072; i < 131072 + 131072; i++) node[i] = (mod_sjc){sjctxdy(sjctql[i - 131072]), sjctxdy(1)}; for (int i = 131072 - 1; i >= 1; i--) node[i].v = node[i + i + 1].v + node[i + i].v, node[i].mul = sjctxdy(1); } void pushup(int v) { node[v].v = node[v + v].v + node[v + v + 1].v; } void pushdown(int v) { if (node[v + v + 1].v.val != -1) { node[v + v + 1].mul = node[v + v + 1].mul * node[v].mul; node[v + v + 1].v = node[v + v + 1].v * node[v].mul; } if (node[v + v].v.val != -1) { node[v + v].mul = node[v + v].mul * node[v].mul; node[v + v].v = node[v + v].v * node[v].mul; } node[v].mul = sjctxdy(1); } void AK_init(int k, int l, int r, Num v, int a = 0, int b = 131072 - 1) { if (r < a || b < l) return; if (l <= a && b <= r) { node[k].v = node[k].v * v; node[k].mul = node[k].mul * v; return; } pushdown(k); AK_init(k + k, l, r, v, a, (a + b) >> 1); AK_init(k + k + 1, l, r, v, ((a + b) >> 1) + 1, b); pushup(k); } Num AK(int k, int l, int r, int a = 0, int b = 131072 - 1) { if (r < a || b < l) return sjctxdy(-1); if (l <= a && b <= r) { return node[k].v; } pushdown(k); Num ret = AK(k + k, l, r, a, a + b >> 1) + AK(k + k + 1, l, r, (a + b >> 1) + 1, b); return ret; } } orzsjc; int main() { scanf( %d%d , &n, &mod); int t = mod; for (int i = 2; i * i <= mod; i++) { if (t % i == 0) { pr[cnt++] = i; while (t % i == 0) t /= i; } } if (t != 1) pr[cnt++] = t; for (int i = 0; i < cnt; i++) for (int j = 0; j < 2000000; j++) { pws[i][j] = (j == 0 ? 1 : (long long)pws[i][j - 1] * pr[i] % mod); } for (int i = 0; i < n; i++) scanf( %d , sjctql + i); orzsjc.build(); scanf( %d , &q); while (q--) { int type; scanf( %d , &type); if (type == 1) { int l, r, x; scanf( %d%d%d , &l, &r, &x); orzsjc.AK_init(1, l - 1, r - 1, sjctxdy(x)); } else if (type == 2) { int p, x; scanf( %d%d , &p, &x); orzsjc.AK_init(1, p - 1, p - 1, sjctxdy(x).inv()); } else if (type == 3) { int l, r; scanf( %d%d , &l, &r); printf( %d n , orzsjc.AK(1, l - 1, r - 1).getreallyvalue()); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; int st[maxn << 2]; int a[maxn], b[maxn]; vector<int> pos[maxn]; void build(int id, int l, int r) { if (l == r) { st[id] = a[l]; return; } int mid = (l + r) >> 1; build(id << 1, l, mid); build(id << 1 | 1, mid + 1, r); st[id] = min(st[id << 1], st[id << 1 | 1]); } void update(int id, int l, int r, int u, int val) { if (l > u || r < u) return; if (l == r) { st[id] = val; return; } int mid = (l + r) >> 1; update(id << 1, l, mid, u, val); update(id << 1 | 1, mid + 1, r, u, val); st[id] = min(st[id << 1], st[id << 1 | 1]); } int GetMin(int id, int l, int r, int u, int v) { if (l > v || r < u) return 1e9; if (u <= l && r <= v) return st[id]; int mid = (l + r) >> 1; return min(GetMin(id << 1, l, mid, u, v), GetMin(id << 1 | 1, mid + 1, r, u, v)); } string Solve() { int n; cin >> n; for (int i = (1), _b = (n); i <= _b; ++i) pos[i].clear(); for (int i = (1), _b = (n); i <= _b; ++i) cin >> a[i]; for (int i = (n), _b = (1); i >= _b; --i) pos[a[i]].push_back(i); for (int i = (1), _b = (n); i <= _b; ++i) cin >> b[i]; build(1, 1, n); int l = 1; for (int i = (1), _b = (n); i <= _b; ++i) { if (pos[b[i]].empty()) return NO ; int nxt = pos[b[i]].back(); pos[b[i]].pop_back(); if (GetMin(1, 1, n, l, nxt) != b[i]) return NO ; update(1, 1, n, nxt, 1e9); } return YES ; } int main() { iostream::sync_with_stdio(false); cin.tie(0); int q; cin >> q; for (int i = (1), _b = (q); i <= _b; ++i) cout << Solve() << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int q; cin >> q; while (q--) { long long int n; cin >> n; long long int x, y; int l, u, r, s; long long int nl = -100000, nu = 100000, nr = 100000, ns = -100000; for (long long int i = 0; i < n; i++) { cin >> x >> y >> l >> u >> r >> s; if (l == 0 && nl <= x) { nl = x; } if (u == 0 && nu >= y) { nu = y; } if (r == 0 && nr >= x) { nr = x; } if (s == 0 && ns <= y) { ns = y; } } if (ns <= nu && nl <= nr) { std::cout << 1 << << nl << << ns << std::endl; } else { std::cout << 0 << std::endl; } } } |
#include <bits/stdc++.h> using namespace std; const long long A = 31, mod = 1000000033LL; vector<string> read(int n) { vector<string> ans(n); for (auto &x : ans) cin >> x; return ans; } vector<long long> hsh(vector<string> vec, long long a) { vector<long long> ans; for (auto x : vec) { long long h = 0; for (auto y : x) h = (h * a + (y - a )) % mod; ans.push_back(h); } return ans; } long long hsh(vector<long long> &vec, int beg, int end, long long a) { long long h = 0; for (int i = beg; i < end; i++) h = (h * a + vec[i]) % mod; return h; } int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; long long Am = 1; for (int i = 0; i < m; i++) Am = Am * A % mod; auto m1 = read(n), tmp2 = read(m); vector<string> m2(n, string(m, )); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) m2[i][j] = tmp2[j][i]; auto h1 = hsh(m1, A), h2 = hsh(m2, Am); vector<pair<long long, int>> vec; for (int i = 0; i + m <= n; i++) vec.emplace_back(hsh(h1, i, i + m, Am), i); sort(vec.begin(), vec.end()); for (int i = 0; i + m <= n; i++) { auto h = hsh(h2, i, i + m, A); auto p = lower_bound(vec.begin(), vec.end(), make_pair(h, 0)); if (p != vec.end() && p->first == h) { cout << p->second + 1 << << i + 1 << endl; return 0; } } } |
#include <bits/stdc++.h> using namespace std; vector<string> split(const string& s, const string& delim = ) { vector<string> res; string t; for (int i = 0; i != s.size(); i++) { if (delim.find(s[i]) != string::npos) { if (!t.empty()) { res.push_back(t); t = ; } } else { t += s[i]; } } if (!t.empty()) { res.push_back(t); } return res; } vector<int> splitInt(const string& s, const string& delim = ) { vector<string> tok = split(s, delim); vector<int> res; for (int i = 0; i != tok.size(); i++) res.push_back(atoi(tok[i].c_str())); return res; } template <typename T> void print(T a) { cerr << a; } static void print(long long a) { cerr << a << L ; } static void print(string a) { cerr << << a << ; } template <typename T> void print(vector<T> a) { cerr << { ; for (int i = 0; i != a.size(); i++) { if (i != 0) cerr << , ; print(a[i]); } cerr << } << endl; } char flag[1000005]; int main() { string s; while (cin >> s) { memset(flag, 0, sizeof(flag)); reverse(s.begin(), s.end()); for (int i = 0, _n = (s.size()); i < _n; i++) flag[i] = s[i] - 0 ; int i = 0, n = s.size(); while (i < n) { int count = 0; while (i < n && flag[i + count] == 1) count++; if (count > 1) { for (int j = (i), _n = (i + count - 1); j <= _n; j++) flag[j] = 0; flag[i] = -1; flag[i + count] = 1; i = i + count - 1; } i++; } int count = 0; for (int i = 0, _n = (n + 3); i < _n; i++) count += (flag[i] != 0); printf( %d n , count); for (int i = (0), _n = (n + 3); i <= _n; i++) if (flag[i] != 0) { if (flag[i] < 0) printf( - ); else printf( + ); printf( 2^%d n , i); } } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000 ) bool ascending(int i, int j) { return (i < j); } bool descending(int i, int j) { return (i > j); } using namespace std; const int MOD = 1000 * 1000 * 1000 + 7; unsigned long long powmod(unsigned long long a, unsigned long long b, unsigned long long m) { unsigned long long x = a, p = 1; while (b > 0) { if (b % 2) p = ((p % m) * (x % m)) % m; b /= 2; x = ((x % m) * (x % m)) % m; } return p; } int main() { int mersenne[] = {0, 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011}; int n; cin >> n; cout << powmod(2, mersenne[n] - 1, MOD) - 1 << endl; } |
#include <bits/stdc++.h> using namespace std; struct Node { long long val, pos; }; deque<long long> dq; bool flag = false; void go(long long a, long long b) { if (a > b) return; if (a == b) { cout << YES << endl; dq.push_back(b); cout << dq.size() << endl; flag = true; auto it = dq.begin(); while (it != dq.end()) { cout << *it << ; it++; } cout << endl; } dq.push_back(a); go(a * 2, b); go(a * 10 + 1, b); dq.pop_back(); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b; cin >> a >> b; go(a, b); if (flag == false) cout << NO << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) const long double EPSILON = 0.000000001; const long long int mod = 1000000007; const long long int AM = 2e5 + 5; const long double pi = 3.14159265358979323846; long long int max(long long int a, long long int b) { if (a > b) return a; else return b; } using namespace std; long long int fact(long long int n) { long long int ans = 1; for (long long int i = 1; i <= n; i++) ans *= i; return ans; } long long int powm(long long int a, long long int b, long long int n) { long long int x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y) % n; } y = (y * y) % n; b /= 2; } return x % n; } long long int pow(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = ((res) * (x)); y = y >> 1; x = ((x) * (x)); } return res; } long long int min(long long int a, long long int b) { if (a > b) return b; else return a; } bool cmp(long double x, long double y) { if (abs(x - y) <= EPSILON) return 1; return 0; } long long int nCrModp(long long int n, long long int r, long long int p) { if (r > n - r) r = n - r; long long int C[r + 1]; memset(C, 0, sizeof(C)); C[0] = 1; for (long long int i = 1; i <= n; i++) { for (long long int j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j - 1]) % p; } return C[r]; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int NcR(long long int n, long long int r) { long long p = 1, k = 1; if (n - r < r) r = n - r; if (r != 0) { while (r) { p *= n; k *= r; long long m = gcd(p, k); p /= m; p %= mod; k /= m; n--; r--; } } else p = 1; return p; } int main() { long long int n; cin >> n; vector<long long int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort((v).begin(), (v).end()); long long int cnt = 0; long long int sum = 0; for (int i = 0; i < n; i++) { if (sum <= v[i]) cnt++; if (sum <= v[i]) sum += v[i]; } cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; struct zt { int ss, ii; } frm[1 << 22], ans[25]; struct node { int l, r, t, id; } a[25], b[25]; bool cmp1(node aa, node bb) { return aa.l < bb.l; } bool cmp2(node aa, node bb) { return aa.t < bb.t; } int N, P, S, f[1 << 22]; void dfs(int s, int ii) { if (!s) return; ans[frm[s].ii] = (zt){frm[s].ss, ii}; dfs(s ^ (1 << (frm[s].ii - 1)), ii); } void SLV1() { if (f[S] == inf) { puts( NO ); exit(0); } puts( YES ); dfs(S, 1); for (int i = 1; i <= N; i++) { printf( %d %d n , ans[i].ii, ans[i].ss); } } void SLV2() { int s1 = 0; int s2 = -233; for (; s1 <= S; s1++) { if (f[s1] < inf && f[S ^ s1] < inf) { s2 = (S ^ s1); break; } } if (s2 == -233) { puts( NO ); exit(0); } puts( YES ); dfs(s1, 1); dfs(s2, 2); for (int i = 1; i <= N; i++) { printf( %d %d n , ans[i].ii, ans[i].ss); } } int main() { scanf( %d%d , &N, &P); for (int i = 1; i <= N; i++) { scanf( %d%d%d , &a[i].l, &a[i].r, &a[i].t); a[i].id = i; a[i].r += a[i].l - 1; b[i] = a[i]; } sort(a + 1, a + 1 + N, cmp1); sort(b + 1, b + 1 + N, cmp2); S = (1 << N) - 1; memset(f, 0x3f, sizeof f); f[0] = 1; for (int s = 0; s < S; s++) { if (f[s] != inf) { int tim = f[s]; int pit = 1; for (int i = 1; i <= N; i++) { if ((s >> (b[i].id - 1)) & 1) continue; for (; pit <= N && tim + b[i].t >= a[pit].l; pit++) { if (tim >= a[pit].l || ((s >> (a[pit].id - 1)) & 1)) tim = max(tim, a[pit].r + 1); } if (tim + b[i].t < b[i].l) { if (f[s | (1 << (b[i].id - 1))] > tim + b[i].t) { f[s | (1 << (b[i].id - 1))] = tim + b[i].t; frm[s | (1 << (b[i].id - 1))] = (zt){tim, b[i].id}; } } } } } if (P == 1) SLV1(); else SLV2(); } |
#include <bits/stdc++.h> using namespace std; int b[1111][1111], n, m, k, q1, q2, xs, ys, step = 0, x, y, c; vector<char> v; char a[1111][1111]; queue<pair<int, int> > q; void add(int x, int y, int c) { if (x < 0 || y < 0 || x >= n || y >= m || a[x][y] == * || b[x][y] <= c) return; b[x][y] = c; q.push(make_pair(x, y)); } bool check(int x, int y) { if (step + b[x][y] > k) return false; if (x < 0 || y < 0 || x >= n || y >= m || a[x][y] == * ) return false; return true; } int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> a[i][j]; if (a[i][j] == X ) { xs = i; ys = j; } } for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) b[i][j] = 1e9; b[xs][ys] = 0; q.push(make_pair(xs, ys)); while (!q.empty()) { x = q.front().first; y = q.front().second; q.pop(); c = b[x][y] + 1; add(x + 1, y, c); add(x - 1, y, c); add(x, y + 1, c); add(x, y - 1, c); } int x = xs; int y = ys; while (81 == 81) { if (v.size() == k && x == xs && y == ys) break; step = v.size(); if (check(x + 1, y)) { v.push_back( D ); x++; continue; } if (check(x, y - 1)) { v.push_back( L ); y--; continue; } if (check(x, y + 1)) { v.push_back( R ); y++; continue; } if (check(x - 1, y)) { v.push_back( U ); x--; continue; } cout << IMPOSSIBLE ; return 0; } for (int i = 0; i < v.size(); i++) cout << v[i]; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, in; long long shift(long long i) { return (1 << i); } void getx(long long x, long long y) { cout << ? << x << << y << endl; cin >> in; return; } int main() { ios_base::sync_with_stdio(false); long long curbit = 29; getx(0, 0); long long start = in; while (curbit >= 0) { if (start == 0) { getx(a ^ shift(curbit), b); if (in == -1) { a |= shift(curbit); b |= shift(curbit); getx(a, b); start = in; } curbit--; continue; } getx(a ^ shift(curbit), b ^ shift(curbit)); while (in == start) { if (start == 1) { getx(a ^ shift(curbit), b); if (in == -1) { a |= shift(curbit); b |= shift(curbit); } } else { getx(a, b ^ shift(curbit)); if (in == 1) { a |= shift(curbit); b |= shift(curbit); } } if (curbit == 0) break; curbit--; getx(a ^ shift(curbit), b ^ shift(curbit)); } if (in != start) { if (start == 1) a |= shift(curbit); else if (start == 0) { a |= shift(curbit); b |= shift(curbit); } else b |= shift(curbit); getx(a, b); start = in; } curbit--; } cout << ! << a << << b << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; char arr[1002][7]; bool sit = false; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , arr[i]); if (!sit) { if (arr[i][0] == O && arr[i][1] == O ) { sit = true; arr[i][0] = arr[i][1] = + ; } else if (arr[i][3] == O && arr[i][4] == O ) { sit = true; arr[i][3] = arr[i][4] = + ; } } } if (sit) { printf( YES n ); for (int i = 0; i < n; i++) printf( %s n , arr[i]); } else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, x, y; int main() { cin >> x >> y >> m; if (x >= m || y >= m) { cout << 0 << endl; return 0; } if ((x <= 0 && y <= 0)) { cout << -1 << endl; return 0; } long long ans = 0; while (x < m && y < m) { if (x < 0) { ans += ((-x) / y); x = x + ((-x) / y) * y; } else if (y < 0) { ans += ((-y) / x); y = y + ((-y) / x) * x; } ans++; if (x < y) x = x + y; else y = y + x; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int md = 1000000007; const int maxn = 30303; const int maxk = 220; const int maxn4 = 4 * maxn; const long long inf = 2020202020202020202LL; int n, k, a[maxn]; int ans[maxn][maxk], ansp[maxn][maxk], ansm[maxn][maxk], t1, t2, t3, t4, t5, t6; int main() { ios::ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i + 1]; int mx = -md, mn = -md; for (int i = 0; i < maxn; i++) for (int j = 0; j < maxk; j++) { ansp[i][j] = -md; ansm[i][j] = -md; ans[i][j] = -md; } for (int i = 1; i <= n; i++) { mx = max(mx + a[i], a[i]); ansp[i][1] = mx; mn = max(mn - a[i], -a[i]); ansm[i][1] = mn; } for (int w = 2; w <= k; w++) { t1 = ansp[w - 1][w - 1]; t2 = ansm[w - 1][w - 1]; t3 = ansm[w - 1][w - 1]; t4 = ansp[w - 1][w - 1]; t5 = ansm[w - 1][w - 1]; t6 = ansp[w - 1][w - 1]; for (int i = w; i <= n; i++) { ans[i][w] = max(t5 + a[i], t6 - a[i]); ansp[i][w] = max(t1, t3 + 2 * a[i]); ansm[i][w] = max(t2, t4 - 2 * a[i]); t1 = max(t1, ansp[i][w - 1]); t2 = max(t2, ansm[i][w - 1]); t3 = max(t3 + 2 * a[i], ansm[i][w - 1]); t4 = max(t4 - 2 * a[i], ansp[i][w - 1]); t5 = max(t5 + a[i], ansm[i][w - 1]); t6 = max(t6 - a[i], ansp[i][w - 1]); } } int an = -md; for (int i = 1; i <= n; i++) an = max(an, ans[i][k]); cout << an; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5; const long long inf = 1e18; int f[maxn][32], rt; long long ans, a[maxn]; vector<int> G[maxn]; void dfs(int u, int p) { long long d = 0; f[u][0] = p; for (d = 1; d <= 20; d++) { if (f[u][d - 1] != -1) f[u][d] = f[f[u][d - 1]][d - 1]; } long long tmp = inf; for (d = 0; d <= 20; d++) { if (f[u][d] != -1) tmp = min(tmp, (d + 1) * a[f[u][d]] + a[u]); else break; } tmp = min(tmp, (d + 1) * a[rt] + a[u]); if (p != -1) ans += tmp; for (int v : G[u]) if (v != p) dfs(v, u); } int main() { ios::sync_with_stdio(false); memset(f, -1, sizeof(f)); int n; cin >> n; a[rt] = inf; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] < a[rt]) rt = i; } for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } dfs(rt, -1); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 2e18; const int N = 1231234; int n, m; int a[N], b[N]; bool ok(long long x) { int i, j; for (i = 0, j = 0; i < m; ++i) { while (j < n && abs(b[i] - a[j]) <= x) j++; } return j == n; } int main() { while (cin >> n >> m) { int i, j; for (i = 0; i < n; ++i) scanf( %d , &a[i]); for (i = 0; i < m; ++i) scanf( %d , &b[i]); long long l = 0, r = INF; while (l <= r) { long long mid = (l + r) >> 1; if (ok(mid)) r = mid - 1; else l = mid + 1; } printf( %I64d n , l); } } |
#include <bits/stdc++.h> using namespace std; int n, a[3][55], b[55]; int sum(int row, int f, int e) { int res = 0; for (int i = f; i <= e; ++i) res += a[row][i]; return res; } int main() { cin >> n; for (int x = 1; x <= 2; ++x) for (int i = 1; i < n; ++i) cin >> a[x][i]; for (int i = 1; i <= n; ++i) cin >> b[i]; int ans = (1 << 30); for (int i = 1; i < n; ++i) for (int j = i + 1; j <= n; ++j) ans = min(ans, sum(1, 1, i - 1) + sum(2, i, n - 1) + b[i] + sum(1, 1, j - 1) + sum(2, j, n - 1) + b[j]); cout << ans; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int n, m; string s[100000]; int a[100000]; int b[100000]; string name; int id; vector<pair<int, string> > All; bool canMaxi(int k) { pair<int, string> He = make_pair(-a[id], name); He.first -= b[n - 1]; for (int i = k - 1; i >= 0; i--) { pair<int, string> I = All[i]; I.first -= b[k - 1 - i]; if (He < I) return false; } return true; } int findMaxi() { int l = n - 1, r = n - 1; for (int i = 0; i < (int)((All).size()); i++) if (make_pair(-a[id], name) < All[i]) { l = i; break; } while (r - l > 1) { int k = (l + r) / 2; if (canMaxi(k)) l = k; else r = k - 1; } if (l != r && canMaxi(r)) l++; return l; } bool canMini(int k) { pair<int, string> He = make_pair(-a[id], name); He.first -= b[0]; for (int i = k; i < n - 1; i++) { pair<int, string> I = All[i]; I.first -= b[(n - 1) - (i - k)]; if (!(He < I)) return false; } return true; } int findMini() { int l = 0, r = n - 1; for (int i = (int)((All).size()) - 1; i >= 0; i--) if (make_pair(-a[id], name) < All[i]) { r = i; break; } while (r - l > 1) { int k = (l + r) / 2; if (canMini(k)) r = k; else l = k + 1; } if (l != r && canMini(l)) r--; return r; } void solution() { scanf( %d n , &n); for (int i = 0, _n = (n); i < _n; ++i) { char t[64]; scanf( %s %d n , t, a + i); s[i] = string(t); } scanf( %d , &m); for (int i = 0, _n = (m); i < _n; ++i) scanf( %d n , b + i); sort(b, b + n, greater<int>()); cin >> name; for (int i = 0, _n = (n); i < _n; ++i) if (s[i] == name) { id = i; break; } for (int i = 0, _n = (n); i < _n; ++i) if (i != id) All.push_back(make_pair(-a[i], s[i])); sort((All).begin(), (All).end()); int mini = findMini(); int maxi = findMaxi(); printf( %d %d n , mini + 1, maxi + 1); } int main() { solution(); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:20000000 ) using namespace std; template <typename T1, typename T2, typename T3> struct triple { T1 a; T2 b; T3 c; triple(){}; triple(T1 _a, T2 _b, T3 _c) : a(_a), b(_b), c(_c) {} }; template <typename T1, typename T2, typename T3> bool operator<(const triple<T1, T2, T3> &t1, const triple<T1, T2, T3> &t2) { if (t1.a != t2.a) return t1.a < t2.a; else return t1.b < t2.b; } template <typename T1, typename T2> inline std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> inline std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) { bool first = true; os << [ ; for (unsigned int i = 0; i < v.size(); i++) { if (!first) os << , ; os << v[i]; first = false; } return os << ] ; } template <typename T> inline std::ostream &operator<<(std::ostream &os, const std::set<T> &v) { bool first = true; os << [ ; for (typename std::set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) { if (!first) os << , ; os << *ii; first = false; } return os << ] ; } template <typename T1, typename T2> inline std::ostream &operator<<(std::ostream &os, const std::map<T1, T2> &v) { bool first = true; os << [ ; for (typename std::map<T1, T2>::const_iterator ii = v.begin(); ii != v.end(); ++ii) { if (!first) os << , ; os << *ii; first = false; } return os << ] ; } template <typename T, typename T2> void printarray(T a[], T2 sz, T2 beg = 0) { for (T2 i = beg; i < sz; i++) cout << a[i] << ; } inline long long binpow(long long x, long long n) { long long res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } inline long long powmod(long long x, long long n, long long _mod) { long long res = 1; while (n) { if (n & 1) res = (res * x) % _mod; x = (x * x) % _mod; n >>= 1; } return res; } inline long long mulmod(long long x, long long n, long long _mod) { long long res = 0; while (n) { if (n & 1) res = (res + x) % _mod; x = (x + x) % _mod; n >>= 1; } return res; } inline long long gcd(long long a, long long b) { long long t; while (b) { a = a % b; t = a; a = b; b = t; } return a; } inline int gcd(int a, int b) { int t; while (b) { a = a % b; t = a; a = b; b = t; } return a; } inline long long lcm(int a, int b) { return a / gcd(a, b) * (long long)b; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long gcd(long long a, long long b, long long c) { return gcd(gcd(a, b), c); } inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); } inline long long lcm(long long a, long long b, long long c) { return lcm(lcm(a, b), c); } inline long long lcm(int a, int b, int c) { return lcm(lcm(a, b), (long long)c); } inline long long max(long long a, long long b) { return (a > b) ? a : b; } inline int max(int a, int b) { return (a > b) ? a : b; } inline double max(double a, double b) { return (a > b) ? a : b; } inline long long max(long long a, long long b, long long c) { return max(a, max(b, c)); } inline int max(int a, int b, int c) { return max(a, max(b, c)); } inline double max(double a, double b, double c) { return max(a, max(b, c)); } inline long long min(long long a, long long b) { return (a < b) ? a : b; } inline int min(int a, int b) { return (a < b) ? a : b; } inline double min(double a, double b) { return (a < b) ? a : b; } inline long long min(long long a, long long b, long long c) { return min(a, min(b, c)); } inline int min(int a, int b, int c) { return min(a, min(b, c)); } inline double min(double a, double b, double c) { return min(a, min(b, c)); } inline void getar(int *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %d , a + ii); } } inline void getar(long long *a, int n) { for (int ii = 0; ii < n; ii++) { scanf( %I64 , a + ii); } } bool a[1621][1621]; bool used[1621][1621]; bool used2[1621][1621]; bool used3[1621][1621]; const int maxl = 15; const int maxs = 10; int w, h; int k = 0; int cur = 0; int basei, basej; triple<int, int, int> q[10000]; int qs = 0; void go2(int i, int j) { if (((abs(i - basei) + abs(j - basej)) >= maxl) || (!a[i][j]) || used2[i][j]) return; used2[i][j] = true; qs = 0; q[qs].a = i; q[qs].b = j; q[qs++].c = 0; int qc = 0; while (qc < qs) { int curi = q[qc].a; int curj = q[qc].b; int curl = q[qc++].c; if (curl == maxl) break; for (int t = -1; t <= 1; t++) for (int w = -1; w <= 1; w++) { if (!used2[curi + t][curj + w] && a[curi + t][curj + w]) { used2[curi + t][curj + w] = true; q[qs].a = curi + t; q[qs].b = curj + w; q[qs++].c = curl + 1; } } } } vector<pair<int, int>> v3; bool check(int i, int j) { int s = 0; qs = 0; q[qs].a = i; q[qs].b = j; q[qs++].c = 0; used3[i][j] = true; int qc = 0; v3.clear(); while (qc < qs) { int curi = q[qc].a; int curj = q[qc].b; int curl = q[qc++].c; if (max(abs(basei - curi), abs(basej - curj)) > 2) continue; if (a[curi][curj]) s++; for (int t = -1; t <= 1; t++) for (int w = -1; w <= 1; w++) { if (!used3[curi + t][curj + w]) { used3[curi + t][curj + w] = true; v3.push_back(make_pair(curi + t, curj + w)); q[qs].a = curi + t; q[qs].b = curj + w; q[qs++].c = curl + 1; } } } for (int i = 0; i < v3.size(); i++) { used3[v3[i].first][v3[i].second] = false; } return (s < maxs); } void go(int i, int j) { if ((!a[i][j]) || used[i][j]) return; used[i][j] = true; go(i - 1, j); go(i + 1, j); go(i, j - 1); go(i, j + 1); if (used2[i][j]) return; int t = 0; if (a[i - 1][j] == 0) t++; if (a[i][j - 1] == 0) t++; if (a[i + 1][j] == 0) t++; if (a[i][j + 1] == 0) t++; if (t >= 2) { basei = i; basej = j; if (check(i, j)) { cur++; go2(i, j); } } } vector<int> ans; int main() { scanf( %d , &w); scanf( %d , &h); int x; for (int i = 5; i < w + 5; i++) { for (int j = 5; j < h + 5; j++) { scanf( %d , &x); a[i][j] = x; used[i][j] = used2[i][j] = false; } } for (int i = 5; i < w + 5; i++) { for (int j = 5; j < h + 5; j++) { if ((!used[i][j]) && a[i][j]) { k++; cur = 0; go(i, j); ans.push_back(cur); } } } cout << k << endl; sort(ans.begin(), ans.end()); for (int i = 0; i < k; i++) { cout << ans[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> const int inf = 2000000000; using namespace std; vector<vector<int> > g; vector<int> color; vector<bool> on_cycle; vector<int> parent; int n; bool isexit = false; void dfs(int v, int p = -1) { if (isexit) return; color[v] = 1; parent[v] = p; for (int i = 0; i < (int)g[v].size(); i++) { if (isexit) break; if (color[g[v][i]] == 0) dfs(g[v][i], v); else if (color[g[v][i]] == 1 && g[v][i] != parent[v]) { int j = v; while (j != g[v][i]) { on_cycle[j] = true; j = parent[j]; } on_cycle[g[v][i]] = true; isexit = true; } } color[v] = 3; } void dfs2(int v) { for (int i = 0; i < (int)g[v].size(); i++) if (color[g[v][i]] > color[v] + 1) { color[g[v][i]] = color[v] + 1; dfs2(g[v][i]); } } int main() { scanf( %d , &n); g.resize(n + 1); color.resize(n + 1); on_cycle.resize(n + 1, false); parent.resize(n + 1); for (int i = 1; i <= n; i++) { int u, v; scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } for (int i = 1; i <= n; i++) if (color[i] == 0) dfs(i); for (int i = 1; i <= n; i++) if (on_cycle[i]) color[i] = 0; else color[i] = inf; for (int i = 1; i <= n; i++) if (on_cycle[i]) dfs2(i); for (int i = 1; i <= n; i++) printf( %d , color[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3010; int n; int x[N], y[N], top; pair<int, pair<int, int> > st[N * N]; bitset<N> adj[N]; int sqr(int u) { return u * u; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d %d , &x[i], &y[i]); } for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int dis = sqr(abs(x[i] - x[j])) + sqr(abs(y[i] - y[j])); st[top++] = make_pair(dis, make_pair(i, j)); } } sort(st, st + top); for (int i = top - 1; i >= 0; i--) { int dis = st[i].first; int a = st[i].second.first; int b = st[i].second.second; if ((adj[a] & adj[b]).any()) { printf( %0.17f , sqrt(dis) / 2); return 0; } adj[a][b] = 1; adj[b][a] = 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int Set(int n, int pos) { return n = n | (1LL << pos); } int reset(int n, int pos) { return n = n & ~(1LL << pos); } bool check(int n, int pos) { return (bool)(n & (1LL << pos)); } int mul(int a, int b) { int c; c = (a % 1000000007 * b % 1000000007) % 1000000007; return c; } int add(int a, int b) { int c; c = (a % 1000000007 + b % 1000000007) % 1000000007; return c; } int sub(int a, int b) { int c; c = ((a % 1000000007 - b % 1000000007) % 1000000007 + 1000000007) % 1000000007; return c; } int par[300005]; int dis[300005]; int dia[300005]; vector<int> graph[300005]; int n, m, q; void cle_par() { for (int i = 1; i <= n; i++) { par[i] = i; dis[i] = -1; } } int find_pr(int r) { if (par[r] == r) { return r; } return par[r] = find_pr(par[r]); } void in_edges() { int u, v; for (int i = 1; i <= m; i++) { scanf( %d , &u); scanf( %d , &v); graph[u].push_back(v); graph[v].push_back(u); u = find_pr(u); v = find_pr(v); if (u != v) { par[u] = v; } } } void bfs(int main_src) { deque<int> q; vector<int> nod; dis[main_src] = 0; q.push_back(main_src); nod.push_back(main_src); while (!q.empty()) { int src = q.front(); q.pop_front(); for (int i = 0; i < graph[src].size(); i++) { int adj = graph[src][i]; if (dis[adj] == -1) { dis[adj] = dis[src] + 1; q.push_back(adj); nod.push_back(adj); } } } int maxi_dis = -1; int maxi_nod; for (int i = 0; i < nod.size(); i++) { if (dis[nod[i]] > maxi_dis) { maxi_dis = dis[nod[i]]; maxi_nod = nod[i]; } dis[nod[i]] = -1; } dis[maxi_nod] = 0; q.push_back(maxi_nod); nod.push_back(maxi_nod); while (!q.empty()) { int src = q.front(); q.pop_front(); for (int i = 0; i < graph[src].size(); i++) { int adj = graph[src][i]; if (dis[adj] == -1) { dis[adj] = dis[src] + 1; q.push_back(adj); } } } maxi_dis = -1; for (int i = 0; i < nod.size(); i++) { if (dis[nod[i]] > maxi_dis) { maxi_dis = dis[nod[i]]; } } dia[main_src] = maxi_dis; } void making_dia() { for (int i = 1; i <= n; i++) { if (par[i] == i) { bfs(i); } } } int main() { scanf( %d , &n); scanf( %d , &m); scanf( %d , &q); cle_par(); in_edges(); making_dia(); for (int i = 1; i <= q; i++) { int type; scanf( %d , &type); if (type == 1) { int x; scanf( %d , &x); int u = find_pr(x); printf( %d n , dia[u]); } else if (type == 2) { int x, y; scanf( %d , &x); scanf( %d , &y); int u = find_pr(x); int v = find_pr(y); if (u == v) { continue; } else { double first = (double)dia[u]; first /= 2.00; first -= 0.0000000001; first = ceil(first); double second = (double)dia[v]; second /= 2.00; second -= 0.0000000001; second = ceil(second); int uuu = (int)first; int vvv = (int)second; int tot_dia = uuu + vvv + 1; dia[v] = max(dia[u], max(dia[v], tot_dia)); par[u] = v; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; void maximize(int &a, int b) { a = max(a, b); } int absolut(int x) { if (x < 0) return -x; return x; } const int tope = 1 << 19; const int first = 1 << 18; struct elem { int ls, lH, lh, lb; int rs, rH, rh, rb; int sol; }; elem v[tope]; void recompute(int pos) { elem &e = v[pos]; elem &e0 = v[2 * pos]; elem &e1 = v[2 * pos + 1]; e.ls = e0.ls + e1.ls; e.lH = max(e0.lH, e0.ls + e1.lH); e.lh = min(e0.lh, e0.ls + e1.lh); e.lb = max(e0.lb, -e0.ls + e1.lb); if (e0.lh < e0.ls + e1.lH) maximize(e.lb, -2 * e0.lh + e0.ls + e1.lH); e.rs = e0.rs + e1.rs; e.rH = max(e1.rH, e0.rH + e1.rs); e.rh = min(e1.rh, e0.rh + e1.rs); e.rb = max(e1.rb, e0.rb - e1.rs); if (e1.rh < e0.rH + e1.rs) maximize(e.rb, -2 * e1.rh + e1.rs + e0.rH); e.sol = max(max(e0.sol, e1.sol), max(e0.rb + e1.lH, e0.rH + e1.lb)); } void insert(int pos, int val) { pos += first; elem &e = v[pos]; e.ls = val; e.lH = max(0, val); e.lh = min(0, val); e.lb = absolut(val); val *= -1; e.rs = val; e.rH = max(0, val); e.rh = min(0, val); e.rb = absolut(val); e.sol = absolut(val); while (pos > 1) { pos /= 2; recompute(pos); } } int n, cases; string s; void insert(int pos) { insert(pos, s[pos] == ( ? 1 : -1); } int main() { cin >> n >> cases >> s; s = + s; for (int i = 1; i < int(s.size()); i++) insert(i); cout << v[1].sol << endl; for (int cas = 0; cas < cases; cas++) { int pos0, pos1; cin >> pos0 >> pos1; swap(s[pos0], s[pos1]); insert(pos0); insert(pos1); cout << v[1].sol << endl; } } |
#include <bits/stdc++.h> using namespace std; int n, k, plen; char p[200], ar[200]; char res[200]; int preone[200]; bool pos, found; bool is_start(int ind) { if (plen + ind > n) return false; for (int l = 0; l < plen; l++) if (p[l] != res[l + ind]) return false; return true; } bool back(int ind) { if (ind < 0) { return true; } if (res[ind] != -1) { if (ar[ind] == 0 && is_start(ind)) return false; return back(ind - 1); } for (int i = 0; i < k; i++) { res[ind] = a + i; if (!is_start(ind)) if (back(ind - 1)) return true; } return false; } int main() { cin >> n >> k; cin >> p; cin >> ar; plen = strlen(p); for (int i = n - plen + 1; i < n; i++) { ar[i] = 0 ; } memset(res, -1, sizeof(res)); pos = true; for (int i = 0; i < n && pos; i++) { if (ar[i] == 1 ) { for (int j = 0; j < plen && pos; j++) { if (res[i + j] != -1 && res[i + j] != p[j]) pos = false; else res[i + j] = p[j]; } } } if (pos && back(n)) { for (int i = 0; i < n; i++) cout << res[i]; } else cout << No solution ; cout << endl; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:10000000000 ) using namespace std; const int MOD = 1000000007; const int INF = 1000000007LL; const long long INF2 = 1000000007LL * 1000000007LL; const long double EPS = 1e-9; const int SIZE = 100100; mt19937 rng(time(0)); uniform_int_distribution<int> uid(-1000000000, 1000000000); int n; int a[SIZE]; int d[210][SIZE][2]; const long long md = 998244353; const int val = 200; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; if (n == 1) { cout << 0; return 0; } for (int i = 1; i <= n; ++i) cin >> a[i]; for (int lst = 1; lst <= val; ++lst) { if (a[n] == -1) { d[lst][n][0] = lst; d[lst][n][1] = 1; } else { d[lst][n][0] = (a[n] <= lst); d[lst][n][1] = (a[n] == lst); } } for (int i = n - 1; i >= 1; --i) { if (a[i] != -1) { for (int lst = 1; lst <= val; ++lst) { d[lst][i][0] = d[a[i]][i + 1][lst < a[i]]; } for (int lst = 1; lst <= a[i]; ++lst) { d[lst][i][1] = d[a[i]][i + 1][lst < a[i]]; } continue; } long long pref = 0, suff = 0; for (int b = 1; b <= val; ++b) { suff += d[b][i + 1][1]; suff %= md; } for (int lst = 1; lst <= val; ++lst) { pref += d[lst][i + 1][0]; pref %= md; suff += md - d[lst][i + 1][1]; suff %= md; d[lst][i][0] = (pref + suff) % md; } suff = 0; for (int lst = val; lst >= 1; --lst) { d[lst][i][1] = (suff + d[lst][i + 1][0]) % md; suff += d[lst][i + 1][1]; suff %= md; } } cout << d[1][1][0]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long double pi = acos(-1); const int MOD = 1e9 + 7; const long long int LINF = 0x3f3f3f3f3f3f3f3f; int n, m, k, s; const int MAXN = 2005; int a[MAXN][MAXN]; int maxma[15], maxme[15], minma[15], minme[15]; int seq[MAXN * MAXN]; int get(int v1, int v2) { int ret = 0; ret = max(ret, maxma[v1] - minma[v2]); ret = max(ret, maxme[v1] - minme[v2]); return ret; } int main() { memset(minma, INF, sizeof(minma)); memset(minme, INF, sizeof(minme)); scanf( %d%d%d , &n, &m, &k); scanf( %d , &s); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %d , &a[i][j]); int v = a[i][j]; int ma = i + j; int me = i - j; maxma[v] = max(maxma[v], ma); maxme[v] = max(maxme[v], me); minma[v] = min(minma[v], ma); minme[v] = min(minme[v], me); } } int resp = 0; scanf( %d , &seq[0]); for (int i = 1; i < s; i++) { scanf( %d , &seq[i]); resp = max(resp, max(get(seq[i], seq[i - 1]), get(seq[i - 1], seq[i]))); } printf( %d n , resp); return 0; } |
#include <bits/stdc++.h> using namespace std; void make_uni(vector<int> &v) { sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); } int get(vector<int> &v, int d) { return lower_bound(v.begin(), v.end(), d) - v.begin(); } int getu(vector<int> &v, int d) { return upper_bound(v.begin(), v.end(), d) - v.begin(); } int n, k; vector<tuple<int, int, int> > que; int main() { scanf( %d %d , &n, &k); vector<int> c1; for (int i = 0, a, b, c; i < n; ++i) { scanf( %d %d %d , &a, &b, &c); c1.emplace_back(c); que.emplace_back(a, b, c); } make_uni(c1); vector<vector<int> > c2(c1.size()); for (int i = 0, a, b, c; i < n; ++i) { tie(a, b, c) = que[i]; c2[get(c1, c)].emplace_back(a + b); } for (int i = 0; i < c2.size(); ++i) make_uni(c2[i]); vector<vector<vector<int> > > c3(c2.size()); for (int i = 0; i < c3.size(); ++i) c3[i].resize(c2[i].size()); for (int i = 0, a, b, c; i < n; ++i) { tie(a, b, c) = que[i]; int k1 = get(c1, c); int k2 = get(c2[k1], a + b); for (int i = k2 + 1; i; i -= i & -i) c3[k1][i - 1].emplace_back(a); } for (int i = 0; i < c3.size(); ++i) for (int j = 0; j < c3[i].size(); ++j) make_uni(c3[i][j]); vector<vector<vector<int> > > t(c3.size()); for (int i = 0; i < c3.size(); ++i) { t[i].resize(c3[i].size()); for (int j = 0; j < t[i].size(); ++j) t[i][j].resize(c3[i][j].size()); } sort(que.begin(), que.end(), [&](const tuple<int, int, int> &a, const tuple<int, int, int> &b) { return get<0>(a) < get<0>(b); }); long long sum = 0; for (auto &x : que) { int a, b, c; tie(a, b, c) = x; for (int l = get(c1, c - k), r = getu(c1, c + k); l != r; ++l) for (int i = get(c2[l], a) + 1; i <= c2[l].size(); i += i & -i) for (int j = get(c3[l][i - 1], a - b) + 1; j <= c3[l][i - 1].size(); j += j & -j) sum += t[l][i - 1][j - 1]; int p = get(c1, c); for (int i = get(c2[p], a + b) + 1; i; i -= i & -i) for (int j = get(c3[p][i - 1], a) + 1; j; j -= j & -j) t[p][i - 1][j - 1]++; } printf( %lld n , sum); } |
#include <bits/stdc++.h> using namespace std; int prime(int n) { int val = sqrt(n), counter = 0; ; if (n == 1) return false; for (int i = 2; i <= val; i++) { if (!(n % i)) counter++; } if (counter) return -1; return n; } int root(int n) { int val = sqrt(n); int x = n, flag = 0; ; for (int i = 2; i <= val; i++) { if (!(n % i)) { while (n > 1) { if (n % i != 0) { flag = 1; break; } n = n / i; } if (flag) return -1; return x; } } return -1; } int main() { int n, counter = 0, val, val1; vector<int> vec; ; cin >> n; for (int i = 2; i <= n; i++) { val = prime(i); val1 = root(i); if (val != -1) { counter++; vec.push_back(val); } else if (val1 != -1) { counter++; vec.push_back(val1); } } cout << counter << endl; for (int i = 0; i < counter; i++) cout << vec[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int a1, a2, a3, b1, b2, b3, n, total = 0; cin >> a1 >> a2 >> a3 >> b1 >> b2 >> b3 >> n; if ((a1 + a2 + a3) % 5 == 0) { total = total + (a1 + a2 + a3) / 5; } else { total = total + 1 + (a1 + a2 + a3) / 5; } if ((b1 + b2 + b3) % 10 == 0) { total = total + (b1 + b2 + b3) / 10; } else { total = total + 1 + (b1 + b2 + b3) / 10; } if (total <= n) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int R = 300005; const int inf = 2000000001; const int mod = 998244353; map<char, int> m; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; string second; cin >> second; if (k == 1) { for (int i = 0; i < n; i++) { m[second[i]]++; } int ma = 0; for (int i = 0; i < n; i++) { if (m[second[i]] > ma) ma = m[second[i]]; } cout << ma; return 0; } char last = second[0]; int l = 1; for (int i = 1; i < n; i++) { if (second[i] == second[i - 1] && l > 0) { l++; if (l == k) { l = 0; m[second[i]]++; } } else { l = 1; last = second[i]; } } int ma = 0; for (int i = 0; i < n; i++) { if (m[second[i]] > ma) ma = m[second[i]]; } cout << ma; } |
#include <bits/stdc++.h> long long int maxx(long long int a, long long int b) { return a > b ? a : b; } long long int minn(long long int a, long long int b) { return a > b ? b : a; } using namespace std; int dx[] = {1, 1, 1, 0, 0, -1, -1, -1, 0}; int dy[] = {-1, 0, 1, 1, -1, 0, 1, -1, 0}; void boostIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long int gcd(long long int a, long long int b) { return b == 0 ? a : gcd(b, a % b); } long long int lcm(long long int a, long long int b) { return (a * b) / gcd(a, b); } long long int poww(long long int base, long long int exp) { base %= 1000000007; long long int result = 1; while (exp > 0) { if (exp & 1) result = (result * base) % 1000000007; base = (base * base) % 1000000007; exp >>= 1; } return result; } const int Max_N = 100100; int dist[101][Max_N]; vector<int> a[Max_N], type[101]; void bfs(int t) { for (int i = 0; i <= 100000; i++) dist[t][i] = 1e9; queue<int> q; for (int i = 0; i < type[t].size(); i++) q.push(type[t][i]), dist[t][type[t][i]] = 0; while (!q.empty()) { int node = q.front(); q.pop(); for (int i = 0; i < a[node].size(); i++) { if (dist[t][a[node][i]] > dist[t][node] + 1) { dist[t][a[node][i]] = dist[t][node] + 1; q.push(a[node][i]); } } } return; } int main() { boostIO(); int n, m, k, seco3nd; cin >> n >> m >> k >> seco3nd; for (int i = 1; i <= n; i++) { int x; cin >> x; type[x].push_back(i); } for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; a[u].push_back(v), a[v].push_back(u); } for (int i = 1; i <= k; i++) { bfs(i); } for (int i = 1; i <= n; i++) { priority_queue<int> q; int ans = 0; for (int j = 1; j <= k; j++) { q.push(-dist[j][i]); } for (int j = 0; j < seco3nd; j++) { ans = ans + -q.top(); q.pop(); } cout << ans << ; } } |
#include <stdio.h> #include <stdlib.h> #include <sys/time.h> #define N 300000 int min(int a, int b) { return a < b ? a : b; } unsigned int X; void srand_() { struct timeval tv; gettimeofday(&tv, NULL); X = tv.tv_sec ^ tv.tv_usec; if (X % 2 == 0) X++; } int rand_() { return (X *= 3) >> 1; } int *ej[N], eo[N]; void append(int i, int j) { int o = eo[i]++; if (o >= 2 && (o & o - 1) == 0) ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]); ej[i][o] = j; } int aa[N], pp[N], dd[N], mn[N]; void dfs1(int i, int d) { int o; dd[i] = d; for (o = eo[i]; o--; ) { int j = ej[i][o]; dfs1(j, d + 1); } } int bb[N], a_, a, b; void sort(int *ii, int l, int r) { while (l < r) { int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp; while (j < k) if (mn[ii[j]] == mn[i_]) j++; else if (mn[ii[j]] < mn[i_]) { tmp = ii[i], ii[i] = ii[j], ii[j] = tmp; i++, j++; } else { k--; tmp = ii[j], ii[j] = ii[k], ii[k] = tmp; } sort(ii, l, i); l = k; } } void dfs2(int i) { int o; mn[i] = aa[i]; for (o = eo[i]; o--; ) { int j = ej[i][o]; dfs2(j); mn[i] = min(mn[i], mn[j]); } sort(ej[i], 0, eo[i]); } int dfs3(int i) { int o; bb[i] = ++b; for (o = 0; o < eo[i]; o++) { int j = ej[i][o]; if (!dfs3(j)) return 0; } if (aa[i] < a_ && aa[i] != a++) return 0; return 1; } int dfs4(int i) { int o; if (aa[i] < a_) return 1; if (aa[i] != a++) return 0; for (o = 0; o < eo[i]; o++) { int j = ej[i][o]; if (!dfs4(j)) return 0; } return 1; } int main() { static int ii[N]; int n, h, i, j, tmp; long long ans; srand_(); scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &aa[i]), aa[i]--; ii[aa[i]] = i; } for (i = 0; i < n; i++) ej[i] = (int *) malloc(2 * sizeof *ej[i]); for (h = 0; h < n - 1; h++) { scanf( %d%d , &i, &j), i--, j--; append(i, j); pp[j] = i; } dfs1(0, 0); a_ = 0, ans = 0; while (ii[a_] != 0) ans += dd[ii[a_++]]; if (a_ > 0) { i = ii[--a_]; while (i != 0) { if (aa[pp[i]] != a_ + dd[i]) { printf( NO n ); return 0; } tmp = aa[i], aa[i] = aa[pp[i]], aa[pp[i]] = tmp; i = pp[i]; } } dfs2(0); if (!dfs3(0) || !dfs4(0)) { printf( NO n ); return 0; } printf( YES n ); printf( %lld n , ans); for (i = 0; i < n; i++) printf( %d , bb[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long dp[1001][2001][4]; long long solve(long long n, long long k, long long i) { if (dp[n][k][i] != -1) { return dp[n][k][i]; } if (k < 1 || k > 2 * n) return 0; if (i == 0) { dp[n][k][i] = solve(n - 1, k, 0) + solve(n - 1, k - 1, 1) + solve(n - 1, k - 1, 2) + solve(n - 1, k - 2, 3); } else if (i == 1) { dp[n][k][i] = solve(n - 1, k, 0) + solve(n - 1, k, 1) + solve(n - 1, k - 1, 2) + solve(n - 1, k, 3); } else if (i == 2) { dp[n][k][i] = solve(n - 1, k, 0) + solve(n - 1, k - 1, 1) + solve(n - 1, k, 2) + solve(n - 1, k, 3); } else { dp[n][k][i] = solve(n - 1, k - 2, 0) + solve(n - 1, k - 1, 1) + solve(n - 1, k - 1, 2) + solve(n - 1, k, 3); } dp[n][k][i] %= mod; return dp[n][k][i]; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); memset(dp, -1, sizeof dp); long long n, k; cin >> n >> k; dp[1][1][0] = dp[1][1][3] = 0; dp[1][1][1] = dp[1][1][2] = 1; dp[1][2][0] = dp[1][2][3] = 1; dp[1][2][1] = dp[1][2][2] = 0; cout << (solve(n, k, 0) + solve(n, k, 1) + solve(n, k, 2) + solve(n, k, 3)) % mod << endl; } |
#include <bits/stdc++.h> using namespace std; const long long int maxn = 2005; long long int cnt[26]; long long int n, k; bool ok(long long int l, long long int k) { long long int k2 = k % l; if (k2 == 0) return 1; if (l % k2 != 0) return cnt[25] >= l; long long int need = l / k2; for (long long int i = 25; i >= 0; i--) { l -= (cnt[i] / need) * need; if (l <= 0) return 1; } return 0; } int32_t main() { long long int t; cin >> t; while (t--) { for (long long int i = 0; i < 26; i++) cnt[i] = 0; string s; cin >> n >> k >> s; for (long long int i = 0; i < n; i++) cnt[s[i] - a ]++; sort(cnt, cnt + 26); long long int ans; long long int flag = 1; for (ans = n; ans >= 1; ans--) { for (long long int i = 1; i * i <= k and flag; i++) { if (k % i) continue; if (ok(ans, i)) flag = 0; if (flag and k / i != i and ok(ans, k / i)) flag = 0; } if (flag == 0) break; } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; const int oo = 1e9; const int MOD = 1000000007; const int N = 100010; vector<int> g[N]; multiset<int> seg[4 * N], stk; int n, u, v, sz[N], st[N], ed[N], bk[N], cnt = 1, res[N]; void dfs(int u, int p) { sz[u] = 1, bk[cnt] = u, st[u] = cnt++; for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; dfs(v, u); sz[u] += sz[v]; } ed[u] = cnt - 1; } void update(int n, int s, int e, int at, int val, int type) { if (s > at || e < at) return; if (type == 0) { seg[n].insert(val); } else { seg[n].erase(seg[n].find(val)); } if (s == e) return; update(2 * n, s, (s + e) / 2, at, val, type); update(2 * n + 1, (s + e) / 2 + 1, e, at, val, type); } inline int check(multiset<int> &mst, int mn, int mx, int OFFSET) { int ans = 1e9; int S = (mx - mn) / 2 + OFFSET; multiset<int>::iterator it = mst.lower_bound(S); for (int f = 0; f < 2; ++f) { if (it != mst.end() && (*it != n)) ans = min(ans, max(mx - (*it - OFFSET), mn + (*it - OFFSET))); if (it == mst.begin()) break; it--; } return ans; } int l, r, mn, mx; int get(int n, int s, int e) { if (s > r || e < l) return oo; if (s >= l && e <= r) return check(seg[n], mn, mx, 0); return min(get(2 * n, s, (s + e) / 2), get(2 * n + 1, (s + e) / 2 + 1, e)); } int get(int _l, int _r, int _mn, int _mx) { l = _l; r = _r; mn = _mn; mx = _mx; if (l > r) return oo; return get(1, 1, n); } void solve(int u, int p) { pair<int, int> mx(-1, -1), mn(1e9, -1); for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; mx = max(mx, make_pair(sz[v], v)); mn = min(mn, make_pair(sz[v], v)); } if (p != -1) { mx = max(mx, make_pair(n - sz[u], p)); mn = min(mn, make_pair(n - sz[u], p)); } update(1, 1, n, st[u], sz[u], 1); int ans = max(0, mx.first); if (mx.first != mn.first) { if (mx.second == p) { ans = min(ans, get(1, st[u] - 1, mn.first, mx.first)); ans = min(ans, get(ed[u] + 1, n, mn.first, mx.first)); ans = min(ans, check(stk, mn.first, mx.first, sz[u])); } else { ans = min(ans, get(st[mx.second], ed[mx.second], mn.first, mx.first)); } for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; if (v == mx.second || v == mn.second) continue; ans = max(ans, sz[v]); } if (p != -1 && mx.second != p && mn.second != p) { ans = max(ans, n - sz[u]); } } res[u] = ans; stk.insert(sz[u]); for (int i = 0; i < g[u].size(); ++i) { solve(g[u][i], u); } stk.erase(stk.find(sz[u])); update(1, 1, n, st[u], sz[u], 0); } int root = -1; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d%d , &u, &v); if (!u) { root = v; continue; } g[u].push_back(v); } dfs(root, -1); for (int i = 1; i <= n; ++i) update(1, 1, n, st[i], sz[i], 0); solve(root, -1); for (int i = 1; i <= n; ++i) { printf( %d n , res[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> myvec; long long int dp[100003]; int main() { int t1, t2, x, index1, index2, time, n; vector<int>::iterator it, it2; cin >> n; myvec.push_back(0); dp[0] = 0; for (int i = 0; i < n; i++) cin >> x, myvec.push_back(x); for (int i = 1; i <= n; i++) { time = myvec[i]; t1 = max(0, myvec[i] - 90); t2 = max(0, myvec[i] - 1440); it = upper_bound(myvec.begin(), myvec.end(), t1); it2 = upper_bound(myvec.begin(), myvec.end(), t2); index1 = it - myvec.begin(); index2 = it2 - myvec.begin(); if (myvec[i] - 90 < 0) { dp[i] = min(dp[0] + 50, dp[0] + 120); dp[i] = min(dp[i], dp[i - 1] + 20); } else { if (myvec[i] - 1440 < 0) dp[i] = min(dp[index1 - 1] + 50, dp[0] + 120); else dp[i] = min(dp[index1 - 1] + 50, dp[index2 - 1] + 120); dp[i] = min(dp[i], dp[i - 1] + 20); } } for (int i = 1; i <= n; i++) cout << dp[i] - dp[i - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937_64 random_num( chrono::high_resolution_clock::now().time_since_epoch().count()); const int MOD = 1000000007; const int inf = 2000000000; const int mod = 1007050321; const double e = 0.000001; const int N = 200005; const bool aut = 788480; const int base = 521; int n, m, p, b[N], a[N]; int poww(int n, int a) { if (n == 1) return a; if (n == 0) return 0; int t = poww(n / 2, a); t = 1LL * t * t % MOD; if (n & 1) t = 1LL * t * a % MOD; return t; } int main() { ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m >> p; vector<int> pack; for (int i = 1; i <= n; ++i) cin >> a[i], pack.push_back(a[i]); for (int i = 1; i <= m; ++i) cin >> b[i], pack.push_back(b[i]); sort((pack).begin(), (pack).end()); for (int i = 1; i <= n; ++i) a[i] = lower_bound((pack).begin(), (pack).end(), a[i]) - pack.begin() + 1; for (int i = 1; i <= m; ++i) b[i] = lower_bound((pack).begin(), (pack).end(), b[i]) - pack.begin() + 1; vector<int> ans; long long S = 0, T = 1; for (int i = 1; i <= m; ++i) S += b[i], T = 1LL * T * b[i] % MOD; for (int i = 1; i <= p; ++i) { long long sum = 0; int mul = 1; if ((n - i) / p < m - 1) break; for (int j = 0; j <= m - 1; ++j) { sum += a[i + j * p]; mul = 1LL * mul * a[i + j * p] % MOD; } if (sum == S && mul == T) ans.push_back(i); for (int j = m; i + j * p <= n; ++j) { sum += a[i + j * p] - a[i + (j - m) * p]; mul = 1LL * mul * poww(MOD - 2, a[i + (j - m) * p]) % MOD * a[i + j * p] % MOD; if (mul == T && sum == S) ans.push_back(i + (j - m + 1) * p); } } sort((ans).begin(), (ans).end()); cout << ans.size() << n ; for (int v : ans) cout << v << ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } long long select(vector<long long>& a, long long k) { for (long long l = 0, r = a.size() - 1; l <= r;) { long long p = a[(l + r) / 2]; long long i = l - 1, j = r + 1; while (1) { while (a[++i] < p) ; while (a[--j] > p) ; if (i >= j) break; swap(a[i], a[j]); } if (k == i - l) return a[i]; else if (k < i - l) { r = i - 1; } else if (k > i - l) { k -= (i - l + 1); l = j + 1; } } return -99999999; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long modinv(long long a, long long m) { long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if (u < 0) u += m; return u; } vector<pair<long long, long long>> prim; void pf(long long n) { long long s = sqrt(n); long long r = 0; for (long long i = 2; i <= s; i++) { if ((n % i) == 0) { r = 0; do { r++; n = n / i; } while ((n % i) == 0); prim.push_back({i, r}); } } if (n > s) { prim.push_back({n, 1}); } } long long powmod(int a, int n) { long long x = 1; while (n > 0) { if (n & 1) { x = (x * a) % (long long)(1e9 + 7); } a = (a * a) % (long long)(1e9 + 7); n >>= 1; } return x; } void solve() { long long N; cin >> N; string s; cin >> s; vector<string> cs(30); vector<string> csr(30); long long ans = -1; for (long long j = 0; j < (26); j++) { char ch = j + a ; for (long long i = 0; i < (N); i++) { if (s[i] != ch) { cs[j] += s[i]; } } csr[j] = cs[j]; reverse(csr[j].begin(), csr[j].end()); if (csr[j] != cs[j]) continue; long long cnt = 0; long long x1 = 0; long long x2 = N - 1; while (x2 - x1 >= 1) { if (s[x1] == s[x2]) { x1++; x2--; } else if (s[x1] == ch) { x1++; cnt++; } else if (s[x2] == ch) { x2--; cnt++; } } if (ans < 0 || ans > cnt) ans = cnt; } cout << ans << endl; } int main(void) { long long t; cin >> t; for (long long i = 0; i < (t); i++) solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 6; int ans[N]; int main() { int n, k; scanf( %d %d , &n, &k); if (k == 1 or k * 3 > n) return !printf( -1 n ); for (int x = 1; x <= k; x += 2) { for (int j = 0; j < 6; ++j) { if (j == 0 or j == 1 or j == 3) ans[(x - 1) * 3 + j + 1] = x; else ans[(x - 1) * 3 + j + 1] = x + 1; } } for (int i = 1; i <= n; ++i) if (ans[i] > k or ans[i] == 0) ans[i] = 1; if (n % 3 == 0 and k % 2 == 1) ans[1] = k, ans[n] = 1; for (int i = 1; i <= n; ++i) printf( %d , ans[i]); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3E4 + 5; const int maxm = 1E5 + 5; int n, m, cnt; int ans[maxn]; bool vis[maxn]; vector<int> to[maxn]; void DFS(int u, int fa) { vis[u] = 1; for (int i = 0; i < to[u].size(); ++i) { int v = to[u][i]; if (!vis[v]) DFS(v, u); else if (v == fa) { puts( -1 ); exit(0); } } ans[++cnt] = u; } int main() { scanf( %d%d , &n, &m); while (m--) { int x, y; scanf( %d%d , &x, &y); to[x].push_back(y); } for (int i = 1; i <= n; ++i) if (!vis[i]) DFS(i, 0); for (int i = 1; i <= n; ++i) printf( %d , ans[i]); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2016; vector<int> g[2][maxn]; vector<int> g2[2][maxn]; vector<int> gr[2][maxn]; int n; int neg(int first) { if (first < n) { return first + n; } else { return first - n; } } void add(int f, int first, int second) { g[f][first].push_back(second); gr[f][second].push_back(first); } vector<int> was; vector<int> ls[2]; vector<int> col[2]; vector<int> who[2][maxn]; int C[2]; void dfs1(int f, int v) { was[v] = 1; for (int e : g[f][v]) if (!was[e]) { dfs1(f, e); } ls[f].push_back(v); } void dfs2(int f, int v, int c) { col[f][v] = c; who[f][c].push_back(v); for (int e : gr[f][v]) if (col[f][e] == -1) { dfs2(f, e, c); } } void compress(int f) { was = vector<int>(2 * n, 0); for (int i = 0; i < 2 * n; i++) { if (was[i] == 0) { dfs1(f, i); } } col[f] = vector<int>(2 * n, -1); reverse((ls[f]).begin(), (ls[f]).end()); C[f] = 0; for (int v : ls[f]) { if (col[f][v] == -1) { dfs2(f, v, ++C[f]); } } for (int v = 0; v < 2 * n; v++) { for (int e : g[f][v]) { g2[f][col[f][v]].push_back(col[f][e]); } } for (int i = 1; i <= C[f]; i++) { { sort((g2[f][i]).begin(), (g2[f][i]).end()), g2[f][i].resize(unique((g2[f][i]).begin(), (g2[f][i]).end()) - g2[f][i].begin()); }; } } vector<unsigned long long> path[2][maxn]; int K; void SET(vector<unsigned long long>& a, int first) { a[first >> 6] |= ((unsigned long long)1) << (first & 63); } bool ISONE(vector<unsigned long long>& a, int first) { return (a[first >> 6] >> (first & 63)) & 1; } void OR(vector<unsigned long long>& a, vector<unsigned long long>& b, int first) { for (int i = first >> 6; i < K; i++) { a[i] |= b[i]; } } void calcpath(int f) { K = (C[f] + 1) / 64 + 2; for (int i = 1; i <= C[f]; i++) { path[f][i] = vector<unsigned long long>(K, 0); } for (int v = C[f]; v >= 1; v--) { SET(path[f][v], v); for (int e : g2[f][v]) { OR(path[f][v], path[f][e], e); } } } void printsol(int f) { for (int i = 0; i < n; i++) { if (col[f][i] < col[f][i + n]) { printf( 0 ); } else { printf( 1 ); } } } vector<pair<int, int>> lse[2]; bool can1(int f, int first) { return !ISONE(path[f][col[f][first]], col[f][neg(first)]); } bool can2(int f, int x1, int x2) { for (int i = 0; i < n; i++) { int val1 = -1; if (ISONE(path[f][col[f][x1]], col[f][i])) { val1 = 1; } if (ISONE(path[f][col[f][x1]], col[f][i + n])) { val1 = 0; } int val2 = -1; if (ISONE(path[f][col[f][x2]], col[f][i])) { val2 = 1; } if (ISONE(path[f][col[f][x2]], col[f][i + n])) { val2 = 0; } if (val1 != -1 && val2 != -1) { if (val1 != val2) { return false; } } } return true; } bool canprint(int f, int x1, int x2) { for (int i = 0; i < n; i++) { int val1 = -1; if (ISONE(path[f][col[f][x1]], col[f][i])) { val1 = 1; } if (ISONE(path[f][col[f][x1]], col[f][i + n])) { val1 = 0; } int val2 = -1; if (ISONE(path[f][col[f][x2]], col[f][i])) { val2 = 1; } if (ISONE(path[f][col[f][x2]], col[f][i + n])) { val2 = 0; } if (val1 == -1) { if (val2 == -1) { if (col[f][i] < col[f][i + n]) { printf( 0 ); } else { printf( 1 ); } } else { printf( %d , val2); } continue; } if (val2 == -1) { if (val1 == -1) { if (col[f][i] < col[f][i + n]) { printf( 0 ); } else { printf( 1 ); } } else { printf( %d , val1); } continue; } printf( %d , val1); } return false; } void can(int f1, int f2) { for (auto p : lse[f1]) { int v1 = p.first; int v2 = p.second; if (can1(f2, neg(v1)) && can1(f2, neg(v1))) { if (can2(f2, neg(v1), neg(v2))) { canprint(f2, neg(v1), neg(v2)); exit(0); } } } } int main() { vector<int> m(2, 0); scanf( %d %d %d , &n, &m[0], &m[1]); for (int f = 0; f < 2; f++) { for (int i = 0; i < m[f]; i++) { int first, second; scanf( %d %d , &first, &second); if (first > 0) { first = first - 1; } else { first = -first - 1 + n; } if (second > 0) { second = second - 1; } else { second = -second - 1 + n; } lse[f].push_back(make_pair(first, second)); add(f, neg(first), second); add(f, neg(second), first); } compress(f); calcpath(f); } vector<bool> nosol(2, false); for (int f = 0; f < 2; f++) { for (int i = 0; i < n; i++) { if (ISONE(path[f][col[f][i]], col[f][i + n]) && ISONE(path[f][col[f][i + n]], col[f][i])) { nosol[f] = true; } } } if (nosol[0] && nosol[1]) { printf( SIMILAR n ); return 0; } if (nosol[0] && !nosol[1]) { printsol(1); return 0; } if (!nosol[0] && nosol[1]) { printsol(0); return 0; } can(0, 1); can(1, 0); printf( SIMILAR n ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool h[1000009]; int main() { int n, m, k, tmp, tmp1, pos = 1; cin >> n >> m >> k; for (int i = 0; i < m; ++i) { cin >> tmp; h[tmp] = true; } if (h[1]) { cout << pos << endl; return 0; } for (int i = 0; i < k; ++i) { cin >> tmp >> tmp1; if (pos == tmp || tmp1 == pos) { pos = (tmp == pos) ? tmp1 : tmp; if (h[pos]) break; } } cout << pos << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, c, d, i, j, k, n, m, t; cin >> t; while (t--) { cin >> n; long long int ar[n + 5]; memset(ar, -1, sizeof(ar)); int f = 0; for (i = 0; i < n; i++) { cin >> a; if (ar[a] == -1) ar[a] = i; else { if ((abs(i - ar[a]) - 1) >= 1) f = 1; } } if (f == 0) cout << NO n ; else cout << YES n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> tmp; long long num(string str) { int len = str.size(); long long res = 0; for (int i = 0; i < len; i++) { res = res * 10 + str[i] - 0 ; } return res; } void solve(int N) { queue<string> q; q.push( 11 ); q.push( 22 ); q.push( 33 ); q.push( 44 ); q.push( 55 ); q.push( 66 ); q.push( 77 ); q.push( 88 ); q.push( 99 ); tmp.push_back( 11 ); tmp.push_back( 22 ); tmp.push_back( 33 ); tmp.push_back( 44 ); tmp.push_back( 55 ); tmp.push_back( 66 ); tmp.push_back( 77 ); tmp.push_back( 88 ); tmp.push_back( 99 ); while (!q.empty()) { string str = q.front(); q.pop(); if (tmp.size() >= N) return; for (int i = 0; i < 10; i++) { char ch = i + 48; int l = str.size() / 2; string kp = str.substr(0, l) + ch + ch + str.substr(l, l); tmp.push_back(kp); q.push(kp); } } } int main() { int k, p; scanf( %d%d , &k, &p); solve(k); long long res = 0; for (int i = 0; i < k; i++) { res = (res + num(tmp[i])) % p; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 50; int n, cnt; pair<int, int> poi[maxn], A[maxn]; void solve(int l, int r) { if (l > r) return; int mid = (l + r) >> 1; for (int i = l; i <= r; i++) poi[++cnt] = (pair<int, int>){A[mid].first, A[i].second}; solve(l, mid - 1); solve(mid + 1, r); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d , &A[i].first, &A[i].second); sort(A + 1, A + 1 + n); solve(1, n); sort(poi + 1, poi + 1 + cnt); cnt = unique(poi + 1, poi + 1 + cnt) - poi - 1; printf( %d n , cnt); for (int i = 1; i <= cnt; i++) printf( %d %d n , poi[i].first, poi[i].second); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100100, INF = 0x7fffffff, _INF = 0x80000000; class Splay_Tree { public: int tot, root; struct Splay_Node { int c[2], fa, key, cnt, size; Splay_Node() { c[0] = c[1] = fa = key = cnt = size = 0; return; } } p[maxn + 10]; void Init() { p[1].c[0] = p[1].size = tot = 2; p[1].key = INF; p[2].key = _INF; p[1].cnt = p[2].cnt = p[2].size = p[2].fa = root = 1; return; } inline bool Gr(int k) { return p[p[k].fa].c[0] != k; } inline void Update(int k) { p[k].size = p[k].cnt + p[p[k].c[0]].size + p[p[k].c[1]].size; return; } void Rotate(int a, bool t) { int b = p[a].c[t ^ 1]; if (p[b].fa = p[a].fa) p[p[a].fa].c[Gr(a)] = b; else root = b; if (p[a].c[t ^ 1] = p[b].c[t]) p[p[b].c[t]].fa = a; p[b].c[t] = a; p[a].fa = b; Update(a); Update(b); return; } void Splay(int k, int t = 0) { while (p[k].fa != t) { int F = p[k].fa, G = p[F].fa; if (G != t) { if (Gr(k) != Gr(F)) { Rotate(F, Gr(k) ^ 1); Rotate(G, Gr(k) ^ 1); } else { Rotate(G, Gr(F) ^ 1); Rotate(F, Gr(k) ^ 1); } } else Rotate(F, Gr(k) ^ 1); } return; } int Insert(int k, int key) { if (key != p[k].key) { bool t = key > p[k].key; while (p[k].c[t] && key != p[p[k].c[t]].key) t = key > p[k = p[k].c[t]].key; if (!p[k].c[t]) { p[p[k].c[t] = ++tot].key = key; p[tot].fa = k; k = tot; } else k = p[k].c[t]; } ++p[k].cnt; ++p[k].size; Splay(k); return k; } int Rank(int k, int key) { int rank = -1; while (k && key != p[k].key) { bool t = key > p[k].key; if (t) rank += p[p[k].c[0]].size + p[k].cnt; k = p[k].c[t]; } if (k && key == p[k].key) rank += p[k].cnt; return rank + p[p[k].c[0]].size; } } ST; int n; struct Point { int x, y; } P[maxn]; bool cmp1(Point a, Point b) { return a.x < b.x; } bool cmp2(Point a, Point b) { return a.y < b.y; } int v1[maxn], v2[maxn]; bool vis1[maxn], vis2[maxn]; int p[10], c[10]; int k = 0; struct node1 { int lx1, lx2, ly1, ly2, t1, t2, t3, t4; bool flag; } mes[maxn << 2]; int tot = -1, head[maxn]; struct node2 { int p, next, idx1, idx2; } edge[maxn << 4]; inline void Add(int u, int v, int idx1, int idx2) { edge[++tot] = (node2){v, head[u], idx1, idx2}; head[u] = tot; return; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d%d , &P[i].x, &P[i].y); for (int i = 1; i <= 9; ++i) { p[i] = i; scanf( %d , &c[i]); } sort(P + 1, P + n + 1, cmp1); for (int i = 1, j, sum = 0; i <= n; i = j + 1) { for (j = i; j < n && P[j].x == P[j + 1].x; ++j) ; v1[sum += j - i + 1] = P[i].x; vis1[sum] = 1; } sort(P + 1, P + n + 1, cmp2); for (int i = 1, j, sum = 0; i <= n; i = j + 1) { for (j = i; j < n && P[j].y == P[j + 1].y; ++j) ; v2[sum += j - i + 1] = i; vis2[sum] = 1; } memset(head, -1, sizeof(head)); do { int t1 = c[p[1]] + c[p[4]] + c[p[7]], t2 = t1 + c[p[2]] + c[p[5]] + c[p[8]], t3 = c[p[1]] + c[p[2]] + c[p[3]], t4 = t3 + c[p[4]] + c[p[5]] + c[p[6]]; if (vis1[t1] && vis1[t2] && vis2[t3] && vis2[t4]) { mes[++k] = (node1){v1[t1], v1[t2], P[v2[t3]].y, P[v2[t4]].y, c[p[1]], c[p[1]] + c[p[2]], c[p[1]] + c[p[4]], c[p[1]] + c[p[2]] + c[p[4]] + c[p[5]], 1}; Add(v2[t3], v1[t1], k, 1); Add(v2[t3], v1[t2], k, 2); Add(v2[t4], v1[t1], k, 3); Add(v2[t4], v1[t2], k, 4); } } while (next_permutation(p + 1, p + 10)); ST.Init(); for (int i = 1, j; i <= n; i = j + 1) { for (ST.Insert(ST.root, P[j = i].x); j < n && P[j].y == P[j + 1].y; ST.Insert(ST.root, P[++j].x)) ; for (int k = head[i]; ~k; k = edge[k].next) { int p = edge[k].p, idx1 = edge[k].idx1, idx2 = edge[k].idx2; int cnt = ST.Rank(ST.root, p); if (idx2 == 1 && mes[idx1].t1 != cnt) mes[idx1].flag = 0; if (idx2 == 2 && mes[idx1].t2 != cnt) mes[idx1].flag = 0; if (idx2 == 3 && mes[idx1].t3 != cnt) mes[idx1].flag = 0; if (idx2 == 4 && mes[idx1].t4 != cnt) mes[idx1].flag = 0; } } for (int i = 1; i <= k; ++i) if (mes[i].flag) { printf( %.10lf %.10lf n%.10lf %.10lf n , double(mes[i].lx1) + 0.5, double(mes[i].lx2) + 0.5, double(mes[i].ly1) + 0.5, double(mes[i].ly2) + 0.5); return 0; } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> using vc = vector<T>; template <class T> using vvc = vc<vc<T>>; template <class T> void mkuni(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } long long rand_int(long long l, long long r) { static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count()); return uniform_int_distribution<long long>(l, r)(gen); } template <class T> void print(T x, int suc = 1) { cout << x; if (suc == 1) cout << n ; else cout << ; } template <class T> void print(const vector<T>& v, int suc = 1) { for (int i = 0; i < v.size(); i++) print(v[i], i == (int)(v.size()) - 1 ? suc : 2); } const int INF = 0x3f3f3f3f; const int MAXN = 2e5 + 7; const int maxn = 2e6 + 7; int a[MAXN], b[MAXN]; int mx[maxn]; struct e { int u, v, w; } Edge[maxn]; bool cmp(e a, e b) { return a.w > b.w; } int fa[maxn]; int find(int x) { return (x == fa[x] ? x : fa[x] = find(fa[x])); } int main() { int n, m, cnt = 0; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= m; ++i) cin >> b[i]; for (int i = 1; i <= n + m + 1; ++i) fa[i] = i; long long s = 0; for (int i = 1; i <= n; ++i) { int sz; cin >> sz; for (int j = 1; j <= sz; ++j) { int u; cin >> u; Edge[++cnt] = {u, i + m, a[i] + b[u]}; s += (a[i] + b[u]); } } long long sum = 0; sort(Edge + 1, Edge + cnt + 1, cmp); for (int i = 1; i <= cnt; ++i) { int u = Edge[i].u, v = Edge[i].v, w = Edge[i].w; int fu = find(u), fv = find(v); if (fu == fv) continue; fa[fu] = fv; sum += w; } cout << s - sum << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, t, b, c, m, n, ck = 0, ans = 0, sum = 0; cin >> t; cin.ignore(); while (t--) { ck = 0; cin >> a; cin.ignore(); string s; cin >> s; b = a - 10; for (int i = 0; i < b; i++) { if (s[i] == 8 ) { ck = 1; } } if (ck == 1) { cout << YES << endl; } else { cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; if (n == 5 && x == 5) { printf( >...v nv.<.. n..^.. n>.... n..^.< n1 1 ); return 0; } if (n == 3 && x == 2) { printf( >vv n^<. n^.< n1 3 ); return 0; } for (int i = 0; i < 50; i++) { for (int j = 0; j < 33; j++) printf( > ); for (int j = 0; j < 33; j++) printf( .> ); printf( v n^ ); for (int j = 0; j < 33; j++) printf( <. ); printf( . ); for (int j = 0; j < 32; j++) printf( < ); printf( n ); } printf( 1 1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); using ll = long long; template <typename T> void DEBUG(string label, T value) { cerr << [ << label << = << value << ] n ; } const int oo = 1 << 30; void solve() { int n; cin >> n; int bsize; cin >> bsize; vector<int> arr(n + 2); for (int i = 1; i <= n; ++i) { cin >> arr[i]; arr[i] -= i; } arr[0] = -oo; arr[n + 1] = oo; vector<int> b(bsize + 2); for (int i = 1; i <= bsize; ++i) { cin >> b[i]; } b[0] = 0; b[bsize + 1] = n + 1; bsize += 2; n += 2; int ans = 0; for (int i = 0; i < bsize - 1; ++i) { if (arr[b[i]] > arr[b[i + 1]]) { cout << -1 << n ; return; } vector<int> dp; for (int j = b[i] + 1; j < b[i + 1]; ++j) { auto u = upper_bound(dp.begin(), dp.end(), arr[j]); if (arr[j] >= arr[b[i]] && arr[j] <= arr[b[i + 1]]) { if (u == dp.end()) { dp.push_back(arr[j]); } else { *u = arr[j]; } } } ans += b[i + 1] - b[i] - 1 - (int)dp.size(); } cout << ans << n ; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int dirx[] = {1, -1, 0, 0, 1, 1, -1, -1}, diry[] = {0, 0, 1, -1, 1, -1, 1, -1}; long long bigmod(long long x, long long p) { long long res = 1; while (p) { if (p & 1) res = (res * x) % 1000000007; x = (x * x) % 1000000007; p >>= 1; } return res; } int32_t main() { ios_base::sync_with_stdio(false); string s; cin >> s; long long ans = 0; int n = s.size(); for (long long i = 0, j = n - 1; i < n; i++, j--) { long long bef = i * (i + 1) / 2; bef %= 1000000007; bef *= (s[i] - 0 ); ans = (ans + bigmod(10, j) * bef % 1000000007) % 1000000007; } long long cur = 0; for (long long i = 0; i < n - 1; i++) { cur += (s[i] - 0 ); cur %= 1000000007; ans = (ans + bigmod(10, n - i - 2) * (n - i - 1) % 1000000007 * cur % 1000000007) % 1000000007; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 5; int n, k, sz, trie[MAX][26]; bool win[MAX], lose[MAX]; char s[MAX]; void dfs(int u) { int ady = 0; for (int i = 0; i < 26; i++) { if (trie[u][i] == 0) continue; ady++; int v = trie[u][i]; dfs(v); win[u] |= !win[v]; lose[u] |= !lose[v]; } if (ady == 0) { win[u] = 0; lose[u] = 1; } } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %s , s); int l = strlen(s); int r = 0; for (int i = 0; i < l; i++) { int c = s[i] - a ; if (trie[r][c] == 0) trie[r][c] = ++sz; r = trie[r][c]; } } dfs(0); if (win[0] && lose[0]) printf( First n ); else if (win[0] && !lose[0]) { if (k & 1) printf( First n ); else printf( Second n ); } else if (!win[0] && lose[0]) printf( Second n ); else printf( Second n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100004; int v[N]; int main(void) { priority_queue<int> q; int x, n; cin >> n; int res = 0; set<pair<int, int> > S; for (int i = 0; i < n; ++i) { int x; cin >> x; S.insert(make_pair(x, i + 1)); } int k = 1; for (auto it : S) { v[it.second] = k++; } for (int i = 1; i <= n; ++i) { x = v[i]; q.push(x); if (q.top() == i) { res++; while (q.size()) q.pop(); } } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<int> ini[100005]; vector<int> mat[100005]; int maior[100005]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { int a; cin >> a; mat[i].push_back(a); ini[i].push_back(0); maior[i] = 0x3f3f3f3f; } for (int j = 0; j < m; j++) for (int i = 1; i < n; i++) { if (mat[i][j] >= mat[i - 1][j]) { ini[i][j] = ini[i - 1][j]; if (maior[i] > ini[i][j]) maior[i] = ini[i][j]; } else { ini[i][j] = i; } } cin >> k; for (int i = 0; i < k; i++) { int l, r; cin >> l >> r; bool flag = false; if (maior[r - 1] <= l - 1 or l == r) cout << Yes << endl; else cout << No << endl; } return 0; } |
#include <bits/stdc++.h> const int MAXN = 3e5 + 5; const int SQ = 600; int n, p, m, w[MAXN]; long long sum[MAXN], ans[MAXN]; std::vector<int> vec[SQ]; struct Ques { int a, b; } ques[MAXN]; void ss(int x) { int step = ques[x].b; if (step > m) { long long res = 0; for (int i = ques[x].a; i <= n; i += step) res += w[i]; ans[x] = res; } else { vec[step].push_back(x); } } void solve() { scanf( %d , &n); m = sqrt(n); for (int i = 1; i <= n; i++) scanf( %d , w + i); scanf( %d , &p); for (int i = 1; i <= p; i++) scanf( %d%d , &ques[i].a, &ques[i].b); for (int i = 1; i <= p; i++) ss(i); for (int i = 1; i <= m; i++) { memset(sum, 0, sizeof(sum)); for (int j = n; j >= n - i + 1; j--) sum[j] = w[j]; for (int j = n - i; j >= 1; j--) sum[j] = w[j] + sum[j + i]; for (int x : vec[i]) ans[x] = sum[ques[x].a]; } for (int i = 1; i <= p; i++) printf( %I64d n , ans[i]); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 1e6, inf = 1e9, mod = 1000000007; vector<pair<int, int> > ad[N + 2], tree[N + 2]; int vis[N + 2], lev[N + 2]; void dfs(int node, int par, int lv) { vis[node] = 1, lev[node] = lv; for (auto x : ad[node]) { if (x.first == par) continue; if (vis[x.first]) { } else { tree[node].push_back(x); tree[x.first].push_back({node, x.second}); dfs(x.first, node, lv + 1); } } } int a[N + 2], cnt[N + 2]; void dds(int nd, int pr, int id) { for (auto x : tree[nd]) { if (x.first == pr) continue; dds(x.first, nd, x.second); } if (pr == -1) return; if (a[nd] == 1) { cnt[id] ^= 1; a[nd] = 0; if (a[pr] != -1) a[pr] ^= 1; } } int f; int vs[N + 2]; void dfs(int nd) { if (a[nd] == 1) { a[nd] = 0; f = 1; return; } else if (a[nd] == -1) { f = 1; return; } vs[nd] = 1; for (int i = 0; i < (int)tree[nd].size(); i++) { if (vs[tree[nd][i].first]) continue; cnt[tree[nd][i].second] ^= 1; dfs(tree[nd][i].first); if (f) break; cnt[tree[nd][i].second] ^= 1; } vs[nd] = 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; ad[u].push_back({v, i}); ad[v].push_back({u, i}); } dfs(1, -1, 0); dds(1, -1, 0); int ans = 0; f = 1; if (a[1] == 1) { f = 0; a[1] = 0; dfs(1); } if (f == 0) cout << -1 << endl, exit(0); for (int i = 1; i <= m; i++) ans += cnt[i]; cout << ans << endl; for (int i = 1; i <= m; i++) if (cnt[i]) cout << i << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char aa[100100]; int a[550][550]; int main() { int x, y, x0, y0; cin >> x >> y >> x0 >> y0; for (int i = 1; i <= x; i++) for (int j = 1; j <= y; j++) a[i][i] = 0; a[x0][y0] = 1; int sum = 1; scanf( %s , aa); int len = strlen(aa); cout << 1 ; for (int i = 0; i < len - 1; i++) { if (aa[i] == U ) { x0--; if (x0 < 1) x0++; if (a[x0][y0] == 1) cout << 0 ; else { cout << 1 ; sum++; a[x0][y0] = 1; } } if (aa[i] == D ) { x0++; if (x0 > x) x0--; if (a[x0][y0] == 1) cout << 0 ; else { cout << 1 ; sum++; a[x0][y0] = 1; } } if (aa[i] == L ) { y0--; if (y0 < 1) y0++; if (a[x0][y0] == 1) cout << 0 ; else { cout << 1 ; sum++; a[x0][y0] = 1; } } if (aa[i] == R ) { y0++; if (y0 > y) y0--; if (a[x0][y0] == 1) cout << 0 ; else { cout << 1 ; sum++; a[x0][y0] = 1; } } } cout << x * y - sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int l = s.length(); vector<char> s1; for (int i = 0; i < l; i++) { s1.push_back(s[i]); int f = 0; while (s[i] == / && i < l) { i++; f = 1; } if (f == 1) i--; } if (s1[s1.size() - 1] == / && s1.size() != 1) s1.pop_back(); for (int i = 0; i < s1.size(); i++) cout << s1[i]; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, x[100039], y[100039], z, now, cur, flag[100039]; long long d[100039], ans = 1e15; struct yyy { int to; long long w; int z; } tmps; struct ljb { int head, h[100039]; yyy f[600039]; inline void add(int x, int y, long long z) { f[++head] = (yyy){y, z, h[x]}; h[x] = head; } } s; struct tree { int x, y, num; } f[100039]; inline bool cmp1(tree x, tree y) { return x.x < y.x; } inline bool cmp2(tree x, tree y) { return x.y < y.y; } inline bool cmp3(tree x, tree y) { return x.num < y.num; } inline int calc(int a, int b) { return ((abs(x[a] - x[b])) < (abs(y[a] - y[b])) ? (abs(x[a] - x[b])) : (abs(y[a] - y[b]))); } inline int calc1(int a, int b) { return abs(x[a] - x[b]) + abs(y[a] - y[b]); } struct ques { int to; long long w; bool operator<(const ques &x) const { return w > x.w; } } tmp; priority_queue<ques> q; int main() { memset(d, 0x3f, sizeof(d)); memset(s.h, -1, sizeof(s.h)); register int i; scanf( %d%d , &n, &n); scanf( %d%d%d%d , &x[0], &y[0], &x[n + 1], &y[n + 1]); ans = abs(x[0] - x[n + 1]) + abs(y[0] - y[n + 1]); for (i = 1; i <= n; i++) scanf( %d%d , &f[i].x, &f[i].y), x[i] = f[i].x, y[i] = f[i].y, f[i].num = i; sort(f + 1, f + n + 1, cmp1); for (i = 2; i <= n; i++) s.add(f[i - 1].num, f[i].num, calc(f[i - 1].num, f[i].num)), s.add(f[i].num, f[i - 1].num, calc(f[i - 1].num, f[i].num)); sort(f + 1, f + n + 1, cmp2); for (i = 2; i <= n; i++) s.add(f[i - 1].num, f[i].num, calc(f[i - 1].num, f[i].num)), s.add(f[i].num, f[i - 1].num, calc(f[i - 1].num, f[i].num)); for (i = 1; i <= n; i++) s.add(0, i, calc(0, i)); for (i = 1; i <= n; i++) s.add(i, n + 1, calc1(i, n + 1)); q.push((ques){0, 0}); d[0] = 0; while (!q.empty()) { tmp = q.top(); q.pop(); cur = s.h[tmp.to]; while (~cur) { tmps = s.f[cur]; if (d[tmps.to] > d[tmp.to] + tmps.w) d[tmps.to] = d[tmp.to] + tmps.w, q.push((ques){tmps.to, d[tmps.to]}); cur = tmps.z; } } printf( %lld n , ((d[n + 1]) < (ans) ? (d[n + 1]) : (ans))); } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T, class T1> inline void gn(T &first, T1 &second) { gn(first); gn(second); } template <class T, class T1, class T2> inline void gn(T &first, T1 &second, T2 &z) { gn(first); gn(second); gn(z); } template <class T> inline void print(T first) { if (first < 0) { putchar( - ); return print(-first); } if (first < 10) { putchar( 0 + first); return; } print(first / 10); putchar(first % 10 + 0 ); } template <class T> inline void printsp(T first) { print(first); putchar( ); } template <class T> inline void println(T first) { print(first); putchar( n ); } template <class T, class U> inline void print(T first, U second) { printsp(first); println(second); } template <class T, class U, class V> inline void print(T first, U second, V z) { printsp(first); printsp(second); println(z); } int power(int a, int b, int m, int ans = 1) { for (; b; b >>= 1, a = 1LL * a * a % m) if (b & 1) ans = 1LL * ans * a % m; return ans; } int V, E, src, tar; int head[60000], work[60000], dis[60000]; int to[2010000], cap[2010000], nxt[2010000]; int q[60000], qf, qb; int n, m, males, females; void init(int n, int s, int t) { V = n; E = 0; src = s; tar = t; memset(head, -1, sizeof(int) * V); } void add_edge(int u, int v, int c) { to[E] = v; cap[E] = c; nxt[E] = head[u]; head[u] = E++; to[E] = u; cap[E] = 0; nxt[E] = head[v]; head[v] = E++; } bool bfs() { memset(dis, -1, sizeof(int) * V); qf = qb = 0; q[qb++] = src; dis[src] = 0; while (qf < qb && dis[tar] == -1) { int u = q[qf++]; for (int i = head[u]; i >= 0; i = nxt[i]) { int v = to[i]; if (dis[v] == -1 && cap[i] > 0) { dis[v] = dis[u] + 1; q[qb++] = v; } } } return dis[tar] >= 0; } int dfs(int u, int &bot) { int v, bot1, delta; if (u == tar) return bot; for (int &i = work[u]; i >= 0; i = nxt[i]) { int v = to[i]; if (dis[v] != dis[u] + 1 || cap[i] == 0) continue; bot1 = min(bot, cap[i]); if (delta = dfs(v, bot1)) { cap[i] -= delta; cap[i ^ 1] += delta; bot = bot1; return delta; } } return 0; } int dinic() { int ans = 0, delta, bot; while (bfs()) { memcpy(work, head, sizeof(int) * V); delta = 0x3f3f3f3f; while (delta = dfs(src, bot = 0x3f3f3f3f)) ans += delta; } return ans; } void NoSolution() { puts( -1 ); exit(0); } char grid[33][33]; int dst[33][33][33][33]; int dx[] = {0, 0, -1, 1}; int dy[] = {-1, 1, 0, 0}; int mx[33 * 33], my[33 * 33], mt[33 * 33]; int fx[33 * 33], fy[33 * 33], ft[33 * 33]; int can(long long mid) { init(males + females + n * m * 2 + 10, 0, males + females + n * m * 2 + 1); for (int i = 0; i < males; i++) { add_edge(src, i + 1, 1); for (int j = 1; j <= n; j++) for (int k = 1; k <= m; k++) { if (dst[mx[i]][my[i]][j][k] == 0x3f3f3f3f) continue; if ((long long)dst[mx[i]][my[i]][j][k] * mt[i] > mid) continue; add_edge(i + 1, males + (j - 1) * m + k, 1); } } for (int i = 0; i < females; i++) { add_edge(males + n * m * 2 + i + 1, tar, 1); for (int j = 1; j <= n; j++) for (int k = 1; k <= m; k++) { if (dst[fx[i]][fy[i]][j][k] == 0x3f3f3f3f) continue; if ((long long)dst[fx[i]][fy[i]][j][k] * ft[i] > mid) continue; add_edge(males + (j - 1) * m + k + n * m, males + n * m * 2 + i + 1, 1); } } for (int j = 1; j <= n; j++) for (int k = 1; k <= m; k++) add_edge(males + (j - 1) * m + k, males + (j - 1) * m + k + n * m, 1); return dinic() == males; } int main() { gn(n, m); gn(males, females); if (abs(males - females) != 1) NoSolution(); for (int i = 1; i <= n; i++) scanf( %s , grid[i] + 1); int r, c, t; gn(r, c, t); memset(dst, 0x3f, sizeof dst); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) if (grid[i][j] == . ) { dst[i][j][i][j] = 0; qf = qb = 0; q[qb++] = i; q[qb++] = j; while (qf < qb) { int u = q[qf++], v = q[qf++]; for (int k = 0; k < 4; k++) { int uu = u + dx[k], vv = v + dy[k]; if ((uu < 1 || vv < 1 || uu > n || vv > m) || grid[uu][vv] == # ) continue; if (dst[i][j][uu][vv] > dst[i][j][u][v] + 1) { dst[i][j][uu][vv] = dst[i][j][u][v] + 1; q[qb++] = uu; q[qb++] = vv; } } } } } for (int i = 0; i < males; i++) gn(mx[i], my[i], mt[i]); for (int i = 0; i < females; i++) gn(fx[i], fy[i], ft[i]); if (males == females + 1) { fx[females] = r; fy[females] = c; ft[females] = t; females++; } else if (males + 1 == females) { mx[males] = r; my[males] = c; mt[males] = t; males++; } assert(males == females); long long st = -1, ed = (long long)1e16; while (ed - st > 1) { long long mid = st + ed >> 1; if (can(mid)) ed = mid; else st = mid; } if (ed == (long long)1e16) NoSolution(); println(ed); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; string a, b; signed main() { ios_base::sync_with_stdio(0); cin.tie(); cout.tie(); cin >> a; b += a; reverse(a.begin(), a.end()); b += a; cout << b; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; long long n, m, a[200010], dp[200010][2]; vector<pair<long long, long long> > allseg, okseg; vector<long long> hvseg[200010]; void solve() { long long i, j, l, r, mn, dx, dy; scanf( %lld%lld , &n, &m); a[0] = -1000000000000; a[n + 1] = 1000000000000; hvseg[0].clear(); for (i = 1; i <= n; i++) { hvseg[i].clear(); scanf( %lld , &a[i]); } hvseg[n + 1].clear(); sort(a, a + n + 2); allseg.clear(); for (i = 0; i < m; i++) { scanf( %lld%lld , &l, &r); allseg.push_back(make_pair(l, r)); } sort(allseg.begin(), allseg.end()); okseg.clear(); mn = 1000000000000; for (i = allseg.size() - 1; i >= 0; i--) { if (allseg[i].second >= mn) { continue; } mn = min(mn, allseg[i].second); l = lower_bound(a, a + n + 2, allseg[i].first) - a; r = upper_bound(a, a + n + 2, allseg[i].second) - a - 1; if (l <= r) { continue; } hvseg[r].push_back(okseg.size()); okseg.push_back(allseg[i]); } reverse(okseg.begin(), okseg.end()); for (i = 0; i <= n + 1; i++) { for (j = 0; j < hvseg[i].size(); j++) { hvseg[i][j] = okseg.size() - hvseg[i][j] - 1; } reverse(hvseg[i].begin(), hvseg[i].end()); } for (i = 0; i <= n + 1; i++) { dp[i][0] = dp[i][1] = 1000000000000; } dp[0][0] = dp[0][1] = 0; for (i = 1; i <= n + 1; i++) { for (dx = 0; dx < 2; dx++) { if (dp[i - 1][dx] >= 1000000000000) { continue; } for (dy = 0; dy < 2; dy++) { if (hvseg[i - 1].size() == 0) { dp[i][dy] = min(dp[i][dy], dp[i - 1][dx]); continue; } dp[i][dy] = min( dp[i][dy], dp[i - 1][dx] + (dx + 1) * (okseg[hvseg[i - 1][hvseg[i - 1].size() - 1]].first - a[i - 1])); dp[i][dy] = min( dp[i][dy], dp[i - 1][dx] + (2 - dy) * (a[i] - okseg[hvseg[i - 1][0]].second)); for (j = 0; j + 1 < hvseg[i - 1].size(); j++) { dp[i][dy] = min(dp[i][dy], dp[i - 1][dx] + (dx + 1) * (okseg[hvseg[i - 1][j]].first - a[i - 1]) + (2 - dy) * (a[i] - okseg[hvseg[i - 1][j + 1]].second)); } } } } printf( %lld n , min(dp[n + 1][0], dp[n + 1][1])); return; } int main() { long long T; scanf( %lld , &T); while (T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 53; const int maxm = 23; int n, m; char s[maxn][maxm]; double dp[1 << 20]; long long f[1 << 20]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %s , s[i]); m = strlen(s[1]); memset(f, 0, sizeof(f)); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int same = 0; for (int k = 0; k < m; k++) { if (s[i][k] == s[j][k]) same |= (1 << k); } f[same] |= (1LL << j) | (1LL << i); } } for (int same = (1 << m) - 1; same >= 0; same--) { for (int i = 0; i < m; i++) { if (same & (1 << i)) f[same ^ (1 << i)] |= f[same]; } } double ans = 0; memset(dp, 0, sizeof(dp)); dp[0] = 1; for (int sta = 0; sta < (1 << m); sta++) { int cnt = 0; for (int i = 0; i < m; i++) if (sta & (1 << i)) cnt++; for (int i = 0; i < m; i++) { if (sta & (1 << i)) continue; dp[sta | (1 << i)] += dp[sta] / (m - cnt); } for (int i = 0; i < n; i++) { if (f[sta] & (1LL << i)) ans += dp[sta]; } } printf( %.10f n , ans / n); } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.