func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, sum = 0; cin >> n; for (int i = 0; i < 60; i++) { long long x = 1LL << i; if (n & x) { sum += (1LL << (i + 1)) - 1; } } cout << sum << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, q, a, b, x, y, i = 1, j, p[150000], mas[150005]; pair<int, int> m[10]; int main() { cin >> n >> k >> q; while (i <= n) { cin >> p[i]; i++; } i = 0; while (i < q) { cin >> a >> b; if (a == 1) { if (p[b] > m[k - 1].first) { mas[m[k - 1].second] = 0; mas[b] = 1; m[k - 1].first = p[b]; m[k - 1].second = b; sort(m, m + k); reverse(m, m + k); } } if (a == 2) { if (mas[b] == 0) { cout << NO << endl; } else { cout << YES << endl; } } i++; } } |
#include <bits/stdc++.h> using namespace std; void chmax(int& a, int b) { a = max(a, b); } void chmin(int& a, int b) { a = min(a, b); } int nth_bit(int64_t num, int n) { return (num >> n) & 1; } int main() { string S; int X; cin >> S >> X; int N = S.size(); vector<int> A(N); for (int i = 0; i < N; i++) A[i] = S[i] - 0 ; vector<int> ds; for (int i = 1; i < X; i++) if (X % i == 0) ds.push_back(i); if (X == 1) { cout << count(A.begin(), A.end(), 1) << endl; return 0; } int B = 1 << (X + 1); vector<int> valid; for (int b = 0; b < B; b++) { bool ok = true; for (int i = 0; i < X; i++) if (nth_bit(b, i) && nth_bit(b, i + 1)) ok = false; if (ok) valid.push_back(b); } vector<bool> ok(B); for (int b = 0; b < B; b++) { if (nth_bit(b, X) == 0) ok[b] = true; for (int d : ds) for (int i = 0; i < X; i++) if (nth_bit(b, i) && nth_bit(b, i + d)) ok[b] = true; } vector<int> dp(B), dp2(B); auto solve = [&](vector<int>& V) -> int { int N = V.size(); for (int b : valid) dp[b] = 1e9; dp[1] = 0; for (int i = 0; i < N; i++) { for (int b : valid) dp2[b] = dp[b] + 1; for (int b : valid) { int b2 = ((b << V[i]) | 1) & (B - 1); if (ok[b2]) chmin(dp2[b2], dp[b]); } for (int b : valid) dp[b] = dp2[b]; } int ans = 1e9; for (int b : valid) chmin(ans, dp[b]); return ans; }; int ans = 0; vector<int> V; for (int i = 0; i < N; i++) { if (A[i] == 1) { if (V.size()) ans += solve(V); V.clear(); } else { V.push_back(A[i]); } } if (V.size()) ans += solve(V); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long C[4005][4005]; const int mod = 998244853; long long dp[2005][2005]; void norm(long long& x) { while (x < 0) x += mod; while (x >= mod) x -= mod; } int main() { int n, m; cin >> n >> m; C[1][0] = 1; C[1][1] = 1; for (int i = 2; i <= (n + m); i++) { C[i][0] = 1; for (int j = 1; j <= i; j++) { C[i][j] = C[i - 1][j] + C[i - 1][j - 1]; norm(C[i][j]); } } for (int i = 1; i <= n; i++) { dp[i][0] = i; for (int j = 1; j <= m; j++) { dp[i][j] = dp[i - 1][j] + C[i - 1 + j][j]; norm(dp[i][j]); dp[i][j] += dp[i][j - 1] - C[i - 1 + j][i]; norm(dp[i][j]); if (i <= j - 1) dp[i][j] += C[i + j - 1][j - 1] - C[i + j - 1][j], norm(dp[i][j]); } } cout << dp[n][m]; } |
#include <bits/stdc++.h> using namespace std; int n, arr[100005], has[100005], t; vector<int> v[100005]; int main() { cin >> n; for (int i = 1; i <= n; i++) { int a; cin >> a; arr[a]++; has[i] = arr[a]; v[has[i]].push_back(a); t = max(t, has[i]); } for (int i = 0; i < 100000; i++) { int p = v[i].size(); if (p != 0) { int tmp = 0; for (int j = 0; j < p; j++) { tmp += v[i][j]; } if (tmp != ((p * (p + 1)) / 2)) { cout << -1 << endl; return 0; } } } cout << t << endl; for (int i = 1; i <= n; i++) cout << has[i] << ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void _R(T &x) { cin >> x; } void _R(int &x) { scanf( %d , &x); } void _R(long long &x) { scanf( % PRId64, &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R() {} template <typename T, typename... U> void R(T &head, U &...tail) { _R(head); R(tail...); } template <typename T> void _W(const T &x) { cout << x; } void _W(const int &x) { printf( %d , x); } template <typename T> void _W(const vector<T> &x) { for (auto i = x.cbegin(); i != x.cend(); i++) { if (i != x.cbegin()) putchar( ); _W(*i); } } void W() {} template <typename T, typename... U> void W(const T &head, const U &...tail) { _W(head); putchar(sizeof...(tail) ? : n ); W(tail...); } int ans; inline void chkmax(int &a, int b) { if (b > ans) ans = b; if (b > a) a = b; } const int N = 1010; const int K = 11; int n, m, k, dp[K][N][N][2]; char a[N], b[N]; int main() { memset(dp, -1, sizeof(dp)); dp[0][0][0][0] = 0; R(n, m, k, a, b); for (int i = (0); i <= int(k); i++) for (int x = 0; x < int(n); x++) for (int y = 0; y < int(m); y++) for (int j = 0; j < int(2); j++) { int me = dp[i][x][y][j]; if (me == -1) continue; chkmax(dp[i][x + 1][y][0], me); chkmax(dp[i][x][y + 1][0], me); if (a[x] == b[y]) { int ni = i + (j == 0); if (ni <= k) chkmax(dp[i + (j == 0)][x + 1][y + 1][1], me + 1); } } W(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; //.define // #define FILE_IN_OUT #define RET(_x) cout << (_x) << n ; return; #define all(_obj) (_obj).begin(), (_obj).end() #define loop(_n) for (int i = 0; i < (_n); ++i) #define sz(_obj) static_cast<int>((_obj).size()) #ifdef SHJ_LOCAL #define debug(_x) std::cerr << (#_x) << = << (_x) << n << std::flush; #else #define debug(_x) {} #endif #define endl n template <typename P, typename Q> P CeilDiv(P _dividend, Q _divider) { return static_cast<P>((_dividend - 1LL + _divider) / _divider); } template <typename Tp> inline void outarr(Tp _begin, Tp _end, const char* _delim = ) { for (Tp current = _begin; current != _end; ++current) { std::cout << *current << _delim; } std::cout << n ; } //.constant using ll = int64_t; using pii = std::pair<int, int>; constexpr int INF = 0x3f3f3f3f; constexpr int MOD = static_cast<int>(1e9 + 7); //.data bool Ask(int l1, int r1, int l2, int r2) { cout << ? << r1 - l1 + 1 << << r2 - l2 + 1 << endl; for (int i = l1; i <= r1; ++i) { cout << i << ; } cout << endl; for (int i = l2; i <= r2; ++i) { cout << i << ; } cout << endl << flush; int res; cin >> res; return res; } //.code void SolveTask() { int n; cin >> n; int j = -1; for (int i = 2; i <= n; ++i) { if (Ask(1, i - 1, i, i)) { j = i; break; } } vector<int> ans; for (int i = j + 1; i <= n; ++i) { if (!Ask(j, j, i, i)) { ans.push_back(i); } } int l = 1; int r = j - 1; while (l <= r) { int mid = (l + r) >> 1; if (Ask(1, mid, j, j)) { r = mid - 1; } else { l = mid + 1; } } for (int i = 1; i <= r; ++i) { ans.push_back(i); } for (int i = r + 2; i < j; ++i) { ans.push_back(i); } cout << ! << sz(ans) << ; outarr(all(ans)); cout << flush; } int main() { #ifdef FILE_IN_OUT std::ifstream cin( input.txt , std::ios::in); std::ofstream cout( output.txt , std::ios::out); #else std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); #endif int test_cases = 1; cin >> test_cases; for (int yt = 1; yt <= test_cases; ++yt) { SolveTask(); } #ifdef FILE_IN_OUT cin.close(); cout.close(); #endif return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 5e3 + 10; int a[M]; int dp[M][M]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i), dp[i][i] = a[i]; for (int d = 1; d < n; d++) { for (int i = 1; i + d <= n; i++) { int j = i + d; dp[i][j] = dp[i][j - 1] ^ dp[i + 1][j]; } } for (int d = 1; d < n; d++) { for (int i = 1; i + d <= n; i++) { int j = i + d; dp[i][j] = max({dp[i][j], dp[i + 1][j], dp[i][j - 1]}); } } int q, l, r; scanf( %d , &q); while (q--) { scanf( %d%d , &l, &r); printf( %d n , dp[l][r]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long eps = 1e9 + 7; const double inf = 1e-12; bool F(set<pair<int, int> > &a) { pair<int, int> p = *a.rbegin(); a.erase(p); --p.first; if (p.first != 0) { a.insert(p); } if (!a.empty() && a.rbegin()->first == a.begin()->first) { if (p.first != 0) { a.erase(p); } ++p.first; a.insert(p); return true; } if (p.first != 0) { a.erase(p); } ++p.first; a.insert(p); p = *a.begin(); a.erase(p); --p.first; if (p.first != 0) { a.insert(p); } if (!a.empty() && a.rbegin()->first == a.begin()->first) { if (p.first != 0) { a.erase(p); } ++p.first; a.insert(p); return true; } if (p.first != 0) { a.erase(p); } ++p.first; a.insert(p); return false; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; set<pair<int, int> > a; vector<int> b(1e5 + 5); int max1 = 1; for (int i = 1; i <= n; ++i) { int first; cin >> first; a.erase(pair<int, int>(b[first], first)); ++b[first]; a.insert(pair<int, int>(b[first], first)); if (F(a)) { max1 = i; } } cout << max1; return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { bool f = 0; int x = 0; char c = getchar(); while (c < 0 || 9 < c) { if (c == - ) f = 1; c = getchar(); } while ( 0 <= c && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return !f ? x : -x; } const int MAXN = 200000; const int INF = 0x3f3f3f3f; int fa[MAXN + 5], ch[MAXN + 5][2]; long long a[MAXN + 5], siz[MAXN + 5], sum[MAXN + 5], ans[MAXN + 5], all[MAXN + 5], ad[MAXN + 5], de[MAXN + 5]; bool pan(int u) { return ch[fa[u]][1] == u; } bool isroot(int u) { return (ch[fa[u]][0] != u && ch[fa[u]][1] != u); } void PushUp(int u) { sum[u] = sum[ch[u][0]] + sum[ch[u][1]] + siz[u]; all[u] = all[ch[u][0]] + all[ch[u][1]] + siz[u] * a[u]; ans[u] = ans[ch[u][0]] + ans[ch[u][1]] + ad[u] + a[u] * (siz[u] * siz[u] - de[u]) + 2 * a[u] * siz[u] * sum[ch[u][1]] + 2 * all[ch[u][0]] * (sum[u] - sum[ch[u][0]]); return; } void Rotate(int x) { int y = fa[x], z = fa[y], dx = pan(x), dy = pan(y), w = ch[x][dx ^ 1]; if (!isroot(y)) ch[z][dy] = x; ch[x][dx ^ 1] = y, ch[y][dx] = w; if (w) fa[w] = y; fa[y] = x, fa[x] = z; PushUp(y); return; } void Splay(int x) { for (int y = fa[x]; !isroot(x); Rotate(x), y = fa[x]) if (!isroot(y)) Rotate(pan(x) == pan(y) ? y : x); PushUp(x); return; } int Access(int x) { int y = 0; while (x) { Splay(x); siz[x] -= sum[y]; ad[x] -= ans[y]; de[x] -= sum[y] * sum[y]; siz[x] += sum[ch[x][1]]; ad[x] += ans[ch[x][1]]; de[x] += sum[ch[x][1]] * sum[ch[x][1]]; ch[x][1] = y, PushUp(x), y = x, x = fa[x]; } return y; } void Link(int x, int y) { Access(y); Splay(y); Access(x); Splay(x); fa[y] = x; siz[x] += sum[y]; ad[x] += ans[y]; de[x] += 1ll * sum[y] * sum[y]; PushUp(x); return; } void Cut(int x, int y) { Access(x); Splay(x); Splay(y); siz[x] -= sum[y]; ad[x] -= ans[y]; de[x] -= 1ll * sum[y] * sum[y]; fa[y] = 0; PushUp(x); return; } char Re[5]; int f[MAXN + 5]; bool check(int x, int y) { Access(y); Splay(y), Splay(x); return !isroot(y); } int main() { int n = read(); for (int i = 2; i <= n; i++) f[i] = read(); for (int i = 1; i <= n; i++) a[i] = read(), sum[i] = siz[i] = 1, ans[i] = all[i] = a[i]; for (int i = 2; i <= n; i++) Link(f[i], i); Access(1), Splay(1); printf( %.10f n , 1.0 * ans[1] / n / n); int m = read(); for (int i = 1; i <= m; i++) { scanf( %s , Re); if (Re[0] == P ) { int x = read(), y = read(); if (f[x] == y || f[y] == x) goto Break; if (check(x, y)) swap(x, y); Cut(f[x], x), f[x] = y; Link(f[x], x); } else { int x = read(), y = read(); Access(x), Splay(x); a[x] = y; PushUp(x); } Break: Access(1), Splay(1); printf( %.10f n , 1.0 * ans[1] / n / n); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 200005; const int MOD = 1000000007; long long fun(long long a, long long b) { if (a > b) return a; return b; } void swp(long long *a, long long *b) { long long temp = *a; *a = *b; *b = temp; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); ; int n; cin >> n; char ch; long long x, y; cin >> ch >> x >> y; if (x > y) swp(&x, &y); long long mx = x, my = y; n--; while (n--) { cin >> ch >> x >> y; if (x > y) swp(&x, &y); if (ch == + ) { mx = fun(mx, x); my = fun(my, y); } else { if ((x >= mx && y >= my) || (x >= my && y >= mx)) cout << YES n ; else cout << NO n ; } } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } long long power(long long b, long long e) { if (e == 0) return 1; if (e % 2) return ((b * power((b) * (b), (e - 1) / 2))); else return power((b) * (b), e / 2); } long long modpower(long long b, long long e, long long q) { long long MOD = q; if (e == 0) return 1; if (e % 2) return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD; else return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD; } void dpv(vector<long long> v) { for (long long i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << n ; } void dpv(vector<pair<long long, long long> > v) { for (long long i = 0; i < v.size(); i++) { cout << v[i].first << << v[i].second << n ; } } void dpv(set<long long> v) { for (auto i : v) { cout << i << ; } cout << n ; } void oblivious() { string s; cin >> s; long long p = 0, ans = 0, q = 1; for (long long i = 0; i <= s.length(); i++) { if (s[i] == + || s[i] == - || i == s.length()) { ans += p * q; p = 0; if (i == s.length()) { continue; } if (s[i] == + ) { q = 1; } else if (s[i] == - ) { q = -1; } } else { p = (10 * p + s[i] - 0 ); } } long long u = ans; long long y = 0; string s1; if (u == 0) { s1.push_back( 0 ); } else { while (u != 0) { s1.push_back(u % 10 + 0 ); u = u / 10; } } reverse(s1.begin(), s1.end()); for (long long i = 0; i < s1.length(); i++) { long long z = s1[i]; while (z--) { cout << + ; } cout << .> ; cout << n ; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { oblivious(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; t = 1; while (t--) { int n; cin >> n; int cnt1 = 0, cnt2 = 0, x; for (int i = 0; i < n; i++) { cin >> x; if (x % 2 == 0) cnt1++; else cnt2++; } if (cnt2 % 2 == 0) { cout << cnt1 << endl; } else cout << cnt2 << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int test = 0; test < t; test++) { bool answer = true; int n; cin >> n; vector<int> a(n); vector<int> b(n); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; unordered_map<int, int> keys_to_counts; keys_to_counts[1] = 0; keys_to_counts[-1] = 0; keys_to_counts[0] = 0; for (int x : a) { keys_to_counts[x]++; } keys_to_counts[a[n - 1]]--; for (int i = n - 1; i >= 0; i--) { if (b[i] > a[i]) { answer &= (keys_to_counts[1] > 0); } else if (b[i] < a[i]) { answer &= (keys_to_counts[-1] > 0); } if (i != 0) keys_to_counts[a[i - 1]]--; } if (answer) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long arr[200000], cum[200000]; unsigned long long forone; unsigned long long n; unsigned long long make(unsigned long long st, unsigned long long mult, unsigned long long lim, unsigned long long level) { if (st > n) return 0; unsigned long long end = min(n, st + lim - 1); return make(end + 1, mult, lim * mult, level + 1) + (cum[end] - cum[st - 1]) * level; } bool comp(int p, int q) { return p > q; } int main() { while (cin >> n) { unsigned long long i; for (i = 1; i <= n; i++) cin >> arr[i]; sort(&arr[1], &arr[n + 1], comp); cum[0] = 0; forone = 0; for (i = 1; i <= n; i++) { forone += (i - 1) * arr[i]; cum[i] = cum[i - 1] + arr[i]; } unsigned long long q; cin >> q; unsigned long long tem; for (i = 1; i <= q; i++) { cin >> tem; if (tem == 1) { cout << forone; if (i != q) cout << ; continue; } cout << make(2, tem, tem, 1); if (i != q) cout << ; } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int x, t, a, b, da, db, i, j, p, ans = 0; int main() { scanf( %d %d %d %d %d %d , &x, &t, &a, &b, &da, &db); i = 0; for (i = 0; i < t; i++) for (j = 0; j < t; j++) { if (a - i * da + b - j * db == x) ans = 1; } for (i = 0; i < t; i++) if (a - i * da == x || b - i * db == x) ans = 1; if (ans == 1 || x == 0) printf( YES ); else printf( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, a, b; cin >> n >> a >> b; long long left = a; long long right = n - b - 1; long long end = max(left, right); long long ans = n - end; cout << ans; } |
#include <bits/stdc++.h> using namespace std; int n, p, start[390000], fin[390000]; map<pair<int, int>, int> mp; int main() { scanf( %d %d , &n, &p); vector<int> cnt(n, 0); for (int i = 0; i < n; i++) { int x, y; scanf( %d %d , &x, &y); x--; y--; if (x > y) swap(x, y); start[i] = x; fin[i] = y; cnt[x]++; cnt[y]++; mp[make_pair(x, y)]++; } vector<int> cnt2(cnt.begin(), cnt.end()); sort(cnt.begin(), cnt.end()); long long ans = 0; int j = n; for (int i = 0; i < n; i++) { while (j - 1 >= i && cnt[i] + cnt[j - 1] >= p) j--; if (j < i + 1) j = i + 1; ans += n - j; } for (int i = 0; i < n; i++) { if (cnt2[start[i]] + cnt2[fin[i]] < p) continue; if (cnt2[start[i]] + cnt2[fin[i]] - mp[make_pair(start[i], fin[i])] < p) ans--; mp[make_pair(start[i], fin[i])] = 0; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 5; int main() { int n, que[maxn]; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &que[i]); sort(que, que + n); if (n % 2 == 0) n--; printf( %d n , que[n / 2]); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; int n, k, x, y; set<pair<int, int> > s; vector<pair<int, int> > a[MAXN]; vector<int> ans; inline void start() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %d%d , &x, &y); a[x].push_back({y, i}); } } inline void solve() { for (int i = 1; i <= 2e5 + 1; i++) { for (int j = 0; j < a[i].size(); j++) s.insert(a[i][j]); while (s.size() > k) { ans.push_back((--s.end())->second); s.erase(--s.end()); } while (!s.empty() && s.begin()->first == i) s.erase(s.begin()); } sort(ans.begin(), ans.end()); printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d , ans[i]); puts( ); } int main() { start(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, k, sum = 0; cin >> n; pair<int, int> a[n]; for (i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; } sort(a, a + n); for (i = 0; i < n; i++) { sum = sum + ((a[n - i - 1].first * i) + 1); } cout << sum << n ; for (i = 0; i < n; i++) cout << a[n - i - 1].second + 1 << ; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = +100500; const long long INF = 4e18; long long a[MAXN]; int main() { long long n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (k >= 3) { sort(a + 1, a + n + 1); cout << a[n]; return 0; } if (k == 1) { sort(a + 1, a + n + 1); cout << a[1]; return 0; } multiset<long long> b; multiset<long long> c; for (int i = 1; i <= n; i++) { c.insert(a[i]); } long long ans = -INF; long long pt = 1; while (pt < n) { b.insert(a[pt]); c.erase(c.equal_range(a[pt]).first); long long x = max(*c.begin(), *b.begin()); ans = max(ans, x); pt++; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long a, b; bool check(int k, int x, int y) { long long ca = 1LL * k * x; long long cb = 1LL * k * y; return ca <= a && cb <= b; } long long gcd(long long a, long long b) { if (!b) return a; else return gcd(b, a % b); } int main() { int x, y; cin >> a >> b >> x >> y; int l = 1, r = 2 * 1e9; long long ans = 2e9 + 1; long long g = gcd(x, y); x /= g; y /= g; while (l <= r) { int mid = (l + r) >> 1; if (check(mid, x, y)) { ans = mid; l = mid + 1; } else r = mid - 1; } if (ans == 2e9 + 1) cout << 0 0 << endl; else cout << x * ans << << y * ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000005; int n, k; int v[N], c[N], p[N]; double f[N]; double C(int n, int m) { return f[n] - f[m] - f[n - m]; } struct Node { int Max, Min; } node[N * 4]; void pushup(int x) { node[x].Max = max(node[((x << 1) + 1)].Max, node[((x << 1) + 2)].Max); node[x].Min = min(node[((x << 1) + 1)].Min, node[((x << 1) + 2)].Min); } void build(int l, int r, int x = 0) { if (l == r) { node[x].Max = v[l]; node[x].Min = c[l]; return; } int mid = (l + r) >> 1; build(l, mid, ((x << 1) + 1)); build(mid + 1, r, ((x << 1) + 2)); pushup(x); } int Max1, Min1; void rmq(int l, int r, int L = 1, int R = n, int x = 0) { if (L >= l && R <= r) { Max1 = max(Max1, node[x].Max); Min1 = min(Min1, node[x].Min); return; } int mid = (L + R) >> 1; if (l <= mid) rmq(l, r, L, mid, ((x << 1) + 1)); if (r > mid) rmq(l, r, mid + 1, R, ((x << 1) + 2)); } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &v[i]); for (int i = 1; i <= n; i++) scanf( %d , &c[i]); p[n] = min(v[n] * 100, c[n]); int pre = n; int Max = v[n], Min = c[n]; for (int i = n - 1; i >= 1; i--) { Max = max(Max, v[i]); Min = min(Min, c[i]); if (min(Max * 100, Min) < min(v[i] * 100, c[i])) Max = v[i], Min = c[i]; p[i] = min(Max * 100, Min); } sort(p + 1, p + 1 + n); for (int i = 1; i <= n; i++) f[i] = f[i - 1] + log(i * 1.0); double ans = 0; for (int i = 1; i <= n; i++) { if (k - 1 > n - i) break; ans += exp(log(p[i] * 1.0) + C(n - i, k - 1) - C(n, k)); } printf( %.12f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int inv(long long int k) { long long int vl = 1000000007 - 2; long long int val = 1; long long int b = k; for (int i = 0; i < 63; i++) { if ((vl >> i) & 1) { val *= b; val %= 1000000007; } b = b * b; b %= 1000000007; } return val; } int main() { string s; cin >> s; long long int l = s.size(); vector<long long int> vr(l + 1), op(l + 1); vr[0] = 1; for (int i = 1; i <= l; i++) { vr[i] = i * vr[i - 1]; vr[i] %= 1000000007; } for (int i = 0; i < l; i++) { if (s[i] == ( ) op[i + 1]++; op[i + 1] += op[i]; } long long int ans = 0; for (int i = 0; i < l; i++) { if (s[i] == ) ) continue; long long int v = op[i + 1]; long long int v1 = op[l] - op[i + 1]; v1 = l - i - 1 - v1; if (v1 == 0) continue; long long int n = v + v1 - 1; long long int k = v; k = (vr[k] * vr[n - k]) % 1000000007; k = inv(k); k = (vr[n] * k) % 1000000007; ans += k; ans %= 1000000007; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, temp; cin >> n; long long int sum = 0, sum2 = 0; for (int i = 0; i < n; i++) { cin >> temp; sum += temp; } for (int i = 0; i < n - 1; i++) { cin >> temp; sum2 += temp; } cout << sum - sum2 << endl; sum = 0; for (int i = 0; i < n - 2; i++) { cin >> temp; sum += temp; } cout << sum2 - sum; return 0; } |
#include <bits/stdc++.h> using namespace std; int inf_int = 1e9; long long inf_ll = 1e16; const double pi = 3.1415926535898; const int mod = 1e9 + 9; const int MAXN = 2e5 + 100; bool debug = false; char a[1005][1005]; char used[1005][1005][4][3]; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int n, m; inline bool is_ok(int x, int y, int d, int z) { return x >= 1 && x <= n && y >= 1 && y <= m && z <= 2 && a[x][y] != * && !used[x][y][d][z]; } void solve() { cin >> n >> m; int x1, y1; for (int i = 1; i <= n; ++i) { for (int e = 1; e <= m; ++e) { cin >> a[i][e]; if (a[i][e] == S ) { x1 = i; y1 = e; } } } queue<pair<pair<int, int>, pair<int, int> > > q; used[x1][y1][0][0] = 1; used[x1][y1][1][0] = 1; used[x1][y1][2][0] = 1; used[x1][y1][3][0] = 1; q.push({{x1, y1}, {0, 0}}); q.push({{x1, y1}, {1, 0}}); q.push({{x1, y1}, {2, 0}}); q.push({{x1, y1}, {3, 0}}); while (!q.empty()) { int x = q.front().first.first, y = q.front().first.second; int d = q.front().second.first, z = q.front().second.second; q.pop(); if (is_ok(x + dx[d], y + dy[d], d, z)) { q.push({{x + dx[d], y + dy[d]}, {d, z}}); used[x + dx[d]][y + dy[d]][d][z] = 1; } for (int i = 0; i < 4; ++i) { if (is_ok(x + dx[i], y + dy[i], i, z + 1)) { q.push({{x + dx[i], y + dy[i]}, {i, z + 1}}); used[x + dx[i]][y + dy[i]][i][z + 1] = 1; } } } for (int i = 1; i <= n; ++i) { for (int e = 1; e <= m; ++e) { if (a[i][e] == T ) { for (int j = 0; j < 4; ++j) { for (int f = 0; f <= 2; ++f) { if (used[i][e][j][f]) { cout << YES ; return; } } } } } } cout << NO ; } int main() { if (!debug) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300005; int n, k, pos[N]; long long c[N], ans; vector<int> v; priority_queue<pair<long long, int> > q; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %lld , &c[i]); for (int i = 1; i <= n + k; i++) { if (i <= n) q.push(make_pair(c[i], i)); if (k < i) { int x = q.top().second; long long w = q.top().first; q.pop(); ans += w * ((long long)i - (long long)x); v.push_back(x); } } printf( %lld n , ans); for (int i = 0; i < v.size(); i++) pos[v[i]] = i + k + 1; for (int i = 1; i <= n; i++) printf( %d , pos[i]); return 0; } |
#include <bits/stdc++.h> int mod = 1000000007; const double pi = 3.141592653689793238460; const int inf = 0x3f3f3f3f; using namespace std; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; int a[10005]; for (int i = 0; i < n; i++) cin >> a[i]; vector<int> pos; for (int i = 0; i < n; i++) { int x = a[i]; while (x > 0) { pos.push_back(x); x /= 2; } } int ans = inf; for (auto x : pos) { vector<int> cur; for (int i = 0; i < n; i++) { int cnt = 0; int y = a[i]; while (y > x) { y /= 2; cnt++; } if (y == x) { cur.push_back(cnt); } } if (cur.size() < k) continue; sort(cur.begin(), cur.end()); ans = min(ans, accumulate(cur.begin(), cur.begin() + k, 0)); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 6; int g[N]; int main() { int n, m, v, i; cin >> n >> m >> v; long long top = 1 + (n - 1) * (n - 2) / 2; if (n - 1 > m || top < (long long)m) { cout << -1; return 0; } --v; for (i = 0; i < n; ++i) g[i] = i; swap(g[1], g[v]); for (i = 0; i < n - 1; ++i) { cout << g[i] + 1 << << g[i + 1] + 1 << endl; --m; } int j; for (i = 1; i < n - 1 && m; ++i) { for (j = i + 2; j < n && m; ++j) { cout << g[i] + 1 << << g[j] + 1 << endl; --m; } } return 0; } |
#include <bits/stdc++.h> using namespace std; double M; struct E { int x, y, z, tp, id; bool operator<(const E yy) const { double p1 = tp ? z : z + M, p2 = yy.tp ? yy.z : yy.z + M; return p1 < p2; } } e[100005]; int n, m, k, fa[50005], p[50005], d[50005]; int gf(int x) { return fa[x] == x ? x : fa[x] = gf(fa[x]); } int Calc(double mid, int r) { for (int i = 1; i <= n; i++) fa[i] = i; M = mid, sort(e + 1, e + m + 1); int ans[2] = {0}, w = n - 1; for (int i = 1; i <= m; i++) { int fx = gf(e[i].x), fy = gf(e[i].y); if (fx == fy) continue; ans[1] += e[i].z, ans[0] += !e[i].tp; if (r && ans[0] > k) { ans[1] -= e[i].z, ans[0] -= !e[i].tp; continue; } fa[fx] = fy, w--; if (r) p[++p[0]] = e[i].id; } if (w) puts( -1 ), exit(0); return ans[r]; } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1, x, y, z; i <= m; i++) scanf( %d%d%d , &x, &y, &z), e[i] = {x, y, z, !(x == 1 || y == 1), i}, d[x]++, d[y]++; if (d[1] < k || (n > 1 && !k)) return puts( -1 ), 0; double l = -100001, r = 100001, ans = 0; while (r - l > 1e-8) { double mid = (l + r) / 2; int w = Calc(mid, 0); if (w == k) { ans = mid; break; } if (r - l < 0.1 && w > k) { ans = mid; break; } if (w < k) r = mid; else ans = mid, l = mid; } Calc(ans, 1); printf( %d n , n - 1); while (p[0]) printf( %d , p[p[0]--]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, tot, X, Y, a[25][25], d[25], id[25][25]; double p[25], b[500][2], c[500][500], ans[25]; void work() { scanf( %d %d %d %d , &n, &m, &X, &Y); if (X == Y) { for (int i = 1; i <= n; i++) printf( %.10lf , 1.0 * int(i == X)); return; } for (int i = 1, x, y; i <= m; i++) scanf( %d %d , &x, &y), a[x][y] = a[y][x] = 1, d[x]++, d[y]++; for (int i = 1; i <= n; i++) scanf( %lf , &p[i]); for (int i = 1; i <= n; i++) for (int j = i; j <= n; j++) id[i][j] = id[j][i] = ++tot; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) { int x = id[i][j]; double q = 1 - p[i] * p[j]; for (int k = 1; k <= n; k++) if (a[i][k]) for (int l = 1; l <= n; l++) if (a[j][l]) c[x][id[k][l]] += (1 - p[i]) * (1 - p[j]) / d[i] / d[j] / q; for (int k = 1; k <= n; k++) if (a[i][k]) c[x][id[k][j]] += (1 - p[i]) * p[j] / d[i] / q; for (int k = 1; k <= n; k++) if (a[j][k]) c[x][id[i][k]] += p[i] * (1 - p[j]) / d[j] / q; } b[id[X][Y]][0] = 1; for (int T = 5000; T; T--) { for (int i = 1; i <= tot; i++) for (int j = 1; j <= tot; j++) b[j][1] += b[i][0] * c[i][j]; for (int i = 1; i <= tot; i++) b[i][0] = b[i][1], b[i][1] = 0; for (int i = 1; i <= n; i++) ans[i] += b[id[i][i]][0]; } for (int i = 1; i <= n; i++) printf( %.10lf , ans[i]); } int main() { work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int h, w, ii, jj, ans = 0; cin >> h >> w; char a[505][505]; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) cin >> a[i][j]; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (a[i][j] == * ) { if ((i - 1 >= 0 && a[i - 1][j] == * ) && (j - 1 >= 0 && a[i][j - 1] == * ) && (i + 1 <= h - 1 && a[i + 1][j] == * ) && (j + 1 <= w - 1 && a[i][j + 1] == * )) { ii = i; jj = j; ans = 1; while (ii >= 0 && a[ii][jj] == * ) { a[ii][jj] = @ ; ii--; } ii = i; a[ii][jj] = * ; while (jj >= 0 && a[ii][jj] == * ) { a[ii][jj] = @ ; jj--; } jj = j; a[ii][jj] = * ; while (ii < h && a[ii][jj] == * ) { a[ii][jj] = @ ; ii++; } ii = i; a[ii][jj] = * ; while (jj < w && a[ii][jj] == * ) { a[ii][jj] = @ ; jj++; } jj = j; break; } } } if (ans == 1) break; } if (ans == 0) { cout << NO ; return 0; } for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (a[i][j] == * ) ans = 0; } } if (ans == 0) { cout << NO ; } else cout << YES ; } |
#include <bits/stdc++.h> using namespace std; long long fac[100001]; long long inv_fac[100001]; int val[100001]; vector<int> cnt(53, 0); int l[100001]; int r[100001]; long long keep[53][53]; long long dp[54][100001]; long long dp1[54][100001]; long long mod = 1e9 + 7; inline void add(long long &a, long long b) { a += b; if (a >= mod) a -= mod; } inline void sub(long long &a, long long b) { a -= b; if (a < 0) a += mod; } long long pw(long long x, int p) { if (p == 0) return 1; if (p == 1) return x % mod; long long temp = pw(x, p / 2); temp = (temp * temp) % mod; if (p % 2 == 0) return temp; temp = (x * temp) % mod; return temp; } void calc() { fac[0] = fac[1] = 1; inv_fac[0] = inv_fac[1] = 1; for (int i = 2; i <= 100000; i++) { fac[i] = (i * fac[i - 1]) % mod; inv_fac[i] = pw(fac[i], mod - 2); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; cin >> s; int q; cin >> q; for (int i = 0; i < q; i++) cin >> l[i] >> r[i]; int n = s.size(); int mx = n / 2; calc(); for (int i = 0; i < n; i++) { if (s[i] >= a && s[i] <= z ) { val[i + 1] = int(s[i] - a ) + 1; cnt[int(s[i] - a ) + 1]++; } else { val[i + 1] = 26 + int(s[i] - A ) + 1; cnt[26 + int(s[i] - A ) + 1]++; } } for (int i = 1; i <= 52; i++) { int temp = cnt[i]; if (temp > n / 2 || cnt[i] == 0) { continue; } temp = n / 2 - temp; for (int w = 0; w <= mx; w++) dp[0][w] = dp1[53][w] = 0; dp[0][0] = dp1[53][0] = 1; for (int k = 1; k <= 52; k++) { if (k == i || cnt[k] == 0) { for (int w = 0; w <= mx; w++) dp[k][w] = dp[k - 1][w]; continue; } for (int w = 0; w <= mx; w++) { dp[k][w] = dp[k - 1][w]; if (w >= cnt[k]) add(dp[k][w], dp[k - 1][w - cnt[k]]); } } for (int k = 52; k >= 1; k--) { if (k == i || cnt[k] == 0) { for (int w = 0; w <= mx; w++) dp1[k][w] = dp1[k + 1][w]; continue; } for (int w = 0; w <= mx; w++) { dp1[k][w] = dp1[k + 1][w]; if (w >= cnt[k]) add(dp1[k][w], dp1[k + 1][w - cnt[k]]); } } for (int k = i; k <= 52; k++) { if (k == i) { keep[k][i] = dp[52][temp]; continue; } long long t1 = 0; int rem = temp - cnt[k]; if (rem < 0) { keep[k][i] = keep[i][k] = 0; continue; } for (int w = 0; w <= rem; w++) { long long t2 = (dp[k - 1][w] * dp1[k + 1][rem - w]) % mod; add(t1, t2); } keep[i][k] = keep[k][i] = t1; } } long long ans = (fac[n / 2] * fac[n / 2]) % mod; for (int i = 1; i <= 52; i++) ans = (ans * inv_fac[cnt[i]]) % mod; ans = (2 * ans) % mod; for (int i = 0; i < q; i++) { int x = val[l[i]]; int y = val[r[i]]; long long temp = ans; temp = (temp * keep[x][y]) % mod; cout << temp << endl; } } |
#include <bits/stdc++.h> using namespace std; const long long N = 100010, M = 100010, inf = 1e18; long long m, n, p, d[N], a[M], f[M], sum[M], g[M], x[M], y[M]; inline long long read() { char ch = getchar(); long long as = 0, f = 1; for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) as = as * 10 + ch - 0 ; return as; } long long q[M << 1], l, r; long long as = inf; int main() { long long h, t; n = read(); m = read(); p = read(); for (long long i = 1; i < n; i++) d[i] = read(); for (long long i = n - 2; i; i--) d[i] += d[i + 1]; for (long long i = 1; i <= m; i++) { h = read(); t = read(); a[i] = t + d[h]; } sort(a + 1, a + m + 1); for (long long i = 1; i <= m; i++) sum[i] = sum[i - 1] + a[i], f[i] = inf; for (long long i = 1; i <= p; i++) { memcpy(g, f, sizeof(g)); l = M; r = M; for (long long j = 0; j <= m; j++) y[j] = g[j] + sum[j]; q[r] = 0; for (long long j = 1; j <= m; j++) { while (r > l) if ((y[q[l + 1]] - y[q[l]]) <= a[j] * (q[l + 1] - q[l])) l++; else break; f[j] = min(g[j], -a[j] * q[l] + y[q[l]] + a[j] * j - sum[j]); while (r > l) if ((y[q[r]] - y[q[r - 1]]) * (j - q[r]) >= (y[j] - y[q[r]]) * (q[r] - q[r - 1])) r--; else break; r++; q[r] = j; } as = min(as, f[m]); } printf( %lld , as); return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e5 + 5; vector<pair<long long, long long>> v; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long x, y, bx, by, xs, ys, t, temp1, temp2, temp; long long ax, ay; int ans = 0; cin >> x >> y >> ax >> ay >> bx >> by >> xs >> ys >> t; while (x <= 5e16 && y <= 5e16) { v.push_back({x, y}); x = ax * x + bx; y = ay * y + by; } for (int i = 0; i < v.size(); i++) { for (int j = i; j < v.size(); j++) { temp = abs(v[i].first - v[j].first) + abs(v[i].second - v[j].second); temp1 = abs(v[i].first - xs) + abs(v[i].second - ys); temp2 = abs(xs - v[j].first) + abs(ys - v[j].second); if (temp + temp1 <= t) { ans = max(ans, j - i + 1); } if (temp + temp2 <= t) { ans = max(ans, j - i + 1); } } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int f[101010]; long long s[101010]; long long a[101010]; int main() { ios_base::sync_with_stdio(0); long long n, l; cin >> n >> l; for (int i = 1; i <= n; ++i) cin >> a[i]; sort(a + 1, a + n + 1); if (n == 1) { cout << fixed << setprecision(10) << (long double)max(a[1], l - a[1]); return 0; } a[0] = 0; long long ans = 0; a[n + 1] = l; for (int i = 1; i <= n + 1; ++i) ans = max(ans, a[i] - a[i - 1]); ans = max(ans, max(a[1] * 2, (a[n + 1] - a[n]) * 2)); cout << fixed << setprecision(10) << (long double)(ans / 2.0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 501; int dp[maxn][maxn]; int n; int a[maxn]; int dp2[maxn]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], dp[i][i] = a[i]; for (int len = 1; len <= n; len++) { for (int i = 1; i <= n - len + 1; i++) { for (int k = i; k < i + len - 1; k++) { if (dp[i][k] != 0 && dp[i][k] == dp[k + 1][i + len - 1]) { dp[i][i + len - 1] = dp[i][k] + 1; } } } } for (int i = 1; i <= n; i++) { dp2[i] = dp2[i - 1] + 1; for (int j = 1; j < i; j++) { if (dp[j][i] > 0) { dp2[i] = min(dp2[i], dp2[j - 1] + 1); } } } printf( %d n , dp2[n]); return 0; } |
#include <bits/stdc++.h> const int N = 1000010, P = 1000000007; int n, i, j, x, ans, po[N], a[N], f[N]; int main() { scanf( %d , &n); for (po[0] = i = 1; i <= n; i++) po[i] = 2 * po[i - 1] % P; while (n--) scanf( %d , &x), a[x]++; for (i = N - 1; i > 1; i--) { for (j = i, x = 0; j < N; j += i) x += a[j]; if (x) { f[i] = 1LL * x * po[x - 1] % P; for (j = i + i; j < N; j += i) f[i] = (f[i] - f[j] + P) % P; ans = (1LL * f[i] * i + ans) % P; } } printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; vector<int> a; int x; int main() { while (cin >> x) { a.push_back(x); } if (((a[3] - a[2]) == (a[2] - a[1])) && ((a[2] - a[1]) == (a[1] - a[0]))) { cout << a[3] + a[3] - a[2] << endl; return 0; } else { if (a[0] != 0) { if (a[1] != 0) { if (a[1] != a[0]) { if ((((double)a[1] / a[0]) == ((double)a[2] / a[1])) && (((double)a[2] / a[1]) == ((double)a[3] / a[2]))) { if ((int)(a[3] * ((double)a[3] / a[2])) == (a[3] * ((double)a[3] / a[2]))) { cout << a[3] * ((double)a[3] / a[2]) << endl; return 0; } } } } } } cout << 42 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T __sqr(const T x) { return x * x; } template <class T, class X> inline T __pow(T a, X y) { T z = 1; for (int i = 1; i <= y; i++) { z *= a; } return z; } template <class T> inline T gcd(T a, T b) { a = abs(a); b = abs(b); if (!b) return a; return __gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { a = abs(a); b = abs(b); return (a / __gcd(a, b)) * b; } inline bool ispow2(int x) { return (x != 0 && (x & (x - 1)) == 0); } template <class T> void UpdateMin(T &x, T y) { if (y < x) { x = y; } } template <class T> void UpdateMax(T &x, T y) { if (x < y) { x = y; } } template <class T, class X, class Y> inline T bigmod(T n, X m, Y mod) { unsigned long long ret = 1, a = n % mod; while (m) { if (m & 1) ret = (ret * a) % mod; m >>= 1; a = (a * a) % mod; } ret %= mod; return (T)ret; } template <class T, class Y> inline T modinv(T n, Y mod) { return bigmod(n, mod - 2, mod); } template <class T, class X> int getbit(T s, X i) { return (s >> i) & 1; } template <class T, class X> T onbit(T s, X i) { return s | (T(1) << i); } template <class T, class X> T offbit(T s, X i) { return s & (~(T(1) << i)); } template <class T> inline void read(T &n) { char c; for (c = getchar(); !(c >= 0 && c <= 9 ); c = getchar()) ; n = c - 0 ; for (c = getchar(); c >= 0 && c <= 9 ; c = getchar()) n = n * 10 + c - 0 ; } void extended_euclid(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return; } long long first, second; extended_euclid(b, a % b, first, second); x = second; y = first - (a / b) * second; } pair<long long, pair<long long, long long> > extendedEuclid(long long a, long long b) { long long x = 1, y = 0; long long xLast = 0, yLast = 1; long long q, r, m, n; while (a != 0) { q = b / a; r = b % a; m = xLast - q * x; n = yLast - q * y; xLast = x, yLast = y; x = m, y = n; b = a, a = r; } return make_pair(b, make_pair(xLast, yLast)); } const long long mod[] = {0, 1000000007, 1000000009, 1000000021, 1000000033, 1000000097, 1000000093, 1000000097, 1000000103}; const long long base[] = {0, 1000003, 1000033, 1000037, 1000039, 1000081, 1000099, 1000117, 1000121}; int a[(2000 + 20)], b[(2000 + 20)], pos[(2000 + 20)], loc[(2000 + 20)]; vector<pair<int, int> > ans; int main() { int n; 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); swap(a[i], b[i]); } for (int i = 1; i <= n; i++) { pos[a[i]] = i; } for (int i = 1; i <= n; i++) { b[i] = pos[b[i]]; loc[b[i]] = i; } int tot = 0; for (int i = n; i >= 1; i--) { if (i == b[i]) continue; tot += i - loc[i]; int idx = loc[i]; for (int j = idx + 1; j <= i; j++) { if (b[j] <= 0) assert(0); if (idx >= b[j]) { if (idx > 2000) assert(1 > 0); else ans.push_back(make_pair(idx, j)); loc[b[j]] = idx; swap(b[j], b[idx]); idx = j; } } } printf( %d n , tot); printf( %d n , ans.size()); for (int i = 0; i < ((int)ans.size()); i++) { printf( %d %d n , ans[i].first, ans[i].second); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> istream& operator>>(istream& in, vector<T>& vec) { for (auto& v : vec) { in >> v; } return in; } template <class T> ostream& operator<<(ostream& o, const vector<T>& vec) { o << [ ; for (const auto& v : vec) { o << v << ; } o << ] n ; return o; } int main() { int n, m, t; cin >> n >> m >> t; vector<vector<int>> mat(n, vector<int>(m)); vector<vector<int>> bsm(m); cin >> mat; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (mat[i][j] != 2) { bsm[j].push_back(i); } } } while (t--) { int colI, rowI = -1; cin >> colI; colI--; while (true) { int newRowI = n; { auto& bsv = bsm[colI]; int l = 0, r = bsv.size(), m; while (l < r) { m = (l + r) / 2; if (bsv[m] < rowI) { l = m + 1; } else { r = m; } } if (l < bsv.size()) { newRowI = bsv[l]; int i = l + 1; for (; i < bsv.size() && bsv[i] == bsv[l]; i++) { } if (i < bsv.size()) { for (int a = l; a < i; a++) { bsv[a] = bsv[i]; } } else { while (i-- > l) { bsv.pop_back(); } } } } rowI = newRowI; if (rowI >= n) { cout << colI + 1 << ; break; } else { if (mat[rowI][colI] == 1) { colI++; } else { colI--; } } } } cout << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; int n, m, ans[N], h[N]; bitset<N> a[N]; vector<int> e[N]; bool check1() { for (int i = (int)(1); i <= (int)(n); i++) if (e[i].size() & 1) return 0; return 1; } void gauss() { int it = 1; for (int i = (int)(1); i <= (int)(n); i++) { int j = it; for (; j <= n; j++) if (a[j][i]) break; if (j > n) continue; if (j > it) swap(a[j], a[it]); h[it] = i; for (int j = (int)(it + 1); j <= (int)(n); j++) if (a[j][i]) a[j] ^= a[it]; it++; } int las = n + 1; for (int i = (int)(it - 1); i >= (int)(1); i--) { for (int j = (int)(h[i] + 1); j <= (int)(las - 1); j++) ans[j] = 0; ans[h[i]] = a[i][0]; for (int j = (int)(1); j <= (int)(i - 1); j++) if (a[j][h[i]]) a[j] ^= a[i]; las = h[i]; } for (int i = (int)(1); i <= (int)(las - 1); i++) ans[i] = 0; } void solve() { scanf( %d%d , &n, &m); for (int i = (int)(1); i <= (int)(n); i++) e[i].clear(); for (int i = (int)(1); i <= (int)(m); i++) { int x, y; scanf( %d%d , &x, &y); e[x].push_back(y); e[y].push_back(x); } if (check1()) { puts( 1 ); for (int i = (int)(1); i <= (int)(n); i++) printf( 1 ); puts( ); return; } for (int i = (int)(1); i <= (int)(n); i++) { a[i] = 0; for (auto j : e[i]) a[i].set(j); if (e[i].size() & 1) a[i].set(i), a[i].set(0); } memset(ans, 0, sizeof(ans)); gauss(); puts( 2 ); for (int i = (int)(1); i <= (int)(n); i++) printf( %d , ans[i] + 1); puts( ); } int main() { int T; scanf( %d , &T); while (T--) solve(); } |
#include <bits/stdc++.h> #pragma warning(disable : 4786) #pragma comment(linker, /STACK:16777216 ) using namespace std; int A[100005]; int I[100005]; int D[100005]; int n; int max(int a, int b) { if (a > b) return a; return b; } int ABS(int a) { if (a < 0) return a = a * -1; return a; } int main() { int i, j, len, res, cur, res1; while (scanf( %d , &n) != EOF) { for (i = 0; i < n; i++) { scanf( %d , &A[i]); } I[0] = 1; for (i = 1; i < n; i++) { if (A[i] > A[i - 1]) { I[i] = I[i - 1] + 1; } else { I[i] = 1; } } D[n - 1] = 1; for (i = n - 1; i >= 0; i--) { if (A[i] < A[i + 1]) { D[i] = D[i + 1] + 1; } else { D[i] = 1; } } res = 1; for (i = 0; i < n; i++) { if (i == 0) { if (i + 1 < n) res = max(res, D[i + 1] + 1); } else if (i == n - 1) { if (i - 1 >= 0) res = max(res, I[i - 1] + 1); } else { int r = I[i - 1] + D[i + 1]; if (ABS(A[i - 1] - A[i + 1]) > 1 && A[i + 1] > A[i - 1]) { res = max(res, r + 1); } res = max(res, I[i - 1] + 1); res = max(res, D[i + 1] + 1); } } printf( %d n , res); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; long long POW(long long a, long long b, long long MMM = MOD) { long long ret = 1; for (; b; b >>= 1, a = (a * a) % MMM) if (b & 1) ret = (ret * a) % MMM; return ret; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long lcm(long long a, long long b) { if (a == 0 || b == 0) return a + b; return a * (b / gcd(a, b)); } int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1}; int ddx[] = {-1, -2, 1, -2, 2, -1, 2, 1}, ddy[] = {-2, -1, -2, 1, -1, 2, 1, 2}; struct Edge { int to, r; Edge* ori; Edge* rev; Edge(int T, int R) { to = T, r = R; } }; vector<Edge*> v[2605]; void addedge(int f, int t, int r) { Edge* ori = new Edge(t, r); Edge* rev = new Edge(f, 0); ori->rev = rev; rev->rev = ori; v[f].push_back(ori); v[t].push_back(rev); } const int S = 2603, T = 2604; int level[2605], work[2605]; bool bfs() { memset((level), -1, sizeof(level)); ; level[S] = 0; queue<int> q; q.push(S); while (!q.empty()) { int x = q.front(); q.pop(); for (auto& nn : v[x]) { int next = nn->to; if (level[next] == -1 && nn->r > 0) { level[next] = level[x] + 1; q.push(next); } } } return level[T] != -1; } int dfs(int N, int des, int flow) { if (N == des) return flow; for (int& i = work[N]; i < v[N].size(); i++) { int next = v[N][i]->to; if (level[next] == level[N] + 1 && v[N][i]->r > 0) { int df = dfs(next, des, min(v[N][i]->r, flow)); if (df > 0) { v[N][i]->r -= df; v[N][i]->rev->r += df; return df; } } } return 0; } int main() { int n, h, m; scanf( %d%d%d , &n, &h, &m); int ans = n * h * h; for (int(i) = (0); (i) <= (n - 1); (i) += (1)) { addedge(S, i * 51, h * h); for (int(j) = (1); (j) <= (h); (j) += (1)) addedge(51 * i + j - 1, 51 * i + j, h * h - j * j); } for (int(i) = (0); (i) <= (m - 1); (i) += (1)) { int x, y, z, w; scanf( %d%d%d%d , &x, &y, &z, &w); x--, y--; for (int(j) = (x); (j) <= (y); (j) += (1)) addedge(51 * j + z, 2551 + i, 987654321); addedge(2551 + i, T, w); } while (bfs()) { memset((work), 0, sizeof(work)); ; while (1) { int f = dfs(S, T, 987654321); if (f == 0) break; ans -= f; } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int N = 1000005; const double PI = 4 * atan(1); const double eps = 1e-7; long long x, y, z; int main() { ios::sync_with_stdio(0); cin >> x >> y >> z; long long ans = 0; ans = x / z + y / z; long long a, b; a = x; b = y; long long c = (z - x % z) % z; long long res = 0; if (b >= c && ((a + c) / z + (b - c) / z) > ans) { ans = ((a + c) / z + (b - c) / z); res = c; } a = x; b = y; c = (z - y % z) % z; if (a >= c && ((a - c) / z + (b + c) / z) > ans) { ans = ((a + c) / z + (b - c) / z); res = c; } else if (a >= c && ((a - c) / z + (b + c) / z) == ans) { res = min(res, c); } cout << ans << << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int a[N], b[N], d[N], used[N], dis[N], ANS[N], dlt[N]; int n, m, Y0, Y1, lft, ans; vector<int> ch[N], fa[N]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; int ABS(int x) { if (x >= 0) return x; else return -x; } int lnk(int x, int y) { ch[x].push_back(y); fa[y].push_back(x); return ABS(b[x] - a[y]); } int avi(int x) { int ret = 0; for (int i = 0; i < int(fa[x].size()); i++) { int to = fa[x][i]; if (used[to] == -1 || used[to] == dis[x]) ret++; } return ret; } int main() { scanf( %d%d%d%d , &n, &m, &Y0, &Y1); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= m; i++) scanf( %d , b + i); for (int i = 1; i <= m; i++) used[i] = -1; for (int i = 1; i <= n; i++) { int x = lower_bound(b + 1, b + 1 + m, a[i]) - b - 1; int y = x + 1; if (x == 0) dis[i] = lnk(y, i); else if (y == m + 1) dis[i] = lnk(x, i); else if (a[i] - b[x] < b[y] - a[i]) dis[i] = lnk(x, i); else if (a[i] - b[x] > b[y] - a[i]) dis[i] = lnk(y, i); else { dis[i] = lnk(x, i); lnk(y, i); } if (avi(i) == 1) { dlt[i] = 1; pq.push(make_pair(dis[i], i)); } } lft = n; while (!pq.empty()) { int D = pq.top().first, x = pq.top().second, y; pq.pop(); lft--; if (avi(x) == 0) continue; for (int i = 0; i < int(fa[x].size()); i++) { y = fa[x][i]; if (used[y] == -1 || used[y] == D) break; } used[y] = D; ANS[y]++; for (int i = 0; i < int(ch[y].size()); i++) { int to = ch[y][i]; if (dis[to] != D && !dlt[to] && avi(to) == 1) { dlt[to] = 1; pq.push(make_pair(dis[to], to)); } } } for (int i = 1; i <= m; i++) ans += ANS[i]; ans += lft; printf( %d n , n - ans); return 0; } |
#include <bits/stdc++.h> using namespace std; std::mt19937 rnd( (int)std::chrono::steady_clock::now().time_since_epoch().count()); long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MOD = 1000000007; void inc(int& a, int b) { if ((a += b) >= MOD) a -= MOD; } void dec(int& a, int b) { inc(a, MOD - b); } int qx, qy, xdim, ydim; int inv[6 + 1]; int calcformula(int x, int y) { int ret = max(max((x + 1) / 2, (y + 1) / 2), (x + y + 2) / 3); if (ret % 2 != (x + y) % 2) ++ret; return ret; } int calc(int x, int y) { if (x == 1 && y == 0 || x == 0 && y == 1) return 3; if (x == 1 && y == 1) return xdim > 3 || ydim > 3 ? 4 : 0; if (x == 2 && y == 2) return 4; if (x == 3 && y == 0 && xdim == 4 || x == 0 && y == 3 && ydim == 4) return 5; return calcformula(x, y); } int divup(int num, int den) { if (den < 0) num = -num, den = -den; return num >= 0 ? (num + den - 1) / den : num / den; } int divdn(int num, int den) { if (den < 0) num = -num, den = -den; return num >= 0 ? num / den : (num - den + 1) / den; } int makesamepar(int a, int b) { if ((a & 1) != (b & 1)) ++a; return a; } int cnt(int lo, int hi) { return hi - lo + 1; } int sum(int lo, int hi) { return (long long)(lo + hi) * (hi - lo + 1) / 2 % MOD; } int sumsq(int n) { return (long long)n * (n + 1) % MOD * (2 * n + 1) % MOD * inv[6] % MOD; } int sumsq(int lo, int hi) { int ret = 0; inc(ret, sumsq(hi)); if (lo != 0) dec(ret, sumsq(lo - 1)); return ret; } int calcsumstupid(int xlim, int ylim) { int ret = 0; for (int x = (0); x <= (xlim); ++x) for (int y = (0); y <= (ylim); ++y) inc(ret, calc(x, y)); return ret; } int calcsum(int xlim, int ylim) { int ret = 0; for (int dx = (0); dx < (12); ++dx) if (dx <= xlim) for (int dy = (0); dy < (6); ++dy) if (dy <= ylim) { int A = (xlim - dx) / 12, B = (ylim - dy) / 6, D = divup(divup(dx, 2) - divup(dx + dy, 3), 2) - 1, E = makesamepar(divup(dx, 2), dx + dy); int cur = 0; { int xlo = max(0, B - D), xhi = A, ylo = 0, yhi = B; if (xlo <= xhi && ylo <= yhi) { cur = (cur + (long long)cnt(xlo, xhi) * cnt(ylo, yhi) % MOD * E) % MOD; cur = (cur + (long long)cnt(ylo, yhi) * sum(xlo, xhi) % MOD * 6) % MOD; } } { int xlo = max(0, -D), xhi = min(A, B - D - 1); if (xlo <= xhi) { cur = (cur + (long long)cnt(xlo, xhi) * E % MOD * (D + 1)) % MOD; cur = (cur + (long long)sum(xlo, xhi) * E) % MOD; cur = (cur + (long long)sum(xlo, xhi) * 6 % MOD * (D + 1)) % MOD; cur = (cur + (long long)sumsq(xlo, xhi) * 6) % MOD; } } inc(ret, cur); } for (int dx = (0); dx < (12); ++dx) if (dx <= xlim) for (int dy = (0); dy < (6); ++dy) if (dy <= ylim) { int A = (xlim - dx) / 12, B = (ylim - dy) / 6, C = divup(divup(dx, 2) - divup(dx + dy, 3), 2), D = divup(dx + dy, 3) - divup(dy, 2), E = makesamepar(divup(dx + dy, 3), dx + dy); int cur = 0; { int xlo = max(0, divup(B - D, 4)), xhi = A, ylo = 0, yhi = B; if (xlo <= xhi && ylo <= yhi) { cur = (cur + (long long)cnt(xlo, xhi) * cnt(ylo, yhi) % MOD * E) % MOD; cur = (cur + (long long)cnt(ylo, yhi) * sum(xlo, xhi) % MOD * 4) % MOD; cur = (cur + (long long)cnt(xlo, xhi) * sum(ylo, yhi) % MOD * 2) % MOD; } } { int xlo = max(0, divup(-D, 4)), xhi = min(A, divup(B - D, 4) - 1); if (xlo <= xhi) { cur = (cur + (long long)cnt(xlo, xhi) * E % MOD * (D + 1)) % MOD; cur = (cur + (long long)sum(xlo, xhi) * E % MOD * 4) % MOD; cur = (cur + (long long)sumsq(xlo, xhi) * 16) % MOD; cur = (cur + (long long)sum(xlo, xhi) * (D + 1) % MOD * 4) % MOD; cur = (cur + (long long)sumsq(xlo, xhi) * 16) % MOD; cur = (cur + (long long)sum(xlo, xhi) * (2 * D + 1) % MOD * 4) % MOD; cur = (cur + (long long)cnt(xlo, xhi) * D % MOD * (D + 1)) % MOD; } } { int xlo = max(0, max(B - C + 1, divup(B - D, 4))), xhi = A, ylo = 0, yhi = B; if (xlo <= xhi && ylo <= yhi) { cur = (cur - (long long)cnt(xlo, xhi) * cnt(ylo, yhi) % MOD * E % MOD + MOD) % MOD; cur = (cur - (long long)cnt(ylo, yhi) * sum(xlo, xhi) % MOD * 4 % MOD + MOD) % MOD; cur = (cur - (long long)cnt(xlo, xhi) * sum(ylo, yhi) % MOD * 2 % MOD + MOD) % MOD; } } { int xlo = max(0, max(1 - C, divup(C - D - 1, 3))), xhi = min(A, B - C); if (xlo <= xhi) { cur = (cur - (long long)cnt(xlo, xhi) * E % MOD * C % MOD + MOD) % MOD; cur = (cur - (long long)sum(xlo, xhi) * E % MOD + MOD) % MOD; cur = (cur - (long long)sumsq(xlo, xhi) * 4 % MOD + MOD) % MOD; cur = (cur - (long long)sum(xlo, xhi) * C % MOD * 4 % MOD + MOD) % MOD; cur = (cur - (long long)sumsq(xlo, xhi) % MOD + MOD) % MOD; cur = (cur - (long long)sum(xlo, xhi) * (2 * C - 1) % MOD + MOD) % MOD; cur = (cur - (long long)cnt(xlo, xhi) * (C - 1) % MOD * C % MOD + MOD) % MOD; } } { int xlo = max(0, divup(-D, 4)), xhi = min(A, min(divup(B - D, 4) - 1, divup(C - D - 1, 3) - 1)); if (xlo <= xhi) { cur = (cur - (long long)cnt(xlo, xhi) * E % MOD * (D + 1) % MOD + MOD) % MOD; cur = (cur - (long long)sum(xlo, xhi) * E % MOD * 4 % MOD + MOD) % MOD; cur = (cur - (long long)sumsq(xlo, xhi) * 16 % MOD + MOD) % MOD; cur = (cur - (long long)sum(xlo, xhi) * (D + 1) % MOD * 4 % MOD + MOD) % MOD; cur = (cur - (long long)sumsq(xlo, xhi) * 16 % MOD + MOD) % MOD; cur = (cur - (long long)sum(xlo, xhi) * (2 * D + 1) % MOD * 4 % MOD + MOD) % MOD; cur = (cur - (long long)cnt(xlo, xhi) * D % MOD * (D + 1) % MOD + MOD) % MOD; } } inc(ret, cur); } for (int dx = (0); dx < (6); ++dx) if (dx <= xlim) for (int dy = (0); dy < (12); ++dy) if (dy <= ylim) { int A = (xlim - dx) / 6, B = (ylim - dy) / 12, C = divdn(divup(dx + dy, 3) - divup(dy, 2), 2) + 1, E = makesamepar(divup(dy, 2), dx + dy); int cur = 0; { int xlo = 0, xhi = min(A, -C), ylo = 0, yhi = B; if (xlo <= xhi && ylo <= yhi) { cur = (cur + (long long)cnt(xlo, xhi) * cnt(ylo, yhi) % MOD * E) % MOD; cur = (cur + (long long)cnt(xlo, xhi) * sum(ylo, yhi) % MOD * 6) % MOD; } } { int xlo = max(0, -C + 1), xhi = min(A, B - C); if (xlo <= xhi) { cur = (cur + (long long)cnt(xlo, xhi) * E % MOD * (B - C + 1)) % MOD; cur = (cur - (long long)sum(xlo, xhi) * E % MOD + MOD) % MOD; cur = (cur + (long long)cnt(xlo, xhi) * (C + B) % MOD * (B - C + 1) % MOD * 3) % MOD; cur = (cur - (long long)sum(xlo, xhi) * (2 * C - 1) % MOD * 3 % MOD + MOD) % MOD; cur = (cur - (long long)sumsq(xlo, xhi) * 3 % MOD + MOD) % MOD; } } inc(ret, cur); } vector<pair<int, int>> special; special.push_back(make_pair(1, 0)); special.push_back(make_pair(0, 1)); special.push_back(make_pair(1, 1)); special.push_back(make_pair(3, 0)); special.push_back(make_pair(0, 3)); special.push_back(make_pair(2, 2)); for (int i = (0); i < (((int)(special).size())); ++i) { int x, y; tie(x, y) = special[i]; if (x <= xlim && y <= ylim) { dec(ret, calcformula(x, y)); inc(ret, calc(x, y)); } } return ret; } void precalc() { inv[1] = 1; for (int i = (2); i <= (6); ++i) inv[i] = (long long)(MOD - MOD / i) * inv[MOD % i] % MOD; } int solve() { int ret = 0; inc(ret, calcsum(xdim - 1, ydim - 1)); dec(ret, calcsum(xdim - 1, qy - 1)); dec(ret, calcsum(qx - 1, ydim - 1)); inc(ret, calcsum(qx - 1, qy - 1)); return ret; } void run() { scanf( %d%d%d%d , &qx, &qy, &xdim, &ydim); --qx, --qy; printf( %d n , solve()); } void verifycalc() { for (xdim = 3; xdim <= 20; ++xdim) for (ydim = 3; ydim <= 20; ++ydim) { vector<vector<int>> d(xdim, vector<int>(ydim, INT_MAX)); queue<pair<int, int>> q; d[0][0] = 0, q.push(make_pair(0, 0)); while (!q.empty()) { int x, y; tie(x, y) = q.front(); q.pop(); for (int dx = (-2); dx <= (+2); ++dx) for (int dy = (-2); dy <= (+2); ++dy) if (dx * dx + dy * dy == 5) { int nx = x + dx, ny = y + dy; if (nx < 0 || nx >= xdim || ny < 0 || ny >= ydim) continue; if (d[nx][ny] == INT_MAX) d[nx][ny] = d[x][y] + 1, q.push(make_pair(nx, ny)); } } for (int x = (0); x < (xdim); ++x) for (int y = (0); y < (ydim); ++y) if (d[x][y] == INT_MAX) { assert(xdim == 3 && ydim == 3 && x == 1 && y == 1); d[x][y] = 0; } for (int x = (0); x < (xdim); ++x) for (int y = (0); y < (ydim); ++y) assert(d[x][y] == calc(x, y)); printf( done (%d,%d) n , xdim, ydim); } } void verifysum() { for (xdim = 3; xdim <= 100; ++xdim) { for (ydim = 3; ydim <= 100; ++ydim) for (int dx = (1); dx <= (min(xdim, 3)); ++dx) for (int dy = (1); dy <= (min(ydim, 3)); ++dy) { int have = calcsum(xdim - dx, ydim - dy); int want = calcsumstupid(xdim - dx, ydim - dy); assert(have == want); } printf( done xdim=%d n , xdim); } } int main() { precalc(); int ncase; scanf( %d , &ncase); for (int i = (1); i <= (ncase); ++i) run(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); char t[n + 1]; scanf( %s , t); int i = 0, k = 1; while (t[i] != 0 ) { printf( %c , t[i]); i = i + k; k++; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3fll; const long long M = 1e9 + 7; const long long maxn = 1e6 + 7; const double pi = acos(-1.0); const double eps = 0.00000001; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <typename T> inline T abs(T a) { return a > 0 ? a : -a; } template <typename T> inline T powMM(T a, T b) { T ret = 1; for (; b; b >>= 1ll, a = (long long)a * a % M) if (b & 1) ret = (long long)ret * a % M; return ret; } int A[maxn]; map<int, int> S; vector<int> del, ini[2], have[2]; int cnt[2], ans; int main() { int n, m, i, j; scanf( %d%d , &n, &m); m = min(m, n * 2); for (i = 1; i <= n; i++) scanf( %d , &A[i]); for (i = 1; i <= n; i++) { if (S.count(A[i])) { del.push_back(i); ans++; } else { S[A[i]] = i, cnt[A[i] & 1]++; ini[A[i] & 1].push_back(i); } } for (i = 0; i < 2; i++) { sort(ini[i].begin(), ini[i].end()); for (j = 0; j < (int)ini[i].size() - n / 2; j++) { S.erase(A[ini[i][j]]); cnt[i]--; ans++; del.push_back(ini[i][j]); } } j = 0; for (i = 1; i <= m; i++) { if (!S.count(i)) { if (cnt[i & 1] != n / 2) { cnt[i & 1]++; A[del[j++]] = i; } } } if (cnt[0] != n / 2 || cnt[1] != n / 2) return 0 * puts( -1 ); printf( %d n , ans); for (i = 1; i <= n; i++) printf( %d , A[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, mn, mx, ans = 0; cin >> n >> a; mn = mx = a; for (int i = 1; i < n; i++) { cin >> a; if (a < mn) { mn = a; ans++; } if (a > mx) { mx = a; ans++; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; inline int gi() { char tmp = getchar(); int ans = 0, flag = 1; while (!isdigit(tmp)) { if (tmp == - ) flag = -1; tmp = getchar(); } while (isdigit(tmp)) { ans = ans * 10 + tmp - 0 ; tmp = getchar(); } return ans * flag; } inline void in(int &x) { x = gi(); } inline void in2(int &x, int &y) { in(x), in(y); } inline void in3(int &x, int &y, int &z) { in(x), in(y), in(z); } inline void in4(int &x, int &y, int &z, int &a) { in3(x, y, z), in(a); } inline void smax(int &x, int y) { x = max(x, y); } inline void smin(int &x, int y) { x = min(x, y); } int lowbit(int x) { return x & -x; } const int N = 1002000; int C[N], n, maxx; void Add(int x, int v) { while (x <= maxx) { smax(C[x], v); x += lowbit(x); } } int Query(int x) { int ans = 0; while (x) { smax(ans, C[x]); x -= lowbit(x); } return ans; } struct Nod { int x, y; } Node[N]; bool cmp(Nod a, Nod b) { if (a.y != b.y) return a.y < b.y; return a.x < b.x; } signed main() { int n = gi(); for (int i = (int)(1); i <= (int)(n); ++i) { Node[i].x = gi(); Node[i].y = i - Node[i].x; smax(maxx, Node[i].x); } sort(Node + 1, Node + n + 1, cmp); int ans = 0; for (int i = (int)(1); i <= (int)(n); ++i) { if (Node[i].y < 0) continue; int g = Query(Node[i].x - 1); Add(Node[i].x, g + 1); smax(ans, g + 1); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { map<string, string> hh; map<string, string>::iterator it; int n; string a, b, c; cin >> n; while (n--) { cin >> a >> b; it = hh.find(a); if (it == hh.end()) hh[b] = a; else { c = it->second; hh.erase(it); hh[b] = c; } } cout << hh.size() << endl; for (it = hh.begin(); it != hh.end(); it++) cout << it->second << << it->first << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, c[23][23], d[23], u[23]; int main() { scanf( %d%d , &n, &m); for (int xt, yt, i = 1; i <= m; ++i) { scanf( %d%d , &xt, &yt); if (c[xt][yt] || xt == yt) continue; ++d[xt], ++d[yt]; c[xt][yt] = c[yt][xt] = 1; } for (int j, co, p, mint, i = 1; i <= n; ++i) { fill(u, u + n + 1, 0); co = 0; for (j = i; !u[j]; j = p) { mint = n + n; p = j; u[j] = 1; ++co; for (int k = 1; k <= n; ++k) if (!u[k] && c[j][k] && (d[k] < mint || d[k] == mint && k < p)) p = k, mint = d[k]; } if (co == n) { puts( Yes ); return 0; } } puts( No ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<pair<int, int> > v; for (int i = 0; i < n; i++) { int a; cin >> a; v.push_back(make_pair(a, i)); } sort(v.begin(), v.end()); int cur = 0; vector<int> ans; for (int i = 0; i < v.size() && cur + v[i].first <= k; i++) { cur += v[i].first; ans.push_back(v[i].second); } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { cout << ans[i] + 1 << ; } } |
#include <bits/stdc++.h> using namespace std; bool Check(char x) { if (x <= 3 && x >= 1 ) return true; else return false; } int main() { char s[1000]; cin >> s; char x; for (int i = 0; i < strlen(s); ++i) { for (int j = i + 1; j < strlen(s); ++j) { if (s[j] < s[i] && Check(s[i]) && Check(s[j])) { x = s[i]; s[i] = s[j]; s[j] = x; } } } for (int i = 0; i < strlen(s); i++) { cout << s[i]; } return 0; } |
#include <bits/stdc++.h> int a[300300]; int b[300300]; int t[300300]; int n, q; void update(int u, const int &val) { while (1 <= u && u <= n) { t[u] += val; u = u + (u & (-u)); } } int sum(int u) { int res = 0; while (1 <= u && u <= n) { res += t[u]; u = u & (u - 1); } return (res); } void init(void) { int i, v; scanf( %d , &n); for (i = 1; i <= n; i = i + 1) { scanf( %d , &v); a[i] = v; b[v] = i; } memset(t, 0, sizeof t); for (i = 2; i <= n; i = i + 1) if (b[i] < b[i - 1]) update(i, 1); } void swap(int &a, int &b) { int sw; sw = a; a = b; b = sw; } void answer(void) { int i, t, x, y, r, t1, t2; bool px, py, px1, py1; scanf( %d , &q); for (i = 1; i <= q; i = i + 1) { scanf( %d , &t); scanf( %d , &x); scanf( %d , &y); if (t == 2) { t1 = a[x]; t2 = a[y]; px = (b[t1] < b[t1 - 1]); py = (b[t2] < b[t2 - 1]); px1 = (b[t1 + 1] < b[t1]); py1 = (b[t2 + 1] < b[t2]); b[t1] = y; b[t2] = x; swap(a[x], a[y]); if (b[t1] < b[t1 - 1] && !px) update(t1, 1); if (b[t1] > b[t1 - 1] && px) update(t1, -1); if (b[t1 + 1] < b[t1] && !px1) update(t1 + 1, 1); if (b[t1 + 1] > b[t1] && px1) update(t1 + 1, -1); if (t2 != t1 && t2 != t1 + 1) { if (b[t2] < b[t2 - 1] && !py) update(t2, 1); if (b[t2] > b[t2 - 1] && py) update(t2, -1); } if (t2 + 1 != t1 && t2 + 1 != t1 + 1) { if (b[t2 + 1] < b[t2] && !py1) update(t2 + 1, 1); if (b[t2 + 1] > b[t2] && py1) update(t2 + 1, -1); } } else { r = sum(y) - sum(x); printf( %d n , r + 1); } } } int main(void) { init(); answer(); return 0; } |
#include <bits/stdc++.h> using i64 = long long; std::vector<std::vector<int>> read_tree1(int v) { std::vector<std::vector<int>> graph(v); while (v-- > 1) { int x, y; std::cin >> x >> y; graph[x - 1].push_back(y - 1); graph[y - 1].push_back(x - 1); } return graph; } template <class T> std::pair<T, T> ext_euclid(T a, T b) { if (b == 0) { return {a > 0 ? +1 : -1, 0}; } else { auto res = ext_euclid(b, a % b); return {res.second, res.first - a / b * res.second}; } } template <class T> T mod_inv(T num, T mod) { num = (num % mod + mod) % mod; T res = ext_euclid(num, mod).first; return res < 0 ? res + mod : res; } int main() { std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0); const i64 MOD = 998244353; int n; std::cin >> n; auto tree = read_tree1(n); std::function<std::tuple<i64, i64, i64>(int, int)> dfs = [&](int cur, int prv) -> std::tuple<i64, i64, i64> { std::vector<std::tuple<i64, i64, i64>> nxts; for (int nxt : tree[cur]) if (nxt != prv) { nxts.push_back(dfs(nxt, cur)); } i64 prod = 1; for (const auto& [f, g, h] : nxts) { prod = prod * (f + h) % MOD; } i64 F = 1, G = 1, H = 0; for (const auto& [f, g, h] : nxts) { F = F * f % MOD; G = G * (f + h) % MOD; H = (H + g * mod_inv(f + h, MOD)) % MOD; } H = H * prod % MOD; F = (F + H) % MOD; return {F, G, H}; }; std::cout << std::get<0>(dfs(0, -1)) << n ; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 2e5 + 5; int n, k, d, ansL = 1, ansR = 1, top1, top2, flag, pos; int a[MAXN], st1[MAXN], st2[MAXN]; map<int, int> lst; namespace SegmentTree { struct Tree { int l, r; int w, tag; } tree[MAXN << 2]; void update(int k) { tree[k].w = min(tree[k << 1].w, tree[k << 1 | 1].w); } void apply(int k, int val) { tree[k].w += val; tree[k].tag += val; } void down(int k) { if (tree[k].tag != 0) { apply(k << 1, tree[k].tag); apply(k << 1 | 1, tree[k].tag); tree[k].tag = 0; } } void Build(int k, int l, int r) { tree[k].l = l; tree[k].r = r; if (l == r) { tree[k].w = l; return; } int mid = (l + r) >> 1; Build(k << 1, l, mid); Build(k << 1 | 1, mid + 1, r); update(k); } void Modify(int k, int l, int r, int val) { if (tree[k].l >= l && tree[k].r <= r) { apply(k, val); return; } down(k); int mid = (tree[k].l + tree[k].r) >> 1; if (l <= mid) Modify(k << 1, l, r, val); if (r > mid) Modify(k << 1 | 1, l, r, val); update(k); } void Delete(int k, int x) { if (tree[k].l == tree[k].r) { tree[k].w = 0; return; } down(k); int mid = (tree[k].l + tree[k].r) >> 1; if (x <= mid) Delete(k << 1, x); else Delete(k << 1 | 1, x); update(k); } int Find(int k, int x) { if (tree[k].l == tree[k].r) return tree[k].l; down(k); if (tree[k << 1].w <= x) return Find(k << 1, x); else return Find(k << 1 | 1, x); } void Query(int k, int l, int r, int x) { if (tree[k].l >= l && tree[k].r <= r) { if (tree[k].w <= x) { flag = 1; pos = Find(k, x); } return; } down(k); int mid = (tree[k].l + tree[k].r) >> 1; if (l <= mid && !flag) Query(k << 1, l, r, x); if (r > mid && !flag) Query(k << 1 | 1, l, r, x); } } // namespace SegmentTree int main() { scanf( %d%d%d , &n, &k, &d); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); a[i] += INF; } if (d == 0) { for (int i = 1; i <= n; i++) { int l = i; while (a[i] == a[i + 1] && i < n) i += 1; if (i - l + 1 > ansR - ansL + 1) { ansL = l; ansR = i; } } printf( %d %d n , ansL, ansR); return 0; } SegmentTree::Build(1, 1, n); int L = 1; for (int R = 1; R <= n; R++) { int tmp = L; if (a[R] % d == a[R - 1] % d) L = max(lst[a[R]] + 1, L); else L = R; lst[a[R]] = R; while (tmp < L) { SegmentTree::Delete(1, tmp); tmp += 1; } while (top1 && st1[top1] >= L && a[st1[top1]] >= a[R]) { SegmentTree::Modify(1, max(L, st1[top1 - 1] + 1), st1[top1], a[st1[top1]] / d); top1 -= 1; } SegmentTree::Modify(1, max(L, st1[top1] + 1), R, -a[R] / d); st1[++top1] = R; while (top2 && st2[top2] >= L && a[st2[top2]] <= a[R]) { SegmentTree::Modify(1, max(L, st2[top2 - 1] + 1), st2[top2], -a[st2[top2]] / d); top2 -= 1; } SegmentTree::Modify(1, max(L, st2[top2] + 1), R, a[R] / d); st2[++top2] = R; flag = 0; pos = 0; SegmentTree::Query(1, L, R, k + R); if (R - pos + 1 > ansR - ansL + 1) { ansL = pos; ansR = R; } } printf( %d %d n , ansL, ansR); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005, K = 55, mod = 998244353; int n, k, b[N], f[2 * K][N], g[2 * K][N], C[N][N]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &b[i]); f[k][0] = 1; for (int i = 1; i <= n; i++) { memset(g, 0, sizeof(g)); for (int j = max(0, k - b[i - 1]); j <= 2 * k; j++) { int j2 = j + b[i - 1] - b[i] + 1, x = j + b[i - 1] - k; if (x < 0 || x > n || j2 > 2 * k) continue; for (int d = max(0, -j2); d < i; d++) { if (j2 < 0) (g[0][d + j2] += f[j][d]) %= mod; else (g[j2][d] += f[j][d]) %= mod; } } for (int j = 0; j < 2 * k; j++) for (int d = 1; d <= i; d++) (g[j + 1][d - 1] += g[j][d]) %= mod; for (int j = max(0, k - b[i - 1]); j <= 2 * k; j++) { int j2 = j + b[i - 1] - b[i], x = j + b[i - 1] - k; if (x < 0 || x > n || j2 < 0 || j2 > 2 * k) continue; for (int d = 0; d < i; d++) { (g[j2][d] += 1ll * f[j][d] * (d + x) % mod) %= mod; (g[j2][d + 1] += 1ll * f[j][d] * (d + 1) % mod) %= mod; } } swap(f, g); } C[0][0] = 1; for (int i = 1; i <= n; i++) { C[i][0] = C[i][i] = 1; for (int j = 1; j < n; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod; } int ans = 0; for (int j = 0; j <= 2 * k; j++) { int x = b[n] + j - k; if (x < 0 || x > n) continue; for (int d = 0; d <= n - x; d++) (ans += 1ll * f[j][d] * C[n - x][d] % mod) %= mod; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void printArray(vector<T> arr) { for (T a : arr) cout << a << ; cout << n ; } void printVerdict(bool verdict) { cout << (verdict ? YES : NO ) << n ; } vector<long long> findPrime(long long n) { vector<long long> ret; for (int i = 2; i * i <= n && ret.empty(); i++) { if (n % i == 0) ret.push_back(i); } if (ret.empty()) return {}; for (int i = 2; i * i <= n / ret.front(); i++) { if ((n / ret.front()) % i == 0 && i != ret.front()) { ret.push_back(i); break; } } ret.push_back((n / ret.front()) / ret.back()); if (ret.back() == ret[0] || ret.back() == ret[1]) return {}; return ret; } int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { long long n; cin >> n; bool verdict = true; vector<long long> ret = findPrime(n); if (ret.empty()) verdict = false; printVerdict(verdict); if (verdict) printArray(ret); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5; const long long M = 1e9 + 9; int n, x, y; pair<int, int> pos[N]; map<pair<int, int>, int> mp; set<int> q; long long ans; int children(int x, int y) { int ret = 0; for (int dx = -1; dx <= 1; dx++) { map<pair<int, int>, int>::iterator c = mp.find(make_pair(x + dx, y - 1)); if (c != mp.end()) ret++; } return ret; } void update(int x, int y) { map<pair<int, int>, int>::iterator p = mp.find(make_pair(x, y)); if (p == mp.end()) return; for (int dx = -1; dx <= 1; dx++) { map<pair<int, int>, int>::iterator c = mp.find(make_pair(x + dx, y + 1)); if (c != mp.end() && children(x + dx, y + 1) == 1) { q.erase(p->second); return; } } q.insert(p->second); } void insert(int x, int y, int z) { pos[z].first = x; pos[z].second = y; mp[make_pair(x, y)] = z; } void remove(int x, int y) { mp.erase(make_pair(x, y)); for (int dx = -1; dx <= 1; dx++) { update(x + dx, y + 1); update(x + dx, y - 1); } for (int dx = -2; dx <= 2; dx++) { update(x + dx, y); } } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; insert(x, y, i); } for (int i = 0; i < n; i++) { update(pos[i].first, pos[i].second); } for (int act = 0; !q.empty(); act++) { set<int>::iterator it; if ((act & 1) == 0) { it = --q.end(); } else { it = q.begin(); } ans = ans * n + (*it); ans %= M; remove(pos[*it].first, pos[*it].second); q.erase(it); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long UNDEF = -1; const long long INF = 1e18; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; } long long cross(const pair<long long, long long> &a, const pair<long long, long long> &b, const pair<long long, long long> &c) { return (b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first); } vector<pair<long long, long long> > convexHullAllowStraightEdges( vector<pair<long long, long long> > points) { if (points.size() <= 1) return points; sort(points.begin(), points.end()); vector<pair<long long, long long> > h; for (auto p : points) { while (h.size() >= 2 && cross(h.end()[-2], h.back(), p) > 0) h.pop_back(); h.push_back(p); } reverse(points.begin(), points.end()); int upper = h.size(); for (auto p : points) { while (h.size() > upper && cross(h.end()[-2], h.back(), p) > 0) h.pop_back(); h.push_back(p); } h.resize(h.size() - 1 - (h[0] == h[1])); return h; } static char stdinBuffer[1024]; static char *stdinDataEnd = stdinBuffer + sizeof(stdinBuffer); static const char *stdinPos = stdinDataEnd; void readAhead(size_t amount) { size_t remaining = stdinDataEnd - stdinPos; if (remaining < amount) { memmove(stdinBuffer, stdinPos, remaining); size_t sz = fread(stdinBuffer + remaining, 1, sizeof(stdinBuffer) - remaining, stdin); stdinPos = stdinBuffer; stdinDataEnd = stdinBuffer + remaining + sz; if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0; } } long long readInt() { readAhead(16); long long x = 0; bool neg = false; while (*stdinPos == || *stdinPos == n ) ++stdinPos; if (*stdinPos == - ) { ++stdinPos; neg = true; } while (*stdinPos >= 0 && *stdinPos <= 9 ) { x *= 10; x += *stdinPos - 0 ; ++stdinPos; } return neg ? -x : x; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n = readInt(), m = readInt(); long long ox = readInt(), oy = readInt(); set<pair<long long, long long> > vmin, vmax; for (long long i = 0; i < n; i++) { long long x = readInt(), y = readInt(); vmax.insert(make_pair(x, y)); } long long xhi = 0, yhi = 0; for (long long i = 0; i < m; i++) { long long x = readInt(), y = readInt(); vmin.insert(make_pair(x, y)); chkmax(xhi, x); chkmax(yhi, y); } set<pair<long long, long long> > toch; for (auto &w : vmin) toch.insert(w); for (auto &w : vmax) toch.insert(w); toch.insert(make_pair(0, 0)); toch.insert(make_pair(xhi, 0)); toch.insert(make_pair(0, yhi)); vector<pair<long long, long long> > vtoch; for (auto &w : toch) vtoch.push_back(w); vector<pair<long long, long long> > ch = convexHullAllowStraightEdges(vtoch); for (auto &w : ch) { if (vmax.find(w) != vmax.end()) { printf( Max n ); return 0; } } printf( Min n ); } |
#include <bits/stdc++.h> using namespace std; static const int INF = 500000000; template <class T> void debug(T a, T b) { for (; a != b; ++a) cerr << *a << ; cerr << endl; } string s[2005]; int n, K; int lcp[2005]; int prof[2005][2005]; struct uf { int par[2005]; vector<int> dp[2005]; void init(int n) { for (int i = 0; i < n; ++i) { dp[i].resize(2); } memset(par, -1, sizeof(par)); } int root(int a) { if (par[a] == -1) return a; return par[a] = root(par[a]); } void unite(int a, int b, int lb) { a = root(a); b = root(b); vector<int> tmp(dp[a].size() + dp[b].size() - 1); for (int i = 0; i < dp[a].size(); ++i) for (int j = 0; j < dp[b].size(); ++j) tmp[i + j] = max(tmp[i + j], dp[a][i] + dp[b][j] + lb * i * j); par[a] = b; dp[b] = tmp; dp[a].clear(); } }; uf u; int used[2005]; int main() { scanf( %d%d , &n, &K); for (int i = 0; i < n; ++i) cin >> s[i]; sort(s, s + n); u.init(n); for (int i = 0; i < n - 1; ++i) { int& t = lcp[i]; for (t = 0; t < s[i].size() && t < s[i + 1].size() && s[i][t] == s[i + 1][t]; ++t) ; } for (int i = 0; i < n - 1; ++i) { int tallest = -1, ind; for (int j = 0; j < n - 1; ++j) if (used[j] == 0 && tallest < lcp[j]) { tallest = lcp[j]; ind = j; } used[ind] = 1; u.unite(ind, ind + 1, tallest); } printf( %d n , u.dp[u.root(0)][K]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int arr[n + 10]; for (int i = 1; i <= n; i++) scanf( %d , &arr[i]); int start, end; start = 1; int pos_1 = -1, pos_2 = -1; int cnt = 0; int t = 0; for (int i = 1; i <= n;) { pos_1 = -1; pos_2 = -1; start = i; for (int j = start; j <= n; j++) { if (arr[j] != -1) { pos_1 = j; break; } } if (pos_1 != -1) { for (int j = pos_1 + 1; j <= n; j++) if (arr[j] != -1) { pos_2 = j; break; } if (pos_2 == -1) { cnt++; break; } t++; if (arr[pos_1] == arr[pos_2]) { start = pos_2 + 1; for (int j = pos_2 + 1; j <= n; j++) if (arr[j] == -1 || arr[j] == arr[pos_1]) start = j + 1; else { start = j; break; } cnt++; } else { long long val = (arr[pos_2] - arr[pos_1]); int d = pos_2 - pos_1; if (val % d == 0) { int yes = val / d; val = arr[pos_1]; yes *= (-1); for (int j = pos_1 - 1; j >= start; j--) { val += yes; if (val <= 0) { cnt++; start = pos_2; goto End; } if (arr[j] != -1 && arr[j] != val) { cnt++; start = pos_2; goto End; } } val = arr[pos_2]; yes *= (-1); start = -1; for (int j = pos_2 + 1; j <= n; j++) { val += yes; if (val <= 0) { start = j; break; } if (arr[j] != -1 && arr[j] != val) { start = j; break; } } if (start == -1) start = n + 1; cnt++; } else { cnt += 1; start = pos_2; } } } else { cnt++; break; } End:; i = start; } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct bign { int len, s[109]; bign() { memset(s, 0, sizeof(s)); len = 1; } bign(int num) { *this = num; } bign(const char *num) { *this = num; } bign operator=(const int num) { char s[109]; sprintf(s, %d , num); *this = s; return *this; } bign operator=(const char *num) { for (int i = 0; num[i] == 0 ; num++) ; len = strlen(num); for (int i = 0; i < len; i++) s[i] = num[len - i - 1] - 0 ; return *this; } bign operator+(const bign &b) const { bign c; c.len = 0; for (int i = 0, g = 0; g || i < max(len, b.len); i++) { int x = g; if (i < len) x += s[i]; if (i < b.len) x += b.s[i]; c.s[c.len++] = x % 10; g = x / 10; } return c; } bign operator+=(const bign &b) { *this = *this + b; return *this; } void clean() { while (len > 1 && !s[len - 1]) len--; } bign operator*(const bign &b) { bign c; c.len = len + b.len; for (int i = 0; i < len; i++) { for (int j = 0; j < b.len; j++) { c.s[i + j] += s[i] * b.s[j]; } } for (int i = 0; i < c.len; i++) { c.s[i + 1] += c.s[i] / 10; c.s[i] %= 10; } c.clean(); return c; } bign operator*=(const bign &b) { *this = *this * b; return *this; } bign operator-(const bign &b) { bign c; c.len = 0; for (int i = 0, g = 0; i < len; i++) { int x = s[i] - g; if (i < b.len) x -= b.s[i]; if (x >= 0) g = 0; else { g = 1; x += 10; } c.s[c.len++] = x; } c.clean(); return c; } bign operator-=(const bign &b) { *this = *this - b; return *this; } bign operator/(const bign &b) { bign c, f = 0; for (int i = len - 1; i >= 0; i--) { f = f * 10; f.s[0] = s[i]; while (f >= b) { f -= b; c.s[i]++; } } c.len = len; c.clean(); return c; } bign operator/=(const bign &b) { *this = *this / b; return *this; } bign operator%(const bign &b) { bign r = *this / b; r = *this - r * b; return r; } bign operator%=(const bign &b) { *this = *this % b; return *this; } bool operator<(const bign &b) { if (len != b.len) return len < b.len; for (int i = len - 1; i >= 0; i--) { if (s[i] != b.s[i]) return s[i] < b.s[i]; } return false; } bool operator>(const bign &b) { if (len != b.len) return len > b.len; for (int i = len - 1; i >= 0; i--) { if (s[i] != b.s[i]) return s[i] > b.s[i]; } return false; } bool operator==(const bign &b) { return !(*this > b) && !(*this < b); } bool operator!=(const bign &b) { return !(*this == b); } bool operator<=(const bign &b) { return *this < b || *this == b; } bool operator>=(const bign &b) { return *this > b || *this == b; } string str() const { string res = ; for (int i = 0; i < len; i++) res = char(s[i] + 0 ) + res; return res; } }; map<int, bool> mp; const int MAX = 5e4 + 5; int n, m, Tot, tot; int a[MAX], b[MAX], pm[MAX], pim[MAX]; bool use[MAX]; void dfs(int n, int I = 0, int tot = 0, int qwq = 0) { if (qwq == n - 1) { printf( YES n ); printf( %d n , tot); for (int i = 0; i < tot; ++i) printf( %d %d n , a[i], b[i]); exit(0); } if (mp[qwq]) return; mp[qwq] = 1; for (int i = I + 1; i <= Tot; ++i) { if (i == Tot) { int qaq = min((int)((long long)(n - 1 - qwq) * pm[i] / n), pm[i] - 1); if (qwq + n / pm[i] * qaq != n - 1) continue; else a[tot] = qaq, b[tot] = pm[i], dfs(n, i, tot + 1, qwq + n / pm[i] * qaq); } else { for (int j = min((int)((long long)(n - 1 - qwq) * (long long)pm[i] / (long long)n), pm[i] - 1); j >= 1; --j) if (qwq + n / pm[i] * j <= n - 1) a[tot] = j, b[tot] = pm[i], dfs(n, i, tot + 1, qwq + n / pm[i] * j); else break; } } } bool look(int x) { if (x == 1) return 0; if (x == 2) return 1; for (int i = 2; i <= sqrt(x); ++i) if (x % i == 0) return 0; return 1; } void ss(int *pm) { use[1] = 1; for (int i = 2; i <= m; ++i) { if (!use[i]) pm[++tot] = i; for (int j = 1; j <= tot && pm[j] * i <= m; ++j) { use[i * pm[j]] = 1; if (i % pm[j] == 0) break; } } } bool work(int x) { int a = n; while (a % x == 0) a /= x; return a == 1; } int main() { scanf( %d , &n), m = sqrt(n); if (n % 2 == 0 && (n / 2) % 2 == 1 && n != 2) { cout << YES << endl << 2 << endl << 1 2 << endl; cout << (n / 2 - 1) / 2 << << n / 2 << endl; return 0; } if (look(n)) return printf( NO ), 0; ss(pim); for (int i = 1; i <= tot; ++i) if (work(pim[i])) return printf( NO ), 0; for (int i = 2; i <= m; ++i) if (n % i == 0) { pm[++Tot] = i; if (i != n / i) pm[++Tot] = n / i; } if (Tot + 2 < 4) return printf( NO ), 0; sort(pm + 1, pm + 1 + Tot), dfs(n); return printf( NO ), 0; } istream &operator>>(istream &in, bign &x) { string s; in >> s; x = s.c_str(); return in; } ostream &operator<<(ostream &out, const bign &x) { out << x.str(); return out; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long N = 5e5; long long id[N], a[N], pos[N]; int main() { ios_base::sync_with_stdio(false); long long n, t, m, l, k, ans, i, j, res = 0, fl; t = 1; long long x; while (t--) { long long o; cin >> n >> m >> k; for (i = 0; i < n; i++) { cin >> a[i]; pos[a[i]] = i; } long long ct = 1; j = 0; for (o = 0;; o += k) { for (i = o; i < o + k; ++i) id[a[i]] = ct; ct++; if (i > n) break; } for (i = 0; i < m; i++) { cin >> x; res += id[x]; if (pos[x] > 0) { long long p = pos[x]; long long val = a[p - 1]; swap(id[x], id[val]); swap(a[p], a[p - 1]); pos[x] = p - 1; pos[val] = p; } } cout << res << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } signed main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long maxai = 0; multiset<long long> a; for (long long i = 0; i < n; i++) { long long ai; cin >> ai; a.insert(ai); if (ai > maxai) maxai = ai; } while (maxai != 1 && a.size()) { long long br = 0; for (long long i = 1; i <= maxai / 2; i++) { if (maxai % i != 0) continue; for (long long k = 1; k < 1010; k++) { if (k * maxai / i > 1010) break; long long count = a.count(k * maxai / i); if (count) { br = 1; for (long long j = 0; j < count; j++) cout << k * maxai / i << ; a.erase(k * maxai / i); maxai = gcd(maxai, k * maxai / i); break; } } if (br) break; } if (!br) break; } for (multiset<long long>::iterator i = a.begin(); i != a.end(); i++) cout << *i << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; long long Gcd(long long a, long long b) { if (a % b == 0) return b; return Gcd(b, a % b); } 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 a; return b; } long long gcdExtended(long long a, long long b, long long *x, long long *y) { if (a == 0) { *x = 0, *y = 1; return b; } long long x1, y1; long long gcd = gcdExtended(b % a, a, &x1, &y1); *x = y1 - (b / a) * x1; *y = x1; return gcd; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long modInverse(long long a, long long m) { long long x, y; long long g = gcdExtended(a, m, &x, &y); if (g != 1) return -1; else { long long res = (x % m + m) % m; return res; } } vector<int> primeFactors(int n) { vector<int> v; while (n % 2 == 0) { v.push_back(2); n = n / 2; } for (int i = 3; i <= sqrt(n); i = i + 2) { while (n % i == 0) { v.push_back(i); n = n / i; } } if (n > 2) v.push_back(n); return v; } long long C[2001][2000]; void binomialCoeff(long long n, long long k) { long long i, j; for (i = 0; i <= n; i++) { for (j = 0; j <= k; j++) { if (j == 0 || j == i) C[i][j] = 1; else C[i][j] = (C[i - 1][j - 1] % 1000000007 + C[i - 1][j] % 1000000007) % 1000000007; } } } long long spf[100010]; void sieve() { spf[1] = 1; for (int i = 2; i < 100010; i++) spf[i] = i; for (int i = 4; i < 100010; i += 2) spf[i] = 2; for (int i = 3; i * i < 100010; i++) { if (spf[i] == i) { for (int j = i * i; j < 100010; j += i) if (spf[j] == j) spf[j] = i; } } } long long binarySearch(long long arr[], long long l, long long r, long long x) { if (r >= l) { long long mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; } const long long N = 100000; long long n; long long tree[2 * N]; void build(long long arr[]) { for (long long i = 0; i < n; i++) { tree[n + i] = arr[i]; } for (long long i = n - 1; i > 0; --i) { tree[i] = tree[i << 1] + tree[i << 1 | 1]; } } void updateTreeNode(long long p, long long value) { tree[p + n] = value; p = p + n; for (long long i = p; i > 1; i >>= 1) { tree[i >> 1] = tree[i] + tree[i ^ 1]; } } long long query(long long l, long long r) { long long res = 0; for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l & 1) { res += tree[l++]; } if (r & 1) { res += tree[--r]; } } return res; } void dfs(std::vector<long long> v[], long long s, bool visited[]) { visited[s] = true; for (long long i = 0; i < v[s].size(); ++i) { if (!visited[v[s][i]]) { dfs(v, v[s][i], visited); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string x69; cin >> x69; long long n = x69.length(); char s[n + 1]; for (int i = 0, _n = (n); i < _n; i++) { s[i + 1] = x69[i]; } long long ev = 0; long long od = 0; long long ao = 0; long long ae = 0; long long bo = 0; long long be = 0; for (int i = (1), _b = (n); i <= _b; i++) { if (s[i] == a ) { if (i % 2) { od += ao + 1; ev += ae; } else { od += ae + 1; ev += ao; } if (i % 2) ao++; else ae++; } if (s[i] == b ) { if (i % 2) { od += bo + 1; ev += be; } else { od += be + 1; ev += bo; } if (i % 2) bo++; else be++; } } cout << ev << << od << endl; return 0; } |
#include <bits/stdc++.h> const double EPS = 1e-24; const long long int MOD = 1000000007ll; const double PI = 3.14159265359; int INF = 2147483645; long long int INFINF = 9223372036854775807; template <class T> T Max2(T a, T b) { return a < b ? b : a; } template <class T> T Min2(T a, T b) { return a < b ? a : b; } template <class T> T Max3(T a, T b, T c) { return Max2(Max2(a, b), c); } template <class T> T Min3(T a, T b, T c) { return Min2(Min2(a, b), c); } template <class T> T Max4(T a, T b, T c, T d) { return Max2(Max2(a, b), Max2(c, d)); } template <class T> T Min4(T a, T b, T c, T d) { return Min2(Min2(a, b), Max2(c, d)); } using namespace std; int n; int a[110]; int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); reverse(a, a + n); int sum = 0, cur = 0; for (int i = 0; i < n; i++) sum += a[i]; int cnt = 0; while (cur <= sum / 2) cur += a[cnt++]; cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n, m, a, b; cin >> n >> m >> a >> b; a--; b--; vector<vector<int> > graph(n); for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; v--; graph[u].push_back(v); graph[v].push_back(u); } int x = 0; vector<bool> vis(n); function<void(int)> dfs = [&](int u) { vis[u] = true; for (int v : graph[u]) { if (vis[v] || v == x) continue; dfs(v); } }; x = b; dfs(a); int cnta = count(vis.begin(), vis.end(), false) - 1; fill(vis.begin(), vis.end(), false); x = a; dfs(b); int cntb = count(vis.begin(), vis.end(), false) - 1; cout << (long long)cnta * cntb << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int M = 0x3f3f3f3f; long long n, m, k, q, h; int ld[N], rd[N]; vector<long long> p; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n >> m >> k >> q; vector<vector<long long> > vec(n + 1); memset(ld, 0x3f, sizeof(ld)); memset(rd, 0x3f, sizeof(rd)); while (k--) { int x, y; cin >> x >> y; vec[x].push_back(y); } int f = !vec[1].empty(); vector<vector<long long> > tp = move(vec); for (int i = 1; i <= n; ++i) if (!tp[i].empty()) { h = i; sort(tp[i].begin(), tp[i].end()); vec.push_back(tp[i]); } long long l = (vec[0].back() << 1) - vec[0][0] - 1, r = vec[0].back() - 1, lp = vec[0][0], rp = vec[0].back(); while (q--) { int pos; cin >> pos; p.push_back(pos); } sort(p.begin(), p.end()); for (int i = 1; i <= m; ++i) { auto tmp = lower_bound(p.begin(), p.end(), i); if (tmp != p.end()) rd[i] = *tmp - i; else rd[i] = M; tmp = upper_bound(p.begin(), p.end(), i); if (tmp != p.begin()) ld[i] = i - *(tmp - 1); else ld[i] = M; } q = vec.size(); if (!f) l = r = rd[1], lp = rp = rd[1] + 1; for (int i = f; i < q; ++i) { vector<pair<long long, long long> > pos; if (ld[lp] ^ M) pos.push_back(make_pair(lp - ld[lp], l + ld[lp])); if (rd[lp] ^ M) pos.push_back(make_pair(lp + rd[lp], l + rd[lp])); if (ld[rp] ^ M) pos.push_back(make_pair(rp - ld[rp], r + ld[rp])); if (rd[rp] ^ M) pos.push_back(make_pair(rp + rd[rp], r + rd[rp])); l = r = 1e18, lp = vec[i][0], rp = vec[i].back(); for (auto j : pos) { if (j.first >= rp) l = min(l, j.second + j.first - lp); else l = min(l, j.second + rp - j.first + rp - lp); if (j.first <= lp) r = min(r, j.second + rp - j.first); else r = min(r, j.second + j.first - lp + rp - lp); } } cout << min(l, r) + h - 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string a; cin >> a; char vowels[5] = { a , e , i , o , u }; for (int i = 0; i < a.size() - 1; ++i) { bool flag = false; for (int k = 0; k < 5; ++k) { if (a[i] == vowels[k]) { flag = true; break; } } if (a[i] == n ) flag = true; if (flag) { continue; } for (int k = 0; k < 5; ++k) { if (a[i + 1] == vowels[k]) { flag = true; break; } } if (flag == false) { cout << NO << endl; return 0; } } int n = a.size(); bool flag = false; for (int k = 0; k < 5; ++k) { if (a[n - 1] == vowels[k]) { flag = true; break; } } if (a[n - 1] == n ) flag = true; if (flag == true) cout << YES << endl; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const long long Inf = 0x3f3f3f3f3f3f3f3f; int n, x, y, z, cnt, tot, head[maxn], vis[maxn]; long long res, r[maxn], l[maxn], l0[maxn], r0[maxn], sum[maxn], ans1, ans2 = Inf, f[maxn], cir[maxn]; struct Edge { int to, next, w; } e[maxn << 1]; void add(int u, int v, int w) { e[++cnt].to = v; e[cnt].w = w; e[cnt].next = head[u]; head[u] = cnt; } int fnd(int u, int fa = -1) { if (vis[u]) return u; vis[u] = -1; for (int i = head[u]; i; i = e[i].next) { int v = e[i].to; if (v != fa) { res = fnd(v, u); if (res) return cir[++tot] = u, sum[tot] = e[i].w, vis[u] = 1, res == u ? 0 : res; } } return 0; } void dfs(int u, int fa = -1) { for (int i = head[u]; i; i = e[i].next) { int v = e[i].to; if (vis[v] != 1 && v != fa) { dfs(v, u); ans1 = max(ans1, f[u] + f[v] + e[i].w); f[u] = max(f[u], f[v] + e[i].w); } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d , &x, &y, &z); add(x, y, z); add(y, x, z); } fnd(1); sum[0] = 0; for (int i = 1; i <= tot; i++) { dfs(cir[i]); sum[i] += sum[i - 1]; } res = l[0] = l0[0] = -Inf; for (int i = 1; i <= tot; i++) { l0[i] = max(l0[i - 1], f[cir[i]] + sum[i] + res); l[i] = max(l[i - 1], f[cir[i]] + sum[i]); res = max(res, f[cir[i]] - sum[i]); } res = r[tot + 1], r0[tot + 1] = -Inf; for (int i = tot; i >= 1; i--) { r0[i] = max(r0[i + 1], f[cir[i]] - sum[i] + res); r[i] = max(r[i + 1], f[cir[i]] + sum[tot] - sum[i]); res = max(res, f[cir[i]] + sum[i]); } for (int i = 1; i <= tot; i++) { ans2 = min(ans2, max(l[i - 1] + r[i], max(l0[i - 1], r0[i]))); } printf( %lld n , max(ans1, ans2)); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; bool Finish_read; template <class T> inline void read(T &x) { Finish_read = 0; x = 0; int f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; if (ch == EOF) return; ch = getchar(); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); x *= f; Finish_read = 1; } template <class T> inline void print(T x) { if (x / 10 != 0) print(x / 10); putchar(x % 10 + 0 ); } template <class T> inline void writeln(T x) { if (x < 0) putchar( - ); x = abs(x); print(x); putchar( n ); } template <class T> inline void write(T x) { if (x < 0) putchar( - ); x = abs(x); print(x); putchar( ); } int main() { int n; scanf( %d , &n); int t = sqrt(n); if (n % t) { for (int i = n / t * t + 1; i <= n; i++) printf( %d , i); } for (int i = n / t; i >= 1; i--) for (int j = (i - 1) * t + 1; j <= i * t; j++) printf( %d , j); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, a; cin >> n >> m >> a; cout << (n / a + (n % a != 0)) * (m / a + (m % a != 0)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200100; int n, b; queue<pair<int, int> > q; long long ans[MAXN]; int main() { scanf( %d%d , &n, &b); long long available = 0; memset(ans, 0xff, sizeof ans); for (int i = 0, t, d; i < n; ++i) { scanf( %d%d , &t, &d); while (!q.empty() && available <= t) { ans[q.front().first] = available += q.front().second; q.pop(); } available = max(available, (long long)t); if ((int)q.size() < b) { q.push(make_pair(i, d)); } } while (!q.empty()) { ans[q.front().first] = available += q.front().second; q.pop(); } for (int i = 0; i < n; ++i) { printf( %lld%c , ans[i], n [i + 1 == n]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x[3], l; scanf( %d%d%d%d , x, x + 1, x + 2, &l); long long ans = 1LL * (l + 3) * (l + 2) * (l + 1) / 6; for (int i = 0; i < 3; i++) for (int lx = 0; lx <= l; lx++) { int xx = min(l - lx, x[i] + lx - x[(i + 1) % 3] - x[(i + 2) % 3]); if (xx >= 0) ans -= 1LL * (2 + xx) * (1 + xx) / 2; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[100003], i; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; long long p = clock(); while (clock() - p < 1400) ; sort(a + 1, a + 1 + n); for (i = 1; i <= n; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3010; int a[MAXN], b[MAXN], c[MAXN]; int d[MAXN][2]; int main() { int n; while (~scanf( %d , &n)) { for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) scanf( %d , &b[i]); for (int i = 1; i <= n; ++i) scanf( %d , &c[i]); d[1][0] = b[1]; d[1][1] = a[1]; for (int i = 2; i <= n; ++i) { d[i][0] = max(d[i - 1][0] + b[i], d[i - 1][1] + c[i]); d[i][1] = max(d[i - 1][0] + a[i], d[i - 1][1] + b[i]); } printf( %d n , d[n][1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, l, a[110], s, x, len; int main() { cin >> n >> l; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] > s) s = a[i]; } for (int i = l; i <= s; i++) { for (int j = 1; j <= n; j++) x += a[j] / i; if (len < i * x) len = i * x; x = 0; } cout << len << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <int MOD_> struct modnum { static constexpr int MOD = MOD_; static_assert(MOD_ > 0, MOD must be positive ); private: using ll = long long; int v; static int minv(int a, int m) { a %= m; assert(a); return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a); } public: modnum() : v(0) {} modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; } explicit operator int() const { return v; } friend std::ostream& operator<<(std::ostream& out, const modnum& n) { return out << int(n); } friend std::istream& operator>>(std::istream& in, modnum& n) { ll v_; in >> v_; n = modnum(v_); return in; } friend bool operator==(const modnum& a, const modnum& b) { return a.v == b.v; } friend bool operator!=(const modnum& a, const modnum& b) { return a.v != b.v; } modnum inv() const { modnum res; res.v = minv(v, MOD); return res; } friend modnum inv(const modnum& m) { return m.inv(); } modnum neg() const { modnum res; res.v = v ? MOD - v : 0; return res; } friend modnum neg(const modnum& m) { return m.neg(); } modnum operator-() const { return neg(); } modnum operator+() const { return modnum(*this); } modnum& operator++() { v++; if (v == MOD) v = 0; return *this; } modnum& operator--() { if (v == 0) v = MOD; v--; return *this; } modnum& operator+=(const modnum& o) { v += o.v; if (v >= MOD) v -= MOD; return *this; } modnum& operator-=(const modnum& o) { v -= o.v; if (v < 0) v += MOD; return *this; } modnum& operator*=(const modnum& o) { v = int(ll(v) * ll(o.v) % MOD); return *this; } modnum& operator/=(const modnum& o) { return *this *= o.inv(); } friend modnum operator++(modnum& a, int) { modnum r = a; ++a; return r; } friend modnum operator--(modnum& a, int) { modnum r = a; --a; return r; } friend modnum operator+(const modnum& a, const modnum& b) { return modnum(a) += b; } friend modnum operator-(const modnum& a, const modnum& b) { return modnum(a) -= b; } friend modnum operator*(const modnum& a, const modnum& b) { return modnum(a) *= b; } friend modnum operator/(const modnum& a, const modnum& b) { return modnum(a) /= b; } }; template <typename T> T pow(T a, long long b) { assert(b >= 0); T r = 1; while (b) { if (b & 1) r *= a; b >>= 1; a *= a; } return r; } template <int M> string to_string(modnum<M> x) { return to_string(int(x)); } using num = modnum<998244353>; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int m, n, k; cin >> m >> n >> k; vector<num> p2(max(m, n) + 1); for (int i = 0; i <= max(m, n); i++) p2[i] = i ? p2[i - 1] * 2 : 1; map<pair<int, int>, int> cells; vector<int> rowTypeCnt(4), colTypeCnt(4); rowTypeCnt[0] = m; colTypeCnt[0] = n; vector<vector<int>> rowCnt(m, vector<int>(2)); vector<vector<int>> colCnt(n, vector<int>(2)); auto getRowType = [&](int x) { int res = 0; for (int i = 0; i < 2; i++) if (rowCnt[x][i]) res |= 1 << i; return res; }; auto getColType = [&](int x) { int res = 0; for (int i = 0; i < 2; i++) if (colCnt[x][i]) res |= 1 << i; return res; }; auto remove = [&](int x, int y) { if (!cells.count({x, y})) return; rowTypeCnt[getRowType(x)]--; colTypeCnt[getColType(y)]--; int v = cells[{x, y}]; cells.erase({x, y}); rowCnt[x][(x + y + v) & 1]--; colCnt[y][(x + y + v) & 1]--; rowTypeCnt[getRowType(x)]++; colTypeCnt[getColType(y)]++; }; auto add = [&](int x, int y, int v) { rowTypeCnt[getRowType(x)]--; colTypeCnt[getColType(y)]--; rowCnt[x][(x + y + v) & 1]++; colCnt[y][(x + y + v) & 1]++; cells[{x, y}] = v; rowTypeCnt[getRowType(x)]++; colTypeCnt[getColType(y)]++; }; while (k--) { int x, y, op; cin >> x >> y >> op; remove(--x, --y); if (op >= 0) add(x, y, op); if (rowTypeCnt[3] && colTypeCnt[3]) cout << 0 << n ; else if (rowTypeCnt[3]) cout << p2[colTypeCnt[0]] << n ; else if (colTypeCnt[3]) cout << p2[rowTypeCnt[0]] << n ; else if (rowTypeCnt[0] == m) cout << p2[m] + p2[n] - 2 << n ; else cout << p2[rowTypeCnt[0]] + p2[colTypeCnt[0]] - (rowTypeCnt[1] == 0 || rowTypeCnt[2] == 0) << n ; } } |
#include <bits/stdc++.h> using namespace std; int a, b; int x; int main() { scanf( %d%d%d , &a, &b, &x); if (a >= b) for (int i = 0; i <= x - 2; i++) { printf( %d , i & 1); a -= !(i & 1); b -= (i & 1); } else { for (int i = 1; i <= x - 1; i++) { printf( %d , i & 1); a -= !(i & 1); b -= (i & 1); } x++; } if (x & 1) { for (int i = 0; i < a; i++) printf( 0 ); for (int i = 0; i < b; i++) printf( 1 ); } else { for (int i = 0; i < b; i++) printf( 1 ); for (int i = 0; i < a; i++) printf( 0 ); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long n, m, p; cin >> n >> m >> p; long long a; long long b; long long u = 0, v = 0; for (long long i = 1; i <= n; i++) { cin >> a; if (u == 0 && a % p != 0) { u = i; } } for (long long i = 1; i <= m; i++) { cin >> b; if (v == 0 && b % p != 0) { v = i; } } cout << u + v - 2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; vector<int> *dist = new vector<int>[n]; int len = 0; for (int i = 0; i < n; i++) { int d; cin >> d; dist[d].push_back(i); len = max(len, d); } if (dist[0].size() != 1) { cout << -1; return 0; } for (int i = 1; i <= len; i++) { if (dist[i].empty() || dist[i].size() > (long long)dist[i - 1].size() * (k - (i != 1))) { cout << -1; return 0; } } cout << n - 1 << endl; for (int i = 1; i <= len; i++) { int counter = 0; int index = 0; for (int child : dist[i]) { if (counter == k - (i != 1)) { counter = 0; index++; } cout << dist[i - 1][index] + 1 << << child + 1 << endl; counter++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, n; cin >> a >> b >> n; bool aa = 0, bb = 1; if (a < b) swap(a, b), swap(aa, bb); for (int i = 0; i < a - (n + 1) / 2 - (n % 2 == 0); i++) cout << aa; for (int i = 0; i < (n + 1) / 2; i++) cout << aa << bb; for (int i = 0; i < b - (n + 1) / 2; i++) cout << bb; if (n % 2 == 0) cout << aa; } |
#include <bits/stdc++.h> char s[100005], stack[100005], ss; int main() { long long n, k, now, i, i2, l, plus = 0, kid, pos; scanf( %lld %lld , &n, &k); for (i = 1; i <= k; i++) { scanf( %lld , &now); plus = 0; ss = 0; kid = n; while (kid / 2 + plus + 1 != now) { if (kid / 2 + plus + 1 < now) { stack[++ss] = R ; plus += kid / 2 + 1; kid /= 2; } else { stack[++ss] = L ; kid /= 2; } } now = kid; scanf( %s , s); l = strlen(s); for (i2 = 0; i2 < l; i2++) { if (s[i2] == R ) { if (now == 1) continue; plus += now / 2 + 1; now /= 2; stack[++ss] = R ; } else if (s[i2] == L ) { if (now == 1) continue; now /= 2; stack[++ss] = L ; } else { if (now == n) continue; if (stack[ss] == R ) plus -= now + 1; now = now * 2 + 1; ss--; } } printf( %lld n , plus + now / 2 + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 10; const int MAXM = 4e6 + 10; const long long MOD = 1e9 + 7; const long long INF = 0x3f3f3f3f; const unsigned long long BASE = 233; const int base = 5; mt19937_64 mt(time(0)); char rubbish[110]; bool GETDATA; inline long long read() { long long x = 0, f = 1; char ch; do { ch = getchar(); if (ch == - ) f = -1; } while (ch < 0 || ch > 9 ); do { x = x * 10 + ch - 48; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return x * f; } inline void write(long long x, char con = n ) { if (x < 0) putchar( - ), x = -x; if (x > 9) write(x / 10, 0); putchar(x % 10 + 0 ); if (con) { printf( %c , con); } } long long N, M, K, Q; long long a[MAXN]; char s[MAXN][110]; int sz[MAXN]; vector<int> es[30]; vector<pair<int, int> > tot; vector<int> topsort; bool occ[30]; bool vis[30]; int ord[30]; void dfs(int u) { vis[u] = true; for (auto v : es[u]) { if (!vis[v]) { dfs(v); } } topsort.push_back(u); } void init() { for (int i = 0; i < 30; i++) { es[i].clear(); occ[i] = false; vis[i] = false; } tot.clear(); topsort.clear(); } void solve() { long long ans = 0; int now; int id; N = read(); M = read(); init(); for (int i = 0; i < N; i++) { now = read(); for (int j = 0; j < M; j++) { id = now * N + j; scanf( %s , s[id]); for (sz[id] = 0; s[id][sz[id]] != 0 ; sz[id]++) { occ[s[id][sz[id]] - a ] = true; } } } for (int i = 1, j; i < N * M; i++) { now = min(sz[i - 1], sz[i]); for (j = 0; j < now; j++) { if (s[i - 1][j] != s[i][j]) { break; } } if (j < now) { es[s[i][j] - a ].push_back(s[i - 1][j] - a ); tot.push_back(pair<int, int>{s[i][j] - a , s[i - 1][j] - a }); } else if (sz[i - 1] > sz[i]) { printf( IMPOSSIBLE n ); return; } } for (int i = 0; i < 26; i++) { if (occ[i] && !vis[i]) { dfs(i); } } for (int i = 0; i < topsort.size(); i++) { ord[topsort[i]] = i; } for (auto x : tot) { if (ord[x.first] < ord[x.second]) { printf( IMPOSSIBLE n ); return; } } for (auto ch : topsort) { printf( %c , ch + a ); } printf( n ); } int main() { int T; T = 1; for (int t = 1; t <= T; t++) { GETDATA = false; solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int ts, kk = 1; template <class T> inline T _sq(T a) { return a * a; } template <class T, class X> inline T _pow(T a, X y) { T z = 1; for (int i = 1; i <= y; i++) { z *= a; } return z; } template <class T> inline T _gcd(T a, T b) { a = _abs(a); b = _abs(b); if (!b) return a; return _gcd(b, a % b); } template <class T> inline T _lcm(T a, T b) { a = _abs(a); b = _abs(b); return (a / _gcd(a, b)) * b; } template <class T> inline T _extended(T a, T b, T &x, T &y) { a = _abs(a); b = _abs(b); T g, x1, y1; if (!b) { x = 1; y = 0; g = a; return g; } g = _extended(b, a % b, x1, y1); x = y1; y = x1 - (a / b) * y1; return g; } template <class T, class X> inline bool getbit(T a, X i) { T t = 1; return ((a & (t << i)) > 0); } template <class T, class X> inline T setbit(T a, X i) { T t = 1; return (a | (t << i)); } template <class T, class X> inline T resetbit(T a, X i) { T t = 1; return (a & (~(t << i))); } template <class T, class X> inline T togglebit(T a, X i) { T t = 1; return (a ^ (t << i)); } template <class T, class X, class Y> inline T _bigmod(T n, X m, Y mod) { unsigned long long ret = 1, a = n % mod; while (m) { if (m & 1) ret = (ret * a) % mod; m >>= 1; a = (a * a) % mod; } ret %= mod; return (T)ret; } template <class T, class Y> inline T _modinv(T n, Y mod) { return _bigmod(n, mod - 2, mod); } int main() { int n, cnt = 0; ; double x, tot = 0.0, ans, add; cin >> n; for (int i = 1; i <= n + n; i++) { cin >> x; add = (x - (int)x); tot += add; if (add == 0.0) cnt++; } tot -= n; while (cnt-- > 0 && tot < -.5) tot += 1.0; tot = fabs(tot); cout << setprecision(3) << fixed << tot << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int maxn = 1007; long long dp[maxn][maxn][4]; char s[maxn]; int T, k; long long dfs(int pos, int dis, int ok, int limit) { if (pos == -1) { return ok; } if (!limit && dp[pos][dis][ok] != -1) return dp[pos][dis][ok]; int up = limit ? s[pos] - 0 : 9; long long res = 0; for (int i = 0; i <= up; i++) { if (i != 4 && i != 7) res = (res + dfs(pos - 1, max(0, dis - 1), ok, limit && (i == up))) % MOD; else res = (res + dfs(pos - 1, k, ok || dis, limit && (i == up))) % MOD; } if (!limit) dp[pos][dis][ok] = res; return res; } int check(int len) { int pre = -1; for (int i = 0; i < len; i++) { if (s[i] == 4 || s[i] == 7 ) { if (pre != -1 && i - pre <= k) return 1; pre = i; } } return 0; } int main() { memset(dp, -1, sizeof(dp)); scanf( %d%d , &T, &k); while (T--) { scanf( %s , s); int len = strlen(s); for (int i = 0; i < len / 2; i++) swap(s[i], s[len - 1 - i]); long long ans = (dfs(len - 1, 0, 0, true) - check(len) + MOD) % MOD; scanf( %s , s); len = strlen(s); for (int i = 0; i < len / 2; i++) swap(s[i], s[len - 1 - i]); ans = (dfs(len - 1, 0, 0, true) - ans + MOD) % MOD; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; clock_t time_p = clock(); void timer() { time_p = clock() - time_p; cerr << Execution Time: << (double)(time_p) / CLOCKS_PER_SEC << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, k, r = 2, g = 5, b = 8, cnt = 0, tot = 0; cin >> n >> k; r *= n; g *= n; b *= n; if (r % k) cnt += (r / k + 1); else cnt += r / k; if (g % k) cnt += (g / k + 1); else cnt += g / k; if (b % k) cnt += (b / k + 1); else cnt += b / k; cout << cnt; timer(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e3 + 6.66; const int MAXM = 2e3 + 6.66; const long long MOD = 1e9 + 7; long long dp[MAXN][MAXM]; long long dp1[MAXN][MAXM]; long long par[MAXN][MAXM]; long long par2[MAXN][MAXM]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; for (int sz = 0; sz < m - 1; sz++) dp[0][sz] = 1; for (int i = 1; i <= n; i++) { for (int j = 0; j < m - 1; j++) { if (i == 1) { dp[i][j] = 1; dp1[i][j] = 1; par[i][j] = j + 1; par2[i][j] = par2[i][j - 1] + j + 1; continue; } dp1[i][j] = (1 + ((2 + j) * par[i - 1][j - 1]) % MOD * 1LL - par2[i - 1][j - 1] * 1LL + MOD) % MOD; dp[i][j] = (1 + ((2 + j) * par[i - 1][j]) % MOD - par2[i - 1][j] + MOD) % MOD; par[i][j] = (par[i][j - 1] + dp[i][j]) % MOD; par2[i][j] = (par2[i][j - 1] + (1LL * (j + 1LL) * dp[i][j]) % MOD) % MOD; } } long long ans = 0LL; for (int t = 0; t < n; t++) for (int sz = 0; sz < m - 1; sz++) { ans = (ans + (((m - sz - 1LL) * 1LL * dp[t + 1][sz]) % MOD * dp1[n - t][sz]) % MOD) % MOD; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, n, m, a[1000001], t1, t2, sum; int main() { cin >> n >> m; for (i = 0; i < m; i++) { scanf( %I64d %I64d , &t1, &t2); a[t1]++; a[t2]++; } for (i = 1; i <= n; i++) sum += a[i] * (n - 1LL - a[i]); sum /= 2LL; cout << n * (n - 1LL) * (n - 2LL) / 6LL - sum << endl; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000; set<pair<long long, long long> > q; long long prod(pair<long long, long long> a, pair<long long, long long> b) { return a.first * b.second - a.second * b.first; } bool check(pair<long long, long long> a, pair<long long, long long> b, pair<long long, long long> c) { return (prod({b.first - a.first, b.second - a.second}, {c.first - a.first, c.second - a.second}) > 0); } const long double eps = 1e-12; void addPoint(long long x, long long y) { while (q.size()) { auto it = q.lower_bound({x, 0}); if (it != q.end() && it->first == x) { if (it->second > y) q.erase(it); else return; } else break; } auto it1 = q.lower_bound({x, 0}); if (it1 != q.end()) { if (it1->second <= y) return; auto it2 = q.lower_bound({x, 0}); it2--; if (!check(*it2, {x, y}, *it1)) return; } while (q.size() > 1) { auto it1 = q.lower_bound({x, 0}); if (it1 == q.end()) break; auto it2 = q.upper_bound(*it1); if (it2 == q.end()) break; if (!check({x, y}, *it1, *it2)) q.erase(it1); else break; } while (q.size()) { auto it1 = q.lower_bound({x, 0}); if (it1 == q.begin()) break; it1--; if (it1 == q.begin()) break; auto it2 = q.lower_bound({x, 0}); it2--; it2--; if (!check(*it2, *it1, {x, y})) q.erase(it1); else break; } q.insert({x, y}); } long long maxx = 0, yy = 0; long double f(long double x) { if ((long double)q.rbegin()->first + eps < x) return 1e14; pair<int, int> it1 = *q.lower_bound({(long long)(x - eps), 0}); if (abs(it1.first - x) < eps) return it1.second; auto kek = q.lower_bound({(long long)(x - eps), 0}); kek--; pair<int, int> it2 = *kek; long double X = it1.first, Y = it1.second, XX = it2.first, YY = it2.second; long double a = YY - Y, b = X - XX, c = -a * X - b * Y; return (-a * x - c) / b; } int main() { ios::sync_with_stdio(0); int qq; long long m; cin >> qq >> m; int j = 0; q.insert({0, 0}); int k = 0; for (int i = 1; i <= qq; i++) { int k, a, b; cin >> k >> a >> b; if (k == 1) { long long x = (a + j) % MOD + 1; long long y = (b + j) % MOD + 1; if (x > maxx) { maxx = x; yy = y; } else if (x == maxx) yy = min(yy, y); addPoint(x, y); } else { k++; long long t = (a + j) % MOD + 1; long long h = (b + j) % MOD + 1; long long x = (h + t - 1) / t; auto it1 = q.lower_bound({x, 0}); bool ok = 0; if (it1 != q.end()) { auto it2 = prev(it1); long long a = it1->second - it2->second, b = it2->first - it1->first, c = -it1->first * a - it1->second * b; if (b < 0) a *= -1, b *= -1, c *= -1; if (-a * h - c * t <= m * b) ok = true; } if (ok) { j = i; cout << YES n ; } else cout << NO n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; int N, M, K; int A[MAXN]; int B[MAXN]; set<int> adj[MAXN]; int deg[MAXN]; set<pair<int, int> > st; bool inGraph[MAXN]; int ans[MAXN]; void update(int x) { if (!inGraph[x]) return; set<pair<int, int> >::iterator it = st.find(make_pair(deg[x], x)); st.erase(it); deg[x]--; st.insert(make_pair(deg[x], x)); } void fix() { while (!st.empty() && st.begin()->first < K) { int cur = st.begin()->second; st.erase(st.begin()); inGraph[cur] = false; for (auto nxt : adj[cur]) { adj[nxt].erase(cur); update(nxt); } adj[cur].clear(); } } int main() { scanf( %d %d %d , &N, &M, &K); for (int i = 0; i < M; i++) { scanf( %d %d , &A[i], &B[i]); deg[A[i]]++; deg[B[i]]++; adj[A[i]].insert(B[i]); adj[B[i]].insert(A[i]); } for (int i = 1; i <= N; i++) { st.insert(make_pair(deg[i], i)); inGraph[i] = true; } for (int i = M - 1; i >= 0; i--) { fix(); ans[i] = st.size(); adj[A[i]].erase(B[i]); adj[B[i]].erase(A[i]); if (inGraph[B[i]]) update(A[i]); if (inGraph[A[i]]) update(B[i]); } for (int i = 0; i < M; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( avx2 ) using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long k; cin >> k; long long pref = 0; vector<long long> poww10(17); poww10[0] = 1; for (int i = 1; i < 17; i++) { poww10[i] = poww10[i - 1] * 10; } for (int len = 1; len <= 15; len++) { if (pref + len * (poww10[len] - poww10[len - 1]) >= k) { k -= pref; long long l = 0, r = poww10[len] - poww10[len - 1]; while (l + 1 < r) { long long mid = (l + r) / 2; if (len * mid < k) { l = mid; } else { r = mid; } } k -= len * l; cout << to_string(poww10[len - 1] + l)[k - 1] << n ; return 0; } pref += len * (poww10[len] - poww10[len - 1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int l, r, x, y; vector<int> primes; int cnt(int idx, int a, int b) { if (idx == primes.size()) return a >= l && a <= r && b >= l && b <= r; return cnt(idx + 1, a * primes[idx], b) + cnt(idx + 1, a, b * primes[idx]); } int main() { cin >> l >> r >> x >> y; if (y % x) return puts( 0 ); y /= x; for (int i = 2; i * i <= y; i++) { int v = 1; while (y % i == 0) y /= i, v *= i; if (v > 1) primes.push_back(v); } if (y > 1) primes.push_back(y); cout << cnt(0, x, x); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi = acos(0) * 2; template <typename T> inline void read(T &x) { char c; bool nega = 0; while ((!isdigit(c = getchar())) && (c != - )) ; if (c == - ) { nega = 1; c = getchar(); } x = c - 48; while (isdigit(c = getchar())) x = x * 10 + c - 48; if (nega) x = -x; } template <typename T> inline void writep(T x) { if (x > 9) writep(x / 10); putchar(x % 10 + 48); } template <typename T> inline void write(T x) { if (x < 0) { putchar( - ); x = -x; } writep(x); } template <typename T> inline void writeln(T x) { write(x); putchar( n ); } int n, m; int r[500001]; int root(int u) { if (r[u] < 0) return u; return r[u] = root(r[u]); } bool unite(int u, int v) { u = root(u); v = root(v); if (u == v) return 0; if (r[u] > r[v]) swap(u, v); r[u] += r[v]; r[v] = u; return 1; } int main() { read(n); read(m); for (int i = (1); i <= (n); i++) r[i] = -1; for (int i = (1); i <= (m); i++) { int k; read(k); int v = -1; int u; for (int i = (1); i <= (k); i++) { read(u); if (v != -1) unite(u, v); else v = u; } } for (int i = (1); i <= (n); i++) { write(-r[root(i)]); putchar( n [i == n]); } } |
#include <bits/stdc++.h> using namespace std; struct graph { int n; vector<vector<int>> adj; graph(int n) : n(n), adj(n) {} void add_edge(int u, int v) { adj[u].push_back(v); } vector<int> &operator[](int u) { return adj[u]; } }; vector<vector<int>> scc_gabow(graph &adj) { int n = adj.n; vector<vector<int>> scc; vector<int> S, B, I(n); function<void(int)> dfs = [&](int u) { B.push_back(I[u] = S.size()); S.push_back(u); for (int v : adj[u]) if (!I[v]) dfs(v); else while (I[v] < B.back()) B.pop_back(); if (I[u] == B.back()) { scc.push_back({}); for (B.pop_back(); I[u] < S.size(); S.pop_back()) { scc.back().push_back(S.back()); I[S.back()] = n + scc.size(); } } }; for (int u = 0; u < n; ++u) if (!I[u]) dfs(u); return scc; } const long long mod = 1000000007; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; graph adj(n); int m; cin >> m; for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; adj.add_edge(--u, --v); } auto scc = scc_gabow(adj); long long mn = 0, ways = 1; for (auto &comp : scc) { long long best = a[comp[0]], total = 0; for (int u : comp) if (a[u] == best) ++total; else if (a[u] < best) best = a[u], total = 1; mn += best; ways = ways * total % mod; } cout << mn << << ways << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5005; short dp[N][N]; int ans[N]; int main() { string s; cin >> s; int n; n = s.size(); for (int len = 1; len <= n; len++) { for (int l = 0; l < n - len + 1; l++) { int r = l + len; if (len == 1) { dp[l][r] = 1; continue; } else if (len == 2) { dp[l][r] = (s[l] == s[r - 1] ? 2 : 0); continue; } if (s[l] != s[r - 1] || !dp[l + 1][r - 1]) { continue; } dp[l][r] = 1; int m = (l + r) >> 1; if (len & 1) { if (dp[l][m] && dp[m + 1][r]) { dp[l][r] = dp[l][m] + 1; } } else { if (dp[l][m] && dp[m][r]) { dp[l][r] = dp[l][m] + 1; } } } } for (int len = 1; len <= n; len++) { for (int l = 0; l < n - len + 1; l++) { ans[dp[l][l + len]]++; } } for (int i = n - 1; i >= 1; i--) { ans[i] += ans[i + 1]; } for (int i = 1; i <= n; i++) { cout << ans[i] << ; } cout << n ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.