func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 100; vector<int> adj[N]; int n, sz[N]; int get(int cur, int fr) { sz[cur] = 1; int ret = 0; for (auto v : adj[cur]) { if (v == fr) continue; ret |= get(v, cur); sz[cur] += sz[v]; } if (!ret && sz[cur] > n / 2) ret = cur; return ret; } void dfs(int cur, int fr) { sz[cur] = 1; for (auto v : adj[cur]) { if (v == fr) continue; dfs(v, cur); sz[cur] += sz[v]; } } bool can[N]; void solve(int cur, int fr, int mx) { if (n - sz[cur] - mx <= n / 2) can[cur] = 1; vector<int> pre(1, 0), suf(1, 0); for (auto v : adj[cur]) if (v != fr) pre.push_back(max(pre.back(), sz[v])); for (int i = int(adj[cur].size()) - 1; i >= 0; i--) { int v = adj[cur][i]; if (v != fr) suf.push_back(max(suf.back(), sz[v])); } reverse(suf.begin(), suf.end()); int j = 0; for (int i = 0; i < adj[cur].size(); ++i) { int v = adj[cur][i]; if (v == fr) continue; int nmx = max(pre[j], suf[j + 1]); nmx = max(nmx, mx); if (n - sz[v] <= n / 2) nmx = max(nmx, n - sz[v]); solve(v, cur, nmx); j++; } } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; ++i) { int u, v; scanf( %d , &u), scanf( %d , &v); u--, v--; adj[u].push_back(v); adj[v].push_back(u); } int root = get(0, 0); dfs(root, root); solve(root, root, 0); for (int i = 0; i < n; ++i) if (can[i]) printf( 1 ); else printf( 0 ); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int g[4]; int i = 0; for (i = 0; i < 4; i++) { cin >> g[i]; } sort(g, g + 4); long long a = 0, b = 0, c = 0, k = 0; k = g[3]; a = g[0]; b = g[1]; c = g[2]; cout << (a + c) - k << << (a + b) - k << << (b + c) - k; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int inf = 2000000000; const long double eps = 0.0000001; const long double pi = acos(-1.0); const long long int MOD = 998244353; const long long int N = 1e5 + 5; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; ++i) { cin >> a[i]; } long long int ans = 1, mn = inf; for (long long int t = 1; t <= 100; t++) { long long int s = 0; for (long long int i = 0; i < n; ++i) { if (a[i] > t + 1) s += a[i] - t - 1; else if (a[i] < t - 1) s += t - a[i] - 1; } if (s < mn) { mn = s; ans = t; } } cout << ans << << mn; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int mem[1000]; int k; map<long long int, long long int> first; long long int f(long long int x) { if (first.find(x) != first.end()) return first[x]; if (x % 2 == 0) return f(x / 2); else return f(x / 2) + 1; } int main() { first[0] = 0; first[1] = 1; map<long long int, long long int> q; int n; cin >> n; for (int i = 0; i < n; i++) { long long int x; cin >> x; long long int fx = f(x); q[fx]++; } long long int ans = 0; map<long long int, long long int>::iterator it; for (it = q.begin(); it != q.end(); it++) { ans += ((it->second) * (it->second - 1)) / 2; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n), g(256, -1); for (int &e : a) cin >> e; for (int i = 0; i < n; i++) { if (g[a[i]] != -1) a[i] = g[a[i]]; else { int temp = max(0, a[i] - k + 1); for (int j = a[i] - 1; j >= temp; j--) if (g[j] != -1) { if (g[j] >= temp) { for (int k = g[j]; k <= a[i]; k++) g[k] = g[j]; a[i] = g[j]; break; } for (int k = j + 1; k <= a[i]; k++) g[k] = j + 1; a[i] = j + 1; break; } else if (j == temp) { for (int k = temp; k <= a[i]; k++) g[k] = temp; a[i] = temp; } } } for (int &e : a) cout << e << ; cin >> n; }
|
#include <bits/stdc++.h> using namespace std; int add(int x, int y) { x += y; while (x >= 1000000007) x -= 1000000007; while (x < 0) x += 1000000007; return x; } int mul(int x, int y) { return (x * 1ll * y) % 1000000007; } int binpow(int x, int y) { int z = 1; while (y) { if (y & 1) z = mul(z, x); x = mul(x, x); y >>= 1; } return z; } int inv(int x) { return binpow(x, 1000000007 - 2); } int divide(int x, int y) { return mul(x, inv(y)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<pair<long long int, long long int> > v; for (int i = 0; i < n; i++) { long long int a, b; cin >> a >> b; v.push_back({a, b}); } vector<pair<long long int, long long int> > sol, sols; for (int i = 0; i < n; i++) { long long int a = v[i].first, b = v[i].second + a - 1; int flag = 0; for (int j = 0; j < sols.size(); j++) { if (max(sols[j].first, a) <= min(sols[j].second, b)) flag = 1; } long long int pa = 1, push_back = v[i].second; for (int j = 0; j < sols.size(); j++) { if (max(sols[j].first, pa) <= min(sols[j].second, push_back)) { pa = sols[j].second + 1; push_back = pa + v[i].second - 1; } } if (flag == 0) sol.push_back({a, b}); else sol.push_back({pa, push_back}); sols = sol; sort(sols.begin(), sols.end()); } for (int i = 0; i < n; i++) cout << sol[i].first << << sol[i].second << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long MOD = int(1e9) + 7; int debug = 1; int main() { int a, b, c, l; cin >> a >> b >> c >> l; int cnt = 0; int m; long long n, total = 0; for (int i = 0; i < l + 1; i++) { n = i; n = ((n + 2) * (n + 1)) / 2; total += n; } long long x = 0, sub = 0; int r; for (int i = 0; i <= l; i++) { int aa = a + i; r = l - i; if (b + c > aa) continue; r = min(r, aa - (b + c)); x = r; x = ((x + 2) * (x + 1)) / 2; sub += x; } for (int i = 0; i <= l; i++) { int bb = b + i; r = l - i; if (a + c > bb) continue; r = min(r, bb - (a + c)); x = r; x = ((x + 2) * (x + 1)) / 2; sub += x; } for (int i = 0; i <= l; i++) { int cc = c + i; r = l - i; if (b + a > cc) continue; r = min(r, cc - (a + b)); x = r; x = ((x + 2) * (x + 1)) / 2; sub += x; } cout << total - sub << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, k, a, ans, y; cin >> n >> k; long long s[n + 10]; vector<long long> v; for (int i = 0; i < n; i++) cin >> a, v.push_back(a); sort(v.begin(), v.end()); s[0] = 0; for (int i = 1; i < n; i++) s[i] = s[i - 1] + v[i]; s[n] = s[n - 1] + v[0]; if (s[n] <= k) { cout << 0 << endl; continue; } ans = s[n] - k; for (int i = 1; i < n; i++) { y = v[0] * (n - i + 1) + s[i - 1] - k; if (y < 0) y = 0; if (y % (n - i + 1)) y /= (n - i + 1), y++; else y /= (n - i + 1); ans = min(ans, y + (n - i)); } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; long long int n; map<pair<long long int, long long int>, long long int> val; long long int get_lca(long long int x, long long int y) { vector<long long int> a, b; a.clear(); b.clear(); while (x > 0) { a.push_back(x); x >>= 1; } while (y > 0) { b.push_back(y); y >>= 1; } reverse(a.begin(), a.end()); reverse(b.begin(), b.end()); long long int j = 0; for (j = 0; j < a.size() && j < b.size(); j++) { if (a[j] != b[j]) break; } return a[j - 1]; } void upd(long long int x, long long int l, long long int w) { long long int y = x % 2; x >>= 1; while (x > 0) { val[{x, y}] += w; y = x % 2; x >>= 1; } y = l % 2; l >>= 1; while (l > 0) { val[{l, y}] -= w; y = l % 2; l >>= 1; } } long long int get(long long int x, long long int l) { long long int an = 0; long long int y = x % 2; x >>= 1; while (x > 0 && x >= l) { an += val[{x, y}]; y = x % 2; x >>= 1; } return an; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { long long int t, u, v, w; cin >> t >> u >> v; if (t == 1) { cin >> w; long long int l = get_lca(u, v); upd(u, l, w); upd(v, l, w); } else { long long int l = get_lca(u, v); long long int an = get(u, l) + get(v, l); cout << an << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; char s[maxn]; int n; long long ans; namespace SAM { int fa[maxn], ch[maxn][26], mxlen[maxn], cend[maxn], cnode, root, lst; vector<int> g[maxn]; vector<int> len[maxn]; inline int getnewnode() { fa[cnode] = -1; memset(ch[cnode], -1, sizeof(ch[0])); cend[cnode] = 0; return cnode++; } void init(int m) { for (int i = 0; i <= m; i++) len[i].clear(); cnode = 0; lst = root = getnewnode(); mxlen[root] = 0; } void extend(int c) { int cur = getnewnode(); mxlen[cur] = mxlen[lst] + 1; len[mxlen[cur]].push_back(cur); cend[cur]++; int p; for (p = lst; p != -1 && ch[p][c] == -1; p = fa[p]) ch[p][c] = cur; lst = cur; if (p == -1) { fa[cur] = root; return; } int q = ch[p][c]; if (mxlen[q] == mxlen[p] + 1) { fa[cur] = q; return; } int clone = getnewnode(); mxlen[clone] = mxlen[p] + 1; len[mxlen[clone]].push_back(clone); fa[clone] = fa[q]; for (int i = 0; i < 26; i++) ch[clone][i] = ch[q][i]; fa[q] = fa[cur] = clone; for (; p != -1 && ch[p][c] == q; p = fa[p]) ch[p][c] = clone; } void build() { for (int i = 0; i < n; i++) extend(s[i] - a ); for (int l = n; l >= 1; l--) { for (int i = 0; i < len[l].size(); i++) { int x = len[l][i]; int cnt = mxlen[x] - mxlen[fa[x]]; cend[fa[x]] += cend[x]; ans += cnt * 1ll * cend[x] * 1ll * cend[x]; } } } } // namespace SAM int main() { int t; scanf( %d , &t); while (t--) { scanf( %s , s); n = strlen(s); ans = 0; SAM::init(n); SAM::build(); printf( %I64d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; char a[1005], b[1005]; int main() { int n, i; scanf( %d , &n); scanf( %s , a + 1); scanf( %s , b + 1); int ans1 = n, ans2 = 0; sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + n); int lab = 1, cnt = 1; while (lab <= n) { if (a[cnt] < b[lab]) { cnt++; ans2++; } lab++; } lab = cnt = n; while (lab >= 1) { if (b[cnt] >= a[lab]) { ans1--; cnt--; } lab--; } cout << ans1 << endl; cout << ans2 << endl; return 0; }
|
#include <bits/stdc++.h> template <unsigned P> class modint { static_assert(1 <= P); using mint = modint<P>; protected: unsigned v; public: modint() : v() {} template <typename T, typename std::enable_if<std::is_signed<T>::value && std::is_integral<T>::value, bool>::type = true> modint(T _v) { long long tmp = _v % static_cast<long long>(P); if (tmp < 0) { tmp += P; } v = tmp; } template <typename T, typename std::enable_if<std::is_unsigned<T>::value && std::is_integral<T>::value, bool>::type = true> modint(T _v) { v = _v % P; } unsigned val() const { return v; } static constexpr unsigned mod() { return P; } static mint raw(unsigned v) { mint res; res.v = v; return res; } mint &operator+=(const mint &rhs) { v < P - rhs.v ? v += rhs.v : v -= P - rhs.v; return *this; } mint &operator++() { v + 1 < P ? ++v : v = 0; return *this; } mint operator++(int) { mint tmp = *this; v + 1 < P ? ++v : v = 0; return tmp; } mint &operator-=(const mint &rhs) { v < rhs.v ? v += P - rhs.v : v -= rhs.v; return *this; } mint &operator--() { v == 0 ? v = P - 1 : --v; return *this; } mint operator--(int) { mint tmp = *this; v == 0 ? v = P - 1 : --v; return tmp; } mint operator-() const { mint res; res.v = v == 0 ? 0 : P - v; return res; } mint &operator*=(const mint &rhs) { v = static_cast<unsigned long long>(v) * rhs.v % P; return *this; } mint pow(unsigned long long b) const { mint a(*this), s(1); for (; b; b >>= 1) { if (b & 1) { s *= a; } a *= a; } return s; } mint inv() const { return pow(P - 2); } friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; } friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; } friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; } friend bool operator==(const mint &lhs, const mint &rhs) { return lhs.v == rhs.v; } friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs.v != rhs.v; } friend std::istream &operator>>(std::istream &in, mint &x) { return in >> x.v; } friend std::ostream &operator<<(std::ostream &out, const mint &x) { return out << x.v; } }; using mint = modint<998244353>; const mint mi2 = mint(2), minv2 = mi2.inv(); void solve() { int n, k, x; std::cin >> n >> k >> x; if (x == 0) { if (n > k) { std::cout << 0 << n ; return; } mint pw = mi2.pow(k), now = 1; mint ans = 1; for (int i = 0; i < n; ++i) { ans *= pw - now; now += now; } std::cout << ans << n ; return; } mint pw = mi2.pow(k), pwn = pw.pow(n), inv = minv2.pow(n); mint now = 1; mint ans = 0; for (int i = 1; i <= k; ++i) { pw *= minv2; pwn *= inv; ans += pwn * now * pw; now *= 1 - pw; } std::cout << ans << n ; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int T; std::cin >> T; while (T--) { solve(); } }
|
#include <bits/stdc++.h> int inf = 0x3f3f3f3f; using namespace std; int n, m, x, y, f[200010], degree, cnt; vector<pair<int, int>> ans, edge1, wron; vector<pair<int, int>> edge; vector<pair<int, int>> v[200010]; int find(int x) { if (f[x] == x) return x; return f[x] = find(f[x]); } int jihe(int x, int y) { x = find(x); y = find(y); if (x != y) { f[x] = y; return 1; } return 0; } int main() { cin >> n >> m >> degree; for (int i = 1; i <= m; i++) { scanf( %d%d , &x, &y); if (x == 1 || y == 1) edge1.push_back(make_pair(x, y)); else edge.push_back(make_pair(x, y)); } if (edge1.size() < degree) { cout << NO << endl; return 0; } for (int i = 1; i <= n; i++) f[i] = i; for (auto it : edge) jihe(it.first, it.second); for (auto it : edge1) { if (jihe(it.first, it.second)) { cnt++; ans.push_back(it); } else wron.push_back(it); } if (cnt > degree) { cout << NO << endl; return 0; } for (int i = 0; i < degree - cnt; i++) { ans.push_back(wron[i]); } for (int i = 1; i <= n; i++) f[i] = i; for (auto it : ans) { jihe(it.first, it.second); } for (auto it : edge) if (jihe(it.first, it.second)) ans.push_back(it); cout << YES << endl; for (auto it : ans) cout << it.first << << it.second << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; bool sortcol(const vector<int>& v1, const vector<int>& v2) { return v1[0] < v2[0]; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); ; int n, m; cin >> n >> m; int a[n + 1], b[m + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i]; for (int i = 0; i <= 512; i++) { int br = 0; for (int j = 1; j <= n; j++) { bool found = false; for (int k = 1; k <= m; k++) { if ((i & (a[j] & b[k])) == (a[j] & b[k])) { found = true; } } if (found) { br++; } } if (br == n) { cout << i; return 0; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 500008; int n, m, cnt; int day[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int get(int x) { int ret = 0; for (int i = 0; i < x; ++i) ret += day[i]; return ret; } struct Node { int year, month, date; int hour, minute, second; int dis; Node() {} Node(int Y, int M, int D, int H, int Mi, int S) { year = Y, month = M, date = D; hour = H, minute = Mi, second = S; dis = second + minute * 60 + hour * 3600; if (date - 1 == 0) { dis += day[month - 1] * 24 * 3600 + get(month - 1) * 24 * 3600; } else dis += (date - 1) * 24 * 3600 + get(month) * 24 * 3600; }; } node[maxn]; int main() { cin >> n >> m; string str; cnt = 0; while (cin >> str) { int y = 2012, m = (str[5] - 0 ) * 10 + str[6] - 0 , d = (str[8] - 0 ) * 10 + str[9] - 0 ; cin >> str; int h = (str[0] - 0 ) * 10 + str[1] - 0 , mi = (str[3] - 0 ) * 10 + str[4] - 0 , s = (str[6] - 0 ) * 10 + str[7] - 0 ; node[++cnt] = Node(y, m, d, h, mi, s); getline(cin, str, n ); } bool ff = 0; int i; for (i = m; i <= cnt; ++i) { if (node[i].dis - node[i - m + 1].dis + 1 <= n) { ff = 1; break; } } if (ff) { printf( %02d-%02d-%02d , node[i].year, node[i].month, node[i].date); printf( %02d:%02d:%02d n , node[i].hour, node[i].minute, node[i].second); } else puts( -1 ); }
|
#include <bits/stdc++.h> using namespace std; const int DN = 3e5 + 5; int n, m, sol, f, cnt, mi = 1e9, sum; char ch[6], a[5][5], car; string s[DN], r[DN]; void solve1() { cnt++; sum = 0; int f, mi; for (int i = 1; i <= n; i++) { f = 0; for (int j = 1; j <= m; j++) { car = a[i % 2][j % 2]; if (s[i][j] != car) f++; r[i][j] = car; } mi = f; f = 0; for (int j = 1; j <= m; j++) { car = a[i % 2][1 - j % 2]; if (s[i][j] != car) f++; } if (f < mi) { mi = f; for (int j = 1; j <= m; j++) { car = a[i % 2][1 - j % 2]; r[i][j] = car; } } sum += mi; } } void solve2() { cnt++; sum = 0; int f, mi; for (int j = 1; j <= m; j++) { f = 0; for (int i = 1; i <= n; i++) { car = a[i % 2][j % 2]; if (s[i][j] != car) f++; r[i][j] = car; } mi = f; f = 0; for (int i = 1; i <= n; i++) { car = a[1 - i % 2][j % 2]; if (s[i][j] != car) f++; } if (f < mi) { mi = f; for (int i = 1; i <= n; i++) { car = a[1 - i % 2][j % 2]; r[i][j] = car; } } sum += mi; } } void solve() { cnt = 0; ch[1] = A ; ch[2] = G ; ch[3] = C ; ch[4] = T ; do { a[0][0] = ch[1]; a[0][1] = ch[2]; a[1][0] = ch[3]; a[1][1] = ch[4]; solve1(); if (sum < mi) { mi = sum; f = cnt; } if (sum == sol) return; solve2(); if (sum < mi) { mi = sum; f = cnt; } if (sum == sol) return; } while (next_permutation(ch + 1, ch + 5)); sol = mi; } int main() { cin.sync_with_stdio(false); cout.sync_with_stdio(false); cin >> n >> m; for (int i = 0; i <= n; i++) getline(cin, s[i]); for (int i = 1; i <= n; i++) { s[i] = + s[i]; r[i] = s[i]; } solve(); solve(); for (int i = 1; i <= n; i++) r[i].erase(r[i].begin()); for (int i = 1; i <= n; i++) cout << r[i] << n ; }
|
#include <bits/stdc++.h> using namespace std; const long long int md = 1e9 + 7; const long long int N = 55; long long int a[N]; long long int dp[N][N]; vector<pair<long long int, long long int>> v; long long int mask; long long int rec(long long int n, long long int k) { long long int s = 0; if (dp[n][k] != -1) return dp[n][k]; v.emplace_back(pair<long long int, long long int>{n, k}); if (k == 1) { for (long long int i = 1; i <= n; i++) s += a[i]; return dp[n][k] = ((s & mask) == mask); } for (long long int i = n; i >= k; i--) { s += a[i]; if ((s & mask) == mask) if (rec(i - 1, k - 1)) return dp[n][k] = 1; } return dp[n][k] = 0; } signed main() { ios::sync_with_stdio(0); long long int n, k; cin >> n >> k; for (long long int i = 1; i <= n; i++) cin >> a[i]; long long int ans = 0; long long int c = pow(2, 56); for (long long int i = 0; i < N; i++) for (long long int j = 0; j < N; j++) dp[i][j] = -1; for (long long int i = 56; i >= 0; i--) { mask = ans + c; if (rec(n, k)) ans += c; c >>= 1; for (auto it : v) dp[it.first][it.second] = -1; v.clear(); } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, temp, count = 0; cin >> a >> b; while (a >= 1 && b >= 1) { if (a > b) { count += a / b; a %= b; } else if (b > a) { count += b / a; b %= a; } else { count++; break; } } cout << count << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 55, inF = 1e9 + 100; int n, h, m, l[N], r[N], x[N], c[N], dp[N][N][N]; int get(int i, int j, int dex, int h) { int res = 0; for (int q = 0; q < m; q++) if (l[q] <= dex && l[q] >= i && r[q] <= j && r[q] >= dex && x[q] < h) res += c[q]; return res; } int main() { ios::sync_with_stdio(false), cin.tie(0); cin >> n >> h >> m; for (int i = 0; i < m; i++) cin >> l[i] >> r[i] >> x[i] >> c[i]; for (int k = 1; k <= h; k++) for (int l = 1; l <= n; l++) for (int i = 1; i + l - 1 <= n; i++) { int j = i + l - 1; dp[i][j][k] = dp[i][j][k - 1]; for (int dex = i; dex <= j; dex++) dp[i][j][k] = max(dp[i][j][k], dp[i][dex - 1][k - 1] + dp[dex + 1][j][k] + k * k - get(i, j, dex, k)); } cout << dp[1][n][h]; return 0; }
|
#include <bits/stdc++.h> using namespace std; const unsigned mod = 3853518419u; const unsigned base = 85429482u; int n; string s; basic_string<int> e[300005]; int p[19][300005], du[300005]; unsigned bp[300005]; unsigned hu[19][300005], hd[19][300005]; void dfs(int x, int par) { p[0][x] = par; hu[0][x] = hd[0][x] = s[x]; for (int i = 1; i < 19; i++) { int y = p[i - 1][x]; p[i][x] = p[i - 1][y]; hu[i][x] = (1ull * hu[i - 1][x] * bp[1 << (i - 1)] + hu[i - 1][y]) % mod; hd[i][x] = (1ull * hd[i - 1][y] * bp[1 << (i - 1)] + hd[i - 1][x]) % mod; } for (int y : e[x]) { if (y != par) { du[y] = du[x] + 1; dfs(y, x); } } } int dizi(int x, int k) { for (int i = 0; i < 19; i++) { if ((1 << i) & k) { x = p[i][x]; } } return x; } int lca(int x, int y) { if (du[x] > du[y]) swap(x, y); y = dizi(y, du[y] - du[x]); if (x == y) return x; for (int i = 18; i >= 0; i--) { int xx = p[i][x], yy = p[i][y]; if (xx != yy) { x = xx; y = yy; } } return p[0][x]; } int resi(int a, int b, int c, int d) { int p = lca(a, b), q = lca(c, d), l = 0; int h = min(du[a] - du[p], du[c] - du[q]); for (int i = 18; i >= 0; i--) { if ((1 << i) <= h) { if (hu[i][a] == hu[i][c]) { l += 1 << i; h -= 1 << i; a = ::p[i][a]; c = ::p[i][c]; } } } if (h > 0) return l; if (a != p) { swap(a, c); swap(b, d); swap(p, q); } h = min(du[c] - du[q], du[b] - du[p]); for (int i = 18; i >= 0; i--) { if ((1 << i) <= h) { int t = dizi(b, du[b] - du[p] - (1 << i)); if (hu[i][::p[0][t]] == hd[i][c]) { l += 1 << i; h -= 1 << i; p = t; c = ::p[i][c]; } } } if (h > 0) return l; if (b == p) return l + (s[p] == s[c]); h = min(du[d] - du[q], du[b] - du[p]); for (int i = 18; i >= 0; i--) { if ((1 << i) <= h) { int t1 = dizi(b, du[b] - du[p] - (1 << i)); int t2 = dizi(d, du[d] - du[q] - (1 << i)); if (hu[i][::p[0][t1]] == hu[i][::p[0][t2]]) { l += 1 << i; h -= 1 << i; p = t1; q = t2; } } } if (h > 0) return l; return l + (s[p] == s[q]); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); cin >> n >> s; s = string( ) + s; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; e[u] += v; e[v] += u; } bp[0] = 1; for (int i = 1; i < 300005; i++) bp[i] = bp[i - 1] * 1ull * base % mod; dfs(1, 1); int q; cin >> q; while (q--) { int a, b, c, d; cin >> a >> b >> c >> d; cout << resi(a, b, c, d) << n ; } }
|
#include <bits/stdc++.h> using namespace std; int N, X, ans; int A[100002]; int B[100002]; int main() { scanf( %d%d , &N, &X); for (int i = 1; i <= N; i++) scanf( %d , &A[i]); for (int i = 1; i <= N; i++) scanf( %d , &B[i]); sort(A + 1, A + N + 1); sort(B + 1, B + N + 1); for (int i = 1, j = N; i <= N && j >= 1; i++) if (A[i] + B[j] >= X) j--, ans++; printf( 1 %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int qpow(int b, long long e) { int a = 1; for (; e; e >>= 1, b = (long long)b * b) if (e & 1) a = (long long)a * b; return a; } const int maxn = 2222; int a[maxn]; vector<int> odd, even; void solve() { int n; cin >> n; odd.clear(); even.clear(); for (int i = 1; i <= (2 * n); ++i) { cin >> a[i]; if (a[i] & 1) odd.push_back(i); else even.push_back(i); } int cnt = n - 1; while (cnt--) { if (odd.size() >= 2) { cout << *odd.rbegin() << << *++odd.rbegin() << endl; odd.pop_back(); odd.pop_back(); } else if (even.size() >= 2) { cout << *even.rbegin() << << *++even.rbegin() << endl; even.pop_back(); even.pop_back(); } } } int main() { int T; cin >> T; while (T--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; long long n; map<pair<long long, long long>, pair<long long, long long> > mp; pair<long long, long long> count(long long x, long long y) { if (mp.find(make_pair(x, y)) != mp.end()) return mp[make_pair(x, y)]; long long temp = 1; while (x / 10 >= temp) temp *= 10; if (temp == 1) return mp[make_pair(x, y)] = make_pair(1, max(0ll, y - x)); pair<long long, long long> a = count(x % temp, max(y, x / temp)); pair<long long, long long> b = count(x / temp * temp - a.second, y); return mp[make_pair(x, y)] = make_pair(a.first + b.first, b.second); } int main() { cin >> n; if (n == 0) { cout << 0 << endl; return 0; } cout << count(n, 0).first << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; int dp[10][10][10][10]; for (int i = 0; i < 10; i++) for (int j = 0; j < 10; j++) for (int k = 0; k < 10; k++) for (int l = 0; l < 10; l++) { dp[i][j][k][l] = INT_MAX; for (int t1 = 0; t1 <= 10; t1++) { for (int t2 = 0; t2 <= 10; t2++) { if ((t1 * i + t2 * j) % 10 == (l - k + 10) % 10 && (t1 != 0 || t2 != 0)) { dp[i][j][k][l] = min(dp[i][j][k][l], t1 + t2); } } } } for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { int ans = 0; for (int k = 0; k < s.length() - 1; k++) { if (dp[i][j][s[k] - 0 ][s[k + 1] - 0 ] == INT_MAX) { ans = -1; break; } else { ans += max(0, dp[i][j][s[k] - 0 ][s[k + 1] - 0 ] - 1); } } cout << ans << ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 2 * 1e9; const double PI = acos(-1); vector<int> a; int p[10000001]; int m = 10000000; int main() { int n; cin >> n; for (int i = 2; i * i <= m; i++) { if (!p[i]) { for (int j = i * i; j <= m; j += i) p[j] = 1; } } for (int i = 2; i <= m; i++) if (!p[i]) a.push_back(i); for (int i = 0; i < n; i++) cout << a[i] << ; }
|
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long cntPair(long long v) { return v * (v - 1) / 2LL; } int main() { int n, d; cin >> n >> d; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) { cin >> v[i].first; v[i].second = i + 1; } sort(v.begin(), v.end()); vector<int> ans; for (int i = 0; i < v.size(); i++) { if (d >= v[i].first) { d -= v[i].first; ans.push_back(v[i].second); } else break; } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; }
|
#include <bits/stdc++.h> using namespace std; vector<long long> al[100001]; long long vis[100001]; long long no(long long num) { long long min = num % 10, max = num % 10; while (num > 0) { long long a = num % 10; num /= 10; if (min > a) min = a; if (max < a) max = a; } return min * max; } int main() { long long t; cin >> t; while (t--) { long long a, k; cin >> a >> k; for (long long i = 0; i < k - 1; i++) { long long b = no(a); if (b == 0) break; a += b; } cout << a << endl; } }
|
#include <bits/stdc++.h> using namespace std; int color[200010]; vector<int> save[200010]; int mark[200010]; map<long long, long long> mark_color; int main() { int n, m, k, cnt = 0; scanf( %d %d %d , &n, &m, &k); memset(mark, 0, sizeof(mark)); for (int i = (1); i < (n + 1); i++) scanf( %d , &color[i]); for (int ca = (0); ca < (m); ca++) { int l, r; scanf( %d %d , &l, &r); save[min(l, r)].push_back(max(l, r)); save[max(l, r)].push_back(min(l, r)); } long long ans = 0; for (int i = (1); i < (n + 1); i++) { if (mark[i]) continue; mark_color.clear(); queue<int> Q; Q.push(i); mark_color[color[i]]++; while (!Q.empty()) { int now = Q.front(); Q.pop(); int size = save[now].size(); mark[now] = 1; for (int j = (0); j < (size); j++) { int iterm = save[now][j]; if (mark[iterm]) continue; mark_color[color[iterm]]++; mark[iterm] = 1; Q.push(iterm); } } long long temp = 0; long long maxnum = 0; for (auto it = mark_color.begin(); it != mark_color.end(); it++) { maxnum = max(maxnum, it->second); temp += it->second; } ans += (temp - maxnum); } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long int sum, i, j, k, n; char str[200002]; scanf( %ld , &n); scanf( %s , &str[0]); for (i = 0; i < n; i++) { if (str[i] == 0 ) { j++; } else k++; } if (j > k) j = k; sum = n - 2 * j; printf( %ld n , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int S = 100003; int n, a[S], f[353][S], nn, bl[S], fr[353], to[353], m, bg[353], ed[353], las = 0; deque<int> q[353]; void read(int &s) { s = 0; char c = getchar(), t = 1; while (c != - && (c < 0 || c > 9 )) c = getchar(); if (c == - ) c = getchar(), t = -1; while (c >= 0 && c <= 9 ) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar(); s *= t; } char colp = 0; int main() { read(n); nn = sqrt(n); colp = a ; for (int i = 1; i <= n; ++i) read(a[i]); for (int i = 1; i <= n; ++i) bl[i] = (i - 1) / nn + 1; for (int i = 1; i <= n; ++i) { if (bl[i] != bl[i - 1]) fr[bl[i]] = i; q[bl[i]].push_back(a[i]); ++f[bl[i]][a[i]]; if (bl[i] != bl[i + 1]) to[bl[i]] = i; } read(m); int op, l, r, k; while (m--) { read(op); read(l); read(r); l = (l + las - 1) % n + 1; r = (r + las - 1) % n + 1; if (l > r) l ^= r ^= l ^= r; if (op == 1) { bg[0] = ed[0] = 0; while (!q[bl[l]].empty()) bg[++bg[0]] = q[bl[l]].front(), q[bl[l]].pop_front(); int l1 = l - fr[bl[l]] + 1, l2 = r - fr[bl[r]] + 1; if (bl[l] == bl[r]) { for (int i = 1; i < l1; ++i) q[bl[l]].push_back(bg[i]); q[bl[l]].push_back(bg[l2]); for (int i = l1; i < l2; ++i) q[bl[l]].push_back(bg[i]); for (int i = l2 + 1; i <= bg[0]; ++i) q[bl[l]].push_back(bg[i]); } else { while (!q[bl[r]].empty()) ed[++ed[0]] = q[bl[r]].front(), q[bl[r]].pop_front(); q[bl[l] + 1].push_front(bg[bg[0]]); ++f[bl[l] + 1][bg[bg[0]]]; --f[bl[l]][bg[bg[0]]]; for (int i = bl[l] + 1; i < bl[r]; ++i) { int o = q[i].back(); q[i + 1].push_front(o); ++f[i + 1][o]; q[i].pop_back(); --f[i][o]; } for (int i = 1; i < l2; ++i) q[bl[r]].push_back(ed[i]); for (int i = l2 + 1; i <= ed[0]; ++i) q[bl[r]].push_back(ed[i]); for (int i = 1; i < l1; ++i) q[bl[l]].push_back(bg[i]); q[bl[l]].push_back(ed[l2]); --f[bl[r]][ed[l2]]; ++f[bl[l]][ed[l2]]; for (int i = l1; i < bg[0]; ++i) q[bl[l]].push_back(bg[i]); } } else { read(k); k = (k + las - 1) % n + 1; bg[0] = ed[0] = 0; while (!q[bl[l]].empty()) bg[++bg[0]] = q[bl[l]].front(), q[bl[l]].pop_front(); int l1 = l - fr[bl[l]] + 1, l2 = r - fr[bl[r]] + 1; if (bl[l] == bl[r]) { int o = 0; for (int i = l1; i <= l2; ++i) if (bg[i] == k) ++o; printf( %d n , las = o); } else { int o = 0; while (!q[bl[r]].empty()) ed[++ed[0]] = q[bl[r]].front(), q[bl[r]].pop_front(); for (int i = bl[l] + 1; i < bl[r]; ++i) o += f[i][k]; for (int i = l1; i <= bg[0]; ++i) if (bg[i] == k) ++o; for (int i = 1; i <= l2; ++i) if (ed[i] == k) ++o; for (int i = 1; i <= ed[0]; ++i) q[bl[r]].push_back(ed[i]); printf( %d n , las = o); } for (int i = 1; i <= bg[0]; ++i) q[bl[l]].push_back(bg[i]); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main(){ int t,n; scanf( %d ,&t); while(t--){ scanf( %d ,&n); double ans=0; vector<double>miners; vector<double>diamonds; for(int i=0;i<2*n;i++){ double a,b; scanf( %lf%lf ,&a,&b); if (a==0){miners.push_back(abs(b));} if (b==0){diamonds.push_back(abs(a));} } sort(miners.begin(),miners.end()); sort(diamonds.begin(),diamonds.end()); for (int i=0;i<n;i++){ ans+=sqrt(miners[i]*miners[i]+diamonds[i]*diamonds[i]); } printf( %.15lf n ,ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1050000, P = 998244353, inv2 = (P + 1) / 2; int n, m, U, cnt[N], f[N], g[N], ans; char s[21][100005]; inline void read(int &i) { i = 0; char c = getchar(); bool j = 0; for (; !isdigit(c); c = getchar()) if (c == - ) j = 1; for (; isdigit(c); c = getchar()) i = (i << 1) + (i << 3) + c - 0 ; i = j ? -i : i; } void FWT(int *a, int l, int p) { for (int i = 1; i < l; i <<= 1) { for (int j = 0; j < l; j += i << 1) { for (int k = 0; k < i; ++k) { int x = a[j + k], y = a[i + j + k]; a[j + k] = (x + y) % P; a[i + j + k] = (x - y + P) % P; if (p == -1) a[j + k] = 1ll * a[j + k] * inv2 % P, a[i + j + k] = 1ll * a[i + j + k] * inv2 % P; } } } } int main() { read(n); read(m); ans = n * m; U = (1 << n) - 1; for (int i = 1; i <= n; ++i) scanf( %s , s[i] + 1); for (int j = 1; j <= m; ++j) { int x = 0; for (int i = 1; i <= n; ++i) if (s[i][j] == 1 ) x ^= 1 << (n - i); f[x]++; } for (int i = 1; i <= U; ++i) cnt[i] = cnt[i >> 1] + (i & 1); for (int i = 0; i <= U; ++i) g[i] = min(cnt[i], n - cnt[i]); FWT(f, U, 1); FWT(g, U, 1); for (int i = 0; i <= U; ++i) f[i] = 1ll * f[i] * g[i] % P; FWT(f, U, -1); for (int i = 0; i <= U; ++i) ans = min(ans, f[i]); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; cout << 7 + (3 * (k - 1)) << endl; cout << 1 << << 1 << endl; cout << 0 << << 1 << endl; cout << 0 << << 0 << endl; cout << 1 << << 0 << endl; cout << 2 << << 2 << endl; cout << 2 << << 1 << endl; cout << 1 << << 2 << endl; int i = 2; while (i <= k) { cout << i << << i + 1 << endl; cout << i + 1 << << i << endl; cout << i + 1 << << i + 1 << endl; i++; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { long long n, m; cin >> n >> m; long long ans; if (n < m) { ans = 0; } else if (n == m) ans = m % 10; else { int d = m % 10; int rem[10]; rem[0] = 0; for (int i = 1; i < 10; ++i) { rem[i] = (i * d) % 10 + rem[i - 1]; } long long tot = n / m; ans = rem[tot % 10] + (tot / 10) * rem[9]; } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; string sep; for (const auto &x : v) os << sep << x, sep = , ; return os << } ; } template <typename T, size_t size> ostream &operator<<(ostream &os, const array<T, size> &arr) { os << { ; string sep; for (const auto &x : arr) os << sep << x, sep = , ; return os << } ; } template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << ( << p.first << , << p.second << ) ; } void dbg_out() { cerr << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << << H; dbg_out(T...); } const int INF = 1e9 + 5; struct segment_change { int to_add; segment_change(int _to_add = 0) : to_add(_to_add) {} void reset() { to_add = 0; } bool has_change() const { return to_add != 0; } segment_change combine(const segment_change &other) const { return segment_change(to_add + other.to_add); } }; struct segment { int minimum, count_of_min; segment(int _minimum = INF, int _count_of_min = 0) : minimum(_minimum), count_of_min(_count_of_min) {} void apply(int, const segment_change &change) { minimum += change.to_add; } void join(const segment &other) { if (other.minimum < minimum) *this = other; else if (other.minimum == minimum) count_of_min += other.count_of_min; } void join(const segment &a, const segment &b) { *this = a; join(b); } int get_goal_count(int goal) const { return minimum == goal ? count_of_min : 0; } }; pair<int, int> right_half[32]; struct min_count_seg_tree { int tree_n = 0; vector<segment> tree; vector<segment_change> changes; min_count_seg_tree(int n = -1) { if (n >= 0) init(n); } void init(int n) { tree_n = 1; while (tree_n < n) tree_n *= 2; tree.assign(2 * tree_n, segment()); changes.assign(tree_n, segment_change()); } void build(const vector<segment> &initial) { int n = int(initial.size()); init(n); assert(n <= tree_n); for (int i = 0; i < n; i++) tree[tree_n + i] = initial[i]; for (int position = tree_n - 1; position > 0; position--) tree[position].join(tree[2 * position], tree[2 * position + 1]); } void push_down(int position, int length) { if (!changes[position].has_change()) return; if (2 * position < tree_n) { changes[2 * position] = changes[2 * position].combine(changes[position]); changes[2 * position + 1] = changes[2 * position + 1].combine(changes[position]); } tree[2 * position].apply(length / 2, changes[position]); tree[2 * position + 1].apply(length / 2, changes[position]); changes[position].reset(); } void push_all(int a, int b) { assert(0 <= a && a < b && b <= tree_n); a += tree_n; b += tree_n - 1; for (int up = 31 - __builtin_clz(tree_n); up > 0; up--) { int x = a >> up, y = b >> up; push_down(x, 1 << up); if (x != y) push_down(y, 1 << up); } } void join_and_apply(int position, int length) { tree[position].join(tree[2 * position], tree[2 * position + 1]); tree[position].apply(length, changes[position]); } void join_all(int a, int b) { assert(0 <= a && a < b && b <= tree_n); a += tree_n; b += tree_n - 1; int length = 1; while (a > 1) { a /= 2; b /= 2; length *= 2; join_and_apply(a, length); if (a != b) join_and_apply(b, length); } } template <typename T_range_op> void process_range(int a, int b, bool needs_join, T_range_op &&range_op) { if (a == b) return; push_all(a, b); int original_a = a, original_b = b; int length = 1, r_size = 0; for (a += tree_n, b += tree_n; a < b; a /= 2, b /= 2, length *= 2) { if (a & 1) range_op(a++, length); if (b & 1) right_half[r_size++] = {--b, length}; } for (int i = r_size - 1; i >= 0; i--) range_op(right_half[i].first, right_half[i].second); if (needs_join) join_all(original_a, original_b); } segment query(int a, int b) { assert(0 <= a && a <= b && b <= tree_n); segment answer; process_range(a, b, false, [&](int position, int) { answer.join(tree[position]); }); return answer; } void update(int a, int b, const segment_change &change) { assert(0 <= a && a <= b && b <= tree_n); process_range(a, b, true, [&](int position, int length) { tree[position].apply(length, change); if (position < tree_n) changes[position] = changes[position].combine(change); }); } }; struct rectangle { int x1, y1, x2, y2; }; struct rect_event { int x, y1, y2, change; bool operator<(const rect_event &other) const { return x < other.x; } }; int64_t rectangle_union_area(const vector<rectangle> &rects) { if (rects.empty()) return 0; vector<int> Xs, Ys; vector<rect_event> events; for (const rectangle &rect : rects) { Xs.push_back(rect.x1); Xs.push_back(rect.x2); Ys.push_back(rect.y1); Ys.push_back(rect.y2); events.push_back({rect.x1, rect.y1, rect.y2, +1}); events.push_back({rect.x2, rect.y1, rect.y2, -1}); } sort(Xs.begin(), Xs.end()); sort(Ys.begin(), Ys.end()); Xs.resize(unique(Xs.begin(), Xs.end()) - Xs.begin()); Ys.resize(unique(Ys.begin(), Ys.end()) - Ys.begin()); int XC = int(Xs.size()); int YC = int(Ys.size()); int Y_range = Ys.back() - Ys.front(); sort(events.begin(), events.end()); int E = int(events.size()); auto &&compress_y = [&](int y) { return int(lower_bound(Ys.begin(), Ys.end(), y) - Ys.begin()); }; min_count_seg_tree tree(YC - 1); vector<segment> initial(YC - 1); for (int i = 0; i < YC - 1; i++) initial[i] = segment(0, Ys[i + 1] - Ys[i]); tree.build(initial); int64_t area = 0; for (int i = 0, e = 0; i < XC - 1; i++) { while (e < E && events[e].x <= Xs[i]) { int y1 = compress_y(events[e].y1); int y2 = compress_y(events[e].y2); tree.update(y1, y2, segment_change(events[e].change)); e++; } segment result = tree.tree[1]; area += int64_t(Y_range - result.get_goal_count(0)) * (Xs[i + 1] - Xs[i]); } return area; } int N, M, NM; vector<string> grid; vector<int> slides_to; vector<vector<int>> adj; vector<int> tour_start, tour_end; int tour; bool valid(int r, int c) { return 0 <= r && r < N && 0 <= c && c < M; } int key(int r, int c) { return valid(r, c) ? r * M + c : -1; }; void dfs(int node, int parent) { tour_start[node] = tour++; for (int neigh : adj[node]) if (neigh != parent) dfs(neigh, node); tour_end[node] = tour; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> N >> M; NM = N * M; grid.resize(N); for (string &row : grid) cin >> row; slides_to.assign(NM, -1); for (int r = 0; r < N; r++) for (int c = 0; c < M; c++) { int me = key(r, c); switch (grid[r][c]) { case L : slides_to[me] = key(r, c + 2); break; case R : slides_to[me] = key(r, c - 2); break; case U : slides_to[me] = key(r + 2, c); break; case D : slides_to[me] = key(r - 2, c); break; } } adj.assign(NM, {}); for (int i = 0; i < NM; i++) if (slides_to[i] >= 0) adj[slides_to[i]].push_back(i); tour_start.assign(NM, -1); tour_end.assign(NM, -1); tour = 0; for (int i = 0; i < NM; i++) if (slides_to[i] < 0) dfs(i, -1); vector<rectangle> rects; for (int r = 0; r < N; r++) for (int c = 0; c < M; c++) if (grid[r][c] == L || grid[r][c] == U ) { int key0 = key(r, c); int key1 = grid[r][c] == L ? key(r, c + 1) : key(r + 1, c); if ((r + c) % 2 != 0) swap(key0, key1); rects.push_back({tour_start[key0], tour_start[key1], tour_end[key0], tour_end[key1]}); } cout << rectangle_union_area(rects) << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { string x; cin >> x; int i, j; int len = x.size(); int count = 0; for (i = 0; i < len; i++) { for (j = 1; j <= len - i; j++) { string z = x.substr(i, j); if (z == Danil || z == Olya || z == Slava || z == Ann || z == Nikita ) count++; } } if (count == 1) cout << Yes ; else cout << No ; }
|
#include <bits/stdc++.h> using namespace std; int n, s1, s2; int a[100005]; bool check(int x) { int l = -1e9, r = 1e9; for (int i = n; i >= 1; i--) { if (l <= a[i] && a[i] <= r) { l = a[i] - x; r = a[i] + x; } else { l = max(l, a[i] - x); r = min(r, a[i] + x); } } return (l <= s1 && s1 <= r) || (l <= s2 && s2 <= r); } int main() { scanf( %d%d%d , &n, &s1, &s2); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } int l = abs(s1 - s2), r = 1e9, ans = 1e9; while (l <= r) { int mid = (l + r) / 2; if (check(mid)) { r = mid - 1; ans = mid; } else { l = mid + 1; } } printf( %d , ans); return 0; }
|
#include <bits/stdc++.h> signed main(void) { int totNums, cnt = 0; long long tot = 0, num; bool zero = false; std::cin >> totNums; for (int i = 0; i < totNums; i++) { std::cin >> num; if (num == 0) { ++tot; zero = true; } else if (num > 0) tot += num - 1; else if (num < 0) { tot += -1 - num; ++cnt; } } if ((cnt & 1) && !zero) tot += 2; std::cout << tot << std::endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void __print(int first) { cerr << first; } void __print(long first) { cerr << first; } void __print(long long first) { cerr << first; } void __print(unsigned first) { cerr << first; } void __print(unsigned long first) { cerr << first; } void __print(unsigned long long first) { cerr << first; } void __print(float first) { cerr << first; } void __print(double first) { cerr << first; } void __print(long double first) { cerr << first; } void __print(char first) { cerr << << first << ; } void __print(const char *first) { cerr << << first << ; } void __print(const string &first) { cerr << << first << ; } void __print(bool first) { cerr << (first ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &first) { cerr << { ; __print(first.first); cerr << , ; __print(first.second); cerr << } ; } template <typename T> void __print(const T &first) { int f = 0; cerr << { ; for (auto &i : first) 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...); } long long check(vector<long long> a, long long n, long long k) { long long ans = 0; for (long long i = 1; i < n + 1; i++) { long long req; if (a[i] < 0) { req = -1 * a[i]; ans += req; a[i + 1] -= req; } else { req = a[i] % k; if (req < k - req) { ans += req; a[i + 1] += req; } else { ans += k - req; a[i + 1] -= k - req; } } } return ans; } bool prime[1000010]; vector<long long> factors; void sieve(long long n) { memset(prime, true, sizeof(prime)); for (long long p = 2; p * p <= n; p++) { if (prime[p] == true) { for (long long i = p * p; i <= n; i += p) prime[i] = false; } } for (long long p = 2; p <= n; p++) if (prime[p]) factors.push_back(p); } int main() { sieve(1000000); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; vector<long long> a(n + 2); long long sum = 0; for (long long i = 1; i < n + 1; i++) { cin >> a[i]; sum += a[i]; }; vector<long long> prime_divisors; for (auto &factor : factors) { if (sum % factor == 0) { prime_divisors.push_back(factor); sum /= factor; } } if (sum != 1) prime_divisors.push_back(sum); long long ans = 1e18; ; for (auto &prime_divisor : prime_divisors) { ans = min(ans, check(a, n, prime_divisor)); ; } if (ans == 1e18) ans = -1; cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 30; const int maxn = 105; const int MOD = 1e9 + 7; const double eps = 1e-6; const double pi = acos(-1); long long n, m; long long T[maxn][maxn]; long long f[maxn]; void Mul_mat(long long fin[][maxn], long long b[][maxn]) { long long ans[maxn][maxn]; for (int i = (0); i < (m); ++i) for (int j = (0); j < (m); ++j) ans[i][j] = 0; for (int i = (0); i < (m); ++i) for (int j = (0); j < (m); ++j) for (int k = (0); k < (m); ++k) { ans[i][j] = (ans[i][j] + fin[i][k] * b[k][j]) % MOD; } for (int i = (0); i < (m); ++i) for (int j = (0); j < (m); ++j) fin[i][j] = ans[i][j]; } void Pow_mat(long long n, long long fin[][maxn], long long b[][maxn]) { long long ans[maxn][maxn]; for (int i = (0); i < (m); ++i) for (int j = (0); j < (m); ++j) { if (i != j) ans[i][j] = 0; else ans[i][j] = 1; } while (n) { if (n & 1) Mul_mat(ans, b); Mul_mat(b, b); n >>= 1; } memcpy(fin, ans, sizeof(ans)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); while (cin >> n >> m) { if (n < m) { cout << 1 << endl; continue; } memset(T, 0, sizeof(T)); for (int i = (0); i < (m - 1); ++i) T[i][i + 1] = 1; T[m - 1][0] = T[m - 1][m - 1] = 1; long long f[maxn]; for (int i = (0); i < (m - 1); ++i) f[i] = 1; f[m - 1] = 2; long long tmp[maxn][maxn]; memset(tmp, 0, sizeof(tmp)); Pow_mat(n - 1, tmp, T); long long ans = 0; for (int i = (0); i < (m); ++i) { ans = (ans + tmp[0][i] * f[i]) % MOD; } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> operator-(const pair<int, int>& lhs, const pair<int, int>& rhs) { return pair<int, int>(lhs.first - rhs.first, lhs.second - rhs.second); } int x[19] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 4, 2, 3, 4}; int y[19] = {0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4}; vector<int> ms; int dp[1 << 19]; bool f(int u) { if (dp[u] >= 0) return dp[u]; for (auto m : ms) { if ((m & u) != m) continue; if (!f(u ^ m)) { return dp[u] = 1; } } return dp[u] = 0; } int main() { memset(dp, -1, sizeof(dp)); vector<pair<int, int> > ps; for (int u = 1; u < (1 << 19); u++) { ps.clear(); for (int i = 0; i < 19; i++) { if (u & (1 << i)) { ps.push_back(pair<int, int>(x[i], y[i])); } } if (ps.size() == 1) { ms.push_back(u); continue; } sort(ps.begin(), ps.end()); pair<int, int> d = ps[1] - ps[0]; if ((d.first == 0 && d.second == 1) || (d.first == 1 && d.second == 0) || (d.first == 1 && d.second == 1)) { bool ok = true; for (int i = 2; i < ps.size(); i++) { ok &= (ps[i] - ps[i - 1] == d); } if (ok) { ms.push_back(u); } } } char buf[10]; int v = 0; for (int i = 0; i < 19; i++) { scanf( %s , buf); if (buf[0] == O ) { v |= 1 << i; } } if (f(v)) { puts( Karlsson ); } else { puts( Lillebror ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); long long n; cin >> n; long long a[n]; map<long long, long long> m, ans; vector<long long> v; for (long long i = 0; i < n; i++) { cin >> a[i]; if (m[a[i]] == 0 && a[i] <= n) { m[a[i]] = 1; ans[i] = a[i]; } else { v.push_back(i); } } long long j = 0; for (long long i = 1; i <= n; i++) { if (m[i] == 0) { ans[v[j]] = i; j++; } } for (long long i = 0; i < n; i++) { cout << ans[i] << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char c; int sum = 0; if (n % 2 == 0) { int f = 1; for (int i = 1; i <= n; i++) { cin >> c; if (c == ( ) sum++; else sum--; if (sum < -1) break; } if (sum != 0) f = 0; if (f) cout << Yes n ; else cout << No n ; } else cout << No n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int test; cin >> test; while (test--) { long long x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; cout << (long long)((x2 - x1) * (y2 - y1)) + 1 << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int arr[4] = {1, 3, 6, 10}; while (t--) { int x; cin >> x; int num1 = x % 10; int num2 = 0; while (x != 0) { x = x / 10; num2++; } cout << (num1 - 1) * 10 + arr[num2 - 1] << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int vv[3003] = {0}, vvv[3003] = {0}; int n, v, m = -1, k; cin >> n >> v; while (n--) { int a, b; cin >> a >> b; vv[a] += b; vvv[a + 1] += b; m = max(m, a + 1); } int ans = 0, mm; for (int i = 0; i <= m; i++) { mm = v; if (vvv[i]) { if (vvv[i] < mm) { ans += vvv[i]; mm -= vvv[i]; } else { ans += mm; mm = 0; } } if (mm) { if (vv[i] < mm) { ans += vv[i]; vvv[i + 1] -= vv[i]; } else { ans += mm; vvv[i + 1] -= mm; } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); #pragma GCC optimize( Ofast ) #pragma GCC optimize( -O3 ) #pragma GCC optmize( sse, sse2, sse3, sse4, avx, abx, avx2, sse4.1 ) #pragma GCC optmize( fast-math ) #pragma GCC optimize( unroll-loops ) const int N = 1e5 + 100; const int INF = 1e9; vector<pair<int, int>> g[N]; int res[N]; bool used[N]; int col[N]; vector<int> comp; int h[N]; void ex() { cout << NO ; exit(0); } void dfs(int v) { comp.push_back(v); used[v] = true; for (auto u : g[v]) { if (!used[u.first]) { h[u.first] = h[v] + 1; dfs(u.first); } } } void push(int v) { for (auto u : g[v]) { if (res[u.first] == INF) { res[u.first] = u.second - res[v]; push(u.first); } } } vector<pair<int, int>> p; int eat[N]; bool bfs(int st) { vector<int> q; q.push_back(st); int ptr = 0; int v1 = -1; int v2 = -1; int last = 0; while (ptr < q.size() && v1 == -1) { int v = q[ptr++]; for (auto u : g[v]) { if (u.first == p[v].first) continue; if (p[u.first].first == -1 && u.first != st) { col[u.first] = 1 - col[v]; p[u.first].first = v; p[u.first].second = u.second; q.push_back(u.first); } else if (col[u.first] == col[v]) { v1 = v; v2 = u.first; last = u.second; break; } } } if (v1 == -1) return false; vector<int> p1; vector<int> d1; int bv1 = v1; while (v1 != -1) { p1.push_back(v1); if (p[v1].first != -1) d1.push_back(p[v1].second); v1 = p[v1].first; } vector<int> p2; vector<int> d2; while (p[v2].first != -1) { p2.push_back(v2); d2.push_back(p[v2].second); v2 = p[v2].first; } reverse(p2.begin(), p2.end()); reverse(d2.begin(), d2.end()); for (int &x : d2) d1.push_back(x); for (int &i : p2) p1.push_back(i); int s = 0; int sgn = 1; for (int i = (int)d1.size() - 1; i >= 0; --i) { s += (sgn * d1[i]); sgn *= (-1); } res[bv1] = (last - s) / 2; push(bv1); return true; } void iterate(int v) { res[v] = 0; push(v); vector<int> s; for (int &i : comp) { if (h[i] % 2 == 0) s.push_back(res[i]); else s.push_back(-res[i]); } sort(s.begin(), s.end()); for (int &i : comp) res[i] = INF; res[v] = -s[s.size() / 2]; push(v); } signed main() { ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); ; cout.precision(18); int n, m; cin >> n >> m; auto cmp = [](pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first != b.first) return a.first < b.first; return a.second < b.second; }; set<pair<pair<int, int>, int>, decltype(cmp)> s(cmp); fill(res, res + n, INF); vector<pair<pair<int, int>, int>> que; for (int i = 0; i < m; ++i) { int a, b, c; cin >> a >> b >> c; que.push_back({{a - 1, b - 1}, c * 2}); if (a == b) { res[--b] = c; continue; } if (s.count({{a, b}, c}) || s.count({{b, a}, c})) continue; int f1 = 1; if (c == 1) f1 = 2; if (s.count({{a, b}, f1}) || s.count({{b, a}, f1})) ex(); s.insert({{a, b}, c}); g[--a].push_back({--b, c * 2}); g[b].push_back({a, c * 2}); } fill(used, used + n, false); fill(col, col + n, 0); p.resize(n, {-1, 0}); for (int i = 0; i < n; ++i) { for (auto z : g[i]) eat[i] += z.second; } for (int i = 0; i < n; ++i) { if (!used[i]) { comp.clear(); dfs(i); int id = -1; for (int &j : comp) { if (res[j] != INF) id = j; } if (id != -1) { push(id); continue; } bool f = bfs(i); if (f) continue; iterate(i); } } for (auto z : que) { if (res[z.first.first] + res[z.first.second] != z.second) ex(); } cout << YES n ; for (int i = 0; i < n; ++i) cout << ((double)res[i] / 2.0) << ; }
|
#include <bits/stdc++.h> using namespace std; int n, a[111111], b[111111], c[111111], d[111111]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { scanf( %d , &b[i]); } for (int i = 1; i <= n; i++) { c[i] = a[i + 1] - a[i]; d[i] = b[i + 1] - b[i]; } sort(c + 1, c + n); sort(d + 1, d + n); if (a[1] != b[1]) { printf( No n ); return 0; } for (int i = 1; i < n; i++) { if (c[i] != d[i]) { printf( No n ); return 0; } } printf( Yes n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, ans; string str; long long solve() { cin >> n >> str; long long x = -1, y = -1; long long i = 0; while (i < n) { if (str[i] == 1 ) { x = i; break; } i++; } i = n - 1; while (i >= 0) { if (str[i] == 1 ) { y = i; break; } i--; } ans = n; if (x != -1) { ans = max(ans, 2 * (x + 1)); ans = max(ans, 2 * (n - x)); } if (y != -1) { ans = max(ans, 2 * (y + 1)); ans = max(ans, 2 * (n - y)); } cout << ans << n ; return 0; } signed main() { ios::sync_with_stdio(0); long long t = 1; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000 + 10; int a[MAXN], n; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , a + i); if (a[n - 1] == 1) { puts( NO ); return 0; } if (n == 1 && a[0] == 0) { puts( YES n0 ); return 0; } int cnt(0), c1(0); for (int i = 0; i < n && a[i]; ++i) ++c1; for (int i = n - 1; i >= 0 && !a[i]; --i) ++cnt; if (c1 + cnt == n && cnt == 2) { puts( NO ); return 0; } puts( YES ); if (cnt == 1) { printf( %d , a[0]); for (int i = 1; i < n; ++i) printf( ->%d , a[i]); puts( ); return 0; } if (cnt >= 3) { for (int i = 0; i < n - 3; ++i) { printf( %d-> , a[i]); } printf( (0->0)->0 n ); return 0; } int x; for (x = n - 3; x >= 0 && a[x]; --x) ; for (int i = 0; i < x; ++i) printf( %d-> , a[i]); printf( (0->( ); for (int i = x + 1; i < n - 2; ++i) printf( 1-> ); printf( 0))->0 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int jie[2000050], i, ni[2000050], j, g[1000050], su[1000050], m; bool vis[1000050]; int qmi(int di, int zhi) { int ret = 1, x = di; while (zhi) { if (zhi & 1) ret = 1LL * ret * x % 1000000007; x = 1LL * x * x % 1000000007; zhi >>= 1; } return ret; } int main() { jie[0] = jie[1] = ni[1] = ni[0] = 1; for (i = 2; i <= 2000000; i++) jie[i] = 1LL * jie[i - 1] * i % 1000000007; for (i = 1; i <= 2000000; i++) ni[i] = qmi(jie[i], 1000000007 - 2); for (i = 2; i <= 1000000; i++) { if (!vis[i]) { g[i] = i; su[++m] = i; } for (j = 1; j <= m; j++) { if (i * su[j] > 1000000) break; if (i % su[j]) { g[i * su[j]] = su[j]; vis[i * su[j]] = true; } else { g[i * su[j]] = su[j]; vis[i * su[j]] = true; break; } } } int t; scanf( %d , &t); while (t--) { int r, x; scanf( %d%d , &r, &x); int ans = 1; while (x != 1) { int cnt = 0, psz = g[x]; while (x % psz == 0) x /= psz, cnt++; ans = 1LL * ans * (0LL + 2LL * (r + cnt >= cnt ? ((1LL * ni[r + cnt - cnt] * ni[cnt] % 1000000007) * jie[r + cnt] % 1000000007) : 0) - (r + cnt - 1 >= cnt ? ((1LL * ni[r + cnt - 1 - cnt] * ni[cnt] % 1000000007) * jie[r + cnt - 1] % 1000000007) : 0)) % 1000000007; } printf( %d n , (ans + 1000000007) % 1000000007); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char a[100000]; int len, i, flag = 0, m; cin >> a; len = strlen(a); for (i = 0; i <= (len / 2); i++) { m = int(a[i]); if ((m == 65) || (m == 72) || (m == 73) || (m == 77) || (m == 79) || (m == 84) || (m == 85) || (m == 86) || (m == 87) || (m == 88) || (m == 89)) { if (int(a[len - 1 - i]) != m) { flag = 1; break; } } else { flag = 1; break; } } if (flag == 1) { cout << NO ; } else { cout << YES ; } }
|
#include <bits/stdc++.h> int main() { int n, i, j, cnt = 0, sum = 0, cost; scanf( %d %d , &n, &cost); int ara[n], ara2[100000]; for (i = 0; i < n; i++) { scanf( %d , &ara[i]); } std::sort(ara, ara + n); int x = 0, z = 0; for (i = 1; i <= cost; i++) { sum += i; cnt++; if (i == ara[x] && x < n) { cnt--; sum -= ara[x]; x++; continue; } if (sum > cost) { sum -= i; cnt--; i--; break; } else if (sum == cost) { ara2[z] = i; z++; break; } else { ara2[z] = i; z++; } } printf( %d n , cnt); for (j = 0; j < z; j++) printf( %d , ara2[j]); }
|
#include <bits/stdc++.h> using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; typedef unsigned long long ull; int getnum(const vector<ll>& v, ll x){ if(x < v[0]) return 0; int lb = 0, ub = v.size(); while(ub-lb>1){ int mid = (lb+ub)/2; if(v[mid] <= x) lb = mid; else ub = mid; } return ub; } int calc(const vector<ll>& v, const vector<ll>& w){ if(v.size() == 0) return 0; if(w.size() == 0) return 0; map<ll,int> memo; rep(i,w.size()){ memo[w[i]] = i; } int ret = 0; int cnt = 0; vector<int> match(w.size(), 0); rep(i,v.size()){ if(memo.count(v[i]) > 0){ cnt++; match[memo[v[i]]] = 1; } } ret = max(ret, cnt); rep(i,w.size()){ if(match[i] == 1) cnt--; int x = getnum(v, w[i]); int y = getnum(w, w[i]); int z = getnum(w, w[i]-x); ret = max(ret, cnt + (y-z)); } return ret; } void solve(){ int n, m; cin >> n >> m; vector<ll> v1, v2, w1, w2; rep(i,n){ ll a; cin >> a; if(a < 0) v1.push_back(-a); else v2.push_back(a); } reverse(ALLOF(v1)); rep(i,m){ ll a; cin >> a; if(a < 0) w1.push_back(-a); else w2.push_back(a); } reverse(ALLOF(w1)); cout << calc(v1,w1) + calc(v2,w2) << endl; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int t; cin >> t; rep(i,t){ solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long N, M; struct MATRIX { int dim; long long MAT[100][100]; MATRIX(int N, int x = -1) { dim = N; for (int i = 0; i < dim; i++) for (int j = 0; j < dim; j++) { if (x != -1 && i == j) MAT[i][j] = x; else MAT[i][j] = 0; } } void operator+=(const MATRIX& a) { for (int i = 0; i < a.dim; i++) { for (int j = 0; j < a.dim; j++) { MAT[i][j] += a.MAT[i][j]; } } } void show() { for (int i = 0; i < dim; i++) { for (int j = 0; j < dim; j++) cout << MAT[i][j] << ; cout << endl; } cout << endl; } }; MATRIX operator*(MATRIX a, MATRIX b) { MATRIX res(a.dim); for (int i = 0; i < a.dim; i++) { for (int j = 0; j < b.dim; j++) { long long sum = 0; for (int z = 0; z < a.dim; z++) { sum += a.MAT[i][z] * b.MAT[z][j]; } sum %= M; res.MAT[i][j] = sum; } } return res; } MATRIX binpow(MATRIX a, long long n) { MATRIX res = a; while (n) { if (n & 1) res = res * a; a = a * a; n >>= 1; } return res; } int main() { int X; cin >> N >> X; for (int i = 0; i < N; i++) { int a, b; cin >> a >> b; if (a == 7 - X || b == 7 - X || a == X || b == X) { cout << NO ; return 0; } } cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k; map<int, int> mapa; int arr[400100]; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &arr[i]); long long res = 0; int ini = 0, fin = 0; int x, y; while (fin < n) { mapa[arr[fin]]++; x = mapa[arr[fin]]; if (x >= k) { do { mapa[arr[ini]]--; res += (n - fin); if (arr[ini] == arr[fin]) { ini++; break; } ini++; } while (ini <= fin); fin++; } else fin++; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<unordered_set<long long>> v1(2e5), v2(2e5); void solve() { long long n, m; cin >> n >> m; for (auto i = 0; i < m; i++) { long long a, b; cin >> a >> b; a--; b--; v1[min(a, b)].insert(max(a, b)); } v2 = v1; long long count = 0; for (auto j = 0; j < n; j++) { if (v2[j].size() == 0) { count++; } } long long q; cin >> q; for (auto i = 0; i < q; i++) { long long a; cin >> a; if (a != 3) { long long b, c; cin >> b >> c; b--; c--; if (a == 1) { v2[min(b, c)].insert(max(b, c)); if (v2[min(b, c)].size() == 1) count -= 1; } else { v2[min(b, c)].erase(max(b, c)); if (v2[min(b, c)].size() == 0) count += 1; } } else { cout << count << n ; } } } int main() { solve(); }
|
#include <bits/stdc++.h> using namespace std; long long n, m, q; long long gcd(long long a, long long b) { if (a < b) swap(a, b); if (b == 0) return a; return gcd(b, a % b); } int main() { cin >> n >> m >> q; long long v = gcd(n, m); long long innersize = n / v; long long outersize = m / v; for (int i = 0; i < q; i++) { long long s1, x1, s2, x2; cin >> s1 >> x1 >> s2 >> x2; x1--; x2--; if (s1 == 1) { x1 /= innersize; } else { x1 /= outersize; } if (s2 == 1) { x2 /= innersize; } else { x2 /= outersize; } if (x1 == x2) { cout << YES n ; } else { cout << NO n ; } } }
|
#include <bits/stdc++.h> #pragma optimize( Ofast ) using namespace std; using ll = long long int; using ull = unsigned long long int; using dd = double; using ldd = long double; using si = short int; using pii = pair<int, int>; using pll = pair<ll, ll>; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); int n; cin >> n; vector<ll> arr(n); for (int i = 0; i < n; ++i) cin >> arr[i]; string s; cin >> s; ll wg, ww; wg = ww = 0; ll e = 0; ll ans = 0; bool was_w = 0; vector<ll> tos; for (int i = 0; i < n; ++i) { if (s[i] == L ) { if (arr[i] <= e) { e -= arr[i]; ans += arr[i]; ww = wg = 0; } else { e -= arr[i]; ans += arr[i]; if (was_w) { ans -= e * 3; } else { ans -= e * 5; } e = 0; ww = wg = 0; } tos.push_back(e); continue; } if (s[i] == W ) { was_w = 1; ans += arr[i] * 3; ww += arr[i]; e += arr[i]; tos.push_back(e); continue; } if (s[i] == G ) { ans += arr[i] * 5; wg += arr[i]; e += arr[i]; tos.push_back(e); continue; } } for (int i = tos.size() - 2; i >= 0; --i) tos[i] = min(tos[i], tos[i + 1]); ll mi = 0; for (int i = 0; i < n; ++i) { tos[i] -= mi; if (s[i] == G ) { if (arr[i] * 2 <= tos[i]) { ans -= arr[i] * 4; tos[i] -= arr[i] * 2; mi += arr[i] * 2; } else { mi += tos[i]; ans -= tos[i] * 2; tos[i] = 0; } } } for (int i = tos.size() - 2; i >= 0; --i) tos[i] = min(tos[i], tos[i + 1]); mi = 0; for (int i = 0; i < n; ++i) { tos[i] -= mi; if (s[i] == W ) { if (arr[i] * 2 <= tos[i]) { tos[i] -= arr[i] * 2; mi += arr[i] * 2; ans -= arr[i] * 2; } else { mi += tos[i]; ans -= tos[i]; tos[i] = 0; } } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int m = 0, k = 0, p = 0, i = 1; string s; cin >> s; int n, a[27]; cin >> n; for (i = 1; i < 27; i++) cin >> a[i], m = max(m, a[i]); for (i = 0; i < s.length(); i++) k += a[s[i] - 96] * (i + 1); while (n--) i++, p += i * m; cout << k + p; }
|
#include <bits/stdc++.h> int v[1000005]; int main() { int i, j, k; int n, m, a, b; int f[1010]; while (~scanf( %d , &n)) { memset(v, 0, sizeof(v)); a = b = 0; for (i = 0; i < n; i++) { scanf( %d , &f[i]); v[f[i]]++; if (v[f[i]] > b) { a = f[i]; b = v[f[i]]; } } printf( %d n , a); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; vector<string> S(26); for (auto ch : s) { S[ch - a ] += ch; if (S[ch - a ].size() == 100) { cout << S[ch - a ] << endl; return 0; } } int n = s.size(); int f[n + 1][n + 1]; int g[n + 1][n + 1]; for (int len = 1; len <= n; ++len) for (int i = 0; i + len - 1 < n; ++i) { if (len == 1) f[len][i] = 1; else if (len == 2 && s[i] == s[i + len - 1]) f[len][i] = 2; else { int a = f[len - 1][i] < f[len - 1][i + 1] ? f[len - 1][i + 1] : f[len - 1][i]; if (f[len - 1][i] == a) g[len][i] = 0; else g[len][i] = 1; if (len > 2 && s[i] == s[i + len - 1] && 2 + f[len - 2][i + 1] > a) { a = 2 + f[len - 2][i + 1]; g[len][i] = 2; } f[len][i] = a; } } vector<int> v; int len = n, x = 0; while (true) { if (len == 1) { v.push_back(x); break; } if (len == 2 && s[x] == s[x + len - 1]) { v.push_back(x); v.push_back(x + 1); break; } if (g[len][x] == 0) --len; else if (g[len][x] == 1) { --len; ++x; } else { v.push_back(x); v.push_back(x + len - 1); len -= 2; ++x; } } sort(v.begin(), v.end()); int take = 50; for (int i = 0; i < v.size(); ++i) if (i < take || i + take >= v.size()) cout << s[v[i]]; return 0; }
|
#include <bits/stdc++.h> using namespace std; char buf[200010]; char a[200010]; int n, t; int l; int digp; set<int> s; int main() { scanf( %d%d , &n, &t); scanf( %s , buf); for (int i = n - 1; 0 <= i; --i) { if (buf[i] == . ) { digp = n - 1 - i; continue; } a[l++] = buf[i]; } for (int i = l; i <= 200005; ++i) a[i] = 0 ; for (int i = 0; a[i]; ++i) { if (a[i] == . ) continue; if (a[i] >= 5 && i < digp) s.insert(i); } int clear_until = 0; for (; t--;) { if (s.empty()) break; int pt = *--s.end(); s.clear(); clear_until = max(clear_until, pt); a[pt] = 0 ; for (int i = pt + 1; a[i]; ++i) { if (a[i] == 9 ) { a[i] = 0 ; } else { ++a[i]; if (a[i] >= 5 && i < digp) s.insert(i); break; } } } for (int i = 0; i < clear_until; ++i) a[i] = 0 ; int last_exist = digp; for (int i = 0; i < digp; ++i) if (a[i] != 0 ) { last_exist = min(last_exist, i); } bool started = false; for (int i = 200005; last_exist <= i; --i) { if (a[i] > 0 ) { started = true; } if (started) putchar(a[i]); if (i == digp) { if (last_exist < i) { if (!started) putchar( 0 ); putchar( . ); started = true; } else { break; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; cout << k * (6 * n - 1) << endl; for (int i = 0; i < n; i++) { cout << (6 * i + 1) * k << << (6 * i + 2) * k << << (6 * i + 3) * k << << (6 * i + 5) * k << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) { res = (res * x) % p; } y = y >> 1; x = (x * x) % p; } return res; } long long modInverse(long long a, long long p) { return power(a, p - 2, p); } void gcd(long long a, long long b, long long& d, long long& u, long long& v) { if (b == 0) { d = a; u = 1; v = 0; } else { gcd(b, a % b, d, v, u); v -= a / b * u; } } long long Inverse(long long a, long long m) { a %= m; if (a < 0) a += m; long long d, u, v; gcd(a, m, d, u, v); assert(d == 1); u %= m; if (u < 0) u += m; return u; } long long gcd(long long x, long long y) { if (x == 0 || y == 0) { return max(y, x); } return gcd(y % x, x); } long long gcdExtended(long long a, long long b, long long& x, long long& y) { if (a == 0) { x = 0; y = 1; return b; } long long x1, y1; long long gcd = gcdExtended(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return gcd; }; int main() { long long n; scanf( %lld , &n); ; vector<long long> a; for (long long i = 0; i < n; i++) { long long x; scanf( %lld , &x); a.push_back(x); } vector<long long> sum; long long z = 0; for (long long i = 0; i < n; i++) { z += a[i]; sum.push_back(z); } long long p = 2; long long ans = 1e18; while (p * p <= z) { if (z % p == 0) { while (z % p == 0) z /= p; long long ret = 0; for (long long i = 0; i < n - 1; i++) { ret += (min(sum[i] % p, p - sum[i] % p)); } ans = min(ans, ret); } p++; } if (z != 1) { p = z; long long ret = 0; for (long long i = 0; i < n - 1; i++) { ret += (min(sum[i] % p, p - sum[i] % p)); } ans = min(ans, ret); } if (ans == 1e18) ans = -1; cout << ans << endl; }
|
#include <bits/stdc++.h> const int N = 1000001; using namespace std; char sub[N], s[N], l[N]; int a[10]; int main() { scanf( %s , s); int i, j, len1, len2; len1 = strlen(s); for (i = 0; i < len1; i++) a[s[i] - 0 ]++; scanf( %s , sub); len2 = strlen(sub); for (i = 0; i < len2; i++) a[sub[i] - 0 ]--; int lt = 1, rt = 1000000, mid, t, w; while (lt <= rt) { mid = (lt + rt) >> 1; t = mid; w = 0; while (t > 0) { w++; t /= 10; } if (mid + w == len1) break; else if (mid + w < len1) lt = mid + 1; else rt = mid - 1; } t = mid; while (t > 0) { a[t % 10]--; t /= 10; } bool ok = true; if (a[0] > 0 || sub[0] == 0 ) { ok = false; for (i = 1; i < 10; i++) if (a[i] > 0) break; if (i < 10) { ok = true; if (i < sub[0] - 0 ) { a[i]--; printf( %d , i); } else if (i > sub[0] - 0 ) { if (sub[0] != 0 ) { printf( %s , sub); for (i = 0; i < 10; i++) for (j = 1; j <= a[i]; j++) printf( %d , i); return 0; } printf( %d , i); a[i]--; } else { int p = 0, q; a[i]--; l[p++] = (char)(i + 0 ); for (i = 0; i < 10; i++) for (j = 1; j <= a[i]; j++) l[p++] = (char)(i + 0 ); q = p; if (p < len2) { for (i = 0; p < len2; i++) l[p++] = sub[i]; } for (i = 0; i < len2; i++) if (l[i] != sub[i]) break; if (i < len2 && sub[i] < l[i]) { l[q] = 0 ; sort(l, l + q); printf( %s%s , sub, l); return 0; } printf( %c , sub[0]); } } } int p = 0, q; for (i = 0; i < 10; i++) for (j = 1; j <= a[i]; j++) l[p++] = (char)(i + 0 ); l[p] = 0 ; if (!ok) { printf( %s%s , sub, l); return 0; } if (p == 0) { printf( %s , sub); return 0; } for (i = 0; i < p; i++) { if (l[i] < sub[0]) { printf( %c , l[i]); continue; } if (l[i] > sub[0]) { printf( %s , sub); printf( %s , l + i); return 0; } for (j = 1; j < len2; j++) if (sub[j] != sub[0]) break; if (j == len2 || sub[j] < sub[0]) { printf( %s , sub); printf( %s , l + i); return 0; } else { for (; l[i] == sub[0]; i++) printf( %c , l[i]); printf( %s , sub); printf( %s , l + i); return 0; } } printf( %s , sub); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( unroll-loops ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 40500; int h, lgn, n, t, r, x, y, a[N], dis[N], lp[N], dp[N][17]; vector<pair<int, int> > e1, e2; vector<int> g[N]; bool mark[N]; int lg(int xx) { int l = 0; while (xx > 1) { xx /= 2; ++l; } return l; } void bfs(int d, vector<int> &v) { vector<int> w; for (int i = 0; i < v.size(); i++) { for (int j = 0; j < g[v[i]].size(); j++) { if (dis[g[v[i]][j]] == INT32_MAX) { dis[g[v[i]][j]] = d + 1; w.push_back(g[v[i]][j]); } } } if (!w.empty()) bfs(d + 1, w); } void dfs(int v) { mark[v] = true; for (int i = 0; i < g[v].size(); i++) { if (!mark[g[v][i]]) { dis[g[v][i]] = dis[v] + 1; dp[g[v][i]][0] = v; for (int j = 1; j <= lgn; j++) dp[g[v][i]][j] = dp[dp[g[v][i]][j - 1]][j - 1]; dfs(g[v][i]); } } } int par(int v, int p) { while (p > 0) { int pp = p & (-p); v = dp[v][lg(pp)]; p -= pp; } return v; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> h >> t >> r >> x; int hh, tt; for (int i = 0; i < x; i++) { cin >> hh >> tt; e1.push_back({hh, tt}); } cin >> y; for (int i = 0; i < y; i++) { cin >> hh >> tt; e2.push_back({hh, tt}); } for (int i = r; i >= 0; i--) { for (int j = r - i; j >= 0; j--) { for (int k = 0; k < min(x, i); k++) { if ((i - k - 1 + e1[k].first + j + e1[k].second) <= r) g[(r + 1) * i + j].push_back((i - k - 1 + e1[k].first) * (r + 1) + j + e1[k].second); } for (int k = 0; k < min(y, j); k++) { if ((i + e2[k].first + j - k - 1 + e2[k].second) <= r) g[(r + 1) * i + j].push_back((i + e2[k].first) * (r + 1) + j - k - 1 + e2[k].second); } } } n = (r + 1) * (r + 1); lgn = lg(n); int s = h * (r + 1) + t; fill(dis, dis + n, INT32_MAX); vector<int> v; v.push_back(s); dis[s] = 0; bfs(0, v); if (dis[0] != INT32_MAX) { cout << Ivan n << dis[0]; return 0; } for (int i = 0; i < n; i++) fill(dp[i], dp[i] + 17, s); dfs(s); for (int i = 0; i < n; i++) { if (dis[i] != INT32_MAX) { for (int j = 0; j < g[i].size(); j++) { if (dis[g[i][j]] <= dis[i] && g[i][j] == par(i, dis[i] - dis[g[i][j]])) { cout << Draw ; return 0; } } } } for (int i = 0; i < n; i++) { if (dis[i] != INT32_MAX) { for (int j = 0; j < g[i].size(); j++) ++a[g[i][j]]; } } vector<int> w; w.push_back(s); while (!w.empty()) { int u = w[w.size() - 1]; w.pop_back(); for (int i = 0; i < g[u].size(); i++) { --a[g[u][i]]; lp[g[u][i]] = max(lp[g[u][i]], lp[u] + 1); if (a[g[u][i]] == 0) w.push_back(g[u][i]); } } int ans = 0; for (int i = 0; i < n; i++) ans = max(ans, lp[i]); cout << Zmey n << ans + 1; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int MAXK = 405; int dp[MAXK][2 * MAXK]; inline void mod(int &x) { if (x >= MOD) x -= MOD; } inline void add(int &x, int y) { x += y; mod(x); } int main() { int i, k; ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> k; dp[1][0] = dp[1][1] = 1; for (i = 2; i <= k; i++) { for (int a = 0; a <= k; a++) { if (dp[i - 1][a] == 0) continue; for (int b = 0; b <= k; b++) { if (dp[i - 1][b] == 0) continue; int x = (1LL * dp[i - 1][a] * dp[i - 1][b]) % MOD; add(dp[i][a + b], (2LL * x * (a + b) + x) % MOD); add(dp[i][a + b + 1], x); if (a + b > 0) { int two = (a + b) * (a + b - 1); add(dp[i][a + b - 1], (1LL * two * x) % MOD); } } } } cout << dp[k][1]; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int N = 4e5 + 2, inf = 1e12 + 7; vector<pair<int, int> > vec[N]; pair<int, pair<int, int> > edg[N]; long long int n, dis[N], dis2[N], st[N], ed[N]; long long int T[2 * N], lzy[2 * N], tim; void dfs(int u, int pr) { st[u] = ++tim; for (auto x : vec[u]) { int v = x.first, w = x.second; if (v == pr) continue; dis[v] = dis[u] + w; dfs(v, u); } ed[u] = tim; } void push_down(int nod, int lo, int hi) { T[nod] += lzy[nod]; if (lo != hi) { lzy[2 * nod] += lzy[nod]; lzy[2 * nod + 1] += lzy[nod]; } lzy[nod] = 0; } void updt(int nod, int lo, int hi, int l, int r, int vl) { if (lzy[nod]) push_down(nod, lo, hi); if (hi < l || lo > r || lo > hi) return; if (lo >= l && hi <= r) { T[nod] += vl; if (lo != hi) { lzy[2 * nod] += vl; lzy[2 * nod + 1] += vl; } return; } int md = (lo + hi) >> 1; updt(2 * nod, lo, md, l, r, vl); updt(2 * nod + 1, md + 1, hi, l, r, vl); T[nod] = min(T[2 * nod], T[2 * nod + 1]); } long long int qry(int nod, int lo, int hi, int l, int r) { if (lzy[nod]) push_down(nod, lo, hi); if (hi < l || lo > r || lo > hi) return inf; if (lo >= l && hi <= r) return T[nod]; int md = (lo + hi) >> 1; return min(qry(2 * nod, lo, md, l, r), qry(2 * nod + 1, md + 1, hi, l, r)); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1, t = 0; while (tc--) { int q; cin >> n >> q; for (int i = 1; i < n; i++) { int u, v, c; cin >> u >> v >> c; vec[u].push_back(make_pair(v, c)); edg[i] = make_pair(u, make_pair(v, c)); } for (int i = n; i < n + n - 1; i++) { int u, v, c; cin >> u >> v >> c; edg[i] = make_pair(u, make_pair(v, c)); dis2[u] = c; } dfs(1, -1); for (int i = 1; i <= n; i++) updt(1, 1, n, st[i], st[i], dis[i] + dis2[i]); while (q--) { int typ; cin >> typ; if (typ == 1) { int id, w; cin >> id >> w; int u = edg[id].first, v = edg[id].second.first; int c = edg[id].second.second; if (id < n) { updt(1, 1, n, st[v], ed[v], -c); updt(1, 1, n, st[v], ed[v], w); edg[id].second.second = w; } else { updt(1, 1, n, st[u], st[u], -c); updt(1, 1, n, st[u], st[u], w); edg[id].second.second = w; dis2[u] = w; } } else { int u, v; cin >> u >> v; if (st[v] >= st[u] && ed[u] >= ed[v]) { cout << qry(1, 1, n, st[v], st[v]) - qry(1, 1, n, st[u], st[u]) + dis2[u] - dis2[v] << n ; } else { long long int rs = qry(1, 1, n, st[u], ed[u]); rs -= qry(1, 1, n, st[u], st[u]); rs += qry(1, 1, n, st[v], st[v]); rs += dis2[u] - dis2[v]; cout << rs << n ; } } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; void Anivia_kid() { long long n; cin >> n; long long res = 1 + 3 * n * (n + 1); cout << res << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int q = 1; while (q--) { Anivia_kid(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100000; const int inf = (int)1e9 + 1; const long long big = (long long)1e18 + 1; const int P = 239; const int MOD = (int)1e9 + 7; const int MOD1 = (int)1e9 + 9; const double eps = 1e-9; const double pi = atan2(0, -1); const int ABC = 26; vector<int> g[N]; bool used[N]; vector<int> comp; void dfs(int u) { used[u] = true; comp.push_back(u); for (int v : g[u]) if (!used[v]) dfs(v); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.precision(20); int n, A, B; cin >> n >> A >> B; int a[n]; map<int, int> mapa; for (int i = 0; i < n; i++) { cin >> a[i]; mapa[a[i]] = i; } for (int i = 0; i < n; i++) { if (mapa.find(A - a[i]) != mapa.end()) g[i].push_back(mapa[A - a[i]]); if (mapa.find(B - a[i]) != mapa.end()) g[i].push_back(mapa[B - a[i]]); } int ans[n]; for (int i = 0; i < n; i++) if (!used[i]) { comp.clear(); dfs(i); int mask = 3; for (int j : comp) { int cur = 0; if (mapa.find(A - a[j]) != mapa.end()) cur |= 1; if (mapa.find(B - a[j]) != mapa.end()) cur |= 2; mask &= cur; } if (mask == 0) { cout << NO n ; return 0; } if (mask & 1) { for (int j : comp) ans[j] = 0; } else { for (int j : comp) ans[j] = 1; } } cout << YES n ; for (int i = 0; i < n; i++) cout << ans[i] << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; bool flag = false; cin >> s; stringstream ss(s); char arr[2 * n]; int min0 = 10; int max0 = 0; int min1 = 10; int max1 = 0; for (int i = 0; i < 2 * n; i++) { arr[i] = s.at(i); if (i < n) { if (min0 > (int)arr[i] - 48) { min0 = (int)arr[i] - 48; } if (max0 < (int)arr[i] - 48) { max0 = (int)arr[i] - 48; } } else { if (min1 > (int)arr[i] - 48) { min1 = (int)arr[i] - 48; } if (max1 < (int)arr[i] - 48) { max1 = (int)arr[i] - 48; } } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if ((int)arr[i] - 48 > (int)arr[j] - 48) { char temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } if ((int)arr[i + n] - 48 > (int)arr[j + n] - 48) { char temp = arr[i + n]; arr[i + n] = arr[j + n]; arr[j + n] = temp; } } } if (min0 < min1) { for (int i = 0; i < n; i++) { if (int(arr[i]) >= int(arr[i + n])) { flag = true; break; } } } else { for (int i = 0; i < n; i++) { if (int(arr[i]) <= int(arr[i + n])) { flag = true; break; } } } if (flag) { cout << NO << endl; } else { cout << YES << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void a15hx() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, l, r, x; cin >> n >> l >> r >> x; long long diff[n]; for (long long i = 0; i < n; i++) { cin >> diff[i]; } long long ways = 0; for (long long i = 0; i < 1 << n; i++) { if (__builtin_popcount(i) >= 2) { long long tot_diff = 0, easy = INT32_MAX, hard = INT32_MIN; for (long long j = 0; j < n; j++) { if (i >> j & 1) { tot_diff += diff[j]; easy = min(easy, diff[j]); hard = max(hard, diff[j]); } } if (tot_diff <= r && tot_diff >= l && hard - easy >= x) { ways++; } } } cout << ways; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); a15hx(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read(register T& t) { register T f = 1; register char ch = getchar(); t = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -f; ch = getchar(); } while (ch >= 0 && ch <= 9 ) t = t * 10 + ch - 0 , ch = getchar(); t *= f; return t; } template <typename T, typename... Args> inline void read(T& t, Args&... args) { read(t); read(args...); } const long long p = 998244353; inline long long power(register long long x, register long long k = p - 2) { register long long re = 1; for (; k; k >>= 1, x = x * x % p) if (k & 1) re = re * x % p; return re; } int n, Q; char* c[100005]; char _c[100005]; int len[100005]; int B; struct Ask { int r, k, id, col; }; vector<Ask> bf[100005], buf; bool cmp(Ask a, Ask b) { return a.r < b.r; } int trie[200005][26]; int tot; inline int Insert(char* c) { int p = 0; int len = strlen(c); for (int i = 0; i < len; i++) { int x = c[i] - a ; if (!trie[p][x]) trie[p][x] = ++tot; p = trie[p][x]; } return p; } int fail[200005]; void build_fail() { queue<int> q; for (int i = 0; i < 26; i++) if (trie[0][i]) q.push(trie[0][i]); while (q.size()) { int p = q.front(); q.pop(); for (int i = 0; i < 26; i++) if (trie[p][i]) fail[trie[p][i]] = trie[fail[p]][i], q.push(trie[p][i]); else trie[p][i] = trie[fail[p]][i]; } } int head[200005], ne[400005], to[400005], total = 1; inline void add(int a, int b) { total++; to[total] = b; ne[total] = head[a]; head[a] = total; } void build_tree() { for (int i = 1; i <= tot; i++) add(fail[i], i); } int M; int cnt[200005]; void build_cnt(int now) { for (int i = head[now]; i; i = ne[i]) build_cnt(to[i]), cnt[now] += cnt[to[i]]; } int id[200005]; long long Ans[200005]; int dfn[200005], dfn_top; int Size[200005]; void build_dfn(int now) { Size[now] = 1; dfn[now] = ++dfn_top; for (int i = head[now]; i; i = ne[i]) build_dfn(to[i]), Size[now] += Size[to[i]]; } struct BIT { long long c[200005]; inline void add(int x, int val) { for (; x <= 200000; x += (x & -x)) c[x] += val; } inline long long ask(int x) { long long re = 0; for (; x; x -= (x & -x)) re += c[x]; return re; } } T; int main() { read(n, Q); for (int i = 1; i <= n; i++) { scanf( %s , _c); len[i] = strlen(_c); c[i] = new char[len[i] + 10]; for (int j = 0; j <= len[i]; j++) c[i][j] = _c[j]; M += len[i]; } B = 1.0 * M / (sqrt(1.0 * Q * log2(M)) + 1); for (int i = 1; i <= n; i++) id[i] = Insert(c[i]); build_fail(); build_tree(); for (int i = 1; i <= Q; i++) { int l, r, k; read(l, r, k); if (len[k] > B) { bf[k].push_back((Ask){l - 1, k, i, -1}); bf[k].push_back((Ask){r, k, i, 1}); } else { buf.push_back((Ask){l - 1, k, i, -1}); buf.push_back((Ask){r, k, i, 1}); } } for (int i = 1; i <= n; i++) if (bf[i].size()) { sort(bf[i].begin(), bf[i].end(), cmp); for (int j = 0; j <= tot; j++) cnt[j] = 0; int p = 0; for (int j = 0; j < len[i]; j++) { int x = c[i][j] - a ; p = trie[p][x]; cnt[p]++; } build_cnt(0); int k = 0; while (bf[i][k].r == 0 && k + 1 != bf[i].size()) k++; static long long pre[200005]; for (int j = 1; j <= n; j++) { pre[j] = pre[j - 1] + cnt[id[j]]; while (k != bf[i].size() && bf[i][k].r == j) Ans[bf[i][k].id] += 1ll * bf[i][k].col * pre[j], k++; } } sort(buf.begin(), buf.end(), cmp); int k = 0; build_dfn(0); while (k != buf.size() && buf[k].r == 0) k++; for (int i = 1; i <= n; i++) { int tp = id[i]; T.add(dfn[tp], 1); T.add(dfn[tp] + Size[tp], -1); while (k != buf.size() && buf[k].r == i) { long long ans = 0; int p = 0; for (int j = 0; j < len[buf[k].k]; j++) { int x = c[buf[k].k][j] - a ; p = trie[p][x]; ans += T.ask(dfn[p]); } Ans[buf[k].id] += 1ll * buf[k].col * ans; k++; } } for (int i = 1; i <= Q; i++) printf( %lld n , Ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2; const int MO = 1e9 + 7; const int K = 5e8 + 4; struct Matrix { int a[N][N]; Matrix(bool ident = 0) { for (int i = int(0); i <= int((N)-1); i++) for (int j = int(0); j <= int((N)-1); j++) a[i][j] = 0; if (ident) { for (int i = int(0); i <= int((N)-1); i++) a[i][i] = 1; } } int *operator[](int i) { return a[i]; } const int *operator[](int i) const { return a[i]; } }; void add(int &x, int y) { x += y; if (x >= MO) x -= MO; } Matrix operator*(const Matrix &a, const Matrix &b) { Matrix c; for (int i = int(0); i <= int((N)-1); i++) for (int j = int(0); j <= int((N)-1); j++) for (int k = int(0); k <= int((N)-1); k++) { add(c[i][j], 1LL * a[i][k] * b[k][j] % MO); } return c; } Matrix powd(Matrix a, long long b) { Matrix ans(1); while (b) { if (b & 1) ans = ans * a; a = a * a; b >>= 1; } return ans; } int powd(int a, long long b) { int ans = 1; while (b) { if (b & 1) ans = 1LL * ans * a % MO; b >>= 1; a = 1LL * a * a % MO; } return ans; } int main() { Matrix magic; magic[0][0] = magic[1][0] = 1, magic[0][1] = 2; int n; cin >> n; Matrix now = magic; int down = 2; for (int i = int(0); i <= int((n)-1); i++) { long long x; scanf( %I64d , &x); now = powd(now, x); down = powd(down, x); } cout << 1LL * now[1][1] * K % MO << / << 1LL * down * K % MO << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; const long long inf = 1e15; long long dp[maxn], num[maxn], ans; vector<int> G[maxn]; void dfs(int u, int fa) { for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (v == fa) continue; dfs(v, u); num[u] += num[v]; if (dp[u] != -inf) ans = max(ans, dp[u] + dp[v]); dp[u] = max(dp[u], dp[v]); } dp[u] = max(dp[u], num[u]); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %I64d , &num[i]); dp[i] = -inf; G[i].clear(); } int u, v; for (int i = 0; i < n - 1; i++) { scanf( %d%d , &u, &v); G[u].push_back(v); G[v].push_back(u); } ans = -inf; dfs(1, -1); if (ans == -inf) printf( Impossible n ); else printf( %I64d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long quickpow(long long a, long long n, long long m) { long long ans = 1; while (n) { if (n & 1) ans = (ans * a) % m; a = (a * a) % m; n >>= 1; } return ans; } bool is_prime(long long p) { if (p < 2) return false; for (long long i = 2; i * i <= p; i++) { if (i < p && p % i == 0) return false; } return true; } bool is_root(long long a, long long p) { if (a % p == 0) return false; for (long long i = 1; i * i <= p - 1; i++) { if ((p - 1) % i == 0) { if (i < p - 1 && quickpow(a, i, p) == 1) return false; if ((p - 1) / i < p - 1 && quickpow(a, (p - 1) / i, p) == 1) return false; } } return true; } int main() { long long N, X; cin >> N >> X; if (!is_prime(N + 1)) cout << -1 << endl; else { for (long long b = X - 1; b > 1; b--) { if (is_root(b, N + 1)) { cout << b << endl; return 0; } } cout << -1 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void fre() { freopen( c://test//input.in , r , stdin); freopen( c://test//output.out , w , stdout); } template <class T1, class T2> inline void gmax(T1 &a, T2 b) { if (b > a) a = b; } template <class T1, class T2> inline void gmin(T1 &a, T2 b) { if (b < a) a = b; } const int N = (1 << 20) + 10, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f; template <class T1, class T2> inline void gadd(T1 &a, T2 b) { a = (a + b) % Z; } int n, m, top; int a[N], b[N]; long long num[21]; long long sum[21]; int v[N]; void add(int x, int val) { for (; x <= top; x += x & -x) v[x] += val; } int cnt(int x) { int ret = 0; for (; x; x -= x & -x) ret += v[x]; return ret; } void init() { for (int i = 1; i <= n; ++i) { int l = 1 << i; int d = m / l; sum[i] = 0; num[i] = 0; int st = 0; while (d--) { for (int j = l / 2 + 1; j <= l; ++j) add(a[st + j], 1); for (int j = 1; j <= l / 2; ++j) { int tmp1 = cnt(a[st + j] - 1); int tmp2 = cnt(a[st + j]); num[i] += tmp1; sum[i] += l / 2 - (tmp2 - tmp1); } for (int j = l / 2 + 1; j <= l; ++j) add(a[st + j], -1); st += l; } } } int main() { while (~scanf( %d , &n)) { m = 1 << n; for (int i = 1; i <= m; ++i) scanf( %d , &a[i]), b[i] = a[i]; sort(b + 1, b + m + 1); top = unique(b + 1, b + m + 1) - b - 1; for (int i = 1; i <= m; ++i) a[i] = lower_bound(b + 1, b + top + 1, a[i]) - b; init(); int q; scanf( %d , &q); while (q--) { int x; scanf( %d , &x); for (int i = x; i >= 1; --i) num[i] = sum[i] - num[i]; long long ans = 0; for (int i = 1; i <= n; ++i) ans += num[i]; printf( %lld n , ans); } } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const int Mod = 1e9 + 7; const int N = 3e5 + 100; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; inline long long dpow(long long a, long long b) { long long r = 1, t = a; while (b) { if (b & 1) r = (r * t) % Mod; b >>= 1; t = (t * t) % Mod; } return r; } inline long long fpow(long long a, long long b) { long long r = 1, t = a; while (b) { if (b & 1) r = (r * t); b >>= 1; t = (t * t); } return r; } int a[N], ans[N], n; int mx[N], lst[N]; void Init() { for (int i = 1; i <= n; i++) mx[i] = lst[i] = ans[i] = 0; } int main() { int T; cin >> T; while (T--) { scanf( %d , &n); Init(); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); mx[a[i]] = max(mx[a[i]], i - lst[a[i]]); lst[a[i]] = i; } for (int i = 1; i <= n; i++) if (lst[i]) mx[i] = max(mx[i], n + 1 - lst[i]); int r = n; for (int i = 1; i <= n; i++) { if (!lst[i]) continue; int j; for (j = mx[i]; j <= r; j++) ans[j] = i; r = min(r, mx[i] - 1); } for (int i = 1; i <= n; i++) { if (!ans[i]) printf( -1 ); else printf( %d , ans[i]); } puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, a[1005][1005], d[1005][1005], ans, D[10005]; pair<int, int> b[100005]; int ch(int x, int y) { for (int i = 1; i <= k; i++) { if (d[i][y] > d[i][x]) return 0; } return 1; } int main() { cin >> n >> k; for (int i = 1; i <= k; i++) { for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int j = 1; j <= n; j++) d[i][a[i][j]] = j; for (int j = 1; j <= n; j++) b[a[i][j]].first = max(b[a[i][j]].first, j); } for (int j = 1; j <= n; j++) b[j].second = j; sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) { int ma = 0; int I = b[i].second; for (int j = 1; j < i; j++) { int J = b[j].second; if (ch(I, J) && D[j] > ma) ma = D[j]; } D[i] = ma + 1; ans = max(ans, D[i]); } cout << ans << endl; cin >> n; }
|
#include <bits/stdc++.h> using namespace std; int a[105]; int main() { int n, l, i, j, cnt, area, ans; scanf( %d%d , &n, &l); for (i = 1; i <= n; i++) scanf( %d , &a[i]); ans = 0; for (i = l; i <= 100; i++) { cnt = 0; for (j = 1; j <= n; j++) cnt += a[j] / i; area = cnt * i; ans = max(ans, area); } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { register long long x = 0, f = 1; register char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = x * 10 + c - 48, c = getchar(); return x * f; } long long t, l, r, tot, cnt; long long f[50 + 5][2520 + 5][50 + 5], in[2520 + 5], a[2520 + 5], bas[2520 + 5]; long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } long long dfs(long long p, long long sum, long long lcm, bool limit) { if (!p) return sum % lcm == 0 ? 1 : 0; if (!limit && f[p][sum][in[lcm]] != -1) return f[p][sum][in[lcm]]; long long up = limit ? a[p] : 9, ans = 0; for (register long long i = 0; i <= up; ++i) { if (i == 0) ans += dfs(p - 1, sum * 10 % 2520, lcm, limit && (i == up)); else ans += dfs(p - 1, (sum * 10 + i) % 2520, lcm * i / gcd(lcm, i), limit && (i == up)); } if (!limit) f[p][sum][in[lcm]] = ans; return ans; } long long calc(long long x) { cnt = 0; while (x) a[++cnt] = x % 10, x /= 10; return dfs(cnt, 0, 1, 1); } signed main() { t = read(); memset(f, -1, sizeof(f)); ; for (register long long i = 1; i <= 2520; ++i) if (2520 % i == 0) in[i] = (++(tot)); while (t--) l = read(), r = read(), printf( %lld n , calc(r) - calc(l - 1)); return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t = 1; long long arr[7] = {1, 2, 3, 1, 3, 2, 1}; while (t--) { long long a, b, c; cin >> a >> b >> c; long long full = min({a / 3, b / 2, c / 2}); a -= 3 * full; b -= 2 * full; c -= 2 * full; long long extra = 0; long long i = 0; while (i < 7) { long long a1 = a, b1 = b, c1 = c; long long sta = i; long long cue = 0; while (1) { if (arr[sta] == 1 && a1 == 0) break; if (arr[sta] == 2 && b1 == 0) break; if (arr[sta] == 3 && c1 == 0) break; if (arr[sta] == 1) a1--; if (arr[sta] == 2) b1--; if (arr[sta] == 3) c1--; cue++; sta++; if (sta == 7) sta = 0; } if (extra < cue) extra = cue; i++; } cout << 7 * full + extra << endl; } }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long long mod = 1e9 + 7; const long long inf = 1e9 + 7; vector<vector<int> > g; vector<bool> used; int main() { int n, m; cin >> n >> m; g.resize(n); used.resize(n, false); for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; u--, v--; g[u].push_back(v); g[v].push_back(u); } set<int> q; q.insert(0); used[0] = true; while (!q.empty()) { int u = *q.begin(); q.erase(q.begin()); cout << u + 1 << ; for (auto v : g[u]) if (!used[v]) { q.insert(v); used[v] = true; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int fib(int n) { int b = 1; int c = 1; while (n--) { c = (c + b) % MOD; swap(b, c); } return c; } int main() { int n, m; cin >> n >> m; int a = fib(n); int b = fib(m); cout << (a + b - 1) % MOD * 2 % MOD << endl; return 0; }
|
#include <bits/stdc++.h> void start(int *ST, int *END, int n, char *A) { int i, kol_vo = 0; for (i = n; i > 0; i--) { if (A[i] == A && END[0] == -1) { kol_vo++; END[0] = i; } if (A[i] == B && END[1] == -1) END[1] = i; kol_vo++; ; if (A[i] == C && END[2] == -1) END[2] = i; kol_vo++; if (A[i] == D && END[3] == -1) END[3] = i; kol_vo++; if (A[i] == E && END[4] == -1) END[4] = i; kol_vo++; if (A[i] == F && END[5] == -1) END[5] = i; kol_vo++; if (A[i] == G && END[6] == -1) END[6] = i; kol_vo++; if (A[i] == H && END[7] == -1) END[7] = i; kol_vo++; if (A[i] == I && END[8] == -1) END[8] = i; kol_vo++; if (A[i] == J && END[9] == -1) END[9] = i; kol_vo++; if (A[i] == K && END[10] == -1) { END[10] = i; kol_vo++; } if (A[i] == L && END[11] == -1) { END[11] = i; kol_vo++; } if (A[i] == M && END[12] == -1) { END[12] = i; kol_vo++; } if (A[i] == N && END[13] == -1) { END[13] = i; kol_vo++; } if (A[i] == O && END[14] == -1) { END[14] = i; kol_vo++; } if (A[i] == P && END[15] == -1) { END[15] = i; kol_vo++; } if (A[i] == Q && END[16] == -1) { END[16] = i; kol_vo++; } if (A[i] == R && END[17] == -1) { END[17] = i; kol_vo++; } if (A[i] == S && END[18] == -1) { END[18] = i; kol_vo++; } if (A[i] == T && END[19] == -1) { END[19] = i; kol_vo++; } if (A[i] == U && END[20] == -1) { END[20] = i; kol_vo++; } if (A[i] == V && END[21] == -1) { END[21] = i; kol_vo++; } if (A[i] == W && END[22] == -1) { END[22] = i; kol_vo++; } if (A[i] == X && END[23] == -1) { END[23] = i; kol_vo++; } if (A[i] == Y && END[24] == -1) { END[24] = i; kol_vo++; } if (A[i] == Z && END[25] == -1) { END[25] = i; kol_vo++; } if (kol_vo == 26) break; } } int main() { int n, k, i, ST[26], END[26], answ = 1; char *Guest, tmp; scanf( %d %d , &n, &k); n++; Guest = (char *)malloc(n * sizeof(char)); for (i = 0; i < n; i++) scanf( %c , &Guest[i]); for (i = 0; i < 26; i++) { ST[i] = -1; END[i] = -1; } start(ST, END, n, Guest); for (i = 1; i < n; i++) { if (Guest[i] == A && ST[0] == -1) { ST[0] = 1; k--; if (k < 0) answ = -1; } if (END[0] == i) k++; if (Guest[i] == B && ST[1] == -1) { ST[1] = 1; k--; if (k < 0) answ = -1; } if (END[1] == i) k++; if (Guest[i] == C && ST[2] == -1) { ST[2] = 1; k--; if (k < 0) answ = -1; } if (END[2] == i) k++; if (Guest[i] == D && ST[3] == -1) { ST[3] = 1; k--; if (k < 0) answ = -1; } if (END[3] == i) k++; if (Guest[i] == E && ST[4] == -1) { ST[4] = 1; k--; if (k < 0) answ = -1; } if (END[4] == i) k++; if (Guest[i] == F && ST[5] == -1) { ST[5] = 1; k--; if (k < 0) answ = -1; } if (END[5] == i) k++; if (Guest[i] == G && ST[6] == -1) { ST[6] = 1; k--; if (k < 0) answ = -1; } if (END[6] == i) k++; if (Guest[i] == H && ST[7] == -1) { ST[7] = 1; k--; if (k < 0) answ = -1; } if (END[7] == i) k++; if (Guest[i] == I && ST[8] == -1) { ST[8] = 1; k--; if (k < 0) answ = -1; } if (END[8] == i) k++; if (Guest[i] == J && ST[9] == -1) { ST[9] = 1; k--; if (k < 0) answ = -1; } if (END[9] == i) k++; if (Guest[i] == K && ST[10] == -1) { ST[10] = 1; k--; if (k < 0) answ = -1; } if (END[10] == i) k++; if (Guest[i] == L && ST[11] == -1) { ST[11] = 1; k--; if (k < 0) answ = -1; } if (END[11] == i) k++; if (Guest[i] == M && ST[12] == -1) { ST[12] = 1; k--; if (k < 0) answ = -1; } if (END[12] == i) k++; if (Guest[i] == N && ST[13] == -1) { ST[13] = 1; k--; if (k < 0) answ = -1; } if (END[13] == i) k++; if (Guest[i] == O && ST[14] == -1) { ST[14] = 1; k--; if (k < 0) answ = -1; } if (END[14] == i) k++; if (Guest[i] == P && ST[15] == -1) { ST[15] = 1; k--; if (k < 0) answ = -1; } if (END[15] == i) k++; if (Guest[i] == Q && ST[16] == -1) { ST[16] = 1; k--; if (k < 0) answ = -1; } if (END[16] == i) k++; if (Guest[i] == R && ST[17] == -1) { ST[17] = 1; k--; if (k < 0) answ = -1; } if (END[17] == i) k++; if (Guest[i] == S && ST[18] == -1) { ST[18] = 1; k--; if (k < 0) answ = -1; } if (END[18] == i) k++; if (Guest[i] == T && ST[19] == -1) { ST[19] = 1; k--; if (k < 0) answ = -1; } if (END[19] == i) k++; if (Guest[i] == U && ST[20] == -1) { ST[20] = 1; k--; if (k < 0) answ = -1; } if (END[20] == i) k++; if (Guest[i] == V && ST[21] == -1) { ST[21] = 1; k--; if (k < 0) answ = -1; } if (END[21] == i) k++; if (Guest[i] == W && ST[22] == -1) { ST[22] = 1; k--; if (k < 0) answ = -1; } if (END[22] == i) k++; if (Guest[i] == X && ST[23] == -1) { ST[23] = 1; k--; if (k < 0) answ = -1; } if (END[23] == i) k++; if (Guest[i] == Y && ST[24] == -1) { ST[24] = 1; k--; if (k < 0) answ = -1; } if (END[24] == i) k++; if (Guest[i] == Z && ST[25] == -1) { ST[25] = 1; k--; if (k < 0) answ = -1; } if (END[25] == i) k++; } if (answ == -1) printf( YES ); else printf( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[10100], b[1010]; int main() { int n, m, c, ans; scanf( %d%d%d , &n, &m, &c); ans = (n + m + c) / 2; if (n + c >= ans && m + c >= ans) printf( %d n , ans * 2); else printf( %d n , min(n + c, m + c) * 2); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (t == 10) { if (n < 2) { cout << -1 n ; return 0; } cout << 1; for (int i = 0; i < n - 1; i++) cout << 0; cout << n ; return 0; } cout << t; for (int i = 0; i < n - 1; i++) cout << 0; cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %lld , &x); return x; } char ch[4000010]; inline string get() { scanf( %s , ch); return string(ch); } inline void read(int *a, int n) { for (int i = 0; i < n; i++) a[i] = in(); } template <class blank> inline void out(blank x) { cout << x << n ; exit(0); } template <class blank, class blank2> inline void smin(blank &a, blank2 b) { a = a <= b ? a : b; } template <class blank, class blank2> inline void smax(blank &a, blank2 b) { a = a >= b ? a : b; } const int maxn = 3e5 + 10; const int maxm = 4e6 + 10; const int maxlg = 20; const int base = 29; const int mod = 1e9 + 7; const int inf = 2e18 + 10; const double eps = 1e-9; string code[maxn]; int correct[maxn]; int mark[maxn]; int n, m; int res; inline void bt(int pos = 0, int cnt = 0) { if (cnt > correct[0] || n - pos + cnt < correct[0]) return; if (pos == n) { string cc = code[0]; for (int i = 0; i < n; i++) { if (mark[i] == 0) { cc[i] ^= 1 ^ 0 ; } } bool fl = true; for (int i = 0; i < m; i++) { int diff = 0; for (int j = 0; j < n; j++) diff += code[i][j] != cc[j]; if (diff != n - correct[i]) fl = false; } res += fl; return; } bt(pos + 1, cnt); mark[pos] = true; bt(pos + 1, cnt + 1); mark[pos] = false; } int32_t main() { n = in(), m = in(); for (int i = 0; i < m; i++) { code[i] = get(), correct[i] = in(); } bt(0); cout << res << n ; }
|
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); bool getcell(vector<vector<bool>>& b, int i, int j) { if (i >= b.size() || j >= b[0].size() || i < 0 || j < 0) return false; return b[i][j]; } bool isPlus(vector<vector<bool>>& b, int i, int j) { return getcell(b, i + 1, j) && getcell(b, i - 1, j) && getcell(b, i, j + 1) && getcell(b, i, j - 1); } int genPlus(vector<vector<bool>>& b, int i, int j) { int ret = 0; int x, y; x = i; y = j; while (getcell(b, x + 1, y)) { ++x; ++ret; } x = i; y = j; while (getcell(b, x - 1, y)) { --x; ++ret; } x = i; y = j; while (getcell(b, x, y + 1)) { ++y; ++ret; } x = i; y = j; while (getcell(b, x, y - 1)) { --y; ++ret; } return ret; } int main(int argc, char const* argv[]) { cin.sync_with_stdio(0); cin.tie(0); int h, w; cin >> h >> w; int cnt = 0; vector<vector<bool>> there(h, vector<bool>(w)); for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { char c; cin >> c; there[i][j] = (c == * ); cnt += there[i][j]; } } for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (there[i][j] && isPlus(there, i, j)) { int g = genPlus(there, i, j); if (g + 1 == cnt) { cout << YES ; return 0; } cout << NO ; return 0; } } } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; char str[200000 + 5]; long long f[200000 + 5]; struct node { int nxt[26]; int fa; long long len; } t[200000 + 10]; long long ans = 0; int last, tot; vector<int> g[200000 + 5]; void insrt(int x) { int nd = ++tot; f[nd] = 1; int p = last; last = nd; t[nd].len = t[p].len + 1; for (; p && t[p].nxt[x] == 0; p = t[p].fa) t[p].nxt[x] = nd; if (!p) t[nd].fa = 1; else { int q = t[p].nxt[x]; if (t[p].len + 1 == t[q].len) t[nd].fa = q; else { int nt = ++tot; t[nt] = t[q]; t[nd].fa = t[q].fa = nt; t[nt].len = t[p].len + 1; for (; t[p].nxt[x] == q && p; p = t[p].fa) t[p].nxt[x] = nt; } } } void init() { last = 1, tot = 1; memset(t, 0, sizeof(t)); for (int i = 0; i <= 200000 + 3; i++) g[i].clear(), f[i] = 0; } void dfs(int u) { for (int i = 0; i < g[u].size(); i++) { dfs(g[u][i]); f[u] += f[g[u][i]]; } ans += (t[u].len - t[t[u].fa].len) * f[u] * f[u]; return; } int main() { int T_T; cin >> T_T; while (T_T--) { scanf( %s , str); int len = strlen(str); init(); ans = 0; for (int i = 0; i < len; i++) insrt(str[i] - a ); for (int i = 1; i <= tot; i++) g[t[i].fa].push_back(i); dfs(0); printf( %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long int maximum_no = 1e18 + 1; string A, B, C, curr; long long int a, b, c, f[100005]; char solve(int n, long long int k) { if (n == 0) { if (k > f[0]) return . ; return curr[k - 1]; } if (k <= a) return A[k - 1]; if (k <= a + f[n - 1]) return solve(n - 1, k - a); if (k <= a + f[n - 1] + b) return B[k - a - f[n - 1] - 1]; if (k <= a + f[n - 1] + b + f[n - 1]) return solve(n - 1, k - a - f[n - 1] - b); if (k <= a + f[n - 1] + b + f[n - 1] + c) return C[k - (a + f[n - 1] + b + f[n - 1]) - 1]; return . ; } int n, q; long long int k; int main() { A = What are you doing while sending ; B = ? Are you busy? Will you send ; C = ? ; curr = What are you doing at the end of the world? Are you busy? Will you save us? ; f[0] = curr.length(); a = A.length(); b = B.length(); c = C.length(); for (int i = 1; i <= 100000; i++) { f[i] = min(maximum_no, a + f[i - 1] + b + f[i - 1] + c); } string ans = ; scanf( %d , &q); while (q--) { scanf( %d %lld , &n, &k); if (f[n] < k) ans.push_back( . ); else ans.push_back(solve(n, k)); } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int len, k; cin >> len >> k; string s; cin >> s; sort(s.begin(), s.end()); if (s[0] != s[k - 1]) cout << s[k - 1] << endl; else { cout << s[k - 1]; if (s[k] == s[len - 1]) { int q = (len - k) / k; if ((len - k) % k) q++; while (q--) cout << s[k]; } else for (int i = k; i < len; i++) cout << s[i]; cout << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { float i = 0; int e; double answer; cin >> i; for (int k = 0; k < i; k++) { cin >> e; answer += e; } cout << answer / i; }
|
#include <bits/stdc++.h> using namespace std; const int N = 500005; int n, m[N], t[N]; struct People { int a, b, c, cnt; } p[N], ran[N]; int read() { int x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); return x; } bool cmp(People x, People y) { if (x.a != y.a) return x.a > y.a; else return x.c < y.c; } int lowbit(int x) { return x & -x; } void add(int x, int k) { for (; x <= n; x += lowbit(x)) t[x] += k; return; } int sum(int x) { int ret = 0; for (; x; x -= lowbit(x)) ret += t[x]; return ret; } void merge(int l, int r) { if (l == r) return; int mid = (l + r) / 2; merge(l, mid); merge(mid + 1, r); int i = l, j = mid + 1, cur = l; for (; i <= mid && j <= r;) { if (p[i].b > p[j].b) add(p[i].c, 1), ran[cur++] = p[i++]; else p[j].cnt += sum(n) - sum(p[j].c), ran[cur++] = p[j++]; } for (; i <= mid;) add(p[i].c, 1), ran[cur++] = p[i++]; for (; j <= r;) p[j].cnt += sum(n) - sum(p[j].c), ran[cur++] = p[j++]; for (i = l; i <= mid; ++i) add(p[i].c, -1); for (i = l; i <= r; ++i) p[i] = ran[i]; } int main() { n = read(); for (int i = 1; i <= n; ++i) p[i].a = read(); for (int i = 1; i <= n; ++i) p[i].b = read(); for (int i = 1; i <= n; ++i) p[i].c = read(), m[i] = p[i].c; sort(m + 1, m + 1 + n); for (int i = 1; i <= n; ++i) p[i].c = lower_bound(m + 1, m + 1 + n, p[i].c) - m; sort(p + 1, p + 1 + n, cmp); merge(1, n); int ans = 0; for (int i = 1; i <= n; ++i) if (p[i].cnt) ++ans; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using uint8 = unsigned char; using uint16 = unsigned short int; using uint32 = unsigned int; using uint64 = unsigned long long; using int8 = signed char; using int16 = short int; using int32 = int; using int64 = long long; using dr = double; using pi32 = std::pair<int32, int32>; using pi64 = std::pair<int64, int64>; using pi64i32 = std::pair<int64, int32>; using pi32pi32 = std::pair<int32, pi32>; using cpdr = std::complex<dr>; using vi32 = std::vector<int32>; using qi32 = std::queue<int32>; using spi32 = std::set<pi32>; using spi32it = spi32::iterator; namespace oct { const int tn4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; const int tn8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}}; const dr exp = 1e-8; void sync(int pre = 8); template <typename _Tp> _Tp &mad(_Tp &x, _Tp y); template <typename _Tp> _Tp &mid(_Tp &x, _Tp y); template <typename _Tp> bool in(_Tp x, _Tp l, _Tp r); template <typename _Tp> _Tp sqr(_Tp x); template <typename _Tp> _Tp power(_Tp x, int64 m); template <typename _Tp> void sort(_Tp &x, _Tp &y); template <typename _Tp1, typename _Tp2> std::pair<_Tp1, _Tp2> operator+(std::pair<_Tp1, _Tp2> x, std::pair<_Tp1, _Tp2> y); template <typename _Tp> _Tp &operator+=(_Tp &x, _Tp y); inline void sync(int pre) { std::ios::sync_with_stdio(0); std::cin.tie(0), std::cout.tie(0); std::cout.flags(std::ios::fixed); std::cout.precision(pre); std::cout.setf(std::ios::showpoint); } template <typename _Tp> inline _Tp &mad(_Tp &x, _Tp y) { return x = std::max(x, y); } template <typename _Tp> inline _Tp &mid(_Tp &x, _Tp y) { return x = std::min(x, y); } template <typename _Tp> inline bool in(_Tp x, _Tp l, _Tp r) { return l <= x && x <= r; } template <typename _Tp> inline _Tp sqr(_Tp x) { return x * x; } template <typename _Tp> inline _Tp power(_Tp x, int64 m) { return m == 1 ? x : (m & 1 ? power(x * x, m / 2) * x : power(x * x, m / 2)); } template <typename _Tp> inline void sort(_Tp &x, _Tp &y) { if (x > y) std::swap(x, y); } template <typename _Tp1, typename _Tp2> inline std::pair<_Tp1, _Tp2> operator+(std::pair<_Tp1, _Tp2> x, std::pair<_Tp1, _Tp2> y) { return x.first += y.first, x.second += y.second, x; } template <typename _Tp> _Tp &operator+=(_Tp &x, _Tp y) { return x = x + y; } } // namespace oct const int N = 100005; dr ta, tb, tc; dr a[N], b[N], s[N], t[N]; int n; int main() { oct::sync(); std::cin >> n; for (int i = 1; i <= n; ++i) std::cin >> a[i], a[i] += a[i - 1]; for (int i = 1; i <= n; ++i) std::cin >> b[i], b[i] += b[i - 1]; for (int i = 1; i <= n; ++i) { ta = 1, tb = -(a[i] + b[i]), tc = a[i]; s[i] = (-tb - sqrt(std::abs(tb * tb - 4 * ta * tc))) / (2 * ta); t[i] = (-tb + sqrt(std::abs(tb * tb - 4 * ta * tc))) / (2 * ta); } for (int i = 1; i <= n; ++i) std::cout << s[i] - s[i - 1] << ; std::cout << std::endl; for (int i = 1; i <= n; ++i) std::cout << t[i] - t[i - 1] << ; std::cout << std::endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; string str; string l; map<string, int> m; string Greedy_Solve() { string res = ; for (int i = 0; i < l.length(); i += 10) { str = l.substr(i, 10); res += m[str] + 0 ; } return res; } int main() { cin >> l; for (int i = 0; i < 10; i++) { cin >> str; m[str] = i; } cout << Greedy_Solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long ans; int main() { cin >> n >> m >> k; if (k > n + m - 2) { cout << -1 << endl; return 0; } if (k > n - 1) { long long x = k; x -= (n - 1); ans = m / (x + 1); } else ans = n / (k + 1) * m; if (k > m - 1) { long long x = k; x -= (m - 1); ans = max(ans, (n / (x + 1))); } else ans = max(ans, (m / (k + 1) * n)); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2 == 0) { cout << 4 << << n - 4 << endl; } if (n % 2 == 1) { cout << 9 << << n - 9 << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double EPS = 0.000000001; const double PI = 3.141592653589793; const long long LLINF = 99999999999999999LL; const int MAX_N = 100005; const int MOD = 1000000007; int N, M, n, cnt, ans; vector<int> v[MAX_N], w[MAX_N], SCC[MAX_N], a; bool cycle; bool hasCycle[MAX_N], vis[MAX_N]; void DFS1(int x) { vis[x] = 1; for (int i = 0; i < (int)v[x].size(); ++i) { int y = v[x][i]; if (vis[y] == 0) DFS1(y); } a.push_back(x); } void DFS2(int x) { vis[x] = 1; SCC[n].push_back(x); for (int i = 0; i < (int)w[x].size(); ++i) { int y = w[x][i]; if (vis[y] == 0) DFS2(y); } } void DFS(int x) { ++cnt; vis[x] = 1; if (hasCycle[x]) cycle = 1; for (int i = 0; i < (int)v[x].size(); ++i) { int y = v[x][i]; if (vis[y] == 0) DFS(y); } for (int i = 0; i < (int)w[x].size(); ++i) { int y = w[x][i]; if (vis[y] == 0) DFS(y); } } int main() { cin >> N >> M; for (int i = 1; i <= M; ++i) { int x, y; cin >> x >> y; v[x].push_back(y); w[y].push_back(x); } for (int i = 1; i <= N; ++i) if (!vis[i]) DFS1(i); memset(vis, 0, sizeof(vis)); for (int i = a.size() - 1; i >= 0; --i) if (!vis[a[i]]) { ++n; DFS2(a[i]); } for (int i = 1; i <= n; ++i) if (SCC[i].size() > 1) for (int j = 0; j < (int)SCC[i].size(); ++j) hasCycle[SCC[i][j]] = 1; memset(vis, 0, sizeof(vis)); for (int i = 1; i <= N; ++i) { if (vis[i]) continue; cnt = 0; cycle = 0; DFS(i); if (cycle) ans += cnt; else ans += cnt - 1; } cout << ans; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.