func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; bool iss(int d) { for (int i = 2; i * i <= d; ++i) if (d % i == 0) return false; return true; } int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); vector<int> simple; for (int i = 2; i < 100; ++i) if (iss(i)) simple.push_back(i); vector<vector<int> > d(101); for (int i = 1; i <= 100; ++i) { d[i].resize(simple.size()); for (int j = 0, tmp = i; j < simple.size(); ++j) while (tmp % simple[j] == 0) { tmp /= simple[j]; d[i][j]++; } } int ans = 0; int mod = 1 << 30; for (int i = 1; i <= a; ++i) for (int j = 1; j <= b; ++j) for (int k = 1; k <= c; ++k) { int prod = 1; for (int l = 0; l < simple.size(); ++l) prod *= d[i][l] + d[j][l] + d[k][l] + 1; ans = (ans + prod) % mod; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[60][30]; long long id[1 << 20]; int num[1 << 20]; double f[1 << 20]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { scanf( %s , &s[i]); } int m = strlen(s[1]); for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int mask = 0; for (int k = 0; k < m; k++) { mask |= s[i][k] == s[j][k] ? (1ll << k) : 0; } id[mask] |= (1ll << i) | (1ll << j); } } for (int mask = (1 << m) - 1; mask >= 0; mask--) { for (int i = 0; i < m; i++) { if ((mask >> i) & 1) { id[mask ^ (1 << i)] |= id[mask]; } } } for (int i = 0; i <= (1 << m) - 1; i++) { long long tmp = id[i]; int ans = 0; while (tmp) { ans += tmp & 1; tmp >>= 1; } num[i] = ans; if (num[i] == 1) num[i] = 0; } f[(1 << m) - 1] = 0; for (int s = (1 << m) - 2; s >= 0; s--) { if (!num[s]) { f[s] = 0; continue; } int tot = 0; for (int i = 0; i < m; i++) if (!(s & (1 << i))) tot++; for (int i = 0; i < m; i++) { if (((1 << i) & s)) continue; f[s] += (1.0 * f[s | (1 << i)] / (double)tot * (double)num[s | (1 << i)] / (double)num[s]); } f[s] += 1.0; } printf( %.10lf , f[0]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int l, r, res = 0; cin >> l >> r; vector<unsigned long long> two, three, temp; for (int i = 0; i < 31; ++i) { two.push_back(1LL << i); if (i > 19) continue; three.push_back(pow(3LL, i)); } for (int i = 0; i < two.size(); ++i) { for (int j = 0; j < three.size(); ++j) { if (two[i] * three[j] <= 2000000000LL) temp.push_back(two[i] * three[j]); } } sort(temp.begin(), temp.end()); res = upper_bound(temp.begin(), temp.end(), r) - lower_bound(temp.begin(), temp.end(), l); cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; } return i; } template <typename T, typename U> std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) { o << p.first << << p.second; return o; } template <typename T> std::ostream& operator<<(std::ostream& o, const vector<T>& t) { if (t.empty()) o << n ; for (size_t i = 0; i < t.size(); ++i) { o << t[i] << n [i == t.size() - 1]; } return o; } template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T, vector<T>, less<T>>; template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; } unsigned int logceil(long long first) { return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0; } namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.first) ^ (u(p.second) << 7); } }; } // namespace std template <typename T, typename F> T bsh(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { l = m + 1; r = m; } else { h = m - 1; } } return r; } template <typename F> double bshd(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { l = m; } else { h = m; } } return (l + h) / 2; } template <typename T, typename F> T bsl(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { h = m - 1; r = m; } else { l = m + 1; } } return r; } template <typename F> double bsld(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { h = m; } else { l = m; } } return (l + h) / 2; } template <typename T> T gcd(T a, T b) { if (a < b) swap(a, b); return b ? gcd(b, a % b) : a; } template <typename T> class vector2 : public vector<vector<T>> { public: vector2() {} vector2(size_t a, size_t b, T t = T()) : vector<vector<T>>(a, vector<T>(b, t)) {} }; template <typename T> class vector3 : public vector<vector2<T>> { public: vector3() {} vector3(size_t a, size_t b, size_t c, T t = T()) : vector<vector2<T>>(a, vector2<T>(b, c, t)) {} }; template <typename T> class vector4 : public vector<vector3<T>> { public: vector4() {} vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {} }; template <typename T> class vector5 : public vector<vector4<T>> { public: vector5() {} vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {} }; class ENeatness { public: int N, A, B, X, Y; string Sol; vector<vector<bool>> L, V; vector<int> LOX, HIX, LOY, HIY; constexpr char op(char c) { switch (c) { case L : return R ; case R : return L ; case D : return U ; case U : return D ; case 1 : return 2 ; case 2 : return 1 ; default: return x ; } } void goUp() { if (A == 0) return; while (B > 0 && L[A][B - 1]) { add( L ); --B; } while (B < N - 1 && !L[A - 1][B] && L[A][B + 1]) { add( R ); ++B; } if (L[A - 1][B]) { --A; add( U ); goUp(); } } void goDown() { if (A == N - 1) return; while (B > 0 && L[A][B - 1]) { add( L ); --B; } while (B < N - 1 && !L[A + 1][B] && L[A][B + 1]) { add( R ); ++B; } if (L[A + 1][B]) { ++A; add( D ); goDown(); } } void turnOffAndDown() { if (A == X) return; int b = -1; for (int i = 0; i < N; ++i) { if (L[A][i] && L[A + 1][i]) { b = i; } } while (B > 0 && L[A][B - 1]) { add( L ); --B; } while (B < N - 1 && L[A][B + 1]) { if (B != b) { add( 2 ); L[A][B] = false; } add( R ); ++B; } if (B != b) { add( 2 ); L[A][B] = false; } while (B != b) { add( L ); --B; } add( 2 ); L[A][B] = false; add( D ); ++A; turnOffAndDown(); } void turnOffAndUp() { int b = Y; if (A != X) { for (int i = 0; i < N; ++i) { if (L[A][i] && L[A - 1][i]) { b = i; } } } while (B > 0 && L[A][B - 1]) { add( L ); --B; } while (B < N - 1 && L[A][B + 1]) { if (B != b) { add( 2 ); L[A][B] = false; } add( R ); ++B; } if (B != b) { add( 2 ); L[A][B] = false; } while (B != b) { add( L ); --B; } add( 2 ); L[A][B] = false; if (A == X) return; add( U ); --A; turnOffAndUp(); } void add(char c) { if (!Sol.empty() && Sol.back() == op(c)) Sol.pop_back(); else Sol.push_back(c); } void bfs(int i, int j) { if (V[i][j]) return; V[i][j] = true; if (!L[i][j]) { add( 1 ); L[i][j] = true; LOX[i] = min(LOX[i], j); HIX[i] = max(HIX[i], j); LOY[j] = min(LOY[j], i); HIY[j] = max(HIY[j], i); } if (LOX[i] < j) { add( L ); bfs(i, j - 1); add( R ); } if (HIX[i] > j) { add( R ); bfs(i, j + 1); add( L ); } if (LOY[j] < i) { add( U ); bfs(i - 1, j); add( D ); } if (HIY[j] > i) { add( D ); bfs(i + 1, j); add( U ); } } void solve(istream& cin, ostream& cout) { cin >> N >> A >> B; L = vector2<bool>(N, N); V = vector2<bool>(N, N, false); for (auto& l : L) { for (int i = 0; i < N; ++i) { bool c; cin >> c; l[i] = c; } } LOX.assign(N, N); LOY.assign(N, N); HIX.assign(N, -1); HIY.assign(N, -1); for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { if (L[i][j]) { LOX[i] = min(LOX[i], j); HIX[i] = max(HIX[i], j); LOY[j] = min(LOY[j], i); HIY[j] = max(HIY[j], i); } } } --A; --B; X = A; Y = B; bfs(A, B); goUp(); turnOffAndDown(); goDown(); turnOffAndUp(); for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { if (L[i][j]) { cout << NO n ; return; } } } cout << YES n << Sol << n ; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ENeatness solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; int T, arr[100005], a, b, ans; int cal(int v) { int vv = v * (v - 1); return (vv >> 1); } int main() { cin >> T; for (int i = 1; i < T; i++) { cin >> a >> b; arr[a]++; arr[b]++; } for (int i = 1; i <= T; i++) { if (arr[i] >= 2) ans += cal(arr[i]); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; struct node { int x, y; } a[maxn]; int ans[maxn]; int f[maxn]; bool cmp(int c, int d) { return c < d; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &f[i]); } stack<int> s; node ff; ff.x = 0; ff.y = 0; s.push(0); a[0].y = 0; a[0].x = 0; for (int i = 1; i <= m; i++) { scanf( %d%d , &a[i].x, &a[i].y); } for (int i = m; i >= 1; i--) { if (a[i].y > a[s.top()].y) { s.push(i); } } int flag = n; int kk = 0; int gg = a[s.top()].y; for (int i = gg + 1; i <= n; i++) ans[i] = f[i]; sort(f + 1, f + 1 + gg); int l = 1; int r = gg; int per = s.top(); s.pop(); while (!s.empty()) { int now = s.top(); s.pop(); if (a[per].x == 1) { for (int i = a[per].y; i > a[now].y; i--) ans[i] = f[r--]; } else { for (int i = a[per].y; i > a[now].y; i--) { ans[i] = f[l++]; } } per = now; } for (int i = 1; i < n; i++) { printf( %d , ans[i]); } printf( %d n , ans[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000000; long long powmod(long long a, long long b) { long long res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } const int N = 201000; struct node { long long fib[4]; int fg; } nd[N * 4]; int fib[N], a[N]; int n, ty, l, r, v, m; long long ret[2], ans; void build(int p, int l, int r) { if (l == r) { nd[p].fib[0] = fib[l]; nd[p].fib[1] = fib[l + 1]; nd[p].fib[2] = nd[p].fib[0] * a[l] % mod; nd[p].fib[3] = nd[p].fib[1] * a[l] % mod; } else { int md = (l + r) >> 1; build(p + p, l, md); build(p + p + 1, md + 1, r); for (int i = 0; i < 4; i++) nd[p].fib[i] = (nd[p + p].fib[i] + nd[p + p + 1].fib[i]) % mod; } } void setp(int p, int w) { nd[p].fg += w; nd[p].fib[2] = (nd[p].fib[2] + nd[p].fib[0] * w) % mod; nd[p].fib[3] = (nd[p].fib[3] + nd[p].fib[1] * w) % mod; } void push(int p) { if (nd[p].fg) { setp(p + p, nd[p].fg); setp(p + p + 1, nd[p].fg); nd[p].fg = 0; } } void modify(int p, int l, int r, int x, long long w) { if (l == r) { nd[p].fib[2] = fib[l] * w % mod; nd[p].fib[3] = fib[l + 1] * w % mod; } else { push(p); int md = (l + r) >> 1; if (x <= md) modify(p + p, l, md, x, w); else modify(p + p + 1, md + 1, r, x, w); for (int i = 2; i < 4; i++) nd[p].fib[i] = (nd[p + p].fib[i] + nd[p + p + 1].fib[i]) % mod; } } void add(int p, int l, int r, int tl, int tr, int w) { if (l == tl && r == tr) setp(p, w); else { push(p); int md = (l + r) >> 1; if (tr <= md) add(p + p, l, md, tl, tr, w); else if (tl > md) add(p + p + 1, md + 1, r, tl, tr, w); else add(p + p, l, md, tl, md, w), add(p + p + 1, md + 1, r, md + 1, tr, w); for (int i = 2; i < 4; i++) nd[p].fib[i] = (nd[p + p].fib[i] + nd[p + p + 1].fib[i]) % mod; } } void query(int p, int l, int r, int tl, int tr) { if (l == tl && r == tr) { for (int i = 2; i < 4; i++) ret[i - 2] = (ret[i - 2] + nd[p].fib[i]) % mod; } else { push(p); int md = (l + r) >> 1; if (tr <= md) query(p + p, l, md, tl, tr); else if (tl > md) query(p + p + 1, md + 1, r, tl, tr); else query(p + p, l, md, tl, md), query(p + p + 1, md + 1, r, md + 1, tr); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i < n + 1; i++) scanf( %d , a + i); fib[0] = fib[1] = 1; for (int i = 2; i < n + 10; i++) fib[i] = (fib[i - 1] + fib[i - 2]) % mod; build(1, 1, n); for (int i = 0; i < m; i++) { scanf( %d , &ty); if (ty == 1) { scanf( %d%d , &l, &v); modify(1, 1, n, l, v); } else if (ty == 2) { scanf( %d%d , &l, &r); ret[0] = ret[1] = 0; query(1, 1, n, l, r); ans = (fib[l] * ret[0] - fib[l - 1] * ret[1]) % mod; if (l % 2 == 1) ans *= -1; if (ans < 0) ans += mod; printf( %I64d n , ans); } else { scanf( %d%d%d , &l, &r, &v); add(1, 1, n, l, r, v); } } } |
#include <bits/stdc++.h> #pragma warning(disable : 4786) using namespace std; int a[200000]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } a[n + 1] = a[1]; int y = 0; for (int i = 2; i <= n + 1; i++) { if (a[i] < a[i - 1]) { if (y != 0) { printf( -1 n ); return 0; } else { y = i; } } } if (y == 0) y = n + 1; printf( %d , n - y + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 11111; pair<int, int> a[maxN]; short dp[maxN][maxN]; int s[maxN]; bool mycmp(pair<int, int> a, pair<int, int> b) { if (a.second != b.second) return (a.second < b.second); return (a.first > b.first); } int main() { ios_base::sync_with_stdio(false); int n, l, r; cin >> n >> l >> r; for (int i = 1; i <= n; ++i) { cin >> a[i].first; } for (int i = 1; i <= n; ++i) { cin >> a[i].second; } sort(a + 1, a + n + 1, mycmp); int sum = 0; for (int i = 1; i <= n; ++i) { sum += a[i].first; } s[0] = 0; for (int i = 1; i <= n; ++i) { s[i] = s[i - 1] + a[i].first; } for (int i = 0; i <= n; ++i) { for (int j = 0; j <= sum; ++j) { dp[i][j] = -1; } } dp[0][0] = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j <= s[i]; ++j) { if (dp[i][j] < 0) continue; int type = a[i + 1].second, w = a[i + 1].first; if (type == 0) { dp[i + 1][j + w] = max(dp[i + 1][j + w], dp[i][j]); dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]); } else { int x = j, y = sum - (s[i] - j); short f1 = (x >= l && x <= r); if (dp[i][j] + f1 > dp[i + 1][j + w]) { dp[i + 1][j + w] = dp[i][j] + f1; } short f2 = (y - a[i + 1].first >= l && y - a[i + 1].first <= r); if (dp[i][j] + f2 > dp[i + 1][j]) { dp[i + 1][j] = dp[i][j] + f2; } } } } short ans = -1; for (int i = 0; i <= sum; ++i) { ans = max(ans, dp[n][i]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, pair<int, int> > a[200020]; int f[200020]; int v[200020]; int n, m; int F(int x) { if (f[x] == x) { return x; } f[x] = F(f[x]); v[f[x]] |= v[x]; return f[x]; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { f[i] = i; v[i] = 0; } for (int i = 0; i < m; i++) { scanf( %d%d%d , &a[i].second.first, &a[i].second.second, &a[i].first); } sort(a, a + m); reverse(a, a + m); long long ans = 0; for (int i = 0; i < m; i++) { int x = a[i].second.first; int y = a[i].second.second; x = F(x); y = F(y); if (x == y && v[x] == 0) { v[x] = 1; ans += a[i].first; } else if (x != y && (v[x] == 0 || v[y] == 0)) { v[y] |= v[x]; f[x] = y; ans += a[i].first; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g1[30000 + 100], g2[30000 + 100]; set<int> st; int Next[30000 + 100], Prev[30000 + 100]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m, start; cin >> n >> m; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; g1[u].push_back(v); g2[v].push_back(u); } for (int i = 1; i <= n; i++) { sort(g1[i].begin(), g1[i].end()); sort(g2[i].begin(), g2[i].end()); } start = 0; st.insert(0); st.insert(1); Next[start] = 1; Prev[1] = 0; for (int i = 2; i <= n; i++) { vector<int> d; bool flag = false; for (auto it : g1[i]) { if (it > i) continue; int t1 = Next[it]; if (!binary_search(g1[i].begin(), g1[i].end(), t1)) { flag = true; Next[it] = i; Prev[t1] = i; Next[i] = t1; Prev[i] = it; break; } else { st.erase(it); d.push_back(it); } } if (!flag) { for (auto it : g2[i]) { if (it > i) continue; int t1 = Prev[it]; if (!binary_search(g1[t1].begin(), g1[t1].end(), i)) { flag = true; Next[t1] = i; Prev[it] = i; Next[i] = it; Prev[i] = t1; break; } else { st.erase(t1); d.push_back(t1); } } } if (!flag) { auto it = st.begin(); int t1 = Next[*it]; Next[*it] = i; Prev[t1] = i; Next[i] = t1; Prev[i] = *it; } for (auto it : d) { st.insert(it); } st.insert(i); } int now = Next[0]; while (now) { cout << now << ; now = Next[now]; } } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 7; int n; string s; vector<int> p; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> s; n = (int)s.size(); for (int i = 0; i < n; i++) { if (s[i] != s[(i + 1) % n]) { p.push_back(i); } } int ant = -1; int yes = 0; int no = 0; for (int i = 1; i < (int)p.size(); i++) { if (ant == -1 || p[i] != ant + 1) { ant = p[i]; yes++; } } if (p.back() == n - 1 && p[0] == 0) { p.pop_back(); } ant = -1; for (int i = 0; i < (int)p.size(); i++) { if (ant == -1 || p[i] != ant + 1) { ant = p[i]; no++; } } cout << max(yes, no) << n ; } |
#include <bits/stdc++.h> using namespace std; int n; bool isp(int a) { for (int i = 2; i * i <= a; i++) if (a % i == 0) return false; return true; } int power[100001]; long long pow(long long a, long long b, long long MOD = n) { long long ret = 1, c = a; while (b) { if (b & 1) ret = (ret * c) % MOD; b >>= 1; c = (c * c) % MOD; } return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; if (n < 4) { cout << YES n ; for (int i = 1; i <= n; i++) cout << i << ; } else if (n == 4) cout << YES n1 3 2 4 << n ; else if (isp(n) == false) cout << NO << n ; else { cout << YES << n ; int g; for (g = 2; g < n; g++) { int i, j = 1; for (i = 1;; i++) { j = (g * j) % n; if (j == 1) break; } if (i == n - 1) break; } power[0] = 1; for (int i = 1; i < n; i++) power[i] = (power[i - 1] * 1ll * g) % n; for (int i = 0; i < n - 1; i++) cout << power[i % 2 ? i : n - i - 1] << n ; cout << n << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 17; const int MX = (int)1e6 + 17; const int MOD = (int)1e9 + 7; const long long oo = LLONG_MAX; const int INF = INT_MAX; const long double Pi = 3.14159265358979323846264338327950288419716939937510; const int di[4] = {-1, 0, 1, 0}; const int dj[4] = {0, 1, 0, -1}; inline long long IN() { long long x = 0, ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * f; } inline void OUT(long long x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) OUT(x / 10), putchar(x % 10 + 0 ); else putchar(x + 0 ); } void IOI2017() { freopen( partition .in , r , stdin); freopen( partition .out , w , stdout); } int n, cur = 4; struct Week { int w[10]; }; Week a[2 * N]; int Year(int x) { if (x % 400 == 0 || x % 4 == 0 && x % 100) return 366; return 365; } bool check(Week a, Week b) { for (int i = 1; i <= 7; i++) { if (a.w[i] != b.w[i]) return 0; } return 1; } int main() { for (int i = 1000; i <= N * 2; i++) { for (int j = 1; j <= Year(i); j++) { a[i].w[cur]++; cur++; if (cur == 8) cur = 1; } } ios_base::sync_with_stdio(0); cin >> n; for (int j = n + 1;; j++) { if (check(a[n], a[j])) { cout << j; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INFL = 1LL << 60; const int INF = 1 << 30; const long long MOD = 998244353; double EPS = 1e-10; vector<long long> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0}; vector<long long> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0}; void pres(double A) { printf( %.12lf n , A); } void BinarySay(long long x, long long y = 60) { for (int i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1); cout << endl; } long long cnt_bit(long long x) { return __builtin_popcountll(x); } long long pow_long(long long x, long long k) { long long res = 1; while (k > 0) { if (k % 2) res *= x; x *= x; k /= 2; } return res; } long long pow_mod(long long x, long long k) { x %= MOD; long long res = 1; while (k > 0) { if (k % 2) { res *= x; res %= MOD; } x *= x; x %= MOD; k /= 2; } return res; } long long inverse(long long x) { return pow_mod(x, MOD - 2); }; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long x, long long y) { long long res = x / gcd(x, y); res *= y; return res; }; const int MAXcomb = 200010; long long fac[MAXcomb], finv[MAXcomb], inv[MAXcomb]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAXcomb; i++) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } long long comb(int n, int k) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * finv[k] % MOD * finv[n - k] % MOD; } const int MAXkai = 200010; long long kai_memo[MAXkai]; long long kai(long long N) { if (kai_memo[N] != 0) return kai_memo[N]; if (N <= 1) return 1; return kai_memo[N] = N * kai(N - 1) % MOD; } long long disit(long long second, long long base = 10) { long long res = 0; while (second) { res++; second /= base; } return res; } vector<long long> divisor(long long n) { vector<long long> res(0); for (long long i = 1; i * i <= n; i++) { if (n % i == 0) { res.push_back(i); if (i != n / i) res.push_back(n / i); } } sort(res.begin(), res.end()); return res; } void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < (n); i++) cin >> a[i]; sort(a.begin(), a.end()); long long sum = 0; for (int i = 0; i < (n); i++) sum += a[i]; int m; cin >> m; for (int i = 0; i < (m); i++) { int q; cin >> q; cout << sum - a[n - q] << endl; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); solve(); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 305; struct sss { int a, b, c; bool operator<(const sss& a) const { return c < a.c; } }; vector<sss> v[MAXN * MAXN]; int cost(int a, int b, int c, int d) { return abs(a - c) + abs(b - d); } int main() { int m, n, i, j, k, p; cin >> m >> n >> p; for (i = 1; i <= m; i++) { for (j = 1; j <= n; j++) { int num; cin >> num; v[num].push_back({i, j, 999999999}); } } i = 1; for (j = 0; j < v[i].size(); j++) { v[i][j].c = cost(v[i][j].a, v[i][j].b, 1, 1); } for (i = 2; i <= p; i++) { sort((v[i - 1]).begin(), (v[i - 1]).end()); for (j = 0; j < v[i].size(); j++) { for (k = 0; k < min((int)v[i - 1].size(), m + n + 2); k++) { v[i][j].c = min(v[i][j].c, v[i - 1][k].c + cost(v[i - 1][k].a, v[i - 1][k].b, v[i][j].a, v[i][j].b)); } } } int ans = 999999999; i = p; for (j = 0; j < v[i].size(); j++) ans = min(ans, v[i][j].c); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 11; int s[N]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &s[i]); sort(s + 1, s + 1 + n); for (int i = 1, j = 1; i <= n; i++) { if (s[i] % s[j] != 0) { printf( %d , -1); return 0; } } printf( %d n , s[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2, typename T3> struct pair3 { T1 first; T2 second; T3 third; }; template <typename T1, typename T2, typename T3, typename T4> struct pair4 { T1 first; T2 second; T3 third; T4 fourth; }; const long long MOD = 1000000007; const long double PI = acos(-1.0); int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, m; cin >> n; vector<long long> ar(n); for (long long i = 0; i < n; ++i) { cin >> ar[i]; } vector<vector<long long>> ans(n + 1); for (long long len = 1; len <= n; ++len) { vector<long long> temp; long long mx = -1, mn = INT_MAX; multiset<long long> st; auto del = [&](long long val) { auto it = temp.end(); --it; while (1) { if (*it == val) { temp.erase(it); break; } it -= 1; } }; for (long long start = 0; start < n; ++start) { if (temp.size() < len) { temp.push_back(ar[start]); st.insert(ar[start]); } else { if (ar[start] > *st.begin()) { del(*st.begin()); st.erase(st.begin()); st.insert(ar[start]); temp.push_back(ar[start]); } } ans[len] = temp; } } cin >> m; long long l, idx; while (m--) { cin >> l >> idx; cout << ans[l][idx - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; char s[1008][1008], last[1008][1008]; int a[58][58]; int flag[58], x[58], y[58]; int ans, tot; bool in[8][8]; struct Tprogram { void open() { freopen( 1.in , r , stdin); freopen( 1.out , w , stdout); } void close() {} void init() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , &s[i][1]); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (s[i][j] != . && !a[i][j]) a[i][j] = a[i + 1][j] = a[i][j + 1] = a[i + 1][j + 1] = ++tot; if (s[i][j] != . ) { int t = s[i][j]; t = t <= B ? t - 64 : t - 94; if (!x[t]) x[t] = a[i][j]; else y[t] = a[i][j]; } } } void dfs(int c, int d) { if (d > 14) { memset(in, 0, sizeof(in)); for (int i = 1; i <= 28; i++) if (!in[flag[x[i]]][flag[y[i]]]) in[flag[x[i]]][flag[y[i]]] = in[flag[y[i]]][flag[x[i]]] = 1; else return; ++ans; if (ans == 1) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (a[i][j]) last[i][j] = flag[a[i][j]] - 1 + 0 ; else last[i][j] = . ; } } return; } if (flag[d]) dfs(c, d + 1); else { flag[d] = c; for (int i = d + 1; i <= 14; i++) if (!flag[i]) { flag[i] = c; dfs(c + 1, d + 1); flag[i] = 0; } flag[d] = 0; } } void work() { dfs(1, 1); printf( %d n , ans * 5040); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) printf( %c , last[i][j]); printf( n ); } } } Program; int main() { Program.init(); Program.work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a; cin >> a; double x, y, s = 0; for (int i = 0; i < a; i++) { cin >> x >> y; s += y; } s /= a; printf( %.3lf n , s + 5); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { int sum, limit; cin >> sum >> limit; vector<pair<int, int>> v; for (int i = 1; i <= limit; i++) { v.push_back({1 << __builtin_ctz(i), i}); } sort(v.rbegin(), v.rend()); vector<int> a; int i = 0; while (sum) { if (i == v.size()) break; if (sum >= v[i].first) { a.push_back(v[i].second); sum -= v[i].first; } i++; } if (sum != 0) cout << -1 n ; else { cout << a.size() << n ; for (auto i : a) { cout << i << ; } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int GEN_SIZE = 6; vector<int> v, adj[50005]; int match[50005], match2[50005], vis[50005], ans[50005]; int V, Vleft; int conv(vector<int> v, int s) { int ans = 0; for (int i = 0; i < v.size(); i++) { ans *= s; ans += v[i]; } return ans; } vector<int> unconv(int p, int s) { vector<int> v1; for (int i = 0; i < s; i++) { v1.push_back(p % s); p /= s; } reverse(v1.begin(), v1.end()); return v1; } void recur(int x) { if (x == GEN_SIZE) { int rval = conv(v, GEN_SIZE); for (int rem = 0; rem < GEN_SIZE; rem++) { vector<int> tmp_v; tmp_v.push_back(rem); for (int i = 0; i < GEN_SIZE; i++) if (rem != i) tmp_v.push_back(v[i]); int lval = conv(tmp_v, GEN_SIZE); adj[rval].push_back(lval); } return; } for (int i = 0; i < GEN_SIZE; i++) { v.push_back(i); recur(x + 1); v.pop_back(); } } int aug(int v) { if (vis[v]) return 0; vis[v] = 1; for (int j = 0; j < (int)adj[v].size(); j++) { int r = adj[v][j]; if (match[r] == -1) { match[r] = v; return 1; } } for (int j = 0; j < (int)adj[v].size(); j++) { int r = adj[v][j]; if (aug(match[r])) { match[r] = v; return 1; } } return 0; } int T; vector<pair<pair<int, int>, int> > q; int main() { scanf( %d , &T); for (int i = 0; i < T; i++) { int N, R; scanf( %d%d , &N, &R); vector<int> v1; v1.push_back(R - 1); for (int j = 0; j < N - 1; j++) { int x; scanf( %d , &x); v1.push_back(x - 1); } int val = conv(v1, N); q.push_back(make_pair(make_pair(N, val), i)); } sort(q.begin(), q.end()); int curN = 0; for (int i = 0; i < q.size(); i++) { if (curN != q[i].first.first) { curN = q[i].first.first; GEN_SIZE = curN; memset(match, -1, sizeof(match)); int v = 1; for (int i = 0; i < GEN_SIZE; i++) { v *= GEN_SIZE; } for (int i = 0; i < v; i++) adj[i].clear(); recur(0); for (int i = 0; i < v; i++) { memset(vis, 0, sizeof(vis)); aug(i); } for (int i = 0; i < v; i++) match2[match[i]] = i; } vector<int> qv = unconv(q[i].first.second, curN); vector<int> v1 = unconv(match[q[i].first.second], curN); ans[q[i].second] = v1[qv[0]] + 1; } for (int i = 0; i < T; i++) printf( %d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; int a[1000][1000]; int w, h; int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } int main() { scanf( %d%d , &h, &w); for (int y = 0; y < h; y++) for (int x = 0; x < w; x++) scanf( %d , &a[y][x]); int ans = -1; for (int y1 = 0; y1 < h; y1++) for (int y2 = y1 + 1; y2 < h; y2++) { int m1 = -1, m2 = -1; for (int x = 0; x < w; x++) { const int v = fastMin(a[y1][x], a[y2][x]); if (m1 < v) { m2 = m1; m1 = v; } else if (m2 < v) { m2 = v; } } ans = fastMax(ans, m2); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, inp; cin >> n; for (int i = 0; i < n; i++) { cin >> inp; sum += inp; } cout << (float)sum / (float)n; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, d, ff = 1, bb = 1; long long mx; pair<long long, long long> f[100005]; int main() { scanf( %d%d , &n, &d); for (int i = 1; i <= n; i++) scanf( %d%d , &f[i].first, &f[i].second); sort(f + 1, f + n + 1); for (int i = 2; i <= n; i++) f[i].second += f[i - 1].second; while (true) { while (f[bb].first - f[ff].first < d && bb != n + 1) bb++; mx = max(mx, f[bb - 1].second - f[ff - 1].second); ff++; if (ff == n + 1) break; } printf( %I64d , mx); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b, sum = 0; cin >> n >> m; for (int i = 0; i < n * m; i++) { cin >> a >> b; if (a == 1 || b == 1) sum++; } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; const int SS = 4 * N; long long n, q, k, a, b; long long seg[SS][2]; void modif(int ind, int val, int s = 0, int e = n, int v = 1) { if (ind < s || ind >= e) return; if (e - s == 1) { seg[v][0] += val, seg[v][0] = min(seg[v][0], a); seg[v][1] += val, seg[v][1] = min(seg[v][1], b); return; } int mid = (s + e) / 2; modif(ind, val, s, mid, 2 * v); modif(ind, val, mid, e, 2 * v + 1); for (int i = 0; i < 2; i++) seg[v][i] = seg[2 * v][i] + seg[2 * v + 1][i]; } long long get(int l, int r, int ind, int s = 0, int e = n, int v = 1) { if (l >= e || r <= s) return 0; if (l <= s && e <= r) return seg[v][ind]; int mid = (s + e) / 2; long long res = 0; res += get(l, r, ind, s, mid, 2 * v); res += get(l, r, ind, mid, e, 2 * v + 1); return res; } int main() { ios::sync_with_stdio(false); cin >> n >> k >> a >> b >> q; while (q--) { int t; cin >> t; if (t == 1) { int d, x; cin >> d >> x; d--; modif(d, x); } else { int d; cin >> d; d--; cout << get(0, d, 1) + get(d + k, n, 0) << n ; } } return 0; } |
#include<bits/stdc++.h> using namespace std; #define ll long long #define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), , , ); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); } void err(istream_iterator<string> it) {} template<typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } int main() { ll t; cin>>t; while(t--) { ll i,j,n,m,x; cin>>n>>m>>x; ll c=((x-1)/n)+1; ll r=x-(c-1)*n; ll ans=(r-1)*m+c; cout<<ans<<endl; } } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; const int maxN = 1.1e4; vector<int> g[maxN]; map<string, int> m[maxN]; int len = 1; void add(int v, string s) { if (m[v][s] == 0) { m[v][s] = len; g[v].push_back(len); len++; } } void parse(string s) { s = s + ; string cur; int v = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == && cur.size()) { add(v, cur); v = m[v][cur]; cur = ; } else { cur.push_back(s[i]); } } cout << endl; } int mx[2]; pair<int, int> dfs(int v, int d) { pair<int, int> ans = {0, g[v].size() == 0}; for (auto u : g[v]) { pair<int, int> p = dfs(u, d + 1); ans.first += p.first; ans.second += p.second; } if (d >= 2) { mx[0] = max(mx[0], ans.first); mx[1] = max(mx[1], ans.second); } if (g[v].size()) ans.first++; return ans; } int main() { string s; while (cin >> s) { parse(s); } dfs(0, 0); cout << mx[0] << << mx[1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; #define pb push_back #define f first #define s second #define ll long long ll MOD = 1000000007; int main(){ ll t; cin>>t; while(t--){ ll n; cin>>n; int c =1; if(n==1)cout<<1<<endl; if(n==2)cout<<-1<<endl; if(n>=3){ for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cout<<c<< ; c+=2; if(c>n*n)c=2; } cout<<endl; } } } } |
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > A; int F(int i, int j) { return (A[i].first - A[j].first) * (A[i].first - A[j].first) + (A[i].second - A[j].second) * (A[i].second - A[j].second); } bool F1(vector<int> I) { for (int(i) = (0); (i) < (4); ++(i)) for (int(j) = (0); (j) < (i); ++(j)) { int d = F(I[i], I[j]); vector<int> t; for (int(k) = (0); (k) < (4); ++(k)) if (k != i && k != j) t.push_back(k); int dd = F(I[t[0]], I[t[1]]); if (d != dd) continue; vector<int> v; vector<int> q; v.push_back(F(I[i], I[t[0]])); q.push_back(F(I[t[0]], I[j])); v.push_back(F(I[j], I[t[1]])); q.push_back(F(I[t[1]], I[i])); if (q[0] == q[1] && v[0] == v[1]) return true; } return false; } bool F2(vector<int> I) { for (int(i) = (0); (i) < (4); ++(i)) for (int(j) = (0); (j) < (i); ++(j)) { int d = F(I[i], I[j]); vector<int> t; for (int(k) = (0); (k) < (4); ++(k)) if (k != i && k != j) t.push_back(k); int dd = F(I[t[0]], I[t[1]]); if (d != dd) continue; vector<int> v; v.push_back(F(I[i], I[t[0]])); v.push_back(F(I[t[0]], I[j])); v.push_back(F(I[j], I[t[1]])); v.push_back(F(I[t[1]], I[i])); bool ok = true; for (int(k) = (1); (k) < (4); ++(k)) if (v[k] != v[k - 1]) ok = false; if (ok) return true; } return false; } int main() { for (int(i) = (0); (i) < (8); ++(i)) { int x, y; cin >> x >> y; A.push_back(make_pair(x, y)); } int res = -1; for (int(i) = (0); (i) < ((1 << 8)); ++(i)) { vector<int> I; vector<int> J; for (int(j) = (0); (j) < (8); ++(j)) if ((i & (1 << j)) != 0) I.push_back(j); else J.push_back(j); if (I.size() != 4) continue; if (F1(I) && F2(J)) res = i; } if (res == -1) cout << NO << endl; else { cout << YES << endl; for (int(i) = (0); (i) < (8); ++(i)) if ((res & (1 << i)) == 0) cout << i + 1 << ; cout << endl; for (int(i) = (0); (i) < (8); ++(i)) if ((res & (1 << i)) != 0) cout << i + 1 << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n, a[N] = {}, tot = 0; bool v[N] = {}; void dfs(int s) { v[s] = true; if (!v[s * 2 % n]) dfs(s * 2 % n); if (!v[s * 2 % n + 1]) dfs(s * 2 % n + 1); a[++tot] = s; } int main() { cin >> n; if (n % 2) puts( -1 ); else { dfs(0); for (int i = tot; i >= 0; --i) printf( %d%c , a[i], n [i == 0]); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void chkmin(T &x, T y) { if (y < x) x = y; } template <class T> void chkmax(T &x, T y) { if (y > x) x = y; } const int N = 105; int a[N], n, x, ans1, ans2[N][N], len; int main() { scanf( %d , &n); for (int i = 1; i <= (n); i++) scanf( %d , a + i); for (int i = 1; i <= (n - (n & 1)); i++) { for (int j = 1; j <= (n); j++) if (a[j] == i) { x = j; break; } ans1++; len = 0; for (int j = 1; j <= (i - 1); j++) ans2[ans1][++len] = 1; ans2[ans1][++len] = x - i + 1; reverse(a + i, a + x + 1); if (x < n) { ans2[ans1][++len] = n - x; reverse(a + x + 1, a + n + 1); } if (i % 2 == 0) reverse(ans2[ans1] + 1, ans2[ans1] + len + 1); if (len == 1) ans1--; ans2[ans1][0] = len; } printf( %d n , ans1); for (int i = 1; i <= (ans1); i++) { printf( %d , ans2[i][0]); for (int j = 1; j <= (ans2[i][0]); j++) printf( %d , ans2[i][j]); putchar( n ); } } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3fffffff; const int maxn = 100000 + 5, maxh = 800; int n, k; int f[maxh], g[maxh]; vector<int> P[maxn]; int main() { scanf( %d%d , &n, &k); for (int i = 1, iend = k; i <= iend; ++i) { int x, y; scanf( %d%d , &x, &y); P[y].push_back(n - x + 1); } for (int i = 1, iend = n; i <= iend; ++i) sort(P[i].begin(), P[i].end()); int hgt = sqrt(6 * k) + 5; memset(f, 0x3f, sizeof f); f[0] = 0; for (int i = 1, iend = n; i <= iend; ++i) { memcpy(g, f, sizeof f); memset(f, 0x3f, sizeof f); int minf = 0, pt = 0; for (int j = 0, jend = hgt; j <= jend; ++j) { if (pt < P[i].size() && P[i][pt] == j) pt++; if (g[j] < g[minf]) minf = j; f[j] = min(g[j + 1], g[minf] + (j ? j * (j + 1) / 2 + 2 : 0)) + (P[i].size() - pt) * 3; } } int ans = inf; for (int i = 0, iend = hgt; i <= iend; ++i) ans = min(ans, f[i]); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[27]; bool h[27]; bool valid[1005][1005]; long long dp[1005]; int main() { for (int i = 0; i < 1005; i++) { for (int j = 0; j < 1005; j++) valid[i][j] = false; } for (int i = 0; i < 26; i++) h[i] = false; int n, lsub = 1; cin >> n; string s; cin >> s; for (int i = 0; i < 26; i++) cin >> a[i]; for (int i = 0; i < n; i++) { int f = 0; for (int j = i; j < n; j++) { h[s[j] - a ] = true; for (int k = 0; k < 26; k++) if (h[k] && a[k] < j - i + 1) { f = 1; break; } if (f == 1) break; valid[i][j] = true; lsub = max(lsub, j - i + 1); } for (int k = 0; k < 26; k++) h[k] = false; } dp[0] = 1; dp[-1] = 1; for (int i = 1; i < n; i++) { dp[i] = dp[i - 1]; for (int j = 0; j < i; j++) { if (valid[j][i]) dp[i] = (dp[i] + dp[j - 1]) % 1000000007; } } int i = 0, j = 0, k = 0; while (i < n) { if (!valid[j][i]) { j = i; k++; } i++; } cout << dp[n - 1] << n ; cout << lsub << n ; cout << k + 1 << n ; } |
#include <bits/stdc++.h> int dp[2][1005]; int main() { char start[2 * 1005], end[1005]; int i, j, k, K; while (scanf( %s %s %d , start, end, &K) != EOF) { memset(dp, 0, sizeof(dp)); int n = strlen(start); for (i = n; i < 2 * n; i++) start[i] = start[i - n]; dp[0][0] = 1; int cur = 1; long long sum[2]; sum[0] = 1, sum[1] = 0; for (k = 0; k < K; k++) { sum[cur] = 0; for (i = 0; i < n; i++) { dp[cur][i] = (sum[cur ^ 1] - dp[cur ^ 1][i] + 1000000007); if (dp[cur][i] >= 1000000007) dp[cur][i] -= 1000000007; sum[cur] = (sum[cur] + dp[cur][i]); if (sum[cur] >= 1000000007) sum[cur] -= 1000000007; } cur ^= 1; } int ans = 0; for (i = 0; i < n; i++) if (strncmp(start + i, end, n) == 0) ans += dp[cur ^ 1][i], ans %= 1000000007; printf( %d n , ans); } } |
#include <bits/stdc++.h> using namespace std; char ans[1010][1010]; int len[1010]; void upd(int n, int c) { ans[n][len[n]++] = c; } char all[1 << 21]; int main() { int n, k, l; scanf( %d%d%d , &n, &l, &k); scanf( %s , all); sort(all, all + strlen(all)); int cur = 0; int beg = 1; while (beg < k) { int beg_ = beg; while (beg <= k) { upd(beg, all[cur]); beg++; cur++; } beg = beg_; for (int i = k; i >= beg_; i--) if (ans[i][len[i] - 1] != ans[k][len[k] - 1]) { beg = i + 1; break; } if (len[k] == l) break; } while (len[k] < l) upd(k, all[cur++]); for (int i = 1; i <= n; i++) { while (len[i] < l) upd(i, all[cur++]); } for (int i = 1; i <= n; i++) puts(ans[i]); } |
#include<bits/stdc++.h> using namespace std; #define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define all(v) v.begin(),v.end() #define rall(v) v.rbegin(),v.rend() #define MEM(a,x) memset(a,x,sizeof(a)) #define pi acos(-1.0) #define ll long long #define pb push_back #define mp make_pair #define pii pair< int,int > #define pll pair< ll,ll > #define vii vector< int > #define vll vector< ll > #define vpi vector< pii > #define MX 200005 #define EPS 1e-12 #define ss second #define ff first int cases=1; #ifdef ppqq #define debug(...) __f(#__VA_ARGS__, __VA_ARGS__) template < typename Arg1 > void __f(const char* name, Arg1&& arg1){ cerr << name << is << arg1 << std::endl; } template < typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names+1, , ); cerr.write(names, comma - names) << is << arg1 << ; __f(comma+1, args...); } #else #define debug(...) #endif ///******************************************START****************************************** struct info { ll u,v; ll w; }; vector<info> graph; ll par[MX],cnt,rnk[MX]; bool cmp(const info&a,const info&b) { if(a.w<b.w) return true; return false; } ll find_set(ll v) { if(v==par[v]) return v; return par[v]=find_set(par[v]); } void mrg(ll a,ll b) { if(rnk[a]<=rnk[b]) { par[a]=b; rnk[b]++; } else { par[b]=a; rnk[a]++; } } ll MST(ll n) { ll sum=0; for(ll i=0;i<graph.size();i++) { ll a=find_set(graph[i].u); ll b=find_set(graph[i].v); if(a!=b) { mrg(a,b); cnt++; sum+=graph[i].w; } if(cnt==n-1) break; } return sum; } bool tree(ll n) { for(ll i=1;i<n;i++) { if(find_set(i)!=find_set(i+1)) return false; } return true; } void CLR(ll n) { graph.clear(); cnt=0; for(ll i=1;i<=n;i++) par[i]=0,rnk[i]=0; } int main() { FIO; int t; cin>>t; while(t--) { ll n,m; ll k,mini=LLONG_MAX; cin>>n>>m>>k; vector<pair<ll,pll>> kom,shb; for(ll i=0;i<m;i++) { ll u,v; ll w; cin>>u>>v>>w; info temp; temp.u=u; temp.v=v; temp.w=w; if(w<=k) graph.pb(temp); shb.pb({w,{u,v}}); } sort(all(shb)); sort(all(graph),cmp); for (ll i = 1; i <= n; i++) par[i] = i; MST(n); if(tree(n)) { ll ans=LLONG_MAX; for(auto it: shb) ans=min(ans,abs(it.ff-k)); cout<<ans<< n ; } else { for (ll i = 1; i <= n; i++) par[i] = i; for(ll i=0;i<graph.size();i++) graph[i].w=0; cnt=0; for(auto it: shb) { if(it.ff>k){ info temp; temp.u=it.ss.ff;temp.v=it.ss.ss; temp.w=it.ff-k; graph.pb(temp); } } sort(all(graph),cmp); cout<<MST(n)<< n ; } CLR(n+2); } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int n, m, chk[100100], a[100100], b[100100]; vector<int> v[100100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 1; i <= m; i++) { int a, b; cin >> a >> b; v[a].push_back(b), v[b].push_back(a); } for (int i = 1; i <= n; i++) if (v[i].size() != n - 1) { chk[i] = 1; for (int x : v[i]) chk[x] = 1; int j = 1, c = 0; while (chk[j]) j++; for (int k = 1; k <= n; k++) if (k != i && k != j) a[k] = b[k] = ++c; a[i] = b[i] = b[j] = ++c; a[j] = ++c; cout << YES n ; for (int i = 1; i <= n; i++) cout << a[i] << ; cout << n ; for (int i = 1; i <= n; i++) cout << b[i] << ; cout << n ; return 0; } cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int main() { string org; cin >> org; int n; cin >> n; map<string, int> mp; for (int i = 0; i < n; i++) { string s, t; cin >> s >> t; string name; string trash; if (t[0] == p || t[0] == c ) { string trash; cin >> trash; cin >> name >> trash; name.pop_back(); name.pop_back(); if (t[0] == p ) { if (s == org) mp[name] += 15; else if (name == org) mp[s] += 15; } else { if (s == org) mp[name] += 10; else if (name == org) mp[s] += 10; } } else { cin >> name >> trash; name.pop_back(); name.pop_back(); if (s == org) mp[name] += 5; else if (name == org) mp[s] += 5; } mp[s]; mp[name]; } vector<pair<string, int>> v; for (auto x : mp) { if (x.first == org) continue; v.emplace_back(x.first, x.second); } sort(v.begin(), v.end(), [](pair<string, int> p1, pair<string, int> p2) { if (p1.second != p2.second) return p1.second > p2.second; return p1.first < p2.first; }); for (auto x : v) { cout << x.first << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, mid; bool flag; string str; char ans[3000]; cin >> n; cin >> str; if (n % 2 == 0) { mid = (n / 2) - 1; flag = true; } else { mid = (n - 1) / 2; flag = false; } long long k = 1, cnt = 0; ans[mid] = str[0]; for (long long i = 1; i < str.size(); i++) { cnt++; if (flag) { ans[mid + k] = str[i]; } else { ans[mid - k] = str[i]; } if (cnt == 2) { k++; cnt = 0; } flag = !flag; } for (long long i = 0; i < n; i++) { cout << ans[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int N, dp[5000][5001], cumlcp[5000][5000]; vector<int> sa, ra, rsa, lcp; string s; void saInit() { int l = (int)s.size(); sa.resize(l); iota(sa.begin(), sa.end(), 0); ra.assign(s.begin(), s.end()); for (int k = 1; k < l; k *= 2) { sort(sa.begin(), sa.end(), [&](int a, int b) { if (ra[a] != ra[b]) return ra[a] < ra[b]; int ak = a + k < l ? ra[a + k] : -1; int bk = b + k < l ? ra[b + k] : -1; return ak < bk; }); vector<int> ra2(l); int x = 0; for (int i = 1; i < l; i++) { if (ra[sa[i]] != ra[sa[i - 1]] || sa[i - 1] + k >= l || ra[sa[i] + k] != ra[sa[i - 1] + k]) x++; ra2[sa[i]] = x; } ra = ra2; } rsa.resize(l); for (int i = 0; i < int(l); i++) rsa[sa[i]] = i; } void saLCP() { int l = (int)s.size(); lcp.resize(l); vector<int> p(l); for (int i = 0; i < l; i++) { p[sa[i]] = (i) ? sa[i - 1] : -1; } int x = 0; for (int i = 0; i < l; i++) { while (p[i] != -1 && p[i] + x < l && s[i + x] == s[p[i] + x] && s[i + x] != $ ) x++; lcp[rsa[i]] = x; if (x) x--; } for (int i = 0; i < int(l); i++) { cumlcp[i][i] = INT_MAX; for (int j = i + 1; j < int(l); j++) cumlcp[i][j] = min(cumlcp[i][j - 1], lcp[j]); } } bool ism(int a, int b, int n) { int as = a - n + 1, bs = b - n + 1; if (as < 0) return false; if (rsa[bs] <= rsa[as]) return false; return cumlcp[rsa[as]][rsa[bs]] < n; } int main() { cin >> N >> s; saInit(); saLCP(); for (int i = 0; i < int(N); i++) for (int j = 1; j < int(5001); j++) { int& ans = dp[i][j]; ans = dp[i][j - 1]; if (j > i + 1) { continue; } else if (s[i - j + 1] == 0 ) { } else if (j == i + 1) { ans = (ans + 1) % MOD; } else if (ism(i - j, i, j)) { ans = (ans + dp[i - j][j]) % MOD; } else { ans = (ans + dp[i - j][j - 1]) % MOD; } } cout << dp[N - 1][N] << endl; } |
#include <bits/stdc++.h> using namespace std; char str[2010][2010]; void go(int x, int y) { int l, r, u, d; d = (int)(str[x + 1][y] == . ); u = (int)(str[x - 1][y] == . ); r = (int)(str[x][y + 1] == . ); l = (int)(str[x][y - 1] == . ); if (!d && !u && !r && !l) { cout << Not unique << endl; exit(0); } if (l && !r && !u && !d) { str[x][y - 1] = < ; str[x][y] = > ; if (str[x][y - 2] == . ) go(x, y - 2); if (str[x - 1][y - 1] == . ) go(x - 1, y - 1); if (str[x + 1][y - 1] == . ) go(x + 1, y - 1); } if (r && !l && !u && !d) { str[x][y] = < ; str[x][y + 1] = > ; if (str[x][y + 2] == . ) go(x, y + 2); if (str[x - 1][y + 1] == . ) go(x - 1, y + 1); if (str[x + 1][y + 1] == . ) go(x + 1, y + 1); } if (u && !l && !r && !d) { str[x - 1][y] = ^ ; str[x][y] = v ; if (str[x - 2][y] == . ) go(x - 2, y); if (str[x - 1][y + 1] == . ) go(x - 1, y + 1); if (str[x - 1][y - 1] == . ) go(x - 1, y - 1); } if (d && !l && !r && !u) { str[x][y] = ^ ; str[x + 1][y] = v ; if (str[x + 2][y] == . ) go(x + 2, y); if (str[x + 1][y - 1] == . ) go(x + 1, y - 1); if (str[x + 1][y + 1] == . ) go(x + 1, y + 1); } return; } int main() { int n, m, i, j; for (i = 0; i < 2010; i++) for (j = 0; j < 2010; j++) str[i][j] = * ; scanf( %d%d , &n, &m); getchar(); for (i = 1; i <= n; i++) { gets(str[i] + 1); str[i][m + 1] = * ; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (str[i][j] == . ) go(i, j); } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (str[i][j] == . ) { cout << Not unique << endl; return 0; } } } for (i = 1; i <= n; i++) { str[i][m + 1] = 0; printf( %s n , str[i] + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long int n, m; int main() { cin >> n; m = (((n - 3) * 3) + ((n - 3) * (n - 4))) + 1; cout << m << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 8e5 + 5; struct trie { int a[26]; vector<int> val[2]; } a[N]; int vis[N][2]; char ch[800005]; int cnt, n; void insert(char ch[], int op, int k) { int u = 0; int len = strlen(ch + 1); a[u].val[op].push_back(k); for (int i = 1; i <= len; i++) { if (!a[u].a[ch[i] - a ]) a[u].a[ch[i] - a ] = ++cnt; u = a[u].a[ch[i] - a ]; a[u].val[op].push_back(k); } } int dfs(int k, int dep) { int ans = 0; for (int i = 0; i < 26; i++) if (a[k].a[i]) ans += dfs(a[k].a[i], dep + 1); vector<int> t[2]; for (int i = 0; i <= 1; i++) for (int j = 0; j < a[k].val[i].size(); j++) if (!vis[a[k].val[i][j]][i]) t[i].push_back(a[k].val[i][j]); int tmp = min(t[0].size(), t[1].size()); ans += tmp * dep; for (int i = 0; i < tmp; i++) { vis[t[0][i]][0] = t[1][i]; vis[t[1][i]][1] = t[0][i]; } return ans; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , ch + 1); insert(ch, 0, i); } for (int i = 1; i <= n; i++) { scanf( %s , ch + 1); insert(ch, 1, i); } printf( %d n , dfs(0, 0)); for (int i = 1; i <= n; i++) printf( %d %d n , i, vis[i][0]); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e6 + 50; const long long inf = 0x3f3f3f3f3f3f3f3f; const long long mod = 1e9 + 7; const long double eps = 1e-20; const long long HASH = 131; using namespace std; long long a[maxn]; signed main() { std::ios::sync_with_stdio(false); long long t; cin >> t; while (t--) { long long a, b; cin >> a >> b; if ((a & 1)) { long long tmp = b % 4; if (tmp == 1) { cout << a + b << endl; } else if (tmp == 2) { cout << a - 1 << endl; } else if (tmp == 3) { cout << a - 1 - b << endl; } else cout << a << endl; } else { long long tmp = b % 4; if (tmp == 1) { cout << a - b << endl; } else if (tmp == 2) { cout << a + 1 << endl; } else if (tmp == 3) { cout << a + 1 + b << endl; } else cout << a << endl; } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; using ii = pair<long long, long long>; using ll = long long; using ull = unsigned long long; using ld = long double; using vec = vector<long long>; using vecc = vector<vector<long long> >; namespace royyaha { template <typename T> void pr(const T& x) { cout << x; } template <typename T1, typename T2> void pr(const pair<T1, T2>& x) { cout << x.first << << x.second; } template <typename T, typename... Args> void pr(const T& x, const Args&... rest) { pr(x); pr(rest...); } template <typename T> void ou(const T& x) { pr(x); cout << endl; } template <typename T, typename... Args> void ou(const T& x, const Args&... rest) { pr(x, ); ou(rest...); } template <typename T> void ou(const vector<T>& v, long long n = 0) { n = (n ? n : v.size()); for (auto it = v.begin(); it != v.begin() + n; ++it) { if (it + 1 == v.end()) ou(*it); else pr(*it, ); } } } // namespace royyaha using namespace royyaha; bool intersection(ii a, ii b) { return !(a.first > b.second || a.second < b.first); } const long long maxn = 2e5 + 50; vec depth(maxn); vec son(maxn); vec e[maxn]; void dfs(long long u, long long pre) { depth[u] = depth[pre] + 1; son[u] = 1; for (auto v : e[u]) if (v != pre) { dfs(v, u); son[u] += son[v]; } } signed main() { long long n, k; cin >> n >> k; for (long long i = 0; i < n - 1; ++i) { long long u, v; cin >> u >> v; u--, v--; e[u].push_back(v); e[v].push_back(u); } dfs(0, 0); vec f(n); for (long long i = 0; i < n; ++i) f[i] = depth[i] - son[i]; sort(f.begin(), f.end()); reverse(f.begin(), f.end()); cout << accumulate(f.begin(), f.begin() + k, 0ll) << endl; } |
#include <bits/stdc++.h> using namespace std; void AWAD() { std::ios::sync_with_stdio(false); cin.tie(0); } bool cmp(long long int a, long long int b) { if (a > b) return true; return false; } int a[1000001], b[1000001]; int main() { AWAD(); string input; long long int c4 = 0, c7 = 0; cin >> input; for (int i = 0; i < input.size(); i++) if (input[i] == 4 ) ++c4; else if (input[i] == 7 ) ++c7; if (!c4 && !c7) cout << -1 n ; else if (c4 >= c7) cout << 4 << endl; else cout << 7 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char c; int mo = 1000003; int main() { int pre = 0; while (scanf( %c , &c) != EOF) { if (c < 32 || c > 126) break; int w = c; int tmp = 0; for (int j = 0; j < 8; j++) { tmp = tmp * 2 + w % 2; w /= 2; } w = tmp; tmp = pre - tmp; pre = w; if (tmp < 0) tmp += 256; printf( %d n , tmp); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mo = 10007; char S[205]; int n, m, M, f[205][205][205], ans; struct O { long long a[330][330]; void clear() { memset(a, 0, sizeof a); } } A, B, C; O operator*(const O &A, const O &B) { for (int i = 0; i <= M; ++i) for (int j = i; j <= M; ++j) { C.a[i][j] = 0; for (int k = 0; k <= M; ++k) C.a[i][j] += A.a[i][k] * B.a[k][j]; C.a[i][j] %= mo; } return C; } void fly(int l, int r) { if (f[l][r][m + 3]) return; if (l > r) { f[l][r][0] = 1; return; } if (S[l] == S[r]) { fly(l + 1, r - 1); for (int i = 0; i <= m; ++i) f[l][r][i] = f[l + 1][r - 1][i]; } else { fly(l, r - 1); fly(l + 1, r); for (int i = 1; i <= m; ++i) f[l][r][i] = (f[l][r - 1][i - 1] + f[l + 1][r][i - 1]) % mo; } f[l][r][m + 3] = 1; } void ply(int l, int r) { if (f[l][r][m + 3]) return; if (l > r) { f[l][r][0] = 1; return; } if (S[l] == S[r]) { if (l == r) return; ply(l + 1, r - 1); for (int i = 0; i <= m; ++i) f[l][r][i] = f[l + 1][r - 1][i]; } else { ply(l, r - 1); ply(l + 1, r); for (int i = 1; i <= m; ++i) f[l][r][i] = (f[l][r - 1][i - 1] + f[l + 1][r][i - 1]) % mo; } f[l][r][m + 3] = 1; } int main() { scanf( %s%d , S + 1, &n); m = strlen(S + 1); fly(1, m); for (int i = 1; i < m; ++i) A.a[i][i] = 24; for (int i = 1; i < m - 1; ++i) A.a[i][i + 1] = 1; for (int i = 1; i < m; ++i) A.a[i][m + (m + 1) / 2 - (m - i + 1) / 2] = f[1][m][i]; A.a[0][m] = f[1][m][0]; if (m > 1) A.a[0][1] = 1; for (int i = m; i <= m + (m + 1) / 2 - 1; ++i) A.a[i][i] = 25, A.a[i][i + 1] = 1; M = m + (m + 1) / 2; A.a[M][M] = 26; for (int i = 0; i <= M; ++i) B.a[i][i] = 1; for (int e = (n + m + 1) / 2 + 1; e; e >>= 1) { if (e & 1) B = B * A; A = A * A; } ans = B.a[0][M]; if ((m + n) & 1) { memset(f, 0, sizeof f); ply(1, m); A.clear(); for (int i = 1; i < m; ++i) A.a[i][i] = 24; for (int i = 1; i < m - 1; ++i) A.a[i][i + 1] = 1; for (int i = 1; i < m; ++i) A.a[i][m + (m + 1) / 2 - (m - i + 1) / 2] = f[1][m][i]; A.a[0][m] = f[1][m][0]; if (m > 1) A.a[0][1] = 1; for (int i = m; i <= m + (m + 1) / 2 - 1; ++i) A.a[i][i] = 25, A.a[i][i + 1] = 1; M = m + (m + 1) / 2; B.clear(); for (int i = 0; i <= M; ++i) B.a[i][i] = 1; for (int e = (n + m + 1) / 2 + 1; e; e >>= 1) { if (e & 1) B = B * A; A = A * A; } ans -= B.a[0][M]; } printf( %d n , (ans % mo + mo) % mo); return 0; } |
#include <bits/stdc++.h> int A, B, M = 6, N; int main() { scanf( %d%d%d , &N, &A, &B); int nda = N / A; for (int i = 1; (i <= 2) && (B * i <= N); ++i) M = std::min((i ^ 3) + (4 - ((N - B * i) / A) * (i ^ 3) + nda - 1) / nda, M); printf( %d n , M); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000009; const int SGZ = 26; const int M = 10009; int n, m, nxt[N][SGZ], crt[N][SGZ], q[M], ans[M]; vector<int> val; char s[N], qy[SGZ]; inline int read() { char c = getchar(); int ret = 0, f = 1; while (c < 0 || c > 9 ) { f = c == - ? -1 : 1; c = getchar(); } while ( 0 <= c && c <= 9 ) { ret = ret * 10 + c - 0 ; c = getchar(); } return ret * f; } inline int index(int x) { for (int l = 0, r = val.size() - 1, mid; l <= r;) { mid = l + r >> 1; if (val[mid] == x) { return mid; } else if (val[mid] < x) { l = mid + 1; } else { r = mid - 1; } } return -1; } int main() { scanf( %s , s); n = strlen(s); m = read(); for (int i = 1; i <= m; i++) { scanf( %s , qy); int len = strlen(qy); for (int j = 0; j < len; j++) { q[i] |= 1 << qy[j] - a ; } val.push_back(q[i]); } sort(val.begin(), val.end()); val.resize(unique(val.begin(), val.end()) - val.begin()); int last_position[SGZ]; fill(last_position, last_position + SGZ, n); for (int i = n - 1; ~i; i--) { last_position[s[i] - a ] = i; for (int j = 0; j < SGZ; j++) { nxt[i][j] = last_position[j]; } } memset(crt, -1, sizeof(crt)); for (int i = 0; i < n; i++) { for (int j = 0, p = i, sta = 0; j < 26 && p < n; j++) { int np = n, c = -1; for (int k = 0; k < 26; k++) { if ((sta >> k & 1) == 0) { if (np > nxt[p][k]) { c = k; np = nxt[p][k]; } } } if (~c) { sta |= 1 << c; p = np; crt[i][j] = sta; if (!i || crt[i - 1][j] != sta) { int idx = index(sta); if (~idx) { ans[idx]++; } } } } } for (int i = 1; i <= m; i++) { printf( %d n , ans[index(q[i])]); } return 0; } |
#include <bits/stdc++.h> int main() { long n; long m; std::cin >> n >> m; long a = 0, b = 0, c = 0, d = 0; while (!(n % 2)) { n = n / 2; a++; } while (!(n % 3)) { n = n / 3; b++; } while (!(m % 2)) { m = m / 2; c++; } while (!(m % 3)) { m = m / 3; d++; } if ((n != m) || (a > c) || (b > d)) { std::cout << -1; } else { std::cout << (c + d) - (a + b); } return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k, x, s = 0; cin >> n >> k; map<long long, long long> m; queue<long long> q; for (long long i = 0; 0 < n ? i < n : i > n; 0 < n ? i += 1 : i -= 1) { cin >> x; q.push(x); m[x] = 0; } while (1) { x = q.front(); q.pop(); if (!m.count(x + 1)) { q.push(x + 1); m[x + 1] = m[x] + 1; } if (m.size() >= n + k) break; if (!m.count(x - 1)) { q.push(x - 1); m[x - 1] = m[x] + 1; } if (m.size() >= n + k) break; } for (auto i : m) s += i.second; cout << s << n ; for (auto i : m) if (i.second != 0) cout << i.first << ; } |
#include <bits/stdc++.h> using namespace std; char s[2000006]; char t[1000006]; int len[100005], pos[100005]; vector<pair<int, int>> e; int main() { int n; scanf( %d , &n); int tp = 0; for (int i = 0; i < n; i++) { scanf( %s , t + tp); len[i] = strlen(t + tp); pos[i] = tp; tp += len[i]; int ki; scanf( %d , &ki); while (ki--) { int xij; scanf( %d , &xij); e.push_back({xij - 1, i}); } } int p = 0; sort(e.begin(), e.end()); int esz = (int)e.size(); tp = -1; int te = -1, sp = 0; while (p < esz) { int f = e[p].first; while (sp < f) { if (tp != -1) { s[sp++] = t[tp++]; if (tp >= te) tp = te = -1; } else s[sp++] = a ; } if (tp == -1) { tp = pos[e[p].second]; te = pos[e[p].second] + len[e[p].second]; } else if (len[e[p].second] > te - tp) { tp = pos[e[p].second]; te = pos[e[p].second] + len[e[p].second]; } while (p + 1 < esz && e[p + 1].first == e[p].first) { p++; if (len[e[p].second] > te - tp) { tp = pos[e[p].second]; te = pos[e[p].second] + len[e[p].second]; } } p++; } while (tp < te) s[sp++] = t[tp++]; s[sp] = 0 ; printf( %s , s); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e3 + 5; const int mod = 998244353; inline long long fpm(long long a, long long p) { long long r = 1; while (p) { if (p & 1) r = r * a % mod; a = a * a % mod; p /= 2; } return r; } int k, n, m; int s[maxn][maxn]; inline void init() { s[0][0] = 1; for (int i = 1; i <= k; i++) { for (int j = 1; j <= i; j++) { s[i][j] = (s[i - 1][j - 1] + 1ll * j * s[i - 1][j] % mod) % mod; } } } int main() { cin >> n >> m >> k; init(); long long ans = 0, cur = 1; long long invm = fpm(m, mod - 2); for (int i = 0; i <= k; i++) { ans = (ans + 1ll * cur * s[k][i] % mod * fpm(invm, i) % mod) % mod; cur = 1ll * cur * (n - i) % mod; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; char S[5000005], T[5000005]; int n, l = 1, tot = 0, R[5000005], st[5000005], ed[5000005]; void modify() { T[0] = $ , T[1] = # ; for (int i = 0; i < n; ++i) T[++l] = S[i], T[++l] = # ; T[++l] = 0 ; } void Manacher() { int p = 0, mx = 0; for (int i = 1; i < l; ++i) { R[i] = (mx > i) ? min(R[2 * p - i], mx - i) : 1; while (T[i - R[i]] == T[i + R[i]]) R[i]++; if (mx < i + R[i]) mx = i + R[i], p = i; st[i - R[i] + 1]++, st[i + 1]--; ed[i]++, ed[i + R[i]]--, tot = (tot + R[i] / 2) % 51123987; } tot = (1ll * tot * (tot - 1) / 2) % 51123987; } int main() { int i, ans = 0, sum = 0; scanf( %d%s , &n, S); modify(), Manacher(); for (i = 1; i < l; i++) { st[i] += st[i - 1]; ed[i] += ed[i - 1]; if (T[i] != # ) { ans = (ans + 1ll * sum * st[i] % 51123987) % 51123987; sum = (sum + ed[i]) % 51123987; } } printf( %d , (tot - ans + 51123987) % 51123987); return 0; } |
#include <bits/stdc++.h> using namespace std; using vint = vector<long long>; using pint = pair<long long, long long>; using vpint = vector<pint>; template <typename A, typename B> inline void chmin(A& a, B b) { if (a > b) a = b; } template <typename A, typename B> inline void chmax(A& a, B b) { if (a < b) a = b; } template <class A, class B> ostream& operator<<(ostream& ost, const pair<A, B>& p) { ost << { << p.first << , << p.second << } ; return ost; } template <class T> ostream& operator<<(ostream& ost, const vector<T>& v) { ost << { ; for (long long i = 0; i < v.size(); i++) { if (i) ost << , ; ost << v[i]; } ost << } ; return ost; } inline long long topbit(unsigned long long x) { return x ? 63 - __builtin_clzll(x) : -1; } inline long long popcount(unsigned long long x) { return __builtin_popcountll(x); } inline long long parity(unsigned long long x) { return __builtin_parity(x); } signed main() { long long N, K; cin >> N >> K; if (K > 1000000 || K * (K + 1) / 2 > N) { cout << -1 << endl; return 0; } long long s = K * (K + 1) / 2; long long G = 0; for (long long g = 1; g * g <= N; g++) { if (N % g) continue; if (N / s >= g) chmax(G, g); if (N / s >= N / g) chmax(G, N / g); } vint ans(K); iota((ans).begin(), (ans).end(), 1); ans[K - 1] += N / G - s; for (long long i = 0; i < (K); i++) ans[i] *= G; for (long long i = 0; i < (K); i++) { if (i) cout << ; cout << ans[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[100002]; int mini[100002][21]; vector<pair<int, int> > vp; int f(int l, int r, int m) { if (l == r) { for (int i = 0; i < a[l] - m; i++) { vp.push_back(make_pair(l, r)); } return a[l] - m; } int i = 0; for (i = 0;; i++) if (l + (1 << i) > r) break; int minIndex = -1; if (a[mini[l][i - 1]] < a[mini[r - (1 << (i - 1)) + 1][i - 1]]) { minIndex = mini[l][i - 1]; } else { minIndex = mini[r - (1 << (i - 1)) + 1][i - 1]; } for (int i = 0; i < a[minIndex] - m; i++) { vp.push_back(make_pair(l, r)); } if (minIndex == l) { return a[minIndex] - m + f(l + 1, r, a[minIndex]); } if (minIndex == r) { return a[minIndex] - m + f(l, r - 1, a[minIndex]); } else { return a[minIndex] - m + f(l, minIndex - 1, a[minIndex]) + f(minIndex + 1, r, a[minIndex]); } } int main() { cout << setprecision(9); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) mini[i][0] = i; for (int i = 1; i < 21; i++) { for (int j = 0; j + (1 << i) - 1 < n; j++) { if (a[mini[j][i - 1]] < a[mini[j + (1 << (i - 1))][i - 1]]) { mini[j][i] = mini[j][i - 1]; } else { mini[j][i] = mini[j + (1 << (i - 1))][i - 1]; } } } cout << f(0, n - 1, 0) << endl; for (int i = 0; i < vp.size(); i++) cout << 1 + vp[i].first << << 1 + vp[i].second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; const int maxn = 2e5 + 5; const long long mod = 1e9 + 7; long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; long long maxl = 1e18 + 2; for (int i = 0; i < n; i++) { long long p, q, b; cin >> p >> q >> b; if (p % q == 0) { cout << Finite << endl; continue; } long long g = gcd(p, q); p /= g; q /= g; while (true) { if (q == 1) { cout << Finite << endl; break; } g = gcd(b, q); if (g == 1) { cout << Infinite << endl; break; } q /= g; b = g; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n; for (int k = 0; k < n; k++) { cin >> m; for (int i = 0; i < m / 2; i++) { int fir, sec; cin >> fir >> sec; if (fir > 0 && sec > 0) { cout << sec << << -fir << ; } else if (fir < 0 && sec < 0) { cout << -sec << << fir << ; } else if (fir > 0 && sec < 0) { cout << -sec << << fir << ; } else if (fir < 0 && sec > 0) { cout << sec << << -fir << ; } } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n; char s[N], t[N]; bitset<N> c[30], ans; int main() { scanf( %s%d , s + 1, &n); for (int i = 1, _ = strlen(s + 1); i <= _; i++) c[s[i] - a ][i] = 1; int op, x, y; while (n--) { scanf( %d , &op); if (op == 1) { scanf( %d%s , &x, t + 1); c[s[x] - a ].reset(x); s[x] = t[1]; c[s[x] - a ].set(x); } else { scanf( %d%d%s , &x, &y, t + 1); int len = strlen(t + 1); ans.set(); y = y - len + 1; for (int i = 1; i <= len; i++) ans &= c[t[i] - a ] >> (i - 1); printf( %d n , max(0, (int)((ans >> x).count() - (ans >> (y + 1)).count()))); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1000005; long long pw(long long b, long long r, long long md) { long long ans = 1; while (r) { if (r & 1) ans = (ans * b) % md; b = (b * b) % md; r >>= 1; } return ans; } bool cmp(pair<long long, long long> a, pair<long long, long long> b) { if (a.first == b.first) return a.second < b.second; return a.first > b.first; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, k; cin >> n >> m >> k; long long dp[n][k + 1]; for (long long i = 0; i <= n - 1; ++i) for (long long j = 0; j <= k; ++j) dp[i][j] = -1e18; long long arr[n]; for (long long i = 0; i <= n - 1; ++i) cin >> arr[i]; long long pref[n]; pref[0] = arr[0]; for (long long i = 1; i <= n - 1; ++i) pref[i] = pref[i - 1] + arr[i]; for (long long i = 0; i <= n - 1; ++i) dp[i][0] = 0; dp[m - 1][1] = pref[m - 1]; long long ans = 0; for (long long i = m; i <= n - 1; ++i) { for (long long j = 0; j <= k; ++j) { dp[i][j] = dp[i - 1][j]; if (j == 0) continue; dp[i][j] = max(dp[i][j], dp[i - m][j - 1] + pref[i] - pref[i - m]); } } for (long long i = 0; i <= n - 1; ++i) ans = max(ans, dp[i][k]); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int x[200005], y[200005], z[200005]; long long a[200005], b[200005]; int main() { long long n, t; cin >> n >> t; x[0] = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; y[i] = 0; } for (int i = 1; i <= n; i++) { cin >> x[i]; y[x[i]]++; z[x[i]] = i; } for (int i = 1; i <= n; i++) { if ((x[i] < i) || (x[i] < x[i - 1])) { cout << No << endl; return 0; } if (y[i] > 0 && z[i] != i) { cout << No << endl; return 0; } } if (x[n] != n) { cout << No << endl; return 0; } for (int i = 1; i < n; i++) if ((a[i + 1] == (a[i] + 1)) && x[i + 1] != x[i] && y[x[i]] > 1) { cout << No << endl; return 0; } for (int i = 1; i <= n; i++) { int m = z[i]; if (y[i] == 1) b[m] = a[m] + t; else { for (int j = 0; j < y[i]; j++) b[m - j] = a[m] + t + 1LL - j; } } cout << Yes << endl; for (int i = 1; i <= n; i++) cout << b[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; template <class T> inline bool Min(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> inline bool Max(T &a, T b) { return a < b ? (a = b, true) : false; } inline int ni() { int a; scanf( %d , &a); return a; } inline ll nl() { ll a; scanf( %lld , &a); return a; } inline double nd() { double a; scanf( %lf , &a); return a; } inline void pi(int a) { printf( %d , a); } inline void pl(ll a) { printf( %lld , a); } inline void pd(double a) { printf( %.12lf , a); } const int N = 1e5 + 10; using ld = long double; void solve() { ld x, y, z; cin >> x >> y >> z; ld ans[10]; ans[1] = log(x) * pow(y, z); ans[2] = log(x) * pow(z, y); ans[3] = log(x) * y * z; ans[4] = log(y) * pow(x, z); ans[5] = log(y) * pow(z, x); ans[6] = log(y) * x * z; ans[7] = log(z) * pow(x, y); ans[8] = log(z) * pow(y, x); ans[9] = log(z) * x * y; ans[0] = ans[1]; int t = 1; for (int i = 1; i <= 9; i++) if (Max(ans[0], ans[i])) t = i; if (t == 1) puts( x^y^z ); if (t == 2) puts( x^z^y ); if (t == 3) puts( (x^y)^z ); if (t == 4) puts( y^x^z ); if (t == 5) puts( y^z^x ); if (t == 6) puts( (y^x)^z ); if (t == 7) puts( z^x^y ); if (t == 8) puts( z^y^x ); if (t == 9) puts( (z^x)^y ); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int powm[100005]; int fact[100005]; int sum[100005]; string s; void powers_of_10(int m) { powm[0] = 1; for (int i = 1; i <= m; i++) powm[i] = 1LL * powm[i - 1] * 10 % 1000000007; } void factorials(int m) { fact[0] = 1; for (int i = 1; i <= m; i++) fact[i] = 1LL * i * fact[i - 1] % 1000000007; } void sums(int m) { sum[0] = s[0] - 0 ; for (int i = 1; i < m; i++) { sum[i] = sum[i - 1] + (s[i] - 0 ); if (sum[i] >= 1000000007) sum[i] -= 1000000007; } } void euclid(int a, int b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; } else { long long x0, y0; euclid(b, a % b, x0, y0); x = y0; y = x0 - (a / b) * y0; } } int invers_modular(int n) { long long x, y; euclid(n, 1000000007, x, y); while (x < 0) x += 1000000007; return (int)x; } int comb(int n, int k) { if (k > n) return 0; int Ret = fact[n]; Ret = 1LL * Ret * invers_modular(fact[n - k]) % 1000000007; Ret = 1LL * Ret * invers_modular(fact[k]) % 1000000007; return Ret; } int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; cin >> s; powers_of_10(n); factorials(n); sums(n); int FirstSum = 0; int SecondSum = 0; for (int i = 0; i < n; i++) { FirstSum += 1LL * (s[i] - 0 ) * powm[n - 1 - i] * comb(i, k) % 1000000007; if (FirstSum >= 1000000007) FirstSum -= 1000000007; } for (int i = 0; i <= n - 2; i++) { SecondSum += 1LL * (1LL * sum[n - i - 2] * powm[i] % 1000000007) * comb(n - i - 2, k - 1) % 1000000007; if (SecondSum >= 1000000007) SecondSum -= 1000000007; } cout << (SecondSum + FirstSum) % 1000000007; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline long long read() { long long x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } inline void write(long long a) { if (a < 0) { a = -a; putchar( - ); } if (a >= 10) write(a / 10); putchar( 0 + a % 10); } inline void writeln(long long a) { write(a); puts( ); } inline void wri(long long a) { write(a); putchar( ); } long long t, l, r; long long dp[35][2][2]; long long calc(long long x, long long y) { if (x < 0 || y < 0) return 0; memset(dp, 0, sizeof(dp)); dp[32][1][1] = 1; for (long long i = 31; i >= 0; i--) { for (int j = 0; j <= 1; j++) { for (int k = 0; k <= 1; k++) { long long nextj = (j && !((x >> i) & 1)); long long nextk = (k && !((y >> i) & 1)); dp[i][nextj][nextk] += dp[i + 1][j][k]; if (!j || ((x >> i) & 1)) dp[i][j][nextk] += dp[i + 1][j][k]; if (!k || ((y >> i) & 1)) dp[i][nextj][k] += dp[i + 1][j][k]; } } } return dp[0][0][0] + dp[0][0][1] + dp[0][1][0] + dp[0][1][1]; } int main() { t = read(); while (t--) { l = read(), r = read(); writeln(calc(r, r) - 2 * calc(l - 1, r) + calc(l - 1, l - 1)); } return 0; } |
#include <bits/stdc++.h> using namespace std; static inline void WRITE(int a) { printf( %d n , a); } static inline void WRITE2(int a, int b) { printf( %d %d n , a, b); } const int S9 = 1000000007, S6 = 1000007, S5 = 100007, S4 = 10007, S3 = 1007, S2 = 107; const double E2 = 0.01, E4 = 0.0001, E6 = 0.000001, E8 = 0.00000001; int tab[4][2]; int check() { bool czy = false; int ob = 0, at = 1; if (tab[ob][0] > tab[2][1] && tab[at][1] > tab[3][0]) if (tab[ob][0] > tab[3][1] && tab[at][1] > tab[2][0]) return 1; if ((tab[ob][0] < tab[2][1] && tab[at][1] < tab[3][0]) || (tab[ob][0] < tab[3][1] && tab[at][1] < tab[2][0])) czy = true; ob = 1; at = 0; if (tab[ob][0] > tab[2][1] && tab[at][1] > tab[3][0]) if (tab[ob][0] > tab[3][1] && tab[at][1] > tab[2][0]) return 1; if (((tab[ob][0] < tab[2][1] && tab[at][1] < tab[3][0]) || (tab[ob][0] < tab[3][1] && tab[at][1] < tab[2][0])) && czy) return 2; return 0; } int main() { for (int i = 0; i < 4; i++) scanf( %d%d , &tab[i][0], &tab[i][1]); int x = check(); if (x == 0) puts( Draw ); else printf( Team %d n , x); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = (int)1010; set<int> ans; int n, m; char a[MAXN][MAXN]; int posk[MAXN]; int posG[MAXN]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; if (a[i][j] == S ) { posk[i] = j; } if (a[i][j] == G ) { posG[i] = j; } } } for (int i = 0; i < n; i++) { if (posG[i] > posk[i]) { cout << -1; return 0; } else { ans.insert((int)posG[i] - posk[i] + 1); } } cout << ans.size(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { bool flag = 0; long long sum1 = 0, sum2 = 0; void operator+=(const node& rhs) { flag |= rhs.flag; sum1 += rhs.sum1; sum2 = max(sum2, rhs.sum2); } }; const int N = 200200; int n, m, s, T; int par[N], siz[N]; int tin[N], low[N]; long long a[N]; vector<int> edges[N], tree[N]; vector<pair<int, int>> bridges; int findSetId(int u) { return (par[u] == u ? u : par[u] = findSetId(par[u])); } void findBridges(int u = 1, int p = -1) { tin[u] = low[u] = ++T; for (int v : edges[u]) { if (v == p) { continue; } if (tin[v] == 0) { findBridges(v, u); if (low[v] > tin[u]) { bridges.push_back({u, v}); } else { int x = findSetId(u); int y = findSetId(v); if (x != y) { par[y] = x; siz[x] += siz[y]; a[x] += a[y]; } } } low[u] = min(low[u], low[v]); } } void buildBridgeTree() { for (int i = 1; i <= n; ++i) { par[i] = i, siz[i] = 1; } findBridges(); for (auto& b : bridges) { int u = findSetId(b.first); int v = findSetId(b.second); tree[u].push_back(v); tree[v].push_back(u); } } node solve(int u = s, int p = -1) { node ret; for (int v : tree[u]) { if (v == p) { continue; } ret += solve(v, u); } if (siz[u] > 1 || ret.flag) { ret.sum1 += a[u], ret.flag = 1; } else { ret.sum2 += a[u]; } return ret; } int main() { cin >> n >> m; for (int i = 1; i <= n; ++i) { scanf( %lld , a + i); } while (m--) { int u, v; scanf( %d %d , &u, &v); edges[u].push_back(v); edges[v].push_back(u); } cin >> s; buildBridgeTree(); auto out = solve(findSetId(s)); cout << out.sum1 + out.sum2; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long double n; cin >> n; if (n <= 127) { cout << byte ; } else if (n <= 32767) { cout << short ; } else if (n <= 2147483647) { cout << int ; } else if (n <= 9223372036854775807LL) { cout << long ; } else { cout << BigInteger ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) { long long int n; cin >> n; if (n <= 6) cout << 15 << endl; else { long long int r = n % 6; long long int y = ((n - r - 6) / 6) * 15; if (r != 0) long long int y = ((n - r - 6) / 6) * 15; if (r + 6 <= 6) y = y + 15; else if (r + 6 <= 8) y = y + 20; else if (r + 6 <= 10) y = y + 25; else y = y + 30; cout << y << endl; } } } |
#include <bits/stdc++.h> using namespace std; char a[1005]; char b[1005]; int t[1005]; int sum[1005]; int main() { memset(t, 0, sizeof(t)); int p, n, m; cin >> n >> m >> p; cin >> a >> b; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i + j] != b[j]) break; else if (j == m - 1) t[i] = 1; } } sum[0] = t[0]; for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + t[i]; while (p--) { int l, r; scanf( %d%d , &l, &r); l--, r--; if (n < m || r - l + 1 < m) cout << 0 << endl; else cout << sum[r - m + 1] - sum[l - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200006; int a[MAXN], b[MAXN]; int N; int main() { while (scanf( %d , &N) != EOF) { int i, j; int x; int n = 0, m = 0; long long suma = 0, sumb = 0; int win = 0; int last; for (i = 1; i <= N; i++) { scanf( %d , &x); if (x > 0) { a[++n] = x; suma += x; last = 1; } else { b[++m] = -x; sumb += (-x); last = 2; } } if (suma > sumb) win = 1; else if (suma < sumb) win = 2; else { for (i = 1, j = 1; i <= n && j <= m; i++, j++) { if (a[i] > b[j]) { win = 1; break; } else if (a[i] < b[j]) { win = 2; break; } } if (i > n && j > m) win = last; else if (i > n && j <= m) win = 2; else if (i <= n && j > m) win = 1; } if (win == 1) printf( first n ); else if (win == 2) printf( second n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double eps = 1e-6; const int MAXN = 1e5 + 10; const int MAXM = 1e6 + 10; const long long mod = 1e9 + 7; int a[1010]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); int ans = 0; for (int i = 1; i < n - 1; i++) { if (a[i] > a[i - 1] && a[i] > a[i + 1]) ans++; if (a[i] < a[i - 1] && a[i] < a[i + 1]) ans++; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-20; int main() { int n, a, d; cin >> n >> a >> d; int *t = new int[n]; int *v = new int[n]; double ans = -1.0; for (int i = 0; i < n; i++) cin >> t[i] >> v[i]; for (int i = 0; i < n; i++) { double t1 = (v[i] + 0.0) / (a + 0.0); double t2 = (d - a * t1 * t1 * 0.5) / (v[i] + 0.0); if (a * t1 * t1 * 0.5 >= d) { t1 = sqrt(2.0 * d / (a + 0.0)); t2 = 0; } double tt = t1 + t2 + t[i]; if (tt > ans) { printf( %.6f n , tt); ans = tt; } else printf( %.6f n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 110; const int M = 1010; double f[N][M * N], sum[N * M]; int a[N], n, m, s; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , a + i); s += a[i]; } f[0][0] = 1; sum[0] = 1.0; for (int j = 1; j < s; j++) sum[j] = sum[j - 1] + f[0][j]; for (int i = 1; i <= n; i++) { for (int j = i; j < s; j++) { int l = min(m, j - i + 1); int r = max(-1, j - l - 1); double tmp = sum[j - 1] - ((r == -1) ? 0 : sum[r]); if (l < a[i]) f[i][j] = tmp / (m - 1); else f[i][j] = (tmp - f[i - 1][j - a[i]]) / (m - 1); } sum[0] = 0; for (int j = 1; j < s; j++) { sum[j] = sum[j - 1] + f[i][j]; } } double ans = 0; for (int i = n; i < s; i++) { ans += f[n][i]; } printf( %.10f n , 1 + ans * (m - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[111], x[111], saven; long double f[2][100111], sum[2][100111]; int main() { ios ::sync_with_stdio(0); cin.tie(0); cout << (fixed) << setprecision(12); while (cin >> n >> m) { int sumA = 0; for (int i = (1), _b = (n); i <= _b; ++i) { int x; cin >> x; --x; a[i] = x; sumA += x; } if (m == 1) { cout << 1.0 << endl; continue; } for (int i = (1), _b = (n); i <= _b; ++i) { int cur = i % 2; memset(f[cur], 0, sizeof f[cur]); if (i == 1) { for (int val = 0, _a = (m * i); val < _a; ++val) if (val < m && val != a[i]) f[cur][val] = 1; } else { for (int val = 0, _a = (m * i); val < _a; ++val) { f[cur][val] = sum[1 - cur][val]; if (val >= m) f[cur][val] -= sum[1 - cur][val - m]; f[cur][val] -= f[1 - cur][val - a[i]]; } } for (int val = 0, _a = (m * (i + 1)); val < _a; ++val) { sum[cur][val] = f[cur][val]; if (val > 0) sum[cur][val] += sum[cur][val - 1]; } } long double t = sum[n % 2][sumA - 1]; for (int turn = 0, _a = (n); turn < _a; ++turn) t /= (m - 1); cout << t * (m - 1.0) + 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; int n, k; void solve(){ cin >> n >> k; int cnt = 1; int query = 0; for(int i = 0; i < n; i++){ if(i) query = i ^ (i - 1); cout << query << endl; int r; cin >> r; if(r == 1) return; } } int main(){ // freopen( inp.txt , r , stdin); // freopen( out.txt , w , stdout); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while(t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int n, m, i, x, y, k, a, q, h, l, r, j, p, s[400]; vector<int> ve[51][51]; bool ok1, ok2, Find, ok[51][51]; void get(int x, int y, int z) { q = 105; h = 104; for (int i = 1; i < ve[x][y].size(); i++) { s[++h] = ve[x][y][i]; if (i == z) l = h, r = h + 1; } while (q != l && h - q + 1 <= 2 * n) { if (ve[s[l - 1]][s[l]].size() == 0) return; for (int i = ve[s[l - 1]][s[l]].size() - 1; i; i--) s[--q] = ve[s[l - 1]][s[l]][i]; l--; } if (h - q + 1 > 2 * n) return; while (h != r && h - q + 1 <= 2 * n) { if (ve[s[r]][s[r + 1]].size() == 0) return; for (int i = 1; i < ve[s[r]][s[r + 1]].size(); i++) s[++h] = ve[s[r]][s[r + 1]][i]; r++; } if (h - q + 1 > 2 * n) return; Find = true; } int main() { scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d%d , &x, &y, &k); ok1 = false; ok2 = false; ve[x][y].push_back(0); a = 0; while (k--) { if (a != x) ok1 = false; else ok1 = true; scanf( %d , &a); if (a == y && ok1) ok2 = true; ve[x][y].push_back(a); } if (ok2) ok[x][y] = true; } for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (ok[i][j]) for (p = 1; p < ve[i][j].size() - 1; p++) if (ve[i][j][p] == i && ve[i][j][p + 1] == j) { get(i, j, p); if (Find) { printf( %d n , h - q + 1); for (i = q; i <= h; i++) printf( %d , s[i]); printf( n ); return 0; } } printf( 0 n ); } |
#include <bits/stdc++.h> using namespace std; const long double PI = 3.141592653589793238462643383; int w; int visit[37] = {0}; int Ceil(int a, int b) { if (a % b == 0) return a / b; else return (a / b) + 1; } struct TrieNode { struct TrieNode *children[37]; bool isEndofWord; int cnt[37]; int snum[37]; int visit[37]; }; TrieNode *getNode() { TrieNode *x = new TrieNode; x->isEndofWord = false; for (int i = 0; i < (37); ++i) x->children[i] = NULL; for (int i = 0; i < (37); ++i) x->cnt[i] = 0; for (int i = 0; i < (37); ++i) x->snum[i] = -1; for (int i = 0; i < (37); ++i) x->visit[i] = -1; return x; } int find(char c) { if (c == . ) { return 26; } if (c >= a && c <= z ) { return c - a ; } return 27 + c - 0 ; } void insert(TrieNode *root, string s, int num) { TrieNode *p = root; for (int i = 0; i < (s.size()); ++i) { int index; index = find(s[i]); if (!p->children[index]) { p->children[index] = getNode(); } if (p->visit[index] != num) p->cnt[index]++; p->snum[index] = num; p->visit[index] = num; p = p->children[index]; } p->isEndofWord = true; } int search(TrieNode *root, string s) { TrieNode *p = root; int ans; for (int i = 0; i < (s.size()); ++i) { int index; index = find(s[i]); if (!p->children[index]) { return 0; } ans = p->cnt[index]; w = p->snum[index]; p = p->children[index]; } return ans; } int main() { cin.sync_with_stdio(0); cin.tie(0); cin.exceptions(cin.failbit); int n; cin >> n; string a[n]; TrieNode *root = getNode(); int e = 0; while (n--) { string s; cin >> s; a[e] = s; e++; int y = s.size() - 1; for (int i = 0; i < (s.size()); ++i) { string str; int x = s.size() - i; str.resize(x); int q = 0; for (int j = i; j <= (y); ++j) { str[q] = s[j]; q++; } insert(root, str, e); } } int q; cin >> q; while (q--) { string s; cin >> s; int y = search(root, s); if (y == 0) { cout << 0 - << n ; } else { cout << y << << a[w - 1] << n ; } } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; int main() { long long n; cin >> n; vector<long long> v; long long mx = -1, mn = -1; for (long long i = 1; i * i <= n; i++) if (n % i == 0) { v.push_back(i); v.push_back(n / i); } sort((v).begin(), (v).end()); for (int i = 0; i < (int)(v).size(); i++) { long long rest = n / v[i]; for (int j = 0; j < (int)(v).size(); j++) if (rest % v[j] == 0) { long long a = v[i] + 1; long long b = v[j] + 2; long long c = rest / v[j] + 2; mx = max(mx, a * b * c - (a - 1) * (b - 2) * (c - 2)); if (mn == -1) mn = a * b * c - (a - 1) * (b - 2) * (c - 2); mn = min(mn, a * b * c - (a - 1) * (b - 2) * (c - 2)); } } cout << mn << << mx; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10, inf = 1e9 + 10, P = 53, MOD = 1e9 + 7; int n, a, b, k, q, seg1[4 * maxn], seg2[4 * maxn]; inline void update(int ind) { seg1[ind] = seg1[((ind) * (2))] + seg1[(((ind) * (2)) + 1)]; seg2[ind] = seg2[((ind) * (2))] + seg2[(((ind) * (2)) + 1)]; } void add(int s, int e, int ind, int l, int r, int x) { if (s >= r || e <= l) return; if (s >= l && e <= r) { seg1[ind] += x; seg2[ind] += x; seg1[ind] = min(seg1[ind], b); seg2[ind] = min(seg2[ind], a); return; } int mid = (s + e) / 2; add(s, mid, ((ind) * (2)), l, r, x); add(mid, e, (((ind) * (2)) + 1), l, r, x); update(ind); } int query(int type, int s, int e, int ind, int l, int r) { if (s >= r || e <= l) return 0; if (s >= l && e <= r) { if (type == 1) return seg1[ind]; else return seg2[ind]; } int mid = (s + e) / 2; return query(type, s, mid, ((ind) * (2)), l, r) + query(type, mid, e, (((ind) * (2)) + 1), l, r); } int main() { scanf( %d%d%d%d%d , &n, &k, &a, &b, &q); while (q--) { int type, l, x; scanf( %d , &type); if (type == 1) { scanf( %d%d , &l, &x); add(0, n, 1, l - 1, l, x); } else { scanf( %d , &x); x--; printf( %d n , query(1, 0, n, 1, 0, x) + query(2, 0, n, 1, x + k, n)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; struct node { int x, y; } point[maxn]; bool check(node a, node b, node c, node d) { if (a.x - b.x == c.x - d.x && a.y - b.y == c.y - d.y) return true; return false; } int main() { int n; cin >> n; for (int i = 0; i < n; ++i) cin >> point[i].x >> point[i].y; if (n & 1) { cout << nO << endl; } else { bool flag = true; for (int i = 0; i < n; ++i) { if (!check(point[(i + 1) % n], point[i], point[(i + n / 2) % n], point[(i + n / 2 + 1) % n])) flag = false; } if (flag) cout << YES << endl; else cout << nO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e3 + 10; const long long M = 1e9 + 7; long long Max(long long a, long long b) { if (a > b) return a; return b; } long long Min(long long a, long long b) { if (a > b) return b; return a; } long long big_mul(long long a, long long b, long long m) { long long x = 0, y = a % m; while (b > 0) { if (b & 1) x = (x + y) % m; y = (2 * y) % m; b >>= 1; } return x % m; } long long big_mod(long long a, long long b, long long m) { long long x = 1, y = a % m; while (b > 0) { if (b & 1) x = (x * y) % m; y = (y * y) % m; b >>= 1; } return x % m; } long long Big_mod(long long a, long long b, long long m) { long long x = 1, y = a % m; while (b > 0) { if (b & 1) x = big_mul(x, y, m); y = big_mul(y, y, m); b >>= 1; } return x % m; } long long mod_inverse(long long a, long long m) { return big_mod(a, m - 2, m); } unordered_map<string, bool> Map; int a, b, c, d, e, f, g, h; vector<pair<int, int> > vec; vector<pair<pair<int, int>, int> > save; void fnct(int x1, int y1, int x2, int y2) { if (x1 < x2 && y1 > y2) { a = x1; b = y2; c = x1; d = y1; e = x2; f = y1; g = x2; h = y2; } else if (x1 > x2 && y1 < y2) { a = x2; b = y1; c = x2; d = y2; e = x1; f = y2; g = x1; h = y1; } else if (x1 < x2 && y1 < y2) { a = x1; b = y1; c = x1; d = y2; e = x2; f = y2; g = x2; h = y1; } else { a = x2; b = y2; c = x2; d = y1; e = x1; f = y1; g = x1; h = y2; } } double dis(double w, double z, double p, double q) { double n = w - p; double m = z - q; return sqrt(n * n + m * m); } bool check(double p, double q) { for (int i = 0; i < save.size(); i++) { double w = (double)(save[i].first.first); double z = (double)(save[i].first.second); double r = (double)(save[i].second); if (dis(w, z, p, q) <= r) return true; } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; fnct(x1, y1, x2, y2); int n; cin >> n; for (int i = 0; i < n; i++) { int w, z, r; cin >> w >> z >> r; if (Map[to_string(w) + to_string(z) + to_string(r)] == false) save.push_back(make_pair(make_pair(w, z), r)); Map[to_string(w) + to_string(z) + to_string(r)] = true; } for (int i = c; i <= e; i++) vec.push_back(make_pair(i, d)); for (int i = a; i <= g; i++) vec.push_back(make_pair(i, b)); for (int i = d - 1; i > b; i--) vec.push_back(make_pair(a, i)); for (int i = f - 1; i > h; i--) vec.push_back(make_pair(e, i)); int ans = 0; for (int i = 0; i < vec.size(); i++) { double p = (double)(vec[i].first); double q = (double)(vec[i].second); if (check(p, q) == false) ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100010]; bool b[100010]; long long gcd(long long a, long long b) { return a % b ? gcd(b, a % b) : b; } int main() { long long n, t; scanf( %lld , &n); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); b[i] = a[i] % 2; } long long ans = gcd(abs(a[1]), abs(a[2])); for (int i = 3; i <= n; i++) ans = gcd(ans, abs(a[i])); if (ans > 1) printf( YES n0 n ); else { int num = 0; for (int i = 1; i < n; i++) while (b[i] == 1) { if (b[i + 1] == 1) { b[i] = 0; b[i + 1] = 0; } else { b[i + 1] = 1; } ++num; } if (b[n] == 1) num += 2; printf( YES n%d n , num); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const long long INF = 1000000007; const long long INF2 = 1000000007LL * 1000000007LL; const long double EPS = 1e-9; const int SIZE = 1001000; int n, a, b; string fn[SIZE]; int val[SIZE], ans[SIZE]; int z[SIZE]; vector<int> g[SIZE]; void setVal(int v) { if (fn[v][0] == I ) { return; } for (auto& i : g[v]) setVal(i); if (fn[v][0] == A ) { val[v] = val[g[v][0]] && val[g[v][1]]; return; } if (fn[v][0] == O ) { val[v] = val[g[v][0]] || val[g[v][1]]; return; } if (fn[v][0] == X ) { val[v] = (val[g[v][0]] + val[g[v][1]]) % 2; return; } val[v] = !val[g[v][0]]; } void dfs(int v, int zn) { if (fn[v][0] == I ) { z[v] = zn; return; } if (zn == 0) { for (auto& i : g[v]) dfs(i, 0); return; } if (fn[v][0] == A ) { if (val[v] == 1) { for (auto& i : g[v]) dfs(i, 1); } else { if (!val[g[v][0]] && val[g[v][1]]) { dfs(g[v][0], 1); dfs(g[v][1], 0); } else if (val[g[v][0]] && !val[g[v][1]]) { dfs(g[v][0], 0); dfs(g[v][1], 1); } else { for (auto& i : g[v]) dfs(i, 0); } } return; } if (fn[v][0] == O ) { if (val[v] == 0) { for (auto& i : g[v]) dfs(i, 1); } else { if (val[g[v][0]] && val[g[v][1]]) { dfs(g[v][0], 0); dfs(g[v][1], 0); } else if (!val[g[v][0]] && val[g[v][1]]) { dfs(g[v][0], 0); dfs(g[v][1], 1); } else if (val[g[v][0]] && !val[g[v][1]]) { dfs(g[v][0], 1); dfs(g[v][1], 0); } } return; } for (auto& i : g[v]) dfs(i, zn); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; ++i) { cin >> fn[i]; if (fn[i] == IN ) { cin >> val[i]; } else if (fn[i] == NOT ) { cin >> a; --a; g[i].push_back(a); } else { cin >> a; --a; g[i].push_back(a); cin >> a; --a; g[i].push_back(a); } } setVal(0); dfs(0, 1); for (int i = 0; i < n; ++i) { if (fn[i][0] == I ) { if (z[i]) cout << !val[0]; else cout << val[0]; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 202; const int MAXM = 50005; struct edge { int a, b; long long int g, s; edge(int a_ = 0, int b_ = 0, long long int g_ = 0LL, long long int s_ = 0LL) { a = a_, b = b_, g = g_, s = s_; } }; int N, M, cnt; int dad[MAXN]; long long int G, S, res = 1LL << 62; edge g[MAXM]; edge way[MAXM]; inline bool compare(const edge &a, const edge &b) { return a.g < b.g; } inline int find(int a) { if (a == dad[a]) return a; return dad[a] = find(dad[a]); } int main() { scanf( %d %d %I64d %I64d , &N, &M, &G, &S); for (int i = 1; i <= M; i++) { scanf( %d %d %I64d %I64d , &way[i].a, &way[i].b, &way[i].g, &way[i].s); way[i].g *= G; way[i].s *= S; } sort(way + 1, way + M + 1, compare); for (int i = 1; i <= M; i++) { g[++cnt] = way[i]; for (int j = cnt; j > 1; j--) { if (g[j].s < g[j - 1].s) swap(g[j], g[j - 1]); else break; } if (i >= N - 1) { long long int ss; for (int j = 1; j <= N; j++) dad[j] = j; int c = 0; int ncnt = 0; for (int j = 1; j <= cnt; j++) if (find(g[j].a) != find(g[j].b)) { c++; g[++ncnt] = g[j]; ss = g[j].s; dad[find(g[j].a)] = g[j].b; } cnt = ncnt; if (c == N - 1) res = min(res, way[i].g + ss); } } if (res == 1LL << 62) printf( -1 n ); else printf( %I64d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, id, nxt[100005], num[100005], mark[100005]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &nxt[i]); if (nxt[i] == i) { puts( YES ); for (int j = 1; j <= n; j++) if (j != i) printf( %d %d n , i, j); return 0; } } for (int i = 1; i <= n; i++) { if (num[i]) continue; int j = nxt[i], t = 1; while (j != i) j = nxt[j], t++; while (!num[j]) num[j] = t, j = nxt[j]; if (t & 1) { puts( NO ); return 0; } if (t == 2) id = i; } if (!id) { puts( NO ); return 0; } puts( YES ); printf( %d %d n , id, nxt[id]); for (int i = 1; i <= n; i++) { if (i == id || i == nxt[id] || mark[i]) continue; int a = id, b = i; while (num[i]--) { printf( %d %d n , a, b); mark[b] = 1; a = nxt[a]; b = nxt[b]; } } return 0; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int ara[n]; int temp, j; int i = 0; while (i < n) { scanf( %d , &ara[i]); i++; } i = 0; while (i < (n - 1)) { j = 0; while (j < (n - 1)) { if (ara[j] > ara[j + 1]) { temp = ara[j]; ara[j] = ara[j + 1]; ara[j + 1] = temp; } j++; } i++; } i = 0; while (i < n) { printf( %d , ara[i]); i++; } return 0; } |
#include <bits/stdc++.h> #define MP make_pair using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); ++ i) #define rep1(i, n) for (int i = 1; i <= (int)(n); ++ i) #define foreach(itr, c) for (__typeof((c).begin()) itr = (c).begin(); itr != (c).end(); ++ itr) typedef long long LL; typedef pair<int, int> pii; const int MAXN = 2e5 + 5; int N; string str[MAXN]; map<string, vector<string> > grps; LL ans; int solve_pair(const string& s1, const string& s2) { int prefix = 0, suffix = 0, n = s1.size(); while (s1[prefix] == s2[prefix]) prefix ++; while (s1[n - suffix - 1] == s2[n - suffix - 1]) suffix ++; return is_sorted(s1.begin() + prefix, s1.end() - suffix) || is_sorted(s2.begin() + prefix, s2.end() - suffix) ? 1ll : 2ll; } void solve(vector<string>& grp) { int n = grp.size(), len = grp[0].size(); ans -= 1ll * (n - 1) * n / 2 * 1337; if (n <= 200 * len) { rep(i, n) for (int j = i + 1; j < n; ++ j) { ans += solve_pair(grp[i], grp[j]); } } else { sort(grp.begin(), grp.end()); ans += 1ll * (n - 1) * n / 2 * 2; for (auto& s : grp) { rep(i, len) for (int j = i + 2; j <= len; ++ j) { string sorted = s; sort(sorted.begin() + i, sorted.begin() + j); ans -= (sorted[i] != s[i] && sorted[j - 1] != s[j - 1] && binary_search(grp.begin(), grp.end(), sorted)); } } } }; int main() { scanf( %d , &N); rep(i, N) { cin >> str[i]; string sorted = str[i]; sort(sorted.begin(), sorted.end()); grps[sorted].push_back(str[i]); } ans = 1ll * (N - 1) * N / 2 * 1337; for (auto& grp : grps) solve(grp.second); printf( %lld n , ans); return 0; } |
#include <iostream> #include <cmath> #include <map> #include <string> #include <vector> #include <algorithm> #define int long long using namespace std; string s; int a, b, c; int n, m, k; vector<int>vec, vec2; int arr[4000000], mark[4000000]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> k; for (int i = 0; i < n; i++) { cin >> a; vec.push_back(a); } for (int i = 0; i < m; i++) { cin >> a; vec2.push_back(a); } if (n < m) { swap(n, m); swap(vec, vec2); } int iter = 0; for (auto i : vec) { mark[iter] = m; iter++; arr[i] = iter; } iter = 0; int pos; for (auto i : vec2) { iter++; if (arr[i] != 0) { pos = (arr[i] - iter + n) % n; mark[pos]--; } } pos = 0; int sum = 0; int len = 0; while (true) { sum += mark[pos]; pos += m; len += m; pos %= n; if (pos == 0) { break; } } k -= 2; int ans = (k / sum); ans *= len; k %= sum; k += 2; pos = 0; while (k > mark[pos]) { k -= mark[pos]; pos += m; ans += m; pos %= n; } int pos2 = 0; while (k > 0) { ans++; if (vec[(pos + pos2) % n] != vec2[pos2 % m]) { k--; } pos2++; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 15; const int inf = 1e9; const int md = 1e9 + 7; const int shift = 1 << 17; int n, m; vector<vector<int> > g; set<pair<int, int> > br; int timer; int tin[maxn], fup[maxn]; int used[maxn]; void dfs(int v, int p = -1) { used[v] = 1; tin[v] = fup[v] = timer++; for (int i = 0; i < g[v].size(); ++i) { int to = g[v][i]; if (to == p) continue; if (used[to]) fup[v] = min(fup[v], tin[to]); else { dfs(to, v); fup[v] = min(fup[v], fup[to]); if (fup[to] > tin[v]) { br.insert(make_pair(to, v)); br.insert(make_pair(v, to)); } } } } int color[maxn]; int first[maxn]; int d[maxn]; vector<int> eu; int z[shift * 2]; int c; void dfs2(int v, int tekc, int len, int p = -1) { used[v] = 1; color[v] = tekc; d[tekc] = len; for (int i = 0; i < g[v].size(); ++i) { int to = g[v][i]; if (to == p) continue; if (used[to]) continue; if (br.find(make_pair(v, to)) != br.end()) { eu.push_back(c + 1); first[c + 1] = eu.size() - 1; ++c; dfs2(to, c, len + 1, v); eu.push_back(tekc); } else dfs2(to, tekc, len, v); } } void build() { for (int i = 0; i < eu.size(); ++i) z[i + shift] = eu[i]; for (int i = eu.size(); i < shift; ++i) z[i + shift] = n + 1; for (int i = shift - 1; i > 0; --i) if (d[z[i * 2]] < d[z[i * 2 + 1]]) z[i] = z[i * 2]; else z[i] = z[i * 2 + 1]; } int get(int v, int tl, int tr, int l, int r) { if (l > r) return n + 1; if (l == tl && r == tr) return z[v]; int tm = (tl + tr) / 2; int ans1 = get(v * 2, tl, tm, l, min(r, tm)); int ans2 = get(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r); return d[ans1] < d[ans2] ? ans1 : ans2; } int main() { cin >> n >> m; g.resize(n); for (int i = 0; i < m; ++i) { int v, u; cin >> v >> u; --v, --u; g[v].push_back(u); g[u].push_back(v); } dfs(0); memset(used, 0, sizeof(used)); memset(first, -1, sizeof(first)); eu.push_back(0); first[0] = 0; dfs2(0, 0, 0); d[n + 1] = inf; build(); int k; cin >> k; for (int i = 0; i < k; ++i) { int s, l; cin >> s >> l; --s, --l; int L = first[color[s]]; int R = first[color[l]]; if (L > R) swap(L, R); int lca = get(1, 0, shift - 1, L, R); cout << d[color[s]] + d[color[l]] - 2 * d[lca] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, siz[500010]; vector<int> v[500010]; class DS { public: long long dat[2][2]; DS() { memset(dat, 0, sizeof(dat)); } DS(long long a00, long long a01, long long a10, long long a11) { dat[0][0] = a00; dat[0][1] = a01; dat[1][0] = a10; dat[1][1] = a11; } DS trans() { return DS(dat[1][0], dat[0][0] + dat[1][1], dat[0][0], dat[0][1]); } DS operator*(const DS &t) const { DS ret; for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { for (int k = 0; k + i < 2; k++) { for (int l = 0; j + l < 2; l++) { ret.dat[i + k][j + l] += dat[i][j] * t.dat[k][l]; } } } } return ret; } } f[500010], g[500010]; void dfs(int np, int fath) { f[np] = DS(1, 0, 0, 0); siz[np] = 1; for (int &x : v[np]) { if (x == fath) continue; dfs(x, np); siz[np] += siz[x]; f[np] = f[np] * f[x].trans(); } } void dfs2(int np, int fath) { vector<DS> pre; pre.push_back(DS(1, 0, 0, 0)); for (int i = 0; i < v[np].size(); i++) { if (v[np][i] == fath) pre.push_back(pre.back()); else pre.push_back(pre.back() * f[v[np][i]].trans()); } DS cur = fath ? g[np].trans() : DS(1, 0, 0, 0); for (int i = (int)v[np].size() - 1; i >= 0; i--) { if (v[np][i] == fath) continue; g[v[np][i]] = cur * pre[i]; dfs2(v[np][i], np); cur = cur * f[v[np][i]].trans(); } } int main() { scanf( %d , &n); if (n & 1) { puts( 0 ); return 0; } for (int i = 1, a, b; i < n; i++) { scanf( %d%d , &a, &b); v[a].push_back(b); v[b].push_back(a); } dfs(1, 0); dfs2(1, 0); long long ans = 0; for (int i = 2; i <= n; i++) { if (f[i].dat[1][0] == 1 && g[i].dat[1][0] == 1) ans += (long long)siz[i] * (n - siz[i]); else ans += (f[i].dat[0][0] + f[i].dat[1][1]) * (g[i].dat[0][0] + g[i].dat[1][1]); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, u, a[300001], x, y; long double ans = -1.0; int main() { cin >> n >> u; for (int i = 0; i < n; ++i) cin >> a[i]; y = 1; while (x < n - 2) { while (y < n - 1 && a[y + 1] - a[x] <= u) ++y; if (y - x >= 2 && a[y] - a[x] <= u) ans = max(ans, (long double)(a[y] - a[x + 1]) / (long double)(a[y] - a[x])); ++x; } printf( %.9Lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, m, cnt, belong[N]; vector<int> g[N], ans[N]; int get(int x) { return belong[x] ? belong[x] = get(belong[x]) : x; } void dfs(int i) { ans[cnt].push_back(i); belong[i] = i + 1; for (int j = get(1), k = 0; j <= n; j = get(j + 1)) { for (; k < g[i].size() && g[i][k] < j; k++) ; if (k < g[i].size() && g[i][k] == j) continue; dfs(j); } } int main() { scanf( %d%d , &n, &m); while (m--) { int a, b; scanf( %d%d , &a, &b); g[a].push_back(b); g[b].push_back(a); } for (int i = 1; i <= n; i++) sort(g[i].begin(), g[i].end()); for (int i = 1; i <= n; i++) if (!belong[i]) { dfs(i); cnt++; } printf( %d n , cnt); for (int i = 0; i < cnt; i++) { printf( %u , ans[i].size()); for (int j = 0; j < ans[i].size(); j++) printf( %d , ans[i][j]); puts( ); } } |
#include <bits/stdc++.h> using namespace std; int q, n; int a[100010], b[100010]; int main() { scanf( %d , &q); while (q--) { 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]); int pos = 0, dis = 0, flag1 = 0, flag2 = 0; for (int i = 1; i <= n; i++) { if (a[i] != b[i] && flag1 == 0) { pos = i; dis = b[i] - a[i]; if (dis < 0) { flag2 = 1; break; } flag1 = 1; } else if (a[i] != b[i] && flag1 == 1) { if (b[i] - a[i] != dis || i != pos + 1) { flag2 = 1; break; } else pos = i; } } if (flag2) printf( NO n ); else printf( YES n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int OO = (int)2e9; const double eps = 1e-9; int x[3], y[3]; int main() { int i; vector<pair<int, int> > V(8); set<int> X; set<int> Y; for (i = 0; i < 8; i++) { cin >> V[i].first >> V[i].second; X.insert(V[i].first); Y.insert(V[i].second); } i = 0; for (__typeof((X).begin()) it = (X).begin(); it != (X).end(); ++it) x[i++] = *it; i = 0; for (__typeof((Y).begin()) it = (Y).begin(); it != (Y).end(); ++it) y[i++] = *it; vector<pair<int, int> > C(8); C[0] = make_pair(x[0], y[0]); C[1] = make_pair(x[0], y[1]); C[2] = make_pair(x[0], y[2]); C[3] = make_pair(x[1], y[0]); C[4] = make_pair(x[1], y[2]); C[5] = make_pair(x[2], y[0]); C[6] = make_pair(x[2], y[1]); C[7] = make_pair(x[2], y[2]); sort((V).begin(), (V).end()); if (((int)(X).size()) != 3 || ((int)(Y).size()) != 3 || V != C) puts( ugly ); else puts( respectable ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[4000]; int ans[4000][4000]; int main() { cin >> n; map<int, int> r; for (int i = 0; i < n; i++) { cin >> a[i]; if (r.find(a[i]) == r.end()) { int k = r.size(); r[a[i]] = k; } a[i] = r[a[i]]; } int m = r.size(); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (ans[j][a[i]] + 1 > ans[a[i]][j]) { ans[a[i]][j] = ans[j][a[i]] + 1; } } } int best = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ans[i][j] > best) { best = ans[i][j]; } } } cout << best << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int a[100001], b[100001]; vector<long long int> v; map<long long int, long long int> assign; pair<long long int, long long int> dp[1001][7001]; inline long long int gcd(long long int a, long long int b) { long long int tmp; while (b) { tmp = a % b; a = b; b = tmp; } return a; } int main() { ios::sync_with_stdio(false); ; cin.tie(0); ; long long int i, j, n, k, x, y, temp, sz; cin >> n >> k; temp = k; for (i = 1; i <= n; i++) { cin >> a[i]; b[i] = gcd(a[i], k); temp = temp / gcd(temp, a[i]); } if (temp != 1) { cout << -1 ; return 0; } if (k == 1) { cout << 1 << n ; cout << min_element(a + 1, a + n + 1) - a; return 0; } for (i = 1; i * i <= k; i++) { if (k % i) continue; v.push_back(i); if (i != (k / i)) v.push_back(k / i); } sort(v.begin(), v.end()); sz = v.size(); for (i = 0; i < sz; i++) assign[v[i]] = i; for (i = 1; i < sz; i++) dp[0][i] = make_pair(1000000000000, 0); dp[0][0] = make_pair(0, 0); for (i = 1; i <= n; i++) { for (j = 0; j < sz; j++) { dp[i][j] = dp[i - 1][j]; x = assign[v[j] / gcd(v[j], b[i])]; if (dp[i][j] > make_pair(dp[i - 1][x].first + 1, dp[i - 1][x].second + a[i])) dp[i][j] = make_pair(dp[i - 1][x].first + 1, dp[i - 1][x].second + a[i]); } } cout << dp[n][sz - 1].first << n ; x = k; for (i = n; i >= 1; i--) { if (dp[i][assign[x]] == dp[i - 1][assign[x]]) continue; cout << i << ; x = x / gcd(x, b[i]); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.