func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int read(int &x) { return scanf( %d , &x); } int read(long long &x) { return scanf( %lld , &x); } int read(double &x) { return scanf( %lf , &x); } int read(int &x, int &y) { return scanf( %d%d , &x, &y); } int read(long long &x, long long &y) { return scanf( %lld%lld , &x, &y); } int read(double &x, double &y) { return scanf( %lf%lf , &x, &y); } int read(int &x, int &y, int &z) { return scanf( %d%d%d , &x, &y, &z); } int read(long long &x, long long &y, long long &z) { return scanf( %lld%lld%lld , &x, &y, &z); } int read(double &x, double &y, double &z) { return scanf( %lf%lf%lf , &x, &y, &z); } long long qpow(long long a, long long b, long long mod) { if (a == 0) return 0; long long ans = 1; a %= mod; while (b) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b >>= 1; } return ans % mod; } long long inv(long long x, long long mod) { return qpow(x, mod - 2, mod); } int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0}; int mon[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const int N = 5e5 + 5; struct DSU { int f[N]; void init(int n) { for (int i = 0; i <= n; i++) f[i] = i; } int fa(int x) { return f[x] == x ? x : f[x] = fa(f[x]); } void join(int x, int y) { x = fa(x); y = fa(y); if (x != y) f[x] = y; } }; struct CombMath { long long C[2005][2005]; void init(int n) { for (int i = 0; i <= n; i++) C[i][0] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; } }; struct _2sat { vector<int> G[N << 1]; int dfn[N << 1], low[N << 1], stk[N << 1], color[N << 1]; int t, tp, scc; bool vis[N << 1]; void init(int n) { for (int i = 0; i <= 2 * n; i++) G[i].clear(); for (int i = 0; i <= n * 2; i++) dfn[i] = low[i] = color[i] = vis[i] = 0; t = tp = scc = 0; } void add(int x, int xv, int y, int yv) { x = x * 2 + xv; y = y * 2 + yv; G[x ^ 1].push_back(y); G[y ^ 1].push_back(x); } void addmaodun(int x, int xv, int y, int yv) { x = x * 2 + (xv ^ 1); y = y * 2 + (yv ^ 1); G[x ^ 1].push_back(y); G[y ^ 1].push_back(x); } void tarjan(int x) { dfn[x] = low[x] = ++t; stk[++tp] = x; vis[x] = 1; for (auto v : G[x]) { if (!dfn[v]) { tarjan(v); low[x] = min(low[x], low[v]); } else if (vis[v]) low[x] = min(low[x], dfn[v]); } if (low[x] == dfn[x]) { color[x] = ++scc; vis[x] = 0; while (stk[tp] != x) { color[stk[tp]] = scc; vis[stk[tp--]] = 0; } tp--; } } void work(int n) { for (int i = 0; i < 2 * n; i++) if (!dfn[i]) tarjan(i); for (int i = 0; i < n; i++) if (color[i * 2] == color[i * 2 + 1]) { puts( -1 ); return; } vector<int> row, col; for (int i = 0; i < n / 2; i++) { if (color[i * 2] < color[i * 2 + 1]) { continue; } else { row.push_back(i); } } for (int i = n / 2; i < n; i++) { if (color[i * 2] < color[i * 2 + 1]) { continue; } else { col.push_back(i - n / 2); } } int sz = row.size() + col.size(); printf( %d n , sz); for (auto it : row) printf( row %d n , it); for (auto it : col) printf( col %d n , it); } } twosat; char s[N]; int a[2005]; int g[2005][2005]; signed main() { int n; read(n); getchar(); for (int k = 1; k <= 2; k++) { for (int i = 1; i <= n; i++) { gets(s + 1); for (int j = 1; j <= n; j++) { g[i][j] ^= (s[j] - 0 ); } } } twosat.init(2 * n); gets(s + 1); for (int i = 1; i <= n; i++) a[i] = s[i] - 0 ; bool ok = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { int n1 = a[i], n2 = a[j]; int ii = i - 1, jj = j + n - 1; if (g[i][j] == 1) { if (n1 == 1 and n2 == 1) { twosat.addmaodun(ii, 1, jj, 1); twosat.addmaodun(ii, 0, jj, 0); } else if (n2 == 1) { twosat.G[ii * 2].push_back(ii * 2 + 1); } else if (n1 == 1) { twosat.G[jj * 2].push_back(jj * 2 + 1); } else { ok = 0; } } else { if (n1 == 1 and n2 == 1) { twosat.addmaodun(ii, 1, jj, 0); twosat.addmaodun(ii, 0, jj, 1); } else if (n2 == 1) { twosat.G[ii * 2 + 1].push_back(ii * 2); } else if (n1 == 1) { twosat.G[jj * 2 + 1].push_back(jj * 2); } else { continue; } } } } if (!ok) puts( -1 ); else { twosat.work(n * 2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> v; for (int i = 0; i < n; i++) { int num; cin >> num; v.push_back(num); } vector<pair<int, int> > vp; int x, y; for (int i = 0; i < n; i++) { if (i == 0) { x = v[i + 1] - v[i]; y = v[n - 1] - v[i]; } else if (i == n - 1) { x = v[i] - v[i - 1]; y = v[i] - v[0]; } else { x = min(v[i] - v[i - 1], v[i + 1] - v[i]); y = max(v[i] - v[0], v[n - 1] - v[i]); } vp.push_back(make_pair(x, y)); } for (auto &i : vp) { cout << i.first << << i.second << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long INF = 1e18; bool isPrime(long long n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } long long nCr(long long n, long long r) { long long res = 1; if (n < r) return -1; r = min(r, n - r); for (long long i = 0; i < r; i++) { res *= (n - i); res /= (i + 1); } return res; } long long nPr(long long n, long long r) { long long res = 1; if (n < r) return -1; for (long long i = 0; i < r; i++) res *= (n - i); return res; } long long modexp(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x) % mod; x = (x * x) % mod; y = y >> 1; } return res; } void solve() { long long a, b, c; cin >> a >> b >> c; long long d, e, f; f = sqrt(c * a / b); d = sqrt(a * b / c); e = sqrt(b * c / a); cout << 4 * (d + e + f); } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long BIG = 1000000007; const double PI = 3.141592653589793238; template <typename T, typename Q> T max(T a, Q b) { if (a < b) return b; return a; } template <typename T, typename Q> T min(T a, Q b) { if (a > b) return b; return a; } long gcd(long a, long b) { if (b == 0) { return a; } return gcd(b, a % b); } bool check(char arr[8][8], int i) { for (int j = 0; j < 8; j++) { if (arr[i][j] == W ) return false; } return true; } bool check1(char arr[8][8], int i) { for (int j = 0; j < 8; j++) { if (arr[j][i] == W ) return false; } return true; } void solve() { char arr[8][8]; int ans = 0; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> arr[i][j]; if (arr[i][j] == B ) ans++; } } if (ans == 64) { cout << 8 << n ; ; return; } ans = 0; for (int i = 0; i < 8; i++) { if (check(arr, i)) ans++; } for (int i = 0; i < 8; i++) { if (check1(arr, i)) ans++; } cout << ans << n ; ; } int main() { int t; t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = (1e-8); int dcmp(double a, double b) { if (fabs(a - b) <= eps) return 0; return a < b ? -1 : 1; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n, m; double w; cin >> n >> w >> m; double how = n * w / (m * 1.0); vector<vector<pair<int, double> > > res(m); vector<double> bottles; vector<int> cnt(n, 0); for (int i = 0; i < n; i++) bottles.push_back(w); cout << fixed << setprecision(6); for (int i = 0; i < m; i++) { double temp = how; for (int j = 0; j < n; j++) { if (dcmp(bottles[j], 0) == 0) continue; if (dcmp(temp, 0) == 0) break; if (bottles[j] > temp) { res[i].push_back({j, temp}); bottles[j] -= temp; temp = 0; cnt[j]++; break; } else { res[i].push_back({j, bottles[j]}); temp -= bottles[j]; bottles[j] = 0; cnt[j]++; } } if (dcmp(temp, 0) != 0) return cout << NO << endl, 0; } for (int i = 0; i < n; i++) { if (cnt[i] > 2 || dcmp(bottles[i], 0) != 0) return cout << NO << endl, 0; } cout << YES << endl; for (int i = 0; i < m; i++) { for (auto p : res[i]) { cout << p.first + 1 << << p.second << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> v; int main() { v.push_back(0); for (int i = 0; i < int(30); i++) v.push_back(1 << i); while (1) { int hi, lo; int test; string s; cin >> s; if (s == mistake || s == end ) return 0; bool found = 0; for (int i = 0; i < int(30); i++) { cout << ? << v[i] << << v[i + 1] << endl; fflush(stdout); char c; cin >> c; if (c == e ) return 0; if (c == x ) { found = 1; lo = v[i] + 1; hi = v[i + 1]; test = v[i]; break; } } if (!found) { lo = v[v.size() - 1] + 1; hi = 1000000000; test = v[v.size() - 1]; } while (hi - lo > 1) { int mid = (lo + hi) / 2; cout << ? << test << << mid << endl; fflush(stdout); char c; cin >> c; if (c == e ) return 0; if (c == x ) hi = mid; else lo = mid + 1; } cout << ? << test << << lo << endl; fflush(stdout); char c; cin >> c; if (c == e ) return 0; if (c == x ) cout << ! << lo << endl; else cout << ! << hi << endl; } } |
#include <bits/stdc++.h> using namespace std; struct Tree { static const int MAXN = 500010; struct Edge { int son, dis; Edge *pre; void add(int _s, int _d, Edge *_p) { son = _s, dis = _d, pre = _p; } } edge[MAXN << 1], *pos[MAXN]; int sum; void clear() { sum = 0; memset(pos, 0, sizeof(pos)); } void add(int a, int b, int c) { edge[++sum].add(b, c, pos[a]); pos[a] = edge + sum; } } T; const int MAXN = 500010, MAXK = 500010, MAXM = 500010; struct Edge { int from, to, price; } E[MAXK + MAXM]; int n, m, k; void init() { scanf( %d%d%d , &n, &k, &m); for (int i = 1; i <= k + m; ++i) { int u, v, w; scanf( %d%d , &u, &v); if (i <= k) w = -1; else scanf( %d , &w); E[i] = (Edge){u, v, w}; } } struct DisjointSet { static const int MAXN = 500010; int fa[MAXN], n; void clear(int _n) { n = _n; for (int i = 1; i <= n; ++i) fa[i] = i; } int find(int x) { if (fa[x] == x) return x; return fa[x] = find(fa[x]); } bool merge(int u, int v) { int fx = find(u), fy = find(v); if (fx == fy) return false; fa[fx] = fy; return true; } } DS; void buildTree() { DS.clear(n); T.clear(); for (int i = 1; i <= k + m; ++i) if (DS.merge(E[i].from, E[i].to)) { T.add(E[i].from, E[i].to, E[i].price); T.add(E[i].to, E[i].from, E[i].price); } } const int MAXL = 20; int fa[MAXN][MAXL], l2[MAXN], dep[MAXN]; void dfs(int x, int f) { for (int l = 1; l <= l2[dep[x]]; ++l) fa[x][l] = fa[fa[x][l - 1]][l - 1]; for (Tree::Edge *i = T.pos[x]; i; i = i->pre) if (i->son != f) { fa[i->son][0] = x; dep[i->son] = dep[x] + 1; dfs(i->son, x); } } void preset() { l2[0] = -1, l2[1] = 0; for (int i = 2; i <= n; ++i) l2[i] = l2[i >> 1] + 1; memset(fa, 0, sizeof(fa)), dep[1] = 1; dfs(1, 0); } int lca(int u, int v) { if (dep[u] > dep[v]) swap(u, v); for (int l = l2[dep[v] - dep[u]]; l >= 0; --l) if (dep[v] - (1 << l) >= dep[u]) v = fa[v][l]; if (u == v) return u; for (int l = l2[dep[u]]; l >= 0; --l) if (fa[u][l] != fa[v][l]) u = fa[u][l], v = fa[v][l]; return fa[u][0]; } const long long INF = ~0ull >> 3; multiset<int> F[MAXN]; vector<int> ins[MAXN]; long long solve(int x, int f, bool mask) { long long ans = 0; for (Tree::Edge *i = T.pos[x]; i; i = i->pre) if (i->son != f) { long long ret = solve(i->son, x, (i->dis == -1)); if (ret == INF) return INF; ans += ret; if (F[x].size() < F[i->son].size()) F[x].swap(F[i->son]); F[x].insert(F[i->son].begin(), F[i->son].end()); } for (int val : ins[x]) if (val > 0) F[x].insert(val); else F[x].erase(F[x].find(-val)); if (!mask) return ans; if (x > 1 && F[x].empty()) return INF; ans += *F[x].begin(); return ans; } int main() { init(); buildTree(); preset(); for (int i = k + 1; i <= k + m; ++i) { int u = E[i].from, v = E[i].to, w = E[i].price; int z = lca(u, v); if (u != z) ins[u].push_back(w), ins[z].push_back(-w); if (v != z) ins[v].push_back(w), ins[z].push_back(-w); } long long ans = solve(1, 0, false); if (ans == INF) cout << -1 << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1073741824; const int N = 200005; const double PI = 4 * atan(1); set<char> vowel = { A , O , Y , E , U , I , a , o , e , u , y , i }; int dx[] = {1, -1, 0, 0, 1, -1, 1, -1}; int dy[] = {0, 0, 1, -1, 1, 1, -1, -1}; long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; } bool isprime(long long u) { for (long long i = 2; i <= (int)sqrt(u); i++) { if (u % i == 0) return 0; } return 1; } long long mod(long long to_mod) { to_mod %= MOD; while (to_mod < 0) to_mod += MOD; return to_mod % MOD; } long long moduloMultiplication(long long a, long long b, long long mod) { long long res = 0; a %= mod; while (b) { if (b & 1) res = (res + a) % mod; a = (2 * a) % mod; b >>= 1; } return res; } long long power(long long x, long long y) { long long res = 1; x = x; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } long long n, m, k, q, res, x, y, ans; string ch, sh, d; bool ok(string ss, long long len) { string second = ; for (int i = 1; i <= max(n / len, m / len); i++) { second += ss; if (i == n / len) { if (ch != second) return 0; } if (i == m / len) { if (sh != second) return 0; } } return 1; } int main() { cin >> ch; cin >> sh; n = ch.size(); m = sh.size(); k = min(n, m); long long i = 0; d = ; ans = 0; x = 0; while (i < k && ch[i] == sh[i]) { d += ch[i]; x++; if (n % x == 0 && m % x == 0) { if (ok(d, x)) ans++; } i++; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long r = 0, mod = 1e9 + 7, a, b, i, z, x, y; cin >> a >> b; for (i = 1; i < b; ++i) { r += i * a + b * i % mod * (a * (a + 1) / 2 % mod); r %= mod; } cout << r << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int x = 0, y = 0, i, j, count = 0, n; cin >> n; string s1; cin >> s1; for (i = 0; i < n - 1; i++) { x = 0; y = 0; for (j = i; j < s1.size(); j++) { switch (s1[j]) { case U : ++y; break; case D : --y; break; case L : --x; break; case R : ++x; break; } if (x == 0 && y == 0) ++count; } } cout << count; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int m; cin >> m; vector<int> b(m); for (int i = 0; i < m; ++i) { cin >> b[i]; } int M = -1, cur = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (b[j] % a[i]) continue; int x = b[j] / a[i]; if (x > M) { M = x; cur = 1; } else if (x == M) ++cur; } } cout << cur; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); if (m == 3 && n > 4) return puts( -1 ), 0; for (int i = 1; i <= m; i++) printf( %d %d n , i, i * i + 300000); for (int i = 1; i <= n - m; i++) printf( %d %d n , i, -i * i - 300000); } |
#include <bits/stdc++.h> using namespace std; int R; vector<int> hv, use; vector<char> ans; int req[1000005]; int fr[1000005]; int main() { int n; scanf( %d , &n); if (n >= 1389) R = 4; else if (n >= 232) R = 3; else if (n >= 199) R = 2; else if (n >= 2) R = 1; else { printf( a a n ); return 0; } for (int i = 0; i < R; i++) hv.push_back(0); hv.push_back(1); for (int i = R + 1;; i++) { hv.push_back(hv.back() * i / (i - R)); if (hv.back() > n) break; } for (int &u : hv) u--; for (int i = 0; i < 2 * R; i++) hv[i] = 0; for (int i = 1; i <= n; i++) req[i] = 10000005; for (int i = 0; i <= n; i++) fr[i] = -1; for (int i = 1; i <= n; i++) for (unsigned j = 0; j < hv.size(); j++) if (hv[j] <= i) { if (req[i - hv[j]] + j < req[i]) { req[i] = req[i - hv[j]] + j; fr[i] = j; } } else break; n--; for (int i = n; i; i -= hv[fr[i]]) use.push_back(fr[i]); for (unsigned i = 0; i < use.size(); i++) for (int j = 0; j < R; j++) printf( %c , a + i); for (int i = use.size() - 1; i >= 0; i--) for (int j = 2 * R; j < use[i]; j++) printf( %c , a + i); for (unsigned i = 0; i < use.size(); i++) for (int j = 0; j < R; j++) printf( %c , a + i); printf( ); for (unsigned i = 0; i < use.size(); i++) for (int j = 0; j < R; j++) printf( %c , a + i); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000; long long cost[N][10], step[N][10], n; int getMax(int x) { int ret = 0; while (x) { ret = max(ret, int(x % 10)); x /= 10; } return ret; } void init() { for (int i = 0; i < N; i++) { int c = getMax(i); for (int j = 0; j < 10; j++) { int v = max(j, c); if (i < v) { step[i][j] = 1; cost[i][j] = v; } else { step[i][j] = step[i - v][j] + 1; cost[i][j] = cost[i - v][j] + v; } } } } int main() { init(); scanf( %lld , &n); long long ans = 0; while (n >= N) { int j = getMax(n / N); ans += step[n % N][j]; n -= cost[n % N][j]; } while (n > 0) { int j = getMax(n); ans += 1; n -= j; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > v; vector<vector<int> > vv; vector<vector<long long int> > dp; void merg(int x) { if (v[x].size() == 1) return; if (v[x].size() == 2) { vector<int> v1; v1.push_back(0); for (int i = 0; i < v[x * 2].size(); i++) { v1.push_back(v[x * 2][i] + v[x][1]); } v[x] = v1; return; } vector<int> v1 = v[x * 2]; vector<int> v2 = v[x * 2 + 1]; for (int i = 0; i < v1.size(); i++) v1[i] += v[x][1]; for (int i = 0; i < v2.size(); i++) v2[i] += v[x][2]; v[x].resize(1); int idx1 = 0; int idx2 = 0; while (idx1 < v1.size() && idx2 < v2.size()) { if (v1[idx1] < v2[idx2]) { v[x].push_back(v1[idx1]); idx1++; } else { v[x].push_back(v2[idx2]); idx2++; } } while (idx1 != v1.size()) v[x].push_back(v1[idx1++]); while (idx2 != v2.size()) v[x].push_back(v2[idx2++]); } int bs(int a, int h, int l, int r) { if (l == r) return l; int mid = (l + r) / 2; if (v[a][mid] > h) return bs(a, h, l, mid); if (v[a][mid + 1] > h) return mid; return bs(a, h, mid + 1, r); } long long int cal(int a, long long int h) { if (h < 0) return 0; long long int ans = 0; int x = bs(a, h, 0, v[a].size() - 1); ans = h * ((long long int)(x + 1)) - dp[a][x]; return ans; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int n, m; cin >> n >> m; v.resize(n + 3); vv.resize(n + 3); dp.resize(n + 3); for (int i = 1; i <= n; i++) v[i].push_back(0); int x; for (int i = 1; i <= n - 1; i++) { cin >> x; v[(i + 1) / 2].push_back(x); vv[(i + 1) / 2].push_back(x); } for (int i = n; i >= 1; i--) merg(i); for (int i = 1; i <= n; i++) { dp[i].push_back(v[i][0]); for (int j = 1; j < v[i].size(); j++) { dp[i].push_back(((long long int)(v[i][j])) + dp[i][j - 1]); } } for (int i = 0; i < m; i++) { int a, h; cin >> a >> h; long long int ans = 0; ans += cal(a, h); while (a != 1) { if (a % 2 == 0) { a /= 2; if (h - vv[a][0] <= 0) break; ans += h - vv[a][0]; if (vv[a].size() == 2) { h = h - vv[a][0] - vv[a][1]; a = a * 2 + 1; ans += cal(a, h); a /= 2; h += vv[a][1]; } else { h -= vv[a][0]; } } else { a /= 2; if (h - vv[a][1] <= 0) break; ans += h - vv[a][1]; h = h - vv[a][0] - vv[a][1]; a = a * 2; ans += cal(a, h); a /= 2; h += vv[a][0]; } } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, rb, cb, rd, cd; int count = 0; cin >> n >> m >> rb >> cb >> rd >> cd; if (rb <= rd && cb <= cd) cout << min(rd - rb, cd - cb) << endl; else if (rb <= rd && cb > cd) cout << min(rd - rb, 2 * m - cb - cd) << endl; else if (cb <= cd && rb > rd) cout << min(cd - cb, 2 * n - rb - rd) << endl; else cout << min(2 * n - rb - rd, 2 * m - cb - cd) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, q, a[3000000 + 5], m[3000000 + 5], dp[3000000 + 5]; inline long long read() { long long q = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = 0; ch = getchar(); } while (isdigit(ch)) q = (q << 3) + (q << 1) + (ch ^ 48), ch = getchar(); return f ? q : -q; } inline void print(long long x) { if (x < 0) putchar( - ), x = -x; if (x > 9) print(x / 10); putchar(x % 10 + 48); } signed main() { n = read(); for (register long long i = 1; i <= n; ++i) a[i] = read(), ++m[a[i]]; for (register long long i = 1; i <= 3000000; ++i) if (m[i]) for (register long long j = i; j <= 3000000; j += i) dp[j] += m[i] * ((i ^ (j / i)) ? m[j / i] : m[i] - 1); for (register long long i = 1; i <= 3000000; ++i) dp[i] += dp[i - 1]; q = read(); while (q--) { long long x = read(); print(n * (n - 1) - dp[x - 1]), putchar( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) w = -1; for (; isdigit(ch); ch = getchar()) s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; } inline void print(long long x, int op = 10) { if (!x) { putchar( 0 ); if (op) putchar(op); return; } char F[40]; long long tmp = x > 0 ? x : -x; if (x < 0) putchar( - ); int cnt = 0; while (tmp > 0) { F[cnt++] = tmp % 10 + 0 ; tmp /= 10; } while (cnt > 0) putchar(F[--cnt]); if (op) putchar(op); } inline long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; } long long qpow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans *= a; b >>= 1; a *= a; } return ans; } long long qpow(long long a, long long b, long long mod) { long long ans = 1; while (b) { if (b & 1) (ans *= a) %= mod; b >>= 1; (a *= a) %= mod; } return ans % mod; } const int dir[][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; const long long INF64 = 0x3f3f3f3f3f3f3f3f; const int N = 1e6 + 7; struct Node { long long val; int id; bool operator<(const Node& opt) const { return val < opt.val; } }; long long n, m; set<int> st; int p[20]; int solve() { n = read(); int cnt = 0; for (int i = 1; i <= n; ++i) p[i] = read(), cnt += p[i] == 0; st.clear(); st.insert(0); for (int i = 1; i <= n; ++i) { set<int> tmp = st; for (auto& it : st) { int x1 = it - p[i]; int x2 = it + p[i]; cnt += x1 == 0; cnt += x2 == 0; tmp.insert(x1), tmp.insert(x2); } st = tmp; } return cnt; } int main() { int T = read(); for (int _ = 1; _ <= T; ++_) { cout << (solve() ? YES : NO ) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> ostream& operator<<(ostream& _s, vector<T> _t) { for (int i = 0; i < (int)(_t.size()); i++) _s << (i ? : ) << _t[i]; return _s; } template <typename T> istream& operator>>(istream& _s, vector<T>& _t) { for (int i = 0; i < (int)(_t.size()); i++) _s >> _t[i]; return _s; } template <typename T, typename U> ostream& operator<<(ostream& _s, pair<T, U> _t) { _s << ( << _t.first << , << _t.second << ) ; return _s; } template <typename T, typename U> istream& operator>>(istream& _s, pair<T, U>& _t) { _s >> _t.first >> _t.second; return _s; } int find(const vector<int>& v, int value, int fr, int to) { for (int i = fr; i < (int)(to + 1); i++) { if (v[i] == value) { return i; } } assert(false); } vector<int> invert(const vector<int>& v) { vector<int> res(v.size()); for (int i = 0; i < (int)(v.size()); i++) { res[v[i]] = i; } return res; } int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> p(n); cin >> p; for (int i = 0; i < (int)(n); i++) p[i]--; bool is_id = true; for (int i = 0; i < (int)(n); i++) { if (p[i] != i) is_id = false; } string base_s; for (int j = 0; j < (int)(n); j++) base_s += . ; vector<string> res(n); for (int i = 0; i < (int)(n); i++) res[i] = base_s; if (is_id) { cout << n << endl; for (int i = 0; i < (int)(n); i++) { cout << base_s << endl; } return 0; } p = invert(p); int fr = 0, to = n - 1; for (int row = 0; row < (int)(n); row++) { if (row == 0) { int mid = n / 2; int pos = find(p, mid, fr, to); for (int i = fr; i < (int)(pos + 1); i++) { res[row][i] = ; } for (int i = (pos)-1; i >= (int)(fr); i--) { p[i + 1] = p[i]; } p[fr] = -1; } else { bool left = row % 2 == 1; int free_pos = left ? fr : to; assert(p[free_pos] == -1); int pos = find(p, free_pos, fr, to); if (left) { res[row][fr] = / ; for (int i = pos; i < (int)(to + 1); i++) { res[row][i] = / ; } for (int i = pos; i < (int)(to); i++) { p[i] = p[i + 1]; } p[to] = -1; fr++; } else { res[row][to] = ; for (int i = fr; i < (int)(pos + 1); i++) { res[row][i] = ; } for (int i = (pos)-1; i >= (int)(fr); i--) { p[i + 1] = p[i]; } p[fr] = -1; to--; } } } cout << (n - 1) << endl; for (int i = 0; i < (int)(n); i++) { cout << res[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:16777216 ) const int inf = 0x3f3f3f3f; const long double pi = acos(-1.0); const string debug_line = yolo ; const double PI = 4 * atan(1); long long dp[81][81]; bool visited[81][81]; vector<pair<int, int> > Adj[81]; int n; vector<pair<pair<int, int>, string> > edge; bool check(int l, int r, int l1, int r1, int index1, int index2) { for (auto &(t1) : (Adj[index1])) { int op = t1.first; if (op == 0) { if (t1.second != index2 && t1.second != index1) { return false; } } else if (op == 2) { if (t1.second <= l1 || t1.second >= r1) { return false; } } else if (op == 1) { if (t1.second > l && t1.second < r) { return false; } } else if (op == 3) { if (!(t1.second > l && t1.second < r)) { return false; } } else if (op == 4) { if (!(t1.second <= l1 || t1.second >= r1)) { return false; } } } for (auto &(t1) : (Adj[index2])) { int op = t1.first; if (op == 0) { if (t1.second != index1 && t1.second != index2) { return false; } } else if (op == 2) { if (t1.second <= l1 || t1.second >= r1) { return false; } } else if (op == 1) { if (t1.second > l && t1.second < r) { return false; } } else if (op == 3) { if (!(t1.second > l && t1.second < r)) { return false; } } else if (op == 4) { if (!(t1.second <= l1 || t1.second >= r1)) { return false; } } } return true; } int main() { int k; scanf( %d%d , &n, &k); for (int(i) = (0); (i) < (k); ++(i)) { int a, b; string c; cin >> a >> c >> b; edge.push_back(make_pair(make_pair(a, b), c)); if (c == = ) { Adj[a].push_back(make_pair(0, b)); Adj[b].push_back(make_pair(0, a)); } else if (c == > ) { Adj[a].push_back(make_pair(1, b)); Adj[b].push_back(make_pair(2, a)); } else if (c == < ) { Adj[a].push_back(make_pair(2, b)); Adj[b].push_back(make_pair(1, a)); } else if (c == <= ) { Adj[a].push_back(make_pair(3, b)); Adj[b].push_back(make_pair(4, a)); } else if (c == >= ) { Adj[a].push_back(make_pair(4, b)); Adj[b].push_back(make_pair(3, a)); } } dp[0][2 * n + 1] = 1LL; priority_queue<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int> >, greater<pair<pair<int, int>, int> > > Q1; Q1.push(make_pair(make_pair(0, 0), 2 * n + 1)); while (!Q1.empty()) { pair<pair<int, int>, int> t1 = Q1.top(); Q1.pop(); int l = t1.first.second; int r = t1.second; int d = t1.first.first; visited[l][r] = true; int valueNext = (l + 2 * n + 1 - r) / 2; if (l + 3 == r) { if (check(l, r, l + 1, r - 1, l + 1, r - 1)) { dp[l + 1][r - 1] = (dp[l + 1][r - 1] + dp[l][r]); } else { } continue; } else { if (check(l, r, l + 2, r, l + 1, l + 2)) { dp[l + 2][r] = (dp[l + 2][r] + dp[l][r]); if (!visited[l + 2][r]) { Q1.push(make_pair(make_pair(d + 1, l + 2), r)); visited[l + 2][r] = true; } } else { } if (check(l, r, l + 1, r - 1, l + 1, r - 1)) { dp[l + 1][r - 1] = (dp[l + 1][r - 1] + dp[l][r]); if (!visited[l + 1][r - 1]) { Q1.push(make_pair(make_pair(d + 1, l + 1), r - 1)); visited[l + 1][r - 1] = true; } } else { } if (check(l, r, l, r - 2, r - 1, r - 2)) { dp[l][r - 2] = (dp[l][r - 2] + dp[l][r]); if (!visited[l][r - 2]) { Q1.push(make_pair(make_pair(d + 1, l), r - 2)); visited[l][r - 2] = true; } } else { } } } long long answer1 = 0; for (int(i) = (0); (i) < (2 * n + 1); ++(i)) { answer1 = (answer1 + dp[i][i + 1]); } printf( %lld n , answer1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, k, q, w, x, y, flag = 0, sum = 0; char c; while (true) { c = getchar(); if (c == n ) break; sum = sum * 10 + int(c - 0 ); q = sum / 2; sum = sum % 2; } if (sum == 1 || q % 2 == 1) cout << 0 n ; else cout << 4 n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 5; int deg[N]; vector<int> adj[N]; int e[N][3]; int seen[N]; int dfs(int u) { seen[u] = true; if (deg[u] == 1) return u; for (int i = 0; i < adj[u].size(); i++) if (!seen[adj[u][i]]) return dfs(adj[u][i]); } int main() { int n; cin >> n; if (n == 2) { int x; cin >> x >> x >> x; cout << YES n ; cout << 2 << n ; cout << 1 2 13 n ; cout << 1 2 << x - 13; return 0; } if (n == 3) { cout << NO n ; return 0; } for (int i = 0; i < n - 1; i++) { int u, v, val; cin >> u >> v >> val; u--, v--; deg[u]++; deg[v]++; adj[u].push_back(v); adj[v].push_back(u); e[i][0] = u; e[i][1] = v; e[i][2] = val; } for (int i = 0; i < n; i++) if (deg[i] == 2) { cout << NO n ; return 0; } vector<pair<int, pair<int, int>>> ans; for (int i = 0; i < n - 1; i++) { int u, v, val; u = e[i][0]; v = e[i][1]; val = e[i][2]; if (deg[u] == 1 || deg[v] == 1) { if (deg[v] == 1) swap(u, v); int w, z; memset(seen, 0, sizeof seen); seen[v] = true; vector<int> adj_temp; for (int i = 0; adj_temp.size() < 2; i++) if (adj[v][i] != u) adj_temp.push_back(adj[v][i]); w = dfs(adj_temp[0]); z = dfs(adj_temp[1]); u++, w++, z++; ans.push_back({u, {w, val / 2}}); ans.push_back({w, {z, -val / 2}}); ans.push_back({u, {z, val / 2}}); } else { int x, y, w, z; vector<int> u_adj, v_adj; for (int i = 0; u_adj.size() < 2; i++) if (adj[u][i] != v) u_adj.push_back(adj[u][i]); for (int i = 0; v_adj.size() < 2; i++) if (adj[v][i] != u) v_adj.push_back(adj[v][i]); memset(seen, 0, sizeof seen); seen[v] = seen[u] = true; x = dfs(u_adj[0]); y = dfs(u_adj[1]); w = dfs(v_adj[0]); z = dfs(v_adj[1]); x++, y++, w++, z++; ans.push_back({x, {w, val / 2}}); ans.push_back({x, {y, -val / 2}}); ans.push_back({w, {z, -val / 2}}); ans.push_back({y, {z, val / 2}}); } } cout << YES n ; cout << ans.size() << n ; for (int i = 0; i < ans.size(); i++) cout << ans[i].first << << ans[i].second.first << << ans[i].second.second << n ; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (a == 0) return b; if (b == 0) return a; return gcd(b % a, a); } long long int my_pow(long long int a, long long int b) { if (b == 0) return 1; if (b == 1) return a; long long int half = my_pow(a, b / 2); long long int ans = (half * half); if (b % 2) { ans = (ans * a); } return ans; } long long int my_pow_mod_p(long long int a, long long int b, long long int p) { if (b == 0) return 1; if (b == 1) return a % p; long long int half = my_pow(a, b / 2); long long int ans = (half * half) % p; if (b % 2) { ans = (ans * a) % p; } return ans; } class combinatorics { long long int N; long long int p; vector<long long int> fact; void cal() { fact[0] = 1; fact[1] = 1; for (long long int i = 2; i < N; i++) { fact[i] = (i * fact[i - 1]) % 1000000007; } } public: combinatorics(long long int n1, long long int p1) { p = p1; N = max(n1, 2LL); fact.resize(N); cal(); } long long int nPr(long long int n, long long int r) { if (n < r) { return 0; } long long int val = (fact[n] * my_pow_mod_p(fact[n - r], p - 2, p)) % p; return val; } long long int nCr(long long int n, long long int r) { if (n < r) { return 0; } long long int val = nPr(n, r); val = (val * my_pow_mod_p(fact[r], p - 2, p)) % p; return val; } long long int get_fact(long long int n) { return fact[n]; } }; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; string str1, str2; cin >> str1; cin >> str2; long long int len1 = str1.length(); long long int len2 = str2.length(); vector<vector<long long int> > V(len2, vector<long long int>()); map<char, vector<long long int> > M; for (long long int i = 0; i < len2; i++) { char curr_char = str2[i]; if (M.find(curr_char) == M.end()) { M[curr_char] = vector<long long int>(); } M[curr_char].push_back(i); } for (long long int i = 0; i < len1; i++) { char curr_char = str1[i]; if (M.find(curr_char) != M.end()) { long long int len = M[curr_char].size(); for (long long int j = 0; j < len; j++) { V[M[curr_char][j]].push_back(i); } } } for (int i = len2 - 2; i >= 0; --i) { while (1) { long long int last_len = V[i + 1].size(); long long int len = V[i].size(); if (V[i][len - 1] >= V[i + 1][last_len - 1]) { V[i].pop_back(); } else { break; } } } vector<long long int> min_A; long long int last_val = V[0][0]; min_A.push_back(V[0][0]); for (long long int i = 1; i < len2; i++) { long long int next_idx = upper_bound(V[i].begin(), V[i].end(), last_val) - V[i].begin(); long long int next_val = V[i][next_idx]; min_A.push_back(next_val); last_val = next_val; } long long int ans = V[0][V[0].size() - 1]; for (long long int i = 0; i < len2 - 1; i++) { long long int next_s = V[i + 1].size(); ans = max(ans, V[i + 1][next_s - 1] - min_A[i] - 1); } ans = max(ans, len1 - min_A[len2 - 1] - 1); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<ll, ll>; const ll MOD = 1e9 + 7, N = 2e5 + 10; vector<ll> g[N]; ll vis[N]; ll n, m, k; void bfs(ll s, vector<ll> &dist) { for (ll i = 1; i < n + 1; i++) { vis[i] = 0; } dist[s] = 0; queue<pii> q; q.push({s, 0}); while (!q.empty()) { ll nd = q.front().first, st = q.front().second; q.pop(); if (vis[nd]) continue; vis[nd] = 1; dist[nd] = min(dist[nd], st); for (auto &v : g[nd]) { q.push({v, st + 1}); } } } int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> k; vector<ll> spec; spec.assign(k, 0); for (ll i = 0; i < k; i++) { cin >> spec[i]; } ll u, v; for (ll i = 0; i < m; i++) { cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } vector<ll> dist_src(n + 2, INT_MAX), dist_dest(n + 2, INT_MAX); bfs(1, dist_src); bfs(n, dist_dest); vector<pii> tmp; for (auto &i : spec) { tmp.push_back({dist_dest[i] - dist_src[i], i}); } sort(tmp.begin(), tmp.end()); ll ans = 0; for (ll i = 1; i < k; i++) { ll a = tmp[i - 1].second, b = tmp[i].second; ll path = min(dist_src[a] + dist_dest[b] + 1, dist_src[b] + dist_dest[a] + 1); if (path >= dist_src[n]) { cout << dist_src[n] << n ; return 0; } ans = max(ans, path); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int str2int(string s) { istringstream ss(s); int t; ss >> t; return t; } int main() { string s; cin >> s; int ans = -1; for (int i = 1; i < s.length(); i++) { string s1 = s.substr(0, i); if (s1.length() > 1 && s1[0] == 0 ) continue; int t1 = str2int(s1); if (t1 > 1000000) continue; for (int j = 1; j < s.length(); j++) { if (i + j >= s.length()) continue; string s2 = s.substr(i, j); string s3 = s.substr(i + j); if (s2.length() > 1 && s2[0] == 0 ) continue; if (s3.length() > 1 && s3[0] == 0 ) continue; int t2 = str2int(s2); int t3 = str2int(s3); if (t2 > 1000000) continue; if (t3 > 1000000) continue; int temp = t1 + t2 + t3; if (temp > ans) ans = temp; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; inline int calc(int x, int y, char c) { if (c == & ) return x & y; if (c == | ) return x | y; return x ^ y; } int work() { char c; scanf( %c , &c); if (c == ( ) { int l = work(); char op; scanf( %c , &op); int r = work(), res = 0; scanf( %*c ); for (int i = 0; i < 4; i++) { if (!(l & (1 << i))) continue; for (int j = 0; j < 4; j++) { if (!(r & (1 << j))) continue; res |= 1 << calc(i, j, op); } } return res; } if (c == ? ) return 6; return c == 0 ? 1 : 8; } int main() { scanf( %*d n ); puts(work() & 6 ? YES : NO ); return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; const long double pi = acos(-1.0); const long double eps = 1e-5; const int INF = 0x3f3f3f3f; const long long INFLL = 0x3f3f3f3f3f3f3f3f; int a[300010]; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int T; cin >> T; while (T--) { int n; cin >> n; map<int, int> l; map<int, int> r; for (int i = (1); i <= (n); i++) { cin >> a[i]; if (!l[a[i]]) l[a[i]] = i; r[a[i]] = i; } int ans = l.size(); int p = 0; int cnt = 0; int res = 0; for (auto it : l) { if (p < it.second) cnt++; else cnt = 1; p = r[it.first]; res = max(res, cnt); } cout << ans - res << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007LL; long long large = 2000000000000000000LL; int main() { int n, m; cin >> n >> m; vector<vector<int> > adj(n, vector<int>()); set<pair<int, int> > s; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; x--; y--; if (x > y) swap(x, y); s.insert(pair<int, int>(x, y)); adj[x].push_back(y); adj[y].push_back(x); } int u = -1, v = -1; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (s.find(pair<int, int>(i, j)) == s.end()) { u = i; v = j; break; } } } if (u == -1) { cout << NO << endl; return 0; } cout << YES << endl; vector<vector<int> > adjt(n, vector<int>()); for (int i = 0; i < n; i++) { int f = i; if (f == v) f = u; for (int j = 0; j < (int)adj[i].size(); j++) { int to = adj[i][j]; if (to == v) to = u; adjt[f].push_back(to); } } queue<int> q; q.push(u); vector<int> dis(n, -1); dis[u] = 0; while (!q.empty()) { int u = q.front(); q.pop(); for (int j = 0; j < (int)adjt[u].size(); j++) { int v = adjt[u][j]; if (dis[v] == -1) { dis[v] = dis[u] + 1; q.push(v); } } } vector<pair<int, int> > e; for (int i = 0; i < n; i++) { if (i != v) e.push_back(pair<int, int>(dis[i], i)); } sort(e.begin(), e.end()); vector<int> a(n, -1); for (int i = 0; i < (int)e.size(); i++) a[e[i].second] = n - 2 - i; a[v] = n - 1; for (int i = 0; i < n; i++) printf( %d , a[i] + 1); printf( n ); a[v] = n - 2; for (int i = 0; i < n; i++) printf( %d , a[i] + 1); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; typedef long long arr64[200020]; int n, tn, tS, qS = 1; pair<int, long long> pr[200020]; arr64 pX, pY, K, B; int main() { long long s; scanf( %d%I64d , &n, &s); for (int i = 1; i <= n; i++) scanf( %d%d , &pr[i].first, &pr[i].second); sort(pr + 1, pr + n + 1); pr[++n] = make_pair((int)1e9, s); for (int i = 1; i <= n; i++) if (i == 1 || pr[i].first > pr[i - 1].first) { while (tn > 0 && pr[i].second <= pr[tn].second) tn--; pr[++tn] = pr[i]; } K[tS = 1] = pr[1].first; for (int i = 2; i <= tn; i++) { qS = min(qS, tS); while (qS < tS && (((pr[i].second - B[qS + 1]) / (K[qS + 1]) + ((pr[i].second - B[qS + 1]) % (K[qS + 1]) != 0)) < ((pr[i].second - B[qS]) / (K[qS]) + ((pr[i].second - B[qS]) % (K[qS]) != 0)) || ((pr[i].second - B[qS + 1]) / (K[qS + 1]) + ((pr[i].second - B[qS + 1]) % (K[qS + 1]) != 0)) == ((pr[i].second - B[qS]) / (K[qS]) + ((pr[i].second - B[qS]) % (K[qS]) != 0)) && (K[qS + 1] * ((pr[i].second - B[qS + 1]) / (K[qS + 1]) + ((pr[i].second - B[qS + 1]) % (K[qS + 1]) != 0)) + B[qS + 1] - pr[i].second) >= (K[qS] * ((pr[i].second - B[qS]) / (K[qS]) + ((pr[i].second - B[qS]) % (K[qS]) != 0)) + B[qS] - pr[i].second))) qS++; long long cX = ((pr[i].second - B[qS]) / (K[qS]) + ((pr[i].second - B[qS]) % (K[qS]) != 0)), cK = pr[i].first; long long cY = (K[qS] * ((pr[i].second - B[qS]) / (K[qS]) + ((pr[i].second - B[qS]) % (K[qS]) != 0)) + B[qS] - pr[i].second), cB = cY - cK * cX; if (i == tn) printf( %I64d n , cX); while (tS > 1 && cK * pX[tS - 1] + cB >= pY[tS - 1]) tS--; K[++tS] = cK, B[tS] = cB; pX[tS - 1] = (((B[tS - 1] - B[tS])) / ((K[tS] - K[tS - 1])) + (((B[tS - 1] - B[tS])) % ((K[tS] - K[tS - 1])) != 0)); pY[tS - 1] = cK * pX[tS - 1] + cB; } } |
#include <bits/stdc++.h> using namespace std; const long long int N = 200010; const long long mod = 1000000007; const long long inf = 1000000000000000000; const long double pi = 3.14159265358979323846264338; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; vector<long long int> a(n); for (long long int i = 0; i < n; i++) { cin >> a[i]; } sort((a).begin(), (a).end()); long long int ans = 0, cnt = 1; for (long long int i = 0; i < n; i++) { if (a[i] >= cnt) ans++, cnt++; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T sqr(T x) { return x * x; } template <typename T> T abs(T x) { return x < 0 ? -x : x; } template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } const int MOD = (int)1e+9 + 7; int n; vector<pair<int, int> > a; vector<int> f; int powmod(const int a, const int b) { if (b == 0) { return 1; } long long r = powmod(a, b >> 1); (r *= r) %= MOD; return b & 1 ? r * a % MOD : r; } int divmod(const int a, const int b) { return a * (long long)powmod(b, MOD - 2) % MOD; } int C(int n, int m) { return divmod(divmod(f[n], f[m]), f[n - m]); } int main(int argc, char **argv) { ios_base::sync_with_stdio(false); cin >> n; f.resize(n + 1); f[0] = 1; for (int i = 1; i <= n; ++i) { f[i] = f[i - 1] * (long long)i % MOD; } for (int i = 1; i <= n; ++i) { int x; cin >> x; if (x) { a.push_back(make_pair(x, i)); } } sort(a.begin(), a.end()); if (a.size() == 0) { cout << powmod(2, n - 1) << endl; return 0; } int ans = 0; for (int d = -1; d <= 1; d += 2) { int l = a[0].second + d * (a[0].first - 1), r = a[0].second; if (l > r) { swap(l, r); } if (l < 1 || n < r || (l == r && d == 1)) { continue; } long long res = 1; for (size_t i = 1; i < a.size(); ++i) { bool f = false; for (int j = -1; j <= 1; j += 2) { int L = a[i].second + j * (a[i].first - 1), R = a[i].second + j; if (L > R) { swap(L, R); } if (L < 1 || n < R || R < r || l < L) { continue; } (res *= C(l - L + R - r, l - L)) %= MOD; f = true; l = L; r = R; if (r < a[i].second) { ++r; } else { --l; } break; } if (!f) { res = 0; break; } } if (res) { int L = 1, R = n; (res *= C(l - L + R - r, l - L)) %= MOD; } (ans += res) %= MOD; } if (a[0].first > 1) { ans = ans * (long long)powmod(2, a[0].first - 2) % MOD; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int N = 110; struct T { int bits; int x; int k; }; bool cmp(const T& a, const T& b) { return a.k < b.k; } T a[N]; long long dp[(1 << 20) + 4]; int n, m; long long b; long long Ans() { const long long INF = 1LL << 60; long long res = 0; long long ans = INF; int top = 1 << m; for (int i = 0; i < top; ++i) dp[i] = 1LL << 60; dp[0] = 0; res = a[0].k * b; dp[a[0].bits] = a[0].x; ans = min(ans, dp[top - 1] + res); for (int i = 1; i < n; ++i) { res = a[i].k * b; int& bits = a[i].bits; for (int j = top - 1; j >= 0; --j) if (dp[j] != INF) { dp[j | bits] = min(dp[j | bits], dp[j] + a[i].x); } ans = min(ans, dp[top - 1] + res); } if (ans == INF) ans = -1; return ans; } int main() { ios::sync_with_stdio(false); cin >> n >> m >> b; int s, t; for (int i = 0; i < n; ++i) { cin >> a[i].x >> a[i].k >> s; a[i].bits = 0; for (int j = 0; j < s; ++j) { cin >> t; a[i].bits |= 1 << (t - 1); } } sort(a, a + n, cmp); cout << Ans() << endl; } |
#include <bits/stdc++.h> using namespace std; long long n, a, b; int main() { cin >> n >> a >> b; for (long long tx = 0; tx <= n; tx += a) { if ((n - tx) % b == 0) { cout << YES << endl << tx / a << << (n - tx) / b << endl; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; char str[100010]; int dp[26][100010]; int maxP[260][260][260]; int len[3]; int idx[3]; char desc[3][260]; int get(int rel) { int m = maxP[idx[0] - (rel == 0)][idx[1] - (rel == 1)][idx[2] - (rel == 2)]; if (m == 100010) return 100010; return dp[desc[rel][idx[rel] - 1] - a ][m]; } int main(void) { setbuf(stdout, 0); int N, Q; cin >> N >> Q; cin >> str; for (int i = 0; i < 26; i++) dp[i][N] = 100010; for (int i = 0; i < N; i++) { for (int j = 0; j < 26; j++) { if (str[N - 1 - i] == a + j) dp[j][N - 1 - i] = N - i; else dp[j][N - 1 - i] = dp[j][N - i]; } } for (int q = 0; q < Q; q++) { char o, c; int i; cin >> o >> i; i--; if (o == + ) { cin >> c; desc[i][len[i]++] = c; idx[i] = len[i]; if (i == 0) { for (int j = 0; j <= len[1]; j++) { idx[1] = j; for (int k = 0; k <= len[2]; k++) { idx[2] = k; maxP[len[0]][j][k] = get(i); if (j) maxP[len[0]][j][k] = min(maxP[len[0]][j][k], get(1)); if (k) maxP[len[0]][j][k] = min(maxP[len[0]][j][k], get(2)); } } } if (i == 1) { for (int j = 0; j <= len[0]; j++) { idx[0] = j; for (int k = 0; k <= len[2]; k++) { idx[2] = k; maxP[j][len[1]][k] = get(i); if (j) maxP[j][len[1]][k] = min(maxP[j][len[1]][k], get(0)); if (k) maxP[j][len[1]][k] = min(maxP[j][len[1]][k], get(2)); } } } if (i == 2) { for (int j = 0; j <= len[0]; j++) { idx[0] = j; for (int k = 0; k <= len[1]; k++) { idx[1] = k; maxP[j][k][len[2]] = get(i); if (j) maxP[j][k][len[2]] = min(maxP[j][k][len[2]], get(0)); if (k) maxP[j][k][len[2]] = min(maxP[j][k][len[2]], get(1)); } } } } else len[i]--; cout << (maxP[len[0]][len[1]][len[2]] < 100010 ? YES n : NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void task(); int main() { task(); return 0; } const int N = (int)1e5 + 10; const int MODULO = (int)1e9 + 3; const long long int INF = (long long int)1e18; const int BUF_SIZE = (int)1e5 + 10; bool used[110]; int n, k; int a[110], b[110]; long long int cat[110][110]; void comp_cat() { cat[0][0] = 0; for (int i = 1; i < 101; ++i) { cat[i][0] = cat[i][i] = 1; for (int j = 1; j < i; ++j) { cat[i][j] = cat[i - 1][j - 1] + cat[i - 1][j]; } } } void task() { scanf( %d %d , &n, &k); int cnt = n / k; for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); double ansmin = 100500, ansmax = -1; int q; scanf( %d , &q); while (q--) { for (int i = 0; i < cnt; ++i) scanf( %d , &b[i]); int sum = 0; if (used[b[0]]) { continue; } for (int i = 0; i < cnt; ++i) { sum += a[b[i]]; used[b[i]] = 1; } ansmin = min(ansmin, (double)sum / cnt); ansmax = max(ansmax, (double)sum / cnt); } vector<int> v; for (int i = 1; i <= n; ++i) if (!used[i]) v.push_back(a[i]); sort(v.begin(), v.end()); int sz = v.size(); (void(1)); if (sz > n % k) { int sum = 0; for (int i = 0; i < cnt; ++i) { sum += v[i]; } ansmin = min(ansmin, (double)sum / cnt); sum = 0; for (int i = sz - 1; i >= sz - cnt; --i) { sum += v[i]; } ansmax = max(ansmax, (double)sum / cnt); } printf( %.10f %.10f , ansmin, ansmax); } |
#include <bits/stdc++.h> using namespace std; const long long inf = INT_MAX, df = 3e5 + 7; long long i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, dp[df], pos[df], a[df]; inline long long read() { long long x = 0, y = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) y = (ch == - ) ? -1 : 1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return x * y; } bool chk(long long x) { dp[1] = 0; for (long long i = (2); i <= (n); ++i) { dp[i] = dp[i - 1]; if (dp[i - 1] >= pos[i] - 1) dp[i] = max(dp[i], pos[i] + x); if (dp[i - 1] >= pos[i] - x - 1) dp[i] = max(dp[i], pos[i]); if (dp[i - 2] >= pos[i] - x - 1 && i > 2) dp[i] = max(dp[i], pos[i - 1] + x); } if (dp[n] >= m - x - 1) return 1; dp[2] = max(pos[2], x); for (long long i = (3); i <= (n); ++i) { dp[i] = dp[i - 1]; if (dp[i - 1] >= pos[i] - 1) dp[i] = max(dp[i], pos[i] + x); if (dp[i - 1] >= pos[i] - x - 1) dp[i] = max(dp[i], pos[i]); if (dp[i - 2] >= pos[i] - x - 1) dp[i] = max(dp[i], pos[i - 1] + x); } if (dp[n] >= min(m - 1, m + pos[2] - x - 1)) return 1; return 0; } int main() { m = read(); n = read(); long long now = 1; for (long long i = (1); i <= (n); ++i) a[i] = read(), a[i + n] = a[i] + m; if (n == 1) { return printf( %lld n , m - 1), 0; } for (long long i = (2); i <= (n); ++i) if (a[now + 1] - a[now] < a[i + 1] - a[i]) now = i; long long le = 0, rig = a[now + 1] - a[now] - 1, mid = 0, ans = 0; for (long long i = (1); i <= (n); ++i) pos[i] = a[i + now]; long long cur = pos[1]; for (long long i = (1); i <= (n); ++i) pos[i] -= cur; while (le <= rig) { mid = (le + rig) >> 1; if (chk(mid)) ans = mid, rig = mid - 1; else le = mid + 1; } return printf( %lld n , ans), 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; } template <class T> bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; } const long long mod = 1e9 + 7, N = 2e5 + 5; inline long long msb(long long val) { return sizeof(long long) * 8 - __builtin_clzll(val) - 1; } long long a[N], n, m, k; vector<pair<long long, long long> > edges[N]; bool check(long long a) { while (a > 0) { if (a % 10 != 4 && a % 10 != 7) return false; a /= 10; } return true; } struct des { vector<long long> p, rnk, sz; void init() { p.assign(n + 1, 0); rnk.assign(n + 1, 0); sz.assign(n + 1, 1); for (long long i = 0; i < n; i++) p[i] = i; } long long par(long long u) { if (p[u] == u) return u; else return p[u] = par(p[u]); } bool issame(long long u, long long v) { return (par(u) == par(v)); } void merge(long long u, long long v) { u = par(u); v = par(v); if (u == v) return; if (rnk[u] > rnk[v]) { p[v] = u; sz[u] += sz[v]; rnk[u]++; } else { p[u] = v; sz[v] += sz[u]; rnk[v]++; } } long long get_size(long long u) { return sz[par(u)]; } } d; void solve(long long test_case) { long long i, j; cin >> n; d.init(); for (i = 1; i < n; i++) { long long u, v, w; cin >> u >> v >> w; if (!check(w)) d.merge(u, v); } long long ans = 0; for (i = 1; i <= n; i++) { long long t = n - d.get_size(i); ans += t * (t - 1); } cout << ans << n ; return; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; solve(1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 123456; int n, d[N], h[N]; bool vis[N]; vector<int> G[N]; struct Node { int u, h; bool operator<(const Node& rhs) const { return h < rhs.h; } Node(int u, int h) : u(u), h(h) {} }; priority_queue<Node> pq; int bfs() { memset(d, -1, sizeof(d)); d[1] = 0; queue<int> q; q.push(1); while (!q.empty()) { int u = q.front(); q.pop(); for (int v : G[u]) if (d[v] == -1) { d[v] = d[u] + 1; q.push(v); } } int ans = 1, maxm = 0; for (int i = 2; i <= n; i++) if (d[i] > maxm) { maxm = d[i]; ans = i; } return ans; } int dfs(int u, int fa) { for (int v : G[u]) if (v != fa) h[u] = max(h[u], dfs(v, u) + 1); if (fa) pq.push(Node(u, h[u])); return h[u]; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } int root = bfs(); dfs(root, 0); cout << 1; int cnt = 1; for (int i = 2; i <= n; i++) { if (cnt == n) { cout << << n; continue; } int cur = 0; while (!pq.empty()) { Node u = pq.top(); pq.pop(); if (!vis[u.u]) { cur = u.u; break; } } for (;;) { cnt++; vis[cur] = true; if (!h[cur]) break; for (int v : G[cur]) if (h[v] == h[cur] - 1) { cur = v; break; } } cout << << cnt; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> f; long long fib[100] = {0}; int solve(long long n) { int what[100] = {0}; int ind = -1; for (int i = 90; i >= 0; i--) { if (n >= fib[i]) { n -= fib[i], what[i] = true; if (ind == -1) ind = i; } } vector<int> x, y; x.push_back(1); y.push_back(0); int zero = 0, f = 1; for (int i = 0; i <= ind; i++) { if (what[i] == 0) zero++; else { int z1 = (zero / 2) * (x.back() + y.back()); if (zero & 1 && !f) z1 += x.back(); int z2 = x.back() + y.back(); x.push_back(z1); y.push_back(z2); zero = 0; f = false; } } return x.back() + y.back(); } int main() { fib[0] = 1; fib[1] = 2; for (int i = 2; i <= 90; i++) fib[i] = fib[i - 1] + fib[i - 2]; int T; long long n; cin >> T; while (T--) { cin >> n; cout << solve(n) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 2e9 + 1e8; const long long INF = 2e18 + 1e17; const int mod = 998244353; const int MOD = 1e9 + 7; long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } bool is_prime(int x) { if (x <= 1 || (x % 2 == 0 && x > 2)) return false; for (int i = 3; i * i <= x; i += 2) { if (!(x % i)) { return false; } } return true; } const int MAXN = 40010; int N; string str; vector<int> arr; int ans; int main() { cin >> N >> str; arr.resize(N); int sum = 0; for (int i = 0; i < str.length(); i++) { arr[i] = (str[i] == ) ? -1 : 1); sum += arr[i]; } if (sum != 0) { cout << -1 << endl; return 0; } int cur = 0, last = 0; bool bad = false; for (int i = 0; i < N; i++) { cur += arr[i]; if (!bad && cur < 0) { bad = true; last = i; } else if (cur == 0 && bad) { ans += (i - last + 1); bad = false; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s1, s2; cin >> s1 >> s2; int n = s1.size(); int m = s2.size(); pair<pair<int, int>, pair<int, char> > parent[n + 1][m + 1][205]; int dp[n + 5][m + 5][205]; for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { for (int bal = 0; bal <= 200; bal++) { dp[i][j][bal] = 600; } } } dp[0][0][0] = 0; for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { for (int bal = 0; bal <= 200; bal++) { if (dp[i][j][bal] == 600) continue; int newI = i + (i < n && s1[i] == ( ); int newJ = j + (j < m && s2[j] == ( ); if (bal + 1 < 205 && dp[newI][newJ][bal + 1] > dp[i][j][bal] + 1) { dp[newI][newJ][bal + 1] = dp[i][j][bal] + 1; parent[newI][newJ][bal + 1] = make_pair(make_pair(i, j), make_pair(bal, ( )); } newI = i + (i < n && s1[i] == ) ); newJ = j + (j < m && s2[j] == ) ); if (bal > 0 && dp[newI][newJ][bal - 1] > dp[i][j][bal] + 1) { dp[newI][newJ][bal - 1] = dp[i][j][bal] + 1; parent[newI][newJ][bal - 1] = make_pair(make_pair(i, j), make_pair(bal, ) )); } } } } int cBal = 0; for (int bal = 0; bal <= 200; bal++) { if (dp[n][m][bal] + bal < dp[n][m][cBal] + cBal) { cBal = bal; } } int ci = n, cj = m; string res = string(cBal, ) ); while (ci > 0 || cj > 0 || cBal != 0) { int nci = parent[ci][cj][cBal].first.first; int ncj = parent[ci][cj][cBal].first.second; int ncBal = parent[ci][cj][cBal].second.first; res += parent[ci][cj][cBal].second.second; ci = nci; cj = ncj; cBal = ncBal; } reverse(res.begin(), res.end()); cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int DEBUG = 0; double Min(double a, double b) { return (a < b ? a : b); } double Max(double a, double b) { return (a > b ? a : b); } double Abs(double a) { return (a >= 0 ? a : -a); } void print1d(int *vec, int M, const char *str = NULL) { if (str != NULL) printf( %s , str); for (int i = 0; i < M; i++) { if (i > 0) printf( ); printf( %d , vec[i]); } printf( n ); } struct NODE { double t, v; }; int compare_NODE_inc(const void *a_, const void *b_) { NODE *a = (NODE *)a_; NODE *b = (NODE *)b_; if (a->t > b->t) return 1; else if (a->t < b->t) return -1; else return 0; } int main(int argc, char **argv) { DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; int n; double a, d; cin >> n >> a >> d; NODE bus[n]; for (int i = 0; i < n; i++) { cin >> bus[i].t >> bus[i].v; } qsort(bus, n, sizeof(NODE), compare_NODE_inc); double prevt = 0; double tim; for (int i = 0; i < n; i++) { double t = bus[i].t; double v = bus[i].v; if (v * v >= 2.0 * a * d) { tim = t + sqrt(2.0 * d / a); } else { tim = t + (1.0 * d / v + 1.0 * v / 2.0 / a); } prevt = Max(tim, prevt); printf( %.10f n , prevt); } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:8000000 ) int main() { int n; scanf( %d , &n); if (n % 2 == 1) { printf( -1 ); return 0; } for (int k = 0; k != n; ++k) for (int i = 0; i != n; ++i) { for (int j = 0; j != n; ++j) if ((j % 4 < 2) ^ (k % 2 == 0) ^ (i % 4 < 2)) printf( b ); else printf( w ); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; string a = 01234567891011121314151617181920212223242526272829303132333435363738394041 42434445464748495051525354555657585960616263646566676869707172737475767778 79808182838485868788899091929394959697989910010110210310410510610710810911 01111121131141151161171181191201211221231241251261271281291301311321331341 35136137138139140141142143144145146147148149150151152153154155156157158159 16016116216316416516616716816917017117217317417517617717817918018118218318 41851861871881891901911921931941951961971981992002012022032042052062072082 09210211212213214215216217218219220221222223224225226227228229230231232233 23423523623723823924024124224324424524624724824925025125225325425525625725 82592602612622632642652662672682692702712722732742752762772782792802812822 83284285286287288289290291292293294295296297298299300301302303304305306307 30830931031131231331431531631731831932032132232332432532632732832933033133 23333343353363373383393403413423433443453463473483493503513523533543553563 57358359360361362363364365366367368369370371372373374375376377378379380381 38238338438538638738838939039139239339439539639739839940040140240340440540 64074084094104114124134144154164174184194204214224234244254264274284294304 31432433434435436437438439440441442443444445446447448449450451452453454455 45645745845946046146246346446546646746846947047147247347447547647747847948 04814824834844854864874884894904914924934944954964974984995005015025035045 05506507508509510511512513514515516517518519520521522523524525526527528529 53053153253353453553653753853954054154254354454554654754854955055155255355 45555565575585595605615625635645655665675685695705715725735745755765775785 79580581582583584585586587588589590591592593594595596597598599600601602603 60460560660760860961061161261361461561661761861962062162262362462562662762 86296306316326336346356366376386396406416426436446456466476486496506516526 53654655656657658659660661662663664665666667668669670671672673674675676677 67867968068168268368468568668768868969069169269369469569669769869970070170 27037047057067077087097107117127137147157167177187197207217227237247257267 27728729730731732733734735736737738739740741742743744745746747748749750751 75275375475575675775875976076176276376476576676776876977077177277377477577 67777787797807817827837847857867877887897907917927937947957967977987998008 01802803804805806807808809810811812813814815816817818819820821822823824825 82682782882983083183283383483583683783883984084184284384484584684784884985 08518528538548558568578588598608618628638648658668678688698708718728738748 75876877878879880881882883884885886887888889890891892893894895896897898899 90090190290390490590690790890991091191291391491591691791891992092192292392 49259269279289299309319329339349359369379389399409419429439449459469479489 49950951952953954955956957958959960961962963964965966967968969970971972973 97497597697797897998098198298398498598698798898999099199299399499599699799 89991000 ; long int d; int main() { cin >> d; cout << a[d]; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; double l, v1, v2; scanf( %d%lf%lf%lf%d , &n, &l, &v1, &v2, &k); int num = n / k; if (num * k < n) { num++; } double w = (v1 + v2) * v2 / (2 * v1 * v2 * num + v2 * v2 - v1 * v2) * l; double t = w / v2 + (l - w) / v1; printf( %.10lf n , t); } |
#include <bits/stdc++.h> using namespace std; void SOLVE(int, int); int main() { int A, B; cin >> A >> B; SOLVE(A, B); return 0; } void SOLVE(int A, int B) { int T1 = min(A, B); int T2 = (A + B) / 2; cout << T1 << << abs(T2 - T1) << endl; } |
#include <bits/stdc++.h> using namespace std; const int Hash = 743; const int Mod = 51123987; int powh[2000005], N, h1[2000005], h2[2000005], start[2000005], finish[2000005], a[2000005], b[2000005]; char s[2000005]; int getsub1(int lo, int hi) { return lo == 0 ? h1[hi] : h1[hi] - h1[lo - 1] * powh[hi - lo + 1]; } int getsub2(int lo, int hi) { return hi == N - 1 ? h2[lo] : h2[lo] - h2[hi + 1] * powh[hi - lo + 1]; } int main(void) { powh[0] = 1; for (int i = 1; i < 2000005; ++i) powh[i] = powh[i - 1] * Hash; scanf( %d %s , &N, s); int ch = 0; for (int i = 0; i < N; ++i) { ch = ch * Hash + s[i]; h1[i] = ch; } ch = 0; for (int i = N - 1; i >= 0; --i) { ch = ch * Hash + s[i]; h2[i] = ch; } long long tot = 0; for (int i = 0; i < N; ++i) { int lo = 1, hi = min(i + 1, N - i), mid, ans = 1; while (lo <= hi) { mid = (lo + hi) / 2; int s1 = getsub1(i, i + mid - 1); int s2 = getsub2(i - mid + 1, i); if (s1 == s2) { lo = mid + 1; ans = mid; } else hi = mid - 1; } tot += ans; tot %= Mod; a[i - ans + 1] += 1; a[i + 1] -= 1; b[i] += 1; b[i + ans] -= 1; } for (int i = 0; i + 1 < N; ++i) { if (s[i] != s[i + 1]) continue; int lo = 1, hi = min(i + 1, N - (i + 1)), mid, ans = 1; while (lo <= hi) { mid = (lo + hi) / 2; int s1 = getsub1(i + 1, i + mid); int s2 = getsub2(i - mid + 1, i); if (s1 == s2) { lo = mid + 1; ans = mid; } else hi = mid - 1; } tot += ans; tot %= Mod; a[i - ans + 1] += 1; a[i + 1] -= 1; b[i + 1] += 1; b[i + 1 + ans] -= 1; } for (int i = 0; i < N; ++i) { a[i] %= Mod; b[i] %= Mod; a[i] += Mod; b[i] += Mod; start[i] = (i == 0) ? a[i] : start[i - 1] + a[i]; finish[i] = (i == 0) ? b[i] : finish[i - 1] + b[i]; start[i] %= Mod; finish[i] %= Mod; } int sf = 0, sol = 0; for (int i = 0; i < N; ++i) { sol = (sol + (long long)(start[i]) * (long long)(sf) % Mod) % Mod; sf = (sf + finish[i]) % Mod; } cout << ((long long)(tot) * (tot - 1) / 2 - sol + Mod) % Mod << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> v[100000 + 1]; long long n, m; long long taken[100000 + 1]; map<int, int> v2; int check = 0, sum; void bfs() { queue<long long> q; long long j, x, y; for (int i = 1; i <= n; i++) { if (taken[i] == 0) { q.push(i); check = 0; while (!q.empty()) { x = q.front(); q.pop(); v2[x] = 1; for (j = 0; j < v[x].size(); j++) { y = v[x][j]; if (taken[y] == 0) { q.push(y); taken[y] = 1; } else if (taken[y] == 1 && v2[y] == 0) { check = 1; } } } if (check == 0) { sum = sum + 1; } } } } int main() { long long i, x, y; cin >> n >> m; for (i = 1; i <= m; i++) { cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } sum = 0; bfs(); cout << sum << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { int a, b, c, d; cin >> a >> b >> c; d = (a + b + c) / 3; int ans = min(a, b); ans = min(d, ans); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline bool chkmin(T &x, T y) { return y < x ? x = y, 1 : 0; } template <class T> inline bool chkmax(T &x, T y) { return x < y ? x = y, 1 : 0; } inline long long Max(long long x, long long y) { return x > y ? x : y; } inline long long Min(long long x, long long y) { return x < y ? x : y; } int n, m; long long fac[1002], inv[1002]; long long dp[47][1002], ans[1002][47]; void Add(long long &x, long long y) { x += y; if (x >= 1000000007) x -= 1000000007; } long long C(int n, int m) { if (n < 0 || m > n) return 0; return fac[n] * inv[m] % 1000000007 * inv[n - m] % 1000000007; } void Init() { fac[0] = fac[1] = 1; for (int i = (2), i_end_ = (1002); i < i_end_; i++) fac[i] = fac[i - 1] * i % 1000000007; inv[0] = inv[1] = 1; for (int i = (2), i_end_ = (1002); i < i_end_; i++) inv[i] = (1000000007 - (1000000007 / i)) * inv[1000000007 % i] % 1000000007; for (int i = (2), i_end_ = (1002); i < i_end_; i++) inv[i] = inv[i] * inv[i - 1] % 1000000007; dp[0][0] = 1; for (int i = (1), i_end_ = (47); i < i_end_; i++) for (int j = (i * (i + 1) / 2), j_end_ = (1002); j < j_end_; j++) Add(dp[i][j] = dp[i][j - i], dp[i - 1][j - i]); for (int i = (1), i_end_ = (1002); i < i_end_; i++) { for (int k = (1), k_end_ = (47); k < k_end_; k++) { for (int j = (k * (k + 1) / 2), j_end_ = (i); j <= j_end_; j++) Add(ans[i][k], C(i - j + k, k) * dp[k][j] % 1000000007); ans[i][k] = ans[i][k] * fac[k] % 1000000007; } } } int main() { Init(); int cas; cin >> cas; while (cas--) { scanf( %d%d , &n, &m); printf( %I64d n , m >= 45 ? 0 : ans[n][m]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100 * 1000 + 19; const int MASK = 20; const int inf = 2e9 + 19; long long n, m, dp[1 << MASK][MASK + 1]; string s[MAX_N]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < m; i++) { long long tmp = 0; for (int j = 0; j < n; j++) tmp += ((1 << j) * (s[j][i] == 1 )); dp[tmp][0]++; } for (int i = 1; i <= n; i++) { for (int j = i; j >= 1; j--) { for (int mask = 0; mask < (1 << n); mask++) dp[mask][j] += dp[mask ^ (1 << (i - 1))][j - 1]; } } long long ans = inf; for (int mask = 0; mask < (1 << n); mask++) { long long sum = 0; for (long long j = 0; j <= n; j++) sum += dp[mask][j] * min(j, n - j); ans = min(ans, sum); } cout << ans; return (0); } |
#include <bits/stdc++.h> using namespace std; const int MAX = 100100; int n, m; long long h[MAX], t[MAX]; bool can(int cur, int last, int nxt, long long val) { if (t[last] >= h[cur]) return val >= t[nxt] - h[cur]; if (t[nxt] <= h[cur]) return val >= h[cur] - t[last]; return val >= min((h[cur] - t[last]) + (t[nxt] - t[last]), (t[nxt] - h[cur]) + (t[nxt] - t[last])); } bool check(long long val) { int last = 1; for (int i = 1; i <= n; ++i) { int j = last; while (j <= m && can(i, last, j, val)) ++j; last = j; } return last == m + 1; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %I64d , h + i); for (int i = 1; i <= m; ++i) scanf( %I64d , t + i); long long low = 0, high = 20000000000LL, mid; while (low <= high) { mid = (low + high) >> 1; if (check(mid)) high = mid - 1; else low = mid + 1; } printf( %I64d n , high + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; double a[1 << 19]; double ans; int n, r, w; int main() { scanf( %d%d , &n, &r); w = 1 << n; for (register int i = 0; i < w; i++) { scanf( %lf , &a[i]); ans += a[i]; } printf( %.6lf n , ans / w); while (r--) { int pos; double x; scanf( %d%lf , &pos, &x); ans -= a[pos]; a[pos] = x; ans += a[pos]; printf( %.6lf n , ans / w); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; void DBG() { cerr << ] << endl; } template <class H, class... T> void DBG(H h, T... t) { cerr << to_string(h); if (sizeof...(t)) cerr << , ; DBG(t...); } int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); int n; cin >> n; vector<vector<long long>> a(n, vector<long long>(3)); for (int i = 0; i < n; ++i) { cin >> a[i][0] >> a[i][1] >> a[i][2]; } vector<bool> vis(n); for (int i = 0; i < n; ++i) { long long bonus = 0, cnt = 0; if (vis[i]) continue; for (int j = i + 1; j < n; ++j) { if (vis[j]) continue; a[j][2] -= max(0LL, (a[i][0] - cnt)); ++cnt; a[j][2] -= bonus; if (a[j][2] < 0) { vis[j] = true; bonus += a[j][1]; } } } vector<int> ans; for (int i = 0; i < n; ++i) { if (!vis[i]) { ans.push_back(i + 1); } } cout << ((int)(ans).size()) << n ; for (auto &A : ans) cout << A << ; } |
#include <bits/stdc++.h> using namespace std; struct node { int t, l, r, m; } op[5010]; int a[5010], b[5010], n, m; bool solve() { int p, i, k; for (i = 1; i <= n; i++) { a[i] = 1000000000; } memset(b, 0, sizeof(b)); for (p = 1; p <= m; p++) { if (op[p].t == 1) for (i = op[p].l; i <= op[p].r; i++) b[i] += op[p].m; else for (i = op[p].l; i <= op[p].r; i++) a[i] = min(a[i], op[p].m - b[i]); } memset(b, 0, sizeof(b)); for (p = 1; p <= m; p++) { if (op[p].t == 1) for (i = op[p].l; i <= op[p].r; i++) b[i] += op[p].m; else { k = -1000000007; for (i = op[p].l; i <= op[p].r; i++) k = max(k, a[i] + b[i]); if (k != op[p].m) return false; } } return true; } int main() { int i; scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d%d%d , &op[i].t, &op[i].l, &op[i].r, &op[i].m); } if (!solve()) { printf( NO n ); } else { printf( YES n ); for (i = 1; i <= n; i++) printf( %d , a[i]); cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { int n; int value; vector<int> next; } p[100010]; queue<struct point> q; int main() { int n, m, x, y, flag = 1, t; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d %d , &x, &y); p[x].next.push_back(y); p[x].n++; p[y].next.push_back(x); p[y].n++; } for (int i = 1; i <= n; i++) { if (!flag) break; if (p[i].n && !p[i].value) { p[i].value = 1; q.push(p[i]); while (!q.empty()) { for (int j = 0; j < q.front().n; j++) { if (!p[q.front().next[j]].value) { p[q.front().next[j]].value = q.front().value % 2 + 1; q.push(p[q.front().next[j]]); } else { if (p[q.front().next[j]].value != q.front().value % 2 + 1) { flag = 0; break; } } } q.pop(); } } } if (flag) { int ans = 0; for (int i = 1; i <= n; i++) { if (p[i].value == 1) ans++; } printf( %d n , ans); for (int i = 1; i <= n; i++) { if (p[i].value == 1) { printf( %d , i); } } printf( n ); ans = 0; for (int i = 1; i <= n; i++) { if (p[i].value == 2) ans++; } printf( %d n , ans); for (int i = 1; i <= n; i++) { if (p[i].value == 2) { printf( %d , i); } } } else { printf( -1 ); } } |
#include <bits/stdc++.h> using namespace std; const int N = 16, K = 225; struct HASH { size_t operator()(const pair<long long, long long> &x) const { return hash<long long>()((x.first) ^ ((x.second) << 32)); } }; int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0}; int n, m; int len = 0; long long pw[N]; string str[N]; unordered_map<pair<long long, long long>, int, HASH> dis; bool good(pair<long long, long long> p, int i, int j) { int cur = (i * m + j); for (int k = 0; k < len - 1 - 5; k++) if (p.first / pw[k] % K == cur) return false; for (int k = 0; k < min(len - 1, 5); k++) if (p.second / pw[k] % K == cur) return false; return true; } bool in_bound(int i, int j) { return i >= 0 && i < n && j >= 0 && j < m && str[i][j] != # ; } pair<long long, long long> getnxt(pair<long long, long long> p, int i, int j) { p.first *= K; p.first += p.second / pw[4]; p.first %= pw[max(len - 5, 0)]; p.second *= K; p.second += (i * m + j); p.second %= pw[min(len, 5)]; return p; } int main() { pw[0] = 1; for (int i = 1; i < 6; i++) pw[i] = pw[i - 1] * K; cin >> n >> m; for (int i = 0; i < n; i++) cin >> str[i]; pair<long long, long long> ori; queue<pair<long long, long long> > que; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { char c = str[i][j]; if (c >= 1 && c <= 9 ) { int x = c - 0 ; len = max(len, x); x--; if (x >= 5) ori.first += (i * m + j) * pw[x - 5]; else ori.second += (i * m + j) * pw[x]; } } } que.push(ori); dis[ori] = 0; while (!que.empty()) { pair<long long, long long> p = que.front(); que.pop(); int curdis = dis[p]; int ci = (int)(p.second % K / m), cj = (int)(p.second % K % m); for (int d = 0; d < 4; d++) { int ni = ci + dx[d], nj = cj + dy[d]; if (in_bound(ni, nj) && good(p, ni, nj)) { if (str[ni][nj] == @ ) { return cout << curdis + 1 << endl, 0; } pair<long long, long long> nxt = getnxt(p, ni, nj); if (!dis.count(nxt)) { que.push(nxt); dis[nxt] = curdis + 1; } } } } cout << -1 << endl; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 5e10 + 5; int main() { bool flag = 0; int n, ans = 0, k; cin >> n; int arr[n + 5]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); k = n / 2; for (int i = 0; i < n / 2; i++) { for (int j = k; j < n; j++) { if (arr[i] * 2 <= arr[j]) { ans++; k = j + 1; break; } if (j == n - 1) { flag = 1; } } if (flag) break; } cout << n - ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int val{0}; struct Triplet { char letter; int onePosn; int otherPosn; }; int findContinuous(string s) { int j{0}; for (auto i = 0; i < s.length() - 2; i++) { if (s[i] == Q && s[i + 1] == A && s[i + 2] == Q ) { j++; } } return j; } int findLastQ(string s) { int j{0}; for (auto i = 0; i < s.length() - 1; i++) { if (s[i] == Q && s[i + 1] == A ) { for (int k = i + 2; k < s.length(); k++) { if (s[k] == Q ) { j++; } } } } return j; } int findFirstQ(string s) { int j{0}; for (auto i = 0; i < s.length() - 1; i++) { if (s[i] == A && s[i + 1] == Q ) { for (int k = 0; k < i; k++) { if (s[k] == Q ) { j++; } } } } return j; } int findDisjoint(string s) { int j{0}; for (auto i = 0; i < s.length(); i++) { int before{0}; int after{0}; if (s[i] == A ) { for (int k = 0; k < i; k++) { if (s[k] == Q ) { before++; } } for (int k = i + 1; k < s.length(); k++) { if (s[k] == Q ) { after++; } } j += before * after; } } return j; } int main() { string s; cin >> s; int n = findDisjoint(s); cout << n; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T, class L> bool smax(T& x, L y) { return x < y ? (x = y, 1) : 0; } template <class T, class L> bool smin(T& x, L y) { return x > y ? (x = y, 1) : 0; } const int maxn = 2e5 + 17, mod = 1e9 + 7; struct Seg { int lazy[maxn << 2], s[maxn << 2]; void build(int l = 0, int r = maxn, int id = 1) { s[id] = r - l; if (r - l < 2) return; int mid = l + r >> 1; build(l, mid, id << 1), build(mid, r, id << 1 | 1); } Seg() { fill(lazy, lazy + (maxn << 2), 1), build(); } void shift(int id) { lazy[id << 1] = (long long)lazy[id << 1] * lazy[id] % mod, lazy[id << 1 | 1] = (long long)lazy[id << 1 | 1] * lazy[id] % mod; s[id << 1] = (long long)s[id << 1] * lazy[id] % mod, s[id << 1 | 1] = (long long)s[id << 1 | 1] * lazy[id] % mod; lazy[id] = 1; } void add(int st, int en, int v, int l = 0, int r = maxn, int id = 1) { if (st <= l && r <= en) { s[id] = (long long)s[id] * v % mod, lazy[id] = (long long)lazy[id] * v % mod; return; } if (en <= l || r <= st) return; shift(id); int mid = l + r >> 1; add(st, en, v, l, mid, id << 1), add(st, en, v, mid, r, id << 1 | 1); s[id] = (s[id << 1] + s[id << 1 | 1]) % mod; } int get(int st, int en, int l = 0, int r = maxn, int id = 1) { if (st <= l && r <= en) return s[id]; if (en <= l || r <= st) return 0; shift(id); int mid = l + r >> 1; return (get(st, en, l, mid, id << 1) + get(st, en, mid, r, id << 1 | 1)) % mod; } void add(int l, int v) { add(l, l + 1, v); } int get(int l) { return get(l, l + 1); } } d, po, bad; struct Q { int t, p, v; } q[maxn]; int rev(int a) { int b = mod - 2, ans = 1; for (; b; b >>= 1) { if (b & 1) ans = (long long)ans * a % mod; a = (long long)a * a % mod; } return ans; } int tim, st[maxn], en[maxn], nq, deg[maxn], cnt = 1; vector<int> g[maxn]; void dfs(int v = 0) { st[v] = tim++; for (auto u : g[v]) dfs(u); en[v] = tim; } void DeemoLovesInit() { int tmp; cin >> tmp >> nq; po.add(0, tmp); bad.add(0, 0); fill(deg, deg + maxn, 1); for (int i = 0; i < nq && cin >> q[i].t; i++) if (q[i].t == 1) cin >> q[i].p >> q[i].v, g[--q[i].p].push_back(cnt++); else cin >> q[i].v, q[i].v--; dfs(); cnt = 1; } int main() { DeemoLovesInit(); for (int i = 0, t = q[i].t, v = q[i].v, p = q[i].p; i < nq; i++, t = q[i].t, v = q[i].v, p = q[i].p) if (t == 1) { po.add(st[cnt], (long long)rev(po.get(st[cnt])) * v % mod * d.get(st[p]) % mod); bad.add(st[cnt], 0); deg[p]++; d.add(st[p], en[p], (long long)rev(deg[p] - 1) * deg[p] % mod); po.add(st[p], en[p], (long long)rev(deg[p] - 1) * deg[p] % mod); bad.add(st[p], en[p], (long long)rev(deg[p] - 1) * deg[p] % mod); cnt++; } else { cout << (long long)(po.get(st[v], en[v]) - bad.get(st[v], en[v]) + mod) % mod * rev(d.get(st[v])) % mod * deg[v] % mod << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int iL = 666666; char *iS, *iT, ibuf[iL]; inline char gc() { if (iS == iT) { iT = (iS = ibuf) + fread(ibuf, 1, iL, stdin); return iS == iT ? EOF : *iS++; } return *iS++; } template <class I> void gi(I &x) { static char c; static int f; for (f = 1, c = getchar(); c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (x = 0; c <= 9 && c >= 0 ; c = getchar()) x = x * 10 + (c & 15); x *= f; } const int N = 200050; int Ttag[N * 4], Tval[N * 4], T[N * 4][31]; int n, q, sig, d, l, r; int cnt(int x) { int ans = 0; for (int i = 0; i <= 30; i++) if (T[x][i]) ans++; return ans; } void clear(int x) { for (int i = 0; i <= 30; i++) T[x][i] = 0; Tval[x] = Ttag[x] = 0; } void add(int d, int x) { for (int i = 30; i >= 0; i--) if ((d >> i) & 1) { if (T[x][i]) d ^= T[x][i]; else { T[x][i] = d; break; } } } void Complex(int x, int lc, int rc) { clear(x); for (int i = 0; i <= 30; i++) add(T[lc][i], x), add(T[rc][i], x); add(Tval[lc] ^ Tval[rc], x); Tval[x] = Tval[lc]; } void Complex2(int x, int rc) { clear(N * 4 - 1); for (int i = 0; i <= 30; i++) add(T[x][i], N * 4 - 1), add(T[rc][i], N * 4 - 1); add(Tval[x] ^ Tval[rc], N * 4 - 1); Tval[N * 4 - 1] = Tval[x]; for (int i = 0; i <= 30; i++) T[x][i] = T[N * 4 - 1][i]; Tval[x] = Tval[N * 4 - 1]; } void build(int x, int l, int r) { clear(x); if (l == r) { gi(Tval[x]); return; } int mid = (l + r) >> 1; build(x << 1, l, mid); build(x << 1 | 1, mid + 1, r); Complex(x, x << 1, x << 1 | 1); } void push_down(int x) { int lc = x << 1, rc = x << 1 | 1; if (Ttag[x]) { Ttag[lc] ^= Ttag[x]; Ttag[rc] ^= Ttag[x]; Tval[lc] ^= Ttag[x]; Tval[rc] ^= Ttag[x]; Ttag[x] = 0; } } void change(int x, int l, int r, int lb, int rb, int d) { if (lb <= l && r <= rb) { Tval[x] ^= d; Ttag[x] ^= d; return; } push_down(x); int mid = (l + r) >> 1; if (lb <= mid) change(x << 1, l, mid, lb, rb, d); if (rb > mid) change(x << 1 | 1, mid + 1, r, lb, rb, d); Complex(x, x << 1, x << 1 | 1); } void query(int x, int l, int r, int lb, int rb) { if (lb <= l && r <= rb) { Complex2(0, x); return; } push_down(x); int mid = (l + r) >> 1; if (lb <= mid) query(x << 1, l, mid, lb, rb); if (rb > mid) query(x << 1 | 1, mid + 1, r, lb, rb); Complex(x, x << 1, x << 1 | 1); } int main() { gi(n); gi(q); build(1, 1, n); while (q--) { gi(sig); if (sig == 1) { gi(l); gi(r); gi(d); change(1, 1, n, l, r, d); } else { gi(l); gi(r); clear(0); query(1, 1, n, l, r); printf( %d n , (1 << cnt(0))); } } return 0; } |
#pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #define _CRT_SECURE_NO_WARNINGS # include <iostream> # include <cmath> # include <algorithm> # include <stdio.h> # include <cstdint> # include <cstring> # include <string> # include <cstdlib> # include <vector> # include <bitset> # include <map> # include <queue> # include <ctime> # include <stack> # include <set> # include <list> # include <random> # include <deque> # include <functional> # include <iomanip> # include <sstream> # include <fstream> # include <complex> # include <numeric> # include <immintrin.h> # include <cassert> # include <array> # include <tuple> #ifdef LOCAL # include <opencv2/core/core.hpp> # include <opencv2/highgui/highgui.hpp> # include <opencv2/imgproc/imgproc.hpp> #endif using namespace std; // Let s define unordered map # ifdef __GNUC__ # if __cplusplus > 199711L # include <unordered_set> # include <unordered_map> # else # include <tr1/unordered_map> # include <tr1/unordered_set> using namespace tr1; # endif # else # include <unordered_map> # include <unordered_set> # endif #define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1)) #define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple #define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N #define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__)) #define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs) #define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs) #define macro_dispatcher___(macro, nargs) macro ## nargs #define DBN1(a) cerr<<#a<< = <<(a)<< n #define DBN2(a,b) cerr<<#a<< = <<(a)<< , <<#b<< = <<(b)<< n #define DBN3(a,b,c) cerr<<#a<< = <<(a)<< , <<#b<< = <<(b)<< , <<#c<< = <<(c)<< n #define DBN4(a,b,c,d) cerr<<#a<< = <<(a)<< , <<#b<< = <<(b)<< , <<#c<< = <<(c)<< , <<#d<< = <<(d)<< n #define DBN5(a,b,c,d,e) cerr<<#a<< = <<(a)<< , <<#b<< = <<(b)<< , <<#c<< = <<(c)<< , <<#d<< = <<(d)<< , <<#e<< = <<(e)<< n #define DBN6(a,b,c,d,e,f) cerr<<#a<< = <<(a)<< , <<#b<< = <<(b)<< , <<#c<< = <<(c)<< , <<#d<< = <<(d)<< , <<#e<< = <<(e)<< , <<#f<< = <<(f)<< n #define DBN(...) macro_dispatcher(DBN, __VA_ARGS__)(__VA_ARGS__) #define DA(a,n) cerr<<#a<< =[ ; printarray(a,n); cerr<< ] n #define DAR(a,n,s) cerr<<#a<< [ <<s<< - <<n-1<< ]=[ ; printarray(a,n,s); cerr<< ] n #ifdef _MSC_VER #define PREFETCH(ptr, rw, level) ((void)0) #else #define PREFETCH(ptr, rw, level) __builtin_prefetch(ptr, rw, level) #endif #ifdef LOCAL #define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl #else #define CURTIME() #endif #define mp make_pair typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<long long, long long> pll; typedef vector<int> vi; typedef vector<long long> vll; typedef int itn; template<class T1, class T2, class T3> struct triple{ T1 a; T2 b; T3 c; triple() : a(T1()), b(T2()), c(T3()) {}; triple(T1 _a, T2 _b, T3 _c) :a(_a), b(_b), c(_c){} }; template<class T1, class T2, class T3> bool operator<(const triple<T1,T2,T3>&t1,const triple<T1,T2,T3>&t2){if(t1.a!=t2.a)return t1.a<t2.a;else if(t1.b!=t2.b)return t1.b<t2.b;else return t1.c<t2.c;} template<class T1, class T2, class T3> bool operator>(const triple<T1,T2,T3>&t1,const triple<T1,T2,T3>&t2){if(t1.a!=t2.a)return t1.a>t2.a;else if(t1.b!=t2.b)return t1.b>t2.b;else return t1.c>t2.c;} #define tri triple<int,int,int> #define trll triple<ll,ll,ll> #define FI(n) for(int i=0;i<(n);++i) #define FJ(n) for(int j=0;j<(n);++j) #define FK(n) for(int k=0;k<(n);++k) #define FL(n) for(int l=0;l<(n);++l) #define FQ(n) for(int q=0;q<(n);++q) #define FOR(i,a,b) for(int i = (a), __e = (int) (b); i < __e; ++i) #define all(a) std::begin(a), std::end(a) #define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin()) #define sqr(x) ((x) * (x)) #define sqrt(x) sqrt(1.0 * (x)) #define pow(x, n) pow(1.0 * (x), n) #define COMPARE(obj) [&](const std::decay_t<decltype(obj)>& a, const std::decay_t<decltype(obj)>& b) #define COMPARE_BY(obj, field) [&](const std::decay_t<decltype(obj)>& a, const std::decay_t<decltype(obj)>& b) { return a.field < b.field; } #define checkbit(n, b) (((n) >> (b)) & 1) #define setbit(n, b) ((n) | (static_cast<std::decay_t<decltype(n)>>(1) << (b))) #define removebit(n, b) ((n) & ~(static_cast<std::decay_t<decltype(n)>>(1) << (b))) #define flipbit(n, b) ((n) ^ (static_cast<std::decay_t<decltype(n)>>(1) << (b))) inline int countBits(uint v){v=v-((v>>1)&0x55555555);v=(v&0x33333333)+((v>>2)&0x33333333);return((v+(v>>4)&0xF0F0F0F)*0x1010101)>>24;} inline int countBits(ull v){uint t=v>>32;uint p=(v & ((1ULL << 32) - 1)); return countBits(t) + countBits(p); } inline int countBits(ll v){return countBits((ull)v); } inline int countBits(int v){return countBits((uint)v); } unsigned int reverseBits(uint x){ x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1)); x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2)); x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4)); x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8)); return((x >> 16) | (x << 16)); } template<class T> inline int sign(T x){ return x > 0 ? 1 : x < 0 ? -1 : 0; } inline bool isPowerOfTwo(int x){ return (x != 0 && (x&(x - 1)) == 0); } constexpr ll power(ll x, int p) { return p == 0 ? 1 : (x * power(x, p - 1)); } template<class T1, class T2, class T3> T1 inline clamp(T1 x, const T2& a, const T3& b) { if (x < a) return a; else if (x > b) return b; else return x; } unsigned long long rdtsc() { unsigned long long ret = 0; #ifdef __clang__ return __builtin_readcyclecounter(); #endif #ifndef _MSC_VER asm volatile( rdtsc : =A (ret) : :); #endif return ret; } // Fast IO ******************************************************************************************************** const int __BS = 4096; static char __bur[__BS + 16], *__er = __bur + __BS, *__ir = __er; template<class T = int> T readInt() { auto c = [&]() { if (__ir == __er) std::fill(__bur, __bur + __BS, 0), cin.read(__bur, __BS), __ir = __bur; }; c(); while (*__ir && (*__ir < 0 || *__ir > 9 ) && *__ir != - ) ++__ir; c(); bool m = false; if (*__ir == - ) ++__ir, c(), m = true; T r = 0; while (*__ir >= 0 && *__ir <= 9 ) r = r * 10 + *__ir - 0 , ++__ir, c(); ++__ir; return m ? -r : r; } static char __buw[__BS + 20], *__iw = __buw, *__ew = __buw + __BS; template<class T> void writeInt(T x, char endc = n ) { if (x < 0) *__iw++ = - , x = -x; if (x == 0) *__iw++ = 0 ; char* s = __iw; while (x) { T t = x / 10; char c = x - 10 * t + 0 ; *__iw++ = c; x = t; } char* f = __iw - 1; while (s < f) swap(*s, *f), ++s, --f; if (__iw > __ew) cout.write(__buw, __iw - __buw), __iw = __buw; *__iw++ = endc; } template<class T> void writeStr(const T& str) { int i = 0; while (str[i]) { *__iw++ = str[i++]; if (__iw > __ew) cout.write(__buw, __iw - __buw), __iw = __buw; } } struct __FL__ { ~__FL__() { if (__iw != __buw) cout.write(__buw, __iw - __buw); } }; static __FL__ __flushVar__; //STL output ***************************************************************************************************** #define TT1 template<class T> #define TT1T2 template<class T1, class T2> #define TT1T2T3 template<class T1, class T2, class T3> TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p); TT1 ostream& operator << (ostream& os, const vector<T>& v); TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v); TT1T2 ostream& operator << (ostream& os, const multiset<T1, T2>&v); TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v); TT1T2T3 ostream& operator << (ostream& os, const map<T1, T2, T3>& v); TT1T2T3 ostream& operator << (ostream& os, const multimap<T1, T2, T3>& v); TT1T2T3 ostream& operator << (ostream& os, const triple<T1, T2, T3>& t); template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v); TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os << ( <<p.first<< , << p.second<< ) ; } TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<< [ ;for(auto& i : v) { if (!f)os << , ;os<<i;f=0;}return os << ] ; } template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<< [ ;for(auto& i : v) { if (!f)os << , ;os<<i;f=0;}return os << ] ; } TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<< [ ;for(auto& i : v) { if (!f)os << , ;os<<i;f=0;}return os << ] ; } TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<< [ ;for(auto& i : v) { if (!f)os << , ;os<<i;f=0;}return os << ] ; } TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << [ ; for (auto& ii : v) { if (!f)os << , ; os << ( << ii.first << -> << ii.second << ) ; f = 0; }return os << ] ; } TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << [ ; for (auto& ii : v) { if (!f)os << , ; os << ( << ii.first << -> << ii.second << ) ; f = 0; }return os << ] ; } TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << [ ; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << , ; f = 0; os << x; } return os << ] ; } TT1T2T3 ostream& operator << (ostream& os, const triple<T1, T2, T3>& t){ return os << ( << t.a << , << t.b << , << t.c << ) ; } TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << ; cout << endl; } //STL input ***************************************************************************************************** TT1T2T3 inline istream& operator >> (istream& os, triple<T1, T2, T3>& t); TT1T2 inline istream& operator >> (istream& os, pair<T1, T2>& p) { return os >> p.first >> p.second; } TT1 inline istream& operator >> (istream& os, vector<T>& v) { if (v.size()) for (T& t : v) os >> t; else { string s; T obj; while (s.empty()) {getline(os, s); if (!os) return os;} stringstream ss(s); while (ss >> obj) v.push_back(obj); } return os; } TT1T2T3 inline istream& operator >> (istream& os, triple<T1, T2, T3>& t) { return os >> t.a >> t.b >> t.c; } //Pair magic ***************************************************************************************************** #define PT1T2 pair<T1, T2> TT1T2 inline PT1T2 operator+(const PT1T2 &p1 , const PT1T2 &p2) { return PT1T2(p1.first + p2.first, p1.second + p2.second); } TT1T2 inline PT1T2& operator+=(PT1T2 &p1 , const PT1T2 &p2) { p1.first += p2.first, p1.second += p2.second; return p1; } TT1T2 inline PT1T2 operator-(const PT1T2 &p1 , const PT1T2 &p2) { return PT1T2(p1.first - p2.first, p1.second - p2.second); } TT1T2 inline PT1T2& operator-=(PT1T2 &p1 , const PT1T2 &p2) { p1.first -= p2.first, p1.second -= p2.second; return p1; } #undef TT1 #undef TT1T2 #undef TT1T2T3 #define FREIN(FILE) freopen(FILE, rt , stdin) #define FREOUT(FILE) freopen(FILE, wt , stdout) #ifdef LOCAL #define BEGIN_PROFILE(idx, name) int profileIdx = idx; profileName[profileIdx] = name; totalTime[profileIdx] -= rdtsc() / 1e3; #define END_PROFILE totalTime[profileIdx] += rdtsc() / 1e3; totalCount[profileIdx]++; #else #define BEGIN_PROFILE(idx, name) #define END_PROFILE #endif template<class T> inline void normmod(T &x, T m) { x %= m; if (x < 0) x += m; } template<class T1, class T2> inline T2 summodfast(T1 x, T1 y, T2 m) { T2 res = x + y; if (res >= m) res -= m; return res; } template<class T1, class T2, class T3> inline void addmodfast(T1 &x, T2 y, T3 m) { x += y; if (x >= m) x -= m; } template<class T1, class T2, class T3> inline void submodfast(T1 &x, T2 y, T3 m) { x -= y; if (x < 0) x += m; } #if INTPTR_MAX == INT32_MAX or !defined(__SIZEOF_INT128__) inline ll mulmod(ll x, ll n, ll m){ ll r = 0; normmod(x, m); normmod(n, m); while (n) { if (n & 1) r += x; x += x; if (r >= m) r -= m; if (x >= m) x -= m; n /= 2; } return r; } #else using int128 = __int128; inline ll mulmod(ll x, ll n, ll m){ return __int128(x) * n % m; } #endif inline ll powmod(ll x, ll n, ll m){ ll r = 1; normmod(x, m); while (n){ if (n & 1)r = (r*x) % m; x = (x*x) % m; n /= 2; }return r; } inline ll powmulmod(ll x, ll n, ll m) { ll res = 1; normmod(x, m); while (n){ if (n & 1)res = mulmod(res, x, m); x = mulmod(x, x, m); n /= 2; } return res; } template<class T> inline T gcd(T a, T b) { while (b) { a %= b; T t = a; a = b; b = t; } return a; } inline ll lcm(ll a, ll b){ return a / gcd(a, b) * b; } template<class T> inline T gcd(T a, T b, T c){ return gcd(gcd(a, b), c); } ll gcdex(ll a, ll b, ll& x, ll& y) { if (!a) { x = 0; y = 1; return b; } ll y1; ll d = gcdex(b % a, a, y, y1); x = y1 - (b / a) * y; return d; } template<class T> bool isPrime(T x) { if (x <= 4 || x % 2 == 0 || x % 3 == 0) return x == 2 || x == 3; for (T i = 5; i * i <= x; i += 6) if (x % i == 0 || x % (i + 2) == 0) return 0; return 1; } bool millerRabin(long long n) { if (n <= 1000) return isPrime(n); long long s = n - 1; int t = 0; while (s % 2 == 0) s /= 2, ++t; for (int a : {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) { if (!(a %= n)) return true; long long f = powmulmod(a, s, n); if (f == 1 || f == n - 1) continue; for (int i = 1; i < t; ++i) if ((f = mulmod(f, f, n)) == n - 1) goto nextp; return false; nextp:; } return true; } // Useful constants //int some_primes[7] = {24443, 100271, 1000003, 1000333, 5000321, 98765431, 1000000123}; #define T9 1000000000 #define T18 1000000000000000000LL #define INF 1011111111 #define LLINF 1000111000111000111LL #define mod 1000000007 #define EPS (double)1e-10 #define PI 3.14159265358979323846264 #define link asaxlajrewqwe #define rank wahayawehasdakw //************************************************************************************* int32_t solve(); int32_t main(int argc, char** argv) { ios_base::sync_with_stdio(0);cin.tie(0); #ifdef LOCAL // FREIN( input.txt ); // FREOUT( out.txt ); #endif return solve(); } int a[10101]; int solve() { int n, m, c; cin >> n >> m >> c; FI(n) { a[i] = INF; } int b = 0, e = 0; while (m--) { // printarray(a, n); int x; cin >> x; int pos; if (x <= c / 2) { pos = int(upper_bound(a, a + b, x) - a); if (pos == b) { ++b; } } else { pos = int(lower_bound(a + n - e, a + n, x) - a - 1); if (pos == n - 1 - e) { ++e; } } // DBN(b, e); a[pos] = x; cout << pos + 1 << endl; if (b + e == n) return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; int main() { string a; cin >> a; int sz = int(a.size()); for (__typeof(sz) i = 0; i < sz; i++) for (__typeof(sz) j = 0; j < sz; j++) if (a.substr(0, i) + a.substr(j + 1) == CODEFORCES ) { cout << YES n ; return 0; } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double EPS = 1e-10; const int OO = 2147483647; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, -1, 1}; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; map<pair<long long, long long>, long long> st; map<long long, long long> xs, ys; long long ans = 0; long long cnt = 0; while (n--) { int x, y; cin >> x >> y; ans += xs[x]++ + ys[y]++ - st[{x, y}]++; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 1; const int MOD = 1e9 + 7; long long a[MAXN], b[MAXN]; bool used[MAXN]; vector<int> g[MAXN]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n, m, cnt = 0, ans = 0; bool y = 0; cin >> n; a[1] = 1; for (int i = 2; i <= n; i++) { cin >> a[i]; } cnt = n; while (cnt != 1) { ans++; b[ans] = cnt; cnt = a[cnt]; } reverse(b + 1, b + ans + 1); cout << 1 << ; for (int i = 1; i <= ans; i++) { cout << b[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100 * 1005; bool bad[maxn]; vector<int> blocked; vector<int> g[maxn]; bool seen[maxn]; int deg[maxn]; vector<int> good; int n, m, k; bool can(double mid) { memset(bad, 0, sizeof(bad)); memset(deg, 0, sizeof(deg)); memset(seen, 0, sizeof(seen)); queue<int> q; for (int i = 0; i < n; ++i) deg[i] = ((int)((g[i]).size())); for (int i = 0; i < ((int)((blocked).size())); i++) q.push(blocked[i]); while (!q.empty()) { int u = q.front(); q.pop(); if (seen[u]) continue; seen[u] = 1; for (int i = 0; i < ((int)((g[u]).size())); i++) { int v = g[u][i]; if (bad[v]) continue; deg[v]--; if (double(deg[v] / (1.0 * ((int)((g[v]).size())))) < mid) q.push(v); } } good.clear(); for (int i = 0; i < n; ++i) if (!seen[i]) good.push_back(i); return ((int)((good).size())) > 0; } int main() { int u, v; scanf( %d %d %d , &n, &m, &k); for (int i = 0; i < k; ++i) scanf( %d , &u), --u, blocked.push_back(u); for (int i = 0; i < m; ++i) scanf( %d %d , &u, &v), --u, --v, g[u].push_back(v), g[v].push_back(u); double l = 0, r = 1.0; double ans = 0.0; for (int i = 0; i < 80; ++i) { double mid = (l + r) / 2.0; if (can(mid)) l = mid, ans = mid; else r = mid; } can(ans); assert(((int)((good).size())) <= n - k); assert(((int)((good).size())) != 0); printf( %d n , ((int)((good).size()))); for (int i = 0; i < ((int)((good).size())); i++) printf( %d , good[i] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; namespace MincostMaxFlow { const int maxn(2e5 + 5); struct Edge { int to, next, w, f; }; int first[maxn], cnt, vis[maxn], dis[maxn], S, T, pe[maxn], pv[maxn], maxflow, mincost; Edge edge[maxn * 20]; queue<int> Q; inline void Init(int _S, int _T) { cnt = mincost = maxflow = 0, S = _S, T = _T; memset(first, -1, sizeof(first)); } inline void AddEdge(int u, int v, int w, int f) { edge[cnt] = (Edge){v, first[u], w, f}, first[u] = cnt++; edge[cnt] = (Edge){u, first[v], -w, 0}, first[v] = cnt++; } inline int SPFA() { int e, u, v, inf; memset(dis, 63, sizeof(dis)), inf = dis[0]; Q.push(S), dis[S] = 0, vis[S] = 1; while (!Q.empty()) { u = Q.front(), Q.pop(); for (e = first[u]; ~e; e = edge[e].next) if (edge[e].f && dis[u] + edge[e].w < dis[v = edge[e].to]) { dis[v] = dis[u] + edge[e].w, pv[v] = u, pe[v] = e; if (!vis[v]) vis[v] = 1, Q.push(v); } vis[u] = 0; } if (dis[T] >= 0) return 0; for (v = T; v ^ S; v = pv[v]) inf = min(inf, edge[pe[v]].f); maxflow += inf, mincost += dis[T] * inf; for (v = T; v ^ S; v = pv[v]) edge[pe[v]].f -= inf, edge[pe[v] ^ 1].f += inf; return 1; } inline int MCMF() { while (SPFA()) ; return mincost; } } // namespace MincostMaxFlow using MincostMaxFlow ::AddEdge; using MincostMaxFlow ::Init; using MincostMaxFlow ::MCMF; const int inf(1e7); int n, k, a[85], c[85], S, T; int main() { int i, j, tmp; scanf( %d%d , &n, &k), k = min(k, n); for (i = 1; i <= n; ++i) scanf( %d , &a[i]); for (i = 1; i <= n; ++i) scanf( %d , &c[i]); Init(S = 0, T = n + n + 2), tmp = n + n + 1, AddEdge(S, tmp, 0, k); for (i = 1; i <= n; ++i) { AddEdge(i, i + n, -inf, 1); for (j = i + 1; j <= n; ++j) if (a[j] == a[i]) AddEdge(i + n, j, 0, 1); else AddEdge(i + n, j, c[a[j]], 1); AddEdge(i + n, T, 0, 1), AddEdge(tmp, i, c[a[i]], 1); } printf( %d n , MCMF() + n * inf); return 0; } |
#include <bits/stdc++.h> using namespace std; int N; int A[3][30]; int p3[30]; map<pair<int, int>, pair<int, signed long long> > M[2]; void solve() { int i, j, k, l, r, x, y; string s; cin >> N; p3[0] = 1; for (i = 0; i < N; i++) p3[i + 1] = p3[i] * 3; for (i = 0; i < N; i++) cin >> A[0][i] >> A[1][i] >> A[2][i]; for (signed long long mask = 0; mask < p3[min(N, 13)]; mask++) { int t[3] = {}, tm = mask; for (i = 0; i < min(N, 13); i++) { x = tm % 3, tm /= 3; if (x == 0) t[0] += A[0][i], t[1] += A[1][i]; if (x == 1) t[0] += A[0][i], t[2] += A[2][i]; if (x == 2) t[1] += A[1][i], t[2] += A[2][i]; } M[0][{t[0] - t[1], t[0] - t[2]}] = max(M[0][{t[0] - t[1], t[0] - t[2]}], {t[0] + (1LL << 29), mask}); } for (signed long long mask = 0; mask < p3[max(0, N - 13)]; mask++) { int t[3] = {}, tm = mask; for (i = 0; i < max(0, N - 13); i++) { x = tm % 3, tm /= 3; if (x == 0) t[0] += A[0][13 + i], t[1] += A[1][13 + i]; if (x == 1) t[0] += A[0][13 + i], t[2] += A[2][13 + i]; if (x == 2) t[1] += A[1][13 + i], t[2] += A[2][13 + i]; } M[1][{t[1] - t[0], t[2] - t[0]}] = max(M[1][{t[1] - t[0], t[2] - t[0]}], {t[0] + (1LL << 29), mask * p3[13]}); } signed long long co = -1LL << 40; signed long long best = -1; for (auto& r : M[1]) if (M[0].count(r.first) && r.second.first + M[0][r.first].first > co) { co = r.second.first + M[0][r.first].first; best = r.second.second + M[0][r.first].second; } if (best == -1) (void)printf( Impossible n ); else { for (i = 0; i < N; i++) { x = best % 3; best /= 3; if (x == 0) (void)printf( LM n ); if (x == 1) (void)printf( LW n ); if (x == 2) (void)printf( MW n ); } } } int main(int argc, char** argv) { string s; int i; if (argc == 1) ios::sync_with_stdio(false); for (i = 0; i < argc - 1; i++) s += argv[i + 1], s += n ; for (i = 0; i < s.size(); i++) ungetc(s[s.size() - 1 - i], stdin); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int node[100005][2]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) scanf( %d%d , &node[i][0], &node[i][1]); int ans = node[0][1] + node[0][0] - 1; bool flag = 0; for (int i = 1; i < m; i++) { int d_val = node[i][0] - node[i - 1][0]; if (abs(node[i][1] - node[i - 1][1]) > d_val) { flag = 1; break; } ans = max(ans, node[i][1]); ans = max(ans, max(node[i][1], node[i - 1][1]) + (d_val - abs(node[i][1] - node[i - 1][1])) / 2); } int syday = n - node[m - 1][0]; ans = max(ans, node[m - 1][1] + syday); if (flag) cout << IMPOSSIBLE << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 600; char graph[MAXN][MAXN]; int dx[4] = {-1, 0, 0, 1}; int dy[4] = {0, -1, 1, 0}; vector<char> op; vector<pair<int, int> > pos; bool visited[MAXN][MAXN]; void solve(int x, int y, int n, int m, int initX, int initY) { visited[x][y] = true; bool flag = false; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; if (nx >= 0 && nx < n && ny >= 0 && ny < m && graph[nx][ny] == . && !visited[nx][ny]) { if (!flag) { op.push_back( B ); pos.push_back(make_pair(x + 1, y + 1)); } flag = true; solve(nx, ny, n, m, initX, initY); } } if (!flag) { if (x == initX && y == initY) { op.push_back( B ); } else { op.push_back( R ); } pos.push_back(make_pair(x + 1, y + 1)); } else { if (!(x == initX && y == initY)) { op.push_back( D ); pos.push_back(make_pair(x + 1, y + 1)); op.push_back( R ); pos.push_back(make_pair(x + 1, y + 1)); } } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> graph[i][j]; } } memset(visited, false, sizeof(visited)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (graph[i][j] == . && !visited[i][j]) { solve(i, j, n, m, i, j); } } } int size = op.size(); printf( %d n , size); for (int i = 0; i < size; i++) { printf( %c %d %d n , op[i], pos[i].first, pos[i].second); } return 0; } |
// Author: Vinay Khilwani // Language: C++ // @vok8: Codeforces, AtCoder, LeetCode, HackerEarth, TopCoder, Google, FB, CSES, Spoj, GitHub // @vok_8: CodeChef, GFG // @vok8_khilwani: HackerRank // Never Stop Trying. // Trying to be Better than Myself. // while(true) // { // if(AC) // { // break; // } // else if(Contest Over) // { // Try. // Check out Editorial. // Understand. // Find out your Mistake. // Learn the topic (if new). // Solve Problems on that topic (if new). // Upsolve that problem. // break; // } // else // { // Try. // Use Pen-Paper. // Find errors, edge cases, etc. // continue; // } // } // Optimizations #pragma GCC optimize( O2 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( avx2 ) #pragma GCC optimize( Os ) // Libraries #include <bits/stdc++.h> using namespace std; // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; // Debugging #define dbg(a) cerr<<a<< n ; #define debug_a(a) for(auto x:a) {cerr<<x<< ;} cerr<< n ; #define debug_b(a) for(auto x:a) {cerr<< [ <<x.first<< , <<x.second<< ] << n ;} cerr<< n ; #define debug_c(a) for(auto x:a) {debug_a(x)} cerr<< n ; #define debug_d(a) for(auto x:a) {debug_b(x)} cerr<< n ; #define debug_e(a) cerr<< [ <<a.first<< , <<a.second<< ] << n ; // Defines #define fast ios_base::sync_with_stdio(false); cout.tie(NULL); cin.tie(NULL); #define loop(i,a,n) for(ll i=a; i<n; i++) #define rloop(i,a,n) for(int i=a; i>=n; i--) #define fr(i,a,n,b) for(int i=a; i<n; i+=b) #define rfr(i,a,n,b) for(int i=a; i>=n; i-=b) #define IN cin>> #define OUT cout<< #define nl n #define sz(a) int(a.size()) #define all(a) (a).begin(),(a).end() #define each(a,b) for(auto &a:b) #define pb push_back #define set_bits(a) __builtin_popcountll(a) #define ar array #define write(a) for(auto x:a) {OUT x<< ;} OUT endl; #define read(a) for(auto &x:a) {IN x;} // #define oset tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> using ll=long long int; using ld=long double; using pll=pair<ll,ll>; using pii=pair<int,int>; using vll=vector<ll>; using vi=vector<int>; const ll mod=(ll)(1e9)+7LL; const ll M=998244353LL; const int dx[4]={1,0,-1,0}; const int dy[4]={0,1,0,-1}; const ld pi=acos(-1); // General Functions ll gcd(ll a, ll b) { return (b?gcd(b,a%b):a); } ll P(ll B, ll power, ll modulo) //Fast Power { ll ans=1LL; while(power>0LL) { if(power%2LL==1LL) { ans=(ans*B)%modulo; } B=(B*B)%modulo; power/=2LL; } return ans; } bool isPrime(ll n) { if(n<=1LL) { return false; } if(n<=3LL) { return true; } if(n%2==0LL || n%3==0LL) { return false; } for(ll i=5LL; (i*i)<=n; i+=6LL) { if(n%i==0LL || n%(i+2LL)==0LL) { return false; } } return true; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll get_rand(ll l, ll r) { uniform_int_distribution<ll> uid(l,r); return uid(rng); } void vok() { fast #ifndef ONLINE_JUDGE freopen( input.txt , r ,stdin); freopen( output.txt , w ,stdout); freopen( error.txt , w ,stderr); #endif } // Global Variables const int mxN=int(1e5)+100; vector<bool> cycle; ll sizee=0; vector<bool> vis; // Solver Function(s) void dfs_cycle(int u, int p, int color[], int mark[], int par[], int& cyclenumber, vi graph[]) { // already (completely) visited vertex. if (color[u] == 2) { return; } // seen vertex, but was not completely visited -> cycle detected. // backtrack based on parents to find the complete cycle. if (color[u] == 1) { cyclenumber++; int cur = p; mark[cur] = cyclenumber; // backtrack the vertex which are // in the current cycle thats found while (cur != u) { cur = par[cur]; mark[cur] = cyclenumber; } return; } par[u] = p; // partially visited. color[u] = 1; // simple dfs on graph for (int v : graph[u]) { // if it has not been visited previously if (v == par[u]) { continue; } dfs_cycle(v, u, color, mark, par, cyclenumber, graph); } // completely visited. color[u] = 2; } void dfs(int u, vi g[]) { sizee++; vis[u]=true; each(x,g[u]) { if(!vis[x] && !cycle[x]) { dfs(x,g); } } } void solve() { int n; IN n; vi g[n+1]; loop(i,0,n) { int u,v; IN u>>v; g[u].pb(v); g[v].pb(u); } if(n==3) { OUT 6<<nl; return; } int color[n+1]; int par[n+1]; int mark[n+1]; loop(i,0,n+1) { color[i]=par[i]=mark[i]=0; } int cyclenumber = 0; int edges = n; dfs_cycle(1, 0, color, mark, par, cyclenumber, g); vis=vector<bool>(n+1,false); vll vv; cycle=vis; ll sz_cycle=0; loop(i,1,n+1) { if(mark[i]) { cycle[i]=true; sz_cycle++; } } ll ans=(ll)(sz_cycle)*(ll)(sz_cycle-1); loop(i,1,n+1) { if(cycle[i]) { sizee=0; dfs(i,g); ll add=sizee*(sizee-1)/2; // OUT i<< <<sizee<<nl; if(sizee>1) { vv.pb(sizee-1); ans+=((sizee-1)*(ll)(sz_cycle-1)*2); } ans+=add; // OUT ans<<nl; // ans+=((sizee-1)*(ll)(sz(cycle)-1)*2); // OUT ans<<nl; } } ll sum=0; ll sq=0; each(x,vv) { sum+=x; sq+=(x*x); } sum*=sum; ll temp=sum-sq; ans+=temp; OUT ans<<nl; } // Main Function int main() { vok(); int t=1; IN t; while(t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, h, m, l, r, x; cin >> n >> h >> m; vector<int> v(n, h); for (int i = 0; i < m; i++) { cin >> l >> r >> x; for (int j = l - 1; j < r; j++) { v[j] = min(v[j], x); } } long long sum = 0; for (int i = 0; i < v.size(); i++) { sum = sum + (v[i] * v[i]); } cout << sum << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s1; cin >> s1; int condition = 1; for (int i = 1; i <= s1.length(); i++) { if (s1[i] == s1[i - 1]) { condition++; if (condition == 7) { cout << YES << endl; return 0; } } else { condition = 1; } } cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; pair<int, int> point[n]; for (int i = 0; i < n; i++) { cin >> point[i].first >> point[i].second; } sort(point, point + n, [](pair<int, int> a, pair<int, int> b) { return a.first < b.first; }); long long ans = 0; long long cnt = 1; for (int i = 0; i < n - 1; i++) { if (point[i].first == point[i + 1].first) { cnt++; } else { ans += cnt * (cnt - 1) / 2; cnt = 1; } } ans += cnt * (cnt - 1) / 2; sort(point, point + n, [](pair<int, int> a, pair<int, int> b) { return a.second < b.second; }); cnt = 1; for (int i = 0; i < n - 1; i++) { if (point[i].second == point[i + 1].second) { cnt++; } else { ans += cnt * (cnt - 1) / 2; cnt = 1; } } ans += cnt * (cnt - 1) / 2; sort(point, point + n); cnt = 1; for (int i = 0; i < n - 1; i++) { if (point[i] == point[i + 1]) { cnt++; } else { ans -= cnt * (cnt - 1) / 2; cnt = 1; } } ans -= cnt * (cnt - 1) / 2; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int hoa = 0; int thuong = 0; for (int i = 0; i < s.size(); i++) { if (s[i] >= 65 && s[i] <= 90) { hoa++; } else { thuong++; } } if (thuong >= hoa) { for (int i = 0; i < s.size(); i++) { if (s[i] >= 65 && s[i] <= 90) { s[i] += 32; } } } else { for (int i = 0; i < s.size(); i++) { if (s[i] >= 97 && s[i] <= 122) { s[i] -= 32; } } } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const long long int cmod = 998244353; const long long int N = 2e5 + 5; const long long int inf = 1e16 + 2; void solve(long long int ze) { long long int n, x, t, pr = 0; cin >> n >> x; vector<long long int> ans; map<long long int, long long int> check; check[0] = 1; check[x] = 1; for (long long int i = 1; i < (1LL << n); i++) { if (!check[i]) { ans.push_back(pr ^ i); pr = i; check[i] = 1; check[i ^ x] = 1; } } cout << ans.size() << n ; for (auto x : ans) cout << x << ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int testcase = 1; long long int x = 1; while (testcase--) { solve(x++); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-8; const int mod = 1e9 + 7; const int inf = 1061109567; const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; double dp[205][205][405], p[205]; int a[205]; int main() { int n, l, tmp; cin >> n >> l >> tmp; for (int i = 1; i <= n; i++) { cin >> p[i]; p[i] /= 100; } for (int i = 1; i <= n; i++) { cin >> a[i]; } dp[0][0][200 + tmp] = 1; for (int i = 0; i < n; i++) { for (int j = 0; j <= i; j++) { for (int k = 0; k <= 400; k++) { if (a[i + 1] == -1) { if (k > 0) dp[i + 1][j + 1][k - 1] += dp[i][j][k] * p[i + 1]; dp[i + 1][j][k] += dp[i][j][k] * (1 - p[i + 1]); } else { int val = min(400, k + a[i + 1]); if (k > 0) dp[i + 1][j + 1][val] += dp[i][j][k] * p[i + 1]; dp[i + 1][j][k] += dp[i][j][k] * (1 - p[i + 1]); } } } } double ans = 0; for (int i = l; i <= n; i++) { for (int j = 200; j <= 400; j++) { ans += dp[n][i][j]; } } printf( %.8f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long in() { long long x = 0; int n = 1; char c = getchar(); while (!isdigit(c)) { n = (c == - ) ? -1 : 1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } return x * n; } const int N = 80; int n, a[N], d[5]; int f[N][N][N][2]; string s; int NOR(int x) { if (x < 0) return -x; return 0; } void UPD(int &a, int b) { if (a == -1) a = b; else a = min(a, b); } int main() { n = in(); cin >> s; s = + s; for (int i = 1; i <= n; i++) { a[i] = (s[i] == V ) ? 1 : (s[i] == K ) ? 2 : 0; d[a[i]]++; } memset(f, -1, sizeof(f)); f[0][0][0][0] = f[0][0][0][1] = 0; for (int z = 0; z <= d[0]; z++) for (int v = 0; v <= d[1]; v++) for (int k = 0; k <= d[2]; k++) for (int ov = 0; ov <= 1; ov++) if (f[z][v][k][ov] >= 0) { for (int nd = 0; nd <= 2; nd++) { if (ov == 1 && nd == 2) continue; int Z = z + (nd == 0), V = v + (nd == 1), K = k + (nd == 2); int d[5]; d[0] = z, d[1] = v, d[2] = k; int left = 0; for (int i = 1; i <= n; i++) { if (a[i] == nd && d[a[i]] == 0) break; if (d[a[i]] == 0) left++; else d[a[i]]--; } UPD(f[Z][V][K][(nd == 1)], f[z][v][k][ov] + left); } } int res = -1; for (int ov = 0; ov <= 1; ov++) UPD(res, f[d[0]][d[1]][d[2]][ov]); if (res == -1) cout << 0; else cout << res; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long mod1 = 998244353; const double pie = 3.1415926535; unsigned long long power(unsigned long long x, unsigned long long y) { if (y == 0) return 1; else { if (y % 2 == 0) return power(x * x, y / 2); else return x * power(x * x, (y - 1) / 2); } } long long mod_power(long long x, long long y, long long m) { long long r = 1; x = x % m; if (x == 0) return 0; while (y > 0) { if (y & 1) r = (r * x) % m; y = y / 2; x = (x * x) % m; } return r; } long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } vector<long long> extended_Euclid(long long a, long long b) { vector<long long> v(3); if (b == 0) { v[0] = a; v[1] = 1; v[2] = 0; return v; } else { vector<long long> v1 = extended_Euclid(b, a % b); v[0] = v1[0]; v[1] = v1[2]; v[2] = v1[1] - (a / b) * v1[2]; return v; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int TESTS = 1; cin >> TESTS; while (TESTS--) { unsigned long long a; cin >> a; unsigned long long c = 0; c = __builtin_popcount(a); cout << power(2, c) << endl; } } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long binPow(long long a, long long b) { long long x = 1, y = a; while (b) { if (b & 1) x = (x * y) % mod; y = (y * y) % mod; b >>= 1; } return x % mod; } long long inverserEuler(int n) { return binPow(n, mod - 2); } long long C(int k, int n) { vector<long long> f(n + 1, 1); for (int i = 2; i <= n; i++) f[i] = (f[i - 1] * i) % mod; return (f[n] * ((inverserEuler(f[k]) * inverserEuler(f[n - k])) % mod) % mod) % mod; } void trunghieu() { int n; cin >> n; int a[n], i, j; map<int, int> cnt; for (i = 0; i < n; ++i) cin >> a[i], cnt[a[i]]++; if (cnt.size() == 2) { map<int, int>::iterator it; it = cnt.begin(); int n1 = it->second, x1 = it->first; it++; int n2 = it->second, x2 = it->first; ; if (n1 == n2) cout << YES << endl << x1 << << x2; else cout << NO ; } else cout << NO ; } int main() { ios::sync_with_stdio(false); cin.tie(); trunghieu(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n, p, l, r, K; long long int gt[100005], rev[100005], gt1[100005]; long long int mu(long long int a, long long int n, long long int K) { if (n == 0) return 1; long long int q = mu(a, n / 2, K); if (n % 2 == 0) return q * q % K; return q * q % K * a % K; } long long int Combi(long long int n, long long int k, long long int p) { if (n < k || k < 0) return 0; long long int u = gt1[n] - gt1[n - k] - gt1[k]; long long int res = gt[n] * rev[k] % K * rev[n - k] % K; res = res * mu(p, u, K) % K; return res; } long long int solve(long long int p, long long int k) { K = 1; long long int phi = 1; for (int i = 1; i <= k; i++) K *= p; phi = K / p * (p - 1); gt[0] = rev[0] = 1; for (int i = 1; i <= 100000; i++) { gt1[i] = gt1[i - 1]; int j = i; while (j % p == 0) { j /= p; gt1[i]++; } gt[i] = gt[i - 1] * 1ll * j % K; rev[i] = mu(gt[i], phi - 1, K); } long long int res = 0; for (int m = 1; m <= n; m++) { int u = (m + l - 1) / 2 + 1; int v = (m + r) / 2; res = (res + Combi(n, m, p) * (Combi(m, u, p) - Combi(m, v + 1, p)) % K + K) % K; } return res; } vector<pair<long long int, long long int> > divi; long long int extended_euclid(long long int a, long long int b, long long int &x, long long int &y) { long long int xx = y = 0; long long int yy = x = 1; while (b) { long long int q = a / b; long long int t = b; b = a % b; a = t; t = xx; xx = x - q * xx; x = t; t = yy; yy = y - q * yy; y = t; } return a; } long long int CRT(long long int m1, long long int r1, long long int m2, long long int r2) { long long int s, t; extended_euclid(r1, r2, s, t); long long int K = r1 * r2; long long int res = (m2 - m1) * s % K * r1 % K; res = (res + m1 + K) % K; return res; } long long int val[100005]; long long int mod[100005]; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cin >> n >> p >> l >> r; if (p == 1) { cout << 0 << endl; return 0; } for (int i = 2; i <= p / i; i++) { if (p % i == 0) { int cnt = 0; while (p % i == 0) { p /= i; cnt++; } divi.push_back(pair<long long int, long long int>(i, cnt)); } } if (p > 1) divi.push_back(pair<long long int, long long int>(p, 1)); for (int i = 0; i < divi.size(); i++) { val[i] = solve(divi[i].first, divi[i].second); mod[i] = 1; for (int j = 1; j <= divi[i].second; j++) mod[i] *= divi[i].first; } long long int res = val[0]; long long int M = mod[0]; for (int i = 1; i < divi.size(); i++) { res = CRT(res, M, val[i], mod[i]); M *= mod[i]; } if (l == 0) res = (res + 1) % M; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int s, n, m, t, x, y; vector<int> ord; vector<vector<int>> g; bool vis[200010]; void dfs(int c) { vis[c] = true; for (auto &v : g[c]) { if (!vis[v]) dfs(v); } ord.push_back(c); } int main() { std::istream::sync_with_stdio(false); cin >> s; while (s--) { cin >> n >> m; vector<pair<int, int>> edges; g = vector<vector<int>>(n + 1); for (int i = 0; i < m; i++) { cin >> t >> x >> y; if (t == 1) { g[x].push_back(y); } edges.emplace_back(x, y); } ord.clear(); memset(vis, 0, sizeof(vis)); for (int i = 1; i <= n; i++) { if (!vis[i]) dfs(i); } vector<int> pos(n + 1); reverse(ord.begin(), ord.end()); for (int i = 0; i < n; i++) { pos[ord[i]] = i; } bool flag = false; for (int i = 1; i <= n; i++) { for (auto &v : g[i]) { if (pos[i] > pos[v]) flag = true; } } if (flag) { cout << NO << endl; continue; } else { cout << YES << endl; for (auto &v : edges) { if (pos[v.first] < pos[v.second]) { cout << v.first << << v.second << endl; } else { cout << v.second << << v.first << endl; } } } } } |
#include <bits/stdc++.h> using namespace std; int n, l, top, tmp, m, c[12]; bool opt[12][11][1 << 13]; void Search(int t, int v, int sum, int u, int i) { if (v < 0) return; if (sum >= v) opt[t][sum - v][u | (1 << t)] = 1; if (i >= t) return; if (((u >> i) & 1) == 1 && c[i] + 1 < c[t]) Search(t, v - c[i], sum, u ^ (1 << i), i + 1); Search(t, v, sum, u, i + 1); } bool Check() { for (int i = 0; i < l; i++) if (c[i] == 2) return 0; return 1; } int main() { scanf( %d , &n); l = 0; for (int i = 0; i < n; i++) { scanf( %d , &tmp); if (tmp > 1) c[l++] = tmp; } if (l > n / 2) { printf( NO n ); return 0; } if (l == 0) { if (n > 1) printf( NO n ); else printf( YES n ); return 0; } sort(c, c + l); top = n - l - c[0] + 1; opt[0][top][1] = 1; for (int i = 1; i < l; i++) for (int t = 0; t <= top; t++) { m = 1 << i; for (int u = 0; u < m; u++) if (opt[i - 1][t][u]) Search(i, c[i] - 1, t, u, 0); } if (opt[l - 1][0][1 << (l - 1)] && Check()) printf( YES n ); else printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[100010]; long long ans = 0; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int Q = 0; Q < 20; Q++) { for (int j = 1; j <= n; j++) if (a[j] & (1 << Q)) { int k = 0; for (k = j; k <= n && (a[k] & (1 << Q)); k++) ; k--; ans += ((long long)(k - j + 1) * (k - j + 2) / 2) << Q; j = k; } } for (int P = 1; P <= m; P++) { int p, v; scanf( %d%d , &p, &v); for (int Q = 0; Q < 20; Q++) if ((a[p] & (1 << Q)) ^ (v & (1 << Q))) { int l, r; for (l = p - 1; l && (a[l] & (1 << Q)); l--) ; for (r = p + 1; r <= n && (a[r] & (1 << Q)); r++) ; l = p - l; r -= p; if ((v >> Q) & 1) ans += ((long long)l * r) << Q; else ans -= ((long long)l * r) << Q; } a[p] = v; printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; char c; cin >> n >> m; vector<int> rows(n), cols(m); vector<vector<bool> > A(n); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { cin >> c; if (c == * ) { A[i].push_back(true); rows[i]++; cols[j]++; } else A[i].push_back(false); } long long res = 0; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (A[i][j]) res += (cols[j] - 1) * (rows[i] - 1); cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); vector<vector<int>> t(n); for (int i = 0; i < m; ++i) { int x, y; scanf( %d %d , &x, &y); --x, --y; t[x].push_back(y); t[y].push_back(x); } vector<int> dist(n * n, -1); vector<pair<int, int>> parent(n * n, make_pair(-1, -1)); vector<bool> order(n * n, false); queue<pair<int, int>> q; q.push(make_pair(0, n - 1)); dist[n - 1] = 0; while (!q.empty()) { auto p = q.front(); q.pop(); if (p.first == n - 1 && p.second == 0) { int len = dist[(n - 1) * n]; printf( %d n , len); vector<int> r1, r2; r1.push_back(n - 1); r2.push_back(0); int pos1 = n - 1, pos2 = 0; while (pos1 != 0 || pos2 != n - 1) { int tmp = pos1; pos1 = parent[pos1 * n + pos2].first; pos2 = parent[tmp * n + pos2].second; r1.push_back(pos1); r2.push_back(pos2); } for (int i = len; i >= 0; --i) printf( %d , r1[i] + 1); printf( n ); for (int i = len; i >= 0; --i) printf( %d , r2[i] + 1); printf( n ); return 0; } for (auto i : t[p.first]) { if (order[i * n + p.second]) continue; order[i * n + p.second] = true; for (auto j : t[p.second]) { if (i != j && dist[i * n + j] == -1) { parent[i * n + j] = p; dist[i * n + j] = dist[p.first * n + p.second] + 1; q.push(make_pair(i, j)); } } } } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mo = 1e9 + 7; const int N = 200005; map<int, int> mx, my; int n, x, y, dx, dy, cnt, answer; int parent[N], Size[N]; bool flag[N]; int get_parent(int x) { if (parent[x] == x) { return x; } else { return get_parent(parent[x]); } } int main() { cin >> n; for (int i = 1; i <= 2 * n; ++i) { parent[i] = i; Size[i] = 1; } for (int i = 1; i <= n; ++i) { cin >> x >> y; if (mx.find(x) != mx.end()) { dx = mx[x]; } else { dx = mx[x] = ++cnt; } if (my.find(y) != my.end()) { dy = my[y]; } else { dy = my[y] = ++cnt; } dx = get_parent(dx); dy = get_parent(dy); if (dx == dy) { flag[dx] = 1; } else { if (Size[dx] > Size[dy]) swap(dx, dy); parent[dx] = dy; Size[dy] += Size[dx]; flag[dy] |= flag[dx]; } } answer = 1; for (int i = 1; i <= cnt; ++i) { if (get_parent(i) == i) { int temp = 1; for (int j = 1; j <= Size[i]; ++j) { temp = temp * 2 % mo; } if (!flag[i]) --temp; answer = (long long)answer * temp % mo; } } cout << answer << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, x; cin >> n >> x; int mins = 0; int prevr = 1; for (int i = 0; i < int(n); i++) { int l, r; cin >> l >> r; mins += ((l - prevr) % x + ((r - l) + 1)); prevr = r + 1; } cout << mins << endl; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { long long int res = 1; a %= 1000000007; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; } return res; } long long int modInverse(long long int a) { return power(a, 1000000007 - 2); } const int N = 500023; bool compare(long long int x, long long int y) { return x > y; } void solve() { vector<int> primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997}; int n, value, nocolor = 1, colored = 0; cin >> n; vector<pair<int, int>> color; for (int i = 0; i < n; i++) { cin >> value; color.push_back(make_pair(value, 0)); } for (int i = 0; i < primes.size(); i++) { for (int j = 0; j < n; j++) { if ((color[j].first % primes[i] == 0) && (color[j].second == 0)) { color[j].second = nocolor; colored = 1; } } if (colored) { nocolor++; } colored = 0; } cout << nocolor - 1 << endl; for (int i = 0; i < n; i++) { cout << color[i].second << ; } cout << endl; return; } int main() { { ios ::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; int T; cin >> T; int t = 0; while (t++ < T) { solve(); } cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; } |
#include <bits/stdc++.h> using namespace std; int n, a[100001], t, l, r; int _gcd[262144][19], _min[262144][19], _num[262144][19]; int gcd(int x, int y) { if (x < y) swap(x, y); if (y == 0) return x; int r = x % y; return gcd(y, r); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { _min[i][0] = a[i]; _gcd[i][0] = a[i]; _num[i][0] = 1; } for (int k = 1; k <= 18; k++) { for (int i = 1; i <= n; i++) { if (_min[i][k - 1] == _min[i + (1 << (k - 1))][k - 1]) { _min[i][k] = _min[i][k - 1]; _num[i][k] = _num[i][k - 1] + _num[i + (1 << (k - 1))][k - 1]; } else if (_min[i][k - 1] < _min[i + (1 << (k - 1))][k - 1]) { _min[i][k] = _min[i][k - 1]; _num[i][k] = _num[i][k - 1]; } else { _min[i][k] = _min[i + (1 << (k - 1))][k - 1]; _num[i][k] = _num[i + (1 << (k - 1))][k - 1]; } } } for (int k = 1; k <= 18; k++) for (int i = 1; i <= n; i++) _gcd[i][k] = gcd(_gcd[i][k - 1], _gcd[i + (1 << (k - 1))][k - 1]); scanf( %d , &t); for (int j = 1; j <= t; j++) { scanf( %d , &l); scanf( %d , &r); int tmp = r - l + 1; int k = log2(r - l + 1); int GCD = gcd(_gcd[l][k], _gcd[r - (1 << k) + 1][k]); int ans = 0; int pos = l; for (int i = 0; i <= 20; i++) { if ((tmp & (1 << i)) > 0) { if (_min[pos][i] == GCD) ans += _num[pos][i]; pos += (1 << i); } } printf( %d n , tmp - ans); } } |
#include <bits/stdc++.h> using namespace std; int dp[2005][2005][2][2]; int m, d, mod = 1e9 + 7; string a, b; int solve(int i, int mm, bool aa, bool bb) { if (i == a.size()) return !mm; int &x = dp[i][mm][aa][bb]; if (x != -1) return x; x = 0; for (int j = 0; j <= 9; j++) { if (i % 2 && j != d || !(i % 2) && j == d) continue; if (!aa && a[i] - 0 > j || !bb && b[i] - 0 < j) continue; bool na = aa | a[i] - 0 < j, nb = bb | b[i] - 0 > j; x = (x + solve(i + 1, (mm * 10 + j) % m, na, nb)) % mod; } return x; } int main() { cin >> m >> d >> a >> b; memset(dp, -1, sizeof dp); cout << solve(0, 0, 0, 0); } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long linf = 1e18; const double pi = acos(-1.0); const int MAXN = 150000 + 10; const int MAXM = 1e5 + 10; const double eps = 1e-8; bool du[MAXN]; vector<int> g[MAXN]; bool vis[MAXN]; int sum; bool flag; void dfs(int u, int num) { if (!flag) return; vis[u] = 1; ++sum; for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; if (vis[v]) continue; if (num != g[v].size()) { flag = 0; return; } dfs(v, num); } } int main() { int n, m; scanf( %d%d , &n, &m); while (m--) { int u, v; scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } flag = 1; for (int i = 1; i <= n; ++i) { if (!vis[i]) { sum = 0; dfs(i, g[i].size()); if (g[i].size() != sum - 1) flag = 0; } if (!flag) break; } puts(flag ? YES : NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int t; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> t; while (t--) { string s; cin >> s; s = 0 + s; s = s + 0 ; for (int i = 1; i <= s.size(); i++) { if (s[i] == ? ) { if (s[i - 1] == a ) { if (s[i + 1] == b ) { s[i] = c ; } else { s[i] = b ; } } else { if (s[i - 1] == b ) { if (s[i + 1] == a ) { s[i] = c ; } else { s[i] = a ; } } else { if (s[i + 1] == b ) { s[i] = a ; } else { s[i] = b ; } } } } } bool b = 1; for (int i = 1; i <= s.size(); i++) { if (s[i] == s[i - 1]) { b = 0; } } if (b) { for (int i = 1; i <= s.size() - 2; i++) { cout << s[i]; } } else { cout << -1 ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int mas[21][21]; int n, m; inline bool checkarr() { for (int i = 0; i < n; i++) { int wrongs = 0; for (int j = 0; j < m; j++) { if (mas[i][j] != j + 1) wrongs++; if (wrongs > 2) return false; } } return true; } inline void swapa(int a, int b) { for (int j = 0; j < n; j++) { int t = mas[j][a]; mas[j][a] = mas[j][b]; mas[j][b] = t; } } int main() { cin >> n >> m; int i, j; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> mas[i][j]; } } if (checkarr()) { cout << YES ; return 0; } for (i = 0; i < m; i++) { for (j = i + 1; j < m; j++) { swapa(i, j); if (checkarr()) { cout << YES ; return 0; } swapa(i, j); } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mxN = 1e5 + 5; const long long INF = 1e18; const long long mod = 1e9 + 7; signed main() { long long n; cin >> n; vector<string> v(n); for (long long i = 0; i < n; i++) { cin >> v[i]; } map<long long, long long> o, c; long long per = 0; for (long long i = 0; i < n; i++) { string s = v[i]; stack<long long> st; for (auto x : s) { if (st.empty()) { st.push(x); } else { if (x == ) ) { if (st.top() == ( ) st.pop(); else st.push(x); } else st.push(x); } } if (st.empty()) per++; else { long long open = 0, closing = 0; while (!st.empty()) { if (st.top() == ) ) open++; else closing++; st.pop(); } if (open == 0) { c[closing]++; } if (closing == 0) { o[open]++; } } } long long ans = per / 2; for (auto x : o) { ans += min(x.second, c[x.first]); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int a, c, d[205], f, n, b, x, i; string s, s1, s11, s12; char i1, i2, j; int main() { cin >> n; for (i = 1; i <= n; i++) { cin >> s1; b = s1.size(); c = c + b; s = s + % ; s = s + s1; } c = c + n - 1; for (i1 = a ; i1 <= z ; i1++) { s1 = i1; x = s.find(s1); if (x == -1) { cout << s1; return 0; } } for (i1 = a ; i1 <= z ; i1++) { for (i2 = a ; i2 <= z ; i2++) { s11 = i1; s12 = i2; s1 = s11 + s12; x = s.find(s1); if (x == -1) { cout << s1; return 0; } } } } |
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<int> cur; unordered_set<long long> bad; unordered_set<int> was; void err() { cout << impossible << endl; exit(0); } void go(int x) { cur.push_back(x); vector<int> g; for (auto it = was.begin(); it != was.end(); it++) if (bad.count(x * 1000000ll + (*it)) == 0) g.push_back(*it); for (int i = 0; i < g.size(); i++) was.erase(g[i]); for (int i = 0; i < g.size(); i++) go(g[i]); } int main() { ios::sync_with_stdio(false); cin >> n >> m >> k; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; x--; y--; bad.insert(x * 1000000ll + y); bad.insert(y * 1000000ll + x); } for (int i = 1; i < n; i++) was.insert(i); vector<vector<int> > comps; for (int i = 1; i < n; i++) if (was.count(i)) { cur.clear(); was.erase(i); go(i); comps.push_back(cur); } int sum = 0; for (int i = 0; i < comps.size(); i++) { int cnt = 0; for (int j = 0; j < comps[i].size(); j++) if (bad.count(comps[i][j]) == 0) cnt++; if (cnt == 0) err(); sum += cnt; } if (k < comps.size() || k > sum) err(); cout << possible << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long int n, k, a[222], i; cin >> n >> k; for (i = 1; i <= 2 * n + 1; i++) { cin >> a[i]; } for (i = 2; i <= 2 * n; i += 2) { if ((a[i] - a[i - 1] > 1) && (a[i] - a[i + 1] > 1) && k > 0) { a[i]--; k--; } } for (i = 1; i <= 2 * n + 1; i++) { cout << a[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Tp> inline void read(Tp &x) { static bool neg; static char c; x = 0, neg = 0, c = getchar(); for (; !isdigit(c); c = getchar()) { if (c == - ) { neg = 1; } } for (; isdigit(c); c = getchar()) { x = x * 10 + c - 0 ; } if (neg) { x = -x; } } const int INF = 0x3f3f3f3f; const int N = 3e3 + 5; const int M = 2e4 + 5; const int K = 1e5 + 5; int vis[N][N], dp[N][N]; int n, m, k; int head[N], E = 0; struct Edge { int to, next; } e[M * 2]; inline void addEdge(int u, int v) { e[++E] = (Edge){v, head[u]}; head[u] = E; } namespace Trie { unordered_map<int, unordered_map<int, unordered_set<int>>> store; inline void set(int a, int b, int c) { store[a][b].insert(c); } inline bool get(int a, int b, int c) { return (bool)store[a][b].count(c); } } // namespace Trie int main() { read(n), read(m), read(k); for (int i = 0, u, v; i < m; ++i) { read(u), read(v); addEdge(u, v); addEdge(v, u); } for (int i = 0, a, b, c; i < k; ++i) { read(a), read(b), read(c); Trie::set(a, b, c); } memset(vis, -1, sizeof(vis)); memset(dp, 0x3f, sizeof(dp)); dp[0][1] = 0; queue<pair<int, int>> q; q.emplace((pair<int, int>){0, 1}); while (!q.empty()) { pair<int, int> u = q.front(); q.pop(); int a = u.first, b = u.second, c; for (int i = head[b]; i; i = e[i].next) { c = e[i].to; if (vis[b][c] == -1) { if (!Trie::get(a, b, c)) { vis[b][c] = a; dp[b][c] = dp[a][b] + 1; q.emplace((pair<int, int>){b, c}); } } } } int ans = INF, ansPos; for (int i = 1; i <= n; ++i) { if (dp[i][n] < ans) { ans = dp[i][n]; ansPos = i; } } if (ans == INF) { puts( -1 ); return 0; } else { printf( %d n , ans); vector<int> vec; vec.emplace_back(n); vec.emplace_back(ansPos); int u = ansPos, v = n; while (u != 1) { int t = v; v = u; u = vis[u][t]; vec.emplace_back(u); } for (auto it = vec.rbegin(); it != vec.rend(); ++it) { printf( %d , *it); } } } |
#include <bits/stdc++.h> using namespace std; void add(int& a, int b) { a += b; a = min(a, 100000000); } const int MX = 300005; int root[MX]; bool is_left[MX]; vector<int> nodes[MX]; int left_size[MX], right_size[MX]; int ans = 0; char s[MX]; vector<int> comps[MX]; int main() { int n, k; ignore = scanf( %d %d , &n, &k); ignore = scanf( %s , s + 1); for (int i = 1; i <= k; i++) { int c; ignore = scanf( %d , &c); while (c--) { int x; ignore = scanf( %d , &x); comps[x].push_back(i); } } for (int i = 1; i <= k; i++) { root[i] = i; is_left[i] = false; nodes[i].push_back(i); right_size[i] = 1; } for (int i = 1; i <= n; i++) { if (comps[i].size() == 1) { int x = comps[i][0]; ans -= min(left_size[root[x]], right_size[root[x]]); if (s[i] == 0 ) { if (is_left[x]) { add(right_size[root[x]], MX); } else { add(left_size[root[x]], MX); } } else { if (is_left[x]) { add(left_size[root[x]], MX); } else { add(right_size[root[x]], MX); } } ans += min(left_size[root[x]], right_size[root[x]]); } else if (comps[i].size() == 2) { int x = comps[i][0], y = comps[i][1]; if (root[x] != root[y]) { ans -= min(left_size[root[x]], right_size[root[x]]); ans -= min(left_size[root[y]], right_size[root[y]]); if (nodes[root[x]].size() > nodes[root[y]].size()) { swap(x, y); } if ((is_left[x] == is_left[y]) != (s[i] == 1 )) { for (int v : nodes[root[x]]) is_left[v] = !is_left[v]; swap(left_size[root[x]], right_size[root[x]]); } add(left_size[root[y]], left_size[root[x]]); add(right_size[root[y]], right_size[root[x]]); for (int v : nodes[root[x]]) { nodes[root[y]].push_back(v); root[v] = root[y]; } ans += min(left_size[root[x]], right_size[root[x]]); } } printf( %d n , ans); } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.