func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int a, b, c; int main() { cin >> a >> b >> c; int ans = 0; for (int i = 0; i <= c; i += a) { if ((c - i) % b == 0) ans++; } if (ans == 0) cout << No ; else cout << Yes ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxint = -1u >> 2; const double eps = 1e-6; const int MAX = 100001; int CA[MAX]; int CB[MAX]; int main() { int N; cin >> N; int ans = N + 1; if (N == 1 || N == 2) { cout << 0 << endl; return 0; } vector<int> A(N); vector<int> B(N); map<int, int> MA; map<int, int> MB; int half = N / 2; if (N % 2) half += 1; for (int i = 0; i < N; ++i) { int a, b; cin >> a >> b; if (a != b) { MB[b] = MB[b] + 1; } MA[a] = MA[a] + 1; if (MA[a] >= half) { cout << 0 << endl; return 0; } if (MB[b] >= half) { ans = min(ans, MB[b]); } } for (map<int, int>::iterator itr = MA.begin(); itr != MA.end(); ++itr) { if (itr->second + MB[itr->first] >= half) { ans = min(ans, half - itr->second); } } if (ans == N + 1) { cout << -1 << endl; } else cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 7; int n, m, comp[N], y, spre[N]; bool vis[N]; vector<int> g[N], ig[N], ord, rep[N]; set<int> sgn[N]; void dfs1(int a) { vis[a] = 1; for (auto &b : g[a]) { if (!vis[b]) { dfs1(b); } } ord.push_back(a); } void dfs2(int a) { rep[y].push_back(a); comp[a] = y; for (auto &b : ig[a]) { if (!comp[b]) { dfs2(b); } } } int este(int i, int j) { cout << ? << i << << j << endl; int r; cin >> r; return r; } int main() { cin >> n >> m; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; g[x].push_back(y); ig[y].push_back(x); } for (int i = 1; i <= n; i++) { if (!vis[i]) { dfs1(i); } } reverse(ord.begin(), ord.end()); for (auto &i : ord) { if (comp[i] == 0) { y++; dfs2(i); } } for (int i = 1; i <= n; i++) for (auto &j : g[i]) if (comp[i] != comp[j]) sgn[comp[i]].insert(comp[j]); n = y; for (int i = 1; i <= n; i++) { g[i].clear(); for (auto &j : sgn[i]) { g[i].push_back(j); spre[j]++; } } vector<int> stk; for (int i = 1; i <= n; i++) { if (!spre[i]) stk.push_back(i); } int ret = stk[0]; while ((int)stk.size() > 1) { int now = stk.back(); while ((int)rep[now].size() > 0 && (int)rep[ret].size() > 0) { int x = rep[now].back(), y = rep[ret].back(); if (este(x, y)) rep[ret].pop_back(); else rep[now].pop_back(); } if (rep[ret].empty()) { swap(stk.back(), stk[0]); swap(ret, now); } stk.pop_back(); for (auto &j : g[now]) { spre[j]--; assert(spre[j] >= 0); if (!spre[j]) { stk.push_back(j); } } } cout << ! << rep[ret].back() << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; bool func(int x) { int cnt = 0; while (x != 0) { x = x / 10; cnt++; } if (cnt == 1) return true; else if (cnt == 2) return false; else if (cnt == 0) return true; } int main() { int h1, h2, m1, m2; int h, m, temp; char ch; cin >> h1; cin >> ch; cin >> m1; cin >> h2; cin >> ch; cin >> m2; int dh, dm, t; dh = h2 - h1; dm = m2 - m1; if (dm == 0) { float g = (double)dh / 2; g *= 60; if (g >= 60) { int ho = g / 60; int mi = (long long)g % 60; h = h1 + ho; m = mi + m1; } else { m = m1 + g; if (m >= 60) { h = h1 + (m / 60); m = m % 60; } else h = h1; } } else if (dh == 0) { h = h1; m = m1 + dm / 2; } else { if (dm < 0) { --dh; t = dh + (60 - m1) + m2; } else { dh; t = dh * 60 + (m2 - m1); } t = t / 2; if (t + m1 >= 60) { int u = h1 + t / 60; int left = t % 60; if (m1 + left >= 60) { ++u; m = (left - (60 - m1)); } else m = m1 + left; h = u; } else { h = h1; m = m1 + t; } } if (func(h) == true && func(m) == true) { cout << 0 << h << : << 0 << m << endl; } else if (func(h) && !func(m)) { cout << 0 << h << : << m << endl; } else if (!func(h) && func(m)) { cout << h << : << 0 << m << endl; } else cout << h << : << m << endl; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:40000000 ) using namespace std; const double EPS = 1e-10; const double PI = acos(-1.0); const int mod = 1000000007; const int MAXN = 200 * 200; int a[111]; int n; int main() { cin >> n; bool p = 1; for (int(i) = (0); (i) < (n); ++(i)) { int x; cin >> x; a[x]++; if (x == 25) continue; if (x == 50) { a[25]--; if (a[25] < 0) p = 0; } if (x == 100) { if (a[50] && a[25]) { a[50]--; a[25]--; } else { a[25] -= 3; if (a[25] < 0) p = 0; } } } if (p) cout << YES << endl; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; void Append(const string& w, string& a) { a += w; a += , ; } bool IsNumber(const string& w) { for (char c : w) { if (!isdigit(c)) return false; } return !w.empty() && (w == 0 || w[0] != 0 ); } void Process(const string& s, int start, int end, string& a, string& b) { assert(end - start + 1 >= 0); const string w = s.substr(start, end - start + 1); if (IsNumber(w)) { Append(w, a); } else { Append(w, b); } } void Output(string& s) { if (s.empty()) cout << - n ; else cout << << s.substr(0, s.size() - 1) << n ; } int main() { string s; cin >> s; s += , ; string a, b; int start = 0; for (int i = 0; i < (int)s.size(); ++i) { if (s[i] == ; || s[i] == , ) { Process(s, start, i - 1, a, b); start = i + 1; } } Output(a); Output(b); }
|
#include <bits/stdc++.h> using namespace std; long long f(long long x) { int num = 0; for (int i = 1; 1ll * i * i <= x; i++) { if (x % i) continue; num++; if (1ll * i * i != x) num++; } return num; } long long solve(vector<int> v) { int n = v.size(); long long num = 1ll * v[0] * v[n - 1]; for (int i = 1; i < n / 2 + (n % 2); i++) { long long cur = 1ll * v[i] * v[n - i - 1]; if (cur != num) return -1; } if (f(num) != n + 2) return -1; return num; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); cout << solve(a) << endl; } return 0; }
|
#include <bits/stdc++.h> const int N = 1000005; using namespace std; long long n, k, sum, q, res, m, val, ans; long long x, y; double p; long long xx[] = {1, 0, -1, 0}; long long yy[] = {0, 1, 0, -1}; void solve(long long no) { cin >> n; long long res = 0; vector<long long> v[64]; for (int i = 0; i < n; i++) { cin >> x; res ^= x; for (int j = 0; j < 64; j++) if (x & (1LL << j)) v[j].push_back(i); } if (res == 0) { cout << DRAW n ; return; } vector<long long> v1; for (int j = 63; j >= 0; j--) { if (v[j].size() % 4 == 1) { cout << WIN n ; return; } else if (v[j].size() % 4 == 3) { if ((n - v[j].size()) % 2) cout << WIN n ; else cout << LOSE n ; return; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; for (long long i = 1; i <= t; i++) solve(i); }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; int sz = n + m - 2; int mid = sz / 2; int x; vector<pair<int, int>> a(mid + 1, {0, 0}); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> x; int id = i + j; if (id > mid) { id = sz - id; } if (x == 0) { a[id].first++; } else { a[id].second++; } } } int ans = 0; int ma = a.size(); if (sz % 2 == 0) { ma--; } for (int i = 0; i < ma; i++) { ans += min(a[i].first, a[i].second); } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; for (int i = 0; i < t; i++) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, t, last; int f[6005][6005]; inline void dfs(int x, int y, int o) { f[x][y] += o; int O = f[x][y]; f[x][y] %= 4; if (O < 4) return; dfs(x, y + 1, O / 4); dfs(x, y - 1, O / 4); dfs(x + 1, y, O / 4); dfs(x - 1, y, O / 4); } int main() { scanf( %d%d , &n, &t); dfs(2500, 2500, n); for (int i = 1; i <= t; i++) { int x, y; scanf( %d%d , &x, &y); x += 2500, y += 2500; if (x > 5000 || y > 5000 || x < 0 || y < 0) { printf( 0 n ); continue; } printf( %d n , f[x][y]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void chkmax(T &x, T y) { x = x > y ? x : y; } template <typename T> void chkmin(T &x, T y) { x = x > y ? y : x; } template <typename T> void update(T &x, T y, T mod) { x = x + y > mod ? x + y - mod : x + y; } template <typename T> void multi(T &x, T y, T mod) { x = 1ll * x * y % mod; } const int INF = (1ll << 30); template <typename T> void read(T &x) { x = 0; bool f = 1; char ch; do { ch = getchar(); if (ch == - ) f = 0; } while (ch > 9 || ch < 0 ); do { x = x * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); x = f ? x : -x; } template <typename T> void write(T x) { if (x < 0) x = ~x + 1, putchar( - ); if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } const int N = 1e5 + 7; struct Segment_Tree { int l, r, sum, rem, mul, fac[20]; } t[N << 2]; int n, m, mod, cnt, tot, phi, a[N], P[N], tmp[N], prime[N]; bool vis[N]; inline int calc(int x) { for (int i = 1; i <= tot; i++) { tmp[i] = 0; while (x % P[i] == 0) { x /= P[i]; tmp[i]++; } } return x; } inline int qpow(int a, int b) { long long ret = 1; while (b) { if (b & 1) ret = 1ll * ret * a % mod; a = 1ll * a * a % mod; b >>= 1; } return ret % mod; } inline void mul(int p, int mul, int rem, int *tmp) { multi(t[p].rem, rem, mod); for (int i = 1; i <= tot; i++) t[p].fac[i] += tmp[i]; multi(t[p].sum, mul, mod); multi(t[p].mul, mul, mod); } inline void divide(int p, int y, int *tmp) { multi(t[p].rem, qpow(y, phi - 1), mod); int tp = t[p].rem; for (int i = 1; i <= tot; i++) { t[p].fac[i] -= tmp[i]; multi(tp, qpow(P[i], t[p].fac[i]), mod); } t[p].sum = tp % mod; } inline void pushdown(int p) { if (t[p].mul != 1 || t[p].rem != 1) { mul((p << 1), t[p].mul, t[p].rem, t[p].fac); mul((p << 1 | 1), t[p].mul, t[p].rem, t[p].fac); t[p].mul = t[p].rem = 1; for (int i = 1; i <= tot; i++) t[p].fac[i] = 0; } } inline void build(int p, int l, int r) { t[p].l = l; t[p].r = r; t[p].mul = t[p].rem = 1; if (l == r) { t[p].sum = a[l] % mod; t[p].rem = calc(a[l]); for (int i = 1; i <= tot; i++) t[p].fac[i] = tmp[i]; return; } pushdown(p); int mid = (t[p].l + t[p].r) >> 1; build((p << 1), l, mid); build((p << 1 | 1), mid + 1, r); t[p].sum = (t[(p << 1)].sum + t[(p << 1 | 1)].sum) % mod; } inline void multi(int p, int l, int r, int x, int k, int *tmp) { if (l <= t[p].l && t[p].r <= r) { mul(p, k, x, tmp); return; } pushdown(p); int mid = (t[p].l + t[p].r) >> 1; if (l <= mid) multi((p << 1), l, r, x, k, tmp); if (r > mid) multi((p << 1 | 1), l, r, x, k, tmp); t[p].sum = (t[(p << 1)].sum + t[(p << 1 | 1)].sum) % mod; } inline void divide(int p, int x, int y, int *tmp) { if (t[p].l == t[p].r) { divide(p, y, tmp); return; } pushdown(p); int mid = (t[p].l + t[p].r) >> 1; if (x <= mid) divide((p << 1), x, y, tmp); else divide((p << 1 | 1), x, y, tmp); t[p].sum = (t[(p << 1)].sum + t[(p << 1 | 1)].sum) % mod; } inline int query(int p, int l, int r) { if (l <= t[p].l && t[p].r <= r) return t[p].sum; pushdown(p); int mid = (t[p].l + t[p].r) >> 1, ans = 0; if (l <= mid) update(ans, query((p << 1), l, r), mod); if (r > mid) update(ans, query((p << 1 | 1), l, r), mod); return ans; } inline void init(int NN) { for (int i = 2; i <= NN; i++) { if (!vis[i]) { prime[++cnt] = i; } for (int j = 1; j <= cnt && prime[j] * i <= NN; j++) { vis[i * prime[j]] = true; if (i % prime[j] == 0) break; } } } inline int getphi(int x) { int ans = x; for (int i = 1; i <= cnt && prime[i] * prime[i] <= x; i++) { if (x % prime[i] == 0) { ans = 1ll * ans * (prime[i] - 1) / prime[i]; while (x % prime[i] == 0) x /= prime[i]; } } if (x != 1) ans = 1ll * ans * (x - 1) / x; return ans; } inline void divide(int x) { for (int i = 1; i <= cnt && prime[i] * prime[i] <= x; i++) { if (x % prime[i] == 0) { while (x % prime[i] == 0) x /= prime[i]; P[++tot] = prime[i]; } } if (x != 1) P[++tot] = x; } int main() { read(n); read(mod); init(1e5); divide(mod); phi = getphi(mod); for (int i = 1; i <= n; i++) read(a[i]); build(1, 1, n); read(m); for (int i = 1, opt, l, r, x; i <= m; i++) { read(opt); if (opt == 1) { read(l); read(r); read(x); multi(1, l, r, calc(x), x, tmp); } if (opt == 2) { read(l); read(x); divide(1, l, calc(x), tmp); } if (opt == 3) { read(l); read(r); printf( %d n , query(1, l, r) % mod); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a, b, h[15], side = 0, dsh[15], cent = 52; vector<int> sshot, cshot; void recur(int now, int tot) { if (now == n - 1) { int ok = 1; for (int i = 1; i < n - 1; i++) if (dsh[i] * a + dsh[i - 1] * b + dsh[i + 1] * b <= h[i]) { ok = 0; break; } if (ok == 1 && tot < cent) { cent = tot; cshot.clear(); for (int i = 1; i < n - 1; i++) for (int j = 0; j < dsh[i]; j++) cshot.push_back(i); } return; } if (tot >= cent) return; for (int i = 0; i <= 8; i++) { dsh[now] = i; recur(now + 1, tot + i); } } int main() { scanf( %d%d%d , &n, &a, &b); for (int i = 0; i < n; i++) { scanf( %d , &h[i]); } while (h[0] >= 0) { h[0] -= b; h[2] -= b; h[1] -= a; side++; sshot.push_back(1); } while (h[n - 1] >= 0) { h[n - 1] -= b; h[n - 3] -= b; h[n - 2] -= a; side++; sshot.push_back(n - 2); } memset(dsh, 0, sizeof(dsh)); recur(1, 0); printf( %d n , cent + side); printf( %d , sshot[0] + 1); for (int i = 1; i < sshot.size(); i++) printf( %d , sshot[i] + 1); for (int i = 0; i < cshot.size(); i++) printf( %d , cshot[i] + 1); printf( n ); }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<int> v(n); for (long long i = 0; i < n; i++) cin >> v[i]; ; vector<int> u(n); for (long long i = 0; i < n; i++) cin >> u[i]; ; sort((v).begin(), (v).end()); sort((u).begin(), (u).end()); bool turn = 0; long long a = 0LL, b = 0LL; while (!v.empty() || !u.empty()) { if (!turn) { if (v.back() >= u.back()) { if (!v.empty()) { a += v.back(); v.pop_back(); } else if (!u.empty()) { u.pop_back(); } else { break; } } else { if (!u.empty()) { u.pop_back(); } else if (!v.empty()) { a += v.back(); v.pop_back(); } else { break; } } turn = 1; } else { if (u.back() >= v.back()) { if (!u.empty()) { b += u.back(); u.pop_back(); } else if (!v.empty()) { v.pop_back(); } else { break; } } else { if (!v.empty()) { v.pop_back(); } else if (!u.empty()) { b += u.back(); u.pop_back(); } else { break; } } turn = 0; } } cout << a - b << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); int l = (n - 1) / m; if ((n - 1) % m == 0) printf( %d n , 2 * l); else printf( %d n , 2 * l + 1 + ((n - 1) % m >= 2)); int need = (n - 1) % m; for (int i = 2; i <= n;) { int maxn = min(n, i + l - 1 + (need-- > 0)); printf( %d %d n , 1, i); int j = i; while (j++ < maxn) printf( %d %d n , j - 1, j); i = maxn + 1; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int Int() { int x; scanf( %d , &x); return x; } long long Long() { long long x; scanf( %lld , &x); return x; } void err(istream_iterator<string> it) { cout << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << ; err(++it, args...); } const int N = (int)2e5 + 5; const int maxN = (int)1e6 + 6; const long long Mod = (long long)1e9 + 7; const int inf = (int)2e9; const long long Inf = (long long)1e18; struct lowest_common_ancestor { const static int N = 1e5 + 5; const static int k = 17; int par[N][k + 1], lev[N]; vector<vector<int>> g, city; vector<int> ID[N][k + 1]; lowest_common_ancestor() { for (int i = 0; i < N; ++i) { for (int j = 0; j <= k; ++j) par[i][j] = 0; lev[i] = 0; } } vector<int> merge(vector<int> &a, vector<int> &b) { vector<int> tmp; auto i = a.begin(), j = b.begin(); for (int k = 1; k <= min(10, (int)a.size() + (int)b.size()); ++k) { if (i != a.end() and j != b.end()) { if (*i < *j) tmp.push_back(*i), ++i; else tmp.push_back(*j), ++j; } else if (i != a.end()) tmp.push_back(*i), ++i; else tmp.push_back(*j), ++j; } return tmp; } void build(int s, int p = 0) { lev[s] = 1 + lev[p]; par[s][0] = p; ID[s][0].assign(city[p].begin(), city[p].end()); for (int i = 1; i <= k; ++i) { par[s][i] = par[par[s][i - 1]][i - 1]; ID[s][i] = merge(ID[s][i - 1], ID[par[s][i - 1]][i - 1]); } for (int i : g[s]) if (i != p) build(i, s); } void getLCA(int a, int b, int num) { if (lev[a] < lev[b]) swap(a, b); vector<int> res(city[a].begin(), city[a].end()); int d = lev[a] - lev[b]; int t = b; for (int i = k; i >= 0; --i) { if ((d >> i) & 1) { res = merge(res, ID[a][i]); a = par[a][i]; } } if (a == b) { printf( %d , min((int)res.size(), num)); for (int i = 0; i < min(num, (int)res.size()); ++i) printf( %d , res[i]); cout << n ; return; } for (int i = k; i >= 0; --i) { if (par[a][i] != par[b][i]) { res = merge(res, ID[a][i]); res = merge(res, ID[b][i]); b = par[b][i]; a = par[a][i]; } } res = merge(res, city[par[a][0]]); res = merge(res, city[t]); printf( %d , min((int)res.size(), num)); for (int i = 0; i < min(num, (int)res.size()); ++i) printf( %d , res[i]); cout << n ; return; } void solve() { int n = Int(), m = Int(), q = Int(); g.resize(n + 1); city.resize(n + 1); for (int i = 1; i < n; ++i) { int x = Int(), y = Int(); g[x].emplace_back(y); g[y].emplace_back(x); } for (int i = 1; i <= m; ++i) { int c = Int(); city[c].emplace_back(i); } for (int i = 1; i <= n; ++i) { sort(city[i].begin(), city[i].end()); while ((int)city[i].size() > 10) city[i].pop_back(); } build(1); while (q--) { int l = Int(), r = Int(), t = Int(); getLCA(l, r, t); } } }; lowest_common_ancestor lca; int main() { int test = 1, tc = 0; while (test--) { lca.solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int t; char a[9][9]; int dx[4] = {2, 2, -2, -2}, dy[4] = {2, -2, 2, -2}; int b[9][9]; int c[9][9]; int dem1, dem2; int kt; void ktrak1(int x, int y) { int h, k; dem1++; for (int i = 0; i <= 3; i++) { h = x + dx[i]; k = y + dy[i]; if (h >= 1 && h <= 8 && k >= 1 && k <= 8 && b[h][k] == 1) { b[h][k] = 0; ktrak1(h, k); } } } void ktrak2(int x, int y) { int h, k; dem2++; for (int i = 0; i <= 3; i++) { h = x + dx[i]; k = y + dy[i]; if (h >= 1 && h <= 8 && k >= 1 && k <= 8 && c[h][k] == 1) { c[h][k] = 0; ktrak2(h, k); } } } int main() { cin >> t; while (t) { t--; kt = 0; dem1 = dem2 = 0; int x1 = 0, y1 = 0; int x2 = 0, y2 = 0; for (int i = 1; i <= 8; i++) { for (int j = 1; j <= 8; j++) { cin >> a[i][j]; c[i][j] = b[i][j] = 1; if (a[i][j] == K ) { if (x1 == 0) { x1 = i; y1 = j; } else { x2 = i; y2 = j; } } } } b[x1][y1] = 0; ktrak1(x1, y1); c[x2][y2] = 0; ktrak2(x2, y2); for (int i = 1; i <= 8; i++) { for (int j = 1; j <= 8; j++) { if (b[i][j] == c[i][j] && c[i][j] == 0 && a[i][j] != # ) { kt = 1; break; } } if (kt == 1) break; } if ((abs(x1 - x2) % 4) != 0 || (abs(y1 - y2) % 4) != 0) { kt = 0; } if (kt == 0) cout << NO n ; else cout << YES n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; const int inf = 0x3f3f3f3f; int A[maxn]; int n, k; void solve(int l, int r) { if (l + 1 == r || !k) return; int mid = (l + r) >> 1; k -= 2; swap(A[mid], A[mid - 1]); solve(l, mid); solve(mid, r); } int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) A[i] = i + 1; k--; if (k & 1) { puts( -1 ); return 0; } solve(0, n); if (k) puts( -1 ); else { for (int i = 0; i < n; i++) printf( %d , A[i]); puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Imx = 2147483647; const long long Lbig = 2e18; const int mod = 1e9 + 7; struct fastio { char s[100000]; int it, len; fastio() { it = len = 0; } inline char get() { if (it < len) return s[it++]; it = 0; len = fread(s, 1, 100000, stdin); if (len == 0) return EOF; else return s[it++]; } bool notend() { char c = get(); while (c == || c == n ) c = get(); if (it > 0) it--; return c != EOF; } } _buff; inline long long getnum() { long long r = 0; bool ng = 0; char c; c = _buff.get(); while (c != - && (c < 0 || c > 9 )) c = _buff.get(); if (c == - ) ng = 1, c = _buff.get(); while (c >= 0 && c <= 9 ) r = r * 10 + c - 0 , c = _buff.get(); return ng ? -r : r; } template <class T> inline void putnum(T x) { if (x < 0) putchar( - ), x = -x; register short a[20] = {}, sz = 0; while (x) a[sz++] = x % 10, x /= 10; if (sz == 0) putchar( 0 ); for (int i = sz - 1; i >= 0; i--) putchar( 0 + a[i]); } inline char getreal() { char c = _buff.get(); while (c == || c == n ) c = _buff.get(); return c; } int n; int ask(int x, int y) { printf( ? %d %d n , x, y); fflush(stdout); int ans; scanf( %d , &ans); return ans; } int a[5011], b[5011]; int A[5011], B[5011]; bool hs[5011]; int tans[5011]; bool check() { memset(hs, 0, sizeof(hs)); for (int i = 0; i < n; i++) { if (A[i] < 0 || A[i] >= n || hs[A[i]]) return false; hs[A[i]] = 1; } memset(hs, 0, sizeof(hs)); for (int i = 0; i < n; i++) { if (B[i] < 0 || B[i] >= n || hs[B[i]]) return false; hs[B[i]] = 1; } for (int i = 0; i < n; i++) { if (A[B[i]] != i) return false; } return true; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { a[i] = ask(i, 0); } for (int i = 0; i < n; i++) { b[i] = ask(0, i); } int cnt = 0; for (int i = 0; i < n; i++) { A[0] = i; B[0] = A[0] ^ a[0]; for (int j = 1; j < n; j++) { A[j] = A[0] ^ a[0] ^ a[j]; B[j] = B[0] ^ b[0] ^ b[j]; } if (check()) { cnt++; for (int j = 0; j < n; j++) tans[j] = A[j]; } } printf( ! n ); printf( %d n , cnt); for (int i = 0; i < n; i++) printf( %d%c , tans[i], i + 1 < n ? : n ); fflush(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; const long long M = 1e9 + 7; const long long inf = 1e18 + 5; vector<int> prefix_function(string &s) { int n = s.size(); vector<int> pre(n); int pos = 0; pre[0] = 0; for (int i = 1; i < n; i++) { while (pos and s[pos] != s[i]) pos = pre[pos - 1]; if (s[pos] == s[i]) pos++; pre[i] = pos; } return pre; } int main() { string s, t; cin >> t >> s; int n = s.size(); vector<int> pre = prefix_function(s); int a[n][26]; for (int i = 0; i < n; i++) { for (int c = 0; c < 26; c++) { if (i and s[i] != a + c) a[i][c] = a[pre[i - 1]][c]; else a[i][c] = i + (s[i] == a + c); } } int tz = t.size(); int dp[tz + 1][n]; memset(dp, -1, sizeof(dp)); dp[0][0] = 0; for (int i = 0; i < tz; i++) { for (int j = 0; j < n; j++) { if (dp[i][j] != -1) { if (t[i] == ? ) { for (int ch = 0; ch < 26; ch++) { int val = a[j][ch]; if (val == n) dp[i + 1][pre[n - 1]] = max(dp[i + 1][n - 1], dp[i][j] + 1); else dp[i + 1][val] = max(dp[i + 1][val], dp[i][j]); } } else { int val = a[j][t[i] - a ]; if (val == n) dp[i + 1][pre[n - 1]] = max(dp[i + 1][n - 1], dp[i][j] + 1); else dp[i + 1][val] = max(dp[i + 1][val], dp[i][j]); } } } } int ans = 0; for (int i = 0; i < n; i++) ans = max(ans, dp[tz][i]); printf( %d , ans); }
|
#include <bits/stdc++.h> using namespace std; int test, n; long long f[2000001][2]; const int P = 1000000007; int main() { memset(f, 0, sizeof(f)); f[3][0] = 0; f[3][1] = 4; for (int i = 4; i <= 2000000; i++) f[i][0] = max(f[i - 1][0], f[i - 1][1]) + max(f[i - 2][0], f[i - 2][1]) * 2, f[i][0] %= P, f[i][1] = 4 + f[i - 1][0] + 2 * f[i - 2][0], f[i][1] %= P; scanf( %d , &test); for (; test--;) { scanf( %d , &n); printf( %lld n , max(f[n][0], f[n][1])); } }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = 1000001000; const long long INFLL = INF * 1LL * INF; const int mod = 1000 * 1000 * 1000 + 7; const int mod9 = 1000 * 1000 * 1000 + 9; const int modr = 99990001; const long double PI = 3.1415926535897932385; template <class T> void zero(T val, T& first) { first = val; } template <class T, class... Targs> void zero(T val, T& first, Targs&... Fargs) { first = val; zero(val, Fargs...); } template <class T, class T2> std::istream& operator>>(std::istream& is, pair<T, T2>& p) { return is >> p.first >> p.second; } template <class T> std::istream& readN(T& first, int n, int st = 0) { for (int i = st, iend = (st + n - 1); i <= iend; i++) cin >> first[i]; return cin; } template <class T> std::istream& readS(set<T>& first, int n) { T second = *first.rbegin(); for (int i = 0, iend = (n - 1); i <= iend; i++) { cin >> second; first.insert(second); } return cin; } template <class T> std::istream& read(T& first) { return cin >> first; } template <class T, class... Targs> std::istream& read(T& first, Targs&... Fargs) { return read(first), read(Fargs...); } template <class T, class T2> std::ostream& operator<<(std::ostream& os, pair<T, T2> p) { return os << p.first << << p.second; } template <class T> std::ostream& operator<<(std::ostream& os, vector<T> v) { bool f = true; for (auto second : v) { if (!f) os << ; os << second; f = false; } return os; } template <class T> std::ostream& operator<<(std::ostream& os, set<T> v) { bool f = true; for (auto second : v) { if (!f) os << ; os << second; f = false; } return os; } template <class T> std::ostream& operator<<(std::ostream& os, multiset<T> v) { bool f = true; for (auto second : v) { if (!f) os << ; os << second; f = false; } return os; } template <class T, class T2> std::ostream& operator<<(std::ostream& os, map<T, T2> v) { bool f = true; for (pair<T, T2> second : v) { if (!f) os << ; os << second.first << => << second.second; f = false; } return os; } template <class T> std::ostream& outV(T first, char del = ) { bool f = true; for (auto second : first) { if (!f) cout << del; cout << second; f = false; } return cout; } template <class T> std::ostream& outN(T first, int n = -1, int st = 0) { for (int i = st, iend = (n == -1 ? (int)first.size() - 1 : st + n - 1); i <= iend; i++) { cout << first[i]; if (i < iend) cout << ; } return cout; } template <class T> std::ostream& outAN(T first, int n = -1, int st = 0) { for (int i = st, iend = (n - 1); i <= iend; i++) { cout << first[i]; if (i < iend) cout << ; } return cout; } template <class T> std::ostream& outA2(T first, int n, int m) { for (int i = 0, iend = (n - 1); i <= iend; i++) { for (int j = 0, jend = (m - 1); j <= jend; j++) cout << first[i][j] << (j == m - 1 ? n : ); } return cout; } template <class T> std::ostream& out(T first) { return cout << first; } template <class T, class... Targs> std::ostream& out(T first, Targs... Fargs) { return out(first) << , out(Fargs...); } template <typename T> void srt(T& a, int st, int fn, bool isArr) { sort(a + st, a + fn + 1); } template <class T> void srt(T& a, int st = 0, int fn = 0) { sort(a.begin() + st, fn ? a.begin() + fn + 1 : a.end()); } template <typename T> T rev_num(T a) { T r = 0; for (; a; a /= 10) r = r * 10 + a % 10; return r; } template <typename T> void rev(T& a, int st, int fn, bool isArr) { reverse(a + st, a + fn + 1); } template <class T> void rev(T& a, int st = 0, int fn = 0) { reverse(a.begin() + st, fn ? a.begin() + fn + 1 : a.end()); } long long sqr(long long a) { return a * a; }; long long sqr(int a) { return a * 1LL * a; }; long double sqr(long double a) { return a * a; }; long long phi(int n) { int res = n; for (long long i = 2; i * i <= n; i++) if (n % i == 0) { while (n % i == 0) n /= i; res -= res / i; } if (n > 1) res -= res / n; return res; } long long bpm(long long a, long long n = -2, long long m = mod) { n = n < 0 ? n + m : n; long long r = 1; while (n) { if (n & 1) r = (r * a) % m; a = (a * a) % m; n >>= 1; } return r; } unsigned long long gcd(unsigned long long a, unsigned long long b) { while (b) { a %= b; swap(a, b); } return a; } vector<int> ero_p, ero_l; void ero(int n) { ero_l.resize(n + 1); ero_l[0] = -1; for (int i = 2, iend = (n); i <= iend; i++) if (!ero_l[i]) { ero_p.push_back(i); ero_l[i] = i; for (long long j = i * 1LL * i; j <= n; j += i) { ero_l[j] = i; } } } long long gcd_cb(long long a, long long b, long long& first, long long& second) { if (!b) { first = 1; second = 0; return a; } long long x1, y1, g; g = gcd_cb(b, a % b, x1, y1); first = y1; second = x1 - a / b * y1; return g; } vector<long long> fact; void fact_prec(int n = 20) { fact.resize(n + 1); fact[0] = 1; for (int i = 1, iend = (n); i <= iend; i++) { fact[i] = fact[i - 1] * i; } } vector<long double> factd; void fact_precd(int n = 146) { factd.resize(n + 1); factd[0] = 1; for (int i = 1, iend = (n); i <= iend; i++) { factd[i] = factd[i - 1] * i; } } string str(long long a) { string r = ; for (; a; a /= 10) r += a % 10 + 0 ; rev(r); return r; } const int N = 200005; void solution() { long long n, first, second; read(n, first, second); string s; read(s); int pv = -1; long long res = 0; for (int i = 0, iend = (n - 1); i <= iend; i++) { if (s[i] == 0 ) { if (pv + 1 < i && pv != -1) { res += min(first, second); } pv = i; } } res += pv == -1 ? 0LL : second; out(res) << n ; } int main() { ios::sync_with_stdio(false); solution(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int N = 1e5 + 10; string a; int main() { int n; while (~scanf( %d , &n)) { map<string, int> q; q.clear(); int num = 0; for (int i = 0; i < n; i++) { cin >> a; q[a]++; num = max(num, q[a]); } printf( %d n , num); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, i; cin >> n; if (n == 1 || n == 2) { cout << No ; } else { cout << Yes << n ; cout << 1 << ; cout << n << n ; cout << n - 1 << ; for (i = 0; i < n - 1; i++) { cout << i + 1 << ; } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int m, n; string bs[50]; long long component[1000]; long long combo[1001][1001]; long long pseudopart[1001]; bool visited[1000]; int main() { cin >> m >> n; for (int i = 0; i < n; i++) cin >> bs[i]; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { component[i] *= 2LL; component[i] += (long long)((int)bs[j][i] - (int) 0 ); } combo[0][0] = 1; for (int i = 1; i < 1001; i++) for (int j = 0; j <= i; j++) { if (j == 0 || j == i) combo[i][j] = 1; else combo[i][j] = combo[i - 1][j] + combo[i - 1][j - 1]; combo[i][j] %= 1000000007; } pseudopart[0] = 1; pseudopart[1] = 1; for (int i = 2; i <= m; i++) { for (int j = 0; j < i; j++) { pseudopart[i] += combo[i - 1][j] * pseudopart[i - 1 - j]; pseudopart[i] %= 1000000007; } } long long ans = 1; for (int i = 0; i < m; i++) { if (visited[i]) continue; long long temp = 0; for (int j = 0; j < m; j++) if (component[j] == component[i]) { visited[j] = true; temp++; } ans *= pseudopart[temp]; ans %= 1000000007; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int maxn = 1e5 + 5; const int MAX = 314000000; int n, m; int dis[maxn], tot[maxn], sum[maxn], dp[maxn]; vector<int> have[maxn]; queue<int> q; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; class Edge { public: int from, l, dia, cur; vector<int> mons; } ed[maxn]; int main() { scanf( %d%d , &m, &n); for (int i = (1); i <= (n); ++i) dis[i] = INF; for (int i = (0); i < (m); ++i) { scanf( %d%d , &ed[i].from, &ed[i].l); for (int j = (0); j < (ed[i].l); ++j) { int v; scanf( %d , &v); if (!~v) { ++ed[i].dia; continue; } ed[i].mons.push_back(v); have[v].push_back(i); } if (!ed[i].mons.size()) { dis[ed[i].from] = min(dis[ed[i].from], ed[i].dia); } } for (int i = (1); i <= (n); ++i) if (dis[i] != INF) pq.push(make_pair(dis[i], i)); for (; !pq.empty(); pq.pop()) { int u = pq.top().second, d = pq.top().first; if (d != dis[u]) continue; for (int i = (0); i < (have[u].size()); ++i) { int id = have[u][i]; ++ed[id].cur; if (ed[id].cur == ed[id].mons.size()) { int v = ed[id].from; int w = ed[id].dia; for (int j = (0); j < (ed[id].mons.size()); ++j) { w += dis[ed[id].mons[j]]; w = min(w, MAX); } if (w < dis[v]) { dis[v] = w; pq.push(make_pair(dis[v], v)); } } } } for (int i = (0); i < (m); ++i) { bool ok = true; ed[i].cur = 0; for (int j = (0); j < (ed[i].mons.size()); ++j) ok &= (dis[ed[i].mons[j]] != INF); if (ok) ++tot[ed[i].from]; } for (int i = (1); i <= (n); ++i) if (dis[i] != INF && !tot[i]) q.push(i); for (int i = (0); i < (m); ++i) { if (!ed[i].mons.size() && dis[ed[i].from] != INF) { int w = ed[i].dia; for (int j = (0); j < (ed[i].mons.size()); ++j) { w += dis[ed[i].mons[j]]; w = min(w, MAX); } dp[ed[i].from] = max(dp[ed[i].from], w); --tot[ed[i].from]; if (!tot[ed[i].from]) { q.push(ed[i].from); } } } for (; !q.empty(); q.pop()) { int u = q.front(); for (int i = (0); i < (have[u].size()); ++i) { int id = have[u][i]; int v = ed[id].from; if (dis[v] != INF) { sum[id] += dp[u]; sum[id] = min(sum[id], MAX); ++ed[id].cur; if (ed[id].cur == ed[id].mons.size()) { dp[v] = max(dp[v], min(MAX, sum[id] + ed[id].dia)); --tot[v]; if (!tot[v]) q.push(v); } } } } for (int i = (1); i <= (n); ++i) { if (dis[i] == INF) { puts( -1 -1 ); } else { printf( %d , dis[i]); if (!tot[i]) printf( %d , dp[i]); else printf( -2 ); puts( ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int SIZE = 1e6 + 10; using namespace std; struct E { int k, c; E() {} E(int _k, int _c) : k(_k), c(_c) {} } es[4200010]; struct Flow { int n, m, dis[500010]; int qq[500010], qr, ql; vector<int> e[500010]; void init(int _n) { n = _n; m = 0; for (int i = 0; i < n; i++) e[i] = vector<int>(); } void add_edge(int a, int b, int c) { e[a].push_back(m); es[m] = E(b, c); m++; e[b].push_back(m); es[m] = E(a, 0); m++; } bool BFS() { memset(dis, -1, n * sizeof(int)); ql = qr = 0; qq[qr++] = 0; dis[0] = 0; while (ql != qr && dis[n - 1] == -1) { int p = qq[ql++]; for (__typeof((e[p]).begin()) it = (e[p]).begin(); it != (e[p]).end(); it++) { E ee = es[*it]; if (ee.c == 0 || dis[ee.k] != -1) continue; dis[ee.k] = dis[p] + 1; qq[qr++] = ee.k; } } return dis[n - 1] != -1; } long long go(int p, long long c) { if (p == n - 1) return c; long long ret = 0, tmp; for (__typeof((e[p]).begin()) it = (e[p]).begin(); it != (e[p]).end(); it++) { E &ee = es[*it]; if (ee.c == 0 || dis[p] + 1 != dis[ee.k]) continue; tmp = go(ee.k, min(c - ret, (long long)ee.c)); ret += tmp; ee.c -= tmp; es[(*it) ^ 1].c += tmp; if (ret == c) break; } if (ret == 0) dis[p] = -1; return ret; } long long maxflow() { long long ret = 0; while (BFS()) ret += go(0, 1LL << 60); return ret; } } flow; vector<int> cc[301][301], cn[301]; int need_id, an[301], xx[301], yy[301]; pair<int, int> need[1000001]; int to[301]; bool used[301]; bool match(pair<int, int> X, pair<int, int> Y) { if (X.first != Y.first && Y.first != -1) return 0; if (X.second != Y.second && Y.second != -1) return 0; return 1; } void go(int ma_id, int ma_hi, int n) { if (ma_id != 1 && ((int)(cc[ma_id][0]).size()) == 0) return; vector<pair<int, int> > qq; int oo = need_id; for (int i = ma_hi; i >= 0; i--) { if (((int)(cc[ma_id][i]).size()) == 0) { need[++need_id] = make_pair(ma_id, i); cc[ma_id][i].push_back(-need_id); qq.push_back(make_pair(ma_id, i)); } } if (need_id > n) { for (int i = 0; i < (((int)(qq).size())); ++i) cc[qq[i].first][qq[i].second].pop_back(); need_id = oo; return; } flow.init(need_id + n + 2); for (int i = (1); i < (n + 1); ++i) flow.add_edge(need_id + i, need_id + n + 1, 1); for (int i = (1); i < (need_id + 1); ++i) { flow.add_edge(0, i, 1); for (int j = (1); j < (n + 1); ++j) { if (used[j]) continue; if (match(need[i], make_pair(yy[j], xx[j]))) flow.add_edge(i, need_id + j, 1); } } if (flow.maxflow() != need_id) { need_id = oo; return; } for (int i = 0; i < flow.m; i += 2) { if (es[i].k > need_id && es[i + 1].k <= need_id && es[i].c == 0) { used[es[i].k - need_id] = 1; to[es[i + 1].k] = es[i].k - need_id; } } for (int i = (1); i < (n + 1); ++i) { for (int j = 0; j < (n); ++j) { for (int k = 0; k < (((int)(cc[i][j]).size())); ++k) { if (cc[i][j][k] < 0) cc[i][j][k] = to[-cc[i][j][k]]; } } } for (int i = (1); i < (n + 1); ++i) { if (!used[i]) { used[i] = 1; if (xx[i] == -1 && yy[i] == -1) cc[1][0].push_back(i); else if (yy[i] != -1) cc[yy[i]][1].push_back(i); else if (xx[i] != -1) { if (xx[i] == 0) cc[1][0].push_back(i); else cc[ma_id][xx[i]].push_back(i); } } } for (int i = (1); i < (n + 1); ++i) { for (int j = 0; j < (((int)(cc[i][0]).size())); ++j) { if (j % i == 0) an[cc[i][0][j]] = cc[i][0][j + i - 1]; else an[cc[i][0][j]] = cc[i][0][j - 1]; } for (int j = (1); j < (n); ++j) { for (int k = 0; k < (((int)(cc[i][j]).size())); ++k) an[cc[i][j][k]] = cc[i][j - 1][0]; } } for (int i = (1); i < (n + 1); ++i) printf( %d%c , an[i], n [i == n]); exit(0); } int main() { int(n); scanf( %d , &n); int ma_hi = -1; for (int i = (1); i < (n + 1); ++i) { char s1[20], s2[20]; scanf( %s , (s1)); scanf( %s , (s2)); int x = -1, y = -1; if (s1[0] != ? ) x = atoi(s1); if (s2[0] != ? ) y = atoi(s2); if (x != -1 && y != -1) { cc[y][x].push_back(i); used[i] = 1; } else if (y != -1) cn[y].push_back(i); xx[i] = x; yy[i] = y; ma_hi = max(ma_hi, x); } int mi = 10000, ma_id = 1; for (int i = (1); i < (n + 1); ++i) { int hi = n - 1; while (hi >= 0 && ((int)(cc[i][hi]).size()) == 0) hi--; while (hi >= 0) { if (!((int)(cc[i][hi]).size())) { need[++need_id] = make_pair(i, hi); cc[i][hi].push_back(-need_id); } hi--; } if (((int)(cn[i]).size()) && ((int)(cc[i][0]).size()) == 0) { need[++need_id] = make_pair(i, 0); cc[i][0].push_back(-need_id); } while (((int)(cc[i][0]).size()) % i) { need[++need_id] = make_pair(i, 0); cc[i][0].push_back(-need_id); } } for (int ker = 1; ker <= n; ker++) { go(ker, ma_hi, n); } return 0 * puts( -1 ); }
|
#include <bits/stdc++.h> using namespace std; template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? : ); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << ( << p.first << , << p.second << ) ; return os; } template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) { os << ( << get<0>(t) << , << get<1>(t) << , << get<2>(t) << ) ; return os; } template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) { os << ( << get<0>(t) << , << get<1>(t) << , << get<2>(t) << , << get<3>(t) << ) ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << { ; for (auto itr = m.begin(); itr != m.end();) { os << ( << itr->first << , << itr->second << ) ; if (++itr != m.end()) os << , ; } os << } ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << { ; for (auto itr = m.begin(); itr != m.end();) { os << ( << itr->first << , << itr->second << ) ; if (++itr != m.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? : ); } return os; } void debug_out() { cerr << n ; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << , ; debug_out(move(tail)...); } template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = { D , R , U , L }; const long long MOD = 1000000007; vector<bool> binary_conversion(const string& s) { using u64 = uint64_t; vector<u64> num(s.size() / 9 + 10, 0); for (size_t i = 0; i < s.size(); i += 9) { const string t = s.substr(i, 9); u64 add = 0, mul = 1; for (const auto c : t) { add = add * 10 + (c - 0 ); mul *= 10; } for (auto& d : num) { d = d * mul + add; add = d >> 32; d -= add << 32; } } vector<bool> res(num.size() * 32); for (size_t i = 0; i < num.size(); i++) { for (size_t j = 0; j < 32; j++) { res[i * 32 + j] = num[i] >> j & 1; } } while (!res.empty() && !res.back()) res.pop_back(); return res; }; namespace n91 { using usize = std::size_t; using u64 = std::uint64_t; std::vector<bool> stob(std::string s) { std::vector<u64> num(s.size() / 9 + 10, 0); for (usize i = 0; i < s.size(); i += 9) { const std::string t = s.substr(i, 9); u64 mul = 1; u64 add = 0; for (const auto c : t) { add = add * 10 + (c - 0 ); mul *= 10; } for (auto& d : num) { d = d * mul + add; add = d >> 32; d -= add << 32; } } std::vector<bool> res(num.size() * 32); for (usize i = 0; i < num.size(); ++i) { for (usize j = 0; j < 32; ++j) { res[i * 32 + j] = num[i] >> j & 1; } } while (!res.empty() && !res.back()) { res.pop_back(); } return res; } } // namespace n91 const int MAX = 2048; using u64 = uint64_t; using BS = bitset<2 * MAX>; BS calc(const string& s) { BS res; vector<bool> v = binary_conversion(s); for (int i = 0; i < v.size(); i++) { if (v[i]) { res.set(i, 1); } } return res; } vector<BS> bases; vector<int> idx(MAX, -1); vector<int> solve(BS b, int x) { for (int i = MAX - 1; i >= 0; i--) { if (!b[i]) continue; if (~idx[i]) b ^= bases[idx[i]]; else { b.set(MAX + x, 1); idx[i] = bases.size(); bases.emplace_back(b); return {}; } } vector<int> res; for (int i = 0; i < MAX; i++) { if (b[MAX + i]) { res.emplace_back(i); } } return res; }; int main() { cin.tie(0); ios::sync_with_stdio(false); int m; cin >> m; for (int i = 0; i < m; i++) { string S; cin >> S; vector<int> ans = solve(calc(S), i); cout << ans.size(); for (int x : ans) cout << << x; cout << n ; } return 0; }
|
#include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define fi first #define se second #define pii pair<int,int> void solve() { int n, m; cin>>n>>m; vector<int> a(n), b(n), c(m), vis(n, 1); int cnt = 0; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) { cin>>b[i]; if(a[i] != b[i]) { vis[i] = 0; cnt++; } } vector<vector<int>> arr(n); for(int i=0;i<m;i++) { cin>>c[i]; arr[c[i] - 1].pb(i); } if(cnt > m) { cout<< NO ; return ; } vector<int> ans(m, -1); for(int i=0;i<n;i++) { if(a[i] != b[i]) { if(arr[b[i] - 1].empty()) { cout<< NO ; return ; } else { ans[arr[b[i] - 1].back()] = i; arr[b[i] - 1].pop_back(); } } } for(int i=0;i<n;i++) { if(a[i] == b[i]) { if(!arr[b[i] - 1].empty()) { ans[arr[b[i] - 1].back()] = i; arr[b[i] - 1].pop_back(); } } } int last = ans[m-1]; for(int i=m-2;i>=0;i--) { if(last != -1) { if(ans[i] == -1) { ans[i] = last; } else last = ans[i]; } else last = ans[i]; } for(int i=0;i<m;i++) { if(ans[i] == -1) { cout<< NO ; return ; } } cout<< YES << n ; for(int i=0;i<m;i++) cout<<ans[i] + 1<< ; } int main() { int t = 1; cin>>t; while(t--) { solve(); cout<< n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x0, y0, x[3], y[3], x1[3], y1[3]; for (int i = 0; i < 3; i++) cin >> x[i] >> y[i]; x0 = x[0] - x[1], y0 = y[0] - y[1]; x1[0] = x[2] - x0, y1[0] = y[2] - y0; x1[1] = x[2] + x0, y1[1] = y[2] + y0; x0 = x[1] - x[2], y0 = y[1] - y[2]; x1[2] = x[0] - x0, y1[2] = y[0] - y0; if (x1[2] == x1[0] || x1[2] == x1[1]) x1[2] = x[0] + x0, y1[2] = y[0] + y0; printf( %d n , 3); for (int i = 0; i < 3; i++) cout << x1[i] << << y1[i] << endl; return 0; }
|
#include list #include <iostream> #include <utility> #include <vector> #include fstream #include <fstream> #include <map> #include algorithm #include <iomanip> #include cmath #include set #include <climits> #include queue #include complex #define all(x) (x).begin(), (x).end() #define ll long long using namespace std; long long mod = 1e9 + 7; void solve() { int n, k; cin >> n >> k; long long res = 1; for (int i = 0; i < k; ++i) { res *= n; res %= mod; } cout << res << endl; } signed main() { int n; cin >> n; while (n--) solve(); }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e6 + 200, RANGE = 1e6 + 20; const long long INF = 0x3f3f3f3f3f3f3f3f; int n, m, p; long long pre_min[MAX_N], nodes[MAX_N << 2], tag[MAX_N << 2]; pair<int, int> ai[MAX_N], bi[MAX_N]; struct tup { int x, y, z; bool operator<(const tup &rhs) const { return x < rhs.x || (x == rhs.x && y < rhs.y); } } tups[MAX_N]; void pushdown(int p) { if (tag[p] != 0) { tag[(p << 1)] += tag[p], tag[((p << 1) | 1)] += tag[p]; nodes[(p << 1)] += tag[p], nodes[((p << 1) | 1)] += tag[p]; tag[p] = 0; } } void pushup(int p) { nodes[p] = max(nodes[(p << 1)], nodes[((p << 1) | 1)]); } void update(int ql, int qr, int l, int r, int p, long long val) { if (ql <= l && r <= qr) return (void)(nodes[p] += val, tag[p] += val); pushdown(p); if (ql <= ((l + r) >> 1)) update(ql, qr, l, ((l + r) >> 1), (p << 1), val); if (((l + r) >> 1) < qr) update(ql, qr, ((l + r) >> 1) + 1, r, ((p << 1) | 1), val); pushup(p); } int main() { scanf( %d%d%d , &n, &m, &p); for (int i = 1; i <= n; i++) scanf( %d%d , &ai[i].first, &ai[i].second); for (int i = 1; i <= m; i++) scanf( %d%d , &bi[i].first, &bi[i].second); for (int i = 1; i <= p; i++) scanf( %d%d%d , &tups[i].x, &tups[i].y, &tups[i].z), tups[i].y++, tups[i].x++; sort(ai + 1, ai + 1 + n), sort(bi + 1, bi + 1 + m), sort(tups + 1, tups + 1 + p); pre_min[m + 1] = INF; for (int i = m; i >= 1; i--) pre_min[i] = min(pre_min[i + 1], 1LL * bi[i].second); int last_pos = 1; for (int i = 1; i <= m; i++) update(last_pos, bi[i].first, 1, RANGE, 1, -pre_min[i]), last_pos = bi[i].first + 1; update(last_pos, RANGE, 1, RANGE, 1, -INF); long long ans = -INF; for (int i = 1, ptr = 1; i <= n; i++) { int pos = ai[i].first, cost = ai[i].second; while (ptr <= p && tups[ptr].x <= pos) update(tups[ptr].y, RANGE, 1, RANGE, 1, tups[ptr].z), ptr++; ans = max(ans, nodes[1] - cost); } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> #include <unordered_map> #include <cctype> #include <string.h> #define PB push_back #define EB emplace_back #define MP make_pair #define endl n #define ll long long #define ull unsigned long long #define STR string #define VEC vector<int> #define IOS {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);} #define loop(i,a,b,c) for(ll i=a;i<b;i+=c) #define MOD (int)1000000007 #define sp #define pii pair<int,int> using namespace std; using namespace std::chrono; /* Debugging */ template <typename T> void printarr(T *A, int n){ for (int i = 0; i < n; i++) { cout<<A[i]<< ; } cout<<endl; } template <typename T> void arrinit(T *A, int n, T data){ for (int i = 0; i < n; i++) { A[i] = data; } } template <typename T> void takeinput(T *A, int n){ for(int i=0;i<n;i++){ cin>>A[i]; } } template <typename T> void printcont(T A){ for(auto a: A){ cout<<a+1<< ; } cout<<endl; } template <typename T> T binpowmod(T a, T b, T p){ if(b==0) return 1; if(b==1) return a; if(b%2==0) return ((binpowmod(a,b/2,p)%p)*(binpowmod(a,b/2,p)%p))%p; return ((a%p)*(binpowmod(a,b-1,p)%p))%p; } // template <typename T> // T gcd(T a,T b){ // if(a==0) return b; // if(b==0) return a; // if(a>b) return gcd(b,a%b); // return gcd(b%a,a); 1 2 3 4 => 1 2 // } void solve (){ int n; cin>>n; int k = n; vector <pii> steps{}; if(n<=8){ for (int i = 3; i < n; i++) { steps.PB({i,i+1}); } while(n!=1){ steps.PB({k,2}); if(n%2==1) n = n/2 + 1; else n/=2; } } else{ for (int i = 3; i < n; i++) { if(i!=8)steps.PB({i,i+1}); } while(n!=1){ steps.PB({k,8}); if(n%8!=0) n = n/8 + 1; else n = n/8; } steps.PB({8,2}); steps.PB({8,2}); steps.PB({8,2}); } cout<<steps.size()<<endl; for (int i = 0; i < steps.size(); i++) { cout<<steps[i].first<< <<steps[i].second<<endl; } } int main(){ auto start = high_resolution_clock::now(); IOS // freopen( input.txt , r ,stdin); // freopen( output.txt , w ,stdout); // freopen( output.txt , w ,stderr); ll t; cin>>t; while(t--){ solve(); } auto stop = high_resolution_clock::now(); auto duration = duration_cast<milliseconds>(stop - start); // cout << Time taken : <<duration.count() << milliseconds n ; return 0; }
|
#include <bits/stdc++.h> int main() { long long n; scanf( %lld , &n); if (n <= 1) { printf( -1 ); } else { printf( %lld %lld %lld , n, n + 1, n * (n + 1)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; class T { private: long node[262145]; long low[262145]; long high[262145]; void update(long n); long amount(long a, long b, long n, long n_a, long n_b); long firstUp(long k, long n, long n_a, long n_b); long firstDown(long k, long n, long n_a, long n_b); public: long amount(long a, long b); long firstUp(long k); long firstDown(long k); void pop(long n); void push(long n); long size(); T(); } WaitTree, DestTree; T::T() { for (long i = 0; i < 262145; i++) { low[i] = 1000000000; high[i] = -1000000000; } } long T::size() { return node[1]; } long T::amount(long a, long b, long n, long n_a, long n_b) { if (a > n_b || b < n_a) return 0; if (n_a >= a && n_b <= b) return node[n]; return amount(a, b, 2 * n, n_a, (n_a + n_b) / 2) + amount(a, b, 2 * n + 1, (n_a + n_b) / 2 + 1, n_b); } long T::firstDown(long k, long n, long n_a, long n_b) { if (node[n] == 0 || n_a > k) return -1000000000; if (n > 131071) return n - 131071; if (n_b > k) { long a = firstDown(k, 2 * n + 1, (n_a + n_b) / 2 + 1, n_b); if (a > 0) return a; return firstDown(k, 2 * n, n_a, (n_a + n_b) / 2); } else return high[n]; } long T::firstUp(long k, long n, long n_a, long n_b) { if (node[n] == 0 || n_b < k) return 1000000000; if (n > 131071) return n - 131071; if (n_a < k) { long a = firstUp(k, 2 * n, n_a, (n_a + n_b) / 2); if (a < 1000000000) return a; return firstUp(k, 2 * n + 1, (n_a + n_b) / 2 + 1, n_b); } else return low[n]; } long T::firstUp(long k) { return firstUp(k, 1, 1, 131071 + 1); } long T::firstDown(long k) { return firstDown(k, 1, 1, 131071 + 1); } long T::amount(long a, long b) { return amount(a, b, 1, 1, 131071 + 1); } void T::update(long n) { n /= 2; while (n > 0) { low[n] = (low[2 * n + 1] < low[2 * n] ? low[2 * n + 1] : low[2 * n]); high[n] = (high[2 * n] > high[2 * n + 1] ? high[2 * n] : high[2 * n + 1]); node[n] = node[2 * n] + node[2 * n + 1]; n /= 2; } } void T::pop(long n) { node[131071 + n]--; if (node[131071 + n] == 0) { low[131071 + n] = 1000000000; high[131071 + n] = -1000000000; } update(131071 + n); } void T::push(long n) { high[131071 + n] = n; low[131071 + n] = n; node[131071 + n]++; update(131071 + n); } struct A { long id; long time, wait, dest; }; bool operator<(const A &a, const A &b) { return a.time < b.time; } vector<A> P(100005); class X { public: long id, floor; X(long _id, long _floor); }; X::X(long _id, long _floor) { id = _id; floor = _floor; } vector<X> Waiting[100005]; vector<X> Dest[100005]; long long Arrive[100005]; long Arrived; long N, M; void in() { scanf( %ld %ld , &N, &M); for (long i = 0; i < N; i++) { scanf( %ld %ld %ld , &P[i].time, &P[i].wait, &P[i].dest); P[i].id = i; } sort(P.begin(), P.begin() + N); } void processEvent(long f, long long t, long &nextP) { X x(0, 0); while (P[nextP].time == t && nextP < N) { Waiting[P[nextP].wait].push_back(X(P[nextP].id, P[nextP].dest)); WaitTree.push(P[nextP].wait); nextP++; } while (Waiting[f].size() > 0) { x = Waiting[f].back(); Dest[x.floor].push_back(X(x.id, x.floor)); WaitTree.pop(f); DestTree.push(x.floor); Waiting[f].pop_back(); } while (Dest[f].size() > 0) { x = Dest[f].back(); Arrive[x.id] = t; Arrived++; DestTree.pop(f); Dest[f].pop_back(); } } void solve() { const int UP = 1; const int DOWN = 2; int dir; long nextMove; long nextP = 0; long p_up, p_down; long f = 1; long long t = 0; while (Arrived < N) { processEvent(f, t, nextP); p_up = p_down = 0; p_up += WaitTree.amount(f, 131071 + 1); p_up += DestTree.amount(f, 131071 + 1); p_down += WaitTree.amount(1, f); p_down += DestTree.amount(1, f); if (p_up >= p_down) dir = UP; else dir = DOWN; if (dir == UP) { nextMove = 1000000000; nextMove = (nextMove < WaitTree.firstUp(f) - f ? nextMove : WaitTree.firstUp(f) - f); nextMove = (nextMove < DestTree.firstUp(f) - f ? nextMove : DestTree.firstUp(f) - f); if (nextP < N) nextMove = (nextMove < P[nextP].time - t ? nextMove : P[nextP].time - t); t += nextMove; if (DestTree.size() > 0 || WaitTree.size() > 0) { f += nextMove; } } if (dir == DOWN) { nextMove = 1000000000; nextMove = (nextMove < f - WaitTree.firstDown(f) ? nextMove : f - WaitTree.firstDown(f)); nextMove = (nextMove < f - DestTree.firstDown(f) ? nextMove : f - DestTree.firstDown(f)); if (nextP < N) nextMove = (nextMove < P[nextP].time - t ? nextMove : P[nextP].time - t); t += nextMove; if (DestTree.size() > 0 || WaitTree.size() > 0) { f -= nextMove; } } } } void out() { for (long i = 0; i < N; i++) printf( %I64d n , Arrive[i]); } int main() { in(); solve(); out(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } const int INF = (int)1E9 + 7; const long double EPS = 1E-10; const long double PI = 3.1415926535897932384626433832795; int n; vector<long double> a; bool check(const vector<long double>& a) { if (int((a).size()) <= 1) return true; if (fabs(a[0]) < EPS) { for (int i = 0; i < int(int((a).size())); ++i) if (fabs(a[i]) > EPS) return false; return true; } long double b = a[1] / a[0], cur = a[0]; for (int i = 0; i < int(int((a).size())); ++i) { if (fabs(a[i] - cur) > EPS) return false; cur *= b; } return true; } vector<int> getz(const vector<long double>& a) { vector<int> z(int((a).size())); int l = 0, r = -1; for (int i = int(1); i < int(int((a).size())); ++i) { z[i] = i > r ? 0 : min(z[i - l], r - i + 1); while (i + z[i] < int((a).size()) && fabs(a[z[i]] - a[i + z[i]]) < EPS) z[i]++; if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1; } return z; } int main() { cin >> n; a.resize(n); for (int i = 0; i < int(n); ++i) { int x; scanf( %d , &x); a[i] = x; } if (check(a)) { puts( 0 ); exit(0); } for (int i = 0; i < int(2); ++i) { vector<long double> b = a; b.erase(b.begin() + i); if (check(b)) { puts( 1 ); exit(0); } } vector<long double> ok(n - 1, 0); if (fabs(a[0]) > EPS) { long double d = a[1] / a[0]; ok[0] = a[0], ok[1] = a[1]; for (int i = int(2); i < int(int((ok).size())); ++i) ok[i] = ok[i - 1] * d; } vector<long double> t1 = ok; t1.insert(t1.end(), (a).begin(), (a).end()); vector<int> z1 = getz(t1); reverse((ok).begin(), (ok).end()); reverse((a).begin(), (a).end()); ok.insert(ok.end(), (a).begin(), (a).end()); vector<int> z2 = getz(ok); if (z1[n - 1] + z2[n - 1] >= n - 1) puts( 1 ); else puts( 2 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << n ; err(++it, args...); } const double PI = acos(-1); const double eps = (1e-9); const long long int INF = (1e18); const int M = (1e9) + 7; const int N = 2050; const int K = 5250; int dp[N][N]; int n, m, k; vector<pair<int, int> > fire; int saare[2][N]; int val[2][N]; int last[2][N]; int sz[2]; void compress(int ind, int n) { vector<pair<int, int> > tp(n); int i, j, r; for (i = 0; i < n; i++) tp[i].first = saare[ind][i], tp[i].second = i; sort(tp.begin(), tp.end()); i = 0, r = 1, j = 0; while (i < n) { while (j < n && tp[i].first == tp[j].first) saare[ind][tp[j].second] = r, j++; val[ind][r++] = tp[i].first; if (j < n && tp[i].first + 1 < tp[j].first) val[ind][r] = tp[i].first + 1, last[ind][r] = tp[j].first - 1, r++; i = j; } sz[ind] = r; return; } int build() { int i, j, x, y, a, b; for (i = 0; i < sz[0]; ++i) { for (j = 0; j < sz[1]; ++j) dp[i][j] = 0; } for (i = 0; i < k; ++i) { x = saare[0][i], y = saare[1][i]; a = saare[0][i + k], b = saare[1][i + k]; dp[x][y] += 1; dp[x][b + 1] -= 1; dp[a + 1][y] -= 1; dp[a + 1][b + 1] += 1; } for (i = 1; i < sz[0]; ++i) { for (j = 1; j < sz[1]; ++j) dp[i][j] += (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]); } x = n + 1, a = 0; y = m + 1, b = 0; for (i = 1; i < sz[0]; ++i) { for (j = 1; j < sz[1]; ++j) { if (dp[i][j] == 0) { x = min(x, val[0][i]); a = max(a, val[0][i]); a = max(a, last[0][i]); y = min(y, val[1][j]); b = max(b, val[1][j]); b = max(b, last[1][j]); } } } int z = max(0, max(a - x, b - y)); return z; } int check(int t) { vector<pair<int, int> > point(2 * k); int i, x, y, a, b; for (i = 0; i < k; ++i) { tie(x, y) = fire[i]; a = max(x - t, 1), b = max(y - t, 1); point[i] = {a, b}; a = min(x + t, n), b = min(y + t, m); point[i + k] = {a, b}; } for (i = 0; i < 2 * k; ++i) tie(saare[0][i], saare[1][i]) = point[i]; int s = 2 * k; saare[0][s] = 1, saare[1][s] = 1, s++; saare[0][s] = n, saare[1][s] = m, s++; compress(0, s); compress(1, s); { string _s = t ; replace(_s.begin(), _s.end(), , , ); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, t); }; int z = build(); return (z <= 2 * t); } void solve() { scanf( %d%d%d , &n, &m, &k); fire.resize(k); int i; for (i = 0; i < k; ++i) scanf( %d%d , &fire[i].first, &fire[i].second); int mid, l = 0, r = (max(n, m) / 2); while (l < r) { mid = ((l + r) >> 1); if (check(mid)) r = mid; else l = mid + 1; } printf( %d n , l); } int main() { int t; t = 1; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; vector<string> str; const string di = .. ; char ss[500]; int main() { int ti; scanf( %d , &ti); for (int i = 0; i < ti; i++) { scanf( %s , ss); if (ss[0] == p ) { printf( / ); for (int i = 0; i < str.size(); i++) printf( %s/ , str[i].c_str()); printf( n ); } else { scanf( %s , ss); if (ss[0] == / ) str.clear(); char *tmp = strtok(ss, / ); while (tmp != NULL) { if (di == tmp) str.pop_back(); else str.push_back(tmp); tmp = strtok(NULL, / ); } } } }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 100000000; const long long MAXN = 2e6 + 20; struct edge { long long from, to, cost; }; int main() { long long i, j, k, t1, t2, t3, n, m, t; std::ios::sync_with_stdio(0); cin >> n >> k; cout << (k + n - 1) / n << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, a[5002], b, c, d; cin >> n; cout << ? << << 1 << << 2 << endl; fflush(stdout); cin >> b; cout << ? << << 2 << << 3 << endl; fflush(stdout); cin >> c; cout << ? << << 1 << << 3 << endl; fflush(stdout); cin >> d; a[1] = (b + d - c) / 2; a[2] = b - a[1]; a[3] = d - a[1]; for (i = 4; i <= n; i++) { cout << ? << << 1 << << i << endl; fflush(stdout); cin >> b; a[i] = b - a[1]; } cout << ! << ; for (i = 1; i <= n; i++) cout << a[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200000 + 10; const int hashnum = 3; long long base[] = {233, 23, 97}; long long mod[] = {122420729, 1000000007, 1000000009}; int sum[maxn]; char s[maxn]; long long power[hashnum][maxn]; int n; struct node { long long hv[hashnum]; int pref, suf, len; }; node zer; inline void init() { zer.pref = zer.suf = zer.len = 0; for (int i = (0); i < (hashnum); ++i) zer.hv[i] = 0; for (int i = (0); i < (hashnum); ++i) { power[i][0] = 1; for (int j = (1); j < (maxn); ++j) power[i][j] = power[i][j - 1] * base[i] % mod[i]; } } node merge(node& a, node& b) { node c = zer; if (a.len == 0 && b.len == 0) c.suf = c.pref = a.pref + b.pref; else if (a.len == 0) c = b, c.pref += a.pref; else if (b.len == 0) c = a, c.suf += b.pref; else { c.len = a.len + b.len + (a.suf + b.pref) % 2; c.pref = a.pref; c.suf = b.suf; for (int i = (0); i < (hashnum); ++i) { if ((a.suf + b.pref) % 2 == 1) { c.hv[i] = a.hv[i] * power[i][b.len + 1] % mod[i]; (c.hv[i] += 2 * power[i][b.len] % mod[i]) %= mod[i]; (c.hv[i] += b.hv[i]) %= mod[i]; } else { c.hv[i] = a.hv[i] * power[i][b.len] % mod[i]; (c.hv[i] += b.hv[i]) %= mod[i]; } } } return c; } struct segtree { node t[maxn << 2]; int n, ql, qr; node ans; void init(int n) { this->n = n; } void maintain(int o) { t[o] = merge(t[o << 1], t[o << 1 | 1]); } void build(int l, int r, int o) { t[o] = zer; if (l == r) { if (s[l] == 0 ) { t[o].len++; for (int i = (0); i < (hashnum); ++i) t[o].hv[i] = 1; } else t[o].suf = t[o].pref = 1; return; } int mid = l + r >> 1; build(l, mid, o << 1), build(mid + 1, r, o << 1 | 1); maintain(o); } void query(int l, int r, int o) { if (ql <= l && qr >= r) ans = merge(ans, t[o]); else { int mid = l + r >> 1; if (ql <= mid) query(l, mid, o << 1); if (qr > mid) query(mid + 1, r, o << 1 | 1); } } node Query(int l, int r) { ans = zer; ql = l, qr = r; query(1, n, 1); return ans; } }; segtree tree; bool judge(node& a, node& b) { if (a.suf % 2 != b.suf % 2 || a.pref % 2 != b.pref % 2 || a.len != b.len) return false; for (int i = (0); i < (hashnum); ++i) if (a.hv[i] != b.hv[i]) return false; return true; } int main(void) { scanf( %d%s , &n, s + 1); init(); tree.init(n); tree.build(1, n, 1); for (int i = (1); i <= (n); ++i) { sum[i] = sum[i - 1]; if (s[i] == 1 ) sum[i]++; } int q; scanf( %d , &(q)); for (; q--;) { int l1, l2, r1, r2, len; scanf( %d%d%d , &l1, &l2, &len); r1 = l1 + len - 1; r2 = l2 + len - 1; if (sum[r2] - sum[l2 - 1] != sum[r1] - sum[l1 - 1]) { puts( No ); continue; } node x = tree.Query(l1, r1); node y = tree.Query(l2, r2); if (judge(x, y)) puts( Yes ); else puts( No ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool Notlucky(int x) { for (int i = x; i != 0; i /= 10) { if (i % 10 == 8 || i % 10 == -8) return false; } return true; } int main() { int a, b; cin >> a; b = a + 1; while (Notlucky(b)) { b++; } cout << b - a; return 0; }
|
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } mt19937_64 rnd; const int N = 2e5 + 5; void tc() { int n; cin >> n; vector<int> v; int p = 1; while (n) { if (n % 10) { v.push_back(n % 10 * p); } n /= 10; p *= 10; } cout << int((v).size()) << n ; for (auto x : v) cout << x << ; cout << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) tc(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = (int)1e5 + 20; long long a[MAX_N]; long long dp[2][MAX_N][2]; int n; long long ans; void Solve(int p) { dp[p][0][0] = 0, dp[p][0][1] = -1; for (int i = 1; i < n; i++) { int bri = i - 1; long long m = a[bri]; if (m <= 1) dp[p][i][0] = -1; else { long long res = (m / 2) * 2; if (dp[p][i - 1][0] != -1) res += dp[p][i - 1][0]; dp[p][i][0] = res; } if (m < 1) dp[p][i][1] = -1; else { long long ret = ((m - 1) / 2) * 2 + 1; if (max(dp[p][i - 1][0], dp[p][i - 1][1]) != -1) ret += max(dp[p][i - 1][0], dp[p][i - 1][1]); dp[p][i][1] = ret; } } } int main() { cin >> n; for (int i = 0; i < n - 1; i++) cin >> a[i]; Solve(0); reverse(a, a + n - 1); Solve(1); for (int i = 0; i < n; i++) { long long res, ted, ret; res = ted = ret = 0; if (dp[0][i][0] != -1 && dp[1][n - (i + 1)][1] != -1) res = dp[0][i][0] + dp[1][n - (i + 1)][1]; if (dp[0][i][1] != -1 && dp[1][n - (i + 1)][0] != -1) ted = dp[0][i][1] + dp[1][n - (i + 1)][0]; if (dp[0][i][0] != -1 && dp[1][n - (i + 1)][0] != -1) ret = dp[0][i][0] + dp[1][n - (i + 1)][0]; ans = max(ans, max(ret, max(res, ted))); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, ans; cin >> n >> k; if (n % 2 == 0) { if (k <= n / 2) { ans = 2 * k - 1; } else { ans = 2 * k - n; } } else { if (k <= (n / 2) + 1) { ans = 2 * k - 1; } else { ans = 2 * k - n - 1; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( avx,avx2 ) using namespace std; using LF = double; using LL = long long; using basis = complex<LF>; const LF PI = acos(-1.0l); const int N = 125005; vector<int> rev; vector<basis> omega; inline void calc_rev(int n, int log_n) { omega.assign(n, 0); rev.assign(n, 0); for (int i = 0; i < n; i++) { rev[i] = 0; for (int j = 0; j < log_n; j++) { if ((i >> j) & 1) rev[i] |= 1 << (log_n - j - 1); } } } inline void fft(vector<basis> &A, int n, bool invert) { for (int i = 0; i < n; i++) { if (i < rev[i]) swap(A[i], A[rev[i]]); } for (int len = 2; len <= n; len <<= 1) { LF ang = 2 * PI / len * (invert ? -1 : +1); int half = (len >> 1); basis curomega(cos(ang), sin(ang)); omega[0] = basis(1, 0); for (int i = 1; i < half; i++) omega[i] = omega[i - 1] * curomega; for (int i = 0; i < n; i += len) { basis t; int pu = i, pv = i + half, pu_end = i + half, pw = 0; for (; pu != pu_end; pu++, pv++, pw++) { t = A[pv] * omega[pw]; A[pv] = A[pu] - t; A[pu] += t; } } } if (invert) for (int i = 0; i < n; i++) A[i] /= n; } inline void multiply(int n, vector<basis> &A, vector<basis> &B, vector<int> &C) { fft(A, n, false); fft(B, n, false); for (int i = 0; i < n; i++) A[i] *= B[i]; fft(A, n, true); for (int i = 0; i < n; i++) { C[i] = (int)(A[i].real() + 0.5); } } inline void solve(int n, vector<int> &coefficients_of_A, vector<int> &coefficients_of_B, vector<int> &result) { vector<basis> A(n), B(n); for (int i = 0; i < n; i++) { A[i] = coefficients_of_A[i]; B[i] = 0; } for (int i = 0; i < n; i++) { B[i] = coefficients_of_B[i]; } vector<int> C(n); multiply(n, A, B, C); for (int i = 0; i < n; i++) { int add = C[i]; result[i] += add; } } inline void do_FFT(vector<int> &A, vector<int> &B, vector<int> &result) { int n = 1, bits = 0; while (n < 2 * A.size() || n < 2 * B.size()) { n <<= 1, bits++; } result.assign(n, 0); calc_rev(n, bits); vector<int> tempA(A.begin(), A.end()); vector<int> tempB(B.begin(), B.end()); tempA.resize(n); tempB.resize(n); solve(n, tempA, tempB, result); } int n, m; string S, T; vector<int> indexes[6][2]; vector<int> graph[N][6]; int visited[6]; int dfs(int u, int v) { int ans = 1; visited[v] = 1; for (auto k : graph[u][v]) { if (!visited[k]) ans += dfs(u, k); } return ans; } int work(int curr_position) { int ans = 0; memset(visited, 0, sizeof(visited)); for (int i = 0; i < 6; i++) { if (!visited[i]) ans += dfs(curr_position, i) - 1; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> S >> T; int i, j; n = S.size(); m = T.size(); for (i = 0; i <= n - 1; i++) { indexes[S[i] - a ][0].push_back(i); } for (j = 0; j <= m - 1; j++) { indexes[T[j] - a ][1].push_back(j); } for (i = 0; i <= 5; i++) { for (j = 0; j <= 5; j++) { if (i == j) continue; vector<int> polynomial1(n + 1, 0), polynomial2(m, 0); for (int x : indexes[i][0]) polynomial1[x] = 1; for (int x : indexes[j][1]) polynomial2[m - 1 - x] = 1; vector<int> res; do_FFT(polynomial1, polynomial2, res); for (int k = 0; k < n - m + 1; k++) { if (res[m - 1 + k]) { graph[k][i].push_back(j); graph[k][j].push_back(i); } } } } for (i = 0; i <= n - m; i++) { cout << work(i) << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > a[60]; int c[60], d[60], e[60]; int main() { int i, j, k, m, n; double w; while (scanf( %d%lf%d , &n, &w, &m) != EOF) { for (i = 0; i < n; i++) d[i] = m; memset(c, 0, sizeof(c)); k = 0; int f = 0; for (i = 0; i < m; i++) a[i].clear(); for (i = 0; i < n; i++) { int cnt = 0; while (d[i] > 0) { if (d[i] >= n - c[k]) { a[k].push_back(make_pair(i, n - c[k])); d[i] -= n - c[k]; c[k] = n; k++; } else { a[k].push_back(make_pair(i, d[i])); c[k] += d[i]; d[i] = 0; } cnt++; } if (cnt > 2) f = 1; } if (f) { puts( NO ); continue; } puts( YES ); for (i = 0; i < m; i++) { for (j = 0; j < a[i].size(); j++) { printf( %d %.10lf%c , a[i][j].first + 1, a[i][j].second * w / m, j < a[i].size() - 1 ? : n ); } } } }
|
#include <bits/stdc++.h> using namespace std; long long N, i, j, k, a, b; long long gcd(long long a, long long b) { long long t; while (b > 0) { t = b; b = a % b; a = t; } return a; } long long lcm(long long a, long long b, long long c) { long long d = a * b / gcd(a, b); return c * d / gcd(c, d); } int main() { scanf( %I64d , &N); for (i = max(1ll, N - 100); i <= N; i++) { for (j = i; j <= N; j++) { for (k = j; k <= N; k++) { b = lcm(i, j, k); if (b > a) a = b; } } } printf( %I64d n , a); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; const int INF = 0x3f3f3f3f; int vis[105]; int main() { string s; cin >> s; int len = s.size(); int ans = 0; for (int i = 0; i < len - 1; i++) { if (s[i] == V && s[i + 1] == K ) ans++; } for (int i = 0; i < len; i++) { char ch = s[i]; s[i] = V ; int temp = 0; for (int j = 0; j < len - 1; j++) { if (s[j] == V && s[j + 1] == K ) temp++; } s[i] = ch; ans = max(ans, temp); } for (int i = 0; i < len; i++) { char ch = s[i]; s[i] = K ; int temp = 0; for (int j = 0; j < len - 1; j++) { if (s[j] == V && s[j + 1] == K ) temp++; } s[i] = ch; ans = max(ans, temp); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int m, n, q, a[13][110005], id; bitset<4100> s[110005]; inline int read() { int ret = 0, ff = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) ff = -1; ch = getchar(); } while (isdigit(ch)) { ret = (ret << 3) + (ret << 1) + (ch ^ 48); ch = getchar(); } return ret * ff; } signed main() { m = read(), n = read(), q = read(); id = n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) a[i][j] = read(); for (int j = 0; j < (1 << n); j++) if (j & (1 << (i - 1))) s[i][j] = 1; } for (int que = 1; que <= q; que++) { int opt = read(), x = read(), y = read(); if (opt == 1) { s[++id] = s[x] & s[y]; continue; } if (opt == 2) { s[++id] = s[x] | s[y]; continue; } if (opt == 3) { vector<pair<int, int> > v; for (int i = 1; i <= n; i++) v.push_back(make_pair(a[i][y], i)); sort(v.begin(), v.end()); int sum = 0; for (int i = 0; i < n; i++) { sum |= (1 << (v[i].second - 1)); if (s[x][sum]) { printf( %d n , v[i].first); break; } } continue; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; void read(vector<long long int> &a, int n) { a.resize(n); for (int i = 0; i < n; i++) cin >> a[i]; } bool fine = 0; void solve() { int x, y, z; cin >> x >> y >> z; vector<int> a(x), b(y), c(z); for (int i = 0; i < x; i++) cin >> a[i]; for (int i = 0; i < y; i++) cin >> b[i]; for (int i = 0; i < z; i++) cin >> c[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); sort(c.begin(), c.end()); reverse(a.begin(), a.end()); reverse(c.begin(), c.end()); reverse(b.begin(), b.end()); long long int ans = 0; long long int dp[x + 1][y + 1][z + 1]; memset(dp, 0, sizeof(dp)); for (int i = 0; i < x + 1; i++) { for (int j = 0; j < y + 1; j++) { for (int k = 0; k < z + 1; k++) { if ((i + j + k) < 2 || (i + j + k) & 1) continue; if (i && j) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j - 1][k] + a[i - 1] * b[j - 1]); if (i && k) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k - 1] + a[i - 1] * c[k - 1]); if (k && j) dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k - 1] + b[j - 1] * c[k - 1]); ans = max(dp[i][j][k], ans); } } } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); if (fine) { int t; cin >> t; while (t--) { solve(); } } else solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 2e5 + 10; struct node { int l, r, id; friend bool operator<(node A, node B) { return A.r == B.r ? A.l < B.l : A.r < B.r; } }; node a[N]; bool add[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, m; ; cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> a[i].l >> a[i].r; a[i].id = i; } sort(a + 1, a + 1 + n); multiset<int> b; for (int i = 0; i < m; ++i) b.insert(0); for (int i = 1; i <= n; ++i) { auto p = b.lower_bound(a[i].l); if (p != b.begin()) { add[a[i].id] = 1; --p; b.erase(p); b.insert(a[i].r); } } vector<int> ans; for (int i = 1; i <= n; ++i) if (!add[i]) ans.emplace_back(i); cout << ans.size() << endl; for (auto i : ans) cout << i << ; cout << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 3e3 + 100; const long long inf = 0x3f3f3f3f; const long long iinf = 1 << 30; const long long linf = 2e18; const long long mod = 998244353; const double eps = 1e-7; template <class T = long long> T chmin(T &a, T b) { return a = min(a, b); } template <class T = long long> T chmax(T &a, T b) { return a = max(a, b); } template <class T = long long> inline void red(T &x) { x -= mod, x += x >> 31 & mod; } template <class T = long long> T read() { T f = 1, a = 0; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { a = (a << 3) + (a << 1) + ch - 0 ; ch = getchar(); } return a * f; } long long n, m, ans; char s[maxn], t[maxn]; long long f[maxn][maxn]; signed main() { scanf( %s %s , s + 1, t + 1); long long n = strlen(s + 1), m = strlen(t + 1); for (long long i = (1); i <= (n); ++i) f[i][i] = 2 * (i > m || s[1] == t[i]); for (long long i = (2); i <= (n); ++i) for (long long l = (1); l <= (n - i + 1); ++l) { long long r = l + i - 1; if (l > m || s[i] == t[l]) red(f[l][r] += f[l + 1][r]); if (r > m || s[i] == t[r]) red(f[l][r] += f[l][r - 1]); } for (long long i = (m); i <= (n); ++i) red(ans += f[1][i]); printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( -funroll-loops ) #pragma GCC target( avx,sse4 ) using namespace std; const int P = 1e9 + 7, i2 = P / 2 + 1, i6 = P / 6 + 1, N = 1e6 + 5; long long n, m; int r, f1[N], f2[N], f3[N]; int main() { scanf( %lld , &n); long long g1 = (n + 1) % P, g3 = (long long)g1 * g1 % P * g1 % P; while ((long long)m * m <= n) m++; m--; for (register int i = 1, _lim_ = m; i <= _lim_; i++) { long long v1 = (long long)i * i % P, v2 = (long long)v1 * v1 % P, v3 = (long long)v1 * v2 % P; f1[i] = (f1[i - 1] + v1) % P; f2[i] = (f2[i - 1] + v2) % P; f3[i] = (f3[i - 1] + v3) % P; } for (register int x = 0, _lim_ = m; x <= _lim_; x++) { long long s = 0, v1 = (long long)x * x % P, v2 = (long long)v1 * v1 % P, v3 = (long long)v1 * v2 % P; while ((long long)x * x + (long long)m * m > n) m--; s = ((g3 + g1 * (3 * v1 - 3 * v2 - 1) + v1 - v2 * 3 + v3 * 2) % P * (m + 1) % P + (3 * g1 + 1 - (3 * g1 + 3) * v1 * 2 + v2 * 6) % P * f1[m] % P + 3 * (v1 * 2 - g1 - 1) * f2[m] + 2 * f3[m]) % P; s = (s * 2 - g3 + g1 - v1 * (3 * g1 + 1) + v2 * (3 * g1 + 3) - v3 * 2) % P; r = (r + s * (1 << (x > 0))) % P; } r = (long long)r * i6 % P; if (r < 0) r += P; printf( %d n , r); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, co[200010], to[200010]; int cnt = 0; int dfn[200010], low[200010]; int scc_cnt; int sccno[200010]; int nt[200010], va[200010]; stack<int> S; void dfs(int u) { dfn[u] = low[u] = ++cnt; S.push(u); int v = to[u]; if (dfn[v] == 0) { dfs(v); low[u] = min(low[u], low[v]); } else if (!sccno[v]) { low[u] = min(low[u], dfn[v]); } int MMM = 0x3f3f3f3f; if (low[u] == dfn[u]) { ++scc_cnt; while (true) { int x = S.top(); S.pop(); sccno[x] = scc_cnt; MMM = min(MMM, co[x]); if (x == u) { break; } } va[scc_cnt] = MMM; } } int num[200010]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> co[i]; for (int i = 1; i <= n; i++) cin >> to[i]; memset(dfn, 0, sizeof(dfn)); cnt = scc_cnt = 0; for (int i = 1; i <= n; ++i) { if (!dfn[i]) { dfs(i); } } for (int u = 1; u <= n; ++u) { int v = to[u]; if (sccno[u] != sccno[v]) { nt[sccno[u]] = sccno[v]; num[sccno[u]]++; } } queue<int> q; int ans = 0; for (int i = 1; i <= scc_cnt; i++) { if (num[i] == 0) { ans += va[i]; } } cout << ans << endl; ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; char s[N], t[N]; int n, m; int ch[N][26]; int lps[N]; void calcLps() { memset(lps, 0, sizeof(lps)); int i = 1; int len = 0; lps[0] = 0; while (i < m) { if (t[i + 1] == t[len + 1]) { len++; lps[i] = len; i++; } else { if (len == 0) { lps[i] = 0; i++; } else { len = lps[len - 1]; } } } } int main() { scanf( %s , s + 1); scanf( %s , t + 1); n = strlen(s + 1), m = strlen(t + 1); for (int i = 1; i <= m; i++) ch[i - 1][t[i] - a ] = i; calcLps(); for (int i = 1; i <= m; i++) { for (int j = 0; j < 26; j++) { if (!ch[i][j]) { ch[i][j] = ch[lps[i - 1]][j]; } } } vector<vector<int> > dp(n + 1, vector<int>(m + 1, -1)); dp[0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j <= m; j++) { if (dp[i][j] == -1) continue; if (s[i + 1] == ? ) { for (int c = 0; c < 26; c++) { dp[i + 1][ch[j][c]] = max(dp[i + 1][ch[j][c]], dp[i][j] + (ch[j][c] == m)); } } else { int c = s[i + 1] - a ; dp[i + 1][ch[j][c]] = max(dp[i + 1][ch[j][c]], dp[i][j] + (ch[j][c] == m)); } } } int ans = 0; for (int i = 0; i <= m; i++) { ans = max(ans, dp[n][i]); } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 107; int n, k; int f[N][N]; int main() { int i, j, tmp; bool ok = 0; cin >> k; f[1][2] = f[2][1] = 1; tmp = 0; for (i = 3; i <= 100; i++) { f[1][i] = f[i][1] = 1; for (j = 2; j < i; j++) { if (tmp + j - 1 > k) break; tmp += j - 1; f[i][j] = f[j][i] = 1; if (tmp == k) { ok = 1; break; } } if (ok) break; } cout << i << endl; k = i; for (i = 1; i <= k; i++) { for (j = 1; j < k; j++) { cout << f[i][j]; } cout << f[i][k] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100500; int n, m; int a[30]; string s, t; char ans[5500]; void po_poryadky(int x) { for (int i = x; i < n; i++) { for (int j = 0; j < 30; j++) if (a[j]) { ans[i] = (char)( a + j); a[j]--; break; } } } void ubiraem(int x) { for (int i = x; i >= 0; i--) { int num = ans[i] - a ; a[num]++; for (int j = num + 1; j < 30; j++) if (a[j]) { ans[i] = (char)( a + j); a[j]--; po_poryadky(i + 1); return; } } cout << -1; exit(0); } void v_roven() { for (int i = 0; i < m; i++) { int num = t[i] - a ; if (a[num] != 0) { ans[i] = t[i]; a[num]--; continue; } for (int j = num + 1; j < 30; j++) if (a[j]) { a[j]--; ans[i] = (char)( a + j); po_poryadky(i + 1); return; } ubiraem(i - 1); return; } if (n == m) ubiraem(m - 1); else po_poryadky(m); } int main() { cin >> s >> t; n = s.size(); m = t.size(); for (int i = 0; i < n; i++) a[(int)(s[i] - a )]++; v_roven(); ans[n] = 0 ; cout << ans; return 0; }
|
#include <bits/stdc++.h> const int MAXN = 2e5 + 5; int n, a[MAXN]; long long sm[MAXN]; int ans = 0; int pc[MAXN]; inline bool check(int l, int r) { return (a[l] ^ a[r]) == sm[r - 1] - sm[l]; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , a + i), sm[i] = sm[i - 1] + a[i]; for (int i = 1; i <= n; ++i) { int x = a[i]; while (x) x >>= 1, ++pc[i]; } for (int l = 1; l <= n - 2; ++l) { int r = l + 2; while (r <= n && sm[r - 1] - sm[l] < (1ll << pc[l])) { if (pc[l] >= pc[r]) ans += check(l, r); ++r; } } std::reverse(a + 1, a + n + 1); std::reverse(pc + 1, pc + n + 1); for (int i = 1; i <= n; ++i) sm[i] = sm[i - 1] + a[i]; for (int l = 1; l <= n - 2; ++l) { int r = l + 2; while (r <= n && sm[r - 1] - sm[l] < (1ll << pc[l])) { if (pc[l] > pc[r]) ans += check(l, r); ++r; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e5 + 10; int n, m, l, r, x, a[MAX_N], left_ancestor[MAX_N]; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 2; i <= n; i++) if (a[i] == a[i - 1]) left_ancestor[i] = left_ancestor[i - 1]; else left_ancestor[i] = i - 1; while (m--) { scanf( %d %d %d , &l, &r, &x); if (a[r] != x) printf( %d n , r); else if (left_ancestor[r] and l <= left_ancestor[r]) printf( %d n , left_ancestor[r]); else puts( -1 ); } return (0); }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 5 * 1e5; long long s[maxn], del[maxn], mark[maxn]; void build(int u, int l, int r) { if (l < r) { int mid = (l + r) / 2; build(u * 2, l, mid), build(u * 2 + 1, mid + 1, r); } else mark[u] = l; } long long query(int u, int l, int r, int x, int y) { if (y < l || x > r) return 0; if (x <= l && r <= y) return s[u]; int mid = (l + r) / 2; long long L = query(u * 2, l, mid, x, y); long long R = query(u * 2 + 1, mid + 1, r, x, y); return L + R + max(0, min(r, y) - max(l, x) + 1) * del[u]; } void clear(int u, int l, int r, int z) { if (mark[u]) { del[u] += abs(mark[u] - z); s[u] += 1LL * (r - l + 1) * abs(mark[u] - z); mark[u] = 0; } else { if (l == r) return; int mid = (l + r) / 2, lc = u * 2, rc = u * 2 + 1; clear(lc, l, mid, z); clear(rc, mid + 1, r, z); s[u] = s[lc] + s[rc] + 1LL * (r - l + 1) * del[u]; } } void modify(int u, int l, int r, int x, int y, int z) { if (y < l || x > r) return; if (x <= l && r <= y) { clear(u, l, r, z); mark[u] = z; return; } int mid = (l + r) / 2, lc = u * 2, rc = u * 2 + 1; if (mark[u]) mark[lc] = mark[rc] = mark[u], mark[u] = 0; modify(lc, l, mid, x, y, z); modify(rc, mid + 1, r, x, y, z); s[u] = s[lc] + s[rc] + 1LL * (r - l + 1) * del[u]; } int main() { int n, m; scanf( %d%d , &n, &m); build(1, 1, n); int type, x, y, z; ; for (int i = 0; i < m; i++) { scanf( %d%d%d , &type, &x, &y); if (type == 1) { scanf( %d , &z); modify(1, 1, n, x, y, z); } else (cout << query(1, 1, n, x, y) << endl); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100001; int n, m, ind[N], dpth[N], s[N], e[N], t, seg[4 * N], lazy[4 * N], a[N]; vector<vector<int> > g, gift; vector<pair<int, int> > anc; vector<int> ans, root; void dfs(int u) { s[u] = t++; for (int i = 0; i < g[u].size(); i++) { dpth[g[u][i]] = dpth[u] + 1; dfs(g[u][i]); } e[u] = t - 1; } void dfs2(int u) { if (gift[a[u]].empty()) { anc.push_back(make_pair(-dpth[a[u]], a[u])); } gift[a[u]].push_back(u); for (int i = 0; i < g[u].size(); i++) dfs2(g[u][i]); } void checkLazy(int p, int s, int e) { if (lazy[p] != 0) { seg[p] += (e - s + 1) * lazy[p]; if (s != e) lazy[2 * p] += lazy[p], lazy[2 * p + 1] += lazy[p]; lazy[p] = 0; } } void build(int p, int s, int e) { if (s == e) { seg[p] = 1; lazy[p] = 0; return; } build(2 * p, s, (s + e) / 2); build(2 * p + 1, (s + e) / 2 + 1, e); seg[p] = seg[2 * p] + seg[2 * p + 1]; lazy[p] = lazy[2 * p] + lazy[2 * p + 1]; } void update(int p, int s, int e, int a, int b, int v) { checkLazy(p, s, e); if (s >= a && e <= b) { seg[p] += (e - s + 1) * v; if (s != e) lazy[2 * p] += v, lazy[2 * p + 1] += v; return; } if (s > b || e < a) return; update(2 * p, s, (s + e) / 2, a, b, v); update(2 * p + 1, (s + e) / 2 + 1, e, a, b, v); seg[p] = seg[2 * p] + seg[2 * p + 1]; } int get(int p, int s, int e, int a) { checkLazy(p, s, e); if (s == e) return seg[p]; if (a <= (s + e) / 2) return get(2 * p, s, (s + e) / 2, a); return get(2 * p + 1, (s + e) / 2 + 1, e, a); } int main() { std::ios::sync_with_stdio(false); scanf( %d%d , &n, &m); g.resize(n); memset(ind, 0, sizeof(ind)); build(1, 0, n - 1); for (int i = 0, a, b; i < m; i++) { scanf( %d%d , &a, &b); a--, b--; g[a].push_back(b); ind[b]++; } for (int i = 0; i < n; i++) if (ind[i] == 0) root.push_back(i); for (int i = 0; i < n; i++) { scanf( %d , a + i); a[i]--; } t = 0; gift.resize(n); for (int i = 0; i < root.size(); i++) { int r = root[i]; dpth[r] = 0; dfs(r); anc.clear(); dfs2(r); sort(anc.begin(), anc.end()); for (int j = 0; j < anc.size(); j++) { for (int k = 0; k < gift[anc[j].second].size(); k++) if (get(1, 0, n - 1, s[gift[anc[j].second][k]]) <= 0) { puts( -1 ); return 0; } ans.push_back(anc[j].second + 1); update(1, 0, n - 1, s[anc[j].second], e[anc[j].second], -1); } } printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; void matches(vector<int> arr) { int i; for (i = 0; i < arr.size(); i++) { if (arr[i] == 2) cout << 2 << endl; else if (arr[i] % 2 == 0 && arr[i] != 2) cout << 0 << endl; else cout << 1 << endl; } } int main() { int i, n; cin >> n; vector<int> arr(n); for (i = 0; i < n; i++) { cin >> arr[i]; } matches(arr); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int INF = 1000000001; const long long LINF = 1000000000000000001LL; struct ConvexHullTrick { struct line { int a; long long b; long long eval(int x) { return (long long)a * x + b; } }; bool incrSlope, incrQueries, queryMax; ConvexHullTrick(bool incrSlope, bool incrQueries, bool queryMax) : incrSlope(incrSlope), incrQueries(incrQueries), queryMax(queryMax) { assert(incrSlope xor incrQueries xor queryMax); } deque<line> lines; long long overtakes(const line &p, const line &q) { long long x = p.b - q.b; int y = p.a - q.a; return (x >= 0 ? x : x - y + 1) / y; } bool redundantTop(const line &l) { int s = lines.size(); if (l.a == lines[s - 1].a) { return true; } else { return overtakes(l, lines[s - 1]) >= overtakes(lines[s - 1], lines[s - 2]); } } void add(int a, long long b) { if (!(incrSlope xor incrQueries xor queryMax)) a *= -1; if (queryMax) b *= -1; if (!lines.empty() && a == lines.back().a && b >= lines.back().b) { return; } line l = {a, b}; while (lines.size() >= 2 && redundantTop(l)) { lines.pop_back(); } lines.push_back(l); } long long query(int x) { if (!(incrSlope xor incrQueries)) x *= -1; while (lines.size() >= 2 && lines[0].eval(x) > lines[1].eval(x)) { lines.pop_front(); } return lines.front().eval(x) * (queryMax ? -1 : 1); } }; int main() { ios_base::sync_with_stdio(false); ConvexHullTrick hull(false, false, true); auto add = [&](long long dpValue, int x) { hull.add(-x, dpValue); }; int n; cin >> n; struct rect { int x, y; long long a; }; vector<rect> rects(n); for (auto &e : rects) { cin >> e.x >> e.y >> e.a; } sort(rects.begin(), rects.end(), [&](const rect &a, const rect &b) { return a.x < b.x; }); vector<long long> dp(n + 1, 0); add(0, 0); for (int i = (1); i <= (n); i++) { auto r = rects[i - 1]; dp[i] = (long long)r.x * r.y - r.a + hull.query(r.y); add(dp[i], r.x); } long long ans = *max_element(dp.begin(), dp.end()); cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, M; long long tblX[1001001]; int minp[1001001]; long long gs[1001001]; long long bsum[1001001]; long long bsums0[1001001]; long long bsums1[1001001]; long long bsums2[1001001]; long long linsum(long long K) { long long P = K, Q = K + 1; if (P % 2 == 0) P /= 2; else Q /= 2; return (P * Q) % 1000000007; } long long sqrsum(long long K) { long long ret = K; ret = ret * (K + 1) % 1000000007; ret = ret * ((2 * K + 1) % 1000000007) % 1000000007; return ret * ((1000000007 + 1) / 6) % 1000000007; } void erat() { for (int i = 0; i <= 1000000; i++) minp[i] = -1; for (int i = 2; i <= 1000000; i++) if (minp[i] == -1) { for (int j = i; j <= 1000000; j += i) if (minp[j] == -1) minp[j] = i; } } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long count(long long a, long long b) { if (min(N, M) <= a + b - 1) return 0; long long pat = (long long)(N - (a + b - 1)) * (M - (a + b - 1)) % 1000000007; long long ec = a * a + b * b - 2 * (a + b) + 2 * gcd(a, b); ec %= 1000000007; return pat * ec % 1000000007; } void calc_gs() { gs[1] = 1; for (int i = 2; i <= 1000000; i++) { int p = i, q = i; long long aux = 0; int ord = 0; while (q % minp[i] == 0) { ++ord; q /= minp[i]; } long long pow = 1; for (int j = 0; j < ord - 1; j++) pow = (pow * minp[i]); aux += pow * minp[i]; aux += pow * (minp[i] - 1) * ord; aux %= 1000000007; aux = aux * gs[q] % 1000000007; gs[i] = aux; } } void calc_bsum() { bsum[0] = 0; for (int i = 1; i <= 1000000; i++) { long long tmp = sqrsum(i) + sqrsum(i - 1) + 2 * 1000000007 - (2 * i * (long long)i % 1000000007) + 2 * gs[i]; bsum[i] = tmp % 1000000007; } } void totalize() { bsums0[0] = bsums1[0] = bsums2[0] = 0; for (int i = 1; i <= 1000000; i++) { bsums0[i] = (bsums0[i - 1] + bsum[i]) % 1000000007; bsums1[i] = (bsums1[i - 1] + bsum[i] * i % 1000000007) % 1000000007; bsums2[i] = (bsums2[i - 1] + bsum[i] * i % 1000000007 * i % 1000000007) % 1000000007; } } int main() { erat(); calc_gs(); calc_bsum(); totalize(); int T; scanf( %d , &T); for (int i = 0; i < T; i++) { scanf( %d%d , &N, &M); if (N > M) swap(N, M); long long ret = (long long)(N + 1) * (M + 1) % 1000000007 * bsums0[N]; ret += 1000000007 - ((long long)(N + M + 2) * bsums1[N] % 1000000007); ret += bsums2[N]; ret %= 1000000007; printf( %d n , (int)ret); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n1; int i, j; int main() { int a[10] = {4, 7, 47, 74, 447, 474, 477, 774, 747, 744}; string n; cin >> n; int z = n.length(); stringstream stoi(n); stoi >> n1; for (i = 0; i < 10; i++) { if (n1 % a[i] == 0) { cout << YES ; return 0; } } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; const double pi = acos(-1); int sign(double k) { if (k > eps) return 1; else if (k < -eps) return -1; return 0; } int cmp(double k1, double k2) { return sign(k1 - k2); } int inmid(double k1, double k2, double k3) { return sign(k1 - k3) * sign(k2 - k3) <= 0; } struct point { double x, y; point operator+(const point &k1) const { return (point){k1.x + x, k1.y + y}; } point operator-(const point &k1) const { return (point){x - k1.x, x - k1.y}; } point operator*(double &k1) const { return (point){x * k1, y * k1}; } point operator/(double &k1) const { return (point){x / k1, y / k1}; } int operator==(const point &k1) const { return cmp(x, k1.x) == 0 && cmp(y, k1.y) == 0; } double abs() { return sqrt(x * x + y * y); } double abs2() { return x * x + y * y; } double dis(point k1) { return ((*this) - k1).abs(); } }; struct osc { double ang; int v; }; bool osccmp(osc a, osc b) { int res = cmp(a.ang, b.ang); if (res == -1) return 1; if (res == 0 && a.v > b.v) return 1; return 0; } int n, K; int sz; osc angle[400050]; point a[100050]; bool check(double R) { sz = 0; int now = 0; for (int i = 1; i <= n; i++) { double d = a[i].abs() / 2; if (cmp(d, R) == 1) continue; double t = atan2(a[i].y, a[i].x); if (t < 0) t += 2 * pi; double dt = acos(d / R); double f = t - dt, s = t + dt; if (cmp(f, 0.0) == -1) f += 2 * pi; if (cmp(s, 2 * pi) == 1) s -= 2 * pi; if (cmp(f, s) == 1 || cmp(f, 0.0) == 0) now++; angle[++sz] = (osc){f, 1}; angle[++sz] = (osc){s, -1}; } sort(angle + 1, angle + sz + 1, osccmp); for (int i = 1; i <= sz; i++) { now += angle[i].v; if (now >= K) return 1; } return 0; } int main() { ios_base::sync_with_stdio(false); cin >> n >> K; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; if (x == 0 && y == 0) { K--; i--; n--; continue; } a[i] = (point){(double)x, (double)y}; } if (K <= 0) { cout << fixed << setprecision(10) << 0.0 << n ; return 0; } double l = 0, r = 200000; for (int round = 1; round <= 100; round++) { double mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } cout << fixed << setprecision(10) << l << n ; return 0; }
|
#include <bits/stdc++.h> std::mt19937 rng( (int)std::chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9 + 7; const int ms = 220; int c = 1; int to[ms][20]; int fail[ms]; int cost[ms]; int addString(const std::vector<int> &str) { int on = 0; for (auto ch : str) { if (to[on][ch] == 0) { to[on][ch] = c++; } on = to[on][ch]; } return on; } void buildAho() { std::queue<int> que; que.push(0); while (!que.empty()) { int on = que.front(); que.pop(); cost[on] += cost[fail[on]]; for (int i = 0; i < 20; i++) { if (to[on][i]) { fail[to[on][i]] = on == 0 ? 0 : to[fail[on]][i]; que.push(to[on][i]); } else { to[on][i] = to[fail[on]][i]; } } } } int l[ms], r[ms]; int dp[ms][ms][505]; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); int n, m, k; std::cin >> n >> m >> k; { int len; std::cin >> len; while (len > 0) { std::cin >> l[ms - len]; len--; } l[ms - 1]--; for (int i = ms - 1; l[i] < 0; i--) { l[i] += m; l[i - 1]--; } } { int len; std::cin >> len; while (len > 0) { std::cin >> r[ms - len]; len--; } } while (n--) { int len; std::cin >> len; std::vector<int> str(len); for (auto &v : str) std::cin >> v; int v; std::cin >> v; cost[addString(str)] += v; } buildAho(); { for (int i = 0; i < c; i++) { for (int j = 0; j <= k; j++) { dp[0][i][j] = 1; } } for (int i = 1; i < ms; i++) { for (int j = 0; j < c; j++) { for (int val = 0; val <= k; val++) { for (int ch = 0; ch < m; ch++) { int newState = to[j][ch]; int newCost = val - cost[newState]; if (newCost >= 0) { dp[i][j][val] = (dp[i][j][val] + dp[i - 1][newState][newCost]) % MOD; } } } } } } int ans = 0; { bool wtf = false; int st = 0; int sum = k; for (int on = 0; on < ms; on++) { if (!wtf && r[on] == 0) { continue; } for (int i = (wtf ? 0 : 1); i < r[on]; i++) { int newState = to[st][i]; int newCost = sum - cost[newState]; if (newCost >= 0) { ans = (ans + dp[ms - on - 1][newState][newCost]) % MOD; } } st = to[st][r[on]]; sum -= cost[st]; if (wtf) { for (int i = 1; i < m; i++) { int newState = to[0][i]; int newCost = k - cost[newState]; if (newCost >= 0) { ans = (ans + dp[ms - on - 1][newState][newCost]) % MOD; } } } wtf = true; } if (sum >= 0) { ans = (ans + 1) % MOD; } } { bool wtf = false; int st = 0; int sum = k; for (int on = 0; on < ms; on++) { if (!wtf && l[on] == 0) { continue; } for (int i = (wtf ? 0 : 1); i < l[on]; i++) { int newState = to[st][i]; int newCost = sum - cost[newState]; if (newCost >= 0) { ans = (ans - dp[ms - on - 1][newState][newCost]) % MOD; } } st = to[st][l[on]]; sum -= cost[st]; if (wtf) { for (int i = 1; i < m; i++) { int newState = to[0][i]; int newCost = k - cost[newState]; if (newCost >= 0) { ans = (ans - dp[ms - on - 1][newState][newCost]) % MOD; } } } wtf = true; } if (wtf && sum >= 0) { ans = (ans - 1 + MOD) % MOD; } } ans = (ans % MOD + MOD) % MOD; std::cout << ans << std::endl; }
|
#include <bits/stdc++.h> using namespace std; long long i, j, k, l, n, m, s, sum, K; double an; const long long N = 1020; long long f[N][N], lu[N][N], ld[N][N], ru[N][N], rd[N][N]; long long Lu[N][N], Ld[N][N], Ru[N][N], Rd[N][N]; int hang[N], lie[N]; char a[N][N]; void work(long long x, long long y) { long long s = 0; long long sum = 0; for (long long i = 1; i < y; i++) { sum += s; f[x][i] += sum; s++; } sum += 3 * s; for (long long i = y + 1; i <= m; i++) { sum += s; f[x][i] += sum; s++; } s = 0; sum = 0; for (long long i = m; i > y; i--) { sum += s; f[x][i] += sum; s++; } sum += 3 * s; for (long long i = y - 1; i >= 1; i--) { sum += s; f[x][i] += sum; s++; } s = 0; sum = 0; for (long long i = 1; i < x; i++) { sum += s; f[i][y] += sum; s++; } sum += 3 * s; for (long long i = x + 1; i <= n; i++) { sum += s; f[i][y] += sum; s++; } s = 0; sum = 0; for (long long i = n; i > x; i--) { sum += s; f[i][y] += sum; s++; } sum += 3 * s; for (long long i = x - 1; i >= 1; i--) { sum += s; f[i][y] += sum; s++; } } int main() { scanf( %I64d%I64d , &n, &m); for (long long i = 1; i <= n; i++) { scanf( %s , a[i] + 1); for (long long j = 1; j <= m; j++) if (a[i][j] == X ) { hang[i] = j; lie[j] = i; break; } } for (long long i = 1; i <= n; i++) { long long s = 0; long long sum = 0; for (long long j = 1; j <= m; j++) { sum += s; lu[i][j] = lu[i - 1][j] + sum + Lu[i - 1][j] * 1; if (a[i][j] != X ) s++; Lu[i][j] = Lu[i - 1][j] + s; } } for (long long i = 1; i <= n; i++) { long long s = 0; long long sum = 0; for (long long j = m; j >= 1; j--) { sum += s; ru[i][j] = ru[i - 1][j] + sum + Ru[i - 1][j] * 1; if (a[i][j] != X ) s++; Ru[i][j] = Ru[i - 1][j] + s; } } for (long long i = n; i >= 1; i--) { long long s = 0; long long sum = 0; for (long long j = 1; j <= m; j++) { sum += s; ld[i][j] = ld[i + 1][j] + sum + Ld[i + 1][j] * 1; if (a[i][j] != X ) s++; Ld[i][j] = Ld[i + 1][j] + s; } } for (long long i = n; i >= 1; i--) { long long s = 0; long long sum = 0; for (long long j = m; j >= 1; j--) { sum += s; rd[i][j] = rd[i + 1][j] + sum + Rd[i + 1][j] * 1; if (a[i][j] != X ) s++; Rd[i][j] = Rd[i + 1][j] + s; } } long long sx = 0; for (long long i = 1; i <= n; i++) { bool ok = false; for (long long j = 1; j <= m; j++) if (a[i][j] == X ) { sx++; work(i, j); ok = true; break; } if (!ok) work(i, 0); } for (long long j = 1; j <= m; j++) { bool ok = false; for (long long i = 1; i <= n; i++) if (a[i][j] == X ) { ok = true; break; } if (!ok) work(0, j); } for (long long i = 1; i <= n; i++) for (long long j = 1; j <= m; j++) if (a[i][j] != X ) { an += lu[i - 1][j - 1] + ru[i - 1][j + 1] + ld[i + 1][j - 1] + rd[i + 1][j + 1]; an += (Lu[i - 1][j - 1] + Ru[i - 1][j + 1] + Ld[i + 1][j - 1] + Rd[i + 1][j + 1]) * 2; an += f[i][j]; } for (i = 1; i < n; i++) { int j = i; while (hang[j] && hang[j + 1] && (hang[j + 1] > hang[j])) j++; for (int x = i; x < j; x++) for (int y = x + 1; y <= j; y++) { if (hang[x] < hang[y]) an += 4 * (hang[x] - 1) * (m - hang[y]); else an += 4 * (hang[y] - 1) * (m - hang[x]); } i = j; } for (i = 1; i < n; i++) { int j = i; while (hang[j] && hang[j + 1] && (hang[j + 1] < hang[j])) j++; for (int x = i; x < j; x++) for (int y = x + 1; y <= j; y++) { if (hang[x] < hang[y]) an += 4 * (hang[x] - 1) * (m - hang[y]); else an += 4 * (hang[y] - 1) * (m - hang[x]); } i = j; } for (i = 1; i < m; i++) { int j = i; while (lie[j] && lie[j + 1] && (lie[j + 1] > lie[j])) j++; for (int x = i; x < j; x++) for (int y = x + 1; y <= j; y++) { if (lie[x] < lie[y]) an += 4 * (lie[x] - 1) * (n - lie[y]); else an += 4 * (lie[y] - 1) * (n - lie[x]); } i = j; } for (i = 1; i < m; i++) { int j = i; while (lie[j] && lie[j + 1] && (lie[j + 1] < lie[j])) j++; for (int x = i; x < j; x++) for (int y = x + 1; y <= j; y++) { if (lie[x] < lie[y]) an += 4 * (lie[x] - 1) * (n - lie[y]); else an += 4 * (lie[y] - 1) * (n - lie[x]); } i = j; } an = an / ((n * m - sx) * (n * m - sx)); printf( %.8lf , an); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 610; int N; vector<int> edge[MAXN]; bool seen[MAXN]; int mtype[MAXN]; int par[MAXN]; int get_count(vector<int> v) { if (v.size() <= 1) return 0; cout << ? << v.size() << n ; for (int i = 0; i < v.size(); i++) { if (i) cout << ; cout << v[i] + 1; } cout << n << flush; int r; cin >> r; return r; } int through(vector<int> v, int cloc) { int l = get_count(v); v.push_back(cloc); int r = get_count(v); v.pop_back(); return r - l; } vector<int> find_all(vector<int> v, int cloc, int ntot) { vector<int> res; if (!ntot) return res; if (ntot == v.size()) { for (int x : v) res.push_back(x); return res; } vector<int> vleft, vright; for (int i = 0; i < v.size(); i++) { if (i % 2 == 0) vleft.push_back(v[i]); else vright.push_back(v[i]); } int tnew = through(vleft, cloc); res = find_all(vleft, cloc, tnew); vector<int> vres = find_all(vright, cloc, ntot - tnew); for (int x : vres) res.push_back(x); return res; } void bflood(int x) { for (int neigh : edge[x]) { if (par[neigh] == -1) { par[neigh] = x; bflood(neigh); } } } void solve_bad(int l, int r) { for (int i = 0; i < MAXN; i++) par[i] = -1; par[l] = l; bflood(l); vector<int> res; int cloc = r; while (cloc != l) { res.push_back(cloc); cloc = par[cloc]; } res.push_back(cloc); cout << N << res.size() << n ; for (int i = 0; i < res.size(); i++) { if (i) cout << ; cout << res[i] + 1; } cout << endl; } void wrong(vector<int> v) { int vtot = get_count(v); while (true) { int cloc = v.back(); v.pop_back(); if (get_count(v) != vtot) { for (int i = 0; i < v.size(); i++) { vector<int> vq; vq.push_back(cloc); vq.push_back(v[i]); if (get_count(vq)) { solve_bad(cloc, v[i]); return; } } } } } void dfs(int cloc) { seen[cloc] = true; vector<int> vposs; for (int i = 0; i < N; i++) if (cloc != i && !edge[i].size()) vposs.push_back(i); vector<int> bv = find_all(vposs, cloc, through(vposs, cloc)); for (int i = 0; i < bv.size(); i++) { edge[cloc].push_back(bv[i]); edge[bv[i]].push_back(cloc); } for (int i = 0; i < bv.size(); i++) { int neigh = bv[i]; if (!seen[neigh]) dfs(neigh); } } void flood(int cloc, int ctype) { mtype[cloc] = ctype; for (int neigh : edge[cloc]) { if (!mtype[neigh]) flood(neigh, 3 - ctype); } } int main() { ios_base::sync_with_stdio(0); cin >> N; dfs(0); flood(0, 1); vector<int> v1, v2; for (int i = 0; i < N; i++) { if (mtype[i] == 1) v1.push_back(i); else v2.push_back(i); } if (get_count(v1) > 0) wrong(v1); else if (get_count(v2) > 0) wrong(v2); else { cout << Y << v1.size() << n ; for (int i = 0; i < v1.size(); i++) { if (i) cout << ; cout << v1[i] + 1; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { char c; char prev; vector<int> A; int i = 0, count = 1; scanf( %c , &prev); A.push_back(1); while (scanf( %c , &c) != EOF) { if (c != + && c != - ) continue; if (c == prev) { A[i]++; } else { if (!(A[i] & 1)) { if (i != 0) { A[i - 1] += A[i]; A.erase(A.begin() + i); i--; } A[i]++; prev = c; } else { A.push_back(1); i++; prev = c; } } } int flag = 0; while (flag == 0 && A.size() != 1) { flag = 1; for (vector<int>::iterator it = A.begin(); it != A.end(); it++) { if (!((*it) & 1)) { flag = 0; if (it != A.begin()) { *it += *(it - 1); } if ((it + 1) != A.end()) { *it += *(it + 1); } if ((it + 1) != A.end()) A.erase(it + 1); if (it != A.begin()) A.erase(it - 1); break; } } } if (A.size() == 1 && !(A[0] & 1)) cout << Yes n ; else cout << No n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 505; vector<int> g[N]; int used[N], cant, pep[N][N]; void dfs(int u, int col) { if (g[u].size() == 0) return; used[u] = col; int ncol = ((col == 1) ? 2 : 1); for (int v : g[u]) if (!used[v]) { dfs(v, ncol); } else if (used[v] == col) { cant = 1; } } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) { int u, v; scanf( %d %d , &u, &v); pep[u][v] = pep[v][u] = 1; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (!pep[i][j] && i != j) { g[i].push_back(j); } } } for (int i = 1; i <= n; ++i) { if (!used[i]) dfs(i, 1); } if (cant) { printf( No n ); return 0; } char s[N]; for (int i = 1; i <= n; ++i) { if (used[i] == 1) { s[i - 1] = a ; } else if (used[i] == 2) { s[i - 1] = c ; } else { s[i - 1] = b ; } } s[n] = 0 ; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (pep[i][j]) { if (abs(s[i - 1] - s[j - 1]) > 1) { printf( No n ); return 0; } } } } printf( Yes n%s n , s); return (0); }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 2; bool vis[N]; int trie[N * 20][2], sz; void inser(int n) { int curr = 0; for (int i = 19; i >= 0; i--) { int dir = (n >> i) & 1; if (trie[curr][dir] == -1) trie[curr][dir] = ++sz; curr = trie[curr][dir]; } } int query(int n) { int curr = 0, ans = 0; for (int i = 19; i >= 0; i--) { int dir = (n >> i) & 1; if (trie[curr][dir] != -1) { curr = trie[curr][dir]; } else { ans += (1 << i); curr = trie[curr][1 ^ dir]; } } return ans; } int main() { memset(trie, -1, sizeof(trie)); int n, q; scanf( %d%d , &n, &q); while (n--) { int a; scanf( %d , &a); vis[a] = true; } for (int i = 0; i < N; i++) if (!vis[i]) inser(i); int xorval = 0; while (q--) { int x; scanf( %d , &x); xorval ^= x; printf( %d n , query(xorval)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 55; const long long M = 1000003; struct ban { long long x; ban() { x = 0; } ban(long long x) { this->x = x % M; } }; bool operator<(const ban& a, const ban& b) { return a.x < b.x; } bool operator>(const ban& a, const ban& b) { return a.x > b.x; } bool operator==(const ban& a, const ban& b) { return a.x == b.x; } ban operator+(const ban& a, const ban& b) { return ban(a.x + b.x); } ban operator*(const ban& a, const ban& b) { return ban(a.x * b.x); } ban ast(ban x, int n) { if (n == 0) return ban(1); if (n % 2 == 0) { ban y = ast(x, n / 2); return y * y; } else { ban y = ast(x, n - 1); return x * y; } } ban operator/(const ban& a, const ban& b) { return a * ast(b, M - 2); } ban operator-(const ban& a, const ban& b) { return ban(a.x - b.x + M); } const int n = 50; const int m = 10; ban a[N][N]; ban b[N]; int w[N]; ban g[N]; int solv() { for (int ii = 1; ii <= n; ++ii) { cout << ? << ii << endl; cin >> b[ii].x; for (int j = 0; j <= m; ++j) a[ii][j] = ast(ban(ii), j); } for (int jj = 0, ii = 1; jj <= m && ii <= n; ++jj) { ban maxu; int maxi; for (int i = ii; i <= n; ++i) { if (a[i][jj] > maxu) { maxu = a[i][jj]; maxi = i; } } w[jj] = ii; for (int j = 0; j <= m; ++j) { swap(a[ii][j], a[maxi][j]); } swap(b[ii], b[maxi]); for (int i = 1; i <= n; ++i) { if (i == ii) continue; ban t = a[i][jj] / a[ii][jj]; for (int j = jj; j <= m; ++j) { a[i][j] = a[i][j] - a[ii][j] * t; } b[i] = b[i] - b[ii] * t; } ++ii; } for (int jj = 0; jj <= m; ++jj) { int ii = w[jj]; if (ii == 0) continue; g[jj] = b[ii] / a[ii][jj]; } for (int x = 0; x < M; ++x) { ban u; for (int j = 0; j <= m; ++j) { u = u + g[j] * ast(ban(x), j); } if (u.x == 0) return x; } return -1; } int main() { int x = solv(); cout << ! << x << endl; return 0; }
|
#include <bits/stdc++.h> int pprime[1010] = {0}; int prime[1010]; int total; void Getprime() { int i, j; for (i = 2; i * i <= 1010; i++) { if (!pprime[i]) { for (j = i; j * i <= 1010; j++) pprime[j * i] = 1; } } total = 0; for (i = 2; i <= 1010; i++) if (!pprime[i]) prime[total++] = i; } struct Edge { int next; int v; int gcd, lcm; } edge[10010]; int head[110]; int pos; void insert(int x, int y, int gcd, int lcm) { edge[pos].next = head[x]; edge[pos].v = y; edge[pos].gcd = gcd; edge[pos].lcm = lcm; head[x] = pos++; } int ans[110]; int mark[110]; bool dfs(int now, int pre) { int i; int l, r; for (i = head[now]; i; i = edge[i].next) { int v = edge[i].v; if (v == pre) continue; l = edge[i].gcd; r = edge[i].lcm; if (mark[now] != l && mark[now] != r) return false; if (mark[now] == l) { if (mark[v] == r) continue; else if (mark[v] == -1) { mark[v] = r; if (!dfs(v, now)) { mark[v] = -1; return false; } } else return false; } else { if (mark[v] == l) continue; else if (mark[v] == -1) { mark[v] = l; if (!dfs(v, now)) { mark[v] = -1; return false; } } else return false; } } return true; } struct fff { int x, y, gcd, lcm; } ooxx[10010]; int judge(int m) { for (int i = 0; i < m; i++) { if (ooxx[i].gcd != 1) return ooxx[i].gcd; if (ooxx[i].lcm != 1) return ooxx[i].lcm; } return 0; } int main() { Getprime(); int n, m; int x, y; int l, r; int now; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) ans[i] = 1; for (int i = 0; i < m; i++) scanf( %d %d %d %d , &ooxx[i].x, &ooxx[i].y, &ooxx[i].gcd, &ooxx[i].lcm); for (int i = 0; i < m; i++) if (ooxx[i].lcm % ooxx[i].gcd != 0) { printf( NO n ); return 0; } int flag; for (int k = 0; k < total; k++) { flag = judge(m); if (!flag) break; now = prime[k]; memset(head, 0, sizeof(head)); pos = 1; for (int i = 0; i < m; i++) { x = ooxx[i].x; y = ooxx[i].y; l = 0; r = 0; while (ooxx[i].gcd % now == 0) { l++; ooxx[i].gcd /= now; } while (ooxx[i].lcm % now == 0) { r++; ooxx[i].lcm /= now; } insert(x, y, l, r); insert(y, x, l, r); } memset(mark, -1, sizeof(mark)); for (int i = 1; i <= n; i++) if (mark[i] == -1) { if (!head[i]) { mark[i] = 0; continue; } int j = head[i]; l = edge[j].gcd; r = edge[j].lcm; mark[i] = l; if (dfs(i, -1)) continue; mark[i] = r; if (dfs(i, -1)) continue; printf( NO n ); return 0; } for (int i = 1; i <= n; i++) { int add = 1; int time = mark[i]; while (time--) add *= now; ans[i] *= add; } } while (1) { flag = judge(m); if (!flag) break; now = flag; memset(head, 0, sizeof(head)); pos = 1; for (int i = 0; i < m; i++) { x = ooxx[i].x; y = ooxx[i].y; l = 0; r = 0; while (ooxx[i].gcd % now == 0) { l++; ooxx[i].gcd /= now; } while (ooxx[i].lcm % now == 0) { r++; ooxx[i].lcm /= now; } insert(x, y, l, r); insert(y, x, l, r); } memset(mark, -1, sizeof(mark)); for (int i = 1; i <= n; i++) if (mark[i] == -1) { if (!head[i]) { mark[i] = 0; continue; } int j = head[i]; l = edge[j].gcd; r = edge[j].lcm; mark[i] = l; if (dfs(i, -1)) continue; mark[i] = r; if (dfs(i, -1)) continue; printf( NO n ); return 0; } for (int i = 1; i <= n; i++) { int add = 1; int time = mark[i]; while (time--) add *= now; ans[i] *= add; } } printf( YES n ); for (int i = 1; i <= n; i++) printf( %d , ans[i]); printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) const int maxn = 1e6 + 50; int seg[2 * maxn], ans[maxn], last_pos[maxn], next_pos[maxn]; int n, m; vector<int> v, get_val, partial_xor; vector<pair<pair<int, int>, int> > ques; void update(int val, int l, int r = n) { for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l & 1) seg[l++] ^= val; if (r & 1) seg[--r] ^= val; } } int get_xor(int idx) { int res = 0; for (idx += n; idx; idx >>= 1) res ^= seg[idx]; return res; } void sweep(int pos) { int val = get_val[v[pos]]; int nxt = next_pos[pos]; update(val, pos, nxt); } void input() { cin >> n; for (int i = 0; i < n; i++) { int b; cin >> b; if (i == 0) partial_xor.push_back(b); else partial_xor.push_back(partial_xor[i - 1] ^ b); get_val.push_back(b); v.push_back(b); last_pos[i] = n; } cin >> m; for (int i = 0; i < m; i++) { int l, r; cin >> l >> r; l--, r--; ques.push_back({{l, r}, i}); } } void map_it() { sort(get_val.begin(), get_val.end()); get_val.resize(unique((get_val).begin(), (get_val).end()) - get_val.begin()); for (int i = v.size() - 1; i > -1; i--) { v[i] = lower_bound((get_val).begin(), (get_val).end(), v[i]) - get_val.begin(); next_pos[i] = last_pos[v[i]]; last_pos[v[i]] = i; } for (int i = 0; i < get_val.size(); i++) update(get_val[i], last_pos[i]); } void answer_ques(int i) { pair<int, int> p = ques[i].first; ans[ques[i].second] = get_xor(p.second) ^ partial_xor[p.first] ^ partial_xor[p.second] ^ get_val[v[p.first]]; } void calc() { int go_pos = 0; int i = 0; sort(ques.begin(), ques.end()); while (go_pos < ques.size()) { while (go_pos < ques.size() and i == ques[go_pos].first.first) answer_ques(go_pos++); if (go_pos == ques.size()) break; while (i < ques[go_pos].first.first) sweep(i++); } } void ansing() { for (int i = 0; i < m; i++) cout << ans[i] << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); input(); map_it(); calc(); ansing(); }
|
#include <bits/stdc++.h> const long long mod = 1e9 + 7; const int N = 1e5 + 20; using namespace std; int main() { int n, s[N], m; s[0] = 0; cin >> n; for (int i = (1); i <= (n); i++) { cin >> m; s[i] = s[i - 1] + m; } cin >> m; for (int i = (1); i <= (m); i++) { int x, y; cin >> x >> y; cout << (s[y] - s[x - 1]) / 10 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int m, n; int out; cin >> m >> n; if (m >= n && m >= 2) { out = (m / 2) * n; if (m % 2 && n / 2) { out += (n / 2); } } else if (n > m && n >= 2) { out = (n / 2) * m; if (n % 2 && m / 2) { out += (m / 2); } } else { out = 0; } cout << out; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, p, l, r, cnt[600000], lg[600000], sum[600000], pre[600000][30], f[600000], g[600000]; bool cov[600000 << 6]; char s[600000]; struct Hash { const long long B1 = 233, mod1 = 998244353, B2 = 377, mod2 = 1000000007; long long h1[600000], pw1[600000], h2[600000], pw2[600000]; Hash() { memset(h1, 0, sizeof h1); memset(h2, 0, sizeof h2); } void build() { pw1[0] = pw2[0] = 1; h1[0] = h2[0] = 0; for (int i = 1; i <= n; ++i) { pw1[i] = pw1[i - 1] * B1 % mod1; h1[i] = (h1[i - 1] * B1 + s[i]) % mod1; pw2[i] = pw2[i - 1] * B2 % mod2; h2[i] = (h2[i - 1] * B2 + s[i]) % mod2; } } long long qry(int l, int r) { long long t1 = (h1[r] - h1[l - 1] * pw1[r - l + 1] % mod1 + mod1) % mod1; long long t2 = (h2[r] - h2[l - 1] * pw2[r - l + 1] % mod2 + mod2) % mod2; return t1 << 31 | t2; } } H; struct SA { int sa[600000], sa2[600000], x[600000], y[600000], rk[600000], lcp[22][600000]; void resort(int m) { memset(cnt, 0, sizeof cnt); for (int i = 1; i <= n; ++i) ++cnt[y[i]]; for (int i = 1; i <= m; ++i) cnt[i] += cnt[i - 1]; for (int i = 1; i <= n; ++i) sa2[cnt[y[i]]--] = i; memset(cnt, 0, sizeof cnt); for (int i = 1; i <= n; ++i) ++cnt[x[i]]; for (int i = 1; i <= m; ++i) cnt[i] += cnt[i - 1]; for (int i = n; i; --i) sa[cnt[x[sa2[i]]]--] = sa2[i]; rk[sa[1]] = 1; for (int i = 2; i <= n; ++i) { int u = sa[i], v = sa[i - 1]; rk[u] = rk[v] + (!(x[u] == x[v] && y[u] == y[v])); } } void build() { for (int i = 1; i <= n; ++i) { x[i] = s[i] - a + 1; y[i] = 1; } for (int i = n + 1; i <= n * 2; ++i) rk[i] = 0; resort(26); for (int k = 1; k < n; k <<= 1) { for (int i = 1; i <= n; ++i) { x[i] = rk[i]; y[i] = rk[i + k]; } resort(n); } for (int i = 1, j, h = 0; i <= n; lcp[0][rk[i++]] = h) for (h ? --h : h, j = sa[rk[i] - 1]; j && s[i + h] == s[j + h]; ++h) ; for (int i = 1; i <= 20; ++i) for (int j = 1; j + (1 << i) - 1 <= n; ++j) lcp[i][j] = min(lcp[i - 1][j], lcp[i - 1][j + (1 << (i - 1))]); } int qry(int x, int y) { x = rk[x]; y = rk[y]; if (x > y) swap(x, y); ++x; int l = lg[y - x + 1]; return min(lcp[l][x], lcp[l][y - (1 << l) + 1]); } } sa0, sa1; namespace p0 { bool ask(int l, int r) { for (int i = 0; i < 26; ++i) if (pre[r][i] - pre[l - 1][i] > 1) return 0; return 1; } } // namespace p0 namespace p1 { bool check(int l, int r, int i) { return H.qry(l, r - i) == H.qry(l + i, r); } bool ask(int l, int r) { int len = r - l + 1; for (int i = 1; i * i <= len; ++i) if (len % i == 0) { if (i < len && check(l, r, i)) return 1; if (len / i < len && check(l, r, len / i)) return 1; } return 0; } } // namespace p1 namespace p2 { bool check_border(int l, int r) { int len = r - l + 1; for (int i = 1; i <= p && i < len; ++i) if (H.qry(l, l + i - 1) == H.qry(r - i + 1, r)) return 1; for (int i = 1, mn = n - l + 1; i <= p && sa0.rk[l] + i <= n; ++i) { int t = sa0.rk[l] + i, j = sa0.sa[t]; mn = min(mn, sa0.lcp[0][t]); if (j > l && j <= r && j + mn > r) return 1; } for (int i = 1, mn = n - l + 1; i <= p && sa0.rk[l] - i; ++i) { int t = sa0.rk[l] - i, j = sa0.sa[t]; mn = min(mn, sa0.lcp[0][t + 1]); if (j > l && j <= r && j + mn > r) return 1; } return 0; } bool ask(int l, int r) { if (f[l] <= r || g[r] >= l) return 1; return check_border(l, r); } } // namespace p2 namespace p3 { int seg[600000 << 1]; void build(int x, int l, int r) { if (l == r) { seg[x] = f[l]; return; } int mid = (l + r) >> 1; build((x << 1), l, mid); build((x << 1 | 1), mid + 1, r); seg[x] = min(seg[(x << 1)], seg[(x << 1 | 1)]); } int qmin(int x, int l, int r, int L, int R) { if (l >= L && r <= R) return seg[x]; int mid = (l + r) >> 1, ret = n + 1; if (L <= mid) ret = min(ret, qmin((x << 1), l, mid, L, R)); if (R > mid) ret = min(ret, qmin((x << 1 | 1), mid + 1, r, L, R)); return ret; } bool ask(int l, int r) { if (pre[r][s[l] - a ] - pre[l][s[l] - a ]) return 1; if (pre[r - 1][s[r] - a ] - pre[l - 1][s[r] - a ]) return 1; if (qmin(1, 1, n, l, r) <= r) return 1; return 0; } } // namespace p3 void getsqr() { for (int i = 1; i <= n; ++i) { f[i] = n + 1; g[i] = 0; } for (int i = 1, j = 0; i <= n; ++i) lg[i] = j += (1 << (j + 1)) <= i; for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + n / i; for (int i = 1; i <= n; ++i) { int l = 0, r = 0; for (int j = i; j + i <= n; j += i) if (j > r) { l = sa1.qry(n - j + 1, n - (j + i) + 1), r = sa0.qry(j, j + i); l = j - l + 1; r = j + r - 1; if (r - l + 1 < i || cov[sum[i - 1] + j / i]) continue; for (int k = i * 2; l + k * 2 - 1 <= r + i; k += i) cov[sum[k - 1] + (l + k - 1) / k] = 1; for (int k = l; k <= r - i + 1; ++k) { f[k] = min(f[k], k + i * 2 - 1); g[k + i * 2 - 1] = max(g[k + i * 2 - 1], k); } } } p3::build(1, 1, n); } int main() { scanf( %d%s%d , &n, s + 1, &m); p = sqrt(n) + 10; H.build(); sa0.build(); reverse(s + 1, s + n + 1); sa1.build(); reverse(s + 1, s + n + 1); for (int i = 1; i <= n; ++i) for (int j = 0; j < 26; ++j) pre[i][j] = pre[i - 1][j] + (s[i] - a == j); getsqr(); while (m--) { scanf( %d%d , &l, &r); if (p0::ask(l, r)) puts( -1 ); else if (p1::ask(l, r)) puts( 1 ); else if (p2::ask(l, r)) puts( 2 ); else if (p3::ask(l, r)) puts( 3 ); else puts( 4 ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 7; const int MOD = (int)1e9 + 7; const long long INF = (long long)1e18 + 7; vector<vector<long long>> a; long long col[N], row[N], trow[N], tcol[N]; long long res; int m, n; long long getrow() { long long ma = trow[1]; long long pos = 1; for (int i = 2; i <= m; i++) if (trow[i] > ma) { ma = trow[i]; pos = i; } trow[pos] = 0; for (int i = 1; i <= n; i++) tcol[i] -= a[pos][i]; return max(0ll, ma); } long long getcol() { long long ma = tcol[1]; long long pos = 1; for (int i = 2; i <= n; i++) if (tcol[i] > ma) { ma = tcol[i]; pos = i; } tcol[pos] = 0; for (int i = 1; i <= m; i++) trow[i] -= a[i][pos]; return max(0ll, ma); } void sett() { for (int i = 1; i <= m; i++) trow[i] = row[i]; for (int i = 1; i <= n; i++) tcol[i] = col[i]; } void proces(int st, int nd, int rd, int th) { long long ma = 0; sett(); if (st) ma += getcol(); else ma += getrow(); if (nd) ma += getcol(); else ma += getrow(); if (rd) ma += getcol(); else ma += getrow(); if (th) ma += getcol(); else ma += getrow(); res = max(res, ma); } int main() { cin >> m >> n; a.resize(m + 1); for (int i = 1; i <= m; i++) { a[i].push_back(0); long long t; for (int j = 1; j <= n; j++) { cin >> t; a[i].push_back(t); } } for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) row[i] += a[i][j]; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) col[i] += a[j][i]; for (int a1 = 0; a1 <= 1; a1++) for (int a2 = 0; a2 <= 1; a2++) for (int a3 = 0; a3 <= 1; a3++) for (int a4 = 0; a4 <= 1; a4++) proces(a1, a2, a3, a4); cout << res; }
|
#include <bits/stdc++.h> using namespace std; long long dp[10001]; const long long INF = 1e60 + 7; long long binpow(long long a, long long b) { if (a == 0) { return 0; } if (b == 0) return 1; long long temp = binpow(a, b / 2); if (b & 1) { return temp * temp * a; } else return temp * temp; } long long poweroftwo(long long n) { if ((n && n & (n - 1)) == 0) cout << y ; else cout << n ; } long long binarysearch(long long a[], long long l, long long r, long long x) { while (l <= r) { long long mid = l + (r - l) / 2; if (a[mid] == x) return 1; else if (a[mid] > x) { r = mid - 1; } else { l = mid + 1; } } return 0; } long long findSplitPoint(long long arr[], long long n) { long long leftSum = 0; for (long long i = 0; i < n; i++) { leftSum += arr[i]; long long rightSum = 0; for (long long j = i + 1; j < n; j++) rightSum += arr[j]; if (leftSum == rightSum) return i + 1; } return -1; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); { long long n, m; cin >> n >> m; long long ans = 0; for (long long i = 0; i < n; i++) { long long x; cin >> x; ans = ans + x; cout << ans / m << ; ans = ans % m; } } }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int fx[] = {+1, -1, +0, +0, +1, +1, -1, -1, +0}; int fy[] = {+0, +0, +1, -1, +1, -1, +1, -1, +0}; template <typename T> inline T GCD(T a, T b) { a = abs(a); b = abs(b); while (b) { a = a % b; swap(a, b); } return a; } template <typename T> inline T LCM(T x, T y) { T tp = GCD(x, y); if ((x / tp) * 1. * y > 9e18) return 9e18; return (x / tp) * y; } template <typename T> inline T BigMod(T A, T B, T M) { T ret = 1; while (B) { if (B & 1) ret = (ret * A) % M; A = (A * A) % M; B = B >> 1; } return ret; } template <typename T> inline T ModInv(T A, T M) { return BigMod(A, M - 2, M); } template <typename T> bool scani(T &n) { n = 0; bool got = false; bool negative = false; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) negative = true; c = getchar(); } while (c >= 0 && c <= 9 ) { got = true; n = n * 10 + c - 48; c = getchar(); } if (negative) n = ~(n - 1); return got; } template <typename T> void write(T n, bool line = true) { if (n < 0) { putchar( - ); n = -n; } if (!n) { putchar( 0 ); if (line) putchar( n ); return; } char buff[22]; int len = 0; while (n) buff[len++] = n % 10 + 48, n /= 10; for (int i = len - 1; i >= 0; i--) putchar(buff[i]); if (line) putchar( n ); } int scans(char *a) { int i = 0; char c = 0; while (c < 33) c = getchar(); while (c > 33) { a[i++] = c; c = getchar(); } a[i] = 0; return i; } int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e; write(min(min(min(a / 1, b / 1), min(c / 2, d / 7)), e / 4)); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; bool vis[MAXN]; char str[MAXN]; int main() { gets(str); int len = strlen(str); char maxch = 0; memset(vis, false, sizeof(vis)); for (int i = len - 1; i >= 0; i--) { if (str[i] >= maxch) vis[i] = true; maxch = max(maxch, str[i]); } for (int i = 0; i < len; i++) { if (vis[i]) putchar(str[i]); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T &x) { x = 0; char c = getchar(); int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } x *= f; } template <class T> T gcd(T a, T b) { return !b ? a : gcd(b, a % b); } template <class T> inline void umin(T &x, T y) { x = x < y ? x : y; } template <class T> inline void umax(T &x, T y) { x = x > y ? x : y; } inline unsigned int R() { static unsigned int seed = 416; return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13; } const int N = 505000; int n; map<int, int> Map; pair<int, int> s[N]; int len; long long res; priority_queue<long long, vector<long long>, greater<long long> > heap; int main() { read(n); for (register int i = (1); i <= (n); i++) { int x; read(x); Map[x]++; res += x; } for (auto i : Map) s[++len] = pair<int, int>(i.first, i.second); int sum = 0; for (register int j = (len); j >= (1); j--) { int c = min(s[j].second, sum - 2 * ((int)heap.size())); vector<long long> cur(c, s[j].first); c = s[j].second - c; for (int i = 1; i <= c; i += 2) if (!heap.empty()) { long long t = heap.top(); heap.pop(); if (t < s[j].first) { cur.push_back(s[j].first); if (i < c) cur.push_back(s[j].first); } else { cur.push_back(t); if (t < 2 * s[j].first && i < c) cur.push_back(2 * s[j].first - t); } } for (auto i : cur) heap.push(i); sum += s[j].second; } while (!heap.empty()) res -= heap.top(), heap.pop(); cout << res; return 0; }
|
#include <bits/stdc++.h> unsigned long long int factorial(unsigned long long int n) { unsigned long long int facto; if (n == 0) return 1; return facto = n * factorial(n - 1); } int main() { long long int a, b, GCD; unsigned long long int fa, fb; scanf( %I64d %I64d , &a, &b); if (a > b) { fb = factorial(b); printf( %I64d n , fb); } else { fa = factorial(a); printf( %I64d n , fa); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int x[101010], v[101010], t[101010]; int n, s; int l[1010101], r[1010101]; bool check(double m) { memset(l, 0, sizeof(l)); memset(r, 0, sizeof(r)); for (int i = 1; i <= n; i++) { if (t[i] == 1) { if (1.0 * x[i] / v[i] < m) l[0]++; else { l[x[i]]++; l[max((long long)x[i], min(1000001LL, (long long)floor((m * (v[i] + s) - x[i]) * (s - v[i]) / s + x[i])) + 1)]--; } } else { if (1.0 * (1000000 - x[i]) / v[i] < m) r[0]++; else { r[min( x[i] + 1LL, max(0LL, (long long)ceil(x[i] - (m * (v[i] + s) + x[i] - 1000000) * (s - v[i]) / s)))]++; r[x[i] + 1]--; } } } for (int i = 1; i <= 1000000; i++) { l[i] += l[i - 1]; r[i] += r[i - 1]; if (l[i] && r[i]) return true; } return false; } int main() { scanf( %d %d , &n, &s); for (int i = 1; i <= n; i++) scanf( %d %d %d , &x[i], &v[i], &t[i]); double l1 = 1e-8, r1 = 1e6; while (r1 - l1 > 1e-7) { double mid = (l1 + r1) / 2; if (check(mid)) r1 = mid; else l1 = mid; } printf( %.12lf n , (l1 + r1) / 2); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a, b, ans; int main() { scanf( %d %d %d , &n, &a, &b); if (b < 0) { for (int i = b; i < 0; i++) { a--; if (a == 0) { a = n; } } ans = a; } else { for (int i = 0; i < b; i++) { a++; if (a > n) { a = 1; } } ans = a; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 40; const int MAXM = 210; int n, m, A[MAXN]; double p[MAXM][MAXN][MAXN]; void lucky() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &A[i]); } int main() { lucky(); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) p[0][i][j] = (A[i] > A[j]); double rat = 1.0 / (0.5 * n * (n + 1)); for (int R = 1; R <= m; R++) for (int l = 1; l <= n; l++) for (int r = l; r <= n; r++) { for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { int x = (l <= i && i <= r) ? l + r - i : i; int y = (l <= j && j <= r) ? l + r - j : j; p[R][i][j] += rat * p[R - 1][x][y]; } } double ans = 0; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) ans += p[m][i][j]; printf( %.10lf n , ans); return 0; }
|
#include<bits/stdc++.h> using namespace std; typedef unsigned long long int ull; typedef long long int ll; typedef long double ld; #define PB push_back #define MP make_pair #define F first #define S second #define Pair vector<pair<ll,ll>> #define vec vector <ll> #define all(a) a.begin(),a.end() #define mo 1000000007 #define decimal(i,n) fixed << setprecision(i) << n #define show(a) for(auto xyz:a)cout<<xyz<< ;cout<<endl; #define show_nl(a) for(auto xyz:a)cout<<xyz<<endl; #define MAX (ll)(pow(2,63)-1) #define fill(a,b) memset(a, b, sizeof(a)) #define yes cout<< YES <<endl; #define no cout<< NO <<endl; //modular inverse void eea(ll a,ll b,ll &x,ll &y) { if (a == 1) { x = 1; y = 0; return; } ll x1, y1; eea(b%a,a,x1,y1); x=y1-(b/a)*x1; y=x1; } ll mi(ll a,ll m) { ll x,y; eea(a,m,x,y); x= (x%m+m)%m; return x; } //complete void Sieve(int n) { int prime[n+1]; fill(prime,-1); for (int p=2; p*p<=n; p++) { if (prime[p] == -1) { for (int i=p*p; i<=n; i += p) prime[i] = 0; } } for (int p=2; p<=n; p++) { } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // freopen( ladder.in , r , stdin); // name of input file // freopen( ladder.out , w , stdout); // name of output file // ifstream fin( art.in ); // ofstream fout( art.out ); // fstream file, output; // file.open(R () , ios::in); // add the address of local input file // output.open(R () , ios::out); // add the address of local output file ll t=1,t1=1; cin>>t; while(t--) { ll n; cin>>n; string s; cin>>s; ll t=0,m=0,x=0; for(ll i=0;i<n;i++) { if(s[i]== M ) { m++; } else if(s[i]== T ) { t++; } if(m>t) x=1; } t=0,m=0; for(ll i=n-1;i>=0;i--) { if(s[i]== M ) { m++; } else if(s[i]== T ) { t++; } if(m>t) x=1; } if(2*m!=t) x=1; if(x==1) cout<< NO n ; else cout<< YES n ; } } /* Some helpful points 1.) Calm yourself 2.) check for semicolon or data type mismatch 3.) It can be solved */
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int z = 0; for (int i = 0; i < n; ++i) { int t; cin >> t; if ((5 - t) >= k) ++z; } cout << z / 3; return 0; }
|
#include <bits/stdc++.h> using namespace std; void getre() { int x = 0; printf( %d n , 1 / x); } void gettle() { int res = 1; while (1) res <<= 1; printf( %d n , res); } template <typename T, typename S> inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template <typename T, typename S> inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } template <typename N, typename PN> inline N flo(N a, PN b) { return a >= 0 ? a / b : -((-a - 1) / b) - 1; } template <typename N, typename PN> inline N cei(N a, PN b) { return a > 0 ? (a - 1) / b + 1 : -(-a / b); } template <typename N> N gcd(N a, N b) { return b ? gcd(b, a % b) : a; } template <typename N> inline int sgn(N a) { return a > 0 ? 1 : (a < 0 ? -1 : 0); } inline void gn(long long &x) { int sg = 1; char c; while (((c = getchar()) < 0 || c > 9 ) && c != - ) ; c == - ? (sg = -1, x = 0) : (x = c - 0 ); while ((c = getchar()) >= 0 && c <= 9 ) x = x * 10 + c - 0 ; x *= sg; } inline void gn(int &x) { long long t; gn(t); x = t; } inline void gn(unsigned long long &x) { long long t; gn(t); x = t; } inline void gn(double &x) { double t; scanf( %lf , &t); x = t; } inline void gn(long double &x) { double t; scanf( %lf , &t); x = t; } inline void gs(char *s) { scanf( %s , s); } inline void gc(char &c) { while ((c = getchar()) > 126 || c < 33) ; } inline void pc(char c) { putchar(c); } inline long long sqr(long long a) { return a * a; } inline double sqrf(double a) { return a * a; } const int inf = 0x3f3f3f3f; const double pi = 3.14159265358979323846264338327950288L; const double eps = 1e-6; const int mo = 1; int qp(int a, long long b) { int n = 1; do { if (b & 1) n = 1ll * n * a % mo; a = 1ll * a * a % mo; } while (b >>= 1); return n; } int n; int a[222]; int nok[33333]; int ok[33333]; int bo[222][222]; const int dinic_inf = 0x3f3f3f3f; const int DINIC_MAXV = 555 + 5; const int DINIC_MAXE = 55555 + 5; int s, t, vtot; struct edge { int v, next; int f; } e[DINIC_MAXE * 2]; int g[DINIC_MAXV], etot, eid; int ae(int u, int v, int f) { upmax(vtot, u); upmax(vtot, v); e[etot].v = v; e[etot].f = f; e[etot].next = g[u]; g[u] = etot++; e[etot].v = u; e[etot].f = 0; e[etot].next = g[v]; g[v] = etot++; return eid++; } int d[DINIC_MAXV]; bool lb() { for (int i = 0; i <= vtot; i++) d[i] = 0; static int qu[DINIC_MAXV]; int p = 0, q = 0; qu[q++] = s, d[s] = 1; while (p != q) { int u = qu[p++]; for (int i = g[u]; ~i; i = e[i].next) if (e[i].f && !d[e[i].v]) { d[e[i].v] = d[u] + 1; if (e[i].v == t) return 1; qu[q++] = e[i].v; } } return 0; } int aug(int u, int mi) { if (u == t) return mi; int su = 0, del; for (int i = g[u]; ~i; i = e[i].next) if (e[i].f && d[e[i].v] == d[u] + 1) { del = aug(e[i].v, min(mi, e[i].f)); e[i].f -= del; e[i ^ 1].f += del; mi -= del; su += del; if (!mi) break; } if (!su) d[u] = -1; return su; } int dinic() { int su = 0; while (lb()) su += aug(s, dinic_inf); return su; } void dinic_init() { static bool ini = 0; if (!ini) { ini = 1; memset(g, -1, sizeof(g)); } else { for (int i = 0; i <= vtot; i++) g[i] = -1; } etot = eid = 0; vtot = 2, s = 1, t = 2; } inline int capaof(int ei) { return e[ei << 1].f + e[ei << 1 ^ 1].f; } inline int flowof(int ei) { return e[ei << 1 ^ 1].f; } inline int resiof(int ei) { return e[ei << 1].f; } inline int uof(int ei) { return e[ei << 1 ^ 1].v; } inline int vof(int ei) { return e[ei << 1].v; } vector<int> nei[222]; int vis[222]; int cur = 0; vector<int> ans[222]; void dfs(int u) { if (vis[u]) return; ans[cur].push_back(u); vis[u] = 1; dfs(nei[u][0]); dfs(nei[u][1]); } int main() { nok[1] = 1; for (int i = 2; i <= 30000; i++) if (!nok[i]) for (int j = i + i; j <= 30000; j += i) nok[j] = 1; for (int i = 2; i <= 30000; i++) ok[i] = !nok[i]; gn(n); for (int i = (1), _ed = (n + 1); i < _ed; i++) gn(a[i]); for (int i = (1), _ed = (n + 1); i < _ed; i++) for (int j = (1), _ed = (n + 1); j < _ed; j++) if (i != j && ok[a[i] + a[j]]) bo[i][j] = 1; int nu0 = 0, nu1 = 0; for (int i = (1), _ed = (n + 1); i < _ed; i++) if (a[i] & 1) nu1++; else nu0++; if (nu0 != nu1) { printf( Impossible n ); return 0; } dinic_init(); for (int i = (1), _ed = (n + 1); i < _ed; i++) if (a[i] & 1) for (int j = (1), _ed = (n + 1); j < _ed; j++) if (bo[i][j]) ae(i, j, 1); s = n + 1, t = n + 2; for (int i = (1), _ed = (n + 1); i < _ed; i++) if (a[i] & 1) ae(s, i, 2); else ae(i, t, 2); int su = dinic(); if (su != n) { printf( Impossible n ); return 0; } for (int i = (0), _ed = (eid); i < _ed; i++) if (uof(i) != s && vof(i) != t && flowof(i) == 1) { nei[uof(i)].push_back(vof(i)); nei[vof(i)].push_back(uof(i)); } for (int i = (1), _ed = (n + 1); i < _ed; i++) if (!vis[i]) { ++cur; dfs(i); } printf( %d , cur); for (int i = (1), _ed = (cur + 1); i < _ed; i++) { printf( n%d , ans[i].size()); for (int j = (0), _ed = (((int)(ans[i]).size())); j < _ed; j++) printf( %d , ans[i][j]); } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) using namespace std; const int N = 101010, mod = 1e9 + 7; namespace { inline int add(int x, int y) { return (x += y) >= mod ? x - mod : x; } inline int sub(int x, int y) { return (x -= y) < 0 ? x + mod : x; } inline int mul(int x, int y) { return 1LL * x * y % mod; } } // namespace struct edge { int u, v, w; } e[N]; int n, K, fac[N]; map<long long, int> f[55][55]; vector<pair<int, int> > adj[N]; vector<int> allu, allv; long long least[N]; inline void U(int &x, int y) { (x += y) >= mod ? x -= mod : x; } int main(void) { scanf( %d%d , &n, &K); fac[0] = 1; for (int i = 1; i <= n; i++) { fac[i] = mul(fac[i - 1], i); } for (int i = 1, u, v, w; i <= K; i++) { scanf( %d%d%d , &u, &v, &w); e[i] = (edge){u, v, sub(w, 1)}; allu.push_back(u); allv.push_back(v); } sort(allu.begin(), allu.end()); sort(allv.begin(), allv.end()); allu.erase(unique(allu.begin(), allu.end()), allu.end()); allv.erase(unique(allv.begin(), allv.end()), allv.end()); int m = allu.size(); for (int i = 1; i <= K; i++) { int u = lower_bound(allu.begin(), allu.end(), e[i].u) - allu.begin(); int v = lower_bound(allv.begin(), allv.end(), e[i].v) - allv.begin(); adj[u].push_back((pair<int, int>){v, e[i].w}); } for (int i = m - 1; ~i; i--) { least[i] = least[i + 1]; for (auto p : adj[i]) { least[i] |= 1LL << p.first; } } f[0][0][0] = 1; for (int i = 0; i < m; i++) { for (int j = 0; j <= i; j++) { for (auto p : f[i][j]) { U(f[i + 1][j][p.first & least[i + 1]], p.second); for (auto t : adj[i]) { if (~p.first >> t.first & 1) { U(f[i + 1][j + 1][(p.first | (1LL << t.first)) & least[i + 1]], mul(p.second, t.second)); } } } } } int ans = 0; for (int i = 0; i <= m; i++) { for (auto p : f[m][i]) { U(ans, mul(p.second, fac[n - i])); } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); long long k = 0; cin >> k; if (k == 1) { cout << 4 ; return 0; } string s = ; unsigned long long a = 1000000000000000000; unsigned long long num = 0; long long f = 0; while (k > 0) { if (k >= 2) { k -= 2; s += to_string(8); num = (num * 10) + 8; } else { k -= 1; s += to_string(0); num = (num * 10) + 0; } if (num > a) { f = 1; break; } } if (f == 0) cout << s; else cout << -1 ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int N; vector<int> Q[100010]; long long F[100010][2]; bool vis[100010]; void dfs(int u) { if (vis[u]) return; vis[u] = true, F[u][1] = 1LL, F[u][0] = 0LL; if (!Q[u].size()) return; long long d0, d1; for (int i = 0; i < Q[u].size(); i++) { int v = Q[u][i]; dfs(v); d0 = (F[u][1] * F[v][1] + F[u][0] * F[v][0]) % 1000000007; d1 = (F[u][1] * F[v][0] + F[u][0] * F[v][1]) % 1000000007; F[u][0] = (F[u][0] + d0) % 1000000007; F[u][1] = (F[u][1] + d1) % 1000000007; } long long p0 = 1LL, p1 = 1LL, p2 = 0LL; for (int i = 0; i < Q[u].size(); i++) { int v = Q[u][i]; p0 = (p0 + p0 * F[v][0]) % 1000000007; long long tmp = p1; p1 = (p1 + p2 * F[v][1]) % 1000000007; p2 = (p2 + tmp * F[v][1]) % 1000000007; } F[u][0] = (F[u][0] * 2 - p2 + 1000000007) % 1000000007; F[u][1] = (F[u][1] * 2 - p0 + 1000000007) % 1000000007; return; } int main() { scanf( %d , &N); for (int i = 2; i <= N; i++) { int x; scanf( %d , &x); Q[x].push_back(i); } memset(vis, false, sizeof(vis)); memset(F, 0, sizeof(F)); dfs(1); cout << (F[1][0] + F[1][1]) % 1000000007 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int h[36020]; int main() { char sir[4005]; int a, n, i, j, suma, v[4005]; cin >> a; cin.get(); cin.get(sir + 1, 4005); n = strlen(sir + 1); v[0] = 0; for (i = 1; i <= n; i++) v[i] = v[i - 1] + (sir[i] - 0 ); for (i = 1; i <= n; i++) for (j = i; j <= n; j++) { suma = v[j] - v[i - 1]; h[suma]++; } long long int rasp = 0; for (i = 1; i <= n; i++) for (j = i; j <= n; j++) { suma = v[j] - v[i - 1]; if (a == 0) { if (suma == 0) rasp += ((n * (n + 1)) / 2); else rasp += h[0]; } else if (suma != 0) if (a % suma == 0) rasp += (((a / suma) < 36020) ? h[a / suma] : 0); } cout << rasp << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k; unordered_map<int, vector<int> > g; map<pair<int, int>, int> weights; map<pair<int, int>, int> idx; unordered_map<int, bool> used; struct elem { int prev; int u; long long dist; elem(int prev, int u, long long dist) : prev(prev), u(u), dist(dist) {} friend bool operator<(const elem& lh, const elem& rh) { return lh.dist > rh.dist; } }; int main() { ios_base::sync_with_stdio(false); cin >> n >> m >> k; for (int i = 1; i <= m; ++i) { int u, v, w; cin >> u >> v >> w; g[u].push_back(v); g[v].push_back(u); weights[make_pair(u, v)] = w; weights[make_pair(v, u)] = w; idx[make_pair(u, v)] = i; idx[make_pair(v, u)] = i; } vector<int> res; priority_queue<elem> q; q.push(elem(0, 1, 0)); int taken = 0; int mx = min(n, k); while (!q.empty() && mx != taken) { int prev = q.top().prev; int u = q.top().u; long long dist = q.top().dist; q.pop(); if (used[u]) continue; used[u] = true; if (prev) { res.push_back(idx[make_pair(prev, u)]); ++taken; } for (int v : g[u]) if (!used[v]) { q.push(elem(u, v, dist + weights[make_pair(u, v)])); } } cout << res.size() << endl; for (int i : res) cout << i << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int arr[100005]; long long ans = 0; int main() { int n; cin >> n; vector<int> a; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] % 2) a.push_back(arr[i]); else ans += arr[i]; } int i; if ((int)a.size() % 2) i = 1; else i = 0; sort(a.begin(), a.end()); int sz = a.size(); for (; i < sz; i++) ans += a[i]; cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 2e9; const long long INFL = 1e18; const int N = 3e5; int n, m, R; vector<int> adj[N + 5]; pair<int, int> E[2 * N + 5]; long long d[N + 5]; struct cmp { bool operator()(pair<int, long long> x, pair<int, long long> y) { return (x.second > y.second); } }; priority_queue<pair<int, long long>, vector<pair<int, long long> >, cmp> H; int tr[N + 5]; void Dijkstra() { for (int i = (1), _b = (n); i <= _b; ++i) d[i] = INFL; d[R] = 0; H.push(make_pair(R, d[R])); while (!H.empty()) { int u = H.top().first; long long oldDist = H.top().second; H.pop(); if (oldDist != d[u]) continue; for (int i = (0), _b = (((int)(adj[u]).size())); i < _b; ++i) { int v = E[adj[u][i]].first, w = E[adj[u][i]].second; if (d[u] + w < d[v] || d[u] + w == d[v] && E[adj[u][i]].second < E[tr[v]].second) { d[v] = d[u] + w; H.push(make_pair(v, d[v])); tr[v] = adj[u][i]; } } } } vector<int> pth; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; int cntE = 0; while (m--) { int u, v, w; cin >> u >> v >> w; E[++cntE] = make_pair(v, w); adj[u].push_back(cntE); E[++cntE] = make_pair(u, w); adj[v].push_back(cntE); } cin >> R; Dijkstra(); long long res = 0; for (int i = (1), _b = (n); i <= _b; ++i) if (i != R) { res += E[tr[i]].second; pth.push_back(tr[i]); } cout << res << n ; for (int i = (0), _b = (((int)(pth).size())); i < _b; ++i) cout << (pth[i] + 1) / 2 << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 2e5 + 10, MOD = 1e9 + 7; long long n, T, ni[MAXN], jie[MAXN], jie_ni[MAXN], A[MAXN], ans, sum; long long sum_N, sum_K; void Init() { ni[1] = 1; for (long long i = 2; i <= MAXN - 10; i++) { ni[i] = ((MOD - (MOD / i)) * ni[MOD % i] % MOD) % MOD; } jie_ni[0] = 1; for (long long i = 1; i <= MAXN - 10; i++) { jie_ni[i] = jie_ni[i - 1] * ni[i] % MOD; } jie[0] = 1; for (long long i = 1; i <= MAXN - 10; i++) { jie[i] = jie[i - 1] * i % MOD; } } long long Quick(long long x, long long y) { long long res = 1, a = x; while (y) { if (y & 1) res *= a, res %= MOD; a = a * a, a %= MOD; y /= 2; } return res; } long long C(long long x, long long y) { if (y == 0) return 1; if (x == y) return 1; return (jie[x] * jie_ni[y]) % MOD * jie_ni[x - y] % MOD; } long long work(long long N, long long K) { if (sum_N == 0) { sum_N = 1; for (long long i = 1; i <= K; i++) sum_N += C(N, i), sum_N %= MOD; sum_K = K; return sum_N; } else { sum_N = (sum_N * 2 - C(N - 1, sum_K) + MOD) % MOD; for (long long i = sum_K; i >= K + 1; i--) { sum_N -= C(N, i), sum_N = (sum_N + MOD) % MOD; } sum_K = K; return sum_N; } } signed main() { cin >> n >> T; Init(); for (long long i = 1; i <= n; i++) cin >> A[i]; long long BASE = 1; for (long long i = 1; i <= n; i++) { sum += A[i]; BASE = BASE * 2; BASE %= MOD; if (T - sum >= i) { ans++; ans %= MOD; } else if (T - sum < 0) { break; } else { ans += (work(i, T - sum) * Quick(BASE, MOD - 2)) % MOD; ans %= MOD; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; char a[2000][2000]; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; queue<pair<int, int> > que; int main() { int n, m; while (~scanf( %d %d , &n, &m)) { for (int i = 0; i < n; i++) { getchar(); for (int j = 0; j < m; j++) { a[i][j] = getchar(); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int cnt = 0; for (int k = 0; k < 4; k++) { int ni = i + dx[k]; int nj = j + dy[k]; if (ni >= 0 && ni < n && nj >= 0 && nj < m && a[ni][nj] == . ) { cnt++; } } if (cnt == 1) { que.push({i, j}); } } } while (!que.empty()) { pair<int, int> p = que.front(); que.pop(); int i = p.first, j = p.second, k, ni, nj; if (a[i][j] != . ) { continue; } for (k = 0; k < 4; k++) { ni = i + dx[k]; nj = j + dy[k]; if (ni >= 0 && ni < n && nj >= 0 && nj < m && a[ni][nj] == . ) { break; } } if (k == 0) { a[i][j] = v ; a[i - 1][j] = ^ ; } else if (k == 1) { a[i][j] = > ; a[i][j - 1] = < ; } else if (k == 2) { a[i][j] = ^ ; a[i + 1][j] = v ; } else if (k == 3) { a[i][j] = < ; a[i][j + 1] = > ; } else { continue; } for (int k = 0; k < 4; k++) { int mi = ni + dx[k]; int mj = nj + dy[k]; if (mi >= 0 && mi < n && mj >= 0 && mj < m && a[mi][mj] == . ) { int cnt = 0; for (int k = 0; k < 4; k++) { int pi = mi + dx[k]; int pj = mj + dy[k]; if (pi >= 0 && pi < n && pj >= 0 && pj < m && a[pi][pj] == . ) { cnt++; } } if (cnt == 1) { que.push({mi, mj}); } } } } bool flag = false; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == . ) { flag = true; break; } } if (flag) { printf( Not unique n ); break; } } if (!flag) { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { putchar(a[i][j]); } putchar(10); } } } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize trapv const int inf1 = 1e9; const long long int inf2 = 1e18; const int N = 100000; using namespace std; int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; vector<int> z_function(string s) { int n = s.length(); vector<int> z(n); for (int i = 1, l = 0, r = 0; i < n; ++i) { if (i <= r) z[i] = min(r - i + 1, z[i - l]); while (i + z[i] < n && s[z[i]] == s[i + z[i]]) z[i]++; if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1; } return z; } bool ispalindrome(string s) { string t = s; reverse(s.begin(), s.end()); return t == s; } string LPP(string s) { if (s.length() == 1) return s; int l = s.length(); string t = s + # ; string t2 = s; reverse(t2.begin(), t2.end()); t += t2; vector<int> z = z_function(t); int l2 = 2 * l + 1; for (int i = l + 1; i < l2; i++) { if (z[i] == (l2 - i)) { string ans = t.substr(i, l2 - i); return ans; } } } int solve() { string s; cin >> s; int n = s.length(); if (ispalindrome(s)) { cout << s << n ; return 0; } int i = 0; while (s[i] == s[n - 1 - i]) i++; string ans = s.substr(0, i); string ans4 = ans; reverse(ans4.begin(), ans4.end()); string s2 = s.substr(i, n - 2 * i); string s3 = s2; reverse(s3.begin(), s3.end()); string ans1 = LPP(s2); string ans2 = LPP(s3); if (ans1.size() >= ans2.size()) { cout << ans + ans1 + ans4 << n ; } else { cout << ans + ans2 + ans4 << n ; } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) { solve(); } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.