func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const int inf = 1000000009; int i, j, k, l, m, n, q; int ans; int a[4][1000][1000], h[4][1000][1000], W[4], H[4]; void prec(int k, int i) { for (int j = 0; j < H[k]; j++) { if (h[k][i][j] == 0) a[k][i][j] = 0; else { a[k][i][j] = 1; if (j > 0) a[k][i][j] += a[k][i][j - 1]; } } } void fl(int k, int i, int j) { h[k][i][j] ^= 1; prec(k, i); } int best(int k, int i, int j) { int ret = 0; int i1 = i - 1, i2 = i + 1, y = a[k][i][j]; while (y > 0) { while (i1 >= 0 && a[k][i1][j] >= y) i1--; while (i2 < W[k] && a[k][i2][j] >= y) i2++; ret = max(ret, (i2 - i1 - 1) * y); y--; } return ret; } int main() { scanf( %d%d%d , &m, &n, &q); W[0] = W[2] = H[1] = H[3] = m; H[0] = H[2] = W[1] = W[3] = n; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { scanf( %d , &h[0][i][j]); h[1][j][m - i - 1] = h[0][i][j]; h[2][m - i - 1][n - j - 1] = h[0][i][j]; h[3][n - j - 1][i] = h[0][i][j]; } for (int k = 0; k < 4; k++) for (int i = 0; i < W[k]; i++) prec(k, i); while (q--) { int op; scanf( %d%d%d , &op, &i, &j); i--; j--; if (op == 1) { fl(0, i, j); fl(1, j, m - i - 1); fl(2, m - i - 1, n - j - 1); fl(3, n - j - 1, i); } else { int ans = max(max(best(0, i, j), best(1, j, m - i - 1)), max(best(2, m - i - 1, n - j - 1), best(3, n - j - 1, i))); cout << ans << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N; string s; string result; int main() { cin >> N; cin >> s; result = s; result[(N - 1) / 2] = s[0]; int sign = N % 2 == 0 ? 1 : -1; int val = 1; int start = (N - 1) / 2; for (int i = 1; i < N; ++i, sign *= -1, val++) start = start + val * sign, result[start] = s[i]; cout << result; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 5; struct edge { int u, v, id; edge(int a = 0, int b = 0, int c = 0) { u = a, v = b, id = c; } }; vector<edge> S, M, E; struct dsu { int par[N]; vector<edge> ed; dsu() { memset(par, -1, sizeof par); } int get_par(int u) { return ~par[u] ? par[u] = get_par(par[u]) : u; } bool merge(edge e) { if (get_par(e.u) == get_par(e.v)) return false; par[get_par(e.u)] = get_par(e.v), ed.push_back(e); return true; } int size() { return ed.size(); } } A, B, C; int n, m; void notValid() { cout << -1 n , exit(0); } void readInput() { cin >> n >> m; for (int i = 0; i < m; i++) { char c; int u, v; cin >> u >> v >> c; u--, v--; if (c == S ) S.push_back(edge(u, v, i)); else M.push_back(edge(u, v, i)); } } void solve() { for (auto e : S) C.merge(e); if (n & 1 ^ 1 || C.size() < n >> 1) notValid(); for (auto e : M) if (C.merge(e)) A.merge(e); if (C.size() != n - 1) notValid(); for (auto e : M) if (A.size() < n >> 1) A.merge(e); if (A.size() != n >> 1) notValid(); E = A.ed; for (auto e : S) if (A.merge(e)) B.merge(e); E.insert(E.end(), B.ed.begin(), B.ed.end()); } void writeOutput() { cout << n - 1 << endl; for (auto e : E) cout << e.id + 1 << ; } int main() { ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0); readInput(), solve(), writeOutput(); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll inf = 1e9 + 10; const ll inf_ll = 1e18 + 10; ll qry(ll t, ll i, ll j, ll k) { cout << t << << i << << j << << k << endl; ll r; cin >> r; return r; } int main() { ll n; cin >> n; ll b = 2; for (ll i = 2; i <= n; i++) if (i != b && qry(2, 1, i, b) > 0) b = i; vector<ll> h(n + 5), ord(n - 2), l, r; for (ll i = 2; i <= n; i++) if (i != b) h[i] = qry(1, 1, i, b); iota((ord).begin(), (ord).end(), 3); for (ll& i : ord) if (i == b) i = 2; sort((ord).begin(), (ord).end(), [&](ll i, ll j) { return h[i] < h[j]; }); ll c = ord.back(); for (ll i : ord) { if (i != c && qry(2, 1, c, i) > 0) l.push_back(i); else r.push_back(i); } cout << 0 1 << b; for (ll i : r) cout << << i; reverse((l).begin(), (l).end()); for (ll i : l) cout << << i; cout << endl; }
|
#include <bits/stdc++.h> int main() { int n; int x; int sum = 0; std::cin >> n; std::cin >> x; unsigned int t1 = 0, t2 = 0, tcurr = 1; for (int i = 0; i < n; i++) { std::cin >> t1; std::cin >> t2; sum += (t1 - tcurr) % x + t2 - t1 + 1; tcurr = t2 + 1; } std::cout << sum; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> A; vector<int> d; vector<int> P; vector<int> g; vector<vector<int>> G; int bestu, bestv, bestw, bestvv; void dfs(int x, int v, int n) { for (int i = 0; i < G[x].size(); ++i) { int y = G[x][i]; int u = g[y]; if (u >= 0) { if (d[u] < 0) { d[u] = v; P[u] = y; P[y] = x; dfs(u, v, n); } } else if (A[y] + A[v] > bestw) { bestw = A[y] + A[v]; bestu = x; bestv = y; bestvv = v; } } } bool cmp(int a, int b) { return A[a] > A[b]; } void solve() { int n, k; scanf( %d%d , &n, &k); vector<int> a(1 << n); for (int i = 0; i < a.size(); ++i) scanf( %d , &a[i]); vector<array<int, 3>> edges; { vector<int> bc(1 << n); for (int i = 1; i < bc.size(); ++i) bc[i] = bc[i & (i - 1)] + 1; array<int, 3> e; for (int i = 0; i < bc.size(); ++i) { if (bc[i] % 2 == 0) for (int j = 0; j < n; ++j) { e[0] = -(a[i] + a[i ^ (1 << j)]); e[1] = i; e[2] = i ^ (1 << j); edges.push_back(e); } } } int edges_cnt = min(2 * n * k + 1, (int)edges.size()); nth_element(edges.begin(), edges.begin() + edges_cnt, edges.end()); vector<int> idx(1 << n, -1); int vert = 0; for (int i = 0; i < edges_cnt; ++i) if (idx[edges[i][1]] < 0) { A.push_back(a[edges[i][1]]); idx[edges[i][1]] = vert; ++vert; } G.resize(vert); int vert2 = vert; for (int i = 0; i < edges_cnt; ++i) { if (idx[edges[i][2]] < 0) { A.push_back(a[edges[i][2]]); idx[edges[i][2]] = vert2; ++vert2; } G[idx[edges[i][1]]].push_back(idx[edges[i][2]]); } vector<int> idx1(vert); for (int i = 0; i < vert; ++i) idx1[i] = i; sort(idx1.begin(), idx1.end(), cmp); vector<char> was(vert); g.assign(vert2, -1); P.resize(vert2); int res = 0; for (int i = 0; i < k; ++i) { d.assign(vert, -1); bestw = -1; for (int j = 0; j < vert; ++j) { int x = idx1[j]; if (!was[x] && d[x] < 0) { P[x] = -1; d[x] = x; dfs(x, x, n); } } if (bestw >= 0) { res += bestw; g[bestv] = bestu; was[bestvv] = 1; for (int x = P[bestu]; x >= 0;) { int y = P[x]; g[x] = y; x = P[y]; } } else break; } printf( %d n , res); } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:300000000 ) #pragma warning(disable : 4800) using namespace std; const double pi = 3.1415926535897932384626433832795; template <class T> T abs(const T &a) { return a >= 0 ? a : -a; }; template <class T> T sqr(const T &x) { return x * x; } int n, m, k; vector<vector<int> > g; vector<bool> visited; vector<int> ans; vector<pair<int, int> > traders; pair<int, int> erased; bool isErased(int x, int y) { return pair<int, int>(x, y) == erased || pair<int, int>(y, x) == erased; } void dfs(int k) { if (visited[k]) return; visited[k] = true; for (int i = 0; i < (int((g[k]).size())); i++) { int to = g[k][i]; if (!isErased(k, to)) dfs(to); } } void work(int x, int y) { erased = pair<int, int>(x, y); visited.assign(n, false); dfs(x); for (int i = 0; i < (k); i++) if (visited[traders[i].first] && !visited[traders[i].second]) ans[i]++; } int main() { cin >> n >> m; g.resize(n); for (int i = 0; i < (m); i++) { int x, y; cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } cin >> k; ans.resize(k); traders.resize(k); for (int i = 0; i < (k); i++) { cin >> traders[i].first >> traders[i].second; traders[i].first--; traders[i].second--; } for (int i = 0; i < (n); i++) for (int j = 0; j < (int((g[i]).size())); j++) work(i, g[i][j]); for (int i = 0; i < (k); i++) cout << ans[i] << endl; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; bool pos = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) pos = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return pos ? x : -x; } const int N = 1 << 18 | 2, M = N; const int mod = 998244353, G = 3; int sz[N], dep[N]; vector<int> v[N]; inline int ksm(int a, int b) { int ans = 1; for (; b; b >>= 1) { if (b & 1) ans = (long long)ans * a % mod; a = (long long)a * a % mod; } return ans; } struct ffter { int wn[N], rev[N]; void init(int n) { int t = 1, L = 0; while (t < n) { t <<= 1; L++; } int w = ksm(G, (mod - 1) / n); for (int i = wn[0] = 1; i < n; i++) { wn[i] = (long long)wn[i - 1] * w % mod; rev[i] = rev[i >> 1] >> 1 | ((i & 1) << (L - 1)); } } void zheng(vector<int> &a) { for (auto &i : a) i = (i + mod) % mod; } void dft(vector<int> &a) { int n = a.size(); zheng(a); for (int i = 0; i < n; i++) if (rev[i] < i) swap(a[rev[i]], a[i]); for (int i = 1; i < n; i <<= 1) { for (int j = 0; j < n; j += i << 1) { for (int k = j, l = 0; l < i; k++, l++) { long long t = (long long)wn[l * (n / (i << 1))] * a[k + i] % mod; a[k + i] = (a[k] < t) ? a[k] - t + mod : a[k] - t; a[k] = a[k] + t >= mod ? a[k] + t - mod : a[k] + t; } } } } void idft(vector<int> &a) { int n = a.size(); dft(a); reverse(a.begin() + 1, a.end()); int zs = ksm(n, mod - 2); for (auto &i : a) i = (long long)i * zs % mod; } } T; void FFT(vector<int> &a, vector<int> &b) { int n = a.size() + b.size() - 1; int len = 1; while (len < n) len <<= 1; T.init(len); a.resize(len); b.resize(len); T.dft(a); T.dft(b); for (int i = 0; i < len; i++) a[i] = (long long)a[i] * b[i] % mod; T.idft(a); a.resize(n); } int n, son[N]; vector<int> tr[M], Tr[M], dp[N], f[N]; void solve(int p); void zy(vector<int> &a, int len) { a.resize(a.size() + len); for (int i = a.size() - 1; i >= len; i--) a[i] = a[i - len]; for (int i = 0; i < len; i++) a[i] = 0; } void bao(int p, int son) { for (auto i : v[p]) if (dep[i] > dep[p] && i != son) solve(i); } vector<int> get(int p, int son) { priority_queue<pair<int, vector<int> > > q; while (q.size()) q.pop(); for (auto i : v[p]) if (dep[i] > dep[p] && i != son) { q.push(make_pair(-dp[i].size(), dp[i])); } if (q.size() == 0) { vector<int> jb(1); jb[0] = 1; return jb; } while (q.size() > 1) { vector<int> a = q.top().second; q.pop(); vector<int> b = q.top().second; q.pop(); FFT(a, b); q.push(make_pair(-a.size(), a)); } vector<int> jb = q.top().second; q.pop(); return jb; } vector<int> operator+(vector<int> a, vector<int> b) { if (a.size() < b.size()) swap(a, b); for (unsigned i = 0; i < b.size(); i++) a[i] = (a[i] + b[i]) % mod; return a; } int TOT; void bao(int l, int r, int nod) { if (l == r) { tr[nod] = f[l]; if (r == TOT) { Tr[nod] = tr[nod]; zy(Tr[nod], 1); } else Tr[nod].resize(1); Tr[nod][0] = 1; return; } int mid = (l + r) >> 1; bao(l, mid, nod << 1); bao(mid + 1, r, nod << 1 | 1); tr[nod] = tr[nod << 1]; FFT(tr[nod], tr[nod << 1 | 1]); FFT(Tr[nod << 1 | 1], tr[nod << 1]); zy(Tr[nod << 1 | 1], mid - l + 1); Tr[nod] = Tr[nod << 1] + Tr[nod << 1 | 1]; } void solve(int p) { int tot = 0, jb = 0; for (int i = p; i; i = son[i]) bao(i, son[i]); for (int i = p; i; i = son[i]) { f[++tot] = get(i, son[i]); } for (int i = 1; i <= tot; i++) jb += f[i].size(); TOT = tot; bao(1, tot, 1); dp[p] = Tr[1]; } void init(int p, int fa) { sz[p] = 1; dep[p] = dep[fa] + 1; for (auto i : v[p]) if (i != fa) { init(i, p); sz[p] += sz[i]; if (sz[i] > sz[son[p]]) son[p] = i; } } int main() { n = read(); int x = read() % mod; for (int i = 1; i < n; i++) { int x = read(), y = read(); v[x].push_back(y); v[y].push_back(x); } init(1, 0); solve(1); vector<int> ans = dp[1]; ans[0]--; int dq = 1, Ans = 0; for (int i = 1; i <= n; i++) { if (i > 1) dq = (long long)dq * (i + x - 1) % mod * ksm(i - 1, mod - 2) % mod; Ans = (Ans + (long long)dq * ans[i]) % mod; } cout << (Ans + mod) % mod << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long MAX_N = 3e5 + 7; const long long MOD = 998244353; long long n; long long deg[MAX_N], fac[MAX_N]; long long f_pow(long long base, long long b, long long mod) { long long res = 1; while (b) { if (b & 1) res = res * base % mod; base = base * base % mod; b >>= 1; } return res; } namespace NTT { const long long MAX_N = 3e6 + 7; const long long MOD = 998244353; const long long G = 3; long long rev[MAX_N]; long long f[MAX_N], g[MAX_N]; long long n, m; vector<vector<long long>> p; struct Poly { long long n; vector<long long> p; Poly(vector<long long> _p = {}, long long _n = 0) : n(_n) { n = _p.size(); p.resize(n); for (long long i = 0; i < n; ++i) p[i] = _p[i]; } bool operator<(const Poly &a) const { return n > a.n; } }; void ntt(long long *a, long long n, long long dft) { for (long long i = 0; i < n; i++) { if (i < rev[i]) swap(a[i], a[rev[i]]); } for (long long i = 1; i < n; i <<= 1) { long long wn = f_pow(G, (MOD - 1) / (i << 1), MOD); if (dft < 0) wn = f_pow(wn, MOD - 2, MOD); for (long long j = 0; j < n; j += (i << 1)) { long long wnk = 1; for (long long k = j; k < j + i; k++) { long long a1 = a[k], a2 = a[k + i]; a[k] = (a1 + wnk * a2 % MOD) % MOD; a[k + i] = (a1 - wnk * a2 % MOD) % MOD; wnk = wnk * wn % MOD; } } } if (dft == -1) { long long inv = f_pow(n, MOD - 2, MOD); for (long long i = 0; i < n; i++) a[i] = a[i] * inv % MOD; } } vector<long long> merge(const vector<long long> &F, const vector<long long> &G) { n = F.size() - 1, m = G.size() - 1; long long N = 1, p = 0; while (N < (m + n + 1)) N <<= 1, ++p; for (long long i = 0; i < N; ++i) rev[i] = f[i] = g[i] = 0; for (long long i = 0; i < N; ++i) rev[i] = ((rev[i >> 1] >> 1) | ((i & 1) << (p - 1))); for (long long i = 0; i <= n; ++i) f[i] = F[i]; for (long long i = 0; i <= m; ++i) g[i] = G[i]; ntt(f, N, 1), ntt(g, N, 1); for (long long i = 0; i < N; ++i) f[i] = f[i] * g[i] % MOD; ntt(f, N, -1); vector<long long> res(m + n + 1); for (long long i = 0; i <= n + m; ++i) res[i] = (f[i] + MOD) % MOD; return res; } vector<long long> div_ntt(long long l, long long r) { if (l == r) return p[l]; long long mid = (l + r) >> 1; vector<long long> F = div_ntt(l, mid), G = div_ntt(mid + 1, r); return merge(F, G); } void merge(long long idx_f, long long idx_g) { vector<long long> &F = p[idx_f]; vector<long long> &G = p[idx_g]; n = F.size() - 1, m = G.size() - 1; long long N = 1, p = 0; while (N < (m + n + 1)) N <<= 1, p++; for (long long i = 0; i < N; ++i) rev[i] = f[i] = g[i] = 0; for (long long i = 0; i < N; i++) rev[i] = ((rev[i >> 1] >> 1) | ((i & 1) << (p - 1))); for (long long i = 0; i <= n; i++) f[i] = F[i]; for (long long i = 0; i <= m; i++) g[i] = G[i]; ntt(f, N, 1); ntt(g, N, 1); for (long long i = 0; i < N; i++) { f[i] = f[i] * g[i] % MOD; } ntt(f, N, -1); F.resize(m + n + 1); for (long long i = 0; i <= (n + m); ++i) F[i] = (f[i] + MOD) % MOD; } vector<long long> solve() { priority_queue<Poly> q; for (long long i = 0; i < p.size(); ++i) q.push(Poly(p[i])); while (q.size() > 1) { vector<long long> F = q.top().p; q.pop(); vector<long long> G = q.top().p; q.pop(); q.push(Poly(merge(F, G))); } return q.top().p; } vector<long long> solve(long long l, long long r) { return div_ntt(l, r); } } // namespace NTT signed main() { scanf( %lld , &n); for (long long i = 1; i < n; ++i) { long long x, y; scanf( %lld%lld , &x, &y); ++deg[x], ++deg[y]; } for (long long i = 2; i <= n; ++i) --deg[i]; for (long long i = 1; i <= n; ++i) { vector<long long> t; t.push_back(1ll); if (deg[i]) t.push_back(deg[i]); NTT::p.push_back(t); } vector<long long> F = NTT::solve(); long long ans = 0, flag = 1; fac[0] = 1; for (long long i = 1; i <= n; ++i) fac[i] = fac[i - 1] * i % MOD; for (long long i = 0; i < n && i < F.size(); ++i) { ans = (ans + flag * F[i] * fac[n - i] % MOD) % MOD; flag = -flag; } printf( %lld n , (ans + MOD) % MOD); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5, inf = 998244353; long long n, k, i; long long A[N], B[N]; long long in[N], f[N]; inline long long expo(long long n, long long k, long long p = inf) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } inline long long inv(long long a, long long p = inf) { return expo(a, p - 2, p); } vector<long long> BIT(N); void upd(long long first, long long val) { for (; first <= n; first += (first & -first)) BIT[first] += val; } long long q(long long first) { long long res = 0; for (; first > 0; first -= (first & -first)) res += BIT[first]; return res; } long long m[N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long i, j, first, second, ans = 0, c = 0, a; cin >> n; for (i = 1; i < n + 1; i++) { cin >> A[i]; if (A[i] != -1) { m[A[i]] = 1; ans += c - q(A[i] - 1); upd(A[i], 1); c++; } } vector<long long> v; for (i = 1; i < n + 1; i++) if (!m[i]) v.emplace_back(i); ans += 1LL * (long long)v.size() * ((long long)v.size() - 1) % inf * inv(4) % inf; long long t = 0; c = 0; for (i = 1; i < n + 1; i++) { if (A[i] != -1) { a = lower_bound(v.begin(), v.end(), A[i]) - v.begin(); ans += c * ((long long)v.size() - a) % inf * inv((long long)v.size()) % inf; ans += a * ((long long)v.size() - c) % inf * inv((long long)v.size()) % inf; } else c++; } cout << ans % inf; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 100 * 1000 + 10; int n, m, l[Maxn], ans1, ans2; long double a, b; pair<long double, int> arr[Maxn], brr[Maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> a >> b; for (int i = 0; i < n; i++) { cin >> arr[i].first; arr[i].second = i; } for (int i = 0; i < m; i++) { cin >> brr[i].first; brr[i].second = i; } for (int i = 0; i < m; i++) cin >> l[i]; sort(arr, arr + n); sort(brr, brr + m); int cup; long double Min = LLONG_MAX; for (int i = 0; i < m; i++) { long double p = (brr[i].first * a) / b; int ind = lower_bound(arr, arr + n, make_pair(p, -1)) - arr; long double c, dis; if (ind < n) { c = arr[ind].first, dis = sqrt(a * a + c * c) + sqrt((b - a) * (b - a) + (brr[i].first - c) * (brr[i].first - c)); cup = ind; } if (ind > 0) { ind--; c = arr[ind].first; if (sqrt(a * a + c * c) + sqrt((b - a) * (b - a) + (brr[i].first - c) * (brr[i].first - c)) < dis) { cup = ind; dis = sqrt(a * a + c * c) + sqrt((b - a) * (b - a) + (brr[i].first - c) * (brr[i].first - c)); } } if (dis + l[brr[i].second] < Min) { Min = dis + l[brr[i].second]; ans1 = arr[cup].second + 1, ans2 = brr[i].second + 1; } } cout << ans1 << << ans2 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; unsigned long long h[100010], bin[100010]; inline unsigned long long hsh(const int l, const int r) { return h[r] - h[l - 1] * bin[r - l + 1]; } inline int find(const int l1, const int r1, const int l2, const int r2) { int l = 0, r = r1 - l1 + 1; while (l < r) { const int mid = l + r + 1 >> 1; if (hsh(l1, l1 + mid - 1) == hsh(l2, l2 + mid - 1)) l = mid; else r = mid - 1; } return l + 1; } char s[100010]; int n, pre[100010][26], suf[100010][26], cnt[100010][26]; unordered_map<int, int> gy[100010]; long long det[26][100010], sum[100010]; int main() { scanf( %s , s + 1); n = strlen(s + 1); for (int i = bin[0] = 1; i <= n; i++) bin[i] = bin[i - 1] * 131, h[i] = h[i - 1] * 131 + s[i], s[i] -= a ; for (int i = 1; i <= n; i++) { for (int j = 0; j < 26; j++) pre[i][j] = pre[i - 1][j], cnt[i][j] = cnt[i - 1][j]; if (i != 1) pre[i][s[i - 1]] = i - 1; cnt[i][s[i]]++; } for (int i = 0; i < 26; i++) suf[n + 1][i] = n + 1; for (int i = n; i; i--) { for (int j = 0; j < 26; j++) suf[i][j] = suf[i + 1][j]; if (i != n) suf[i][s[i + 1]] = i + 1; } long long lst = 0; for (int i = 1; i <= n; i++) { const int L = min(i - pre[i][s[i]], suf[i][s[i]] - i); for (int j = 0; j < L; j = j << 1 | 1) if ((!j || gy[i - j].count(i - 1)) && hsh(i - j, i - 1) == hsh(i + 1, i + j)) { const long long tmp = 1ll * (j << 1 | 1) * (j << 1 | 1); lst += tmp, gy[i - j][i + j] = 1; sum[i - j] -= tmp; sum[i] += tmp; sum[i + 1] -= tmp; sum[i + j + 1] += tmp; } for (int ch = 0; ch < 26; ch++) { const int nL = min(i - pre[i][ch], suf[i][ch] - i); for (int j = 0; j <= min(i - 1, n - i); j = j << 1 | 1) if ((!j || gy[i - j].count(i - 1)) && hsh(i - j, i - 1) == hsh(i + 1, i + j)) if (j >= nL && j < L) det[ch][i] -= 1ll * (j << 1 | 1) * (j << 1 | 1); else if (j >= L && j < nL) det[ch][i] += 1ll * (j << 1 | 1) * (j << 1 | 1); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= min(i - 1, n - i); j = j << 1 | 1) if ((gy[i - j].count(i - 1) || gy[i + 1].count(i + j)) && hsh(i - j, i - 1) != hsh(i + 1, i + j)) { const int p = find(i - j, i - 1, i + 1, i + j); if (p <= j && hsh(i - j + p, i - 1) == hsh(i + 1 + p, i + j)) { if (gy[i - j].count(i - 1) && cnt[i + j][s[i]] - cnt[i - j - 1][s[i]] - (s[i + p] == s[i]) == 1) det[s[i - j + p - 1]][i + p] += 1ll * (j << 1 | 1) * (j << 1 | 1); if (gy[i + 1].count(i + j) && cnt[i + j][s[i]] - cnt[i - j - 1][s[i]] - (s[i - j + p - 1] == s[i]) == 1) det[s[i + p]][i - j + p - 1] += 1ll * (j << 1 | 1) * (j << 1 | 1); } } } long long ans = 0; for (int i = 1; i <= n; i++) sum[i] += sum[i - 1]; for (int i = 1; i <= n; i++) for (int j = 0; j < 26; j++) ans = max(ans, lst + det[j][i] + (j != s[i] ? sum[i] : 0)); cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 4e5 + 5; struct edge { int v, nx; } e[Maxn << 1]; int n, m, ne = 1, f[Maxn], dfn[Maxn], low[Maxn], scc[Maxn]; int rt, tot, cnt, top, st[Maxn]; int ans, cu[Maxn], cv[Maxn], nx[Maxn], ansu[Maxn], ansv[Maxn]; bool vis[Maxn]; void read(int u, int v) { e[++ne].v = v; e[ne].nx = f[u]; f[u] = ne; } void Tarjan(int u, int fa) { dfn[u] = low[u] = ++tot; vis[u] = 1; st[++top] = u; for (int i = f[u]; i; i = e[i].nx) { int v = e[i].v; if (v == fa) continue; if (!dfn[v]) { Tarjan(v, u); low[u] = min(low[u], low[v]); } else if (vis[v]) low[u] = min(low[u], low[v]); } if (dfn[u] == low[u]) { cnt++; int x, sz = 0; do { x = st[top]; top--; sz++; scc[x] = cnt; vis[x] = 0; } while (x != u); if (sz > ans) ans = sz, rt = u; } } void dfs2(int u) { vis[u] = 1; for (int i = f[u]; i; i = e[i].nx) { int v = e[i].v; if (vis[v]) { ansu[i >> 1] = u; ansv[i >> 1] = v; continue; } if (low[v] != low[u]) { ansu[i >> 1] = v; ansv[i >> 1] = u; } else { ansu[i >> 1] = u; ansv[i >> 1] = v; } dfs2(v); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int u, v; scanf( %d%d , &u, &v); read(u, v); read(v, u); } Tarjan(1, 0); ne = 0; printf( %d n , ans); dfs2(rt); for (int i = 1; i <= m; i++) printf( %d %d n , ansu[i], ansv[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; void Solve() { string s; cin >> s; int n = s.size(); int cnt1 = 0, cnt2 = 0; for (int i = 0; i < n - 1; i++) { string t = s.substr(i, 2); if (t == ab ) { cnt1++; } else if (t == ba ) { cnt2++; } } if (cnt1 == cnt2) { cout << s << n ; return; } if (cnt1 > cnt2) { for (int i = n - 1; i >= 0; i--) { if (s[i] == b ) { s[i] = a ; break; } } } else { for (int i = n - 1; i >= 0; i--) { if (s[i] == a ) { s[i] = b ; break; } } } cout << s << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int TC = 1; cin >> TC; while (TC--) Solve(); }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100 * 1000 + 5; int a[MAXN], b[MAXN], c[MAXN], d[MAXN], k[MAXN], ans[MAXN]; pair<int, pair<char, int> > p[3 * MAXN]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; p[i] = make_pair(a[i], make_pair(1, i)); } int m; cin >> m; for (int i = 0; i < m; i++) { cin >> c[i] >> d[i] >> k[i]; p[n + 2 * i] = make_pair(c[i], make_pair(0, i)); p[n + 2 * i + 1] = make_pair(d[i], make_pair(2, i)); } sort(p, p + n + 2 * m); set<pair<int, int> > st; for (int i = 0; i < n + 2 * m; i++) { int id = p[i].second.second; if (p[i].second.first == 0) st.insert(make_pair(d[id], id)); else if (p[i].second.first == 2) st.erase(make_pair(d[id], id)); else { set<pair<int, int> >::iterator it = st.lower_bound(make_pair(b[id], -1)); if (it == st.end()) { cout << NO n ; return 0; } int segId = it->second; ans[id] = segId; k[segId]--; if (!k[segId]) st.erase(it); } } cout << YES n ; for (int i = 0; i < n; i++) cout << ans[i] + 1 << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, l[103], a[103]; int num[103]; vector<int> v; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d , &l[i]); for (int i = 1; i < m; i++) { int t = l[i + 1]; while (t <= l[i]) t += n; if (a[l[i]] && a[l[i]] != t - l[i]) { printf( -1 n ); return 0; } if (!a[l[i]]) { a[l[i]] = t - l[i]; num[a[l[i]]]++; } } for (int i = 1; i <= n; i++) if (num[i] > 1) { printf( -1 n ); return 0; } else if (!num[i]) v.push_back(i); for (int i = 1; i <= n; i++) { if (!a[i]) a[i] = v.back(), v.pop_back(); printf( %d , a[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int x[maxn], y[maxn]; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> x[i]; } for (int i = 1; i <= m; i++) { cin >> y[i]; } int u = 0, d = 0, ans = 0; int sumu = 0, sumd = 0; while (u <= n && d <= m) { if (sumu && sumu == sumd) { ans++; sumd = y[++d]; sumu = x[++u]; } else if (sumu > sumd) { sumd += y[++d]; } else if (sumu <= sumd) { sumu += x[++u]; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; string lower(string second) { for (int i = 0; i < second.size(); i++) if (second[i] >= A && second[i] <= Z ) second[i] = second[i] - A + a ; return second; } char reg(char c, char t) { if (c >= A && c <= Z ) return t - a + A ; return t; } string second, a[105], sl; bool u[105]; int n; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; a[i] = lower(a[i]); } char let; cin >> second >> let; sl = lower(second); for (int i = 0; i < second.size(); i++) for (int j = 0; j < n; j++) if (i + a[j].size() <= second.size() && sl.substr(i, a[j].size()) == a[j]) { for (int k = i; k < i + a[j].size(); k++) u[k] = true; } for (int i = 0; i < second.size(); i++) if (u[i]) { if (sl[i] == let) { if (sl[i] == a ) second[i] = reg(second[i], b ); else second[i] = reg(second[i], a ); } else second[i] = reg(second[i], let); } cout << second; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, i = 0, j = 0, x, t, w, p, q, l, r, count1 = 0, count2 = 0, k = 0, first = 0, second = 0, last, sum = 1e9; const long long mod = 1000003, num = 0; bool compare(pair<string, int> a, pair<string, int> b) { if (a.second == b.second) return a.first < b.first; else return a.second > b.second; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; vector<vector<long long>> v(n, vector<long long>(n, 0)); long long val = 1; for (i = 0; i < n / 2; i++) { for (j = 0; j < n; j++) { v[j][i] = val; val += 1; } } for (i = n / 2; i < n; i++) { for (long long j = n - 1; j >= 0; j--) { v[j][i] = val; val += 1; } } for (i = 0; i < n; i++) { for (j = 0; j < n; j++) cout << v[i][j] << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (t == 10) { if (n == 1) cout << -1 << endl; else { for (int i = 0; i < n - 1; i++) { cout << 1; } cout << 0 << endl; } } else { for (int i = 0; i < n; i++) { cout << t; } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; void doRoutine() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); srand(322179); } signed main() { doRoutine(); long long n; cin >> n; long long res = 0; while (n > 0) { ++res; n /= 2; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> int n, fac[1000005], inv[1000005], ans; int qpow(int a, long long b) { int s = 1; for (; b; b >>= 1, a = 1ll * a * a % 998244353) if (b & 1) s = 1ll * s * a % 998244353; return s; } int C(int n, int m) { return 1ll * fac[n] * inv[n - m] % 998244353 * inv[m] % 998244353; } int add(int x, int y) { return (x += y) >= 998244353 ? x -= 998244353 : x; } int sub(int x, int y) { return (x -= y) < 0 ? x += 998244353 : x; } int main() { scanf( %d , &n), fac[0] = 1; for (register int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % 998244353; inv[n] = qpow(fac[n], 998244353 - 2); for (register int i = n; i; --i) inv[i - 1] = 1ll * inv[i] * i % 998244353; ans = sub(qpow(3, 1ll * n * n), qpow(sub(qpow(3, n), 3), n)); for (register int i = 1; i <= n; ++i) { int s = 1ll * C(n, i) * add(3ll * qpow(qpow(3, n - i) - 1, n) % 998244353, 1ll * sub(qpow(3, i), 3) * qpow(3, 1ll * n * (n - i)) % 998244353) % 998244353; if (i & 1) ans = add(ans, s); else ans = sub(ans, s); } printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); char input[n + 5][n + 5]; for (int i = 0; i < n; i++) scanf( %s , input[i]); int row[n], col[n], count_row = 0, count_col = 0; for (int i = 0; i < n; i++) row[i] = -1; for (int j = 0; j < n; j++) col[j] = -1; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (input[i][j] == . ) { row[i] = j; col[j] = i; } } for (int i = 0; i < n; i++) { if (row[i] != -1) count_row++; if (col[i] != -1) count_col++; } if (count_row != n && count_col != n) printf( -1 n ); else if (count_row == n) { for (int i = 0; i < n; i++) printf( %d %d n , i + 1, row[i] + 1); } else for (int j = 0; j < n; j++) printf( %d %d n , col[j] + 1, j + 1); }
|
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=4e2+2,p=998244353; vector<int> lj[N]; int dis[N][N],dl[N],ans[N][N],rd[N][N],cnt[N],pre[N][N],lb[N*3][2]; int n,m,s,t,i,j,tou,wei,x,y,r; bool ed[N]; int main() { scanf( %d%d ,&n,&m); for (i=1;i<=m;i++) scanf( %d%d ,&x,&y),lj[lb[i][0]=x].push_back(lb[i][1]=y),lj[y].push_back(x); for (i=1;i<=m;i++) lb[i+m][0]=lb[i][1],lb[i+m][1]=lb[i][0];m<<=1; for (s=1;s<=n;s++) { dis[s][dl[tou=wei=1]=s]=rd[s][s]=1; while (tou<=wei) for (auto v:lj[x=dl[tou++]]) if (!dis[s][v]) dis[s][dl[++wei]=v]=dis[s][pre[s][v]=x]+(rd[s][v]=1); else if (dis[s][v]==dis[s][x]+1) ++rd[s][v]; } for (s=1;s<=n;s++) { for (t=1;t<s;t++) printf( %d ,ans[s][t]); //for (i=1;i<=n;i++) printf( %d: pre%d dis%d rd%d n ,i,pre[i],dis[i],rd[i]); for (t=s;t<=n;t++) { for (x=t;x!=s&&rd[s][x]<=1;x=pre[s][x]); if (x!=s) {printf( 0 );continue;} for (x=t;x!=s;x=pre[s][x]) ed[x]=1;r=1; for (i=1;i<=m;i++) if (dis[s][lb[i][0]]+1==dis[s][lb[i][1]]&&dis[t][lb[i][0]]+1==dis[t][lb[i][1]]) ++cnt[lb[i][1]]; //if (s==1&&t==1) for (i=1;i<=n;i++) printf( %d%c ,cnt[i],i==n?10:32); for (i=1;i<=n;i++) if (!ed[i]&&i!=s) r=(ll)r*cnt[i]%p; memset(cnt,0,sizeof(cnt)); for (x=t;x!=s;x=pre[s][x]) ed[x]=0; ans[t][s]=r;printf( %d ,r); }puts( ); } }
|
#include <bits/stdc++.h> using namespace std; int n; int a[1001], b[1001], c[1001], d[1001]; void solve() { cin >> n; int r = 1; int i = 1; cin >> a[i] >> b[i] >> c[i] >> d[i]; int sum = a[1] + b[1] + c[1] + d[1]; for (int i = 2; i <= n; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; int sum1 = a[i] + b[i] + c[i] + d[i]; if (sum1 > sum) { r += 1; } } cout << r; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } int t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, n, a[100]; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); vector<int> v; int dif = 0; for (int i = 1; i < n; i++) { dif = a[i] - a[i - 1]; v.push_back(dif); } sort(v.begin(), v.end()); cout << v[0] << endl; } return 0; }
|
#include <bits/stdc++.h> #pragma optimize( Ofast ) using namespace std; void solve() { int n, k; string s; cin >> n >> k >> s; vector<int> cnt(27); for (char &c : s) { cnt[c - a ]++; } int t = 0; for (int d = 1; d <= n; d++) { vector<int> ncnt = cnt; int curr = 0; for (int j = 0; j < 26; j++) { if (ncnt[j] >= d) { ncnt[j] -= d; curr++; --j; } if (curr && k % curr == 0) { t = max(t, curr * d); } } } cout << t << n ; } int main() { ios_base::sync_with_stdio(false); int q; cin >> q; while (q--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; while (b) { int c = b % a; if (c == 0) b /= a; else if (c == 1) b--; else if (c == a - 1) b++; else return cout << NO , 0; } cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> nums(n); vector<vector<int> > pos(n); for (int i = 0; i < (int)n; i++) { cin >> nums[i]; nums[i] -= 1; pos[nums[i]].push_back(i); } vector<vector<int> > dp(n + 1, vector<int>(n)); for (int i = n - 1; i >= 0; i--) { for (int j = i + 1; j < (int)n; j++) { dp[i][j] = (dp[i + 1][j] + (nums[i] != nums[j])); for (auto k : pos[nums[i]]) { if (k > j) break; if (k < i) continue; int temp = dp[i][k] + 1 + dp[k + 1][j]; dp[i][j] = min(dp[i][j], temp); } } } cout << dp[0][n - 1] << n ; } }
|
#include <bits/stdc++.h> using namespace std; long long a, b, x; int n; int main() { scanf( %d , &n); scanf( %lld%lld , &a, &b); while (n--) { scanf( %lld , &x); printf( %lld , ((x * a) - b * ((x * a) / b)) / a); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, logN = 20; const int M = 350; int d[N], h[N], floorlog[N << 1]; long long D[N], F1[N], F2[N], lft[N], rgt[N], total = 0; map<pair<int, int>, long long> st; vector<pair<int, int> > queries, q; pair<int, int> rmq1[logN][N], rmq2[logN][N]; int max(int i, int j, long long f[]) { return f[i] > f[j] ? i : j; } pair<int, int> merge(pair<int, int>& x, pair<int, int>& y, long long f[]) { if (f[x.first] > f[y.first]) { return {x.first, max(x.second, y.first, f)}; } if (x.first == y.first) { return {y.first, max(x.second, y.second, f)}; } return {y.first, max(x.first, y.second, f)}; } void make_rmq(long long f[], pair<int, int> rmq[][N], int n) { for (int i = n; i >= 1; i--) { rmq[0][i] = {i, 0}; for (int j = 1; i + (1 << j) - 1 <= n; j++) { rmq[j][i] = merge(rmq[j - 1][i], rmq[j - 1][i + (1 << (j - 1))], f); } } } pair<int, int> get(int i, int j, pair<int, int> rmq[][N], long long f[]) { int k = floorlog[j - i + 1]; return merge(rmq[k][i], rmq[k][j - (1 << k) + 1], f); } long long query(int l, int r) { pair<int, int> P = get(l, r, rmq1, F1); pair<int, int> Q = get(l, r, rmq2, F2); long long mx = 0; if (P.first != Q.first) mx = max(mx, F1[P.first] + F2[Q.first]); if (P.second != Q.first) mx = max(mx, F1[P.second] + F2[Q.first]); if (P.first != Q.second) mx = max(mx, F1[P.first] + F2[Q.second]); if (P.second != Q.second) mx = max(mx, F1[P.second] + F2[Q.second]); return mx; } int main() { for (int i = 0; (1 << i) < N; i++) for (int j = (1 << i); j < (1 << (i + 1)); j++) floorlog[j] = i; int n, m; scanf( %d , &(n)); scanf( %d , &(m)); for (int i = 1; i <= n; i++) { D[i] = D[i - 1] + d[i - 1]; scanf( %d , &(d[i])); total += d[i]; } for (int i = 1; i <= n; i++) { scanf( %d , &(h[i])); F1[i] = D[i] + 2 * h[i]; F2[i] = -D[i] + 2 * h[i]; rgt[i] = max(rgt[i - 1], D[i] + 2 * h[i]); } for (int i = n; i >= 1; i--) { lft[i] = max(lft[i + 1], total - D[i] + 2 * h[i]); } F1[0] = -1e18; F2[0] = -1e18; make_rmq(F1, rmq1, n); make_rmq(F2, rmq2, n); for (int i = 1; i <= m; i++) { int a, b; scanf( %d , &(a)); scanf( %d , &(b)); q.push_back({a, b}); if (a > b) { int l = b + 1, r = a - 1; printf( %lld n , query(l, r)); } else { long long ans = 0; if (b != n && a != 1) ans = max(ans, lft[b + 1] + rgt[a - 1]); if (b != n) ans = max(ans, query(b + 1, n)); if (a != 1) ans = max(ans, query(1, a - 1)); printf( %lld n , ans); } } }
|
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v(4); int total = 0; for (int i = 0; i < 4; i++) { scanf( %d , &v[i]); total += v[i]; } sort(v.begin(), v.end()); do { int sum = 0; for (int i = 0; i < 4; i++) { sum += v[i]; if (2 * sum == total) { cout << YES ; return 0; } } } while (next_permutation(v.begin(), v.end())); cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; const long long int N = 1e5 + 5; const long long int INF = 1e10; long long int mod = 998244353; long long int dx[4] = {0, 0, +1, -1}; long long int dy[4] = {+1, -1, 0, 0}; long long int n; void solve() { cin >> n; long long int c1 = 0, c2 = 0; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; (x == 1 ? c1++ : c2++); } long long int f = 0; for (long long int i = 0; i < n; i++) { if (f == 0 and c2 > 0 and c1 > 0) { cout << 2 << << 1 << ; c2--, c1--; f = 1; } else if (c2 > 0) { cout << 2 << ; c2--; } else if (c1 > 0) { cout << 1 << ; c1--; } } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5; int ans[N], all, u, v, n, m, num, color[N], cnt[2]; vector<int> adj[N], radj[N]; bool used[N]; void output() { printf( YES n ); for (int i = 0; i < n; ++i) printf( %d%c , ans[i] + 1, n [i == n - 1]); exit(0); } void dfs(int v, int c) { color[v] = c, cnt[c]++; for (int j = 0; j < ((int)(adj[v]).size()); ++j) if (color[adj[v][j]] == -1) dfs(adj[v][j], c ^ 1); } void truecolor() { int deg = 0; for (int t = 0; t < 2; ++t) { for (int i = 0; i < n; ++i) if (color[i] == t) { ans[i] = num; ++deg; if (deg == 3) { ++num; deg = 0; } } } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) scanf( %d%d , &u, &v), --u, --v, adj[u].push_back(v), adj[v].push_back(u); memset(color, -1, sizeof(color)); for (int i = 0; i < n; ++i) if (color[i] == -1) dfs(i, 0); if (cnt[0] % 3 > cnt[1] % 3) { for (int i = 0; i < n; ++i) color[i] ^= 1; swap(cnt[0], cnt[1]); } all = 0; for (int i = 0; i < n; ++i) if (color[i] == 1) all ^= i; num = 0; if (cnt[0] % 3 == 0) { truecolor(); output(); } for (int i = 0; i < n; ++i) if (color[i] == 0) if (((int)(adj[i]).size()) <= cnt[1] - 2) { ans[i] = 0, color[i] = 2; for (int j = 0; j < ((int)(adj[i]).size()); ++j) used[adj[i][j]] = true; int deg = 2; for (int j = 0; deg && (j < n); ++j) if ((color[j] == 1) && !used[j]) { color[j] = 2; ans[j] = 0; --deg; } ++num; truecolor(); output(); } else if (((int)(adj[i]).size()) == cnt[1] - 1) { int x = all; for (int j = 0; j < ((int)(adj[i]).size()); ++j) x ^= adj[i][j]; radj[x].push_back(i); } int res = 0; for (int i = 0; i < n; ++i) if (((int)(radj[i]).size()) >= 2) res++; if (res <= 1) { printf( NO n ); return 0; } res = 2; for (int i = 0; res && (i < n); ++i) if (((int)(radj[i]).size()) >= 2) { ans[i] = num, color[i] = 2; for (int j = 0; j < 2; ++j) ans[radj[i][j]] = num, color[radj[i][j]] = 2; --res; ++num; } truecolor(); output(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int main() { ios::sync_with_stdio(false); cin.tie(0); int ans = 0, a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; if (e < f) { int now = min(d, min(b, c)); ans += now * f; b -= now; c -= now; d -= now; } else { int now = min(d, a); ans += now * e; a -= now; d -= now; } ans += e * min(a, d); ans += f * min(d, min(b, c)); cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int INF = (long long int)1e9 + 10; const long long int INFLL = (long long int)1e18 + 10; const long double EPS = 1e-8; const long long int MOD = 1e9 + 7; template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); } template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); } template <class T> inline T sq(T a) { return a * a; } int n, m; bool f[128][2]; int memo[128][128][3][3]; bool isin(int a, int b) { return 0 <= a and a < n and 0 <= b and b < 2; } vector<pair<int, int> > cg; void draw(int a, int b) { if (isin(a, b) and !f[a][b]) { cg.emplace_back(a, b); f[a][b] = true; } } void put(int a, int b) { cg.clear(); draw(a, b); draw(a - 1, 1 - b); draw(a, 1 - b); draw(a + 1, 1 - b); } int mex(set<int> &x) { for (long long int i = (0); i < (long long int)(INF); i++) if (x.find(i) == x.end()) return i; } int grandy(int t, int b, int tf, int bf) { int &res = memo[t][b][tf][bf]; if (res != -1) return res; set<int> gs; for (long long int i = (t); i < (long long int)(b); i++) for (long long int j = (0); j < (long long int)(2); j++) if (!f[i][j]) { put(i, j); vector<pair<int, int> > ccg = cg; int x = grandy(t, i, tf, j) ^ grandy(i + 1, b, j, bf); gs.insert(x); for (auto &w : ccg) f[w.first][w.second] = false; } return res = mex(gs); } int main() { scanf( %d %d , &n, &m); for (long long int i = (0); i < (long long int)(m); i++) { int a, b; scanf( %d %d , &a, &b); a--; b--; put(a, b); } for (long long int i = (0); i < (long long int)(128); i++) for (long long int j = (0); j < (long long int)(128); j++) for (long long int k = (0); k < (long long int)(3); k++) for (long long int l = (0); l < (long long int)(3); l++) memo[i][j][k][l] = -1; if (grandy(0, n, 2, 2) == 0) puts( LOSE ); else puts( WIN ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int m, nn, o, p; int main() { long long int n; cin >> n; string a, b; cin >> a >> b; for (int i = 0; i < n; i++) if (a[i] == 0 ) { if (b[i] == 0 ) m++; else nn++; } else { if (b[i] == 0 ) o++; else p++; } cout << m * p + m * o + nn * o << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, tms; void upd(int &x, int y) { x = min(x, y); } struct trietree { int node[505][12]; int sum[505]; int dp[505][505][12]; int dp2[505][505][12][12]; bool vis[505][505][15]; int dep[505]; int tot; void insert(char ch[], int val) { int now = 0; int l = strlen(ch); for (int i = 0; i < l; i++) { int rt = ch[i] - 0 ; if (node[now][rt] == 0) node[now][rt] = ++tot, dep[tot] = dep[now] + 1; now = node[now][rt]; } sum[now] += val; } void dfs(int x, int p, int lft) { if (vis[x][p][lft]) return; vis[x][p][lft] = 1; if (lft > 0) dfs(x, x, lft - 1), upd(dp[x][p][lft], dp[x][x][lft - 1]); vector<int> ch; for (int i = 0; i < 10; i++) if (node[x][i]) ch.push_back(node[x][i]); dp2[x][p][lft][ch.size()] = 0; for (int i = ch.size() - 1; i >= 0; i--) { int t = ch[i]; for (int j = 0; j <= lft; j++) { dfs(t, p, j); upd(dp2[x][p][lft][i], dp2[x][p][lft - j][i + 1] + dp[t][p][j]); } } upd(dp[x][p][lft], dp2[x][p][lft][0] + (dep[x] - dep[p]) * sum[x]); } int solve() { memset(dp, 0x3f, sizeof(dp)); memset(dp2, 0x3f, sizeof(dp2)); dfs(0, 0, tms); return dp[0][0][tms]; } } trie; char buf[1008]; int main() { cin >> n >> tms; for (int i = 0; i < n; i++) { scanf( %s , buf); int gg; cin >> gg; trie.insert(buf, gg); } cout << trie.solve(); return 0; }
|
#include <bits/stdc++.h> int main(void) { char a[3][3]; scanf( %3s , a[0]); scanf( %3s , a[1]); scanf( %3s , a[2]); for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (a[i][j] != a[((((i)-1) * -1) + 1)][((((j)-1) * -1) + 1)]) { puts( NO ); return EXIT_SUCCESS; } puts( YES ); return EXIT_SUCCESS; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 100005; const int Maxm = 500; int T; int n, m, k; vector<int> un; int my[Maxn]; bool has[Maxm][Maxm]; set<int> neigh[Maxn]; void Solve(priority_queue<pair<int, int> > &Q) { bool assigned = false; int inside = n; while (!Q.empty() && -Q.top().first < k) { int v = Q.top().second, d = -Q.top().first; Q.pop(); if (neigh[v].size() != d) continue; if (neigh[v].size() == k - 1) { if (!assigned && inside < Maxm) { int pnt = 0; for (int i = 1; i <= n; i++) if (!neigh[i].empty()) my[i] = pnt++; for (int i = 0; i < pnt; i++) fill(has[i], has[i] + pnt, false); for (int i = 1; i <= n; i++) for (auto u : neigh[i]) has[my[i]][my[u]] = true; assigned = true; } vector<int> seq; for (auto u : neigh[v]) seq.push_back(u); bool ok = true; for (int i = 0; i < seq.size() && ok; i++) for (int j = i + 1; j < seq.size() && ok; j++) if (assigned) ok = has[my[seq[i]]][my[seq[j]]]; else ok = neigh[seq[i]].find(seq[j]) != neigh[seq[i]].end(); if (ok) { printf( 2 n ); printf( %d , v); for (int i = 0; i < seq.size(); i++) printf( %d , seq[i]); printf( n ); return; } } for (auto u : neigh[v]) { neigh[u].erase(v); if (assigned) has[my[v]][my[u]] = has[my[u]][my[v]] = false; Q.push(pair<int, int>(-int(neigh[u].size()), u)); } neigh[v].clear(); inside--; } vector<int> seq; while (!Q.empty()) { int v = Q.top().second, d = -Q.top().first; Q.pop(); if (neigh[v].size() != d) continue; seq.push_back(v); } if (seq.empty()) printf( -1 n ); else { printf( 1 %d n , int(seq.size())); for (int i = 0; i < seq.size(); i++) printf( %d%c , seq[i], i + 1 < seq.size() ? : n ); } } int main() { scanf( %d , &T); while (T--) { scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) neigh[i].clear(); for (int i = 0; i < m; i++) { int a, b; scanf( %d %d , &a, &b); neigh[a].insert(b); neigh[b].insert(a); } priority_queue<pair<int, int> > Q; for (int i = 1; i <= n; i++) Q.push(pair<int, int>(-int(neigh[i].size()), i)); Solve(Q); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = (1 << 20) + 5; bool used[MAXN]; vector<int> adj[MAXN]; int a[MAXN]; int n; vector<int> ans; vector<int>::iterator it[MAXN]; void dfs(int x) { while (it[x] != adj[x].end()) { int p = *(it[x]); if (!used[p / 2]) { int p = *(it[x]); it[x]++; used[p / 2] = true; dfs(a[p ^ 1]); ans.push_back(p); } else { it[x]++; } } } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < 2 * n; i++) cin >> a[i]; for (int i = 0; i < 2 * n; i++) used[a[i]] = !used[a[i]]; int k; for (k = 20; k >= 0; k--) { bool good = true; for (int i = 0; i < (1 << k); i++) { if (used[i]) { good = false; break; } } if (good) break; for (int i = 0; i < (1 << (k - 1)); i++) { used[i] = used[i] ^ used[i + (1 << (k - 1))]; } } for (; k >= 0; k--) { for (int i = 0; i < n; i++) { used[i] = false; } for (int i = 0; i < 2 * n; i++) { a[i] = a[i] % (1 << k); } for (int i = 0; i < (1 << k); i++) adj[i].clear(); for (int i = 0; i < n; i++) { adj[a[2 * i]].push_back(2 * i); adj[a[2 * i + 1]].push_back(2 * i + 1); } for (int i = 0; i < (1 << k); i++) { it[i] = adj[i].begin(); } dfs(a[0]); if (ans.size() == n) { cout << k << n ; for (int i = n - 1; i >= 0; i--) { cout << 1 + ans[i] << << 1 + (ans[i] ^ 1) << ; } return 0; } ans.clear(); } }
|
#include <bits/stdc++.h> using namespace std; const int M = 200 * 1000 + 11; int main() { int q; cin >> q; vector<int> pos(M); int curl = 0; int curr = 0; for (int i = 0; i < q; ++i) { string type; int id; cin >> type >> id; if (i == 0) { pos[id] = curl; --curl; ++curr; } else { if (type == L ) { pos[id] = curl; --curl; } else if (type == R ) { pos[id] = curr; ++curr; } else { cout << min(abs(pos[id] - curl), abs(pos[id] - curr)) - 1 << n ; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 1e7; int n; int m[100], r[100]; bool am[MAX]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> m[i]; for (int i = 1; i <= n; i++) cin >> r[i]; for (int i = 1; i <= n; i++) { bool da = 0; for (int k = 0; k * m[i] + r[i] < MAX; k++) am[k * m[i] + r[i]] = 1; } int cnt = 0; for (int i = 1; i < MAX; i++) cnt += am[i]; cout << 1.00 * cnt / (MAX - 1); return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) #pragma warning(disable : 4996) using namespace std; int main() { int Lpos1, Lpos2; bool p[9][9]; memset(p, true, sizeof(p)); for (int i = 0; i < 2; i++) { char k[3]; scanf( %s , &k); int pos1 = k[0] - a + 1; int pos2 = k[1] - 0 ; if (i == 0) { Lpos1 = pos1; Lpos2 = pos2; for (int j = pos1; j >= 1; j--) p[j][pos2] = false; for (int j = pos1; j <= 8; j++) p[j][pos2] = false; for (int j = pos2; j >= 1; j--) p[pos1][j] = false; for (int j = pos2; j <= 8; j++) p[pos1][j] = false; } else { int x = pos1, y = pos2; p[x][y] = false; if (x + 1 <= 8 && y + 2 <= 8) p[x + 1][y + 2] = false; if (x - 1 >= 1 && y + 2 <= 8) p[x - 1][y + 2] = false; if (x - 2 >= 1 && y + 1 <= 8) p[x - 2][y + 1] = false; if (x - 2 >= 1 && y - 1 >= 1) p[x - 2][y - 1] = false; if (x - 1 >= 1 && y - 2 >= 1) p[x - 1][y - 2] = false; if (x + 1 <= 8 && y - 2 >= 1) p[x + 1][y - 2] = false; if (x + 2 <= 8 && y - 1 >= 1) p[x + 2][y - 1] = false; if (x + 2 <= 8 && y + 1 <= 8) p[x + 2][y + 1] = false; } } int x = Lpos1, y = Lpos2; if (x + 1 <= 8 && y + 2 <= 8) p[x + 1][y + 2] = false; if (x - 1 >= 1 && y + 2 <= 8) p[x - 1][y + 2] = false; if (x - 2 >= 1 && y + 1 <= 8) p[x - 2][y + 1] = false; if (x - 2 >= 1 && y - 1 >= 1) p[x - 2][y - 1] = false; if (x - 1 >= 1 && y - 2 >= 1) p[x - 1][y - 2] = false; if (x + 1 <= 8 && y - 2 >= 1) p[x + 1][y - 2] = false; if (x + 2 <= 8 && y - 1 >= 1) p[x + 2][y - 1] = false; if (x + 2 <= 8 && y + 1 <= 8) p[x + 2][y + 1] = false; int d = 0; for (int i = 1; i <= 8; i++) for (int j = 1; j <= 8; j++) if (p[i][j]) d++; printf( %d , d); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long fast_pow(long long x, long long y, long long p); void solve() { long long a, b, c; cin >> a >> b >> c; long long ans = INT_MAX; long long ansA = -1, ansB = -1, ansC = -1; for (long long ta = 1; ta <= 2 * a; ta++) { for (long long tb = ta; tb <= 2 * b; tb += ta) { long long sum = abs(a - ta) + abs(b - tb); if ((c % tb) < (tb - (c % tb))) { sum += (c % tb); if (sum < ans) { ans = sum; ansA = ta; ansB = tb; long long temp = c / tb; ansC = temp * tb; } } else { sum += (tb - (c % tb)); if (sum < ans) { ans = sum; ansA = ta; ansB = tb; long long temp = (c / tb) + 1; ansC = temp * tb; } } } } cout << ans << n ; cout << ansA << << ansB << << ansC << n ; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long test = 1; cin >> test; while (test--) { solve(); } return 0; } long long fast_pow(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; }
|
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, t, k; int a[200005], maxx, b[200005]; vector<int> v[200005]; int cnt = 1, tmp = 0; int main() { n = read(); t = read(); k = read(); for (int i = 1; i <= t; ++i) a[i] = read(); for (int i = t; i >= 1; --i) { maxx += abs(min(0, a[i + 1] - a[i])); if (i == t) b[i] = a[i]; else b[i] = b[i + 1] + a[i] - 1; } v[0].push_back(1); if (k < maxx || k > n - t) { printf( -1 n ); return 0; } else { printf( %d n , n); for (int i = 1; i <= t; ++i) { if (k < n - t - tmp) { v[i].push_back(++cnt); printf( %d %d n , v[i - 1][0], v[i][0]); a[i]--; for (int j = 1; j < v[i - 1].size() && a[i] && k < n - t - tmp; ++j) { v[i].push_back(++cnt); printf( %d %d n , v[i - 1][j], v[i][j]); tmp++; a[i]--; } if (a[i]) { for (int j = 1; j <= a[i]; ++j) { v[i].push_back(++cnt); printf( %d %d n , cnt, v[i - 1][0]); } } } else { for (int j = 1; j <= a[i]; ++j) { v[i].push_back(++cnt); printf( %d %d n , cnt, v[i - 1][0]); } } } } }
|
#include <bits/stdc++.h> void sort(int a[], int begin, int mid, int end) { int i = begin, j = mid + 1, k = 0, temp[end - begin + 1]; while (i <= mid && j <= end) { if (a[i] <= a[j]) temp[k++] = a[i++]; else temp[k++] = a[j++]; } for (; i <= mid; ++i) temp[k++] = a[i]; for (; j <= end; ++j) temp[k++] = a[j]; for (i = 0; i < k; ++i) a[begin + i] = temp[i]; } void partition(int a[], int begin, int end) { if (begin == end) return; int mid = (begin + end) / 2; partition(a, begin, mid); partition(a, mid + 1, end); sort(a, begin, mid, end); } int main() { int n; scanf( %d , &n); unsigned long long s = 0; int i, a[n + 1]; for (i = 1; i <= n; ++i) scanf( %d , &a[i]); partition(a, 1, n); for (i = 1; i <= n - 1; ++i) s = s + (a[i] * 1LL) * (i + 1); s = s + (a[n] * 1LL) * n; printf( %I64d n , s); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); struct debugger { static void call(string::iterator it, string::iterator ed) {} template <typename T, typename... aT> static void call(string::iterator it, string::iterator ed, T a, aT... rest) { string b; for (; *it != , ; ++it) if (*it != ) b += *it; cout << b << = << a << ; call(++it, ed, rest...); } }; int main() { int n, R, r; cin >> n >> R >> r; if (n == 1 && r <= R) { cout << YES n ; return 0; } if (n == 2 && 2 * r <= R) { cout << YES n ; return 0; } double ans = asin((double)r / (double)(R - r)); if (ans * n <= pi + 1.0e-8) { cout << YES n ; return 0; } cout << NO n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long Mxn = 1e6 + 7; const long long Mod = 1e9 + 7; const long long Inf = 1e16 + 7; const long long Module = 998244353; int N; long long Ans, A[Mxn], B[Mxn], Val[Mxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for (int i = 1; i <= N; i++) { cin >> A[i]; } for (int i = 1; i <= N; i++) { cin >> B[i]; } sort(B + 1, B + N + 1); for (int i = 1; i <= N; i++) { Val[i] = (1LL * A[i] * i * (N - i + 1)); } sort(Val + 1, Val + N + 1); reverse(Val + 1, Val + N + 1); for (int i = 1; i <= N; i++) { Ans = (Ans + (1LL * B[i] * (Val[i] % Module)) % Module) % Module; } cout << Ans; return false; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; vector<long long> v, v1; map<long long, long long> m; for (long long i = 0; i < n; i++) { long long a; cin >> a; v.push_back(a); } long long a, c = 0; cin >> a; for (long long i = 0; i < n; i++) if (v[i] > ((i + 1) * a + k)) c = -1; long long val = k; for (int i = 0; i < n; i++) { int a; cin >> a; v1.push_back(a); } long long sum = 0; if (c == 0) { for (long long i = 0; i < n; i++) { m[v1[i]]++; auto itr = m.begin(); while (v[i] > val && itr != m.end()) { if (itr->second == 0 && itr != m.end()) { auto itr1 = itr; itr1++; m.erase(itr->first); itr = m.find(itr1->first); } else { val += a; sum += itr->first; (itr->second)--; } } } cout << sum << n ; } else cout << -1 << n ; }
|
#include <bits/stdc++.h> using namespace std; int n, nc, a[111], b[111]; string c[111]; struct Node { int lab; Node *left, *right; Node(int x) { lab = x; left = NULL; right = NULL; } }; void printfalse() { cout << IMPOSSIBLE ; exit(0); } Node *solve(int x, int y) { if (x > y) return NULL; if (x == y) return new Node(x); int l = -1, r = n + 1; for (int i = (1); i <= (nc); i++) { int u = a[i], v = b[i]; if (u == x) { if (c[i][0] == L ) { l = max(l, v); } else { r = min(r, v); } } } for (int s = (max(x, l)); s <= (min(y, r - 1)); s++) { bool ok = true; for (int i = (1); i <= (nc); i++) { int u = a[i], v = b[i]; if (x < min(u, v) && min(u, v) <= s && s < max(u, v)) { ok = false; } } if (!ok) continue; Node *r = new Node(x); r->left = solve(x + 1, s); r->right = solve(s + 1, y); return r; } printfalse(); } void print(Node *r) { if (r == NULL) return; print(r->left); cout << r->lab << ; print(r->right); } bool find(Node *u, int v) { if (u == NULL) return false; if (u->lab == v) return true; return find(u->left, v) || find(u->right, v); } void visit(Node *u) { if (u == NULL) return; for (int i = (1); i <= (nc); i++) if (a[i] == u->lab) { if (c[i][0] == L ) { if (!find(u->left, b[i])) printfalse(); } else { if (!find(u->right, b[i])) printfalse(); } } visit(u->left); visit(u->right); } int main() { cin >> n >> nc; for (int i = (1); i <= (nc); i++) { cin >> a[i] >> b[i] >> c[i]; } Node *r = solve(1, n); visit(r); print(r); }
|
#include <bits/stdc++.h> using namespace std; int a[300000], b[300000]; int tree[1 << 21], lazy[1 << 21]; int prop(int s, int e, int i) { tree[i] += lazy[i]; if (s != e) lazy[2 * i + 1] += lazy[i], lazy[2 * i + 2] += lazy[i]; lazy[i] = 0; return 0; } int update(int s, int e, int as, int ae, int i, int num) { prop(s, e, i); if ((s > ae) || (e < as)) return tree[i]; else if ((s >= as) && (e <= ae)) { lazy[i] += num; prop(s, e, i); return tree[i]; } int mid = (s + e) / 2; update(s, mid, as, ae, 2 * i + 1, num), update(mid + 1, e, as, ae, 2 * i + 2, num); tree[i] = min(tree[2 * i + 1], tree[2 * i + 2]); return tree[i]; } int query(int s, int e, int i) { prop(s, e, i); if (s == e) return s; int mid = (s + e) / 2; prop(mid + 1, e, 2 * i + 2); if (tree[2 * i + 2] < 0) return query(mid + 1, e, 2 * i + 2); else return query(s, mid, 2 * i + 1); } int main() { int i; int n, m, q; int t, j, x; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < m; i++) scanf( %d , &b[i]); for (i = 0; i < n; i++) update(0, 1000000, 1, a[i], 0, -1); for (i = 0; i < m; i++) update(0, 1000000, 1, b[i], 0, 1); scanf( %d , &q); for (i = 0; i < q; i++) { scanf( %d %d %d , &t, &j, &x), j--; if (t == 1) { update(0, 1000000, 1, a[j], 0, 1); a[j] = x; update(0, 1000000, 1, a[j], 0, -1); } else { update(0, 1000000, 1, b[j], 0, -1); b[j] = x; update(0, 1000000, 1, b[j], 0, 1); } int ans = query(0, 1000000, 0); if (ans == 0) printf( -1 n ); else printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const string problemName = ; const string inputFile = problemName + .in ; const string outputFile = problemName + .out ; const int INF = (1LL << 31) - 1; const long long int LINF = (1LL << 62) - 1; const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1}; const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1}; const int MOD = (int)(1e9) + 7; const int NMAX = 100000 + 5; const int MMAX = 100000 + 5; const int KMAX = 100000 + 5; const int PMAX = 100000 + 5; const int LMAX = 100000 + 5; const int VMAX = 100000 + 5; long long int t, a, b, n, i, tt, q, sol = 0; long long int A[NMAX]; int putere(long long int b, long long int a) { if (a == 1 && b != 1) return 0; if (a != 1 && b == 1) return 0; while (b != 1 && b % a == 0) b /= a; return b == 1; } int main() { scanf( %lld%lld%lld , &t, &a, &b); if (t != 1 || (t == 1 && !putere(b, a))) { if (a == b) sol++; for (n = 0; b && a > 1; n++) { A[n] = b % a; b /= a; } for (i = q = 0, tt = 1; i < n; i++) { q += A[i] * tt; tt *= t; if (q < 0 || q > a) break; } if (q == a) sol++; printf( %lld , sol); } else { if (a == 1 && b == 1) printf( inf ); else printf( %d , putere(b, a)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; return os << ] ; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } const long long Mod = 1e9 + 7; const long long pre = 1e10; const double inv = pow(10, -10); double y, y2, yw, xb, yb, r; int check(long long xp) { double p = (double)xp * inv; double slope = (yw - r - yb) / (xb - p); double c = (yw - r) - slope * p; if (c >= y2) return 1; if (c <= y) return -1; bool a = (c >= y + r); bool b = (abs(y2 - c) >= r * (sqrt(1 + slope * slope))); if (a && b) return 0; else if (!a && !b) return -1; else if (!a) return -1; else return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> y >> y2 >> yw >> xb >> yb >> r; long long left = 0, right = xb * pre - 1, mid; while (left <= right) { mid = (left + right) / 2; int t = check(mid); if (t == 0) { printf( %0.10lf n , (double)mid * inv); return 0; } else if (t == 1) left = mid + 1; else if (t == -1) right = mid - 1; else { cout << -1 << endl; return 0; } } cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; double L, R; int n, i; int a[10000]; double jami; long long ans1, ans2, ans; int main() { L = 10.0; R = 1000000000; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) { L = max(L, (double)((double)a[i] / i) * 10.0); R = min(R, (double)((double)(a[i] + 1) / i) * 10.0); } R -= 0.000000001; jami = (n + 1) * L; jami -= 10 * a[n]; jami = floor(jami); ans1 = jami / 10; jami = (n + 1) * R; jami -= 10 * a[n]; jami = floor(jami); ans2 = jami / 10; if (ans1 == ans2) { cout << unique << endl; cout << a[n] + ans1 << endl; return 0; } cout << not unique << endl; }
|
#include <bits/stdc++.h> using namespace std; struct query { long long l, r, x; }; int n, a[109]; long long m; int main() { cin >> n >> m; vector<query> v; vector<long long> cp = {1LL << 60}; for (int i = 0; i < n; i++) { cin >> a[i]; int pr = sqrt(a[i]); for (int j = 1; j < pr; j++) { v.push_back(query{j, j + 1, (a[i] + j - 1) / j}); cp.push_back(j); } cp.push_back(pr); int r = (a[i] + pr - 1) / pr, ptr = pr; for (int j = r; j > 1; j--) { v.push_back(query{ptr, (a[i] + j - 2) / (j - 1), j}); ptr = v.back().r; cp.push_back(ptr); } v.push_back(query{ptr, 1LL << 60, 1}); } sort(cp.begin(), cp.end()); cp.erase(unique(cp.begin(), cp.end()), cp.end()); vector<long long> sum(cp.size()); for (query i : v) { int pl = lower_bound(cp.begin(), cp.end(), i.l) - cp.begin(); int pr = lower_bound(cp.begin(), cp.end(), i.r) - cp.begin(); sum[pl] += i.x; sum[pr] -= i.x; } for (int i = 1; i < cp.size(); i++) sum[i] += sum[i - 1]; long long ret = 0; for (int i = 0; i < cp.size() - 1; i++) { long long r = min(cp[i + 1] - 1, (m + sum[0]) / sum[i]); if (cp[i] <= r) ret = max(ret, r); } cout << ret << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long maxs = 1e6 + 5; long long root[maxs]; class cmp { bool operator()(const long long &a, const long long &b) { return a < b; } }; void init() { iota(root, root + maxs, 0); } long long find(long long u) { long long f; if (root[u] == u) return u; else { long long f = find(root[u]); root[u] = f; return f; } } void Union(long long x, long long y) { long long u = find(x); long long v = find(y); root[v] = u; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } void update(vector<long long> &BIT, long long ind, long long val) { while (ind < BIT.size()) { BIT[ind] += val; ind += (ind & (-ind)); } } long long query(vector<long long> &BIT, long long ind) { long long sum = 0; while (ind > 0) { sum += BIT[ind]; ind -= (ind & (-ind)); } return sum; } void count_factors() { long long i, j; long long numOfDivisors[maxs] = {0}; long long ans[maxs] = {0}; for (i = 1; i < maxs; i++) for (j = i; j < maxs; j += i) { numOfDivisors[j]++; ans[j]++; } for (i = 1; i < maxs; i++) for (j = i; j < maxs; j += i) if (numOfDivisors[j / i] == 4) ans[j] = min(ans[j], ans[i]); } long long get(long long x, long long y) { if (x == 0) return 1; long long cnt = 0; while (x % y == 0) { cnt++; x /= y; } return cnt; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t, n, i, k, y, x, j, m, r, l; cin >> t; while (t--) { cin >> n >> k; vector<long long> arr(n + 1); for (i = 1; i <= n; i++) { cin >> arr[i]; } vector<vector<long long>> dp(n + 1, vector<long long>(n + 1, 0)); for (i = 1; i <= n; i++) { for (j = 1; j <= i; j++) { dp[i][j] = dp[i - 1][j]; dp[i][j] = max(dp[i - 1][j - 1] + (arr[i] == j), dp[i][j]); } } long long ans = 0; for (i = 1; i <= n; i++) { if (dp[n][i] >= k) ans = i; } if (ans == 0) cout << -1 << n ; else cout << n - ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, i, sz, j; map<char, int> m; vector<long long> v; vector<string> v2; string s, ss; int main() { cin >> n >> s; for (int i = 0; i < s.length(); i++) { m[s[i]]++; if (m[s[i]] == 1) { v.push_back(i); } } if (v.size() < n) { cout << NO << endl; return 0; } vector<string> v2; for (int i = 0; i < n; i++) { string ss; if (i != n - 1) { for (int j = v[i]; j < v[i + 1]; j++) { ss += s[j]; } } else { for (int j = v[i]; j < s.size(); j++) { ss += s[j]; } } v2.push_back(ss); } cout << YES << endl; for (int i = 0; i < v2.size(); i++) { cout << v2[i] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void checkmax(T& a, T b) { if (a < b) a = b; } bool judge_taxi(string name) { vector<char> vc; for (int i = 0; i < (name.size()); i++) if (isdigit(name[i])) vc.push_back(name[i]); sort(vc.begin(), vc.end()); vc.erase(unique(vc.begin(), vc.end()), vc.end()); return vc.size() == 1; } bool judge_pizza(string name) { char pre = a ; for (int i = 0; i < (name.size()); i++) { if (isdigit(name[i])) { if (name[i] < pre) pre = name[i]; else return false; } } return true; vector<char> vc; for (int i = 0; i < (name.size()); i++) if (isdigit(name[i])) vc.push_back(name[i]); sort(vc.begin(), vc.end()); vc.erase(unique(vc.begin(), vc.end()), vc.end()); return vc.size() == 6; } int main(int argc, char* argv[]) { int T; while (cin >> T) { vector<int> VT, VP, VG; vector<string> VN; int mtaxi = 0, mpizza = 0, mgirl = 0; for (int i = 0; i < (T); i++) { int si; string name; cin >> si >> name; VN.push_back(name); int taxi = 0, pizza = 0; string phone; for (int j = 0; j < (si); j++) { cin >> phone; if (judge_taxi(phone)) taxi++; else if (judge_pizza(phone)) pizza++; } VT.push_back(taxi); VP.push_back(pizza); VG.push_back(si - taxi - pizza); checkmax(mtaxi, taxi); checkmax(mpizza, pizza); checkmax(mgirl, si - taxi - pizza); } bool f = false; cout << If you want to call a taxi, you should call: ; for (int i = 0; i < (VT.size()); i++) if (VT[i] == mtaxi) { if (f) cout << , ; else f = true; cout << VN[i]; } cout << . << endl; f = false; cout << If you want to order a pizza, you should call: ; for (int i = 0; i < (VT.size()); i++) if (VP[i] == mpizza) { if (f) cout << , ; else f = true; cout << VN[i]; } cout << . << endl; cout << If you want to go to a cafe with a wonderful girl, you should call: ; f = false; for (int i = 0; i < (VT.size()); i++) if (VG[i] == mgirl) { if (f) cout << , ; else f = true; cout << VN[i]; } cout << . << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; vector<int> w; cin >> n; for (int i = 0; i < 2 * n; i++) { int x; cin >> x; w.push_back(x); } long long int m = INT_MAX; for (int i = 0; i < w.size(); i++) { for (int j = i + 1; j < w.size(); j++) { vector<int> temp; for (int k = 0; k < w.size(); k++) { if (k != i and k != j) { temp.push_back(w[k]); } } sort(temp.begin(), temp.end()); long long int sum = 0; for (int k = 1; k < temp.size(); k += 2) { sum += (temp[k] - temp[k - 1]); } m = min(m, sum); } } cout << m << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5; const int P = 1e9 + 7; char s[N + 10]; int dp[N + 10][4]; int main() { int n; cin >> n >> (s + 1); dp[0][0] = 1; for (int i = 1; i <= n; i++) { if (s[i] != ? ) { memcpy(dp[i], dp[i - 1], sizeof(dp[i])); (dp[i][s[i] - a + 1] += dp[i - 1][s[i] - a ]) %= P; } else { memcpy(dp[i], dp[i - 1], sizeof(dp[i])); dp[i][0] = 3ll * dp[i][0] % P; for (int j = 1; j <= 3; j++) { dp[i][j] = (3ll * dp[i][j] + dp[i - 1][j - 1]) % P; } } } cout << dp[n][3]; }
|
#include <bits/stdc++.h> using namespace std; long long d[25]; int main() { long long t; cin >> t; while (t--) { long long n, s; cin >> n >> s; long long len = 0, sum = 0, num = n; fill(d, d + 25, 0); while (num > 0) { d[++len] = num % 10; sum += d[len]; num /= 10; } if (sum <= s) { cout << 0 << endl; continue; } long long cur = 0; for (int i = len; i >= 1; i--) { cur += d[i]; if (cur >= s) { d[i + 1]++; for (int j = i; j >= 1; j--) d[j] = 0; break; } } long long ans = 0; cur = 1; for (int i = 1; i <= len + 1; i++) { d[i + 1] += d[i] / 10; d[i] = d[i] % 10; ans += d[i] * cur; cur *= 10; } cout << ans - n << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int w[int(1e5) + 10], id[int(1e5) + 10]; int m; bitset<1010> primes, aux; struct segtree { bitset<1010> values; int start, end, mid, lazy; segtree *left, *right; segtree(int start, int end) : start(start), end(end) { lazy = 0; if (start != end) { mid = (start + end) / 2; left = new segtree(start, mid); right = new segtree(mid + 1, end); values = left->values | right->values; } else { left = right = NULL; values.reset(); values[w[id[start]]] = 1; } } void rotate_mask(int x) { values = values << x | values >> (m - x); values &= aux; } void propagate() { lazy %= m; if (lazy) { rotate_mask(lazy); if (left != right) { left->lazy += lazy; left->lazy %= m; right->lazy += lazy; right->lazy %= m; } lazy = 0; } } void update(int x, int y, int sum) { propagate(); if (x == start && y == end) { lazy += sum; propagate(); } else { if (y <= mid) left->update(x, y, sum); else if (x > mid) right->update(x, y, sum); else left->update(x, mid, sum), right->update(mid + 1, y, sum); left->propagate(); right->propagate(); values = left->values | right->values; } } bitset<1010> query(int x, int y) { propagate(); if (x == start && y == end) return values; if (y <= mid) return left->query(x, y); else if (x > mid) return right->query(x, y); else return left->query(x, mid) | right->query(mid + 1, y); } }; vector<vector<int> > G; int start[int(1e5) + 10], fin[int(1e5) + 10], n; void preorder(int u, int p, int &t) { id[t] = u; start[u] = t++; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (v != p) preorder(v, u, t); } fin[u] = t - 1; } void sieve() { primes.set(); primes[0] = primes[1] = 0; for (int i = 2; i <= 1000; i++) if (primes[i]) for (int j = i + i; j <= 1000; j += i) primes[j] = 0; } int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> w[i], w[i] %= m; G = vector<vector<int> >(n); int a, b; for (int i = 0; i < n - 1; i++) { cin >> a >> b; a--; b--; G[a].push_back(b); G[b].push_back(a); } int t = 0; preorder(0, -1, t); sieve(); for (int i = m - 1; i >= 0; i--) aux[i] = 1; segtree st(0, n - 1); int q, op; cin >> q; while (q--) { cin >> op; if (op == 1) { cin >> a >> b; b %= m; a--; st.update(start[a], fin[a], b); } else { cin >> a; a--; cout << int((st.query(start[a], fin[a]) & primes).count()) << n ; } } }
|
#include <bits/stdc++.h> int main() { int n, i, j; scanf( %d , &n); long long int a[n][2], x, y, max1, max2, min1, min2; for (i = 0; i < n; i++) for (j = 0; j < 2; j++) scanf( %I64d , &a[i][j]); min1 = max1 = a[0][0]; min2 = max2 = a[0][1]; for (i = 0; i < n; i++) { if (min1 > a[i][0]) min1 = a[i][0]; if (max1 < a[i][0]) max1 = a[i][0]; if (min2 > a[i][1]) min2 = a[i][1]; if (max2 < a[i][1]) max2 = a[i][1]; } x = max1 - min1; y = max2 - min2; if (x > y) printf( %I64d , x * x); else printf( %I64d , y * y); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 150000; int b[maxn]; long long a[maxn]; int main(void) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &b[i]); b[0] = b[n]; int id = 0; for (int i = 1; i <= n; i++) if (b[i] > b[i - 1]) { id = i; break; } if (id == 0) { if (b[1] == 0) { printf( YES n ); for (int i = 1; i <= n; i++) printf( 1%c , n [i == n]); } else printf( NO n ); return 0; } a[id] = max(b[id], 1); for (int i = 0; i < n - 1; i++) { int nid = id - 1; if (nid == 0) nid = n; int nnid = nid - 1; if (nnid == 0) nnid = n; a[nid] = b[nid]; if (b[nnid] >= b[nid]) a[nid] += ((b[nnid] - b[nid]) / a[id] + 1) * a[id]; if (a[nid] == 0) a[nid] = a[id]; id = nid; } a[n + 1] = a[1]; printf( YES n ); for (int i = 1; i <= n; i++) printf( %I64d%c , a[i], n [i == n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > ans; int deg[400001]; int tot; int flag; int n, d, k; int name() { flag++; return flag; } void f(int x, int curr) { if (tot <= 0 or x == 0) return; while (deg[curr] < k and tot > 0) { if (tot <= 0) return; int t = name(); ans.push_back({curr, t}); deg[t]++; deg[curr]++; tot--; f(x - 1, t); } } int main() { cin >> n >> d >> k; tot = n - 1; if (k == 1) { if (n == 2 and d == 1) { printf( YES n ); printf( 1 2 n ); } else if (n == 1 and d == 0) { printf( YES n ); } else { printf( NO n ); } return 0; } if (n < d + 1) { printf( NO n ); return 0; } if (k == 2) { if (n == d + 1) { printf( YES n ); for (int i = 0; i < n - 1; ++i) { printf( %d %d n , i + 1, i + 2); } } else printf( NO n ); return 0; } for (int i = 0; i < d; ++i) { ans.push_back({i + 1, i + 2}); deg[i + 1]++; deg[i + 2]++; tot--; } flag = d + 1; for (int i = 2; i <= d; ++i) { int temp = min(i - 1, d + 1 - i); f(temp, i); } if (tot > 0) { printf( NO n ); return 0; } printf( YES n ); for (auto i : ans) { printf( %d %d n , i.first, i.second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, M; int w[401][401]; int last[401], K; double P1[401], P2[401], mxp[402]; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) w[i][j] = i == j ? 0 : 1e9; for (int i = 1; i <= M; i++) { int a, b; scanf( %d%d , &a, &b); w[a][b] = w[b][a] = 1; } for (int k = 1; k <= N; k++) for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) w[i][j] = min(w[i][j], w[i][k] + w[k][j]); double ans = 0; for (int i = 1; i <= N; i++) { double now = 0; for (int dist = 0; dist < N; dist++) { vector<int> arr; for (int j = 1; j <= N; j++) if (w[i][j] == dist) { arr.push_back(j); } if (!((int)(arr).size())) continue; for (int j = 1; j <= N; j++) P1[j] = P2[j] = 0; for (int t : arr) P1[t] = 1. / ((int)(arr).size()); vector<int> cand; for (int t : arr) { int deg = 0; for (int j = 1; j <= N; j++) if (w[t][j] == 1) deg++; for (int j = 1; j <= N; j++) if (w[t][j] == 1) P2[j] += P1[t] / deg, cand.push_back(j); } sort((cand).begin(), (cand).end()); cand.erase(unique((cand).begin(), (cand).end()), cand.end()); double mx = 1. / ((int)(arr).size()); for (int j = 1; j <= N; j++) { ++K; for (int k : cand) { if (last[w[j][k]] < K || last[w[j][k]] == K && mxp[w[j][k]] < P2[k]) last[w[j][k]] = K, mxp[w[j][k]] = P2[k]; } double now2 = 0; ++K; for (int k : cand) { if (last[w[j][k]] == K) continue; last[w[j][k]] = K; now2 += mxp[w[j][k]]; } mx = max(mx, now2); } now += mx * ((int)(arr).size()) / N; } ans = max(ans, now); } printf( %.9f n , ans); }
|
#include <bits/stdc++.h> bool FLAG = 1; using namespace std; const long long MOD = (long long)1e9 + 7, N = (long long)2e6 + 222; const long long INF = (long long)1e18; long long n, k, p[N], a[N], b[N], b1[N]; string s; void clear() { for (long long i = 1; i <= n; ++i) { p[i] = a[i]; } } long long m; void solve() { cin >> n >> m; long long mx = 0; for (long long i = 1; i <= n; ++i) { cin >> a[i]; mx = max(mx, a[i]); } for (long long i = 1; i <= n; ++i) { cin >> b[i]; } sort(b + 1, b + 1 + n); for (long long i = 1; i <= n; ++i) { b1[i] = b[i] + m; } long long mn = INF; clear(); for (long long i = 1; i <= n; ++i) { long long d; if (b1[i] - mx >= 0) { d = b1[i] - mx; for (long long j = 1; j <= n; ++j) { p[j] += d; p[j] %= m; } sort(p + 1, p + 1 + n); bool ok = 0; for (long long j = 1; j <= n; ++j) { if (p[j] != b[j]) ok = 1; } if (ok == 0) { mn = min(mn, d); } clear(); } if (b[i] - mx >= 0) { d = b[i] - mx; for (long long j = 1; j <= n; ++j) { p[j] += d; p[j] %= m; } sort(p + 1, p + 1 + n); bool ok = 0; for (long long j = 1; j <= n; ++j) { if (p[j] != b[j]) ok = 1; } if (ok == 0) { mn = min(mn, d); } clear(); } } cout << mn; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct str { int sum, poz; }; str v[100000]; int cmp(str a, str b) { if (a.sum == b.sum) return a.poz < b.poz; else return a.sum > b.sum; } int main() { int n, x; scanf( %d , &n); for (int i = 1; i <= n; i++) { int s = 0; for (int j = 1; j <= 4; j++) { scanf( %d , &x); s += x; } v[i] = {s, i}; } sort(v + 1, v + n + 1, cmp); for (int i = 1; i <= n; i++) if (v[i].poz == 1) { printf( %d , i); return 0; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[2006]; int Gcd(int m, int n) { if (n == 0) return m; return Gcd(n, m % n); } int main() { int n; scanf( %d , &n); int yi = 0; int flag = 0; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] == 1) yi++; } if (yi != 0) { printf( %d n , n - yi); return 0; } int min = 5000; for (int i = 0; i < n; i++) { int sum = 0, mod = a[i]; for (int j = i + 1; j < n; j++) { mod = Gcd(mod, a[j]); sum++; if (mod == 1) { flag = 1; if (sum < min) min = sum; break; } } } if (flag == 1) printf( %d n , min + n - 1); else printf( -1 n ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int x = (n + 3) / 4; int p = n - x; while (p--) cout << 9 ; while (x--) cout << 8 ; cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; double EPS = 1e-9; int INF = 2000000000; long long INFF = 8000000000000000000LL; double PI = acos(-1); int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1}; int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1}; inline string IntToString(int a) { char x[100]; sprintf(x, %d , a); string s = x; return s; } inline int StringToInt(string a) { char x[100]; int res; strcpy(x, a.c_str()); sscanf(x, %d , &res); return res; } inline string GetString(void) { char x[1000005]; scanf( %s , x); string s = x; return s; } inline string uppercase(string s) { int n = (int)s.size(); for (int(i) = (0); (i) < (n); ++(i)) if (s[i] >= a && s[i] <= z ) s[i] = s[i] - a + A ; return s; } inline string lowercase(string s) { int n = (int)s.size(); for (int(i) = (0); (i) < (n); ++(i)) if (s[i] >= A && s[i] <= Z ) s[i] = s[i] - A + a ; return s; } inline void OPEN(string s) { freopen((s + .in ).c_str(), r , stdin); freopen((s + .out ).c_str(), w , stdout); } double prob[10005]; int n; pair<int, int> data[6]; int main() { scanf( %d , &n); for (int(i) = (0); (i) < (n); ++(i)) scanf( %d %d , &data[i].first, &data[i].second); double risan = 0; for (int(i) = (0); (i) < (n); ++(i)) { swap(data[i], data[n - 1]); int m = n - 1; for (int(j) = (1); (j) <= (10000); ++(j)) { prob[j] = 0; for (int(bit) = (0); (bit) < (1 << m); ++(bit)) if (bit > 0) { double res = 1; for (int(k) = (0); (k) < (m); ++(k)) if (bit & (1 << k)) { if (data[k].first <= j && j <= data[k].second) { res *= 1.0 / (double)(data[k].second - data[k].first + 1); } else goto hell; } else { if (data[k].first >= j) goto hell; int batas = min(data[k].second, j - 1); res *= (double)(batas - data[k].first + 1) / (double)(data[k].second - data[k].first + 1); } prob[j] += res; hell:; } } for (int(j) = (1); (j) <= (10000); ++(j)) prob[j] = prob[j] * j + prob[j - 1]; swap(data[i], data[n - 1]); for (int(j) = (data[i].first); (j) <= (data[i].second); ++(j)) { risan += 1.0 / (double)(data[i].second - data[i].first + 1) * prob[j - 1]; } } for (int(j) = (1); (j) <= (10000); ++(j)) { for (int(bit) = (0); (bit) < (1 << n); ++(bit)) if (__builtin_popcount(bit) > 1) { double res = j; for (int(i) = (0); (i) < (n); ++(i)) if (bit & (1 << i)) { if (data[i].first <= j && j <= data[i].second) { res *= 1.0 / (double)(data[i].second - data[i].first + 1); } else goto hell2; } else { if (data[i].first >= j) goto hell2; int batas = min(data[i].second, j - 1); res *= (double)(batas - data[i].first + 1) / (double)(data[i].second - data[i].first + 1); } risan += res; hell2:; } } printf( %.10lf n , risan); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 1000 + 20; int a[N], x[N], y[N], visited[N], h[N], mark[N], n, t = 0, dady[N]; vector<int> ans, adj[N]; void dfs_mark(int v) { visited[v] = 1; for (int i = 0; i < adj[v].size(); i++) { int u = adj[v][i]; if (visited[u] == 0) { dfs_mark(u); mark[v] += mark[u]; } } } void dfs(int v) { visited[v] = 1; for (int i = 0; i < adj[v].size(); i++) { int u = adj[v][i]; if (visited[u] == 0 and mark[u] == 1) { ans.push_back(u); dfs(u); } } } void dfs_child(int v) { visited[v] = 1; if (adj[v].size() == 1 and v != 1) { t++; } for (int i = 0; i < adj[v].size(); i++) { int u = adj[v][i]; if (visited[u] == 0) { dady[u] = v; dfs_child(u); } } } void masir(int v) { if (v != 1) { ans.push_back(dady[v]); masir(dady[v]); } } int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } dfs_child(1); fill(visited, visited + n + 1, 0); int c, l = 1; ans.push_back(1); for (int i = 0; i < t; i++) { cin >> c; fill(visited, visited + n + 1, 0); fill(mark, mark + n + 1, 0); mark[c] = 1; dfs_mark(l); fill(visited, visited + n + 1, 0); dfs(l); l = c; } masir(c); if (ans.size() > 2 * n - 1) { cout << -1; return 0; } for (int i = 0; i < ans.size(); i++) { cout << ans[i] << ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, y, counter = 0; cin >> x >> y; int m = max(x, y); while (m != 6) { m++; counter++; } string arr[6] = { 1/6 , 1/3 , 1/2 , 2/3 , 5/6 , 1/1 }; cout << arr[counter] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; pair<pair<double, double>, double> circ[3]; vector<pair<double, double> > points; double eps = 0.0000001; double dist(pair<double, double> x, pair<double, double> y) { return sqrt((x.first - y.first) * (x.first - y.first) + (x.second - y.second) * (x.second - y.second)); } bool add_intersections(int a, int b) { pair<double, double> centrA = circ[a].first; pair<double, double> centrB = circ[b].first; double r1 = circ[a].second; double r2 = circ[b].second; double d = dist(centrA, centrB); if (r2 + d + eps < r1 || r1 + d + eps < r2) { return false; } if (d > r1 + r2 + eps) { return false; } double cos = (r1 * r1 + d * d - r2 * r2) / (2 * r1 * d); double sin = sqrt(1 - cos * cos); pair<double, double> v = make_pair(centrB.first - centrA.first, centrB.second - centrA.second); pair<double, double> v_l = make_pair(v.first * cos - v.second * sin, v.first * sin + v.second * cos); pair<double, double> v_r = make_pair(v.first * cos + v.second * sin, v.second * cos - v.first * sin); double sc = r1 / d; points.push_back(make_pair(centrA.first + (v_l.first * sc), centrA.second + (v_l.second * sc))); points.push_back(make_pair(centrA.first + (v_r.first * sc), centrA.second + (v_r.second * sc))); return true; } void remove_copies() { vector<pair<double, double> > old = points; points.clear(); for (int i = 0; i < old.size(); i++) { bool unique = true; for (int j = 0; j < points.size(); j++) { if (dist(points[j], old[i]) < eps) { unique = false; } } if (unique) { points.push_back(old[i]); } } } bool on_circle(int nr, pair<double, double> p) { double d = dist(circ[nr].first, p); return (d + eps > circ[nr].second && d < eps + circ[nr].second); } bool edge[3][3]; bool vis[3]; void dfs(int x) { vis[x] = 1; for (int i = 0; i < 3; i++) { if (!vis[i] && edge[x][i]) { dfs(i); } } } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> circ[i].first.first >> circ[i].first.second >> circ[i].second; } int spsk = 0; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (add_intersections(i, j)) { edge[i][j] = 1; edge[j][i] = 1; } } } for (int i = 0; i < n; i++) { if (!vis[i]) { spsk++; dfs(i); } } remove_copies(); int e = 0; for (int i = 0; i < n; i++) { e++; for (int j = 0; j < points.size(); j++) { if (on_circle(i, points[j])) { e++; } } } cout << 2 + e - points.size() - n + spsk - 1 << n ; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long MAXN = 1e+5 + 7; const long long MOD = 1e+9 + 7; const long long INF = 0x7f7f7f7f7f7f7f7f; const int INFi = 0x7f7f7f7f; vector<long long> adj[MAXN]; long long visit[MAXN] = {}; int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}; int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0}; long long n, t; long long a[MAXN]; long long pre[MAXN]; long long res = -INF; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed; cout << setprecision(10); ; memset(pre, 0, sizeof(pre)); cin >> n >> t; for (long long i = (1); i <= n; i++) cin >> a[i]; a[n + 1] = INF; pre[1] = a[1]; for (long long i = (2); i <= n; i++) pre[i] = pre[i - 1] + a[i]; for (long long i = (1); i <= n; i++) { long long ind = upper_bound(pre + i, pre + n + 1, pre[i - 1] + t) - (pre + i); res = max(res, ind); } cout << res; }
|
#include <bits/stdc++.h> using namespace std; int n, m; int a[1000 + 10][1000 + 10]; bitset<1024> bs[1000 + 10], temp; bool testAns(int ans) { for (int(i) = (0), _n = (n - 1); (i) <= _n; (i)++) { for (int(j) = (0), _n = (m - 1); (j) <= _n; (j)++) { if (a[i][j] >= ans) bs[i].set(j, true); else bs[i].set(j, false); } } for (int(i) = (0), _n = (n - 1); (i) <= _n; (i)++) { if (bs[i].count() < 2) continue; for (int(j) = (i + 1), _n = (n - 1); (j) <= _n; (j)++) { temp = bs[i] & bs[j]; if (temp.count() >= 2) return true; } } return false; } int solve(int right) { int left = 0; int mid, ret = 0; while (left <= right) { mid = (left + right) / 2; if (testAns(mid)) { ret = mid; left = mid + 1; } else { right = mid - 1; } } return ret; } int main() { int maxs = 0; scanf( %d %d , &n, &m); for (int(i) = (0), _n = (n - 1); (i) <= _n; (i)++) { for (int(j) = (0), _n = (m - 1); (j) <= _n; (j)++) { scanf( %d , &a[i][j]); maxs = max(maxs, a[i][j]); } } printf( %d n , solve(maxs)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int t, n, m; long long ans; int main() { scanf( %d%d , &n, &m); if (n == 1) ans = m; else if (m == 1) ans = n; else if (n == 2) ans = ((m / 4) * 2 + min(m & 3, 2)) * 2ll; else if (m == 2) ans = ((n / 4) * 2 + min(n & 3, 2)) * 2ll; else ans = (n * 1ll * m + 1) / 2; printf( %I64d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; string a, b; vector<long long int> v1, v2; for (long long int i = 0; i < n; i++) { long long int x, y; cin >> x >> y; v1.push_back(x); v2.push_back(y); a += 0 ; b += 0 ; } long long int i = 0, j = 0; while ((i + j) != n) { if (v1[i] <= v2[j]) a[i] = 1 , i++; else b[j] = 1 , j++; } for (long long int i = 0; i < n / 2; i++) { a[i] = 1 ; b[i] = 1 ; } cout << a << endl << b; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 99999; int arr[102], tmp[102]; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 1; i < n - 1; i++) { int cnt = 0; for (int j = 0; j < n; j++) { if (j != i) tmp[cnt++] = arr[j]; } int mx = -1; for (int j = 1; j < n - 1; j++) mx = max(mx, tmp[j] - tmp[j - 1]); ans = min(ans, mx); } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; cout << 1 << n - 1; cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long rev2 = (mod + 1) / 2; long long mas[300300]; long long pow2[300300]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &mas[i]); sort(mas, mas + n); pow2[0] = 1; for (int i = 1; i < 300300; i++) pow2[i] = (pow2[i - 1] * 2LL) % mod; for (int i = 1; i < n; i++) { mas[i] -= mas[0]; } mas[0] = 0; long long sum = 0; long long mn = 1; for (int i = 1; i < n; i++) { sum += mas[i] * mn; sum %= mod; mn *= 2; mn %= mod; } long long res = 0; for (int i = 1; i < n; i++) { res += sum; res %= mod; sum -= (mas[i] - mas[i - 1]); sum %= mod; if (sum < 0) sum += mod; sum *= rev2; sum %= mod; sum -= (long long)(pow2[n - i - 1] - 1) * (mas[i] - mas[i - 1]); sum %= mod; if (sum < 0) sum += mod; } printf( %lld , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int mod = 1e9 + 7; int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 1) + (x << 3) + c - 0 , c = getchar(); return x * f; } int inc(int x, int y) { return (x + y >= mod) ? (x + y - mod) : (x + y); } int del(int x, int y) { return (x - y < 0) ? (x - y + mod) : (x - y); } namespace math { int qpow(int a, int x, int mo) { int res = 1; while (x) { if (x & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; x >>= 1; } return res; } int Fac[N], invFac[N]; void Finit(int n) { Fac[0] = 1; invFac[0] = 1; for (int i = 1; i <= n; i++) Fac[i] = 1ll * Fac[i - 1] * i % mod; invFac[n] = qpow(Fac[n], mod - 2, mod); for (int i = n - 1; i >= 1; i--) invFac[i] = 1ll * invFac[i + 1] * (i + 1) % mod; } int C(int n, int m) { if (m == 0) return 1; if (n < m || m < 0) return 0; return (int)(1ll * Fac[n] * invFac[m] % mod * invFac[n - m] % mod); } } // namespace math bitset<N> p[N]; int c[N][N]; int main() { int n = read(), m = read(), R = read(); int siz = 1e3; math::Finit(n); vector<int> X(n + 1), Y(n + 1), Z(n + 1); for (int i = 1; i <= n; i++) X[i] = read(), Y[i] = read(), Z[i] = read(); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (max(abs(X[i] - X[j]), abs(Y[i] - Y[j])) <= R) p[i].set(j); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { c[i][j] = math::C(n - (p[i] | p[j]).count(), m); } } int res = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { int o = inc(del(del(math::C(n, m), c[i][i]), c[j][j]), c[i][j]); res = inc(res, 1ll * o * Z[i] % mod * Z[j] % mod); } } cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; vector<int>::iterator IntIter; vector<long long>::iterator LLIter; int main(int argc, char *argv[]) { int i, j; int a[3][3]; for (i = 0; i < 3; i++) for (j = 0; j < 3; j++) cin >> a[i][j]; int b[3][3] = {1}; b[0][0] = (a[0][0] + a[0][1] + a[1][0]) % 2; b[0][1] = (a[0][0] + a[0][1] + a[0][2] + a[1][1]) % 2; b[0][2] = (a[0][1] + a[0][2] + a[1][2]) % 2; b[1][0] = (a[1][0] + a[0][0] + a[1][1] + a[2][0]) % 2; b[1][1] = (a[1][0] + a[1][1] + a[1][2] + a[0][1] + a[2][1]) % 2; b[1][2] = (a[1][1] + a[1][2] + a[0][2] + a[2][2]) % 2; b[2][0] = (a[2][0] + a[1][0] + a[2][1]) % 2; b[2][1] = (a[1][1] + a[2][0] + a[2][1] + a[2][2]) % 2; b[2][2] = (a[1][2] + a[2][1] + a[2][2]) % 2; for (i = 0; i < 3; i++) { for (j = 0; j < 3; j++) { if (b[i][j]) { cout << 0 ; } else { cout << 1 ; } } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; char arr[31][31]; int n, m, x; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL)); cin >> n >> m >> x; map<char, int> m1; vector<pair<float, float> > v; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> arr[i][j]; m1[arr[i][j]]++; if (arr[i][j] == S ) v.push_back(make_pair(i, j)); } } int q; cin >> q; string s; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] >= 65 && s[i] < 91 && !m1[ S ] || !m1[s[i]] && s[i] >= 97 && s[i] < 123 || s[i] == S && !m1[ s ]) { cout << -1 ; return 0; } } int q1 = 0; map<char, int> ss; for (int i = 0; i < s.size(); i++) { int ans = 1000; if (s[i] >= 65 && s[i] < 91) { if (ss[s[i]] == 2) q1++; else if (ss[s[i]] == 1) continue; else { s[i] += 32; bool f = 0; if (!m1[s[i]]) { cout << -1 << endl; return 0; } for (int j = 0; j < n; j++) { for (int k = 0; k < m; k++) { if (arr[j][k] == s[i]) { for (int l = 0; l < v.size(); l++) { if ((v[l].first - j) * (v[l].first - j) + (v[l].second - k) * (v[l].second - k) <= x * x) { f = 1; break; } } } } } if (!f) { q1++; ss[s[i] - 32] = 2; } else ss[s[i] - 32] = 1; } } } cout << q1 << endl; }
|
#include <bits/stdc++.h> using namespace std; long long n, k; int32_t main() { cin >> n >> k; if ((n / k) & 1) cout << YES ; else cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; string s; cin >> s; long long ans = 0; for (long long i = 0; i < n; i++) { long long t = s[i] - 0 ; if (t % 2 == 0) { ans += i + 1; } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k, dotx, doty; char t[502][502]; int vis[502][502]; int x[4] = {0, -1, 0, 1}; int y[4] = {1, 0, -1, 0}; void dfs(int r, int c) { if (r >= n || r < 0 || c >= m || c < 0 || t[r][c] == # || vis[r][c]) return; vis[r][c] = 1; for (int i = 0; i < 4; i++) { dfs(r + x[i], c + y[i]); } if (k > 0) { k--; t[r][c] = X ; } } int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> t[i][j]; if (t[i][j] == . ) { dotx = i; doty = j; } } dfs(dotx, doty); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << t[i][j]; } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n, m, c; cin >> n >> m >> c; for (int i = 1; i <= m; i++) { int x, ans; cin >> x; if (x <= c / 2) { for (int j = 1; j <= n; j++) { if (x < a[j] || a[j] == 0) { a[j] = x; ans = j; break; } } } else { for (int j = n; j >= 1; j--) { if (x > a[j] || a[j] == 0) { a[j] = x; ans = j; break; } } } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; long long n, m, s, t, k, a, b, x, y, u; const int mod = 1e9 + 7; const int mxn = 2e5 + 5; long long mn = 1e18, mx = 0; long long arr[2000000], wan[2000000], finl[2000000]; string str, str2; vector<vector<long long> > v(200000), cm(200000); map<long long, long long> mp, pm; map<pair<long long, long long>, long long> frq; int main() { ios_base::sync_with_stdio(0); t = 1; while (t--) { cin >> n; long long z; for (int i = 0; i < n - 2; i++) { cin >> x >> y >> z; mp[x]++; mp[y]++; mp[z]++; frq[{x, y}]++, frq[{y, x}]++; if (frq[{x, y}] == 2) cm[x].push_back(y), cm[y].push_back(x); frq[{x, z}]++, frq[{z, x}]++; if (frq[{x, z}] == 2) cm[x].push_back(z), cm[z].push_back(x); frq[{z, y}]++, frq[{y, z}]++; if (frq[{z, y}] == 2) cm[z].push_back(y), cm[y].push_back(z); } for (int i = 1; i <= n; i++) { if (mp[i]) { v[mp[i]].push_back(i); } } int l = 0; for (int i = 1; i <= 2; i++) { long long fr = 0, se = 0; long long valf = 0, vals = 0; int j = 0; for (auto it : v[i]) { if (i == 1) { arr[l++] = it; pm[it]++; break; } else { if (!j) fr = frq[{arr[l - 1], it}], valf = it; else se = frq[{arr[l - 1], it}], vals = it; j++; } } if (i != 1) { if (fr > se) { arr[l++] = valf; pm[valf]++; } else arr[l++] = vals, pm[vals]++; ; } } for (int i = 0; i < l; i++) cout << arr[i] << ; long long cn = n - 4; while (cn) { for (auto i : cm[arr[l - 1]]) { if (!pm[i]) { pm[i] = 1; cout << i << ; arr[l++] = i; } } cn--; } for (int i = 2; i >= 1; i--) { for (auto it : v[i]) { if (!pm[it]) { cout << it << ; } } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 100; const int MAXLEN = 26; bool done[26]; bool have[26]; bool before[26][26]; char nxt[26]; int n; char s[MAXLEN + 1]; void run() { memset(done, false, sizeof(done)); memset(have, false, sizeof(have)); memset(before, false, sizeof(before)); memset(nxt, ? , sizeof(nxt)); scanf( %d , &n); for (int i = (0); i < (n); ++i) { scanf( %s , s); int slen = strlen(s); for (int j = (0); j < (slen); ++j) have[s[j] - a ] = true; for (int j = (0); j < (slen); ++j) for (int k = (j + 1); k < (slen); ++k) before[s[j] - a ][s[k] - a ] = true; for (int j = (0); j < (slen - 1); ++j) nxt[s[j] - a ] = s[j + 1]; } for (int k = (0); k < (26); ++k) for (int i = (0); i < (26); ++i) for (int j = (0); j < (26); ++j) if (before[i][k] && before[k][j]) before[i][j] = true; while (true) { int idx = -1; for (int i = (0); i < (26); ++i) if (!done[i] && have[i]) { bool ok = true; for (int j = (0); j < (26); ++j) if (!done[j] && have[j] && before[j][i]) ok = false; if (ok) { idx = i; break; } } if (idx == -1) { puts( ); break; } while (true) { printf( %c , a + idx); done[idx] = true; if (nxt[idx] == ? ) break; else idx = nxt[idx] - a ; } } } int main() { run(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[120], b[120]; signed main() { ios::sync_with_stdio(0); cin.tie(0); long long t; cin >> t; while (t--) { long long n; cin >> n; for (long long i = 0; i < n; i++) cin >> a[i]; for (long long i = 0; i < n; i++) cin >> b[i]; sort(a, a + n); sort(b, b + n); for (long long i = 0; i < n; i++) cout << a[i] << ; cout << n ; for (long long i = 0; i < n; i++) cout << b[i] << ; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a[1111][1111]; int main() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) for (int j = 0; j < n - 1; j++) a[i][j] = 1 + (i + j) % (n - 1); for (int i = 0; i < n - 1; i++) a[n - 1][i] = a[i][n - 1] = a[i][i], a[i][i] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) printf( %d , a[i][j]); printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long y, k, n; cin >> y >> k >> n; int flag = 0; int i = y / k + 1; while (i * k <= n) { cout << i * k - y << ; i++; flag++; } if (!flag) cout << -1 ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; int n, a[N]; long long s[2][N]; double Ans; void Add(int tp, int x, long long sum) { while (x <= n) s[tp][x] += sum, x += (x & (-x)); } long long Query(int tp, int x) { long long ret = 0; while (x) ret += s[tp][x], x -= (x & (-x)); return ret; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) { Ans += 1.0 * Query(0, n - a[i] + 1) / (1.0 * n * (n + 1)) * i; Ans += 1.0 * i * (n - i + 1) * (n - i) / (2.0 * n * (n + 1)); Add(0, n - a[i] + 1, 2 * i); } for (int i = 1; i <= n; ++i) { Ans += 1.0 * Query(1, n - a[i] + 1) / (1.0 * n); Add(1, n - a[i] + 1, n - 2 * i); } printf( %.10lf , Ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 1e5 + 9; int n, a[MX], sum; void dp(int x, int y, int sum1, int sum2) { if ((x | y) == (1 << n) - 1) { if (!x || !y) return; if (sum1 != sum2) { cout << __builtin_popcount(x) << endl; for (int i = 0; i < n; i++) { if (x & (1 << i)) cout << i + 1 << ; } exit(0); } } for (int i = 0; i < n; i++) { if ((x & (1 << i)) || (y & (1 << i))) continue; dp(x | (1 << i), y, sum1 + a[i], sum2); dp(x, y | (1 << i), sum1, a[i] + sum2); } } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } dp(0, 0, 0, 0); puts( -1 ); }
|
#include <bits/stdc++.h> using namespace std; long long n, m, i; string s; int main() { char c; cin >> s; i = 0; while (s[i] < 80) { n *= 10; n += s[i] - 48; i++; } c = s[i]; if (n % 4 == 1) m = (n + 1) / 2; if (n % 4 == 2) m = (n + 2) / 2; if (n % 4 == 3) m = (n - 1) / 2; if (n % 4 == 0) m = n / 2; m--; m *= 6; m += n - 1; if (n % 4 == 0) m -= 2; if (n % 4 == 3) m -= 2; if (c == f ) m++; if (c == e ) m += 2; if (c == d ) m += 3; if (c == a ) m += 4; if (c == b ) m += 5; if (c == c ) m += 6; cout << m; }
|
#include <bits/stdc++.h> using namespace std; int n, m; vector<pair<int, int> > H; vector<int> Ans[1000010]; int S[1000010]; int main() { scanf( %d%d , &n, &m), H.resize(m); int tot = 0; for (int i = 0; i < m; i++) scanf( %d , &H[i].first), tot += H[i].first, H[i].second = i + 1; if (tot % n != 0) H[0].first += n - tot % n, tot += n - tot % n; int k = tot / n, tmpk = k; printf( %d n , k); sort(H.begin(), H.end()); int detert = 0; for (int cnt = 0, t = 0;; cnt++) { while (t != H.size() && H[t].first == 0) t++; if (t == H.size()) break; if (H.back().first >= n) { for (int j = detert + 1; j <= m; j++) Ans[j].push_back(H.back().second); H.back().first -= n; pair<int, int> tmp = H.back(); for (int j = (int)H.size() - 2; j >= t - 1; j--) if (j != t - 1 && H[j] > tmp) H[j + 1] = H[j]; else { H[j + 1] = tmp; break; } k--; continue; } int mn = H[t].first; S[++detert] = mn; n -= mn; for (int i = t, s = k; s; i++) if (H[i].first >= mn) { H[i].first -= mn; Ans[detert].push_back(H[i].second); if (!--s) break; } } if (n) { S[++detert] = n; } for (int i = 1; i <= m; i++) printf( %d , S[i]); putchar( n ); for (int i = 0; i < tmpk; i++) { for (int j = 1; j <= m; j++) if (Ans[j].size() > i) printf( %d , Ans[j][i]); else printf( 1 ); putchar( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, K; vector<int> A; bool check(long long sum, long long temp, long long x) { long long t = (sum - K) / x; return t < temp; } int main() { cin >> N >> K; A.resize(N); int nn = N; long long sum = 0, x, j = 0; for (int i = 0; i < nn; i++) { cin >> x; ++j; if (check(sum, (j - 1) * (N - j), x)) { cout << i + 1 << endl; --N; --j; } else { sum += (j - 1) * x; } } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; unsigned long long int gcd(unsigned long long int a, unsigned long long int b) { if (b == 0) return a; a %= b; return gcd(b, a); } unsigned long long int power(unsigned long long int x, unsigned long long int y, unsigned long long int md = 998244353) { unsigned long long int res = 1; x %= md; while (y > 0) { if (y & 1) res = (res * x) % md; x = (x * x) % md; y = y >> 1; } return res % md; } bool sortbysec(const pair<unsigned long long int, unsigned long long int> &a, const pair<unsigned long long int, unsigned long long int> &b) { return (a.second < b.second); } unsigned long long int len(unsigned long long int v) { unsigned long long int len = 0; while (v > 0) { v /= 10; len++; } return len; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); unsigned long long int n; cin >> n; unsigned long long int arr[n], temp; map<unsigned long long int, unsigned long long int> make_pair; for (unsigned long long int i = 0; i < n; i++) { cin >> arr[i]; temp = len(arr[i]); make_pair[temp]++; } map<unsigned long long int, unsigned long long int>::iterator it; unsigned long long int maxx = 0, cnt = 0; for (it = make_pair.begin(); it != make_pair.end(); it++) { if (it->first > maxx) maxx = it->first; cnt++; } unsigned long long int sum = 0; unsigned long long int brr[20], crr[20]; for (unsigned long long int i = 0; i < n; i++) { memset(brr, 0, sizeof(brr)); memset(crr, 0, sizeof(crr)); string c = ; unsigned long long int temp = arr[i], temp2; while (temp > 0) { temp2 = temp % 10; temp /= 10; c += (char)(48 + temp2); } string temp3 = c, temp4; for (unsigned long long int j = 0; j < c.length(); j++) { temp3.insert(j * 2, 0 ); temp4 = temp3; reverse(temp4.begin(), temp4.end()); unsigned long long int tt = 0; for (unsigned long long int k = 0; k < temp4.length(); k++) { tt *= 10; tt += temp4[k] - 0 ; } brr[j + 1] = tt; } for (unsigned long long int i = 1; i < 20; i++) { crr[i - 1] = brr[i] / 10; } for (unsigned long long int i = 1; i < 20; i++) { if (brr[i] == 0) brr[i] = brr[i - 1]; if (crr[i] == 0) crr[i] = crr[i - 1]; } it = make_pair.begin(); while (it != make_pair.end()) { sum += (((it->second) % 998244353) * (brr[it->first] % 998244353)) % 998244353; sum %= 998244353; sum += (((it->second) % 998244353) * (crr[it->first] % 998244353)) % 998244353; sum %= 998244353; it++; } } cout << sum % 998244353 << n ; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.