func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long int max(long long int a, long long int b) { if (a > b) return a; else return b; } void solve() { int n; cin >> n; vector<int> a(2 * n); for (int i = 0; i < 2 * n; i++) { cin >> a[i]; } int din = 0; for (int i = 0; i < 2 * n; i++) { if (a[i] == 1) din += 1; else din -= 1; } if (din == 0) { cout << 0 << endl; return; } map<int, int> m; int dr = 0; m[0] = n - 1; for (int i = n; i < 2 * n; i++) { if (a[i] == 1) dr += 1; else dr -= 1; if (!m.count(dr)) { m[dr] = i; } } int ans = 1e9 + 7; int dl = 0; if (m.count(din)) { ans = min(ans, m[din] - n + 1); } for (int i = n - 1; i >= 0; i--) { if (a[i] == 1) dl += 1; else dl -= 1; int q = din - dl; if (m.count(q)) { ans = min(ans, m[q] - i + 1); } } cout << ans << endl; } int main() { int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1.0); const double EPS = 1E-6; const int INF = 2 * (1e+9) + 1; const int MAXN = 3 * 100000001; const int MOD = (1e+9) + 7; int n, m; map<int, int> m1, m2; map<int, int> u, cnt; int main() { cin >> n; for (int i = 0; i < (n); ++i) { int t1, t2; cin >> t1 >> t2; m1[t1] = t2; m2[t2] = t1; cnt[t1]++; cnt[t2]++; } int cur = 0; vector<int> ans(n); int inx = 1; while (inx < n) { cur = m1[cur]; ans[inx] = cur; u[cur] = 1; inx += 2; if (!cur) break; } cur = 0, inx = n - 2; while (inx >= 0) { cur = m2[cur]; if (!cur) break; ans[inx] = cur; u[cur] = 1; inx -= 2; } if (n % 2 == 0) { for (map<int, int>::iterator it = m1.begin(); it != m1.end(); it++) { if (!u[it->first] && it->first) { ans[0] = it->first; } } } else { for (map<int, int>::iterator it = m1.begin(); it != m1.end(); it++) { if (cnt[it->first] == 1 && (!u[it->first])) { ans[0] = it->first; cur = ans[0], inx = 2; while (inx < n) { cur = m1[cur]; ans[inx] = cur; u[cur] = 1; inx += 2; if (!cur) break; } break; } } } for (int i = 0; i < ((int)(ans).size()); ++i) { cout << ans[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; vector<vector<pair<string, int>>> adl; vector<int> dist(2000, inf); map<pair<string, int>, int> nums; map<string, pair<int, int>> mins; void bfs(string& poly, int version) { vector<string> order; order.push_back(poly); mins[poly] = {0, version}; dist[1] = 0; for (int i = 0; i < order.size(); i++) { int u = nums[{order[i], mins[order[i]].second}]; for (auto j : adl[u]) { int v = nums[j], ver = j.second; string& s = j.first; if (dist[v] > dist[u] + 1) { dist[v] = dist[u] + 1; order.push_back(s); if (mins.find(s) == mins.end()) mins[s] = {dist[v], ver}; if (dist[v] < mins[s].first) { mins[s] = {dist[v], ver}; } else if (dist[v] == mins[s].first) { mins[s].second = max(mins[s].second, ver); } } } } } int main() { int n; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; adl.resize(2 * n); int m = 1, v = -1; string poly; for (int i = 0; i < n; i++) { int num, ind, vers; string s, s1; cin >> s >> num; if (i == 0) { poly = s; v = num; } if (nums[{s, num}] == 0) { nums[{s, num}] = m; m++; } ind = nums[{s, num}]; int k; cin >> k; for (int j = 0; j < k; j++) { cin >> s1 >> vers; if (s == s1) continue; adl[ind].push_back({s1, vers}); } } bfs(poly, v); cout << (int)mins.size() - 1 << n ; for (auto p : mins) if (p.first != poly) cout << p.first << << p.second.second << n ; } |
#include <bits/stdc++.h> using namespace std; using nagai = long long; const int N = 100; int matr[N][N]; const int K = 12; int de[N][K]; const int oo = 0x3f3f3f3f; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) cin >> matr[i][j]; int ans = oo; for (int i = 0; i < 30000; ++i) { memset(de, 0x3f, sizeof de); vector<int> col(n); for (int i = 0; i < n; ++i) col[i] = rnd() % 2; de[0][0] = 0; for (int l = 0; l < k; ++l) for (int a = 0; a < n; ++a) for (int b = 0; b < n; ++b) if (col[a] != col[b]) de[b][l + 1] = min(de[b][l + 1], de[a][l] + matr[a][b]); ans = min(ans, de[0][k]); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> const int mod = 1000000007, maxn = 200005, maxk = 105; int n, m; int a[maxn], fac[maxn], nfac[maxn], inv[maxn], sum[maxn][maxk]; inline int C(int a, int b) { return 1ll * fac[a] * nfac[b] % mod * nfac[a - b] % mod; } int main() { fac[0] = fac[1] = nfac[0] = nfac[1] = inv[1] = 1; for (int i = 2; i <= 200000; i++) fac[i] = 1ll * fac[i - 1] * i % mod, inv[i] = mod - 1ll * (mod / i) * inv[mod % i] % mod, nfac[i] = 1ll * nfac[i - 1] * inv[i] % mod; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) { int l, r, k; scanf( %d%d%d , &l, &r, &k); for (int j = 0; j <= k; j++) { sum[l][j] = (sum[l][j] + C(k, k - j)) % mod; sum[r + 1][j] = (sum[r + 1][j] - C(k + r - l + 1, k - j) + mod) % mod; } } for (int i = 1; i <= n; i++) for (int j = 100; j >= 0; j--) sum[i][j] = (sum[i][j] + (sum[i - 1][j + 1] + sum[i - 1][j]) % mod) % mod; for (int i = 1; i <= n; i++) printf( %d%c , (a[i] + sum[i][0]) % mod, i == n ? n : ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 500010; long long n, sx, sy, x, y, res[6]; int main() { scanf( %lld , &n); scanf( %lld%lld , &sx, &sy); for (int i = 0; i < n; i++) { scanf( %lld%lld , &x, &y); if (x < sx) res[1]++; if (y < sy) res[2]++; if (x > sx) res[3]++; if (y > sy) res[4]++; } long long mx = 0; for (int i = 1; i <= 4; i++) mx = max(mx, res[i]); for (int i = 1; i <= 4; i++) { if (mx == res[i]) { long long a, b; if (i == 1) { a = sx - 1, b = sy; } else if (i == 2) { a = sx, b = sy - 1; } else if (i == 3) { a = sx + 1, b = sy; } else a = sx, b = sy + 1; printf( %lld n , mx); printf( %lld %lld , a, b); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool uin(T &a, T b) { return (a > b ? a = b, true : false); } template <class T> bool uax(T &a, T b) { return (a < b ? a = b, true : false); } int const X = 8; int const L = 26; int const N = 41; long long const INF = 3e18 + 41; int x, k, n, q; int c[N]; int p[N], w[N]; long long d[(1 << X)][(1 << X)][L]; long long ans; bool bit(int m, int i) { return (m & (1 << i)); } int xorbit(int m, int i) { return (m ^ (1 << i)); } int qbit(int m) { int res = 0; while (m) { res += (m & 1); m /= 2; } return res; } int dx[(1 << X)][(1 << X)]; unordered_map<int, int> a; vector<pair<int, long long>> e[(1 << X)][L]; void build() { for (int i = 0; i < (1 << X); ++i) for (int j = 0; j < (1 << X); ++j) for (int o = 0; o < L; ++o) d[i][j][o] = INF; memset(dx, 255, sizeof(dx)); for (int i = 0; i < (1 << k); ++i) { if (!bit(i, 0)) { int m0 = i; int m1 = (m0 >> 1); uin(d[m0][m1][0], 0ll); } else { int m0 = i; for (int j = 1; j < k + 1; ++j) { if (bit(m0, j)) continue; int m1 = xorbit(m0, j); m1 = xorbit(m1, 0); m1 >>= 1; if (uin(d[m0][m1][0], (long long)c[j - 1])) dx[m0][m1] = j; } } } for (int o = 1; o < L; ++o) { for (int t = 0; t < (1 << k); ++t) { if (qbit(t) != x) continue; for (int i = 0; i < (1 << k); ++i) { if (qbit(i) != x) continue; for (int j = 0; j < (1 << k); ++j) { if (qbit(j) != x) continue; uin(d[i][j][o], d[i][t][o - 1] + d[t][j][o - 1]); } } } } for (int o = 0; o < L; ++o) { for (int i = 0; i < (1 << X); ++i) for (int j = 0; j < (1 << X); ++j) if (d[i][j][o] < INF) { if (qbit(i) != x) continue; e[i][o].push_back(make_pair(j, d[i][j][o])); } } } long long f[(1 << X)], nf[(1 << X)]; void solve() { int p1 = 0; int x0 = 0; for (int i = 0; i < (1 << X); ++i) f[i] = INF; f[(1 << x) - 1] = 0; while (x0 < n - x) { while (p1 < q && x0 > p[p1]) ++p1; int s; for (int i = L - 1; i >= 0; --i) { s = i; if (x0 + (1 << i) + k - 1 > n - 1) continue; if (p1 != q && x0 + (1 << i) + k - 1 >= p[p1]) continue; break; } for (int i = 0; i < (1 << k); ++i) nf[i] = INF; for (int i = 0; i < (1 << k); ++i) { if (f[i] == INF) continue; for (pair<int, long long> p : e[i][s]) { long long v = f[i] + p.second; if (s == 0 && dx[i][p.first] != -1 && a.find(x0 + dx[i][p.first]) != a.end()) { v += a[x0 + dx[i][p.first]]; } uin(nf[p.first], v); } } memcpy(f, nf, sizeof(f)); x0 += (1 << s); } ans = f[(1 << x) - 1]; } int main() { scanf( %d %d %d %d , &x, &k, &n, &q); for (int i = 0; i < k; ++i) scanf( %d , &c[i]); for (int i = 0; i < q; ++i) { scanf( %d %d , &p[i], &w[i]); --p[i]; a[p[i]] = w[i]; } for (int i = 0; i < q; ++i) for (int j = i + 1; j < q; ++j) if (p[j] < p[i]) { swap(p[j], p[i]); swap(w[j], w[i]); } build(); solve(); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int const N = 1e5 + 2; int n, m; void solve() { string n, m; cin >> n >> m; sort((n).begin(), (n).end()); if (n[0] == 0 && n.size() > 1) swap(n[0], n[1]); if (n == m) cout << OK << endl; else cout << WRONG_ANSWER << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); solve(); } |
#include <bits/stdc++.h> using namespace std; map<int, long long> ans, re, now; int n, h[200005], tot, mp[200005], siz[200005], mz[200005], rem[200005], cnt; bool vis[200005]; struct DX { int v, p; } dx[400005]; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void add(int u, int v) { dx[tot].p = h[u]; dx[tot].v = v; h[u] = tot++; } void dfs_G(int u, int fx) { siz[u] = 1; rem[++cnt] = u; mz[u] = 0; for (int i = h[u]; ~i; i = dx[i].p) { int v = dx[i].v; if (v == fx || vis[v]) continue; dfs_G(v, u); siz[u] += siz[v]; mz[u] = max(mz[u], siz[v]); } } int fd_G(int u) { cnt = 0; dfs_G(u, u); for (int i = 1; i <= cnt; i++) if (mz[rem[i]] <= siz[u] / 2 && siz[u] - siz[rem[i]] <= siz[u] / 2) return rem[i]; } void dfs(int u, int fx, int gc) { re[gc = gcd(gc, mp[u])]++; for (int i = h[u]; ~i; i = dx[i].p) { int v = dx[i].v; if (v == fx || vis[v]) continue; dfs(v, u, gc); } } void sol(int u) { u = fd_G(u); vis[u] = 1; now[mp[u]] = 1; ans[mp[u]] += 1; for (int i = h[u]; ~i; i = dx[i].p) { int v = dx[i].v; if (vis[v]) continue; dfs(v, 0, mp[u]); for (map<int, long long>::iterator it = now.begin(); it != now.end(); it++) for (map<int, long long>::iterator ti = re.begin(); ti != re.end(); ti++) ans[gcd(it->first, ti->first)] += it->second * ti->second; for (map<int, long long>::iterator ti = re.begin(); ti != re.end(); ti++) now[ti->first] += ti->second; re.clear(); } now.clear(); for (int i = h[u]; ~i; i = dx[i].p) { int v = dx[i].v; if (vis[v]) continue; sol(v); } } int main() { memset(h, -1, sizeof(h)); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &mp[i]); int a, b; for (int i = 1; i < n; i++) { scanf( %d%d , &a, &b); add(a, b); add(b, a); } sol(1); for (map<int, long long>::iterator it = ans.begin(); it != ans.end(); it++) printf( %d %lld n , it->first, it->second); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m; cin >> m; for (int i = 1; i <= m; i++) { if ((i * (i + 1)) / 2 == m) { cout << YES << endl; return 0; } if ((i * (i + 1)) / 2 > m) { cout << NO << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 150000 + 50; int n, m, h, vec[MAXN], sec[MAXN], ans, need[4 * MAXN], ex[4 * MAXN]; void plant(int v, int b, int e) { need[v] = e - b; if (e - b == 1) return; int mid = (b + e) / 2; plant(v << 1, b, mid); plant(v << 1 ^ 1, mid, e); } void water(int v, int b, int e, int x, int val) { if (x == e) return; if (e - b == 1) { need[v] -= val; ex[v] = max(0, -need[v]); return; } int mid = (b + e) / 2; if (x < mid) water(v << 1, b, mid, x, val); else water(v << 1 ^ 1, mid, e, x, val); need[v] = max(0, need[v << 1]) + max(0, need[v << 1 ^ 1] - ex[v << 1]); ex[v] = ex[v << 1 ^ 1] + max(0, ex[v << 1] - max(0, need[v << 1 ^ 1])); } int main() { scanf( %d %d %d , &n, &m, &h); for (int i = 0; i < m; i++) scanf( %d , &sec[i]); sort(sec, sec + m); plant(1, 0, m); for (int i = 0; i < n; i++) { if (i >= m) water(1, 0, m, lower_bound(sec, sec + m, h - vec[i - m]) - sec, -1); scanf( %d , &vec[i]); water(1, 0, m, lower_bound(sec, sec + m, h - vec[i]) - sec, 1); ans += bool(need[1] == 0); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; char s[200]; char p[200]; char ans[200]; bool used[200][30]; bool brute(int pos) { if (pos == n) { puts(ans); exit(0); } if (ans[pos] != 0) { if (pos >= strlen(s) - 1) { if (p[pos - strlen(s) + 1] == 0 ) { bool ok = true; for (int j = strlen(s) - 1; j >= 0; j--) { if (ans[pos - j] != s[strlen(s) - 1 - j]) { ok = false; break; } } if (ok) return false; } } return brute(pos + 1); } memset(used[pos], 0, sizeof used[pos]); int cnt = k; bool need_check = false; if (pos >= strlen(s) - 1) { need_check = true; for (int i = strlen(s) - 1; i > 0; i--) { if (ans[pos - i] != s[strlen(s) - 1 - i]) { need_check = false; break; } } } for (int t = 0; t < k; t++) { ans[pos] = (char)( a + t); if (!need_check) { if (brute(pos + 1)) return true; } else { if (t != s[strlen(s) - 1] - a ) { if (brute(pos + 1)) return true; } } } ans[pos] = 0; return false; } int main() { scanf( %d %d n , &n, &k); gets(s); gets(p); memset(ans, 0, sizeof ans); for (int i = 0; i < strlen(p); i++) { if (p[i] == 1 ) { for (int j = 0; j < strlen(s); j++) { if (ans[i + j] == 0 || ans[i + j] == s[j]) { ans[i + j] = s[j]; } else { puts( No solution ); return 0; } } } } for (int i = 0; i < strlen(p); i++) { if (p[i] == 0 ) { bool ok = true; for (int j = 0; j < strlen(s); j++) { if (ans[i + j] != s[j]) { ok = false; break; } } if (ok) { puts( No solution ); return 0; } } } for (int i = 0; i < k; i++) { bool ok = true; for (int j = 0; j < strlen(s); j++) { if (s[j] - a == i) { ok = false; break; } } if (ok) { for (int j = 0; j < n; j++) { if (ans[j] == 0) ans[j] = (char)( a + i); } puts(ans); return 0; } } brute(0); puts( No solution ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; if (k > n) { cout << -1 ; return 0; } if (n == 1) { cout << a ; return 0; } if (n > 1 && k == 1) { cout << -1 ; return 0; } string str; char c1 = a , c2 = b ; for (int i = 0; i < n; i++) { str += c1; if (i % 2 == 0) c1 = b ; else c1 = a ; } char ch = a + k - 1; int l = str.size() - 1; for (int i = 0; i < k - 2; i++) str[l--] = ch--; cout << str; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, dfsCont, dfs_num[2005], dfs_low[2005], numComp; vector<vector<int> > lista; string ans[2005]; vector<int> pila, comp; map<string, int> names; bool vis[2005]; void tarjan(int u) { dfs_low[u] = dfs_num[u] = dfsCont++; vis[u] = 1; pila.push_back(u); for (int i = 0; i < lista[u].size(); i++) { int v = lista[u][i]; if (dfs_num[v] == -1) tarjan(v); if (vis[v]) dfs_low[u] = min(dfs_low[u], dfs_low[v]); } if (dfs_low[u] == dfs_num[u]) { while (true) { int v = pila.back(); comp.push_back(v); pila.pop_back(); vis[v] = 0; if (u == v) break; } numComp++; } } int main() { scanf( %d , &n); lista.assign(n, vector<int>()); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { int x; scanf( %d , &x); if (x) lista[i].push_back(j); } pila.clear(); memset(dfs_low, 0, sizeof dfs_low); memset(dfs_num, -1, sizeof dfs_num); memset(vis, 0, sizeof vis); dfsCont = 0; numComp = 0; tarjan(0); if (numComp == 1 && comp.size() == n) printf( YES n ); else printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; template <typename X> void MA(X &a, X b) { a = max(a, b); } template <typename X> void MI(X &a, X b) { a = min(a, b); } int DEBUG = 0, MULTI = 0, GCJ = 0; struct solver_t; solver_t *solver; struct solver_t { vector<int> A; vector<vector<int> > EDG; struct lcu_t { int N; vector<int> CNT, PAR; lcu_t(int N) : N(N) { PAR.resize(N); CNT.resize(N); for (int64_t i = (0); i < (N); ++i) PAR[i] = i; for (int64_t i = (0); i < (N); ++i) CNT[i] = 1; } int parent(int i) { if (PAR[i] == i) return i; else return PAR[i] = parent(PAR[i]); } int64_t get_cnt(int64_t x) { return x * (x - 1) / 2; } int64_t join(int a, int b) { int pa = parent(a), pb = parent(b); if (pa == pb) return 0; if (!(CNT[pb] >= CNT[pa])) swap(pa, pb); int64_t diff = -get_cnt(CNT[pa]) - get_cnt(CNT[pb]); PAR[pa] = pb; CNT[pb] += CNT[pa]; diff += get_cnt(CNT[pb]); return diff; } }; void solve() { int N; cin >> N; A.resize(N + 1); for (int64_t i = (1); i <= (N); ++i) cin >> A[i]; EDG.resize(N + 1); for (int64_t i = (0); i < (N - 1); ++i) { int X, Y; cin >> X >> Y; EDG[X].push_back(Y); EDG[Y].push_back(X); } vector<array<int64_t, 2> > order; for (int64_t i = (1); i <= (N); ++i) order.push_back({A[i], i}); sort((order).begin(), (order).end()); int64_t res[2] = {}; for (int64_t mode = (0); mode < (2); ++mode) { lcu_t lcu(N + 1); int64_t prev_cnt = 0; int64_t &sum = res[mode]; vector<int> vis(N + 1); for (int i = 0; i < (int)order.size();) { int64_t diff = 0; int j; { if (DEBUG) cerr << 81 << << << << << endl; }; for (j = i; j < (int)order.size(); j++) { if (order[i][0] != order[j][0]) break; int u = order[j][1]; vis[u] = 1; { if (DEBUG) cerr << 86 << << vis << u << << vis << u << endl; }; for (int v : EDG[u]) if (vis[v]) { diff += lcu.join(u, v); { if (DEBUG) cerr << 90 << << u << << v << << diff << << u << << v << << diff << endl; }; } } { if (DEBUG) cerr << 93 << << order[i][0] << << diff << << order[i][0] << << diff << endl; }; sum += order[i][0] * diff; prev_cnt += diff; i = j; } reverse((order).begin(), (order).end()); { if (DEBUG) cerr << 99 << << sum << << sum << endl; }; { if (DEBUG) cerr << 100 << << !! << << !! << endl; }; } cout << abs(res[0] - res[1]) << n ; } void gen() {} void brute() {} }; int main(int argc, char **argv) { for (int64_t i = (1); i <= (argc - 1); ++i) for (int j = 0; argv[i][j]; j++) if (argv[i][j] == . ) freopen(argv[i], r , stdin); for (int64_t i = (1); i <= (argc - 1); ++i) if (argv[i] == string( q )) DEBUG = 1 << 30; for (int64_t i = (1); i <= (argc - 1); ++i) if (argv[i] == string( gen )) { (solver = new solver_t())->gen(); exit(0); } for (int64_t i = (1); i <= (argc - 1); ++i) if (argv[i] == string( brute )) { (solver = new solver_t())->brute(); exit(0); } ios::sync_with_stdio(false), cin.tie(0); cout.setf(ios::fixed), cout.precision(10); int t; if (MULTI || GCJ) cin >> t; else t = 1; for (int64_t i = (1); i <= (t); ++i) { if (DEBUG) cerr << 129 << << i << endl; if (GCJ) cout << Case # << i << : ; solver = new solver_t(); solver->solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const long long INFLL = 1e18 + 1; const int MAX = 100001; const long long MOD = 1000000007; const int SZ = 300100; const double PI = 3.14159265358979323846264338327; long long inq(long long k, long long q, long long mod) { if (q == 0) return 1; long long l = inq(k, q / 2, mod); if (q % 2 == 0) return l * l % mod; else return l * l % mod * k % mod; } long long gcd(long long a, long long b) { if (a < b) swap(a, b); if (b == 0) return a; return gcd(b, a % b); } long long cubr(long long a) { long long l = -1, r = 1e6 + 2; while (l < r - 1) { long long mid = (l + r) / 2; if (mid * mid * mid > a) r = mid; else l = mid; } return l; } long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { return -1 * max(-a, -b); } long long possible(long long q) { if (q == INF) return -1; return q; } bool correct(int x, int xx) { if (x < 0) return 0; if (x >= xx) return 0; return 1; } long long dsumm(long long x, long long k) { long long y = 1; long long z = 0; for (int i = 0; y < 1e18; i += 1) { z += x / y % k; y *= k; } return z; } long long dcount(long long x) { long long y = 1; long long z = 0; int c[100]; for (int i = 0; i < 10; i += 1) c[i] = 0; for (int i = 0; x > 0; i += 1) { if (c[x / y % 10] == 0) z++; c[x / y % 10] = 1; x /= 10; } return z; } long long lg10(long long x) { if (10000 <= x && x < 100000) return 5; if (x == 0) return 0; return lg10(x / 10) + 1; } long long g(long long x, long long mod) { if (x == 0) return 0; return x / mod + g(x / mod, mod); } bool is_digit(char c) { return ( 0 <= c && c <= 9 ); } string s; int n, p; int a[50][50]; int b[3000000]; int marks[(1 << 17)][20][20]; int r[3000000]; int dp[3000000]; int len[3000000]; int cnt[50]; void mark(int mask, int i, int j) { if (marks[mask][i][j] == 0) return; marks[mask][i][j] = 0; for (int k = 0; k < p; k++) { if (((1 << k) & mask) == 0 && k != i && k != j) { int m2 = (mask + (1 << k)); if (marks[m2][i][j] == 1) mark(m2, i, j); } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> p; cin >> s; for (int(i) = 0; (i) != (n); i += 1) b[i] = s[i] - a ; for (int(i) = 0; (i) != (n); i += 1) cnt[b[i]]++; for (int i = 0; i < p; i++) { for (int j = 0; j < p; j++) { cin >> a[i][j]; } } for (int i = 0; i < (1 << p); i++) { r[i] = 1; for (int j = 0; j < p; j++) { for (int k = 0; k < p; k++) { marks[i][j][k] = 1; } } } for (int i = 0; i < p; i++) { for (int j = 0; j < p; j++) { if (a[i][j] == 0) { long long calc = 0; long long mask = 0; for (int k = 0; k < n; k++) { if (b[k] == j) { if (calc == 1) { mark(mask, i, j); } calc = 0; mask = 0; } if (b[k] == i) { calc = 1; mask = 0; } if (b[k] != i && b[k] != j && calc == 1) mask |= (1 << b[k]); } } } } for (int i = 0; i < (1 << p); i++) { r[i] = 1; for (int j = 0; j < p; j++) { for (int k = 0; k < p; k++) { r[i] = min(r[i], marks[i][j][k]); } } } dp[0] = 1; int ans = n; for (int i = 1; i < (1 << p); i++) { for (int j = 0; j < p; j++) { if (i & (1 << j)) { int ii = i - (1 << j); if (dp[ii] && r[i]) { dp[i] = 1; int first = n; for (int k = 0; k < p; k++) { if ((1 << k) & i) { first -= cnt[k]; } } ans = min(first, ans); } } } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; vector<string> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = 1 << 30; for (int k = 2; k < 100; k++) { int nn = (n + k - 1) / k * k; int nm = (m + k - 1) / k * k; vector<string> b = a; b.resize(nn, 0 ); for (int i = 0; i < nn; i++) { b[i].resize(nm, 0 ); } int cur = 0; for (int i = 0; i + k <= nn; i += k) { for (int j = 0; j + k <= nm; j += k) { int ca = 0; int cb = 0; for (int w = 0; w < k; w++) { for (int h = 0; h < k; h++) { ca += (b[i + w][j + h] == 0 ? 0 : 1); cb += (b[i + w][j + h] == 1 ? 0 : 1); } }; cur += min(ca, cb); } }; ans = min(ans, cur); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
#include<bits/stdc++.h> #define int long long using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin>>t; while(t--) {int n,k; cin>>n>>k; int ok=1; int poss=0; for(int i=0;i<n-1;i++) {ok=ok*2; if(ok>=k){poss=1;break;} } if(ok<k){cout<< -1 n ;continue;} vector<int> v; k--; for(int i=0;i<n-1;i++) {//Should I take i+1 int poss=0; int z=1; for(int j=0;j<n-i-2;j++) {z=z*2; if(z>k){break;} } if(z>k) {v.push_back(i+1); } else {k-=z; } } v.push_back(n); int visited[n]; memset(visited,0,sizeof(visited)); for(auto x:v) { visited[x-1]=1; cout<<x<< ; for(int i=x-1;i>0;i--) { if(visited[i-1]==1){break;} cout<<i<< ; } } cout<< n ; } } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; int ans = 0; int csize[100005]; int dfs(int u, int fa) { csize[u] = 1; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i]; if (v == fa) continue; dfs(v, u); csize[u] += csize[v]; if (csize[v] % 2 == 0) ans++; } } int main() { int n; while (cin >> n) { ans = 0; for (int i = 0; i <= n; i++) { g[i].clear(); } for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } if (n % 2) cout << -1 n ; else { dfs(1, 0); cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, s[105][105]; int main() { int i, j, x, y; scanf( %d , &n); for (i = 3; i <= 102; i++) { m = (i * (i - 1) * (i - 2)) / 6; if (m > n) break; } i--; memset(s, 0, sizeof(s)); for (y = 1; y <= i; y++) for (x = 1; x <= i; x++) if (y != x) s[y][x] = 1; m = i * (i - 1) * (i - 2) / 6; while (n != m) { for (j = i; j >= 2; j--) if (m + j * (j - 1) / 2 <= n) break; m += j * (j - 1) / 2; i++; for (x = 1; x <= j; x++) s[x][i] = s[i][x] = 1; } printf( %d n , i); for (y = 1; y <= i; y++) { for (x = 1; x <= i; x++) printf( %d , s[y][x]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 11; const long long MOD = 1e18; long long a[N], b[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long x, y, l, r; cin >> x >> y >> l >> r; vector<long long> v; long long k = 1, kk = 1; for (int i = 0; i <= 60; i++) { a[i] = k; b[i] = kk; if (k != -1 && r / k >= x && k * x <= r) k *= x; else k = -1; if (kk != -1 && r / kk >= y && kk * y <= r) kk *= y; else kk = -1; } for (int i = 0; i <= 60; i++) for (int j = 0; j <= 60; j++) if (a[i] != -1 && b[j] != -1) { long long dd = a[i] + b[j]; if (dd >= l && dd <= r) v.push_back(dd); } v.push_back(l - 1); v.push_back(r + 1); sort(v.begin(), v.end()); long long ans = 0; for (int i = 1; i < v.size(); i++) ans = max(ans, v[i] - v[i - 1] - 1); cout << ans << endl; } |
#include <bits/stdc++.h> int main(void) { int b_cost, money, b_number; scanf( %d %d %d , &b_cost, &money, &b_number); int total_cost; int loan = 0; total_cost = b_cost; for (int i = 2; i <= b_number; i++) { total_cost += i * b_cost; } if (money < total_cost) { loan = total_cost - money; } printf( %d , loan); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const long long mod = 1e9 + 7; struct node { int s, e, next; } edge[maxn]; int head[maxn], len; void add(int s, int e) { edge[len].e = e; edge[len].next = head[s]; head[s] = len++; } void init() { memset(head, -1, sizeof(head)); len = 0; } double dp[maxn]; void dfs(int x, int fa) { dp[x] = 0; int ans = 0; for (int i = head[x]; i != -1; i = edge[i].next) { int y = edge[i].e; if (y == fa) continue; dfs(y, x); dp[x] += dp[y]; ans++; } if (ans == 0) dp[x] = 0; else dp[x] = dp[x] / ans + 1; } int main() { int n; while (scanf( %d , &n) != EOF) { init(); int x, y; for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); add(x, y); add(y, x); } dfs(1, -1); printf( %.8f n , dp[1]); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, d, h, i; cin >> n >> d >> h; if (h == 1) { if (d == 1 && n == 2) { cout << 1 << << 2 << n ; } else if (d == 2) { for (i = 1; i < n; i++) cout << 1 << << i + 1 << n ; } else { cout << -1 n ; } } else if (d > 2 * h) { cout << -1 n ; } else { for (i = 1; i <= h; i++) cout << i << << i + 1 << n ; for (i = h + 1; i <= d; i++) { if (i == h + 1) cout << 1 << << i + 1 << n ; else cout << i << << i + 1 << n ; } for (i = d + 1; i < n; i++) cout << 2 << << i + 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200100], sum[200100], qs[200100]; bool bad(pair<long long, long long> &a, pair<long long, long long> &b, pair<long long, long long> second) { return (a.second - second.second) * (b.first - a.first) > (a.second - b.second) * (second.first - a.first); } long long at(pair<long long, long long> a, long long x) { return a.first * x + a.second; } int back = 0; pair<long long, long long> l[200100]; void add(long long first, long long second) { if (back >= 2 and bad(l[back - 2], l[back - 1], {first, second})) back--; l[back++] = {first, second}; } long long query(long long x, int L = 0, int R = back - 1) { if (L + 1 == R) return max(at(l[L], x), at(l[R], x)); if (L == R) return at(l[L], x); int mid = (L + R) / 2; if (at(l[mid], x) < at(l[mid - 1], x)) return query(x, L, mid - 1); if (at(l[mid], x) < at(l[mid + 1], x)) return query(x, mid + 1, R); return at(l[mid], x); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]), qs[i] = a[i] + qs[i - 1], sum[i] = a[i] * i + sum[i - 1]; long long ans = 0; add(0, 0); for (int i = 1; i <= n; i++) { ans = max(ans, sum[i] + query(qs[i])); add(-i, -sum[i] + i * qs[i]); } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int m, n, nums[1010][35], P[1010] = {0}, nCr[1010][1010], basis[1010][35], sz = 0, pivots[1010]; char buf[1010]; int main() { int mask = 0x1F, shift = 5; scanf( %d%d , &m, &n); for (int i = 0; i < n; i++) { scanf( %s , buf); for (int j = 0; j < m; j++) { nums[i][j >> shift] |= (buf[j] == 1 ) << (j & mask); } } nCr[0][0] = 1; for (int i = 1; i <= m; i++) { nCr[i][0] = nCr[i][i] = 1; for (int j = 1; j < i; j++) { nCr[i][j] = (nCr[i - 1][j - 1] + nCr[i - 1][j]) % 1000000007; } } P[0] = 1; for (int i = 1; i <= m; i++) { for (int j = 1; j <= i; j++) { P[i] = (P[i] + 1LL * nCr[i - 1][j - 1] * P[i - j]) % 1000000007; } } for (int i = 0; i < m >> shift; i++) nums[n][i] = 0xFFFFFFFF; nums[n][m >> shift] = (1 << (m & mask)) - 1; for (int i = 0; i < m; i++) pivots[i] = -1; for (int i = 0; i < m; i++) { int idx = 0; while (idx <= n && ((nums[idx][i >> shift] >> (i & mask)) & 1) == 0) { idx++; } if (idx == n + 1) continue; for (int i = 0; i < 35; i++) { basis[sz][i] = nums[idx][i]; } for (int j = idx; j <= n; j++) { if ((nums[j][i >> shift] >> (i & mask)) & 1) { for (int i = 0; i < 35; i++) { nums[j][i] ^= basis[sz][i]; } } } pivots[i] = sz; sz++; } for (int i = 0; i < m; i++) { if (pivots[i] != -1) { int u = pivots[i]; for (int j = 0; j < sz; j++) { if (j != u && ((basis[j][i >> shift] >> (i & mask)) & 1)) for (int z = 0; z < 35; z++) { basis[j][z] ^= basis[u][z]; } } } } for (int i = 0; i < m; i++) { if (pivots[i] == -1) { int u = -1, v = -1; for (int j = 0; j < sz; j++) { if ((basis[j][i >> shift] >> (i & mask)) & 1) { v = u; u = j; } } if (v != -1) { for (int z = 0; z < 35; z++) { basis[sz][z] = basis[u][z] & basis[v][z]; } for (int j = i + 1; j < m; j++) { if (pivots[j] != -1 && ((basis[sz][j >> shift] >> (j & mask)) & 1)) { int u = pivots[j]; for (int k = 0; k < 35; k++) basis[sz][k] ^= basis[u][k]; } } for (int j = 0; j < sz; j++) { if (basis[j][i >> shift] >> (i & mask) & 1) { for (int k = 0; k < 35; k++) { basis[j][k] ^= basis[sz][k]; } } } pivots[i] = sz; sz++; } } } int ans = 1, num_ones = 0; for (int i = 0; i < sz; i++) { int no = 0; for (int j = 0; j < m; j++) { no += (basis[i][j >> shift] >> (j & mask)) & 1; } num_ones += no; ans = 1LL * ans * P[no] % 1000000007; } ans = 1LL * ans * P[m - num_ones] % 1000000007; printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, t = 0, c = 0; cin >> a >> b; t += a; while (b <= a) { c = a % b; a /= b; t += a; a += c; } cout << t << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const long long INFLL = 1000000000000000000LL; const int MAXN = 200009; int m, x; vector<int> weights; stack<int> order; void print() { if (order.empty()) return; int x = order.top(); order.pop(); print(); cout << x << ; } void solve(int bal, int step) { if (step == m) { cout << YES << endl; print(); exit(0); } if (abs(bal) >= 10) return; for (int w : weights) { if (step % 2 == 0) { if (bal + w > 0 && (order.empty() || w != order.top())) { order.push(w); solve(bal + w, step + 1); order.pop(); } } else { if (bal - w < 0 && (order.empty() || w != order.top())) { order.push(w); solve(bal - w, step + 1); order.pop(); } } } } int main() { ios::sync_with_stdio(0); cin.tie(0); for (int i = 1; i <= 10; i++) { scanf( %1d , &x); if (x == 1) weights.push_back(i); } scanf( %d , &m); solve(0, 0); cout << NO << endl; } |
#include <bits/stdc++.h> int N, head[51], next[99], from[99], to[99], len[99], E, root, M, q[51], fa[51], count_e[99], f[51][99][51], vi[51][99]; void BFS() { int H = 0, T = 1, u; q[1] = root; while (H < T) for (int e = head[u = q[++H]]; e; e = next[e]) if (to[e] != fa[u]) fa[q[++T] = to[e]] = u; } void F(int n, int e) { if (vi[n][e]) return; vi[n][e] = 1; f[n][e][0] = 1 << 30; if (!next[head[to[e]]]) { for (int i = 1; i < n; i++) { F(n - i, ((e - 1) ^ 1) + 1); f[n][e][i] = f[n - i][((e - 1) ^ 1) + 1][n - i] + len[e]; } f[n][e][n] = 0; } else { for (int g = head[to[e]]; g; g = next[g]) if (to[g] != from[e]) F(n, g); for (int i = 1; i <= n; i++) { int l = 0, r = (1 << 30) - 1; while (l < r) { int m = l + r + 1 >> 1; int count = 0; for (int g = head[to[e]]; g; g = next[g]) if (to[g] != from[e]) count += std::upper_bound(f[n][g], f[n][g] + n + 1, m - len[g], [](int x, int y) { return x > y; }) - f[n][g] - 1; if (count >= i) l = m; else r = m - 1; } f[n][e][i] = l; } } } int main() { scanf( %d , &N); for (int i = 1, u, v, l; i < N; i++) { scanf( %d%d%d , &u, &v, &l); next[++E] = head[u], from[E] = u, to[E] = v, len[E] = l, head[u] = E; next[++E] = head[v], from[E] = v, to[E] = u, len[E] = l, head[v] = E; } scanf( %d%d , &root, &M); BFS(); for (int i = 1, x; i <= M; i++) { scanf( %d , &x); while (fa[x] != root) x = fa[x]; for (int e = head[root]; e; e = next[e]) if (to[e] == x) count_e[e]++; } int O = 1 << 30; for (int e = head[root]; e; e = next[e]) { F(M, e); O = std::min(O, f[M][e][count_e[e]] + len[e]); } printf( %d n , O); return 0; } |
#include <bits/stdc++.h> const int mxn = 100000 + 10; using namespace std; string s; string soln; int main() { cin >> s; int n = s.size(); for (int i = 0; i < n; i++) if (s[i] == . ) printf( 0 ); else { if (s[i + 1] == - ) printf( 2 ); else printf( 1 ); i++; } puts( ); } |
//CLOCKS_PER_SEC using namespace std; #include<bits/stdc++.h> #define sqr(x) 1ll*(x)*(x) //#define sort stable_sort #define ll long long #define mk make_pair #define pb push_back #define in insert #define mtr(x,y,z) mk(mk(x,y),z) #define fi first #define se second #define lch(x) ((x)<<1) #define rch(x) (((x)<<1)|1) #define all(x) (x).begin(),(x).end() #define titose CLOCKS_PER_SEC #define fpi(x) freopen(x, r ,stdin); #define fpo(x) freopen(x, w ,stdout); #define fprio fpi( in.txt );fpo( out.txt ); #define fast ios_base::sync_with_stdio(false); inline void read(int &x){int v=0,f=1;char c=getchar();while (!isdigit(c)&&c!= - ) c=getchar();if (c== - ) f=-1; else v=(c&15);while (isdigit(c=getchar())) v=(v<<1)+(v<<3)+(c&15);x=v*f;} inline void read(ll &x){ll v=0ll,f=1ll;char c=getchar();while (!isdigit(c)&&c!= - ) c=getchar();if (c== - ) f=-1; else v=(c&15);while (isdigit(c=getchar())) v=(v<<1)+(v<<3)+(c&15);x=v*f;} inline void readc(char &x){char c;while (((c=getchar())== )||c== n );x=c;} #define pii pair<int,int> #define pll pair<ll,ll> #define vi vector<int> #define vl vector<ll> #define si set<int> //#define sl set<ll> #define mii map<int,int> #define mll map<ll,ll> #define msi map<string,int> #define msl map<string,ll> #define piii pair<int,pii > #define piipi pair<pii,int> #define plll pair<ll,pll > #define pllpl pair<pll,ll> #define pqi priority_queue<int> #define pql priority_queue<ll> #define npqi priority_queue<int,vector<int>,greater<int> > #define npql priority_queue<ll,vector<ll>,greater<ll> > #define forup(i,a,b) for ((i)=(a);(i)<=(b);(i)++) #define fordo(i,a,b) for ((i)=(a);(i)>=(b);(i)--) #define rep(i,x) forup ((i),1,(x)) #define repd(i,x) fordo ((i),(x),1) #define rep0(i,x) forup ((i),0,((int)(x))-1) #define rep0d(i,x) fordo ((i),((int)(x))-1,0) #define itr iterator #define fe(itcalc,c) for(__typeof((c).begin()) itcalc=(c).begin();itcalc!=(c).end();itcalc++) #define NO {cout<< NO ;return 0;} #define YES {cout<< YES ;return 0;} #define y0 y000000000000000000000000000 #define y1 y111111111111111111111111111 #define j0 j000000000000000000000000000 #define j1 j111111111111111111111111111 #define cl0(a) memset((a),(0),(sizeof((a)))) #define clz(a) memset((a),(0x16),(sizeof((a)))) #define clf(a) memset((a),(-(0x16)),(sizeof((a)))) #define inf 0x3bbbbbbb #define lnf 0x2bbbbbbbbbbbbbbbll //#define sqrt divi #define p2(i) (1ll<<(i)) #define readi read #define readll read /*************************************************/ int n,m,i,j,s=0,t=2001,px[1005],py[1005],dis[2005],inq[2005]; map<pair<int,int>,int> mp; struct edg { int y;ll z; }ee[1000005]; vector<int> e[2005];int tot; ll sum; void add(int x,int y,ll z) { // cerr<<x<< <<y<< <<z<<endl; tot++; e[x].pb(tot+tot-2);e[y].pb(tot+tot-1); ee[tot+tot-2]=(edg){y,z};ee[tot+tot-1]=(edg){x,0}; } bool bfs(int s,int t) { queue<int> qx;qx.push(s); clz(dis);dis[s]=0; while(!qx.empty()){ int x=qx.front();qx.pop();inq[x]=0; fe(it,e[x])if(ee[*it].z){ if(dis[ee[*it].y]>dis[x]+1){ dis[ee[*it].y]=dis[x]+1; if(!inq[ee[*it].y]){ qx.push(ee[*it].y); inq[ee[*it].y]=1; } } } } return dis[t]<dis[t+1]; } ll dfs(int x,int tt,ll flw) { if(x==tt||flw==0)return flw; ll res=0; fe(it,e[x])if(ee[*it].z&&dis[ee[*it].y]==dis[x]+1){ ll t=dfs(ee[*it].y,tt,min(ee[*it].z,flw)); res+=t;flw-=t;ee[*it].z-=t;ee[(*it)^1].z+=t; if(!flw)break; } if(flw) dis[x]=-1; return res; } ll dinic(int s,int t) { ll ans=0; while(bfs(s,t)){ ans+=dfs(s,t,lnf); } return ans; } int main() { read(n); rep(i,n){ int z;read(py[i]);read(px[i]);read(z); sum+=z; add(i,i+n,z);mp[mk(px[i],py[i])]=i; } rep(i,n){ int a=abs(px[i]&1),b=abs(py[i]&1); if(a==0){ if(b==1){ add(s,i,lnf); if(mp.count(mk(px[i],py[i]-1))){ add(i+n,mp[mk(px[i],py[i]-1)],lnf); } if(mp.count(mk(px[i],py[i]+1))){ add(i+n,mp[mk(px[i],py[i]+1)],lnf); } } else{ if(mp.count(mk(px[i]-1,py[i]))){ add(i+n,mp[mk(px[i]-1,py[i])],lnf); } if(mp.count(mk(px[i]+1,py[i]))){ add(i+n,mp[mk(px[i]+1,py[i])],lnf); } } } if(a==1){ if(b==0){ if(mp.count(mk(px[i],py[i]-1))){ add(i+n,mp[mk(px[i],py[i]-1)],lnf); } if(mp.count(mk(px[i],py[i]+1))){ add(i+n,mp[mk(px[i],py[i]+1)],lnf); } } else{ add(i+n,t,lnf); } } } cout<<sum-dinic(s,t)<<endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); int main() { long long n; cin >> n; unsigned long long p = 1; unsigned long long sq = (unsigned long long)(sqrt(n + 0.0) + eps + 1); bool was = false; while (p - 1 <= n) { unsigned long long lf = 1; unsigned long long rg = min(sq, n / p) + 5; while (lf < rg - 1) { unsigned long long mm = (lf + rg) >> 1; unsigned long long m = 2 * mm - 1; if ((p - 1) * m + m * (m - 1) / 2 <= n) { lf = mm; } else { rg = mm; } } lf = 2 * lf - 1; if ((p - 1) * lf + lf * (lf - 1) / 2 == n) { cout << p * lf << endl; was = true; } p = p * 2; } if (!was) puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t1, n, zero, one, cnt, cnt1, i, j; string s; cin >> t1; while (t1--) { cin >> n; cnt = 0, zero = 0, one = 0; for (i = 0; i < n; i++) { cin >> s; for (j = 0; j < s.length(); j++) { if (s[j] == 0 ) zero++; else one++; } if (s.length() % 2 != 0) cnt++; } cnt1 = 0; if (zero % 2 != 0) cnt1++; if (one % 2 != 0) cnt1++; if (cnt >= cnt1) cout << n << endl; else cout << n - 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; long long a[n], b[n]; for (long long i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (long long i = 0; i < n; i++) { if (a[i] != b[i]) { cout << rated ; return 0; } } for (long long i = 0; i < n - 1; i++) { if (a[i + 1] > a[i]) { cout << unrated ; return 0; } } cout << maybe ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int Mmax(long long int a, long long int b) { if (a > b) return a; return b; } long long int Mmin(long long int a, long long int b) { if (a < b) return a; return b; } long long int nod(long long int a, long long int b) { while (a && b) { if (a > b) a %= b; else b %= a; } return Mmax(a, b); } long long int nok(long long int a, long long int b) { return a * b / nod(a, b); } bool IsPrime(long long int x) { if (x < 2) return false; long long int X = sqrt(x), i; for (i = 2; i <= X; i++) if (x % i == 0) return false; return true; } void hanoi(int n, int A, int C, int B) { if (n == 1) { cout << n << << A << << C << endl; } else { hanoi(n - 1, A, B, C); cout << n << << A << << C << endl; hanoi(n - 1, B, C, A); } } string pr2(string a, int d) { if (d == 0) return 0 ; string b; long long int sz = a.size(), i, prenos = 0; for (i = 0; i < sz; i++) { b[i] = a[i]; } for (i = sz - 1; i > -1; i--) { a[i] = ((b[i] - 0 ) * d + prenos) % 10 + 0 ; prenos = ((b[i] - 0 ) * d + prenos) / 10; } if (prenos) a = char(prenos + 0 ) + a; return a; } string sum(string a, string b) { bool carry = false; long long int i, sz1, sz2, maxsz, minsz; string c, d; sz1 = a.size(); sz2 = b.size(); maxsz = max(sz1, sz2); minsz = min(sz1, sz2); while (sz1 < maxsz) { sz1++; a = 0 + a; } while (sz2 < maxsz) { sz2++; b = 0 + b; } for (i = maxsz - 1; i > -1; i--) { d = char((a[i] + b[i] - 96 + carry) % 10 + 48) + d; if (a[i] + b[i] - 96 + carry > 9) carry = true; else carry = false; } if (carry == true) d = char( 1 ) + d; return d; } string pr(string a, string b) { string res = 0 , p, p2; int sz = a.size(), x = 0; for (sz = a.size(); sz > 0; sz--, x++) { int d = a[sz - 1] - 0 ; a = a.erase(sz - 1, 1); p2 = pr2(b, d); p2 += p; res = sum(res, p2); p += 0 ; } return res; } bool vesokosna(long long int x) { return (x % 4 == 0 && x % 100 || x % 400 == 0); } long long int reverse(long long int x) { long long int mirror = 0; while (x) { mirror = mirror * 10 + x % 10; x /= 10; } return mirror; } long long int ost(string x, long long int k) { long long int num = 0, i, sz = x.size(); for (i = 0; i < sz; i++) { num = num * 10; num += x[i] - 0 ; num %= k; } return num; } int n; int a[131072]; int b[131072]; vector<int> v; int main() { cin >> n; int i; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) b[i] = a[i]; sort(b, b + n); for (i = 0; i < n; i++) { if (b[i] != a[i]) v.push_back(i); } if (v.size() > 2) { cout << NO << endl; } else if (v.size() == 0) { cout << YES << endl; } else { swap(a[v[0]], a[v[1]]); for (i = 0; i < n; i++) { if (a[i] < a[i - 1]) { cout << NO << endl; return 0; } } cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s1, s2; cin >> s1 >> s2; int flag = 0; if (n % 2 != 0) flag = 1; int mid; if (flag) mid = (n + 1) / 2; else mid = n / 2; int cnt = 0; for (int i = 0; i < n / 2; i++) { int l = i, r = n - i - 1; int a[30]; fill(a, a + 30, 0); a[s1[l] - a ]++; a[s1[r] - a ]++; a[s2[l] - a ]++; a[s2[r] - a ]++; int k = 0; int b[4]; int counts = 0; for (int j = 0; j < 30; j++) { if (a[j]) k++; if (a[j]) { b[counts++] = a[j]; } } sort(b, b + k); if (k == 4) { cnt += 2; continue; } if (k == 3) { if (s1[l] == s1[r]) cnt += 2; else cnt++; } if (k == 2) { if (b[1] == 3) { cnt++; } } } if (flag) if (s1[mid - 1] != s2[mid - 1]) cnt++; cout << cnt; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; int a[205]; cin >> n >> k; for (int i = 0; i < 2 * n + 1; i++) { cin >> a[i]; } for (int i = 2 * n - 1; k != 0; i--) { if (a[i] > a[i + 1] + 1 && a[i] > a[i - 1] + 1) { a[i]--; k--; } } for (int i = 0; i < 2 * n + 1; i++) { if (i != 0) cout << ; cout << a[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int isprime[1010]; int mp[256]; int main() { isprime[0] = isprime[1] = 1; for (int i = 2; i <= 1000; i++) if (!isprime[i]) for (int j = i * 2; j <= 1000; j += i) isprime[j] = 1; char s[1100], str[1010]; scanf( %s , s); int l = strlen(s); for (int i = 0; i < l; i++) { mp[s[i]]++; str[i] = 0; } str[l] = 0; int flag = 0; for (int i = 1; i <= l; i++) { if (isprime[i]) continue; int tmp = 0; for (int j = 1; j <= l; j++) { if (j % i == 0 && str[j]) { tmp = str[j]; break; } } if (tmp) { int k = 1; while (k * i <= l) { if (str[k * i] == 0) { mp[tmp]--; if (mp[tmp] < 0) { flag = 1; break; } } str[k * i] = tmp; k++; } } else { int p = max_element(mp, mp + 256) - mp; int k = 1; while (k * i <= l) { if (str[k * i] == 0) { mp[p]--; if (mp[p] < 0) { flag = 1; break; } } str[k * i] = p; k++; } } if (flag) break; } if (flag) printf( NO n ); else { printf( YES n ); for (int i = 1; i <= l; i++) { if (!str[i]) { int j = a ; while (mp[j] == 0) { j++; } str[i] = j; mp[j]--; } } for (int i = 1; i <= l; i++) printf( %c , str[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } inline int read() { int s = 0, f = 1; char ch = getchar(); while (!isdigit(ch) && ch != - ) ch = getchar(); if (ch == - ) ch = getchar(), f = -1; while (isdigit(ch)) s = s * 10 + ch - 0 , ch = getchar(); return ~f ? s : -s; } const int maxn = 1e5 + 20; int n, q, t; long long now; int fa[maxn], to[maxn]; int a[maxn]; int f[maxn], vis[maxn]; inline void init() { n = read(); q = read(); t = read(); for (int i = (1), _end_ = (n); i <= _end_; i++) a[i] = read(); for (int i = (1), _end_ = (q); i <= _end_; i++) { int x = read(), y = read(); to[x] = y; fa[y] = x; } for (int i = (1), _end_ = (n); i <= _end_; i++) if (!fa[i]) { int x = i; while (to[x]) { if (vis[x]) puts( 0 ), exit(0); vis[x] = 1; now += a[x]; a[to[x]] += a[x]; x = to[x]; } vis[x] = 1; } for (int i = (1), _end_ = (n); i <= _end_; i++) if (!vis[i]) puts( 0 ), exit(0); } const int mod = 1e9 + 7; inline void pls(int &a, int b) { a += b; a -= a >= mod ? mod : 0; } inline void doing() { f[0] = 1; for (int j = (1), _end_ = (n); j <= _end_; j++) { for (int i = a[j]; i <= t - now; i++) pls(f[i], f[i - a[j]]); } if (now <= t) printf( %d n , f[t - now]); else puts( 0 ); } int main() { init(); doing(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 35000, K = 50; struct seg_node { seg_node *lc, *rc; int l, r, f, m; seg_node(seg_node *lc, seg_node *rc, int l, int r) : lc(lc), rc(rc), l(l), r(r), f(), m() {} static seg_node *build(int l, int r) { if (l == r - 1) return new seg_node(nullptr, nullptr, l, r); int mid = (l + r) / 2; return new seg_node(build(l, mid), build(mid, r), l, r); } void add(int val) { f += val; m += val; } void push_down() { if (f > 0) { lc->add(f); rc->add(f); f = 0; } } void maintain() { m = max({m, lc->m, rc->m}); } void add(int ql, int qr, int val) { if (ql == l && qr == r) add(val); else { push_down(); int mid = (l + r) / 2; if (qr <= mid) lc->add(ql, qr, val); else if (ql >= mid) rc->add(ql, qr, val); else { lc->add(ql, mid, val); rc->add(mid, qr, val); } maintain(); } } int query(int ql, int qr) { if (ql == l && qr == r) return m; else { push_down(); int mid = (l + r) / 2; if (qr <= mid) return lc->query(ql, qr); else if (ql >= mid) return rc->query(ql, qr); else return max(lc->query(ql, mid), rc->query(mid, qr)); } } } * t[K + 1]; int a[N], last[N]; int main() { ios::sync_with_stdio(false); int n, k; cin >> n >> k; int cnt = 0; t[1] = seg_node::build(0, n); memset(last, 0xff, sizeof last); for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; if (last[a[i]] == -1) { cnt++; last[a[i]] = i; } t[1]->add(i, i + 1, cnt); } for (int i = 2; i <= k; i++) { t[i] = seg_node::build(0, n); memset(last, 0xff, sizeof last); for (int j = i - 1; j < n; j++) { t[i - 1]->add(last[a[j]] == -1 ? i - 2 : last[a[j]], j, 1); t[i]->add(j, j + 1, t[i - 1]->query(i - 2, j)); last[a[j]] = j; } } cout << t[k]->query(n - 1, n); } |
#include <bits/stdc++.h> using namespace std; int n; int a[222222]; set<int> s; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { s.insert(i); } for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] != 0) { s.erase(a[i]); } } int idx = n; int iidx = 0; int iiidx = -1; for (auto &x : s) { while (a[idx] != 0) { idx--; } a[idx] = x; iidx = idx; if (iiidx == -1) { iiidx = idx; } } for (int i = 1; i <= n; i++) { if (a[i] == i) { if (i == iidx) { a[i] = a[iiidx]; a[iiidx] = i; } else { a[i] = a[iidx]; a[iidx] = i; } break; } } for (int i = 1; i <= n; i++) { printf( %d , a[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long ans = 0; int t = n; for (int i = 2; i * i <= t; ++i) { while (n % i == 0) { ans += n; n /= i; } } ans += n == 1 ? 1 : n + 1; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int freq[101]; int main() { int n, x, max = 0, count = 0; cin >> n; string s; if (n == 1) { cin >> s; sort(s.begin(), s.end()); for (int i = 0; i < s.length(); i++) { if (s[i] == s[i + 1]) count++; } cout << count << endl; } else if (n > 1) { int arr[101] = {}; for (int i = 1; i <= n; i++) { cin >> x; freq[x]++; } for (int i = 0; i < 101; i++) { if (freq[i] > max) max = freq[i]; } cout << max; return 0; } } |
#include <bits/stdc++.h> using namespace std; const int AND = 0; const int OR = 1; const int NAND = 2; const int NOR = 3; const int N = 111; int n, m, k; string s; int a[N][3]; int b[N][3]; vector<int> g[N]; bool st[N]; int ord[N]; int ordSz; int col[N]; int C; bool used[N]; bool oldUsed[N]; long long G[N]; int readType() { cin >> s; if (s == and ) return AND; if (s == or ) return OR; if (s == nand ) return NAND; if (s == nor ) return NOR; throw; } void read() { cin >> n >> m >> k; for (int i = 0; i < m; i++) { a[i][0] = readType(); cin >> s; int p = 1; for (int j = 0; j < n; j++) { if (s[j] == x ) { a[i][p++] = j; } } } for (int i = 0; i < k; i++) { b[i][0] = readType(); cin >> s; int p = 1; for (int j = 0; j < m; j++) { if (s[j] == x ) { b[i][p++] = j; } } } } void addEdge(int v, int u) { g[v ^ 1].push_back(u); g[u ^ 1].push_back(v); } void addGraph(int v, int tp) { tp = a[v][0] ^ (tp << 1); if (tp == 0) { st[2 * a[v][1] + 1] = 1; st[2 * a[v][2] + 1] = 1; } else if (tp == 1) { addEdge(2 * a[v][1] + 1, 2 * a[v][2] + 1); } else if (tp == 2) { addEdge(2 * a[v][1], 2 * a[v][2]); } else if (tp == 3) { st[2 * a[v][1]] = 1; st[2 * a[v][2]] = 1; } } void dfsMark(int v) { used[v] = 1; for (int u : g[v]) { if (!used[u]) dfsMark(u); } } bool checkUsed() { for (int i = 0; i < n; i++) if (used[2 * i] && used[2 * i + 1]) return false; return true; } bool checkSAT(long long MASK) { for (int i = 0; i < 2 * n; i++) { g[i].clear(); st[i] = 0; used[i] = 0; } for (int i = 0; i < k; i++) { if (((MASK >> i) & 1) == 0) continue; for (int j = 1; j < 3; j++) addGraph(b[i][j], (int)(b[i][0] < 2)); } for (int i = 0; i < 2 * n; i++) if (st[i]) dfsMark(i); if (!checkUsed()) return false; for (int i = 0; i < n; i++) { if (used[2 * i] || used[2 * i + 1]) continue; for (int j = 0; j < 2 * n; j++) oldUsed[j] = used[j]; dfsMark(2 * i); if (checkUsed()) continue; for (int j = 0; j < 2 * n; j++) used[j] = oldUsed[j]; dfsMark(2 * i + 1); if (!checkUsed()) return false; } return checkUsed(); } int intVar[10]; int cntVar; bool oper(int t, bool v1, bool v2) { bool res = 0; if (t >= 2) { t ^= 2; res ^= 1; } if (t == AND) return res ^ (v1 && v2); else return res ^ (v1 || v2); } bool getValConst(int v, int MASK) { for (int i = 0; i < cntVar; i++) { if (intVar[i] == v) { return (MASK >> i) & 1; } } throw; } bool getValA1(int v, int MASK) { return oper(a[v][0], getValConst(a[v][1], MASK), getValConst(a[v][2], MASK)); } bool getValA2(int v, int MASK) { return oper(a[v][0] ^ 2, getValConst(a[v][1], MASK), getValConst(a[v][2], MASK)); } bool getValB1(int v, int MASK) { return oper(b[v][0], getValA1(b[v][1], MASK), getValA1(b[v][2], MASK)); } bool getValB2(int v, int MASK) { return oper(b[v][0] ^ 2, getValA2(b[v][1], MASK), getValA2(b[v][2], MASK)); } bool solve(int id1, int id2) { cntVar = 0; for (int i = 1; i < 3; i++) for (int j = 1; j < 3; j++) { intVar[cntVar++] = a[b[id1][i]][j]; intVar[cntVar++] = a[b[id2][i]][j]; } sort(intVar, intVar + cntVar); cntVar = unique(intVar, intVar + cntVar) - intVar; for (int MASK = 0; MASK < (1 << cntVar); MASK++) { if (getValB1(id1, MASK) && getValB2(id2, MASK)) return true; } return false; } bool isGoodMask(long long MASK) { return !checkSAT(MASK); } void eraseFromG(int v, int u) { if ((G[v] >> u) & 1) G[v] ^= 1LL << u; } int ANS = 0; void brute(int curAns, long long curMask, long long cand, long long already) { if (cand == 0) { if (isGoodMask(curMask)) ANS = max(ANS, curAns); return; } bool ok = true; for (int i = 0; ok && i < k; i++) { if (((already >> i) & 1) == 0) continue; if ((G[i] & cand) == cand) ok = false; } if (!ok) return; for (int v = 0; (1LL << v) <= cand; v++) { if (((cand >> v) & 1) == 0) continue; brute(curAns + 1, curMask | (1LL << v), (cand & G[v]) ^ (1LL << v), already & G[v]); already |= 1LL << v; cand ^= 1LL << v; } } int main() { read(); for (int i = 0; i < k; i++) G[i] = (1LL << k) - 1; for (int i = 0; i < k; i++) for (int j = 0; j < k; j++) { if (solve(i, j)) { eraseFromG(i, j); eraseFromG(j, i); } } long long all = 0; for (int i = 0; i < k; i++) { if (((G[i] >> i) & 1) == 0) continue; all |= 1LL << i; } brute(0, 0, all, 0); if (ANS == 0) cout << -1 << endl; else cout << k - ANS << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const signed long long int LINF = LLONG_MAX; const double EPS = 1e-9; const int MOD = 1000000007; const int MAXN = 100001; const int ALPH = 26; const int DALPH = 52; string s; vector<int> z; vector<pair<int, int> > ans; vector<int> add, sum; int main() { cin >> s; z.resize((int)(s).size()); int l = 0, r = 0; z[0] = (int)(s).size(); for (int i = 1; i < (int)(s).size(); ++i) { int j = 0; if (i <= r) { int ind = i - l; j = min(z[ind], r - i + 1); } for (; i + j < (int)(s).size(); ++j) { if (s[j] != s[i + j]) { break; } } z[i] = j; if (i + j - 1 > r) { r = i + j - 1; l = i; } } add.resize((int)(s).size()); for (int i = 1; i < (int)(s).size(); ++i) { add[0]++; add[z[i]]--; } sum.resize((int)(s).size()); int cnt = 0; for (int i = 0; i < (int)(s).size(); ++i) { cnt += add[i]; sum[i] = cnt + 1; } for (int i = (int)(s).size() - 1; i >= 0; --i) { if (i + z[i] != (int)(s).size()) { continue; } ans.push_back(make_pair((z[i]), (sum[z[i] - 1]))); } printf( %d n , (int)(ans).size()); for (int i = 0; i < (int)(ans).size(); ++i) { printf( %d %d n , ans[i].first, ans[i].second); } } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> xx(n); vector<int> yy(n); vector<int> diff(n); for (int i = 0; i < n; i++) { string s; cin >> s; xx[i] = count(s.begin(), s.end(), B ); yy[i] = (int)s.size() - xx[i]; diff[i] = yy[i] - xx[i]; } int maxX = *max_element(xx.begin(), xx.end()); int minX = *min_element(xx.begin(), xx.end()); int maxY = *max_element(yy.begin(), yy.end()); int minY = *min_element(yy.begin(), yy.end()); int max_diff = *max_element(diff.begin(), diff.end()); int min_diff = *min_element(diff.begin(), diff.end()); auto Works = [&](int dist) -> pair<int, int> { int x1 = maxX - dist; int x2 = minX + dist; int y1 = maxY - dist; int y2 = minY + dist; int d1 = max_diff - dist; int d2 = min_diff + dist; auto Inside = [&](int x, int y) { int d = y - x; return (x1 <= x && x <= x2 && y1 <= y && y <= y2 && d1 <= d && d <= d2 && x + y >= 1); }; { int x = x2; int y = d1 + x; y = max(y, y1); y = min(y, y2); if (Inside(x, y)) { return {x, y}; } } { int y = y2; int x = y - d1; x = max(x, x1); x = min(x, x2); if (Inside(x, y)) { return {x, y}; } } return {-1, -1}; }; int low = 0, high = 5e5; while (low < high) { int mid = (low + high) / 2; if (Works(mid).first != -1) { high = mid; } else { low = mid + 1; } } auto [k0, k1] = Works(low); cout << low << n ; cout << string(k0, B ) + string(k1, N ) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; const int INF = 1000000000; int n, m, numV; int head[MAXN], e_cnt, s, t; bool volunt[MAXN]; struct Edg { int v, next; } edg[MAXN * 4]; inline void add(int a, int b) { edg[e_cnt].v = b; edg[e_cnt].next = head[a]; head[a] = e_cnt++; } int dis[MAXN]; bool inq[MAXN]; bool spfa(int x) { for (int i = 1; i <= n; ++i) dis[i] = INF; dis[s] = 0; queue<int> q; q.push(s); while (!q.empty()) { int u = q.front(); q.pop(); inq[u] = 0; if (volunt[u]) dis[u] = 0; for (int i = head[u]; i != -1; i = edg[i].next) { int v = edg[i].v; if (dis[v] > dis[u] + 1 && dis[u] + 1 <= x) { dis[v] = dis[u] + 1; if (!inq[v]) q.push(v); inq[v] = 1; } } } return dis[t] != INF; } int main() { while (scanf( %d%d%d , &n, &m, &numV) != EOF) { memset(volunt, 0, sizeof(volunt)); e_cnt = 0; memset(head, -1, sizeof(head)); for (int i = 0, j; i < numV; ++i) { scanf( %d , &j); volunt[j] = 1; } for (int i = 0; i < m; ++i) { int ta, tb; scanf( %d%d , &ta, &tb); add(ta, tb); add(tb, ta); } scanf( %d%d , &s, &t); int rt(m), lt(1), ans(-1); while (lt <= rt) { int mid = (lt + rt) >> 1; if (spfa(mid)) { rt = mid - 1; ans = mid; } else lt = mid + 1; } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > edges; vector<int> conn[201]; bool v1[201], v2[201]; int mx = 0; void setEdge(int a, int b, int v) { for (int s = 0; s < conn[a].size(); s++) { if (conn[a][s] == b || conn[a][s] == -1) conn[a][s] = (v == 1 ? b : -1); } for (int s = 0; s < conn[b].size(); s++) { if (conn[b][s] == a || conn[b][s] == -1) conn[b][s] = (v == 1 ? a : -1); } } int getHeight(int i) { v2[i] = 1; int ret = 0; for (int j = 0; j < conn[i].size(); j++) { if (conn[i][j] != -1 && !v2[conn[i][j]]) { ret = max(ret, 1 + getHeight(conn[i][j])); } } v2[i] = 0; return ret; } int longestPath(int i) { v1[i] = 1; int ret = 0; int cnt = 0; for (int j = 0; j < conn[i].size(); j++) { if (conn[i][j] != -1 && !v1[conn[i][j]]) { ret = max(ret, longestPath(conn[i][j])); cnt++; } } if (cnt == 0) ret = max(ret, getHeight(i)); v1[i] = 0; return ret; } int main() { cin >> n; memset(v1, 0, sizeof v1); memset(v2, 0, sizeof v2); int a, b; for (int i = 0; i < n - 1; i++) { cin >> a >> b; edges.push_back(make_pair(a - 1, b - 1)); conn[a - 1].push_back(b - 1); conn[b - 1].push_back(a - 1); } for (int i = 0; i < edges.size(); i++) { a = edges[i].first; b = edges[i].second; setEdge(a, b, 0); mx = max(mx, longestPath(a) * longestPath(b)); setEdge(a, b, 1); } cout << mx << endl; } |
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef vector< ll > vl; typedef vector< vector< ll > > vvl; #define ff first #define ss second #define boost ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define pb push_back #define all(c) c.begin(), c.end() #define tr(c,it) for(auto it=(c).begin(); it!=(c).end(); it++) #define ref(i,n) for(i=0;i<n;i++) #define mp make_pair #define endl n #define MOD 1000000007 ll power(ll a, ll b){//a^b ll res=1; a=a%MOD; while(b>0){ if(b&1){res=(res*a)%MOD;b--;} a=(a*a)%MOD; b>>=1; } return res; } ll fermat_inv(ll y){return power(y,MOD-2);} ll gcd(ll a, ll b){return (b==0)?a:gcd(b,a%b);} int main() { boost ll t; cin>>t; while(t--) { ll n,x=0,y=0,flag=0,m,i; cin>>n; string s; cin>>s; ref(i,n) { if(s[i]== T ) x++; else { y++; } if(y>x) { flag=1; break; } } if(flag==1 || x!=2*y) { cout<< NO <<endl; continue; } x=y=flag=0; for(i=n-1;i>=0;i--) { if(s[i]== T ) x++; else { y++; } if(y>x) { flag=1; break; } } if(flag) cout<< NO <<endl; else cout<< YES <<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(); cin.tie(); cout.tie(); int n; cin >> n; int weight[n]; for (int i = 0; i < n; ++i) cin >> weight[i]; int p; cin >> p; vector<pair<pair<int, int>, int> > data; for (int i = 0; i < p; ++i) { int a, b; cin >> a >> b; --a; data.push_back({{b, a}, i}); } sort(data.begin(), data.end()); vector<pair<int, long long> > answer; long long dp[n]; int prev = -1; for (int i = 0; i < p; ++i) { int b = data[i].first.first, a = data[i].first.second; if (b >= 500) { long long sum = 0; for (; a < n; a += b) sum += weight[a]; answer.push_back({data[i].second, sum}); prev = -1; continue; } if (prev == -1 || b != prev) { for (int j = n - 1; j >= 0; --j) { if (j + b > n - 1) dp[j] = weight[j]; else dp[j] = weight[j] + dp[j + b]; } } answer.push_back({data[i].second, dp[a]}); prev = b; } sort(answer.begin(), answer.end()); for (int i = 0; i < p; ++i) cout << answer[i].second << n ; return 0; } |
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include<time.h> #include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <algorithm> #include <queue> #include <stack> #include <unordered_map> #include <unordered_set> #include <stdio.h> #include <deque> #include <map> #include <set> #include <string> #define ll long long typedef long long LL; typedef unsigned long long ULL; //typedef long double ld; using namespace std; const int MAXN = 2e6 + 5000; const long double eps = (1e-12); const int logn = 21; const double Pi = acos(-1.0); const LL pp = 1000000000 + 9; int lowbit(int x) { return x & (-x); } #define MP(i,j) make_pair(i,j) #define M(x) ((((x)%pp)+pp)%pp) //#define int LL #define P pair<int,int> const int INF = 1e9; int toright[505][505]; int todown[505][505]; int dx[5] = { 0,0,0,-1,1 }; int dy[5] = { 0,-1,1,0,0 }; int dp[505][505][25]; int getww(int x1, int y1, int x2, int y2) { if (x2 == x1 + 1) { return todown[x1][y1]; } else if (x2 == x1 - 1) { return todown[x2][y1]; } else if (y2 == y1 + 1) { return toright[x1][y1]; } else if (y2 == y1 - 1) { return toright[x1][y2]; } return -1; } signed main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m - 1; j++) { scanf( %d , &toright[i][j]); } } for (int i = 1; i <= n - 1; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &todown[i][j]); } } if (k % 2 == 1) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { printf( -1 ); } printf( n ); } } else { k /= 2; for (int kk = 1; kk <= k; kk++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j][kk] = INF; } } } for (int kk = 1; kk <= k; kk++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { for (int l = 1; l <= 4; l++) { int x = i + dx[l]; int y = j + dy[l]; if (x<1 || x>n || y<1 || y>m) continue; int w = getww(i, j, x, y); dp[i][j][kk] = min(dp[i][j][kk], w + dp[x][y][kk - 1]); } } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { printf( %d , dp[i][j][k] * 2); } printf( n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 300000 + 5; int a[maxn], dp[maxn]; int n, k; bool ok_hack(int x) { memset(dp, 0, sizeof(dp)); int last = 0; for (int i = k; i <= n; i++) { if (a[i] - a[dp[i - k] + 1] <= x) last = i; dp[i] = last; } return dp[n] == n; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); a[0] = 0; int l = 0, r = a[n] - a[1]; while (l < r) { int mid = r + l >> 1; if (ok_hack(mid)) r = mid; else l = mid + 1; } printf( %d n , l); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,abm,mmx,tune=native ) using namespace std; const int64_t INF = (int64_t)(2e18); const int maxn = 500 * 1000 + 100; chrono::time_point<chrono::steady_clock> cl; double current_time() { return (double)(chrono::steady_clock::now() - cl).count() / 1e9; } void no() { cout << 0 ; exit(0); } void inf() { cout << inf ; exit(0); } void ans(long long a) { cout << a; exit(0); } int32_t main() { cl = chrono::steady_clock::now(); ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); long long x, y, z; cin >> x >> y >> z; if (x == y && y != z) no(); if (x != y && y == z) ans(1); if (x == z && y != z) no(); if (x == y && y == z) { if (x == 1) inf(); if (x != 1) ans(2); } if (x > y) no(); if (y > z) no(); bool flag = false; if (x == 1ll) { flag = true; long long zz = z; while (z > 1) { if (z % y != 0) flag = false; z /= y; } z = zz; } vector<int> a; long long zcp = z; while (zcp > 0) { a.push_back(zcp % y); zcp /= y; } long long cur = 0; long long curx = 1; for (auto& it : a) { cur += it * curx; curx *= x; } int res = 0; if (cur == y) ++res; if (flag) ++res; cout << bool(res); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<ll, ll>; int main() { char rep[256], a[256], b[256], d[256]; while (scanf( %[0-9].%[0-9]e%[0-9] n , a, d, b) == 3) { auto len = strlen(d); if (b[0] == 0 ) { if (len == 1 and d[0] == 0 ) printf( %s n , a); else printf( %s.%s n , a, d); continue; } if (a[0] == 0 ) a[0] = 0; while (len > 0 and d[len - 1] == 0 ) --len; d[len] = 0; int digits = 0; for (auto p = a; *p; ++p) rep[digits++] = *p; int n = atoi(b); auto p = d; for (; *p and n; ++p) { rep[digits++] = *p; --n; } rep[digits] = 0; if (n == 0) { printf( %s , rep); if (*p) { printf( . ); while (*p) { printf( %c , *p); ++p; } } printf( n ); } else { printf( %s , rep); while (n--) printf( 0 ); printf( n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e9 + 7; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t; cin >> t; while (t--) { long long n; cin >> n; long long a[n]; map<long long, long long> m; map<long long, long long> m1; map<long long, long long> m2; map<long long, long long> m3; vector<pair<long long, long long>> v; for (long long i = 0; i < n; i++) { cin >> a[i]; m2[a[i]]++; } for (auto it = m2.begin(); it != m2.end(); it++) { m3[it->second]++; } for (long long i = 0; i < n - 1; i++) { long long x = ++m[a[i]]; m1[x]++; m1[x - 1]--; long long y = m2[a[i]]; if (y == 1) { m2.erase(m2.find(a[i])); } else m2[a[i]]--; m3[y]--; m3[y - 1]++; auto it = m.end(); it--; x = it->first; it = m2.end(); it--; y = it->first; if (x == m.size() && y == m2.size() && m1[1] == x && m3[1] == y) { v.push_back({x, y}); } } cout << v.size() << n ; for (long long i = 0; i < (long long)v.size(); i++) { cout << v[i].first << << v[i].second << n ; } } } |
#include <bits/stdc++.h> using namespace std; struct node { int x, h, id; } a[100005]; int n, i, j, f[100005], ans[100005]; bool cmp(node x, node y) { if (x.x != y.x) return x.x < y.x; else return x.h < y.h; } int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d%d , &a[i].x, &a[i].h); a[i].id = i; } sort(a + 1, a + n + 1, cmp); for (i = n; i >= 1; i--) { f[i] = 1; for (j = i + 1; j <= n; j += f[j]) { if (a[i].x + a[i].h - 1 >= a[j].x) f[i] += f[j]; else break; } ans[a[i].id] = f[i]; } for (i = 1; i <= n; i++) printf( %d , ans[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { map<char, int> ma; char a; int b; cin >> b; for (int i = 0; i < b; i++) { cin >> a; ma[a]++; } for (auto i : ma) for (int j = 0; j < i.second; j++) cout << i.first; } |
#include <bits/stdc++.h> using namespace std; double x; int N, M, ar[5005], res; int dn[5005]; int main() { scanf( %d %d , &N, &M); for (int i = 0; i < N; i++) { scanf( %d %lf , &ar[i], &x); ar[i]--; } for (int i = 0; i < N; i++) { for (int j = ar[i]; j >= 0; j--) { dn[ar[i]] = max(dn[ar[i]], 1 + dn[j]); } } for (int i = 0; i < M; i++) { res = max(res, dn[i]); } printf( %d n , N - res); } |
#include <bits/stdc++.h> const int MN = 1e3 + 10; const int K = 20; int N, M, T, id[MN], t[MN], ctr, m[1 << K]; bool conn[MN][MN]; char s[10]; std::vector<int> a[MN], on[K + 1]; struct Mod { public: char c; int a, b; void out() const { printf( %c %d %d n , c, a, b); } }; std::vector<Mod> f; void flip(int a, int b) { f.push_back({conn[a][b] ? - : + , a, b}); conn[a][b] ^= 1; } void dfs(int n) { for (int x : a[n]) if (!~id[x]) dfs(x); id[n] = ctr; t[ctr] = n; ++ctr; } int main() { memset(id, -1, sizeof id); scanf( %d%d%d , &N, &M, &T); for (int i = 0, u, v; i < M; ++i) scanf( %d%d , &u, &v), a[u].push_back(v), conn[u][v] = 1; ctr = 0; for (int i = 1; i <= N; ++i) if (!~id[i]) dfs(i); for (int i = std::min(N, K) - 1; i; --i) for (int j = i - 1; j >= 0; --j) if (!conn[t[i]][t[j]]) { a[t[i]].push_back(t[j]); conn[t[i]][t[j]] = 1; f.push_back({ + , t[i], t[j]}); } for (int i = 0; i < 1 << K; ++i) if (__builtin_popcount(i) <= 3) on[__builtin_popcount(i)].push_back(i); memset(m, -1, sizeof m); for (int i = K; i < N; ++i) { f.push_back({ + , t[i], t[i]}); int n = t[i], v = 0; for (int x : a[n]) if (id[x] < K) v |= 1 << id[x]; bool ok = 0; for (int j = 0; !ok; ++j) { assert(j <= 3); for (int k : on[j]) if (!~m[v ^ k]) { m[v ^ k] = n; for (int b = 0; b < K; ++b) if (k >> b & 1) flip(n, t[b]); ok = 1; break; } } } printf( %u n , f.size()); for (int i = 0; i < f.size(); ++i) f[i].out(); fflush(stdout); for (int i = 0; i < T; ++i) { int v = 0; bool lose = 0; for (int j = 0; j < std::min(N, K); ++j) { printf( ? 1 %d n , t[j]); fflush(stdout); scanf( %s , s); if (s[0] == S ) return 0; if (s[0] == W ) v |= 1 << j; if (s[0] == L ) { lose = 1, v = j; break; } } if (lose) printf( ! %d n , t[v]); else printf( ! %d n , m[v]); fflush(stdout); scanf( %s , s); if (s[0] == W ) return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n; long long b[500010], a[500010]; void solve() { cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; long long sum = 0, flag = 1; for (int i = 0; i < n; i++) sum += b[i]; if (sum % (n * (n + 1) / 2)) flag = 0; sum /= n * (n + 1) / 2; for (int i = 0; i < n; i++) { long long dx = sum - b[(i + 1) % n] + b[i]; if (dx % n || dx <= 0) flag = 0; else a[(i + 1) % n] = dx / n; } if (flag) { cout << YES << n ; for (int i = 0; i < n; i++) cout << a[i] << ; cout << n ; } else cout << NO << n ; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0); int _; cin >> _; while (_--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5; const int INF = 1e9; int n; int ct[MAXN][2]; vector<int> ok(int d) { vector<int> bad(2, -1); int loX = 0, hiX = INF; int loY = 0, hiY = INF; int loD = -INF, hiD = INF; for (int i = 0; i < n; i++) { int x = ct[i][0], y = ct[i][1]; loX = max(loX, x - d); hiX = min(hiX, x + d); loY = max(loY, y - d); hiY = min(hiY, y + d); loD = max(loD, y - x - d); hiD = min(hiD, y - x + d); } if (loX > hiX || loY > hiY || loD > hiD) return bad; auto check1 = [&](int x) { int lo = max(loY, loD + x), hi = min(hiY, hiD + x); if (lo > hi) return bad; if (x || hi) return vector<int>{x, hi}; return bad; }; auto check2 = [&](int y) { int lo = max(loX, y - hiD), hi = min(hiX, y - loD); if (lo > hi) return bad; if (y || hi) return vector<int>{hi, y}; return bad; }; if (bad != check1(loX)) return check1(loX); if (bad != check1(hiX)) return check1(hiX); if (bad != check2(loY)) return check2(loY); if (bad != check2(hiY)) return check2(hiY); return bad; } void run_case() { cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; for (char &j : s) { ct[i][j == N ]++; } } int lo = -1; int hi = 1e6; while (lo + 1 < hi) { int mid = (lo + hi) / 2; if (ok(mid)[0] != -1) { hi = mid; } else { lo = mid; } } vector<int> res; res = ok(hi); cout << hi << n ; string ans = string(res[0], B ) + string(res[1], N ); cout << ans << n ; } int main() { ios::sync_with_stdio(false), cin.tie(0); if (fopen( input.in , r )) freopen( input.in , r , stdin), freopen( output.out , w , stdout); int t; t = 1; while (t--) { run_case(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 205, M = N * N; using ll = long long; int n, a[N][N]; struct Edge { int v, nxt; ll w, cw; } e[M << 2]; int head[M], ptr; void add_edge(int uu, int vv) { e[ptr] = {vv, head[uu], 1, 0}; head[uu] = ptr++; e[ptr] = {uu, head[vv], 1, 0}; head[vv] = ptr++; } int ss[M], tt[M]; bool vis[M]; bool push(int pos, int fl) { if (tt[pos] && fl == 1) return 1; if (ss[pos] && fl == -1) return 1; vis[pos] = 1; for (int i = head[pos]; i != -1; i = e[i].nxt) { int v = e[i].v; if (fl == 1 && e[i].cw == 1) continue; if (fl == -1 && e[i].cw != -1) continue; if (vis[v]) continue; if (push(v, fl)) { ++e[i].cw; --e[i ^ 1].cw; return 1; } } return 0; } inline int id(int x, int y) { return (x - 1) * n + y; } vector<pair<int, int>> v; int main() { ios::sync_with_stdio(false); cin >> n; memset(head, -1, sizeof(head)); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (a[i][j] == -1) continue; if (i + 1 <= n && a[i + 1][j] >= 0) add_edge(id(i, j), id(i + 1, j)); if (j + 1 <= n && a[i][j + 1] >= 0) add_edge(id(i, j), id(i, j + 1)); if (a[i][j] > 0) { tt[id(i, j)] = 1; v.push_back({a[i][j], id(i, j)}); } } sort(v.begin(), v.end()); int flow = 0; ll ans = 0; for (int i = 0; i < int(v.size()) - 1; i++) { int pos = v[i].second; memset(vis, 0, sizeof(vis)); while (push(pos, -1)) --flow, memset(vis, 0, sizeof(vis)); tt[pos] = 0; ss[pos] = 1; memset(vis, 0, sizeof(vis)); for (int j = 0; j <= i; j++) if (!vis[v[j].second]) while (push(v[j].second, 1)) ++flow, memset(vis, 0, sizeof(vis)); ans += ll(v[i + 1].first - v[i].first) * flow; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string A, B; int ma = 0; cin >> A >> B; for (char &ch : A) ma = max(ma, ch - 0 ); for (char &ch : B) ma = max(ma, ch - 0 ); ma++; int a = 0, b = 0; for (char &ch : A) { a = a * ma + ch - 0 ; } for (char &ch : B) { b = b * ma + ch - 0 ; } a += b; int ans = 0; while (a) ans++, a /= ma; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, ar[11][100005]; int rev[11][100005]; long long mx(int start) { int val = ar[0][start]; for (int tmp = 0; tmp < n; ++tmp) { for (int row = 1; row < m; ++row) { int col = rev[row][val]; if (col + tmp >= n) { return tmp; } int curVal = ar[row][col + tmp]; int val2 = ar[0][start + tmp]; if (curVal != val2) { return tmp; } } } return n; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { scanf( %d , ar[i] + j); rev[i][ar[i][j]] = j; } } long long ans = 0; for (int i = 0; i < n;) { long long mxi = mx(i); ans += (mxi * (mxi + 1) / 2ll); i += mxi; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 6e5 + 5, mod = 998244353; vector<int> num; long long A[N]; int a[N]; long long sumup = 0, sumdown = 0; long long qpow(long long a, long long b) { long long c = 1; while (b) { if (b & 1) c = (a * c) % mod; b >>= 1; a = (a * a) % mod; } return c; } long long inv(long long x) { return qpow(x, mod - 2); } int main() { int n; cin >> n; n <<= 1; A[0] = 1; for (int i = 1; i <= n; i++) A[i] = (A[i - 1] * i) % mod; for (int i = 1; i <= n; i++) cin >> a[i]; long long ans = 0; sort(a + 1, a + n + 1); for (int i = 1; i <= n / 2; i++) ans -= a[i]; for (int i = n / 2 + 1; i <= n; i++) ans += a[i]; ans = (ans % mod * A[n] % mod * inv(A[n / 2]) % mod * inv(A[n / 2])) % mod; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { x = 0; char c = getchar(); int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } x *= f; } const int N = 6666; const double eps = 1e-9; int n, m, a[N], b[N]; void Get(double &x, int y) { x -= (double)(x / y); } int main() { read(n); read(m); for (register int i = 1; i <= n; i++) read(a[i]); for (register int i = 1; i <= n; i++) read(b[i]); double l = 0, r = 1e9, res = 2e9; for (register int t = 70; t >= 1; t--) { double mid = (l + r) / 2, now = m + mid; for (register int i = 1; i <= n; i++) Get(now, a[i]), Get(now, b[i < n ? i + 1 : 1]); if (now > m - eps) res = mid, r = mid; else l = mid; } if (res > 1e9 + eps) puts( -1 ); else printf( %.9lf , res); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; int n, m, q; long long add[510], a[510][510], dp[510][510], gox[510][510], goy[510][510]; vector<pair<int, int> > vx[510][510], vy[510][510]; int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 0; i < q; i++) { int x, y, t, d, e; scanf( %d%d%d%d%d , &x, &y, &d, &t, &e); if (x + y >= t && (x + y - t) % 4 == 0) { a[x][y] += e; if (x + y + d >= t && (x + y + d - t) % 4 == 2) vx[x][y].push_back({x + d, e}); else vx[x][y].push_back({n, e}); if (x + y + d >= t && (x + y + d - t) % 4 == 3) vy[x][y].push_back({y + d, e}); else vy[x][y].push_back({m, e}); } if (x + y >= t && (x + y - t) % 4 == 1) { a[x + d][y - d] += e; vx[x + d][y - d].push_back({n, e}); if (x + y + d >= t && (x + y + d - t) % 4 == 2) vy[x + d][y - d].push_back({y, e}); else vy[x + d][y - d].push_back({m, e}); } if (x + y + d >= t && (x + y + d - t) % 4 == 2) { a[x + d][y] += e; vx[x + d][y].push_back({n, e}); vy[x + d][y].push_back({m, e}); } if (x + y + d >= t && (x + y + d - t) % 4 == 3) { a[x][y + d] += e; vx[x][y + d].push_back({n, e}); vy[x][y + d].push_back({m, e}); } } for (int x = 0; x < n; x++) { for (int y = 0; y < m; y++) { dp[x][y] = INF; { long long cur = 0; for (auto it : vx[x][y]) { cur += it.second; add[it.first] += it.second; } for (int k = x; k <= n; k++) { cur -= add[k]; gox[y][k] += cur; add[k] = 0; } } { long long cur = 0; for (auto it : vy[x][y]) { cur += it.second; add[it.first] += it.second; } for (int k = y; k <= m; k++) { cur -= add[k]; goy[k][x] += cur; add[k] = 0; } } } } dp[0][0] = a[0][0]; for (int x = 0; x < n; x++) { for (int y = 0; y < m; y++) { dp[x][y] -= a[x][y]; for (int k = x + 1; k < n; k++) dp[k][y] = min(dp[k][y], dp[x][y] + gox[y][k]); for (int k = y + 1; k < m; k++) dp[x][k] = min(dp[x][k], dp[x][y] + goy[k][x]); { long long cur = 0; for (auto it : vx[x][y]) { cur += it.second; add[it.first] += it.second; } for (int k = x; k <= n; k++) { cur -= add[k]; gox[y][k] -= cur; add[k] = 0; } } { long long cur = 0; for (auto it : vy[x][y]) { cur += it.second; add[it.first] += it.second; } for (int k = y; k <= m; k++) { cur -= add[k]; goy[k][x] -= cur; add[k] = 0; } } } } printf( %lld , dp[n - 1][m - 1]); return 0; } |
#include <bits/stdc++.h> int main() { int h, w, bh, bw, th, tw; long long ar, ba; bh = bw = ba = 0; scanf( %d %d , &h, &w); int tmp; for (int i = 30; i >= 0; i--) { tmp = (1 << i); if (tmp <= w) { long long x = (long long)tmp * 8; long long y = (long long)tmp * 125; if (x % 10 != 0) x = x / 10 + 1; else x = x / 10; y /= 100; if (y <= h) { th = y; tw = tmp; ar = (long long)th * (long long)tw; if (ar > ba || ar == ba && th > bh) { bh = th; bw = tw; ba = (long long)bh * (long long)bw; } } else if (x <= h) { th = h; tw = tmp; ar = (long long)th * (long long)tw; if (ar > ba || ar == ba && th > bh) { bh = th; bw = tw; ba = (long long)bh * (long long)bw; } } } } for (int i = 30; i >= 0; i--) { tmp = (1 << i); if (tmp <= h) { int x = (int)((double)tmp / 1.25); int y = (int)((double)tmp / 0.8); if ((double)y * 0.8 < (double)tmp) y++; if ((double)x * 1.25 > (double)tmp) x--; if (y <= w) { th = tmp; tw = y; ar = (long long)th * (long long)tw; if (ar > ba || ar == ba && th > bh) { bh = th; bw = tw; ba = (long long)bh * (long long)bw; } } else if (x < w) { th = tmp; tw = w; ar = (long long)th * (long long)tw; if (ar > ba || ar == ba && th > bh) { bh = th; bw = tw; ba = (long long)bh * (long long)bw; } } } } if (bw > bh && bw <= h) std::swap(bw, bh); printf( %d %d n , bh, bw); return 0; } |
#include <bits/stdc++.h> using namespace std; int r1, r2, c1, c2, d1, d2; int main() { scanf( %d%d%d%d%d%d , &r1, &r2, &c1, &c2, &d1, &d2); for (int i = 1; i <= 9; ++i) for (int j = 1; j <= 9; ++j) for (int ii = 1; ii <= 9; ++ii) for (int jj = 1; jj <= 9; ++jj) { if (i != j && i != ii && i != jj && j != ii && j != jj && ii != jj) if (i + j == r1 && jj + ii == r2 && i + ii == c1 && j + jj == c2 && i + jj == d1 && j + ii == d2) { printf( %d %d n%d %d , i, j, ii, jj); return 0; } } printf( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; double a[100010], ans1, ans2; int n, n1, n2; bool cmp(double a, double b) { return a > b; } int main() { scanf( %d%d%d , &n, &n1, &n2); if (n1 > n2) swap(n1, n2); for (int i = 1; i <= n; i++) scanf( %lf , &a[i]); sort(a + 1, a + n + 1, cmp); for (int i = 1; i <= n1; i++) ans1 += a[i]; for (int i = n1 + 1; i <= n1 + n2; i++) ans2 += a[i]; printf( %.8f n , ans1 / n1 + ans2 / n2); return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> bismarck, dp; long long n; void factorization(long long x) { for (long long i = 2; i * i <= x; i++) { if (x % i == 0) { long long c = 0; while (x % i == 0) { c++; x /= i; } dp[i] |= 1 << (c - 1); } } if (x > 1) { dp[x] |= 1; } } long long grundy(long long x) { if (x == 0) return 0; if (bismarck.count(x)) return bismarck[x]; unordered_set<long long> s; for (long long i = 0; x >> i; i++) { s.insert(grundy(x >> i + 1 | (x & (1 << i) - 1))); } long long mex = 0; while (s.count(mex)) mex++; return bismarck[x] = mex; } int main() { long long x, ans = 0; cin >> n; while (n--) { cin >> x; factorization(x); } for (auto t : dp) { ans ^= grundy(t.second); } if (ans) cout << Mojtaba ; else cout << Arpa ; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long res = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { res = res * 10 + c - 48; c = getchar(); } return res * f; } const long long N = 610; long long f[N][N]; long long a[N][N]; long long n, m, mod; long long in[N], o[N], s[N], t[N], tots, tott, tot; long long head[N], to[N * N], nxt[N * N], res; queue<long long> q; long long id[N]; long long qpow(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } void add(long long x, long long y) { nxt[++tot] = head[x]; head[x] = tot; to[tot] = y; } void guess(long long n) { res = 1; for (long long i = 1; i <= n; ++i) { for (long long j = i + 1; j <= n; ++j) { while (a[j][i]) { long long v = a[i][i] * qpow(a[j][i], mod - 2) % mod; for (long long k = i; k <= n; ++k) a[i][k] = ((a[i][k] - 1LL * v * a[j][k] % mod) + mod) % mod; swap(a[i], a[j]), res = -res; } } } for (long long i = 1; i <= n; ++i) { res = (1ll * res * a[i][i] % mod + mod) % mod; } } signed main() { n = read(), m = read(), mod = read(); for (long long i = 1; i <= m; ++i) { long long x = read(), y = read(); in[y]++, o[x]++; add(x, y); } for (long long i = 1; i <= n; ++i) { if (in[i] == 0) s[++tots] = i; if (o[i] == 0) t[++tott] = i; } for (long long i = 1; i <= n; ++i) if (!in[i]) q.push(i); tot = 0; while (q.size()) { long long u = q.front(); q.pop(); id[++tot] = u; for (long long i = head[u]; i; i = nxt[i]) { long long v = to[i]; --in[v]; if (!in[v]) q.push(v); } } for (long long i = 1; i <= n; ++i) { long long u = id[i]; f[u][u] = 1; for (long long j = i; j <= n; ++j) { long long v = id[j]; for (long long k = head[v]; k; k = nxt[k]) { long long vv = to[k]; f[u][vv] = (f[u][vv] + f[u][v]) % mod; } } } for (long long i = 1; i <= tots; ++i) { for (long long j = 1; j <= tott; ++j) { a[i][j] = f[s[i]][t[j]]; } } guess(tots); cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int A, B; cin >> A >> B; string a, b; cin >> a >> b; int p = 0, m = a.size(); for (int i = 0; i + a.size() <= b.size(); i++) { int k = 0; for (int j = 0; j < a.size(); j++) { if (a[j] != b[i + j]) k++; } if (k < m) { m = k; p = i; } } vector<int> v; for (int i = 0; i < a.size(); i++) { if (a[i] != b[i + p]) v.push_back(i); } cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { cout << v[i] + 1 << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, n, m, k, l; int main() { ios_base::sync_with_stdio(false); cin.tie(); cin >> n >> m >> k >> l; if ((n / m) * m < k + l) { cout << -1 n ; return 0; } cout << (k + l) / m + ((k + l) % m != 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int temp, sum = 0; int size, counter = 0; cin >> size; for (int i = 0; i < size; i++) cin >> temp, sum += temp; if (sum % size == 0) cout << size << endl; else cout << size - 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct __s { __s() { if (1) { ios_base::Init i; cin.sync_with_stdio(0); cin.tie(0); } } ~__s() { if (!1) fprintf(stderr, Execution time: %.3lf s. n , (double)clock() / CLOCKS_PER_SEC); long long n; cin >> n; } } __S; int main(void) { long long n, m; cin >> n; vector<long long> a(n); for (long long i = 0; i < (long long)(n); i++) { cin >> a[i]; } cin >> m; long long b = 0; for (long long i = 0; i < (long long)(m); i++) { long long x; cin >> x; b += x - 1; } vector<long long> c; while (c.size() < 3 * max(m, n)) { for (long long i = 0; i < (long long)(n - 1); i++) { c.push_back(i); } for (long long i = 0; i < (long long)(n - 1); i++) { c.push_back(n - 1 - i); } } long long d = 0; for (long long i = 0; i < (long long)(m); i++) { b -= c[i]; if (i) d += abs(a[c[i]] - a[c[i - 1]]); } set<long long> ans; for (long long i = m; i < c.size(); i++) { if (b == 0) { ans.insert(d); } b -= c[i]; b += c[i - m]; d -= abs(a[c[i - m]] - a[c[i - m + 1]]); d += abs(a[c[i]] - a[c[i - 1]]); } if (ans.size() != 1) cout << -1 << n ; else cout << *ans.begin() << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100 * 1000; int n, m; int ar1[maxn]; int ar2[maxn]; void read(); int main() { read(); int i, j; int s1, s2; int file; i = j = s1 = s2 = file = 0; while (i < n) { if (s1 == 0) s1 += ar1[i++]; else { if (s1 < s2) s1 += ar1[i++]; else if (s1 == s2) { s1 = s2 = 0; file++; } else s2 += ar2[j++]; } } if (s1 > 0) file++; cout << file << endl; return 0; } void read() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> ar1[i]; for (int j = 0; j < m; j++) cin >> ar2[j]; } |
#include <bits/stdc++.h> using namespace std; long long qpow(long long a, long long k) { long long b = 1LL; while (k) { if (k % 2 == 1) b = (b * a) % 1000000007; a = (a * a) % 1000000007; k = k / 2; } return b; } int main() { char s[105] = {0}; scanf( %s , s); int len = strlen(s); long long ans = 0; for (int i = len - 1; i >= 0; i--) { ans = ans * 2; ans = ans % 1000000007; if (s[i] == 1 ) { ans = ans + qpow(4LL, (long long)(len - 1 - i)); ans = ans % 1000000007; } } printf( %I64d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x, y, u, v, to[600005], nxt[600005], p[300005], sz[300005]; void dfs(int x, int lst) { sz[x] = 1; for (int i = p[x]; i != -1; i = nxt[i]) if (to[i] != lst) { dfs(to[i], x); sz[x] += sz[to[i]]; } } int main() { scanf( %d%d%d , &n, &x, &y); memset(p, -1, sizeof p); for (int i = 1; i < n; i++) { scanf( %d%d , &u, &v); to[i * 2 - 1] = v, nxt[i * 2 - 1] = p[u], p[u] = i * 2 - 1; to[i * 2] = u, nxt[i * 2] = p[v], p[v] = i * 2; } dfs(x, -1); long long ans = sz[y]; dfs(y, -1); ans *= sz[x]; cout << 1LL * n * (n - 1) - ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int maxn = 100; const int MAXN = 2750131; long long T, n, m, i, j; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long g[200005]; int main() { ios::sync_with_stdio(false); long long a[20]; long long k = 1, s = 1, sum = 9; for (i = 0; s < 1e12; i++) { a[i] = s * sum * k; s *= 10; k++; } cin >> n; if (n < 10) { cout << n << endl; return 0; } sum = 0; i = 0; k = 1; s = 1; long long m = n; while (m > a[i]) { m -= a[i]; i++; k++; s = pow(10, i); sum = s - 1; } long long ans = (m) / k + sum; if (m % k) { ans++; } long long sk = m % k; if (sk == 0) { sk = k; } while (ans > 0) { if (sk == k) { cout << ans % 10 << endl; break; } else { ans /= 10; k--; } } return 0; } |
#include <bits/stdc++.h> int x1, x2, x3, y11, y2, y3, length; int main() { scanf( %d %d %d %d %d %d , &x1, &y11, &x2, &y2, &x3, &y3); length = (int)(sqrt(x1 * y11 + x2 * y2 + x3 * y3) + 0.01); if (x1 * y11 + x2 * y2 + x3 * y3 != length * length) { printf( -1 n ); return 0; } if (x1 < y11) { int temp = x1; x1 = y11; y11 = temp; } if (x2 < y2) { int temp = x2; x2 = y2; y2 = temp; } if (x3 < y3) { int temp = x3; x3 = y3; y3 = temp; } if (x1 == length && x2 == length && x3 == length) { printf( %d n , length); for (int i = 0; i < y11; i++) { for (int j = 0; j < x1; j++) printf( A ); printf( n ); } for (int i = 0; i < y2; i++) { for (int j = 0; j < x2; j++) printf( B ); printf( n ); } for (int i = 0; i < y3; i++) { for (int j = 0; j < x3; j++) printf( C ); printf( n ); } } else if (x1 == length) { printf( %d n , length); if (x2 != length - y11) { int temp = x2; x2 = y2; y2 = temp; } if (x3 != length - y11) { int temp = x3; x3 = y3; y3 = temp; } for (int i = 0; i < y11; i++) { for (int j = 0; j < x1; j++) printf( A ); printf( n ); } for (int i = 0; i < length - y11; i++) { for (int j = 0; j < y2; j++) printf( B ); for (int j = 0; j < y3; j++) printf( C ); printf( n ); } } else if (x2 == length) { printf( %d n , length); if (x1 != length - y2) { int temp = x1; x1 = y11; y11 = temp; } if (x3 != length - y2) { int temp = x3; x3 = y3; y3 = temp; } for (int i = 0; i < y2; i++) { for (int j = 0; j < x2; j++) printf( B ); printf( n ); } for (int i = 0; i < length - y2; i++) { for (int j = 0; j < y11; j++) printf( A ); for (int j = 0; j < y3; j++) printf( C ); printf( n ); } } else if (x3 == length) { printf( %d n , length); if (x1 != length - y3) { int temp = x1; x1 = y11; y11 = temp; } if (x2 != length - y3) { int temp = x2; x2 = y2; y2 = temp; } for (int i = 0; i < y3; i++) { for (int j = 0; j < x3; j++) printf( C ); printf( n ); } for (int i = 0; i < length - y3; i++) { for (int j = 0; j < y11; j++) printf( A ); for (int j = 0; j < y2; j++) printf( B ); printf( n ); } } else { printf( -1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e3; bool possible, check[N << 2], mark[N << 2]; vector<int> topol, from[N << 2], to[N << 2]; int n, m, c, d[N], com[N << 2], row[N], col[N], a[N][N], b[N][N]; void dfs_scc(int u, int c) { com[u] = c; mark[u] = true; for (auto v : to[u]) if (!mark[v]) dfs_scc(v, c); } void strongly_connected_components() { memset(mark, false, sizeof mark); for (int i = 0; i < n << 2; i++) if (check[i] && !mark[i]) dfs_scc(i, ++c); } void dfs_topolo(int u) { mark[u] = true; for (auto v : from[u]) if (!mark[v]) dfs_topolo(v); topol.push_back(u); } void topological_sort() { for (int i = 0; i < n << 2; i++) if (check[i] && !mark[i]) dfs_topolo(i); reverse(topol.begin(), topol.end()); } void input(int w) { for (int i = 0; i < n; i++) { string s; cin >> s; for (int j = 0; j < n; j++) (w ? a[i][j] : b[i][j]) = s[j] - 0 ; } } void add_edge(int u, int v) { check[u] = check[v] = true; from[u].push_back(v); from[v].push_back(u); to[u].push_back(v); to[v].push_back(u); } void add_clause(int u, int v) { add_edge(u ^ 1, v); add_edge(u, v ^ 1); } void F2(int u, int v) { int k = a[u][v] + b[u][v]; if (k == 1) (d[v] & 1 ? row[u] : col[v]) = 1; } void F1(int u, int v, int k) { k += a[u][v] + b[u][v]; if (k == 3) { add_clause(u << 1, (v + n) << 1); return; } if (k == 1) { cout << -1; exit(0); } if (k == 4 || (!a[u][v] && k == 2)) { add_clause(u << 1 ^ 1, (v + n) << 1); return; } } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; input(1), input(0); string s; cin >> s; for (int i = 0; i < n; i++) d[i] = s[i] - 0 ; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) d[i] == d[j] ? F1(i, j, d[i] + d[j]) : F2(i, j); topological_sort(); strongly_connected_components(); for (int i = 0; i < n << 1; i++) if (check[i << 1] && com[i << 1] == com[i << 1 ^ 1]) { cout << -1; return 0; } else if (check[i << 1] && com[i << 1] < com[i << 1 ^ 1]) i >= n ? col[i - n] = 1 : row[i] = true; int cnt = 0; for (int i = 0; i < n; i++) cnt += row[i] + col[i]; cout << cnt << endl; for (int i = 0; i < n; i++) if (row[i]) cout << row << i << endl; for (int i = 0; i < n; i++) if (col[i]) cout << col << i << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); int index1 = 0; int index2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) index1 = i + 1; else if (a[i] == n) index2 = i + 1; } int ans = max(max(max(index2 - 1, n - index2), index1 - 1), n - index1); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; double eps(1e-10); int sign(const double& x) { return (x > eps) - (x + eps < 0); } bool equal(const double& x, const double& y) { return x + eps > y && y + eps > x; } struct Point { double x, y, z; Point() {} Point(const double& x, const double& y, const double& z) : x(x), y(y), z(z) {} void print() const { printf( %f%f%f n , x, y, z); } void scan() { scanf( %lf%lf%lf , &x, &y, &z); } double sqrlen() const { return x * x + y * y + z * z; } double len() const { return sqrt(max(0., sqrlen())); } bool operator<(const Point& b) const { if (!equal(x, b.x)) { return x < b.x; } if (!equal(y, b.y)) { return y < b.y; } if (!equal(z, b.z)) { return z < b.z; } return false; } double dirlen() const { return len() * ((*this) < Point(0, 0, 0) ? -1 : 1); } Point operator+(const Point& b) const { return Point(x + b.x, y + b.y, z + b.z); } Point operator-(const Point& b) const { return Point(x - b.x, y - b.y, z - b.z); } double operator%(const Point& b) const { return x * b.x + y * b.y + z * b.z; } Point operator*(const Point& b) const { return Point(y * b.z - z * b.y, z * b.x - x * b.z, x * b.y - y * b.x); } Point zoom(const double& l) const { double lambda(l / len()); return Point(lambda * x, lambda * y, lambda * z); } }; inline Point operator*(const double& x, const Point& a) { return Point(x * a.x, x * a.y, x * a.z); } struct Plane { Point o, norm; }; struct Line { Point s, d; Line(const Point& s, const Point& d) : s(s), d(d) {} }; Point intersection(const Line& a, const Line& b) { double lambda(((b.s - a.s) * b.d).dirlen() / (a.d * b.d).dirlen()); return a.s + lambda * a.d; } vector<pair<Point, pair<int, int>>> evts; void calc(const vector<Point>& points, const vector<Point>& q) { Plane p1, p2; p1.o = points[0]; p2.o = q[0]; p1.norm = (points[0] - points[1]) * (points[2] - points[0]); p2.norm = (q[0] - q[1]) * (q[2] - q[0]); p1.norm = p1.norm.zoom(1); p2.norm = p2.norm.zoom(1); if (sign((p1.norm * p2.norm).len()) == 0) { return; } Point d(p1.norm * p2.norm); Point g(d * p1.norm); d = d.zoom(1); g = g.zoom(1); Line l(p1.o + (p2.o - p1.o) % p2.norm / (g % p2.norm) * g, d); static vector<pair<Point, pair<int, int>>> vec; vec.clear(); for (int i(0); i < (int)points.size(); i++) { Point a(points[i]), b(points[(i + 1) % (int)points.size()]); int da(sign((a - l.s) % g)), db(sign((b - l.s) % g)); if (da == db) { } else { Point crs(intersection(Line(a, b - a), l)); if (da != 0 && db != 0) { evts.push_back(make_pair(crs, make_pair(da, 0))); } else { vec.push_back(make_pair(crs, make_pair(da, db))); } } } for (int i(0); i < (int)vec.size(); i++) { if (vec[i].second.second == 0) { if (vec[i].second.first != vec[(i + 1) % (int)vec.size()].second.second) { evts.push_back( make_pair(vec[i].first, make_pair(vec[i].second.first, 0))); } } } } vector<Point> vec[2]; int main() { for (int d(0); d < 2; d++) { int n; scanf( %d , &n); for (int i(0); i < n; i++) { Point p; p.scan(); vec[d].push_back(p); } } calc(vec[0], vec[1]); for (auto& evt : evts) { evt.second.second = 1; } calc(vec[1], vec[0]); sort(evts.begin(), evts.end()); int ans(0); int cur(0); for (auto evt : evts) { if (evt.second.second == 1) { cur += evt.second.first; } else { if (cur != 0) { ans += evt.second.first; } } } printf( %s n , ans != 0 ? YES : NO ); } |
#include <bits/stdc++.h> using namespace std; struct Node { int idx, sum; int left, right; } tree[3000000]; int cnt; long long sumVal; char ch[10]; void addNode(int cur, int def, int h, int val) { if (tree[cur].idx == def) { tree[cur].sum += val; return; } tree[cur].sum += val; if ((1 << (h)) & def) { if (tree[cur].right == 0) { tree[cur].right = ++cnt; tree[cnt].idx = tree[cur].idx * 2 + 1; tree[cnt].sum = 0; tree[cnt].left = tree[cnt].right = 0; } addNode(tree[cur].right, def, h - 1, val); } else { if (tree[cur].left == 0) { tree[cur].left = ++cnt; tree[cnt].idx = tree[cur].idx * 2; tree[cnt].sum = 0; tree[cnt].left = tree[cnt].right = 0; } addNode(tree[cur].left, def, h - 1, val); } } void decayNode(int cur, int h, int maxVal) { if (h == 0) { sumVal += max(maxVal, tree[cur].sum); return; } int u = tree[cur].left, v = tree[cur].right; if (tree[u].sum > tree[v].sum) { long long t = max(maxVal, tree[cur].sum - tree[v].sum); sumVal += (long long)(1 << (h - 1)) * t; maxVal = max(maxVal, tree[cur].sum - tree[u].sum); decayNode(u, h - 1, maxVal); } else { long long t = max(maxVal, tree[cur].sum - tree[u].sum); sumVal += (long long)(1 << (h - 1)) * t; maxVal = max(maxVal, tree[cur].sum - tree[v].sum); decayNode(v, h - 1, maxVal); } } int main(int argc, char** argv) { int n, m, k, e; scanf( %d%d , &n, &m); cnt = 1; tree[1].idx = 1; tree[1].sum = 0; tree[0].sum = 0; tree[1].left = tree[1].right = 0; for (int i = 1; i <= m; i++) { scanf( %s , ch); if (ch[0] == d ) { sumVal = 0; decayNode(1, n, 0); double ans = (double)sumVal / (double)(1 << (n)); printf( %.8lf n , ans); } else { scanf( %d%d , &k, &e); int h = 0, p = k / 2; while (p) { p /= 2; h += 1; } addNode(1, k, h - 1, e); } } return (EXIT_SUCCESS); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; char a[65]; void pre() { int j = 1; for (j = 1; j <= 10; j++) a[j - 1] = (char)(j - 1 + 48); for (int i = 0; i < 26; i++) a[j++] = (char)(i + 97); for (int i = 0; i < 26; i++) a[j++] = (char)(i + 65); a[10] = Z ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); pre(); int T; cin >> T; while (T--) { vector<int> val(65, 0); int r, c, k; cin >> r >> c >> k; string s[r], ans[r]; int R = 0; for (int i = 0; i < r; i++) { cin >> s[i]; for (int j = 0; j < s[i].size(); j++) { if (s[i][j] == R ) R++; ans[i] += . ; } } int x = R / k; R = R % k; for (int i = 0; i < k; i++) { val[i] = x; if (R) { R--; val[i]++; } } int gg = 0; for (int i = 0; i < r; i++) { if (i % 2 == 0) { for (int j = 0; j < c; j++) { ans[i][j] = a[gg]; if (s[i][j] == R ) { val[gg]--; if (!val[gg]) { gg++; } } if (gg >= k - 1) gg = k - 1; } } else { for (int j = c - 1; j >= 0; j--) { ans[i][j] = a[gg]; if (s[i][j] == R ) { val[gg]--; if (!val[gg]) { gg++; } } if (gg >= k - 1) gg = k - 1; } } } for (int i = 0; i < r; i++) cout << ans[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 4; const int M = 1e9 + 7; vector<pair<int, int> > g[N]; const int inf = 1e9 + 10; vector<int> dist(N, inf); void dijkstra(int source) { dist[source] = 0; set<pair<int, int> > s; s.insert({0, source}); while (!s.empty()) { auto x = *(s.begin()); s.erase(x); for (auto it : g[x.second]) if (dist[it.first] > max(dist[x.second], it.second)) { s.erase({dist[it.first], it.first}); dist[it.first] = max(dist[x.second], it.second); s.insert({dist[it.first], it.first}); } } } void solve() { int n, m, k; cin >> n >> m >> k; int x[k]; for (int i = 0; i < k; i++) cin >> x[i]; for (int i = 0; i < m; i++) { int u, v, w; cin >> u >> v >> w; if (u != v) { g[u].push_back({v, w}); g[v].push_back({u, w}); } } dijkstra(x[0]); int ans = 0; for (int i = 0; i < k; i++) ans = max(ans, dist[x[i]]); for (int i = 0; i < k; i++) cout << ans << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int to_reach(long long int number, long long int moves, long long int target) { if (target == 0) { return (number / moves); } else { long long int res = (target - number) / moves; return res; } } int main() { long long int n, m, xc, yc, dxi, dyi, step; cin >> n >> m; cin >> xc >> yc; long long int k, count = 0; cin >> k; for (int i = 0; i < k; i++) { cin >> dxi >> dyi; long long int toReachX, toReachY; if (dxi == 0) toReachX = 10000000000; else if (dxi > 0) toReachX = to_reach(xc, dxi, n); else toReachX = to_reach(1 - xc, dxi, 0); if (dyi == 0) toReachY = 10000000000; else if (dyi > 0) toReachY = to_reach(yc, dyi, m); else toReachY = to_reach(1 - yc, dyi, 0); long long int tomove = min(toReachX, toReachY); xc = xc + dxi * tomove, yc = yc + dyi * tomove; count += tomove; } cout << count << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) #pragma GCC target( avx ) const long long MOD = 1000000007; const long double PI = 3.1415926535898; const long long LIM = 100005; using namespace std; long long fpow(long long x, long long y) { long long temp; if (y == 0) return 1; temp = fpow(x, y / 2); if (y % 2 == 0) return temp * temp; else return x * temp * temp; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void sieve(long long n) { bool prime[5 * LIM]; memset(prime, true, sizeof(prime)); for (long long p = 2; p * p <= n; p++) if (prime[p] == true) for (long long i = p * p; i <= n; i += p) prime[i] = false; prime[1] = 0; } inline long long read() { long long p = 1, ans = 0; char ch = getchar(); while (ch < 48 || ch > 57) { if (ch == - ) p = -1; ch = getchar(); } while (ch >= 48 && ch <= 57) { ans = (ans << 3) + (ans << 1) + ch - 48; ch = getchar(); } return ans * p; } bool isPrime(long long n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } map<long long, long long> primeFactors(long long n) { map<long long, long long> make_pair; while (n % 2 == 0) { if (make_pair.count(2) == 1) make_pair[2]++; else make_pair.insert({2, 1}); n = n / 2; } for (long long i = 3; i <= sqrt(n); i = i + 2) { while (n % i == 0) { if (make_pair.count(i) == 1) make_pair[i]++; else make_pair.insert({i, 1}); n = n / i; } } if (n > 2) { if (make_pair.count(n) == 1) make_pair[n]++; else make_pair.insert({n, 1}); } return make_pair; } long long compare(string a, string b) { if (a.empty()) return 0; for (long long i = 0; i < a.length(); i++) { if (a[i] > b[i]) return 1; else if (a[i] < b[i]) return -1; } return 0; } bool isPalindrome(string str) { long long l = 0; long long h = str.length() - 1; while (h > l) { if (str[l++] != str[h--]) { return false; } } return true; } long long maxSum(vector<long long> a) { long long max_so_far = a[0]; long long curr_max = a[0]; for (long long i = 1; i < a.size(); i++) { curr_max = max(a[i], curr_max + a[i]); max_so_far = max(max_so_far, curr_max); } return max_so_far; } long long maxlength(vector<long long> a) { long long size = a.size(); long long max_so_far = INT_MIN, max_ending_here = 0, start = 0, end = 0, s = 0; for (long long i = 0; i < size; i++) { max_ending_here += a[i]; if (max_so_far < max_ending_here) { max_so_far = max_ending_here; start = s; end = i; } if (max_ending_here <= 0) { max_ending_here = 0; s = i + 1; } } return (end - start + 1); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; for (long long tt = 1; tt <= t; ++tt) { long long n, r, p, s, cnt = 0; cin >> n >> r >> p >> s; string str; cin >> str; vector<char> ans(n, A ); for (long long i = 0; i < str.length(); i++) { if (str[i] == R && p > 0) { ans[i] = P ; cnt++; p--; } if (str[i] == P && s > 0) { ans[i] = S ; cnt++; s--; } if (str[i] == S && r > 0) { ans[i] = R ; cnt++; r--; } } if (cnt < ceil(n / 2.0)) cout << NO << n ; else { cout << YES << n ; for (long long i = 0; i < n; i++) { if (ans[i] == A ) { if (p > 0) { ans[i] = P ; p--; } else if (r > 0) { ans[i] = R ; r--; } else if (s > 0) { ans[i] = S ; s--; } } cout << ans[i]; } cout << n ; } } return 0; } |
#include<iostream> using namespace std; int main() { int t; cin>>t; while(t--){ int a,b; cin>>a>>b; if(a==0&&b==0) cout<< 0 n ; else if(a==0&&b!=0) cout<<2*b-1<<endl; else if(a!=0&&b==0) cout<<2*a-1<<endl; else{ if(a>b){ int x=(2*b)+(2*(a-b)-1); cout<<x<<endl; } else if(a<b){ int x=(2*a)+(2*(b-a)-1); cout<<x<<endl; } else if(a==b) cout<<2*a<<endl; } } } |
#include <bits/stdc++.h> using namespace std; bool comp(const vector<int> &l, const vector<int> &r) { if (l[0] % 2 && r[0] % 2) { return l[1] < r[1]; } if ((l[0] % 2) && (r[0] % 2 == 0)) return true; if ((l[0] % 2 == 0) && (r[0] % 2)) return false; else return true; } int main() { int tmp, ans, test, c, i, j, n, k, t, odd, ans1 = 0, ans2 = 0; vector<int> ar[102], v; scanf( %d , &test); for (int i = 1; i <= test; i++) { scanf( %d , &n); ar[i].push_back(n); if (n % 2 == 0) { ans = 0; for (k = 1; k <= n / 2; k++) { scanf( %d , &t); ans += t; } ar[i].push_back(ans); ans = 0; for (k = 1; k <= n / 2; k++) { scanf( %d , &t); ans += t; } ar[i].push_back(ans); ar[i].push_back(-1); } else { ans = 0; for (k = 1; k <= n / 2; k++) { scanf( %d , &t); ans += t; } ar[i].push_back(ans); scanf( %d , &odd); ans = 0; for (k = 1; k <= n / 2; k++) { scanf( %d , &t); ans += t; } ar[i].push_back(ans); ar[i].push_back(odd); v.push_back(odd); } } for (i = 1; i <= test; i++) { if (1 || ar[i][0] % 2 == 0) { ans1 += ar[i][1]; ans2 += ar[i][2]; } } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); bool ok = true; for (i = 0; i < v.size(); i++) { if (ok) ans1 += v[i]; else ans2 += v[i]; ok = !ok; } cout << ans1 << << ans2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const int N = 105; const int M = 5005; long long dp[N][M]; int x[N]; int y[N]; long long c[M][N]; int sum[N]; int rSum[N]; int h[N]; int main() { int n, i, j, k, l; long long ans = 0; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &x[i]); } for (i = 1; i <= n; i++) { scanf( %d , &y[i]); } for (i = 0; i < M; i++) { c[i][0] = 1; if (i <= 100) { c[i][i] = 1; } for (j = 1; j < min(i, N); j++) { c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD; } } for (i = 1; i <= n; i++) { sum[i] = sum[i - 1] + x[i]; } for (i = n; i >= 1; i--) { rSum[i] = rSum[i + 1] + y[i] - x[i]; } for (i = 1; i <= n; i++) { h[i] = x[i] + min(sum[i - 1], rSum[i]); } for (j = x[n]; j <= y[n]; j++) { dp[n][j] = 1; } for (i = n - 1; i >= 1; i--) { for (j = x[i]; j <= h[i]; j++) { for (k = 0; k <= min(y[i], j); k++) { dp[i][j] = (dp[i][j] + c[j][k] * dp[i + 1][x[i + 1] + j - k]) % MOD; } } } ans = dp[1][x[1]]; int num = sum[n]; for (i = 1; i <= n; i++) { ans = (ans * c[num][x[i]]) % MOD; num -= x[i]; } printf( %d n , (int)ans); } |
#include <bits/stdc++.h> using namespace std; long long dp[1005][1005], sum[1005][1005], c[2 * 1005][2 * 1005]; long long res[55][1005], p[55]; int main() { dp[0][0] = 1; for (int i = 0; i < 1005; i++) sum[0][i] = 1; for (int i = 1; i <= 51; i++) { for (int j = 1005 - 1; j >= 1; j--) { for (int k = 1005 - 1; k >= 1; k--) { if ((j >= k && i == 1) || j > k) dp[j][k] = sum[j - k][k - 1]; else dp[j][k] = 0; sum[j][k] = dp[j][k]; } for (int k = 1; k < 1005; k++) sum[j][k] = (sum[j][k] + sum[j][k - 1]) % 1000000007; res[i][j] = sum[j][1005 - 1]; } sum[0][0] = dp[0][0] = 0; } c[0][0] = c[1][1] = 1; for (int i = 2; i < 2 * 1005; i++) for (int j = 1; j <= i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007; p[0] = 1; for (int i = 1; i < 55; i++) p[i] = (p[i - 1] * i) % 1000000007; for (int i = 0; i <= 51; i++) for (int j = 1; j < 1005; j++) res[i][j] = (res[i][j - 1] + (res[i][j] * p[i]) % 1000000007) % 1000000007; int t; scanf( %d , &t); while (t--) { int n, k; scanf( %d %d , &n, &k); if (k > 51) printf( 0 n ); else { long long ans = 0; for (int i = k; i <= n; i++) ans = (ans + (res[k][i] * c[n - i + k][k]) % 1000000007) % 1000000007; printf( %I64d n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int *s; int fenzhi(int left, int right, int d) { int mins = 0x3f3f3f3f; ; for (int i = left; i <= right; i++) mins = min(mins, s[i] - d); int ans = 0; for (int i = left; i <= right; i++) if (s[i] > mins + d) { int j = i; while (s[j + 1] > mins + d && j + 1 <= right) j++; ans += fenzhi(i, j, mins + d); i = j + 1; } return min(right - left + 1, mins + ans); } int main() { int n; cin >> n; s = new int[n]; for (int i = 0; i < n; i++) cin >> s[i]; cout << fenzhi(0, n - 1, 0) << endl; delete[] s; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a; cin >> a; for (int i = 0; i < a.length(); i++) { if (isupper(a[i])) a[i] = tolower(a[i]); } string s = ; for (int i = 0; i < a.length(); i++) { if (a[i] == a || a[i] == o || a[i] == u || a[i] == e || a[i] == i || a[i] == y ) continue; s += . ; s += a[i]; } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[112], dp[312][312], mnix[312]; int **func(int **mat1, int **mat2, int mx) { int **ans; ans = new int *[mx + 2]; for (int i = 1; i <= mx; i++) { ans[i] = new int[mx + 2]; for (int j = 1; j <= mx; j++) { ans[i][j] = 0; for (int k = i; k <= j; k++) ans[i][j] = max(ans[i][j], mat1[i][k] + mat2[k][j]); } } return ans; } int main() { int n, k, mx = 0; cin >> n >> k; for (int i = 0; i < 312; i++) { mnix[i] = 500; for (int j = 0; j < 312; j++) { dp[i][j] = 0; } } for (int i = 0; i < n; i++) { scanf( %d , &a[i]); mx = max(mx, a[i]); mnix[a[i]] = min(mnix[a[i]], i); } int **mat; mat = new int *[312]; for (int i = 0; i < 312; i++) { mat[i] = new int[312]; for (int j = 0; j < 312; j++) mat[i][j] = 0; } for (int st = 1; st <= mx; st++) { if (mnix[st] > 200) continue; for (int j = 1; j <= mx; j++) { if (j >= st) dp[mnix[st]][j] = 1; else dp[mnix[st]][j] = 0; } for (int i = mnix[st] + 1; i < n; i++) { for (int j = 1; j <= mx; j++) { if (a[i] < st) dp[i][j] = dp[i - 1][j]; else if (j < a[i]) dp[i][j] = dp[i - 1][j]; else if (j == a[i]) dp[i][j] = dp[i - 1][j] + 1; else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); } } for (int j = 1; j <= mx; j++) { if (j < st) mat[st][j] = 0; mat[st][j] = dp[n - 1][j]; } for (int i = 0; i <= mx; i++) { for (int j = 0; j <= mx; j++) { dp[i][j] = 0; } } } int **ans; ans = new int *[mx + 2]; for (int i = 0; i <= mx; i++) { ans[i] = new int[mx + 2]; for (int j = 0; j <= mx; j++) ans[i][j] = 0; } while (k) { if (k % 2 == 1) ans = func(ans, mat, mx); mat = func(mat, mat, mx); k = k / 2; } int fans = 0; for (int j = 1; j <= mx; j++) fans = max(fans, ans[j][mx]); cout << fans << endl; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<long long> v(n + 1); long long s = 0; for (long long i = 1; i <= n; i++) { cin >> v[i]; s += v[i] - i, v[i] = i; } for (long long i = 1; i <= n; i++) v[i] += s / n; for (long long i = 1; i <= s % n; i++) v[i]++; for (long long i = 1; i <= n; i++) cout << v[i] << n [i == n]; } signed main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); long long t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> q; long long i, j, n, k, m = 1000000007, ww = 1, a[20005], b[20005], c[20005], w[20005]; bool flag; bool otv(int n, bool sign) { long long t = n; for (long long j = 0; j < q.size(); j++) { if (t % q[j] == 0) { t /= q[j]; if (sign) w[j]++; else w[j]--; j--; } if (t == 1) break; } if (t > 1) ww = (ww * t) % m; return 0; } long long ans() { long long i, j, first = 1; for (i = 0; i < q.size(); i++) for (j = 0; j < w[i]; j++) first = (first * q[i]) % m; first = (ww * first) % m; return first; } int main() { cin >> n >> k; for (i = 1; i <= n; i++) cin >> a[i]; if (k == 0) { for (i = 1; i <= n; i++) cout << a[i] << ; return 0; } for (i = 2; i <= 30000; i++) { flag = 0; for (j = 0; j < q.size(); j++) if (i % q[j] == 0) { flag = 1; break; } if (!flag) q.push_back(i); } b[1] = 1; k--; for (i = 2; i <= n; i++) { otv(i + k - 1, 1); otv(i - 1, 0); b[i] = ans(); } for (i = 1; i <= n; i++) for (j = 0; j < i; j++) c[i] = ((a[i - j] * b[j + 1]) % m + c[i]) % m; for (i = 1; i <= n; i++) cout << c[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct circle { long double x, y, r; }; struct mod { long double theta, op; }; struct node { long double x, y, theta; }; int n, d, i, j, tot, S, ans, gg; circle c[20005]; mod l[2000005]; node A, B; long double D, k, t, L, R, dis1, dis2, dis3; void getAB() { long double x = c[i].x, y = c[i].y, r = c[i].r, delta; if (x == 0) { t = (r * r - x * x - y * y - D * D) / (-2 * y); k = -x / y; delta = (2 * t * k) * (2 * t * k) - 4 * (k * k + 1) * (t * t - D * D); if (delta < 0) { A.x = A.y = 0; return; } A.x = (-(2 * t * k) + sqrt(delta)) / (2 * (k * k + 1)); B.x = (-(2 * t * k) - sqrt(delta)) / (2 * (k * k + 1)); A.y = (r * r - x * x - y * y - D * D + 2 * x * A.x) / (-2 * y); B.y = (r * r - x * x - y * y - D * D + 2 * x * B.x) / (-2 * y); } else { t = (r * r - x * x - y * y - D * D) / (-2 * x); k = -y / x; delta = (2 * t * k) * (2 * t * k) - 4 * (k * k + 1) * (t * t - D * D); if (delta < 0) { A.x = A.y = 0; return; } A.y = (-(2 * t * k) + sqrt(delta)) / (2 * (k * k + 1)); B.y = (-(2 * t * k) - sqrt(delta)) / (2 * (k * k + 1)); A.x = (r * r - x * x - y * y - D * D + 2 * y * A.y) / (-2 * x); B.x = (r * r - x * x - y * y - D * D + 2 * y * B.y) / (-2 * x); } } void insert(long double L, long double R) { tot++; l[tot].theta = L; l[tot].op = 1; tot++; l[tot].theta = R + 0.0000000001; l[tot].op = -1; } int comp(mod A, mod B) { return ((A.theta < B.theta) || ((A.theta == B.theta) && (A.op < B.op))); } int main() { scanf( %d%d , &n, &d); for (i = 1; i <= n; i++) { scanf( %Lf%Lf%Lf , &c[i].x, &c[i].y, &c[i].r); } for (i = 1; i <= n; i++) { gg = sqrt(c[i].x * c[i].x + c[i].y * c[i].y) / d; for (D = (long double)max(gg - 100, 1) * (long double)d; D <= (long double)(gg + 100) * (long double)d; D += (long double)d) { getAB(); if ((A.x == 0) && (A.y == 0)) continue; A.theta = atan2(A.x, A.y); B.theta = atan2(B.x, B.y); if (A.theta > B.theta) swap(A, B); L = A.theta; R = B.theta; if (R - L > 3.1415926535) swap(L, R); if (L <= R) insert(L, R); else insert(-3.1415926535, R), insert(L, 3.1415926535); } } sort(l + 1, l + 1 + tot, comp); for (i = 1; i <= tot; i++) { S += l[i].op; ans = max(ans, S); } printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a; for (int i = (0); i < (n); i++) { int t; cin >> t; a.push_back(t); } vector<int> b; for (int i = (0); i < (n); i++) { int t; cin >> t; b.push_back(t); } sort(a.begin(), a.end(), greater<int>()); sort(b.begin(), b.end(), greater<int>()); long long r = 0; long long r1 = 0; int i = 0; int j = 0; int nn = 2 * n; int s = 1; while (nn--) { if (s == 1) { if (i < n && j < n) { if (a[i] > b[j]) { r += a[i]; i++; } else { j++; } } else if (j < n) { j++; } else if (i < n) { r += a[i]; i++; } } else { if (i < n && j < n) { if (b[j] > a[i]) { r1 += b[j]; j++; } else { i++; } } else if (j < n) { r1 += b[j]; j++; } else if (i < n) { i++; } } s ^= 1; } cout << r - r1 << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.