func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> long long strange[100001]; int main() { for (int i = 1; i <= 100000; i++) { long long a = i, b = i; while (b) { a *= 10; a += b % 10; b /= 10; } strange[i] = a; } long long k, p; while (scanf( %lld%lld , &k, &p) != EOF) { long long sum = 0; for (int i = 1; i <= k; i++) sum += strange[i]; printf( %lld n , sum % p); } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long int LINF = 0x3f3f3f3f3f3f3f3fll; int g; bool endswith(string a, string b) { if ((int)((a).size()) < (int)((b).size())) return 0; for (int i = 0; i < (int)((b).size()); i++) if (a[(int)((a).size()) - 1 - i] != b[(int)((b).size()) - 1 - i]) return 0; return 1; } bool is_adj(string second) { if (endswith(second, lios )) g = 1; else if (endswith(second, liala )) g = 2; else return 0; return 1; } bool is_noun(string second) { if (endswith(second, etr )) g = 1; else if (endswith(second, etra )) g = 2; else return 0; return 1; } bool is_verb(string second) { if (endswith(second, initis )) g = 1; else if (endswith(second, inites )) g = 2; else return 0; return 1; } int main() { ios::sync_with_stdio(false); vector<string> v; string second; while (cin >> second) v.push_back(second); if ((int)((v).size()) == 1) { if (is_adj(v[0]) or is_noun(v[0]) or is_verb(v[0])) cout << YES << endl; else cout << NO << endl; return 0; } int last = -1; int n = 0; bool masc, deu = 1; for (int i = 0; i < (int)((v).size()); i++) { if (is_adj(v[i])) { if (last > 0) deu = 0; last = 0; } else if (is_noun(v[i])) { if (last > 1) deu = 0; n++; last = 1; } else if (is_verb(v[i])) { last = 2; } else deu = 0; if (!i) masc = (g == 1); else if (masc and g == 2) deu = 0; else if (!masc and g == 1) deu = 0; } if (n != 1) deu = 0; int cu; cout << (deu ? YES : NO ) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int in() { int x; scanf( %d , &x); return x; } const int INF = 1e9 + 10; const long long LINF = 1000ll * 1000 * 1000 * 1000 * 1000 * 1000 + 100; const int MN = 3e3 + 10; int n; vector<pair<int, int> > edges[MN]; int ans; int dp1[MN], dp2[MN]; int sz[MN]; void input() { n = in(); for (int i = 0; i < n - 1; ++i) { int a, b; a = in(), b = in(); edges[a].push_back(pair<int, int>(b, 1)); edges[b].push_back(pair<int, int>(a, 0)); } } void dfs1(int s, int pr) { for (int i = 0; i < ((int)(edges[s]).size()); ++i) { if (edges[s][i].first == pr) continue; if (edges[s][i].second == 0) ++sz[s]; dfs1(edges[s][i].first, s); sz[s] += sz[edges[s][i].first]; } } void dfs2(int s, int pr) { for (int i = 0; i < ((int)(edges[s]).size()); ++i) { if (edges[s][i].first == pr) continue; dfs2(edges[s][i].first, s); } int Mn = sz[s]; for (int i = 0; i < ((int)(edges[s]).size()); ++i) { if (edges[s][i].first == pr) continue; if (edges[s][i].second) { Mn = min(Mn, dp1[edges[s][i].first] + 1 + sz[s] - sz[edges[s][i].first]); } else { Mn = min(Mn, dp1[edges[s][i].first] + sz[s] - 1 - sz[edges[s][i].first]); } } dp1[s] = Mn; Mn = INF; for (int i = 0; i < ((int)(edges[s]).size()); ++i) { if (edges[s][i].first == pr) continue; if (edges[s][i].second) { Mn = min(Mn, dp2[edges[s][i].first] + sz[s] - sz[edges[s][i].first]); } else { Mn = min(Mn, dp1[edges[s][i].first] + sz[s] - sz[edges[s][i].first] - 1); Mn = min(Mn, dp2[edges[s][i].first] + sz[s] - sz[edges[s][i].first]); } } dp2[s] = Mn; } int main() { input(); int mn = INF; for (int i = 0; i < n; ++i) { memset(dp1, 0, sizeof dp1); memset(dp2, 0, sizeof dp2); memset(sz, 0, sizeof sz); dfs1(i, -1); dfs2(i, -1); mn = min(mn, dp2[i]); } if (n <= 2) mn = 0; cout << mn << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; while (t--) { long long int n, i, j; cin >> n; long long int a[n]; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); std::vector<long long int> ans; long long int last = 64 - __builtin_clzll(a[n - 1]); for (i = 0; i < last + 1; i++) { std::vector<long long int> temp; for (j = 0; j < n; j++) { bitset<70> b(a[j]); if (b[i]) temp.push_back(a[j]); } bool f = 0; for (j = i - 1; j > -1; j--) { bool f1 = 0; for (auto x : temp) { bitset<70> b(x); if (b[j] == 0) f1 = 1; } if (!f1) { f = 1; break; } } if (f) continue; if (temp.size()) { ans = temp; } } cout << ans.size() << n ; for (auto x : ans) cout << x << ; } cerr << Time Taken: << (float)clock() / CLOCKS_PER_SEC * 1000 << ms << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline long long int rand(long long int x, long long int y) { ++y; return (rng() % (y - x)) + x; } string to_string(char c) { string second(1, c); return second; } string to_string(bool b) { return (b ? true : false ); } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } void degug_out() { cerr << endl; } template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) { cerr << << to_string(H); degug_out(T...); } inline long long int gcd(long long int a, long long int b) { if (a > b) swap(a, b); if (a == 0) return b; return gcd(b % a, a); } long long int n, m; vector<vector<char>> grid; vector<vector<int>> dist, dist2; long long int dx[] = {1, 0, -1, 0}; long long int dy[] = {0, 1, 0, -1}; void bfs(long long int x, long long int y, long long int op) { dist[x][y] = 0; queue<pair<long long int, long long int>> q; q.emplace(x, y); while (q.size()) { long long int x = q.front().first, y = q.front().second; q.pop(); if (op == 0) { for (long long int i = (0); i <= (long long int)(1); ++i) { long long int nx = x + dx[i]; long long int ny = y + dy[i]; if (nx < 0 || ny < 0 || nx >= n || ny >= m || ~dist[nx][ny] || grid[nx][ny] == # ) continue; dist[nx][ny] = dist[x][y] + 1; q.emplace(nx, ny); } } else { for (long long int i = (2); i <= (long long int)(3); ++i) { long long int nx = x + dx[i]; long long int ny = y + dy[i]; if (nx < 0 || ny < 0 || nx >= n || ny >= m || ~dist[nx][ny] || grid[nx][ny] == # ) continue; dist[nx][ny] = dist[x][y] + 1; q.emplace(nx, ny); } } } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; grid.resize(n, vector<char>(m, * )); dist.resize(n, vector<int>(m, -1)); dist2.resize(n, vector<int>(m, -1)); for (long long int i = (0); i <= (long long int)(n - 1); ++i) for (long long int j = (0); j <= (long long int)(m - 1); ++j) cin >> grid[i][j]; bfs(0, 0, 0); swap(dist, dist2); bfs(n - 1, m - 1, 1); if (dist2[n - 1][m - 1] == -1) { cout << 0; return 0; } map<long long int, long long int> co; for (long long int i = (0); i <= (long long int)(n - 1); ++i) for (long long int j = (0); j <= (long long int)(m - 1); ++j) if (~dist[i][j] && ~dist2[i][j] && dist2[i][j] && dist2[i][j] != (n - 1 + m - 1)) co[dist2[i][j]]++; for (long long int i = (0); i <= (long long int)(n - 1); ++i) for (long long int j = (0); j <= (long long int)(m - 1); ++j) if (~dist[i][j] && ~dist2[i][j] && dist2[i][j] && dist2[i][j] != (n - 1 + m - 1)) if (co[dist2[i][j]] == 1) { cout << 1; return 0; } cout << 2; } |
#include <bits/stdc++.h> const long long N = 1000006; using namespace std; const long long MOD = 1000000007LL; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T power(T x, T y, long long m = MOD) { T ans = 1; while (y > 0) { if (y & 1LL) ans = (ans * x) % m; y >>= 1LL; x = (x * x) % m; } return ans % m; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; if (n == 1) { cout << 0 ; return 0; } multiset<long long> l, r; vector<pair<long long, long long> > v; for (long long(i) = (0); i < (n); i++) { long long x, y; cin >> x >> y; l.insert(x); r.insert(y); v.emplace_back(make_pair(x, y)); } long long ans = 0; for (long long(i) = (0); i < (n); i++) { l.erase(l.find(v[i].first)); r.erase(r.find(v[i].second)); long long dist = max(0LL, *r.begin() - *l.rbegin()); ans = max(ans, dist); l.insert(v[i].first); r.insert(v[i].second); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int a[100001], n; inline long long sum(int t) { long long s = 0; for (int i = 1; i <= n; ++i) s += min(a[i], t); return s; } int main() { int i, j, l, r, m, t = 1; int nr = 0; long long k, s = 0, smin; scanf( %d %I64d , &n, &k); for (i = 1; i <= n; ++i) { scanf( %d , &a[i]); s += a[i]; } if (s < k) printf( -1 ); else if (s == k) printf( ); else { l = 0; r = 1000000000; while (l + 1 < r) { m = (l + r) >> 1; if (sum(m) <= k) l = m; else r = m; } k -= sum(l); if (s == k) printf( ); else { for (i = 1; i <= n; ++i) { if (k == 0) break; if (a[i] > l) { --k; --a[i]; } } for (j = i; j <= n; ++j) if (a[j] > l) printf( %d , j); for (j = 1; j < i; ++j) if (a[j] > l) printf( %d , j); } } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int n, m, k, start = MAXN + 1; int type[MAXN + 3], a[MAXN + 3], counter[MAXN + 3], stc[MAXN + 3]; bool check[MAXN + 3]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &type[i]); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) counter[a[i]]++; for (int i = 1; i <= n; i++) if (counter[i] == 1) check[i] = true; int cnt = 0; for (int i = n; i >= 1; i--) { if (type[i] == 1) { cnt = 1; int v = a[i]; while (v != 0 && check[v]) { cnt++; v = a[v]; } if (cnt > k) k = cnt, start = i; } } printf( %d n , k); for (int i = 0, v = start; i < k; i++, v = a[v]) stc[i] = v; for (int i = k - 1; i >= 0; i--) printf( %d , stc[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long l, r, ans; vector<long long> lucky; void lu(int f, int s) { string x = ; for (int i = 0; i < f; i++) x += 4 ; for (int i = 0; i < s; i++) x += 7 ; do lucky.push_back(atoll(x.c_str())); while (next_permutation(x.begin(), x.end())); } int main() { cin >> l >> r; for (int i = 0; i <= 10; i++) for (int j = 0; j <= 10; j++) if (i + j <= 10) lu(i, j); sort(lucky.begin(), lucky.end()); int j, k; j = k = 0; while (lucky[j++] < l) ; j--; while (lucky[k++] < r) ; k--; ans += lucky[j] * (min(r - l, lucky[j] - l) + 1); if (lucky[j] == lucky[k]) return cout << ans << endl, 0; ans += lucky[k] * (r - lucky[k - 1]); for (int i = j + 1; i < k; i++) ans += (lucky[i] - lucky[i - 1]) * lucky[i]; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, 1, 1, -1, -1}; int dy[] = {1, -1, 0, 0, 1, -1, 1, -1}; int a[33]; string s; int main() { for (int i = 0; i < 26; ++i) scanf( %d , &a[i]); cin >> s; int len = s.length(); vector<long long> v(len + 1); for (int i = 0; i < len; ++i) { v[i + 1] = a[s[i] - a ] + v[i]; } map<pair<int, long long>, int> m; long long res = 0; for (int i = 0; i < len; i++) { if (m[make_pair(s[i] - a , v[i + 1])]) { res += m[make_pair(s[i] - a , v[i + 1])]; } m[make_pair(s[i] - a , v[i + 1] + a[s[i] - a ])]++; } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int arr[101][101]; int row[101], col[101]; for (int i = 0; i <= n - 1; i++) { row[i] = col[i] = 0; } int temp; for (int i = 0; i <= n - 1; i++) { for (int j = 0; j <= n - 1; j++) { scanf( %d , &temp); arr[i][j] = temp; row[i] += temp; col[j] += temp; } } int ans = 0; for (int i = 0; i <= n - 1; i++) { for (int j = 0; j <= n - 1; j++) { if (col[j] > row[i]) ans++; } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int m, n, k, t; int a[100001]; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; ++i) { scanf( %d , &t); a[i % k] += t; } m = 0; for (int i = 1; i < k; ++i) if (a[i] < a[m]) m = i; printf( %d n , m + 1); } |
#include <bits/stdc++.h> using namespace std; vector<int> vec[1000006], V; struct Node { int x, y, w; bool operator<(const Node& a) const { return y < a.y; } } node[500006]; int n; struct Info { long long len, mx, w; int p; Info() {} Info(long long _len, long long _mx, long long _w, int _p) { len = _len; mx = _mx; w = _w; p = _p; } Info operator+(const Info& a) { Info ret; ret.len = len + a.len; ret.w = w + a.w; if (a.mx >= a.w + mx - a.len) { ret.mx = a.mx; ret.p = a.p; } else { ret.mx = a.w + mx - a.len; ret.p = p; } return ret; } void pr() { printf( %lld %lld %lld %d n , len, mx, w, p); } } info[1000006 << 2]; void build(int p, int l, int r) { if (l == r) { int len = 0; if (l > 1) len = V[l - 1] - V[l - 2]; info[p] = Info(len, 0, 0, l); return; } int mid = (l + r) >> 1; build(p << 1, l, mid); build(p << 1 | 1, mid + 1, r); info[p] = info[p << 1] + info[p << 1 | 1]; } void update(int p, int l, int r, int aim, long long w) { if (l == r) { info[p].w += w; info[p].mx += w; return; } int mid = (l + r) >> 1; if (aim <= mid) update(p << 1, l, mid, aim, w); else update(p << 1 | 1, mid + 1, r, aim, w); info[p] = info[p << 1] + info[p << 1 | 1]; } Info query(int p, int l, int r, int L, int R) { if (L <= l && r <= R) { return info[p]; } int mid = (l + r) >> 1; if (L <= mid && R > mid) return query(p << 1, l, mid, L, R) + query(p << 1 | 1, mid + 1, r, L, R); else if (L <= mid) return query(p << 1, l, mid, L, R); else if (R > mid) return query(p << 1 | 1, mid + 1, r, L, R); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d , &node[i].x, &node[i].y, &node[i].w); if (node[i].x > node[i].y) swap(node[i].x, node[i].y); V.push_back(node[i].x); V.push_back(node[i].y); } sort(node + 1, node + n + 1); sort(V.begin(), V.end()); V.resize(unique(V.begin(), V.end()) - V.begin()); for (int i = 1; i <= n; i++) { node[i].x = lower_bound(V.begin(), V.end(), node[i].x) - V.begin(); node[i].y = lower_bound(V.begin(), V.end(), node[i].y) - V.begin(); vec[node[i].y].push_back(i); } int End = V.size(); build(1, 1, End); long long ans = -1e15; int ansl, ansr; for (int i = 0; i < End; i++) { int siz = (int)vec[i].size(); for (int j = 0; j < siz; j++) update(1, 1, End, node[vec[i][j]].x + 1, node[vec[i][j]].w); Info tmp = query(1, 1, End, 1, i + 1); if (tmp.mx > ans) { ans = tmp.mx; ansl = V[tmp.p - 1]; ansr = V[i]; } } if (ans < 0) ans = 0, ansl = ansr = 2e9; printf( %lld n%d %d %d %d , ans, ansl, ansl, ansr, ansr); return 0; } |
#include <bits/stdc++.h> int main() { int t, arr[110], i, l, s, m, n, j; scanf( %d , &t); l = -1; s = 1001; for (i = 0; i < t; i++) scanf( %d , &arr[i]); for (i = 0; i < t; i++) { for (j = i + 1; j < t; j++) { if (arr[j] < arr[i]) { s = arr[j]; arr[j] = arr[i]; arr[i] = s; } } } printf( %d , arr[t - 1]); for (i = 1; i < t - 1; i++) { printf( %d , arr[i]); } printf( %d n , arr[0]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[3010][6010], fa[18010000]; int dx[9] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[9] = {-1, 0, 1, -1, 1, -1, 0, 1}; inline int read() { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f = ch == - , ch = getchar(); while (isdigit(ch)) x = (x << 3) + (x << 1) + ch - 48, ch = getchar(); return f ? -x : x; } inline int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } inline int calc(int x, int y) { return (x - 1) * m * 2 + y; } int main() { int ans = 0; n = read(), m = read(); int Q = read(); for (int i = 1; i <= n; i++) for (int j = 1; j <= 2 * m; j++) fa[calc(i, j)] = calc(i, j); if (m == 1) { puts( 0 ); return 0; } while (Q--) { int x = read(), y = read(); int flag = 0; for (int i = 0; i < 8; i++) { int xx = x + dx[i], yy = y + dy[i]; if (yy == 0) yy = 2 * m; if (xx < 1 || xx > n || !a[xx][yy]) continue; for (int j = 0; j < 8; j++) { int xxx = x + dx[j], yyy = y + m + dy[j]; if (yyy > 2 * m) yyy = 1; if (xxx < 1 || xxx > n || !a[xxx][yyy]) continue; if (find(calc(xx, yy)) == find(calc(xxx, yyy))) { flag = 1; break; } } } if (flag) continue; a[x][y] = a[x][y + m] = 1; ans++; int fx1 = find(calc(x, y)), fx2 = find(calc(x, y + m)); for (int i = 0; i < 8; i++) { int xx = x + dx[i], yy = y + dy[i]; if (yy > m) { if (a[xx][yy]) fa[find(calc(xx, yy))] = fx1; if (a[xx][1]) fa[find(calc(xx, 1))] = fx2; } else if (yy < 1) { if (a[xx][yy + m]) fa[find(calc(xx, yy + m))] = fx2; if (a[xx][2 * m]) fa[find(calc(xx, 2 * m))] = fx1; } else { if (a[xx][yy]) fa[find(calc(xx, yy))] = fx1; if (a[xx][yy + m]) fa[find(calc(xx, yy + m))] = fx2; } } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], i; for (i = 0; i < n; i++) { cin >> a[i]; } if (n == 1) { cout << 1; return 0; } int lmarr[n + 1], rmarr[n + 1]; lmarr[0] = INT_MIN; rmarr[n] = INT_MAX; for (i = 0; i < n; i++) { lmarr[i + 1] = max(a[i], lmarr[i]); } for (i = n - 1; i >= 0; i--) { rmarr[i] = min(rmarr[i + 1], a[i]); } int count = 1; for (i = 1; i < n; i++) { if (lmarr[i] <= rmarr[i]) { count++; } } cout << count; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; } template <typename T> int SIZE(const T &t) { return t.size(); } string to_string(const string s, int x1 = 0, int x2 = 1e9) { return + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : ) + ; } string to_string(const char *s) { return to_string((string)s); } string to_string(const bool b) { return (b ? true : false ); } string to_string(const char c) { return string({c}); } template <size_t N> string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) { string t = ; for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1); __iii__ <= __jjj__; ++__iii__) { t += b[__iii__] + 0 ; } return + t + ; } template <typename A, typename... C> string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = ( + to_string(p.first) + , + to_string(p.second) + ) ; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A(&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ); string res = ; bool first = true; if (l_v_l_v_l == 0) res += n ; res += tab + [ ; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2 - x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += , ; } first = false; l_v_l_v_l++; if (e != l) { if (rnk > 1) { res += n ; t_a_b_s = l_v_l_v_l; }; } else { t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += ] ; if (l_v_l_v_l == 0) res += n ; return res; } void dbgm() { ; } template <typename Heads, typename... Tails> void dbgm(Heads H, Tails... T) { cout << to_string(H) << | ; dbgm(T...); } const long long MOD = (int)1e9 + 7; const long long INF = 2e18 + 5; struct hashLL { size_t operator()(long long x) const { x = (x ^ (x >> 30)) * UINT64_C(0xbf58476d1ce4e5b9); x = (x ^ (x >> 27)) * UINT64_C(0x94d049bb133111eb); x = x ^ (x >> 31); return x; } }; long long inv(long long a, long long b) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } long long gcd(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 d = gcd(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } long long distsq(long long x1, long long y1, long long x2, long long y2) { return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); } const int N = 100001; long long n, m, k, x, y, w; unordered_map<int, unordered_map<int, int>> g; string s; pair<long long, long long> solve(long long curr, long long par) { long long returnwt = 0; long long endwt = 0; vector<long long> v; for (auto p : g[curr]) { long long child = p.first; long long wt = p.second; if (child == par) continue; returnwt += wt; pair<long long, long long> x = solve(child, curr); returnwt += x.first; returnwt += wt; if (-wt - wt - x.first + x.second + wt < endwt) { endwt = -wt - wt - x.first + x.second + wt; } } return {returnwt, returnwt + endwt}; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 0; i < (n - 1); i++) { cin >> x >> y >> w; g[x][y] = w; g[y][x] = w; } long long res = solve(1, 0).second; cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, l, r; vector<pair<int, int> > G[100005]; int seq[100005], cnts, siz[100005], rch[100005], num[100005]; bool vis[100005]; int rt, Min; void dfs(int now, int ff, int tsz) { int Max = 0; siz[now] = 1; rch[now] = 0; for (int i = 0, v, sz = G[now].size(); i < sz; i++) if ((v = G[now][i].first) != ff && !vis[v]) { dfs(v, now, tsz); rch[now] = max(rch[now], rch[v] + 1); siz[now] += siz[v]; Max = max(Max, siz[v]); } Max = max(Max, tsz - siz[now]); if (Max < Min) Min = Max, rt = now; } int Gert(int now, int tsz) { Min = 0x3f3f3f3f; dfs(now, -1, tsz); return rt; } bool cmp(const pair<int, int> &a, const pair<int, int> &b) { return rch[a.first] < rch[b.first]; } void setsiz(int now, int ff) { siz[now] = 1, rch[now] = 0; for (int i = 0, sz = G[now].size(), v; i < sz; i++) if ((v = G[now][i].first) != ff && !vis[v]) { setsiz(v, now); siz[now] += siz[v]; rch[now] = max(rch[now], rch[v] + 1); } } void Solve(int now) { seq[++cnts] = now; setsiz(now, -1); vis[now] = 1; rch[now] = 0; sort(G[now].begin(), G[now].end(), cmp); for (int v, i = 0, sz = G[now].size(); i < sz; i++) if (!vis[(v = G[now][i].first)]) Solve(Gert(v, siz[v])); } int f[100005], g[100005], floc[100005], gloc[100005], ansx, ansy; int Maxdep; void ser(int now, int ff, int dist, int cost, int Lim) { Maxdep = max(Maxdep, dist); if (cost > g[dist]) g[dist] = cost, gloc[dist] = now; for (int i = 0, sz = G[now].size(), v; i < sz; i++) if ((v = G[now][i].first) != ff && !vis[v]) ser(v, now, dist + 1, cost + (G[now][i].second >= Lim ? 1 : -1), Lim); } int Q[100005], L, R; bool check(int Lim) { memset(vis, 0, sizeof vis); memset(f, -0x3f, sizeof f); memset(g, -0x3f, sizeof g); f[0] = 0; int premaxdep = 0; for (int u, id = 1; id <= n; id++) { for (int i = 1; i <= premaxdep; i++) f[i] = -0x3f3f3f3f, g[i] = -0x3f3f3f3f; premaxdep = 0; vis[u = seq[id]] = 1; floc[0] = u; for (int predep = 0, i = 0, v, sz = G[u].size(); i < sz; i++) if (!vis[v = G[u][i].first]) { for (int j = 1; j <= predep; j++) g[j] = -0x3f3f3f3f; Maxdep = 0; ser(v, -1, 1, G[u][i].second >= Lim ? 1 : -1, Lim); L = R = 0; for (int j = 0, k = min(r, Maxdep); j <= predep; j++) { for (; j + k >= l && k >= 0; k--) { for (; L < R && g[k] >= g[Q[R - 1]]; R--) ; Q[R++] = k; } for (; L < R && Q[L] + j > r; L++) ; if (L < R && f[j] + g[Q[L]] >= 0) { ansx = floc[j]; ansy = gloc[Q[L]]; return 1; } } for (int j = 1; j <= Maxdep; j++) if (f[j] < g[j]) f[j] = g[j], floc[j] = gloc[j]; predep = Maxdep; premaxdep = max(premaxdep, Maxdep); } } return 0; } int main() { int u, v, w; scanf( %d%d%d , &n, &l, &r); for (int i = 1; i < n; i++) { scanf( %d%d%d , &u, &v, &w); G[u].push_back(make_pair(v, w)); G[v].push_back(make_pair(u, w)); } Solve(Gert(1, n)); int L = 0, R = 1000000000, Mid; while (L < R) { Mid = (L + R + 1) >> 1; if (check(Mid)) L = Mid; else R = Mid - 1; } check(L); printf( %d %d n , ansx, ansy); } |
#include <bits/stdc++.h> template <typename T> inline void read(T &x) { x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar(); } using namespace std; int n, m; struct Edge { int u, v, w, id; Edge() {} Edge(int jzp, int zzz, int lsr, int chr) { u = jzp, v = zzz, w = lsr, id = chr; } } E[301000], Ev[301000]; bool cmp(const Edge &a, const Edge &b) { return a.w < b.w; } int stkx[301000], stky[301000], stop, siz[301000], oddcnt, fath[301000]; int find(int cur) { return fath[cur] == cur ? cur : find(fath[cur]); } inline void merge(int x, int y) { x = find(x), y = find(y); if (x == y) return; if (siz[x] > siz[y]) swap(x, y); stkx[++stop] = x, stky[stop] = y; if (siz[x] & 1) --oddcnt; if (siz[y] & 1) --oddcnt; siz[y] += siz[x]; fath[x] = y; if (siz[y] & 1) ++oddcnt; } inline void cancl(int x, int y) { fath[x] = x; if (siz[y] & 1) --oddcnt; siz[y] -= siz[x]; if (siz[x] & 1) ++oddcnt; if (siz[y] & 1) ++oddcnt; } int st[301000], ed[301000]; int ans[301000]; int h[301000], ltot; void sol(int l, int r, int d, int u) { if (l > r) return; int memo = stop, mid = (l + r) >> 1; for (int i = l; i <= mid; ++i) { if (E[i].w <= d) merge(E[i].u, E[i].v); } int memo_ = stop; if (!oddcnt) { ans[mid] = d; } else { for (int i = d + 1; i <= u; ++i) { for (int j = st[i]; j <= ed[i]; ++j) { if (Ev[j].id <= mid) merge(Ev[j].u, Ev[j].v); } if (!oddcnt) { ans[mid] = i; break; } } } if (!ans[mid]) { while (stop != memo_) cancl(stkx[stop], stky[stop]), --stop; sol(mid + 1, r, d, u); while (stop != memo) cancl(stkx[stop], stky[stop]), --stop; return; } else { while (stop != memo_) cancl(stkx[stop], stky[stop]), --stop; sol(mid + 1, r, d, ans[mid]); while (stop != memo) cancl(stkx[stop], stky[stop]), --stop; for (int i = d + 1; i <= ans[mid]; ++i) { for (int j = st[i]; j <= ed[i]; ++j) { if (Ev[j].id < l) merge(Ev[j].u, Ev[j].v); } } sol(l, mid - 1, ans[mid], u); while (stop != memo) cancl(stkx[stop], stky[stop]), --stop; return; } } int main() { read(n), read(m); for (int i = 1; i <= n; ++i) siz[i] = 1, fath[i] = i; oddcnt = n; for (int i = 1; i <= m; ++i) { int u, v, w; read(u), read(v), read(w); h[i] = w; Ev[i] = Edge(u, v, w, i); } sort(h + 1, h + 1 + m); ltot = unique(h + 1, h + 1 + m) - h - 1; for (int i = 1; i <= m; ++i) Ev[i].w = lower_bound(h + 1, h + 1 + ltot, Ev[i].w) - h; memcpy(E, Ev, sizeof(Ev)); sort(Ev + 1, Ev + 1 + m, cmp); for (int i = 1; i <= m; ++i) if (Ev[i].w != Ev[i - 1].w) ed[Ev[i - 1].w] = i - 1, st[Ev[i].w] = i; ed[Ev[m].w] = m; sol(1, m, 1, ltot); h[0] = -1; for (int i = 1; i <= m; ++i) printf( %d n , h[ans[i]]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long modpow(long long a, long long b, long long mod = (long long)(1e9 + 7)) { if (!b) return 1; a %= mod; return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int DEBUG = 1; const int mxn = 2e5 + 7; int n, k; int dsu[mxn], sz[mxn], mini[mxn], maxi[mxn]; bool ac[mxn]; string ans; int a[mxn], b[mxn]; void init() { for (int i = 0; i < mxn; i++) ac[i] = 0, dsu[i] = i, sz[i] = 1, mini[i] = i, maxi[i] = i; } int root(int i) { return dsu[i] = dsu[i] == i ? i : root(dsu[i]); } void merge(int i, int j) { if (!(0 <= i && i <= n - 1) || !(0 <= j && j <= n - 1)) return; i = root(i); j = root(j); if (i == j) return; if (sz[i] < sz[j]) swap(i, j); dsu[j] = i; sz[i] += sz[j]; (mini[i]) = min((mini[i]), (mini[j])); (maxi[i]) = max((maxi[i]), (maxi[j])); } void activate(int i) { ac[i] = 1; if (i && ac[i - 1]) merge(i, i - 1); if ((0 <= i + 1 && i + 1 <= n - 1) && ac[i + 1]) merge(i, i + 1); } void solve() { scanf( %d , &n); scanf( %d , &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); init(); ans = string(n, ); for (int i = 0; i < n; i++) b[--a[i]] = i; int t = 0; for (int i = n - 1; i >= 0; i--) if (!ac[b[i]]) { activate(b[i]); ans[b[i]] = 1 + t; int cnt = k, j = b[i]; while (cnt-- && j < n) { if (ac[j]) j = maxi[root(j)] + 1; if (j >= n) break; activate(j); ans[j++] = 1 + t; } cnt = k; j = b[i]; while (cnt-- && j >= 0) { if (ac[j]) j = mini[root(j)] - 1; if (j < 0) break; activate(j); ans[j--] = 1 + t; } t ^= 1; } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int Abs(int x) { return x > 0 ? x : -x; } set<int> peo; set<int>::iterator p1, p2; bool vis[200050], boy[200050]; char s[200050]; int a[200050]; struct node { int l, r; int val; node(int a = 0, int b = 0, int c = 0) : l(a), r(b), val(c) {} bool operator<(const node &x) const { if (val != x.val) return x.val > val; if (x.l != l) return x.l > l; return x.r > r; } }; set<node> myset; set<node>::iterator it; vector<node> ans; void work() { while (myset.size()) { it = myset.begin(); node u = *it; myset.erase(it); if (vis[u.l] || vis[u.r]) continue; vis[u.l] = vis[u.r] = 1; ans.push_back(u); p1 = peo.find(u.l); if (p1 == peo.begin()) { peo.erase(p1); peo.erase(u.r); continue; } p2 = peo.find(u.r); p2++; if (p2 == peo.end()) { peo.erase(p1); peo.erase(u.r); continue; } p1--; peo.erase(u.l); peo.erase(u.r); u.l = *p1; u.r = *p2; if (boy[u.l] == boy[u.r]) continue; u.val = Abs(a[u.l] - a[u.r]); myset.insert(u); } } int n; int main() { int i, j; while (cin >> n) { myset.clear(); peo.clear(); scanf( %s , s + 1); for (i = 1; i <= n; i++) scanf( %d , &a[i]); boy[1] = (s[1] == B ); for (i = 1; i <= n; i++) { peo.insert(i); boy[i + 1] = (s[i + 1] == B ); if (i < n && boy[i] != boy[i + 1]) myset.insert(node(i, i + 1, Abs(a[i] - a[i + 1]))); } memset(vis, 0, sizeof vis); ans.clear(); work(); cout << ans.size() << endl; for (i = 0; i < ans.size(); i++) printf( %d %d n , ans[i].l, ans[i].r); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 8; const double pi = 3.14159265359; long long binpow(long long a, long long b, long long m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } long long inverse(long long x) { return binpow(x, MOD - 2, MOD); } void solve() { long long n, x; cin >> n >> x; if (n <= 2) { cout << 1 << endl; return; } cout << (n - 3) / x + 2 << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); long long t; cin >> t; while (t--) solve(); cerr << Time elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << sec n ; } |
#include <bits/stdc++.h> using namespace std; long long num[100010]; int main() { int n, q, req; while (~scanf( %d%d%d , &n, &q, &req)) { bool res[100010]; res[0] = true; res[n + 1] = true; for (int i = 1; i <= n; i++) { scanf( %d , &num[i]); if (num[i] <= req) res[i] = true; else res[i] = false; } int qiu = 0; bool flag = true; for (int i = 1; i <= n; i++) { if (flag == true && res[i] == false) { qiu++; flag = false; } if (res[i] == true) flag = true; } for (int i = 0; i < q; i++) { int cur; scanf( %d , &cur); if (cur == 0) { cout << qiu << endl; } else { int a; long long b; scanf( %d%lld , &a, &b); num[a] += b; if (res[a] == true && num[a] > req) { res[a] = false; if (res[a - 1] == false && res[a + 1] == false) qiu--; if (res[a - 1] == true && res[a + 1] == true) qiu++; } } } } } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long int t, n, m; set<long long int> vis; queue<long long int> q; vector<long long int> temp, v[500005], g[500005]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int i, j, k, x, y; cin >> n >> m; for (i = 1; i <= m; i++) { cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } for (i = 1; i <= n; i++) { sort(g[i].begin(), g[i].end()); vis.insert(i); } long long int comp = 0; for (i = 1; i <= n; i++) { if (vis.find(i) == vis.end()) continue; else x = i; vis.erase(x); q.push(x); comp++; while (!q.empty()) { x = q.front(); q.pop(); v[comp].push_back(x); temp.clear(); for (auto it : vis) { if (!binary_search(g[x].begin(), g[x].end(), it)) { temp.push_back(it); q.push(it); } } for (auto it : temp) vis.erase(it); } } cout << comp << n ; for (i = 1; i <= comp; i++) { cout << v[i].size() << ; for (auto it : v[i]) cout << it << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); const int N = (int)1e6 + 7, mod = 1000000007, M = 2e9, lvl = 21; char s[N]; int n, c[10], x[4] = {1, 6, 8, 9}; vector<int> base, a; void push(int x) { a.push_back(x / 100); x %= 100; a.push_back(x / 10); x %= 10; a.push_back(x); } bool div7() { if (a.size() <= 4) { int ret = a.back(); a.pop_back(); if (a.empty()) return ret % 7 == 0; ret += a.back() * 10; a.pop_back(); if (a.empty()) return ret % 7 == 0; ret += a.back() * 100; a.pop_back(); if (a.empty()) return ret % 7 == 0; ret += a.back() * 1000; a.pop_back(); if (a.empty()) return ret % 7 == 0; } int t = a.back() * 2, bg; a.pop_back(); bg = a.back(); a.pop_back(); bg += a.back() * 10; a.pop_back(); bg += a.back() * 100; a.pop_back(); push(bg - t); return div7(); } void print() { for (int i : base) printf( %d , i); for (int i = 0; i < 4; i++) printf( %d , x[i]); while (c[0]--) printf( 0 ); exit(0); } int main() { scanf( %s , s); n = strlen(s); for (int i = 0; i < n; i++) c[s[i] - 0 ]++; c[1]--; c[6]--; c[8]--; c[9]--; for (int i = 1; i <= 9; i++) { while (c[i]--) base.push_back(i); } do { a.clear(); for (int i : base) a.push_back(i); for (int i = 0; i < 4; i++) a.push_back(x[i]); if (div7()) print(); n++; } while (next_permutation(x, x + 4)); puts( 0 ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, num; scanf( %d , &n); int f = 0; int pre = 0; bool ans = 1; for (int i = 0; i < n; i++) { scanf( %d , &num); if ((f == 1 && num > pre) || (f == 2 && num >= pre)) ans = 0; if (num == pre) f = 1; if (num < pre) f = 2; pre = num; } if (ans) printf( YES n ); else printf( NO n ); 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, k; cin >> n >> k; vector<int> a(n, 0); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> prev(n, 0); prev[0] = 0; int m = -1; int s = 0; int l = 0; int r = 0; for (int i = 1; i < n - 1; i++) { if (a[i] > a[i + 1] && a[i - 1] < a[i]) { s++; } prev[i] = s; } for (int i = n - 1; i >= k - 1; i--) { if (prev[i - 1] - prev[i - k + 1] >= m) { m = prev[i - 1] - prev[i - k + 1]; l = i - k + 1; } } cout << m + 1 << << l + 1 << endl; } } |
#include <bits/stdc++.h> long long mod = 1e9 + 7, mod2 = 998244353; const int N = int(3e5) + 999; using namespace std; long long fac[10000000]; long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } long long fexp(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % m; b /= 2; a = a * a % m; } return ans; } long long inverse(long long a, long long p) { return fexp(a, p - 2, p); } long long ncr(long long n, long long r, long long p) { if (r == 0) return 1; return (fac[n] * inverse(fac[n - r], p) % p * inverse(fac[r], p) % p) % p; } vector<long long> za(string s) { long long n = s.size(); vector<long long> z(n); long long x = 0, y = 0, p = 0; for (long long i = 1; i < n; i++) { z[i] = max(p, min(z[i - x], y - i + 1)); while (i + z[i] < n && s[z[i]] == s[i + z[i]]) { x = i; y = i + z[i]; z[i]++; } } return z; } void subset(long long a[], long long k) { for (int i = 1; i < pow(2, k); i++) { for (int j = 0; j < k; j++) { if (i & 1 << j) { cout << a[j] << ; } } cout << endl; } } vector<long long> pr(string s) { long long n = s.length(); vector<long long> pi(n); for (int i = 1; i < n; i++) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) j++; pi[i] = j; } return pi; } int main() { ios::sync_with_stdio(0); cin.tie(0); long long n, val; cin >> n; long long a[n], c1 = 0, c2 = 0, ans = 0, t = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; if (t % 2 == 0) c1++; else c2++; if (a[i] < 0) t++; if (t % 2 == 0) ans += c1; else ans += c2; } cout << n * (n + 1) / 2 - ans << << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void chkmax(T& x, U y) { if (x < y) x = y; } template <typename T, typename U> inline void chkmin(T& x, U y) { if (y < x) x = y; } int main() { int h, m, s, A, B; scanf( %d%d%d%d%d , &h, &m, &s, &A, &B); double a = h % 12 + 1.0 * m / 60 + 1.0 * s / 3600; double b = 0.2 * m + 1.0 * s / 300; double c = 0.2 * s; for (int i = 0; i < 2; i++) { bool flg = 1; for (int x = A; x != B; x = x % 12 + 1) { if (x % 12 <= a && a <= x % 12 + 1) flg = 0; if (x % 12 <= b && b <= x % 12 + 1) flg = 0; if (x % 12 <= c && c <= x % 12 + 1) flg = 0; } if (flg) return puts( yes ), 0; swap(A, B); } puts( no ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int T; cin>>T; while(T--) { string S; cin>>S; long long int A[100]; long long int x=0; long long int val=0; long long int N=S.length(); long long int first,mid,last; A[0]=0;A[1]=0;A[2]=0; string str= ; for(long long int i=0;i<N;i++) { char c; c=S[i]; if(c== ? ) A[x]++; else { str+=c; x++; } } // cout<<A[0]<< <<A[1]<< <<A[2]<<endl; if(str== () ) { val=1; } else if(str== )( ) { if((A[0]>=1)&&(A[2]>=1)) { val=1; } } if(val==0) cout<< NO <<endl; else if(val==1&&(N%2==0)) cout<< YES <<endl; else cout<< NO <<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1005; const int inf = 1000 * 1000 * 1000; const int mod = 1000 * 1000 * 1000 + 7; mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count()); int n, s, d; bitset<N> a[(1 << 20) + 2]; bitset<N> b[(1 << 10) + 2]; bitset<N> mas[33]; bitset<N> A; int cnt[(1 << 20) + 2]; unordered_map<bitset<N>, int> mp; int main() { cin >> n >> s >> d; for (int i = 1; i <= s; i++) { int c; scanf( %d , &c); mas[i] = 0; while (c--) { int a; scanf( %d , &a); mas[i][a] = 1; } } int x = min(s, 20); int y = s - x; cnt[0] = 0; for (int i = 1; i < (1 << 20); i++) { for (int j = 0; j < 20; j++) { if ((i >> j) & 1) { cnt[i]++; } } } b[0] = 0; mp[b[0]] = 0; for (int i = 1; i < (1 << x); i++) { int pos; for (int j = 0; j < x; j++) { if ((i >> j) & 1) { pos = j; break; } } b[i] = b[i ^ (1 << pos)] ^ mas[pos + 1]; if (mp.find(b[i]) == mp.end()) { mp[b[i]] = cnt[i]; } else { mp[b[i]] = min(mp[b[i]], cnt[i]); } } a[0] = 0; for (int i = 1; i < (1 << y); i++) { int pos; for (int j = 0; j < y; j++) { if ((i >> j) & 1) { pos = j; break; } } a[i] = a[i ^ (1 << pos)] ^ mas[pos + 1 + x]; } while (d--) { int c; scanf( %d , &c); A = 0; while (c--) { int a; scanf( %d , &a); A[a] = 1; } int answ = inf; for (int i = 0; i < (1 << y); i++) { if (mp.find(A ^ a[i]) != mp.end()) { answ = min(answ, cnt[i] + mp[A ^ a[i]]); } } if (answ == inf) answ = -1; printf( %d n , answ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, i, k = 0; cin >> n; int a[n]; map<int, int> m; set<int> s; for (i = 0; i < n; i++) { cin >> a[i]; m[a[i]]++; k = max(k, m[a[i]]); } for (i = 0; i < n; i++) s.insert(a[i]); int mx = s.size(); int ans = max(min(mx - 1, k), min(mx, k - 1)); cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n, t; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; i++) { cout << n - i << ; } cout << n ; } } |
#include <bits/stdc++.h> struct help { long int money; long int friends; }; void fusion_sort(struct help *p, long int n); void bablesort(struct help *p, long int n); int main() { long int n, m; scanf( %ld %ld , &n, &m); struct help *p = (struct help *)malloc(sizeof(struct help) * n); for (int i = 0; i < n; i++) scanf( %ld %ld , &p[i].money, &p[i].friends); if (n == 1) { printf( %ld , p[0].friends); return 0; } if (n > 1000) fusion_sort(p, n); else bablesort(p, n); unsigned long long max_friend = 0; unsigned long long cur_sum = 0; for (int b = 0, e = 0; e < n;) if (p[e].money - p[b].money >= m) { if (cur_sum > max_friend) { max_friend = cur_sum; } cur_sum -= p[b].friends; b++; } else { cur_sum += p[e].friends; e++; } if (cur_sum > max_friend) max_friend = cur_sum; printf( %lld , max_friend); return 0; } void fusion_sort(struct help *p, long int n) { if (n > 2) { fusion_sort(p, n / 2); fusion_sort((p + n / 2), n / 2 + n % 2); } struct help temp; for (int i = 0, j = n / 2; i < j && j < n; i++) if (p[i].money > p[j].money) { temp.friends = p[j].friends; temp.money = p[j].money; for (int k = j; k > i; k--) { p[k].friends = p[k - 1].friends; p[k].money = p[k - 1].money; } p[i].friends = temp.friends; p[i].money = temp.money; j++; } } void bablesort(struct help *p, long int n) { long int fr; long int mo; while (n > 1) { for (int i = 0; i < n - 1; i++) if (p[i].money > p[i + 1].money) { fr = p[i].friends; mo = p[i].money; p[i].friends = p[i + 1].friends; p[i].money = p[i + 1].money; p[i + 1].friends = fr; p[i + 1].money = mo; } n--; } } |
#include <bits/stdc++.h> using LL = long long; const LL Inf = (LL)1e18; const int N = 5000 + 5; int s, e, n; LL x[N], a[N], b[N], c[N], d[N]; LL dp[2][N]; inline LL lo(int p) { return d[p] - x[p]; } inline LL ro(int p) { return x[p] + c[p]; } inline LL li(int p) { return b[p] - x[p]; } inline LL ri(int p) { return x[p] + a[p]; } inline void _min(LL &a, LL b) { if (a > b) a = b; } LL work() { if (s > e) { for (int i = 1; i <= n; ++i) { x[i] = -x[i]; std::swap(a[i], b[i]); std::swap(c[i], d[i]); } for (int i = 1; i < n + 1 - i; ++i) { std::swap(x[i], x[n + 1 - i]); std::swap(a[i], a[n + 1 - i]); std::swap(b[i], b[n + 1 - i]); std::swap(c[i], c[n + 1 - i]); std::swap(d[i], d[n + 1 - i]); } s = n + 1 - s; e = n + 1 - e; } for (int i = 0; i < 2; ++i) { for (int j = 0; j < N; ++j) { dp[i][j] = Inf; } } int cur = 0, nex = 1; dp[cur][1] = li(1) + lo(1); for (int i = 2; i <= n; ++i) { for (int left = 1; left <= i - 1; ++left) { if (dp[cur][left] == Inf) continue; for (int q = 0; q < 2; ++q) { for (int w = 0; w < 2; ++w) { if (i == s && w == 0) continue; if (i == e && q == 1) continue; if (s < i && i < e) { if (left == 1 && q == 0) continue; } LL cost = 0; cost += q == 0 ? ro(i) : lo(i); cost += w == 0 ? ri(i) : li(i); int n_left = left; if (q == w) { if (q == 0) n_left--; else n_left++; } _min(dp[nex][n_left], dp[cur][left] + cost); } } } std::swap(cur, nex); std::fill(dp[nex], dp[nex] + N, Inf); } LL ret = dp[cur][0]; if (s < e) { ret -= li(s) + ro(e); } else { ret -= ri(s) + lo(e); } return ret; } int main() { std::ios::sync_with_stdio(false); std::cin >> n >> s >> e; for (int i = 1; i <= n; ++i) std::cin >> x[i]; for (int i = 1; i <= n; ++i) std::cin >> a[i]; for (int i = 1; i <= n; ++i) std::cin >> b[i]; for (int i = 1; i <= n; ++i) std::cin >> c[i]; for (int i = 1; i <= n; ++i) std::cin >> d[i]; std::cout << work() << std::endl; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > g; bitset<(int)1e6> us; bool isCyclic(int v, int p = -1) { us.set(v); for (int i = 0; i < g[v].size(); i++) { if (us.test(g[v][i]) && g[v][i] != p) return 0; if (us.test(g[v][i])) continue; bool cures = isCyclic(g[v][i], v); if (!cures) return 0; } return 1; } int main() { int n, m; cin >> n >> m; g.resize(n + 1); for (int i = 0; i < m; i++) { int v, to; cin >> v >> to; g[to].push_back(v); g[v].push_back(to); } int sum = 0; for (int i = 1; i <= n; i++) { if (us.test(i)) continue; sum += isCyclic(i); } cout << sum << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m, k; long long num[5005], sum[5005], dp[5005][5005]; int main() { int i, j; while (scanf( %d%d%d , &n, &m, &k) != EOF) { for (i = 0; i < n; i++) { scanf( %I64d , &num[i]); } memset(sum, 0, sizeof(sum)); for (i = 0; i <= m - 1; i++) { sum[0] += num[i]; } for (i = 1; i + m <= n; i++) { sum[i] = sum[i - 1]; sum[i] -= num[i - 1]; sum[i] += num[i + m - 1]; } memset(dp, 0, sizeof(dp)); for (j = 1; j <= k; j++) { for (i = n - m * j; i >= 0; i--) { dp[i][j] = max(dp[i + 1][j], dp[i + m][j - 1] + sum[i]); } } long long res = 0; for (i = 0; i <= n - m * k; i++) { res = max(dp[i][k], res); } cout << res << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 20001; const int MAX_LOG = 20; using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pll = pair<ll, ll>; const double delta = 1e-6; const long long mod = 1e9 + 7; const int magic_const = 1e9; const ll INF = 2e18 + 2; const ll BIG_DT = 1e12; mt19937 gen(54323244234); inline ll modoper(ll x) { return ((x % mod) + mod) % mod; } ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); } inline ll get_rand(ll x) { return (gen() % x + x) % x; } template <typename T> inline void sort(vector<T>& x) { sort(x.begin(), x.end()); } template <typename T> inline void reverse(vector<T>& x) { reverse(x.begin(), x.end()); } template <typename T> inline void set_max(T& x, T y) { x = max(x, y); } template <typename T> inline void set_min(T& x, T y) { x = min(x, y); } ll bin_pow(ll x, ll pow) { if (pow == 0) return 1; if ((pow & 2) == 1) { return (bin_pow(x, pow - 1) * x) % mod; } else { auto tmp = bin_pow(x, pow / 2); return (tmp * tmp) % mod; } } struct fenwick_tree { vector<int> a; fenwick_tree(int n) : a(n + 2) {} void add(int pos, int delta) { for (pos++; pos < a.size(); pos += pos & -pos) a[pos] += delta; } int get_sum(int pos) { int sum = 0; for (pos++; pos > 0; pos -= pos & -pos) sum += a[pos]; return sum; } }; vector<double> ys(MAX_N); vector<vector<double>> matrix(3, vector<double>(3)); double find_det() { double answer = 0.0; for (int i = 0; i < 3; i++) { double pr = 1.0; for (int j = 0; j < 3; j++) { pr *= matrix[j][(i + j) % 3]; } answer += pr; } for (int i = 0; i < 3; i++) { double pr = 1.0; for (int j = 0; j < 3; j++) { pr *= matrix[j][(i - j + 3) % 3]; } answer -= pr; } return answer; } void set_point_in_vector(vector<double>& a, int x) { a[0] = x * x; a[1] = x; a[2] = 1.0; } void nullify(int x1, int x2, int x3) { set_point_in_vector(matrix[0], x1); set_point_in_vector(matrix[1], x2); set_point_in_vector(matrix[2], x3); } void set_st_r(int x1, int x2, int x3, int column) { nullify(x1, x2, x3); matrix[0][column] = ys[x1]; matrix[1][column] = ys[x2]; matrix[2][column] = ys[x3]; } pair<double, pair<double, double>> find_eq(int x1, int x2, int x3) { nullify(x1, x2, x3); double det = find_det(); set_st_r(x1, x2, x3, 0); double det_1 = find_det(); set_st_r(x1, x2, x3, 1); double det_2 = find_det(); set_st_r(x1, x2, x3, 2); double det_3 = find_det(); return {det_1 / det, {det_2 / det, det_3 / det}}; } void solve() { int n, d; cin >> n >> d; vector<int> a(n, 1); int sum_now = (n * (n - 1)) / 2 - d; for (int l = 1, r = a.size() - 1; l < r; r--) { while (l < r && (sum_now - r + l < 0 || a[l] == a[l - 1] * 2)) { l++; } if (l >= r) break; sum_now -= r; sum_now += l; a[l]++; a[r]--; } if (sum_now != 0) { cout << NO n ; return; } cout << YES n ; a.insert(a.begin(), 0); vector<int> pref_sums = a; for (int i = 1; i < pref_sums.size(); i++) { pref_sums[i] += pref_sums[i - 1]; } for (int i = 2; i < pref_sums.size(); i++) { for (int k = 0; k < a[i]; k++) { cout << pref_sums[i - 2] + 1 + k / 2 << ; } } cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(23321); int t = 1; cin >> t; for (int i = 0; i < t; i++) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const int N = 200005; int vis[N], tab[N], i, a, b, sum, n, m, vis0[N], vis1[N]; vector<int> graf0[N], graf1[N]; string s; bool cyc(int w) { vis[w] = 1; for (auto& w2 : graf0[w]) if (vis[w2] == 1) return true; else if (vis[w2] == 0 && cyc(w2)) return true; vis[w] = 2; return false; } void go(int w, vector<int> graf[N], int* vis) { tab[w] = 1; vis[w] = 1; for (auto& w2 : graf[w]) if (!vis[w2]) go(w2, graf, vis); } int main() { scanf( %d %d , &n, &m); while (m--) { scanf( %d %d , &a, &b); graf0[a].push_back(b); graf1[b].push_back(a); } for (i = 1; i <= n; i++) if (vis[i] == 0 && cyc(i)) { printf( -1 n ); return 0; } sum = 0; for (i = 1; i <= n; i++) if (tab[i] == 0) { go(i, graf0, vis0); go(i, graf1, vis1); s += A ; sum++; } else { s += E ; go(i, graf0, vis0); go(i, graf1, vis1); } printf( %d n%s n , sum, s.c_str()); return 0; } |
#include <bits/stdc++.h> using ll = long long; using ld = long double; using namespace std; const int MAXN = 2000228; const ll INF = (1ll << 50); set<pair<ll, ll>> s; void ins(ll x, ll y) {} int main() { ios_base::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(20); cout.tie(nullptr); cin.tie(nullptr); int n; cin >> n; ll p = INF; s.emplace(p - 1, 0); for (int i = 0; i < n; ++i) { ll x; cin >> x; if (x >= p) { continue; } p = x; vector<pair<ll, ll>> rmed; while (!s.empty()) { auto val = *s.rbegin(); if (val.first < x - 1) { break; } s.erase(val); rmed.push_back(val); } pair<ll, ll> tmp{x, -1}; s.emplace(tmp); ll last = 0; for (auto& val : rmed) { ll dv = val.first / x; last = max(last, val.second + x * (dv - 1) * i); ll md = val.first % x; ll nvl = x * dv * i + val.second; auto it = s.lower_bound(pair<ll, ll>{md, nvl}); if (it->second >= nvl) { continue; } auto lit = it; while (lit != s.begin()) { auto nit = lit; --nit; if (nit->second > nvl) { break; } lit = nit; } s.erase(lit, it); s.emplace(md, nvl); } while (!s.empty() && s.rbegin()->second <= last) { auto it = s.end(); --it; s.erase(it); } s.emplace(x - 1, last); } ll ans = 0; for (auto& val : s) { ans = max(ans, val.first * n + val.second); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef string str; #define pb push_back #define ppp pop_back #define pii pair<int,int> #define fi first #define se second #define stie std::tie #define vec vector #define forn(i, l, r) for (int i=l; i<=r; i++) #define forb(i, r, l) for (int i=r; i>=l; i--) #define emp empty #define beg begin #define ins insert #define cle clear #define era erase #define que queue #define pque priority_queue #define mset multiset #define deq deque #define sta stack #define con const #define rsz resize #define ass assign #define lowb lower_bound #define uppb upper_bound template<class T> void mini(T& a, T b) { a = min(a, b); } template<class T> void maxi(T& a, T b) { a = max(a, b); } template<class T1, class T2> ostream& operator<<(ostream &out, pair<T1, T2> a) { return out << a.first << << a.second; } template<class T> ostream& operator<<(ostream& out, vector<T> a) { for (auto& i : a) out << i << ; return out; } template<class T> ostream& operator<<(ostream& out, set<T> a) { for (auto& i : a) out << i << ; return out; } template<class T> ostream& operator<<(ostream& out, multiset<T> a) { for (auto& i : a) out << i << ; return out; } template<class T1, class T2> ostream& operator<<(ostream& out, map<T1, T2> a) { for (auto& i : a) out << i << n ; return out; } template<class T1, class T2> ostream& operator<<(ostream& out, unordered_map<T1, T2> a) { for (auto& i : a) out << i << n ; return out; } template<class T> ostream& operator<<(ostream& out, queue<T> a) { while (!a.empty()) { out << a.front() << ; a.pop(); } return out; } template<class T> ostream& operator<<(ostream& out, deque<T> a) { while (!a.empty()) { out << a.front() << ; a.pop_front(); } return out; } template<class T> ostream& operator<<(ostream& out, priority_queue<T> a) { while (!a.empty()) { out << a.top() << n ; a.pop(); } return out; } template<class T> void out(T a) { cout << a << endl; } template<class T1, class T2> void out(T1 a, T2 b) { cout << a << << b << endl; } template<class T1, class T2, class T3> void out(T1 a, T2 b, T3 c) { cout << a << << b << << c << endl; } template<class T1, class T2, class T3, class T4> void out(T1 a, T2 b, T3 c, T4 d) { cout << a << << b << << c << << d << endl; } template<class T> void out(vector<vector<T>> a) { for (vector<T> i : a) out(i); } template<class T> void out_(T a[], int l, int r) { for (int i = l; i <= r; i++) cout << a[i] << ; cout << endl; } void out() { cout << OK << endl; } template<class T> void sort(vector<T>& a) { sort(a.begin(), a.end()); } template<class T> void uniq(vector<T>& a) { sort(a); a.erase(unique(a.begin(), a.end()), a.end()); } template<class T> vector<T> set_int(vector<T> a, vector<T> b) { sort(a); sort(b); vector<T> res; set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res)); return res; } clock_t start_time; void start_timer() { start_time = clock(); } double get_time() { return (double)(clock() - start_time) / CLOCKS_PER_SEC; } #if __SIZEOF_INT128__ >= 16 typedef __int128 LL; istream& operator>>(istream& in, __int128& a) { int64_t b; cin >> b; a = b; return in; } ostream& operator<<(ostream& out, const __int128 a) { unsigned __int128 b = a < 0 ? -a : a; char buf[128]; char* c = end(buf); do { --c; *c = 0123456789 [b % 10]; b /= 10; } while (b); if (a < 0) { --c; *c = - ; } int len = end(buf) - c; out.rdbuf()->sputn(c, len); return out; } #endif con int N = 1e5 + 5; con int K = 25; int a[N]; vec<int> g[N]; int dp[N][2 * K]; bool ans[N]; int k; void dfs(int v = 1, int p = 0) { dp[v][0] = a[v]; for (int u : g[v]) { if (u == p) continue; dfs(u, v); forn(i, 1, k-1) { dp[v][i] ^= dp[u][i-1]; } dp[v][0] ^= dp[u][k-1]; } } void dfs2(int v = 1, int p = 0, vec<int> cur = vec<int>(2 * K, 0)) { forn(i, 0, k-1) { cur[i] ^= dp[v][i]; } int odd = 0; forn(i, k/2, k-1) { odd ^= cur[i]; } ans[v] = odd; for (int u : g[v]) { if (u == p) continue; vec<int> nxt = cur; forn(i, 1, k-1) { nxt[i] ^= dp[u][i-1]; } nxt[0] ^= dp[u][k-1]; int last = nxt[k-1]; forb(i, k-1, 1) { nxt[i] = nxt[i-1]; } nxt[0] = last; dfs2(u, v, nxt); } } void Solve() { int n; cin >> n >> k; k *= 2; forn(i, 1, n-1) { int u, v; cin >> u >> v; g[u].pb(v); g[v].pb(u); } forn(i, 1, n) cin >> a[i]; dfs(); dfs2(); forn(i, 1, n) { cout << ans[i] << ; } cout << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); #ifdef LOCAL freopen( input.txt , r , stdin); #endif start_timer(); Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t-- > 0) { int n; cin >> n; vector<vector<int>> a; int b[n + 1]; for (int i = 0; i <= n; i++) b[i] = 0; int count = 0; int s = 0; for (int i = 0; i < n; i++) { vector<int> x; int k; cin >> k; int c = 0; for (int j = 0; j < k; j++) { int q; cin >> q; x.push_back(q); if (c == 0) { if (b[q] == 0) { b[q]++; count++; c = 1; } } } if (c == 0) s = i; a.push_back(x); } if (count == n) { cout << OPTIMAL << endl; } else { s++; int f = 0; for (int i = 0; i < n; i++) { if (b[i + 1] == 0) { f = i; } } f++; cout << IMPROVE << endl; cout << s << << f << endl; } } return 0; } |
//Hare Krishna //author: Dipjoy Basak //dip_10 #include <bits/stdc++.h> using namespace std; #define endl n #define ll long long #define int ll #define ld long double #define pb push_back #define mp make_pair #define ff first #define ss ssecond #define vi vector<int> #define pi pair<int, int> #define vpi vector<pair<int, int>> #define rep(i, l, r) for (int i = l; i <= r; i++) #define rrep(i, r, l) for (int i = r; i >= l; i--) #ifndef ONLINE_JUDGE #define debug(x) cerr << #x << ; _print(x); cerr << endl; #else #define debug(x) ; #endif #define maxn 1000005 #define INF INT_MAX const int mod = 1000000007; void _print(int t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(ld t) { cerr << t; } void _print(double t) { cerr << t; } template <class T, class V> void _print(pair<T, V> p); template <class T> void _print(vector<T> v); template <class T> void _print(set<T> v); template <class T, class V> void _print(map<T, V> v); template <class T> void _print(multiset<T> v); template <class T, class V> void _print(pair<T, V> p) { cerr << { ; _print(p.ff); cerr << , ; _print(p.ss); cerr << } ; } template <class T> void _print(vector<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(set<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(multiset<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T, class V> void _print(map<T, V> v) { cerr << [ ; for (auto i : v) { _print(i); cerr << ; } cerr << ] ; } //--------------------------------------------------------------------------------------------------------------------------------------- void solve() { int n; cin >> n; int a[n]; int idx = -1, mn = INT_MAX; rep(i, 0, n - 1) { cin >> a[i]; if (a[i] < mn) { mn = a[i]; idx = i; } } cout << n - 1 << endl; int cnt = 1; rep(i, idx + 1, n - 1) { cout << idx + 1 << << i + 1 << << mn << << mn + cnt << endl; cnt++; } cnt = 1; rrep(i, idx - 1, 0) { cout << idx + 1 << << i + 1 << << mn << << mn + cnt << endl; cnt++; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << setprecision(15) << fixed; int t; t = 1; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; double dp[15][15]; int n, t, i, j, ans = 0; void work() { double t; dp[1][1] += 1; for (i = 1; i <= n; i++) { for (j = 1; j <= i; j++) { if (dp[i][j] > 1) { t = dp[i][j] - 1; dp[i][j] = 1; dp[i + 1][j] += t / 2; dp[i + 1][j + 1] += t / 2; } } } } int main() { scanf( %d%d , &n, &t); while (t--) { work(); } for (i = 1; i <= n; i++) { for (j = 1; j <= i; j++) { if (abs(1 - dp[i][j]) < 0.0000001) { ans++; } } } cout << ans << endl; } |
#include <bits/stdc++.h> const double pi = 3.14159265358979323846; using namespace std; long long fastexp(long long a, long long b) { long long ans = 1; long long temp = a; while (b > 0) { if (b & 1) ans *= (temp); temp *= temp; b >>= 1; } return ans; } long long GCD(long long a, long long b) { if (a == 0) return b; return GCD(b % a, a); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long* A = new long long[n]; for (long long i = 0; i < n; i++) cin >> A[i]; long long m; cin >> m; long long* B = new long long[m]; for (long long i = 0; i < m; i++) cin >> B[i]; long long count = 0; long long i = 0; long long j = 0; bool f = true; while (i < n && j < m) { long long cum1 = A[i++]; long long cum2 = B[j++]; bool flag = false; while (i < n && j < m) { if (cum1 == cum2) { flag = true; break; } if (cum1 > cum2) { cum2 += B[j]; j++; } else { cum1 += A[i]; i++; } } if (i == n) { while (j < m) cum2 += B[j++]; } if (j == m) { while (i < n) cum1 += A[i++]; } if (cum1 == cum2) flag = true; if (!flag) { f = false; break; } count++; } if (!f) cout << -1 << n ; else cout << count << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int x = 0; for (int i = 2; i <= n; ++i) { if (i & 1) x = (x * 3 - 3) % 1000000007; else x = (x * 3 + 3) % 1000000007; } cout << x << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int N; char s[500010]; int c[30][500010]; int then(int x) { return x & -x; } void in(int o, int x, int k) { while (x <= N) { c[o][x] += k; x += then(x); } } int out(int o, int x) { int re = 0; while (x > 0) { re += c[o][x]; x -= then(x); } return re; } int main() { int Q; scanf( %s%d , s + 1, &Q); N = strlen(s + 1); for (int i = 1; i <= N; i++) in(s[i] - a , i, 1); for (int i = 1; i <= Q; i++) { int o; scanf( %d , &o); if (o == 1) { int k; char m; scanf( %d %c , &k, &m); in(s[k] - a , k, -1); in(m - a , k, 1); s[k] = m; } else { int x, y; scanf( %d%d , &x, &y); int give = 0; for (int i = 0; i <= 25; i++) if (out(i, y) - out(i, x - 1)) give++; printf( %d n , give); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s = ; vector<int> fib; fib.push_back(1); fib.push_back(1); for (int i = 2; i < 17; ++i) { fib.push_back(fib[i - 1] + fib[i - 2]); } for (int i = 1; i <= n; ++i) { if (binary_search(fib.begin(), fib.end(), i) == 1) { s.append(1u, O ); } else { s.append(1u, o ); } } cout << s << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; int l = b.size(); int st = a.size() - 1; int ar[l + 3]; memset(ar, -1, sizeof ar); ar[l] = st + 1; for (int i = l - 1; i >= 0; i--) { while (st >= 0 && a[st] != b[i]) { st--; } if (st >= 0) { ar[i] = st; st--; } else break; } int ans = 0; int pre = 0; for (int i = 0; i < a.size(); i++) { int la = ar[pre]; if (la != -1) ans = max(ans, la - i); if (pre < l && a[i] == b[pre]) { pre++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 60 + 10, M = (1 << 16) + 10, MOD = 1e9 + 7, INF = 2e9 + 10; const long double PI = acos(-1); int n, a[N], in[N], fac[N], msk[N], all; long long int dp[M][N], ans = 1; vector<int> adj[N], S, T; bool mrk[N], ad[N][N]; long long int Power(long long int x, long long int y) { if (y == 0) { return 1ll; } return ((y % 2 ? x : 1) * Power((x * x) % MOD, y / 2)) % MOD; } void Dfs(int u) { mrk[u] = 1; if (in[u]) T.push_back(u); else S.push_back(u); for (int v : adj[u]) { if (!mrk[v]) { Dfs(v); } } return; } void Solve() { memset(dp, 0, sizeof(dp)); int t = T.size(), s = S.size(); if (t < 2) return; for (int i = 0; i < t; i++) { msk[i] = 0; for (int j = 0; j < s; j++) { if ((a[T[i]] % a[S[j]]) == 0) { msk[i] |= (1 << j); } } dp[msk[i]][1]++; } for (int k = 1; k < t; k++) { for (int mask = 1; mask < (1 << s); mask++) { int cnt = 0; for (int i = 0; i < t; i++) { if ((msk[i] | mask) == mask) { cnt++; } else if (0 < (msk[i] & mask)) { dp[mask | msk[i]][k + 1] += dp[mask][k]; dp[mask | msk[i]][k + 1] %= MOD; } } if (k < cnt) { dp[mask][k + 1] += (cnt - k) * dp[mask][k]; dp[mask][k + 1] %= MOD; } } } ans = (ans * dp[(1 << s) - 1][t]) % MOD; ans = (ans * Power(fac[t - 1], MOD - 2)) % MOD; all += (t - 1); return; } void Dfs_All() { for (int i = 0; i < n; i++) { if (!mrk[i]) { Dfs(i); Solve(); S.clear(); T.clear(); } } return; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); fac[0] = 1; for (int i = 1; i < N; i++) { fac[i] = (fac[i - 1] * i) % MOD; } cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; for (int j = 0; j < i; j++) { int u = i, v = j; if (a[v] < a[u]) swap(u, v); if ((a[v] % a[u]) == 0) { adj[u].push_back(v); adj[v].push_back(u); in[v]++; } } } Dfs_All(); ans = (ans * fac[all]) % MOD; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MAXN = 3e6 + 9; long long n, k; long long two(long long x) { long long base = 1, ans = 0; while (base * x <= n) { long long f = min(n, base * (x + 1) - 1); ans += f - base * x + 1; base *= 2; } return ans; } long long one(long long x) { if (x % 2 == 0) return two(x + 1) + two(x); return two(x); } int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int t = 1; while (t--) { cin >> n >> k; long long N = n, ans = 1; while (N) { for (long long i = 0; i <= 10; i++) { if (i >= N) break; if (one(N - i) >= k) ans = max(ans, N - i); } N /= 2; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool isused[26]; string s, t; vector<pair<int, int> > v; int abs(int num) { if (num < 0) return -num; else return num; } int main(void) { cin >> s >> t; int slen = s.size(); for (int i = 0; i < slen; i++) isused[(s[i] - a )] = true; int tlen = t.size(); for (int i = 0; i < tlen; i++) { if (isused[(t[i] - a )] == false) { cout << -1 << endl; return 0; } } for (int i = 0; i < tlen;) { pair<int, int> temp = make_pair(-1, -1); for (int j = 0; j < slen; j++) { if (t[i] == s[j]) { int k1 = 0; while (i + k1 + 1 < tlen && j + k1 + 1 < slen && t[i + k1 + 1] == s[j + k1 + 1]) k1++; int k2 = 0; while (i + k2 + 1 < tlen && j - k2 - 1 >= 0 && t[i + k2 + 1] == s[j - k2 - 1]) k2++; if (k1 >= k2) { if (temp.first == -1) temp = make_pair(j, j + k1); else if (abs(temp.second - temp.first) < k1) temp = make_pair(j, j + k1); } else { if (temp.first == -1) temp = make_pair(j, j - k2); else if (abs(temp.first - temp.second) < k2) temp = make_pair(j, j - k2); } } } if (temp.first <= temp.second) i += (temp.second - temp.first) + 1; else i += (temp.first - temp.second) + 1; v.push_back(make_pair(temp.first + 1, temp.second + 1)); } cout << v.size() << endl; for (int i = 0; i < v.size(); i++) cout << v[i].first << << v[i].second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, totx, tot, hangx[2005], liex[2005]; double ans; char s[2005]; long long func(int n, int m, int a[]) { long long ret = 0; for (int i = 1; i <= n; i++) { long long sum = 0, cnt = m - a[i]; for (int j = 1; j <= n; j++) { if (a[j]) sum += (m - 1) * abs(i - j); else sum += m * abs(i - j); } if (a[i]) ret += (m - 1) * sum; else ret += m * sum; if (a[i]) { int l = i - 1, r = i + 1; while (a[l + 1] < a[l]) { cnt += m - a[l]; l--; } while (a[r - 1] < a[r]) { cnt += m - a[r]; r++; } ret += 4 * cnt * (a[i] - 1); } } return ret; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> s; for (int j = 1; j <= m; j++) { if (s[j - 1] == X ) { hangx[i] = j; liex[j] = i; totx++; } } } tot = n * m - totx; ans = (func(n, m, hangx) + func(m, n, liex)) * 1.0 / tot / tot; cout << fixed << setprecision(12) << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, a[1000005], ans = 0; inline long long read() { long long red = 0, f_f = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) f_f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) red = red * 10 + ch - 0 , ch = getchar(); return red * f_f; } signed main() { n = (1ll << read()), m = read(); for (long long i = 0; i < n; i++) a[i] = read(), ans += a[i]; printf( %.6lf n , 1.0 * ans / n); while (m--) { long long x = read(), y = read(); ans -= a[x]; a[x] = y; ans += a[x]; printf( %.6lf n , 1.0 * ans / n); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false), cin.tie(nullptr); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int res = 0; for (int i = 0; i < k; i++) { int x = 0, y = 0; for (int j = i; j < n; j += k) { if (a[j] == 1) x++; else y++; } res += min(x, y); } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T> inline void print(T first) { if (first < 0) { putchar( - ); return print(-first); } if (first < 10) { putchar( 0 + first); return; } print(first / 10); putchar(first % 10 + 0 ); } int power(int a, int b, int m, int ans = 1) { for (; b; b >>= 1, a = 1LL * a * a % m) if (b & 1) ans = 1LL * ans * a % m; return ans; } char s[100011]; pair<int, int> dp[100011]; int cnt[100011], mx[100011][2]; int main() { int n, m; cin >> n >> s + 1 >> m; for (int i = 1; i <= n; i++) { if (s[i] != b ) mx[i][0] = mx[i - 1][1] + 1; if (s[i] != a ) mx[i][1] = mx[i - 1][0] + 1; cnt[i] = cnt[i - 1] + (s[i] == ? ); dp[i] = dp[i - 1]; if (mx[i][!(m & 1)] >= m) { if (dp[i - m].first + 1 == dp[i].first) { smin(dp[i].second, dp[i - m].second + cnt[i] - cnt[i - m]); } if (dp[i - m].first + 1 > dp[i].first) { dp[i].first = dp[i - m].first + 1; dp[i].second = dp[i - m].second + cnt[i] - cnt[i - m]; } } } cout << dp[n].second << endl; return 0; } |
#include <bits/stdc++.h> const double eps = 1e-10; using namespace std; using ll = long long; using ul = unsigned long long; using PII = pair<int, int>; const int NN = 1011101; const int NZ = 511100; const int MM = 151; const int need = (1 << 30) - 1; int n, m, s, x, i, j, t, a, b, k, c, r, col[NN]; int l; ll in[NN]; int comp[NN]; PII gr[NN]; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d %d , &a, &b); a--, b--; gr[i + i] = {a, b}; gr[i + i + 1] = {b, a}; } set<int> sv; for (int i = 0; i < n; i++) sv.insert(i); m += m; sort(gr, gr + m); vector<vector<int>> answww; while (!sv.empty()) { int ff = *sv.begin(); sv.erase(ff); queue<int> qq; qq.push(ff); vector<int> _comp; while (!qq.empty()) { int v = qq.front(); qq.pop(); _comp.push_back(v); vector<int> rv; for (auto it : sv) { int vv = it; if (!binary_search(gr, gr + m, make_pair(v, it))) { qq.push(vv); rv.push_back(vv); } } for (int i = 0; i < rv.size(); i++) { sv.erase(rv[i]); } } answww.push_back(_comp); } printf( %d n , answww.size()); for (int i = 0; i < answww.size(); i++) { printf( %d , answww[i].size()); for (int j = 0; j < answww[i].size(); j++) { printf( %d , answww[i][j] + 1); } puts( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) { return a; } gcd(b, a % b); } int n, m, a, b, t; bool eo = 0; int main() { cin >> n >> m; n++; m++; for (int i = 1; i <= n; i++) { if (i == 1) cin >> a; else cin >> t; } for (int i = 1; i <= m; i++) { if (i == 1) cin >> b; else cin >> t; } if (a * b < 0) eo = 1; if (n > m) { if (eo) cout << - ; cout << Infinity << endl; } if (n < m) { cout << 0/1 ; } if (n == m) { a = abs(a), b = abs(b); int t = gcd(a, b); if (eo) cout << - ; a /= t, b /= t; cout << a << / << b; } } |
#include <bits/stdc++.h> using namespace std; bool test_cases; void init(bool k) { test_cases = k; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } struct test_cases { void prepare_left(long long *great_left, long long n, long long *a) { stack<long long> st; great_left[0] = -1; st.push(a[0]); for (long long i = 1; i < n; i++) { while (!st.empty() and st.top() < a[i]) { st.pop(); } if (st.empty()) { great_left[i] = -1; } else { great_left[i] = st.top(); } st.push(a[i]); } } void prepare_right(long long *great_right, long long n, long long *a) { stack<long long> st; great_right[n - 1] = -1; st.push(a[n - 1]); for (long long i = n - 2; i >= 0; i--) { while (!st.empty() and st.top() < a[i]) { st.pop(); } if (st.empty()) { great_right[i] = -1; } else { great_right[i] = st.top(); } st.push(a[i]); } } void test_case(long long test) { long long n; cin >> n; long long a[n]; long long great_left[n]; long long great_right[n]; for (long long i = 0; i < n; i++) cin >> a[i]; long long ans = 0; for (long long i = 0; i < n - 1; i++) { ans = max(ans, a[i] ^ a[i + 1]); } prepare_left(great_left, n, a); prepare_right(great_right, n, a); for (long long i = 0; i < n; i++) { long long left = great_left[i]; long long right = great_right[i]; if (left != -1) { ans = max(ans, left ^ a[i]); } if (right != -1) { ans = max(ans, right ^ a[i]); } if (left != -1 and right != -1) { ans = max(ans, left ^ right); } } cout << ans << n ; } }; int32_t main() { init(false); long long tc; if (test_cases) { cin >> tc; } else { tc = 1; } for (long long i = 0; i < tc; i++) { struct test_cases o; o.test_case(i + 1); } return 0; }; |
#include <bits/stdc++.h> using namespace std; bool solve(vector<int>& arr, int m, int n, int k) { vector<int> dp(n + 1, 0); int last = 0; for (int i = k; i <= n; i++) { int l = dp[i - k] + 1; if (arr[i] - arr[l] <= m) last = i; dp[i] = last; } return dp[n] == n; } int main() { int n, k; cin >> n >> k; vector<int> arr(n + 1); for (int i = 1; i <= n; i++) cin >> arr[i]; sort(arr.begin() + 1, arr.end()); int s = 0; int g = 1e9 + 1; int ans = -1; while (s != g) { int m = (s + g) / 2; if (solve(arr, m, n, k)) { g = m; ans = m; } else { if (s == m) { break; } s = m; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, INF = N; int n, L, R, ANS_U, ANS_V, ANS; struct st { int nxt, to, w, dis; } ed[N << 1]; int head[N], num; void add(int from, int to, int w) { ed[++num].to = to, ed[num].w = w; ed[num].nxt = head[from]; head[from] = num; } int sum, rt, siz[N], mx[N]; bool vis[N]; void getrt(int x, int fa) { mx[x] = 0; for (int u, i = head[x]; i; i = ed[i].nxt) { u = ed[i].to; if (u == fa || vis[u]) continue; getrt(u, x), mx[x] = max(mx[x], siz[u]); } mx[x] = max(mx[x], sum - siz[x]); if (mx[x] < mx[rt]) rt = x; } int mxd[N], V[N]; vector<int> E[N]; void dfs_init(int x, int fa) { mxd[x] = 0, siz[x] = 1; for (int u, i = head[x]; i; i = ed[i].nxt) { u = ed[i].to; if (vis[u] || u == fa) continue; dfs_init(u, x), mxd[x] = max(mxd[x], mxd[u] + 1), siz[x] += siz[u]; } } bool cmp(int a, int b) { return mxd[a] < mxd[b]; } void work(int x) { dfs_init(x, 0); int h = 0; for (int i = head[x]; i; i = ed[i].nxt) if (!vis[ed[i].to]) V[++h] = ed[i].to; sort(V + 1, V + 1 + h, cmp); for (int i = 1; i <= h; i++) E[x].push_back(V[i]); } void solve_init(int x) { work(x), vis[x] = 1; for (int u, i = head[x]; i; i = ed[i].nxt) { u = ed[i].to; if (vis[u]) continue; rt = 0, sum = siz[u], getrt(u, x), solve_init(rt); } } int f[N], a[N], s[N], id_a[N], id_s[N], ans_u, ans_v, ans; void dfs(int x, int fa, int dep) { if (f[x] > a[dep]) a[dep] = f[x], id_a[dep] = x; for (int u, i = head[x]; i; i = ed[i].nxt) { u = ed[i].to; if (vis[u] || u == fa) continue; f[u] = f[x] + ed[i].dis, dfs(u, x, dep + 1); } } int q[N], hd, tail; void calc(int x) { dfs_init(x, 0); int len = 0; for (int i = head[x]; i; i = ed[i].nxt) if (!vis[ed[i].to]) f[ed[i].to] = ed[i].dis, ++mxd[ed[i].to]; for (int i = 0; i <= mxd[x]; i++) s[i] = -N; s[0] = 0, id_s[0] = x; for (auto u : E[x]) { if (vis[u]) continue; for (int i = 0; i <= mxd[u]; i++) a[i] = -N; a[0] = 0, id_a[0] = x; dfs(u, x, 1), hd = 1, tail = 0; if (L <= len) for (int i = min(R, len); i > L; i--) { while (hd <= tail && s[q[tail]] <= s[i]) --tail; q[++tail] = i; } for (int i = 0; i <= mxd[u]; i++) { while (hd <= tail && q[hd] > R - i) ++hd; if (len >= L - i && L - i >= 0) { while (hd <= tail && s[L - i] >= s[q[tail]]) --tail; q[++tail] = L - i; } if (hd <= tail && s[q[hd]] + a[i] > ans) ans = s[q[hd]] + a[i], ans_u = id_a[i], ans_v = id_s[q[hd]]; } for (int i = 0; i <= mxd[u]; i++) if (a[i] > s[i]) s[i] = a[i], id_s[i] = id_a[i]; len = max(len, mxd[u]); } } void solve(int x) { calc(x), vis[x] = 1; for (int u, i = head[x]; i; i = ed[i].nxt) { u = ed[i].to; if (vis[u]) continue; rt = 0, sum = siz[u], getrt(u, x), solve(rt); } } int main() { int u, v, w, l = 0, r = 0; scanf( %d%d%d , &n, &L, &R); for (int i = 1; i < n; i++) scanf( %d%d%d , &u, &v, &w), add(u, v, w), add(v, u, w), r = max(r, w); mx[0] = N, rt = 0, sum = n, getrt(1, 0), solve_init(rt); while (l <= r) { int mid = (l + r) >> 1; for (int i = 1; i <= num; i++) ed[i].dis = (ed[i].w >= mid) ? 1 : -1; for (int i = 1; i <= n; i++) vis[i] = 0; mx[0] = N, ans = -N, rt = 0, sum = n, getrt(1, 0), solve(rt); if (ans >= 0) ANS_U = ans_u, ANS_V = ans_v, ANS = mid, l = mid + 1; else r = mid - 1; } printf( %d %d n , ANS_U, ANS_V); return 0; } |
#include <bits/stdc++.h> using namespace std; int light[3000]; int agr[3000]; int main() { int n; scanf( %d , &n); int m = pow(2, n + 1) - 1; for (int i = 2; i <= m; i++) { scanf( %d , &light[i]); } int ans = 0; for (int i = m; i >= 3; i--) { if (i % 2 == 0) continue; int a = light[i] + agr[i]; int b = light[i - 1] + agr[i - 1]; int c = a; if (a != b) { c = max(a, b); ans += abs(b - a); } agr[i / 2] = c; agr[(i - 1) / 2] = c; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; long long k, wyn; long long tab[27][27]; map<long long, long long> odp[27][27]; void back1(int, int, long long); void back2(int, int, long long); int main() { ios_base::sync_with_stdio(0); cin >> n >> m >> k; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) cin >> tab[i][j]; } back1(1, 1, tab[1][1]); back2(n, m, k); if (n == 1 && m == 1 && tab[1][1] == k) cout << 1; else cout << wyn; return 0; } void back1(int x, int y, long long akt) { if (x + y == n + 1) { odp[x][y][akt]++; return; } if (x + 1 <= n) back1(x + 1, y, (akt ^ tab[x + 1][y])); if (y + 1 <= m) back1(x, y + 1, (akt ^ tab[x][y + 1])); } void back2(int x, int y, long long akt) { if (x + y == n + 1) { wyn += odp[x][y][akt]; return; } if (x - 1 >= 1) back2(x - 1, y, (akt ^ tab[x][y])); if (y - 1 >= 1) back2(x, y - 1, (akt ^ tab[x][y])); } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int calc(int a, int x, int n) { return max(0, min(x - (a + 1) / 2, n - a)); } void solve(istream &in, ostream &out) { int n, m, x, y, a, b; in >> n >> m >> x >> y >> a >> b; int d = gcd(a, b); a /= d; b /= d; int t = min(n / a, m / b); a *= t; b *= t; int x1 = calc(a, x, n); int y1 = calc(b, y, m); int x2 = x1 + a; int y2 = y1 + b; out << x1 << << y1 << << x2 << << y2 << endl; } int main() { solve(cin, cout); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string a, b; cin >> a >> b; n *= 2; int n1 = 0, n2 = 0, q = 0; for (int i = 0; i < n; ++i) if (a[i] == 1 ) if (b[i] == 1 ) q = !q; else ++n1; else if (b[i] == 1 ) ++n2; n1 += q; if (n1 == n2 - 1 || n1 == n2) cout << Draw ; else if (n1 > n2) cout << First ; else cout << Second ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[300010], p[300010], d[32]; int f[6000010][3], cnt = 1, ans; void insert(int x, int y) { f[x][2]++; if (y > 30) return; if (!f[x][d[y]]) f[x][d[y]] = ++cnt, insert(cnt, y + 1); else insert(f[x][d[y]], y + 1); } void dg(int x, int y) { f[x][2]--; if (y > 30) { printf( %d , ans); return; } if (f[x][d[y]] && f[f[x][d[y]]][2]) dg(f[x][d[y]], y + 1); else { ans = ans + (1 << (30 - y)); dg(f[x][1 - d[y]], y + 1); } } int main() { int n, i, j, k; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= n; i++) { scanf( %d , &p[i]); j = p[i]; d[0] = 30; while (j) { d[d[0]--] = j % 2; j /= 2; } for (k = d[0]; k > 0; k--) d[k] = 0; insert(1, 1); } for (i = 1; i <= n; i++) { j = a[i]; d[0] = 30; ans = 0; while (j) { d[d[0]--] = j % 2; j /= 2; } for (k = d[0]; k > 0; k--) d[k] = 0; dg(1, 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool a[18][18]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) a[i][j] = 1; } map<string, int> mp; string name; vector<string> names(n); for (int i = 0; i < n; i++) { cin >> name; mp[name] = i; names[i] = name; } string s1, s2; for (int i = 0; i < m; i++) { cin >> s1 >> s2; a[mp[s1]][mp[s2]] = 0; a[mp[s2]][mp[s1]] = 0; } int res = 0; vector<int> v; vector<int> vres; for (int i = 1; i < (1 << n); i++) { v.clear(); for (int j = 0; j < n; j++) { if ((1 << j) & i) { v.push_back(j); } } bool b = true; for (int j = 0; j < v.size(); j++) { for (int k = j + 1; k < v.size(); k++) { if (!a[v[j]][v[k]]) { b = false; break; } } } if (b) { if (v.size() > res) { res = v.size(); vres = v; } } } cout << res << endl; vector<string> team; for (int i = 0; i < vres.size(); i++) { team.push_back(names[vres[i]]); } sort(team.begin(), team.end()); for (int i = 0; i < team.size(); i++) { if (i != 0) cout << endl; cout << team[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[2010], b[2010]; unordered_map<int, int> mp; int main() { int n; scanf( %d , &n); int ans = 0; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); mp[a[i]] = 1; } for (int i = 0; i < n; i++) { scanf( %d , &b[i]); mp[b[i]] = 1; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (mp[a[i] ^ b[j]] == 1) ans++; } } if (ans % 2 == 1) { puts( Koyomi ); } else { puts( Karen ); } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int n, sum; int cnt[100005], from[100005], to[100005], c[100005]; int main() { scanf( %d , &n); for (int i = 1; i < n; i++) scanf( %d%d , &from[i], &to[i]); for (int i = 1; i <= n; i++) scanf( %d , &c[i]); for (int i = 1; i < n; i++) { if (c[from[i]] != c[to[i]]) { cnt[from[i]]++; cnt[to[i]]++; sum++; } } for (int i = 1; i <= n; i++) { if (cnt[i] == sum) { printf( YES n%d n , i); return 0; } } printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int solve(int t) { int a, b, c, rem = 0, sum = 0; while (t != 0) { rem = t % 10; sum += rem; t /= 10; } if (sum % 4 == 0) return 1; return 0; } int main() { int t, n, flag = 0; cin >> t; while (1) { flag = solve(t); if (flag == 1) { cout << t << n ; break; } else t++; } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace IO { const int __S = (1 << 20) + 5; char __buf[__S], *__H, *__T; inline char getc() { if (__H == __T) __T = (__H = __buf) + fread(__buf, 1, __S, stdin); if (__H == __T) return -1; return *__H++; } template <class __I> inline void read(__I &__x) { __x = 0; int __fg = 1; char __c = getc(); while (!isdigit(__c) && __c != - ) __c = getc(); if (__c == - ) __fg = -1, __c = getc(); while (isdigit(__c)) __x = __x * 10 + __c - 0 , __c = getc(); __x *= __fg; } inline void readd(double &__x) { __x = 0; double __fg = 1.0; char __c = getc(); while (!isdigit(__c) && __c != - ) __c = getc(); if (__c == - ) __fg = -1.0, __c = getc(); while (isdigit(__c)) __x = __x * 10.0 + __c - 0 , __c = getc(); if (__c != . ) { __x = __x * __fg; return; } else while (!isdigit(__c)) __c = getc(); double __t = 1e-1; while (isdigit(__c)) __x = __x + 1.0 * (__c - 0 ) * __t, __t = __t * 0.1, __c = getc(); __x = __x * __fg; } inline void reads(char *__s, int __x) { char __c = getc(); int __tot = __x - 1; while (__c < ! || __c > ~ ) __c = getc(); while (__c >= ! && __c <= ~ ) __s[++__tot] = __c, __c = getc(); __s[++__tot] = 0 ; } char __obuf[__S], *__oS = __obuf, *__oT = __oS + __S - 1, __c, __qu[55]; int __qr; inline void flush() { fwrite(__obuf, 1, __oS - __obuf, stdout); __oS = __obuf; } inline void putc(char __x) { *__oS++ = __x; if (__oS == __oT) flush(); } template <class __I> inline void print(__I __x) { if (!__x) putc( 0 ); if (__x < 0) putc( - ), __x = -__x; while (__x) __qu[++__qr] = __x % 10 + 0 , __x /= 10; while (__qr) putc(__qu[__qr--]); } inline void prints(const char *__s, const int __x) { int __len = strlen(__s + __x); for (int __i = __x; __i < __len + __x; __i++) putc(__s[__i]); } inline void printd(double __x, int __d) { long long __t = (long long)floor(__x); print(__t); putc( . ); __x -= (double)__t; while (__d--) { double __y = __x * 10.0; __x *= 10.0; int __c = (int)floor(__y); putc(__c + 0 ); __x -= floor(__y); } } inline void el() { putc( n ); } inline void sp() { putc( ); } } // namespace IO using namespace IO; int cnt, sz[400005], usz[400005], n, x, y, g[400005], to[800005], he[400005], ne[800005], fm[400005], um[400005], sm[400005], ans[400005]; void dfs1(int x, int fa) { sz[x] = 1; for (int i = he[x], y; ~i; i = ne[i]) if ((y = to[i]) != fa) { dfs1(y, x), sz[x] += sz[y]; if (sz[y] > n / 2) g[x] = y, sm[x] = max(sm[x], fm[y]), sm[x] > fm[x] ? swap(sm[x], fm[x]) : void(0); else sm[x] = max(sm[x], sz[y]), sm[x] > fm[x] ? swap(sm[x], fm[x]) : void(0); } usz[x] = n - sz[x]; if (usz[x] > n / 2) g[x] = -1; } void dfs2(int x, int fa) { if (usz[x] <= n / 2) um[x] = usz[x]; else { if (fm[fa] == sz[x]) um[x] = sm[fa]; else um[x] = fm[fa]; um[x] = max(um[x], um[fa]); } for (int i = he[x], y; ~i; i = ne[i]) if ((y = to[i]) != fa) dfs2(y, x); } void add(int x, int y) { to[cnt] = y; ne[cnt] = he[x]; he[x] = cnt++; } int main() { memset(he, -1, sizeof(he)); read(n); for (int i = 1; i < n; i++) read(x), read(y), add(x, y), add(y, x); dfs1(1, 0); dfs2(1, 0); for (int i = 1; i <= n; i++) { if (!g[i]) ans[i] = 1; else if (g[i] == -1 && usz[i] - um[i] <= n / 2) ans[i] = 1; else if (g[i] != -1 && sz[g[i]] - fm[g[i]] <= n / 2) ans[i] = 1; } for (int i = 1; i <= n; i++) print(ans[i]), sp(); flush(); } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { if (b == 0) return 1; if (b == 1) return a; long long int r = power(a, b / 2) % 1000000007; if (b % 2 == 0) return (r * r) % 1000000007; else return (((r * r) % 1000000007) * a) % 1000000007; } int prime[1000009]; int sumprime[1000009]; void sieve(int n) { prime[0] = prime[1] = 1; for (int i = 2; i <= sqrt(n); i++) { if (!prime[i]) { for (int j = 2 * i; j <= n; j = j + i) { prime[j]++; } } } for (int i = 1; i <= n; i++) { if (!prime[i]) { sumprime[i] = sumprime[i - 1] + 1; } else { sumprime[i] = sumprime[i - 1]; } } } bool comp(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { return (a.second < b.second); } const int N = 5 * 1e5 + 9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; int n = s.length(); int flag = 0; map<char, int> mp; mp[ A ]++; mp[ H ]++; mp[ I ]++; mp[ M ]++; mp[ O ]++; mp[ o ]++; mp[ T ]++; mp[ U ]++; mp[ V ]++; mp[ v ]++; mp[ W ]++; mp[ w ]++; mp[ X ]++; mp[ x ]++; mp[ Y ]++; mp[ b ]++; mp[ d ]++; mp[ p ]++; mp[ q ]++; if (n % 2) { char c = s[n / 2]; if (c == p || c == q || c == d || c == b ) { flag++; } } for (int i = 0; i < n; i++) { if (mp.find(s[i]) == mp.end()) { flag++; break; } if (s[i] == b ) { if (s[n - i - 1] != d ) { flag++; break; } continue; } if (s[i] == d ) { if (s[n - i - 1] != b ) { flag++; break; } continue; } if (s[i] == p ) { if (s[n - i - 1] != q ) { flag++; break; } continue; } if (s[i] == q ) { if (s[n - i - 1] != p ) { flag++; break; } continue; } if (s[i] != s[n - i - 1]) { flag++; break; } } if (flag) { cout << NIE n ; return 0; } cout << TAK n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::string a; std::getline(cin, a); ; std::string b; std::getline(cin, b); ; int team1 = 0; int team2 = 0; for (int i = 0; i < a.size(); i = i + 2) { if (a[i] == b[i]) { } else if ((a[i] == 8 && b[i] == [ ) || (a[i] == [ && b[i] == ( ) || (a[i] == ( && b[i] == 8 )) { team1++; } else { team2++; } } if (team1 == team2) { cout << TIE ; } else if (team1 > team2) { cout << TEAM 1 WINS ; } else { cout << TEAM 2 WINS ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; int a1, b1, c1, a2, b2, c2, m = 0, n = 0; if (a > x) { if (abs(a - x) >= 2) { if ((a - x) % 2 == 0) m = m + a - x; else m = m + a - x - 1; } } else n = n + a - x; if (b > y) { if (abs(b - y) >= 2) { if ((b - y) % 2 == 0) m = m + b - y; else m = m + b - y - 1; } } else n = n + b - y; if (c > z) { if (abs(c - z) >= 2) { if ((c - z) % 2 == 0) m = m + c - z; else m = m + c - z - 1; } } else n = n + c - z; if (m >= n * -2) cout << Yes << endl; else cout << No << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int R, C; string t[2222]; int s1[2222][2222]; int main() { memset(s1, 0, sizeof(s1)); cin >> R >> C; for (int r = 0; r < (int)R; r++) { cin >> t[r]; for (int c = 0; c < (int)C; c++) { if (t[r][c] == w ) { s1[r + 1][c + 1]++; } } } for (int r = 0; r < (int)2221; r++) { for (int c = 0; c < (int)2221; c++) { s1[r + 1][c + 1] += (s1[r + 1][c] + s1[r][c + 1] - s1[r][c]); } } int lo = 0; int hi = max(R, C); while (lo < hi - 1) { int len = (lo + hi) / 2; bool isSome = false; for (int r = 0; r + len - 1 < max(R, C); r++) { for (int c = 0; c + len - 1 < max(R, C); c++) { if (s1[r + len][c + len] - s1[r + len][c] - s1[r][c + len] + s1[r][c] == s1[2221][2221]) { isSome = true; break; } } if (isSome) break; } if (isSome) hi = len; else lo = len; } cerr << hi << endl; bool done = false; for (int r = 0; r + hi - 1 < R; r++) { for (int c = 0; c + hi - 1 < C; c++) { int big = s1[r + hi][c + hi] - s1[r][c + hi] - s1[r + hi][c] + s1[r][c]; int small = 0; if (hi != 1 && hi != 2) { small = s1[r + hi - 1][c + hi - 1] - s1[r + 1][c + hi - 1] - s1[r + hi - 1][c + 1] + s1[r + 1][c + 1]; } if (big - small == s1[2221][2221]) { for (int i = 0; i < hi; i++) { if (t[r][c + i] == . ) t[r][c + i] = + ; if (t[r + hi - 1][c + i] == . ) t[r + hi - 1][c + i] = + ; if (t[r + i][c] == . ) t[r + i][c] = + ; if (t[r + i][c + hi - 1] == . ) t[r + i][c + hi - 1] = + ; } done = true; break; } if (done) break; } if (done) break; } if (done) { for (int r = 0; r < (int)R; r++) { for (int c = 0; c < (int)C; c++) { cout << t[r][c]; } cout << endl; } cout << endl; } else { cout << -1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; double EPS = 1e-9; int N, K; double L, V1, V2; bool f(double t) { if (L / V1 < t - EPS) return true; int nGroups = N / K; if (N % K != 0) nGroups++; double distByBus = (t * V1 * V2 - L * V2) / (V1 - V2); double tByBus = distByBus / V2; double posBus = distByBus; double tElapsed = tByBus; nGroups--; while (nGroups > 0) { double posGroup = tElapsed * V1; if (posGroup > L - EPS) break; double tMeet = (posBus - posGroup) / (V1 + V2); double posMeet = posGroup + tMeet * V1; tElapsed += tMeet; if (L - posMeet < distByBus - EPS) { tElapsed += (L - posMeet) / V2; posBus = L; } else { tElapsed += tByBus; posBus = posMeet + distByBus; } nGroups--; } return tElapsed < t + EPS; } int main() { cin >> N >> L >> V1 >> V2 >> K; double lo = 0, hi = 1e9 + 5; int i = 0; while (hi - lo > EPS && i++ < 100) { double mid = (lo + hi) / 2; if (f(mid)) { hi = mid; } else lo = mid; } cout << fixed << setprecision(10) << hi << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; int w[1007]; int n, x; int d[107]; int N = 101; int mat[107][107]; void mNoz(int (&a)[107][107], int (&b)[107][107], int (&c)[107][107]) { long long res[107][107]; for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) res[i][j] = 0; for (int i = 1; i <= N; ++i) for (int k = 1; k <= N; ++k) for (int j = 1; j <= N; ++j) res[i][j] += ((long long)a[i][k] * b[k][j]) % mod; for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) c[i][j] = res[i][j] % mod; } void pot(int (&a)[107][107], int (&c)[107][107], int k) { int res[107][107]; for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) res[i][j] = i == j; while (k > 0) { if (k & 1) mNoz(res, a, res); mNoz(a, a, a); k /= 2; } for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) c[i][j] = res[i][j]; } int main() { ios_base::sync_with_stdio(0); cin >> n >> x; for (int i = 1; i <= n; ++i) { int a; cin >> a; mat[1][a]++; } mat[1][N] = mat[N][N] = 1; for (int i = 1; i + 1 < N; ++i) mat[i + 1][i] = 1; pot(mat, mat, x); int wyn = mat[1][1] + mat[1][N]; wyn %= mod; cout << wyn << endl; return 0; } |
#include <bits/stdc++.h> inline char nc() { static char buf[1000000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; } inline void read(int &x) { static char c; for (c = getchar(); !( 0 <= c && c <= 9 ); c = getchar()) ; for (x = 0; ( 0 <= c && c <= 9 ); c = getchar()) x = x * 10 + c - 48; } void write(int x) { if (x < 10) { putchar( 0 + x); return; } write(x / 10); putchar( 0 + x % 10); } inline void writeln(int x) { if (x < 0) putchar( - ), x *= -1; write(x); putchar( n ); } inline void writel(int x) { if (x < 0) putchar( - ), x *= -1; write(x); putchar( ); } using namespace std; int T, a[1007], sb, ans[1007 * 1007], n, tot; void play(int x) { ans[++tot] = x; a[x] ^= a[x + 2], a[x + 2] ^= a[x], a[x] ^= a[x + 2]; a[x + 1] ^= a[x + 2], a[x + 2] ^= a[x + 1], a[x + 1] ^= a[x + 2]; } signed main() { read(T); while (T--) { read(n); tot = 0; for (int i = 1; i <= n; i++) read(a[i]); for (int i = 1; i <= n - 2; i++) { sb = i; for (int j = i + 1; j <= n; j++) if (a[j] < a[sb]) sb = j; while (sb >= i + 2) play(sb - 2), sb -= 2; if (sb == i + 1) { play(i), play(i); continue; } } for (int i = n; i >= 3; i--) { sb = i; for (int j = i - 1; j; j--) if (a[j] > a[sb]) sb = j; while (sb <= i - 2) play(sb), play(sb), sb += 2; if (sb == i - 1) { play(sb - 1); continue; } } for (int i = 1; i < n; i++) if (a[i] > a[i + 1]) tot = -1; writeln(tot); if (tot <= 0) continue; for (int i = 1; i < tot; i++) writel(ans[i]); writeln(ans[tot]); } return 0; } |
#include<bits/stdc++.h> using namespace std; #define ll long long #define mod 1000000007 #define pb push_back #define ff first #define ss second #define all(a) (a).begin(),(a).end() #define fr(i,a,b) for(int i=a;i<b;i++) #define mapit(i,mp) for(auto i = mp.begin(); i!=mp.end(); i++) #define pii pair<int,int> int cte[100001] ; int cto[100001] ; void solve(){ int n; cin>>n; int a[n]; fr(i,0,n){ cin>>a[i]; } int b[n]; fr(i,0,n){ b[i] = a[i]; } sort(b,b+n); for(int i = 0; i<n; i++){ if(i%2 == 0){ cte[a[i]]++; }else{ cto[a[i]]++; } } bool flag = true; for(int i = 0; i<n; i++){ if(i%2 == 0){ if(cte[b[i]] == 0){ flag = false; break; } cte[b[i]]--; }else{ if(cto[b[i]] == 0){ flag = false; break; } cto[b[i]]--; } } if(flag){ cout<< YES << n ; }else{ cout<< NO << n ; } } int main(){ #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif int t = 1; cin>>t; while(t--) { fr(i,0,100001){ cte[i] = 0; } fr(i,0,100001){ cto[i] = 0; } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; string s; vector<int> pos[26]; int xd[26]; int main() { cin >> s; n = s.size(); for (int i = 0; i < n; i++) { pos[s[i] - a ].push_back(i); xd[s[i] - a ]++; } double ans = 0; for (char c = a ; c <= z ; c++) { int best = 0; for (int shift = 0; shift < n; shift++) { vector<int> cnt(26, 0); for (int i : pos[c - a ]) { cnt[s[(i + shift) % n] - a ]++; } int nunique = 0; for (int i = 0; i < 26; i++) { if (cnt[i] == 1) { nunique++; } } best = max(best, nunique); } ans += 1.0 * best / n; } printf( %.10lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e+5; bool vis[maxn]; int main() { int T, n, m, l; cin.sync_with_stdio(false); cout.sync_with_stdio(false); cin.tie(0); cout.tie(0); while (cin >> n) { memset(vis, false, sizeof vis); int pos = n; int now = 0; cout << 1 ; for (int i = 0; i < n; i++) { int x; cin >> x; now++; vis[x] = true; while (vis[pos]) { pos--; now--; } cout << now + 1 << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> d[101000]; int k[101000]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &k[i]); for (int j = 0; j < k[i]; j++) { int a; scanf( %d , &a); d[i].push_back(a); } sort(d[i].begin(), d[i].end()); } int res = 0; for (int i = 0; i < n; i++) { int a = (i + n - 1) % n; int b = (i + 1) % n; for (int j = 0; j < k[i] - 1; j++) { vector<int>::iterator ini = lower_bound(d[a].begin(), d[a].end(), d[i][j]); vector<int>::iterator fim = lower_bound(d[a].begin(), d[a].end(), d[i][j + 1]); int cta = fim - ini; ini = lower_bound(d[b].begin(), d[b].end(), d[i][j]); fim = lower_bound(d[b].begin(), d[b].end(), d[i][j + 1]); if (fim - ini != cta) { res++; } } } printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; if (n <= min(m, k)) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; template <class C> void mini(C& _a4, C _b4) { _a4 = min(_a4, _b4); } template <class C> void maxi(C& _a4, C _b4) { _a4 = max(_a4, _b4); } template <class TH> void _dbg(const char* sdbg, TH h) { cerr << sdbg << = << h << endl; } template <class TH, class... TA> void _dbg(const char* sdbg, TH h, TA... a) { while (*sdbg != , ) cerr << *sdbg++; cerr << = << h << , ; _dbg(sdbg + 1, a...); } struct Dinic { struct Edge { long long v, c, inv; }; public: Dinic() { n = -1; } void AddEdge(long long a, long long b, long long cap, long long bi_dir) { if (n < max(a, b)) { n = max(n, max(a, b)); ResizeVectors(); } e_orig[a].push_back(Edge{b, cap, ((long long)(e_orig[b]).size())}); e_orig[b].push_back( Edge{a, bi_dir * cap, ((long long)(e_orig[a]).size()) - 1}); } long long MaxFlow(long long s, long long t) { e = e_orig; long long result = 0; while (Bfs(s, t)) { for (long long i = 0; i <= n; i++) { beg[i] = 0; } result += Dfs(s, t, kInf); } return result; } vector<bool> MinCut(long long s, long long t) { assert(!Bfs(s, t)); vector<bool> res(n + 1); for (long long i = 0; i <= n; i++) { if (dis[i] <= n) { res[i] = true; } } return res; } private: long long n; vector<vector<Edge>> e_orig, e; vector<long long> dis, beg; vector<pair<long long, long long>> cut; bool Bfs(long long s, long long t) { for (long long i = 0; i <= n; i++) { dis[i] = n + 1; } dis[s] = 0; vector<long long> que; que.push_back(s); for (long long i = 0; i < ((long long)(que).size()); i++) { long long v = que[i]; for (auto edge : e[v]) { long long nei = edge.v; if (edge.c && dis[nei] > dis[v] + 1) { dis[nei] = dis[v] + 1; que.push_back(nei); if (nei == t) { cut.clear(); return true; } } else if (!edge.c) { cut.push_back(make_pair(v, nei)); } } } return false; } long long Dfs(long long v, long long t, long long min_cap) { long long result = 0; if (v == t || min_cap == 0) { return min_cap; } for (long long& i = beg[v]; i < ((long long)(e[v]).size()); i++) { long long nei = e[v][i].v; long long c = e[v][i].c; if (dis[nei] == dis[v] + 1 && c > 0) { long long flow_here = Dfs(nei, t, min(min_cap, c)); result += flow_here; min_cap -= flow_here; e[v][i].c -= flow_here; e[nei][e[v][i].inv].c += flow_here; } if (min_cap == 0) { break; } } return result; } void ResizeVectors() { e_orig.resize(n + 2); beg.resize(n + 2); dis.resize(n + 2); } static const long long kInf = 1e18; }; struct GomoryHu { vector<vector<pair<long long, long long>>> graph; vector<vector<long long>> nodes; vector<bool> visited; vector<long long> groupId, contrId; vector<long long> edgeFrom, edgeTo, edgeLen; long long wnode; long long n; GomoryHu(long long N) : graph(N), visited(N), groupId(N), contrId(N), n(N) {} void addEdge(long long u, long long v, long long cap) { graph[u].emplace_back(v, cap); graph[v].emplace_back(u, cap); } void dfs(long long v, long long type) { visited[v] = true; contrId[v] = type; for (long long i = 0; i < ((long long)(edgeFrom).size()); i++) { if (edgeFrom[i] == v && !visited[edgeTo[i]]) { dfs(edgeTo[i], type); } } } vector<vector<pair<long long, long long>>> run() { vector<long long> allNodes(n); iota((allNodes).begin(), (allNodes).end(), 0); nodes = vector<vector<long long>>{allNodes}; edgeFrom.clear(); edgeTo.clear(); edgeLen.clear(); fill((groupId).begin(), (groupId).end(), 0); for (long long step = 0; step < n - 1; step++) { Dinic dinic; for (long long i = 0; i < ((long long)(nodes).size()); i++) { if (((long long)(nodes[i]).size()) > 1) { wnode = i; break; } } random_shuffle((nodes[wnode]).begin(), (nodes[wnode]).end()); fill((visited).begin(), (visited).end(), false); visited[wnode] = true; for (long long i = 0; i < ((long long)(edgeFrom).size()); i++) { if (edgeFrom[i] == wnode) { dfs(edgeTo[i], edgeTo[i]); } } for (long long v = 0; v < n; v++) { long long a = groupId[v] == wnode ? v : contrId[groupId[v]] + n; for (auto& P : graph[v]) { long long b = groupId[P.first] == wnode ? P.first : contrId[groupId[P.first]] + n; dinic.AddEdge(a, b, P.second, 0); } } dinic.AddEdge(2 * n, 2 * n, 0, 0); long long a = nodes[wnode][0], b = nodes[wnode][1], f = dinic.MaxFlow(a, b); auto cut = dinic.MinCut(a, b); for (long long i = 0; i < ((long long)(edgeFrom).size()); i++) { if (edgeFrom[i] != wnode && edgeTo[i] == wnode && !cut[edgeFrom[i] + n]) { edgeTo[i] = step + 1; } if (edgeTo[i] != wnode && edgeFrom[i] == wnode && !cut[edgeTo[i] + n]) { edgeFrom[i] = step + 1; } } edgeFrom.push_back(wnode); edgeTo.push_back(step + 1); edgeLen.push_back(f); edgeFrom.push_back(step + 1); edgeTo.push_back(wnode); edgeLen.push_back(f); vector<long long> A, B; for (long long v : nodes[wnode]) { (cut[v] ? A : B).push_back(v); if (!cut[v]) { groupId[v] = step + 1; } } nodes[wnode] = A; nodes.push_back(B); } vector<vector<pair<long long, long long>>> tree(n); for (long long i = 0; i < ((long long)(edgeFrom).size()); i++) { tree[nodes[edgeFrom[i]][0]].emplace_back(nodes[edgeTo[i]][0], edgeLen[i]); } return tree; } }; int main() { long long N, M; cin >> N >> M; GomoryHu gomory(N); for (long long i = 0; i < M; i++) { long long u, v, c; cin >> u >> v >> c; gomory.addEdge(u - 1, v - 1, c); } auto V = gomory.run(); vector<long long> connRoot(N); vector<list<long long>> vertList(N); iota((connRoot).begin(), (connRoot).end(), 0); for (long long i = 0; i < N; i++) { vertList[i].push_back(i); } vector<tuple<long long, long long, long long>> edges; for (long long i = 0; i < N; i++) { for (auto& P : V[i]) { if (i < P.first) { edges.emplace_back(-P.second, i, P.first); } } } sort((edges).begin(), (edges).end()); long long sum = 0; for (auto E : edges) { long long from = get<1>(E), to = get<2>(E); sum -= get<0>(E); from = connRoot[from]; to = connRoot[to]; if (from > to) { swap(from, to); } (from, to); vertList[from].splice(vertList[from].end(), vertList[to]); for (long long i = 0; i < N; i++) { if (connRoot[i] == to) { connRoot[i] = from; } } } cout << sum << n ; for (long long v : vertList[0]) { cout << v + 1 << ; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using uint = unsigned int; template <class T> using V = vector<T>; template <class T> using VV = vector<vector<T>>; template <class T, class U> void chmax(T& x, U y) { if (x < y) x = y; } template <class T, class U> void chmin(T& x, U y) { if (y < x) x = y; } template <class T> void mkuni(V<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } template <class S, class T> ostream& operator<<(ostream& o, const pair<S, T>& p) { return o << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& o, const vector<T>& vc) { o << { ; for (const T& v : vc) o << v << , ; o << } ; return o; } constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <unsigned int mod_> struct ModInt { using uint = unsigned int; using ll = long long; using ull = unsigned long long; constexpr static uint mod = mod_; uint v; ModInt() : v(0) {} ModInt(ll _v) : v(normS(_v % mod + mod)) {} explicit operator bool() const { return v != 0; } static uint normS(const uint& x) { return (x < mod) ? x : x - mod; } static ModInt make(const uint& x) { ModInt m; m.v = x; return m; } ModInt operator+(const ModInt& b) const { return make(normS(v + b.v)); } ModInt operator-(const ModInt& b) const { return make(normS(v + mod - b.v)); } ModInt operator-() const { return make(normS(mod - v)); } ModInt operator*(const ModInt& b) const { return make((ull)v * b.v % mod); } ModInt operator/(const ModInt& b) const { return *this * b.inv(); } ModInt& operator+=(const ModInt& b) { return *this = *this + b; } ModInt& operator-=(const ModInt& b) { return *this = *this - b; } ModInt& operator*=(const ModInt& b) { return *this = *this * b; } ModInt& operator/=(const ModInt& b) { return *this = *this / b; } ModInt& operator++(int) { return *this = *this + 1; } ModInt& operator--(int) { return *this = *this - 1; } ll extgcd(ll a, ll b, ll& x, ll& y) const { ll p[] = {a, 1, 0}, q[] = {b, 0, 1}; while (*q) { ll t = *p / *q; for (int i = 0; i < int(3); i++) swap(p[i] -= t * q[i], q[i]); } if (p[0] < 0) for (int i = 0; i < int(3); i++) p[i] = -p[i]; x = p[1], y = p[2]; return p[0]; } ModInt inv() const { ll x, y; extgcd(v, mod, x, y); return make(normS(x + mod)); } ModInt pow(ll p) const { if (p < 0) return inv().pow(-p); ModInt a = 1; ModInt x = *this; while (p) { if (p & 1) a *= x; x *= x; p >>= 1; } return a; } bool operator==(const ModInt& b) const { return v == b.v; } bool operator!=(const ModInt& b) const { return v != b.v; } friend istream& operator>>(istream& o, ModInt& x) { ll tmp; o >> tmp; x = ModInt(tmp); return o; } friend ostream& operator<<(ostream& o, const ModInt& x) { return o << x.v; } }; using mint = ModInt<998244353>; V<mint> fact, ifact; mint Choose(int a, int b) { if (b < 0 || a < b) return 0; return fact[a] * ifact[b] * ifact[a - b]; } void InitFact(int N) { fact.resize(N); ifact.resize(N); fact[0] = 1; for (int i = 1; i <= int(N - 1); i++) fact[i] = fact[i - 1] * i; ifact[N - 1] = fact[N - 1].inv(); for (int i = N - 2; i >= 0; i--) ifact[i] = ifact[i + 1] * (i + 1); } void test() { int N, M; cin >> N >> M; V<mint> f(N + 1); for (int x = int(N) - 1; x >= 0; x--) { void(0); mint sum_pi = 0; V<mint> p(N - x + 1), q(N - x + 1); for (int i = 0; i < int(N - x + 1); i++) { mint pi = 0; mint qi = 0; for (int j = 0; j < int(x + 1); j++) { mint pij = ifact[N + M] * fact[N + M - (i + j) - 1] * M * fact[i + j] * Choose(N - x, i) * Choose(x, j); pi += pij; qi += pij * (i + j + 1); } p[i] = pi, q[i] = qi; void(0); void(0); void(0); sum_pi += pi; } { mint sum = 0; for (int i = 0; i < int(N - x + 1); i++) { sum += q[i]; if (i) sum += p[i] * f[x + i]; } f[x] = sum / (mint(1) - p[0]); } assert(sum_pi == 1); } V<mint> df(N); for (int i = 0; i < int(N); i++) df[i] = f[i] - f[i + 1]; reverse(df.begin(), df.end()); for (int i = int(N) - 1; i >= 0; i--) df[i] /= df[0]; cout << df << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); InitFact(3000000); int N, M; cin >> N >> M; mint ans = 0; for (int i = 0; i < int(N); i++) { if (i == 0) ans += mint(M).inv(); else ans += (mint(M + 1) * (i + 1)).inv(); } ans *= M; ans *= N + M + 1; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; bool f = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48); if (f) x = -x; } template <typename F> inline void write(F x, char ed = n ) { static short st[30]; short tp = 0; if (x < 0) putchar( - ), x = -x; do st[++tp] = x % 10, x /= 10; while (x); while (tp) putchar( 0 | st[tp--]); putchar(ed); } template <typename T> inline void Mx(T &x, T y) { x < y && (x = y); } template <typename T> inline void Mn(T &x, T y) { x > y && (x = y); } const int N = 50005; int a[N], n; long long ask(int l, int r) { cout << ? << l << << r << endl; fflush(stdout); long long t; cin >> t; return t; } int main() { read(n); long long t1 = ask(1, 2), t2 = ask(1, 3), t3 = ask(2, 3); a[3] = t2 - t1, a[2] = t3 - a[3], a[1] = t1 - a[2]; for (int i = 4; i <= n; i++) a[i] = ask(i - 1, i) - a[i - 1]; cout << ! ; for (int i = 1; i <= n; i++) cout << a[i] << ; fflush(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; using i64 = int64_t; using i32 = int32_t; template <class T, class U> void init_n(vector<T>& v, size_t n, U x) { v = vector<T>(n, x); } template <class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); } template <class T> void read_n(vector<T>& v, size_t n, size_t o = 0) { v = vector<T>(n + o); for (size_t i = o; i < n + o; ++i) cin >> v[i]; } template <class T> void read_n(T a[], size_t n, size_t o = 0) { for (size_t i = o; i < n + o; ++i) cin >> a[i]; } template <class T> T gabs(const T& x) { return max(x, -x); } void solve() { int n; cin >> n; vector<int> p(n + 1); vector<int> q(n + 1); for (int i = 1; i <= n; ++i) { cin >> p[i]; q[p[i]] = i; } string res(n, 0 ); res[0] = 1 ; for (int i = 2, l = q[1], r = q[1]; i <= n; ++i) { l = min(l, q[i]); r = max(r, q[i]); if (i == r - l + 1) res[i - 1] = 1 ; } cout << res << n ; } int q; int main() { cin >> q; while (q--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; using lint = long long; using P = pair<int, int>; using vec = vector<int>; using mat = vector<vector<int>>; constexpr int MOD = 1000000007; const int INF = 1 << 30; bool is_prime(int n) { if (n <= 1) return false; for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } vec get_primes() { vec p; for (int i = 2; i <= 1000; i++) { if (is_prime(i)) p.push_back(i); } return p; } int main() { int t; cin >> t; for (int _ = 0; _ < (int)(t); _++) { int n; cin >> n; vec a(n); for (int i = 0; i < (int)(n); i++) cin >> a[i]; auto p = get_primes(); vec c(n, -1); int now = 1; for (auto&& pm : p) { bool f = false; for (int i = 0; i < (int)(n); i++) { if (c[i] == -1) { if (a[i] % pm == 0) c[i] = now, f = true; } } if (f) now++; } int mx = -1; for (int i = 0; i < (int)(n); i++) mx = max(mx, c[i]); cout << mx << n ; for (int i = 0; i < (int)(n); i++) { if (i != 0) cout << ; cout << c[i]; } cout << n ; } return 0; } |
#include <bits/stdc++.h> inline long long rd() { long long _x = 0; int _ch = getchar(), _f = 1; for (; !isdigit(_ch) && (_ch != - ) && (_ch != EOF); _ch = getchar()) ; if (_ch == - ) { _f = 0; _ch = getchar(); } for (; isdigit(_ch); _ch = getchar()) _x = _x * 10 + _ch - 0 ; return _f ? _x : -_x; } void write(long long _x) { if (_x >= 10) write(_x / 10), putchar(_x % 10 + 0 ); else putchar(_x + 0 ); } inline void wrt(long long _x, char _p) { if (_x < 0) putchar( - ), _x = -_x; write(_x); if (_p) putchar(_p); } int Q = 13; int n, cnt, to[1005]; std::vector<int> vt[13]; long long r[13]; int main() { n = rd(); for (int i = 1; i < (1 << Q); i++) if (__builtin_popcount(i) == 6) { cnt++; to[cnt] = i; for (int j = 0; j < Q; j++) if (i & (1 << j)) { vt[j].push_back(cnt); } if (cnt == n) break; } for (int i = 0; i < 13; i++) if (vt[i].size()) { printf( ? %d , (int)vt[i].size()); for (auto j : vt[i]) { printf( %d , j); } printf( n ); fflush(stdout); r[i] = rd(); } printf( ! ); for (int i = 1; i <= n; i++) { long long res = 0; for (int j = 0; j < Q; j++) if (!(to[i] & (1 << j))) { res |= r[j]; } printf( %lld , res); } printf( n ); fflush(stdout); } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int arr = 2e5 + 10; const int ar = 2e3 + 10; const long double pi = acos(-1); const long double eps = 1e-10; const long long md = 1e9 + 7; #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) const int buf_size = 4096; int buf_pos, buf_len; unsigned char buf[buf_size]; inline bool is_eof() { if (buf_pos == buf_len) { buf_pos = 0; buf_len = fread(buf, 1, buf_size, stdin); if (buf_len == 0) { return 1; } } return 0; } inline int get_char() { return is_eof() ? -1 : buf[buf_pos++]; } inline int read_char() { int c = get_char(); while (c != -1 && c <= 32) { c = get_char(); } return c; } inline int read_int() { int x = 0; int c = read_char(); int m = 1; if (c == - ) { m = -1; c = get_char(); } while ( 0 <= c && c <= 9 ) { x = x * 10 + c - 0 ; c = get_char(); } return x * m; } int my_top[arr]; int s[arr]; int t[arr]; int where_go[arr]; int pred[arr]; vector<int> reb[arr]; int pos[arr]; int last_pos = 0; int a[arr]; int n, m; int ans = 0; void foo(int* a, int n, int d) { if (d == 1) { for (int i = 0; i < n; i++) { a[i]++; ans += (a[i] == 1); } } else { for (int i = 0; i < n; i++) { a[i]--; ans -= (a[i] == 0); } } } void dooo(int q, int d) { while (q != -1) { int top = my_top[q]; foo(a + pos[top], pos[q] - pos[top] + 1, d); q = pred[top]; } } void work(int q) { if (q > 0) { if (a[pos[q]] > 0) { ans--; } a[pos[q]] -= md; dooo(pred[q], 1); } else { q = -q; a[pos[q]] += md; if (a[pos[q]] > 0) { ans++; } dooo(pred[q], -1); } } void dfs1(int now, int p = -1) { pred[now] = p; s[now] = 1; for (auto wh : reb[now]) { if (wh != p) { dfs1(wh, now); s[now] += s[wh]; if (where_go[now] == 0 || s[where_go[now]] < s[wh]) { where_go[now] = wh; } } } } void dfs2(int now, int p = -1) { if (!my_top[now]) { my_top[now] = now; } pos[now] = last_pos++; if (where_go[now]) { my_top[where_go[now]] = my_top[now]; dfs2(where_go[now], now); } for (auto wh : reb[now]) { if (wh != p && wh != where_go[now]) { dfs2(wh, now); } } } int main() { n = read_int(); m = read_int(); for (int i = 2; i <= n; i++) { int u; u = read_int(); reb[u].push_back(i); reb[i].push_back(u); } for (int i = 1; i <= n; i++) { t[i] = read_int(); } dfs1(1); dfs2(1); for (int i = 1; i <= n; i++) { a[pos[i]] = -t[i]; } while (m--) { int q; q = read_int(); work(q); cout << ans << ; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = int(1e5) + 10, mod = int(1e9) + 7; const long long inf = (long long)(2e18); int n, q; vector<int> g[N]; int first[N], c[N]; long long t[N], a[N], b[N], add[N]; set<pair<long long, int> > all; multiset<long long> st[N]; set<pair<long long, int> >::iterator it; multiset<long long>::iterator is; long long mn, mx; int p[N], pn; void globaldel(int i) { if (st[i].size() > 0) { it = all.find(make_pair(*st[i].begin() + add[i], i)); if (it != all.end()) all.erase(it); it = all.find(make_pair(*st[i].rbegin() + add[i], i)); if (it != all.end()) all.erase(it); } } void globaladd(int i) { if (st[i].size() > 0) { all.insert(make_pair(*st[i].begin() + add[i], i)); all.insert(make_pair(*st[i].rbegin() + add[i], i)); } } void Del(int i) { globaldel(first[i]); st[first[i]].erase(st[first[i]].find(a[i])); globaladd(first[i]); } void Add(int i) { globaldel(first[i]); st[first[i]].insert(a[i]); globaladd(first[i]); } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; i++) scanf( %I64d , &t[i]); for (int i = 1; i <= n; i++) { scanf( %d , &first[i]); g[first[i]].push_back(i); c[first[i]]++; } for (int i = 1; i <= n; i++) { long long val = t[i] / (c[i] + 2); b[i] = t[i] - (c[i] + 1) * val; a[i] += b[i]; for (int j = 0; j < g[i].size(); j++) { int to = g[i][j]; a[to] += val; } a[first[i]] += val; } for (int i = 1; i <= n; i++) { for (int j = 0; j < g[i].size(); j++) { int to = g[i][j]; st[i].insert(a[to]); } if (st[i].size() > 0) { all.insert(make_pair(*st[i].rbegin(), i)); all.insert(make_pair(*st[i].begin(), i)); } } int tp, i, j; for (int qq = 1; qq <= q; qq++) { scanf( %d , &tp); if (tp == 1) { scanf( %d%d , &i, &j); Del(i); Del(j); Del(first[j]); globaldel(j); a[j] -= b[j]; c[j]++; long long val = t[j] / (c[j] + 2); a[i] += t[j] / (c[j] + 1); ; b[j] = t[j] - (c[j] + 1) * val; a[j] += b[j]; val -= t[j] / (c[j] + 1); a[i] -= add[j]; add[j] += val; a[first[j]] += val; a[j] += t[i] / (c[i] + 2); a[i] += add[first[i]]; Add(j); Add(first[j]); int v = first[i]; Del(v); Del(first[v]); globaldel(v); first[i] = j; a[i] -= t[v] / (c[v] + 2); a[v] -= t[i] / (c[i] + 2); a[v] -= b[v]; c[v]--; val = t[v] / (c[v] + 2); b[v] = t[v] - (c[v] + 1) * val; a[v] += b[v]; val -= t[v] / (c[v] + 3); add[v] += val; a[first[v]] += val; Add(i); Add(v); Add(first[v]); globaladd(j); globaladd(v); } else if (tp == 2) { scanf( %d , &i); printf( %I64d n , a[i] + add[first[i]]); } else { printf( %I64d %I64d n , (*all.begin()).first, (*all.rbegin()).first); } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ask { int l, r, where; } q[210000]; const int mo = 1e9 + 7, N = 1000000; int A[210000], x[210000], pd[1100000], n, m, B[210000], where[1100000], ans[210000]; vector<int> p[1100000]; int quick(int k1, int k2) { int k3 = 1; while (k2) { if (k2 & 1) k3 = 1ll * k3 * k1 % mo; k2 >>= 1; k1 = 1ll * k1 * k1 % mo; } return k3; } int compare(ask k1, ask k2) { return k1.r < k2.r; } void add(int k1, int k2) { if (k1 == 0) return; for (; k1 <= n; k1 += k1 & (-k1)) B[k1] = 1ll * B[k1] * k2 % mo; } int find(int k1) { int ans = 1; for (; k1; k1 -= k1 & (-k1)) ans = 1ll * ans * B[k1] % mo; return ans; } void addin(int k1, int k2) { int w = 1ll * (k1 - 1) * quick(k1, mo - 2) % mo; add(where[k1], quick(w, mo - 2)); add(k2, w); where[k1] = k2; } void insert(int k1) { int w = x[k1]; for (int i = 0; i < p[w].size(); i++) { int k2 = p[w][i]; addin(k2, k1); } } int getans(int L, int R) { return 1ll * A[R] * quick(A[L - 1], mo - 2) % mo * find(R) % mo * quick(find(L - 1), mo - 2) % mo; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &x[i]); scanf( %d , &m); ; A[0] = 1; for (int i = 1; i <= n; i++) A[i] = 1ll * A[i - 1] * x[i] % mo; for (int i = 1; i <= m; i++) { scanf( %d%d , &q[i].l, &q[i].r); q[i].where = i; } sort(q + 1, q + m + 1, compare); for (int i = 1; i <= n; i++) B[i] = 1; for (int i = 2; i <= N; i++) if (pd[i] == 0) for (int j = i; j <= N; j += i) { pd[j] = 1; p[j].push_back(i); } int now = 1; for (int i = 1; i <= n; i++) { insert(i); while (now <= m && q[now].r == i) ans[q[now].where] = getans(q[now].l, q[now].r), now++; } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; using LD = long double; const int MX = 1 << 18 | 3; int N, a[MX], Q; LL sum; int main() { ios::sync_with_stdio(0); cout << fixed << setprecision(10); cin >> N >> Q; for (int i = 0; i < (1 << N); i++) cin >> a[i], sum += a[i]; cout << (LD)sum / (1 << N) << n ; while (Q--) { int u, x; cin >> u >> x; sum = sum - a[u] + x; a[u] = x; cout << (LD)sum / (1 << N) << n ; } return 0; } |
#include <bits/stdc++.h> template <class T> bool read(T &x) { char *s; s = (char *)malloc(10); if (sizeof(x) == 1) strcpy(s + 1, %c ); else if (sizeof(x) == 4) strcpy(s + 1, %d ); else if (sizeof(x) == 8) strcpy(s + 1, %lld ); int k = scanf(s + 1, &x); free(s); return k != -1; } using namespace std; char s[2000000]; int sz1, sz2, len, pos[2000000], neg[2000000]; int main() { scanf( %s , s + 1); len = strlen(s + 1); s[0] = 0 ; for (int i = len; i >= 0; i--) { if (s[i] == 0 ) continue; if (s[i] == 2 ) { s[i - 1]++; continue; } if (s[i] == 1 and i > 0 and s[i - 1] == 1 ) { neg[++sz2] = len - i; s[i - 1]++; continue; } pos[++sz1] = len - i; } cout << sz1 + sz2 << endl; for (int i = 1; i <= sz1; i++) printf( +2^%d n , pos[i]); for (int i = 1; i <= sz2; i++) printf( -2^%d n , neg[i]); } |
#include <bits/stdc++.h> using namespace std; long long quickMod(long long a, long long b, long long c) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % c; b >>= 1; a = a * a % c; } return ans; } long long Euler(long long x) { long long res = x; for (long long i = 2; i * i <= x; i++) { if (x % i == 0) { res = res - res / i; while (x % i == 0) x /= i; } } if (x > 1) res = res - res / x; return res; } int main() { long long c, tmp, ans, phi, result; char b[1000005], n[1000005]; scanf( %s%s%lld , b, n, &c); phi = Euler(c); tmp = 0; for (long long i = 0; b[i]; i++) tmp = (tmp * 10 + b[i] - 0 ) % c; ans = 0; bool flag = false; for (long long i = 0; n[i]; i++) { ans = ans * 10 + n[i] - 0 ; if (ans > phi) { flag = true; ans %= phi; } } if (flag) ans += phi; ans--; if (tmp == 0) tmp = c; result = (((tmp + c - 1) % c) * quickMod(tmp, ans, c)) % c; printf( %lld n , result ? result : c); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = ((ans % m) * (a % m)) % m; b /= 2; a = ((a % m) * (a % m)) % m; } return ans % m; } long long a[10]; long long fac[202]; void factorial() { fac[0] = 1; for (int i = 1; i < 200; i++) { fac[i] = fac[i - 1] * i; fac[i] %= (long long)(1000 * 1000 * 1000 + 7); } } long long c(long long n, long long k) { long long nemo = fac[n]; long long deno = fac[k] * fac[n - k]; deno %= (long long)(1000 * 1000 * 1000 + 7); long long invdeno = pow(deno, (long long)(1000 * 1000 * 1000 + 7) - 2, (long long)(1000 * 1000 * 1000 + 7)); long long pro = nemo * invdeno; pro %= (long long)(1000 * 1000 * 1000 + 7); return pro; } long long dp[105][10]; long long solve(int len, int curnum) { if (len < 0) return 0; if (curnum == 9) { return len >= a[9]; } long long ans = 0; if (dp[len][curnum] != -1) return dp[len][curnum]; if (curnum == 0) { for (int i = a[curnum]; i < len; i++) { ans += solve(len - i, curnum + 1) * c(len - 1, i); ans %= (long long)(1000 * 1000 * 1000 + 7); } } else { for (int i = a[curnum]; i <= len; i++) { ans += solve(len - i, curnum + 1) * c(len, i); ans %= (long long)(1000 * 1000 * 1000 + 7); } } return dp[len][curnum] = (ans % (long long)(1000 * 1000 * 1000 + 7)); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; factorial(); for (int i = 0; i < 10; i++) cin >> a[i]; long long ans = 0; for (int i = 0; i <= n; i++) { if (i >= a[9]) dp[i][9] = 1; else dp[i][9] = 0; } for (int k = 0; k <= n; k++) { for (int j = 8; j >= 0; j--) { if (j != 0) { for (int l = a[j]; l <= k; l++) { dp[k][j] += dp[k - l][j + 1] * c(k, l); dp[k][j] %= (long long)(1000 * 1000 * 1000 + 7); } } else { for (int l = a[j]; l <= k; l++) { dp[k][j] += dp[k - l][j + 1] * c(k - 1, l); dp[k][j] %= (long long)(1000 * 1000 * 1000 + 7); } } } } for (int i = 1; i <= n; i++) { ans += dp[i][0]; ans %= (long long)(1000 * 1000 * 1000 + 7); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-8; const int inf = 0x7FFFFFFF; template <class T> void show(T a, int n) { for (int i = 0; i < n; ++i) cout << a[i] << ; cout << endl; } template <class T> void show(T a, int r, int l) { for (int i = 0; i < r; ++i) show(a[i], l); cout << endl; } int k[7]; int main() { int i, j, ans; int a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; for (i = 0; i < 6; i++) cin >> k[i]; ans = 0; if (a > x) { ans += k[5]; } else if (a < 0) ans += k[4]; if (b > y) ans += k[1]; else if (b < 0) ans += k[0]; if (c > z) ans += k[3]; else if (c < 0) ans += k[2]; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t; cin >> t; while (t--) { long long p, f, s, w, cntS, cntW; cin >> p >> f >> cntS >> cntW >> s >> w; if (s > w) { swap(cntS, cntW); swap(s, w); } long long ans = 0; for (long long i = 0; i <= cntS; i++) { if (i * s > p) break; long long sf = i; long long ss = min(f / s, cntS - i); long long leftf = p - sf * s; long long lefts = f - ss * s; long long wf = min(cntW, leftf / w); long long ws = min(cntW - wf, lefts / w); ans = max(ans, ss + sf + wf + ws); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 9; const int MOD = 1e9 + 7; const int MAXN = 300005; long long N, k, m; long long cook[MAXN], t[MAXN], l[MAXN]; vector<int> ch[MAXN]; int good, bad; template <class T, class Operation = plus<T>> struct SegmentTree { int n; vector<T> st; Operation op; const T identity; T query(int L, int R) { T resl = identity, resr = identity; for (L += n, R += n; L < R; L >>= 1, R >>= 1) { if (L & 1) resl = op(resl, st[L++]); if (R & 1) resr = op(st[--R], resr); } return op(resl, resr); } void update(int p, T val) { for (st[p += n] = val; p > 1; p >>= 1) st[p >> 1] = op(st[p], st[p ^ 1]); } SegmentTree(const vector<T> &A, const T &identity = 0, const Operation &op = Operation()) : n((int)A.size()), st(n << 1), op(op), identity(identity) { copy(A.begin(), A.end(), st.begin() + n); for (int i = n - 1; i > 0; --i) st[i] = this->op(st[i << 1], st[i << 1 | 1]); } }; struct Op { pair<long long, long long> operator()(const pair<long long, long long> &a, const pair<long long, long long> &b) { return pair<long long, long long>(a.first + b.first, a.second + b.second); } }; SegmentTree<pair<long long, long long>, Op> st( vector<pair<long long, long long>>(1000006), pair<long long, long long>(0, 0)); long long calc(int u) { pair<long long, long long> val = st.query(t[u], t[u] + 1); st.update(t[u], st.op(val, pair<long long, long long>(cook[u], cook[u] * t[u]))); long long maxi1 = 0, maxi2 = 0; for (int i = 0; i < (int)ch[u].size(); i++) { if (k - l[ch[u][i]] >= 0) { k -= l[ch[u][i]]; long long chdp = calc(ch[u][i]); if (chdp > maxi1) { maxi2 = maxi1; maxi1 = chdp; } else if (chdp > maxi2) { maxi2 = chdp; } k += l[ch[u][i]]; } } int lo = 0, hi = min(k + 2, (long long)1000004); while (lo + 1 < hi) { int med = lo + (hi - lo) / 2; pair<long long, long long> sum = st.query(0, med); if (sum.second > k) { hi = med; } else { lo = med; } } pair<long long, long long> sum = st.query(0, lo); long long f = sum.first; if (lo > 0) f += min((k - sum.second) / lo, st.st[st.n + lo].first); st.update(t[u], val); if (u == 0) { return max(f, maxi1); } else { return max(f, maxi2); } } int main() { cin >> N >> k; for (int i = 0; i < N; i++) { cin >> cook[i]; } for (int i = 0; i < N; i++) { cin >> t[i]; } for (int i = 1; i < N; i++) { cin >> m >> l[i]; l[i] *= 2; ch[m - 1].push_back(i); } cout << calc(0) << endl; } |
#include <bits/stdc++.h> using namespace std; inline long long mod(long long n, long long m) { long long ret = n % m; if (ret < 0) ret += m; return ret; } long long gcd(long long a, long long b) { return (b == 0LL ? a : gcd(b, a % b)); } long long exp(long long a, long long b, long long m) { if (b == 0LL) return 1LL; if (b == 1LL) return mod(a, m); long long k = mod(exp(a, b / 2, m), m); if (b & 1LL) { return mod(a * mod(k * k, m), m); } else return mod(k * k, m); } const long long N = 150; long long a[N]; long long b[N * N]; long long n, k; long long ok() { long long sum = 0; for (long long i = 1; i <= k; i++) { sum += b[i]; } long long s2 = sum; long long tam = n; for (long long i = k + 1; i <= tam; i++) { s2 -= a[i - k]; s2 += a[i]; if (s2 != sum) return false; } return true; } long long T; long long go(long long n, long long m, long long obj, long long t) { if (n == obj) { T = min(T, t); return t; } if (n > obj) return 1e9; long long has = 1e9; for (long long x = m; x >= 0; x--) { has = min(has, go(n + x + m, m + x, obj, t + 1)); } return has; } void go2(long long n, long long m, long long obj, long long t) { if (n == obj) { return; } for (long long x = m; x >= 0; x--) { if (go(n + x + m, m + x, obj, t + 1) == T) { cout << x << ; go2(n + x + m, m + x, obj, t + 1); return; } } } void solve(long long coisa = 0) { long long n, m; if (coisa == 0) cin >> n; else n = coisa; if (n == 3) { cout << 1 << n ; cout << 1 << n ; return; } long long t = 0; for (long long i = 30; i >= 0; i--) { if (n & (1LL << i)) { t = i; break; } } cout << t << n ; T = t; if (n < 10) { go2(1, 1, n, 0); cout << n ; } else if ((1 << t) == n) { long long has = 1; for (long long x = 1; x <= t; x++) { if (x == 1) cout << 0 << ; else { cout << has << ; has = has + has; } } cout << n ; } else { long long has = 1; long long m = 1; for (long long x = 1; x < t - 1; x++) { cout << has << ; m = m + has + has; has = has + has; } long long op1 = m + has + has; long long has2 = has + has; op1 = op1 + has2; if (n < (op1)) { for (long long x = 1; x <= has; x *= 2) { has2 = has + x; long long m2 = m + has2; if (n - m2 - has2 <= has2 and n - m2 - has2 >= 0) { } else continue; cout << x << ; has += x; m += has; cout << n - m - has << n ; } } else { cout << has << ; has += has; m += has; cout << n - m - has << n ; } } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; cin >> t; while (t--) { solve(); } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.